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/Assembly/AutoUpgrade.h"
22 #include "llvm/Support/GetElementPtrTypeIterator.h"
23 #include "llvm/ADT/STLExtras.h"
24 #include "llvm/Support/MathExtras.h"
25 #include "llvm/Support/Streams.h"
30 // The following is a gross hack. In order to rid the libAsmParser library of
31 // exceptions, we have to have a way of getting the yyparse function to go into
32 // an error situation. So, whenever we want an error to occur, the GenerateError
33 // function (see bottom of file) sets TriggerError. Then, at the end of each
34 // production in the grammer we use CHECK_FOR_ERROR which will invoke YYERROR
35 // (a goto) to put YACC in error state. Furthermore, several calls to
36 // GenerateError are made from inside productions and they must simulate the
37 // previous exception behavior by exiting the production immediately. We have
38 // replaced these with the GEN_ERROR macro which calls GeneratError and then
39 // immediately invokes YYERROR. This would be so much cleaner if it was a
40 // recursive descent parser.
41 static bool TriggerError = false;
42 #define CHECK_FOR_ERROR { if (TriggerError) { TriggerError = false; YYABORT; } }
43 #define GEN_ERROR(msg) { GenerateError(msg); YYERROR; }
45 int yyerror(const char *ErrorMsg); // Forward declarations to prevent "implicit
46 int yylex(); // declaration" of xxx warnings.
50 std::string CurFilename;
54 static Module *ParserResult;
56 // DEBUG_UPREFS - Define this symbol if you want to enable debugging output
57 // relating to upreferences in the input stream.
59 //#define DEBUG_UPREFS 1
61 #define UR_OUT(X) llvm_cerr << X
66 #define YYERROR_VERBOSE 1
68 static bool ObsoleteVarArgs;
69 static bool NewVarArgs;
70 static BasicBlock *CurBB;
71 static GlobalVariable *CurGV;
74 // This contains info used when building the body of a function. It is
75 // destroyed when the function is completed.
77 typedef std::vector<Value *> ValueList; // Numbered defs
79 ResolveDefinitions(std::map<const Type *,ValueList> &LateResolvers,
80 std::map<const Type *,ValueList> *FutureLateResolvers = 0);
82 static struct PerModuleInfo {
83 Module *CurrentModule;
84 std::map<const Type *, ValueList> Values; // Module level numbered definitions
85 std::map<const Type *,ValueList> LateResolveValues;
86 std::vector<PATypeHolder> Types;
87 std::map<ValID, PATypeHolder> LateResolveTypes;
89 /// PlaceHolderInfo - When temporary placeholder objects are created, remember
90 /// how they were referenced and on which line of the input they came from so
91 /// that we can resolve them later and print error messages as appropriate.
92 std::map<Value*, std::pair<ValID, int> > PlaceHolderInfo;
94 // GlobalRefs - This maintains a mapping between <Type, ValID>'s and forward
95 // references to global values. Global values may be referenced before they
96 // are defined, and if so, the temporary object that they represent is held
97 // here. This is used for forward references of GlobalValues.
99 typedef std::map<std::pair<const PointerType *,
100 ValID>, GlobalValue*> GlobalRefsType;
101 GlobalRefsType GlobalRefs;
104 // If we could not resolve some functions at function compilation time
105 // (calls to functions before they are defined), resolve them now... Types
106 // are resolved when the constant pool has been completely parsed.
108 ResolveDefinitions(LateResolveValues);
112 // Check to make sure that all global value forward references have been
115 if (!GlobalRefs.empty()) {
116 std::string UndefinedReferences = "Unresolved global references exist:\n";
118 for (GlobalRefsType::iterator I = GlobalRefs.begin(), E =GlobalRefs.end();
120 UndefinedReferences += " " + I->first.first->getDescription() + " " +
121 I->first.second.getName() + "\n";
123 GenerateError(UndefinedReferences);
127 // Look for intrinsic functions and CallInst that need to be upgraded
128 for (Module::iterator FI = CurrentModule->begin(),
129 FE = CurrentModule->end(); FI != FE; )
130 UpgradeCallsToIntrinsic(FI++);
132 Values.clear(); // Clear out function local definitions
137 // GetForwardRefForGlobal - Check to see if there is a forward reference
138 // for this global. If so, remove it from the GlobalRefs map and return it.
139 // If not, just return null.
140 GlobalValue *GetForwardRefForGlobal(const PointerType *PTy, ValID ID) {
141 // Check to see if there is a forward reference to this global variable...
142 // if there is, eliminate it and patch the reference to use the new def'n.
143 GlobalRefsType::iterator I = GlobalRefs.find(std::make_pair(PTy, ID));
144 GlobalValue *Ret = 0;
145 if (I != GlobalRefs.end()) {
153 static struct PerFunctionInfo {
154 Function *CurrentFunction; // Pointer to current function being created
156 std::map<const Type*, ValueList> Values; // Keep track of #'d definitions
157 std::map<const Type*, ValueList> LateResolveValues;
158 bool isDeclare; // Is this function a forward declararation?
159 GlobalValue::LinkageTypes Linkage; // Linkage for forward declaration.
161 /// BBForwardRefs - When we see forward references to basic blocks, keep
162 /// track of them here.
163 std::map<BasicBlock*, std::pair<ValID, int> > BBForwardRefs;
164 std::vector<BasicBlock*> NumberedBlocks;
167 inline PerFunctionInfo() {
170 Linkage = GlobalValue::ExternalLinkage;
173 inline void FunctionStart(Function *M) {
178 void FunctionDone() {
179 NumberedBlocks.clear();
181 // Any forward referenced blocks left?
182 if (!BBForwardRefs.empty()) {
183 GenerateError("Undefined reference to label " +
184 BBForwardRefs.begin()->first->getName());
188 // Resolve all forward references now.
189 ResolveDefinitions(LateResolveValues, &CurModule.LateResolveValues);
191 Values.clear(); // Clear out function local definitions
194 Linkage = GlobalValue::ExternalLinkage;
196 } CurFun; // Info for the current function...
198 static bool inFunctionScope() { return CurFun.CurrentFunction != 0; }
201 //===----------------------------------------------------------------------===//
202 // Code to handle definitions of all the types
203 //===----------------------------------------------------------------------===//
205 static int InsertValue(Value *V,
206 std::map<const Type*,ValueList> &ValueTab = CurFun.Values) {
207 if (V->hasName()) return -1; // Is this a numbered definition?
209 // Yes, insert the value into the value table...
210 ValueList &List = ValueTab[V->getType()];
212 return List.size()-1;
215 static const Type *getTypeVal(const ValID &D, bool DoNotImprovise = false) {
217 case ValID::NumberVal: // Is it a numbered definition?
218 // Module constants occupy the lowest numbered slots...
219 if ((unsigned)D.Num < CurModule.Types.size())
220 return CurModule.Types[(unsigned)D.Num];
222 case ValID::NameVal: // Is it a named definition?
223 if (const Type *N = CurModule.CurrentModule->getTypeByName(D.Name)) {
224 D.destroy(); // Free old strdup'd memory...
229 GenerateError("Internal parser error: Invalid symbol type reference!");
233 // If we reached here, we referenced either a symbol that we don't know about
234 // or an id number that hasn't been read yet. We may be referencing something
235 // forward, so just create an entry to be resolved later and get to it...
237 if (DoNotImprovise) return 0; // Do we just want a null to be returned?
240 if (inFunctionScope()) {
241 if (D.Type == ValID::NameVal) {
242 GenerateError("Reference to an undefined type: '" + D.getName() + "'");
245 GenerateError("Reference to an undefined type: #" + itostr(D.Num));
250 std::map<ValID, PATypeHolder>::iterator I =CurModule.LateResolveTypes.find(D);
251 if (I != CurModule.LateResolveTypes.end())
254 Type *Typ = OpaqueType::get();
255 CurModule.LateResolveTypes.insert(std::make_pair(D, Typ));
259 static Value *lookupInSymbolTable(const Type *Ty, const std::string &Name) {
260 SymbolTable &SymTab =
261 inFunctionScope() ? CurFun.CurrentFunction->getSymbolTable() :
262 CurModule.CurrentModule->getSymbolTable();
263 return SymTab.lookup(Ty, Name);
266 // getValNonImprovising - Look up the value specified by the provided type and
267 // the provided ValID. If the value exists and has already been defined, return
268 // it. Otherwise return null.
270 static Value *getValNonImprovising(const Type *Ty, const ValID &D) {
271 if (isa<FunctionType>(Ty)) {
272 GenerateError("Functions are not values and "
273 "must be referenced as pointers");
278 case ValID::NumberVal: { // Is it a numbered definition?
279 unsigned Num = (unsigned)D.Num;
281 // Module constants occupy the lowest numbered slots...
282 std::map<const Type*,ValueList>::iterator VI = CurModule.Values.find(Ty);
283 if (VI != CurModule.Values.end()) {
284 if (Num < VI->second.size())
285 return VI->second[Num];
286 Num -= VI->second.size();
289 // Make sure that our type is within bounds
290 VI = CurFun.Values.find(Ty);
291 if (VI == CurFun.Values.end()) return 0;
293 // Check that the number is within bounds...
294 if (VI->second.size() <= Num) return 0;
296 return VI->second[Num];
299 case ValID::NameVal: { // Is it a named definition?
300 Value *N = lookupInSymbolTable(Ty, std::string(D.Name));
301 if (N == 0) return 0;
303 D.destroy(); // Free old strdup'd memory...
307 // Check to make sure that "Ty" is an integral type, and that our
308 // value will fit into the specified type...
309 case ValID::ConstSIntVal: // Is it a constant pool reference??
310 if (!ConstantInt::isValueValidForType(Ty, D.ConstPool64)) {
311 GenerateError("Signed integral constant '" +
312 itostr(D.ConstPool64) + "' is invalid for type '" +
313 Ty->getDescription() + "'!");
316 return ConstantInt::get(Ty, D.ConstPool64);
318 case ValID::ConstUIntVal: // Is it an unsigned const pool reference?
319 if (!ConstantInt::isValueValidForType(Ty, D.UConstPool64)) {
320 if (!ConstantInt::isValueValidForType(Ty, D.ConstPool64)) {
321 GenerateError("Integral constant '" + utostr(D.UConstPool64) +
322 "' is invalid or out of range!");
324 } else { // This is really a signed reference. Transmogrify.
325 return ConstantInt::get(Ty, D.ConstPool64);
328 return ConstantInt::get(Ty, D.UConstPool64);
331 case ValID::ConstFPVal: // Is it a floating point const pool reference?
332 if (!ConstantFP::isValueValidForType(Ty, D.ConstPoolFP)) {
333 GenerateError("FP constant invalid for type!!");
336 return ConstantFP::get(Ty, D.ConstPoolFP);
338 case ValID::ConstNullVal: // Is it a null value?
339 if (!isa<PointerType>(Ty)) {
340 GenerateError("Cannot create a a non pointer null!");
343 return ConstantPointerNull::get(cast<PointerType>(Ty));
345 case ValID::ConstUndefVal: // Is it an undef value?
346 return UndefValue::get(Ty);
348 case ValID::ConstZeroVal: // Is it a zero value?
349 return Constant::getNullValue(Ty);
351 case ValID::ConstantVal: // Fully resolved constant?
352 if (D.ConstantValue->getType() != Ty) {
353 GenerateError("Constant expression type different from required type!");
356 return D.ConstantValue;
358 case ValID::InlineAsmVal: { // Inline asm expression
359 const PointerType *PTy = dyn_cast<PointerType>(Ty);
360 const FunctionType *FTy =
361 PTy ? dyn_cast<FunctionType>(PTy->getElementType()) : 0;
362 if (!FTy || !InlineAsm::Verify(FTy, D.IAD->Constraints)) {
363 GenerateError("Invalid type for asm constraint string!");
366 InlineAsm *IA = InlineAsm::get(FTy, D.IAD->AsmString, D.IAD->Constraints,
367 D.IAD->HasSideEffects);
368 D.destroy(); // Free InlineAsmDescriptor.
372 assert(0 && "Unhandled case!");
376 assert(0 && "Unhandled case!");
380 // getVal - This function is identical to getValNonImprovising, except that if a
381 // value is not already defined, it "improvises" by creating a placeholder var
382 // that looks and acts just like the requested variable. When the value is
383 // defined later, all uses of the placeholder variable are replaced with the
386 static Value *getVal(const Type *Ty, const ValID &ID) {
387 if (Ty == Type::LabelTy) {
388 GenerateError("Cannot use a basic block here");
392 // See if the value has already been defined.
393 Value *V = getValNonImprovising(Ty, ID);
395 if (TriggerError) return 0;
397 if (!Ty->isFirstClassType() && !isa<OpaqueType>(Ty)) {
398 GenerateError("Invalid use of a composite type!");
402 // If we reached here, we referenced either a symbol that we don't know about
403 // or an id number that hasn't been read yet. We may be referencing something
404 // forward, so just create an entry to be resolved later and get to it...
406 V = new Argument(Ty);
408 // Remember where this forward reference came from. FIXME, shouldn't we try
409 // to recycle these things??
410 CurModule.PlaceHolderInfo.insert(std::make_pair(V, std::make_pair(ID,
413 if (inFunctionScope())
414 InsertValue(V, CurFun.LateResolveValues);
416 InsertValue(V, CurModule.LateResolveValues);
420 /// getBBVal - This is used for two purposes:
421 /// * If isDefinition is true, a new basic block with the specified ID is being
423 /// * If isDefinition is true, this is a reference to a basic block, which may
424 /// or may not be a forward reference.
426 static BasicBlock *getBBVal(const ValID &ID, bool isDefinition = false) {
427 assert(inFunctionScope() && "Can't get basic block at global scope!");
433 GenerateError("Illegal label reference " + ID.getName());
435 case ValID::NumberVal: // Is it a numbered definition?
436 if (unsigned(ID.Num) >= CurFun.NumberedBlocks.size())
437 CurFun.NumberedBlocks.resize(ID.Num+1);
438 BB = CurFun.NumberedBlocks[ID.Num];
440 case ValID::NameVal: // Is it a named definition?
442 if (Value *N = CurFun.CurrentFunction->
443 getSymbolTable().lookup(Type::LabelTy, Name))
444 BB = cast<BasicBlock>(N);
448 // See if the block has already been defined.
450 // If this is the definition of the block, make sure the existing value was
451 // just a forward reference. If it was a forward reference, there will be
452 // an entry for it in the PlaceHolderInfo map.
453 if (isDefinition && !CurFun.BBForwardRefs.erase(BB)) {
454 // The existing value was a definition, not a forward reference.
455 GenerateError("Redefinition of label " + ID.getName());
459 ID.destroy(); // Free strdup'd memory.
463 // Otherwise this block has not been seen before.
464 BB = new BasicBlock("", CurFun.CurrentFunction);
465 if (ID.Type == ValID::NameVal) {
466 BB->setName(ID.Name);
468 CurFun.NumberedBlocks[ID.Num] = BB;
471 // If this is not a definition, keep track of it so we can use it as a forward
474 // Remember where this forward reference came from.
475 CurFun.BBForwardRefs[BB] = std::make_pair(ID, llvmAsmlineno);
477 // The forward declaration could have been inserted anywhere in the
478 // function: insert it into the correct place now.
479 CurFun.CurrentFunction->getBasicBlockList().remove(BB);
480 CurFun.CurrentFunction->getBasicBlockList().push_back(BB);
487 //===----------------------------------------------------------------------===//
488 // Code to handle forward references in instructions
489 //===----------------------------------------------------------------------===//
491 // This code handles the late binding needed with statements that reference
492 // values not defined yet... for example, a forward branch, or the PHI node for
495 // This keeps a table (CurFun.LateResolveValues) of all such forward references
496 // and back patchs after we are done.
499 // ResolveDefinitions - If we could not resolve some defs at parsing
500 // time (forward branches, phi functions for loops, etc...) resolve the
504 ResolveDefinitions(std::map<const Type*,ValueList> &LateResolvers,
505 std::map<const Type*,ValueList> *FutureLateResolvers) {
506 // Loop over LateResolveDefs fixing up stuff that couldn't be resolved
507 for (std::map<const Type*,ValueList>::iterator LRI = LateResolvers.begin(),
508 E = LateResolvers.end(); LRI != E; ++LRI) {
509 ValueList &List = LRI->second;
510 while (!List.empty()) {
511 Value *V = List.back();
514 std::map<Value*, std::pair<ValID, int> >::iterator PHI =
515 CurModule.PlaceHolderInfo.find(V);
516 assert(PHI != CurModule.PlaceHolderInfo.end() && "Placeholder error!");
518 ValID &DID = PHI->second.first;
520 Value *TheRealValue = getValNonImprovising(LRI->first, DID);
524 V->replaceAllUsesWith(TheRealValue);
526 CurModule.PlaceHolderInfo.erase(PHI);
527 } else if (FutureLateResolvers) {
528 // Functions have their unresolved items forwarded to the module late
530 InsertValue(V, *FutureLateResolvers);
532 if (DID.Type == ValID::NameVal) {
533 GenerateError("Reference to an invalid definition: '" +DID.getName()+
534 "' of type '" + V->getType()->getDescription() + "'",
538 GenerateError("Reference to an invalid definition: #" +
539 itostr(DID.Num) + " of type '" +
540 V->getType()->getDescription() + "'",
548 LateResolvers.clear();
551 // ResolveTypeTo - A brand new type was just declared. This means that (if
552 // name is not null) things referencing Name can be resolved. Otherwise, things
553 // refering to the number can be resolved. Do this now.
555 static void ResolveTypeTo(char *Name, const Type *ToTy) {
557 if (Name) D = ValID::create(Name);
558 else D = ValID::create((int)CurModule.Types.size());
560 std::map<ValID, PATypeHolder>::iterator I =
561 CurModule.LateResolveTypes.find(D);
562 if (I != CurModule.LateResolveTypes.end()) {
563 ((DerivedType*)I->second.get())->refineAbstractTypeTo(ToTy);
564 CurModule.LateResolveTypes.erase(I);
568 // setValueName - Set the specified value to the name given. The name may be
569 // null potentially, in which case this is a noop. The string passed in is
570 // assumed to be a malloc'd string buffer, and is free'd by this function.
572 static void setValueName(Value *V, char *NameStr) {
574 std::string Name(NameStr); // Copy string
575 free(NameStr); // Free old string
577 if (V->getType() == Type::VoidTy) {
578 GenerateError("Can't assign name '" + Name+"' to value with void type!");
582 assert(inFunctionScope() && "Must be in function scope!");
583 SymbolTable &ST = CurFun.CurrentFunction->getSymbolTable();
584 if (ST.lookup(V->getType(), Name)) {
585 GenerateError("Redefinition of value named '" + Name + "' in the '" +
586 V->getType()->getDescription() + "' type plane!");
595 /// ParseGlobalVariable - Handle parsing of a global. If Initializer is null,
596 /// this is a declaration, otherwise it is a definition.
597 static GlobalVariable *
598 ParseGlobalVariable(char *NameStr,GlobalValue::LinkageTypes Linkage,
599 bool isConstantGlobal, const Type *Ty,
600 Constant *Initializer) {
601 if (isa<FunctionType>(Ty)) {
602 GenerateError("Cannot declare global vars of function type!");
606 const PointerType *PTy = PointerType::get(Ty);
610 Name = NameStr; // Copy string
611 free(NameStr); // Free old string
614 // See if this global value was forward referenced. If so, recycle the
618 ID = ValID::create((char*)Name.c_str());
620 ID = ValID::create((int)CurModule.Values[PTy].size());
623 if (GlobalValue *FWGV = CurModule.GetForwardRefForGlobal(PTy, ID)) {
624 // Move the global to the end of the list, from whereever it was
625 // previously inserted.
626 GlobalVariable *GV = cast<GlobalVariable>(FWGV);
627 CurModule.CurrentModule->getGlobalList().remove(GV);
628 CurModule.CurrentModule->getGlobalList().push_back(GV);
629 GV->setInitializer(Initializer);
630 GV->setLinkage(Linkage);
631 GV->setConstant(isConstantGlobal);
632 InsertValue(GV, CurModule.Values);
636 // If this global has a name, check to see if there is already a definition
637 // of this global in the module. If so, merge as appropriate. Note that
638 // this is really just a hack around problems in the CFE. :(
640 // We are a simple redefinition of a value, check to see if it is defined
641 // the same as the old one.
642 if (GlobalVariable *EGV =
643 CurModule.CurrentModule->getGlobalVariable(Name, Ty)) {
644 // We are allowed to redefine a global variable in two circumstances:
645 // 1. If at least one of the globals is uninitialized or
646 // 2. If both initializers have the same value.
648 if (!EGV->hasInitializer() || !Initializer ||
649 EGV->getInitializer() == Initializer) {
651 // Make sure the existing global version gets the initializer! Make
652 // sure that it also gets marked const if the new version is.
653 if (Initializer && !EGV->hasInitializer())
654 EGV->setInitializer(Initializer);
655 if (isConstantGlobal)
656 EGV->setConstant(true);
657 EGV->setLinkage(Linkage);
661 GenerateError("Redefinition of global variable named '" + Name +
662 "' in the '" + Ty->getDescription() + "' type plane!");
667 // Otherwise there is no existing GV to use, create one now.
669 new GlobalVariable(Ty, isConstantGlobal, Linkage, Initializer, Name,
670 CurModule.CurrentModule);
671 InsertValue(GV, CurModule.Values);
675 // setTypeName - Set the specified type to the name given. The name may be
676 // null potentially, in which case this is a noop. The string passed in is
677 // assumed to be a malloc'd string buffer, and is freed by this function.
679 // This function returns true if the type has already been defined, but is
680 // allowed to be redefined in the specified context. If the name is a new name
681 // for the type plane, it is inserted and false is returned.
682 static bool setTypeName(const Type *T, char *NameStr) {
683 assert(!inFunctionScope() && "Can't give types function-local names!");
684 if (NameStr == 0) return false;
686 std::string Name(NameStr); // Copy string
687 free(NameStr); // Free old string
689 // We don't allow assigning names to void type
690 if (T == Type::VoidTy) {
691 GenerateError("Can't assign name '" + Name + "' to the void type!");
695 // Set the type name, checking for conflicts as we do so.
696 bool AlreadyExists = CurModule.CurrentModule->addTypeName(Name, T);
698 if (AlreadyExists) { // Inserting a name that is already defined???
699 const Type *Existing = CurModule.CurrentModule->getTypeByName(Name);
700 assert(Existing && "Conflict but no matching type?");
702 // There is only one case where this is allowed: when we are refining an
703 // opaque type. In this case, Existing will be an opaque type.
704 if (const OpaqueType *OpTy = dyn_cast<OpaqueType>(Existing)) {
705 // We ARE replacing an opaque type!
706 const_cast<OpaqueType*>(OpTy)->refineAbstractTypeTo(T);
710 // Otherwise, this is an attempt to redefine a type. That's okay if
711 // the redefinition is identical to the original. This will be so if
712 // Existing and T point to the same Type object. In this one case we
713 // allow the equivalent redefinition.
714 if (Existing == T) return true; // Yes, it's equal.
716 // Any other kind of (non-equivalent) redefinition is an error.
717 GenerateError("Redefinition of type named '" + Name + "' in the '" +
718 T->getDescription() + "' type plane!");
724 //===----------------------------------------------------------------------===//
725 // Code for handling upreferences in type names...
728 // TypeContains - Returns true if Ty directly contains E in it.
730 static bool TypeContains(const Type *Ty, const Type *E) {
731 return std::find(Ty->subtype_begin(), Ty->subtype_end(),
732 E) != Ty->subtype_end();
737 // NestingLevel - The number of nesting levels that need to be popped before
738 // this type is resolved.
739 unsigned NestingLevel;
741 // LastContainedTy - This is the type at the current binding level for the
742 // type. Every time we reduce the nesting level, this gets updated.
743 const Type *LastContainedTy;
745 // UpRefTy - This is the actual opaque type that the upreference is
749 UpRefRecord(unsigned NL, OpaqueType *URTy)
750 : NestingLevel(NL), LastContainedTy(URTy), UpRefTy(URTy) {}
754 // UpRefs - A list of the outstanding upreferences that need to be resolved.
755 static std::vector<UpRefRecord> UpRefs;
757 /// HandleUpRefs - Every time we finish a new layer of types, this function is
758 /// called. It loops through the UpRefs vector, which is a list of the
759 /// currently active types. For each type, if the up reference is contained in
760 /// the newly completed type, we decrement the level count. When the level
761 /// count reaches zero, the upreferenced type is the type that is passed in:
762 /// thus we can complete the cycle.
764 static PATypeHolder HandleUpRefs(const Type *ty) {
765 // If Ty isn't abstract, or if there are no up-references in it, then there is
766 // nothing to resolve here.
767 if (!ty->isAbstract() || UpRefs.empty()) return ty;
770 UR_OUT("Type '" << Ty->getDescription() <<
771 "' newly formed. Resolving upreferences.\n" <<
772 UpRefs.size() << " upreferences active!\n");
774 // If we find any resolvable upreferences (i.e., those whose NestingLevel goes
775 // to zero), we resolve them all together before we resolve them to Ty. At
776 // the end of the loop, if there is anything to resolve to Ty, it will be in
778 OpaqueType *TypeToResolve = 0;
780 for (unsigned i = 0; i != UpRefs.size(); ++i) {
781 UR_OUT(" UR#" << i << " - TypeContains(" << Ty->getDescription() << ", "
782 << UpRefs[i].second->getDescription() << ") = "
783 << (TypeContains(Ty, UpRefs[i].second) ? "true" : "false") << "\n");
784 if (TypeContains(Ty, UpRefs[i].LastContainedTy)) {
785 // Decrement level of upreference
786 unsigned Level = --UpRefs[i].NestingLevel;
787 UpRefs[i].LastContainedTy = Ty;
788 UR_OUT(" Uplevel Ref Level = " << Level << "\n");
789 if (Level == 0) { // Upreference should be resolved!
790 if (!TypeToResolve) {
791 TypeToResolve = UpRefs[i].UpRefTy;
793 UR_OUT(" * Resolving upreference for "
794 << UpRefs[i].second->getDescription() << "\n";
795 std::string OldName = UpRefs[i].UpRefTy->getDescription());
796 UpRefs[i].UpRefTy->refineAbstractTypeTo(TypeToResolve);
797 UR_OUT(" * Type '" << OldName << "' refined upreference to: "
798 << (const void*)Ty << ", " << Ty->getDescription() << "\n");
800 UpRefs.erase(UpRefs.begin()+i); // Remove from upreference list...
801 --i; // Do not skip the next element...
807 UR_OUT(" * Resolving upreference for "
808 << UpRefs[i].second->getDescription() << "\n";
809 std::string OldName = TypeToResolve->getDescription());
810 TypeToResolve->refineAbstractTypeTo(Ty);
816 /// This function is used to obtain the correct opcode for an instruction when
817 /// an obsolete opcode is encountered. The OI parameter (OpcodeInfo) has both
818 /// an opcode and an "obsolete" flag. These are generated by the lexer and
819 /// the "obsolete" member will be true when the lexer encounters the token for
820 /// an obsolete opcode. For example, "div" was replaced by [usf]div but we need
821 /// to maintain backwards compatibility for asm files that still have the "div"
822 /// instruction. This function handles converting div -> [usf]div appropriately.
823 /// @brief Convert obsolete BinaryOps opcodes to new values
825 sanitizeOpcode(OpcodeInfo<Instruction::BinaryOps> &OI, const Type *Ty)
827 // If its not obsolete, don't do anything
831 // If its a packed type we want to use the element type
832 if (const PackedType *PTy = dyn_cast<PackedType>(Ty))
833 Ty = PTy->getElementType();
835 // Depending on the opcode ..
838 GenerateError("Invalid obsolete opCode (check Lexer.l)");
840 case Instruction::UDiv:
841 // Handle cases where the opcode needs to change
842 if (Ty->isFloatingPoint())
843 OI.opcode = Instruction::FDiv;
844 else if (Ty->isSigned())
845 OI.opcode = Instruction::SDiv;
847 case Instruction::URem:
848 if (Ty->isFloatingPoint())
849 OI.opcode = Instruction::FRem;
850 else if (Ty->isSigned())
851 OI.opcode = Instruction::SRem;
854 // Its not obsolete any more, we fixed it.
858 /// This function is similar to the previous overload of sanitizeOpcode but
859 /// operates on Instruction::OtherOps instead of Instruction::BinaryOps.
860 /// @brief Convert obsolete OtherOps opcodes to new values
862 sanitizeOpcode(OpcodeInfo<Instruction::OtherOps> &OI, const Type *Ty)
864 // If its not obsolete, don't do anything
870 GenerateError("Invalid obsolete opcode (check Lexer.l)");
872 case Instruction::LShr:
874 OI.opcode = Instruction::AShr;
877 // Its not obsolete any more, we fixed it.
881 // common code from the two 'RunVMAsmParser' functions
882 static Module* RunParser(Module * M) {
884 llvmAsmlineno = 1; // Reset the current line number...
885 ObsoleteVarArgs = false;
887 CurModule.CurrentModule = M;
889 // Check to make sure the parser succeeded
896 // Check to make sure that parsing produced a result
900 // Reset ParserResult variable while saving its value for the result.
901 Module *Result = ParserResult;
904 //Not all functions use vaarg, so make a second check for ObsoleteVarArgs
907 if ((F = Result->getNamedFunction("llvm.va_start"))
908 && F->getFunctionType()->getNumParams() == 0)
909 ObsoleteVarArgs = true;
910 if((F = Result->getNamedFunction("llvm.va_copy"))
911 && F->getFunctionType()->getNumParams() == 1)
912 ObsoleteVarArgs = true;
915 if (ObsoleteVarArgs && NewVarArgs) {
917 "This file is corrupt: it uses both new and old style varargs");
921 if(ObsoleteVarArgs) {
922 if(Function* F = Result->getNamedFunction("llvm.va_start")) {
923 if (F->arg_size() != 0) {
924 GenerateError("Obsolete va_start takes 0 argument!");
930 //bar = alloca typeof(foo)
934 const Type* RetTy = Type::getPrimitiveType(Type::VoidTyID);
935 const Type* ArgTy = F->getFunctionType()->getReturnType();
936 const Type* ArgTyPtr = PointerType::get(ArgTy);
937 Function* NF = Result->getOrInsertFunction("llvm.va_start",
938 RetTy, ArgTyPtr, (Type *)0);
940 while (!F->use_empty()) {
941 CallInst* CI = cast<CallInst>(F->use_back());
942 AllocaInst* bar = new AllocaInst(ArgTy, 0, "vastart.fix.1", CI);
943 new CallInst(NF, bar, "", CI);
944 Value* foo = new LoadInst(bar, "vastart.fix.2", CI);
945 CI->replaceAllUsesWith(foo);
946 CI->getParent()->getInstList().erase(CI);
948 Result->getFunctionList().erase(F);
951 if(Function* F = Result->getNamedFunction("llvm.va_end")) {
952 if(F->arg_size() != 1) {
953 GenerateError("Obsolete va_end takes 1 argument!");
959 //bar = alloca 1 of typeof(foo)
961 const Type* RetTy = Type::getPrimitiveType(Type::VoidTyID);
962 const Type* ArgTy = F->getFunctionType()->getParamType(0);
963 const Type* ArgTyPtr = PointerType::get(ArgTy);
964 Function* NF = Result->getOrInsertFunction("llvm.va_end",
965 RetTy, ArgTyPtr, (Type *)0);
967 while (!F->use_empty()) {
968 CallInst* CI = cast<CallInst>(F->use_back());
969 AllocaInst* bar = new AllocaInst(ArgTy, 0, "vaend.fix.1", CI);
970 new StoreInst(CI->getOperand(1), bar, CI);
971 new CallInst(NF, bar, "", CI);
972 CI->getParent()->getInstList().erase(CI);
974 Result->getFunctionList().erase(F);
977 if(Function* F = Result->getNamedFunction("llvm.va_copy")) {
978 if(F->arg_size() != 1) {
979 GenerateError("Obsolete va_copy takes 1 argument!");
984 //a = alloca 1 of typeof(foo)
985 //b = alloca 1 of typeof(foo)
990 const Type* RetTy = Type::getPrimitiveType(Type::VoidTyID);
991 const Type* ArgTy = F->getFunctionType()->getReturnType();
992 const Type* ArgTyPtr = PointerType::get(ArgTy);
993 Function* NF = Result->getOrInsertFunction("llvm.va_copy",
994 RetTy, ArgTyPtr, ArgTyPtr,
997 while (!F->use_empty()) {
998 CallInst* CI = cast<CallInst>(F->use_back());
999 AllocaInst* a = new AllocaInst(ArgTy, 0, "vacopy.fix.1", CI);
1000 AllocaInst* b = new AllocaInst(ArgTy, 0, "vacopy.fix.2", CI);
1001 new StoreInst(CI->getOperand(1), b, CI);
1002 new CallInst(NF, a, b, "", CI);
1003 Value* foo = new LoadInst(a, "vacopy.fix.3", CI);
1004 CI->replaceAllUsesWith(foo);
1005 CI->getParent()->getInstList().erase(CI);
1007 Result->getFunctionList().erase(F);
1014 //===----------------------------------------------------------------------===//
1015 // RunVMAsmParser - Define an interface to this parser
1016 //===----------------------------------------------------------------------===//
1018 Module *llvm::RunVMAsmParser(const std::string &Filename, FILE *F) {
1021 CurFilename = Filename;
1022 return RunParser(new Module(CurFilename));
1025 Module *llvm::RunVMAsmParser(const char * AsmString, Module * M) {
1026 set_scan_string(AsmString);
1028 CurFilename = "from_memory";
1030 return RunParser(new Module (CurFilename));
1032 return RunParser(M);
1039 llvm::Module *ModuleVal;
1040 llvm::Function *FunctionVal;
1041 std::pair<TypeInfo, char*> *ArgVal;
1042 llvm::BasicBlock *BasicBlockVal;
1043 llvm::TerminatorInst *TermInstVal;
1044 llvm::Instruction *InstVal;
1049 std::vector<std::pair<TypeInfo,char*> >*ArgList;
1050 std::vector<ValueInfo> *ValueList;
1051 std::list<TypeInfo> *TypeList;
1052 // Represent the RHS of PHI node
1053 std::list<std::pair<llvm::Value*, llvm::BasicBlock*> > *PHIList;
1054 std::vector<std::pair<llvm::Constant*, llvm::BasicBlock*> > *JumpTable;
1055 std::vector<ConstInfo> *ConstVector;
1057 llvm::GlobalValue::LinkageTypes Linkage;
1065 char *StrVal; // This memory is strdup'd!
1066 llvm::ValID ValIDVal; // strdup'd memory maybe!
1068 BinaryOpInfo BinaryOpVal;
1069 TermOpInfo TermOpVal;
1071 CastOpInfo CastOpVal;
1072 OtherOpInfo OtherOpVal;
1073 llvm::Module::Endianness Endianness;
1076 %type <ModuleVal> Module FunctionList
1077 %type <FunctionVal> Function FunctionProto FunctionHeader BasicBlockList
1078 %type <BasicBlockVal> BasicBlock InstructionList
1079 %type <TermInstVal> BBTerminatorInst
1080 %type <InstVal> Inst InstVal MemoryInst
1081 %type <ConstVal> ConstVal ConstExpr
1082 %type <ConstVector> ConstVector
1083 %type <ArgList> ArgList ArgListH
1084 %type <ArgVal> ArgVal
1085 %type <PHIList> PHIList
1086 %type <ValueList> ValueRefList ValueRefListE // For call param lists
1087 %type <ValueList> IndexList // For GEP derived indices
1088 %type <TypeList> TypeListI ArgTypeListI
1089 %type <JumpTable> JumpTable
1090 %type <BoolVal> GlobalType // GLOBAL or CONSTANT?
1091 %type <BoolVal> OptVolatile // 'volatile' or not
1092 %type <BoolVal> OptTailCall // TAIL CALL or plain CALL.
1093 %type <BoolVal> OptSideEffect // 'sideeffect' or not.
1094 %type <Linkage> OptLinkage
1095 %type <Endianness> BigOrLittle
1097 // ValueRef - Unresolved reference to a definition or BB
1098 %type <ValIDVal> ValueRef ConstValueRef SymbolicValueRef
1099 %type <ValueVal> ResolvedVal // <type> <valref> pair
1100 // Tokens and types for handling constant integer values
1102 // ESINT64VAL - A negative number within long long range
1103 %token <SInt64Val> ESINT64VAL
1105 // EUINT64VAL - A positive number within uns. long long range
1106 %token <UInt64Val> EUINT64VAL
1107 %type <SInt64Val> EINT64VAL
1109 %token <SIntVal> SINTVAL // Signed 32 bit ints...
1110 %token <UIntVal> UINTVAL // Unsigned 32 bit ints...
1111 %type <SIntVal> INTVAL
1112 %token <FPVal> FPVAL // Float or Double constant
1114 // Built in types...
1115 %type <TypeVal> Types TypesV UpRTypes UpRTypesV
1116 %type <TypeVal> SIntType UIntType IntType FPType PrimType // Classifications
1117 %token <TypeVal> VOID BOOL SBYTE UBYTE SHORT USHORT INT UINT LONG ULONG
1118 %token <TypeVal> FLOAT DOUBLE TYPE LABEL
1120 %token <StrVal> VAR_ID LABELSTR STRINGCONSTANT
1121 %type <StrVal> Name OptName OptAssign
1122 %type <UIntVal> OptAlign OptCAlign
1123 %type <StrVal> OptSection SectionString
1125 %token IMPLEMENTATION ZEROINITIALIZER TRUETOK FALSETOK BEGINTOK ENDTOK
1126 %token DECLARE GLOBAL CONSTANT SECTION VOLATILE
1127 %token TO DOTDOTDOT NULL_TOK UNDEF CONST INTERNAL LINKONCE WEAK APPENDING
1128 %token DLLIMPORT DLLEXPORT EXTERN_WEAK
1129 %token OPAQUE NOT EXTERNAL TARGET TRIPLE ENDIAN POINTERSIZE LITTLE BIG ALIGN
1130 %token DEPLIBS CALL TAIL ASM_TOK MODULE SIDEEFFECT
1131 %token CC_TOK CCC_TOK CSRETCC_TOK FASTCC_TOK COLDCC_TOK
1132 %token X86_STDCALLCC_TOK X86_FASTCALLCC_TOK
1134 %type <UIntVal> OptCallingConv
1136 // Basic Block Terminating Operators
1137 %token <TermOpVal> RET BR SWITCH INVOKE UNWIND UNREACHABLE
1140 %type <BinaryOpVal> ArithmeticOps LogicalOps SetCondOps // Binops Subcatagories
1141 %token <BinaryOpVal> ADD SUB MUL UDIV SDIV FDIV UREM SREM FREM AND OR XOR
1142 %token <BinaryOpVal> SETLE SETGE SETLT SETGT SETEQ SETNE // Binary Comparators
1144 // Memory Instructions
1145 %token <MemOpVal> MALLOC ALLOCA FREE LOAD STORE GETELEMENTPTR
1148 %type <CastOpVal> CastOps
1149 %token <CastOpVal> TRUNC ZEXT SEXT FPTRUNC FPEXT BITCAST
1150 %token <CastOpVal> UITOFP SITOFP FPTOUI FPTOSI INTTOPTR PTRTOINT
1153 %type <OtherOpVal> ShiftOps
1154 %token <OtherOpVal> PHI_TOK SELECT SHL LSHR ASHR VAARG
1155 %token <OtherOpVal> EXTRACTELEMENT INSERTELEMENT SHUFFLEVECTOR
1156 %token VAARG_old VANEXT_old //OBSOLETE
1162 // Handle constant integer size restriction and conversion...
1166 if ($1 > (uint32_t)INT32_MAX) // Outside of my range!
1167 GEN_ERROR("Value too large for type!");
1173 EINT64VAL : ESINT64VAL; // These have same type and can't cause problems...
1174 EINT64VAL : EUINT64VAL {
1175 if ($1 > (uint64_t)INT64_MAX) // Outside of my range!
1176 GEN_ERROR("Value too large for type!");
1181 // Operations that are notably excluded from this list include:
1182 // RET, BR, & SWITCH because they end basic blocks and are treated specially.
1184 ArithmeticOps: ADD | SUB | MUL | UDIV | SDIV | FDIV | UREM | SREM | FREM;
1185 LogicalOps : AND | OR | XOR;
1186 SetCondOps : SETLE | SETGE | SETLT | SETGT | SETEQ | SETNE;
1187 CastOps : TRUNC | ZEXT | SEXT | FPTRUNC | FPEXT | BITCAST |
1188 UITOFP | SITOFP | FPTOUI | FPTOSI | INTTOPTR | PTRTOINT;
1189 ShiftOps : SHL | LSHR | ASHR;
1191 // These are some types that allow classification if we only want a particular
1192 // thing... for example, only a signed, unsigned, or integral type.
1193 SIntType : LONG | INT | SHORT | SBYTE;
1194 UIntType : ULONG | UINT | USHORT | UBYTE;
1195 IntType : SIntType | UIntType;
1196 FPType : FLOAT | DOUBLE;
1198 // OptAssign - Value producing statements have an optional assignment component
1199 OptAssign : Name '=' {
1208 OptLinkage : INTERNAL { $$ = GlobalValue::InternalLinkage; } |
1209 LINKONCE { $$ = GlobalValue::LinkOnceLinkage; } |
1210 WEAK { $$ = GlobalValue::WeakLinkage; } |
1211 APPENDING { $$ = GlobalValue::AppendingLinkage; } |
1212 DLLIMPORT { $$ = GlobalValue::DLLImportLinkage; } |
1213 DLLEXPORT { $$ = GlobalValue::DLLExportLinkage; } |
1214 EXTERN_WEAK { $$ = GlobalValue::ExternalWeakLinkage; } |
1215 /*empty*/ { $$ = GlobalValue::ExternalLinkage; };
1217 OptCallingConv : /*empty*/ { $$ = CallingConv::C; } |
1218 CCC_TOK { $$ = CallingConv::C; } |
1219 CSRETCC_TOK { $$ = CallingConv::CSRet; } |
1220 FASTCC_TOK { $$ = CallingConv::Fast; } |
1221 COLDCC_TOK { $$ = CallingConv::Cold; } |
1222 X86_STDCALLCC_TOK { $$ = CallingConv::X86_StdCall; } |
1223 X86_FASTCALLCC_TOK { $$ = CallingConv::X86_FastCall; } |
1225 if ((unsigned)$2 != $2)
1226 GEN_ERROR("Calling conv too large!");
1231 // OptAlign/OptCAlign - An optional alignment, and an optional alignment with
1232 // a comma before it.
1233 OptAlign : /*empty*/ { $$ = 0; } |
1236 if ($$ != 0 && !isPowerOf2_32($$))
1237 GEN_ERROR("Alignment must be a power of two!");
1240 OptCAlign : /*empty*/ { $$ = 0; } |
1241 ',' ALIGN EUINT64VAL {
1243 if ($$ != 0 && !isPowerOf2_32($$))
1244 GEN_ERROR("Alignment must be a power of two!");
1249 SectionString : SECTION STRINGCONSTANT {
1250 for (unsigned i = 0, e = strlen($2); i != e; ++i)
1251 if ($2[i] == '"' || $2[i] == '\\')
1252 GEN_ERROR("Invalid character in section name!");
1257 OptSection : /*empty*/ { $$ = 0; } |
1258 SectionString { $$ = $1; };
1260 // GlobalVarAttributes - Used to pass the attributes string on a global. CurGV
1261 // is set to be the global we are processing.
1263 GlobalVarAttributes : /* empty */ {} |
1264 ',' GlobalVarAttribute GlobalVarAttributes {};
1265 GlobalVarAttribute : SectionString {
1266 CurGV->setSection($1);
1270 | ALIGN EUINT64VAL {
1271 if ($2 != 0 && !isPowerOf2_32($2))
1272 GEN_ERROR("Alignment must be a power of two!");
1273 CurGV->setAlignment($2);
1277 //===----------------------------------------------------------------------===//
1278 // Types includes all predefined types... except void, because it can only be
1279 // used in specific contexts (function returning void for example). To have
1280 // access to it, a user must explicitly use TypesV.
1283 // TypesV includes all of 'Types', but it also includes the void type.
1284 TypesV : Types | VOID {
1285 $$.type = new PATypeHolder($1.type->get());
1286 $$.signedness = $1.signedness;
1288 UpRTypesV : UpRTypes | VOID {
1289 $$.type = new PATypeHolder($1.type->get());
1290 $$.signedness = $1.signedness;
1294 if (!UpRefs.empty())
1295 GEN_ERROR("Invalid upreference in type: " +
1296 ($1.type->get())->getDescription());
1302 // Derived types are added later...
1304 PrimType : BOOL | SBYTE | UBYTE | SHORT | USHORT | INT | UINT ;
1305 PrimType : LONG | ULONG | FLOAT | DOUBLE | TYPE | LABEL;
1307 $$.type = new PATypeHolder(OpaqueType::get());
1308 $$.signedness = isSignless;
1315 UpRTypes : SymbolicValueRef { // Named types are also simple types...
1316 const Type* tmp = getTypeVal($1);
1318 $$.type = new PATypeHolder(tmp);
1319 $$.signedness = isSignless;
1322 // Include derived types in the Types production.
1324 UpRTypes : '\\' EUINT64VAL { // Type UpReference
1325 if ($2 > (uint64_t)~0U) GEN_ERROR("Value out of range!");
1326 OpaqueType *OT = OpaqueType::get(); // Use temporary placeholder
1327 UpRefs.push_back(UpRefRecord((unsigned)$2, OT)); // Add to vector...
1328 $$.type = new PATypeHolder(OT);
1329 $$.signedness = isSignless;
1330 UR_OUT("New Upreference!\n");
1333 | UpRTypesV '(' ArgTypeListI ')' { // Function derived type?
1334 std::vector<const Type*> Params;
1335 for (std::list<TypeInfo>::iterator I = $3->begin(),
1336 E = $3->end(); I != E; ++I)
1337 Params.push_back(I->type->get());
1338 bool isVarArg = Params.size() && Params.back() == Type::VoidTy;
1339 if (isVarArg) Params.pop_back();
1341 $$.type = new PATypeHolder(HandleUpRefs(
1342 FunctionType::get($1.type->get(),Params,isVarArg)));
1343 $$.signedness = isSignless;
1344 delete $3; // Delete the argument list
1348 | '[' EUINT64VAL 'x' UpRTypes ']' { // Sized array type?
1349 $$.type = new PATypeHolder(HandleUpRefs(
1350 ArrayType::get($4.type->get(), (unsigned)$2)));
1351 $$.signedness = isSignless;
1355 | '<' EUINT64VAL 'x' UpRTypes '>' { // Packed array type?
1356 const llvm::Type* ElemTy = $4.type->get();
1357 if ((unsigned)$2 != $2)
1358 GEN_ERROR("Unsigned result not equal to signed result");
1359 if (!ElemTy->isPrimitiveType())
1360 GEN_ERROR("Elemental type of a PackedType must be primitive");
1361 if (!isPowerOf2_32($2))
1362 GEN_ERROR("Vector length should be a power of 2!");
1363 $$.type = new PATypeHolder(HandleUpRefs(
1364 PackedType::get($4.type->get(), (unsigned)$2)));
1365 $$.signedness = isSignless;
1369 | '{' TypeListI '}' { // Structure type?
1370 std::vector<const Type*> Elements;
1371 for (std::list<TypeInfo>::iterator I = $2->begin(),
1372 E = $2->end(); I != E; ++I)
1373 Elements.push_back((*I).type->get());
1375 $$.type = new PATypeHolder(HandleUpRefs(StructType::get(Elements)));
1376 $$.signedness = isSignless;
1380 | '{' '}' { // Empty structure type?
1381 $$.type = new PATypeHolder(StructType::get(std::vector<const Type*>()));
1382 $$.signedness = isSignless;
1385 | UpRTypes '*' { // Pointer type?
1386 if ($1.type->get() == Type::LabelTy)
1387 GEN_ERROR("Cannot form a pointer to a basic block");
1388 $$.type = new PATypeHolder(HandleUpRefs(PointerType::get($1.type->get())));
1389 $$.signedness = isSignless;
1394 // TypeList - Used for struct declarations and as a basis for function type
1395 // declaration type lists
1397 TypeListI : UpRTypes {
1398 $$ = new std::list<TypeInfo>();
1402 | TypeListI ',' UpRTypes {
1403 ($$=$1)->push_back($3);
1407 // ArgTypeList - List of types for a function type declaration...
1408 ArgTypeListI : TypeListI
1409 | TypeListI ',' DOTDOTDOT {
1411 TI.type = new PATypeHolder(Type::VoidTy); TI.signedness = isSignless;
1412 ($$=$1)->push_back(TI);
1417 TI.type = new PATypeHolder(Type::VoidTy); TI.signedness = isSignless;
1418 ($$ = new std::list<TypeInfo>())->push_back(TI);
1422 $$ = new std::list<TypeInfo>();
1426 // ConstVal - The various declarations that go into the constant pool. This
1427 // production is used ONLY to represent constants that show up AFTER a 'const',
1428 // 'constant' or 'global' token at global scope. Constants that can be inlined
1429 // into other expressions (such as integers and constexprs) are handled by the
1430 // ResolvedVal, ValueRef and ConstValueRef productions.
1432 ConstVal: Types '[' ConstVector ']' { // Nonempty unsized arr
1433 const ArrayType *ATy = dyn_cast<ArrayType>($1.type->get());
1435 GEN_ERROR("Cannot make array constant with type: '" +
1436 ($1.type->get())->getDescription() + "'!");
1437 const Type *ETy = ATy->getElementType();
1438 int NumElements = ATy->getNumElements();
1440 // Verify that we have the correct size...
1441 if (NumElements != -1 && NumElements != (int)$3->size())
1442 GEN_ERROR("Type mismatch: constant sized array initialized with " +
1443 utostr($3->size()) + " arguments, but has size of " +
1444 itostr(NumElements) + "!");
1446 // Verify all elements are correct type!
1447 std::vector<Constant*> elems;
1448 for (unsigned i = 0; i < $3->size(); i++) {
1449 if (ETy != (*$3)[i].cnst->getType()) {
1450 GEN_ERROR("Element #" + utostr(i) + " is not of type '" +
1451 ETy->getDescription() +"' as required!\nIt is of type '"+
1452 (*$3)[i].cnst->getType()->getDescription() + "'.");
1454 elems.push_back((*$3)[i].cnst);
1458 $$.cnst = ConstantArray::get(ATy, elems);
1459 $$.signedness = isSignless;
1460 delete $1.type; delete $3;
1464 const ArrayType *ATy = dyn_cast<ArrayType>($1.type->get());
1466 GEN_ERROR("Cannot make array constant with type: '" +
1467 ($1.type->get())->getDescription() + "'!");
1469 int NumElements = ATy->getNumElements();
1470 if (NumElements != -1 && NumElements != 0)
1471 GEN_ERROR("Type mismatch: constant sized array initialized with 0"
1472 " arguments, but has size of " + itostr(NumElements) +"!");
1473 $$.cnst = ConstantArray::get(ATy, std::vector<llvm::Constant*>());
1474 $$.signedness = isSignless;
1478 | Types 'c' STRINGCONSTANT {
1479 const ArrayType *ATy = dyn_cast<ArrayType>($1.type->get());
1481 GEN_ERROR("Cannot make array constant with type: '" +
1482 ($1.type->get())->getDescription() + "'!");
1484 int NumElements = ATy->getNumElements();
1485 const Type *ETy = ATy->getElementType();
1486 char *EndStr = UnEscapeLexed($3, true);
1487 if (NumElements != -1 && NumElements != (EndStr-$3))
1488 GEN_ERROR("Can't build string constant of size " +
1489 itostr((int)(EndStr-$3)) +
1490 " when array has size " + itostr(NumElements) + "!");
1491 std::vector<Constant*> Vals;
1492 if (ETy == Type::SByteTy) {
1493 for (signed char *C = (signed char *)$3; C != (signed char *)EndStr; ++C)
1494 Vals.push_back(ConstantInt::get(ETy, *C));
1495 } else if (ETy == Type::UByteTy) {
1496 for (unsigned char *C = (unsigned char *)$3;
1497 C != (unsigned char*)EndStr; ++C)
1498 Vals.push_back(ConstantInt::get(ETy, *C));
1501 GEN_ERROR("Cannot build string arrays of non byte sized elements!");
1504 $$.cnst = ConstantArray::get(ATy, Vals);
1505 $$.signedness = isSignless;
1509 | Types '<' ConstVector '>' { // Nonempty unsized arr
1510 const PackedType *PTy = dyn_cast<PackedType>($1.type->get());
1512 GEN_ERROR("Cannot make packed constant with type: '" +
1513 $1.type->get()->getDescription() + "'!");
1514 const Type *ETy = PTy->getElementType();
1515 int NumElements = PTy->getNumElements();
1517 // Verify that we have the correct size...
1518 if (NumElements != -1 && NumElements != (int)$3->size())
1519 GEN_ERROR("Type mismatch: constant sized packed initialized with " +
1520 utostr($3->size()) + " arguments, but has size of " +
1521 itostr(NumElements) + "!");
1523 // Verify all elements are correct type!
1524 std::vector<Constant*> elems;
1525 for (unsigned i = 0; i < $3->size(); i++) {
1526 if (ETy != (*$3)[i].cnst->getType()) {
1527 GEN_ERROR("Element #" + utostr(i) + " is not of type '" +
1528 ETy->getDescription() +"' as required!\nIt is of type '"+
1529 (*$3)[i].cnst->getType()->getDescription() + "'.");
1531 elems.push_back((*$3)[i].cnst);
1534 $$.cnst = ConstantPacked::get(PTy, elems);
1535 $$.signedness = isSignless;
1536 delete $1.type; delete $3;
1539 | Types '{' ConstVector '}' {
1540 const StructType *STy = dyn_cast<StructType>($1.type->get());
1542 GEN_ERROR("Cannot make struct constant with type: '" +
1543 $1.type->get()->getDescription() + "'!");
1545 if ($3->size() != STy->getNumContainedTypes())
1546 GEN_ERROR("Illegal number of initializers for structure type!");
1548 // Check to ensure that constants are compatible with the type initializer!
1549 std::vector<Constant*> elems;
1550 for (unsigned i = 0, e = $3->size(); i != e; ++i)
1551 if ((*$3)[i].cnst->getType() != STy->getElementType(i)) {
1552 GEN_ERROR("Expected type '" +
1553 STy->getElementType(i)->getDescription() +
1554 "' for element #" + utostr(i) +
1555 " of structure initializer!");
1557 elems.push_back((*$3)[i].cnst);
1559 $$.cnst = ConstantStruct::get(STy, elems);
1560 $$.signedness = isSignless;
1561 delete $1.type; delete $3;
1565 const StructType *STy = dyn_cast<StructType>($1.type->get());
1567 GEN_ERROR("Cannot make struct constant with type: '" +
1568 $1.type->get()->getDescription() + "'!");
1570 if (STy->getNumContainedTypes() != 0)
1571 GEN_ERROR("Illegal number of initializers for structure type!");
1573 $$.cnst = ConstantStruct::get(STy, std::vector<Constant*>());
1574 $$.signedness = isSignless;
1579 const PointerType *PTy = dyn_cast<PointerType>($1.type->get());
1581 GEN_ERROR("Cannot make null pointer constant with type: '" +
1582 $1.type->get()->getDescription() + "'!");
1584 $$.cnst = ConstantPointerNull::get(PTy);
1585 $$.signedness = isSignless;
1590 $$.cnst = UndefValue::get($1.type->get());
1591 $$.signedness = isSignless;
1595 | Types SymbolicValueRef {
1596 const PointerType *Ty = dyn_cast<PointerType>($1.type->get());
1598 GEN_ERROR("Global const reference must be a pointer type!");
1600 // ConstExprs can exist in the body of a function, thus creating
1601 // GlobalValues whenever they refer to a variable. Because we are in
1602 // the context of a function, getValNonImprovising will search the functions
1603 // symbol table instead of the module symbol table for the global symbol,
1604 // which throws things all off. To get around this, we just tell
1605 // getValNonImprovising that we are at global scope here.
1607 Function *SavedCurFn = CurFun.CurrentFunction;
1608 CurFun.CurrentFunction = 0;
1610 Value *V = getValNonImprovising(Ty, $2);
1613 CurFun.CurrentFunction = SavedCurFn;
1615 // If this is an initializer for a constant pointer, which is referencing a
1616 // (currently) undefined variable, create a stub now that shall be replaced
1617 // in the future with the right type of variable.
1620 assert(isa<PointerType>(Ty) && "Globals may only be used as pointers!");
1621 const PointerType *PT = cast<PointerType>(Ty);
1623 // First check to see if the forward references value is already created!
1624 PerModuleInfo::GlobalRefsType::iterator I =
1625 CurModule.GlobalRefs.find(std::make_pair(PT, $2));
1627 if (I != CurModule.GlobalRefs.end()) {
1628 V = I->second; // Placeholder already exists, use it...
1632 if ($2.Type == ValID::NameVal) Name = $2.Name;
1634 // Create the forward referenced global.
1636 if (const FunctionType *FTy =
1637 dyn_cast<FunctionType>(PT->getElementType())) {
1638 GV = new Function(FTy, GlobalValue::ExternalLinkage, Name,
1639 CurModule.CurrentModule);
1641 GV = new GlobalVariable(PT->getElementType(), false,
1642 GlobalValue::ExternalLinkage, 0,
1643 Name, CurModule.CurrentModule);
1646 // Keep track of the fact that we have a forward ref to recycle it
1647 CurModule.GlobalRefs.insert(std::make_pair(std::make_pair(PT, $2), GV));
1652 $$.cnst = cast<GlobalValue>(V);
1653 $$.signedness = $1.signedness;
1654 delete $1.type; // Free the type handle
1658 if ($1.type->get() != $2.cnst->getType())
1659 GEN_ERROR("Mismatched types for constant expression!");
1664 | Types ZEROINITIALIZER {
1665 const Type *Ty = $1.type->get();
1666 if (isa<FunctionType>(Ty) || Ty == Type::LabelTy || isa<OpaqueType>(Ty))
1667 GEN_ERROR("Cannot create a null initialized value of this type!");
1668 $$.cnst = Constant::getNullValue(Ty);
1669 $$.signedness = isSignless;
1674 ConstVal : SIntType EINT64VAL { // integral constants
1675 if (!ConstantInt::isValueValidForType($1.type->get(), $2))
1676 GEN_ERROR("Constant value doesn't fit in type!");
1677 $$.cnst = ConstantInt::get($1.type->get(), $2);
1678 $$.signedness = $1.signedness;
1681 | UIntType EUINT64VAL { // integral constants
1682 if (!ConstantInt::isValueValidForType($1.type->get(), $2))
1683 GEN_ERROR("Constant value doesn't fit in type!");
1684 $$.cnst = ConstantInt::get($1.type->get(), $2);
1685 $$.signedness = $1.signedness;
1688 | BOOL TRUETOK { // Boolean constants
1689 $$.cnst = ConstantBool::getTrue();
1690 $$.signedness = isSignless;
1693 | BOOL FALSETOK { // Boolean constants
1694 $$.cnst = ConstantBool::getFalse();
1695 $$.signedness = isSignless;
1698 | FPType FPVAL { // Float & Double constants
1699 if (!ConstantFP::isValueValidForType($1.type->get(), $2))
1700 GEN_ERROR("Floating point constant invalid for type!!");
1701 $$.cnst = ConstantFP::get($1.type->get(), $2);
1702 $$.signedness = isSignless;
1707 ConstExpr: CastOps '(' ConstVal TO Types ')' {
1708 Constant *Val = $3.cnst;
1709 const Type *Ty = $5.type->get();
1710 if (!Val->getType()->isFirstClassType())
1711 GEN_ERROR("cast constant expression from a non-primitive type: '" +
1712 Val->getType()->getDescription() + "'!");
1713 if (!Ty->isFirstClassType())
1714 GEN_ERROR("cast constant expression to a non-primitive type: '" +
1715 Ty->getDescription() + "'!");
1717 if (Ty == Type::BoolTy) {
1718 // The previous definition of cast to bool was a compare against zero.
1719 // We have to retain that semantic so we do it here.
1720 $$.cnst = ConstantExpr::get(Instruction::SetNE, Val,
1721 Constant::getNullValue(Val->getType()));
1722 } else if (Val->getType()->isFloatingPoint() && isa<PointerType>(Ty)) {
1723 Constant *CE = ConstantExpr::getFPToUI(Val, Type::ULongTy);
1724 $$.cnst = ConstantExpr::getIntToPtr(CE, Ty);
1726 $$.cnst = ConstantExpr::getCast(Val, Ty);
1729 $$.cnst = ConstantExpr::getCast($1.opcode, $3.cnst, $5.type->get());
1733 | GETELEMENTPTR '(' ConstVal IndexList ')' {
1734 if (!isa<PointerType>($3.cnst->getType()))
1735 GEN_ERROR("GetElementPtr requires a pointer operand!");
1737 std::vector<llvm::Value*> IdxVec;
1738 for (unsigned i = 0, e = $4->size(); i < e; ++i)
1739 if (Constant *C = dyn_cast<Constant>((*$4)[i].val))
1740 IdxVec.push_back(C);
1742 GEN_ERROR("Indices to constant getelementptr must be constants!");
1745 GetElementPtrInst::getIndexedType($3.cnst->getType(), IdxVec, true);
1747 GEN_ERROR("Index list invalid for constant getelementptr!");
1751 $$.cnst = ConstantExpr::getGetElementPtr($3.cnst, IdxVec);
1752 $$.signedness = isSignless;
1755 | SELECT '(' ConstVal ',' ConstVal ',' ConstVal ')' {
1756 if ($3.cnst->getType() != Type::BoolTy)
1757 GEN_ERROR("Select condition must be of boolean type!");
1758 if ($5.cnst->getType() != $7.cnst->getType())
1759 GEN_ERROR("Select operand types must match!");
1760 $$.cnst = ConstantExpr::getSelect($3.cnst, $5.cnst, $7.cnst);
1761 $$.signedness = isSignless;
1764 | ArithmeticOps '(' ConstVal ',' ConstVal ')' {
1765 if ($3.cnst->getType() != $5.cnst->getType())
1766 GEN_ERROR("Binary operator types must match!");
1767 // First, make sure we're dealing with the right opcode by upgrading from
1768 // obsolete versions.
1769 sanitizeOpcode($1, $3.cnst->getType());
1772 // HACK: llvm 1.3 and earlier used to emit invalid pointer constant exprs.
1773 // To retain backward compatibility with these early compilers, we emit a
1774 // cast to the appropriate integer type automatically if we are in the
1775 // broken case. See PR424 for more information.
1776 if (!isa<PointerType>($3.cnst->getType())) {
1777 $$.cnst = ConstantExpr::get($1.opcode, $3.cnst, $5.cnst);
1779 const Type *IntPtrTy = 0;
1780 switch (CurModule.CurrentModule->getPointerSize()) {
1781 case Module::Pointer32: IntPtrTy = Type::IntTy; break;
1782 case Module::Pointer64: IntPtrTy = Type::LongTy; break;
1783 default: GEN_ERROR("invalid pointer binary constant expr!");
1785 $$.cnst = ConstantExpr::get($1.opcode,
1786 ConstantExpr::getCast($3.cnst, IntPtrTy),
1787 ConstantExpr::getCast($5.cnst, IntPtrTy));
1788 $$.cnst = ConstantExpr::getCast($$.cnst, $3.cnst->getType());
1790 $$.signedness = $3.signedness;
1793 | LogicalOps '(' ConstVal ',' ConstVal ')' {
1794 if ($3.cnst->getType() != $5.cnst->getType())
1795 GEN_ERROR("Logical operator types must match!");
1796 if (!$3.cnst->getType()->isIntegral()) {
1797 if (!isa<PackedType>($3.cnst->getType()) ||
1798 !cast<PackedType>($3.cnst->getType())->getElementType()->isIntegral())
1799 GEN_ERROR("Logical operator requires integral operands!");
1801 $$.cnst = ConstantExpr::get($1.opcode, $3.cnst, $5.cnst);
1802 $$.signedness = $3.signedness;
1805 | SetCondOps '(' ConstVal ',' ConstVal ')' {
1806 if ($3.cnst->getType() != $5.cnst->getType())
1807 GEN_ERROR("setcc operand types must match!");
1808 $$.cnst = ConstantExpr::get($1.opcode, $3.cnst, $5.cnst);
1809 $$.signedness = isSignless;
1812 | ShiftOps '(' ConstVal ',' ConstVal ')' {
1813 if ($5.cnst->getType() != Type::UByteTy)
1814 GEN_ERROR("Shift count for shift constant must be unsigned byte!");
1815 if (!$3.cnst->getType()->isInteger())
1816 GEN_ERROR("Shift constant expression requires integer operand!");
1817 // Handle opcode upgrade situations
1818 sanitizeOpcode($1, $3.cnst->getType());
1820 $$.cnst = ConstantExpr::get($1.opcode, $3.cnst, $5.cnst);
1821 $$.signedness = $3.signedness;
1824 | EXTRACTELEMENT '(' ConstVal ',' ConstVal ')' {
1825 if (!ExtractElementInst::isValidOperands($3.cnst, $5.cnst))
1826 GEN_ERROR("Invalid extractelement operands!");
1827 $$.cnst = ConstantExpr::getExtractElement($3.cnst, $5.cnst);
1828 $$.signedness = $3.signedness;
1831 | INSERTELEMENT '(' ConstVal ',' ConstVal ',' ConstVal ')' {
1832 if (!InsertElementInst::isValidOperands($3.cnst, $5.cnst, $7.cnst))
1833 GEN_ERROR("Invalid insertelement operands!");
1834 $$.cnst = ConstantExpr::getInsertElement($3.cnst, $5.cnst, $7.cnst);
1835 $$.signedness = isSignless;
1838 | SHUFFLEVECTOR '(' ConstVal ',' ConstVal ',' ConstVal ')' {
1839 if (!ShuffleVectorInst::isValidOperands($3.cnst, $5.cnst, $7.cnst))
1840 GEN_ERROR("Invalid shufflevector operands!");
1841 $$.cnst = ConstantExpr::getShuffleVector($3.cnst, $5.cnst, $7.cnst);
1842 $$.signedness = isSignless;
1847 // ConstVector - A list of comma separated constants.
1848 ConstVector : ConstVector ',' ConstVal {
1849 ($$ = $1)->push_back($3);
1853 $$ = new std::vector<ConstInfo>();
1859 // GlobalType - Match either GLOBAL or CONSTANT for global declarations...
1860 GlobalType : GLOBAL { $$ = false; } | CONSTANT { $$ = true; };
1863 //===----------------------------------------------------------------------===//
1864 // Rules to match Modules
1865 //===----------------------------------------------------------------------===//
1867 // Module rule: Capture the result of parsing the whole file into a result
1870 Module : FunctionList {
1871 $$ = ParserResult = $1;
1872 CurModule.ModuleDone();
1876 // FunctionList - A list of functions, preceeded by a constant pool.
1878 FunctionList : FunctionList Function {
1880 CurFun.FunctionDone();
1883 | FunctionList FunctionProto {
1887 | FunctionList MODULE ASM_TOK AsmBlock {
1891 | FunctionList IMPLEMENTATION {
1896 $$ = CurModule.CurrentModule;
1897 // Emit an error if there are any unresolved types left.
1898 if (!CurModule.LateResolveTypes.empty()) {
1899 const ValID &DID = CurModule.LateResolveTypes.begin()->first;
1900 if (DID.Type == ValID::NameVal) {
1901 GEN_ERROR("Reference to an undefined type: '"+DID.getName() + "'");
1903 GEN_ERROR("Reference to an undefined type: #" + itostr(DID.Num));
1909 // ConstPool - Constants with optional names assigned to them.
1910 ConstPool : ConstPool OptAssign TYPE TypesV {
1911 // Eagerly resolve types. This is not an optimization, this is a
1912 // requirement that is due to the fact that we could have this:
1914 // %list = type { %list * }
1915 // %list = type { %list * } ; repeated type decl
1917 // If types are not resolved eagerly, then the two types will not be
1918 // determined to be the same type!
1920 ResolveTypeTo($2, $4.type->get());
1922 if (!setTypeName($4.type->get(), $2) && !$2) {
1924 // If this is a named type that is not a redefinition, add it to the slot
1926 CurModule.Types.push_back(*($4.type));
1932 | ConstPool FunctionProto { // Function prototypes can be in const pool
1935 | ConstPool MODULE ASM_TOK AsmBlock { // Asm blocks can be in the const pool
1938 | ConstPool OptAssign OptLinkage GlobalType ConstVal {
1940 GEN_ERROR("Global value initializer is not a constant!");
1941 CurGV = ParseGlobalVariable($2, $3, $4, $5.cnst->getType(), $5.cnst);
1943 } GlobalVarAttributes {
1946 | ConstPool OptAssign EXTERNAL GlobalType Types {
1947 CurGV = ParseGlobalVariable($2, GlobalValue::ExternalLinkage, $4,
1951 } GlobalVarAttributes {
1955 | ConstPool OptAssign DLLIMPORT GlobalType Types {
1956 CurGV = ParseGlobalVariable($2, GlobalValue::DLLImportLinkage, $4,
1960 } GlobalVarAttributes {
1964 | ConstPool OptAssign EXTERN_WEAK GlobalType Types {
1966 ParseGlobalVariable($2, GlobalValue::ExternalWeakLinkage, $4,
1970 } GlobalVarAttributes {
1974 | ConstPool TARGET TargetDefinition {
1977 | ConstPool DEPLIBS '=' LibrariesDefinition {
1980 | /* empty: end of list */ {
1984 AsmBlock : STRINGCONSTANT {
1985 const std::string &AsmSoFar = CurModule.CurrentModule->getModuleInlineAsm();
1986 char *EndStr = UnEscapeLexed($1, true);
1987 std::string NewAsm($1, EndStr);
1990 if (AsmSoFar.empty())
1991 CurModule.CurrentModule->setModuleInlineAsm(NewAsm);
1993 CurModule.CurrentModule->setModuleInlineAsm(AsmSoFar+"\n"+NewAsm);
1997 BigOrLittle : BIG { $$ = Module::BigEndian; };
1998 BigOrLittle : LITTLE { $$ = Module::LittleEndian; };
2000 TargetDefinition : ENDIAN '=' BigOrLittle {
2001 CurModule.CurrentModule->setEndianness($3);
2004 | POINTERSIZE '=' EUINT64VAL {
2006 CurModule.CurrentModule->setPointerSize(Module::Pointer32);
2008 CurModule.CurrentModule->setPointerSize(Module::Pointer64);
2010 GEN_ERROR("Invalid pointer size: '" + utostr($3) + "'!");
2013 | TRIPLE '=' STRINGCONSTANT {
2014 CurModule.CurrentModule->setTargetTriple($3);
2017 | DATALAYOUT '=' STRINGCONSTANT {
2018 CurModule.CurrentModule->setDataLayout($3);
2022 LibrariesDefinition : '[' LibList ']';
2024 LibList : LibList ',' STRINGCONSTANT {
2025 CurModule.CurrentModule->addLibrary($3);
2030 CurModule.CurrentModule->addLibrary($1);
2034 | /* empty: end of list */ {
2039 //===----------------------------------------------------------------------===//
2040 // Rules to match Function Headers
2041 //===----------------------------------------------------------------------===//
2043 Name : VAR_ID | STRINGCONSTANT;
2044 OptName : Name | /*empty*/ { $$ = 0; };
2046 ArgVal : Types OptName {
2047 if ($1.type->get() == Type::VoidTy)
2048 GEN_ERROR("void typed arguments are invalid!");
2049 $$ = new std::pair<TypeInfo, char*>($1, $2);
2053 ArgListH : ArgListH ',' ArgVal {
2060 $$ = new std::vector<std::pair<TypeInfo,char*> >();
2066 ArgList : ArgListH {
2070 | ArgListH ',' DOTDOTDOT {
2073 TI.type = new PATypeHolder(Type::VoidTy);
2074 TI.signedness = isSignless;
2075 $$->push_back(std::pair<TypeInfo,char*>(TI,(char*)0));
2079 $$ = new std::vector<std::pair<TypeInfo,char*> >();
2081 TI.type = new PATypeHolder(Type::VoidTy);
2082 TI.signedness = isSignless;
2083 $$->push_back(std::make_pair(TI, (char*)0));
2091 FunctionHeaderH : OptCallingConv TypesV Name '(' ArgList ')'
2092 OptSection OptAlign {
2094 std::string FunctionName($3);
2095 free($3); // Free strdup'd memory!
2097 if (!($2.type->get())->isFirstClassType() && $2.type->get() != Type::VoidTy)
2098 GEN_ERROR("LLVM functions cannot return aggregate types!");
2100 std::vector<const Type*> ParamTypeList;
2101 if ($5) { // If there are arguments...
2102 for (std::vector<std::pair<TypeInfo,char*> >::iterator I = $5->begin();
2103 I != $5->end(); ++I)
2104 ParamTypeList.push_back(I->first.type->get());
2107 bool isVarArg = ParamTypeList.size() && ParamTypeList.back() == Type::VoidTy;
2108 if (isVarArg) ParamTypeList.pop_back();
2110 const FunctionType *FT = FunctionType::get($2.type->get(), ParamTypeList,
2112 const PointerType *PFT = PointerType::get(FT);
2116 if (!FunctionName.empty()) {
2117 ID = ValID::create((char*)FunctionName.c_str());
2119 ID = ValID::create((int)CurModule.Values[PFT].size());
2123 // See if this function was forward referenced. If so, recycle the object.
2124 if (GlobalValue *FWRef = CurModule.GetForwardRefForGlobal(PFT, ID)) {
2125 // Move the function to the end of the list, from whereever it was
2126 // previously inserted.
2127 Fn = cast<Function>(FWRef);
2128 CurModule.CurrentModule->getFunctionList().remove(Fn);
2129 CurModule.CurrentModule->getFunctionList().push_back(Fn);
2130 } else if (!FunctionName.empty() && // Merge with an earlier prototype?
2131 (Fn = CurModule.CurrentModule->getFunction(FunctionName, FT))) {
2132 // If this is the case, either we need to be a forward decl, or it needs
2134 if (!CurFun.isDeclare && !Fn->isExternal())
2135 GEN_ERROR("Redefinition of function '" + FunctionName + "'!");
2137 // Make sure to strip off any argument names so we can't get conflicts.
2138 if (Fn->isExternal())
2139 for (Function::arg_iterator AI = Fn->arg_begin(), AE = Fn->arg_end();
2142 } else { // Not already defined?
2143 Fn = new Function(FT, GlobalValue::ExternalLinkage, FunctionName,
2144 CurModule.CurrentModule);
2146 InsertValue(Fn, CurModule.Values);
2149 CurFun.FunctionStart(Fn);
2151 if (CurFun.isDeclare) {
2152 // If we have declaration, always overwrite linkage. This will allow us to
2153 // correctly handle cases, when pointer to function is passed as argument to
2154 // another function.
2155 Fn->setLinkage(CurFun.Linkage);
2157 Fn->setCallingConv($1);
2158 Fn->setAlignment($8);
2164 // Add all of the arguments we parsed to the function...
2165 if ($5) { // Is null if empty...
2166 if (isVarArg) { // Nuke the last entry
2167 assert($5->back().first.type->get() == Type::VoidTy &&
2168 $5->back().second == 0 && "Not a varargs marker!");
2169 delete $5->back().first.type;
2170 $5->pop_back(); // Delete the last entry
2172 Function::arg_iterator ArgIt = Fn->arg_begin();
2173 for (std::vector<std::pair<TypeInfo,char*> >::iterator I = $5->begin();
2174 I != $5->end(); ++I, ++ArgIt) {
2175 delete I->first.type; // Delete the typeholder...
2176 setValueName(ArgIt, I->second); // Insert arg into symtab...
2180 delete $5; // We're now done with the argument list
2185 BEGIN : BEGINTOK | '{'; // Allow BEGIN or '{' to start a function
2187 FunctionHeader : OptLinkage FunctionHeaderH BEGIN {
2188 $$ = CurFun.CurrentFunction;
2190 // Make sure that we keep track of the linkage type even if there was a
2191 // previous "declare".
2195 END : ENDTOK | '}'; // Allow end of '}' to end a function
2197 Function : BasicBlockList END {
2202 FnDeclareLinkage: /*default*/ |
2203 DLLIMPORT { CurFun.Linkage = GlobalValue::DLLImportLinkage; } |
2204 EXTERN_WEAK { CurFun.Linkage = GlobalValue::DLLImportLinkage; };
2206 FunctionProto : DECLARE { CurFun.isDeclare = true; } FnDeclareLinkage FunctionHeaderH {
2207 $$ = CurFun.CurrentFunction;
2208 CurFun.FunctionDone();
2212 //===----------------------------------------------------------------------===//
2213 // Rules to match Basic Blocks
2214 //===----------------------------------------------------------------------===//
2216 OptSideEffect : /* empty */ {
2225 ConstValueRef : ESINT64VAL { // A reference to a direct constant
2226 $$ = ValID::create($1);
2230 $$ = ValID::create($1);
2233 | FPVAL { // Perhaps it's an FP constant?
2234 $$ = ValID::create($1);
2238 $$ = ValID::create(ConstantBool::getTrue());
2242 $$ = ValID::create(ConstantBool::getFalse());
2246 $$ = ValID::createNull();
2250 $$ = ValID::createUndef();
2253 | ZEROINITIALIZER { // A vector zero constant.
2254 $$ = ValID::createZeroInit();
2257 | '<' ConstVector '>' { // Nonempty unsized packed vector
2258 const Type *ETy = (*$2)[0].cnst->getType();
2259 int NumElements = $2->size();
2261 PackedType* pt = PackedType::get(ETy, NumElements);
2262 PATypeHolder* PTy = new PATypeHolder(
2263 HandleUpRefs(PackedType::get( ETy, NumElements)));
2265 // Verify all elements are correct type!
2266 std::vector<Constant*> elems;
2267 for (unsigned i = 0; i < $2->size(); i++) {
2268 if (ETy != (*$2)[i].cnst->getType()) {
2269 GEN_ERROR("Element #" + utostr(i) + " is not of type '" +
2270 ETy->getDescription() +"' as required!\nIt is of type '" +
2271 (*$2)[i].cnst->getType()->getDescription() + "'.");
2273 elems.push_back((*$2)[i].cnst);
2276 $$ = ValID::create(ConstantPacked::get(pt, elems));
2277 delete PTy; delete $2;
2281 $$ = ValID::create($1.cnst);
2284 | ASM_TOK OptSideEffect STRINGCONSTANT ',' STRINGCONSTANT {
2285 char *End = UnEscapeLexed($3, true);
2286 std::string AsmStr = std::string($3, End);
2287 End = UnEscapeLexed($5, true);
2288 std::string Constraints = std::string($5, End);
2289 $$ = ValID::createInlineAsm(AsmStr, Constraints, $2);
2295 // SymbolicValueRef - Reference to one of two ways of symbolically refering to
2298 SymbolicValueRef : INTVAL { // Is it an integer reference...?
2299 $$ = ValID::create($1);
2302 | Name { // Is it a named reference...?
2303 $$ = ValID::create($1);
2307 // ValueRef - A reference to a definition... either constant or symbolic
2308 ValueRef : SymbolicValueRef | ConstValueRef;
2311 // ResolvedVal - a <type> <value> pair. This is used only in cases where the
2312 // type immediately preceeds the value reference, and allows complex constant
2313 // pool references (for things like: 'ret [2 x int] [ int 12, int 42]')
2314 ResolvedVal : Types ValueRef {
2315 $$.val = getVal($1.type->get(), $2);
2318 $$.signedness = $1.signedness;
2321 BasicBlockList : BasicBlockList BasicBlock {
2325 | FunctionHeader BasicBlock { // Do not allow functions with 0 basic blocks
2331 // Basic blocks are terminated by branching instructions:
2332 // br, br/cc, switch, ret
2334 BasicBlock : InstructionList OptAssign BBTerminatorInst {
2335 setValueName($3, $2);
2339 $1->getInstList().push_back($3);
2345 InstructionList : InstructionList Inst {
2346 if (CastInst *CI1 = dyn_cast<CastInst>($2))
2347 if (CastInst *CI2 = dyn_cast<CastInst>(CI1->getOperand(0)))
2348 if (CI2->getParent() == 0)
2349 $1->getInstList().push_back(CI2);
2350 $1->getInstList().push_back($2);
2355 $$ = CurBB = getBBVal(ValID::create((int)CurFun.NextBBNum++), true);
2358 // Make sure to move the basic block to the correct location in the
2359 // function, instead of leaving it inserted wherever it was first
2361 Function::BasicBlockListType &BBL =
2362 CurFun.CurrentFunction->getBasicBlockList();
2363 BBL.splice(BBL.end(), BBL, $$);
2367 $$ = CurBB = getBBVal(ValID::create($1), true);
2370 // Make sure to move the basic block to the correct location in the
2371 // function, instead of leaving it inserted wherever it was first
2373 Function::BasicBlockListType &BBL =
2374 CurFun.CurrentFunction->getBasicBlockList();
2375 BBL.splice(BBL.end(), BBL, $$);
2379 BBTerminatorInst : RET ResolvedVal { // Return with a result...
2380 $$ = new ReturnInst($2.val);
2383 | RET VOID { // Return with no result...
2384 $$ = new ReturnInst();
2387 | BR LABEL ValueRef { // Unconditional Branch...
2388 BasicBlock* tmpBB = getBBVal($3);
2390 $$ = new BranchInst(tmpBB);
2391 } // Conditional Branch...
2392 | BR BOOL ValueRef ',' LABEL ValueRef ',' LABEL ValueRef {
2393 BasicBlock* tmpBBA = getBBVal($6);
2395 BasicBlock* tmpBBB = getBBVal($9);
2397 Value* tmpVal = getVal(Type::BoolTy, $3);
2399 $$ = new BranchInst(tmpBBA, tmpBBB, tmpVal);
2401 | SWITCH IntType ValueRef ',' LABEL ValueRef '[' JumpTable ']' {
2402 Value* tmpVal = getVal($2.type->get(), $3);
2404 BasicBlock* tmpBB = getBBVal($6);
2406 SwitchInst *S = new SwitchInst(tmpVal, tmpBB, $8->size());
2409 std::vector<std::pair<Constant*,BasicBlock*> >::iterator I = $8->begin(),
2411 for (; I != E; ++I) {
2412 if (ConstantInt *CI = dyn_cast<ConstantInt>(I->first))
2413 S->addCase(CI, I->second);
2415 GEN_ERROR("Switch case is constant, but not a simple integer!");
2420 | SWITCH IntType ValueRef ',' LABEL ValueRef '[' ']' {
2421 Value* tmpVal = getVal($2.type->get(), $3);
2423 BasicBlock* tmpBB = getBBVal($6);
2425 SwitchInst *S = new SwitchInst(tmpVal, tmpBB, 0);
2429 | INVOKE OptCallingConv TypesV ValueRef '(' ValueRefListE ')'
2430 TO LABEL ValueRef UNWIND LABEL ValueRef {
2431 const PointerType *PFTy;
2432 const FunctionType *Ty;
2434 if (!(PFTy = dyn_cast<PointerType>($3.type->get())) ||
2435 !(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) {
2436 // Pull out the types of all of the arguments...
2437 std::vector<const Type*> ParamTypes;
2439 for (std::vector<ValueInfo>::iterator I = $6->begin(), E = $6->end();
2441 ParamTypes.push_back((*I).val->getType());
2444 bool isVarArg = ParamTypes.size() && ParamTypes.back() == Type::VoidTy;
2445 if (isVarArg) ParamTypes.pop_back();
2447 Ty = FunctionType::get($3.type->get(), ParamTypes, isVarArg);
2448 PFTy = PointerType::get(Ty);
2451 Value *V = getVal(PFTy, $4); // Get the function we're calling...
2453 BasicBlock *Normal = getBBVal($10);
2455 BasicBlock *Except = getBBVal($13);
2458 // Create the call node...
2459 if (!$6) { // Has no arguments?
2460 $$ = new InvokeInst(V, Normal, Except, std::vector<Value*>());
2461 } else { // Has arguments?
2462 // Loop through FunctionType's arguments and ensure they are specified
2465 FunctionType::param_iterator I = Ty->param_begin();
2466 FunctionType::param_iterator E = Ty->param_end();
2467 std::vector<ValueInfo>::iterator ArgI = $6->begin(), ArgE = $6->end();
2469 std::vector<Value*> args;
2470 for (; ArgI != ArgE; ++ArgI)
2472 if (Ty->isVarArg()) {
2473 args.push_back((*ArgI).val);
2475 GEN_ERROR("Too many parameters for function of type " +
2476 Ty->getDescription());
2479 if ((*ArgI).val->getType() != *I) {
2480 GEN_ERROR("Parameter " + (*ArgI).val->getName() +
2481 " is not of type '" + (*I)->getDescription() + "'!");
2483 args.push_back((*ArgI).val);
2486 $$ = new InvokeInst(V, Normal, Except, args);
2488 cast<InvokeInst>($$)->setCallingConv($2);
2495 $$ = new UnwindInst();
2499 $$ = new UnreachableInst();
2505 JumpTable : JumpTable IntType ConstValueRef ',' LABEL ValueRef {
2507 Constant *V = cast<Constant>(getValNonImprovising($2.type->get(), $3));
2510 GEN_ERROR("May only switch on a constant pool value!");
2512 BasicBlock* tmpBB = getBBVal($6);
2514 $$->push_back(std::make_pair(V, tmpBB));
2516 | IntType ConstValueRef ',' LABEL ValueRef {
2517 $$ = new std::vector<std::pair<Constant*, BasicBlock*> >();
2518 Constant *V = cast<Constant>(getValNonImprovising($1.type->get(), $2));
2522 GEN_ERROR("May only switch on a constant pool value!");
2524 BasicBlock* tmpBB = getBBVal($5);
2526 $$->push_back(std::make_pair(V, tmpBB));
2529 Inst : OptAssign InstVal {
2530 // Is this definition named?? if so, assign the name...
2531 setValueName($2, $1);
2538 PHIList : Types '[' ValueRef ',' ValueRef ']' { // Used for PHI nodes
2539 $$ = new std::list<std::pair<Value*, BasicBlock*> >();
2540 Value* tmpVal = getVal($1.type->get(), $3);
2542 BasicBlock* tmpBB = getBBVal($5);
2544 $$->push_back(std::make_pair(tmpVal, tmpBB));
2547 | PHIList ',' '[' ValueRef ',' ValueRef ']' {
2549 Value* tmpVal = getVal($1->front().first->getType(), $4);
2551 BasicBlock* tmpBB = getBBVal($6);
2553 $1->push_back(std::make_pair(tmpVal, tmpBB));
2557 ValueRefList : ResolvedVal { // Used for call statements, and memory insts...
2558 $$ = new std::vector<ValueInfo>();
2561 | ValueRefList ',' ResolvedVal {
2567 // ValueRefListE - Just like ValueRefList, except that it may also be empty!
2568 ValueRefListE : ValueRefList {
2575 OptTailCall : TAIL CALL {
2584 InstVal : ArithmeticOps Types ValueRef ',' ValueRef {
2585 if (!$2.type->get()->isInteger() && !$2.type->get()->isFloatingPoint() &&
2586 !isa<PackedType>($2.type->get()))
2588 "Arithmetic operator requires integer, FP, or packed operands!");
2589 if (isa<PackedType>($2.type->get()) &&
2590 ($1.opcode == Instruction::URem ||
2591 $1.opcode == Instruction::SRem ||
2592 $1.opcode == Instruction::FRem))
2593 GEN_ERROR("U/S/FRem not supported on packed types!");
2594 // Upgrade the opcode from obsolete versions before we do anything with it.
2595 sanitizeOpcode($1,$2.type->get());
2597 Value* val1 = getVal($2.type->get(), $3);
2599 Value* val2 = getVal($2.type->get(), $5);
2601 $$ = BinaryOperator::create($1.opcode, val1, val2);
2603 GEN_ERROR("binary operator returned null!");
2606 | LogicalOps Types ValueRef ',' ValueRef {
2607 if (!$2.type->get()->isIntegral()) {
2608 if (!isa<PackedType>($2.type->get()) ||
2609 !cast<PackedType>($2.type->get())->getElementType()->isIntegral())
2610 GEN_ERROR("Logical operator requires integral operands!");
2612 Value* tmpVal1 = getVal($2.type->get(), $3);
2614 Value* tmpVal2 = getVal($2.type->get(), $5);
2616 $$ = BinaryOperator::create($1.opcode, tmpVal1, tmpVal2);
2618 GEN_ERROR("binary operator returned null!");
2621 | SetCondOps Types ValueRef ',' ValueRef {
2622 if(isa<PackedType>($2.type->get())) {
2624 "PackedTypes currently not supported in setcc instructions!");
2626 Value* tmpVal1 = getVal($2.type->get(), $3);
2628 Value* tmpVal2 = getVal($2.type->get(), $5);
2630 $$ = new SetCondInst($1.opcode, tmpVal1, tmpVal2);
2632 GEN_ERROR("binary operator returned null!");
2636 llvm_cerr << "WARNING: Use of eliminated 'not' instruction:"
2637 << " Replacing with 'xor'.\n";
2639 Value *Ones = ConstantIntegral::getAllOnesValue($2.val->getType());
2641 GEN_ERROR("Expected integral type for not instruction!");
2643 $$ = BinaryOperator::create(Instruction::Xor, $2.val, Ones);
2645 GEN_ERROR("Could not create a xor instruction!");
2648 | ShiftOps ResolvedVal ',' ResolvedVal {
2649 if ($4.val->getType() != Type::UByteTy)
2650 GEN_ERROR("Shift amount must be ubyte!");
2651 if (!$2.val->getType()->isInteger())
2652 GEN_ERROR("Shift constant expression requires integer operand!");
2653 // Handle opcode upgrade situations
2654 sanitizeOpcode($1, $2.val->getType());
2656 $$ = new ShiftInst($1.opcode, $2.val, $4.val);
2659 | CastOps ResolvedVal TO Types {
2660 Value* Val = $2.val;
2661 const Type* Ty = $4.type->get();
2662 if (!Val->getType()->isFirstClassType())
2663 GEN_ERROR("cast from a non-primitive type: '" +
2664 Val->getType()->getDescription() + "'!");
2665 if (!Ty->isFirstClassType())
2666 GEN_ERROR("cast to a non-primitive type: '" + Ty->getDescription() +"'!");
2669 if (Ty == Type::BoolTy) {
2670 // The previous definition of cast to bool was a compare against zero.
2671 // We have to retain that semantic so we do it here.
2672 $$ = new SetCondInst(Instruction::SetNE, $2.val,
2673 Constant::getNullValue($2.val->getType()));
2674 } else if (Val->getType()->isFloatingPoint() && isa<PointerType>(Ty)) {
2675 CastInst *CI = new FPToUIInst(Val, Type::ULongTy);
2676 $$ = new IntToPtrInst(CI, Ty);
2678 $$ = CastInst::createInferredCast(Val, Ty);
2681 $$ = CastInst::create($1.opcode, $2.val, $4.type->get());
2685 | SELECT ResolvedVal ',' ResolvedVal ',' ResolvedVal {
2686 if ($2.val->getType() != Type::BoolTy)
2687 GEN_ERROR("select condition must be boolean!");
2688 if ($4.val->getType() != $6.val->getType())
2689 GEN_ERROR("select value types should match!");
2690 $$ = new SelectInst($2.val, $4.val, $6.val);
2693 | VAARG ResolvedVal ',' Types {
2695 $$ = new VAArgInst($2.val, $4.type->get());
2699 | VAARG_old ResolvedVal ',' Types {
2700 ObsoleteVarArgs = true;
2701 const Type* ArgTy = $2.val->getType();
2702 Function* NF = CurModule.CurrentModule->
2703 getOrInsertFunction("llvm.va_copy", ArgTy, ArgTy, (Type *)0);
2706 //foo = alloca 1 of t
2710 AllocaInst* foo = new AllocaInst(ArgTy, 0, "vaarg.fix");
2711 CurBB->getInstList().push_back(foo);
2712 CallInst* bar = new CallInst(NF, $2.val);
2713 CurBB->getInstList().push_back(bar);
2714 CurBB->getInstList().push_back(new StoreInst(bar, foo));
2715 $$ = new VAArgInst(foo, $4.type->get());
2719 | VANEXT_old ResolvedVal ',' Types {
2720 ObsoleteVarArgs = true;
2721 const Type* ArgTy = $2.val->getType();
2722 Function* NF = CurModule.CurrentModule->
2723 getOrInsertFunction("llvm.va_copy", ArgTy, ArgTy, (Type *)0);
2725 //b = vanext a, t ->
2726 //foo = alloca 1 of t
2729 //tmp = vaarg foo, t
2731 AllocaInst* foo = new AllocaInst(ArgTy, 0, "vanext.fix");
2732 CurBB->getInstList().push_back(foo);
2733 CallInst* bar = new CallInst(NF, $2.val);
2734 CurBB->getInstList().push_back(bar);
2735 CurBB->getInstList().push_back(new StoreInst(bar, foo));
2736 Instruction* tmp = new VAArgInst(foo, $4.type->get());
2737 CurBB->getInstList().push_back(tmp);
2738 $$ = new LoadInst(foo);
2742 | EXTRACTELEMENT ResolvedVal ',' ResolvedVal {
2743 if (!ExtractElementInst::isValidOperands($2.val, $4.val))
2744 GEN_ERROR("Invalid extractelement operands!");
2745 $$ = new ExtractElementInst($2.val, $4.val);
2748 | INSERTELEMENT ResolvedVal ',' ResolvedVal ',' ResolvedVal {
2749 if (!InsertElementInst::isValidOperands($2.val, $4.val, $6.val))
2750 GEN_ERROR("Invalid insertelement operands!");
2751 $$ = new InsertElementInst($2.val, $4.val, $6.val);
2754 | SHUFFLEVECTOR ResolvedVal ',' ResolvedVal ',' ResolvedVal {
2755 if (!ShuffleVectorInst::isValidOperands($2.val, $4.val, $6.val))
2756 GEN_ERROR("Invalid shufflevector operands!");
2757 $$ = new ShuffleVectorInst($2.val, $4.val, $6.val);
2761 const Type *Ty = $2->front().first->getType();
2762 if (!Ty->isFirstClassType())
2763 GEN_ERROR("PHI node operands must be of first class type!");
2764 $$ = new PHINode(Ty);
2765 ((PHINode*)$$)->reserveOperandSpace($2->size());
2766 while ($2->begin() != $2->end()) {
2767 if ($2->front().first->getType() != Ty)
2768 GEN_ERROR("All elements of a PHI node must be of the same type!");
2769 cast<PHINode>($$)->addIncoming($2->front().first, $2->front().second);
2772 delete $2; // Free the list...
2775 | OptTailCall OptCallingConv TypesV ValueRef '(' ValueRefListE ')' {
2776 const PointerType *PFTy = 0;
2777 const FunctionType *Ty = 0;
2779 if (!(PFTy = dyn_cast<PointerType>($3.type->get())) ||
2780 !(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) {
2781 // Pull out the types of all of the arguments...
2782 std::vector<const Type*> ParamTypes;
2784 for (std::vector<ValueInfo>::iterator I = $6->begin(), E = $6->end();
2786 ParamTypes.push_back((*I).val->getType());
2789 bool isVarArg = ParamTypes.size() && ParamTypes.back() == Type::VoidTy;
2790 if (isVarArg) ParamTypes.pop_back();
2792 if (!$3.type->get()->isFirstClassType() &&
2793 $3.type->get() != Type::VoidTy)
2794 GEN_ERROR("LLVM functions cannot return aggregate types!");
2796 Ty = FunctionType::get($3.type->get(), ParamTypes, isVarArg);
2797 PFTy = PointerType::get(Ty);
2800 Value *V = getVal(PFTy, $4); // Get the function we're calling...
2803 // Create the call node...
2804 if (!$6) { // Has no arguments?
2805 // Make sure no arguments is a good thing!
2806 if (Ty->getNumParams() != 0)
2807 GEN_ERROR("No arguments passed to a function that "
2808 "expects arguments!");
2810 $$ = new CallInst(V, std::vector<Value*>());
2811 } else { // Has arguments?
2812 // Loop through FunctionType's arguments and ensure they are specified
2815 FunctionType::param_iterator I = Ty->param_begin();
2816 FunctionType::param_iterator E = Ty->param_end();
2817 std::vector<ValueInfo>::iterator ArgI = $6->begin(), ArgE = $6->end();
2819 std::vector<Value*> args;
2820 for (; ArgI != ArgE ; ++ArgI)
2822 if (Ty->isVarArg()) {
2823 args.push_back((*ArgI).val);
2825 GEN_ERROR("Too many parameters for function of type " +
2826 Ty->getDescription());
2829 if ((*ArgI).val->getType() != *I) {
2830 GEN_ERROR("Parameter " + (*ArgI).val->getName() +
2831 " is not of type '" + (*I)->getDescription() + "'!");
2833 args.push_back((*ArgI).val);
2837 if (I != E || (ArgI != ArgE && !Ty->isVarArg()))
2838 GEN_ERROR("Invalid number of parameters detected!");
2840 $$ = new CallInst(V, args);
2842 cast<CallInst>($$)->setTailCall($1);
2843 cast<CallInst>($$)->setCallingConv($2);
2854 // IndexList - List of indices for GEP based instructions...
2855 IndexList : ',' ValueRefList {
2859 $$ = new std::vector<ValueInfo>();
2863 OptVolatile : VOLATILE {
2874 MemoryInst : MALLOC Types OptCAlign {
2875 $$ = new MallocInst($2.type->get(), 0, $3);
2879 | MALLOC Types ',' UINT ValueRef OptCAlign {
2880 Value* tmpVal = getVal($4.type->get(), $5);
2882 $$ = new MallocInst($2.type->get(), tmpVal, $6);
2885 | ALLOCA Types OptCAlign {
2886 $$ = new AllocaInst($2.type->get(), 0, $3);
2890 | ALLOCA Types ',' UINT ValueRef OptCAlign {
2891 Value* tmpVal = getVal($4.type->get(), $5);
2893 $$ = new AllocaInst($2.type->get(), tmpVal, $6);
2896 | FREE ResolvedVal {
2897 if (!isa<PointerType>($2.val->getType()))
2898 GEN_ERROR("Trying to free nonpointer type " +
2899 $2.val->getType()->getDescription() + "!");
2900 $$ = new FreeInst($2.val);
2904 | OptVolatile LOAD Types ValueRef {
2905 if (!isa<PointerType>($3.type->get()))
2906 GEN_ERROR("Can't load from nonpointer type: " +
2907 $3.type->get()->getDescription());
2908 if (!cast<PointerType>($3.type->get())->getElementType()->isFirstClassType())
2909 GEN_ERROR("Can't load from pointer of non-first-class type: " +
2910 $3.type->get()->getDescription());
2911 Value* tmpVal = getVal($3.type->get(), $4);
2913 $$ = new LoadInst(tmpVal, "", $1);
2916 | OptVolatile STORE ResolvedVal ',' Types ValueRef {
2917 const PointerType *PT = dyn_cast<PointerType>($5.type->get());
2919 GEN_ERROR("Can't store to a nonpointer type: " +
2920 ($5.type->get())->getDescription());
2921 const Type *ElTy = PT->getElementType();
2922 if (ElTy != $3.val->getType())
2923 GEN_ERROR("Can't store '" + $3.val->getType()->getDescription() +
2924 "' into space of type '" + ElTy->getDescription() + "'!");
2926 Value* tmpVal = getVal($5.type->get(), $6);
2928 $$ = new StoreInst($3.val, tmpVal, $1);
2931 | GETELEMENTPTR Types ValueRef IndexList {
2932 if (!isa<PointerType>($2.type->get()))
2933 GEN_ERROR("getelementptr insn requires pointer operand!");
2935 std::vector<Value*> indices;
2936 for (unsigned i = 0, e = $4->size(); i != e; ++i)
2937 indices.push_back((*$4)[i].val);
2939 if (!GetElementPtrInst::getIndexedType($2.type->get(), indices, true))
2940 GEN_ERROR("Invalid getelementptr indices for type '" +
2941 $2.type->get()->getDescription()+ "'!");
2942 Value* tmpVal = getVal($2.type->get(), $3);
2944 $$ = new GetElementPtrInst(tmpVal, indices);
2952 void llvm::GenerateError(const std::string &message, int LineNo) {
2953 if (LineNo == -1) LineNo = llvmAsmlineno;
2954 // TODO: column number in exception
2956 TheParseError->setError(CurFilename, message, LineNo);
2960 int yyerror(const char *ErrorMsg) {
2962 = std::string((CurFilename == "-") ? std::string("<stdin>") : CurFilename)
2963 + ":" + utostr((unsigned) llvmAsmlineno) + ": ";
2964 std::string errMsg = std::string(ErrorMsg) + "\n" + where + " while reading ";
2965 if (yychar == YYEMPTY || yychar == 0)
2966 errMsg += "end-of-file.";
2968 errMsg += "token: '" + std::string(llvmAsmtext, llvmAsmleng) + "'";
2969 GenerateError(errMsg);