1 //===-- llvmAsmParser.y - Parser for llvm assembly files --------*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by the LLVM research group and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements the bison parser for LLVM assembly languages files.
12 //===----------------------------------------------------------------------===//
15 #include "ParserInternals.h"
16 #include "llvm/CallingConv.h"
17 #include "llvm/InlineAsm.h"
18 #include "llvm/Instructions.h"
19 #include "llvm/Module.h"
20 #include "llvm/SymbolTable.h"
21 #include "llvm/Support/GetElementPtrTypeIterator.h"
22 #include "llvm/ADT/STLExtras.h"
23 #include "llvm/Support/MathExtras.h"
24 #include "llvm/Support/Streams.h"
29 // The following is a gross hack. In order to rid the libAsmParser library of
30 // exceptions, we have to have a way of getting the yyparse function to go into
31 // an error situation. So, whenever we want an error to occur, the GenerateError
32 // function (see bottom of file) sets TriggerError. Then, at the end of each
33 // production in the grammer we use CHECK_FOR_ERROR which will invoke YYERROR
34 // (a goto) to put YACC in error state. Furthermore, several calls to
35 // GenerateError are made from inside productions and they must simulate the
36 // previous exception behavior by exiting the production immediately. We have
37 // replaced these with the GEN_ERROR macro which calls GeneratError and then
38 // immediately invokes YYERROR. This would be so much cleaner if it was a
39 // recursive descent parser.
40 static bool TriggerError = false;
41 #define CHECK_FOR_ERROR { if (TriggerError) { TriggerError = false; YYABORT; } }
42 #define GEN_ERROR(msg) { GenerateError(msg); YYERROR; }
44 int yyerror(const char *ErrorMsg); // Forward declarations to prevent "implicit
45 int yylex(); // declaration" of xxx warnings.
49 std::string CurFilename;
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) llvm_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
75 ResolveDefinitions(std::map<const Type *,ValueList> &LateResolvers,
76 std::map<const Type *,ValueList> *FutureLateResolvers = 0);
78 static struct PerModuleInfo {
79 Module *CurrentModule;
80 std::map<const Type *, ValueList> Values; // Module level numbered definitions
81 std::map<const Type *,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 Values.clear(); // Clear out function local definitions
128 // GetForwardRefForGlobal - Check to see if there is a forward reference
129 // for this global. If so, remove it from the GlobalRefs map and return it.
130 // If not, just return null.
131 GlobalValue *GetForwardRefForGlobal(const PointerType *PTy, ValID ID) {
132 // Check to see if there is a forward reference to this global variable...
133 // if there is, eliminate it and patch the reference to use the new def'n.
134 GlobalRefsType::iterator I = GlobalRefs.find(std::make_pair(PTy, ID));
135 GlobalValue *Ret = 0;
136 if (I != GlobalRefs.end()) {
144 static struct PerFunctionInfo {
145 Function *CurrentFunction; // Pointer to current function being created
147 std::map<const Type*, ValueList> Values; // Keep track of #'d definitions
148 std::map<const Type*, ValueList> LateResolveValues;
149 bool isDeclare; // Is this function a forward declararation?
150 GlobalValue::LinkageTypes Linkage; // Linkage for forward declaration.
152 /// BBForwardRefs - When we see forward references to basic blocks, keep
153 /// track of them here.
154 std::map<BasicBlock*, std::pair<ValID, int> > BBForwardRefs;
155 std::vector<BasicBlock*> NumberedBlocks;
158 inline PerFunctionInfo() {
161 Linkage = GlobalValue::ExternalLinkage;
164 inline void FunctionStart(Function *M) {
169 void FunctionDone() {
170 NumberedBlocks.clear();
172 // Any forward referenced blocks left?
173 if (!BBForwardRefs.empty()) {
174 GenerateError("Undefined reference to label " +
175 BBForwardRefs.begin()->first->getName());
179 // Resolve all forward references now.
180 ResolveDefinitions(LateResolveValues, &CurModule.LateResolveValues);
182 Values.clear(); // Clear out function local definitions
185 Linkage = GlobalValue::ExternalLinkage;
187 } CurFun; // Info for the current function...
189 static bool inFunctionScope() { return CurFun.CurrentFunction != 0; }
192 //===----------------------------------------------------------------------===//
193 // Code to handle definitions of all the types
194 //===----------------------------------------------------------------------===//
196 static int InsertValue(Value *V,
197 std::map<const Type*,ValueList> &ValueTab = CurFun.Values) {
198 if (V->hasName()) return -1; // Is this a numbered definition?
200 // Yes, insert the value into the value table...
201 ValueList &List = ValueTab[V->getType()];
203 return List.size()-1;
206 static const Type *getTypeVal(const ValID &D, bool DoNotImprovise = false) {
208 case ValID::NumberVal: // Is it a numbered definition?
209 // Module constants occupy the lowest numbered slots...
210 if ((unsigned)D.Num < CurModule.Types.size())
211 return CurModule.Types[(unsigned)D.Num];
213 case ValID::NameVal: // Is it a named definition?
214 if (const Type *N = CurModule.CurrentModule->getTypeByName(D.Name)) {
215 D.destroy(); // Free old strdup'd memory...
220 GenerateError("Internal parser error: Invalid symbol type reference!");
224 // If we reached here, we referenced either a symbol that we don't know about
225 // or an id number that hasn't been read yet. We may be referencing something
226 // forward, so just create an entry to be resolved later and get to it...
228 if (DoNotImprovise) return 0; // Do we just want a null to be returned?
231 if (inFunctionScope()) {
232 if (D.Type == ValID::NameVal) {
233 GenerateError("Reference to an undefined type: '" + D.getName() + "'");
236 GenerateError("Reference to an undefined type: #" + itostr(D.Num));
241 std::map<ValID, PATypeHolder>::iterator I =CurModule.LateResolveTypes.find(D);
242 if (I != CurModule.LateResolveTypes.end())
245 Type *Typ = OpaqueType::get();
246 CurModule.LateResolveTypes.insert(std::make_pair(D, Typ));
250 static Value *lookupInSymbolTable(const Type *Ty, const std::string &Name) {
251 SymbolTable &SymTab =
252 inFunctionScope() ? CurFun.CurrentFunction->getSymbolTable() :
253 CurModule.CurrentModule->getSymbolTable();
254 return SymTab.lookup(Ty, Name);
257 // getValNonImprovising - Look up the value specified by the provided type and
258 // the provided ValID. If the value exists and has already been defined, return
259 // it. Otherwise return null.
261 static Value *getValNonImprovising(const Type *Ty, const ValID &D) {
262 if (isa<FunctionType>(Ty)) {
263 GenerateError("Functions are not values and "
264 "must be referenced as pointers");
269 case ValID::NumberVal: { // Is it a numbered definition?
270 unsigned Num = (unsigned)D.Num;
272 // Module constants occupy the lowest numbered slots...
273 std::map<const Type*,ValueList>::iterator VI = CurModule.Values.find(Ty);
274 if (VI != CurModule.Values.end()) {
275 if (Num < VI->second.size())
276 return VI->second[Num];
277 Num -= VI->second.size();
280 // Make sure that our type is within bounds
281 VI = CurFun.Values.find(Ty);
282 if (VI == CurFun.Values.end()) return 0;
284 // Check that the number is within bounds...
285 if (VI->second.size() <= Num) return 0;
287 return VI->second[Num];
290 case ValID::NameVal: { // Is it a named definition?
291 Value *N = lookupInSymbolTable(Ty, std::string(D.Name));
292 if (N == 0) return 0;
294 D.destroy(); // Free old strdup'd memory...
298 // Check to make sure that "Ty" is an integral type, and that our
299 // value will fit into the specified type...
300 case ValID::ConstSIntVal: // Is it a constant pool reference??
301 if (!ConstantInt::isValueValidForType(Ty, D.ConstPool64)) {
302 GenerateError("Signed integral constant '" +
303 itostr(D.ConstPool64) + "' is invalid for type '" +
304 Ty->getDescription() + "'!");
307 return ConstantInt::get(Ty, D.ConstPool64);
309 case ValID::ConstUIntVal: // Is it an unsigned const pool reference?
310 if (!ConstantInt::isValueValidForType(Ty, D.UConstPool64)) {
311 if (!ConstantInt::isValueValidForType(Ty, D.ConstPool64)) {
312 GenerateError("Integral constant '" + utostr(D.UConstPool64) +
313 "' is invalid or out of range!");
315 } else { // This is really a signed reference. Transmogrify.
316 return ConstantInt::get(Ty, D.ConstPool64);
319 return ConstantInt::get(Ty, D.UConstPool64);
322 case ValID::ConstFPVal: // Is it a floating point const pool reference?
323 if (!ConstantFP::isValueValidForType(Ty, D.ConstPoolFP)) {
324 GenerateError("FP constant invalid for type!!");
327 return ConstantFP::get(Ty, D.ConstPoolFP);
329 case ValID::ConstNullVal: // Is it a null value?
330 if (!isa<PointerType>(Ty)) {
331 GenerateError("Cannot create a a non pointer null!");
334 return ConstantPointerNull::get(cast<PointerType>(Ty));
336 case ValID::ConstUndefVal: // Is it an undef value?
337 return UndefValue::get(Ty);
339 case ValID::ConstZeroVal: // Is it a zero value?
340 return Constant::getNullValue(Ty);
342 case ValID::ConstantVal: // Fully resolved constant?
343 if (D.ConstantValue->getType() != Ty) {
344 GenerateError("Constant expression type different from required type!");
347 return D.ConstantValue;
349 case ValID::InlineAsmVal: { // Inline asm expression
350 const PointerType *PTy = dyn_cast<PointerType>(Ty);
351 const FunctionType *FTy =
352 PTy ? dyn_cast<FunctionType>(PTy->getElementType()) : 0;
353 if (!FTy || !InlineAsm::Verify(FTy, D.IAD->Constraints)) {
354 GenerateError("Invalid type for asm constraint string!");
357 InlineAsm *IA = InlineAsm::get(FTy, D.IAD->AsmString, D.IAD->Constraints,
358 D.IAD->HasSideEffects);
359 D.destroy(); // Free InlineAsmDescriptor.
363 assert(0 && "Unhandled case!");
367 assert(0 && "Unhandled case!");
371 // getVal - This function is identical to getValNonImprovising, except that if a
372 // value is not already defined, it "improvises" by creating a placeholder var
373 // that looks and acts just like the requested variable. When the value is
374 // defined later, all uses of the placeholder variable are replaced with the
377 static Value *getVal(const Type *Ty, const ValID &ID) {
378 if (Ty == Type::LabelTy) {
379 GenerateError("Cannot use a basic block here");
383 // See if the value has already been defined.
384 Value *V = getValNonImprovising(Ty, ID);
386 if (TriggerError) return 0;
388 if (!Ty->isFirstClassType() && !isa<OpaqueType>(Ty)) {
389 GenerateError("Invalid use of a composite type!");
393 // If we reached here, we referenced either a symbol that we don't know about
394 // or an id number that hasn't been read yet. We may be referencing something
395 // forward, so just create an entry to be resolved later and get to it...
397 V = new Argument(Ty);
399 // Remember where this forward reference came from. FIXME, shouldn't we try
400 // to recycle these things??
401 CurModule.PlaceHolderInfo.insert(std::make_pair(V, std::make_pair(ID,
404 if (inFunctionScope())
405 InsertValue(V, CurFun.LateResolveValues);
407 InsertValue(V, CurModule.LateResolveValues);
411 /// getBBVal - This is used for two purposes:
412 /// * If isDefinition is true, a new basic block with the specified ID is being
414 /// * If isDefinition is true, this is a reference to a basic block, which may
415 /// or may not be a forward reference.
417 static BasicBlock *getBBVal(const ValID &ID, bool isDefinition = false) {
418 assert(inFunctionScope() && "Can't get basic block at global scope!");
424 GenerateError("Illegal label reference " + ID.getName());
426 case ValID::NumberVal: // Is it a numbered definition?
427 if (unsigned(ID.Num) >= CurFun.NumberedBlocks.size())
428 CurFun.NumberedBlocks.resize(ID.Num+1);
429 BB = CurFun.NumberedBlocks[ID.Num];
431 case ValID::NameVal: // Is it a named definition?
433 if (Value *N = CurFun.CurrentFunction->
434 getSymbolTable().lookup(Type::LabelTy, Name))
435 BB = cast<BasicBlock>(N);
439 // See if the block has already been defined.
441 // If this is the definition of the block, make sure the existing value was
442 // just a forward reference. If it was a forward reference, there will be
443 // an entry for it in the PlaceHolderInfo map.
444 if (isDefinition && !CurFun.BBForwardRefs.erase(BB)) {
445 // The existing value was a definition, not a forward reference.
446 GenerateError("Redefinition of label " + ID.getName());
450 ID.destroy(); // Free strdup'd memory.
454 // Otherwise this block has not been seen before.
455 BB = new BasicBlock("", CurFun.CurrentFunction);
456 if (ID.Type == ValID::NameVal) {
457 BB->setName(ID.Name);
459 CurFun.NumberedBlocks[ID.Num] = BB;
462 // If this is not a definition, keep track of it so we can use it as a forward
465 // Remember where this forward reference came from.
466 CurFun.BBForwardRefs[BB] = std::make_pair(ID, llvmAsmlineno);
468 // The forward declaration could have been inserted anywhere in the
469 // function: insert it into the correct place now.
470 CurFun.CurrentFunction->getBasicBlockList().remove(BB);
471 CurFun.CurrentFunction->getBasicBlockList().push_back(BB);
478 //===----------------------------------------------------------------------===//
479 // Code to handle forward references in instructions
480 //===----------------------------------------------------------------------===//
482 // This code handles the late binding needed with statements that reference
483 // values not defined yet... for example, a forward branch, or the PHI node for
486 // This keeps a table (CurFun.LateResolveValues) of all such forward references
487 // and back patchs after we are done.
490 // ResolveDefinitions - If we could not resolve some defs at parsing
491 // time (forward branches, phi functions for loops, etc...) resolve the
495 ResolveDefinitions(std::map<const Type*,ValueList> &LateResolvers,
496 std::map<const Type*,ValueList> *FutureLateResolvers) {
497 // Loop over LateResolveDefs fixing up stuff that couldn't be resolved
498 for (std::map<const Type*,ValueList>::iterator LRI = LateResolvers.begin(),
499 E = LateResolvers.end(); LRI != E; ++LRI) {
500 ValueList &List = LRI->second;
501 while (!List.empty()) {
502 Value *V = List.back();
505 std::map<Value*, std::pair<ValID, int> >::iterator PHI =
506 CurModule.PlaceHolderInfo.find(V);
507 assert(PHI != CurModule.PlaceHolderInfo.end() && "Placeholder error!");
509 ValID &DID = PHI->second.first;
511 Value *TheRealValue = getValNonImprovising(LRI->first, DID);
515 V->replaceAllUsesWith(TheRealValue);
517 CurModule.PlaceHolderInfo.erase(PHI);
518 } else if (FutureLateResolvers) {
519 // Functions have their unresolved items forwarded to the module late
521 InsertValue(V, *FutureLateResolvers);
523 if (DID.Type == ValID::NameVal) {
524 GenerateError("Reference to an invalid definition: '" +DID.getName()+
525 "' of type '" + V->getType()->getDescription() + "'",
529 GenerateError("Reference to an invalid definition: #" +
530 itostr(DID.Num) + " of type '" +
531 V->getType()->getDescription() + "'",
539 LateResolvers.clear();
542 // ResolveTypeTo - A brand new type was just declared. This means that (if
543 // name is not null) things referencing Name can be resolved. Otherwise, things
544 // refering to the number can be resolved. Do this now.
546 static void ResolveTypeTo(char *Name, const Type *ToTy) {
548 if (Name) D = ValID::create(Name);
549 else D = ValID::create((int)CurModule.Types.size());
551 std::map<ValID, PATypeHolder>::iterator I =
552 CurModule.LateResolveTypes.find(D);
553 if (I != CurModule.LateResolveTypes.end()) {
554 ((DerivedType*)I->second.get())->refineAbstractTypeTo(ToTy);
555 CurModule.LateResolveTypes.erase(I);
559 // setValueName - Set the specified value to the name given. The name may be
560 // null potentially, in which case this is a noop. The string passed in is
561 // assumed to be a malloc'd string buffer, and is free'd by this function.
563 static void setValueName(Value *V, char *NameStr) {
565 std::string Name(NameStr); // Copy string
566 free(NameStr); // Free old string
568 if (V->getType() == Type::VoidTy) {
569 GenerateError("Can't assign name '" + Name+"' to value with void type!");
573 assert(inFunctionScope() && "Must be in function scope!");
574 SymbolTable &ST = CurFun.CurrentFunction->getSymbolTable();
575 if (ST.lookup(V->getType(), Name)) {
576 GenerateError("Redefinition of value named '" + Name + "' in the '" +
577 V->getType()->getDescription() + "' type plane!");
586 /// ParseGlobalVariable - Handle parsing of a global. If Initializer is null,
587 /// this is a declaration, otherwise it is a definition.
588 static GlobalVariable *
589 ParseGlobalVariable(char *NameStr,GlobalValue::LinkageTypes Linkage,
590 bool isConstantGlobal, const Type *Ty,
591 Constant *Initializer) {
592 if (isa<FunctionType>(Ty)) {
593 GenerateError("Cannot declare global vars of function type!");
597 const PointerType *PTy = PointerType::get(Ty);
601 Name = NameStr; // Copy string
602 free(NameStr); // Free old string
605 // See if this global value was forward referenced. If so, recycle the
609 ID = ValID::create((char*)Name.c_str());
611 ID = ValID::create((int)CurModule.Values[PTy].size());
614 if (GlobalValue *FWGV = CurModule.GetForwardRefForGlobal(PTy, ID)) {
615 // Move the global to the end of the list, from whereever it was
616 // previously inserted.
617 GlobalVariable *GV = cast<GlobalVariable>(FWGV);
618 CurModule.CurrentModule->getGlobalList().remove(GV);
619 CurModule.CurrentModule->getGlobalList().push_back(GV);
620 GV->setInitializer(Initializer);
621 GV->setLinkage(Linkage);
622 GV->setConstant(isConstantGlobal);
623 InsertValue(GV, CurModule.Values);
627 // If this global has a name, check to see if there is already a definition
628 // of this global in the module. If so, merge as appropriate. Note that
629 // this is really just a hack around problems in the CFE. :(
631 // We are a simple redefinition of a value, check to see if it is defined
632 // the same as the old one.
633 if (GlobalVariable *EGV =
634 CurModule.CurrentModule->getGlobalVariable(Name, Ty)) {
635 // We are allowed to redefine a global variable in two circumstances:
636 // 1. If at least one of the globals is uninitialized or
637 // 2. If both initializers have the same value.
639 if (!EGV->hasInitializer() || !Initializer ||
640 EGV->getInitializer() == Initializer) {
642 // Make sure the existing global version gets the initializer! Make
643 // sure that it also gets marked const if the new version is.
644 if (Initializer && !EGV->hasInitializer())
645 EGV->setInitializer(Initializer);
646 if (isConstantGlobal)
647 EGV->setConstant(true);
648 EGV->setLinkage(Linkage);
652 GenerateError("Redefinition of global variable named '" + Name +
653 "' in the '" + Ty->getDescription() + "' type plane!");
658 // Otherwise there is no existing GV to use, create one now.
660 new GlobalVariable(Ty, isConstantGlobal, Linkage, Initializer, Name,
661 CurModule.CurrentModule);
662 InsertValue(GV, CurModule.Values);
666 // setTypeName - Set the specified type to the name given. The name may be
667 // null potentially, in which case this is a noop. The string passed in is
668 // assumed to be a malloc'd string buffer, and is freed by this function.
670 // This function returns true if the type has already been defined, but is
671 // allowed to be redefined in the specified context. If the name is a new name
672 // for the type plane, it is inserted and false is returned.
673 static bool setTypeName(const Type *T, char *NameStr) {
674 assert(!inFunctionScope() && "Can't give types function-local names!");
675 if (NameStr == 0) return false;
677 std::string Name(NameStr); // Copy string
678 free(NameStr); // Free old string
680 // We don't allow assigning names to void type
681 if (T == Type::VoidTy) {
682 GenerateError("Can't assign name '" + Name + "' to the void type!");
686 // Set the type name, checking for conflicts as we do so.
687 bool AlreadyExists = CurModule.CurrentModule->addTypeName(Name, T);
689 if (AlreadyExists) { // Inserting a name that is already defined???
690 const Type *Existing = CurModule.CurrentModule->getTypeByName(Name);
691 assert(Existing && "Conflict but no matching type?");
693 // There is only one case where this is allowed: when we are refining an
694 // opaque type. In this case, Existing will be an opaque type.
695 if (const OpaqueType *OpTy = dyn_cast<OpaqueType>(Existing)) {
696 // We ARE replacing an opaque type!
697 const_cast<OpaqueType*>(OpTy)->refineAbstractTypeTo(T);
701 // Otherwise, this is an attempt to redefine a type. That's okay if
702 // the redefinition is identical to the original. This will be so if
703 // Existing and T point to the same Type object. In this one case we
704 // allow the equivalent redefinition.
705 if (Existing == T) return true; // Yes, it's equal.
707 // Any other kind of (non-equivalent) redefinition is an error.
708 GenerateError("Redefinition of type named '" + Name + "' in the '" +
709 T->getDescription() + "' type plane!");
715 //===----------------------------------------------------------------------===//
716 // Code for handling upreferences in type names...
719 // TypeContains - Returns true if Ty directly contains E in it.
721 static bool TypeContains(const Type *Ty, const Type *E) {
722 return std::find(Ty->subtype_begin(), Ty->subtype_end(),
723 E) != Ty->subtype_end();
728 // NestingLevel - The number of nesting levels that need to be popped before
729 // this type is resolved.
730 unsigned NestingLevel;
732 // LastContainedTy - This is the type at the current binding level for the
733 // type. Every time we reduce the nesting level, this gets updated.
734 const Type *LastContainedTy;
736 // UpRefTy - This is the actual opaque type that the upreference is
740 UpRefRecord(unsigned NL, OpaqueType *URTy)
741 : NestingLevel(NL), LastContainedTy(URTy), UpRefTy(URTy) {}
745 // UpRefs - A list of the outstanding upreferences that need to be resolved.
746 static std::vector<UpRefRecord> UpRefs;
748 /// HandleUpRefs - Every time we finish a new layer of types, this function is
749 /// called. It loops through the UpRefs vector, which is a list of the
750 /// currently active types. For each type, if the up reference is contained in
751 /// the newly completed type, we decrement the level count. When the level
752 /// count reaches zero, the upreferenced type is the type that is passed in:
753 /// thus we can complete the cycle.
755 static PATypeHolder HandleUpRefs(const Type *ty) {
756 // If Ty isn't abstract, or if there are no up-references in it, then there is
757 // nothing to resolve here.
758 if (!ty->isAbstract() || UpRefs.empty()) return ty;
761 UR_OUT("Type '" << Ty->getDescription() <<
762 "' newly formed. Resolving upreferences.\n" <<
763 UpRefs.size() << " upreferences active!\n");
765 // If we find any resolvable upreferences (i.e., those whose NestingLevel goes
766 // to zero), we resolve them all together before we resolve them to Ty. At
767 // the end of the loop, if there is anything to resolve to Ty, it will be in
769 OpaqueType *TypeToResolve = 0;
771 for (unsigned i = 0; i != UpRefs.size(); ++i) {
772 UR_OUT(" UR#" << i << " - TypeContains(" << Ty->getDescription() << ", "
773 << UpRefs[i].second->getDescription() << ") = "
774 << (TypeContains(Ty, UpRefs[i].second) ? "true" : "false") << "\n");
775 if (TypeContains(Ty, UpRefs[i].LastContainedTy)) {
776 // Decrement level of upreference
777 unsigned Level = --UpRefs[i].NestingLevel;
778 UpRefs[i].LastContainedTy = Ty;
779 UR_OUT(" Uplevel Ref Level = " << Level << "\n");
780 if (Level == 0) { // Upreference should be resolved!
781 if (!TypeToResolve) {
782 TypeToResolve = UpRefs[i].UpRefTy;
784 UR_OUT(" * Resolving upreference for "
785 << UpRefs[i].second->getDescription() << "\n";
786 std::string OldName = UpRefs[i].UpRefTy->getDescription());
787 UpRefs[i].UpRefTy->refineAbstractTypeTo(TypeToResolve);
788 UR_OUT(" * Type '" << OldName << "' refined upreference to: "
789 << (const void*)Ty << ", " << Ty->getDescription() << "\n");
791 UpRefs.erase(UpRefs.begin()+i); // Remove from upreference list...
792 --i; // Do not skip the next element...
798 UR_OUT(" * Resolving upreference for "
799 << UpRefs[i].second->getDescription() << "\n";
800 std::string OldName = TypeToResolve->getDescription());
801 TypeToResolve->refineAbstractTypeTo(Ty);
807 // common code from the two 'RunVMAsmParser' functions
808 static Module* RunParser(Module * M) {
810 llvmAsmlineno = 1; // Reset the current line number...
811 CurModule.CurrentModule = M;
813 // Check to make sure the parser succeeded
820 // Check to make sure that parsing produced a result
824 // Reset ParserResult variable while saving its value for the result.
825 Module *Result = ParserResult;
831 //===----------------------------------------------------------------------===//
832 // RunVMAsmParser - Define an interface to this parser
833 //===----------------------------------------------------------------------===//
835 Module *llvm::RunVMAsmParser(const std::string &Filename, FILE *F) {
838 CurFilename = Filename;
839 return RunParser(new Module(CurFilename));
842 Module *llvm::RunVMAsmParser(const char * AsmString, Module * M) {
843 set_scan_string(AsmString);
845 CurFilename = "from_memory";
847 return RunParser(new Module (CurFilename));
856 llvm::Module *ModuleVal;
857 llvm::Function *FunctionVal;
858 std::pair<llvm::PATypeHolder*, char*> *ArgVal;
859 llvm::BasicBlock *BasicBlockVal;
860 llvm::TerminatorInst *TermInstVal;
861 llvm::Instruction *InstVal;
862 llvm::Constant *ConstVal;
864 const llvm::Type *PrimType;
865 llvm::PATypeHolder *TypeVal;
866 llvm::Value *ValueVal;
868 std::vector<std::pair<llvm::PATypeHolder*,char*> > *ArgList;
869 std::vector<llvm::Value*> *ValueList;
870 std::list<llvm::PATypeHolder> *TypeList;
871 // Represent the RHS of PHI node
872 std::list<std::pair<llvm::Value*,
873 llvm::BasicBlock*> > *PHIList;
874 std::vector<std::pair<llvm::Constant*, llvm::BasicBlock*> > *JumpTable;
875 std::vector<llvm::Constant*> *ConstVector;
877 llvm::GlobalValue::LinkageTypes Linkage;
885 char *StrVal; // This memory is strdup'd!
886 llvm::ValID ValIDVal; // strdup'd memory maybe!
888 llvm::Instruction::BinaryOps BinaryOpVal;
889 llvm::Instruction::TermOps TermOpVal;
890 llvm::Instruction::MemoryOps MemOpVal;
891 llvm::Instruction::CastOps CastOpVal;
892 llvm::Instruction::OtherOps OtherOpVal;
893 llvm::Module::Endianness Endianness;
894 llvm::ICmpInst::Predicate IPredicate;
895 llvm::FCmpInst::Predicate FPredicate;
898 %type <ModuleVal> Module FunctionList
899 %type <FunctionVal> Function FunctionProto FunctionHeader BasicBlockList
900 %type <BasicBlockVal> BasicBlock InstructionList
901 %type <TermInstVal> BBTerminatorInst
902 %type <InstVal> Inst InstVal MemoryInst
903 %type <ConstVal> ConstVal ConstExpr
904 %type <ConstVector> ConstVector
905 %type <ArgList> ArgList ArgListH
906 %type <ArgVal> ArgVal
907 %type <PHIList> PHIList
908 %type <ValueList> ValueRefList ValueRefListE // For call param lists
909 %type <ValueList> IndexList // For GEP derived indices
910 %type <TypeList> TypeListI ArgTypeListI
911 %type <JumpTable> JumpTable
912 %type <BoolVal> GlobalType // GLOBAL or CONSTANT?
913 %type <BoolVal> OptVolatile // 'volatile' or not
914 %type <BoolVal> OptTailCall // TAIL CALL or plain CALL.
915 %type <BoolVal> OptSideEffect // 'sideeffect' or not.
916 %type <Linkage> OptLinkage
917 %type <Endianness> BigOrLittle
919 // ValueRef - Unresolved reference to a definition or BB
920 %type <ValIDVal> ValueRef ConstValueRef SymbolicValueRef
921 %type <ValueVal> ResolvedVal // <type> <valref> pair
922 // Tokens and types for handling constant integer values
924 // ESINT64VAL - A negative number within long long range
925 %token <SInt64Val> ESINT64VAL
927 // EUINT64VAL - A positive number within uns. long long range
928 %token <UInt64Val> EUINT64VAL
929 %type <SInt64Val> EINT64VAL
931 %token <SIntVal> SINTVAL // Signed 32 bit ints...
932 %token <UIntVal> UINTVAL // Unsigned 32 bit ints...
933 %type <SIntVal> INTVAL
934 %token <FPVal> FPVAL // Float or Double constant
937 %type <TypeVal> Types TypesV UpRTypes UpRTypesV
938 %type <PrimType> SIntType UIntType IntType FPType PrimType // Classifications
939 %token <PrimType> VOID BOOL SBYTE UBYTE SHORT USHORT INT UINT LONG ULONG
940 %token <PrimType> FLOAT DOUBLE TYPE LABEL
942 %token <StrVal> VAR_ID LABELSTR STRINGCONSTANT
943 %type <StrVal> Name OptName OptAssign
944 %type <UIntVal> OptAlign OptCAlign
945 %type <StrVal> OptSection SectionString
947 %token IMPLEMENTATION ZEROINITIALIZER TRUETOK FALSETOK BEGINTOK ENDTOK
948 %token DECLARE GLOBAL CONSTANT SECTION VOLATILE
949 %token TO DOTDOTDOT NULL_TOK UNDEF CONST INTERNAL LINKONCE WEAK APPENDING
950 %token DLLIMPORT DLLEXPORT EXTERN_WEAK
951 %token OPAQUE NOT EXTERNAL TARGET TRIPLE ENDIAN POINTERSIZE LITTLE BIG ALIGN
952 %token DEPLIBS CALL TAIL ASM_TOK MODULE SIDEEFFECT
953 %token CC_TOK CCC_TOK CSRETCC_TOK FASTCC_TOK COLDCC_TOK
954 %token X86_STDCALLCC_TOK X86_FASTCALLCC_TOK
956 %type <UIntVal> OptCallingConv
958 // Basic Block Terminating Operators
959 %token <TermOpVal> RET BR SWITCH INVOKE UNWIND UNREACHABLE
962 %type <BinaryOpVal> ArithmeticOps LogicalOps SetCondOps // Binops Subcatagories
963 %token <BinaryOpVal> ADD SUB MUL UDIV SDIV FDIV UREM SREM FREM AND OR XOR
964 %token <BinaryOpVal> SETLE SETGE SETLT SETGT SETEQ SETNE // Binary Comparators
965 %token <OtherOpVal> ICMP FCMP
966 %type <IPredicate> IPredicates
967 %type <FPredicate> FPredicates
968 %token EQ NE SLT SGT SLE SGE ULT UGT ULE UGE
969 %token OEQ ONE OLT OGT OLE OGE ORD UNO UEQ UNE
971 // Memory Instructions
972 %token <MemOpVal> MALLOC ALLOCA FREE LOAD STORE GETELEMENTPTR
975 %type <CastOpVal> CastOps
976 %token <CastOpVal> TRUNC ZEXT SEXT FPTRUNC FPEXT BITCAST
977 %token <CastOpVal> UITOFP SITOFP FPTOUI FPTOSI INTTOPTR PTRTOINT
980 %type <OtherOpVal> ShiftOps
981 %token <OtherOpVal> PHI_TOK SELECT SHL LSHR ASHR VAARG
982 %token <OtherOpVal> EXTRACTELEMENT INSERTELEMENT SHUFFLEVECTOR
988 // Handle constant integer size restriction and conversion...
992 if ($1 > (uint32_t)INT32_MAX) // Outside of my range!
993 GEN_ERROR("Value too large for type!");
999 EINT64VAL : ESINT64VAL; // These have same type and can't cause problems...
1000 EINT64VAL : EUINT64VAL {
1001 if ($1 > (uint64_t)INT64_MAX) // Outside of my range!
1002 GEN_ERROR("Value too large for type!");
1007 // Operations that are notably excluded from this list include:
1008 // RET, BR, & SWITCH because they end basic blocks and are treated specially.
1010 ArithmeticOps: ADD | SUB | MUL | UDIV | SDIV | FDIV | UREM | SREM | FREM;
1011 LogicalOps : AND | OR | XOR;
1012 SetCondOps : SETLE | SETGE | SETLT | SETGT | SETEQ | SETNE;
1013 CastOps : TRUNC | ZEXT | SEXT | FPTRUNC | FPEXT | BITCAST |
1014 UITOFP | SITOFP | FPTOUI | FPTOSI | INTTOPTR | PTRTOINT;
1015 ShiftOps : SHL | LSHR | ASHR;
1017 : EQ { $$ = ICmpInst::ICMP_EQ; } | NE { $$ = ICmpInst::ICMP_NE; }
1018 | SLT { $$ = ICmpInst::ICMP_SLT; } | SGT { $$ = ICmpInst::ICMP_SGT; }
1019 | SLE { $$ = ICmpInst::ICMP_SLE; } | SGE { $$ = ICmpInst::ICMP_SGE; }
1020 | ULT { $$ = ICmpInst::ICMP_ULT; } | UGT { $$ = ICmpInst::ICMP_UGT; }
1021 | ULE { $$ = ICmpInst::ICMP_ULE; } | UGE { $$ = ICmpInst::ICMP_UGE; }
1025 : OEQ { $$ = FCmpInst::FCMP_OEQ; } | ONE { $$ = FCmpInst::FCMP_ONE; }
1026 | OLT { $$ = FCmpInst::FCMP_OLT; } | OGT { $$ = FCmpInst::FCMP_OGT; }
1027 | OLE { $$ = FCmpInst::FCMP_OLE; } | OGE { $$ = FCmpInst::FCMP_OGE; }
1028 | ORD { $$ = FCmpInst::FCMP_ORD; } | UNO { $$ = FCmpInst::FCMP_UNO; }
1029 | UEQ { $$ = FCmpInst::FCMP_UEQ; } | UNE { $$ = FCmpInst::FCMP_UNE; }
1030 | ULT { $$ = FCmpInst::FCMP_ULT; } | UGT { $$ = FCmpInst::FCMP_UGT; }
1031 | ULE { $$ = FCmpInst::FCMP_ULE; } | UGE { $$ = FCmpInst::FCMP_UGE; }
1032 | TRUETOK { $$ = FCmpInst::FCMP_TRUE; }
1033 | FALSETOK { $$ = FCmpInst::FCMP_FALSE; }
1036 // These are some types that allow classification if we only want a particular
1037 // thing... for example, only a signed, unsigned, or integral type.
1038 SIntType : LONG | INT | SHORT | SBYTE;
1039 UIntType : ULONG | UINT | USHORT | UBYTE;
1040 IntType : SIntType | UIntType;
1041 FPType : FLOAT | DOUBLE;
1043 // OptAssign - Value producing statements have an optional assignment component
1044 OptAssign : Name '=' {
1053 OptLinkage : INTERNAL { $$ = GlobalValue::InternalLinkage; } |
1054 LINKONCE { $$ = GlobalValue::LinkOnceLinkage; } |
1055 WEAK { $$ = GlobalValue::WeakLinkage; } |
1056 APPENDING { $$ = GlobalValue::AppendingLinkage; } |
1057 DLLIMPORT { $$ = GlobalValue::DLLImportLinkage; } |
1058 DLLEXPORT { $$ = GlobalValue::DLLExportLinkage; } |
1059 EXTERN_WEAK { $$ = GlobalValue::ExternalWeakLinkage; } |
1060 /*empty*/ { $$ = GlobalValue::ExternalLinkage; };
1062 OptCallingConv : /*empty*/ { $$ = CallingConv::C; } |
1063 CCC_TOK { $$ = CallingConv::C; } |
1064 CSRETCC_TOK { $$ = CallingConv::CSRet; } |
1065 FASTCC_TOK { $$ = CallingConv::Fast; } |
1066 COLDCC_TOK { $$ = CallingConv::Cold; } |
1067 X86_STDCALLCC_TOK { $$ = CallingConv::X86_StdCall; } |
1068 X86_FASTCALLCC_TOK { $$ = CallingConv::X86_FastCall; } |
1070 if ((unsigned)$2 != $2)
1071 GEN_ERROR("Calling conv too large!");
1076 // OptAlign/OptCAlign - An optional alignment, and an optional alignment with
1077 // a comma before it.
1078 OptAlign : /*empty*/ { $$ = 0; } |
1081 if ($$ != 0 && !isPowerOf2_32($$))
1082 GEN_ERROR("Alignment must be a power of two!");
1085 OptCAlign : /*empty*/ { $$ = 0; } |
1086 ',' ALIGN EUINT64VAL {
1088 if ($$ != 0 && !isPowerOf2_32($$))
1089 GEN_ERROR("Alignment must be a power of two!");
1094 SectionString : SECTION STRINGCONSTANT {
1095 for (unsigned i = 0, e = strlen($2); i != e; ++i)
1096 if ($2[i] == '"' || $2[i] == '\\')
1097 GEN_ERROR("Invalid character in section name!");
1102 OptSection : /*empty*/ { $$ = 0; } |
1103 SectionString { $$ = $1; };
1105 // GlobalVarAttributes - Used to pass the attributes string on a global. CurGV
1106 // is set to be the global we are processing.
1108 GlobalVarAttributes : /* empty */ {} |
1109 ',' GlobalVarAttribute GlobalVarAttributes {};
1110 GlobalVarAttribute : SectionString {
1111 CurGV->setSection($1);
1115 | ALIGN EUINT64VAL {
1116 if ($2 != 0 && !isPowerOf2_32($2))
1117 GEN_ERROR("Alignment must be a power of two!");
1118 CurGV->setAlignment($2);
1122 //===----------------------------------------------------------------------===//
1123 // Types includes all predefined types... except void, because it can only be
1124 // used in specific contexts (function returning void for example). To have
1125 // access to it, a user must explicitly use TypesV.
1128 // TypesV includes all of 'Types', but it also includes the void type.
1129 TypesV : Types | VOID { $$ = new PATypeHolder($1); };
1130 UpRTypesV : UpRTypes | VOID { $$ = new PATypeHolder($1); };
1133 if (!UpRefs.empty())
1134 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1140 // Derived types are added later...
1142 PrimType : BOOL | SBYTE | UBYTE | SHORT | USHORT | INT | UINT ;
1143 PrimType : LONG | ULONG | FLOAT | DOUBLE | TYPE | LABEL;
1145 $$ = new PATypeHolder(OpaqueType::get());
1149 $$ = new PATypeHolder($1);
1152 UpRTypes : SymbolicValueRef { // Named types are also simple types...
1153 const Type* tmp = getTypeVal($1);
1155 $$ = new PATypeHolder(tmp);
1158 // Include derived types in the Types production.
1160 UpRTypes : '\\' EUINT64VAL { // Type UpReference
1161 if ($2 > (uint64_t)~0U) GEN_ERROR("Value out of range!");
1162 OpaqueType *OT = OpaqueType::get(); // Use temporary placeholder
1163 UpRefs.push_back(UpRefRecord((unsigned)$2, OT)); // Add to vector...
1164 $$ = new PATypeHolder(OT);
1165 UR_OUT("New Upreference!\n");
1168 | UpRTypesV '(' ArgTypeListI ')' { // Function derived type?
1169 std::vector<const Type*> Params;
1170 for (std::list<llvm::PATypeHolder>::iterator I = $3->begin(),
1171 E = $3->end(); I != E; ++I)
1172 Params.push_back(*I);
1173 bool isVarArg = Params.size() && Params.back() == Type::VoidTy;
1174 if (isVarArg) Params.pop_back();
1176 $$ = new PATypeHolder(HandleUpRefs(FunctionType::get(*$1,Params,isVarArg)));
1177 delete $3; // Delete the argument list
1178 delete $1; // Delete the return type handle
1181 | '[' EUINT64VAL 'x' UpRTypes ']' { // Sized array type?
1182 $$ = new PATypeHolder(HandleUpRefs(ArrayType::get(*$4, (unsigned)$2)));
1186 | '<' EUINT64VAL 'x' UpRTypes '>' { // Packed array type?
1187 const llvm::Type* ElemTy = $4->get();
1188 if ((unsigned)$2 != $2)
1189 GEN_ERROR("Unsigned result not equal to signed result");
1190 if (!ElemTy->isPrimitiveType())
1191 GEN_ERROR("Elemental type of a PackedType must be primitive");
1192 if (!isPowerOf2_32($2))
1193 GEN_ERROR("Vector length should be a power of 2!");
1194 $$ = new PATypeHolder(HandleUpRefs(PackedType::get(*$4, (unsigned)$2)));
1198 | '{' TypeListI '}' { // Structure type?
1199 std::vector<const Type*> Elements;
1200 for (std::list<llvm::PATypeHolder>::iterator I = $2->begin(),
1201 E = $2->end(); I != E; ++I)
1202 Elements.push_back(*I);
1204 $$ = new PATypeHolder(HandleUpRefs(StructType::get(Elements)));
1208 | '{' '}' { // Empty structure type?
1209 $$ = new PATypeHolder(StructType::get(std::vector<const Type*>()));
1212 | UpRTypes '*' { // Pointer type?
1213 if (*$1 == Type::LabelTy)
1214 GEN_ERROR("Cannot form a pointer to a basic block");
1215 $$ = new PATypeHolder(HandleUpRefs(PointerType::get(*$1)));
1220 // TypeList - Used for struct declarations and as a basis for function type
1221 // declaration type lists
1223 TypeListI : UpRTypes {
1224 $$ = new std::list<PATypeHolder>();
1225 $$->push_back(*$1); delete $1;
1228 | TypeListI ',' UpRTypes {
1229 ($$=$1)->push_back(*$3); delete $3;
1233 // ArgTypeList - List of types for a function type declaration...
1234 ArgTypeListI : TypeListI
1235 | TypeListI ',' DOTDOTDOT {
1236 ($$=$1)->push_back(Type::VoidTy);
1240 ($$ = new std::list<PATypeHolder>())->push_back(Type::VoidTy);
1244 $$ = new std::list<PATypeHolder>();
1248 // ConstVal - The various declarations that go into the constant pool. This
1249 // production is used ONLY to represent constants that show up AFTER a 'const',
1250 // 'constant' or 'global' token at global scope. Constants that can be inlined
1251 // into other expressions (such as integers and constexprs) are handled by the
1252 // ResolvedVal, ValueRef and ConstValueRef productions.
1254 ConstVal: Types '[' ConstVector ']' { // Nonempty unsized arr
1255 const ArrayType *ATy = dyn_cast<ArrayType>($1->get());
1257 GEN_ERROR("Cannot make array constant with type: '" +
1258 (*$1)->getDescription() + "'!");
1259 const Type *ETy = ATy->getElementType();
1260 int NumElements = ATy->getNumElements();
1262 // Verify that we have the correct size...
1263 if (NumElements != -1 && NumElements != (int)$3->size())
1264 GEN_ERROR("Type mismatch: constant sized array initialized with " +
1265 utostr($3->size()) + " arguments, but has size of " +
1266 itostr(NumElements) + "!");
1268 // Verify all elements are correct type!
1269 for (unsigned i = 0; i < $3->size(); i++) {
1270 if (ETy != (*$3)[i]->getType())
1271 GEN_ERROR("Element #" + utostr(i) + " is not of type '" +
1272 ETy->getDescription() +"' as required!\nIt is of type '"+
1273 (*$3)[i]->getType()->getDescription() + "'.");
1276 $$ = ConstantArray::get(ATy, *$3);
1277 delete $1; delete $3;
1281 const ArrayType *ATy = dyn_cast<ArrayType>($1->get());
1283 GEN_ERROR("Cannot make array constant with type: '" +
1284 (*$1)->getDescription() + "'!");
1286 int NumElements = ATy->getNumElements();
1287 if (NumElements != -1 && NumElements != 0)
1288 GEN_ERROR("Type mismatch: constant sized array initialized with 0"
1289 " arguments, but has size of " + itostr(NumElements) +"!");
1290 $$ = ConstantArray::get(ATy, std::vector<Constant*>());
1294 | Types 'c' STRINGCONSTANT {
1295 const ArrayType *ATy = dyn_cast<ArrayType>($1->get());
1297 GEN_ERROR("Cannot make array constant with type: '" +
1298 (*$1)->getDescription() + "'!");
1300 int NumElements = ATy->getNumElements();
1301 const Type *ETy = ATy->getElementType();
1302 char *EndStr = UnEscapeLexed($3, true);
1303 if (NumElements != -1 && NumElements != (EndStr-$3))
1304 GEN_ERROR("Can't build string constant of size " +
1305 itostr((int)(EndStr-$3)) +
1306 " when array has size " + itostr(NumElements) + "!");
1307 std::vector<Constant*> Vals;
1308 if (ETy == Type::SByteTy) {
1309 for (signed char *C = (signed char *)$3; C != (signed char *)EndStr; ++C)
1310 Vals.push_back(ConstantInt::get(ETy, *C));
1311 } else if (ETy == Type::UByteTy) {
1312 for (unsigned char *C = (unsigned char *)$3;
1313 C != (unsigned char*)EndStr; ++C)
1314 Vals.push_back(ConstantInt::get(ETy, *C));
1317 GEN_ERROR("Cannot build string arrays of non byte sized elements!");
1320 $$ = ConstantArray::get(ATy, Vals);
1324 | Types '<' ConstVector '>' { // Nonempty unsized arr
1325 const PackedType *PTy = dyn_cast<PackedType>($1->get());
1327 GEN_ERROR("Cannot make packed constant with type: '" +
1328 (*$1)->getDescription() + "'!");
1329 const Type *ETy = PTy->getElementType();
1330 int NumElements = PTy->getNumElements();
1332 // Verify that we have the correct size...
1333 if (NumElements != -1 && NumElements != (int)$3->size())
1334 GEN_ERROR("Type mismatch: constant sized packed initialized with " +
1335 utostr($3->size()) + " arguments, but has size of " +
1336 itostr(NumElements) + "!");
1338 // Verify all elements are correct type!
1339 for (unsigned i = 0; i < $3->size(); i++) {
1340 if (ETy != (*$3)[i]->getType())
1341 GEN_ERROR("Element #" + utostr(i) + " is not of type '" +
1342 ETy->getDescription() +"' as required!\nIt is of type '"+
1343 (*$3)[i]->getType()->getDescription() + "'.");
1346 $$ = ConstantPacked::get(PTy, *$3);
1347 delete $1; delete $3;
1350 | Types '{' ConstVector '}' {
1351 const StructType *STy = dyn_cast<StructType>($1->get());
1353 GEN_ERROR("Cannot make struct constant with type: '" +
1354 (*$1)->getDescription() + "'!");
1356 if ($3->size() != STy->getNumContainedTypes())
1357 GEN_ERROR("Illegal number of initializers for structure type!");
1359 // Check to ensure that constants are compatible with the type initializer!
1360 for (unsigned i = 0, e = $3->size(); i != e; ++i)
1361 if ((*$3)[i]->getType() != STy->getElementType(i))
1362 GEN_ERROR("Expected type '" +
1363 STy->getElementType(i)->getDescription() +
1364 "' for element #" + utostr(i) +
1365 " of structure initializer!");
1367 $$ = ConstantStruct::get(STy, *$3);
1368 delete $1; delete $3;
1372 const StructType *STy = dyn_cast<StructType>($1->get());
1374 GEN_ERROR("Cannot make struct constant with type: '" +
1375 (*$1)->getDescription() + "'!");
1377 if (STy->getNumContainedTypes() != 0)
1378 GEN_ERROR("Illegal number of initializers for structure type!");
1380 $$ = ConstantStruct::get(STy, std::vector<Constant*>());
1385 const PointerType *PTy = dyn_cast<PointerType>($1->get());
1387 GEN_ERROR("Cannot make null pointer constant with type: '" +
1388 (*$1)->getDescription() + "'!");
1390 $$ = ConstantPointerNull::get(PTy);
1395 $$ = UndefValue::get($1->get());
1399 | Types SymbolicValueRef {
1400 const PointerType *Ty = dyn_cast<PointerType>($1->get());
1402 GEN_ERROR("Global const reference must be a pointer type!");
1404 // ConstExprs can exist in the body of a function, thus creating
1405 // GlobalValues whenever they refer to a variable. Because we are in
1406 // the context of a function, getValNonImprovising will search the functions
1407 // symbol table instead of the module symbol table for the global symbol,
1408 // which throws things all off. To get around this, we just tell
1409 // getValNonImprovising that we are at global scope here.
1411 Function *SavedCurFn = CurFun.CurrentFunction;
1412 CurFun.CurrentFunction = 0;
1414 Value *V = getValNonImprovising(Ty, $2);
1417 CurFun.CurrentFunction = SavedCurFn;
1419 // If this is an initializer for a constant pointer, which is referencing a
1420 // (currently) undefined variable, create a stub now that shall be replaced
1421 // in the future with the right type of variable.
1424 assert(isa<PointerType>(Ty) && "Globals may only be used as pointers!");
1425 const PointerType *PT = cast<PointerType>(Ty);
1427 // First check to see if the forward references value is already created!
1428 PerModuleInfo::GlobalRefsType::iterator I =
1429 CurModule.GlobalRefs.find(std::make_pair(PT, $2));
1431 if (I != CurModule.GlobalRefs.end()) {
1432 V = I->second; // Placeholder already exists, use it...
1436 if ($2.Type == ValID::NameVal) Name = $2.Name;
1438 // Create the forward referenced global.
1440 if (const FunctionType *FTy =
1441 dyn_cast<FunctionType>(PT->getElementType())) {
1442 GV = new Function(FTy, GlobalValue::ExternalLinkage, Name,
1443 CurModule.CurrentModule);
1445 GV = new GlobalVariable(PT->getElementType(), false,
1446 GlobalValue::ExternalLinkage, 0,
1447 Name, CurModule.CurrentModule);
1450 // Keep track of the fact that we have a forward ref to recycle it
1451 CurModule.GlobalRefs.insert(std::make_pair(std::make_pair(PT, $2), GV));
1456 $$ = cast<GlobalValue>(V);
1457 delete $1; // Free the type handle
1461 if ($1->get() != $2->getType())
1462 GEN_ERROR("Mismatched types for constant expression!");
1467 | Types ZEROINITIALIZER {
1468 const Type *Ty = $1->get();
1469 if (isa<FunctionType>(Ty) || Ty == Type::LabelTy || isa<OpaqueType>(Ty))
1470 GEN_ERROR("Cannot create a null initialized value of this type!");
1471 $$ = Constant::getNullValue(Ty);
1475 | SIntType EINT64VAL { // integral constants
1476 if (!ConstantInt::isValueValidForType($1, $2))
1477 GEN_ERROR("Constant value doesn't fit in type!");
1478 $$ = ConstantInt::get($1, $2);
1481 | UIntType EUINT64VAL { // integral constants
1482 if (!ConstantInt::isValueValidForType($1, $2))
1483 GEN_ERROR("Constant value doesn't fit in type!");
1484 $$ = ConstantInt::get($1, $2);
1487 | BOOL TRUETOK { // Boolean constants
1488 $$ = ConstantBool::getTrue();
1491 | BOOL FALSETOK { // Boolean constants
1492 $$ = ConstantBool::getFalse();
1495 | FPType FPVAL { // Float & Double constants
1496 if (!ConstantFP::isValueValidForType($1, $2))
1497 GEN_ERROR("Floating point constant invalid for type!!");
1498 $$ = ConstantFP::get($1, $2);
1503 ConstExpr: CastOps '(' ConstVal TO Types ')' {
1505 const Type *Ty = $5->get();
1506 if (!Val->getType()->isFirstClassType())
1507 GEN_ERROR("cast constant expression from a non-primitive type: '" +
1508 Val->getType()->getDescription() + "'!");
1509 if (!Ty->isFirstClassType())
1510 GEN_ERROR("cast constant expression to a non-primitive type: '" +
1511 Ty->getDescription() + "'!");
1512 $$ = ConstantExpr::getCast($1, $3, $5->get());
1515 | GETELEMENTPTR '(' ConstVal IndexList ')' {
1516 if (!isa<PointerType>($3->getType()))
1517 GEN_ERROR("GetElementPtr requires a pointer operand!");
1520 GetElementPtrInst::getIndexedType($3->getType(), *$4, true);
1522 GEN_ERROR("Index list invalid for constant getelementptr!");
1524 std::vector<Constant*> IdxVec;
1525 for (unsigned i = 0, e = $4->size(); i != e; ++i)
1526 if (Constant *C = dyn_cast<Constant>((*$4)[i]))
1527 IdxVec.push_back(C);
1529 GEN_ERROR("Indices to constant getelementptr must be constants!");
1533 $$ = ConstantExpr::getGetElementPtr($3, IdxVec);
1536 | SELECT '(' ConstVal ',' ConstVal ',' ConstVal ')' {
1537 if ($3->getType() != Type::BoolTy)
1538 GEN_ERROR("Select condition must be of boolean type!");
1539 if ($5->getType() != $7->getType())
1540 GEN_ERROR("Select operand types must match!");
1541 $$ = ConstantExpr::getSelect($3, $5, $7);
1544 | ArithmeticOps '(' ConstVal ',' ConstVal ')' {
1545 if ($3->getType() != $5->getType())
1546 GEN_ERROR("Binary operator types must match!");
1548 $$ = ConstantExpr::get($1, $3, $5);
1550 | LogicalOps '(' ConstVal ',' ConstVal ')' {
1551 if ($3->getType() != $5->getType())
1552 GEN_ERROR("Logical operator types must match!");
1553 if (!$3->getType()->isIntegral()) {
1554 if (!isa<PackedType>($3->getType()) ||
1555 !cast<PackedType>($3->getType())->getElementType()->isIntegral())
1556 GEN_ERROR("Logical operator requires integral operands!");
1558 $$ = ConstantExpr::get($1, $3, $5);
1561 | SetCondOps '(' ConstVal ',' ConstVal ')' {
1562 if ($3->getType() != $5->getType())
1563 GEN_ERROR("setcc operand types must match!");
1564 $$ = ConstantExpr::get($1, $3, $5);
1567 | ICMP IPredicates '(' ConstVal ',' ConstVal ')' {
1568 if ($4->getType() != $6->getType())
1569 GEN_ERROR("icmp operand types must match!");
1570 $$ = ConstantExpr::getICmp($2, $4, $6);
1572 | FCMP FPredicates '(' ConstVal ',' ConstVal ')' {
1573 if ($4->getType() != $6->getType())
1574 GEN_ERROR("fcmp operand types must match!");
1575 $$ = ConstantExpr::getFCmp($2, $4, $6);
1577 | ShiftOps '(' ConstVal ',' ConstVal ')' {
1578 if ($5->getType() != Type::UByteTy)
1579 GEN_ERROR("Shift count for shift constant must be unsigned byte!");
1580 if (!$3->getType()->isInteger())
1581 GEN_ERROR("Shift constant expression requires integer operand!");
1583 $$ = ConstantExpr::get($1, $3, $5);
1586 | EXTRACTELEMENT '(' ConstVal ',' ConstVal ')' {
1587 if (!ExtractElementInst::isValidOperands($3, $5))
1588 GEN_ERROR("Invalid extractelement operands!");
1589 $$ = ConstantExpr::getExtractElement($3, $5);
1592 | INSERTELEMENT '(' ConstVal ',' ConstVal ',' ConstVal ')' {
1593 if (!InsertElementInst::isValidOperands($3, $5, $7))
1594 GEN_ERROR("Invalid insertelement operands!");
1595 $$ = ConstantExpr::getInsertElement($3, $5, $7);
1598 | SHUFFLEVECTOR '(' ConstVal ',' ConstVal ',' ConstVal ')' {
1599 if (!ShuffleVectorInst::isValidOperands($3, $5, $7))
1600 GEN_ERROR("Invalid shufflevector operands!");
1601 $$ = ConstantExpr::getShuffleVector($3, $5, $7);
1606 // ConstVector - A list of comma separated constants.
1607 ConstVector : ConstVector ',' ConstVal {
1608 ($$ = $1)->push_back($3);
1612 $$ = new std::vector<Constant*>();
1618 // GlobalType - Match either GLOBAL or CONSTANT for global declarations...
1619 GlobalType : GLOBAL { $$ = false; } | CONSTANT { $$ = true; };
1622 //===----------------------------------------------------------------------===//
1623 // Rules to match Modules
1624 //===----------------------------------------------------------------------===//
1626 // Module rule: Capture the result of parsing the whole file into a result
1629 Module : FunctionList {
1630 $$ = ParserResult = $1;
1631 CurModule.ModuleDone();
1635 // FunctionList - A list of functions, preceeded by a constant pool.
1637 FunctionList : FunctionList Function {
1639 CurFun.FunctionDone();
1642 | FunctionList FunctionProto {
1646 | FunctionList MODULE ASM_TOK AsmBlock {
1650 | FunctionList IMPLEMENTATION {
1655 $$ = CurModule.CurrentModule;
1656 // Emit an error if there are any unresolved types left.
1657 if (!CurModule.LateResolveTypes.empty()) {
1658 const ValID &DID = CurModule.LateResolveTypes.begin()->first;
1659 if (DID.Type == ValID::NameVal) {
1660 GEN_ERROR("Reference to an undefined type: '"+DID.getName() + "'");
1662 GEN_ERROR("Reference to an undefined type: #" + itostr(DID.Num));
1668 // ConstPool - Constants with optional names assigned to them.
1669 ConstPool : ConstPool OptAssign TYPE TypesV {
1670 // Eagerly resolve types. This is not an optimization, this is a
1671 // requirement that is due to the fact that we could have this:
1673 // %list = type { %list * }
1674 // %list = type { %list * } ; repeated type decl
1676 // If types are not resolved eagerly, then the two types will not be
1677 // determined to be the same type!
1679 ResolveTypeTo($2, *$4);
1681 if (!setTypeName(*$4, $2) && !$2) {
1683 // If this is a named type that is not a redefinition, add it to the slot
1685 CurModule.Types.push_back(*$4);
1691 | ConstPool FunctionProto { // Function prototypes can be in const pool
1694 | ConstPool MODULE ASM_TOK AsmBlock { // Asm blocks can be in the const pool
1697 | ConstPool OptAssign OptLinkage GlobalType ConstVal {
1699 GEN_ERROR("Global value initializer is not a constant!");
1700 CurGV = ParseGlobalVariable($2, $3, $4, $5->getType(), $5);
1702 } GlobalVarAttributes {
1705 | ConstPool OptAssign EXTERNAL GlobalType Types {
1706 CurGV = ParseGlobalVariable($2, GlobalValue::ExternalLinkage, $4, *$5, 0);
1709 } GlobalVarAttributes {
1713 | ConstPool OptAssign DLLIMPORT GlobalType Types {
1714 CurGV = ParseGlobalVariable($2, GlobalValue::DLLImportLinkage, $4, *$5, 0);
1717 } GlobalVarAttributes {
1721 | ConstPool OptAssign EXTERN_WEAK GlobalType Types {
1723 ParseGlobalVariable($2, GlobalValue::ExternalWeakLinkage, $4, *$5, 0);
1726 } GlobalVarAttributes {
1730 | ConstPool TARGET TargetDefinition {
1733 | ConstPool DEPLIBS '=' LibrariesDefinition {
1736 | /* empty: end of list */ {
1740 AsmBlock : STRINGCONSTANT {
1741 const std::string &AsmSoFar = CurModule.CurrentModule->getModuleInlineAsm();
1742 char *EndStr = UnEscapeLexed($1, true);
1743 std::string NewAsm($1, EndStr);
1746 if (AsmSoFar.empty())
1747 CurModule.CurrentModule->setModuleInlineAsm(NewAsm);
1749 CurModule.CurrentModule->setModuleInlineAsm(AsmSoFar+"\n"+NewAsm);
1753 BigOrLittle : BIG { $$ = Module::BigEndian; };
1754 BigOrLittle : LITTLE { $$ = Module::LittleEndian; };
1756 TargetDefinition : ENDIAN '=' BigOrLittle {
1757 CurModule.CurrentModule->setEndianness($3);
1760 | POINTERSIZE '=' EUINT64VAL {
1762 CurModule.CurrentModule->setPointerSize(Module::Pointer32);
1764 CurModule.CurrentModule->setPointerSize(Module::Pointer64);
1766 GEN_ERROR("Invalid pointer size: '" + utostr($3) + "'!");
1769 | TRIPLE '=' STRINGCONSTANT {
1770 CurModule.CurrentModule->setTargetTriple($3);
1773 | DATALAYOUT '=' STRINGCONSTANT {
1774 CurModule.CurrentModule->setDataLayout($3);
1778 LibrariesDefinition : '[' LibList ']';
1780 LibList : LibList ',' STRINGCONSTANT {
1781 CurModule.CurrentModule->addLibrary($3);
1786 CurModule.CurrentModule->addLibrary($1);
1790 | /* empty: end of list */ {
1795 //===----------------------------------------------------------------------===//
1796 // Rules to match Function Headers
1797 //===----------------------------------------------------------------------===//
1799 Name : VAR_ID | STRINGCONSTANT;
1800 OptName : Name | /*empty*/ { $$ = 0; };
1802 ArgVal : Types OptName {
1803 if (*$1 == Type::VoidTy)
1804 GEN_ERROR("void typed arguments are invalid!");
1805 $$ = new std::pair<PATypeHolder*, char*>($1, $2);
1809 ArgListH : ArgListH ',' ArgVal {
1816 $$ = new std::vector<std::pair<PATypeHolder*,char*> >();
1822 ArgList : ArgListH {
1826 | ArgListH ',' DOTDOTDOT {
1828 $$->push_back(std::pair<PATypeHolder*,
1829 char*>(new PATypeHolder(Type::VoidTy), 0));
1833 $$ = new std::vector<std::pair<PATypeHolder*,char*> >();
1834 $$->push_back(std::make_pair(new PATypeHolder(Type::VoidTy), (char*)0));
1842 FunctionHeaderH : OptCallingConv TypesV Name '(' ArgList ')'
1843 OptSection OptAlign {
1845 std::string FunctionName($3);
1846 free($3); // Free strdup'd memory!
1848 if (!(*$2)->isFirstClassType() && *$2 != Type::VoidTy)
1849 GEN_ERROR("LLVM functions cannot return aggregate types!");
1851 std::vector<const Type*> ParamTypeList;
1852 if ($5) { // If there are arguments...
1853 for (std::vector<std::pair<PATypeHolder*,char*> >::iterator I = $5->begin();
1854 I != $5->end(); ++I)
1855 ParamTypeList.push_back(I->first->get());
1858 bool isVarArg = ParamTypeList.size() && ParamTypeList.back() == Type::VoidTy;
1859 if (isVarArg) ParamTypeList.pop_back();
1861 const FunctionType *FT = FunctionType::get(*$2, ParamTypeList, isVarArg);
1862 const PointerType *PFT = PointerType::get(FT);
1866 if (!FunctionName.empty()) {
1867 ID = ValID::create((char*)FunctionName.c_str());
1869 ID = ValID::create((int)CurModule.Values[PFT].size());
1873 // See if this function was forward referenced. If so, recycle the object.
1874 if (GlobalValue *FWRef = CurModule.GetForwardRefForGlobal(PFT, ID)) {
1875 // Move the function to the end of the list, from whereever it was
1876 // previously inserted.
1877 Fn = cast<Function>(FWRef);
1878 CurModule.CurrentModule->getFunctionList().remove(Fn);
1879 CurModule.CurrentModule->getFunctionList().push_back(Fn);
1880 } else if (!FunctionName.empty() && // Merge with an earlier prototype?
1881 (Fn = CurModule.CurrentModule->getFunction(FunctionName, FT))) {
1882 // If this is the case, either we need to be a forward decl, or it needs
1884 if (!CurFun.isDeclare && !Fn->isExternal())
1885 GEN_ERROR("Redefinition of function '" + FunctionName + "'!");
1887 // Make sure to strip off any argument names so we can't get conflicts.
1888 if (Fn->isExternal())
1889 for (Function::arg_iterator AI = Fn->arg_begin(), AE = Fn->arg_end();
1892 } else { // Not already defined?
1893 Fn = new Function(FT, GlobalValue::ExternalLinkage, FunctionName,
1894 CurModule.CurrentModule);
1896 InsertValue(Fn, CurModule.Values);
1899 CurFun.FunctionStart(Fn);
1901 if (CurFun.isDeclare) {
1902 // If we have declaration, always overwrite linkage. This will allow us to
1903 // correctly handle cases, when pointer to function is passed as argument to
1904 // another function.
1905 Fn->setLinkage(CurFun.Linkage);
1907 Fn->setCallingConv($1);
1908 Fn->setAlignment($8);
1914 // Add all of the arguments we parsed to the function...
1915 if ($5) { // Is null if empty...
1916 if (isVarArg) { // Nuke the last entry
1917 assert($5->back().first->get() == Type::VoidTy && $5->back().second == 0&&
1918 "Not a varargs marker!");
1919 delete $5->back().first;
1920 $5->pop_back(); // Delete the last entry
1922 Function::arg_iterator ArgIt = Fn->arg_begin();
1923 for (std::vector<std::pair<PATypeHolder*,char*> >::iterator I = $5->begin();
1924 I != $5->end(); ++I, ++ArgIt) {
1925 delete I->first; // Delete the typeholder...
1927 setValueName(ArgIt, I->second); // Insert arg into symtab...
1932 delete $5; // We're now done with the argument list
1937 BEGIN : BEGINTOK | '{'; // Allow BEGIN or '{' to start a function
1939 FunctionHeader : OptLinkage FunctionHeaderH BEGIN {
1940 $$ = CurFun.CurrentFunction;
1942 // Make sure that we keep track of the linkage type even if there was a
1943 // previous "declare".
1947 END : ENDTOK | '}'; // Allow end of '}' to end a function
1949 Function : BasicBlockList END {
1954 FnDeclareLinkage: /*default*/ |
1955 DLLIMPORT { CurFun.Linkage = GlobalValue::DLLImportLinkage; } |
1956 EXTERN_WEAK { CurFun.Linkage = GlobalValue::ExternalWeakLinkage; };
1958 FunctionProto : DECLARE { CurFun.isDeclare = true; } FnDeclareLinkage FunctionHeaderH {
1959 $$ = CurFun.CurrentFunction;
1960 CurFun.FunctionDone();
1964 //===----------------------------------------------------------------------===//
1965 // Rules to match Basic Blocks
1966 //===----------------------------------------------------------------------===//
1968 OptSideEffect : /* empty */ {
1977 ConstValueRef : ESINT64VAL { // A reference to a direct constant
1978 $$ = ValID::create($1);
1982 $$ = ValID::create($1);
1985 | FPVAL { // Perhaps it's an FP constant?
1986 $$ = ValID::create($1);
1990 $$ = ValID::create(ConstantBool::getTrue());
1994 $$ = ValID::create(ConstantBool::getFalse());
1998 $$ = ValID::createNull();
2002 $$ = ValID::createUndef();
2005 | ZEROINITIALIZER { // A vector zero constant.
2006 $$ = ValID::createZeroInit();
2009 | '<' ConstVector '>' { // Nonempty unsized packed vector
2010 const Type *ETy = (*$2)[0]->getType();
2011 int NumElements = $2->size();
2013 PackedType* pt = PackedType::get(ETy, NumElements);
2014 PATypeHolder* PTy = new PATypeHolder(
2022 // Verify all elements are correct type!
2023 for (unsigned i = 0; i < $2->size(); i++) {
2024 if (ETy != (*$2)[i]->getType())
2025 GEN_ERROR("Element #" + utostr(i) + " is not of type '" +
2026 ETy->getDescription() +"' as required!\nIt is of type '" +
2027 (*$2)[i]->getType()->getDescription() + "'.");
2030 $$ = ValID::create(ConstantPacked::get(pt, *$2));
2031 delete PTy; delete $2;
2035 $$ = ValID::create($1);
2038 | ASM_TOK OptSideEffect STRINGCONSTANT ',' STRINGCONSTANT {
2039 char *End = UnEscapeLexed($3, true);
2040 std::string AsmStr = std::string($3, End);
2041 End = UnEscapeLexed($5, true);
2042 std::string Constraints = std::string($5, End);
2043 $$ = ValID::createInlineAsm(AsmStr, Constraints, $2);
2049 // SymbolicValueRef - Reference to one of two ways of symbolically refering to
2052 SymbolicValueRef : INTVAL { // Is it an integer reference...?
2053 $$ = ValID::create($1);
2056 | Name { // Is it a named reference...?
2057 $$ = ValID::create($1);
2061 // ValueRef - A reference to a definition... either constant or symbolic
2062 ValueRef : SymbolicValueRef | ConstValueRef;
2065 // ResolvedVal - a <type> <value> pair. This is used only in cases where the
2066 // type immediately preceeds the value reference, and allows complex constant
2067 // pool references (for things like: 'ret [2 x int] [ int 12, int 42]')
2068 ResolvedVal : Types ValueRef {
2069 $$ = getVal(*$1, $2); delete $1;
2073 BasicBlockList : BasicBlockList BasicBlock {
2077 | FunctionHeader BasicBlock { // Do not allow functions with 0 basic blocks
2083 // Basic blocks are terminated by branching instructions:
2084 // br, br/cc, switch, ret
2086 BasicBlock : InstructionList OptAssign BBTerminatorInst {
2087 setValueName($3, $2);
2091 $1->getInstList().push_back($3);
2097 InstructionList : InstructionList Inst {
2098 if (CastInst *CI1 = dyn_cast<CastInst>($2))
2099 if (CastInst *CI2 = dyn_cast<CastInst>(CI1->getOperand(0)))
2100 if (CI2->getParent() == 0)
2101 $1->getInstList().push_back(CI2);
2102 $1->getInstList().push_back($2);
2107 $$ = getBBVal(ValID::create((int)CurFun.NextBBNum++), true);
2110 // Make sure to move the basic block to the correct location in the
2111 // function, instead of leaving it inserted wherever it was first
2113 Function::BasicBlockListType &BBL =
2114 CurFun.CurrentFunction->getBasicBlockList();
2115 BBL.splice(BBL.end(), BBL, $$);
2119 $$ = getBBVal(ValID::create($1), true);
2122 // Make sure to move the basic block to the correct location in the
2123 // function, instead of leaving it inserted wherever it was first
2125 Function::BasicBlockListType &BBL =
2126 CurFun.CurrentFunction->getBasicBlockList();
2127 BBL.splice(BBL.end(), BBL, $$);
2131 BBTerminatorInst : RET ResolvedVal { // Return with a result...
2132 $$ = new ReturnInst($2);
2135 | RET VOID { // Return with no result...
2136 $$ = new ReturnInst();
2139 | BR LABEL ValueRef { // Unconditional Branch...
2140 BasicBlock* tmpBB = getBBVal($3);
2142 $$ = new BranchInst(tmpBB);
2143 } // Conditional Branch...
2144 | BR BOOL ValueRef ',' LABEL ValueRef ',' LABEL ValueRef {
2145 BasicBlock* tmpBBA = getBBVal($6);
2147 BasicBlock* tmpBBB = getBBVal($9);
2149 Value* tmpVal = getVal(Type::BoolTy, $3);
2151 $$ = new BranchInst(tmpBBA, tmpBBB, tmpVal);
2153 | SWITCH IntType ValueRef ',' LABEL ValueRef '[' JumpTable ']' {
2154 Value* tmpVal = getVal($2, $3);
2156 BasicBlock* tmpBB = getBBVal($6);
2158 SwitchInst *S = new SwitchInst(tmpVal, tmpBB, $8->size());
2161 std::vector<std::pair<Constant*,BasicBlock*> >::iterator I = $8->begin(),
2163 for (; I != E; ++I) {
2164 if (ConstantInt *CI = dyn_cast<ConstantInt>(I->first))
2165 S->addCase(CI, I->second);
2167 GEN_ERROR("Switch case is constant, but not a simple integer!");
2172 | SWITCH IntType ValueRef ',' LABEL ValueRef '[' ']' {
2173 Value* tmpVal = getVal($2, $3);
2175 BasicBlock* tmpBB = getBBVal($6);
2177 SwitchInst *S = new SwitchInst(tmpVal, tmpBB, 0);
2181 | INVOKE OptCallingConv TypesV ValueRef '(' ValueRefListE ')'
2182 TO LABEL ValueRef UNWIND LABEL ValueRef {
2183 const PointerType *PFTy;
2184 const FunctionType *Ty;
2186 if (!(PFTy = dyn_cast<PointerType>($3->get())) ||
2187 !(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) {
2188 // Pull out the types of all of the arguments...
2189 std::vector<const Type*> ParamTypes;
2191 for (std::vector<Value*>::iterator I = $6->begin(), E = $6->end();
2193 ParamTypes.push_back((*I)->getType());
2196 bool isVarArg = ParamTypes.size() && ParamTypes.back() == Type::VoidTy;
2197 if (isVarArg) ParamTypes.pop_back();
2199 Ty = FunctionType::get($3->get(), ParamTypes, isVarArg);
2200 PFTy = PointerType::get(Ty);
2203 Value *V = getVal(PFTy, $4); // Get the function we're calling...
2205 BasicBlock *Normal = getBBVal($10);
2207 BasicBlock *Except = getBBVal($13);
2210 // Create the call node...
2211 if (!$6) { // Has no arguments?
2212 $$ = new InvokeInst(V, Normal, Except, std::vector<Value*>());
2213 } else { // Has arguments?
2214 // Loop through FunctionType's arguments and ensure they are specified
2217 FunctionType::param_iterator I = Ty->param_begin();
2218 FunctionType::param_iterator E = Ty->param_end();
2219 std::vector<Value*>::iterator ArgI = $6->begin(), ArgE = $6->end();
2221 for (; ArgI != ArgE && I != E; ++ArgI, ++I)
2222 if ((*ArgI)->getType() != *I)
2223 GEN_ERROR("Parameter " +(*ArgI)->getName()+ " is not of type '" +
2224 (*I)->getDescription() + "'!");
2226 if (I != E || (ArgI != ArgE && !Ty->isVarArg()))
2227 GEN_ERROR("Invalid number of parameters detected!");
2229 $$ = new InvokeInst(V, Normal, Except, *$6);
2231 cast<InvokeInst>($$)->setCallingConv($2);
2238 $$ = new UnwindInst();
2242 $$ = new UnreachableInst();
2248 JumpTable : JumpTable IntType ConstValueRef ',' LABEL ValueRef {
2250 Constant *V = cast<Constant>(getValNonImprovising($2, $3));
2253 GEN_ERROR("May only switch on a constant pool value!");
2255 BasicBlock* tmpBB = getBBVal($6);
2257 $$->push_back(std::make_pair(V, tmpBB));
2259 | IntType ConstValueRef ',' LABEL ValueRef {
2260 $$ = new std::vector<std::pair<Constant*, BasicBlock*> >();
2261 Constant *V = cast<Constant>(getValNonImprovising($1, $2));
2265 GEN_ERROR("May only switch on a constant pool value!");
2267 BasicBlock* tmpBB = getBBVal($5);
2269 $$->push_back(std::make_pair(V, tmpBB));
2272 Inst : OptAssign InstVal {
2273 // Is this definition named?? if so, assign the name...
2274 setValueName($2, $1);
2281 PHIList : Types '[' ValueRef ',' ValueRef ']' { // Used for PHI nodes
2282 $$ = new std::list<std::pair<Value*, BasicBlock*> >();
2283 Value* tmpVal = getVal(*$1, $3);
2285 BasicBlock* tmpBB = getBBVal($5);
2287 $$->push_back(std::make_pair(tmpVal, tmpBB));
2290 | PHIList ',' '[' ValueRef ',' ValueRef ']' {
2292 Value* tmpVal = getVal($1->front().first->getType(), $4);
2294 BasicBlock* tmpBB = getBBVal($6);
2296 $1->push_back(std::make_pair(tmpVal, tmpBB));
2300 ValueRefList : ResolvedVal { // Used for call statements, and memory insts...
2301 $$ = new std::vector<Value*>();
2304 | ValueRefList ',' ResolvedVal {
2310 // ValueRefListE - Just like ValueRefList, except that it may also be empty!
2311 ValueRefListE : ValueRefList | /*empty*/ { $$ = 0; };
2313 OptTailCall : TAIL CALL {
2322 InstVal : ArithmeticOps Types ValueRef ',' ValueRef {
2323 if (!(*$2)->isInteger() && !(*$2)->isFloatingPoint() &&
2324 !isa<PackedType>((*$2).get()))
2326 "Arithmetic operator requires integer, FP, or packed operands!");
2327 if (isa<PackedType>((*$2).get()) &&
2328 ($1 == Instruction::URem ||
2329 $1 == Instruction::SRem ||
2330 $1 == Instruction::FRem))
2331 GEN_ERROR("U/S/FRem not supported on packed types!");
2332 Value* val1 = getVal(*$2, $3);
2334 Value* val2 = getVal(*$2, $5);
2336 $$ = BinaryOperator::create($1, val1, val2);
2338 GEN_ERROR("binary operator returned null!");
2341 | LogicalOps Types ValueRef ',' ValueRef {
2342 if (!(*$2)->isIntegral()) {
2343 if (!isa<PackedType>($2->get()) ||
2344 !cast<PackedType>($2->get())->getElementType()->isIntegral())
2345 GEN_ERROR("Logical operator requires integral operands!");
2347 Value* tmpVal1 = getVal(*$2, $3);
2349 Value* tmpVal2 = getVal(*$2, $5);
2351 $$ = BinaryOperator::create($1, tmpVal1, tmpVal2);
2353 GEN_ERROR("binary operator returned null!");
2356 | SetCondOps Types ValueRef ',' ValueRef {
2357 if(isa<PackedType>((*$2).get())) {
2359 "PackedTypes currently not supported in setcc instructions!");
2361 Value* tmpVal1 = getVal(*$2, $3);
2363 Value* tmpVal2 = getVal(*$2, $5);
2365 $$ = new SetCondInst($1, tmpVal1, tmpVal2);
2367 GEN_ERROR("binary operator returned null!");
2370 | ICMP IPredicates Types ValueRef ',' ValueRef {
2371 if (isa<PackedType>((*$3).get()))
2372 GEN_ERROR("Packed types not supported by icmp instruction");
2373 Value* tmpVal1 = getVal(*$3, $4);
2375 Value* tmpVal2 = getVal(*$3, $6);
2377 $$ = CmpInst::create($1, $2, tmpVal1, tmpVal2);
2379 GEN_ERROR("icmp operator returned null!");
2381 | FCMP FPredicates Types ValueRef ',' ValueRef {
2382 if (isa<PackedType>((*$3).get()))
2383 GEN_ERROR("Packed types not supported by fcmp instruction");
2384 Value* tmpVal1 = getVal(*$3, $4);
2386 Value* tmpVal2 = getVal(*$3, $6);
2388 $$ = CmpInst::create($1, $2, tmpVal1, tmpVal2);
2390 GEN_ERROR("fcmp operator returned null!");
2393 llvm_cerr << "WARNING: Use of eliminated 'not' instruction:"
2394 << " Replacing with 'xor'.\n";
2396 Value *Ones = ConstantIntegral::getAllOnesValue($2->getType());
2398 GEN_ERROR("Expected integral type for not instruction!");
2400 $$ = BinaryOperator::create(Instruction::Xor, $2, Ones);
2402 GEN_ERROR("Could not create a xor instruction!");
2405 | ShiftOps ResolvedVal ',' ResolvedVal {
2406 if ($4->getType() != Type::UByteTy)
2407 GEN_ERROR("Shift amount must be ubyte!");
2408 if (!$2->getType()->isInteger())
2409 GEN_ERROR("Shift constant expression requires integer operand!");
2411 $$ = new ShiftInst($1, $2, $4);
2414 | CastOps ResolvedVal TO Types {
2416 const Type* Ty = $4->get();
2417 if (!Val->getType()->isFirstClassType())
2418 GEN_ERROR("cast from a non-primitive type: '" +
2419 Val->getType()->getDescription() + "'!");
2420 if (!Ty->isFirstClassType())
2421 GEN_ERROR("cast to a non-primitive type: '" + Ty->getDescription() +"'!");
2422 $$ = CastInst::create($1, $2, $4->get());
2425 | SELECT ResolvedVal ',' ResolvedVal ',' ResolvedVal {
2426 if ($2->getType() != Type::BoolTy)
2427 GEN_ERROR("select condition must be boolean!");
2428 if ($4->getType() != $6->getType())
2429 GEN_ERROR("select value types should match!");
2430 $$ = new SelectInst($2, $4, $6);
2433 | VAARG ResolvedVal ',' Types {
2434 $$ = new VAArgInst($2, *$4);
2438 | EXTRACTELEMENT ResolvedVal ',' ResolvedVal {
2439 if (!ExtractElementInst::isValidOperands($2, $4))
2440 GEN_ERROR("Invalid extractelement operands!");
2441 $$ = new ExtractElementInst($2, $4);
2444 | INSERTELEMENT ResolvedVal ',' ResolvedVal ',' ResolvedVal {
2445 if (!InsertElementInst::isValidOperands($2, $4, $6))
2446 GEN_ERROR("Invalid insertelement operands!");
2447 $$ = new InsertElementInst($2, $4, $6);
2450 | SHUFFLEVECTOR ResolvedVal ',' ResolvedVal ',' ResolvedVal {
2451 if (!ShuffleVectorInst::isValidOperands($2, $4, $6))
2452 GEN_ERROR("Invalid shufflevector operands!");
2453 $$ = new ShuffleVectorInst($2, $4, $6);
2457 const Type *Ty = $2->front().first->getType();
2458 if (!Ty->isFirstClassType())
2459 GEN_ERROR("PHI node operands must be of first class type!");
2460 $$ = new PHINode(Ty);
2461 ((PHINode*)$$)->reserveOperandSpace($2->size());
2462 while ($2->begin() != $2->end()) {
2463 if ($2->front().first->getType() != Ty)
2464 GEN_ERROR("All elements of a PHI node must be of the same type!");
2465 cast<PHINode>($$)->addIncoming($2->front().first, $2->front().second);
2468 delete $2; // Free the list...
2471 | OptTailCall OptCallingConv TypesV ValueRef '(' ValueRefListE ')' {
2472 const PointerType *PFTy = 0;
2473 const FunctionType *Ty = 0;
2475 if (!(PFTy = dyn_cast<PointerType>($3->get())) ||
2476 !(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) {
2477 // Pull out the types of all of the arguments...
2478 std::vector<const Type*> ParamTypes;
2480 for (std::vector<Value*>::iterator I = $6->begin(), E = $6->end();
2482 ParamTypes.push_back((*I)->getType());
2485 bool isVarArg = ParamTypes.size() && ParamTypes.back() == Type::VoidTy;
2486 if (isVarArg) ParamTypes.pop_back();
2488 if (!(*$3)->isFirstClassType() && *$3 != Type::VoidTy)
2489 GEN_ERROR("LLVM functions cannot return aggregate types!");
2491 Ty = FunctionType::get($3->get(), ParamTypes, isVarArg);
2492 PFTy = PointerType::get(Ty);
2495 Value *V = getVal(PFTy, $4); // Get the function we're calling...
2498 // Create the call node...
2499 if (!$6) { // Has no arguments?
2500 // Make sure no arguments is a good thing!
2501 if (Ty->getNumParams() != 0)
2502 GEN_ERROR("No arguments passed to a function that "
2503 "expects arguments!");
2505 $$ = new CallInst(V, std::vector<Value*>());
2506 } else { // Has arguments?
2507 // Loop through FunctionType's arguments and ensure they are specified
2510 FunctionType::param_iterator I = Ty->param_begin();
2511 FunctionType::param_iterator E = Ty->param_end();
2512 std::vector<Value*>::iterator ArgI = $6->begin(), ArgE = $6->end();
2514 for (; ArgI != ArgE && I != E; ++ArgI, ++I)
2515 if ((*ArgI)->getType() != *I)
2516 GEN_ERROR("Parameter " +(*ArgI)->getName()+ " is not of type '" +
2517 (*I)->getDescription() + "'!");
2519 if (I != E || (ArgI != ArgE && !Ty->isVarArg()))
2520 GEN_ERROR("Invalid number of parameters detected!");
2522 $$ = new CallInst(V, *$6);
2524 cast<CallInst>($$)->setTailCall($1);
2525 cast<CallInst>($$)->setCallingConv($2);
2536 // IndexList - List of indices for GEP based instructions...
2537 IndexList : ',' ValueRefList {
2541 $$ = new std::vector<Value*>();
2545 OptVolatile : VOLATILE {
2556 MemoryInst : MALLOC Types OptCAlign {
2557 $$ = new MallocInst(*$2, 0, $3);
2561 | MALLOC Types ',' UINT ValueRef OptCAlign {
2562 Value* tmpVal = getVal($4, $5);
2564 $$ = new MallocInst(*$2, tmpVal, $6);
2567 | ALLOCA Types OptCAlign {
2568 $$ = new AllocaInst(*$2, 0, $3);
2572 | ALLOCA Types ',' UINT ValueRef OptCAlign {
2573 Value* tmpVal = getVal($4, $5);
2575 $$ = new AllocaInst(*$2, tmpVal, $6);
2578 | FREE ResolvedVal {
2579 if (!isa<PointerType>($2->getType()))
2580 GEN_ERROR("Trying to free nonpointer type " +
2581 $2->getType()->getDescription() + "!");
2582 $$ = new FreeInst($2);
2586 | OptVolatile LOAD Types ValueRef {
2587 if (!isa<PointerType>($3->get()))
2588 GEN_ERROR("Can't load from nonpointer type: " +
2589 (*$3)->getDescription());
2590 if (!cast<PointerType>($3->get())->getElementType()->isFirstClassType())
2591 GEN_ERROR("Can't load from pointer of non-first-class type: " +
2592 (*$3)->getDescription());
2593 Value* tmpVal = getVal(*$3, $4);
2595 $$ = new LoadInst(tmpVal, "", $1);
2598 | OptVolatile STORE ResolvedVal ',' Types ValueRef {
2599 const PointerType *PT = dyn_cast<PointerType>($5->get());
2601 GEN_ERROR("Can't store to a nonpointer type: " +
2602 (*$5)->getDescription());
2603 const Type *ElTy = PT->getElementType();
2604 if (ElTy != $3->getType())
2605 GEN_ERROR("Can't store '" + $3->getType()->getDescription() +
2606 "' into space of type '" + ElTy->getDescription() + "'!");
2608 Value* tmpVal = getVal(*$5, $6);
2610 $$ = new StoreInst($3, tmpVal, $1);
2613 | GETELEMENTPTR Types ValueRef IndexList {
2614 if (!isa<PointerType>($2->get()))
2615 GEN_ERROR("getelementptr insn requires pointer operand!");
2617 if (!GetElementPtrInst::getIndexedType(*$2, *$4, true))
2618 GEN_ERROR("Invalid getelementptr indices for type '" +
2619 (*$2)->getDescription()+ "'!");
2620 Value* tmpVal = getVal(*$2, $3);
2622 $$ = new GetElementPtrInst(tmpVal, *$4);
2630 void llvm::GenerateError(const std::string &message, int LineNo) {
2631 if (LineNo == -1) LineNo = llvmAsmlineno;
2632 // TODO: column number in exception
2634 TheParseError->setError(CurFilename, message, LineNo);
2638 int yyerror(const char *ErrorMsg) {
2640 = std::string((CurFilename == "-") ? std::string("<stdin>") : CurFilename)
2641 + ":" + utostr((unsigned) llvmAsmlineno) + ": ";
2642 std::string errMsg = std::string(ErrorMsg) + "\n" + where + " while reading ";
2643 if (yychar == YYEMPTY || yychar == 0)
2644 errMsg += "end-of-file.";
2646 errMsg += "token: '" + std::string(llvmAsmtext, llvmAsmleng) + "'";
2647 GenerateError(errMsg);