| /* A Bison parser, made by GNU Bison 2.1. */ |
| |
| /* Skeleton parser for Yacc-like parsing with Bison, |
| Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005 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., 51 Franklin Street, Fifth Floor, |
| Boston, MA 02110-1301, 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. */ |
| |
| /* Written by Richard Stallman by simplifying the original so called |
| ``semantic'' parser. */ |
| |
| /* All symbols defined below should begin with yy or YY, to avoid |
| infringing on user name space. This should be done even for local |
| variables, as they might otherwise be expanded by user macros. |
| There are some unavoidable exceptions within include files to |
| define necessary library symbols; they are noted "INFRINGES ON |
| USER NAME SPACE" below. */ |
| |
| /* Identify Bison output. */ |
| #define YYBISON 1 |
| |
| /* Bison version. */ |
| #define YYBISON_VERSION "2.1" |
| |
| /* Skeleton name. */ |
| #define YYSKELETON_NAME "yacc.c" |
| |
| /* Pure parsers. */ |
| #define YYPURE 0 |
| |
| /* Using locations. */ |
| #define YYLSP_NEEDED 0 |
| |
| /* Substitute the variable and function names. */ |
| #define yyparse llvmAsmparse |
| #define yylex llvmAsmlex |
| #define yyerror llvmAsmerror |
| #define yylval llvmAsmlval |
| #define yychar llvmAsmchar |
| #define yydebug llvmAsmdebug |
| #define yynerrs llvmAsmnerrs |
| |
| |
| /* Tokens. */ |
| #ifndef YYTOKENTYPE |
| # define YYTOKENTYPE |
| /* Put the tokens into the symbol table, so that GDB and other debuggers |
| know about them. */ |
| enum yytokentype { |
| ESINT64VAL = 258, |
| EUINT64VAL = 259, |
| SINTVAL = 260, |
| UINTVAL = 261, |
| FPVAL = 262, |
| VOID = 263, |
| BOOL = 264, |
| SBYTE = 265, |
| UBYTE = 266, |
| SHORT = 267, |
| USHORT = 268, |
| INT = 269, |
| UINT = 270, |
| LONG = 271, |
| ULONG = 272, |
| FLOAT = 273, |
| DOUBLE = 274, |
| TYPE = 275, |
| LABEL = 276, |
| VAR_ID = 277, |
| LABELSTR = 278, |
| STRINGCONSTANT = 279, |
| IMPLEMENTATION = 280, |
| ZEROINITIALIZER = 281, |
| TRUETOK = 282, |
| FALSETOK = 283, |
| BEGINTOK = 284, |
| ENDTOK = 285, |
| DECLARE = 286, |
| GLOBAL = 287, |
| CONSTANT = 288, |
| SECTION = 289, |
| VOLATILE = 290, |
| TO = 291, |
| DOTDOTDOT = 292, |
| NULL_TOK = 293, |
| UNDEF = 294, |
| CONST = 295, |
| INTERNAL = 296, |
| LINKONCE = 297, |
| WEAK = 298, |
| APPENDING = 299, |
| DLLIMPORT = 300, |
| DLLEXPORT = 301, |
| EXTERN_WEAK = 302, |
| OPAQUE = 303, |
| NOT = 304, |
| EXTERNAL = 305, |
| TARGET = 306, |
| TRIPLE = 307, |
| ENDIAN = 308, |
| POINTERSIZE = 309, |
| LITTLE = 310, |
| BIG = 311, |
| ALIGN = 312, |
| DEPLIBS = 313, |
| CALL = 314, |
| TAIL = 315, |
| ASM_TOK = 316, |
| MODULE = 317, |
| SIDEEFFECT = 318, |
| CC_TOK = 319, |
| CCC_TOK = 320, |
| CSRETCC_TOK = 321, |
| FASTCC_TOK = 322, |
| COLDCC_TOK = 323, |
| X86_STDCALLCC_TOK = 324, |
| X86_FASTCALLCC_TOK = 325, |
| DATALAYOUT = 326, |
| RET = 327, |
| BR = 328, |
| SWITCH = 329, |
| INVOKE = 330, |
| UNWIND = 331, |
| UNREACHABLE = 332, |
| ADD = 333, |
| SUB = 334, |
| MUL = 335, |
| UDIV = 336, |
| SDIV = 337, |
| FDIV = 338, |
| REM = 339, |
| AND = 340, |
| OR = 341, |
| XOR = 342, |
| SETLE = 343, |
| SETGE = 344, |
| SETLT = 345, |
| SETGT = 346, |
| SETEQ = 347, |
| SETNE = 348, |
| MALLOC = 349, |
| ALLOCA = 350, |
| FREE = 351, |
| LOAD = 352, |
| STORE = 353, |
| GETELEMENTPTR = 354, |
| PHI_TOK = 355, |
| CAST = 356, |
| SELECT = 357, |
| SHL = 358, |
| SHR = 359, |
| VAARG = 360, |
| EXTRACTELEMENT = 361, |
| INSERTELEMENT = 362, |
| SHUFFLEVECTOR = 363, |
| VAARG_old = 364, |
| VANEXT_old = 365 |
| }; |
| #endif |
| /* Tokens. */ |
| #define ESINT64VAL 258 |
| #define EUINT64VAL 259 |
| #define SINTVAL 260 |
| #define UINTVAL 261 |
| #define FPVAL 262 |
| #define VOID 263 |
| #define BOOL 264 |
| #define SBYTE 265 |
| #define UBYTE 266 |
| #define SHORT 267 |
| #define USHORT 268 |
| #define INT 269 |
| #define UINT 270 |
| #define LONG 271 |
| #define ULONG 272 |
| #define FLOAT 273 |
| #define DOUBLE 274 |
| #define TYPE 275 |
| #define LABEL 276 |
| #define VAR_ID 277 |
| #define LABELSTR 278 |
| #define STRINGCONSTANT 279 |
| #define IMPLEMENTATION 280 |
| #define ZEROINITIALIZER 281 |
| #define TRUETOK 282 |
| #define FALSETOK 283 |
| #define BEGINTOK 284 |
| #define ENDTOK 285 |
| #define DECLARE 286 |
| #define GLOBAL 287 |
| #define CONSTANT 288 |
| #define SECTION 289 |
| #define VOLATILE 290 |
| #define TO 291 |
| #define DOTDOTDOT 292 |
| #define NULL_TOK 293 |
| #define UNDEF 294 |
| #define CONST 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 NOT 304 |
| #define EXTERNAL 305 |
| #define TARGET 306 |
| #define TRIPLE 307 |
| #define ENDIAN 308 |
| #define POINTERSIZE 309 |
| #define LITTLE 310 |
| #define BIG 311 |
| #define ALIGN 312 |
| #define DEPLIBS 313 |
| #define CALL 314 |
| #define TAIL 315 |
| #define ASM_TOK 316 |
| #define MODULE 317 |
| #define SIDEEFFECT 318 |
| #define CC_TOK 319 |
| #define CCC_TOK 320 |
| #define CSRETCC_TOK 321 |
| #define FASTCC_TOK 322 |
| #define COLDCC_TOK 323 |
| #define X86_STDCALLCC_TOK 324 |
| #define X86_FASTCALLCC_TOK 325 |
| #define DATALAYOUT 326 |
| #define RET 327 |
| #define BR 328 |
| #define SWITCH 329 |
| #define INVOKE 330 |
| #define UNWIND 331 |
| #define UNREACHABLE 332 |
| #define ADD 333 |
| #define SUB 334 |
| #define MUL 335 |
| #define UDIV 336 |
| #define SDIV 337 |
| #define FDIV 338 |
| #define REM 339 |
| #define AND 340 |
| #define OR 341 |
| #define XOR 342 |
| #define SETLE 343 |
| #define SETGE 344 |
| #define SETLT 345 |
| #define SETGT 346 |
| #define SETEQ 347 |
| #define SETNE 348 |
| #define MALLOC 349 |
| #define ALLOCA 350 |
| #define FREE 351 |
| #define LOAD 352 |
| #define STORE 353 |
| #define GETELEMENTPTR 354 |
| #define PHI_TOK 355 |
| #define CAST 356 |
| #define SELECT 357 |
| #define SHL 358 |
| #define SHR 359 |
| #define VAARG 360 |
| #define EXTRACTELEMENT 361 |
| #define INSERTELEMENT 362 |
| #define SHUFFLEVECTOR 363 |
| #define VAARG_old 364 |
| #define VANEXT_old 365 |
| |
| |
| |
| |
| /* Copy the first part of user declarations. */ |
| #line 14 "/proj/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/SymbolTable.h" |
| #include "llvm/Assembly/AutoUpgrade.h" |
| #include "llvm/Support/GetElementPtrTypeIterator.h" |
| #include "llvm/ADT/STLExtras.h" |
| #include "llvm/Support/MathExtras.h" |
| #include <algorithm> |
| #include <iostream> |
| #include <list> |
| #include <utility> |
| |
| // 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(); |
| |
| namespace llvm { |
| std::string CurFilename; |
| } |
| using namespace llvm; |
| |
| static Module *ParserResult; |
| |
| // DEBUG_UPREFS - Define this symbol if you want to enable debugging output |
| // relating to upreferences in the input stream. |
| // |
| //#define DEBUG_UPREFS 1 |
| #ifdef DEBUG_UPREFS |
| #define UR_OUT(X) std::cerr << X |
| #else |
| #define UR_OUT(X) |
| #endif |
| |
| #define YYERROR_VERBOSE 1 |
| |
| static bool ObsoleteVarArgs; |
| static bool NewVarArgs; |
| static BasicBlock *CurBB; |
| static GlobalVariable *CurGV; |
| |
| |
| // This contains info used when building the body of a function. It is |
| // destroyed when the function is completed. |
| // |
| typedef std::vector<Value *> ValueList; // Numbered defs |
| static void |
| ResolveDefinitions(std::map<const Type *,ValueList> &LateResolvers, |
| std::map<const Type *,ValueList> *FutureLateResolvers = 0); |
| |
| static struct PerModuleInfo { |
| Module *CurrentModule; |
| std::map<const Type *, ValueList> Values; // Module level numbered definitions |
| std::map<const Type *,ValueList> LateResolveValues; |
| std::vector<PATypeHolder> Types; |
| std::map<ValID, PATypeHolder> LateResolveTypes; |
| |
| /// PlaceHolderInfo - When temporary placeholder objects are created, remember |
| /// how they were referenced and on which line of the input they came from so |
| /// that we can resolve them later and print error messages as appropriate. |
| std::map<Value*, std::pair<ValID, int> > PlaceHolderInfo; |
| |
| // GlobalRefs - This maintains a mapping between <Type, ValID>'s and forward |
| // references to global values. Global values may be referenced before they |
| // are defined, and if so, the temporary object that they represent is held |
| // here. This is used for forward references of GlobalValues. |
| // |
| typedef std::map<std::pair<const PointerType *, |
| ValID>, GlobalValue*> GlobalRefsType; |
| GlobalRefsType GlobalRefs; |
| |
| void ModuleDone() { |
| // If we could not resolve some functions at function compilation time |
| // (calls to functions before they are defined), resolve them now... Types |
| // are resolved when the constant pool has been completely parsed. |
| // |
| ResolveDefinitions(LateResolveValues); |
| 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++); |
| |
| Values.clear(); // Clear out function local definitions |
| Types.clear(); |
| CurrentModule = 0; |
| } |
| |
| // GetForwardRefForGlobal - Check to see if there is a forward reference |
| // for this global. If so, remove it from the GlobalRefs map and return it. |
| // If not, just return null. |
| GlobalValue *GetForwardRefForGlobal(const PointerType *PTy, ValID ID) { |
| // Check to see if there is a forward reference to this global variable... |
| // if there is, eliminate it and patch the reference to use the new def'n. |
| GlobalRefsType::iterator I = GlobalRefs.find(std::make_pair(PTy, ID)); |
| GlobalValue *Ret = 0; |
| if (I != GlobalRefs.end()) { |
| Ret = I->second; |
| GlobalRefs.erase(I); |
| } |
| return Ret; |
| } |
| } CurModule; |
| |
| static struct PerFunctionInfo { |
| Function *CurrentFunction; // Pointer to current function being created |
| |
| std::map<const Type*, ValueList> Values; // Keep track of #'d definitions |
| std::map<const Type*, ValueList> LateResolveValues; |
| bool isDeclare; // Is this function a forward declararation? |
| GlobalValue::LinkageTypes Linkage; // Linkage for forward declaration. |
| |
| /// BBForwardRefs - When we see forward references to basic blocks, keep |
| /// track of them here. |
| std::map<BasicBlock*, std::pair<ValID, int> > BBForwardRefs; |
| std::vector<BasicBlock*> NumberedBlocks; |
| unsigned NextBBNum; |
| |
| inline PerFunctionInfo() { |
| CurrentFunction = 0; |
| isDeclare = false; |
| Linkage = GlobalValue::ExternalLinkage; |
| } |
| |
| inline void FunctionStart(Function *M) { |
| CurrentFunction = M; |
| NextBBNum = 0; |
| } |
| |
| void FunctionDone() { |
| NumberedBlocks.clear(); |
| |
| // Any forward referenced blocks left? |
| if (!BBForwardRefs.empty()) { |
| GenerateError("Undefined reference to label " + |
| BBForwardRefs.begin()->first->getName()); |
| return; |
| } |
| |
| // Resolve all forward references now. |
| ResolveDefinitions(LateResolveValues, &CurModule.LateResolveValues); |
| |
| Values.clear(); // Clear out function local definitions |
| CurrentFunction = 0; |
| isDeclare = false; |
| Linkage = GlobalValue::ExternalLinkage; |
| } |
| } CurFun; // Info for the current function... |
| |
| static bool inFunctionScope() { return CurFun.CurrentFunction != 0; } |
| |
| |
| //===----------------------------------------------------------------------===// |
| // Code to handle definitions of all the types |
| //===----------------------------------------------------------------------===// |
| |
| static int InsertValue(Value *V, |
| std::map<const Type*,ValueList> &ValueTab = CurFun.Values) { |
| if (V->hasName()) return -1; // Is this a numbered definition? |
| |
| // Yes, insert the value into the value table... |
| ValueList &List = ValueTab[V->getType()]; |
| List.push_back(V); |
| return List.size()-1; |
| } |
| |
| static const Type *getTypeVal(const ValID &D, bool DoNotImprovise = false) { |
| switch (D.Type) { |
| case ValID::NumberVal: // Is it a numbered definition? |
| // Module constants occupy the lowest numbered slots... |
| if ((unsigned)D.Num < CurModule.Types.size()) |
| return CurModule.Types[(unsigned)D.Num]; |
| break; |
| case ValID::NameVal: // Is it a named definition? |
| if (const Type *N = CurModule.CurrentModule->getTypeByName(D.Name)) { |
| D.destroy(); // Free old strdup'd memory... |
| return N; |
| } |
| break; |
| default: |
| 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::NameVal) { |
| GenerateError("Reference to an undefined type: '" + D.getName() + "'"); |
| return 0; |
| } else { |
| GenerateError("Reference to an undefined type: #" + itostr(D.Num)); |
| return 0; |
| } |
| } |
| |
| std::map<ValID, PATypeHolder>::iterator I =CurModule.LateResolveTypes.find(D); |
| if (I != CurModule.LateResolveTypes.end()) |
| return I->second; |
| |
| Type *Typ = OpaqueType::get(); |
| CurModule.LateResolveTypes.insert(std::make_pair(D, Typ)); |
| return Typ; |
| } |
| |
| static Value *lookupInSymbolTable(const Type *Ty, const std::string &Name) { |
| SymbolTable &SymTab = |
| inFunctionScope() ? CurFun.CurrentFunction->getSymbolTable() : |
| CurModule.CurrentModule->getSymbolTable(); |
| return SymTab.lookup(Ty, Name); |
| } |
| |
| // getValNonImprovising - Look up the value specified by the provided type and |
| // the provided ValID. If the value exists and has already been defined, return |
| // it. Otherwise return null. |
| // |
| static Value *getValNonImprovising(const Type *Ty, const ValID &D) { |
| if (isa<FunctionType>(Ty)) { |
| GenerateError("Functions are not values and " |
| "must be referenced as pointers"); |
| return 0; |
| } |
| |
| switch (D.Type) { |
| case ValID::NumberVal: { // Is it a numbered definition? |
| unsigned Num = (unsigned)D.Num; |
| |
| // Module constants occupy the lowest numbered slots... |
| std::map<const Type*,ValueList>::iterator VI = CurModule.Values.find(Ty); |
| if (VI != CurModule.Values.end()) { |
| if (Num < VI->second.size()) |
| return VI->second[Num]; |
| Num -= VI->second.size(); |
| } |
| |
| // Make sure that our type is within bounds |
| VI = CurFun.Values.find(Ty); |
| if (VI == CurFun.Values.end()) return 0; |
| |
| // Check that the number is within bounds... |
| if (VI->second.size() <= Num) return 0; |
| |
| return VI->second[Num]; |
| } |
| |
| case ValID::NameVal: { // Is it a named definition? |
| Value *N = lookupInSymbolTable(Ty, std::string(D.Name)); |
| if (N == 0) return 0; |
| |
| D.destroy(); // Free old strdup'd memory... |
| return N; |
| } |
| |
| // Check to make sure that "Ty" is an integral type, and that our |
| // value will fit into the specified type... |
| case ValID::ConstSIntVal: // Is it a constant pool reference?? |
| if (!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); |
| |
| 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); |
| } |
| } 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; |
| } |
| return ConstantFP::get(Ty, D.ConstPoolFP); |
| |
| case ValID::ConstNullVal: // Is it a null value? |
| if (!isa<PointerType>(Ty)) { |
| GenerateError("Cannot create a a non pointer null!"); |
| return 0; |
| } |
| return ConstantPointerNull::get(cast<PointerType>(Ty)); |
| |
| case ValID::ConstUndefVal: // Is it an undef value? |
| return UndefValue::get(Ty); |
| |
| case ValID::ConstZeroVal: // Is it a zero value? |
| return Constant::getNullValue(Ty); |
| |
| case ValID::ConstantVal: // Fully resolved constant? |
| if (D.ConstantValue->getType() != Ty) { |
| GenerateError("Constant expression type different from required type!"); |
| return 0; |
| } |
| return D.ConstantValue; |
| |
| case ValID::InlineAsmVal: { // Inline asm expression |
| const PointerType *PTy = dyn_cast<PointerType>(Ty); |
| const FunctionType *FTy = |
| PTy ? dyn_cast<FunctionType>(PTy->getElementType()) : 0; |
| if (!FTy || !InlineAsm::Verify(FTy, D.IAD->Constraints)) { |
| 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 getValNonImprovising, except that if a |
| // value is not already defined, it "improvises" by creating a placeholder var |
| // that looks and acts just like the requested variable. When the value is |
| // defined later, all uses of the placeholder variable are replaced with the |
| // real thing. |
| // |
| static Value *getVal(const Type *Ty, const ValID &ID) { |
| if (Ty == Type::LabelTy) { |
| GenerateError("Cannot use a basic block here"); |
| return 0; |
| } |
| |
| // See if the value has already been defined. |
| Value *V = getValNonImprovising(Ty, ID); |
| if (V) return V; |
| if (TriggerError) return 0; |
| |
| if (!Ty->isFirstClassType() && !isa<OpaqueType>(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... |
| // |
| V = new Argument(Ty); |
| |
| // Remember where this forward reference came from. FIXME, shouldn't we try |
| // to recycle these things?? |
| CurModule.PlaceHolderInfo.insert(std::make_pair(V, std::make_pair(ID, |
| llvmAsmlineno))); |
| |
| if (inFunctionScope()) |
| InsertValue(V, CurFun.LateResolveValues); |
| else |
| InsertValue(V, CurModule.LateResolveValues); |
| return V; |
| } |
| |
| /// getBBVal - This is used for two purposes: |
| /// * If isDefinition is true, a new basic block with the specified ID is being |
| /// defined. |
| /// * If isDefinition is true, this is a reference to a basic block, which may |
| /// or may not be a forward reference. |
| /// |
| static BasicBlock *getBBVal(const ValID &ID, bool isDefinition = false) { |
| assert(inFunctionScope() && "Can't get basic block at global scope!"); |
| |
| std::string Name; |
| BasicBlock *BB = 0; |
| switch (ID.Type) { |
| default: |
| GenerateError("Illegal label reference " + ID.getName()); |
| return 0; |
| case ValID::NumberVal: // Is it a numbered definition? |
| if (unsigned(ID.Num) >= CurFun.NumberedBlocks.size()) |
| CurFun.NumberedBlocks.resize(ID.Num+1); |
| BB = CurFun.NumberedBlocks[ID.Num]; |
| break; |
| case ValID::NameVal: // Is it a named definition? |
| Name = ID.Name; |
| if (Value *N = CurFun.CurrentFunction-> |
| getSymbolTable().lookup(Type::LabelTy, Name)) |
| BB = cast<BasicBlock>(N); |
| break; |
| } |
| |
| // See if the block has already been defined. |
| if (BB) { |
| // If this is the definition of the block, make sure the existing value was |
| // just a forward reference. If it was a forward reference, there will be |
| // an entry for it in the PlaceHolderInfo map. |
| if (isDefinition && !CurFun.BBForwardRefs.erase(BB)) { |
| // The existing value was a definition, not a forward reference. |
| GenerateError("Redefinition of label " + ID.getName()); |
| return 0; |
| } |
| |
| ID.destroy(); // Free strdup'd memory. |
| return BB; |
| } |
| |
| // Otherwise this block has not been seen before. |
| BB = new BasicBlock("", CurFun.CurrentFunction); |
| if (ID.Type == ValID::NameVal) { |
| BB->setName(ID.Name); |
| } else { |
| CurFun.NumberedBlocks[ID.Num] = BB; |
| } |
| |
| // If this is not a definition, keep track of it so we can use it as a forward |
| // reference. |
| if (!isDefinition) { |
| // Remember where this forward reference came from. |
| CurFun.BBForwardRefs[BB] = std::make_pair(ID, llvmAsmlineno); |
| } else { |
| // The forward declaration could have been inserted anywhere in the |
| // function: insert it into the correct place now. |
| CurFun.CurrentFunction->getBasicBlockList().remove(BB); |
| CurFun.CurrentFunction->getBasicBlockList().push_back(BB); |
| } |
| ID.destroy(); |
| return BB; |
| } |
| |
| |
| //===----------------------------------------------------------------------===// |
| // Code to handle forward references in instructions |
| //===----------------------------------------------------------------------===// |
| // |
| // This code handles the late binding needed with statements that reference |
| // values not defined yet... for example, a forward branch, or the PHI node for |
| // a loop body. |
| // |
| // This keeps a table (CurFun.LateResolveValues) of all such forward references |
| // and back patchs after we are done. |
| // |
| |
| // ResolveDefinitions - If we could not resolve some defs at parsing |
| // time (forward branches, phi functions for loops, etc...) resolve the |
| // defs now... |
| // |
| static void |
| ResolveDefinitions(std::map<const Type*,ValueList> &LateResolvers, |
| std::map<const Type*,ValueList> *FutureLateResolvers) { |
| // Loop over LateResolveDefs fixing up stuff that couldn't be resolved |
| for (std::map<const Type*,ValueList>::iterator LRI = LateResolvers.begin(), |
| E = LateResolvers.end(); LRI != E; ++LRI) { |
| ValueList &List = LRI->second; |
| while (!List.empty()) { |
| Value *V = List.back(); |
| List.pop_back(); |
| |
| std::map<Value*, std::pair<ValID, int> >::iterator PHI = |
| CurModule.PlaceHolderInfo.find(V); |
| assert(PHI != CurModule.PlaceHolderInfo.end() && "Placeholder error!"); |
| |
| ValID &DID = PHI->second.first; |
| |
| Value *TheRealValue = getValNonImprovising(LRI->first, DID); |
| if (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::NameVal) { |
| 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(char *Name, const Type *ToTy) { |
| ValID D; |
| if (Name) D = ValID::create(Name); |
| else D = ValID::create((int)CurModule.Types.size()); |
| |
| std::map<ValID, PATypeHolder>::iterator I = |
| CurModule.LateResolveTypes.find(D); |
| if (I != CurModule.LateResolveTypes.end()) { |
| ((DerivedType*)I->second.get())->refineAbstractTypeTo(ToTy); |
| CurModule.LateResolveTypes.erase(I); |
| } |
| } |
| |
| // setValueName - Set the specified value to the name given. The name may be |
| // null potentially, in which case this is a noop. The string passed in is |
| // assumed to be a malloc'd string buffer, and is free'd by this function. |
| // |
| static void setValueName(Value *V, char *NameStr) { |
| if (NameStr) { |
| std::string Name(NameStr); // Copy string |
| free(NameStr); // Free old string |
| |
| if (V->getType() == Type::VoidTy) { |
| GenerateError("Can't assign name '" + Name+"' to value with void type!"); |
| return; |
| } |
| |
| assert(inFunctionScope() && "Must be in function scope!"); |
| SymbolTable &ST = CurFun.CurrentFunction->getSymbolTable(); |
| if (ST.lookup(V->getType(), Name)) { |
| GenerateError("Redefinition of value named '" + Name + "' in the '" + |
| V->getType()->getDescription() + "' type plane!"); |
| 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(char *NameStr,GlobalValue::LinkageTypes Linkage, |
| bool isConstantGlobal, const Type *Ty, |
| Constant *Initializer) { |
| if (isa<FunctionType>(Ty)) { |
| GenerateError("Cannot declare global vars of function type!"); |
| return 0; |
| } |
| |
| const PointerType *PTy = PointerType::get(Ty); |
| |
| std::string Name; |
| if (NameStr) { |
| Name = NameStr; // Copy string |
| free(NameStr); // Free old string |
| } |
| |
| // See if this global value was forward referenced. If so, recycle the |
| // object. |
| ValID ID; |
| if (!Name.empty()) { |
| ID = ValID::create((char*)Name.c_str()); |
| } else { |
| ID = ValID::create((int)CurModule.Values[PTy].size()); |
| } |
| |
| if (GlobalValue *FWGV = CurModule.GetForwardRefForGlobal(PTy, ID)) { |
| // Move the global to the end of the list, from whereever it was |
| // previously inserted. |
| GlobalVariable *GV = cast<GlobalVariable>(FWGV); |
| CurModule.CurrentModule->getGlobalList().remove(GV); |
| CurModule.CurrentModule->getGlobalList().push_back(GV); |
| GV->setInitializer(Initializer); |
| GV->setLinkage(Linkage); |
| GV->setConstant(isConstantGlobal); |
| InsertValue(GV, CurModule.Values); |
| return GV; |
| } |
| |
| // If this global has a name, check to see if there is already a definition |
| // of this global in the module. If so, merge as appropriate. Note that |
| // this is really just a hack around problems in the CFE. :( |
| if (!Name.empty()) { |
| // We are a simple redefinition of a value, check to see if it is defined |
| // the same as the old one. |
| if (GlobalVariable *EGV = |
| CurModule.CurrentModule->getGlobalVariable(Name, Ty)) { |
| // We are allowed to redefine a global variable in two circumstances: |
| // 1. If at least one of the globals is uninitialized or |
| // 2. If both initializers have the same value. |
| // |
| if (!EGV->hasInitializer() || !Initializer || |
| EGV->getInitializer() == Initializer) { |
| |
| // Make sure the existing global version gets the initializer! Make |
| // sure that it also gets marked const if the new version is. |
| if (Initializer && !EGV->hasInitializer()) |
| EGV->setInitializer(Initializer); |
| if (isConstantGlobal) |
| EGV->setConstant(true); |
| EGV->setLinkage(Linkage); |
| return EGV; |
| } |
| |
| GenerateError("Redefinition of global variable named '" + Name + |
| "' in the '" + Ty->getDescription() + "' type plane!"); |
| return 0; |
| } |
| } |
| |
| // Otherwise there is no existing GV to use, create one now. |
| GlobalVariable *GV = |
| new GlobalVariable(Ty, isConstantGlobal, Linkage, Initializer, Name, |
| CurModule.CurrentModule); |
| InsertValue(GV, CurModule.Values); |
| return GV; |
| } |
| |
| // setTypeName - Set the specified type to the name given. The name may be |
| // null potentially, in which case this is a noop. The string passed in is |
| // assumed to be a malloc'd string buffer, and is freed by this function. |
| // |
| // This function returns true if the type has already been defined, but is |
| // allowed to be redefined in the specified context. If the name is a new name |
| // for the type plane, it is inserted and false is returned. |
| static bool setTypeName(const Type *T, char *NameStr) { |
| assert(!inFunctionScope() && "Can't give types function-local names!"); |
| if (NameStr == 0) return false; |
| |
| std::string Name(NameStr); // Copy string |
| free(NameStr); // Free old string |
| |
| // We don't allow assigning names to void type |
| if (T == Type::VoidTy) { |
| 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<OpaqueType>(Existing)) { |
| // We ARE replacing an opaque type! |
| const_cast<OpaqueType*>(OpTy)->refineAbstractTypeTo(T); |
| return true; |
| } |
| |
| // Otherwise, this is an attempt to redefine a type. That's okay if |
| // the redefinition is identical to the original. This will be so if |
| // Existing and T point to the same Type object. In this one case we |
| // allow the equivalent redefinition. |
| if (Existing == T) return true; // Yes, it's equal. |
| |
| // Any other kind of (non-equivalent) redefinition is an error. |
| GenerateError("Redefinition of type named '" + Name + "' in the '" + |
| T->getDescription() + "' type plane!"); |
| } |
| |
| return false; |
| } |
| |
| //===----------------------------------------------------------------------===// |
| // Code for handling upreferences in type names... |
| // |
| |
| // TypeContains - Returns true if Ty directly contains E in it. |
| // |
| static bool TypeContains(const Type *Ty, const Type *E) { |
| return std::find(Ty->subtype_begin(), Ty->subtype_end(), |
| E) != Ty->subtype_end(); |
| } |
| |
| namespace { |
| struct UpRefRecord { |
| // NestingLevel - The number of nesting levels that need to be popped before |
| // this type is resolved. |
| unsigned NestingLevel; |
| |
| // LastContainedTy - This is the type at the current binding level for the |
| // type. Every time we reduce the nesting level, this gets updated. |
| const Type *LastContainedTy; |
| |
| // UpRefTy - This is the actual opaque type that the upreference is |
| // represented with. |
| OpaqueType *UpRefTy; |
| |
| UpRefRecord(unsigned NL, OpaqueType *URTy) |
| : NestingLevel(NL), LastContainedTy(URTy), UpRefTy(URTy) {} |
| }; |
| } |
| |
| // UpRefs - A list of the outstanding upreferences that need to be resolved. |
| static std::vector<UpRefRecord> UpRefs; |
| |
| /// HandleUpRefs - Every time we finish a new layer of types, this function is |
| /// called. It loops through the UpRefs vector, which is a list of the |
| /// currently active types. For each type, if the up reference is contained in |
| /// the newly completed type, we decrement the level count. When the level |
| /// count reaches zero, the upreferenced type is the type that is passed in: |
| /// thus we can complete the cycle. |
| /// |
| static PATypeHolder HandleUpRefs(const Type *ty) { |
| // If Ty 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; |
| } |
| |
| /// This function is used to obtain the correct opcode for an instruction when |
| /// an obsolete opcode is encountered. The OI parameter (OpcodeInfo) has both |
| /// an opcode and an "obsolete" flag. These are generated by the lexer and |
| /// the "obsolete" member will be true when the lexer encounters the token for |
| /// an obsolete opcode. For example, "div" was replaced by [usf]div but we need |
| /// to maintain backwards compatibility for asm files that still have the "div" |
| /// instruction. This function handles converting div -> [usf]div appropriately. |
| /// @brief Convert obsolete opcodes to new values |
| static void |
| sanitizeOpCode(OpcodeInfo<Instruction::BinaryOps> &OI, const PATypeHolder& PATy) |
| { |
| // If its not obsolete, don't do anything |
| if (!OI.obsolete) |
| return; |
| |
| // If its a packed type we want to use the element type |
| const Type* Ty = PATy; |
| if (const PackedType* PTy = dyn_cast<PackedType>(Ty)) |
| Ty = PTy->getElementType(); |
| |
| // Depending on the opcode .. |
| switch (OI.opcode) { |
| default: |
| GenerateError("Invalid Obsolete OpCode"); |
| break; |
| case Instruction::UDiv: |
| // Handle cases where the opcode needs to change |
| if (Ty->isFloatingPoint()) |
| OI.opcode = Instruction::FDiv; |
| else if (Ty->isSigned()) |
| OI.opcode = Instruction::SDiv; |
| break; |
| } |
| // Its not obsolete any more, we fixed it. |
| OI.obsolete = false; |
| } |
| |
| |
| // common code from the two 'RunVMAsmParser' functions |
| static Module* RunParser(Module * M) { |
| |
| llvmAsmlineno = 1; // Reset the current line number... |
| ObsoleteVarArgs = false; |
| NewVarArgs = false; |
| CurModule.CurrentModule = M; |
| |
| // Check to make sure the parser succeeded |
| if (yyparse()) { |
| 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; |
| |
| //Not all functions use vaarg, so make a second check for ObsoleteVarArgs |
| { |
| Function* F; |
| if ((F = Result->getNamedFunction("llvm.va_start")) |
| && F->getFunctionType()->getNumParams() == 0) |
| ObsoleteVarArgs = true; |
| if((F = Result->getNamedFunction("llvm.va_copy")) |
| && F->getFunctionType()->getNumParams() == 1) |
| ObsoleteVarArgs = true; |
| } |
| |
| if (ObsoleteVarArgs && NewVarArgs) { |
| GenerateError( |
| "This file is corrupt: it uses both new and old style varargs"); |
| return 0; |
| } |
| |
| if(ObsoleteVarArgs) { |
| if(Function* F = Result->getNamedFunction("llvm.va_start")) { |
| if (F->arg_size() != 0) { |
| GenerateError("Obsolete va_start takes 0 argument!"); |
| return 0; |
| } |
| |
| //foo = va_start() |
| // -> |
| //bar = alloca typeof(foo) |
| //va_start(bar) |
| //foo = load bar |
| |
| const Type* RetTy = Type::getPrimitiveType(Type::VoidTyID); |
| const Type* ArgTy = F->getFunctionType()->getReturnType(); |
| const Type* ArgTyPtr = PointerType::get(ArgTy); |
| Function* NF = Result->getOrInsertFunction("llvm.va_start", |
| RetTy, ArgTyPtr, (Type *)0); |
| |
| while (!F->use_empty()) { |
| CallInst* CI = cast<CallInst>(F->use_back()); |
| AllocaInst* bar = new AllocaInst(ArgTy, 0, "vastart.fix.1", CI); |
| new CallInst(NF, bar, "", CI); |
| Value* foo = new LoadInst(bar, "vastart.fix.2", CI); |
| CI->replaceAllUsesWith(foo); |
| CI->getParent()->getInstList().erase(CI); |
| } |
| Result->getFunctionList().erase(F); |
| } |
| |
| if(Function* F = Result->getNamedFunction("llvm.va_end")) { |
| if(F->arg_size() != 1) { |
| GenerateError("Obsolete va_end takes 1 argument!"); |
| return 0; |
| } |
| |
| //vaend foo |
| // -> |
| //bar = alloca 1 of typeof(foo) |
| //vaend bar |
| const Type* RetTy = Type::getPrimitiveType(Type::VoidTyID); |
| const Type* ArgTy = F->getFunctionType()->getParamType(0); |
| const Type* ArgTyPtr = PointerType::get(ArgTy); |
| Function* NF = Result->getOrInsertFunction("llvm.va_end", |
| RetTy, ArgTyPtr, (Type *)0); |
| |
| while (!F->use_empty()) { |
| CallInst* CI = cast<CallInst>(F->use_back()); |
| AllocaInst* bar = new AllocaInst(ArgTy, 0, "vaend.fix.1", CI); |
| new StoreInst(CI->getOperand(1), bar, CI); |
| new CallInst(NF, bar, "", CI); |
| CI->getParent()->getInstList().erase(CI); |
| } |
| Result->getFunctionList().erase(F); |
| } |
| |
| if(Function* F = Result->getNamedFunction("llvm.va_copy")) { |
| if(F->arg_size() != 1) { |
| GenerateError("Obsolete va_copy takes 1 argument!"); |
| return 0; |
| } |
| //foo = vacopy(bar) |
| // -> |
| //a = alloca 1 of typeof(foo) |
| //b = alloca 1 of typeof(foo) |
| //store bar -> b |
| //vacopy(a, b) |
| //foo = load a |
| |
| const Type* RetTy = Type::getPrimitiveType(Type::VoidTyID); |
| const Type* ArgTy = F->getFunctionType()->getReturnType(); |
| const Type* ArgTyPtr = PointerType::get(ArgTy); |
| Function* NF = Result->getOrInsertFunction("llvm.va_copy", |
| RetTy, ArgTyPtr, ArgTyPtr, |
| (Type *)0); |
| |
| while (!F->use_empty()) { |
| CallInst* CI = cast<CallInst>(F->use_back()); |
| AllocaInst* a = new AllocaInst(ArgTy, 0, "vacopy.fix.1", CI); |
| AllocaInst* b = new AllocaInst(ArgTy, 0, "vacopy.fix.2", CI); |
| new StoreInst(CI->getOperand(1), b, CI); |
| new CallInst(NF, a, b, "", CI); |
| Value* foo = new LoadInst(a, "vacopy.fix.3", CI); |
| CI->replaceAllUsesWith(foo); |
| CI->getParent()->getInstList().erase(CI); |
| } |
| Result->getFunctionList().erase(F); |
| } |
| } |
| |
| return Result; |
| } |
| |
| //===----------------------------------------------------------------------===// |
| // RunVMAsmParser - Define an interface to this parser |
| //===----------------------------------------------------------------------===// |
| // |
| Module *llvm::RunVMAsmParser(const std::string &Filename, FILE *F) { |
| set_scan_file(F); |
| |
| CurFilename = Filename; |
| return RunParser(new Module(CurFilename)); |
| } |
| |
| Module *llvm::RunVMAsmParser(const char * AsmString, Module * M) { |
| set_scan_string(AsmString); |
| |
| CurFilename = "from_memory"; |
| if (M == NULL) { |
| return RunParser(new Module (CurFilename)); |
| } else { |
| return RunParser(M); |
| } |
| } |
| |
| |
| |
| /* Enabling traces. */ |
| #ifndef YYDEBUG |
| # define YYDEBUG 0 |
| #endif |
| |
| /* Enabling verbose error messages. */ |
| #ifdef YYERROR_VERBOSE |
| # undef YYERROR_VERBOSE |
| # define YYERROR_VERBOSE 1 |
| #else |
| # define YYERROR_VERBOSE 0 |
| #endif |
| |
| /* Enabling the token table. */ |
| #ifndef YYTOKEN_TABLE |
| # define YYTOKEN_TABLE 0 |
| #endif |
| |
| #if ! defined (YYSTYPE) && ! defined (YYSTYPE_IS_DECLARED) |
| #line 1011 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| typedef union YYSTYPE { |
| llvm::Module *ModuleVal; |
| llvm::Function *FunctionVal; |
| std::pair<llvm::PATypeHolder*, char*> *ArgVal; |
| llvm::BasicBlock *BasicBlockVal; |
| llvm::TerminatorInst *TermInstVal; |
| llvm::Instruction *InstVal; |
| llvm::Constant *ConstVal; |
| |
| const llvm::Type *PrimType; |
| llvm::PATypeHolder *TypeVal; |
| llvm::Value *ValueVal; |
| |
| std::vector<std::pair<llvm::PATypeHolder*,char*> > *ArgList; |
| std::vector<llvm::Value*> *ValueList; |
| std::list<llvm::PATypeHolder> *TypeList; |
| // Represent the RHS of PHI node |
| std::list<std::pair<llvm::Value*, |
| llvm::BasicBlock*> > *PHIList; |
| std::vector<std::pair<llvm::Constant*, llvm::BasicBlock*> > *JumpTable; |
| std::vector<llvm::Constant*> *ConstVector; |
| |
| llvm::GlobalValue::LinkageTypes Linkage; |
| int64_t SInt64Val; |
| uint64_t UInt64Val; |
| int SIntVal; |
| unsigned UIntVal; |
| double FPVal; |
| bool BoolVal; |
| |
| char *StrVal; // This memory is strdup'd! |
| llvm::ValID ValIDVal; // strdup'd memory maybe! |
| |
| BinaryOpInfo BinaryOpVal; |
| TermOpInfo TermOpVal; |
| MemOpInfo MemOpVal; |
| OtherOpInfo OtherOpVal; |
| llvm::Module::Endianness Endianness; |
| } YYSTYPE; |
| /* Line 196 of yacc.c. */ |
| #line 1350 "llvmAsmParser.tab.c" |
| # define yystype YYSTYPE /* obsolescent; will be withdrawn */ |
| # define YYSTYPE_IS_DECLARED 1 |
| # define YYSTYPE_IS_TRIVIAL 1 |
| #endif |
| |
| |
| |
| /* Copy the second part of user declarations. */ |
| |
| |
| /* Line 219 of yacc.c. */ |
| #line 1362 "llvmAsmParser.tab.c" |
| |
| #if ! defined (YYSIZE_T) && defined (__SIZE_TYPE__) |
| # define YYSIZE_T __SIZE_TYPE__ |
| #endif |
| #if ! defined (YYSIZE_T) && defined (size_t) |
| # define YYSIZE_T size_t |
| #endif |
| #if ! defined (YYSIZE_T) && (defined (__STDC__) || defined (__cplusplus)) |
| # include <stddef.h> /* INFRINGES ON USER NAME SPACE */ |
| # define YYSIZE_T size_t |
| #endif |
| #if ! defined (YYSIZE_T) |
| # define YYSIZE_T unsigned int |
| #endif |
| |
| #ifndef YY_ |
| # if YYENABLE_NLS |
| # if ENABLE_NLS |
| # include <libintl.h> /* INFRINGES ON USER NAME SPACE */ |
| # define YY_(msgid) dgettext ("bison-runtime", msgid) |
| # endif |
| # endif |
| # ifndef YY_ |
| # define YY_(msgid) msgid |
| # endif |
| #endif |
| |
| #if ! defined (yyoverflow) || YYERROR_VERBOSE |
| |
| /* The parser invokes alloca or malloc; define the necessary symbols. */ |
| |
| # ifdef YYSTACK_USE_ALLOCA |
| # if YYSTACK_USE_ALLOCA |
| # ifdef __GNUC__ |
| # define YYSTACK_ALLOC __builtin_alloca |
| # else |
| # define YYSTACK_ALLOC alloca |
| # if defined (__STDC__) || defined (__cplusplus) |
| # include <stdlib.h> /* INFRINGES ON USER NAME SPACE */ |
| # define YYINCLUDED_STDLIB_H |
| # endif |
| # endif |
| # endif |
| # endif |
| |
| # ifdef YYSTACK_ALLOC |
| /* Pacify GCC's `empty if-body' warning. */ |
| # define YYSTACK_FREE(Ptr) do { /* empty */; } while (0) |
| # ifndef YYSTACK_ALLOC_MAXIMUM |
| /* The OS might guarantee only one guard page at the bottom of the stack, |
| and a page size can be as small as 4096 bytes. So we cannot safely |
| invoke alloca (N) if N exceeds 4096. Use a slightly smaller number |
| to allow for a few compiler-allocated temporary stack slots. */ |
| # define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2005 */ |
| # endif |
| # else |
| # define YYSTACK_ALLOC YYMALLOC |
| # define YYSTACK_FREE YYFREE |
| # ifndef YYSTACK_ALLOC_MAXIMUM |
| # define YYSTACK_ALLOC_MAXIMUM ((YYSIZE_T) -1) |
| # endif |
| # ifdef __cplusplus |
| extern "C" { |
| # endif |
| # ifndef YYMALLOC |
| # define YYMALLOC malloc |
| # if (! defined (malloc) && ! defined (YYINCLUDED_STDLIB_H) \ |
| && (defined (__STDC__) || defined (__cplusplus))) |
| void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */ |
| # endif |
| # endif |
| # ifndef YYFREE |
| # define YYFREE free |
| # if (! defined (free) && ! defined (YYINCLUDED_STDLIB_H) \ |
| && (defined (__STDC__) || defined (__cplusplus))) |
| void free (void *); /* INFRINGES ON USER NAME SPACE */ |
| # endif |
| # endif |
| # ifdef __cplusplus |
| } |
| # endif |
| # endif |
| #endif /* ! defined (yyoverflow) || YYERROR_VERBOSE */ |
| |
| |
| #if (! defined (yyoverflow) \ |
| && (! defined (__cplusplus) \ |
| || (defined (YYSTYPE_IS_TRIVIAL) && YYSTYPE_IS_TRIVIAL))) |
| |
| /* A type that is properly aligned for any stack member. */ |
| union yyalloc |
| { |
| short int yyss; |
| YYSTYPE yyvs; |
| }; |
| |
| /* The size of the maximum gap between one aligned stack and the next. */ |
| # define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1) |
| |
| /* The size of an array large to enough to hold all stacks, each with |
| N elements. */ |
| # define YYSTACK_BYTES(N) \ |
| ((N) * (sizeof (short int) + sizeof (YYSTYPE)) \ |
| + YYSTACK_GAP_MAXIMUM) |
| |
| /* Copy COUNT objects from FROM to TO. The source and destination do |
| not overlap. */ |
| # ifndef YYCOPY |
| # if defined (__GNUC__) && 1 < __GNUC__ |
| # define YYCOPY(To, From, Count) \ |
| __builtin_memcpy (To, From, (Count) * sizeof (*(From))) |
| # else |
| # define YYCOPY(To, From, Count) \ |
| do \ |
| { \ |
| YYSIZE_T yyi; \ |
| for (yyi = 0; yyi < (Count); yyi++) \ |
| (To)[yyi] = (From)[yyi]; \ |
| } \ |
| while (0) |
| # endif |
| # endif |
| |
| /* Relocate STACK from its old location to the new one. The |
| local variables YYSIZE and YYSTACKSIZE give the old and new number of |
| elements in the stack, and YYPTR gives the new location of the |
| stack. Advance YYPTR to a properly aligned location for the next |
| stack. */ |
| # define YYSTACK_RELOCATE(Stack) \ |
| do \ |
| { \ |
| YYSIZE_T yynewbytes; \ |
| YYCOPY (&yyptr->Stack, Stack, yysize); \ |
| Stack = &yyptr->Stack; \ |
| yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \ |
| yyptr += yynewbytes / sizeof (*yyptr); \ |
| } \ |
| while (0) |
| |
| #endif |
| |
| #if defined (__STDC__) || defined (__cplusplus) |
| typedef signed char yysigned_char; |
| #else |
| typedef short int yysigned_char; |
| #endif |
| |
| /* YYFINAL -- State number of the termination state. */ |
| #define YYFINAL 4 |
| /* YYLAST -- Last index in YYTABLE. */ |
| #define YYLAST 1288 |
| |
| /* YYNTOKENS -- Number of terminals. */ |
| #define YYNTOKENS 125 |
| /* YYNNTS -- Number of nonterminals. */ |
| #define YYNNTS 75 |
| /* YYNRULES -- Number of rules. */ |
| #define YYNRULES 254 |
| /* YYNRULES -- Number of states. */ |
| #define YYNSTATES 519 |
| |
| /* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */ |
| #define YYUNDEFTOK 2 |
| #define YYMAXUTOK 365 |
| |
| #define YYTRANSLATE(YYX) \ |
| ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK) |
| |
| /* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */ |
| static const unsigned char yytranslate[] = |
| { |
| 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 114, 115, 123, 2, 112, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 119, 111, 120, 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, 116, 113, 118, 2, 2, 2, 2, 2, 124, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 117, 2, 2, 121, 2, 122, 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, 2, 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 |
| }; |
| |
| #if YYDEBUG |
| /* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in |
| YYRHS. */ |
| static const unsigned short int yyprhs[] = |
| { |
| 0, 0, 3, 5, 7, 9, 11, 13, 15, 17, |
| 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, |
| 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, |
| 59, 61, 63, 65, 67, 69, 71, 74, 75, 77, |
| 79, 81, 83, 85, 87, 89, 90, 91, 93, 95, |
| 97, 99, 101, 103, 106, 107, 110, 111, 115, 118, |
| 119, 121, 122, 126, 128, 131, 133, 135, 137, 139, |
| 141, 143, 145, 147, 149, 151, 153, 155, 157, 159, |
| 161, 163, 165, 167, 169, 171, 173, 176, 181, 187, |
| 193, 197, 200, 203, 205, 209, 211, 215, 217, 218, |
| 223, 227, 231, 236, 241, 245, 248, 251, 254, 257, |
| 260, 263, 266, 269, 272, 275, 282, 288, 297, 304, |
| 311, 318, 325, 332, 341, 350, 354, 356, 358, 360, |
| 362, 365, 368, 373, 376, 378, 383, 386, 391, 392, |
| 400, 401, 409, 410, 418, 419, 427, 431, 436, 437, |
| 439, 441, 443, 447, 451, 455, 459, 463, 467, 469, |
| 470, 472, 474, 476, 477, 480, 484, 486, 488, 492, |
| 494, 495, 504, 506, 508, 512, 514, 516, 519, 520, |
| 522, 524, 525, 530, 531, 533, 535, 537, 539, 541, |
| 543, 545, 547, 549, 553, 555, 561, 563, 565, 567, |
| 569, 572, 575, 578, 582, 585, 586, 588, 591, 594, |
| 598, 608, 618, 627, 641, 643, 645, 652, 658, 661, |
| 668, 676, 678, 682, 684, 685, 688, 690, 696, 702, |
| 708, 711, 716, 721, 728, 733, 738, 743, 748, 755, |
| 762, 765, 773, 775, 778, 779, 781, 782, 786, 793, |
| 797, 804, 807, 812, 819 |
| }; |
| |
| /* YYRHS -- A `-1'-separated list of the rules' RHS. */ |
| static const short int yyrhs[] = |
| { |
| 156, 0, -1, 5, -1, 6, -1, 3, -1, 4, |
| -1, 78, -1, 79, -1, 80, -1, 81, -1, 82, |
| -1, 83, -1, 84, -1, 85, -1, 86, -1, 87, |
| -1, 88, -1, 89, -1, 90, -1, 91, -1, 92, |
| -1, 93, -1, 103, -1, 104, -1, 16, -1, 14, |
| -1, 12, -1, 10, -1, 17, -1, 15, -1, 13, |
| -1, 11, -1, 132, -1, 133, -1, 18, -1, 19, |
| -1, 168, 111, -1, -1, 41, -1, 42, -1, 43, |
| -1, 44, -1, 45, -1, 46, -1, 47, -1, -1, |
| -1, 65, -1, 66, -1, 67, -1, 68, -1, 69, |
| -1, 70, -1, 64, 4, -1, -1, 57, 4, -1, |
| -1, 112, 57, 4, -1, 34, 24, -1, -1, 141, |
| -1, -1, 112, 144, 143, -1, 141, -1, 57, 4, |
| -1, 147, -1, 8, -1, 149, -1, 8, -1, 149, |
| -1, 9, -1, 10, -1, 11, -1, 12, -1, 13, |
| -1, 14, -1, 15, -1, 16, -1, 17, -1, 18, |
| -1, 19, -1, 20, -1, 21, -1, 48, -1, 148, |
| -1, 183, -1, 113, 4, -1, 146, 114, 151, 115, |
| -1, 116, 4, 117, 149, 118, -1, 119, 4, 117, |
| 149, 120, -1, 121, 150, 122, -1, 121, 122, -1, |
| 149, 123, -1, 149, -1, 150, 112, 149, -1, 150, |
| -1, 150, 112, 37, -1, 37, -1, -1, 147, 116, |
| 154, 118, -1, 147, 116, 118, -1, 147, 124, 24, |
| -1, 147, 119, 154, 120, -1, 147, 121, 154, 122, |
| -1, 147, 121, 122, -1, 147, 38, -1, 147, 39, |
| -1, 147, 183, -1, 147, 153, -1, 147, 26, -1, |
| 132, 127, -1, 133, 4, -1, 9, 27, -1, 9, |
| 28, -1, 135, 7, -1, 101, 114, 152, 36, 147, |
| 115, -1, 99, 114, 152, 197, 115, -1, 102, 114, |
| 152, 112, 152, 112, 152, 115, -1, 128, 114, 152, |
| 112, 152, 115, -1, 129, 114, 152, 112, 152, 115, |
| -1, 130, 114, 152, 112, 152, 115, -1, 131, 114, |
| 152, 112, 152, 115, -1, 106, 114, 152, 112, 152, |
| 115, -1, 107, 114, 152, 112, 152, 112, 152, 115, |
| -1, 108, 114, 152, 112, 152, 112, 152, 115, -1, |
| 154, 112, 152, -1, 152, -1, 32, -1, 33, -1, |
| 157, -1, 157, 177, -1, 157, 179, -1, 157, 62, |
| 61, 163, -1, 157, 25, -1, 158, -1, 158, 136, |
| 20, 145, -1, 158, 179, -1, 158, 62, 61, 163, |
| -1, -1, 158, 136, 137, 155, 152, 159, 143, -1, |
| -1, 158, 136, 50, 155, 147, 160, 143, -1, -1, |
| 158, 136, 45, 155, 147, 161, 143, -1, -1, 158, |
| 136, 47, 155, 147, 162, 143, -1, 158, 51, 165, |
| -1, 158, 58, 111, 166, -1, -1, 24, -1, 56, |
| -1, 55, -1, 53, 111, 164, -1, 54, 111, 4, |
| -1, 52, 111, 24, -1, 71, 111, 24, -1, 116, |
| 167, 118, -1, 167, 112, 24, -1, 24, -1, -1, |
| 22, -1, 24, -1, 168, -1, -1, 147, 169, -1, |
| 171, 112, 170, -1, 170, -1, 171, -1, 171, 112, |
| 37, -1, 37, -1, -1, 138, 145, 168, 114, 172, |
| 115, 142, 139, -1, 29, -1, 121, -1, 137, 173, |
| 174, -1, 30, -1, 122, -1, 186, 176, -1, -1, |
| 45, -1, 47, -1, -1, 31, 180, 178, 173, -1, |
| -1, 63, -1, 3, -1, 4, -1, 7, -1, 27, |
| -1, 28, -1, 38, -1, 39, -1, 26, -1, 119, |
| 154, 120, -1, 153, -1, 61, 181, 24, 112, 24, |
| -1, 126, -1, 168, -1, 183, -1, 182, -1, 147, |
| 184, -1, 186, 187, -1, 175, 187, -1, 188, 136, |
| 189, -1, 188, 191, -1, -1, 23, -1, 72, 185, |
| -1, 72, 8, -1, 73, 21, 184, -1, 73, 9, |
| 184, 112, 21, 184, 112, 21, 184, -1, 74, 134, |
| 184, 112, 21, 184, 116, 190, 118, -1, 74, 134, |
| 184, 112, 21, 184, 116, 118, -1, 75, 138, 145, |
| 184, 114, 194, 115, 36, 21, 184, 76, 21, 184, |
| -1, 76, -1, 77, -1, 190, 134, 182, 112, 21, |
| 184, -1, 134, 182, 112, 21, 184, -1, 136, 196, |
| -1, 147, 116, 184, 112, 184, 118, -1, 192, 112, |
| 116, 184, 112, 184, 118, -1, 185, -1, 193, 112, |
| 185, -1, 193, -1, -1, 60, 59, -1, 59, -1, |
| 128, 147, 184, 112, 184, -1, 129, 147, 184, 112, |
| 184, -1, 130, 147, 184, 112, 184, -1, 49, 185, |
| -1, 131, 185, 112, 185, -1, 101, 185, 36, 147, |
| -1, 102, 185, 112, 185, 112, 185, -1, 105, 185, |
| 112, 147, -1, 109, 185, 112, 147, -1, 110, 185, |
| 112, 147, -1, 106, 185, 112, 185, -1, 107, 185, |
| 112, 185, 112, 185, -1, 108, 185, 112, 185, 112, |
| 185, -1, 100, 192, -1, 195, 138, 145, 184, 114, |
| 194, 115, -1, 199, -1, 112, 193, -1, -1, 35, |
| -1, -1, 94, 147, 140, -1, 94, 147, 112, 15, |
| 184, 140, -1, 95, 147, 140, -1, 95, 147, 112, |
| 15, 184, 140, -1, 96, 185, -1, 198, 97, 147, |
| 184, -1, 198, 98, 185, 112, 147, 184, -1, 99, |
| 147, 184, 197, -1 |
| }; |
| |
| /* YYRLINE[YYN] -- source line where rule number YYN was defined. */ |
| static const unsigned short int yyrline[] = |
| { |
| 0, 1134, 1134, 1135, 1143, 1144, 1154, 1154, 1154, 1154, |
| 1154, 1154, 1154, 1155, 1155, 1155, 1156, 1156, 1156, 1156, |
| 1156, 1156, 1158, 1158, 1162, 1162, 1162, 1162, 1163, 1163, |
| 1163, 1163, 1164, 1164, 1165, 1165, 1168, 1172, 1177, 1178, |
| 1179, 1180, 1181, 1182, 1183, 1184, 1186, 1187, 1188, 1189, |
| 1190, 1191, 1192, 1193, 1202, 1203, 1209, 1210, 1218, 1226, |
| 1227, 1232, 1233, 1234, 1239, 1253, 1253, 1254, 1254, 1256, |
| 1266, 1266, 1266, 1266, 1266, 1266, 1266, 1267, 1267, 1267, |
| 1267, 1267, 1267, 1268, 1272, 1276, 1284, 1292, 1305, 1310, |
| 1322, 1332, 1336, 1347, 1352, 1358, 1359, 1363, 1367, 1378, |
| 1404, 1418, 1448, 1474, 1495, 1508, 1518, 1523, 1584, 1591, |
| 1600, 1606, 1612, 1616, 1620, 1628, 1639, 1671, 1679, 1706, |
| 1717, 1723, 1731, 1737, 1743, 1752, 1756, 1764, 1764, 1774, |
| 1782, 1787, 1791, 1795, 1799, 1814, 1836, 1839, 1842, 1842, |
| 1850, 1850, 1858, 1858, 1866, 1866, 1875, 1878, 1881, 1885, |
| 1898, 1899, 1901, 1905, 1914, 1918, 1923, 1925, 1930, 1935, |
| 1944, 1944, 1945, 1945, 1947, 1954, 1960, 1967, 1971, 1977, |
| 1982, 1987, 2082, 2082, 2084, 2092, 2092, 2094, 2099, 2100, |
| 2101, 2103, 2103, 2113, 2117, 2122, 2126, 2130, 2134, 2138, |
| 2142, 2146, 2150, 2154, 2179, 2183, 2197, 2201, 2207, 2207, |
| 2213, 2218, 2222, 2231, 2242, 2247, 2259, 2272, 2276, 2280, |
| 2285, 2294, 2313, 2322, 2378, 2382, 2389, 2400, 2413, 2422, |
| 2431, 2441, 2445, 2452, 2452, 2454, 2458, 2463, 2482, 2497, |
| 2511, 2524, 2532, 2540, 2548, 2554, 2574, 2597, 2603, 2609, |
| 2615, 2630, 2689, 2696, 2699, 2704, 2708, 2715, 2720, 2726, |
| 2731, 2737, 2745, 2757, 2772 |
| }; |
| #endif |
| |
| #if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE |
| /* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM. |
| First, the terminals, then, starting at YYNTOKENS, nonterminals. */ |
| static const char *const yytname[] = |
| { |
| "$end", "error", "$undefined", "ESINT64VAL", "EUINT64VAL", "SINTVAL", |
| "UINTVAL", "FPVAL", "VOID", "BOOL", "SBYTE", "UBYTE", "SHORT", "USHORT", |
| "INT", "UINT", "LONG", "ULONG", "FLOAT", "DOUBLE", "TYPE", "LABEL", |
| "VAR_ID", "LABELSTR", "STRINGCONSTANT", "IMPLEMENTATION", |
| "ZEROINITIALIZER", "TRUETOK", "FALSETOK", "BEGINTOK", "ENDTOK", |
| "DECLARE", "GLOBAL", "CONSTANT", "SECTION", "VOLATILE", "TO", |
| "DOTDOTDOT", "NULL_TOK", "UNDEF", "CONST", "INTERNAL", "LINKONCE", |
| "WEAK", "APPENDING", "DLLIMPORT", "DLLEXPORT", "EXTERN_WEAK", "OPAQUE", |
| "NOT", "EXTERNAL", "TARGET", "TRIPLE", "ENDIAN", "POINTERSIZE", "LITTLE", |
| "BIG", "ALIGN", "DEPLIBS", "CALL", "TAIL", "ASM_TOK", "MODULE", |
| "SIDEEFFECT", "CC_TOK", "CCC_TOK", "CSRETCC_TOK", "FASTCC_TOK", |
| "COLDCC_TOK", "X86_STDCALLCC_TOK", "X86_FASTCALLCC_TOK", "DATALAYOUT", |
| "RET", "BR", "SWITCH", "INVOKE", "UNWIND", "UNREACHABLE", "ADD", "SUB", |
| "MUL", "UDIV", "SDIV", "FDIV", "REM", "AND", "OR", "XOR", "SETLE", |
| "SETGE", "SETLT", "SETGT", "SETEQ", "SETNE", "MALLOC", "ALLOCA", "FREE", |
| "LOAD", "STORE", "GETELEMENTPTR", "PHI_TOK", "CAST", "SELECT", "SHL", |
| "SHR", "VAARG", "EXTRACTELEMENT", "INSERTELEMENT", "SHUFFLEVECTOR", |
| "VAARG_old", "VANEXT_old", "'='", "','", "'\\\\'", "'('", "')'", "'['", |
| "'x'", "']'", "'<'", "'>'", "'{'", "'}'", "'*'", "'c'", "$accept", |
| "INTVAL", "EINT64VAL", "ArithmeticOps", "LogicalOps", "SetCondOps", |
| "ShiftOps", "SIntType", "UIntType", "IntType", "FPType", "OptAssign", |
| "OptLinkage", "OptCallingConv", "OptAlign", "OptCAlign", "SectionString", |
| "OptSection", "GlobalVarAttributes", "GlobalVarAttribute", "TypesV", |
| "UpRTypesV", "Types", "PrimType", "UpRTypes", "TypeListI", |
| "ArgTypeListI", "ConstVal", "ConstExpr", "ConstVector", "GlobalType", |
| "Module", "FunctionList", "ConstPool", "@1", "@2", "@3", "@4", |
| "AsmBlock", "BigOrLittle", "TargetDefinition", "LibrariesDefinition", |
| "LibList", "Name", "OptName", "ArgVal", "ArgListH", "ArgList", |
| "FunctionHeaderH", "BEGIN", "FunctionHeader", "END", "Function", |
| "FnDeclareLinkage", "FunctionProto", "@5", "OptSideEffect", |
| "ConstValueRef", "SymbolicValueRef", "ValueRef", "ResolvedVal", |
| "BasicBlockList", "BasicBlock", "InstructionList", "BBTerminatorInst", |
| "JumpTable", "Inst", "PHIList", "ValueRefList", "ValueRefListE", |
| "OptTailCall", "InstVal", "IndexList", "OptVolatile", "MemoryInst", 0 |
| }; |
| #endif |
| |
| # ifdef YYPRINT |
| /* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to |
| token YYLEX-NUM. */ |
| static const unsigned short int yytoknum[] = |
| { |
| 0, 256, 257, 258, 259, 260, 261, 262, 263, 264, |
| 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, |
| 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, |
| 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, |
| 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, |
| 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, |
| 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, |
| 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, |
| 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, |
| 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, |
| 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, |
| 365, 61, 44, 92, 40, 41, 91, 120, 93, 60, |
| 62, 123, 125, 42, 99 |
| }; |
| # endif |
| |
| /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ |
| static const unsigned char yyr1[] = |
| { |
| 0, 125, 126, 126, 127, 127, 128, 128, 128, 128, |
| 128, 128, 128, 129, 129, 129, 130, 130, 130, 130, |
| 130, 130, 131, 131, 132, 132, 132, 132, 133, 133, |
| 133, 133, 134, 134, 135, 135, 136, 136, 137, 137, |
| 137, 137, 137, 137, 137, 137, 138, 138, 138, 138, |
| 138, 138, 138, 138, 139, 139, 140, 140, 141, 142, |
| 142, 143, 143, 144, 144, 145, 145, 146, 146, 147, |
| 148, 148, 148, 148, 148, 148, 148, 148, 148, 148, |
| 148, 148, 148, 149, 149, 149, 149, 149, 149, 149, |
| 149, 149, 149, 150, 150, 151, 151, 151, 151, 152, |
| 152, 152, 152, 152, 152, 152, 152, 152, 152, 152, |
| 152, 152, 152, 152, 152, 153, 153, 153, 153, 153, |
| 153, 153, 153, 153, 153, 154, 154, 155, 155, 156, |
| 157, 157, 157, 157, 157, 158, 158, 158, 159, 158, |
| 160, 158, 161, 158, 162, 158, 158, 158, 158, 163, |
| 164, 164, 165, 165, 165, 165, 166, 167, 167, 167, |
| 168, 168, 169, 169, 170, 171, 171, 172, 172, 172, |
| 172, 173, 174, 174, 175, 176, 176, 177, 178, 178, |
| 178, 180, 179, 181, 181, 182, 182, 182, 182, 182, |
| 182, 182, 182, 182, 182, 182, 183, 183, 184, 184, |
| 185, 186, 186, 187, 188, 188, 188, 189, 189, 189, |
| 189, 189, 189, 189, 189, 189, 190, 190, 191, 192, |
| 192, 193, 193, 194, 194, 195, 195, 196, 196, 196, |
| 196, 196, 196, 196, 196, 196, 196, 196, 196, 196, |
| 196, 196, 196, 197, 197, 198, 198, 199, 199, 199, |
| 199, 199, 199, 199, 199 |
| }; |
| |
| /* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */ |
| static const unsigned char yyr2[] = |
| { |
| 0, 2, 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, 2, 0, 1, 1, |
| 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, |
| 1, 1, 1, 2, 0, 2, 0, 3, 2, 0, |
| 1, 0, 3, 1, 2, 1, 1, 1, 1, 1, |
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 1, 1, 1, 1, 1, 1, 2, 4, 5, 5, |
| 3, 2, 2, 1, 3, 1, 3, 1, 0, 4, |
| 3, 3, 4, 4, 3, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 6, 5, 8, 6, 6, |
| 6, 6, 6, 8, 8, 3, 1, 1, 1, 1, |
| 2, 2, 4, 2, 1, 4, 2, 4, 0, 7, |
| 0, 7, 0, 7, 0, 7, 3, 4, 0, 1, |
| 1, 1, 3, 3, 3, 3, 3, 3, 1, 0, |
| 1, 1, 1, 0, 2, 3, 1, 1, 3, 1, |
| 0, 8, 1, 1, 3, 1, 1, 2, 0, 1, |
| 1, 0, 4, 0, 1, 1, 1, 1, 1, 1, |
| 1, 1, 1, 3, 1, 5, 1, 1, 1, 1, |
| 2, 2, 2, 3, 2, 0, 1, 2, 2, 3, |
| 9, 9, 8, 13, 1, 1, 6, 5, 2, 6, |
| 7, 1, 3, 1, 0, 2, 1, 5, 5, 5, |
| 2, 4, 4, 6, 4, 4, 4, 4, 6, 6, |
| 2, 7, 1, 2, 0, 1, 0, 3, 6, 3, |
| 6, 2, 4, 6, 4 |
| }; |
| |
| /* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state |
| STATE-NUM when YYTABLE doesn't specify something else to do. Zero |
| means the default is an error. */ |
| static const unsigned char yydefact[] = |
| { |
| 148, 0, 45, 134, 1, 133, 181, 38, 39, 40, |
| 41, 42, 43, 44, 0, 46, 205, 130, 131, 205, |
| 160, 161, 0, 0, 0, 45, 0, 136, 178, 0, |
| 0, 47, 48, 49, 50, 51, 52, 0, 0, 206, |
| 202, 37, 175, 176, 177, 201, 0, 0, 0, 0, |
| 146, 0, 0, 0, 0, 0, 0, 0, 36, 179, |
| 180, 46, 149, 132, 53, 2, 3, 66, 70, 71, |
| 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, |
| 82, 83, 0, 0, 0, 0, 196, 0, 0, 65, |
| 84, 69, 197, 85, 172, 173, 174, 246, 204, 0, |
| 0, 0, 0, 159, 147, 137, 135, 127, 128, 0, |
| 0, 0, 0, 182, 86, 0, 0, 68, 91, 93, |
| 0, 0, 98, 92, 245, 0, 226, 0, 0, 0, |
| 0, 46, 214, 215, 6, 7, 8, 9, 10, 11, |
| 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, |
| 0, 0, 0, 0, 0, 0, 0, 22, 23, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 203, |
| 46, 218, 0, 242, 154, 151, 150, 152, 153, 155, |
| 158, 0, 142, 144, 140, 70, 71, 72, 73, 74, |
| 75, 76, 77, 78, 79, 80, 0, 0, 0, 0, |
| 138, 0, 0, 0, 90, 170, 97, 95, 0, 0, |
| 230, 225, 208, 207, 0, 0, 27, 31, 26, 30, |
| 25, 29, 24, 28, 32, 33, 0, 0, 56, 56, |
| 251, 0, 0, 240, 0, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 156, 61, 61, 61, 112, 113, 4, 5, 110, 111, |
| 114, 109, 105, 106, 0, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 108, 107, |
| 61, 67, 67, 94, 169, 163, 166, 167, 0, 0, |
| 87, 185, 186, 187, 192, 188, 189, 190, 191, 183, |
| 0, 194, 199, 198, 200, 0, 209, 0, 0, 0, |
| 247, 0, 249, 244, 0, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 0, 157, 0, 143, 145, 141, 0, 0, 0, 0, |
| 0, 0, 100, 126, 0, 0, 104, 0, 101, 0, |
| 0, 0, 0, 139, 88, 89, 162, 164, 0, 59, |
| 96, 184, 0, 0, 0, 0, 0, 0, 0, 0, |
| 0, 254, 0, 0, 232, 0, 234, 237, 0, 0, |
| 235, 236, 0, 0, 0, 231, 0, 252, 0, 0, |
| 0, 63, 61, 244, 0, 0, 0, 0, 0, 0, |
| 99, 102, 103, 0, 0, 0, 0, 168, 165, 60, |
| 54, 0, 193, 0, 0, 224, 56, 57, 56, 221, |
| 243, 0, 0, 0, 0, 0, 227, 228, 229, 224, |
| 0, 58, 64, 62, 0, 0, 0, 0, 0, 0, |
| 125, 0, 0, 0, 0, 0, 171, 0, 0, 0, |
| 223, 0, 0, 248, 250, 0, 0, 0, 233, 238, |
| 239, 0, 253, 116, 0, 0, 0, 0, 0, 0, |
| 0, 0, 0, 55, 195, 0, 0, 0, 222, 219, |
| 0, 241, 115, 0, 122, 0, 0, 118, 119, 120, |
| 121, 0, 212, 0, 0, 0, 220, 0, 0, 0, |
| 210, 0, 211, 0, 0, 117, 123, 124, 0, 0, |
| 0, 0, 0, 0, 217, 0, 0, 216, 213 |
| }; |
| |
| /* YYDEFGOTO[NTERM-NUM]. */ |
| static const short int yydefgoto[] = |
| { |
| -1, 86, 258, 274, 275, 276, 277, 196, 197, 226, |
| 198, 25, 15, 37, 446, 310, 391, 410, 333, 392, |
| 87, 88, 199, 90, 91, 120, 208, 343, 301, 344, |
| 109, 1, 2, 3, 280, 253, 251, 252, 63, 177, |
| 50, 104, 181, 92, 357, 286, 287, 288, 38, 96, |
| 16, 44, 17, 61, 18, 28, 362, 302, 93, 304, |
| 419, 19, 40, 41, 169, 494, 98, 233, 450, 451, |
| 170, 171, 371, 172, 173 |
| }; |
| |
| /* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing |
| STATE-NUM. */ |
| #define YYPACT_NINF -463 |
| static const short int yypact[] = |
| { |
| -463, 42, 182, 621, -463, -463, -463, -463, -463, -463, |
| -463, -463, -463, -463, -15, 347, 64, -463, -463, -12, |
| -463, -463, 15, 1, 33, 360, 10, -463, 89, 114, |
| 140, -463, -463, -463, -463, -463, -463, 1005, -1, -463, |
| -463, 115, -463, -463, -463, -463, 40, 56, 67, 68, |
| -463, 59, 114, 1005, 51, 51, 51, 51, -463, -463, |
| -463, 347, -463, -463, -463, -463, -463, 66, -463, -463, |
| -463, -463, -463, -463, -463, -463, -463, -463, -463, -463, |
| -463, -463, 172, 177, 180, 489, -463, 115, 74, -463, |
| -463, -97, -463, -463, -463, -463, -463, 1178, -463, 165, |
| -17, 188, 170, 171, -463, -463, -463, -463, -463, 1046, |
| 1046, 1046, 1087, -463, -463, 80, 81, -463, -463, -97, |
| -91, 85, 838, -463, -463, 1046, -463, 142, 1128, 6, |
| 248, 347, -463, -463, -463, -463, -463, -463, -463, -463, |
| -463, -463, -463, -463, -463, -463, -463, -463, -463, -463, |
| 1046, 1046, 1046, 1046, 1046, 1046, 1046, -463, -463, 1046, |
| 1046, 1046, 1046, 1046, 1046, 1046, 1046, 1046, 1046, -463, |
| 347, -463, 35, -463, -463, -463, -463, -463, -463, -463, |
| -463, -48, -463, -463, -463, 113, 146, 198, 150, 200, |
| 152, 213, 167, 214, 212, 223, 169, 216, 224, 443, |
| -463, 1046, 1046, 1046, -463, 879, -463, 109, 117, 620, |
| -463, -463, 66, -463, 620, 620, -463, -463, -463, -463, |
| -463, -463, -463, -463, -463, -463, 620, 1005, 128, 129, |
| -463, 620, 126, 131, 209, 134, 141, 143, 144, 154, |
| 156, 157, 620, 620, 620, 158, 1005, 1046, 1046, 228, |
| -463, 161, 161, 161, -463, -463, -463, -463, -463, -463, |
| -463, -463, -463, -463, 160, 164, 175, 178, 181, 184, |
| 87, 1087, 574, 230, 185, 186, 187, 189, -463, -463, |
| 161, -33, -101, -97, -463, 115, -463, 163, 176, 923, |
| -463, -463, -463, -463, -463, -463, -463, -463, -463, 231, |
| 1087, -463, -463, -463, -463, 190, -463, 195, 620, -9, |
| -463, -8, -463, 196, 620, 193, 1046, 1046, 1046, 1046, |
| 1046, 1046, 1046, 1046, 199, 201, 202, 1046, 620, 620, |
| 203, -463, -22, -463, -463, -463, 1087, 1087, 1087, 1087, |
| 1087, 1087, -463, -463, -47, -79, -463, -82, -463, 1087, |
| 1087, 1087, 1087, -463, -463, -463, -463, -463, 964, 262, |
| -463, -463, 293, -75, 301, 302, 210, 620, 324, 620, |
| 1046, -463, 217, 620, -463, 218, -463, -463, 219, 220, |
| -463, -463, 620, 620, 620, -463, 229, -463, 1046, 314, |
| 340, -463, 161, 196, 309, 234, 237, 240, 241, 1087, |
| -463, -463, -463, 242, 243, 246, 247, -463, -463, -463, |
| 303, 249, -463, 620, 620, 1046, 250, -463, 250, -463, |
| 251, 620, 255, 1046, 1046, 1046, -463, -463, -463, 1046, |
| 620, -463, -463, -463, 253, 1046, 1087, 1087, 1087, 1087, |
| -463, 1087, 1087, 1087, 1087, 365, -463, 348, 259, 258, |
| 251, 260, 320, -463, -463, 1046, 261, 620, -463, -463, |
| -463, 267, -463, -463, 270, 277, 278, 282, 283, 281, |
| 284, 294, 304, -463, -463, 376, 65, 372, -463, -463, |
| 305, -463, -463, 1087, -463, 1087, 1087, -463, -463, -463, |
| -463, 620, -463, 726, 149, 399, -463, 306, 307, 310, |
| -463, 312, -463, 726, 620, -463, -463, -463, 405, 315, |
| 352, 620, 409, 411, -463, 620, 620, -463, -463 |
| }; |
| |
| /* YYPGOTO[NTERM-NUM]. */ |
| static const short int yypgoto[] = |
| { |
| -463, -463, -463, 336, 339, 341, 342, -129, -128, -462, |
| -463, 396, 415, -118, -463, -225, 82, -463, -244, -463, |
| -50, -463, -37, -463, -56, 321, -463, -102, 252, -247, |
| 5, -463, -463, -463, -463, -463, -463, -463, 390, -463, |
| -463, -463, -463, 2, -463, 92, -463, -463, 391, -463, |
| -463, -463, -463, -463, 450, -463, -463, -459, -57, 62, |
| -105, -463, 436, -463, -463, -463, -463, -463, 86, 28, |
| -463, -463, 69, -463, -463 |
| }; |
| |
| /* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If |
| positive, shift that token. If negative, reduce the rule which |
| number is the opposite. If zero, do what YYDEFACT says. |
| If YYTABLE_NINF, syntax error. */ |
| #define YYTABLE_NINF -130 |
| static const short int yytable[] = |
| { |
| 89, 224, 225, 106, 312, 26, 367, 369, 334, 335, |
| 200, 39, 389, 227, 493, 214, 89, -67, 42, 355, |
| 210, 203, 123, 213, 345, 347, 123, 215, 94, 119, |
| 399, 204, 503, 399, 501, 390, 353, 399, 175, 176, |
| 402, 401, 4, 26, 509, 412, 29, 230, 368, 368, |
| 234, 235, 246, 363, 236, 237, 238, 239, 240, 241, |
| 110, 111, 112, 245, 249, 399, 119, 46, 47, 48, |
| 250, 400, 182, 183, 184, 216, 217, 218, 219, 220, |
| 221, 222, 223, 107, 108, 354, 49, 39, 209, 121, |
| 123, 209, 65, 66, 52, 117, 185, 186, 187, 188, |
| 189, 190, 191, 192, 193, 194, 195, 79, 80, 20, |
| 43, 21, 51, 228, 229, 209, 231, 232, 209, 209, |
| 95, 58, 209, 209, 209, 209, 209, 209, 242, 243, |
| 244, 209, 247, 248, 59, 81, 60, 20, 62, 21, |
| 254, 255, 279, 330, 64, 281, 282, 283, 433, -27, |
| -27, 99, 303, -26, -26, -25, -25, 303, 303, 216, |
| 217, 218, 219, 220, 221, 222, 223, 100, 285, 303, |
| -24, -24, 256, 257, 303, 103, 114, 308, 101, 102, |
| -68, 115, -129, 492, 116, 303, 303, 303, 122, 174, |
| 89, 453, 178, 454, 179, 180, 328, 201, 202, 205, |
| 82, 211, -31, 83, -30, 342, 84, 5, 85, 89, |
| 329, 209, 375, 6, 377, 378, 379, -29, -28, -34, |
| 259, 289, 385, 7, 8, 9, 10, 11, 12, 13, |
| -35, 260, 290, 283, 393, 394, 395, 396, 397, 398, |
| 309, 311, 314, 315, 14, 316, 317, 403, 404, 405, |
| 406, 303, 331, 318, 348, 319, 320, 303, 216, 217, |
| 218, 219, 220, 221, 222, 223, 321, 502, 322, 323, |
| 327, 303, 303, 332, 336, 358, 305, 306, 337, 374, |
| 209, 376, 209, 209, 209, 380, 381, 356, 307, 338, |
| 209, 359, 339, 313, 361, 340, 389, 440, 341, 349, |
| 350, 351, 364, 352, 324, 325, 326, 365, 370, 373, |
| 303, 382, 303, 383, 384, 388, 303, 411, 458, 459, |
| 460, 285, 413, 414, 415, 303, 303, 303, 417, 421, |
| 423, 424, 425, 209, 465, 466, 467, 468, 431, 469, |
| 470, 471, 472, 429, 432, 435, 436, 224, 225, 437, |
| 478, 430, 438, 439, 441, 442, 303, 303, 443, 444, |
| 445, 447, 452, 455, 303, 224, 225, 457, 463, 473, |
| 366, 475, 474, 303, 476, 477, 372, 368, 209, 479, |
| 53, 497, 481, 498, 499, 482, 209, 209, 209, 483, |
| 386, 387, 209, 484, 485, 486, 487, 491, 464, 488, |
| 303, 7, 8, 9, 10, 54, 12, 55, 495, 489, |
| 56, 30, 31, 32, 33, 34, 35, 36, 209, 490, |
| 504, 505, 506, 496, 508, 507, 511, 512, 513, 416, |
| 515, 418, 516, 165, 303, 422, 166, 97, 167, 168, |
| 57, 409, 105, 207, 426, 427, 428, 303, 65, 66, |
| 408, 278, 113, 27, 303, 45, 420, 461, 303, 303, |
| 0, 0, 434, 0, 0, 20, 0, 21, 0, 261, |
| 0, 0, 0, 0, 0, 448, 449, 0, 0, 0, |
| 0, 262, 263, 456, 0, 0, 0, 0, 0, 0, |
| 0, 0, 462, 0, 65, 66, 0, 117, 68, 69, |
| 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, |
| 80, 20, 0, 21, 0, 0, 0, 0, 0, 480, |
| 0, 134, 135, 136, 137, 138, 139, 140, 141, 142, |
| 143, 144, 145, 146, 147, 148, 149, 81, 0, 0, |
| 0, 0, 264, 0, 265, 266, 157, 158, 0, 267, |
| 268, 269, 0, 500, 0, 0, 0, 0, 0, 270, |
| 0, 0, 271, 0, 272, 0, 510, 273, 0, 0, |
| 0, 0, 0, 514, 0, 0, 0, 517, 518, 65, |
| 66, 0, 117, 185, 186, 187, 188, 189, 190, 191, |
| 192, 193, 194, 195, 79, 80, 20, 0, 21, 0, |
| 0, 0, 82, 0, 0, 83, 0, 0, 84, 0, |
| 85, 118, 0, 0, 0, 0, 0, 0, 0, 0, |
| 0, 0, 81, 291, 292, 65, 66, 293, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 0, -37, 20, 20, 21, 21, 294, 295, 296, 0, |
| 0, 0, 6, -37, -37, 0, 0, 0, 297, 298, |
| 0, 0, -37, -37, -37, -37, -37, -37, -37, 0, |
| 0, -37, 22, 0, 0, 0, 0, 0, 0, 23, |
| 0, 299, 0, 24, 0, 0, 0, 82, 0, 0, |
| 83, 0, 0, 84, 0, 85, 346, 0, 134, 135, |
| 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, |
| 146, 147, 148, 149, 0, 0, 0, 0, 0, 264, |
| 0, 265, 266, 157, 158, 0, 267, 268, 269, 291, |
| 292, 0, 0, 293, 0, 0, 0, 0, 0, 300, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 0, 0, 294, 295, 296, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 297, 298, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 299, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 134, 135, 136, 137, 138, 139, |
| 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, |
| 0, 0, 0, 0, 0, 264, 0, 265, 266, 157, |
| 158, 0, 267, 268, 269, 0, 0, 0, 0, 0, |
| 0, 0, 0, 65, 66, 300, 117, 68, 69, 70, |
| 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, |
| 20, 0, 21, 0, 0, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 206, 0, 0, 0, 0, |
| 0, 0, 0, 0, 65, 66, 81, 117, 68, 69, |
| 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, |
| 80, 20, 0, 21, 0, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 284, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 81, 65, 66, |
| 0, 117, 68, 69, 70, 71, 72, 73, 74, 75, |
| 76, 77, 78, 79, 80, 20, 0, 21, 0, 0, |
| 0, 82, 0, 0, 83, 0, 0, 84, 0, 85, |
| 360, 0, 0, 0, 0, 0, 0, 0, 0, 65, |
| 66, 81, 117, 68, 69, 70, 71, 72, 73, 74, |
| 75, 76, 77, 78, 79, 80, 20, 0, 21, 0, |
| 0, 0, 82, 0, 0, 83, 0, 0, 84, 0, |
| 85, 407, 0, 0, 0, 0, 0, 0, 0, 0, |
| 65, 66, 81, 67, 68, 69, 70, 71, 72, 73, |
| 74, 75, 76, 77, 78, 79, 80, 20, 0, 21, |
| 0, 0, 0, 0, 0, 0, 82, 0, 0, 83, |
| 0, 0, 84, 0, 85, 0, 0, 0, 0, 0, |
| 0, 65, 66, 81, 117, 68, 69, 70, 71, 72, |
| 73, 74, 75, 76, 77, 78, 79, 80, 20, 0, |
| 21, 0, 0, 0, 0, 0, 0, 82, 0, 0, |
| 83, 0, 0, 84, 0, 85, 0, 0, 0, 0, |
| 0, 0, 65, 66, 81, 117, 185, 186, 187, 188, |
| 189, 190, 191, 192, 193, 194, 195, 79, 80, 20, |
| 0, 21, 0, 0, 0, 0, 0, 0, 82, 0, |
| 0, 83, 0, 0, 84, 0, 85, 0, 0, 0, |
| 0, 0, 0, 65, 66, 81, 212, 68, 69, 70, |
| 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, |
| 20, 0, 21, 0, 0, 0, 0, 0, 0, 82, |
| 0, 0, 83, 0, 0, 84, 0, 85, 0, 0, |
| 0, 0, 0, 0, 0, 0, 81, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 82, 0, 0, 83, 0, 0, 84, 0, 85, 0, |
| 0, 0, 0, 124, 0, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 125, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 126, 127, 0, |
| 0, 82, 0, 0, 83, 0, 0, 84, 0, 85, |
| 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, |
| 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, |
| 148, 149, 150, 151, 152, 0, 0, 153, 154, 155, |
| 156, 157, 158, 159, 160, 161, 162, 163, 164 |
| }; |
| |
| static const short int yycheck[] = |
| { |
| 37, 130, 130, 53, 229, 3, 15, 15, 252, 253, |
| 112, 23, 34, 131, 476, 9, 53, 114, 30, 120, |
| 125, 112, 123, 128, 271, 272, 123, 21, 29, 85, |
| 112, 122, 494, 112, 493, 57, 280, 112, 55, 56, |
| 122, 120, 0, 41, 503, 120, 61, 152, 57, 57, |
| 155, 156, 170, 300, 159, 160, 161, 162, 163, 164, |
| 55, 56, 57, 168, 112, 112, 122, 52, 53, 54, |
| 118, 118, 109, 110, 111, 10, 11, 12, 13, 14, |
| 15, 16, 17, 32, 33, 118, 71, 23, 125, 87, |
| 123, 128, 5, 6, 61, 8, 9, 10, 11, 12, |
| 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, |
| 122, 24, 111, 150, 151, 152, 153, 154, 155, 156, |
| 121, 111, 159, 160, 161, 162, 163, 164, 165, 166, |
| 167, 168, 97, 98, 45, 48, 47, 22, 24, 24, |
| 27, 28, 199, 248, 4, 201, 202, 203, 392, 3, |
| 4, 111, 209, 3, 4, 3, 4, 214, 215, 10, |
| 11, 12, 13, 14, 15, 16, 17, 111, 205, 226, |
| 3, 4, 3, 4, 231, 116, 4, 227, 111, 111, |
| 114, 4, 0, 118, 4, 242, 243, 244, 114, 24, |
| 227, 416, 4, 418, 24, 24, 246, 117, 117, 114, |
| 113, 59, 4, 116, 4, 118, 119, 25, 121, 246, |
| 247, 248, 317, 31, 319, 320, 321, 4, 4, 7, |
| 4, 112, 327, 41, 42, 43, 44, 45, 46, 47, |
| 7, 7, 115, 289, 336, 337, 338, 339, 340, 341, |
| 112, 112, 116, 112, 62, 36, 112, 349, 350, 351, |
| 352, 308, 24, 112, 24, 112, 112, 314, 10, 11, |
| 12, 13, 14, 15, 16, 17, 112, 118, 112, 112, |
| 112, 328, 329, 112, 114, 112, 214, 215, 114, 316, |
| 317, 318, 319, 320, 321, 322, 323, 285, 226, 114, |
| 327, 115, 114, 231, 63, 114, 34, 399, 114, 114, |
| 114, 114, 112, 114, 242, 243, 244, 112, 112, 116, |
| 367, 112, 369, 112, 112, 112, 373, 24, 423, 424, |
| 425, 358, 21, 21, 114, 382, 383, 384, 4, 112, |
| 112, 112, 112, 370, 436, 437, 438, 439, 24, 441, |
| 442, 443, 444, 114, 4, 36, 112, 476, 476, 112, |
| 455, 388, 112, 112, 112, 112, 413, 414, 112, 112, |
| 57, 112, 112, 112, 421, 494, 494, 112, 115, 4, |
| 308, 112, 24, 430, 116, 115, 314, 57, 415, 118, |
| 20, 483, 115, 485, 486, 115, 423, 424, 425, 112, |
| 328, 329, 429, 115, 112, 112, 115, 21, 435, 115, |
| 457, 41, 42, 43, 44, 45, 46, 47, 36, 115, |
| 50, 64, 65, 66, 67, 68, 69, 70, 455, 115, |
| 21, 115, 115, 118, 112, 115, 21, 112, 76, 367, |
| 21, 369, 21, 97, 491, 373, 97, 41, 97, 97, |
| 25, 359, 52, 122, 382, 383, 384, 504, 5, 6, |
| 358, 199, 61, 3, 511, 19, 370, 429, 515, 516, |
| -1, -1, 393, -1, -1, 22, -1, 24, -1, 26, |
| -1, -1, -1, -1, -1, 413, 414, -1, -1, -1, |
| -1, 38, 39, 421, -1, -1, -1, -1, -1, -1, |
| -1, -1, 430, -1, 5, 6, -1, 8, 9, 10, |
| 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, |
| 21, 22, -1, 24, -1, -1, -1, -1, -1, 457, |
| -1, 78, 79, 80, 81, 82, 83, 84, 85, 86, |
| 87, 88, 89, 90, 91, 92, 93, 48, -1, -1, |
| -1, -1, 99, -1, 101, 102, 103, 104, -1, 106, |
| 107, 108, -1, 491, -1, -1, -1, -1, -1, 116, |
| -1, -1, 119, -1, 121, -1, 504, 124, -1, -1, |
| -1, -1, -1, 511, -1, -1, -1, 515, 516, 5, |
| 6, -1, 8, 9, 10, 11, 12, 13, 14, 15, |
| 16, 17, 18, 19, 20, 21, 22, -1, 24, -1, |
| -1, -1, 113, -1, -1, 116, -1, -1, 119, -1, |
| 121, 122, -1, -1, -1, -1, -1, -1, -1, -1, |
| -1, -1, 48, 3, 4, 5, 6, 7, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| -1, 20, 22, 22, 24, 24, 26, 27, 28, -1, |
| -1, -1, 31, 32, 33, -1, -1, -1, 38, 39, |
| -1, -1, 41, 42, 43, 44, 45, 46, 47, -1, |
| -1, 50, 51, -1, -1, -1, -1, -1, -1, 58, |
| -1, 61, -1, 62, -1, -1, -1, 113, -1, -1, |
| 116, -1, -1, 119, -1, 121, 122, -1, 78, 79, |
| 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, |
| 90, 91, 92, 93, -1, -1, -1, -1, -1, 99, |
| -1, 101, 102, 103, 104, -1, 106, 107, 108, 3, |
| 4, -1, -1, 7, -1, -1, -1, -1, -1, 119, |
| -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| -1, -1, 26, 27, 28, -1, -1, -1, -1, -1, |
| -1, -1, -1, -1, 38, 39, -1, -1, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, 61, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| -1, -1, -1, -1, 78, 79, 80, 81, 82, 83, |
| 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, |
| -1, -1, -1, -1, -1, 99, -1, 101, 102, 103, |
| 104, -1, 106, 107, 108, -1, -1, -1, -1, -1, |
| -1, -1, -1, 5, 6, 119, 8, 9, 10, 11, |
| 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, |
| 22, -1, 24, -1, -1, -1, -1, -1, -1, -1, |
| -1, -1, -1, -1, -1, 37, -1, -1, -1, -1, |
| -1, -1, -1, -1, 5, 6, 48, 8, 9, 10, |
| 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, |
| 21, 22, -1, 24, -1, -1, -1, -1, -1, -1, |
| -1, -1, -1, -1, -1, -1, 37, -1, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, 48, 5, 6, |
| -1, 8, 9, 10, 11, 12, 13, 14, 15, 16, |
| 17, 18, 19, 20, 21, 22, -1, 24, -1, -1, |
| -1, 113, -1, -1, 116, -1, -1, 119, -1, 121, |
| 37, -1, -1, -1, -1, -1, -1, -1, -1, 5, |
| 6, 48, 8, 9, 10, 11, 12, 13, 14, 15, |
| 16, 17, 18, 19, 20, 21, 22, -1, 24, -1, |
| -1, -1, 113, -1, -1, 116, -1, -1, 119, -1, |
| 121, 37, -1, -1, -1, -1, -1, -1, -1, -1, |
| 5, 6, 48, 8, 9, 10, 11, 12, 13, 14, |
| 15, 16, 17, 18, 19, 20, 21, 22, -1, 24, |
| -1, -1, -1, -1, -1, -1, 113, -1, -1, 116, |
| -1, -1, 119, -1, 121, -1, -1, -1, -1, -1, |
| -1, 5, 6, 48, 8, 9, 10, 11, 12, 13, |
| 14, 15, 16, 17, 18, 19, 20, 21, 22, -1, |
| 24, -1, -1, -1, -1, -1, -1, 113, -1, -1, |
| 116, -1, -1, 119, -1, 121, -1, -1, -1, -1, |
| -1, -1, 5, 6, 48, 8, 9, 10, 11, 12, |
| 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, |
| -1, 24, -1, -1, -1, -1, -1, -1, 113, -1, |
| -1, 116, -1, -1, 119, -1, 121, -1, -1, -1, |
| -1, -1, -1, 5, 6, 48, 8, 9, 10, 11, |
| 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, |
| 22, -1, 24, -1, -1, -1, -1, -1, -1, 113, |
| -1, -1, 116, -1, -1, 119, -1, 121, -1, -1, |
| -1, -1, -1, -1, -1, -1, 48, -1, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| 113, -1, -1, 116, -1, -1, 119, -1, 121, -1, |
| -1, -1, -1, 35, -1, -1, -1, -1, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, 49, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, 59, 60, -1, |
| -1, 113, -1, -1, 116, -1, -1, 119, -1, 121, |
| 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, -1, -1, 99, 100, 101, |
| 102, 103, 104, 105, 106, 107, 108, 109, 110 |
| }; |
| |
| /* YYSTOS[STATE-NUM] -- The (internal number of the) accessing |
| symbol of state STATE-NUM. */ |
| static const unsigned char yystos[] = |
| { |
| 0, 156, 157, 158, 0, 25, 31, 41, 42, 43, |
| 44, 45, 46, 47, 62, 137, 175, 177, 179, 186, |
| 22, 24, 51, 58, 62, 136, 168, 179, 180, 61, |
| 64, 65, 66, 67, 68, 69, 70, 138, 173, 23, |
| 187, 188, 30, 122, 176, 187, 52, 53, 54, 71, |
| 165, 111, 61, 20, 45, 47, 50, 137, 111, 45, |
| 47, 178, 24, 163, 4, 5, 6, 8, 9, 10, |
| 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, |
| 21, 48, 113, 116, 119, 121, 126, 145, 146, 147, |
| 148, 149, 168, 183, 29, 121, 174, 136, 191, 111, |
| 111, 111, 111, 116, 166, 163, 145, 32, 33, 155, |
| 155, 155, 155, 173, 4, 4, 4, 8, 122, 149, |
| 150, 168, 114, 123, 35, 49, 59, 60, 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, 99, 100, 101, 102, 103, 104, 105, |
| 106, 107, 108, 109, 110, 128, 129, 130, 131, 189, |
| 195, 196, 198, 199, 24, 55, 56, 164, 4, 24, |
| 24, 167, 147, 147, 147, 9, 10, 11, 12, 13, |
| 14, 15, 16, 17, 18, 19, 132, 133, 135, 147, |
| 152, 117, 117, 112, 122, 114, 37, 150, 151, 147, |
| 185, 59, 8, 185, 9, 21, 10, 11, 12, 13, |
| 14, 15, 16, 17, 132, 133, 134, 138, 147, 147, |
| 185, 147, 147, 192, 185, 185, 185, 185, 185, 185, |
| 185, 185, 147, 147, 147, 185, 138, 97, 98, 112, |
| 118, 161, 162, 160, 27, 28, 3, 4, 127, 4, |
| 7, 26, 38, 39, 99, 101, 102, 106, 107, 108, |
| 116, 119, 121, 124, 128, 129, 130, 131, 153, 183, |
| 159, 149, 149, 149, 37, 147, 170, 171, 172, 112, |
| 115, 3, 4, 7, 26, 27, 28, 38, 39, 61, |
| 119, 153, 182, 183, 184, 184, 184, 184, 145, 112, |
| 140, 112, 140, 184, 116, 112, 36, 112, 112, 112, |
| 112, 112, 112, 112, 184, 184, 184, 112, 145, 147, |
| 185, 24, 112, 143, 143, 143, 114, 114, 114, 114, |
| 114, 114, 118, 152, 154, 154, 122, 154, 24, 114, |
| 114, 114, 114, 143, 118, 120, 168, 169, 112, 115, |
| 37, 63, 181, 154, 112, 112, 184, 15, 57, 15, |
| 112, 197, 184, 116, 147, 185, 147, 185, 185, 185, |
| 147, 147, 112, 112, 112, 185, 184, 184, 112, 34, |
| 57, 141, 144, 152, 152, 152, 152, 152, 152, 112, |
| 118, 120, 122, 152, 152, 152, 152, 37, 170, 141, |
| 142, 24, 120, 21, 21, 114, 184, 4, 184, 185, |
| 193, 112, 184, 112, 112, 112, 184, 184, 184, 114, |
| 147, 24, 4, 143, 197, 36, 112, 112, 112, 112, |
| 152, 112, 112, 112, 112, 57, 139, 112, 184, 184, |
| 193, 194, 112, 140, 140, 112, 184, 112, 185, 185, |
| 185, 194, 184, 115, 147, 152, 152, 152, 152, 152, |
| 152, 152, 152, 4, 24, 112, 116, 115, 185, 118, |
| 184, 115, 115, 112, 115, 112, 112, 115, 115, 115, |
| 115, 21, 118, 134, 190, 36, 118, 152, 152, 152, |
| 184, 182, 118, 134, 21, 115, 115, 115, 112, 182, |
| 184, 21, 112, 76, 184, 21, 21, 184, 184 |
| }; |
| |
| #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 yyerrorlab |
| |
| |
| /* 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); \ |
| yytoken = YYTRANSLATE (yychar); \ |
| YYPOPSTACK; \ |
| goto yybackup; \ |
| } \ |
| else \ |
| { \ |
| yyerror (YY_("syntax error: cannot back up")); \ |
| YYERROR; \ |
| } \ |
| while (0) |
| |
| |
| #define YYTERROR 1 |
| #define YYERRCODE 256 |
| |
| |
| /* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N]. |
| If N is 0, then set CURRENT to the empty location which ends |
| the previous symbol: RHS[0] (always defined). */ |
| |
| #define YYRHSLOC(Rhs, K) ((Rhs)[K]) |
| #ifndef YYLLOC_DEFAULT |
| # define YYLLOC_DEFAULT(Current, Rhs, N) \ |
| do \ |
| if (N) \ |
| { \ |
| (Current).first_line = YYRHSLOC (Rhs, 1).first_line; \ |
| (Current).first_column = YYRHSLOC (Rhs, 1).first_column; \ |
| (Current).last_line = YYRHSLOC (Rhs, N).last_line; \ |
| (Current).last_column = YYRHSLOC (Rhs, N).last_column; \ |
| } \ |
| else \ |
| { \ |
| (Current).first_line = (Current).last_line = \ |
| YYRHSLOC (Rhs, 0).last_line; \ |
| (Current).first_column = (Current).last_column = \ |
| YYRHSLOC (Rhs, 0).last_column; \ |
| } \ |
| while (0) |
| #endif |
| |
| |
| /* YY_LOCATION_PRINT -- Print the location on the stream. |
| This macro was not mandated originally: define only if we know |
| we won't break user code: when these are the locations we know. */ |
| |
| #ifndef YY_LOCATION_PRINT |
| # if YYLTYPE_IS_TRIVIAL |
| # define YY_LOCATION_PRINT(File, Loc) \ |
| fprintf (File, "%d.%d-%d.%d", \ |
| (Loc).first_line, (Loc).first_column, \ |
| (Loc).last_line, (Loc).last_column) |
| # else |
| # define YY_LOCATION_PRINT(File, Loc) ((void) 0) |
| # endif |
| #endif |
| |
| |
| /* YYLEX -- calling `yylex' with the right arguments. */ |
| |
| #ifdef YYLEX_PARAM |
| # define YYLEX yylex (YYLEX_PARAM) |
| #else |
| # define YYLEX yylex () |
| #endif |
| |
| /* Enable debugging if requested. */ |
| #if YYDEBUG |
| |
| # ifndef YYFPRINTF |
| # include <stdio.h> /* INFRINGES ON USER NAME SPACE */ |
| # define YYFPRINTF fprintf |
| # endif |
| |
| # define YYDPRINTF(Args) \ |
| do { \ |
| if (yydebug) \ |
| YYFPRINTF Args; \ |
| } while (0) |
| |
| # define YY_SYMBOL_PRINT(Title, Type, Value, Location) \ |
| do { \ |
| if (yydebug) \ |
| { \ |
| YYFPRINTF (stderr, "%s ", Title); \ |
| yysymprint (stderr, \ |
| Type, Value); \ |
| YYFPRINTF (stderr, "\n"); \ |
| } \ |
| } while (0) |
| |
| /*------------------------------------------------------------------. |
| | yy_stack_print -- Print the state stack from its BOTTOM up to its | |
| | TOP (included). | |
| `------------------------------------------------------------------*/ |
| |
| #if defined (__STDC__) || defined (__cplusplus) |
| static void |
| yy_stack_print (short int *bottom, short int *top) |
| #else |
| static void |
| yy_stack_print (bottom, top) |
| short int *bottom; |
| short int *top; |
| #endif |
| { |
| YYFPRINTF (stderr, "Stack now"); |
| for (/* Nothing. */; bottom <= top; ++bottom) |
| YYFPRINTF (stderr, " %d", *bottom); |
| YYFPRINTF (stderr, "\n"); |
| } |
| |
| # define YY_STACK_PRINT(Bottom, Top) \ |
| do { \ |
| if (yydebug) \ |
| yy_stack_print ((Bottom), (Top)); \ |
| } while (0) |
| |
| |
| /*------------------------------------------------. |
| | Report that the YYRULE is going to be reduced. | |
| `------------------------------------------------*/ |
| |
| #if defined (__STDC__) || defined (__cplusplus) |
| static void |
| yy_reduce_print (int yyrule) |
| #else |
| static void |
| yy_reduce_print (yyrule) |
| int yyrule; |
| #endif |
| { |
| int yyi; |
| unsigned long int yylno = yyrline[yyrule]; |
| YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu), ", |
| yyrule - 1, yylno); |
| /* Print the symbols being reduced, and their result. */ |
| for (yyi = yyprhs[yyrule]; 0 <= yyrhs[yyi]; yyi++) |
| YYFPRINTF (stderr, "%s ", yytname[yyrhs[yyi]]); |
| YYFPRINTF (stderr, "-> %s\n", yytname[yyr1[yyrule]]); |
| } |
| |
| # define YY_REDUCE_PRINT(Rule) \ |
| do { \ |
| if (yydebug) \ |
| yy_reduce_print (Rule); \ |
| } while (0) |
| |
| /* Nonzero means print parse trace. It is left uninitialized so that |
| multiple parsers can coexist. */ |
| int yydebug; |
| #else /* !YYDEBUG */ |
| # define YYDPRINTF(Args) |
| # define YY_SYMBOL_PRINT(Title, Type, Value, Location) |
| # define YY_STACK_PRINT(Bottom, Top) |
| # define YY_REDUCE_PRINT(Rule) |
| #endif /* !YYDEBUG */ |
| |
| |
| /* YYINITDEPTH -- initial size of the parser's stacks. */ |
| #ifndef YYINITDEPTH |
| # define YYINITDEPTH 200 |
| #endif |
| |
| /* YYMAXDEPTH -- maximum size the stacks can grow to (effective only |
| if the built-in stack extension method is used). |
| |
| Do not make this value too large; the results are undefined if |
| YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH) |
| evaluated with infinite-precision integer arithmetic. */ |
| |
| #ifndef YYMAXDEPTH |
| # define YYMAXDEPTH 10000 |
| #endif |
| |
| |
| |
| #if YYERROR_VERBOSE |
| |
| # ifndef yystrlen |
| # if defined (__GLIBC__) && defined (_STRING_H) |
| # define yystrlen strlen |
| # else |
| /* Return the length of YYSTR. */ |
| static YYSIZE_T |
| # if defined (__STDC__) || defined (__cplusplus) |
| yystrlen (const char *yystr) |
| # else |
| yystrlen (yystr) |
| const char *yystr; |
| # endif |
| { |
| const char *yys = yystr; |
| |
| while (*yys++ != '\0') |
| continue; |
| |
| return yys - yystr - 1; |
| } |
| # endif |
| # endif |
| |
| # ifndef yystpcpy |
| # if defined (__GLIBC__) && defined (_STRING_H) && defined (_GNU_SOURCE) |
| # define yystpcpy stpcpy |
| # else |
| /* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in |
| YYDEST. */ |
| static char * |
| # if defined (__STDC__) || defined (__cplusplus) |
| yystpcpy (char *yydest, const char *yysrc) |
| # else |
| yystpcpy (yydest, yysrc) |
| char *yydest; |
| const char *yysrc; |
| # endif |
| { |
| char *yyd = yydest; |
| const char *yys = yysrc; |
| |
| while ((*yyd++ = *yys++) != '\0') |
| continue; |
| |
| return yyd - 1; |
| } |
| # endif |
| # endif |
| |
| # ifndef yytnamerr |
| /* Copy to YYRES the contents of YYSTR after stripping away unnecessary |
| quotes and backslashes, so that it's suitable for yyerror. The |
| heuristic is that double-quoting is unnecessary unless the string |
| contains an apostrophe, a comma, or backslash (other than |
| backslash-backslash). YYSTR is taken from yytname. If YYRES is |
| null, do not copy; instead, return the length of what the result |
| would have been. */ |
| static YYSIZE_T |
| yytnamerr (char *yyres, const char *yystr) |
| { |
| if (*yystr == '"') |
| { |
| size_t yyn = 0; |
| char const *yyp = yystr; |
| |
| for (;;) |
| switch (*++yyp) |
| { |
| case '\'': |
| case ',': |
| goto do_not_strip_quotes; |
| |
| case '\\': |
| if (*++yyp != '\\') |
| goto do_not_strip_quotes; |
| /* Fall through. */ |
| default: |
| if (yyres) |
| yyres[yyn] = *yyp; |
| yyn++; |
| break; |
| |
| case '"': |
| if (yyres) |
| yyres[yyn] = '\0'; |
| return yyn; |
| } |
| do_not_strip_quotes: ; |
| } |
| |
| if (! yyres) |
| return yystrlen (yystr); |
| |
| return yystpcpy (yyres, yystr) - yyres; |
| } |
| # endif |
| |
| #endif /* YYERROR_VERBOSE */ |
| |
| |
| |
| #if YYDEBUG |
| /*--------------------------------. |
| | Print this symbol on YYOUTPUT. | |
| `--------------------------------*/ |
| |
| #if defined (__STDC__) || defined (__cplusplus) |
| static void |
| yysymprint (FILE *yyoutput, int yytype, YYSTYPE *yyvaluep) |
| #else |
| static void |
| yysymprint (yyoutput, yytype, yyvaluep) |
| FILE *yyoutput; |
| int yytype; |
| YYSTYPE *yyvaluep; |
| #endif |
| { |
| /* Pacify ``unused variable'' warnings. */ |
| (void) yyvaluep; |
| |
| if (yytype < YYNTOKENS) |
| YYFPRINTF (yyoutput, "token %s (", yytname[yytype]); |
| else |
| YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]); |
| |
| |
| # ifdef YYPRINT |
| if (yytype < YYNTOKENS) |
| YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep); |
| # endif |
| switch (yytype) |
| { |
| default: |
| break; |
| } |
| YYFPRINTF (yyoutput, ")"); |
| } |
| |
| #endif /* ! YYDEBUG */ |
| /*-----------------------------------------------. |
| | Release the memory associated to this symbol. | |
| `-----------------------------------------------*/ |
| |
| #if defined (__STDC__) || defined (__cplusplus) |
| static void |
| yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep) |
| #else |
| static void |
| yydestruct (yymsg, yytype, yyvaluep) |
| const char *yymsg; |
| int yytype; |
| YYSTYPE *yyvaluep; |
| #endif |
| { |
| /* Pacify ``unused variable'' warnings. */ |
| (void) yyvaluep; |
| |
| if (!yymsg) |
| yymsg = "Deleting"; |
| YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp); |
| |
| switch (yytype) |
| { |
| |
| default: |
| break; |
| } |
| } |
| |
| |
| /* Prevent warnings from -Wmissing-prototypes. */ |
| |
| #ifdef YYPARSE_PARAM |
| # if defined (__STDC__) || defined (__cplusplus) |
| int yyparse (void *YYPARSE_PARAM); |
| # else |
| int yyparse (); |
| # endif |
| #else /* ! YYPARSE_PARAM */ |
| #if defined (__STDC__) || defined (__cplusplus) |
| int yyparse (void); |
| #else |
| int yyparse (); |
| #endif |
| #endif /* ! YYPARSE_PARAM */ |
| |
| |
| |
| /* The look-ahead symbol. */ |
| int yychar; |
| |
| /* The semantic value of the look-ahead symbol. */ |
| YYSTYPE yylval; |
| |
| /* Number of syntax errors so far. */ |
| int yynerrs; |
| |
| |
| |
| /*----------. |
| | yyparse. | |
| `----------*/ |
| |
| #ifdef YYPARSE_PARAM |
| # if defined (__STDC__) || defined (__cplusplus) |
| int yyparse (void *YYPARSE_PARAM) |
| # else |
| int yyparse (YYPARSE_PARAM) |
| void *YYPARSE_PARAM; |
| # endif |
| #else /* ! YYPARSE_PARAM */ |
| #if defined (__STDC__) || defined (__cplusplus) |
| int |
| yyparse (void) |
| #else |
| int |
| yyparse () |
| |
| #endif |
| #endif |
| { |
| |
| int yystate; |
| int yyn; |
| int yyresult; |
| /* Number of tokens to shift before error messages enabled. */ |
| int yyerrstatus; |
| /* Look-ahead token as an internal (translated) token number. */ |
| int yytoken = 0; |
| |
| /* Three stacks and their tools: |
| `yyss': related to states, |
| `yyvs': related to semantic values, |
| `yyls': related to locations. |
| |
| Refer to the stacks thru separate pointers, to allow yyoverflow |
| to reallocate them elsewhere. */ |
| |
| /* The state stack. */ |
| short int yyssa[YYINITDEPTH]; |
| short int *yyss = yyssa; |
| short int *yyssp; |
| |
| /* The semantic value stack. */ |
| YYSTYPE yyvsa[YYINITDEPTH]; |
| YYSTYPE *yyvs = yyvsa; |
| YYSTYPE *yyvsp; |
| |
| |
| |
| #define YYPOPSTACK (yyvsp--, yyssp--) |
| |
| YYSIZE_T yystacksize = YYINITDEPTH; |
| |
| /* The variables used to return semantic value and location from the |
| action routines. */ |
| YYSTYPE yyval; |
| |
| |
| /* When reducing, the number of symbols on the RHS of the reduced |
| rule. */ |
| int yylen; |
| |
| YYDPRINTF ((stderr, "Starting parse\n")); |
| |
| 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; |
| yyvsp = yyvs; |
| |
| goto yysetstate; |
| |
| /*------------------------------------------------------------. |
| | yynewstate -- Push a new state, which is found in yystate. | |
| `------------------------------------------------------------*/ |
| yynewstate: |
| /* In all cases, when you get here, the value and location stacks |
| have just been pushed. so pushing a state here evens the stacks. |
| */ |
| yyssp++; |
| |
| yysetstate: |
| *yyssp = yystate; |
| |
| if (yyss + yystacksize - 1 <= yyssp) |
| { |
| /* Get the current used size of the three stacks, in elements. */ |
| YYSIZE_T yysize = yyssp - yyss + 1; |
| |
| #ifdef yyoverflow |
| { |
| /* 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 int *yyss1 = yyss; |
| |
| |
| /* Each stack pointer address is followed by the size of the |
| data in use in that stack, in bytes. This used to be a |
| conditional around just the two extra args, but that might |
| be undefined if yyoverflow is a macro. */ |
| yyoverflow (YY_("memory exhausted"), |
| &yyss1, yysize * sizeof (*yyssp), |
| &yyvs1, yysize * sizeof (*yyvsp), |
| |
| &yystacksize); |
| |
| yyss = yyss1; |
| yyvs = yyvs1; |
| } |
| #else /* no yyoverflow */ |
| # ifndef YYSTACK_RELOCATE |
| goto yyexhaustedlab; |
| # else |
| /* Extend the stack our own way. */ |
| if (YYMAXDEPTH <= yystacksize) |
| goto yyexhaustedlab; |
| yystacksize *= 2; |
| if (YYMAXDEPTH < yystacksize) |
| yystacksize = YYMAXDEPTH; |
| |
| { |
| short int *yyss1 = yyss; |
| union yyalloc *yyptr = |
| (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); |
| if (! yyptr) |
| goto yyexhaustedlab; |
| YYSTACK_RELOCATE (yyss); |
| YYSTACK_RELOCATE (yyvs); |
| |
| # undef YYSTACK_RELOCATE |
| if (yyss1 != yyssa) |
| YYSTACK_FREE (yyss1); |
| } |
| # endif |
| #endif /* no yyoverflow */ |
| |
| yyssp = yyss + yysize - 1; |
| yyvsp = yyvs + yysize - 1; |
| |
| |
| YYDPRINTF ((stderr, "Stack size increased to %lu\n", |
| (unsigned long int) yystacksize)); |
| |
| if (yyss + yystacksize - 1 <= yyssp) |
| YYABORT; |
| } |
| |
| YYDPRINTF ((stderr, "Entering state %d\n", yystate)); |
| |
| goto yybackup; |
| |
| /*-----------. |
| | yybackup. | |
| `-----------*/ |
| yybackup: |
| |
| /* Do appropriate processing given the current state. */ |
| /* Read a look-ahead token if we need one and don't already have one. */ |
| /* yyresume: */ |
| |
| /* First try to decide what to do without reference to look-ahead token. */ |
| |
| yyn = yypact[yystate]; |
| if (yyn == YYPACT_NINF) |
| goto yydefault; |
| |
| /* Not known => get a look-ahead token if don't already have one. */ |
| |
| /* YYCHAR is either YYEMPTY or YYEOF or a valid look-ahead symbol. */ |
| if (yychar == YYEMPTY) |
| { |
| YYDPRINTF ((stderr, "Reading a token: ")); |
| yychar = YYLEX; |
| } |
| |
| if (yychar <= YYEOF) |
| { |
| yychar = yytoken = YYEOF; |
| YYDPRINTF ((stderr, "Now at end of input.\n")); |
| } |
| else |
| { |
| yytoken = YYTRANSLATE (yychar); |
| YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc); |
| } |
| |
| /* If the proper action on seeing token YYTOKEN is to reduce or to |
| detect an error, take that action. */ |
| yyn += yytoken; |
| if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken) |
| goto yydefault; |
| yyn = yytable[yyn]; |
| if (yyn <= 0) |
| { |
| if (yyn == 0 || yyn == YYTABLE_NINF) |
| goto yyerrlab; |
| yyn = -yyn; |
| goto yyreduce; |
| } |
| |
| if (yyn == YYFINAL) |
| YYACCEPT; |
| |
| /* Shift the look-ahead token. */ |
| YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc); |
| |
| /* Discard the token being shifted unless it is eof. */ |
| if (yychar != YYEOF) |
| yychar = YYEMPTY; |
| |
| *++yyvsp = yylval; |
| |
| |
| /* Count tokens shifted since error; after three, turn off error |
| status. */ |
| if (yyerrstatus) |
| yyerrstatus--; |
| |
| yystate = yyn; |
| goto yynewstate; |
| |
| |
| /*-----------------------------------------------------------. |
| | yydefault -- do the default action for the current state. | |
| `-----------------------------------------------------------*/ |
| yydefault: |
| yyn = yydefact[yystate]; |
| if (yyn == 0) |
| goto yyerrlab; |
| goto yyreduce; |
| |
| |
| /*-----------------------------. |
| | yyreduce -- Do a reduction. | |
| `-----------------------------*/ |
| yyreduce: |
| /* yyn is the number of a rule to reduce with. */ |
| yylen = yyr2[yyn]; |
| |
| /* If YYLEN is nonzero, implement the default value of the action: |
| `$$ = $1'. |
| |
| Otherwise, the following line sets YYVAL to garbage. |
| This behavior is undocumented and Bison |
| users should not rely upon it. Assigning to YYVAL |
| unconditionally makes the parser a bit smaller, and it avoids a |
| GCC warning that YYVAL may be used uninitialized. */ |
| yyval = yyvsp[1-yylen]; |
| |
| |
| YY_REDUCE_PRINT (yyn); |
| switch (yyn) |
| { |
| case 3: |
| #line 1135 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if ((yyvsp[0].UIntVal) > (uint32_t)INT32_MAX) // Outside of my range! |
| GEN_ERROR("Value too large for type!"); |
| (yyval.SIntVal) = (int32_t)(yyvsp[0].UIntVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 5: |
| #line 1144 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if ((yyvsp[0].UInt64Val) > (uint64_t)INT64_MAX) // Outside of my range! |
| GEN_ERROR("Value too large for type!"); |
| (yyval.SInt64Val) = (int64_t)(yyvsp[0].UInt64Val); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 36: |
| #line 1168 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.StrVal) = (yyvsp[-1].StrVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 37: |
| #line 1172 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.StrVal) = 0; |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 38: |
| #line 1177 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::InternalLinkage; ;} |
| break; |
| |
| case 39: |
| #line 1178 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::LinkOnceLinkage; ;} |
| break; |
| |
| case 40: |
| #line 1179 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::WeakLinkage; ;} |
| break; |
| |
| case 41: |
| #line 1180 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::AppendingLinkage; ;} |
| break; |
| |
| case 42: |
| #line 1181 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::DLLImportLinkage; ;} |
| break; |
| |
| case 43: |
| #line 1182 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::DLLExportLinkage; ;} |
| break; |
| |
| case 44: |
| #line 1183 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::ExternalWeakLinkage; ;} |
| break; |
| |
| case 45: |
| #line 1184 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::ExternalLinkage; ;} |
| break; |
| |
| case 46: |
| #line 1186 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.UIntVal) = CallingConv::C; ;} |
| break; |
| |
| case 47: |
| #line 1187 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.UIntVal) = CallingConv::C; ;} |
| break; |
| |
| case 48: |
| #line 1188 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.UIntVal) = CallingConv::CSRet; ;} |
| break; |
| |
| case 49: |
| #line 1189 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.UIntVal) = CallingConv::Fast; ;} |
| break; |
| |
| case 50: |
| #line 1190 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.UIntVal) = CallingConv::Cold; ;} |
| break; |
| |
| case 51: |
| #line 1191 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.UIntVal) = CallingConv::X86_StdCall; ;} |
| break; |
| |
| case 52: |
| #line 1192 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.UIntVal) = CallingConv::X86_FastCall; ;} |
| break; |
| |
| case 53: |
| #line 1193 "/proj/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 54: |
| #line 1202 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.UIntVal) = 0; ;} |
| break; |
| |
| case 55: |
| #line 1203 "/proj/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 56: |
| #line 1209 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.UIntVal) = 0; ;} |
| break; |
| |
| case 57: |
| #line 1210 "/proj/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 58: |
| #line 1218 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| for (unsigned i = 0, e = strlen((yyvsp[0].StrVal)); i != e; ++i) |
| if ((yyvsp[0].StrVal)[i] == '"' || (yyvsp[0].StrVal)[i] == '\\') |
| GEN_ERROR("Invalid character in section name!"); |
| (yyval.StrVal) = (yyvsp[0].StrVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 59: |
| #line 1226 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.StrVal) = 0; ;} |
| break; |
| |
| case 60: |
| #line 1227 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.StrVal) = (yyvsp[0].StrVal); ;} |
| break; |
| |
| case 61: |
| #line 1232 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| {;} |
| break; |
| |
| case 62: |
| #line 1233 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| {;} |
| break; |
| |
| case 63: |
| #line 1234 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| CurGV->setSection((yyvsp[0].StrVal)); |
| free((yyvsp[0].StrVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 64: |
| #line 1239 "/proj/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 66: |
| #line 1253 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.TypeVal) = new PATypeHolder((yyvsp[0].PrimType)); ;} |
| break; |
| |
| case 68: |
| #line 1254 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.TypeVal) = new PATypeHolder((yyvsp[0].PrimType)); ;} |
| break; |
| |
| case 69: |
| #line 1256 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[0].TypeVal))->getDescription()); |
| (yyval.TypeVal) = (yyvsp[0].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 83: |
| #line 1268 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.TypeVal) = new PATypeHolder(OpaqueType::get()); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 84: |
| #line 1272 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.TypeVal) = new PATypeHolder((yyvsp[0].PrimType)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 85: |
| #line 1276 "/proj/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 86: |
| #line 1284 "/proj/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 87: |
| #line 1292 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Function derived type? |
| std::vector<const Type*> Params; |
| for (std::list<llvm::PATypeHolder>::iterator I = (yyvsp[-1].TypeList)->begin(), |
| E = (yyvsp[-1].TypeList)->end(); I != E; ++I) |
| Params.push_back(*I); |
| bool isVarArg = Params.size() && Params.back() == Type::VoidTy; |
| if (isVarArg) Params.pop_back(); |
| |
| (yyval.TypeVal) = new PATypeHolder(HandleUpRefs(FunctionType::get(*(yyvsp[-3].TypeVal),Params,isVarArg))); |
| delete (yyvsp[-1].TypeList); // Delete the argument list |
| delete (yyvsp[-3].TypeVal); // Delete the return type handle |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 88: |
| #line 1305 "/proj/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 89: |
| #line 1310 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Packed array 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->isPrimitiveType()) |
| GEN_ERROR("Elemental type of a PackedType must be primitive"); |
| if (!isPowerOf2_32((yyvsp[-3].UInt64Val))) |
| GEN_ERROR("Vector length should be a power of 2!"); |
| (yyval.TypeVal) = new PATypeHolder(HandleUpRefs(PackedType::get(*(yyvsp[-1].TypeVal), (unsigned)(yyvsp[-3].UInt64Val)))); |
| delete (yyvsp[-1].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 90: |
| #line 1322 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Structure type? |
| std::vector<const Type*> Elements; |
| for (std::list<llvm::PATypeHolder>::iterator I = (yyvsp[-1].TypeList)->begin(), |
| E = (yyvsp[-1].TypeList)->end(); I != E; ++I) |
| Elements.push_back(*I); |
| |
| (yyval.TypeVal) = new PATypeHolder(HandleUpRefs(StructType::get(Elements))); |
| delete (yyvsp[-1].TypeList); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 91: |
| #line 1332 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Empty structure type? |
| (yyval.TypeVal) = new PATypeHolder(StructType::get(std::vector<const Type*>())); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 92: |
| #line 1336 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Pointer type? |
| if (*(yyvsp[-1].TypeVal) == Type::LabelTy) |
| GEN_ERROR("Cannot form a pointer to a basic block"); |
| (yyval.TypeVal) = new PATypeHolder(HandleUpRefs(PointerType::get(*(yyvsp[-1].TypeVal)))); |
| delete (yyvsp[-1].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 93: |
| #line 1347 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.TypeList) = new std::list<PATypeHolder>(); |
| (yyval.TypeList)->push_back(*(yyvsp[0].TypeVal)); delete (yyvsp[0].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 94: |
| #line 1352 "/proj/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 96: |
| #line 1359 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| ((yyval.TypeList)=(yyvsp[-2].TypeList))->push_back(Type::VoidTy); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 97: |
| #line 1363 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| ((yyval.TypeList) = new std::list<PATypeHolder>())->push_back(Type::VoidTy); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 98: |
| #line 1367 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.TypeList) = new std::list<PATypeHolder>(); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 99: |
| #line 1378 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Nonempty unsized arr |
| const ArrayType *ATy = dyn_cast<ArrayType>((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 100: |
| #line 1404 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| const ArrayType *ATy = dyn_cast<ArrayType>((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<Constant*>()); |
| delete (yyvsp[-2].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 101: |
| #line 1418 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| const ArrayType *ATy = dyn_cast<ArrayType>((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(); |
| char *EndStr = UnEscapeLexed((yyvsp[0].StrVal), true); |
| if (NumElements != -1 && NumElements != (EndStr-(yyvsp[0].StrVal))) |
| GEN_ERROR("Can't build string constant of size " + |
| itostr((int)(EndStr-(yyvsp[0].StrVal))) + |
| " when array has size " + itostr(NumElements) + "!"); |
| std::vector<Constant*> Vals; |
| if (ETy == Type::SByteTy) { |
| for (signed char *C = (signed char *)(yyvsp[0].StrVal); C != (signed char *)EndStr; ++C) |
| Vals.push_back(ConstantInt::get(ETy, *C)); |
| } else if (ETy == Type::UByteTy) { |
| for (unsigned char *C = (unsigned char *)(yyvsp[0].StrVal); |
| C != (unsigned char*)EndStr; ++C) |
| Vals.push_back(ConstantInt::get(ETy, *C)); |
| } else { |
| free((yyvsp[0].StrVal)); |
| GEN_ERROR("Cannot build string arrays of non byte sized elements!"); |
| } |
| free((yyvsp[0].StrVal)); |
| (yyval.ConstVal) = ConstantArray::get(ATy, Vals); |
| delete (yyvsp[-2].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 102: |
| #line 1448 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Nonempty unsized arr |
| const PackedType *PTy = dyn_cast<PackedType>((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) = ConstantPacked::get(PTy, *(yyvsp[-1].ConstVector)); |
| delete (yyvsp[-3].TypeVal); delete (yyvsp[-1].ConstVector); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 103: |
| #line 1474 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| const StructType *STy = dyn_cast<StructType>((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!"); |
| |
| (yyval.ConstVal) = ConstantStruct::get(STy, *(yyvsp[-1].ConstVector)); |
| delete (yyvsp[-3].TypeVal); delete (yyvsp[-1].ConstVector); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 104: |
| #line 1495 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| const StructType *STy = dyn_cast<StructType>((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!"); |
| |
| (yyval.ConstVal) = ConstantStruct::get(STy, std::vector<Constant*>()); |
| delete (yyvsp[-2].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 105: |
| #line 1508 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| const PointerType *PTy = dyn_cast<PointerType>((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 106: |
| #line 1518 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ConstVal) = UndefValue::get((yyvsp[-1].TypeVal)->get()); |
| delete (yyvsp[-1].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 107: |
| #line 1523 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| const PointerType *Ty = dyn_cast<PointerType>((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, getValNonImprovising will search the functions |
| // symbol table instead of the module symbol table for the global symbol, |
| // which throws things all off. To get around this, we just tell |
| // getValNonImprovising that we are at global scope here. |
| // |
| Function *SavedCurFn = CurFun.CurrentFunction; |
| CurFun.CurrentFunction = 0; |
| |
| Value *V = getValNonImprovising(Ty, (yyvsp[0].ValIDVal)); |
| 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<PointerType>(Ty) && "Globals may only be used as pointers!"); |
| const PointerType *PT = cast<PointerType>(Ty); |
| |
| // First check to see if the forward references value is already created! |
| PerModuleInfo::GlobalRefsType::iterator I = |
| CurModule.GlobalRefs.find(std::make_pair(PT, (yyvsp[0].ValIDVal))); |
| |
| if (I != CurModule.GlobalRefs.end()) { |
| V = I->second; // Placeholder already exists, use it... |
| (yyvsp[0].ValIDVal).destroy(); |
| } else { |
| std::string Name; |
| if ((yyvsp[0].ValIDVal).Type == ValID::NameVal) Name = (yyvsp[0].ValIDVal).Name; |
| |
| // Create the forward referenced global. |
| GlobalValue *GV; |
| if (const FunctionType *FTy = |
| dyn_cast<FunctionType>(PT->getElementType())) { |
| GV = new Function(FTy, GlobalValue::ExternalLinkage, Name, |
| CurModule.CurrentModule); |
| } else { |
| GV = new GlobalVariable(PT->getElementType(), false, |
| GlobalValue::ExternalLinkage, 0, |
| Name, CurModule.CurrentModule); |
| } |
| |
| // Keep track of the fact that we have a forward ref to recycle it |
| CurModule.GlobalRefs.insert(std::make_pair(std::make_pair(PT, (yyvsp[0].ValIDVal)), GV)); |
| V = GV; |
| } |
| } |
| |
| (yyval.ConstVal) = cast<GlobalValue>(V); |
| delete (yyvsp[-1].TypeVal); // Free the type handle |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 108: |
| #line 1584 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if ((yyvsp[-1].TypeVal)->get() != (yyvsp[0].ConstVal)->getType()) |
| GEN_ERROR("Mismatched types for constant expression!"); |
| (yyval.ConstVal) = (yyvsp[0].ConstVal); |
| delete (yyvsp[-1].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 109: |
| #line 1591 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| const Type *Ty = (yyvsp[-1].TypeVal)->get(); |
| if (isa<FunctionType>(Ty) || Ty == Type::LabelTy || isa<OpaqueType>(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 110: |
| #line 1600 "/proj/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)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 111: |
| #line 1606 "/proj/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)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 112: |
| #line 1612 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Boolean constants |
| (yyval.ConstVal) = ConstantBool::getTrue(); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 113: |
| #line 1616 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Boolean constants |
| (yyval.ConstVal) = ConstantBool::getFalse(); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 114: |
| #line 1620 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Float & Double constants |
| if (!ConstantFP::isValueValidForType((yyvsp[-1].PrimType), (yyvsp[0].FPVal))) |
| GEN_ERROR("Floating point constant invalid for type!!"); |
| (yyval.ConstVal) = ConstantFP::get((yyvsp[-1].PrimType), (yyvsp[0].FPVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 115: |
| #line 1628 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!(yyvsp[-3].ConstVal)->getType()->isFirstClassType()) |
| GEN_ERROR("cast constant expression from a non-primitive type: '" + |
| (yyvsp[-3].ConstVal)->getType()->getDescription() + "'!"); |
| if (!(yyvsp[-1].TypeVal)->get()->isFirstClassType()) |
| GEN_ERROR("cast constant expression to a non-primitive type: '" + |
| (yyvsp[-1].TypeVal)->get()->getDescription() + "'!"); |
| (yyval.ConstVal) = ConstantExpr::getCast((yyvsp[-3].ConstVal), (yyvsp[-1].TypeVal)->get()); |
| delete (yyvsp[-1].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 116: |
| #line 1639 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!isa<PointerType>((yyvsp[-2].ConstVal)->getType())) |
| GEN_ERROR("GetElementPtr requires a pointer operand!"); |
| |
| // LLVM 1.2 and earlier used ubyte struct indices. Convert any ubyte struct |
| // indices to uint struct indices for compatibility. |
| generic_gep_type_iterator<std::vector<Value*>::iterator> |
| GTI = gep_type_begin((yyvsp[-2].ConstVal)->getType(), (yyvsp[-1].ValueList)->begin(), (yyvsp[-1].ValueList)->end()), |
| GTE = gep_type_end((yyvsp[-2].ConstVal)->getType(), (yyvsp[-1].ValueList)->begin(), (yyvsp[-1].ValueList)->end()); |
| for (unsigned i = 0, e = (yyvsp[-1].ValueList)->size(); i != e && GTI != GTE; ++i, ++GTI) |
| if (isa<StructType>(*GTI)) // Only change struct indices |
| if (ConstantInt *CUI = dyn_cast<ConstantInt>((*(yyvsp[-1].ValueList))[i])) |
| if (CUI->getType() == Type::UByteTy) |
| (*(yyvsp[-1].ValueList))[i] = ConstantExpr::getCast(CUI, Type::UIntTy); |
| |
| const Type *IdxTy = |
| GetElementPtrInst::getIndexedType((yyvsp[-2].ConstVal)->getType(), *(yyvsp[-1].ValueList), true); |
| if (!IdxTy) |
| GEN_ERROR("Index list invalid for constant getelementptr!"); |
| |
| std::vector<Constant*> IdxVec; |
| for (unsigned i = 0, e = (yyvsp[-1].ValueList)->size(); i != e; ++i) |
| if (Constant *C = dyn_cast<Constant>((*(yyvsp[-1].ValueList))[i])) |
| IdxVec.push_back(C); |
| else |
| GEN_ERROR("Indices to constant getelementptr must be constants!"); |
| |
| delete (yyvsp[-1].ValueList); |
| |
| (yyval.ConstVal) = ConstantExpr::getGetElementPtr((yyvsp[-2].ConstVal), IdxVec); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 117: |
| #line 1671 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if ((yyvsp[-5].ConstVal)->getType() != Type::BoolTy) |
| 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 118: |
| #line 1679 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if ((yyvsp[-3].ConstVal)->getType() != (yyvsp[-1].ConstVal)->getType()) |
| GEN_ERROR("Binary operator types must match!"); |
| // First, make sure we're dealing with the right opcode by upgrading from |
| // obsolete versions. |
| sanitizeOpCode((yyvsp[-5].BinaryOpVal),(yyvsp[-3].ConstVal)->getType()); |
| CHECK_FOR_ERROR; |
| |
| // HACK: llvm 1.3 and earlier used to emit invalid pointer constant exprs. |
| // To retain backward compatibility with these early compilers, we emit a |
| // cast to the appropriate integer type automatically if we are in the |
| // broken case. See PR424 for more information. |
| if (!isa<PointerType>((yyvsp[-3].ConstVal)->getType())) { |
| (yyval.ConstVal) = ConstantExpr::get((yyvsp[-5].BinaryOpVal).opcode, (yyvsp[-3].ConstVal), (yyvsp[-1].ConstVal)); |
| } else { |
| const Type *IntPtrTy = 0; |
| switch (CurModule.CurrentModule->getPointerSize()) { |
| case Module::Pointer32: IntPtrTy = Type::IntTy; break; |
| case Module::Pointer64: IntPtrTy = Type::LongTy; break; |
| default: GEN_ERROR("invalid pointer binary constant expr!"); |
| } |
| (yyval.ConstVal) = ConstantExpr::get((yyvsp[-5].BinaryOpVal).opcode, ConstantExpr::getCast((yyvsp[-3].ConstVal), IntPtrTy), |
| ConstantExpr::getCast((yyvsp[-1].ConstVal), IntPtrTy)); |
| (yyval.ConstVal) = ConstantExpr::getCast((yyval.ConstVal), (yyvsp[-3].ConstVal)->getType()); |
| } |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 119: |
| #line 1706 "/proj/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()->isIntegral()) { |
| if (!isa<PackedType>((yyvsp[-3].ConstVal)->getType()) || |
| !cast<PackedType>((yyvsp[-3].ConstVal)->getType())->getElementType()->isIntegral()) |
| GEN_ERROR("Logical operator requires integral operands!"); |
| } |
| (yyval.ConstVal) = ConstantExpr::get((yyvsp[-5].BinaryOpVal).opcode, (yyvsp[-3].ConstVal), (yyvsp[-1].ConstVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 120: |
| #line 1717 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if ((yyvsp[-3].ConstVal)->getType() != (yyvsp[-1].ConstVal)->getType()) |
| GEN_ERROR("setcc operand types must match!"); |
| (yyval.ConstVal) = ConstantExpr::get((yyvsp[-5].BinaryOpVal).opcode, (yyvsp[-3].ConstVal), (yyvsp[-1].ConstVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 121: |
| #line 1723 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if ((yyvsp[-1].ConstVal)->getType() != Type::UByteTy) |
| GEN_ERROR("Shift count for shift constant must be unsigned byte!"); |
| if (!(yyvsp[-3].ConstVal)->getType()->isInteger()) |
| GEN_ERROR("Shift constant expression requires integer operand!"); |
| (yyval.ConstVal) = ConstantExpr::get((yyvsp[-5].OtherOpVal).opcode, (yyvsp[-3].ConstVal), (yyvsp[-1].ConstVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 122: |
| #line 1731 "/proj/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 123: |
| #line 1737 "/proj/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 124: |
| #line 1743 "/proj/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 125: |
| #line 1752 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| ((yyval.ConstVector) = (yyvsp[-2].ConstVector))->push_back((yyvsp[0].ConstVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 126: |
| #line 1756 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ConstVector) = new std::vector<Constant*>(); |
| (yyval.ConstVector)->push_back((yyvsp[0].ConstVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 127: |
| #line 1764 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.BoolVal) = false; ;} |
| break; |
| |
| case 128: |
| #line 1764 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.BoolVal) = true; ;} |
| break; |
| |
| case 129: |
| #line 1774 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ModuleVal) = ParserResult = (yyvsp[0].ModuleVal); |
| CurModule.ModuleDone(); |
| CHECK_FOR_ERROR; |
| ;} |
| break; |
| |
| case 130: |
| #line 1782 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ModuleVal) = (yyvsp[-1].ModuleVal); |
| CurFun.FunctionDone(); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 131: |
| #line 1787 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ModuleVal) = (yyvsp[-1].ModuleVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 132: |
| #line 1791 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ModuleVal) = (yyvsp[-3].ModuleVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 133: |
| #line 1795 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ModuleVal) = (yyvsp[-1].ModuleVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 134: |
| #line 1799 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ModuleVal) = CurModule.CurrentModule; |
| // Emit an error if there are any unresolved types left. |
| if (!CurModule.LateResolveTypes.empty()) { |
| const ValID &DID = CurModule.LateResolveTypes.begin()->first; |
| if (DID.Type == ValID::NameVal) { |
| GEN_ERROR("Reference to an undefined type: '"+DID.getName() + "'"); |
| } else { |
| GEN_ERROR("Reference to an undefined type: #" + itostr(DID.Num)); |
| } |
| } |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 135: |
| #line 1814 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| // Eagerly resolve types. This is not an optimization, this is a |
| // requirement that is due to the fact that we could have this: |
| // |
| // %list = type { %list * } |
| // %list = type { %list * } ; repeated type decl |
| // |
| // If types are not resolved eagerly, then the two types will not be |
| // determined to be the same type! |
| // |
| ResolveTypeTo((yyvsp[-2].StrVal), *(yyvsp[0].TypeVal)); |
| |
| if (!setTypeName(*(yyvsp[0].TypeVal), (yyvsp[-2].StrVal)) && !(yyvsp[-2].StrVal)) { |
| 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 136: |
| #line 1836 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Function prototypes can be in const pool |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 137: |
| #line 1839 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Asm blocks can be in the const pool |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 138: |
| #line 1842 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if ((yyvsp[0].ConstVal) == 0) |
| GEN_ERROR("Global value initializer is not a constant!"); |
| CurGV = ParseGlobalVariable((yyvsp[-3].StrVal), (yyvsp[-2].Linkage), (yyvsp[-1].BoolVal), (yyvsp[0].ConstVal)->getType(), (yyvsp[0].ConstVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 139: |
| #line 1847 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| CurGV = 0; |
| ;} |
| break; |
| |
| case 140: |
| #line 1850 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| CurGV = ParseGlobalVariable((yyvsp[-3].StrVal), GlobalValue::ExternalLinkage, (yyvsp[-1].BoolVal), *(yyvsp[0].TypeVal), 0); |
| CHECK_FOR_ERROR |
| delete (yyvsp[0].TypeVal); |
| ;} |
| break; |
| |
| case 141: |
| #line 1854 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| CurGV = 0; |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 142: |
| #line 1858 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| CurGV = ParseGlobalVariable((yyvsp[-3].StrVal), GlobalValue::DLLImportLinkage, (yyvsp[-1].BoolVal), *(yyvsp[0].TypeVal), 0); |
| CHECK_FOR_ERROR |
| delete (yyvsp[0].TypeVal); |
| ;} |
| break; |
| |
| case 143: |
| #line 1862 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| CurGV = 0; |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 144: |
| #line 1866 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| CurGV = |
| ParseGlobalVariable((yyvsp[-3].StrVal), GlobalValue::ExternalWeakLinkage, (yyvsp[-1].BoolVal), *(yyvsp[0].TypeVal), 0); |
| CHECK_FOR_ERROR |
| delete (yyvsp[0].TypeVal); |
| ;} |
| break; |
| |
| case 145: |
| #line 1871 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| CurGV = 0; |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 146: |
| #line 1875 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 147: |
| #line 1878 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 148: |
| #line 1881 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| ;} |
| break; |
| |
| case 149: |
| #line 1885 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| const std::string &AsmSoFar = CurModule.CurrentModule->getModuleInlineAsm(); |
| char *EndStr = UnEscapeLexed((yyvsp[0].StrVal), true); |
| std::string NewAsm((yyvsp[0].StrVal), EndStr); |
| free((yyvsp[0].StrVal)); |
| |
| if (AsmSoFar.empty()) |
| CurModule.CurrentModule->setModuleInlineAsm(NewAsm); |
| else |
| CurModule.CurrentModule->setModuleInlineAsm(AsmSoFar+"\n"+NewAsm); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 150: |
| #line 1898 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Endianness) = Module::BigEndian; ;} |
| break; |
| |
| case 151: |
| #line 1899 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Endianness) = Module::LittleEndian; ;} |
| break; |
| |
| case 152: |
| #line 1901 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| CurModule.CurrentModule->setEndianness((yyvsp[0].Endianness)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 153: |
| #line 1905 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if ((yyvsp[0].UInt64Val) == 32) |
| CurModule.CurrentModule->setPointerSize(Module::Pointer32); |
| else if ((yyvsp[0].UInt64Val) == 64) |
| CurModule.CurrentModule->setPointerSize(Module::Pointer64); |
| else |
| GEN_ERROR("Invalid pointer size: '" + utostr((yyvsp[0].UInt64Val)) + "'!"); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 154: |
| #line 1914 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| CurModule.CurrentModule->setTargetTriple((yyvsp[0].StrVal)); |
| free((yyvsp[0].StrVal)); |
| ;} |
| break; |
| |
| case 155: |
| #line 1918 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| CurModule.CurrentModule->setDataLayout((yyvsp[0].StrVal)); |
| free((yyvsp[0].StrVal)); |
| ;} |
| break; |
| |
| case 157: |
| #line 1925 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| CurModule.CurrentModule->addLibrary((yyvsp[0].StrVal)); |
| free((yyvsp[0].StrVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 158: |
| #line 1930 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| CurModule.CurrentModule->addLibrary((yyvsp[0].StrVal)); |
| free((yyvsp[0].StrVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 159: |
| #line 1935 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 163: |
| #line 1945 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.StrVal) = 0; ;} |
| break; |
| |
| case 164: |
| #line 1947 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (*(yyvsp[-1].TypeVal) == Type::VoidTy) |
| GEN_ERROR("void typed arguments are invalid!"); |
| (yyval.ArgVal) = new std::pair<PATypeHolder*, char*>((yyvsp[-1].TypeVal), (yyvsp[0].StrVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 165: |
| #line 1954 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ArgList) = (yyvsp[-2].ArgList); |
| (yyvsp[-2].ArgList)->push_back(*(yyvsp[0].ArgVal)); |
| delete (yyvsp[0].ArgVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 166: |
| #line 1960 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ArgList) = new std::vector<std::pair<PATypeHolder*,char*> >(); |
| (yyval.ArgList)->push_back(*(yyvsp[0].ArgVal)); |
| delete (yyvsp[0].ArgVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 167: |
| #line 1967 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ArgList) = (yyvsp[0].ArgList); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 168: |
| #line 1971 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ArgList) = (yyvsp[-2].ArgList); |
| (yyval.ArgList)->push_back(std::pair<PATypeHolder*, |
| char*>(new PATypeHolder(Type::VoidTy), 0)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 169: |
| #line 1977 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ArgList) = new std::vector<std::pair<PATypeHolder*,char*> >(); |
| (yyval.ArgList)->push_back(std::make_pair(new PATypeHolder(Type::VoidTy), (char*)0)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 170: |
| #line 1982 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ArgList) = 0; |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 171: |
| #line 1988 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| UnEscapeLexed((yyvsp[-5].StrVal)); |
| std::string FunctionName((yyvsp[-5].StrVal)); |
| free((yyvsp[-5].StrVal)); // Free strdup'd memory! |
| |
| if (!(*(yyvsp[-6].TypeVal))->isFirstClassType() && *(yyvsp[-6].TypeVal) != Type::VoidTy) |
| GEN_ERROR("LLVM functions cannot return aggregate types!"); |
| |
| std::vector<const Type*> ParamTypeList; |
| if ((yyvsp[-3].ArgList)) { // If there are arguments... |
| for (std::vector<std::pair<PATypeHolder*,char*> >::iterator I = (yyvsp[-3].ArgList)->begin(); |
| I != (yyvsp[-3].ArgList)->end(); ++I) |
| ParamTypeList.push_back(I->first->get()); |
| } |
| |
| bool isVarArg = ParamTypeList.size() && ParamTypeList.back() == Type::VoidTy; |
| if (isVarArg) ParamTypeList.pop_back(); |
| |
| const FunctionType *FT = FunctionType::get(*(yyvsp[-6].TypeVal), ParamTypeList, isVarArg); |
| const PointerType *PFT = PointerType::get(FT); |
| delete (yyvsp[-6].TypeVal); |
| |
| ValID ID; |
| if (!FunctionName.empty()) { |
| ID = ValID::create((char*)FunctionName.c_str()); |
| } else { |
| ID = ValID::create((int)CurModule.Values[PFT].size()); |
| } |
| |
| Function *Fn = 0; |
| // See if this function was forward referenced. If so, recycle the object. |
| if (GlobalValue *FWRef = CurModule.GetForwardRefForGlobal(PFT, ID)) { |
| // Move the function to the end of the list, from whereever it was |
| // previously inserted. |
| Fn = cast<Function>(FWRef); |
| CurModule.CurrentModule->getFunctionList().remove(Fn); |
| CurModule.CurrentModule->getFunctionList().push_back(Fn); |
| } else if (!FunctionName.empty() && // Merge with an earlier prototype? |
| (Fn = CurModule.CurrentModule->getFunction(FunctionName, FT))) { |
| // If this is the case, either we need to be a forward decl, or it needs |
| // to be. |
| if (!CurFun.isDeclare && !Fn->isExternal()) |
| GEN_ERROR("Redefinition of function '" + FunctionName + "'!"); |
| |
| // Make sure to strip off any argument names so we can't get conflicts. |
| if (Fn->isExternal()) |
| for (Function::arg_iterator AI = Fn->arg_begin(), AE = Fn->arg_end(); |
| AI != AE; ++AI) |
| AI->setName(""); |
| } else { // Not already defined? |
| Fn = new Function(FT, GlobalValue::ExternalLinkage, FunctionName, |
| CurModule.CurrentModule); |
| |
| InsertValue(Fn, CurModule.Values); |
| } |
| |
| CurFun.FunctionStart(Fn); |
| |
| 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->setCallingConv((yyvsp[-7].UIntVal)); |
| Fn->setAlignment((yyvsp[0].UIntVal)); |
| if ((yyvsp[-1].StrVal)) { |
| Fn->setSection((yyvsp[-1].StrVal)); |
| free((yyvsp[-1].StrVal)); |
| } |
| |
| // Add all of the arguments we parsed to the function... |
| if ((yyvsp[-3].ArgList)) { // Is null if empty... |
| if (isVarArg) { // Nuke the last entry |
| assert((yyvsp[-3].ArgList)->back().first->get() == Type::VoidTy && (yyvsp[-3].ArgList)->back().second == 0&& |
| "Not a varargs marker!"); |
| delete (yyvsp[-3].ArgList)->back().first; |
| (yyvsp[-3].ArgList)->pop_back(); // Delete the last entry |
| } |
| Function::arg_iterator ArgIt = Fn->arg_begin(); |
| for (std::vector<std::pair<PATypeHolder*,char*> >::iterator I = (yyvsp[-3].ArgList)->begin(); |
| I != (yyvsp[-3].ArgList)->end(); ++I, ++ArgIt) { |
| delete I->first; // Delete the typeholder... |
| |
| setValueName(ArgIt, I->second); // Insert arg into symtab... |
| CHECK_FOR_ERROR |
| InsertValue(ArgIt); |
| } |
| |
| delete (yyvsp[-3].ArgList); // We're now done with the argument list |
| } |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 174: |
| #line 2084 "/proj/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[-2].Linkage)); |
| ;} |
| break; |
| |
| case 177: |
| #line 2094 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.FunctionVal) = (yyvsp[-1].FunctionVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 179: |
| #line 2100 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { CurFun.Linkage = GlobalValue::DLLImportLinkage ;} |
| break; |
| |
| case 180: |
| #line 2101 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { CurFun.Linkage = GlobalValue::DLLImportLinkage ;} |
| break; |
| |
| case 181: |
| #line 2103 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { CurFun.isDeclare = true; ;} |
| break; |
| |
| case 182: |
| #line 2103 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.FunctionVal) = CurFun.CurrentFunction; |
| CurFun.FunctionDone(); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 183: |
| #line 2113 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.BoolVal) = false; |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 184: |
| #line 2117 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.BoolVal) = true; |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 185: |
| #line 2122 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // A reference to a direct constant |
| (yyval.ValIDVal) = ValID::create((yyvsp[0].SInt64Val)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 186: |
| #line 2126 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ValIDVal) = ValID::create((yyvsp[0].UInt64Val)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 187: |
| #line 2130 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Perhaps it's an FP constant? |
| (yyval.ValIDVal) = ValID::create((yyvsp[0].FPVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 188: |
| #line 2134 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ValIDVal) = ValID::create(ConstantBool::getTrue()); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 189: |
| #line 2138 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ValIDVal) = ValID::create(ConstantBool::getFalse()); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 190: |
| #line 2142 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ValIDVal) = ValID::createNull(); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 191: |
| #line 2146 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ValIDVal) = ValID::createUndef(); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 192: |
| #line 2150 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // A vector zero constant. |
| (yyval.ValIDVal) = ValID::createZeroInit(); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 193: |
| #line 2154 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Nonempty unsized packed vector |
| const Type *ETy = (*(yyvsp[-1].ConstVector))[0]->getType(); |
| int NumElements = (yyvsp[-1].ConstVector)->size(); |
| |
| PackedType* pt = PackedType::get(ETy, NumElements); |
| PATypeHolder* PTy = new PATypeHolder( |
| HandleUpRefs( |
| PackedType::get( |
| ETy, |
| NumElements) |
| ) |
| ); |
| |
| // Verify all elements are correct type! |
| for (unsigned i = 0; i < (yyvsp[-1].ConstVector)->size(); i++) { |
| if (ETy != (*(yyvsp[-1].ConstVector))[i]->getType()) |
| 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(ConstantPacked::get(pt, *(yyvsp[-1].ConstVector))); |
| delete PTy; delete (yyvsp[-1].ConstVector); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 194: |
| #line 2179 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ValIDVal) = ValID::create((yyvsp[0].ConstVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 195: |
| #line 2183 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| char *End = UnEscapeLexed((yyvsp[-2].StrVal), true); |
| std::string AsmStr = std::string((yyvsp[-2].StrVal), End); |
| End = UnEscapeLexed((yyvsp[0].StrVal), true); |
| std::string Constraints = std::string((yyvsp[0].StrVal), End); |
| (yyval.ValIDVal) = ValID::createInlineAsm(AsmStr, Constraints, (yyvsp[-3].BoolVal)); |
| free((yyvsp[-2].StrVal)); |
| free((yyvsp[0].StrVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 196: |
| #line 2197 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Is it an integer reference...? |
| (yyval.ValIDVal) = ValID::create((yyvsp[0].SIntVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 197: |
| #line 2201 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Is it a named reference...? |
| (yyval.ValIDVal) = ValID::create((yyvsp[0].StrVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 200: |
| #line 2213 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ValueVal) = getVal(*(yyvsp[-1].TypeVal), (yyvsp[0].ValIDVal)); delete (yyvsp[-1].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 201: |
| #line 2218 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.FunctionVal) = (yyvsp[-1].FunctionVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 202: |
| #line 2222 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Do not allow functions with 0 basic blocks |
| (yyval.FunctionVal) = (yyvsp[-1].FunctionVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 203: |
| #line 2231 "/proj/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)); |
| InsertValue((yyvsp[-2].BasicBlockVal)); |
| (yyval.BasicBlockVal) = (yyvsp[-2].BasicBlockVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 204: |
| #line 2242 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyvsp[-1].BasicBlockVal)->getInstList().push_back((yyvsp[0].InstVal)); |
| (yyval.BasicBlockVal) = (yyvsp[-1].BasicBlockVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 205: |
| #line 2247 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.BasicBlockVal) = CurBB = getBBVal(ValID::create((int)CurFun.NextBBNum++), true); |
| CHECK_FOR_ERROR |
| |
| // Make sure to move the basic block to the correct location in the |
| // function, instead of leaving it inserted wherever it was first |
| // referenced. |
| Function::BasicBlockListType &BBL = |
| CurFun.CurrentFunction->getBasicBlockList(); |
| BBL.splice(BBL.end(), BBL, (yyval.BasicBlockVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 206: |
| #line 2259 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.BasicBlockVal) = CurBB = getBBVal(ValID::create((yyvsp[0].StrVal)), true); |
| CHECK_FOR_ERROR |
| |
| // Make sure to move the basic block to the correct location in the |
| // function, instead of leaving it inserted wherever it was first |
| // referenced. |
| Function::BasicBlockListType &BBL = |
| CurFun.CurrentFunction->getBasicBlockList(); |
| BBL.splice(BBL.end(), BBL, (yyval.BasicBlockVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 207: |
| #line 2272 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Return with a result... |
| (yyval.TermInstVal) = new ReturnInst((yyvsp[0].ValueVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 208: |
| #line 2276 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Return with no result... |
| (yyval.TermInstVal) = new ReturnInst(); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 209: |
| #line 2280 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Unconditional Branch... |
| BasicBlock* tmpBB = getBBVal((yyvsp[0].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyval.TermInstVal) = new BranchInst(tmpBB); |
| ;} |
| break; |
| |
| case 210: |
| #line 2285 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| BasicBlock* tmpBBA = getBBVal((yyvsp[-3].ValIDVal)); |
| CHECK_FOR_ERROR |
| BasicBlock* tmpBBB = getBBVal((yyvsp[0].ValIDVal)); |
| CHECK_FOR_ERROR |
| Value* tmpVal = getVal(Type::BoolTy, (yyvsp[-6].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyval.TermInstVal) = new BranchInst(tmpBBA, tmpBBB, tmpVal); |
| ;} |
| break; |
| |
| case 211: |
| #line 2294 "/proj/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<std::pair<Constant*,BasicBlock*> >::iterator I = (yyvsp[-1].JumpTable)->begin(), |
| E = (yyvsp[-1].JumpTable)->end(); |
| for (; I != E; ++I) { |
| if (ConstantInt *CI = dyn_cast<ConstantInt>(I->first)) |
| S->addCase(CI, I->second); |
| else |
| GEN_ERROR("Switch case is constant, but not a simple integer!"); |
| } |
| delete (yyvsp[-1].JumpTable); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 212: |
| #line 2313 "/proj/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 213: |
| #line 2323 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| const PointerType *PFTy; |
| const FunctionType *Ty; |
| |
| if (!(PFTy = dyn_cast<PointerType>((yyvsp[-10].TypeVal)->get())) || |
| !(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) { |
| // Pull out the types of all of the arguments... |
| std::vector<const Type*> ParamTypes; |
| if ((yyvsp[-7].ValueList)) { |
| for (std::vector<Value*>::iterator I = (yyvsp[-7].ValueList)->begin(), E = (yyvsp[-7].ValueList)->end(); |
| I != E; ++I) |
| ParamTypes.push_back((*I)->getType()); |
| } |
| |
| bool isVarArg = ParamTypes.size() && ParamTypes.back() == Type::VoidTy; |
| if (isVarArg) ParamTypes.pop_back(); |
| |
| Ty = FunctionType::get((yyvsp[-10].TypeVal)->get(), ParamTypes, isVarArg); |
| PFTy = PointerType::get(Ty); |
| } |
| |
| Value *V = getVal(PFTy, (yyvsp[-9].ValIDVal)); // Get the function we're calling... |
| CHECK_FOR_ERROR |
| BasicBlock *Normal = getBBVal((yyvsp[-3].ValIDVal)); |
| CHECK_FOR_ERROR |
| BasicBlock *Except = getBBVal((yyvsp[0].ValIDVal)); |
| CHECK_FOR_ERROR |
| |
| // Create the call node... |
| if (!(yyvsp[-7].ValueList)) { // Has no arguments? |
| (yyval.TermInstVal) = new InvokeInst(V, Normal, Except, std::vector<Value*>()); |
| } else { // Has arguments? |
| // Loop through FunctionType's arguments and ensure they are specified |
| // correctly! |
| // |
| FunctionType::param_iterator I = Ty->param_begin(); |
| FunctionType::param_iterator E = Ty->param_end(); |
| std::vector<Value*>::iterator ArgI = (yyvsp[-7].ValueList)->begin(), ArgE = (yyvsp[-7].ValueList)->end(); |
| |
| for (; ArgI != ArgE && I != E; ++ArgI, ++I) |
| if ((*ArgI)->getType() != *I) |
| GEN_ERROR("Parameter " +(*ArgI)->getName()+ " is not of type '" + |
| (*I)->getDescription() + "'!"); |
| |
| if (I != E || (ArgI != ArgE && !Ty->isVarArg())) |
| GEN_ERROR("Invalid number of parameters detected!"); |
| |
| (yyval.TermInstVal) = new InvokeInst(V, Normal, Except, *(yyvsp[-7].ValueList)); |
| } |
| cast<InvokeInst>((yyval.TermInstVal))->setCallingConv((yyvsp[-11].UIntVal)); |
| |
| delete (yyvsp[-10].TypeVal); |
| delete (yyvsp[-7].ValueList); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 214: |
| #line 2378 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.TermInstVal) = new UnwindInst(); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 215: |
| #line 2382 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.TermInstVal) = new UnreachableInst(); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 216: |
| #line 2389 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.JumpTable) = (yyvsp[-5].JumpTable); |
| Constant *V = cast<Constant>(getValNonImprovising((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 217: |
| #line 2400 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.JumpTable) = new std::vector<std::pair<Constant*, BasicBlock*> >(); |
| Constant *V = cast<Constant>(getValNonImprovising((yyvsp[-4].PrimType), (yyvsp[-3].ValIDVal))); |
| 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 218: |
| #line 2413 "/proj/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 219: |
| #line 2422 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Used for PHI nodes |
| (yyval.PHIList) = new std::list<std::pair<Value*, BasicBlock*> >(); |
| 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 220: |
| #line 2431 "/proj/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 221: |
| #line 2441 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Used for call statements, and memory insts... |
| (yyval.ValueList) = new std::vector<Value*>(); |
| (yyval.ValueList)->push_back((yyvsp[0].ValueVal)); |
| ;} |
| break; |
| |
| case 222: |
| #line 2445 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ValueList) = (yyvsp[-2].ValueList); |
| (yyvsp[-2].ValueList)->push_back((yyvsp[0].ValueVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 224: |
| #line 2452 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.ValueList) = 0; ;} |
| break; |
| |
| case 225: |
| #line 2454 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.BoolVal) = true; |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 226: |
| #line 2458 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.BoolVal) = false; |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 227: |
| #line 2463 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!(*(yyvsp[-3].TypeVal))->isInteger() && !(*(yyvsp[-3].TypeVal))->isFloatingPoint() && |
| !isa<PackedType>((*(yyvsp[-3].TypeVal)).get())) |
| GEN_ERROR( |
| "Arithmetic operator requires integer, FP, or packed operands!"); |
| if (isa<PackedType>((*(yyvsp[-3].TypeVal)).get()) && (yyvsp[-4].BinaryOpVal).opcode == Instruction::Rem) |
| GEN_ERROR("Rem not supported on packed types!"); |
| // Upgrade the opcode from obsolete versions before we do anything with it. |
| sanitizeOpCode((yyvsp[-4].BinaryOpVal),*(yyvsp[-3].TypeVal)); |
| CHECK_FOR_ERROR; |
| 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).opcode, val1, val2); |
| if ((yyval.InstVal) == 0) |
| GEN_ERROR("binary operator returned null!"); |
| delete (yyvsp[-3].TypeVal); |
| ;} |
| break; |
| |
| case 228: |
| #line 2482 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!(*(yyvsp[-3].TypeVal))->isIntegral()) { |
| if (!isa<PackedType>((yyvsp[-3].TypeVal)->get()) || |
| !cast<PackedType>((yyvsp[-3].TypeVal)->get())->getElementType()->isIntegral()) |
| 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).opcode, tmpVal1, tmpVal2); |
| if ((yyval.InstVal) == 0) |
| GEN_ERROR("binary operator returned null!"); |
| delete (yyvsp[-3].TypeVal); |
| ;} |
| break; |
| |
| case 229: |
| #line 2497 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if(isa<PackedType>((*(yyvsp[-3].TypeVal)).get())) { |
| GEN_ERROR( |
| "PackedTypes currently not supported in setcc instructions!"); |
| } |
| 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) = new SetCondInst((yyvsp[-4].BinaryOpVal).opcode, tmpVal1, tmpVal2); |
| if ((yyval.InstVal) == 0) |
| GEN_ERROR("binary operator returned null!"); |
| delete (yyvsp[-3].TypeVal); |
| ;} |
| break; |
| |
| case 230: |
| #line 2511 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| std::cerr << "WARNING: Use of eliminated 'not' instruction:" |
| << " Replacing with 'xor'.\n"; |
| |
| Value *Ones = ConstantIntegral::getAllOnesValue((yyvsp[0].ValueVal)->getType()); |
| if (Ones == 0) |
| GEN_ERROR("Expected integral type for not instruction!"); |
| |
| (yyval.InstVal) = BinaryOperator::create(Instruction::Xor, (yyvsp[0].ValueVal), Ones); |
| if ((yyval.InstVal) == 0) |
| GEN_ERROR("Could not create a xor instruction!"); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 231: |
| #line 2524 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if ((yyvsp[0].ValueVal)->getType() != Type::UByteTy) |
| GEN_ERROR("Shift amount must be ubyte!"); |
| if (!(yyvsp[-2].ValueVal)->getType()->isInteger()) |
| GEN_ERROR("Shift constant expression requires integer operand!"); |
| (yyval.InstVal) = new ShiftInst((yyvsp[-3].OtherOpVal).opcode, (yyvsp[-2].ValueVal), (yyvsp[0].ValueVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 232: |
| #line 2532 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!(yyvsp[0].TypeVal)->get()->isFirstClassType()) |
| GEN_ERROR("cast instruction to a non-primitive type: '" + |
| (yyvsp[0].TypeVal)->get()->getDescription() + "'!"); |
| (yyval.InstVal) = new CastInst((yyvsp[-2].ValueVal), *(yyvsp[0].TypeVal)); |
| delete (yyvsp[0].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 233: |
| #line 2540 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if ((yyvsp[-4].ValueVal)->getType() != Type::BoolTy) |
| 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 234: |
| #line 2548 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| NewVarArgs = true; |
| (yyval.InstVal) = new VAArgInst((yyvsp[-2].ValueVal), *(yyvsp[0].TypeVal)); |
| delete (yyvsp[0].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 235: |
| #line 2554 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| ObsoleteVarArgs = true; |
| const Type* ArgTy = (yyvsp[-2].ValueVal)->getType(); |
| Function* NF = CurModule.CurrentModule-> |
| getOrInsertFunction("llvm.va_copy", ArgTy, ArgTy, (Type *)0); |
| |
| //b = vaarg a, t -> |
| //foo = alloca 1 of t |
| //bar = vacopy a |
| //store bar -> foo |
| //b = vaarg foo, t |
| AllocaInst* foo = new AllocaInst(ArgTy, 0, "vaarg.fix"); |
| CurBB->getInstList().push_back(foo); |
| CallInst* bar = new CallInst(NF, (yyvsp[-2].ValueVal)); |
| CurBB->getInstList().push_back(bar); |
| CurBB->getInstList().push_back(new StoreInst(bar, foo)); |
| (yyval.InstVal) = new VAArgInst(foo, *(yyvsp[0].TypeVal)); |
| delete (yyvsp[0].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 236: |
| #line 2574 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| ObsoleteVarArgs = true; |
| const Type* ArgTy = (yyvsp[-2].ValueVal)->getType(); |
| Function* NF = CurModule.CurrentModule-> |
| getOrInsertFunction("llvm.va_copy", ArgTy, ArgTy, (Type *)0); |
| |
| //b = vanext a, t -> |
| //foo = alloca 1 of t |
| //bar = vacopy a |
| //store bar -> foo |
| //tmp = vaarg foo, t |
| //b = load foo |
| AllocaInst* foo = new AllocaInst(ArgTy, 0, "vanext.fix"); |
| CurBB->getInstList().push_back(foo); |
| CallInst* bar = new CallInst(NF, (yyvsp[-2].ValueVal)); |
| CurBB->getInstList().push_back(bar); |
| CurBB->getInstList().push_back(new StoreInst(bar, foo)); |
| Instruction* tmp = new VAArgInst(foo, *(yyvsp[0].TypeVal)); |
| CurBB->getInstList().push_back(tmp); |
| (yyval.InstVal) = new LoadInst(foo); |
| delete (yyvsp[0].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 237: |
| #line 2597 "/proj/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 238: |
| #line 2603 "/proj/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 239: |
| #line 2609 "/proj/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 240: |
| #line 2615 "/proj/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<PHINode>((yyval.InstVal))->addIncoming((yyvsp[0].PHIList)->front().first, (yyvsp[0].PHIList)->front().second); |
| (yyvsp[0].PHIList)->pop_front(); |
| } |
| delete (yyvsp[0].PHIList); // Free the list... |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 241: |
| #line 2630 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| const PointerType *PFTy; |
| const FunctionType *Ty; |
| |
| if (!(PFTy = dyn_cast<PointerType>((yyvsp[-4].TypeVal)->get())) || |
| !(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) { |
| // Pull out the types of all of the arguments... |
| std::vector<const Type*> ParamTypes; |
| if ((yyvsp[-1].ValueList)) { |
| for (std::vector<Value*>::iterator I = (yyvsp[-1].ValueList)->begin(), E = (yyvsp[-1].ValueList)->end(); |
| I != E; ++I) |
| ParamTypes.push_back((*I)->getType()); |
| } |
| |
| bool isVarArg = ParamTypes.size() && ParamTypes.back() == Type::VoidTy; |
| if (isVarArg) ParamTypes.pop_back(); |
| |
| if (!(*(yyvsp[-4].TypeVal))->isFirstClassType() && *(yyvsp[-4].TypeVal) != Type::VoidTy) |
| GEN_ERROR("LLVM functions cannot return aggregate types!"); |
| |
| Ty = FunctionType::get((yyvsp[-4].TypeVal)->get(), ParamTypes, isVarArg); |
| PFTy = PointerType::get(Ty); |
| } |
| |
| Value *V = getVal(PFTy, (yyvsp[-3].ValIDVal)); // Get the function we're calling... |
| CHECK_FOR_ERROR |
| |
| // Create the call node... |
| if (!(yyvsp[-1].ValueList)) { // 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!"); |
| |
| (yyval.InstVal) = new CallInst(V, std::vector<Value*>()); |
| } else { // Has arguments? |
| // Loop through FunctionType's arguments and ensure they are specified |
| // correctly! |
| // |
| FunctionType::param_iterator I = Ty->param_begin(); |
| FunctionType::param_iterator E = Ty->param_end(); |
| std::vector<Value*>::iterator ArgI = (yyvsp[-1].ValueList)->begin(), ArgE = (yyvsp[-1].ValueList)->end(); |
| |
| for (; ArgI != ArgE && I != E; ++ArgI, ++I) |
| if ((*ArgI)->getType() != *I) |
| GEN_ERROR("Parameter " +(*ArgI)->getName()+ " is not of type '" + |
| (*I)->getDescription() + "'!"); |
| |
| if (I != E || (ArgI != ArgE && !Ty->isVarArg())) |
| GEN_ERROR("Invalid number of parameters detected!"); |
| |
| (yyval.InstVal) = new CallInst(V, *(yyvsp[-1].ValueList)); |
| } |
| cast<CallInst>((yyval.InstVal))->setTailCall((yyvsp[-6].BoolVal)); |
| cast<CallInst>((yyval.InstVal))->setCallingConv((yyvsp[-5].UIntVal)); |
| delete (yyvsp[-4].TypeVal); |
| delete (yyvsp[-1].ValueList); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 242: |
| #line 2689 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.InstVal) = (yyvsp[0].InstVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 243: |
| #line 2696 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ValueList) = (yyvsp[0].ValueList); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 244: |
| #line 2699 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ValueList) = new std::vector<Value*>(); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 245: |
| #line 2704 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.BoolVal) = true; |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 246: |
| #line 2708 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.BoolVal) = false; |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 247: |
| #line 2715 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.InstVal) = new MallocInst(*(yyvsp[-1].TypeVal), 0, (yyvsp[0].UIntVal)); |
| delete (yyvsp[-1].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 248: |
| #line 2720 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| 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 249: |
| #line 2726 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.InstVal) = new AllocaInst(*(yyvsp[-1].TypeVal), 0, (yyvsp[0].UIntVal)); |
| delete (yyvsp[-1].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 250: |
| #line 2731 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| 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 251: |
| #line 2737 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!isa<PointerType>((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 252: |
| #line 2745 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!isa<PointerType>((yyvsp[-1].TypeVal)->get())) |
| GEN_ERROR("Can't load from nonpointer type: " + |
| (*(yyvsp[-1].TypeVal))->getDescription()); |
| if (!cast<PointerType>((yyvsp[-1].TypeVal)->get())->getElementType()->isFirstClassType()) |
| GEN_ERROR("Can't load from pointer of non-first-class type: " + |
| (*(yyvsp[-1].TypeVal))->getDescription()); |
| Value* tmpVal = getVal(*(yyvsp[-1].TypeVal), (yyvsp[0].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyval.InstVal) = new LoadInst(tmpVal, "", (yyvsp[-3].BoolVal)); |
| delete (yyvsp[-1].TypeVal); |
| ;} |
| break; |
| |
| case 253: |
| #line 2757 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| const PointerType *PT = dyn_cast<PointerType>((yyvsp[-1].TypeVal)->get()); |
| if (!PT) |
| GEN_ERROR("Can't store to a nonpointer type: " + |
| (*(yyvsp[-1].TypeVal))->getDescription()); |
| const Type *ElTy = PT->getElementType(); |
| if (ElTy != (yyvsp[-3].ValueVal)->getType()) |
| GEN_ERROR("Can't store '" + (yyvsp[-3].ValueVal)->getType()->getDescription() + |
| "' into space of type '" + ElTy->getDescription() + "'!"); |
| |
| Value* tmpVal = getVal(*(yyvsp[-1].TypeVal), (yyvsp[0].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyval.InstVal) = new StoreInst((yyvsp[-3].ValueVal), tmpVal, (yyvsp[-5].BoolVal)); |
| delete (yyvsp[-1].TypeVal); |
| ;} |
| break; |
| |
| case 254: |
| #line 2772 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!isa<PointerType>((yyvsp[-2].TypeVal)->get())) |
| GEN_ERROR("getelementptr insn requires pointer operand!"); |
| |
| // LLVM 1.2 and earlier used ubyte struct indices. Convert any ubyte struct |
| // indices to uint struct indices for compatibility. |
| generic_gep_type_iterator<std::vector<Value*>::iterator> |
| GTI = gep_type_begin((yyvsp[-2].TypeVal)->get(), (yyvsp[0].ValueList)->begin(), (yyvsp[0].ValueList)->end()), |
| GTE = gep_type_end((yyvsp[-2].TypeVal)->get(), (yyvsp[0].ValueList)->begin(), (yyvsp[0].ValueList)->end()); |
| for (unsigned i = 0, e = (yyvsp[0].ValueList)->size(); i != e && GTI != GTE; ++i, ++GTI) |
| if (isa<StructType>(*GTI)) // Only change struct indices |
| if (ConstantInt *CUI = dyn_cast<ConstantInt>((*(yyvsp[0].ValueList))[i])) |
| if (CUI->getType() == Type::UByteTy) |
| (*(yyvsp[0].ValueList))[i] = ConstantExpr::getCast(CUI, Type::UIntTy); |
| |
| if (!GetElementPtrInst::getIndexedType(*(yyvsp[-2].TypeVal), *(yyvsp[0].ValueList), true)) |
| 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)); |
| delete (yyvsp[-2].TypeVal); |
| delete (yyvsp[0].ValueList); |
| ;} |
| break; |
| |
| |
| default: break; |
| } |
| |
| /* Line 1126 of yacc.c. */ |
| #line 5273 "llvmAsmParser.tab.c" |
| |
| yyvsp -= yylen; |
| yyssp -= yylen; |
| |
| |
| YY_STACK_PRINT (yyss, yyssp); |
| |
| *++yyvsp = yyval; |
| |
| |
| /* 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 - YYNTOKENS] + *yyssp; |
| if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp) |
| yystate = yytable[yystate]; |
| else |
| yystate = yydefgoto[yyn - YYNTOKENS]; |
| |
| goto yynewstate; |
| |
| |
| /*------------------------------------. |
| | yyerrlab -- here on detecting error | |
| `------------------------------------*/ |
| yyerrlab: |
| /* If not already recovering from an error, report this error. */ |
| if (!yyerrstatus) |
| { |
| ++yynerrs; |
| #if YYERROR_VERBOSE |
| yyn = yypact[yystate]; |
| |
| if (YYPACT_NINF < yyn && yyn < YYLAST) |
| { |
| int yytype = YYTRANSLATE (yychar); |
| YYSIZE_T yysize0 = yytnamerr (0, yytname[yytype]); |
| YYSIZE_T yysize = yysize0; |
| YYSIZE_T yysize1; |
| int yysize_overflow = 0; |
| char *yymsg = 0; |
| # define YYERROR_VERBOSE_ARGS_MAXIMUM 5 |
| char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM]; |
| int yyx; |
| |
| #if 0 |
| /* This is so xgettext sees the translatable formats that are |
| constructed on the fly. */ |
| YY_("syntax error, unexpected %s"); |
| YY_("syntax error, unexpected %s, expecting %s"); |
| YY_("syntax error, unexpected %s, expecting %s or %s"); |
| YY_("syntax error, unexpected %s, expecting %s or %s or %s"); |
| YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s"); |
| #endif |
| char *yyfmt; |
| char const *yyf; |
| static char const yyunexpected[] = "syntax error, unexpected %s"; |
| static char const yyexpecting[] = ", expecting %s"; |
| static char const yyor[] = " or %s"; |
| char yyformat[sizeof yyunexpected |
| + sizeof yyexpecting - 1 |
| + ((YYERROR_VERBOSE_ARGS_MAXIMUM - 2) |
| * (sizeof yyor - 1))]; |
| char const *yyprefix = yyexpecting; |
| |
| /* Start YYX at -YYN if negative to avoid negative indexes in |
| YYCHECK. */ |
| int yyxbegin = yyn < 0 ? -yyn : 0; |
| |
| /* Stay within bounds of both yycheck and yytname. */ |
| int yychecklim = YYLAST - yyn; |
| int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS; |
| int yycount = 1; |
| |
| yyarg[0] = yytname[yytype]; |
| yyfmt = yystpcpy (yyformat, yyunexpected); |
| |
| for (yyx = yyxbegin; yyx < yyxend; ++yyx) |
| if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR) |
| { |
| if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM) |
| { |
| yycount = 1; |
| yysize = yysize0; |
| yyformat[sizeof yyunexpected - 1] = '\0'; |
| break; |
| } |
| yyarg[yycount++] = yytname[yyx]; |
| yysize1 = yysize + yytnamerr (0, yytname[yyx]); |
| yysize_overflow |= yysize1 < yysize; |
| yysize = yysize1; |
| yyfmt = yystpcpy (yyfmt, yyprefix); |
| yyprefix = yyor; |
| } |
| |
| yyf = YY_(yyformat); |
| yysize1 = yysize + yystrlen (yyf); |
| yysize_overflow |= yysize1 < yysize; |
| yysize = yysize1; |
| |
| if (!yysize_overflow && yysize <= YYSTACK_ALLOC_MAXIMUM) |
| yymsg = (char *) YYSTACK_ALLOC (yysize); |
| if (yymsg) |
| { |
| /* Avoid sprintf, as that infringes on the user's name space. |
| Don't have undefined behavior even if the translation |
| produced a string with the wrong number of "%s"s. */ |
| char *yyp = yymsg; |
| int yyi = 0; |
| while ((*yyp = *yyf)) |
| { |
| if (*yyp == '%' && yyf[1] == 's' && yyi < yycount) |
| { |
| yyp += yytnamerr (yyp, yyarg[yyi++]); |
| yyf += 2; |
| } |
| else |
| { |
| yyp++; |
| yyf++; |
| } |
| } |
| yyerror (yymsg); |
| YYSTACK_FREE (yymsg); |
| } |
| else |
| { |
| yyerror (YY_("syntax error")); |
| goto yyexhaustedlab; |
| } |
| } |
| else |
| #endif /* YYERROR_VERBOSE */ |
| yyerror (YY_("syntax error")); |
| } |
| |
| |
| |
| if (yyerrstatus == 3) |
| { |
| /* If just tried and failed to reuse look-ahead token after an |
| error, discard it. */ |
| |
| if (yychar <= YYEOF) |
| { |
| /* Return failure if at end of input. */ |
| if (yychar == YYEOF) |
| YYABORT; |
| } |
| else |
| { |
| yydestruct ("Error: discarding", yytoken, &yylval); |
| yychar = YYEMPTY; |
| } |
| } |
| |
| /* Else will try to reuse look-ahead token after shifting the error |
| token. */ |
| goto yyerrlab1; |
| |
| |
| /*---------------------------------------------------. |
| | yyerrorlab -- error raised explicitly by YYERROR. | |
| `---------------------------------------------------*/ |
| yyerrorlab: |
| |
| /* Pacify compilers like GCC when the user code never invokes |
| YYERROR and the label yyerrorlab therefore never appears in user |
| code. */ |
| if (0) |
| goto yyerrorlab; |
| |
| yyvsp -= yylen; |
| yyssp -= yylen; |
| yystate = *yyssp; |
| goto yyerrlab1; |
| |
| |
| /*-------------------------------------------------------------. |
| | yyerrlab1 -- common code for both syntax error and YYERROR. | |
| `-------------------------------------------------------------*/ |
| yyerrlab1: |
| yyerrstatus = 3; /* Each real token shifted decrements this. */ |
| |
| for (;;) |
| { |
| yyn = yypact[yystate]; |
| if (yyn != YYPACT_NINF) |
| { |
| yyn += YYTERROR; |
| if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR) |
| { |
| yyn = yytable[yyn]; |
| if (0 < yyn) |
| break; |
| } |
| } |
| |
| /* Pop the current state because it cannot handle the error token. */ |
| if (yyssp == yyss) |
| YYABORT; |
| |
| |
| yydestruct ("Error: popping", yystos[yystate], yyvsp); |
| YYPOPSTACK; |
| yystate = *yyssp; |
| YY_STACK_PRINT (yyss, yyssp); |
| } |
| |
| if (yyn == YYFINAL) |
| YYACCEPT; |
| |
| *++yyvsp = yylval; |
| |
| |
| /* Shift the error token. */ |
| YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp); |
| |
| yystate = yyn; |
| goto yynewstate; |
| |
| |
| /*-------------------------------------. |
| | yyacceptlab -- YYACCEPT comes here. | |
| `-------------------------------------*/ |
| yyacceptlab: |
| yyresult = 0; |
| goto yyreturn; |
| |
| /*-----------------------------------. |
| | yyabortlab -- YYABORT comes here. | |
| `-----------------------------------*/ |
| yyabortlab: |
| yyresult = 1; |
| goto yyreturn; |
| |
| #ifndef yyoverflow |
| /*-------------------------------------------------. |
| | yyexhaustedlab -- memory exhaustion comes here. | |
| `-------------------------------------------------*/ |
| yyexhaustedlab: |
| yyerror (YY_("memory exhausted")); |
| yyresult = 2; |
| /* Fall through. */ |
| #endif |
| |
| yyreturn: |
| if (yychar != YYEOF && yychar != YYEMPTY) |
| yydestruct ("Cleanup: discarding lookahead", |
| yytoken, &yylval); |
| while (yyssp != yyss) |
| { |
| yydestruct ("Cleanup: popping", |
| yystos[*yyssp], yyvsp); |
| YYPOPSTACK; |
| } |
| #ifndef yyoverflow |
| if (yyss != yyssa) |
| YYSTACK_FREE (yyss); |
| #endif |
| return yyresult; |
| } |
| |
| |
| #line 2798 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y" |
| |
| |
| void llvm::GenerateError(const std::string &message, int LineNo) { |
| if (LineNo == -1) LineNo = llvmAsmlineno; |
| // TODO: column number in exception |
| if (TheParseError) |
| TheParseError->setError(CurFilename, message, LineNo); |
| TriggerError = 1; |
| } |
| |
| int yyerror(const char *ErrorMsg) { |
| std::string where |
| = std::string((CurFilename == "-") ? std::string("<stdin>") : CurFilename) |
| + ":" + utostr((unsigned) llvmAsmlineno) + ": "; |
| std::string errMsg = std::string(ErrorMsg) + "\n" + where + " while reading "; |
| if (yychar == YYEMPTY || yychar == 0) |
| errMsg += "end-of-file."; |
| else |
| errMsg += "token: '" + std::string(llvmAsmtext, llvmAsmleng) + "'"; |
| GenerateError(errMsg); |
| return 0; |
| } |
| |