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 "UpgradeInternals.h"
16 #include "llvm/CallingConv.h"
17 #include "llvm/InlineAsm.h"
18 #include "llvm/Instructions.h"
19 #include "llvm/Module.h"
20 #include "llvm/ParameterAttributes.h"
21 #include "llvm/ValueSymbolTable.h"
22 #include "llvm/Support/GetElementPtrTypeIterator.h"
23 #include "llvm/ADT/STLExtras.h"
24 #include "llvm/Support/MathExtras.h"
31 // DEBUG_UPREFS - Define this symbol if you want to enable debugging output
32 // relating to upreferences in the input stream.
34 //#define DEBUG_UPREFS 1
36 #define UR_OUT(X) std::cerr << X
41 #define YYERROR_VERBOSE 1
42 #define YYINCLUDED_STDLIB_H
48 int yyerror(const char*);
49 static void warning(const std::string& WarningMsg);
53 std::istream* LexInput;
54 static std::string CurFilename;
56 // This bool controls whether attributes are ever added to function declarations
57 // definitions and calls.
58 static bool AddAttributes = false;
60 static Module *ParserResult;
61 static bool ObsoleteVarArgs;
62 static bool NewVarArgs;
63 static BasicBlock *CurBB;
64 static GlobalVariable *CurGV;
65 static unsigned lastCallingConv;
67 // This contains info used when building the body of a function. It is
68 // destroyed when the function is completed.
70 typedef std::vector<Value *> ValueList; // Numbered defs
72 typedef std::pair<std::string,TypeInfo> RenameMapKey;
73 typedef std::map<RenameMapKey,std::string> RenameMapType;
76 ResolveDefinitions(std::map<const Type *,ValueList> &LateResolvers,
77 std::map<const Type *,ValueList> *FutureLateResolvers = 0);
79 static struct PerModuleInfo {
80 Module *CurrentModule;
81 std::map<const Type *, ValueList> Values; // Module level numbered definitions
82 std::map<const Type *,ValueList> LateResolveValues;
83 std::vector<PATypeHolder> Types;
84 std::vector<Signedness> TypeSigns;
85 std::map<std::string,Signedness> NamedTypeSigns;
86 std::map<std::string,Signedness> NamedValueSigns;
87 std::map<ValID, PATypeHolder> LateResolveTypes;
88 static Module::Endianness Endian;
89 static Module::PointerSize PointerSize;
90 RenameMapType RenameMap;
92 /// PlaceHolderInfo - When temporary placeholder objects are created, remember
93 /// how they were referenced and on which line of the input they came from so
94 /// that we can resolve them later and print error messages as appropriate.
95 std::map<Value*, std::pair<ValID, int> > PlaceHolderInfo;
97 // GlobalRefs - This maintains a mapping between <Type, ValID>'s and forward
98 // references to global values. Global values may be referenced before they
99 // are defined, and if so, the temporary object that they represent is held
100 // here. This is used for forward references of GlobalValues.
102 typedef std::map<std::pair<const PointerType *, ValID>, GlobalValue*>
104 GlobalRefsType GlobalRefs;
107 // If we could not resolve some functions at function compilation time
108 // (calls to functions before they are defined), resolve them now... Types
109 // are resolved when the constant pool has been completely parsed.
111 ResolveDefinitions(LateResolveValues);
113 // Check to make sure that all global value forward references have been
116 if (!GlobalRefs.empty()) {
117 std::string UndefinedReferences = "Unresolved global references exist:\n";
119 for (GlobalRefsType::iterator I = GlobalRefs.begin(), E =GlobalRefs.end();
121 UndefinedReferences += " " + I->first.first->getDescription() + " " +
122 I->first.second.getName() + "\n";
124 error(UndefinedReferences);
128 if (CurrentModule->getDataLayout().empty()) {
129 std::string dataLayout;
130 if (Endian != Module::AnyEndianness)
131 dataLayout.append(Endian == Module::BigEndian ? "E" : "e");
132 if (PointerSize != Module::AnyPointerSize) {
133 if (!dataLayout.empty())
135 dataLayout.append(PointerSize == Module::Pointer64 ?
136 "p:64:64" : "p:32:32");
138 CurrentModule->setDataLayout(dataLayout);
141 Values.clear(); // Clear out function local definitions
144 NamedTypeSigns.clear();
145 NamedValueSigns.clear();
149 // GetForwardRefForGlobal - Check to see if there is a forward reference
150 // for this global. If so, remove it from the GlobalRefs map and return it.
151 // If not, just return null.
152 GlobalValue *GetForwardRefForGlobal(const PointerType *PTy, ValID ID) {
153 // Check to see if there is a forward reference to this global variable...
154 // if there is, eliminate it and patch the reference to use the new def'n.
155 GlobalRefsType::iterator I = GlobalRefs.find(std::make_pair(PTy, ID));
156 GlobalValue *Ret = 0;
157 if (I != GlobalRefs.end()) {
163 void setEndianness(Module::Endianness E) { Endian = E; }
164 void setPointerSize(Module::PointerSize sz) { PointerSize = sz; }
167 Module::Endianness PerModuleInfo::Endian = Module::AnyEndianness;
168 Module::PointerSize PerModuleInfo::PointerSize = Module::AnyPointerSize;
170 static struct PerFunctionInfo {
171 Function *CurrentFunction; // Pointer to current function being created
173 std::map<const Type*, ValueList> Values; // Keep track of #'d definitions
174 std::map<const Type*, ValueList> LateResolveValues;
175 bool isDeclare; // Is this function a forward declararation?
176 GlobalValue::LinkageTypes Linkage;// Linkage for forward declaration.
178 /// BBForwardRefs - When we see forward references to basic blocks, keep
179 /// track of them here.
180 std::map<BasicBlock*, std::pair<ValID, int> > BBForwardRefs;
181 std::vector<BasicBlock*> NumberedBlocks;
182 RenameMapType RenameMap;
185 inline PerFunctionInfo() {
188 Linkage = GlobalValue::ExternalLinkage;
191 inline void FunctionStart(Function *M) {
196 void FunctionDone() {
197 NumberedBlocks.clear();
199 // Any forward referenced blocks left?
200 if (!BBForwardRefs.empty()) {
201 error("Undefined reference to label " +
202 BBForwardRefs.begin()->first->getName());
206 // Resolve all forward references now.
207 ResolveDefinitions(LateResolveValues, &CurModule.LateResolveValues);
209 Values.clear(); // Clear out function local definitions
213 Linkage = GlobalValue::ExternalLinkage;
215 } CurFun; // Info for the current function...
217 static bool inFunctionScope() { return CurFun.CurrentFunction != 0; }
219 /// This function is just a utility to make a Key value for the rename map.
220 /// The Key is a combination of the name, type, Signedness of the original
221 /// value (global/function). This just constructs the key and ensures that
222 /// named Signedness values are resolved to the actual Signedness.
223 /// @brief Make a key for the RenameMaps
224 static RenameMapKey makeRenameMapKey(const std::string &Name, const Type* Ty,
225 const Signedness &Sign) {
229 // Don't allow Named Signedness nodes because they won't match. The actual
230 // Signedness must be looked up in the NamedTypeSigns map.
231 TI.S.copy(CurModule.NamedTypeSigns[Sign.getName()]);
234 return std::make_pair(Name, TI);
238 //===----------------------------------------------------------------------===//
239 // Code to handle definitions of all the types
240 //===----------------------------------------------------------------------===//
242 static int InsertValue(Value *V,
243 std::map<const Type*,ValueList> &ValueTab = CurFun.Values) {
244 if (V->hasName()) return -1; // Is this a numbered definition?
246 // Yes, insert the value into the value table...
247 ValueList &List = ValueTab[V->getType()];
249 return List.size()-1;
252 static const Type *getType(const ValID &D, bool DoNotImprovise = false) {
254 case ValID::NumberVal: // Is it a numbered definition?
255 // Module constants occupy the lowest numbered slots...
256 if ((unsigned)D.Num < CurModule.Types.size()) {
257 return CurModule.Types[(unsigned)D.Num];
260 case ValID::NameVal: // Is it a named definition?
261 if (const Type *N = CurModule.CurrentModule->getTypeByName(D.Name)) {
266 error("Internal parser error: Invalid symbol type reference");
270 // If we reached here, we referenced either a symbol that we don't know about
271 // or an id number that hasn't been read yet. We may be referencing something
272 // forward, so just create an entry to be resolved later and get to it...
274 if (DoNotImprovise) return 0; // Do we just want a null to be returned?
276 if (inFunctionScope()) {
277 if (D.Type == ValID::NameVal) {
278 error("Reference to an undefined type: '" + D.getName() + "'");
281 error("Reference to an undefined type: #" + itostr(D.Num));
286 std::map<ValID, PATypeHolder>::iterator I =CurModule.LateResolveTypes.find(D);
287 if (I != CurModule.LateResolveTypes.end())
290 Type *Typ = OpaqueType::get();
291 CurModule.LateResolveTypes.insert(std::make_pair(D, Typ));
295 /// This is like the getType method except that instead of looking up the type
296 /// for a given ID, it looks up that type's sign.
297 /// @brief Get the signedness of a referenced type
298 static Signedness getTypeSign(const ValID &D) {
300 case ValID::NumberVal: // Is it a numbered definition?
301 // Module constants occupy the lowest numbered slots...
302 if ((unsigned)D.Num < CurModule.TypeSigns.size()) {
303 return CurModule.TypeSigns[(unsigned)D.Num];
306 case ValID::NameVal: { // Is it a named definition?
307 std::map<std::string,Signedness>::const_iterator I =
308 CurModule.NamedTypeSigns.find(D.Name);
309 if (I != CurModule.NamedTypeSigns.end())
311 // Perhaps its a named forward .. just cache the name
319 // If we don't find it, its signless
325 /// This function is analagous to getElementType in LLVM. It provides the same
326 /// function except that it looks up the Signedness instead of the type. This is
327 /// used when processing GEP instructions that need to extract the type of an
328 /// indexed struct/array/ptr member.
329 /// @brief Look up an element's sign.
330 static Signedness getElementSign(const ValueInfo& VI,
331 const std::vector<Value*> &Indices) {
332 const Type *Ptr = VI.V->getType();
333 assert(isa<PointerType>(Ptr) && "Need pointer type");
337 while (const CompositeType *CT = dyn_cast<CompositeType>(Ptr)) {
338 if (CurIdx == Indices.size())
341 Value *Index = Indices[CurIdx++];
342 assert(!isa<PointerType>(CT) || CurIdx == 1 && "Invalid type");
343 Ptr = CT->getTypeAtIndex(Index);
344 if (const Type* Ty = Ptr->getForwardedType())
346 assert(S.isComposite() && "Bad Signedness type");
347 if (isa<StructType>(CT)) {
348 S = S.get(cast<ConstantInt>(Index)->getZExtValue());
353 S = CurModule.NamedTypeSigns[S.getName()];
356 Result.makeComposite(S);
360 /// This function just translates a ConstantInfo into a ValueInfo and calls
361 /// getElementSign(ValueInfo,...). Its just a convenience.
362 /// @brief ConstantInfo version of getElementSign.
363 static Signedness getElementSign(const ConstInfo& CI,
364 const std::vector<Constant*> &Indices) {
368 std::vector<Value*> Idx;
369 for (unsigned i = 0; i < Indices.size(); ++i)
370 Idx.push_back(Indices[i]);
371 Signedness result = getElementSign(VI, Idx);
376 /// This function determines if two function types differ only in their use of
377 /// the sret parameter attribute in the first argument. If they are identical
378 /// in all other respects, it returns true. Otherwise, it returns false.
379 static bool FuncTysDifferOnlyBySRet(const FunctionType *F1,
380 const FunctionType *F2) {
381 if (F1->getReturnType() != F2->getReturnType() ||
382 F1->getNumParams() != F2->getNumParams())
384 const ParamAttrsList *PAL1 = F1->getParamAttrs();
385 const ParamAttrsList *PAL2 = F2->getParamAttrs();
386 if (PAL1 && !PAL2 || PAL2 && !PAL1)
388 if (PAL1 && PAL2 && ((PAL1->size() != PAL2->size()) ||
389 (PAL1->getParamAttrs(0) != PAL2->getParamAttrs(0))))
391 unsigned SRetMask = ~unsigned(ParamAttr::StructRet);
392 for (unsigned i = 0; i < F1->getNumParams(); ++i) {
393 if (F1->getParamType(i) != F2->getParamType(i) || (PAL1 && PAL2 &&
394 (unsigned(PAL1->getParamAttrs(i+1)) & SRetMask !=
395 unsigned(PAL2->getParamAttrs(i+1)) & SRetMask)))
401 /// This function determines if the type of V and Ty differ only by the SRet
402 /// parameter attribute. This is a more generalized case of
403 /// FuncTysDIfferOnlyBySRet since it doesn't require FunctionType arguments.
404 static bool TypesDifferOnlyBySRet(Value *V, const Type* Ty) {
405 if (V->getType() == Ty)
407 const PointerType *PF1 = dyn_cast<PointerType>(Ty);
408 const PointerType *PF2 = dyn_cast<PointerType>(V->getType());
410 const FunctionType* FT1 = dyn_cast<FunctionType>(PF1->getElementType());
411 const FunctionType* FT2 = dyn_cast<FunctionType>(PF2->getElementType());
413 return FuncTysDifferOnlyBySRet(FT1, FT2);
418 // The upgrade of csretcc to sret param attribute may have caused a function
419 // to not be found because the param attribute changed the type of the called
420 // function. This helper function, used in getExistingValue, detects that
421 // situation and bitcasts the function to the correct type.
422 static Value* handleSRetFuncTypeMerge(Value *V, const Type* Ty) {
423 // Handle degenerate cases
426 if (V->getType() == Ty)
429 const PointerType *PF1 = dyn_cast<PointerType>(Ty);
430 const PointerType *PF2 = dyn_cast<PointerType>(V->getType());
432 const FunctionType *FT1 = dyn_cast<FunctionType>(PF1->getElementType());
433 const FunctionType *FT2 = dyn_cast<FunctionType>(PF2->getElementType());
434 if (FT1 && FT2 && FuncTysDifferOnlyBySRet(FT1, FT2)) {
435 const ParamAttrsList *PAL2 = FT2->getParamAttrs();
436 if (PAL2 && PAL2->paramHasAttr(1, ParamAttr::StructRet))
438 else if (Constant *C = dyn_cast<Constant>(V))
439 return ConstantExpr::getBitCast(C, PF1);
441 return new BitCastInst(V, PF1, "upgrd.cast", CurBB);
448 // getExistingValue - Look up the value specified by the provided type and
449 // the provided ValID. If the value exists and has already been defined, return
450 // it. Otherwise return null.
452 static Value *getExistingValue(const Type *Ty, const ValID &D) {
453 if (isa<FunctionType>(Ty)) {
454 error("Functions are not values and must be referenced as pointers");
458 case ValID::NumberVal: { // Is it a numbered definition?
459 unsigned Num = (unsigned)D.Num;
461 // Module constants occupy the lowest numbered slots...
462 std::map<const Type*,ValueList>::iterator VI = CurModule.Values.find(Ty);
463 if (VI != CurModule.Values.end()) {
464 if (Num < VI->second.size())
465 return VI->second[Num];
466 Num -= VI->second.size();
469 // Make sure that our type is within bounds
470 VI = CurFun.Values.find(Ty);
471 if (VI == CurFun.Values.end()) return 0;
473 // Check that the number is within bounds...
474 if (VI->second.size() <= Num) return 0;
476 return VI->second[Num];
479 case ValID::NameVal: { // Is it a named definition?
480 // Get the name out of the ID
481 RenameMapKey Key = makeRenameMapKey(D.Name, Ty, D.S);
483 if (inFunctionScope()) {
484 // See if the name was renamed
485 RenameMapType::const_iterator I = CurFun.RenameMap.find(Key);
486 std::string LookupName;
487 if (I != CurFun.RenameMap.end())
488 LookupName = I->second;
491 ValueSymbolTable &SymTab = CurFun.CurrentFunction->getValueSymbolTable();
492 V = SymTab.lookup(LookupName);
493 if (V && V->getType() != Ty)
494 V = handleSRetFuncTypeMerge(V, Ty);
495 assert((!V || TypesDifferOnlyBySRet(V, Ty)) && "Found wrong type");
498 RenameMapType::const_iterator I = CurModule.RenameMap.find(Key);
499 std::string LookupName;
500 if (I != CurModule.RenameMap.end())
501 LookupName = I->second;
504 V = CurModule.CurrentModule->getValueSymbolTable().lookup(LookupName);
505 if (V && V->getType() != Ty)
506 V = handleSRetFuncTypeMerge(V, Ty);
507 assert((!V || TypesDifferOnlyBySRet(V, Ty)) && "Found wrong type");
512 D.destroy(); // Free old strdup'd memory...
516 // Check to make sure that "Ty" is an integral type, and that our
517 // value will fit into the specified type...
518 case ValID::ConstSIntVal: // Is it a constant pool reference??
519 if (!ConstantInt::isValueValidForType(Ty, D.ConstPool64)) {
520 error("Signed integral constant '" + itostr(D.ConstPool64) +
521 "' is invalid for type '" + Ty->getDescription() + "'");
523 return ConstantInt::get(Ty, D.ConstPool64);
525 case ValID::ConstUIntVal: // Is it an unsigned const pool reference?
526 if (!ConstantInt::isValueValidForType(Ty, D.UConstPool64)) {
527 if (!ConstantInt::isValueValidForType(Ty, D.ConstPool64))
528 error("Integral constant '" + utostr(D.UConstPool64) +
529 "' is invalid or out of range");
530 else // This is really a signed reference. Transmogrify.
531 return ConstantInt::get(Ty, D.ConstPool64);
533 return ConstantInt::get(Ty, D.UConstPool64);
535 case ValID::ConstFPVal: // Is it a floating point const pool reference?
536 if (!ConstantFP::isValueValidForType(Ty, D.ConstPoolFP))
537 error("FP constant invalid for type");
538 return ConstantFP::get(Ty, D.ConstPoolFP);
540 case ValID::ConstNullVal: // Is it a null value?
541 if (!isa<PointerType>(Ty))
542 error("Cannot create a a non pointer null");
543 return ConstantPointerNull::get(cast<PointerType>(Ty));
545 case ValID::ConstUndefVal: // Is it an undef value?
546 return UndefValue::get(Ty);
548 case ValID::ConstZeroVal: // Is it a zero value?
549 return Constant::getNullValue(Ty);
551 case ValID::ConstantVal: // Fully resolved constant?
552 if (D.ConstantValue->getType() != Ty)
553 error("Constant expression type different from required type");
554 return D.ConstantValue;
556 case ValID::InlineAsmVal: { // Inline asm expression
557 const PointerType *PTy = dyn_cast<PointerType>(Ty);
558 const FunctionType *FTy =
559 PTy ? dyn_cast<FunctionType>(PTy->getElementType()) : 0;
560 if (!FTy || !InlineAsm::Verify(FTy, D.IAD->Constraints))
561 error("Invalid type for asm constraint string");
562 InlineAsm *IA = InlineAsm::get(FTy, D.IAD->AsmString, D.IAD->Constraints,
563 D.IAD->HasSideEffects);
564 D.destroy(); // Free InlineAsmDescriptor.
568 assert(0 && "Unhandled case");
572 assert(0 && "Unhandled case");
576 // getVal - This function is identical to getExistingValue, except that if a
577 // value is not already defined, it "improvises" by creating a placeholder var
578 // that looks and acts just like the requested variable. When the value is
579 // defined later, all uses of the placeholder variable are replaced with the
582 static Value *getVal(const Type *Ty, const ValID &ID) {
583 if (Ty == Type::LabelTy)
584 error("Cannot use a basic block here");
586 // See if the value has already been defined.
587 Value *V = getExistingValue(Ty, ID);
590 if (!Ty->isFirstClassType() && !isa<OpaqueType>(Ty))
591 error("Invalid use of a composite type");
593 // If we reached here, we referenced either a symbol that we don't know about
594 // or an id number that hasn't been read yet. We may be referencing something
595 // forward, so just create an entry to be resolved later and get to it...
596 V = new Argument(Ty);
598 // Remember where this forward reference came from. FIXME, shouldn't we try
599 // to recycle these things??
600 CurModule.PlaceHolderInfo.insert(
601 std::make_pair(V, std::make_pair(ID, Upgradelineno)));
603 if (inFunctionScope())
604 InsertValue(V, CurFun.LateResolveValues);
606 InsertValue(V, CurModule.LateResolveValues);
610 /// @brief This just makes any name given to it unique, up to MAX_UINT times.
611 static std::string makeNameUnique(const std::string& Name) {
612 static unsigned UniqueNameCounter = 1;
613 std::string Result(Name);
614 Result += ".upgrd." + llvm::utostr(UniqueNameCounter++);
618 /// getBBVal - This is used for two purposes:
619 /// * If isDefinition is true, a new basic block with the specified ID is being
621 /// * If isDefinition is true, this is a reference to a basic block, which may
622 /// or may not be a forward reference.
624 static BasicBlock *getBBVal(const ValID &ID, bool isDefinition = false) {
625 assert(inFunctionScope() && "Can't get basic block at global scope");
631 error("Illegal label reference " + ID.getName());
633 case ValID::NumberVal: // Is it a numbered definition?
634 if (unsigned(ID.Num) >= CurFun.NumberedBlocks.size())
635 CurFun.NumberedBlocks.resize(ID.Num+1);
636 BB = CurFun.NumberedBlocks[ID.Num];
638 case ValID::NameVal: // Is it a named definition?
640 if (Value *N = CurFun.CurrentFunction->getValueSymbolTable().lookup(Name)) {
641 if (N->getType() != Type::LabelTy) {
642 // Register names didn't use to conflict with basic block names
643 // because of type planes. Now they all have to be unique. So, we just
644 // rename the register and treat this name as if no basic block
646 RenameMapKey Key = makeRenameMapKey(ID.Name, N->getType(), ID.S);
647 N->setName(makeNameUnique(N->getName()));
648 CurModule.RenameMap[Key] = N->getName();
651 BB = cast<BasicBlock>(N);
657 // See if the block has already been defined.
659 // If this is the definition of the block, make sure the existing value was
660 // just a forward reference. If it was a forward reference, there will be
661 // an entry for it in the PlaceHolderInfo map.
662 if (isDefinition && !CurFun.BBForwardRefs.erase(BB))
663 // The existing value was a definition, not a forward reference.
664 error("Redefinition of label " + ID.getName());
666 ID.destroy(); // Free strdup'd memory.
670 // Otherwise this block has not been seen before.
671 BB = new BasicBlock("", CurFun.CurrentFunction);
672 if (ID.Type == ValID::NameVal) {
673 BB->setName(ID.Name);
675 CurFun.NumberedBlocks[ID.Num] = BB;
678 // If this is not a definition, keep track of it so we can use it as a forward
681 // Remember where this forward reference came from.
682 CurFun.BBForwardRefs[BB] = std::make_pair(ID, Upgradelineno);
684 // The forward declaration could have been inserted anywhere in the
685 // function: insert it into the correct place now.
686 CurFun.CurrentFunction->getBasicBlockList().remove(BB);
687 CurFun.CurrentFunction->getBasicBlockList().push_back(BB);
694 //===----------------------------------------------------------------------===//
695 // Code to handle forward references in instructions
696 //===----------------------------------------------------------------------===//
698 // This code handles the late binding needed with statements that reference
699 // values not defined yet... for example, a forward branch, or the PHI node for
702 // This keeps a table (CurFun.LateResolveValues) of all such forward references
703 // and back patchs after we are done.
706 // ResolveDefinitions - If we could not resolve some defs at parsing
707 // time (forward branches, phi functions for loops, etc...) resolve the
711 ResolveDefinitions(std::map<const Type*,ValueList> &LateResolvers,
712 std::map<const Type*,ValueList> *FutureLateResolvers) {
714 // Loop over LateResolveDefs fixing up stuff that couldn't be resolved
715 for (std::map<const Type*,ValueList>::iterator LRI = LateResolvers.begin(),
716 E = LateResolvers.end(); LRI != E; ++LRI) {
717 const Type* Ty = LRI->first;
718 ValueList &List = LRI->second;
719 while (!List.empty()) {
720 Value *V = List.back();
723 std::map<Value*, std::pair<ValID, int> >::iterator PHI =
724 CurModule.PlaceHolderInfo.find(V);
725 assert(PHI != CurModule.PlaceHolderInfo.end() && "Placeholder error");
727 ValID &DID = PHI->second.first;
729 Value *TheRealValue = getExistingValue(Ty, DID);
731 V->replaceAllUsesWith(TheRealValue);
733 CurModule.PlaceHolderInfo.erase(PHI);
734 } else if (FutureLateResolvers) {
735 // Functions have their unresolved items forwarded to the module late
737 InsertValue(V, *FutureLateResolvers);
739 if (DID.Type == ValID::NameVal) {
740 error("Reference to an invalid definition: '" + DID.getName() +
741 "' of type '" + V->getType()->getDescription() + "'",
745 error("Reference to an invalid definition: #" +
746 itostr(DID.Num) + " of type '" +
747 V->getType()->getDescription() + "'", PHI->second.second);
754 LateResolvers.clear();
757 /// This function is used for type resolution and upref handling. When a type
758 /// becomes concrete, this function is called to adjust the signedness for the
760 static void ResolveTypeSign(const Type* oldTy, const Signedness &Sign) {
761 std::string TyName = CurModule.CurrentModule->getTypeName(oldTy);
763 CurModule.NamedTypeSigns[TyName] = Sign;
766 /// ResolveTypeTo - A brand new type was just declared. This means that (if
767 /// name is not null) things referencing Name can be resolved. Otherwise,
768 /// things refering to the number can be resolved. Do this now.
769 static void ResolveTypeTo(char *Name, const Type *ToTy, const Signedness& Sign){
772 D = ValID::create(Name);
774 D = ValID::create((int)CurModule.Types.size());
778 CurModule.NamedTypeSigns[Name] = Sign;
780 std::map<ValID, PATypeHolder>::iterator I =
781 CurModule.LateResolveTypes.find(D);
782 if (I != CurModule.LateResolveTypes.end()) {
783 const Type *OldTy = I->second.get();
784 ((DerivedType*)OldTy)->refineAbstractTypeTo(ToTy);
785 CurModule.LateResolveTypes.erase(I);
789 /// This is the implementation portion of TypeHasInteger. It traverses the
790 /// type given, avoiding recursive types, and returns true as soon as it finds
791 /// an integer type. If no integer type is found, it returns false.
792 static bool TypeHasIntegerI(const Type *Ty, std::vector<const Type*> Stack) {
793 // Handle some easy cases
794 if (Ty->isPrimitiveType() || (Ty->getTypeID() == Type::OpaqueTyID))
798 if (const SequentialType *STy = dyn_cast<SequentialType>(Ty))
799 return STy->getElementType()->isInteger();
801 // Avoid type structure recursion
802 for (std::vector<const Type*>::iterator I = Stack.begin(), E = Stack.end();
807 // Push us on the type stack
810 if (const FunctionType *FTy = dyn_cast<FunctionType>(Ty)) {
811 if (TypeHasIntegerI(FTy->getReturnType(), Stack))
813 FunctionType::param_iterator I = FTy->param_begin();
814 FunctionType::param_iterator E = FTy->param_end();
816 if (TypeHasIntegerI(*I, Stack))
819 } else if (const StructType *STy = dyn_cast<StructType>(Ty)) {
820 StructType::element_iterator I = STy->element_begin();
821 StructType::element_iterator E = STy->element_end();
822 for (; I != E; ++I) {
823 if (TypeHasIntegerI(*I, Stack))
828 // There shouldn't be anything else, but its definitely not integer
829 assert(0 && "What type is this?");
833 /// This is the interface to TypeHasIntegerI. It just provides the type stack,
834 /// to avoid recursion, and then calls TypeHasIntegerI.
835 static inline bool TypeHasInteger(const Type *Ty) {
836 std::vector<const Type*> TyStack;
837 return TypeHasIntegerI(Ty, TyStack);
840 // setValueName - Set the specified value to the name given. The name may be
841 // null potentially, in which case this is a noop. The string passed in is
842 // assumed to be a malloc'd string buffer, and is free'd by this function.
844 static void setValueName(const ValueInfo &V, char *NameStr) {
846 std::string Name(NameStr); // Copy string
847 free(NameStr); // Free old string
849 if (V.V->getType() == Type::VoidTy) {
850 error("Can't assign name '" + Name + "' to value with void type");
854 assert(inFunctionScope() && "Must be in function scope");
856 // Search the function's symbol table for an existing value of this name
857 ValueSymbolTable &ST = CurFun.CurrentFunction->getValueSymbolTable();
858 Value* Existing = ST.lookup(Name);
860 // An existing value of the same name was found. This might have happened
861 // because of the integer type planes collapsing in LLVM 2.0.
862 if (Existing->getType() == V.V->getType() &&
863 !TypeHasInteger(Existing->getType())) {
864 // If the type does not contain any integers in them then this can't be
865 // a type plane collapsing issue. It truly is a redefinition and we
866 // should error out as the assembly is invalid.
867 error("Redefinition of value named '" + Name + "' of type '" +
868 V.V->getType()->getDescription() + "'");
871 // In LLVM 2.0 we don't allow names to be re-used for any values in a
872 // function, regardless of Type. Previously re-use of names was okay as
873 // long as they were distinct types. With type planes collapsing because
874 // of the signedness change and because of PR411, this can no longer be
875 // supported. We must search the entire symbol table for a conflicting
876 // name and make the name unique. No warning is needed as this can't
878 std::string NewName = makeNameUnique(Name);
879 // We're changing the name but it will probably be used by other
880 // instructions as operands later on. Consequently we have to retain
881 // a mapping of the renaming that we're doing.
882 RenameMapKey Key = makeRenameMapKey(Name, V.V->getType(), V.S);
883 CurFun.RenameMap[Key] = NewName;
892 /// ParseGlobalVariable - Handle parsing of a global. If Initializer is null,
893 /// this is a declaration, otherwise it is a definition.
894 static GlobalVariable *
895 ParseGlobalVariable(char *NameStr,GlobalValue::LinkageTypes Linkage,
896 bool isConstantGlobal, const Type *Ty,
897 Constant *Initializer,
898 const Signedness &Sign) {
899 if (isa<FunctionType>(Ty))
900 error("Cannot declare global vars of function type");
902 const PointerType *PTy = PointerType::get(Ty);
906 Name = NameStr; // Copy string
907 free(NameStr); // Free old string
910 // See if this global value was forward referenced. If so, recycle the
914 ID = ValID::create((char*)Name.c_str());
916 ID = ValID::create((int)CurModule.Values[PTy].size());
918 ID.S.makeComposite(Sign);
920 if (GlobalValue *FWGV = CurModule.GetForwardRefForGlobal(PTy, ID)) {
921 // Move the global to the end of the list, from whereever it was
922 // previously inserted.
923 GlobalVariable *GV = cast<GlobalVariable>(FWGV);
924 CurModule.CurrentModule->getGlobalList().remove(GV);
925 CurModule.CurrentModule->getGlobalList().push_back(GV);
926 GV->setInitializer(Initializer);
927 GV->setLinkage(Linkage);
928 GV->setConstant(isConstantGlobal);
929 InsertValue(GV, CurModule.Values);
933 // If this global has a name, check to see if there is already a definition
934 // of this global in the module and emit warnings if there are conflicts.
936 // The global has a name. See if there's an existing one of the same name.
937 if (CurModule.CurrentModule->getNamedGlobal(Name) ||
938 CurModule.CurrentModule->getFunction(Name)) {
939 // We found an existing global of the same name. This isn't allowed
940 // in LLVM 2.0. Consequently, we must alter the name of the global so it
941 // can at least compile. This can happen because of type planes
942 // There is alread a global of the same name which means there is a
943 // conflict. Let's see what we can do about it.
944 std::string NewName(makeNameUnique(Name));
945 if (Linkage != GlobalValue::InternalLinkage) {
946 // The linkage of this gval is external so we can't reliably rename
947 // it because it could potentially create a linking problem.
948 // However, we can't leave the name conflict in the output either or
949 // it won't assemble with LLVM 2.0. So, all we can do is rename
950 // this one to something unique and emit a warning about the problem.
951 warning("Renaming global variable '" + Name + "' to '" + NewName +
952 "' may cause linkage errors");
955 // Put the renaming in the global rename map
956 RenameMapKey Key = makeRenameMapKey(Name, PointerType::get(Ty), ID.S);
957 CurModule.RenameMap[Key] = NewName;
964 // Otherwise there is no existing GV to use, create one now.
966 new GlobalVariable(Ty, isConstantGlobal, Linkage, Initializer, Name,
967 CurModule.CurrentModule);
968 InsertValue(GV, CurModule.Values);
969 // Remember the sign of this global.
970 CurModule.NamedValueSigns[Name] = ID.S;
974 // setTypeName - Set the specified type to the name given. The name may be
975 // null potentially, in which case this is a noop. The string passed in is
976 // assumed to be a malloc'd string buffer, and is freed by this function.
978 // This function returns true if the type has already been defined, but is
979 // allowed to be redefined in the specified context. If the name is a new name
980 // for the type plane, it is inserted and false is returned.
981 static bool setTypeName(const PATypeInfo& TI, char *NameStr) {
982 assert(!inFunctionScope() && "Can't give types function-local names");
983 if (NameStr == 0) return false;
985 std::string Name(NameStr); // Copy string
986 free(NameStr); // Free old string
988 const Type* Ty = TI.PAT->get();
990 // We don't allow assigning names to void type
991 if (Ty == Type::VoidTy) {
992 error("Can't assign name '" + Name + "' to the void type");
996 // Set the type name, checking for conflicts as we do so.
997 bool AlreadyExists = CurModule.CurrentModule->addTypeName(Name, Ty);
999 // Save the sign information for later use
1000 CurModule.NamedTypeSigns[Name] = TI.S;
1002 if (AlreadyExists) { // Inserting a name that is already defined???
1003 const Type *Existing = CurModule.CurrentModule->getTypeByName(Name);
1004 assert(Existing && "Conflict but no matching type?");
1006 // There is only one case where this is allowed: when we are refining an
1007 // opaque type. In this case, Existing will be an opaque type.
1008 if (const OpaqueType *OpTy = dyn_cast<OpaqueType>(Existing)) {
1009 // We ARE replacing an opaque type!
1010 const_cast<OpaqueType*>(OpTy)->refineAbstractTypeTo(Ty);
1014 // Otherwise, this is an attempt to redefine a type. That's okay if
1015 // the redefinition is identical to the original. This will be so if
1016 // Existing and T point to the same Type object. In this one case we
1017 // allow the equivalent redefinition.
1018 if (Existing == Ty) return true; // Yes, it's equal.
1020 // Any other kind of (non-equivalent) redefinition is an error.
1021 error("Redefinition of type named '" + Name + "' in the '" +
1022 Ty->getDescription() + "' type plane");
1028 //===----------------------------------------------------------------------===//
1029 // Code for handling upreferences in type names...
1032 // TypeContains - Returns true if Ty directly contains E in it.
1034 static bool TypeContains(const Type *Ty, const Type *E) {
1035 return std::find(Ty->subtype_begin(), Ty->subtype_end(),
1036 E) != Ty->subtype_end();
1040 struct UpRefRecord {
1041 // NestingLevel - The number of nesting levels that need to be popped before
1042 // this type is resolved.
1043 unsigned NestingLevel;
1045 // LastContainedTy - This is the type at the current binding level for the
1046 // type. Every time we reduce the nesting level, this gets updated.
1047 const Type *LastContainedTy;
1049 // UpRefTy - This is the actual opaque type that the upreference is
1050 // represented with.
1051 OpaqueType *UpRefTy;
1053 UpRefRecord(unsigned NL, OpaqueType *URTy)
1054 : NestingLevel(NL), LastContainedTy(URTy), UpRefTy(URTy) { }
1058 // UpRefs - A list of the outstanding upreferences that need to be resolved.
1059 static std::vector<UpRefRecord> UpRefs;
1061 /// HandleUpRefs - Every time we finish a new layer of types, this function is
1062 /// called. It loops through the UpRefs vector, which is a list of the
1063 /// currently active types. For each type, if the up reference is contained in
1064 /// the newly completed type, we decrement the level count. When the level
1065 /// count reaches zero, the upreferenced type is the type that is passed in:
1066 /// thus we can complete the cycle.
1068 static PATypeHolder HandleUpRefs(const Type *ty, const Signedness& Sign) {
1069 // If Ty isn't abstract, or if there are no up-references in it, then there is
1070 // nothing to resolve here.
1071 if (!ty->isAbstract() || UpRefs.empty()) return ty;
1073 PATypeHolder Ty(ty);
1074 UR_OUT("Type '" << Ty->getDescription() <<
1075 "' newly formed. Resolving upreferences.\n" <<
1076 UpRefs.size() << " upreferences active!\n");
1078 // If we find any resolvable upreferences (i.e., those whose NestingLevel goes
1079 // to zero), we resolve them all together before we resolve them to Ty. At
1080 // the end of the loop, if there is anything to resolve to Ty, it will be in
1082 OpaqueType *TypeToResolve = 0;
1085 for (; i != UpRefs.size(); ++i) {
1086 UR_OUT(" UR#" << i << " - TypeContains(" << Ty->getDescription() << ", "
1087 << UpRefs[i].UpRefTy->getDescription() << ") = "
1088 << (TypeContains(Ty, UpRefs[i].UpRefTy) ? "true" : "false") << "\n");
1089 if (TypeContains(Ty, UpRefs[i].LastContainedTy)) {
1090 // Decrement level of upreference
1091 unsigned Level = --UpRefs[i].NestingLevel;
1092 UpRefs[i].LastContainedTy = Ty;
1093 UR_OUT(" Uplevel Ref Level = " << Level << "\n");
1094 if (Level == 0) { // Upreference should be resolved!
1095 if (!TypeToResolve) {
1096 TypeToResolve = UpRefs[i].UpRefTy;
1098 UR_OUT(" * Resolving upreference for "
1099 << UpRefs[i].UpRefTy->getDescription() << "\n";
1100 std::string OldName = UpRefs[i].UpRefTy->getDescription());
1101 ResolveTypeSign(UpRefs[i].UpRefTy, Sign);
1102 UpRefs[i].UpRefTy->refineAbstractTypeTo(TypeToResolve);
1103 UR_OUT(" * Type '" << OldName << "' refined upreference to: "
1104 << (const void*)Ty << ", " << Ty->getDescription() << "\n");
1106 UpRefs.erase(UpRefs.begin()+i); // Remove from upreference list...
1107 --i; // Do not skip the next element...
1112 if (TypeToResolve) {
1113 UR_OUT(" * Resolving upreference for "
1114 << UpRefs[i].UpRefTy->getDescription() << "\n";
1115 std::string OldName = TypeToResolve->getDescription());
1116 ResolveTypeSign(TypeToResolve, Sign);
1117 TypeToResolve->refineAbstractTypeTo(Ty);
1123 bool Signedness::operator<(const Signedness &that) const {
1126 return *(this->name) < *(that.name);
1128 return CurModule.NamedTypeSigns[*name] < that;
1129 } else if (that.isNamed()) {
1130 return *this < CurModule.NamedTypeSigns[*that.name];
1133 if (isComposite() && that.isComposite()) {
1134 if (sv->size() == that.sv->size()) {
1135 SignVector::const_iterator thisI = sv->begin(), thisE = sv->end();
1136 SignVector::const_iterator thatI = that.sv->begin(),
1137 thatE = that.sv->end();
1138 for (; thisI != thisE; ++thisI, ++thatI) {
1139 if (*thisI < *thatI)
1141 else if (!(*thisI == *thatI))
1146 return sv->size() < that.sv->size();
1148 return kind < that.kind;
1151 bool Signedness::operator==(const Signedness &that) const {
1154 return *(this->name) == *(that.name);
1156 return CurModule.NamedTypeSigns[*(this->name)] == that;
1157 else if (that.isNamed())
1158 return *this == CurModule.NamedTypeSigns[*(that.name)];
1159 if (isComposite() && that.isComposite()) {
1160 if (sv->size() == that.sv->size()) {
1161 SignVector::const_iterator thisI = sv->begin(), thisE = sv->end();
1162 SignVector::const_iterator thatI = that.sv->begin(),
1163 thatE = that.sv->end();
1164 for (; thisI != thisE; ++thisI, ++thatI) {
1165 if (!(*thisI == *thatI))
1172 return kind == that.kind;
1175 void Signedness::copy(const Signedness &that) {
1176 if (that.isNamed()) {
1178 name = new std::string(*that.name);
1179 } else if (that.isComposite()) {
1181 sv = new SignVector();
1189 void Signedness::destroy() {
1192 } else if (isComposite()) {
1198 void Signedness::dump() const {
1199 if (isComposite()) {
1200 if (sv->size() == 1) {
1205 for (unsigned i = 0; i < sv->size(); ++i) {
1212 } else if (isNamed()) {
1214 } else if (isSigned()) {
1216 } else if (isUnsigned()) {
1223 static inline Instruction::TermOps
1224 getTermOp(TermOps op) {
1226 default : assert(0 && "Invalid OldTermOp");
1227 case RetOp : return Instruction::Ret;
1228 case BrOp : return Instruction::Br;
1229 case SwitchOp : return Instruction::Switch;
1230 case InvokeOp : return Instruction::Invoke;
1231 case UnwindOp : return Instruction::Unwind;
1232 case UnreachableOp: return Instruction::Unreachable;
1236 static inline Instruction::BinaryOps
1237 getBinaryOp(BinaryOps op, const Type *Ty, const Signedness& Sign) {
1239 default : assert(0 && "Invalid OldBinaryOps");
1245 case SetGT : assert(0 && "Should use getCompareOp");
1246 case AddOp : return Instruction::Add;
1247 case SubOp : return Instruction::Sub;
1248 case MulOp : return Instruction::Mul;
1250 // This is an obsolete instruction so we must upgrade it based on the
1251 // types of its operands.
1252 bool isFP = Ty->isFloatingPoint();
1253 if (const VectorType* PTy = dyn_cast<VectorType>(Ty))
1254 // If its a vector type we want to use the element type
1255 isFP = PTy->getElementType()->isFloatingPoint();
1257 return Instruction::FDiv;
1258 else if (Sign.isSigned())
1259 return Instruction::SDiv;
1260 return Instruction::UDiv;
1262 case UDivOp : return Instruction::UDiv;
1263 case SDivOp : return Instruction::SDiv;
1264 case FDivOp : return Instruction::FDiv;
1266 // This is an obsolete instruction so we must upgrade it based on the
1267 // types of its operands.
1268 bool isFP = Ty->isFloatingPoint();
1269 if (const VectorType* PTy = dyn_cast<VectorType>(Ty))
1270 // If its a vector type we want to use the element type
1271 isFP = PTy->getElementType()->isFloatingPoint();
1272 // Select correct opcode
1274 return Instruction::FRem;
1275 else if (Sign.isSigned())
1276 return Instruction::SRem;
1277 return Instruction::URem;
1279 case URemOp : return Instruction::URem;
1280 case SRemOp : return Instruction::SRem;
1281 case FRemOp : return Instruction::FRem;
1282 case LShrOp : return Instruction::LShr;
1283 case AShrOp : return Instruction::AShr;
1284 case ShlOp : return Instruction::Shl;
1286 if (Sign.isSigned())
1287 return Instruction::AShr;
1288 return Instruction::LShr;
1289 case AndOp : return Instruction::And;
1290 case OrOp : return Instruction::Or;
1291 case XorOp : return Instruction::Xor;
1295 static inline Instruction::OtherOps
1296 getCompareOp(BinaryOps op, unsigned short &predicate, const Type* &Ty,
1297 const Signedness &Sign) {
1298 bool isSigned = Sign.isSigned();
1299 bool isFP = Ty->isFloatingPoint();
1301 default : assert(0 && "Invalid OldSetCC");
1304 predicate = FCmpInst::FCMP_OEQ;
1305 return Instruction::FCmp;
1307 predicate = ICmpInst::ICMP_EQ;
1308 return Instruction::ICmp;
1312 predicate = FCmpInst::FCMP_UNE;
1313 return Instruction::FCmp;
1315 predicate = ICmpInst::ICMP_NE;
1316 return Instruction::ICmp;
1320 predicate = FCmpInst::FCMP_OLE;
1321 return Instruction::FCmp;
1324 predicate = ICmpInst::ICMP_SLE;
1326 predicate = ICmpInst::ICMP_ULE;
1327 return Instruction::ICmp;
1331 predicate = FCmpInst::FCMP_OGE;
1332 return Instruction::FCmp;
1335 predicate = ICmpInst::ICMP_SGE;
1337 predicate = ICmpInst::ICMP_UGE;
1338 return Instruction::ICmp;
1342 predicate = FCmpInst::FCMP_OLT;
1343 return Instruction::FCmp;
1346 predicate = ICmpInst::ICMP_SLT;
1348 predicate = ICmpInst::ICMP_ULT;
1349 return Instruction::ICmp;
1353 predicate = FCmpInst::FCMP_OGT;
1354 return Instruction::FCmp;
1357 predicate = ICmpInst::ICMP_SGT;
1359 predicate = ICmpInst::ICMP_UGT;
1360 return Instruction::ICmp;
1365 static inline Instruction::MemoryOps getMemoryOp(MemoryOps op) {
1367 default : assert(0 && "Invalid OldMemoryOps");
1368 case MallocOp : return Instruction::Malloc;
1369 case FreeOp : return Instruction::Free;
1370 case AllocaOp : return Instruction::Alloca;
1371 case LoadOp : return Instruction::Load;
1372 case StoreOp : return Instruction::Store;
1373 case GetElementPtrOp : return Instruction::GetElementPtr;
1377 static inline Instruction::OtherOps
1378 getOtherOp(OtherOps op, const Signedness &Sign) {
1380 default : assert(0 && "Invalid OldOtherOps");
1381 case PHIOp : return Instruction::PHI;
1382 case CallOp : return Instruction::Call;
1383 case SelectOp : return Instruction::Select;
1384 case UserOp1 : return Instruction::UserOp1;
1385 case UserOp2 : return Instruction::UserOp2;
1386 case VAArg : return Instruction::VAArg;
1387 case ExtractElementOp : return Instruction::ExtractElement;
1388 case InsertElementOp : return Instruction::InsertElement;
1389 case ShuffleVectorOp : return Instruction::ShuffleVector;
1390 case ICmpOp : return Instruction::ICmp;
1391 case FCmpOp : return Instruction::FCmp;
1395 static inline Value*
1396 getCast(CastOps op, Value *Src, const Signedness &SrcSign, const Type *DstTy,
1397 const Signedness &DstSign, bool ForceInstruction = false) {
1398 Instruction::CastOps Opcode;
1399 const Type* SrcTy = Src->getType();
1401 if (SrcTy->isFloatingPoint() && isa<PointerType>(DstTy)) {
1402 // fp -> ptr cast is no longer supported but we must upgrade this
1403 // by doing a double cast: fp -> int -> ptr
1404 SrcTy = Type::Int64Ty;
1405 Opcode = Instruction::IntToPtr;
1406 if (isa<Constant>(Src)) {
1407 Src = ConstantExpr::getCast(Instruction::FPToUI,
1408 cast<Constant>(Src), SrcTy);
1410 std::string NewName(makeNameUnique(Src->getName()));
1411 Src = new FPToUIInst(Src, SrcTy, NewName, CurBB);
1413 } else if (isa<IntegerType>(DstTy) &&
1414 cast<IntegerType>(DstTy)->getBitWidth() == 1) {
1415 // cast type %x to bool was previously defined as setne type %x, null
1416 // The cast semantic is now to truncate, not compare so we must retain
1417 // the original intent by replacing the cast with a setne
1418 Constant* Null = Constant::getNullValue(SrcTy);
1419 Instruction::OtherOps Opcode = Instruction::ICmp;
1420 unsigned short predicate = ICmpInst::ICMP_NE;
1421 if (SrcTy->isFloatingPoint()) {
1422 Opcode = Instruction::FCmp;
1423 predicate = FCmpInst::FCMP_ONE;
1424 } else if (!SrcTy->isInteger() && !isa<PointerType>(SrcTy)) {
1425 error("Invalid cast to bool");
1427 if (isa<Constant>(Src) && !ForceInstruction)
1428 return ConstantExpr::getCompare(predicate, cast<Constant>(Src), Null);
1430 return CmpInst::create(Opcode, predicate, Src, Null);
1432 // Determine the opcode to use by calling CastInst::getCastOpcode
1434 CastInst::getCastOpcode(Src, SrcSign.isSigned(), DstTy,
1435 DstSign.isSigned());
1437 } else switch (op) {
1438 default: assert(0 && "Invalid cast token");
1439 case TruncOp: Opcode = Instruction::Trunc; break;
1440 case ZExtOp: Opcode = Instruction::ZExt; break;
1441 case SExtOp: Opcode = Instruction::SExt; break;
1442 case FPTruncOp: Opcode = Instruction::FPTrunc; break;
1443 case FPExtOp: Opcode = Instruction::FPExt; break;
1444 case FPToUIOp: Opcode = Instruction::FPToUI; break;
1445 case FPToSIOp: Opcode = Instruction::FPToSI; break;
1446 case UIToFPOp: Opcode = Instruction::UIToFP; break;
1447 case SIToFPOp: Opcode = Instruction::SIToFP; break;
1448 case PtrToIntOp: Opcode = Instruction::PtrToInt; break;
1449 case IntToPtrOp: Opcode = Instruction::IntToPtr; break;
1450 case BitCastOp: Opcode = Instruction::BitCast; break;
1453 if (isa<Constant>(Src) && !ForceInstruction)
1454 return ConstantExpr::getCast(Opcode, cast<Constant>(Src), DstTy);
1455 return CastInst::create(Opcode, Src, DstTy);
1458 static Instruction *
1459 upgradeIntrinsicCall(const Type* RetTy, const ValID &ID,
1460 std::vector<Value*>& Args) {
1462 std::string Name = ID.Type == ValID::NameVal ? ID.Name : "";
1463 if (Name.length() <= 5 || Name[0] != 'l' || Name[1] != 'l' ||
1464 Name[2] != 'v' || Name[3] != 'm' || Name[4] != '.')
1469 if (Name == "llvm.isunordered.f32" || Name == "llvm.isunordered.f64") {
1470 if (Args.size() != 2)
1471 error("Invalid prototype for " + Name);
1472 return new FCmpInst(FCmpInst::FCMP_UNO, Args[0], Args[1]);
1477 const Type* PtrTy = PointerType::get(Type::Int8Ty);
1478 std::vector<const Type*> Params;
1479 if (Name == "llvm.va_start" || Name == "llvm.va_end") {
1480 if (Args.size() != 1)
1481 error("Invalid prototype for " + Name + " prototype");
1482 Params.push_back(PtrTy);
1483 const FunctionType *FTy =
1484 FunctionType::get(Type::VoidTy, Params, false);
1485 const PointerType *PFTy = PointerType::get(FTy);
1486 Value* Func = getVal(PFTy, ID);
1487 Args[0] = new BitCastInst(Args[0], PtrTy, makeNameUnique("va"), CurBB);
1488 return new CallInst(Func, Args.begin(), Args.end());
1489 } else if (Name == "llvm.va_copy") {
1490 if (Args.size() != 2)
1491 error("Invalid prototype for " + Name + " prototype");
1492 Params.push_back(PtrTy);
1493 Params.push_back(PtrTy);
1494 const FunctionType *FTy =
1495 FunctionType::get(Type::VoidTy, Params, false);
1496 const PointerType *PFTy = PointerType::get(FTy);
1497 Value* Func = getVal(PFTy, ID);
1498 std::string InstName0(makeNameUnique("va0"));
1499 std::string InstName1(makeNameUnique("va1"));
1500 Args[0] = new BitCastInst(Args[0], PtrTy, InstName0, CurBB);
1501 Args[1] = new BitCastInst(Args[1], PtrTy, InstName1, CurBB);
1502 return new CallInst(Func, Args.begin(), Args.end());
1509 const Type* upgradeGEPCEIndices(const Type* PTy,
1510 std::vector<ValueInfo> *Indices,
1511 std::vector<Constant*> &Result) {
1512 const Type *Ty = PTy;
1514 for (unsigned i = 0, e = Indices->size(); i != e ; ++i) {
1515 Constant *Index = cast<Constant>((*Indices)[i].V);
1517 if (ConstantInt *CI = dyn_cast<ConstantInt>(Index)) {
1518 // LLVM 1.2 and earlier used ubyte struct indices. Convert any ubyte
1519 // struct indices to i32 struct indices with ZExt for compatibility.
1520 if (CI->getBitWidth() < 32)
1521 Index = ConstantExpr::getCast(Instruction::ZExt, CI, Type::Int32Ty);
1524 if (isa<SequentialType>(Ty)) {
1525 // Make sure that unsigned SequentialType indices are zext'd to
1526 // 64-bits if they were smaller than that because LLVM 2.0 will sext
1527 // all indices for SequentialType elements. We must retain the same
1528 // semantic (zext) for unsigned types.
1529 if (const IntegerType *Ity = dyn_cast<IntegerType>(Index->getType())) {
1530 if (Ity->getBitWidth() < 64 && (*Indices)[i].S.isUnsigned()) {
1531 Index = ConstantExpr::getCast(Instruction::ZExt, Index,Type::Int64Ty);
1535 Result.push_back(Index);
1536 Ty = GetElementPtrInst::getIndexedType(PTy, (Value**)&Result[0],
1537 Result.size(),true);
1539 error("Index list invalid for constant getelementptr");
1544 const Type* upgradeGEPInstIndices(const Type* PTy,
1545 std::vector<ValueInfo> *Indices,
1546 std::vector<Value*> &Result) {
1547 const Type *Ty = PTy;
1549 for (unsigned i = 0, e = Indices->size(); i != e ; ++i) {
1550 Value *Index = (*Indices)[i].V;
1552 if (ConstantInt *CI = dyn_cast<ConstantInt>(Index)) {
1553 // LLVM 1.2 and earlier used ubyte struct indices. Convert any ubyte
1554 // struct indices to i32 struct indices with ZExt for compatibility.
1555 if (CI->getBitWidth() < 32)
1556 Index = ConstantExpr::getCast(Instruction::ZExt, CI, Type::Int32Ty);
1560 if (isa<StructType>(Ty)) { // Only change struct indices
1561 if (!isa<Constant>(Index)) {
1562 error("Invalid non-constant structure index");
1566 // Make sure that unsigned SequentialType indices are zext'd to
1567 // 64-bits if they were smaller than that because LLVM 2.0 will sext
1568 // all indices for SequentialType elements. We must retain the same
1569 // semantic (zext) for unsigned types.
1570 if (const IntegerType *Ity = dyn_cast<IntegerType>(Index->getType())) {
1571 if (Ity->getBitWidth() < 64 && (*Indices)[i].S.isUnsigned()) {
1572 if (isa<Constant>(Index))
1573 Index = ConstantExpr::getCast(Instruction::ZExt,
1574 cast<Constant>(Index), Type::Int64Ty);
1576 Index = CastInst::create(Instruction::ZExt, Index, Type::Int64Ty,
1577 makeNameUnique("gep"), CurBB);
1581 Result.push_back(Index);
1582 Ty = GetElementPtrInst::getIndexedType(PTy, &Result[0], Result.size(),true);
1584 error("Index list invalid for constant getelementptr");
1589 unsigned upgradeCallingConv(unsigned CC) {
1591 case OldCallingConv::C : return CallingConv::C;
1592 case OldCallingConv::CSRet : return CallingConv::C;
1593 case OldCallingConv::Fast : return CallingConv::Fast;
1594 case OldCallingConv::Cold : return CallingConv::Cold;
1595 case OldCallingConv::X86_StdCall : return CallingConv::X86_StdCall;
1596 case OldCallingConv::X86_FastCall: return CallingConv::X86_FastCall;
1602 Module* UpgradeAssembly(const std::string &infile, std::istream& in,
1603 bool debug, bool addAttrs)
1606 CurFilename = infile;
1609 AddAttributes = addAttrs;
1610 ObsoleteVarArgs = false;
1613 CurModule.CurrentModule = new Module(CurFilename);
1615 // Check to make sure the parser succeeded
1618 delete ParserResult;
1619 std::cerr << "llvm-upgrade: parse failed.\n";
1623 // Check to make sure that parsing produced a result
1624 if (!ParserResult) {
1625 std::cerr << "llvm-upgrade: no parse result.\n";
1629 // Reset ParserResult variable while saving its value for the result.
1630 Module *Result = ParserResult;
1633 //Not all functions use vaarg, so make a second check for ObsoleteVarArgs
1636 if ((F = Result->getFunction("llvm.va_start"))
1637 && F->getFunctionType()->getNumParams() == 0)
1638 ObsoleteVarArgs = true;
1639 if((F = Result->getFunction("llvm.va_copy"))
1640 && F->getFunctionType()->getNumParams() == 1)
1641 ObsoleteVarArgs = true;
1644 if (ObsoleteVarArgs && NewVarArgs) {
1645 error("This file is corrupt: it uses both new and old style varargs");
1649 if(ObsoleteVarArgs) {
1650 if(Function* F = Result->getFunction("llvm.va_start")) {
1651 if (F->arg_size() != 0) {
1652 error("Obsolete va_start takes 0 argument");
1658 //bar = alloca typeof(foo)
1662 const Type* RetTy = Type::getPrimitiveType(Type::VoidTyID);
1663 const Type* ArgTy = F->getFunctionType()->getReturnType();
1664 const Type* ArgTyPtr = PointerType::get(ArgTy);
1665 Function* NF = cast<Function>(Result->getOrInsertFunction(
1666 "llvm.va_start", RetTy, ArgTyPtr, (Type *)0));
1668 while (!F->use_empty()) {
1669 CallInst* CI = cast<CallInst>(F->use_back());
1670 AllocaInst* bar = new AllocaInst(ArgTy, 0, "vastart.fix.1", CI);
1671 new CallInst(NF, bar, "", CI);
1672 Value* foo = new LoadInst(bar, "vastart.fix.2", CI);
1673 CI->replaceAllUsesWith(foo);
1674 CI->getParent()->getInstList().erase(CI);
1676 Result->getFunctionList().erase(F);
1679 if(Function* F = Result->getFunction("llvm.va_end")) {
1680 if(F->arg_size() != 1) {
1681 error("Obsolete va_end takes 1 argument");
1687 //bar = alloca 1 of typeof(foo)
1689 const Type* RetTy = Type::getPrimitiveType(Type::VoidTyID);
1690 const Type* ArgTy = F->getFunctionType()->getParamType(0);
1691 const Type* ArgTyPtr = PointerType::get(ArgTy);
1692 Function* NF = cast<Function>(Result->getOrInsertFunction(
1693 "llvm.va_end", RetTy, ArgTyPtr, (Type *)0));
1695 while (!F->use_empty()) {
1696 CallInst* CI = cast<CallInst>(F->use_back());
1697 AllocaInst* bar = new AllocaInst(ArgTy, 0, "vaend.fix.1", CI);
1698 new StoreInst(CI->getOperand(1), bar, CI);
1699 new CallInst(NF, bar, "", CI);
1700 CI->getParent()->getInstList().erase(CI);
1702 Result->getFunctionList().erase(F);
1705 if(Function* F = Result->getFunction("llvm.va_copy")) {
1706 if(F->arg_size() != 1) {
1707 error("Obsolete va_copy takes 1 argument");
1712 //a = alloca 1 of typeof(foo)
1713 //b = alloca 1 of typeof(foo)
1718 const Type* RetTy = Type::getPrimitiveType(Type::VoidTyID);
1719 const Type* ArgTy = F->getFunctionType()->getReturnType();
1720 const Type* ArgTyPtr = PointerType::get(ArgTy);
1721 Function* NF = cast<Function>(Result->getOrInsertFunction(
1722 "llvm.va_copy", RetTy, ArgTyPtr, ArgTyPtr, (Type *)0));
1724 while (!F->use_empty()) {
1725 CallInst* CI = cast<CallInst>(F->use_back());
1727 new AllocaInst(ArgTy, 0, "vacopy.fix.1", CI),
1728 new AllocaInst(ArgTy, 0, "vacopy.fix.2", CI)
1730 new StoreInst(CI->getOperand(1), Args[1], CI);
1731 new CallInst(NF, Args, Args + 2, "", CI);
1732 Value* foo = new LoadInst(Args[0], "vacopy.fix.3", CI);
1733 CI->replaceAllUsesWith(foo);
1734 CI->getParent()->getInstList().erase(CI);
1736 Result->getFunctionList().erase(F);
1743 } // end llvm namespace
1745 using namespace llvm;
1750 llvm::Module *ModuleVal;
1751 llvm::Function *FunctionVal;
1752 std::pair<llvm::PATypeInfo, char*> *ArgVal;
1753 llvm::BasicBlock *BasicBlockVal;
1754 llvm::TermInstInfo TermInstVal;
1755 llvm::InstrInfo InstVal;
1756 llvm::ConstInfo ConstVal;
1757 llvm::ValueInfo ValueVal;
1758 llvm::PATypeInfo TypeVal;
1759 llvm::TypeInfo PrimType;
1760 llvm::PHIListInfo PHIList;
1761 std::list<llvm::PATypeInfo> *TypeList;
1762 std::vector<llvm::ValueInfo> *ValueList;
1763 std::vector<llvm::ConstInfo> *ConstVector;
1766 std::vector<std::pair<llvm::PATypeInfo,char*> > *ArgList;
1767 // Represent the RHS of PHI node
1768 std::vector<std::pair<llvm::Constant*, llvm::BasicBlock*> > *JumpTable;
1770 llvm::GlobalValue::LinkageTypes Linkage;
1778 char *StrVal; // This memory is strdup'd!
1779 llvm::ValID ValIDVal; // strdup'd memory maybe!
1781 llvm::BinaryOps BinaryOpVal;
1782 llvm::TermOps TermOpVal;
1783 llvm::MemoryOps MemOpVal;
1784 llvm::OtherOps OtherOpVal;
1785 llvm::CastOps CastOpVal;
1786 llvm::ICmpInst::Predicate IPred;
1787 llvm::FCmpInst::Predicate FPred;
1788 llvm::Module::Endianness Endianness;
1791 %type <ModuleVal> Module FunctionList
1792 %type <FunctionVal> Function FunctionProto FunctionHeader BasicBlockList
1793 %type <BasicBlockVal> BasicBlock InstructionList
1794 %type <TermInstVal> BBTerminatorInst
1795 %type <InstVal> Inst InstVal MemoryInst
1796 %type <ConstVal> ConstVal ConstExpr
1797 %type <ConstVector> ConstVector
1798 %type <ArgList> ArgList ArgListH
1799 %type <ArgVal> ArgVal
1800 %type <PHIList> PHIList
1801 %type <ValueList> ValueRefList ValueRefListE // For call param lists
1802 %type <ValueList> IndexList // For GEP derived indices
1803 %type <TypeList> TypeListI ArgTypeListI
1804 %type <JumpTable> JumpTable
1805 %type <BoolVal> GlobalType // GLOBAL or CONSTANT?
1806 %type <BoolVal> OptVolatile // 'volatile' or not
1807 %type <BoolVal> OptTailCall // TAIL CALL or plain CALL.
1808 %type <BoolVal> OptSideEffect // 'sideeffect' or not.
1809 %type <Linkage> OptLinkage FnDeclareLinkage
1810 %type <Endianness> BigOrLittle
1812 // ValueRef - Unresolved reference to a definition or BB
1813 %type <ValIDVal> ValueRef ConstValueRef SymbolicValueRef
1814 %type <ValueVal> ResolvedVal // <type> <valref> pair
1816 // Tokens and types for handling constant integer values
1818 // ESINT64VAL - A negative number within long long range
1819 %token <SInt64Val> ESINT64VAL
1821 // EUINT64VAL - A positive number within uns. long long range
1822 %token <UInt64Val> EUINT64VAL
1823 %type <SInt64Val> EINT64VAL
1825 %token <SIntVal> SINTVAL // Signed 32 bit ints...
1826 %token <UIntVal> UINTVAL // Unsigned 32 bit ints...
1827 %type <SIntVal> INTVAL
1828 %token <FPVal> FPVAL // Float or Double constant
1830 // Built in types...
1831 %type <TypeVal> Types TypesV UpRTypes UpRTypesV
1832 %type <PrimType> SIntType UIntType IntType FPType PrimType // Classifications
1833 %token <PrimType> VOID BOOL SBYTE UBYTE SHORT USHORT INT UINT LONG ULONG
1834 %token <PrimType> FLOAT DOUBLE TYPE LABEL
1836 %token <StrVal> VAR_ID LABELSTR STRINGCONSTANT
1837 %type <StrVal> Name OptName OptAssign
1838 %type <UIntVal> OptAlign OptCAlign
1839 %type <StrVal> OptSection SectionString
1841 %token IMPLEMENTATION ZEROINITIALIZER TRUETOK FALSETOK BEGINTOK ENDTOK
1842 %token DECLARE GLOBAL CONSTANT SECTION VOLATILE
1843 %token TO DOTDOTDOT NULL_TOK UNDEF CONST INTERNAL LINKONCE WEAK APPENDING
1844 %token DLLIMPORT DLLEXPORT EXTERN_WEAK
1845 %token OPAQUE NOT EXTERNAL TARGET TRIPLE ENDIAN POINTERSIZE LITTLE BIG ALIGN
1846 %token DEPLIBS CALL TAIL ASM_TOK MODULE SIDEEFFECT
1847 %token CC_TOK CCC_TOK CSRETCC_TOK FASTCC_TOK COLDCC_TOK
1848 %token X86_STDCALLCC_TOK X86_FASTCALLCC_TOK
1850 %type <UIntVal> OptCallingConv
1852 // Basic Block Terminating Operators
1853 %token <TermOpVal> RET BR SWITCH INVOKE UNREACHABLE
1854 %token UNWIND EXCEPT
1857 %type <BinaryOpVal> ArithmeticOps LogicalOps SetCondOps // Binops Subcatagories
1858 %type <BinaryOpVal> ShiftOps
1859 %token <BinaryOpVal> ADD SUB MUL DIV UDIV SDIV FDIV REM UREM SREM FREM
1860 %token <BinaryOpVal> AND OR XOR SHL SHR ASHR LSHR
1861 %token <BinaryOpVal> SETLE SETGE SETLT SETGT SETEQ SETNE // Binary Comparators
1862 %token <OtherOpVal> ICMP FCMP
1864 // Memory Instructions
1865 %token <MemOpVal> MALLOC ALLOCA FREE LOAD STORE GETELEMENTPTR
1868 %token <OtherOpVal> PHI_TOK SELECT VAARG
1869 %token <OtherOpVal> EXTRACTELEMENT INSERTELEMENT SHUFFLEVECTOR
1870 %token VAARG_old VANEXT_old //OBSOLETE
1872 // Support for ICmp/FCmp Predicates, which is 1.9++ but not 2.0
1873 %type <IPred> IPredicates
1874 %type <FPred> FPredicates
1875 %token EQ NE SLT SGT SLE SGE ULT UGT ULE UGE
1876 %token OEQ ONE OLT OGT OLE OGE ORD UNO UEQ UNE
1878 %token <CastOpVal> CAST TRUNC ZEXT SEXT FPTRUNC FPEXT FPTOUI FPTOSI
1879 %token <CastOpVal> UITOFP SITOFP PTRTOINT INTTOPTR BITCAST
1880 %type <CastOpVal> CastOps
1886 // Handle constant integer size restriction and conversion...
1891 if ($1 > (uint32_t)INT32_MAX) // Outside of my range!
1892 error("Value too large for type");
1898 : ESINT64VAL // These have same type and can't cause problems...
1900 if ($1 > (uint64_t)INT64_MAX) // Outside of my range!
1901 error("Value too large for type");
1905 // Operations that are notably excluded from this list include:
1906 // RET, BR, & SWITCH because they end basic blocks and are treated specially.
1909 : ADD | SUB | MUL | DIV | UDIV | SDIV | FDIV | REM | UREM | SREM | FREM
1917 : SETLE | SETGE | SETLT | SETGT | SETEQ | SETNE
1921 : EQ { $$ = ICmpInst::ICMP_EQ; } | NE { $$ = ICmpInst::ICMP_NE; }
1922 | SLT { $$ = ICmpInst::ICMP_SLT; } | SGT { $$ = ICmpInst::ICMP_SGT; }
1923 | SLE { $$ = ICmpInst::ICMP_SLE; } | SGE { $$ = ICmpInst::ICMP_SGE; }
1924 | ULT { $$ = ICmpInst::ICMP_ULT; } | UGT { $$ = ICmpInst::ICMP_UGT; }
1925 | ULE { $$ = ICmpInst::ICMP_ULE; } | UGE { $$ = ICmpInst::ICMP_UGE; }
1929 : OEQ { $$ = FCmpInst::FCMP_OEQ; } | ONE { $$ = FCmpInst::FCMP_ONE; }
1930 | OLT { $$ = FCmpInst::FCMP_OLT; } | OGT { $$ = FCmpInst::FCMP_OGT; }
1931 | OLE { $$ = FCmpInst::FCMP_OLE; } | OGE { $$ = FCmpInst::FCMP_OGE; }
1932 | ORD { $$ = FCmpInst::FCMP_ORD; } | UNO { $$ = FCmpInst::FCMP_UNO; }
1933 | UEQ { $$ = FCmpInst::FCMP_UEQ; } | UNE { $$ = FCmpInst::FCMP_UNE; }
1934 | ULT { $$ = FCmpInst::FCMP_ULT; } | UGT { $$ = FCmpInst::FCMP_UGT; }
1935 | ULE { $$ = FCmpInst::FCMP_ULE; } | UGE { $$ = FCmpInst::FCMP_UGE; }
1936 | TRUETOK { $$ = FCmpInst::FCMP_TRUE; }
1937 | FALSETOK { $$ = FCmpInst::FCMP_FALSE; }
1940 : SHL | SHR | ASHR | LSHR
1944 : TRUNC | ZEXT | SEXT | FPTRUNC | FPEXT | FPTOUI | FPTOSI
1945 | UITOFP | SITOFP | PTRTOINT | INTTOPTR | BITCAST | CAST
1948 // These are some types that allow classification if we only want a particular
1949 // thing... for example, only a signed, unsigned, or integral type.
1951 : LONG | INT | SHORT | SBYTE
1955 : ULONG | UINT | USHORT | UBYTE
1959 : SIntType | UIntType
1966 // OptAssign - Value producing statements have an optional assignment component
1976 : INTERNAL { $$ = GlobalValue::InternalLinkage; }
1977 | LINKONCE { $$ = GlobalValue::LinkOnceLinkage; }
1978 | WEAK { $$ = GlobalValue::WeakLinkage; }
1979 | APPENDING { $$ = GlobalValue::AppendingLinkage; }
1980 | DLLIMPORT { $$ = GlobalValue::DLLImportLinkage; }
1981 | DLLEXPORT { $$ = GlobalValue::DLLExportLinkage; }
1982 | EXTERN_WEAK { $$ = GlobalValue::ExternalWeakLinkage; }
1983 | /*empty*/ { $$ = GlobalValue::ExternalLinkage; }
1987 : /*empty*/ { $$ = lastCallingConv = OldCallingConv::C; }
1988 | CCC_TOK { $$ = lastCallingConv = OldCallingConv::C; }
1989 | CSRETCC_TOK { $$ = lastCallingConv = OldCallingConv::CSRet; }
1990 | FASTCC_TOK { $$ = lastCallingConv = OldCallingConv::Fast; }
1991 | COLDCC_TOK { $$ = lastCallingConv = OldCallingConv::Cold; }
1992 | X86_STDCALLCC_TOK { $$ = lastCallingConv = OldCallingConv::X86_StdCall; }
1993 | X86_FASTCALLCC_TOK { $$ = lastCallingConv = OldCallingConv::X86_FastCall; }
1994 | CC_TOK EUINT64VAL {
1995 if ((unsigned)$2 != $2)
1996 error("Calling conv too large");
1997 $$ = lastCallingConv = $2;
2001 // OptAlign/OptCAlign - An optional alignment, and an optional alignment with
2002 // a comma before it.
2004 : /*empty*/ { $$ = 0; }
2005 | ALIGN EUINT64VAL {
2007 if ($$ != 0 && !isPowerOf2_32($$))
2008 error("Alignment must be a power of two");
2013 : /*empty*/ { $$ = 0; }
2014 | ',' ALIGN EUINT64VAL {
2016 if ($$ != 0 && !isPowerOf2_32($$))
2017 error("Alignment must be a power of two");
2022 : SECTION STRINGCONSTANT {
2023 for (unsigned i = 0, e = strlen($2); i != e; ++i)
2024 if ($2[i] == '"' || $2[i] == '\\')
2025 error("Invalid character in section name");
2031 : /*empty*/ { $$ = 0; }
2032 | SectionString { $$ = $1; }
2035 // GlobalVarAttributes - Used to pass the attributes string on a global. CurGV
2036 // is set to be the global we are processing.
2040 | ',' GlobalVarAttribute GlobalVarAttributes {}
2045 CurGV->setSection($1);
2048 | ALIGN EUINT64VAL {
2049 if ($2 != 0 && !isPowerOf2_32($2))
2050 error("Alignment must be a power of two");
2051 CurGV->setAlignment($2);
2056 //===----------------------------------------------------------------------===//
2057 // Types includes all predefined types... except void, because it can only be
2058 // used in specific contexts (function returning void for example). To have
2059 // access to it, a user must explicitly use TypesV.
2062 // TypesV includes all of 'Types', but it also includes the void type.
2066 $$.PAT = new PATypeHolder($1.T);
2067 $$.S.makeSignless();
2074 $$.PAT = new PATypeHolder($1.T);
2075 $$.S.makeSignless();
2081 if (!UpRefs.empty())
2082 error("Invalid upreference in type: " + (*$1.PAT)->getDescription());
2088 : BOOL | SBYTE | UBYTE | SHORT | USHORT | INT | UINT
2089 | LONG | ULONG | FLOAT | DOUBLE | LABEL
2092 // Derived types are added later...
2095 $$.PAT = new PATypeHolder($1.T);
2099 $$.PAT = new PATypeHolder(OpaqueType::get());
2100 $$.S.makeSignless();
2102 | SymbolicValueRef { // Named types are also simple types...
2103 $$.S.copy(getTypeSign($1));
2104 const Type* tmp = getType($1);
2105 $$.PAT = new PATypeHolder(tmp);
2107 | '\\' EUINT64VAL { // Type UpReference
2108 if ($2 > (uint64_t)~0U)
2109 error("Value out of range");
2110 OpaqueType *OT = OpaqueType::get(); // Use temporary placeholder
2111 UpRefs.push_back(UpRefRecord((unsigned)$2, OT)); // Add to vector...
2112 $$.PAT = new PATypeHolder(OT);
2113 $$.S.makeSignless();
2114 UR_OUT("New Upreference!\n");
2116 | UpRTypesV '(' ArgTypeListI ')' { // Function derived type?
2117 $$.S.makeComposite($1.S);
2118 std::vector<const Type*> Params;
2119 for (std::list<llvm::PATypeInfo>::iterator I = $3->begin(),
2120 E = $3->end(); I != E; ++I) {
2121 Params.push_back(I->PAT->get());
2124 bool isVarArg = Params.size() && Params.back() == Type::VoidTy;
2125 if (isVarArg) Params.pop_back();
2127 ParamAttrsList *PAL = 0;
2128 if (lastCallingConv == OldCallingConv::CSRet) {
2129 ParamAttrsVector Attrs;
2130 ParamAttrsWithIndex PAWI;
2131 PAWI.index = 1; PAWI.attrs = ParamAttr::StructRet; // first arg
2132 Attrs.push_back(PAWI);
2133 PAL = ParamAttrsList::get(Attrs);
2136 const FunctionType *FTy =
2137 FunctionType::get($1.PAT->get(), Params, isVarArg, PAL);
2139 $$.PAT = new PATypeHolder( HandleUpRefs(FTy, $$.S) );
2140 delete $1.PAT; // Delete the return type handle
2141 delete $3; // Delete the argument list
2143 | '[' EUINT64VAL 'x' UpRTypes ']' { // Sized array type?
2144 $$.S.makeComposite($4.S);
2145 $$.PAT = new PATypeHolder(HandleUpRefs(ArrayType::get($4.PAT->get(),
2146 (unsigned)$2), $$.S));
2149 | '<' EUINT64VAL 'x' UpRTypes '>' { // Vector type?
2150 const llvm::Type* ElemTy = $4.PAT->get();
2151 if ((unsigned)$2 != $2)
2152 error("Unsigned result not equal to signed result");
2153 if (!(ElemTy->isInteger() || ElemTy->isFloatingPoint()))
2154 error("Elements of a VectorType must be integer or floating point");
2155 if (!isPowerOf2_32($2))
2156 error("VectorType length should be a power of 2");
2157 $$.S.makeComposite($4.S);
2158 $$.PAT = new PATypeHolder(HandleUpRefs(VectorType::get(ElemTy,
2159 (unsigned)$2), $$.S));
2162 | '{' TypeListI '}' { // Structure type?
2163 std::vector<const Type*> Elements;
2164 $$.S.makeComposite();
2165 for (std::list<llvm::PATypeInfo>::iterator I = $2->begin(),
2166 E = $2->end(); I != E; ++I) {
2167 Elements.push_back(I->PAT->get());
2170 $$.PAT = new PATypeHolder(HandleUpRefs(StructType::get(Elements), $$.S));
2173 | '{' '}' { // Empty structure type?
2174 $$.PAT = new PATypeHolder(StructType::get(std::vector<const Type*>()));
2175 $$.S.makeComposite();
2177 | '<' '{' TypeListI '}' '>' { // Packed Structure type?
2178 $$.S.makeComposite();
2179 std::vector<const Type*> Elements;
2180 for (std::list<llvm::PATypeInfo>::iterator I = $3->begin(),
2181 E = $3->end(); I != E; ++I) {
2182 Elements.push_back(I->PAT->get());
2186 $$.PAT = new PATypeHolder(HandleUpRefs(StructType::get(Elements, true),
2190 | '<' '{' '}' '>' { // Empty packed structure type?
2191 $$.PAT = new PATypeHolder(StructType::get(std::vector<const Type*>(),true));
2192 $$.S.makeComposite();
2194 | UpRTypes '*' { // Pointer type?
2195 if ($1.PAT->get() == Type::LabelTy)
2196 error("Cannot form a pointer to a basic block");
2197 $$.S.makeComposite($1.S);
2198 $$.PAT = new PATypeHolder(HandleUpRefs(PointerType::get($1.PAT->get()),
2204 // TypeList - Used for struct declarations and as a basis for function type
2205 // declaration type lists
2209 $$ = new std::list<PATypeInfo>();
2212 | TypeListI ',' UpRTypes {
2213 ($$=$1)->push_back($3);
2217 // ArgTypeList - List of types for a function type declaration...
2220 | TypeListI ',' DOTDOTDOT {
2222 VoidTI.PAT = new PATypeHolder(Type::VoidTy);
2223 VoidTI.S.makeSignless();
2224 ($$=$1)->push_back(VoidTI);
2227 $$ = new std::list<PATypeInfo>();
2229 VoidTI.PAT = new PATypeHolder(Type::VoidTy);
2230 VoidTI.S.makeSignless();
2231 $$->push_back(VoidTI);
2234 $$ = new std::list<PATypeInfo>();
2238 // ConstVal - The various declarations that go into the constant pool. This
2239 // production is used ONLY to represent constants that show up AFTER a 'const',
2240 // 'constant' or 'global' token at global scope. Constants that can be inlined
2241 // into other expressions (such as integers and constexprs) are handled by the
2242 // ResolvedVal, ValueRef and ConstValueRef productions.
2245 : Types '[' ConstVector ']' { // Nonempty unsized arr
2246 const ArrayType *ATy = dyn_cast<ArrayType>($1.PAT->get());
2248 error("Cannot make array constant with type: '" +
2249 $1.PAT->get()->getDescription() + "'");
2250 const Type *ETy = ATy->getElementType();
2251 int NumElements = ATy->getNumElements();
2253 // Verify that we have the correct size...
2254 if (NumElements != -1 && NumElements != (int)$3->size())
2255 error("Type mismatch: constant sized array initialized with " +
2256 utostr($3->size()) + " arguments, but has size of " +
2257 itostr(NumElements) + "");
2259 // Verify all elements are correct type!
2260 std::vector<Constant*> Elems;
2261 for (unsigned i = 0; i < $3->size(); i++) {
2262 Constant *C = (*$3)[i].C;
2263 const Type* ValTy = C->getType();
2265 error("Element #" + utostr(i) + " is not of type '" +
2266 ETy->getDescription() +"' as required!\nIt is of type '"+
2267 ValTy->getDescription() + "'");
2270 $$.C = ConstantArray::get(ATy, Elems);
2276 const ArrayType *ATy = dyn_cast<ArrayType>($1.PAT->get());
2278 error("Cannot make array constant with type: '" +
2279 $1.PAT->get()->getDescription() + "'");
2280 int NumElements = ATy->getNumElements();
2281 if (NumElements != -1 && NumElements != 0)
2282 error("Type mismatch: constant sized array initialized with 0"
2283 " arguments, but has size of " + itostr(NumElements) +"");
2284 $$.C = ConstantArray::get(ATy, std::vector<Constant*>());
2288 | Types 'c' STRINGCONSTANT {
2289 const ArrayType *ATy = dyn_cast<ArrayType>($1.PAT->get());
2291 error("Cannot make array constant with type: '" +
2292 $1.PAT->get()->getDescription() + "'");
2293 int NumElements = ATy->getNumElements();
2294 const Type *ETy = dyn_cast<IntegerType>(ATy->getElementType());
2295 if (!ETy || cast<IntegerType>(ETy)->getBitWidth() != 8)
2296 error("String arrays require type i8, not '" + ETy->getDescription() +
2298 char *EndStr = UnEscapeLexed($3, true);
2299 if (NumElements != -1 && NumElements != (EndStr-$3))
2300 error("Can't build string constant of size " +
2301 itostr((int)(EndStr-$3)) + " when array has size " +
2302 itostr(NumElements) + "");
2303 std::vector<Constant*> Vals;
2304 for (char *C = (char *)$3; C != (char *)EndStr; ++C)
2305 Vals.push_back(ConstantInt::get(ETy, *C));
2307 $$.C = ConstantArray::get(ATy, Vals);
2311 | Types '<' ConstVector '>' { // Nonempty unsized arr
2312 const VectorType *PTy = dyn_cast<VectorType>($1.PAT->get());
2314 error("Cannot make packed constant with type: '" +
2315 $1.PAT->get()->getDescription() + "'");
2316 const Type *ETy = PTy->getElementType();
2317 int NumElements = PTy->getNumElements();
2318 // Verify that we have the correct size...
2319 if (NumElements != -1 && NumElements != (int)$3->size())
2320 error("Type mismatch: constant sized packed initialized with " +
2321 utostr($3->size()) + " arguments, but has size of " +
2322 itostr(NumElements) + "");
2323 // Verify all elements are correct type!
2324 std::vector<Constant*> Elems;
2325 for (unsigned i = 0; i < $3->size(); i++) {
2326 Constant *C = (*$3)[i].C;
2327 const Type* ValTy = C->getType();
2329 error("Element #" + utostr(i) + " is not of type '" +
2330 ETy->getDescription() +"' as required!\nIt is of type '"+
2331 ValTy->getDescription() + "'");
2334 $$.C = ConstantVector::get(PTy, Elems);
2339 | Types '{' ConstVector '}' {
2340 const StructType *STy = dyn_cast<StructType>($1.PAT->get());
2342 error("Cannot make struct constant with type: '" +
2343 $1.PAT->get()->getDescription() + "'");
2344 if ($3->size() != STy->getNumContainedTypes())
2345 error("Illegal number of initializers for structure type");
2347 // Check to ensure that constants are compatible with the type initializer!
2348 std::vector<Constant*> Fields;
2349 for (unsigned i = 0, e = $3->size(); i != e; ++i) {
2350 Constant *C = (*$3)[i].C;
2351 if (C->getType() != STy->getElementType(i))
2352 error("Expected type '" + STy->getElementType(i)->getDescription() +
2353 "' for element #" + utostr(i) + " of structure initializer");
2354 Fields.push_back(C);
2356 $$.C = ConstantStruct::get(STy, Fields);
2362 const StructType *STy = dyn_cast<StructType>($1.PAT->get());
2364 error("Cannot make struct constant with type: '" +
2365 $1.PAT->get()->getDescription() + "'");
2366 if (STy->getNumContainedTypes() != 0)
2367 error("Illegal number of initializers for structure type");
2368 $$.C = ConstantStruct::get(STy, std::vector<Constant*>());
2372 | Types '<' '{' ConstVector '}' '>' {
2373 const StructType *STy = dyn_cast<StructType>($1.PAT->get());
2375 error("Cannot make packed struct constant with type: '" +
2376 $1.PAT->get()->getDescription() + "'");
2377 if ($4->size() != STy->getNumContainedTypes())
2378 error("Illegal number of initializers for packed structure type");
2380 // Check to ensure that constants are compatible with the type initializer!
2381 std::vector<Constant*> Fields;
2382 for (unsigned i = 0, e = $4->size(); i != e; ++i) {
2383 Constant *C = (*$4)[i].C;
2384 if (C->getType() != STy->getElementType(i))
2385 error("Expected type '" + STy->getElementType(i)->getDescription() +
2386 "' for element #" + utostr(i) + " of packed struct initializer");
2387 Fields.push_back(C);
2389 $$.C = ConstantStruct::get(STy, Fields);
2394 | Types '<' '{' '}' '>' {
2395 const StructType *STy = dyn_cast<StructType>($1.PAT->get());
2397 error("Cannot make packed struct constant with type: '" +
2398 $1.PAT->get()->getDescription() + "'");
2399 if (STy->getNumContainedTypes() != 0)
2400 error("Illegal number of initializers for packed structure type");
2401 $$.C = ConstantStruct::get(STy, std::vector<Constant*>());
2406 const PointerType *PTy = dyn_cast<PointerType>($1.PAT->get());
2408 error("Cannot make null pointer constant with type: '" +
2409 $1.PAT->get()->getDescription() + "'");
2410 $$.C = ConstantPointerNull::get(PTy);
2415 $$.C = UndefValue::get($1.PAT->get());
2419 | Types SymbolicValueRef {
2420 const PointerType *Ty = dyn_cast<PointerType>($1.PAT->get());
2422 error("Global const reference must be a pointer type, not" +
2423 $1.PAT->get()->getDescription());
2425 // ConstExprs can exist in the body of a function, thus creating
2426 // GlobalValues whenever they refer to a variable. Because we are in
2427 // the context of a function, getExistingValue will search the functions
2428 // symbol table instead of the module symbol table for the global symbol,
2429 // which throws things all off. To get around this, we just tell
2430 // getExistingValue that we are at global scope here.
2432 Function *SavedCurFn = CurFun.CurrentFunction;
2433 CurFun.CurrentFunction = 0;
2435 Value *V = getExistingValue(Ty, $2);
2436 CurFun.CurrentFunction = SavedCurFn;
2438 // If this is an initializer for a constant pointer, which is referencing a
2439 // (currently) undefined variable, create a stub now that shall be replaced
2440 // in the future with the right type of variable.
2443 assert(isa<PointerType>(Ty) && "Globals may only be used as pointers");
2444 const PointerType *PT = cast<PointerType>(Ty);
2446 // First check to see if the forward references value is already created!
2447 PerModuleInfo::GlobalRefsType::iterator I =
2448 CurModule.GlobalRefs.find(std::make_pair(PT, $2));
2450 if (I != CurModule.GlobalRefs.end()) {
2451 V = I->second; // Placeholder already exists, use it...
2455 if ($2.Type == ValID::NameVal) Name = $2.Name;
2457 // Create the forward referenced global.
2459 if (const FunctionType *FTy =
2460 dyn_cast<FunctionType>(PT->getElementType())) {
2461 GV = new Function(FTy, GlobalValue::ExternalLinkage, Name,
2462 CurModule.CurrentModule);
2464 GV = new GlobalVariable(PT->getElementType(), false,
2465 GlobalValue::ExternalLinkage, 0,
2466 Name, CurModule.CurrentModule);
2469 // Keep track of the fact that we have a forward ref to recycle it
2470 CurModule.GlobalRefs.insert(std::make_pair(std::make_pair(PT, $2), GV));
2474 $$.C = cast<GlobalValue>(V);
2476 delete $1.PAT; // Free the type handle
2479 if ($1.PAT->get() != $2.C->getType())
2480 error("Mismatched types for constant expression");
2485 | Types ZEROINITIALIZER {
2486 const Type *Ty = $1.PAT->get();
2487 if (isa<FunctionType>(Ty) || Ty == Type::LabelTy || isa<OpaqueType>(Ty))
2488 error("Cannot create a null initialized value of this type");
2489 $$.C = Constant::getNullValue(Ty);
2493 | SIntType EINT64VAL { // integral constants
2494 const Type *Ty = $1.T;
2495 if (!ConstantInt::isValueValidForType(Ty, $2))
2496 error("Constant value doesn't fit in type");
2497 $$.C = ConstantInt::get(Ty, $2);
2500 | UIntType EUINT64VAL { // integral constants
2501 const Type *Ty = $1.T;
2502 if (!ConstantInt::isValueValidForType(Ty, $2))
2503 error("Constant value doesn't fit in type");
2504 $$.C = ConstantInt::get(Ty, $2);
2505 $$.S.makeUnsigned();
2507 | BOOL TRUETOK { // Boolean constants
2508 $$.C = ConstantInt::get(Type::Int1Ty, true);
2509 $$.S.makeUnsigned();
2511 | BOOL FALSETOK { // Boolean constants
2512 $$.C = ConstantInt::get(Type::Int1Ty, false);
2513 $$.S.makeUnsigned();
2515 | FPType FPVAL { // Float & Double constants
2516 if (!ConstantFP::isValueValidForType($1.T, $2))
2517 error("Floating point constant invalid for type");
2518 $$.C = ConstantFP::get($1.T, $2);
2519 $$.S.makeSignless();
2524 : CastOps '(' ConstVal TO Types ')' {
2525 const Type* SrcTy = $3.C->getType();
2526 const Type* DstTy = $5.PAT->get();
2527 Signedness SrcSign($3.S);
2528 Signedness DstSign($5.S);
2529 if (!SrcTy->isFirstClassType())
2530 error("cast constant expression from a non-primitive type: '" +
2531 SrcTy->getDescription() + "'");
2532 if (!DstTy->isFirstClassType())
2533 error("cast constant expression to a non-primitive type: '" +
2534 DstTy->getDescription() + "'");
2535 $$.C = cast<Constant>(getCast($1, $3.C, SrcSign, DstTy, DstSign));
2539 | GETELEMENTPTR '(' ConstVal IndexList ')' {
2540 const Type *Ty = $3.C->getType();
2541 if (!isa<PointerType>(Ty))
2542 error("GetElementPtr requires a pointer operand");
2544 std::vector<Constant*> CIndices;
2545 upgradeGEPCEIndices($3.C->getType(), $4, CIndices);
2548 $$.C = ConstantExpr::getGetElementPtr($3.C, &CIndices[0], CIndices.size());
2549 $$.S.copy(getElementSign($3, CIndices));
2551 | SELECT '(' ConstVal ',' ConstVal ',' ConstVal ')' {
2552 if (!$3.C->getType()->isInteger() ||
2553 cast<IntegerType>($3.C->getType())->getBitWidth() != 1)
2554 error("Select condition must be bool type");
2555 if ($5.C->getType() != $7.C->getType())
2556 error("Select operand types must match");
2557 $$.C = ConstantExpr::getSelect($3.C, $5.C, $7.C);
2560 | ArithmeticOps '(' ConstVal ',' ConstVal ')' {
2561 const Type *Ty = $3.C->getType();
2562 if (Ty != $5.C->getType())
2563 error("Binary operator types must match");
2564 // First, make sure we're dealing with the right opcode by upgrading from
2565 // obsolete versions.
2566 Instruction::BinaryOps Opcode = getBinaryOp($1, Ty, $3.S);
2568 // HACK: llvm 1.3 and earlier used to emit invalid pointer constant exprs.
2569 // To retain backward compatibility with these early compilers, we emit a
2570 // cast to the appropriate integer type automatically if we are in the
2571 // broken case. See PR424 for more information.
2572 if (!isa<PointerType>(Ty)) {
2573 $$.C = ConstantExpr::get(Opcode, $3.C, $5.C);
2575 const Type *IntPtrTy = 0;
2576 switch (CurModule.CurrentModule->getPointerSize()) {
2577 case Module::Pointer32: IntPtrTy = Type::Int32Ty; break;
2578 case Module::Pointer64: IntPtrTy = Type::Int64Ty; break;
2579 default: error("invalid pointer binary constant expr");
2581 $$.C = ConstantExpr::get(Opcode,
2582 ConstantExpr::getCast(Instruction::PtrToInt, $3.C, IntPtrTy),
2583 ConstantExpr::getCast(Instruction::PtrToInt, $5.C, IntPtrTy));
2584 $$.C = ConstantExpr::getCast(Instruction::IntToPtr, $$.C, Ty);
2588 | LogicalOps '(' ConstVal ',' ConstVal ')' {
2589 const Type* Ty = $3.C->getType();
2590 if (Ty != $5.C->getType())
2591 error("Logical operator types must match");
2592 if (!Ty->isInteger()) {
2593 if (!isa<VectorType>(Ty) ||
2594 !cast<VectorType>(Ty)->getElementType()->isInteger())
2595 error("Logical operator requires integer operands");
2597 Instruction::BinaryOps Opcode = getBinaryOp($1, Ty, $3.S);
2598 $$.C = ConstantExpr::get(Opcode, $3.C, $5.C);
2601 | SetCondOps '(' ConstVal ',' ConstVal ')' {
2602 const Type* Ty = $3.C->getType();
2603 if (Ty != $5.C->getType())
2604 error("setcc operand types must match");
2605 unsigned short pred;
2606 Instruction::OtherOps Opcode = getCompareOp($1, pred, Ty, $3.S);
2607 $$.C = ConstantExpr::getCompare(Opcode, $3.C, $5.C);
2608 $$.S.makeUnsigned();
2610 | ICMP IPredicates '(' ConstVal ',' ConstVal ')' {
2611 if ($4.C->getType() != $6.C->getType())
2612 error("icmp operand types must match");
2613 $$.C = ConstantExpr::getCompare($2, $4.C, $6.C);
2614 $$.S.makeUnsigned();
2616 | FCMP FPredicates '(' ConstVal ',' ConstVal ')' {
2617 if ($4.C->getType() != $6.C->getType())
2618 error("fcmp operand types must match");
2619 $$.C = ConstantExpr::getCompare($2, $4.C, $6.C);
2620 $$.S.makeUnsigned();
2622 | ShiftOps '(' ConstVal ',' ConstVal ')' {
2623 if (!$5.C->getType()->isInteger() ||
2624 cast<IntegerType>($5.C->getType())->getBitWidth() != 8)
2625 error("Shift count for shift constant must be unsigned byte");
2626 const Type* Ty = $3.C->getType();
2627 if (!$3.C->getType()->isInteger())
2628 error("Shift constant expression requires integer operand");
2629 Constant *ShiftAmt = ConstantExpr::getZExt($5.C, Ty);
2630 $$.C = ConstantExpr::get(getBinaryOp($1, Ty, $3.S), $3.C, ShiftAmt);
2633 | EXTRACTELEMENT '(' ConstVal ',' ConstVal ')' {
2634 if (!ExtractElementInst::isValidOperands($3.C, $5.C))
2635 error("Invalid extractelement operands");
2636 $$.C = ConstantExpr::getExtractElement($3.C, $5.C);
2637 $$.S.copy($3.S.get(0));
2639 | INSERTELEMENT '(' ConstVal ',' ConstVal ',' ConstVal ')' {
2640 if (!InsertElementInst::isValidOperands($3.C, $5.C, $7.C))
2641 error("Invalid insertelement operands");
2642 $$.C = ConstantExpr::getInsertElement($3.C, $5.C, $7.C);
2645 | SHUFFLEVECTOR '(' ConstVal ',' ConstVal ',' ConstVal ')' {
2646 if (!ShuffleVectorInst::isValidOperands($3.C, $5.C, $7.C))
2647 error("Invalid shufflevector operands");
2648 $$.C = ConstantExpr::getShuffleVector($3.C, $5.C, $7.C);
2654 // ConstVector - A list of comma separated constants.
2656 : ConstVector ',' ConstVal { ($$ = $1)->push_back($3); }
2658 $$ = new std::vector<ConstInfo>();
2664 // GlobalType - Match either GLOBAL or CONSTANT for global declarations...
2666 : GLOBAL { $$ = false; }
2667 | CONSTANT { $$ = true; }
2671 //===----------------------------------------------------------------------===//
2672 // Rules to match Modules
2673 //===----------------------------------------------------------------------===//
2675 // Module rule: Capture the result of parsing the whole file into a result
2680 $$ = ParserResult = $1;
2681 CurModule.ModuleDone();
2685 // FunctionList - A list of functions, preceeded by a constant pool.
2688 : FunctionList Function { $$ = $1; CurFun.FunctionDone(); }
2689 | FunctionList FunctionProto { $$ = $1; }
2690 | FunctionList MODULE ASM_TOK AsmBlock { $$ = $1; }
2691 | FunctionList IMPLEMENTATION { $$ = $1; }
2693 $$ = CurModule.CurrentModule;
2694 // Emit an error if there are any unresolved types left.
2695 if (!CurModule.LateResolveTypes.empty()) {
2696 const ValID &DID = CurModule.LateResolveTypes.begin()->first;
2697 if (DID.Type == ValID::NameVal) {
2698 error("Reference to an undefined type: '"+DID.getName() + "'");
2700 error("Reference to an undefined type: #" + itostr(DID.Num));
2706 // ConstPool - Constants with optional names assigned to them.
2708 : ConstPool OptAssign TYPE TypesV {
2709 // Eagerly resolve types. This is not an optimization, this is a
2710 // requirement that is due to the fact that we could have this:
2712 // %list = type { %list * }
2713 // %list = type { %list * } ; repeated type decl
2715 // If types are not resolved eagerly, then the two types will not be
2716 // determined to be the same type!
2718 ResolveTypeTo($2, $4.PAT->get(), $4.S);
2720 if (!setTypeName($4, $2) && !$2) {
2721 // If this is a numbered type that is not a redefinition, add it to the
2723 CurModule.Types.push_back($4.PAT->get());
2724 CurModule.TypeSigns.push_back($4.S);
2728 | ConstPool FunctionProto { // Function prototypes can be in const pool
2730 | ConstPool MODULE ASM_TOK AsmBlock { // Asm blocks can be in the const pool
2732 | ConstPool OptAssign OptLinkage GlobalType ConstVal {
2734 error("Global value initializer is not a constant");
2735 CurGV = ParseGlobalVariable($2, $3, $4, $5.C->getType(), $5.C, $5.S);
2736 } GlobalVarAttributes {
2739 | ConstPool OptAssign EXTERNAL GlobalType Types {
2740 const Type *Ty = $5.PAT->get();
2741 CurGV = ParseGlobalVariable($2, GlobalValue::ExternalLinkage, $4, Ty, 0,
2744 } GlobalVarAttributes {
2747 | ConstPool OptAssign DLLIMPORT GlobalType Types {
2748 const Type *Ty = $5.PAT->get();
2749 CurGV = ParseGlobalVariable($2, GlobalValue::DLLImportLinkage, $4, Ty, 0,
2752 } GlobalVarAttributes {
2755 | ConstPool OptAssign EXTERN_WEAK GlobalType Types {
2756 const Type *Ty = $5.PAT->get();
2758 ParseGlobalVariable($2, GlobalValue::ExternalWeakLinkage, $4, Ty, 0,
2761 } GlobalVarAttributes {
2764 | ConstPool TARGET TargetDefinition {
2766 | ConstPool DEPLIBS '=' LibrariesDefinition {
2768 | /* empty: end of list */ {
2774 const std::string &AsmSoFar = CurModule.CurrentModule->getModuleInlineAsm();
2775 char *EndStr = UnEscapeLexed($1, true);
2776 std::string NewAsm($1, EndStr);
2779 if (AsmSoFar.empty())
2780 CurModule.CurrentModule->setModuleInlineAsm(NewAsm);
2782 CurModule.CurrentModule->setModuleInlineAsm(AsmSoFar+"\n"+NewAsm);
2787 : BIG { $$ = Module::BigEndian; }
2788 | LITTLE { $$ = Module::LittleEndian; }
2792 : ENDIAN '=' BigOrLittle {
2793 CurModule.setEndianness($3);
2795 | POINTERSIZE '=' EUINT64VAL {
2797 CurModule.setPointerSize(Module::Pointer32);
2799 CurModule.setPointerSize(Module::Pointer64);
2801 error("Invalid pointer size: '" + utostr($3) + "'");
2803 | TRIPLE '=' STRINGCONSTANT {
2804 CurModule.CurrentModule->setTargetTriple($3);
2807 | DATALAYOUT '=' STRINGCONSTANT {
2808 CurModule.CurrentModule->setDataLayout($3);
2818 : LibList ',' STRINGCONSTANT {
2819 CurModule.CurrentModule->addLibrary($3);
2823 CurModule.CurrentModule->addLibrary($1);
2826 | /* empty: end of list */ { }
2829 //===----------------------------------------------------------------------===//
2830 // Rules to match Function Headers
2831 //===----------------------------------------------------------------------===//
2834 : VAR_ID | STRINGCONSTANT
2839 | /*empty*/ { $$ = 0; }
2844 if ($1.PAT->get() == Type::VoidTy)
2845 error("void typed arguments are invalid");
2846 $$ = new std::pair<PATypeInfo, char*>($1, $2);
2851 : ArgListH ',' ArgVal {
2857 $$ = new std::vector<std::pair<PATypeInfo,char*> >();
2864 : ArgListH { $$ = $1; }
2865 | ArgListH ',' DOTDOTDOT {
2868 VoidTI.PAT = new PATypeHolder(Type::VoidTy);
2869 VoidTI.S.makeSignless();
2870 $$->push_back(std::pair<PATypeInfo, char*>(VoidTI, 0));
2873 $$ = new std::vector<std::pair<PATypeInfo,char*> >();
2875 VoidTI.PAT = new PATypeHolder(Type::VoidTy);
2876 VoidTI.S.makeSignless();
2877 $$->push_back(std::pair<PATypeInfo, char*>(VoidTI, 0));
2879 | /* empty */ { $$ = 0; }
2883 : OptCallingConv TypesV Name '(' ArgList ')' OptSection OptAlign {
2885 std::string FunctionName($3);
2886 free($3); // Free strdup'd memory!
2888 const Type* RetTy = $2.PAT->get();
2890 if (!RetTy->isFirstClassType() && RetTy != Type::VoidTy)
2891 error("LLVM functions cannot return aggregate types");
2894 FTySign.makeComposite($2.S);
2895 std::vector<const Type*> ParamTyList;
2897 // In LLVM 2.0 the signatures of three varargs intrinsics changed to take
2898 // i8*. We check here for those names and override the parameter list
2899 // types to ensure the prototype is correct.
2900 if (FunctionName == "llvm.va_start" || FunctionName == "llvm.va_end") {
2901 ParamTyList.push_back(PointerType::get(Type::Int8Ty));
2902 } else if (FunctionName == "llvm.va_copy") {
2903 ParamTyList.push_back(PointerType::get(Type::Int8Ty));
2904 ParamTyList.push_back(PointerType::get(Type::Int8Ty));
2905 } else if ($5) { // If there are arguments...
2906 for (std::vector<std::pair<PATypeInfo,char*> >::iterator
2907 I = $5->begin(), E = $5->end(); I != E; ++I) {
2908 const Type *Ty = I->first.PAT->get();
2909 ParamTyList.push_back(Ty);
2910 FTySign.add(I->first.S);
2914 bool isVarArg = ParamTyList.size() && ParamTyList.back() == Type::VoidTy;
2916 ParamTyList.pop_back();
2918 // Convert the CSRet calling convention into the corresponding parameter
2920 ParamAttrsList *PAL = 0;
2921 if ($1 == OldCallingConv::CSRet) {
2922 ParamAttrsVector Attrs;
2923 ParamAttrsWithIndex PAWI;
2924 PAWI.index = 1; PAWI.attrs = ParamAttr::StructRet; // first arg
2925 Attrs.push_back(PAWI);
2926 PAL = ParamAttrsList::get(Attrs);
2929 const FunctionType *FT =
2930 FunctionType::get(RetTy, ParamTyList, isVarArg, PAL);
2931 const PointerType *PFT = PointerType::get(FT);
2935 if (!FunctionName.empty()) {
2936 ID = ValID::create((char*)FunctionName.c_str());
2938 ID = ValID::create((int)CurModule.Values[PFT].size());
2940 ID.S.makeComposite(FTySign);
2943 Module* M = CurModule.CurrentModule;
2945 // See if this function was forward referenced. If so, recycle the object.
2946 if (GlobalValue *FWRef = CurModule.GetForwardRefForGlobal(PFT, ID)) {
2947 // Move the function to the end of the list, from whereever it was
2948 // previously inserted.
2949 Fn = cast<Function>(FWRef);
2950 M->getFunctionList().remove(Fn);
2951 M->getFunctionList().push_back(Fn);
2952 } else if (!FunctionName.empty()) {
2953 GlobalValue *Conflict = M->getFunction(FunctionName);
2955 Conflict = M->getNamedGlobal(FunctionName);
2956 if (Conflict && PFT == Conflict->getType()) {
2957 if (!CurFun.isDeclare && !Conflict->isDeclaration()) {
2958 // We have two function definitions that conflict, same type, same
2959 // name. We should really check to make sure that this is the result
2960 // of integer type planes collapsing and generate an error if it is
2961 // not, but we'll just rename on the assumption that it is. However,
2962 // let's do it intelligently and rename the internal linkage one
2964 std::string NewName(makeNameUnique(FunctionName));
2965 if (Conflict->hasInternalLinkage()) {
2966 Conflict->setName(NewName);
2968 makeRenameMapKey(FunctionName, Conflict->getType(), ID.S);
2969 CurModule.RenameMap[Key] = NewName;
2970 Fn = new Function(FT, CurFun.Linkage, FunctionName, M);
2971 InsertValue(Fn, CurModule.Values);
2973 Fn = new Function(FT, CurFun.Linkage, NewName, M);
2974 InsertValue(Fn, CurModule.Values);
2976 makeRenameMapKey(FunctionName, PFT, ID.S);
2977 CurModule.RenameMap[Key] = NewName;
2980 // If they are not both definitions, then just use the function we
2981 // found since the types are the same.
2982 Fn = cast<Function>(Conflict);
2984 // Make sure to strip off any argument names so we can't get
2986 if (Fn->isDeclaration())
2987 for (Function::arg_iterator AI = Fn->arg_begin(),
2988 AE = Fn->arg_end(); AI != AE; ++AI)
2991 } else if (Conflict) {
2992 // We have two globals with the same name and different types.
2993 // Previously, this was permitted because the symbol table had
2994 // "type planes" and names only needed to be distinct within a
2995 // type plane. After PR411 was fixed, this is no loner the case.
2996 // To resolve this we must rename one of the two.
2997 if (Conflict->hasInternalLinkage()) {
2998 // We can safely rename the Conflict.
3000 makeRenameMapKey(Conflict->getName(), Conflict->getType(),
3001 CurModule.NamedValueSigns[Conflict->getName()]);
3002 Conflict->setName(makeNameUnique(Conflict->getName()));
3003 CurModule.RenameMap[Key] = Conflict->getName();
3004 Fn = new Function(FT, CurFun.Linkage, FunctionName, M);
3005 InsertValue(Fn, CurModule.Values);
3007 // We can't quietly rename either of these things, but we must
3008 // rename one of them. Only if the function's linkage is internal can
3009 // we forgo a warning message about the renamed function.
3010 std::string NewName = makeNameUnique(FunctionName);
3011 if (CurFun.Linkage != GlobalValue::InternalLinkage) {
3012 warning("Renaming function '" + FunctionName + "' as '" + NewName +
3013 "' may cause linkage errors");
3015 // Elect to rename the thing we're now defining.
3016 Fn = new Function(FT, CurFun.Linkage, NewName, M);
3017 InsertValue(Fn, CurModule.Values);
3018 RenameMapKey Key = makeRenameMapKey(FunctionName, PFT, ID.S);
3019 CurModule.RenameMap[Key] = NewName;
3022 // There's no conflict, just define the function
3023 Fn = new Function(FT, CurFun.Linkage, FunctionName, M);
3024 InsertValue(Fn, CurModule.Values);
3027 // There's no conflict, just define the function
3028 Fn = new Function(FT, CurFun.Linkage, FunctionName, M);
3029 InsertValue(Fn, CurModule.Values);
3033 CurFun.FunctionStart(Fn);
3035 if (CurFun.isDeclare) {
3036 // If we have declaration, always overwrite linkage. This will allow us
3037 // to correctly handle cases, when pointer to function is passed as
3038 // argument to another function.
3039 Fn->setLinkage(CurFun.Linkage);
3041 Fn->setCallingConv(upgradeCallingConv($1));
3042 Fn->setAlignment($8);
3048 // Add all of the arguments we parsed to the function...
3049 if ($5) { // Is null if empty...
3050 if (isVarArg) { // Nuke the last entry
3051 assert($5->back().first.PAT->get() == Type::VoidTy &&
3052 $5->back().second == 0 && "Not a varargs marker");
3053 delete $5->back().first.PAT;
3054 $5->pop_back(); // Delete the last entry
3056 Function::arg_iterator ArgIt = Fn->arg_begin();
3057 Function::arg_iterator ArgEnd = Fn->arg_end();
3058 std::vector<std::pair<PATypeInfo,char*> >::iterator I = $5->begin();
3059 std::vector<std::pair<PATypeInfo,char*> >::iterator E = $5->end();
3060 for ( ; I != E && ArgIt != ArgEnd; ++I, ++ArgIt) {
3061 delete I->first.PAT; // Delete the typeholder...
3062 ValueInfo VI; VI.V = ArgIt; VI.S.copy(I->first.S);
3063 setValueName(VI, I->second); // Insert arg into symtab...
3066 delete $5; // We're now done with the argument list
3068 lastCallingConv = OldCallingConv::C;
3073 : BEGINTOK | '{' // Allow BEGIN or '{' to start a function
3077 : OptLinkage { CurFun.Linkage = $1; } FunctionHeaderH BEGIN {
3078 $$ = CurFun.CurrentFunction;
3080 // Make sure that we keep track of the linkage type even if there was a
3081 // previous "declare".
3087 : ENDTOK | '}' // Allow end of '}' to end a function
3091 : BasicBlockList END {
3096 : /*default*/ { $$ = GlobalValue::ExternalLinkage; }
3097 | DLLIMPORT { $$ = GlobalValue::DLLImportLinkage; }
3098 | EXTERN_WEAK { $$ = GlobalValue::ExternalWeakLinkage; }
3102 : DECLARE { CurFun.isDeclare = true; }
3103 FnDeclareLinkage { CurFun.Linkage = $3; } FunctionHeaderH {
3104 $$ = CurFun.CurrentFunction;
3105 CurFun.FunctionDone();
3110 //===----------------------------------------------------------------------===//
3111 // Rules to match Basic Blocks
3112 //===----------------------------------------------------------------------===//
3115 : /* empty */ { $$ = false; }
3116 | SIDEEFFECT { $$ = true; }
3120 // A reference to a direct constant
3121 : ESINT64VAL { $$ = ValID::create($1); }
3122 | EUINT64VAL { $$ = ValID::create($1); }
3123 | FPVAL { $$ = ValID::create($1); }
3125 $$ = ValID::create(ConstantInt::get(Type::Int1Ty, true));
3126 $$.S.makeUnsigned();
3129 $$ = ValID::create(ConstantInt::get(Type::Int1Ty, false));
3130 $$.S.makeUnsigned();
3132 | NULL_TOK { $$ = ValID::createNull(); }
3133 | UNDEF { $$ = ValID::createUndef(); }
3134 | ZEROINITIALIZER { $$ = ValID::createZeroInit(); }
3135 | '<' ConstVector '>' { // Nonempty unsized packed vector
3136 const Type *ETy = (*$2)[0].C->getType();
3137 int NumElements = $2->size();
3138 VectorType* pt = VectorType::get(ETy, NumElements);
3139 $$.S.makeComposite((*$2)[0].S);
3140 PATypeHolder* PTy = new PATypeHolder(HandleUpRefs(pt, $$.S));
3142 // Verify all elements are correct type!
3143 std::vector<Constant*> Elems;
3144 for (unsigned i = 0; i < $2->size(); i++) {
3145 Constant *C = (*$2)[i].C;
3146 const Type *CTy = C->getType();
3148 error("Element #" + utostr(i) + " is not of type '" +
3149 ETy->getDescription() +"' as required!\nIt is of type '" +
3150 CTy->getDescription() + "'");
3153 $$ = ValID::create(ConstantVector::get(pt, Elems));
3154 delete PTy; delete $2;
3157 $$ = ValID::create($1.C);
3160 | ASM_TOK OptSideEffect STRINGCONSTANT ',' STRINGCONSTANT {
3161 char *End = UnEscapeLexed($3, true);
3162 std::string AsmStr = std::string($3, End);
3163 End = UnEscapeLexed($5, true);
3164 std::string Constraints = std::string($5, End);
3165 $$ = ValID::createInlineAsm(AsmStr, Constraints, $2);
3171 // SymbolicValueRef - Reference to one of two ways of symbolically refering to // another value.
3174 : INTVAL { $$ = ValID::create($1); $$.S.makeSignless(); }
3175 | Name { $$ = ValID::create($1); $$.S.makeSignless(); }
3178 // ValueRef - A reference to a definition... either constant or symbolic
3180 : SymbolicValueRef | ConstValueRef
3184 // ResolvedVal - a <type> <value> pair. This is used only in cases where the
3185 // type immediately preceeds the value reference, and allows complex constant
3186 // pool references (for things like: 'ret [2 x int] [ int 12, int 42]')
3189 const Type *Ty = $1.PAT->get();
3191 $$.V = getVal(Ty, $2);
3198 : BasicBlockList BasicBlock {
3201 | FunctionHeader BasicBlock { // Do not allow functions with 0 basic blocks
3206 // Basic blocks are terminated by branching instructions:
3207 // br, br/cc, switch, ret
3210 : InstructionList OptAssign BBTerminatorInst {
3211 ValueInfo VI; VI.V = $3.TI; VI.S.copy($3.S);
3212 setValueName(VI, $2);
3214 $1->getInstList().push_back($3.TI);
3221 : InstructionList Inst {
3223 $1->getInstList().push_back($2.I);
3227 $$ = CurBB = getBBVal(ValID::create((int)CurFun.NextBBNum++),true);
3228 // Make sure to move the basic block to the correct location in the
3229 // function, instead of leaving it inserted wherever it was first
3231 Function::BasicBlockListType &BBL =
3232 CurFun.CurrentFunction->getBasicBlockList();
3233 BBL.splice(BBL.end(), BBL, $$);
3236 $$ = CurBB = getBBVal(ValID::create($1), true);
3237 // Make sure to move the basic block to the correct location in the
3238 // function, instead of leaving it inserted wherever it was first
3240 Function::BasicBlockListType &BBL =
3241 CurFun.CurrentFunction->getBasicBlockList();
3242 BBL.splice(BBL.end(), BBL, $$);
3246 Unwind : UNWIND | EXCEPT;
3249 : RET ResolvedVal { // Return with a result...
3250 $$.TI = new ReturnInst($2.V);
3251 $$.S.makeSignless();
3253 | RET VOID { // Return with no result...
3254 $$.TI = new ReturnInst();
3255 $$.S.makeSignless();
3257 | BR LABEL ValueRef { // Unconditional Branch...
3258 BasicBlock* tmpBB = getBBVal($3);
3259 $$.TI = new BranchInst(tmpBB);
3260 $$.S.makeSignless();
3261 } // Conditional Branch...
3262 | BR BOOL ValueRef ',' LABEL ValueRef ',' LABEL ValueRef {
3263 $6.S.makeSignless();
3264 $9.S.makeSignless();
3265 BasicBlock* tmpBBA = getBBVal($6);
3266 BasicBlock* tmpBBB = getBBVal($9);
3267 $3.S.makeUnsigned();
3268 Value* tmpVal = getVal(Type::Int1Ty, $3);
3269 $$.TI = new BranchInst(tmpBBA, tmpBBB, tmpVal);
3270 $$.S.makeSignless();
3272 | SWITCH IntType ValueRef ',' LABEL ValueRef '[' JumpTable ']' {
3274 Value* tmpVal = getVal($2.T, $3);
3275 $6.S.makeSignless();
3276 BasicBlock* tmpBB = getBBVal($6);
3277 SwitchInst *S = new SwitchInst(tmpVal, tmpBB, $8->size());
3279 $$.S.makeSignless();
3280 std::vector<std::pair<Constant*,BasicBlock*> >::iterator I = $8->begin(),
3282 for (; I != E; ++I) {
3283 if (ConstantInt *CI = dyn_cast<ConstantInt>(I->first))
3284 S->addCase(CI, I->second);
3286 error("Switch case is constant, but not a simple integer");
3290 | SWITCH IntType ValueRef ',' LABEL ValueRef '[' ']' {
3292 Value* tmpVal = getVal($2.T, $3);
3293 $6.S.makeSignless();
3294 BasicBlock* tmpBB = getBBVal($6);
3295 SwitchInst *S = new SwitchInst(tmpVal, tmpBB, 0);
3297 $$.S.makeSignless();
3299 | INVOKE OptCallingConv TypesV ValueRef '(' ValueRefListE ')'
3300 TO LABEL ValueRef Unwind LABEL ValueRef {
3301 const PointerType *PFTy;
3302 const FunctionType *Ty;
3305 if (!(PFTy = dyn_cast<PointerType>($3.PAT->get())) ||
3306 !(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) {
3307 // Pull out the types of all of the arguments...
3308 std::vector<const Type*> ParamTypes;
3309 FTySign.makeComposite($3.S);
3311 for (std::vector<ValueInfo>::iterator I = $6->begin(), E = $6->end();
3313 ParamTypes.push_back((*I).V->getType());
3317 ParamAttrsList *PAL = 0;
3318 if ($2 == OldCallingConv::CSRet) {
3319 ParamAttrsVector Attrs;
3320 ParamAttrsWithIndex PAWI;
3321 PAWI.index = 1; PAWI.attrs = ParamAttr::StructRet; // first arg
3322 Attrs.push_back(PAWI);
3323 PAL = ParamAttrsList::get(Attrs);
3325 bool isVarArg = ParamTypes.size() && ParamTypes.back() == Type::VoidTy;
3326 if (isVarArg) ParamTypes.pop_back();
3327 Ty = FunctionType::get($3.PAT->get(), ParamTypes, isVarArg, PAL);
3328 PFTy = PointerType::get(Ty);
3332 // Get the signedness of the result type. $3 is the pointer to the
3333 // function type so we get the 0th element to extract the function type,
3334 // and then the 0th element again to get the result type.
3335 $$.S.copy($3.S.get(0).get(0));
3338 $4.S.makeComposite(FTySign);
3339 Value *V = getVal(PFTy, $4); // Get the function we're calling...
3340 BasicBlock *Normal = getBBVal($10);
3341 BasicBlock *Except = getBBVal($13);
3343 // Create the call node...
3344 if (!$6) { // Has no arguments?
3345 $$.TI = new InvokeInst(V, Normal, Except, 0, 0);
3346 } else { // Has arguments?
3347 // Loop through FunctionType's arguments and ensure they are specified
3350 FunctionType::param_iterator I = Ty->param_begin();
3351 FunctionType::param_iterator E = Ty->param_end();
3352 std::vector<ValueInfo>::iterator ArgI = $6->begin(), ArgE = $6->end();
3354 std::vector<Value*> Args;
3355 for (; ArgI != ArgE && I != E; ++ArgI, ++I) {
3356 if ((*ArgI).V->getType() != *I)
3357 error("Parameter " +(*ArgI).V->getName()+ " is not of type '" +
3358 (*I)->getDescription() + "'");
3359 Args.push_back((*ArgI).V);
3362 if (I != E || (ArgI != ArgE && !Ty->isVarArg()))
3363 error("Invalid number of parameters detected");
3365 $$.TI = new InvokeInst(V, Normal, Except, &Args[0], Args.size());
3367 cast<InvokeInst>($$.TI)->setCallingConv(upgradeCallingConv($2));
3370 lastCallingConv = OldCallingConv::C;
3373 $$.TI = new UnwindInst();
3374 $$.S.makeSignless();
3377 $$.TI = new UnreachableInst();
3378 $$.S.makeSignless();
3383 : JumpTable IntType ConstValueRef ',' LABEL ValueRef {
3386 Constant *V = cast<Constant>(getExistingValue($2.T, $3));
3389 error("May only switch on a constant pool value");
3391 $6.S.makeSignless();
3392 BasicBlock* tmpBB = getBBVal($6);
3393 $$->push_back(std::make_pair(V, tmpBB));
3395 | IntType ConstValueRef ',' LABEL ValueRef {
3396 $$ = new std::vector<std::pair<Constant*, BasicBlock*> >();
3398 Constant *V = cast<Constant>(getExistingValue($1.T, $2));
3401 error("May only switch on a constant pool value");
3403 $5.S.makeSignless();
3404 BasicBlock* tmpBB = getBBVal($5);
3405 $$->push_back(std::make_pair(V, tmpBB));
3410 : OptAssign InstVal {
3413 if (BitCastInst *BCI = dyn_cast<BitCastInst>($2.I))
3414 if (BCI->getSrcTy() == BCI->getDestTy() &&
3415 BCI->getOperand(0)->getName() == $1)
3416 // This is a useless bit cast causing a name redefinition. It is
3417 // a bit cast from a type to the same type of an operand with the
3418 // same name as the name we would give this instruction. Since this
3419 // instruction results in no code generation, it is safe to omit
3420 // the instruction. This situation can occur because of collapsed
3421 // type planes. For example:
3422 // %X = add int %Y, %Z
3423 // %X = cast int %Y to uint
3424 // After upgrade, this looks like:
3425 // %X = add i32 %Y, %Z
3426 // %X = bitcast i32 to i32
3427 // The bitcast is clearly useless so we omit it.
3431 $$.S.makeSignless();
3433 ValueInfo VI; VI.V = $2.I; VI.S.copy($2.S);
3434 setValueName(VI, $1);
3440 PHIList : Types '[' ValueRef ',' ValueRef ']' { // Used for PHI nodes
3441 $$.P = new std::list<std::pair<Value*, BasicBlock*> >();
3444 Value* tmpVal = getVal($1.PAT->get(), $3);
3445 $5.S.makeSignless();
3446 BasicBlock* tmpBB = getBBVal($5);
3447 $$.P->push_back(std::make_pair(tmpVal, tmpBB));
3450 | PHIList ',' '[' ValueRef ',' ValueRef ']' {
3453 Value* tmpVal = getVal($1.P->front().first->getType(), $4);
3454 $6.S.makeSignless();
3455 BasicBlock* tmpBB = getBBVal($6);
3456 $1.P->push_back(std::make_pair(tmpVal, tmpBB));
3460 ValueRefList : ResolvedVal { // Used for call statements, and memory insts...
3461 $$ = new std::vector<ValueInfo>();
3464 | ValueRefList ',' ResolvedVal {
3469 // ValueRefListE - Just like ValueRefList, except that it may also be empty!
3472 | /*empty*/ { $$ = 0; }
3485 : ArithmeticOps Types ValueRef ',' ValueRef {
3488 const Type* Ty = $2.PAT->get();
3489 if (!Ty->isInteger() && !Ty->isFloatingPoint() && !isa<VectorType>(Ty))
3490 error("Arithmetic operator requires integer, FP, or packed operands");
3491 if (isa<VectorType>(Ty) &&
3492 ($1 == URemOp || $1 == SRemOp || $1 == FRemOp || $1 == RemOp))
3493 error("Remainder not supported on vector types");
3494 // Upgrade the opcode from obsolete versions before we do anything with it.
3495 Instruction::BinaryOps Opcode = getBinaryOp($1, Ty, $2.S);
3496 Value* val1 = getVal(Ty, $3);
3497 Value* val2 = getVal(Ty, $5);
3498 $$.I = BinaryOperator::create(Opcode, val1, val2);
3500 error("binary operator returned null");
3504 | LogicalOps Types ValueRef ',' ValueRef {
3507 const Type *Ty = $2.PAT->get();
3508 if (!Ty->isInteger()) {
3509 if (!isa<VectorType>(Ty) ||
3510 !cast<VectorType>(Ty)->getElementType()->isInteger())
3511 error("Logical operator requires integral operands");
3513 Instruction::BinaryOps Opcode = getBinaryOp($1, Ty, $2.S);
3514 Value* tmpVal1 = getVal(Ty, $3);
3515 Value* tmpVal2 = getVal(Ty, $5);
3516 $$.I = BinaryOperator::create(Opcode, tmpVal1, tmpVal2);
3518 error("binary operator returned null");
3522 | SetCondOps Types ValueRef ',' ValueRef {
3525 const Type* Ty = $2.PAT->get();
3526 if(isa<VectorType>(Ty))
3527 error("VectorTypes currently not supported in setcc instructions");
3528 unsigned short pred;
3529 Instruction::OtherOps Opcode = getCompareOp($1, pred, Ty, $2.S);
3530 Value* tmpVal1 = getVal(Ty, $3);
3531 Value* tmpVal2 = getVal(Ty, $5);
3532 $$.I = CmpInst::create(Opcode, pred, tmpVal1, tmpVal2);
3534 error("binary operator returned null");
3535 $$.S.makeUnsigned();
3538 | ICMP IPredicates Types ValueRef ',' ValueRef {
3541 const Type *Ty = $3.PAT->get();
3542 if (isa<VectorType>(Ty))
3543 error("VectorTypes currently not supported in icmp instructions");
3544 else if (!Ty->isInteger() && !isa<PointerType>(Ty))
3545 error("icmp requires integer or pointer typed operands");
3546 Value* tmpVal1 = getVal(Ty, $4);
3547 Value* tmpVal2 = getVal(Ty, $6);
3548 $$.I = new ICmpInst($2, tmpVal1, tmpVal2);
3549 $$.S.makeUnsigned();
3552 | FCMP FPredicates Types ValueRef ',' ValueRef {
3555 const Type *Ty = $3.PAT->get();
3556 if (isa<VectorType>(Ty))
3557 error("VectorTypes currently not supported in fcmp instructions");
3558 else if (!Ty->isFloatingPoint())
3559 error("fcmp instruction requires floating point operands");
3560 Value* tmpVal1 = getVal(Ty, $4);
3561 Value* tmpVal2 = getVal(Ty, $6);
3562 $$.I = new FCmpInst($2, tmpVal1, tmpVal2);
3563 $$.S.makeUnsigned();
3567 warning("Use of obsolete 'not' instruction: Replacing with 'xor");
3568 const Type *Ty = $2.V->getType();
3569 Value *Ones = ConstantInt::getAllOnesValue(Ty);
3571 error("Expected integral type for not instruction");
3572 $$.I = BinaryOperator::create(Instruction::Xor, $2.V, Ones);
3574 error("Could not create a xor instruction");
3577 | ShiftOps ResolvedVal ',' ResolvedVal {
3578 if (!$4.V->getType()->isInteger() ||
3579 cast<IntegerType>($4.V->getType())->getBitWidth() != 8)
3580 error("Shift amount must be int8");
3581 const Type* Ty = $2.V->getType();
3582 if (!Ty->isInteger())
3583 error("Shift constant expression requires integer operand");
3584 Value* ShiftAmt = 0;
3585 if (cast<IntegerType>(Ty)->getBitWidth() > Type::Int8Ty->getBitWidth())
3586 if (Constant *C = dyn_cast<Constant>($4.V))
3587 ShiftAmt = ConstantExpr::getZExt(C, Ty);
3589 ShiftAmt = new ZExtInst($4.V, Ty, makeNameUnique("shift"), CurBB);
3592 $$.I = BinaryOperator::create(getBinaryOp($1, Ty, $2.S), $2.V, ShiftAmt);
3595 | CastOps ResolvedVal TO Types {
3596 const Type *DstTy = $4.PAT->get();
3597 if (!DstTy->isFirstClassType())
3598 error("cast instruction to a non-primitive type: '" +
3599 DstTy->getDescription() + "'");
3600 $$.I = cast<Instruction>(getCast($1, $2.V, $2.S, DstTy, $4.S, true));
3604 | SELECT ResolvedVal ',' ResolvedVal ',' ResolvedVal {
3605 if (!$2.V->getType()->isInteger() ||
3606 cast<IntegerType>($2.V->getType())->getBitWidth() != 1)
3607 error("select condition must be bool");
3608 if ($4.V->getType() != $6.V->getType())
3609 error("select value types should match");
3610 $$.I = new SelectInst($2.V, $4.V, $6.V);
3613 | VAARG ResolvedVal ',' Types {
3614 const Type *Ty = $4.PAT->get();
3616 $$.I = new VAArgInst($2.V, Ty);
3620 | VAARG_old ResolvedVal ',' Types {
3621 const Type* ArgTy = $2.V->getType();
3622 const Type* DstTy = $4.PAT->get();
3623 ObsoleteVarArgs = true;
3624 Function* NF = cast<Function>(CurModule.CurrentModule->
3625 getOrInsertFunction("llvm.va_copy", ArgTy, ArgTy, (Type *)0));
3628 //foo = alloca 1 of t
3632 AllocaInst* foo = new AllocaInst(ArgTy, 0, "vaarg.fix");
3633 CurBB->getInstList().push_back(foo);
3634 CallInst* bar = new CallInst(NF, $2.V);
3635 CurBB->getInstList().push_back(bar);
3636 CurBB->getInstList().push_back(new StoreInst(bar, foo));
3637 $$.I = new VAArgInst(foo, DstTy);
3641 | VANEXT_old ResolvedVal ',' Types {
3642 const Type* ArgTy = $2.V->getType();
3643 const Type* DstTy = $4.PAT->get();
3644 ObsoleteVarArgs = true;
3645 Function* NF = cast<Function>(CurModule.CurrentModule->
3646 getOrInsertFunction("llvm.va_copy", ArgTy, ArgTy, (Type *)0));
3648 //b = vanext a, t ->
3649 //foo = alloca 1 of t
3652 //tmp = vaarg foo, t
3654 AllocaInst* foo = new AllocaInst(ArgTy, 0, "vanext.fix");
3655 CurBB->getInstList().push_back(foo);
3656 CallInst* bar = new CallInst(NF, $2.V);
3657 CurBB->getInstList().push_back(bar);
3658 CurBB->getInstList().push_back(new StoreInst(bar, foo));
3659 Instruction* tmp = new VAArgInst(foo, DstTy);
3660 CurBB->getInstList().push_back(tmp);
3661 $$.I = new LoadInst(foo);
3665 | EXTRACTELEMENT ResolvedVal ',' ResolvedVal {
3666 if (!ExtractElementInst::isValidOperands($2.V, $4.V))
3667 error("Invalid extractelement operands");
3668 $$.I = new ExtractElementInst($2.V, $4.V);
3669 $$.S.copy($2.S.get(0));
3671 | INSERTELEMENT ResolvedVal ',' ResolvedVal ',' ResolvedVal {
3672 if (!InsertElementInst::isValidOperands($2.V, $4.V, $6.V))
3673 error("Invalid insertelement operands");
3674 $$.I = new InsertElementInst($2.V, $4.V, $6.V);
3677 | SHUFFLEVECTOR ResolvedVal ',' ResolvedVal ',' ResolvedVal {
3678 if (!ShuffleVectorInst::isValidOperands($2.V, $4.V, $6.V))
3679 error("Invalid shufflevector operands");
3680 $$.I = new ShuffleVectorInst($2.V, $4.V, $6.V);
3684 const Type *Ty = $2.P->front().first->getType();
3685 if (!Ty->isFirstClassType())
3686 error("PHI node operands must be of first class type");
3687 PHINode *PHI = new PHINode(Ty);
3688 PHI->reserveOperandSpace($2.P->size());
3689 while ($2.P->begin() != $2.P->end()) {
3690 if ($2.P->front().first->getType() != Ty)
3691 error("All elements of a PHI node must be of the same type");
3692 PHI->addIncoming($2.P->front().first, $2.P->front().second);
3697 delete $2.P; // Free the list...
3699 | OptTailCall OptCallingConv TypesV ValueRef '(' ValueRefListE ')' {
3700 // Handle the short call syntax
3701 const PointerType *PFTy;
3702 const FunctionType *FTy;
3704 if (!(PFTy = dyn_cast<PointerType>($3.PAT->get())) ||
3705 !(FTy = dyn_cast<FunctionType>(PFTy->getElementType()))) {
3706 // Pull out the types of all of the arguments...
3707 std::vector<const Type*> ParamTypes;
3708 FTySign.makeComposite($3.S);
3710 for (std::vector<ValueInfo>::iterator I = $6->begin(), E = $6->end();
3712 ParamTypes.push_back((*I).V->getType());
3717 bool isVarArg = ParamTypes.size() && ParamTypes.back() == Type::VoidTy;
3718 if (isVarArg) ParamTypes.pop_back();
3720 const Type *RetTy = $3.PAT->get();
3721 if (!RetTy->isFirstClassType() && RetTy != Type::VoidTy)
3722 error("Functions cannot return aggregate types");
3724 // Deal with CSRetCC
3725 ParamAttrsList *PAL = 0;
3726 if ($2 == OldCallingConv::CSRet) {
3727 ParamAttrsVector Attrs;
3728 ParamAttrsWithIndex PAWI;
3729 PAWI.index = 1; PAWI.attrs = ParamAttr::StructRet; // first arg
3730 Attrs.push_back(PAWI);
3731 PAL = ParamAttrsList::get(Attrs);
3734 FTy = FunctionType::get(RetTy, ParamTypes, isVarArg, PAL);
3735 PFTy = PointerType::get(FTy);
3739 // Get the signedness of the result type. $3 is the pointer to the
3740 // function type so we get the 0th element to extract the function type,
3741 // and then the 0th element again to get the result type.
3742 $$.S.copy($3.S.get(0).get(0));
3744 $4.S.makeComposite(FTySign);
3746 // First upgrade any intrinsic calls.
3747 std::vector<Value*> Args;
3749 for (unsigned i = 0, e = $6->size(); i < e; ++i)
3750 Args.push_back((*$6)[i].V);
3751 Instruction *Inst = upgradeIntrinsicCall(FTy->getReturnType(), $4, Args);
3753 // If we got an upgraded intrinsic
3757 // Get the function we're calling
3758 Value *V = getVal(PFTy, $4);
3760 // Check the argument values match
3761 if (!$6) { // Has no arguments?
3762 // Make sure no arguments is a good thing!
3763 if (FTy->getNumParams() != 0)
3764 error("No arguments passed to a function that expects arguments");
3765 } else { // Has arguments?
3766 // Loop through FunctionType's arguments and ensure they are specified
3769 FunctionType::param_iterator I = FTy->param_begin();
3770 FunctionType::param_iterator E = FTy->param_end();
3771 std::vector<ValueInfo>::iterator ArgI = $6->begin(), ArgE = $6->end();
3773 for (; ArgI != ArgE && I != E; ++ArgI, ++I)
3774 if ((*ArgI).V->getType() != *I)
3775 error("Parameter " +(*ArgI).V->getName()+ " is not of type '" +
3776 (*I)->getDescription() + "'");
3778 if (I != E || (ArgI != ArgE && !FTy->isVarArg()))
3779 error("Invalid number of parameters detected");
3782 // Create the call instruction
3783 CallInst *CI = new CallInst(V, Args.begin(), Args.end());
3784 CI->setTailCall($1);
3785 CI->setCallingConv(upgradeCallingConv($2));
3790 lastCallingConv = OldCallingConv::C;
3798 // IndexList - List of indices for GEP based instructions...
3800 : ',' ValueRefList { $$ = $2; }
3801 | /* empty */ { $$ = new std::vector<ValueInfo>(); }
3805 : VOLATILE { $$ = true; }
3806 | /* empty */ { $$ = false; }
3810 : MALLOC Types OptCAlign {
3811 const Type *Ty = $2.PAT->get();
3812 $$.S.makeComposite($2.S);
3813 $$.I = new MallocInst(Ty, 0, $3);
3816 | MALLOC Types ',' UINT ValueRef OptCAlign {
3817 const Type *Ty = $2.PAT->get();
3818 $5.S.makeUnsigned();
3819 $$.S.makeComposite($2.S);
3820 $$.I = new MallocInst(Ty, getVal($4.T, $5), $6);
3823 | ALLOCA Types OptCAlign {
3824 const Type *Ty = $2.PAT->get();
3825 $$.S.makeComposite($2.S);
3826 $$.I = new AllocaInst(Ty, 0, $3);
3829 | ALLOCA Types ',' UINT ValueRef OptCAlign {
3830 const Type *Ty = $2.PAT->get();
3831 $5.S.makeUnsigned();
3832 $$.S.makeComposite($4.S);
3833 $$.I = new AllocaInst(Ty, getVal($4.T, $5), $6);
3836 | FREE ResolvedVal {
3837 const Type *PTy = $2.V->getType();
3838 if (!isa<PointerType>(PTy))
3839 error("Trying to free nonpointer type '" + PTy->getDescription() + "'");
3840 $$.I = new FreeInst($2.V);
3841 $$.S.makeSignless();
3843 | OptVolatile LOAD Types ValueRef {
3844 const Type* Ty = $3.PAT->get();
3846 if (!isa<PointerType>(Ty))
3847 error("Can't load from nonpointer type: " + Ty->getDescription());
3848 if (!cast<PointerType>(Ty)->getElementType()->isFirstClassType())
3849 error("Can't load from pointer of non-first-class type: " +
3850 Ty->getDescription());
3851 Value* tmpVal = getVal(Ty, $4);
3852 $$.I = new LoadInst(tmpVal, "", $1);
3853 $$.S.copy($3.S.get(0));
3856 | OptVolatile STORE ResolvedVal ',' Types ValueRef {
3858 const PointerType *PTy = dyn_cast<PointerType>($5.PAT->get());
3860 error("Can't store to a nonpointer type: " +
3861 $5.PAT->get()->getDescription());
3862 const Type *ElTy = PTy->getElementType();
3863 Value *StoreVal = $3.V;
3864 Value* tmpVal = getVal(PTy, $6);
3865 if (ElTy != $3.V->getType()) {
3866 StoreVal = handleSRetFuncTypeMerge($3.V, ElTy);
3868 error("Can't store '" + $3.V->getType()->getDescription() +
3869 "' into space of type '" + ElTy->getDescription() + "'");
3871 PTy = PointerType::get(StoreVal->getType());
3872 if (Constant *C = dyn_cast<Constant>(tmpVal))
3873 tmpVal = ConstantExpr::getBitCast(C, PTy);
3875 tmpVal = new BitCastInst(tmpVal, PTy, "upgrd.cast", CurBB);
3878 $$.I = new StoreInst(StoreVal, tmpVal, $1);
3879 $$.S.makeSignless();
3882 | GETELEMENTPTR Types ValueRef IndexList {
3884 const Type* Ty = $2.PAT->get();
3885 if (!isa<PointerType>(Ty))
3886 error("getelementptr insn requires pointer operand");
3888 std::vector<Value*> VIndices;
3889 upgradeGEPInstIndices(Ty, $4, VIndices);
3891 Value* tmpVal = getVal(Ty, $3);
3892 $$.I = new GetElementPtrInst(tmpVal, &VIndices[0], VIndices.size());
3893 ValueInfo VI; VI.V = tmpVal; VI.S.copy($2.S);
3894 $$.S.copy(getElementSign(VI, VIndices));
3902 int yyerror(const char *ErrorMsg) {
3904 = std::string((CurFilename == "-") ? std::string("<stdin>") : CurFilename)
3905 + ":" + llvm::utostr((unsigned) Upgradelineno) + ": ";
3906 std::string errMsg = where + "error: " + std::string(ErrorMsg);
3907 if (yychar != YYEMPTY && yychar != 0)
3908 errMsg += " while reading token '" + std::string(Upgradetext, Upgradeleng) +
3910 std::cerr << "llvm-upgrade: " << errMsg << '\n';
3911 std::cout << "llvm-upgrade: parse failed.\n";
3915 void warning(const std::string& ErrorMsg) {
3917 = std::string((CurFilename == "-") ? std::string("<stdin>") : CurFilename)
3918 + ":" + llvm::utostr((unsigned) Upgradelineno) + ": ";
3919 std::string errMsg = where + "warning: " + std::string(ErrorMsg);
3920 if (yychar != YYEMPTY && yychar != 0)
3921 errMsg += " while reading token '" + std::string(Upgradetext, Upgradeleng) +
3923 std::cerr << "llvm-upgrade: " << errMsg << '\n';
3926 void error(const std::string& ErrorMsg, int LineNo) {
3927 if (LineNo == -1) LineNo = Upgradelineno;
3928 Upgradelineno = LineNo;
3929 yyerror(ErrorMsg.c_str());