/* A Bison parser, made from /Users/clamb/Documents/llvm/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 ESAPINTVAL 259 #define EUAPINTVAL 260 #define LOCALVAL_ID 261 #define GLOBALVAL_ID 262 #define FPVAL 263 #define VOID 264 #define INTTYPE 265 #define FLOAT 266 #define DOUBLE 267 #define X86_FP80 268 #define FP128 269 #define PPC_FP128 270 #define LABEL 271 #define TYPE 272 #define LOCALVAR 273 #define GLOBALVAR 274 #define LABELSTR 275 #define STRINGCONSTANT 276 #define ATSTRINGCONSTANT 277 #define PCTSTRINGCONSTANT 278 #define ZEROINITIALIZER 279 #define TRUETOK 280 #define FALSETOK 281 #define BEGINTOK 282 #define ENDTOK 283 #define DECLARE 284 #define DEFINE 285 #define GLOBAL 286 #define CONSTANT 287 #define SECTION 288 #define ALIAS 289 #define VOLATILE 290 #define THREAD_LOCAL 291 #define TO 292 #define DOTDOTDOT 293 #define NULL_TOK 294 #define UNDEF 295 #define INTERNAL 296 #define LINKONCE 297 #define WEAK 298 #define APPENDING 299 #define DLLIMPORT 300 #define DLLEXPORT 301 #define EXTERN_WEAK 302 #define OPAQUE 303 #define EXTERNAL 304 #define TARGET 305 #define TRIPLE 306 #define ALIGN 307 #define ADDRSPACE 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 X86_STDCALLCC_TOK 319 #define X86_FASTCALLCC_TOK 320 #define DATALAYOUT 321 #define RET 322 #define BR 323 #define SWITCH 324 #define INVOKE 325 #define UNWIND 326 #define UNREACHABLE 327 #define ADD 328 #define SUB 329 #define MUL 330 #define UDIV 331 #define SDIV 332 #define FDIV 333 #define UREM 334 #define SREM 335 #define FREM 336 #define AND 337 #define OR 338 #define XOR 339 #define SHL 340 #define LSHR 341 #define ASHR 342 #define ICMP 343 #define FCMP 344 #define EQ 345 #define NE 346 #define SLT 347 #define SGT 348 #define SLE 349 #define SGE 350 #define ULT 351 #define UGT 352 #define ULE 353 #define UGE 354 #define OEQ 355 #define ONE 356 #define OLT 357 #define OGT 358 #define OLE 359 #define OGE 360 #define ORD 361 #define UNO 362 #define UEQ 363 #define UNE 364 #define MALLOC 365 #define ALLOCA 366 #define FREE 367 #define LOAD 368 #define STORE 369 #define GETELEMENTPTR 370 #define TRUNC 371 #define ZEXT 372 #define SEXT 373 #define FPTRUNC 374 #define FPEXT 375 #define BITCAST 376 #define UITOFP 377 #define SITOFP 378 #define FPTOUI 379 #define FPTOSI 380 #define INTTOPTR 381 #define PTRTOINT 382 #define PHI_TOK 383 #define SELECT 384 #define VAARG 385 #define EXTRACTELEMENT 386 #define INSERTELEMENT 387 #define SHUFFLEVECTOR 388 #define SIGNEXT 389 #define ZEROEXT 390 #define NORETURN 391 #define INREG 392 #define SRET 393 #define NOUNWIND 394 #define NOALIAS 395 #define BYVAL 396 #define NEST 397 #define READNONE 398 #define READONLY 399 #define GC 400 #define DEFAULT 401 #define HIDDEN 402 #define PROTECTED 403 #line 14 "/Users/clamb/Documents/llvm/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/ValueSymbolTable.h" #include "llvm/AutoUpgrade.h" #include "llvm/Support/GetElementPtrTypeIterator.h" #include "llvm/Support/CommandLine.h" #include "llvm/ADT/SmallVector.h" #include "llvm/ADT/STLExtras.h" #include "llvm/Support/MathExtras.h" #include "llvm/Support/Streams.h" #include #include #include #include // The following is a gross hack. In order to rid the libAsmParser library of // exceptions, we have to have a way of getting the yyparse function to go into // an error situation. So, whenever we want an error to occur, the GenerateError // function (see bottom of file) sets TriggerError. Then, at the end of each // production in the grammer we use CHECK_FOR_ERROR which will invoke YYERROR // (a goto) to put YACC in error state. Furthermore, several calls to // GenerateError are made from inside productions and they must simulate the // previous exception behavior by exiting the production immediately. We have // replaced these with the GEN_ERROR macro which calls GeneratError and then // immediately invokes YYERROR. This would be so much cleaner if it was a // recursive descent parser. static bool TriggerError = false; #define CHECK_FOR_ERROR { if (TriggerError) { TriggerError = false; YYABORT; } } #define GEN_ERROR(msg) { GenerateError(msg); YYERROR; } int yyerror(const char *ErrorMsg); // Forward declarations to prevent "implicit int yylex(); // declaration" of xxx warnings. int yyparse(); 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) cerr << X #else #define UR_OUT(X) #endif #define YYERROR_VERBOSE 1 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 ValueList; // Numbered defs static void ResolveDefinitions(ValueList &LateResolvers, ValueList *FutureLateResolvers=0); static struct PerModuleInfo { Module *CurrentModule; ValueList Values; // Module level numbered definitions ValueList LateResolveValues; std::vector Types; std::map LateResolveTypes; /// PlaceHolderInfo - When temporary placeholder objects are created, remember /// how they were referenced and on which line of the input they came from so /// that we can resolve them later and print error messages as appropriate. std::map > PlaceHolderInfo; // GlobalRefs - This maintains a mapping between '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, 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); if (TriggerError) return; // 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"; } GenerateError(UndefinedReferences); return; } // Look for intrinsic functions and CallInst that need to be upgraded for (Module::iterator FI = CurrentModule->begin(), FE = CurrentModule->end(); FI != FE; ) UpgradeCallsToIntrinsic(FI++); // must be post-increment, as we remove 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; } bool TypeIsUnresolved(PATypeHolder* PATy) { // If it isn't abstract, its resolved const Type* Ty = PATy->get(); if (!Ty->isAbstract()) return false; // Traverse the type looking for abstract types. If it isn't abstract then // we don't need to traverse that leg of the type. std::vector WorkList, SeenList; WorkList.push_back(Ty); while (!WorkList.empty()) { const Type* Ty = WorkList.back(); SeenList.push_back(Ty); WorkList.pop_back(); if (const OpaqueType* OpTy = dyn_cast(Ty)) { // Check to see if this is an unresolved type std::map::iterator I = LateResolveTypes.begin(); std::map::iterator E = LateResolveTypes.end(); for ( ; I != E; ++I) { if (I->second.get() == OpTy) return true; } } else if (const SequentialType* SeqTy = dyn_cast(Ty)) { const Type* TheTy = SeqTy->getElementType(); if (TheTy->isAbstract() && TheTy != Ty) { std::vector::iterator I = SeenList.begin(), E = SeenList.end(); for ( ; I != E; ++I) if (*I == TheTy) break; if (I == E) WorkList.push_back(TheTy); } } else if (const StructType* StrTy = dyn_cast(Ty)) { for (unsigned i = 0; i < StrTy->getNumElements(); ++i) { const Type* TheTy = StrTy->getElementType(i); if (TheTy->isAbstract() && TheTy != Ty) { std::vector::iterator I = SeenList.begin(), E = SeenList.end(); for ( ; I != E; ++I) if (*I == TheTy) break; if (I == E) WorkList.push_back(TheTy); } } } } return false; } } CurModule; static struct PerFunctionInfo { Function *CurrentFunction; // Pointer to current function being created ValueList Values; // Keep track of #'d definitions unsigned NextValNum; ValueList LateResolveValues; bool isDeclare; // Is this function a forward declararation? GlobalValue::LinkageTypes Linkage; // Linkage for forward declaration. GlobalValue::VisibilityTypes Visibility; /// BBForwardRefs - When we see forward references to basic blocks, keep /// track of them here. std::map BBForwardRefs; inline PerFunctionInfo() { CurrentFunction = 0; isDeclare = false; Linkage = GlobalValue::ExternalLinkage; Visibility = GlobalValue::DefaultVisibility; } inline void FunctionStart(Function *M) { CurrentFunction = M; NextValNum = 0; } void FunctionDone() { // Any forward referenced blocks left? if (!BBForwardRefs.empty()) { GenerateError("Undefined reference to label " + BBForwardRefs.begin()->second->getName()); return; } // Resolve all forward references now. ResolveDefinitions(LateResolveValues, &CurModule.LateResolveValues); Values.clear(); // Clear out function local definitions BBForwardRefs.clear(); CurrentFunction = 0; isDeclare = false; Linkage = GlobalValue::ExternalLinkage; Visibility = GlobalValue::DefaultVisibility; } } CurFun; // Info for the current function... static bool inFunctionScope() { return CurFun.CurrentFunction != 0; } //===----------------------------------------------------------------------===// // Code to handle definitions of all the types //===----------------------------------------------------------------------===// static void InsertValue(Value *V, ValueList &ValueTab = CurFun.Values) { // Things that have names or are void typed don't get slot numbers if (V->hasName() || (V->getType() == Type::VoidTy)) return; // In the case of function values, we have to allow for the forward reference // of basic blocks, which are included in the numbering. Consequently, we keep // track of the next insertion location with NextValNum. When a BB gets // inserted, it could change the size of the CurFun.Values vector. if (&ValueTab == &CurFun.Values) { if (ValueTab.size() <= CurFun.NextValNum) ValueTab.resize(CurFun.NextValNum+1); ValueTab[CurFun.NextValNum++] = V; return; } // For all other lists, its okay to just tack it on the back of the vector. ValueTab.push_back(V); } static const Type *getTypeVal(const ValID &D, bool DoNotImprovise = false) { switch (D.Type) { case ValID::LocalID: // Is it a numbered definition? // Module constants occupy the lowest numbered slots... if (D.Num < CurModule.Types.size()) return CurModule.Types[D.Num]; break; case ValID::LocalName: // Is it a named definition? if (const Type *N = CurModule.CurrentModule->getTypeByName(D.getName())) { D.destroy(); // Free old strdup'd memory... return N; } break; default: GenerateError("Internal parser error: Invalid symbol type reference"); return 0; } // 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::LocalName) { GenerateError("Reference to an undefined type: '" + D.getName() + "'"); return 0; } else { GenerateError("Reference to an undefined type: #" + utostr(D.Num)); return 0; } } std::map::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; } // getExistingVal - 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 *getExistingVal(const Type *Ty, const ValID &D) { if (isa(Ty)) { GenerateError("Functions are not values and " "must be referenced as pointers"); return 0; } switch (D.Type) { case ValID::LocalID: { // Is it a numbered definition? // Check that the number is within bounds. if (D.Num >= CurFun.Values.size()) return 0; Value *Result = CurFun.Values[D.Num]; if (Ty != Result->getType()) { GenerateError("Numbered value (%" + utostr(D.Num) + ") of type '" + Result->getType()->getDescription() + "' does not match " "expected type, '" + Ty->getDescription() + "'"); return 0; } return Result; } case ValID::GlobalID: { // Is it a numbered definition? if (D.Num >= CurModule.Values.size()) return 0; Value *Result = CurModule.Values[D.Num]; if (Ty != Result->getType()) { GenerateError("Numbered value (@" + utostr(D.Num) + ") of type '" + Result->getType()->getDescription() + "' does not match " "expected type, '" + Ty->getDescription() + "'"); return 0; } return Result; } case ValID::LocalName: { // Is it a named definition? if (!inFunctionScope()) return 0; ValueSymbolTable &SymTab = CurFun.CurrentFunction->getValueSymbolTable(); Value *N = SymTab.lookup(D.getName()); if (N == 0) return 0; if (N->getType() != Ty) return 0; D.destroy(); // Free old strdup'd memory... return N; } case ValID::GlobalName: { // Is it a named definition? ValueSymbolTable &SymTab = CurModule.CurrentModule->getValueSymbolTable(); Value *N = SymTab.lookup(D.getName()); if (N == 0) return 0; if (N->getType() != Ty) 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 (!ConstantInt::isValueValidForType(Ty, D.ConstPool64)) { GenerateError("Signed integral constant '" + itostr(D.ConstPool64) + "' is invalid for type '" + Ty->getDescription() + "'"); return 0; } return ConstantInt::get(Ty, D.ConstPool64, true); case ValID::ConstUIntVal: // Is it an unsigned const pool reference? if (!ConstantInt::isValueValidForType(Ty, D.UConstPool64)) { if (!ConstantInt::isValueValidForType(Ty, D.ConstPool64)) { GenerateError("Integral constant '" + utostr(D.UConstPool64) + "' is invalid or out of range"); return 0; } else { // This is really a signed reference. Transmogrify. return ConstantInt::get(Ty, D.ConstPool64, true); } } else { return ConstantInt::get(Ty, D.UConstPool64); } case ValID::ConstFPVal: // Is it a floating point const pool reference? if (!ConstantFP::isValueValidForType(Ty, *D.ConstPoolFP)) { GenerateError("FP constant invalid for type"); return 0; } // Lexer has no type info, so builds all float and double FP constants // as double. Fix this here. Long double does not need this. if (&D.ConstPoolFP->getSemantics() == &APFloat::IEEEdouble && Ty==Type::FloatTy) D.ConstPoolFP->convert(APFloat::IEEEsingle, APFloat::rmNearestTiesToEven); return ConstantFP::get(Ty, *D.ConstPoolFP); case ValID::ConstNullVal: // Is it a null value? if (!isa(Ty)) { GenerateError("Cannot create a a non pointer null"); return 0; } return ConstantPointerNull::get(cast(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) { GenerateError("Constant expression type different from required type"); return 0; } return D.ConstantValue; case ValID::InlineAsmVal: { // Inline asm expression const PointerType *PTy = dyn_cast(Ty); const FunctionType *FTy = PTy ? dyn_cast(PTy->getElementType()) : 0; if (!FTy || !InlineAsm::Verify(FTy, D.IAD->Constraints)) { GenerateError("Invalid type for asm constraint string"); return 0; } 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 getExistingVal, 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) { GenerateError("Cannot use a basic block here"); return 0; } // See if the value has already been defined. Value *V = getExistingVal(Ty, ID); if (V) return V; if (TriggerError) return 0; if (!Ty->isFirstClassType() && !isa(Ty)) { GenerateError("Invalid use of a composite type"); return 0; } // 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... // switch (ID.Type) { case ValID::GlobalName: case ValID::GlobalID: { const PointerType *PTy = dyn_cast(Ty); if (!PTy) { GenerateError("Invalid type for reference to global" ); return 0; } const Type* ElTy = PTy->getElementType(); if (const FunctionType *FTy = dyn_cast(ElTy)) V = new Function(FTy, GlobalValue::ExternalLinkage); else V = new GlobalVariable(ElTy, false, GlobalValue::ExternalLinkage, 0, "", (Module*)0, false, PTy->getAddressSpace()); break; } default: 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, LLLgetLineNo()))); if (inFunctionScope()) InsertValue(V, CurFun.LateResolveValues); else InsertValue(V, CurModule.LateResolveValues); return V; } /// defineBBVal - This is a definition of a new basic block with the specified /// identifier which must be the same as CurFun.NextValNum, if its numeric. static BasicBlock *defineBBVal(const ValID &ID) { assert(inFunctionScope() && "Can't get basic block at global scope!"); BasicBlock *BB = 0; // First, see if this was forward referenced std::map::iterator BBI = CurFun.BBForwardRefs.find(ID); if (BBI != CurFun.BBForwardRefs.end()) { BB = BBI->second; // 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); // We're about to erase the entry, save the key so we can clean it up. ValID Tmp = BBI->first; // Erase the forward ref from the map as its no longer "forward" CurFun.BBForwardRefs.erase(ID); // The key has been removed from the map but so we don't want to leave // strdup'd memory around so destroy it too. Tmp.destroy(); // If its a numbered definition, bump the number and set the BB value. if (ID.Type == ValID::LocalID) { assert(ID.Num == CurFun.NextValNum && "Invalid new block number"); InsertValue(BB); } ID.destroy(); return BB; } // We haven't seen this BB before and its first mention is a definition. // Just create it and return it. std::string Name (ID.Type == ValID::LocalName ? ID.getName() : ""); BB = new BasicBlock(Name, CurFun.CurrentFunction); if (ID.Type == ValID::LocalID) { assert(ID.Num == CurFun.NextValNum && "Invalid new block number"); InsertValue(BB); } ID.destroy(); // Free strdup'd memory return BB; } /// getBBVal - get an existing BB value or create a forward reference for it. /// static BasicBlock *getBBVal(const ValID &ID) { assert(inFunctionScope() && "Can't get basic block at global scope!"); BasicBlock *BB = 0; std::map::iterator BBI = CurFun.BBForwardRefs.find(ID); if (BBI != CurFun.BBForwardRefs.end()) { BB = BBI->second; } if (ID.Type == ValID::LocalName) { std::string Name = ID.getName(); Value *N = CurFun.CurrentFunction->getValueSymbolTable().lookup(Name); if (N) if (N->getType()->getTypeID() == Type::LabelTyID) BB = cast(N); else GenerateError("Reference to label '" + Name + "' is actually of type '"+ N->getType()->getDescription() + "'"); } else if (ID.Type == ValID::LocalID) { if (ID.Num < CurFun.NextValNum && ID.Num < CurFun.Values.size()) { if (CurFun.Values[ID.Num]->getType()->getTypeID() == Type::LabelTyID) BB = cast(CurFun.Values[ID.Num]); else GenerateError("Reference to label '%" + utostr(ID.Num) + "' is actually of type '"+ CurFun.Values[ID.Num]->getType()->getDescription() + "'"); } } else { GenerateError("Illegal label reference " + ID.getName()); return 0; } // If its already been defined, return it now. if (BB) { ID.destroy(); // Free strdup'd memory. return BB; } // Otherwise, this block has not been seen before, create it. std::string Name; if (ID.Type == ValID::LocalName) Name = ID.getName(); BB = new BasicBlock(Name, CurFun.CurrentFunction); // Insert it in the forward refs map. CurFun.BBForwardRefs[ID] = BB; 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(ValueList &LateResolvers, ValueList *FutureLateResolvers) { // Loop over LateResolveDefs fixing up stuff that couldn't be resolved while (!LateResolvers.empty()) { Value *V = LateResolvers.back(); LateResolvers.pop_back(); std::map >::iterator PHI = CurModule.PlaceHolderInfo.find(V); assert(PHI != CurModule.PlaceHolderInfo.end() && "Placeholder error!"); ValID &DID = PHI->second.first; Value *TheRealValue = getExistingVal(V->getType(), DID); if (TriggerError) return; 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::LocalName || DID.Type == ValID::GlobalName) { GenerateError("Reference to an invalid definition: '" +DID.getName()+ "' of type '" + V->getType()->getDescription() + "'", PHI->second.second); return; } else { GenerateError("Reference to an invalid definition: #" + itostr(DID.Num) + " of type '" + V->getType()->getDescription() + "'", PHI->second.second); return; } } } 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(std::string *Name, const Type *ToTy) { ValID D; if (Name) D = ValID::createLocalName(*Name); else D = ValID::createLocalID(CurModule.Types.size()); std::map::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, std::string *NameStr) { if (!NameStr) return; std::string Name(*NameStr); // Copy string delete NameStr; // Free old string if (V->getType() == Type::VoidTy) { GenerateError("Can't assign name '" + Name+"' to value with void type"); return; } assert(inFunctionScope() && "Must be in function scope!"); ValueSymbolTable &ST = CurFun.CurrentFunction->getValueSymbolTable(); if (ST.lookup(Name)) { GenerateError("Redefinition of value '" + Name + "' of type '" + V->getType()->getDescription() + "'"); return; } // 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(std::string *NameStr, GlobalValue::LinkageTypes Linkage, GlobalValue::VisibilityTypes Visibility, bool isConstantGlobal, const Type *Ty, Constant *Initializer, bool IsThreadLocal, unsigned AddressSpace = 0) { if (isa(Ty)) { GenerateError("Cannot declare global vars of function type"); return 0; } const PointerType *PTy = PointerType::get(Ty, AddressSpace); std::string Name; if (NameStr) { Name = *NameStr; // Copy string delete NameStr; // Free old string } // See if this global value was forward referenced. If so, recycle the // object. ValID ID; if (!Name.empty()) { ID = ValID::createGlobalName(Name); } else { ID = ValID::createGlobalID(CurModule.Values.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(FWGV); CurModule.CurrentModule->getGlobalList().remove(GV); CurModule.CurrentModule->getGlobalList().push_back(GV); GV->setInitializer(Initializer); GV->setLinkage(Linkage); GV->setVisibility(Visibility); GV->setConstant(isConstantGlobal); GV->setThreadLocal(IsThreadLocal); InsertValue(GV, CurModule.Values); return GV; } // If this global has a name if (!Name.empty()) { // if the global we're parsing has an initializer (is a definition) and // has external linkage. if (Initializer && Linkage != GlobalValue::InternalLinkage) // If there is already a global with external linkage with this name if (CurModule.CurrentModule->getGlobalVariable(Name, false)) { // If we allow this GVar to get created, it will be renamed in the // symbol table because it conflicts with an existing GVar. We can't // allow redefinition of GVars whose linking indicates that their name // must stay the same. Issue the error. GenerateError("Redefinition of global variable named '" + Name + "' of type '" + Ty->getDescription() + "'"); return 0; } } // Otherwise there is no existing GV to use, create one now. GlobalVariable *GV = new GlobalVariable(Ty, isConstantGlobal, Linkage, Initializer, Name, CurModule.CurrentModule, IsThreadLocal, AddressSpace); GV->setVisibility(Visibility); 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, std::string *NameStr) { assert(!inFunctionScope() && "Can't give types function-local names!"); if (NameStr == 0) return false; std::string Name(*NameStr); // Copy string delete NameStr; // Free old string // We don't allow assigning names to void type if (T == Type::VoidTy) { GenerateError("Can't assign name '" + Name + "' to the void type"); return false; } // 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(Existing)) { // We ARE replacing an opaque type! const_cast(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. GenerateError("Redefinition of type named '" + Name + "' of type '" + T->getDescription() + "'"); } 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 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 isn't abstract, or if there are no up-references in it, then there is // nothing to resolve here. if (!ty->isAbstract() || UpRefs.empty()) 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; } //===----------------------------------------------------------------------===// // RunVMAsmParser - Define an interface to this parser //===----------------------------------------------------------------------===// // static Module* RunParser(Module * M); Module *llvm::RunVMAsmParser(llvm::MemoryBuffer *MB) { InitLLLexer(MB); Module *M = RunParser(new Module(LLLgetFilename())); FreeLexer(); return M; } #line 947 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" typedef union { llvm::Module *ModuleVal; llvm::Function *FunctionVal; llvm::BasicBlock *BasicBlockVal; llvm::TerminatorInst *TermInstVal; llvm::Instruction *InstVal; llvm::Constant *ConstVal; const llvm::Type *PrimType; std::list *TypeList; llvm::PATypeHolder *TypeVal; llvm::Value *ValueVal; std::vector *ValueList; llvm::ArgListType *ArgList; llvm::TypeWithAttrs TypeWithAttrs; llvm::TypeWithAttrsList *TypeWithAttrsList; llvm::ParamList *ParamList; // Represent the RHS of PHI node std::list > *PHIList; std::vector > *JumpTable; std::vector *ConstVector; llvm::GlobalValue::LinkageTypes Linkage; llvm::GlobalValue::VisibilityTypes Visibility; uint16_t ParamAttrs; llvm::APInt *APIntVal; int64_t SInt64Val; uint64_t UInt64Val; int SIntVal; unsigned UIntVal; llvm::APFloat *FPVal; bool BoolVal; std::string *StrVal; // This memory must be deleted llvm::ValID ValIDVal; llvm::Instruction::BinaryOps BinaryOpVal; llvm::Instruction::TermOps TermOpVal; llvm::Instruction::MemoryOps MemOpVal; llvm::Instruction::CastOps CastOpVal; llvm::Instruction::OtherOps OtherOpVal; llvm::ICmpInst::Predicate IPredicate; llvm::FCmpInst::Predicate FPredicate; } YYSTYPE; #include #ifndef __cplusplus #ifndef __STDC__ #define const #endif #endif #define YYFINAL 619 #define YYFLAG -32768 #define YYNTBASE 164 #define YYTRANSLATE(x) ((unsigned)(x) <= 403 ? yytranslate[x] : 247) static const short 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, 150, 151, 154, 2, 153, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 159, 152, 160, 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, 156, 155, 158, 2, 2, 2, 2, 2, 163, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 157, 2, 2, 161, 2, 162, 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, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149 }; #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, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100, 102, 104, 106, 108, 110, 112, 114, 116, 118, 120, 122, 124, 126, 127, 132, 133, 136, 137, 139, 141, 143, 144, 147, 149, 151, 153, 155, 157, 159, 161, 163, 164, 166, 168, 170, 171, 173, 175, 176, 178, 180, 182, 184, 185, 187, 189, 190, 192, 194, 196, 198, 200, 203, 205, 207, 209, 211, 213, 215, 217, 219, 221, 222, 225, 227, 229, 231, 233, 235, 237, 238, 241, 242, 245, 246, 249, 250, 254, 257, 258, 260, 261, 265, 267, 270, 272, 274, 276, 278, 280, 282, 284, 286, 288, 292, 294, 297, 303, 309, 315, 321, 325, 328, 334, 339, 342, 344, 346, 348, 352, 354, 358, 360, 361, 363, 367, 372, 376, 380, 385, 390, 394, 401, 407, 410, 413, 416, 419, 422, 425, 428, 431, 434, 437, 440, 443, 450, 456, 465, 472, 479, 487, 495, 502, 511, 520, 524, 526, 528, 530, 532, 533, 536, 543, 545, 546, 548, 551, 552, 556, 557, 561, 565, 569, 573, 574, 583, 584, 594, 595, 605, 611, 614, 618, 620, 624, 628, 632, 636, 638, 639, 645, 649, 651, 655, 657, 658, 669, 671, 673, 678, 680, 682, 685, 689, 690, 692, 694, 696, 698, 700, 702, 704, 706, 708, 712, 714, 720, 722, 724, 726, 728, 730, 732, 735, 738, 741, 745, 748, 749, 751, 754, 757, 761, 771, 781, 790, 805, 807, 809, 816, 822, 825, 832, 840, 845, 850, 857, 864, 865, 866, 870, 873, 875, 881, 887, 894, 901, 906, 913, 918, 923, 930, 937, 940, 949, 951, 953, 954, 958, 965, 969, 976, 979, 985, 993 }; static const short yyrhs[] = { 74, 0, 75, 0, 76, 0, 77, 0, 78, 0, 79, 0, 80, 0, 81, 0, 82, 0, 86, 0, 87, 0, 88, 0, 83, 0, 84, 0, 85, 0, 117, 0, 118, 0, 119, 0, 120, 0, 121, 0, 122, 0, 123, 0, 124, 0, 125, 0, 126, 0, 127, 0, 128, 0, 91, 0, 92, 0, 93, 0, 94, 0, 95, 0, 96, 0, 97, 0, 98, 0, 99, 0, 100, 0, 101, 0, 102, 0, 103, 0, 104, 0, 105, 0, 106, 0, 107, 0, 108, 0, 109, 0, 110, 0, 97, 0, 98, 0, 99, 0, 100, 0, 26, 0, 27, 0, 11, 0, 12, 0, 13, 0, 16, 0, 15, 0, 14, 0, 19, 0, 22, 0, 24, 0, 171, 0, 0, 54, 150, 4, 151, 0, 0, 171, 152, 0, 0, 20, 0, 23, 0, 177, 0, 0, 175, 152, 0, 42, 0, 44, 0, 43, 0, 45, 0, 47, 0, 46, 0, 48, 0, 50, 0, 0, 147, 0, 148, 0, 149, 0, 0, 46, 0, 48, 0, 0, 42, 0, 43, 0, 44, 0, 47, 0, 0, 44, 0, 42, 0, 0, 62, 0, 63, 0, 64, 0, 65, 0, 66, 0, 61, 4, 0, 136, 0, 118, 0, 135, 0, 119, 0, 138, 0, 139, 0, 141, 0, 142, 0, 143, 0, 0, 186, 185, 0, 137, 0, 140, 0, 136, 0, 135, 0, 144, 0, 145, 0, 0, 188, 187, 0, 0, 146, 22, 0, 0, 53, 4, 0, 0, 153, 53, 4, 0, 34, 22, 0, 0, 192, 0, 0, 153, 195, 194, 0, 192, 0, 53, 4, 0, 11, 0, 12, 0, 13, 0, 16, 0, 15, 0, 14, 0, 17, 0, 49, 0, 196, 0, 197, 173, 154, 0, 231, 0, 155, 4, 0, 197, 150, 201, 151, 188, 0, 10, 150, 201, 151, 188, 0, 156, 4, 157, 197, 158, 0, 159, 4, 157, 197, 160, 0, 161, 202, 162, 0, 161, 162, 0, 159, 161, 202, 162, 160, 0, 159, 161, 162, 160, 0, 197, 186, 0, 197, 0, 10, 0, 198, 0, 200, 153, 198, 0, 200, 0, 200, 153, 39, 0, 39, 0, 0, 197, 0, 202, 153, 197, 0, 197, 156, 205, 158, 0, 197, 156, 158, 0, 197, 163, 22, 0, 197, 159, 205, 160, 0, 197, 161, 205, 162, 0, 197, 161, 162, 0, 197, 159, 161, 205, 162, 160, 0, 197, 159, 161, 162, 160, 0, 197, 40, 0, 197, 41, 0, 197, 231, 0, 197, 204, 0, 197, 25, 0, 169, 3, 0, 169, 5, 0, 169, 4, 0, 169, 6, 0, 11, 26, 0, 11, 27, 0, 170, 9, 0, 166, 150, 203, 38, 197, 151, 0, 116, 150, 203, 242, 151, 0, 130, 150, 203, 153, 203, 153, 203, 151, 0, 164, 150, 203, 153, 203, 151, 0, 165, 150, 203, 153, 203, 151, 0, 89, 167, 150, 203, 153, 203, 151, 0, 90, 168, 150, 203, 153, 203, 151, 0, 132, 150, 203, 153, 203, 151, 0, 133, 150, 203, 153, 203, 153, 203, 151, 0, 134, 150, 203, 153, 203, 153, 203, 151, 0, 205, 153, 203, 0, 203, 0, 32, 0, 33, 0, 37, 0, 0, 199, 231, 0, 122, 150, 208, 38, 197, 151, 0, 210, 0, 0, 211, 0, 210, 211, 0, 0, 31, 212, 227, 0, 0, 30, 213, 228, 0, 59, 58, 217, 0, 174, 18, 197, 0, 174, 18, 10, 0, 0, 176, 180, 207, 206, 203, 173, 214, 194, 0, 0, 176, 178, 180, 207, 206, 203, 173, 215, 194, 0, 0, 176, 179, 180, 207, 206, 197, 173, 216, 194, 0, 176, 180, 35, 183, 208, 0, 51, 218, 0, 55, 152, 219, 0, 22, 0, 52, 152, 22, 0, 67, 152, 22, 0, 156, 220, 158, 0, 220, 153, 22, 0, 22, 0, 0, 221, 153, 197, 186, 172, 0, 197, 186, 172, 0, 221, 0, 221, 153, 39, 0, 39, 0, 0, 184, 199, 175, 150, 222, 151, 188, 193, 190, 189, 0, 28, 0, 161, 0, 182, 180, 223, 224, 0, 29, 0, 162, 0, 234, 226, 0, 181, 180, 223, 0, 0, 60, 0, 3, 0, 4, 0, 9, 0, 26, 0, 27, 0, 40, 0, 41, 0, 25, 0, 159, 205, 160, 0, 204, 0, 58, 229, 22, 153, 22, 0, 7, 0, 8, 0, 171, 0, 175, 0, 231, 0, 230, 0, 197, 232, 0, 234, 235, 0, 225, 235, 0, 236, 174, 237, 0, 236, 239, 0, 0, 21, 0, 68, 233, 0, 68, 10, 0, 69, 17, 232, 0, 69, 11, 232, 153, 17, 232, 153, 17, 232, 0, 70, 169, 232, 153, 17, 232, 156, 238, 158, 0, 70, 169, 232, 153, 17, 232, 156, 158, 0, 71, 184, 199, 232, 150, 241, 151, 188, 38, 17, 232, 72, 17, 232, 0, 72, 0, 73, 0, 238, 169, 230, 153, 17, 232, 0, 169, 230, 153, 17, 232, 0, 174, 244, 0, 197, 156, 232, 153, 232, 158, 0, 240, 153, 156, 232, 153, 232, 158, 0, 197, 186, 232, 186, 0, 17, 186, 232, 186, 0, 241, 153, 197, 186, 232, 186, 0, 241, 153, 17, 186, 232, 186, 0, 0, 0, 242, 153, 233, 0, 57, 56, 0, 56, 0, 164, 197, 232, 153, 232, 0, 165, 197, 232, 153, 232, 0, 89, 167, 197, 232, 153, 232, 0, 90, 168, 197, 232, 153, 232, 0, 166, 233, 38, 197, 0, 130, 233, 153, 233, 153, 233, 0, 131, 233, 153, 197, 0, 132, 233, 153, 233, 0, 133, 233, 153, 233, 153, 233, 0, 134, 233, 153, 233, 153, 233, 0, 129, 240, 0, 243, 184, 199, 232, 150, 241, 151, 188, 0, 246, 0, 36, 0, 0, 111, 197, 191, 0, 111, 197, 153, 11, 232, 191, 0, 112, 197, 191, 0, 112, 197, 153, 11, 232, 191, 0, 113, 233, 0, 245, 114, 197, 232, 191, 0, 245, 115, 233, 153, 197, 232, 191, 0, 116, 197, 232, 242, 0 }; #endif #if YYDEBUG != 0 static const short yyrline[] = { 0, 1107, 1107, 1107, 1107, 1107, 1107, 1107, 1107, 1107, 1108, 1108, 1108, 1108, 1108, 1108, 1109, 1109, 1109, 1109, 1109, 1109, 1109, 1110, 1110, 1110, 1110, 1110, 1113, 1113, 1114, 1114, 1115, 1115, 1116, 1116, 1117, 1117, 1121, 1121, 1122, 1122, 1123, 1123, 1124, 1124, 1125, 1125, 1126, 1126, 1127, 1127, 1128, 1129, 1134, 1135, 1135, 1135, 1135, 1135, 1137, 1137, 1137, 1138, 1138, 1140, 1141, 1145, 1149, 1154, 1154, 1156, 1157, 1162, 1168, 1169, 1170, 1171, 1172, 1176, 1177, 1178, 1182, 1183, 1184, 1185, 1189, 1190, 1191, 1195, 1196, 1197, 1198, 1199, 1203, 1204, 1205, 1208, 1208, 1209, 1210, 1211, 1212, 1213, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1232, 1233, 1238, 1239, 1240, 1241, 1242, 1243, 1246, 1247, 1252, 1253, 1260, 1260, 1267, 1267, 1277, 1285, 1285, 1291, 1291, 1293, 1298, 1311, 1311, 1311, 1311, 1311, 1311, 1311, 1314, 1318, 1322, 1329, 1334, 1342, 1372, 1397, 1402, 1412, 1422, 1426, 1436, 1443, 1452, 1459, 1464, 1469, 1476, 1477, 1484, 1491, 1499, 1505, 1517, 1545, 1561, 1588, 1616, 1642, 1662, 1688, 1708, 1720, 1727, 1793, 1803, 1813, 1819, 1829, 1835, 1845, 1850, 1855, 1868, 1880, 1902, 1910, 1916, 1927, 1932, 1937, 1943, 1949, 1958, 1962, 1970, 1970, 1973, 1973, 1976, 1988, 2009, 2014, 2022, 2023, 2027, 2027, 2031, 2031, 2034, 2037, 2061, 2072, 2080, 2083, 2089, 2092, 2099, 2103, 2143, 2146, 2152, 2162, 2166, 2171, 2173, 2178, 2183, 2192, 2202, 2213, 2217, 2226, 2235, 2240, 2374, 2374, 2376, 2385, 2385, 2387, 2392, 2404, 2408, 2413, 2417, 2421, 2425, 2429, 2433, 2437, 2441, 2445, 2470, 2474, 2484, 2488, 2492, 2497, 2504, 2504, 2510, 2519, 2523, 2532, 2541, 2550, 2554, 2561, 2565, 2569, 2574, 2584, 2603, 2612, 2696, 2700, 2707, 2718, 2731, 2741, 2752, 2762, 2773, 2781, 2791, 2798, 2801, 2802, 2809, 2813, 2818, 2834, 2851, 2865, 2879, 2891, 2899, 2906, 2912, 2918, 2924, 2939, 3030, 3035, 3039, 3046, 3053, 3061, 3068, 3076, 3084, 3098, 3115 }; #endif #if YYDEBUG != 0 || defined (YYERROR_VERBOSE) static const char * const yytname[] = { "$","error","$undefined.","ESINT64VAL", "EUINT64VAL","ESAPINTVAL","EUAPINTVAL","LOCALVAL_ID","GLOBALVAL_ID","FPVAL", "VOID","INTTYPE","FLOAT","DOUBLE","X86_FP80","FP128","PPC_FP128","LABEL","TYPE", "LOCALVAR","GLOBALVAR","LABELSTR","STRINGCONSTANT","ATSTRINGCONSTANT","PCTSTRINGCONSTANT", "ZEROINITIALIZER","TRUETOK","FALSETOK","BEGINTOK","ENDTOK","DECLARE","DEFINE", "GLOBAL","CONSTANT","SECTION","ALIAS","VOLATILE","THREAD_LOCAL","TO","DOTDOTDOT", "NULL_TOK","UNDEF","INTERNAL","LINKONCE","WEAK","APPENDING","DLLIMPORT","DLLEXPORT", "EXTERN_WEAK","OPAQUE","EXTERNAL","TARGET","TRIPLE","ALIGN","ADDRSPACE","DEPLIBS", "CALL","TAIL","ASM_TOK","MODULE","SIDEEFFECT","CC_TOK","CCC_TOK","FASTCC_TOK", "COLDCC_TOK","X86_STDCALLCC_TOK","X86_FASTCALLCC_TOK","DATALAYOUT","RET","BR", "SWITCH","INVOKE","UNWIND","UNREACHABLE","ADD","SUB","MUL","UDIV","SDIV","FDIV", "UREM","SREM","FREM","AND","OR","XOR","SHL","LSHR","ASHR","ICMP","FCMP","EQ", "NE","SLT","SGT","SLE","SGE","ULT","UGT","ULE","UGE","OEQ","ONE","OLT","OGT", "OLE","OGE","ORD","UNO","UEQ","UNE","MALLOC","ALLOCA","FREE","LOAD","STORE", "GETELEMENTPTR","TRUNC","ZEXT","SEXT","FPTRUNC","FPEXT","BITCAST","UITOFP","SITOFP", "FPTOUI","FPTOSI","INTTOPTR","PTRTOINT","PHI_TOK","SELECT","VAARG","EXTRACTELEMENT", "INSERTELEMENT","SHUFFLEVECTOR","SIGNEXT","ZEROEXT","NORETURN","INREG","SRET", "NOUNWIND","NOALIAS","BYVAL","NEST","READNONE","READONLY","GC","DEFAULT","HIDDEN", "PROTECTED","'('","')'","'='","','","'*'","'\\\\'","'['","'x'","']'","'<'","'>'", "'{'","'}'","'c'","ArithmeticOps","LogicalOps","CastOps","IPredicates","FPredicates", "IntType","FPType","LocalName","OptLocalName","OptAddrSpace","OptLocalAssign", "GlobalName","OptGlobalAssign","GlobalAssign","GVInternalLinkage","GVExternalLinkage", "GVVisibilityStyle","FunctionDeclareLinkage","FunctionDefineLinkage","AliasLinkage", "OptCallingConv","ParamAttr","OptParamAttrs","FuncAttr","OptFuncAttrs","OptGC", "OptAlign","OptCAlign","SectionString","OptSection","GlobalVarAttributes","GlobalVarAttribute", "PrimType","Types","ArgType","ResultTypes","ArgTypeList","ArgTypeListI","TypeListI", "ConstVal","ConstExpr","ConstVector","GlobalType","ThreadLocal","AliaseeRef", "Module","DefinitionList","Definition","@1","@2","@3","@4","@5","AsmBlock","TargetDefinition", "LibrariesDefinition","LibList","ArgListH","ArgList","FunctionHeaderH","BEGIN", "FunctionHeader","END","Function","FunctionProto","OptSideEffect","ConstValueRef", "SymbolicValueRef","ValueRef","ResolvedVal","BasicBlockList","BasicBlock","InstructionList", "BBTerminatorInst","JumpTable","Inst","PHIList","ParamList","IndexList","OptTailCall", "InstVal","OptVolatile","MemoryInst", NULL }; #endif static const short yyr1[] = { 0, 164, 164, 164, 164, 164, 164, 164, 164, 164, 165, 165, 165, 165, 165, 165, 166, 166, 166, 166, 166, 166, 166, 166, 166, 166, 166, 166, 167, 167, 167, 167, 167, 167, 167, 167, 167, 167, 168, 168, 168, 168, 168, 168, 168, 168, 168, 168, 168, 168, 168, 168, 168, 168, 169, 170, 170, 170, 170, 170, 171, 171, 171, 172, 172, 173, 173, 174, 174, 175, 175, 176, 176, 177, 178, 178, 178, 178, 178, 179, 179, 179, 180, 180, 180, 180, 181, 181, 181, 182, 182, 182, 182, 182, 183, 183, 183, 184, 184, 184, 184, 184, 184, 184, 185, 185, 185, 185, 185, 185, 185, 185, 185, 186, 186, 187, 187, 187, 187, 187, 187, 188, 188, 189, 189, 190, 190, 191, 191, 192, 193, 193, 194, 194, 195, 195, 196, 196, 196, 196, 196, 196, 196, 197, 197, 197, 197, 197, 197, 197, 197, 197, 197, 197, 197, 197, 198, 199, 199, 200, 200, 201, 201, 201, 201, 202, 202, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 204, 204, 204, 204, 204, 204, 204, 204, 204, 204, 205, 205, 206, 206, 207, 207, 208, 208, 209, 209, 210, 210, 212, 211, 213, 211, 211, 211, 211, 214, 211, 215, 211, 216, 211, 211, 211, 211, 217, 218, 218, 219, 220, 220, 220, 221, 221, 222, 222, 222, 222, 223, 224, 224, 225, 226, 226, 227, 228, 229, 229, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 231, 231, 231, 231, 232, 232, 233, 234, 234, 235, 236, 236, 236, 237, 237, 237, 237, 237, 237, 237, 237, 237, 238, 238, 239, 240, 240, 241, 241, 241, 241, 241, 242, 242, 243, 243, 244, 244, 244, 244, 244, 244, 244, 244, 244, 244, 244, 244, 244, 245, 245, 246, 246, 246, 246, 246, 246, 246, 246 }; 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, 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, 0, 4, 0, 2, 0, 1, 1, 1, 0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 2, 1, 1, 1, 1, 1, 1, 0, 2, 0, 2, 0, 2, 0, 3, 2, 0, 1, 0, 3, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 2, 5, 5, 5, 5, 3, 2, 5, 4, 2, 1, 1, 1, 3, 1, 3, 1, 0, 1, 3, 4, 3, 3, 4, 4, 3, 6, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 6, 5, 8, 6, 6, 7, 7, 6, 8, 8, 3, 1, 1, 1, 1, 0, 2, 6, 1, 0, 1, 2, 0, 3, 0, 3, 3, 3, 3, 0, 8, 0, 9, 0, 9, 5, 2, 3, 1, 3, 3, 3, 3, 1, 0, 5, 3, 1, 3, 1, 0, 10, 1, 1, 4, 1, 1, 2, 3, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 5, 1, 1, 1, 1, 1, 1, 2, 2, 2, 3, 2, 0, 1, 2, 2, 3, 9, 9, 8, 14, 1, 1, 6, 5, 2, 6, 7, 4, 4, 6, 6, 0, 0, 3, 2, 1, 5, 5, 6, 6, 4, 6, 4, 4, 6, 6, 2, 8, 1, 1, 0, 3, 6, 3, 6, 2, 5, 7, 4 }; static const short yydefact[] = { 72, 60, 69, 61, 70, 62, 211, 209, 0, 0, 0, 0, 0, 0, 82, 71, 72, 207, 86, 89, 0, 0, 223, 0, 0, 67, 0, 73, 74, 76, 75, 77, 79, 78, 80, 81, 83, 84, 85, 82, 82, 202, 208, 87, 88, 82, 212, 90, 91, 92, 93, 82, 270, 210, 270, 0, 0, 231, 224, 225, 213, 259, 260, 215, 136, 137, 138, 141, 140, 139, 142, 143, 0, 0, 0, 0, 261, 262, 144, 214, 146, 202, 202, 94, 201, 0, 97, 97, 271, 267, 68, 242, 243, 244, 266, 226, 227, 230, 0, 164, 147, 0, 0, 0, 0, 153, 165, 0, 0, 164, 0, 0, 0, 96, 95, 0, 199, 200, 0, 0, 98, 99, 100, 101, 102, 0, 245, 0, 309, 269, 0, 228, 163, 113, 159, 161, 0, 0, 0, 0, 0, 0, 152, 0, 0, 145, 0, 0, 158, 0, 157, 0, 222, 136, 137, 138, 141, 140, 139, 0, 0, 66, 66, 103, 0, 239, 240, 241, 308, 294, 0, 0, 0, 0, 97, 279, 280, 1, 2, 3, 4, 5, 6, 7, 8, 9, 13, 14, 15, 10, 11, 12, 0, 0, 0, 0, 0, 0, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 0, 0, 0, 0, 0, 0, 0, 0, 0, 268, 97, 283, 0, 307, 229, 156, 0, 121, 66, 66, 155, 0, 166, 0, 121, 66, 66, 0, 203, 184, 185, 180, 182, 181, 183, 186, 179, 175, 176, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 178, 177, 216, 0, 293, 273, 66, 272, 0, 0, 54, 0, 0, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 0, 52, 53, 48, 49, 50, 51, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 0, 127, 127, 314, 66, 66, 305, 0, 0, 0, 0, 0, 66, 66, 0, 0, 0, 0, 105, 107, 106, 104, 108, 109, 110, 111, 112, 114, 162, 160, 149, 150, 151, 154, 65, 148, 218, 220, 0, 0, 0, 0, 0, 0, 0, 0, 168, 198, 0, 0, 0, 172, 0, 169, 0, 0, 0, 132, 237, 248, 249, 250, 255, 251, 252, 253, 254, 246, 0, 257, 264, 263, 265, 0, 274, 0, 0, 66, 66, 0, 310, 0, 312, 291, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 66, 0, 118, 117, 115, 116, 119, 120, 122, 132, 132, 0, 0, 0, 291, 0, 0, 0, 0, 0, 167, 153, 165, 0, 170, 171, 0, 0, 0, 0, 217, 236, 113, 234, 0, 247, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 317, 0, 0, 0, 301, 302, 0, 0, 0, 0, 299, 0, 127, 0, 219, 221, 66, 0, 0, 0, 0, 0, 0, 0, 197, 174, 0, 0, 0, 0, 0, 0, 134, 132, 64, 0, 121, 0, 256, 0, 0, 290, 0, 0, 127, 128, 127, 0, 0, 0, 0, 0, 0, 295, 296, 290, 0, 315, 66, 204, 0, 0, 188, 0, 0, 0, 0, 173, 0, 0, 66, 129, 135, 133, 63, 233, 235, 113, 130, 0, 0, 0, 113, 113, 0, 297, 298, 311, 313, 292, 0, 0, 300, 303, 304, 0, 127, 0, 0, 0, 194, 0, 0, 190, 191, 187, 64, 131, 125, 258, 0, 0, 0, 0, 121, 0, 284, 0, 121, 316, 192, 193, 0, 0, 0, 232, 0, 123, 0, 277, 0, 0, 105, 107, 113, 113, 0, 113, 113, 285, 306, 189, 195, 196, 126, 0, 238, 275, 0, 276, 0, 287, 286, 0, 0, 0, 124, 0, 0, 0, 113, 113, 0, 0, 0, 289, 288, 282, 0, 0, 281, 0, 278, 0, 0, 0 }; static const short yydefgoto[] = { 260, 261, 262, 286, 303, 159, 160, 76, 519, 110, 12, 77, 14, 15, 39, 40, 41, 45, 51, 115, 125, 330, 225, 406, 333, 590, 571, 383, 476, 552, 428, 477, 78, 161, 134, 151, 135, 136, 107, 350, 372, 351, 118, 85, 152, 617, 16, 17, 19, 18, 360, 407, 408, 60, 22, 58, 98, 431, 432, 126, 167, 52, 93, 53, 46, 434, 373, 80, 375, 270, 54, 89, 90, 219, 575, 129, 309, 528, 444, 220, 221, 222, 223 }; static const short yypact[] = { 253, -32768,-32768,-32768,-32768,-32768,-32768,-32768, -4, -114, -16, -103, 46, -78, 12,-32768, 392,-32768, 149, 177, -44, -31,-32768, -1, 154,-32768, 1529,-32768,-32768,-32768,-32768, -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, -37, -37, 203,-32768,-32768,-32768, -37,-32768,-32768,-32768,-32768,-32768, -37, 190,-32768, 2, 195, 217, 245,-32768,-32768,-32768, -32768,-32768, 124,-32768,-32768,-32768,-32768,-32768,-32768,-32768, -32768, 274, 278, 1, 505,-32768,-32768,-32768, 62,-32768, 256, 256, 200,-32768, 119, 224, 224,-32768,-32768, 100, -32768,-32768,-32768,-32768,-32768,-32768,-32768, 57, 1052,-32768, 140, 148, 604, 124,-32768, 62, -69, 157, 1052, 155, 119, 119,-32768,-32768, 1295,-32768,-32768, 1569, 306,-32768, -32768,-32768,-32768,-32768, 1627,-32768, -17, 1851,-32768, 289, -32768,-32768, 62,-32768, 163, 166, 1645, 1645, 158, -58, 1645,-32768, 315, 171,-32768, 1569, 1645, 124, 170, 62, 58,-32768, 41, 314, 318, 320, 321, 329, 226, 330, 1107, 270,-32768, 30,-32768,-32768,-32768,-32768,-32768, 288, 1685, 137, 336, 224,-32768,-32768,-32768,-32768,-32768,-32768, -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, -32768, 388, 781, 1645, 1645, 1645, 1645,-32768,-32768,-32768, -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 1645, 1645, 1645, 1645, 1645, 1645, 1645, 1645, 1645,-32768, 224, -32768, 70,-32768,-32768, 207, 1374,-32768, -15, -14,-32768, 197, 62, 208,-32768, 270, -13, 1295,-32768,-32768,-32768, -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 388, 781, 212, 213, 214, 220, 221, 1414, 1725, 782, 351, 228, 229, 231,-32768,-32768,-32768, 232,-32768, 124, 696,-32768, 834, 834,-32768, 834, 1627,-32768,-32768,-32768,-32768,-32768, -32768,-32768,-32768,-32768,-32768, 1645,-32768,-32768,-32768,-32768, -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, -32768,-32768, 1645, 15, 29,-32768, 696, 7, 205, 223, 235, 236, 237, 238, 696, 696, 346, 1627, 1645, 1645, -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, -32768,-32768, 120,-32768,-32768,-32768,-32768, 120,-32768, 155, 358, 248, 249, 1569, 1569, 1569, 1569, 1569,-32768,-32768, 69, 1007, -61,-32768, -56,-32768, 1569, 1569, 1569, 251, 1454,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 341, 1569,-32768,-32768,-32768,-32768, 252,-32768, 255, 834, 696, 696, 19,-32768, 23,-32768,-32768, 834, 246, 1645, 1645, 1645, 1645, 1645, 260, 266, 1645, 834, 696, 271,-32768, -32768,-32768,-32768,-32768,-32768,-32768, 251, 251, 1645, 1569, 1569,-32768, 272, 275, 276, 277, 1569,-32768, 267, 962, -55,-32768,-32768, 286, 291, 371, 18,-32768,-32768, 62, 292, 280,-32768, 420, -57, 431, 433, 302, 300, 301, 834, 453, 834, 305, 307, 834, 309, 62,-32768, 310, 311, 834, 834, 62, 316, 312, 1645,-32768,-32768, -18, 323, 324, 92, 1569, 1569, 1569, 1569,-32768,-32768, 299, 1569, 1569, 1645, 446, 469,-32768, 251, 729, 1472,-32768, 339,-32768, 834, 834, 1743, 834, 834, 312,-32768, 312, 1645, 834, 340, 1645, 1645, 1645,-32768,-32768, 1743, 421, -32768, 696,-32768, 1569, 1569,-32768, 342, 343, 344, 345, -32768, 348, 349, 16,-32768,-32768,-32768,-32768,-32768,-32768, 62, -6, 474, 350, 352, 64, 62, 101,-32768,-32768, -32768,-32768,-32768, 347, 834,-32768,-32768,-32768, 115, 312, 353, 356, 1569,-32768, 1569, 1569,-32768,-32768,-32768, 729, -32768, 448,-32768, 485, -5, 555, 555,-32768, 1800,-32768, 365,-32768,-32768,-32768,-32768, 363, 379, 380,-32768, 530, 390, 834,-32768, 1246, -2, 359, 389,-32768,-32768, 5, 64, 62,-32768, 120,-32768,-32768,-32768,-32768, 516,-32768, -32768, 391,-32768, 1246, 207, 207, 524, 555, 555,-32768, 525, 394, 834,-32768,-32768, 834, 526, 473, 207, 207, -32768, 834, 531,-32768, 834,-32768, 551, 556,-32768 }; static const short yypgoto[] = { 427, 437, 439, 319, 322, -172,-32768, 0, 11, -149, 480, 10,-32768,-32768,-32768,-32768, 49,-32768,-32768,-32768, -147, -32768, -401,-32768, -222,-32768,-32768, -281, 51,-32768, -375, -32768,-32768, -24, 357, -117,-32768, 462, 481, -111, -157, -243, 169, 210, 354,-32768,-32768, 560,-32768,-32768,-32768, -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 498,-32768, -32768,-32768,-32768,-32768,-32768, -557, -46, -66, -193,-32768, 532,-32768,-32768,-32768,-32768,-32768, 88, 176,-32768,-32768, -32768,-32768 }; #define YYLAST 1985 static const short yytable[] = { 11, 274, 79, 306, 263, 102, 273, 162, 164, 273, 13, 165, 338, 265, 353, 355, 11, 592, 310, 311, 312, 313, 314, 88, 385, 317, 13, 275, 474, 478, 441, 91, 458, 459, 443, 235, 108, 602, 23, 108, 108, 108, 24, 597, -54, -54, -54, -54, 20, 25, 2, 106, 474, 4, 28, 29, 30, 31, 32, 33, 34, 108, 35, 21, 26, 61, 62, 239, 240, 108, 108, 475, 442, 318, 27, 133, 442, 1, 2, 106, 3, 4, 5, 108, 141, 133, 339, 340, 81, 82, 11, 150, 417, 142, 86, 141, 417, 417, 417, 422, 87, 150, 517, 482, 231, 238, 423, 470, 55, 421, 36, 37, 38, 228, 229, 264, 108, 232, -142, 1, 550, 56, 3, 236, 5, 556, 557, 399, 435, 400, 401, 402, 109, 503, 403, 109, 109, 109, 404, 405, 400, 401, 402, 334, 166, 403, 335, 269, 271, 404, 405, 116, 117, 573, 272, 57, 593, 109, 379, 36, 37, 38, 103, 387, 92, 109, 109, 549, 382, -66, 304, 305, 269, 307, 266, 501, 59, 595, 596, 109, 598, 599, 384, -66, 319, 320, 308, 269, 269, 269, 269, 269, 315, 316, 269, 43, 447, 44, 449, 450, 451, 397, 133, 609, 610, 376, 377, 531, 378, 532, 130, 88, 109, 150, -142, 131, -66, 95, -142, 47, 48, 49, 417, 374, 50, 374, 374, 418, 374, 241, 242, 243, 244, 412, 413, 414, 415, 416, 83, 96, 84, 386, 113, 506, 114, 491, 424, 425, 426, 394, 395, 150, 558, -206, 559, 400, 401, 402, 522, 563, 403, 374, 380, 263, 404, 405, 562, 97, 559, 374, 374, -68, 1, 2, 99, 3, 4, 5, 100, 381, 146, 147, 101, 6, 7, 119, 120, 121, 122, 123, 124, 111, 112, 84, 150, 398, 269, 137, 533, 461, 462, 536, 537, 538, 8, 138, 468, 143, 9, 145, 163, 224, 10, 438, 439, 440, 226, 227, 230, 233, 237, 445, 234, -55, 108, 321, 322, -56, 420, -59, -58, 455, 456, 374, 374, 374, 580, 430, -57, 245, 584, 374, 323, 324, 267, 325, 326, 273, 327, 328, 329, 374, 374, 507, 508, 509, 510, 336, 388, 337, 512, 513, 344, 345, 346, 269, 448, 269, 269, 269, 347, 348, 454, 356, 264, 488, 389, 490, 357, 358, 493, 359, 361, 574, 396, 460, 497, 498, 390, 391, 392, 393, -205, 541, 542, 374, 409, 374, 410, 411, 374, 433, 446, 594, 427, 436, 374, 374, 437, 473, -68, 1, 2, 452, 3, 4, 5, 524, 525, 453, 529, 530, 6, 7, 457, 464, 534, 469, 465, 466, 467, 480, 566, 502, 567, 568, 540, 374, 374, 471, 374, 374, 481, 8, 472, 479, 374, 9, 483, 514, 484, 10, 485, 486, 487, 521, 374, 489, 491, 511, 492, 527, 494, 495, 496, 500, 499, 269, 515, 561, 269, 269, 269, 516, 442, 527, 504, 505, 518, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 374, 578, 579, 523, 535, 544, 543, 553, 545, 546, 547, 548, 570, 572, 554, 564, 560, 591, 565, 555, -17, 374, 374, 61, 62, 585, 104, 64, 65, 66, 67, 68, 69, 70, 583, 1, 2, 374, 3, 4, 5, 586, 587, 604, 605, 588, 582, 589, 608, 600, -18, 611, 603, 606, 612, 601, 613, 614, 607, 615, 616, 518, 618, 374, 374, 71, 216, 619, 374, 362, 363, 374, 569, 61, 62, 364, 217, 374, 218, 342, 374, 128, 144, 343, 551, 1, 2, 42, 3, 4, 5, 365, 366, 367, 332, 140, 127, 94, 539, 463, 0, 0, 341, 0, 0, 0, 368, 369, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 61, 62, 370, 104, 64, 65, 66, 67, 68, 69, 70, 0, 1, 2, 0, 3, 4, 5, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 249, 250, 0, 0, 0, 0, 0, 0, 0, 71, 0, 0, 0, 0, 0, 0, 72, 73, 0, 0, 74, 0, 75, 105, 0, 0, 0, 251, 198, 576, 577, 201, 202, 203, 204, 205, 206, 207, 208, 209, 0, 252, 0, 253, 254, 255, 323, 324, 0, 325, 326, 0, 327, 328, 329, 362, 363, 0, 0, 61, 62, 364, 0, 0, 0, 0, 0, 0, 0, 0, 371, 1, 2, 0, 3, 4, 5, 365, 366, 367, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 368, 369, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 108, 3, 0, 5, 370, 0, 0, 0, 0, 72, 73, 0, 0, 74, 0, 75, 139, 0, 0, 0, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 249, 250, 0, 0, 61, 62, 0, 104, 153, 154, 155, 156, 157, 158, 70, 0, 1, 2, 0, 3, 4, 5, 287, 288, 0, 0, 0, 251, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 0, 252, 0, 253, 254, 255, 71, 0, 0, 0, 0, 0, 362, 363, 0, 0, 61, 62, 364, 0, 0, 109, 321, 322, 0, 0, 0, 0, 1, 2, 371, 3, 4, 5, 365, 366, 367, 0, 0, 323, 324, 0, 325, 326, 0, 327, 328, 329, 0, 368, 369, 0, 0, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 370, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 249, 250, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 72, 73, 0, 0, 74, 0, 75, 354, 0, 0, 0, 0, 0, 251, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 0, 252, 0, 253, 254, 255, 61, 62, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 0, 3, 4, 5, 246, 0, 0, 0, 0, 0, 371, 0, 0, 0, 0, 0, 0, 0, 0, 247, 248, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 61, 62, 108, 104, 153, 154, 155, 156, 157, 158, 70, 0, 1, 2, 0, 3, 4, 5, 0, 0, 0, 0, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 249, 250, 0, 0, 0, 71, 0, 0, 61, 62, 0, 104, 64, 65, 66, 67, 68, 69, 70, 0, 1, 2, 0, 3, 4, 5, 0, 251, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 132, 252, 0, 253, 254, 255, 0, 0, 0, 0, 71, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 109, 0, 61, 62, -66, 0, 256, 0, 0, 257, 0, 258, 0, 259, 1, 2, 0, 3, 4, 5, 246, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 247, 248, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 108, 72, 73, 0, 0, 74, 0, 75, 419, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 249, 250, 0, 0, 0, 0, 0, 0, 0, 0, 0, 72, 73, 0, 0, 74, 0, 75, 0, 0, 0, 0, 0, 0, 0, 0, 0, 251, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 0, 252, 0, 253, 254, 255, 0, 0, 0, 0, 0, 0, 0, 362, 363, 0, 0, 0, 0, 364, 0, 109, 0, 0, 0, 0, 0, 256, 0, 0, 257, 0, 258, 0, 259, 365, 366, 367, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 368, 369, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 61, 62, 370, 148, 64, 65, 66, 67, 68, 69, 70, 0, 1, 2, 0, 3, 4, 5, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 249, 250, 0, 0, 0, 0, 0, 0, 0, 71, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 251, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 0, 252, 0, 253, 254, 255, 61, 62, 0, 104, 64, 65, 66, 67, 68, 69, 70, 0, 1, 2, 0, 3, 4, 5, 0, 0, 0, 0, 0, 0, 371, 0, 0, 0, 0, 0, 0, 0, 331, 0, 0, 0, 149, 0, 0, 0, 61, 62, 71, 104, 153, 154, 155, 156, 157, 158, 70, 0, 1, 2, 0, 3, 4, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 72, 73, 0, 0, 74, 0, 75, 0, 0, 0, 0, 61, 62, 71, 104, 64, 65, 66, 67, 68, 69, 70, 0, 1, 2, 0, 3, 4, 5, 61, 62, 0, 104, 64, 65, 66, 67, 68, 69, 70, 0, 1, 2, 429, 3, 4, 5, 0, 0, 0, 0, 0, 0, 71, 0, 0, 0, 0, 0, 0, 0, 520, 0, 0, 0, 0, 0, 0, 0, 0, 0, 71, 0, 0, 0, 0, 0, 0, 0, 72, 73, 0, 0, 74, 0, 75, 61, 62, 0, 63, 64, 65, 66, 67, 68, 69, 70, 0, 1, 2, 0, 3, 4, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 72, 73, 0, 349, 74, 0, 75, 61, 62, 71, 104, 153, 154, 155, 156, 157, 158, 70, 0, 1, 2, 0, 3, 4, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 72, 73, 0, 0, 74, 0, 75, 0, 0, 71, 0, 0, 0, 0, 0, 0, 0, 0, 72, 73, 0, 0, 74, 0, 75, 61, 62, 0, 148, 64, 65, 66, 67, 68, 69, 70, 0, 1, 2, 0, 3, 4, 5, 61, 62, 0, 104, 64, 65, 66, 67, 68, 69, 70, 0, 1, 2, 0, 3, 4, 5, 0, 0, 0, 0, 0, 0, 71, 0, 0, 0, 0, 0, 0, 0, 72, 73, 0, 0, 74, 0, 75, 0, 61, 62, 71, 268, 64, 65, 66, 67, 68, 69, 70, 0, 1, 2, 0, 3, 4, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 72, 73, 0, 0, 74, 0, 75, 0, 61, 62, 71, 104, 153, 154, 155, 156, 157, 158, 70, 0, 1, 2, 0, 3, 4, 5, 61, 62, 0, 104, 64, 65, 66, 67, 68, 69, 526, 0, 1, 2, 0, 3, 4, 5, 0, 0, 0, 0, 0, 0, 71, 0, 0, 0, 0, 0, 0, 0, 72, 73, 0, 0, 74, 0, 75, 0, 0, 0, 71, 0, 0, 0, 0, 0, 0, 0, 72, 73, 0, 0, 74, 0, 75, 61, 62, 0, 104, 64, 65, 66, 67, 68, 69, 581, 0, 1, 2, 0, 3, 4, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 72, 73, 0, 0, 74, 0, 75, 0, 0, 71, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 72, 73, 0, 0, 74, 0, 352, 168, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 72, 73, 0, 0, 74, 0, 75, 0, 0, 169, 170, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 72, 73, 0, 0, 74, 0, 75, 194, 195, 196, 0, 0, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215 }; static const short yycheck[] = { 0, 173, 26, 196, 161, 4, 11, 118, 125, 11, 0, 28, 234, 162, 257, 258, 16, 574, 211, 212, 213, 214, 215, 21, 305, 218, 16, 174, 34, 430, 11, 29, 407, 408, 11, 146, 54, 594, 152, 54, 54, 54, 58, 38, 3, 4, 5, 6, 52, 152, 20, 75, 34, 23, 42, 43, 44, 45, 46, 47, 48, 54, 50, 67, 18, 7, 8, 26, 27, 54, 54, 53, 53, 220, 152, 99, 53, 19, 20, 103, 22, 23, 24, 54, 153, 109, 235, 236, 39, 40, 90, 115, 153, 162, 45, 153, 153, 153, 153, 160, 51, 125, 477, 160, 162, 151, 162, 162, 152, 352, 147, 148, 149, 137, 138, 161, 54, 141, 54, 19, 521, 152, 22, 147, 24, 526, 527, 320, 371, 135, 136, 137, 150, 151, 140, 150, 150, 150, 144, 145, 135, 136, 137, 158, 161, 140, 160, 171, 11, 144, 145, 32, 33, 158, 17, 156, 158, 150, 275, 147, 148, 149, 161, 156, 162, 150, 150, 151, 153, 154, 194, 195, 196, 197, 164, 456, 22, 578, 579, 150, 581, 582, 153, 154, 114, 115, 210, 211, 212, 213, 214, 215, 216, 217, 218, 46, 389, 48, 391, 392, 393, 318, 226, 604, 605, 271, 272, 488, 274, 490, 153, 21, 150, 237, 150, 158, 154, 22, 154, 42, 43, 44, 153, 269, 47, 271, 272, 158, 274, 3, 4, 5, 6, 344, 345, 346, 347, 348, 35, 22, 37, 307, 42, 151, 44, 153, 357, 358, 359, 315, 316, 275, 151, 0, 153, 135, 136, 137, 480, 540, 140, 307, 286, 420, 144, 145, 151, 22, 153, 315, 316, 18, 19, 20, 150, 22, 23, 24, 4, 303, 111, 112, 4, 30, 31, 61, 62, 63, 64, 65, 66, 81, 82, 37, 318, 319, 320, 157, 491, 410, 411, 494, 495, 496, 51, 157, 417, 150, 55, 154, 4, 22, 59, 379, 380, 381, 153, 151, 160, 4, 150, 387, 151, 9, 54, 118, 119, 9, 352, 9, 9, 397, 398, 379, 380, 381, 558, 361, 9, 9, 562, 387, 135, 136, 56, 138, 139, 11, 141, 142, 143, 397, 398, 464, 465, 466, 467, 160, 153, 151, 471, 472, 150, 150, 150, 389, 390, 391, 392, 393, 150, 150, 396, 22, 420, 441, 153, 443, 150, 150, 446, 150, 150, 555, 38, 409, 452, 453, 153, 153, 153, 153, 0, 504, 505, 441, 38, 443, 150, 150, 446, 60, 156, 575, 153, 153, 452, 453, 153, 38, 18, 19, 20, 153, 22, 23, 24, 483, 484, 153, 486, 487, 30, 31, 153, 153, 492, 160, 153, 153, 153, 151, 543, 457, 545, 546, 502, 483, 484, 153, 486, 487, 22, 51, 153, 153, 492, 55, 17, 473, 17, 59, 150, 153, 153, 479, 502, 4, 153, 160, 153, 485, 153, 153, 153, 153, 150, 491, 22, 535, 494, 495, 496, 4, 53, 499, 153, 153, 478, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 535, 556, 557, 153, 153, 151, 153, 22, 153, 153, 151, 151, 53, 17, 153, 151, 158, 572, 151, 156, 150, 556, 557, 7, 8, 151, 10, 11, 12, 13, 14, 15, 16, 17, 158, 19, 20, 572, 22, 23, 24, 151, 151, 598, 599, 4, 559, 146, 603, 22, 150, 606, 17, 17, 17, 153, 72, 612, 153, 17, 615, 550, 0, 598, 599, 49, 128, 0, 603, 3, 4, 606, 550, 7, 8, 9, 128, 612, 128, 249, 615, 90, 109, 250, 522, 19, 20, 16, 22, 23, 24, 25, 26, 27, 226, 103, 87, 54, 499, 412, -1, -1, 237, -1, -1, -1, 40, 41, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 7, 8, 58, 10, 11, 12, 13, 14, 15, 16, 17, -1, 19, 20, -1, 22, 23, 24, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, -1, -1, -1, -1, -1, -1, -1, 49, -1, -1, -1, -1, -1, -1, 155, 156, -1, -1, 159, -1, 161, 162, -1, -1, -1, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, -1, 130, -1, 132, 133, 134, 135, 136, -1, 138, 139, -1, 141, 142, 143, 3, 4, -1, -1, 7, 8, 9, -1, -1, -1, -1, -1, -1, -1, -1, 159, 19, 20, -1, 22, 23, 24, 25, 26, 27, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 40, 41, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 19, -1, 54, 22, -1, 24, 58, -1, -1, -1, -1, 155, 156, -1, -1, 159, -1, 161, 162, -1, -1, -1, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, -1, -1, 7, 8, -1, 10, 11, 12, 13, 14, 15, 16, 17, -1, 19, 20, -1, 22, 23, 24, 26, 27, -1, -1, -1, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, -1, 130, -1, 132, 133, 134, 49, -1, -1, -1, -1, -1, 3, 4, -1, -1, 7, 8, 9, -1, -1, 150, 118, 119, -1, -1, -1, -1, 19, 20, 159, 22, 23, 24, 25, 26, 27, -1, -1, 135, 136, -1, 138, 139, -1, 141, 142, 143, -1, 40, 41, -1, -1, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 58, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 155, 156, -1, -1, 159, -1, 161, 162, -1, -1, -1, -1, -1, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, -1, 130, -1, 132, 133, 134, 7, 8, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 19, 20, -1, 22, 23, 24, 25, -1, -1, -1, -1, -1, 159, -1, -1, -1, -1, -1, -1, -1, -1, 40, 41, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 7, 8, 54, 10, 11, 12, 13, 14, 15, 16, 17, -1, 19, 20, -1, 22, 23, 24, -1, -1, -1, -1, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, -1, -1, -1, 49, -1, -1, 7, 8, -1, 10, 11, 12, 13, 14, 15, 16, 17, -1, 19, 20, -1, 22, 23, 24, -1, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 39, 130, -1, 132, 133, 134, -1, -1, -1, -1, 49, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 150, -1, 7, 8, 154, -1, 156, -1, -1, 159, -1, 161, -1, 163, 19, 20, -1, 22, 23, 24, 25, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 40, 41, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 54, 155, 156, -1, -1, 159, -1, 161, 162, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, -1, -1, -1, -1, -1, -1, -1, -1, -1, 155, 156, -1, -1, 159, -1, 161, -1, -1, -1, -1, -1, -1, -1, -1, -1, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, -1, 130, -1, 132, 133, 134, -1, -1, -1, -1, -1, -1, -1, 3, 4, -1, -1, -1, -1, 9, -1, 150, -1, -1, -1, -1, -1, 156, -1, -1, 159, -1, 161, -1, 163, 25, 26, 27, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 40, 41, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 7, 8, 58, 10, 11, 12, 13, 14, 15, 16, 17, -1, 19, 20, -1, 22, 23, 24, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, -1, -1, -1, -1, -1, -1, -1, 49, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, -1, 130, -1, 132, 133, 134, 7, 8, -1, 10, 11, 12, 13, 14, 15, 16, 17, -1, 19, 20, -1, 22, 23, 24, -1, -1, -1, -1, -1, -1, 159, -1, -1, -1, -1, -1, -1, -1, 39, -1, -1, -1, 122, -1, -1, -1, 7, 8, 49, 10, 11, 12, 13, 14, 15, 16, 17, -1, 19, 20, -1, 22, 23, 24, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 155, 156, -1, -1, 159, -1, 161, -1, -1, -1, -1, 7, 8, 49, 10, 11, 12, 13, 14, 15, 16, 17, -1, 19, 20, -1, 22, 23, 24, 7, 8, -1, 10, 11, 12, 13, 14, 15, 16, 17, -1, 19, 20, 39, 22, 23, 24, -1, -1, -1, -1, -1, -1, 49, -1, -1, -1, -1, -1, -1, -1, 39, -1, -1, -1, -1, -1, -1, -1, -1, -1, 49, -1, -1, -1, -1, -1, -1, -1, 155, 156, -1, -1, 159, -1, 161, 7, 8, -1, 10, 11, 12, 13, 14, 15, 16, 17, -1, 19, 20, -1, 22, 23, 24, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 155, 156, -1, 158, 159, -1, 161, 7, 8, 49, 10, 11, 12, 13, 14, 15, 16, 17, -1, 19, 20, -1, 22, 23, 24, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 155, 156, -1, -1, 159, -1, 161, -1, -1, 49, -1, -1, -1, -1, -1, -1, -1, -1, 155, 156, -1, -1, 159, -1, 161, 7, 8, -1, 10, 11, 12, 13, 14, 15, 16, 17, -1, 19, 20, -1, 22, 23, 24, 7, 8, -1, 10, 11, 12, 13, 14, 15, 16, 17, -1, 19, 20, -1, 22, 23, 24, -1, -1, -1, -1, -1, -1, 49, -1, -1, -1, -1, -1, -1, -1, 155, 156, -1, -1, 159, -1, 161, -1, 7, 8, 49, 10, 11, 12, 13, 14, 15, 16, 17, -1, 19, 20, -1, 22, 23, 24, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 155, 156, -1, -1, 159, -1, 161, -1, 7, 8, 49, 10, 11, 12, 13, 14, 15, 16, 17, -1, 19, 20, -1, 22, 23, 24, 7, 8, -1, 10, 11, 12, 13, 14, 15, 16, 17, -1, 19, 20, -1, 22, 23, 24, -1, -1, -1, -1, -1, -1, 49, -1, -1, -1, -1, -1, -1, -1, 155, 156, -1, -1, 159, -1, 161, -1, -1, -1, 49, -1, -1, -1, -1, -1, -1, -1, 155, 156, -1, -1, 159, -1, 161, 7, 8, -1, 10, 11, 12, 13, 14, 15, 16, 17, -1, 19, 20, -1, 22, 23, 24, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 155, 156, -1, -1, 159, -1, 161, -1, -1, 49, -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, 155, 156, -1, -1, 159, -1, 161, 36, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 155, 156, -1, -1, 159, -1, 161, -1, -1, 56, 57, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 155, 156, -1, -1, 159, -1, 161, 111, 112, 113, -1, -1, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134 }; /* -*-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 #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 #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 */ #pragma alloca #define YYSTACK_USE_ALLOCA #else /* not MSDOS, or __TURBOC__, or _AIX */ #if 0 #ifdef __hpux /* haible@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 28: #line 1113 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.IPredicate = ICmpInst::ICMP_EQ; ; break;} case 29: #line 1113 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.IPredicate = ICmpInst::ICMP_NE; ; break;} case 30: #line 1114 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.IPredicate = ICmpInst::ICMP_SLT; ; break;} case 31: #line 1114 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.IPredicate = ICmpInst::ICMP_SGT; ; break;} case 32: #line 1115 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.IPredicate = ICmpInst::ICMP_SLE; ; break;} case 33: #line 1115 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.IPredicate = ICmpInst::ICMP_SGE; ; break;} case 34: #line 1116 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.IPredicate = ICmpInst::ICMP_ULT; ; break;} case 35: #line 1116 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.IPredicate = ICmpInst::ICMP_UGT; ; break;} case 36: #line 1117 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.IPredicate = ICmpInst::ICMP_ULE; ; break;} case 37: #line 1117 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.IPredicate = ICmpInst::ICMP_UGE; ; break;} case 38: #line 1121 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.FPredicate = FCmpInst::FCMP_OEQ; ; break;} case 39: #line 1121 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.FPredicate = FCmpInst::FCMP_ONE; ; break;} case 40: #line 1122 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.FPredicate = FCmpInst::FCMP_OLT; ; break;} case 41: #line 1122 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.FPredicate = FCmpInst::FCMP_OGT; ; break;} case 42: #line 1123 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.FPredicate = FCmpInst::FCMP_OLE; ; break;} case 43: #line 1123 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.FPredicate = FCmpInst::FCMP_OGE; ; break;} case 44: #line 1124 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.FPredicate = FCmpInst::FCMP_ORD; ; break;} case 45: #line 1124 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.FPredicate = FCmpInst::FCMP_UNO; ; break;} case 46: #line 1125 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.FPredicate = FCmpInst::FCMP_UEQ; ; break;} case 47: #line 1125 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.FPredicate = FCmpInst::FCMP_UNE; ; break;} case 48: #line 1126 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.FPredicate = FCmpInst::FCMP_ULT; ; break;} case 49: #line 1126 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.FPredicate = FCmpInst::FCMP_UGT; ; break;} case 50: #line 1127 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.FPredicate = FCmpInst::FCMP_ULE; ; break;} case 51: #line 1127 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.FPredicate = FCmpInst::FCMP_UGE; ; break;} case 52: #line 1128 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.FPredicate = FCmpInst::FCMP_TRUE; ; break;} case 53: #line 1129 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.FPredicate = FCmpInst::FCMP_FALSE; ; break;} case 64: #line 1138 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.StrVal = 0; ; break;} case 65: #line 1140 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.UIntVal=yyvsp[-1].UInt64Val; ; break;} case 66: #line 1141 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.UIntVal=0; ; break;} case 67: #line 1145 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.StrVal = yyvsp[-1].StrVal; CHECK_FOR_ERROR ; break;} case 68: #line 1149 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.StrVal = 0; CHECK_FOR_ERROR ; break;} case 72: #line 1157 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.StrVal = 0; CHECK_FOR_ERROR ; break;} case 73: #line 1162 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.StrVal = yyvsp[-1].StrVal; CHECK_FOR_ERROR ; break;} case 74: #line 1168 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.Linkage = GlobalValue::InternalLinkage; ; break;} case 75: #line 1169 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.Linkage = GlobalValue::WeakLinkage; ; break;} case 76: #line 1170 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.Linkage = GlobalValue::LinkOnceLinkage; ; break;} case 77: #line 1171 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.Linkage = GlobalValue::AppendingLinkage; ; break;} case 78: #line 1172 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.Linkage = GlobalValue::DLLExportLinkage; ; break;} case 79: #line 1176 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.Linkage = GlobalValue::DLLImportLinkage; ; break;} case 80: #line 1177 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.Linkage = GlobalValue::ExternalWeakLinkage; ; break;} case 81: #line 1178 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.Linkage = GlobalValue::ExternalLinkage; ; break;} case 82: #line 1182 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.Visibility = GlobalValue::DefaultVisibility; ; break;} case 83: #line 1183 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.Visibility = GlobalValue::DefaultVisibility; ; break;} case 84: #line 1184 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.Visibility = GlobalValue::HiddenVisibility; ; break;} case 85: #line 1185 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.Visibility = GlobalValue::ProtectedVisibility; ; break;} case 86: #line 1189 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.Linkage = GlobalValue::ExternalLinkage; ; break;} case 87: #line 1190 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.Linkage = GlobalValue::DLLImportLinkage; ; break;} case 88: #line 1191 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.Linkage = GlobalValue::ExternalWeakLinkage; ; break;} case 89: #line 1195 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.Linkage = GlobalValue::ExternalLinkage; ; break;} case 90: #line 1196 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.Linkage = GlobalValue::InternalLinkage; ; break;} case 91: #line 1197 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.Linkage = GlobalValue::LinkOnceLinkage; ; break;} case 92: #line 1198 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.Linkage = GlobalValue::WeakLinkage; ; break;} case 93: #line 1199 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.Linkage = GlobalValue::DLLExportLinkage; ; break;} case 94: #line 1203 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.Linkage = GlobalValue::ExternalLinkage; ; break;} case 95: #line 1204 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.Linkage = GlobalValue::WeakLinkage; ; break;} case 96: #line 1205 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.Linkage = GlobalValue::InternalLinkage; ; break;} case 97: #line 1208 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.UIntVal = CallingConv::C; ; break;} case 98: #line 1209 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.UIntVal = CallingConv::C; ; break;} case 99: #line 1210 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.UIntVal = CallingConv::Fast; ; break;} case 100: #line 1211 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.UIntVal = CallingConv::Cold; ; break;} case 101: #line 1212 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.UIntVal = CallingConv::X86_StdCall; ; break;} case 102: #line 1213 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.UIntVal = CallingConv::X86_FastCall; ; break;} case 103: #line 1214 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if ((unsigned)yyvsp[0].UInt64Val != yyvsp[0].UInt64Val) GEN_ERROR("Calling conv too large"); yyval.UIntVal = yyvsp[0].UInt64Val; CHECK_FOR_ERROR ; break;} case 104: #line 1221 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ParamAttrs = ParamAttr::ZExt; ; break;} case 105: #line 1222 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ParamAttrs = ParamAttr::ZExt; ; break;} case 106: #line 1223 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ParamAttrs = ParamAttr::SExt; ; break;} case 107: #line 1224 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ParamAttrs = ParamAttr::SExt; ; break;} case 108: #line 1225 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ParamAttrs = ParamAttr::InReg; ; break;} case 109: #line 1226 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ParamAttrs = ParamAttr::StructRet; ; break;} case 110: #line 1227 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ParamAttrs = ParamAttr::NoAlias; ; break;} case 111: #line 1228 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ParamAttrs = ParamAttr::ByVal; ; break;} case 112: #line 1229 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ParamAttrs = ParamAttr::Nest; ; break;} case 113: #line 1232 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ParamAttrs = ParamAttr::None; ; break;} case 114: #line 1233 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ParamAttrs = yyvsp[-1].ParamAttrs | yyvsp[0].ParamAttrs; ; break;} case 115: #line 1238 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ParamAttrs = ParamAttr::NoReturn; ; break;} case 116: #line 1239 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ParamAttrs = ParamAttr::NoUnwind; ; break;} case 117: #line 1240 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ParamAttrs = ParamAttr::ZExt; ; break;} case 118: #line 1241 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ParamAttrs = ParamAttr::SExt; ; break;} case 119: #line 1242 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ParamAttrs = ParamAttr::ReadNone; ; break;} case 120: #line 1243 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ParamAttrs = ParamAttr::ReadOnly; ; break;} case 121: #line 1246 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ParamAttrs = ParamAttr::None; ; break;} case 122: #line 1247 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ParamAttrs = yyvsp[-1].ParamAttrs | yyvsp[0].ParamAttrs; ; break;} case 123: #line 1252 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.StrVal = 0; ; break;} case 124: #line 1253 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.StrVal = yyvsp[0].StrVal; ; break;} case 125: #line 1260 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.UIntVal = 0; ; break;} case 126: #line 1261 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.UIntVal = yyvsp[0].UInt64Val; if (yyval.UIntVal != 0 && !isPowerOf2_32(yyval.UIntVal)) GEN_ERROR("Alignment must be a power of two"); CHECK_FOR_ERROR ; break;} case 127: #line 1267 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.UIntVal = 0; ; break;} case 128: #line 1268 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.UIntVal = yyvsp[0].UInt64Val; if (yyval.UIntVal != 0 && !isPowerOf2_32(yyval.UIntVal)) GEN_ERROR("Alignment must be a power of two"); CHECK_FOR_ERROR ; break;} case 129: #line 1277 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { for (unsigned i = 0, e = yyvsp[0].StrVal->length(); i != e; ++i) if ((*yyvsp[0].StrVal)[i] == '"' || (*yyvsp[0].StrVal)[i] == '\\') GEN_ERROR("Invalid character in section name"); yyval.StrVal = yyvsp[0].StrVal; CHECK_FOR_ERROR ; break;} case 130: #line 1285 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.StrVal = 0; ; break;} case 131: #line 1286 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.StrVal = yyvsp[0].StrVal; ; break;} case 132: #line 1291 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" {; break;} case 133: #line 1292 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" {; break;} case 134: #line 1293 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { CurGV->setSection(*yyvsp[0].StrVal); delete yyvsp[0].StrVal; CHECK_FOR_ERROR ; break;} case 135: #line 1298 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (yyvsp[0].UInt64Val != 0 && !isPowerOf2_32(yyvsp[0].UInt64Val)) GEN_ERROR("Alignment must be a power of two"); CurGV->setAlignment(yyvsp[0].UInt64Val); CHECK_FOR_ERROR ; break;} case 143: #line 1314 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.TypeVal = new PATypeHolder(OpaqueType::get()); CHECK_FOR_ERROR ; break;} case 144: #line 1318 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.TypeVal = new PATypeHolder(yyvsp[0].PrimType); CHECK_FOR_ERROR ; break;} case 145: #line 1322 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // Pointer type? if (*yyvsp[-2].TypeVal == Type::LabelTy) GEN_ERROR("Cannot form a pointer to a basic block"); yyval.TypeVal = new PATypeHolder(HandleUpRefs(PointerType::get(*yyvsp[-2].TypeVal, yyvsp[-1].UIntVal))); delete yyvsp[-2].TypeVal; CHECK_FOR_ERROR ; break;} case 146: #line 1329 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // Named types are also simple types... const Type* tmp = getTypeVal(yyvsp[0].ValIDVal); CHECK_FOR_ERROR yyval.TypeVal = new PATypeHolder(tmp); ; break;} case 147: #line 1334 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // Type UpReference if (yyvsp[0].UInt64Val > (uint64_t)~0U) GEN_ERROR("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"); CHECK_FOR_ERROR ; break;} case 148: #line 1342 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // Allow but ignore attributes on function types; this permits auto-upgrade. // FIXME: remove in LLVM 3.0. const Type* RetTy = *yyvsp[-4].TypeVal; if (!(RetTy->isFirstClassType() || RetTy == Type::VoidTy || isa(RetTy))) GEN_ERROR("LLVM Functions cannot return aggregates"); std::vector Params; TypeWithAttrsList::iterator I = yyvsp[-2].TypeWithAttrsList->begin(), E = yyvsp[-2].TypeWithAttrsList->end(); for (; I != E; ++I ) { const Type *Ty = I->Ty->get(); Params.push_back(Ty); } bool isVarArg = Params.size() && Params.back() == Type::VoidTy; if (isVarArg) Params.pop_back(); for (unsigned i = 0; i != Params.size(); ++i) if (!(Params[i]->isFirstClassType() || isa(Params[i]))) GEN_ERROR("Function arguments must be value types!"); CHECK_FOR_ERROR FunctionType *FT = FunctionType::get(RetTy, Params, isVarArg); delete yyvsp[-2].TypeWithAttrsList; // Delete the argument list delete yyvsp[-4].TypeVal; // Delete the return type handle yyval.TypeVal = new PATypeHolder(HandleUpRefs(FT)); CHECK_FOR_ERROR ; break;} case 149: #line 1372 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // Allow but ignore attributes on function types; this permits auto-upgrade. // FIXME: remove in LLVM 3.0. std::vector Params; TypeWithAttrsList::iterator I = yyvsp[-2].TypeWithAttrsList->begin(), E = yyvsp[-2].TypeWithAttrsList->end(); for ( ; I != E; ++I ) { const Type* Ty = I->Ty->get(); Params.push_back(Ty); } bool isVarArg = Params.size() && Params.back() == Type::VoidTy; if (isVarArg) Params.pop_back(); for (unsigned i = 0; i != Params.size(); ++i) if (!(Params[i]->isFirstClassType() || isa(Params[i]))) GEN_ERROR("Function arguments must be value types!"); CHECK_FOR_ERROR FunctionType *FT = FunctionType::get(yyvsp[-4].PrimType, Params, isVarArg); delete yyvsp[-2].TypeWithAttrsList; // Delete the argument list yyval.TypeVal = new PATypeHolder(HandleUpRefs(FT)); CHECK_FOR_ERROR ; break;} case 150: #line 1397 "/Users/clamb/Documents/llvm/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; CHECK_FOR_ERROR ; break;} case 151: #line 1402 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // Vector type? const llvm::Type* ElemTy = yyvsp[-1].TypeVal->get(); if ((unsigned)yyvsp[-3].UInt64Val != yyvsp[-3].UInt64Val) GEN_ERROR("Unsigned result not equal to signed result"); if (!ElemTy->isFloatingPoint() && !ElemTy->isInteger()) GEN_ERROR("Element type of a VectorType must be primitive"); yyval.TypeVal = new PATypeHolder(HandleUpRefs(VectorType::get(*yyvsp[-1].TypeVal, (unsigned)yyvsp[-3].UInt64Val))); delete yyvsp[-1].TypeVal; CHECK_FOR_ERROR ; break;} case 152: #line 1412 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // Structure type? std::vector Elements; for (std::list::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; CHECK_FOR_ERROR ; break;} case 153: #line 1422 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // Empty structure type? yyval.TypeVal = new PATypeHolder(StructType::get(std::vector())); CHECK_FOR_ERROR ; break;} case 154: #line 1426 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { std::vector Elements; for (std::list::iterator I = yyvsp[-2].TypeList->begin(), E = yyvsp[-2].TypeList->end(); I != E; ++I) Elements.push_back(*I); yyval.TypeVal = new PATypeHolder(HandleUpRefs(StructType::get(Elements, true))); delete yyvsp[-2].TypeList; CHECK_FOR_ERROR ; break;} case 155: #line 1436 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // Empty structure type? yyval.TypeVal = new PATypeHolder(StructType::get(std::vector(), true)); CHECK_FOR_ERROR ; break;} case 156: #line 1443 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // Allow but ignore attributes on function types; this permits auto-upgrade. // FIXME: remove in LLVM 3.0. yyval.TypeWithAttrs.Ty = yyvsp[-1].TypeVal; yyval.TypeWithAttrs.Attrs = ParamAttr::None; ; break;} case 157: #line 1452 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!UpRefs.empty()) GEN_ERROR("Invalid upreference in type: " + (*yyvsp[0].TypeVal)->getDescription()); if (!(*yyvsp[0].TypeVal)->isFirstClassType()) GEN_ERROR("LLVM functions cannot return aggregate types"); yyval.TypeVal = yyvsp[0].TypeVal; ; break;} case 158: #line 1459 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.TypeVal = new PATypeHolder(Type::VoidTy); ; break;} case 159: #line 1464 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.TypeWithAttrsList = new TypeWithAttrsList(); yyval.TypeWithAttrsList->push_back(yyvsp[0].TypeWithAttrs); CHECK_FOR_ERROR ; break;} case 160: #line 1469 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { (yyval.TypeWithAttrsList=yyvsp[-2].TypeWithAttrsList)->push_back(yyvsp[0].TypeWithAttrs); CHECK_FOR_ERROR ; break;} case 162: #line 1477 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.TypeWithAttrsList=yyvsp[-2].TypeWithAttrsList; TypeWithAttrs TWA; TWA.Attrs = ParamAttr::None; TWA.Ty = new PATypeHolder(Type::VoidTy); yyval.TypeWithAttrsList->push_back(TWA); CHECK_FOR_ERROR ; break;} case 163: #line 1484 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.TypeWithAttrsList = new TypeWithAttrsList; TypeWithAttrs TWA; TWA.Attrs = ParamAttr::None; TWA.Ty = new PATypeHolder(Type::VoidTy); yyval.TypeWithAttrsList->push_back(TWA); CHECK_FOR_ERROR ; break;} case 164: #line 1491 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.TypeWithAttrsList = new TypeWithAttrsList(); CHECK_FOR_ERROR ; break;} case 165: #line 1499 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.TypeList = new std::list(); yyval.TypeList->push_back(*yyvsp[0].TypeVal); delete yyvsp[0].TypeVal; CHECK_FOR_ERROR ; break;} case 166: #line 1505 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { (yyval.TypeList=yyvsp[-2].TypeList)->push_back(*yyvsp[0].TypeVal); delete yyvsp[0].TypeVal; CHECK_FOR_ERROR ; break;} case 167: #line 1517 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // Nonempty unsized arr if (!UpRefs.empty()) GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-3].TypeVal)->getDescription()); const ArrayType *ATy = dyn_cast(yyvsp[-3].TypeVal->get()); if (ATy == 0) GEN_ERROR("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()) GEN_ERROR("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()) GEN_ERROR("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; CHECK_FOR_ERROR ; break;} case 168: #line 1545 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!UpRefs.empty()) GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-2].TypeVal)->getDescription()); const ArrayType *ATy = dyn_cast(yyvsp[-2].TypeVal->get()); if (ATy == 0) GEN_ERROR("Cannot make array constant with type: '" + (*yyvsp[-2].TypeVal)->getDescription() + "'"); int NumElements = ATy->getNumElements(); if (NumElements != -1 && NumElements != 0) GEN_ERROR("Type mismatch: constant sized array initialized with 0" " arguments, but has size of " + itostr(NumElements) +""); yyval.ConstVal = ConstantArray::get(ATy, std::vector()); delete yyvsp[-2].TypeVal; CHECK_FOR_ERROR ; break;} case 169: #line 1561 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!UpRefs.empty()) GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-2].TypeVal)->getDescription()); const ArrayType *ATy = dyn_cast(yyvsp[-2].TypeVal->get()); if (ATy == 0) GEN_ERROR("Cannot make array constant with type: '" + (*yyvsp[-2].TypeVal)->getDescription() + "'"); int NumElements = ATy->getNumElements(); const Type *ETy = ATy->getElementType(); if (NumElements != -1 && NumElements != int(yyvsp[0].StrVal->length())) GEN_ERROR("Can't build string constant of size " + itostr((int)(yyvsp[0].StrVal->length())) + " when array has size " + itostr(NumElements) + ""); std::vector Vals; if (ETy == Type::Int8Ty) { for (unsigned i = 0; i < yyvsp[0].StrVal->length(); ++i) Vals.push_back(ConstantInt::get(ETy, (*yyvsp[0].StrVal)[i])); } else { delete yyvsp[0].StrVal; GEN_ERROR("Cannot build string arrays of non byte sized elements"); } delete yyvsp[0].StrVal; yyval.ConstVal = ConstantArray::get(ATy, Vals); delete yyvsp[-2].TypeVal; CHECK_FOR_ERROR ; break;} case 170: #line 1588 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // Nonempty unsized arr if (!UpRefs.empty()) GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-3].TypeVal)->getDescription()); const VectorType *PTy = dyn_cast(yyvsp[-3].TypeVal->get()); if (PTy == 0) GEN_ERROR("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()) GEN_ERROR("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()) GEN_ERROR("Element #" + utostr(i) + " is not of type '" + ETy->getDescription() +"' as required!\nIt is of type '"+ (*yyvsp[-1].ConstVector)[i]->getType()->getDescription() + "'."); } yyval.ConstVal = ConstantVector::get(PTy, *yyvsp[-1].ConstVector); delete yyvsp[-3].TypeVal; delete yyvsp[-1].ConstVector; CHECK_FOR_ERROR ; break;} case 171: #line 1616 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { const StructType *STy = dyn_cast(yyvsp[-3].TypeVal->get()); if (STy == 0) GEN_ERROR("Cannot make struct constant with type: '" + (*yyvsp[-3].TypeVal)->getDescription() + "'"); if (yyvsp[-1].ConstVector->size() != STy->getNumContainedTypes()) GEN_ERROR("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)) GEN_ERROR("Expected type '" + STy->getElementType(i)->getDescription() + "' for element #" + utostr(i) + " of structure initializer"); // Check to ensure that Type is not packed if (STy->isPacked()) GEN_ERROR("Unpacked Initializer to vector type '" + STy->getDescription() + "'"); yyval.ConstVal = ConstantStruct::get(STy, *yyvsp[-1].ConstVector); delete yyvsp[-3].TypeVal; delete yyvsp[-1].ConstVector; CHECK_FOR_ERROR ; break;} case 172: #line 1642 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!UpRefs.empty()) GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-2].TypeVal)->getDescription()); const StructType *STy = dyn_cast(yyvsp[-2].TypeVal->get()); if (STy == 0) GEN_ERROR("Cannot make struct constant with type: '" + (*yyvsp[-2].TypeVal)->getDescription() + "'"); if (STy->getNumContainedTypes() != 0) GEN_ERROR("Illegal number of initializers for structure type"); // Check to ensure that Type is not packed if (STy->isPacked()) GEN_ERROR("Unpacked Initializer to vector type '" + STy->getDescription() + "'"); yyval.ConstVal = ConstantStruct::get(STy, std::vector()); delete yyvsp[-2].TypeVal; CHECK_FOR_ERROR ; break;} case 173: #line 1662 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { const StructType *STy = dyn_cast(yyvsp[-5].TypeVal->get()); if (STy == 0) GEN_ERROR("Cannot make struct constant with type: '" + (*yyvsp[-5].TypeVal)->getDescription() + "'"); if (yyvsp[-2].ConstVector->size() != STy->getNumContainedTypes()) GEN_ERROR("Illegal number of initializers for structure type"); // Check to ensure that constants are compatible with the type initializer! for (unsigned i = 0, e = yyvsp[-2].ConstVector->size(); i != e; ++i) if ((*yyvsp[-2].ConstVector)[i]->getType() != STy->getElementType(i)) GEN_ERROR("Expected type '" + STy->getElementType(i)->getDescription() + "' for element #" + utostr(i) + " of structure initializer"); // Check to ensure that Type is packed if (!STy->isPacked()) GEN_ERROR("Vector initializer to non-vector type '" + STy->getDescription() + "'"); yyval.ConstVal = ConstantStruct::get(STy, *yyvsp[-2].ConstVector); delete yyvsp[-5].TypeVal; delete yyvsp[-2].ConstVector; CHECK_FOR_ERROR ; break;} case 174: #line 1688 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!UpRefs.empty()) GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-4].TypeVal)->getDescription()); const StructType *STy = dyn_cast(yyvsp[-4].TypeVal->get()); if (STy == 0) GEN_ERROR("Cannot make struct constant with type: '" + (*yyvsp[-4].TypeVal)->getDescription() + "'"); if (STy->getNumContainedTypes() != 0) GEN_ERROR("Illegal number of initializers for structure type"); // Check to ensure that Type is packed if (!STy->isPacked()) GEN_ERROR("Vector initializer to non-vector type '" + STy->getDescription() + "'"); yyval.ConstVal = ConstantStruct::get(STy, std::vector()); delete yyvsp[-4].TypeVal; CHECK_FOR_ERROR ; break;} case 175: #line 1708 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!UpRefs.empty()) GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription()); const PointerType *PTy = dyn_cast(yyvsp[-1].TypeVal->get()); if (PTy == 0) GEN_ERROR("Cannot make null pointer constant with type: '" + (*yyvsp[-1].TypeVal)->getDescription() + "'"); yyval.ConstVal = ConstantPointerNull::get(PTy); delete yyvsp[-1].TypeVal; CHECK_FOR_ERROR ; break;} case 176: #line 1720 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!UpRefs.empty()) GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription()); yyval.ConstVal = UndefValue::get(yyvsp[-1].TypeVal->get()); delete yyvsp[-1].TypeVal; CHECK_FOR_ERROR ; break;} case 177: #line 1727 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!UpRefs.empty()) GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription()); const PointerType *Ty = dyn_cast(yyvsp[-1].TypeVal->get()); if (Ty == 0) GEN_ERROR("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, getExistingVal 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 // getExistingVal that we are at global scope here. // Function *SavedCurFn = CurFun.CurrentFunction; CurFun.CurrentFunction = 0; Value *V = getExistingVal(Ty, yyvsp[0].ValIDVal); CHECK_FOR_ERROR 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(Ty) && "Globals may only be used as pointers!"); const PointerType *PT = cast(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::GlobalName) Name = yyvsp[0].ValIDVal.getName(); else if (yyvsp[0].ValIDVal.Type != ValID::GlobalID) GEN_ERROR("Invalid reference to global"); // Create the forward referenced global. GlobalValue *GV; if (const FunctionType *FTy = dyn_cast(PT->getElementType())) { GV = new Function(FTy, GlobalValue::ExternalWeakLinkage, Name, CurModule.CurrentModule); } else { GV = new GlobalVariable(PT->getElementType(), false, GlobalValue::ExternalWeakLinkage, 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(V); delete yyvsp[-1].TypeVal; // Free the type handle CHECK_FOR_ERROR ; break;} case 178: #line 1793 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!UpRefs.empty()) GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription()); if (yyvsp[-1].TypeVal->get() != yyvsp[0].ConstVal->getType()) GEN_ERROR("Mismatched types for constant expression: " + (*yyvsp[-1].TypeVal)->getDescription() + " and " + yyvsp[0].ConstVal->getType()->getDescription()); yyval.ConstVal = yyvsp[0].ConstVal; delete yyvsp[-1].TypeVal; CHECK_FOR_ERROR ; break;} case 179: #line 1803 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!UpRefs.empty()) GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription()); const Type *Ty = yyvsp[-1].TypeVal->get(); if (isa(Ty) || Ty == Type::LabelTy || isa(Ty)) GEN_ERROR("Cannot create a null initialized value of this type"); yyval.ConstVal = Constant::getNullValue(Ty); delete yyvsp[-1].TypeVal; CHECK_FOR_ERROR ; break;} case 180: #line 1813 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // integral constants if (!ConstantInt::isValueValidForType(yyvsp[-1].PrimType, yyvsp[0].SInt64Val)) GEN_ERROR("Constant value doesn't fit in type"); yyval.ConstVal = ConstantInt::get(yyvsp[-1].PrimType, yyvsp[0].SInt64Val, true); CHECK_FOR_ERROR ; break;} case 181: #line 1819 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // arbitrary precision integer constants uint32_t BitWidth = cast(yyvsp[-1].PrimType)->getBitWidth(); if (yyvsp[0].APIntVal->getBitWidth() > BitWidth) { GEN_ERROR("Constant value does not fit in type"); } yyvsp[0].APIntVal->sextOrTrunc(BitWidth); yyval.ConstVal = ConstantInt::get(*yyvsp[0].APIntVal); delete yyvsp[0].APIntVal; CHECK_FOR_ERROR ; break;} case 182: #line 1829 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // integral constants if (!ConstantInt::isValueValidForType(yyvsp[-1].PrimType, yyvsp[0].UInt64Val)) GEN_ERROR("Constant value doesn't fit in type"); yyval.ConstVal = ConstantInt::get(yyvsp[-1].PrimType, yyvsp[0].UInt64Val, false); CHECK_FOR_ERROR ; break;} case 183: #line 1835 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // arbitrary precision integer constants uint32_t BitWidth = cast(yyvsp[-1].PrimType)->getBitWidth(); if (yyvsp[0].APIntVal->getBitWidth() > BitWidth) { GEN_ERROR("Constant value does not fit in type"); } yyvsp[0].APIntVal->zextOrTrunc(BitWidth); yyval.ConstVal = ConstantInt::get(*yyvsp[0].APIntVal); delete yyvsp[0].APIntVal; CHECK_FOR_ERROR ; break;} case 184: #line 1845 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // Boolean constants assert(cast(yyvsp[-1].PrimType)->getBitWidth() == 1 && "Not Bool?"); yyval.ConstVal = ConstantInt::getTrue(); CHECK_FOR_ERROR ; break;} case 185: #line 1850 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // Boolean constants assert(cast(yyvsp[-1].PrimType)->getBitWidth() == 1 && "Not Bool?"); yyval.ConstVal = ConstantInt::getFalse(); CHECK_FOR_ERROR ; break;} case 186: #line 1855 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // Floating point constants if (!ConstantFP::isValueValidForType(yyvsp[-1].PrimType, *yyvsp[0].FPVal)) GEN_ERROR("Floating point constant invalid for type"); // Lexer has no type info, so builds all float and double FP constants // as double. Fix this here. Long double is done right. if (&yyvsp[0].FPVal->getSemantics()==&APFloat::IEEEdouble && yyvsp[-1].PrimType==Type::FloatTy) yyvsp[0].FPVal->convert(APFloat::IEEEsingle, APFloat::rmNearestTiesToEven); yyval.ConstVal = ConstantFP::get(yyvsp[-1].PrimType, *yyvsp[0].FPVal); delete yyvsp[0].FPVal; CHECK_FOR_ERROR ; break;} case 187: #line 1868 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!UpRefs.empty()) GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription()); Constant *Val = yyvsp[-3].ConstVal; const Type *DestTy = yyvsp[-1].TypeVal->get(); if (!CastInst::castIsValid(yyvsp[-5].CastOpVal, yyvsp[-3].ConstVal, DestTy)) GEN_ERROR("invalid cast opcode for cast from '" + Val->getType()->getDescription() + "' to '" + DestTy->getDescription() + "'"); yyval.ConstVal = ConstantExpr::getCast(yyvsp[-5].CastOpVal, yyvsp[-3].ConstVal, DestTy); delete yyvsp[-1].TypeVal; ; break;} case 188: #line 1880 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!isa(yyvsp[-2].ConstVal->getType())) GEN_ERROR("GetElementPtr requires a pointer operand"); const Type *IdxTy = GetElementPtrInst::getIndexedType(yyvsp[-2].ConstVal->getType(), yyvsp[-1].ValueList->begin(), yyvsp[-1].ValueList->end(), true); if (!IdxTy) GEN_ERROR("Index list invalid for constant getelementptr"); SmallVector IdxVec; for (unsigned i = 0, e = yyvsp[-1].ValueList->size(); i != e; ++i) if (Constant *C = dyn_cast((*yyvsp[-1].ValueList)[i])) IdxVec.push_back(C); else GEN_ERROR("Indices to constant getelementptr must be constants"); delete yyvsp[-1].ValueList; yyval.ConstVal = ConstantExpr::getGetElementPtr(yyvsp[-2].ConstVal, &IdxVec[0], IdxVec.size()); CHECK_FOR_ERROR ; break;} case 189: #line 1902 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (yyvsp[-5].ConstVal->getType() != Type::Int1Ty) GEN_ERROR("Select condition must be of boolean type"); if (yyvsp[-3].ConstVal->getType() != yyvsp[-1].ConstVal->getType()) GEN_ERROR("Select operand types must match"); yyval.ConstVal = ConstantExpr::getSelect(yyvsp[-5].ConstVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal); CHECK_FOR_ERROR ; break;} case 190: #line 1910 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (yyvsp[-3].ConstVal->getType() != yyvsp[-1].ConstVal->getType()) GEN_ERROR("Binary operator types must match"); CHECK_FOR_ERROR; yyval.ConstVal = ConstantExpr::get(yyvsp[-5].BinaryOpVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal); ; break;} case 191: #line 1916 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (yyvsp[-3].ConstVal->getType() != yyvsp[-1].ConstVal->getType()) GEN_ERROR("Logical operator types must match"); if (!yyvsp[-3].ConstVal->getType()->isInteger()) { if (Instruction::isShift(yyvsp[-5].BinaryOpVal) || !isa(yyvsp[-3].ConstVal->getType()) || !cast(yyvsp[-3].ConstVal->getType())->getElementType()->isInteger()) GEN_ERROR("Logical operator requires integral operands"); } yyval.ConstVal = ConstantExpr::get(yyvsp[-5].BinaryOpVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal); CHECK_FOR_ERROR ; break;} case 192: #line 1927 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (yyvsp[-3].ConstVal->getType() != yyvsp[-1].ConstVal->getType()) GEN_ERROR("icmp operand types must match"); yyval.ConstVal = ConstantExpr::getICmp(yyvsp[-5].IPredicate, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal); ; break;} case 193: #line 1932 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (yyvsp[-3].ConstVal->getType() != yyvsp[-1].ConstVal->getType()) GEN_ERROR("fcmp operand types must match"); yyval.ConstVal = ConstantExpr::getFCmp(yyvsp[-5].FPredicate, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal); ; break;} case 194: #line 1937 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!ExtractElementInst::isValidOperands(yyvsp[-3].ConstVal, yyvsp[-1].ConstVal)) GEN_ERROR("Invalid extractelement operands"); yyval.ConstVal = ConstantExpr::getExtractElement(yyvsp[-3].ConstVal, yyvsp[-1].ConstVal); CHECK_FOR_ERROR ; break;} case 195: #line 1943 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!InsertElementInst::isValidOperands(yyvsp[-5].ConstVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal)) GEN_ERROR("Invalid insertelement operands"); yyval.ConstVal = ConstantExpr::getInsertElement(yyvsp[-5].ConstVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal); CHECK_FOR_ERROR ; break;} case 196: #line 1949 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!ShuffleVectorInst::isValidOperands(yyvsp[-5].ConstVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal)) GEN_ERROR("Invalid shufflevector operands"); yyval.ConstVal = ConstantExpr::getShuffleVector(yyvsp[-5].ConstVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal); CHECK_FOR_ERROR ; break;} case 197: #line 1958 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { (yyval.ConstVector = yyvsp[-2].ConstVector)->push_back(yyvsp[0].ConstVal); CHECK_FOR_ERROR ; break;} case 198: #line 1962 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ConstVector = new std::vector(); yyval.ConstVector->push_back(yyvsp[0].ConstVal); CHECK_FOR_ERROR ; break;} case 199: #line 1970 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.BoolVal = false; ; break;} case 200: #line 1970 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.BoolVal = true; ; break;} case 201: #line 1973 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.BoolVal = true; ; break;} case 202: #line 1973 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.BoolVal = false; ; break;} case 203: #line 1976 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { const Type* VTy = yyvsp[-1].TypeVal->get(); Value *V = getVal(VTy, yyvsp[0].ValIDVal); CHECK_FOR_ERROR GlobalValue* Aliasee = dyn_cast(V); if (!Aliasee) GEN_ERROR("Aliases can be created only to global values"); yyval.ConstVal = Aliasee; CHECK_FOR_ERROR delete yyvsp[-1].TypeVal; ; break;} case 204: #line 1988 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { Constant *Val = yyvsp[-3].ConstVal; const Type *DestTy = yyvsp[-1].TypeVal->get(); if (!CastInst::castIsValid(yyvsp[-5].CastOpVal, yyvsp[-3].ConstVal, DestTy)) GEN_ERROR("invalid cast opcode for cast from '" + Val->getType()->getDescription() + "' to '" + DestTy->getDescription() + "'"); yyval.ConstVal = ConstantExpr::getCast(yyvsp[-5].CastOpVal, yyvsp[-3].ConstVal, DestTy); CHECK_FOR_ERROR delete yyvsp[-1].TypeVal; ; break;} case 205: #line 2009 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ModuleVal = ParserResult = CurModule.CurrentModule; CurModule.ModuleDone(); CHECK_FOR_ERROR; ; break;} case 206: #line 2014 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ModuleVal = ParserResult = CurModule.CurrentModule; CurModule.ModuleDone(); CHECK_FOR_ERROR; ; break;} case 209: #line 2027 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { CurFun.isDeclare = false; ; break;} case 210: #line 2027 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { CurFun.FunctionDone(); CHECK_FOR_ERROR ; break;} case 211: #line 2031 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { CurFun.isDeclare = true; ; break;} case 212: #line 2031 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { CHECK_FOR_ERROR ; break;} case 213: #line 2034 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { CHECK_FOR_ERROR ; break;} case 214: #line 2037 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!UpRefs.empty()) GEN_ERROR("Invalid upreference in type: " + (*yyvsp[0].TypeVal)->getDescription()); // 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) { CHECK_FOR_ERROR // 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; CHECK_FOR_ERROR ; break;} case 215: #line 2061 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { ResolveTypeTo(yyvsp[-2].StrVal, yyvsp[0].PrimType); if (!setTypeName(yyvsp[0].PrimType, yyvsp[-2].StrVal) && !yyvsp[-2].StrVal) { CHECK_FOR_ERROR // If this is a named type that is not a redefinition, add it to the slot // table. CurModule.Types.push_back(yyvsp[0].PrimType); } CHECK_FOR_ERROR ; break;} case 216: #line 2073 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { /* "Externally Visible" Linkage */ if (yyvsp[-1].ConstVal == 0) GEN_ERROR("Global value initializer is not a constant"); CurGV = ParseGlobalVariable(yyvsp[-5].StrVal, GlobalValue::ExternalLinkage, yyvsp[-4].Visibility, yyvsp[-2].BoolVal, yyvsp[-1].ConstVal->getType(), yyvsp[-1].ConstVal, yyvsp[-3].BoolVal, yyvsp[0].UIntVal); CHECK_FOR_ERROR ; break;} case 217: #line 2080 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { CurGV = 0; ; break;} case 218: #line 2084 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (yyvsp[-1].ConstVal == 0) GEN_ERROR("Global value initializer is not a constant"); CurGV = ParseGlobalVariable(yyvsp[-6].StrVal, yyvsp[-5].Linkage, yyvsp[-4].Visibility, yyvsp[-2].BoolVal, yyvsp[-1].ConstVal->getType(), yyvsp[-1].ConstVal, yyvsp[-3].BoolVal, yyvsp[0].UIntVal); CHECK_FOR_ERROR ; break;} case 219: #line 2089 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { CurGV = 0; ; break;} case 220: #line 2093 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!UpRefs.empty()) GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription()); CurGV = ParseGlobalVariable(yyvsp[-6].StrVal, yyvsp[-5].Linkage, yyvsp[-4].Visibility, yyvsp[-2].BoolVal, *yyvsp[-1].TypeVal, 0, yyvsp[-3].BoolVal, yyvsp[0].UIntVal); CHECK_FOR_ERROR delete yyvsp[-1].TypeVal; ; break;} case 221: #line 2099 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { CurGV = 0; CHECK_FOR_ERROR ; break;} case 222: #line 2103 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { std::string Name; if (yyvsp[-4].StrVal) { Name = *yyvsp[-4].StrVal; delete yyvsp[-4].StrVal; } if (Name.empty()) GEN_ERROR("Alias name cannot be empty"); Constant* Aliasee = yyvsp[0].ConstVal; if (Aliasee == 0) GEN_ERROR(std::string("Invalid aliasee for alias: ") + Name); GlobalAlias* GA = new GlobalAlias(Aliasee->getType(), yyvsp[-1].Linkage, Name, Aliasee, CurModule.CurrentModule); GA->setVisibility(yyvsp[-3].Visibility); InsertValue(GA, CurModule.Values); // If there was a forward reference of this alias, resolve it now. ValID ID; if (!Name.empty()) ID = ValID::createGlobalName(Name); else ID = ValID::createGlobalID(CurModule.Values.size()-1); if (GlobalValue *FWGV = CurModule.GetForwardRefForGlobal(GA->getType(), ID)) { // Replace uses of the fwdref with the actual alias. FWGV->replaceAllUsesWith(GA); if (GlobalVariable *GV = dyn_cast(FWGV)) GV->eraseFromParent(); else cast(FWGV)->eraseFromParent(); } ID.destroy(); CHECK_FOR_ERROR ; break;} case 223: #line 2143 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { CHECK_FOR_ERROR ; break;} case 224: #line 2146 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { CHECK_FOR_ERROR ; break;} case 225: #line 2152 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { const std::string &AsmSoFar = CurModule.CurrentModule->getModuleInlineAsm(); if (AsmSoFar.empty()) CurModule.CurrentModule->setModuleInlineAsm(*yyvsp[0].StrVal); else CurModule.CurrentModule->setModuleInlineAsm(AsmSoFar+"\n"+*yyvsp[0].StrVal); delete yyvsp[0].StrVal; CHECK_FOR_ERROR ; break;} case 226: #line 2162 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { CurModule.CurrentModule->setTargetTriple(*yyvsp[0].StrVal); delete yyvsp[0].StrVal; ; break;} case 227: #line 2166 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { CurModule.CurrentModule->setDataLayout(*yyvsp[0].StrVal); delete yyvsp[0].StrVal; ; break;} case 229: #line 2173 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { CurModule.CurrentModule->addLibrary(*yyvsp[0].StrVal); delete yyvsp[0].StrVal; CHECK_FOR_ERROR ; break;} case 230: #line 2178 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { CurModule.CurrentModule->addLibrary(*yyvsp[0].StrVal); delete yyvsp[0].StrVal; CHECK_FOR_ERROR ; break;} case 231: #line 2183 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { CHECK_FOR_ERROR ; break;} case 232: #line 2192 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!UpRefs.empty()) GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-2].TypeVal)->getDescription()); if (*yyvsp[-2].TypeVal == Type::VoidTy) GEN_ERROR("void typed arguments are invalid"); ArgListEntry E; E.Attrs = yyvsp[-1].ParamAttrs; E.Ty = yyvsp[-2].TypeVal; E.Name = yyvsp[0].StrVal; yyval.ArgList = yyvsp[-4].ArgList; yyvsp[-4].ArgList->push_back(E); CHECK_FOR_ERROR ; break;} case 233: #line 2202 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!UpRefs.empty()) GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-2].TypeVal)->getDescription()); if (*yyvsp[-2].TypeVal == Type::VoidTy) GEN_ERROR("void typed arguments are invalid"); ArgListEntry E; E.Attrs = yyvsp[-1].ParamAttrs; E.Ty = yyvsp[-2].TypeVal; E.Name = yyvsp[0].StrVal; yyval.ArgList = new ArgListType; yyval.ArgList->push_back(E); CHECK_FOR_ERROR ; break;} case 234: #line 2213 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ArgList = yyvsp[0].ArgList; CHECK_FOR_ERROR ; break;} case 235: #line 2217 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ArgList = yyvsp[-2].ArgList; struct ArgListEntry E; E.Ty = new PATypeHolder(Type::VoidTy); E.Name = 0; E.Attrs = ParamAttr::None; yyval.ArgList->push_back(E); CHECK_FOR_ERROR ; break;} case 236: #line 2226 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ArgList = new ArgListType; struct ArgListEntry E; E.Ty = new PATypeHolder(Type::VoidTy); E.Name = 0; E.Attrs = ParamAttr::None; yyval.ArgList->push_back(E); CHECK_FOR_ERROR ; break;} case 237: #line 2235 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ArgList = 0; CHECK_FOR_ERROR ; break;} case 238: #line 2241 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { std::string FunctionName(*yyvsp[-7].StrVal); delete yyvsp[-7].StrVal; // Free strdup'd memory! // Check the function result for abstractness if this is a define. We should // have no abstract types at this point if (!CurFun.isDeclare && CurModule.TypeIsUnresolved(yyvsp[-8].TypeVal)) GEN_ERROR("Reference to abstract result: "+ yyvsp[-8].TypeVal->get()->getDescription()); std::vector ParamTypeList; ParamAttrsVector Attrs; if (yyvsp[-3].ParamAttrs != ParamAttr::None) { ParamAttrsWithIndex PAWI; PAWI.index = 0; PAWI.attrs = yyvsp[-3].ParamAttrs; Attrs.push_back(PAWI); } if (yyvsp[-5].ArgList) { // If there are arguments... unsigned index = 1; for (ArgListType::iterator I = yyvsp[-5].ArgList->begin(); I != yyvsp[-5].ArgList->end(); ++I, ++index) { const Type* Ty = I->Ty->get(); if (!CurFun.isDeclare && CurModule.TypeIsUnresolved(I->Ty)) GEN_ERROR("Reference to abstract argument: " + Ty->getDescription()); ParamTypeList.push_back(Ty); if (Ty != Type::VoidTy) if (I->Attrs != ParamAttr::None) { ParamAttrsWithIndex PAWI; PAWI.index = index; PAWI.attrs = I->Attrs; Attrs.push_back(PAWI); } } } bool isVarArg = ParamTypeList.size() && ParamTypeList.back() == Type::VoidTy; if (isVarArg) ParamTypeList.pop_back(); const ParamAttrsList *PAL = 0; if (!Attrs.empty()) PAL = ParamAttrsList::get(Attrs); FunctionType *FT = FunctionType::get(*yyvsp[-8].TypeVal, ParamTypeList, isVarArg); const PointerType *PFT = PointerType::getUnqual(FT); delete yyvsp[-8].TypeVal; ValID ID; if (!FunctionName.empty()) { ID = ValID::createGlobalName((char*)FunctionName.c_str()); } else { ID = ValID::createGlobalID(CurModule.Values.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(FWRef); assert(!Fn->getParamAttrs() && "Forward reference has parameter attributes!"); 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))) { if (Fn->getFunctionType() != FT ) { // The existing function doesn't have the same type. This is an overload // error. GEN_ERROR("Overload of function '" + FunctionName + "' not permitted."); } else if (Fn->getParamAttrs() != PAL) { // The existing function doesn't have the same parameter attributes. // This is an overload error. GEN_ERROR("Overload of function '" + FunctionName + "' not permitted."); } else if (!CurFun.isDeclare && !Fn->isDeclaration()) { // Neither the existing or the current function is a declaration and they // have the same name and same type. Clearly this is a redefinition. GEN_ERROR("Redefinition of function '" + FunctionName + "'"); } else if (Fn->isDeclaration()) { // Make sure to strip off any argument names so we can't get conflicts. 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::ExternalWeakLinkage, FunctionName, CurModule.CurrentModule); InsertValue(Fn, CurModule.Values); } CurFun.FunctionStart(Fn); if (CurFun.isDeclare) { // If we have declaration, always overwrite linkage. This will allow us to // correctly handle cases, when pointer to function is passed as argument to // another function. Fn->setLinkage(CurFun.Linkage); Fn->setVisibility(CurFun.Visibility); } Fn->setCallingConv(yyvsp[-9].UIntVal); Fn->setParamAttrs(PAL); Fn->setAlignment(yyvsp[-1].UIntVal); if (yyvsp[-2].StrVal) { Fn->setSection(*yyvsp[-2].StrVal); delete yyvsp[-2].StrVal; } if (yyvsp[0].StrVal) { Fn->setCollector(yyvsp[0].StrVal->c_str()); delete yyvsp[0].StrVal; } // Add all of the arguments we parsed to the function... if (yyvsp[-5].ArgList) { // Is null if empty... if (isVarArg) { // Nuke the last entry assert(yyvsp[-5].ArgList->back().Ty->get() == Type::VoidTy && yyvsp[-5].ArgList->back().Name == 0 && "Not a varargs marker!"); delete yyvsp[-5].ArgList->back().Ty; yyvsp[-5].ArgList->pop_back(); // Delete the last entry } Function::arg_iterator ArgIt = Fn->arg_begin(); Function::arg_iterator ArgEnd = Fn->arg_end(); unsigned Idx = 1; for (ArgListType::iterator I = yyvsp[-5].ArgList->begin(); I != yyvsp[-5].ArgList->end() && ArgIt != ArgEnd; ++I, ++ArgIt) { delete I->Ty; // Delete the typeholder... setValueName(ArgIt, I->Name); // Insert arg into symtab... CHECK_FOR_ERROR InsertValue(ArgIt); Idx++; } delete yyvsp[-5].ArgList; // We're now done with the argument list } CHECK_FOR_ERROR ; break;} case 241: #line 2376 "/Users/clamb/Documents/llvm/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[-3].Linkage); yyval.FunctionVal->setVisibility(yyvsp[-2].Visibility); ; break;} case 244: #line 2387 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.FunctionVal = yyvsp[-1].FunctionVal; CHECK_FOR_ERROR ; break;} case 245: #line 2392 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { CurFun.CurrentFunction->setLinkage(yyvsp[-2].Linkage); CurFun.CurrentFunction->setVisibility(yyvsp[-1].Visibility); yyval.FunctionVal = CurFun.CurrentFunction; CurFun.FunctionDone(); CHECK_FOR_ERROR ; break;} case 246: #line 2404 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.BoolVal = false; CHECK_FOR_ERROR ; break;} case 247: #line 2408 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.BoolVal = true; CHECK_FOR_ERROR ; break;} case 248: #line 2413 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // A reference to a direct constant yyval.ValIDVal = ValID::create(yyvsp[0].SInt64Val); CHECK_FOR_ERROR ; break;} case 249: #line 2417 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ValIDVal = ValID::create(yyvsp[0].UInt64Val); CHECK_FOR_ERROR ; break;} case 250: #line 2421 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // Perhaps it's an FP constant? yyval.ValIDVal = ValID::create(yyvsp[0].FPVal); CHECK_FOR_ERROR ; break;} case 251: #line 2425 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ValIDVal = ValID::create(ConstantInt::getTrue()); CHECK_FOR_ERROR ; break;} case 252: #line 2429 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ValIDVal = ValID::create(ConstantInt::getFalse()); CHECK_FOR_ERROR ; break;} case 253: #line 2433 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ValIDVal = ValID::createNull(); CHECK_FOR_ERROR ; break;} case 254: #line 2437 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ValIDVal = ValID::createUndef(); CHECK_FOR_ERROR ; break;} case 255: #line 2441 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // A vector zero constant. yyval.ValIDVal = ValID::createZeroInit(); CHECK_FOR_ERROR ; break;} case 256: #line 2445 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // Nonempty unsized packed vector const Type *ETy = (*yyvsp[-1].ConstVector)[0]->getType(); int NumElements = yyvsp[-1].ConstVector->size(); VectorType* pt = VectorType::get(ETy, NumElements); PATypeHolder* PTy = new PATypeHolder( HandleUpRefs( VectorType::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()) GEN_ERROR("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(ConstantVector::get(pt, *yyvsp[-1].ConstVector)); delete PTy; delete yyvsp[-1].ConstVector; CHECK_FOR_ERROR ; break;} case 257: #line 2470 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ValIDVal = ValID::create(yyvsp[0].ConstVal); CHECK_FOR_ERROR ; break;} case 258: #line 2474 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ValIDVal = ValID::createInlineAsm(*yyvsp[-2].StrVal, *yyvsp[0].StrVal, yyvsp[-3].BoolVal); delete yyvsp[-2].StrVal; delete yyvsp[0].StrVal; CHECK_FOR_ERROR ; break;} case 259: #line 2484 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // Is it an integer reference...? yyval.ValIDVal = ValID::createLocalID(yyvsp[0].UIntVal); CHECK_FOR_ERROR ; break;} case 260: #line 2488 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ValIDVal = ValID::createGlobalID(yyvsp[0].UIntVal); CHECK_FOR_ERROR ; break;} case 261: #line 2492 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // Is it a named reference...? yyval.ValIDVal = ValID::createLocalName(*yyvsp[0].StrVal); delete yyvsp[0].StrVal; CHECK_FOR_ERROR ; break;} case 262: #line 2497 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // Is it a named reference...? yyval.ValIDVal = ValID::createGlobalName(*yyvsp[0].StrVal); delete yyvsp[0].StrVal; CHECK_FOR_ERROR ; break;} case 265: #line 2510 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!UpRefs.empty()) GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription()); yyval.ValueVal = getVal(*yyvsp[-1].TypeVal, yyvsp[0].ValIDVal); delete yyvsp[-1].TypeVal; CHECK_FOR_ERROR ; break;} case 266: #line 2519 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.FunctionVal = yyvsp[-1].FunctionVal; CHECK_FOR_ERROR ; break;} case 267: #line 2523 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // Do not allow functions with 0 basic blocks yyval.FunctionVal = yyvsp[-1].FunctionVal; CHECK_FOR_ERROR ; break;} case 268: #line 2532 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { setValueName(yyvsp[0].TermInstVal, yyvsp[-1].StrVal); CHECK_FOR_ERROR InsertValue(yyvsp[0].TermInstVal); yyvsp[-2].BasicBlockVal->getInstList().push_back(yyvsp[0].TermInstVal); yyval.BasicBlockVal = yyvsp[-2].BasicBlockVal; CHECK_FOR_ERROR ; break;} case 269: #line 2541 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (CastInst *CI1 = dyn_cast(yyvsp[0].InstVal)) if (CastInst *CI2 = dyn_cast(CI1->getOperand(0))) if (CI2->getParent() == 0) yyvsp[-1].BasicBlockVal->getInstList().push_back(CI2); yyvsp[-1].BasicBlockVal->getInstList().push_back(yyvsp[0].InstVal); yyval.BasicBlockVal = yyvsp[-1].BasicBlockVal; CHECK_FOR_ERROR ; break;} case 270: #line 2550 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // Empty space between instruction lists yyval.BasicBlockVal = defineBBVal(ValID::createLocalID(CurFun.NextValNum)); CHECK_FOR_ERROR ; break;} case 271: #line 2554 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // Labelled (named) basic block yyval.BasicBlockVal = defineBBVal(ValID::createLocalName(*yyvsp[0].StrVal)); delete yyvsp[0].StrVal; CHECK_FOR_ERROR ; break;} case 272: #line 2561 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // Return with a result... yyval.TermInstVal = new ReturnInst(yyvsp[0].ValueVal); CHECK_FOR_ERROR ; break;} case 273: #line 2565 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // Return with no result... yyval.TermInstVal = new ReturnInst(); CHECK_FOR_ERROR ; break;} case 274: #line 2569 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // Unconditional Branch... BasicBlock* tmpBB = getBBVal(yyvsp[0].ValIDVal); CHECK_FOR_ERROR yyval.TermInstVal = new BranchInst(tmpBB); ; break;} case 275: #line 2574 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { assert(cast(yyvsp[-7].PrimType)->getBitWidth() == 1 && "Not Bool?"); BasicBlock* tmpBBA = getBBVal(yyvsp[-3].ValIDVal); CHECK_FOR_ERROR BasicBlock* tmpBBB = getBBVal(yyvsp[0].ValIDVal); CHECK_FOR_ERROR Value* tmpVal = getVal(Type::Int1Ty, yyvsp[-6].ValIDVal); CHECK_FOR_ERROR yyval.TermInstVal = new BranchInst(tmpBBA, tmpBBB, tmpVal); ; break;} case 276: #line 2584 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { Value* tmpVal = getVal(yyvsp[-7].PrimType, yyvsp[-6].ValIDVal); CHECK_FOR_ERROR BasicBlock* tmpBB = getBBVal(yyvsp[-3].ValIDVal); CHECK_FOR_ERROR SwitchInst *S = new SwitchInst(tmpVal, tmpBB, yyvsp[-1].JumpTable->size()); yyval.TermInstVal = S; std::vector >::iterator I = yyvsp[-1].JumpTable->begin(), E = yyvsp[-1].JumpTable->end(); for (; I != E; ++I) { if (ConstantInt *CI = dyn_cast(I->first)) S->addCase(CI, I->second); else GEN_ERROR("Switch case is constant, but not a simple integer"); } delete yyvsp[-1].JumpTable; CHECK_FOR_ERROR ; break;} case 277: #line 2603 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { Value* tmpVal = getVal(yyvsp[-6].PrimType, yyvsp[-5].ValIDVal); CHECK_FOR_ERROR BasicBlock* tmpBB = getBBVal(yyvsp[-2].ValIDVal); CHECK_FOR_ERROR SwitchInst *S = new SwitchInst(tmpVal, tmpBB, 0); yyval.TermInstVal = S; CHECK_FOR_ERROR ; break;} case 278: #line 2613 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // Handle the short syntax const PointerType *PFTy = 0; const FunctionType *Ty = 0; if (!(PFTy = dyn_cast(yyvsp[-11].TypeVal->get())) || !(Ty = dyn_cast(PFTy->getElementType()))) { // Pull out the types of all of the arguments... std::vector ParamTypes; ParamList::iterator I = yyvsp[-8].ParamList->begin(), E = yyvsp[-8].ParamList->end(); for (; I != E; ++I) { const Type *Ty = I->Val->getType(); if (Ty == Type::VoidTy) GEN_ERROR("Short call syntax cannot be used with varargs"); ParamTypes.push_back(Ty); } Ty = FunctionType::get(yyvsp[-11].TypeVal->get(), ParamTypes, false); PFTy = PointerType::getUnqual(Ty); } delete yyvsp[-11].TypeVal; Value *V = getVal(PFTy, yyvsp[-10].ValIDVal); // Get the function we're calling... CHECK_FOR_ERROR BasicBlock *Normal = getBBVal(yyvsp[-3].ValIDVal); CHECK_FOR_ERROR BasicBlock *Except = getBBVal(yyvsp[0].ValIDVal); CHECK_FOR_ERROR ParamAttrsVector Attrs; if (yyvsp[-6].ParamAttrs != ParamAttr::None) { ParamAttrsWithIndex PAWI; PAWI.index = 0; PAWI.attrs = yyvsp[-6].ParamAttrs; Attrs.push_back(PAWI); } // Check the arguments ValueList Args; if (yyvsp[-8].ParamList->empty()) { // Has no arguments? // Make sure no arguments is a good thing! if (Ty->getNumParams() != 0) GEN_ERROR("No arguments passed to a function that " "expects arguments"); } 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(); ParamList::iterator ArgI = yyvsp[-8].ParamList->begin(), ArgE = yyvsp[-8].ParamList->end(); unsigned index = 1; for (; ArgI != ArgE && I != E; ++ArgI, ++I, ++index) { if (ArgI->Val->getType() != *I) GEN_ERROR("Parameter " + ArgI->Val->getName()+ " is not of type '" + (*I)->getDescription() + "'"); Args.push_back(ArgI->Val); if (ArgI->Attrs != ParamAttr::None) { ParamAttrsWithIndex PAWI; PAWI.index = index; PAWI.attrs = ArgI->Attrs; Attrs.push_back(PAWI); } } if (Ty->isVarArg()) { if (I == E) for (; ArgI != ArgE; ++ArgI) Args.push_back(ArgI->Val); // push the remaining varargs } else if (I != E || ArgI != ArgE) GEN_ERROR("Invalid number of parameters detected"); } const ParamAttrsList *PAL = 0; if (!Attrs.empty()) PAL = ParamAttrsList::get(Attrs); // Create the InvokeInst InvokeInst *II = new InvokeInst(V, Normal, Except, Args.begin(), Args.end()); II->setCallingConv(yyvsp[-12].UIntVal); II->setParamAttrs(PAL); yyval.TermInstVal = II; delete yyvsp[-8].ParamList; CHECK_FOR_ERROR ; break;} case 279: #line 2696 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.TermInstVal = new UnwindInst(); CHECK_FOR_ERROR ; break;} case 280: #line 2700 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.TermInstVal = new UnreachableInst(); CHECK_FOR_ERROR ; break;} case 281: #line 2707 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.JumpTable = yyvsp[-5].JumpTable; Constant *V = cast(getExistingVal(yyvsp[-4].PrimType, yyvsp[-3].ValIDVal)); CHECK_FOR_ERROR if (V == 0) GEN_ERROR("May only switch on a constant pool value"); BasicBlock* tmpBB = getBBVal(yyvsp[0].ValIDVal); CHECK_FOR_ERROR yyval.JumpTable->push_back(std::make_pair(V, tmpBB)); ; break;} case 282: #line 2718 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.JumpTable = new std::vector >(); Constant *V = cast(getExistingVal(yyvsp[-4].PrimType, yyvsp[-3].ValIDVal)); CHECK_FOR_ERROR if (V == 0) GEN_ERROR("May only switch on a constant pool value"); BasicBlock* tmpBB = getBBVal(yyvsp[0].ValIDVal); CHECK_FOR_ERROR yyval.JumpTable->push_back(std::make_pair(V, tmpBB)); ; break;} case 283: #line 2731 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // Is this definition named?? if so, assign the name... setValueName(yyvsp[0].InstVal, yyvsp[-1].StrVal); CHECK_FOR_ERROR InsertValue(yyvsp[0].InstVal); yyval.InstVal = yyvsp[0].InstVal; CHECK_FOR_ERROR ; break;} case 284: #line 2741 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // Used for PHI nodes if (!UpRefs.empty()) GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-5].TypeVal)->getDescription()); yyval.PHIList = new std::list >(); Value* tmpVal = getVal(*yyvsp[-5].TypeVal, yyvsp[-3].ValIDVal); CHECK_FOR_ERROR BasicBlock* tmpBB = getBBVal(yyvsp[-1].ValIDVal); CHECK_FOR_ERROR yyval.PHIList->push_back(std::make_pair(tmpVal, tmpBB)); delete yyvsp[-5].TypeVal; ; break;} case 285: #line 2752 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.PHIList = yyvsp[-6].PHIList; Value* tmpVal = getVal(yyvsp[-6].PHIList->front().first->getType(), yyvsp[-3].ValIDVal); CHECK_FOR_ERROR BasicBlock* tmpBB = getBBVal(yyvsp[-1].ValIDVal); CHECK_FOR_ERROR yyvsp[-6].PHIList->push_back(std::make_pair(tmpVal, tmpBB)); ; break;} case 286: #line 2762 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // FIXME: Remove trailing OptParamAttrs in LLVM 3.0, it was a mistake in 2.0 if (!UpRefs.empty()) GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-3].TypeVal)->getDescription()); // Used for call and invoke instructions yyval.ParamList = new ParamList(); ParamListEntry E; E.Attrs = yyvsp[-2].ParamAttrs | yyvsp[0].ParamAttrs; E.Val = getVal(yyvsp[-3].TypeVal->get(), yyvsp[-1].ValIDVal); yyval.ParamList->push_back(E); delete yyvsp[-3].TypeVal; CHECK_FOR_ERROR ; break;} case 287: #line 2773 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // FIXME: Remove trailing OptParamAttrs in LLVM 3.0, it was a mistake in 2.0 // Labels are only valid in ASMs yyval.ParamList = new ParamList(); ParamListEntry E; E.Attrs = yyvsp[-2].ParamAttrs | yyvsp[0].ParamAttrs; E.Val = getBBVal(yyvsp[-1].ValIDVal); yyval.ParamList->push_back(E); CHECK_FOR_ERROR ; break;} case 288: #line 2781 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // FIXME: Remove trailing OptParamAttrs in LLVM 3.0, it was a mistake in 2.0 if (!UpRefs.empty()) GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-3].TypeVal)->getDescription()); yyval.ParamList = yyvsp[-5].ParamList; ParamListEntry E; E.Attrs = yyvsp[-2].ParamAttrs | yyvsp[0].ParamAttrs; E.Val = getVal(yyvsp[-3].TypeVal->get(), yyvsp[-1].ValIDVal); yyval.ParamList->push_back(E); delete yyvsp[-3].TypeVal; CHECK_FOR_ERROR ; break;} case 289: #line 2791 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // FIXME: Remove trailing OptParamAttrs in LLVM 3.0, it was a mistake in 2.0 yyval.ParamList = yyvsp[-5].ParamList; ParamListEntry E; E.Attrs = yyvsp[-2].ParamAttrs | yyvsp[0].ParamAttrs; E.Val = getBBVal(yyvsp[-1].ValIDVal); yyval.ParamList->push_back(E); CHECK_FOR_ERROR ; break;} case 290: #line 2798 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ParamList = new ParamList(); ; break;} case 291: #line 2801 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ValueList = new std::vector(); ; break;} case 292: #line 2802 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.ValueList = yyvsp[-2].ValueList; yyval.ValueList->push_back(yyvsp[0].ValueVal); CHECK_FOR_ERROR ; break;} case 293: #line 2809 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.BoolVal = true; CHECK_FOR_ERROR ; break;} case 294: #line 2813 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.BoolVal = false; CHECK_FOR_ERROR ; break;} case 295: #line 2818 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!UpRefs.empty()) GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-3].TypeVal)->getDescription()); if (!(*yyvsp[-3].TypeVal)->isInteger() && !(*yyvsp[-3].TypeVal)->isFloatingPoint() && !isa((*yyvsp[-3].TypeVal).get())) GEN_ERROR( "Arithmetic operator requires integer, FP, or packed operands"); Value* val1 = getVal(*yyvsp[-3].TypeVal, yyvsp[-2].ValIDVal); CHECK_FOR_ERROR Value* val2 = getVal(*yyvsp[-3].TypeVal, yyvsp[0].ValIDVal); CHECK_FOR_ERROR yyval.InstVal = BinaryOperator::create(yyvsp[-4].BinaryOpVal, val1, val2); if (yyval.InstVal == 0) GEN_ERROR("binary operator returned null"); delete yyvsp[-3].TypeVal; ; break;} case 296: #line 2834 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!UpRefs.empty()) GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-3].TypeVal)->getDescription()); if (!(*yyvsp[-3].TypeVal)->isInteger()) { if (Instruction::isShift(yyvsp[-4].BinaryOpVal) || !isa(yyvsp[-3].TypeVal->get()) || !cast(yyvsp[-3].TypeVal->get())->getElementType()->isInteger()) GEN_ERROR("Logical operator requires integral operands"); } Value* tmpVal1 = getVal(*yyvsp[-3].TypeVal, yyvsp[-2].ValIDVal); CHECK_FOR_ERROR Value* tmpVal2 = getVal(*yyvsp[-3].TypeVal, yyvsp[0].ValIDVal); CHECK_FOR_ERROR yyval.InstVal = BinaryOperator::create(yyvsp[-4].BinaryOpVal, tmpVal1, tmpVal2); if (yyval.InstVal == 0) GEN_ERROR("binary operator returned null"); delete yyvsp[-3].TypeVal; ; break;} case 297: #line 2851 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!UpRefs.empty()) GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-3].TypeVal)->getDescription()); if (isa((*yyvsp[-3].TypeVal).get())) GEN_ERROR("Vector types not supported by icmp instruction"); Value* tmpVal1 = getVal(*yyvsp[-3].TypeVal, yyvsp[-2].ValIDVal); CHECK_FOR_ERROR Value* tmpVal2 = getVal(*yyvsp[-3].TypeVal, yyvsp[0].ValIDVal); CHECK_FOR_ERROR yyval.InstVal = CmpInst::create(yyvsp[-5].OtherOpVal, yyvsp[-4].IPredicate, tmpVal1, tmpVal2); if (yyval.InstVal == 0) GEN_ERROR("icmp operator returned null"); delete yyvsp[-3].TypeVal; ; break;} case 298: #line 2865 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!UpRefs.empty()) GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-3].TypeVal)->getDescription()); if (isa((*yyvsp[-3].TypeVal).get())) GEN_ERROR("Vector types not supported by fcmp instruction"); Value* tmpVal1 = getVal(*yyvsp[-3].TypeVal, yyvsp[-2].ValIDVal); CHECK_FOR_ERROR Value* tmpVal2 = getVal(*yyvsp[-3].TypeVal, yyvsp[0].ValIDVal); CHECK_FOR_ERROR yyval.InstVal = CmpInst::create(yyvsp[-5].OtherOpVal, yyvsp[-4].FPredicate, tmpVal1, tmpVal2); if (yyval.InstVal == 0) GEN_ERROR("fcmp operator returned null"); delete yyvsp[-3].TypeVal; ; break;} case 299: #line 2879 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!UpRefs.empty()) GEN_ERROR("Invalid upreference in type: " + (*yyvsp[0].TypeVal)->getDescription()); Value* Val = yyvsp[-2].ValueVal; const Type* DestTy = yyvsp[0].TypeVal->get(); if (!CastInst::castIsValid(yyvsp[-3].CastOpVal, Val, DestTy)) GEN_ERROR("invalid cast opcode for cast from '" + Val->getType()->getDescription() + "' to '" + DestTy->getDescription() + "'"); yyval.InstVal = CastInst::create(yyvsp[-3].CastOpVal, Val, DestTy); delete yyvsp[0].TypeVal; ; break;} case 300: #line 2891 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (yyvsp[-4].ValueVal->getType() != Type::Int1Ty) GEN_ERROR("select condition must be boolean"); if (yyvsp[-2].ValueVal->getType() != yyvsp[0].ValueVal->getType()) GEN_ERROR("select value types should match"); yyval.InstVal = new SelectInst(yyvsp[-4].ValueVal, yyvsp[-2].ValueVal, yyvsp[0].ValueVal); CHECK_FOR_ERROR ; break;} case 301: #line 2899 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!UpRefs.empty()) GEN_ERROR("Invalid upreference in type: " + (*yyvsp[0].TypeVal)->getDescription()); yyval.InstVal = new VAArgInst(yyvsp[-2].ValueVal, *yyvsp[0].TypeVal); delete yyvsp[0].TypeVal; CHECK_FOR_ERROR ; break;} case 302: #line 2906 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!ExtractElementInst::isValidOperands(yyvsp[-2].ValueVal, yyvsp[0].ValueVal)) GEN_ERROR("Invalid extractelement operands"); yyval.InstVal = new ExtractElementInst(yyvsp[-2].ValueVal, yyvsp[0].ValueVal); CHECK_FOR_ERROR ; break;} case 303: #line 2912 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!InsertElementInst::isValidOperands(yyvsp[-4].ValueVal, yyvsp[-2].ValueVal, yyvsp[0].ValueVal)) GEN_ERROR("Invalid insertelement operands"); yyval.InstVal = new InsertElementInst(yyvsp[-4].ValueVal, yyvsp[-2].ValueVal, yyvsp[0].ValueVal); CHECK_FOR_ERROR ; break;} case 304: #line 2918 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!ShuffleVectorInst::isValidOperands(yyvsp[-4].ValueVal, yyvsp[-2].ValueVal, yyvsp[0].ValueVal)) GEN_ERROR("Invalid shufflevector operands"); yyval.InstVal = new ShuffleVectorInst(yyvsp[-4].ValueVal, yyvsp[-2].ValueVal, yyvsp[0].ValueVal); CHECK_FOR_ERROR ; break;} case 305: #line 2924 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { const Type *Ty = yyvsp[0].PHIList->front().first->getType(); if (!Ty->isFirstClassType()) GEN_ERROR("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) GEN_ERROR("All elements of a PHI node must be of the same type"); cast(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... CHECK_FOR_ERROR ; break;} case 306: #line 2940 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { // Handle the short syntax const PointerType *PFTy = 0; const FunctionType *Ty = 0; if (!(PFTy = dyn_cast(yyvsp[-5].TypeVal->get())) || !(Ty = dyn_cast(PFTy->getElementType()))) { // Pull out the types of all of the arguments... std::vector ParamTypes; ParamList::iterator I = yyvsp[-2].ParamList->begin(), E = yyvsp[-2].ParamList->end(); for (; I != E; ++I) { const Type *Ty = I->Val->getType(); if (Ty == Type::VoidTy) GEN_ERROR("Short call syntax cannot be used with varargs"); ParamTypes.push_back(Ty); } Ty = FunctionType::get(yyvsp[-5].TypeVal->get(), ParamTypes, false); PFTy = PointerType::getUnqual(Ty); } Value *V = getVal(PFTy, yyvsp[-4].ValIDVal); // Get the function we're calling... CHECK_FOR_ERROR // Check for call to invalid intrinsic to avoid crashing later. if (Function *theF = dyn_cast(V)) { if (theF->hasName() && (theF->getValueName()->getKeyLength() >= 5) && (0 == strncmp(theF->getValueName()->getKeyData(), "llvm.", 5)) && !theF->getIntrinsicID(true)) GEN_ERROR("Call to invalid LLVM intrinsic function '" + theF->getName() + "'"); } // Set up the ParamAttrs for the function ParamAttrsVector Attrs; if (yyvsp[0].ParamAttrs != ParamAttr::None) { ParamAttrsWithIndex PAWI; PAWI.index = 0; PAWI.attrs = yyvsp[0].ParamAttrs; Attrs.push_back(PAWI); } // Check the arguments ValueList Args; if (yyvsp[-2].ParamList->empty()) { // Has no arguments? // Make sure no arguments is a good thing! if (Ty->getNumParams() != 0) GEN_ERROR("No arguments passed to a function that " "expects arguments"); } else { // Has arguments? // Loop through FunctionType's arguments and ensure they are specified // correctly. Also, gather any parameter attributes. FunctionType::param_iterator I = Ty->param_begin(); FunctionType::param_iterator E = Ty->param_end(); ParamList::iterator ArgI = yyvsp[-2].ParamList->begin(), ArgE = yyvsp[-2].ParamList->end(); unsigned index = 1; for (; ArgI != ArgE && I != E; ++ArgI, ++I, ++index) { if (ArgI->Val->getType() != *I) GEN_ERROR("Parameter " + ArgI->Val->getName()+ " is not of type '" + (*I)->getDescription() + "'"); Args.push_back(ArgI->Val); if (ArgI->Attrs != ParamAttr::None) { ParamAttrsWithIndex PAWI; PAWI.index = index; PAWI.attrs = ArgI->Attrs; Attrs.push_back(PAWI); } } if (Ty->isVarArg()) { if (I == E) for (; ArgI != ArgE; ++ArgI) Args.push_back(ArgI->Val); // push the remaining varargs } else if (I != E || ArgI != ArgE) GEN_ERROR("Invalid number of parameters detected"); } // Finish off the ParamAttrs and check them const ParamAttrsList *PAL = 0; if (!Attrs.empty()) PAL = ParamAttrsList::get(Attrs); // Create the call node CallInst *CI = new CallInst(V, Args.begin(), Args.end()); CI->setTailCall(yyvsp[-7].BoolVal); CI->setCallingConv(yyvsp[-6].UIntVal); CI->setParamAttrs(PAL); yyval.InstVal = CI; delete yyvsp[-2].ParamList; delete yyvsp[-5].TypeVal; CHECK_FOR_ERROR ; break;} case 307: #line 3030 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.InstVal = yyvsp[0].InstVal; CHECK_FOR_ERROR ; break;} case 308: #line 3035 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.BoolVal = true; CHECK_FOR_ERROR ; break;} case 309: #line 3039 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { yyval.BoolVal = false; CHECK_FOR_ERROR ; break;} case 310: #line 3046 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!UpRefs.empty()) GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription()); yyval.InstVal = new MallocInst(*yyvsp[-1].TypeVal, 0, yyvsp[0].UIntVal); delete yyvsp[-1].TypeVal; CHECK_FOR_ERROR ; break;} case 311: #line 3053 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!UpRefs.empty()) GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-4].TypeVal)->getDescription()); Value* tmpVal = getVal(yyvsp[-2].PrimType, yyvsp[-1].ValIDVal); CHECK_FOR_ERROR yyval.InstVal = new MallocInst(*yyvsp[-4].TypeVal, tmpVal, yyvsp[0].UIntVal); delete yyvsp[-4].TypeVal; ; break;} case 312: #line 3061 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!UpRefs.empty()) GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription()); yyval.InstVal = new AllocaInst(*yyvsp[-1].TypeVal, 0, yyvsp[0].UIntVal); delete yyvsp[-1].TypeVal; CHECK_FOR_ERROR ; break;} case 313: #line 3068 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!UpRefs.empty()) GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-4].TypeVal)->getDescription()); Value* tmpVal = getVal(yyvsp[-2].PrimType, yyvsp[-1].ValIDVal); CHECK_FOR_ERROR yyval.InstVal = new AllocaInst(*yyvsp[-4].TypeVal, tmpVal, yyvsp[0].UIntVal); delete yyvsp[-4].TypeVal; ; break;} case 314: #line 3076 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!isa(yyvsp[0].ValueVal->getType())) GEN_ERROR("Trying to free nonpointer type " + yyvsp[0].ValueVal->getType()->getDescription() + ""); yyval.InstVal = new FreeInst(yyvsp[0].ValueVal); CHECK_FOR_ERROR ; break;} case 315: #line 3084 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!UpRefs.empty()) GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-2].TypeVal)->getDescription()); if (!isa(yyvsp[-2].TypeVal->get())) GEN_ERROR("Can't load from nonpointer type: " + (*yyvsp[-2].TypeVal)->getDescription()); if (!cast(yyvsp[-2].TypeVal->get())->getElementType()->isFirstClassType()) GEN_ERROR("Can't load from pointer of non-first-class type: " + (*yyvsp[-2].TypeVal)->getDescription()); Value* tmpVal = getVal(*yyvsp[-2].TypeVal, yyvsp[-1].ValIDVal); CHECK_FOR_ERROR yyval.InstVal = new LoadInst(tmpVal, "", yyvsp[-4].BoolVal, yyvsp[0].UIntVal); delete yyvsp[-2].TypeVal; ; break;} case 316: #line 3098 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!UpRefs.empty()) GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-2].TypeVal)->getDescription()); const PointerType *PT = dyn_cast(yyvsp[-2].TypeVal->get()); if (!PT) GEN_ERROR("Can't store to a nonpointer type: " + (*yyvsp[-2].TypeVal)->getDescription()); const Type *ElTy = PT->getElementType(); if (ElTy != yyvsp[-4].ValueVal->getType()) GEN_ERROR("Can't store '" + yyvsp[-4].ValueVal->getType()->getDescription() + "' into space of type '" + ElTy->getDescription() + "'"); Value* tmpVal = getVal(*yyvsp[-2].TypeVal, yyvsp[-1].ValIDVal); CHECK_FOR_ERROR yyval.InstVal = new StoreInst(yyvsp[-4].ValueVal, tmpVal, yyvsp[-6].BoolVal, yyvsp[0].UIntVal); delete yyvsp[-2].TypeVal; ; break;} case 317: #line 3115 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" { if (!UpRefs.empty()) GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-2].TypeVal)->getDescription()); if (!isa(yyvsp[-2].TypeVal->get())) GEN_ERROR("getelementptr insn requires pointer operand"); if (!GetElementPtrInst::getIndexedType(*yyvsp[-2].TypeVal, yyvsp[0].ValueList->begin(), yyvsp[0].ValueList->end(), true)) GEN_ERROR("Invalid getelementptr indices for type '" + (*yyvsp[-2].TypeVal)->getDescription()+ "'"); Value* tmpVal = getVal(*yyvsp[-2].TypeVal, yyvsp[-1].ValIDVal); CHECK_FOR_ERROR yyval.InstVal = new GetElementPtrInst(tmpVal, yyvsp[0].ValueList->begin(), yyvsp[0].ValueList->end()); 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 3132 "/Users/clamb/Documents/llvm/llvm/lib/AsmParser/llvmAsmParser.y" // common code from the two 'RunVMAsmParser' functions static Module* RunParser(Module * M) { CurModule.CurrentModule = M; // Check to make sure the parser succeeded if (yyparse()) { if (ParserResult) delete ParserResult; return 0; } // 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::LocalName) { GenerateError("Undefined type remains at eof: '"+DID.getName() + "'"); } else { GenerateError("Undefined type remains at eof: #" + itostr(DID.Num)); } if (ParserResult) delete ParserResult; return 0; } // Emit an error if there are any unresolved values left. if (!CurModule.LateResolveValues.empty()) { Value *V = CurModule.LateResolveValues.back(); std::map >::iterator I = CurModule.PlaceHolderInfo.find(V); if (I != CurModule.PlaceHolderInfo.end()) { ValID &DID = I->second.first; if (DID.Type == ValID::LocalName) { GenerateError("Undefined value remains at eof: "+DID.getName() + "'"); } else { GenerateError("Undefined value remains at eof: #" + itostr(DID.Num)); } if (ParserResult) delete ParserResult; return 0; } } // Check to make sure that parsing produced a result if (!ParserResult) return 0; // Reset ParserResult variable while saving its value for the result. Module *Result = ParserResult; ParserResult = 0; return Result; } void llvm::GenerateError(const std::string &message, int LineNo) { if (LineNo == -1) LineNo = LLLgetLineNo(); // TODO: column number in exception if (TheParseError) TheParseError->setError(LLLgetFilename(), message, LineNo); TriggerError = 1; } int yyerror(const char *ErrorMsg) { std::string where = LLLgetFilename() + ":" + utostr(LLLgetLineNo()) + ": "; std::string errMsg = where + "error: " + std::string(ErrorMsg); if (yychar != YYEMPTY && yychar != 0) { errMsg += " while reading token: '"; errMsg += std::string(LLLgetTokenStart(), LLLgetTokenStart()+LLLgetTokenLength()) + "'"; } GenerateError(errMsg); return 0; }