1 //===-- llvmAsmParser.y - Parser for llvm assembly files --------*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by the LLVM research group and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements the bison parser for LLVM assembly languages files.
12 //===----------------------------------------------------------------------===//
15 #include "ParserInternals.h"
16 #include "llvm/CallingConv.h"
17 #include "llvm/InlineAsm.h"
18 #include "llvm/Instructions.h"
19 #include "llvm/Module.h"
20 #include "llvm/ValueSymbolTable.h"
21 #include "llvm/AutoUpgrade.h"
22 #include "llvm/Support/GetElementPtrTypeIterator.h"
23 #include "llvm/Support/CommandLine.h"
24 #include "llvm/ADT/SmallVector.h"
25 #include "llvm/ADT/STLExtras.h"
26 #include "llvm/Support/MathExtras.h"
27 #include "llvm/Support/Streams.h"
36 // The following is a gross hack. In order to rid the libAsmParser library of
37 // exceptions, we have to have a way of getting the yyparse function to go into
38 // an error situation. So, whenever we want an error to occur, the GenerateError
39 // function (see bottom of file) sets TriggerError. Then, at the end of each
40 // production in the grammer we use CHECK_FOR_ERROR which will invoke YYERROR
41 // (a goto) to put YACC in error state. Furthermore, several calls to
42 // GenerateError are made from inside productions and they must simulate the
43 // previous exception behavior by exiting the production immediately. We have
44 // replaced these with the GEN_ERROR macro which calls GeneratError and then
45 // immediately invokes YYERROR. This would be so much cleaner if it was a
46 // recursive descent parser.
47 static bool TriggerError = false;
48 #define CHECK_FOR_ERROR { if (TriggerError) { TriggerError = false; YYABORT; } }
49 #define GEN_ERROR(msg) { GenerateError(msg); YYERROR; }
51 int yyerror(const char *ErrorMsg); // Forward declarations to prevent "implicit
52 int yylex(); // declaration" of xxx warnings.
56 std::string CurFilename;
59 Debug("debug-yacc", cl::desc("Print yacc debug state changes"),
60 cl::Hidden, cl::init(false));
65 static Module *ParserResult;
67 // DEBUG_UPREFS - Define this symbol if you want to enable debugging output
68 // relating to upreferences in the input stream.
70 //#define DEBUG_UPREFS 1
72 #define UR_OUT(X) cerr << X
77 #define YYERROR_VERBOSE 1
79 static GlobalVariable *CurGV;
82 // This contains info used when building the body of a function. It is
83 // destroyed when the function is completed.
85 typedef std::vector<Value *> ValueList; // Numbered defs
88 ResolveDefinitions(ValueList &LateResolvers, ValueList *FutureLateResolvers=0);
90 static struct PerModuleInfo {
91 Module *CurrentModule;
92 ValueList Values; // Module level numbered definitions
93 ValueList LateResolveValues;
94 std::vector<PATypeHolder> Types;
95 std::map<ValID, PATypeHolder> LateResolveTypes;
97 /// PlaceHolderInfo - When temporary placeholder objects are created, remember
98 /// how they were referenced and on which line of the input they came from so
99 /// that we can resolve them later and print error messages as appropriate.
100 std::map<Value*, std::pair<ValID, int> > PlaceHolderInfo;
102 // GlobalRefs - This maintains a mapping between <Type, ValID>'s and forward
103 // references to global values. Global values may be referenced before they
104 // are defined, and if so, the temporary object that they represent is held
105 // here. This is used for forward references of GlobalValues.
107 typedef std::map<std::pair<const PointerType *,
108 ValID>, GlobalValue*> GlobalRefsType;
109 GlobalRefsType GlobalRefs;
112 // If we could not resolve some functions at function compilation time
113 // (calls to functions before they are defined), resolve them now... Types
114 // are resolved when the constant pool has been completely parsed.
116 ResolveDefinitions(LateResolveValues);
120 // Check to make sure that all global value forward references have been
123 if (!GlobalRefs.empty()) {
124 std::string UndefinedReferences = "Unresolved global references exist:\n";
126 for (GlobalRefsType::iterator I = GlobalRefs.begin(), E =GlobalRefs.end();
128 UndefinedReferences += " " + I->first.first->getDescription() + " " +
129 I->first.second.getName() + "\n";
131 GenerateError(UndefinedReferences);
135 // Look for intrinsic functions and CallInst that need to be upgraded
136 for (Module::iterator FI = CurrentModule->begin(),
137 FE = CurrentModule->end(); FI != FE; )
138 UpgradeCallsToIntrinsic(FI++); // must be post-increment, as we remove
140 Values.clear(); // Clear out function local definitions
145 // GetForwardRefForGlobal - Check to see if there is a forward reference
146 // for this global. If so, remove it from the GlobalRefs map and return it.
147 // If not, just return null.
148 GlobalValue *GetForwardRefForGlobal(const PointerType *PTy, ValID ID) {
149 // Check to see if there is a forward reference to this global variable...
150 // if there is, eliminate it and patch the reference to use the new def'n.
151 GlobalRefsType::iterator I = GlobalRefs.find(std::make_pair(PTy, ID));
152 GlobalValue *Ret = 0;
153 if (I != GlobalRefs.end()) {
160 bool TypeIsUnresolved(PATypeHolder* PATy) {
161 // If it isn't abstract, its resolved
162 const Type* Ty = PATy->get();
163 if (!Ty->isAbstract())
165 // Traverse the type looking for abstract types. If it isn't abstract then
166 // we don't need to traverse that leg of the type.
167 std::vector<const Type*> WorkList, SeenList;
168 WorkList.push_back(Ty);
169 while (!WorkList.empty()) {
170 const Type* Ty = WorkList.back();
171 SeenList.push_back(Ty);
173 if (const OpaqueType* OpTy = dyn_cast<OpaqueType>(Ty)) {
174 // Check to see if this is an unresolved type
175 std::map<ValID, PATypeHolder>::iterator I = LateResolveTypes.begin();
176 std::map<ValID, PATypeHolder>::iterator E = LateResolveTypes.end();
177 for ( ; I != E; ++I) {
178 if (I->second.get() == OpTy)
181 } else if (const SequentialType* SeqTy = dyn_cast<SequentialType>(Ty)) {
182 const Type* TheTy = SeqTy->getElementType();
183 if (TheTy->isAbstract() && TheTy != Ty) {
184 std::vector<const Type*>::iterator I = SeenList.begin(),
190 WorkList.push_back(TheTy);
192 } else if (const StructType* StrTy = dyn_cast<StructType>(Ty)) {
193 for (unsigned i = 0; i < StrTy->getNumElements(); ++i) {
194 const Type* TheTy = StrTy->getElementType(i);
195 if (TheTy->isAbstract() && TheTy != Ty) {
196 std::vector<const Type*>::iterator I = SeenList.begin(),
202 WorkList.push_back(TheTy);
211 static struct PerFunctionInfo {
212 Function *CurrentFunction; // Pointer to current function being created
214 ValueList Values; // Keep track of #'d definitions
216 ValueList LateResolveValues;
217 bool isDeclare; // Is this function a forward declararation?
218 GlobalValue::LinkageTypes Linkage; // Linkage for forward declaration.
219 GlobalValue::VisibilityTypes Visibility;
221 /// BBForwardRefs - When we see forward references to basic blocks, keep
222 /// track of them here.
223 std::map<ValID, BasicBlock*> BBForwardRefs;
225 inline PerFunctionInfo() {
228 Linkage = GlobalValue::ExternalLinkage;
229 Visibility = GlobalValue::DefaultVisibility;
232 inline void FunctionStart(Function *M) {
237 void FunctionDone() {
238 // Any forward referenced blocks left?
239 if (!BBForwardRefs.empty()) {
240 GenerateError("Undefined reference to label " +
241 BBForwardRefs.begin()->second->getName());
245 // Resolve all forward references now.
246 ResolveDefinitions(LateResolveValues, &CurModule.LateResolveValues);
248 Values.clear(); // Clear out function local definitions
249 BBForwardRefs.clear();
252 Linkage = GlobalValue::ExternalLinkage;
253 Visibility = GlobalValue::DefaultVisibility;
255 } CurFun; // Info for the current function...
257 static bool inFunctionScope() { return CurFun.CurrentFunction != 0; }
260 //===----------------------------------------------------------------------===//
261 // Code to handle definitions of all the types
262 //===----------------------------------------------------------------------===//
264 static void InsertValue(Value *V, ValueList &ValueTab = CurFun.Values) {
265 // Things that have names or are void typed don't get slot numbers
266 if (V->hasName() || (V->getType() == Type::VoidTy))
269 // In the case of function values, we have to allow for the forward reference
270 // of basic blocks, which are included in the numbering. Consequently, we keep
271 // track of the next insertion location with NextValNum. When a BB gets
272 // inserted, it could change the size of the CurFun.Values vector.
273 if (&ValueTab == &CurFun.Values) {
274 if (ValueTab.size() <= CurFun.NextValNum)
275 ValueTab.resize(CurFun.NextValNum+1);
276 ValueTab[CurFun.NextValNum++] = V;
279 // For all other lists, its okay to just tack it on the back of the vector.
280 ValueTab.push_back(V);
283 static const Type *getTypeVal(const ValID &D, bool DoNotImprovise = false) {
285 case ValID::LocalID: // Is it a numbered definition?
286 // Module constants occupy the lowest numbered slots...
287 if (D.Num < CurModule.Types.size())
288 return CurModule.Types[D.Num];
290 case ValID::LocalName: // Is it a named definition?
291 if (const Type *N = CurModule.CurrentModule->getTypeByName(D.getName())) {
292 D.destroy(); // Free old strdup'd memory...
297 GenerateError("Internal parser error: Invalid symbol type reference");
301 // If we reached here, we referenced either a symbol that we don't know about
302 // or an id number that hasn't been read yet. We may be referencing something
303 // forward, so just create an entry to be resolved later and get to it...
305 if (DoNotImprovise) return 0; // Do we just want a null to be returned?
308 if (inFunctionScope()) {
309 if (D.Type == ValID::LocalName) {
310 GenerateError("Reference to an undefined type: '" + D.getName() + "'");
313 GenerateError("Reference to an undefined type: #" + utostr(D.Num));
318 std::map<ValID, PATypeHolder>::iterator I =CurModule.LateResolveTypes.find(D);
319 if (I != CurModule.LateResolveTypes.end())
322 Type *Typ = OpaqueType::get();
323 CurModule.LateResolveTypes.insert(std::make_pair(D, Typ));
327 // getExistingVal - Look up the value specified by the provided type and
328 // the provided ValID. If the value exists and has already been defined, return
329 // it. Otherwise return null.
331 static Value *getExistingVal(const Type *Ty, const ValID &D) {
332 if (isa<FunctionType>(Ty)) {
333 GenerateError("Functions are not values and "
334 "must be referenced as pointers");
339 case ValID::LocalID: { // Is it a numbered definition?
340 // Check that the number is within bounds.
341 if (D.Num >= CurFun.Values.size())
343 Value *Result = CurFun.Values[D.Num];
344 if (Ty != Result->getType()) {
345 GenerateError("Numbered value (%" + utostr(D.Num) + ") of type '" +
346 Result->getType()->getDescription() + "' does not match "
347 "expected type, '" + Ty->getDescription() + "'");
352 case ValID::GlobalID: { // Is it a numbered definition?
353 if (D.Num >= CurModule.Values.size())
355 Value *Result = CurModule.Values[D.Num];
356 if (Ty != Result->getType()) {
357 GenerateError("Numbered value (@" + utostr(D.Num) + ") of type '" +
358 Result->getType()->getDescription() + "' does not match "
359 "expected type, '" + Ty->getDescription() + "'");
365 case ValID::LocalName: { // Is it a named definition?
366 if (!inFunctionScope())
368 ValueSymbolTable &SymTab = CurFun.CurrentFunction->getValueSymbolTable();
369 Value *N = SymTab.lookup(D.getName());
372 if (N->getType() != Ty)
375 D.destroy(); // Free old strdup'd memory...
378 case ValID::GlobalName: { // Is it a named definition?
379 ValueSymbolTable &SymTab = CurModule.CurrentModule->getValueSymbolTable();
380 Value *N = SymTab.lookup(D.getName());
383 if (N->getType() != Ty)
386 D.destroy(); // Free old strdup'd memory...
390 // Check to make sure that "Ty" is an integral type, and that our
391 // value will fit into the specified type...
392 case ValID::ConstSIntVal: // Is it a constant pool reference??
393 if (!ConstantInt::isValueValidForType(Ty, D.ConstPool64)) {
394 GenerateError("Signed integral constant '" +
395 itostr(D.ConstPool64) + "' is invalid for type '" +
396 Ty->getDescription() + "'");
399 return ConstantInt::get(Ty, D.ConstPool64, true);
401 case ValID::ConstUIntVal: // Is it an unsigned const pool reference?
402 if (!ConstantInt::isValueValidForType(Ty, D.UConstPool64)) {
403 if (!ConstantInt::isValueValidForType(Ty, D.ConstPool64)) {
404 GenerateError("Integral constant '" + utostr(D.UConstPool64) +
405 "' is invalid or out of range");
407 } else { // This is really a signed reference. Transmogrify.
408 return ConstantInt::get(Ty, D.ConstPool64, true);
411 return ConstantInt::get(Ty, D.UConstPool64);
414 case ValID::ConstFPVal: // Is it a floating point const pool reference?
415 if (!ConstantFP::isValueValidForType(Ty, *D.ConstPoolFP)) {
416 GenerateError("FP constant invalid for type");
419 // Lexer has no type info, so builds all float and double FP constants
420 // as double. Fix this here. Long double does not need this.
421 if (&D.ConstPoolFP->getSemantics() == &APFloat::IEEEdouble &&
423 D.ConstPoolFP->convert(APFloat::IEEEsingle, APFloat::rmNearestTiesToEven);
424 return ConstantFP::get(Ty, *D.ConstPoolFP);
426 case ValID::ConstNullVal: // Is it a null value?
427 if (!isa<PointerType>(Ty)) {
428 GenerateError("Cannot create a a non pointer null");
431 return ConstantPointerNull::get(cast<PointerType>(Ty));
433 case ValID::ConstUndefVal: // Is it an undef value?
434 return UndefValue::get(Ty);
436 case ValID::ConstZeroVal: // Is it a zero value?
437 return Constant::getNullValue(Ty);
439 case ValID::ConstantVal: // Fully resolved constant?
440 if (D.ConstantValue->getType() != Ty) {
441 GenerateError("Constant expression type different from required type");
444 return D.ConstantValue;
446 case ValID::InlineAsmVal: { // Inline asm expression
447 const PointerType *PTy = dyn_cast<PointerType>(Ty);
448 const FunctionType *FTy =
449 PTy ? dyn_cast<FunctionType>(PTy->getElementType()) : 0;
450 if (!FTy || !InlineAsm::Verify(FTy, D.IAD->Constraints)) {
451 GenerateError("Invalid type for asm constraint string");
454 InlineAsm *IA = InlineAsm::get(FTy, D.IAD->AsmString, D.IAD->Constraints,
455 D.IAD->HasSideEffects);
456 D.destroy(); // Free InlineAsmDescriptor.
460 assert(0 && "Unhandled case!");
464 assert(0 && "Unhandled case!");
468 // getVal - This function is identical to getExistingVal, except that if a
469 // value is not already defined, it "improvises" by creating a placeholder var
470 // that looks and acts just like the requested variable. When the value is
471 // defined later, all uses of the placeholder variable are replaced with the
474 static Value *getVal(const Type *Ty, const ValID &ID) {
475 if (Ty == Type::LabelTy) {
476 GenerateError("Cannot use a basic block here");
480 // See if the value has already been defined.
481 Value *V = getExistingVal(Ty, ID);
483 if (TriggerError) return 0;
485 if (!Ty->isFirstClassType() && !isa<OpaqueType>(Ty)) {
486 GenerateError("Invalid use of a composite type");
490 // If we reached here, we referenced either a symbol that we don't know about
491 // or an id number that hasn't been read yet. We may be referencing something
492 // forward, so just create an entry to be resolved later and get to it...
495 case ValID::GlobalName:
496 case ValID::GlobalID: {
497 const PointerType *PTy = dyn_cast<PointerType>(Ty);
499 GenerateError("Invalid type for reference to global" );
502 const Type* ElTy = PTy->getElementType();
503 if (const FunctionType *FTy = dyn_cast<FunctionType>(ElTy))
504 V = new Function(FTy, GlobalValue::ExternalLinkage);
506 V = new GlobalVariable(ElTy, false, GlobalValue::ExternalLinkage);
510 V = new Argument(Ty);
513 // Remember where this forward reference came from. FIXME, shouldn't we try
514 // to recycle these things??
515 CurModule.PlaceHolderInfo.insert(std::make_pair(V, std::make_pair(ID,
518 if (inFunctionScope())
519 InsertValue(V, CurFun.LateResolveValues);
521 InsertValue(V, CurModule.LateResolveValues);
525 /// defineBBVal - This is a definition of a new basic block with the specified
526 /// identifier which must be the same as CurFun.NextValNum, if its numeric.
527 static BasicBlock *defineBBVal(const ValID &ID) {
528 assert(inFunctionScope() && "Can't get basic block at global scope!");
532 // First, see if this was forward referenced
534 std::map<ValID, BasicBlock*>::iterator BBI = CurFun.BBForwardRefs.find(ID);
535 if (BBI != CurFun.BBForwardRefs.end()) {
537 // The forward declaration could have been inserted anywhere in the
538 // function: insert it into the correct place now.
539 CurFun.CurrentFunction->getBasicBlockList().remove(BB);
540 CurFun.CurrentFunction->getBasicBlockList().push_back(BB);
542 // We're about to erase the entry, save the key so we can clean it up.
543 ValID Tmp = BBI->first;
545 // Erase the forward ref from the map as its no longer "forward"
546 CurFun.BBForwardRefs.erase(ID);
548 // The key has been removed from the map but so we don't want to leave
549 // strdup'd memory around so destroy it too.
552 // If its a numbered definition, bump the number and set the BB value.
553 if (ID.Type == ValID::LocalID) {
554 assert(ID.Num == CurFun.NextValNum && "Invalid new block number");
562 // We haven't seen this BB before and its first mention is a definition.
563 // Just create it and return it.
564 std::string Name (ID.Type == ValID::LocalName ? ID.getName() : "");
565 BB = new BasicBlock(Name, CurFun.CurrentFunction);
566 if (ID.Type == ValID::LocalID) {
567 assert(ID.Num == CurFun.NextValNum && "Invalid new block number");
571 ID.destroy(); // Free strdup'd memory
575 /// getBBVal - get an existing BB value or create a forward reference for it.
577 static BasicBlock *getBBVal(const ValID &ID) {
578 assert(inFunctionScope() && "Can't get basic block at global scope!");
582 std::map<ValID, BasicBlock*>::iterator BBI = CurFun.BBForwardRefs.find(ID);
583 if (BBI != CurFun.BBForwardRefs.end()) {
585 } if (ID.Type == ValID::LocalName) {
586 std::string Name = ID.getName();
587 Value *N = CurFun.CurrentFunction->getValueSymbolTable().lookup(Name);
589 if (N->getType()->getTypeID() == Type::LabelTyID)
590 BB = cast<BasicBlock>(N);
592 GenerateError("Reference to label '" + Name + "' is actually of type '"+
593 N->getType()->getDescription() + "'");
594 } else if (ID.Type == ValID::LocalID) {
595 if (ID.Num < CurFun.NextValNum && ID.Num < CurFun.Values.size()) {
596 if (CurFun.Values[ID.Num]->getType()->getTypeID() == Type::LabelTyID)
597 BB = cast<BasicBlock>(CurFun.Values[ID.Num]);
599 GenerateError("Reference to label '%" + utostr(ID.Num) +
600 "' is actually of type '"+
601 CurFun.Values[ID.Num]->getType()->getDescription() + "'");
604 GenerateError("Illegal label reference " + ID.getName());
608 // If its already been defined, return it now.
610 ID.destroy(); // Free strdup'd memory.
614 // Otherwise, this block has not been seen before, create it.
616 if (ID.Type == ValID::LocalName)
618 BB = new BasicBlock(Name, CurFun.CurrentFunction);
620 // Insert it in the forward refs map.
621 CurFun.BBForwardRefs[ID] = BB;
627 //===----------------------------------------------------------------------===//
628 // Code to handle forward references in instructions
629 //===----------------------------------------------------------------------===//
631 // This code handles the late binding needed with statements that reference
632 // values not defined yet... for example, a forward branch, or the PHI node for
635 // This keeps a table (CurFun.LateResolveValues) of all such forward references
636 // and back patchs after we are done.
639 // ResolveDefinitions - If we could not resolve some defs at parsing
640 // time (forward branches, phi functions for loops, etc...) resolve the
644 ResolveDefinitions(ValueList &LateResolvers, ValueList *FutureLateResolvers) {
645 // Loop over LateResolveDefs fixing up stuff that couldn't be resolved
646 while (!LateResolvers.empty()) {
647 Value *V = LateResolvers.back();
648 LateResolvers.pop_back();
650 std::map<Value*, std::pair<ValID, int> >::iterator PHI =
651 CurModule.PlaceHolderInfo.find(V);
652 assert(PHI != CurModule.PlaceHolderInfo.end() && "Placeholder error!");
654 ValID &DID = PHI->second.first;
656 Value *TheRealValue = getExistingVal(V->getType(), DID);
660 V->replaceAllUsesWith(TheRealValue);
662 CurModule.PlaceHolderInfo.erase(PHI);
663 } else if (FutureLateResolvers) {
664 // Functions have their unresolved items forwarded to the module late
666 InsertValue(V, *FutureLateResolvers);
668 if (DID.Type == ValID::LocalName || DID.Type == ValID::GlobalName) {
669 GenerateError("Reference to an invalid definition: '" +DID.getName()+
670 "' of type '" + V->getType()->getDescription() + "'",
674 GenerateError("Reference to an invalid definition: #" +
675 itostr(DID.Num) + " of type '" +
676 V->getType()->getDescription() + "'",
682 LateResolvers.clear();
685 // ResolveTypeTo - A brand new type was just declared. This means that (if
686 // name is not null) things referencing Name can be resolved. Otherwise, things
687 // refering to the number can be resolved. Do this now.
689 static void ResolveTypeTo(std::string *Name, const Type *ToTy) {
692 D = ValID::createLocalName(*Name);
694 D = ValID::createLocalID(CurModule.Types.size());
696 std::map<ValID, PATypeHolder>::iterator I =
697 CurModule.LateResolveTypes.find(D);
698 if (I != CurModule.LateResolveTypes.end()) {
699 ((DerivedType*)I->second.get())->refineAbstractTypeTo(ToTy);
700 CurModule.LateResolveTypes.erase(I);
704 // setValueName - Set the specified value to the name given. The name may be
705 // null potentially, in which case this is a noop. The string passed in is
706 // assumed to be a malloc'd string buffer, and is free'd by this function.
708 static void setValueName(Value *V, std::string *NameStr) {
709 if (!NameStr) return;
710 std::string Name(*NameStr); // Copy string
711 delete NameStr; // Free old string
713 if (V->getType() == Type::VoidTy) {
714 GenerateError("Can't assign name '" + Name+"' to value with void type");
718 assert(inFunctionScope() && "Must be in function scope!");
719 ValueSymbolTable &ST = CurFun.CurrentFunction->getValueSymbolTable();
720 if (ST.lookup(Name)) {
721 GenerateError("Redefinition of value '" + Name + "' of type '" +
722 V->getType()->getDescription() + "'");
730 /// ParseGlobalVariable - Handle parsing of a global. If Initializer is null,
731 /// this is a declaration, otherwise it is a definition.
732 static GlobalVariable *
733 ParseGlobalVariable(std::string *NameStr,
734 GlobalValue::LinkageTypes Linkage,
735 GlobalValue::VisibilityTypes Visibility,
736 bool isConstantGlobal, const Type *Ty,
737 Constant *Initializer, bool IsThreadLocal) {
738 if (isa<FunctionType>(Ty)) {
739 GenerateError("Cannot declare global vars of function type");
743 const PointerType *PTy = PointerType::get(Ty);
747 Name = *NameStr; // Copy string
748 delete NameStr; // Free old string
751 // See if this global value was forward referenced. If so, recycle the
755 ID = ValID::createGlobalName(Name);
757 ID = ValID::createGlobalID(CurModule.Values.size());
760 if (GlobalValue *FWGV = CurModule.GetForwardRefForGlobal(PTy, ID)) {
761 // Move the global to the end of the list, from whereever it was
762 // previously inserted.
763 GlobalVariable *GV = cast<GlobalVariable>(FWGV);
764 CurModule.CurrentModule->getGlobalList().remove(GV);
765 CurModule.CurrentModule->getGlobalList().push_back(GV);
766 GV->setInitializer(Initializer);
767 GV->setLinkage(Linkage);
768 GV->setVisibility(Visibility);
769 GV->setConstant(isConstantGlobal);
770 GV->setThreadLocal(IsThreadLocal);
771 InsertValue(GV, CurModule.Values);
775 // If this global has a name
777 // if the global we're parsing has an initializer (is a definition) and
778 // has external linkage.
779 if (Initializer && Linkage != GlobalValue::InternalLinkage)
780 // If there is already a global with external linkage with this name
781 if (CurModule.CurrentModule->getGlobalVariable(Name, false)) {
782 // If we allow this GVar to get created, it will be renamed in the
783 // symbol table because it conflicts with an existing GVar. We can't
784 // allow redefinition of GVars whose linking indicates that their name
785 // must stay the same. Issue the error.
786 GenerateError("Redefinition of global variable named '" + Name +
787 "' of type '" + Ty->getDescription() + "'");
792 // Otherwise there is no existing GV to use, create one now.
794 new GlobalVariable(Ty, isConstantGlobal, Linkage, Initializer, Name,
795 CurModule.CurrentModule, IsThreadLocal);
796 GV->setVisibility(Visibility);
797 InsertValue(GV, CurModule.Values);
801 // setTypeName - Set the specified type to the name given. The name may be
802 // null potentially, in which case this is a noop. The string passed in is
803 // assumed to be a malloc'd string buffer, and is freed by this function.
805 // This function returns true if the type has already been defined, but is
806 // allowed to be redefined in the specified context. If the name is a new name
807 // for the type plane, it is inserted and false is returned.
808 static bool setTypeName(const Type *T, std::string *NameStr) {
809 assert(!inFunctionScope() && "Can't give types function-local names!");
810 if (NameStr == 0) return false;
812 std::string Name(*NameStr); // Copy string
813 delete NameStr; // Free old string
815 // We don't allow assigning names to void type
816 if (T == Type::VoidTy) {
817 GenerateError("Can't assign name '" + Name + "' to the void type");
821 // Set the type name, checking for conflicts as we do so.
822 bool AlreadyExists = CurModule.CurrentModule->addTypeName(Name, T);
824 if (AlreadyExists) { // Inserting a name that is already defined???
825 const Type *Existing = CurModule.CurrentModule->getTypeByName(Name);
826 assert(Existing && "Conflict but no matching type?!");
828 // There is only one case where this is allowed: when we are refining an
829 // opaque type. In this case, Existing will be an opaque type.
830 if (const OpaqueType *OpTy = dyn_cast<OpaqueType>(Existing)) {
831 // We ARE replacing an opaque type!
832 const_cast<OpaqueType*>(OpTy)->refineAbstractTypeTo(T);
836 // Otherwise, this is an attempt to redefine a type. That's okay if
837 // the redefinition is identical to the original. This will be so if
838 // Existing and T point to the same Type object. In this one case we
839 // allow the equivalent redefinition.
840 if (Existing == T) return true; // Yes, it's equal.
842 // Any other kind of (non-equivalent) redefinition is an error.
843 GenerateError("Redefinition of type named '" + Name + "' of type '" +
844 T->getDescription() + "'");
850 //===----------------------------------------------------------------------===//
851 // Code for handling upreferences in type names...
854 // TypeContains - Returns true if Ty directly contains E in it.
856 static bool TypeContains(const Type *Ty, const Type *E) {
857 return std::find(Ty->subtype_begin(), Ty->subtype_end(),
858 E) != Ty->subtype_end();
863 // NestingLevel - The number of nesting levels that need to be popped before
864 // this type is resolved.
865 unsigned NestingLevel;
867 // LastContainedTy - This is the type at the current binding level for the
868 // type. Every time we reduce the nesting level, this gets updated.
869 const Type *LastContainedTy;
871 // UpRefTy - This is the actual opaque type that the upreference is
875 UpRefRecord(unsigned NL, OpaqueType *URTy)
876 : NestingLevel(NL), LastContainedTy(URTy), UpRefTy(URTy) {}
880 // UpRefs - A list of the outstanding upreferences that need to be resolved.
881 static std::vector<UpRefRecord> UpRefs;
883 /// HandleUpRefs - Every time we finish a new layer of types, this function is
884 /// called. It loops through the UpRefs vector, which is a list of the
885 /// currently active types. For each type, if the up reference is contained in
886 /// the newly completed type, we decrement the level count. When the level
887 /// count reaches zero, the upreferenced type is the type that is passed in:
888 /// thus we can complete the cycle.
890 static PATypeHolder HandleUpRefs(const Type *ty) {
891 // If Ty isn't abstract, or if there are no up-references in it, then there is
892 // nothing to resolve here.
893 if (!ty->isAbstract() || UpRefs.empty()) return ty;
896 UR_OUT("Type '" << Ty->getDescription() <<
897 "' newly formed. Resolving upreferences.\n" <<
898 UpRefs.size() << " upreferences active!\n");
900 // If we find any resolvable upreferences (i.e., those whose NestingLevel goes
901 // to zero), we resolve them all together before we resolve them to Ty. At
902 // the end of the loop, if there is anything to resolve to Ty, it will be in
904 OpaqueType *TypeToResolve = 0;
906 for (unsigned i = 0; i != UpRefs.size(); ++i) {
907 UR_OUT(" UR#" << i << " - TypeContains(" << Ty->getDescription() << ", "
908 << UpRefs[i].second->getDescription() << ") = "
909 << (TypeContains(Ty, UpRefs[i].second) ? "true" : "false") << "\n");
910 if (TypeContains(Ty, UpRefs[i].LastContainedTy)) {
911 // Decrement level of upreference
912 unsigned Level = --UpRefs[i].NestingLevel;
913 UpRefs[i].LastContainedTy = Ty;
914 UR_OUT(" Uplevel Ref Level = " << Level << "\n");
915 if (Level == 0) { // Upreference should be resolved!
916 if (!TypeToResolve) {
917 TypeToResolve = UpRefs[i].UpRefTy;
919 UR_OUT(" * Resolving upreference for "
920 << UpRefs[i].second->getDescription() << "\n";
921 std::string OldName = UpRefs[i].UpRefTy->getDescription());
922 UpRefs[i].UpRefTy->refineAbstractTypeTo(TypeToResolve);
923 UR_OUT(" * Type '" << OldName << "' refined upreference to: "
924 << (const void*)Ty << ", " << Ty->getDescription() << "\n");
926 UpRefs.erase(UpRefs.begin()+i); // Remove from upreference list...
927 --i; // Do not skip the next element...
933 UR_OUT(" * Resolving upreference for "
934 << UpRefs[i].second->getDescription() << "\n";
935 std::string OldName = TypeToResolve->getDescription());
936 TypeToResolve->refineAbstractTypeTo(Ty);
942 //===----------------------------------------------------------------------===//
943 // RunVMAsmParser - Define an interface to this parser
944 //===----------------------------------------------------------------------===//
946 static Module* RunParser(Module * M);
948 Module *llvm::RunVMAsmParser(const std::string &Filename, FILE *F) {
951 CurFilename = Filename;
952 return RunParser(new Module(CurFilename));
955 Module *llvm::RunVMAsmParser(const char * AsmString, Module * M) {
956 set_scan_string(AsmString);
958 CurFilename = "from_memory";
960 return RunParser(new Module (CurFilename));
969 llvm::Module *ModuleVal;
970 llvm::Function *FunctionVal;
971 llvm::BasicBlock *BasicBlockVal;
972 llvm::TerminatorInst *TermInstVal;
973 llvm::Instruction *InstVal;
974 llvm::Constant *ConstVal;
976 const llvm::Type *PrimType;
977 std::list<llvm::PATypeHolder> *TypeList;
978 llvm::PATypeHolder *TypeVal;
979 llvm::Value *ValueVal;
980 std::vector<llvm::Value*> *ValueList;
981 llvm::ArgListType *ArgList;
982 llvm::TypeWithAttrs TypeWithAttrs;
983 llvm::TypeWithAttrsList *TypeWithAttrsList;
984 llvm::ParamList *ParamList;
986 // Represent the RHS of PHI node
987 std::list<std::pair<llvm::Value*,
988 llvm::BasicBlock*> > *PHIList;
989 std::vector<std::pair<llvm::Constant*, llvm::BasicBlock*> > *JumpTable;
990 std::vector<llvm::Constant*> *ConstVector;
992 llvm::GlobalValue::LinkageTypes Linkage;
993 llvm::GlobalValue::VisibilityTypes Visibility;
995 llvm::APInt *APIntVal;
1000 llvm::APFloat *FPVal;
1003 std::string *StrVal; // This memory must be deleted
1004 llvm::ValID ValIDVal;
1006 llvm::Instruction::BinaryOps BinaryOpVal;
1007 llvm::Instruction::TermOps TermOpVal;
1008 llvm::Instruction::MemoryOps MemOpVal;
1009 llvm::Instruction::CastOps CastOpVal;
1010 llvm::Instruction::OtherOps OtherOpVal;
1011 llvm::ICmpInst::Predicate IPredicate;
1012 llvm::FCmpInst::Predicate FPredicate;
1015 %type <ModuleVal> Module
1016 %type <FunctionVal> Function FunctionProto FunctionHeader BasicBlockList
1017 %type <BasicBlockVal> BasicBlock InstructionList
1018 %type <TermInstVal> BBTerminatorInst
1019 %type <InstVal> Inst InstVal MemoryInst
1020 %type <ConstVal> ConstVal ConstExpr AliaseeRef
1021 %type <ConstVector> ConstVector
1022 %type <ArgList> ArgList ArgListH
1023 %type <PHIList> PHIList
1024 %type <ParamList> ParamList // For call param lists & GEP indices
1025 %type <ValueList> IndexList // For GEP indices
1026 %type <TypeList> TypeListI
1027 %type <TypeWithAttrsList> ArgTypeList ArgTypeListI
1028 %type <TypeWithAttrs> ArgType
1029 %type <JumpTable> JumpTable
1030 %type <BoolVal> GlobalType // GLOBAL or CONSTANT?
1031 %type <BoolVal> ThreadLocal // 'thread_local' or not
1032 %type <BoolVal> OptVolatile // 'volatile' or not
1033 %type <BoolVal> OptTailCall // TAIL CALL or plain CALL.
1034 %type <BoolVal> OptSideEffect // 'sideeffect' or not.
1035 %type <Linkage> GVInternalLinkage GVExternalLinkage
1036 %type <Linkage> FunctionDefineLinkage FunctionDeclareLinkage
1037 %type <Linkage> AliasLinkage
1038 %type <Visibility> GVVisibilityStyle
1040 // ValueRef - Unresolved reference to a definition or BB
1041 %type <ValIDVal> ValueRef ConstValueRef SymbolicValueRef
1042 %type <ValueVal> ResolvedVal // <type> <valref> pair
1043 // Tokens and types for handling constant integer values
1045 // ESINT64VAL - A negative number within long long range
1046 %token <SInt64Val> ESINT64VAL
1048 // EUINT64VAL - A positive number within uns. long long range
1049 %token <UInt64Val> EUINT64VAL
1051 // ESAPINTVAL - A negative number with arbitrary precision
1052 %token <APIntVal> ESAPINTVAL
1054 // EUAPINTVAL - A positive number with arbitrary precision
1055 %token <APIntVal> EUAPINTVAL
1057 %token <UIntVal> LOCALVAL_ID GLOBALVAL_ID // %123 @123
1058 %token <FPVal> FPVAL // Float or Double constant
1060 // Built in types...
1061 %type <TypeVal> Types ResultTypes
1062 %type <PrimType> IntType FPType PrimType // Classifications
1063 %token <PrimType> VOID INTTYPE
1064 %token <PrimType> FLOAT DOUBLE X86_FP80 FP128 PPC_FP128 LABEL
1068 %token<StrVal> LOCALVAR GLOBALVAR LABELSTR
1069 %token<StrVal> STRINGCONSTANT ATSTRINGCONSTANT PCTSTRINGCONSTANT
1070 %type <StrVal> LocalName OptLocalName OptLocalAssign
1071 %type <StrVal> GlobalName OptGlobalAssign GlobalAssign
1072 %type <StrVal> OptSection SectionString
1074 %type <UIntVal> OptAlign OptCAlign
1076 %token ZEROINITIALIZER TRUETOK FALSETOK BEGINTOK ENDTOK
1077 %token DECLARE DEFINE GLOBAL CONSTANT SECTION ALIAS VOLATILE THREAD_LOCAL
1078 %token TO DOTDOTDOT NULL_TOK UNDEF INTERNAL LINKONCE WEAK APPENDING
1079 %token DLLIMPORT DLLEXPORT EXTERN_WEAK
1080 %token OPAQUE EXTERNAL TARGET TRIPLE ALIGN
1081 %token DEPLIBS CALL TAIL ASM_TOK MODULE SIDEEFFECT
1082 %token CC_TOK CCC_TOK FASTCC_TOK COLDCC_TOK X86_STDCALLCC_TOK X86_FASTCALLCC_TOK
1084 %type <UIntVal> OptCallingConv
1085 %type <ParamAttrs> OptParamAttrs ParamAttr
1086 %type <ParamAttrs> OptFuncAttrs FuncAttr
1088 // Basic Block Terminating Operators
1089 %token <TermOpVal> RET BR SWITCH INVOKE UNWIND UNREACHABLE
1092 %type <BinaryOpVal> ArithmeticOps LogicalOps // Binops Subcatagories
1093 %token <BinaryOpVal> ADD SUB MUL UDIV SDIV FDIV UREM SREM FREM AND OR XOR
1094 %token <BinaryOpVal> SHL LSHR ASHR
1096 %token <OtherOpVal> ICMP FCMP
1097 %type <IPredicate> IPredicates
1098 %type <FPredicate> FPredicates
1099 %token EQ NE SLT SGT SLE SGE ULT UGT ULE UGE
1100 %token OEQ ONE OLT OGT OLE OGE ORD UNO UEQ UNE
1102 // Memory Instructions
1103 %token <MemOpVal> MALLOC ALLOCA FREE LOAD STORE GETELEMENTPTR
1106 %type <CastOpVal> CastOps
1107 %token <CastOpVal> TRUNC ZEXT SEXT FPTRUNC FPEXT BITCAST
1108 %token <CastOpVal> UITOFP SITOFP FPTOUI FPTOSI INTTOPTR PTRTOINT
1111 %token <OtherOpVal> PHI_TOK SELECT VAARG
1112 %token <OtherOpVal> EXTRACTELEMENT INSERTELEMENT SHUFFLEVECTOR
1114 // Function Attributes
1115 %token SIGNEXT ZEROEXT NORETURN INREG SRET NOUNWIND NOALIAS BYVAL NEST
1118 // Visibility Styles
1119 %token DEFAULT HIDDEN PROTECTED
1125 // Operations that are notably excluded from this list include:
1126 // RET, BR, & SWITCH because they end basic blocks and are treated specially.
1128 ArithmeticOps: ADD | SUB | MUL | UDIV | SDIV | FDIV | UREM | SREM | FREM;
1129 LogicalOps : SHL | LSHR | ASHR | AND | OR | XOR;
1130 CastOps : TRUNC | ZEXT | SEXT | FPTRUNC | FPEXT | BITCAST |
1131 UITOFP | SITOFP | FPTOUI | FPTOSI | INTTOPTR | PTRTOINT;
1134 : EQ { $$ = ICmpInst::ICMP_EQ; } | NE { $$ = ICmpInst::ICMP_NE; }
1135 | SLT { $$ = ICmpInst::ICMP_SLT; } | SGT { $$ = ICmpInst::ICMP_SGT; }
1136 | SLE { $$ = ICmpInst::ICMP_SLE; } | SGE { $$ = ICmpInst::ICMP_SGE; }
1137 | ULT { $$ = ICmpInst::ICMP_ULT; } | UGT { $$ = ICmpInst::ICMP_UGT; }
1138 | ULE { $$ = ICmpInst::ICMP_ULE; } | UGE { $$ = ICmpInst::ICMP_UGE; }
1142 : OEQ { $$ = FCmpInst::FCMP_OEQ; } | ONE { $$ = FCmpInst::FCMP_ONE; }
1143 | OLT { $$ = FCmpInst::FCMP_OLT; } | OGT { $$ = FCmpInst::FCMP_OGT; }
1144 | OLE { $$ = FCmpInst::FCMP_OLE; } | OGE { $$ = FCmpInst::FCMP_OGE; }
1145 | ORD { $$ = FCmpInst::FCMP_ORD; } | UNO { $$ = FCmpInst::FCMP_UNO; }
1146 | UEQ { $$ = FCmpInst::FCMP_UEQ; } | UNE { $$ = FCmpInst::FCMP_UNE; }
1147 | ULT { $$ = FCmpInst::FCMP_ULT; } | UGT { $$ = FCmpInst::FCMP_UGT; }
1148 | ULE { $$ = FCmpInst::FCMP_ULE; } | UGE { $$ = FCmpInst::FCMP_UGE; }
1149 | TRUETOK { $$ = FCmpInst::FCMP_TRUE; }
1150 | FALSETOK { $$ = FCmpInst::FCMP_FALSE; }
1153 // These are some types that allow classification if we only want a particular
1154 // thing... for example, only a signed, unsigned, or integral type.
1156 FPType : FLOAT | DOUBLE | PPC_FP128 | FP128 | X86_FP80;
1158 LocalName : LOCALVAR | STRINGCONSTANT | PCTSTRINGCONSTANT ;
1159 OptLocalName : LocalName | /*empty*/ { $$ = 0; };
1161 /// OptLocalAssign - Value producing statements have an optional assignment
1163 OptLocalAssign : LocalName '=' {
1172 GlobalName : GLOBALVAR | ATSTRINGCONSTANT ;
1174 OptGlobalAssign : GlobalAssign
1180 GlobalAssign : GlobalName '=' {
1186 : INTERNAL { $$ = GlobalValue::InternalLinkage; }
1187 | WEAK { $$ = GlobalValue::WeakLinkage; }
1188 | LINKONCE { $$ = GlobalValue::LinkOnceLinkage; }
1189 | APPENDING { $$ = GlobalValue::AppendingLinkage; }
1190 | DLLEXPORT { $$ = GlobalValue::DLLExportLinkage; }
1194 : DLLIMPORT { $$ = GlobalValue::DLLImportLinkage; }
1195 | EXTERN_WEAK { $$ = GlobalValue::ExternalWeakLinkage; }
1196 | EXTERNAL { $$ = GlobalValue::ExternalLinkage; }
1200 : /*empty*/ { $$ = GlobalValue::DefaultVisibility; }
1201 | DEFAULT { $$ = GlobalValue::DefaultVisibility; }
1202 | HIDDEN { $$ = GlobalValue::HiddenVisibility; }
1203 | PROTECTED { $$ = GlobalValue::ProtectedVisibility; }
1206 FunctionDeclareLinkage
1207 : /*empty*/ { $$ = GlobalValue::ExternalLinkage; }
1208 | DLLIMPORT { $$ = GlobalValue::DLLImportLinkage; }
1209 | EXTERN_WEAK { $$ = GlobalValue::ExternalWeakLinkage; }
1212 FunctionDefineLinkage
1213 : /*empty*/ { $$ = GlobalValue::ExternalLinkage; }
1214 | INTERNAL { $$ = GlobalValue::InternalLinkage; }
1215 | LINKONCE { $$ = GlobalValue::LinkOnceLinkage; }
1216 | WEAK { $$ = GlobalValue::WeakLinkage; }
1217 | DLLEXPORT { $$ = GlobalValue::DLLExportLinkage; }
1221 : /*empty*/ { $$ = GlobalValue::ExternalLinkage; }
1222 | WEAK { $$ = GlobalValue::WeakLinkage; }
1223 | INTERNAL { $$ = GlobalValue::InternalLinkage; }
1226 OptCallingConv : /*empty*/ { $$ = CallingConv::C; } |
1227 CCC_TOK { $$ = CallingConv::C; } |
1228 FASTCC_TOK { $$ = CallingConv::Fast; } |
1229 COLDCC_TOK { $$ = CallingConv::Cold; } |
1230 X86_STDCALLCC_TOK { $$ = CallingConv::X86_StdCall; } |
1231 X86_FASTCALLCC_TOK { $$ = CallingConv::X86_FastCall; } |
1233 if ((unsigned)$2 != $2)
1234 GEN_ERROR("Calling conv too large");
1239 ParamAttr : ZEROEXT { $$ = ParamAttr::ZExt; }
1240 | ZEXT { $$ = ParamAttr::ZExt; }
1241 | SIGNEXT { $$ = ParamAttr::SExt; }
1242 | SEXT { $$ = ParamAttr::SExt; }
1243 | INREG { $$ = ParamAttr::InReg; }
1244 | SRET { $$ = ParamAttr::StructRet; }
1245 | NOALIAS { $$ = ParamAttr::NoAlias; }
1246 | BYVAL { $$ = ParamAttr::ByVal; }
1247 | NEST { $$ = ParamAttr::Nest; }
1250 OptParamAttrs : /* empty */ { $$ = ParamAttr::None; }
1251 | OptParamAttrs ParamAttr {
1256 FuncAttr : NORETURN { $$ = ParamAttr::NoReturn; }
1257 | NOUNWIND { $$ = ParamAttr::NoUnwind; }
1258 | ZEROEXT { $$ = ParamAttr::ZExt; }
1259 | SIGNEXT { $$ = ParamAttr::SExt; }
1260 | PURE { $$ = ParamAttr::Pure; }
1261 | CONST { $$ = ParamAttr::Const; }
1264 OptFuncAttrs : /* empty */ { $$ = ParamAttr::None; }
1265 | OptFuncAttrs FuncAttr {
1270 // OptAlign/OptCAlign - An optional alignment, and an optional alignment with
1271 // a comma before it.
1272 OptAlign : /*empty*/ { $$ = 0; } |
1275 if ($$ != 0 && !isPowerOf2_32($$))
1276 GEN_ERROR("Alignment must be a power of two");
1279 OptCAlign : /*empty*/ { $$ = 0; } |
1280 ',' ALIGN EUINT64VAL {
1282 if ($$ != 0 && !isPowerOf2_32($$))
1283 GEN_ERROR("Alignment must be a power of two");
1288 SectionString : SECTION STRINGCONSTANT {
1289 for (unsigned i = 0, e = $2->length(); i != e; ++i)
1290 if ((*$2)[i] == '"' || (*$2)[i] == '\\')
1291 GEN_ERROR("Invalid character in section name");
1296 OptSection : /*empty*/ { $$ = 0; } |
1297 SectionString { $$ = $1; };
1299 // GlobalVarAttributes - Used to pass the attributes string on a global. CurGV
1300 // is set to be the global we are processing.
1302 GlobalVarAttributes : /* empty */ {} |
1303 ',' GlobalVarAttribute GlobalVarAttributes {};
1304 GlobalVarAttribute : SectionString {
1305 CurGV->setSection(*$1);
1309 | ALIGN EUINT64VAL {
1310 if ($2 != 0 && !isPowerOf2_32($2))
1311 GEN_ERROR("Alignment must be a power of two");
1312 CurGV->setAlignment($2);
1316 //===----------------------------------------------------------------------===//
1317 // Types includes all predefined types... except void, because it can only be
1318 // used in specific contexts (function returning void for example).
1320 // Derived types are added later...
1322 PrimType : INTTYPE | FLOAT | DOUBLE | PPC_FP128 | FP128 | X86_FP80 | LABEL ;
1326 $$ = new PATypeHolder(OpaqueType::get());
1330 $$ = new PATypeHolder($1);
1333 | Types '*' { // Pointer type?
1334 if (*$1 == Type::LabelTy)
1335 GEN_ERROR("Cannot form a pointer to a basic block");
1336 $$ = new PATypeHolder(HandleUpRefs(PointerType::get(*$1)));
1340 | SymbolicValueRef { // Named types are also simple types...
1341 const Type* tmp = getTypeVal($1);
1343 $$ = new PATypeHolder(tmp);
1345 | '\\' EUINT64VAL { // Type UpReference
1346 if ($2 > (uint64_t)~0U) GEN_ERROR("Value out of range");
1347 OpaqueType *OT = OpaqueType::get(); // Use temporary placeholder
1348 UpRefs.push_back(UpRefRecord((unsigned)$2, OT)); // Add to vector...
1349 $$ = new PATypeHolder(OT);
1350 UR_OUT("New Upreference!\n");
1353 | Types '(' ArgTypeListI ')' OptFuncAttrs {
1354 std::vector<const Type*> Params;
1355 ParamAttrsVector Attrs;
1356 if ($5 != ParamAttr::None) {
1357 ParamAttrsWithIndex X; X.index = 0; X.attrs = $5;
1361 TypeWithAttrsList::iterator I = $3->begin(), E = $3->end();
1362 for (; I != E; ++I, ++index) {
1363 const Type *Ty = I->Ty->get();
1364 Params.push_back(Ty);
1365 if (Ty != Type::VoidTy)
1366 if (I->Attrs != ParamAttr::None) {
1367 ParamAttrsWithIndex X; X.index = index; X.attrs = I->Attrs;
1371 bool isVarArg = Params.size() && Params.back() == Type::VoidTy;
1372 if (isVarArg) Params.pop_back();
1374 ParamAttrsList *ActualAttrs = 0;
1376 ActualAttrs = ParamAttrsList::get(Attrs);
1377 FunctionType *FT = FunctionType::get(*$1, Params, isVarArg, ActualAttrs);
1378 delete $3; // Delete the argument list
1379 delete $1; // Delete the return type handle
1380 $$ = new PATypeHolder(HandleUpRefs(FT));
1383 | VOID '(' ArgTypeListI ')' OptFuncAttrs {
1384 std::vector<const Type*> Params;
1385 ParamAttrsVector Attrs;
1386 if ($5 != ParamAttr::None) {
1387 ParamAttrsWithIndex X; X.index = 0; X.attrs = $5;
1390 TypeWithAttrsList::iterator I = $3->begin(), E = $3->end();
1392 for ( ; I != E; ++I, ++index) {
1393 const Type* Ty = I->Ty->get();
1394 Params.push_back(Ty);
1395 if (Ty != Type::VoidTy)
1396 if (I->Attrs != ParamAttr::None) {
1397 ParamAttrsWithIndex X; X.index = index; X.attrs = I->Attrs;
1401 bool isVarArg = Params.size() && Params.back() == Type::VoidTy;
1402 if (isVarArg) Params.pop_back();
1404 ParamAttrsList *ActualAttrs = 0;
1406 ActualAttrs = ParamAttrsList::get(Attrs);
1408 FunctionType *FT = FunctionType::get($1, Params, isVarArg, ActualAttrs);
1409 delete $3; // Delete the argument list
1410 $$ = new PATypeHolder(HandleUpRefs(FT));
1414 | '[' EUINT64VAL 'x' Types ']' { // Sized array type?
1415 $$ = new PATypeHolder(HandleUpRefs(ArrayType::get(*$4, (unsigned)$2)));
1419 | '<' EUINT64VAL 'x' Types '>' { // Vector type?
1420 const llvm::Type* ElemTy = $4->get();
1421 if ((unsigned)$2 != $2)
1422 GEN_ERROR("Unsigned result not equal to signed result");
1423 if (!ElemTy->isFloatingPoint() && !ElemTy->isInteger())
1424 GEN_ERROR("Element type of a VectorType must be primitive");
1425 if (!isPowerOf2_32($2))
1426 GEN_ERROR("Vector length should be a power of 2");
1427 $$ = new PATypeHolder(HandleUpRefs(VectorType::get(*$4, (unsigned)$2)));
1431 | '{' TypeListI '}' { // Structure type?
1432 std::vector<const Type*> Elements;
1433 for (std::list<llvm::PATypeHolder>::iterator I = $2->begin(),
1434 E = $2->end(); I != E; ++I)
1435 Elements.push_back(*I);
1437 $$ = new PATypeHolder(HandleUpRefs(StructType::get(Elements)));
1441 | '{' '}' { // Empty structure type?
1442 $$ = new PATypeHolder(StructType::get(std::vector<const Type*>()));
1445 | '<' '{' TypeListI '}' '>' {
1446 std::vector<const Type*> Elements;
1447 for (std::list<llvm::PATypeHolder>::iterator I = $3->begin(),
1448 E = $3->end(); I != E; ++I)
1449 Elements.push_back(*I);
1451 $$ = new PATypeHolder(HandleUpRefs(StructType::get(Elements, true)));
1455 | '<' '{' '}' '>' { // Empty structure type?
1456 $$ = new PATypeHolder(StructType::get(std::vector<const Type*>(), true));
1462 : Types OptParamAttrs {
1470 if (!UpRefs.empty())
1471 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1472 if (!(*$1)->isFirstClassType())
1473 GEN_ERROR("LLVM functions cannot return aggregate types");
1477 $$ = new PATypeHolder(Type::VoidTy);
1481 ArgTypeList : ArgType {
1482 $$ = new TypeWithAttrsList();
1486 | ArgTypeList ',' ArgType {
1487 ($$=$1)->push_back($3);
1494 | ArgTypeList ',' DOTDOTDOT {
1496 TypeWithAttrs TWA; TWA.Attrs = ParamAttr::None;
1497 TWA.Ty = new PATypeHolder(Type::VoidTy);
1502 $$ = new TypeWithAttrsList;
1503 TypeWithAttrs TWA; TWA.Attrs = ParamAttr::None;
1504 TWA.Ty = new PATypeHolder(Type::VoidTy);
1509 $$ = new TypeWithAttrsList();
1513 // TypeList - Used for struct declarations and as a basis for function type
1514 // declaration type lists
1517 $$ = new std::list<PATypeHolder>();
1522 | TypeListI ',' Types {
1523 ($$=$1)->push_back(*$3);
1528 // ConstVal - The various declarations that go into the constant pool. This
1529 // production is used ONLY to represent constants that show up AFTER a 'const',
1530 // 'constant' or 'global' token at global scope. Constants that can be inlined
1531 // into other expressions (such as integers and constexprs) are handled by the
1532 // ResolvedVal, ValueRef and ConstValueRef productions.
1534 ConstVal: Types '[' ConstVector ']' { // Nonempty unsized arr
1535 if (!UpRefs.empty())
1536 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1537 const ArrayType *ATy = dyn_cast<ArrayType>($1->get());
1539 GEN_ERROR("Cannot make array constant with type: '" +
1540 (*$1)->getDescription() + "'");
1541 const Type *ETy = ATy->getElementType();
1542 int NumElements = ATy->getNumElements();
1544 // Verify that we have the correct size...
1545 if (NumElements != -1 && NumElements != (int)$3->size())
1546 GEN_ERROR("Type mismatch: constant sized array initialized with " +
1547 utostr($3->size()) + " arguments, but has size of " +
1548 itostr(NumElements) + "");
1550 // Verify all elements are correct type!
1551 for (unsigned i = 0; i < $3->size(); i++) {
1552 if (ETy != (*$3)[i]->getType())
1553 GEN_ERROR("Element #" + utostr(i) + " is not of type '" +
1554 ETy->getDescription() +"' as required!\nIt is of type '"+
1555 (*$3)[i]->getType()->getDescription() + "'.");
1558 $$ = ConstantArray::get(ATy, *$3);
1559 delete $1; delete $3;
1563 if (!UpRefs.empty())
1564 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1565 const ArrayType *ATy = dyn_cast<ArrayType>($1->get());
1567 GEN_ERROR("Cannot make array constant with type: '" +
1568 (*$1)->getDescription() + "'");
1570 int NumElements = ATy->getNumElements();
1571 if (NumElements != -1 && NumElements != 0)
1572 GEN_ERROR("Type mismatch: constant sized array initialized with 0"
1573 " arguments, but has size of " + itostr(NumElements) +"");
1574 $$ = ConstantArray::get(ATy, std::vector<Constant*>());
1578 | Types 'c' STRINGCONSTANT {
1579 if (!UpRefs.empty())
1580 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1581 const ArrayType *ATy = dyn_cast<ArrayType>($1->get());
1583 GEN_ERROR("Cannot make array constant with type: '" +
1584 (*$1)->getDescription() + "'");
1586 int NumElements = ATy->getNumElements();
1587 const Type *ETy = ATy->getElementType();
1588 if (NumElements != -1 && NumElements != int($3->length()))
1589 GEN_ERROR("Can't build string constant of size " +
1590 itostr((int)($3->length())) +
1591 " when array has size " + itostr(NumElements) + "");
1592 std::vector<Constant*> Vals;
1593 if (ETy == Type::Int8Ty) {
1594 for (unsigned i = 0; i < $3->length(); ++i)
1595 Vals.push_back(ConstantInt::get(ETy, (*$3)[i]));
1598 GEN_ERROR("Cannot build string arrays of non byte sized elements");
1601 $$ = ConstantArray::get(ATy, Vals);
1605 | Types '<' ConstVector '>' { // Nonempty unsized arr
1606 if (!UpRefs.empty())
1607 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1608 const VectorType *PTy = dyn_cast<VectorType>($1->get());
1610 GEN_ERROR("Cannot make packed constant with type: '" +
1611 (*$1)->getDescription() + "'");
1612 const Type *ETy = PTy->getElementType();
1613 int NumElements = PTy->getNumElements();
1615 // Verify that we have the correct size...
1616 if (NumElements != -1 && NumElements != (int)$3->size())
1617 GEN_ERROR("Type mismatch: constant sized packed initialized with " +
1618 utostr($3->size()) + " arguments, but has size of " +
1619 itostr(NumElements) + "");
1621 // Verify all elements are correct type!
1622 for (unsigned i = 0; i < $3->size(); i++) {
1623 if (ETy != (*$3)[i]->getType())
1624 GEN_ERROR("Element #" + utostr(i) + " is not of type '" +
1625 ETy->getDescription() +"' as required!\nIt is of type '"+
1626 (*$3)[i]->getType()->getDescription() + "'.");
1629 $$ = ConstantVector::get(PTy, *$3);
1630 delete $1; delete $3;
1633 | Types '{' ConstVector '}' {
1634 const StructType *STy = dyn_cast<StructType>($1->get());
1636 GEN_ERROR("Cannot make struct constant with type: '" +
1637 (*$1)->getDescription() + "'");
1639 if ($3->size() != STy->getNumContainedTypes())
1640 GEN_ERROR("Illegal number of initializers for structure type");
1642 // Check to ensure that constants are compatible with the type initializer!
1643 for (unsigned i = 0, e = $3->size(); i != e; ++i)
1644 if ((*$3)[i]->getType() != STy->getElementType(i))
1645 GEN_ERROR("Expected type '" +
1646 STy->getElementType(i)->getDescription() +
1647 "' for element #" + utostr(i) +
1648 " of structure initializer");
1650 // Check to ensure that Type is not packed
1651 if (STy->isPacked())
1652 GEN_ERROR("Unpacked Initializer to vector type '" +
1653 STy->getDescription() + "'");
1655 $$ = ConstantStruct::get(STy, *$3);
1656 delete $1; delete $3;
1660 if (!UpRefs.empty())
1661 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1662 const StructType *STy = dyn_cast<StructType>($1->get());
1664 GEN_ERROR("Cannot make struct constant with type: '" +
1665 (*$1)->getDescription() + "'");
1667 if (STy->getNumContainedTypes() != 0)
1668 GEN_ERROR("Illegal number of initializers for structure type");
1670 // Check to ensure that Type is not packed
1671 if (STy->isPacked())
1672 GEN_ERROR("Unpacked Initializer to vector type '" +
1673 STy->getDescription() + "'");
1675 $$ = ConstantStruct::get(STy, std::vector<Constant*>());
1679 | Types '<' '{' ConstVector '}' '>' {
1680 const StructType *STy = dyn_cast<StructType>($1->get());
1682 GEN_ERROR("Cannot make struct constant with type: '" +
1683 (*$1)->getDescription() + "'");
1685 if ($4->size() != STy->getNumContainedTypes())
1686 GEN_ERROR("Illegal number of initializers for structure type");
1688 // Check to ensure that constants are compatible with the type initializer!
1689 for (unsigned i = 0, e = $4->size(); i != e; ++i)
1690 if ((*$4)[i]->getType() != STy->getElementType(i))
1691 GEN_ERROR("Expected type '" +
1692 STy->getElementType(i)->getDescription() +
1693 "' for element #" + utostr(i) +
1694 " of structure initializer");
1696 // Check to ensure that Type is packed
1697 if (!STy->isPacked())
1698 GEN_ERROR("Vector initializer to non-vector type '" +
1699 STy->getDescription() + "'");
1701 $$ = ConstantStruct::get(STy, *$4);
1702 delete $1; delete $4;
1705 | Types '<' '{' '}' '>' {
1706 if (!UpRefs.empty())
1707 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1708 const StructType *STy = dyn_cast<StructType>($1->get());
1710 GEN_ERROR("Cannot make struct constant with type: '" +
1711 (*$1)->getDescription() + "'");
1713 if (STy->getNumContainedTypes() != 0)
1714 GEN_ERROR("Illegal number of initializers for structure type");
1716 // Check to ensure that Type is packed
1717 if (!STy->isPacked())
1718 GEN_ERROR("Vector initializer to non-vector type '" +
1719 STy->getDescription() + "'");
1721 $$ = ConstantStruct::get(STy, std::vector<Constant*>());
1726 if (!UpRefs.empty())
1727 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1728 const PointerType *PTy = dyn_cast<PointerType>($1->get());
1730 GEN_ERROR("Cannot make null pointer constant with type: '" +
1731 (*$1)->getDescription() + "'");
1733 $$ = ConstantPointerNull::get(PTy);
1738 if (!UpRefs.empty())
1739 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1740 $$ = UndefValue::get($1->get());
1744 | Types SymbolicValueRef {
1745 if (!UpRefs.empty())
1746 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1747 const PointerType *Ty = dyn_cast<PointerType>($1->get());
1749 GEN_ERROR("Global const reference must be a pointer type");
1751 // ConstExprs can exist in the body of a function, thus creating
1752 // GlobalValues whenever they refer to a variable. Because we are in
1753 // the context of a function, getExistingVal will search the functions
1754 // symbol table instead of the module symbol table for the global symbol,
1755 // which throws things all off. To get around this, we just tell
1756 // getExistingVal that we are at global scope here.
1758 Function *SavedCurFn = CurFun.CurrentFunction;
1759 CurFun.CurrentFunction = 0;
1761 Value *V = getExistingVal(Ty, $2);
1764 CurFun.CurrentFunction = SavedCurFn;
1766 // If this is an initializer for a constant pointer, which is referencing a
1767 // (currently) undefined variable, create a stub now that shall be replaced
1768 // in the future with the right type of variable.
1771 assert(isa<PointerType>(Ty) && "Globals may only be used as pointers!");
1772 const PointerType *PT = cast<PointerType>(Ty);
1774 // First check to see if the forward references value is already created!
1775 PerModuleInfo::GlobalRefsType::iterator I =
1776 CurModule.GlobalRefs.find(std::make_pair(PT, $2));
1778 if (I != CurModule.GlobalRefs.end()) {
1779 V = I->second; // Placeholder already exists, use it...
1783 if ($2.Type == ValID::GlobalName)
1784 Name = $2.getName();
1785 else if ($2.Type != ValID::GlobalID)
1786 GEN_ERROR("Invalid reference to global");
1788 // Create the forward referenced global.
1790 if (const FunctionType *FTy =
1791 dyn_cast<FunctionType>(PT->getElementType())) {
1792 GV = new Function(FTy, GlobalValue::ExternalWeakLinkage, Name,
1793 CurModule.CurrentModule);
1795 GV = new GlobalVariable(PT->getElementType(), false,
1796 GlobalValue::ExternalWeakLinkage, 0,
1797 Name, CurModule.CurrentModule);
1800 // Keep track of the fact that we have a forward ref to recycle it
1801 CurModule.GlobalRefs.insert(std::make_pair(std::make_pair(PT, $2), GV));
1806 $$ = cast<GlobalValue>(V);
1807 delete $1; // Free the type handle
1811 if (!UpRefs.empty())
1812 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1813 if ($1->get() != $2->getType())
1814 GEN_ERROR("Mismatched types for constant expression: " +
1815 (*$1)->getDescription() + " and " + $2->getType()->getDescription());
1820 | Types ZEROINITIALIZER {
1821 if (!UpRefs.empty())
1822 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1823 const Type *Ty = $1->get();
1824 if (isa<FunctionType>(Ty) || Ty == Type::LabelTy || isa<OpaqueType>(Ty))
1825 GEN_ERROR("Cannot create a null initialized value of this type");
1826 $$ = Constant::getNullValue(Ty);
1830 | IntType ESINT64VAL { // integral constants
1831 if (!ConstantInt::isValueValidForType($1, $2))
1832 GEN_ERROR("Constant value doesn't fit in type");
1833 $$ = ConstantInt::get($1, $2, true);
1836 | IntType ESAPINTVAL { // arbitrary precision integer constants
1837 uint32_t BitWidth = cast<IntegerType>($1)->getBitWidth();
1838 if ($2->getBitWidth() > BitWidth) {
1839 GEN_ERROR("Constant value does not fit in type");
1841 $2->sextOrTrunc(BitWidth);
1842 $$ = ConstantInt::get(*$2);
1846 | IntType EUINT64VAL { // integral constants
1847 if (!ConstantInt::isValueValidForType($1, $2))
1848 GEN_ERROR("Constant value doesn't fit in type");
1849 $$ = ConstantInt::get($1, $2, false);
1852 | IntType EUAPINTVAL { // arbitrary precision integer constants
1853 uint32_t BitWidth = cast<IntegerType>($1)->getBitWidth();
1854 if ($2->getBitWidth() > BitWidth) {
1855 GEN_ERROR("Constant value does not fit in type");
1857 $2->zextOrTrunc(BitWidth);
1858 $$ = ConstantInt::get(*$2);
1862 | INTTYPE TRUETOK { // Boolean constants
1863 assert(cast<IntegerType>($1)->getBitWidth() == 1 && "Not Bool?");
1864 $$ = ConstantInt::getTrue();
1867 | INTTYPE FALSETOK { // Boolean constants
1868 assert(cast<IntegerType>($1)->getBitWidth() == 1 && "Not Bool?");
1869 $$ = ConstantInt::getFalse();
1872 | FPType FPVAL { // Floating point constants
1873 if (!ConstantFP::isValueValidForType($1, *$2))
1874 GEN_ERROR("Floating point constant invalid for type");
1875 // Lexer has no type info, so builds all float and double FP constants
1876 // as double. Fix this here. Long double is done right.
1877 if (&$2->getSemantics()==&APFloat::IEEEdouble && $1==Type::FloatTy)
1878 $2->convert(APFloat::IEEEsingle, APFloat::rmNearestTiesToEven);
1879 $$ = ConstantFP::get($1, *$2);
1885 ConstExpr: CastOps '(' ConstVal TO Types ')' {
1886 if (!UpRefs.empty())
1887 GEN_ERROR("Invalid upreference in type: " + (*$5)->getDescription());
1889 const Type *DestTy = $5->get();
1890 if (!CastInst::castIsValid($1, $3, DestTy))
1891 GEN_ERROR("invalid cast opcode for cast from '" +
1892 Val->getType()->getDescription() + "' to '" +
1893 DestTy->getDescription() + "'");
1894 $$ = ConstantExpr::getCast($1, $3, DestTy);
1897 | GETELEMENTPTR '(' ConstVal IndexList ')' {
1898 if (!isa<PointerType>($3->getType()))
1899 GEN_ERROR("GetElementPtr requires a pointer operand");
1902 GetElementPtrInst::getIndexedType($3->getType(), $4->begin(), $4->end(),
1905 GEN_ERROR("Index list invalid for constant getelementptr");
1907 SmallVector<Constant*, 8> IdxVec;
1908 for (unsigned i = 0, e = $4->size(); i != e; ++i)
1909 if (Constant *C = dyn_cast<Constant>((*$4)[i]))
1910 IdxVec.push_back(C);
1912 GEN_ERROR("Indices to constant getelementptr must be constants");
1916 $$ = ConstantExpr::getGetElementPtr($3, &IdxVec[0], IdxVec.size());
1919 | SELECT '(' ConstVal ',' ConstVal ',' ConstVal ')' {
1920 if ($3->getType() != Type::Int1Ty)
1921 GEN_ERROR("Select condition must be of boolean type");
1922 if ($5->getType() != $7->getType())
1923 GEN_ERROR("Select operand types must match");
1924 $$ = ConstantExpr::getSelect($3, $5, $7);
1927 | ArithmeticOps '(' ConstVal ',' ConstVal ')' {
1928 if ($3->getType() != $5->getType())
1929 GEN_ERROR("Binary operator types must match");
1931 $$ = ConstantExpr::get($1, $3, $5);
1933 | LogicalOps '(' ConstVal ',' ConstVal ')' {
1934 if ($3->getType() != $5->getType())
1935 GEN_ERROR("Logical operator types must match");
1936 if (!$3->getType()->isInteger()) {
1937 if (Instruction::isShift($1) || !isa<VectorType>($3->getType()) ||
1938 !cast<VectorType>($3->getType())->getElementType()->isInteger())
1939 GEN_ERROR("Logical operator requires integral operands");
1941 $$ = ConstantExpr::get($1, $3, $5);
1944 | ICMP IPredicates '(' ConstVal ',' ConstVal ')' {
1945 if ($4->getType() != $6->getType())
1946 GEN_ERROR("icmp operand types must match");
1947 $$ = ConstantExpr::getICmp($2, $4, $6);
1949 | FCMP FPredicates '(' ConstVal ',' ConstVal ')' {
1950 if ($4->getType() != $6->getType())
1951 GEN_ERROR("fcmp operand types must match");
1952 $$ = ConstantExpr::getFCmp($2, $4, $6);
1954 | EXTRACTELEMENT '(' ConstVal ',' ConstVal ')' {
1955 if (!ExtractElementInst::isValidOperands($3, $5))
1956 GEN_ERROR("Invalid extractelement operands");
1957 $$ = ConstantExpr::getExtractElement($3, $5);
1960 | INSERTELEMENT '(' ConstVal ',' ConstVal ',' ConstVal ')' {
1961 if (!InsertElementInst::isValidOperands($3, $5, $7))
1962 GEN_ERROR("Invalid insertelement operands");
1963 $$ = ConstantExpr::getInsertElement($3, $5, $7);
1966 | SHUFFLEVECTOR '(' ConstVal ',' ConstVal ',' ConstVal ')' {
1967 if (!ShuffleVectorInst::isValidOperands($3, $5, $7))
1968 GEN_ERROR("Invalid shufflevector operands");
1969 $$ = ConstantExpr::getShuffleVector($3, $5, $7);
1974 // ConstVector - A list of comma separated constants.
1975 ConstVector : ConstVector ',' ConstVal {
1976 ($$ = $1)->push_back($3);
1980 $$ = new std::vector<Constant*>();
1986 // GlobalType - Match either GLOBAL or CONSTANT for global declarations...
1987 GlobalType : GLOBAL { $$ = false; } | CONSTANT { $$ = true; };
1990 ThreadLocal : THREAD_LOCAL { $$ = true; } | { $$ = false; };
1992 // AliaseeRef - Match either GlobalValue or bitcast to GlobalValue.
1993 AliaseeRef : ResultTypes SymbolicValueRef {
1994 const Type* VTy = $1->get();
1995 Value *V = getVal(VTy, $2);
1997 GlobalValue* Aliasee = dyn_cast<GlobalValue>(V);
1999 GEN_ERROR("Aliases can be created only to global values");
2005 | BITCAST '(' AliaseeRef TO Types ')' {
2007 const Type *DestTy = $5->get();
2008 if (!CastInst::castIsValid($1, $3, DestTy))
2009 GEN_ERROR("invalid cast opcode for cast from '" +
2010 Val->getType()->getDescription() + "' to '" +
2011 DestTy->getDescription() + "'");
2013 $$ = ConstantExpr::getCast($1, $3, DestTy);
2018 //===----------------------------------------------------------------------===//
2019 // Rules to match Modules
2020 //===----------------------------------------------------------------------===//
2022 // Module rule: Capture the result of parsing the whole file into a result
2027 $$ = ParserResult = CurModule.CurrentModule;
2028 CurModule.ModuleDone();
2032 $$ = ParserResult = CurModule.CurrentModule;
2033 CurModule.ModuleDone();
2040 | DefinitionList Definition
2044 : DEFINE { CurFun.isDeclare = false; } Function {
2045 CurFun.FunctionDone();
2048 | DECLARE { CurFun.isDeclare = true; } FunctionProto {
2051 | MODULE ASM_TOK AsmBlock {
2054 | OptLocalAssign TYPE Types {
2055 if (!UpRefs.empty())
2056 GEN_ERROR("Invalid upreference in type: " + (*$3)->getDescription());
2057 // Eagerly resolve types. This is not an optimization, this is a
2058 // requirement that is due to the fact that we could have this:
2060 // %list = type { %list * }
2061 // %list = type { %list * } ; repeated type decl
2063 // If types are not resolved eagerly, then the two types will not be
2064 // determined to be the same type!
2066 ResolveTypeTo($1, *$3);
2068 if (!setTypeName(*$3, $1) && !$1) {
2070 // If this is a named type that is not a redefinition, add it to the slot
2072 CurModule.Types.push_back(*$3);
2078 | OptLocalAssign TYPE VOID {
2079 ResolveTypeTo($1, $3);
2081 if (!setTypeName($3, $1) && !$1) {
2083 // If this is a named type that is not a redefinition, add it to the slot
2085 CurModule.Types.push_back($3);
2089 | OptGlobalAssign GVVisibilityStyle ThreadLocal GlobalType ConstVal {
2090 /* "Externally Visible" Linkage */
2092 GEN_ERROR("Global value initializer is not a constant");
2093 CurGV = ParseGlobalVariable($1, GlobalValue::ExternalLinkage,
2094 $2, $4, $5->getType(), $5, $3);
2096 } GlobalVarAttributes {
2099 | OptGlobalAssign GVInternalLinkage GVVisibilityStyle ThreadLocal GlobalType
2102 GEN_ERROR("Global value initializer is not a constant");
2103 CurGV = ParseGlobalVariable($1, $2, $3, $5, $6->getType(), $6, $4);
2105 } GlobalVarAttributes {
2108 | OptGlobalAssign GVExternalLinkage GVVisibilityStyle ThreadLocal GlobalType
2110 if (!UpRefs.empty())
2111 GEN_ERROR("Invalid upreference in type: " + (*$6)->getDescription());
2112 CurGV = ParseGlobalVariable($1, $2, $3, $5, *$6, 0, $4);
2115 } GlobalVarAttributes {
2119 | OptGlobalAssign GVVisibilityStyle ALIAS AliasLinkage AliaseeRef {
2126 GEN_ERROR("Alias name cannot be empty");
2128 Constant* Aliasee = $5;
2130 GEN_ERROR(std::string("Invalid aliasee for alias: ") + Name);
2132 GlobalAlias* GA = new GlobalAlias(Aliasee->getType(), $4, Name, Aliasee,
2133 CurModule.CurrentModule);
2134 GA->setVisibility($2);
2135 InsertValue(GA, CurModule.Values);
2138 // If there was a forward reference of this alias, resolve it now.
2142 ID = ValID::createGlobalName(Name);
2144 ID = ValID::createGlobalID(CurModule.Values.size()-1);
2146 if (GlobalValue *FWGV =
2147 CurModule.GetForwardRefForGlobal(GA->getType(), ID)) {
2148 // Replace uses of the fwdref with the actual alias.
2149 FWGV->replaceAllUsesWith(GA);
2150 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(FWGV))
2151 GV->eraseFromParent();
2153 cast<Function>(FWGV)->eraseFromParent();
2159 | TARGET TargetDefinition {
2162 | DEPLIBS '=' LibrariesDefinition {
2168 AsmBlock : STRINGCONSTANT {
2169 const std::string &AsmSoFar = CurModule.CurrentModule->getModuleInlineAsm();
2170 if (AsmSoFar.empty())
2171 CurModule.CurrentModule->setModuleInlineAsm(*$1);
2173 CurModule.CurrentModule->setModuleInlineAsm(AsmSoFar+"\n"+*$1);
2178 TargetDefinition : TRIPLE '=' STRINGCONSTANT {
2179 CurModule.CurrentModule->setTargetTriple(*$3);
2182 | DATALAYOUT '=' STRINGCONSTANT {
2183 CurModule.CurrentModule->setDataLayout(*$3);
2187 LibrariesDefinition : '[' LibList ']';
2189 LibList : LibList ',' STRINGCONSTANT {
2190 CurModule.CurrentModule->addLibrary(*$3);
2195 CurModule.CurrentModule->addLibrary(*$1);
2199 | /* empty: end of list */ {
2204 //===----------------------------------------------------------------------===//
2205 // Rules to match Function Headers
2206 //===----------------------------------------------------------------------===//
2208 ArgListH : ArgListH ',' Types OptParamAttrs OptLocalName {
2209 if (!UpRefs.empty())
2210 GEN_ERROR("Invalid upreference in type: " + (*$3)->getDescription());
2211 if (*$3 == Type::VoidTy)
2212 GEN_ERROR("void typed arguments are invalid");
2213 ArgListEntry E; E.Attrs = $4; E.Ty = $3; E.Name = $5;
2218 | Types OptParamAttrs OptLocalName {
2219 if (!UpRefs.empty())
2220 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
2221 if (*$1 == Type::VoidTy)
2222 GEN_ERROR("void typed arguments are invalid");
2223 ArgListEntry E; E.Attrs = $2; E.Ty = $1; E.Name = $3;
2224 $$ = new ArgListType;
2229 ArgList : ArgListH {
2233 | ArgListH ',' DOTDOTDOT {
2235 struct ArgListEntry E;
2236 E.Ty = new PATypeHolder(Type::VoidTy);
2238 E.Attrs = ParamAttr::None;
2243 $$ = new ArgListType;
2244 struct ArgListEntry E;
2245 E.Ty = new PATypeHolder(Type::VoidTy);
2247 E.Attrs = ParamAttr::None;
2256 FunctionHeaderH : OptCallingConv ResultTypes GlobalName '(' ArgList ')'
2257 OptFuncAttrs OptSection OptAlign {
2258 std::string FunctionName(*$3);
2259 delete $3; // Free strdup'd memory!
2261 // Check the function result for abstractness if this is a define. We should
2262 // have no abstract types at this point
2263 if (!CurFun.isDeclare && CurModule.TypeIsUnresolved($2))
2264 GEN_ERROR("Reference to abstract result: "+ $2->get()->getDescription());
2266 std::vector<const Type*> ParamTypeList;
2267 ParamAttrsVector Attrs;
2268 if ($7 != ParamAttr::None) {
2269 ParamAttrsWithIndex PAWI; PAWI.index = 0; PAWI.attrs = $7;
2270 Attrs.push_back(PAWI);
2272 if ($5) { // If there are arguments...
2274 for (ArgListType::iterator I = $5->begin(); I != $5->end(); ++I, ++index) {
2275 const Type* Ty = I->Ty->get();
2276 if (!CurFun.isDeclare && CurModule.TypeIsUnresolved(I->Ty))
2277 GEN_ERROR("Reference to abstract argument: " + Ty->getDescription());
2278 ParamTypeList.push_back(Ty);
2279 if (Ty != Type::VoidTy)
2280 if (I->Attrs != ParamAttr::None) {
2281 ParamAttrsWithIndex PAWI; PAWI.index = index; PAWI.attrs = I->Attrs;
2282 Attrs.push_back(PAWI);
2287 bool isVarArg = ParamTypeList.size() && ParamTypeList.back() == Type::VoidTy;
2288 if (isVarArg) ParamTypeList.pop_back();
2290 ParamAttrsList *PAL = 0;
2292 PAL = ParamAttrsList::get(Attrs);
2294 FunctionType *FT = FunctionType::get(*$2, ParamTypeList, isVarArg, PAL);
2295 const PointerType *PFT = PointerType::get(FT);
2299 if (!FunctionName.empty()) {
2300 ID = ValID::createGlobalName((char*)FunctionName.c_str());
2302 ID = ValID::createGlobalID(CurModule.Values.size());
2306 // See if this function was forward referenced. If so, recycle the object.
2307 if (GlobalValue *FWRef = CurModule.GetForwardRefForGlobal(PFT, ID)) {
2308 // Move the function to the end of the list, from whereever it was
2309 // previously inserted.
2310 Fn = cast<Function>(FWRef);
2311 CurModule.CurrentModule->getFunctionList().remove(Fn);
2312 CurModule.CurrentModule->getFunctionList().push_back(Fn);
2313 } else if (!FunctionName.empty() && // Merge with an earlier prototype?
2314 (Fn = CurModule.CurrentModule->getFunction(FunctionName))) {
2315 if (Fn->getFunctionType() != FT) {
2316 // The existing function doesn't have the same type. This is an overload
2318 GEN_ERROR("Overload of function '" + FunctionName + "' not permitted.");
2319 } else if (!CurFun.isDeclare && !Fn->isDeclaration()) {
2320 // Neither the existing or the current function is a declaration and they
2321 // have the same name and same type. Clearly this is a redefinition.
2322 GEN_ERROR("Redefinition of function '" + FunctionName + "'");
2323 } if (Fn->isDeclaration()) {
2324 // Make sure to strip off any argument names so we can't get conflicts.
2325 for (Function::arg_iterator AI = Fn->arg_begin(), AE = Fn->arg_end();
2329 } else { // Not already defined?
2330 Fn = new Function(FT, GlobalValue::ExternalWeakLinkage, FunctionName,
2331 CurModule.CurrentModule);
2333 InsertValue(Fn, CurModule.Values);
2336 CurFun.FunctionStart(Fn);
2338 if (CurFun.isDeclare) {
2339 // If we have declaration, always overwrite linkage. This will allow us to
2340 // correctly handle cases, when pointer to function is passed as argument to
2341 // another function.
2342 Fn->setLinkage(CurFun.Linkage);
2343 Fn->setVisibility(CurFun.Visibility);
2345 Fn->setCallingConv($1);
2346 Fn->setAlignment($9);
2348 Fn->setSection(*$8);
2352 // Add all of the arguments we parsed to the function...
2353 if ($5) { // Is null if empty...
2354 if (isVarArg) { // Nuke the last entry
2355 assert($5->back().Ty->get() == Type::VoidTy && $5->back().Name == 0 &&
2356 "Not a varargs marker!");
2357 delete $5->back().Ty;
2358 $5->pop_back(); // Delete the last entry
2360 Function::arg_iterator ArgIt = Fn->arg_begin();
2361 Function::arg_iterator ArgEnd = Fn->arg_end();
2363 for (ArgListType::iterator I = $5->begin();
2364 I != $5->end() && ArgIt != ArgEnd; ++I, ++ArgIt) {
2365 delete I->Ty; // Delete the typeholder...
2366 setValueName(ArgIt, I->Name); // Insert arg into symtab...
2372 delete $5; // We're now done with the argument list
2377 BEGIN : BEGINTOK | '{'; // Allow BEGIN or '{' to start a function
2379 FunctionHeader : FunctionDefineLinkage GVVisibilityStyle FunctionHeaderH BEGIN {
2380 $$ = CurFun.CurrentFunction;
2382 // Make sure that we keep track of the linkage type even if there was a
2383 // previous "declare".
2385 $$->setVisibility($2);
2388 END : ENDTOK | '}'; // Allow end of '}' to end a function
2390 Function : BasicBlockList END {
2395 FunctionProto : FunctionDeclareLinkage GVVisibilityStyle FunctionHeaderH {
2396 CurFun.CurrentFunction->setLinkage($1);
2397 CurFun.CurrentFunction->setVisibility($2);
2398 $$ = CurFun.CurrentFunction;
2399 CurFun.FunctionDone();
2403 //===----------------------------------------------------------------------===//
2404 // Rules to match Basic Blocks
2405 //===----------------------------------------------------------------------===//
2407 OptSideEffect : /* empty */ {
2416 ConstValueRef : ESINT64VAL { // A reference to a direct constant
2417 $$ = ValID::create($1);
2421 $$ = ValID::create($1);
2424 | FPVAL { // Perhaps it's an FP constant?
2425 $$ = ValID::create($1);
2429 $$ = ValID::create(ConstantInt::getTrue());
2433 $$ = ValID::create(ConstantInt::getFalse());
2437 $$ = ValID::createNull();
2441 $$ = ValID::createUndef();
2444 | ZEROINITIALIZER { // A vector zero constant.
2445 $$ = ValID::createZeroInit();
2448 | '<' ConstVector '>' { // Nonempty unsized packed vector
2449 const Type *ETy = (*$2)[0]->getType();
2450 int NumElements = $2->size();
2452 VectorType* pt = VectorType::get(ETy, NumElements);
2453 PATypeHolder* PTy = new PATypeHolder(
2461 // Verify all elements are correct type!
2462 for (unsigned i = 0; i < $2->size(); i++) {
2463 if (ETy != (*$2)[i]->getType())
2464 GEN_ERROR("Element #" + utostr(i) + " is not of type '" +
2465 ETy->getDescription() +"' as required!\nIt is of type '" +
2466 (*$2)[i]->getType()->getDescription() + "'.");
2469 $$ = ValID::create(ConstantVector::get(pt, *$2));
2470 delete PTy; delete $2;
2474 $$ = ValID::create($1);
2477 | ASM_TOK OptSideEffect STRINGCONSTANT ',' STRINGCONSTANT {
2478 $$ = ValID::createInlineAsm(*$3, *$5, $2);
2484 // SymbolicValueRef - Reference to one of two ways of symbolically refering to
2487 SymbolicValueRef : LOCALVAL_ID { // Is it an integer reference...?
2488 $$ = ValID::createLocalID($1);
2492 $$ = ValID::createGlobalID($1);
2495 | LocalName { // Is it a named reference...?
2496 $$ = ValID::createLocalName(*$1);
2500 | GlobalName { // Is it a named reference...?
2501 $$ = ValID::createGlobalName(*$1);
2506 // ValueRef - A reference to a definition... either constant or symbolic
2507 ValueRef : SymbolicValueRef | ConstValueRef;
2510 // ResolvedVal - a <type> <value> pair. This is used only in cases where the
2511 // type immediately preceeds the value reference, and allows complex constant
2512 // pool references (for things like: 'ret [2 x int] [ int 12, int 42]')
2513 ResolvedVal : Types ValueRef {
2514 if (!UpRefs.empty())
2515 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
2516 $$ = getVal(*$1, $2);
2522 BasicBlockList : BasicBlockList BasicBlock {
2526 | FunctionHeader BasicBlock { // Do not allow functions with 0 basic blocks
2532 // Basic blocks are terminated by branching instructions:
2533 // br, br/cc, switch, ret
2535 BasicBlock : InstructionList OptLocalAssign BBTerminatorInst {
2536 setValueName($3, $2);
2539 $1->getInstList().push_back($3);
2544 InstructionList : InstructionList Inst {
2545 if (CastInst *CI1 = dyn_cast<CastInst>($2))
2546 if (CastInst *CI2 = dyn_cast<CastInst>(CI1->getOperand(0)))
2547 if (CI2->getParent() == 0)
2548 $1->getInstList().push_back(CI2);
2549 $1->getInstList().push_back($2);
2553 | /* empty */ { // Empty space between instruction lists
2554 $$ = defineBBVal(ValID::createLocalID(CurFun.NextValNum));
2557 | LABELSTR { // Labelled (named) basic block
2558 $$ = defineBBVal(ValID::createLocalName(*$1));
2564 BBTerminatorInst : RET ResolvedVal { // Return with a result...
2565 $$ = new ReturnInst($2);
2568 | RET VOID { // Return with no result...
2569 $$ = new ReturnInst();
2572 | BR LABEL ValueRef { // Unconditional Branch...
2573 BasicBlock* tmpBB = getBBVal($3);
2575 $$ = new BranchInst(tmpBB);
2576 } // Conditional Branch...
2577 | BR INTTYPE ValueRef ',' LABEL ValueRef ',' LABEL ValueRef {
2578 assert(cast<IntegerType>($2)->getBitWidth() == 1 && "Not Bool?");
2579 BasicBlock* tmpBBA = getBBVal($6);
2581 BasicBlock* tmpBBB = getBBVal($9);
2583 Value* tmpVal = getVal(Type::Int1Ty, $3);
2585 $$ = new BranchInst(tmpBBA, tmpBBB, tmpVal);
2587 | SWITCH IntType ValueRef ',' LABEL ValueRef '[' JumpTable ']' {
2588 Value* tmpVal = getVal($2, $3);
2590 BasicBlock* tmpBB = getBBVal($6);
2592 SwitchInst *S = new SwitchInst(tmpVal, tmpBB, $8->size());
2595 std::vector<std::pair<Constant*,BasicBlock*> >::iterator I = $8->begin(),
2597 for (; I != E; ++I) {
2598 if (ConstantInt *CI = dyn_cast<ConstantInt>(I->first))
2599 S->addCase(CI, I->second);
2601 GEN_ERROR("Switch case is constant, but not a simple integer");
2606 | SWITCH IntType ValueRef ',' LABEL ValueRef '[' ']' {
2607 Value* tmpVal = getVal($2, $3);
2609 BasicBlock* tmpBB = getBBVal($6);
2611 SwitchInst *S = new SwitchInst(tmpVal, tmpBB, 0);
2615 | INVOKE OptCallingConv ResultTypes ValueRef '(' ParamList ')' OptFuncAttrs
2616 TO LABEL ValueRef UNWIND LABEL ValueRef {
2618 // Handle the short syntax
2619 const PointerType *PFTy = 0;
2620 const FunctionType *Ty = 0;
2621 if (!(PFTy = dyn_cast<PointerType>($3->get())) ||
2622 !(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) {
2623 // Pull out the types of all of the arguments...
2624 std::vector<const Type*> ParamTypes;
2625 ParamAttrsVector Attrs;
2626 if ($8 != ParamAttr::None) {
2627 ParamAttrsWithIndex PAWI; PAWI.index = 0; PAWI.attrs = $8;
2628 Attrs.push_back(PAWI);
2630 ParamList::iterator I = $6->begin(), E = $6->end();
2632 for (; I != E; ++I, ++index) {
2633 const Type *Ty = I->Val->getType();
2634 if (Ty == Type::VoidTy)
2635 GEN_ERROR("Short call syntax cannot be used with varargs");
2636 ParamTypes.push_back(Ty);
2637 if (I->Attrs != ParamAttr::None) {
2638 ParamAttrsWithIndex PAWI; PAWI.index = index; PAWI.attrs = I->Attrs;
2639 Attrs.push_back(PAWI);
2643 ParamAttrsList *PAL = 0;
2645 PAL = ParamAttrsList::get(Attrs);
2646 Ty = FunctionType::get($3->get(), ParamTypes, false, PAL);
2647 PFTy = PointerType::get(Ty);
2652 Value *V = getVal(PFTy, $4); // Get the function we're calling...
2654 BasicBlock *Normal = getBBVal($11);
2656 BasicBlock *Except = getBBVal($14);
2659 // Check the arguments
2661 if ($6->empty()) { // Has no arguments?
2662 // Make sure no arguments is a good thing!
2663 if (Ty->getNumParams() != 0)
2664 GEN_ERROR("No arguments passed to a function that "
2665 "expects arguments");
2666 } else { // Has arguments?
2667 // Loop through FunctionType's arguments and ensure they are specified
2669 FunctionType::param_iterator I = Ty->param_begin();
2670 FunctionType::param_iterator E = Ty->param_end();
2671 ParamList::iterator ArgI = $6->begin(), ArgE = $6->end();
2673 for (; ArgI != ArgE && I != E; ++ArgI, ++I) {
2674 if (ArgI->Val->getType() != *I)
2675 GEN_ERROR("Parameter " + ArgI->Val->getName()+ " is not of type '" +
2676 (*I)->getDescription() + "'");
2677 Args.push_back(ArgI->Val);
2680 if (Ty->isVarArg()) {
2682 for (; ArgI != ArgE; ++ArgI)
2683 Args.push_back(ArgI->Val); // push the remaining varargs
2684 } else if (I != E || ArgI != ArgE)
2685 GEN_ERROR("Invalid number of parameters detected");
2688 // Create the InvokeInst
2689 InvokeInst *II = new InvokeInst(V, Normal, Except, Args.begin(), Args.end());
2690 II->setCallingConv($2);
2696 $$ = new UnwindInst();
2700 $$ = new UnreachableInst();
2706 JumpTable : JumpTable IntType ConstValueRef ',' LABEL ValueRef {
2708 Constant *V = cast<Constant>(getExistingVal($2, $3));
2711 GEN_ERROR("May only switch on a constant pool value");
2713 BasicBlock* tmpBB = getBBVal($6);
2715 $$->push_back(std::make_pair(V, tmpBB));
2717 | IntType ConstValueRef ',' LABEL ValueRef {
2718 $$ = new std::vector<std::pair<Constant*, BasicBlock*> >();
2719 Constant *V = cast<Constant>(getExistingVal($1, $2));
2723 GEN_ERROR("May only switch on a constant pool value");
2725 BasicBlock* tmpBB = getBBVal($5);
2727 $$->push_back(std::make_pair(V, tmpBB));
2730 Inst : OptLocalAssign InstVal {
2731 // Is this definition named?? if so, assign the name...
2732 setValueName($2, $1);
2740 PHIList : Types '[' ValueRef ',' ValueRef ']' { // Used for PHI nodes
2741 if (!UpRefs.empty())
2742 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
2743 $$ = new std::list<std::pair<Value*, BasicBlock*> >();
2744 Value* tmpVal = getVal(*$1, $3);
2746 BasicBlock* tmpBB = getBBVal($5);
2748 $$->push_back(std::make_pair(tmpVal, tmpBB));
2751 | PHIList ',' '[' ValueRef ',' ValueRef ']' {
2753 Value* tmpVal = getVal($1->front().first->getType(), $4);
2755 BasicBlock* tmpBB = getBBVal($6);
2757 $1->push_back(std::make_pair(tmpVal, tmpBB));
2761 ParamList : Types ValueRef OptParamAttrs {
2762 if (!UpRefs.empty())
2763 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
2764 // Used for call and invoke instructions
2765 $$ = new ParamList();
2766 ParamListEntry E; E.Attrs = $3; E.Val = getVal($1->get(), $2);
2770 | LABEL ValueRef OptParamAttrs {
2771 // Labels are only valid in ASMs
2772 $$ = new ParamList();
2773 ParamListEntry E; E.Attrs = $3; E.Val = getBBVal($2);
2776 | ParamList ',' Types ValueRef OptParamAttrs {
2777 if (!UpRefs.empty())
2778 GEN_ERROR("Invalid upreference in type: " + (*$3)->getDescription());
2780 ParamListEntry E; E.Attrs = $5; E.Val = getVal($3->get(), $4);
2785 | ParamList ',' LABEL ValueRef OptParamAttrs {
2787 ParamListEntry E; E.Attrs = $5; E.Val = getBBVal($4);
2791 | /*empty*/ { $$ = new ParamList(); };
2793 IndexList // Used for gep instructions and constant expressions
2794 : /*empty*/ { $$ = new std::vector<Value*>(); }
2795 | IndexList ',' ResolvedVal {
2802 OptTailCall : TAIL CALL {
2811 InstVal : ArithmeticOps Types ValueRef ',' ValueRef {
2812 if (!UpRefs.empty())
2813 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
2814 if (!(*$2)->isInteger() && !(*$2)->isFloatingPoint() &&
2815 !isa<VectorType>((*$2).get()))
2817 "Arithmetic operator requires integer, FP, or packed operands");
2818 Value* val1 = getVal(*$2, $3);
2820 Value* val2 = getVal(*$2, $5);
2822 $$ = BinaryOperator::create($1, val1, val2);
2824 GEN_ERROR("binary operator returned null");
2827 | LogicalOps Types ValueRef ',' ValueRef {
2828 if (!UpRefs.empty())
2829 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
2830 if (!(*$2)->isInteger()) {
2831 if (Instruction::isShift($1) || !isa<VectorType>($2->get()) ||
2832 !cast<VectorType>($2->get())->getElementType()->isInteger())
2833 GEN_ERROR("Logical operator requires integral operands");
2835 Value* tmpVal1 = getVal(*$2, $3);
2837 Value* tmpVal2 = getVal(*$2, $5);
2839 $$ = BinaryOperator::create($1, tmpVal1, tmpVal2);
2841 GEN_ERROR("binary operator returned null");
2844 | ICMP IPredicates Types ValueRef ',' ValueRef {
2845 if (!UpRefs.empty())
2846 GEN_ERROR("Invalid upreference in type: " + (*$3)->getDescription());
2847 if (isa<VectorType>((*$3).get()))
2848 GEN_ERROR("Vector types not supported by icmp instruction");
2849 Value* tmpVal1 = getVal(*$3, $4);
2851 Value* tmpVal2 = getVal(*$3, $6);
2853 $$ = CmpInst::create($1, $2, tmpVal1, tmpVal2);
2855 GEN_ERROR("icmp operator returned null");
2858 | FCMP FPredicates Types ValueRef ',' ValueRef {
2859 if (!UpRefs.empty())
2860 GEN_ERROR("Invalid upreference in type: " + (*$3)->getDescription());
2861 if (isa<VectorType>((*$3).get()))
2862 GEN_ERROR("Vector types not supported by fcmp instruction");
2863 Value* tmpVal1 = getVal(*$3, $4);
2865 Value* tmpVal2 = getVal(*$3, $6);
2867 $$ = CmpInst::create($1, $2, tmpVal1, tmpVal2);
2869 GEN_ERROR("fcmp operator returned null");
2872 | CastOps ResolvedVal TO Types {
2873 if (!UpRefs.empty())
2874 GEN_ERROR("Invalid upreference in type: " + (*$4)->getDescription());
2876 const Type* DestTy = $4->get();
2877 if (!CastInst::castIsValid($1, Val, DestTy))
2878 GEN_ERROR("invalid cast opcode for cast from '" +
2879 Val->getType()->getDescription() + "' to '" +
2880 DestTy->getDescription() + "'");
2881 $$ = CastInst::create($1, Val, DestTy);
2884 | SELECT ResolvedVal ',' ResolvedVal ',' ResolvedVal {
2885 if ($2->getType() != Type::Int1Ty)
2886 GEN_ERROR("select condition must be boolean");
2887 if ($4->getType() != $6->getType())
2888 GEN_ERROR("select value types should match");
2889 $$ = new SelectInst($2, $4, $6);
2892 | VAARG ResolvedVal ',' Types {
2893 if (!UpRefs.empty())
2894 GEN_ERROR("Invalid upreference in type: " + (*$4)->getDescription());
2895 $$ = new VAArgInst($2, *$4);
2899 | EXTRACTELEMENT ResolvedVal ',' ResolvedVal {
2900 if (!ExtractElementInst::isValidOperands($2, $4))
2901 GEN_ERROR("Invalid extractelement operands");
2902 $$ = new ExtractElementInst($2, $4);
2905 | INSERTELEMENT ResolvedVal ',' ResolvedVal ',' ResolvedVal {
2906 if (!InsertElementInst::isValidOperands($2, $4, $6))
2907 GEN_ERROR("Invalid insertelement operands");
2908 $$ = new InsertElementInst($2, $4, $6);
2911 | SHUFFLEVECTOR ResolvedVal ',' ResolvedVal ',' ResolvedVal {
2912 if (!ShuffleVectorInst::isValidOperands($2, $4, $6))
2913 GEN_ERROR("Invalid shufflevector operands");
2914 $$ = new ShuffleVectorInst($2, $4, $6);
2918 const Type *Ty = $2->front().first->getType();
2919 if (!Ty->isFirstClassType())
2920 GEN_ERROR("PHI node operands must be of first class type");
2921 $$ = new PHINode(Ty);
2922 ((PHINode*)$$)->reserveOperandSpace($2->size());
2923 while ($2->begin() != $2->end()) {
2924 if ($2->front().first->getType() != Ty)
2925 GEN_ERROR("All elements of a PHI node must be of the same type");
2926 cast<PHINode>($$)->addIncoming($2->front().first, $2->front().second);
2929 delete $2; // Free the list...
2932 | OptTailCall OptCallingConv ResultTypes ValueRef '(' ParamList ')'
2935 // Handle the short syntax
2936 const PointerType *PFTy = 0;
2937 const FunctionType *Ty = 0;
2938 if (!(PFTy = dyn_cast<PointerType>($3->get())) ||
2939 !(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) {
2940 // Pull out the types of all of the arguments...
2941 std::vector<const Type*> ParamTypes;
2942 ParamAttrsVector Attrs;
2943 if ($8 != ParamAttr::None) {
2944 ParamAttrsWithIndex PAWI; PAWI.index = 0; PAWI.attrs = $8;
2945 Attrs.push_back(PAWI);
2948 ParamList::iterator I = $6->begin(), E = $6->end();
2949 for (; I != E; ++I, ++index) {
2950 const Type *Ty = I->Val->getType();
2951 if (Ty == Type::VoidTy)
2952 GEN_ERROR("Short call syntax cannot be used with varargs");
2953 ParamTypes.push_back(Ty);
2954 if (I->Attrs != ParamAttr::None) {
2955 ParamAttrsWithIndex PAWI; PAWI.index = index; PAWI.attrs = I->Attrs;
2956 Attrs.push_back(PAWI);
2960 ParamAttrsList *PAL = 0;
2962 PAL = ParamAttrsList::get(Attrs);
2964 Ty = FunctionType::get($3->get(), ParamTypes, false, PAL);
2965 PFTy = PointerType::get(Ty);
2968 Value *V = getVal(PFTy, $4); // Get the function we're calling...
2971 // Check for call to invalid intrinsic to avoid crashing later.
2972 if (Function *theF = dyn_cast<Function>(V)) {
2973 if (theF->hasName() && (theF->getValueName()->getKeyLength() >= 5) &&
2974 (0 == strncmp(theF->getValueName()->getKeyData(), "llvm.", 5)) &&
2975 !theF->getIntrinsicID(true))
2976 GEN_ERROR("Call to invalid LLVM intrinsic function '" +
2977 theF->getName() + "'");
2980 // Check the arguments
2982 if ($6->empty()) { // Has no arguments?
2983 // Make sure no arguments is a good thing!
2984 if (Ty->getNumParams() != 0)
2985 GEN_ERROR("No arguments passed to a function that "
2986 "expects arguments");
2987 } else { // Has arguments?
2988 // Loop through FunctionType's arguments and ensure they are specified
2991 FunctionType::param_iterator I = Ty->param_begin();
2992 FunctionType::param_iterator E = Ty->param_end();
2993 ParamList::iterator ArgI = $6->begin(), ArgE = $6->end();
2995 for (; ArgI != ArgE && I != E; ++ArgI, ++I) {
2996 if (ArgI->Val->getType() != *I)
2997 GEN_ERROR("Parameter " + ArgI->Val->getName()+ " is not of type '" +
2998 (*I)->getDescription() + "'");
2999 Args.push_back(ArgI->Val);
3001 if (Ty->isVarArg()) {
3003 for (; ArgI != ArgE; ++ArgI)
3004 Args.push_back(ArgI->Val); // push the remaining varargs
3005 } else if (I != E || ArgI != ArgE)
3006 GEN_ERROR("Invalid number of parameters detected");
3008 // Create the call node
3009 CallInst *CI = new CallInst(V, Args.begin(), Args.end());
3010 CI->setTailCall($1);
3011 CI->setCallingConv($2);
3022 OptVolatile : VOLATILE {
3033 MemoryInst : MALLOC Types OptCAlign {
3034 if (!UpRefs.empty())
3035 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
3036 $$ = new MallocInst(*$2, 0, $3);
3040 | MALLOC Types ',' INTTYPE ValueRef OptCAlign {
3041 if (!UpRefs.empty())
3042 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
3043 Value* tmpVal = getVal($4, $5);
3045 $$ = new MallocInst(*$2, tmpVal, $6);
3048 | ALLOCA Types OptCAlign {
3049 if (!UpRefs.empty())
3050 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
3051 $$ = new AllocaInst(*$2, 0, $3);
3055 | ALLOCA Types ',' INTTYPE ValueRef OptCAlign {
3056 if (!UpRefs.empty())
3057 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
3058 Value* tmpVal = getVal($4, $5);
3060 $$ = new AllocaInst(*$2, tmpVal, $6);
3063 | FREE ResolvedVal {
3064 if (!isa<PointerType>($2->getType()))
3065 GEN_ERROR("Trying to free nonpointer type " +
3066 $2->getType()->getDescription() + "");
3067 $$ = new FreeInst($2);
3071 | OptVolatile LOAD Types ValueRef OptCAlign {
3072 if (!UpRefs.empty())
3073 GEN_ERROR("Invalid upreference in type: " + (*$3)->getDescription());
3074 if (!isa<PointerType>($3->get()))
3075 GEN_ERROR("Can't load from nonpointer type: " +
3076 (*$3)->getDescription());
3077 if (!cast<PointerType>($3->get())->getElementType()->isFirstClassType())
3078 GEN_ERROR("Can't load from pointer of non-first-class type: " +
3079 (*$3)->getDescription());
3080 Value* tmpVal = getVal(*$3, $4);
3082 $$ = new LoadInst(tmpVal, "", $1, $5);
3085 | OptVolatile STORE ResolvedVal ',' Types ValueRef OptCAlign {
3086 if (!UpRefs.empty())
3087 GEN_ERROR("Invalid upreference in type: " + (*$5)->getDescription());
3088 const PointerType *PT = dyn_cast<PointerType>($5->get());
3090 GEN_ERROR("Can't store to a nonpointer type: " +
3091 (*$5)->getDescription());
3092 const Type *ElTy = PT->getElementType();
3093 if (ElTy != $3->getType())
3094 GEN_ERROR("Can't store '" + $3->getType()->getDescription() +
3095 "' into space of type '" + ElTy->getDescription() + "'");
3097 Value* tmpVal = getVal(*$5, $6);
3099 $$ = new StoreInst($3, tmpVal, $1, $7);
3102 | GETELEMENTPTR Types ValueRef IndexList {
3103 if (!UpRefs.empty())
3104 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
3105 if (!isa<PointerType>($2->get()))
3106 GEN_ERROR("getelementptr insn requires pointer operand");
3108 if (!GetElementPtrInst::getIndexedType(*$2, $4->begin(), $4->end(), true))
3109 GEN_ERROR("Invalid getelementptr indices for type '" +
3110 (*$2)->getDescription()+ "'");
3111 Value* tmpVal = getVal(*$2, $3);
3113 $$ = new GetElementPtrInst(tmpVal, $4->begin(), $4->end());
3121 // common code from the two 'RunVMAsmParser' functions
3122 static Module* RunParser(Module * M) {
3124 llvmAsmlineno = 1; // Reset the current line number...
3125 CurModule.CurrentModule = M;
3130 // Check to make sure the parser succeeded
3133 delete ParserResult;
3137 // Emit an error if there are any unresolved types left.
3138 if (!CurModule.LateResolveTypes.empty()) {
3139 const ValID &DID = CurModule.LateResolveTypes.begin()->first;
3140 if (DID.Type == ValID::LocalName) {
3141 GenerateError("Undefined type remains at eof: '"+DID.getName() + "'");
3143 GenerateError("Undefined type remains at eof: #" + itostr(DID.Num));
3146 delete ParserResult;
3150 // Emit an error if there are any unresolved values left.
3151 if (!CurModule.LateResolveValues.empty()) {
3152 Value *V = CurModule.LateResolveValues.back();
3153 std::map<Value*, std::pair<ValID, int> >::iterator I =
3154 CurModule.PlaceHolderInfo.find(V);
3156 if (I != CurModule.PlaceHolderInfo.end()) {
3157 ValID &DID = I->second.first;
3158 if (DID.Type == ValID::LocalName) {
3159 GenerateError("Undefined value remains at eof: "+DID.getName() + "'");
3161 GenerateError("Undefined value remains at eof: #" + itostr(DID.Num));
3164 delete ParserResult;
3169 // Check to make sure that parsing produced a result
3173 // Reset ParserResult variable while saving its value for the result.
3174 Module *Result = ParserResult;
3180 void llvm::GenerateError(const std::string &message, int LineNo) {
3181 if (LineNo == -1) LineNo = llvmAsmlineno;
3182 // TODO: column number in exception
3184 TheParseError->setError(CurFilename, message, LineNo);
3188 int yyerror(const char *ErrorMsg) {
3190 = std::string((CurFilename == "-") ? std::string("<stdin>") : CurFilename)
3191 + ":" + utostr((unsigned) llvmAsmlineno) + ": ";
3192 std::string errMsg = where + "error: " + std::string(ErrorMsg);
3193 if (yychar != YYEMPTY && yychar != 0)
3194 errMsg += " while reading token: '" + std::string(llvmAsmtext, llvmAsmleng)+
3196 GenerateError(errMsg);