1 //===-- llvmAsmParser.y - Parser for llvm assembly files ---------*- C++ -*--=//
3 // This file implements the bison parser for LLVM assembly languages files.
5 //===------------------------------------------------------------------------=//
8 #include "ParserInternals.h"
9 #include "llvm/SymbolTable.h"
10 #include "llvm/Module.h"
11 #include "llvm/iTerminators.h"
12 #include "llvm/iMemory.h"
13 #include "llvm/iOperators.h"
14 #include "llvm/iPHINode.h"
15 #include "Support/STLExtras.h"
16 #include "Support/DepthFirstIterator.h"
21 int yyerror(const char *ErrorMsg); // Forward declarations to prevent "implicit
22 int yylex(); // declaration" of xxx warnings.
25 static Module *ParserResult;
26 std::string CurFilename;
28 // DEBUG_UPREFS - Define this symbol if you want to enable debugging output
29 // relating to upreferences in the input stream.
31 //#define DEBUG_UPREFS 1
33 #define UR_OUT(X) std::cerr << X
38 #define YYERROR_VERBOSE 1
40 // HACK ALERT: This variable is used to implement the automatic conversion of
41 // load/store instructions with indexes into a load/store + getelementptr pair
42 // of instructions. When this compatiblity "Feature" is removed, this should be
45 static BasicBlock *CurBB;
48 // This contains info used when building the body of a function. It is
49 // destroyed when the function is completed.
51 typedef std::vector<Value *> ValueList; // Numbered defs
52 static void ResolveDefinitions(std::vector<ValueList> &LateResolvers,
53 std::vector<ValueList> *FutureLateResolvers = 0);
55 static struct PerModuleInfo {
56 Module *CurrentModule;
57 std::vector<ValueList> Values; // Module level numbered definitions
58 std::vector<ValueList> LateResolveValues;
59 std::vector<PATypeHolder> Types;
60 std::map<ValID, PATypeHolder> LateResolveTypes;
62 // GlobalRefs - This maintains a mapping between <Type, ValID>'s and forward
63 // references to global values. Global values may be referenced before they
64 // are defined, and if so, the temporary object that they represent is held
65 // here. This is used for forward references of ConstantPointerRefs.
67 typedef std::map<std::pair<const PointerType *,
68 ValID>, GlobalVariable*> GlobalRefsType;
69 GlobalRefsType GlobalRefs;
72 // If we could not resolve some functions at function compilation time
73 // (calls to functions before they are defined), resolve them now... Types
74 // are resolved when the constant pool has been completely parsed.
76 ResolveDefinitions(LateResolveValues);
78 // Check to make sure that all global value forward references have been
81 if (!GlobalRefs.empty()) {
82 std::string UndefinedReferences = "Unresolved global references exist:\n";
84 for (GlobalRefsType::iterator I = GlobalRefs.begin(), E =GlobalRefs.end();
86 UndefinedReferences += " " + I->first.first->getDescription() + " " +
87 I->first.second.getName() + "\n";
89 ThrowException(UndefinedReferences);
92 Values.clear(); // Clear out function local definitions
98 // DeclareNewGlobalValue - Called every time a new GV has been defined. This
99 // is used to remove things from the forward declaration map, resolving them
100 // to the correct thing as needed.
102 void DeclareNewGlobalValue(GlobalValue *GV, ValID D) {
103 // Check to see if there is a forward reference to this global variable...
104 // if there is, eliminate it and patch the reference to use the new def'n.
105 GlobalRefsType::iterator I =
106 GlobalRefs.find(std::make_pair(GV->getType(), D));
108 if (I != GlobalRefs.end()) {
109 GlobalVariable *OldGV = I->second; // Get the placeholder...
110 I->first.second.destroy(); // Free string memory if neccesary
112 // Loop over all of the uses of the GlobalValue. The only thing they are
113 // allowed to be is ConstantPointerRef's.
114 assert(OldGV->use_size() == 1 && "Only one reference should exist!");
115 User *U = OldGV->use_back(); // Must be a ConstantPointerRef...
116 ConstantPointerRef *CPR = cast<ConstantPointerRef>(U);
118 // Change the const pool reference to point to the real global variable
119 // now. This should drop a use from the OldGV.
120 CPR->mutateReferences(OldGV, GV);
121 assert(OldGV->use_empty() && "All uses should be gone now!");
123 // Remove OldGV from the module...
124 CurrentModule->getGlobalList().remove(OldGV);
125 delete OldGV; // Delete the old placeholder
127 // Remove the map entry for the global now that it has been created...
134 static struct PerFunctionInfo {
135 Function *CurrentFunction; // Pointer to current function being created
137 std::vector<ValueList> Values; // Keep track of numbered definitions
138 std::vector<ValueList> LateResolveValues;
139 std::vector<PATypeHolder> Types;
140 std::map<ValID, PATypeHolder> LateResolveTypes;
141 bool isDeclare; // Is this function a forward declararation?
143 inline PerFunctionInfo() {
148 inline ~PerFunctionInfo() {}
150 inline void FunctionStart(Function *M) {
154 void FunctionDone() {
155 // If we could not resolve some blocks at parsing time (forward branches)
156 // resolve the branches now...
157 ResolveDefinitions(LateResolveValues, &CurModule.LateResolveValues);
159 // Make sure to resolve any constant expr references that might exist within
160 // the function we just declared itself.
162 if (CurrentFunction->hasName()) {
163 FID = ValID::create((char*)CurrentFunction->getName().c_str());
165 unsigned Slot = CurrentFunction->getType()->getUniqueID();
166 assert(CurModule.Values.size() > Slot && "Function not inserted?");
167 // Figure out which slot number if is...
168 for (unsigned i = 0; ; ++i) {
169 assert(i < CurModule.Values[Slot].size() && "Function not found!");
170 if (CurModule.Values[Slot][i] == CurrentFunction) {
171 FID = ValID::create((int)i);
176 CurModule.DeclareNewGlobalValue(CurrentFunction, FID);
178 Values.clear(); // Clear out function local definitions
183 } CurMeth; // Info for the current function...
185 static bool inFunctionScope() { return CurMeth.CurrentFunction != 0; }
188 //===----------------------------------------------------------------------===//
189 // Code to handle definitions of all the types
190 //===----------------------------------------------------------------------===//
192 static int InsertValue(Value *D,
193 std::vector<ValueList> &ValueTab = CurMeth.Values) {
194 if (D->hasName()) return -1; // Is this a numbered definition?
196 // Yes, insert the value into the value table...
197 unsigned type = D->getType()->getUniqueID();
198 if (ValueTab.size() <= type)
199 ValueTab.resize(type+1, ValueList());
200 //printf("Values[%d][%d] = %d\n", type, ValueTab[type].size(), D);
201 ValueTab[type].push_back(D);
202 return ValueTab[type].size()-1;
205 // TODO: FIXME when Type are not const
206 static void InsertType(const Type *Ty, std::vector<PATypeHolder> &Types) {
210 static const Type *getTypeVal(const ValID &D, bool DoNotImprovise = false) {
212 case ValID::NumberVal: { // Is it a numbered definition?
213 unsigned Num = (unsigned)D.Num;
215 // Module constants occupy the lowest numbered slots...
216 if (Num < CurModule.Types.size())
217 return CurModule.Types[Num];
219 Num -= CurModule.Types.size();
221 // Check that the number is within bounds...
222 if (Num <= CurMeth.Types.size())
223 return CurMeth.Types[Num];
226 case ValID::NameVal: { // Is it a named definition?
227 std::string Name(D.Name);
228 SymbolTable *SymTab = 0;
230 if (inFunctionScope()) {
231 SymTab = &CurMeth.CurrentFunction->getSymbolTable();
232 N = SymTab->lookup(Type::TypeTy, Name);
236 // Symbol table doesn't automatically chain yet... because the function
237 // hasn't been added to the module...
239 SymTab = &CurModule.CurrentModule->getSymbolTable();
240 N = SymTab->lookup(Type::TypeTy, Name);
244 D.destroy(); // Free old strdup'd memory...
245 return cast<Type>(N);
248 ThrowException("Internal parser error: Invalid symbol type reference!");
251 // If we reached here, we referenced either a symbol that we don't know about
252 // or an id number that hasn't been read yet. We may be referencing something
253 // forward, so just create an entry to be resolved later and get to it...
255 if (DoNotImprovise) return 0; // Do we just want a null to be returned?
257 std::map<ValID, PATypeHolder> &LateResolver = inFunctionScope() ?
258 CurMeth.LateResolveTypes : CurModule.LateResolveTypes;
260 std::map<ValID, PATypeHolder>::iterator I = LateResolver.find(D);
261 if (I != LateResolver.end()) {
265 Type *Typ = OpaqueType::get();
266 LateResolver.insert(std::make_pair(D, Typ));
270 static Value *lookupInSymbolTable(const Type *Ty, const std::string &Name) {
271 SymbolTable &SymTab =
272 inFunctionScope() ? CurMeth.CurrentFunction->getSymbolTable() :
273 CurModule.CurrentModule->getSymbolTable();
274 return SymTab.lookup(Ty, Name);
277 // getValNonImprovising - Look up the value specified by the provided type and
278 // the provided ValID. If the value exists and has already been defined, return
279 // it. Otherwise return null.
281 static Value *getValNonImprovising(const Type *Ty, const ValID &D) {
282 if (isa<FunctionType>(Ty))
283 ThrowException("Functions are not values and "
284 "must be referenced as pointers");
287 case ValID::NumberVal: { // Is it a numbered definition?
288 unsigned type = Ty->getUniqueID();
289 unsigned Num = (unsigned)D.Num;
291 // Module constants occupy the lowest numbered slots...
292 if (type < CurModule.Values.size()) {
293 if (Num < CurModule.Values[type].size())
294 return CurModule.Values[type][Num];
296 Num -= CurModule.Values[type].size();
299 // Make sure that our type is within bounds
300 if (CurMeth.Values.size() <= type) return 0;
302 // Check that the number is within bounds...
303 if (CurMeth.Values[type].size() <= Num) return 0;
305 return CurMeth.Values[type][Num];
308 case ValID::NameVal: { // Is it a named definition?
309 Value *N = lookupInSymbolTable(Ty, std::string(D.Name));
310 if (N == 0) return 0;
312 D.destroy(); // Free old strdup'd memory...
316 // Check to make sure that "Ty" is an integral type, and that our
317 // value will fit into the specified type...
318 case ValID::ConstSIntVal: // Is it a constant pool reference??
319 if (!ConstantSInt::isValueValidForType(Ty, D.ConstPool64))
320 ThrowException("Signed integral constant '" +
321 itostr(D.ConstPool64) + "' is invalid for type '" +
322 Ty->getDescription() + "'!");
323 return ConstantSInt::get(Ty, D.ConstPool64);
325 case ValID::ConstUIntVal: // Is it an unsigned const pool reference?
326 if (!ConstantUInt::isValueValidForType(Ty, D.UConstPool64)) {
327 if (!ConstantSInt::isValueValidForType(Ty, D.ConstPool64)) {
328 ThrowException("Integral constant '" + utostr(D.UConstPool64) +
329 "' is invalid or out of range!");
330 } else { // This is really a signed reference. Transmogrify.
331 return ConstantSInt::get(Ty, D.ConstPool64);
334 return ConstantUInt::get(Ty, D.UConstPool64);
337 case ValID::ConstFPVal: // Is it a floating point const pool reference?
338 if (!ConstantFP::isValueValidForType(Ty, D.ConstPoolFP))
339 ThrowException("FP constant invalid for type!!");
340 return ConstantFP::get(Ty, D.ConstPoolFP);
342 case ValID::ConstNullVal: // Is it a null value?
343 if (!isa<PointerType>(Ty))
344 ThrowException("Cannot create a a non pointer null!");
345 return ConstantPointerNull::get(cast<PointerType>(Ty));
347 case ValID::ConstantVal: // Fully resolved constant?
348 if (D.ConstantValue->getType() != Ty)
349 ThrowException("Constant expression type different from required type!");
350 return D.ConstantValue;
353 assert(0 && "Unhandled case!");
357 assert(0 && "Unhandled case!");
362 // getVal - This function is identical to getValNonImprovising, except that if a
363 // value is not already defined, it "improvises" by creating a placeholder var
364 // that looks and acts just like the requested variable. When the value is
365 // defined later, all uses of the placeholder variable are replaced with the
368 static Value *getVal(const Type *Ty, const ValID &D) {
369 assert(Ty != Type::TypeTy && "Should use getTypeVal for types!");
371 // See if the value has already been defined...
372 Value *V = getValNonImprovising(Ty, D);
375 // If we reached here, we referenced either a symbol that we don't know about
376 // or an id number that hasn't been read yet. We may be referencing something
377 // forward, so just create an entry to be resolved later and get to it...
380 switch (Ty->getPrimitiveID()) {
381 case Type::LabelTyID: d = new BBPlaceHolder(Ty, D); break;
382 default: d = new ValuePlaceHolder(Ty, D); break;
385 assert(d != 0 && "How did we not make something?");
386 if (inFunctionScope())
387 InsertValue(d, CurMeth.LateResolveValues);
389 InsertValue(d, CurModule.LateResolveValues);
394 //===----------------------------------------------------------------------===//
395 // Code to handle forward references in instructions
396 //===----------------------------------------------------------------------===//
398 // This code handles the late binding needed with statements that reference
399 // values not defined yet... for example, a forward branch, or the PHI node for
402 // This keeps a table (CurMeth.LateResolveValues) of all such forward references
403 // and back patchs after we are done.
406 // ResolveDefinitions - If we could not resolve some defs at parsing
407 // time (forward branches, phi functions for loops, etc...) resolve the
410 static void ResolveDefinitions(std::vector<ValueList> &LateResolvers,
411 std::vector<ValueList> *FutureLateResolvers) {
412 // Loop over LateResolveDefs fixing up stuff that couldn't be resolved
413 for (unsigned ty = 0; ty < LateResolvers.size(); ty++) {
414 while (!LateResolvers[ty].empty()) {
415 Value *V = LateResolvers[ty].back();
416 assert(!isa<Type>(V) && "Types should be in LateResolveTypes!");
418 LateResolvers[ty].pop_back();
419 ValID &DID = getValIDFromPlaceHolder(V);
421 Value *TheRealValue = getValNonImprovising(Type::getUniqueIDType(ty),DID);
423 V->replaceAllUsesWith(TheRealValue);
425 } else if (FutureLateResolvers) {
426 // Functions have their unresolved items forwarded to the module late
428 InsertValue(V, *FutureLateResolvers);
430 if (DID.Type == ValID::NameVal)
431 ThrowException("Reference to an invalid definition: '" +DID.getName()+
432 "' of type '" + V->getType()->getDescription() + "'",
433 getLineNumFromPlaceHolder(V));
435 ThrowException("Reference to an invalid definition: #" +
436 itostr(DID.Num) + " of type '" +
437 V->getType()->getDescription() + "'",
438 getLineNumFromPlaceHolder(V));
443 LateResolvers.clear();
446 // ResolveTypeTo - A brand new type was just declared. This means that (if
447 // name is not null) things referencing Name can be resolved. Otherwise, things
448 // refering to the number can be resolved. Do this now.
450 static void ResolveTypeTo(char *Name, const Type *ToTy) {
451 std::vector<PATypeHolder> &Types = inFunctionScope() ?
452 CurMeth.Types : CurModule.Types;
455 if (Name) D = ValID::create(Name);
456 else D = ValID::create((int)Types.size());
458 std::map<ValID, PATypeHolder> &LateResolver = inFunctionScope() ?
459 CurMeth.LateResolveTypes : CurModule.LateResolveTypes;
461 std::map<ValID, PATypeHolder>::iterator I = LateResolver.find(D);
462 if (I != LateResolver.end()) {
463 ((DerivedType*)I->second.get())->refineAbstractTypeTo(ToTy);
464 LateResolver.erase(I);
468 // ResolveTypes - At this point, all types should be resolved. Any that aren't
471 static void ResolveTypes(std::map<ValID, PATypeHolder> &LateResolveTypes) {
472 if (!LateResolveTypes.empty()) {
473 const ValID &DID = LateResolveTypes.begin()->first;
475 if (DID.Type == ValID::NameVal)
476 ThrowException("Reference to an invalid type: '" +DID.getName() + "'");
478 ThrowException("Reference to an invalid type: #" + itostr(DID.Num));
483 // setValueName - Set the specified value to the name given. The name may be
484 // null potentially, in which case this is a noop. The string passed in is
485 // assumed to be a malloc'd string buffer, and is freed by this function.
487 // This function returns true if the value has already been defined, but is
488 // allowed to be redefined in the specified context. If the name is a new name
489 // for the typeplane, false is returned.
491 static bool setValueName(Value *V, char *NameStr) {
492 if (NameStr == 0) return false;
494 std::string Name(NameStr); // Copy string
495 free(NameStr); // Free old string
497 if (V->getType() == Type::VoidTy)
498 ThrowException("Can't assign name '" + Name +
499 "' to a null valued instruction!");
501 SymbolTable &ST = inFunctionScope() ?
502 CurMeth.CurrentFunction->getSymbolTable() :
503 CurModule.CurrentModule->getSymbolTable();
505 Value *Existing = ST.lookup(V->getType(), Name);
506 if (Existing) { // Inserting a name that is already defined???
507 // There is only one case where this is allowed: when we are refining an
508 // opaque type. In this case, Existing will be an opaque type.
509 if (const Type *Ty = dyn_cast<Type>(Existing)) {
510 if (const OpaqueType *OpTy = dyn_cast<OpaqueType>(Ty)) {
511 // We ARE replacing an opaque type!
512 ((OpaqueType*)OpTy)->refineAbstractTypeTo(cast<Type>(V));
517 // Otherwise, we are a simple redefinition of a value, check to see if it
518 // is defined the same as the old one...
519 if (const Type *Ty = dyn_cast<Type>(Existing)) {
520 if (Ty == cast<Type>(V)) return true; // Yes, it's equal.
521 // std::cerr << "Type: " << Ty->getDescription() << " != "
522 // << cast<Type>(V)->getDescription() << "!\n";
523 } else if (const Constant *C = dyn_cast<Constant>(Existing)) {
524 if (C == V) return true; // Constants are equal to themselves
525 } else if (GlobalVariable *EGV = dyn_cast<GlobalVariable>(Existing)) {
526 // We are allowed to redefine a global variable in two circumstances:
527 // 1. If at least one of the globals is uninitialized or
528 // 2. If both initializers have the same value.
530 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(V)) {
531 if (!EGV->hasInitializer() || !GV->hasInitializer() ||
532 EGV->getInitializer() == GV->getInitializer()) {
534 // Make sure the existing global version gets the initializer! Make
535 // sure that it also gets marked const if the new version is.
536 if (GV->hasInitializer() && !EGV->hasInitializer())
537 EGV->setInitializer(GV->getInitializer());
538 if (GV->isConstant())
539 EGV->setConstant(true);
540 EGV->setLinkage(GV->getLinkage());
542 delete GV; // Destroy the duplicate!
543 return true; // They are equivalent!
547 ThrowException("Redefinition of value named '" + Name + "' in the '" +
548 V->getType()->getDescription() + "' type plane!");
551 V->setName(Name, &ST);
556 //===----------------------------------------------------------------------===//
557 // Code for handling upreferences in type names...
560 // TypeContains - Returns true if Ty contains E in it.
562 static bool TypeContains(const Type *Ty, const Type *E) {
563 return find(df_begin(Ty), df_end(Ty), E) != df_end(Ty);
567 static std::vector<std::pair<unsigned, OpaqueType *> > UpRefs;
569 static PATypeHolder HandleUpRefs(const Type *ty) {
571 UR_OUT("Type '" << ty->getDescription() <<
572 "' newly formed. Resolving upreferences.\n" <<
573 UpRefs.size() << " upreferences active!\n");
574 for (unsigned i = 0; i < UpRefs.size(); ) {
575 UR_OUT(" UR#" << i << " - TypeContains(" << Ty->getDescription() << ", "
576 << UpRefs[i].second->getDescription() << ") = "
577 << (TypeContains(Ty, UpRefs[i].second) ? "true" : "false") << endl);
578 if (TypeContains(Ty, UpRefs[i].second)) {
579 unsigned Level = --UpRefs[i].first; // Decrement level of upreference
580 UR_OUT(" Uplevel Ref Level = " << Level << endl);
581 if (Level == 0) { // Upreference should be resolved!
582 UR_OUT(" * Resolving upreference for "
583 << UpRefs[i].second->getDescription() << endl;
584 std::string OldName = UpRefs[i].second->getDescription());
585 UpRefs[i].second->refineAbstractTypeTo(Ty);
586 UpRefs.erase(UpRefs.begin()+i); // Remove from upreference list...
587 UR_OUT(" * Type '" << OldName << "' refined upreference to: "
588 << (const void*)Ty << ", " << Ty->getDescription() << endl);
593 ++i; // Otherwise, no resolve, move on...
595 // FIXME: TODO: this should return the updated type
600 //===----------------------------------------------------------------------===//
601 // RunVMAsmParser - Define an interface to this parser
602 //===----------------------------------------------------------------------===//
604 Module *RunVMAsmParser(const std::string &Filename, FILE *F) {
606 CurFilename = Filename;
607 llvmAsmlineno = 1; // Reset the current line number...
609 // Allocate a new module to read
610 CurModule.CurrentModule = new Module(Filename);
611 yyparse(); // Parse the file.
612 Module *Result = ParserResult;
613 llvmAsmin = stdin; // F is about to go away, don't use it anymore...
623 Function *FunctionVal;
624 std::pair<PATypeHolder*, char*> *ArgVal;
625 BasicBlock *BasicBlockVal;
626 TerminatorInst *TermInstVal;
627 Instruction *InstVal;
630 const Type *PrimType;
631 PATypeHolder *TypeVal;
634 std::vector<std::pair<PATypeHolder*,char*> > *ArgList;
635 std::vector<Value*> *ValueList;
636 std::list<PATypeHolder> *TypeList;
637 std::list<std::pair<Value*,
638 BasicBlock*> > *PHIList; // Represent the RHS of PHI node
639 std::vector<std::pair<Constant*, BasicBlock*> > *JumpTable;
640 std::vector<Constant*> *ConstVector;
642 GlobalValue::LinkageTypes Linkage;
650 char *StrVal; // This memory is strdup'd!
651 ValID ValIDVal; // strdup'd memory maybe!
653 Instruction::BinaryOps BinaryOpVal;
654 Instruction::TermOps TermOpVal;
655 Instruction::MemoryOps MemOpVal;
656 Instruction::OtherOps OtherOpVal;
657 Module::Endianness Endianness;
660 %type <ModuleVal> Module FunctionList
661 %type <FunctionVal> Function FunctionProto FunctionHeader BasicBlockList
662 %type <BasicBlockVal> BasicBlock InstructionList
663 %type <TermInstVal> BBTerminatorInst
664 %type <InstVal> Inst InstVal MemoryInst
665 %type <ConstVal> ConstVal ConstExpr
666 %type <ConstVector> ConstVector
667 %type <ArgList> ArgList ArgListH
668 %type <ArgVal> ArgVal
669 %type <PHIList> PHIList
670 %type <ValueList> ValueRefList ValueRefListE // For call param lists
671 %type <ValueList> IndexList // For GEP derived indices
672 %type <TypeList> TypeListI ArgTypeListI
673 %type <JumpTable> JumpTable
674 %type <BoolVal> GlobalType // GLOBAL or CONSTANT?
675 %type <Linkage> OptLinkage
676 %type <Endianness> BigOrLittle
678 // ValueRef - Unresolved reference to a definition or BB
679 %type <ValIDVal> ValueRef ConstValueRef SymbolicValueRef
680 %type <ValueVal> ResolvedVal // <type> <valref> pair
681 // Tokens and types for handling constant integer values
683 // ESINT64VAL - A negative number within long long range
684 %token <SInt64Val> ESINT64VAL
686 // EUINT64VAL - A positive number within uns. long long range
687 %token <UInt64Val> EUINT64VAL
688 %type <SInt64Val> EINT64VAL
690 %token <SIntVal> SINTVAL // Signed 32 bit ints...
691 %token <UIntVal> UINTVAL // Unsigned 32 bit ints...
692 %type <SIntVal> INTVAL
693 %token <FPVal> FPVAL // Float or Double constant
696 %type <TypeVal> Types TypesV UpRTypes UpRTypesV
697 %type <PrimType> SIntType UIntType IntType FPType PrimType // Classifications
698 %token <PrimType> VOID BOOL SBYTE UBYTE SHORT USHORT INT UINT LONG ULONG
699 %token <PrimType> FLOAT DOUBLE TYPE LABEL
701 %token <StrVal> VAR_ID LABELSTR STRINGCONSTANT
702 %type <StrVal> OptVAR_ID OptAssign FuncName
705 %token IMPLEMENTATION ZEROINITIALIZER TRUE FALSE BEGINTOK ENDTOK
706 %token DECLARE GLOBAL CONSTANT
707 %token TO EXCEPT DOTDOTDOT NULL_TOK CONST INTERNAL LINKONCE APPENDING
708 %token OPAQUE NOT EXTERNAL TARGET ENDIAN POINTERSIZE LITTLE BIG
710 // Basic Block Terminating Operators
711 %token <TermOpVal> RET BR SWITCH
714 %type <BinaryOpVal> BinaryOps // all the binary operators
715 %type <BinaryOpVal> ArithmeticOps LogicalOps SetCondOps // Binops Subcatagories
716 %token <BinaryOpVal> ADD SUB MUL DIV REM AND OR XOR
717 %token <BinaryOpVal> SETLE SETGE SETLT SETGT SETEQ SETNE // Binary Comarators
719 // Memory Instructions
720 %token <MemOpVal> MALLOC ALLOCA FREE LOAD STORE GETELEMENTPTR
723 %type <OtherOpVal> ShiftOps
724 %token <OtherOpVal> PHI CALL INVOKE CAST SHL SHR VA_ARG
729 // Handle constant integer size restriction and conversion...
734 if ($1 > (uint32_t)INT32_MAX) // Outside of my range!
735 ThrowException("Value too large for type!");
740 EINT64VAL : ESINT64VAL; // These have same type and can't cause problems...
741 EINT64VAL : EUINT64VAL {
742 if ($1 > (uint64_t)INT64_MAX) // Outside of my range!
743 ThrowException("Value too large for type!");
747 // Operations that are notably excluded from this list include:
748 // RET, BR, & SWITCH because they end basic blocks and are treated specially.
750 ArithmeticOps: ADD | SUB | MUL | DIV | REM;
751 LogicalOps : AND | OR | XOR;
752 SetCondOps : SETLE | SETGE | SETLT | SETGT | SETEQ | SETNE;
753 BinaryOps : ArithmeticOps | LogicalOps | SetCondOps;
755 ShiftOps : SHL | SHR;
757 // These are some types that allow classification if we only want a particular
758 // thing... for example, only a signed, unsigned, or integral type.
759 SIntType : LONG | INT | SHORT | SBYTE;
760 UIntType : ULONG | UINT | USHORT | UBYTE;
761 IntType : SIntType | UIntType;
762 FPType : FLOAT | DOUBLE;
764 // OptAssign - Value producing statements have an optional assignment component
765 OptAssign : VAR_ID '=' {
772 OptLinkage : INTERNAL { $$ = GlobalValue::InternalLinkage; } |
773 LINKONCE { $$ = GlobalValue::LinkOnceLinkage; } |
774 APPENDING { $$ = GlobalValue::AppendingLinkage; } |
775 /*empty*/ { $$ = GlobalValue::ExternalLinkage; };
777 //===----------------------------------------------------------------------===//
778 // Types includes all predefined types... except void, because it can only be
779 // used in specific contexts (function returning void for example). To have
780 // access to it, a user must explicitly use TypesV.
783 // TypesV includes all of 'Types', but it also includes the void type.
784 TypesV : Types | VOID { $$ = new PATypeHolder($1); };
785 UpRTypesV : UpRTypes | VOID { $$ = new PATypeHolder($1); };
789 ThrowException("Invalid upreference in type: " + (*$1)->getDescription());
794 // Derived types are added later...
796 PrimType : BOOL | SBYTE | UBYTE | SHORT | USHORT | INT | UINT ;
797 PrimType : LONG | ULONG | FLOAT | DOUBLE | TYPE | LABEL;
799 $$ = new PATypeHolder(OpaqueType::get());
802 $$ = new PATypeHolder($1);
804 UpRTypes : SymbolicValueRef { // Named types are also simple types...
805 $$ = new PATypeHolder(getTypeVal($1));
808 // Include derived types in the Types production.
810 UpRTypes : '\\' EUINT64VAL { // Type UpReference
811 if ($2 > (uint64_t)INT64_MAX) ThrowException("Value out of range!");
812 OpaqueType *OT = OpaqueType::get(); // Use temporary placeholder
813 UpRefs.push_back(std::make_pair((unsigned)$2, OT)); // Add to vector...
814 $$ = new PATypeHolder(OT);
815 UR_OUT("New Upreference!\n");
817 | UpRTypesV '(' ArgTypeListI ')' { // Function derived type?
818 std::vector<const Type*> Params;
819 mapto($3->begin(), $3->end(), std::back_inserter(Params),
820 std::mem_fun_ref(&PATypeHandle::get));
821 bool isVarArg = Params.size() && Params.back() == Type::VoidTy;
822 if (isVarArg) Params.pop_back();
824 $$ = new PATypeHolder(HandleUpRefs(FunctionType::get(*$1,Params,isVarArg)));
825 delete $3; // Delete the argument list
826 delete $1; // Delete the old type handle
828 | '[' EUINT64VAL 'x' UpRTypes ']' { // Sized array type?
829 $$ = new PATypeHolder(HandleUpRefs(ArrayType::get(*$4, (unsigned)$2)));
832 | '{' TypeListI '}' { // Structure type?
833 std::vector<const Type*> Elements;
834 mapto($2->begin(), $2->end(), std::back_inserter(Elements),
835 std::mem_fun_ref(&PATypeHandle::get));
837 $$ = new PATypeHolder(HandleUpRefs(StructType::get(Elements)));
840 | '{' '}' { // Empty structure type?
841 $$ = new PATypeHolder(StructType::get(std::vector<const Type*>()));
843 | UpRTypes '*' { // Pointer type?
844 $$ = new PATypeHolder(HandleUpRefs(PointerType::get(*$1)));
848 // TypeList - Used for struct declarations and as a basis for function type
849 // declaration type lists
851 TypeListI : UpRTypes {
852 $$ = new std::list<PATypeHolder>();
853 $$->push_back(*$1); delete $1;
855 | TypeListI ',' UpRTypes {
856 ($$=$1)->push_back(*$3); delete $3;
859 // ArgTypeList - List of types for a function type declaration...
860 ArgTypeListI : TypeListI
861 | TypeListI ',' DOTDOTDOT {
862 ($$=$1)->push_back(Type::VoidTy);
865 ($$ = new std::list<PATypeHolder>())->push_back(Type::VoidTy);
868 $$ = new std::list<PATypeHolder>();
871 // ConstVal - The various declarations that go into the constant pool. This
872 // production is used ONLY to represent constants that show up AFTER a 'const',
873 // 'constant' or 'global' token at global scope. Constants that can be inlined
874 // into other expressions (such as integers and constexprs) are handled by the
875 // ResolvedVal, ValueRef and ConstValueRef productions.
877 ConstVal: Types '[' ConstVector ']' { // Nonempty unsized arr
878 const ArrayType *ATy = dyn_cast<ArrayType>($1->get());
880 ThrowException("Cannot make array constant with type: '" +
881 (*$1)->getDescription() + "'!");
882 const Type *ETy = ATy->getElementType();
883 int NumElements = ATy->getNumElements();
885 // Verify that we have the correct size...
886 if (NumElements != -1 && NumElements != (int)$3->size())
887 ThrowException("Type mismatch: constant sized array initialized with " +
888 utostr($3->size()) + " arguments, but has size of " +
889 itostr(NumElements) + "!");
891 // Verify all elements are correct type!
892 for (unsigned i = 0; i < $3->size(); i++) {
893 if (ETy != (*$3)[i]->getType())
894 ThrowException("Element #" + utostr(i) + " is not of type '" +
895 ETy->getDescription() +"' as required!\nIt is of type '"+
896 (*$3)[i]->getType()->getDescription() + "'.");
899 $$ = ConstantArray::get(ATy, *$3);
900 delete $1; delete $3;
903 const ArrayType *ATy = dyn_cast<ArrayType>($1->get());
905 ThrowException("Cannot make array constant with type: '" +
906 (*$1)->getDescription() + "'!");
908 int NumElements = ATy->getNumElements();
909 if (NumElements != -1 && NumElements != 0)
910 ThrowException("Type mismatch: constant sized array initialized with 0"
911 " arguments, but has size of " + itostr(NumElements) +"!");
912 $$ = ConstantArray::get(ATy, std::vector<Constant*>());
915 | Types 'c' STRINGCONSTANT {
916 const ArrayType *ATy = dyn_cast<ArrayType>($1->get());
918 ThrowException("Cannot make array constant with type: '" +
919 (*$1)->getDescription() + "'!");
921 int NumElements = ATy->getNumElements();
922 const Type *ETy = ATy->getElementType();
923 char *EndStr = UnEscapeLexed($3, true);
924 if (NumElements != -1 && NumElements != (EndStr-$3))
925 ThrowException("Can't build string constant of size " +
926 itostr((int)(EndStr-$3)) +
927 " when array has size " + itostr(NumElements) + "!");
928 std::vector<Constant*> Vals;
929 if (ETy == Type::SByteTy) {
930 for (char *C = $3; C != EndStr; ++C)
931 Vals.push_back(ConstantSInt::get(ETy, *C));
932 } else if (ETy == Type::UByteTy) {
933 for (char *C = $3; C != EndStr; ++C)
934 Vals.push_back(ConstantUInt::get(ETy, (unsigned char)*C));
937 ThrowException("Cannot build string arrays of non byte sized elements!");
940 $$ = ConstantArray::get(ATy, Vals);
943 | Types '{' ConstVector '}' {
944 const StructType *STy = dyn_cast<StructType>($1->get());
946 ThrowException("Cannot make struct constant with type: '" +
947 (*$1)->getDescription() + "'!");
949 if ($3->size() != STy->getNumContainedTypes())
950 ThrowException("Illegal number of initializers for structure type!");
952 // Check to ensure that constants are compatible with the type initializer!
953 for (unsigned i = 0, e = $3->size(); i != e; ++i)
954 if ((*$3)[i]->getType() != STy->getElementTypes()[i])
955 ThrowException("Expected type '" +
956 STy->getElementTypes()[i]->getDescription() +
957 "' for element #" + utostr(i) +
958 " of structure initializer!");
960 $$ = ConstantStruct::get(STy, *$3);
961 delete $1; delete $3;
964 const StructType *STy = dyn_cast<StructType>($1->get());
966 ThrowException("Cannot make struct constant with type: '" +
967 (*$1)->getDescription() + "'!");
969 if (STy->getNumContainedTypes() != 0)
970 ThrowException("Illegal number of initializers for structure type!");
972 $$ = ConstantStruct::get(STy, std::vector<Constant*>());
976 const PointerType *PTy = dyn_cast<PointerType>($1->get());
978 ThrowException("Cannot make null pointer constant with type: '" +
979 (*$1)->getDescription() + "'!");
981 $$ = ConstantPointerNull::get(PTy);
984 | Types SymbolicValueRef {
985 const PointerType *Ty = dyn_cast<PointerType>($1->get());
987 ThrowException("Global const reference must be a pointer type!");
989 // ConstExprs can exist in the body of a function, thus creating
990 // ConstantPointerRefs whenever they refer to a variable. Because we are in
991 // the context of a function, getValNonImprovising will search the functions
992 // symbol table instead of the module symbol table for the global symbol,
993 // which throws things all off. To get around this, we just tell
994 // getValNonImprovising that we are at global scope here.
996 Function *SavedCurFn = CurMeth.CurrentFunction;
997 CurMeth.CurrentFunction = 0;
999 Value *V = getValNonImprovising(Ty, $2);
1001 CurMeth.CurrentFunction = SavedCurFn;
1003 // If this is an initializer for a constant pointer, which is referencing a
1004 // (currently) undefined variable, create a stub now that shall be replaced
1005 // in the future with the right type of variable.
1008 assert(isa<PointerType>(Ty) && "Globals may only be used as pointers!");
1009 const PointerType *PT = cast<PointerType>(Ty);
1011 // First check to see if the forward references value is already created!
1012 PerModuleInfo::GlobalRefsType::iterator I =
1013 CurModule.GlobalRefs.find(std::make_pair(PT, $2));
1015 if (I != CurModule.GlobalRefs.end()) {
1016 V = I->second; // Placeholder already exists, use it...
1018 // TODO: Include line number info by creating a subclass of
1019 // TODO: GlobalVariable here that includes the said information!
1021 // Create a placeholder for the global variable reference...
1022 GlobalVariable *GV = new GlobalVariable(PT->getElementType(),
1024 GlobalValue::ExternalLinkage);
1025 // Keep track of the fact that we have a forward ref to recycle it
1026 CurModule.GlobalRefs.insert(std::make_pair(std::make_pair(PT, $2), GV));
1028 // Must temporarily push this value into the module table...
1029 CurModule.CurrentModule->getGlobalList().push_back(GV);
1034 GlobalValue *GV = cast<GlobalValue>(V);
1035 $$ = ConstantPointerRef::get(GV);
1036 delete $1; // Free the type handle
1039 if ($1->get() != $2->getType())
1040 ThrowException("Mismatched types for constant expression!");
1044 | Types ZEROINITIALIZER {
1045 $$ = Constant::getNullValue($1->get());
1049 ConstVal : SIntType EINT64VAL { // integral constants
1050 if (!ConstantSInt::isValueValidForType($1, $2))
1051 ThrowException("Constant value doesn't fit in type!");
1052 $$ = ConstantSInt::get($1, $2);
1054 | UIntType EUINT64VAL { // integral constants
1055 if (!ConstantUInt::isValueValidForType($1, $2))
1056 ThrowException("Constant value doesn't fit in type!");
1057 $$ = ConstantUInt::get($1, $2);
1059 | BOOL TRUE { // Boolean constants
1060 $$ = ConstantBool::True;
1062 | BOOL FALSE { // Boolean constants
1063 $$ = ConstantBool::False;
1065 | FPType FPVAL { // Float & Double constants
1066 $$ = ConstantFP::get($1, $2);
1070 ConstExpr: CAST '(' ConstVal TO Types ')' {
1071 $$ = ConstantExpr::getCast($3, $5->get());
1074 | GETELEMENTPTR '(' ConstVal IndexList ')' {
1075 if (!isa<PointerType>($3->getType()))
1076 ThrowException("GetElementPtr requires a pointer operand!");
1079 GetElementPtrInst::getIndexedType($3->getType(), *$4, true);
1081 ThrowException("Index list invalid for constant getelementptr!");
1083 std::vector<Constant*> IdxVec;
1084 for (unsigned i = 0, e = $4->size(); i != e; ++i)
1085 if (Constant *C = dyn_cast<Constant>((*$4)[i]))
1086 IdxVec.push_back(C);
1088 ThrowException("Indices to constant getelementptr must be constants!");
1092 $$ = ConstantExpr::getGetElementPtr($3, IdxVec);
1094 | BinaryOps '(' ConstVal ',' ConstVal ')' {
1095 if ($3->getType() != $5->getType())
1096 ThrowException("Binary operator types must match!");
1097 $$ = ConstantExpr::get($1, $3, $5);
1099 | ShiftOps '(' ConstVal ',' ConstVal ')' {
1100 if ($5->getType() != Type::UByteTy)
1101 ThrowException("Shift count for shift constant must be unsigned byte!");
1102 if (!$3->getType()->isIntegral())
1103 ThrowException("Shift constant expression requires integral operand!");
1104 $$ = ConstantExpr::getShift($1, $3, $5);
1108 // ConstVector - A list of comma separated constants.
1109 ConstVector : ConstVector ',' ConstVal {
1110 ($$ = $1)->push_back($3);
1113 $$ = new std::vector<Constant*>();
1118 // GlobalType - Match either GLOBAL or CONSTANT for global declarations...
1119 GlobalType : GLOBAL { $$ = false; } | CONSTANT { $$ = true; };
1122 //===----------------------------------------------------------------------===//
1123 // Rules to match Modules
1124 //===----------------------------------------------------------------------===//
1126 // Module rule: Capture the result of parsing the whole file into a result
1129 Module : FunctionList {
1130 $$ = ParserResult = $1;
1131 CurModule.ModuleDone();
1134 // FunctionList - A list of functions, preceeded by a constant pool.
1136 FunctionList : FunctionList Function {
1138 assert($2->getParent() == 0 && "Function already in module!");
1139 $1->getFunctionList().push_back($2);
1140 CurMeth.FunctionDone();
1142 | FunctionList FunctionProto {
1145 | FunctionList IMPLEMENTATION {
1149 $$ = CurModule.CurrentModule;
1150 // Resolve circular types before we parse the body of the module
1151 ResolveTypes(CurModule.LateResolveTypes);
1154 // ConstPool - Constants with optional names assigned to them.
1155 ConstPool : ConstPool OptAssign CONST ConstVal {
1156 if (!setValueName($4, $2))
1159 | ConstPool OptAssign TYPE TypesV { // Types can be defined in the const pool
1160 // Eagerly resolve types. This is not an optimization, this is a
1161 // requirement that is due to the fact that we could have this:
1163 // %list = type { %list * }
1164 // %list = type { %list * } ; repeated type decl
1166 // If types are not resolved eagerly, then the two types will not be
1167 // determined to be the same type!
1169 ResolveTypeTo($2, $4->get());
1171 // TODO: FIXME when Type are not const
1172 if (!setValueName(const_cast<Type*>($4->get()), $2)) {
1173 // If this is not a redefinition of a type...
1175 InsertType($4->get(),
1176 inFunctionScope() ? CurMeth.Types : CurModule.Types);
1182 | ConstPool FunctionProto { // Function prototypes can be in const pool
1184 | ConstPool OptAssign OptLinkage GlobalType ConstVal {
1185 const Type *Ty = $5->getType();
1186 // Global declarations appear in Constant Pool
1187 Constant *Initializer = $5;
1188 if (Initializer == 0)
1189 ThrowException("Global value initializer is not a constant!");
1191 GlobalVariable *GV = new GlobalVariable(Ty, $4, $3, Initializer);
1192 if (!setValueName(GV, $2)) { // If not redefining...
1193 CurModule.CurrentModule->getGlobalList().push_back(GV);
1194 int Slot = InsertValue(GV, CurModule.Values);
1197 CurModule.DeclareNewGlobalValue(GV, ValID::create(Slot));
1199 CurModule.DeclareNewGlobalValue(GV, ValID::create(
1200 (char*)GV->getName().c_str()));
1204 | ConstPool OptAssign EXTERNAL GlobalType Types {
1205 const Type *Ty = *$5;
1206 // Global declarations appear in Constant Pool
1207 GlobalVariable *GV = new GlobalVariable(Ty,$4,GlobalValue::ExternalLinkage);
1208 if (!setValueName(GV, $2)) { // If not redefining...
1209 CurModule.CurrentModule->getGlobalList().push_back(GV);
1210 int Slot = InsertValue(GV, CurModule.Values);
1213 CurModule.DeclareNewGlobalValue(GV, ValID::create(Slot));
1215 assert(GV->hasName() && "Not named and not numbered!?");
1216 CurModule.DeclareNewGlobalValue(GV, ValID::create(
1217 (char*)GV->getName().c_str()));
1222 | ConstPool TARGET TargetDefinition {
1224 | /* empty: end of list */ {
1229 BigOrLittle : BIG { $$ = Module::BigEndian; };
1230 BigOrLittle : LITTLE { $$ = Module::LittleEndian; };
1232 TargetDefinition : ENDIAN '=' BigOrLittle {
1233 CurModule.CurrentModule->setEndianness($3);
1235 | POINTERSIZE '=' EUINT64VAL {
1237 CurModule.CurrentModule->setPointerSize(Module::Pointer32);
1239 CurModule.CurrentModule->setPointerSize(Module::Pointer64);
1241 ThrowException("Invalid pointer size: '" + utostr($3) + "'!");
1245 //===----------------------------------------------------------------------===//
1246 // Rules to match Function Headers
1247 //===----------------------------------------------------------------------===//
1249 OptVAR_ID : VAR_ID | /*empty*/ { $$ = 0; };
1251 ArgVal : Types OptVAR_ID {
1252 if (*$1 == Type::VoidTy)
1253 ThrowException("void typed arguments are invalid!");
1254 $$ = new std::pair<PATypeHolder*, char*>($1, $2);
1257 ArgListH : ArgListH ',' ArgVal {
1263 $$ = new std::vector<std::pair<PATypeHolder*,char*> >();
1268 ArgList : ArgListH {
1271 | ArgListH ',' DOTDOTDOT {
1273 $$->push_back(std::pair<PATypeHolder*,
1274 char*>(new PATypeHolder(Type::VoidTy), 0));
1277 $$ = new std::vector<std::pair<PATypeHolder*,char*> >();
1278 $$->push_back(std::make_pair(new PATypeHolder(Type::VoidTy), (char*)0));
1284 FuncName : VAR_ID | STRINGCONSTANT;
1286 FunctionHeaderH : TypesV FuncName '(' ArgList ')' {
1288 std::string FunctionName($2);
1290 std::vector<const Type*> ParamTypeList;
1291 if ($4) { // If there are arguments...
1292 for (std::vector<std::pair<PATypeHolder*,char*> >::iterator I = $4->begin();
1293 I != $4->end(); ++I)
1294 ParamTypeList.push_back(I->first->get());
1297 bool isVarArg = ParamTypeList.size() && ParamTypeList.back() == Type::VoidTy;
1298 if (isVarArg) ParamTypeList.pop_back();
1300 const FunctionType *FT = FunctionType::get(*$1, ParamTypeList, isVarArg);
1301 const PointerType *PFT = PointerType::get(FT);
1305 // Is the function already in symtab?
1306 if ((Fn = CurModule.CurrentModule->getFunction(FunctionName, FT))) {
1307 // Yes it is. If this is the case, either we need to be a forward decl,
1308 // or it needs to be.
1309 if (!CurMeth.isDeclare && !Fn->isExternal())
1310 ThrowException("Redefinition of function '" + FunctionName + "'!");
1312 // If we found a preexisting function prototype, remove it from the
1313 // module, so that we don't get spurious conflicts with global & local
1316 CurModule.CurrentModule->getFunctionList().remove(Fn);
1318 // Make sure to strip off any argument names so we can't get conflicts...
1319 for (Function::aiterator AI = Fn->abegin(), AE = Fn->aend(); AI != AE; ++AI)
1322 } else { // Not already defined?
1323 Fn = new Function(FT, GlobalValue::ExternalLinkage, FunctionName);
1324 InsertValue(Fn, CurModule.Values);
1325 CurModule.DeclareNewGlobalValue(Fn, ValID::create($2));
1327 free($2); // Free strdup'd memory!
1329 CurMeth.FunctionStart(Fn);
1331 // Add all of the arguments we parsed to the function...
1332 if ($4) { // Is null if empty...
1333 if (isVarArg) { // Nuke the last entry
1334 assert($4->back().first->get() == Type::VoidTy && $4->back().second == 0&&
1335 "Not a varargs marker!");
1336 delete $4->back().first;
1337 $4->pop_back(); // Delete the last entry
1339 Function::aiterator ArgIt = Fn->abegin();
1340 for (std::vector<std::pair<PATypeHolder*, char*> >::iterator I =$4->begin();
1341 I != $4->end(); ++I, ++ArgIt) {
1342 delete I->first; // Delete the typeholder...
1344 if (setValueName(ArgIt, I->second)) // Insert arg into symtab...
1345 assert(0 && "No arg redef allowed!");
1350 delete $4; // We're now done with the argument list
1354 BEGIN : BEGINTOK | '{'; // Allow BEGIN or '{' to start a function
1356 FunctionHeader : OptLinkage FunctionHeaderH BEGIN {
1357 $$ = CurMeth.CurrentFunction;
1359 // Make sure that we keep track of the linkage type even if there was a
1360 // previous "declare".
1363 // Resolve circular types before we parse the body of the function.
1364 ResolveTypes(CurMeth.LateResolveTypes);
1367 END : ENDTOK | '}'; // Allow end of '}' to end a function
1369 Function : BasicBlockList END {
1373 FunctionProto : DECLARE { CurMeth.isDeclare = true; } FunctionHeaderH {
1374 $$ = CurMeth.CurrentFunction;
1375 assert($$->getParent() == 0 && "Function already in module!");
1376 CurModule.CurrentModule->getFunctionList().push_back($$);
1377 CurMeth.FunctionDone();
1380 //===----------------------------------------------------------------------===//
1381 // Rules to match Basic Blocks
1382 //===----------------------------------------------------------------------===//
1384 ConstValueRef : ESINT64VAL { // A reference to a direct constant
1385 $$ = ValID::create($1);
1388 $$ = ValID::create($1);
1390 | FPVAL { // Perhaps it's an FP constant?
1391 $$ = ValID::create($1);
1394 $$ = ValID::create(ConstantBool::True);
1397 $$ = ValID::create(ConstantBool::False);
1400 $$ = ValID::createNull();
1403 $$ = ValID::create($1);
1406 // SymbolicValueRef - Reference to one of two ways of symbolically refering to
1409 SymbolicValueRef : INTVAL { // Is it an integer reference...?
1410 $$ = ValID::create($1);
1412 | VAR_ID { // Is it a named reference...?
1413 $$ = ValID::create($1);
1416 // ValueRef - A reference to a definition... either constant or symbolic
1417 ValueRef : SymbolicValueRef | ConstValueRef;
1420 // ResolvedVal - a <type> <value> pair. This is used only in cases where the
1421 // type immediately preceeds the value reference, and allows complex constant
1422 // pool references (for things like: 'ret [2 x int] [ int 12, int 42]')
1423 ResolvedVal : Types ValueRef {
1424 $$ = getVal(*$1, $2); delete $1;
1427 BasicBlockList : BasicBlockList BasicBlock {
1428 ($$ = $1)->getBasicBlockList().push_back($2);
1430 | FunctionHeader BasicBlock { // Do not allow functions with 0 basic blocks
1431 ($$ = $1)->getBasicBlockList().push_back($2);
1435 // Basic blocks are terminated by branching instructions:
1436 // br, br/cc, switch, ret
1438 BasicBlock : InstructionList OptAssign BBTerminatorInst {
1439 if (setValueName($3, $2)) { assert(0 && "No redefn allowed!"); }
1442 $1->getInstList().push_back($3);
1446 | LABELSTR InstructionList OptAssign BBTerminatorInst {
1447 if (setValueName($4, $3)) { assert(0 && "No redefn allowed!"); }
1450 $2->getInstList().push_back($4);
1451 if (setValueName($2, $1)) { assert(0 && "No label redef allowed!"); }
1457 InstructionList : InstructionList Inst {
1458 $1->getInstList().push_back($2);
1462 $$ = CurBB = new BasicBlock();
1465 BBTerminatorInst : RET ResolvedVal { // Return with a result...
1466 $$ = new ReturnInst($2);
1468 | RET VOID { // Return with no result...
1469 $$ = new ReturnInst();
1471 | BR LABEL ValueRef { // Unconditional Branch...
1472 $$ = new BranchInst(cast<BasicBlock>(getVal(Type::LabelTy, $3)));
1473 } // Conditional Branch...
1474 | BR BOOL ValueRef ',' LABEL ValueRef ',' LABEL ValueRef {
1475 $$ = new BranchInst(cast<BasicBlock>(getVal(Type::LabelTy, $6)),
1476 cast<BasicBlock>(getVal(Type::LabelTy, $9)),
1477 getVal(Type::BoolTy, $3));
1479 | SWITCH IntType ValueRef ',' LABEL ValueRef '[' JumpTable ']' {
1480 SwitchInst *S = new SwitchInst(getVal($2, $3),
1481 cast<BasicBlock>(getVal(Type::LabelTy, $6)));
1484 std::vector<std::pair<Constant*,BasicBlock*> >::iterator I = $8->begin(),
1487 S->dest_push_back(I->first, I->second);
1489 | SWITCH IntType ValueRef ',' LABEL ValueRef '[' ']' {
1490 SwitchInst *S = new SwitchInst(getVal($2, $3),
1491 cast<BasicBlock>(getVal(Type::LabelTy, $6)));
1494 | INVOKE TypesV ValueRef '(' ValueRefListE ')' TO ResolvedVal
1495 EXCEPT ResolvedVal {
1496 const PointerType *PFTy;
1497 const FunctionType *Ty;
1499 if (!(PFTy = dyn_cast<PointerType>($2->get())) ||
1500 !(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) {
1501 // Pull out the types of all of the arguments...
1502 std::vector<const Type*> ParamTypes;
1504 for (std::vector<Value*>::iterator I = $5->begin(), E = $5->end();
1506 ParamTypes.push_back((*I)->getType());
1509 bool isVarArg = ParamTypes.size() && ParamTypes.back() == Type::VoidTy;
1510 if (isVarArg) ParamTypes.pop_back();
1512 Ty = FunctionType::get($2->get(), ParamTypes, isVarArg);
1513 PFTy = PointerType::get(Ty);
1517 Value *V = getVal(PFTy, $3); // Get the function we're calling...
1519 BasicBlock *Normal = dyn_cast<BasicBlock>($8);
1520 BasicBlock *Except = dyn_cast<BasicBlock>($10);
1522 if (Normal == 0 || Except == 0)
1523 ThrowException("Invoke instruction without label destinations!");
1525 // Create the call node...
1526 if (!$5) { // Has no arguments?
1527 $$ = new InvokeInst(V, Normal, Except, std::vector<Value*>());
1528 } else { // Has arguments?
1529 // Loop through FunctionType's arguments and ensure they are specified
1532 FunctionType::ParamTypes::const_iterator I = Ty->getParamTypes().begin();
1533 FunctionType::ParamTypes::const_iterator E = Ty->getParamTypes().end();
1534 std::vector<Value*>::iterator ArgI = $5->begin(), ArgE = $5->end();
1536 for (; ArgI != ArgE && I != E; ++ArgI, ++I)
1537 if ((*ArgI)->getType() != *I)
1538 ThrowException("Parameter " +(*ArgI)->getName()+ " is not of type '" +
1539 (*I)->getDescription() + "'!");
1541 if (I != E || (ArgI != ArgE && !Ty->isVarArg()))
1542 ThrowException("Invalid number of parameters detected!");
1544 $$ = new InvokeInst(V, Normal, Except, *$5);
1551 JumpTable : JumpTable IntType ConstValueRef ',' LABEL ValueRef {
1553 Constant *V = cast<Constant>(getValNonImprovising($2, $3));
1555 ThrowException("May only switch on a constant pool value!");
1557 $$->push_back(std::make_pair(V, cast<BasicBlock>(getVal($5, $6))));
1559 | IntType ConstValueRef ',' LABEL ValueRef {
1560 $$ = new std::vector<std::pair<Constant*, BasicBlock*> >();
1561 Constant *V = cast<Constant>(getValNonImprovising($1, $2));
1564 ThrowException("May only switch on a constant pool value!");
1566 $$->push_back(std::make_pair(V, cast<BasicBlock>(getVal($4, $5))));
1569 Inst : OptAssign InstVal {
1570 // Is this definition named?? if so, assign the name...
1571 if (setValueName($2, $1)) { assert(0 && "No redefin allowed!"); }
1576 PHIList : Types '[' ValueRef ',' ValueRef ']' { // Used for PHI nodes
1577 $$ = new std::list<std::pair<Value*, BasicBlock*> >();
1578 $$->push_back(std::make_pair(getVal(*$1, $3),
1579 cast<BasicBlock>(getVal(Type::LabelTy, $5))));
1582 | PHIList ',' '[' ValueRef ',' ValueRef ']' {
1584 $1->push_back(std::make_pair(getVal($1->front().first->getType(), $4),
1585 cast<BasicBlock>(getVal(Type::LabelTy, $6))));
1589 ValueRefList : ResolvedVal { // Used for call statements, and memory insts...
1590 $$ = new std::vector<Value*>();
1593 | ValueRefList ',' ResolvedVal {
1598 // ValueRefListE - Just like ValueRefList, except that it may also be empty!
1599 ValueRefListE : ValueRefList | /*empty*/ { $$ = 0; };
1601 InstVal : ArithmeticOps Types ValueRef ',' ValueRef {
1602 if (!(*$2)->isInteger() && !(*$2)->isFloatingPoint())
1603 ThrowException("Arithmetic operator requires integer or FP operands!");
1604 $$ = BinaryOperator::create($1, getVal(*$2, $3), getVal(*$2, $5));
1606 ThrowException("binary operator returned null!");
1609 | LogicalOps Types ValueRef ',' ValueRef {
1610 if (!(*$2)->isIntegral())
1611 ThrowException("Logical operator requires integral operands!");
1612 $$ = BinaryOperator::create($1, getVal(*$2, $3), getVal(*$2, $5));
1614 ThrowException("binary operator returned null!");
1617 | SetCondOps Types ValueRef ',' ValueRef {
1618 $$ = new SetCondInst($1, getVal(*$2, $3), getVal(*$2, $5));
1620 ThrowException("binary operator returned null!");
1624 std::cerr << "WARNING: Use of eliminated 'not' instruction:"
1625 << " Replacing with 'xor'.\n";
1627 Value *Ones = ConstantIntegral::getAllOnesValue($2->getType());
1629 ThrowException("Expected integral type for not instruction!");
1631 $$ = BinaryOperator::create(Instruction::Xor, $2, Ones);
1633 ThrowException("Could not create a xor instruction!");
1635 | ShiftOps ResolvedVal ',' ResolvedVal {
1636 if ($4->getType() != Type::UByteTy)
1637 ThrowException("Shift amount must be ubyte!");
1638 $$ = new ShiftInst($1, $2, $4);
1640 | CAST ResolvedVal TO Types {
1641 $$ = new CastInst($2, *$4);
1644 | VA_ARG ResolvedVal ',' Types {
1645 $$ = new VarArgInst($2, *$4);
1649 const Type *Ty = $2->front().first->getType();
1650 $$ = new PHINode(Ty);
1651 while ($2->begin() != $2->end()) {
1652 if ($2->front().first->getType() != Ty)
1653 ThrowException("All elements of a PHI node must be of the same type!");
1654 cast<PHINode>($$)->addIncoming($2->front().first, $2->front().second);
1657 delete $2; // Free the list...
1659 | CALL TypesV ValueRef '(' ValueRefListE ')' {
1660 const PointerType *PFTy;
1661 const FunctionType *Ty;
1663 if (!(PFTy = dyn_cast<PointerType>($2->get())) ||
1664 !(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) {
1665 // Pull out the types of all of the arguments...
1666 std::vector<const Type*> ParamTypes;
1668 for (std::vector<Value*>::iterator I = $5->begin(), E = $5->end();
1670 ParamTypes.push_back((*I)->getType());
1673 bool isVarArg = ParamTypes.size() && ParamTypes.back() == Type::VoidTy;
1674 if (isVarArg) ParamTypes.pop_back();
1676 Ty = FunctionType::get($2->get(), ParamTypes, isVarArg);
1677 PFTy = PointerType::get(Ty);
1681 Value *V = getVal(PFTy, $3); // Get the function we're calling...
1683 // Create the call node...
1684 if (!$5) { // Has no arguments?
1685 // Make sure no arguments is a good thing!
1686 if (Ty->getNumParams() != 0)
1687 ThrowException("No arguments passed to a function that "
1688 "expects arguments!");
1690 $$ = new CallInst(V, std::vector<Value*>());
1691 } else { // Has arguments?
1692 // Loop through FunctionType's arguments and ensure they are specified
1695 FunctionType::ParamTypes::const_iterator I = Ty->getParamTypes().begin();
1696 FunctionType::ParamTypes::const_iterator E = Ty->getParamTypes().end();
1697 std::vector<Value*>::iterator ArgI = $5->begin(), ArgE = $5->end();
1699 for (; ArgI != ArgE && I != E; ++ArgI, ++I)
1700 if ((*ArgI)->getType() != *I)
1701 ThrowException("Parameter " +(*ArgI)->getName()+ " is not of type '" +
1702 (*I)->getDescription() + "'!");
1704 if (I != E || (ArgI != ArgE && !Ty->isVarArg()))
1705 ThrowException("Invalid number of parameters detected!");
1707 $$ = new CallInst(V, *$5);
1716 // IndexList - List of indices for GEP based instructions...
1717 IndexList : ',' ValueRefList {
1720 $$ = new std::vector<Value*>();
1723 MemoryInst : MALLOC Types {
1724 $$ = new MallocInst(*$2);
1727 | MALLOC Types ',' UINT ValueRef {
1728 $$ = new MallocInst(*$2, getVal($4, $5));
1732 $$ = new AllocaInst(*$2);
1735 | ALLOCA Types ',' UINT ValueRef {
1736 $$ = new AllocaInst(*$2, getVal($4, $5));
1739 | FREE ResolvedVal {
1740 if (!isa<PointerType>($2->getType()))
1741 ThrowException("Trying to free nonpointer type " +
1742 $2->getType()->getDescription() + "!");
1743 $$ = new FreeInst($2);
1746 | LOAD Types ValueRef IndexList {
1747 if (!isa<PointerType>($2->get()))
1748 ThrowException("Can't load from nonpointer type: " +
1749 (*$2)->getDescription());
1750 if (GetElementPtrInst::getIndexedType(*$2, *$4) == 0)
1751 ThrowException("Invalid indices for load instruction!");
1753 Value *Src = getVal(*$2, $3);
1755 std::cerr << "WARNING: Use of index load instruction:"
1756 << " replacing with getelementptr/load pair.\n";
1757 // Create a getelementptr hack instruction to do the right thing for
1760 Instruction *I = new GetElementPtrInst(Src, *$4);
1761 CurBB->getInstList().push_back(I);
1765 $$ = new LoadInst(Src);
1766 delete $4; // Free the vector...
1769 | STORE ResolvedVal ',' Types ValueRef IndexList {
1770 if (!isa<PointerType>($4->get()))
1771 ThrowException("Can't store to a nonpointer type: " +
1772 (*$4)->getDescription());
1773 const Type *ElTy = GetElementPtrInst::getIndexedType(*$4, *$6);
1775 ThrowException("Can't store into that field list!");
1776 if (ElTy != $2->getType())
1777 ThrowException("Can't store '" + $2->getType()->getDescription() +
1778 "' into space of type '" + ElTy->getDescription() + "'!");
1780 Value *Ptr = getVal(*$4, $5);
1782 std::cerr << "WARNING: Use of index store instruction:"
1783 << " replacing with getelementptr/store pair.\n";
1784 // Create a getelementptr hack instruction to do the right thing for
1787 Instruction *I = new GetElementPtrInst(Ptr, *$6);
1788 CurBB->getInstList().push_back(I);
1792 $$ = new StoreInst($2, Ptr);
1793 delete $4; delete $6;
1795 | GETELEMENTPTR Types ValueRef IndexList {
1796 for (unsigned i = 0, e = $4->size(); i != e; ++i) {
1797 if ((*$4)[i]->getType() == Type::UIntTy) {
1798 std::cerr << "WARNING: Use of uint type indexes to getelementptr "
1799 << "instruction: replacing with casts to long type.\n";
1800 Instruction *I = new CastInst((*$4)[i], Type::LongTy);
1801 CurBB->getInstList().push_back(I);
1806 if (!isa<PointerType>($2->get()))
1807 ThrowException("getelementptr insn requires pointer operand!");
1808 if (!GetElementPtrInst::getIndexedType(*$2, *$4, true))
1809 ThrowException("Can't get element ptr '" + (*$2)->getDescription()+ "'!");
1810 $$ = new GetElementPtrInst(getVal(*$2, $3), *$4);
1811 delete $2; delete $4;
1815 int yyerror(const char *ErrorMsg) {
1817 = std::string((CurFilename == "-") ? std::string("<stdin>") : CurFilename)
1818 + ":" + utostr((unsigned) llvmAsmlineno) + ": ";
1819 std::string errMsg = std::string(ErrorMsg) + "\n" + where + " while reading ";
1820 if (yychar == YYEMPTY)
1821 errMsg += "end-of-file.";
1823 errMsg += "token: '" + std::string(llvmAsmtext, llvmAsmleng) + "'";
1824 ThrowException(errMsg);