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/GlobalVariable.h"
12 #include "llvm/iTerminators.h"
13 #include "llvm/iMemory.h"
14 #include "llvm/iPHINode.h"
15 #include "llvm/Argument.h"
16 #include "Support/STLExtras.h"
17 #include "Support/DepthFirstIterator.h"
19 #include <utility> // Get definition of pair class
31 int yyerror(const char *ErrorMsg); // Forward declarations to prevent "implicit
32 int yylex(); // declaration" of xxx warnings.
35 static Module *ParserResult;
38 // DEBUG_UPREFS - Define this symbol if you want to enable debugging output
39 // relating to upreferences in the input stream.
41 //#define DEBUG_UPREFS 1
43 #define UR_OUT(X) cerr << X
48 // This contains info used when building the body of a method. It is destroyed
49 // when the method is completed.
51 typedef vector<Value *> ValueList; // Numbered defs
52 static void ResolveDefinitions(vector<ValueList> &LateResolvers,
53 vector<ValueList> *FutureLateResolvers = 0);
55 static struct PerModuleInfo {
56 Module *CurrentModule;
57 vector<ValueList> Values; // Module level numbered definitions
58 vector<ValueList> LateResolveValues;
59 vector<PATypeHolder> Types;
60 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 map<pair<const PointerType *, ValID>, GlobalVariable*> GlobalRefsType;
68 GlobalRefsType GlobalRefs;
71 // If we could not resolve some methods at method compilation time (calls to
72 // methods before they are defined), resolve them now... Types are resolved
73 // when the constant pool has been completely parsed.
75 ResolveDefinitions(LateResolveValues);
77 // Check to make sure that all global value forward references have been
80 if (!GlobalRefs.empty()) {
81 string UndefinedReferences = "Unresolved global references exist:\n";
83 for (GlobalRefsType::iterator I = GlobalRefs.begin(), E =GlobalRefs.end();
85 UndefinedReferences += " " + I->first.first->getDescription() + " " +
86 I->first.second.getName() + "\n";
88 ThrowException(UndefinedReferences);
91 Values.clear(); // Clear out method local definitions
97 // DeclareNewGlobalValue - Called every type a new GV has been defined. This
98 // is used to remove things from the forward declaration map, resolving them
99 // to the correct thing as needed.
101 void DeclareNewGlobalValue(GlobalValue *GV, ValID D) {
102 // Check to see if there is a forward reference to this global variable...
103 // if there is, eliminate it and patch the reference to use the new def'n.
104 GlobalRefsType::iterator I = GlobalRefs.find(make_pair(GV->getType(), D));
106 if (I != GlobalRefs.end()) {
107 GlobalVariable *OldGV = I->second; // Get the placeholder...
108 I->first.second.destroy(); // Free string memory if neccesary
110 // Loop over all of the uses of the GlobalValue. The only thing they are
111 // allowed to be at this point is ConstantPointerRef's.
112 assert(OldGV->use_size() == 1 && "Only one reference should exist!");
113 while (!OldGV->use_empty()) {
114 User *U = OldGV->use_back(); // Must be a ConstantPointerRef...
115 ConstantPointerRef *CPPR = cast<ConstantPointerRef>(U);
116 assert(CPPR->getValue() == OldGV && "Something isn't happy");
118 // Change the const pool reference to point to the real global variable
119 // now. This should drop a use from the OldGV.
120 CPPR->mutateReference(GV);
123 // Remove GV 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 method being created
137 vector<ValueList> Values; // Keep track of numbered definitions
138 vector<ValueList> LateResolveValues;
139 vector<PATypeHolder> Types;
140 map<ValID, PATypeHolder> LateResolveTypes;
141 bool isDeclare; // Is this method 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 Values.clear(); // Clear out method local definitions
164 } CurMeth; // Info for the current method...
166 static bool inFunctionScope() { return CurMeth.CurrentFunction != 0; }
169 //===----------------------------------------------------------------------===//
170 // Code to handle definitions of all the types
171 //===----------------------------------------------------------------------===//
173 static int InsertValue(Value *D, vector<ValueList> &ValueTab = CurMeth.Values) {
174 if (D->hasName()) return -1; // Is this a numbered definition?
176 // Yes, insert the value into the value table...
177 unsigned type = D->getType()->getUniqueID();
178 if (ValueTab.size() <= type)
179 ValueTab.resize(type+1, ValueList());
180 //printf("Values[%d][%d] = %d\n", type, ValueTab[type].size(), D);
181 ValueTab[type].push_back(D);
182 return ValueTab[type].size()-1;
185 // TODO: FIXME when Type are not const
186 static void InsertType(const Type *Ty, vector<PATypeHolder> &Types) {
190 static const Type *getTypeVal(const ValID &D, bool DoNotImprovise = false) {
192 case 0: { // Is it a numbered definition?
193 unsigned Num = (unsigned)D.Num;
195 // Module constants occupy the lowest numbered slots...
196 if (Num < CurModule.Types.size())
197 return CurModule.Types[Num];
199 Num -= CurModule.Types.size();
201 // Check that the number is within bounds...
202 if (Num <= CurMeth.Types.size())
203 return CurMeth.Types[Num];
206 case 1: { // Is it a named definition?
208 SymbolTable *SymTab = 0;
209 if (inFunctionScope()) SymTab = CurMeth.CurrentFunction->getSymbolTable();
210 Value *N = SymTab ? SymTab->lookup(Type::TypeTy, Name) : 0;
213 // Symbol table doesn't automatically chain yet... because the method
214 // hasn't been added to the module...
216 SymTab = CurModule.CurrentModule->getSymbolTable();
218 N = SymTab->lookup(Type::TypeTy, Name);
222 D.destroy(); // Free old strdup'd memory...
223 return cast<const Type>(N);
226 ThrowException("Invalid symbol type reference!");
229 // If we reached here, we referenced either a symbol that we don't know about
230 // or an id number that hasn't been read yet. We may be referencing something
231 // forward, so just create an entry to be resolved later and get to it...
233 if (DoNotImprovise) return 0; // Do we just want a null to be returned?
235 map<ValID, PATypeHolder> &LateResolver = inFunctionScope() ?
236 CurMeth.LateResolveTypes : CurModule.LateResolveTypes;
238 map<ValID, PATypeHolder>::iterator I = LateResolver.find(D);
239 if (I != LateResolver.end()) {
243 Type *Typ = OpaqueType::get();
244 LateResolver.insert(make_pair(D, Typ));
248 static Value *lookupInSymbolTable(const Type *Ty, const string &Name) {
249 SymbolTable *SymTab =
250 inFunctionScope() ? CurMeth.CurrentFunction->getSymbolTable() :
251 CurModule.CurrentModule->getSymbolTable();
252 return SymTab ? SymTab->lookup(Ty, Name) : 0;
255 // getValNonImprovising - Look up the value specified by the provided type and
256 // the provided ValID. If the value exists and has already been defined, return
257 // it. Otherwise return null.
259 static Value *getValNonImprovising(const Type *Ty, const ValID &D) {
260 if (isa<FunctionType>(Ty))
261 ThrowException("Functions are not values and "
262 "must be referenced as pointers");
265 case ValID::NumberVal: { // Is it a numbered definition?
266 unsigned type = Ty->getUniqueID();
267 unsigned Num = (unsigned)D.Num;
269 // Module constants occupy the lowest numbered slots...
270 if (type < CurModule.Values.size()) {
271 if (Num < CurModule.Values[type].size())
272 return CurModule.Values[type][Num];
274 Num -= CurModule.Values[type].size();
277 // Make sure that our type is within bounds
278 if (CurMeth.Values.size() <= type) return 0;
280 // Check that the number is within bounds...
281 if (CurMeth.Values[type].size() <= Num) return 0;
283 return CurMeth.Values[type][Num];
286 case ValID::NameVal: { // Is it a named definition?
287 Value *N = lookupInSymbolTable(Ty, string(D.Name));
288 if (N == 0) return 0;
290 D.destroy(); // Free old strdup'd memory...
294 // Check to make sure that "Ty" is an integral type, and that our
295 // value will fit into the specified type...
296 case ValID::ConstSIntVal: // Is it a constant pool reference??
297 if (Ty == Type::BoolTy) { // Special handling for boolean data
298 return ConstantBool::get(D.ConstPool64 != 0);
300 if (!ConstantSInt::isValueValidForType(Ty, D.ConstPool64))
301 ThrowException("Symbolic constant pool value '" +
302 itostr(D.ConstPool64) + "' is invalid for type '" +
303 Ty->getDescription() + "'!");
304 return ConstantSInt::get(Ty, D.ConstPool64);
307 case ValID::ConstUIntVal: // Is it an unsigned const pool reference?
308 if (!ConstantUInt::isValueValidForType(Ty, D.UConstPool64)) {
309 if (!ConstantSInt::isValueValidForType(Ty, D.ConstPool64)) {
310 ThrowException("Integral constant pool reference is invalid!");
311 } else { // This is really a signed reference. Transmogrify.
312 return ConstantSInt::get(Ty, D.ConstPool64);
315 return ConstantUInt::get(Ty, D.UConstPool64);
318 case ValID::ConstFPVal: // Is it a floating point const pool reference?
319 if (!ConstantFP::isValueValidForType(Ty, D.ConstPoolFP))
320 ThrowException("FP constant invalid for type!!");
321 return ConstantFP::get(Ty, D.ConstPoolFP);
323 case ValID::ConstNullVal: // Is it a null value?
324 if (!isa<PointerType>(Ty))
325 ThrowException("Cannot create a a non pointer null!");
326 return ConstantPointerNull::get(cast<PointerType>(Ty));
329 assert(0 && "Unhandled case!");
333 assert(0 && "Unhandled case!");
338 // getVal - This function is identical to getValNonImprovising, except that if a
339 // value is not already defined, it "improvises" by creating a placeholder var
340 // that looks and acts just like the requested variable. When the value is
341 // defined later, all uses of the placeholder variable are replaced with the
344 static Value *getVal(const Type *Ty, const ValID &D) {
345 assert(Ty != Type::TypeTy && "Should use getTypeVal for types!");
347 // See if the value has already been defined...
348 Value *V = getValNonImprovising(Ty, D);
351 // If we reached here, we referenced either a symbol that we don't know about
352 // or an id number that hasn't been read yet. We may be referencing something
353 // forward, so just create an entry to be resolved later and get to it...
356 switch (Ty->getPrimitiveID()) {
357 case Type::LabelTyID: d = new BBPlaceHolder(Ty, D); break;
358 default: d = new ValuePlaceHolder(Ty, D); break;
361 assert(d != 0 && "How did we not make something?");
362 if (inFunctionScope())
363 InsertValue(d, CurMeth.LateResolveValues);
365 InsertValue(d, CurModule.LateResolveValues);
370 //===----------------------------------------------------------------------===//
371 // Code to handle forward references in instructions
372 //===----------------------------------------------------------------------===//
374 // This code handles the late binding needed with statements that reference
375 // values not defined yet... for example, a forward branch, or the PHI node for
378 // This keeps a table (CurMeth.LateResolveValues) of all such forward references
379 // and back patchs after we are done.
382 // ResolveDefinitions - If we could not resolve some defs at parsing
383 // time (forward branches, phi functions for loops, etc...) resolve the
386 static void ResolveDefinitions(vector<ValueList> &LateResolvers,
387 vector<ValueList> *FutureLateResolvers = 0) {
388 // Loop over LateResolveDefs fixing up stuff that couldn't be resolved
389 for (unsigned ty = 0; ty < LateResolvers.size(); ty++) {
390 while (!LateResolvers[ty].empty()) {
391 Value *V = LateResolvers[ty].back();
392 assert(!isa<Type>(V) && "Types should be in LateResolveTypes!");
394 LateResolvers[ty].pop_back();
395 ValID &DID = getValIDFromPlaceHolder(V);
397 Value *TheRealValue = getValNonImprovising(Type::getUniqueIDType(ty),DID);
399 V->replaceAllUsesWith(TheRealValue);
401 } else if (FutureLateResolvers) {
402 // Functions have their unresolved items forwarded to the module late
404 InsertValue(V, *FutureLateResolvers);
406 if (DID.Type == ValID::NameVal)
407 ThrowException("Reference to an invalid definition: '" +DID.getName()+
408 "' of type '" + V->getType()->getDescription() + "'",
409 getLineNumFromPlaceHolder(V));
411 ThrowException("Reference to an invalid definition: #" +
412 itostr(DID.Num) + " of type '" +
413 V->getType()->getDescription() + "'",
414 getLineNumFromPlaceHolder(V));
419 LateResolvers.clear();
422 // ResolveTypeTo - A brand new type was just declared. This means that (if
423 // name is not null) things referencing Name can be resolved. Otherwise, things
424 // refering to the number can be resolved. Do this now.
426 static void ResolveTypeTo(char *Name, const Type *ToTy) {
427 vector<PATypeHolder> &Types = inFunctionScope() ?
428 CurMeth.Types : CurModule.Types;
431 if (Name) D = ValID::create(Name);
432 else D = ValID::create((int)Types.size());
434 map<ValID, PATypeHolder> &LateResolver = inFunctionScope() ?
435 CurMeth.LateResolveTypes : CurModule.LateResolveTypes;
437 map<ValID, PATypeHolder>::iterator I = LateResolver.find(D);
438 if (I != LateResolver.end()) {
439 ((DerivedType*)I->second.get())->refineAbstractTypeTo(ToTy);
440 LateResolver.erase(I);
444 // ResolveTypes - At this point, all types should be resolved. Any that aren't
447 static void ResolveTypes(map<ValID, PATypeHolder> &LateResolveTypes) {
448 if (!LateResolveTypes.empty()) {
449 const ValID &DID = LateResolveTypes.begin()->first;
451 if (DID.Type == ValID::NameVal)
452 ThrowException("Reference to an invalid type: '" +DID.getName() + "'");
454 ThrowException("Reference to an invalid type: #" + itostr(DID.Num));
459 // setValueName - Set the specified value to the name given. The name may be
460 // null potentially, in which case this is a noop. The string passed in is
461 // assumed to be a malloc'd string buffer, and is freed by this function.
463 // This function returns true if the value has already been defined, but is
464 // allowed to be redefined in the specified context. If the name is a new name
465 // for the typeplane, false is returned.
467 static bool setValueName(Value *V, char *NameStr) {
468 if (NameStr == 0) return false;
470 string Name(NameStr); // Copy string
471 free(NameStr); // Free old string
473 if (V->getType() == Type::VoidTy)
474 ThrowException("Can't assign name '" + Name +
475 "' to a null valued instruction!");
477 SymbolTable *ST = inFunctionScope() ?
478 CurMeth.CurrentFunction->getSymbolTableSure() :
479 CurModule.CurrentModule->getSymbolTableSure();
481 Value *Existing = ST->lookup(V->getType(), Name);
482 if (Existing) { // Inserting a name that is already defined???
483 // There is only one case where this is allowed: when we are refining an
484 // opaque type. In this case, Existing will be an opaque type.
485 if (const Type *Ty = dyn_cast<const Type>(Existing)) {
486 if (const OpaqueType *OpTy = dyn_cast<OpaqueType>(Ty)) {
487 // We ARE replacing an opaque type!
488 ((OpaqueType*)OpTy)->refineAbstractTypeTo(cast<Type>(V));
493 // Otherwise, we are a simple redefinition of a value, check to see if it
494 // is defined the same as the old one...
495 if (const Type *Ty = dyn_cast<const Type>(Existing)) {
496 if (Ty == cast<const Type>(V)) return true; // Yes, it's equal.
497 // cerr << "Type: " << Ty->getDescription() << " != "
498 // << cast<const Type>(V)->getDescription() << "!\n";
499 } else if (GlobalVariable *EGV = dyn_cast<GlobalVariable>(Existing)) {
500 // We are allowed to redefine a global variable in two circumstances:
501 // 1. If at least one of the globals is uninitialized or
502 // 2. If both initializers have the same value.
504 // This can only be done if the const'ness of the vars is the same.
506 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(V)) {
507 if (EGV->isConstant() == GV->isConstant() &&
508 (!EGV->hasInitializer() || !GV->hasInitializer() ||
509 EGV->getInitializer() == GV->getInitializer())) {
511 // Make sure the existing global version gets the initializer!
512 if (GV->hasInitializer() && !EGV->hasInitializer())
513 EGV->setInitializer(GV->getInitializer());
515 delete GV; // Destroy the duplicate!
516 return true; // They are equivalent!
520 ThrowException("Redefinition of value named '" + Name + "' in the '" +
521 V->getType()->getDescription() + "' type plane!");
524 V->setName(Name, ST);
529 //===----------------------------------------------------------------------===//
530 // Code for handling upreferences in type names...
533 // TypeContains - Returns true if Ty contains E in it.
535 static bool TypeContains(const Type *Ty, const Type *E) {
536 return find(df_begin(Ty), df_end(Ty), E) != df_end(Ty);
540 static vector<pair<unsigned, OpaqueType *> > UpRefs;
542 static PATypeHolder HandleUpRefs(const Type *ty) {
544 UR_OUT("Type '" << ty->getDescription() <<
545 "' newly formed. Resolving upreferences.\n" <<
546 UpRefs.size() << " upreferences active!\n");
547 for (unsigned i = 0; i < UpRefs.size(); ) {
548 UR_OUT(" UR#" << i << " - TypeContains(" << Ty->getDescription() << ", "
549 << UpRefs[i].second->getDescription() << ") = "
550 << (TypeContains(Ty, UpRefs[i].second) ? "true" : "false") << endl);
551 if (TypeContains(Ty, UpRefs[i].second)) {
552 unsigned Level = --UpRefs[i].first; // Decrement level of upreference
553 UR_OUT(" Uplevel Ref Level = " << Level << endl);
554 if (Level == 0) { // Upreference should be resolved!
555 UR_OUT(" * Resolving upreference for "
556 << UpRefs[i].second->getDescription() << endl;
557 string OldName = UpRefs[i].second->getDescription());
558 UpRefs[i].second->refineAbstractTypeTo(Ty);
559 UpRefs.erase(UpRefs.begin()+i); // Remove from upreference list...
560 UR_OUT(" * Type '" << OldName << "' refined upreference to: "
561 << (const void*)Ty << ", " << Ty->getDescription() << endl);
566 ++i; // Otherwise, no resolve, move on...
568 // FIXME: TODO: this should return the updated type
573 //===----------------------------------------------------------------------===//
574 // RunVMAsmParser - Define an interface to this parser
575 //===----------------------------------------------------------------------===//
577 Module *RunVMAsmParser(const string &Filename, FILE *F) {
579 CurFilename = Filename;
580 llvmAsmlineno = 1; // Reset the current line number...
582 CurModule.CurrentModule = new Module(); // Allocate a new module to read
583 yyparse(); // Parse the file.
584 Module *Result = ParserResult;
585 llvmAsmin = stdin; // F is about to go away, don't use it anymore...
595 Function *FunctionVal;
596 std::pair<Argument*, char*> *ArgVal;
597 BasicBlock *BasicBlockVal;
598 TerminatorInst *TermInstVal;
599 Instruction *InstVal;
602 const Type *PrimType;
603 PATypeHolder *TypeVal;
606 std::list<std::pair<Argument*,char*> > *ArgList;
607 std::vector<Value*> *ValueList;
608 std::list<PATypeHolder> *TypeList;
609 std::list<std::pair<Value*,
610 BasicBlock*> > *PHIList; // Represent the RHS of PHI node
611 std::vector<std::pair<Constant*, BasicBlock*> > *JumpTable;
612 std::vector<Constant*> *ConstVector;
621 char *StrVal; // This memory is strdup'd!
622 ValID ValIDVal; // strdup'd memory maybe!
624 Instruction::UnaryOps UnaryOpVal;
625 Instruction::BinaryOps BinaryOpVal;
626 Instruction::TermOps TermOpVal;
627 Instruction::MemoryOps MemOpVal;
628 Instruction::OtherOps OtherOpVal;
631 %type <ModuleVal> Module FunctionList
632 %type <FunctionVal> Function FunctionProto FunctionHeader BasicBlockList
633 %type <BasicBlockVal> BasicBlock InstructionList
634 %type <TermInstVal> BBTerminatorInst
635 %type <InstVal> Inst InstVal MemoryInst
636 %type <ConstVal> ConstVal
637 %type <ConstVector> ConstVector
638 %type <ArgList> ArgList ArgListH
639 %type <ArgVal> ArgVal
640 %type <PHIList> PHIList
641 %type <ValueList> ValueRefList ValueRefListE // For call param lists
642 %type <ValueList> IndexList // For GEP derived indices
643 %type <TypeList> TypeListI ArgTypeListI
644 %type <JumpTable> JumpTable
645 %type <BoolVal> GlobalType OptInternal // GLOBAL or CONSTANT? Intern?
647 // ValueRef - Unresolved reference to a definition or BB
648 %type <ValIDVal> ValueRef ConstValueRef SymbolicValueRef
649 %type <ValueVal> ResolvedVal // <type> <valref> pair
650 // Tokens and types for handling constant integer values
652 // ESINT64VAL - A negative number within long long range
653 %token <SInt64Val> ESINT64VAL
655 // EUINT64VAL - A positive number within uns. long long range
656 %token <UInt64Val> EUINT64VAL
657 %type <SInt64Val> EINT64VAL
659 %token <SIntVal> SINTVAL // Signed 32 bit ints...
660 %token <UIntVal> UINTVAL // Unsigned 32 bit ints...
661 %type <SIntVal> INTVAL
662 %token <FPVal> FPVAL // Float or Double constant
665 %type <TypeVal> Types TypesV UpRTypes UpRTypesV
666 %type <PrimType> SIntType UIntType IntType FPType PrimType // Classifications
667 %token <PrimType> VOID BOOL SBYTE UBYTE SHORT USHORT INT UINT LONG ULONG
668 %token <PrimType> FLOAT DOUBLE TYPE LABEL
670 %token <StrVal> VAR_ID LABELSTR STRINGCONSTANT
671 %type <StrVal> OptVAR_ID OptAssign FuncName
674 %token IMPLEMENTATION TRUE FALSE BEGINTOK ENDTOK DECLARE GLOBAL CONSTANT UNINIT
675 %token TO EXCEPT DOTDOTDOT STRING NULL_TOK CONST INTERNAL OPAQUE
677 // Basic Block Terminating Operators
678 %token <TermOpVal> RET BR SWITCH
681 %type <UnaryOpVal> UnaryOps // all the unary operators
682 %token <UnaryOpVal> NOT
685 %type <BinaryOpVal> BinaryOps // all the binary operators
686 %token <BinaryOpVal> ADD SUB MUL DIV REM AND OR XOR
687 %token <BinaryOpVal> SETLE SETGE SETLT SETGT SETEQ SETNE // Binary Comarators
689 // Memory Instructions
690 %token <MemoryOpVal> MALLOC ALLOCA FREE LOAD STORE GETELEMENTPTR
693 %type <OtherOpVal> ShiftOps
694 %token <OtherOpVal> PHI CALL INVOKE CAST SHL SHR
699 // Handle constant integer size restriction and conversion...
704 if ($1 > (uint32_t)INT32_MAX) // Outside of my range!
705 ThrowException("Value too large for type!");
710 EINT64VAL : ESINT64VAL; // These have same type and can't cause problems...
711 EINT64VAL : EUINT64VAL {
712 if ($1 > (uint64_t)INT64_MAX) // Outside of my range!
713 ThrowException("Value too large for type!");
717 // Operations that are notably excluded from this list include:
718 // RET, BR, & SWITCH because they end basic blocks and are treated specially.
721 BinaryOps : ADD | SUB | MUL | DIV | REM | AND | OR | XOR;
722 BinaryOps : SETLE | SETGE | SETLT | SETGT | SETEQ | SETNE;
723 ShiftOps : SHL | SHR;
725 // These are some types that allow classification if we only want a particular
726 // thing... for example, only a signed, unsigned, or integral type.
727 SIntType : LONG | INT | SHORT | SBYTE;
728 UIntType : ULONG | UINT | USHORT | UBYTE;
729 IntType : SIntType | UIntType;
730 FPType : FLOAT | DOUBLE;
732 // OptAssign - Value producing statements have an optional assignment component
733 OptAssign : VAR_ID '=' {
740 OptInternal : INTERNAL { $$ = true; } | /*empty*/ { $$ = false; };
742 //===----------------------------------------------------------------------===//
743 // Types includes all predefined types... except void, because it can only be
744 // used in specific contexts (method returning void for example). To have
745 // access to it, a user must explicitly use TypesV.
748 // TypesV includes all of 'Types', but it also includes the void type.
749 TypesV : Types | VOID { $$ = new PATypeHolder($1); };
750 UpRTypesV : UpRTypes | VOID { $$ = new PATypeHolder($1); };
754 ThrowException("Invalid upreference in type: " + (*$1)->getDescription());
759 // Derived types are added later...
761 PrimType : BOOL | SBYTE | UBYTE | SHORT | USHORT | INT | UINT ;
762 PrimType : LONG | ULONG | FLOAT | DOUBLE | TYPE | LABEL;
764 $$ = new PATypeHolder(OpaqueType::get());
767 $$ = new PATypeHolder($1);
769 UpRTypes : ValueRef { // Named types are also simple types...
770 $$ = new PATypeHolder(getTypeVal($1));
773 // Include derived types in the Types production.
775 UpRTypes : '\\' EUINT64VAL { // Type UpReference
776 if ($2 > (uint64_t)INT64_MAX) ThrowException("Value out of range!");
777 OpaqueType *OT = OpaqueType::get(); // Use temporary placeholder
778 UpRefs.push_back(make_pair((unsigned)$2, OT)); // Add to vector...
779 $$ = new PATypeHolder(OT);
780 UR_OUT("New Upreference!\n");
782 | UpRTypesV '(' ArgTypeListI ')' { // Function derived type?
783 vector<const Type*> Params;
784 mapto($3->begin(), $3->end(), std::back_inserter(Params),
785 std::mem_fun_ref(&PATypeHandle<Type>::get));
786 bool isVarArg = Params.size() && Params.back() == Type::VoidTy;
787 if (isVarArg) Params.pop_back();
789 $$ = new PATypeHolder(HandleUpRefs(FunctionType::get(*$1,Params,isVarArg)));
790 delete $3; // Delete the argument list
791 delete $1; // Delete the old type handle
793 | '[' EUINT64VAL 'x' UpRTypes ']' { // Sized array type?
794 $$ = new PATypeHolder(HandleUpRefs(ArrayType::get(*$4, (unsigned)$2)));
797 | '{' TypeListI '}' { // Structure type?
798 vector<const Type*> Elements;
799 mapto($2->begin(), $2->end(), std::back_inserter(Elements),
800 std::mem_fun_ref(&PATypeHandle<Type>::get));
802 $$ = new PATypeHolder(HandleUpRefs(StructType::get(Elements)));
805 | '{' '}' { // Empty structure type?
806 $$ = new PATypeHolder(StructType::get(vector<const Type*>()));
808 | UpRTypes '*' { // Pointer type?
809 $$ = new PATypeHolder(HandleUpRefs(PointerType::get(*$1)));
813 // TypeList - Used for struct declarations and as a basis for method type
814 // declaration type lists
816 TypeListI : UpRTypes {
817 $$ = new list<PATypeHolder>();
818 $$->push_back(*$1); delete $1;
820 | TypeListI ',' UpRTypes {
821 ($$=$1)->push_back(*$3); delete $3;
824 // ArgTypeList - List of types for a method type declaration...
825 ArgTypeListI : TypeListI
826 | TypeListI ',' DOTDOTDOT {
827 ($$=$1)->push_back(Type::VoidTy);
830 ($$ = new list<PATypeHolder>())->push_back(Type::VoidTy);
833 $$ = new list<PATypeHolder>();
837 // ConstVal - The various declarations that go into the constant pool. This
838 // includes all forward declarations of types, constants, and functions.
840 ConstVal: Types '[' ConstVector ']' { // Nonempty unsized arr
841 const ArrayType *ATy = dyn_cast<const ArrayType>($1->get());
843 ThrowException("Cannot make array constant with type: '" +
844 (*$1)->getDescription() + "'!");
845 const Type *ETy = ATy->getElementType();
846 int NumElements = ATy->getNumElements();
848 // Verify that we have the correct size...
849 if (NumElements != -1 && NumElements != (int)$3->size())
850 ThrowException("Type mismatch: constant sized array initialized with " +
851 utostr($3->size()) + " arguments, but has size of " +
852 itostr(NumElements) + "!");
854 // Verify all elements are correct type!
855 for (unsigned i = 0; i < $3->size(); i++) {
856 if (ETy != (*$3)[i]->getType())
857 ThrowException("Element #" + utostr(i) + " is not of type '" +
858 ETy->getDescription() +"' as required!\nIt is of type '"+
859 (*$3)[i]->getType()->getDescription() + "'.");
862 $$ = ConstantArray::get(ATy, *$3);
863 delete $1; delete $3;
866 const ArrayType *ATy = dyn_cast<const ArrayType>($1->get());
868 ThrowException("Cannot make array constant with type: '" +
869 (*$1)->getDescription() + "'!");
871 int NumElements = ATy->getNumElements();
872 if (NumElements != -1 && NumElements != 0)
873 ThrowException("Type mismatch: constant sized array initialized with 0"
874 " arguments, but has size of " + itostr(NumElements) +"!");
875 $$ = ConstantArray::get(ATy, vector<Constant*>());
878 | Types 'c' STRINGCONSTANT {
879 const ArrayType *ATy = dyn_cast<const ArrayType>($1->get());
881 ThrowException("Cannot make array constant with type: '" +
882 (*$1)->getDescription() + "'!");
884 int NumElements = ATy->getNumElements();
885 const Type *ETy = ATy->getElementType();
886 char *EndStr = UnEscapeLexed($3, true);
887 if (NumElements != -1 && NumElements != (EndStr-$3))
888 ThrowException("Can't build string constant of size " +
889 itostr((int)(EndStr-$3)) +
890 " when array has size " + itostr(NumElements) + "!");
891 vector<Constant*> Vals;
892 if (ETy == Type::SByteTy) {
893 for (char *C = $3; C != EndStr; ++C)
894 Vals.push_back(ConstantSInt::get(ETy, *C));
895 } else if (ETy == Type::UByteTy) {
896 for (char *C = $3; C != EndStr; ++C)
897 Vals.push_back(ConstantUInt::get(ETy, *C));
900 ThrowException("Cannot build string arrays of non byte sized elements!");
903 $$ = ConstantArray::get(ATy, Vals);
906 | Types '{' ConstVector '}' {
907 const StructType *STy = dyn_cast<const StructType>($1->get());
909 ThrowException("Cannot make struct constant with type: '" +
910 (*$1)->getDescription() + "'!");
911 // FIXME: TODO: Check to see that the constants are compatible with the type
913 $$ = ConstantStruct::get(STy, *$3);
914 delete $1; delete $3;
917 const PointerType *PTy = dyn_cast<const PointerType>($1->get());
919 ThrowException("Cannot make null pointer constant with type: '" +
920 (*$1)->getDescription() + "'!");
922 $$ = ConstantPointerNull::get(PTy);
925 | Types SymbolicValueRef {
926 const PointerType *Ty = dyn_cast<const PointerType>($1->get());
928 ThrowException("Global const reference must be a pointer type!");
930 Value *V = getValNonImprovising(Ty, $2);
932 // If this is an initializer for a constant pointer, which is referencing a
933 // (currently) undefined variable, create a stub now that shall be replaced
934 // in the future with the right type of variable.
937 assert(isa<PointerType>(Ty) && "Globals may only be used as pointers!");
938 const PointerType *PT = cast<PointerType>(Ty);
940 // First check to see if the forward references value is already created!
941 PerModuleInfo::GlobalRefsType::iterator I =
942 CurModule.GlobalRefs.find(make_pair(PT, $2));
944 if (I != CurModule.GlobalRefs.end()) {
945 V = I->second; // Placeholder already exists, use it...
947 // TODO: Include line number info by creating a subclass of
948 // TODO: GlobalVariable here that includes the said information!
950 // Create a placeholder for the global variable reference...
951 GlobalVariable *GV = new GlobalVariable(PT->getElementType(),
953 // Keep track of the fact that we have a forward ref to recycle it
954 CurModule.GlobalRefs.insert(make_pair(make_pair(PT, $2), GV));
956 // Must temporarily push this value into the module table...
957 CurModule.CurrentModule->getGlobalList().push_back(GV);
962 GlobalValue *GV = cast<GlobalValue>(V);
963 $$ = ConstantPointerRef::get(GV);
964 delete $1; // Free the type handle
968 ConstVal : SIntType EINT64VAL { // integral constants
969 if (!ConstantSInt::isValueValidForType($1, $2))
970 ThrowException("Constant value doesn't fit in type!");
971 $$ = ConstantSInt::get($1, $2);
973 | UIntType EUINT64VAL { // integral constants
974 if (!ConstantUInt::isValueValidForType($1, $2))
975 ThrowException("Constant value doesn't fit in type!");
976 $$ = ConstantUInt::get($1, $2);
978 | BOOL TRUE { // Boolean constants
979 $$ = ConstantBool::True;
981 | BOOL FALSE { // Boolean constants
982 $$ = ConstantBool::False;
984 | FPType FPVAL { // Float & Double constants
985 $$ = ConstantFP::get($1, $2);
988 // ConstVector - A list of comma seperated constants.
989 ConstVector : ConstVector ',' ConstVal {
990 ($$ = $1)->push_back($3);
993 $$ = new vector<Constant*>();
998 // GlobalType - Match either GLOBAL or CONSTANT for global declarations...
999 GlobalType : GLOBAL { $$ = false; } | CONSTANT { $$ = true; };
1002 //===----------------------------------------------------------------------===//
1003 // Rules to match Modules
1004 //===----------------------------------------------------------------------===//
1006 // Module rule: Capture the result of parsing the whole file into a result
1009 Module : FunctionList {
1010 $$ = ParserResult = $1;
1011 CurModule.ModuleDone();
1014 // FunctionList - A list of methods, preceeded by a constant pool.
1016 FunctionList : FunctionList Function {
1018 assert($2->getParent() == 0 && "Function already in module!");
1019 $1->getFunctionList().push_back($2);
1020 CurMeth.FunctionDone();
1022 | FunctionList FunctionProto {
1025 | FunctionList IMPLEMENTATION {
1029 $$ = CurModule.CurrentModule;
1030 // Resolve circular types before we parse the body of the module
1031 ResolveTypes(CurModule.LateResolveTypes);
1034 // ConstPool - Constants with optional names assigned to them.
1035 ConstPool : ConstPool OptAssign CONST ConstVal {
1036 if (setValueName($4, $2)) { assert(0 && "No redefinitions allowed!"); }
1039 | ConstPool OptAssign TYPE TypesV { // Types can be defined in the const pool
1040 // Eagerly resolve types. This is not an optimization, this is a
1041 // requirement that is due to the fact that we could have this:
1043 // %list = type { %list * }
1044 // %list = type { %list * } ; repeated type decl
1046 // If types are not resolved eagerly, then the two types will not be
1047 // determined to be the same type!
1049 ResolveTypeTo($2, $4->get());
1051 // TODO: FIXME when Type are not const
1052 if (!setValueName(const_cast<Type*>($4->get()), $2)) {
1053 // If this is not a redefinition of a type...
1055 InsertType($4->get(),
1056 inFunctionScope() ? CurMeth.Types : CurModule.Types);
1062 | ConstPool FunctionProto { // Function prototypes can be in const pool
1064 | ConstPool OptAssign OptInternal GlobalType ConstVal {
1065 const Type *Ty = $5->getType();
1066 // Global declarations appear in Constant Pool
1067 Constant *Initializer = $5;
1068 if (Initializer == 0)
1069 ThrowException("Global value initializer is not a constant!");
1071 GlobalVariable *GV = new GlobalVariable(Ty, $4, $3, Initializer);
1072 if (!setValueName(GV, $2)) { // If not redefining...
1073 CurModule.CurrentModule->getGlobalList().push_back(GV);
1074 int Slot = InsertValue(GV, CurModule.Values);
1077 CurModule.DeclareNewGlobalValue(GV, ValID::create(Slot));
1079 CurModule.DeclareNewGlobalValue(GV, ValID::create(
1080 (char*)GV->getName().c_str()));
1084 | ConstPool OptAssign OptInternal UNINIT GlobalType Types {
1085 const Type *Ty = *$6;
1086 // Global declarations appear in Constant Pool
1087 GlobalVariable *GV = new GlobalVariable(Ty, $5, $3);
1088 if (!setValueName(GV, $2)) { // If not redefining...
1089 CurModule.CurrentModule->getGlobalList().push_back(GV);
1090 int Slot = InsertValue(GV, CurModule.Values);
1093 CurModule.DeclareNewGlobalValue(GV, ValID::create(Slot));
1095 assert(GV->hasName() && "Not named and not numbered!?");
1096 CurModule.DeclareNewGlobalValue(GV, ValID::create(
1097 (char*)GV->getName().c_str()));
1102 | /* empty: end of list */ {
1106 //===----------------------------------------------------------------------===//
1107 // Rules to match Function Headers
1108 //===----------------------------------------------------------------------===//
1110 OptVAR_ID : VAR_ID | /*empty*/ { $$ = 0; };
1112 ArgVal : Types OptVAR_ID {
1113 $$ = new pair<Argument*, char*>(new Argument(*$1), $2);
1114 delete $1; // Delete the type handle..
1117 ArgListH : ArgVal ',' ArgListH {
1119 $3->push_front(*$1);
1123 $$ = new list<pair<Argument*,char*> >();
1124 $$->push_front(*$1);
1128 $$ = new list<pair<Argument*, char*> >();
1129 $$->push_front(pair<Argument*,char*>(new Argument(Type::VoidTy), 0));
1132 ArgList : ArgListH {
1139 FuncName : VAR_ID | STRINGCONSTANT;
1141 FunctionHeaderH : OptInternal TypesV FuncName '(' ArgList ')' {
1143 string FunctionName($3);
1145 vector<const Type*> ParamTypeList;
1147 for (list<pair<Argument*,char*> >::iterator I = $5->begin();
1148 I != $5->end(); ++I)
1149 ParamTypeList.push_back(I->first->getType());
1151 bool isVarArg = ParamTypeList.size() && ParamTypeList.back() == Type::VoidTy;
1152 if (isVarArg) ParamTypeList.pop_back();
1154 const FunctionType *MT = FunctionType::get(*$2, ParamTypeList, isVarArg);
1155 const PointerType *PMT = PointerType::get(MT);
1159 if (SymbolTable *ST = CurModule.CurrentModule->getSymbolTable()) {
1160 // Is the function already in symtab?
1161 if (Value *V = ST->lookup(PMT, FunctionName)) {
1162 M = cast<Function>(V);
1164 // Yes it is. If this is the case, either we need to be a forward decl,
1165 // or it needs to be.
1166 if (!CurMeth.isDeclare && !M->isExternal())
1167 ThrowException("Redefinition of method '" + FunctionName + "'!");
1169 // If we found a preexisting method prototype, remove it from the module,
1170 // so that we don't get spurious conflicts with global & local variables.
1172 CurModule.CurrentModule->getFunctionList().remove(M);
1176 if (M == 0) { // Not already defined?
1177 M = new Function(MT, $1, FunctionName);
1178 InsertValue(M, CurModule.Values);
1179 CurModule.DeclareNewGlobalValue(M, ValID::create($3));
1181 free($3); // Free strdup'd memory!
1183 CurMeth.FunctionStart(M);
1185 // Add all of the arguments we parsed to the method...
1186 if ($5 && !CurMeth.isDeclare) { // Is null if empty...
1187 Function::ArgumentListType &ArgList = M->getArgumentList();
1189 for (list<pair<Argument*, char*> >::iterator I = $5->begin();
1190 I != $5->end(); ++I) {
1191 if (setValueName(I->first, I->second)) { // Insert into symtab...
1192 assert(0 && "No arg redef allowed!");
1195 InsertValue(I->first);
1196 ArgList.push_back(I->first);
1198 delete $5; // We're now done with the argument list
1200 // If we are a declaration, we should free the memory for the argument list!
1201 for (list<pair<Argument*, char*> >::iterator I = $5->begin(), E = $5->end();
1203 if (I->second) free(I->second); // Free the memory for the name...
1204 delete I->first; // Free the unused function argument
1206 delete $5; // Free the memory for the list itself
1210 BEGIN : BEGINTOK | '{'; // Allow BEGIN or '{' to start a function
1212 FunctionHeader : FunctionHeaderH BEGIN {
1213 $$ = CurMeth.CurrentFunction;
1215 // Resolve circular types before we parse the body of the method.
1216 ResolveTypes(CurMeth.LateResolveTypes);
1219 END : ENDTOK | '}'; // Allow end of '}' to end a function
1221 Function : BasicBlockList END {
1225 FunctionProto : DECLARE { CurMeth.isDeclare = true; } FunctionHeaderH {
1226 $$ = CurMeth.CurrentFunction;
1227 assert($$->getParent() == 0 && "Function already in module!");
1228 CurModule.CurrentModule->getFunctionList().push_back($$);
1229 CurMeth.FunctionDone();
1232 //===----------------------------------------------------------------------===//
1233 // Rules to match Basic Blocks
1234 //===----------------------------------------------------------------------===//
1236 ConstValueRef : ESINT64VAL { // A reference to a direct constant
1237 $$ = ValID::create($1);
1240 $$ = ValID::create($1);
1242 | FPVAL { // Perhaps it's an FP constant?
1243 $$ = ValID::create($1);
1246 $$ = ValID::create((int64_t)1);
1249 $$ = ValID::create((int64_t)0);
1252 $$ = ValID::createNull();
1255 // SymbolicValueRef - Reference to one of two ways of symbolically refering to
1258 SymbolicValueRef : INTVAL { // Is it an integer reference...?
1259 $$ = ValID::create($1);
1261 | VAR_ID { // Is it a named reference...?
1262 $$ = ValID::create($1);
1265 // ValueRef - A reference to a definition... either constant or symbolic
1266 ValueRef : SymbolicValueRef | ConstValueRef;
1269 // ResolvedVal - a <type> <value> pair. This is used only in cases where the
1270 // type immediately preceeds the value reference, and allows complex constant
1271 // pool references (for things like: 'ret [2 x int] [ int 12, int 42]')
1272 ResolvedVal : Types ValueRef {
1273 $$ = getVal(*$1, $2); delete $1;
1277 BasicBlockList : BasicBlockList BasicBlock {
1278 ($$ = $1)->getBasicBlocks().push_back($2);
1280 | FunctionHeader BasicBlock { // Do not allow methods with 0 basic blocks
1281 ($$ = $1)->getBasicBlocks().push_back($2);
1285 // Basic blocks are terminated by branching instructions:
1286 // br, br/cc, switch, ret
1288 BasicBlock : InstructionList OptAssign BBTerminatorInst {
1289 if (setValueName($3, $2)) { assert(0 && "No redefn allowed!"); }
1292 $1->getInstList().push_back($3);
1296 | LABELSTR InstructionList OptAssign BBTerminatorInst {
1297 if (setValueName($4, $3)) { assert(0 && "No redefn allowed!"); }
1300 $2->getInstList().push_back($4);
1301 if (setValueName($2, $1)) { assert(0 && "No label redef allowed!"); }
1307 InstructionList : InstructionList Inst {
1308 $1->getInstList().push_back($2);
1312 $$ = new BasicBlock();
1315 BBTerminatorInst : RET ResolvedVal { // Return with a result...
1316 $$ = new ReturnInst($2);
1318 | RET VOID { // Return with no result...
1319 $$ = new ReturnInst();
1321 | BR LABEL ValueRef { // Unconditional Branch...
1322 $$ = new BranchInst(cast<BasicBlock>(getVal(Type::LabelTy, $3)));
1323 } // Conditional Branch...
1324 | BR BOOL ValueRef ',' LABEL ValueRef ',' LABEL ValueRef {
1325 $$ = new BranchInst(cast<BasicBlock>(getVal(Type::LabelTy, $6)),
1326 cast<BasicBlock>(getVal(Type::LabelTy, $9)),
1327 getVal(Type::BoolTy, $3));
1329 | SWITCH IntType ValueRef ',' LABEL ValueRef '[' JumpTable ']' {
1330 SwitchInst *S = new SwitchInst(getVal($2, $3),
1331 cast<BasicBlock>(getVal(Type::LabelTy, $6)));
1334 vector<pair<Constant*,BasicBlock*> >::iterator I = $8->begin(),
1337 S->dest_push_back(I->first, I->second);
1339 | INVOKE TypesV ValueRef '(' ValueRefListE ')' TO ResolvedVal
1340 EXCEPT ResolvedVal {
1341 const PointerType *PMTy;
1342 const FunctionType *Ty;
1344 if (!(PMTy = dyn_cast<PointerType>($2->get())) ||
1345 !(Ty = dyn_cast<FunctionType>(PMTy->getElementType()))) {
1346 // Pull out the types of all of the arguments...
1347 vector<const Type*> ParamTypes;
1349 for (vector<Value*>::iterator I = $5->begin(), E = $5->end(); I!=E; ++I)
1350 ParamTypes.push_back((*I)->getType());
1353 bool isVarArg = ParamTypes.size() && ParamTypes.back() == Type::VoidTy;
1354 if (isVarArg) ParamTypes.pop_back();
1356 Ty = FunctionType::get($2->get(), ParamTypes, isVarArg);
1357 PMTy = PointerType::get(Ty);
1361 Value *V = getVal(PMTy, $3); // Get the method we're calling...
1363 BasicBlock *Normal = dyn_cast<BasicBlock>($8);
1364 BasicBlock *Except = dyn_cast<BasicBlock>($10);
1366 if (Normal == 0 || Except == 0)
1367 ThrowException("Invoke instruction without label destinations!");
1369 // Create the call node...
1370 if (!$5) { // Has no arguments?
1371 $$ = new InvokeInst(V, Normal, Except, vector<Value*>());
1372 } else { // Has arguments?
1373 // Loop through FunctionType's arguments and ensure they are specified
1376 FunctionType::ParamTypes::const_iterator I = Ty->getParamTypes().begin();
1377 FunctionType::ParamTypes::const_iterator E = Ty->getParamTypes().end();
1378 vector<Value*>::iterator ArgI = $5->begin(), ArgE = $5->end();
1380 for (; ArgI != ArgE && I != E; ++ArgI, ++I)
1381 if ((*ArgI)->getType() != *I)
1382 ThrowException("Parameter " +(*ArgI)->getName()+ " is not of type '" +
1383 (*I)->getDescription() + "'!");
1385 if (I != E || (ArgI != ArgE && !Ty->isVarArg()))
1386 ThrowException("Invalid number of parameters detected!");
1388 $$ = new InvokeInst(V, Normal, Except, *$5);
1395 JumpTable : JumpTable IntType ConstValueRef ',' LABEL ValueRef {
1397 Constant *V = cast<Constant>(getValNonImprovising($2, $3));
1399 ThrowException("May only switch on a constant pool value!");
1401 $$->push_back(make_pair(V, cast<BasicBlock>(getVal($5, $6))));
1403 | IntType ConstValueRef ',' LABEL ValueRef {
1404 $$ = new vector<pair<Constant*, BasicBlock*> >();
1405 Constant *V = cast<Constant>(getValNonImprovising($1, $2));
1408 ThrowException("May only switch on a constant pool value!");
1410 $$->push_back(make_pair(V, cast<BasicBlock>(getVal($4, $5))));
1413 Inst : OptAssign InstVal {
1414 // Is this definition named?? if so, assign the name...
1415 if (setValueName($2, $1)) { assert(0 && "No redefin allowed!"); }
1420 PHIList : Types '[' ValueRef ',' ValueRef ']' { // Used for PHI nodes
1421 $$ = new list<pair<Value*, BasicBlock*> >();
1422 $$->push_back(make_pair(getVal(*$1, $3),
1423 cast<BasicBlock>(getVal(Type::LabelTy, $5))));
1426 | PHIList ',' '[' ValueRef ',' ValueRef ']' {
1428 $1->push_back(make_pair(getVal($1->front().first->getType(), $4),
1429 cast<BasicBlock>(getVal(Type::LabelTy, $6))));
1433 ValueRefList : ResolvedVal { // Used for call statements, and memory insts...
1434 $$ = new vector<Value*>();
1437 | ValueRefList ',' ResolvedVal {
1442 // ValueRefListE - Just like ValueRefList, except that it may also be empty!
1443 ValueRefListE : ValueRefList | /*empty*/ { $$ = 0; };
1445 InstVal : BinaryOps Types ValueRef ',' ValueRef {
1446 $$ = BinaryOperator::create($1, getVal(*$2, $3), getVal(*$2, $5));
1448 ThrowException("binary operator returned null!");
1451 | UnaryOps ResolvedVal {
1452 $$ = UnaryOperator::create($1, $2);
1454 ThrowException("unary operator returned null!");
1456 | ShiftOps ResolvedVal ',' ResolvedVal {
1457 if ($4->getType() != Type::UByteTy)
1458 ThrowException("Shift amount must be ubyte!");
1459 $$ = new ShiftInst($1, $2, $4);
1461 | CAST ResolvedVal TO Types {
1462 $$ = new CastInst($2, *$4);
1466 const Type *Ty = $2->front().first->getType();
1467 $$ = new PHINode(Ty);
1468 while ($2->begin() != $2->end()) {
1469 if ($2->front().first->getType() != Ty)
1470 ThrowException("All elements of a PHI node must be of the same type!");
1471 cast<PHINode>($$)->addIncoming($2->front().first, $2->front().second);
1474 delete $2; // Free the list...
1476 | CALL TypesV ValueRef '(' ValueRefListE ')' {
1477 const PointerType *PMTy;
1478 const FunctionType *Ty;
1480 if (!(PMTy = dyn_cast<PointerType>($2->get())) ||
1481 !(Ty = dyn_cast<FunctionType>(PMTy->getElementType()))) {
1482 // Pull out the types of all of the arguments...
1483 vector<const Type*> ParamTypes;
1485 for (vector<Value*>::iterator I = $5->begin(), E = $5->end(); I!=E; ++I)
1486 ParamTypes.push_back((*I)->getType());
1489 bool isVarArg = ParamTypes.size() && ParamTypes.back() == Type::VoidTy;
1490 if (isVarArg) ParamTypes.pop_back();
1492 Ty = FunctionType::get($2->get(), ParamTypes, isVarArg);
1493 PMTy = PointerType::get(Ty);
1497 Value *V = getVal(PMTy, $3); // Get the method we're calling...
1499 // Create the call node...
1500 if (!$5) { // Has no arguments?
1501 $$ = new CallInst(V, vector<Value*>());
1502 } else { // Has arguments?
1503 // Loop through FunctionType's arguments and ensure they are specified
1506 FunctionType::ParamTypes::const_iterator I = Ty->getParamTypes().begin();
1507 FunctionType::ParamTypes::const_iterator E = Ty->getParamTypes().end();
1508 vector<Value*>::iterator ArgI = $5->begin(), ArgE = $5->end();
1510 for (; ArgI != ArgE && I != E; ++ArgI, ++I)
1511 if ((*ArgI)->getType() != *I)
1512 ThrowException("Parameter " +(*ArgI)->getName()+ " is not of type '" +
1513 (*I)->getDescription() + "'!");
1515 if (I != E || (ArgI != ArgE && !Ty->isVarArg()))
1516 ThrowException("Invalid number of parameters detected!");
1518 $$ = new CallInst(V, *$5);
1527 // IndexList - List of indices for GEP based instructions...
1528 IndexList : ',' ValueRefList {
1531 $$ = new vector<Value*>();
1534 MemoryInst : MALLOC Types {
1535 $$ = new MallocInst(PointerType::get(*$2));
1538 | MALLOC Types ',' UINT ValueRef {
1539 const Type *Ty = PointerType::get(*$2);
1540 $$ = new MallocInst(Ty, getVal($4, $5));
1544 $$ = new AllocaInst(PointerType::get(*$2));
1547 | ALLOCA Types ',' UINT ValueRef {
1548 const Type *Ty = PointerType::get(*$2);
1549 Value *ArrSize = getVal($4, $5);
1550 $$ = new AllocaInst(Ty, ArrSize);
1553 | FREE ResolvedVal {
1554 if (!isa<PointerType>($2->getType()))
1555 ThrowException("Trying to free nonpointer type " +
1556 $2->getType()->getDescription() + "!");
1557 $$ = new FreeInst($2);
1560 | LOAD Types ValueRef IndexList {
1561 if (!isa<PointerType>($2->get()))
1562 ThrowException("Can't load from nonpointer type: " +
1563 (*$2)->getDescription());
1564 if (LoadInst::getIndexedType(*$2, *$4) == 0)
1565 ThrowException("Invalid indices for load instruction!");
1567 $$ = new LoadInst(getVal(*$2, $3), *$4);
1568 delete $4; // Free the vector...
1571 | STORE ResolvedVal ',' Types ValueRef IndexList {
1572 if (!isa<PointerType>($4->get()))
1573 ThrowException("Can't store to a nonpointer type: " +
1574 (*$4)->getDescription());
1575 const Type *ElTy = StoreInst::getIndexedType(*$4, *$6);
1577 ThrowException("Can't store into that field list!");
1578 if (ElTy != $2->getType())
1579 ThrowException("Can't store '" + $2->getType()->getDescription() +
1580 "' into space of type '" + ElTy->getDescription() + "'!");
1581 $$ = new StoreInst($2, getVal(*$4, $5), *$6);
1582 delete $4; delete $6;
1584 | GETELEMENTPTR Types ValueRef IndexList {
1585 if (!isa<PointerType>($2->get()))
1586 ThrowException("getelementptr insn requires pointer operand!");
1587 if (!GetElementPtrInst::getIndexedType(*$2, *$4, true))
1588 ThrowException("Can't get element ptr '" + (*$2)->getDescription()+ "'!");
1589 $$ = new GetElementPtrInst(getVal(*$2, $3), *$4);
1590 delete $2; delete $4;
1594 int yyerror(const char *ErrorMsg) {
1595 ThrowException(string("Parse error: ") + ErrorMsg);