1 //===-- llvmAsmParser.y - Parser for llvm assembly files --------*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // 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"
33 // The following is a gross hack. In order to rid the libAsmParser library of
34 // exceptions, we have to have a way of getting the yyparse function to go into
35 // an error situation. So, whenever we want an error to occur, the GenerateError
36 // function (see bottom of file) sets TriggerError. Then, at the end of each
37 // production in the grammer we use CHECK_FOR_ERROR which will invoke YYERROR
38 // (a goto) to put YACC in error state. Furthermore, several calls to
39 // GenerateError are made from inside productions and they must simulate the
40 // previous exception behavior by exiting the production immediately. We have
41 // replaced these with the GEN_ERROR macro which calls GeneratError and then
42 // immediately invokes YYERROR. This would be so much cleaner if it was a
43 // recursive descent parser.
44 static bool TriggerError = false;
45 #define CHECK_FOR_ERROR { if (TriggerError) { TriggerError = false; YYABORT; } }
46 #define GEN_ERROR(msg) { GenerateError(msg); YYERROR; }
48 int yyerror(const char *ErrorMsg); // Forward declarations to prevent "implicit
49 int yylex(); // declaration" of xxx warnings.
53 static Module *ParserResult;
55 // DEBUG_UPREFS - Define this symbol if you want to enable debugging output
56 // relating to upreferences in the input stream.
58 //#define DEBUG_UPREFS 1
60 #define UR_OUT(X) cerr << X
65 #define YYERROR_VERBOSE 1
67 static GlobalVariable *CurGV;
70 // This contains info used when building the body of a function. It is
71 // destroyed when the function is completed.
73 typedef std::vector<Value *> ValueList; // Numbered defs
76 ResolveDefinitions(ValueList &LateResolvers, ValueList *FutureLateResolvers=0);
78 static struct PerModuleInfo {
79 Module *CurrentModule;
80 ValueList Values; // Module level numbered definitions
81 ValueList LateResolveValues;
82 std::vector<PATypeHolder> Types;
83 std::map<ValID, PATypeHolder> LateResolveTypes;
85 /// PlaceHolderInfo - When temporary placeholder objects are created, remember
86 /// how they were referenced and on which line of the input they came from so
87 /// that we can resolve them later and print error messages as appropriate.
88 std::map<Value*, std::pair<ValID, int> > PlaceHolderInfo;
90 // GlobalRefs - This maintains a mapping between <Type, ValID>'s and forward
91 // references to global values. Global values may be referenced before they
92 // are defined, and if so, the temporary object that they represent is held
93 // here. This is used for forward references of GlobalValues.
95 typedef std::map<std::pair<const PointerType *,
96 ValID>, GlobalValue*> GlobalRefsType;
97 GlobalRefsType GlobalRefs;
100 // If we could not resolve some functions at function compilation time
101 // (calls to functions before they are defined), resolve them now... Types
102 // are resolved when the constant pool has been completely parsed.
104 ResolveDefinitions(LateResolveValues);
108 // Check to make sure that all global value forward references have been
111 if (!GlobalRefs.empty()) {
112 std::string UndefinedReferences = "Unresolved global references exist:\n";
114 for (GlobalRefsType::iterator I = GlobalRefs.begin(), E =GlobalRefs.end();
116 UndefinedReferences += " " + I->first.first->getDescription() + " " +
117 I->first.second.getName() + "\n";
119 GenerateError(UndefinedReferences);
123 // Look for intrinsic functions and CallInst that need to be upgraded
124 for (Module::iterator FI = CurrentModule->begin(),
125 FE = CurrentModule->end(); FI != FE; )
126 UpgradeCallsToIntrinsic(FI++); // must be post-increment, as we remove
128 Values.clear(); // Clear out function local definitions
133 // GetForwardRefForGlobal - Check to see if there is a forward reference
134 // for this global. If so, remove it from the GlobalRefs map and return it.
135 // If not, just return null.
136 GlobalValue *GetForwardRefForGlobal(const PointerType *PTy, ValID ID) {
137 // Check to see if there is a forward reference to this global variable...
138 // if there is, eliminate it and patch the reference to use the new def'n.
139 GlobalRefsType::iterator I = GlobalRefs.find(std::make_pair(PTy, ID));
140 GlobalValue *Ret = 0;
141 if (I != GlobalRefs.end()) {
148 bool TypeIsUnresolved(PATypeHolder* PATy) {
149 // If it isn't abstract, its resolved
150 const Type* Ty = PATy->get();
151 if (!Ty->isAbstract())
153 // Traverse the type looking for abstract types. If it isn't abstract then
154 // we don't need to traverse that leg of the type.
155 std::vector<const Type*> WorkList, SeenList;
156 WorkList.push_back(Ty);
157 while (!WorkList.empty()) {
158 const Type* Ty = WorkList.back();
159 SeenList.push_back(Ty);
161 if (const OpaqueType* OpTy = dyn_cast<OpaqueType>(Ty)) {
162 // Check to see if this is an unresolved type
163 std::map<ValID, PATypeHolder>::iterator I = LateResolveTypes.begin();
164 std::map<ValID, PATypeHolder>::iterator E = LateResolveTypes.end();
165 for ( ; I != E; ++I) {
166 if (I->second.get() == OpTy)
169 } else if (const SequentialType* SeqTy = dyn_cast<SequentialType>(Ty)) {
170 const Type* TheTy = SeqTy->getElementType();
171 if (TheTy->isAbstract() && TheTy != Ty) {
172 std::vector<const Type*>::iterator I = SeenList.begin(),
178 WorkList.push_back(TheTy);
180 } else if (const StructType* StrTy = dyn_cast<StructType>(Ty)) {
181 for (unsigned i = 0; i < StrTy->getNumElements(); ++i) {
182 const Type* TheTy = StrTy->getElementType(i);
183 if (TheTy->isAbstract() && TheTy != Ty) {
184 std::vector<const Type*>::iterator I = SeenList.begin(),
190 WorkList.push_back(TheTy);
199 static struct PerFunctionInfo {
200 Function *CurrentFunction; // Pointer to current function being created
202 ValueList Values; // Keep track of #'d definitions
204 ValueList LateResolveValues;
205 bool isDeclare; // Is this function a forward declararation?
206 GlobalValue::LinkageTypes Linkage; // Linkage for forward declaration.
207 GlobalValue::VisibilityTypes Visibility;
209 /// BBForwardRefs - When we see forward references to basic blocks, keep
210 /// track of them here.
211 std::map<ValID, BasicBlock*> BBForwardRefs;
213 inline PerFunctionInfo() {
216 Linkage = GlobalValue::ExternalLinkage;
217 Visibility = GlobalValue::DefaultVisibility;
220 inline void FunctionStart(Function *M) {
225 void FunctionDone() {
226 // Any forward referenced blocks left?
227 if (!BBForwardRefs.empty()) {
228 GenerateError("Undefined reference to label " +
229 BBForwardRefs.begin()->second->getName());
233 // Resolve all forward references now.
234 ResolveDefinitions(LateResolveValues, &CurModule.LateResolveValues);
236 Values.clear(); // Clear out function local definitions
237 BBForwardRefs.clear();
240 Linkage = GlobalValue::ExternalLinkage;
241 Visibility = GlobalValue::DefaultVisibility;
243 } CurFun; // Info for the current function...
245 static bool inFunctionScope() { return CurFun.CurrentFunction != 0; }
248 //===----------------------------------------------------------------------===//
249 // Code to handle definitions of all the types
250 //===----------------------------------------------------------------------===//
252 /// InsertValue - Insert a value into the value table. If it is named, this
253 /// returns -1, otherwise it returns the slot number for the value.
254 static int InsertValue(Value *V, ValueList &ValueTab = CurFun.Values) {
255 // Things that have names or are void typed don't get slot numbers
256 if (V->hasName() || (V->getType() == Type::VoidTy))
259 // In the case of function values, we have to allow for the forward reference
260 // of basic blocks, which are included in the numbering. Consequently, we keep
261 // track of the next insertion location with NextValNum. When a BB gets
262 // inserted, it could change the size of the CurFun.Values vector.
263 if (&ValueTab == &CurFun.Values) {
264 if (ValueTab.size() <= CurFun.NextValNum)
265 ValueTab.resize(CurFun.NextValNum+1);
266 ValueTab[CurFun.NextValNum++] = V;
267 return CurFun.NextValNum-1;
269 // For all other lists, its okay to just tack it on the back of the vector.
270 ValueTab.push_back(V);
271 return ValueTab.size()-1;
274 static const Type *getTypeVal(const ValID &D, bool DoNotImprovise = false) {
276 case ValID::LocalID: // Is it a numbered definition?
277 // Module constants occupy the lowest numbered slots...
278 if (D.Num < CurModule.Types.size())
279 return CurModule.Types[D.Num];
281 case ValID::LocalName: // Is it a named definition?
282 if (const Type *N = CurModule.CurrentModule->getTypeByName(D.getName())) {
283 D.destroy(); // Free old strdup'd memory...
288 GenerateError("Internal parser error: Invalid symbol type reference");
292 // If we reached here, we referenced either a symbol that we don't know about
293 // or an id number that hasn't been read yet. We may be referencing something
294 // forward, so just create an entry to be resolved later and get to it...
296 if (DoNotImprovise) return 0; // Do we just want a null to be returned?
299 if (inFunctionScope()) {
300 if (D.Type == ValID::LocalName) {
301 GenerateError("Reference to an undefined type: '" + D.getName() + "'");
304 GenerateError("Reference to an undefined type: #" + utostr(D.Num));
309 std::map<ValID, PATypeHolder>::iterator I =CurModule.LateResolveTypes.find(D);
310 if (I != CurModule.LateResolveTypes.end())
313 Type *Typ = OpaqueType::get();
314 CurModule.LateResolveTypes.insert(std::make_pair(D, Typ));
318 // getExistingVal - Look up the value specified by the provided type and
319 // the provided ValID. If the value exists and has already been defined, return
320 // it. Otherwise return null.
322 static Value *getExistingVal(const Type *Ty, const ValID &D) {
323 if (isa<FunctionType>(Ty)) {
324 GenerateError("Functions are not values and "
325 "must be referenced as pointers");
330 case ValID::LocalID: { // Is it a numbered definition?
331 // Check that the number is within bounds.
332 if (D.Num >= CurFun.Values.size())
334 Value *Result = CurFun.Values[D.Num];
335 if (Ty != Result->getType()) {
336 GenerateError("Numbered value (%" + utostr(D.Num) + ") of type '" +
337 Result->getType()->getDescription() + "' does not match "
338 "expected type, '" + Ty->getDescription() + "'");
343 case ValID::GlobalID: { // Is it a numbered definition?
344 if (D.Num >= CurModule.Values.size())
346 Value *Result = CurModule.Values[D.Num];
347 if (Ty != Result->getType()) {
348 GenerateError("Numbered value (@" + utostr(D.Num) + ") of type '" +
349 Result->getType()->getDescription() + "' does not match "
350 "expected type, '" + Ty->getDescription() + "'");
356 case ValID::LocalName: { // Is it a named definition?
357 if (!inFunctionScope())
359 ValueSymbolTable &SymTab = CurFun.CurrentFunction->getValueSymbolTable();
360 Value *N = SymTab.lookup(D.getName());
363 if (N->getType() != Ty)
366 D.destroy(); // Free old strdup'd memory...
369 case ValID::GlobalName: { // Is it a named definition?
370 ValueSymbolTable &SymTab = CurModule.CurrentModule->getValueSymbolTable();
371 Value *N = SymTab.lookup(D.getName());
374 if (N->getType() != Ty)
377 D.destroy(); // Free old strdup'd memory...
381 // Check to make sure that "Ty" is an integral type, and that our
382 // value will fit into the specified type...
383 case ValID::ConstSIntVal: // Is it a constant pool reference??
384 if (!isa<IntegerType>(Ty) ||
385 !ConstantInt::isValueValidForType(Ty, D.ConstPool64)) {
386 GenerateError("Signed integral constant '" +
387 itostr(D.ConstPool64) + "' is invalid for type '" +
388 Ty->getDescription() + "'");
391 return ConstantInt::get(Ty, D.ConstPool64, true);
393 case ValID::ConstUIntVal: // Is it an unsigned const pool reference?
394 if (isa<IntegerType>(Ty) &&
395 ConstantInt::isValueValidForType(Ty, D.UConstPool64))
396 return ConstantInt::get(Ty, D.UConstPool64);
398 if (!isa<IntegerType>(Ty) ||
399 !ConstantInt::isValueValidForType(Ty, D.ConstPool64)) {
400 GenerateError("Integral constant '" + utostr(D.UConstPool64) +
401 "' is invalid or out of range for type '" +
402 Ty->getDescription() + "'");
405 // This is really a signed reference. Transmogrify.
406 return ConstantInt::get(Ty, D.ConstPool64, true);
408 case ValID::ConstAPInt: // Is it an unsigned const pool reference?
409 if (!isa<IntegerType>(Ty)) {
410 GenerateError("Integral constant '" + D.getName() +
411 "' is invalid or out of range for type '" +
412 Ty->getDescription() + "'");
417 APSInt Tmp = *D.ConstPoolInt;
418 Tmp.extOrTrunc(Ty->getPrimitiveSizeInBits());
419 return ConstantInt::get(Tmp);
422 case ValID::ConstFPVal: // Is it a floating point const pool reference?
423 if (!Ty->isFloatingPoint() ||
424 !ConstantFP::isValueValidForType(Ty, *D.ConstPoolFP)) {
425 GenerateError("FP constant invalid for type");
428 // Lexer has no type info, so builds all float and double FP constants
429 // as double. Fix this here. Long double does not need this.
430 if (&D.ConstPoolFP->getSemantics() == &APFloat::IEEEdouble &&
432 D.ConstPoolFP->convert(APFloat::IEEEsingle, APFloat::rmNearestTiesToEven);
433 return ConstantFP::get(*D.ConstPoolFP);
435 case ValID::ConstNullVal: // Is it a null value?
436 if (!isa<PointerType>(Ty)) {
437 GenerateError("Cannot create a a non pointer null");
440 return ConstantPointerNull::get(cast<PointerType>(Ty));
442 case ValID::ConstUndefVal: // Is it an undef value?
443 return UndefValue::get(Ty);
445 case ValID::ConstZeroVal: // Is it a zero value?
446 return Constant::getNullValue(Ty);
448 case ValID::ConstantVal: // Fully resolved constant?
449 if (D.ConstantValue->getType() != Ty) {
450 GenerateError("Constant expression type different from required type");
453 return D.ConstantValue;
455 case ValID::InlineAsmVal: { // Inline asm expression
456 const PointerType *PTy = dyn_cast<PointerType>(Ty);
457 const FunctionType *FTy =
458 PTy ? dyn_cast<FunctionType>(PTy->getElementType()) : 0;
459 if (!FTy || !InlineAsm::Verify(FTy, D.IAD->Constraints)) {
460 GenerateError("Invalid type for asm constraint string");
463 InlineAsm *IA = InlineAsm::get(FTy, D.IAD->AsmString, D.IAD->Constraints,
464 D.IAD->HasSideEffects);
465 D.destroy(); // Free InlineAsmDescriptor.
469 assert(0 && "Unhandled case!");
473 assert(0 && "Unhandled case!");
477 // getVal - This function is identical to getExistingVal, except that if a
478 // value is not already defined, it "improvises" by creating a placeholder var
479 // that looks and acts just like the requested variable. When the value is
480 // defined later, all uses of the placeholder variable are replaced with the
483 static Value *getVal(const Type *Ty, const ValID &ID) {
484 if (Ty == Type::LabelTy) {
485 GenerateError("Cannot use a basic block here");
489 // See if the value has already been defined.
490 Value *V = getExistingVal(Ty, ID);
492 if (TriggerError) return 0;
494 if (!Ty->isFirstClassType() && !isa<OpaqueType>(Ty)) {
495 GenerateError("Invalid use of a non-first-class type");
499 // If we reached here, we referenced either a symbol that we don't know about
500 // or an id number that hasn't been read yet. We may be referencing something
501 // forward, so just create an entry to be resolved later and get to it...
504 case ValID::GlobalName:
505 case ValID::GlobalID: {
506 const PointerType *PTy = dyn_cast<PointerType>(Ty);
508 GenerateError("Invalid type for reference to global" );
511 const Type* ElTy = PTy->getElementType();
512 if (const FunctionType *FTy = dyn_cast<FunctionType>(ElTy))
513 V = Function::Create(FTy, GlobalValue::ExternalLinkage);
515 V = new GlobalVariable(ElTy, false, GlobalValue::ExternalLinkage, 0, "",
516 (Module*)0, false, PTy->getAddressSpace());
520 V = new Argument(Ty);
523 // Remember where this forward reference came from. FIXME, shouldn't we try
524 // to recycle these things??
525 CurModule.PlaceHolderInfo.insert(std::make_pair(V, std::make_pair(ID,
528 if (inFunctionScope())
529 InsertValue(V, CurFun.LateResolveValues);
531 InsertValue(V, CurModule.LateResolveValues);
535 /// defineBBVal - This is a definition of a new basic block with the specified
536 /// identifier which must be the same as CurFun.NextValNum, if its numeric.
537 static BasicBlock *defineBBVal(const ValID &ID) {
538 assert(inFunctionScope() && "Can't get basic block at global scope!");
542 // First, see if this was forward referenced
544 std::map<ValID, BasicBlock*>::iterator BBI = CurFun.BBForwardRefs.find(ID);
545 if (BBI != CurFun.BBForwardRefs.end()) {
547 // The forward declaration could have been inserted anywhere in the
548 // function: insert it into the correct place now.
549 CurFun.CurrentFunction->getBasicBlockList().remove(BB);
550 CurFun.CurrentFunction->getBasicBlockList().push_back(BB);
552 // We're about to erase the entry, save the key so we can clean it up.
553 ValID Tmp = BBI->first;
555 // Erase the forward ref from the map as its no longer "forward"
556 CurFun.BBForwardRefs.erase(ID);
558 // The key has been removed from the map but so we don't want to leave
559 // strdup'd memory around so destroy it too.
562 // If its a numbered definition, bump the number and set the BB value.
563 if (ID.Type == ValID::LocalID) {
564 assert(ID.Num == CurFun.NextValNum && "Invalid new block number");
568 // We haven't seen this BB before and its first mention is a definition.
569 // Just create it and return it.
570 std::string Name (ID.Type == ValID::LocalName ? ID.getName() : "");
571 BB = BasicBlock::Create(Name, CurFun.CurrentFunction);
572 if (ID.Type == ValID::LocalID) {
573 assert(ID.Num == CurFun.NextValNum && "Invalid new block number");
582 /// getBBVal - get an existing BB value or create a forward reference for it.
584 static BasicBlock *getBBVal(const ValID &ID) {
585 assert(inFunctionScope() && "Can't get basic block at global scope!");
589 std::map<ValID, BasicBlock*>::iterator BBI = CurFun.BBForwardRefs.find(ID);
590 if (BBI != CurFun.BBForwardRefs.end()) {
592 } if (ID.Type == ValID::LocalName) {
593 std::string Name = ID.getName();
594 Value *N = CurFun.CurrentFunction->getValueSymbolTable().lookup(Name);
596 if (N->getType()->getTypeID() == Type::LabelTyID)
597 BB = cast<BasicBlock>(N);
599 GenerateError("Reference to label '" + Name + "' is actually of type '"+
600 N->getType()->getDescription() + "'");
602 } else if (ID.Type == ValID::LocalID) {
603 if (ID.Num < CurFun.NextValNum && ID.Num < CurFun.Values.size()) {
604 if (CurFun.Values[ID.Num]->getType()->getTypeID() == Type::LabelTyID)
605 BB = cast<BasicBlock>(CurFun.Values[ID.Num]);
607 GenerateError("Reference to label '%" + utostr(ID.Num) +
608 "' is actually of type '"+
609 CurFun.Values[ID.Num]->getType()->getDescription() + "'");
612 GenerateError("Illegal label reference " + ID.getName());
616 // If its already been defined, return it now.
618 ID.destroy(); // Free strdup'd memory.
622 // Otherwise, this block has not been seen before, create it.
624 if (ID.Type == ValID::LocalName)
626 BB = BasicBlock::Create(Name, CurFun.CurrentFunction);
628 // Insert it in the forward refs map.
629 CurFun.BBForwardRefs[ID] = BB;
635 //===----------------------------------------------------------------------===//
636 // Code to handle forward references in instructions
637 //===----------------------------------------------------------------------===//
639 // This code handles the late binding needed with statements that reference
640 // values not defined yet... for example, a forward branch, or the PHI node for
643 // This keeps a table (CurFun.LateResolveValues) of all such forward references
644 // and back patchs after we are done.
647 // ResolveDefinitions - If we could not resolve some defs at parsing
648 // time (forward branches, phi functions for loops, etc...) resolve the
652 ResolveDefinitions(ValueList &LateResolvers, ValueList *FutureLateResolvers) {
653 // Loop over LateResolveDefs fixing up stuff that couldn't be resolved
654 while (!LateResolvers.empty()) {
655 Value *V = LateResolvers.back();
656 LateResolvers.pop_back();
658 std::map<Value*, std::pair<ValID, int> >::iterator PHI =
659 CurModule.PlaceHolderInfo.find(V);
660 assert(PHI != CurModule.PlaceHolderInfo.end() && "Placeholder error!");
662 ValID &DID = PHI->second.first;
664 Value *TheRealValue = getExistingVal(V->getType(), DID);
668 V->replaceAllUsesWith(TheRealValue);
670 CurModule.PlaceHolderInfo.erase(PHI);
671 } else if (FutureLateResolvers) {
672 // Functions have their unresolved items forwarded to the module late
674 InsertValue(V, *FutureLateResolvers);
676 if (DID.Type == ValID::LocalName || DID.Type == ValID::GlobalName) {
677 GenerateError("Reference to an invalid definition: '" +DID.getName()+
678 "' of type '" + V->getType()->getDescription() + "'",
682 GenerateError("Reference to an invalid definition: #" +
683 itostr(DID.Num) + " of type '" +
684 V->getType()->getDescription() + "'",
690 LateResolvers.clear();
693 // ResolveTypeTo - A brand new type was just declared. This means that (if
694 // name is not null) things referencing Name can be resolved. Otherwise, things
695 // refering to the number can be resolved. Do this now.
697 static void ResolveTypeTo(std::string *Name, const Type *ToTy) {
700 D = ValID::createLocalName(*Name);
702 D = ValID::createLocalID(CurModule.Types.size());
704 std::map<ValID, PATypeHolder>::iterator I =
705 CurModule.LateResolveTypes.find(D);
706 if (I != CurModule.LateResolveTypes.end()) {
707 ((DerivedType*)I->second.get())->refineAbstractTypeTo(ToTy);
708 CurModule.LateResolveTypes.erase(I);
712 // setValueName - Set the specified value to the name given. The name may be
713 // null potentially, in which case this is a noop. The string passed in is
714 // assumed to be a malloc'd string buffer, and is free'd by this function.
716 static void setValueName(Value *V, std::string *NameStr) {
717 if (!NameStr) return;
718 std::string Name(*NameStr); // Copy string
719 delete NameStr; // Free old string
721 if (V->getType() == Type::VoidTy) {
722 GenerateError("Can't assign name '" + Name+"' to value with void type");
726 assert(inFunctionScope() && "Must be in function scope!");
727 ValueSymbolTable &ST = CurFun.CurrentFunction->getValueSymbolTable();
728 if (ST.lookup(Name)) {
729 GenerateError("Redefinition of value '" + Name + "' of type '" +
730 V->getType()->getDescription() + "'");
738 /// ParseGlobalVariable - Handle parsing of a global. If Initializer is null,
739 /// this is a declaration, otherwise it is a definition.
740 static GlobalVariable *
741 ParseGlobalVariable(std::string *NameStr,
742 GlobalValue::LinkageTypes Linkage,
743 GlobalValue::VisibilityTypes Visibility,
744 bool isConstantGlobal, const Type *Ty,
745 Constant *Initializer, bool IsThreadLocal,
746 unsigned AddressSpace = 0) {
747 if (isa<FunctionType>(Ty)) {
748 GenerateError("Cannot declare global vars of function type");
751 if (Ty == Type::LabelTy) {
752 GenerateError("Cannot declare global vars of label type");
756 const PointerType *PTy = PointerType::get(Ty, AddressSpace);
760 Name = *NameStr; // Copy string
761 delete NameStr; // Free old string
764 // See if this global value was forward referenced. If so, recycle the
768 ID = ValID::createGlobalName(Name);
770 ID = ValID::createGlobalID(CurModule.Values.size());
773 if (GlobalValue *FWGV = CurModule.GetForwardRefForGlobal(PTy, ID)) {
774 // Move the global to the end of the list, from whereever it was
775 // previously inserted.
776 GlobalVariable *GV = cast<GlobalVariable>(FWGV);
777 CurModule.CurrentModule->getGlobalList().remove(GV);
778 CurModule.CurrentModule->getGlobalList().push_back(GV);
779 GV->setInitializer(Initializer);
780 GV->setLinkage(Linkage);
781 GV->setVisibility(Visibility);
782 GV->setConstant(isConstantGlobal);
783 GV->setThreadLocal(IsThreadLocal);
784 InsertValue(GV, CurModule.Values);
788 // If this global has a name
790 // if the global we're parsing has an initializer (is a definition) and
791 // has external linkage.
792 if (Initializer && Linkage != GlobalValue::InternalLinkage)
793 // If there is already a global with external linkage with this name
794 if (CurModule.CurrentModule->getGlobalVariable(Name, false)) {
795 // If we allow this GVar to get created, it will be renamed in the
796 // symbol table because it conflicts with an existing GVar. We can't
797 // allow redefinition of GVars whose linking indicates that their name
798 // must stay the same. Issue the error.
799 GenerateError("Redefinition of global variable named '" + Name +
800 "' of type '" + Ty->getDescription() + "'");
805 // Otherwise there is no existing GV to use, create one now.
807 new GlobalVariable(Ty, isConstantGlobal, Linkage, Initializer, Name,
808 CurModule.CurrentModule, IsThreadLocal, AddressSpace);
809 GV->setVisibility(Visibility);
810 InsertValue(GV, CurModule.Values);
814 // setTypeName - Set the specified type to the name given. The name may be
815 // null potentially, in which case this is a noop. The string passed in is
816 // assumed to be a malloc'd string buffer, and is freed by this function.
818 // This function returns true if the type has already been defined, but is
819 // allowed to be redefined in the specified context. If the name is a new name
820 // for the type plane, it is inserted and false is returned.
821 static bool setTypeName(const Type *T, std::string *NameStr) {
822 assert(!inFunctionScope() && "Can't give types function-local names!");
823 if (NameStr == 0) return false;
825 std::string Name(*NameStr); // Copy string
826 delete NameStr; // Free old string
828 // We don't allow assigning names to void type
829 if (T == Type::VoidTy) {
830 GenerateError("Can't assign name '" + Name + "' to the void type");
834 // Set the type name, checking for conflicts as we do so.
835 bool AlreadyExists = CurModule.CurrentModule->addTypeName(Name, T);
837 if (AlreadyExists) { // Inserting a name that is already defined???
838 const Type *Existing = CurModule.CurrentModule->getTypeByName(Name);
839 assert(Existing && "Conflict but no matching type?!");
841 // There is only one case where this is allowed: when we are refining an
842 // opaque type. In this case, Existing will be an opaque type.
843 if (const OpaqueType *OpTy = dyn_cast<OpaqueType>(Existing)) {
844 // We ARE replacing an opaque type!
845 const_cast<OpaqueType*>(OpTy)->refineAbstractTypeTo(T);
849 // Otherwise, this is an attempt to redefine a type. That's okay if
850 // the redefinition is identical to the original. This will be so if
851 // Existing and T point to the same Type object. In this one case we
852 // allow the equivalent redefinition.
853 if (Existing == T) return true; // Yes, it's equal.
855 // Any other kind of (non-equivalent) redefinition is an error.
856 GenerateError("Redefinition of type named '" + Name + "' of type '" +
857 T->getDescription() + "'");
863 //===----------------------------------------------------------------------===//
864 // Code for handling upreferences in type names...
867 // TypeContains - Returns true if Ty directly contains E in it.
869 static bool TypeContains(const Type *Ty, const Type *E) {
870 return std::find(Ty->subtype_begin(), Ty->subtype_end(),
871 E) != Ty->subtype_end();
876 // NestingLevel - The number of nesting levels that need to be popped before
877 // this type is resolved.
878 unsigned NestingLevel;
880 // LastContainedTy - This is the type at the current binding level for the
881 // type. Every time we reduce the nesting level, this gets updated.
882 const Type *LastContainedTy;
884 // UpRefTy - This is the actual opaque type that the upreference is
888 UpRefRecord(unsigned NL, OpaqueType *URTy)
889 : NestingLevel(NL), LastContainedTy(URTy), UpRefTy(URTy) {}
893 // UpRefs - A list of the outstanding upreferences that need to be resolved.
894 static std::vector<UpRefRecord> UpRefs;
896 /// HandleUpRefs - Every time we finish a new layer of types, this function is
897 /// called. It loops through the UpRefs vector, which is a list of the
898 /// currently active types. For each type, if the up reference is contained in
899 /// the newly completed type, we decrement the level count. When the level
900 /// count reaches zero, the upreferenced type is the type that is passed in:
901 /// thus we can complete the cycle.
903 static PATypeHolder HandleUpRefs(const Type *ty) {
904 // If Ty isn't abstract, or if there are no up-references in it, then there is
905 // nothing to resolve here.
906 if (!ty->isAbstract() || UpRefs.empty()) return ty;
909 UR_OUT("Type '" << Ty->getDescription() <<
910 "' newly formed. Resolving upreferences.\n" <<
911 UpRefs.size() << " upreferences active!\n");
913 // If we find any resolvable upreferences (i.e., those whose NestingLevel goes
914 // to zero), we resolve them all together before we resolve them to Ty. At
915 // the end of the loop, if there is anything to resolve to Ty, it will be in
917 OpaqueType *TypeToResolve = 0;
919 for (unsigned i = 0; i != UpRefs.size(); ++i) {
920 UR_OUT(" UR#" << i << " - TypeContains(" << Ty->getDescription() << ", "
921 << UpRefs[i].second->getDescription() << ") = "
922 << (TypeContains(Ty, UpRefs[i].second) ? "true" : "false") << "\n");
923 if (TypeContains(Ty, UpRefs[i].LastContainedTy)) {
924 // Decrement level of upreference
925 unsigned Level = --UpRefs[i].NestingLevel;
926 UpRefs[i].LastContainedTy = Ty;
927 UR_OUT(" Uplevel Ref Level = " << Level << "\n");
928 if (Level == 0) { // Upreference should be resolved!
929 if (!TypeToResolve) {
930 TypeToResolve = UpRefs[i].UpRefTy;
932 UR_OUT(" * Resolving upreference for "
933 << UpRefs[i].second->getDescription() << "\n";
934 std::string OldName = UpRefs[i].UpRefTy->getDescription());
935 UpRefs[i].UpRefTy->refineAbstractTypeTo(TypeToResolve);
936 UR_OUT(" * Type '" << OldName << "' refined upreference to: "
937 << (const void*)Ty << ", " << Ty->getDescription() << "\n");
939 UpRefs.erase(UpRefs.begin()+i); // Remove from upreference list...
940 --i; // Do not skip the next element...
946 UR_OUT(" * Resolving upreference for "
947 << UpRefs[i].second->getDescription() << "\n";
948 std::string OldName = TypeToResolve->getDescription());
949 TypeToResolve->refineAbstractTypeTo(Ty);
955 //===----------------------------------------------------------------------===//
956 // RunVMAsmParser - Define an interface to this parser
957 //===----------------------------------------------------------------------===//
959 static Module* RunParser(Module * M);
961 Module *llvm::RunVMAsmParser(llvm::MemoryBuffer *MB) {
963 Module *M = RunParser(new Module(LLLgetFilename()));
971 llvm::Module *ModuleVal;
972 llvm::Function *FunctionVal;
973 llvm::BasicBlock *BasicBlockVal;
974 llvm::TerminatorInst *TermInstVal;
975 llvm::Instruction *InstVal;
976 llvm::Constant *ConstVal;
978 const llvm::Type *PrimType;
979 std::list<llvm::PATypeHolder> *TypeList;
980 llvm::PATypeHolder *TypeVal;
981 llvm::Value *ValueVal;
982 std::vector<llvm::Value*> *ValueList;
983 std::vector<unsigned> *ConstantList;
984 llvm::ArgListType *ArgList;
985 llvm::TypeWithAttrs TypeWithAttrs;
986 llvm::TypeWithAttrsList *TypeWithAttrsList;
987 llvm::ParamList *ParamList;
989 // Represent the RHS of PHI node
990 std::list<std::pair<llvm::Value*,
991 llvm::BasicBlock*> > *PHIList;
992 std::vector<std::pair<llvm::Constant*, llvm::BasicBlock*> > *JumpTable;
993 std::vector<llvm::Constant*> *ConstVector;
995 llvm::GlobalValue::LinkageTypes Linkage;
996 llvm::GlobalValue::VisibilityTypes Visibility;
997 llvm::Attributes Attributes;
998 llvm::APInt *APIntVal;
1003 llvm::APFloat *FPVal;
1006 std::string *StrVal; // This memory must be deleted
1007 llvm::ValID ValIDVal;
1009 llvm::Instruction::BinaryOps BinaryOpVal;
1010 llvm::Instruction::TermOps TermOpVal;
1011 llvm::Instruction::MemoryOps MemOpVal;
1012 llvm::Instruction::CastOps CastOpVal;
1013 llvm::Instruction::OtherOps OtherOpVal;
1014 llvm::ICmpInst::Predicate IPredicate;
1015 llvm::FCmpInst::Predicate FPredicate;
1018 %type <ModuleVal> Module
1019 %type <FunctionVal> Function FunctionProto FunctionHeader BasicBlockList
1020 %type <BasicBlockVal> BasicBlock InstructionList
1021 %type <TermInstVal> BBTerminatorInst
1022 %type <InstVal> Inst InstVal MemoryInst
1023 %type <ConstVal> ConstVal ConstExpr AliaseeRef
1024 %type <ConstVector> ConstVector
1025 %type <ArgList> ArgList ArgListH
1026 %type <PHIList> PHIList
1027 %type <ParamList> ParamList // For call param lists & GEP indices
1028 %type <ValueList> IndexList // For GEP indices
1029 %type <ConstantList> ConstantIndexList // For insertvalue/extractvalue indices
1030 %type <TypeList> TypeListI
1031 %type <TypeWithAttrsList> ArgTypeList ArgTypeListI
1032 %type <TypeWithAttrs> ArgType
1033 %type <JumpTable> JumpTable
1034 %type <BoolVal> GlobalType // GLOBAL or CONSTANT?
1035 %type <BoolVal> ThreadLocal // 'thread_local' or not
1036 %type <BoolVal> OptVolatile // 'volatile' or not
1037 %type <BoolVal> OptTailCall // TAIL CALL or plain CALL.
1038 %type <BoolVal> OptSideEffect // 'sideeffect' or not.
1039 %type <Linkage> GVInternalLinkage GVExternalLinkage
1040 %type <Linkage> FunctionDefineLinkage FunctionDeclareLinkage
1041 %type <Linkage> AliasLinkage
1042 %type <Visibility> GVVisibilityStyle
1044 // ValueRef - Unresolved reference to a definition or BB
1045 %type <ValIDVal> ValueRef ConstValueRef SymbolicValueRef
1046 %type <ValueVal> ResolvedVal // <type> <valref> pair
1047 %type <ValueList> ReturnedVal
1048 // Tokens and types for handling constant integer values
1050 // ESINT64VAL - A negative number within long long range
1051 %token <SInt64Val> ESINT64VAL
1053 // EUINT64VAL - A positive number within uns. long long range
1054 %token <UInt64Val> EUINT64VAL
1056 // ESAPINTVAL - A negative number with arbitrary precision
1057 %token <APIntVal> ESAPINTVAL
1059 // EUAPINTVAL - A positive number with arbitrary precision
1060 %token <APIntVal> EUAPINTVAL
1062 %token <UIntVal> LOCALVAL_ID GLOBALVAL_ID // %123 @123
1063 %token <FPVal> FPVAL // Float or Double constant
1065 // Built in types...
1066 %type <TypeVal> Types ResultTypes
1067 %type <PrimType> IntType FPType PrimType // Classifications
1068 %token <PrimType> VOID INTTYPE
1069 %token <PrimType> FLOAT DOUBLE X86_FP80 FP128 PPC_FP128 LABEL
1073 %token<StrVal> LOCALVAR GLOBALVAR LABELSTR
1074 %token<StrVal> STRINGCONSTANT ATSTRINGCONSTANT PCTSTRINGCONSTANT
1075 %type <StrVal> LocalName OptLocalName OptLocalAssign
1076 %type <StrVal> GlobalName OptGlobalAssign GlobalAssign
1077 %type <StrVal> OptSection SectionString OptGC
1079 %type <UIntVal> OptAlign OptCAlign OptAddrSpace
1081 %token ZEROINITIALIZER TRUETOK FALSETOK BEGINTOK ENDTOK
1082 %token DECLARE DEFINE GLOBAL CONSTANT SECTION ALIAS VOLATILE THREAD_LOCAL
1083 %token TO DOTDOTDOT NULL_TOK UNDEF INTERNAL LINKONCE WEAK APPENDING
1084 %token DLLIMPORT DLLEXPORT EXTERN_WEAK COMMON
1085 %token OPAQUE EXTERNAL TARGET TRIPLE ALIGN ADDRSPACE
1086 %token DEPLIBS CALL TAIL ASM_TOK MODULE SIDEEFFECT
1087 %token CC_TOK CCC_TOK FASTCC_TOK COLDCC_TOK X86_STDCALLCC_TOK X86_FASTCALLCC_TOK
1089 %type <UIntVal> OptCallingConv LocalNumber
1090 %type <Attributes> OptAttributes Attribute
1091 %type <Attributes> OptFuncAttrs FuncAttr
1092 %type <Attributes> OptFuncNotes FuncNote
1093 %type <Attributes> FuncNoteList
1095 // Basic Block Terminating Operators
1096 %token <TermOpVal> RET BR SWITCH INVOKE UNWIND UNREACHABLE
1099 %type <BinaryOpVal> ArithmeticOps LogicalOps // Binops Subcatagories
1100 %token <BinaryOpVal> ADD SUB MUL UDIV SDIV FDIV UREM SREM FREM AND OR XOR
1101 %token <BinaryOpVal> SHL LSHR ASHR
1103 %token <OtherOpVal> ICMP FCMP VICMP VFCMP
1104 %type <IPredicate> IPredicates
1105 %type <FPredicate> FPredicates
1106 %token EQ NE SLT SGT SLE SGE ULT UGT ULE UGE
1107 %token OEQ ONE OLT OGT OLE OGE ORD UNO UEQ UNE
1109 // Memory Instructions
1110 %token <MemOpVal> MALLOC ALLOCA FREE LOAD STORE GETELEMENTPTR
1113 %type <CastOpVal> CastOps
1114 %token <CastOpVal> TRUNC ZEXT SEXT FPTRUNC FPEXT BITCAST
1115 %token <CastOpVal> UITOFP SITOFP FPTOUI FPTOSI INTTOPTR PTRTOINT
1118 %token <OtherOpVal> PHI_TOK SELECT VAARG
1119 %token <OtherOpVal> EXTRACTELEMENT INSERTELEMENT SHUFFLEVECTOR
1120 %token <OtherOpVal> GETRESULT
1121 %token <OtherOpVal> EXTRACTVALUE INSERTVALUE
1123 // Function Attributes
1124 %token SIGNEXT ZEROEXT NORETURN INREG SRET NOUNWIND NOALIAS BYVAL NEST
1125 %token READNONE READONLY GC
1128 %token FNNOTE INLINE ALWAYS NEVER OPTIMIZEFORSIZE
1130 // Visibility Styles
1131 %token DEFAULT HIDDEN PROTECTED
1137 // Operations that are notably excluded from this list include:
1138 // RET, BR, & SWITCH because they end basic blocks and are treated specially.
1140 ArithmeticOps: ADD | SUB | MUL | UDIV | SDIV | FDIV | UREM | SREM | FREM;
1141 LogicalOps : SHL | LSHR | ASHR | AND | OR | XOR;
1142 CastOps : TRUNC | ZEXT | SEXT | FPTRUNC | FPEXT | BITCAST |
1143 UITOFP | SITOFP | FPTOUI | FPTOSI | INTTOPTR | PTRTOINT;
1146 : EQ { $$ = ICmpInst::ICMP_EQ; } | NE { $$ = ICmpInst::ICMP_NE; }
1147 | SLT { $$ = ICmpInst::ICMP_SLT; } | SGT { $$ = ICmpInst::ICMP_SGT; }
1148 | SLE { $$ = ICmpInst::ICMP_SLE; } | SGE { $$ = ICmpInst::ICMP_SGE; }
1149 | ULT { $$ = ICmpInst::ICMP_ULT; } | UGT { $$ = ICmpInst::ICMP_UGT; }
1150 | ULE { $$ = ICmpInst::ICMP_ULE; } | UGE { $$ = ICmpInst::ICMP_UGE; }
1154 : OEQ { $$ = FCmpInst::FCMP_OEQ; } | ONE { $$ = FCmpInst::FCMP_ONE; }
1155 | OLT { $$ = FCmpInst::FCMP_OLT; } | OGT { $$ = FCmpInst::FCMP_OGT; }
1156 | OLE { $$ = FCmpInst::FCMP_OLE; } | OGE { $$ = FCmpInst::FCMP_OGE; }
1157 | ORD { $$ = FCmpInst::FCMP_ORD; } | UNO { $$ = FCmpInst::FCMP_UNO; }
1158 | UEQ { $$ = FCmpInst::FCMP_UEQ; } | UNE { $$ = FCmpInst::FCMP_UNE; }
1159 | ULT { $$ = FCmpInst::FCMP_ULT; } | UGT { $$ = FCmpInst::FCMP_UGT; }
1160 | ULE { $$ = FCmpInst::FCMP_ULE; } | UGE { $$ = FCmpInst::FCMP_UGE; }
1161 | TRUETOK { $$ = FCmpInst::FCMP_TRUE; }
1162 | FALSETOK { $$ = FCmpInst::FCMP_FALSE; }
1165 // These are some types that allow classification if we only want a particular
1166 // thing... for example, only a signed, unsigned, or integral type.
1168 FPType : FLOAT | DOUBLE | PPC_FP128 | FP128 | X86_FP80;
1170 LocalName : LOCALVAR | STRINGCONSTANT | PCTSTRINGCONSTANT ;
1171 OptLocalName : LocalName | /*empty*/ { $$ = 0; };
1173 OptAddrSpace : ADDRSPACE '(' EUINT64VAL ')' { $$=$3; }
1174 | /*empty*/ { $$=0; };
1176 /// OptLocalAssign - Value producing statements have an optional assignment
1178 OptLocalAssign : LocalName '=' {
1187 LocalNumber : LOCALVAL_ID '=' {
1193 GlobalName : GLOBALVAR | ATSTRINGCONSTANT ;
1195 OptGlobalAssign : GlobalAssign
1201 GlobalAssign : GlobalName '=' {
1207 : INTERNAL { $$ = GlobalValue::InternalLinkage; }
1208 | WEAK { $$ = GlobalValue::WeakLinkage; }
1209 | LINKONCE { $$ = GlobalValue::LinkOnceLinkage; }
1210 | APPENDING { $$ = GlobalValue::AppendingLinkage; }
1211 | DLLEXPORT { $$ = GlobalValue::DLLExportLinkage; }
1212 | COMMON { $$ = GlobalValue::CommonLinkage; }
1216 : DLLIMPORT { $$ = GlobalValue::DLLImportLinkage; }
1217 | EXTERN_WEAK { $$ = GlobalValue::ExternalWeakLinkage; }
1218 | EXTERNAL { $$ = GlobalValue::ExternalLinkage; }
1222 : /*empty*/ { $$ = GlobalValue::DefaultVisibility; }
1223 | DEFAULT { $$ = GlobalValue::DefaultVisibility; }
1224 | HIDDEN { $$ = GlobalValue::HiddenVisibility; }
1225 | PROTECTED { $$ = GlobalValue::ProtectedVisibility; }
1228 FunctionDeclareLinkage
1229 : /*empty*/ { $$ = GlobalValue::ExternalLinkage; }
1230 | DLLIMPORT { $$ = GlobalValue::DLLImportLinkage; }
1231 | EXTERN_WEAK { $$ = GlobalValue::ExternalWeakLinkage; }
1234 FunctionDefineLinkage
1235 : /*empty*/ { $$ = GlobalValue::ExternalLinkage; }
1236 | INTERNAL { $$ = GlobalValue::InternalLinkage; }
1237 | LINKONCE { $$ = GlobalValue::LinkOnceLinkage; }
1238 | WEAK { $$ = GlobalValue::WeakLinkage; }
1239 | DLLEXPORT { $$ = GlobalValue::DLLExportLinkage; }
1243 : /*empty*/ { $$ = GlobalValue::ExternalLinkage; }
1244 | WEAK { $$ = GlobalValue::WeakLinkage; }
1245 | INTERNAL { $$ = GlobalValue::InternalLinkage; }
1248 OptCallingConv : /*empty*/ { $$ = CallingConv::C; } |
1249 CCC_TOK { $$ = CallingConv::C; } |
1250 FASTCC_TOK { $$ = CallingConv::Fast; } |
1251 COLDCC_TOK { $$ = CallingConv::Cold; } |
1252 X86_STDCALLCC_TOK { $$ = CallingConv::X86_StdCall; } |
1253 X86_FASTCALLCC_TOK { $$ = CallingConv::X86_FastCall; } |
1255 if ((unsigned)$2 != $2)
1256 GEN_ERROR("Calling conv too large");
1261 Attribute : ZEROEXT { $$ = Attribute::ZExt; }
1262 | ZEXT { $$ = Attribute::ZExt; }
1263 | SIGNEXT { $$ = Attribute::SExt; }
1264 | SEXT { $$ = Attribute::SExt; }
1265 | INREG { $$ = Attribute::InReg; }
1266 | SRET { $$ = Attribute::StructRet; }
1267 | NOALIAS { $$ = Attribute::NoAlias; }
1268 | BYVAL { $$ = Attribute::ByVal; }
1269 | NEST { $$ = Attribute::Nest; }
1270 | ALIGN EUINT64VAL { $$ =
1271 Attribute::constructAlignmentFromInt($2); }
1274 OptAttributes : /* empty */ { $$ = Attribute::None; }
1275 | OptAttributes Attribute {
1280 FuncAttr : NORETURN { $$ = Attribute::NoReturn; }
1281 | NOUNWIND { $$ = Attribute::NoUnwind; }
1282 | INREG { $$ = Attribute::InReg; }
1283 | ZEROEXT { $$ = Attribute::ZExt; }
1284 | SIGNEXT { $$ = Attribute::SExt; }
1285 | READNONE { $$ = Attribute::ReadNone; }
1286 | READONLY { $$ = Attribute::ReadOnly; }
1289 OptFuncAttrs : /* empty */ { $$ = Attribute::None; }
1290 | OptFuncAttrs FuncAttr {
1295 FuncNoteList : FuncNote { $$ = $1; }
1296 | FuncNoteList ',' FuncNote {
1297 unsigned tmp = $1 | $3;
1298 if ($3 == Attribute::NoInline
1299 && ($1 & Attribute::AlwaysInline))
1300 GEN_ERROR("Function Notes may include only one inline notes!")
1301 if ($3 == Attribute::AlwaysInline
1302 && ($1 & Attribute::NoInline))
1303 GEN_ERROR("Function Notes may include only one inline notes!")
1309 FuncNote : INLINE '=' NEVER { $$ = Attribute::NoInline; }
1310 | INLINE '=' ALWAYS { $$ = Attribute::AlwaysInline; }
1311 | OPTIMIZEFORSIZE { $$ = Attribute::OptimizeForSize; }
1314 OptFuncNotes : /* empty */ { $$ = Attribute::None; }
1315 | FNNOTE '(' FuncNoteList ')' {
1320 OptGC : /* empty */ { $$ = 0; }
1321 | GC STRINGCONSTANT {
1326 // OptAlign/OptCAlign - An optional alignment, and an optional alignment with
1327 // a comma before it.
1328 OptAlign : /*empty*/ { $$ = 0; } |
1331 if ($$ != 0 && !isPowerOf2_32($$))
1332 GEN_ERROR("Alignment must be a power of two");
1335 OptCAlign : /*empty*/ { $$ = 0; } |
1336 ',' ALIGN EUINT64VAL {
1338 if ($$ != 0 && !isPowerOf2_32($$))
1339 GEN_ERROR("Alignment must be a power of two");
1345 SectionString : SECTION STRINGCONSTANT {
1346 for (unsigned i = 0, e = $2->length(); i != e; ++i)
1347 if ((*$2)[i] == '"' || (*$2)[i] == '\\')
1348 GEN_ERROR("Invalid character in section name");
1353 OptSection : /*empty*/ { $$ = 0; } |
1354 SectionString { $$ = $1; };
1356 // GlobalVarAttributes - Used to pass the attributes string on a global. CurGV
1357 // is set to be the global we are processing.
1359 GlobalVarAttributes : /* empty */ {} |
1360 ',' GlobalVarAttribute GlobalVarAttributes {};
1361 GlobalVarAttribute : SectionString {
1362 CurGV->setSection(*$1);
1366 | ALIGN EUINT64VAL {
1367 if ($2 != 0 && !isPowerOf2_32($2))
1368 GEN_ERROR("Alignment must be a power of two");
1369 CurGV->setAlignment($2);
1373 //===----------------------------------------------------------------------===//
1374 // Types includes all predefined types... except void, because it can only be
1375 // used in specific contexts (function returning void for example).
1377 // Derived types are added later...
1379 PrimType : INTTYPE | FLOAT | DOUBLE | PPC_FP128 | FP128 | X86_FP80 | LABEL ;
1383 $$ = new PATypeHolder(OpaqueType::get());
1387 $$ = new PATypeHolder($1);
1390 | Types OptAddrSpace '*' { // Pointer type?
1391 if (*$1 == Type::LabelTy)
1392 GEN_ERROR("Cannot form a pointer to a basic block");
1393 $$ = new PATypeHolder(HandleUpRefs(PointerType::get(*$1, $2)));
1397 | SymbolicValueRef { // Named types are also simple types...
1398 const Type* tmp = getTypeVal($1);
1400 $$ = new PATypeHolder(tmp);
1402 | '\\' EUINT64VAL { // Type UpReference
1403 if ($2 > (uint64_t)~0U) GEN_ERROR("Value out of range");
1404 OpaqueType *OT = OpaqueType::get(); // Use temporary placeholder
1405 UpRefs.push_back(UpRefRecord((unsigned)$2, OT)); // Add to vector...
1406 $$ = new PATypeHolder(OT);
1407 UR_OUT("New Upreference!\n");
1410 | Types '(' ArgTypeListI ')' OptFuncAttrs {
1411 // Allow but ignore attributes on function types; this permits auto-upgrade.
1412 // FIXME: remove in LLVM 3.0.
1413 const Type *RetTy = *$1;
1414 if (!FunctionType::isValidReturnType(RetTy))
1415 GEN_ERROR("Invalid result type for LLVM function");
1417 std::vector<const Type*> Params;
1418 TypeWithAttrsList::iterator I = $3->begin(), E = $3->end();
1419 for (; I != E; ++I ) {
1420 const Type *Ty = I->Ty->get();
1421 Params.push_back(Ty);
1424 bool isVarArg = Params.size() && Params.back() == Type::VoidTy;
1425 if (isVarArg) Params.pop_back();
1427 for (unsigned i = 0; i != Params.size(); ++i)
1428 if (!(Params[i]->isFirstClassType() || isa<OpaqueType>(Params[i])))
1429 GEN_ERROR("Function arguments must be value types!");
1433 FunctionType *FT = FunctionType::get(RetTy, Params, isVarArg);
1434 delete $3; // Delete the argument list
1435 delete $1; // Delete the return type handle
1436 $$ = new PATypeHolder(HandleUpRefs(FT));
1439 | VOID '(' ArgTypeListI ')' OptFuncAttrs {
1440 // Allow but ignore attributes on function types; this permits auto-upgrade.
1441 // FIXME: remove in LLVM 3.0.
1442 std::vector<const Type*> Params;
1443 TypeWithAttrsList::iterator I = $3->begin(), E = $3->end();
1444 for ( ; I != E; ++I ) {
1445 const Type* Ty = I->Ty->get();
1446 Params.push_back(Ty);
1449 bool isVarArg = Params.size() && Params.back() == Type::VoidTy;
1450 if (isVarArg) Params.pop_back();
1452 for (unsigned i = 0; i != Params.size(); ++i)
1453 if (!(Params[i]->isFirstClassType() || isa<OpaqueType>(Params[i])))
1454 GEN_ERROR("Function arguments must be value types!");
1458 FunctionType *FT = FunctionType::get($1, Params, isVarArg);
1459 delete $3; // Delete the argument list
1460 $$ = new PATypeHolder(HandleUpRefs(FT));
1464 | '[' EUINT64VAL 'x' Types ']' { // Sized array type?
1465 $$ = new PATypeHolder(HandleUpRefs(ArrayType::get(*$4, $2)));
1469 | '<' EUINT64VAL 'x' Types '>' { // Vector type?
1470 const llvm::Type* ElemTy = $4->get();
1471 if ((unsigned)$2 != $2)
1472 GEN_ERROR("Unsigned result not equal to signed result");
1473 if (!ElemTy->isFloatingPoint() && !ElemTy->isInteger())
1474 GEN_ERROR("Element type of a VectorType must be primitive");
1475 $$ = new PATypeHolder(HandleUpRefs(VectorType::get(*$4, (unsigned)$2)));
1479 | '{' TypeListI '}' { // Structure type?
1480 std::vector<const Type*> Elements;
1481 for (std::list<llvm::PATypeHolder>::iterator I = $2->begin(),
1482 E = $2->end(); I != E; ++I)
1483 Elements.push_back(*I);
1485 $$ = new PATypeHolder(HandleUpRefs(StructType::get(Elements)));
1489 | '{' '}' { // Empty structure type?
1490 $$ = new PATypeHolder(StructType::get(std::vector<const Type*>()));
1493 | '<' '{' TypeListI '}' '>' {
1494 std::vector<const Type*> Elements;
1495 for (std::list<llvm::PATypeHolder>::iterator I = $3->begin(),
1496 E = $3->end(); I != E; ++I)
1497 Elements.push_back(*I);
1499 $$ = new PATypeHolder(HandleUpRefs(StructType::get(Elements, true)));
1503 | '<' '{' '}' '>' { // Empty structure type?
1504 $$ = new PATypeHolder(StructType::get(std::vector<const Type*>(), true));
1510 : Types OptAttributes {
1511 // Allow but ignore attributes on function types; this permits auto-upgrade.
1512 // FIXME: remove in LLVM 3.0.
1514 $$.Attrs = Attribute::None;
1520 if (!UpRefs.empty())
1521 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1522 if (!(*$1)->isFirstClassType() && !isa<StructType>($1->get()))
1523 GEN_ERROR("LLVM functions cannot return aggregate types");
1527 $$ = new PATypeHolder(Type::VoidTy);
1531 ArgTypeList : ArgType {
1532 $$ = new TypeWithAttrsList();
1536 | ArgTypeList ',' ArgType {
1537 ($$=$1)->push_back($3);
1544 | ArgTypeList ',' DOTDOTDOT {
1546 TypeWithAttrs TWA; TWA.Attrs = Attribute::None;
1547 TWA.Ty = new PATypeHolder(Type::VoidTy);
1552 $$ = new TypeWithAttrsList;
1553 TypeWithAttrs TWA; TWA.Attrs = Attribute::None;
1554 TWA.Ty = new PATypeHolder(Type::VoidTy);
1559 $$ = new TypeWithAttrsList();
1563 // TypeList - Used for struct declarations and as a basis for function type
1564 // declaration type lists
1567 $$ = new std::list<PATypeHolder>();
1572 | TypeListI ',' Types {
1573 ($$=$1)->push_back(*$3);
1578 // ConstVal - The various declarations that go into the constant pool. This
1579 // production is used ONLY to represent constants that show up AFTER a 'const',
1580 // 'constant' or 'global' token at global scope. Constants that can be inlined
1581 // into other expressions (such as integers and constexprs) are handled by the
1582 // ResolvedVal, ValueRef and ConstValueRef productions.
1584 ConstVal: Types '[' ConstVector ']' { // Nonempty unsized arr
1585 if (!UpRefs.empty())
1586 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1587 const ArrayType *ATy = dyn_cast<ArrayType>($1->get());
1589 GEN_ERROR("Cannot make array constant with type: '" +
1590 (*$1)->getDescription() + "'");
1591 const Type *ETy = ATy->getElementType();
1592 uint64_t NumElements = ATy->getNumElements();
1594 // Verify that we have the correct size...
1595 if (NumElements != uint64_t(-1) && NumElements != $3->size())
1596 GEN_ERROR("Type mismatch: constant sized array initialized with " +
1597 utostr($3->size()) + " arguments, but has size of " +
1598 utostr(NumElements) + "");
1600 // Verify all elements are correct type!
1601 for (unsigned i = 0; i < $3->size(); i++) {
1602 if (ETy != (*$3)[i]->getType())
1603 GEN_ERROR("Element #" + utostr(i) + " is not of type '" +
1604 ETy->getDescription() +"' as required!\nIt is of type '"+
1605 (*$3)[i]->getType()->getDescription() + "'.");
1608 $$ = ConstantArray::get(ATy, *$3);
1609 delete $1; delete $3;
1613 if (!UpRefs.empty())
1614 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1615 const ArrayType *ATy = dyn_cast<ArrayType>($1->get());
1617 GEN_ERROR("Cannot make array constant with type: '" +
1618 (*$1)->getDescription() + "'");
1620 uint64_t NumElements = ATy->getNumElements();
1621 if (NumElements != uint64_t(-1) && NumElements != 0)
1622 GEN_ERROR("Type mismatch: constant sized array initialized with 0"
1623 " arguments, but has size of " + utostr(NumElements) +"");
1624 $$ = ConstantArray::get(ATy, std::vector<Constant*>());
1628 | Types 'c' STRINGCONSTANT {
1629 if (!UpRefs.empty())
1630 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1631 const ArrayType *ATy = dyn_cast<ArrayType>($1->get());
1633 GEN_ERROR("Cannot make array constant with type: '" +
1634 (*$1)->getDescription() + "'");
1636 uint64_t NumElements = ATy->getNumElements();
1637 const Type *ETy = ATy->getElementType();
1638 if (NumElements != uint64_t(-1) && NumElements != $3->length())
1639 GEN_ERROR("Can't build string constant of size " +
1640 utostr($3->length()) +
1641 " when array has size " + utostr(NumElements) + "");
1642 std::vector<Constant*> Vals;
1643 if (ETy == Type::Int8Ty) {
1644 for (uint64_t i = 0; i < $3->length(); ++i)
1645 Vals.push_back(ConstantInt::get(ETy, (*$3)[i]));
1648 GEN_ERROR("Cannot build string arrays of non byte sized elements");
1651 $$ = ConstantArray::get(ATy, Vals);
1655 | Types '<' ConstVector '>' { // Nonempty unsized arr
1656 if (!UpRefs.empty())
1657 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1658 const VectorType *PTy = dyn_cast<VectorType>($1->get());
1660 GEN_ERROR("Cannot make packed constant with type: '" +
1661 (*$1)->getDescription() + "'");
1662 const Type *ETy = PTy->getElementType();
1663 unsigned NumElements = PTy->getNumElements();
1665 // Verify that we have the correct size...
1666 if (NumElements != unsigned(-1) && NumElements != (unsigned)$3->size())
1667 GEN_ERROR("Type mismatch: constant sized packed initialized with " +
1668 utostr($3->size()) + " arguments, but has size of " +
1669 utostr(NumElements) + "");
1671 // Verify all elements are correct type!
1672 for (unsigned i = 0; i < $3->size(); i++) {
1673 if (ETy != (*$3)[i]->getType())
1674 GEN_ERROR("Element #" + utostr(i) + " is not of type '" +
1675 ETy->getDescription() +"' as required!\nIt is of type '"+
1676 (*$3)[i]->getType()->getDescription() + "'.");
1679 $$ = ConstantVector::get(PTy, *$3);
1680 delete $1; delete $3;
1683 | Types '{' ConstVector '}' {
1684 const StructType *STy = dyn_cast<StructType>($1->get());
1686 GEN_ERROR("Cannot make struct constant with type: '" +
1687 (*$1)->getDescription() + "'");
1689 if ($3->size() != STy->getNumContainedTypes())
1690 GEN_ERROR("Illegal number of initializers for structure type");
1692 // Check to ensure that constants are compatible with the type initializer!
1693 for (unsigned i = 0, e = $3->size(); i != e; ++i)
1694 if ((*$3)[i]->getType() != STy->getElementType(i))
1695 GEN_ERROR("Expected type '" +
1696 STy->getElementType(i)->getDescription() +
1697 "' for element #" + utostr(i) +
1698 " of structure initializer");
1700 // Check to ensure that Type is not packed
1701 if (STy->isPacked())
1702 GEN_ERROR("Unpacked Initializer to vector type '" +
1703 STy->getDescription() + "'");
1705 $$ = ConstantStruct::get(STy, *$3);
1706 delete $1; delete $3;
1710 if (!UpRefs.empty())
1711 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1712 const StructType *STy = dyn_cast<StructType>($1->get());
1714 GEN_ERROR("Cannot make struct constant with type: '" +
1715 (*$1)->getDescription() + "'");
1717 if (STy->getNumContainedTypes() != 0)
1718 GEN_ERROR("Illegal number of initializers for structure type");
1720 // Check to ensure that Type is not packed
1721 if (STy->isPacked())
1722 GEN_ERROR("Unpacked Initializer to vector type '" +
1723 STy->getDescription() + "'");
1725 $$ = ConstantStruct::get(STy, std::vector<Constant*>());
1729 | Types '<' '{' ConstVector '}' '>' {
1730 const StructType *STy = dyn_cast<StructType>($1->get());
1732 GEN_ERROR("Cannot make struct constant with type: '" +
1733 (*$1)->getDescription() + "'");
1735 if ($4->size() != STy->getNumContainedTypes())
1736 GEN_ERROR("Illegal number of initializers for structure type");
1738 // Check to ensure that constants are compatible with the type initializer!
1739 for (unsigned i = 0, e = $4->size(); i != e; ++i)
1740 if ((*$4)[i]->getType() != STy->getElementType(i))
1741 GEN_ERROR("Expected type '" +
1742 STy->getElementType(i)->getDescription() +
1743 "' for element #" + utostr(i) +
1744 " of structure initializer");
1746 // Check to ensure that Type is packed
1747 if (!STy->isPacked())
1748 GEN_ERROR("Vector initializer to non-vector type '" +
1749 STy->getDescription() + "'");
1751 $$ = ConstantStruct::get(STy, *$4);
1752 delete $1; delete $4;
1755 | Types '<' '{' '}' '>' {
1756 if (!UpRefs.empty())
1757 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1758 const StructType *STy = dyn_cast<StructType>($1->get());
1760 GEN_ERROR("Cannot make struct constant with type: '" +
1761 (*$1)->getDescription() + "'");
1763 if (STy->getNumContainedTypes() != 0)
1764 GEN_ERROR("Illegal number of initializers for structure type");
1766 // Check to ensure that Type is packed
1767 if (!STy->isPacked())
1768 GEN_ERROR("Vector initializer to non-vector type '" +
1769 STy->getDescription() + "'");
1771 $$ = ConstantStruct::get(STy, std::vector<Constant*>());
1776 if (!UpRefs.empty())
1777 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1778 const PointerType *PTy = dyn_cast<PointerType>($1->get());
1780 GEN_ERROR("Cannot make null pointer constant with type: '" +
1781 (*$1)->getDescription() + "'");
1783 $$ = ConstantPointerNull::get(PTy);
1788 if (!UpRefs.empty())
1789 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1790 $$ = UndefValue::get($1->get());
1794 | Types SymbolicValueRef {
1795 if (!UpRefs.empty())
1796 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1797 const PointerType *Ty = dyn_cast<PointerType>($1->get());
1799 GEN_ERROR("Global const reference must be a pointer type " + (*$1)->getDescription());
1801 // ConstExprs can exist in the body of a function, thus creating
1802 // GlobalValues whenever they refer to a variable. Because we are in
1803 // the context of a function, getExistingVal will search the functions
1804 // symbol table instead of the module symbol table for the global symbol,
1805 // which throws things all off. To get around this, we just tell
1806 // getExistingVal that we are at global scope here.
1808 Function *SavedCurFn = CurFun.CurrentFunction;
1809 CurFun.CurrentFunction = 0;
1811 Value *V = getExistingVal(Ty, $2);
1814 CurFun.CurrentFunction = SavedCurFn;
1816 // If this is an initializer for a constant pointer, which is referencing a
1817 // (currently) undefined variable, create a stub now that shall be replaced
1818 // in the future with the right type of variable.
1821 assert(isa<PointerType>(Ty) && "Globals may only be used as pointers!");
1822 const PointerType *PT = cast<PointerType>(Ty);
1824 // First check to see if the forward references value is already created!
1825 PerModuleInfo::GlobalRefsType::iterator I =
1826 CurModule.GlobalRefs.find(std::make_pair(PT, $2));
1828 if (I != CurModule.GlobalRefs.end()) {
1829 V = I->second; // Placeholder already exists, use it...
1833 if ($2.Type == ValID::GlobalName)
1834 Name = $2.getName();
1835 else if ($2.Type != ValID::GlobalID)
1836 GEN_ERROR("Invalid reference to global");
1838 // Create the forward referenced global.
1840 if (const FunctionType *FTy =
1841 dyn_cast<FunctionType>(PT->getElementType())) {
1842 GV = Function::Create(FTy, GlobalValue::ExternalWeakLinkage, Name,
1843 CurModule.CurrentModule);
1845 GV = new GlobalVariable(PT->getElementType(), false,
1846 GlobalValue::ExternalWeakLinkage, 0,
1847 Name, CurModule.CurrentModule);
1850 // Keep track of the fact that we have a forward ref to recycle it
1851 CurModule.GlobalRefs.insert(std::make_pair(std::make_pair(PT, $2), GV));
1856 $$ = cast<GlobalValue>(V);
1857 delete $1; // Free the type handle
1861 if (!UpRefs.empty())
1862 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1863 if ($1->get() != $2->getType())
1864 GEN_ERROR("Mismatched types for constant expression: " +
1865 (*$1)->getDescription() + " and " + $2->getType()->getDescription());
1870 | Types ZEROINITIALIZER {
1871 if (!UpRefs.empty())
1872 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1873 const Type *Ty = $1->get();
1874 if (isa<FunctionType>(Ty) || Ty == Type::LabelTy || isa<OpaqueType>(Ty))
1875 GEN_ERROR("Cannot create a null initialized value of this type");
1876 $$ = Constant::getNullValue(Ty);
1880 | IntType ESINT64VAL { // integral constants
1881 if (!ConstantInt::isValueValidForType($1, $2))
1882 GEN_ERROR("Constant value doesn't fit in type");
1883 $$ = ConstantInt::get($1, $2, true);
1886 | IntType ESAPINTVAL { // arbitrary precision integer constants
1887 uint32_t BitWidth = cast<IntegerType>($1)->getBitWidth();
1888 if ($2->getBitWidth() > BitWidth) {
1889 GEN_ERROR("Constant value does not fit in type");
1891 $2->sextOrTrunc(BitWidth);
1892 $$ = ConstantInt::get(*$2);
1896 | IntType EUINT64VAL { // integral constants
1897 if (!ConstantInt::isValueValidForType($1, $2))
1898 GEN_ERROR("Constant value doesn't fit in type");
1899 $$ = ConstantInt::get($1, $2, false);
1902 | IntType EUAPINTVAL { // arbitrary precision integer constants
1903 uint32_t BitWidth = cast<IntegerType>($1)->getBitWidth();
1904 if ($2->getBitWidth() > BitWidth) {
1905 GEN_ERROR("Constant value does not fit in type");
1907 $2->zextOrTrunc(BitWidth);
1908 $$ = ConstantInt::get(*$2);
1912 | INTTYPE TRUETOK { // Boolean constants
1913 if (cast<IntegerType>($1)->getBitWidth() != 1)
1914 GEN_ERROR("Constant true must have type i1");
1915 $$ = ConstantInt::getTrue();
1918 | INTTYPE FALSETOK { // Boolean constants
1919 if (cast<IntegerType>($1)->getBitWidth() != 1)
1920 GEN_ERROR("Constant false must have type i1");
1921 $$ = ConstantInt::getFalse();
1924 | FPType FPVAL { // Floating point constants
1925 if (!ConstantFP::isValueValidForType($1, *$2))
1926 GEN_ERROR("Floating point constant invalid for type");
1927 // Lexer has no type info, so builds all float and double FP constants
1928 // as double. Fix this here. Long double is done right.
1929 if (&$2->getSemantics()==&APFloat::IEEEdouble && $1==Type::FloatTy)
1930 $2->convert(APFloat::IEEEsingle, APFloat::rmNearestTiesToEven);
1931 $$ = ConstantFP::get(*$2);
1937 ConstExpr: CastOps '(' ConstVal TO Types ')' {
1938 if (!UpRefs.empty())
1939 GEN_ERROR("Invalid upreference in type: " + (*$5)->getDescription());
1941 const Type *DestTy = $5->get();
1942 if (!CastInst::castIsValid($1, $3, DestTy))
1943 GEN_ERROR("invalid cast opcode for cast from '" +
1944 Val->getType()->getDescription() + "' to '" +
1945 DestTy->getDescription() + "'");
1946 $$ = ConstantExpr::getCast($1, $3, DestTy);
1949 | GETELEMENTPTR '(' ConstVal IndexList ')' {
1950 if (!isa<PointerType>($3->getType()))
1951 GEN_ERROR("GetElementPtr requires a pointer operand");
1954 GetElementPtrInst::getIndexedType($3->getType(), $4->begin(), $4->end());
1956 GEN_ERROR("Index list invalid for constant getelementptr");
1958 SmallVector<Constant*, 8> IdxVec;
1959 for (unsigned i = 0, e = $4->size(); i != e; ++i)
1960 if (Constant *C = dyn_cast<Constant>((*$4)[i]))
1961 IdxVec.push_back(C);
1963 GEN_ERROR("Indices to constant getelementptr must be constants");
1967 $$ = ConstantExpr::getGetElementPtr($3, &IdxVec[0], IdxVec.size());
1970 | SELECT '(' ConstVal ',' ConstVal ',' ConstVal ')' {
1971 if ($3->getType() != Type::Int1Ty)
1972 GEN_ERROR("Select condition must be of boolean type");
1973 if ($5->getType() != $7->getType())
1974 GEN_ERROR("Select operand types must match");
1975 $$ = ConstantExpr::getSelect($3, $5, $7);
1978 | ArithmeticOps '(' ConstVal ',' ConstVal ')' {
1979 if ($3->getType() != $5->getType())
1980 GEN_ERROR("Binary operator types must match");
1982 $$ = ConstantExpr::get($1, $3, $5);
1984 | LogicalOps '(' ConstVal ',' ConstVal ')' {
1985 if ($3->getType() != $5->getType())
1986 GEN_ERROR("Logical operator types must match");
1987 if (!$3->getType()->isInteger()) {
1988 if (!isa<VectorType>($3->getType()) ||
1989 !cast<VectorType>($3->getType())->getElementType()->isInteger())
1990 GEN_ERROR("Logical operator requires integral operands");
1992 $$ = ConstantExpr::get($1, $3, $5);
1995 | ICMP IPredicates '(' ConstVal ',' ConstVal ')' {
1996 if ($4->getType() != $6->getType())
1997 GEN_ERROR("icmp operand types must match");
1998 $$ = ConstantExpr::getICmp($2, $4, $6);
2000 | FCMP FPredicates '(' ConstVal ',' ConstVal ')' {
2001 if ($4->getType() != $6->getType())
2002 GEN_ERROR("fcmp operand types must match");
2003 $$ = ConstantExpr::getFCmp($2, $4, $6);
2005 | VICMP IPredicates '(' ConstVal ',' ConstVal ')' {
2006 if ($4->getType() != $6->getType())
2007 GEN_ERROR("vicmp operand types must match");
2008 $$ = ConstantExpr::getVICmp($2, $4, $6);
2010 | VFCMP FPredicates '(' ConstVal ',' ConstVal ')' {
2011 if ($4->getType() != $6->getType())
2012 GEN_ERROR("vfcmp operand types must match");
2013 $$ = ConstantExpr::getVFCmp($2, $4, $6);
2015 | EXTRACTELEMENT '(' ConstVal ',' ConstVal ')' {
2016 if (!ExtractElementInst::isValidOperands($3, $5))
2017 GEN_ERROR("Invalid extractelement operands");
2018 $$ = ConstantExpr::getExtractElement($3, $5);
2021 | INSERTELEMENT '(' ConstVal ',' ConstVal ',' ConstVal ')' {
2022 if (!InsertElementInst::isValidOperands($3, $5, $7))
2023 GEN_ERROR("Invalid insertelement operands");
2024 $$ = ConstantExpr::getInsertElement($3, $5, $7);
2027 | SHUFFLEVECTOR '(' ConstVal ',' ConstVal ',' ConstVal ')' {
2028 if (!ShuffleVectorInst::isValidOperands($3, $5, $7))
2029 GEN_ERROR("Invalid shufflevector operands");
2030 $$ = ConstantExpr::getShuffleVector($3, $5, $7);
2033 | EXTRACTVALUE '(' ConstVal ConstantIndexList ')' {
2034 if (!isa<StructType>($3->getType()) && !isa<ArrayType>($3->getType()))
2035 GEN_ERROR("ExtractValue requires an aggregate operand");
2037 $$ = ConstantExpr::getExtractValue($3, &(*$4)[0], $4->size());
2041 | INSERTVALUE '(' ConstVal ',' ConstVal ConstantIndexList ')' {
2042 if (!isa<StructType>($3->getType()) && !isa<ArrayType>($3->getType()))
2043 GEN_ERROR("InsertValue requires an aggregate operand");
2045 $$ = ConstantExpr::getInsertValue($3, $5, &(*$6)[0], $6->size());
2051 // ConstVector - A list of comma separated constants.
2052 ConstVector : ConstVector ',' ConstVal {
2053 ($$ = $1)->push_back($3);
2057 $$ = new std::vector<Constant*>();
2063 // GlobalType - Match either GLOBAL or CONSTANT for global declarations...
2064 GlobalType : GLOBAL { $$ = false; } | CONSTANT { $$ = true; };
2067 ThreadLocal : THREAD_LOCAL { $$ = true; } | { $$ = false; };
2069 // AliaseeRef - Match either GlobalValue or bitcast to GlobalValue.
2070 AliaseeRef : ResultTypes SymbolicValueRef {
2071 const Type* VTy = $1->get();
2072 Value *V = getVal(VTy, $2);
2074 GlobalValue* Aliasee = dyn_cast<GlobalValue>(V);
2076 GEN_ERROR("Aliases can be created only to global values");
2082 | BITCAST '(' AliaseeRef TO Types ')' {
2084 const Type *DestTy = $5->get();
2085 if (!CastInst::castIsValid($1, $3, DestTy))
2086 GEN_ERROR("invalid cast opcode for cast from '" +
2087 Val->getType()->getDescription() + "' to '" +
2088 DestTy->getDescription() + "'");
2090 $$ = ConstantExpr::getCast($1, $3, DestTy);
2095 //===----------------------------------------------------------------------===//
2096 // Rules to match Modules
2097 //===----------------------------------------------------------------------===//
2099 // Module rule: Capture the result of parsing the whole file into a result
2104 $$ = ParserResult = CurModule.CurrentModule;
2105 CurModule.ModuleDone();
2109 $$ = ParserResult = CurModule.CurrentModule;
2110 CurModule.ModuleDone();
2117 | DefinitionList Definition
2121 : DEFINE { CurFun.isDeclare = false; } Function {
2122 CurFun.FunctionDone();
2125 | DECLARE { CurFun.isDeclare = true; } FunctionProto {
2128 | MODULE ASM_TOK AsmBlock {
2131 | OptLocalAssign TYPE Types {
2132 if (!UpRefs.empty())
2133 GEN_ERROR("Invalid upreference in type: " + (*$3)->getDescription());
2134 // Eagerly resolve types. This is not an optimization, this is a
2135 // requirement that is due to the fact that we could have this:
2137 // %list = type { %list * }
2138 // %list = type { %list * } ; repeated type decl
2140 // If types are not resolved eagerly, then the two types will not be
2141 // determined to be the same type!
2143 ResolveTypeTo($1, *$3);
2145 if (!setTypeName(*$3, $1) && !$1) {
2147 // If this is a named type that is not a redefinition, add it to the slot
2149 CurModule.Types.push_back(*$3);
2155 | OptLocalAssign TYPE VOID {
2156 ResolveTypeTo($1, $3);
2158 if (!setTypeName($3, $1) && !$1) {
2160 // If this is a named type that is not a redefinition, add it to the slot
2162 CurModule.Types.push_back($3);
2166 | OptGlobalAssign GVVisibilityStyle ThreadLocal GlobalType ConstVal
2168 /* "Externally Visible" Linkage */
2170 GEN_ERROR("Global value initializer is not a constant");
2171 CurGV = ParseGlobalVariable($1, GlobalValue::ExternalLinkage,
2172 $2, $4, $5->getType(), $5, $3, $6);
2174 } GlobalVarAttributes {
2177 | OptGlobalAssign GVInternalLinkage GVVisibilityStyle ThreadLocal GlobalType
2178 ConstVal OptAddrSpace {
2180 GEN_ERROR("Global value initializer is not a constant");
2181 CurGV = ParseGlobalVariable($1, $2, $3, $5, $6->getType(), $6, $4, $7);
2183 } GlobalVarAttributes {
2186 | OptGlobalAssign GVExternalLinkage GVVisibilityStyle ThreadLocal GlobalType
2187 Types OptAddrSpace {
2188 if (!UpRefs.empty())
2189 GEN_ERROR("Invalid upreference in type: " + (*$6)->getDescription());
2190 CurGV = ParseGlobalVariable($1, $2, $3, $5, *$6, 0, $4, $7);
2193 } GlobalVarAttributes {
2197 | OptGlobalAssign GVVisibilityStyle ALIAS AliasLinkage AliaseeRef {
2204 GEN_ERROR("Alias name cannot be empty");
2206 Constant* Aliasee = $5;
2208 GEN_ERROR(std::string("Invalid aliasee for alias: ") + Name);
2210 GlobalAlias* GA = new GlobalAlias(Aliasee->getType(), $4, Name, Aliasee,
2211 CurModule.CurrentModule);
2212 GA->setVisibility($2);
2213 InsertValue(GA, CurModule.Values);
2216 // If there was a forward reference of this alias, resolve it now.
2220 ID = ValID::createGlobalName(Name);
2222 ID = ValID::createGlobalID(CurModule.Values.size()-1);
2224 if (GlobalValue *FWGV =
2225 CurModule.GetForwardRefForGlobal(GA->getType(), ID)) {
2226 // Replace uses of the fwdref with the actual alias.
2227 FWGV->replaceAllUsesWith(GA);
2228 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(FWGV))
2229 GV->eraseFromParent();
2231 cast<Function>(FWGV)->eraseFromParent();
2237 | TARGET TargetDefinition {
2240 | DEPLIBS '=' LibrariesDefinition {
2246 AsmBlock : STRINGCONSTANT {
2247 const std::string &AsmSoFar = CurModule.CurrentModule->getModuleInlineAsm();
2248 if (AsmSoFar.empty())
2249 CurModule.CurrentModule->setModuleInlineAsm(*$1);
2251 CurModule.CurrentModule->setModuleInlineAsm(AsmSoFar+"\n"+*$1);
2256 TargetDefinition : TRIPLE '=' STRINGCONSTANT {
2257 CurModule.CurrentModule->setTargetTriple(*$3);
2260 | DATALAYOUT '=' STRINGCONSTANT {
2261 CurModule.CurrentModule->setDataLayout(*$3);
2265 LibrariesDefinition : '[' LibList ']';
2267 LibList : LibList ',' STRINGCONSTANT {
2268 CurModule.CurrentModule->addLibrary(*$3);
2273 CurModule.CurrentModule->addLibrary(*$1);
2277 | /* empty: end of list */ {
2282 //===----------------------------------------------------------------------===//
2283 // Rules to match Function Headers
2284 //===----------------------------------------------------------------------===//
2286 ArgListH : ArgListH ',' Types OptAttributes OptLocalName {
2287 if (!UpRefs.empty())
2288 GEN_ERROR("Invalid upreference in type: " + (*$3)->getDescription());
2289 if (!(*$3)->isFirstClassType())
2290 GEN_ERROR("Argument types must be first-class");
2291 ArgListEntry E; E.Attrs = $4; E.Ty = $3; E.Name = $5;
2296 | Types OptAttributes OptLocalName {
2297 if (!UpRefs.empty())
2298 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
2299 if (!(*$1)->isFirstClassType())
2300 GEN_ERROR("Argument types must be first-class");
2301 ArgListEntry E; E.Attrs = $2; E.Ty = $1; E.Name = $3;
2302 $$ = new ArgListType;
2307 ArgList : ArgListH {
2311 | ArgListH ',' DOTDOTDOT {
2313 struct ArgListEntry E;
2314 E.Ty = new PATypeHolder(Type::VoidTy);
2316 E.Attrs = Attribute::None;
2321 $$ = new ArgListType;
2322 struct ArgListEntry E;
2323 E.Ty = new PATypeHolder(Type::VoidTy);
2325 E.Attrs = Attribute::None;
2334 FunctionHeaderH : OptCallingConv ResultTypes GlobalName '(' ArgList ')'
2335 OptFuncAttrs OptSection OptAlign OptGC OptFuncNotes {
2336 std::string FunctionName(*$3);
2337 delete $3; // Free strdup'd memory!
2339 // Check the function result for abstractness if this is a define. We should
2340 // have no abstract types at this point
2341 if (!CurFun.isDeclare && CurModule.TypeIsUnresolved($2))
2342 GEN_ERROR("Reference to abstract result: "+ $2->get()->getDescription());
2344 if (!FunctionType::isValidReturnType(*$2))
2345 GEN_ERROR("Invalid result type for LLVM function");
2347 std::vector<const Type*> ParamTypeList;
2348 SmallVector<AttributeWithIndex, 8> Attrs;
2349 //FIXME : In 3.0, stop accepting zext, sext and inreg as optional function
2351 Attributes RetAttrs = 0;
2352 if ($7 != Attribute::None) {
2353 if ($7 & Attribute::ZExt) {
2354 RetAttrs = RetAttrs | Attribute::ZExt;
2355 $7 = $7 ^ Attribute::ZExt;
2357 if ($7 & Attribute::SExt) {
2358 RetAttrs = RetAttrs | Attribute::SExt;
2359 $7 = $7 ^ Attribute::SExt;
2361 if ($7 & Attribute::InReg) {
2362 RetAttrs = RetAttrs | Attribute::InReg;
2363 $7 = $7 ^ Attribute::InReg;
2365 if (RetAttrs != Attribute::None)
2366 Attrs.push_back(AttributeWithIndex::get(0, RetAttrs));
2368 if ($5) { // If there are arguments...
2370 for (ArgListType::iterator I = $5->begin(); I != $5->end(); ++I, ++index) {
2371 const Type* Ty = I->Ty->get();
2372 if (!CurFun.isDeclare && CurModule.TypeIsUnresolved(I->Ty))
2373 GEN_ERROR("Reference to abstract argument: " + Ty->getDescription());
2374 ParamTypeList.push_back(Ty);
2375 if (Ty != Type::VoidTy && I->Attrs != Attribute::None)
2376 Attrs.push_back(AttributeWithIndex::get(index, I->Attrs));
2379 if ($7 != Attribute::None)
2380 Attrs.push_back(AttributeWithIndex::get(~0, $7));
2382 bool isVarArg = ParamTypeList.size() && ParamTypeList.back() == Type::VoidTy;
2383 if (isVarArg) ParamTypeList.pop_back();
2387 PAL = AttrListPtr::get(Attrs.begin(), Attrs.end());
2389 FunctionType *FT = FunctionType::get(*$2, ParamTypeList, isVarArg);
2390 const PointerType *PFT = PointerType::getUnqual(FT);
2394 if (!FunctionName.empty()) {
2395 ID = ValID::createGlobalName((char*)FunctionName.c_str());
2397 ID = ValID::createGlobalID(CurModule.Values.size());
2401 // See if this function was forward referenced. If so, recycle the object.
2402 if (GlobalValue *FWRef = CurModule.GetForwardRefForGlobal(PFT, ID)) {
2403 // Move the function to the end of the list, from whereever it was
2404 // previously inserted.
2405 Fn = cast<Function>(FWRef);
2406 assert(Fn->getAttributes().isEmpty() &&
2407 "Forward reference has parameter attributes!");
2408 CurModule.CurrentModule->getFunctionList().remove(Fn);
2409 CurModule.CurrentModule->getFunctionList().push_back(Fn);
2410 } else if (!FunctionName.empty() && // Merge with an earlier prototype?
2411 (Fn = CurModule.CurrentModule->getFunction(FunctionName))) {
2412 if (Fn->getFunctionType() != FT ) {
2413 // The existing function doesn't have the same type. This is an overload
2415 GEN_ERROR("Overload of function '" + FunctionName + "' not permitted.");
2416 } else if (Fn->getAttributes() != PAL) {
2417 // The existing function doesn't have the same parameter attributes.
2418 // This is an overload error.
2419 GEN_ERROR("Overload of function '" + FunctionName + "' not permitted.");
2420 } else if (!CurFun.isDeclare && !Fn->isDeclaration()) {
2421 // Neither the existing or the current function is a declaration and they
2422 // have the same name and same type. Clearly this is a redefinition.
2423 GEN_ERROR("Redefinition of function '" + FunctionName + "'");
2424 } else if (Fn->isDeclaration()) {
2425 // Make sure to strip off any argument names so we can't get conflicts.
2426 for (Function::arg_iterator AI = Fn->arg_begin(), AE = Fn->arg_end();
2430 } else { // Not already defined?
2431 Fn = Function::Create(FT, GlobalValue::ExternalWeakLinkage, FunctionName,
2432 CurModule.CurrentModule);
2433 InsertValue(Fn, CurModule.Values);
2436 CurFun.FunctionStart(Fn);
2438 if (CurFun.isDeclare) {
2439 // If we have declaration, always overwrite linkage. This will allow us to
2440 // correctly handle cases, when pointer to function is passed as argument to
2441 // another function.
2442 Fn->setLinkage(CurFun.Linkage);
2443 Fn->setVisibility(CurFun.Visibility);
2445 Fn->setCallingConv($1);
2446 Fn->setAttributes(PAL);
2447 Fn->setAlignment($9);
2449 Fn->setSection(*$8);
2453 Fn->setGC($10->c_str());
2460 // Add all of the arguments we parsed to the function...
2461 if ($5) { // Is null if empty...
2462 if (isVarArg) { // Nuke the last entry
2463 assert($5->back().Ty->get() == Type::VoidTy && $5->back().Name == 0 &&
2464 "Not a varargs marker!");
2465 delete $5->back().Ty;
2466 $5->pop_back(); // Delete the last entry
2468 Function::arg_iterator ArgIt = Fn->arg_begin();
2469 Function::arg_iterator ArgEnd = Fn->arg_end();
2471 for (ArgListType::iterator I = $5->begin();
2472 I != $5->end() && ArgIt != ArgEnd; ++I, ++ArgIt) {
2473 delete I->Ty; // Delete the typeholder...
2474 setValueName(ArgIt, I->Name); // Insert arg into symtab...
2480 delete $5; // We're now done with the argument list
2485 BEGIN : BEGINTOK | '{'; // Allow BEGIN or '{' to start a function
2487 FunctionHeader : FunctionDefineLinkage GVVisibilityStyle FunctionHeaderH BEGIN {
2488 $$ = CurFun.CurrentFunction;
2490 // Make sure that we keep track of the linkage type even if there was a
2491 // previous "declare".
2493 $$->setVisibility($2);
2496 END : ENDTOK | '}'; // Allow end of '}' to end a function
2498 Function : BasicBlockList END {
2503 FunctionProto : FunctionDeclareLinkage GVVisibilityStyle FunctionHeaderH {
2504 CurFun.CurrentFunction->setLinkage($1);
2505 CurFun.CurrentFunction->setVisibility($2);
2506 $$ = CurFun.CurrentFunction;
2507 CurFun.FunctionDone();
2511 //===----------------------------------------------------------------------===//
2512 // Rules to match Basic Blocks
2513 //===----------------------------------------------------------------------===//
2515 OptSideEffect : /* empty */ {
2524 ConstValueRef : ESINT64VAL { // A reference to a direct constant
2525 $$ = ValID::create($1);
2529 $$ = ValID::create($1);
2532 | ESAPINTVAL { // arbitrary precision integer constants
2533 $$ = ValID::create(*$1, true);
2537 | EUAPINTVAL { // arbitrary precision integer constants
2538 $$ = ValID::create(*$1, false);
2542 | FPVAL { // Perhaps it's an FP constant?
2543 $$ = ValID::create($1);
2547 $$ = ValID::create(ConstantInt::getTrue());
2551 $$ = ValID::create(ConstantInt::getFalse());
2555 $$ = ValID::createNull();
2559 $$ = ValID::createUndef();
2562 | ZEROINITIALIZER { // A vector zero constant.
2563 $$ = ValID::createZeroInit();
2566 | '<' ConstVector '>' { // Nonempty unsized packed vector
2567 const Type *ETy = (*$2)[0]->getType();
2568 unsigned NumElements = $2->size();
2570 if (!ETy->isInteger() && !ETy->isFloatingPoint())
2571 GEN_ERROR("Invalid vector element type: " + ETy->getDescription());
2573 VectorType* pt = VectorType::get(ETy, NumElements);
2574 PATypeHolder* PTy = new PATypeHolder(HandleUpRefs(pt));
2576 // Verify all elements are correct type!
2577 for (unsigned i = 0; i < $2->size(); i++) {
2578 if (ETy != (*$2)[i]->getType())
2579 GEN_ERROR("Element #" + utostr(i) + " is not of type '" +
2580 ETy->getDescription() +"' as required!\nIt is of type '" +
2581 (*$2)[i]->getType()->getDescription() + "'.");
2584 $$ = ValID::create(ConstantVector::get(pt, *$2));
2585 delete PTy; delete $2;
2588 | '[' ConstVector ']' { // Nonempty unsized arr
2589 const Type *ETy = (*$2)[0]->getType();
2590 uint64_t NumElements = $2->size();
2592 if (!ETy->isFirstClassType())
2593 GEN_ERROR("Invalid array element type: " + ETy->getDescription());
2595 ArrayType *ATy = ArrayType::get(ETy, NumElements);
2596 PATypeHolder* PTy = new PATypeHolder(HandleUpRefs(ATy));
2598 // Verify all elements are correct type!
2599 for (unsigned i = 0; i < $2->size(); i++) {
2600 if (ETy != (*$2)[i]->getType())
2601 GEN_ERROR("Element #" + utostr(i) + " is not of type '" +
2602 ETy->getDescription() +"' as required!\nIt is of type '"+
2603 (*$2)[i]->getType()->getDescription() + "'.");
2606 $$ = ValID::create(ConstantArray::get(ATy, *$2));
2607 delete PTy; delete $2;
2611 // Use undef instead of an array because it's inconvenient to determine
2612 // the element type at this point, there being no elements to examine.
2613 $$ = ValID::createUndef();
2616 | 'c' STRINGCONSTANT {
2617 uint64_t NumElements = $2->length();
2618 const Type *ETy = Type::Int8Ty;
2620 ArrayType *ATy = ArrayType::get(ETy, NumElements);
2622 std::vector<Constant*> Vals;
2623 for (unsigned i = 0; i < $2->length(); ++i)
2624 Vals.push_back(ConstantInt::get(ETy, (*$2)[i]));
2626 $$ = ValID::create(ConstantArray::get(ATy, Vals));
2629 | '{' ConstVector '}' {
2630 std::vector<const Type*> Elements($2->size());
2631 for (unsigned i = 0, e = $2->size(); i != e; ++i)
2632 Elements[i] = (*$2)[i]->getType();
2634 const StructType *STy = StructType::get(Elements);
2635 PATypeHolder* PTy = new PATypeHolder(HandleUpRefs(STy));
2637 $$ = ValID::create(ConstantStruct::get(STy, *$2));
2638 delete PTy; delete $2;
2642 const StructType *STy = StructType::get(std::vector<const Type*>());
2643 $$ = ValID::create(ConstantStruct::get(STy, std::vector<Constant*>()));
2646 | '<' '{' ConstVector '}' '>' {
2647 std::vector<const Type*> Elements($3->size());
2648 for (unsigned i = 0, e = $3->size(); i != e; ++i)
2649 Elements[i] = (*$3)[i]->getType();
2651 const StructType *STy = StructType::get(Elements, /*isPacked=*/true);
2652 PATypeHolder* PTy = new PATypeHolder(HandleUpRefs(STy));
2654 $$ = ValID::create(ConstantStruct::get(STy, *$3));
2655 delete PTy; delete $3;
2659 const StructType *STy = StructType::get(std::vector<const Type*>(),
2661 $$ = ValID::create(ConstantStruct::get(STy, std::vector<Constant*>()));
2665 $$ = ValID::create($1);
2668 | ASM_TOK OptSideEffect STRINGCONSTANT ',' STRINGCONSTANT {
2669 $$ = ValID::createInlineAsm(*$3, *$5, $2);
2675 // SymbolicValueRef - Reference to one of two ways of symbolically refering to
2678 SymbolicValueRef : LOCALVAL_ID { // Is it an integer reference...?
2679 $$ = ValID::createLocalID($1);
2683 $$ = ValID::createGlobalID($1);
2686 | LocalName { // Is it a named reference...?
2687 $$ = ValID::createLocalName(*$1);
2691 | GlobalName { // Is it a named reference...?
2692 $$ = ValID::createGlobalName(*$1);
2697 // ValueRef - A reference to a definition... either constant or symbolic
2698 ValueRef : SymbolicValueRef | ConstValueRef;
2701 // ResolvedVal - a <type> <value> pair. This is used only in cases where the
2702 // type immediately preceeds the value reference, and allows complex constant
2703 // pool references (for things like: 'ret [2 x int] [ int 12, int 42]')
2704 ResolvedVal : Types ValueRef {
2705 if (!UpRefs.empty())
2706 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
2707 $$ = getVal(*$1, $2);
2713 ReturnedVal : ResolvedVal {
2714 $$ = new std::vector<Value *>();
2718 | ReturnedVal ',' ResolvedVal {
2719 ($$=$1)->push_back($3);
2723 BasicBlockList : BasicBlockList BasicBlock {
2727 | FunctionHeader BasicBlock { // Do not allow functions with 0 basic blocks
2733 // Basic blocks are terminated by branching instructions:
2734 // br, br/cc, switch, ret
2736 BasicBlock : InstructionList OptLocalAssign BBTerminatorInst {
2737 setValueName($3, $2);
2740 $1->getInstList().push_back($3);
2745 BasicBlock : InstructionList LocalNumber BBTerminatorInst {
2747 int ValNum = InsertValue($3);
2748 if (ValNum != (int)$2)
2749 GEN_ERROR("Result value number %" + utostr($2) +
2750 " is incorrect, expected %" + utostr((unsigned)ValNum));
2752 $1->getInstList().push_back($3);
2758 InstructionList : InstructionList Inst {
2759 if (CastInst *CI1 = dyn_cast<CastInst>($2))
2760 if (CastInst *CI2 = dyn_cast<CastInst>(CI1->getOperand(0)))
2761 if (CI2->getParent() == 0)
2762 $1->getInstList().push_back(CI2);
2763 $1->getInstList().push_back($2);
2767 | /* empty */ { // Empty space between instruction lists
2768 $$ = defineBBVal(ValID::createLocalID(CurFun.NextValNum));
2771 | LABELSTR { // Labelled (named) basic block
2772 $$ = defineBBVal(ValID::createLocalName(*$1));
2779 RET ReturnedVal { // Return with a result...
2780 ValueList &VL = *$2;
2781 assert(!VL.empty() && "Invalid ret operands!");
2782 const Type *ReturnType = CurFun.CurrentFunction->getReturnType();
2783 if (VL.size() > 1 ||
2784 (isa<StructType>(ReturnType) &&
2785 (VL.empty() || VL[0]->getType() != ReturnType))) {
2786 Value *RV = UndefValue::get(ReturnType);
2787 for (unsigned i = 0, e = VL.size(); i != e; ++i) {
2788 Instruction *I = InsertValueInst::Create(RV, VL[i], i, "mrv");
2789 ($<BasicBlockVal>-1)->getInstList().push_back(I);
2792 $$ = ReturnInst::Create(RV);
2794 $$ = ReturnInst::Create(VL[0]);
2799 | RET VOID { // Return with no result...
2800 $$ = ReturnInst::Create();
2803 | BR LABEL ValueRef { // Unconditional Branch...
2804 BasicBlock* tmpBB = getBBVal($3);
2806 $$ = BranchInst::Create(tmpBB);
2807 } // Conditional Branch...
2808 | BR INTTYPE ValueRef ',' LABEL ValueRef ',' LABEL ValueRef {
2809 if (cast<IntegerType>($2)->getBitWidth() != 1)
2810 GEN_ERROR("Branch condition must have type i1");
2811 BasicBlock* tmpBBA = getBBVal($6);
2813 BasicBlock* tmpBBB = getBBVal($9);
2815 Value* tmpVal = getVal(Type::Int1Ty, $3);
2817 $$ = BranchInst::Create(tmpBBA, tmpBBB, tmpVal);
2819 | SWITCH IntType ValueRef ',' LABEL ValueRef '[' JumpTable ']' {
2820 Value* tmpVal = getVal($2, $3);
2822 BasicBlock* tmpBB = getBBVal($6);
2824 SwitchInst *S = SwitchInst::Create(tmpVal, tmpBB, $8->size());
2827 std::vector<std::pair<Constant*,BasicBlock*> >::iterator I = $8->begin(),
2829 for (; I != E; ++I) {
2830 if (ConstantInt *CI = dyn_cast<ConstantInt>(I->first))
2831 S->addCase(CI, I->second);
2833 GEN_ERROR("Switch case is constant, but not a simple integer");
2838 | SWITCH IntType ValueRef ',' LABEL ValueRef '[' ']' {
2839 Value* tmpVal = getVal($2, $3);
2841 BasicBlock* tmpBB = getBBVal($6);
2843 SwitchInst *S = SwitchInst::Create(tmpVal, tmpBB, 0);
2847 | INVOKE OptCallingConv ResultTypes ValueRef '(' ParamList ')' OptFuncAttrs
2848 TO LABEL ValueRef UNWIND LABEL ValueRef {
2850 // Handle the short syntax
2851 const PointerType *PFTy = 0;
2852 const FunctionType *Ty = 0;
2853 if (!(PFTy = dyn_cast<PointerType>($3->get())) ||
2854 !(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) {
2855 // Pull out the types of all of the arguments...
2856 std::vector<const Type*> ParamTypes;
2857 ParamList::iterator I = $6->begin(), E = $6->end();
2858 for (; I != E; ++I) {
2859 const Type *Ty = I->Val->getType();
2860 if (Ty == Type::VoidTy)
2861 GEN_ERROR("Short call syntax cannot be used with varargs");
2862 ParamTypes.push_back(Ty);
2865 if (!FunctionType::isValidReturnType(*$3))
2866 GEN_ERROR("Invalid result type for LLVM function");
2868 Ty = FunctionType::get($3->get(), ParamTypes, false);
2869 PFTy = PointerType::getUnqual(Ty);
2874 Value *V = getVal(PFTy, $4); // Get the function we're calling...
2876 BasicBlock *Normal = getBBVal($11);
2878 BasicBlock *Except = getBBVal($14);
2881 SmallVector<AttributeWithIndex, 8> Attrs;
2882 //FIXME : In 3.0, stop accepting zext, sext and inreg as optional function
2884 Attributes RetAttrs = 0;
2885 if ($8 != Attribute::None) {
2886 if ($8 & Attribute::ZExt) {
2887 RetAttrs = RetAttrs | Attribute::ZExt;
2888 $8 = $8 ^ Attribute::ZExt;
2890 if ($8 & Attribute::SExt) {
2891 RetAttrs = RetAttrs | Attribute::SExt;
2892 $8 = $8 ^ Attribute::SExt;
2894 if ($8 & Attribute::InReg) {
2895 RetAttrs = RetAttrs | Attribute::InReg;
2896 $8 = $8 ^ Attribute::InReg;
2898 if (RetAttrs != Attribute::None)
2899 Attrs.push_back(AttributeWithIndex::get(0, RetAttrs));
2902 // Check the arguments
2904 if ($6->empty()) { // Has no arguments?
2905 // Make sure no arguments is a good thing!
2906 if (Ty->getNumParams() != 0)
2907 GEN_ERROR("No arguments passed to a function that "
2908 "expects arguments");
2909 } else { // Has arguments?
2910 // Loop through FunctionType's arguments and ensure they are specified
2912 FunctionType::param_iterator I = Ty->param_begin();
2913 FunctionType::param_iterator E = Ty->param_end();
2914 ParamList::iterator ArgI = $6->begin(), ArgE = $6->end();
2917 for (; ArgI != ArgE && I != E; ++ArgI, ++I, ++index) {
2918 if (ArgI->Val->getType() != *I)
2919 GEN_ERROR("Parameter " + ArgI->Val->getName()+ " is not of type '" +
2920 (*I)->getDescription() + "'");
2921 Args.push_back(ArgI->Val);
2922 if (ArgI->Attrs != Attribute::None)
2923 Attrs.push_back(AttributeWithIndex::get(index, ArgI->Attrs));
2926 if (Ty->isVarArg()) {
2928 for (; ArgI != ArgE; ++ArgI, ++index) {
2929 Args.push_back(ArgI->Val); // push the remaining varargs
2930 if (ArgI->Attrs != Attribute::None)
2931 Attrs.push_back(AttributeWithIndex::get(index, ArgI->Attrs));
2933 } else if (I != E || ArgI != ArgE)
2934 GEN_ERROR("Invalid number of parameters detected");
2936 if ($8 != Attribute::None)
2937 Attrs.push_back(AttributeWithIndex::get(~0, $8));
2940 PAL = AttrListPtr::get(Attrs.begin(), Attrs.end());
2942 // Create the InvokeInst
2943 InvokeInst *II = InvokeInst::Create(V, Normal, Except,
2944 Args.begin(), Args.end());
2945 II->setCallingConv($2);
2946 II->setAttributes(PAL);
2952 $$ = new UnwindInst();
2956 $$ = new UnreachableInst();
2962 JumpTable : JumpTable IntType ConstValueRef ',' LABEL ValueRef {
2964 Constant *V = cast<Constant>(getExistingVal($2, $3));
2967 GEN_ERROR("May only switch on a constant pool value");
2969 BasicBlock* tmpBB = getBBVal($6);
2971 $$->push_back(std::make_pair(V, tmpBB));
2973 | IntType ConstValueRef ',' LABEL ValueRef {
2974 $$ = new std::vector<std::pair<Constant*, BasicBlock*> >();
2975 Constant *V = cast<Constant>(getExistingVal($1, $2));
2979 GEN_ERROR("May only switch on a constant pool value");
2981 BasicBlock* tmpBB = getBBVal($5);
2983 $$->push_back(std::make_pair(V, tmpBB));
2986 Inst : OptLocalAssign InstVal {
2987 // Is this definition named?? if so, assign the name...
2988 setValueName($2, $1);
2995 Inst : LocalNumber InstVal {
2997 int ValNum = InsertValue($2);
2999 if (ValNum != (int)$1)
3000 GEN_ERROR("Result value number %" + utostr($1) +
3001 " is incorrect, expected %" + utostr((unsigned)ValNum));
3008 PHIList : Types '[' ValueRef ',' ValueRef ']' { // Used for PHI nodes
3009 if (!UpRefs.empty())
3010 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
3011 $$ = new std::list<std::pair<Value*, BasicBlock*> >();
3012 Value* tmpVal = getVal(*$1, $3);
3014 BasicBlock* tmpBB = getBBVal($5);
3016 $$->push_back(std::make_pair(tmpVal, tmpBB));
3019 | PHIList ',' '[' ValueRef ',' ValueRef ']' {
3021 Value* tmpVal = getVal($1->front().first->getType(), $4);
3023 BasicBlock* tmpBB = getBBVal($6);
3025 $1->push_back(std::make_pair(tmpVal, tmpBB));
3029 ParamList : Types OptAttributes ValueRef OptAttributes {
3030 // FIXME: Remove trailing OptAttributes in LLVM 3.0, it was a mistake in 2.0
3031 if (!UpRefs.empty())
3032 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
3033 // Used for call and invoke instructions
3034 $$ = new ParamList();
3035 ParamListEntry E; E.Attrs = $2 | $4; E.Val = getVal($1->get(), $3);
3040 | LABEL OptAttributes ValueRef OptAttributes {
3041 // FIXME: Remove trailing OptAttributes in LLVM 3.0, it was a mistake in 2.0
3042 // Labels are only valid in ASMs
3043 $$ = new ParamList();
3044 ParamListEntry E; E.Attrs = $2 | $4; E.Val = getBBVal($3);
3048 | ParamList ',' Types OptAttributes ValueRef OptAttributes {
3049 // FIXME: Remove trailing OptAttributes in LLVM 3.0, it was a mistake in 2.0
3050 if (!UpRefs.empty())
3051 GEN_ERROR("Invalid upreference in type: " + (*$3)->getDescription());
3053 ParamListEntry E; E.Attrs = $4 | $6; E.Val = getVal($3->get(), $5);
3058 | ParamList ',' LABEL OptAttributes ValueRef OptAttributes {
3059 // FIXME: Remove trailing OptAttributes in LLVM 3.0, it was a mistake in 2.0
3061 ParamListEntry E; E.Attrs = $4 | $6; E.Val = getBBVal($5);
3065 | /*empty*/ { $$ = new ParamList(); };
3067 IndexList // Used for gep instructions and constant expressions
3068 : /*empty*/ { $$ = new std::vector<Value*>(); }
3069 | IndexList ',' ResolvedVal {
3076 ConstantIndexList // Used for insertvalue and extractvalue instructions
3078 $$ = new std::vector<unsigned>();
3079 if ((unsigned)$2 != $2)
3080 GEN_ERROR("Index " + utostr($2) + " is not valid for insertvalue or extractvalue.");
3083 | ConstantIndexList ',' EUINT64VAL {
3085 if ((unsigned)$3 != $3)
3086 GEN_ERROR("Index " + utostr($3) + " is not valid for insertvalue or extractvalue.");
3092 OptTailCall : TAIL CALL {
3101 InstVal : ArithmeticOps Types ValueRef ',' ValueRef {
3102 if (!UpRefs.empty())
3103 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
3104 if (!(*$2)->isInteger() && !(*$2)->isFloatingPoint() &&
3105 !isa<VectorType>((*$2).get()))
3107 "Arithmetic operator requires integer, FP, or packed operands");
3108 Value* val1 = getVal(*$2, $3);
3110 Value* val2 = getVal(*$2, $5);
3112 $$ = BinaryOperator::Create($1, val1, val2);
3114 GEN_ERROR("binary operator returned null");
3117 | LogicalOps Types ValueRef ',' ValueRef {
3118 if (!UpRefs.empty())
3119 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
3120 if (!(*$2)->isInteger()) {
3121 if (!isa<VectorType>($2->get()) ||
3122 !cast<VectorType>($2->get())->getElementType()->isInteger())
3123 GEN_ERROR("Logical operator requires integral operands");
3125 Value* tmpVal1 = getVal(*$2, $3);
3127 Value* tmpVal2 = getVal(*$2, $5);
3129 $$ = BinaryOperator::Create($1, tmpVal1, tmpVal2);
3131 GEN_ERROR("binary operator returned null");
3134 | ICMP IPredicates Types ValueRef ',' ValueRef {
3135 if (!UpRefs.empty())
3136 GEN_ERROR("Invalid upreference in type: " + (*$3)->getDescription());
3137 Value* tmpVal1 = getVal(*$3, $4);
3139 Value* tmpVal2 = getVal(*$3, $6);
3141 $$ = CmpInst::Create($1, $2, tmpVal1, tmpVal2);
3143 GEN_ERROR("icmp operator returned null");
3146 | FCMP FPredicates Types ValueRef ',' ValueRef {
3147 if (!UpRefs.empty())
3148 GEN_ERROR("Invalid upreference in type: " + (*$3)->getDescription());
3149 Value* tmpVal1 = getVal(*$3, $4);
3151 Value* tmpVal2 = getVal(*$3, $6);
3153 $$ = CmpInst::Create($1, $2, tmpVal1, tmpVal2);
3155 GEN_ERROR("fcmp operator returned null");
3158 | VICMP IPredicates Types ValueRef ',' ValueRef {
3159 if (!UpRefs.empty())
3160 GEN_ERROR("Invalid upreference in type: " + (*$3)->getDescription());
3161 if (!isa<VectorType>((*$3).get()))
3162 GEN_ERROR("Scalar types not supported by vicmp instruction");
3163 Value* tmpVal1 = getVal(*$3, $4);
3165 Value* tmpVal2 = getVal(*$3, $6);
3167 $$ = CmpInst::Create($1, $2, tmpVal1, tmpVal2);
3169 GEN_ERROR("vicmp operator returned null");
3172 | VFCMP FPredicates Types ValueRef ',' ValueRef {
3173 if (!UpRefs.empty())
3174 GEN_ERROR("Invalid upreference in type: " + (*$3)->getDescription());
3175 if (!isa<VectorType>((*$3).get()))
3176 GEN_ERROR("Scalar types not supported by vfcmp instruction");
3177 Value* tmpVal1 = getVal(*$3, $4);
3179 Value* tmpVal2 = getVal(*$3, $6);
3181 $$ = CmpInst::Create($1, $2, tmpVal1, tmpVal2);
3183 GEN_ERROR("vfcmp operator returned null");
3186 | CastOps ResolvedVal TO Types {
3187 if (!UpRefs.empty())
3188 GEN_ERROR("Invalid upreference in type: " + (*$4)->getDescription());
3190 const Type* DestTy = $4->get();
3191 if (!CastInst::castIsValid($1, Val, DestTy))
3192 GEN_ERROR("invalid cast opcode for cast from '" +
3193 Val->getType()->getDescription() + "' to '" +
3194 DestTy->getDescription() + "'");
3195 $$ = CastInst::Create($1, Val, DestTy);
3198 | SELECT ResolvedVal ',' ResolvedVal ',' ResolvedVal {
3199 if (isa<VectorType>($2->getType())) {
3201 if (!isa<VectorType>($4->getType())
3202 || !isa<VectorType>($6->getType()) )
3203 GEN_ERROR("vector select value types must be vector types");
3204 const VectorType* cond_type = cast<VectorType>($2->getType());
3205 const VectorType* select_type = cast<VectorType>($4->getType());
3206 if (cond_type->getElementType() != Type::Int1Ty)
3207 GEN_ERROR("vector select condition element type must be boolean");
3208 if (cond_type->getNumElements() != select_type->getNumElements())
3209 GEN_ERROR("vector select number of elements must be the same");
3211 if ($2->getType() != Type::Int1Ty)
3212 GEN_ERROR("select condition must be boolean");
3214 if ($4->getType() != $6->getType())
3215 GEN_ERROR("select value types must match");
3216 $$ = SelectInst::Create($2, $4, $6);
3219 | VAARG ResolvedVal ',' Types {
3220 if (!UpRefs.empty())
3221 GEN_ERROR("Invalid upreference in type: " + (*$4)->getDescription());
3222 $$ = new VAArgInst($2, *$4);
3226 | EXTRACTELEMENT ResolvedVal ',' ResolvedVal {
3227 if (!ExtractElementInst::isValidOperands($2, $4))
3228 GEN_ERROR("Invalid extractelement operands");
3229 $$ = new ExtractElementInst($2, $4);
3232 | INSERTELEMENT ResolvedVal ',' ResolvedVal ',' ResolvedVal {
3233 if (!InsertElementInst::isValidOperands($2, $4, $6))
3234 GEN_ERROR("Invalid insertelement operands");
3235 $$ = InsertElementInst::Create($2, $4, $6);
3238 | SHUFFLEVECTOR ResolvedVal ',' ResolvedVal ',' ResolvedVal {
3239 if (!ShuffleVectorInst::isValidOperands($2, $4, $6))
3240 GEN_ERROR("Invalid shufflevector operands");
3241 $$ = new ShuffleVectorInst($2, $4, $6);
3245 const Type *Ty = $2->front().first->getType();
3246 if (!Ty->isFirstClassType())
3247 GEN_ERROR("PHI node operands must be of first class type");
3248 $$ = PHINode::Create(Ty);
3249 ((PHINode*)$$)->reserveOperandSpace($2->size());
3250 while ($2->begin() != $2->end()) {
3251 if ($2->front().first->getType() != Ty)
3252 GEN_ERROR("All elements of a PHI node must be of the same type");
3253 cast<PHINode>($$)->addIncoming($2->front().first, $2->front().second);
3256 delete $2; // Free the list...
3259 | OptTailCall OptCallingConv ResultTypes ValueRef '(' ParamList ')'
3262 // Handle the short syntax
3263 const PointerType *PFTy = 0;
3264 const FunctionType *Ty = 0;
3265 if (!(PFTy = dyn_cast<PointerType>($3->get())) ||
3266 !(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) {
3267 // Pull out the types of all of the arguments...
3268 std::vector<const Type*> ParamTypes;
3269 ParamList::iterator I = $6->begin(), E = $6->end();
3270 for (; I != E; ++I) {
3271 const Type *Ty = I->Val->getType();
3272 if (Ty == Type::VoidTy)
3273 GEN_ERROR("Short call syntax cannot be used with varargs");
3274 ParamTypes.push_back(Ty);
3277 if (!FunctionType::isValidReturnType(*$3))
3278 GEN_ERROR("Invalid result type for LLVM function");
3280 Ty = FunctionType::get($3->get(), ParamTypes, false);
3281 PFTy = PointerType::getUnqual(Ty);
3284 Value *V = getVal(PFTy, $4); // Get the function we're calling...
3287 // Check for call to invalid intrinsic to avoid crashing later.
3288 if (Function *theF = dyn_cast<Function>(V)) {
3289 if (theF->hasName() && (theF->getValueName()->getKeyLength() >= 5) &&
3290 (0 == strncmp(theF->getValueName()->getKeyData(), "llvm.", 5)) &&
3291 !theF->getIntrinsicID(true))
3292 GEN_ERROR("Call to invalid LLVM intrinsic function '" +
3293 theF->getName() + "'");
3296 // Set up the Attributes for the function
3297 SmallVector<AttributeWithIndex, 8> Attrs;
3298 //FIXME : In 3.0, stop accepting zext, sext and inreg as optional function
3300 Attributes RetAttrs = 0;
3301 Attributes TmpAttr = $8;
3302 if ($8 != Attribute::None) {
3303 if ($8 & Attribute::ZExt) {
3304 RetAttrs = RetAttrs | Attribute::ZExt;
3305 $8 = $8 ^ Attribute::ZExt;
3307 if ($8 & Attribute::SExt) {
3308 RetAttrs = RetAttrs | Attribute::SExt;
3309 $8 = $8 ^ Attribute::SExt;
3311 if ($8 & Attribute::InReg) {
3312 RetAttrs = RetAttrs | Attribute::InReg;
3313 $8 = $8 ^ Attribute::InReg;
3315 if (RetAttrs != Attribute::None)
3316 Attrs.push_back(AttributeWithIndex::get(0, RetAttrs));
3319 // Check the arguments
3321 if ($6->empty()) { // Has no arguments?
3322 // Make sure no arguments is a good thing!
3323 if (Ty->getNumParams() != 0)
3324 GEN_ERROR("No arguments passed to a function that "
3325 "expects arguments");
3326 } else { // Has arguments?
3327 // Loop through FunctionType's arguments and ensure they are specified
3328 // correctly. Also, gather any parameter attributes.
3329 FunctionType::param_iterator I = Ty->param_begin();
3330 FunctionType::param_iterator E = Ty->param_end();
3331 ParamList::iterator ArgI = $6->begin(), ArgE = $6->end();
3334 for (; ArgI != ArgE && I != E; ++ArgI, ++I, ++index) {
3335 if (ArgI->Val->getType() != *I)
3336 GEN_ERROR("Parameter " + ArgI->Val->getName()+ " is not of type '" +
3337 (*I)->getDescription() + "'");
3338 Args.push_back(ArgI->Val);
3339 if (ArgI->Attrs != Attribute::None)
3340 Attrs.push_back(AttributeWithIndex::get(index, ArgI->Attrs));
3342 if (Ty->isVarArg()) {
3344 for (; ArgI != ArgE; ++ArgI, ++index) {
3345 Args.push_back(ArgI->Val); // push the remaining varargs
3346 if (ArgI->Attrs != Attribute::None)
3347 Attrs.push_back(AttributeWithIndex::get(index, ArgI->Attrs));
3349 } else if (I != E || ArgI != ArgE)
3350 GEN_ERROR("Invalid number of parameters detected");
3352 if ($8 != Attribute::None)
3353 Attrs.push_back(AttributeWithIndex::get(~0, $8));
3355 // Finish off the Attributes and check them
3358 PAL = AttrListPtr::get(Attrs.begin(), Attrs.end());
3360 // Create the call node
3361 CallInst *CI = CallInst::Create(V, Args.begin(), Args.end());
3362 CI->setTailCall($1);
3363 CI->setCallingConv($2);
3364 CI->setAttributes(PAL);
3375 OptVolatile : VOLATILE {
3386 MemoryInst : MALLOC Types OptCAlign {
3387 if (!UpRefs.empty())
3388 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
3389 $$ = new MallocInst(*$2, 0, $3);
3393 | MALLOC Types ',' INTTYPE ValueRef OptCAlign {
3394 if (!UpRefs.empty())
3395 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
3396 if ($4 != Type::Int32Ty)
3397 GEN_ERROR("Malloc array size is not a 32-bit integer!");
3398 Value* tmpVal = getVal($4, $5);
3400 $$ = new MallocInst(*$2, tmpVal, $6);
3403 | ALLOCA Types OptCAlign {
3404 if (!UpRefs.empty())
3405 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
3406 $$ = new AllocaInst(*$2, 0, $3);
3410 | ALLOCA Types ',' INTTYPE ValueRef OptCAlign {
3411 if (!UpRefs.empty())
3412 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
3413 if ($4 != Type::Int32Ty)
3414 GEN_ERROR("Alloca array size is not a 32-bit integer!");
3415 Value* tmpVal = getVal($4, $5);
3417 $$ = new AllocaInst(*$2, tmpVal, $6);
3420 | FREE ResolvedVal {
3421 if (!isa<PointerType>($2->getType()))
3422 GEN_ERROR("Trying to free nonpointer type " +
3423 $2->getType()->getDescription() + "");
3424 $$ = new FreeInst($2);
3428 | OptVolatile LOAD Types ValueRef OptCAlign {
3429 if (!UpRefs.empty())
3430 GEN_ERROR("Invalid upreference in type: " + (*$3)->getDescription());
3431 if (!isa<PointerType>($3->get()))
3432 GEN_ERROR("Can't load from nonpointer type: " +
3433 (*$3)->getDescription());
3434 if (!cast<PointerType>($3->get())->getElementType()->isFirstClassType())
3435 GEN_ERROR("Can't load from pointer of non-first-class type: " +
3436 (*$3)->getDescription());
3437 Value* tmpVal = getVal(*$3, $4);
3439 $$ = new LoadInst(tmpVal, "", $1, $5);
3442 | OptVolatile STORE ResolvedVal ',' Types ValueRef OptCAlign {
3443 if (!UpRefs.empty())
3444 GEN_ERROR("Invalid upreference in type: " + (*$5)->getDescription());
3445 const PointerType *PT = dyn_cast<PointerType>($5->get());
3447 GEN_ERROR("Can't store to a nonpointer type: " +
3448 (*$5)->getDescription());
3449 const Type *ElTy = PT->getElementType();
3450 if (ElTy != $3->getType())
3451 GEN_ERROR("Can't store '" + $3->getType()->getDescription() +
3452 "' into space of type '" + ElTy->getDescription() + "'");
3454 Value* tmpVal = getVal(*$5, $6);
3456 $$ = new StoreInst($3, tmpVal, $1, $7);
3459 | GETRESULT Types ValueRef ',' EUINT64VAL {
3460 if (!UpRefs.empty())
3461 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
3462 if (!isa<StructType>($2->get()) && !isa<ArrayType>($2->get()))
3463 GEN_ERROR("getresult insn requires an aggregate operand");
3464 if (!ExtractValueInst::getIndexedType(*$2, $5))
3465 GEN_ERROR("Invalid getresult index for type '" +
3466 (*$2)->getDescription()+ "'");
3468 Value *tmpVal = getVal(*$2, $3);
3470 $$ = ExtractValueInst::Create(tmpVal, $5);
3473 | GETELEMENTPTR Types ValueRef IndexList {
3474 if (!UpRefs.empty())
3475 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
3476 if (!isa<PointerType>($2->get()))
3477 GEN_ERROR("getelementptr insn requires pointer operand");
3479 if (!GetElementPtrInst::getIndexedType(*$2, $4->begin(), $4->end()))
3480 GEN_ERROR("Invalid getelementptr indices for type '" +
3481 (*$2)->getDescription()+ "'");
3482 Value* tmpVal = getVal(*$2, $3);
3484 $$ = GetElementPtrInst::Create(tmpVal, $4->begin(), $4->end());
3488 | EXTRACTVALUE Types ValueRef ConstantIndexList {
3489 if (!UpRefs.empty())
3490 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
3491 if (!isa<StructType>($2->get()) && !isa<ArrayType>($2->get()))
3492 GEN_ERROR("extractvalue insn requires an aggregate operand");
3494 if (!ExtractValueInst::getIndexedType(*$2, $4->begin(), $4->end()))
3495 GEN_ERROR("Invalid extractvalue indices for type '" +
3496 (*$2)->getDescription()+ "'");
3497 Value* tmpVal = getVal(*$2, $3);
3499 $$ = ExtractValueInst::Create(tmpVal, $4->begin(), $4->end());
3503 | INSERTVALUE Types ValueRef ',' Types ValueRef ConstantIndexList {
3504 if (!UpRefs.empty())
3505 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
3506 if (!isa<StructType>($2->get()) && !isa<ArrayType>($2->get()))
3507 GEN_ERROR("extractvalue insn requires an aggregate operand");
3509 if (ExtractValueInst::getIndexedType(*$2, $7->begin(), $7->end()) != $5->get())
3510 GEN_ERROR("Invalid insertvalue indices for type '" +
3511 (*$2)->getDescription()+ "'");
3512 Value* aggVal = getVal(*$2, $3);
3513 Value* tmpVal = getVal(*$5, $6);
3515 $$ = InsertValueInst::Create(aggVal, tmpVal, $7->begin(), $7->end());
3524 // common code from the two 'RunVMAsmParser' functions
3525 static Module* RunParser(Module * M) {
3526 CurModule.CurrentModule = M;
3527 // Check to make sure the parser succeeded
3530 delete ParserResult;
3534 // Emit an error if there are any unresolved types left.
3535 if (!CurModule.LateResolveTypes.empty()) {
3536 const ValID &DID = CurModule.LateResolveTypes.begin()->first;
3537 if (DID.Type == ValID::LocalName) {
3538 GenerateError("Undefined type remains at eof: '"+DID.getName() + "'");
3540 GenerateError("Undefined type remains at eof: #" + itostr(DID.Num));
3543 delete ParserResult;
3547 // Emit an error if there are any unresolved values left.
3548 if (!CurModule.LateResolveValues.empty()) {
3549 Value *V = CurModule.LateResolveValues.back();
3550 std::map<Value*, std::pair<ValID, int> >::iterator I =
3551 CurModule.PlaceHolderInfo.find(V);
3553 if (I != CurModule.PlaceHolderInfo.end()) {
3554 ValID &DID = I->second.first;
3555 if (DID.Type == ValID::LocalName) {
3556 GenerateError("Undefined value remains at eof: "+DID.getName() + "'");
3558 GenerateError("Undefined value remains at eof: #" + itostr(DID.Num));
3561 delete ParserResult;
3566 // Check to make sure that parsing produced a result
3570 // Reset ParserResult variable while saving its value for the result.
3571 Module *Result = ParserResult;
3577 void llvm::GenerateError(const std::string &message, int LineNo) {
3578 if (LineNo == -1) LineNo = LLLgetLineNo();
3579 // TODO: column number in exception
3581 TheParseError->setError(LLLgetFilename(), message, LineNo);
3585 int yyerror(const char *ErrorMsg) {
3586 std::string where = LLLgetFilename() + ":" + utostr(LLLgetLineNo()) + ": ";
3587 std::string errMsg = where + "error: " + std::string(ErrorMsg);
3588 if (yychar != YYEMPTY && yychar != 0) {
3589 errMsg += " while reading token: '";
3590 errMsg += std::string(LLLgetTokenStart(),
3591 LLLgetTokenStart()+LLLgetTokenLength()) + "'";
3593 GenerateError(errMsg);