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/Assembly/Parser.h"
10 #include "llvm/SymbolTable.h"
11 #include "llvm/Module.h"
12 #include "llvm/GlobalVariable.h"
13 #include "llvm/Function.h"
14 #include "llvm/BasicBlock.h"
15 #include "llvm/DerivedTypes.h"
16 #include "llvm/iTerminators.h"
17 #include "llvm/iMemory.h"
18 #include "llvm/iPHINode.h"
19 #include "Support/STLExtras.h"
20 #include "Support/DepthFirstIterator.h"
22 #include <utility> // Get definition of pair class
24 #include <stdio.h> // This embarasment is due to our flex lexer...
35 int yyerror(const char *ErrorMsg); // Forward declarations to prevent "implicit
36 int yylex(); // declaration" of xxx warnings.
39 static Module *ParserResult;
42 // DEBUG_UPREFS - Define this symbol if you want to enable debugging output
43 // relating to upreferences in the input stream.
45 //#define DEBUG_UPREFS 1
47 #define UR_OUT(X) cerr << X
52 // This contains info used when building the body of a method. It is destroyed
53 // when the method is completed.
55 typedef vector<Value *> ValueList; // Numbered defs
56 static void ResolveDefinitions(vector<ValueList> &LateResolvers,
57 vector<ValueList> *FutureLateResolvers = 0);
59 static struct PerModuleInfo {
60 Module *CurrentModule;
61 vector<ValueList> Values; // Module level numbered definitions
62 vector<ValueList> LateResolveValues;
63 vector<PATypeHolder<Type> > Types;
64 map<ValID, PATypeHolder<Type> > LateResolveTypes;
66 // GlobalRefs - This maintains a mapping between <Type, ValID>'s and forward
67 // references to global values. Global values may be referenced before they
68 // are defined, and if so, the temporary object that they represent is held
69 // here. This is used for forward references of ConstantPointerRefs.
71 typedef map<pair<const PointerType *, ValID>, GlobalVariable*> GlobalRefsType;
72 GlobalRefsType GlobalRefs;
75 // If we could not resolve some methods at method compilation time (calls to
76 // methods before they are defined), resolve them now... Types are resolved
77 // when the constant pool has been completely parsed.
79 ResolveDefinitions(LateResolveValues);
81 // Check to make sure that all global value forward references have been
84 if (!GlobalRefs.empty()) {
85 string UndefinedReferences = "Unresolved global references exist:\n";
87 for (GlobalRefsType::iterator I = GlobalRefs.begin(), E =GlobalRefs.end();
89 UndefinedReferences += " " + I->first.first->getDescription() + " " +
90 I->first.second.getName() + "\n";
92 ThrowException(UndefinedReferences);
95 Values.clear(); // Clear out method local definitions
101 // DeclareNewGlobalValue - Called every type a new GV has been defined. This
102 // is used to remove things from the forward declaration map, resolving them
103 // to the correct thing as needed.
105 void DeclareNewGlobalValue(GlobalValue *GV, ValID D) {
106 // Check to see if there is a forward reference to this global variable...
107 // if there is, eliminate it and patch the reference to use the new def'n.
108 GlobalRefsType::iterator I = GlobalRefs.find(make_pair(GV->getType(), D));
110 if (I != GlobalRefs.end()) {
111 GlobalVariable *OldGV = I->second; // Get the placeholder...
112 I->first.second.destroy(); // Free string memory if neccesary
114 // Loop over all of the uses of the GlobalValue. The only thing they are
115 // allowed to be at this point is ConstantPointerRef's.
116 assert(OldGV->use_size() == 1 && "Only one reference should exist!");
117 while (!OldGV->use_empty()) {
118 User *U = OldGV->use_back(); // Must be a ConstantPointerRef...
119 ConstantPointerRef *CPPR = cast<ConstantPointerRef>(U);
120 assert(CPPR->getValue() == OldGV && "Something isn't happy");
122 // Change the const pool reference to point to the real global variable
123 // now. This should drop a use from the OldGV.
124 CPPR->mutateReference(GV);
127 // Remove GV from the module...
128 CurrentModule->getGlobalList().remove(OldGV);
129 delete OldGV; // Delete the old placeholder
131 // Remove the map entry for the global now that it has been created...
138 static struct PerFunctionInfo {
139 Function *CurrentFunction; // Pointer to current method being created
141 vector<ValueList> Values; // Keep track of numbered definitions
142 vector<ValueList> LateResolveValues;
143 vector<PATypeHolder<Type> > Types;
144 map<ValID, PATypeHolder<Type> > LateResolveTypes;
145 bool isDeclare; // Is this method a forward declararation?
147 inline PerFunctionInfo() {
152 inline ~PerFunctionInfo() {}
154 inline void FunctionStart(Function *M) {
158 void FunctionDone() {
159 // If we could not resolve some blocks at parsing time (forward branches)
160 // resolve the branches now...
161 ResolveDefinitions(LateResolveValues, &CurModule.LateResolveValues);
163 Values.clear(); // Clear out method local definitions
168 } CurMeth; // Info for the current method...
170 static bool inFunctionScope() { return CurMeth.CurrentFunction != 0; }
173 //===----------------------------------------------------------------------===//
174 // Code to handle definitions of all the types
175 //===----------------------------------------------------------------------===//
177 static int InsertValue(Value *D, vector<ValueList> &ValueTab = CurMeth.Values) {
178 if (D->hasName()) return -1; // Is this a numbered definition?
180 // Yes, insert the value into the value table...
181 unsigned type = D->getType()->getUniqueID();
182 if (ValueTab.size() <= type)
183 ValueTab.resize(type+1, ValueList());
184 //printf("Values[%d][%d] = %d\n", type, ValueTab[type].size(), D);
185 ValueTab[type].push_back(D);
186 return ValueTab[type].size()-1;
189 // TODO: FIXME when Type are not const
190 static void InsertType(const Type *Ty, vector<PATypeHolder<Type> > &Types) {
194 static const Type *getTypeVal(const ValID &D, bool DoNotImprovise = false) {
196 case 0: { // Is it a numbered definition?
197 unsigned Num = (unsigned)D.Num;
199 // Module constants occupy the lowest numbered slots...
200 if (Num < CurModule.Types.size())
201 return CurModule.Types[Num];
203 Num -= CurModule.Types.size();
205 // Check that the number is within bounds...
206 if (Num <= CurMeth.Types.size())
207 return CurMeth.Types[Num];
210 case 1: { // Is it a named definition?
212 SymbolTable *SymTab = 0;
213 if (inFunctionScope()) SymTab = CurMeth.CurrentFunction->getSymbolTable();
214 Value *N = SymTab ? SymTab->lookup(Type::TypeTy, Name) : 0;
217 // Symbol table doesn't automatically chain yet... because the method
218 // hasn't been added to the module...
220 SymTab = CurModule.CurrentModule->getSymbolTable();
222 N = SymTab->lookup(Type::TypeTy, Name);
226 D.destroy(); // Free old strdup'd memory...
227 return cast<const Type>(N);
230 ThrowException("Invalid symbol type reference!");
233 // If we reached here, we referenced either a symbol that we don't know about
234 // or an id number that hasn't been read yet. We may be referencing something
235 // forward, so just create an entry to be resolved later and get to it...
237 if (DoNotImprovise) return 0; // Do we just want a null to be returned?
239 map<ValID, PATypeHolder<Type> > &LateResolver = inFunctionScope() ?
240 CurMeth.LateResolveTypes : CurModule.LateResolveTypes;
242 map<ValID, PATypeHolder<Type> >::iterator I = LateResolver.find(D);
243 if (I != LateResolver.end()) {
247 Type *Typ = OpaqueType::get();
248 LateResolver.insert(make_pair(D, Typ));
252 static Value *lookupInSymbolTable(const Type *Ty, const string &Name) {
253 SymbolTable *SymTab =
254 inFunctionScope() ? CurMeth.CurrentFunction->getSymbolTable() : 0;
255 Value *N = SymTab ? SymTab->lookup(Ty, Name) : 0;
258 // Symbol table doesn't automatically chain yet... because the method
259 // hasn't been added to the module...
261 SymTab = CurModule.CurrentModule->getSymbolTable();
263 N = SymTab->lookup(Ty, Name);
269 // getValNonImprovising - Look up the value specified by the provided type and
270 // the provided ValID. If the value exists and has already been defined, return
271 // it. Otherwise return null.
273 static Value *getValNonImprovising(const Type *Ty, const ValID &D) {
274 if (isa<FunctionType>(Ty))
275 ThrowException("Functions are not values and "
276 "must be referenced as pointers");
279 case ValID::NumberVal: { // Is it a numbered definition?
280 unsigned type = Ty->getUniqueID();
281 unsigned Num = (unsigned)D.Num;
283 // Module constants occupy the lowest numbered slots...
284 if (type < CurModule.Values.size()) {
285 if (Num < CurModule.Values[type].size())
286 return CurModule.Values[type][Num];
288 Num -= CurModule.Values[type].size();
291 // Make sure that our type is within bounds
292 if (CurMeth.Values.size() <= type) return 0;
294 // Check that the number is within bounds...
295 if (CurMeth.Values[type].size() <= Num) return 0;
297 return CurMeth.Values[type][Num];
300 case ValID::NameVal: { // Is it a named definition?
301 Value *N = lookupInSymbolTable(Ty, string(D.Name));
302 if (N == 0) return 0;
304 D.destroy(); // Free old strdup'd memory...
308 // Check to make sure that "Ty" is an integral type, and that our
309 // value will fit into the specified type...
310 case ValID::ConstSIntVal: // Is it a constant pool reference??
311 if (Ty == Type::BoolTy) { // Special handling for boolean data
312 return ConstantBool::get(D.ConstPool64 != 0);
314 if (!ConstantSInt::isValueValidForType(Ty, D.ConstPool64))
315 ThrowException("Symbolic constant pool value '" +
316 itostr(D.ConstPool64) + "' is invalid for type '" +
317 Ty->getDescription() + "'!");
318 return ConstantSInt::get(Ty, D.ConstPool64);
321 case ValID::ConstUIntVal: // Is it an unsigned const pool reference?
322 if (!ConstantUInt::isValueValidForType(Ty, D.UConstPool64)) {
323 if (!ConstantSInt::isValueValidForType(Ty, D.ConstPool64)) {
324 ThrowException("Integral constant pool reference is invalid!");
325 } else { // This is really a signed reference. Transmogrify.
326 return ConstantSInt::get(Ty, D.ConstPool64);
329 return ConstantUInt::get(Ty, D.UConstPool64);
332 case ValID::ConstStringVal: // Is it a string const pool reference?
333 cerr << "FIXME: TODO: String constants [sbyte] not implemented yet!\n";
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 (!Ty->isPointerType())
344 ThrowException("Cannot create a a non pointer null!");
345 return ConstantPointerNull::get(cast<PointerType>(Ty));
348 assert(0 && "Unhandled case!");
352 assert(0 && "Unhandled case!");
357 // getVal - This function is identical to getValNonImprovising, except that if a
358 // value is not already defined, it "improvises" by creating a placeholder var
359 // that looks and acts just like the requested variable. When the value is
360 // defined later, all uses of the placeholder variable are replaced with the
363 static Value *getVal(const Type *Ty, const ValID &D) {
364 assert(Ty != Type::TypeTy && "Should use getTypeVal for types!");
366 // See if the value has already been defined...
367 Value *V = getValNonImprovising(Ty, D);
370 // If we reached here, we referenced either a symbol that we don't know about
371 // or an id number that hasn't been read yet. We may be referencing something
372 // forward, so just create an entry to be resolved later and get to it...
375 switch (Ty->getPrimitiveID()) {
376 case Type::LabelTyID: d = new BBPlaceHolder(Ty, D); break;
377 default: d = new ValuePlaceHolder(Ty, D); break;
380 assert(d != 0 && "How did we not make something?");
381 if (inFunctionScope())
382 InsertValue(d, CurMeth.LateResolveValues);
384 InsertValue(d, CurModule.LateResolveValues);
389 //===----------------------------------------------------------------------===//
390 // Code to handle forward references in instructions
391 //===----------------------------------------------------------------------===//
393 // This code handles the late binding needed with statements that reference
394 // values not defined yet... for example, a forward branch, or the PHI node for
397 // This keeps a table (CurMeth.LateResolveValues) of all such forward references
398 // and back patchs after we are done.
401 // ResolveDefinitions - If we could not resolve some defs at parsing
402 // time (forward branches, phi functions for loops, etc...) resolve the
405 static void ResolveDefinitions(vector<ValueList> &LateResolvers,
406 vector<ValueList> *FutureLateResolvers = 0) {
407 // Loop over LateResolveDefs fixing up stuff that couldn't be resolved
408 for (unsigned ty = 0; ty < LateResolvers.size(); ty++) {
409 while (!LateResolvers[ty].empty()) {
410 Value *V = LateResolvers[ty].back();
411 assert(!isa<Type>(V) && "Types should be in LateResolveTypes!");
413 LateResolvers[ty].pop_back();
414 ValID &DID = getValIDFromPlaceHolder(V);
416 Value *TheRealValue = getValNonImprovising(Type::getUniqueIDType(ty),DID);
418 V->replaceAllUsesWith(TheRealValue);
420 } else if (FutureLateResolvers) {
421 // Functions have their unresolved items forwarded to the module late
423 InsertValue(V, *FutureLateResolvers);
426 ThrowException("Reference to an invalid definition: '" +DID.getName()+
427 "' of type '" + V->getType()->getDescription() + "'",
428 getLineNumFromPlaceHolder(V));
430 ThrowException("Reference to an invalid definition: #" +
431 itostr(DID.Num) + " of type '" +
432 V->getType()->getDescription() + "'",
433 getLineNumFromPlaceHolder(V));
438 LateResolvers.clear();
441 // ResolveTypeTo - A brand new type was just declared. This means that (if
442 // name is not null) things referencing Name can be resolved. Otherwise, things
443 // refering to the number can be resolved. Do this now.
445 static void ResolveTypeTo(char *Name, const Type *ToTy) {
446 vector<PATypeHolder<Type> > &Types = inFunctionScope() ?
447 CurMeth.Types : CurModule.Types;
450 if (Name) D = ValID::create(Name);
451 else D = ValID::create((int)Types.size());
453 map<ValID, PATypeHolder<Type> > &LateResolver = inFunctionScope() ?
454 CurMeth.LateResolveTypes : CurModule.LateResolveTypes;
456 map<ValID, PATypeHolder<Type> >::iterator I = LateResolver.find(D);
457 if (I != LateResolver.end()) {
458 cast<DerivedType>(I->second.get())->refineAbstractTypeTo(ToTy);
459 LateResolver.erase(I);
463 // ResolveTypes - At this point, all types should be resolved. Any that aren't
466 static void ResolveTypes(map<ValID, PATypeHolder<Type> > &LateResolveTypes) {
467 if (!LateResolveTypes.empty()) {
468 const ValID &DID = LateResolveTypes.begin()->first;
470 if (DID.Type == ValID::NameVal)
471 ThrowException("Reference to an invalid type: '" +DID.getName() + "'");
473 ThrowException("Reference to an invalid type: #" + itostr(DID.Num));
478 // setValueName - Set the specified value to the name given. The name may be
479 // null potentially, in which case this is a noop. The string passed in is
480 // assumed to be a malloc'd string buffer, and is freed by this function.
482 // This function returns true if the value has already been defined, but is
483 // allowed to be redefined in the specified context. If the name is a new name
484 // for the typeplane, false is returned.
486 static bool setValueName(Value *V, char *NameStr) {
487 if (NameStr == 0) return false;
489 string Name(NameStr); // Copy string
490 free(NameStr); // Free old string
492 if (V->getType() == Type::VoidTy)
493 ThrowException("Can't assign name '" + Name +
494 "' to a null valued instruction!");
496 SymbolTable *ST = inFunctionScope() ?
497 CurMeth.CurrentFunction->getSymbolTableSure() :
498 CurModule.CurrentModule->getSymbolTableSure();
500 Value *Existing = ST->lookup(V->getType(), Name);
501 if (Existing) { // Inserting a name that is already defined???
502 // There is only one case where this is allowed: when we are refining an
503 // opaque type. In this case, Existing will be an opaque type.
504 if (const Type *Ty = dyn_cast<const Type>(Existing)) {
505 if (OpaqueType *OpTy = dyn_cast<OpaqueType>(Ty)) {
506 // We ARE replacing an opaque type!
507 OpTy->refineAbstractTypeTo(cast<Type>(V));
512 // Otherwise, we are a simple redefinition of a value, check to see if it
513 // is defined the same as the old one...
514 if (const Type *Ty = dyn_cast<const Type>(Existing)) {
515 if (Ty == cast<const Type>(V)) return true; // Yes, it's equal.
516 // cerr << "Type: " << Ty->getDescription() << " != "
517 // << cast<const Type>(V)->getDescription() << "!\n";
518 } else if (GlobalVariable *EGV = dyn_cast<GlobalVariable>(Existing)) {
519 // We are allowed to redefine a global variable in two circumstances:
520 // 1. If at least one of the globals is uninitialized or
521 // 2. If both initializers have the same value.
523 // This can only be done if the const'ness of the vars is the same.
525 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(V)) {
526 if (EGV->isConstant() == GV->isConstant() &&
527 (!EGV->hasInitializer() || !GV->hasInitializer() ||
528 EGV->getInitializer() == GV->getInitializer())) {
530 // Make sure the existing global version gets the initializer!
531 if (GV->hasInitializer() && !EGV->hasInitializer())
532 EGV->setInitializer(GV->getInitializer());
534 delete GV; // Destroy the duplicate!
535 return true; // They are equivalent!
539 ThrowException("Redefinition of value named '" + Name + "' in the '" +
540 V->getType()->getDescription() + "' type plane!");
543 V->setName(Name, ST);
548 //===----------------------------------------------------------------------===//
549 // Code for handling upreferences in type names...
552 // TypeContains - Returns true if Ty contains E in it.
554 static bool TypeContains(const Type *Ty, const Type *E) {
555 return find(df_begin(Ty), df_end(Ty), E) != df_end(Ty);
559 static vector<pair<unsigned, OpaqueType *> > UpRefs;
561 static PATypeHolder<Type> HandleUpRefs(const Type *ty) {
562 PATypeHolder<Type> Ty(ty);
563 UR_OUT("Type '" << ty->getDescription() <<
564 "' newly formed. Resolving upreferences.\n" <<
565 UpRefs.size() << " upreferences active!\n");
566 for (unsigned i = 0; i < UpRefs.size(); ) {
567 UR_OUT(" UR#" << i << " - TypeContains(" << Ty->getDescription() << ", "
568 << UpRefs[i].second->getDescription() << ") = "
569 << (TypeContains(Ty, UpRefs[i].second) ? "true" : "false") << endl);
570 if (TypeContains(Ty, UpRefs[i].second)) {
571 unsigned Level = --UpRefs[i].first; // Decrement level of upreference
572 UR_OUT(" Uplevel Ref Level = " << Level << endl);
573 if (Level == 0) { // Upreference should be resolved!
574 UR_OUT(" * Resolving upreference for "
575 << UpRefs[i].second->getDescription() << endl;
576 string OldName = UpRefs[i].second->getDescription());
577 UpRefs[i].second->refineAbstractTypeTo(Ty);
578 UpRefs.erase(UpRefs.begin()+i); // Remove from upreference list...
579 UR_OUT(" * Type '" << OldName << "' refined upreference to: "
580 << (const void*)Ty << ", " << Ty->getDescription() << endl);
585 ++i; // Otherwise, no resolve, move on...
587 // FIXME: TODO: this should return the updated type
591 template <class TypeTy>
592 inline static void TypeDone(PATypeHolder<TypeTy> *Ty) {
594 ThrowException("Invalid upreference in type: " + (*Ty)->getDescription());
597 // newTH - Allocate a new type holder for the specified type
598 template <class TypeTy>
599 inline static PATypeHolder<TypeTy> *newTH(const TypeTy *Ty) {
600 return new PATypeHolder<TypeTy>(Ty);
602 template <class TypeTy>
603 inline static PATypeHolder<TypeTy> *newTH(const PATypeHolder<TypeTy> &TH) {
604 return new PATypeHolder<TypeTy>(TH);
608 //===----------------------------------------------------------------------===//
609 // RunVMAsmParser - Define an interface to this parser
610 //===----------------------------------------------------------------------===//
612 Module *RunVMAsmParser(const string &Filename, FILE *F) {
614 CurFilename = Filename;
615 llvmAsmlineno = 1; // Reset the current line number...
617 CurModule.CurrentModule = new Module(); // Allocate a new module to read
618 yyparse(); // Parse the file.
619 Module *Result = ParserResult;
620 llvmAsmin = stdin; // F is about to go away, don't use it anymore...
630 Function *FunctionVal;
631 std::pair<FunctionArgument*,char*> *MethArgVal;
632 BasicBlock *BasicBlockVal;
633 TerminatorInst *TermInstVal;
634 Instruction *InstVal;
637 const Type *PrimType;
638 PATypeHolder<Type> *TypeVal;
641 std::list<std::pair<FunctionArgument*,char*> > *FunctionArgList;
642 std::vector<Value*> *ValueList;
643 std::list<PATypeHolder<Type> > *TypeList;
644 std::list<std::pair<Value*,
645 BasicBlock*> > *PHIList; // Represent the RHS of PHI node
646 std::list<std::pair<Constant*, BasicBlock*> > *JumpTable;
647 std::vector<Constant*> *ConstVector;
656 char *StrVal; // This memory is strdup'd!
657 ValID ValIDVal; // strdup'd memory maybe!
659 Instruction::UnaryOps UnaryOpVal;
660 Instruction::BinaryOps BinaryOpVal;
661 Instruction::TermOps TermOpVal;
662 Instruction::MemoryOps MemOpVal;
663 Instruction::OtherOps OtherOpVal;
666 %type <ModuleVal> Module FunctionList
667 %type <FunctionVal> Function FunctionProto FunctionHeader BasicBlockList
668 %type <BasicBlockVal> BasicBlock InstructionList
669 %type <TermInstVal> BBTerminatorInst
670 %type <InstVal> Inst InstVal MemoryInst
671 %type <ConstVal> ConstVal
672 %type <ConstVector> ConstVector
673 %type <FunctionArgList> ArgList ArgListH
674 %type <MethArgVal> ArgVal
675 %type <PHIList> PHIList
676 %type <ValueList> ValueRefList ValueRefListE // For call param lists
677 %type <ValueList> IndexList // For GEP derived indices
678 %type <TypeList> TypeListI ArgTypeListI
679 %type <JumpTable> JumpTable
680 %type <BoolVal> GlobalType OptInternal // GLOBAL or CONSTANT? Intern?
682 // ValueRef - Unresolved reference to a definition or BB
683 %type <ValIDVal> ValueRef ConstValueRef SymbolicValueRef
684 %type <ValueVal> ResolvedVal // <type> <valref> pair
685 // Tokens and types for handling constant integer values
687 // ESINT64VAL - A negative number within long long range
688 %token <SInt64Val> ESINT64VAL
690 // EUINT64VAL - A positive number within uns. long long range
691 %token <UInt64Val> EUINT64VAL
692 %type <SInt64Val> EINT64VAL
694 %token <SIntVal> SINTVAL // Signed 32 bit ints...
695 %token <UIntVal> UINTVAL // Unsigned 32 bit ints...
696 %type <SIntVal> INTVAL
697 %token <FPVal> FPVAL // Float or Double constant
700 %type <TypeVal> Types TypesV UpRTypes UpRTypesV
701 %type <PrimType> SIntType UIntType IntType FPType PrimType // Classifications
702 %token <TypeVal> OPAQUE
703 %token <PrimType> VOID BOOL SBYTE UBYTE SHORT USHORT INT UINT LONG ULONG
704 %token <PrimType> FLOAT DOUBLE TYPE LABEL
706 %token <StrVal> VAR_ID LABELSTR STRINGCONSTANT
707 %type <StrVal> OptVAR_ID OptAssign
710 %token IMPLEMENTATION TRUE FALSE BEGINTOK END DECLARE GLOBAL CONSTANT UNINIT
711 %token TO EXCEPT DOTDOTDOT STRING NULL_TOK CONST INTERNAL
713 // Basic Block Terminating Operators
714 %token <TermOpVal> RET BR SWITCH
717 %type <UnaryOpVal> UnaryOps // all the unary operators
718 %token <UnaryOpVal> NOT
721 %type <BinaryOpVal> BinaryOps // all the binary operators
722 %token <BinaryOpVal> ADD SUB MUL DIV REM AND OR XOR
723 %token <BinaryOpVal> SETLE SETGE SETLT SETGT SETEQ SETNE // Binary Comarators
725 // Memory Instructions
726 %token <MemoryOpVal> MALLOC ALLOCA FREE LOAD STORE GETELEMENTPTR
729 %type <OtherOpVal> ShiftOps
730 %token <OtherOpVal> PHI CALL INVOKE CAST SHL SHR
735 // Handle constant integer size restriction and conversion...
740 if ($1 > (uint32_t)INT32_MAX) // Outside of my range!
741 ThrowException("Value too large for type!");
746 EINT64VAL : ESINT64VAL // These have same type and can't cause problems...
747 EINT64VAL : EUINT64VAL {
748 if ($1 > (uint64_t)INT64_MAX) // Outside of my range!
749 ThrowException("Value too large for type!");
753 // Operations that are notably excluded from this list include:
754 // RET, BR, & SWITCH because they end basic blocks and are treated specially.
757 BinaryOps : ADD | SUB | MUL | DIV | REM | AND | OR | XOR
758 BinaryOps : SETLE | SETGE | SETLT | SETGT | SETEQ | SETNE
761 // These are some types that allow classification if we only want a particular
762 // thing... for example, only a signed, unsigned, or integral type.
763 SIntType : LONG | INT | SHORT | SBYTE
764 UIntType : ULONG | UINT | USHORT | UBYTE
765 IntType : SIntType | UIntType
766 FPType : FLOAT | DOUBLE
768 // OptAssign - Value producing statements have an optional assignment component
769 OptAssign : VAR_ID '=' {
776 OptInternal : INTERNAL { $$ = true; } | /*empty*/ { $$ = false; }
778 //===----------------------------------------------------------------------===//
779 // Types includes all predefined types... except void, because it can only be
780 // used in specific contexts (method returning void for example). To have
781 // access to it, a user must explicitly use TypesV.
784 // TypesV includes all of 'Types', but it also includes the void type.
785 TypesV : Types | VOID { $$ = newTH($1); }
786 UpRTypesV : UpRTypes | VOID { $$ = newTH($1); }
793 // Derived types are added later...
795 PrimType : BOOL | SBYTE | UBYTE | SHORT | USHORT | INT | UINT
796 PrimType : LONG | ULONG | FLOAT | DOUBLE | TYPE | LABEL
797 UpRTypes : OPAQUE | PrimType { $$ = newTH($1); }
798 UpRTypes : ValueRef { // Named types are also simple types...
799 $$ = newTH(getTypeVal($1));
802 // Include derived types in the Types production.
804 UpRTypes : '\\' EUINT64VAL { // Type UpReference
805 if ($2 > (uint64_t)INT64_MAX) ThrowException("Value out of range!");
806 OpaqueType *OT = OpaqueType::get(); // Use temporary placeholder
807 UpRefs.push_back(make_pair((unsigned)$2, OT)); // Add to vector...
808 $$ = newTH<Type>(OT);
809 UR_OUT("New Upreference!\n");
811 | UpRTypesV '(' ArgTypeListI ')' { // Function derived type?
812 vector<const Type*> Params;
813 mapto($3->begin(), $3->end(), std::back_inserter(Params),
814 std::mem_fun_ref(&PATypeHandle<Type>::get));
815 bool isVarArg = Params.size() && Params.back() == Type::VoidTy;
816 if (isVarArg) Params.pop_back();
818 $$ = newTH(HandleUpRefs(FunctionType::get(*$1, Params, isVarArg)));
819 delete $3; // Delete the argument list
820 delete $1; // Delete the old type handle
822 | '[' EUINT64VAL 'x' UpRTypes ']' { // Sized array type?
823 $$ = newTH<Type>(HandleUpRefs(ArrayType::get(*$4, (unsigned)$2)));
826 | '{' TypeListI '}' { // Structure type?
827 vector<const Type*> Elements;
828 mapto($2->begin(), $2->end(), std::back_inserter(Elements),
829 std::mem_fun_ref(&PATypeHandle<Type>::get));
831 $$ = newTH<Type>(HandleUpRefs(StructType::get(Elements)));
834 | '{' '}' { // Empty structure type?
835 $$ = newTH<Type>(StructType::get(vector<const Type*>()));
837 | UpRTypes '*' { // Pointer type?
838 $$ = newTH<Type>(HandleUpRefs(PointerType::get(*$1)));
842 // TypeList - Used for struct declarations and as a basis for method type
843 // declaration type lists
845 TypeListI : UpRTypes {
846 $$ = new list<PATypeHolder<Type> >();
847 $$->push_back(*$1); delete $1;
849 | TypeListI ',' UpRTypes {
850 ($$=$1)->push_back(*$3); delete $3;
853 // ArgTypeList - List of types for a method type declaration...
854 ArgTypeListI : TypeListI
855 | TypeListI ',' DOTDOTDOT {
856 ($$=$1)->push_back(Type::VoidTy);
859 ($$ = new list<PATypeHolder<Type> >())->push_back(Type::VoidTy);
862 $$ = new list<PATypeHolder<Type> >();
866 // ConstVal - The various declarations that go into the constant pool. This
867 // includes all forward declarations of types, constants, and functions.
869 ConstVal: Types '[' ConstVector ']' { // Nonempty unsized arr
870 const ArrayType *ATy = dyn_cast<const ArrayType>($1->get());
872 ThrowException("Cannot make array constant with type: '" +
873 (*$1)->getDescription() + "'!");
874 const Type *ETy = ATy->getElementType();
875 int NumElements = ATy->getNumElements();
877 // Verify that we have the correct size...
878 if (NumElements != -1 && NumElements != (int)$3->size())
879 ThrowException("Type mismatch: constant sized array initialized with " +
880 utostr($3->size()) + " arguments, but has size of " +
881 itostr(NumElements) + "!");
883 // Verify all elements are correct type!
884 for (unsigned i = 0; i < $3->size(); i++) {
885 if (ETy != (*$3)[i]->getType())
886 ThrowException("Element #" + utostr(i) + " is not of type '" +
887 ETy->getDescription() +"' as required!\nIt is of type '"+
888 (*$3)[i]->getType()->getDescription() + "'.");
891 $$ = ConstantArray::get(ATy, *$3);
892 delete $1; delete $3;
895 const ArrayType *ATy = dyn_cast<const ArrayType>($1->get());
897 ThrowException("Cannot make array constant with type: '" +
898 (*$1)->getDescription() + "'!");
900 int NumElements = ATy->getNumElements();
901 if (NumElements != -1 && NumElements != 0)
902 ThrowException("Type mismatch: constant sized array initialized with 0"
903 " arguments, but has size of " + itostr(NumElements) +"!");
904 $$ = ConstantArray::get(ATy, vector<Constant*>());
907 | Types 'c' STRINGCONSTANT {
908 const ArrayType *ATy = dyn_cast<const ArrayType>($1->get());
910 ThrowException("Cannot make array constant with type: '" +
911 (*$1)->getDescription() + "'!");
913 int NumElements = ATy->getNumElements();
914 const Type *ETy = ATy->getElementType();
915 char *EndStr = UnEscapeLexed($3, true);
916 if (NumElements != -1 && NumElements != (EndStr-$3))
917 ThrowException("Can't build string constant of size " +
918 itostr((int)(EndStr-$3)) +
919 " when array has size " + itostr(NumElements) + "!");
920 vector<Constant*> Vals;
921 if (ETy == Type::SByteTy) {
922 for (char *C = $3; C != EndStr; ++C)
923 Vals.push_back(ConstantSInt::get(ETy, *C));
924 } else if (ETy == Type::UByteTy) {
925 for (char *C = $3; C != EndStr; ++C)
926 Vals.push_back(ConstantUInt::get(ETy, *C));
929 ThrowException("Cannot build string arrays of non byte sized elements!");
932 $$ = ConstantArray::get(ATy, Vals);
935 | Types '{' ConstVector '}' {
936 const StructType *STy = dyn_cast<const StructType>($1->get());
938 ThrowException("Cannot make struct constant with type: '" +
939 (*$1)->getDescription() + "'!");
940 // FIXME: TODO: Check to see that the constants are compatible with the type
942 $$ = ConstantStruct::get(STy, *$3);
943 delete $1; delete $3;
946 const PointerType *PTy = dyn_cast<const PointerType>($1->get());
948 ThrowException("Cannot make null pointer constant with type: '" +
949 (*$1)->getDescription() + "'!");
951 $$ = ConstantPointerNull::get(PTy);
954 | Types SymbolicValueRef {
955 const PointerType *Ty = dyn_cast<const PointerType>($1->get());
957 ThrowException("Global const reference must be a pointer type!");
959 Value *V = getValNonImprovising(Ty, $2);
961 // If this is an initializer for a constant pointer, which is referencing a
962 // (currently) undefined variable, create a stub now that shall be replaced
963 // in the future with the right type of variable.
966 assert(isa<PointerType>(Ty) && "Globals may only be used as pointers!");
967 const PointerType *PT = cast<PointerType>(Ty);
969 // First check to see if the forward references value is already created!
970 PerModuleInfo::GlobalRefsType::iterator I =
971 CurModule.GlobalRefs.find(make_pair(PT, $2));
973 if (I != CurModule.GlobalRefs.end()) {
974 V = I->second; // Placeholder already exists, use it...
976 // TODO: Include line number info by creating a subclass of
977 // TODO: GlobalVariable here that includes the said information!
979 // Create a placeholder for the global variable reference...
980 GlobalVariable *GV = new GlobalVariable(PT->getElementType(),
982 // Keep track of the fact that we have a forward ref to recycle it
983 CurModule.GlobalRefs.insert(make_pair(make_pair(PT, $2), GV));
985 // Must temporarily push this value into the module table...
986 CurModule.CurrentModule->getGlobalList().push_back(GV);
991 GlobalValue *GV = cast<GlobalValue>(V);
992 $$ = ConstantPointerRef::get(GV);
993 delete $1; // Free the type handle
997 ConstVal : SIntType EINT64VAL { // integral constants
998 if (!ConstantSInt::isValueValidForType($1, $2))
999 ThrowException("Constant value doesn't fit in type!");
1000 $$ = ConstantSInt::get($1, $2);
1002 | UIntType EUINT64VAL { // integral constants
1003 if (!ConstantUInt::isValueValidForType($1, $2))
1004 ThrowException("Constant value doesn't fit in type!");
1005 $$ = ConstantUInt::get($1, $2);
1007 | BOOL TRUE { // Boolean constants
1008 $$ = ConstantBool::True;
1010 | BOOL FALSE { // Boolean constants
1011 $$ = ConstantBool::False;
1013 | FPType FPVAL { // Float & Double constants
1014 $$ = ConstantFP::get($1, $2);
1017 // ConstVector - A list of comma seperated constants.
1018 ConstVector : ConstVector ',' ConstVal {
1019 ($$ = $1)->push_back($3);
1022 $$ = new vector<Constant*>();
1027 // GlobalType - Match either GLOBAL or CONSTANT for global declarations...
1028 GlobalType : GLOBAL { $$ = false; } | CONSTANT { $$ = true; }
1031 // ConstPool - Constants with optional names assigned to them.
1032 ConstPool : ConstPool OptAssign CONST ConstVal {
1033 if (setValueName($4, $2)) { assert(0 && "No redefinitions allowed!"); }
1036 | ConstPool OptAssign TYPE TypesV { // Types can be defined in the const pool
1037 // Eagerly resolve types. This is not an optimization, this is a
1038 // requirement that is due to the fact that we could have this:
1040 // %list = type { %list * }
1041 // %list = type { %list * } ; repeated type decl
1043 // If types are not resolved eagerly, then the two types will not be
1044 // determined to be the same type!
1046 ResolveTypeTo($2, $4->get());
1048 // TODO: FIXME when Type are not const
1049 if (!setValueName(const_cast<Type*>($4->get()), $2)) {
1050 // If this is not a redefinition of a type...
1052 InsertType($4->get(),
1053 inFunctionScope() ? CurMeth.Types : CurModule.Types);
1059 | ConstPool FunctionProto { // Function prototypes can be in const pool
1061 | ConstPool OptAssign OptInternal GlobalType ConstVal {
1062 const Type *Ty = $5->getType();
1063 // Global declarations appear in Constant Pool
1064 Constant *Initializer = $5;
1065 if (Initializer == 0)
1066 ThrowException("Global value initializer is not a constant!");
1068 GlobalVariable *GV = new GlobalVariable(Ty, $4, $3, Initializer);
1069 if (!setValueName(GV, $2)) { // If not redefining...
1070 CurModule.CurrentModule->getGlobalList().push_back(GV);
1071 int Slot = InsertValue(GV, CurModule.Values);
1074 CurModule.DeclareNewGlobalValue(GV, ValID::create(Slot));
1076 CurModule.DeclareNewGlobalValue(GV, ValID::create(
1077 (char*)GV->getName().c_str()));
1081 | ConstPool OptAssign OptInternal UNINIT GlobalType Types {
1082 const Type *Ty = *$6;
1083 // Global declarations appear in Constant Pool
1084 GlobalVariable *GV = new GlobalVariable(Ty, $5, $3);
1085 if (!setValueName(GV, $2)) { // If not redefining...
1086 CurModule.CurrentModule->getGlobalList().push_back(GV);
1087 int Slot = InsertValue(GV, CurModule.Values);
1090 CurModule.DeclareNewGlobalValue(GV, ValID::create(Slot));
1092 assert(GV->hasName() && "Not named and not numbered!?");
1093 CurModule.DeclareNewGlobalValue(GV, ValID::create(
1094 (char*)GV->getName().c_str()));
1098 | /* empty: end of list */ {
1102 //===----------------------------------------------------------------------===//
1103 // Rules to match Modules
1104 //===----------------------------------------------------------------------===//
1106 // Module rule: Capture the result of parsing the whole file into a result
1109 Module : FunctionList {
1110 $$ = ParserResult = $1;
1111 CurModule.ModuleDone();
1114 // FunctionList - A list of methods, preceeded by a constant pool.
1116 FunctionList : FunctionList Function {
1118 assert($2->getParent() == 0 && "Function already in module!");
1119 $1->getFunctionList().push_back($2);
1120 CurMeth.FunctionDone();
1122 | FunctionList FunctionProto {
1125 | ConstPool IMPLEMENTATION {
1126 $$ = CurModule.CurrentModule;
1127 // Resolve circular types before we parse the body of the module
1128 ResolveTypes(CurModule.LateResolveTypes);
1132 //===----------------------------------------------------------------------===//
1133 // Rules to match Function Headers
1134 //===----------------------------------------------------------------------===//
1136 OptVAR_ID : VAR_ID | /*empty*/ { $$ = 0; }
1138 ArgVal : Types OptVAR_ID {
1139 $$ = new pair<FunctionArgument*,char*>(new FunctionArgument(*$1), $2);
1140 delete $1; // Delete the type handle..
1143 ArgListH : ArgVal ',' ArgListH {
1145 $3->push_front(*$1);
1149 $$ = new list<pair<FunctionArgument*,char*> >();
1150 $$->push_front(*$1);
1154 $$ = new list<pair<FunctionArgument*, char*> >();
1155 $$->push_front(pair<FunctionArgument*,char*>(
1156 new FunctionArgument(Type::VoidTy), 0));
1159 ArgList : ArgListH {
1166 FunctionHeaderH : OptInternal TypesV STRINGCONSTANT '(' ArgList ')' {
1168 string FunctionName($3);
1170 vector<const Type*> ParamTypeList;
1172 for (list<pair<FunctionArgument*,char*> >::iterator I = $5->begin();
1173 I != $5->end(); ++I)
1174 ParamTypeList.push_back(I->first->getType());
1176 bool isVarArg = ParamTypeList.size() && ParamTypeList.back() == Type::VoidTy;
1177 if (isVarArg) ParamTypeList.pop_back();
1179 const FunctionType *MT = FunctionType::get(*$2, ParamTypeList, isVarArg);
1180 const PointerType *PMT = PointerType::get(MT);
1184 if (SymbolTable *ST = CurModule.CurrentModule->getSymbolTable()) {
1185 // Is the function already in symtab?
1186 if (Value *V = ST->lookup(PMT, FunctionName)) {
1187 M = cast<Function>(V);
1189 // Yes it is. If this is the case, either we need to be a forward decl,
1190 // or it needs to be.
1191 if (!CurMeth.isDeclare && !M->isExternal())
1192 ThrowException("Redefinition of method '" + FunctionName + "'!");
1194 // If we found a preexisting method prototype, remove it from the module,
1195 // so that we don't get spurious conflicts with global & local variables.
1197 CurModule.CurrentModule->getFunctionList().remove(M);
1201 if (M == 0) { // Not already defined?
1202 M = new Function(MT, $1, FunctionName);
1203 InsertValue(M, CurModule.Values);
1204 CurModule.DeclareNewGlobalValue(M, ValID::create($3));
1206 free($3); // Free strdup'd memory!
1208 CurMeth.FunctionStart(M);
1210 // Add all of the arguments we parsed to the method...
1211 if ($5 && !CurMeth.isDeclare) { // Is null if empty...
1212 Function::ArgumentListType &ArgList = M->getArgumentList();
1214 for (list<pair<FunctionArgument*, char*> >::iterator I = $5->begin();
1215 I != $5->end(); ++I) {
1216 if (setValueName(I->first, I->second)) { // Insert into symtab...
1217 assert(0 && "No arg redef allowed!");
1220 InsertValue(I->first);
1221 ArgList.push_back(I->first);
1223 delete $5; // We're now done with the argument list
1225 // If we are a declaration, we should free the memory for the argument list!
1226 for (list<pair<FunctionArgument*, char*> >::iterator I = $5->begin();
1227 I != $5->end(); ++I)
1228 if (I->second) free(I->second); // Free the memory for the name...
1229 delete $5; // Free the memory for the list itself
1233 FunctionHeader : FunctionHeaderH ConstPool BEGINTOK {
1234 $$ = CurMeth.CurrentFunction;
1236 // Resolve circular types before we parse the body of the method.
1237 ResolveTypes(CurMeth.LateResolveTypes);
1240 Function : BasicBlockList END {
1244 FunctionProto : DECLARE { CurMeth.isDeclare = true; } FunctionHeaderH {
1245 $$ = CurMeth.CurrentFunction;
1246 assert($$->getParent() == 0 && "Function already in module!");
1247 CurModule.CurrentModule->getFunctionList().push_back($$);
1248 CurMeth.FunctionDone();
1251 //===----------------------------------------------------------------------===//
1252 // Rules to match Basic Blocks
1253 //===----------------------------------------------------------------------===//
1255 ConstValueRef : ESINT64VAL { // A reference to a direct constant
1256 $$ = ValID::create($1);
1259 $$ = ValID::create($1);
1261 | FPVAL { // Perhaps it's an FP constant?
1262 $$ = ValID::create($1);
1265 $$ = ValID::create((int64_t)1);
1268 $$ = ValID::create((int64_t)0);
1271 $$ = ValID::createNull();
1275 | STRINGCONSTANT { // Quoted strings work too... especially for methods
1276 $$ = ValID::create_conststr($1);
1280 // SymbolicValueRef - Reference to one of two ways of symbolically refering to
1283 SymbolicValueRef : INTVAL { // Is it an integer reference...?
1284 $$ = ValID::create($1);
1286 | VAR_ID { // Is it a named reference...?
1287 $$ = ValID::create($1);
1290 // ValueRef - A reference to a definition... either constant or symbolic
1291 ValueRef : SymbolicValueRef | ConstValueRef
1294 // ResolvedVal - a <type> <value> pair. This is used only in cases where the
1295 // type immediately preceeds the value reference, and allows complex constant
1296 // pool references (for things like: 'ret [2 x int] [ int 12, int 42]')
1297 ResolvedVal : Types ValueRef {
1298 $$ = getVal(*$1, $2); delete $1;
1302 BasicBlockList : BasicBlockList BasicBlock {
1303 ($$ = $1)->getBasicBlocks().push_back($2);
1305 | FunctionHeader BasicBlock { // Do not allow methods with 0 basic blocks
1306 ($$ = $1)->getBasicBlocks().push_back($2);
1310 // Basic blocks are terminated by branching instructions:
1311 // br, br/cc, switch, ret
1313 BasicBlock : InstructionList OptAssign BBTerminatorInst {
1314 if (setValueName($3, $2)) { assert(0 && "No redefn allowed!"); }
1317 $1->getInstList().push_back($3);
1321 | LABELSTR InstructionList OptAssign BBTerminatorInst {
1322 if (setValueName($4, $3)) { assert(0 && "No redefn allowed!"); }
1325 $2->getInstList().push_back($4);
1326 if (setValueName($2, $1)) { assert(0 && "No label redef allowed!"); }
1332 InstructionList : InstructionList Inst {
1333 $1->getInstList().push_back($2);
1337 $$ = new BasicBlock();
1340 BBTerminatorInst : RET ResolvedVal { // Return with a result...
1341 $$ = new ReturnInst($2);
1343 | RET VOID { // Return with no result...
1344 $$ = new ReturnInst();
1346 | BR LABEL ValueRef { // Unconditional Branch...
1347 $$ = new BranchInst(cast<BasicBlock>(getVal(Type::LabelTy, $3)));
1348 } // Conditional Branch...
1349 | BR BOOL ValueRef ',' LABEL ValueRef ',' LABEL ValueRef {
1350 $$ = new BranchInst(cast<BasicBlock>(getVal(Type::LabelTy, $6)),
1351 cast<BasicBlock>(getVal(Type::LabelTy, $9)),
1352 getVal(Type::BoolTy, $3));
1354 | SWITCH IntType ValueRef ',' LABEL ValueRef '[' JumpTable ']' {
1355 SwitchInst *S = new SwitchInst(getVal($2, $3),
1356 cast<BasicBlock>(getVal(Type::LabelTy, $6)));
1359 list<pair<Constant*, BasicBlock*> >::iterator I = $8->begin(),
1361 for (; I != end; ++I)
1362 S->dest_push_back(I->first, I->second);
1364 | INVOKE TypesV ValueRef '(' ValueRefListE ')' TO ResolvedVal
1365 EXCEPT ResolvedVal {
1366 const PointerType *PMTy;
1367 const FunctionType *Ty;
1369 if (!(PMTy = dyn_cast<PointerType>($2->get())) ||
1370 !(Ty = dyn_cast<FunctionType>(PMTy->getElementType()))) {
1371 // Pull out the types of all of the arguments...
1372 vector<const Type*> ParamTypes;
1374 for (vector<Value*>::iterator I = $5->begin(), E = $5->end(); I!=E; ++I)
1375 ParamTypes.push_back((*I)->getType());
1378 bool isVarArg = ParamTypes.size() && ParamTypes.back() == Type::VoidTy;
1379 if (isVarArg) ParamTypes.pop_back();
1381 Ty = FunctionType::get($2->get(), ParamTypes, isVarArg);
1382 PMTy = PointerType::get(Ty);
1386 Value *V = getVal(PMTy, $3); // Get the method we're calling...
1388 BasicBlock *Normal = dyn_cast<BasicBlock>($8);
1389 BasicBlock *Except = dyn_cast<BasicBlock>($10);
1391 if (Normal == 0 || Except == 0)
1392 ThrowException("Invoke instruction without label destinations!");
1394 // Create the call node...
1395 if (!$5) { // Has no arguments?
1396 $$ = new InvokeInst(V, Normal, Except, vector<Value*>());
1397 } else { // Has arguments?
1398 // Loop through FunctionType's arguments and ensure they are specified
1401 FunctionType::ParamTypes::const_iterator I = Ty->getParamTypes().begin();
1402 FunctionType::ParamTypes::const_iterator E = Ty->getParamTypes().end();
1403 vector<Value*>::iterator ArgI = $5->begin(), ArgE = $5->end();
1405 for (; ArgI != ArgE && I != E; ++ArgI, ++I)
1406 if ((*ArgI)->getType() != *I)
1407 ThrowException("Parameter " +(*ArgI)->getName()+ " is not of type '" +
1408 (*I)->getDescription() + "'!");
1410 if (I != E || (ArgI != ArgE && !Ty->isVarArg()))
1411 ThrowException("Invalid number of parameters detected!");
1413 $$ = new InvokeInst(V, Normal, Except, *$5);
1420 JumpTable : JumpTable IntType ConstValueRef ',' LABEL ValueRef {
1422 Constant *V = cast<Constant>(getValNonImprovising($2, $3));
1424 ThrowException("May only switch on a constant pool value!");
1426 $$->push_back(make_pair(V, cast<BasicBlock>(getVal($5, $6))));
1428 | IntType ConstValueRef ',' LABEL ValueRef {
1429 $$ = new list<pair<Constant*, BasicBlock*> >();
1430 Constant *V = cast<Constant>(getValNonImprovising($1, $2));
1433 ThrowException("May only switch on a constant pool value!");
1435 $$->push_back(make_pair(V, cast<BasicBlock>(getVal($4, $5))));
1438 Inst : OptAssign InstVal {
1439 // Is this definition named?? if so, assign the name...
1440 if (setValueName($2, $1)) { assert(0 && "No redefin allowed!"); }
1445 PHIList : Types '[' ValueRef ',' ValueRef ']' { // Used for PHI nodes
1446 $$ = new list<pair<Value*, BasicBlock*> >();
1447 $$->push_back(make_pair(getVal(*$1, $3),
1448 cast<BasicBlock>(getVal(Type::LabelTy, $5))));
1451 | PHIList ',' '[' ValueRef ',' ValueRef ']' {
1453 $1->push_back(make_pair(getVal($1->front().first->getType(), $4),
1454 cast<BasicBlock>(getVal(Type::LabelTy, $6))));
1458 ValueRefList : ResolvedVal { // Used for call statements, and memory insts...
1459 $$ = new vector<Value*>();
1462 | ValueRefList ',' ResolvedVal {
1467 // ValueRefListE - Just like ValueRefList, except that it may also be empty!
1468 ValueRefListE : ValueRefList | /*empty*/ { $$ = 0; }
1470 InstVal : BinaryOps Types ValueRef ',' ValueRef {
1471 $$ = BinaryOperator::create($1, getVal(*$2, $3), getVal(*$2, $5));
1473 ThrowException("binary operator returned null!");
1476 | UnaryOps ResolvedVal {
1477 $$ = UnaryOperator::create($1, $2);
1479 ThrowException("unary operator returned null!");
1481 | ShiftOps ResolvedVal ',' ResolvedVal {
1482 if ($4->getType() != Type::UByteTy)
1483 ThrowException("Shift amount must be ubyte!");
1484 $$ = new ShiftInst($1, $2, $4);
1486 | CAST ResolvedVal TO Types {
1487 $$ = new CastInst($2, *$4);
1491 const Type *Ty = $2->front().first->getType();
1492 $$ = new PHINode(Ty);
1493 while ($2->begin() != $2->end()) {
1494 if ($2->front().first->getType() != Ty)
1495 ThrowException("All elements of a PHI node must be of the same type!");
1496 cast<PHINode>($$)->addIncoming($2->front().first, $2->front().second);
1499 delete $2; // Free the list...
1501 | CALL TypesV ValueRef '(' ValueRefListE ')' {
1502 const PointerType *PMTy;
1503 const FunctionType *Ty;
1505 if (!(PMTy = dyn_cast<PointerType>($2->get())) ||
1506 !(Ty = dyn_cast<FunctionType>(PMTy->getElementType()))) {
1507 // Pull out the types of all of the arguments...
1508 vector<const Type*> ParamTypes;
1510 for (vector<Value*>::iterator I = $5->begin(), E = $5->end(); I!=E; ++I)
1511 ParamTypes.push_back((*I)->getType());
1514 bool isVarArg = ParamTypes.size() && ParamTypes.back() == Type::VoidTy;
1515 if (isVarArg) ParamTypes.pop_back();
1517 Ty = FunctionType::get($2->get(), ParamTypes, isVarArg);
1518 PMTy = PointerType::get(Ty);
1522 Value *V = getVal(PMTy, $3); // Get the method we're calling...
1524 // Create the call node...
1525 if (!$5) { // Has no arguments?
1526 $$ = new CallInst(V, vector<Value*>());
1527 } else { // Has arguments?
1528 // Loop through FunctionType's arguments and ensure they are specified
1531 FunctionType::ParamTypes::const_iterator I = Ty->getParamTypes().begin();
1532 FunctionType::ParamTypes::const_iterator E = Ty->getParamTypes().end();
1533 vector<Value*>::iterator ArgI = $5->begin(), ArgE = $5->end();
1535 for (; ArgI != ArgE && I != E; ++ArgI, ++I)
1536 if ((*ArgI)->getType() != *I)
1537 ThrowException("Parameter " +(*ArgI)->getName()+ " is not of type '" +
1538 (*I)->getDescription() + "'!");
1540 if (I != E || (ArgI != ArgE && !Ty->isVarArg()))
1541 ThrowException("Invalid number of parameters detected!");
1543 $$ = new CallInst(V, *$5);
1552 // IndexList - List of indices for GEP based instructions...
1553 IndexList : ',' ValueRefList {
1556 $$ = new vector<Value*>();
1559 MemoryInst : MALLOC Types {
1560 $$ = new MallocInst(PointerType::get(*$2));
1563 | MALLOC Types ',' UINT ValueRef {
1564 const Type *Ty = PointerType::get(*$2);
1565 $$ = new MallocInst(Ty, getVal($4, $5));
1569 $$ = new AllocaInst(PointerType::get(*$2));
1572 | ALLOCA Types ',' UINT ValueRef {
1573 const Type *Ty = PointerType::get(*$2);
1574 Value *ArrSize = getVal($4, $5);
1575 $$ = new AllocaInst(Ty, ArrSize);
1578 | FREE ResolvedVal {
1579 if (!$2->getType()->isPointerType())
1580 ThrowException("Trying to free nonpointer type " +
1581 $2->getType()->getDescription() + "!");
1582 $$ = new FreeInst($2);
1585 | LOAD Types ValueRef IndexList {
1586 if (!(*$2)->isPointerType())
1587 ThrowException("Can't load from nonpointer type: " +
1588 (*$2)->getDescription());
1589 if (LoadInst::getIndexedType(*$2, *$4) == 0)
1590 ThrowException("Invalid indices for load instruction!");
1592 $$ = new LoadInst(getVal(*$2, $3), *$4);
1593 delete $4; // Free the vector...
1596 | STORE ResolvedVal ',' Types ValueRef IndexList {
1597 if (!(*$4)->isPointerType())
1598 ThrowException("Can't store to a nonpointer type: " +
1599 (*$4)->getDescription());
1600 const Type *ElTy = StoreInst::getIndexedType(*$4, *$6);
1602 ThrowException("Can't store into that field list!");
1603 if (ElTy != $2->getType())
1604 ThrowException("Can't store '" + $2->getType()->getDescription() +
1605 "' into space of type '" + ElTy->getDescription() + "'!");
1606 $$ = new StoreInst($2, getVal(*$4, $5), *$6);
1607 delete $4; delete $6;
1609 | GETELEMENTPTR Types ValueRef IndexList {
1610 if (!(*$2)->isPointerType())
1611 ThrowException("getelementptr insn requires pointer operand!");
1612 if (!GetElementPtrInst::getIndexedType(*$2, *$4, true))
1613 ThrowException("Can't get element ptr '" + (*$2)->getDescription()+ "'!");
1614 $$ = new GetElementPtrInst(getVal(*$2, $3), *$4);
1615 delete $2; delete $4;
1619 int yyerror(const char *ErrorMsg) {
1620 ThrowException(string("Parse error: ") + ErrorMsg);