| /* A Bison parser, made by GNU Bison 2.1. */ |
| |
| /* Skeleton parser for Yacc-like parsing with Bison, |
| Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc. |
| |
| This program is free software; you can redistribute it and/or modify |
| it under the terms of the GNU General Public License as published by |
| the Free Software Foundation; either version 2, or (at your option) |
| any later version. |
| |
| This program is distributed in the hope that it will be useful, |
| but WITHOUT ANY WARRANTY; without even the implied warranty of |
| MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| GNU General Public License for more details. |
| |
| You should have received a copy of the GNU General Public License |
| along with this program; if not, write to the Free Software |
| Foundation, Inc., 51 Franklin Street, Fifth Floor, |
| Boston, MA 02110-1301, USA. */ |
| |
| /* As a special exception, when this file is copied by Bison into a |
| Bison output file, you may use that output file without restriction. |
| This special exception was added by the Free Software Foundation |
| in version 1.24 of Bison. */ |
| |
| /* Written by Richard Stallman by simplifying the original so called |
| ``semantic'' parser. */ |
| |
| /* All symbols defined below should begin with yy or YY, to avoid |
| infringing on user name space. This should be done even for local |
| variables, as they might otherwise be expanded by user macros. |
| There are some unavoidable exceptions within include files to |
| define necessary library symbols; they are noted "INFRINGES ON |
| USER NAME SPACE" below. */ |
| |
| /* Identify Bison output. */ |
| #define YYBISON 1 |
| |
| /* Bison version. */ |
| #define YYBISON_VERSION "2.1" |
| |
| /* Skeleton name. */ |
| #define YYSKELETON_NAME "yacc.c" |
| |
| /* Pure parsers. */ |
| #define YYPURE 0 |
| |
| /* Using locations. */ |
| #define YYLSP_NEEDED 0 |
| |
| /* Substitute the variable and function names. */ |
| #define yyparse llvmAsmparse |
| #define yylex llvmAsmlex |
| #define yyerror llvmAsmerror |
| #define yylval llvmAsmlval |
| #define yychar llvmAsmchar |
| #define yydebug llvmAsmdebug |
| #define yynerrs llvmAsmnerrs |
| |
| |
| /* Tokens. */ |
| #ifndef YYTOKENTYPE |
| # define YYTOKENTYPE |
| /* Put the tokens into the symbol table, so that GDB and other debuggers |
| know about them. */ |
| enum yytokentype { |
| ESINT64VAL = 258, |
| EUINT64VAL = 259, |
| SINTVAL = 260, |
| UINTVAL = 261, |
| FPVAL = 262, |
| VOID = 263, |
| BOOL = 264, |
| INT8 = 265, |
| INT16 = 266, |
| INT32 = 267, |
| INT64 = 268, |
| FLOAT = 269, |
| DOUBLE = 270, |
| LABEL = 271, |
| TYPE = 272, |
| VAR_ID = 273, |
| LABELSTR = 274, |
| STRINGCONSTANT = 275, |
| IMPLEMENTATION = 276, |
| ZEROINITIALIZER = 277, |
| TRUETOK = 278, |
| FALSETOK = 279, |
| BEGINTOK = 280, |
| ENDTOK = 281, |
| DECLARE = 282, |
| DEFINE = 283, |
| GLOBAL = 284, |
| CONSTANT = 285, |
| SECTION = 286, |
| VOLATILE = 287, |
| TO = 288, |
| DOTDOTDOT = 289, |
| NULL_TOK = 290, |
| UNDEF = 291, |
| INTERNAL = 292, |
| LINKONCE = 293, |
| WEAK = 294, |
| APPENDING = 295, |
| DLLIMPORT = 296, |
| DLLEXPORT = 297, |
| EXTERN_WEAK = 298, |
| OPAQUE = 299, |
| NOT = 300, |
| EXTERNAL = 301, |
| TARGET = 302, |
| TRIPLE = 303, |
| ENDIAN = 304, |
| POINTERSIZE = 305, |
| LITTLE = 306, |
| BIG = 307, |
| ALIGN = 308, |
| DEPLIBS = 309, |
| CALL = 310, |
| TAIL = 311, |
| ASM_TOK = 312, |
| MODULE = 313, |
| SIDEEFFECT = 314, |
| CC_TOK = 315, |
| CCC_TOK = 316, |
| CSRETCC_TOK = 317, |
| FASTCC_TOK = 318, |
| COLDCC_TOK = 319, |
| X86_STDCALLCC_TOK = 320, |
| X86_FASTCALLCC_TOK = 321, |
| DATALAYOUT = 322, |
| RET = 323, |
| BR = 324, |
| SWITCH = 325, |
| INVOKE = 326, |
| UNWIND = 327, |
| UNREACHABLE = 328, |
| ADD = 329, |
| SUB = 330, |
| MUL = 331, |
| UDIV = 332, |
| SDIV = 333, |
| FDIV = 334, |
| UREM = 335, |
| SREM = 336, |
| FREM = 337, |
| AND = 338, |
| OR = 339, |
| XOR = 340, |
| ICMP = 341, |
| FCMP = 342, |
| EQ = 343, |
| NE = 344, |
| SLT = 345, |
| SGT = 346, |
| SLE = 347, |
| SGE = 348, |
| ULT = 349, |
| UGT = 350, |
| ULE = 351, |
| UGE = 352, |
| OEQ = 353, |
| ONE = 354, |
| OLT = 355, |
| OGT = 356, |
| OLE = 357, |
| OGE = 358, |
| ORD = 359, |
| UNO = 360, |
| UEQ = 361, |
| UNE = 362, |
| MALLOC = 363, |
| ALLOCA = 364, |
| FREE = 365, |
| LOAD = 366, |
| STORE = 367, |
| GETELEMENTPTR = 368, |
| TRUNC = 369, |
| ZEXT = 370, |
| SEXT = 371, |
| FPTRUNC = 372, |
| FPEXT = 373, |
| BITCAST = 374, |
| UITOFP = 375, |
| SITOFP = 376, |
| FPTOUI = 377, |
| FPTOSI = 378, |
| INTTOPTR = 379, |
| PTRTOINT = 380, |
| PHI_TOK = 381, |
| SELECT = 382, |
| SHL = 383, |
| LSHR = 384, |
| ASHR = 385, |
| VAARG = 386, |
| EXTRACTELEMENT = 387, |
| INSERTELEMENT = 388, |
| SHUFFLEVECTOR = 389, |
| NORETURN = 390 |
| }; |
| #endif |
| /* Tokens. */ |
| #define ESINT64VAL 258 |
| #define EUINT64VAL 259 |
| #define SINTVAL 260 |
| #define UINTVAL 261 |
| #define FPVAL 262 |
| #define VOID 263 |
| #define BOOL 264 |
| #define INT8 265 |
| #define INT16 266 |
| #define INT32 267 |
| #define INT64 268 |
| #define FLOAT 269 |
| #define DOUBLE 270 |
| #define LABEL 271 |
| #define TYPE 272 |
| #define VAR_ID 273 |
| #define LABELSTR 274 |
| #define STRINGCONSTANT 275 |
| #define IMPLEMENTATION 276 |
| #define ZEROINITIALIZER 277 |
| #define TRUETOK 278 |
| #define FALSETOK 279 |
| #define BEGINTOK 280 |
| #define ENDTOK 281 |
| #define DECLARE 282 |
| #define DEFINE 283 |
| #define GLOBAL 284 |
| #define CONSTANT 285 |
| #define SECTION 286 |
| #define VOLATILE 287 |
| #define TO 288 |
| #define DOTDOTDOT 289 |
| #define NULL_TOK 290 |
| #define UNDEF 291 |
| #define INTERNAL 292 |
| #define LINKONCE 293 |
| #define WEAK 294 |
| #define APPENDING 295 |
| #define DLLIMPORT 296 |
| #define DLLEXPORT 297 |
| #define EXTERN_WEAK 298 |
| #define OPAQUE 299 |
| #define NOT 300 |
| #define EXTERNAL 301 |
| #define TARGET 302 |
| #define TRIPLE 303 |
| #define ENDIAN 304 |
| #define POINTERSIZE 305 |
| #define LITTLE 306 |
| #define BIG 307 |
| #define ALIGN 308 |
| #define DEPLIBS 309 |
| #define CALL 310 |
| #define TAIL 311 |
| #define ASM_TOK 312 |
| #define MODULE 313 |
| #define SIDEEFFECT 314 |
| #define CC_TOK 315 |
| #define CCC_TOK 316 |
| #define CSRETCC_TOK 317 |
| #define FASTCC_TOK 318 |
| #define COLDCC_TOK 319 |
| #define X86_STDCALLCC_TOK 320 |
| #define X86_FASTCALLCC_TOK 321 |
| #define DATALAYOUT 322 |
| #define RET 323 |
| #define BR 324 |
| #define SWITCH 325 |
| #define INVOKE 326 |
| #define UNWIND 327 |
| #define UNREACHABLE 328 |
| #define ADD 329 |
| #define SUB 330 |
| #define MUL 331 |
| #define UDIV 332 |
| #define SDIV 333 |
| #define FDIV 334 |
| #define UREM 335 |
| #define SREM 336 |
| #define FREM 337 |
| #define AND 338 |
| #define OR 339 |
| #define XOR 340 |
| #define ICMP 341 |
| #define FCMP 342 |
| #define EQ 343 |
| #define NE 344 |
| #define SLT 345 |
| #define SGT 346 |
| #define SLE 347 |
| #define SGE 348 |
| #define ULT 349 |
| #define UGT 350 |
| #define ULE 351 |
| #define UGE 352 |
| #define OEQ 353 |
| #define ONE 354 |
| #define OLT 355 |
| #define OGT 356 |
| #define OLE 357 |
| #define OGE 358 |
| #define ORD 359 |
| #define UNO 360 |
| #define UEQ 361 |
| #define UNE 362 |
| #define MALLOC 363 |
| #define ALLOCA 364 |
| #define FREE 365 |
| #define LOAD 366 |
| #define STORE 367 |
| #define GETELEMENTPTR 368 |
| #define TRUNC 369 |
| #define ZEXT 370 |
| #define SEXT 371 |
| #define FPTRUNC 372 |
| #define FPEXT 373 |
| #define BITCAST 374 |
| #define UITOFP 375 |
| #define SITOFP 376 |
| #define FPTOUI 377 |
| #define FPTOSI 378 |
| #define INTTOPTR 379 |
| #define PTRTOINT 380 |
| #define PHI_TOK 381 |
| #define SELECT 382 |
| #define SHL 383 |
| #define LSHR 384 |
| #define ASHR 385 |
| #define VAARG 386 |
| #define EXTRACTELEMENT 387 |
| #define INSERTELEMENT 388 |
| #define SHUFFLEVECTOR 389 |
| #define NORETURN 390 |
| |
| |
| |
| |
| /* Copy the first part of user declarations. */ |
| #line 14 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| |
| #include "ParserInternals.h" |
| #include "llvm/CallingConv.h" |
| #include "llvm/InlineAsm.h" |
| #include "llvm/Instructions.h" |
| #include "llvm/Module.h" |
| #include "llvm/SymbolTable.h" |
| #include "llvm/Support/GetElementPtrTypeIterator.h" |
| #include "llvm/Support/CommandLine.h" |
| #include "llvm/ADT/STLExtras.h" |
| #include "llvm/Support/MathExtras.h" |
| #include "llvm/Support/Streams.h" |
| #include <algorithm> |
| #include <list> |
| #include <utility> |
| #ifndef NDEBUG |
| #define YYDEBUG 1 |
| #endif |
| |
| // The following is a gross hack. In order to rid the libAsmParser library of |
| // exceptions, we have to have a way of getting the yyparse function to go into |
| // an error situation. So, whenever we want an error to occur, the GenerateError |
| // function (see bottom of file) sets TriggerError. Then, at the end of each |
| // production in the grammer we use CHECK_FOR_ERROR which will invoke YYERROR |
| // (a goto) to put YACC in error state. Furthermore, several calls to |
| // GenerateError are made from inside productions and they must simulate the |
| // previous exception behavior by exiting the production immediately. We have |
| // replaced these with the GEN_ERROR macro which calls GeneratError and then |
| // immediately invokes YYERROR. This would be so much cleaner if it was a |
| // recursive descent parser. |
| static bool TriggerError = false; |
| #define CHECK_FOR_ERROR { if (TriggerError) { TriggerError = false; YYABORT; } } |
| #define GEN_ERROR(msg) { GenerateError(msg); YYERROR; } |
| |
| int yyerror(const char *ErrorMsg); // Forward declarations to prevent "implicit |
| int yylex(); // declaration" of xxx warnings. |
| int yyparse(); |
| |
| namespace llvm { |
| std::string CurFilename; |
| #if YYDEBUG |
| static cl::opt<bool> |
| Debug("debug-yacc", cl::desc("Print yacc debug state changes"), |
| cl::Hidden, cl::init(false)); |
| #endif |
| } |
| 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(std::map<const Type *,ValueList> &LateResolvers, |
| std::map<const Type *,ValueList> *FutureLateResolvers = 0); |
| |
| static struct PerModuleInfo { |
| Module *CurrentModule; |
| std::map<const Type *, ValueList> Values; // Module level numbered definitions |
| std::map<const Type *,ValueList> LateResolveValues; |
| std::vector<PATypeHolder> Types; |
| std::map<ValID, PATypeHolder> LateResolveTypes; |
| |
| /// PlaceHolderInfo - When temporary placeholder objects are created, remember |
| /// how they were referenced and on which line of the input they came from so |
| /// that we can resolve them later and print error messages as appropriate. |
| std::map<Value*, std::pair<ValID, int> > PlaceHolderInfo; |
| |
| // GlobalRefs - This maintains a mapping between <Type, ValID>'s and forward |
| // references to global values. Global values may be referenced before they |
| // are defined, and if so, the temporary object that they represent is held |
| // here. This is used for forward references of GlobalValues. |
| // |
| typedef std::map<std::pair<const PointerType *, |
| ValID>, GlobalValue*> GlobalRefsType; |
| GlobalRefsType GlobalRefs; |
| |
| void ModuleDone() { |
| // If we could not resolve some functions at function compilation time |
| // (calls to functions before they are defined), resolve them now... Types |
| // are resolved when the constant pool has been completely parsed. |
| // |
| ResolveDefinitions(LateResolveValues); |
| if (TriggerError) |
| return; |
| |
| // Check to make sure that all global value forward references have been |
| // resolved! |
| // |
| if (!GlobalRefs.empty()) { |
| std::string UndefinedReferences = "Unresolved global references exist:\n"; |
| |
| for (GlobalRefsType::iterator I = GlobalRefs.begin(), E =GlobalRefs.end(); |
| I != E; ++I) { |
| UndefinedReferences += " " + I->first.first->getDescription() + " " + |
| I->first.second.getName() + "\n"; |
| } |
| GenerateError(UndefinedReferences); |
| return; |
| } |
| |
| 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 |
| |
| std::map<const Type*, ValueList> Values; // Keep track of #'d definitions |
| std::map<const Type*, ValueList> LateResolveValues; |
| bool isDeclare; // Is this function a forward declararation? |
| GlobalValue::LinkageTypes Linkage; // Linkage for forward declaration. |
| |
| /// BBForwardRefs - When we see forward references to basic blocks, keep |
| /// track of them here. |
| std::map<BasicBlock*, std::pair<ValID, int> > BBForwardRefs; |
| std::vector<BasicBlock*> NumberedBlocks; |
| unsigned NextBBNum; |
| |
| inline PerFunctionInfo() { |
| CurrentFunction = 0; |
| isDeclare = false; |
| Linkage = GlobalValue::ExternalLinkage; |
| } |
| |
| inline void FunctionStart(Function *M) { |
| CurrentFunction = M; |
| NextBBNum = 0; |
| } |
| |
| void FunctionDone() { |
| NumberedBlocks.clear(); |
| |
| // Any forward referenced blocks left? |
| if (!BBForwardRefs.empty()) { |
| GenerateError("Undefined reference to label " + |
| BBForwardRefs.begin()->first->getName()); |
| return; |
| } |
| |
| // Resolve all forward references now. |
| ResolveDefinitions(LateResolveValues, &CurModule.LateResolveValues); |
| |
| Values.clear(); // Clear out function local definitions |
| CurrentFunction = 0; |
| isDeclare = false; |
| Linkage = GlobalValue::ExternalLinkage; |
| } |
| } CurFun; // Info for the current function... |
| |
| static bool inFunctionScope() { return CurFun.CurrentFunction != 0; } |
| |
| |
| //===----------------------------------------------------------------------===// |
| // Code to handle definitions of all the types |
| //===----------------------------------------------------------------------===// |
| |
| static int InsertValue(Value *V, |
| std::map<const Type*,ValueList> &ValueTab = CurFun.Values) { |
| if (V->hasName()) return -1; // Is this a numbered definition? |
| |
| // Yes, insert the value into the value table... |
| ValueList &List = ValueTab[V->getType()]; |
| List.push_back(V); |
| return List.size()-1; |
| } |
| |
| static const Type *getTypeVal(const ValID &D, bool DoNotImprovise = false) { |
| switch (D.Type) { |
| case ValID::NumberVal: // Is it a numbered definition? |
| // Module constants occupy the lowest numbered slots... |
| if ((unsigned)D.Num < CurModule.Types.size()) |
| return CurModule.Types[(unsigned)D.Num]; |
| break; |
| case ValID::NameVal: // Is it a named definition? |
| if (const Type *N = CurModule.CurrentModule->getTypeByName(D.Name)) { |
| D.destroy(); // Free old strdup'd memory... |
| return N; |
| } |
| break; |
| default: |
| GenerateError("Internal parser error: Invalid symbol type reference!"); |
| return 0; |
| } |
| |
| // If we reached here, we referenced either a symbol that we don't know about |
| // or an id number that hasn't been read yet. We may be referencing something |
| // forward, so just create an entry to be resolved later and get to it... |
| // |
| if (DoNotImprovise) return 0; // Do we just want a null to be returned? |
| |
| |
| if (inFunctionScope()) { |
| if (D.Type == ValID::NameVal) { |
| GenerateError("Reference to an undefined type: '" + D.getName() + "'"); |
| return 0; |
| } else { |
| GenerateError("Reference to an undefined type: #" + itostr(D.Num)); |
| return 0; |
| } |
| } |
| |
| std::map<ValID, PATypeHolder>::iterator I =CurModule.LateResolveTypes.find(D); |
| if (I != CurModule.LateResolveTypes.end()) |
| return I->second; |
| |
| Type *Typ = OpaqueType::get(); |
| CurModule.LateResolveTypes.insert(std::make_pair(D, Typ)); |
| return Typ; |
| } |
| |
| static Value *lookupInSymbolTable(const Type *Ty, const std::string &Name) { |
| SymbolTable &SymTab = |
| inFunctionScope() ? CurFun.CurrentFunction->getValueSymbolTable() : |
| CurModule.CurrentModule->getValueSymbolTable(); |
| return SymTab.lookup(Ty, Name); |
| } |
| |
| // getValNonImprovising - Look up the value specified by the provided type and |
| // the provided ValID. If the value exists and has already been defined, return |
| // it. Otherwise return null. |
| // |
| static Value *getValNonImprovising(const Type *Ty, const ValID &D) { |
| if (isa<FunctionType>(Ty)) { |
| GenerateError("Functions are not values and " |
| "must be referenced as pointers"); |
| return 0; |
| } |
| |
| switch (D.Type) { |
| case ValID::NumberVal: { // Is it a numbered definition? |
| unsigned Num = (unsigned)D.Num; |
| |
| // Module constants occupy the lowest numbered slots... |
| std::map<const Type*,ValueList>::iterator VI = CurModule.Values.find(Ty); |
| if (VI != CurModule.Values.end()) { |
| if (Num < VI->second.size()) |
| return VI->second[Num]; |
| Num -= VI->second.size(); |
| } |
| |
| // Make sure that our type is within bounds |
| VI = CurFun.Values.find(Ty); |
| if (VI == CurFun.Values.end()) return 0; |
| |
| // Check that the number is within bounds... |
| if (VI->second.size() <= Num) return 0; |
| |
| return VI->second[Num]; |
| } |
| |
| case ValID::NameVal: { // Is it a named definition? |
| Value *N = lookupInSymbolTable(Ty, std::string(D.Name)); |
| if (N == 0) return 0; |
| |
| D.destroy(); // Free old strdup'd memory... |
| return N; |
| } |
| |
| // Check to make sure that "Ty" is an integral type, and that our |
| // value will fit into the specified type... |
| case ValID::ConstSIntVal: // Is it a constant pool reference?? |
| if (!ConstantInt::isValueValidForType(Ty, D.ConstPool64)) { |
| GenerateError("Signed integral constant '" + |
| itostr(D.ConstPool64) + "' is invalid for type '" + |
| Ty->getDescription() + "'!"); |
| return 0; |
| } |
| return ConstantInt::get(Ty, D.ConstPool64); |
| |
| case ValID::ConstUIntVal: // Is it an unsigned const pool reference? |
| if (!ConstantInt::isValueValidForType(Ty, D.UConstPool64)) { |
| if (!ConstantInt::isValueValidForType(Ty, D.ConstPool64)) { |
| GenerateError("Integral constant '" + utostr(D.UConstPool64) + |
| "' is invalid or out of range!"); |
| return 0; |
| } else { // This is really a signed reference. Transmogrify. |
| return ConstantInt::get(Ty, D.ConstPool64); |
| } |
| } else { |
| return ConstantInt::get(Ty, D.UConstPool64); |
| } |
| |
| case ValID::ConstFPVal: // Is it a floating point const pool reference? |
| if (!ConstantFP::isValueValidForType(Ty, D.ConstPoolFP)) { |
| GenerateError("FP constant invalid for type!!"); |
| return 0; |
| } |
| return ConstantFP::get(Ty, D.ConstPoolFP); |
| |
| case ValID::ConstNullVal: // Is it a null value? |
| if (!isa<PointerType>(Ty)) { |
| GenerateError("Cannot create a a non pointer null!"); |
| return 0; |
| } |
| return ConstantPointerNull::get(cast<PointerType>(Ty)); |
| |
| case ValID::ConstUndefVal: // Is it an undef value? |
| return UndefValue::get(Ty); |
| |
| case ValID::ConstZeroVal: // Is it a zero value? |
| return Constant::getNullValue(Ty); |
| |
| case ValID::ConstantVal: // Fully resolved constant? |
| if (D.ConstantValue->getType() != Ty) { |
| GenerateError("Constant expression type different from required type!"); |
| return 0; |
| } |
| return D.ConstantValue; |
| |
| case ValID::InlineAsmVal: { // Inline asm expression |
| const PointerType *PTy = dyn_cast<PointerType>(Ty); |
| const FunctionType *FTy = |
| PTy ? dyn_cast<FunctionType>(PTy->getElementType()) : 0; |
| if (!FTy || !InlineAsm::Verify(FTy, D.IAD->Constraints)) { |
| GenerateError("Invalid type for asm constraint string!"); |
| return 0; |
| } |
| InlineAsm *IA = InlineAsm::get(FTy, D.IAD->AsmString, D.IAD->Constraints, |
| D.IAD->HasSideEffects); |
| D.destroy(); // Free InlineAsmDescriptor. |
| return IA; |
| } |
| default: |
| assert(0 && "Unhandled case!"); |
| return 0; |
| } // End of switch |
| |
| assert(0 && "Unhandled case!"); |
| return 0; |
| } |
| |
| // getVal - This function is identical to getValNonImprovising, except that if a |
| // value is not already defined, it "improvises" by creating a placeholder var |
| // that looks and acts just like the requested variable. When the value is |
| // defined later, all uses of the placeholder variable are replaced with the |
| // real thing. |
| // |
| static Value *getVal(const Type *Ty, const ValID &ID) { |
| if (Ty == Type::LabelTy) { |
| GenerateError("Cannot use a basic block here"); |
| return 0; |
| } |
| |
| // See if the value has already been defined. |
| Value *V = getValNonImprovising(Ty, ID); |
| if (V) return V; |
| if (TriggerError) return 0; |
| |
| if (!Ty->isFirstClassType() && !isa<OpaqueType>(Ty)) { |
| GenerateError("Invalid use of a composite type!"); |
| return 0; |
| } |
| |
| // If we reached here, we referenced either a symbol that we don't know about |
| // or an id number that hasn't been read yet. We may be referencing something |
| // forward, so just create an entry to be resolved later and get to it... |
| // |
| V = new Argument(Ty); |
| |
| // Remember where this forward reference came from. FIXME, shouldn't we try |
| // to recycle these things?? |
| CurModule.PlaceHolderInfo.insert(std::make_pair(V, std::make_pair(ID, |
| llvmAsmlineno))); |
| |
| if (inFunctionScope()) |
| InsertValue(V, CurFun.LateResolveValues); |
| else |
| InsertValue(V, CurModule.LateResolveValues); |
| return V; |
| } |
| |
| /// getBBVal - This is used for two purposes: |
| /// * If isDefinition is true, a new basic block with the specified ID is being |
| /// defined. |
| /// * If isDefinition is true, this is a reference to a basic block, which may |
| /// or may not be a forward reference. |
| /// |
| static BasicBlock *getBBVal(const ValID &ID, bool isDefinition = false) { |
| assert(inFunctionScope() && "Can't get basic block at global scope!"); |
| |
| std::string Name; |
| BasicBlock *BB = 0; |
| switch (ID.Type) { |
| default: |
| GenerateError("Illegal label reference " + ID.getName()); |
| return 0; |
| case ValID::NumberVal: // Is it a numbered definition? |
| if (unsigned(ID.Num) >= CurFun.NumberedBlocks.size()) |
| CurFun.NumberedBlocks.resize(ID.Num+1); |
| BB = CurFun.NumberedBlocks[ID.Num]; |
| break; |
| case ValID::NameVal: // Is it a named definition? |
| Name = ID.Name; |
| if (Value *N = CurFun.CurrentFunction-> |
| getValueSymbolTable().lookup(Type::LabelTy, Name)) |
| BB = cast<BasicBlock>(N); |
| break; |
| } |
| |
| // See if the block has already been defined. |
| if (BB) { |
| // If this is the definition of the block, make sure the existing value was |
| // just a forward reference. If it was a forward reference, there will be |
| // an entry for it in the PlaceHolderInfo map. |
| if (isDefinition && !CurFun.BBForwardRefs.erase(BB)) { |
| // The existing value was a definition, not a forward reference. |
| GenerateError("Redefinition of label " + ID.getName()); |
| return 0; |
| } |
| |
| ID.destroy(); // Free strdup'd memory. |
| return BB; |
| } |
| |
| // Otherwise this block has not been seen before. |
| BB = new BasicBlock("", CurFun.CurrentFunction); |
| if (ID.Type == ValID::NameVal) { |
| BB->setName(ID.Name); |
| } else { |
| CurFun.NumberedBlocks[ID.Num] = BB; |
| } |
| |
| // If this is not a definition, keep track of it so we can use it as a forward |
| // reference. |
| if (!isDefinition) { |
| // Remember where this forward reference came from. |
| CurFun.BBForwardRefs[BB] = std::make_pair(ID, llvmAsmlineno); |
| } else { |
| // The forward declaration could have been inserted anywhere in the |
| // function: insert it into the correct place now. |
| CurFun.CurrentFunction->getBasicBlockList().remove(BB); |
| CurFun.CurrentFunction->getBasicBlockList().push_back(BB); |
| } |
| ID.destroy(); |
| return BB; |
| } |
| |
| |
| //===----------------------------------------------------------------------===// |
| // Code to handle forward references in instructions |
| //===----------------------------------------------------------------------===// |
| // |
| // This code handles the late binding needed with statements that reference |
| // values not defined yet... for example, a forward branch, or the PHI node for |
| // a loop body. |
| // |
| // This keeps a table (CurFun.LateResolveValues) of all such forward references |
| // and back patchs after we are done. |
| // |
| |
| // ResolveDefinitions - If we could not resolve some defs at parsing |
| // time (forward branches, phi functions for loops, etc...) resolve the |
| // defs now... |
| // |
| static void |
| ResolveDefinitions(std::map<const Type*,ValueList> &LateResolvers, |
| std::map<const Type*,ValueList> *FutureLateResolvers) { |
| // Loop over LateResolveDefs fixing up stuff that couldn't be resolved |
| for (std::map<const Type*,ValueList>::iterator LRI = LateResolvers.begin(), |
| E = LateResolvers.end(); LRI != E; ++LRI) { |
| ValueList &List = LRI->second; |
| while (!List.empty()) { |
| Value *V = List.back(); |
| List.pop_back(); |
| |
| std::map<Value*, std::pair<ValID, int> >::iterator PHI = |
| CurModule.PlaceHolderInfo.find(V); |
| assert(PHI != CurModule.PlaceHolderInfo.end() && "Placeholder error!"); |
| |
| ValID &DID = PHI->second.first; |
| |
| Value *TheRealValue = getValNonImprovising(LRI->first, DID); |
| if (TriggerError) |
| return; |
| if (TheRealValue) { |
| V->replaceAllUsesWith(TheRealValue); |
| delete V; |
| CurModule.PlaceHolderInfo.erase(PHI); |
| } else if (FutureLateResolvers) { |
| // Functions have their unresolved items forwarded to the module late |
| // resolver table |
| InsertValue(V, *FutureLateResolvers); |
| } else { |
| if (DID.Type == ValID::NameVal) { |
| GenerateError("Reference to an invalid definition: '" +DID.getName()+ |
| "' of type '" + V->getType()->getDescription() + "'", |
| PHI->second.second); |
| return; |
| } else { |
| GenerateError("Reference to an invalid definition: #" + |
| itostr(DID.Num) + " of type '" + |
| V->getType()->getDescription() + "'", |
| PHI->second.second); |
| return; |
| } |
| } |
| } |
| } |
| |
| LateResolvers.clear(); |
| } |
| |
| // ResolveTypeTo - A brand new type was just declared. This means that (if |
| // name is not null) things referencing Name can be resolved. Otherwise, things |
| // refering to the number can be resolved. Do this now. |
| // |
| static void ResolveTypeTo(char *Name, const Type *ToTy) { |
| ValID D; |
| if (Name) D = ValID::create(Name); |
| else D = ValID::create((int)CurModule.Types.size()); |
| |
| std::map<ValID, PATypeHolder>::iterator I = |
| CurModule.LateResolveTypes.find(D); |
| if (I != CurModule.LateResolveTypes.end()) { |
| ((DerivedType*)I->second.get())->refineAbstractTypeTo(ToTy); |
| CurModule.LateResolveTypes.erase(I); |
| } |
| } |
| |
| // setValueName - Set the specified value to the name given. The name may be |
| // null potentially, in which case this is a noop. The string passed in is |
| // assumed to be a malloc'd string buffer, and is free'd by this function. |
| // |
| static void setValueName(Value *V, char *NameStr) { |
| if (NameStr) { |
| std::string Name(NameStr); // Copy string |
| free(NameStr); // Free old string |
| |
| if (V->getType() == Type::VoidTy) { |
| GenerateError("Can't assign name '" + Name+"' to value with void type!"); |
| return; |
| } |
| |
| assert(inFunctionScope() && "Must be in function scope!"); |
| SymbolTable &ST = CurFun.CurrentFunction->getValueSymbolTable(); |
| if (ST.lookup(V->getType(), 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(char *NameStr,GlobalValue::LinkageTypes Linkage, |
| bool isConstantGlobal, const Type *Ty, |
| Constant *Initializer) { |
| if (isa<FunctionType>(Ty)) { |
| GenerateError("Cannot declare global vars of function type!"); |
| return 0; |
| } |
| |
| const PointerType *PTy = PointerType::get(Ty); |
| |
| std::string Name; |
| if (NameStr) { |
| Name = NameStr; // Copy string |
| free(NameStr); // Free old string |
| } |
| |
| // See if this global value was forward referenced. If so, recycle the |
| // object. |
| ValID ID; |
| if (!Name.empty()) { |
| ID = ValID::create((char*)Name.c_str()); |
| } else { |
| ID = ValID::create((int)CurModule.Values[PTy].size()); |
| } |
| |
| if (GlobalValue *FWGV = CurModule.GetForwardRefForGlobal(PTy, ID)) { |
| // Move the global to the end of the list, from whereever it was |
| // previously inserted. |
| GlobalVariable *GV = cast<GlobalVariable>(FWGV); |
| CurModule.CurrentModule->getGlobalList().remove(GV); |
| CurModule.CurrentModule->getGlobalList().push_back(GV); |
| GV->setInitializer(Initializer); |
| GV->setLinkage(Linkage); |
| GV->setConstant(isConstantGlobal); |
| InsertValue(GV, CurModule.Values); |
| return GV; |
| } |
| |
| // If this global has a name, check to see if there is already a definition |
| // of this global in the module. If so, it is an error. |
| if (!Name.empty()) { |
| // We are a simple redefinition of a value, check to see if it is defined |
| // the same as the old one. |
| if (CurModule.CurrentModule->getGlobalVariable(Name, Ty)) { |
| 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); |
| InsertValue(GV, CurModule.Values); |
| return GV; |
| } |
| |
| // setTypeName - Set the specified type to the name given. The name may be |
| // null potentially, in which case this is a noop. The string passed in is |
| // assumed to be a malloc'd string buffer, and is freed by this function. |
| // |
| // This function returns true if the type has already been defined, but is |
| // allowed to be redefined in the specified context. If the name is a new name |
| // for the type plane, it is inserted and false is returned. |
| static bool setTypeName(const Type *T, char *NameStr) { |
| assert(!inFunctionScope() && "Can't give types function-local names!"); |
| if (NameStr == 0) return false; |
| |
| std::string Name(NameStr); // Copy string |
| free(NameStr); // Free old string |
| |
| // We don't allow assigning names to void type |
| if (T == Type::VoidTy) { |
| GenerateError("Can't assign name '" + Name + "' to the void type!"); |
| return false; |
| } |
| |
| // Set the type name, checking for conflicts as we do so. |
| bool AlreadyExists = CurModule.CurrentModule->addTypeName(Name, T); |
| |
| if (AlreadyExists) { // Inserting a name that is already defined??? |
| const Type *Existing = CurModule.CurrentModule->getTypeByName(Name); |
| assert(Existing && "Conflict but no matching type?"); |
| |
| // There is only one case where this is allowed: when we are refining an |
| // opaque type. In this case, Existing will be an opaque type. |
| if (const OpaqueType *OpTy = dyn_cast<OpaqueType>(Existing)) { |
| // We ARE replacing an opaque type! |
| const_cast<OpaqueType*>(OpTy)->refineAbstractTypeTo(T); |
| return true; |
| } |
| |
| // Otherwise, this is an attempt to redefine a type. That's okay if |
| // the redefinition is identical to the original. This will be so if |
| // Existing and T point to the same Type object. In this one case we |
| // allow the equivalent redefinition. |
| if (Existing == T) return true; // Yes, it's equal. |
| |
| // Any other kind of (non-equivalent) redefinition is an error. |
| GenerateError("Redefinition of type named '" + Name + "' 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(const std::string &Filename, FILE *F) { |
| set_scan_file(F); |
| |
| CurFilename = Filename; |
| return RunParser(new Module(CurFilename)); |
| } |
| |
| Module *llvm::RunVMAsmParser(const char * AsmString, Module * M) { |
| set_scan_string(AsmString); |
| |
| CurFilename = "from_memory"; |
| if (M == NULL) { |
| return RunParser(new Module (CurFilename)); |
| } else { |
| return RunParser(M); |
| } |
| } |
| |
| |
| |
| /* Enabling traces. */ |
| #ifndef YYDEBUG |
| # define YYDEBUG 0 |
| #endif |
| |
| /* Enabling verbose error messages. */ |
| #ifdef YYERROR_VERBOSE |
| # undef YYERROR_VERBOSE |
| # define YYERROR_VERBOSE 1 |
| #else |
| # define YYERROR_VERBOSE 0 |
| #endif |
| |
| /* Enabling the token table. */ |
| #ifndef YYTOKEN_TABLE |
| # define YYTOKEN_TABLE 0 |
| #endif |
| |
| #if ! defined (YYSTYPE) && ! defined (YYSTYPE_IS_DECLARED) |
| #line 876 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| typedef union YYSTYPE { |
| 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::ValueRefList *ValueRefList; |
| |
| // 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::FunctionType::ParameterAttributes ParamAttrs; |
| int64_t SInt64Val; |
| uint64_t UInt64Val; |
| int SIntVal; |
| unsigned UIntVal; |
| double FPVal; |
| bool BoolVal; |
| |
| char *StrVal; // This memory is strdup'd! |
| llvm::ValID ValIDVal; // strdup'd memory maybe! |
| |
| llvm::Instruction::BinaryOps BinaryOpVal; |
| llvm::Instruction::TermOps TermOpVal; |
| llvm::Instruction::MemoryOps MemOpVal; |
| llvm::Instruction::CastOps CastOpVal; |
| llvm::Instruction::OtherOps OtherOpVal; |
| llvm::Module::Endianness Endianness; |
| llvm::ICmpInst::Predicate IPredicate; |
| llvm::FCmpInst::Predicate FPredicate; |
| } YYSTYPE; |
| /* Line 196 of yacc.c. */ |
| #line 1271 "llvmAsmParser.tab.c" |
| # define yystype YYSTYPE /* obsolescent; will be withdrawn */ |
| # define YYSTYPE_IS_DECLARED 1 |
| # define YYSTYPE_IS_TRIVIAL 1 |
| #endif |
| |
| |
| |
| /* Copy the second part of user declarations. */ |
| |
| |
| /* Line 219 of yacc.c. */ |
| #line 1283 "llvmAsmParser.tab.c" |
| |
| #if ! defined (YYSIZE_T) && defined (__SIZE_TYPE__) |
| # define YYSIZE_T __SIZE_TYPE__ |
| #endif |
| #if ! defined (YYSIZE_T) && defined (size_t) |
| # define YYSIZE_T size_t |
| #endif |
| #if ! defined (YYSIZE_T) && (defined (__STDC__) || defined (__cplusplus)) |
| # include <stddef.h> /* INFRINGES ON USER NAME SPACE */ |
| # define YYSIZE_T size_t |
| #endif |
| #if ! defined (YYSIZE_T) |
| # define YYSIZE_T unsigned int |
| #endif |
| |
| #ifndef YY_ |
| # if YYENABLE_NLS |
| # if ENABLE_NLS |
| # include <libintl.h> /* INFRINGES ON USER NAME SPACE */ |
| # define YY_(msgid) dgettext ("bison-runtime", msgid) |
| # endif |
| # endif |
| # ifndef YY_ |
| # define YY_(msgid) msgid |
| # endif |
| #endif |
| |
| #if ! defined (yyoverflow) || YYERROR_VERBOSE |
| |
| /* The parser invokes alloca or malloc; define the necessary symbols. */ |
| |
| # ifdef YYSTACK_USE_ALLOCA |
| # if YYSTACK_USE_ALLOCA |
| # ifdef __GNUC__ |
| # define YYSTACK_ALLOC __builtin_alloca |
| # else |
| # define YYSTACK_ALLOC alloca |
| # if defined (__STDC__) || defined (__cplusplus) |
| # include <stdlib.h> /* INFRINGES ON USER NAME SPACE */ |
| # define YYINCLUDED_STDLIB_H |
| # endif |
| # endif |
| # endif |
| # endif |
| |
| # ifdef YYSTACK_ALLOC |
| /* Pacify GCC's `empty if-body' warning. */ |
| # define YYSTACK_FREE(Ptr) do { /* empty */; } while (0) |
| # ifndef YYSTACK_ALLOC_MAXIMUM |
| /* The OS might guarantee only one guard page at the bottom of the stack, |
| and a page size can be as small as 4096 bytes. So we cannot safely |
| invoke alloca (N) if N exceeds 4096. Use a slightly smaller number |
| to allow for a few compiler-allocated temporary stack slots. */ |
| # define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2005 */ |
| # endif |
| # else |
| # define YYSTACK_ALLOC YYMALLOC |
| # define YYSTACK_FREE YYFREE |
| # ifndef YYSTACK_ALLOC_MAXIMUM |
| # define YYSTACK_ALLOC_MAXIMUM ((YYSIZE_T) -1) |
| # endif |
| # ifdef __cplusplus |
| extern "C" { |
| # endif |
| # ifndef YYMALLOC |
| # define YYMALLOC malloc |
| # if (! defined (malloc) && ! defined (YYINCLUDED_STDLIB_H) \ |
| && (defined (__STDC__) || defined (__cplusplus))) |
| void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */ |
| # endif |
| # endif |
| # ifndef YYFREE |
| # define YYFREE free |
| # if (! defined (free) && ! defined (YYINCLUDED_STDLIB_H) \ |
| && (defined (__STDC__) || defined (__cplusplus))) |
| void free (void *); /* INFRINGES ON USER NAME SPACE */ |
| # endif |
| # endif |
| # ifdef __cplusplus |
| } |
| # endif |
| # endif |
| #endif /* ! defined (yyoverflow) || YYERROR_VERBOSE */ |
| |
| |
| #if (! defined (yyoverflow) \ |
| && (! defined (__cplusplus) \ |
| || (defined (YYSTYPE_IS_TRIVIAL) && YYSTYPE_IS_TRIVIAL))) |
| |
| /* A type that is properly aligned for any stack member. */ |
| union yyalloc |
| { |
| short int yyss; |
| YYSTYPE yyvs; |
| }; |
| |
| /* The size of the maximum gap between one aligned stack and the next. */ |
| # define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1) |
| |
| /* The size of an array large to enough to hold all stacks, each with |
| N elements. */ |
| # define YYSTACK_BYTES(N) \ |
| ((N) * (sizeof (short int) + sizeof (YYSTYPE)) \ |
| + YYSTACK_GAP_MAXIMUM) |
| |
| /* Copy COUNT objects from FROM to TO. The source and destination do |
| not overlap. */ |
| # ifndef YYCOPY |
| # if defined (__GNUC__) && 1 < __GNUC__ |
| # define YYCOPY(To, From, Count) \ |
| __builtin_memcpy (To, From, (Count) * sizeof (*(From))) |
| # else |
| # define YYCOPY(To, From, Count) \ |
| do \ |
| { \ |
| YYSIZE_T yyi; \ |
| for (yyi = 0; yyi < (Count); yyi++) \ |
| (To)[yyi] = (From)[yyi]; \ |
| } \ |
| while (0) |
| # endif |
| # endif |
| |
| /* Relocate STACK from its old location to the new one. The |
| local variables YYSIZE and YYSTACKSIZE give the old and new number of |
| elements in the stack, and YYPTR gives the new location of the |
| stack. Advance YYPTR to a properly aligned location for the next |
| stack. */ |
| # define YYSTACK_RELOCATE(Stack) \ |
| do \ |
| { \ |
| YYSIZE_T yynewbytes; \ |
| YYCOPY (&yyptr->Stack, Stack, yysize); \ |
| Stack = &yyptr->Stack; \ |
| yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \ |
| yyptr += yynewbytes / sizeof (*yyptr); \ |
| } \ |
| while (0) |
| |
| #endif |
| |
| #if defined (__STDC__) || defined (__cplusplus) |
| typedef signed char yysigned_char; |
| #else |
| typedef short int yysigned_char; |
| #endif |
| |
| /* YYFINAL -- State number of the termination state. */ |
| #define YYFINAL 37 |
| /* YYLAST -- Last index in YYTABLE. */ |
| #define YYLAST 1584 |
| |
| /* YYNTOKENS -- Number of terminals. */ |
| #define YYNTOKENS 150 |
| /* YYNNTS -- Number of nonterminals. */ |
| #define YYNNTS 78 |
| /* YYNRULES -- Number of rules. */ |
| #define YYNRULES 291 |
| /* YYNRULES -- Number of states. */ |
| #define YYNSTATES 576 |
| |
| /* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */ |
| #define YYUNDEFTOK 2 |
| #define YYMAXUTOK 390 |
| |
| #define YYTRANSLATE(YYX) \ |
| ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK) |
| |
| /* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */ |
| static const unsigned char yytranslate[] = |
| { |
| 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 140, 141, 138, 2, 137, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 145, 136, 146, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 142, 139, 144, 2, 2, 2, 2, 2, 149, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 143, 2, 2, 147, 2, 148, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 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 |
| }; |
| |
| #if YYDEBUG |
| /* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in |
| YYRHS. */ |
| static const unsigned short int yyprhs[] = |
| { |
| 0, 0, 3, 5, 7, 9, 11, 13, 15, 17, |
| 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, |
| 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, |
| 59, 61, 63, 65, 67, 69, 71, 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, 128, 129, 131, 133, 135, 137, |
| 139, 141, 143, 145, 146, 148, 150, 151, 153, 155, |
| 157, 159, 160, 162, 164, 166, 168, 170, 172, 175, |
| 177, 179, 180, 183, 185, 187, 188, 191, 192, 195, |
| 196, 200, 203, 204, 206, 207, 211, 213, 216, 218, |
| 220, 222, 224, 226, 228, 230, 232, 234, 236, 239, |
| 241, 244, 250, 256, 262, 268, 272, 275, 281, 286, |
| 289, 291, 293, 295, 299, 301, 305, 307, 308, 310, |
| 314, 319, 323, 327, 332, 337, 341, 348, 354, 357, |
| 360, 363, 366, 369, 372, 375, 378, 381, 384, 391, |
| 397, 406, 413, 420, 428, 436, 443, 450, 459, 468, |
| 472, 474, 476, 478, 480, 481, 483, 486, 487, 491, |
| 492, 496, 500, 502, 506, 510, 511, 517, 518, 525, |
| 526, 533, 536, 540, 542, 544, 546, 550, 554, 558, |
| 562, 566, 570, 572, 573, 575, 577, 579, 580, 586, |
| 590, 592, 596, 598, 599, 609, 611, 613, 617, 619, |
| 621, 624, 627, 628, 630, 632, 634, 636, 638, 640, |
| 642, 644, 646, 650, 652, 658, 660, 662, 664, 666, |
| 669, 672, 675, 679, 682, 683, 685, 688, 691, 695, |
| 705, 715, 724, 739, 741, 743, 750, 756, 759, 766, |
| 774, 778, 784, 785, 786, 790, 793, 795, 801, 807, |
| 814, 821, 824, 829, 834, 841, 846, 851, 858, 865, |
| 868, 877, 879, 881, 882, 886, 893, 897, 904, 907, |
| 912, 919 |
| }; |
| |
| /* YYRHS -- A `-1'-separated list of the rules' RHS. */ |
| static const short int yyrhs[] = |
| { |
| 187, 0, -1, 5, -1, 6, -1, 74, -1, 75, |
| -1, 76, -1, 77, -1, 78, -1, 79, -1, 80, |
| -1, 81, -1, 82, -1, 83, -1, 84, -1, 85, |
| -1, 114, -1, 115, -1, 116, -1, 117, -1, 118, |
| -1, 119, -1, 120, -1, 121, -1, 122, -1, 123, |
| -1, 124, -1, 125, -1, 128, -1, 129, -1, 130, |
| -1, 88, -1, 89, -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, 94, -1, 95, -1, 96, -1, 97, -1, 23, |
| -1, 24, -1, 13, -1, 12, -1, 11, -1, 10, |
| -1, 14, -1, 15, -1, 200, 136, -1, -1, 37, |
| -1, 39, -1, 38, -1, 40, -1, 42, -1, 41, |
| -1, 43, -1, 46, -1, -1, 41, -1, 43, -1, |
| -1, 37, -1, 38, -1, 39, -1, 42, -1, -1, |
| 61, -1, 62, -1, 63, -1, 64, -1, 65, -1, |
| 66, -1, 60, 4, -1, 115, -1, 116, -1, -1, |
| 167, 166, -1, 135, -1, 166, -1, -1, 169, 168, |
| -1, -1, 53, 4, -1, -1, 137, 53, 4, -1, |
| 31, 20, -1, -1, 172, -1, -1, 137, 175, 174, |
| -1, 172, -1, 53, 4, -1, 9, -1, 10, -1, |
| 11, -1, 12, -1, 13, -1, 14, -1, 15, -1, |
| 16, -1, 44, -1, 176, -1, 177, 138, -1, 212, |
| -1, 139, 4, -1, 177, 140, 181, 141, 169, -1, |
| 8, 140, 181, 141, 169, -1, 142, 4, 143, 177, |
| 144, -1, 145, 4, 143, 177, 146, -1, 147, 182, |
| 148, -1, 147, 148, -1, 145, 147, 182, 148, 146, |
| -1, 145, 147, 148, 146, -1, 177, 167, -1, 177, |
| -1, 8, -1, 178, -1, 180, 137, 178, -1, 180, |
| -1, 180, 137, 34, -1, 34, -1, -1, 177, -1, |
| 182, 137, 177, -1, 177, 142, 185, 144, -1, 177, |
| 142, 144, -1, 177, 149, 20, -1, 177, 145, 185, |
| 146, -1, 177, 147, 185, 148, -1, 177, 147, 148, |
| -1, 177, 145, 147, 185, 148, 146, -1, 177, 145, |
| 147, 148, 146, -1, 177, 35, -1, 177, 36, -1, |
| 177, 212, -1, 177, 184, -1, 177, 22, -1, 158, |
| 3, -1, 158, 4, -1, 9, 23, -1, 9, 24, |
| -1, 159, 7, -1, 154, 140, 183, 33, 177, 141, |
| -1, 113, 140, 183, 223, 141, -1, 127, 140, 183, |
| 137, 183, 137, 183, 141, -1, 152, 140, 183, 137, |
| 183, 141, -1, 153, 140, 183, 137, 183, 141, -1, |
| 86, 156, 140, 183, 137, 183, 141, -1, 87, 157, |
| 140, 183, 137, 183, 141, -1, 155, 140, 183, 137, |
| 183, 141, -1, 132, 140, 183, 137, 183, 141, -1, |
| 133, 140, 183, 137, 183, 137, 183, 141, -1, 134, |
| 140, 183, 137, 183, 137, 183, 141, -1, 185, 137, |
| 183, -1, 183, -1, 29, -1, 30, -1, 188, -1, |
| -1, 189, -1, 188, 189, -1, -1, 28, 190, 208, |
| -1, -1, 27, 191, 209, -1, 58, 57, 195, -1, |
| 21, -1, 160, 17, 177, -1, 160, 17, 8, -1, |
| -1, 160, 186, 183, 192, 174, -1, -1, 160, 161, |
| 186, 183, 193, 174, -1, -1, 160, 162, 186, 177, |
| 194, 174, -1, 47, 197, -1, 54, 136, 198, -1, |
| 20, -1, 52, -1, 51, -1, 49, 136, 196, -1, |
| 50, 136, 4, -1, 48, 136, 20, -1, 67, 136, |
| 20, -1, 142, 199, 144, -1, 199, 137, 20, -1, |
| 20, -1, -1, 18, -1, 20, -1, 200, -1, -1, |
| 202, 137, 177, 167, 201, -1, 177, 167, 201, -1, |
| 202, -1, 202, 137, 34, -1, 34, -1, -1, 165, |
| 179, 200, 140, 203, 141, 169, 173, 170, -1, 25, |
| -1, 147, -1, 164, 204, 205, -1, 26, -1, 148, |
| -1, 215, 207, -1, 163, 204, -1, -1, 59, -1, |
| 3, -1, 4, -1, 7, -1, 23, -1, 24, -1, |
| 35, -1, 36, -1, 22, -1, 145, 185, 146, -1, |
| 184, -1, 57, 210, 20, 137, 20, -1, 151, -1, |
| 200, -1, 212, -1, 211, -1, 177, 213, -1, 215, |
| 216, -1, 206, 216, -1, 217, 160, 218, -1, 217, |
| 220, -1, -1, 19, -1, 68, 214, -1, 68, 8, |
| -1, 69, 16, 213, -1, 69, 9, 213, 137, 16, |
| 213, 137, 16, 213, -1, 70, 158, 213, 137, 16, |
| 213, 142, 219, 144, -1, 70, 158, 213, 137, 16, |
| 213, 142, 144, -1, 71, 165, 179, 213, 140, 222, |
| 141, 169, 33, 16, 213, 72, 16, 213, -1, 72, |
| -1, 73, -1, 219, 158, 211, 137, 16, 213, -1, |
| 158, 211, 137, 16, 213, -1, 160, 225, -1, 177, |
| 142, 213, 137, 213, 144, -1, 221, 137, 142, 213, |
| 137, 213, 144, -1, 177, 213, 167, -1, 222, 137, |
| 177, 213, 167, -1, -1, -1, 223, 137, 214, -1, |
| 56, 55, -1, 55, -1, 152, 177, 213, 137, 213, |
| -1, 153, 177, 213, 137, 213, -1, 86, 156, 177, |
| 213, 137, 213, -1, 87, 157, 177, 213, 137, 213, |
| -1, 45, 214, -1, 155, 214, 137, 214, -1, 154, |
| 214, 33, 177, -1, 127, 214, 137, 214, 137, 214, |
| -1, 131, 214, 137, 177, -1, 132, 214, 137, 214, |
| -1, 133, 214, 137, 214, 137, 214, -1, 134, 214, |
| 137, 214, 137, 214, -1, 126, 221, -1, 224, 165, |
| 179, 213, 140, 222, 141, 169, -1, 227, -1, 32, |
| -1, -1, 108, 177, 171, -1, 108, 177, 137, 12, |
| 213, 171, -1, 109, 177, 171, -1, 109, 177, 137, |
| 12, 213, 171, -1, 110, 214, -1, 226, 111, 177, |
| 213, -1, 226, 112, 214, 137, 177, 213, -1, 113, |
| 177, 213, 223, -1 |
| }; |
| |
| /* YYRLINE[YYN] -- source line where rule number YYN was defined. */ |
| static const unsigned short int yyrline[] = |
| { |
| 0, 1019, 1019, 1020, 1030, 1030, 1030, 1030, 1030, 1030, |
| 1030, 1030, 1030, 1031, 1031, 1031, 1032, 1032, 1032, 1032, |
| 1032, 1032, 1033, 1033, 1033, 1033, 1033, 1033, 1034, 1034, |
| 1034, 1036, 1036, 1037, 1037, 1038, 1038, 1039, 1039, 1040, |
| 1040, 1044, 1044, 1045, 1045, 1046, 1046, 1047, 1047, 1048, |
| 1048, 1049, 1049, 1050, 1050, 1051, 1052, 1057, 1057, 1057, |
| 1057, 1058, 1058, 1061, 1065, 1071, 1072, 1073, 1074, 1075, |
| 1079, 1080, 1081, 1085, 1086, 1087, 1091, 1092, 1093, 1094, |
| 1095, 1098, 1099, 1100, 1101, 1102, 1103, 1104, 1105, 1112, |
| 1113, 1116, 1117, 1122, 1123, 1126, 1127, 1134, 1135, 1141, |
| 1142, 1150, 1158, 1159, 1164, 1165, 1166, 1171, 1184, 1184, |
| 1184, 1184, 1184, 1184, 1184, 1184, 1187, 1191, 1195, 1202, |
| 1207, 1215, 1233, 1251, 1256, 1268, 1278, 1282, 1292, 1299, |
| 1306, 1313, 1318, 1323, 1330, 1331, 1338, 1345, 1353, 1358, |
| 1369, 1397, 1413, 1442, 1470, 1495, 1514, 1539, 1558, 1570, |
| 1577, 1640, 1650, 1660, 1666, 1672, 1676, 1680, 1688, 1702, |
| 1723, 1731, 1737, 1748, 1753, 1758, 1767, 1773, 1779, 1788, |
| 1792, 1800, 1800, 1811, 1816, 1824, 1825, 1829, 1829, 1833, |
| 1833, 1836, 1839, 1851, 1875, 1886, 1886, 1895, 1895, 1903, |
| 1903, 1913, 1916, 1922, 1935, 1936, 1938, 1942, 1951, 1955, |
| 1960, 1962, 1967, 1972, 1981, 1981, 1982, 1982, 1984, 1994, |
| 2005, 2009, 2018, 2027, 2032, 2137, 2137, 2139, 2147, 2147, |
| 2149, 2154, 2165, 2169, 2174, 2178, 2182, 2186, 2190, 2194, |
| 2198, 2202, 2206, 2231, 2235, 2249, 2253, 2259, 2259, 2265, |
| 2274, 2278, 2287, 2298, 2307, 2319, 2332, 2336, 2340, 2345, |
| 2354, 2373, 2382, 2449, 2453, 2460, 2471, 2484, 2493, 2504, |
| 2514, 2522, 2530, 2533, 2534, 2541, 2545, 2550, 2571, 2588, |
| 2601, 2614, 2627, 2636, 2649, 2657, 2664, 2670, 2676, 2682, |
| 2697, 2760, 2765, 2769, 2776, 2783, 2791, 2798, 2806, 2814, |
| 2828, 2845 |
| }; |
| #endif |
| |
| #if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE |
| /* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM. |
| First, the terminals, then, starting at YYNTOKENS, nonterminals. */ |
| static const char *const yytname[] = |
| { |
| "$end", "error", "$undefined", "ESINT64VAL", "EUINT64VAL", "SINTVAL", |
| "UINTVAL", "FPVAL", "VOID", "BOOL", "INT8", "INT16", "INT32", "INT64", |
| "FLOAT", "DOUBLE", "LABEL", "TYPE", "VAR_ID", "LABELSTR", |
| "STRINGCONSTANT", "IMPLEMENTATION", "ZEROINITIALIZER", "TRUETOK", |
| "FALSETOK", "BEGINTOK", "ENDTOK", "DECLARE", "DEFINE", "GLOBAL", |
| "CONSTANT", "SECTION", "VOLATILE", "TO", "DOTDOTDOT", "NULL_TOK", |
| "UNDEF", "INTERNAL", "LINKONCE", "WEAK", "APPENDING", "DLLIMPORT", |
| "DLLEXPORT", "EXTERN_WEAK", "OPAQUE", "NOT", "EXTERNAL", "TARGET", |
| "TRIPLE", "ENDIAN", "POINTERSIZE", "LITTLE", "BIG", "ALIGN", "DEPLIBS", |
| "CALL", "TAIL", "ASM_TOK", "MODULE", "SIDEEFFECT", "CC_TOK", "CCC_TOK", |
| "CSRETCC_TOK", "FASTCC_TOK", "COLDCC_TOK", "X86_STDCALLCC_TOK", |
| "X86_FASTCALLCC_TOK", "DATALAYOUT", "RET", "BR", "SWITCH", "INVOKE", |
| "UNWIND", "UNREACHABLE", "ADD", "SUB", "MUL", "UDIV", "SDIV", "FDIV", |
| "UREM", "SREM", "FREM", "AND", "OR", "XOR", "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", "SHL", "LSHR", |
| "ASHR", "VAARG", "EXTRACTELEMENT", "INSERTELEMENT", "SHUFFLEVECTOR", |
| "NORETURN", "'='", "','", "'*'", "'\\\\'", "'('", "')'", "'['", "'x'", |
| "']'", "'<'", "'>'", "'{'", "'}'", "'c'", "$accept", "INTVAL", |
| "ArithmeticOps", "LogicalOps", "CastOps", "ShiftOps", "IPredicates", |
| "FPredicates", "IntType", "FPType", "OptAssign", "GVInternalLinkage", |
| "GVExternalLinkage", "FunctionDeclareLinkage", "FunctionDefineLinkage", |
| "OptCallingConv", "ParamAttr", "OptParamAttrs", "FuncAttr", |
| "OptFuncAttrs", "OptAlign", "OptCAlign", "SectionString", "OptSection", |
| "GlobalVarAttributes", "GlobalVarAttribute", "PrimType", "Types", |
| "ArgType", "ResultTypes", "ArgTypeList", "ArgTypeListI", "TypeListI", |
| "ConstVal", "ConstExpr", "ConstVector", "GlobalType", "Module", |
| "DefinitionList", "Definition", "@1", "@2", "@3", "@4", "@5", "AsmBlock", |
| "BigOrLittle", "TargetDefinition", "LibrariesDefinition", "LibList", |
| "Name", "OptName", "ArgListH", "ArgList", "FunctionHeaderH", "BEGIN", |
| "FunctionHeader", "END", "Function", "FunctionProto", "OptSideEffect", |
| "ConstValueRef", "SymbolicValueRef", "ValueRef", "ResolvedVal", |
| "BasicBlockList", "BasicBlock", "InstructionList", "BBTerminatorInst", |
| "JumpTable", "Inst", "PHIList", "ValueRefList", "IndexList", |
| "OptTailCall", "InstVal", "OptVolatile", "MemoryInst", 0 |
| }; |
| #endif |
| |
| # ifdef YYPRINT |
| /* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to |
| token YYLEX-NUM. */ |
| static const unsigned short int yytoknum[] = |
| { |
| 0, 256, 257, 258, 259, 260, 261, 262, 263, 264, |
| 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, |
| 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, |
| 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, |
| 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, |
| 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, |
| 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, |
| 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, |
| 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, |
| 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, |
| 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, |
| 365, 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, 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 unsigned char yyr1[] = |
| { |
| 0, 150, 151, 151, 152, 152, 152, 152, 152, 152, |
| 152, 152, 152, 153, 153, 153, 154, 154, 154, 154, |
| 154, 154, 154, 154, 154, 154, 154, 154, 155, 155, |
| 155, 156, 156, 156, 156, 156, 156, 156, 156, 156, |
| 156, 157, 157, 157, 157, 157, 157, 157, 157, 157, |
| 157, 157, 157, 157, 157, 157, 157, 158, 158, 158, |
| 158, 159, 159, 160, 160, 161, 161, 161, 161, 161, |
| 162, 162, 162, 163, 163, 163, 164, 164, 164, 164, |
| 164, 165, 165, 165, 165, 165, 165, 165, 165, 166, |
| 166, 167, 167, 168, 168, 169, 169, 170, 170, 171, |
| 171, 172, 173, 173, 174, 174, 175, 175, 176, 176, |
| 176, 176, 176, 176, 176, 176, 177, 177, 177, 177, |
| 177, 177, 177, 177, 177, 177, 177, 177, 177, 178, |
| 179, 179, 180, 180, 181, 181, 181, 181, 182, 182, |
| 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, |
| 183, 183, 183, 183, 183, 183, 183, 183, 184, 184, |
| 184, 184, 184, 184, 184, 184, 184, 184, 184, 185, |
| 185, 186, 186, 187, 187, 188, 188, 190, 189, 191, |
| 189, 189, 189, 189, 189, 192, 189, 193, 189, 194, |
| 189, 189, 189, 195, 196, 196, 197, 197, 197, 197, |
| 198, 199, 199, 199, 200, 200, 201, 201, 202, 202, |
| 203, 203, 203, 203, 204, 205, 205, 206, 207, 207, |
| 208, 209, 210, 210, 211, 211, 211, 211, 211, 211, |
| 211, 211, 211, 211, 211, 212, 212, 213, 213, 214, |
| 215, 215, 216, 217, 217, 217, 218, 218, 218, 218, |
| 218, 218, 218, 218, 218, 219, 219, 220, 221, 221, |
| 222, 222, 222, 223, 223, 224, 224, 225, 225, 225, |
| 225, 225, 225, 225, 225, 225, 225, 225, 225, 225, |
| 225, 225, 226, 226, 227, 227, 227, 227, 227, 227, |
| 227, 227 |
| }; |
| |
| /* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */ |
| static const unsigned char yyr2[] = |
| { |
| 0, 2, 1, 1, 1, 1, 1, 1, 1, 1, |
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 1, 1, 1, 2, 0, 1, 1, 1, 1, 1, |
| 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, |
| 1, 0, 1, 1, 1, 1, 1, 1, 2, 1, |
| 1, 0, 2, 1, 1, 0, 2, 0, 2, 0, |
| 3, 2, 0, 1, 0, 3, 1, 2, 1, 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, 6, 5, |
| 8, 6, 6, 7, 7, 6, 6, 8, 8, 3, |
| 1, 1, 1, 1, 0, 1, 2, 0, 3, 0, |
| 3, 3, 1, 3, 3, 0, 5, 0, 6, 0, |
| 6, 2, 3, 1, 1, 1, 3, 3, 3, 3, |
| 3, 3, 1, 0, 1, 1, 1, 0, 5, 3, |
| 1, 3, 1, 0, 9, 1, 1, 3, 1, 1, |
| 2, 2, 0, 1, 1, 1, 1, 1, 1, 1, |
| 1, 1, 3, 1, 5, 1, 1, 1, 1, 2, |
| 2, 2, 3, 2, 0, 1, 2, 2, 3, 9, |
| 9, 8, 14, 1, 1, 6, 5, 2, 6, 7, |
| 3, 5, 0, 0, 3, 2, 1, 5, 5, 6, |
| 6, 2, 4, 4, 6, 4, 4, 6, 6, 2, |
| 8, 1, 1, 0, 3, 6, 3, 6, 2, 4, |
| 6, 4 |
| }; |
| |
| /* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state |
| STATE-NUM when YYTABLE doesn't specify something else to do. Zero |
| means the default is an error. */ |
| static const unsigned short int yydefact[] = |
| { |
| 64, 204, 205, 182, 179, 177, 0, 0, 0, 0, |
| 0, 64, 175, 0, 73, 76, 0, 0, 0, 0, |
| 191, 0, 0, 0, 171, 172, 65, 67, 66, 68, |
| 70, 69, 71, 72, 0, 0, 0, 1, 176, 63, |
| 74, 75, 81, 180, 77, 78, 79, 80, 81, 244, |
| 178, 244, 0, 0, 0, 0, 203, 192, 193, 181, |
| 2, 3, 184, 108, 109, 110, 111, 112, 113, 114, |
| 115, 116, 0, 0, 0, 0, 235, 117, 183, 236, |
| 119, 0, 0, 0, 108, 109, 110, 111, 112, 113, |
| 114, 0, 0, 0, 185, 0, 82, 83, 84, 85, |
| 86, 87, 0, 221, 0, 245, 241, 64, 218, 219, |
| 220, 240, 198, 195, 194, 196, 197, 199, 202, 0, |
| 137, 120, 0, 0, 0, 126, 138, 0, 118, 137, |
| 187, 189, 155, 156, 153, 154, 157, 152, 148, 149, |
| 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, |
| 14, 15, 0, 0, 0, 16, 17, 18, 19, 20, |
| 21, 22, 23, 24, 25, 26, 27, 0, 28, 29, |
| 30, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 0, 0, 151, 150, 104, 88, 131, 130, 0, 215, |
| 216, 217, 283, 243, 0, 200, 136, 91, 132, 134, |
| 0, 0, 0, 0, 0, 0, 125, 0, 104, 104, |
| 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, |
| 0, 55, 56, 51, 52, 53, 54, 41, 42, 43, |
| 44, 45, 46, 47, 48, 49, 50, 0, 0, 0, |
| 0, 0, 0, 141, 170, 0, 0, 0, 145, 0, |
| 142, 0, 0, 0, 0, 0, 186, 0, 282, 0, |
| 266, 0, 0, 0, 0, 81, 253, 254, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 242, 81, 257, 0, 281, 201, |
| 129, 0, 95, 0, 0, 128, 0, 139, 95, 188, |
| 190, 0, 0, 263, 0, 0, 0, 0, 0, 140, |
| 126, 138, 0, 143, 144, 0, 0, 0, 0, 0, |
| 0, 106, 104, 213, 0, 271, 265, 247, 246, 0, |
| 0, 60, 59, 58, 57, 0, 0, 0, 0, 99, |
| 99, 288, 0, 0, 279, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 89, 90, 92, |
| 135, 133, 122, 123, 124, 127, 121, 0, 0, 0, |
| 0, 0, 0, 0, 169, 147, 0, 0, 0, 0, |
| 0, 101, 107, 105, 212, 91, 210, 0, 224, 225, |
| 226, 231, 227, 228, 229, 230, 222, 0, 233, 238, |
| 237, 239, 0, 248, 0, 0, 0, 0, 0, 284, |
| 0, 286, 263, 0, 0, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 93, 94, 96, |
| 0, 0, 0, 159, 0, 0, 0, 0, 146, 0, |
| 0, 0, 0, 207, 0, 95, 223, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 291, 0, 0, |
| 0, 275, 276, 0, 0, 0, 0, 273, 272, 0, |
| 289, 0, 0, 0, 264, 0, 166, 0, 0, 161, |
| 162, 158, 165, 206, 209, 211, 91, 102, 0, 232, |
| 0, 0, 262, 0, 0, 99, 100, 99, 0, 0, |
| 0, 0, 0, 267, 268, 262, 0, 163, 164, 0, |
| 0, 0, 207, 103, 97, 0, 0, 0, 0, 0, |
| 269, 270, 0, 285, 287, 0, 0, 274, 277, 278, |
| 0, 290, 160, 167, 168, 208, 0, 214, 234, 0, |
| 0, 91, 0, 95, 258, 0, 95, 98, 0, 251, |
| 0, 0, 260, 0, 0, 259, 280, 249, 0, 250, |
| 0, 91, 0, 0, 0, 261, 0, 0, 0, 0, |
| 256, 0, 0, 255, 0, 252 |
| }; |
| |
| /* YYDEFGOTO[NTERM-NUM]. */ |
| static const short int yydefgoto[] = |
| { |
| -1, 76, 178, 179, 180, 181, 220, 237, 91, 92, |
| 9, 34, 35, 42, 48, 102, 359, 290, 429, 362, |
| 537, 409, 321, 514, 256, 322, 77, 93, 198, 188, |
| 199, 200, 127, 244, 398, 245, 36, 10, 11, 12, |
| 15, 14, 184, 208, 209, 59, 115, 20, 57, 119, |
| 79, 484, 386, 387, 103, 191, 49, 110, 50, 43, |
| 447, 399, 80, 401, 325, 51, 106, 107, 284, 551, |
| 193, 344, 519, 369, 285, 286, 287, 288 |
| }; |
| |
| /* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing |
| STATE-NUM. */ |
| #define YYPACT_NINF -457 |
| static const short int yypact[] = |
| { |
| 49, -457, -457, -457, -457, -457, 8, -107, -9, 255, |
| 61, 188, -457, -7, 113, 165, 33, 38, 51, 69, |
| -457, 17, 95, 1056, -457, -457, -457, -457, -457, -457, |
| -457, -457, -457, -457, 91, 91, 1290, -457, -457, -457, |
| -457, -457, 130, -457, -457, -457, -457, -457, 130, 116, |
| -457, 25, 192, 98, 265, 198, 201, -457, -457, -457, |
| -457, -457, 131, -457, -457, -457, -457, -457, -457, -457, |
| -457, -457, 270, 273, 5, 128, -457, -457, 73, -457, |
| -457, 1290, 1310, 131, 217, 234, 259, 262, 276, 281, |
| 292, 278, 297, 623, -457, 279, -457, -457, -457, -457, |
| -457, -457, 1327, -457, -2, -457, -457, 214, -457, -457, |
| -457, -457, -457, -457, -457, -457, -457, -457, -457, -120, |
| 809, -457, 162, 163, 710, -457, 73, -84, -457, 809, |
| -457, 73, -457, -457, -457, -457, -457, -457, -457, -457, |
| -457, -457, -457, -457, -457, -457, -457, -457, -457, -457, |
| -457, -457, 269, 1007, 167, -457, -457, -457, -457, -457, |
| -457, -457, -457, -457, -457, -457, -457, 168, -457, -457, |
| -457, 169, 171, 172, 75, 1347, 768, 296, 177, 178, |
| 179, 180, -457, -457, 184, -457, 131, 73, 214, -457, |
| -457, -457, 1450, -457, 302, -457, -457, 73, -457, 189, |
| 183, 1310, 1310, 181, -83, 1310, -457, 194, 184, 184, |
| -457, -457, -457, -457, -457, -457, -457, -457, -457, -457, |
| 185, -457, -457, -457, -457, -457, -457, -457, -457, -457, |
| -457, -457, -457, -457, -457, -457, -457, 190, 1290, 1290, |
| 1290, 1290, 1290, -457, -457, -27, 784, -32, -457, -77, |
| -457, 1290, 1290, 1290, 1290, -21, -457, 196, -457, 1310, |
| -457, 282, 1370, 114, 216, 130, -457, -457, 269, 1007, |
| 1310, 1310, 1310, 1310, 1310, 1310, 1310, 1310, 1310, 1310, |
| 1310, 1310, 1310, 1310, -457, 130, -457, 175, -457, -457, |
| 187, 952, -457, 13, -22, -457, 193, 73, -457, -457, |
| -457, 1290, 1290, -457, 203, 205, 206, 207, 1290, -457, |
| 199, 623, -75, -457, -457, 209, 210, 305, 211, 331, |
| 348, -457, 184, 1227, 860, -457, -457, 131, -457, 1003, |
| 1003, -457, -457, -457, -457, 1003, 1327, 1310, 1310, 60, |
| 93, -457, 860, -40, 218, 235, 236, 237, 238, 239, |
| 860, 860, 320, 240, 1327, 1310, 1310, -457, -457, -457, |
| -457, -457, -69, -457, -457, -457, -69, 241, 242, -59, |
| 1290, 1290, 1290, 1290, -457, -457, 208, 1290, 1290, 1310, |
| 1290, -457, -457, -457, -457, 73, 247, 244, -457, -457, |
| -457, -457, -457, -457, -457, -457, 327, 1290, -457, -457, |
| -457, -457, 250, -457, 251, 1003, 860, 860, 2, -457, |
| 19, -457, -457, 1003, 248, 1310, 1310, 1310, 1310, 1310, |
| 252, 254, 1310, 1310, 1003, 860, 260, -457, -457, -457, |
| 1290, 1290, 1310, -457, 261, 266, 264, 271, -457, 272, |
| 274, 45, 275, 10, 1273, -457, -457, 382, -24, 387, |
| 394, 277, 283, 285, 1003, 407, 1003, 288, 289, 1003, |
| 290, 73, -457, 291, 295, 1003, 1003, 73, -457, 293, |
| -457, 1310, 294, 298, -457, 1290, -457, 1290, 1290, -457, |
| -457, -457, -457, -457, -457, -457, 73, -4, 299, -457, |
| 1003, 1003, 1310, 1003, 1003, 301, -457, 301, 1003, 303, |
| 1310, 1310, 1310, -457, -457, 1310, 860, -457, -457, 300, |
| 304, 306, 10, -457, 361, 398, 309, 287, 860, 39, |
| -457, -457, 366, -457, -457, 308, 1003, -457, -457, -457, |
| 40, -457, -457, -457, -457, -457, 430, -457, -457, 426, |
| 23, -457, 1310, -457, -457, 310, -457, -457, 1003, -457, |
| 1135, 27, 187, 860, 12, -457, -69, -457, 312, -457, |
| 1135, -457, 427, 441, 322, 187, 1003, 1003, 444, 389, |
| -457, 1003, 446, -457, 1003, -457 |
| }; |
| |
| /* YYPGOTO[NTERM-NUM]. */ |
| static const short int yypgoto[] = |
| { |
| -457, -457, 284, 311, 316, 318, 200, 197, -262, -457, |
| 360, -457, -457, -457, -457, -222, -355, -377, -457, -282, |
| -457, -327, -17, -457, -167, -457, -457, -23, 182, -286, |
| -457, 345, 351, 129, -87, -172, 256, -457, -457, 469, |
| -457, -457, -457, -457, -457, -457, -457, -457, -457, -457, |
| 1, -31, -457, -457, 435, -457, -457, -457, -457, -457, |
| -457, -456, -1, 121, -257, -457, 433, -457, -457, -457, |
| -457, -457, -20, 74, -457, -457, -457, -457 |
| }; |
| |
| /* 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 -175 |
| static const short int yytable[] = |
| { |
| 78, 13, 335, 247, 249, 328, 182, 428, 443, 123, |
| 319, 428, 13, 411, 454, 341, 366, 194, 345, 346, |
| 347, 348, 349, 189, 195, 352, 353, 319, 1, 21, |
| 2, 456, 320, 331, 332, 333, 334, 331, 332, 333, |
| 334, 299, 300, 336, 105, 562, 357, 358, 22, -174, |
| 405, 108, 126, 205, 205, 455, 16, 17, 18, 131, |
| 308, 37, 308, 354, 206, 296, 427, 1, 424, 2, |
| 3, 314, 455, 376, 312, 19, 4, 5, 432, 187, |
| 60, 61, 433, 83, 84, 85, 86, 87, 88, 89, |
| 90, 70, 183, 1, 558, 2, 6, 197, 128, 426, |
| 129, 126, 413, 7, 564, 308, 197, 8, 13, 512, |
| 308, 357, 358, 308, 313, 58, 128, 309, 129, 71, |
| 24, 25, 489, 329, 364, 357, 358, 357, 358, 39, |
| 330, 427, 428, 60, 61, 105, 83, 63, 64, 65, |
| 66, 67, 68, 69, 70, 190, 1, 427, 2, 113, |
| 114, 128, 124, 129, 40, 383, 41, 363, 460, 56, |
| 462, 463, 464, 487, 552, 94, 468, 549, 523, 52, |
| 524, 559, 71, 109, 53, 474, 542, 542, 293, 294, |
| 543, 546, 297, 128, 565, 129, 481, 54, -173, 257, |
| 95, 96, 97, 98, 99, 100, 101, 408, 128, 428, |
| 129, 428, 44, 45, 46, 55, 1, 47, 2, 3, |
| 130, 128, 112, 129, 72, 4, 5, 73, 117, 243, |
| 74, 118, 75, 311, 182, 448, 331, 332, 333, 334, |
| 410, 128, 1, 129, 2, 6, 324, -60, -60, 324, |
| 132, 133, 7, 527, 528, 529, 8, 339, 340, 324, |
| 342, 343, 324, 324, 324, 324, 324, 350, 351, 324, |
| 324, 554, -59, -59, 556, -58, -58, 72, 197, 116, |
| 73, 120, 23, 74, 121, 75, 125, 122, 550, -57, |
| -57, 134, 135, 185, 24, 25, 355, 356, -61, 560, |
| 81, 82, 26, 27, 28, 29, 30, 31, 32, -62, |
| 385, 33, 357, 358, 136, 201, 202, 238, 239, 240, |
| 183, 241, 242, 187, 406, 407, 250, 251, 252, 253, |
| 254, 255, 289, 400, 292, 301, 291, 295, 400, 400, |
| 302, 187, 425, 324, 400, 298, 323, 326, 379, 365, |
| 370, 400, 371, 372, 373, 375, 377, 378, 380, 400, |
| 400, 381, 382, 422, 438, 414, 441, 210, 211, 212, |
| 213, 214, 215, 216, 217, 218, 219, 303, 304, 305, |
| 306, 307, 415, 416, 417, 418, 419, 423, 430, 431, |
| 315, 316, 317, 318, 444, 445, 446, 449, 450, 465, |
| 459, 466, 324, 461, 324, 324, 324, 471, 475, 467, |
| 324, 477, 488, 490, 400, 400, 400, 476, 478, 324, |
| 491, 496, 400, 479, 536, 480, 482, 492, 538, 455, |
| 493, 486, 494, 400, 400, 432, 498, 500, 501, 540, |
| 367, 368, 502, 505, 547, 507, 515, 374, 522, 508, |
| 526, 532, 548, 566, 483, 533, 539, 534, 506, 563, |
| 402, 403, 544, 400, 555, 400, 404, 567, 400, 568, |
| 571, 572, 574, 412, 400, 400, 338, 192, 337, 518, |
| 513, 420, 421, 361, 207, 204, 280, 324, 324, 324, |
| 38, 535, 518, 104, 111, 530, 457, 0, 0, 400, |
| 400, 0, 400, 400, 0, 0, 0, 400, 0, 434, |
| 435, 436, 437, 281, 0, 400, 439, 440, 282, 442, |
| 283, 0, 0, 483, 0, 0, 0, 400, 0, 553, |
| 0, 0, 0, 0, 0, 400, 451, 452, 453, 0, |
| 0, 0, 0, 0, 458, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 469, 470, 400, 0, 0, |
| 0, 0, 400, 0, 0, 0, 0, 0, 0, 472, |
| 473, 0, 0, 0, 0, 400, 400, 0, 0, 0, |
| 400, 0, 0, 400, 0, 495, 0, 497, 0, 0, |
| 499, 0, 0, 0, 0, 0, 503, 504, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 509, 0, 510, 511, 0, 0, |
| 0, 516, 517, 0, 520, 521, 0, 0, 0, 525, |
| 0, 0, 0, 0, 0, 0, 0, 531, 60, 61, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 541, |
| 0, 1, 0, 2, 0, 137, 0, 545, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 138, 139, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 557, |
| 0, 0, 0, 0, 561, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 569, 570, 0, |
| 0, 0, 573, 0, 0, 575, 0, 140, 141, 142, |
| 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, |
| 153, 0, 0, 0, 0, 60, 61, 0, 83, 63, |
| 64, 65, 66, 67, 68, 69, 70, 0, 1, 0, |
| 2, 0, 0, 0, 0, 0, 154, 155, 156, 157, |
| 158, 159, 160, 161, 162, 163, 164, 165, 166, 0, |
| 167, 168, 169, 170, 71, 171, 172, 173, 0, 0, |
| 0, 128, 0, 129, 0, 174, 0, 0, 175, 0, |
| 176, 0, 177, 60, 61, 0, 83, 84, 85, 86, |
| 87, 88, 89, 90, 70, 0, 1, 0, 2, 60, |
| 61, 0, 83, 84, 85, 86, 87, 88, 89, 90, |
| 70, 0, 1, 0, 2, 0, 0, 0, 0, 0, |
| 0, 0, 71, 0, 60, 61, 0, 83, 63, 64, |
| 65, 66, 67, 68, 69, 70, 0, 1, 71, 2, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 0, 0, 0, 196, 0, 0, 0, 0, 0, 72, |
| 0, 0, 73, 71, 0, 74, 0, 75, 203, 0, |
| 0, 0, 0, 388, 389, 60, 61, 390, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, |
| 2, 0, 391, 392, 393, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 394, 395, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 72, 0, 0, |
| 73, 0, 0, 74, 0, 75, 248, 396, 0, 0, |
| 0, 0, 0, 72, 0, 0, 73, 0, 0, 74, |
| 0, 75, 310, 0, 140, 141, 142, 143, 144, 145, |
| 146, 147, 148, 149, 150, 151, 152, 153, 72, 0, |
| 0, 73, 0, 0, 74, 0, 75, 60, 61, 0, |
| 83, 63, 64, 65, 66, 67, 68, 69, 70, 0, |
| 1, 0, 2, 154, 155, 156, 157, 158, 159, 160, |
| 161, 162, 163, 164, 165, 166, 360, 167, 168, 169, |
| 170, 0, 171, 172, 173, 0, 71, 0, 128, 0, |
| 129, 0, 0, 0, 0, 397, 388, 389, 60, 61, |
| 390, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 0, 1, 0, 2, 0, 391, 392, 393, 0, 0, |
| 221, 222, 0, 0, 0, 0, 0, 0, 394, 395, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 396, 60, 61, 0, 62, 63, 64, 65, 66, 67, |
| 68, 69, 70, 0, 1, 0, 2, 140, 141, 142, |
| 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, |
| 153, 72, 0, 0, 73, 0, 0, 74, 0, 75, |
| 71, 223, 224, 225, 226, 227, 228, 229, 230, 231, |
| 232, 233, 234, 235, 236, 0, 154, 155, 156, 157, |
| 158, 159, 160, 161, 162, 163, 164, 165, 166, 0, |
| 167, 168, 169, 170, 0, 171, 172, 173, 388, 389, |
| 0, 0, 390, 0, 0, 0, 0, 0, 397, 0, |
| 0, 0, 0, 0, 0, 0, 0, 391, 392, 393, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 394, 395, 0, 0, 0, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 0, 0, 396, 0, 0, 72, 0, 0, 73, 0, |
| 0, 74, 0, 75, 0, 0, 0, 0, 0, 140, |
| 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, |
| 151, 152, 153, 0, 0, 0, 0, 0, 0, 0, |
| 0, 0, 60, 61, 0, 83, 63, 64, 65, 66, |
| 67, 68, 69, 70, 0, 1, 0, 2, 154, 155, |
| 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, |
| 166, 384, 167, 168, 169, 170, 0, 171, 172, 173, |
| 0, 71, 0, 0, 0, 0, 0, 0, 60, 61, |
| 397, 83, 63, 64, 65, 66, 67, 68, 69, 70, |
| 0, 1, 0, 2, 0, 60, 61, 0, 83, 84, |
| 85, 86, 87, 88, 89, 90, 70, 485, 1, 0, |
| 2, 0, 0, 0, 0, 60, 61, 71, 83, 63, |
| 64, 65, 66, 67, 68, 69, 70, 0, 1, 0, |
| 2, 0, 60, 61, 71, 186, 63, 64, 65, 66, |
| 67, 68, 69, 70, 0, 1, 0, 2, 0, 0, |
| 0, 0, 60, 61, 71, 83, 84, 85, 86, 87, |
| 88, 89, 90, 70, 0, 1, 72, 2, 0, 73, |
| 0, 71, 74, 0, 75, 60, 61, 0, 327, 63, |
| 64, 65, 66, 67, 68, 69, 70, 0, 1, 0, |
| 2, 71, 0, 0, 0, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 0, 0, 72, 0, 71, 73, 0, 0, 74, 0, |
| 75, 0, 0, 0, 0, 0, 0, 0, 0, 72, |
| 0, 0, 73, 0, 0, 74, 0, 75, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 72, |
| 0, 0, 73, 0, 0, 74, 0, 75, 0, 0, |
| 0, 0, 0, 0, 0, 0, 72, 0, 0, 73, |
| 0, 0, 74, 0, 75, 0, 0, 0, 0, 0, |
| 0, 0, 258, 0, 0, 0, 72, 0, 0, 73, |
| 0, 0, 74, 0, 246, 259, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 260, 261, 0, 0, 72, |
| 0, 0, 73, 0, 0, 74, 0, 75, 262, 263, |
| 264, 265, 266, 267, 140, 141, 142, 143, 144, 145, |
| 146, 147, 148, 149, 150, 151, 268, 269, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 270, 271, |
| 272, 0, 0, 273, 155, 156, 157, 158, 159, 160, |
| 161, 162, 163, 164, 165, 166, 274, 275, 168, 169, |
| 170, 276, 277, 278, 279 |
| }; |
| |
| static const short int yycheck[] = |
| { |
| 23, 0, 264, 175, 176, 262, 93, 362, 385, 4, |
| 31, 366, 11, 340, 12, 272, 298, 137, 275, 276, |
| 277, 278, 279, 25, 144, 282, 283, 31, 18, 136, |
| 20, 12, 53, 10, 11, 12, 13, 10, 11, 12, |
| 13, 208, 209, 265, 19, 33, 115, 116, 57, 0, |
| 336, 26, 75, 137, 137, 53, 48, 49, 50, 82, |
| 137, 0, 137, 285, 148, 148, 135, 18, 354, 20, |
| 21, 148, 53, 148, 246, 67, 27, 28, 137, 102, |
| 5, 6, 141, 8, 9, 10, 11, 12, 13, 14, |
| 15, 16, 93, 18, 550, 20, 47, 120, 138, 356, |
| 140, 124, 142, 54, 560, 137, 129, 58, 107, 486, |
| 137, 115, 116, 137, 146, 20, 138, 144, 140, 44, |
| 29, 30, 146, 9, 146, 115, 116, 115, 116, 136, |
| 16, 135, 487, 5, 6, 19, 8, 9, 10, 11, |
| 12, 13, 14, 15, 16, 147, 18, 135, 20, 51, |
| 52, 138, 147, 140, 41, 322, 43, 144, 415, 142, |
| 417, 418, 419, 445, 541, 36, 423, 144, 495, 136, |
| 497, 144, 44, 148, 136, 432, 137, 137, 201, 202, |
| 141, 141, 205, 138, 561, 140, 141, 136, 0, 188, |
| 60, 61, 62, 63, 64, 65, 66, 137, 138, 554, |
| 140, 556, 37, 38, 39, 136, 18, 42, 20, 21, |
| 81, 138, 20, 140, 139, 27, 28, 142, 20, 144, |
| 145, 20, 147, 246, 311, 397, 10, 11, 12, 13, |
| 137, 138, 18, 140, 20, 47, 259, 3, 4, 262, |
| 23, 24, 54, 500, 501, 502, 58, 270, 271, 272, |
| 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, |
| 283, 543, 3, 4, 546, 3, 4, 139, 291, 4, |
| 142, 140, 17, 145, 4, 147, 148, 4, 540, 3, |
| 4, 3, 4, 4, 29, 30, 111, 112, 7, 551, |
| 34, 35, 37, 38, 39, 40, 41, 42, 43, 7, |
| 323, 46, 115, 116, 7, 143, 143, 140, 140, 140, |
| 311, 140, 140, 336, 337, 338, 20, 140, 140, 140, |
| 140, 137, 20, 324, 141, 140, 137, 146, 329, 330, |
| 140, 354, 355, 356, 335, 141, 140, 55, 33, 146, |
| 137, 342, 137, 137, 137, 146, 137, 137, 137, 350, |
| 351, 20, 4, 33, 146, 137, 379, 88, 89, 90, |
| 91, 92, 93, 94, 95, 96, 97, 238, 239, 240, |
| 241, 242, 137, 137, 137, 137, 137, 137, 137, 137, |
| 251, 252, 253, 254, 137, 141, 59, 137, 137, 137, |
| 142, 137, 415, 416, 417, 418, 419, 137, 137, 422, |
| 423, 137, 20, 16, 405, 406, 407, 141, 137, 432, |
| 16, 4, 413, 141, 53, 141, 141, 140, 20, 53, |
| 137, 444, 137, 424, 425, 137, 137, 137, 137, 142, |
| 301, 302, 137, 140, 4, 141, 137, 308, 137, 141, |
| 137, 141, 16, 16, 443, 141, 137, 141, 471, 137, |
| 329, 330, 144, 454, 144, 456, 335, 16, 459, 137, |
| 16, 72, 16, 342, 465, 466, 269, 107, 268, 492, |
| 487, 350, 351, 291, 129, 124, 192, 500, 501, 502, |
| 11, 512, 505, 48, 51, 505, 412, -1, -1, 490, |
| 491, -1, 493, 494, -1, -1, -1, 498, -1, 370, |
| 371, 372, 373, 192, -1, 506, 377, 378, 192, 380, |
| 192, -1, -1, 512, -1, -1, -1, 518, -1, 542, |
| -1, -1, -1, -1, -1, 526, 405, 406, 407, -1, |
| -1, -1, -1, -1, 413, -1, -1, -1, -1, -1, |
| -1, -1, -1, -1, -1, 424, 425, 548, -1, -1, |
| -1, -1, 553, -1, -1, -1, -1, -1, -1, 430, |
| 431, -1, -1, -1, -1, 566, 567, -1, -1, -1, |
| 571, -1, -1, 574, -1, 454, -1, 456, -1, -1, |
| 459, -1, -1, -1, -1, -1, 465, 466, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| -1, -1, -1, -1, 475, -1, 477, 478, -1, -1, |
| -1, 490, 491, -1, 493, 494, -1, -1, -1, 498, |
| -1, -1, -1, -1, -1, -1, -1, 506, 5, 6, |
| -1, -1, -1, -1, -1, -1, -1, -1, -1, 518, |
| -1, 18, -1, 20, -1, 22, -1, 526, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, -1, 35, 36, |
| -1, -1, -1, -1, -1, -1, -1, -1, -1, 548, |
| -1, -1, -1, -1, 553, -1, -1, -1, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, 566, 567, -1, |
| -1, -1, 571, -1, -1, 574, -1, 74, 75, 76, |
| 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, |
| 87, -1, -1, -1, -1, 5, 6, -1, 8, 9, |
| 10, 11, 12, 13, 14, 15, 16, -1, 18, -1, |
| 20, -1, -1, -1, -1, -1, 113, 114, 115, 116, |
| 117, 118, 119, 120, 121, 122, 123, 124, 125, -1, |
| 127, 128, 129, 130, 44, 132, 133, 134, -1, -1, |
| -1, 138, -1, 140, -1, 142, -1, -1, 145, -1, |
| 147, -1, 149, 5, 6, -1, 8, 9, 10, 11, |
| 12, 13, 14, 15, 16, -1, 18, -1, 20, 5, |
| 6, -1, 8, 9, 10, 11, 12, 13, 14, 15, |
| 16, -1, 18, -1, 20, -1, -1, -1, -1, -1, |
| -1, -1, 44, -1, 5, 6, -1, 8, 9, 10, |
| 11, 12, 13, 14, 15, 16, -1, 18, 44, 20, |
| -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| -1, -1, -1, 34, -1, -1, -1, -1, -1, 139, |
| -1, -1, 142, 44, -1, 145, -1, 147, 148, -1, |
| -1, -1, -1, 3, 4, 5, 6, 7, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, -1, 18, -1, |
| 20, -1, 22, 23, 24, -1, -1, -1, -1, -1, |
| -1, -1, -1, -1, -1, 35, 36, -1, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, 139, -1, -1, |
| 142, -1, -1, 145, -1, 147, 148, 57, -1, -1, |
| -1, -1, -1, 139, -1, -1, 142, -1, -1, 145, |
| -1, 147, 148, -1, 74, 75, 76, 77, 78, 79, |
| 80, 81, 82, 83, 84, 85, 86, 87, 139, -1, |
| -1, 142, -1, -1, 145, -1, 147, 5, 6, -1, |
| 8, 9, 10, 11, 12, 13, 14, 15, 16, -1, |
| 18, -1, 20, 113, 114, 115, 116, 117, 118, 119, |
| 120, 121, 122, 123, 124, 125, 34, 127, 128, 129, |
| 130, -1, 132, 133, 134, -1, 44, -1, 138, -1, |
| 140, -1, -1, -1, -1, 145, 3, 4, 5, 6, |
| 7, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| -1, 18, -1, 20, -1, 22, 23, 24, -1, -1, |
| 23, 24, -1, -1, -1, -1, -1, -1, 35, 36, |
| -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| 57, 5, 6, -1, 8, 9, 10, 11, 12, 13, |
| 14, 15, 16, -1, 18, -1, 20, 74, 75, 76, |
| 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, |
| 87, 139, -1, -1, 142, -1, -1, 145, -1, 147, |
| 44, 94, 95, 96, 97, 98, 99, 100, 101, 102, |
| 103, 104, 105, 106, 107, -1, 113, 114, 115, 116, |
| 117, 118, 119, 120, 121, 122, 123, 124, 125, -1, |
| 127, 128, 129, 130, -1, 132, 133, 134, 3, 4, |
| -1, -1, 7, -1, -1, -1, -1, -1, 145, -1, |
| -1, -1, -1, -1, -1, -1, -1, 22, 23, 24, |
| -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| 35, 36, -1, -1, -1, -1, -1, -1, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| -1, -1, 57, -1, -1, 139, -1, -1, 142, -1, |
| -1, 145, -1, 147, -1, -1, -1, -1, -1, 74, |
| 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, |
| 85, 86, 87, -1, -1, -1, -1, -1, -1, -1, |
| -1, -1, 5, 6, -1, 8, 9, 10, 11, 12, |
| 13, 14, 15, 16, -1, 18, -1, 20, 113, 114, |
| 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, |
| 125, 34, 127, 128, 129, 130, -1, 132, 133, 134, |
| -1, 44, -1, -1, -1, -1, -1, -1, 5, 6, |
| 145, 8, 9, 10, 11, 12, 13, 14, 15, 16, |
| -1, 18, -1, 20, -1, 5, 6, -1, 8, 9, |
| 10, 11, 12, 13, 14, 15, 16, 34, 18, -1, |
| 20, -1, -1, -1, -1, 5, 6, 44, 8, 9, |
| 10, 11, 12, 13, 14, 15, 16, -1, 18, -1, |
| 20, -1, 5, 6, 44, 8, 9, 10, 11, 12, |
| 13, 14, 15, 16, -1, 18, -1, 20, -1, -1, |
| -1, -1, 5, 6, 44, 8, 9, 10, 11, 12, |
| 13, 14, 15, 16, -1, 18, 139, 20, -1, 142, |
| -1, 44, 145, -1, 147, 5, 6, -1, 8, 9, |
| 10, 11, 12, 13, 14, 15, 16, -1, 18, -1, |
| 20, 44, -1, -1, -1, -1, -1, -1, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| -1, -1, 139, -1, 44, 142, -1, -1, 145, -1, |
| 147, -1, -1, -1, -1, -1, -1, -1, -1, 139, |
| -1, -1, 142, -1, -1, 145, -1, 147, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, -1, -1, 139, |
| -1, -1, 142, -1, -1, 145, -1, 147, -1, -1, |
| -1, -1, -1, -1, -1, -1, 139, -1, -1, 142, |
| -1, -1, 145, -1, 147, -1, -1, -1, -1, -1, |
| -1, -1, 32, -1, -1, -1, 139, -1, -1, 142, |
| -1, -1, 145, -1, 147, 45, -1, -1, -1, -1, |
| -1, -1, -1, -1, -1, 55, 56, -1, -1, 139, |
| -1, -1, 142, -1, -1, 145, -1, 147, 68, 69, |
| 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, |
| 80, 81, 82, 83, 84, 85, 86, 87, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, -1, 108, 109, |
| 110, -1, -1, 113, 114, 115, 116, 117, 118, 119, |
| 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, |
| 130, 131, 132, 133, 134 |
| }; |
| |
| /* YYSTOS[STATE-NUM] -- The (internal number of the) accessing |
| symbol of state STATE-NUM. */ |
| static const unsigned char yystos[] = |
| { |
| 0, 18, 20, 21, 27, 28, 47, 54, 58, 160, |
| 187, 188, 189, 200, 191, 190, 48, 49, 50, 67, |
| 197, 136, 57, 17, 29, 30, 37, 38, 39, 40, |
| 41, 42, 43, 46, 161, 162, 186, 0, 189, 136, |
| 41, 43, 163, 209, 37, 38, 39, 42, 164, 206, |
| 208, 215, 136, 136, 136, 136, 142, 198, 20, 195, |
| 5, 6, 8, 9, 10, 11, 12, 13, 14, 15, |
| 16, 44, 139, 142, 145, 147, 151, 176, 177, 200, |
| 212, 186, 186, 8, 9, 10, 11, 12, 13, 14, |
| 15, 158, 159, 177, 183, 60, 61, 62, 63, 64, |
| 65, 66, 165, 204, 204, 19, 216, 217, 26, 148, |
| 207, 216, 20, 51, 52, 196, 4, 20, 20, 199, |
| 140, 4, 4, 4, 147, 148, 177, 182, 138, 140, |
| 183, 177, 23, 24, 3, 4, 7, 22, 35, 36, |
| 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, |
| 84, 85, 86, 87, 113, 114, 115, 116, 117, 118, |
| 119, 120, 121, 122, 123, 124, 125, 127, 128, 129, |
| 130, 132, 133, 134, 142, 145, 147, 149, 152, 153, |
| 154, 155, 184, 212, 192, 4, 8, 177, 179, 25, |
| 147, 205, 160, 220, 137, 144, 34, 177, 178, 180, |
| 181, 143, 143, 148, 182, 137, 148, 181, 193, 194, |
| 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, |
| 156, 23, 24, 94, 95, 96, 97, 98, 99, 100, |
| 101, 102, 103, 104, 105, 106, 107, 157, 140, 140, |
| 140, 140, 140, 144, 183, 185, 147, 185, 148, 185, |
| 20, 140, 140, 140, 140, 137, 174, 200, 32, 45, |
| 55, 56, 68, 69, 70, 71, 72, 73, 86, 87, |
| 108, 109, 110, 113, 126, 127, 131, 132, 133, 134, |
| 152, 153, 154, 155, 218, 224, 225, 226, 227, 20, |
| 167, 137, 141, 177, 177, 146, 148, 177, 141, 174, |
| 174, 140, 140, 183, 183, 183, 183, 183, 137, 144, |
| 148, 177, 185, 146, 148, 183, 183, 183, 183, 31, |
| 53, 172, 175, 140, 177, 214, 55, 8, 214, 9, |
| 16, 10, 11, 12, 13, 158, 165, 156, 157, 177, |
| 177, 214, 177, 177, 221, 214, 214, 214, 214, 214, |
| 177, 177, 214, 214, 165, 111, 112, 115, 116, 166, |
| 34, 178, 169, 144, 146, 146, 169, 183, 183, 223, |
| 137, 137, 137, 137, 183, 146, 148, 137, 137, 33, |
| 137, 20, 4, 174, 34, 177, 202, 203, 3, 4, |
| 7, 22, 23, 24, 35, 36, 57, 145, 184, 211, |
| 212, 213, 213, 213, 213, 179, 177, 177, 137, 171, |
| 137, 171, 213, 142, 137, 137, 137, 137, 137, 137, |
| 213, 213, 33, 137, 179, 177, 214, 135, 166, 168, |
| 137, 137, 137, 141, 183, 183, 183, 183, 146, 183, |
| 183, 177, 183, 167, 137, 141, 59, 210, 185, 137, |
| 137, 213, 213, 213, 12, 53, 12, 223, 213, 142, |
| 214, 177, 214, 214, 214, 137, 137, 177, 214, 213, |
| 213, 137, 183, 183, 214, 137, 141, 137, 137, 141, |
| 141, 141, 141, 200, 201, 34, 177, 169, 20, 146, |
| 16, 16, 140, 137, 137, 213, 4, 213, 137, 213, |
| 137, 137, 137, 213, 213, 140, 177, 141, 141, 183, |
| 183, 183, 167, 172, 173, 137, 213, 213, 177, 222, |
| 213, 213, 137, 171, 171, 213, 137, 214, 214, 214, |
| 222, 213, 141, 141, 141, 201, 53, 170, 20, 137, |
| 142, 213, 137, 141, 144, 213, 141, 4, 16, 144, |
| 158, 219, 167, 177, 169, 144, 169, 213, 211, 144, |
| 158, 213, 33, 137, 211, 167, 16, 16, 137, 213, |
| 213, 16, 72, 213, 16, 213 |
| }; |
| |
| #define yyerrok (yyerrstatus = 0) |
| #define yyclearin (yychar = YYEMPTY) |
| #define YYEMPTY (-2) |
| #define YYEOF 0 |
| |
| #define YYACCEPT goto yyacceptlab |
| #define YYABORT goto yyabortlab |
| #define YYERROR goto yyerrorlab |
| |
| |
| /* Like YYERROR except do call yyerror. This remains here temporarily |
| to ease the transition to the new meaning of YYERROR, for GCC. |
| Once GCC version 2 has supplanted version 1, this can go. */ |
| |
| #define YYFAIL goto yyerrlab |
| |
| #define YYRECOVERING() (!!yyerrstatus) |
| |
| #define YYBACKUP(Token, Value) \ |
| do \ |
| if (yychar == YYEMPTY && yylen == 1) \ |
| { \ |
| yychar = (Token); \ |
| yylval = (Value); \ |
| yytoken = YYTRANSLATE (yychar); \ |
| YYPOPSTACK; \ |
| goto yybackup; \ |
| } \ |
| else \ |
| { \ |
| yyerror (YY_("syntax error: cannot back up")); \ |
| YYERROR; \ |
| } \ |
| while (0) |
| |
| |
| #define YYTERROR 1 |
| #define YYERRCODE 256 |
| |
| |
| /* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N]. |
| If N is 0, then set CURRENT to the empty location which ends |
| the previous symbol: RHS[0] (always defined). */ |
| |
| #define YYRHSLOC(Rhs, K) ((Rhs)[K]) |
| #ifndef YYLLOC_DEFAULT |
| # define YYLLOC_DEFAULT(Current, Rhs, N) \ |
| do \ |
| if (N) \ |
| { \ |
| (Current).first_line = YYRHSLOC (Rhs, 1).first_line; \ |
| (Current).first_column = YYRHSLOC (Rhs, 1).first_column; \ |
| (Current).last_line = YYRHSLOC (Rhs, N).last_line; \ |
| (Current).last_column = YYRHSLOC (Rhs, N).last_column; \ |
| } \ |
| else \ |
| { \ |
| (Current).first_line = (Current).last_line = \ |
| YYRHSLOC (Rhs, 0).last_line; \ |
| (Current).first_column = (Current).last_column = \ |
| YYRHSLOC (Rhs, 0).last_column; \ |
| } \ |
| while (0) |
| #endif |
| |
| |
| /* YY_LOCATION_PRINT -- Print the location on the stream. |
| This macro was not mandated originally: define only if we know |
| we won't break user code: when these are the locations we know. */ |
| |
| #ifndef YY_LOCATION_PRINT |
| # if YYLTYPE_IS_TRIVIAL |
| # define YY_LOCATION_PRINT(File, Loc) \ |
| fprintf (File, "%d.%d-%d.%d", \ |
| (Loc).first_line, (Loc).first_column, \ |
| (Loc).last_line, (Loc).last_column) |
| # else |
| # define YY_LOCATION_PRINT(File, Loc) ((void) 0) |
| # endif |
| #endif |
| |
| |
| /* YYLEX -- calling `yylex' with the right arguments. */ |
| |
| #ifdef YYLEX_PARAM |
| # define YYLEX yylex (YYLEX_PARAM) |
| #else |
| # define YYLEX yylex () |
| #endif |
| |
| /* Enable debugging if requested. */ |
| #if YYDEBUG |
| |
| # ifndef YYFPRINTF |
| # include <stdio.h> /* INFRINGES ON USER NAME SPACE */ |
| # define YYFPRINTF fprintf |
| # endif |
| |
| # define YYDPRINTF(Args) \ |
| do { \ |
| if (yydebug) \ |
| YYFPRINTF Args; \ |
| } while (0) |
| |
| # define YY_SYMBOL_PRINT(Title, Type, Value, Location) \ |
| do { \ |
| if (yydebug) \ |
| { \ |
| YYFPRINTF (stderr, "%s ", Title); \ |
| yysymprint (stderr, \ |
| Type, Value); \ |
| YYFPRINTF (stderr, "\n"); \ |
| } \ |
| } while (0) |
| |
| /*------------------------------------------------------------------. |
| | yy_stack_print -- Print the state stack from its BOTTOM up to its | |
| | TOP (included). | |
| `------------------------------------------------------------------*/ |
| |
| #if defined (__STDC__) || defined (__cplusplus) |
| static void |
| yy_stack_print (short int *bottom, short int *top) |
| #else |
| static void |
| yy_stack_print (bottom, top) |
| short int *bottom; |
| short int *top; |
| #endif |
| { |
| YYFPRINTF (stderr, "Stack now"); |
| for (/* Nothing. */; bottom <= top; ++bottom) |
| YYFPRINTF (stderr, " %d", *bottom); |
| YYFPRINTF (stderr, "\n"); |
| } |
| |
| # define YY_STACK_PRINT(Bottom, Top) \ |
| do { \ |
| if (yydebug) \ |
| yy_stack_print ((Bottom), (Top)); \ |
| } while (0) |
| |
| |
| /*------------------------------------------------. |
| | Report that the YYRULE is going to be reduced. | |
| `------------------------------------------------*/ |
| |
| #if defined (__STDC__) || defined (__cplusplus) |
| static void |
| yy_reduce_print (int yyrule) |
| #else |
| static void |
| yy_reduce_print (yyrule) |
| int yyrule; |
| #endif |
| { |
| int yyi; |
| unsigned long int yylno = yyrline[yyrule]; |
| YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu), ", |
| yyrule - 1, yylno); |
| /* Print the symbols being reduced, and their result. */ |
| for (yyi = yyprhs[yyrule]; 0 <= yyrhs[yyi]; yyi++) |
| YYFPRINTF (stderr, "%s ", yytname[yyrhs[yyi]]); |
| YYFPRINTF (stderr, "-> %s\n", yytname[yyr1[yyrule]]); |
| } |
| |
| # define YY_REDUCE_PRINT(Rule) \ |
| do { \ |
| if (yydebug) \ |
| yy_reduce_print (Rule); \ |
| } while (0) |
| |
| /* Nonzero means print parse trace. It is left uninitialized so that |
| multiple parsers can coexist. */ |
| int yydebug; |
| #else /* !YYDEBUG */ |
| # define YYDPRINTF(Args) |
| # define YY_SYMBOL_PRINT(Title, Type, Value, Location) |
| # define YY_STACK_PRINT(Bottom, Top) |
| # define YY_REDUCE_PRINT(Rule) |
| #endif /* !YYDEBUG */ |
| |
| |
| /* YYINITDEPTH -- initial size of the parser's stacks. */ |
| #ifndef YYINITDEPTH |
| # define YYINITDEPTH 200 |
| #endif |
| |
| /* YYMAXDEPTH -- maximum size the stacks can grow to (effective only |
| if the built-in stack extension method is used). |
| |
| Do not make this value too large; the results are undefined if |
| YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH) |
| evaluated with infinite-precision integer arithmetic. */ |
| |
| #ifndef YYMAXDEPTH |
| # define YYMAXDEPTH 10000 |
| #endif |
| |
| |
| |
| #if YYERROR_VERBOSE |
| |
| # ifndef yystrlen |
| # if defined (__GLIBC__) && defined (_STRING_H) |
| # define yystrlen strlen |
| # else |
| /* Return the length of YYSTR. */ |
| static YYSIZE_T |
| # if defined (__STDC__) || defined (__cplusplus) |
| yystrlen (const char *yystr) |
| # else |
| yystrlen (yystr) |
| const char *yystr; |
| # endif |
| { |
| const char *yys = yystr; |
| |
| while (*yys++ != '\0') |
| continue; |
| |
| return yys - yystr - 1; |
| } |
| # endif |
| # endif |
| |
| # ifndef yystpcpy |
| # if defined (__GLIBC__) && defined (_STRING_H) && defined (_GNU_SOURCE) |
| # define yystpcpy stpcpy |
| # else |
| /* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in |
| YYDEST. */ |
| static char * |
| # if defined (__STDC__) || defined (__cplusplus) |
| yystpcpy (char *yydest, const char *yysrc) |
| # else |
| yystpcpy (yydest, yysrc) |
| char *yydest; |
| const char *yysrc; |
| # endif |
| { |
| char *yyd = yydest; |
| const char *yys = yysrc; |
| |
| while ((*yyd++ = *yys++) != '\0') |
| continue; |
| |
| return yyd - 1; |
| } |
| # endif |
| # endif |
| |
| # ifndef yytnamerr |
| /* Copy to YYRES the contents of YYSTR after stripping away unnecessary |
| quotes and backslashes, so that it's suitable for yyerror. The |
| heuristic is that double-quoting is unnecessary unless the string |
| contains an apostrophe, a comma, or backslash (other than |
| backslash-backslash). YYSTR is taken from yytname. If YYRES is |
| null, do not copy; instead, return the length of what the result |
| would have been. */ |
| static YYSIZE_T |
| yytnamerr (char *yyres, const char *yystr) |
| { |
| if (*yystr == '"') |
| { |
| size_t yyn = 0; |
| char const *yyp = yystr; |
| |
| for (;;) |
| switch (*++yyp) |
| { |
| case '\'': |
| case ',': |
| goto do_not_strip_quotes; |
| |
| case '\\': |
| if (*++yyp != '\\') |
| goto do_not_strip_quotes; |
| /* Fall through. */ |
| default: |
| if (yyres) |
| yyres[yyn] = *yyp; |
| yyn++; |
| break; |
| |
| case '"': |
| if (yyres) |
| yyres[yyn] = '\0'; |
| return yyn; |
| } |
| do_not_strip_quotes: ; |
| } |
| |
| if (! yyres) |
| return yystrlen (yystr); |
| |
| return yystpcpy (yyres, yystr) - yyres; |
| } |
| # endif |
| |
| #endif /* YYERROR_VERBOSE */ |
| |
| |
| |
| #if YYDEBUG |
| /*--------------------------------. |
| | Print this symbol on YYOUTPUT. | |
| `--------------------------------*/ |
| |
| #if defined (__STDC__) || defined (__cplusplus) |
| static void |
| yysymprint (FILE *yyoutput, int yytype, YYSTYPE *yyvaluep) |
| #else |
| static void |
| yysymprint (yyoutput, yytype, yyvaluep) |
| FILE *yyoutput; |
| int yytype; |
| YYSTYPE *yyvaluep; |
| #endif |
| { |
| /* Pacify ``unused variable'' warnings. */ |
| (void) yyvaluep; |
| |
| if (yytype < YYNTOKENS) |
| YYFPRINTF (yyoutput, "token %s (", yytname[yytype]); |
| else |
| YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]); |
| |
| |
| # ifdef YYPRINT |
| if (yytype < YYNTOKENS) |
| YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep); |
| # endif |
| switch (yytype) |
| { |
| default: |
| break; |
| } |
| YYFPRINTF (yyoutput, ")"); |
| } |
| |
| #endif /* ! YYDEBUG */ |
| /*-----------------------------------------------. |
| | Release the memory associated to this symbol. | |
| `-----------------------------------------------*/ |
| |
| #if defined (__STDC__) || defined (__cplusplus) |
| static void |
| yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep) |
| #else |
| static void |
| yydestruct (yymsg, yytype, yyvaluep) |
| const char *yymsg; |
| int yytype; |
| YYSTYPE *yyvaluep; |
| #endif |
| { |
| /* Pacify ``unused variable'' warnings. */ |
| (void) yyvaluep; |
| |
| if (!yymsg) |
| yymsg = "Deleting"; |
| YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp); |
| |
| switch (yytype) |
| { |
| |
| default: |
| break; |
| } |
| } |
| |
| |
| /* Prevent warnings from -Wmissing-prototypes. */ |
| |
| #ifdef YYPARSE_PARAM |
| # if defined (__STDC__) || defined (__cplusplus) |
| int yyparse (void *YYPARSE_PARAM); |
| # else |
| int yyparse (); |
| # endif |
| #else /* ! YYPARSE_PARAM */ |
| #if defined (__STDC__) || defined (__cplusplus) |
| int yyparse (void); |
| #else |
| int yyparse (); |
| #endif |
| #endif /* ! YYPARSE_PARAM */ |
| |
| |
| |
| /* The look-ahead symbol. */ |
| int yychar; |
| |
| /* The semantic value of the look-ahead symbol. */ |
| YYSTYPE yylval; |
| |
| /* Number of syntax errors so far. */ |
| int yynerrs; |
| |
| |
| |
| /*----------. |
| | yyparse. | |
| `----------*/ |
| |
| #ifdef YYPARSE_PARAM |
| # if defined (__STDC__) || defined (__cplusplus) |
| int yyparse (void *YYPARSE_PARAM) |
| # else |
| int yyparse (YYPARSE_PARAM) |
| void *YYPARSE_PARAM; |
| # endif |
| #else /* ! YYPARSE_PARAM */ |
| #if defined (__STDC__) || defined (__cplusplus) |
| int |
| yyparse (void) |
| #else |
| int |
| yyparse () |
| |
| #endif |
| #endif |
| { |
| |
| int yystate; |
| int yyn; |
| int yyresult; |
| /* Number of tokens to shift before error messages enabled. */ |
| int yyerrstatus; |
| /* Look-ahead token as an internal (translated) token number. */ |
| int yytoken = 0; |
| |
| /* Three stacks and their tools: |
| `yyss': related to states, |
| `yyvs': related to semantic values, |
| `yyls': related to locations. |
| |
| Refer to the stacks thru separate pointers, to allow yyoverflow |
| to reallocate them elsewhere. */ |
| |
| /* The state stack. */ |
| short int yyssa[YYINITDEPTH]; |
| short int *yyss = yyssa; |
| short int *yyssp; |
| |
| /* The semantic value stack. */ |
| YYSTYPE yyvsa[YYINITDEPTH]; |
| YYSTYPE *yyvs = yyvsa; |
| YYSTYPE *yyvsp; |
| |
| |
| |
| #define YYPOPSTACK (yyvsp--, yyssp--) |
| |
| YYSIZE_T yystacksize = YYINITDEPTH; |
| |
| /* The variables used to return semantic value and location from the |
| action routines. */ |
| YYSTYPE yyval; |
| |
| |
| /* When reducing, the number of symbols on the RHS of the reduced |
| rule. */ |
| int yylen; |
| |
| YYDPRINTF ((stderr, "Starting parse\n")); |
| |
| yystate = 0; |
| yyerrstatus = 0; |
| yynerrs = 0; |
| yychar = YYEMPTY; /* Cause a token to be read. */ |
| |
| /* Initialize stack pointers. |
| Waste one element of value and location stack |
| so that they stay on the same level as the state stack. |
| The wasted elements are never initialized. */ |
| |
| yyssp = yyss; |
| yyvsp = yyvs; |
| |
| goto yysetstate; |
| |
| /*------------------------------------------------------------. |
| | yynewstate -- Push a new state, which is found in yystate. | |
| `------------------------------------------------------------*/ |
| yynewstate: |
| /* In all cases, when you get here, the value and location stacks |
| have just been pushed. so pushing a state here evens the stacks. |
| */ |
| yyssp++; |
| |
| yysetstate: |
| *yyssp = yystate; |
| |
| if (yyss + yystacksize - 1 <= yyssp) |
| { |
| /* Get the current used size of the three stacks, in elements. */ |
| YYSIZE_T yysize = yyssp - yyss + 1; |
| |
| #ifdef yyoverflow |
| { |
| /* Give user a chance to reallocate the stack. Use copies of |
| these so that the &'s don't force the real ones into |
| memory. */ |
| YYSTYPE *yyvs1 = yyvs; |
| short int *yyss1 = yyss; |
| |
| |
| /* Each stack pointer address is followed by the size of the |
| data in use in that stack, in bytes. This used to be a |
| conditional around just the two extra args, but that might |
| be undefined if yyoverflow is a macro. */ |
| yyoverflow (YY_("memory exhausted"), |
| &yyss1, yysize * sizeof (*yyssp), |
| &yyvs1, yysize * sizeof (*yyvsp), |
| |
| &yystacksize); |
| |
| yyss = yyss1; |
| yyvs = yyvs1; |
| } |
| #else /* no yyoverflow */ |
| # ifndef YYSTACK_RELOCATE |
| goto yyexhaustedlab; |
| # else |
| /* Extend the stack our own way. */ |
| if (YYMAXDEPTH <= yystacksize) |
| goto yyexhaustedlab; |
| yystacksize *= 2; |
| if (YYMAXDEPTH < yystacksize) |
| yystacksize = YYMAXDEPTH; |
| |
| { |
| short int *yyss1 = yyss; |
| union yyalloc *yyptr = |
| (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); |
| if (! yyptr) |
| goto yyexhaustedlab; |
| YYSTACK_RELOCATE (yyss); |
| YYSTACK_RELOCATE (yyvs); |
| |
| # undef YYSTACK_RELOCATE |
| if (yyss1 != yyssa) |
| YYSTACK_FREE (yyss1); |
| } |
| # endif |
| #endif /* no yyoverflow */ |
| |
| yyssp = yyss + yysize - 1; |
| yyvsp = yyvs + yysize - 1; |
| |
| |
| YYDPRINTF ((stderr, "Stack size increased to %lu\n", |
| (unsigned long int) yystacksize)); |
| |
| if (yyss + yystacksize - 1 <= yyssp) |
| YYABORT; |
| } |
| |
| YYDPRINTF ((stderr, "Entering state %d\n", yystate)); |
| |
| goto yybackup; |
| |
| /*-----------. |
| | yybackup. | |
| `-----------*/ |
| yybackup: |
| |
| /* Do appropriate processing given the current state. */ |
| /* Read a look-ahead token if we need one and don't already have one. */ |
| /* yyresume: */ |
| |
| /* First try to decide what to do without reference to look-ahead token. */ |
| |
| yyn = yypact[yystate]; |
| if (yyn == YYPACT_NINF) |
| goto yydefault; |
| |
| /* Not known => get a look-ahead token if don't already have one. */ |
| |
| /* YYCHAR is either YYEMPTY or YYEOF or a valid look-ahead symbol. */ |
| if (yychar == YYEMPTY) |
| { |
| YYDPRINTF ((stderr, "Reading a token: ")); |
| yychar = YYLEX; |
| } |
| |
| if (yychar <= YYEOF) |
| { |
| yychar = yytoken = YYEOF; |
| YYDPRINTF ((stderr, "Now at end of input.\n")); |
| } |
| else |
| { |
| yytoken = YYTRANSLATE (yychar); |
| YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc); |
| } |
| |
| /* If the proper action on seeing token YYTOKEN is to reduce or to |
| detect an error, take that action. */ |
| yyn += yytoken; |
| if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken) |
| goto yydefault; |
| yyn = yytable[yyn]; |
| if (yyn <= 0) |
| { |
| if (yyn == 0 || yyn == YYTABLE_NINF) |
| goto yyerrlab; |
| yyn = -yyn; |
| goto yyreduce; |
| } |
| |
| if (yyn == YYFINAL) |
| YYACCEPT; |
| |
| /* Shift the look-ahead token. */ |
| YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc); |
| |
| /* Discard the token being shifted unless it is eof. */ |
| if (yychar != YYEOF) |
| yychar = YYEMPTY; |
| |
| *++yyvsp = yylval; |
| |
| |
| /* Count tokens shifted since error; after three, turn off error |
| status. */ |
| if (yyerrstatus) |
| yyerrstatus--; |
| |
| yystate = yyn; |
| goto yynewstate; |
| |
| |
| /*-----------------------------------------------------------. |
| | yydefault -- do the default action for the current state. | |
| `-----------------------------------------------------------*/ |
| yydefault: |
| yyn = yydefact[yystate]; |
| if (yyn == 0) |
| goto yyerrlab; |
| goto yyreduce; |
| |
| |
| /*-----------------------------. |
| | yyreduce -- Do a reduction. | |
| `-----------------------------*/ |
| yyreduce: |
| /* yyn is the number of a rule to reduce with. */ |
| yylen = yyr2[yyn]; |
| |
| /* If YYLEN is nonzero, implement the default value of the action: |
| `$$ = $1'. |
| |
| Otherwise, the following line sets YYVAL to garbage. |
| This behavior is undocumented and Bison |
| users should not rely upon it. Assigning to YYVAL |
| unconditionally makes the parser a bit smaller, and it avoids a |
| GCC warning that YYVAL may be used uninitialized. */ |
| yyval = yyvsp[1-yylen]; |
| |
| |
| YY_REDUCE_PRINT (yyn); |
| switch (yyn) |
| { |
| case 3: |
| #line 1020 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if ((yyvsp[0].UIntVal) > (uint32_t)INT32_MAX) // Outside of my range! |
| GEN_ERROR("Value too large for type!"); |
| (yyval.SIntVal) = (int32_t)(yyvsp[0].UIntVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 31: |
| #line 1036 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.IPredicate) = ICmpInst::ICMP_EQ; ;} |
| break; |
| |
| case 32: |
| #line 1036 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.IPredicate) = ICmpInst::ICMP_NE; ;} |
| break; |
| |
| case 33: |
| #line 1037 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.IPredicate) = ICmpInst::ICMP_SLT; ;} |
| break; |
| |
| case 34: |
| #line 1037 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.IPredicate) = ICmpInst::ICMP_SGT; ;} |
| break; |
| |
| case 35: |
| #line 1038 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.IPredicate) = ICmpInst::ICMP_SLE; ;} |
| break; |
| |
| case 36: |
| #line 1038 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.IPredicate) = ICmpInst::ICMP_SGE; ;} |
| break; |
| |
| case 37: |
| #line 1039 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.IPredicate) = ICmpInst::ICMP_ULT; ;} |
| break; |
| |
| case 38: |
| #line 1039 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.IPredicate) = ICmpInst::ICMP_UGT; ;} |
| break; |
| |
| case 39: |
| #line 1040 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.IPredicate) = ICmpInst::ICMP_ULE; ;} |
| break; |
| |
| case 40: |
| #line 1040 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.IPredicate) = ICmpInst::ICMP_UGE; ;} |
| break; |
| |
| case 41: |
| #line 1044 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.FPredicate) = FCmpInst::FCMP_OEQ; ;} |
| break; |
| |
| case 42: |
| #line 1044 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.FPredicate) = FCmpInst::FCMP_ONE; ;} |
| break; |
| |
| case 43: |
| #line 1045 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.FPredicate) = FCmpInst::FCMP_OLT; ;} |
| break; |
| |
| case 44: |
| #line 1045 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.FPredicate) = FCmpInst::FCMP_OGT; ;} |
| break; |
| |
| case 45: |
| #line 1046 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.FPredicate) = FCmpInst::FCMP_OLE; ;} |
| break; |
| |
| case 46: |
| #line 1046 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.FPredicate) = FCmpInst::FCMP_OGE; ;} |
| break; |
| |
| case 47: |
| #line 1047 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.FPredicate) = FCmpInst::FCMP_ORD; ;} |
| break; |
| |
| case 48: |
| #line 1047 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.FPredicate) = FCmpInst::FCMP_UNO; ;} |
| break; |
| |
| case 49: |
| #line 1048 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.FPredicate) = FCmpInst::FCMP_UEQ; ;} |
| break; |
| |
| case 50: |
| #line 1048 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.FPredicate) = FCmpInst::FCMP_UNE; ;} |
| break; |
| |
| case 51: |
| #line 1049 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.FPredicate) = FCmpInst::FCMP_ULT; ;} |
| break; |
| |
| case 52: |
| #line 1049 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.FPredicate) = FCmpInst::FCMP_UGT; ;} |
| break; |
| |
| case 53: |
| #line 1050 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.FPredicate) = FCmpInst::FCMP_ULE; ;} |
| break; |
| |
| case 54: |
| #line 1050 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.FPredicate) = FCmpInst::FCMP_UGE; ;} |
| break; |
| |
| case 55: |
| #line 1051 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.FPredicate) = FCmpInst::FCMP_TRUE; ;} |
| break; |
| |
| case 56: |
| #line 1052 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.FPredicate) = FCmpInst::FCMP_FALSE; ;} |
| break; |
| |
| case 63: |
| #line 1061 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.StrVal) = (yyvsp[-1].StrVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 64: |
| #line 1065 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.StrVal) = 0; |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 65: |
| #line 1071 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::InternalLinkage; ;} |
| break; |
| |
| case 66: |
| #line 1072 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::WeakLinkage; ;} |
| break; |
| |
| case 67: |
| #line 1073 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::LinkOnceLinkage; ;} |
| break; |
| |
| case 68: |
| #line 1074 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::AppendingLinkage; ;} |
| break; |
| |
| case 69: |
| #line 1075 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::DLLExportLinkage; ;} |
| break; |
| |
| case 70: |
| #line 1079 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::DLLImportLinkage; ;} |
| break; |
| |
| case 71: |
| #line 1080 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::ExternalWeakLinkage; ;} |
| break; |
| |
| case 72: |
| #line 1081 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::ExternalLinkage; ;} |
| break; |
| |
| case 73: |
| #line 1085 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::ExternalLinkage; ;} |
| break; |
| |
| case 74: |
| #line 1086 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::DLLImportLinkage; ;} |
| break; |
| |
| case 75: |
| #line 1087 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::ExternalWeakLinkage; ;} |
| break; |
| |
| case 76: |
| #line 1091 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::ExternalLinkage; ;} |
| break; |
| |
| case 77: |
| #line 1092 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::InternalLinkage; ;} |
| break; |
| |
| case 78: |
| #line 1093 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::LinkOnceLinkage; ;} |
| break; |
| |
| case 79: |
| #line 1094 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::WeakLinkage; ;} |
| break; |
| |
| case 80: |
| #line 1095 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Linkage) = GlobalValue::DLLExportLinkage; ;} |
| break; |
| |
| case 81: |
| #line 1098 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.UIntVal) = CallingConv::C; ;} |
| break; |
| |
| case 82: |
| #line 1099 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.UIntVal) = CallingConv::C; ;} |
| break; |
| |
| case 83: |
| #line 1100 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.UIntVal) = CallingConv::CSRet; ;} |
| break; |
| |
| case 84: |
| #line 1101 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.UIntVal) = CallingConv::Fast; ;} |
| break; |
| |
| case 85: |
| #line 1102 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.UIntVal) = CallingConv::Cold; ;} |
| break; |
| |
| case 86: |
| #line 1103 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.UIntVal) = CallingConv::X86_StdCall; ;} |
| break; |
| |
| case 87: |
| #line 1104 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.UIntVal) = CallingConv::X86_FastCall; ;} |
| break; |
| |
| case 88: |
| #line 1105 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if ((unsigned)(yyvsp[0].UInt64Val) != (yyvsp[0].UInt64Val)) |
| GEN_ERROR("Calling conv too large!"); |
| (yyval.UIntVal) = (yyvsp[0].UInt64Val); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 89: |
| #line 1112 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.ParamAttrs) = FunctionType::ZExtAttribute; ;} |
| break; |
| |
| case 90: |
| #line 1113 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.ParamAttrs) = FunctionType::SExtAttribute; ;} |
| break; |
| |
| case 91: |
| #line 1116 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.ParamAttrs) = FunctionType::NoAttributeSet; ;} |
| break; |
| |
| case 92: |
| #line 1117 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ParamAttrs) = FunctionType::ParameterAttributes((yyvsp[-1].ParamAttrs) | (yyvsp[0].ParamAttrs)); |
| ;} |
| break; |
| |
| case 93: |
| #line 1122 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.ParamAttrs) = FunctionType::NoReturnAttribute; ;} |
| break; |
| |
| case 95: |
| #line 1126 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.ParamAttrs) = FunctionType::NoAttributeSet; ;} |
| break; |
| |
| case 96: |
| #line 1127 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ParamAttrs) = FunctionType::ParameterAttributes((yyvsp[-1].ParamAttrs) | (yyvsp[0].ParamAttrs)); |
| ;} |
| break; |
| |
| case 97: |
| #line 1134 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.UIntVal) = 0; ;} |
| break; |
| |
| case 98: |
| #line 1135 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.UIntVal) = (yyvsp[0].UInt64Val); |
| if ((yyval.UIntVal) != 0 && !isPowerOf2_32((yyval.UIntVal))) |
| GEN_ERROR("Alignment must be a power of two!"); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 99: |
| #line 1141 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.UIntVal) = 0; ;} |
| break; |
| |
| case 100: |
| #line 1142 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.UIntVal) = (yyvsp[0].UInt64Val); |
| if ((yyval.UIntVal) != 0 && !isPowerOf2_32((yyval.UIntVal))) |
| GEN_ERROR("Alignment must be a power of two!"); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 101: |
| #line 1150 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| for (unsigned i = 0, e = strlen((yyvsp[0].StrVal)); i != e; ++i) |
| if ((yyvsp[0].StrVal)[i] == '"' || (yyvsp[0].StrVal)[i] == '\\') |
| GEN_ERROR("Invalid character in section name!"); |
| (yyval.StrVal) = (yyvsp[0].StrVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 102: |
| #line 1158 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.StrVal) = 0; ;} |
| break; |
| |
| case 103: |
| #line 1159 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.StrVal) = (yyvsp[0].StrVal); ;} |
| break; |
| |
| case 104: |
| #line 1164 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| {;} |
| break; |
| |
| case 105: |
| #line 1165 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| {;} |
| break; |
| |
| case 106: |
| #line 1166 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| CurGV->setSection((yyvsp[0].StrVal)); |
| free((yyvsp[0].StrVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 107: |
| #line 1171 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if ((yyvsp[0].UInt64Val) != 0 && !isPowerOf2_32((yyvsp[0].UInt64Val))) |
| GEN_ERROR("Alignment must be a power of two!"); |
| CurGV->setAlignment((yyvsp[0].UInt64Val)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 116: |
| #line 1187 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.TypeVal) = new PATypeHolder(OpaqueType::get()); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 117: |
| #line 1191 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.TypeVal) = new PATypeHolder((yyvsp[0].PrimType)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 118: |
| #line 1195 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { // Pointer type? |
| if (*(yyvsp[-1].TypeVal) == Type::LabelTy) |
| GEN_ERROR("Cannot form a pointer to a basic block"); |
| (yyval.TypeVal) = new PATypeHolder(HandleUpRefs(PointerType::get(*(yyvsp[-1].TypeVal)))); |
| delete (yyvsp[-1].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 119: |
| #line 1202 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { // Named types are also simple types... |
| const Type* tmp = getTypeVal((yyvsp[0].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyval.TypeVal) = new PATypeHolder(tmp); |
| ;} |
| break; |
| |
| case 120: |
| #line 1207 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { // Type UpReference |
| if ((yyvsp[0].UInt64Val) > (uint64_t)~0U) GEN_ERROR("Value out of range!"); |
| OpaqueType *OT = OpaqueType::get(); // Use temporary placeholder |
| UpRefs.push_back(UpRefRecord((unsigned)(yyvsp[0].UInt64Val), OT)); // Add to vector... |
| (yyval.TypeVal) = new PATypeHolder(OT); |
| UR_OUT("New Upreference!\n"); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 121: |
| #line 1215 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| std::vector<const Type*> Params; |
| std::vector<FunctionType::ParameterAttributes> Attrs; |
| Attrs.push_back((yyvsp[0].ParamAttrs)); |
| for (TypeWithAttrsList::iterator I=(yyvsp[-2].TypeWithAttrsList)->begin(), E=(yyvsp[-2].TypeWithAttrsList)->end(); I != E; ++I) { |
| Params.push_back(I->Ty->get()); |
| if (I->Ty->get() != Type::VoidTy) |
| Attrs.push_back(I->Attrs); |
| } |
| bool isVarArg = Params.size() && Params.back() == Type::VoidTy; |
| if (isVarArg) Params.pop_back(); |
| |
| FunctionType *FT = FunctionType::get(*(yyvsp[-4].TypeVal), Params, isVarArg, Attrs); |
| delete (yyvsp[-2].TypeWithAttrsList); // Delete the argument list |
| delete (yyvsp[-4].TypeVal); // Delete the return type handle |
| (yyval.TypeVal) = new PATypeHolder(HandleUpRefs(FT)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 122: |
| #line 1233 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| std::vector<const Type*> Params; |
| std::vector<FunctionType::ParameterAttributes> Attrs; |
| Attrs.push_back((yyvsp[0].ParamAttrs)); |
| for (TypeWithAttrsList::iterator I=(yyvsp[-2].TypeWithAttrsList)->begin(), E=(yyvsp[-2].TypeWithAttrsList)->end(); I != E; ++I) { |
| Params.push_back(I->Ty->get()); |
| if (I->Ty->get() != Type::VoidTy) |
| Attrs.push_back(I->Attrs); |
| } |
| bool isVarArg = Params.size() && Params.back() == Type::VoidTy; |
| if (isVarArg) Params.pop_back(); |
| |
| FunctionType *FT = FunctionType::get((yyvsp[-4].PrimType), Params, isVarArg, Attrs); |
| delete (yyvsp[-2].TypeWithAttrsList); // Delete the argument list |
| (yyval.TypeVal) = new PATypeHolder(HandleUpRefs(FT)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 123: |
| #line 1251 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { // Sized array type? |
| (yyval.TypeVal) = new PATypeHolder(HandleUpRefs(ArrayType::get(*(yyvsp[-1].TypeVal), (unsigned)(yyvsp[-3].UInt64Val)))); |
| delete (yyvsp[-1].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 124: |
| #line 1256 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { // Packed array type? |
| const llvm::Type* ElemTy = (yyvsp[-1].TypeVal)->get(); |
| if ((unsigned)(yyvsp[-3].UInt64Val) != (yyvsp[-3].UInt64Val)) |
| GEN_ERROR("Unsigned result not equal to signed result"); |
| if (!ElemTy->isPrimitiveType()) |
| GEN_ERROR("Elemental type of a PackedType must be primitive"); |
| if (!isPowerOf2_32((yyvsp[-3].UInt64Val))) |
| GEN_ERROR("Vector length should be a power of 2!"); |
| (yyval.TypeVal) = new PATypeHolder(HandleUpRefs(PackedType::get(*(yyvsp[-1].TypeVal), (unsigned)(yyvsp[-3].UInt64Val)))); |
| delete (yyvsp[-1].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 125: |
| #line 1268 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { // Structure type? |
| std::vector<const Type*> Elements; |
| for (std::list<llvm::PATypeHolder>::iterator I = (yyvsp[-1].TypeList)->begin(), |
| E = (yyvsp[-1].TypeList)->end(); I != E; ++I) |
| Elements.push_back(*I); |
| |
| (yyval.TypeVal) = new PATypeHolder(HandleUpRefs(StructType::get(Elements))); |
| delete (yyvsp[-1].TypeList); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 126: |
| #line 1278 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { // Empty structure type? |
| (yyval.TypeVal) = new PATypeHolder(StructType::get(std::vector<const Type*>())); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 127: |
| #line 1282 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| std::vector<const Type*> Elements; |
| for (std::list<llvm::PATypeHolder>::iterator I = (yyvsp[-2].TypeList)->begin(), |
| E = (yyvsp[-2].TypeList)->end(); I != E; ++I) |
| Elements.push_back(*I); |
| |
| (yyval.TypeVal) = new PATypeHolder(HandleUpRefs(StructType::get(Elements, true))); |
| delete (yyvsp[-2].TypeList); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 128: |
| #line 1292 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { // Empty structure type? |
| (yyval.TypeVal) = new PATypeHolder(StructType::get(std::vector<const Type*>(), true)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 129: |
| #line 1299 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.TypeWithAttrs).Ty = (yyvsp[-1].TypeVal); |
| (yyval.TypeWithAttrs).Attrs = (yyvsp[0].ParamAttrs); |
| ;} |
| break; |
| |
| case 130: |
| #line 1306 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[0].TypeVal))->getDescription()); |
| if (!(*(yyvsp[0].TypeVal))->isFirstClassType()) |
| GEN_ERROR("LLVM functions cannot return aggregate types!"); |
| (yyval.TypeVal) = (yyvsp[0].TypeVal); |
| ;} |
| break; |
| |
| case 131: |
| #line 1313 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.TypeVal) = new PATypeHolder(Type::VoidTy); |
| ;} |
| break; |
| |
| case 132: |
| #line 1318 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.TypeWithAttrsList) = new TypeWithAttrsList(); |
| (yyval.TypeWithAttrsList)->push_back((yyvsp[0].TypeWithAttrs)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 133: |
| #line 1323 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| ((yyval.TypeWithAttrsList)=(yyvsp[-2].TypeWithAttrsList))->push_back((yyvsp[0].TypeWithAttrs)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 135: |
| #line 1331 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.TypeWithAttrsList)=(yyvsp[-2].TypeWithAttrsList); |
| TypeWithAttrs TWA; TWA.Attrs = FunctionType::NoAttributeSet; |
| TWA.Ty = new PATypeHolder(Type::VoidTy); |
| (yyval.TypeWithAttrsList)->push_back(TWA); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 136: |
| #line 1338 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.TypeWithAttrsList) = new TypeWithAttrsList; |
| TypeWithAttrs TWA; TWA.Attrs = FunctionType::NoAttributeSet; |
| TWA.Ty = new PATypeHolder(Type::VoidTy); |
| (yyval.TypeWithAttrsList)->push_back(TWA); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 137: |
| #line 1345 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.TypeWithAttrsList) = new TypeWithAttrsList(); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 138: |
| #line 1353 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.TypeList) = new std::list<PATypeHolder>(); |
| (yyval.TypeList)->push_back(*(yyvsp[0].TypeVal)); delete (yyvsp[0].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 139: |
| #line 1358 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| ((yyval.TypeList)=(yyvsp[-2].TypeList))->push_back(*(yyvsp[0].TypeVal)); delete (yyvsp[0].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 140: |
| #line 1369 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { // Nonempty unsized arr |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[-3].TypeVal))->getDescription()); |
| const ArrayType *ATy = dyn_cast<ArrayType>((yyvsp[-3].TypeVal)->get()); |
| if (ATy == 0) |
| GEN_ERROR("Cannot make array constant with type: '" + |
| (*(yyvsp[-3].TypeVal))->getDescription() + "'!"); |
| const Type *ETy = ATy->getElementType(); |
| int NumElements = ATy->getNumElements(); |
| |
| // Verify that we have the correct size... |
| if (NumElements != -1 && NumElements != (int)(yyvsp[-1].ConstVector)->size()) |
| GEN_ERROR("Type mismatch: constant sized array initialized with " + |
| utostr((yyvsp[-1].ConstVector)->size()) + " arguments, but has size of " + |
| itostr(NumElements) + "!"); |
| |
| // Verify all elements are correct type! |
| for (unsigned i = 0; i < (yyvsp[-1].ConstVector)->size(); i++) { |
| if (ETy != (*(yyvsp[-1].ConstVector))[i]->getType()) |
| GEN_ERROR("Element #" + utostr(i) + " is not of type '" + |
| ETy->getDescription() +"' as required!\nIt is of type '"+ |
| (*(yyvsp[-1].ConstVector))[i]->getType()->getDescription() + "'."); |
| } |
| |
| (yyval.ConstVal) = ConstantArray::get(ATy, *(yyvsp[-1].ConstVector)); |
| delete (yyvsp[-3].TypeVal); delete (yyvsp[-1].ConstVector); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 141: |
| #line 1397 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[-2].TypeVal))->getDescription()); |
| const ArrayType *ATy = dyn_cast<ArrayType>((yyvsp[-2].TypeVal)->get()); |
| if (ATy == 0) |
| GEN_ERROR("Cannot make array constant with type: '" + |
| (*(yyvsp[-2].TypeVal))->getDescription() + "'!"); |
| |
| int NumElements = ATy->getNumElements(); |
| if (NumElements != -1 && NumElements != 0) |
| GEN_ERROR("Type mismatch: constant sized array initialized with 0" |
| " arguments, but has size of " + itostr(NumElements) +"!"); |
| (yyval.ConstVal) = ConstantArray::get(ATy, std::vector<Constant*>()); |
| delete (yyvsp[-2].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 142: |
| #line 1413 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[-2].TypeVal))->getDescription()); |
| const ArrayType *ATy = dyn_cast<ArrayType>((yyvsp[-2].TypeVal)->get()); |
| if (ATy == 0) |
| GEN_ERROR("Cannot make array constant with type: '" + |
| (*(yyvsp[-2].TypeVal))->getDescription() + "'!"); |
| |
| int NumElements = ATy->getNumElements(); |
| const Type *ETy = ATy->getElementType(); |
| char *EndStr = UnEscapeLexed((yyvsp[0].StrVal), true); |
| if (NumElements != -1 && NumElements != (EndStr-(yyvsp[0].StrVal))) |
| GEN_ERROR("Can't build string constant of size " + |
| itostr((int)(EndStr-(yyvsp[0].StrVal))) + |
| " when array has size " + itostr(NumElements) + "!"); |
| std::vector<Constant*> Vals; |
| if (ETy == Type::Int8Ty) { |
| for (unsigned char *C = (unsigned char *)(yyvsp[0].StrVal); |
| C != (unsigned char*)EndStr; ++C) |
| Vals.push_back(ConstantInt::get(ETy, *C)); |
| } else { |
| free((yyvsp[0].StrVal)); |
| GEN_ERROR("Cannot build string arrays of non byte sized elements!"); |
| } |
| free((yyvsp[0].StrVal)); |
| (yyval.ConstVal) = ConstantArray::get(ATy, Vals); |
| delete (yyvsp[-2].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 143: |
| #line 1442 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { // Nonempty unsized arr |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[-3].TypeVal))->getDescription()); |
| const PackedType *PTy = dyn_cast<PackedType>((yyvsp[-3].TypeVal)->get()); |
| if (PTy == 0) |
| GEN_ERROR("Cannot make packed constant with type: '" + |
| (*(yyvsp[-3].TypeVal))->getDescription() + "'!"); |
| const Type *ETy = PTy->getElementType(); |
| int NumElements = PTy->getNumElements(); |
| |
| // Verify that we have the correct size... |
| if (NumElements != -1 && NumElements != (int)(yyvsp[-1].ConstVector)->size()) |
| GEN_ERROR("Type mismatch: constant sized packed initialized with " + |
| utostr((yyvsp[-1].ConstVector)->size()) + " arguments, but has size of " + |
| itostr(NumElements) + "!"); |
| |
| // Verify all elements are correct type! |
| for (unsigned i = 0; i < (yyvsp[-1].ConstVector)->size(); i++) { |
| if (ETy != (*(yyvsp[-1].ConstVector))[i]->getType()) |
| GEN_ERROR("Element #" + utostr(i) + " is not of type '" + |
| ETy->getDescription() +"' as required!\nIt is of type '"+ |
| (*(yyvsp[-1].ConstVector))[i]->getType()->getDescription() + "'."); |
| } |
| |
| (yyval.ConstVal) = ConstantPacked::get(PTy, *(yyvsp[-1].ConstVector)); |
| delete (yyvsp[-3].TypeVal); delete (yyvsp[-1].ConstVector); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 144: |
| #line 1470 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| const StructType *STy = dyn_cast<StructType>((yyvsp[-3].TypeVal)->get()); |
| if (STy == 0) |
| GEN_ERROR("Cannot make struct constant with type: '" + |
| (*(yyvsp[-3].TypeVal))->getDescription() + "'!"); |
| |
| if ((yyvsp[-1].ConstVector)->size() != STy->getNumContainedTypes()) |
| GEN_ERROR("Illegal number of initializers for structure type!"); |
| |
| // Check to ensure that constants are compatible with the type initializer! |
| for (unsigned i = 0, e = (yyvsp[-1].ConstVector)->size(); i != e; ++i) |
| if ((*(yyvsp[-1].ConstVector))[i]->getType() != STy->getElementType(i)) |
| GEN_ERROR("Expected type '" + |
| STy->getElementType(i)->getDescription() + |
| "' for element #" + utostr(i) + |
| " of structure initializer!"); |
| |
| // Check to ensure that Type is not packed |
| if (STy->isPacked()) |
| GEN_ERROR("Unpacked Initializer to packed type '" + STy->getDescription() + "'"); |
| |
| (yyval.ConstVal) = ConstantStruct::get(STy, *(yyvsp[-1].ConstVector)); |
| delete (yyvsp[-3].TypeVal); delete (yyvsp[-1].ConstVector); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 145: |
| #line 1495 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[-2].TypeVal))->getDescription()); |
| const StructType *STy = dyn_cast<StructType>((yyvsp[-2].TypeVal)->get()); |
| if (STy == 0) |
| GEN_ERROR("Cannot make struct constant with type: '" + |
| (*(yyvsp[-2].TypeVal))->getDescription() + "'!"); |
| |
| if (STy->getNumContainedTypes() != 0) |
| GEN_ERROR("Illegal number of initializers for structure type!"); |
| |
| // Check to ensure that Type is not packed |
| if (STy->isPacked()) |
| GEN_ERROR("Unpacked Initializer to packed type '" + STy->getDescription() + "'"); |
| |
| (yyval.ConstVal) = ConstantStruct::get(STy, std::vector<Constant*>()); |
| delete (yyvsp[-2].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 146: |
| #line 1514 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| const StructType *STy = dyn_cast<StructType>((yyvsp[-5].TypeVal)->get()); |
| if (STy == 0) |
| GEN_ERROR("Cannot make struct constant with type: '" + |
| (*(yyvsp[-5].TypeVal))->getDescription() + "'!"); |
| |
| if ((yyvsp[-2].ConstVector)->size() != STy->getNumContainedTypes()) |
| GEN_ERROR("Illegal number of initializers for structure type!"); |
| |
| // Check to ensure that constants are compatible with the type initializer! |
| for (unsigned i = 0, e = (yyvsp[-2].ConstVector)->size(); i != e; ++i) |
| if ((*(yyvsp[-2].ConstVector))[i]->getType() != STy->getElementType(i)) |
| GEN_ERROR("Expected type '" + |
| STy->getElementType(i)->getDescription() + |
| "' for element #" + utostr(i) + |
| " of structure initializer!"); |
| |
| // Check to ensure that Type is packed |
| if (!STy->isPacked()) |
| GEN_ERROR("Packed Initializer to unpacked type '" + STy->getDescription() + "'"); |
| |
| (yyval.ConstVal) = ConstantStruct::get(STy, *(yyvsp[-2].ConstVector)); |
| delete (yyvsp[-5].TypeVal); delete (yyvsp[-2].ConstVector); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 147: |
| #line 1539 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[-4].TypeVal))->getDescription()); |
| const StructType *STy = dyn_cast<StructType>((yyvsp[-4].TypeVal)->get()); |
| if (STy == 0) |
| GEN_ERROR("Cannot make struct constant with type: '" + |
| (*(yyvsp[-4].TypeVal))->getDescription() + "'!"); |
| |
| if (STy->getNumContainedTypes() != 0) |
| GEN_ERROR("Illegal number of initializers for structure type!"); |
| |
| // Check to ensure that Type is packed |
| if (!STy->isPacked()) |
| GEN_ERROR("Packed Initializer to unpacked type '" + STy->getDescription() + "'"); |
| |
| (yyval.ConstVal) = ConstantStruct::get(STy, std::vector<Constant*>()); |
| delete (yyvsp[-4].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 148: |
| #line 1558 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[-1].TypeVal))->getDescription()); |
| const PointerType *PTy = dyn_cast<PointerType>((yyvsp[-1].TypeVal)->get()); |
| if (PTy == 0) |
| GEN_ERROR("Cannot make null pointer constant with type: '" + |
| (*(yyvsp[-1].TypeVal))->getDescription() + "'!"); |
| |
| (yyval.ConstVal) = ConstantPointerNull::get(PTy); |
| delete (yyvsp[-1].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 149: |
| #line 1570 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[-1].TypeVal))->getDescription()); |
| (yyval.ConstVal) = UndefValue::get((yyvsp[-1].TypeVal)->get()); |
| delete (yyvsp[-1].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 150: |
| #line 1577 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[-1].TypeVal))->getDescription()); |
| const PointerType *Ty = dyn_cast<PointerType>((yyvsp[-1].TypeVal)->get()); |
| if (Ty == 0) |
| GEN_ERROR("Global const reference must be a pointer type!"); |
| |
| // ConstExprs can exist in the body of a function, thus creating |
| // GlobalValues whenever they refer to a variable. Because we are in |
| // the context of a function, getValNonImprovising will search the functions |
| // symbol table instead of the module symbol table for the global symbol, |
| // which throws things all off. To get around this, we just tell |
| // getValNonImprovising that we are at global scope here. |
| // |
| Function *SavedCurFn = CurFun.CurrentFunction; |
| CurFun.CurrentFunction = 0; |
| |
| Value *V = getValNonImprovising(Ty, (yyvsp[0].ValIDVal)); |
| CHECK_FOR_ERROR |
| |
| CurFun.CurrentFunction = SavedCurFn; |
| |
| // If this is an initializer for a constant pointer, which is referencing a |
| // (currently) undefined variable, create a stub now that shall be replaced |
| // in the future with the right type of variable. |
| // |
| if (V == 0) { |
| assert(isa<PointerType>(Ty) && "Globals may only be used as pointers!"); |
| const PointerType *PT = cast<PointerType>(Ty); |
| |
| // First check to see if the forward references value is already created! |
| PerModuleInfo::GlobalRefsType::iterator I = |
| CurModule.GlobalRefs.find(std::make_pair(PT, (yyvsp[0].ValIDVal))); |
| |
| if (I != CurModule.GlobalRefs.end()) { |
| V = I->second; // Placeholder already exists, use it... |
| (yyvsp[0].ValIDVal).destroy(); |
| } else { |
| std::string Name; |
| if ((yyvsp[0].ValIDVal).Type == ValID::NameVal) Name = (yyvsp[0].ValIDVal).Name; |
| |
| // Create the forward referenced global. |
| GlobalValue *GV; |
| if (const FunctionType *FTy = |
| dyn_cast<FunctionType>(PT->getElementType())) { |
| GV = new Function(FTy, GlobalValue::ExternalLinkage, Name, |
| CurModule.CurrentModule); |
| } else { |
| GV = new GlobalVariable(PT->getElementType(), false, |
| GlobalValue::ExternalLinkage, 0, |
| Name, CurModule.CurrentModule); |
| } |
| |
| // Keep track of the fact that we have a forward ref to recycle it |
| CurModule.GlobalRefs.insert(std::make_pair(std::make_pair(PT, (yyvsp[0].ValIDVal)), GV)); |
| V = GV; |
| } |
| } |
| |
| (yyval.ConstVal) = cast<GlobalValue>(V); |
| delete (yyvsp[-1].TypeVal); // Free the type handle |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 151: |
| #line 1640 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[-1].TypeVal))->getDescription()); |
| if ((yyvsp[-1].TypeVal)->get() != (yyvsp[0].ConstVal)->getType()) |
| GEN_ERROR("Mismatched types for constant expression: " + |
| (*(yyvsp[-1].TypeVal))->getDescription() + " and " + (yyvsp[0].ConstVal)->getType()->getDescription()); |
| (yyval.ConstVal) = (yyvsp[0].ConstVal); |
| delete (yyvsp[-1].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 152: |
| #line 1650 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[-1].TypeVal))->getDescription()); |
| const Type *Ty = (yyvsp[-1].TypeVal)->get(); |
| if (isa<FunctionType>(Ty) || Ty == Type::LabelTy || isa<OpaqueType>(Ty)) |
| GEN_ERROR("Cannot create a null initialized value of this type!"); |
| (yyval.ConstVal) = Constant::getNullValue(Ty); |
| delete (yyvsp[-1].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 153: |
| #line 1660 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { // integral constants |
| if (!ConstantInt::isValueValidForType((yyvsp[-1].PrimType), (yyvsp[0].SInt64Val))) |
| GEN_ERROR("Constant value doesn't fit in type!"); |
| (yyval.ConstVal) = ConstantInt::get((yyvsp[-1].PrimType), (yyvsp[0].SInt64Val)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 154: |
| #line 1666 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { // integral constants |
| if (!ConstantInt::isValueValidForType((yyvsp[-1].PrimType), (yyvsp[0].UInt64Val))) |
| GEN_ERROR("Constant value doesn't fit in type!"); |
| (yyval.ConstVal) = ConstantInt::get((yyvsp[-1].PrimType), (yyvsp[0].UInt64Val)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 155: |
| #line 1672 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { // Boolean constants |
| (yyval.ConstVal) = ConstantInt::getTrue(); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 156: |
| #line 1676 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { // Boolean constants |
| (yyval.ConstVal) = ConstantInt::getFalse(); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 157: |
| #line 1680 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { // Float & Double constants |
| if (!ConstantFP::isValueValidForType((yyvsp[-1].PrimType), (yyvsp[0].FPVal))) |
| GEN_ERROR("Floating point constant invalid for type!!"); |
| (yyval.ConstVal) = ConstantFP::get((yyvsp[-1].PrimType), (yyvsp[0].FPVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 158: |
| #line 1688 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[-1].TypeVal))->getDescription()); |
| Constant *Val = (yyvsp[-3].ConstVal); |
| const Type *Ty = (yyvsp[-1].TypeVal)->get(); |
| if (!Val->getType()->isFirstClassType()) |
| GEN_ERROR("cast constant expression from a non-primitive type: '" + |
| Val->getType()->getDescription() + "'!"); |
| if (!Ty->isFirstClassType()) |
| GEN_ERROR("cast constant expression to a non-primitive type: '" + |
| Ty->getDescription() + "'!"); |
| (yyval.ConstVal) = ConstantExpr::getCast((yyvsp[-5].CastOpVal), (yyvsp[-3].ConstVal), (yyvsp[-1].TypeVal)->get()); |
| delete (yyvsp[-1].TypeVal); |
| ;} |
| break; |
| |
| case 159: |
| #line 1702 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!isa<PointerType>((yyvsp[-2].ConstVal)->getType())) |
| GEN_ERROR("GetElementPtr requires a pointer operand!"); |
| |
| const Type *IdxTy = |
| GetElementPtrInst::getIndexedType((yyvsp[-2].ConstVal)->getType(), *(yyvsp[-1].ValueList), true); |
| if (!IdxTy) |
| GEN_ERROR("Index list invalid for constant getelementptr!"); |
| |
| std::vector<Constant*> IdxVec; |
| for (unsigned i = 0, e = (yyvsp[-1].ValueList)->size(); i != e; ++i) |
| if (Constant *C = dyn_cast<Constant>((*(yyvsp[-1].ValueList))[i])) |
| IdxVec.push_back(C); |
| else |
| GEN_ERROR("Indices to constant getelementptr must be constants!"); |
| |
| delete (yyvsp[-1].ValueList); |
| |
| (yyval.ConstVal) = ConstantExpr::getGetElementPtr((yyvsp[-2].ConstVal), IdxVec); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 160: |
| #line 1723 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if ((yyvsp[-5].ConstVal)->getType() != Type::Int1Ty) |
| GEN_ERROR("Select condition must be of boolean type!"); |
| if ((yyvsp[-3].ConstVal)->getType() != (yyvsp[-1].ConstVal)->getType()) |
| GEN_ERROR("Select operand types must match!"); |
| (yyval.ConstVal) = ConstantExpr::getSelect((yyvsp[-5].ConstVal), (yyvsp[-3].ConstVal), (yyvsp[-1].ConstVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 161: |
| #line 1731 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if ((yyvsp[-3].ConstVal)->getType() != (yyvsp[-1].ConstVal)->getType()) |
| GEN_ERROR("Binary operator types must match!"); |
| CHECK_FOR_ERROR; |
| (yyval.ConstVal) = ConstantExpr::get((yyvsp[-5].BinaryOpVal), (yyvsp[-3].ConstVal), (yyvsp[-1].ConstVal)); |
| ;} |
| break; |
| |
| case 162: |
| #line 1737 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if ((yyvsp[-3].ConstVal)->getType() != (yyvsp[-1].ConstVal)->getType()) |
| GEN_ERROR("Logical operator types must match!"); |
| if (!(yyvsp[-3].ConstVal)->getType()->isIntegral()) { |
| if (!isa<PackedType>((yyvsp[-3].ConstVal)->getType()) || |
| !cast<PackedType>((yyvsp[-3].ConstVal)->getType())->getElementType()->isIntegral()) |
| GEN_ERROR("Logical operator requires integral operands!"); |
| } |
| (yyval.ConstVal) = ConstantExpr::get((yyvsp[-5].BinaryOpVal), (yyvsp[-3].ConstVal), (yyvsp[-1].ConstVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 163: |
| #line 1748 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if ((yyvsp[-3].ConstVal)->getType() != (yyvsp[-1].ConstVal)->getType()) |
| GEN_ERROR("icmp operand types must match!"); |
| (yyval.ConstVal) = ConstantExpr::getICmp((yyvsp[-5].IPredicate), (yyvsp[-3].ConstVal), (yyvsp[-1].ConstVal)); |
| ;} |
| break; |
| |
| case 164: |
| #line 1753 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if ((yyvsp[-3].ConstVal)->getType() != (yyvsp[-1].ConstVal)->getType()) |
| GEN_ERROR("fcmp operand types must match!"); |
| (yyval.ConstVal) = ConstantExpr::getFCmp((yyvsp[-5].FPredicate), (yyvsp[-3].ConstVal), (yyvsp[-1].ConstVal)); |
| ;} |
| break; |
| |
| case 165: |
| #line 1758 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if ((yyvsp[-1].ConstVal)->getType() != Type::Int8Ty) |
| GEN_ERROR("Shift count for shift constant must be i8 type!"); |
| if (!(yyvsp[-3].ConstVal)->getType()->isInteger()) |
| GEN_ERROR("Shift constant expression requires integer operand!"); |
| CHECK_FOR_ERROR; |
| (yyval.ConstVal) = ConstantExpr::get((yyvsp[-5].OtherOpVal), (yyvsp[-3].ConstVal), (yyvsp[-1].ConstVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 166: |
| #line 1767 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!ExtractElementInst::isValidOperands((yyvsp[-3].ConstVal), (yyvsp[-1].ConstVal))) |
| GEN_ERROR("Invalid extractelement operands!"); |
| (yyval.ConstVal) = ConstantExpr::getExtractElement((yyvsp[-3].ConstVal), (yyvsp[-1].ConstVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 167: |
| #line 1773 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!InsertElementInst::isValidOperands((yyvsp[-5].ConstVal), (yyvsp[-3].ConstVal), (yyvsp[-1].ConstVal))) |
| GEN_ERROR("Invalid insertelement operands!"); |
| (yyval.ConstVal) = ConstantExpr::getInsertElement((yyvsp[-5].ConstVal), (yyvsp[-3].ConstVal), (yyvsp[-1].ConstVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 168: |
| #line 1779 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!ShuffleVectorInst::isValidOperands((yyvsp[-5].ConstVal), (yyvsp[-3].ConstVal), (yyvsp[-1].ConstVal))) |
| GEN_ERROR("Invalid shufflevector operands!"); |
| (yyval.ConstVal) = ConstantExpr::getShuffleVector((yyvsp[-5].ConstVal), (yyvsp[-3].ConstVal), (yyvsp[-1].ConstVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 169: |
| #line 1788 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| ((yyval.ConstVector) = (yyvsp[-2].ConstVector))->push_back((yyvsp[0].ConstVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 170: |
| #line 1792 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ConstVector) = new std::vector<Constant*>(); |
| (yyval.ConstVector)->push_back((yyvsp[0].ConstVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 171: |
| #line 1800 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.BoolVal) = false; ;} |
| break; |
| |
| case 172: |
| #line 1800 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.BoolVal) = true; ;} |
| break; |
| |
| case 173: |
| #line 1811 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ModuleVal) = ParserResult = CurModule.CurrentModule; |
| CurModule.ModuleDone(); |
| CHECK_FOR_ERROR; |
| ;} |
| break; |
| |
| case 174: |
| #line 1816 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ModuleVal) = ParserResult = CurModule.CurrentModule; |
| CurModule.ModuleDone(); |
| CHECK_FOR_ERROR; |
| ;} |
| break; |
| |
| case 177: |
| #line 1829 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { CurFun.isDeclare = false ;} |
| break; |
| |
| case 178: |
| #line 1829 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| CurFun.FunctionDone(); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 179: |
| #line 1833 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { CurFun.isDeclare = true; ;} |
| break; |
| |
| case 180: |
| #line 1833 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 181: |
| #line 1836 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 182: |
| #line 1839 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| // Emit an error if there are any unresolved types left. |
| if (!CurModule.LateResolveTypes.empty()) { |
| const ValID &DID = CurModule.LateResolveTypes.begin()->first; |
| if (DID.Type == ValID::NameVal) { |
| GEN_ERROR("Reference to an undefined type: '"+DID.getName() + "'"); |
| } else { |
| GEN_ERROR("Reference to an undefined type: #" + itostr(DID.Num)); |
| } |
| } |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 183: |
| #line 1851 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[0].TypeVal))->getDescription()); |
| // Eagerly resolve types. This is not an optimization, this is a |
| // requirement that is due to the fact that we could have this: |
| // |
| // %list = type { %list * } |
| // %list = type { %list * } ; repeated type decl |
| // |
| // If types are not resolved eagerly, then the two types will not be |
| // determined to be the same type! |
| // |
| ResolveTypeTo((yyvsp[-2].StrVal), *(yyvsp[0].TypeVal)); |
| |
| if (!setTypeName(*(yyvsp[0].TypeVal), (yyvsp[-2].StrVal)) && !(yyvsp[-2].StrVal)) { |
| CHECK_FOR_ERROR |
| // If this is a named type that is not a redefinition, add it to the slot |
| // table. |
| CurModule.Types.push_back(*(yyvsp[0].TypeVal)); |
| } |
| |
| delete (yyvsp[0].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 184: |
| #line 1875 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| ResolveTypeTo((yyvsp[-2].StrVal), (yyvsp[0].PrimType)); |
| |
| if (!setTypeName((yyvsp[0].PrimType), (yyvsp[-2].StrVal)) && !(yyvsp[-2].StrVal)) { |
| CHECK_FOR_ERROR |
| // If this is a named type that is not a redefinition, add it to the slot |
| // table. |
| CurModule.Types.push_back((yyvsp[0].PrimType)); |
| } |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 185: |
| #line 1886 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { /* "Externally Visible" Linkage */ |
| if ((yyvsp[0].ConstVal) == 0) |
| GEN_ERROR("Global value initializer is not a constant!"); |
| CurGV = ParseGlobalVariable((yyvsp[-2].StrVal), GlobalValue::ExternalLinkage, (yyvsp[-1].BoolVal), |
| (yyvsp[0].ConstVal)->getType(), (yyvsp[0].ConstVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 186: |
| #line 1892 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| CurGV = 0; |
| ;} |
| break; |
| |
| case 187: |
| #line 1895 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if ((yyvsp[0].ConstVal) == 0) |
| GEN_ERROR("Global value initializer is not a constant!"); |
| CurGV = ParseGlobalVariable((yyvsp[-3].StrVal), (yyvsp[-2].Linkage), (yyvsp[-1].BoolVal), (yyvsp[0].ConstVal)->getType(), (yyvsp[0].ConstVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 188: |
| #line 1900 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| CurGV = 0; |
| ;} |
| break; |
| |
| case 189: |
| #line 1903 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[0].TypeVal))->getDescription()); |
| CurGV = ParseGlobalVariable((yyvsp[-3].StrVal), (yyvsp[-2].Linkage), (yyvsp[-1].BoolVal), *(yyvsp[0].TypeVal), 0); |
| CHECK_FOR_ERROR |
| delete (yyvsp[0].TypeVal); |
| ;} |
| break; |
| |
| case 190: |
| #line 1909 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| CurGV = 0; |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 191: |
| #line 1913 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 192: |
| #line 1916 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 193: |
| #line 1922 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| const std::string &AsmSoFar = CurModule.CurrentModule->getModuleInlineAsm(); |
| char *EndStr = UnEscapeLexed((yyvsp[0].StrVal), true); |
| std::string NewAsm((yyvsp[0].StrVal), EndStr); |
| free((yyvsp[0].StrVal)); |
| |
| if (AsmSoFar.empty()) |
| CurModule.CurrentModule->setModuleInlineAsm(NewAsm); |
| else |
| CurModule.CurrentModule->setModuleInlineAsm(AsmSoFar+"\n"+NewAsm); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 194: |
| #line 1935 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Endianness) = Module::BigEndian; ;} |
| break; |
| |
| case 195: |
| #line 1936 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.Endianness) = Module::LittleEndian; ;} |
| break; |
| |
| case 196: |
| #line 1938 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| CurModule.CurrentModule->setEndianness((yyvsp[0].Endianness)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 197: |
| #line 1942 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if ((yyvsp[0].UInt64Val) == 32) |
| CurModule.CurrentModule->setPointerSize(Module::Pointer32); |
| else if ((yyvsp[0].UInt64Val) == 64) |
| CurModule.CurrentModule->setPointerSize(Module::Pointer64); |
| else |
| GEN_ERROR("Invalid pointer size: '" + utostr((yyvsp[0].UInt64Val)) + "'!"); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 198: |
| #line 1951 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| CurModule.CurrentModule->setTargetTriple((yyvsp[0].StrVal)); |
| free((yyvsp[0].StrVal)); |
| ;} |
| break; |
| |
| case 199: |
| #line 1955 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| CurModule.CurrentModule->setDataLayout((yyvsp[0].StrVal)); |
| free((yyvsp[0].StrVal)); |
| ;} |
| break; |
| |
| case 201: |
| #line 1962 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| CurModule.CurrentModule->addLibrary((yyvsp[0].StrVal)); |
| free((yyvsp[0].StrVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 202: |
| #line 1967 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| CurModule.CurrentModule->addLibrary((yyvsp[0].StrVal)); |
| free((yyvsp[0].StrVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 203: |
| #line 1972 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 207: |
| #line 1982 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.StrVal) = 0; ;} |
| break; |
| |
| case 208: |
| #line 1984 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[-2].TypeVal))->getDescription()); |
| if (*(yyvsp[-2].TypeVal) == Type::VoidTy) |
| GEN_ERROR("void typed arguments are invalid!"); |
| ArgListEntry E; E.Attrs = (yyvsp[-1].ParamAttrs); E.Ty = (yyvsp[-2].TypeVal); E.Name = (yyvsp[0].StrVal); |
| (yyval.ArgList) = (yyvsp[-4].ArgList); |
| (yyvsp[-4].ArgList)->push_back(E); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 209: |
| #line 1994 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[-2].TypeVal))->getDescription()); |
| if (*(yyvsp[-2].TypeVal) == Type::VoidTy) |
| GEN_ERROR("void typed arguments are invalid!"); |
| ArgListEntry E; E.Attrs = (yyvsp[-1].ParamAttrs); E.Ty = (yyvsp[-2].TypeVal); E.Name = (yyvsp[0].StrVal); |
| (yyval.ArgList) = new ArgListType; |
| (yyval.ArgList)->push_back(E); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 210: |
| #line 2005 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ArgList) = (yyvsp[0].ArgList); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 211: |
| #line 2009 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ArgList) = (yyvsp[-2].ArgList); |
| struct ArgListEntry E; |
| E.Ty = new PATypeHolder(Type::VoidTy); |
| E.Name = 0; |
| E.Attrs = FunctionType::NoAttributeSet; |
| (yyval.ArgList)->push_back(E); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 212: |
| #line 2018 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ArgList) = new ArgListType; |
| struct ArgListEntry E; |
| E.Ty = new PATypeHolder(Type::VoidTy); |
| E.Name = 0; |
| E.Attrs = FunctionType::NoAttributeSet; |
| (yyval.ArgList)->push_back(E); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 213: |
| #line 2027 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ArgList) = 0; |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 214: |
| #line 2033 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| UnEscapeLexed((yyvsp[-6].StrVal)); |
| std::string FunctionName((yyvsp[-6].StrVal)); |
| free((yyvsp[-6].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[-7].TypeVal))) |
| GEN_ERROR("Reference to abstract result: "+ (yyvsp[-7].TypeVal)->get()->getDescription()); |
| |
| std::vector<const Type*> ParamTypeList; |
| std::vector<FunctionType::ParameterAttributes> ParamAttrs; |
| ParamAttrs.push_back((yyvsp[-2].ParamAttrs)); |
| if ((yyvsp[-4].ArgList)) { // If there are arguments... |
| for (ArgListType::iterator I = (yyvsp[-4].ArgList)->begin(); I != (yyvsp[-4].ArgList)->end(); ++I) { |
| 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) |
| ParamAttrs.push_back(I->Attrs); |
| } |
| } |
| |
| bool isVarArg = ParamTypeList.size() && ParamTypeList.back() == Type::VoidTy; |
| if (isVarArg) ParamTypeList.pop_back(); |
| |
| FunctionType *FT = FunctionType::get(*(yyvsp[-7].TypeVal), ParamTypeList, isVarArg, |
| ParamAttrs); |
| const PointerType *PFT = PointerType::get(FT); |
| delete (yyvsp[-7].TypeVal); |
| |
| ValID ID; |
| if (!FunctionName.empty()) { |
| ID = ValID::create((char*)FunctionName.c_str()); |
| } else { |
| ID = ValID::create((int)CurModule.Values[PFT].size()); |
| } |
| |
| Function *Fn = 0; |
| // See if this function was forward referenced. If so, recycle the object. |
| if (GlobalValue *FWRef = CurModule.GetForwardRefForGlobal(PFT, ID)) { |
| // Move the function to the end of the list, from whereever it was |
| // previously inserted. |
| Fn = cast<Function>(FWRef); |
| CurModule.CurrentModule->getFunctionList().remove(Fn); |
| CurModule.CurrentModule->getFunctionList().push_back(Fn); |
| } else if (!FunctionName.empty() && // Merge with an earlier prototype? |
| (Fn = CurModule.CurrentModule->getFunction(FunctionName, FT))) { |
| // If this is the case, either we need to be a forward decl, or it needs |
| // to be. |
| if (!CurFun.isDeclare && !Fn->isExternal()) |
| GEN_ERROR("Redefinition of function '" + FunctionName + "'!"); |
| |
| // Make sure to strip off any argument names so we can't get conflicts. |
| if (Fn->isExternal()) |
| for (Function::arg_iterator AI = Fn->arg_begin(), AE = Fn->arg_end(); |
| AI != AE; ++AI) |
| AI->setName(""); |
| } else { // Not already defined? |
| Fn = new Function(FT, GlobalValue::ExternalLinkage, FunctionName, |
| CurModule.CurrentModule); |
| |
| InsertValue(Fn, CurModule.Values); |
| } |
| |
| CurFun.FunctionStart(Fn); |
| |
| if (CurFun.isDeclare) { |
| // If we have declaration, always overwrite linkage. This will allow us to |
| // correctly handle cases, when pointer to function is passed as argument to |
| // another function. |
| Fn->setLinkage(CurFun.Linkage); |
| } |
| Fn->setCallingConv((yyvsp[-8].UIntVal)); |
| Fn->setAlignment((yyvsp[0].UIntVal)); |
| if ((yyvsp[-1].StrVal)) { |
| Fn->setSection((yyvsp[-1].StrVal)); |
| free((yyvsp[-1].StrVal)); |
| } |
| |
| // Add all of the arguments we parsed to the function... |
| if ((yyvsp[-4].ArgList)) { // Is null if empty... |
| if (isVarArg) { // Nuke the last entry |
| assert((yyvsp[-4].ArgList)->back().Ty->get() == Type::VoidTy && (yyvsp[-4].ArgList)->back().Name == 0&& |
| "Not a varargs marker!"); |
| delete (yyvsp[-4].ArgList)->back().Ty; |
| (yyvsp[-4].ArgList)->pop_back(); // Delete the last entry |
| } |
| Function::arg_iterator ArgIt = Fn->arg_begin(); |
| unsigned Idx = 1; |
| for (ArgListType::iterator I = (yyvsp[-4].ArgList)->begin(); I != (yyvsp[-4].ArgList)->end(); ++I, ++ArgIt) { |
| delete I->Ty; // Delete the typeholder... |
| setValueName(ArgIt, I->Name); // Insert arg into symtab... |
| CHECK_FOR_ERROR |
| InsertValue(ArgIt); |
| Idx++; |
| } |
| |
| delete (yyvsp[-4].ArgList); // We're now done with the argument list |
| } |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 217: |
| #line 2139 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.FunctionVal) = CurFun.CurrentFunction; |
| |
| // Make sure that we keep track of the linkage type even if there was a |
| // previous "declare". |
| (yyval.FunctionVal)->setLinkage((yyvsp[-2].Linkage)); |
| ;} |
| break; |
| |
| case 220: |
| #line 2149 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.FunctionVal) = (yyvsp[-1].FunctionVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 221: |
| #line 2154 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| CurFun.CurrentFunction->setLinkage((yyvsp[-1].Linkage)); |
| (yyval.FunctionVal) = CurFun.CurrentFunction; |
| CurFun.FunctionDone(); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 222: |
| #line 2165 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.BoolVal) = false; |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 223: |
| #line 2169 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.BoolVal) = true; |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 224: |
| #line 2174 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { // A reference to a direct constant |
| (yyval.ValIDVal) = ValID::create((yyvsp[0].SInt64Val)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 225: |
| #line 2178 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ValIDVal) = ValID::create((yyvsp[0].UInt64Val)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 226: |
| #line 2182 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { // Perhaps it's an FP constant? |
| (yyval.ValIDVal) = ValID::create((yyvsp[0].FPVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 227: |
| #line 2186 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ValIDVal) = ValID::create(ConstantInt::getTrue()); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 228: |
| #line 2190 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ValIDVal) = ValID::create(ConstantInt::getFalse()); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 229: |
| #line 2194 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ValIDVal) = ValID::createNull(); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 230: |
| #line 2198 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ValIDVal) = ValID::createUndef(); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 231: |
| #line 2202 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { // A vector zero constant. |
| (yyval.ValIDVal) = ValID::createZeroInit(); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 232: |
| #line 2206 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { // Nonempty unsized packed vector |
| const Type *ETy = (*(yyvsp[-1].ConstVector))[0]->getType(); |
| int NumElements = (yyvsp[-1].ConstVector)->size(); |
| |
| PackedType* pt = PackedType::get(ETy, NumElements); |
| PATypeHolder* PTy = new PATypeHolder( |
| HandleUpRefs( |
| PackedType::get( |
| ETy, |
| NumElements) |
| ) |
| ); |
| |
| // Verify all elements are correct type! |
| for (unsigned i = 0; i < (yyvsp[-1].ConstVector)->size(); i++) { |
| if (ETy != (*(yyvsp[-1].ConstVector))[i]->getType()) |
| GEN_ERROR("Element #" + utostr(i) + " is not of type '" + |
| ETy->getDescription() +"' as required!\nIt is of type '" + |
| (*(yyvsp[-1].ConstVector))[i]->getType()->getDescription() + "'."); |
| } |
| |
| (yyval.ValIDVal) = ValID::create(ConstantPacked::get(pt, *(yyvsp[-1].ConstVector))); |
| delete PTy; delete (yyvsp[-1].ConstVector); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 233: |
| #line 2231 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ValIDVal) = ValID::create((yyvsp[0].ConstVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 234: |
| #line 2235 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| char *End = UnEscapeLexed((yyvsp[-2].StrVal), true); |
| std::string AsmStr = std::string((yyvsp[-2].StrVal), End); |
| End = UnEscapeLexed((yyvsp[0].StrVal), true); |
| std::string Constraints = std::string((yyvsp[0].StrVal), End); |
| (yyval.ValIDVal) = ValID::createInlineAsm(AsmStr, Constraints, (yyvsp[-3].BoolVal)); |
| free((yyvsp[-2].StrVal)); |
| free((yyvsp[0].StrVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 235: |
| #line 2249 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { // Is it an integer reference...? |
| (yyval.ValIDVal) = ValID::create((yyvsp[0].SIntVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 236: |
| #line 2253 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { // Is it a named reference...? |
| (yyval.ValIDVal) = ValID::create((yyvsp[0].StrVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 239: |
| #line 2265 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[-1].TypeVal))->getDescription()); |
| (yyval.ValueVal) = getVal(*(yyvsp[-1].TypeVal), (yyvsp[0].ValIDVal)); |
| delete (yyvsp[-1].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 240: |
| #line 2274 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.FunctionVal) = (yyvsp[-1].FunctionVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 241: |
| #line 2278 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { // Do not allow functions with 0 basic blocks |
| (yyval.FunctionVal) = (yyvsp[-1].FunctionVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 242: |
| #line 2287 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| setValueName((yyvsp[0].TermInstVal), (yyvsp[-1].StrVal)); |
| CHECK_FOR_ERROR |
| InsertValue((yyvsp[0].TermInstVal)); |
| |
| (yyvsp[-2].BasicBlockVal)->getInstList().push_back((yyvsp[0].TermInstVal)); |
| InsertValue((yyvsp[-2].BasicBlockVal)); |
| (yyval.BasicBlockVal) = (yyvsp[-2].BasicBlockVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 243: |
| #line 2298 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (CastInst *CI1 = dyn_cast<CastInst>((yyvsp[0].InstVal))) |
| if (CastInst *CI2 = dyn_cast<CastInst>(CI1->getOperand(0))) |
| if (CI2->getParent() == 0) |
| (yyvsp[-1].BasicBlockVal)->getInstList().push_back(CI2); |
| (yyvsp[-1].BasicBlockVal)->getInstList().push_back((yyvsp[0].InstVal)); |
| (yyval.BasicBlockVal) = (yyvsp[-1].BasicBlockVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 244: |
| #line 2307 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.BasicBlockVal) = getBBVal(ValID::create((int)CurFun.NextBBNum++), true); |
| CHECK_FOR_ERROR |
| |
| // Make sure to move the basic block to the correct location in the |
| // function, instead of leaving it inserted wherever it was first |
| // referenced. |
| Function::BasicBlockListType &BBL = |
| CurFun.CurrentFunction->getBasicBlockList(); |
| BBL.splice(BBL.end(), BBL, (yyval.BasicBlockVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 245: |
| #line 2319 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.BasicBlockVal) = getBBVal(ValID::create((yyvsp[0].StrVal)), true); |
| CHECK_FOR_ERROR |
| |
| // Make sure to move the basic block to the correct location in the |
| // function, instead of leaving it inserted wherever it was first |
| // referenced. |
| Function::BasicBlockListType &BBL = |
| CurFun.CurrentFunction->getBasicBlockList(); |
| BBL.splice(BBL.end(), BBL, (yyval.BasicBlockVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 246: |
| #line 2332 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { // Return with a result... |
| (yyval.TermInstVal) = new ReturnInst((yyvsp[0].ValueVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 247: |
| #line 2336 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { // Return with no result... |
| (yyval.TermInstVal) = new ReturnInst(); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 248: |
| #line 2340 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { // Unconditional Branch... |
| BasicBlock* tmpBB = getBBVal((yyvsp[0].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyval.TermInstVal) = new BranchInst(tmpBB); |
| ;} |
| break; |
| |
| case 249: |
| #line 2345 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| BasicBlock* tmpBBA = getBBVal((yyvsp[-3].ValIDVal)); |
| CHECK_FOR_ERROR |
| BasicBlock* tmpBBB = getBBVal((yyvsp[0].ValIDVal)); |
| CHECK_FOR_ERROR |
| Value* tmpVal = getVal(Type::Int1Ty, (yyvsp[-6].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyval.TermInstVal) = new BranchInst(tmpBBA, tmpBBB, tmpVal); |
| ;} |
| break; |
| |
| case 250: |
| #line 2354 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| Value* tmpVal = getVal((yyvsp[-7].PrimType), (yyvsp[-6].ValIDVal)); |
| CHECK_FOR_ERROR |
| BasicBlock* tmpBB = getBBVal((yyvsp[-3].ValIDVal)); |
| CHECK_FOR_ERROR |
| SwitchInst *S = new SwitchInst(tmpVal, tmpBB, (yyvsp[-1].JumpTable)->size()); |
| (yyval.TermInstVal) = S; |
| |
| std::vector<std::pair<Constant*,BasicBlock*> >::iterator I = (yyvsp[-1].JumpTable)->begin(), |
| E = (yyvsp[-1].JumpTable)->end(); |
| for (; I != E; ++I) { |
| if (ConstantInt *CI = dyn_cast<ConstantInt>(I->first)) |
| S->addCase(CI, I->second); |
| else |
| GEN_ERROR("Switch case is constant, but not a simple integer!"); |
| } |
| delete (yyvsp[-1].JumpTable); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 251: |
| #line 2373 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| Value* tmpVal = getVal((yyvsp[-6].PrimType), (yyvsp[-5].ValIDVal)); |
| CHECK_FOR_ERROR |
| BasicBlock* tmpBB = getBBVal((yyvsp[-2].ValIDVal)); |
| CHECK_FOR_ERROR |
| SwitchInst *S = new SwitchInst(tmpVal, tmpBB, 0); |
| (yyval.TermInstVal) = S; |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 252: |
| #line 2383 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| |
| // Handle the short syntax |
| const PointerType *PFTy = 0; |
| const FunctionType *Ty = 0; |
| if (!(PFTy = dyn_cast<PointerType>((yyvsp[-11].TypeVal)->get())) || |
| !(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) { |
| // Pull out the types of all of the arguments... |
| std::vector<const Type*> ParamTypes; |
| FunctionType::ParamAttrsList ParamAttrs; |
| ParamAttrs.push_back((yyvsp[-6].ParamAttrs)); |
| for (ValueRefList::iterator I = (yyvsp[-8].ValueRefList)->begin(), E = (yyvsp[-8].ValueRefList)->end(); 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); |
| ParamAttrs.push_back(I->Attrs); |
| } |
| |
| Ty = FunctionType::get((yyvsp[-11].TypeVal)->get(), ParamTypes, false, ParamAttrs); |
| PFTy = PointerType::get(Ty); |
| } |
| |
| Value *V = getVal(PFTy, (yyvsp[-10].ValIDVal)); // Get the function we're calling... |
| CHECK_FOR_ERROR |
| BasicBlock *Normal = getBBVal((yyvsp[-3].ValIDVal)); |
| CHECK_FOR_ERROR |
| BasicBlock *Except = getBBVal((yyvsp[0].ValIDVal)); |
| CHECK_FOR_ERROR |
| |
| // Check the arguments |
| ValueList Args; |
| if ((yyvsp[-8].ValueRefList)->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(); |
| ValueRefList::iterator ArgI = (yyvsp[-8].ValueRefList)->begin(), ArgE = (yyvsp[-8].ValueRefList)->end(); |
| |
| for (; ArgI != ArgE && I != E; ++ArgI, ++I) { |
| if (ArgI->Val->getType() != *I) |
| GEN_ERROR("Parameter " + ArgI->Val->getName()+ " is not of type '" + |
| (*I)->getDescription() + "'!"); |
| Args.push_back(ArgI->Val); |
| } |
| |
| 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!"); |
| } |
| |
| // Create the InvokeInst |
| InvokeInst *II = new InvokeInst(V, Normal, Except, Args); |
| II->setCallingConv((yyvsp[-12].UIntVal)); |
| (yyval.TermInstVal) = II; |
| delete (yyvsp[-8].ValueRefList); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 253: |
| #line 2449 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.TermInstVal) = new UnwindInst(); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 254: |
| #line 2453 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.TermInstVal) = new UnreachableInst(); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 255: |
| #line 2460 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.JumpTable) = (yyvsp[-5].JumpTable); |
| Constant *V = cast<Constant>(getValNonImprovising((yyvsp[-4].PrimType), (yyvsp[-3].ValIDVal))); |
| CHECK_FOR_ERROR |
| if (V == 0) |
| GEN_ERROR("May only switch on a constant pool value!"); |
| |
| BasicBlock* tmpBB = getBBVal((yyvsp[0].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyval.JumpTable)->push_back(std::make_pair(V, tmpBB)); |
| ;} |
| break; |
| |
| case 256: |
| #line 2471 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.JumpTable) = new std::vector<std::pair<Constant*, BasicBlock*> >(); |
| Constant *V = cast<Constant>(getValNonImprovising((yyvsp[-4].PrimType), (yyvsp[-3].ValIDVal))); |
| CHECK_FOR_ERROR |
| |
| if (V == 0) |
| GEN_ERROR("May only switch on a constant pool value!"); |
| |
| BasicBlock* tmpBB = getBBVal((yyvsp[0].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyval.JumpTable)->push_back(std::make_pair(V, tmpBB)); |
| ;} |
| break; |
| |
| case 257: |
| #line 2484 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| // Is this definition named?? if so, assign the name... |
| setValueName((yyvsp[0].InstVal), (yyvsp[-1].StrVal)); |
| CHECK_FOR_ERROR |
| InsertValue((yyvsp[0].InstVal)); |
| (yyval.InstVal) = (yyvsp[0].InstVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 258: |
| #line 2493 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { // Used for PHI nodes |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[-5].TypeVal))->getDescription()); |
| (yyval.PHIList) = new std::list<std::pair<Value*, BasicBlock*> >(); |
| Value* tmpVal = getVal(*(yyvsp[-5].TypeVal), (yyvsp[-3].ValIDVal)); |
| CHECK_FOR_ERROR |
| BasicBlock* tmpBB = getBBVal((yyvsp[-1].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyval.PHIList)->push_back(std::make_pair(tmpVal, tmpBB)); |
| delete (yyvsp[-5].TypeVal); |
| ;} |
| break; |
| |
| case 259: |
| #line 2504 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.PHIList) = (yyvsp[-6].PHIList); |
| Value* tmpVal = getVal((yyvsp[-6].PHIList)->front().first->getType(), (yyvsp[-3].ValIDVal)); |
| CHECK_FOR_ERROR |
| BasicBlock* tmpBB = getBBVal((yyvsp[-1].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyvsp[-6].PHIList)->push_back(std::make_pair(tmpVal, tmpBB)); |
| ;} |
| break; |
| |
| case 260: |
| #line 2514 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[-2].TypeVal))->getDescription()); |
| // Used for call and invoke instructions |
| (yyval.ValueRefList) = new ValueRefList(); |
| ValueRefListEntry E; E.Attrs = (yyvsp[0].ParamAttrs); E.Val = getVal((yyvsp[-2].TypeVal)->get(), (yyvsp[-1].ValIDVal)); |
| (yyval.ValueRefList)->push_back(E); |
| ;} |
| break; |
| |
| case 261: |
| #line 2522 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[-2].TypeVal))->getDescription()); |
| (yyval.ValueRefList) = (yyvsp[-4].ValueRefList); |
| ValueRefListEntry E; E.Attrs = (yyvsp[0].ParamAttrs); E.Val = getVal((yyvsp[-2].TypeVal)->get(), (yyvsp[-1].ValIDVal)); |
| (yyval.ValueRefList)->push_back(E); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 262: |
| #line 2530 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.ValueRefList) = new ValueRefList(); ;} |
| break; |
| |
| case 263: |
| #line 2533 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { (yyval.ValueList) = new std::vector<Value*>(); ;} |
| break; |
| |
| case 264: |
| #line 2534 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ValueList) = (yyvsp[-2].ValueList); |
| (yyval.ValueList)->push_back((yyvsp[0].ValueVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 265: |
| #line 2541 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.BoolVal) = true; |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 266: |
| #line 2545 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.BoolVal) = false; |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 267: |
| #line 2550 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[-3].TypeVal))->getDescription()); |
| if (!(*(yyvsp[-3].TypeVal))->isInteger() && !(*(yyvsp[-3].TypeVal))->isFloatingPoint() && |
| !isa<PackedType>((*(yyvsp[-3].TypeVal)).get())) |
| GEN_ERROR( |
| "Arithmetic operator requires integer, FP, or packed operands!"); |
| if (isa<PackedType>((*(yyvsp[-3].TypeVal)).get()) && |
| ((yyvsp[-4].BinaryOpVal) == Instruction::URem || |
| (yyvsp[-4].BinaryOpVal) == Instruction::SRem || |
| (yyvsp[-4].BinaryOpVal) == Instruction::FRem)) |
| GEN_ERROR("U/S/FRem not supported on packed types!"); |
| Value* val1 = getVal(*(yyvsp[-3].TypeVal), (yyvsp[-2].ValIDVal)); |
| CHECK_FOR_ERROR |
| Value* val2 = getVal(*(yyvsp[-3].TypeVal), (yyvsp[0].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyval.InstVal) = BinaryOperator::create((yyvsp[-4].BinaryOpVal), val1, val2); |
| if ((yyval.InstVal) == 0) |
| GEN_ERROR("binary operator returned null!"); |
| delete (yyvsp[-3].TypeVal); |
| ;} |
| break; |
| |
| case 268: |
| #line 2571 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[-3].TypeVal))->getDescription()); |
| if (!(*(yyvsp[-3].TypeVal))->isIntegral()) { |
| if (!isa<PackedType>((yyvsp[-3].TypeVal)->get()) || |
| !cast<PackedType>((yyvsp[-3].TypeVal)->get())->getElementType()->isIntegral()) |
| GEN_ERROR("Logical operator requires integral operands!"); |
| } |
| Value* tmpVal1 = getVal(*(yyvsp[-3].TypeVal), (yyvsp[-2].ValIDVal)); |
| CHECK_FOR_ERROR |
| Value* tmpVal2 = getVal(*(yyvsp[-3].TypeVal), (yyvsp[0].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyval.InstVal) = BinaryOperator::create((yyvsp[-4].BinaryOpVal), tmpVal1, tmpVal2); |
| if ((yyval.InstVal) == 0) |
| GEN_ERROR("binary operator returned null!"); |
| delete (yyvsp[-3].TypeVal); |
| ;} |
| break; |
| |
| case 269: |
| #line 2588 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[-3].TypeVal))->getDescription()); |
| if (isa<PackedType>((*(yyvsp[-3].TypeVal)).get())) |
| GEN_ERROR("Packed types not supported by icmp instruction"); |
| Value* tmpVal1 = getVal(*(yyvsp[-3].TypeVal), (yyvsp[-2].ValIDVal)); |
| CHECK_FOR_ERROR |
| Value* tmpVal2 = getVal(*(yyvsp[-3].TypeVal), (yyvsp[0].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyval.InstVal) = CmpInst::create((yyvsp[-5].OtherOpVal), (yyvsp[-4].IPredicate), tmpVal1, tmpVal2); |
| if ((yyval.InstVal) == 0) |
| GEN_ERROR("icmp operator returned null!"); |
| ;} |
| break; |
| |
| case 270: |
| #line 2601 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[-3].TypeVal))->getDescription()); |
| if (isa<PackedType>((*(yyvsp[-3].TypeVal)).get())) |
| GEN_ERROR("Packed types not supported by fcmp instruction"); |
| Value* tmpVal1 = getVal(*(yyvsp[-3].TypeVal), (yyvsp[-2].ValIDVal)); |
| CHECK_FOR_ERROR |
| Value* tmpVal2 = getVal(*(yyvsp[-3].TypeVal), (yyvsp[0].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyval.InstVal) = CmpInst::create((yyvsp[-5].OtherOpVal), (yyvsp[-4].FPredicate), tmpVal1, tmpVal2); |
| if ((yyval.InstVal) == 0) |
| GEN_ERROR("fcmp operator returned null!"); |
| ;} |
| break; |
| |
| case 271: |
| #line 2614 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| cerr << "WARNING: Use of eliminated 'not' instruction:" |
| << " Replacing with 'xor'.\n"; |
| |
| Value *Ones = ConstantInt::getAllOnesValue((yyvsp[0].ValueVal)->getType()); |
| if (Ones == 0) |
| GEN_ERROR("Expected integral type for not instruction!"); |
| |
| (yyval.InstVal) = BinaryOperator::create(Instruction::Xor, (yyvsp[0].ValueVal), Ones); |
| if ((yyval.InstVal) == 0) |
| GEN_ERROR("Could not create a xor instruction!"); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 272: |
| #line 2627 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if ((yyvsp[0].ValueVal)->getType() != Type::Int8Ty) |
| GEN_ERROR("Shift amount must be i8 type!"); |
| if (!(yyvsp[-2].ValueVal)->getType()->isInteger()) |
| GEN_ERROR("Shift constant expression requires integer operand!"); |
| CHECK_FOR_ERROR; |
| (yyval.InstVal) = new ShiftInst((yyvsp[-3].OtherOpVal), (yyvsp[-2].ValueVal), (yyvsp[0].ValueVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 273: |
| #line 2636 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[0].TypeVal))->getDescription()); |
| Value* Val = (yyvsp[-2].ValueVal); |
| const Type* Ty = (yyvsp[0].TypeVal)->get(); |
| if (!Val->getType()->isFirstClassType()) |
| GEN_ERROR("cast from a non-primitive type: '" + |
| Val->getType()->getDescription() + "'!"); |
| if (!Ty->isFirstClassType()) |
| GEN_ERROR("cast to a non-primitive type: '" + Ty->getDescription() +"'!"); |
| (yyval.InstVal) = CastInst::create((yyvsp[-3].CastOpVal), Val, (yyvsp[0].TypeVal)->get()); |
| delete (yyvsp[0].TypeVal); |
| ;} |
| break; |
| |
| case 274: |
| #line 2649 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if ((yyvsp[-4].ValueVal)->getType() != Type::Int1Ty) |
| GEN_ERROR("select condition must be boolean!"); |
| if ((yyvsp[-2].ValueVal)->getType() != (yyvsp[0].ValueVal)->getType()) |
| GEN_ERROR("select value types should match!"); |
| (yyval.InstVal) = new SelectInst((yyvsp[-4].ValueVal), (yyvsp[-2].ValueVal), (yyvsp[0].ValueVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 275: |
| #line 2657 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[0].TypeVal))->getDescription()); |
| (yyval.InstVal) = new VAArgInst((yyvsp[-2].ValueVal), *(yyvsp[0].TypeVal)); |
| delete (yyvsp[0].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 276: |
| #line 2664 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!ExtractElementInst::isValidOperands((yyvsp[-2].ValueVal), (yyvsp[0].ValueVal))) |
| GEN_ERROR("Invalid extractelement operands!"); |
| (yyval.InstVal) = new ExtractElementInst((yyvsp[-2].ValueVal), (yyvsp[0].ValueVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 277: |
| #line 2670 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!InsertElementInst::isValidOperands((yyvsp[-4].ValueVal), (yyvsp[-2].ValueVal), (yyvsp[0].ValueVal))) |
| GEN_ERROR("Invalid insertelement operands!"); |
| (yyval.InstVal) = new InsertElementInst((yyvsp[-4].ValueVal), (yyvsp[-2].ValueVal), (yyvsp[0].ValueVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 278: |
| #line 2676 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!ShuffleVectorInst::isValidOperands((yyvsp[-4].ValueVal), (yyvsp[-2].ValueVal), (yyvsp[0].ValueVal))) |
| GEN_ERROR("Invalid shufflevector operands!"); |
| (yyval.InstVal) = new ShuffleVectorInst((yyvsp[-4].ValueVal), (yyvsp[-2].ValueVal), (yyvsp[0].ValueVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 279: |
| #line 2682 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| const Type *Ty = (yyvsp[0].PHIList)->front().first->getType(); |
| if (!Ty->isFirstClassType()) |
| GEN_ERROR("PHI node operands must be of first class type!"); |
| (yyval.InstVal) = new PHINode(Ty); |
| ((PHINode*)(yyval.InstVal))->reserveOperandSpace((yyvsp[0].PHIList)->size()); |
| while ((yyvsp[0].PHIList)->begin() != (yyvsp[0].PHIList)->end()) { |
| if ((yyvsp[0].PHIList)->front().first->getType() != Ty) |
| GEN_ERROR("All elements of a PHI node must be of the same type!"); |
| cast<PHINode>((yyval.InstVal))->addIncoming((yyvsp[0].PHIList)->front().first, (yyvsp[0].PHIList)->front().second); |
| (yyvsp[0].PHIList)->pop_front(); |
| } |
| delete (yyvsp[0].PHIList); // Free the list... |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 280: |
| #line 2698 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| |
| // Handle the short syntax |
| const PointerType *PFTy = 0; |
| const FunctionType *Ty = 0; |
| if (!(PFTy = dyn_cast<PointerType>((yyvsp[-5].TypeVal)->get())) || |
| !(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) { |
| // Pull out the types of all of the arguments... |
| std::vector<const Type*> ParamTypes; |
| FunctionType::ParamAttrsList ParamAttrs; |
| ParamAttrs.push_back((yyvsp[0].ParamAttrs)); |
| for (ValueRefList::iterator I = (yyvsp[-2].ValueRefList)->begin(), E = (yyvsp[-2].ValueRefList)->end(); 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); |
| ParamAttrs.push_back(I->Attrs); |
| } |
| |
| Ty = FunctionType::get((yyvsp[-5].TypeVal)->get(), ParamTypes, false, ParamAttrs); |
| PFTy = PointerType::get(Ty); |
| } |
| |
| Value *V = getVal(PFTy, (yyvsp[-4].ValIDVal)); // Get the function we're calling... |
| CHECK_FOR_ERROR |
| |
| // Check the arguments |
| ValueList Args; |
| if ((yyvsp[-2].ValueRefList)->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(); |
| ValueRefList::iterator ArgI = (yyvsp[-2].ValueRefList)->begin(), ArgE = (yyvsp[-2].ValueRefList)->end(); |
| |
| for (; ArgI != ArgE && I != E; ++ArgI, ++I) { |
| if (ArgI->Val->getType() != *I) |
| GEN_ERROR("Parameter " + ArgI->Val->getName()+ " is not of type '" + |
| (*I)->getDescription() + "'!"); |
| Args.push_back(ArgI->Val); |
| } |
| 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!"); |
| } |
| // Create the call node |
| CallInst *CI = new CallInst(V, Args); |
| CI->setTailCall((yyvsp[-7].BoolVal)); |
| CI->setCallingConv((yyvsp[-6].UIntVal)); |
| (yyval.InstVal) = CI; |
| delete (yyvsp[-2].ValueRefList); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 281: |
| #line 2760 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.InstVal) = (yyvsp[0].InstVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 282: |
| #line 2765 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.BoolVal) = true; |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 283: |
| #line 2769 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.BoolVal) = false; |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 284: |
| #line 2776 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[-1].TypeVal))->getDescription()); |
| (yyval.InstVal) = new MallocInst(*(yyvsp[-1].TypeVal), 0, (yyvsp[0].UIntVal)); |
| delete (yyvsp[-1].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 285: |
| #line 2783 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[-4].TypeVal))->getDescription()); |
| Value* tmpVal = getVal((yyvsp[-2].PrimType), (yyvsp[-1].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyval.InstVal) = new MallocInst(*(yyvsp[-4].TypeVal), tmpVal, (yyvsp[0].UIntVal)); |
| delete (yyvsp[-4].TypeVal); |
| ;} |
| break; |
| |
| case 286: |
| #line 2791 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[-1].TypeVal))->getDescription()); |
| (yyval.InstVal) = new AllocaInst(*(yyvsp[-1].TypeVal), 0, (yyvsp[0].UIntVal)); |
| delete (yyvsp[-1].TypeVal); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 287: |
| #line 2798 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[-4].TypeVal))->getDescription()); |
| Value* tmpVal = getVal((yyvsp[-2].PrimType), (yyvsp[-1].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyval.InstVal) = new AllocaInst(*(yyvsp[-4].TypeVal), tmpVal, (yyvsp[0].UIntVal)); |
| delete (yyvsp[-4].TypeVal); |
| ;} |
| break; |
| |
| case 288: |
| #line 2806 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!isa<PointerType>((yyvsp[0].ValueVal)->getType())) |
| GEN_ERROR("Trying to free nonpointer type " + |
| (yyvsp[0].ValueVal)->getType()->getDescription() + "!"); |
| (yyval.InstVal) = new FreeInst((yyvsp[0].ValueVal)); |
| CHECK_FOR_ERROR |
| ;} |
| break; |
| |
| case 289: |
| #line 2814 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[-1].TypeVal))->getDescription()); |
| if (!isa<PointerType>((yyvsp[-1].TypeVal)->get())) |
| GEN_ERROR("Can't load from nonpointer type: " + |
| (*(yyvsp[-1].TypeVal))->getDescription()); |
| if (!cast<PointerType>((yyvsp[-1].TypeVal)->get())->getElementType()->isFirstClassType()) |
| GEN_ERROR("Can't load from pointer of non-first-class type: " + |
| (*(yyvsp[-1].TypeVal))->getDescription()); |
| Value* tmpVal = getVal(*(yyvsp[-1].TypeVal), (yyvsp[0].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyval.InstVal) = new LoadInst(tmpVal, "", (yyvsp[-3].BoolVal)); |
| delete (yyvsp[-1].TypeVal); |
| ;} |
| break; |
| |
| case 290: |
| #line 2828 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[-1].TypeVal))->getDescription()); |
| const PointerType *PT = dyn_cast<PointerType>((yyvsp[-1].TypeVal)->get()); |
| if (!PT) |
| GEN_ERROR("Can't store to a nonpointer type: " + |
| (*(yyvsp[-1].TypeVal))->getDescription()); |
| const Type *ElTy = PT->getElementType(); |
| if (ElTy != (yyvsp[-3].ValueVal)->getType()) |
| GEN_ERROR("Can't store '" + (yyvsp[-3].ValueVal)->getType()->getDescription() + |
| "' into space of type '" + ElTy->getDescription() + "'!"); |
| |
| Value* tmpVal = getVal(*(yyvsp[-1].TypeVal), (yyvsp[0].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyval.InstVal) = new StoreInst((yyvsp[-3].ValueVal), tmpVal, (yyvsp[-5].BoolVal)); |
| delete (yyvsp[-1].TypeVal); |
| ;} |
| break; |
| |
| case 291: |
| #line 2845 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[-2].TypeVal))->getDescription()); |
| if (!isa<PointerType>((yyvsp[-2].TypeVal)->get())) |
| GEN_ERROR("getelementptr insn requires pointer operand!"); |
| |
| if (!GetElementPtrInst::getIndexedType(*(yyvsp[-2].TypeVal), *(yyvsp[0].ValueList), true)) |
| GEN_ERROR("Invalid getelementptr indices for type '" + |
| (*(yyvsp[-2].TypeVal))->getDescription()+ "'!"); |
| Value* tmpVal = getVal(*(yyvsp[-2].TypeVal), (yyvsp[-1].ValIDVal)); |
| CHECK_FOR_ERROR |
| (yyval.InstVal) = new GetElementPtrInst(tmpVal, *(yyvsp[0].ValueList)); |
| delete (yyvsp[-2].TypeVal); |
| delete (yyvsp[0].ValueList); |
| ;} |
| break; |
| |
| |
| default: break; |
| } |
| |
| /* Line 1126 of yacc.c. */ |
| #line 5638 "llvmAsmParser.tab.c" |
| |
| yyvsp -= yylen; |
| yyssp -= yylen; |
| |
| |
| YY_STACK_PRINT (yyss, yyssp); |
| |
| *++yyvsp = yyval; |
| |
| |
| /* Now `shift' the result of the reduction. Determine what state |
| that goes to, based on the state we popped back to and the rule |
| number reduced by. */ |
| |
| yyn = yyr1[yyn]; |
| |
| yystate = yypgoto[yyn - YYNTOKENS] + *yyssp; |
| if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp) |
| yystate = yytable[yystate]; |
| else |
| yystate = yydefgoto[yyn - YYNTOKENS]; |
| |
| goto yynewstate; |
| |
| |
| /*------------------------------------. |
| | yyerrlab -- here on detecting error | |
| `------------------------------------*/ |
| yyerrlab: |
| /* If not already recovering from an error, report this error. */ |
| if (!yyerrstatus) |
| { |
| ++yynerrs; |
| #if YYERROR_VERBOSE |
| yyn = yypact[yystate]; |
| |
| if (YYPACT_NINF < yyn && yyn < YYLAST) |
| { |
| int yytype = YYTRANSLATE (yychar); |
| YYSIZE_T yysize0 = yytnamerr (0, yytname[yytype]); |
| YYSIZE_T yysize = yysize0; |
| YYSIZE_T yysize1; |
| int yysize_overflow = 0; |
| char *yymsg = 0; |
| # define YYERROR_VERBOSE_ARGS_MAXIMUM 5 |
| char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM]; |
| int yyx; |
| |
| #if 0 |
| /* This is so xgettext sees the translatable formats that are |
| constructed on the fly. */ |
| YY_("syntax error, unexpected %s"); |
| YY_("syntax error, unexpected %s, expecting %s"); |
| YY_("syntax error, unexpected %s, expecting %s or %s"); |
| YY_("syntax error, unexpected %s, expecting %s or %s or %s"); |
| YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s"); |
| #endif |
| char *yyfmt; |
| char const *yyf; |
| static char const yyunexpected[] = "syntax error, unexpected %s"; |
| static char const yyexpecting[] = ", expecting %s"; |
| static char const yyor[] = " or %s"; |
| char yyformat[sizeof yyunexpected |
| + sizeof yyexpecting - 1 |
| + ((YYERROR_VERBOSE_ARGS_MAXIMUM - 2) |
| * (sizeof yyor - 1))]; |
| char const *yyprefix = yyexpecting; |
| |
| /* Start YYX at -YYN if negative to avoid negative indexes in |
| YYCHECK. */ |
| int yyxbegin = yyn < 0 ? -yyn : 0; |
| |
| /* Stay within bounds of both yycheck and yytname. */ |
| int yychecklim = YYLAST - yyn; |
| int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS; |
| int yycount = 1; |
| |
| yyarg[0] = yytname[yytype]; |
| yyfmt = yystpcpy (yyformat, yyunexpected); |
| |
| for (yyx = yyxbegin; yyx < yyxend; ++yyx) |
| if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR) |
| { |
| if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM) |
| { |
| yycount = 1; |
| yysize = yysize0; |
| yyformat[sizeof yyunexpected - 1] = '\0'; |
| break; |
| } |
| yyarg[yycount++] = yytname[yyx]; |
| yysize1 = yysize + yytnamerr (0, yytname[yyx]); |
| yysize_overflow |= yysize1 < yysize; |
| yysize = yysize1; |
| yyfmt = yystpcpy (yyfmt, yyprefix); |
| yyprefix = yyor; |
| } |
| |
| yyf = YY_(yyformat); |
| yysize1 = yysize + yystrlen (yyf); |
| yysize_overflow |= yysize1 < yysize; |
| yysize = yysize1; |
| |
| if (!yysize_overflow && yysize <= YYSTACK_ALLOC_MAXIMUM) |
| yymsg = (char *) YYSTACK_ALLOC (yysize); |
| if (yymsg) |
| { |
| /* Avoid sprintf, as that infringes on the user's name space. |
| Don't have undefined behavior even if the translation |
| produced a string with the wrong number of "%s"s. */ |
| char *yyp = yymsg; |
| int yyi = 0; |
| while ((*yyp = *yyf)) |
| { |
| if (*yyp == '%' && yyf[1] == 's' && yyi < yycount) |
| { |
| yyp += yytnamerr (yyp, yyarg[yyi++]); |
| yyf += 2; |
| } |
| else |
| { |
| yyp++; |
| yyf++; |
| } |
| } |
| yyerror (yymsg); |
| YYSTACK_FREE (yymsg); |
| } |
| else |
| { |
| yyerror (YY_("syntax error")); |
| goto yyexhaustedlab; |
| } |
| } |
| else |
| #endif /* YYERROR_VERBOSE */ |
| yyerror (YY_("syntax error")); |
| } |
| |
| |
| |
| if (yyerrstatus == 3) |
| { |
| /* If just tried and failed to reuse look-ahead token after an |
| error, discard it. */ |
| |
| if (yychar <= YYEOF) |
| { |
| /* Return failure if at end of input. */ |
| if (yychar == YYEOF) |
| YYABORT; |
| } |
| else |
| { |
| yydestruct ("Error: discarding", yytoken, &yylval); |
| yychar = YYEMPTY; |
| } |
| } |
| |
| /* Else will try to reuse look-ahead token after shifting the error |
| token. */ |
| goto yyerrlab1; |
| |
| |
| /*---------------------------------------------------. |
| | yyerrorlab -- error raised explicitly by YYERROR. | |
| `---------------------------------------------------*/ |
| yyerrorlab: |
| |
| /* Pacify compilers like GCC when the user code never invokes |
| YYERROR and the label yyerrorlab therefore never appears in user |
| code. */ |
| if (0) |
| goto yyerrorlab; |
| |
| yyvsp -= yylen; |
| yyssp -= yylen; |
| yystate = *yyssp; |
| goto yyerrlab1; |
| |
| |
| /*-------------------------------------------------------------. |
| | yyerrlab1 -- common code for both syntax error and YYERROR. | |
| `-------------------------------------------------------------*/ |
| yyerrlab1: |
| yyerrstatus = 3; /* Each real token shifted decrements this. */ |
| |
| for (;;) |
| { |
| yyn = yypact[yystate]; |
| if (yyn != YYPACT_NINF) |
| { |
| yyn += YYTERROR; |
| if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR) |
| { |
| yyn = yytable[yyn]; |
| if (0 < yyn) |
| break; |
| } |
| } |
| |
| /* Pop the current state because it cannot handle the error token. */ |
| if (yyssp == yyss) |
| YYABORT; |
| |
| |
| yydestruct ("Error: popping", yystos[yystate], yyvsp); |
| YYPOPSTACK; |
| yystate = *yyssp; |
| YY_STACK_PRINT (yyss, yyssp); |
| } |
| |
| if (yyn == YYFINAL) |
| YYACCEPT; |
| |
| *++yyvsp = yylval; |
| |
| |
| /* Shift the error token. */ |
| YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp); |
| |
| yystate = yyn; |
| goto yynewstate; |
| |
| |
| /*-------------------------------------. |
| | yyacceptlab -- YYACCEPT comes here. | |
| `-------------------------------------*/ |
| yyacceptlab: |
| yyresult = 0; |
| goto yyreturn; |
| |
| /*-----------------------------------. |
| | yyabortlab -- YYABORT comes here. | |
| `-----------------------------------*/ |
| yyabortlab: |
| yyresult = 1; |
| goto yyreturn; |
| |
| #ifndef yyoverflow |
| /*-------------------------------------------------. |
| | yyexhaustedlab -- memory exhaustion comes here. | |
| `-------------------------------------------------*/ |
| yyexhaustedlab: |
| yyerror (YY_("memory exhausted")); |
| yyresult = 2; |
| /* Fall through. */ |
| #endif |
| |
| yyreturn: |
| if (yychar != YYEOF && yychar != YYEMPTY) |
| yydestruct ("Cleanup: discarding lookahead", |
| yytoken, &yylval); |
| while (yyssp != yyss) |
| { |
| yydestruct ("Cleanup: popping", |
| yystos[*yyssp], yyvsp); |
| YYPOPSTACK; |
| } |
| #ifndef yyoverflow |
| if (yyss != yyssa) |
| YYSTACK_FREE (yyss); |
| #endif |
| return yyresult; |
| } |
| |
| |
| #line 2862 "/proj/llvm/llvm-4/lib/AsmParser/llvmAsmParser.y" |
| |
| |
| // common code from the two 'RunVMAsmParser' functions |
| static Module* RunParser(Module * M) { |
| |
| llvmAsmlineno = 1; // Reset the current line number... |
| CurModule.CurrentModule = M; |
| #if YYDEBUG |
| yydebug = Debug; |
| #endif |
| |
| // Check to make sure the parser succeeded |
| if (yyparse()) { |
| if (ParserResult) |
| delete ParserResult; |
| return 0; |
| } |
| |
| // Check to make sure that parsing produced a result |
| if (!ParserResult) |
| return 0; |
| |
| // Reset ParserResult variable while saving its value for the result. |
| Module *Result = ParserResult; |
| ParserResult = 0; |
| |
| return Result; |
| } |
| |
| void llvm::GenerateError(const std::string &message, int LineNo) { |
| if (LineNo == -1) LineNo = llvmAsmlineno; |
| // TODO: column number in exception |
| if (TheParseError) |
| TheParseError->setError(CurFilename, message, LineNo); |
| TriggerError = 1; |
| } |
| |
| int yyerror(const char *ErrorMsg) { |
| std::string where |
| = std::string((CurFilename == "-") ? std::string("<stdin>") : CurFilename) |
| + ":" + utostr((unsigned) llvmAsmlineno) + ": "; |
| std::string errMsg = std::string(ErrorMsg) + "\n" + where + " while reading "; |
| if (yychar == YYEMPTY || yychar == 0) |
| errMsg += "end-of-file."; |
| else |
| errMsg += "token: '" + std::string(llvmAsmtext, llvmAsmleng) + "'"; |
| GenerateError(errMsg); |
| return 0; |
| } |
| |