| /* A Bison parser, made by GNU Bison 2.3. */ |
| |
| /* Skeleton implementation for Bison's Yacc-like parsers in C |
| |
| Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005, 2006 |
| 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, you may create a larger work that contains |
| part or all of the Bison parser skeleton and distribute that work |
| under terms of your choice, so long as that work isn't itself a |
| parser generator using the skeleton or a modified version thereof |
| as a parser skeleton. Alternatively, if you modify or redistribute |
| the parser skeleton itself, you may (at your option) remove this |
| special exception, which will cause the skeleton and the resulting |
| Bison output files to be licensed under the GNU General Public |
| License without this special exception. |
| |
| This special exception was added by the Free Software Foundation in |
| version 2.2 of Bison. */ |
| |
| /* C LALR(1) parser skeleton 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.3" |
| |
| /* 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, |
| ESAPINTVAL = 260, |
| EUAPINTVAL = 261, |
| LOCALVAL_ID = 262, |
| GLOBALVAL_ID = 263, |
| FPVAL = 264, |
| VOID = 265, |
| INTTYPE = 266, |
| FLOAT = 267, |
| DOUBLE = 268, |
| X86_FP80 = 269, |
| FP128 = 270, |
| PPC_FP128 = 271, |
| LABEL = 272, |
| TYPE = 273, |
| LOCALVAR = 274, |
| GLOBALVAR = 275, |
| LABELSTR = 276, |
| STRINGCONSTANT = 277, |
| ATSTRINGCONSTANT = 278, |
| PCTSTRINGCONSTANT = 279, |
| ZEROINITIALIZER = 280, |
| TRUETOK = 281, |
| FALSETOK = 282, |
| BEGINTOK = 283, |
| ENDTOK = 284, |
| DECLARE = 285, |
| DEFINE = 286, |
| GLOBAL = 287, |
| CONSTANT = 288, |
| SECTION = 289, |
| ALIAS = 290, |
| VOLATILE = 291, |
| THREAD_LOCAL = 292, |
| TO = 293, |
| DOTDOTDOT = 294, |
| NULL_TOK = 295, |
| UNDEF = 296, |
| INTERNAL = 297, |
| LINKONCE = 298, |
| WEAK = 299, |
| APPENDING = 300, |
| DLLIMPORT = 301, |
| DLLEXPORT = 302, |
| EXTERN_WEAK = 303, |
| OPAQUE = 304, |
| EXTERNAL = 305, |
| TARGET = 306, |
| TRIPLE = 307, |
| ALIGN = 308, |
| DEPLIBS = 309, |
| CALL = 310, |
| TAIL = 311, |
| ASM_TOK = 312, |
| MODULE = 313, |
| SIDEEFFECT = 314, |
| CC_TOK = 315, |
| CCC_TOK = 316, |
| FASTCC_TOK = 317, |
| COLDCC_TOK = 318, |
| X86_STDCALLCC_TOK = 319, |
| X86_FASTCALLCC_TOK = 320, |
| DATALAYOUT = 321, |
| RET = 322, |
| BR = 323, |
| SWITCH = 324, |
| INVOKE = 325, |
| UNWIND = 326, |
| UNREACHABLE = 327, |
| ADD = 328, |
| SUB = 329, |
| MUL = 330, |
| UDIV = 331, |
| SDIV = 332, |
| FDIV = 333, |
| UREM = 334, |
| SREM = 335, |
| FREM = 336, |
| AND = 337, |
| OR = 338, |
| XOR = 339, |
| SHL = 340, |
| LSHR = 341, |
| ASHR = 342, |
| ICMP = 343, |
| FCMP = 344, |
| EQ = 345, |
| NE = 346, |
| SLT = 347, |
| SGT = 348, |
| SLE = 349, |
| SGE = 350, |
| ULT = 351, |
| UGT = 352, |
| ULE = 353, |
| UGE = 354, |
| OEQ = 355, |
| ONE = 356, |
| OLT = 357, |
| OGT = 358, |
| OLE = 359, |
| OGE = 360, |
| ORD = 361, |
| UNO = 362, |
| UEQ = 363, |
| UNE = 364, |
| MALLOC = 365, |
| ALLOCA = 366, |
| FREE = 367, |
| LOAD = 368, |
| STORE = 369, |
| GETELEMENTPTR = 370, |
| TRUNC = 371, |
| ZEXT = 372, |
| SEXT = 373, |
| FPTRUNC = 374, |
| FPEXT = 375, |
| BITCAST = 376, |
| UITOFP = 377, |
| SITOFP = 378, |
| FPTOUI = 379, |
| FPTOSI = 380, |
| INTTOPTR = 381, |
| PTRTOINT = 382, |
| PHI_TOK = 383, |
| SELECT = 384, |
| VAARG = 385, |
| EXTRACTELEMENT = 386, |
| INSERTELEMENT = 387, |
| SHUFFLEVECTOR = 388, |
| SIGNEXT = 389, |
| ZEROEXT = 390, |
| NORETURN = 391, |
| INREG = 392, |
| SRET = 393, |
| NOUNWIND = 394, |
| NOALIAS = 395, |
| BYVAL = 396, |
| NEST = 397, |
| READNONE = 398, |
| READONLY = 399, |
| DEFAULT = 400, |
| HIDDEN = 401, |
| PROTECTED = 402 |
| }; |
| #endif |
| /* Tokens. */ |
| #define ESINT64VAL 258 |
| #define EUINT64VAL 259 |
| #define ESAPINTVAL 260 |
| #define EUAPINTVAL 261 |
| #define LOCALVAL_ID 262 |
| #define GLOBALVAL_ID 263 |
| #define FPVAL 264 |
| #define VOID 265 |
| #define INTTYPE 266 |
| #define FLOAT 267 |
| #define DOUBLE 268 |
| #define X86_FP80 269 |
| #define FP128 270 |
| #define PPC_FP128 271 |
| #define LABEL 272 |
| #define TYPE 273 |
| #define LOCALVAR 274 |
| #define GLOBALVAR 275 |
| #define LABELSTR 276 |
| #define STRINGCONSTANT 277 |
| #define ATSTRINGCONSTANT 278 |
| #define PCTSTRINGCONSTANT 279 |
| #define ZEROINITIALIZER 280 |
| #define TRUETOK 281 |
| #define FALSETOK 282 |
| #define BEGINTOK 283 |
| #define ENDTOK 284 |
| #define DECLARE 285 |
| #define DEFINE 286 |
| #define GLOBAL 287 |
| #define CONSTANT 288 |
| #define SECTION 289 |
| #define ALIAS 290 |
| #define VOLATILE 291 |
| #define THREAD_LOCAL 292 |
| #define TO 293 |
| #define DOTDOTDOT 294 |
| #define NULL_TOK 295 |
| #define UNDEF 296 |
| #define INTERNAL 297 |
| #define LINKONCE 298 |
| #define WEAK 299 |
| #define APPENDING 300 |
| #define DLLIMPORT 301 |
| #define DLLEXPORT 302 |
| #define EXTERN_WEAK 303 |
| #define OPAQUE 304 |
| #define EXTERNAL 305 |
| #define TARGET 306 |
| #define TRIPLE 307 |
| #define ALIGN 308 |
| #define DEPLIBS 309 |
| #define CALL 310 |
| #define TAIL 311 |
| #define ASM_TOK 312 |
| #define MODULE 313 |
| #define SIDEEFFECT 314 |
| #define CC_TOK 315 |
| #define CCC_TOK 316 |
| #define FASTCC_TOK 317 |
| #define COLDCC_TOK 318 |
| #define X86_STDCALLCC_TOK 319 |
| #define X86_FASTCALLCC_TOK 320 |
| #define DATALAYOUT 321 |
| #define RET 322 |
| #define BR 323 |
| #define SWITCH 324 |
| #define INVOKE 325 |
| #define UNWIND 326 |
| #define UNREACHABLE 327 |
| #define ADD 328 |
| #define SUB 329 |
| #define MUL 330 |
| #define UDIV 331 |
| #define SDIV 332 |
| #define FDIV 333 |
| #define UREM 334 |
| #define SREM 335 |
| #define FREM 336 |
| #define AND 337 |
| #define OR 338 |
| #define XOR 339 |
| #define SHL 340 |
| #define LSHR 341 |
| #define ASHR 342 |
| #define ICMP 343 |
| #define FCMP 344 |
| #define EQ 345 |
| #define NE 346 |
| #define SLT 347 |
| #define SGT 348 |
| #define SLE 349 |
| #define SGE 350 |
| #define ULT 351 |
| #define UGT 352 |
| #define ULE 353 |
| #define UGE 354 |
| #define OEQ 355 |
| #define ONE 356 |
| #define OLT 357 |
| #define OGT 358 |
| #define OLE 359 |
| #define OGE 360 |
| #define ORD 361 |
| #define UNO 362 |
| #define UEQ 363 |
| #define UNE 364 |
| #define MALLOC 365 |
| #define ALLOCA 366 |
| #define FREE 367 |
| #define LOAD 368 |
| #define STORE 369 |
| #define GETELEMENTPTR 370 |
| #define TRUNC 371 |
| #define ZEXT 372 |
| #define SEXT 373 |
| #define FPTRUNC 374 |
| #define FPEXT 375 |
| #define BITCAST 376 |
| #define UITOFP 377 |
| #define SITOFP 378 |
| #define FPTOUI 379 |
| #define FPTOSI 380 |
| #define INTTOPTR 381 |
| #define PTRTOINT 382 |
| #define PHI_TOK 383 |
| #define SELECT 384 |
| #define VAARG 385 |
| #define EXTRACTELEMENT 386 |
| #define INSERTELEMENT 387 |
| #define SHUFFLEVECTOR 388 |
| #define SIGNEXT 389 |
| #define ZEROEXT 390 |
| #define NORETURN 391 |
| #define INREG 392 |
| #define SRET 393 |
| #define NOUNWIND 394 |
| #define NOALIAS 395 |
| #define BYVAL 396 |
| #define NEST 397 |
| #define READNONE 398 |
| #define READONLY 399 |
| #define DEFAULT 400 |
| #define HIDDEN 401 |
| #define PROTECTED 402 |
| |
| |
| |
| |
| /* Copy the first part of user declarations. */ |
| #line 14 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| |
| #include "ParserInternals.h" |
| #include "llvm/CallingConv.h" |
| #include "llvm/InlineAsm.h" |
| #include "llvm/Instructions.h" |
| #include "llvm/Module.h" |
| #include "llvm/ValueSymbolTable.h" |
| #include "llvm/AutoUpgrade.h" |
| #include "llvm/Support/GetElementPtrTypeIterator.h" |
| #include "llvm/Support/CommandLine.h" |
| #include "llvm/ADT/SmallVector.h" |
| #include "llvm/ADT/STLExtras.h" |
| #include "llvm/Support/MathExtras.h" |
| #include "llvm/Support/Streams.h" |
| #include <algorithm> |
| #include <list> |
| #include <map> |
| #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(); |
| using namespace llvm; |
| |
| static Module *ParserResult; |
| |
| // DEBUG_UPREFS - Define this symbol if you want to enable debugging output |
| // relating to upreferences in the input stream. |
| // |
| //#define DEBUG_UPREFS 1 |
| #ifdef DEBUG_UPREFS |
| #define UR_OUT(X) cerr << X |
| #else |
| #define UR_OUT(X) |
| #endif |
| |
| #define YYERROR_VERBOSE 1 |
| |
| static GlobalVariable *CurGV; |
| |
| |
| // This contains info used when building the body of a function. It is |
| // destroyed when the function is completed. |
| // |
| typedef std::vector<Value *> ValueList; // Numbered defs |
| |
| static void |
| ResolveDefinitions(ValueList &LateResolvers, ValueList *FutureLateResolvers=0); |
| |
| static struct PerModuleInfo { |
| Module *CurrentModule; |
| ValueList Values; // Module level numbered definitions |
| ValueList LateResolveValues; |
| std::vector<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++); // must be post-increment, as we remove |
| |
| Values.clear(); // Clear out function local definitions |
| Types.clear(); |
| CurrentModule = 0; |
| } |
| |
| // GetForwardRefForGlobal - Check to see if there is a forward reference |
| // for this global. If so, remove it from the GlobalRefs map and return it. |
| // If not, just return null. |
| GlobalValue *GetForwardRefForGlobal(const PointerType *PTy, ValID ID) { |
| // Check to see if there is a forward reference to this global variable... |
| // if there is, eliminate it and patch the reference to use the new def'n. |
| GlobalRefsType::iterator I = GlobalRefs.find(std::make_pair(PTy, ID)); |
| GlobalValue *Ret = 0; |
| if (I != GlobalRefs.end()) { |
| Ret = I->second; |
| GlobalRefs.erase(I); |
| } |
| return Ret; |
| } |
| |
| bool TypeIsUnresolved(PATypeHolder* PATy) { |
| // If it isn't abstract, its resolved |
| const Type* Ty = PATy->get(); |
| if (!Ty->isAbstract()) |
| return false; |
| // Traverse the type looking for abstract types. If it isn't abstract then |
| // we don't need to traverse that leg of the type. |
| std::vector<const Type*> WorkList, SeenList; |
| WorkList.push_back(Ty); |
| while (!WorkList.empty()) { |
| const Type* Ty = WorkList.back(); |
| SeenList.push_back(Ty); |
| WorkList.pop_back(); |
| if (const OpaqueType* OpTy = dyn_cast<OpaqueType>(Ty)) { |
| // Check to see if this is an unresolved type |
| std::map<ValID, PATypeHolder>::iterator I = LateResolveTypes.begin(); |
| std::map<ValID, PATypeHolder>::iterator E = LateResolveTypes.end(); |
| for ( ; I != E; ++I) { |
| if (I->second.get() == OpTy) |
| return true; |
| } |
| } else if (const SequentialType* SeqTy = dyn_cast<SequentialType>(Ty)) { |
| const Type* TheTy = SeqTy->getElementType(); |
| if (TheTy->isAbstract() && TheTy != Ty) { |
| std::vector<const Type*>::iterator I = SeenList.begin(), |
| E = SeenList.end(); |
| for ( ; I != E; ++I) |
| if (*I == TheTy) |
| break; |
| if (I == E) |
| WorkList.push_back(TheTy); |
| } |
| } else if (const StructType* StrTy = dyn_cast<StructType>(Ty)) { |
| for (unsigned i = 0; i < StrTy->getNumElements(); ++i) { |
| const Type* TheTy = StrTy->getElementType(i); |
| if (TheTy->isAbstract() && TheTy != Ty) { |
| std::vector<const Type*>::iterator I = SeenList.begin(), |
| E = SeenList.end(); |
| for ( ; I != E; ++I) |
| if (*I == TheTy) |
| break; |
| if (I == E) |
| WorkList.push_back(TheTy); |
| } |
| } |
| } |
| } |
| return false; |
| } |
| } CurModule; |
| |
| static struct PerFunctionInfo { |
| Function *CurrentFunction; // Pointer to current function being created |
| |
| ValueList Values; // Keep track of #'d definitions |
| unsigned NextValNum; |
| ValueList LateResolveValues; |
| bool isDeclare; // Is this function a forward declararation? |
| GlobalValue::LinkageTypes Linkage; // Linkage for forward declaration. |
| GlobalValue::VisibilityTypes Visibility; |
| |
| /// BBForwardRefs - When we see forward references to basic blocks, keep |
| /// track of them here. |
| std::map<ValID, BasicBlock*> BBForwardRefs; |
| |
| inline PerFunctionInfo() { |
| CurrentFunction = 0; |
| isDeclare = false; |
| Linkage = GlobalValue::ExternalLinkage; |
| Visibility = GlobalValue::DefaultVisibility; |
| } |
| |
| inline void FunctionStart(Function *M) { |
| CurrentFunction = M; |
| NextValNum = 0; |
| } |
| |
| void FunctionDone() { |
| // Any forward referenced blocks left? |
| if (!BBForwardRefs.empty()) { |
| GenerateError("Undefined reference to label " + |
| BBForwardRefs.begin()->second->getName()); |
| return; |
| } |
| |
| // Resolve all forward references now. |
| ResolveDefinitions(LateResolveValues, &CurModule.LateResolveValues); |
| |
| Values.clear(); // Clear out function local definitions |
| BBForwardRefs.clear(); |
| CurrentFunction = 0; |
| isDeclare = false; |
| Linkage = GlobalValue::ExternalLinkage; |
| Visibility = GlobalValue::DefaultVisibility; |
| } |
| } CurFun; // Info for the current function... |
| |
| static bool inFunctionScope() { return CurFun.CurrentFunction != 0; } |
| |
| |
| //===----------------------------------------------------------------------===// |
| // Code to handle definitions of all the types |
| //===----------------------------------------------------------------------===// |
| |
| static void InsertValue(Value *V, ValueList &ValueTab = CurFun.Values) { |
| // Things that have names or are void typed don't get slot numbers |
| if (V->hasName() || (V->getType() == Type::VoidTy)) |
| return; |
| |
| // In the case of function values, we have to allow for the forward reference |
| // of basic blocks, which are included in the numbering. Consequently, we keep |
| // track of the next insertion location with NextValNum. When a BB gets |
| // inserted, it could change the size of the CurFun.Values vector. |
| if (&ValueTab == &CurFun.Values) { |
| if (ValueTab.size() <= CurFun.NextValNum) |
| ValueTab.resize(CurFun.NextValNum+1); |
| ValueTab[CurFun.NextValNum++] = V; |
| return; |
| } |
| // For all other lists, its okay to just tack it on the back of the vector. |
| ValueTab.push_back(V); |
| } |
| |
| static const Type *getTypeVal(const ValID &D, bool DoNotImprovise = false) { |
| switch (D.Type) { |
| case ValID::LocalID: // Is it a numbered definition? |
| // Module constants occupy the lowest numbered slots... |
| if (D.Num < CurModule.Types.size()) |
| return CurModule.Types[D.Num]; |
| break; |
| case ValID::LocalName: // Is it a named definition? |
| if (const Type *N = CurModule.CurrentModule->getTypeByName(D.getName())) { |
| D.destroy(); // Free old strdup'd memory... |
| return N; |
| } |
| break; |
| default: |
| GenerateError("Internal parser error: Invalid symbol type reference"); |
| return 0; |
| } |
| |
| // If we reached here, we referenced either a symbol that we don't know about |
| // or an id number that hasn't been read yet. We may be referencing something |
| // forward, so just create an entry to be resolved later and get to it... |
| // |
| if (DoNotImprovise) return 0; // Do we just want a null to be returned? |
| |
| |
| if (inFunctionScope()) { |
| if (D.Type == ValID::LocalName) { |
| GenerateError("Reference to an undefined type: '" + D.getName() + "'"); |
| return 0; |
| } else { |
| GenerateError("Reference to an undefined type: #" + utostr(D.Num)); |
| return 0; |
| } |
| } |
| |
| std::map<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; |
| } |
| |
| // getExistingVal - Look up the value specified by the provided type and |
| // the provided ValID. If the value exists and has already been defined, return |
| // it. Otherwise return null. |
| // |
| static Value *getExistingVal(const Type *Ty, const ValID &D) { |
| if (isa<FunctionType>(Ty)) { |
| GenerateError("Functions are not values and " |
| "must be referenced as pointers"); |
| return 0; |
| } |
| |
| switch (D.Type) { |
| case ValID::LocalID: { // Is it a numbered definition? |
| // Check that the number is within bounds. |
| if (D.Num >= CurFun.Values.size()) |
| return 0; |
| Value *Result = CurFun.Values[D.Num]; |
| if (Ty != Result->getType()) { |
| GenerateError("Numbered value (%" + utostr(D.Num) + ") of type '" + |
| Result->getType()->getDescription() + "' does not match " |
| "expected type, '" + Ty->getDescription() + "'"); |
| return 0; |
| } |
| return Result; |
| } |
| case ValID::GlobalID: { // Is it a numbered definition? |
| if (D.Num >= CurModule.Values.size()) |
| return 0; |
| Value *Result = CurModule.Values[D.Num]; |
| if (Ty != Result->getType()) { |
| GenerateError("Numbered value (@" + utostr(D.Num) + ") of type '" + |
| Result->getType()->getDescription() + "' does not match " |
| "expected type, '" + Ty->getDescription() + "'"); |
| return 0; |
| } |
| return Result; |
| } |
| |
| case ValID::LocalName: { // Is it a named definition? |
| if (!inFunctionScope()) |
| return 0; |
| ValueSymbolTable &SymTab = CurFun.CurrentFunction->getValueSymbolTable(); |
| Value *N = SymTab.lookup(D.getName()); |
| if (N == 0) |
| return 0; |
| if (N->getType() != Ty) |
| return 0; |
| |
| D.destroy(); // Free old strdup'd memory... |
| return N; |
| } |
| case ValID::GlobalName: { // Is it a named definition? |
| ValueSymbolTable &SymTab = CurModule.CurrentModule->getValueSymbolTable(); |
| Value *N = SymTab.lookup(D.getName()); |
| if (N == 0) |
| return 0; |
| if (N->getType() != Ty) |
| return 0; |
| |
| D.destroy(); // Free old strdup'd memory... |
| return N; |
| } |
| |
| // Check to make sure that "Ty" is an integral type, and that our |
| // value will fit into the specified type... |
| case ValID::ConstSIntVal: // Is it a constant pool reference?? |
| if (!ConstantInt::isValueValidForType(Ty, D.ConstPool64)) { |
| GenerateError("Signed integral constant '" + |
| itostr(D.ConstPool64) + "' is invalid for type '" + |
| Ty->getDescription() + "'"); |
| return 0; |
| } |
| return ConstantInt::get(Ty, D.ConstPool64, true); |
| |
| case ValID::ConstUIntVal: // Is it an unsigned const pool reference? |
| if (!ConstantInt::isValueValidForType(Ty, D.UConstPool64)) { |
| if (!ConstantInt::isValueValidForType(Ty, D.ConstPool64)) { |
| GenerateError("Integral constant '" + utostr(D.UConstPool64) + |
| "' is invalid or out of range"); |
| return 0; |
| } else { // This is really a signed reference. Transmogrify. |
| return ConstantInt::get(Ty, D.ConstPool64, true); |
| } |
| } else { |
| return ConstantInt::get(Ty, D.UConstPool64); |
| } |
| |
| case ValID::ConstFPVal: // Is it a floating point const pool reference? |
| if (!ConstantFP::isValueValidForType(Ty, *D.ConstPoolFP)) { |
| GenerateError("FP constant invalid for type"); |
| return 0; |
| } |
| // Lexer has no type info, so builds all float and double FP constants |
| // as double. Fix this here. Long double does not need this. |
| if (&D.ConstPoolFP->getSemantics() == &APFloat::IEEEdouble && |
| Ty==Type::FloatTy) |
| D.ConstPoolFP->convert(APFloat::IEEEsingle, APFloat::rmNearestTiesToEven); |
| return ConstantFP::get(Ty, *D.ConstPoolFP); |
| |
| case ValID::ConstNullVal: // Is it a null value? |
| if (!isa<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 getExistingVal, except that if a |
| // value is not already defined, it "improvises" by creating a placeholder var |
| // that looks and acts just like the requested variable. When the value is |
| // defined later, all uses of the placeholder variable are replaced with the |
| // real thing. |
| // |
| static Value *getVal(const Type *Ty, const ValID &ID) { |
| if (Ty == Type::LabelTy) { |
| GenerateError("Cannot use a basic block here"); |
| return 0; |
| } |
| |
| // See if the value has already been defined. |
| Value *V = getExistingVal(Ty, ID); |
| if (V) return V; |
| if (TriggerError) return 0; |
| |
| if (!Ty->isFirstClassType() && !isa<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... |
| // |
| switch (ID.Type) { |
| case ValID::GlobalName: |
| case ValID::GlobalID: { |
| const PointerType *PTy = dyn_cast<PointerType>(Ty); |
| if (!PTy) { |
| GenerateError("Invalid type for reference to global" ); |
| return 0; |
| } |
| const Type* ElTy = PTy->getElementType(); |
| if (const FunctionType *FTy = dyn_cast<FunctionType>(ElTy)) |
| V = new Function(FTy, GlobalValue::ExternalLinkage); |
| else |
| V = new GlobalVariable(ElTy, false, GlobalValue::ExternalLinkage); |
| break; |
| } |
| default: |
| V = new Argument(Ty); |
| } |
| |
| // Remember where this forward reference came from. FIXME, shouldn't we try |
| // to recycle these things?? |
| CurModule.PlaceHolderInfo.insert(std::make_pair(V, std::make_pair(ID, |
| LLLgetLineNo()))); |
| |
| if (inFunctionScope()) |
| InsertValue(V, CurFun.LateResolveValues); |
| else |
| InsertValue(V, CurModule.LateResolveValues); |
| return V; |
| } |
| |
| /// defineBBVal - This is a definition of a new basic block with the specified |
| /// identifier which must be the same as CurFun.NextValNum, if its numeric. |
| static BasicBlock *defineBBVal(const ValID &ID) { |
| assert(inFunctionScope() && "Can't get basic block at global scope!"); |
| |
| BasicBlock *BB = 0; |
| |
| // First, see if this was forward referenced |
| |
| std::map<ValID, BasicBlock*>::iterator BBI = CurFun.BBForwardRefs.find(ID); |
| if (BBI != CurFun.BBForwardRefs.end()) { |
| BB = BBI->second; |
| // The forward declaration could have been inserted anywhere in the |
| // function: insert it into the correct place now. |
| CurFun.CurrentFunction->getBasicBlockList().remove(BB); |
| CurFun.CurrentFunction->getBasicBlockList().push_back(BB); |
| |
| // We're about to erase the entry, save the key so we can clean it up. |
| ValID Tmp = BBI->first; |
| |
| // Erase the forward ref from the map as its no longer "forward" |
| CurFun.BBForwardRefs.erase(ID); |
| |
| // The key has been removed from the map but so we don't want to leave |
| // strdup'd memory around so destroy it too. |
| Tmp.destroy(); |
| |
| // If its a numbered definition, bump the number and set the BB value. |
| if (ID.Type == ValID::LocalID) { |
| assert(ID.Num == CurFun.NextValNum && "Invalid new block number"); |
| InsertValue(BB); |
| } |
| |
| ID.destroy(); |
| return BB; |
| } |
| |
| // We haven't seen this BB before and its first mention is a definition. |
| // Just create it and return it. |
| std::string Name (ID.Type == ValID::LocalName ? ID.getName() : ""); |
| BB = new BasicBlock(Name, CurFun.CurrentFunction); |
| if (ID.Type == ValID::LocalID) { |
| assert(ID.Num == CurFun.NextValNum && "Invalid new block number"); |
| InsertValue(BB); |
| } |
| |
| ID.destroy(); // Free strdup'd memory |
| return BB; |
| } |
| |
| /// getBBVal - get an existing BB value or create a forward reference for it. |
| /// |
| static BasicBlock *getBBVal(const ValID &ID) { |
| assert(inFunctionScope() && "Can't get basic block at global scope!"); |
| |
| BasicBlock *BB = 0; |
| |
| std::map<ValID, BasicBlock*>::iterator BBI = CurFun.BBForwardRefs.find(ID); |
| if (BBI != CurFun.BBForwardRefs.end()) { |
| BB = BBI->second; |
| } if (ID.Type == ValID::LocalName) { |
| std::string Name = ID.getName(); |
| Value *N = CurFun.CurrentFunction->getValueSymbolTable().lookup(Name); |
| if (N) |
| if (N->getType()->getTypeID() == Type::LabelTyID) |
| BB = cast<BasicBlock>(N); |
| else |
| GenerateError("Reference to label '" + Name + "' is actually of type '"+ |
| N->getType()->getDescription() + "'"); |
| } else if (ID.Type == ValID::LocalID) { |
| if (ID.Num < CurFun.NextValNum && ID.Num < CurFun.Values.size()) { |
| if (CurFun.Values[ID.Num]->getType()->getTypeID() == Type::LabelTyID) |
| BB = cast<BasicBlock>(CurFun.Values[ID.Num]); |
| else |
| GenerateError("Reference to label '%" + utostr(ID.Num) + |
| "' is actually of type '"+ |
| CurFun.Values[ID.Num]->getType()->getDescription() + "'"); |
| } |
| } else { |
| GenerateError("Illegal label reference " + ID.getName()); |
| return 0; |
| } |
| |
| // If its already been defined, return it now. |
| if (BB) { |
| ID.destroy(); // Free strdup'd memory. |
| return BB; |
| } |
| |
| // Otherwise, this block has not been seen before, create it. |
| std::string Name; |
| if (ID.Type == ValID::LocalName) |
| Name = ID.getName(); |
| BB = new BasicBlock(Name, CurFun.CurrentFunction); |
| |
| // Insert it in the forward refs map. |
| CurFun.BBForwardRefs[ID] = BB; |
| |
| return BB; |
| } |
| |
| |
| //===----------------------------------------------------------------------===// |
| // Code to handle forward references in instructions |
| //===----------------------------------------------------------------------===// |
| // |
| // This code handles the late binding needed with statements that reference |
| // values not defined yet... for example, a forward branch, or the PHI node for |
| // a loop body. |
| // |
| // This keeps a table (CurFun.LateResolveValues) of all such forward references |
| // and back patchs after we are done. |
| // |
| |
| // ResolveDefinitions - If we could not resolve some defs at parsing |
| // time (forward branches, phi functions for loops, etc...) resolve the |
| // defs now... |
| // |
| static void |
| ResolveDefinitions(ValueList &LateResolvers, ValueList *FutureLateResolvers) { |
| // Loop over LateResolveDefs fixing up stuff that couldn't be resolved |
| while (!LateResolvers.empty()) { |
| Value *V = LateResolvers.back(); |
| LateResolvers.pop_back(); |
| |
| std::map<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 = getExistingVal(V->getType(), DID); |
| if (TriggerError) |
| return; |
| if (TheRealValue) { |
| V->replaceAllUsesWith(TheRealValue); |
| delete V; |
| CurModule.PlaceHolderInfo.erase(PHI); |
| } else if (FutureLateResolvers) { |
| // Functions have their unresolved items forwarded to the module late |
| // resolver table |
| InsertValue(V, *FutureLateResolvers); |
| } else { |
| if (DID.Type == ValID::LocalName || DID.Type == ValID::GlobalName) { |
| GenerateError("Reference to an invalid definition: '" +DID.getName()+ |
| "' of type '" + V->getType()->getDescription() + "'", |
| PHI->second.second); |
| return; |
| } else { |
| GenerateError("Reference to an invalid definition: #" + |
| itostr(DID.Num) + " of type '" + |
| V->getType()->getDescription() + "'", |
| PHI->second.second); |
| return; |
| } |
| } |
| } |
| LateResolvers.clear(); |
| } |
| |
| // ResolveTypeTo - A brand new type was just declared. This means that (if |
| // name is not null) things referencing Name can be resolved. Otherwise, things |
| // refering to the number can be resolved. Do this now. |
| // |
| static void ResolveTypeTo(std::string *Name, const Type *ToTy) { |
| ValID D; |
| if (Name) |
| D = ValID::createLocalName(*Name); |
| else |
| D = ValID::createLocalID(CurModule.Types.size()); |
| |
| std::map<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, std::string *NameStr) { |
| if (!NameStr) return; |
| std::string Name(*NameStr); // Copy string |
| delete NameStr; // Free old string |
| |
| if (V->getType() == Type::VoidTy) { |
| GenerateError("Can't assign name '" + Name+"' to value with void type"); |
| return; |
| } |
| |
| assert(inFunctionScope() && "Must be in function scope!"); |
| ValueSymbolTable &ST = CurFun.CurrentFunction->getValueSymbolTable(); |
| if (ST.lookup(Name)) { |
| GenerateError("Redefinition of value '" + Name + "' of type '" + |
| V->getType()->getDescription() + "'"); |
| return; |
| } |
| |
| // Set the name. |
| V->setName(Name); |
| } |
| |
| /// ParseGlobalVariable - Handle parsing of a global. If Initializer is null, |
| /// this is a declaration, otherwise it is a definition. |
| static GlobalVariable * |
| ParseGlobalVariable(std::string *NameStr, |
| GlobalValue::LinkageTypes Linkage, |
| GlobalValue::VisibilityTypes Visibility, |
| bool isConstantGlobal, const Type *Ty, |
| Constant *Initializer, bool IsThreadLocal) { |
| 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 |
| delete NameStr; // Free old string |
| } |
| |
| // See if this global value was forward referenced. If so, recycle the |
| // object. |
| ValID ID; |
| if (!Name.empty()) { |
| ID = ValID::createGlobalName(Name); |
| } else { |
| ID = ValID::createGlobalID(CurModule.Values.size()); |
| } |
| |
| if (GlobalValue *FWGV = CurModule.GetForwardRefForGlobal(PTy, ID)) { |
| // Move the global to the end of the list, from whereever it was |
| // previously inserted. |
| GlobalVariable *GV = cast<GlobalVariable>(FWGV); |
| CurModule.CurrentModule->getGlobalList().remove(GV); |
| CurModule.CurrentModule->getGlobalList().push_back(GV); |
| GV->setInitializer(Initializer); |
| GV->setLinkage(Linkage); |
| GV->setVisibility(Visibility); |
| GV->setConstant(isConstantGlobal); |
| GV->setThreadLocal(IsThreadLocal); |
| InsertValue(GV, CurModule.Values); |
| return GV; |
| } |
| |
| // If this global has a name |
| if (!Name.empty()) { |
| // if the global we're parsing has an initializer (is a definition) and |
| // has external linkage. |
| if (Initializer && Linkage != GlobalValue::InternalLinkage) |
| // If there is already a global with external linkage with this name |
| if (CurModule.CurrentModule->getGlobalVariable(Name, false)) { |
| // If we allow this GVar to get created, it will be renamed in the |
| // symbol table because it conflicts with an existing GVar. We can't |
| // allow redefinition of GVars whose linking indicates that their name |
| // must stay the same. Issue the error. |
| GenerateError("Redefinition of global variable named '" + Name + |
| "' of type '" + Ty->getDescription() + "'"); |
| return 0; |
| } |
| } |
| |
| // Otherwise there is no existing GV to use, create one now. |
| GlobalVariable *GV = |
| new GlobalVariable(Ty, isConstantGlobal, Linkage, Initializer, Name, |
| CurModule.CurrentModule, IsThreadLocal); |
| GV->setVisibility(Visibility); |
| InsertValue(GV, CurModule.Values); |
| return GV; |
| } |
| |
| // setTypeName - Set the specified type to the name given. The name may be |
| // null potentially, in which case this is a noop. The string passed in is |
| // assumed to be a malloc'd string buffer, and is freed by this function. |
| // |
| // This function returns true if the type has already been defined, but is |
| // allowed to be redefined in the specified context. If the name is a new name |
| // for the type plane, it is inserted and false is returned. |
| static bool setTypeName(const Type *T, std::string *NameStr) { |
| assert(!inFunctionScope() && "Can't give types function-local names!"); |
| if (NameStr == 0) return false; |
| |
| std::string Name(*NameStr); // Copy string |
| delete NameStr; // Free old string |
| |
| // We don't allow assigning names to void type |
| if (T == Type::VoidTy) { |
| GenerateError("Can't assign name '" + Name + "' to the void type"); |
| return false; |
| } |
| |
| // Set the type name, checking for conflicts as we do so. |
| bool AlreadyExists = CurModule.CurrentModule->addTypeName(Name, T); |
| |
| if (AlreadyExists) { // Inserting a name that is already defined??? |
| const Type *Existing = CurModule.CurrentModule->getTypeByName(Name); |
| assert(Existing && "Conflict but no matching type?!"); |
| |
| // There is only one case where this is allowed: when we are refining an |
| // opaque type. In this case, Existing will be an opaque type. |
| if (const OpaqueType *OpTy = dyn_cast<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 + "' of type '" + |
| T->getDescription() + "'"); |
| } |
| |
| return false; |
| } |
| |
| //===----------------------------------------------------------------------===// |
| // Code for handling upreferences in type names... |
| // |
| |
| // TypeContains - Returns true if Ty directly contains E in it. |
| // |
| static bool TypeContains(const Type *Ty, const Type *E) { |
| return std::find(Ty->subtype_begin(), Ty->subtype_end(), |
| E) != Ty->subtype_end(); |
| } |
| |
| namespace { |
| struct UpRefRecord { |
| // NestingLevel - The number of nesting levels that need to be popped before |
| // this type is resolved. |
| unsigned NestingLevel; |
| |
| // LastContainedTy - This is the type at the current binding level for the |
| // type. Every time we reduce the nesting level, this gets updated. |
| const Type *LastContainedTy; |
| |
| // UpRefTy - This is the actual opaque type that the upreference is |
| // represented with. |
| OpaqueType *UpRefTy; |
| |
| UpRefRecord(unsigned NL, OpaqueType *URTy) |
| : NestingLevel(NL), LastContainedTy(URTy), UpRefTy(URTy) {} |
| }; |
| } |
| |
| // UpRefs - A list of the outstanding upreferences that need to be resolved. |
| static std::vector<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; |
| } |
| |
| //===----------------------------------------------------------------------===// |
| // RunVMAsmParser - Define an interface to this parser |
| //===----------------------------------------------------------------------===// |
| // |
| static Module* RunParser(Module * M); |
| |
| Module *llvm::RunVMAsmParser(llvm::MemoryBuffer *MB) { |
| InitLLLexer(MB); |
| Module *M = RunParser(new Module(LLLgetFilename())); |
| FreeLexer(); |
| return M; |
| } |
| |
| |
| |
| /* 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 |
| typedef union YYSTYPE |
| #line 945 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| llvm::Module *ModuleVal; |
| llvm::Function *FunctionVal; |
| llvm::BasicBlock *BasicBlockVal; |
| llvm::TerminatorInst *TermInstVal; |
| llvm::Instruction *InstVal; |
| llvm::Constant *ConstVal; |
| |
| const llvm::Type *PrimType; |
| std::list<llvm::PATypeHolder> *TypeList; |
| llvm::PATypeHolder *TypeVal; |
| llvm::Value *ValueVal; |
| std::vector<llvm::Value*> *ValueList; |
| llvm::ArgListType *ArgList; |
| llvm::TypeWithAttrs TypeWithAttrs; |
| llvm::TypeWithAttrsList *TypeWithAttrsList; |
| llvm::ParamList *ParamList; |
| |
| // 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; |
| llvm::GlobalValue::VisibilityTypes Visibility; |
| uint16_t ParamAttrs; |
| llvm::APInt *APIntVal; |
| int64_t SInt64Val; |
| uint64_t UInt64Val; |
| int SIntVal; |
| unsigned UIntVal; |
| llvm::APFloat *FPVal; |
| bool BoolVal; |
| |
| std::string *StrVal; // This memory must be deleted |
| llvm::ValID ValIDVal; |
| |
| llvm::Instruction::BinaryOps BinaryOpVal; |
| llvm::Instruction::TermOps TermOpVal; |
| llvm::Instruction::MemoryOps MemOpVal; |
| llvm::Instruction::CastOps CastOpVal; |
| llvm::Instruction::OtherOps OtherOpVal; |
| llvm::ICmpInst::Predicate IPredicate; |
| llvm::FCmpInst::Predicate FPredicate; |
| } |
| /* Line 187 of yacc.c. */ |
| #line 1376 "llvmAsmParser.tab.c" |
| YYSTYPE; |
| # 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 216 of yacc.c. */ |
| #line 1389 "llvmAsmParser.tab.c" |
| |
| #ifdef short |
| # undef short |
| #endif |
| |
| #ifdef YYTYPE_UINT8 |
| typedef YYTYPE_UINT8 yytype_uint8; |
| #else |
| typedef unsigned char yytype_uint8; |
| #endif |
| |
| #ifdef YYTYPE_INT8 |
| typedef YYTYPE_INT8 yytype_int8; |
| #elif (defined __STDC__ || defined __C99__FUNC__ \ |
| || defined __cplusplus || defined _MSC_VER) |
| typedef signed char yytype_int8; |
| #else |
| typedef short int yytype_int8; |
| #endif |
| |
| #ifdef YYTYPE_UINT16 |
| typedef YYTYPE_UINT16 yytype_uint16; |
| #else |
| typedef unsigned short int yytype_uint16; |
| #endif |
| |
| #ifdef YYTYPE_INT16 |
| typedef YYTYPE_INT16 yytype_int16; |
| #else |
| typedef short int yytype_int16; |
| #endif |
| |
| #ifndef YYSIZE_T |
| # ifdef __SIZE_TYPE__ |
| # define YYSIZE_T __SIZE_TYPE__ |
| # elif defined size_t |
| # define YYSIZE_T size_t |
| # elif ! defined YYSIZE_T && (defined __STDC__ || defined __C99__FUNC__ \ |
| || defined __cplusplus || defined _MSC_VER) |
| # include <stddef.h> /* INFRINGES ON USER NAME SPACE */ |
| # define YYSIZE_T size_t |
| # else |
| # define YYSIZE_T unsigned int |
| # endif |
| #endif |
| |
| #define YYSIZE_MAXIMUM ((YYSIZE_T) -1) |
| |
| #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 |
| |
| /* Suppress unused-variable warnings by "using" E. */ |
| #if ! defined lint || defined __GNUC__ |
| # define YYUSE(e) ((void) (e)) |
| #else |
| # define YYUSE(e) /* empty */ |
| #endif |
| |
| /* Identity function, used to suppress warnings about constant conditions. */ |
| #ifndef lint |
| # define YYID(n) (n) |
| #else |
| #if (defined __STDC__ || defined __C99__FUNC__ \ |
| || defined __cplusplus || defined _MSC_VER) |
| static int |
| YYID (int i) |
| #else |
| static int |
| YYID (i) |
| int i; |
| #endif |
| { |
| return i; |
| } |
| #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 |
| # elif defined __BUILTIN_VA_ARG_INCR |
| # include <alloca.h> /* INFRINGES ON USER NAME SPACE */ |
| # elif defined _AIX |
| # define YYSTACK_ALLOC __alloca |
| # elif defined _MSC_VER |
| # include <malloc.h> /* INFRINGES ON USER NAME SPACE */ |
| # define alloca _alloca |
| # else |
| # define YYSTACK_ALLOC alloca |
| # if ! defined _ALLOCA_H && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \ |
| || defined __cplusplus || defined _MSC_VER) |
| # include <stdlib.h> /* INFRINGES ON USER NAME SPACE */ |
| # ifndef _STDLIB_H |
| # define _STDLIB_H 1 |
| # endif |
| # endif |
| # endif |
| # endif |
| # endif |
| |
| # ifdef YYSTACK_ALLOC |
| /* Pacify GCC's `empty if-body' warning. */ |
| # define YYSTACK_FREE(Ptr) do { /* empty */; } while (YYID (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 2006 */ |
| # endif |
| # else |
| # define YYSTACK_ALLOC YYMALLOC |
| # define YYSTACK_FREE YYFREE |
| # ifndef YYSTACK_ALLOC_MAXIMUM |
| # define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM |
| # endif |
| # if (defined __cplusplus && ! defined _STDLIB_H \ |
| && ! ((defined YYMALLOC || defined malloc) \ |
| && (defined YYFREE || defined free))) |
| # include <stdlib.h> /* INFRINGES ON USER NAME SPACE */ |
| # ifndef _STDLIB_H |
| # define _STDLIB_H 1 |
| # endif |
| # endif |
| # ifndef YYMALLOC |
| # define YYMALLOC malloc |
| # if ! defined malloc && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \ |
| || defined __cplusplus || defined _MSC_VER) |
| void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */ |
| # endif |
| # endif |
| # ifndef YYFREE |
| # define YYFREE free |
| # if ! defined free && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \ |
| || defined __cplusplus || defined _MSC_VER) |
| void free (void *); /* INFRINGES ON USER NAME SPACE */ |
| # endif |
| # 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 |
| { |
| yytype_int16 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 (yytype_int16) + 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 (YYID (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 (YYID (0)) |
| |
| #endif |
| |
| /* YYFINAL -- State number of the termination state. */ |
| #define YYFINAL 43 |
| /* YYLAST -- Last index in YYTABLE. */ |
| #define YYLAST 1816 |
| |
| /* YYNTOKENS -- Number of terminals. */ |
| #define YYNTOKENS 162 |
| /* YYNNTS -- Number of nonterminals. */ |
| #define YYNNTS 82 |
| /* YYNRULES -- Number of rules. */ |
| #define YYNRULES 314 |
| /* YYNRULES -- Number of states. */ |
| #define YYNSTATES 608 |
| |
| /* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */ |
| #define YYUNDEFTOK 2 |
| #define YYMAXUTOK 402 |
| |
| #define YYTRANSLATE(YYX) \ |
| ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK) |
| |
| /* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */ |
| static const yytype_uint8 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, |
| 152, 153, 150, 2, 149, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 157, 148, 158, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 154, 151, 156, 2, 2, 2, 2, 2, 161, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 155, 2, 2, 159, 2, 160, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 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, 111, 112, 113, 114, |
| 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, |
| 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, |
| 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, |
| 145, 146, 147 |
| }; |
| |
| #if YYDEBUG |
| /* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in |
| YYRHS. */ |
| static const yytype_uint16 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, 73, 75, 77, |
| 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, |
| 99, 101, 103, 105, 107, 109, 111, 113, 115, 117, |
| 119, 121, 123, 125, 127, 129, 130, 133, 134, 136, |
| 138, 140, 141, 144, 146, 148, 150, 152, 154, 156, |
| 158, 160, 161, 163, 165, 167, 168, 170, 172, 173, |
| 175, 177, 179, 181, 182, 184, 186, 187, 189, 191, |
| 193, 195, 197, 200, 202, 204, 206, 208, 210, 212, |
| 214, 216, 218, 219, 222, 224, 226, 228, 230, 232, |
| 234, 235, 238, 239, 242, 243, 247, 250, 251, 253, |
| 254, 258, 260, 263, 265, 267, 269, 271, 273, 275, |
| 277, 279, 281, 284, 286, 289, 295, 301, 307, 313, |
| 317, 320, 326, 331, 334, 336, 338, 340, 344, 346, |
| 350, 352, 353, 355, 359, 364, 368, 372, 377, 382, |
| 386, 393, 399, 402, 405, 408, 411, 414, 417, 420, |
| 423, 426, 429, 432, 435, 442, 448, 457, 464, 471, |
| 479, 487, 494, 503, 512, 516, 518, 520, 522, 524, |
| 525, 528, 535, 537, 538, 540, 543, 544, 548, 549, |
| 553, 557, 561, 565, 566, 574, 575, 584, 585, 594, |
| 600, 603, 607, 609, 613, 617, 621, 625, 627, 628, |
| 634, 638, 640, 644, 646, 647, 657, 659, 661, 666, |
| 668, 670, 673, 677, 678, 680, 682, 684, 686, 688, |
| 690, 692, 694, 696, 700, 702, 708, 710, 712, 714, |
| 716, 718, 720, 723, 726, 729, 733, 736, 737, 739, |
| 742, 745, 749, 759, 769, 778, 793, 795, 797, 804, |
| 810, 813, 820, 828, 833, 838, 845, 852, 853, 854, |
| 858, 861, 863, 869, 875, 882, 889, 894, 901, 906, |
| 911, 918, 925, 928, 937, 939, 941, 942, 946, 953, |
| 957, 964, 967, 973, 981 |
| }; |
| |
| /* YYRHS -- A `-1'-separated list of the rules' RHS. */ |
| static const yytype_int16 yyrhs[] = |
| { |
| 206, 0, -1, 73, -1, 74, -1, 75, -1, 76, |
| -1, 77, -1, 78, -1, 79, -1, 80, -1, 81, |
| -1, 85, -1, 86, -1, 87, -1, 82, -1, 83, |
| -1, 84, -1, 116, -1, 117, -1, 118, -1, 119, |
| -1, 120, -1, 121, -1, 122, -1, 123, -1, 124, |
| -1, 125, -1, 126, -1, 127, -1, 90, -1, 91, |
| -1, 92, -1, 93, -1, 94, -1, 95, -1, 96, |
| -1, 97, -1, 98, -1, 99, -1, 100, -1, 101, |
| -1, 102, -1, 103, -1, 104, -1, 105, -1, 106, |
| -1, 107, -1, 108, -1, 109, -1, 96, -1, 97, |
| -1, 98, -1, 99, -1, 26, -1, 27, -1, 11, |
| -1, 12, -1, 13, -1, 16, -1, 15, -1, 14, |
| -1, 19, -1, 22, -1, 24, -1, 170, -1, -1, |
| 170, 148, -1, -1, 20, -1, 23, -1, 175, -1, |
| -1, 173, 148, -1, 42, -1, 44, -1, 43, -1, |
| 45, -1, 47, -1, 46, -1, 48, -1, 50, -1, |
| -1, 145, -1, 146, -1, 147, -1, -1, 46, -1, |
| 48, -1, -1, 42, -1, 43, -1, 44, -1, 47, |
| -1, -1, 44, -1, 42, -1, -1, 61, -1, 62, |
| -1, 63, -1, 64, -1, 65, -1, 60, 4, -1, |
| 135, -1, 117, -1, 134, -1, 118, -1, 137, -1, |
| 138, -1, 140, -1, 141, -1, 142, -1, -1, 184, |
| 183, -1, 136, -1, 139, -1, 135, -1, 134, -1, |
| 143, -1, 144, -1, -1, 186, 185, -1, -1, 53, |
| 4, -1, -1, 149, 53, 4, -1, 34, 22, -1, |
| -1, 189, -1, -1, 149, 192, 191, -1, 189, -1, |
| 53, 4, -1, 11, -1, 12, -1, 13, -1, 16, |
| -1, 15, -1, 14, -1, 17, -1, 49, -1, 193, |
| -1, 194, 150, -1, 228, -1, 151, 4, -1, 194, |
| 152, 198, 153, 186, -1, 10, 152, 198, 153, 186, |
| -1, 154, 4, 155, 194, 156, -1, 157, 4, 155, |
| 194, 158, -1, 159, 199, 160, -1, 159, 160, -1, |
| 157, 159, 199, 160, 158, -1, 157, 159, 160, 158, |
| -1, 194, 184, -1, 194, -1, 10, -1, 195, -1, |
| 197, 149, 195, -1, 197, -1, 197, 149, 39, -1, |
| 39, -1, -1, 194, -1, 199, 149, 194, -1, 194, |
| 154, 202, 156, -1, 194, 154, 156, -1, 194, 161, |
| 22, -1, 194, 157, 202, 158, -1, 194, 159, 202, |
| 160, -1, 194, 159, 160, -1, 194, 157, 159, 202, |
| 160, 158, -1, 194, 157, 159, 160, 158, -1, 194, |
| 40, -1, 194, 41, -1, 194, 228, -1, 194, 201, |
| -1, 194, 25, -1, 168, 3, -1, 168, 5, -1, |
| 168, 4, -1, 168, 6, -1, 11, 26, -1, 11, |
| 27, -1, 169, 9, -1, 165, 152, 200, 38, 194, |
| 153, -1, 115, 152, 200, 239, 153, -1, 129, 152, |
| 200, 149, 200, 149, 200, 153, -1, 163, 152, 200, |
| 149, 200, 153, -1, 164, 152, 200, 149, 200, 153, |
| -1, 88, 166, 152, 200, 149, 200, 153, -1, 89, |
| 167, 152, 200, 149, 200, 153, -1, 131, 152, 200, |
| 149, 200, 153, -1, 132, 152, 200, 149, 200, 149, |
| 200, 153, -1, 133, 152, 200, 149, 200, 149, 200, |
| 153, -1, 202, 149, 200, -1, 200, -1, 32, -1, |
| 33, -1, 37, -1, -1, 196, 228, -1, 121, 152, |
| 205, 38, 194, 153, -1, 207, -1, -1, 208, -1, |
| 207, 208, -1, -1, 31, 209, 224, -1, -1, 30, |
| 210, 225, -1, 58, 57, 214, -1, 172, 18, 194, |
| -1, 172, 18, 10, -1, -1, 174, 178, 204, 203, |
| 200, 211, 191, -1, -1, 174, 176, 178, 204, 203, |
| 200, 212, 191, -1, -1, 174, 177, 178, 204, 203, |
| 194, 213, 191, -1, 174, 178, 35, 181, 205, -1, |
| 51, 215, -1, 54, 148, 216, -1, 22, -1, 52, |
| 148, 22, -1, 66, 148, 22, -1, 154, 217, 156, |
| -1, 217, 149, 22, -1, 22, -1, -1, 218, 149, |
| 194, 184, 171, -1, 194, 184, 171, -1, 218, -1, |
| 218, 149, 39, -1, 39, -1, -1, 182, 196, 173, |
| 152, 219, 153, 186, 190, 187, -1, 28, -1, 159, |
| -1, 180, 178, 220, 221, -1, 29, -1, 160, -1, |
| 231, 223, -1, 179, 178, 220, -1, -1, 59, -1, |
| 3, -1, 4, -1, 9, -1, 26, -1, 27, -1, |
| 40, -1, 41, -1, 25, -1, 157, 202, 158, -1, |
| 201, -1, 57, 226, 22, 149, 22, -1, 7, -1, |
| 8, -1, 170, -1, 173, -1, 228, -1, 227, -1, |
| 194, 229, -1, 231, 232, -1, 222, 232, -1, 233, |
| 172, 234, -1, 233, 236, -1, -1, 21, -1, 67, |
| 230, -1, 67, 10, -1, 68, 17, 229, -1, 68, |
| 11, 229, 149, 17, 229, 149, 17, 229, -1, 69, |
| 168, 229, 149, 17, 229, 154, 235, 156, -1, 69, |
| 168, 229, 149, 17, 229, 154, 156, -1, 70, 182, |
| 196, 229, 152, 238, 153, 186, 38, 17, 229, 71, |
| 17, 229, -1, 71, -1, 72, -1, 235, 168, 227, |
| 149, 17, 229, -1, 168, 227, 149, 17, 229, -1, |
| 172, 241, -1, 194, 154, 229, 149, 229, 156, -1, |
| 237, 149, 154, 229, 149, 229, 156, -1, 194, 184, |
| 229, 184, -1, 17, 184, 229, 184, -1, 238, 149, |
| 194, 184, 229, 184, -1, 238, 149, 17, 184, 229, |
| 184, -1, -1, -1, 239, 149, 230, -1, 56, 55, |
| -1, 55, -1, 163, 194, 229, 149, 229, -1, 164, |
| 194, 229, 149, 229, -1, 88, 166, 194, 229, 149, |
| 229, -1, 89, 167, 194, 229, 149, 229, -1, 165, |
| 230, 38, 194, -1, 129, 230, 149, 230, 149, 230, |
| -1, 130, 230, 149, 194, -1, 131, 230, 149, 230, |
| -1, 132, 230, 149, 230, 149, 230, -1, 133, 230, |
| 149, 230, 149, 230, -1, 128, 237, -1, 240, 182, |
| 196, 229, 152, 238, 153, 186, -1, 243, -1, 36, |
| -1, -1, 110, 194, 188, -1, 110, 194, 149, 11, |
| 229, 188, -1, 111, 194, 188, -1, 111, 194, 149, |
| 11, 229, 188, -1, 112, 230, -1, 242, 113, 194, |
| 229, 188, -1, 242, 114, 230, 149, 194, 229, 188, |
| -1, 115, 194, 229, 239, -1 |
| }; |
| |
| /* YYRLINE[YYN] -- source line where rule number YYN was defined. */ |
| static const yytype_uint16 yyrline[] = |
| { |
| 0, 1105, 1105, 1105, 1105, 1105, 1105, 1105, 1105, 1105, |
| 1105, 1106, 1106, 1106, 1106, 1106, 1106, 1107, 1107, 1107, |
| 1107, 1107, 1107, 1108, 1108, 1108, 1108, 1108, 1108, 1111, |
| 1111, 1112, 1112, 1113, 1113, 1114, 1114, 1115, 1115, 1119, |
| 1119, 1120, 1120, 1121, 1121, 1122, 1122, 1123, 1123, 1124, |
| 1124, 1125, 1125, 1126, 1127, 1132, 1133, 1133, 1133, 1133, |
| 1133, 1135, 1135, 1135, 1136, 1136, 1140, 1144, 1149, 1149, |
| 1151, 1152, 1157, 1163, 1164, 1165, 1166, 1167, 1171, 1172, |
| 1173, 1177, 1178, 1179, 1180, 1184, 1185, 1186, 1190, 1191, |
| 1192, 1193, 1194, 1198, 1199, 1200, 1203, 1204, 1205, 1206, |
| 1207, 1208, 1209, 1216, 1217, 1218, 1219, 1220, 1221, 1222, |
| 1223, 1224, 1227, 1228, 1233, 1234, 1235, 1236, 1237, 1238, |
| 1241, 1242, 1249, 1250, 1256, 1257, 1265, 1273, 1274, 1279, |
| 1280, 1281, 1286, 1299, 1299, 1299, 1299, 1299, 1299, 1299, |
| 1302, 1306, 1310, 1317, 1322, 1330, 1348, 1366, 1371, 1381, |
| 1391, 1395, 1405, 1412, 1421, 1428, 1433, 1438, 1445, 1446, |
| 1453, 1460, 1468, 1474, 1486, 1514, 1530, 1557, 1585, 1611, |
| 1631, 1657, 1677, 1689, 1696, 1762, 1772, 1782, 1788, 1798, |
| 1804, 1814, 1819, 1824, 1837, 1849, 1871, 1879, 1885, 1896, |
| 1901, 1906, 1912, 1918, 1927, 1931, 1939, 1939, 1942, 1942, |
| 1945, 1957, 1978, 1983, 1991, 1992, 1996, 1996, 2000, 2000, |
| 2003, 2006, 2030, 2041, 2041, 2052, 2051, 2061, 2060, 2071, |
| 2111, 2114, 2120, 2130, 2134, 2139, 2141, 2146, 2151, 2160, |
| 2170, 2181, 2185, 2194, 2203, 2208, 2338, 2338, 2340, 2349, |
| 2349, 2351, 2356, 2368, 2372, 2377, 2381, 2385, 2389, 2393, |
| 2397, 2401, 2405, 2409, 2434, 2438, 2448, 2452, 2456, 2461, |
| 2468, 2468, 2474, 2483, 2487, 2496, 2505, 2514, 2518, 2525, |
| 2529, 2533, 2538, 2548, 2567, 2576, 2660, 2664, 2671, 2682, |
| 2695, 2705, 2716, 2726, 2737, 2745, 2755, 2762, 2765, 2766, |
| 2773, 2777, 2782, 2798, 2815, 2829, 2843, 2855, 2863, 2870, |
| 2876, 2882, 2888, 2903, 2994, 2999, 3003, 3010, 3017, 3025, |
| 3032, 3040, 3048, 3062, 3079 |
| }; |
| #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", "ESAPINTVAL", |
| "EUAPINTVAL", "LOCALVAL_ID", "GLOBALVAL_ID", "FPVAL", "VOID", "INTTYPE", |
| "FLOAT", "DOUBLE", "X86_FP80", "FP128", "PPC_FP128", "LABEL", "TYPE", |
| "LOCALVAR", "GLOBALVAR", "LABELSTR", "STRINGCONSTANT", |
| "ATSTRINGCONSTANT", "PCTSTRINGCONSTANT", "ZEROINITIALIZER", "TRUETOK", |
| "FALSETOK", "BEGINTOK", "ENDTOK", "DECLARE", "DEFINE", "GLOBAL", |
| "CONSTANT", "SECTION", "ALIAS", "VOLATILE", "THREAD_LOCAL", "TO", |
| "DOTDOTDOT", "NULL_TOK", "UNDEF", "INTERNAL", "LINKONCE", "WEAK", |
| "APPENDING", "DLLIMPORT", "DLLEXPORT", "EXTERN_WEAK", "OPAQUE", |
| "EXTERNAL", "TARGET", "TRIPLE", "ALIGN", "DEPLIBS", "CALL", "TAIL", |
| "ASM_TOK", "MODULE", "SIDEEFFECT", "CC_TOK", "CCC_TOK", "FASTCC_TOK", |
| "COLDCC_TOK", "X86_STDCALLCC_TOK", "X86_FASTCALLCC_TOK", "DATALAYOUT", |
| "RET", "BR", "SWITCH", "INVOKE", "UNWIND", "UNREACHABLE", "ADD", "SUB", |
| "MUL", "UDIV", "SDIV", "FDIV", "UREM", "SREM", "FREM", "AND", "OR", |
| "XOR", "SHL", "LSHR", "ASHR", "ICMP", "FCMP", "EQ", "NE", "SLT", "SGT", |
| "SLE", "SGE", "ULT", "UGT", "ULE", "UGE", "OEQ", "ONE", "OLT", "OGT", |
| "OLE", "OGE", "ORD", "UNO", "UEQ", "UNE", "MALLOC", "ALLOCA", "FREE", |
| "LOAD", "STORE", "GETELEMENTPTR", "TRUNC", "ZEXT", "SEXT", "FPTRUNC", |
| "FPEXT", "BITCAST", "UITOFP", "SITOFP", "FPTOUI", "FPTOSI", "INTTOPTR", |
| "PTRTOINT", "PHI_TOK", "SELECT", "VAARG", "EXTRACTELEMENT", |
| "INSERTELEMENT", "SHUFFLEVECTOR", "SIGNEXT", "ZEROEXT", "NORETURN", |
| "INREG", "SRET", "NOUNWIND", "NOALIAS", "BYVAL", "NEST", "READNONE", |
| "READONLY", "DEFAULT", "HIDDEN", "PROTECTED", "'='", "','", "'*'", |
| "'\\\\'", "'('", "')'", "'['", "'x'", "']'", "'<'", "'>'", "'{'", "'}'", |
| "'c'", "$accept", "ArithmeticOps", "LogicalOps", "CastOps", |
| "IPredicates", "FPredicates", "IntType", "FPType", "LocalName", |
| "OptLocalName", "OptLocalAssign", "GlobalName", "OptGlobalAssign", |
| "GlobalAssign", "GVInternalLinkage", "GVExternalLinkage", |
| "GVVisibilityStyle", "FunctionDeclareLinkage", "FunctionDefineLinkage", |
| "AliasLinkage", "OptCallingConv", "ParamAttr", "OptParamAttrs", |
| "FuncAttr", "OptFuncAttrs", "OptAlign", "OptCAlign", "SectionString", |
| "OptSection", "GlobalVarAttributes", "GlobalVarAttribute", "PrimType", |
| "Types", "ArgType", "ResultTypes", "ArgTypeList", "ArgTypeListI", |
| "TypeListI", "ConstVal", "ConstExpr", "ConstVector", "GlobalType", |
| "ThreadLocal", "AliaseeRef", "Module", "DefinitionList", "Definition", |
| "@1", "@2", "@3", "@4", "@5", "AsmBlock", "TargetDefinition", |
| "LibrariesDefinition", "LibList", "ArgListH", "ArgList", |
| "FunctionHeaderH", "BEGIN", "FunctionHeader", "END", "Function", |
| "FunctionProto", "OptSideEffect", "ConstValueRef", "SymbolicValueRef", |
| "ValueRef", "ResolvedVal", "BasicBlockList", "BasicBlock", |
| "InstructionList", "BBTerminatorInst", "JumpTable", "Inst", "PHIList", |
| "ParamList", "IndexList", "OptTailCall", "InstVal", "OptVolatile", |
| "MemoryInst", 0 |
| }; |
| #endif |
| |
| # ifdef YYPRINT |
| /* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to |
| token YYLEX-NUM. */ |
| static const yytype_uint16 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, 366, 367, 368, 369, 370, 371, 372, 373, 374, |
| 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, |
| 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, |
| 395, 396, 397, 398, 399, 400, 401, 402, 61, 44, |
| 42, 92, 40, 41, 91, 120, 93, 60, 62, 123, |
| 125, 99 |
| }; |
| # endif |
| |
| /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ |
| static const yytype_uint8 yyr1[] = |
| { |
| 0, 162, 163, 163, 163, 163, 163, 163, 163, 163, |
| 163, 164, 164, 164, 164, 164, 164, 165, 165, 165, |
| 165, 165, 165, 165, 165, 165, 165, 165, 165, 166, |
| 166, 166, 166, 166, 166, 166, 166, 166, 166, 167, |
| 167, 167, 167, 167, 167, 167, 167, 167, 167, 167, |
| 167, 167, 167, 167, 167, 168, 169, 169, 169, 169, |
| 169, 170, 170, 170, 171, 171, 172, 172, 173, 173, |
| 174, 174, 175, 176, 176, 176, 176, 176, 177, 177, |
| 177, 178, 178, 178, 178, 179, 179, 179, 180, 180, |
| 180, 180, 180, 181, 181, 181, 182, 182, 182, 182, |
| 182, 182, 182, 183, 183, 183, 183, 183, 183, 183, |
| 183, 183, 184, 184, 185, 185, 185, 185, 185, 185, |
| 186, 186, 187, 187, 188, 188, 189, 190, 190, 191, |
| 191, 192, 192, 193, 193, 193, 193, 193, 193, 193, |
| 194, 194, 194, 194, 194, 194, 194, 194, 194, 194, |
| 194, 194, 194, 195, 196, 196, 197, 197, 198, 198, |
| 198, 198, 199, 199, 200, 200, 200, 200, 200, 200, |
| 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, |
| 200, 200, 200, 200, 201, 201, 201, 201, 201, 201, |
| 201, 201, 201, 201, 202, 202, 203, 203, 204, 204, |
| 205, 205, 206, 206, 207, 207, 209, 208, 210, 208, |
| 208, 208, 208, 211, 208, 212, 208, 213, 208, 208, |
| 208, 208, 214, 215, 215, 216, 217, 217, 217, 218, |
| 218, 219, 219, 219, 219, 220, 221, 221, 222, 223, |
| 223, 224, 225, 226, 226, 227, 227, 227, 227, 227, |
| 227, 227, 227, 227, 227, 227, 228, 228, 228, 228, |
| 229, 229, 230, 231, 231, 232, 233, 233, 233, 234, |
| 234, 234, 234, 234, 234, 234, 234, 234, 235, 235, |
| 236, 237, 237, 238, 238, 238, 238, 238, 239, 239, |
| 240, 240, 241, 241, 241, 241, 241, 241, 241, 241, |
| 241, 241, 241, 241, 241, 242, 242, 243, 243, 243, |
| 243, 243, 243, 243, 243 |
| }; |
| |
| /* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */ |
| static const yytype_uint8 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, 1, 1, 1, 1, |
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 1, 1, 1, 1, 1, 0, 2, 0, 1, 1, |
| 1, 0, 2, 1, 1, 1, 1, 1, 1, 1, |
| 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, |
| 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, |
| 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, |
| 1, 1, 0, 2, 1, 1, 1, 1, 1, 1, |
| 0, 2, 0, 2, 0, 3, 2, 0, 1, 0, |
| 3, 1, 2, 1, 1, 1, 1, 1, 1, 1, |
| 1, 1, 2, 1, 2, 5, 5, 5, 5, 3, |
| 2, 5, 4, 2, 1, 1, 1, 3, 1, 3, |
| 1, 0, 1, 3, 4, 3, 3, 4, 4, 3, |
| 6, 5, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 6, 5, 8, 6, 6, 7, |
| 7, 6, 8, 8, 3, 1, 1, 1, 1, 0, |
| 2, 6, 1, 0, 1, 2, 0, 3, 0, 3, |
| 3, 3, 3, 0, 7, 0, 8, 0, 8, 5, |
| 2, 3, 1, 3, 3, 3, 3, 1, 0, 5, |
| 3, 1, 3, 1, 0, 9, 1, 1, 4, 1, |
| 1, 2, 3, 0, 1, 1, 1, 1, 1, 1, |
| 1, 1, 1, 3, 1, 5, 1, 1, 1, 1, |
| 1, 1, 2, 2, 2, 3, 2, 0, 1, 2, |
| 2, 3, 9, 9, 8, 14, 1, 1, 6, 5, |
| 2, 6, 7, 4, 4, 6, 6, 0, 0, 3, |
| 2, 1, 5, 5, 6, 6, 4, 6, 4, 4, |
| 6, 6, 2, 8, 1, 1, 0, 3, 6, 3, |
| 6, 2, 5, 7, 4 |
| }; |
| |
| /* 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 yytype_uint16 yydefact[] = |
| { |
| 71, 61, 68, 62, 69, 63, 208, 206, 0, 0, |
| 0, 0, 0, 0, 81, 70, 0, 71, 204, 85, |
| 88, 0, 0, 220, 0, 0, 66, 0, 72, 73, |
| 75, 74, 76, 78, 77, 79, 80, 82, 83, 84, |
| 81, 81, 199, 1, 205, 86, 87, 81, 209, 89, |
| 90, 91, 92, 81, 267, 207, 267, 0, 0, 228, |
| 221, 222, 210, 256, 257, 212, 133, 134, 135, 138, |
| 137, 136, 139, 140, 0, 0, 0, 0, 258, 259, |
| 141, 211, 143, 199, 199, 93, 198, 0, 96, 96, |
| 268, 264, 67, 239, 240, 241, 263, 223, 224, 227, |
| 0, 161, 144, 0, 0, 0, 0, 150, 162, 0, |
| 142, 161, 0, 0, 95, 94, 0, 196, 197, 0, |
| 0, 97, 98, 99, 100, 101, 0, 242, 0, 306, |
| 266, 0, 225, 160, 112, 156, 158, 0, 0, 0, |
| 0, 0, 0, 149, 0, 0, 0, 155, 0, 154, |
| 0, 219, 133, 134, 135, 138, 137, 136, 0, 0, |
| 0, 213, 102, 0, 236, 237, 238, 305, 291, 0, |
| 0, 0, 0, 96, 276, 277, 2, 3, 4, 5, |
| 6, 7, 8, 9, 10, 14, 15, 16, 11, 12, |
| 13, 0, 0, 0, 0, 0, 0, 17, 18, 19, |
| 20, 21, 22, 23, 24, 25, 26, 27, 28, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 265, 96, |
| 280, 0, 304, 226, 153, 0, 120, 0, 0, 152, |
| 0, 163, 120, 215, 217, 0, 200, 181, 182, 177, |
| 179, 178, 180, 183, 176, 172, 173, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 0, 175, 174, 129, 0, 290, 270, 0, 269, 0, |
| 0, 55, 0, 0, 29, 30, 31, 32, 33, 34, |
| 35, 36, 37, 38, 0, 53, 54, 49, 50, 51, |
| 52, 39, 40, 41, 42, 43, 44, 45, 46, 47, |
| 48, 0, 124, 124, 311, 0, 0, 302, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 104, |
| 106, 105, 103, 107, 108, 109, 110, 111, 113, 159, |
| 157, 146, 147, 148, 151, 145, 129, 129, 0, 0, |
| 0, 0, 0, 0, 0, 0, 165, 195, 0, 0, |
| 0, 169, 0, 166, 0, 0, 0, 0, 214, 234, |
| 245, 246, 247, 252, 248, 249, 250, 251, 243, 0, |
| 254, 261, 260, 262, 0, 271, 0, 0, 0, 0, |
| 0, 307, 0, 309, 288, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 117, 116, |
| 114, 115, 118, 119, 121, 216, 218, 0, 0, 0, |
| 288, 0, 0, 0, 0, 0, 164, 150, 162, 0, |
| 167, 168, 0, 0, 0, 0, 0, 131, 129, 233, |
| 112, 231, 0, 244, 0, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 314, 0, 0, 0, 298, 299, |
| 0, 0, 0, 0, 296, 0, 124, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 194, 171, 0, 0, |
| 0, 0, 126, 132, 130, 65, 0, 120, 0, 253, |
| 0, 0, 287, 0, 0, 124, 125, 124, 0, 0, |
| 0, 0, 0, 0, 292, 293, 287, 0, 312, 0, |
| 201, 0, 0, 185, 0, 0, 0, 0, 170, 0, |
| 0, 0, 64, 230, 232, 112, 127, 0, 0, 0, |
| 112, 112, 0, 294, 295, 308, 310, 289, 0, 0, |
| 297, 300, 301, 0, 124, 0, 0, 0, 191, 0, |
| 0, 187, 188, 184, 65, 128, 122, 255, 0, 0, |
| 0, 0, 0, 120, 281, 0, 120, 313, 189, 190, |
| 0, 0, 0, 229, 0, 235, 0, 274, 0, 0, |
| 104, 106, 112, 112, 112, 112, 0, 282, 303, 186, |
| 192, 193, 123, 272, 0, 273, 0, 284, 283, 0, |
| 0, 0, 0, 0, 112, 112, 0, 0, 0, 286, |
| 285, 0, 279, 0, 0, 278, 0, 275 |
| }; |
| |
| /* YYDEFGOTO[NTERM-NUM]. */ |
| static const yytype_int16 yydefgoto[] = |
| { |
| -1, 258, 259, 260, 284, 301, 158, 159, 78, 513, |
| 12, 79, 14, 15, 40, 41, 42, 47, 53, 116, |
| 126, 328, 224, 404, 331, 565, 381, 427, 546, 358, |
| 428, 80, 160, 135, 150, 136, 137, 109, 347, 370, |
| 348, 119, 87, 151, 16, 17, 18, 20, 19, 263, |
| 336, 337, 62, 23, 60, 100, 431, 432, 127, 166, |
| 54, 95, 55, 48, 434, 371, 82, 373, 268, 56, |
| 91, 92, 218, 569, 130, 307, 522, 444, 219, 220, |
| 221, 222 |
| }; |
| |
| /* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing |
| STATE-NUM. */ |
| #define YYPACT_NINF -546 |
| static const yytype_int16 yypact[] = |
| { |
| 47, -546, -546, -546, -546, -546, -546, -546, -17, -95, |
| 52, -90, 86, 14, 183, -546, 135, 1758, -546, -10, |
| 64, 18, 33, -546, 5, 180, -546, 1341, -546, -546, |
| -546, -546, -546, -546, -546, -546, -546, -546, -546, -546, |
| 76, 76, 59, -546, -546, -546, -546, 76, -546, -546, |
| -546, -546, -546, 76, 193, -546, 13, 202, 224, 233, |
| -546, -546, -546, -546, -546, 111, -546, -546, -546, -546, |
| -546, -546, -546, -546, 260, 261, 1, 378, -546, -546, |
| -546, -7, -546, 231, 231, 150, -546, 55, 309, 309, |
| -546, -546, 100, -546, -546, -546, -546, -546, -546, -546, |
| -99, 1088, -546, 116, 122, 988, 111, -546, -7, -106, |
| -546, 1088, 55, 55, -546, -546, 1142, -546, -546, 1359, |
| 274, -546, -546, -546, -546, -546, 1414, -546, -18, 1624, |
| -546, 257, -546, -546, -7, -546, 131, 128, 1454, 1454, |
| 129, -105, 1454, -546, 136, 1359, 1454, 111, 141, -7, |
| 237, -546, 214, 279, 285, 289, 291, 294, 145, 299, |
| 803, -546, -546, 103, -546, -546, -546, -546, -546, 254, |
| 1512, 57, 301, 309, -546, -546, -546, -546, -546, -546, |
| -546, -546, -546, -546, -546, -546, -546, -546, -546, -546, |
| -546, 596, 646, 1454, 1454, 1454, 1454, -546, -546, -546, |
| -546, -546, -546, -546, -546, -546, -546, -546, -546, 1454, |
| 1454, 1454, 1454, 1454, 1454, 1454, 1454, 1454, -546, 309, |
| -546, 61, -546, -546, 132, 1182, -546, -57, -69, -546, |
| 155, -7, -546, -546, -7, 1142, -546, -546, -546, -546, |
| -546, -546, -546, -546, -546, -546, -546, 596, 646, 162, |
| 163, 164, 166, 167, 1242, 1530, 1028, 303, 169, 174, |
| 179, -546, -546, 185, 191, -546, 111, 644, -546, 780, |
| 780, -546, 780, 1414, -546, -546, -546, -546, -546, -546, |
| -546, -546, -546, -546, 1454, -546, -546, -546, -546, -546, |
| -546, -546, -546, -546, -546, -546, -546, -546, -546, -546, |
| -546, 1454, 30, 48, -546, 644, -21, 197, 199, 203, |
| 204, 205, 206, 644, 644, 313, 1414, 1454, 1454, -546, |
| -546, -546, -546, -546, -546, -546, -546, -546, -546, -546, |
| -546, 201, -546, -546, -546, 201, 185, 185, 320, 207, |
| 208, 1359, 1359, 1359, 1359, 1359, -546, -546, -65, 1068, |
| -86, -546, -104, -546, 1359, 1359, 1359, -20, -546, 1261, |
| -546, -546, -546, -546, -546, -546, -546, -546, 273, 1359, |
| -546, -546, -546, -546, 217, -546, 218, 780, 644, 644, |
| 8, -546, 11, -546, -546, 780, 221, 1454, 1454, 1454, |
| 1454, 1454, 227, 234, 1454, 780, 644, 235, -546, -546, |
| -546, -546, -546, -546, -546, -546, -546, 1454, 1359, 1359, |
| -546, 247, 258, 263, 265, 1359, -546, 259, 803, -101, |
| -546, -546, 269, 270, 344, 398, 419, -546, 185, -546, |
| -7, 276, 275, -546, 404, -76, 412, 413, 282, 288, |
| 292, 780, 440, 780, 297, 300, 780, 302, -7, -546, |
| 304, 308, 780, 780, -7, 306, 310, 1454, -35, 311, |
| 314, -73, 1359, 1359, 1359, 1359, -546, -546, 315, 1359, |
| 1359, 1454, -546, -546, -546, 298, 1301, -546, 319, -546, |
| 780, 780, 1570, 780, 780, 310, -546, 310, 1454, 780, |
| 322, 1454, 1454, 1454, -546, -546, 1570, 399, -546, 644, |
| -546, 1359, 1359, -546, 323, 316, 325, 327, -546, 324, |
| 326, 60, -546, -546, -546, -7, 3, 460, 334, 330, |
| 82, -7, -13, -546, -546, -546, -546, -546, 332, 780, |
| -546, -546, -546, 12, 310, 336, 337, 1359, -546, 1359, |
| 1359, -546, -546, -546, 298, -546, 438, -546, 475, -4, |
| 493, 493, 1610, -546, -546, 338, -546, -546, -546, -546, |
| 342, 345, 346, -546, 501, -546, 780, -546, 940, 2, |
| 354, 355, -546, -546, 82, -7, 72, -546, 201, -546, |
| -546, -546, -546, -546, 359, -546, 940, 132, 132, 493, |
| 493, 492, 494, 361, -546, -546, 780, 780, 497, 132, |
| 132, 450, -546, 780, 505, -546, 780, -546 |
| }; |
| |
| /* YYPGOTO[NTERM-NUM]. */ |
| static const yytype_int16 yypgoto[] = |
| { |
| -546, 394, 395, 396, 280, 283, -170, -546, 0, -16, |
| 444, 15, -546, -546, -546, -546, -1, -546, -546, -546, |
| -157, -546, -418, -546, -229, -546, -292, 23, -546, -307, |
| -546, -546, -26, 305, -120, -546, 429, 436, -59, -156, |
| -235, 126, 168, 307, -546, -546, 526, -546, -546, -546, |
| -546, -546, -546, -546, -546, -546, -546, -546, 456, -546, |
| -546, -546, -546, -546, -546, -545, -142, 108, -186, -546, |
| 490, -546, -546, -546, -546, -546, 51, 138, -546, -546, |
| -546, -546 |
| }; |
| |
| /* 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 -204 |
| static const yytype_int16 yytable[] = |
| { |
| 11, 81, 272, 335, 261, 104, 163, 271, 236, 304, |
| 164, 383, 475, 271, 425, 13, 273, 11, 262, 441, |
| 350, 352, 443, 584, 308, 309, 310, 311, 312, 405, |
| 406, 315, 13, 426, 90, 21, 45, 425, 46, 83, |
| 84, 593, 93, 142, 142, 415, 88, -203, 415, 22, |
| 131, 108, 89, 24, 143, 230, 421, 132, 26, 468, |
| 161, 442, 316, 415, 442, -67, 1, 2, 269, 3, |
| 4, 5, 420, 415, 270, 134, 488, 6, 7, 108, |
| 503, 110, 479, 111, 415, 134, 233, 117, 118, 333, |
| 149, 416, 11, 110, 85, 111, 86, 544, 8, 332, |
| 149, 9, 550, 551, 27, 10, 49, 50, 51, 25, |
| 591, 52, 227, 228, 419, 110, 231, 111, 500, 1, |
| 234, 474, 3, 2, 5, 372, 4, 372, 372, 110, |
| 372, 111, 397, 385, 435, 43, 552, 398, 399, 400, |
| 553, 165, 401, 110, 267, 111, 402, 403, 239, 240, |
| 241, 242, 567, 377, 587, 588, 589, 590, 585, 59, |
| 105, 552, 28, 372, 498, 556, 57, 302, 303, 267, |
| 305, 372, 372, 94, 317, 318, 599, 600, 264, 380, |
| 110, 58, 111, 306, 267, 267, 267, 267, 267, 313, |
| 314, 267, 114, 525, 115, 526, 395, 382, 110, 134, |
| 111, 447, 61, 449, 450, 451, 398, 399, 400, 149, |
| 110, 401, 111, 543, 90, 402, 403, -55, -55, -55, |
| -55, 37, 38, 39, 97, 29, 30, 31, 32, 33, |
| 34, 35, -139, 36, -139, 372, 372, 372, 145, 146, |
| 237, 238, 557, 372, 63, 64, 98, 149, 516, 319, |
| 320, 112, 113, 372, 372, 99, 1, 2, 378, 3, |
| 4, 5, 261, 101, 102, 103, 321, 322, 86, 323, |
| 324, 138, 325, 326, 327, 379, 262, 139, 162, 223, |
| 225, 226, 410, 411, 412, 413, 414, 229, -56, 232, |
| 149, 396, 267, 235, -57, 422, 423, 424, -60, 372, |
| -59, 372, 527, -58, 372, 530, 531, 532, 243, 265, |
| 372, 372, 271, 334, 341, 342, 343, 1, 344, 345, |
| 3, 354, 5, 418, 576, 353, 355, 578, 37, 38, |
| 39, 356, 433, 430, 357, 398, 399, 400, 372, 372, |
| 401, 372, 372, 359, 402, 403, 386, 372, 387, 459, |
| 460, 394, 388, 389, 390, 391, 466, 372, 407, 408, |
| 409, 267, 448, 267, 267, 267, 436, 437, 454, 120, |
| 121, 122, 123, 124, 125, 446, 452, 374, 375, 568, |
| 376, 458, 471, 453, 457, 63, 64, 372, 106, 66, |
| 67, 68, 69, 70, 71, 72, 462, 1, 2, 586, |
| 3, 4, 5, 504, 505, 506, 507, 463, 372, 372, |
| 509, 510, 464, 384, 465, 319, 320, 467, 469, 470, |
| 472, 392, 393, 473, 372, 476, 478, 73, 477, 480, |
| 481, 499, 321, 322, 482, 323, 324, 483, 325, 326, |
| 327, 484, 535, 536, 486, 511, 488, 372, 372, 489, |
| 515, 491, 442, 492, 372, 372, 521, 493, 496, 497, |
| 501, 372, 267, 502, 372, 267, 267, 267, 517, 538, |
| 521, 529, 537, 508, 539, 512, 540, 541, 560, 542, |
| 561, 562, 547, 548, 549, 438, 439, 440, 554, 558, |
| 559, 564, 566, 445, 577, 579, 360, 361, 580, 581, |
| 63, 64, 362, 455, 456, 582, -18, -19, 592, 596, |
| 598, 597, 1, 2, 603, 3, 4, 5, 363, 364, |
| 365, 604, 606, 215, 216, 217, 575, 339, 563, 74, |
| 330, 340, 75, 366, 367, 76, 129, 77, 107, 545, |
| 144, 141, 338, 44, 512, 128, 96, 533, 461, 485, |
| 368, 487, 0, 0, 490, 0, 0, 0, 0, 0, |
| 494, 495, 0, 0, 0, 0, 176, 177, 178, 179, |
| 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, |
| 190, 247, 248, 0, 0, 0, 0, 0, 518, 519, |
| 0, 523, 524, 0, 0, 0, 0, 528, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 534, 249, 197, |
| 570, 571, 200, 201, 202, 203, 204, 205, 206, 207, |
| 208, 0, 250, 0, 251, 252, 253, 321, 322, 0, |
| 323, 324, 0, 325, 326, 327, 0, 555, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 360, 361, 0, |
| 369, 63, 64, 362, 0, 0, 0, 0, 572, 573, |
| 0, 0, 0, 1, 2, 0, 3, 4, 5, 363, |
| 364, 365, 285, 286, 583, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 366, 367, 274, 275, 276, 277, |
| 278, 279, 280, 281, 282, 283, 0, 594, 595, 0, |
| 0, 368, 0, 0, 601, 602, 0, 0, 0, 0, |
| 0, 605, 0, 0, 607, 0, 0, 176, 177, 178, |
| 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, |
| 189, 190, 247, 248, 0, 0, 0, 0, 0, 0, |
| 0, 0, 287, 288, 289, 290, 291, 292, 293, 294, |
| 295, 296, 297, 298, 299, 300, 0, 0, 0, 249, |
| 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, |
| 207, 208, 0, 250, 0, 251, 252, 253, 0, 0, |
| 0, 0, 0, 360, 361, 0, 0, 63, 64, 362, |
| 0, 0, 0, 0, 110, 0, 111, 0, 0, 1, |
| 2, 369, 3, 4, 5, 363, 364, 365, 0, 0, |
| 63, 64, 0, 0, 0, 0, 0, 0, 0, 0, |
| 366, 367, 1, 2, 0, 3, 4, 5, 244, 0, |
| 0, 0, 0, 0, 0, 0, 0, 368, 0, 0, |
| 0, 0, 0, 245, 246, 0, 0, 0, 0, 0, |
| 0, 0, 0, 176, 177, 178, 179, 180, 181, 182, |
| 183, 184, 185, 186, 187, 188, 189, 190, 247, 248, |
| 0, 0, 0, 0, 0, 0, 176, 177, 178, 179, |
| 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, |
| 190, 247, 248, 0, 0, 249, 197, 198, 199, 200, |
| 201, 202, 203, 204, 205, 206, 207, 208, 0, 250, |
| 0, 251, 252, 253, 0, 0, 0, 0, 249, 197, |
| 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, |
| 208, 0, 250, 0, 251, 252, 253, 369, 0, 0, |
| 0, 0, 0, 360, 361, 0, 0, 0, 0, 362, |
| 0, 0, 0, 110, 0, 111, 0, 254, 0, 0, |
| 255, 0, 256, 0, 257, 363, 364, 365, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 366, 367, 0, 0, 0, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 63, 64, 368, 106, 66, |
| 67, 68, 69, 70, 71, 72, 0, 1, 2, 0, |
| 3, 4, 5, 176, 177, 178, 179, 180, 181, 182, |
| 183, 184, 185, 186, 187, 188, 189, 190, 247, 248, |
| 0, 0, 0, 0, 0, 63, 64, 73, 106, 152, |
| 153, 154, 155, 156, 157, 72, 0, 1, 2, 0, |
| 3, 4, 5, 0, 0, 249, 197, 198, 199, 200, |
| 201, 202, 203, 204, 205, 206, 207, 208, 0, 250, |
| 0, 251, 252, 253, 0, 63, 64, 73, 106, 152, |
| 153, 154, 155, 156, 157, 72, 0, 1, 2, 0, |
| 3, 4, 5, 0, 0, 63, 64, 369, 106, 66, |
| 67, 68, 69, 70, 71, 72, 0, 1, 2, 0, |
| 3, 4, 5, 0, 0, 0, 0, 73, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 133, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 73, 0, 74, |
| 0, 0, 75, 0, 0, 76, 0, 77, 140, 63, |
| 64, 0, 147, 66, 67, 68, 69, 70, 71, 72, |
| 0, 1, 2, 0, 3, 4, 5, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 74, |
| 0, 0, 75, 0, 0, 76, 0, 77, 351, 63, |
| 64, 73, 106, 66, 67, 68, 69, 70, 71, 72, |
| 0, 1, 2, 0, 3, 4, 5, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 74, |
| 0, 329, 75, 0, 0, 76, 0, 77, 417, 0, |
| 0, 73, 0, 0, 0, 0, 0, 0, 0, 74, |
| 0, 0, 75, 0, 0, 76, 0, 77, 0, 63, |
| 64, 0, 106, 152, 153, 154, 155, 156, 157, 72, |
| 0, 1, 2, 148, 3, 4, 5, 0, 63, 64, |
| 0, 106, 66, 67, 68, 69, 70, 71, 72, 0, |
| 1, 2, 0, 3, 4, 5, 0, 0, 0, 0, |
| 0, 73, 0, 74, 0, 0, 75, 0, 0, 76, |
| 429, 77, 0, 0, 0, 0, 0, 0, 63, 64, |
| 73, 106, 66, 67, 68, 69, 70, 71, 72, 0, |
| 1, 2, 0, 3, 4, 5, 0, 0, 0, 0, |
| 0, 0, 0, 74, 0, 0, 75, 0, 0, 76, |
| 514, 77, 0, 0, 0, 0, 0, 0, 63, 64, |
| 73, 65, 66, 67, 68, 69, 70, 71, 72, 0, |
| 1, 2, 0, 3, 4, 5, 63, 64, 0, 106, |
| 152, 153, 154, 155, 156, 157, 72, 0, 1, 2, |
| 0, 3, 4, 5, 0, 0, 0, 0, 0, 0, |
| 73, 0, 0, 74, 0, 0, 75, 0, 346, 76, |
| 0, 77, 0, 0, 0, 0, 0, 0, 73, 0, |
| 0, 0, 74, 0, 0, 75, 0, 0, 76, 0, |
| 77, 63, 64, 0, 147, 66, 67, 68, 69, 70, |
| 71, 72, 0, 1, 2, 0, 3, 4, 5, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 0, 0, 74, 0, 0, 75, 0, 0, 76, 0, |
| 77, 63, 64, 73, 106, 66, 67, 68, 69, 70, |
| 71, 72, 0, 1, 2, 0, 3, 4, 5, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 0, 0, 74, 0, 0, 75, 0, 0, 76, 0, |
| 77, 0, 0, 73, 0, 0, 0, 0, 0, 0, |
| 74, 0, 0, 75, 0, 0, 76, 0, 77, 63, |
| 64, 0, 266, 66, 67, 68, 69, 70, 71, 72, |
| 0, 1, 2, 0, 3, 4, 5, 63, 64, 0, |
| 106, 152, 153, 154, 155, 156, 157, 72, 0, 1, |
| 2, 0, 3, 4, 5, 0, 0, 0, 0, 0, |
| 0, 73, 0, 0, 0, 74, 0, 0, 75, 0, |
| 0, 76, 0, 77, 0, 0, 0, 63, 64, 73, |
| 106, 66, 67, 68, 69, 70, 71, 520, 0, 1, |
| 2, 0, 3, 4, 5, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 74, 0, 0, 75, 0, |
| 0, 76, 0, 77, 0, 0, 0, 63, 64, 73, |
| 106, 66, 67, 68, 69, 70, 71, 574, 0, 1, |
| 2, 0, 3, 4, 5, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 73, |
| 167, 0, 0, 74, 0, 0, 75, 0, 0, 76, |
| 0, 77, 0, 0, 0, 0, 0, 0, 0, 168, |
| 169, 74, 0, 0, 75, 0, 0, 76, 0, 349, |
| 0, 170, 171, 172, 173, 174, 175, 176, 177, 178, |
| 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, |
| 189, 190, 191, 192, 0, 0, 0, 0, 0, 0, |
| 0, 74, 0, 0, 75, 0, 0, 76, 0, 77, |
| 0, 0, 0, 0, 193, 194, 195, 0, 0, 196, |
| 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, |
| 207, 208, 209, 210, 211, 212, 213, 214, -202, 0, |
| 0, 74, 0, 0, 75, 0, 0, 76, 0, 77, |
| 0, 0, 0, 0, 0, 0, -67, 1, 2, 0, |
| 3, 4, 5, 0, 0, 0, 0, 0, 6, 7, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, |
| 0, 0, 9, 0, 0, 0, 10 |
| }; |
| |
| static const yytype_int16 yycheck[] = |
| { |
| 0, 27, 172, 232, 160, 4, 126, 11, 150, 195, |
| 28, 303, 430, 11, 34, 0, 173, 17, 160, 11, |
| 255, 256, 11, 568, 210, 211, 212, 213, 214, 336, |
| 337, 217, 17, 53, 21, 52, 46, 34, 48, 40, |
| 41, 586, 29, 149, 149, 149, 47, 0, 149, 66, |
| 149, 77, 53, 148, 160, 160, 160, 156, 148, 160, |
| 119, 53, 219, 149, 53, 18, 19, 20, 11, 22, |
| 23, 24, 158, 149, 17, 101, 149, 30, 31, 105, |
| 153, 150, 158, 152, 149, 111, 145, 32, 33, 158, |
| 116, 156, 92, 150, 35, 152, 37, 515, 51, 156, |
| 126, 54, 520, 521, 18, 58, 42, 43, 44, 57, |
| 38, 47, 138, 139, 349, 150, 142, 152, 153, 19, |
| 146, 428, 22, 20, 24, 267, 23, 269, 270, 150, |
| 272, 152, 318, 154, 369, 0, 149, 134, 135, 136, |
| 153, 159, 139, 150, 170, 152, 143, 144, 3, 4, |
| 5, 6, 156, 273, 572, 573, 574, 575, 156, 154, |
| 159, 149, 148, 305, 456, 153, 148, 193, 194, 195, |
| 196, 313, 314, 160, 113, 114, 594, 595, 163, 149, |
| 150, 148, 152, 209, 210, 211, 212, 213, 214, 215, |
| 216, 217, 42, 485, 44, 487, 316, 149, 150, 225, |
| 152, 387, 22, 389, 390, 391, 134, 135, 136, 235, |
| 150, 139, 152, 153, 21, 143, 144, 3, 4, 5, |
| 6, 145, 146, 147, 22, 42, 43, 44, 45, 46, |
| 47, 48, 150, 50, 152, 377, 378, 379, 112, 113, |
| 26, 27, 534, 385, 7, 8, 22, 273, 477, 117, |
| 118, 83, 84, 395, 396, 22, 19, 20, 284, 22, |
| 23, 24, 418, 152, 4, 4, 134, 135, 37, 137, |
| 138, 155, 140, 141, 142, 301, 418, 155, 4, 22, |
| 149, 153, 341, 342, 343, 344, 345, 158, 9, 153, |
| 316, 317, 318, 152, 9, 354, 355, 356, 9, 441, |
| 9, 443, 488, 9, 446, 491, 492, 493, 9, 55, |
| 452, 453, 11, 158, 152, 152, 152, 19, 152, 152, |
| 22, 152, 24, 349, 553, 22, 152, 556, 145, 146, |
| 147, 152, 59, 359, 149, 134, 135, 136, 480, 481, |
| 139, 483, 484, 152, 143, 144, 149, 489, 149, 408, |
| 409, 38, 149, 149, 149, 149, 415, 499, 38, 152, |
| 152, 387, 388, 389, 390, 391, 149, 149, 394, 60, |
| 61, 62, 63, 64, 65, 154, 149, 269, 270, 549, |
| 272, 407, 38, 149, 149, 7, 8, 529, 10, 11, |
| 12, 13, 14, 15, 16, 17, 149, 19, 20, 569, |
| 22, 23, 24, 462, 463, 464, 465, 149, 550, 551, |
| 469, 470, 149, 305, 149, 117, 118, 158, 149, 149, |
| 22, 313, 314, 4, 566, 149, 22, 49, 153, 17, |
| 17, 457, 134, 135, 152, 137, 138, 149, 140, 141, |
| 142, 149, 501, 502, 4, 471, 149, 589, 590, 149, |
| 476, 149, 53, 149, 596, 597, 482, 149, 152, 149, |
| 149, 603, 488, 149, 606, 491, 492, 493, 149, 153, |
| 496, 149, 149, 158, 149, 475, 149, 153, 537, 153, |
| 539, 540, 22, 149, 154, 377, 378, 379, 156, 153, |
| 153, 53, 17, 385, 156, 153, 3, 4, 153, 153, |
| 7, 8, 9, 395, 396, 4, 152, 152, 149, 17, |
| 149, 17, 19, 20, 17, 22, 23, 24, 25, 26, |
| 27, 71, 17, 129, 129, 129, 552, 247, 544, 151, |
| 225, 248, 154, 40, 41, 157, 92, 159, 160, 516, |
| 111, 105, 235, 17, 544, 89, 56, 496, 410, 441, |
| 57, 443, -1, -1, 446, -1, -1, -1, -1, -1, |
| 452, 453, -1, -1, -1, -1, 73, 74, 75, 76, |
| 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, |
| 87, 88, 89, -1, -1, -1, -1, -1, 480, 481, |
| -1, 483, 484, -1, -1, -1, -1, 489, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, 499, 115, 116, |
| 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, |
| 127, -1, 129, -1, 131, 132, 133, 134, 135, -1, |
| 137, 138, -1, 140, 141, 142, -1, 529, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, 3, 4, -1, |
| 157, 7, 8, 9, -1, -1, -1, -1, 550, 551, |
| -1, -1, -1, 19, 20, -1, 22, 23, 24, 25, |
| 26, 27, 26, 27, 566, -1, -1, -1, -1, -1, |
| -1, -1, -1, -1, 40, 41, 90, 91, 92, 93, |
| 94, 95, 96, 97, 98, 99, -1, 589, 590, -1, |
| -1, 57, -1, -1, 596, 597, -1, -1, -1, -1, |
| -1, 603, -1, -1, 606, -1, -1, 73, 74, 75, |
| 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, |
| 86, 87, 88, 89, -1, -1, -1, -1, -1, -1, |
| -1, -1, 96, 97, 98, 99, 100, 101, 102, 103, |
| 104, 105, 106, 107, 108, 109, -1, -1, -1, 115, |
| 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, |
| 126, 127, -1, 129, -1, 131, 132, 133, -1, -1, |
| -1, -1, -1, 3, 4, -1, -1, 7, 8, 9, |
| -1, -1, -1, -1, 150, -1, 152, -1, -1, 19, |
| 20, 157, 22, 23, 24, 25, 26, 27, -1, -1, |
| 7, 8, -1, -1, -1, -1, -1, -1, -1, -1, |
| 40, 41, 19, 20, -1, 22, 23, 24, 25, -1, |
| -1, -1, -1, -1, -1, -1, -1, 57, -1, -1, |
| -1, -1, -1, 40, 41, -1, -1, -1, -1, -1, |
| -1, -1, -1, 73, 74, 75, 76, 77, 78, 79, |
| 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, |
| -1, -1, -1, -1, -1, -1, 73, 74, 75, 76, |
| 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, |
| 87, 88, 89, -1, -1, 115, 116, 117, 118, 119, |
| 120, 121, 122, 123, 124, 125, 126, 127, -1, 129, |
| -1, 131, 132, 133, -1, -1, -1, -1, 115, 116, |
| 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, |
| 127, -1, 129, -1, 131, 132, 133, 157, -1, -1, |
| -1, -1, -1, 3, 4, -1, -1, -1, -1, 9, |
| -1, -1, -1, 150, -1, 152, -1, 154, -1, -1, |
| 157, -1, 159, -1, 161, 25, 26, 27, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| 40, 41, -1, -1, -1, -1, -1, -1, -1, -1, |
| -1, -1, -1, -1, -1, 7, 8, 57, 10, 11, |
| 12, 13, 14, 15, 16, 17, -1, 19, 20, -1, |
| 22, 23, 24, 73, 74, 75, 76, 77, 78, 79, |
| 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, |
| -1, -1, -1, -1, -1, 7, 8, 49, 10, 11, |
| 12, 13, 14, 15, 16, 17, -1, 19, 20, -1, |
| 22, 23, 24, -1, -1, 115, 116, 117, 118, 119, |
| 120, 121, 122, 123, 124, 125, 126, 127, -1, 129, |
| -1, 131, 132, 133, -1, 7, 8, 49, 10, 11, |
| 12, 13, 14, 15, 16, 17, -1, 19, 20, -1, |
| 22, 23, 24, -1, -1, 7, 8, 157, 10, 11, |
| 12, 13, 14, 15, 16, 17, -1, 19, 20, -1, |
| 22, 23, 24, -1, -1, -1, -1, 49, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, 39, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, 49, -1, 151, |
| -1, -1, 154, -1, -1, 157, -1, 159, 160, 7, |
| 8, -1, 10, 11, 12, 13, 14, 15, 16, 17, |
| -1, 19, 20, -1, 22, 23, 24, -1, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, -1, -1, 151, |
| -1, -1, 154, -1, -1, 157, -1, 159, 160, 7, |
| 8, 49, 10, 11, 12, 13, 14, 15, 16, 17, |
| -1, 19, 20, -1, 22, 23, 24, -1, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, -1, -1, 151, |
| -1, 39, 154, -1, -1, 157, -1, 159, 160, -1, |
| -1, 49, -1, -1, -1, -1, -1, -1, -1, 151, |
| -1, -1, 154, -1, -1, 157, -1, 159, -1, 7, |
| 8, -1, 10, 11, 12, 13, 14, 15, 16, 17, |
| -1, 19, 20, 121, 22, 23, 24, -1, 7, 8, |
| -1, 10, 11, 12, 13, 14, 15, 16, 17, -1, |
| 19, 20, -1, 22, 23, 24, -1, -1, -1, -1, |
| -1, 49, -1, 151, -1, -1, 154, -1, -1, 157, |
| 39, 159, -1, -1, -1, -1, -1, -1, 7, 8, |
| 49, 10, 11, 12, 13, 14, 15, 16, 17, -1, |
| 19, 20, -1, 22, 23, 24, -1, -1, -1, -1, |
| -1, -1, -1, 151, -1, -1, 154, -1, -1, 157, |
| 39, 159, -1, -1, -1, -1, -1, -1, 7, 8, |
| 49, 10, 11, 12, 13, 14, 15, 16, 17, -1, |
| 19, 20, -1, 22, 23, 24, 7, 8, -1, 10, |
| 11, 12, 13, 14, 15, 16, 17, -1, 19, 20, |
| -1, 22, 23, 24, -1, -1, -1, -1, -1, -1, |
| 49, -1, -1, 151, -1, -1, 154, -1, 156, 157, |
| -1, 159, -1, -1, -1, -1, -1, -1, 49, -1, |
| -1, -1, 151, -1, -1, 154, -1, -1, 157, -1, |
| 159, 7, 8, -1, 10, 11, 12, 13, 14, 15, |
| 16, 17, -1, 19, 20, -1, 22, 23, 24, -1, |
| -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| -1, -1, 151, -1, -1, 154, -1, -1, 157, -1, |
| 159, 7, 8, 49, 10, 11, 12, 13, 14, 15, |
| 16, 17, -1, 19, 20, -1, 22, 23, 24, -1, |
| -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| -1, -1, 151, -1, -1, 154, -1, -1, 157, -1, |
| 159, -1, -1, 49, -1, -1, -1, -1, -1, -1, |
| 151, -1, -1, 154, -1, -1, 157, -1, 159, 7, |
| 8, -1, 10, 11, 12, 13, 14, 15, 16, 17, |
| -1, 19, 20, -1, 22, 23, 24, 7, 8, -1, |
| 10, 11, 12, 13, 14, 15, 16, 17, -1, 19, |
| 20, -1, 22, 23, 24, -1, -1, -1, -1, -1, |
| -1, 49, -1, -1, -1, 151, -1, -1, 154, -1, |
| -1, 157, -1, 159, -1, -1, -1, 7, 8, 49, |
| 10, 11, 12, 13, 14, 15, 16, 17, -1, 19, |
| 20, -1, 22, 23, 24, -1, -1, -1, -1, -1, |
| -1, -1, -1, -1, -1, 151, -1, -1, 154, -1, |
| -1, 157, -1, 159, -1, -1, -1, 7, 8, 49, |
| 10, 11, 12, 13, 14, 15, 16, 17, -1, 19, |
| 20, -1, 22, 23, 24, -1, -1, -1, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, -1, -1, 49, |
| 36, -1, -1, 151, -1, -1, 154, -1, -1, 157, |
| -1, 159, -1, -1, -1, -1, -1, -1, -1, 55, |
| 56, 151, -1, -1, 154, -1, -1, 157, -1, 159, |
| -1, 67, 68, 69, 70, 71, 72, 73, 74, 75, |
| 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, |
| 86, 87, 88, 89, -1, -1, -1, -1, -1, -1, |
| -1, 151, -1, -1, 154, -1, -1, 157, -1, 159, |
| -1, -1, -1, -1, 110, 111, 112, -1, -1, 115, |
| 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, |
| 126, 127, 128, 129, 130, 131, 132, 133, 0, -1, |
| -1, 151, -1, -1, 154, -1, -1, 157, -1, 159, |
| -1, -1, -1, -1, -1, -1, 18, 19, 20, -1, |
| 22, 23, 24, -1, -1, -1, -1, -1, 30, 31, |
| -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, -1, -1, 51, |
| -1, -1, 54, -1, -1, -1, 58 |
| }; |
| |
| /* YYSTOS[STATE-NUM] -- The (internal number of the) accessing |
| symbol of state STATE-NUM. */ |
| static const yytype_uint8 yystos[] = |
| { |
| 0, 19, 20, 22, 23, 24, 30, 31, 51, 54, |
| 58, 170, 172, 173, 174, 175, 206, 207, 208, 210, |
| 209, 52, 66, 215, 148, 57, 148, 18, 148, 42, |
| 43, 44, 45, 46, 47, 48, 50, 145, 146, 147, |
| 176, 177, 178, 0, 208, 46, 48, 179, 225, 42, |
| 43, 44, 47, 180, 222, 224, 231, 148, 148, 154, |
| 216, 22, 214, 7, 8, 10, 11, 12, 13, 14, |
| 15, 16, 17, 49, 151, 154, 157, 159, 170, 173, |
| 193, 194, 228, 178, 178, 35, 37, 204, 178, 178, |
| 21, 232, 233, 29, 160, 223, 232, 22, 22, 22, |
| 217, 152, 4, 4, 4, 159, 10, 160, 194, 199, |
| 150, 152, 204, 204, 42, 44, 181, 32, 33, 203, |
| 60, 61, 62, 63, 64, 65, 182, 220, 220, 172, |
| 236, 149, 156, 39, 194, 195, 197, 198, 155, 155, |
| 160, 199, 149, 160, 198, 203, 203, 10, 121, 194, |
| 196, 205, 11, 12, 13, 14, 15, 16, 168, 169, |
| 194, 200, 4, 196, 28, 159, 221, 36, 55, 56, |
| 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, |
| 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, |
| 87, 88, 89, 110, 111, 112, 115, 116, 117, 118, |
| 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, |
| 129, 130, 131, 132, 133, 163, 164, 165, 234, 240, |
| 241, 242, 243, 22, 184, 149, 153, 194, 194, 158, |
| 160, 194, 153, 200, 194, 152, 228, 26, 27, 3, |
| 4, 5, 6, 9, 25, 40, 41, 88, 89, 115, |
| 129, 131, 132, 133, 154, 157, 159, 161, 163, 164, |
| 165, 201, 228, 211, 173, 55, 10, 194, 230, 11, |
| 17, 11, 168, 182, 90, 91, 92, 93, 94, 95, |
| 96, 97, 98, 99, 166, 26, 27, 96, 97, 98, |
| 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, |
| 109, 167, 194, 194, 230, 194, 194, 237, 230, 230, |
| 230, 230, 230, 194, 194, 230, 182, 113, 114, 117, |
| 118, 134, 135, 137, 138, 140, 141, 142, 183, 39, |
| 195, 186, 156, 158, 158, 186, 212, 213, 205, 166, |
| 167, 152, 152, 152, 152, 152, 156, 200, 202, 159, |
| 202, 160, 202, 22, 152, 152, 152, 149, 191, 152, |
| 3, 4, 9, 25, 26, 27, 40, 41, 57, 157, |
| 201, 227, 228, 229, 229, 229, 229, 196, 194, 194, |
| 149, 188, 149, 188, 229, 154, 149, 149, 149, 149, |
| 149, 149, 229, 229, 38, 196, 194, 230, 134, 135, |
| 136, 139, 143, 144, 185, 191, 191, 38, 152, 152, |
| 200, 200, 200, 200, 200, 149, 156, 160, 194, 202, |
| 158, 160, 200, 200, 200, 34, 53, 189, 192, 39, |
| 194, 218, 219, 59, 226, 202, 149, 149, 229, 229, |
| 229, 11, 53, 11, 239, 229, 154, 230, 194, 230, |
| 230, 230, 149, 149, 194, 229, 229, 149, 194, 200, |
| 200, 239, 149, 149, 149, 149, 200, 158, 160, 149, |
| 149, 38, 22, 4, 191, 184, 149, 153, 22, 158, |
| 17, 17, 152, 149, 149, 229, 4, 229, 149, 149, |
| 229, 149, 149, 149, 229, 229, 152, 149, 188, 194, |
| 153, 149, 149, 153, 200, 200, 200, 200, 158, 200, |
| 200, 194, 170, 171, 39, 194, 186, 149, 229, 229, |
| 17, 194, 238, 229, 229, 188, 188, 230, 229, 149, |
| 230, 230, 230, 238, 229, 200, 200, 149, 153, 149, |
| 149, 153, 153, 153, 184, 189, 190, 22, 149, 154, |
| 184, 184, 149, 153, 156, 229, 153, 188, 153, 153, |
| 200, 200, 200, 171, 53, 187, 17, 156, 168, 235, |
| 117, 118, 229, 229, 17, 194, 186, 156, 186, 153, |
| 153, 153, 4, 229, 227, 156, 168, 184, 184, 184, |
| 184, 38, 149, 227, 229, 229, 17, 17, 149, 184, |
| 184, 229, 229, 17, 71, 229, 17, 229 |
| }; |
| |
| #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 (1); \ |
| goto yybackup; \ |
| } \ |
| else \ |
| { \ |
| yyerror (YY_("syntax error: cannot back up")); \ |
| YYERROR; \ |
| } \ |
| while (YYID (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 (YYID (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 (YYID (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 (YYID (0)) |
| |
| # define YY_SYMBOL_PRINT(Title, Type, Value, Location) \ |
| do { \ |
| if (yydebug) \ |
| { \ |
| YYFPRINTF (stderr, "%s ", Title); \ |
| yy_symbol_print (stderr, \ |
| Type, Value); \ |
| YYFPRINTF (stderr, "\n"); \ |
| } \ |
| } while (YYID (0)) |
| |
| |
| /*--------------------------------. |
| | Print this symbol on YYOUTPUT. | |
| `--------------------------------*/ |
| |
| /*ARGSUSED*/ |
| #if (defined __STDC__ || defined __C99__FUNC__ \ |
| || defined __cplusplus || defined _MSC_VER) |
| static void |
| yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep) |
| #else |
| static void |
| yy_symbol_value_print (yyoutput, yytype, yyvaluep) |
| FILE *yyoutput; |
| int yytype; |
| YYSTYPE const * const yyvaluep; |
| #endif |
| { |
| if (!yyvaluep) |
| return; |
| # ifdef YYPRINT |
| if (yytype < YYNTOKENS) |
| YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep); |
| # else |
| YYUSE (yyoutput); |
| # endif |
| switch (yytype) |
| { |
| default: |
| break; |
| } |
| } |
| |
| |
| /*--------------------------------. |
| | Print this symbol on YYOUTPUT. | |
| `--------------------------------*/ |
| |
| #if (defined __STDC__ || defined __C99__FUNC__ \ |
| || defined __cplusplus || defined _MSC_VER) |
| static void |
| yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep) |
| #else |
| static void |
| yy_symbol_print (yyoutput, yytype, yyvaluep) |
| FILE *yyoutput; |
| int yytype; |
| YYSTYPE const * const yyvaluep; |
| #endif |
| { |
| if (yytype < YYNTOKENS) |
| YYFPRINTF (yyoutput, "token %s (", yytname[yytype]); |
| else |
| YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]); |
| |
| yy_symbol_value_print (yyoutput, yytype, yyvaluep); |
| YYFPRINTF (yyoutput, ")"); |
| } |
| |
| /*------------------------------------------------------------------. |
| | yy_stack_print -- Print the state stack from its BOTTOM up to its | |
| | TOP (included). | |
| `------------------------------------------------------------------*/ |
| |
| #if (defined __STDC__ || defined __C99__FUNC__ \ |
| || defined __cplusplus || defined _MSC_VER) |
| static void |
| yy_stack_print (yytype_int16 *bottom, yytype_int16 *top) |
| #else |
| static void |
| yy_stack_print (bottom, top) |
| yytype_int16 *bottom; |
| yytype_int16 *top; |
| #endif |
| { |
| YYFPRINTF (stderr, "Stack now"); |
| for (; 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 (YYID (0)) |
| |
| |
| /*------------------------------------------------. |
| | Report that the YYRULE is going to be reduced. | |
| `------------------------------------------------*/ |
| |
| #if (defined __STDC__ || defined __C99__FUNC__ \ |
| || defined __cplusplus || defined _MSC_VER) |
| static void |
| yy_reduce_print (YYSTYPE *yyvsp, int yyrule) |
| #else |
| static void |
| yy_reduce_print (yyvsp, yyrule) |
| YYSTYPE *yyvsp; |
| int yyrule; |
| #endif |
| { |
| int yynrhs = yyr2[yyrule]; |
| int yyi; |
| unsigned long int yylno = yyrline[yyrule]; |
| YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n", |
| yyrule - 1, yylno); |
| /* The symbols being reduced. */ |
| for (yyi = 0; yyi < yynrhs; yyi++) |
| { |
| fprintf (stderr, " $%d = ", yyi + 1); |
| yy_symbol_print (stderr, yyrhs[yyprhs[yyrule] + yyi], |
| &(yyvsp[(yyi + 1) - (yynrhs)]) |
| ); |
| fprintf (stderr, "\n"); |
| } |
| } |
| |
| # define YY_REDUCE_PRINT(Rule) \ |
| do { \ |
| if (yydebug) \ |
| yy_reduce_print (yyvsp, Rule); \ |
| } while (YYID (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. */ |
| #if (defined __STDC__ || defined __C99__FUNC__ \ |
| || defined __cplusplus || defined _MSC_VER) |
| static YYSIZE_T |
| yystrlen (const char *yystr) |
| #else |
| static YYSIZE_T |
| yystrlen (yystr) |
| const char *yystr; |
| #endif |
| { |
| YYSIZE_T yylen; |
| for (yylen = 0; yystr[yylen]; yylen++) |
| continue; |
| return yylen; |
| } |
| # 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. */ |
| #if (defined __STDC__ || defined __C99__FUNC__ \ |
| || defined __cplusplus || defined _MSC_VER) |
| static char * |
| yystpcpy (char *yydest, const char *yysrc) |
| #else |
| static char * |
| 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 == '"') |
| { |
| YYSIZE_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 |
| |
| /* Copy into YYRESULT an error message about the unexpected token |
| YYCHAR while in state YYSTATE. Return the number of bytes copied, |
| including the terminating null byte. If YYRESULT is null, do not |
| copy anything; just return the number of bytes that would be |
| copied. As a special case, return 0 if an ordinary "syntax error" |
| message will do. Return YYSIZE_MAXIMUM if overflow occurs during |
| size calculation. */ |
| static YYSIZE_T |
| yysyntax_error (char *yyresult, int yystate, int yychar) |
| { |
| int yyn = yypact[yystate]; |
| |
| if (! (YYPACT_NINF < yyn && yyn <= YYLAST)) |
| return 0; |
| else |
| { |
| int yytype = YYTRANSLATE (yychar); |
| YYSIZE_T yysize0 = yytnamerr (0, yytname[yytype]); |
| YYSIZE_T yysize = yysize0; |
| YYSIZE_T yysize1; |
| int yysize_overflow = 0; |
| enum { 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 + 1; |
| 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) |
| return YYSIZE_MAXIMUM; |
| |
| if (yyresult) |
| { |
| /* 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 = yyresult; |
| int yyi = 0; |
| while ((*yyp = *yyf) != '\0') |
| { |
| if (*yyp == '%' && yyf[1] == 's' && yyi < yycount) |
| { |
| yyp += yytnamerr (yyp, yyarg[yyi++]); |
| yyf += 2; |
| } |
| else |
| { |
| yyp++; |
| yyf++; |
| } |
| } |
| } |
| return yysize; |
| } |
| } |
| #endif /* YYERROR_VERBOSE */ |
| |
| |
| /*-----------------------------------------------. |
| | Release the memory associated to this symbol. | |
| `-----------------------------------------------*/ |
| |
| /*ARGSUSED*/ |
| #if (defined __STDC__ || defined __C99__FUNC__ \ |
| || defined __cplusplus || defined _MSC_VER) |
| 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 |
| { |
| YYUSE (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 __C99__FUNC__ \ |
| || defined __cplusplus || defined _MSC_VER) |
| int |
| yyparse (void *YYPARSE_PARAM) |
| #else |
| int |
| yyparse (YYPARSE_PARAM) |
| void *YYPARSE_PARAM; |
| #endif |
| #else /* ! YYPARSE_PARAM */ |
| #if (defined __STDC__ || defined __C99__FUNC__ \ |
| || defined __cplusplus || defined _MSC_VER) |
| 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; |
| #if YYERROR_VERBOSE |
| /* Buffer for error messages, and its allocated size. */ |
| char yymsgbuf[128]; |
| char *yymsg = yymsgbuf; |
| YYSIZE_T yymsg_alloc = sizeof yymsgbuf; |
| #endif |
| |
| /* 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. */ |
| yytype_int16 yyssa[YYINITDEPTH]; |
| yytype_int16 *yyss = yyssa; |
| yytype_int16 *yyssp; |
| |
| /* The semantic value stack. */ |
| YYSTYPE yyvsa[YYINITDEPTH]; |
| YYSTYPE *yyvs = yyvsa; |
| YYSTYPE *yyvsp; |
| |
| |
| |
| #define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N)) |
| |
| YYSIZE_T yystacksize = YYINITDEPTH; |
| |
| /* The variables used to return semantic value and location from the |
| action routines. */ |
| YYSTYPE yyval; |
| |
| |
| /* The number of symbols on the RHS of the reduced rule. |
| Keep to zero when no symbol should be popped. */ |
| int yylen = 0; |
| |
| 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; |
| yytype_int16 *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; |
| |
| { |
| yytype_int16 *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. */ |
| |
| /* 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; |
| |
| /* Count tokens shifted since error; after three, turn off error |
| status. */ |
| if (yyerrstatus) |
| yyerrstatus--; |
| |
| /* Shift the look-ahead token. */ |
| YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc); |
| |
| /* Discard the shifted token unless it is eof. */ |
| if (yychar != YYEOF) |
| yychar = YYEMPTY; |
| |
| yystate = yyn; |
| *++yyvsp = yylval; |
| |
| 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 29: |
| #line 1111 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.IPredicate) = ICmpInst::ICMP_EQ; ;} |
| break; |
| |
| case 30: |
| #line 1111 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.IPredicate) = ICmpInst::ICMP_NE; ;} |
| break; |
| |
| case 31: |
| #line 1112 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.IPredicate) = ICmpInst::ICMP_SLT; ;} |
| break; |
| |
| case 32: |
| #line 1112 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.IPredicate) = ICmpInst::ICMP_SGT; ;} |
| break; |
| |
| case 33: |
| #line 1113 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.IPredicate) = ICmpInst::ICMP_SLE; ;} |
| break; |
| |
| case 34: |
| #line 1113 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.IPredicate) = ICmpInst::ICMP_SGE; ;} |
| break; |
| |
| case 35: |
| #line 1114 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.IPredicate) = ICmpInst::ICMP_ULT; ;} |
| break; |
| |
| case 36: |
| #line 1114 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.IPredicate) = ICmpInst::ICMP_UGT; ;} |
| break; |
| |
| case 37: |
| #line 1115 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.IPredicate) = ICmpInst::ICMP_ULE; ;} |
| break; |
| |
| case 38: |
| #line 1115 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.IPredicate) = ICmpInst::ICMP_UGE; ;} |
| break; |
| |
| case 39: |
| #line 1119 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.FPredicate) = FCmpInst::FCMP_OEQ; ;} |
| break; |
| |
| case 40: |
| #line 1119 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.FPredicate) = FCmpInst::FCMP_ONE; ;} |
| break; |
| |
| case 41: |
| #line 1120 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.FPredicate) = FCmpInst::FCMP_OLT; ;} |
| break; |
| |
| case 42: |
| #line 1120 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.FPredicate) = FCmpInst::FCMP_OGT; ;} |
| break; |
| |
| case 43: |
| #line 1121 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.FPredicate) = FCmpInst::FCMP_OLE; ;} |
| break; |
| |
| case 44: |
| #line 1121 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.FPredicate) = FCmpInst::FCMP_OGE; ;} |
| break; |
| |
| case 45: |
| #line 1122 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.FPredicate) = FCmpInst::FCMP_ORD; ;} |
| break; |
| |
| case 46: |
| #line 1122 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.FPredicate) = FCmpInst::FCMP_UNO; ;} |
| break; |
| |
| case 47: |
| #line 1123 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.FPredicate) = FCmpInst::FCMP_UEQ; ;} |
| break; |
| |
| case 48: |
| #line 1123 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.FPredicate) = FCmpInst::FCMP_UNE; ;} |
| break; |
| |
| case 49: |
| #line 1124 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.FPredicate) = FCmpInst::FCMP_ULT; ;} |
| break; |
| |
| case 50: |
| #line 1124 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.FPredicate) = FCmpInst::FCMP_UGT; ;} |
| break; |
| |
| case 51: |
| #line 1125 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.FPredicate) = FCmpInst::FCMP_ULE; ;} |
| break; |
| |
| case 52: |
| #line 1125 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.FPredicate) = FCmpInst::FCMP_UGE; ;} |
| break; |
| |
| case 53: |
| #line 1126 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.FPredicate) = FCmpInst::FCMP_TRUE; ;} |
| break; |
| |
| case 54: |
| #line 1127 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.FPredicate) = FCmpInst::FCMP_FALSE; ;} |
| break; |
| |
| case 65: |
| #line 1136 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.StrVal) = 0; ;} |
| break; |
| |
| case 66: |
| #line 1140 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.StrVal) = (yyvsp[(1) - (2)].StrVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 67: |
| #line 1144 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.StrVal) = 0; |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 71: |
| #line 1152 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.StrVal) = 0; |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 72: |
| #line 1157 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.StrVal) = (yyvsp[(1) - (2)].StrVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 73: |
| #line 1163 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::InternalLinkage; ;} |
| break; |
| |
| case 74: |
| #line 1164 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::WeakLinkage; ;} |
| break; |
| |
| case 75: |
| #line 1165 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::LinkOnceLinkage; ;} |
| break; |
| |
| case 76: |
| #line 1166 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::AppendingLinkage; ;} |
| break; |
| |
| case 77: |
| #line 1167 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::DLLExportLinkage; ;} |
| break; |
| |
| case 78: |
| #line 1171 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::DLLImportLinkage; ;} |
| break; |
| |
| case 79: |
| #line 1172 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::ExternalWeakLinkage; ;} |
| break; |
| |
| case 80: |
| #line 1173 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::ExternalLinkage; ;} |
| break; |
| |
| case 81: |
| #line 1177 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Visibility) = GlobalValue::DefaultVisibility; ;} |
| break; |
| |
| case 82: |
| #line 1178 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Visibility) = GlobalValue::DefaultVisibility; ;} |
| break; |
| |
| case 83: |
| #line 1179 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Visibility) = GlobalValue::HiddenVisibility; ;} |
| break; |
| |
| case 84: |
| #line 1180 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Visibility) = GlobalValue::ProtectedVisibility; ;} |
| break; |
| |
| case 85: |
| #line 1184 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::ExternalLinkage; ;} |
| break; |
| |
| case 86: |
| #line 1185 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::DLLImportLinkage; ;} |
| break; |
| |
| case 87: |
| #line 1186 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::ExternalWeakLinkage; ;} |
| break; |
| |
| case 88: |
| #line 1190 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::ExternalLinkage; ;} |
| break; |
| |
| case 89: |
| #line 1191 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::InternalLinkage; ;} |
| break; |
| |
| case 90: |
| #line 1192 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::LinkOnceLinkage; ;} |
| break; |
| |
| case 91: |
| #line 1193 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::WeakLinkage; ;} |
| break; |
| |
| case 92: |
| #line 1194 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::DLLExportLinkage; ;} |
| break; |
| |
| case 93: |
| #line 1198 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::ExternalLinkage; ;} |
| break; |
| |
| case 94: |
| #line 1199 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::WeakLinkage; ;} |
| break; |
| |
| case 95: |
| #line 1200 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::InternalLinkage; ;} |
| break; |
| |
| case 96: |
| #line 1203 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.UIntVal) = CallingConv::C; ;} |
| break; |
| |
| case 97: |
| #line 1204 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.UIntVal) = CallingConv::C; ;} |
| break; |
| |
| case 98: |
| #line 1205 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.UIntVal) = CallingConv::Fast; ;} |
| break; |
| |
| case 99: |
| #line 1206 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.UIntVal) = CallingConv::Cold; ;} |
| break; |
| |
| case 100: |
| #line 1207 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.UIntVal) = CallingConv::X86_StdCall; ;} |
| break; |
| |
| case 101: |
| #line 1208 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.UIntVal) = CallingConv::X86_FastCall; ;} |
| break; |
| |
| case 102: |
| #line 1209 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if ((unsigned)(yyvsp[(2) - (2)].UInt64Val) != (yyvsp[(2) - (2)].UInt64Val)) |
| GEN_ERROR("Calling conv too large"); |
| (yyval.UIntVal) = (yyvsp[(2) - (2)].UInt64Val); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 103: |
| #line 1216 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.ParamAttrs) = ParamAttr::ZExt; ;} |
| break; |
| |
| case 104: |
| #line 1217 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.ParamAttrs) = ParamAttr::ZExt; ;} |
| break; |
| |
| case 105: |
| #line 1218 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.ParamAttrs) = ParamAttr::SExt; ;} |
| break; |
| |
| case 106: |
| #line 1219 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.ParamAttrs) = ParamAttr::SExt; ;} |
| break; |
| |
| case 107: |
| #line 1220 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.ParamAttrs) = ParamAttr::InReg; ;} |
| break; |
| |
| case 108: |
| #line 1221 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.ParamAttrs) = ParamAttr::StructRet; ;} |
| break; |
| |
| case 109: |
| #line 1222 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.ParamAttrs) = ParamAttr::NoAlias; ;} |
| break; |
| |
| case 110: |
| #line 1223 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.ParamAttrs) = ParamAttr::ByVal; ;} |
| break; |
| |
| case 111: |
| #line 1224 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.ParamAttrs) = ParamAttr::Nest; ;} |
| break; |
| |
| case 112: |
| #line 1227 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.ParamAttrs) = ParamAttr::None; ;} |
| break; |
| |
| case 113: |
| #line 1228 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ParamAttrs) = (yyvsp[(1) - (2)].ParamAttrs) | (yyvsp[(2) - (2)].ParamAttrs); |
| ;} |
| break; |
| |
| case 114: |
| #line 1233 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.ParamAttrs) = ParamAttr::NoReturn; ;} |
| break; |
| |
| case 115: |
| #line 1234 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.ParamAttrs) = ParamAttr::NoUnwind; ;} |
| break; |
| |
| case 116: |
| #line 1235 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.ParamAttrs) = ParamAttr::ZExt; ;} |
| break; |
| |
| case 117: |
| #line 1236 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.ParamAttrs) = ParamAttr::SExt; ;} |
| break; |
| |
| case 118: |
| #line 1237 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.ParamAttrs) = ParamAttr::ReadNone; ;} |
| break; |
| |
| case 119: |
| #line 1238 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.ParamAttrs) = ParamAttr::ReadOnly; ;} |
| break; |
| |
| case 120: |
| #line 1241 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.ParamAttrs) = ParamAttr::None; ;} |
| break; |
| |
| case 121: |
| #line 1242 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ParamAttrs) = (yyvsp[(1) - (2)].ParamAttrs) | (yyvsp[(2) - (2)].ParamAttrs); |
| ;} |
| break; |
| |
| case 122: |
| #line 1249 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.UIntVal) = 0; ;} |
| break; |
| |
| case 123: |
| #line 1250 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.UIntVal) = (yyvsp[(2) - (2)].UInt64Val); |
| if ((yyval.UIntVal) != 0 && !isPowerOf2_32((yyval.UIntVal))) |
| GEN_ERROR("Alignment must be a power of two"); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 124: |
| #line 1256 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.UIntVal) = 0; ;} |
| break; |
| |
| case 125: |
| #line 1257 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.UIntVal) = (yyvsp[(3) - (3)].UInt64Val); |
| if ((yyval.UIntVal) != 0 && !isPowerOf2_32((yyval.UIntVal))) |
| GEN_ERROR("Alignment must be a power of two"); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 126: |
| #line 1265 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| for (unsigned i = 0, e = (yyvsp[(2) - (2)].StrVal)->length(); i != e; ++i) |
| if ((*(yyvsp[(2) - (2)].StrVal))[i] == '"' || (*(yyvsp[(2) - (2)].StrVal))[i] == '\\') |
| GEN_ERROR("Invalid character in section name"); |
| (yyval.StrVal) = (yyvsp[(2) - (2)].StrVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 127: |
| #line 1273 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.StrVal) = 0; ;} |
| break; |
| |
| case 128: |
| #line 1274 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.StrVal) = (yyvsp[(1) - (1)].StrVal); ;} |
| break; |
| |
| case 129: |
| #line 1279 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| {;} |
| break; |
| |
| case 130: |
| #line 1280 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| {;} |
| break; |
| |
| case 131: |
| #line 1281 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| CurGV->setSection(*(yyvsp[(1) - (1)].StrVal)); |
| delete (yyvsp[(1) - (1)].StrVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 132: |
| #line 1286 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if ((yyvsp[(2) - (2)].UInt64Val) != 0 && !isPowerOf2_32((yyvsp[(2) - (2)].UInt64Val))) |
| GEN_ERROR("Alignment must be a power of two"); |
| CurGV->setAlignment((yyvsp[(2) - (2)].UInt64Val)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 140: |
| #line 1302 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.TypeVal) = new PATypeHolder(OpaqueType::get()); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 141: |
| #line 1306 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.TypeVal) = new PATypeHolder((yyvsp[(1) - (1)].PrimType)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 142: |
| #line 1310 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Pointer type? |
| if (*(yyvsp[(1) - (2)].TypeVal) == Type::LabelTy) |
| GEN_ERROR("Cannot form a pointer to a basic block"); |
| (yyval.TypeVal) = new PATypeHolder(HandleUpRefs(PointerType::get(*(yyvsp[(1) - (2)].TypeVal)))); |
| delete (yyvsp[(1) - (2)].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 143: |
| #line 1317 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Named types are also simple types... |
| const Type* tmp = getTypeVal((yyvsp[(1) - (1)].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyval.TypeVal) = new PATypeHolder(tmp); |
| ;} |
| break; |
| |
| case 144: |
| #line 1322 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Type UpReference |
| if ((yyvsp[(2) - (2)].UInt64Val) > (uint64_t)~0U) GEN_ERROR("Value out of range"); |
| OpaqueType *OT = OpaqueType::get(); // Use temporary placeholder |
| UpRefs.push_back(UpRefRecord((unsigned)(yyvsp[(2) - (2)].UInt64Val), OT)); // Add to vector... |
| (yyval.TypeVal) = new PATypeHolder(OT); |
| UR_OUT("New Upreference!\n"); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 145: |
| #line 1330 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| // Allow but ignore attributes on function types; this permits auto-upgrade. |
| // FIXME: remove in LLVM 3.0. |
| std::vector<const Type*> Params; |
| TypeWithAttrsList::iterator I = (yyvsp[(3) - (5)].TypeWithAttrsList)->begin(), E = (yyvsp[(3) - (5)].TypeWithAttrsList)->end(); |
| for (; I != E; ++I ) { |
| const Type *Ty = I->Ty->get(); |
| Params.push_back(Ty); |
| } |
| bool isVarArg = Params.size() && Params.back() == Type::VoidTy; |
| if (isVarArg) Params.pop_back(); |
| |
| FunctionType *FT = FunctionType::get(*(yyvsp[(1) - (5)].TypeVal), Params, isVarArg); |
| delete (yyvsp[(3) - (5)].TypeWithAttrsList); // Delete the argument list |
| delete (yyvsp[(1) - (5)].TypeVal); // Delete the return type handle |
| (yyval.TypeVal) = new PATypeHolder(HandleUpRefs(FT)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 146: |
| #line 1348 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| // Allow but ignore attributes on function types; this permits auto-upgrade. |
| // FIXME: remove in LLVM 3.0. |
| std::vector<const Type*> Params; |
| TypeWithAttrsList::iterator I = (yyvsp[(3) - (5)].TypeWithAttrsList)->begin(), E = (yyvsp[(3) - (5)].TypeWithAttrsList)->end(); |
| for ( ; I != E; ++I ) { |
| const Type* Ty = I->Ty->get(); |
| Params.push_back(Ty); |
| } |
| bool isVarArg = Params.size() && Params.back() == Type::VoidTy; |
| if (isVarArg) Params.pop_back(); |
| |
| FunctionType *FT = FunctionType::get((yyvsp[(1) - (5)].PrimType), Params, isVarArg); |
| delete (yyvsp[(3) - (5)].TypeWithAttrsList); // Delete the argument list |
| (yyval.TypeVal) = new PATypeHolder(HandleUpRefs(FT)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 147: |
| #line 1366 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Sized array type? |
| (yyval.TypeVal) = new PATypeHolder(HandleUpRefs(ArrayType::get(*(yyvsp[(4) - (5)].TypeVal), (unsigned)(yyvsp[(2) - (5)].UInt64Val)))); |
| delete (yyvsp[(4) - (5)].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 148: |
| #line 1371 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Vector type? |
| const llvm::Type* ElemTy = (yyvsp[(4) - (5)].TypeVal)->get(); |
| if ((unsigned)(yyvsp[(2) - (5)].UInt64Val) != (yyvsp[(2) - (5)].UInt64Val)) |
| GEN_ERROR("Unsigned result not equal to signed result"); |
| if (!ElemTy->isFloatingPoint() && !ElemTy->isInteger()) |
| GEN_ERROR("Element type of a VectorType must be primitive"); |
| (yyval.TypeVal) = new PATypeHolder(HandleUpRefs(VectorType::get(*(yyvsp[(4) - (5)].TypeVal), (unsigned)(yyvsp[(2) - (5)].UInt64Val)))); |
| delete (yyvsp[(4) - (5)].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 149: |
| #line 1381 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Structure type? |
| std::vector<const Type*> Elements; |
| for (std::list<llvm::PATypeHolder>::iterator I = (yyvsp[(2) - (3)].TypeList)->begin(), |
| E = (yyvsp[(2) - (3)].TypeList)->end(); I != E; ++I) |
| Elements.push_back(*I); |
| |
| (yyval.TypeVal) = new PATypeHolder(HandleUpRefs(StructType::get(Elements))); |
| delete (yyvsp[(2) - (3)].TypeList); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 150: |
| #line 1391 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Empty structure type? |
| (yyval.TypeVal) = new PATypeHolder(StructType::get(std::vector<const Type*>())); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 151: |
| #line 1395 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| std::vector<const Type*> Elements; |
| for (std::list<llvm::PATypeHolder>::iterator I = (yyvsp[(3) - (5)].TypeList)->begin(), |
| E = (yyvsp[(3) - (5)].TypeList)->end(); I != E; ++I) |
| Elements.push_back(*I); |
| |
| (yyval.TypeVal) = new PATypeHolder(HandleUpRefs(StructType::get(Elements, true))); |
| delete (yyvsp[(3) - (5)].TypeList); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 152: |
| #line 1405 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Empty structure type? |
| (yyval.TypeVal) = new PATypeHolder(StructType::get(std::vector<const Type*>(), true)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 153: |
| #line 1412 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| // Allow but ignore attributes on function types; this permits auto-upgrade. |
| // FIXME: remove in LLVM 3.0. |
| (yyval.TypeWithAttrs).Ty = (yyvsp[(1) - (2)].TypeVal); |
| (yyval.TypeWithAttrs).Attrs = ParamAttr::None; |
| ;} |
| break; |
| |
| case 154: |
| #line 1421 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[(1) - (1)].TypeVal))->getDescription()); |
| if (!(*(yyvsp[(1) - (1)].TypeVal))->isFirstClassType()) |
| GEN_ERROR("LLVM functions cannot return aggregate types"); |
| (yyval.TypeVal) = (yyvsp[(1) - (1)].TypeVal); |
| ;} |
| break; |
| |
| case 155: |
| #line 1428 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.TypeVal) = new PATypeHolder(Type::VoidTy); |
| ;} |
| break; |
| |
| case 156: |
| #line 1433 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.TypeWithAttrsList) = new TypeWithAttrsList(); |
| (yyval.TypeWithAttrsList)->push_back((yyvsp[(1) - (1)].TypeWithAttrs)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 157: |
| #line 1438 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| ((yyval.TypeWithAttrsList)=(yyvsp[(1) - (3)].TypeWithAttrsList))->push_back((yyvsp[(3) - (3)].TypeWithAttrs)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 159: |
| #line 1446 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.TypeWithAttrsList)=(yyvsp[(1) - (3)].TypeWithAttrsList); |
| TypeWithAttrs TWA; TWA.Attrs = ParamAttr::None; |
| TWA.Ty = new PATypeHolder(Type::VoidTy); |
| (yyval.TypeWithAttrsList)->push_back(TWA); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 160: |
| #line 1453 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.TypeWithAttrsList) = new TypeWithAttrsList; |
| TypeWithAttrs TWA; TWA.Attrs = ParamAttr::None; |
| TWA.Ty = new PATypeHolder(Type::VoidTy); |
| (yyval.TypeWithAttrsList)->push_back(TWA); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 161: |
| #line 1460 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.TypeWithAttrsList) = new TypeWithAttrsList(); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 162: |
| #line 1468 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.TypeList) = new std::list<PATypeHolder>(); |
| (yyval.TypeList)->push_back(*(yyvsp[(1) - (1)].TypeVal)); |
| delete (yyvsp[(1) - (1)].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 163: |
| #line 1474 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| ((yyval.TypeList)=(yyvsp[(1) - (3)].TypeList))->push_back(*(yyvsp[(3) - (3)].TypeVal)); |
| delete (yyvsp[(3) - (3)].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 164: |
| #line 1486 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Nonempty unsized arr |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[(1) - (4)].TypeVal))->getDescription()); |
| const ArrayType *ATy = dyn_cast<ArrayType>((yyvsp[(1) - (4)].TypeVal)->get()); |
| if (ATy == 0) |
| GEN_ERROR("Cannot make array constant with type: '" + |
| (*(yyvsp[(1) - (4)].TypeVal))->getDescription() + "'"); |
| const Type *ETy = ATy->getElementType(); |
| int NumElements = ATy->getNumElements(); |
| |
| // Verify that we have the correct size... |
| if (NumElements != -1 && NumElements != (int)(yyvsp[(3) - (4)].ConstVector)->size()) |
| GEN_ERROR("Type mismatch: constant sized array initialized with " + |
| utostr((yyvsp[(3) - (4)].ConstVector)->size()) + " arguments, but has size of " + |
| itostr(NumElements) + ""); |
| |
| // Verify all elements are correct type! |
| for (unsigned i = 0; i < (yyvsp[(3) - (4)].ConstVector)->size(); i++) { |
| if (ETy != (*(yyvsp[(3) - (4)].ConstVector))[i]->getType()) |
| GEN_ERROR("Element #" + utostr(i) + " is not of type '" + |
| ETy->getDescription() +"' as required!\nIt is of type '"+ |
| (*(yyvsp[(3) - (4)].ConstVector))[i]->getType()->getDescription() + "'."); |
| } |
| |
| (yyval.ConstVal) = ConstantArray::get(ATy, *(yyvsp[(3) - (4)].ConstVector)); |
| delete (yyvsp[(1) - (4)].TypeVal); delete (yyvsp[(3) - (4)].ConstVector); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 165: |
| #line 1514 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[(1) - (3)].TypeVal))->getDescription()); |
| const ArrayType *ATy = dyn_cast<ArrayType>((yyvsp[(1) - (3)].TypeVal)->get()); |
| if (ATy == 0) |
| GEN_ERROR("Cannot make array constant with type: '" + |
| (*(yyvsp[(1) - (3)].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[(1) - (3)].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 166: |
| #line 1530 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[(1) - (3)].TypeVal))->getDescription()); |
| const ArrayType *ATy = dyn_cast<ArrayType>((yyvsp[(1) - (3)].TypeVal)->get()); |
| if (ATy == 0) |
| GEN_ERROR("Cannot make array constant with type: '" + |
| (*(yyvsp[(1) - (3)].TypeVal))->getDescription() + "'"); |
| |
| int NumElements = ATy->getNumElements(); |
| const Type *ETy = ATy->getElementType(); |
| if (NumElements != -1 && NumElements != int((yyvsp[(3) - (3)].StrVal)->length())) |
| GEN_ERROR("Can't build string constant of size " + |
| itostr((int)((yyvsp[(3) - (3)].StrVal)->length())) + |
| " when array has size " + itostr(NumElements) + ""); |
| std::vector<Constant*> Vals; |
| if (ETy == Type::Int8Ty) { |
| for (unsigned i = 0; i < (yyvsp[(3) - (3)].StrVal)->length(); ++i) |
| Vals.push_back(ConstantInt::get(ETy, (*(yyvsp[(3) - (3)].StrVal))[i])); |
| } else { |
| delete (yyvsp[(3) - (3)].StrVal); |
| GEN_ERROR("Cannot build string arrays of non byte sized elements"); |
| } |
| delete (yyvsp[(3) - (3)].StrVal); |
| (yyval.ConstVal) = ConstantArray::get(ATy, Vals); |
| delete (yyvsp[(1) - (3)].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 167: |
| #line 1557 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Nonempty unsized arr |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[(1) - (4)].TypeVal))->getDescription()); |
| const VectorType *PTy = dyn_cast<VectorType>((yyvsp[(1) - (4)].TypeVal)->get()); |
| if (PTy == 0) |
| GEN_ERROR("Cannot make packed constant with type: '" + |
| (*(yyvsp[(1) - (4)].TypeVal))->getDescription() + "'"); |
| const Type *ETy = PTy->getElementType(); |
| int NumElements = PTy->getNumElements(); |
| |
| // Verify that we have the correct size... |
| if (NumElements != -1 && NumElements != (int)(yyvsp[(3) - (4)].ConstVector)->size()) |
| GEN_ERROR("Type mismatch: constant sized packed initialized with " + |
| utostr((yyvsp[(3) - (4)].ConstVector)->size()) + " arguments, but has size of " + |
| itostr(NumElements) + ""); |
| |
| // Verify all elements are correct type! |
| for (unsigned i = 0; i < (yyvsp[(3) - (4)].ConstVector)->size(); i++) { |
| if (ETy != (*(yyvsp[(3) - (4)].ConstVector))[i]->getType()) |
| GEN_ERROR("Element #" + utostr(i) + " is not of type '" + |
| ETy->getDescription() +"' as required!\nIt is of type '"+ |
| (*(yyvsp[(3) - (4)].ConstVector))[i]->getType()->getDescription() + "'."); |
| } |
| |
| (yyval.ConstVal) = ConstantVector::get(PTy, *(yyvsp[(3) - (4)].ConstVector)); |
| delete (yyvsp[(1) - (4)].TypeVal); delete (yyvsp[(3) - (4)].ConstVector); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 168: |
| #line 1585 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| const StructType *STy = dyn_cast<StructType>((yyvsp[(1) - (4)].TypeVal)->get()); |
| if (STy == 0) |
| GEN_ERROR("Cannot make struct constant with type: '" + |
| (*(yyvsp[(1) - (4)].TypeVal))->getDescription() + "'"); |
| |
| if ((yyvsp[(3) - (4)].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[(3) - (4)].ConstVector)->size(); i != e; ++i) |
| if ((*(yyvsp[(3) - (4)].ConstVector))[i]->getType() != STy->getElementType(i)) |
| GEN_ERROR("Expected type '" + |
| STy->getElementType(i)->getDescription() + |
| "' for element #" + utostr(i) + |
| " of structure initializer"); |
| |
| // Check to ensure that Type is not packed |
| if (STy->isPacked()) |
| GEN_ERROR("Unpacked Initializer to vector type '" + |
| STy->getDescription() + "'"); |
| |
| (yyval.ConstVal) = ConstantStruct::get(STy, *(yyvsp[(3) - (4)].ConstVector)); |
| delete (yyvsp[(1) - (4)].TypeVal); delete (yyvsp[(3) - (4)].ConstVector); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 169: |
| #line 1611 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[(1) - (3)].TypeVal))->getDescription()); |
| const StructType *STy = dyn_cast<StructType>((yyvsp[(1) - (3)].TypeVal)->get()); |
| if (STy == 0) |
| GEN_ERROR("Cannot make struct constant with type: '" + |
| (*(yyvsp[(1) - (3)].TypeVal))->getDescription() + "'"); |
| |
| if (STy->getNumContainedTypes() != 0) |
| GEN_ERROR("Illegal number of initializers for structure type"); |
| |
| // Check to ensure that Type is not packed |
| if (STy->isPacked()) |
| GEN_ERROR("Unpacked Initializer to vector type '" + |
| STy->getDescription() + "'"); |
| |
| (yyval.ConstVal) = ConstantStruct::get(STy, std::vector<Constant*>()); |
| delete (yyvsp[(1) - (3)].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 170: |
| #line 1631 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| const StructType *STy = dyn_cast<StructType>((yyvsp[(1) - (6)].TypeVal)->get()); |
| if (STy == 0) |
| GEN_ERROR("Cannot make struct constant with type: '" + |
| (*(yyvsp[(1) - (6)].TypeVal))->getDescription() + "'"); |
| |
| if ((yyvsp[(4) - (6)].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[(4) - (6)].ConstVector)->size(); i != e; ++i) |
| if ((*(yyvsp[(4) - (6)].ConstVector))[i]->getType() != STy->getElementType(i)) |
| GEN_ERROR("Expected type '" + |
| STy->getElementType(i)->getDescription() + |
| "' for element #" + utostr(i) + |
| " of structure initializer"); |
| |
| // Check to ensure that Type is packed |
| if (!STy->isPacked()) |
| GEN_ERROR("Vector initializer to non-vector type '" + |
| STy->getDescription() + "'"); |
| |
| (yyval.ConstVal) = ConstantStruct::get(STy, *(yyvsp[(4) - (6)].ConstVector)); |
| delete (yyvsp[(1) - (6)].TypeVal); delete (yyvsp[(4) - (6)].ConstVector); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 171: |
| #line 1657 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[(1) - (5)].TypeVal))->getDescription()); |
| const StructType *STy = dyn_cast<StructType>((yyvsp[(1) - (5)].TypeVal)->get()); |
| if (STy == 0) |
| GEN_ERROR("Cannot make struct constant with type: '" + |
| (*(yyvsp[(1) - (5)].TypeVal))->getDescription() + "'"); |
| |
| if (STy->getNumContainedTypes() != 0) |
| GEN_ERROR("Illegal number of initializers for structure type"); |
| |
| // Check to ensure that Type is packed |
| if (!STy->isPacked()) |
| GEN_ERROR("Vector initializer to non-vector type '" + |
| STy->getDescription() + "'"); |
| |
| (yyval.ConstVal) = ConstantStruct::get(STy, std::vector<Constant*>()); |
| delete (yyvsp[(1) - (5)].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 172: |
| #line 1677 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[(1) - (2)].TypeVal))->getDescription()); |
| const PointerType *PTy = dyn_cast<PointerType>((yyvsp[(1) - (2)].TypeVal)->get()); |
| if (PTy == 0) |
| GEN_ERROR("Cannot make null pointer constant with type: '" + |
| (*(yyvsp[(1) - (2)].TypeVal))->getDescription() + "'"); |
| |
| (yyval.ConstVal) = ConstantPointerNull::get(PTy); |
| delete (yyvsp[(1) - (2)].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 173: |
| #line 1689 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[(1) - (2)].TypeVal))->getDescription()); |
| (yyval.ConstVal) = UndefValue::get((yyvsp[(1) - (2)].TypeVal)->get()); |
| delete (yyvsp[(1) - (2)].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 174: |
| #line 1696 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[(1) - (2)].TypeVal))->getDescription()); |
| const PointerType *Ty = dyn_cast<PointerType>((yyvsp[(1) - (2)].TypeVal)->get()); |
| if (Ty == 0) |
| GEN_ERROR("Global const reference must be a pointer type"); |
| |
| // ConstExprs can exist in the body of a function, thus creating |
| // GlobalValues whenever they refer to a variable. Because we are in |
| // the context of a function, getExistingVal will search the functions |
| // symbol table instead of the module symbol table for the global symbol, |
| // which throws things all off. To get around this, we just tell |
| // getExistingVal that we are at global scope here. |
| // |
| Function *SavedCurFn = CurFun.CurrentFunction; |
| CurFun.CurrentFunction = 0; |
| |
| Value *V = getExistingVal(Ty, (yyvsp[(2) - (2)].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[(2) - (2)].ValIDVal))); |
| |
| if (I != CurModule.GlobalRefs.end()) { |
| V = I->second; // Placeholder already exists, use it... |
| (yyvsp[(2) - (2)].ValIDVal).destroy(); |
| } else { |
| std::string Name; |
| if ((yyvsp[(2) - (2)].ValIDVal).Type == ValID::GlobalName) |
| Name = (yyvsp[(2) - (2)].ValIDVal).getName(); |
| else if ((yyvsp[(2) - (2)].ValIDVal).Type != ValID::GlobalID) |
| GEN_ERROR("Invalid reference to global"); |
| |
| // Create the forward referenced global. |
| GlobalValue *GV; |
| if (const FunctionType *FTy = |
| dyn_cast<FunctionType>(PT->getElementType())) { |
| GV = new Function(FTy, GlobalValue::ExternalWeakLinkage, Name, |
| CurModule.CurrentModule); |
| } else { |
| GV = new GlobalVariable(PT->getElementType(), false, |
| GlobalValue::ExternalWeakLinkage, 0, |
| Name, CurModule.CurrentModule); |
| } |
| |
| // Keep track of the fact that we have a forward ref to recycle it |
| CurModule.GlobalRefs.insert(std::make_pair(std::make_pair(PT, (yyvsp[(2) - (2)].ValIDVal)), GV)); |
| V = GV; |
| } |
| } |
| |
| (yyval.ConstVal) = cast<GlobalValue>(V); |
| delete (yyvsp[(1) - (2)].TypeVal); // Free the type handle |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 175: |
| #line 1762 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[(1) - (2)].TypeVal))->getDescription()); |
| if ((yyvsp[(1) - (2)].TypeVal)->get() != (yyvsp[(2) - (2)].ConstVal)->getType()) |
| GEN_ERROR("Mismatched types for constant expression: " + |
| (*(yyvsp[(1) - (2)].TypeVal))->getDescription() + " and " + (yyvsp[(2) - (2)].ConstVal)->getType()->getDescription()); |
| (yyval.ConstVal) = (yyvsp[(2) - (2)].ConstVal); |
| delete (yyvsp[(1) - (2)].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 176: |
| #line 1772 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[(1) - (2)].TypeVal))->getDescription()); |
| const Type *Ty = (yyvsp[(1) - (2)].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) - (2)].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 177: |
| #line 1782 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // integral constants |
| if (!ConstantInt::isValueValidForType((yyvsp[(1) - (2)].PrimType), (yyvsp[(2) - (2)].SInt64Val))) |
| GEN_ERROR("Constant value doesn't fit in type"); |
| (yyval.ConstVal) = ConstantInt::get((yyvsp[(1) - (2)].PrimType), (yyvsp[(2) - (2)].SInt64Val), true); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 178: |
| #line 1788 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // arbitrary precision integer constants |
| uint32_t BitWidth = cast<IntegerType>((yyvsp[(1) - (2)].PrimType))->getBitWidth(); |
| if ((yyvsp[(2) - (2)].APIntVal)->getBitWidth() > BitWidth) { |
| GEN_ERROR("Constant value does not fit in type"); |
| } |
| (yyvsp[(2) - (2)].APIntVal)->sextOrTrunc(BitWidth); |
| (yyval.ConstVal) = ConstantInt::get(*(yyvsp[(2) - (2)].APIntVal)); |
| delete (yyvsp[(2) - (2)].APIntVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 179: |
| #line 1798 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // integral constants |
| if (!ConstantInt::isValueValidForType((yyvsp[(1) - (2)].PrimType), (yyvsp[(2) - (2)].UInt64Val))) |
| GEN_ERROR("Constant value doesn't fit in type"); |
| (yyval.ConstVal) = ConstantInt::get((yyvsp[(1) - (2)].PrimType), (yyvsp[(2) - (2)].UInt64Val), false); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 180: |
| #line 1804 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // arbitrary precision integer constants |
| uint32_t BitWidth = cast<IntegerType>((yyvsp[(1) - (2)].PrimType))->getBitWidth(); |
| if ((yyvsp[(2) - (2)].APIntVal)->getBitWidth() > BitWidth) { |
| GEN_ERROR("Constant value does not fit in type"); |
| } |
| (yyvsp[(2) - (2)].APIntVal)->zextOrTrunc(BitWidth); |
| (yyval.ConstVal) = ConstantInt::get(*(yyvsp[(2) - (2)].APIntVal)); |
| delete (yyvsp[(2) - (2)].APIntVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 181: |
| #line 1814 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Boolean constants |
| assert(cast<IntegerType>((yyvsp[(1) - (2)].PrimType))->getBitWidth() == 1 && "Not Bool?"); |
| (yyval.ConstVal) = ConstantInt::getTrue(); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 182: |
| #line 1819 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Boolean constants |
| assert(cast<IntegerType>((yyvsp[(1) - (2)].PrimType))->getBitWidth() == 1 && "Not Bool?"); |
| (yyval.ConstVal) = ConstantInt::getFalse(); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 183: |
| #line 1824 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Floating point constants |
| if (!ConstantFP::isValueValidForType((yyvsp[(1) - (2)].PrimType), *(yyvsp[(2) - (2)].FPVal))) |
| GEN_ERROR("Floating point constant invalid for type"); |
| // Lexer has no type info, so builds all float and double FP constants |
| // as double. Fix this here. Long double is done right. |
| if (&(yyvsp[(2) - (2)].FPVal)->getSemantics()==&APFloat::IEEEdouble && (yyvsp[(1) - (2)].PrimType)==Type::FloatTy) |
| (yyvsp[(2) - (2)].FPVal)->convert(APFloat::IEEEsingle, APFloat::rmNearestTiesToEven); |
| (yyval.ConstVal) = ConstantFP::get((yyvsp[(1) - (2)].PrimType), *(yyvsp[(2) - (2)].FPVal)); |
| delete (yyvsp[(2) - (2)].FPVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 184: |
| #line 1837 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[(5) - (6)].TypeVal))->getDescription()); |
| Constant *Val = (yyvsp[(3) - (6)].ConstVal); |
| const Type *DestTy = (yyvsp[(5) - (6)].TypeVal)->get(); |
| if (!CastInst::castIsValid((yyvsp[(1) - (6)].CastOpVal), (yyvsp[(3) - (6)].ConstVal), DestTy)) |
| GEN_ERROR("invalid cast opcode for cast from '" + |
| Val->getType()->getDescription() + "' to '" + |
| DestTy->getDescription() + "'"); |
| (yyval.ConstVal) = ConstantExpr::getCast((yyvsp[(1) - (6)].CastOpVal), (yyvsp[(3) - (6)].ConstVal), DestTy); |
| delete (yyvsp[(5) - (6)].TypeVal); |
| ;} |
| break; |
| |
| case 185: |
| #line 1849 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!isa<PointerType>((yyvsp[(3) - (5)].ConstVal)->getType())) |
| GEN_ERROR("GetElementPtr requires a pointer operand"); |
| |
| const Type *IdxTy = |
| GetElementPtrInst::getIndexedType((yyvsp[(3) - (5)].ConstVal)->getType(), (yyvsp[(4) - (5)].ValueList)->begin(), (yyvsp[(4) - (5)].ValueList)->end(), |
| true); |
| if (!IdxTy) |
| GEN_ERROR("Index list invalid for constant getelementptr"); |
| |
| SmallVector<Constant*, 8> IdxVec; |
| for (unsigned i = 0, e = (yyvsp[(4) - (5)].ValueList)->size(); i != e; ++i) |
| if (Constant *C = dyn_cast<Constant>((*(yyvsp[(4) - (5)].ValueList))[i])) |
| IdxVec.push_back(C); |
| else |
| GEN_ERROR("Indices to constant getelementptr must be constants"); |
| |
| delete (yyvsp[(4) - (5)].ValueList); |
| |
| (yyval.ConstVal) = ConstantExpr::getGetElementPtr((yyvsp[(3) - (5)].ConstVal), &IdxVec[0], IdxVec.size()); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 186: |
| #line 1871 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if ((yyvsp[(3) - (8)].ConstVal)->getType() != Type::Int1Ty) |
| GEN_ERROR("Select condition must be of boolean type"); |
| if ((yyvsp[(5) - (8)].ConstVal)->getType() != (yyvsp[(7) - (8)].ConstVal)->getType()) |
| GEN_ERROR("Select operand types must match"); |
| (yyval.ConstVal) = ConstantExpr::getSelect((yyvsp[(3) - (8)].ConstVal), (yyvsp[(5) - (8)].ConstVal), (yyvsp[(7) - (8)].ConstVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 187: |
| #line 1879 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if ((yyvsp[(3) - (6)].ConstVal)->getType() != (yyvsp[(5) - (6)].ConstVal)->getType()) |
| GEN_ERROR("Binary operator types must match"); |
| CHECK_FOR_ERROR; |
| (yyval.ConstVal) = ConstantExpr::get((yyvsp[(1) - (6)].BinaryOpVal), (yyvsp[(3) - (6)].ConstVal), (yyvsp[(5) - (6)].ConstVal)); |
| ;} |
| break; |
| |
| case 188: |
| #line 1885 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if ((yyvsp[(3) - (6)].ConstVal)->getType() != (yyvsp[(5) - (6)].ConstVal)->getType()) |
| GEN_ERROR("Logical operator types must match"); |
| if (!(yyvsp[(3) - (6)].ConstVal)->getType()->isInteger()) { |
| if (Instruction::isShift((yyvsp[(1) - (6)].BinaryOpVal)) || !isa<VectorType>((yyvsp[(3) - (6)].ConstVal)->getType()) || |
| !cast<VectorType>((yyvsp[(3) - (6)].ConstVal)->getType())->getElementType()->isInteger()) |
| GEN_ERROR("Logical operator requires integral operands"); |
| } |
| (yyval.ConstVal) = ConstantExpr::get((yyvsp[(1) - (6)].BinaryOpVal), (yyvsp[(3) - (6)].ConstVal), (yyvsp[(5) - (6)].ConstVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 189: |
| #line 1896 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if ((yyvsp[(4) - (7)].ConstVal)->getType() != (yyvsp[(6) - (7)].ConstVal)->getType()) |
| GEN_ERROR("icmp operand types must match"); |
| (yyval.ConstVal) = ConstantExpr::getICmp((yyvsp[(2) - (7)].IPredicate), (yyvsp[(4) - (7)].ConstVal), (yyvsp[(6) - (7)].ConstVal)); |
| ;} |
| break; |
| |
| case 190: |
| #line 1901 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if ((yyvsp[(4) - (7)].ConstVal)->getType() != (yyvsp[(6) - (7)].ConstVal)->getType()) |
| GEN_ERROR("fcmp operand types must match"); |
| (yyval.ConstVal) = ConstantExpr::getFCmp((yyvsp[(2) - (7)].FPredicate), (yyvsp[(4) - (7)].ConstVal), (yyvsp[(6) - (7)].ConstVal)); |
| ;} |
| break; |
| |
| case 191: |
| #line 1906 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!ExtractElementInst::isValidOperands((yyvsp[(3) - (6)].ConstVal), (yyvsp[(5) - (6)].ConstVal))) |
| GEN_ERROR("Invalid extractelement operands"); |
| (yyval.ConstVal) = ConstantExpr::getExtractElement((yyvsp[(3) - (6)].ConstVal), (yyvsp[(5) - (6)].ConstVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 192: |
| #line 1912 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!InsertElementInst::isValidOperands((yyvsp[(3) - (8)].ConstVal), (yyvsp[(5) - (8)].ConstVal), (yyvsp[(7) - (8)].ConstVal))) |
| GEN_ERROR("Invalid insertelement operands"); |
| (yyval.ConstVal) = ConstantExpr::getInsertElement((yyvsp[(3) - (8)].ConstVal), (yyvsp[(5) - (8)].ConstVal), (yyvsp[(7) - (8)].ConstVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 193: |
| #line 1918 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!ShuffleVectorInst::isValidOperands((yyvsp[(3) - (8)].ConstVal), (yyvsp[(5) - (8)].ConstVal), (yyvsp[(7) - (8)].ConstVal))) |
| GEN_ERROR("Invalid shufflevector operands"); |
| (yyval.ConstVal) = ConstantExpr::getShuffleVector((yyvsp[(3) - (8)].ConstVal), (yyvsp[(5) - (8)].ConstVal), (yyvsp[(7) - (8)].ConstVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 194: |
| #line 1927 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| ((yyval.ConstVector) = (yyvsp[(1) - (3)].ConstVector))->push_back((yyvsp[(3) - (3)].ConstVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 195: |
| #line 1931 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ConstVector) = new std::vector<Constant*>(); |
| (yyval.ConstVector)->push_back((yyvsp[(1) - (1)].ConstVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 196: |
| #line 1939 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.BoolVal) = false; ;} |
| break; |
| |
| case 197: |
| #line 1939 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.BoolVal) = true; ;} |
| break; |
| |
| case 198: |
| #line 1942 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.BoolVal) = true; ;} |
| break; |
| |
| case 199: |
| #line 1942 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.BoolVal) = false; ;} |
| break; |
| |
| case 200: |
| #line 1945 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| const Type* VTy = (yyvsp[(1) - (2)].TypeVal)->get(); |
| Value *V = getVal(VTy, (yyvsp[(2) - (2)].ValIDVal)); |
| CHECK_FOR_ERROR |
| GlobalValue* Aliasee = dyn_cast<GlobalValue>(V); |
| if (!Aliasee) |
| GEN_ERROR("Aliases can be created only to global values"); |
| |
| (yyval.ConstVal) = Aliasee; |
| CHECK_FOR_ERROR |
| delete (yyvsp[(1) - (2)].TypeVal); |
| ;} |
| break; |
| |
| case 201: |
| #line 1957 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| Constant *Val = (yyvsp[(3) - (6)].ConstVal); |
| const Type *DestTy = (yyvsp[(5) - (6)].TypeVal)->get(); |
| if (!CastInst::castIsValid((yyvsp[(1) - (6)].CastOpVal), (yyvsp[(3) - (6)].ConstVal), DestTy)) |
| GEN_ERROR("invalid cast opcode for cast from '" + |
| Val->getType()->getDescription() + "' to '" + |
| DestTy->getDescription() + "'"); |
| |
| (yyval.ConstVal) = ConstantExpr::getCast((yyvsp[(1) - (6)].CastOpVal), (yyvsp[(3) - (6)].ConstVal), DestTy); |
| CHECK_FOR_ERROR |
| delete (yyvsp[(5) - (6)].TypeVal); |
| ;} |
| break; |
| |
| case 202: |
| #line 1978 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ModuleVal) = ParserResult = CurModule.CurrentModule; |
| CurModule.ModuleDone(); |
| CHECK_FOR_ERROR; |
| ;} |
| break; |
| |
| case 203: |
| #line 1983 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ModuleVal) = ParserResult = CurModule.CurrentModule; |
| CurModule.ModuleDone(); |
| CHECK_FOR_ERROR; |
| ;} |
| break; |
| |
| case 206: |
| #line 1996 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { CurFun.isDeclare = false; ;} |
| break; |
| |
| case 207: |
| #line 1996 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| CurFun.FunctionDone(); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 208: |
| #line 2000 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { CurFun.isDeclare = true; ;} |
| break; |
| |
| case 209: |
| #line 2000 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 210: |
| #line 2003 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 211: |
| #line 2006 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[(3) - (3)].TypeVal))->getDescription()); |
| // Eagerly resolve types. This is not an optimization, this is a |
| // requirement that is due to the fact that we could have this: |
| // |
| // %list = type { %list * } |
| // %list = type { %list * } ; repeated type decl |
| // |
| // If types are not resolved eagerly, then the two types will not be |
| // determined to be the same type! |
| // |
| ResolveTypeTo((yyvsp[(1) - (3)].StrVal), *(yyvsp[(3) - (3)].TypeVal)); |
| |
| if (!setTypeName(*(yyvsp[(3) - (3)].TypeVal), (yyvsp[(1) - (3)].StrVal)) && !(yyvsp[(1) - (3)].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[(3) - (3)].TypeVal)); |
| } |
| |
| delete (yyvsp[(3) - (3)].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 212: |
| #line 2030 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| ResolveTypeTo((yyvsp[(1) - (3)].StrVal), (yyvsp[(3) - (3)].PrimType)); |
| |
| if (!setTypeName((yyvsp[(3) - (3)].PrimType), (yyvsp[(1) - (3)].StrVal)) && !(yyvsp[(1) - (3)].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[(3) - (3)].PrimType)); |
| } |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 213: |
| #line 2041 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| /* "Externally Visible" Linkage */ |
| if ((yyvsp[(5) - (5)].ConstVal) == 0) |
| GEN_ERROR("Global value initializer is not a constant"); |
| CurGV = ParseGlobalVariable((yyvsp[(1) - (5)].StrVal), GlobalValue::ExternalLinkage, |
| (yyvsp[(2) - (5)].Visibility), (yyvsp[(4) - (5)].BoolVal), (yyvsp[(5) - (5)].ConstVal)->getType(), (yyvsp[(5) - (5)].ConstVal), (yyvsp[(3) - (5)].BoolVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 214: |
| #line 2048 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| CurGV = 0; |
| ;} |
| break; |
| |
| case 215: |
| #line 2052 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if ((yyvsp[(6) - (6)].ConstVal) == 0) |
| GEN_ERROR("Global value initializer is not a constant"); |
| CurGV = ParseGlobalVariable((yyvsp[(1) - (6)].StrVal), (yyvsp[(2) - (6)].Linkage), (yyvsp[(3) - (6)].Visibility), (yyvsp[(5) - (6)].BoolVal), (yyvsp[(6) - (6)].ConstVal)->getType(), (yyvsp[(6) - (6)].ConstVal), (yyvsp[(4) - (6)].BoolVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 216: |
| #line 2057 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| CurGV = 0; |
| ;} |
| break; |
| |
| case 217: |
| #line 2061 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[(6) - (6)].TypeVal))->getDescription()); |
| CurGV = ParseGlobalVariable((yyvsp[(1) - (6)].StrVal), (yyvsp[(2) - (6)].Linkage), (yyvsp[(3) - (6)].Visibility), (yyvsp[(5) - (6)].BoolVal), *(yyvsp[(6) - (6)].TypeVal), 0, (yyvsp[(4) - (6)].BoolVal)); |
| CHECK_FOR_ERROR |
| delete (yyvsp[(6) - (6)].TypeVal); |
| ;} |
| break; |
| |
| case 218: |
| #line 2067 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| CurGV = 0; |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 219: |
| #line 2071 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| std::string Name; |
| if ((yyvsp[(1) - (5)].StrVal)) { |
| Name = *(yyvsp[(1) - (5)].StrVal); |
| delete (yyvsp[(1) - (5)].StrVal); |
| } |
| if (Name.empty()) |
| GEN_ERROR("Alias name cannot be empty"); |
| |
| Constant* Aliasee = (yyvsp[(5) - (5)].ConstVal); |
| if (Aliasee == 0) |
| GEN_ERROR(std::string("Invalid aliasee for alias: ") + Name); |
| |
| GlobalAlias* GA = new GlobalAlias(Aliasee->getType(), (yyvsp[(4) - (5)].Linkage), Name, Aliasee, |
| CurModule.CurrentModule); |
| GA->setVisibility((yyvsp[(2) - (5)].Visibility)); |
| InsertValue(GA, CurModule.Values); |
| |
| |
| // If there was a forward reference of this alias, resolve it now. |
| |
| ValID ID; |
| if (!Name.empty()) |
| ID = ValID::createGlobalName(Name); |
| else |
| ID = ValID::createGlobalID(CurModule.Values.size()-1); |
| |
| if (GlobalValue *FWGV = |
| CurModule.GetForwardRefForGlobal(GA->getType(), ID)) { |
| // Replace uses of the fwdref with the actual alias. |
| FWGV->replaceAllUsesWith(GA); |
| if (GlobalVariable *GV = dyn_cast<GlobalVariable>(FWGV)) |
| GV->eraseFromParent(); |
| else |
| cast<Function>(FWGV)->eraseFromParent(); |
| } |
| ID.destroy(); |
| |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 220: |
| #line 2111 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 221: |
| #line 2114 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 222: |
| #line 2120 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| const std::string &AsmSoFar = CurModule.CurrentModule->getModuleInlineAsm(); |
| if (AsmSoFar.empty()) |
| CurModule.CurrentModule->setModuleInlineAsm(*(yyvsp[(1) - (1)].StrVal)); |
| else |
| CurModule.CurrentModule->setModuleInlineAsm(AsmSoFar+"\n"+*(yyvsp[(1) - (1)].StrVal)); |
| delete (yyvsp[(1) - (1)].StrVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 223: |
| #line 2130 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| CurModule.CurrentModule->setTargetTriple(*(yyvsp[(3) - (3)].StrVal)); |
| delete (yyvsp[(3) - (3)].StrVal); |
| ;} |
| break; |
| |
| case 224: |
| #line 2134 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| CurModule.CurrentModule->setDataLayout(*(yyvsp[(3) - (3)].StrVal)); |
| delete (yyvsp[(3) - (3)].StrVal); |
| ;} |
| break; |
| |
| case 226: |
| #line 2141 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| CurModule.CurrentModule->addLibrary(*(yyvsp[(3) - (3)].StrVal)); |
| delete (yyvsp[(3) - (3)].StrVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 227: |
| #line 2146 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| CurModule.CurrentModule->addLibrary(*(yyvsp[(1) - (1)].StrVal)); |
| delete (yyvsp[(1) - (1)].StrVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 228: |
| #line 2151 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 229: |
| #line 2160 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[(3) - (5)].TypeVal))->getDescription()); |
| if (*(yyvsp[(3) - (5)].TypeVal) == Type::VoidTy) |
| GEN_ERROR("void typed arguments are invalid"); |
| ArgListEntry E; E.Attrs = (yyvsp[(4) - (5)].ParamAttrs); E.Ty = (yyvsp[(3) - (5)].TypeVal); E.Name = (yyvsp[(5) - (5)].StrVal); |
| (yyval.ArgList) = (yyvsp[(1) - (5)].ArgList); |
| (yyvsp[(1) - (5)].ArgList)->push_back(E); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 230: |
| #line 2170 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[(1) - (3)].TypeVal))->getDescription()); |
| if (*(yyvsp[(1) - (3)].TypeVal) == Type::VoidTy) |
| GEN_ERROR("void typed arguments are invalid"); |
| ArgListEntry E; E.Attrs = (yyvsp[(2) - (3)].ParamAttrs); E.Ty = (yyvsp[(1) - (3)].TypeVal); E.Name = (yyvsp[(3) - (3)].StrVal); |
| (yyval.ArgList) = new ArgListType; |
| (yyval.ArgList)->push_back(E); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 231: |
| #line 2181 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ArgList) = (yyvsp[(1) - (1)].ArgList); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 232: |
| #line 2185 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ArgList) = (yyvsp[(1) - (3)].ArgList); |
| struct ArgListEntry E; |
| E.Ty = new PATypeHolder(Type::VoidTy); |
| E.Name = 0; |
| E.Attrs = ParamAttr::None; |
| (yyval.ArgList)->push_back(E); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 233: |
| #line 2194 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ArgList) = new ArgListType; |
| struct ArgListEntry E; |
| E.Ty = new PATypeHolder(Type::VoidTy); |
| E.Name = 0; |
| E.Attrs = ParamAttr::None; |
| (yyval.ArgList)->push_back(E); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 234: |
| #line 2203 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ArgList) = 0; |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 235: |
| #line 2209 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| std::string FunctionName(*(yyvsp[(3) - (9)].StrVal)); |
| delete (yyvsp[(3) - (9)].StrVal); // Free strdup'd memory! |
| |
| // Check the function result for abstractness if this is a define. We should |
| // have no abstract types at this point |
| if (!CurFun.isDeclare && CurModule.TypeIsUnresolved((yyvsp[(2) - (9)].TypeVal))) |
| GEN_ERROR("Reference to abstract result: "+ (yyvsp[(2) - (9)].TypeVal)->get()->getDescription()); |
| |
| std::vector<const Type*> ParamTypeList; |
| ParamAttrsVector Attrs; |
| if ((yyvsp[(7) - (9)].ParamAttrs) != ParamAttr::None) { |
| ParamAttrsWithIndex PAWI; |
| PAWI.index = 0; |
| PAWI.attrs = (yyvsp[(7) - (9)].ParamAttrs); |
| Attrs.push_back(PAWI); |
| } |
| if ((yyvsp[(5) - (9)].ArgList)) { // If there are arguments... |
| unsigned index = 1; |
| for (ArgListType::iterator I = (yyvsp[(5) - (9)].ArgList)->begin(); I != (yyvsp[(5) - (9)].ArgList)->end(); ++I, ++index) { |
| const Type* Ty = I->Ty->get(); |
| if (!CurFun.isDeclare && CurModule.TypeIsUnresolved(I->Ty)) |
| GEN_ERROR("Reference to abstract argument: " + Ty->getDescription()); |
| ParamTypeList.push_back(Ty); |
| if (Ty != Type::VoidTy) |
| if (I->Attrs != ParamAttr::None) { |
| ParamAttrsWithIndex PAWI; |
| PAWI.index = index; |
| PAWI.attrs = I->Attrs; |
| Attrs.push_back(PAWI); |
| } |
| } |
| } |
| |
| bool isVarArg = ParamTypeList.size() && ParamTypeList.back() == Type::VoidTy; |
| if (isVarArg) ParamTypeList.pop_back(); |
| |
| const ParamAttrsList *PAL = 0; |
| if (!Attrs.empty()) |
| PAL = ParamAttrsList::get(Attrs); |
| |
| FunctionType *FT = FunctionType::get(*(yyvsp[(2) - (9)].TypeVal), ParamTypeList, isVarArg); |
| const PointerType *PFT = PointerType::get(FT); |
| delete (yyvsp[(2) - (9)].TypeVal); |
| |
| ValID ID; |
| if (!FunctionName.empty()) { |
| ID = ValID::createGlobalName((char*)FunctionName.c_str()); |
| } else { |
| ID = ValID::createGlobalID(CurModule.Values.size()); |
| } |
| |
| Function *Fn = 0; |
| // See if this function was forward referenced. If so, recycle the object. |
| if (GlobalValue *FWRef = CurModule.GetForwardRefForGlobal(PFT, ID)) { |
| // Move the function to the end of the list, from whereever it was |
| // previously inserted. |
| Fn = cast<Function>(FWRef); |
| assert(!Fn->getParamAttrs() && "Forward reference has parameter attributes!"); |
| CurModule.CurrentModule->getFunctionList().remove(Fn); |
| CurModule.CurrentModule->getFunctionList().push_back(Fn); |
| } else if (!FunctionName.empty() && // Merge with an earlier prototype? |
| (Fn = CurModule.CurrentModule->getFunction(FunctionName))) { |
| if (Fn->getFunctionType() != FT ) { |
| // The existing function doesn't have the same type. This is an overload |
| // error. |
| GEN_ERROR("Overload of function '" + FunctionName + "' not permitted."); |
| } else if (Fn->getParamAttrs() != PAL) { |
| // The existing function doesn't have the same parameter attributes. |
| // This is an overload error. |
| GEN_ERROR("Overload of function '" + FunctionName + "' not permitted."); |
| } else if (!CurFun.isDeclare && !Fn->isDeclaration()) { |
| // Neither the existing or the current function is a declaration and they |
| // have the same name and same type. Clearly this is a redefinition. |
| GEN_ERROR("Redefinition of function '" + FunctionName + "'"); |
| } else if (Fn->isDeclaration()) { |
| // Make sure to strip off any argument names so we can't get conflicts. |
| for (Function::arg_iterator AI = Fn->arg_begin(), AE = Fn->arg_end(); |
| AI != AE; ++AI) |
| AI->setName(""); |
| } |
| } else { // Not already defined? |
| Fn = new Function(FT, GlobalValue::ExternalWeakLinkage, FunctionName, |
| CurModule.CurrentModule); |
| InsertValue(Fn, CurModule.Values); |
| } |
| |
| CurFun.FunctionStart(Fn); |
| |
| if (CurFun.isDeclare) { |
| // If we have declaration, always overwrite linkage. This will allow us to |
| // correctly handle cases, when pointer to function is passed as argument to |
| // another function. |
| Fn->setLinkage(CurFun.Linkage); |
| Fn->setVisibility(CurFun.Visibility); |
| } |
| Fn->setCallingConv((yyvsp[(1) - (9)].UIntVal)); |
| Fn->setParamAttrs(PAL); |
| Fn->setAlignment((yyvsp[(9) - (9)].UIntVal)); |
| if ((yyvsp[(8) - (9)].StrVal)) { |
| Fn->setSection(*(yyvsp[(8) - (9)].StrVal)); |
| delete (yyvsp[(8) - (9)].StrVal); |
| } |
| |
| // Add all of the arguments we parsed to the function... |
| if ((yyvsp[(5) - (9)].ArgList)) { // Is null if empty... |
| if (isVarArg) { // Nuke the last entry |
| assert((yyvsp[(5) - (9)].ArgList)->back().Ty->get() == Type::VoidTy && (yyvsp[(5) - (9)].ArgList)->back().Name == 0 && |
| "Not a varargs marker!"); |
| delete (yyvsp[(5) - (9)].ArgList)->back().Ty; |
| (yyvsp[(5) - (9)].ArgList)->pop_back(); // Delete the last entry |
| } |
| Function::arg_iterator ArgIt = Fn->arg_begin(); |
| Function::arg_iterator ArgEnd = Fn->arg_end(); |
| unsigned Idx = 1; |
| for (ArgListType::iterator I = (yyvsp[(5) - (9)].ArgList)->begin(); |
| I != (yyvsp[(5) - (9)].ArgList)->end() && ArgIt != ArgEnd; ++I, ++ArgIt) { |
| delete I->Ty; // Delete the typeholder... |
| setValueName(ArgIt, I->Name); // Insert arg into symtab... |
| CHECK_FOR_ERROR |
| InsertValue(ArgIt); |
| Idx++; |
| } |
| |
| delete (yyvsp[(5) - (9)].ArgList); // We're now done with the argument list |
| } |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 238: |
| #line 2340 "/home/duncan/LLVM/llvm.top/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[(1) - (4)].Linkage)); |
| (yyval.FunctionVal)->setVisibility((yyvsp[(2) - (4)].Visibility)); |
| ;} |
| break; |
| |
| case 241: |
| #line 2351 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.FunctionVal) = (yyvsp[(1) - (2)].FunctionVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 242: |
| #line 2356 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| CurFun.CurrentFunction->setLinkage((yyvsp[(1) - (3)].Linkage)); |
| CurFun.CurrentFunction->setVisibility((yyvsp[(2) - (3)].Visibility)); |
| (yyval.FunctionVal) = CurFun.CurrentFunction; |
| CurFun.FunctionDone(); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 243: |
| #line 2368 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.BoolVal) = false; |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 244: |
| #line 2372 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.BoolVal) = true; |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 245: |
| #line 2377 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // A reference to a direct constant |
| (yyval.ValIDVal) = ValID::create((yyvsp[(1) - (1)].SInt64Val)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 246: |
| #line 2381 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ValIDVal) = ValID::create((yyvsp[(1) - (1)].UInt64Val)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 247: |
| #line 2385 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Perhaps it's an FP constant? |
| (yyval.ValIDVal) = ValID::create((yyvsp[(1) - (1)].FPVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 248: |
| #line 2389 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ValIDVal) = ValID::create(ConstantInt::getTrue()); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 249: |
| #line 2393 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ValIDVal) = ValID::create(ConstantInt::getFalse()); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 250: |
| #line 2397 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ValIDVal) = ValID::createNull(); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 251: |
| #line 2401 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ValIDVal) = ValID::createUndef(); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 252: |
| #line 2405 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // A vector zero constant. |
| (yyval.ValIDVal) = ValID::createZeroInit(); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 253: |
| #line 2409 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Nonempty unsized packed vector |
| const Type *ETy = (*(yyvsp[(2) - (3)].ConstVector))[0]->getType(); |
| int NumElements = (yyvsp[(2) - (3)].ConstVector)->size(); |
| |
| VectorType* pt = VectorType::get(ETy, NumElements); |
| PATypeHolder* PTy = new PATypeHolder( |
| HandleUpRefs( |
| VectorType::get( |
| ETy, |
| NumElements) |
| ) |
| ); |
| |
| // Verify all elements are correct type! |
| for (unsigned i = 0; i < (yyvsp[(2) - (3)].ConstVector)->size(); i++) { |
| if (ETy != (*(yyvsp[(2) - (3)].ConstVector))[i]->getType()) |
| GEN_ERROR("Element #" + utostr(i) + " is not of type '" + |
| ETy->getDescription() +"' as required!\nIt is of type '" + |
| (*(yyvsp[(2) - (3)].ConstVector))[i]->getType()->getDescription() + "'."); |
| } |
| |
| (yyval.ValIDVal) = ValID::create(ConstantVector::get(pt, *(yyvsp[(2) - (3)].ConstVector))); |
| delete PTy; delete (yyvsp[(2) - (3)].ConstVector); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 254: |
| #line 2434 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ValIDVal) = ValID::create((yyvsp[(1) - (1)].ConstVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 255: |
| #line 2438 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ValIDVal) = ValID::createInlineAsm(*(yyvsp[(3) - (5)].StrVal), *(yyvsp[(5) - (5)].StrVal), (yyvsp[(2) - (5)].BoolVal)); |
| delete (yyvsp[(3) - (5)].StrVal); |
| delete (yyvsp[(5) - (5)].StrVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 256: |
| #line 2448 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Is it an integer reference...? |
| (yyval.ValIDVal) = ValID::createLocalID((yyvsp[(1) - (1)].UIntVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 257: |
| #line 2452 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ValIDVal) = ValID::createGlobalID((yyvsp[(1) - (1)].UIntVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 258: |
| #line 2456 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Is it a named reference...? |
| (yyval.ValIDVal) = ValID::createLocalName(*(yyvsp[(1) - (1)].StrVal)); |
| delete (yyvsp[(1) - (1)].StrVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 259: |
| #line 2461 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Is it a named reference...? |
| (yyval.ValIDVal) = ValID::createGlobalName(*(yyvsp[(1) - (1)].StrVal)); |
| delete (yyvsp[(1) - (1)].StrVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 262: |
| #line 2474 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[(1) - (2)].TypeVal))->getDescription()); |
| (yyval.ValueVal) = getVal(*(yyvsp[(1) - (2)].TypeVal), (yyvsp[(2) - (2)].ValIDVal)); |
| delete (yyvsp[(1) - (2)].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 263: |
| #line 2483 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.FunctionVal) = (yyvsp[(1) - (2)].FunctionVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 264: |
| #line 2487 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Do not allow functions with 0 basic blocks |
| (yyval.FunctionVal) = (yyvsp[(1) - (2)].FunctionVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 265: |
| #line 2496 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| setValueName((yyvsp[(3) - (3)].TermInstVal), (yyvsp[(2) - (3)].StrVal)); |
| CHECK_FOR_ERROR |
| InsertValue((yyvsp[(3) - (3)].TermInstVal)); |
| (yyvsp[(1) - (3)].BasicBlockVal)->getInstList().push_back((yyvsp[(3) - (3)].TermInstVal)); |
| (yyval.BasicBlockVal) = (yyvsp[(1) - (3)].BasicBlockVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 266: |
| #line 2505 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (CastInst *CI1 = dyn_cast<CastInst>((yyvsp[(2) - (2)].InstVal))) |
| if (CastInst *CI2 = dyn_cast<CastInst>(CI1->getOperand(0))) |
| if (CI2->getParent() == 0) |
| (yyvsp[(1) - (2)].BasicBlockVal)->getInstList().push_back(CI2); |
| (yyvsp[(1) - (2)].BasicBlockVal)->getInstList().push_back((yyvsp[(2) - (2)].InstVal)); |
| (yyval.BasicBlockVal) = (yyvsp[(1) - (2)].BasicBlockVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 267: |
| #line 2514 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Empty space between instruction lists |
| (yyval.BasicBlockVal) = defineBBVal(ValID::createLocalID(CurFun.NextValNum)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 268: |
| #line 2518 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Labelled (named) basic block |
| (yyval.BasicBlockVal) = defineBBVal(ValID::createLocalName(*(yyvsp[(1) - (1)].StrVal))); |
| delete (yyvsp[(1) - (1)].StrVal); |
| CHECK_FOR_ERROR |
| |
| ;} |
| break; |
| |
| case 269: |
| #line 2525 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Return with a result... |
| (yyval.TermInstVal) = new ReturnInst((yyvsp[(2) - (2)].ValueVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 270: |
| #line 2529 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Return with no result... |
| (yyval.TermInstVal) = new ReturnInst(); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 271: |
| #line 2533 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Unconditional Branch... |
| BasicBlock* tmpBB = getBBVal((yyvsp[(3) - (3)].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyval.TermInstVal) = new BranchInst(tmpBB); |
| ;} |
| break; |
| |
| case 272: |
| #line 2538 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| assert(cast<IntegerType>((yyvsp[(2) - (9)].PrimType))->getBitWidth() == 1 && "Not Bool?"); |
| BasicBlock* tmpBBA = getBBVal((yyvsp[(6) - (9)].ValIDVal)); |
| CHECK_FOR_ERROR |
| BasicBlock* tmpBBB = getBBVal((yyvsp[(9) - (9)].ValIDVal)); |
| CHECK_FOR_ERROR |
| Value* tmpVal = getVal(Type::Int1Ty, (yyvsp[(3) - (9)].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyval.TermInstVal) = new BranchInst(tmpBBA, tmpBBB, tmpVal); |
| ;} |
| break; |
| |
| case 273: |
| #line 2548 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| Value* tmpVal = getVal((yyvsp[(2) - (9)].PrimType), (yyvsp[(3) - (9)].ValIDVal)); |
| CHECK_FOR_ERROR |
| BasicBlock* tmpBB = getBBVal((yyvsp[(6) - (9)].ValIDVal)); |
| CHECK_FOR_ERROR |
| SwitchInst *S = new SwitchInst(tmpVal, tmpBB, (yyvsp[(8) - (9)].JumpTable)->size()); |
| (yyval.TermInstVal) = S; |
| |
| std::vector<std::pair<Constant*,BasicBlock*> >::iterator I = (yyvsp[(8) - (9)].JumpTable)->begin(), |
| E = (yyvsp[(8) - (9)].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[(8) - (9)].JumpTable); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 274: |
| #line 2567 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| Value* tmpVal = getVal((yyvsp[(2) - (8)].PrimType), (yyvsp[(3) - (8)].ValIDVal)); |
| CHECK_FOR_ERROR |
| BasicBlock* tmpBB = getBBVal((yyvsp[(6) - (8)].ValIDVal)); |
| CHECK_FOR_ERROR |
| SwitchInst *S = new SwitchInst(tmpVal, tmpBB, 0); |
| (yyval.TermInstVal) = S; |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 275: |
| #line 2577 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| |
| // Handle the short syntax |
| const PointerType *PFTy = 0; |
| const FunctionType *Ty = 0; |
| if (!(PFTy = dyn_cast<PointerType>((yyvsp[(3) - (14)].TypeVal)->get())) || |
| !(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) { |
| // Pull out the types of all of the arguments... |
| std::vector<const Type*> ParamTypes; |
| ParamList::iterator I = (yyvsp[(6) - (14)].ParamList)->begin(), E = (yyvsp[(6) - (14)].ParamList)->end(); |
| for (; I != E; ++I) { |
| const Type *Ty = I->Val->getType(); |
| if (Ty == Type::VoidTy) |
| GEN_ERROR("Short call syntax cannot be used with varargs"); |
| ParamTypes.push_back(Ty); |
| } |
| Ty = FunctionType::get((yyvsp[(3) - (14)].TypeVal)->get(), ParamTypes, false); |
| PFTy = PointerType::get(Ty); |
| } |
| |
| delete (yyvsp[(3) - (14)].TypeVal); |
| |
| Value *V = getVal(PFTy, (yyvsp[(4) - (14)].ValIDVal)); // Get the function we're calling... |
| CHECK_FOR_ERROR |
| BasicBlock *Normal = getBBVal((yyvsp[(11) - (14)].ValIDVal)); |
| CHECK_FOR_ERROR |
| BasicBlock *Except = getBBVal((yyvsp[(14) - (14)].ValIDVal)); |
| CHECK_FOR_ERROR |
| |
| ParamAttrsVector Attrs; |
| if ((yyvsp[(8) - (14)].ParamAttrs) != ParamAttr::None) { |
| ParamAttrsWithIndex PAWI; PAWI.index = 0; PAWI.attrs = (yyvsp[(8) - (14)].ParamAttrs); |
| Attrs.push_back(PAWI); |
| } |
| |
| // Check the arguments |
| ValueList Args; |
| if ((yyvsp[(6) - (14)].ParamList)->empty()) { // Has no arguments? |
| // Make sure no arguments is a good thing! |
| if (Ty->getNumParams() != 0) |
| GEN_ERROR("No arguments passed to a function that " |
| "expects arguments"); |
| } else { // Has arguments? |
| // Loop through FunctionType's arguments and ensure they are specified |
| // correctly! |
| FunctionType::param_iterator I = Ty->param_begin(); |
| FunctionType::param_iterator E = Ty->param_end(); |
| ParamList::iterator ArgI = (yyvsp[(6) - (14)].ParamList)->begin(), ArgE = (yyvsp[(6) - (14)].ParamList)->end(); |
| unsigned index = 1; |
| |
| for (; ArgI != ArgE && I != E; ++ArgI, ++I, ++index) { |
| if (ArgI->Val->getType() != *I) |
| GEN_ERROR("Parameter " + ArgI->Val->getName()+ " is not of type '" + |
| (*I)->getDescription() + "'"); |
| Args.push_back(ArgI->Val); |
| if (ArgI->Attrs != ParamAttr::None) { |
| ParamAttrsWithIndex PAWI; |
| PAWI.index = index; |
| PAWI.attrs = ArgI->Attrs; |
| Attrs.push_back(PAWI); |
| } |
| } |
| |
| if (Ty->isVarArg()) { |
| if (I == E) |
| for (; ArgI != ArgE; ++ArgI) |
| Args.push_back(ArgI->Val); // push the remaining varargs |
| } else if (I != E || ArgI != ArgE) |
| GEN_ERROR("Invalid number of parameters detected"); |
| } |
| |
| const ParamAttrsList *PAL = 0; |
| if (!Attrs.empty()) |
| PAL = ParamAttrsList::get(Attrs); |
| |
| // Create the InvokeInst |
| InvokeInst *II = new InvokeInst(V, Normal, Except, Args.begin(), Args.end()); |
| II->setCallingConv((yyvsp[(2) - (14)].UIntVal)); |
| II->setParamAttrs(PAL); |
| (yyval.TermInstVal) = II; |
| delete (yyvsp[(6) - (14)].ParamList); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 276: |
| #line 2660 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.TermInstVal) = new UnwindInst(); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 277: |
| #line 2664 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.TermInstVal) = new UnreachableInst(); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 278: |
| #line 2671 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.JumpTable) = (yyvsp[(1) - (6)].JumpTable); |
| Constant *V = cast<Constant>(getExistingVal((yyvsp[(2) - (6)].PrimType), (yyvsp[(3) - (6)].ValIDVal))); |
| CHECK_FOR_ERROR |
| if (V == 0) |
| GEN_ERROR("May only switch on a constant pool value"); |
| |
| BasicBlock* tmpBB = getBBVal((yyvsp[(6) - (6)].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyval.JumpTable)->push_back(std::make_pair(V, tmpBB)); |
| ;} |
| break; |
| |
| case 279: |
| #line 2682 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.JumpTable) = new std::vector<std::pair<Constant*, BasicBlock*> >(); |
| Constant *V = cast<Constant>(getExistingVal((yyvsp[(1) - (5)].PrimType), (yyvsp[(2) - (5)].ValIDVal))); |
| CHECK_FOR_ERROR |
| |
| if (V == 0) |
| GEN_ERROR("May only switch on a constant pool value"); |
| |
| BasicBlock* tmpBB = getBBVal((yyvsp[(5) - (5)].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyval.JumpTable)->push_back(std::make_pair(V, tmpBB)); |
| ;} |
| break; |
| |
| case 280: |
| #line 2695 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| // Is this definition named?? if so, assign the name... |
| setValueName((yyvsp[(2) - (2)].InstVal), (yyvsp[(1) - (2)].StrVal)); |
| CHECK_FOR_ERROR |
| InsertValue((yyvsp[(2) - (2)].InstVal)); |
| (yyval.InstVal) = (yyvsp[(2) - (2)].InstVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 281: |
| #line 2705 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { // Used for PHI nodes |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[(1) - (6)].TypeVal))->getDescription()); |
| (yyval.PHIList) = new std::list<std::pair<Value*, BasicBlock*> >(); |
| Value* tmpVal = getVal(*(yyvsp[(1) - (6)].TypeVal), (yyvsp[(3) - (6)].ValIDVal)); |
| CHECK_FOR_ERROR |
| BasicBlock* tmpBB = getBBVal((yyvsp[(5) - (6)].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyval.PHIList)->push_back(std::make_pair(tmpVal, tmpBB)); |
| delete (yyvsp[(1) - (6)].TypeVal); |
| ;} |
| break; |
| |
| case 282: |
| #line 2716 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.PHIList) = (yyvsp[(1) - (7)].PHIList); |
| Value* tmpVal = getVal((yyvsp[(1) - (7)].PHIList)->front().first->getType(), (yyvsp[(4) - (7)].ValIDVal)); |
| CHECK_FOR_ERROR |
| BasicBlock* tmpBB = getBBVal((yyvsp[(6) - (7)].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyvsp[(1) - (7)].PHIList)->push_back(std::make_pair(tmpVal, tmpBB)); |
| ;} |
| break; |
| |
| case 283: |
| #line 2726 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| // FIXME: Remove trailing OptParamAttrs in LLVM 3.0, it was a mistake in 2.0 |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[(1) - (4)].TypeVal))->getDescription()); |
| // Used for call and invoke instructions |
| (yyval.ParamList) = new ParamList(); |
| ParamListEntry E; E.Attrs = (yyvsp[(2) - (4)].ParamAttrs) | (yyvsp[(4) - (4)].ParamAttrs); E.Val = getVal((yyvsp[(1) - (4)].TypeVal)->get(), (yyvsp[(3) - (4)].ValIDVal)); |
| (yyval.ParamList)->push_back(E); |
| delete (yyvsp[(1) - (4)].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 284: |
| #line 2737 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| // FIXME: Remove trailing OptParamAttrs in LLVM 3.0, it was a mistake in 2.0 |
| // Labels are only valid in ASMs |
| (yyval.ParamList) = new ParamList(); |
| ParamListEntry E; E.Attrs = (yyvsp[(2) - (4)].ParamAttrs) | (yyvsp[(4) - (4)].ParamAttrs); E.Val = getBBVal((yyvsp[(3) - (4)].ValIDVal)); |
| (yyval.ParamList)->push_back(E); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 285: |
| #line 2745 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| // FIXME: Remove trailing OptParamAttrs in LLVM 3.0, it was a mistake in 2.0 |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[(3) - (6)].TypeVal))->getDescription()); |
| (yyval.ParamList) = (yyvsp[(1) - (6)].ParamList); |
| ParamListEntry E; E.Attrs = (yyvsp[(4) - (6)].ParamAttrs) | (yyvsp[(6) - (6)].ParamAttrs); E.Val = getVal((yyvsp[(3) - (6)].TypeVal)->get(), (yyvsp[(5) - (6)].ValIDVal)); |
| (yyval.ParamList)->push_back(E); |
| delete (yyvsp[(3) - (6)].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 286: |
| #line 2755 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| // FIXME: Remove trailing OptParamAttrs in LLVM 3.0, it was a mistake in 2.0 |
| (yyval.ParamList) = (yyvsp[(1) - (6)].ParamList); |
| ParamListEntry E; E.Attrs = (yyvsp[(4) - (6)].ParamAttrs) | (yyvsp[(6) - (6)].ParamAttrs); E.Val = getBBVal((yyvsp[(5) - (6)].ValIDVal)); |
| (yyval.ParamList)->push_back(E); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 287: |
| #line 2762 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.ParamList) = new ParamList(); ;} |
| break; |
| |
| case 288: |
| #line 2765 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.ValueList) = new std::vector<Value*>(); ;} |
| break; |
| |
| case 289: |
| #line 2766 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ValueList) = (yyvsp[(1) - (3)].ValueList); |
| (yyval.ValueList)->push_back((yyvsp[(3) - (3)].ValueVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 290: |
| #line 2773 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.BoolVal) = true; |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 291: |
| #line 2777 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.BoolVal) = false; |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 292: |
| #line 2782 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[(2) - (5)].TypeVal))->getDescription()); |
| if (!(*(yyvsp[(2) - (5)].TypeVal))->isInteger() && !(*(yyvsp[(2) - (5)].TypeVal))->isFloatingPoint() && |
| !isa<VectorType>((*(yyvsp[(2) - (5)].TypeVal)).get())) |
| GEN_ERROR( |
| "Arithmetic operator requires integer, FP, or packed operands"); |
| Value* val1 = getVal(*(yyvsp[(2) - (5)].TypeVal), (yyvsp[(3) - (5)].ValIDVal)); |
| CHECK_FOR_ERROR |
| Value* val2 = getVal(*(yyvsp[(2) - (5)].TypeVal), (yyvsp[(5) - (5)].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyval.InstVal) = BinaryOperator::create((yyvsp[(1) - (5)].BinaryOpVal), val1, val2); |
| if ((yyval.InstVal) == 0) |
| GEN_ERROR("binary operator returned null"); |
| delete (yyvsp[(2) - (5)].TypeVal); |
| ;} |
| break; |
| |
| case 293: |
| #line 2798 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[(2) - (5)].TypeVal))->getDescription()); |
| if (!(*(yyvsp[(2) - (5)].TypeVal))->isInteger()) { |
| if (Instruction::isShift((yyvsp[(1) - (5)].BinaryOpVal)) || !isa<VectorType>((yyvsp[(2) - (5)].TypeVal)->get()) || |
| !cast<VectorType>((yyvsp[(2) - (5)].TypeVal)->get())->getElementType()->isInteger()) |
| GEN_ERROR("Logical operator requires integral operands"); |
| } |
| Value* tmpVal1 = getVal(*(yyvsp[(2) - (5)].TypeVal), (yyvsp[(3) - (5)].ValIDVal)); |
| CHECK_FOR_ERROR |
| Value* tmpVal2 = getVal(*(yyvsp[(2) - (5)].TypeVal), (yyvsp[(5) - (5)].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyval.InstVal) = BinaryOperator::create((yyvsp[(1) - (5)].BinaryOpVal), tmpVal1, tmpVal2); |
| if ((yyval.InstVal) == 0) |
| GEN_ERROR("binary operator returned null"); |
| delete (yyvsp[(2) - (5)].TypeVal); |
| ;} |
| break; |
| |
| case 294: |
| #line 2815 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[(3) - (6)].TypeVal))->getDescription()); |
| if (isa<VectorType>((*(yyvsp[(3) - (6)].TypeVal)).get())) |
| GEN_ERROR("Vector types not supported by icmp instruction"); |
| Value* tmpVal1 = getVal(*(yyvsp[(3) - (6)].TypeVal), (yyvsp[(4) - (6)].ValIDVal)); |
| CHECK_FOR_ERROR |
| Value* tmpVal2 = getVal(*(yyvsp[(3) - (6)].TypeVal), (yyvsp[(6) - (6)].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyval.InstVal) = CmpInst::create((yyvsp[(1) - (6)].OtherOpVal), (yyvsp[(2) - (6)].IPredicate), tmpVal1, tmpVal2); |
| if ((yyval.InstVal) == 0) |
| GEN_ERROR("icmp operator returned null"); |
| delete (yyvsp[(3) - (6)].TypeVal); |
| ;} |
| break; |
| |
| case 295: |
| #line 2829 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[(3) - (6)].TypeVal))->getDescription()); |
| if (isa<VectorType>((*(yyvsp[(3) - (6)].TypeVal)).get())) |
| GEN_ERROR("Vector types not supported by fcmp instruction"); |
| Value* tmpVal1 = getVal(*(yyvsp[(3) - (6)].TypeVal), (yyvsp[(4) - (6)].ValIDVal)); |
| CHECK_FOR_ERROR |
| Value* tmpVal2 = getVal(*(yyvsp[(3) - (6)].TypeVal), (yyvsp[(6) - (6)].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyval.InstVal) = CmpInst::create((yyvsp[(1) - (6)].OtherOpVal), (yyvsp[(2) - (6)].FPredicate), tmpVal1, tmpVal2); |
| if ((yyval.InstVal) == 0) |
| GEN_ERROR("fcmp operator returned null"); |
| delete (yyvsp[(3) - (6)].TypeVal); |
| ;} |
| break; |
| |
| case 296: |
| #line 2843 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[(4) - (4)].TypeVal))->getDescription()); |
| Value* Val = (yyvsp[(2) - (4)].ValueVal); |
| const Type* DestTy = (yyvsp[(4) - (4)].TypeVal)->get(); |
| if (!CastInst::castIsValid((yyvsp[(1) - (4)].CastOpVal), Val, DestTy)) |
| GEN_ERROR("invalid cast opcode for cast from '" + |
| Val->getType()->getDescription() + "' to '" + |
| DestTy->getDescription() + "'"); |
| (yyval.InstVal) = CastInst::create((yyvsp[(1) - (4)].CastOpVal), Val, DestTy); |
| delete (yyvsp[(4) - (4)].TypeVal); |
| ;} |
| break; |
| |
| case 297: |
| #line 2855 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if ((yyvsp[(2) - (6)].ValueVal)->getType() != Type::Int1Ty) |
| GEN_ERROR("select condition must be boolean"); |
| if ((yyvsp[(4) - (6)].ValueVal)->getType() != (yyvsp[(6) - (6)].ValueVal)->getType()) |
| GEN_ERROR("select value types should match"); |
| (yyval.InstVal) = new SelectInst((yyvsp[(2) - (6)].ValueVal), (yyvsp[(4) - (6)].ValueVal), (yyvsp[(6) - (6)].ValueVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 298: |
| #line 2863 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[(4) - (4)].TypeVal))->getDescription()); |
| (yyval.InstVal) = new VAArgInst((yyvsp[(2) - (4)].ValueVal), *(yyvsp[(4) - (4)].TypeVal)); |
| delete (yyvsp[(4) - (4)].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 299: |
| #line 2870 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!ExtractElementInst::isValidOperands((yyvsp[(2) - (4)].ValueVal), (yyvsp[(4) - (4)].ValueVal))) |
| GEN_ERROR("Invalid extractelement operands"); |
| (yyval.InstVal) = new ExtractElementInst((yyvsp[(2) - (4)].ValueVal), (yyvsp[(4) - (4)].ValueVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 300: |
| #line 2876 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!InsertElementInst::isValidOperands((yyvsp[(2) - (6)].ValueVal), (yyvsp[(4) - (6)].ValueVal), (yyvsp[(6) - (6)].ValueVal))) |
| GEN_ERROR("Invalid insertelement operands"); |
| (yyval.InstVal) = new InsertElementInst((yyvsp[(2) - (6)].ValueVal), (yyvsp[(4) - (6)].ValueVal), (yyvsp[(6) - (6)].ValueVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 301: |
| #line 2882 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!ShuffleVectorInst::isValidOperands((yyvsp[(2) - (6)].ValueVal), (yyvsp[(4) - (6)].ValueVal), (yyvsp[(6) - (6)].ValueVal))) |
| GEN_ERROR("Invalid shufflevector operands"); |
| (yyval.InstVal) = new ShuffleVectorInst((yyvsp[(2) - (6)].ValueVal), (yyvsp[(4) - (6)].ValueVal), (yyvsp[(6) - (6)].ValueVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 302: |
| #line 2888 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| const Type *Ty = (yyvsp[(2) - (2)].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[(2) - (2)].PHIList)->size()); |
| while ((yyvsp[(2) - (2)].PHIList)->begin() != (yyvsp[(2) - (2)].PHIList)->end()) { |
| if ((yyvsp[(2) - (2)].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[(2) - (2)].PHIList)->front().first, (yyvsp[(2) - (2)].PHIList)->front().second); |
| (yyvsp[(2) - (2)].PHIList)->pop_front(); |
| } |
| delete (yyvsp[(2) - (2)].PHIList); // Free the list... |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 303: |
| #line 2904 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| |
| // Handle the short syntax |
| const PointerType *PFTy = 0; |
| const FunctionType *Ty = 0; |
| if (!(PFTy = dyn_cast<PointerType>((yyvsp[(3) - (8)].TypeVal)->get())) || |
| !(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) { |
| // Pull out the types of all of the arguments... |
| std::vector<const Type*> ParamTypes; |
| ParamList::iterator I = (yyvsp[(6) - (8)].ParamList)->begin(), E = (yyvsp[(6) - (8)].ParamList)->end(); |
| for (; I != E; ++I) { |
| const Type *Ty = I->Val->getType(); |
| if (Ty == Type::VoidTy) |
| GEN_ERROR("Short call syntax cannot be used with varargs"); |
| ParamTypes.push_back(Ty); |
| } |
| Ty = FunctionType::get((yyvsp[(3) - (8)].TypeVal)->get(), ParamTypes, false); |
| PFTy = PointerType::get(Ty); |
| } |
| |
| Value *V = getVal(PFTy, (yyvsp[(4) - (8)].ValIDVal)); // Get the function we're calling... |
| CHECK_FOR_ERROR |
| |
| // Check for call to invalid intrinsic to avoid crashing later. |
| if (Function *theF = dyn_cast<Function>(V)) { |
| if (theF->hasName() && (theF->getValueName()->getKeyLength() >= 5) && |
| (0 == strncmp(theF->getValueName()->getKeyData(), "llvm.", 5)) && |
| !theF->getIntrinsicID(true)) |
| GEN_ERROR("Call to invalid LLVM intrinsic function '" + |
| theF->getName() + "'"); |
| } |
| |
| // Set up the ParamAttrs for the function |
| ParamAttrsVector Attrs; |
| if ((yyvsp[(8) - (8)].ParamAttrs) != ParamAttr::None) { |
| ParamAttrsWithIndex PAWI; |
| PAWI.index = 0; |
| PAWI.attrs = (yyvsp[(8) - (8)].ParamAttrs); |
| Attrs.push_back(PAWI); |
| } |
| // Check the arguments |
| ValueList Args; |
| if ((yyvsp[(6) - (8)].ParamList)->empty()) { // Has no arguments? |
| // Make sure no arguments is a good thing! |
| if (Ty->getNumParams() != 0) |
| GEN_ERROR("No arguments passed to a function that " |
| "expects arguments"); |
| } else { // Has arguments? |
| // Loop through FunctionType's arguments and ensure they are specified |
| // correctly. Also, gather any parameter attributes. |
| FunctionType::param_iterator I = Ty->param_begin(); |
| FunctionType::param_iterator E = Ty->param_end(); |
| ParamList::iterator ArgI = (yyvsp[(6) - (8)].ParamList)->begin(), ArgE = (yyvsp[(6) - (8)].ParamList)->end(); |
| unsigned index = 1; |
| |
| for (; ArgI != ArgE && I != E; ++ArgI, ++I, ++index) { |
| if (ArgI->Val->getType() != *I) |
| GEN_ERROR("Parameter " + ArgI->Val->getName()+ " is not of type '" + |
| (*I)->getDescription() + "'"); |
| Args.push_back(ArgI->Val); |
| if (ArgI->Attrs != ParamAttr::None) { |
| ParamAttrsWithIndex PAWI; |
| PAWI.index = index; |
| PAWI.attrs = ArgI->Attrs; |
| Attrs.push_back(PAWI); |
| } |
| } |
| if (Ty->isVarArg()) { |
| if (I == E) |
| for (; ArgI != ArgE; ++ArgI) |
| Args.push_back(ArgI->Val); // push the remaining varargs |
| } else if (I != E || ArgI != ArgE) |
| GEN_ERROR("Invalid number of parameters detected"); |
| } |
| |
| // Finish off the ParamAttrs and check them |
| const ParamAttrsList *PAL = 0; |
| if (!Attrs.empty()) |
| PAL = ParamAttrsList::get(Attrs); |
| |
| // Create the call node |
| CallInst *CI = new CallInst(V, Args.begin(), Args.end()); |
| CI->setTailCall((yyvsp[(1) - (8)].BoolVal)); |
| CI->setCallingConv((yyvsp[(2) - (8)].UIntVal)); |
| CI->setParamAttrs(PAL); |
| (yyval.InstVal) = CI; |
| delete (yyvsp[(6) - (8)].ParamList); |
| delete (yyvsp[(3) - (8)].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 304: |
| #line 2994 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.InstVal) = (yyvsp[(1) - (1)].InstVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 305: |
| #line 2999 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.BoolVal) = true; |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 306: |
| #line 3003 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.BoolVal) = false; |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 307: |
| #line 3010 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[(2) - (3)].TypeVal))->getDescription()); |
| (yyval.InstVal) = new MallocInst(*(yyvsp[(2) - (3)].TypeVal), 0, (yyvsp[(3) - (3)].UIntVal)); |
| delete (yyvsp[(2) - (3)].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 308: |
| #line 3017 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[(2) - (6)].TypeVal))->getDescription()); |
| Value* tmpVal = getVal((yyvsp[(4) - (6)].PrimType), (yyvsp[(5) - (6)].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyval.InstVal) = new MallocInst(*(yyvsp[(2) - (6)].TypeVal), tmpVal, (yyvsp[(6) - (6)].UIntVal)); |
| delete (yyvsp[(2) - (6)].TypeVal); |
| ;} |
| break; |
| |
| case 309: |
| #line 3025 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[(2) - (3)].TypeVal))->getDescription()); |
| (yyval.InstVal) = new AllocaInst(*(yyvsp[(2) - (3)].TypeVal), 0, (yyvsp[(3) - (3)].UIntVal)); |
| delete (yyvsp[(2) - (3)].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 310: |
| #line 3032 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[(2) - (6)].TypeVal))->getDescription()); |
| Value* tmpVal = getVal((yyvsp[(4) - (6)].PrimType), (yyvsp[(5) - (6)].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyval.InstVal) = new AllocaInst(*(yyvsp[(2) - (6)].TypeVal), tmpVal, (yyvsp[(6) - (6)].UIntVal)); |
| delete (yyvsp[(2) - (6)].TypeVal); |
| ;} |
| break; |
| |
| case 311: |
| #line 3040 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!isa<PointerType>((yyvsp[(2) - (2)].ValueVal)->getType())) |
| GEN_ERROR("Trying to free nonpointer type " + |
| (yyvsp[(2) - (2)].ValueVal)->getType()->getDescription() + ""); |
| (yyval.InstVal) = new FreeInst((yyvsp[(2) - (2)].ValueVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 312: |
| #line 3048 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[(3) - (5)].TypeVal))->getDescription()); |
| if (!isa<PointerType>((yyvsp[(3) - (5)].TypeVal)->get())) |
| GEN_ERROR("Can't load from nonpointer type: " + |
| (*(yyvsp[(3) - (5)].TypeVal))->getDescription()); |
| if (!cast<PointerType>((yyvsp[(3) - (5)].TypeVal)->get())->getElementType()->isFirstClassType()) |
| GEN_ERROR("Can't load from pointer of non-first-class type: " + |
| (*(yyvsp[(3) - (5)].TypeVal))->getDescription()); |
| Value* tmpVal = getVal(*(yyvsp[(3) - (5)].TypeVal), (yyvsp[(4) - (5)].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyval.InstVal) = new LoadInst(tmpVal, "", (yyvsp[(1) - (5)].BoolVal), (yyvsp[(5) - (5)].UIntVal)); |
| delete (yyvsp[(3) - (5)].TypeVal); |
| ;} |
| break; |
| |
| case 313: |
| #line 3062 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[(5) - (7)].TypeVal))->getDescription()); |
| const PointerType *PT = dyn_cast<PointerType>((yyvsp[(5) - (7)].TypeVal)->get()); |
| if (!PT) |
| GEN_ERROR("Can't store to a nonpointer type: " + |
| (*(yyvsp[(5) - (7)].TypeVal))->getDescription()); |
| const Type *ElTy = PT->getElementType(); |
| if (ElTy != (yyvsp[(3) - (7)].ValueVal)->getType()) |
| GEN_ERROR("Can't store '" + (yyvsp[(3) - (7)].ValueVal)->getType()->getDescription() + |
| "' into space of type '" + ElTy->getDescription() + "'"); |
| |
| Value* tmpVal = getVal(*(yyvsp[(5) - (7)].TypeVal), (yyvsp[(6) - (7)].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyval.InstVal) = new StoreInst((yyvsp[(3) - (7)].ValueVal), tmpVal, (yyvsp[(1) - (7)].BoolVal), (yyvsp[(7) - (7)].UIntVal)); |
| delete (yyvsp[(5) - (7)].TypeVal); |
| ;} |
| break; |
| |
| case 314: |
| #line 3079 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[(2) - (4)].TypeVal))->getDescription()); |
| if (!isa<PointerType>((yyvsp[(2) - (4)].TypeVal)->get())) |
| GEN_ERROR("getelementptr insn requires pointer operand"); |
| |
| if (!GetElementPtrInst::getIndexedType(*(yyvsp[(2) - (4)].TypeVal), (yyvsp[(4) - (4)].ValueList)->begin(), (yyvsp[(4) - (4)].ValueList)->end(), true)) |
| GEN_ERROR("Invalid getelementptr indices for type '" + |
| (*(yyvsp[(2) - (4)].TypeVal))->getDescription()+ "'"); |
| Value* tmpVal = getVal(*(yyvsp[(2) - (4)].TypeVal), (yyvsp[(3) - (4)].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyval.InstVal) = new GetElementPtrInst(tmpVal, (yyvsp[(4) - (4)].ValueList)->begin(), (yyvsp[(4) - (4)].ValueList)->end()); |
| delete (yyvsp[(2) - (4)].TypeVal); |
| delete (yyvsp[(4) - (4)].ValueList); |
| ;} |
| break; |
| |
| |
| /* Line 1267 of yacc.c. */ |
| #line 6255 "llvmAsmParser.tab.c" |
| default: break; |
| } |
| YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc); |
| |
| YYPOPSTACK (yylen); |
| yylen = 0; |
| 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 |
| yyerror (YY_("syntax error")); |
| #else |
| { |
| YYSIZE_T yysize = yysyntax_error (0, yystate, yychar); |
| if (yymsg_alloc < yysize && yymsg_alloc < YYSTACK_ALLOC_MAXIMUM) |
| { |
| YYSIZE_T yyalloc = 2 * yysize; |
| if (! (yysize <= yyalloc && yyalloc <= YYSTACK_ALLOC_MAXIMUM)) |
| yyalloc = YYSTACK_ALLOC_MAXIMUM; |
| if (yymsg != yymsgbuf) |
| YYSTACK_FREE (yymsg); |
| yymsg = (char *) YYSTACK_ALLOC (yyalloc); |
| if (yymsg) |
| yymsg_alloc = yyalloc; |
| else |
| { |
| yymsg = yymsgbuf; |
| yymsg_alloc = sizeof yymsgbuf; |
| } |
| } |
| |
| if (0 < yysize && yysize <= yymsg_alloc) |
| { |
| (void) yysyntax_error (yymsg, yystate, yychar); |
| yyerror (yymsg); |
| } |
| else |
| { |
| yyerror (YY_("syntax error")); |
| if (yysize != 0) |
| goto yyexhaustedlab; |
| } |
| } |
| #endif |
| } |
| |
| |
| |
| 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 (/*CONSTCOND*/ 0) |
| goto yyerrorlab; |
| |
| /* Do not reclaim the symbols of the rule which action triggered |
| this YYERROR. */ |
| YYPOPSTACK (yylen); |
| yylen = 0; |
| YY_STACK_PRINT (yyss, yyssp); |
| 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 (1); |
| 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); |
| /* Do not reclaim the symbols of the rule which action triggered |
| this YYABORT or YYACCEPT. */ |
| YYPOPSTACK (yylen); |
| YY_STACK_PRINT (yyss, yyssp); |
| while (yyssp != yyss) |
| { |
| yydestruct ("Cleanup: popping", |
| yystos[*yyssp], yyvsp); |
| YYPOPSTACK (1); |
| } |
| #ifndef yyoverflow |
| if (yyss != yyssa) |
| YYSTACK_FREE (yyss); |
| #endif |
| #if YYERROR_VERBOSE |
| if (yymsg != yymsgbuf) |
| YYSTACK_FREE (yymsg); |
| #endif |
| /* Make sure YYID is used. */ |
| return YYID (yyresult); |
| } |
| |
| |
| #line 3096 "/home/duncan/LLVM/llvm.top/llvm/lib/AsmParser/llvmAsmParser.y" |
| |
| |
| // common code from the two 'RunVMAsmParser' functions |
| static Module* RunParser(Module * M) { |
| CurModule.CurrentModule = M; |
| // Check to make sure the parser succeeded |
| if (yyparse()) { |
| if (ParserResult) |
| delete ParserResult; |
| return 0; |
| } |
| |
| // Emit an error if there are any unresolved types left. |
| if (!CurModule.LateResolveTypes.empty()) { |
| const ValID &DID = CurModule.LateResolveTypes.begin()->first; |
| if (DID.Type == ValID::LocalName) { |
| GenerateError("Undefined type remains at eof: '"+DID.getName() + "'"); |
| } else { |
| GenerateError("Undefined type remains at eof: #" + itostr(DID.Num)); |
| } |
| if (ParserResult) |
| delete ParserResult; |
| return 0; |
| } |
| |
| // Emit an error if there are any unresolved values left. |
| if (!CurModule.LateResolveValues.empty()) { |
| Value *V = CurModule.LateResolveValues.back(); |
| std::map<Value*, std::pair<ValID, int> >::iterator I = |
| CurModule.PlaceHolderInfo.find(V); |
| |
| if (I != CurModule.PlaceHolderInfo.end()) { |
| ValID &DID = I->second.first; |
| if (DID.Type == ValID::LocalName) { |
| GenerateError("Undefined value remains at eof: "+DID.getName() + "'"); |
| } else { |
| GenerateError("Undefined value remains at eof: #" + itostr(DID.Num)); |
| } |
| if (ParserResult) |
| delete ParserResult; |
| return 0; |
| } |
| } |
| |
| // Check to make sure that parsing produced a result |
| if (!ParserResult) |
| return 0; |
| |
| // Reset ParserResult variable while saving its value for the result. |
| Module *Result = ParserResult; |
| ParserResult = 0; |
| |
| return Result; |
| } |
| |
| void llvm::GenerateError(const std::string &message, int LineNo) { |
| if (LineNo == -1) LineNo = LLLgetLineNo(); |
| // TODO: column number in exception |
| if (TheParseError) |
| TheParseError->setError(LLLgetFilename(), message, LineNo); |
| TriggerError = 1; |
| } |
| |
| int yyerror(const char *ErrorMsg) { |
| std::string where = LLLgetFilename() + ":" + utostr(LLLgetLineNo()) + ": "; |
| std::string errMsg = where + "error: " + std::string(ErrorMsg); |
| if (yychar != YYEMPTY && yychar != 0) { |
| errMsg += " while reading token: '"; |
| errMsg += std::string(LLLgetTokenStart(), |
| LLLgetTokenStart()+LLLgetTokenLength()) + "'"; |
| } |
| GenerateError(errMsg); |
| return 0; |
| } |
| |