[llvm-commits] CVS: llvm/lib/AsmParser/llvmAsmParser.cpp.cvs llvmAsmParser.h.cvs llvmAsmParser.y.cvs Lexer.cpp.cvs llvmAsmParser.cpp llvmAsmParser.h
Chris Lattner
lattner at cs.uiuc.edu
Tue Feb 14 23:23:10 PST 2006
Changes in directory llvm/lib/AsmParser:
llvmAsmParser.cpp.cvs added (r1.1)
llvmAsmParser.h.cvs added (r1.1)
llvmAsmParser.y.cvs added (r1.1)
Lexer.cpp.cvs updated: 1.2 -> 1.3
llvmAsmParser.cpp (r1.35) removed
llvmAsmParser.h (r1.19) removed
---
Log message:
Convert this over to work with the new makefiles
---
Diffs of the changes: (+6826 -1)
Lexer.cpp.cvs | 2
llvmAsmParser.cpp.cvs | 4249 ++++++++++++++++++++++++++++++++++++++++++++++++++
llvmAsmParser.h.cvs | 140 +
llvmAsmParser.y.cvs | 2436 ++++++++++++++++++++++++++++
4 files changed, 6826 insertions(+), 1 deletion(-)
Index: llvm/lib/AsmParser/llvmAsmParser.cpp.cvs
diff -c /dev/null llvm/lib/AsmParser/llvmAsmParser.cpp.cvs:1.1
*** /dev/null Wed Feb 15 01:23:08 2006
--- llvm/lib/AsmParser/llvmAsmParser.cpp.cvs Wed Feb 15 01:22:58 2006
***************
*** 0 ****
--- 1,4249 ----
+
+ /* A Bison parser, made from /Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y
+ by GNU Bison version 1.28 */
+
+ #define YYBISON 1 /* Identify Bison output. */
+
+ #define yyparse llvmAsmparse
+ #define yylex llvmAsmlex
+ #define yyerror llvmAsmerror
+ #define yylval llvmAsmlval
+ #define yychar llvmAsmchar
+ #define yydebug llvmAsmdebug
+ #define yynerrs llvmAsmnerrs
+ #define ESINT64VAL 257
+ #define EUINT64VAL 258
+ #define SINTVAL 259
+ #define UINTVAL 260
+ #define FPVAL 261
+ #define VOID 262
+ #define BOOL 263
+ #define SBYTE 264
+ #define UBYTE 265
+ #define SHORT 266
+ #define USHORT 267
+ #define INT 268
+ #define UINT 269
+ #define LONG 270
+ #define ULONG 271
+ #define FLOAT 272
+ #define DOUBLE 273
+ #define TYPE 274
+ #define LABEL 275
+ #define VAR_ID 276
+ #define LABELSTR 277
+ #define STRINGCONSTANT 278
+ #define IMPLEMENTATION 279
+ #define ZEROINITIALIZER 280
+ #define TRUETOK 281
+ #define FALSETOK 282
+ #define BEGINTOK 283
+ #define ENDTOK 284
+ #define DECLARE 285
+ #define GLOBAL 286
+ #define CONSTANT 287
+ #define SECTION 288
+ #define VOLATILE 289
+ #define TO 290
+ #define DOTDOTDOT 291
+ #define NULL_TOK 292
+ #define UNDEF 293
+ #define CONST 294
+ #define INTERNAL 295
+ #define LINKONCE 296
+ #define WEAK 297
+ #define APPENDING 298
+ #define OPAQUE 299
+ #define NOT 300
+ #define EXTERNAL 301
+ #define TARGET 302
+ #define TRIPLE 303
+ #define ENDIAN 304
+ #define POINTERSIZE 305
+ #define LITTLE 306
+ #define BIG 307
+ #define ALIGN 308
+ #define DEPLIBS 309
+ #define CALL 310
+ #define TAIL 311
+ #define ASM_TOK 312
+ #define MODULE 313
+ #define SIDEEFFECT 314
+ #define CC_TOK 315
+ #define CCC_TOK 316
+ #define FASTCC_TOK 317
+ #define COLDCC_TOK 318
+ #define RET 319
+ #define BR 320
+ #define SWITCH 321
+ #define INVOKE 322
+ #define UNWIND 323
+ #define UNREACHABLE 324
+ #define ADD 325
+ #define SUB 326
+ #define MUL 327
+ #define DIV 328
+ #define REM 329
+ #define AND 330
+ #define OR 331
+ #define XOR 332
+ #define SETLE 333
+ #define SETGE 334
+ #define SETLT 335
+ #define SETGT 336
+ #define SETEQ 337
+ #define SETNE 338
+ #define MALLOC 339
+ #define ALLOCA 340
+ #define FREE 341
+ #define LOAD 342
+ #define STORE 343
+ #define GETELEMENTPTR 344
+ #define PHI_TOK 345
+ #define CAST 346
+ #define SELECT 347
+ #define SHL 348
+ #define SHR 349
+ #define VAARG 350
+ #define EXTRACTELEMENT 351
+ #define INSERTELEMENT 352
+ #define VAARG_old 353
+ #define VANEXT_old 354
+
+ #line 14 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+
+ #include "ParserInternals.h"
+ #include "llvm/CallingConv.h"
+ #include "llvm/InlineAsm.h"
+ #include "llvm/Instructions.h"
+ #include "llvm/Module.h"
+ #include "llvm/SymbolTable.h"
+ #include "llvm/Assembly/AutoUpgrade.h"
+ #include "llvm/Support/GetElementPtrTypeIterator.h"
+ #include "llvm/ADT/STLExtras.h"
+ #include "llvm/Support/MathExtras.h"
+ #include <algorithm>
+ #include <iostream>
+ #include <list>
+ #include <utility>
+
+ int yyerror(const char *ErrorMsg); // Forward declarations to prevent "implicit
+ int yylex(); // declaration" of xxx warnings.
+ int yyparse();
+
+ namespace llvm {
+ std::string CurFilename;
+ }
+ using namespace llvm;
+
+ static Module *ParserResult;
+
+ // DEBUG_UPREFS - Define this symbol if you want to enable debugging output
+ // relating to upreferences in the input stream.
+ //
+ //#define DEBUG_UPREFS 1
+ #ifdef DEBUG_UPREFS
+ #define UR_OUT(X) std::cerr << X
+ #else
+ #define UR_OUT(X)
+ #endif
+
+ #define YYERROR_VERBOSE 1
+
+ static bool ObsoleteVarArgs;
+ static bool NewVarArgs;
+ static BasicBlock *CurBB;
+ static GlobalVariable *CurGV;
+
+
+ // This contains info used when building the body of a function. It is
+ // destroyed when the function is completed.
+ //
+ typedef std::vector<Value *> ValueList; // Numbered defs
+ static void
+ ResolveDefinitions(std::map<const Type *,ValueList> &LateResolvers,
+ std::map<const Type *,ValueList> *FutureLateResolvers = 0);
+
+ static struct PerModuleInfo {
+ Module *CurrentModule;
+ std::map<const Type *, ValueList> Values; // Module level numbered definitions
+ std::map<const Type *,ValueList> LateResolveValues;
+ std::vector<PATypeHolder> Types;
+ std::map<ValID, PATypeHolder> LateResolveTypes;
+
+ /// PlaceHolderInfo - When temporary placeholder objects are created, remember
+ /// how they were referenced and one which line of the input they came from so
+ /// that we can resolve them later and print error messages as appropriate.
+ std::map<Value*, std::pair<ValID, int> > PlaceHolderInfo;
+
+ // GlobalRefs - This maintains a mapping between <Type, ValID>'s and forward
+ // references to global values. Global values may be referenced before they
+ // are defined, and if so, the temporary object that they represent is held
+ // here. This is used for forward references of GlobalValues.
+ //
+ typedef std::map<std::pair<const PointerType *,
+ ValID>, GlobalValue*> GlobalRefsType;
+ GlobalRefsType GlobalRefs;
+
+ void ModuleDone() {
+ // If we could not resolve some functions at function compilation time
+ // (calls to functions before they are defined), resolve them now... Types
+ // are resolved when the constant pool has been completely parsed.
+ //
+ ResolveDefinitions(LateResolveValues);
+
+ // Check to make sure that all global value forward references have been
+ // resolved!
+ //
+ if (!GlobalRefs.empty()) {
+ std::string UndefinedReferences = "Unresolved global references exist:\n";
+
+ for (GlobalRefsType::iterator I = GlobalRefs.begin(), E =GlobalRefs.end();
+ I != E; ++I) {
+ UndefinedReferences += " " + I->first.first->getDescription() + " " +
+ I->first.second.getName() + "\n";
+ }
+ ThrowException(UndefinedReferences);
+ }
+
+ // Look for intrinsic functions and CallInst that need to be upgraded
+ for (Module::iterator FI = CurrentModule->begin(),FE = CurrentModule->end();
+ FI != FE; ++FI)
+ UpgradeCallsToIntrinsic(FI);
+
+ Values.clear(); // Clear out function local definitions
+ Types.clear();
+ CurrentModule = 0;
+ }
+
+ // GetForwardRefForGlobal - Check to see if there is a forward reference
+ // for this global. If so, remove it from the GlobalRefs map and return it.
+ // If not, just return null.
+ GlobalValue *GetForwardRefForGlobal(const PointerType *PTy, ValID ID) {
+ // Check to see if there is a forward reference to this global variable...
+ // if there is, eliminate it and patch the reference to use the new def'n.
+ GlobalRefsType::iterator I = GlobalRefs.find(std::make_pair(PTy, ID));
+ GlobalValue *Ret = 0;
+ if (I != GlobalRefs.end()) {
+ Ret = I->second;
+ GlobalRefs.erase(I);
+ }
+ return Ret;
+ }
+ } CurModule;
+
+ static struct PerFunctionInfo {
+ Function *CurrentFunction; // Pointer to current function being created
+
+ std::map<const Type*, ValueList> Values; // Keep track of #'d definitions
+ std::map<const Type*, ValueList> LateResolveValues;
+ bool isDeclare; // Is this function a forward declararation?
+
+ /// BBForwardRefs - When we see forward references to basic blocks, keep
+ /// track of them here.
+ std::map<BasicBlock*, std::pair<ValID, int> > BBForwardRefs;
+ std::vector<BasicBlock*> NumberedBlocks;
+ unsigned NextBBNum;
+
+ inline PerFunctionInfo() {
+ CurrentFunction = 0;
+ isDeclare = false;
+ }
+
+ inline void FunctionStart(Function *M) {
+ CurrentFunction = M;
+ NextBBNum = 0;
+ }
+
+ void FunctionDone() {
+ NumberedBlocks.clear();
+
+ // Any forward referenced blocks left?
+ if (!BBForwardRefs.empty())
+ ThrowException("Undefined reference to label " +
+ BBForwardRefs.begin()->first->getName());
+
+ // Resolve all forward references now.
+ ResolveDefinitions(LateResolveValues, &CurModule.LateResolveValues);
+
+ Values.clear(); // Clear out function local definitions
+ CurrentFunction = 0;
+ isDeclare = false;
+ }
+ } CurFun; // Info for the current function...
+
+ static bool inFunctionScope() { return CurFun.CurrentFunction != 0; }
+
+
+ //===----------------------------------------------------------------------===//
+ // Code to handle definitions of all the types
+ //===----------------------------------------------------------------------===//
+
+ static int InsertValue(Value *V,
+ std::map<const Type*,ValueList> &ValueTab = CurFun.Values) {
+ if (V->hasName()) return -1; // Is this a numbered definition?
+
+ // Yes, insert the value into the value table...
+ ValueList &List = ValueTab[V->getType()];
+ List.push_back(V);
+ return List.size()-1;
+ }
+
+ static const Type *getTypeVal(const ValID &D, bool DoNotImprovise = false) {
+ switch (D.Type) {
+ case ValID::NumberVal: // Is it a numbered definition?
+ // Module constants occupy the lowest numbered slots...
+ if ((unsigned)D.Num < CurModule.Types.size())
+ return CurModule.Types[(unsigned)D.Num];
+ break;
+ case ValID::NameVal: // Is it a named definition?
+ if (const Type *N = CurModule.CurrentModule->getTypeByName(D.Name)) {
+ D.destroy(); // Free old strdup'd memory...
+ return N;
+ }
+ break;
+ default:
+ ThrowException("Internal parser error: Invalid symbol type reference!");
+ }
+
+ // If we reached here, we referenced either a symbol that we don't know about
+ // or an id number that hasn't been read yet. We may be referencing something
+ // forward, so just create an entry to be resolved later and get to it...
+ //
+ if (DoNotImprovise) return 0; // Do we just want a null to be returned?
+
+
+ if (inFunctionScope()) {
+ if (D.Type == ValID::NameVal)
+ ThrowException("Reference to an undefined type: '" + D.getName() + "'");
+ else
+ ThrowException("Reference to an undefined type: #" + itostr(D.Num));
+ }
+
+ std::map<ValID, PATypeHolder>::iterator I =CurModule.LateResolveTypes.find(D);
+ if (I != CurModule.LateResolveTypes.end())
+ return I->second;
+
+ Type *Typ = OpaqueType::get();
+ CurModule.LateResolveTypes.insert(std::make_pair(D, Typ));
+ return Typ;
+ }
+
+ static Value *lookupInSymbolTable(const Type *Ty, const std::string &Name) {
+ SymbolTable &SymTab =
+ inFunctionScope() ? CurFun.CurrentFunction->getSymbolTable() :
+ CurModule.CurrentModule->getSymbolTable();
+ return SymTab.lookup(Ty, Name);
+ }
+
+ // getValNonImprovising - Look up the value specified by the provided type and
+ // the provided ValID. If the value exists and has already been defined, return
+ // it. Otherwise return null.
+ //
+ static Value *getValNonImprovising(const Type *Ty, const ValID &D) {
+ if (isa<FunctionType>(Ty))
+ ThrowException("Functions are not values and "
+ "must be referenced as pointers");
+
+ switch (D.Type) {
+ case ValID::NumberVal: { // Is it a numbered definition?
+ unsigned Num = (unsigned)D.Num;
+
+ // Module constants occupy the lowest numbered slots...
+ std::map<const Type*,ValueList>::iterator VI = CurModule.Values.find(Ty);
+ if (VI != CurModule.Values.end()) {
+ if (Num < VI->second.size())
+ return VI->second[Num];
+ Num -= VI->second.size();
+ }
+
+ // Make sure that our type is within bounds
+ VI = CurFun.Values.find(Ty);
+ if (VI == CurFun.Values.end()) return 0;
+
+ // Check that the number is within bounds...
+ if (VI->second.size() <= Num) return 0;
+
+ return VI->second[Num];
+ }
+
+ case ValID::NameVal: { // Is it a named definition?
+ Value *N = lookupInSymbolTable(Ty, std::string(D.Name));
+ if (N == 0) return 0;
+
+ D.destroy(); // Free old strdup'd memory...
+ return N;
+ }
+
+ // Check to make sure that "Ty" is an integral type, and that our
+ // value will fit into the specified type...
+ case ValID::ConstSIntVal: // Is it a constant pool reference??
+ if (!ConstantSInt::isValueValidForType(Ty, D.ConstPool64))
+ ThrowException("Signed integral constant '" +
+ itostr(D.ConstPool64) + "' is invalid for type '" +
+ Ty->getDescription() + "'!");
+ return ConstantSInt::get(Ty, D.ConstPool64);
+
+ case ValID::ConstUIntVal: // Is it an unsigned const pool reference?
+ if (!ConstantUInt::isValueValidForType(Ty, D.UConstPool64)) {
+ if (!ConstantSInt::isValueValidForType(Ty, D.ConstPool64)) {
+ ThrowException("Integral constant '" + utostr(D.UConstPool64) +
+ "' is invalid or out of range!");
+ } else { // This is really a signed reference. Transmogrify.
+ return ConstantSInt::get(Ty, D.ConstPool64);
+ }
+ } else {
+ return ConstantUInt::get(Ty, D.UConstPool64);
+ }
+
+ case ValID::ConstFPVal: // Is it a floating point const pool reference?
+ if (!ConstantFP::isValueValidForType(Ty, D.ConstPoolFP))
+ ThrowException("FP constant invalid for type!!");
+ return ConstantFP::get(Ty, D.ConstPoolFP);
+
+ case ValID::ConstNullVal: // Is it a null value?
+ if (!isa<PointerType>(Ty))
+ ThrowException("Cannot create a a non pointer null!");
+ return ConstantPointerNull::get(cast<PointerType>(Ty));
+
+ case ValID::ConstUndefVal: // Is it an undef value?
+ return UndefValue::get(Ty);
+
+ case ValID::ConstZeroVal: // Is it a zero value?
+ return Constant::getNullValue(Ty);
+
+ case ValID::ConstantVal: // Fully resolved constant?
+ if (D.ConstantValue->getType() != Ty)
+ ThrowException("Constant expression type different from required type!");
+ return D.ConstantValue;
+
+ case ValID::InlineAsmVal: { // Inline asm expression
+ const PointerType *PTy = dyn_cast<PointerType>(Ty);
+ const FunctionType *FTy =
+ PTy ? dyn_cast<FunctionType>(PTy->getElementType()) : 0;
+ if (!FTy || !InlineAsm::Verify(FTy, D.IAD->Constraints))
+ ThrowException("Invalid type for asm constraint string!");
+ InlineAsm *IA = InlineAsm::get(FTy, D.IAD->AsmString, D.IAD->Constraints,
+ D.IAD->HasSideEffects);
+ D.destroy(); // Free InlineAsmDescriptor.
+ return IA;
+ }
+ default:
+ assert(0 && "Unhandled case!");
+ return 0;
+ } // End of switch
+
+ assert(0 && "Unhandled case!");
+ return 0;
+ }
+
+ // getVal - This function is identical to getValNonImprovising, except that if a
+ // value is not already defined, it "improvises" by creating a placeholder var
+ // that looks and acts just like the requested variable. When the value is
+ // defined later, all uses of the placeholder variable are replaced with the
+ // real thing.
+ //
+ static Value *getVal(const Type *Ty, const ValID &ID) {
+ if (Ty == Type::LabelTy)
+ ThrowException("Cannot use a basic block here");
+
+ // See if the value has already been defined.
+ Value *V = getValNonImprovising(Ty, ID);
+ if (V) return V;
+
+ if (!Ty->isFirstClassType() && !isa<OpaqueType>(Ty))
+ ThrowException("Invalid use of a composite type!");
+
+ // If we reached here, we referenced either a symbol that we don't know about
+ // or an id number that hasn't been read yet. We may be referencing something
+ // forward, so just create an entry to be resolved later and get to it...
+ //
+ V = new Argument(Ty);
+
+ // Remember where this forward reference came from. FIXME, shouldn't we try
+ // to recycle these things??
+ CurModule.PlaceHolderInfo.insert(std::make_pair(V, std::make_pair(ID,
+ llvmAsmlineno)));
+
+ if (inFunctionScope())
+ InsertValue(V, CurFun.LateResolveValues);
+ else
+ InsertValue(V, CurModule.LateResolveValues);
+ return V;
+ }
+
+ /// getBBVal - This is used for two purposes:
+ /// * If isDefinition is true, a new basic block with the specified ID is being
+ /// defined.
+ /// * If isDefinition is true, this is a reference to a basic block, which may
+ /// or may not be a forward reference.
+ ///
+ static BasicBlock *getBBVal(const ValID &ID, bool isDefinition = false) {
+ assert(inFunctionScope() && "Can't get basic block at global scope!");
+
+ std::string Name;
+ BasicBlock *BB = 0;
+ switch (ID.Type) {
+ default: ThrowException("Illegal label reference " + ID.getName());
+ case ValID::NumberVal: // Is it a numbered definition?
+ if (unsigned(ID.Num) >= CurFun.NumberedBlocks.size())
+ CurFun.NumberedBlocks.resize(ID.Num+1);
+ BB = CurFun.NumberedBlocks[ID.Num];
+ break;
+ case ValID::NameVal: // Is it a named definition?
+ Name = ID.Name;
+ if (Value *N = CurFun.CurrentFunction->
+ getSymbolTable().lookup(Type::LabelTy, Name))
+ BB = cast<BasicBlock>(N);
+ break;
+ }
+
+ // See if the block has already been defined.
+ if (BB) {
+ // If this is the definition of the block, make sure the existing value was
+ // just a forward reference. If it was a forward reference, there will be
+ // an entry for it in the PlaceHolderInfo map.
+ if (isDefinition && !CurFun.BBForwardRefs.erase(BB))
+ // The existing value was a definition, not a forward reference.
+ ThrowException("Redefinition of label " + ID.getName());
+
+ ID.destroy(); // Free strdup'd memory.
+ return BB;
+ }
+
+ // Otherwise this block has not been seen before.
+ BB = new BasicBlock("", CurFun.CurrentFunction);
+ if (ID.Type == ValID::NameVal) {
+ BB->setName(ID.Name);
+ } else {
+ CurFun.NumberedBlocks[ID.Num] = BB;
+ }
+
+ // If this is not a definition, keep track of it so we can use it as a forward
+ // reference.
+ if (!isDefinition) {
+ // Remember where this forward reference came from.
+ CurFun.BBForwardRefs[BB] = std::make_pair(ID, llvmAsmlineno);
+ } else {
+ // The forward declaration could have been inserted anywhere in the
+ // function: insert it into the correct place now.
+ CurFun.CurrentFunction->getBasicBlockList().remove(BB);
+ CurFun.CurrentFunction->getBasicBlockList().push_back(BB);
+ }
+ ID.destroy();
+ return BB;
+ }
+
+
+ //===----------------------------------------------------------------------===//
+ // Code to handle forward references in instructions
+ //===----------------------------------------------------------------------===//
+ //
+ // This code handles the late binding needed with statements that reference
+ // values not defined yet... for example, a forward branch, or the PHI node for
+ // a loop body.
+ //
+ // This keeps a table (CurFun.LateResolveValues) of all such forward references
+ // and back patchs after we are done.
+ //
+
+ // ResolveDefinitions - If we could not resolve some defs at parsing
+ // time (forward branches, phi functions for loops, etc...) resolve the
+ // defs now...
+ //
+ static void
+ ResolveDefinitions(std::map<const Type*,ValueList> &LateResolvers,
+ std::map<const Type*,ValueList> *FutureLateResolvers) {
+ // Loop over LateResolveDefs fixing up stuff that couldn't be resolved
+ for (std::map<const Type*,ValueList>::iterator LRI = LateResolvers.begin(),
+ E = LateResolvers.end(); LRI != E; ++LRI) {
+ ValueList &List = LRI->second;
+ while (!List.empty()) {
+ Value *V = List.back();
+ List.pop_back();
+
+ std::map<Value*, std::pair<ValID, int> >::iterator PHI =
+ CurModule.PlaceHolderInfo.find(V);
+ assert(PHI != CurModule.PlaceHolderInfo.end() && "Placeholder error!");
+
+ ValID &DID = PHI->second.first;
+
+ Value *TheRealValue = getValNonImprovising(LRI->first, DID);
+ if (TheRealValue) {
+ V->replaceAllUsesWith(TheRealValue);
+ delete V;
+ CurModule.PlaceHolderInfo.erase(PHI);
+ } else if (FutureLateResolvers) {
+ // Functions have their unresolved items forwarded to the module late
+ // resolver table
+ InsertValue(V, *FutureLateResolvers);
+ } else {
+ if (DID.Type == ValID::NameVal)
+ ThrowException("Reference to an invalid definition: '" +DID.getName()+
+ "' of type '" + V->getType()->getDescription() + "'",
+ PHI->second.second);
+ else
+ ThrowException("Reference to an invalid definition: #" +
+ itostr(DID.Num) + " of type '" +
+ V->getType()->getDescription() + "'",
+ PHI->second.second);
+ }
+ }
+ }
+
+ LateResolvers.clear();
+ }
+
+ // ResolveTypeTo - A brand new type was just declared. This means that (if
+ // name is not null) things referencing Name can be resolved. Otherwise, things
+ // refering to the number can be resolved. Do this now.
+ //
+ static void ResolveTypeTo(char *Name, const Type *ToTy) {
+ ValID D;
+ if (Name) D = ValID::create(Name);
+ else D = ValID::create((int)CurModule.Types.size());
+
+ std::map<ValID, PATypeHolder>::iterator I =
+ CurModule.LateResolveTypes.find(D);
+ if (I != CurModule.LateResolveTypes.end()) {
+ ((DerivedType*)I->second.get())->refineAbstractTypeTo(ToTy);
+ CurModule.LateResolveTypes.erase(I);
+ }
+ }
+
+ // setValueName - Set the specified value to the name given. The name may be
+ // null potentially, in which case this is a noop. The string passed in is
+ // assumed to be a malloc'd string buffer, and is free'd by this function.
+ //
+ static void setValueName(Value *V, char *NameStr) {
+ if (NameStr) {
+ std::string Name(NameStr); // Copy string
+ free(NameStr); // Free old string
+
+ if (V->getType() == Type::VoidTy)
+ ThrowException("Can't assign name '" + Name+"' to value with void type!");
+
+ assert(inFunctionScope() && "Must be in function scope!");
+ SymbolTable &ST = CurFun.CurrentFunction->getSymbolTable();
+ if (ST.lookup(V->getType(), Name))
+ ThrowException("Redefinition of value named '" + Name + "' in the '" +
+ V->getType()->getDescription() + "' type plane!");
+
+ // Set the name.
+ V->setName(Name);
+ }
+ }
+
+ /// ParseGlobalVariable - Handle parsing of a global. If Initializer is null,
+ /// this is a declaration, otherwise it is a definition.
+ static GlobalVariable *
+ ParseGlobalVariable(char *NameStr,GlobalValue::LinkageTypes Linkage,
+ bool isConstantGlobal, const Type *Ty,
+ Constant *Initializer) {
+ if (isa<FunctionType>(Ty))
+ ThrowException("Cannot declare global vars of function type!");
+
+ const PointerType *PTy = PointerType::get(Ty);
+
+ std::string Name;
+ if (NameStr) {
+ Name = NameStr; // Copy string
+ free(NameStr); // Free old string
+ }
+
+ // See if this global value was forward referenced. If so, recycle the
+ // object.
+ ValID ID;
+ if (!Name.empty()) {
+ ID = ValID::create((char*)Name.c_str());
+ } else {
+ ID = ValID::create((int)CurModule.Values[PTy].size());
+ }
+
+ if (GlobalValue *FWGV = CurModule.GetForwardRefForGlobal(PTy, ID)) {
+ // Move the global to the end of the list, from whereever it was
+ // previously inserted.
+ GlobalVariable *GV = cast<GlobalVariable>(FWGV);
+ CurModule.CurrentModule->getGlobalList().remove(GV);
+ CurModule.CurrentModule->getGlobalList().push_back(GV);
+ GV->setInitializer(Initializer);
+ GV->setLinkage(Linkage);
+ GV->setConstant(isConstantGlobal);
+ InsertValue(GV, CurModule.Values);
+ return GV;
+ }
+
+ // If this global has a name, check to see if there is already a definition
+ // of this global in the module. If so, merge as appropriate. Note that
+ // this is really just a hack around problems in the CFE. :(
+ if (!Name.empty()) {
+ // We are a simple redefinition of a value, check to see if it is defined
+ // the same as the old one.
+ if (GlobalVariable *EGV =
+ CurModule.CurrentModule->getGlobalVariable(Name, Ty)) {
+ // We are allowed to redefine a global variable in two circumstances:
+ // 1. If at least one of the globals is uninitialized or
+ // 2. If both initializers have the same value.
+ //
+ if (!EGV->hasInitializer() || !Initializer ||
+ EGV->getInitializer() == Initializer) {
+
+ // Make sure the existing global version gets the initializer! Make
+ // sure that it also gets marked const if the new version is.
+ if (Initializer && !EGV->hasInitializer())
+ EGV->setInitializer(Initializer);
+ if (isConstantGlobal)
+ EGV->setConstant(true);
+ EGV->setLinkage(Linkage);
+ return EGV;
+ }
+
+ ThrowException("Redefinition of global variable named '" + Name +
+ "' in the '" + Ty->getDescription() + "' type plane!");
+ }
+ }
+
+ // Otherwise there is no existing GV to use, create one now.
+ GlobalVariable *GV =
+ new GlobalVariable(Ty, isConstantGlobal, Linkage, Initializer, Name,
+ CurModule.CurrentModule);
+ InsertValue(GV, CurModule.Values);
+ return GV;
+ }
+
+ // setTypeName - Set the specified type to the name given. The name may be
+ // null potentially, in which case this is a noop. The string passed in is
+ // assumed to be a malloc'd string buffer, and is freed by this function.
+ //
+ // This function returns true if the type has already been defined, but is
+ // allowed to be redefined in the specified context. If the name is a new name
+ // for the type plane, it is inserted and false is returned.
+ static bool setTypeName(const Type *T, char *NameStr) {
+ assert(!inFunctionScope() && "Can't give types function-local names!");
+ if (NameStr == 0) return false;
+
+ std::string Name(NameStr); // Copy string
+ free(NameStr); // Free old string
+
+ // We don't allow assigning names to void type
+ if (T == Type::VoidTy)
+ ThrowException("Can't assign name '" + Name + "' to the void type!");
+
+ // Set the type name, checking for conflicts as we do so.
+ bool AlreadyExists = CurModule.CurrentModule->addTypeName(Name, T);
+
+ if (AlreadyExists) { // Inserting a name that is already defined???
+ const Type *Existing = CurModule.CurrentModule->getTypeByName(Name);
+ assert(Existing && "Conflict but no matching type?");
+
+ // There is only one case where this is allowed: when we are refining an
+ // opaque type. In this case, Existing will be an opaque type.
+ if (const OpaqueType *OpTy = dyn_cast<OpaqueType>(Existing)) {
+ // We ARE replacing an opaque type!
+ const_cast<OpaqueType*>(OpTy)->refineAbstractTypeTo(T);
+ return true;
+ }
+
+ // Otherwise, this is an attempt to redefine a type. That's okay if
+ // the redefinition is identical to the original. This will be so if
+ // Existing and T point to the same Type object. In this one case we
+ // allow the equivalent redefinition.
+ if (Existing == T) return true; // Yes, it's equal.
+
+ // Any other kind of (non-equivalent) redefinition is an error.
+ ThrowException("Redefinition of type named '" + Name + "' in the '" +
+ T->getDescription() + "' type plane!");
+ }
+
+ return false;
+ }
+
+ //===----------------------------------------------------------------------===//
+ // Code for handling upreferences in type names...
+ //
+
+ // TypeContains - Returns true if Ty directly contains E in it.
+ //
+ static bool TypeContains(const Type *Ty, const Type *E) {
+ return std::find(Ty->subtype_begin(), Ty->subtype_end(),
+ E) != Ty->subtype_end();
+ }
+
+ namespace {
+ struct UpRefRecord {
+ // NestingLevel - The number of nesting levels that need to be popped before
+ // this type is resolved.
+ unsigned NestingLevel;
+
+ // LastContainedTy - This is the type at the current binding level for the
+ // type. Every time we reduce the nesting level, this gets updated.
+ const Type *LastContainedTy;
+
+ // UpRefTy - This is the actual opaque type that the upreference is
+ // represented with.
+ OpaqueType *UpRefTy;
+
+ UpRefRecord(unsigned NL, OpaqueType *URTy)
+ : NestingLevel(NL), LastContainedTy(URTy), UpRefTy(URTy) {}
+ };
+ }
+
+ // UpRefs - A list of the outstanding upreferences that need to be resolved.
+ static std::vector<UpRefRecord> UpRefs;
+
+ /// HandleUpRefs - Every time we finish a new layer of types, this function is
+ /// called. It loops through the UpRefs vector, which is a list of the
+ /// currently active types. For each type, if the up reference is contained in
+ /// the newly completed type, we decrement the level count. When the level
+ /// count reaches zero, the upreferenced type is the type that is passed in:
+ /// thus we can complete the cycle.
+ ///
+ static PATypeHolder HandleUpRefs(const Type *ty) {
+ if (!ty->isAbstract()) return ty;
+ PATypeHolder Ty(ty);
+ UR_OUT("Type '" << Ty->getDescription() <<
+ "' newly formed. Resolving upreferences.\n" <<
+ UpRefs.size() << " upreferences active!\n");
+
+ // If we find any resolvable upreferences (i.e., those whose NestingLevel goes
+ // to zero), we resolve them all together before we resolve them to Ty. At
+ // the end of the loop, if there is anything to resolve to Ty, it will be in
+ // this variable.
+ OpaqueType *TypeToResolve = 0;
+
+ for (unsigned i = 0; i != UpRefs.size(); ++i) {
+ UR_OUT(" UR#" << i << " - TypeContains(" << Ty->getDescription() << ", "
+ << UpRefs[i].second->getDescription() << ") = "
+ << (TypeContains(Ty, UpRefs[i].second) ? "true" : "false") << "\n");
+ if (TypeContains(Ty, UpRefs[i].LastContainedTy)) {
+ // Decrement level of upreference
+ unsigned Level = --UpRefs[i].NestingLevel;
+ UpRefs[i].LastContainedTy = Ty;
+ UR_OUT(" Uplevel Ref Level = " << Level << "\n");
+ if (Level == 0) { // Upreference should be resolved!
+ if (!TypeToResolve) {
+ TypeToResolve = UpRefs[i].UpRefTy;
+ } else {
+ UR_OUT(" * Resolving upreference for "
+ << UpRefs[i].second->getDescription() << "\n";
+ std::string OldName = UpRefs[i].UpRefTy->getDescription());
+ UpRefs[i].UpRefTy->refineAbstractTypeTo(TypeToResolve);
+ UR_OUT(" * Type '" << OldName << "' refined upreference to: "
+ << (const void*)Ty << ", " << Ty->getDescription() << "\n");
+ }
+ UpRefs.erase(UpRefs.begin()+i); // Remove from upreference list...
+ --i; // Do not skip the next element...
+ }
+ }
+ }
+
+ if (TypeToResolve) {
+ UR_OUT(" * Resolving upreference for "
+ << UpRefs[i].second->getDescription() << "\n";
+ std::string OldName = TypeToResolve->getDescription());
+ TypeToResolve->refineAbstractTypeTo(Ty);
+ }
+
+ return Ty;
+ }
+
+
+ // common code from the two 'RunVMAsmParser' functions
+ static Module * RunParser(Module * M) {
+
+ llvmAsmlineno = 1; // Reset the current line number...
+ ObsoleteVarArgs = false;
+ NewVarArgs = false;
+
+ CurModule.CurrentModule = M;
+ yyparse(); // Parse the file, potentially throwing exception
+
+ Module *Result = ParserResult;
+ ParserResult = 0;
+
+ //Not all functions use vaarg, so make a second check for ObsoleteVarArgs
+ {
+ Function* F;
+ if ((F = Result->getNamedFunction("llvm.va_start"))
+ && F->getFunctionType()->getNumParams() == 0)
+ ObsoleteVarArgs = true;
+ if((F = Result->getNamedFunction("llvm.va_copy"))
+ && F->getFunctionType()->getNumParams() == 1)
+ ObsoleteVarArgs = true;
+ }
+
+ if (ObsoleteVarArgs && NewVarArgs)
+ ThrowException("This file is corrupt: it uses both new and old style varargs");
+
+ if(ObsoleteVarArgs) {
+ if(Function* F = Result->getNamedFunction("llvm.va_start")) {
+ if (F->arg_size() != 0)
+ ThrowException("Obsolete va_start takes 0 argument!");
+
+ //foo = va_start()
+ // ->
+ //bar = alloca typeof(foo)
+ //va_start(bar)
+ //foo = load bar
+
+ const Type* RetTy = Type::getPrimitiveType(Type::VoidTyID);
+ const Type* ArgTy = F->getFunctionType()->getReturnType();
+ const Type* ArgTyPtr = PointerType::get(ArgTy);
+ Function* NF = Result->getOrInsertFunction("llvm.va_start",
+ RetTy, ArgTyPtr, (Type *)0);
+
+ while (!F->use_empty()) {
+ CallInst* CI = cast<CallInst>(F->use_back());
+ AllocaInst* bar = new AllocaInst(ArgTy, 0, "vastart.fix.1", CI);
+ new CallInst(NF, bar, "", CI);
+ Value* foo = new LoadInst(bar, "vastart.fix.2", CI);
+ CI->replaceAllUsesWith(foo);
+ CI->getParent()->getInstList().erase(CI);
+ }
+ Result->getFunctionList().erase(F);
+ }
+
+ if(Function* F = Result->getNamedFunction("llvm.va_end")) {
+ if(F->arg_size() != 1)
+ ThrowException("Obsolete va_end takes 1 argument!");
+
+ //vaend foo
+ // ->
+ //bar = alloca 1 of typeof(foo)
+ //vaend bar
+ const Type* RetTy = Type::getPrimitiveType(Type::VoidTyID);
+ const Type* ArgTy = F->getFunctionType()->getParamType(0);
+ const Type* ArgTyPtr = PointerType::get(ArgTy);
+ Function* NF = Result->getOrInsertFunction("llvm.va_end",
+ RetTy, ArgTyPtr, (Type *)0);
+
+ while (!F->use_empty()) {
+ CallInst* CI = cast<CallInst>(F->use_back());
+ AllocaInst* bar = new AllocaInst(ArgTy, 0, "vaend.fix.1", CI);
+ new StoreInst(CI->getOperand(1), bar, CI);
+ new CallInst(NF, bar, "", CI);
+ CI->getParent()->getInstList().erase(CI);
+ }
+ Result->getFunctionList().erase(F);
+ }
+
+ if(Function* F = Result->getNamedFunction("llvm.va_copy")) {
+ if(F->arg_size() != 1)
+ ThrowException("Obsolete va_copy takes 1 argument!");
+ //foo = vacopy(bar)
+ // ->
+ //a = alloca 1 of typeof(foo)
+ //b = alloca 1 of typeof(foo)
+ //store bar -> b
+ //vacopy(a, b)
+ //foo = load a
+
+ const Type* RetTy = Type::getPrimitiveType(Type::VoidTyID);
+ const Type* ArgTy = F->getFunctionType()->getReturnType();
+ const Type* ArgTyPtr = PointerType::get(ArgTy);
+ Function* NF = Result->getOrInsertFunction("llvm.va_copy",
+ RetTy, ArgTyPtr, ArgTyPtr,
+ (Type *)0);
+
+ while (!F->use_empty()) {
+ CallInst* CI = cast<CallInst>(F->use_back());
+ AllocaInst* a = new AllocaInst(ArgTy, 0, "vacopy.fix.1", CI);
+ AllocaInst* b = new AllocaInst(ArgTy, 0, "vacopy.fix.2", CI);
+ new StoreInst(CI->getOperand(1), b, CI);
+ new CallInst(NF, a, b, "", CI);
+ Value* foo = new LoadInst(a, "vacopy.fix.3", CI);
+ CI->replaceAllUsesWith(foo);
+ CI->getParent()->getInstList().erase(CI);
+ }
+ Result->getFunctionList().erase(F);
+ }
+ }
+
+ return Result;
+
+ }
+
+ //===----------------------------------------------------------------------===//
+ // RunVMAsmParser - Define an interface to this parser
+ //===----------------------------------------------------------------------===//
+ //
+ Module *llvm::RunVMAsmParser(const std::string &Filename, FILE *F) {
+ set_scan_file(F);
+
+ CurFilename = Filename;
+ return RunParser(new Module(CurFilename));
+ }
+
+ Module *llvm::RunVMAsmParser(const char * AsmString, Module * M) {
+ set_scan_string(AsmString);
+
+ CurFilename = "from_memory";
+ if (M == NULL) {
+ return RunParser(new Module (CurFilename));
+ } else {
+ return RunParser(M);
+ }
+ }
+
+
+ #line 890 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ typedef union {
+ llvm::Module *ModuleVal;
+ llvm::Function *FunctionVal;
+ std::pair<llvm::PATypeHolder*, char*> *ArgVal;
+ llvm::BasicBlock *BasicBlockVal;
+ llvm::TerminatorInst *TermInstVal;
+ llvm::Instruction *InstVal;
+ llvm::Constant *ConstVal;
+
+ const llvm::Type *PrimType;
+ llvm::PATypeHolder *TypeVal;
+ llvm::Value *ValueVal;
+
+ std::vector<std::pair<llvm::PATypeHolder*,char*> > *ArgList;
+ std::vector<llvm::Value*> *ValueList;
+ std::list<llvm::PATypeHolder> *TypeList;
+ // Represent the RHS of PHI node
+ std::list<std::pair<llvm::Value*,
+ llvm::BasicBlock*> > *PHIList;
+ std::vector<std::pair<llvm::Constant*, llvm::BasicBlock*> > *JumpTable;
+ std::vector<llvm::Constant*> *ConstVector;
+
+ llvm::GlobalValue::LinkageTypes Linkage;
+ int64_t SInt64Val;
+ uint64_t UInt64Val;
+ int SIntVal;
+ unsigned UIntVal;
+ double FPVal;
+ bool BoolVal;
+
+ char *StrVal; // This memory is strdup'd!
+ llvm::ValID ValIDVal; // strdup'd memory maybe!
+
+ llvm::Instruction::BinaryOps BinaryOpVal;
+ llvm::Instruction::TermOps TermOpVal;
+ llvm::Instruction::MemoryOps MemOpVal;
+ llvm::Instruction::OtherOps OtherOpVal;
+ llvm::Module::Endianness Endianness;
+ } YYSTYPE;
+ #include <stdio.h>
+
+ #ifndef __cplusplus
+ #ifndef __STDC__
+ #define const
+ #endif
+ #endif
+
+
+
+ #define YYFINAL 473
+ #define YYFLAG -32768
+ #define YYNTBASE 115
+
+ #define YYTRANSLATE(x) ((unsigned)(x) <= 354 ? yytranslate[x] : 186)
+
+ static const char yytranslate[] = { 0,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 104,
+ 105, 113, 2, 102, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 109,
+ 101, 110, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 106, 103, 108, 2, 2, 2, 2, 2, 114, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 107,
+ 2, 2, 111, 2, 112, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 1, 3, 4, 5, 6,
+ 7, 8, 9, 10, 11, 12, 13, 14, 15, 16,
+ 17, 18, 19, 20, 21, 22, 23, 24, 25, 26,
+ 27, 28, 29, 30, 31, 32, 33, 34, 35, 36,
+ 37, 38, 39, 40, 41, 42, 43, 44, 45, 46,
+ 47, 48, 49, 50, 51, 52, 53, 54, 55, 56,
+ 57, 58, 59, 60, 61, 62, 63, 64, 65, 66,
+ 67, 68, 69, 70, 71, 72, 73, 74, 75, 76,
+ 77, 78, 79, 80, 81, 82, 83, 84, 85, 86,
+ 87, 88, 89, 90, 91, 92, 93, 94, 95, 96,
+ 97, 98, 99, 100
+ };
+
+ #if YYDEBUG != 0
+ static const short yyprhs[] = { 0,
+ 0, 2, 4, 6, 8, 10, 12, 14, 16, 18,
+ 20, 22, 24, 26, 28, 30, 32, 34, 36, 38,
+ 40, 42, 44, 46, 48, 50, 52, 54, 56, 58,
+ 60, 62, 64, 67, 68, 70, 72, 74, 76, 77,
+ 78, 80, 82, 84, 87, 88, 91, 92, 96, 99,
+ 100, 102, 103, 107, 109, 112, 114, 116, 118, 120,
+ 122, 124, 126, 128, 130, 132, 134, 136, 138, 140,
+ 142, 144, 146, 148, 150, 152, 154, 157, 162, 168,
+ 174, 178, 181, 184, 186, 190, 192, 196, 198, 199,
+ 204, 208, 212, 217, 222, 226, 229, 232, 235, 238,
+ 241, 244, 247, 250, 253, 256, 263, 269, 278, 285,
+ 292, 299, 306, 313, 317, 319, 321, 323, 325, 328,
+ 331, 336, 339, 341, 346, 349, 354, 355, 363, 364,
+ 372, 376, 381, 382, 384, 386, 388, 392, 396, 400,
+ 404, 408, 410, 411, 413, 415, 417, 418, 421, 425,
+ 427, 429, 433, 435, 436, 445, 447, 449, 453, 455,
+ 457, 460, 461, 465, 466, 468, 470, 472, 474, 476,
+ 478, 480, 482, 484, 488, 490, 496, 498, 500, 502,
+ 504, 507, 510, 513, 517, 520, 521, 523, 526, 529,
+ 533, 543, 553, 562, 576, 578, 580, 587, 593, 596,
+ 603, 611, 613, 617, 619, 620, 623, 625, 631, 637,
+ 643, 646, 651, 656, 663, 668, 673, 678, 683, 690,
+ 693, 701, 703, 706, 707, 709, 710, 714, 721, 725,
+ 732, 735, 740, 747
+ };
+
+ static const short yyrhs[] = { 5,
+ 0, 6, 0, 3, 0, 4, 0, 71, 0, 72,
+ 0, 73, 0, 74, 0, 75, 0, 76, 0, 77,
+ 0, 78, 0, 79, 0, 80, 0, 81, 0, 82,
+ 0, 83, 0, 84, 0, 94, 0, 95, 0, 16,
+ 0, 14, 0, 12, 0, 10, 0, 17, 0, 15,
+ 0, 13, 0, 11, 0, 121, 0, 122, 0, 18,
+ 0, 19, 0, 155, 101, 0, 0, 41, 0, 42,
+ 0, 43, 0, 44, 0, 0, 0, 62, 0, 63,
+ 0, 64, 0, 61, 4, 0, 0, 54, 4, 0,
+ 0, 102, 54, 4, 0, 34, 24, 0, 0, 130,
+ 0, 0, 102, 133, 132, 0, 130, 0, 54, 4,
+ 0, 136, 0, 8, 0, 138, 0, 8, 0, 138,
+ 0, 9, 0, 10, 0, 11, 0, 12, 0, 13,
+ 0, 14, 0, 15, 0, 16, 0, 17, 0, 18,
+ 0, 19, 0, 20, 0, 21, 0, 45, 0, 137,
+ 0, 169, 0, 103, 4, 0, 135, 104, 140, 105,
+ 0, 106, 4, 107, 138, 108, 0, 109, 4, 107,
+ 138, 110, 0, 111, 139, 112, 0, 111, 112, 0,
+ 138, 113, 0, 138, 0, 139, 102, 138, 0, 139,
+ 0, 139, 102, 37, 0, 37, 0, 0, 136, 106,
+ 143, 108, 0, 136, 106, 108, 0, 136, 114, 24,
+ 0, 136, 109, 143, 110, 0, 136, 111, 143, 112,
+ 0, 136, 111, 112, 0, 136, 38, 0, 136, 39,
+ 0, 136, 169, 0, 136, 142, 0, 136, 26, 0,
+ 121, 116, 0, 122, 4, 0, 9, 27, 0, 9,
+ 28, 0, 124, 7, 0, 92, 104, 141, 36, 136,
+ 105, 0, 90, 104, 141, 183, 105, 0, 93, 104,
+ 141, 102, 141, 102, 141, 105, 0, 117, 104, 141,
+ 102, 141, 105, 0, 118, 104, 141, 102, 141, 105,
+ 0, 119, 104, 141, 102, 141, 105, 0, 120, 104,
+ 141, 102, 141, 105, 0, 97, 104, 141, 102, 141,
+ 105, 0, 143, 102, 141, 0, 141, 0, 32, 0,
+ 33, 0, 146, 0, 146, 164, 0, 146, 165, 0,
+ 146, 59, 58, 150, 0, 146, 25, 0, 147, 0,
+ 147, 125, 20, 134, 0, 147, 165, 0, 147, 59,
+ 58, 150, 0, 0, 147, 125, 126, 144, 141, 148,
+ 132, 0, 0, 147, 125, 47, 144, 136, 149, 132,
+ 0, 147, 48, 152, 0, 147, 55, 101, 153, 0,
+ 0, 24, 0, 53, 0, 52, 0, 50, 101, 151,
+ 0, 51, 101, 4, 0, 49, 101, 24, 0, 106,
+ 154, 108, 0, 154, 102, 24, 0, 24, 0, 0,
+ 22, 0, 24, 0, 155, 0, 0, 136, 156, 0,
+ 158, 102, 157, 0, 157, 0, 158, 0, 158, 102,
+ 37, 0, 37, 0, 0, 127, 134, 155, 104, 159,
+ 105, 131, 128, 0, 29, 0, 111, 0, 126, 160,
+ 161, 0, 30, 0, 112, 0, 172, 163, 0, 0,
+ 31, 166, 160, 0, 0, 60, 0, 3, 0, 4,
+ 0, 7, 0, 27, 0, 28, 0, 38, 0, 39,
+ 0, 26, 0, 109, 143, 110, 0, 142, 0, 58,
+ 167, 24, 102, 24, 0, 115, 0, 155, 0, 169,
+ 0, 168, 0, 136, 170, 0, 172, 173, 0, 162,
+ 173, 0, 174, 125, 175, 0, 174, 177, 0, 0,
+ 23, 0, 65, 171, 0, 65, 8, 0, 66, 21,
+ 170, 0, 66, 9, 170, 102, 21, 170, 102, 21,
+ 170, 0, 67, 123, 170, 102, 21, 170, 106, 176,
+ 108, 0, 67, 123, 170, 102, 21, 170, 106, 108,
+ 0, 68, 127, 134, 170, 104, 180, 105, 36, 21,
+ 170, 69, 21, 170, 0, 69, 0, 70, 0, 176,
+ 123, 168, 102, 21, 170, 0, 123, 168, 102, 21,
+ 170, 0, 125, 182, 0, 136, 106, 170, 102, 170,
+ 108, 0, 178, 102, 106, 170, 102, 170, 108, 0,
+ 171, 0, 179, 102, 171, 0, 179, 0, 0, 57,
+ 56, 0, 56, 0, 117, 136, 170, 102, 170, 0,
+ 118, 136, 170, 102, 170, 0, 119, 136, 170, 102,
+ 170, 0, 46, 171, 0, 120, 171, 102, 171, 0,
+ 92, 171, 36, 136, 0, 93, 171, 102, 171, 102,
+ 171, 0, 96, 171, 102, 136, 0, 99, 171, 102,
+ 136, 0, 100, 171, 102, 136, 0, 97, 171, 102,
+ 171, 0, 98, 171, 102, 171, 102, 171, 0, 91,
+ 178, 0, 181, 127, 134, 170, 104, 180, 105, 0,
+ 185, 0, 102, 179, 0, 0, 35, 0, 0, 85,
+ 136, 129, 0, 85, 136, 102, 15, 170, 129, 0,
+ 86, 136, 129, 0, 86, 136, 102, 15, 170, 129,
+ 0, 87, 171, 0, 184, 88, 136, 170, 0, 184,
+ 89, 171, 102, 136, 170, 0, 90, 136, 170, 183,
+ 0
+ };
+
+ #endif
+
+ #if YYDEBUG != 0
+ static const short yyrline[] = { 0,
+ 1010, 1011, 1018, 1019, 1028, 1028, 1028, 1028, 1028, 1029,
+ 1029, 1029, 1030, 1030, 1030, 1030, 1030, 1030, 1032, 1032,
+ 1036, 1036, 1036, 1036, 1037, 1037, 1037, 1037, 1038, 1038,
+ 1039, 1039, 1042, 1045, 1049, 1049, 1050, 1051, 1052, 1055,
+ 1055, 1056, 1057, 1058, 1067, 1067, 1073, 1073, 1081, 1088,
+ 1088, 1094, 1094, 1096, 1100, 1113, 1113, 1114, 1114, 1116,
+ 1125, 1125, 1125, 1125, 1125, 1125, 1125, 1126, 1126, 1126,
+ 1126, 1126, 1126, 1127, 1130, 1133, 1139, 1146, 1158, 1162,
+ 1173, 1182, 1185, 1193, 1197, 1202, 1203, 1206, 1209, 1219,
+ 1244, 1257, 1286, 1311, 1331, 1343, 1352, 1356, 1415, 1421,
+ 1429, 1434, 1439, 1442, 1445, 1452, 1462, 1493, 1500, 1521,
+ 1531, 1536, 1543, 1553, 1556, 1563, 1563, 1573, 1580, 1584,
+ 1587, 1590, 1593, 1606, 1626, 1628, 1630, 1633, 1636, 1640,
+ 1643, 1645, 1647, 1651, 1663, 1664, 1666, 1669, 1677, 1682,
+ 1684, 1688, 1692, 1700, 1700, 1701, 1701, 1703, 1709, 1714,
+ 1720, 1723, 1728, 1732, 1736, 1822, 1822, 1824, 1832, 1832,
+ 1834, 1838, 1838, 1847, 1850, 1854, 1857, 1860, 1863, 1866,
+ 1869, 1872, 1875, 1878, 1902, 1905, 1918, 1921, 1926, 1926,
+ 1932, 1936, 1939, 1947, 1956, 1960, 1970, 1981, 1984, 1987,
+ 1990, 1993, 2007, 2011, 2064, 2067, 2073, 2081, 2091, 2098,
+ 2103, 2110, 2114, 2120, 2120, 2122, 2125, 2131, 2143, 2154,
+ 2164, 2176, 2183, 2190, 2197, 2202, 2221, 2243, 2251, 2263,
+ 2277, 2334, 2340, 2342, 2346, 2349, 2355, 2359, 2363, 2367,
+ 2371, 2378, 2388, 2401
+ };
+ #endif
+
+
+ #if YYDEBUG != 0 || defined (YYERROR_VERBOSE)
+
+ static const char * const yytname[] = { "$","error","$undefined.","ESINT64VAL",
+ "EUINT64VAL","SINTVAL","UINTVAL","FPVAL","VOID","BOOL","SBYTE","UBYTE","SHORT",
+ "USHORT","INT","UINT","LONG","ULONG","FLOAT","DOUBLE","TYPE","LABEL","VAR_ID",
+ "LABELSTR","STRINGCONSTANT","IMPLEMENTATION","ZEROINITIALIZER","TRUETOK","FALSETOK",
+ "BEGINTOK","ENDTOK","DECLARE","GLOBAL","CONSTANT","SECTION","VOLATILE","TO",
+ "DOTDOTDOT","NULL_TOK","UNDEF","CONST","INTERNAL","LINKONCE","WEAK","APPENDING",
+ "OPAQUE","NOT","EXTERNAL","TARGET","TRIPLE","ENDIAN","POINTERSIZE","LITTLE",
+ "BIG","ALIGN","DEPLIBS","CALL","TAIL","ASM_TOK","MODULE","SIDEEFFECT","CC_TOK",
+ "CCC_TOK","FASTCC_TOK","COLDCC_TOK","RET","BR","SWITCH","INVOKE","UNWIND","UNREACHABLE",
+ "ADD","SUB","MUL","DIV","REM","AND","OR","XOR","SETLE","SETGE","SETLT","SETGT",
+ "SETEQ","SETNE","MALLOC","ALLOCA","FREE","LOAD","STORE","GETELEMENTPTR","PHI_TOK",
+ "CAST","SELECT","SHL","SHR","VAARG","EXTRACTELEMENT","INSERTELEMENT","VAARG_old",
+ "VANEXT_old","'='","','","'\\\\'","'('","')'","'['","'x'","']'","'<'","'>'",
+ "'{'","'}'","'*'","'c'","INTVAL","EINT64VAL","ArithmeticOps","LogicalOps","SetCondOps",
+ "ShiftOps","SIntType","UIntType","IntType","FPType","OptAssign","OptLinkage",
+ "OptCallingConv","OptAlign","OptCAlign","SectionString","OptSection","GlobalVarAttributes",
+ "GlobalVarAttribute","TypesV","UpRTypesV","Types","PrimType","UpRTypes","TypeListI",
+ "ArgTypeListI","ConstVal","ConstExpr","ConstVector","GlobalType","Module","FunctionList",
+ "ConstPool","@1","@2","AsmBlock","BigOrLittle","TargetDefinition","LibrariesDefinition",
+ "LibList","Name","OptName","ArgVal","ArgListH","ArgList","FunctionHeaderH","BEGIN",
+ "FunctionHeader","END","Function","FunctionProto","@3","OptSideEffect","ConstValueRef",
+ "SymbolicValueRef","ValueRef","ResolvedVal","BasicBlockList","BasicBlock","InstructionList",
+ "BBTerminatorInst","JumpTable","Inst","PHIList","ValueRefList","ValueRefListE",
+ "OptTailCall","InstVal","IndexList","OptVolatile","MemoryInst", NULL
+ };
+ #endif
+
+ static const short yyr1[] = { 0,
+ 115, 115, 116, 116, 117, 117, 117, 117, 117, 118,
+ 118, 118, 119, 119, 119, 119, 119, 119, 120, 120,
+ 121, 121, 121, 121, 122, 122, 122, 122, 123, 123,
+ 124, 124, 125, 125, 126, 126, 126, 126, 126, 127,
+ 127, 127, 127, 127, 128, 128, 129, 129, 130, 131,
+ 131, 132, 132, 133, 133, 134, 134, 135, 135, 136,
+ 137, 137, 137, 137, 137, 137, 137, 137, 137, 137,
+ 137, 137, 137, 138, 138, 138, 138, 138, 138, 138,
+ 138, 138, 138, 139, 139, 140, 140, 140, 140, 141,
+ 141, 141, 141, 141, 141, 141, 141, 141, 141, 141,
+ 141, 141, 141, 141, 141, 142, 142, 142, 142, 142,
+ 142, 142, 142, 143, 143, 144, 144, 145, 146, 146,
+ 146, 146, 146, 147, 147, 147, 148, 147, 149, 147,
+ 147, 147, 147, 150, 151, 151, 152, 152, 152, 153,
+ 154, 154, 154, 155, 155, 156, 156, 157, 158, 158,
+ 159, 159, 159, 159, 160, 161, 161, 162, 163, 163,
+ 164, 166, 165, 167, 167, 168, 168, 168, 168, 168,
+ 168, 168, 168, 168, 168, 168, 169, 169, 170, 170,
+ 171, 172, 172, 173, 174, 174, 174, 175, 175, 175,
+ 175, 175, 175, 175, 175, 175, 176, 176, 177, 178,
+ 178, 179, 179, 180, 180, 181, 181, 182, 182, 182,
+ 182, 182, 182, 182, 182, 182, 182, 182, 182, 182,
+ 182, 182, 183, 183, 184, 184, 185, 185, 185, 185,
+ 185, 185, 185, 185
+ };
+
+ static const short yyr2[] = { 0,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 2, 0, 1, 1, 1, 1, 0, 0,
+ 1, 1, 1, 2, 0, 2, 0, 3, 2, 0,
+ 1, 0, 3, 1, 2, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 2, 4, 5, 5,
+ 3, 2, 2, 1, 3, 1, 3, 1, 0, 4,
+ 3, 3, 4, 4, 3, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 6, 5, 8, 6, 6,
+ 6, 6, 6, 3, 1, 1, 1, 1, 2, 2,
+ 4, 2, 1, 4, 2, 4, 0, 7, 0, 7,
+ 3, 4, 0, 1, 1, 1, 3, 3, 3, 3,
+ 3, 1, 0, 1, 1, 1, 0, 2, 3, 1,
+ 1, 3, 1, 0, 8, 1, 1, 3, 1, 1,
+ 2, 0, 3, 0, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 3, 1, 5, 1, 1, 1, 1,
+ 2, 2, 2, 3, 2, 0, 1, 2, 2, 3,
+ 9, 9, 8, 13, 1, 1, 6, 5, 2, 6,
+ 7, 1, 3, 1, 0, 2, 1, 5, 5, 5,
+ 2, 4, 4, 6, 4, 4, 4, 4, 6, 2,
+ 7, 1, 2, 0, 1, 0, 3, 6, 3, 6,
+ 2, 4, 6, 4
+ };
+
+ static const short yydefact[] = { 133,
+ 39, 123, 122, 162, 35, 36, 37, 38, 0, 40,
+ 186, 119, 120, 186, 144, 145, 0, 0, 0, 39,
+ 0, 125, 40, 0, 0, 41, 42, 43, 0, 0,
+ 187, 183, 34, 159, 160, 161, 182, 0, 0, 0,
+ 131, 0, 0, 0, 0, 0, 33, 163, 134, 121,
+ 44, 1, 2, 57, 61, 62, 63, 64, 65, 66,
+ 67, 68, 69, 70, 71, 72, 73, 74, 0, 0,
+ 0, 0, 177, 0, 0, 56, 75, 60, 178, 76,
+ 156, 157, 158, 226, 185, 0, 0, 0, 143, 132,
+ 126, 124, 116, 117, 0, 0, 77, 0, 0, 59,
+ 82, 84, 0, 0, 89, 83, 225, 0, 207, 0,
+ 0, 0, 0, 40, 195, 196, 5, 6, 7, 8,
+ 9, 10, 11, 12, 13, 14, 15, 16, 17, 18,
+ 0, 0, 0, 0, 0, 0, 0, 19, 20, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 184, 40,
+ 199, 0, 222, 139, 136, 135, 137, 138, 142, 0,
+ 129, 61, 62, 63, 64, 65, 66, 67, 68, 69,
+ 70, 71, 0, 0, 0, 0, 127, 0, 0, 0,
+ 81, 154, 88, 86, 0, 0, 211, 206, 189, 188,
+ 0, 0, 24, 28, 23, 27, 22, 26, 21, 25,
+ 29, 30, 0, 0, 47, 47, 231, 0, 0, 220,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 140, 52, 103, 104, 3,
+ 4, 101, 102, 105, 100, 96, 97, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 99,
+ 98, 52, 58, 58, 85, 153, 147, 150, 151, 0,
+ 0, 78, 166, 167, 168, 173, 169, 170, 171, 172,
+ 164, 0, 175, 180, 179, 181, 0, 190, 0, 0,
+ 0, 227, 0, 229, 224, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 0, 141, 0, 130, 0, 0, 0, 0, 91, 115,
+ 0, 0, 95, 0, 92, 0, 0, 0, 0, 128,
+ 79, 80, 146, 148, 0, 50, 87, 165, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 234, 0, 0,
+ 213, 0, 215, 218, 0, 216, 217, 0, 0, 0,
+ 212, 0, 232, 0, 0, 0, 54, 52, 224, 0,
+ 0, 0, 0, 90, 93, 94, 0, 0, 0, 0,
+ 152, 149, 51, 45, 0, 174, 0, 0, 205, 47,
+ 48, 47, 202, 223, 0, 0, 0, 0, 208, 209,
+ 210, 205, 0, 49, 55, 53, 0, 0, 0, 0,
+ 114, 0, 0, 0, 0, 0, 155, 0, 0, 0,
+ 204, 0, 0, 228, 230, 0, 0, 0, 214, 219,
+ 0, 233, 107, 0, 0, 0, 0, 0, 0, 0,
+ 46, 176, 0, 0, 0, 203, 200, 0, 221, 106,
+ 0, 113, 109, 110, 111, 112, 0, 193, 0, 0,
+ 0, 201, 0, 191, 0, 192, 0, 0, 108, 0,
+ 0, 0, 0, 0, 0, 198, 0, 0, 197, 194,
+ 0, 0, 0
+ };
+
+ static const short yydefgoto[] = { 73,
+ 232, 246, 247, 248, 249, 173, 174, 203, 175, 20,
+ 10, 29, 407, 282, 357, 374, 304, 358, 74, 75,
+ 186, 77, 78, 103, 185, 310, 273, 311, 95, 471,
+ 1, 2, 252, 227, 50, 157, 41, 90, 160, 79,
+ 324, 258, 259, 260, 30, 83, 11, 36, 12, 13,
+ 23, 329, 274, 80, 276, 383, 14, 32, 33, 149,
+ 450, 85, 210, 411, 412, 150, 151, 338, 152, 153
+ };
+
+ static const short yypact[] = {-32768,
+ 30, 99,-32768,-32768,-32768,-32768,-32768,-32768, -47, 46,
+ 33,-32768,-32768, -13,-32768,-32768, 75, -32, 26, 21,
+ -3,-32768, 46, 63, 100,-32768,-32768,-32768, 974, -21,
+ -32768,-32768, 105,-32768,-32768,-32768,-32768, 10, 27, 32,
+ -32768, 38, 63, 974, 103, 103,-32768,-32768,-32768,-32768,
+ -32768,-32768,-32768, 18,-32768,-32768,-32768,-32768,-32768,-32768,
+ -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 135, 148,
+ 155, 490,-32768, 105, 67,-32768,-32768, -64,-32768,-32768,
+ -32768,-32768,-32768, 1136,-32768, 149, 85, 172, 154,-32768,
+ -32768,-32768,-32768,-32768, 1012, 1050,-32768, 73, 76,-32768,
+ -32768, -64, -17, 80, 784,-32768,-32768, 1012,-32768, 129,
+ 1088, 23, 221, 46,-32768,-32768,-32768,-32768,-32768,-32768,
+ -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
+ 1012, 1012, 1012, 1012, 1012, 1012, 1012,-32768,-32768, 1012,
+ 1012, 1012, 1012, 1012, 1012, 1012, 1012, 1012,-32768, 46,
+ -32768, 60,-32768,-32768,-32768,-32768,-32768,-32768,-32768, -14,
+ -32768, 123, 153, 182, 159, 186, 162, 187, 164, 188,
+ 189, 190, 166, 194, 193, 372,-32768, 1012, 1012, 1012,
+ -32768, 822,-32768, 101, 102, 622,-32768,-32768, 18,-32768,
+ 622, 622,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
+ -32768,-32768, 622, 974, 104, 107,-32768, 622, 98, 108,
+ 169, 109, 110, 118, 119, 120, 121, 622, 622, 622,
+ 122, 974, 1012, 1012, 201,-32768, 124,-32768,-32768,-32768,
+ -32768,-32768,-32768,-32768,-32768,-32768,-32768, 136, 137, 138,
+ 141, 860, 1050, 531, 215, 142, 143, 144, 146,-32768,
+ -32768, 124, -75, -53, -64,-32768, 105,-32768, 150, 139,
+ 898,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
+ 191, 1050,-32768,-32768,-32768,-32768, 151,-32768, 152, 622,
+ 5,-32768, 16,-32768, 158, 622, 156, 1012, 1012, 1012,
+ 1012, 1012, 1012, 1012, 161, 165, 168, 1012, 622, 622,
+ 170,-32768, -18,-32768, 1050, 1050, 1050, 1050,-32768,-32768,
+ -11, -65,-32768, -16,-32768, 1050, 1050, 1050, 1050,-32768,
+ -32768,-32768,-32768,-32768, 936, 222,-32768,-32768, 233, -10,
+ 245, 250, 171, 622, 269, 622, 1012,-32768, 178, 622,
+ -32768, 179,-32768,-32768, 180,-32768,-32768, 622, 622, 622,
+ -32768, 181,-32768, 1012, 259, 280,-32768, 124, 158, 255,
+ 184, 192, 1050,-32768,-32768,-32768, 197, 198, 199, 200,
+ -32768,-32768,-32768, 238, 202,-32768, 622, 622, 1012, 204,
+ -32768, 204,-32768, 205, 622, 206, 1012, 1012,-32768,-32768,
+ -32768, 1012, 622,-32768,-32768,-32768, 207, 1012, 1050, 1050,
+ -32768, 1050, 1050, 1050, 1050, 289,-32768, 271, 218, 223,
+ 205, 216, 270,-32768,-32768, 1012, 219, 622,-32768,-32768,
+ 225,-32768,-32768, 228, 226, 230, 231, 232, 235, 236,
+ -32768,-32768, 321, 12, 308,-32768,-32768, 237,-32768,-32768,
+ 1050,-32768,-32768,-32768,-32768,-32768, 622,-32768, 682, 66,
+ 328,-32768, 246,-32768, 248,-32768, 682, 622,-32768, 332,
+ 253, 287, 622, 336, 340,-32768, 622, 622,-32768,-32768,
+ 363, 364,-32768
+ };
+
+ static const short yypgoto[] = {-32768,
+ -32768, 281, 282, 283, 284, -112, -111, -415,-32768, 339,
+ 359, -102,-32768, -201, 54,-32768, -243,-32768, -40,-32768,
+ -29,-32768, -66, 276,-32768, -89, 208, -230, 337,-32768,
+ -32768,-32768,-32768,-32768, 342,-32768,-32768,-32768,-32768, 1,
+ -32768, 57,-32768,-32768, 365,-32768,-32768,-32768,-32768, 384,
+ -32768,-32768, -356, -31, 140, -90,-32768, 375,-32768,-32768,
+ -32768,-32768,-32768, 53, -1,-32768,-32768, 34,-32768,-32768
+ };
+
+
+ #define YYLAST 1236
+
+
+ static const short yytable[] = { 76,
+ 201, 202, 21, 92, 284, 102, 177, 81, 320, 31,
+ 24, 204, 312, 314, 76, 355, 34, 187, 449, 334,
+ 190, 193, 194, 195, 196, 197, 198, 199, 200, -118,
+ 336, 191, 321, 21, 457, 356, 363, 106, 102, -58,
+ 44, 330, 207, 192, 365, 211, 212, 222, 106, 213,
+ 214, 215, 216, 217, 3, 31, 322, 221, 335, 106,
+ 4, 5, 6, 7, 8, 161, 176, 45, 42, 335,
+ 5, 6, 7, 8, 104, 193, 194, 195, 196, 197,
+ 198, 199, 200, 43, 180, 363, 49, 225, 9, 82,
+ 363, 363, 455, 226, 181, 366, 364, 47, 35, 376,
+ 461, 205, 206, 51, 208, 209, 25, 26, 27, 28,
+ 86, 253, 254, 255, 396, 218, 219, 220, -34, 448,
+ 15, -59, 16, 38, 39, 40, 15, 87, 16, 4,
+ -34, -34, 88, 301, 93, 94, 155, 156, 97, -34,
+ -34, -34, -34, 89, 251, -34, 17, 223, 224, 228,
+ 229, 98, 257, 18, 275, -24, -24, 19, 99, 275,
+ 275, -23, -23, 280, -22, -22, -21, -21, 230, 231,
+ 105, 275, 154, 456, 76, 158, 275, 159, 414, 178,
+ 415, 299, 179, 182, 188, -28, 275, 275, 275, -27,
+ -26, -25, 76, 300, 255, -31, -32, 233, 342, 234,
+ 344, 345, 261, 286, 288, 281, 262, 351, 283, 287,
+ 289, 290, 176, 176, 176, 359, 360, 361, 362, 291,
+ 292, 293, 294, 298, 302, 303, 367, 368, 369, 370,
+ 193, 194, 195, 196, 197, 198, 199, 200, 315, 305,
+ 306, 307, 176, 326, 308, 316, 317, 318, 275, 319,
+ 328, 325, 331, 332, 275, 355, 375, 323, 341, 337,
+ 343, 340, 348, 346, 347, 377, 349, 275, 275, 350,
+ 378, 354, 381, 401, 379, 176, 176, 176, 176, 385,
+ 387, 388, 394, 395, 392, 399, 176, 176, 176, 176,
+ 398, 406, 431, 400, 432, 257, 419, 420, 402, 403,
+ 404, 405, 275, 408, 275, 413, 416, 418, 275, 425,
+ 426, 423, 427, 428, 429, 430, 275, 275, 275, 433,
+ 435, 201, 202, 335, 393, 436, 437, 441, 434, 439,
+ 277, 278, 440, 176, 442, 443, 444, 201, 202, 445,
+ 446, 447, 279, 451, 452, 275, 275, 285, 458, 460,
+ 459, 453, 463, 275, 464, 465, 467, 295, 296, 297,
+ 468, 275, 472, 473, 145, 146, 147, 148, 424, 176,
+ 176, 84, 176, 176, 176, 176, 52, 53, 46, 373,
+ 184, 372, 96, 250, 91, 22, 275, 48, 37, 384,
+ 421, 0, 397, 15, 0, 16, 0, 235, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 236,
+ 237, 176, 0, 0, 0, 275, 0, 0, 0, 333,
+ 0, 0, 0, 0, 0, 339, 275, 0, 0, 0,
+ 0, 275, 0, 0, 0, 275, 275, 0, 352, 353,
+ 0, 0, 117, 118, 119, 120, 121, 122, 123, 124,
+ 125, 126, 127, 128, 129, 130, 0, 0, 0, 0,
+ 0, 238, 0, 239, 240, 138, 139, 0, 241, 0,
+ 0, 0, 0, 380, 0, 382, 0, 242, 0, 386,
+ 243, 0, 244, 0, 0, 245, 0, 389, 390, 391,
+ 0, 0, 0, 0, 52, 53, 0, 100, 55, 56,
+ 57, 58, 59, 60, 61, 62, 63, 64, 65, 66,
+ 67, 15, 0, 16, 0, 0, 409, 410, 0, 0,
+ 0, 0, 0, 0, 417, 0, 0, 0, 0, 0,
+ 0, 0, 422, 0, 68, 52, 53, 0, 100, 162,
+ 163, 164, 165, 166, 167, 168, 169, 170, 171, 172,
+ 66, 67, 15, 0, 16, 0, 0, 438, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 68, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 454, 0, 0, 0,
+ 0, 0, 69, 0, 0, 70, 0, 462, 71, 0,
+ 72, 101, 466, 0, 0, 0, 469, 470, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 263, 264, 52, 53, 265, 0,
+ 0, 0, 0, 69, 0, 0, 70, 0, 0, 71,
+ 0, 72, 313, 15, 0, 16, 0, 266, 267, 268,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 269,
+ 270, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 271,
+ 0, 0, 0, 0, 263, 264, 0, 0, 265, 0,
+ 0, 0, 117, 118, 119, 120, 121, 122, 123, 124,
+ 125, 126, 127, 128, 129, 130, 0, 266, 267, 268,
+ 0, 238, 0, 239, 240, 138, 139, 0, 241, 269,
+ 270, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 272, 0, 0, 0, 0, 0, 0, 0, 0, 271,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 0, 0, 117, 118, 119, 120, 121, 122, 123, 124,
+ 125, 126, 127, 128, 129, 130, 0, 0, 0, 0,
+ 0, 238, 0, 239, 240, 138, 139, 0, 241, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 52, 53,
+ 272, 100, 55, 56, 57, 58, 59, 60, 61, 62,
+ 63, 64, 65, 66, 67, 15, 0, 16, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 183, 0, 0, 0, 0, 0, 52, 53, 68, 100,
+ 55, 56, 57, 58, 59, 60, 61, 62, 63, 64,
+ 65, 66, 67, 15, 0, 16, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 256, 0,
+ 0, 0, 0, 0, 52, 53, 68, 100, 162, 163,
+ 164, 165, 166, 167, 168, 169, 170, 171, 172, 66,
+ 67, 15, 0, 16, 0, 0, 69, 0, 0, 70,
+ 0, 0, 71, 0, 72, 0, 0, 0, 0, 0,
+ 0, 0, 52, 53, 68, 100, 55, 56, 57, 58,
+ 59, 60, 61, 62, 63, 64, 65, 66, 67, 15,
+ 0, 16, 0, 0, 69, 0, 0, 70, 0, 0,
+ 71, 0, 72, 0, 327, 0, 0, 0, 0, 0,
+ 52, 53, 68, 100, 55, 56, 57, 58, 59, 60,
+ 61, 62, 63, 64, 65, 66, 67, 15, 0, 16,
+ 0, 0, 69, 0, 0, 70, 0, 309, 71, 0,
+ 72, 0, 371, 0, 0, 0, 0, 0, 52, 53,
+ 68, 54, 55, 56, 57, 58, 59, 60, 61, 62,
+ 63, 64, 65, 66, 67, 15, 0, 16, 0, 0,
+ 69, 0, 0, 70, 0, 0, 71, 0, 72, 0,
+ 0, 0, 0, 0, 0, 0, 52, 53, 68, 100,
+ 55, 56, 57, 58, 59, 60, 61, 62, 63, 64,
+ 65, 66, 67, 15, 0, 16, 0, 0, 69, 0,
+ 0, 70, 0, 0, 71, 0, 72, 0, 0, 0,
+ 0, 0, 0, 0, 52, 53, 68, 100, 162, 163,
+ 164, 165, 166, 167, 168, 169, 170, 171, 172, 66,
+ 67, 15, 0, 16, 0, 0, 69, 0, 0, 70,
+ 0, 0, 71, 0, 72, 0, 0, 0, 0, 0,
+ 0, 0, 52, 53, 68, 189, 55, 56, 57, 58,
+ 59, 60, 61, 62, 63, 64, 65, 66, 67, 15,
+ 0, 16, 0, 0, 69, 0, 0, 70, 0, 0,
+ 71, 0, 72, 0, 0, 0, 0, 0, 0, 0,
+ 0, 0, 68, 0, 0, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 0, 0, 69, 0, 0, 70, 0, 0, 71, 0,
+ 72, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 107, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 0, 108, 0, 0, 0, 0, 0, 0, 0, 0,
+ 69, 109, 110, 70, 0, 0, 71, 0, 72, 0,
+ 111, 112, 113, 114, 115, 116, 117, 118, 119, 120,
+ 121, 122, 123, 124, 125, 126, 127, 128, 129, 130,
+ 131, 132, 133, 0, 0, 134, 135, 136, 137, 138,
+ 139, 140, 141, 142, 143, 144
+ };
+
+ static const short yycheck[] = { 29,
+ 113, 113, 2, 44, 206, 72, 96, 29, 252, 23,
+ 58, 114, 243, 244, 44, 34, 30, 108, 434, 15,
+ 111, 10, 11, 12, 13, 14, 15, 16, 17, 0,
+ 15, 9, 108, 33, 450, 54, 102, 113, 105, 104,
+ 20, 272, 133, 21, 110, 136, 137, 150, 113, 140,
+ 141, 142, 143, 144, 25, 23, 110, 148, 54, 113,
+ 31, 41, 42, 43, 44, 95, 96, 47, 101, 54,
+ 41, 42, 43, 44, 74, 10, 11, 12, 13, 14,
+ 15, 16, 17, 58, 102, 102, 24, 102, 59, 111,
+ 102, 102, 449, 108, 112, 112, 108, 101, 112, 110,
+ 457, 131, 132, 4, 134, 135, 61, 62, 63, 64,
+ 101, 178, 179, 180, 358, 145, 146, 147, 20, 108,
+ 22, 104, 24, 49, 50, 51, 22, 101, 24, 31,
+ 32, 33, 101, 224, 32, 33, 52, 53, 4, 41,
+ 42, 43, 44, 106, 176, 47, 48, 88, 89, 27,
+ 28, 4, 182, 55, 186, 3, 4, 59, 4, 191,
+ 192, 3, 4, 204, 3, 4, 3, 4, 3, 4,
+ 104, 203, 24, 108, 204, 4, 208, 24, 380, 107,
+ 382, 222, 107, 104, 56, 4, 218, 219, 220, 4,
+ 4, 4, 222, 223, 261, 7, 7, 4, 289, 7,
+ 291, 292, 102, 106, 36, 102, 105, 298, 102, 102,
+ 102, 102, 242, 243, 244, 305, 306, 307, 308, 102,
+ 102, 102, 102, 102, 24, 102, 316, 317, 318, 319,
+ 10, 11, 12, 13, 14, 15, 16, 17, 24, 104,
+ 104, 104, 272, 105, 104, 104, 104, 104, 280, 104,
+ 60, 102, 102, 102, 286, 34, 24, 257, 288, 102,
+ 290, 106, 102, 293, 294, 21, 102, 299, 300, 102,
+ 21, 102, 4, 363, 104, 305, 306, 307, 308, 102,
+ 102, 102, 24, 4, 104, 102, 316, 317, 318, 319,
+ 36, 54, 4, 102, 24, 325, 387, 388, 102, 102,
+ 102, 102, 334, 102, 336, 102, 102, 102, 340, 399,
+ 400, 105, 402, 403, 404, 405, 348, 349, 350, 102,
+ 105, 434, 434, 54, 354, 416, 108, 102, 106, 105,
+ 191, 192, 105, 363, 105, 105, 105, 450, 450, 105,
+ 105, 21, 203, 36, 108, 377, 378, 208, 21, 102,
+ 105, 441, 21, 385, 102, 69, 21, 218, 219, 220,
+ 21, 393, 0, 0, 84, 84, 84, 84, 398, 399,
+ 400, 33, 402, 403, 404, 405, 5, 6, 20, 326,
+ 105, 325, 46, 176, 43, 2, 418, 23, 14, 337,
+ 392, -1, 359, 22, -1, 24, -1, 26, -1, -1,
+ -1, -1, -1, -1, -1, -1, -1, -1, -1, 38,
+ 39, 441, -1, -1, -1, 447, -1, -1, -1, 280,
+ -1, -1, -1, -1, -1, 286, 458, -1, -1, -1,
+ -1, 463, -1, -1, -1, 467, 468, -1, 299, 300,
+ -1, -1, 71, 72, 73, 74, 75, 76, 77, 78,
+ 79, 80, 81, 82, 83, 84, -1, -1, -1, -1,
+ -1, 90, -1, 92, 93, 94, 95, -1, 97, -1,
+ -1, -1, -1, 334, -1, 336, -1, 106, -1, 340,
+ 109, -1, 111, -1, -1, 114, -1, 348, 349, 350,
+ -1, -1, -1, -1, 5, 6, -1, 8, 9, 10,
+ 11, 12, 13, 14, 15, 16, 17, 18, 19, 20,
+ 21, 22, -1, 24, -1, -1, 377, 378, -1, -1,
+ -1, -1, -1, -1, 385, -1, -1, -1, -1, -1,
+ -1, -1, 393, -1, 45, 5, 6, -1, 8, 9,
+ 10, 11, 12, 13, 14, 15, 16, 17, 18, 19,
+ 20, 21, 22, -1, 24, -1, -1, 418, -1, -1,
+ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+ -1, -1, -1, -1, -1, 45, -1, -1, -1, -1,
+ -1, -1, -1, -1, -1, -1, 447, -1, -1, -1,
+ -1, -1, 103, -1, -1, 106, -1, 458, 109, -1,
+ 111, 112, 463, -1, -1, -1, 467, 468, -1, -1,
+ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+ -1, -1, -1, -1, 3, 4, 5, 6, 7, -1,
+ -1, -1, -1, 103, -1, -1, 106, -1, -1, 109,
+ -1, 111, 112, 22, -1, 24, -1, 26, 27, 28,
+ -1, -1, -1, -1, -1, -1, -1, -1, -1, 38,
+ 39, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+ -1, -1, -1, -1, -1, -1, -1, -1, -1, 58,
+ -1, -1, -1, -1, 3, 4, -1, -1, 7, -1,
+ -1, -1, 71, 72, 73, 74, 75, 76, 77, 78,
+ 79, 80, 81, 82, 83, 84, -1, 26, 27, 28,
+ -1, 90, -1, 92, 93, 94, 95, -1, 97, 38,
+ 39, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+ 109, -1, -1, -1, -1, -1, -1, -1, -1, 58,
+ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+ -1, -1, 71, 72, 73, 74, 75, 76, 77, 78,
+ 79, 80, 81, 82, 83, 84, -1, -1, -1, -1,
+ -1, 90, -1, 92, 93, 94, 95, -1, 97, -1,
+ -1, -1, -1, -1, -1, -1, -1, -1, 5, 6,
+ 109, 8, 9, 10, 11, 12, 13, 14, 15, 16,
+ 17, 18, 19, 20, 21, 22, -1, 24, -1, -1,
+ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+ 37, -1, -1, -1, -1, -1, 5, 6, 45, 8,
+ 9, 10, 11, 12, 13, 14, 15, 16, 17, 18,
+ 19, 20, 21, 22, -1, 24, -1, -1, -1, -1,
+ -1, -1, -1, -1, -1, -1, -1, -1, 37, -1,
+ -1, -1, -1, -1, 5, 6, 45, 8, 9, 10,
+ 11, 12, 13, 14, 15, 16, 17, 18, 19, 20,
+ 21, 22, -1, 24, -1, -1, 103, -1, -1, 106,
+ -1, -1, 109, -1, 111, -1, -1, -1, -1, -1,
+ -1, -1, 5, 6, 45, 8, 9, 10, 11, 12,
+ 13, 14, 15, 16, 17, 18, 19, 20, 21, 22,
+ -1, 24, -1, -1, 103, -1, -1, 106, -1, -1,
+ 109, -1, 111, -1, 37, -1, -1, -1, -1, -1,
+ 5, 6, 45, 8, 9, 10, 11, 12, 13, 14,
+ 15, 16, 17, 18, 19, 20, 21, 22, -1, 24,
+ -1, -1, 103, -1, -1, 106, -1, 108, 109, -1,
+ 111, -1, 37, -1, -1, -1, -1, -1, 5, 6,
+ 45, 8, 9, 10, 11, 12, 13, 14, 15, 16,
+ 17, 18, 19, 20, 21, 22, -1, 24, -1, -1,
+ 103, -1, -1, 106, -1, -1, 109, -1, 111, -1,
+ -1, -1, -1, -1, -1, -1, 5, 6, 45, 8,
+ 9, 10, 11, 12, 13, 14, 15, 16, 17, 18,
+ 19, 20, 21, 22, -1, 24, -1, -1, 103, -1,
+ -1, 106, -1, -1, 109, -1, 111, -1, -1, -1,
+ -1, -1, -1, -1, 5, 6, 45, 8, 9, 10,
+ 11, 12, 13, 14, 15, 16, 17, 18, 19, 20,
+ 21, 22, -1, 24, -1, -1, 103, -1, -1, 106,
+ -1, -1, 109, -1, 111, -1, -1, -1, -1, -1,
+ -1, -1, 5, 6, 45, 8, 9, 10, 11, 12,
+ 13, 14, 15, 16, 17, 18, 19, 20, 21, 22,
+ -1, 24, -1, -1, 103, -1, -1, 106, -1, -1,
+ 109, -1, 111, -1, -1, -1, -1, -1, -1, -1,
+ -1, -1, 45, -1, -1, -1, -1, -1, -1, -1,
+ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+ -1, -1, 103, -1, -1, 106, -1, -1, 109, -1,
+ 111, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+ 35, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+ -1, 46, -1, -1, -1, -1, -1, -1, -1, -1,
+ 103, 56, 57, 106, -1, -1, 109, -1, 111, -1,
+ 65, 66, 67, 68, 69, 70, 71, 72, 73, 74,
+ 75, 76, 77, 78, 79, 80, 81, 82, 83, 84,
+ 85, 86, 87, -1, -1, 90, 91, 92, 93, 94,
+ 95, 96, 97, 98, 99, 100
+ };
+ /* -*-C-*- Note some compilers choke on comments on `#line' lines. */
+ #line 3 "/usr/share/bison.simple"
+ /* This file comes from bison-1.28. */
+
+ /* Skeleton output parser for bison,
+ Copyright (C) 1984, 1989, 1990 Free Software Foundation, Inc.
+
+ This program is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 2, or (at your option)
+ any later version.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program; if not, write to the Free Software
+ Foundation, Inc., 59 Temple Place - Suite 330,
+ Boston, MA 02111-1307, USA. */
+
+ /* As a special exception, when this file is copied by Bison into a
+ Bison output file, you may use that output file without restriction.
+ This special exception was added by the Free Software Foundation
+ in version 1.24 of Bison. */
+
+ /* This is the parser code that is written into each bison parser
+ when the %semantic_parser declaration is not specified in the grammar.
+ It was written by Richard Stallman by simplifying the hairy parser
+ used when %semantic_parser is specified. */
+
+ #ifndef YYSTACK_USE_ALLOCA
+ #ifdef alloca
+ #define YYSTACK_USE_ALLOCA
+ #else /* alloca not defined */
+ #ifdef __GNUC__
+ #define YYSTACK_USE_ALLOCA
+ #define alloca __builtin_alloca
+ #else /* not GNU C. */
+ #if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi) || (defined (__sun) && defined (__i386))
+ #define YYSTACK_USE_ALLOCA
+ #include <alloca.h>
+ #else /* not sparc */
+ /* We think this test detects Watcom and Microsoft C. */
+ /* This used to test MSDOS, but that is a bad idea
+ since that symbol is in the user namespace. */
+ #if (defined (_MSDOS) || defined (_MSDOS_)) && !defined (__TURBOC__)
+ #if 0 /* No need for malloc.h, which pollutes the namespace;
+ instead, just don't use alloca. */
+ #include <malloc.h>
+ #endif
+ #else /* not MSDOS, or __TURBOC__ */
+ #if defined(_AIX)
+ /* I don't know what this was needed for, but it pollutes the namespace.
+ So I turned it off. rms, 2 May 1997. */
+ /* #include <malloc.h> */
+ #pragma alloca
+ #define YYSTACK_USE_ALLOCA
+ #else /* not MSDOS, or __TURBOC__, or _AIX */
+ #if 0
+ #ifdef __hpux /* haible at ilog.fr says this works for HPUX 9.05 and up,
+ and on HPUX 10. Eventually we can turn this on. */
+ #define YYSTACK_USE_ALLOCA
+ #define alloca __builtin_alloca
+ #endif /* __hpux */
+ #endif
+ #endif /* not _AIX */
+ #endif /* not MSDOS, or __TURBOC__ */
+ #endif /* not sparc */
+ #endif /* not GNU C */
+ #endif /* alloca not defined */
+ #endif /* YYSTACK_USE_ALLOCA not defined */
+
+ #ifdef YYSTACK_USE_ALLOCA
+ #define YYSTACK_ALLOC alloca
+ #else
+ #define YYSTACK_ALLOC malloc
+ #endif
+
+ /* Note: there must be only one dollar sign in this file.
+ It is replaced by the list of actions, each action
+ as one case of the switch. */
+
+ #define yyerrok (yyerrstatus = 0)
+ #define yyclearin (yychar = YYEMPTY)
+ #define YYEMPTY -2
+ #define YYEOF 0
+ #define YYACCEPT goto yyacceptlab
+ #define YYABORT goto yyabortlab
+ #define YYERROR goto yyerrlab1
+ /* Like YYERROR except do call yyerror.
+ This remains here temporarily to ease the
+ transition to the new meaning of YYERROR, for GCC.
+ Once GCC version 2 has supplanted version 1, this can go. */
+ #define YYFAIL goto yyerrlab
+ #define YYRECOVERING() (!!yyerrstatus)
+ #define YYBACKUP(token, value) \
+ do \
+ if (yychar == YYEMPTY && yylen == 1) \
+ { yychar = (token), yylval = (value); \
+ yychar1 = YYTRANSLATE (yychar); \
+ YYPOPSTACK; \
+ goto yybackup; \
+ } \
+ else \
+ { yyerror ("syntax error: cannot back up"); YYERROR; } \
+ while (0)
+
+ #define YYTERROR 1
+ #define YYERRCODE 256
+
+ #ifndef YYPURE
+ #define YYLEX yylex()
+ #endif
+
+ #ifdef YYPURE
+ #ifdef YYLSP_NEEDED
+ #ifdef YYLEX_PARAM
+ #define YYLEX yylex(&yylval, &yylloc, YYLEX_PARAM)
+ #else
+ #define YYLEX yylex(&yylval, &yylloc)
+ #endif
+ #else /* not YYLSP_NEEDED */
+ #ifdef YYLEX_PARAM
+ #define YYLEX yylex(&yylval, YYLEX_PARAM)
+ #else
+ #define YYLEX yylex(&yylval)
+ #endif
+ #endif /* not YYLSP_NEEDED */
+ #endif
+
+ /* If nonreentrant, generate the variables here */
+
+ #ifndef YYPURE
+
+ int yychar; /* the lookahead symbol */
+ YYSTYPE yylval; /* the semantic value of the */
+ /* lookahead symbol */
+
+ #ifdef YYLSP_NEEDED
+ YYLTYPE yylloc; /* location data for the lookahead */
+ /* symbol */
+ #endif
+
+ int yynerrs; /* number of parse errors so far */
+ #endif /* not YYPURE */
+
+ #if YYDEBUG != 0
+ int yydebug; /* nonzero means print parse trace */
+ /* Since this is uninitialized, it does not stop multiple parsers
+ from coexisting. */
+ #endif
+
+ /* YYINITDEPTH indicates the initial size of the parser's stacks */
+
+ #ifndef YYINITDEPTH
+ #define YYINITDEPTH 200
+ #endif
+
+ /* YYMAXDEPTH is the maximum size the stacks can grow to
+ (effective only if the built-in stack extension method is used). */
+
+ #if YYMAXDEPTH == 0
+ #undef YYMAXDEPTH
+ #endif
+
+ #ifndef YYMAXDEPTH
+ #define YYMAXDEPTH 10000
+ #endif
+
+ /* Define __yy_memcpy. Note that the size argument
+ should be passed with type unsigned int, because that is what the non-GCC
+ definitions require. With GCC, __builtin_memcpy takes an arg
+ of type size_t, but it can handle unsigned int. */
+
+ #if __GNUC__ > 1 /* GNU C and GNU C++ define this. */
+ #define __yy_memcpy(TO,FROM,COUNT) __builtin_memcpy(TO,FROM,COUNT)
+ #else /* not GNU C or C++ */
+ #ifndef __cplusplus
+
+ /* This is the most reliable way to avoid incompatibilities
+ in available built-in functions on various systems. */
+ static void
+ __yy_memcpy (to, from, count)
+ char *to;
+ char *from;
+ unsigned int count;
+ {
+ register char *f = from;
+ register char *t = to;
+ register int i = count;
+
+ while (i-- > 0)
+ *t++ = *f++;
+ }
+
+ #else /* __cplusplus */
+
+ /* This is the most reliable way to avoid incompatibilities
+ in available built-in functions on various systems. */
+ static void
+ __yy_memcpy (char *to, char *from, unsigned int count)
+ {
+ register char *t = to;
+ register char *f = from;
+ register int i = count;
+
+ while (i-- > 0)
+ *t++ = *f++;
+ }
+
+ #endif
+ #endif
+
+ #line 217 "/usr/share/bison.simple"
+
+ /* The user can define YYPARSE_PARAM as the name of an argument to be passed
+ into yyparse. The argument should have type void *.
+ It should actually point to an object.
+ Grammar actions can access the variable by casting it
+ to the proper pointer type. */
+
+ #ifdef YYPARSE_PARAM
+ #ifdef __cplusplus
+ #define YYPARSE_PARAM_ARG void *YYPARSE_PARAM
+ #define YYPARSE_PARAM_DECL
+ #else /* not __cplusplus */
+ #define YYPARSE_PARAM_ARG YYPARSE_PARAM
+ #define YYPARSE_PARAM_DECL void *YYPARSE_PARAM;
+ #endif /* not __cplusplus */
+ #else /* not YYPARSE_PARAM */
+ #define YYPARSE_PARAM_ARG
+ #define YYPARSE_PARAM_DECL
+ #endif /* not YYPARSE_PARAM */
+
+ /* Prevent warning if -Wstrict-prototypes. */
+ #ifdef __GNUC__
+ #ifdef YYPARSE_PARAM
+ int yyparse (void *);
+ #else
+ int yyparse (void);
+ #endif
+ #endif
+
+ int
+ yyparse(YYPARSE_PARAM_ARG)
+ YYPARSE_PARAM_DECL
+ {
+ register int yystate;
+ register int yyn;
+ register short *yyssp;
+ register YYSTYPE *yyvsp;
+ int yyerrstatus; /* number of tokens to shift before error messages enabled */
+ int yychar1 = 0; /* lookahead token as an internal (translated) token number */
+
+ short yyssa[YYINITDEPTH]; /* the state stack */
+ YYSTYPE yyvsa[YYINITDEPTH]; /* the semantic value stack */
+
+ short *yyss = yyssa; /* refer to the stacks thru separate pointers */
+ YYSTYPE *yyvs = yyvsa; /* to allow yyoverflow to reallocate them elsewhere */
+
+ #ifdef YYLSP_NEEDED
+ YYLTYPE yylsa[YYINITDEPTH]; /* the location stack */
+ YYLTYPE *yyls = yylsa;
+ YYLTYPE *yylsp;
+
+ #define YYPOPSTACK (yyvsp--, yyssp--, yylsp--)
+ #else
+ #define YYPOPSTACK (yyvsp--, yyssp--)
+ #endif
+
+ int yystacksize = YYINITDEPTH;
+ int yyfree_stacks = 0;
+
+ #ifdef YYPURE
+ int yychar;
+ YYSTYPE yylval;
+ int yynerrs;
+ #ifdef YYLSP_NEEDED
+ YYLTYPE yylloc;
+ #endif
+ #endif
+
+ YYSTYPE yyval; /* the variable used to return */
+ /* semantic values from the action */
+ /* routines */
+
+ int yylen;
+
+ #if YYDEBUG != 0
+ if (yydebug)
+ fprintf(stderr, "Starting parse\n");
+ #endif
+
+ yystate = 0;
+ yyerrstatus = 0;
+ yynerrs = 0;
+ yychar = YYEMPTY; /* Cause a token to be read. */
+
+ /* Initialize stack pointers.
+ Waste one element of value and location stack
+ so that they stay on the same level as the state stack.
+ The wasted elements are never initialized. */
+
+ yyssp = yyss - 1;
+ yyvsp = yyvs;
+ #ifdef YYLSP_NEEDED
+ yylsp = yyls;
+ #endif
+
+ /* Push a new state, which is found in yystate . */
+ /* In all cases, when you get here, the value and location stacks
+ have just been pushed. so pushing a state here evens the stacks. */
+ yynewstate:
+
+ *++yyssp = yystate;
+
+ if (yyssp >= yyss + yystacksize - 1)
+ {
+ /* Give user a chance to reallocate the stack */
+ /* Use copies of these so that the &'s don't force the real ones into memory. */
+ YYSTYPE *yyvs1 = yyvs;
+ short *yyss1 = yyss;
+ #ifdef YYLSP_NEEDED
+ YYLTYPE *yyls1 = yyls;
+ #endif
+
+ /* Get the current used size of the three stacks, in elements. */
+ int size = yyssp - yyss + 1;
+
+ #ifdef yyoverflow
+ /* Each stack pointer address is followed by the size of
+ the data in use in that stack, in bytes. */
+ #ifdef YYLSP_NEEDED
+ /* This used to be a conditional around just the two extra args,
+ but that might be undefined if yyoverflow is a macro. */
+ yyoverflow("parser stack overflow",
+ &yyss1, size * sizeof (*yyssp),
+ &yyvs1, size * sizeof (*yyvsp),
+ &yyls1, size * sizeof (*yylsp),
+ &yystacksize);
+ #else
+ yyoverflow("parser stack overflow",
+ &yyss1, size * sizeof (*yyssp),
+ &yyvs1, size * sizeof (*yyvsp),
+ &yystacksize);
+ #endif
+
+ yyss = yyss1; yyvs = yyvs1;
+ #ifdef YYLSP_NEEDED
+ yyls = yyls1;
+ #endif
+ #else /* no yyoverflow */
+ /* Extend the stack our own way. */
+ if (yystacksize >= YYMAXDEPTH)
+ {
+ yyerror("parser stack overflow");
+ if (yyfree_stacks)
+ {
+ free (yyss);
+ free (yyvs);
+ #ifdef YYLSP_NEEDED
+ free (yyls);
+ #endif
+ }
+ return 2;
+ }
+ yystacksize *= 2;
+ if (yystacksize > YYMAXDEPTH)
+ yystacksize = YYMAXDEPTH;
+ #ifndef YYSTACK_USE_ALLOCA
+ yyfree_stacks = 1;
+ #endif
+ yyss = (short *) YYSTACK_ALLOC (yystacksize * sizeof (*yyssp));
+ __yy_memcpy ((char *)yyss, (char *)yyss1,
+ size * (unsigned int) sizeof (*yyssp));
+ yyvs = (YYSTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yyvsp));
+ __yy_memcpy ((char *)yyvs, (char *)yyvs1,
+ size * (unsigned int) sizeof (*yyvsp));
+ #ifdef YYLSP_NEEDED
+ yyls = (YYLTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yylsp));
+ __yy_memcpy ((char *)yyls, (char *)yyls1,
+ size * (unsigned int) sizeof (*yylsp));
+ #endif
+ #endif /* no yyoverflow */
+
+ yyssp = yyss + size - 1;
+ yyvsp = yyvs + size - 1;
+ #ifdef YYLSP_NEEDED
+ yylsp = yyls + size - 1;
+ #endif
+
+ #if YYDEBUG != 0
+ if (yydebug)
+ fprintf(stderr, "Stack size increased to %d\n", yystacksize);
+ #endif
+
+ if (yyssp >= yyss + yystacksize - 1)
+ YYABORT;
+ }
+
+ #if YYDEBUG != 0
+ if (yydebug)
+ fprintf(stderr, "Entering state %d\n", yystate);
+ #endif
+
+ goto yybackup;
+ yybackup:
+
+ /* Do appropriate processing given the current state. */
+ /* Read a lookahead token if we need one and don't already have one. */
+ /* yyresume: */
+
+ /* First try to decide what to do without reference to lookahead token. */
+
+ yyn = yypact[yystate];
+ if (yyn == YYFLAG)
+ goto yydefault;
+
+ /* Not known => get a lookahead token if don't already have one. */
+
+ /* yychar is either YYEMPTY or YYEOF
+ or a valid token in external form. */
+
+ if (yychar == YYEMPTY)
+ {
+ #if YYDEBUG != 0
+ if (yydebug)
+ fprintf(stderr, "Reading a token: ");
+ #endif
+ yychar = YYLEX;
+ }
+
+ /* Convert token to internal form (in yychar1) for indexing tables with */
+
+ if (yychar <= 0) /* This means end of input. */
+ {
+ yychar1 = 0;
+ yychar = YYEOF; /* Don't call YYLEX any more */
+
+ #if YYDEBUG != 0
+ if (yydebug)
+ fprintf(stderr, "Now at end of input.\n");
+ #endif
+ }
+ else
+ {
+ yychar1 = YYTRANSLATE(yychar);
+
+ #if YYDEBUG != 0
+ if (yydebug)
+ {
+ fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]);
+ /* Give the individual parser a way to print the precise meaning
+ of a token, for further debugging info. */
+ #ifdef YYPRINT
+ YYPRINT (stderr, yychar, yylval);
+ #endif
+ fprintf (stderr, ")\n");
+ }
+ #endif
+ }
+
+ yyn += yychar1;
+ if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1)
+ goto yydefault;
+
+ yyn = yytable[yyn];
+
+ /* yyn is what to do for this token type in this state.
+ Negative => reduce, -yyn is rule number.
+ Positive => shift, yyn is new state.
+ New state is final state => don't bother to shift,
+ just return success.
+ 0, or most negative number => error. */
+
+ if (yyn < 0)
+ {
+ if (yyn == YYFLAG)
+ goto yyerrlab;
+ yyn = -yyn;
+ goto yyreduce;
+ }
+ else if (yyn == 0)
+ goto yyerrlab;
+
+ if (yyn == YYFINAL)
+ YYACCEPT;
+
+ /* Shift the lookahead token. */
+
+ #if YYDEBUG != 0
+ if (yydebug)
+ fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]);
+ #endif
+
+ /* Discard the token being shifted unless it is eof. */
+ if (yychar != YYEOF)
+ yychar = YYEMPTY;
+
+ *++yyvsp = yylval;
+ #ifdef YYLSP_NEEDED
+ *++yylsp = yylloc;
+ #endif
+
+ /* count tokens shifted since error; after three, turn off error status. */
+ if (yyerrstatus) yyerrstatus--;
+
+ yystate = yyn;
+ goto yynewstate;
+
+ /* Do the default action for the current state. */
+ yydefault:
+
+ yyn = yydefact[yystate];
+ if (yyn == 0)
+ goto yyerrlab;
+
+ /* Do a reduction. yyn is the number of a rule to reduce with. */
+ yyreduce:
+ yylen = yyr2[yyn];
+ if (yylen > 0)
+ yyval = yyvsp[1-yylen]; /* implement default value of the action */
+
+ #if YYDEBUG != 0
+ if (yydebug)
+ {
+ int i;
+
+ fprintf (stderr, "Reducing via rule %d (line %d), ",
+ yyn, yyrline[yyn]);
+
+ /* Print the symbols being reduced, and their result. */
+ for (i = yyprhs[yyn]; yyrhs[i] > 0; i++)
+ fprintf (stderr, "%s ", yytname[yyrhs[i]]);
+ fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]);
+ }
+ #endif
+
+
+ switch (yyn) {
+
+ case 2:
+ #line 1011 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (yyvsp[0].UIntVal > (uint32_t)INT32_MAX) // Outside of my range!
+ ThrowException("Value too large for type!");
+ yyval.SIntVal = (int32_t)yyvsp[0].UIntVal;
+ ;
+ break;}
+ case 4:
+ #line 1019 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (yyvsp[0].UInt64Val > (uint64_t)INT64_MAX) // Outside of my range!
+ ThrowException("Value too large for type!");
+ yyval.SInt64Val = (int64_t)yyvsp[0].UInt64Val;
+ ;
+ break;}
+ case 33:
+ #line 1042 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.StrVal = yyvsp[-1].StrVal;
+ ;
+ break;}
+ case 34:
+ #line 1045 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.StrVal = 0;
+ ;
+ break;}
+ case 35:
+ #line 1049 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.Linkage = GlobalValue::InternalLinkage; ;
+ break;}
+ case 36:
+ #line 1050 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.Linkage = GlobalValue::LinkOnceLinkage; ;
+ break;}
+ case 37:
+ #line 1051 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.Linkage = GlobalValue::WeakLinkage; ;
+ break;}
+ case 38:
+ #line 1052 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.Linkage = GlobalValue::AppendingLinkage; ;
+ break;}
+ case 39:
+ #line 1053 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.Linkage = GlobalValue::ExternalLinkage; ;
+ break;}
+ case 40:
+ #line 1055 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.UIntVal = CallingConv::C; ;
+ break;}
+ case 41:
+ #line 1056 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.UIntVal = CallingConv::C; ;
+ break;}
+ case 42:
+ #line 1057 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.UIntVal = CallingConv::Fast; ;
+ break;}
+ case 43:
+ #line 1058 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.UIntVal = CallingConv::Cold; ;
+ break;}
+ case 44:
+ #line 1059 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if ((unsigned)yyvsp[0].UInt64Val != yyvsp[0].UInt64Val)
+ ThrowException("Calling conv too large!");
+ yyval.UIntVal = yyvsp[0].UInt64Val;
+ ;
+ break;}
+ case 45:
+ #line 1067 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.UIntVal = 0; ;
+ break;}
+ case 46:
+ #line 1068 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.UIntVal = yyvsp[0].UInt64Val;
+ if (yyval.UIntVal != 0 && !isPowerOf2_32(yyval.UIntVal))
+ ThrowException("Alignment must be a power of two!");
+ ;
+ break;}
+ case 47:
+ #line 1073 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.UIntVal = 0; ;
+ break;}
+ case 48:
+ #line 1074 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.UIntVal = yyvsp[0].UInt64Val;
+ if (yyval.UIntVal != 0 && !isPowerOf2_32(yyval.UIntVal))
+ ThrowException("Alignment must be a power of two!");
+ ;
+ break;}
+ case 49:
+ #line 1081 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ for (unsigned i = 0, e = strlen(yyvsp[0].StrVal); i != e; ++i)
+ if (yyvsp[0].StrVal[i] == '"' || yyvsp[0].StrVal[i] == '\\')
+ ThrowException("Invalid character in section name!");
+ yyval.StrVal = yyvsp[0].StrVal;
+ ;
+ break;}
+ case 50:
+ #line 1088 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.StrVal = 0; ;
+ break;}
+ case 51:
+ #line 1089 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.StrVal = yyvsp[0].StrVal; ;
+ break;}
+ case 52:
+ #line 1094 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {;
+ break;}
+ case 53:
+ #line 1095 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {;
+ break;}
+ case 54:
+ #line 1096 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ CurGV->setSection(yyvsp[0].StrVal);
+ free(yyvsp[0].StrVal);
+ ;
+ break;}
+ case 55:
+ #line 1100 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (yyvsp[0].UInt64Val != 0 && !isPowerOf2_32(yyvsp[0].UInt64Val))
+ ThrowException("Alignment must be a power of two!");
+ CurGV->setAlignment(yyvsp[0].UInt64Val);
+ ;
+ break;}
+ case 57:
+ #line 1113 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.TypeVal = new PATypeHolder(yyvsp[0].PrimType); ;
+ break;}
+ case 59:
+ #line 1114 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.TypeVal = new PATypeHolder(yyvsp[0].PrimType); ;
+ break;}
+ case 60:
+ #line 1116 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (!UpRefs.empty())
+ ThrowException("Invalid upreference in type: " + (*yyvsp[0].TypeVal)->getDescription());
+ yyval.TypeVal = yyvsp[0].TypeVal;
+ ;
+ break;}
+ case 74:
+ #line 1127 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.TypeVal = new PATypeHolder(OpaqueType::get());
+ ;
+ break;}
+ case 75:
+ #line 1130 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.TypeVal = new PATypeHolder(yyvsp[0].PrimType);
+ ;
+ break;}
+ case 76:
+ #line 1133 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Named types are also simple types...
+ yyval.TypeVal = new PATypeHolder(getTypeVal(yyvsp[0].ValIDVal));
+ ;
+ break;}
+ case 77:
+ #line 1139 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Type UpReference
+ if (yyvsp[0].UInt64Val > (uint64_t)~0U) ThrowException("Value out of range!");
+ OpaqueType *OT = OpaqueType::get(); // Use temporary placeholder
+ UpRefs.push_back(UpRefRecord((unsigned)yyvsp[0].UInt64Val, OT)); // Add to vector...
+ yyval.TypeVal = new PATypeHolder(OT);
+ UR_OUT("New Upreference!\n");
+ ;
+ break;}
+ case 78:
+ #line 1146 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Function derived type?
+ std::vector<const Type*> Params;
+ for (std::list<llvm::PATypeHolder>::iterator I = yyvsp[-1].TypeList->begin(),
+ E = yyvsp[-1].TypeList->end(); I != E; ++I)
+ Params.push_back(*I);
+ bool isVarArg = Params.size() && Params.back() == Type::VoidTy;
+ if (isVarArg) Params.pop_back();
+
+ yyval.TypeVal = new PATypeHolder(HandleUpRefs(FunctionType::get(*yyvsp[-3].TypeVal,Params,isVarArg)));
+ delete yyvsp[-1].TypeList; // Delete the argument list
+ delete yyvsp[-3].TypeVal; // Delete the return type handle
+ ;
+ break;}
+ case 79:
+ #line 1158 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Sized array type?
+ yyval.TypeVal = new PATypeHolder(HandleUpRefs(ArrayType::get(*yyvsp[-1].TypeVal, (unsigned)yyvsp[-3].UInt64Val)));
+ delete yyvsp[-1].TypeVal;
+ ;
+ break;}
+ case 80:
+ #line 1162 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Packed array type?
+ const llvm::Type* ElemTy = yyvsp[-1].TypeVal->get();
+ if ((unsigned)yyvsp[-3].UInt64Val != yyvsp[-3].UInt64Val)
+ ThrowException("Unsigned result not equal to signed result");
+ if (!ElemTy->isPrimitiveType())
+ ThrowException("Elemental type of a PackedType must be primitive");
+ if (!isPowerOf2_32(yyvsp[-3].UInt64Val))
+ ThrowException("Vector length should be a power of 2!");
+ yyval.TypeVal = new PATypeHolder(HandleUpRefs(PackedType::get(*yyvsp[-1].TypeVal, (unsigned)yyvsp[-3].UInt64Val)));
+ delete yyvsp[-1].TypeVal;
+ ;
+ break;}
+ case 81:
+ #line 1173 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Structure type?
+ std::vector<const Type*> Elements;
+ for (std::list<llvm::PATypeHolder>::iterator I = yyvsp[-1].TypeList->begin(),
+ E = yyvsp[-1].TypeList->end(); I != E; ++I)
+ Elements.push_back(*I);
+
+ yyval.TypeVal = new PATypeHolder(HandleUpRefs(StructType::get(Elements)));
+ delete yyvsp[-1].TypeList;
+ ;
+ break;}
+ case 82:
+ #line 1182 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Empty structure type?
+ yyval.TypeVal = new PATypeHolder(StructType::get(std::vector<const Type*>()));
+ ;
+ break;}
+ case 83:
+ #line 1185 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Pointer type?
+ yyval.TypeVal = new PATypeHolder(HandleUpRefs(PointerType::get(*yyvsp[-1].TypeVal)));
+ delete yyvsp[-1].TypeVal;
+ ;
+ break;}
+ case 84:
+ #line 1193 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.TypeList = new std::list<PATypeHolder>();
+ yyval.TypeList->push_back(*yyvsp[0].TypeVal); delete yyvsp[0].TypeVal;
+ ;
+ break;}
+ case 85:
+ #line 1197 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ (yyval.TypeList=yyvsp[-2].TypeList)->push_back(*yyvsp[0].TypeVal); delete yyvsp[0].TypeVal;
+ ;
+ break;}
+ case 87:
+ #line 1203 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ (yyval.TypeList=yyvsp[-2].TypeList)->push_back(Type::VoidTy);
+ ;
+ break;}
+ case 88:
+ #line 1206 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ (yyval.TypeList = new std::list<PATypeHolder>())->push_back(Type::VoidTy);
+ ;
+ break;}
+ case 89:
+ #line 1209 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.TypeList = new std::list<PATypeHolder>();
+ ;
+ break;}
+ case 90:
+ #line 1219 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Nonempty unsized arr
+ const ArrayType *ATy = dyn_cast<ArrayType>(yyvsp[-3].TypeVal->get());
+ if (ATy == 0)
+ ThrowException("Cannot make array constant with type: '" +
+ (*yyvsp[-3].TypeVal)->getDescription() + "'!");
+ const Type *ETy = ATy->getElementType();
+ int NumElements = ATy->getNumElements();
+
+ // Verify that we have the correct size...
+ if (NumElements != -1 && NumElements != (int)yyvsp[-1].ConstVector->size())
+ ThrowException("Type mismatch: constant sized array initialized with " +
+ utostr(yyvsp[-1].ConstVector->size()) + " arguments, but has size of " +
+ itostr(NumElements) + "!");
+
+ // Verify all elements are correct type!
+ for (unsigned i = 0; i < yyvsp[-1].ConstVector->size(); i++) {
+ if (ETy != (*yyvsp[-1].ConstVector)[i]->getType())
+ ThrowException("Element #" + utostr(i) + " is not of type '" +
+ ETy->getDescription() +"' as required!\nIt is of type '"+
+ (*yyvsp[-1].ConstVector)[i]->getType()->getDescription() + "'.");
+ }
+
+ yyval.ConstVal = ConstantArray::get(ATy, *yyvsp[-1].ConstVector);
+ delete yyvsp[-3].TypeVal; delete yyvsp[-1].ConstVector;
+ ;
+ break;}
+ case 91:
+ #line 1244 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ const ArrayType *ATy = dyn_cast<ArrayType>(yyvsp[-2].TypeVal->get());
+ if (ATy == 0)
+ ThrowException("Cannot make array constant with type: '" +
+ (*yyvsp[-2].TypeVal)->getDescription() + "'!");
+
+ int NumElements = ATy->getNumElements();
+ if (NumElements != -1 && NumElements != 0)
+ ThrowException("Type mismatch: constant sized array initialized with 0"
+ " arguments, but has size of " + itostr(NumElements) +"!");
+ yyval.ConstVal = ConstantArray::get(ATy, std::vector<Constant*>());
+ delete yyvsp[-2].TypeVal;
+ ;
+ break;}
+ case 92:
+ #line 1257 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ const ArrayType *ATy = dyn_cast<ArrayType>(yyvsp[-2].TypeVal->get());
+ if (ATy == 0)
+ ThrowException("Cannot make array constant with type: '" +
+ (*yyvsp[-2].TypeVal)->getDescription() + "'!");
+
+ int NumElements = ATy->getNumElements();
+ const Type *ETy = ATy->getElementType();
+ char *EndStr = UnEscapeLexed(yyvsp[0].StrVal, true);
+ if (NumElements != -1 && NumElements != (EndStr-yyvsp[0].StrVal))
+ ThrowException("Can't build string constant of size " +
+ itostr((int)(EndStr-yyvsp[0].StrVal)) +
+ " when array has size " + itostr(NumElements) + "!");
+ std::vector<Constant*> Vals;
+ if (ETy == Type::SByteTy) {
+ for (signed char *C = (signed char *)yyvsp[0].StrVal; C != (signed char *)EndStr; ++C)
+ Vals.push_back(ConstantSInt::get(ETy, *C));
+ } else if (ETy == Type::UByteTy) {
+ for (unsigned char *C = (unsigned char *)yyvsp[0].StrVal;
+ C != (unsigned char*)EndStr; ++C)
+ Vals.push_back(ConstantUInt::get(ETy, *C));
+ } else {
+ free(yyvsp[0].StrVal);
+ ThrowException("Cannot build string arrays of non byte sized elements!");
+ }
+ free(yyvsp[0].StrVal);
+ yyval.ConstVal = ConstantArray::get(ATy, Vals);
+ delete yyvsp[-2].TypeVal;
+ ;
+ break;}
+ case 93:
+ #line 1286 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Nonempty unsized arr
+ const PackedType *PTy = dyn_cast<PackedType>(yyvsp[-3].TypeVal->get());
+ if (PTy == 0)
+ ThrowException("Cannot make packed constant with type: '" +
+ (*yyvsp[-3].TypeVal)->getDescription() + "'!");
+ const Type *ETy = PTy->getElementType();
+ int NumElements = PTy->getNumElements();
+
+ // Verify that we have the correct size...
+ if (NumElements != -1 && NumElements != (int)yyvsp[-1].ConstVector->size())
+ ThrowException("Type mismatch: constant sized packed initialized with " +
+ utostr(yyvsp[-1].ConstVector->size()) + " arguments, but has size of " +
+ itostr(NumElements) + "!");
+
+ // Verify all elements are correct type!
+ for (unsigned i = 0; i < yyvsp[-1].ConstVector->size(); i++) {
+ if (ETy != (*yyvsp[-1].ConstVector)[i]->getType())
+ ThrowException("Element #" + utostr(i) + " is not of type '" +
+ ETy->getDescription() +"' as required!\nIt is of type '"+
+ (*yyvsp[-1].ConstVector)[i]->getType()->getDescription() + "'.");
+ }
+
+ yyval.ConstVal = ConstantPacked::get(PTy, *yyvsp[-1].ConstVector);
+ delete yyvsp[-3].TypeVal; delete yyvsp[-1].ConstVector;
+ ;
+ break;}
+ case 94:
+ #line 1311 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ const StructType *STy = dyn_cast<StructType>(yyvsp[-3].TypeVal->get());
+ if (STy == 0)
+ ThrowException("Cannot make struct constant with type: '" +
+ (*yyvsp[-3].TypeVal)->getDescription() + "'!");
+
+ if (yyvsp[-1].ConstVector->size() != STy->getNumContainedTypes())
+ ThrowException("Illegal number of initializers for structure type!");
+
+ // Check to ensure that constants are compatible with the type initializer!
+ for (unsigned i = 0, e = yyvsp[-1].ConstVector->size(); i != e; ++i)
+ if ((*yyvsp[-1].ConstVector)[i]->getType() != STy->getElementType(i))
+ ThrowException("Expected type '" +
+ STy->getElementType(i)->getDescription() +
+ "' for element #" + utostr(i) +
+ " of structure initializer!");
+
+ yyval.ConstVal = ConstantStruct::get(STy, *yyvsp[-1].ConstVector);
+ delete yyvsp[-3].TypeVal; delete yyvsp[-1].ConstVector;
+ ;
+ break;}
+ case 95:
+ #line 1331 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ const StructType *STy = dyn_cast<StructType>(yyvsp[-2].TypeVal->get());
+ if (STy == 0)
+ ThrowException("Cannot make struct constant with type: '" +
+ (*yyvsp[-2].TypeVal)->getDescription() + "'!");
+
+ if (STy->getNumContainedTypes() != 0)
+ ThrowException("Illegal number of initializers for structure type!");
+
+ yyval.ConstVal = ConstantStruct::get(STy, std::vector<Constant*>());
+ delete yyvsp[-2].TypeVal;
+ ;
+ break;}
+ case 96:
+ #line 1343 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ const PointerType *PTy = dyn_cast<PointerType>(yyvsp[-1].TypeVal->get());
+ if (PTy == 0)
+ ThrowException("Cannot make null pointer constant with type: '" +
+ (*yyvsp[-1].TypeVal)->getDescription() + "'!");
+
+ yyval.ConstVal = ConstantPointerNull::get(PTy);
+ delete yyvsp[-1].TypeVal;
+ ;
+ break;}
+ case 97:
+ #line 1352 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ConstVal = UndefValue::get(yyvsp[-1].TypeVal->get());
+ delete yyvsp[-1].TypeVal;
+ ;
+ break;}
+ case 98:
+ #line 1356 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ const PointerType *Ty = dyn_cast<PointerType>(yyvsp[-1].TypeVal->get());
+ if (Ty == 0)
+ ThrowException("Global const reference must be a pointer type!");
+
+ // ConstExprs can exist in the body of a function, thus creating
+ // GlobalValues whenever they refer to a variable. Because we are in
+ // the context of a function, getValNonImprovising will search the functions
+ // symbol table instead of the module symbol table for the global symbol,
+ // which throws things all off. To get around this, we just tell
+ // getValNonImprovising that we are at global scope here.
+ //
+ Function *SavedCurFn = CurFun.CurrentFunction;
+ CurFun.CurrentFunction = 0;
+
+ Value *V = getValNonImprovising(Ty, yyvsp[0].ValIDVal);
+
+ CurFun.CurrentFunction = SavedCurFn;
+
+ // If this is an initializer for a constant pointer, which is referencing a
+ // (currently) undefined variable, create a stub now that shall be replaced
+ // in the future with the right type of variable.
+ //
+ if (V == 0) {
+ assert(isa<PointerType>(Ty) && "Globals may only be used as pointers!");
+ const PointerType *PT = cast<PointerType>(Ty);
+
+ // First check to see if the forward references value is already created!
+ PerModuleInfo::GlobalRefsType::iterator I =
+ CurModule.GlobalRefs.find(std::make_pair(PT, yyvsp[0].ValIDVal));
+
+ if (I != CurModule.GlobalRefs.end()) {
+ V = I->second; // Placeholder already exists, use it...
+ yyvsp[0].ValIDVal.destroy();
+ } else {
+ std::string Name;
+ if (yyvsp[0].ValIDVal.Type == ValID::NameVal) Name = yyvsp[0].ValIDVal.Name;
+
+ // Create the forward referenced global.
+ GlobalValue *GV;
+ if (const FunctionType *FTy =
+ dyn_cast<FunctionType>(PT->getElementType())) {
+ GV = new Function(FTy, GlobalValue::ExternalLinkage, Name,
+ CurModule.CurrentModule);
+ } else {
+ GV = new GlobalVariable(PT->getElementType(), false,
+ GlobalValue::ExternalLinkage, 0,
+ Name, CurModule.CurrentModule);
+ }
+
+ // Keep track of the fact that we have a forward ref to recycle it
+ CurModule.GlobalRefs.insert(std::make_pair(std::make_pair(PT, yyvsp[0].ValIDVal), GV));
+ V = GV;
+ }
+ }
+
+ yyval.ConstVal = cast<GlobalValue>(V);
+ delete yyvsp[-1].TypeVal; // Free the type handle
+ ;
+ break;}
+ case 99:
+ #line 1415 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (yyvsp[-1].TypeVal->get() != yyvsp[0].ConstVal->getType())
+ ThrowException("Mismatched types for constant expression!");
+ yyval.ConstVal = yyvsp[0].ConstVal;
+ delete yyvsp[-1].TypeVal;
+ ;
+ break;}
+ case 100:
+ #line 1421 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ const Type *Ty = yyvsp[-1].TypeVal->get();
+ if (isa<FunctionType>(Ty) || Ty == Type::LabelTy || isa<OpaqueType>(Ty))
+ ThrowException("Cannot create a null initialized value of this type!");
+ yyval.ConstVal = Constant::getNullValue(Ty);
+ delete yyvsp[-1].TypeVal;
+ ;
+ break;}
+ case 101:
+ #line 1429 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { // integral constants
+ if (!ConstantSInt::isValueValidForType(yyvsp[-1].PrimType, yyvsp[0].SInt64Val))
+ ThrowException("Constant value doesn't fit in type!");
+ yyval.ConstVal = ConstantSInt::get(yyvsp[-1].PrimType, yyvsp[0].SInt64Val);
+ ;
+ break;}
+ case 102:
+ #line 1434 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { // integral constants
+ if (!ConstantUInt::isValueValidForType(yyvsp[-1].PrimType, yyvsp[0].UInt64Val))
+ ThrowException("Constant value doesn't fit in type!");
+ yyval.ConstVal = ConstantUInt::get(yyvsp[-1].PrimType, yyvsp[0].UInt64Val);
+ ;
+ break;}
+ case 103:
+ #line 1439 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Boolean constants
+ yyval.ConstVal = ConstantBool::True;
+ ;
+ break;}
+ case 104:
+ #line 1442 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Boolean constants
+ yyval.ConstVal = ConstantBool::False;
+ ;
+ break;}
+ case 105:
+ #line 1445 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Float & Double constants
+ if (!ConstantFP::isValueValidForType(yyvsp[-1].PrimType, yyvsp[0].FPVal))
+ ThrowException("Floating point constant invalid for type!!");
+ yyval.ConstVal = ConstantFP::get(yyvsp[-1].PrimType, yyvsp[0].FPVal);
+ ;
+ break;}
+ case 106:
+ #line 1452 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (!yyvsp[-3].ConstVal->getType()->isFirstClassType())
+ ThrowException("cast constant expression from a non-primitive type: '" +
+ yyvsp[-3].ConstVal->getType()->getDescription() + "'!");
+ if (!yyvsp[-1].TypeVal->get()->isFirstClassType())
+ ThrowException("cast constant expression to a non-primitive type: '" +
+ yyvsp[-1].TypeVal->get()->getDescription() + "'!");
+ yyval.ConstVal = ConstantExpr::getCast(yyvsp[-3].ConstVal, yyvsp[-1].TypeVal->get());
+ delete yyvsp[-1].TypeVal;
+ ;
+ break;}
+ case 107:
+ #line 1462 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (!isa<PointerType>(yyvsp[-2].ConstVal->getType()))
+ ThrowException("GetElementPtr requires a pointer operand!");
+
+ // LLVM 1.2 and earlier used ubyte struct indices. Convert any ubyte struct
+ // indices to uint struct indices for compatibility.
+ generic_gep_type_iterator<std::vector<Value*>::iterator>
+ GTI = gep_type_begin(yyvsp[-2].ConstVal->getType(), yyvsp[-1].ValueList->begin(), yyvsp[-1].ValueList->end()),
+ GTE = gep_type_end(yyvsp[-2].ConstVal->getType(), yyvsp[-1].ValueList->begin(), yyvsp[-1].ValueList->end());
+ for (unsigned i = 0, e = yyvsp[-1].ValueList->size(); i != e && GTI != GTE; ++i, ++GTI)
+ if (isa<StructType>(*GTI)) // Only change struct indices
+ if (ConstantUInt *CUI = dyn_cast<ConstantUInt>((*yyvsp[-1].ValueList)[i]))
+ if (CUI->getType() == Type::UByteTy)
+ (*yyvsp[-1].ValueList)[i] = ConstantExpr::getCast(CUI, Type::UIntTy);
+
+ const Type *IdxTy =
+ GetElementPtrInst::getIndexedType(yyvsp[-2].ConstVal->getType(), *yyvsp[-1].ValueList, true);
+ if (!IdxTy)
+ ThrowException("Index list invalid for constant getelementptr!");
+
+ std::vector<Constant*> IdxVec;
+ for (unsigned i = 0, e = yyvsp[-1].ValueList->size(); i != e; ++i)
+ if (Constant *C = dyn_cast<Constant>((*yyvsp[-1].ValueList)[i]))
+ IdxVec.push_back(C);
+ else
+ ThrowException("Indices to constant getelementptr must be constants!");
+
+ delete yyvsp[-1].ValueList;
+
+ yyval.ConstVal = ConstantExpr::getGetElementPtr(yyvsp[-2].ConstVal, IdxVec);
+ ;
+ break;}
+ case 108:
+ #line 1493 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (yyvsp[-5].ConstVal->getType() != Type::BoolTy)
+ ThrowException("Select condition must be of boolean type!");
+ if (yyvsp[-3].ConstVal->getType() != yyvsp[-1].ConstVal->getType())
+ ThrowException("Select operand types must match!");
+ yyval.ConstVal = ConstantExpr::getSelect(yyvsp[-5].ConstVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal);
+ ;
+ break;}
+ case 109:
+ #line 1500 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (yyvsp[-3].ConstVal->getType() != yyvsp[-1].ConstVal->getType())
+ ThrowException("Binary operator types must match!");
+ // HACK: llvm 1.3 and earlier used to emit invalid pointer constant exprs.
+ // To retain backward compatibility with these early compilers, we emit a
+ // cast to the appropriate integer type automatically if we are in the
+ // broken case. See PR424 for more information.
+ if (!isa<PointerType>(yyvsp[-3].ConstVal->getType())) {
+ yyval.ConstVal = ConstantExpr::get(yyvsp[-5].BinaryOpVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal);
+ } else {
+ const Type *IntPtrTy = 0;
+ switch (CurModule.CurrentModule->getPointerSize()) {
+ case Module::Pointer32: IntPtrTy = Type::IntTy; break;
+ case Module::Pointer64: IntPtrTy = Type::LongTy; break;
+ default: ThrowException("invalid pointer binary constant expr!");
+ }
+ yyval.ConstVal = ConstantExpr::get(yyvsp[-5].BinaryOpVal, ConstantExpr::getCast(yyvsp[-3].ConstVal, IntPtrTy),
+ ConstantExpr::getCast(yyvsp[-1].ConstVal, IntPtrTy));
+ yyval.ConstVal = ConstantExpr::getCast(yyval.ConstVal, yyvsp[-3].ConstVal->getType());
+ }
+ ;
+ break;}
+ case 110:
+ #line 1521 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (yyvsp[-3].ConstVal->getType() != yyvsp[-1].ConstVal->getType())
+ ThrowException("Logical operator types must match!");
+ if (!yyvsp[-3].ConstVal->getType()->isIntegral()) {
+ if (!isa<PackedType>(yyvsp[-3].ConstVal->getType()) ||
+ !cast<PackedType>(yyvsp[-3].ConstVal->getType())->getElementType()->isIntegral())
+ ThrowException("Logical operator requires integral operands!");
+ }
+ yyval.ConstVal = ConstantExpr::get(yyvsp[-5].BinaryOpVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal);
+ ;
+ break;}
+ case 111:
+ #line 1531 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (yyvsp[-3].ConstVal->getType() != yyvsp[-1].ConstVal->getType())
+ ThrowException("setcc operand types must match!");
+ yyval.ConstVal = ConstantExpr::get(yyvsp[-5].BinaryOpVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal);
+ ;
+ break;}
+ case 112:
+ #line 1536 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (yyvsp[-1].ConstVal->getType() != Type::UByteTy)
+ ThrowException("Shift count for shift constant must be unsigned byte!");
+ if (!yyvsp[-3].ConstVal->getType()->isInteger())
+ ThrowException("Shift constant expression requires integer operand!");
+ yyval.ConstVal = ConstantExpr::get(yyvsp[-5].OtherOpVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal);
+ ;
+ break;}
+ case 113:
+ #line 1543 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (!isa<PackedType>(yyvsp[-3].ConstVal->getType()))
+ ThrowException("First operand of extractelement must be "
+ "packed type!");
+ if (yyvsp[-1].ConstVal->getType() != Type::UIntTy)
+ ThrowException("Second operand of extractelement must be uint!");
+ yyval.ConstVal = ConstantExpr::getExtractElement(yyvsp[-3].ConstVal, yyvsp[-1].ConstVal);
+ ;
+ break;}
+ case 114:
+ #line 1553 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ (yyval.ConstVector = yyvsp[-2].ConstVector)->push_back(yyvsp[0].ConstVal);
+ ;
+ break;}
+ case 115:
+ #line 1556 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ConstVector = new std::vector<Constant*>();
+ yyval.ConstVector->push_back(yyvsp[0].ConstVal);
+ ;
+ break;}
+ case 116:
+ #line 1563 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.BoolVal = false; ;
+ break;}
+ case 117:
+ #line 1563 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.BoolVal = true; ;
+ break;}
+ case 118:
+ #line 1573 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ModuleVal = ParserResult = yyvsp[0].ModuleVal;
+ CurModule.ModuleDone();
+ ;
+ break;}
+ case 119:
+ #line 1580 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ModuleVal = yyvsp[-1].ModuleVal;
+ CurFun.FunctionDone();
+ ;
+ break;}
+ case 120:
+ #line 1584 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ModuleVal = yyvsp[-1].ModuleVal;
+ ;
+ break;}
+ case 121:
+ #line 1587 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ModuleVal = yyvsp[-3].ModuleVal;
+ ;
+ break;}
+ case 122:
+ #line 1590 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ModuleVal = yyvsp[-1].ModuleVal;
+ ;
+ break;}
+ case 123:
+ #line 1593 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ModuleVal = CurModule.CurrentModule;
+ // Emit an error if there are any unresolved types left.
+ if (!CurModule.LateResolveTypes.empty()) {
+ const ValID &DID = CurModule.LateResolveTypes.begin()->first;
+ if (DID.Type == ValID::NameVal)
+ ThrowException("Reference to an undefined type: '"+DID.getName() + "'");
+ else
+ ThrowException("Reference to an undefined type: #" + itostr(DID.Num));
+ }
+ ;
+ break;}
+ case 124:
+ #line 1606 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ // Eagerly resolve types. This is not an optimization, this is a
+ // requirement that is due to the fact that we could have this:
+ //
+ // %list = type { %list * }
+ // %list = type { %list * } ; repeated type decl
+ //
+ // If types are not resolved eagerly, then the two types will not be
+ // determined to be the same type!
+ //
+ ResolveTypeTo(yyvsp[-2].StrVal, *yyvsp[0].TypeVal);
+
+ if (!setTypeName(*yyvsp[0].TypeVal, yyvsp[-2].StrVal) && !yyvsp[-2].StrVal) {
+ // If this is a named type that is not a redefinition, add it to the slot
+ // table.
+ CurModule.Types.push_back(*yyvsp[0].TypeVal);
+ }
+
+ delete yyvsp[0].TypeVal;
+ ;
+ break;}
+ case 125:
+ #line 1626 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Function prototypes can be in const pool
+ ;
+ break;}
+ case 126:
+ #line 1628 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Asm blocks can be in the const pool
+ ;
+ break;}
+ case 127:
+ #line 1630 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (yyvsp[0].ConstVal == 0) ThrowException("Global value initializer is not a constant!");
+ CurGV = ParseGlobalVariable(yyvsp[-3].StrVal, yyvsp[-2].Linkage, yyvsp[-1].BoolVal, yyvsp[0].ConstVal->getType(), yyvsp[0].ConstVal);
+ ;
+ break;}
+ case 128:
+ #line 1633 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ CurGV = 0;
+ ;
+ break;}
+ case 129:
+ #line 1636 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ CurGV = ParseGlobalVariable(yyvsp[-3].StrVal, GlobalValue::ExternalLinkage,
+ yyvsp[-1].BoolVal, *yyvsp[0].TypeVal, 0);
+ delete yyvsp[0].TypeVal;
+ ;
+ break;}
+ case 130:
+ #line 1640 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ CurGV = 0;
+ ;
+ break;}
+ case 131:
+ #line 1643 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ ;
+ break;}
+ case 132:
+ #line 1645 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ ;
+ break;}
+ case 133:
+ #line 1647 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ ;
+ break;}
+ case 134:
+ #line 1651 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ const std::string &AsmSoFar = CurModule.CurrentModule->getModuleInlineAsm();
+ char *EndStr = UnEscapeLexed(yyvsp[0].StrVal, true);
+ std::string NewAsm(yyvsp[0].StrVal, EndStr);
+ free(yyvsp[0].StrVal);
+
+ if (AsmSoFar.empty())
+ CurModule.CurrentModule->setModuleInlineAsm(NewAsm);
+ else
+ CurModule.CurrentModule->setModuleInlineAsm(AsmSoFar+"\n"+NewAsm);
+ ;
+ break;}
+ case 135:
+ #line 1663 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.Endianness = Module::BigEndian; ;
+ break;}
+ case 136:
+ #line 1664 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.Endianness = Module::LittleEndian; ;
+ break;}
+ case 137:
+ #line 1666 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ CurModule.CurrentModule->setEndianness(yyvsp[0].Endianness);
+ ;
+ break;}
+ case 138:
+ #line 1669 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (yyvsp[0].UInt64Val == 32)
+ CurModule.CurrentModule->setPointerSize(Module::Pointer32);
+ else if (yyvsp[0].UInt64Val == 64)
+ CurModule.CurrentModule->setPointerSize(Module::Pointer64);
+ else
+ ThrowException("Invalid pointer size: '" + utostr(yyvsp[0].UInt64Val) + "'!");
+ ;
+ break;}
+ case 139:
+ #line 1677 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ CurModule.CurrentModule->setTargetTriple(yyvsp[0].StrVal);
+ free(yyvsp[0].StrVal);
+ ;
+ break;}
+ case 141:
+ #line 1684 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ CurModule.CurrentModule->addLibrary(yyvsp[0].StrVal);
+ free(yyvsp[0].StrVal);
+ ;
+ break;}
+ case 142:
+ #line 1688 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ CurModule.CurrentModule->addLibrary(yyvsp[0].StrVal);
+ free(yyvsp[0].StrVal);
+ ;
+ break;}
+ case 143:
+ #line 1692 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ ;
+ break;}
+ case 147:
+ #line 1701 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.StrVal = 0; ;
+ break;}
+ case 148:
+ #line 1703 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (*yyvsp[-1].TypeVal == Type::VoidTy)
+ ThrowException("void typed arguments are invalid!");
+ yyval.ArgVal = new std::pair<PATypeHolder*, char*>(yyvsp[-1].TypeVal, yyvsp[0].StrVal);
+ ;
+ break;}
+ case 149:
+ #line 1709 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ArgList = yyvsp[-2].ArgList;
+ yyvsp[-2].ArgList->push_back(*yyvsp[0].ArgVal);
+ delete yyvsp[0].ArgVal;
+ ;
+ break;}
+ case 150:
+ #line 1714 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ArgList = new std::vector<std::pair<PATypeHolder*,char*> >();
+ yyval.ArgList->push_back(*yyvsp[0].ArgVal);
+ delete yyvsp[0].ArgVal;
+ ;
+ break;}
+ case 151:
+ #line 1720 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ArgList = yyvsp[0].ArgList;
+ ;
+ break;}
+ case 152:
+ #line 1723 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ArgList = yyvsp[-2].ArgList;
+ yyval.ArgList->push_back(std::pair<PATypeHolder*,
+ char*>(new PATypeHolder(Type::VoidTy), 0));
+ ;
+ break;}
+ case 153:
+ #line 1728 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ArgList = new std::vector<std::pair<PATypeHolder*,char*> >();
+ yyval.ArgList->push_back(std::make_pair(new PATypeHolder(Type::VoidTy), (char*)0));
+ ;
+ break;}
+ case 154:
+ #line 1732 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ArgList = 0;
+ ;
+ break;}
+ case 155:
+ #line 1737 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ UnEscapeLexed(yyvsp[-5].StrVal);
+ std::string FunctionName(yyvsp[-5].StrVal);
+ free(yyvsp[-5].StrVal); // Free strdup'd memory!
+
+ if (!(*yyvsp[-6].TypeVal)->isFirstClassType() && *yyvsp[-6].TypeVal != Type::VoidTy)
+ ThrowException("LLVM functions cannot return aggregate types!");
+
+ std::vector<const Type*> ParamTypeList;
+ if (yyvsp[-3].ArgList) { // If there are arguments...
+ for (std::vector<std::pair<PATypeHolder*,char*> >::iterator I = yyvsp[-3].ArgList->begin();
+ I != yyvsp[-3].ArgList->end(); ++I)
+ ParamTypeList.push_back(I->first->get());
+ }
+
+ bool isVarArg = ParamTypeList.size() && ParamTypeList.back() == Type::VoidTy;
+ if (isVarArg) ParamTypeList.pop_back();
+
+ const FunctionType *FT = FunctionType::get(*yyvsp[-6].TypeVal, ParamTypeList, isVarArg);
+ const PointerType *PFT = PointerType::get(FT);
+ delete yyvsp[-6].TypeVal;
+
+ ValID ID;
+ if (!FunctionName.empty()) {
+ ID = ValID::create((char*)FunctionName.c_str());
+ } else {
+ ID = ValID::create((int)CurModule.Values[PFT].size());
+ }
+
+ Function *Fn = 0;
+ // See if this function was forward referenced. If so, recycle the object.
+ if (GlobalValue *FWRef = CurModule.GetForwardRefForGlobal(PFT, ID)) {
+ // Move the function to the end of the list, from whereever it was
+ // previously inserted.
+ Fn = cast<Function>(FWRef);
+ CurModule.CurrentModule->getFunctionList().remove(Fn);
+ CurModule.CurrentModule->getFunctionList().push_back(Fn);
+ } else if (!FunctionName.empty() && // Merge with an earlier prototype?
+ (Fn = CurModule.CurrentModule->getFunction(FunctionName, FT))) {
+ // If this is the case, either we need to be a forward decl, or it needs
+ // to be.
+ if (!CurFun.isDeclare && !Fn->isExternal())
+ ThrowException("Redefinition of function '" + FunctionName + "'!");
+
+ // Make sure to strip off any argument names so we can't get conflicts.
+ if (Fn->isExternal())
+ for (Function::arg_iterator AI = Fn->arg_begin(), AE = Fn->arg_end();
+ AI != AE; ++AI)
+ AI->setName("");
+
+ } else { // Not already defined?
+ Fn = new Function(FT, GlobalValue::ExternalLinkage, FunctionName,
+ CurModule.CurrentModule);
+ InsertValue(Fn, CurModule.Values);
+ }
+
+ CurFun.FunctionStart(Fn);
+ Fn->setCallingConv(yyvsp[-7].UIntVal);
+ Fn->setAlignment(yyvsp[0].UIntVal);
+ if (yyvsp[-1].StrVal) {
+ Fn->setSection(yyvsp[-1].StrVal);
+ free(yyvsp[-1].StrVal);
+ }
+
+ // Add all of the arguments we parsed to the function...
+ if (yyvsp[-3].ArgList) { // Is null if empty...
+ if (isVarArg) { // Nuke the last entry
+ assert(yyvsp[-3].ArgList->back().first->get() == Type::VoidTy && yyvsp[-3].ArgList->back().second == 0&&
+ "Not a varargs marker!");
+ delete yyvsp[-3].ArgList->back().first;
+ yyvsp[-3].ArgList->pop_back(); // Delete the last entry
+ }
+ Function::arg_iterator ArgIt = Fn->arg_begin();
+ for (std::vector<std::pair<PATypeHolder*,char*> >::iterator I = yyvsp[-3].ArgList->begin();
+ I != yyvsp[-3].ArgList->end(); ++I, ++ArgIt) {
+ delete I->first; // Delete the typeholder...
+
+ setValueName(ArgIt, I->second); // Insert arg into symtab...
+ InsertValue(ArgIt);
+ }
+
+ delete yyvsp[-3].ArgList; // We're now done with the argument list
+ }
+ ;
+ break;}
+ case 158:
+ #line 1824 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.FunctionVal = CurFun.CurrentFunction;
+
+ // Make sure that we keep track of the linkage type even if there was a
+ // previous "declare".
+ yyval.FunctionVal->setLinkage(yyvsp[-2].Linkage);
+ ;
+ break;}
+ case 161:
+ #line 1834 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.FunctionVal = yyvsp[-1].FunctionVal;
+ ;
+ break;}
+ case 162:
+ #line 1838 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { CurFun.isDeclare = true; ;
+ break;}
+ case 163:
+ #line 1838 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.FunctionVal = CurFun.CurrentFunction;
+ CurFun.FunctionDone();
+ ;
+ break;}
+ case 164:
+ #line 1847 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.BoolVal = false;
+ ;
+ break;}
+ case 165:
+ #line 1850 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.BoolVal = true;
+ ;
+ break;}
+ case 166:
+ #line 1854 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { // A reference to a direct constant
+ yyval.ValIDVal = ValID::create(yyvsp[0].SInt64Val);
+ ;
+ break;}
+ case 167:
+ #line 1857 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ValIDVal = ValID::create(yyvsp[0].UInt64Val);
+ ;
+ break;}
+ case 168:
+ #line 1860 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Perhaps it's an FP constant?
+ yyval.ValIDVal = ValID::create(yyvsp[0].FPVal);
+ ;
+ break;}
+ case 169:
+ #line 1863 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ValIDVal = ValID::create(ConstantBool::True);
+ ;
+ break;}
+ case 170:
+ #line 1866 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ValIDVal = ValID::create(ConstantBool::False);
+ ;
+ break;}
+ case 171:
+ #line 1869 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ValIDVal = ValID::createNull();
+ ;
+ break;}
+ case 172:
+ #line 1872 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ValIDVal = ValID::createUndef();
+ ;
+ break;}
+ case 173:
+ #line 1875 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { // A vector zero constant.
+ yyval.ValIDVal = ValID::createZeroInit();
+ ;
+ break;}
+ case 174:
+ #line 1878 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Nonempty unsized packed vector
+ const Type *ETy = (*yyvsp[-1].ConstVector)[0]->getType();
+ int NumElements = yyvsp[-1].ConstVector->size();
+
+ PackedType* pt = PackedType::get(ETy, NumElements);
+ PATypeHolder* PTy = new PATypeHolder(
+ HandleUpRefs(
+ PackedType::get(
+ ETy,
+ NumElements)
+ )
+ );
+
+ // Verify all elements are correct type!
+ for (unsigned i = 0; i < yyvsp[-1].ConstVector->size(); i++) {
+ if (ETy != (*yyvsp[-1].ConstVector)[i]->getType())
+ ThrowException("Element #" + utostr(i) + " is not of type '" +
+ ETy->getDescription() +"' as required!\nIt is of type '" +
+ (*yyvsp[-1].ConstVector)[i]->getType()->getDescription() + "'.");
+ }
+
+ yyval.ValIDVal = ValID::create(ConstantPacked::get(pt, *yyvsp[-1].ConstVector));
+ delete PTy; delete yyvsp[-1].ConstVector;
+ ;
+ break;}
+ case 175:
+ #line 1902 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ValIDVal = ValID::create(yyvsp[0].ConstVal);
+ ;
+ break;}
+ case 176:
+ #line 1905 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ char *End = UnEscapeLexed(yyvsp[-2].StrVal, true);
+ std::string AsmStr = std::string(yyvsp[-2].StrVal, End);
+ End = UnEscapeLexed(yyvsp[0].StrVal, true);
+ std::string Constraints = std::string(yyvsp[0].StrVal, End);
+ yyval.ValIDVal = ValID::createInlineAsm(AsmStr, Constraints, yyvsp[-3].BoolVal);
+ free(yyvsp[-2].StrVal);
+ free(yyvsp[0].StrVal);
+ ;
+ break;}
+ case 177:
+ #line 1918 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Is it an integer reference...?
+ yyval.ValIDVal = ValID::create(yyvsp[0].SIntVal);
+ ;
+ break;}
+ case 178:
+ #line 1921 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Is it a named reference...?
+ yyval.ValIDVal = ValID::create(yyvsp[0].StrVal);
+ ;
+ break;}
+ case 181:
+ #line 1932 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ValueVal = getVal(*yyvsp[-1].TypeVal, yyvsp[0].ValIDVal); delete yyvsp[-1].TypeVal;
+ ;
+ break;}
+ case 182:
+ #line 1936 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.FunctionVal = yyvsp[-1].FunctionVal;
+ ;
+ break;}
+ case 183:
+ #line 1939 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Do not allow functions with 0 basic blocks
+ yyval.FunctionVal = yyvsp[-1].FunctionVal;
+ ;
+ break;}
+ case 184:
+ #line 1947 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ setValueName(yyvsp[0].TermInstVal, yyvsp[-1].StrVal);
+ InsertValue(yyvsp[0].TermInstVal);
+
+ yyvsp[-2].BasicBlockVal->getInstList().push_back(yyvsp[0].TermInstVal);
+ InsertValue(yyvsp[-2].BasicBlockVal);
+ yyval.BasicBlockVal = yyvsp[-2].BasicBlockVal;
+ ;
+ break;}
+ case 185:
+ #line 1956 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyvsp[-1].BasicBlockVal->getInstList().push_back(yyvsp[0].InstVal);
+ yyval.BasicBlockVal = yyvsp[-1].BasicBlockVal;
+ ;
+ break;}
+ case 186:
+ #line 1960 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.BasicBlockVal = CurBB = getBBVal(ValID::create((int)CurFun.NextBBNum++), true);
+
+ // Make sure to move the basic block to the correct location in the
+ // function, instead of leaving it inserted wherever it was first
+ // referenced.
+ Function::BasicBlockListType &BBL =
+ CurFun.CurrentFunction->getBasicBlockList();
+ BBL.splice(BBL.end(), BBL, yyval.BasicBlockVal);
+ ;
+ break;}
+ case 187:
+ #line 1970 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.BasicBlockVal = CurBB = getBBVal(ValID::create(yyvsp[0].StrVal), true);
+
+ // Make sure to move the basic block to the correct location in the
+ // function, instead of leaving it inserted wherever it was first
+ // referenced.
+ Function::BasicBlockListType &BBL =
+ CurFun.CurrentFunction->getBasicBlockList();
+ BBL.splice(BBL.end(), BBL, yyval.BasicBlockVal);
+ ;
+ break;}
+ case 188:
+ #line 1981 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Return with a result...
+ yyval.TermInstVal = new ReturnInst(yyvsp[0].ValueVal);
+ ;
+ break;}
+ case 189:
+ #line 1984 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Return with no result...
+ yyval.TermInstVal = new ReturnInst();
+ ;
+ break;}
+ case 190:
+ #line 1987 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Unconditional Branch...
+ yyval.TermInstVal = new BranchInst(getBBVal(yyvsp[0].ValIDVal));
+ ;
+ break;}
+ case 191:
+ #line 1990 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.TermInstVal = new BranchInst(getBBVal(yyvsp[-3].ValIDVal), getBBVal(yyvsp[0].ValIDVal), getVal(Type::BoolTy, yyvsp[-6].ValIDVal));
+ ;
+ break;}
+ case 192:
+ #line 1993 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ SwitchInst *S = new SwitchInst(getVal(yyvsp[-7].PrimType, yyvsp[-6].ValIDVal), getBBVal(yyvsp[-3].ValIDVal), yyvsp[-1].JumpTable->size());
+ yyval.TermInstVal = S;
+
+ std::vector<std::pair<Constant*,BasicBlock*> >::iterator I = yyvsp[-1].JumpTable->begin(),
+ E = yyvsp[-1].JumpTable->end();
+ for (; I != E; ++I) {
+ if (ConstantInt *CI = dyn_cast<ConstantInt>(I->first))
+ S->addCase(CI, I->second);
+ else
+ ThrowException("Switch case is constant, but not a simple integer!");
+ }
+ delete yyvsp[-1].JumpTable;
+ ;
+ break;}
+ case 193:
+ #line 2007 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ SwitchInst *S = new SwitchInst(getVal(yyvsp[-6].PrimType, yyvsp[-5].ValIDVal), getBBVal(yyvsp[-2].ValIDVal), 0);
+ yyval.TermInstVal = S;
+ ;
+ break;}
+ case 194:
+ #line 2012 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ const PointerType *PFTy;
+ const FunctionType *Ty;
+
+ if (!(PFTy = dyn_cast<PointerType>(yyvsp[-10].TypeVal->get())) ||
+ !(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) {
+ // Pull out the types of all of the arguments...
+ std::vector<const Type*> ParamTypes;
+ if (yyvsp[-7].ValueList) {
+ for (std::vector<Value*>::iterator I = yyvsp[-7].ValueList->begin(), E = yyvsp[-7].ValueList->end();
+ I != E; ++I)
+ ParamTypes.push_back((*I)->getType());
+ }
+
+ bool isVarArg = ParamTypes.size() && ParamTypes.back() == Type::VoidTy;
+ if (isVarArg) ParamTypes.pop_back();
+
+ Ty = FunctionType::get(yyvsp[-10].TypeVal->get(), ParamTypes, isVarArg);
+ PFTy = PointerType::get(Ty);
+ }
+
+ Value *V = getVal(PFTy, yyvsp[-9].ValIDVal); // Get the function we're calling...
+
+ BasicBlock *Normal = getBBVal(yyvsp[-3].ValIDVal);
+ BasicBlock *Except = getBBVal(yyvsp[0].ValIDVal);
+
+ // Create the call node...
+ if (!yyvsp[-7].ValueList) { // Has no arguments?
+ yyval.TermInstVal = new InvokeInst(V, Normal, Except, std::vector<Value*>());
+ } else { // Has arguments?
+ // Loop through FunctionType's arguments and ensure they are specified
+ // correctly!
+ //
+ FunctionType::param_iterator I = Ty->param_begin();
+ FunctionType::param_iterator E = Ty->param_end();
+ std::vector<Value*>::iterator ArgI = yyvsp[-7].ValueList->begin(), ArgE = yyvsp[-7].ValueList->end();
+
+ for (; ArgI != ArgE && I != E; ++ArgI, ++I)
+ if ((*ArgI)->getType() != *I)
+ ThrowException("Parameter " +(*ArgI)->getName()+ " is not of type '" +
+ (*I)->getDescription() + "'!");
+
+ if (I != E || (ArgI != ArgE && !Ty->isVarArg()))
+ ThrowException("Invalid number of parameters detected!");
+
+ yyval.TermInstVal = new InvokeInst(V, Normal, Except, *yyvsp[-7].ValueList);
+ }
+ cast<InvokeInst>(yyval.TermInstVal)->setCallingConv(yyvsp[-11].UIntVal);
+
+ delete yyvsp[-10].TypeVal;
+ delete yyvsp[-7].ValueList;
+ ;
+ break;}
+ case 195:
+ #line 2064 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.TermInstVal = new UnwindInst();
+ ;
+ break;}
+ case 196:
+ #line 2067 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.TermInstVal = new UnreachableInst();
+ ;
+ break;}
+ case 197:
+ #line 2073 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.JumpTable = yyvsp[-5].JumpTable;
+ Constant *V = cast<Constant>(getValNonImprovising(yyvsp[-4].PrimType, yyvsp[-3].ValIDVal));
+ if (V == 0)
+ ThrowException("May only switch on a constant pool value!");
+
+ yyval.JumpTable->push_back(std::make_pair(V, getBBVal(yyvsp[0].ValIDVal)));
+ ;
+ break;}
+ case 198:
+ #line 2081 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.JumpTable = new std::vector<std::pair<Constant*, BasicBlock*> >();
+ Constant *V = cast<Constant>(getValNonImprovising(yyvsp[-4].PrimType, yyvsp[-3].ValIDVal));
+
+ if (V == 0)
+ ThrowException("May only switch on a constant pool value!");
+
+ yyval.JumpTable->push_back(std::make_pair(V, getBBVal(yyvsp[0].ValIDVal)));
+ ;
+ break;}
+ case 199:
+ #line 2091 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ // Is this definition named?? if so, assign the name...
+ setValueName(yyvsp[0].InstVal, yyvsp[-1].StrVal);
+ InsertValue(yyvsp[0].InstVal);
+ yyval.InstVal = yyvsp[0].InstVal;
+ ;
+ break;}
+ case 200:
+ #line 2098 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Used for PHI nodes
+ yyval.PHIList = new std::list<std::pair<Value*, BasicBlock*> >();
+ yyval.PHIList->push_back(std::make_pair(getVal(*yyvsp[-5].TypeVal, yyvsp[-3].ValIDVal), getBBVal(yyvsp[-1].ValIDVal)));
+ delete yyvsp[-5].TypeVal;
+ ;
+ break;}
+ case 201:
+ #line 2103 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.PHIList = yyvsp[-6].PHIList;
+ yyvsp[-6].PHIList->push_back(std::make_pair(getVal(yyvsp[-6].PHIList->front().first->getType(), yyvsp[-3].ValIDVal),
+ getBBVal(yyvsp[-1].ValIDVal)));
+ ;
+ break;}
+ case 202:
+ #line 2110 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { // Used for call statements, and memory insts...
+ yyval.ValueList = new std::vector<Value*>();
+ yyval.ValueList->push_back(yyvsp[0].ValueVal);
+ ;
+ break;}
+ case 203:
+ #line 2114 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ValueList = yyvsp[-2].ValueList;
+ yyvsp[-2].ValueList->push_back(yyvsp[0].ValueVal);
+ ;
+ break;}
+ case 205:
+ #line 2120 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ { yyval.ValueList = 0; ;
+ break;}
+ case 206:
+ #line 2122 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.BoolVal = true;
+ ;
+ break;}
+ case 207:
+ #line 2125 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.BoolVal = false;
+ ;
+ break;}
+ case 208:
+ #line 2131 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (!(*yyvsp[-3].TypeVal)->isInteger() && !(*yyvsp[-3].TypeVal)->isFloatingPoint() &&
+ !isa<PackedType>((*yyvsp[-3].TypeVal).get()))
+ ThrowException(
+ "Arithmetic operator requires integer, FP, or packed operands!");
+ if (isa<PackedType>((*yyvsp[-3].TypeVal).get()) && yyvsp[-4].BinaryOpVal == Instruction::Rem)
+ ThrowException("Rem not supported on packed types!");
+ yyval.InstVal = BinaryOperator::create(yyvsp[-4].BinaryOpVal, getVal(*yyvsp[-3].TypeVal, yyvsp[-2].ValIDVal), getVal(*yyvsp[-3].TypeVal, yyvsp[0].ValIDVal));
+ if (yyval.InstVal == 0)
+ ThrowException("binary operator returned null!");
+ delete yyvsp[-3].TypeVal;
+ ;
+ break;}
+ case 209:
+ #line 2143 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (!(*yyvsp[-3].TypeVal)->isIntegral()) {
+ if (!isa<PackedType>(yyvsp[-3].TypeVal->get()) ||
+ !cast<PackedType>(yyvsp[-3].TypeVal->get())->getElementType()->isIntegral())
+ ThrowException("Logical operator requires integral operands!");
+ }
+ yyval.InstVal = BinaryOperator::create(yyvsp[-4].BinaryOpVal, getVal(*yyvsp[-3].TypeVal, yyvsp[-2].ValIDVal), getVal(*yyvsp[-3].TypeVal, yyvsp[0].ValIDVal));
+ if (yyval.InstVal == 0)
+ ThrowException("binary operator returned null!");
+ delete yyvsp[-3].TypeVal;
+ ;
+ break;}
+ case 210:
+ #line 2154 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if(isa<PackedType>((*yyvsp[-3].TypeVal).get())) {
+ ThrowException(
+ "PackedTypes currently not supported in setcc instructions!");
+ }
+ yyval.InstVal = new SetCondInst(yyvsp[-4].BinaryOpVal, getVal(*yyvsp[-3].TypeVal, yyvsp[-2].ValIDVal), getVal(*yyvsp[-3].TypeVal, yyvsp[0].ValIDVal));
+ if (yyval.InstVal == 0)
+ ThrowException("binary operator returned null!");
+ delete yyvsp[-3].TypeVal;
+ ;
+ break;}
+ case 211:
+ #line 2164 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ std::cerr << "WARNING: Use of eliminated 'not' instruction:"
+ << " Replacing with 'xor'.\n";
+
+ Value *Ones = ConstantIntegral::getAllOnesValue(yyvsp[0].ValueVal->getType());
+ if (Ones == 0)
+ ThrowException("Expected integral type for not instruction!");
+
+ yyval.InstVal = BinaryOperator::create(Instruction::Xor, yyvsp[0].ValueVal, Ones);
+ if (yyval.InstVal == 0)
+ ThrowException("Could not create a xor instruction!");
+ ;
+ break;}
+ case 212:
+ #line 2176 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (yyvsp[0].ValueVal->getType() != Type::UByteTy)
+ ThrowException("Shift amount must be ubyte!");
+ if (!yyvsp[-2].ValueVal->getType()->isInteger())
+ ThrowException("Shift constant expression requires integer operand!");
+ yyval.InstVal = new ShiftInst(yyvsp[-3].OtherOpVal, yyvsp[-2].ValueVal, yyvsp[0].ValueVal);
+ ;
+ break;}
+ case 213:
+ #line 2183 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (!yyvsp[0].TypeVal->get()->isFirstClassType())
+ ThrowException("cast instruction to a non-primitive type: '" +
+ yyvsp[0].TypeVal->get()->getDescription() + "'!");
+ yyval.InstVal = new CastInst(yyvsp[-2].ValueVal, *yyvsp[0].TypeVal);
+ delete yyvsp[0].TypeVal;
+ ;
+ break;}
+ case 214:
+ #line 2190 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (yyvsp[-4].ValueVal->getType() != Type::BoolTy)
+ ThrowException("select condition must be boolean!");
+ if (yyvsp[-2].ValueVal->getType() != yyvsp[0].ValueVal->getType())
+ ThrowException("select value types should match!");
+ yyval.InstVal = new SelectInst(yyvsp[-4].ValueVal, yyvsp[-2].ValueVal, yyvsp[0].ValueVal);
+ ;
+ break;}
+ case 215:
+ #line 2197 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ NewVarArgs = true;
+ yyval.InstVal = new VAArgInst(yyvsp[-2].ValueVal, *yyvsp[0].TypeVal);
+ delete yyvsp[0].TypeVal;
+ ;
+ break;}
+ case 216:
+ #line 2202 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ ObsoleteVarArgs = true;
+ const Type* ArgTy = yyvsp[-2].ValueVal->getType();
+ Function* NF = CurModule.CurrentModule->
+ getOrInsertFunction("llvm.va_copy", ArgTy, ArgTy, (Type *)0);
+
+ //b = vaarg a, t ->
+ //foo = alloca 1 of t
+ //bar = vacopy a
+ //store bar -> foo
+ //b = vaarg foo, t
+ AllocaInst* foo = new AllocaInst(ArgTy, 0, "vaarg.fix");
+ CurBB->getInstList().push_back(foo);
+ CallInst* bar = new CallInst(NF, yyvsp[-2].ValueVal);
+ CurBB->getInstList().push_back(bar);
+ CurBB->getInstList().push_back(new StoreInst(bar, foo));
+ yyval.InstVal = new VAArgInst(foo, *yyvsp[0].TypeVal);
+ delete yyvsp[0].TypeVal;
+ ;
+ break;}
+ case 217:
+ #line 2221 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ ObsoleteVarArgs = true;
+ const Type* ArgTy = yyvsp[-2].ValueVal->getType();
+ Function* NF = CurModule.CurrentModule->
+ getOrInsertFunction("llvm.va_copy", ArgTy, ArgTy, (Type *)0);
+
+ //b = vanext a, t ->
+ //foo = alloca 1 of t
+ //bar = vacopy a
+ //store bar -> foo
+ //tmp = vaarg foo, t
+ //b = load foo
+ AllocaInst* foo = new AllocaInst(ArgTy, 0, "vanext.fix");
+ CurBB->getInstList().push_back(foo);
+ CallInst* bar = new CallInst(NF, yyvsp[-2].ValueVal);
+ CurBB->getInstList().push_back(bar);
+ CurBB->getInstList().push_back(new StoreInst(bar, foo));
+ Instruction* tmp = new VAArgInst(foo, *yyvsp[0].TypeVal);
+ CurBB->getInstList().push_back(tmp);
+ yyval.InstVal = new LoadInst(foo);
+ delete yyvsp[0].TypeVal;
+ ;
+ break;}
+ case 218:
+ #line 2243 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (!isa<PackedType>(yyvsp[-2].ValueVal->getType()))
+ ThrowException("First operand of extractelement must be "
+ "packed type!");
+ if (yyvsp[0].ValueVal->getType() != Type::UIntTy)
+ ThrowException("Second operand of extractelement must be uint!");
+ yyval.InstVal = new ExtractElementInst(yyvsp[-2].ValueVal, yyvsp[0].ValueVal);
+ ;
+ break;}
+ case 219:
+ #line 2251 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (!isa<PackedType>(yyvsp[-4].ValueVal->getType()))
+ ThrowException("First operand of insertelement must be "
+ "packed type!");
+ if (yyvsp[-2].ValueVal->getType() !=
+ cast<PackedType>(yyvsp[-4].ValueVal->getType())->getElementType())
+ ThrowException("Second operand of insertelement must be "
+ "packed element type!");
+ if (yyvsp[0].ValueVal->getType() != Type::UIntTy)
+ ThrowException("Third operand of insertelement must be uint!");
+ yyval.InstVal = new InsertElementInst(yyvsp[-4].ValueVal, yyvsp[-2].ValueVal, yyvsp[0].ValueVal);
+ ;
+ break;}
+ case 220:
+ #line 2263 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ const Type *Ty = yyvsp[0].PHIList->front().first->getType();
+ if (!Ty->isFirstClassType())
+ ThrowException("PHI node operands must be of first class type!");
+ yyval.InstVal = new PHINode(Ty);
+ ((PHINode*)yyval.InstVal)->reserveOperandSpace(yyvsp[0].PHIList->size());
+ while (yyvsp[0].PHIList->begin() != yyvsp[0].PHIList->end()) {
+ if (yyvsp[0].PHIList->front().first->getType() != Ty)
+ ThrowException("All elements of a PHI node must be of the same type!");
+ cast<PHINode>(yyval.InstVal)->addIncoming(yyvsp[0].PHIList->front().first, yyvsp[0].PHIList->front().second);
+ yyvsp[0].PHIList->pop_front();
+ }
+ delete yyvsp[0].PHIList; // Free the list...
+ ;
+ break;}
+ case 221:
+ #line 2277 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ const PointerType *PFTy;
+ const FunctionType *Ty;
+
+ if (!(PFTy = dyn_cast<PointerType>(yyvsp[-4].TypeVal->get())) ||
+ !(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) {
+ // Pull out the types of all of the arguments...
+ std::vector<const Type*> ParamTypes;
+ if (yyvsp[-1].ValueList) {
+ for (std::vector<Value*>::iterator I = yyvsp[-1].ValueList->begin(), E = yyvsp[-1].ValueList->end();
+ I != E; ++I)
+ ParamTypes.push_back((*I)->getType());
+ }
+
+ bool isVarArg = ParamTypes.size() && ParamTypes.back() == Type::VoidTy;
+ if (isVarArg) ParamTypes.pop_back();
+
+ if (!(*yyvsp[-4].TypeVal)->isFirstClassType() && *yyvsp[-4].TypeVal != Type::VoidTy)
+ ThrowException("LLVM functions cannot return aggregate types!");
+
+ Ty = FunctionType::get(yyvsp[-4].TypeVal->get(), ParamTypes, isVarArg);
+ PFTy = PointerType::get(Ty);
+ }
+
+ Value *V = getVal(PFTy, yyvsp[-3].ValIDVal); // Get the function we're calling...
+
+ // Create the call node...
+ if (!yyvsp[-1].ValueList) { // Has no arguments?
+ // Make sure no arguments is a good thing!
+ if (Ty->getNumParams() != 0)
+ ThrowException("No arguments passed to a function that "
+ "expects arguments!");
+
+ yyval.InstVal = new CallInst(V, std::vector<Value*>());
+ } else { // Has arguments?
+ // Loop through FunctionType's arguments and ensure they are specified
+ // correctly!
+ //
+ FunctionType::param_iterator I = Ty->param_begin();
+ FunctionType::param_iterator E = Ty->param_end();
+ std::vector<Value*>::iterator ArgI = yyvsp[-1].ValueList->begin(), ArgE = yyvsp[-1].ValueList->end();
+
+ for (; ArgI != ArgE && I != E; ++ArgI, ++I)
+ if ((*ArgI)->getType() != *I)
+ ThrowException("Parameter " +(*ArgI)->getName()+ " is not of type '" +
+ (*I)->getDescription() + "'!");
+
+ if (I != E || (ArgI != ArgE && !Ty->isVarArg()))
+ ThrowException("Invalid number of parameters detected!");
+
+ yyval.InstVal = new CallInst(V, *yyvsp[-1].ValueList);
+ }
+ cast<CallInst>(yyval.InstVal)->setTailCall(yyvsp[-6].BoolVal);
+ cast<CallInst>(yyval.InstVal)->setCallingConv(yyvsp[-5].UIntVal);
+ delete yyvsp[-4].TypeVal;
+ delete yyvsp[-1].ValueList;
+ ;
+ break;}
+ case 222:
+ #line 2334 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.InstVal = yyvsp[0].InstVal;
+ ;
+ break;}
+ case 223:
+ #line 2340 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ValueList = yyvsp[0].ValueList;
+ ;
+ break;}
+ case 224:
+ #line 2342 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.ValueList = new std::vector<Value*>();
+ ;
+ break;}
+ case 225:
+ #line 2346 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.BoolVal = true;
+ ;
+ break;}
+ case 226:
+ #line 2349 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.BoolVal = false;
+ ;
+ break;}
+ case 227:
+ #line 2355 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.InstVal = new MallocInst(*yyvsp[-1].TypeVal, 0, yyvsp[0].UIntVal);
+ delete yyvsp[-1].TypeVal;
+ ;
+ break;}
+ case 228:
+ #line 2359 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.InstVal = new MallocInst(*yyvsp[-4].TypeVal, getVal(yyvsp[-2].PrimType, yyvsp[-1].ValIDVal), yyvsp[0].UIntVal);
+ delete yyvsp[-4].TypeVal;
+ ;
+ break;}
+ case 229:
+ #line 2363 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.InstVal = new AllocaInst(*yyvsp[-1].TypeVal, 0, yyvsp[0].UIntVal);
+ delete yyvsp[-1].TypeVal;
+ ;
+ break;}
+ case 230:
+ #line 2367 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ yyval.InstVal = new AllocaInst(*yyvsp[-4].TypeVal, getVal(yyvsp[-2].PrimType, yyvsp[-1].ValIDVal), yyvsp[0].UIntVal);
+ delete yyvsp[-4].TypeVal;
+ ;
+ break;}
+ case 231:
+ #line 2371 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (!isa<PointerType>(yyvsp[0].ValueVal->getType()))
+ ThrowException("Trying to free nonpointer type " +
+ yyvsp[0].ValueVal->getType()->getDescription() + "!");
+ yyval.InstVal = new FreeInst(yyvsp[0].ValueVal);
+ ;
+ break;}
+ case 232:
+ #line 2378 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (!isa<PointerType>(yyvsp[-1].TypeVal->get()))
+ ThrowException("Can't load from nonpointer type: " +
+ (*yyvsp[-1].TypeVal)->getDescription());
+ if (!cast<PointerType>(yyvsp[-1].TypeVal->get())->getElementType()->isFirstClassType())
+ ThrowException("Can't load from pointer of non-first-class type: " +
+ (*yyvsp[-1].TypeVal)->getDescription());
+ yyval.InstVal = new LoadInst(getVal(*yyvsp[-1].TypeVal, yyvsp[0].ValIDVal), "", yyvsp[-3].BoolVal);
+ delete yyvsp[-1].TypeVal;
+ ;
+ break;}
+ case 233:
+ #line 2388 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ const PointerType *PT = dyn_cast<PointerType>(yyvsp[-1].TypeVal->get());
+ if (!PT)
+ ThrowException("Can't store to a nonpointer type: " +
+ (*yyvsp[-1].TypeVal)->getDescription());
+ const Type *ElTy = PT->getElementType();
+ if (ElTy != yyvsp[-3].ValueVal->getType())
+ ThrowException("Can't store '" + yyvsp[-3].ValueVal->getType()->getDescription() +
+ "' into space of type '" + ElTy->getDescription() + "'!");
+
+ yyval.InstVal = new StoreInst(yyvsp[-3].ValueVal, getVal(*yyvsp[-1].TypeVal, yyvsp[0].ValIDVal), yyvsp[-5].BoolVal);
+ delete yyvsp[-1].TypeVal;
+ ;
+ break;}
+ case 234:
+ #line 2401 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+ {
+ if (!isa<PointerType>(yyvsp[-2].TypeVal->get()))
+ ThrowException("getelementptr insn requires pointer operand!");
+
+ // LLVM 1.2 and earlier used ubyte struct indices. Convert any ubyte struct
+ // indices to uint struct indices for compatibility.
+ generic_gep_type_iterator<std::vector<Value*>::iterator>
+ GTI = gep_type_begin(yyvsp[-2].TypeVal->get(), yyvsp[0].ValueList->begin(), yyvsp[0].ValueList->end()),
+ GTE = gep_type_end(yyvsp[-2].TypeVal->get(), yyvsp[0].ValueList->begin(), yyvsp[0].ValueList->end());
+ for (unsigned i = 0, e = yyvsp[0].ValueList->size(); i != e && GTI != GTE; ++i, ++GTI)
+ if (isa<StructType>(*GTI)) // Only change struct indices
+ if (ConstantUInt *CUI = dyn_cast<ConstantUInt>((*yyvsp[0].ValueList)[i]))
+ if (CUI->getType() == Type::UByteTy)
+ (*yyvsp[0].ValueList)[i] = ConstantExpr::getCast(CUI, Type::UIntTy);
+
+ if (!GetElementPtrInst::getIndexedType(*yyvsp[-2].TypeVal, *yyvsp[0].ValueList, true))
+ ThrowException("Invalid getelementptr indices for type '" +
+ (*yyvsp[-2].TypeVal)->getDescription()+ "'!");
+ yyval.InstVal = new GetElementPtrInst(getVal(*yyvsp[-2].TypeVal, yyvsp[-1].ValIDVal), *yyvsp[0].ValueList);
+ delete yyvsp[-2].TypeVal; delete yyvsp[0].ValueList;
+ ;
+ break;}
+ }
+ /* the action file gets copied in in place of this dollarsign */
+ #line 543 "/usr/share/bison.simple"
+
+ yyvsp -= yylen;
+ yyssp -= yylen;
+ #ifdef YYLSP_NEEDED
+ yylsp -= yylen;
+ #endif
+
+ #if YYDEBUG != 0
+ if (yydebug)
+ {
+ short *ssp1 = yyss - 1;
+ fprintf (stderr, "state stack now");
+ while (ssp1 != yyssp)
+ fprintf (stderr, " %d", *++ssp1);
+ fprintf (stderr, "\n");
+ }
+ #endif
+
+ *++yyvsp = yyval;
+
+ #ifdef YYLSP_NEEDED
+ yylsp++;
+ if (yylen == 0)
+ {
+ yylsp->first_line = yylloc.first_line;
+ yylsp->first_column = yylloc.first_column;
+ yylsp->last_line = (yylsp-1)->last_line;
+ yylsp->last_column = (yylsp-1)->last_column;
+ yylsp->text = 0;
+ }
+ else
+ {
+ yylsp->last_line = (yylsp+yylen-1)->last_line;
+ yylsp->last_column = (yylsp+yylen-1)->last_column;
+ }
+ #endif
+
+ /* Now "shift" the result of the reduction.
+ Determine what state that goes to,
+ based on the state we popped back to
+ and the rule number reduced by. */
+
+ yyn = yyr1[yyn];
+
+ yystate = yypgoto[yyn - YYNTBASE] + *yyssp;
+ if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp)
+ yystate = yytable[yystate];
+ else
+ yystate = yydefgoto[yyn - YYNTBASE];
+
+ goto yynewstate;
+
+ yyerrlab: /* here on detecting error */
+
+ if (! yyerrstatus)
+ /* If not already recovering from an error, report this error. */
+ {
+ ++yynerrs;
+
+ #ifdef YYERROR_VERBOSE
+ yyn = yypact[yystate];
+
+ if (yyn > YYFLAG && yyn < YYLAST)
+ {
+ int size = 0;
+ char *msg;
+ int x, count;
+
+ count = 0;
+ /* Start X at -yyn if nec to avoid negative indexes in yycheck. */
+ for (x = (yyn < 0 ? -yyn : 0);
+ x < (sizeof(yytname) / sizeof(char *)); x++)
+ if (yycheck[x + yyn] == x)
+ size += strlen(yytname[x]) + 15, count++;
+ msg = (char *) malloc(size + 15);
+ if (msg != 0)
+ {
+ strcpy(msg, "parse error");
+
+ if (count < 5)
+ {
+ count = 0;
+ for (x = (yyn < 0 ? -yyn : 0);
+ x < (sizeof(yytname) / sizeof(char *)); x++)
+ if (yycheck[x + yyn] == x)
+ {
+ strcat(msg, count == 0 ? ", expecting `" : " or `");
+ strcat(msg, yytname[x]);
+ strcat(msg, "'");
+ count++;
+ }
+ }
+ yyerror(msg);
+ free(msg);
+ }
+ else
+ yyerror ("parse error; also virtual memory exceeded");
+ }
+ else
+ #endif /* YYERROR_VERBOSE */
+ yyerror("parse error");
+ }
+
+ goto yyerrlab1;
+ yyerrlab1: /* here on error raised explicitly by an action */
+
+ if (yyerrstatus == 3)
+ {
+ /* if just tried and failed to reuse lookahead token after an error, discard it. */
+
+ /* return failure if at end of input */
+ if (yychar == YYEOF)
+ YYABORT;
+
+ #if YYDEBUG != 0
+ if (yydebug)
+ fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]);
+ #endif
+
+ yychar = YYEMPTY;
+ }
+
+ /* Else will try to reuse lookahead token
+ after shifting the error token. */
+
+ yyerrstatus = 3; /* Each real token shifted decrements this */
+
+ goto yyerrhandle;
+
+ yyerrdefault: /* current state does not do anything special for the error token. */
+
+ #if 0
+ /* This is wrong; only states that explicitly want error tokens
+ should shift them. */
+ yyn = yydefact[yystate]; /* If its default is to accept any token, ok. Otherwise pop it.*/
+ if (yyn) goto yydefault;
+ #endif
+
+ yyerrpop: /* pop the current state because it cannot handle the error token */
+
+ if (yyssp == yyss) YYABORT;
+ yyvsp--;
+ yystate = *--yyssp;
+ #ifdef YYLSP_NEEDED
+ yylsp--;
+ #endif
+
+ #if YYDEBUG != 0
+ if (yydebug)
+ {
+ short *ssp1 = yyss - 1;
+ fprintf (stderr, "Error: state stack now");
+ while (ssp1 != yyssp)
+ fprintf (stderr, " %d", *++ssp1);
+ fprintf (stderr, "\n");
+ }
+ #endif
+
+ yyerrhandle:
+
+ yyn = yypact[yystate];
+ if (yyn == YYFLAG)
+ goto yyerrdefault;
+
+ yyn += YYTERROR;
+ if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR)
+ goto yyerrdefault;
+
+ yyn = yytable[yyn];
+ if (yyn < 0)
+ {
+ if (yyn == YYFLAG)
+ goto yyerrpop;
+ yyn = -yyn;
+ goto yyreduce;
+ }
+ else if (yyn == 0)
+ goto yyerrpop;
+
+ if (yyn == YYFINAL)
+ YYACCEPT;
+
+ #if YYDEBUG != 0
+ if (yydebug)
+ fprintf(stderr, "Shifting error token, ");
+ #endif
+
+ *++yyvsp = yylval;
+ #ifdef YYLSP_NEEDED
+ *++yylsp = yylloc;
+ #endif
+
+ yystate = yyn;
+ goto yynewstate;
+
+ yyacceptlab:
+ /* YYACCEPT comes here. */
+ if (yyfree_stacks)
+ {
+ free (yyss);
+ free (yyvs);
+ #ifdef YYLSP_NEEDED
+ free (yyls);
+ #endif
+ }
+ return 0;
+
+ yyabortlab:
+ /* YYABORT comes here. */
+ if (yyfree_stacks)
+ {
+ free (yyss);
+ free (yyvs);
+ #ifdef YYLSP_NEEDED
+ free (yyls);
+ #endif
+ }
+ return 1;
+ }
+ #line 2424 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
+
+ int yyerror(const char *ErrorMsg) {
+ std::string where
+ = std::string((CurFilename == "-") ? std::string("<stdin>") : CurFilename)
+ + ":" + utostr((unsigned) llvmAsmlineno) + ": ";
+ std::string errMsg = std::string(ErrorMsg) + "\n" + where + " while reading ";
+ if (yychar == YYEMPTY || yychar == 0)
+ errMsg += "end-of-file.";
+ else
+ errMsg += "token: '" + std::string(llvmAsmtext, llvmAsmleng) + "'";
+ ThrowException(errMsg);
+ return 0;
+ }
Index: llvm/lib/AsmParser/llvmAsmParser.h.cvs
diff -c /dev/null llvm/lib/AsmParser/llvmAsmParser.h.cvs:1.1
*** /dev/null Wed Feb 15 01:23:10 2006
--- llvm/lib/AsmParser/llvmAsmParser.h.cvs Wed Feb 15 01:22:58 2006
***************
*** 0 ****
--- 1,140 ----
+ typedef union {
+ llvm::Module *ModuleVal;
+ llvm::Function *FunctionVal;
+ std::pair<llvm::PATypeHolder*, char*> *ArgVal;
+ llvm::BasicBlock *BasicBlockVal;
+ llvm::TerminatorInst *TermInstVal;
+ llvm::Instruction *InstVal;
+ llvm::Constant *ConstVal;
+
+ const llvm::Type *PrimType;
+ llvm::PATypeHolder *TypeVal;
+ llvm::Value *ValueVal;
+
+ std::vector<std::pair<llvm::PATypeHolder*,char*> > *ArgList;
+ std::vector<llvm::Value*> *ValueList;
+ std::list<llvm::PATypeHolder> *TypeList;
+ // Represent the RHS of PHI node
+ std::list<std::pair<llvm::Value*,
+ llvm::BasicBlock*> > *PHIList;
+ std::vector<std::pair<llvm::Constant*, llvm::BasicBlock*> > *JumpTable;
+ std::vector<llvm::Constant*> *ConstVector;
+
+ llvm::GlobalValue::LinkageTypes Linkage;
+ int64_t SInt64Val;
+ uint64_t UInt64Val;
+ int SIntVal;
+ unsigned UIntVal;
+ double FPVal;
+ bool BoolVal;
+
+ char *StrVal; // This memory is strdup'd!
+ llvm::ValID ValIDVal; // strdup'd memory maybe!
+
+ llvm::Instruction::BinaryOps BinaryOpVal;
+ llvm::Instruction::TermOps TermOpVal;
+ llvm::Instruction::MemoryOps MemOpVal;
+ llvm::Instruction::OtherOps OtherOpVal;
+ llvm::Module::Endianness Endianness;
+ } YYSTYPE;
+ #define ESINT64VAL 257
+ #define EUINT64VAL 258
+ #define SINTVAL 259
+ #define UINTVAL 260
+ #define FPVAL 261
+ #define VOID 262
+ #define BOOL 263
+ #define SBYTE 264
+ #define UBYTE 265
+ #define SHORT 266
+ #define USHORT 267
+ #define INT 268
+ #define UINT 269
+ #define LONG 270
+ #define ULONG 271
+ #define FLOAT 272
+ #define DOUBLE 273
+ #define TYPE 274
+ #define LABEL 275
+ #define VAR_ID 276
+ #define LABELSTR 277
+ #define STRINGCONSTANT 278
+ #define IMPLEMENTATION 279
+ #define ZEROINITIALIZER 280
+ #define TRUETOK 281
+ #define FALSETOK 282
+ #define BEGINTOK 283
+ #define ENDTOK 284
+ #define DECLARE 285
+ #define GLOBAL 286
+ #define CONSTANT 287
+ #define SECTION 288
+ #define VOLATILE 289
+ #define TO 290
+ #define DOTDOTDOT 291
+ #define NULL_TOK 292
+ #define UNDEF 293
+ #define CONST 294
+ #define INTERNAL 295
+ #define LINKONCE 296
+ #define WEAK 297
+ #define APPENDING 298
+ #define OPAQUE 299
+ #define NOT 300
+ #define EXTERNAL 301
+ #define TARGET 302
+ #define TRIPLE 303
+ #define ENDIAN 304
+ #define POINTERSIZE 305
+ #define LITTLE 306
+ #define BIG 307
+ #define ALIGN 308
+ #define DEPLIBS 309
+ #define CALL 310
+ #define TAIL 311
+ #define ASM_TOK 312
+ #define MODULE 313
+ #define SIDEEFFECT 314
+ #define CC_TOK 315
+ #define CCC_TOK 316
+ #define FASTCC_TOK 317
+ #define COLDCC_TOK 318
+ #define RET 319
+ #define BR 320
+ #define SWITCH 321
+ #define INVOKE 322
+ #define UNWIND 323
+ #define UNREACHABLE 324
+ #define ADD 325
+ #define SUB 326
+ #define MUL 327
+ #define DIV 328
+ #define REM 329
+ #define AND 330
+ #define OR 331
+ #define XOR 332
+ #define SETLE 333
+ #define SETGE 334
+ #define SETLT 335
+ #define SETGT 336
+ #define SETEQ 337
+ #define SETNE 338
+ #define MALLOC 339
+ #define ALLOCA 340
+ #define FREE 341
+ #define LOAD 342
+ #define STORE 343
+ #define GETELEMENTPTR 344
+ #define PHI_TOK 345
+ #define CAST 346
+ #define SELECT 347
+ #define SHL 348
+ #define SHR 349
+ #define VAARG 350
+ #define EXTRACTELEMENT 351
+ #define INSERTELEMENT 352
+ #define VAARG_old 353
+ #define VANEXT_old 354
+
+
+ extern YYSTYPE llvmAsmlval;
Index: llvm/lib/AsmParser/llvmAsmParser.y.cvs
diff -c /dev/null llvm/lib/AsmParser/llvmAsmParser.y.cvs:1.1
*** /dev/null Wed Feb 15 01:23:10 2006
--- llvm/lib/AsmParser/llvmAsmParser.y.cvs Wed Feb 15 01:22:58 2006
***************
*** 0 ****
--- 1,2436 ----
+ //===-- llvmAsmParser.y - Parser for llvm assembly files --------*- C++ -*-===//
+ //
+ // The LLVM Compiler Infrastructure
+ //
+ // This file was developed by the LLVM research group and is distributed under
+ // the University of Illinois Open Source License. See LICENSE.TXT for details.
+ //
+ //===----------------------------------------------------------------------===//
+ //
+ // This file implements the bison parser for LLVM assembly languages files.
+ //
+ //===----------------------------------------------------------------------===//
+
+ %{
+ #include "ParserInternals.h"
+ #include "llvm/CallingConv.h"
+ #include "llvm/InlineAsm.h"
+ #include "llvm/Instructions.h"
+ #include "llvm/Module.h"
+ #include "llvm/SymbolTable.h"
+ #include "llvm/Assembly/AutoUpgrade.h"
+ #include "llvm/Support/GetElementPtrTypeIterator.h"
+ #include "llvm/ADT/STLExtras.h"
+ #include "llvm/Support/MathExtras.h"
+ #include <algorithm>
+ #include <iostream>
+ #include <list>
+ #include <utility>
+
+ int yyerror(const char *ErrorMsg); // Forward declarations to prevent "implicit
+ int yylex(); // declaration" of xxx warnings.
+ int yyparse();
+
+ namespace llvm {
+ std::string CurFilename;
+ }
+ using namespace llvm;
+
+ static Module *ParserResult;
+
+ // DEBUG_UPREFS - Define this symbol if you want to enable debugging output
+ // relating to upreferences in the input stream.
+ //
+ //#define DEBUG_UPREFS 1
+ #ifdef DEBUG_UPREFS
+ #define UR_OUT(X) std::cerr << X
+ #else
+ #define UR_OUT(X)
+ #endif
+
+ #define YYERROR_VERBOSE 1
+
+ static bool ObsoleteVarArgs;
+ static bool NewVarArgs;
+ static BasicBlock *CurBB;
+ static GlobalVariable *CurGV;
+
+
+ // This contains info used when building the body of a function. It is
+ // destroyed when the function is completed.
+ //
+ typedef std::vector<Value *> ValueList; // Numbered defs
+ static void
+ ResolveDefinitions(std::map<const Type *,ValueList> &LateResolvers,
+ std::map<const Type *,ValueList> *FutureLateResolvers = 0);
+
+ static struct PerModuleInfo {
+ Module *CurrentModule;
+ std::map<const Type *, ValueList> Values; // Module level numbered definitions
+ std::map<const Type *,ValueList> LateResolveValues;
+ std::vector<PATypeHolder> Types;
+ std::map<ValID, PATypeHolder> LateResolveTypes;
+
+ /// PlaceHolderInfo - When temporary placeholder objects are created, remember
+ /// how they were referenced and one which line of the input they came from so
+ /// that we can resolve them later and print error messages as appropriate.
+ std::map<Value*, std::pair<ValID, int> > PlaceHolderInfo;
+
+ // GlobalRefs - This maintains a mapping between <Type, ValID>'s and forward
+ // references to global values. Global values may be referenced before they
+ // are defined, and if so, the temporary object that they represent is held
+ // here. This is used for forward references of GlobalValues.
+ //
+ typedef std::map<std::pair<const PointerType *,
+ ValID>, GlobalValue*> GlobalRefsType;
+ GlobalRefsType GlobalRefs;
+
+ void ModuleDone() {
+ // If we could not resolve some functions at function compilation time
+ // (calls to functions before they are defined), resolve them now... Types
+ // are resolved when the constant pool has been completely parsed.
+ //
+ ResolveDefinitions(LateResolveValues);
+
+ // Check to make sure that all global value forward references have been
+ // resolved!
+ //
+ if (!GlobalRefs.empty()) {
+ std::string UndefinedReferences = "Unresolved global references exist:\n";
+
+ for (GlobalRefsType::iterator I = GlobalRefs.begin(), E =GlobalRefs.end();
+ I != E; ++I) {
+ UndefinedReferences += " " + I->first.first->getDescription() + " " +
+ I->first.second.getName() + "\n";
+ }
+ ThrowException(UndefinedReferences);
+ }
+
+ // Look for intrinsic functions and CallInst that need to be upgraded
+ for (Module::iterator FI = CurrentModule->begin(),FE = CurrentModule->end();
+ FI != FE; ++FI)
+ UpgradeCallsToIntrinsic(FI);
+
+ Values.clear(); // Clear out function local definitions
+ Types.clear();
+ CurrentModule = 0;
+ }
+
+ // GetForwardRefForGlobal - Check to see if there is a forward reference
+ // for this global. If so, remove it from the GlobalRefs map and return it.
+ // If not, just return null.
+ GlobalValue *GetForwardRefForGlobal(const PointerType *PTy, ValID ID) {
+ // Check to see if there is a forward reference to this global variable...
+ // if there is, eliminate it and patch the reference to use the new def'n.
+ GlobalRefsType::iterator I = GlobalRefs.find(std::make_pair(PTy, ID));
+ GlobalValue *Ret = 0;
+ if (I != GlobalRefs.end()) {
+ Ret = I->second;
+ GlobalRefs.erase(I);
+ }
+ return Ret;
+ }
+ } CurModule;
+
+ static struct PerFunctionInfo {
+ Function *CurrentFunction; // Pointer to current function being created
+
+ std::map<const Type*, ValueList> Values; // Keep track of #'d definitions
+ std::map<const Type*, ValueList> LateResolveValues;
+ bool isDeclare; // Is this function a forward declararation?
+
+ /// BBForwardRefs - When we see forward references to basic blocks, keep
+ /// track of them here.
+ std::map<BasicBlock*, std::pair<ValID, int> > BBForwardRefs;
+ std::vector<BasicBlock*> NumberedBlocks;
+ unsigned NextBBNum;
+
+ inline PerFunctionInfo() {
+ CurrentFunction = 0;
+ isDeclare = false;
+ }
+
+ inline void FunctionStart(Function *M) {
+ CurrentFunction = M;
+ NextBBNum = 0;
+ }
+
+ void FunctionDone() {
+ NumberedBlocks.clear();
+
+ // Any forward referenced blocks left?
+ if (!BBForwardRefs.empty())
+ ThrowException("Undefined reference to label " +
+ BBForwardRefs.begin()->first->getName());
+
+ // Resolve all forward references now.
+ ResolveDefinitions(LateResolveValues, &CurModule.LateResolveValues);
+
+ Values.clear(); // Clear out function local definitions
+ CurrentFunction = 0;
+ isDeclare = false;
+ }
+ } CurFun; // Info for the current function...
+
+ static bool inFunctionScope() { return CurFun.CurrentFunction != 0; }
+
+
+ //===----------------------------------------------------------------------===//
+ // Code to handle definitions of all the types
+ //===----------------------------------------------------------------------===//
+
+ static int InsertValue(Value *V,
+ std::map<const Type*,ValueList> &ValueTab = CurFun.Values) {
+ if (V->hasName()) return -1; // Is this a numbered definition?
+
+ // Yes, insert the value into the value table...
+ ValueList &List = ValueTab[V->getType()];
+ List.push_back(V);
+ return List.size()-1;
+ }
+
+ static const Type *getTypeVal(const ValID &D, bool DoNotImprovise = false) {
+ switch (D.Type) {
+ case ValID::NumberVal: // Is it a numbered definition?
+ // Module constants occupy the lowest numbered slots...
+ if ((unsigned)D.Num < CurModule.Types.size())
+ return CurModule.Types[(unsigned)D.Num];
+ break;
+ case ValID::NameVal: // Is it a named definition?
+ if (const Type *N = CurModule.CurrentModule->getTypeByName(D.Name)) {
+ D.destroy(); // Free old strdup'd memory...
+ return N;
+ }
+ break;
+ default:
+ ThrowException("Internal parser error: Invalid symbol type reference!");
+ }
+
+ // If we reached here, we referenced either a symbol that we don't know about
+ // or an id number that hasn't been read yet. We may be referencing something
+ // forward, so just create an entry to be resolved later and get to it...
+ //
+ if (DoNotImprovise) return 0; // Do we just want a null to be returned?
+
+
+ if (inFunctionScope()) {
+ if (D.Type == ValID::NameVal)
+ ThrowException("Reference to an undefined type: '" + D.getName() + "'");
+ else
+ ThrowException("Reference to an undefined type: #" + itostr(D.Num));
+ }
+
+ std::map<ValID, PATypeHolder>::iterator I =CurModule.LateResolveTypes.find(D);
+ if (I != CurModule.LateResolveTypes.end())
+ return I->second;
+
+ Type *Typ = OpaqueType::get();
+ CurModule.LateResolveTypes.insert(std::make_pair(D, Typ));
+ return Typ;
+ }
+
+ static Value *lookupInSymbolTable(const Type *Ty, const std::string &Name) {
+ SymbolTable &SymTab =
+ inFunctionScope() ? CurFun.CurrentFunction->getSymbolTable() :
+ CurModule.CurrentModule->getSymbolTable();
+ return SymTab.lookup(Ty, Name);
+ }
+
+ // getValNonImprovising - Look up the value specified by the provided type and
+ // the provided ValID. If the value exists and has already been defined, return
+ // it. Otherwise return null.
+ //
+ static Value *getValNonImprovising(const Type *Ty, const ValID &D) {
+ if (isa<FunctionType>(Ty))
+ ThrowException("Functions are not values and "
+ "must be referenced as pointers");
+
+ switch (D.Type) {
+ case ValID::NumberVal: { // Is it a numbered definition?
+ unsigned Num = (unsigned)D.Num;
+
+ // Module constants occupy the lowest numbered slots...
+ std::map<const Type*,ValueList>::iterator VI = CurModule.Values.find(Ty);
+ if (VI != CurModule.Values.end()) {
+ if (Num < VI->second.size())
+ return VI->second[Num];
+ Num -= VI->second.size();
+ }
+
+ // Make sure that our type is within bounds
+ VI = CurFun.Values.find(Ty);
+ if (VI == CurFun.Values.end()) return 0;
+
+ // Check that the number is within bounds...
+ if (VI->second.size() <= Num) return 0;
+
+ return VI->second[Num];
+ }
+
+ case ValID::NameVal: { // Is it a named definition?
+ Value *N = lookupInSymbolTable(Ty, std::string(D.Name));
+ if (N == 0) return 0;
+
+ D.destroy(); // Free old strdup'd memory...
+ return N;
+ }
+
+ // Check to make sure that "Ty" is an integral type, and that our
+ // value will fit into the specified type...
+ case ValID::ConstSIntVal: // Is it a constant pool reference??
+ if (!ConstantSInt::isValueValidForType(Ty, D.ConstPool64))
+ ThrowException("Signed integral constant '" +
+ itostr(D.ConstPool64) + "' is invalid for type '" +
+ Ty->getDescription() + "'!");
+ return ConstantSInt::get(Ty, D.ConstPool64);
+
+ case ValID::ConstUIntVal: // Is it an unsigned const pool reference?
+ if (!ConstantUInt::isValueValidForType(Ty, D.UConstPool64)) {
+ if (!ConstantSInt::isValueValidForType(Ty, D.ConstPool64)) {
+ ThrowException("Integral constant '" + utostr(D.UConstPool64) +
+ "' is invalid or out of range!");
+ } else { // This is really a signed reference. Transmogrify.
+ return ConstantSInt::get(Ty, D.ConstPool64);
+ }
+ } else {
+ return ConstantUInt::get(Ty, D.UConstPool64);
+ }
+
+ case ValID::ConstFPVal: // Is it a floating point const pool reference?
+ if (!ConstantFP::isValueValidForType(Ty, D.ConstPoolFP))
+ ThrowException("FP constant invalid for type!!");
+ return ConstantFP::get(Ty, D.ConstPoolFP);
+
+ case ValID::ConstNullVal: // Is it a null value?
+ if (!isa<PointerType>(Ty))
+ ThrowException("Cannot create a a non pointer null!");
+ return ConstantPointerNull::get(cast<PointerType>(Ty));
+
+ case ValID::ConstUndefVal: // Is it an undef value?
+ return UndefValue::get(Ty);
+
+ case ValID::ConstZeroVal: // Is it a zero value?
+ return Constant::getNullValue(Ty);
+
+ case ValID::ConstantVal: // Fully resolved constant?
+ if (D.ConstantValue->getType() != Ty)
+ ThrowException("Constant expression type different from required type!");
+ return D.ConstantValue;
+
+ case ValID::InlineAsmVal: { // Inline asm expression
+ const PointerType *PTy = dyn_cast<PointerType>(Ty);
+ const FunctionType *FTy =
+ PTy ? dyn_cast<FunctionType>(PTy->getElementType()) : 0;
+ if (!FTy || !InlineAsm::Verify(FTy, D.IAD->Constraints))
+ ThrowException("Invalid type for asm constraint string!");
+ InlineAsm *IA = InlineAsm::get(FTy, D.IAD->AsmString, D.IAD->Constraints,
+ D.IAD->HasSideEffects);
+ D.destroy(); // Free InlineAsmDescriptor.
+ return IA;
+ }
+ default:
+ assert(0 && "Unhandled case!");
+ return 0;
+ } // End of switch
+
+ assert(0 && "Unhandled case!");
+ return 0;
+ }
+
+ // getVal - This function is identical to getValNonImprovising, except that if a
+ // value is not already defined, it "improvises" by creating a placeholder var
+ // that looks and acts just like the requested variable. When the value is
+ // defined later, all uses of the placeholder variable are replaced with the
+ // real thing.
+ //
+ static Value *getVal(const Type *Ty, const ValID &ID) {
+ if (Ty == Type::LabelTy)
+ ThrowException("Cannot use a basic block here");
+
+ // See if the value has already been defined.
+ Value *V = getValNonImprovising(Ty, ID);
+ if (V) return V;
+
+ if (!Ty->isFirstClassType() && !isa<OpaqueType>(Ty))
+ ThrowException("Invalid use of a composite type!");
+
+ // If we reached here, we referenced either a symbol that we don't know about
+ // or an id number that hasn't been read yet. We may be referencing something
+ // forward, so just create an entry to be resolved later and get to it...
+ //
+ V = new Argument(Ty);
+
+ // Remember where this forward reference came from. FIXME, shouldn't we try
+ // to recycle these things??
+ CurModule.PlaceHolderInfo.insert(std::make_pair(V, std::make_pair(ID,
+ llvmAsmlineno)));
+
+ if (inFunctionScope())
+ InsertValue(V, CurFun.LateResolveValues);
+ else
+ InsertValue(V, CurModule.LateResolveValues);
+ return V;
+ }
+
+ /// getBBVal - This is used for two purposes:
+ /// * If isDefinition is true, a new basic block with the specified ID is being
+ /// defined.
+ /// * If isDefinition is true, this is a reference to a basic block, which may
+ /// or may not be a forward reference.
+ ///
+ static BasicBlock *getBBVal(const ValID &ID, bool isDefinition = false) {
+ assert(inFunctionScope() && "Can't get basic block at global scope!");
+
+ std::string Name;
+ BasicBlock *BB = 0;
+ switch (ID.Type) {
+ default: ThrowException("Illegal label reference " + ID.getName());
+ case ValID::NumberVal: // Is it a numbered definition?
+ if (unsigned(ID.Num) >= CurFun.NumberedBlocks.size())
+ CurFun.NumberedBlocks.resize(ID.Num+1);
+ BB = CurFun.NumberedBlocks[ID.Num];
+ break;
+ case ValID::NameVal: // Is it a named definition?
+ Name = ID.Name;
+ if (Value *N = CurFun.CurrentFunction->
+ getSymbolTable().lookup(Type::LabelTy, Name))
+ BB = cast<BasicBlock>(N);
+ break;
+ }
+
+ // See if the block has already been defined.
+ if (BB) {
+ // If this is the definition of the block, make sure the existing value was
+ // just a forward reference. If it was a forward reference, there will be
+ // an entry for it in the PlaceHolderInfo map.
+ if (isDefinition && !CurFun.BBForwardRefs.erase(BB))
+ // The existing value was a definition, not a forward reference.
+ ThrowException("Redefinition of label " + ID.getName());
+
+ ID.destroy(); // Free strdup'd memory.
+ return BB;
+ }
+
+ // Otherwise this block has not been seen before.
+ BB = new BasicBlock("", CurFun.CurrentFunction);
+ if (ID.Type == ValID::NameVal) {
+ BB->setName(ID.Name);
+ } else {
+ CurFun.NumberedBlocks[ID.Num] = BB;
+ }
+
+ // If this is not a definition, keep track of it so we can use it as a forward
+ // reference.
+ if (!isDefinition) {
+ // Remember where this forward reference came from.
+ CurFun.BBForwardRefs[BB] = std::make_pair(ID, llvmAsmlineno);
+ } else {
+ // The forward declaration could have been inserted anywhere in the
+ // function: insert it into the correct place now.
+ CurFun.CurrentFunction->getBasicBlockList().remove(BB);
+ CurFun.CurrentFunction->getBasicBlockList().push_back(BB);
+ }
+ ID.destroy();
+ return BB;
+ }
+
+
+ //===----------------------------------------------------------------------===//
+ // Code to handle forward references in instructions
+ //===----------------------------------------------------------------------===//
+ //
+ // This code handles the late binding needed with statements that reference
+ // values not defined yet... for example, a forward branch, or the PHI node for
+ // a loop body.
+ //
+ // This keeps a table (CurFun.LateResolveValues) of all such forward references
+ // and back patchs after we are done.
+ //
+
+ // ResolveDefinitions - If we could not resolve some defs at parsing
+ // time (forward branches, phi functions for loops, etc...) resolve the
+ // defs now...
+ //
+ static void
+ ResolveDefinitions(std::map<const Type*,ValueList> &LateResolvers,
+ std::map<const Type*,ValueList> *FutureLateResolvers) {
+ // Loop over LateResolveDefs fixing up stuff that couldn't be resolved
+ for (std::map<const Type*,ValueList>::iterator LRI = LateResolvers.begin(),
+ E = LateResolvers.end(); LRI != E; ++LRI) {
+ ValueList &List = LRI->second;
+ while (!List.empty()) {
+ Value *V = List.back();
+ List.pop_back();
+
+ std::map<Value*, std::pair<ValID, int> >::iterator PHI =
+ CurModule.PlaceHolderInfo.find(V);
+ assert(PHI != CurModule.PlaceHolderInfo.end() && "Placeholder error!");
+
+ ValID &DID = PHI->second.first;
+
+ Value *TheRealValue = getValNonImprovising(LRI->first, DID);
+ if (TheRealValue) {
+ V->replaceAllUsesWith(TheRealValue);
+ delete V;
+ CurModule.PlaceHolderInfo.erase(PHI);
+ } else if (FutureLateResolvers) {
+ // Functions have their unresolved items forwarded to the module late
+ // resolver table
+ InsertValue(V, *FutureLateResolvers);
+ } else {
+ if (DID.Type == ValID::NameVal)
+ ThrowException("Reference to an invalid definition: '" +DID.getName()+
+ "' of type '" + V->getType()->getDescription() + "'",
+ PHI->second.second);
+ else
+ ThrowException("Reference to an invalid definition: #" +
+ itostr(DID.Num) + " of type '" +
+ V->getType()->getDescription() + "'",
+ PHI->second.second);
+ }
+ }
+ }
+
+ LateResolvers.clear();
+ }
+
+ // ResolveTypeTo - A brand new type was just declared. This means that (if
+ // name is not null) things referencing Name can be resolved. Otherwise, things
+ // refering to the number can be resolved. Do this now.
+ //
+ static void ResolveTypeTo(char *Name, const Type *ToTy) {
+ ValID D;
+ if (Name) D = ValID::create(Name);
+ else D = ValID::create((int)CurModule.Types.size());
+
+ std::map<ValID, PATypeHolder>::iterator I =
+ CurModule.LateResolveTypes.find(D);
+ if (I != CurModule.LateResolveTypes.end()) {
+ ((DerivedType*)I->second.get())->refineAbstractTypeTo(ToTy);
+ CurModule.LateResolveTypes.erase(I);
+ }
+ }
+
+ // setValueName - Set the specified value to the name given. The name may be
+ // null potentially, in which case this is a noop. The string passed in is
+ // assumed to be a malloc'd string buffer, and is free'd by this function.
+ //
+ static void setValueName(Value *V, char *NameStr) {
+ if (NameStr) {
+ std::string Name(NameStr); // Copy string
+ free(NameStr); // Free old string
+
+ if (V->getType() == Type::VoidTy)
+ ThrowException("Can't assign name '" + Name+"' to value with void type!");
+
+ assert(inFunctionScope() && "Must be in function scope!");
+ SymbolTable &ST = CurFun.CurrentFunction->getSymbolTable();
+ if (ST.lookup(V->getType(), Name))
+ ThrowException("Redefinition of value named '" + Name + "' in the '" +
+ V->getType()->getDescription() + "' type plane!");
+
+ // Set the name.
+ V->setName(Name);
+ }
+ }
+
+ /// ParseGlobalVariable - Handle parsing of a global. If Initializer is null,
+ /// this is a declaration, otherwise it is a definition.
+ static GlobalVariable *
+ ParseGlobalVariable(char *NameStr,GlobalValue::LinkageTypes Linkage,
+ bool isConstantGlobal, const Type *Ty,
+ Constant *Initializer) {
+ if (isa<FunctionType>(Ty))
+ ThrowException("Cannot declare global vars of function type!");
+
+ const PointerType *PTy = PointerType::get(Ty);
+
+ std::string Name;
+ if (NameStr) {
+ Name = NameStr; // Copy string
+ free(NameStr); // Free old string
+ }
+
+ // See if this global value was forward referenced. If so, recycle the
+ // object.
+ ValID ID;
+ if (!Name.empty()) {
+ ID = ValID::create((char*)Name.c_str());
+ } else {
+ ID = ValID::create((int)CurModule.Values[PTy].size());
+ }
+
+ if (GlobalValue *FWGV = CurModule.GetForwardRefForGlobal(PTy, ID)) {
+ // Move the global to the end of the list, from whereever it was
+ // previously inserted.
+ GlobalVariable *GV = cast<GlobalVariable>(FWGV);
+ CurModule.CurrentModule->getGlobalList().remove(GV);
+ CurModule.CurrentModule->getGlobalList().push_back(GV);
+ GV->setInitializer(Initializer);
+ GV->setLinkage(Linkage);
+ GV->setConstant(isConstantGlobal);
+ InsertValue(GV, CurModule.Values);
+ return GV;
+ }
+
+ // If this global has a name, check to see if there is already a definition
+ // of this global in the module. If so, merge as appropriate. Note that
+ // this is really just a hack around problems in the CFE. :(
+ if (!Name.empty()) {
+ // We are a simple redefinition of a value, check to see if it is defined
+ // the same as the old one.
+ if (GlobalVariable *EGV =
+ CurModule.CurrentModule->getGlobalVariable(Name, Ty)) {
+ // We are allowed to redefine a global variable in two circumstances:
+ // 1. If at least one of the globals is uninitialized or
+ // 2. If both initializers have the same value.
+ //
+ if (!EGV->hasInitializer() || !Initializer ||
+ EGV->getInitializer() == Initializer) {
+
+ // Make sure the existing global version gets the initializer! Make
+ // sure that it also gets marked const if the new version is.
+ if (Initializer && !EGV->hasInitializer())
+ EGV->setInitializer(Initializer);
+ if (isConstantGlobal)
+ EGV->setConstant(true);
+ EGV->setLinkage(Linkage);
+ return EGV;
+ }
+
+ ThrowException("Redefinition of global variable named '" + Name +
+ "' in the '" + Ty->getDescription() + "' type plane!");
+ }
+ }
+
+ // Otherwise there is no existing GV to use, create one now.
+ GlobalVariable *GV =
+ new GlobalVariable(Ty, isConstantGlobal, Linkage, Initializer, Name,
+ CurModule.CurrentModule);
+ InsertValue(GV, CurModule.Values);
+ return GV;
+ }
+
+ // setTypeName - Set the specified type to the name given. The name may be
+ // null potentially, in which case this is a noop. The string passed in is
+ // assumed to be a malloc'd string buffer, and is freed by this function.
+ //
+ // This function returns true if the type has already been defined, but is
+ // allowed to be redefined in the specified context. If the name is a new name
+ // for the type plane, it is inserted and false is returned.
+ static bool setTypeName(const Type *T, char *NameStr) {
+ assert(!inFunctionScope() && "Can't give types function-local names!");
+ if (NameStr == 0) return false;
+
+ std::string Name(NameStr); // Copy string
+ free(NameStr); // Free old string
+
+ // We don't allow assigning names to void type
+ if (T == Type::VoidTy)
+ ThrowException("Can't assign name '" + Name + "' to the void type!");
+
+ // Set the type name, checking for conflicts as we do so.
+ bool AlreadyExists = CurModule.CurrentModule->addTypeName(Name, T);
+
+ if (AlreadyExists) { // Inserting a name that is already defined???
+ const Type *Existing = CurModule.CurrentModule->getTypeByName(Name);
+ assert(Existing && "Conflict but no matching type?");
+
+ // There is only one case where this is allowed: when we are refining an
+ // opaque type. In this case, Existing will be an opaque type.
+ if (const OpaqueType *OpTy = dyn_cast<OpaqueType>(Existing)) {
+ // We ARE replacing an opaque type!
+ const_cast<OpaqueType*>(OpTy)->refineAbstractTypeTo(T);
+ return true;
+ }
+
+ // Otherwise, this is an attempt to redefine a type. That's okay if
+ // the redefinition is identical to the original. This will be so if
+ // Existing and T point to the same Type object. In this one case we
+ // allow the equivalent redefinition.
+ if (Existing == T) return true; // Yes, it's equal.
+
+ // Any other kind of (non-equivalent) redefinition is an error.
+ ThrowException("Redefinition of type named '" + Name + "' in the '" +
+ T->getDescription() + "' type plane!");
+ }
+
+ return false;
+ }
+
+ //===----------------------------------------------------------------------===//
+ // Code for handling upreferences in type names...
+ //
+
+ // TypeContains - Returns true if Ty directly contains E in it.
+ //
+ static bool TypeContains(const Type *Ty, const Type *E) {
+ return std::find(Ty->subtype_begin(), Ty->subtype_end(),
+ E) != Ty->subtype_end();
+ }
+
+ namespace {
+ struct UpRefRecord {
+ // NestingLevel - The number of nesting levels that need to be popped before
+ // this type is resolved.
+ unsigned NestingLevel;
+
+ // LastContainedTy - This is the type at the current binding level for the
+ // type. Every time we reduce the nesting level, this gets updated.
+ const Type *LastContainedTy;
+
+ // UpRefTy - This is the actual opaque type that the upreference is
+ // represented with.
+ OpaqueType *UpRefTy;
+
+ UpRefRecord(unsigned NL, OpaqueType *URTy)
+ : NestingLevel(NL), LastContainedTy(URTy), UpRefTy(URTy) {}
+ };
+ }
+
+ // UpRefs - A list of the outstanding upreferences that need to be resolved.
+ static std::vector<UpRefRecord> UpRefs;
+
+ /// HandleUpRefs - Every time we finish a new layer of types, this function is
+ /// called. It loops through the UpRefs vector, which is a list of the
+ /// currently active types. For each type, if the up reference is contained in
+ /// the newly completed type, we decrement the level count. When the level
+ /// count reaches zero, the upreferenced type is the type that is passed in:
+ /// thus we can complete the cycle.
+ ///
+ static PATypeHolder HandleUpRefs(const Type *ty) {
+ if (!ty->isAbstract()) return ty;
+ PATypeHolder Ty(ty);
+ UR_OUT("Type '" << Ty->getDescription() <<
+ "' newly formed. Resolving upreferences.\n" <<
+ UpRefs.size() << " upreferences active!\n");
+
+ // If we find any resolvable upreferences (i.e., those whose NestingLevel goes
+ // to zero), we resolve them all together before we resolve them to Ty. At
+ // the end of the loop, if there is anything to resolve to Ty, it will be in
+ // this variable.
+ OpaqueType *TypeToResolve = 0;
+
+ for (unsigned i = 0; i != UpRefs.size(); ++i) {
+ UR_OUT(" UR#" << i << " - TypeContains(" << Ty->getDescription() << ", "
+ << UpRefs[i].second->getDescription() << ") = "
+ << (TypeContains(Ty, UpRefs[i].second) ? "true" : "false") << "\n");
+ if (TypeContains(Ty, UpRefs[i].LastContainedTy)) {
+ // Decrement level of upreference
+ unsigned Level = --UpRefs[i].NestingLevel;
+ UpRefs[i].LastContainedTy = Ty;
+ UR_OUT(" Uplevel Ref Level = " << Level << "\n");
+ if (Level == 0) { // Upreference should be resolved!
+ if (!TypeToResolve) {
+ TypeToResolve = UpRefs[i].UpRefTy;
+ } else {
+ UR_OUT(" * Resolving upreference for "
+ << UpRefs[i].second->getDescription() << "\n";
+ std::string OldName = UpRefs[i].UpRefTy->getDescription());
+ UpRefs[i].UpRefTy->refineAbstractTypeTo(TypeToResolve);
+ UR_OUT(" * Type '" << OldName << "' refined upreference to: "
+ << (const void*)Ty << ", " << Ty->getDescription() << "\n");
+ }
+ UpRefs.erase(UpRefs.begin()+i); // Remove from upreference list...
+ --i; // Do not skip the next element...
+ }
+ }
+ }
+
+ if (TypeToResolve) {
+ UR_OUT(" * Resolving upreference for "
+ << UpRefs[i].second->getDescription() << "\n";
+ std::string OldName = TypeToResolve->getDescription());
+ TypeToResolve->refineAbstractTypeTo(Ty);
+ }
+
+ return Ty;
+ }
+
+
+ // common code from the two 'RunVMAsmParser' functions
+ static Module * RunParser(Module * M) {
+
+ llvmAsmlineno = 1; // Reset the current line number...
+ ObsoleteVarArgs = false;
+ NewVarArgs = false;
+
+ CurModule.CurrentModule = M;
+ yyparse(); // Parse the file, potentially throwing exception
+
+ Module *Result = ParserResult;
+ ParserResult = 0;
+
+ //Not all functions use vaarg, so make a second check for ObsoleteVarArgs
+ {
+ Function* F;
+ if ((F = Result->getNamedFunction("llvm.va_start"))
+ && F->getFunctionType()->getNumParams() == 0)
+ ObsoleteVarArgs = true;
+ if((F = Result->getNamedFunction("llvm.va_copy"))
+ && F->getFunctionType()->getNumParams() == 1)
+ ObsoleteVarArgs = true;
+ }
+
+ if (ObsoleteVarArgs && NewVarArgs)
+ ThrowException("This file is corrupt: it uses both new and old style varargs");
+
+ if(ObsoleteVarArgs) {
+ if(Function* F = Result->getNamedFunction("llvm.va_start")) {
+ if (F->arg_size() != 0)
+ ThrowException("Obsolete va_start takes 0 argument!");
+
+ //foo = va_start()
+ // ->
+ //bar = alloca typeof(foo)
+ //va_start(bar)
+ //foo = load bar
+
+ const Type* RetTy = Type::getPrimitiveType(Type::VoidTyID);
+ const Type* ArgTy = F->getFunctionType()->getReturnType();
+ const Type* ArgTyPtr = PointerType::get(ArgTy);
+ Function* NF = Result->getOrInsertFunction("llvm.va_start",
+ RetTy, ArgTyPtr, (Type *)0);
+
+ while (!F->use_empty()) {
+ CallInst* CI = cast<CallInst>(F->use_back());
+ AllocaInst* bar = new AllocaInst(ArgTy, 0, "vastart.fix.1", CI);
+ new CallInst(NF, bar, "", CI);
+ Value* foo = new LoadInst(bar, "vastart.fix.2", CI);
+ CI->replaceAllUsesWith(foo);
+ CI->getParent()->getInstList().erase(CI);
+ }
+ Result->getFunctionList().erase(F);
+ }
+
+ if(Function* F = Result->getNamedFunction("llvm.va_end")) {
+ if(F->arg_size() != 1)
+ ThrowException("Obsolete va_end takes 1 argument!");
+
+ //vaend foo
+ // ->
+ //bar = alloca 1 of typeof(foo)
+ //vaend bar
+ const Type* RetTy = Type::getPrimitiveType(Type::VoidTyID);
+ const Type* ArgTy = F->getFunctionType()->getParamType(0);
+ const Type* ArgTyPtr = PointerType::get(ArgTy);
+ Function* NF = Result->getOrInsertFunction("llvm.va_end",
+ RetTy, ArgTyPtr, (Type *)0);
+
+ while (!F->use_empty()) {
+ CallInst* CI = cast<CallInst>(F->use_back());
+ AllocaInst* bar = new AllocaInst(ArgTy, 0, "vaend.fix.1", CI);
+ new StoreInst(CI->getOperand(1), bar, CI);
+ new CallInst(NF, bar, "", CI);
+ CI->getParent()->getInstList().erase(CI);
+ }
+ Result->getFunctionList().erase(F);
+ }
+
+ if(Function* F = Result->getNamedFunction("llvm.va_copy")) {
+ if(F->arg_size() != 1)
+ ThrowException("Obsolete va_copy takes 1 argument!");
+ //foo = vacopy(bar)
+ // ->
+ //a = alloca 1 of typeof(foo)
+ //b = alloca 1 of typeof(foo)
+ //store bar -> b
+ //vacopy(a, b)
+ //foo = load a
+
+ const Type* RetTy = Type::getPrimitiveType(Type::VoidTyID);
+ const Type* ArgTy = F->getFunctionType()->getReturnType();
+ const Type* ArgTyPtr = PointerType::get(ArgTy);
+ Function* NF = Result->getOrInsertFunction("llvm.va_copy",
+ RetTy, ArgTyPtr, ArgTyPtr,
+ (Type *)0);
+
+ while (!F->use_empty()) {
+ CallInst* CI = cast<CallInst>(F->use_back());
+ AllocaInst* a = new AllocaInst(ArgTy, 0, "vacopy.fix.1", CI);
+ AllocaInst* b = new AllocaInst(ArgTy, 0, "vacopy.fix.2", CI);
+ new StoreInst(CI->getOperand(1), b, CI);
+ new CallInst(NF, a, b, "", CI);
+ Value* foo = new LoadInst(a, "vacopy.fix.3", CI);
+ CI->replaceAllUsesWith(foo);
+ CI->getParent()->getInstList().erase(CI);
+ }
+ Result->getFunctionList().erase(F);
+ }
+ }
+
+ return Result;
+
+ }
+
+ //===----------------------------------------------------------------------===//
+ // RunVMAsmParser - Define an interface to this parser
+ //===----------------------------------------------------------------------===//
+ //
+ Module *llvm::RunVMAsmParser(const std::string &Filename, FILE *F) {
+ set_scan_file(F);
+
+ CurFilename = Filename;
+ return RunParser(new Module(CurFilename));
+ }
+
+ Module *llvm::RunVMAsmParser(const char * AsmString, Module * M) {
+ set_scan_string(AsmString);
+
+ CurFilename = "from_memory";
+ if (M == NULL) {
+ return RunParser(new Module (CurFilename));
+ } else {
+ return RunParser(M);
+ }
+ }
+
+ %}
+
+ %union {
+ llvm::Module *ModuleVal;
+ llvm::Function *FunctionVal;
+ std::pair<llvm::PATypeHolder*, char*> *ArgVal;
+ llvm::BasicBlock *BasicBlockVal;
+ llvm::TerminatorInst *TermInstVal;
+ llvm::Instruction *InstVal;
+ llvm::Constant *ConstVal;
+
+ const llvm::Type *PrimType;
+ llvm::PATypeHolder *TypeVal;
+ llvm::Value *ValueVal;
+
+ std::vector<std::pair<llvm::PATypeHolder*,char*> > *ArgList;
+ std::vector<llvm::Value*> *ValueList;
+ std::list<llvm::PATypeHolder> *TypeList;
+ // Represent the RHS of PHI node
+ std::list<std::pair<llvm::Value*,
+ llvm::BasicBlock*> > *PHIList;
+ std::vector<std::pair<llvm::Constant*, llvm::BasicBlock*> > *JumpTable;
+ std::vector<llvm::Constant*> *ConstVector;
+
+ llvm::GlobalValue::LinkageTypes Linkage;
+ int64_t SInt64Val;
+ uint64_t UInt64Val;
+ int SIntVal;
+ unsigned UIntVal;
+ double FPVal;
+ bool BoolVal;
+
+ char *StrVal; // This memory is strdup'd!
+ llvm::ValID ValIDVal; // strdup'd memory maybe!
+
+ llvm::Instruction::BinaryOps BinaryOpVal;
+ llvm::Instruction::TermOps TermOpVal;
+ llvm::Instruction::MemoryOps MemOpVal;
+ llvm::Instruction::OtherOps OtherOpVal;
+ llvm::Module::Endianness Endianness;
+ }
+
+ %type <ModuleVal> Module FunctionList
+ %type <FunctionVal> Function FunctionProto FunctionHeader BasicBlockList
+ %type <BasicBlockVal> BasicBlock InstructionList
+ %type <TermInstVal> BBTerminatorInst
+ %type <InstVal> Inst InstVal MemoryInst
+ %type <ConstVal> ConstVal ConstExpr
+ %type <ConstVector> ConstVector
+ %type <ArgList> ArgList ArgListH
+ %type <ArgVal> ArgVal
+ %type <PHIList> PHIList
+ %type <ValueList> ValueRefList ValueRefListE // For call param lists
+ %type <ValueList> IndexList // For GEP derived indices
+ %type <TypeList> TypeListI ArgTypeListI
+ %type <JumpTable> JumpTable
+ %type <BoolVal> GlobalType // GLOBAL or CONSTANT?
+ %type <BoolVal> OptVolatile // 'volatile' or not
+ %type <BoolVal> OptTailCall // TAIL CALL or plain CALL.
+ %type <BoolVal> OptSideEffect // 'sideeffect' or not.
+ %type <Linkage> OptLinkage
+ %type <Endianness> BigOrLittle
+
+ // ValueRef - Unresolved reference to a definition or BB
+ %type <ValIDVal> ValueRef ConstValueRef SymbolicValueRef
+ %type <ValueVal> ResolvedVal // <type> <valref> pair
+ // Tokens and types for handling constant integer values
+ //
+ // ESINT64VAL - A negative number within long long range
+ %token <SInt64Val> ESINT64VAL
+
+ // EUINT64VAL - A positive number within uns. long long range
+ %token <UInt64Val> EUINT64VAL
+ %type <SInt64Val> EINT64VAL
+
+ %token <SIntVal> SINTVAL // Signed 32 bit ints...
+ %token <UIntVal> UINTVAL // Unsigned 32 bit ints...
+ %type <SIntVal> INTVAL
+ %token <FPVal> FPVAL // Float or Double constant
+
+ // Built in types...
+ %type <TypeVal> Types TypesV UpRTypes UpRTypesV
+ %type <PrimType> SIntType UIntType IntType FPType PrimType // Classifications
+ %token <PrimType> VOID BOOL SBYTE UBYTE SHORT USHORT INT UINT LONG ULONG
+ %token <PrimType> FLOAT DOUBLE TYPE LABEL
+
+ %token <StrVal> VAR_ID LABELSTR STRINGCONSTANT
+ %type <StrVal> Name OptName OptAssign
+ %type <UIntVal> OptAlign OptCAlign
+ %type <StrVal> OptSection SectionString
+
+ %token IMPLEMENTATION ZEROINITIALIZER TRUETOK FALSETOK BEGINTOK ENDTOK
+ %token DECLARE GLOBAL CONSTANT SECTION VOLATILE
+ %token TO DOTDOTDOT NULL_TOK UNDEF CONST INTERNAL LINKONCE WEAK APPENDING
+ %token OPAQUE NOT EXTERNAL TARGET TRIPLE ENDIAN POINTERSIZE LITTLE BIG ALIGN
+ %token DEPLIBS CALL TAIL ASM_TOK MODULE SIDEEFFECT
+ %token CC_TOK CCC_TOK FASTCC_TOK COLDCC_TOK
+ %type <UIntVal> OptCallingConv
+
+ // Basic Block Terminating Operators
+ %token <TermOpVal> RET BR SWITCH INVOKE UNWIND UNREACHABLE
+
+ // Binary Operators
+ %type <BinaryOpVal> ArithmeticOps LogicalOps SetCondOps // Binops Subcatagories
+ %token <BinaryOpVal> ADD SUB MUL DIV REM AND OR XOR
+ %token <BinaryOpVal> SETLE SETGE SETLT SETGT SETEQ SETNE // Binary Comarators
+
+ // Memory Instructions
+ %token <MemOpVal> MALLOC ALLOCA FREE LOAD STORE GETELEMENTPTR
+
+ // Other Operators
+ %type <OtherOpVal> ShiftOps
+ %token <OtherOpVal> PHI_TOK CAST SELECT SHL SHR VAARG
+ %token <OtherOpVal> EXTRACTELEMENT INSERTELEMENT
+ %token VAARG_old VANEXT_old //OBSOLETE
+
+
+ %start Module
+ %%
+
+ // Handle constant integer size restriction and conversion...
+ //
+ INTVAL : SINTVAL;
+ INTVAL : UINTVAL {
+ if ($1 > (uint32_t)INT32_MAX) // Outside of my range!
+ ThrowException("Value too large for type!");
+ $$ = (int32_t)$1;
+ };
+
+
+ EINT64VAL : ESINT64VAL; // These have same type and can't cause problems...
+ EINT64VAL : EUINT64VAL {
+ if ($1 > (uint64_t)INT64_MAX) // Outside of my range!
+ ThrowException("Value too large for type!");
+ $$ = (int64_t)$1;
+ };
+
+ // Operations that are notably excluded from this list include:
+ // RET, BR, & SWITCH because they end basic blocks and are treated specially.
+ //
+ ArithmeticOps: ADD | SUB | MUL | DIV | REM;
+ LogicalOps : AND | OR | XOR;
+ SetCondOps : SETLE | SETGE | SETLT | SETGT | SETEQ | SETNE;
+
+ ShiftOps : SHL | SHR;
+
+ // These are some types that allow classification if we only want a particular
+ // thing... for example, only a signed, unsigned, or integral type.
+ SIntType : LONG | INT | SHORT | SBYTE;
+ UIntType : ULONG | UINT | USHORT | UBYTE;
+ IntType : SIntType | UIntType;
+ FPType : FLOAT | DOUBLE;
+
+ // OptAssign - Value producing statements have an optional assignment component
+ OptAssign : Name '=' {
+ $$ = $1;
+ }
+ | /*empty*/ {
+ $$ = 0;
+ };
+
+ OptLinkage : INTERNAL { $$ = GlobalValue::InternalLinkage; } |
+ LINKONCE { $$ = GlobalValue::LinkOnceLinkage; } |
+ WEAK { $$ = GlobalValue::WeakLinkage; } |
+ APPENDING { $$ = GlobalValue::AppendingLinkage; } |
+ /*empty*/ { $$ = GlobalValue::ExternalLinkage; };
+
+ OptCallingConv : /*empty*/ { $$ = CallingConv::C; } |
+ CCC_TOK { $$ = CallingConv::C; } |
+ FASTCC_TOK { $$ = CallingConv::Fast; } |
+ COLDCC_TOK { $$ = CallingConv::Cold; } |
+ CC_TOK EUINT64VAL {
+ if ((unsigned)$2 != $2)
+ ThrowException("Calling conv too large!");
+ $$ = $2;
+ };
+
+ // OptAlign/OptCAlign - An optional alignment, and an optional alignment with
+ // a comma before it.
+ OptAlign : /*empty*/ { $$ = 0; } |
+ ALIGN EUINT64VAL {
+ $$ = $2;
+ if ($$ != 0 && !isPowerOf2_32($$))
+ ThrowException("Alignment must be a power of two!");
+ };
+ OptCAlign : /*empty*/ { $$ = 0; } |
+ ',' ALIGN EUINT64VAL {
+ $$ = $3;
+ if ($$ != 0 && !isPowerOf2_32($$))
+ ThrowException("Alignment must be a power of two!");
+ };
+
+
+ SectionString : SECTION STRINGCONSTANT {
+ for (unsigned i = 0, e = strlen($2); i != e; ++i)
+ if ($2[i] == '"' || $2[i] == '\\')
+ ThrowException("Invalid character in section name!");
+ $$ = $2;
+ };
+
+ OptSection : /*empty*/ { $$ = 0; } |
+ SectionString { $$ = $1; };
+
+ // GlobalVarAttributes - Used to pass the attributes string on a global. CurGV
+ // is set to be the global we are processing.
+ //
+ GlobalVarAttributes : /* empty */ {} |
+ ',' GlobalVarAttribute GlobalVarAttributes {};
+ GlobalVarAttribute : SectionString {
+ CurGV->setSection($1);
+ free($1);
+ }
+ | ALIGN EUINT64VAL {
+ if ($2 != 0 && !isPowerOf2_32($2))
+ ThrowException("Alignment must be a power of two!");
+ CurGV->setAlignment($2);
+ };
+
+ //===----------------------------------------------------------------------===//
+ // Types includes all predefined types... except void, because it can only be
+ // used in specific contexts (function returning void for example). To have
+ // access to it, a user must explicitly use TypesV.
+ //
+
+ // TypesV includes all of 'Types', but it also includes the void type.
+ TypesV : Types | VOID { $$ = new PATypeHolder($1); };
+ UpRTypesV : UpRTypes | VOID { $$ = new PATypeHolder($1); };
+
+ Types : UpRTypes {
+ if (!UpRefs.empty())
+ ThrowException("Invalid upreference in type: " + (*$1)->getDescription());
+ $$ = $1;
+ };
+
+
+ // Derived types are added later...
+ //
+ PrimType : BOOL | SBYTE | UBYTE | SHORT | USHORT | INT | UINT ;
+ PrimType : LONG | ULONG | FLOAT | DOUBLE | TYPE | LABEL;
+ UpRTypes : OPAQUE {
+ $$ = new PATypeHolder(OpaqueType::get());
+ }
+ | PrimType {
+ $$ = new PATypeHolder($1);
+ };
+ UpRTypes : SymbolicValueRef { // Named types are also simple types...
+ $$ = new PATypeHolder(getTypeVal($1));
+ };
+
+ // Include derived types in the Types production.
+ //
+ UpRTypes : '\\' EUINT64VAL { // Type UpReference
+ if ($2 > (uint64_t)~0U) ThrowException("Value out of range!");
+ OpaqueType *OT = OpaqueType::get(); // Use temporary placeholder
+ UpRefs.push_back(UpRefRecord((unsigned)$2, OT)); // Add to vector...
+ $$ = new PATypeHolder(OT);
+ UR_OUT("New Upreference!\n");
+ }
+ | UpRTypesV '(' ArgTypeListI ')' { // Function derived type?
+ std::vector<const Type*> Params;
+ for (std::list<llvm::PATypeHolder>::iterator I = $3->begin(),
+ E = $3->end(); I != E; ++I)
+ Params.push_back(*I);
+ bool isVarArg = Params.size() && Params.back() == Type::VoidTy;
+ if (isVarArg) Params.pop_back();
+
+ $$ = new PATypeHolder(HandleUpRefs(FunctionType::get(*$1,Params,isVarArg)));
+ delete $3; // Delete the argument list
+ delete $1; // Delete the return type handle
+ }
+ | '[' EUINT64VAL 'x' UpRTypes ']' { // Sized array type?
+ $$ = new PATypeHolder(HandleUpRefs(ArrayType::get(*$4, (unsigned)$2)));
+ delete $4;
+ }
+ | '<' EUINT64VAL 'x' UpRTypes '>' { // Packed array type?
+ const llvm::Type* ElemTy = $4->get();
+ if ((unsigned)$2 != $2)
+ ThrowException("Unsigned result not equal to signed result");
+ if (!ElemTy->isPrimitiveType())
+ ThrowException("Elemental type of a PackedType must be primitive");
+ if (!isPowerOf2_32($2))
+ ThrowException("Vector length should be a power of 2!");
+ $$ = new PATypeHolder(HandleUpRefs(PackedType::get(*$4, (unsigned)$2)));
+ delete $4;
+ }
+ | '{' TypeListI '}' { // Structure type?
+ std::vector<const Type*> Elements;
+ for (std::list<llvm::PATypeHolder>::iterator I = $2->begin(),
+ E = $2->end(); I != E; ++I)
+ Elements.push_back(*I);
+
+ $$ = new PATypeHolder(HandleUpRefs(StructType::get(Elements)));
+ delete $2;
+ }
+ | '{' '}' { // Empty structure type?
+ $$ = new PATypeHolder(StructType::get(std::vector<const Type*>()));
+ }
+ | UpRTypes '*' { // Pointer type?
+ $$ = new PATypeHolder(HandleUpRefs(PointerType::get(*$1)));
+ delete $1;
+ };
+
+ // TypeList - Used for struct declarations and as a basis for function type
+ // declaration type lists
+ //
+ TypeListI : UpRTypes {
+ $$ = new std::list<PATypeHolder>();
+ $$->push_back(*$1); delete $1;
+ }
+ | TypeListI ',' UpRTypes {
+ ($$=$1)->push_back(*$3); delete $3;
+ };
+
+ // ArgTypeList - List of types for a function type declaration...
+ ArgTypeListI : TypeListI
+ | TypeListI ',' DOTDOTDOT {
+ ($$=$1)->push_back(Type::VoidTy);
+ }
+ | DOTDOTDOT {
+ ($$ = new std::list<PATypeHolder>())->push_back(Type::VoidTy);
+ }
+ | /*empty*/ {
+ $$ = new std::list<PATypeHolder>();
+ };
+
+ // ConstVal - The various declarations that go into the constant pool. This
+ // production is used ONLY to represent constants that show up AFTER a 'const',
+ // 'constant' or 'global' token at global scope. Constants that can be inlined
+ // into other expressions (such as integers and constexprs) are handled by the
+ // ResolvedVal, ValueRef and ConstValueRef productions.
+ //
+ ConstVal: Types '[' ConstVector ']' { // Nonempty unsized arr
+ const ArrayType *ATy = dyn_cast<ArrayType>($1->get());
+ if (ATy == 0)
+ ThrowException("Cannot make array constant with type: '" +
+ (*$1)->getDescription() + "'!");
+ const Type *ETy = ATy->getElementType();
+ int NumElements = ATy->getNumElements();
+
+ // Verify that we have the correct size...
+ if (NumElements != -1 && NumElements != (int)$3->size())
+ ThrowException("Type mismatch: constant sized array initialized with " +
+ utostr($3->size()) + " arguments, but has size of " +
+ itostr(NumElements) + "!");
+
+ // Verify all elements are correct type!
+ for (unsigned i = 0; i < $3->size(); i++) {
+ if (ETy != (*$3)[i]->getType())
+ ThrowException("Element #" + utostr(i) + " is not of type '" +
+ ETy->getDescription() +"' as required!\nIt is of type '"+
+ (*$3)[i]->getType()->getDescription() + "'.");
+ }
+
+ $$ = ConstantArray::get(ATy, *$3);
+ delete $1; delete $3;
+ }
+ | Types '[' ']' {
+ const ArrayType *ATy = dyn_cast<ArrayType>($1->get());
+ if (ATy == 0)
+ ThrowException("Cannot make array constant with type: '" +
+ (*$1)->getDescription() + "'!");
+
+ int NumElements = ATy->getNumElements();
+ if (NumElements != -1 && NumElements != 0)
+ ThrowException("Type mismatch: constant sized array initialized with 0"
+ " arguments, but has size of " + itostr(NumElements) +"!");
+ $$ = ConstantArray::get(ATy, std::vector<Constant*>());
+ delete $1;
+ }
+ | Types 'c' STRINGCONSTANT {
+ const ArrayType *ATy = dyn_cast<ArrayType>($1->get());
+ if (ATy == 0)
+ ThrowException("Cannot make array constant with type: '" +
+ (*$1)->getDescription() + "'!");
+
+ int NumElements = ATy->getNumElements();
+ const Type *ETy = ATy->getElementType();
+ char *EndStr = UnEscapeLexed($3, true);
+ if (NumElements != -1 && NumElements != (EndStr-$3))
+ ThrowException("Can't build string constant of size " +
+ itostr((int)(EndStr-$3)) +
+ " when array has size " + itostr(NumElements) + "!");
+ std::vector<Constant*> Vals;
+ if (ETy == Type::SByteTy) {
+ for (signed char *C = (signed char *)$3; C != (signed char *)EndStr; ++C)
+ Vals.push_back(ConstantSInt::get(ETy, *C));
+ } else if (ETy == Type::UByteTy) {
+ for (unsigned char *C = (unsigned char *)$3;
+ C != (unsigned char*)EndStr; ++C)
+ Vals.push_back(ConstantUInt::get(ETy, *C));
+ } else {
+ free($3);
+ ThrowException("Cannot build string arrays of non byte sized elements!");
+ }
+ free($3);
+ $$ = ConstantArray::get(ATy, Vals);
+ delete $1;
+ }
+ | Types '<' ConstVector '>' { // Nonempty unsized arr
+ const PackedType *PTy = dyn_cast<PackedType>($1->get());
+ if (PTy == 0)
+ ThrowException("Cannot make packed constant with type: '" +
+ (*$1)->getDescription() + "'!");
+ const Type *ETy = PTy->getElementType();
+ int NumElements = PTy->getNumElements();
+
+ // Verify that we have the correct size...
+ if (NumElements != -1 && NumElements != (int)$3->size())
+ ThrowException("Type mismatch: constant sized packed initialized with " +
+ utostr($3->size()) + " arguments, but has size of " +
+ itostr(NumElements) + "!");
+
+ // Verify all elements are correct type!
+ for (unsigned i = 0; i < $3->size(); i++) {
+ if (ETy != (*$3)[i]->getType())
+ ThrowException("Element #" + utostr(i) + " is not of type '" +
+ ETy->getDescription() +"' as required!\nIt is of type '"+
+ (*$3)[i]->getType()->getDescription() + "'.");
+ }
+
+ $$ = ConstantPacked::get(PTy, *$3);
+ delete $1; delete $3;
+ }
+ | Types '{' ConstVector '}' {
+ const StructType *STy = dyn_cast<StructType>($1->get());
+ if (STy == 0)
+ ThrowException("Cannot make struct constant with type: '" +
+ (*$1)->getDescription() + "'!");
+
+ if ($3->size() != STy->getNumContainedTypes())
+ ThrowException("Illegal number of initializers for structure type!");
+
+ // Check to ensure that constants are compatible with the type initializer!
+ for (unsigned i = 0, e = $3->size(); i != e; ++i)
+ if ((*$3)[i]->getType() != STy->getElementType(i))
+ ThrowException("Expected type '" +
+ STy->getElementType(i)->getDescription() +
+ "' for element #" + utostr(i) +
+ " of structure initializer!");
+
+ $$ = ConstantStruct::get(STy, *$3);
+ delete $1; delete $3;
+ }
+ | Types '{' '}' {
+ const StructType *STy = dyn_cast<StructType>($1->get());
+ if (STy == 0)
+ ThrowException("Cannot make struct constant with type: '" +
+ (*$1)->getDescription() + "'!");
+
+ if (STy->getNumContainedTypes() != 0)
+ ThrowException("Illegal number of initializers for structure type!");
+
+ $$ = ConstantStruct::get(STy, std::vector<Constant*>());
+ delete $1;
+ }
+ | Types NULL_TOK {
+ const PointerType *PTy = dyn_cast<PointerType>($1->get());
+ if (PTy == 0)
+ ThrowException("Cannot make null pointer constant with type: '" +
+ (*$1)->getDescription() + "'!");
+
+ $$ = ConstantPointerNull::get(PTy);
+ delete $1;
+ }
+ | Types UNDEF {
+ $$ = UndefValue::get($1->get());
+ delete $1;
+ }
+ | Types SymbolicValueRef {
+ const PointerType *Ty = dyn_cast<PointerType>($1->get());
+ if (Ty == 0)
+ ThrowException("Global const reference must be a pointer type!");
+
+ // ConstExprs can exist in the body of a function, thus creating
+ // GlobalValues whenever they refer to a variable. Because we are in
+ // the context of a function, getValNonImprovising will search the functions
+ // symbol table instead of the module symbol table for the global symbol,
+ // which throws things all off. To get around this, we just tell
+ // getValNonImprovising that we are at global scope here.
+ //
+ Function *SavedCurFn = CurFun.CurrentFunction;
+ CurFun.CurrentFunction = 0;
+
+ Value *V = getValNonImprovising(Ty, $2);
+
+ CurFun.CurrentFunction = SavedCurFn;
+
+ // If this is an initializer for a constant pointer, which is referencing a
+ // (currently) undefined variable, create a stub now that shall be replaced
+ // in the future with the right type of variable.
+ //
+ if (V == 0) {
+ assert(isa<PointerType>(Ty) && "Globals may only be used as pointers!");
+ const PointerType *PT = cast<PointerType>(Ty);
+
+ // First check to see if the forward references value is already created!
+ PerModuleInfo::GlobalRefsType::iterator I =
+ CurModule.GlobalRefs.find(std::make_pair(PT, $2));
+
+ if (I != CurModule.GlobalRefs.end()) {
+ V = I->second; // Placeholder already exists, use it...
+ $2.destroy();
+ } else {
+ std::string Name;
+ if ($2.Type == ValID::NameVal) Name = $2.Name;
+
+ // Create the forward referenced global.
+ GlobalValue *GV;
+ if (const FunctionType *FTy =
+ dyn_cast<FunctionType>(PT->getElementType())) {
+ GV = new Function(FTy, GlobalValue::ExternalLinkage, Name,
+ CurModule.CurrentModule);
+ } else {
+ GV = new GlobalVariable(PT->getElementType(), false,
+ GlobalValue::ExternalLinkage, 0,
+ Name, CurModule.CurrentModule);
+ }
+
+ // Keep track of the fact that we have a forward ref to recycle it
+ CurModule.GlobalRefs.insert(std::make_pair(std::make_pair(PT, $2), GV));
+ V = GV;
+ }
+ }
+
+ $$ = cast<GlobalValue>(V);
+ delete $1; // Free the type handle
+ }
+ | Types ConstExpr {
+ if ($1->get() != $2->getType())
+ ThrowException("Mismatched types for constant expression!");
+ $$ = $2;
+ delete $1;
+ }
+ | Types ZEROINITIALIZER {
+ const Type *Ty = $1->get();
+ if (isa<FunctionType>(Ty) || Ty == Type::LabelTy || isa<OpaqueType>(Ty))
+ ThrowException("Cannot create a null initialized value of this type!");
+ $$ = Constant::getNullValue(Ty);
+ delete $1;
+ };
+
+ ConstVal : SIntType EINT64VAL { // integral constants
+ if (!ConstantSInt::isValueValidForType($1, $2))
+ ThrowException("Constant value doesn't fit in type!");
+ $$ = ConstantSInt::get($1, $2);
+ }
+ | UIntType EUINT64VAL { // integral constants
+ if (!ConstantUInt::isValueValidForType($1, $2))
+ ThrowException("Constant value doesn't fit in type!");
+ $$ = ConstantUInt::get($1, $2);
+ }
+ | BOOL TRUETOK { // Boolean constants
+ $$ = ConstantBool::True;
+ }
+ | BOOL FALSETOK { // Boolean constants
+ $$ = ConstantBool::False;
+ }
+ | FPType FPVAL { // Float & Double constants
+ if (!ConstantFP::isValueValidForType($1, $2))
+ ThrowException("Floating point constant invalid for type!!");
+ $$ = ConstantFP::get($1, $2);
+ };
+
+
+ ConstExpr: CAST '(' ConstVal TO Types ')' {
+ if (!$3->getType()->isFirstClassType())
+ ThrowException("cast constant expression from a non-primitive type: '" +
+ $3->getType()->getDescription() + "'!");
+ if (!$5->get()->isFirstClassType())
+ ThrowException("cast constant expression to a non-primitive type: '" +
+ $5->get()->getDescription() + "'!");
+ $$ = ConstantExpr::getCast($3, $5->get());
+ delete $5;
+ }
+ | GETELEMENTPTR '(' ConstVal IndexList ')' {
+ if (!isa<PointerType>($3->getType()))
+ ThrowException("GetElementPtr requires a pointer operand!");
+
+ // LLVM 1.2 and earlier used ubyte struct indices. Convert any ubyte struct
+ // indices to uint struct indices for compatibility.
+ generic_gep_type_iterator<std::vector<Value*>::iterator>
+ GTI = gep_type_begin($3->getType(), $4->begin(), $4->end()),
+ GTE = gep_type_end($3->getType(), $4->begin(), $4->end());
+ for (unsigned i = 0, e = $4->size(); i != e && GTI != GTE; ++i, ++GTI)
+ if (isa<StructType>(*GTI)) // Only change struct indices
+ if (ConstantUInt *CUI = dyn_cast<ConstantUInt>((*$4)[i]))
+ if (CUI->getType() == Type::UByteTy)
+ (*$4)[i] = ConstantExpr::getCast(CUI, Type::UIntTy);
+
+ const Type *IdxTy =
+ GetElementPtrInst::getIndexedType($3->getType(), *$4, true);
+ if (!IdxTy)
+ ThrowException("Index list invalid for constant getelementptr!");
+
+ std::vector<Constant*> IdxVec;
+ for (unsigned i = 0, e = $4->size(); i != e; ++i)
+ if (Constant *C = dyn_cast<Constant>((*$4)[i]))
+ IdxVec.push_back(C);
+ else
+ ThrowException("Indices to constant getelementptr must be constants!");
+
+ delete $4;
+
+ $$ = ConstantExpr::getGetElementPtr($3, IdxVec);
+ }
+ | SELECT '(' ConstVal ',' ConstVal ',' ConstVal ')' {
+ if ($3->getType() != Type::BoolTy)
+ ThrowException("Select condition must be of boolean type!");
+ if ($5->getType() != $7->getType())
+ ThrowException("Select operand types must match!");
+ $$ = ConstantExpr::getSelect($3, $5, $7);
+ }
+ | ArithmeticOps '(' ConstVal ',' ConstVal ')' {
+ if ($3->getType() != $5->getType())
+ ThrowException("Binary operator types must match!");
+ // HACK: llvm 1.3 and earlier used to emit invalid pointer constant exprs.
+ // To retain backward compatibility with these early compilers, we emit a
+ // cast to the appropriate integer type automatically if we are in the
+ // broken case. See PR424 for more information.
+ if (!isa<PointerType>($3->getType())) {
+ $$ = ConstantExpr::get($1, $3, $5);
+ } else {
+ const Type *IntPtrTy = 0;
+ switch (CurModule.CurrentModule->getPointerSize()) {
+ case Module::Pointer32: IntPtrTy = Type::IntTy; break;
+ case Module::Pointer64: IntPtrTy = Type::LongTy; break;
+ default: ThrowException("invalid pointer binary constant expr!");
+ }
+ $$ = ConstantExpr::get($1, ConstantExpr::getCast($3, IntPtrTy),
+ ConstantExpr::getCast($5, IntPtrTy));
+ $$ = ConstantExpr::getCast($$, $3->getType());
+ }
+ }
+ | LogicalOps '(' ConstVal ',' ConstVal ')' {
+ if ($3->getType() != $5->getType())
+ ThrowException("Logical operator types must match!");
+ if (!$3->getType()->isIntegral()) {
+ if (!isa<PackedType>($3->getType()) ||
+ !cast<PackedType>($3->getType())->getElementType()->isIntegral())
+ ThrowException("Logical operator requires integral operands!");
+ }
+ $$ = ConstantExpr::get($1, $3, $5);
+ }
+ | SetCondOps '(' ConstVal ',' ConstVal ')' {
+ if ($3->getType() != $5->getType())
+ ThrowException("setcc operand types must match!");
+ $$ = ConstantExpr::get($1, $3, $5);
+ }
+ | ShiftOps '(' ConstVal ',' ConstVal ')' {
+ if ($5->getType() != Type::UByteTy)
+ ThrowException("Shift count for shift constant must be unsigned byte!");
+ if (!$3->getType()->isInteger())
+ ThrowException("Shift constant expression requires integer operand!");
+ $$ = ConstantExpr::get($1, $3, $5);
+ }
+ | EXTRACTELEMENT '(' ConstVal ',' ConstVal ')' {
+ if (!isa<PackedType>($3->getType()))
+ ThrowException("First operand of extractelement must be "
+ "packed type!");
+ if ($5->getType() != Type::UIntTy)
+ ThrowException("Second operand of extractelement must be uint!");
+ $$ = ConstantExpr::getExtractElement($3, $5);
+ };
+
+ // ConstVector - A list of comma separated constants.
+ ConstVector : ConstVector ',' ConstVal {
+ ($$ = $1)->push_back($3);
+ }
+ | ConstVal {
+ $$ = new std::vector<Constant*>();
+ $$->push_back($1);
+ };
+
+
+ // GlobalType - Match either GLOBAL or CONSTANT for global declarations...
+ GlobalType : GLOBAL { $$ = false; } | CONSTANT { $$ = true; };
+
+
+ //===----------------------------------------------------------------------===//
+ // Rules to match Modules
+ //===----------------------------------------------------------------------===//
+
+ // Module rule: Capture the result of parsing the whole file into a result
+ // variable...
+ //
+ Module : FunctionList {
+ $$ = ParserResult = $1;
+ CurModule.ModuleDone();
+ };
+
+ // FunctionList - A list of functions, preceeded by a constant pool.
+ //
+ FunctionList : FunctionList Function {
+ $$ = $1;
+ CurFun.FunctionDone();
+ }
+ | FunctionList FunctionProto {
+ $$ = $1;
+ }
+ | FunctionList MODULE ASM_TOK AsmBlock {
+ $$ = $1;
+ }
+ | FunctionList IMPLEMENTATION {
+ $$ = $1;
+ }
+ | ConstPool {
+ $$ = CurModule.CurrentModule;
+ // Emit an error if there are any unresolved types left.
+ if (!CurModule.LateResolveTypes.empty()) {
+ const ValID &DID = CurModule.LateResolveTypes.begin()->first;
+ if (DID.Type == ValID::NameVal)
+ ThrowException("Reference to an undefined type: '"+DID.getName() + "'");
+ else
+ ThrowException("Reference to an undefined type: #" + itostr(DID.Num));
+ }
+ };
+
+ // ConstPool - Constants with optional names assigned to them.
+ ConstPool : ConstPool OptAssign TYPE TypesV {
+ // Eagerly resolve types. This is not an optimization, this is a
+ // requirement that is due to the fact that we could have this:
+ //
+ // %list = type { %list * }
+ // %list = type { %list * } ; repeated type decl
+ //
+ // If types are not resolved eagerly, then the two types will not be
+ // determined to be the same type!
+ //
+ ResolveTypeTo($2, *$4);
+
+ if (!setTypeName(*$4, $2) && !$2) {
+ // If this is a named type that is not a redefinition, add it to the slot
+ // table.
+ CurModule.Types.push_back(*$4);
+ }
+
+ delete $4;
+ }
+ | ConstPool FunctionProto { // Function prototypes can be in const pool
+ }
+ | ConstPool MODULE ASM_TOK AsmBlock { // Asm blocks can be in the const pool
+ }
+ | ConstPool OptAssign OptLinkage GlobalType ConstVal {
+ if ($5 == 0) ThrowException("Global value initializer is not a constant!");
+ CurGV = ParseGlobalVariable($2, $3, $4, $5->getType(), $5);
+ } GlobalVarAttributes {
+ CurGV = 0;
+ }
+ | ConstPool OptAssign EXTERNAL GlobalType Types {
+ CurGV = ParseGlobalVariable($2, GlobalValue::ExternalLinkage,
+ $4, *$5, 0);
+ delete $5;
+ } GlobalVarAttributes {
+ CurGV = 0;
+ }
+ | ConstPool TARGET TargetDefinition {
+ }
+ | ConstPool DEPLIBS '=' LibrariesDefinition {
+ }
+ | /* empty: end of list */ {
+ };
+
+
+ AsmBlock : STRINGCONSTANT {
+ const std::string &AsmSoFar = CurModule.CurrentModule->getModuleInlineAsm();
+ char *EndStr = UnEscapeLexed($1, true);
+ std::string NewAsm($1, EndStr);
+ free($1);
+
+ if (AsmSoFar.empty())
+ CurModule.CurrentModule->setModuleInlineAsm(NewAsm);
+ else
+ CurModule.CurrentModule->setModuleInlineAsm(AsmSoFar+"\n"+NewAsm);
+ };
+
+ BigOrLittle : BIG { $$ = Module::BigEndian; };
+ BigOrLittle : LITTLE { $$ = Module::LittleEndian; };
+
+ TargetDefinition : ENDIAN '=' BigOrLittle {
+ CurModule.CurrentModule->setEndianness($3);
+ }
+ | POINTERSIZE '=' EUINT64VAL {
+ if ($3 == 32)
+ CurModule.CurrentModule->setPointerSize(Module::Pointer32);
+ else if ($3 == 64)
+ CurModule.CurrentModule->setPointerSize(Module::Pointer64);
+ else
+ ThrowException("Invalid pointer size: '" + utostr($3) + "'!");
+ }
+ | TRIPLE '=' STRINGCONSTANT {
+ CurModule.CurrentModule->setTargetTriple($3);
+ free($3);
+ };
+
+ LibrariesDefinition : '[' LibList ']';
+
+ LibList : LibList ',' STRINGCONSTANT {
+ CurModule.CurrentModule->addLibrary($3);
+ free($3);
+ }
+ | STRINGCONSTANT {
+ CurModule.CurrentModule->addLibrary($1);
+ free($1);
+ }
+ | /* empty: end of list */ {
+ }
+ ;
+
+ //===----------------------------------------------------------------------===//
+ // Rules to match Function Headers
+ //===----------------------------------------------------------------------===//
+
+ Name : VAR_ID | STRINGCONSTANT;
+ OptName : Name | /*empty*/ { $$ = 0; };
+
+ ArgVal : Types OptName {
+ if (*$1 == Type::VoidTy)
+ ThrowException("void typed arguments are invalid!");
+ $$ = new std::pair<PATypeHolder*, char*>($1, $2);
+ };
+
+ ArgListH : ArgListH ',' ArgVal {
+ $$ = $1;
+ $1->push_back(*$3);
+ delete $3;
+ }
+ | ArgVal {
+ $$ = new std::vector<std::pair<PATypeHolder*,char*> >();
+ $$->push_back(*$1);
+ delete $1;
+ };
+
+ ArgList : ArgListH {
+ $$ = $1;
+ }
+ | ArgListH ',' DOTDOTDOT {
+ $$ = $1;
+ $$->push_back(std::pair<PATypeHolder*,
+ char*>(new PATypeHolder(Type::VoidTy), 0));
+ }
+ | DOTDOTDOT {
+ $$ = new std::vector<std::pair<PATypeHolder*,char*> >();
+ $$->push_back(std::make_pair(new PATypeHolder(Type::VoidTy), (char*)0));
+ }
+ | /* empty */ {
+ $$ = 0;
+ };
+
+ FunctionHeaderH : OptCallingConv TypesV Name '(' ArgList ')'
+ OptSection OptAlign {
+ UnEscapeLexed($3);
+ std::string FunctionName($3);
+ free($3); // Free strdup'd memory!
+
+ if (!(*$2)->isFirstClassType() && *$2 != Type::VoidTy)
+ ThrowException("LLVM functions cannot return aggregate types!");
+
+ std::vector<const Type*> ParamTypeList;
+ if ($5) { // If there are arguments...
+ for (std::vector<std::pair<PATypeHolder*,char*> >::iterator I = $5->begin();
+ I != $5->end(); ++I)
+ ParamTypeList.push_back(I->first->get());
+ }
+
+ bool isVarArg = ParamTypeList.size() && ParamTypeList.back() == Type::VoidTy;
+ if (isVarArg) ParamTypeList.pop_back();
+
+ const FunctionType *FT = FunctionType::get(*$2, ParamTypeList, isVarArg);
+ const PointerType *PFT = PointerType::get(FT);
+ delete $2;
+
+ ValID ID;
+ if (!FunctionName.empty()) {
+ ID = ValID::create((char*)FunctionName.c_str());
+ } else {
+ ID = ValID::create((int)CurModule.Values[PFT].size());
+ }
+
+ Function *Fn = 0;
+ // See if this function was forward referenced. If so, recycle the object.
+ if (GlobalValue *FWRef = CurModule.GetForwardRefForGlobal(PFT, ID)) {
+ // Move the function to the end of the list, from whereever it was
+ // previously inserted.
+ Fn = cast<Function>(FWRef);
+ CurModule.CurrentModule->getFunctionList().remove(Fn);
+ CurModule.CurrentModule->getFunctionList().push_back(Fn);
+ } else if (!FunctionName.empty() && // Merge with an earlier prototype?
+ (Fn = CurModule.CurrentModule->getFunction(FunctionName, FT))) {
+ // If this is the case, either we need to be a forward decl, or it needs
+ // to be.
+ if (!CurFun.isDeclare && !Fn->isExternal())
+ ThrowException("Redefinition of function '" + FunctionName + "'!");
+
+ // Make sure to strip off any argument names so we can't get conflicts.
+ if (Fn->isExternal())
+ for (Function::arg_iterator AI = Fn->arg_begin(), AE = Fn->arg_end();
+ AI != AE; ++AI)
+ AI->setName("");
+
+ } else { // Not already defined?
+ Fn = new Function(FT, GlobalValue::ExternalLinkage, FunctionName,
+ CurModule.CurrentModule);
+ InsertValue(Fn, CurModule.Values);
+ }
+
+ CurFun.FunctionStart(Fn);
+ Fn->setCallingConv($1);
+ Fn->setAlignment($8);
+ if ($7) {
+ Fn->setSection($7);
+ free($7);
+ }
+
+ // Add all of the arguments we parsed to the function...
+ if ($5) { // Is null if empty...
+ if (isVarArg) { // Nuke the last entry
+ assert($5->back().first->get() == Type::VoidTy && $5->back().second == 0&&
+ "Not a varargs marker!");
+ delete $5->back().first;
+ $5->pop_back(); // Delete the last entry
+ }
+ Function::arg_iterator ArgIt = Fn->arg_begin();
+ for (std::vector<std::pair<PATypeHolder*,char*> >::iterator I = $5->begin();
+ I != $5->end(); ++I, ++ArgIt) {
+ delete I->first; // Delete the typeholder...
+
+ setValueName(ArgIt, I->second); // Insert arg into symtab...
+ InsertValue(ArgIt);
+ }
+
+ delete $5; // We're now done with the argument list
+ }
+ };
+
+ BEGIN : BEGINTOK | '{'; // Allow BEGIN or '{' to start a function
+
+ FunctionHeader : OptLinkage FunctionHeaderH BEGIN {
+ $$ = CurFun.CurrentFunction;
+
+ // Make sure that we keep track of the linkage type even if there was a
+ // previous "declare".
+ $$->setLinkage($1);
+ };
+
+ END : ENDTOK | '}'; // Allow end of '}' to end a function
+
+ Function : BasicBlockList END {
+ $$ = $1;
+ };
+
+ FunctionProto : DECLARE { CurFun.isDeclare = true; } FunctionHeaderH {
+ $$ = CurFun.CurrentFunction;
+ CurFun.FunctionDone();
+ };
+
+ //===----------------------------------------------------------------------===//
+ // Rules to match Basic Blocks
+ //===----------------------------------------------------------------------===//
+
+ OptSideEffect : /* empty */ {
+ $$ = false;
+ }
+ | SIDEEFFECT {
+ $$ = true;
+ };
+
+ ConstValueRef : ESINT64VAL { // A reference to a direct constant
+ $$ = ValID::create($1);
+ }
+ | EUINT64VAL {
+ $$ = ValID::create($1);
+ }
+ | FPVAL { // Perhaps it's an FP constant?
+ $$ = ValID::create($1);
+ }
+ | TRUETOK {
+ $$ = ValID::create(ConstantBool::True);
+ }
+ | FALSETOK {
+ $$ = ValID::create(ConstantBool::False);
+ }
+ | NULL_TOK {
+ $$ = ValID::createNull();
+ }
+ | UNDEF {
+ $$ = ValID::createUndef();
+ }
+ | ZEROINITIALIZER { // A vector zero constant.
+ $$ = ValID::createZeroInit();
+ }
+ | '<' ConstVector '>' { // Nonempty unsized packed vector
+ const Type *ETy = (*$2)[0]->getType();
+ int NumElements = $2->size();
+
+ PackedType* pt = PackedType::get(ETy, NumElements);
+ PATypeHolder* PTy = new PATypeHolder(
+ HandleUpRefs(
+ PackedType::get(
+ ETy,
+ NumElements)
+ )
+ );
+
+ // Verify all elements are correct type!
+ for (unsigned i = 0; i < $2->size(); i++) {
+ if (ETy != (*$2)[i]->getType())
+ ThrowException("Element #" + utostr(i) + " is not of type '" +
+ ETy->getDescription() +"' as required!\nIt is of type '" +
+ (*$2)[i]->getType()->getDescription() + "'.");
+ }
+
+ $$ = ValID::create(ConstantPacked::get(pt, *$2));
+ delete PTy; delete $2;
+ }
+ | ConstExpr {
+ $$ = ValID::create($1);
+ }
+ | ASM_TOK OptSideEffect STRINGCONSTANT ',' STRINGCONSTANT {
+ char *End = UnEscapeLexed($3, true);
+ std::string AsmStr = std::string($3, End);
+ End = UnEscapeLexed($5, true);
+ std::string Constraints = std::string($5, End);
+ $$ = ValID::createInlineAsm(AsmStr, Constraints, $2);
+ free($3);
+ free($5);
+ };
+
+ // SymbolicValueRef - Reference to one of two ways of symbolically refering to
+ // another value.
+ //
+ SymbolicValueRef : INTVAL { // Is it an integer reference...?
+ $$ = ValID::create($1);
+ }
+ | Name { // Is it a named reference...?
+ $$ = ValID::create($1);
+ };
+
+ // ValueRef - A reference to a definition... either constant or symbolic
+ ValueRef : SymbolicValueRef | ConstValueRef;
+
+
+ // ResolvedVal - a <type> <value> pair. This is used only in cases where the
+ // type immediately preceeds the value reference, and allows complex constant
+ // pool references (for things like: 'ret [2 x int] [ int 12, int 42]')
+ ResolvedVal : Types ValueRef {
+ $$ = getVal(*$1, $2); delete $1;
+ };
+
+ BasicBlockList : BasicBlockList BasicBlock {
+ $$ = $1;
+ }
+ | FunctionHeader BasicBlock { // Do not allow functions with 0 basic blocks
+ $$ = $1;
+ };
+
+
+ // Basic blocks are terminated by branching instructions:
+ // br, br/cc, switch, ret
+ //
+ BasicBlock : InstructionList OptAssign BBTerminatorInst {
+ setValueName($3, $2);
+ InsertValue($3);
+
+ $1->getInstList().push_back($3);
+ InsertValue($1);
+ $$ = $1;
+ };
+
+ InstructionList : InstructionList Inst {
+ $1->getInstList().push_back($2);
+ $$ = $1;
+ }
+ | /* empty */ {
+ $$ = CurBB = getBBVal(ValID::create((int)CurFun.NextBBNum++), true);
+
+ // Make sure to move the basic block to the correct location in the
+ // function, instead of leaving it inserted wherever it was first
+ // referenced.
+ Function::BasicBlockListType &BBL =
+ CurFun.CurrentFunction->getBasicBlockList();
+ BBL.splice(BBL.end(), BBL, $$);
+ }
+ | LABELSTR {
+ $$ = CurBB = getBBVal(ValID::create($1), true);
+
+ // Make sure to move the basic block to the correct location in the
+ // function, instead of leaving it inserted wherever it was first
+ // referenced.
+ Function::BasicBlockListType &BBL =
+ CurFun.CurrentFunction->getBasicBlockList();
+ BBL.splice(BBL.end(), BBL, $$);
+ };
+
+ BBTerminatorInst : RET ResolvedVal { // Return with a result...
+ $$ = new ReturnInst($2);
+ }
+ | RET VOID { // Return with no result...
+ $$ = new ReturnInst();
+ }
+ | BR LABEL ValueRef { // Unconditional Branch...
+ $$ = new BranchInst(getBBVal($3));
+ } // Conditional Branch...
+ | BR BOOL ValueRef ',' LABEL ValueRef ',' LABEL ValueRef {
+ $$ = new BranchInst(getBBVal($6), getBBVal($9), getVal(Type::BoolTy, $3));
+ }
+ | SWITCH IntType ValueRef ',' LABEL ValueRef '[' JumpTable ']' {
+ SwitchInst *S = new SwitchInst(getVal($2, $3), getBBVal($6), $8->size());
+ $$ = S;
+
+ std::vector<std::pair<Constant*,BasicBlock*> >::iterator I = $8->begin(),
+ E = $8->end();
+ for (; I != E; ++I) {
+ if (ConstantInt *CI = dyn_cast<ConstantInt>(I->first))
+ S->addCase(CI, I->second);
+ else
+ ThrowException("Switch case is constant, but not a simple integer!");
+ }
+ delete $8;
+ }
+ | SWITCH IntType ValueRef ',' LABEL ValueRef '[' ']' {
+ SwitchInst *S = new SwitchInst(getVal($2, $3), getBBVal($6), 0);
+ $$ = S;
+ }
+ | INVOKE OptCallingConv TypesV ValueRef '(' ValueRefListE ')'
+ TO LABEL ValueRef UNWIND LABEL ValueRef {
+ const PointerType *PFTy;
+ const FunctionType *Ty;
+
+ if (!(PFTy = dyn_cast<PointerType>($3->get())) ||
+ !(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) {
+ // Pull out the types of all of the arguments...
+ std::vector<const Type*> ParamTypes;
+ if ($6) {
+ for (std::vector<Value*>::iterator I = $6->begin(), E = $6->end();
+ I != E; ++I)
+ ParamTypes.push_back((*I)->getType());
+ }
+
+ bool isVarArg = ParamTypes.size() && ParamTypes.back() == Type::VoidTy;
+ if (isVarArg) ParamTypes.pop_back();
+
+ Ty = FunctionType::get($3->get(), ParamTypes, isVarArg);
+ PFTy = PointerType::get(Ty);
+ }
+
+ Value *V = getVal(PFTy, $4); // Get the function we're calling...
+
+ BasicBlock *Normal = getBBVal($10);
+ BasicBlock *Except = getBBVal($13);
+
+ // Create the call node...
+ if (!$6) { // Has no arguments?
+ $$ = new InvokeInst(V, Normal, Except, std::vector<Value*>());
+ } else { // Has arguments?
+ // Loop through FunctionType's arguments and ensure they are specified
+ // correctly!
+ //
+ FunctionType::param_iterator I = Ty->param_begin();
+ FunctionType::param_iterator E = Ty->param_end();
+ std::vector<Value*>::iterator ArgI = $6->begin(), ArgE = $6->end();
+
+ for (; ArgI != ArgE && I != E; ++ArgI, ++I)
+ if ((*ArgI)->getType() != *I)
+ ThrowException("Parameter " +(*ArgI)->getName()+ " is not of type '" +
+ (*I)->getDescription() + "'!");
+
+ if (I != E || (ArgI != ArgE && !Ty->isVarArg()))
+ ThrowException("Invalid number of parameters detected!");
+
+ $$ = new InvokeInst(V, Normal, Except, *$6);
+ }
+ cast<InvokeInst>($$)->setCallingConv($2);
+
+ delete $3;
+ delete $6;
+ }
+ | UNWIND {
+ $$ = new UnwindInst();
+ }
+ | UNREACHABLE {
+ $$ = new UnreachableInst();
+ };
+
+
+
+ JumpTable : JumpTable IntType ConstValueRef ',' LABEL ValueRef {
+ $$ = $1;
+ Constant *V = cast<Constant>(getValNonImprovising($2, $3));
+ if (V == 0)
+ ThrowException("May only switch on a constant pool value!");
+
+ $$->push_back(std::make_pair(V, getBBVal($6)));
+ }
+ | IntType ConstValueRef ',' LABEL ValueRef {
+ $$ = new std::vector<std::pair<Constant*, BasicBlock*> >();
+ Constant *V = cast<Constant>(getValNonImprovising($1, $2));
+
+ if (V == 0)
+ ThrowException("May only switch on a constant pool value!");
+
+ $$->push_back(std::make_pair(V, getBBVal($5)));
+ };
+
+ Inst : OptAssign InstVal {
+ // Is this definition named?? if so, assign the name...
+ setValueName($2, $1);
+ InsertValue($2);
+ $$ = $2;
+ };
+
+ PHIList : Types '[' ValueRef ',' ValueRef ']' { // Used for PHI nodes
+ $$ = new std::list<std::pair<Value*, BasicBlock*> >();
+ $$->push_back(std::make_pair(getVal(*$1, $3), getBBVal($5)));
+ delete $1;
+ }
+ | PHIList ',' '[' ValueRef ',' ValueRef ']' {
+ $$ = $1;
+ $1->push_back(std::make_pair(getVal($1->front().first->getType(), $4),
+ getBBVal($6)));
+ };
+
+
+ ValueRefList : ResolvedVal { // Used for call statements, and memory insts...
+ $$ = new std::vector<Value*>();
+ $$->push_back($1);
+ }
+ | ValueRefList ',' ResolvedVal {
+ $$ = $1;
+ $1->push_back($3);
+ };
+
+ // ValueRefListE - Just like ValueRefList, except that it may also be empty!
+ ValueRefListE : ValueRefList | /*empty*/ { $$ = 0; };
+
+ OptTailCall : TAIL CALL {
+ $$ = true;
+ }
+ | CALL {
+ $$ = false;
+ };
+
+
+
+ InstVal : ArithmeticOps Types ValueRef ',' ValueRef {
+ if (!(*$2)->isInteger() && !(*$2)->isFloatingPoint() &&
+ !isa<PackedType>((*$2).get()))
+ ThrowException(
+ "Arithmetic operator requires integer, FP, or packed operands!");
+ if (isa<PackedType>((*$2).get()) && $1 == Instruction::Rem)
+ ThrowException("Rem not supported on packed types!");
+ $$ = BinaryOperator::create($1, getVal(*$2, $3), getVal(*$2, $5));
+ if ($$ == 0)
+ ThrowException("binary operator returned null!");
+ delete $2;
+ }
+ | LogicalOps Types ValueRef ',' ValueRef {
+ if (!(*$2)->isIntegral()) {
+ if (!isa<PackedType>($2->get()) ||
+ !cast<PackedType>($2->get())->getElementType()->isIntegral())
+ ThrowException("Logical operator requires integral operands!");
+ }
+ $$ = BinaryOperator::create($1, getVal(*$2, $3), getVal(*$2, $5));
+ if ($$ == 0)
+ ThrowException("binary operator returned null!");
+ delete $2;
+ }
+ | SetCondOps Types ValueRef ',' ValueRef {
+ if(isa<PackedType>((*$2).get())) {
+ ThrowException(
+ "PackedTypes currently not supported in setcc instructions!");
+ }
+ $$ = new SetCondInst($1, getVal(*$2, $3), getVal(*$2, $5));
+ if ($$ == 0)
+ ThrowException("binary operator returned null!");
+ delete $2;
+ }
+ | NOT ResolvedVal {
+ std::cerr << "WARNING: Use of eliminated 'not' instruction:"
+ << " Replacing with 'xor'.\n";
+
+ Value *Ones = ConstantIntegral::getAllOnesValue($2->getType());
+ if (Ones == 0)
+ ThrowException("Expected integral type for not instruction!");
+
+ $$ = BinaryOperator::create(Instruction::Xor, $2, Ones);
+ if ($$ == 0)
+ ThrowException("Could not create a xor instruction!");
+ }
+ | ShiftOps ResolvedVal ',' ResolvedVal {
+ if ($4->getType() != Type::UByteTy)
+ ThrowException("Shift amount must be ubyte!");
+ if (!$2->getType()->isInteger())
+ ThrowException("Shift constant expression requires integer operand!");
+ $$ = new ShiftInst($1, $2, $4);
+ }
+ | CAST ResolvedVal TO Types {
+ if (!$4->get()->isFirstClassType())
+ ThrowException("cast instruction to a non-primitive type: '" +
+ $4->get()->getDescription() + "'!");
+ $$ = new CastInst($2, *$4);
+ delete $4;
+ }
+ | SELECT ResolvedVal ',' ResolvedVal ',' ResolvedVal {
+ if ($2->getType() != Type::BoolTy)
+ ThrowException("select condition must be boolean!");
+ if ($4->getType() != $6->getType())
+ ThrowException("select value types should match!");
+ $$ = new SelectInst($2, $4, $6);
+ }
+ | VAARG ResolvedVal ',' Types {
+ NewVarArgs = true;
+ $$ = new VAArgInst($2, *$4);
+ delete $4;
+ }
+ | VAARG_old ResolvedVal ',' Types {
+ ObsoleteVarArgs = true;
+ const Type* ArgTy = $2->getType();
+ Function* NF = CurModule.CurrentModule->
+ getOrInsertFunction("llvm.va_copy", ArgTy, ArgTy, (Type *)0);
+
+ //b = vaarg a, t ->
+ //foo = alloca 1 of t
+ //bar = vacopy a
+ //store bar -> foo
+ //b = vaarg foo, t
+ AllocaInst* foo = new AllocaInst(ArgTy, 0, "vaarg.fix");
+ CurBB->getInstList().push_back(foo);
+ CallInst* bar = new CallInst(NF, $2);
+ CurBB->getInstList().push_back(bar);
+ CurBB->getInstList().push_back(new StoreInst(bar, foo));
+ $$ = new VAArgInst(foo, *$4);
+ delete $4;
+ }
+ | VANEXT_old ResolvedVal ',' Types {
+ ObsoleteVarArgs = true;
+ const Type* ArgTy = $2->getType();
+ Function* NF = CurModule.CurrentModule->
+ getOrInsertFunction("llvm.va_copy", ArgTy, ArgTy, (Type *)0);
+
+ //b = vanext a, t ->
+ //foo = alloca 1 of t
+ //bar = vacopy a
+ //store bar -> foo
+ //tmp = vaarg foo, t
+ //b = load foo
+ AllocaInst* foo = new AllocaInst(ArgTy, 0, "vanext.fix");
+ CurBB->getInstList().push_back(foo);
+ CallInst* bar = new CallInst(NF, $2);
+ CurBB->getInstList().push_back(bar);
+ CurBB->getInstList().push_back(new StoreInst(bar, foo));
+ Instruction* tmp = new VAArgInst(foo, *$4);
+ CurBB->getInstList().push_back(tmp);
+ $$ = new LoadInst(foo);
+ delete $4;
+ }
+ | EXTRACTELEMENT ResolvedVal ',' ResolvedVal {
+ if (!isa<PackedType>($2->getType()))
+ ThrowException("First operand of extractelement must be "
+ "packed type!");
+ if ($4->getType() != Type::UIntTy)
+ ThrowException("Second operand of extractelement must be uint!");
+ $$ = new ExtractElementInst($2, $4);
+ }
+ | INSERTELEMENT ResolvedVal ',' ResolvedVal ',' ResolvedVal {
+ if (!isa<PackedType>($2->getType()))
+ ThrowException("First operand of insertelement must be "
+ "packed type!");
+ if ($4->getType() !=
+ cast<PackedType>($2->getType())->getElementType())
+ ThrowException("Second operand of insertelement must be "
+ "packed element type!");
+ if ($6->getType() != Type::UIntTy)
+ ThrowException("Third operand of insertelement must be uint!");
+ $$ = new InsertElementInst($2, $4, $6);
+ }
+ | PHI_TOK PHIList {
+ const Type *Ty = $2->front().first->getType();
+ if (!Ty->isFirstClassType())
+ ThrowException("PHI node operands must be of first class type!");
+ $$ = new PHINode(Ty);
+ ((PHINode*)$$)->reserveOperandSpace($2->size());
+ while ($2->begin() != $2->end()) {
+ if ($2->front().first->getType() != Ty)
+ ThrowException("All elements of a PHI node must be of the same type!");
+ cast<PHINode>($$)->addIncoming($2->front().first, $2->front().second);
+ $2->pop_front();
+ }
+ delete $2; // Free the list...
+ }
+ | OptTailCall OptCallingConv TypesV ValueRef '(' ValueRefListE ')' {
+ const PointerType *PFTy;
+ const FunctionType *Ty;
+
+ if (!(PFTy = dyn_cast<PointerType>($3->get())) ||
+ !(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) {
+ // Pull out the types of all of the arguments...
+ std::vector<const Type*> ParamTypes;
+ if ($6) {
+ for (std::vector<Value*>::iterator I = $6->begin(), E = $6->end();
+ I != E; ++I)
+ ParamTypes.push_back((*I)->getType());
+ }
+
+ bool isVarArg = ParamTypes.size() && ParamTypes.back() == Type::VoidTy;
+ if (isVarArg) ParamTypes.pop_back();
+
+ if (!(*$3)->isFirstClassType() && *$3 != Type::VoidTy)
+ ThrowException("LLVM functions cannot return aggregate types!");
+
+ Ty = FunctionType::get($3->get(), ParamTypes, isVarArg);
+ PFTy = PointerType::get(Ty);
+ }
+
+ Value *V = getVal(PFTy, $4); // Get the function we're calling...
+
+ // Create the call node...
+ if (!$6) { // Has no arguments?
+ // Make sure no arguments is a good thing!
+ if (Ty->getNumParams() != 0)
+ ThrowException("No arguments passed to a function that "
+ "expects arguments!");
+
+ $$ = new CallInst(V, std::vector<Value*>());
+ } else { // Has arguments?
+ // Loop through FunctionType's arguments and ensure they are specified
+ // correctly!
+ //
+ FunctionType::param_iterator I = Ty->param_begin();
+ FunctionType::param_iterator E = Ty->param_end();
+ std::vector<Value*>::iterator ArgI = $6->begin(), ArgE = $6->end();
+
+ for (; ArgI != ArgE && I != E; ++ArgI, ++I)
+ if ((*ArgI)->getType() != *I)
+ ThrowException("Parameter " +(*ArgI)->getName()+ " is not of type '" +
+ (*I)->getDescription() + "'!");
+
+ if (I != E || (ArgI != ArgE && !Ty->isVarArg()))
+ ThrowException("Invalid number of parameters detected!");
+
+ $$ = new CallInst(V, *$6);
+ }
+ cast<CallInst>($$)->setTailCall($1);
+ cast<CallInst>($$)->setCallingConv($2);
+ delete $3;
+ delete $6;
+ }
+ | MemoryInst {
+ $$ = $1;
+ };
+
+
+ // IndexList - List of indices for GEP based instructions...
+ IndexList : ',' ValueRefList {
+ $$ = $2;
+ } | /* empty */ {
+ $$ = new std::vector<Value*>();
+ };
+
+ OptVolatile : VOLATILE {
+ $$ = true;
+ }
+ | /* empty */ {
+ $$ = false;
+ };
+
+
+
+ MemoryInst : MALLOC Types OptCAlign {
+ $$ = new MallocInst(*$2, 0, $3);
+ delete $2;
+ }
+ | MALLOC Types ',' UINT ValueRef OptCAlign {
+ $$ = new MallocInst(*$2, getVal($4, $5), $6);
+ delete $2;
+ }
+ | ALLOCA Types OptCAlign {
+ $$ = new AllocaInst(*$2, 0, $3);
+ delete $2;
+ }
+ | ALLOCA Types ',' UINT ValueRef OptCAlign {
+ $$ = new AllocaInst(*$2, getVal($4, $5), $6);
+ delete $2;
+ }
+ | FREE ResolvedVal {
+ if (!isa<PointerType>($2->getType()))
+ ThrowException("Trying to free nonpointer type " +
+ $2->getType()->getDescription() + "!");
+ $$ = new FreeInst($2);
+ }
+
+ | OptVolatile LOAD Types ValueRef {
+ if (!isa<PointerType>($3->get()))
+ ThrowException("Can't load from nonpointer type: " +
+ (*$3)->getDescription());
+ if (!cast<PointerType>($3->get())->getElementType()->isFirstClassType())
+ ThrowException("Can't load from pointer of non-first-class type: " +
+ (*$3)->getDescription());
+ $$ = new LoadInst(getVal(*$3, $4), "", $1);
+ delete $3;
+ }
+ | OptVolatile STORE ResolvedVal ',' Types ValueRef {
+ const PointerType *PT = dyn_cast<PointerType>($5->get());
+ if (!PT)
+ ThrowException("Can't store to a nonpointer type: " +
+ (*$5)->getDescription());
+ const Type *ElTy = PT->getElementType();
+ if (ElTy != $3->getType())
+ ThrowException("Can't store '" + $3->getType()->getDescription() +
+ "' into space of type '" + ElTy->getDescription() + "'!");
+
+ $$ = new StoreInst($3, getVal(*$5, $6), $1);
+ delete $5;
+ }
+ | GETELEMENTPTR Types ValueRef IndexList {
+ if (!isa<PointerType>($2->get()))
+ ThrowException("getelementptr insn requires pointer operand!");
+
+ // LLVM 1.2 and earlier used ubyte struct indices. Convert any ubyte struct
+ // indices to uint struct indices for compatibility.
+ generic_gep_type_iterator<std::vector<Value*>::iterator>
+ GTI = gep_type_begin($2->get(), $4->begin(), $4->end()),
+ GTE = gep_type_end($2->get(), $4->begin(), $4->end());
+ for (unsigned i = 0, e = $4->size(); i != e && GTI != GTE; ++i, ++GTI)
+ if (isa<StructType>(*GTI)) // Only change struct indices
+ if (ConstantUInt *CUI = dyn_cast<ConstantUInt>((*$4)[i]))
+ if (CUI->getType() == Type::UByteTy)
+ (*$4)[i] = ConstantExpr::getCast(CUI, Type::UIntTy);
+
+ if (!GetElementPtrInst::getIndexedType(*$2, *$4, true))
+ ThrowException("Invalid getelementptr indices for type '" +
+ (*$2)->getDescription()+ "'!");
+ $$ = new GetElementPtrInst(getVal(*$2, $3), *$4);
+ delete $2; delete $4;
+ };
+
+
+ %%
+ int yyerror(const char *ErrorMsg) {
+ std::string where
+ = std::string((CurFilename == "-") ? std::string("<stdin>") : CurFilename)
+ + ":" + utostr((unsigned) llvmAsmlineno) + ": ";
+ std::string errMsg = std::string(ErrorMsg) + "\n" + where + " while reading ";
+ if (yychar == YYEMPTY || yychar == 0)
+ errMsg += "end-of-file.";
+ else
+ errMsg += "token: '" + std::string(llvmAsmtext, llvmAsmleng) + "'";
+ ThrowException(errMsg);
+ return 0;
+ }
Index: llvm/lib/AsmParser/Lexer.cpp.cvs
diff -u llvm/lib/AsmParser/Lexer.cpp.cvs:1.2 llvm/lib/AsmParser/Lexer.cpp.cvs:1.3
--- llvm/lib/AsmParser/Lexer.cpp.cvs:1.2 Wed Feb 15 01:02:59 2006
+++ llvm/lib/AsmParser/Lexer.cpp.cvs Wed Feb 15 01:22:58 2006
@@ -20,7 +20,7 @@
/* A lexical scanner generated by flex */
/* Scanner skeleton version:
- * $Header: /home/vadve/shared/PublicCVS/llvm/lib/AsmParser/Lexer.cpp.cvs,v 1.2 2006/02/15 07:02:59 lattner Exp $
+ * $Header: /home/vadve/shared/PublicCVS/llvm/lib/AsmParser/Lexer.cpp.cvs,v 1.3 2006/02/15 07:22:58 lattner Exp $
*/
#define FLEX_SCANNER
More information about the llvm-commits
mailing list