| /* A Bison parser, made by GNU Bison 1.875d. */ |
| |
| /* Skeleton parser for Yacc-like parsing with Bison, |
| Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc. |
| |
| This program is free software; you can redistribute it and/or modify |
| it under the terms of the GNU General Public License as published by |
| the Free Software Foundation; either version 2, or (at your option) |
| any later version. |
| |
| This program is distributed in the hope that it will be useful, |
| but WITHOUT ANY WARRANTY; without even the implied warranty of |
| MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| GNU General Public License for more details. |
| |
| You should have received a copy of the GNU General Public License |
| along with this program; if not, write to the Free Software |
| Foundation, Inc., 59 Temple Place - Suite 330, |
| Boston, MA 02111-1307, USA. */ |
| |
| /* As a special exception, when this file is copied by Bison into a |
| Bison output file, you may use that output file without restriction. |
| This special exception was added by the Free Software Foundation |
| in version 1.24 of Bison. */ |
| |
| /* 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 |
| |
| /* Skeleton name. */ |
| #define YYSKELETON_NAME "yacc.c" |
| |
| /* Pure parsers. */ |
| #define YYPURE 0 |
| |
| /* Using locations. */ |
| #define YYLSP_NEEDED 0 |
| |
| /* If NAME_PREFIX is specified substitute the variables and functions |
| names. */ |
| #define yyparse llvmAsmparse |
| #define yylex llvmAsmlex |
| #define yyerror llvmAsmerror |
| #define yylval llvmAsmlval |
| #define yychar llvmAsmchar |
| #define yydebug llvmAsmdebug |
| #define yynerrs llvmAsmnerrs |
| |
| |
| /* Tokens. */ |
| #ifndef YYTOKENTYPE |
| # define YYTOKENTYPE |
| /* Put the tokens into the symbol table, so that GDB and other debuggers |
| know about them. */ |
| enum yytokentype { |
| ESINT64VAL = 258, |
| EUINT64VAL = 259, |
| SINTVAL = 260, |
| UINTVAL = 261, |
| FPVAL = 262, |
| VOID = 263, |
| BOOL = 264, |
| SBYTE = 265, |
| UBYTE = 266, |
| SHORT = 267, |
| USHORT = 268, |
| INT = 269, |
| UINT = 270, |
| LONG = 271, |
| ULONG = 272, |
| FLOAT = 273, |
| DOUBLE = 274, |
| TYPE = 275, |
| LABEL = 276, |
| VAR_ID = 277, |
| LABELSTR = 278, |
| STRINGCONSTANT = 279, |
| IMPLEMENTATION = 280, |
| ZEROINITIALIZER = 281, |
| TRUETOK = 282, |
| FALSETOK = 283, |
| BEGINTOK = 284, |
| ENDTOK = 285, |
| DECLARE = 286, |
| GLOBAL = 287, |
| CONSTANT = 288, |
| VOLATILE = 289, |
| TO = 290, |
| DOTDOTDOT = 291, |
| NULL_TOK = 292, |
| UNDEF = 293, |
| CONST = 294, |
| INTERNAL = 295, |
| LINKONCE = 296, |
| WEAK = 297, |
| APPENDING = 298, |
| OPAQUE = 299, |
| NOT = 300, |
| EXTERNAL = 301, |
| TARGET = 302, |
| TRIPLE = 303, |
| ENDIAN = 304, |
| POINTERSIZE = 305, |
| LITTLE = 306, |
| BIG = 307, |
| DEPLIBS = 308, |
| CALL = 309, |
| TAIL = 310, |
| CC_TOK = 311, |
| CCC_TOK = 312, |
| FASTCC_TOK = 313, |
| COLDCC_TOK = 314, |
| RET = 315, |
| BR = 316, |
| SWITCH = 317, |
| INVOKE = 318, |
| UNWIND = 319, |
| UNREACHABLE = 320, |
| ADD = 321, |
| SUB = 322, |
| MUL = 323, |
| DIV = 324, |
| REM = 325, |
| AND = 326, |
| OR = 327, |
| XOR = 328, |
| SETLE = 329, |
| SETGE = 330, |
| SETLT = 331, |
| SETGT = 332, |
| SETEQ = 333, |
| SETNE = 334, |
| MALLOC = 335, |
| ALLOCA = 336, |
| FREE = 337, |
| LOAD = 338, |
| STORE = 339, |
| GETELEMENTPTR = 340, |
| PHI_TOK = 341, |
| CAST = 342, |
| SELECT = 343, |
| SHL = 344, |
| SHR = 345, |
| VAARG = 346, |
| VAARG_old = 347, |
| VANEXT_old = 348 |
| }; |
| #endif |
| #define ESINT64VAL 258 |
| #define EUINT64VAL 259 |
| #define SINTVAL 260 |
| #define UINTVAL 261 |
| #define FPVAL 262 |
| #define VOID 263 |
| #define BOOL 264 |
| #define SBYTE 265 |
| #define UBYTE 266 |
| #define SHORT 267 |
| #define USHORT 268 |
| #define INT 269 |
| #define UINT 270 |
| #define LONG 271 |
| #define ULONG 272 |
| #define FLOAT 273 |
| #define DOUBLE 274 |
| #define TYPE 275 |
| #define LABEL 276 |
| #define VAR_ID 277 |
| #define LABELSTR 278 |
| #define STRINGCONSTANT 279 |
| #define IMPLEMENTATION 280 |
| #define ZEROINITIALIZER 281 |
| #define TRUETOK 282 |
| #define FALSETOK 283 |
| #define BEGINTOK 284 |
| #define ENDTOK 285 |
| #define DECLARE 286 |
| #define GLOBAL 287 |
| #define CONSTANT 288 |
| #define VOLATILE 289 |
| #define TO 290 |
| #define DOTDOTDOT 291 |
| #define NULL_TOK 292 |
| #define UNDEF 293 |
| #define CONST 294 |
| #define INTERNAL 295 |
| #define LINKONCE 296 |
| #define WEAK 297 |
| #define APPENDING 298 |
| #define OPAQUE 299 |
| #define NOT 300 |
| #define EXTERNAL 301 |
| #define TARGET 302 |
| #define TRIPLE 303 |
| #define ENDIAN 304 |
| #define POINTERSIZE 305 |
| #define LITTLE 306 |
| #define BIG 307 |
| #define DEPLIBS 308 |
| #define CALL 309 |
| #define TAIL 310 |
| #define CC_TOK 311 |
| #define CCC_TOK 312 |
| #define FASTCC_TOK 313 |
| #define COLDCC_TOK 314 |
| #define RET 315 |
| #define BR 316 |
| #define SWITCH 317 |
| #define INVOKE 318 |
| #define UNWIND 319 |
| #define UNREACHABLE 320 |
| #define ADD 321 |
| #define SUB 322 |
| #define MUL 323 |
| #define DIV 324 |
| #define REM 325 |
| #define AND 326 |
| #define OR 327 |
| #define XOR 328 |
| #define SETLE 329 |
| #define SETGE 330 |
| #define SETLT 331 |
| #define SETGT 332 |
| #define SETEQ 333 |
| #define SETNE 334 |
| #define MALLOC 335 |
| #define ALLOCA 336 |
| #define FREE 337 |
| #define LOAD 338 |
| #define STORE 339 |
| #define GETELEMENTPTR 340 |
| #define PHI_TOK 341 |
| #define CAST 342 |
| #define SELECT 343 |
| #define SHL 344 |
| #define SHR 345 |
| #define VAARG 346 |
| #define VAARG_old 347 |
| #define VANEXT_old 348 |
| |
| |
| |
| |
| /* Copy the first part of user declarations. */ |
| #line 14 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| |
| #include "ParserInternals.h" |
| #include "llvm/CallingConv.h" |
| #include "llvm/Instructions.h" |
| #include "llvm/Module.h" |
| #include "llvm/SymbolTable.h" |
| #include "llvm/Support/GetElementPtrTypeIterator.h" |
| #include "llvm/ADT/STLExtras.h" |
| #include <algorithm> |
| #include <iostream> |
| #include <list> |
| #include <utility> |
| |
| int yyerror(const char *ErrorMsg); // Forward declarations to prevent "implicit |
| int yylex(); // declaration" of xxx warnings. |
| int yyparse(); |
| |
| namespace llvm { |
| std::string CurFilename; |
| } |
| using namespace llvm; |
| |
| static Module *ParserResult; |
| |
| // DEBUG_UPREFS - Define this symbol if you want to enable debugging output |
| // relating to upreferences in the input stream. |
| // |
| //#define DEBUG_UPREFS 1 |
| #ifdef DEBUG_UPREFS |
| #define UR_OUT(X) std::cerr << X |
| #else |
| #define UR_OUT(X) |
| #endif |
| |
| #define YYERROR_VERBOSE 1 |
| |
| static bool ObsoleteVarArgs; |
| static bool NewVarArgs; |
| static BasicBlock* CurBB; |
| |
| |
| // This contains info used when building the body of a function. It is |
| // destroyed when the function is completed. |
| // |
| typedef std::vector<Value *> ValueList; // Numbered defs |
| static void |
| ResolveDefinitions(std::map<const Type *,ValueList> &LateResolvers, |
| std::map<const Type *,ValueList> *FutureLateResolvers = 0); |
| |
| static struct PerModuleInfo { |
| Module *CurrentModule; |
| std::map<const Type *, ValueList> Values; // Module level numbered definitions |
| std::map<const Type *,ValueList> LateResolveValues; |
| std::vector<PATypeHolder> Types; |
| std::map<ValID, PATypeHolder> LateResolveTypes; |
| |
| /// PlaceHolderInfo - When temporary placeholder objects are created, remember |
| /// how they were referenced and one which line of the input they came from so |
| /// that we can resolve them later and print error messages as appropriate. |
| std::map<Value*, std::pair<ValID, int> > PlaceHolderInfo; |
| |
| // GlobalRefs - This maintains a mapping between <Type, ValID>'s and forward |
| // references to global values. Global values may be referenced before they |
| // are defined, and if so, the temporary object that they represent is held |
| // here. This is used for forward references of GlobalValues. |
| // |
| typedef std::map<std::pair<const PointerType *, |
| ValID>, GlobalValue*> GlobalRefsType; |
| GlobalRefsType GlobalRefs; |
| |
| void ModuleDone() { |
| // If we could not resolve some functions at function compilation time |
| // (calls to functions before they are defined), resolve them now... Types |
| // are resolved when the constant pool has been completely parsed. |
| // |
| ResolveDefinitions(LateResolveValues); |
| |
| // Check to make sure that all global value forward references have been |
| // resolved! |
| // |
| if (!GlobalRefs.empty()) { |
| std::string UndefinedReferences = "Unresolved global references exist:\n"; |
| |
| for (GlobalRefsType::iterator I = GlobalRefs.begin(), E =GlobalRefs.end(); |
| I != E; ++I) { |
| UndefinedReferences += " " + I->first.first->getDescription() + " " + |
| I->first.second.getName() + "\n"; |
| } |
| ThrowException(UndefinedReferences); |
| } |
| |
| Values.clear(); // Clear out function local definitions |
| Types.clear(); |
| CurrentModule = 0; |
| } |
| |
| |
| // GetForwardRefForGlobal - Check to see if there is a forward reference |
| // for this global. If so, remove it from the GlobalRefs map and return it. |
| // If not, just return null. |
| GlobalValue *GetForwardRefForGlobal(const PointerType *PTy, ValID ID) { |
| // Check to see if there is a forward reference to this global variable... |
| // if there is, eliminate it and patch the reference to use the new def'n. |
| GlobalRefsType::iterator I = GlobalRefs.find(std::make_pair(PTy, ID)); |
| GlobalValue *Ret = 0; |
| if (I != GlobalRefs.end()) { |
| Ret = I->second; |
| GlobalRefs.erase(I); |
| } |
| return Ret; |
| } |
| } CurModule; |
| |
| static struct PerFunctionInfo { |
| Function *CurrentFunction; // Pointer to current function being created |
| |
| std::map<const Type*, ValueList> Values; // Keep track of #'d definitions |
| std::map<const Type*, ValueList> LateResolveValues; |
| bool isDeclare; // Is this function a forward declararation? |
| |
| /// BBForwardRefs - When we see forward references to basic blocks, keep |
| /// track of them here. |
| std::map<BasicBlock*, std::pair<ValID, int> > BBForwardRefs; |
| std::vector<BasicBlock*> NumberedBlocks; |
| unsigned NextBBNum; |
| |
| inline PerFunctionInfo() { |
| CurrentFunction = 0; |
| isDeclare = false; |
| } |
| |
| inline void FunctionStart(Function *M) { |
| CurrentFunction = M; |
| NextBBNum = 0; |
| } |
| |
| void FunctionDone() { |
| NumberedBlocks.clear(); |
| |
| // Any forward referenced blocks left? |
| if (!BBForwardRefs.empty()) |
| ThrowException("Undefined reference to label " + |
| BBForwardRefs.begin()->first->getName()); |
| |
| // Resolve all forward references now. |
| ResolveDefinitions(LateResolveValues, &CurModule.LateResolveValues); |
| |
| Values.clear(); // Clear out function local definitions |
| CurrentFunction = 0; |
| isDeclare = false; |
| } |
| } CurFun; // Info for the current function... |
| |
| static bool inFunctionScope() { return CurFun.CurrentFunction != 0; } |
| |
| |
| //===----------------------------------------------------------------------===// |
| // Code to handle definitions of all the types |
| //===----------------------------------------------------------------------===// |
| |
| static int InsertValue(Value *V, |
| std::map<const Type*,ValueList> &ValueTab = CurFun.Values) { |
| if (V->hasName()) return -1; // Is this a numbered definition? |
| |
| // Yes, insert the value into the value table... |
| ValueList &List = ValueTab[V->getType()]; |
| List.push_back(V); |
| return List.size()-1; |
| } |
| |
| static const Type *getTypeVal(const ValID &D, bool DoNotImprovise = false) { |
| switch (D.Type) { |
| case ValID::NumberVal: // Is it a numbered definition? |
| // Module constants occupy the lowest numbered slots... |
| if ((unsigned)D.Num < CurModule.Types.size()) |
| return CurModule.Types[(unsigned)D.Num]; |
| break; |
| case ValID::NameVal: // Is it a named definition? |
| if (const Type *N = CurModule.CurrentModule->getTypeByName(D.Name)) { |
| D.destroy(); // Free old strdup'd memory... |
| return N; |
| } |
| break; |
| default: |
| ThrowException("Internal parser error: Invalid symbol type reference!"); |
| } |
| |
| // If we reached here, we referenced either a symbol that we don't know about |
| // or an id number that hasn't been read yet. We may be referencing something |
| // forward, so just create an entry to be resolved later and get to it... |
| // |
| if (DoNotImprovise) return 0; // Do we just want a null to be returned? |
| |
| |
| if (inFunctionScope()) { |
| if (D.Type == ValID::NameVal) |
| ThrowException("Reference to an undefined type: '" + D.getName() + "'"); |
| else |
| ThrowException("Reference to an undefined type: #" + itostr(D.Num)); |
| } |
| |
| std::map<ValID, PATypeHolder>::iterator I =CurModule.LateResolveTypes.find(D); |
| if (I != CurModule.LateResolveTypes.end()) |
| return I->second; |
| |
| Type *Typ = OpaqueType::get(); |
| CurModule.LateResolveTypes.insert(std::make_pair(D, Typ)); |
| return Typ; |
| } |
| |
| static Value *lookupInSymbolTable(const Type *Ty, const std::string &Name) { |
| SymbolTable &SymTab = |
| inFunctionScope() ? CurFun.CurrentFunction->getSymbolTable() : |
| CurModule.CurrentModule->getSymbolTable(); |
| return SymTab.lookup(Ty, Name); |
| } |
| |
| // getValNonImprovising - Look up the value specified by the provided type and |
| // the provided ValID. If the value exists and has already been defined, return |
| // it. Otherwise return null. |
| // |
| static Value *getValNonImprovising(const Type *Ty, const ValID &D) { |
| if (isa<FunctionType>(Ty)) |
| ThrowException("Functions are not values and " |
| "must be referenced as pointers"); |
| |
| switch (D.Type) { |
| case ValID::NumberVal: { // Is it a numbered definition? |
| unsigned Num = (unsigned)D.Num; |
| |
| // Module constants occupy the lowest numbered slots... |
| std::map<const Type*,ValueList>::iterator VI = CurModule.Values.find(Ty); |
| if (VI != CurModule.Values.end()) { |
| if (Num < VI->second.size()) |
| return VI->second[Num]; |
| Num -= VI->second.size(); |
| } |
| |
| // Make sure that our type is within bounds |
| VI = CurFun.Values.find(Ty); |
| if (VI == CurFun.Values.end()) return 0; |
| |
| // Check that the number is within bounds... |
| if (VI->second.size() <= Num) return 0; |
| |
| return VI->second[Num]; |
| } |
| |
| case ValID::NameVal: { // Is it a named definition? |
| Value *N = lookupInSymbolTable(Ty, std::string(D.Name)); |
| if (N == 0) return 0; |
| |
| D.destroy(); // Free old strdup'd memory... |
| return N; |
| } |
| |
| // Check to make sure that "Ty" is an integral type, and that our |
| // value will fit into the specified type... |
| case ValID::ConstSIntVal: // Is it a constant pool reference?? |
| if (!ConstantSInt::isValueValidForType(Ty, D.ConstPool64)) |
| ThrowException("Signed integral constant '" + |
| itostr(D.ConstPool64) + "' is invalid for type '" + |
| Ty->getDescription() + "'!"); |
| return ConstantSInt::get(Ty, D.ConstPool64); |
| |
| case ValID::ConstUIntVal: // Is it an unsigned const pool reference? |
| if (!ConstantUInt::isValueValidForType(Ty, D.UConstPool64)) { |
| if (!ConstantSInt::isValueValidForType(Ty, D.ConstPool64)) { |
| ThrowException("Integral constant '" + utostr(D.UConstPool64) + |
| "' is invalid or out of range!"); |
| } else { // This is really a signed reference. Transmogrify. |
| return ConstantSInt::get(Ty, D.ConstPool64); |
| } |
| } else { |
| return ConstantUInt::get(Ty, D.UConstPool64); |
| } |
| |
| case ValID::ConstFPVal: // Is it a floating point const pool reference? |
| if (!ConstantFP::isValueValidForType(Ty, D.ConstPoolFP)) |
| ThrowException("FP constant invalid for type!!"); |
| return ConstantFP::get(Ty, D.ConstPoolFP); |
| |
| case ValID::ConstNullVal: // Is it a null value? |
| if (!isa<PointerType>(Ty)) |
| ThrowException("Cannot create a a non pointer null!"); |
| return ConstantPointerNull::get(cast<PointerType>(Ty)); |
| |
| case ValID::ConstUndefVal: // Is it an undef value? |
| return UndefValue::get(Ty); |
| |
| case ValID::ConstantVal: // Fully resolved constant? |
| if (D.ConstantValue->getType() != Ty) |
| ThrowException("Constant expression type different from required type!"); |
| return D.ConstantValue; |
| |
| default: |
| assert(0 && "Unhandled case!"); |
| return 0; |
| } // End of switch |
| |
| assert(0 && "Unhandled case!"); |
| return 0; |
| } |
| |
| // getVal - This function is identical to getValNonImprovising, except that if a |
| // value is not already defined, it "improvises" by creating a placeholder var |
| // that looks and acts just like the requested variable. When the value is |
| // defined later, all uses of the placeholder variable are replaced with the |
| // real thing. |
| // |
| static Value *getVal(const Type *Ty, const ValID &ID) { |
| if (Ty == Type::LabelTy) |
| ThrowException("Cannot use a basic block here"); |
| |
| // See if the value has already been defined. |
| Value *V = getValNonImprovising(Ty, ID); |
| if (V) return V; |
| |
| if (!Ty->isFirstClassType() && !isa<OpaqueType>(Ty)) |
| ThrowException("Invalid use of a composite type!"); |
| |
| // If we reached here, we referenced either a symbol that we don't know about |
| // or an id number that hasn't been read yet. We may be referencing something |
| // forward, so just create an entry to be resolved later and get to it... |
| // |
| V = new Argument(Ty); |
| |
| // Remember where this forward reference came from. FIXME, shouldn't we try |
| // to recycle these things?? |
| CurModule.PlaceHolderInfo.insert(std::make_pair(V, std::make_pair(ID, |
| llvmAsmlineno))); |
| |
| if (inFunctionScope()) |
| InsertValue(V, CurFun.LateResolveValues); |
| else |
| InsertValue(V, CurModule.LateResolveValues); |
| return V; |
| } |
| |
| /// getBBVal - This is used for two purposes: |
| /// * If isDefinition is true, a new basic block with the specified ID is being |
| /// defined. |
| /// * If isDefinition is true, this is a reference to a basic block, which may |
| /// or may not be a forward reference. |
| /// |
| static BasicBlock *getBBVal(const ValID &ID, bool isDefinition = false) { |
| assert(inFunctionScope() && "Can't get basic block at global scope!"); |
| |
| std::string Name; |
| BasicBlock *BB = 0; |
| switch (ID.Type) { |
| default: ThrowException("Illegal label reference " + ID.getName()); |
| case ValID::NumberVal: // Is it a numbered definition? |
| if (unsigned(ID.Num) >= CurFun.NumberedBlocks.size()) |
| CurFun.NumberedBlocks.resize(ID.Num+1); |
| BB = CurFun.NumberedBlocks[ID.Num]; |
| break; |
| case ValID::NameVal: // Is it a named definition? |
| Name = ID.Name; |
| if (Value *N = CurFun.CurrentFunction-> |
| getSymbolTable().lookup(Type::LabelTy, Name)) |
| BB = cast<BasicBlock>(N); |
| break; |
| } |
| |
| // See if the block has already been defined. |
| if (BB) { |
| // If this is the definition of the block, make sure the existing value was |
| // just a forward reference. If it was a forward reference, there will be |
| // an entry for it in the PlaceHolderInfo map. |
| if (isDefinition && !CurFun.BBForwardRefs.erase(BB)) |
| // The existing value was a definition, not a forward reference. |
| ThrowException("Redefinition of label " + ID.getName()); |
| |
| ID.destroy(); // Free strdup'd memory. |
| return BB; |
| } |
| |
| // Otherwise this block has not been seen before. |
| BB = new BasicBlock("", CurFun.CurrentFunction); |
| if (ID.Type == ValID::NameVal) { |
| BB->setName(ID.Name); |
| } else { |
| CurFun.NumberedBlocks[ID.Num] = BB; |
| } |
| |
| // If this is not a definition, keep track of it so we can use it as a forward |
| // reference. |
| if (!isDefinition) { |
| // Remember where this forward reference came from. |
| CurFun.BBForwardRefs[BB] = std::make_pair(ID, llvmAsmlineno); |
| } else { |
| // The forward declaration could have been inserted anywhere in the |
| // function: insert it into the correct place now. |
| CurFun.CurrentFunction->getBasicBlockList().remove(BB); |
| CurFun.CurrentFunction->getBasicBlockList().push_back(BB); |
| } |
| ID.destroy(); |
| return BB; |
| } |
| |
| |
| //===----------------------------------------------------------------------===// |
| // Code to handle forward references in instructions |
| //===----------------------------------------------------------------------===// |
| // |
| // This code handles the late binding needed with statements that reference |
| // values not defined yet... for example, a forward branch, or the PHI node for |
| // a loop body. |
| // |
| // This keeps a table (CurFun.LateResolveValues) of all such forward references |
| // and back patchs after we are done. |
| // |
| |
| // ResolveDefinitions - If we could not resolve some defs at parsing |
| // time (forward branches, phi functions for loops, etc...) resolve the |
| // defs now... |
| // |
| static void |
| ResolveDefinitions(std::map<const Type*,ValueList> &LateResolvers, |
| std::map<const Type*,ValueList> *FutureLateResolvers) { |
| // Loop over LateResolveDefs fixing up stuff that couldn't be resolved |
| for (std::map<const Type*,ValueList>::iterator LRI = LateResolvers.begin(), |
| E = LateResolvers.end(); LRI != E; ++LRI) { |
| ValueList &List = LRI->second; |
| while (!List.empty()) { |
| Value *V = List.back(); |
| List.pop_back(); |
| |
| std::map<Value*, std::pair<ValID, int> >::iterator PHI = |
| CurModule.PlaceHolderInfo.find(V); |
| assert(PHI != CurModule.PlaceHolderInfo.end() && "Placeholder error!"); |
| |
| ValID &DID = PHI->second.first; |
| |
| Value *TheRealValue = getValNonImprovising(LRI->first, DID); |
| if (TheRealValue) { |
| V->replaceAllUsesWith(TheRealValue); |
| delete V; |
| CurModule.PlaceHolderInfo.erase(PHI); |
| } else if (FutureLateResolvers) { |
| // Functions have their unresolved items forwarded to the module late |
| // resolver table |
| InsertValue(V, *FutureLateResolvers); |
| } else { |
| if (DID.Type == ValID::NameVal) |
| ThrowException("Reference to an invalid definition: '" +DID.getName()+ |
| "' of type '" + V->getType()->getDescription() + "'", |
| PHI->second.second); |
| else |
| ThrowException("Reference to an invalid definition: #" + |
| itostr(DID.Num) + " of type '" + |
| V->getType()->getDescription() + "'", |
| PHI->second.second); |
| } |
| } |
| } |
| |
| LateResolvers.clear(); |
| } |
| |
| // ResolveTypeTo - A brand new type was just declared. This means that (if |
| // name is not null) things referencing Name can be resolved. Otherwise, things |
| // refering to the number can be resolved. Do this now. |
| // |
| static void ResolveTypeTo(char *Name, const Type *ToTy) { |
| ValID D; |
| if (Name) D = ValID::create(Name); |
| else D = ValID::create((int)CurModule.Types.size()); |
| |
| std::map<ValID, PATypeHolder>::iterator I = |
| CurModule.LateResolveTypes.find(D); |
| if (I != CurModule.LateResolveTypes.end()) { |
| ((DerivedType*)I->second.get())->refineAbstractTypeTo(ToTy); |
| CurModule.LateResolveTypes.erase(I); |
| } |
| } |
| |
| // setValueName - Set the specified value to the name given. The name may be |
| // null potentially, in which case this is a noop. The string passed in is |
| // assumed to be a malloc'd string buffer, and is free'd by this function. |
| // |
| static void setValueName(Value *V, char *NameStr) { |
| if (NameStr) { |
| std::string Name(NameStr); // Copy string |
| free(NameStr); // Free old string |
| |
| if (V->getType() == Type::VoidTy) |
| ThrowException("Can't assign name '" + Name+"' to value with void type!"); |
| |
| assert(inFunctionScope() && "Must be in function scope!"); |
| SymbolTable &ST = CurFun.CurrentFunction->getSymbolTable(); |
| if (ST.lookup(V->getType(), Name)) |
| ThrowException("Redefinition of value named '" + Name + "' in the '" + |
| V->getType()->getDescription() + "' type plane!"); |
| |
| // Set the name. |
| V->setName(Name); |
| } |
| } |
| |
| /// ParseGlobalVariable - Handle parsing of a global. If Initializer is null, |
| /// this is a declaration, otherwise it is a definition. |
| static void ParseGlobalVariable(char *NameStr,GlobalValue::LinkageTypes Linkage, |
| bool isConstantGlobal, const Type *Ty, |
| Constant *Initializer) { |
| if (isa<FunctionType>(Ty)) |
| ThrowException("Cannot declare global vars of function type!"); |
| |
| const PointerType *PTy = PointerType::get(Ty); |
| |
| std::string Name; |
| if (NameStr) { |
| Name = NameStr; // Copy string |
| free(NameStr); // Free old string |
| } |
| |
| // See if this global value was forward referenced. If so, recycle the |
| // object. |
| ValID ID; |
| if (!Name.empty()) { |
| ID = ValID::create((char*)Name.c_str()); |
| } else { |
| ID = ValID::create((int)CurModule.Values[PTy].size()); |
| } |
| |
| if (GlobalValue *FWGV = CurModule.GetForwardRefForGlobal(PTy, ID)) { |
| // Move the global to the end of the list, from whereever it was |
| // previously inserted. |
| GlobalVariable *GV = cast<GlobalVariable>(FWGV); |
| CurModule.CurrentModule->getGlobalList().remove(GV); |
| CurModule.CurrentModule->getGlobalList().push_back(GV); |
| GV->setInitializer(Initializer); |
| GV->setLinkage(Linkage); |
| GV->setConstant(isConstantGlobal); |
| InsertValue(GV, CurModule.Values); |
| return; |
| } |
| |
| // If this global has a name, check to see if there is already a definition |
| // of this global in the module. If so, merge as appropriate. Note that |
| // this is really just a hack around problems in the CFE. :( |
| if (!Name.empty()) { |
| // We are a simple redefinition of a value, check to see if it is defined |
| // the same as the old one. |
| if (GlobalVariable *EGV = |
| CurModule.CurrentModule->getGlobalVariable(Name, Ty)) { |
| // We are allowed to redefine a global variable in two circumstances: |
| // 1. If at least one of the globals is uninitialized or |
| // 2. If both initializers have the same value. |
| // |
| if (!EGV->hasInitializer() || !Initializer || |
| EGV->getInitializer() == Initializer) { |
| |
| // Make sure the existing global version gets the initializer! Make |
| // sure that it also gets marked const if the new version is. |
| if (Initializer && !EGV->hasInitializer()) |
| EGV->setInitializer(Initializer); |
| if (isConstantGlobal) |
| EGV->setConstant(true); |
| EGV->setLinkage(Linkage); |
| return; |
| } |
| |
| ThrowException("Redefinition of global variable named '" + Name + |
| "' in the '" + Ty->getDescription() + "' type plane!"); |
| } |
| } |
| |
| // Otherwise there is no existing GV to use, create one now. |
| GlobalVariable *GV = |
| new GlobalVariable(Ty, isConstantGlobal, Linkage, Initializer, Name, |
| CurModule.CurrentModule); |
| InsertValue(GV, CurModule.Values); |
| } |
| |
| // setTypeName - Set the specified type to the name given. The name may be |
| // null potentially, in which case this is a noop. The string passed in is |
| // assumed to be a malloc'd string buffer, and is freed by this function. |
| // |
| // This function returns true if the type has already been defined, but is |
| // allowed to be redefined in the specified context. If the name is a new name |
| // for the type plane, it is inserted and false is returned. |
| static bool setTypeName(const Type *T, char *NameStr) { |
| assert(!inFunctionScope() && "Can't give types function-local names!"); |
| if (NameStr == 0) return false; |
| |
| std::string Name(NameStr); // Copy string |
| free(NameStr); // Free old string |
| |
| // We don't allow assigning names to void type |
| if (T == Type::VoidTy) |
| ThrowException("Can't assign name '" + Name + "' to the void type!"); |
| |
| // Set the type name, checking for conflicts as we do so. |
| bool AlreadyExists = CurModule.CurrentModule->addTypeName(Name, T); |
| |
| if (AlreadyExists) { // Inserting a name that is already defined??? |
| const Type *Existing = CurModule.CurrentModule->getTypeByName(Name); |
| assert(Existing && "Conflict but no matching type?"); |
| |
| // There is only one case where this is allowed: when we are refining an |
| // opaque type. In this case, Existing will be an opaque type. |
| if (const OpaqueType *OpTy = dyn_cast<OpaqueType>(Existing)) { |
| // We ARE replacing an opaque type! |
| const_cast<OpaqueType*>(OpTy)->refineAbstractTypeTo(T); |
| return true; |
| } |
| |
| // Otherwise, this is an attempt to redefine a type. That's okay if |
| // the redefinition is identical to the original. This will be so if |
| // Existing and T point to the same Type object. In this one case we |
| // allow the equivalent redefinition. |
| if (Existing == T) return true; // Yes, it's equal. |
| |
| // Any other kind of (non-equivalent) redefinition is an error. |
| ThrowException("Redefinition of type named '" + Name + "' in the '" + |
| T->getDescription() + "' type plane!"); |
| } |
| |
| return false; |
| } |
| |
| //===----------------------------------------------------------------------===// |
| // Code for handling upreferences in type names... |
| // |
| |
| // TypeContains - Returns true if Ty directly contains E in it. |
| // |
| static bool TypeContains(const Type *Ty, const Type *E) { |
| return std::find(Ty->subtype_begin(), Ty->subtype_end(), |
| E) != Ty->subtype_end(); |
| } |
| |
| namespace { |
| struct UpRefRecord { |
| // NestingLevel - The number of nesting levels that need to be popped before |
| // this type is resolved. |
| unsigned NestingLevel; |
| |
| // LastContainedTy - This is the type at the current binding level for the |
| // type. Every time we reduce the nesting level, this gets updated. |
| const Type *LastContainedTy; |
| |
| // UpRefTy - This is the actual opaque type that the upreference is |
| // represented with. |
| OpaqueType *UpRefTy; |
| |
| UpRefRecord(unsigned NL, OpaqueType *URTy) |
| : NestingLevel(NL), LastContainedTy(URTy), UpRefTy(URTy) {} |
| }; |
| } |
| |
| // UpRefs - A list of the outstanding upreferences that need to be resolved. |
| static std::vector<UpRefRecord> UpRefs; |
| |
| /// HandleUpRefs - Every time we finish a new layer of types, this function is |
| /// called. It loops through the UpRefs vector, which is a list of the |
| /// currently active types. For each type, if the up reference is contained in |
| /// the newly completed type, we decrement the level count. When the level |
| /// count reaches zero, the upreferenced type is the type that is passed in: |
| /// thus we can complete the cycle. |
| /// |
| static PATypeHolder HandleUpRefs(const Type *ty) { |
| if (!ty->isAbstract()) return ty; |
| PATypeHolder Ty(ty); |
| UR_OUT("Type '" << Ty->getDescription() << |
| "' newly formed. Resolving upreferences.\n" << |
| UpRefs.size() << " upreferences active!\n"); |
| |
| // If we find any resolvable upreferences (i.e., those whose NestingLevel goes |
| // to zero), we resolve them all together before we resolve them to Ty. At |
| // the end of the loop, if there is anything to resolve to Ty, it will be in |
| // this variable. |
| OpaqueType *TypeToResolve = 0; |
| |
| for (unsigned i = 0; i != UpRefs.size(); ++i) { |
| UR_OUT(" UR#" << i << " - TypeContains(" << Ty->getDescription() << ", " |
| << UpRefs[i].second->getDescription() << ") = " |
| << (TypeContains(Ty, UpRefs[i].second) ? "true" : "false") << "\n"); |
| if (TypeContains(Ty, UpRefs[i].LastContainedTy)) { |
| // Decrement level of upreference |
| unsigned Level = --UpRefs[i].NestingLevel; |
| UpRefs[i].LastContainedTy = Ty; |
| UR_OUT(" Uplevel Ref Level = " << Level << "\n"); |
| if (Level == 0) { // Upreference should be resolved! |
| if (!TypeToResolve) { |
| TypeToResolve = UpRefs[i].UpRefTy; |
| } else { |
| UR_OUT(" * Resolving upreference for " |
| << UpRefs[i].second->getDescription() << "\n"; |
| std::string OldName = UpRefs[i].UpRefTy->getDescription()); |
| UpRefs[i].UpRefTy->refineAbstractTypeTo(TypeToResolve); |
| UR_OUT(" * Type '" << OldName << "' refined upreference to: " |
| << (const void*)Ty << ", " << Ty->getDescription() << "\n"); |
| } |
| UpRefs.erase(UpRefs.begin()+i); // Remove from upreference list... |
| --i; // Do not skip the next element... |
| } |
| } |
| } |
| |
| if (TypeToResolve) { |
| UR_OUT(" * Resolving upreference for " |
| << UpRefs[i].second->getDescription() << "\n"; |
| std::string OldName = TypeToResolve->getDescription()); |
| TypeToResolve->refineAbstractTypeTo(Ty); |
| } |
| |
| return Ty; |
| } |
| |
| |
| // common code from the two 'RunVMAsmParser' functions |
| static Module * RunParser(Module * M) { |
| |
| llvmAsmlineno = 1; // Reset the current line number... |
| ObsoleteVarArgs = false; |
| NewVarArgs = false; |
| |
| CurModule.CurrentModule = M; |
| yyparse(); // Parse the file, potentially throwing exception |
| |
| Module *Result = ParserResult; |
| ParserResult = 0; |
| |
| //Not all functions use vaarg, so make a second check for ObsoleteVarArgs |
| { |
| Function* F; |
| if ((F = Result->getNamedFunction("llvm.va_start")) |
| && F->getFunctionType()->getNumParams() == 0) |
| ObsoleteVarArgs = true; |
| if((F = Result->getNamedFunction("llvm.va_copy")) |
| && F->getFunctionType()->getNumParams() == 1) |
| ObsoleteVarArgs = true; |
| } |
| |
| if (ObsoleteVarArgs && NewVarArgs) |
| ThrowException("This file is corrupt: it uses both new and old style varargs"); |
| |
| if(ObsoleteVarArgs) { |
| if(Function* F = Result->getNamedFunction("llvm.va_start")) { |
| if (F->arg_size() != 0) |
| ThrowException("Obsolete va_start takes 0 argument!"); |
| |
| //foo = va_start() |
| // -> |
| //bar = alloca typeof(foo) |
| //va_start(bar) |
| //foo = load bar |
| |
| const Type* RetTy = Type::getPrimitiveType(Type::VoidTyID); |
| const Type* ArgTy = F->getFunctionType()->getReturnType(); |
| const Type* ArgTyPtr = PointerType::get(ArgTy); |
| Function* NF = Result->getOrInsertFunction("llvm.va_start", |
| RetTy, ArgTyPtr, (Type *)0); |
| |
| while (!F->use_empty()) { |
| CallInst* CI = cast<CallInst>(F->use_back()); |
| AllocaInst* bar = new AllocaInst(ArgTy, 0, "vastart.fix.1", CI); |
| new CallInst(NF, bar, "", CI); |
| Value* foo = new LoadInst(bar, "vastart.fix.2", CI); |
| CI->replaceAllUsesWith(foo); |
| CI->getParent()->getInstList().erase(CI); |
| } |
| Result->getFunctionList().erase(F); |
| } |
| |
| if(Function* F = Result->getNamedFunction("llvm.va_end")) { |
| if(F->arg_size() != 1) |
| ThrowException("Obsolete va_end takes 1 argument!"); |
| |
| //vaend foo |
| // -> |
| //bar = alloca 1 of typeof(foo) |
| //vaend bar |
| const Type* RetTy = Type::getPrimitiveType(Type::VoidTyID); |
| const Type* ArgTy = F->getFunctionType()->getParamType(0); |
| const Type* ArgTyPtr = PointerType::get(ArgTy); |
| Function* NF = Result->getOrInsertFunction("llvm.va_end", |
| RetTy, ArgTyPtr, (Type *)0); |
| |
| while (!F->use_empty()) { |
| CallInst* CI = cast<CallInst>(F->use_back()); |
| AllocaInst* bar = new AllocaInst(ArgTy, 0, "vaend.fix.1", CI); |
| new StoreInst(CI->getOperand(1), bar, CI); |
| new CallInst(NF, bar, "", CI); |
| CI->getParent()->getInstList().erase(CI); |
| } |
| Result->getFunctionList().erase(F); |
| } |
| |
| if(Function* F = Result->getNamedFunction("llvm.va_copy")) { |
| if(F->arg_size() != 1) |
| ThrowException("Obsolete va_copy takes 1 argument!"); |
| //foo = vacopy(bar) |
| // -> |
| //a = alloca 1 of typeof(foo) |
| //b = alloca 1 of typeof(foo) |
| //store bar -> b |
| //vacopy(a, b) |
| //foo = load a |
| |
| const Type* RetTy = Type::getPrimitiveType(Type::VoidTyID); |
| const Type* ArgTy = F->getFunctionType()->getReturnType(); |
| const Type* ArgTyPtr = PointerType::get(ArgTy); |
| Function* NF = Result->getOrInsertFunction("llvm.va_copy", |
| RetTy, ArgTyPtr, ArgTyPtr, |
| (Type *)0); |
| |
| while (!F->use_empty()) { |
| CallInst* CI = cast<CallInst>(F->use_back()); |
| AllocaInst* a = new AllocaInst(ArgTy, 0, "vacopy.fix.1", CI); |
| AllocaInst* b = new AllocaInst(ArgTy, 0, "vacopy.fix.2", CI); |
| new StoreInst(CI->getOperand(1), b, CI); |
| new CallInst(NF, a, b, "", CI); |
| Value* foo = new LoadInst(a, "vacopy.fix.3", CI); |
| CI->replaceAllUsesWith(foo); |
| CI->getParent()->getInstList().erase(CI); |
| } |
| Result->getFunctionList().erase(F); |
| } |
| } |
| |
| return Result; |
| |
| } |
| |
| //===----------------------------------------------------------------------===// |
| // RunVMAsmParser - Define an interface to this parser |
| //===----------------------------------------------------------------------===// |
| // |
| Module *llvm::RunVMAsmParser(const std::string &Filename, FILE *F) { |
| set_scan_file(F); |
| |
| CurFilename = Filename; |
| return RunParser(new Module(CurFilename)); |
| } |
| |
| Module *llvm::RunVMAsmParser(const char * AsmString, Module * M) { |
| set_scan_string(AsmString); |
| |
| CurFilename = "from_memory"; |
| if (M == NULL) { |
| return RunParser(new Module (CurFilename)); |
| } else { |
| return RunParser(M); |
| } |
| } |
| |
| |
| |
| /* 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 |
| |
| #if ! defined (YYSTYPE) && ! defined (YYSTYPE_IS_DECLARED) |
| #line 866 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| typedef union YYSTYPE { |
| llvm::Module *ModuleVal; |
| llvm::Function *FunctionVal; |
| std::pair<llvm::PATypeHolder*, char*> *ArgVal; |
| llvm::BasicBlock *BasicBlockVal; |
| llvm::TerminatorInst *TermInstVal; |
| llvm::Instruction *InstVal; |
| llvm::Constant *ConstVal; |
| |
| const llvm::Type *PrimType; |
| llvm::PATypeHolder *TypeVal; |
| llvm::Value *ValueVal; |
| |
| std::vector<std::pair<llvm::PATypeHolder*,char*> > *ArgList; |
| std::vector<llvm::Value*> *ValueList; |
| std::list<llvm::PATypeHolder> *TypeList; |
| // Represent the RHS of PHI node |
| std::list<std::pair<llvm::Value*, |
| llvm::BasicBlock*> > *PHIList; |
| std::vector<std::pair<llvm::Constant*, llvm::BasicBlock*> > *JumpTable; |
| std::vector<llvm::Constant*> *ConstVector; |
| |
| llvm::GlobalValue::LinkageTypes Linkage; |
| int64_t SInt64Val; |
| uint64_t UInt64Val; |
| int SIntVal; |
| unsigned UIntVal; |
| double FPVal; |
| bool BoolVal; |
| |
| char *StrVal; // This memory is strdup'd! |
| llvm::ValID ValIDVal; // strdup'd memory maybe! |
| |
| llvm::Instruction::BinaryOps BinaryOpVal; |
| llvm::Instruction::TermOps TermOpVal; |
| llvm::Instruction::MemoryOps MemOpVal; |
| llvm::Instruction::OtherOps OtherOpVal; |
| llvm::Module::Endianness Endianness; |
| } YYSTYPE; |
| /* Line 191 of yacc.c. */ |
| #line 1163 "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 214 of yacc.c. */ |
| #line 1175 "llvmAsmParser.tab.c" |
| |
| #if ! defined (yyoverflow) || YYERROR_VERBOSE |
| |
| # ifndef YYFREE |
| # define YYFREE free |
| # endif |
| # ifndef YYMALLOC |
| # define YYMALLOC malloc |
| # endif |
| |
| /* The parser invokes alloca or malloc; define the necessary symbols. */ |
| |
| # ifdef YYSTACK_USE_ALLOCA |
| # if YYSTACK_USE_ALLOCA |
| # define YYSTACK_ALLOC alloca |
| # endif |
| # else |
| # if defined (alloca) || defined (_ALLOCA_H) |
| # define YYSTACK_ALLOC alloca |
| # else |
| # ifdef __GNUC__ |
| # define YYSTACK_ALLOC __builtin_alloca |
| # endif |
| # endif |
| # endif |
| |
| # ifdef YYSTACK_ALLOC |
| /* Pacify GCC's `empty if-body' warning. */ |
| # define YYSTACK_FREE(Ptr) do { /* empty */; } while (0) |
| # else |
| # if defined (__STDC__) || defined (__cplusplus) |
| # include <stdlib.h> /* INFRINGES ON USER NAME SPACE */ |
| # define YYSIZE_T size_t |
| # endif |
| # define YYSTACK_ALLOC YYMALLOC |
| # define YYSTACK_FREE YYFREE |
| # 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 \ |
| { \ |
| register YYSIZE_T yyi; \ |
| for (yyi = 0; yyi < (Count); yyi++) \ |
| (To)[yyi] = (From)[yyi]; \ |
| } \ |
| while (0) |
| # endif |
| # endif |
| |
| /* Relocate STACK from its old location to the new one. The |
| local variables YYSIZE and YYSTACKSIZE give the old and new number of |
| elements in the stack, and YYPTR gives the new location of the |
| stack. Advance YYPTR to a properly aligned location for the next |
| stack. */ |
| # define YYSTACK_RELOCATE(Stack) \ |
| do \ |
| { \ |
| YYSIZE_T yynewbytes; \ |
| YYCOPY (&yyptr->Stack, Stack, yysize); \ |
| Stack = &yyptr->Stack; \ |
| yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \ |
| yyptr += yynewbytes / sizeof (*yyptr); \ |
| } \ |
| while (0) |
| |
| #endif |
| |
| #if defined (__STDC__) || defined (__cplusplus) |
| typedef signed char yysigned_char; |
| #else |
| typedef short int yysigned_char; |
| #endif |
| |
| /* YYFINAL -- State number of the termination state. */ |
| #define YYFINAL 4 |
| /* YYLAST -- Last index in YYTABLE. */ |
| #define YYLAST 1102 |
| |
| /* YYNTOKENS -- Number of terminals. */ |
| #define YYNTOKENS 108 |
| /* YYNNTS -- Number of nonterminals. */ |
| #define YYNNTS 62 |
| /* YYNRULES -- Number of rules. */ |
| #define YYNRULES 212 |
| /* YYNRULES -- Number of states. */ |
| #define YYNSTATES 419 |
| |
| /* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */ |
| #define YYUNDEFTOK 2 |
| #define YYMAXUTOK 348 |
| |
| #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, |
| 96, 97, 105, 2, 106, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 101, 94, 102, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 98, 95, 100, 2, 2, 2, 2, 2, 107, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 99, 2, 2, 103, 2, 104, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 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 |
| }; |
| |
| #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, 70, 71, 73, 75, 77, |
| 79, 80, 81, 83, 85, 87, 90, 92, 94, 96, |
| 98, 100, 102, 104, 106, 108, 110, 112, 114, 116, |
| 118, 120, 122, 124, 126, 128, 130, 132, 135, 140, |
| 146, 152, 156, 159, 162, 164, 168, 170, 174, 176, |
| 177, 182, 186, 190, 195, 200, 204, 207, 210, 213, |
| 216, 219, 222, 225, 228, 231, 234, 241, 247, 256, |
| 263, 270, 277, 284, 288, 290, 292, 294, 296, 299, |
| 302, 305, 307, 312, 315, 321, 327, 331, 336, 337, |
| 339, 341, 345, 349, 353, 357, 361, 363, 364, 366, |
| 368, 370, 371, 374, 378, 380, 382, 386, 388, 389, |
| 396, 398, 400, 404, 406, 408, 411, 412, 416, 418, |
| 420, 422, 424, 426, 428, 430, 434, 436, 438, 440, |
| 442, 444, 447, 450, 453, 457, 460, 461, 463, 466, |
| 469, 473, 483, 493, 502, 516, 518, 520, 527, 533, |
| 536, 543, 551, 553, 557, 559, 560, 563, 565, 571, |
| 577, 583, 586, 591, 596, 603, 608, 613, 618, 621, |
| 629, 631, 634, 635, 637, 638, 641, 647, 650, 656, |
| 659, 664, 671 |
| }; |
| |
| /* YYRHS -- A `-1'-separated list of the rules' RHS. */ |
| static const short int yyrhs[] = |
| { |
| 133, 0, -1, 5, -1, 6, -1, 3, -1, 4, |
| -1, 66, -1, 67, -1, 68, -1, 69, -1, 70, |
| -1, 71, -1, 72, -1, 73, -1, 74, -1, 75, |
| -1, 76, -1, 77, -1, 78, -1, 79, -1, 89, |
| -1, 90, -1, 16, -1, 14, -1, 12, -1, 10, |
| -1, 17, -1, 15, -1, 13, -1, 11, -1, 115, |
| -1, 116, -1, 18, -1, 19, -1, 140, 94, -1, |
| -1, 40, -1, 41, -1, 42, -1, 43, -1, -1, |
| -1, 57, -1, 58, -1, 59, -1, 56, 4, -1, |
| 124, -1, 8, -1, 126, -1, 8, -1, 126, -1, |
| 9, -1, 10, -1, 11, -1, 12, -1, 13, -1, |
| 14, -1, 15, -1, 16, -1, 17, -1, 18, -1, |
| 19, -1, 20, -1, 21, -1, 44, -1, 125, -1, |
| 153, -1, 95, 4, -1, 123, 96, 128, 97, -1, |
| 98, 4, 99, 126, 100, -1, 101, 4, 99, 126, |
| 102, -1, 103, 127, 104, -1, 103, 104, -1, 126, |
| 105, -1, 126, -1, 127, 106, 126, -1, 127, -1, |
| 127, 106, 36, -1, 36, -1, -1, 124, 98, 131, |
| 100, -1, 124, 98, 100, -1, 124, 107, 24, -1, |
| 124, 101, 131, 102, -1, 124, 103, 131, 104, -1, |
| 124, 103, 104, -1, 124, 37, -1, 124, 38, -1, |
| 124, 153, -1, 124, 130, -1, 124, 26, -1, 115, |
| 110, -1, 116, 4, -1, 9, 27, -1, 9, 28, |
| -1, 118, 7, -1, 87, 96, 129, 35, 124, 97, |
| -1, 85, 96, 129, 167, 97, -1, 88, 96, 129, |
| 106, 129, 106, 129, 97, -1, 111, 96, 129, 106, |
| 129, 97, -1, 112, 96, 129, 106, 129, 97, -1, |
| 113, 96, 129, 106, 129, 97, -1, 114, 96, 129, |
| 106, 129, 97, -1, 131, 106, 129, -1, 129, -1, |
| 32, -1, 33, -1, 134, -1, 134, 149, -1, 134, |
| 150, -1, 134, 25, -1, 135, -1, 135, 119, 20, |
| 122, -1, 135, 150, -1, 135, 119, 120, 132, 129, |
| -1, 135, 119, 46, 132, 124, -1, 135, 47, 137, |
| -1, 135, 53, 94, 138, -1, -1, 52, -1, 51, |
| -1, 49, 94, 136, -1, 50, 94, 4, -1, 48, |
| 94, 24, -1, 98, 139, 100, -1, 139, 106, 24, |
| -1, 24, -1, -1, 22, -1, 24, -1, 140, -1, |
| -1, 124, 141, -1, 143, 106, 142, -1, 142, -1, |
| 143, -1, 143, 106, 36, -1, 36, -1, -1, 121, |
| 122, 140, 96, 144, 97, -1, 29, -1, 103, -1, |
| 120, 145, 146, -1, 30, -1, 104, -1, 156, 148, |
| -1, -1, 31, 151, 145, -1, 3, -1, 4, -1, |
| 7, -1, 27, -1, 28, -1, 37, -1, 38, -1, |
| 101, 131, 102, -1, 130, -1, 109, -1, 140, -1, |
| 153, -1, 152, -1, 124, 154, -1, 156, 157, -1, |
| 147, 157, -1, 158, 119, 159, -1, 158, 161, -1, |
| -1, 23, -1, 60, 155, -1, 60, 8, -1, 61, |
| 21, 154, -1, 61, 9, 154, 106, 21, 154, 106, |
| 21, 154, -1, 62, 117, 154, 106, 21, 154, 98, |
| 160, 100, -1, 62, 117, 154, 106, 21, 154, 98, |
| 100, -1, 63, 121, 122, 154, 96, 164, 97, 35, |
| 21, 154, 64, 21, 154, -1, 64, -1, 65, -1, |
| 160, 117, 152, 106, 21, 154, -1, 117, 152, 106, |
| 21, 154, -1, 119, 166, -1, 124, 98, 154, 106, |
| 154, 100, -1, 162, 106, 98, 154, 106, 154, 100, |
| -1, 155, -1, 163, 106, 155, -1, 163, -1, -1, |
| 55, 54, -1, 54, -1, 111, 124, 154, 106, 154, |
| -1, 112, 124, 154, 106, 154, -1, 113, 124, 154, |
| 106, 154, -1, 45, 155, -1, 114, 155, 106, 155, |
| -1, 87, 155, 35, 124, -1, 88, 155, 106, 155, |
| 106, 155, -1, 91, 155, 106, 124, -1, 92, 155, |
| 106, 124, -1, 93, 155, 106, 124, -1, 86, 162, |
| -1, 165, 121, 122, 154, 96, 164, 97, -1, 169, |
| -1, 106, 163, -1, -1, 34, -1, -1, 80, 124, |
| -1, 80, 124, 106, 15, 154, -1, 81, 124, -1, |
| 81, 124, 106, 15, 154, -1, 82, 155, -1, 168, |
| 83, 124, 154, -1, 168, 84, 155, 106, 124, 154, |
| -1, 85, 124, 154, 167, -1 |
| }; |
| |
| /* YYRLINE[YYN] -- source line where rule number YYN was defined. */ |
| static const unsigned short int yyrline[] = |
| { |
| 0, 983, 983, 984, 991, 992, 1001, 1001, 1001, 1001, |
| 1001, 1002, 1002, 1002, 1003, 1003, 1003, 1003, 1003, 1003, |
| 1005, 1005, 1009, 1009, 1009, 1009, 1010, 1010, 1010, 1010, |
| 1011, 1011, 1012, 1012, 1015, 1018, 1022, 1023, 1024, 1025, |
| 1026, 1028, 1029, 1030, 1031, 1032, 1045, 1045, 1046, 1046, |
| 1048, 1057, 1057, 1057, 1057, 1057, 1057, 1057, 1058, 1058, |
| 1058, 1058, 1058, 1058, 1059, 1062, 1065, 1071, 1078, 1090, |
| 1094, 1105, 1114, 1117, 1125, 1129, 1134, 1135, 1138, 1141, |
| 1151, 1176, 1189, 1217, 1242, 1262, 1274, 1283, 1287, 1346, |
| 1352, 1360, 1365, 1370, 1373, 1376, 1383, 1393, 1424, 1431, |
| 1452, 1459, 1464, 1474, 1477, 1484, 1484, 1494, 1501, 1505, |
| 1508, 1511, 1524, 1544, 1546, 1550, 1554, 1556, 1558, 1563, |
| 1564, 1566, 1569, 1577, 1582, 1584, 1588, 1592, 1600, 1600, |
| 1601, 1601, 1603, 1609, 1614, 1620, 1623, 1628, 1632, 1636, |
| 1716, 1716, 1718, 1726, 1726, 1728, 1732, 1732, 1741, 1744, |
| 1747, 1750, 1753, 1756, 1759, 1762, 1786, 1793, 1796, 1801, |
| 1801, 1807, 1811, 1814, 1822, 1831, 1835, 1845, 1856, 1859, |
| 1862, 1865, 1868, 1882, 1886, 1939, 1942, 1948, 1956, 1966, |
| 1973, 1978, 1985, 1989, 1995, 1995, 1997, 2000, 2006, 2018, |
| 2026, 2036, 2048, 2055, 2062, 2069, 2074, 2093, 2115, 2129, |
| 2186, 2192, 2194, 2198, 2201, 2207, 2211, 2215, 2219, 2223, |
| 2230, 2240, 2253 |
| }; |
| #endif |
| |
| #if YYDEBUG || YYERROR_VERBOSE |
| /* YYTNME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM. |
| First, the terminals, then, starting at YYNTOKENS, nonterminals. */ |
| static const char *const yytname[] = |
| { |
| "$end", "error", "$undefined", "ESINT64VAL", "EUINT64VAL", "SINTVAL", |
| "UINTVAL", "FPVAL", "VOID", "BOOL", "SBYTE", "UBYTE", "SHORT", "USHORT", |
| "INT", "UINT", "LONG", "ULONG", "FLOAT", "DOUBLE", "TYPE", "LABEL", |
| "VAR_ID", "LABELSTR", "STRINGCONSTANT", "IMPLEMENTATION", |
| "ZEROINITIALIZER", "TRUETOK", "FALSETOK", "BEGINTOK", "ENDTOK", |
| "DECLARE", "GLOBAL", "CONSTANT", "VOLATILE", "TO", "DOTDOTDOT", |
| "NULL_TOK", "UNDEF", "CONST", "INTERNAL", "LINKONCE", "WEAK", |
| "APPENDING", "OPAQUE", "NOT", "EXTERNAL", "TARGET", "TRIPLE", "ENDIAN", |
| "POINTERSIZE", "LITTLE", "BIG", "DEPLIBS", "CALL", "TAIL", "CC_TOK", |
| "CCC_TOK", "FASTCC_TOK", "COLDCC_TOK", "RET", "BR", "SWITCH", "INVOKE", |
| "UNWIND", "UNREACHABLE", "ADD", "SUB", "MUL", "DIV", "REM", "AND", "OR", |
| "XOR", "SETLE", "SETGE", "SETLT", "SETGT", "SETEQ", "SETNE", "MALLOC", |
| "ALLOCA", "FREE", "LOAD", "STORE", "GETELEMENTPTR", "PHI_TOK", "CAST", |
| "SELECT", "SHL", "SHR", "VAARG", "VAARG_old", "VANEXT_old", "'='", |
| "'\\\\'", "'('", "')'", "'['", "'x'", "']'", "'<'", "'>'", "'{'", "'}'", |
| "'*'", "','", "'c'", "$accept", "INTVAL", "EINT64VAL", "ArithmeticOps", |
| "LogicalOps", "SetCondOps", "ShiftOps", "SIntType", "UIntType", |
| "IntType", "FPType", "OptAssign", "OptLinkage", "OptCallingConv", |
| "TypesV", "UpRTypesV", "Types", "PrimType", "UpRTypes", "TypeListI", |
| "ArgTypeListI", "ConstVal", "ConstExpr", "ConstVector", "GlobalType", |
| "Module", "FunctionList", "ConstPool", "BigOrLittle", "TargetDefinition", |
| "LibrariesDefinition", "LibList", "Name", "OptName", "ArgVal", |
| "ArgListH", "ArgList", "FunctionHeaderH", "BEGIN", "FunctionHeader", |
| "END", "Function", "FunctionProto", "@1", "ConstValueRef", |
| "SymbolicValueRef", "ValueRef", "ResolvedVal", "BasicBlockList", |
| "BasicBlock", "InstructionList", "BBTerminatorInst", "JumpTable", "Inst", |
| "PHIList", "ValueRefList", "ValueRefListE", "OptTailCall", "InstVal", |
| "IndexList", "OptVolatile", "MemoryInst", 0 |
| }; |
| #endif |
| |
| # ifdef YYPRINT |
| /* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to |
| token YYLEX-NUM. */ |
| static const unsigned short int yytoknum[] = |
| { |
| 0, 256, 257, 258, 259, 260, 261, 262, 263, 264, |
| 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, |
| 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, |
| 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, |
| 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, |
| 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, |
| 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, |
| 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, |
| 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, |
| 345, 346, 347, 348, 61, 92, 40, 41, 91, 120, |
| 93, 60, 62, 123, 125, 42, 44, 99 |
| }; |
| # endif |
| |
| /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ |
| static const unsigned char yyr1[] = |
| { |
| 0, 108, 109, 109, 110, 110, 111, 111, 111, 111, |
| 111, 112, 112, 112, 113, 113, 113, 113, 113, 113, |
| 114, 114, 115, 115, 115, 115, 116, 116, 116, 116, |
| 117, 117, 118, 118, 119, 119, 120, 120, 120, 120, |
| 120, 121, 121, 121, 121, 121, 122, 122, 123, 123, |
| 124, 125, 125, 125, 125, 125, 125, 125, 125, 125, |
| 125, 125, 125, 125, 126, 126, 126, 126, 126, 126, |
| 126, 126, 126, 126, 127, 127, 128, 128, 128, 128, |
| 129, 129, 129, 129, 129, 129, 129, 129, 129, 129, |
| 129, 129, 129, 129, 129, 129, 130, 130, 130, 130, |
| 130, 130, 130, 131, 131, 132, 132, 133, 134, 134, |
| 134, 134, 135, 135, 135, 135, 135, 135, 135, 136, |
| 136, 137, 137, 137, 138, 139, 139, 139, 140, 140, |
| 141, 141, 142, 143, 143, 144, 144, 144, 144, 145, |
| 146, 146, 147, 148, 148, 149, 151, 150, 152, 152, |
| 152, 152, 152, 152, 152, 152, 152, 153, 153, 154, |
| 154, 155, 156, 156, 157, 158, 158, 158, 159, 159, |
| 159, 159, 159, 159, 159, 159, 159, 160, 160, 161, |
| 162, 162, 163, 163, 164, 164, 165, 165, 166, 166, |
| 166, 166, 166, 166, 166, 166, 166, 166, 166, 166, |
| 166, 167, 167, 168, 168, 169, 169, 169, 169, 169, |
| 169, 169, 169 |
| }; |
| |
| /* 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, 2, 0, 1, 1, 1, 1, |
| 0, 0, 1, 1, 1, 2, 1, 1, 1, 1, |
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 1, 1, 1, 1, 1, 1, 1, 2, 4, 5, |
| 5, 3, 2, 2, 1, 3, 1, 3, 1, 0, |
| 4, 3, 3, 4, 4, 3, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 6, 5, 8, 6, |
| 6, 6, 6, 3, 1, 1, 1, 1, 2, 2, |
| 2, 1, 4, 2, 5, 5, 3, 4, 0, 1, |
| 1, 3, 3, 3, 3, 3, 1, 0, 1, 1, |
| 1, 0, 2, 3, 1, 1, 3, 1, 0, 6, |
| 1, 1, 3, 1, 1, 2, 0, 3, 1, 1, |
| 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, |
| 1, 2, 2, 2, 3, 2, 0, 1, 2, 2, |
| 3, 9, 9, 8, 13, 1, 1, 6, 5, 2, |
| 6, 7, 1, 3, 1, 0, 2, 1, 5, 5, |
| 5, 2, 4, 4, 6, 4, 4, 4, 2, 7, |
| 1, 2, 0, 1, 0, 2, 5, 2, 5, 2, |
| 4, 6, 4 |
| }; |
| |
| /* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state |
| STATE-NUM when YYTABLE doesn't specify something else to do. Zero |
| means the default is an error. */ |
| static const unsigned char yydefact[] = |
| { |
| 118, 0, 40, 111, 1, 110, 146, 36, 37, 38, |
| 39, 41, 166, 108, 109, 166, 128, 129, 0, 0, |
| 40, 0, 113, 41, 0, 42, 43, 44, 0, 0, |
| 167, 163, 35, 143, 144, 145, 162, 0, 0, 0, |
| 116, 0, 0, 0, 0, 34, 147, 45, 2, 3, |
| 47, 51, 52, 53, 54, 55, 56, 57, 58, 59, |
| 60, 61, 62, 63, 64, 0, 0, 0, 0, 157, |
| 0, 0, 46, 65, 50, 158, 66, 140, 141, 142, |
| 204, 165, 0, 0, 0, 127, 117, 112, 105, 106, |
| 0, 0, 67, 0, 0, 49, 72, 74, 0, 0, |
| 79, 73, 203, 0, 187, 0, 0, 0, 0, 41, |
| 175, 176, 6, 7, 8, 9, 10, 11, 12, 13, |
| 14, 15, 16, 17, 18, 19, 0, 0, 0, 0, |
| 0, 0, 0, 20, 21, 0, 0, 0, 0, 0, |
| 0, 0, 164, 41, 179, 0, 200, 123, 120, 119, |
| 121, 122, 126, 0, 115, 51, 52, 53, 54, 55, |
| 56, 57, 58, 59, 60, 61, 0, 0, 0, 0, |
| 114, 0, 0, 71, 0, 138, 78, 76, 0, 0, |
| 191, 186, 169, 168, 0, 0, 25, 29, 24, 28, |
| 23, 27, 22, 26, 30, 31, 0, 0, 205, 207, |
| 209, 0, 0, 198, 0, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 124, 0, 93, 94, |
| 4, 5, 91, 92, 95, 90, 86, 87, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 89, |
| 88, 48, 48, 75, 137, 131, 134, 135, 0, 0, |
| 68, 148, 149, 150, 151, 152, 153, 154, 0, 156, |
| 160, 159, 161, 0, 170, 0, 0, 0, 0, 202, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 125, 0, 0, 0, 81, 104, |
| 0, 0, 85, 0, 82, 0, 0, 0, 0, 69, |
| 70, 130, 132, 0, 139, 77, 0, 0, 0, 0, |
| 0, 0, 0, 212, 0, 0, 193, 0, 195, 196, |
| 197, 0, 0, 0, 192, 0, 210, 0, 202, 0, |
| 0, 80, 0, 83, 84, 0, 0, 0, 0, 136, |
| 133, 155, 0, 0, 185, 206, 208, 182, 201, 0, |
| 0, 0, 188, 189, 190, 185, 0, 0, 0, 0, |
| 103, 0, 0, 0, 0, 0, 0, 184, 0, 0, |
| 0, 0, 194, 0, 211, 97, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 183, 180, 0, 199, 96, |
| 0, 99, 100, 101, 102, 0, 173, 0, 0, 0, |
| 181, 0, 171, 0, 172, 0, 0, 98, 0, 0, |
| 0, 0, 0, 0, 178, 0, 0, 177, 174 |
| }; |
| |
| /* YYDEFGOTO[NTERM-NUM]. */ |
| static const short int yydefgoto[] = |
| { |
| -1, 69, 222, 235, 236, 237, 238, 166, 167, 196, |
| 168, 20, 11, 28, 70, 71, 169, 73, 74, 98, |
| 178, 289, 259, 290, 90, 1, 2, 3, 150, 40, |
| 86, 153, 75, 302, 246, 247, 248, 29, 79, 12, |
| 35, 13, 14, 23, 260, 76, 262, 347, 15, 31, |
| 32, 142, 398, 81, 203, 367, 368, 143, 144, 313, |
| 145, 146 |
| }; |
| |
| /* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing |
| STATE-NUM. */ |
| #define YYPACT_NINF -383 |
| static const short int yypact[] = |
| { |
| -383, 48, 136, 517, -383, -383, -383, -383, -383, -383, |
| -383, 27, 36, -383, -383, -17, -383, -383, 46, -21, |
| -3, 3, -383, 27, 73, -383, -383, -383, 879, -24, |
| -383, -383, 113, -383, -383, -383, -383, 20, 51, 60, |
| -383, 21, 879, -13, -13, -383, -383, -383, -383, -383, |
| 62, -383, -383, -383, -383, -383, -383, -383, -383, -383, |
| -383, -383, -383, -383, -383, 156, 162, 164, 480, -383, |
| 113, 76, -383, -383, -25, -383, -383, -383, -383, -383, |
| 992, -383, 149, 37, 170, 157, -383, -383, -383, -383, |
| 900, 941, -383, 81, 83, -383, -383, -25, 34, 87, |
| 643, -383, -383, 900, -383, 130, 999, 32, 243, 27, |
| -383, -383, -383, -383, -383, -383, -383, -383, -383, -383, |
| -383, -383, -383, -383, -383, -383, 900, 900, 900, 900, |
| 900, 900, 900, -383, -383, 900, 900, 900, 900, 900, |
| 900, 900, -383, 27, -383, 22, -383, -383, -383, -383, |
| -383, -383, -383, -82, -383, 122, 148, 184, 153, 185, |
| 159, 186, 161, 187, 191, 193, 167, 197, 195, 380, |
| -383, 900, 900, -383, 900, 680, -383, 97, 114, 549, |
| -383, -383, 62, -383, 549, 549, -383, -383, -383, -383, |
| -383, -383, -383, -383, -383, -383, 549, 879, 108, 109, |
| -383, 549, 118, 111, 183, 116, 117, 119, 121, 549, |
| 549, 549, 124, 879, 900, 900, -383, 196, -383, -383, |
| -383, -383, -383, -383, -383, -383, -383, -383, 123, 132, |
| 135, 742, 941, 501, 208, 137, 144, 145, 147, -383, |
| -383, -84, -12, -25, -383, 113, -383, 155, 154, 779, |
| -383, -383, -383, -383, -383, -383, -383, -383, 941, -383, |
| -383, -383, -383, 158, -383, 160, 549, 235, 247, 173, |
| 549, 165, 900, 900, 900, 900, 900, 174, 175, 176, |
| 900, 549, 549, 177, -383, 941, 941, 941, -383, -383, |
| -54, -57, -383, 42, -383, 941, 941, 941, 941, -383, |
| -383, -383, -383, 842, -383, -383, -30, 244, 246, 172, |
| 549, 549, 900, -383, 179, 549, -383, 180, -383, -383, |
| -383, 549, 549, 549, -383, 194, -383, 900, 173, 241, |
| 181, -383, 941, -383, -383, 190, 198, 199, 202, -383, |
| -383, -383, 549, 549, 900, -383, -383, -383, 205, 549, |
| 206, 900, -383, -383, -383, 900, 549, 192, 900, 941, |
| -383, 941, 941, 941, 941, 207, 203, 205, 200, 900, |
| 214, 549, -383, 218, -383, -383, 220, 212, 222, 223, |
| 224, 225, 281, 17, 268, -383, -383, 226, -383, -383, |
| 941, -383, -383, -383, -383, 549, -383, 54, 53, 303, |
| -383, 228, -383, 227, -383, 54, 549, -383, 307, 231, |
| 265, 549, 310, 311, -383, 549, 549, -383, -383 |
| }; |
| |
| /* YYPGOTO[NTERM-NUM]. */ |
| static const short int yypgoto[] = |
| { |
| -383, -383, -383, 254, 262, 264, 272, -106, -105, -372, |
| -383, 313, 333, -101, -38, -383, -28, -383, -56, 255, |
| -383, -90, 188, -223, 312, -383, -383, -383, -383, -383, |
| -383, -383, 4, -383, 55, -383, -383, 331, -383, -383, |
| -383, -383, 356, -383, -382, 25, 28, -81, -383, 345, |
| -383, -383, -383, -383, -383, 49, 7, -383, -383, 35, |
| -383, -383 |
| }; |
| |
| /* 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 -108 |
| static const short int yytable[] = |
| { |
| 72, 170, 194, 195, 87, 77, 30, 21, 197, 291, |
| 293, 397, 97, 33, 72, 403, 299, 42, 216, 88, |
| 89, 101, 180, 409, 217, 183, 405, 186, 187, 188, |
| 189, 190, 191, 192, 193, 306, 21, 7, 8, 9, |
| 10, 184, 213, 43, 97, 333, 331, 200, 4, 332, |
| 204, 205, 332, 185, 206, 207, 208, 251, 252, 30, |
| 212, 253, 154, 186, 187, 188, 189, 190, 191, 192, |
| 193, -48, 341, 41, 99, 179, 332, 47, 179, 78, |
| 101, 254, 255, 24, 25, 26, 27, 34, 148, 149, |
| 300, 256, 257, 101, 37, 38, 39, 45, 198, 199, |
| 179, 201, 202, 179, 179, 214, 215, 179, 179, 179, |
| 209, 210, 211, 179, 82, 241, 242, 396, 243, 85, |
| 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, |
| 122, 123, 124, 125, 283, 16, -107, 17, 173, 228, |
| 174, 229, 230, 133, 134, 83, 334, 245, 332, 218, |
| 219, -25, -25, 404, 84, 258, -24, -24, -49, 266, |
| 92, 5, -23, -23, -22, -22, 93, 6, 94, 72, |
| 220, 221, 100, 147, 151, 281, 7, 8, 9, 10, |
| 171, 152, 172, 175, 181, 72, 282, 179, -29, -28, |
| -27, -26, 317, 243, 240, 328, 329, 330, -32, 324, |
| -33, 223, 224, 249, 261, 335, 336, 337, 338, 261, |
| 261, 250, 263, 264, 267, 268, 270, 271, 272, 285, |
| 284, 261, 273, 274, 265, 275, 261, 276, 286, 269, |
| 280, 287, 294, 295, 261, 261, 261, 277, 278, 279, |
| 296, 297, 360, 298, 316, 179, 318, 319, 320, 301, |
| 310, 304, 179, 186, 187, 188, 189, 190, 191, 192, |
| 193, 303, 311, 315, 307, 342, 308, 343, 344, 377, |
| 372, 378, 379, 380, 381, 245, 358, 194, 195, 312, |
| 321, 322, 323, 327, 179, 349, 351, 359, 385, 375, |
| 355, 261, 194, 195, 309, 261, 361, 384, 314, 356, |
| 401, 383, 395, 399, 362, 363, 261, 261, 364, 325, |
| 326, 369, 371, 382, 386, 388, 179, 389, 390, 391, |
| 392, 393, 394, 179, 406, 407, 400, 179, 411, 413, |
| 376, 415, 416, 408, 138, 261, 261, 412, 345, 346, |
| 261, 179, 139, 350, 140, 80, 261, 261, 261, 352, |
| 353, 354, 141, 44, 46, 177, 91, 239, 340, 22, |
| 36, 348, 373, 357, 0, 0, 0, 261, 261, 0, |
| 365, 366, 0, 0, 261, 0, 0, 370, 0, 0, |
| 0, 261, 0, 0, 374, 48, 49, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 261, 0, 0, 387, |
| 0, 0, 16, 0, 17, 0, 225, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 226, 227, 0, |
| 261, 0, 0, 402, 0, 0, 0, 0, 0, 0, |
| 0, 261, 0, 0, 410, 0, 261, 0, 0, 414, |
| 261, 261, 0, 417, 418, 0, 112, 113, 114, 115, |
| 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, |
| 0, 0, 0, 0, 0, 228, 0, 229, 230, 133, |
| 134, 0, 0, 0, 0, 0, 0, 0, 231, 0, |
| 0, 232, 0, 233, 0, 48, 49, 234, 95, 51, |
| 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, |
| 62, 63, 16, 0, 17, 0, 48, 49, 0, 95, |
| 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, |
| 165, 62, 63, 16, 64, 17, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, -35, 0, 16, |
| 0, 17, 0, 0, 0, 64, 0, 0, 6, -35, |
| -35, 0, 251, 252, 48, 49, 253, -35, -35, -35, |
| -35, 0, 0, -35, 18, 0, 0, 0, 0, 0, |
| 19, 16, 0, 17, 0, 65, 254, 255, 66, 0, |
| 0, 67, 0, 68, 96, 0, 256, 257, 0, 0, |
| 0, 0, 0, 0, 0, 0, 65, 0, 0, 66, |
| 0, 0, 67, 0, 68, 292, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 112, 113, 114, 115, 116, |
| 117, 118, 119, 120, 121, 122, 123, 124, 125, 0, |
| 0, 0, 0, 0, 228, 0, 229, 230, 133, 134, |
| 0, 0, 0, 0, 0, 0, 0, 0, 48, 49, |
| 258, 95, 51, 52, 53, 54, 55, 56, 57, 58, |
| 59, 60, 61, 62, 63, 16, 0, 17, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 176, |
| 0, 0, 0, 0, 0, 48, 49, 64, 95, 51, |
| 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, |
| 62, 63, 16, 0, 17, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 244, 0, 0, 0, |
| 0, 0, 0, 0, 64, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 65, 0, |
| 0, 66, 0, 0, 67, 0, 68, 48, 49, 0, |
| 95, 155, 156, 157, 158, 159, 160, 161, 162, 163, |
| 164, 165, 62, 63, 16, 0, 17, 0, 0, 0, |
| 0, 0, 0, 0, 0, 65, 0, 0, 66, 0, |
| 0, 67, 0, 68, 48, 49, 64, 95, 51, 52, |
| 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, |
| 63, 16, 0, 17, 0, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 305, 0, 0, 0, 0, |
| 0, 0, 0, 64, 0, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 65, 0, 0, |
| 66, 0, 288, 67, 0, 68, 0, 48, 49, 0, |
| 95, 51, 52, 53, 54, 55, 56, 57, 58, 59, |
| 60, 61, 62, 63, 16, 0, 17, 0, 0, 0, |
| 0, 0, 0, 0, 65, 0, 0, 66, 339, 0, |
| 67, 0, 68, 0, 48, 49, 64, 50, 51, 52, |
| 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, |
| 63, 16, 0, 17, 0, 48, 49, 0, 95, 51, |
| 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, |
| 62, 63, 16, 64, 17, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 65, 0, 0, |
| 66, 0, 0, 67, 64, 68, 48, 49, 0, 95, |
| 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, |
| 165, 62, 63, 16, 0, 17, 0, 0, 0, 0, |
| 0, 0, 0, 0, 65, 0, 0, 66, 0, 0, |
| 67, 0, 68, 0, 0, 64, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 65, 0, 0, 66, 0, |
| 0, 67, 0, 68, 48, 49, 0, 182, 51, 52, |
| 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, |
| 63, 16, 0, 17, 0, 0, 102, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 65, 103, 0, 66, |
| 0, 0, 67, 64, 68, 0, 104, 105, 0, 0, |
| 0, 0, 106, 107, 108, 109, 110, 111, 112, 113, |
| 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, |
| 124, 125, 126, 127, 128, 0, 0, 129, 130, 131, |
| 132, 133, 134, 135, 136, 137, 0, 0, 0, 0, |
| 0, 0, 0, 0, 65, 0, 0, 66, 0, 0, |
| 67, 0, 68 |
| }; |
| |
| static const short int yycheck[] = |
| { |
| 28, 91, 108, 108, 42, 29, 23, 3, 109, 232, |
| 233, 383, 68, 30, 42, 397, 100, 20, 100, 32, |
| 33, 105, 103, 405, 106, 106, 398, 10, 11, 12, |
| 13, 14, 15, 16, 17, 258, 32, 40, 41, 42, |
| 43, 9, 143, 46, 100, 102, 100, 128, 0, 106, |
| 131, 132, 106, 21, 135, 136, 137, 3, 4, 23, |
| 141, 7, 90, 10, 11, 12, 13, 14, 15, 16, |
| 17, 96, 102, 94, 70, 103, 106, 4, 106, 103, |
| 105, 27, 28, 56, 57, 58, 59, 104, 51, 52, |
| 102, 37, 38, 105, 48, 49, 50, 94, 126, 127, |
| 128, 129, 130, 131, 132, 83, 84, 135, 136, 137, |
| 138, 139, 140, 141, 94, 171, 172, 100, 174, 98, |
| 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, |
| 76, 77, 78, 79, 215, 22, 0, 24, 104, 85, |
| 106, 87, 88, 89, 90, 94, 104, 175, 106, 27, |
| 28, 3, 4, 100, 94, 101, 3, 4, 96, 197, |
| 4, 25, 3, 4, 3, 4, 4, 31, 4, 197, |
| 3, 4, 96, 24, 4, 213, 40, 41, 42, 43, |
| 99, 24, 99, 96, 54, 213, 214, 215, 4, 4, |
| 4, 4, 273, 249, 169, 285, 286, 287, 7, 280, |
| 7, 4, 7, 106, 179, 295, 296, 297, 298, 184, |
| 185, 97, 184, 185, 106, 106, 98, 106, 35, 96, |
| 24, 196, 106, 106, 196, 106, 201, 106, 96, 201, |
| 106, 96, 24, 96, 209, 210, 211, 209, 210, 211, |
| 96, 96, 332, 96, 272, 273, 274, 275, 276, 245, |
| 15, 97, 280, 10, 11, 12, 13, 14, 15, 16, |
| 17, 106, 15, 98, 106, 21, 106, 21, 96, 359, |
| 351, 361, 362, 363, 364, 303, 35, 383, 383, 106, |
| 106, 106, 106, 106, 312, 106, 106, 106, 369, 97, |
| 96, 266, 398, 398, 266, 270, 106, 97, 270, 327, |
| 390, 98, 21, 35, 106, 106, 281, 282, 106, 281, |
| 282, 106, 106, 106, 100, 97, 344, 97, 106, 97, |
| 97, 97, 97, 351, 21, 97, 100, 355, 21, 64, |
| 358, 21, 21, 106, 80, 310, 311, 106, 310, 311, |
| 315, 369, 80, 315, 80, 32, 321, 322, 323, 321, |
| 322, 323, 80, 20, 23, 100, 44, 169, 303, 3, |
| 15, 312, 355, 328, -1, -1, -1, 342, 343, -1, |
| 342, 343, -1, -1, 349, -1, -1, 349, -1, -1, |
| -1, 356, -1, -1, 356, 5, 6, -1, -1, -1, |
| -1, -1, -1, -1, -1, -1, 371, -1, -1, 371, |
| -1, -1, 22, -1, 24, -1, 26, -1, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, 37, 38, -1, |
| 395, -1, -1, 395, -1, -1, -1, -1, -1, -1, |
| -1, 406, -1, -1, 406, -1, 411, -1, -1, 411, |
| 415, 416, -1, 415, 416, -1, 66, 67, 68, 69, |
| 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, |
| -1, -1, -1, -1, -1, 85, -1, 87, 88, 89, |
| 90, -1, -1, -1, -1, -1, -1, -1, 98, -1, |
| -1, 101, -1, 103, -1, 5, 6, 107, 8, 9, |
| 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, |
| 20, 21, 22, -1, 24, -1, 5, 6, -1, 8, |
| 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, |
| 19, 20, 21, 22, 44, 24, -1, -1, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, 20, -1, 22, |
| -1, 24, -1, -1, -1, 44, -1, -1, 31, 32, |
| 33, -1, 3, 4, 5, 6, 7, 40, 41, 42, |
| 43, -1, -1, 46, 47, -1, -1, -1, -1, -1, |
| 53, 22, -1, 24, -1, 95, 27, 28, 98, -1, |
| -1, 101, -1, 103, 104, -1, 37, 38, -1, -1, |
| -1, -1, -1, -1, -1, -1, 95, -1, -1, 98, |
| -1, -1, 101, -1, 103, 104, -1, -1, -1, -1, |
| -1, -1, -1, -1, -1, 66, 67, 68, 69, 70, |
| 71, 72, 73, 74, 75, 76, 77, 78, 79, -1, |
| -1, -1, -1, -1, 85, -1, 87, 88, 89, 90, |
| -1, -1, -1, -1, -1, -1, -1, -1, 5, 6, |
| 101, 8, 9, 10, 11, 12, 13, 14, 15, 16, |
| 17, 18, 19, 20, 21, 22, -1, 24, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, -1, -1, 36, |
| -1, -1, -1, -1, -1, 5, 6, 44, 8, 9, |
| 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, |
| 20, 21, 22, -1, 24, -1, -1, -1, -1, -1, |
| -1, -1, -1, -1, -1, -1, 36, -1, -1, -1, |
| -1, -1, -1, -1, 44, -1, -1, -1, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, -1, 95, -1, |
| -1, 98, -1, -1, 101, -1, 103, 5, 6, -1, |
| 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, |
| 18, 19, 20, 21, 22, -1, 24, -1, -1, -1, |
| -1, -1, -1, -1, -1, 95, -1, -1, 98, -1, |
| -1, 101, -1, 103, 5, 6, 44, 8, 9, 10, |
| 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, |
| 21, 22, -1, 24, -1, -1, -1, -1, -1, -1, |
| -1, -1, -1, -1, -1, 36, -1, -1, -1, -1, |
| -1, -1, -1, 44, -1, -1, -1, -1, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, 95, -1, -1, |
| 98, -1, 100, 101, -1, 103, -1, 5, 6, -1, |
| 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, |
| 18, 19, 20, 21, 22, -1, 24, -1, -1, -1, |
| -1, -1, -1, -1, 95, -1, -1, 98, 36, -1, |
| 101, -1, 103, -1, 5, 6, 44, 8, 9, 10, |
| 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, |
| 21, 22, -1, 24, -1, 5, 6, -1, 8, 9, |
| 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, |
| 20, 21, 22, 44, 24, -1, -1, -1, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, 95, -1, -1, |
| 98, -1, -1, 101, 44, 103, 5, 6, -1, 8, |
| 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, |
| 19, 20, 21, 22, -1, 24, -1, -1, -1, -1, |
| -1, -1, -1, -1, 95, -1, -1, 98, -1, -1, |
| 101, -1, 103, -1, -1, 44, -1, -1, -1, -1, |
| -1, -1, -1, -1, -1, 95, -1, -1, 98, -1, |
| -1, 101, -1, 103, 5, 6, -1, 8, 9, 10, |
| 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, |
| 21, 22, -1, 24, -1, -1, 34, -1, -1, -1, |
| -1, -1, -1, -1, -1, -1, 95, 45, -1, 98, |
| -1, -1, 101, 44, 103, -1, 54, 55, -1, -1, |
| -1, -1, 60, 61, 62, 63, 64, 65, 66, 67, |
| 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, |
| 78, 79, 80, 81, 82, -1, -1, 85, 86, 87, |
| 88, 89, 90, 91, 92, 93, -1, -1, -1, -1, |
| -1, -1, -1, -1, 95, -1, -1, 98, -1, -1, |
| 101, -1, 103 |
| }; |
| |
| /* YYSTOS[STATE-NUM] -- The (internal number of the) accessing |
| symbol of state STATE-NUM. */ |
| static const unsigned char yystos[] = |
| { |
| 0, 133, 134, 135, 0, 25, 31, 40, 41, 42, |
| 43, 120, 147, 149, 150, 156, 22, 24, 47, 53, |
| 119, 140, 150, 151, 56, 57, 58, 59, 121, 145, |
| 23, 157, 158, 30, 104, 148, 157, 48, 49, 50, |
| 137, 94, 20, 46, 120, 94, 145, 4, 5, 6, |
| 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, |
| 18, 19, 20, 21, 44, 95, 98, 101, 103, 109, |
| 122, 123, 124, 125, 126, 140, 153, 29, 103, 146, |
| 119, 161, 94, 94, 94, 98, 138, 122, 32, 33, |
| 132, 132, 4, 4, 4, 8, 104, 126, 127, 140, |
| 96, 105, 34, 45, 54, 55, 60, 61, 62, 63, |
| 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, |
| 74, 75, 76, 77, 78, 79, 80, 81, 82, 85, |
| 86, 87, 88, 89, 90, 91, 92, 93, 111, 112, |
| 113, 114, 159, 165, 166, 168, 169, 24, 51, 52, |
| 136, 4, 24, 139, 124, 9, 10, 11, 12, 13, |
| 14, 15, 16, 17, 18, 19, 115, 116, 118, 124, |
| 129, 99, 99, 104, 106, 96, 36, 127, 128, 124, |
| 155, 54, 8, 155, 9, 21, 10, 11, 12, 13, |
| 14, 15, 16, 17, 115, 116, 117, 121, 124, 124, |
| 155, 124, 124, 162, 155, 155, 155, 155, 155, 124, |
| 124, 124, 155, 121, 83, 84, 100, 106, 27, 28, |
| 3, 4, 110, 4, 7, 26, 37, 38, 85, 87, |
| 88, 98, 101, 103, 107, 111, 112, 113, 114, 130, |
| 153, 126, 126, 126, 36, 124, 142, 143, 144, 106, |
| 97, 3, 4, 7, 27, 28, 37, 38, 101, 130, |
| 152, 153, 154, 154, 154, 154, 122, 106, 106, 154, |
| 98, 106, 35, 106, 106, 106, 106, 154, 154, 154, |
| 106, 122, 124, 155, 24, 96, 96, 96, 100, 129, |
| 131, 131, 104, 131, 24, 96, 96, 96, 96, 100, |
| 102, 140, 141, 106, 97, 36, 131, 106, 106, 154, |
| 15, 15, 106, 167, 154, 98, 124, 155, 124, 124, |
| 124, 106, 106, 106, 155, 154, 154, 106, 129, 129, |
| 129, 100, 106, 102, 104, 129, 129, 129, 129, 36, |
| 142, 102, 21, 21, 96, 154, 154, 155, 163, 106, |
| 154, 106, 154, 154, 154, 96, 124, 167, 35, 106, |
| 129, 106, 106, 106, 106, 154, 154, 163, 164, 106, |
| 154, 106, 155, 164, 154, 97, 124, 129, 129, 129, |
| 129, 129, 106, 98, 97, 155, 100, 154, 97, 97, |
| 106, 97, 97, 97, 97, 21, 100, 117, 160, 35, |
| 100, 129, 154, 152, 100, 117, 21, 97, 106, 152, |
| 154, 21, 106, 64, 154, 21, 21, 154, 154 |
| }; |
| |
| #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) |
| # if defined (__STDC__) || defined (__cplusplus) |
| # include <stddef.h> /* INFRINGES ON USER NAME SPACE */ |
| # define YYSIZE_T size_t |
| # endif |
| #endif |
| #if ! defined (YYSIZE_T) |
| # define YYSIZE_T unsigned int |
| #endif |
| |
| #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 ("syntax error: cannot back up");\ |
| YYERROR; \ |
| } \ |
| while (0) |
| |
| #define YYTERROR 1 |
| #define YYERRCODE 256 |
| |
| /* YYLLOC_DEFAULT -- Compute the default location (before the actions |
| are run). */ |
| |
| #ifndef YYLLOC_DEFAULT |
| # define YYLLOC_DEFAULT(Current, Rhs, N) \ |
| ((Current).first_line = (Rhs)[1].first_line, \ |
| (Current).first_column = (Rhs)[1].first_column, \ |
| (Current).last_line = (Rhs)[N].last_line, \ |
| (Current).last_column = (Rhs)[N].last_column) |
| #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 YYDSYMPRINT(Args) \ |
| do { \ |
| if (yydebug) \ |
| yysymprint Args; \ |
| } while (0) |
| |
| # define YYDSYMPRINTF(Title, Token, Value, Location) \ |
| do { \ |
| if (yydebug) \ |
| { \ |
| YYFPRINTF (stderr, "%s ", Title); \ |
| yysymprint (stderr, \ |
| Token, 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 int yylno = yyrline[yyrule]; |
| YYFPRINTF (stderr, "Reducing stack by rule %d (line %u), ", |
| 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 YYDSYMPRINT(Args) |
| # define YYDSYMPRINTF(Title, Token, 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 |
| SIZE_MAX < YYSTACK_BYTES (YYMAXDEPTH) |
| evaluated with infinite-precision integer arithmetic. */ |
| |
| #if defined (YYMAXDEPTH) && YYMAXDEPTH == 0 |
| # undef YYMAXDEPTH |
| #endif |
| |
| #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 |
| { |
| register 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 |
| { |
| register char *yyd = yydest; |
| register const char *yys = yysrc; |
| |
| while ((*yyd++ = *yys++) != '\0') |
| continue; |
| |
| return yyd - 1; |
| } |
| # endif |
| # 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]); |
| # ifdef YYPRINT |
| YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep); |
| # endif |
| } |
| else |
| YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]); |
| |
| switch (yytype) |
| { |
| default: |
| break; |
| } |
| YYFPRINTF (yyoutput, ")"); |
| } |
| |
| #endif /* ! YYDEBUG */ |
| /*-----------------------------------------------. |
| | Release the memory associated to this symbol. | |
| `-----------------------------------------------*/ |
| |
| #if defined (__STDC__) || defined (__cplusplus) |
| static void |
| yydestruct (int yytype, YYSTYPE *yyvaluep) |
| #else |
| static void |
| yydestruct (yytype, yyvaluep) |
| int yytype; |
| YYSTYPE *yyvaluep; |
| #endif |
| { |
| /* Pacify ``unused variable'' warnings. */ |
| (void) yyvaluep; |
| |
| 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 lookahead symbol. */ |
| int yychar; |
| |
| /* The semantic value of the lookahead 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 |
| { |
| |
| register int yystate; |
| register int yyn; |
| int yyresult; |
| /* Number of tokens to shift before error messages enabled. */ |
| int yyerrstatus; |
| /* Lookahead 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; |
| register short int *yyssp; |
| |
| /* The semantic value stack. */ |
| YYSTYPE yyvsa[YYINITDEPTH]; |
| YYSTYPE *yyvs = yyvsa; |
| register 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 ("parser stack overflow", |
| &yyss1, yysize * sizeof (*yyssp), |
| &yyvs1, yysize * sizeof (*yyvsp), |
| |
| &yystacksize); |
| |
| yyss = yyss1; |
| yyvs = yyvs1; |
| } |
| #else /* no yyoverflow */ |
| # ifndef YYSTACK_RELOCATE |
| goto yyoverflowlab; |
| # else |
| /* Extend the stack our own way. */ |
| if (YYMAXDEPTH <= yystacksize) |
| goto yyoverflowlab; |
| yystacksize *= 2; |
| if (YYMAXDEPTH < yystacksize) |
| yystacksize = YYMAXDEPTH; |
| |
| { |
| short int *yyss1 = yyss; |
| union yyalloc *yyptr = |
| (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); |
| if (! yyptr) |
| goto yyoverflowlab; |
| 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 lookahead token if we need one and don't already have one. */ |
| /* yyresume: */ |
| |
| /* First try to decide what to do without reference to lookahead token. */ |
| |
| yyn = yypact[yystate]; |
| if (yyn == YYPACT_NINF) |
| goto yydefault; |
| |
| /* Not known => get a lookahead token if don't already have one. */ |
| |
| /* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead 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); |
| YYDSYMPRINTF ("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 lookahead token. */ |
| YYDPRINTF ((stderr, "Shifting token %s, ", yytname[yytoken])); |
| |
| /* 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 984 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| if (yyvsp[0].UIntVal > (uint32_t)INT32_MAX) // Outside of my range! |
| ThrowException("Value too large for type!"); |
| yyval.SIntVal = (int32_t)yyvsp[0].UIntVal; |
| ;} |
| break; |
| |
| case 5: |
| #line 992 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| if (yyvsp[0].UInt64Val > (uint64_t)INT64_MAX) // Outside of my range! |
| ThrowException("Value too large for type!"); |
| yyval.SInt64Val = (int64_t)yyvsp[0].UInt64Val; |
| ;} |
| break; |
| |
| case 34: |
| #line 1015 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.StrVal = yyvsp[-1].StrVal; |
| ;} |
| break; |
| |
| case 35: |
| #line 1018 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.StrVal = 0; |
| ;} |
| break; |
| |
| case 36: |
| #line 1022 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { yyval.Linkage = GlobalValue::InternalLinkage; ;} |
| break; |
| |
| case 37: |
| #line 1023 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { yyval.Linkage = GlobalValue::LinkOnceLinkage; ;} |
| break; |
| |
| case 38: |
| #line 1024 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { yyval.Linkage = GlobalValue::WeakLinkage; ;} |
| break; |
| |
| case 39: |
| #line 1025 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { yyval.Linkage = GlobalValue::AppendingLinkage; ;} |
| break; |
| |
| case 40: |
| #line 1026 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { yyval.Linkage = GlobalValue::ExternalLinkage; ;} |
| break; |
| |
| case 41: |
| #line 1028 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { yyval.UIntVal = CallingConv::C; ;} |
| break; |
| |
| case 42: |
| #line 1029 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { yyval.UIntVal = CallingConv::C; ;} |
| break; |
| |
| case 43: |
| #line 1030 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { yyval.UIntVal = CallingConv::Fast; ;} |
| break; |
| |
| case 44: |
| #line 1031 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { yyval.UIntVal = CallingConv::Cold; ;} |
| break; |
| |
| case 45: |
| #line 1032 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| if ((unsigned)yyvsp[0].UInt64Val != yyvsp[0].UInt64Val) |
| ThrowException("Calling conv too large!"); |
| yyval.UIntVal = yyvsp[0].UInt64Val; |
| ;} |
| break; |
| |
| case 47: |
| #line 1045 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { yyval.TypeVal = new PATypeHolder(yyvsp[0].PrimType); ;} |
| break; |
| |
| case 49: |
| #line 1046 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { yyval.TypeVal = new PATypeHolder(yyvsp[0].PrimType); ;} |
| break; |
| |
| case 50: |
| #line 1048 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!UpRefs.empty()) |
| ThrowException("Invalid upreference in type: " + (*yyvsp[0].TypeVal)->getDescription()); |
| yyval.TypeVal = yyvsp[0].TypeVal; |
| ;} |
| break; |
| |
| case 64: |
| #line 1059 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.TypeVal = new PATypeHolder(OpaqueType::get()); |
| ;} |
| break; |
| |
| case 65: |
| #line 1062 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.TypeVal = new PATypeHolder(yyvsp[0].PrimType); |
| ;} |
| break; |
| |
| case 66: |
| #line 1065 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { // Named types are also simple types... |
| yyval.TypeVal = new PATypeHolder(getTypeVal(yyvsp[0].ValIDVal)); |
| ;} |
| break; |
| |
| case 67: |
| #line 1071 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { // Type UpReference |
| if (yyvsp[0].UInt64Val > (uint64_t)~0U) ThrowException("Value out of range!"); |
| OpaqueType *OT = OpaqueType::get(); // Use temporary placeholder |
| UpRefs.push_back(UpRefRecord((unsigned)yyvsp[0].UInt64Val, OT)); // Add to vector... |
| yyval.TypeVal = new PATypeHolder(OT); |
| UR_OUT("New Upreference!\n"); |
| ;} |
| break; |
| |
| case 68: |
| #line 1078 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { // Function derived type? |
| std::vector<const Type*> Params; |
| for (std::list<llvm::PATypeHolder>::iterator I = yyvsp[-1].TypeList->begin(), |
| E = yyvsp[-1].TypeList->end(); I != E; ++I) |
| Params.push_back(*I); |
| bool isVarArg = Params.size() && Params.back() == Type::VoidTy; |
| if (isVarArg) Params.pop_back(); |
| |
| yyval.TypeVal = new PATypeHolder(HandleUpRefs(FunctionType::get(*yyvsp[-3].TypeVal,Params,isVarArg))); |
| delete yyvsp[-1].TypeList; // Delete the argument list |
| delete yyvsp[-3].TypeVal; // Delete the return type handle |
| ;} |
| break; |
| |
| case 69: |
| #line 1090 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { // Sized array type? |
| yyval.TypeVal = new PATypeHolder(HandleUpRefs(ArrayType::get(*yyvsp[-1].TypeVal, (unsigned)yyvsp[-3].UInt64Val))); |
| delete yyvsp[-1].TypeVal; |
| ;} |
| break; |
| |
| case 70: |
| #line 1094 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { // Packed array type? |
| const llvm::Type* ElemTy = yyvsp[-1].TypeVal->get(); |
| if ((unsigned)yyvsp[-3].UInt64Val != yyvsp[-3].UInt64Val) { |
| ThrowException("Unsigned result not equal to signed result"); |
| } |
| if(!ElemTy->isPrimitiveType()) { |
| ThrowException("Elemental type of a PackedType must be primitive"); |
| } |
| yyval.TypeVal = new PATypeHolder(HandleUpRefs(PackedType::get(*yyvsp[-1].TypeVal, (unsigned)yyvsp[-3].UInt64Val))); |
| delete yyvsp[-1].TypeVal; |
| ;} |
| break; |
| |
| case 71: |
| #line 1105 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { // Structure type? |
| std::vector<const Type*> Elements; |
| for (std::list<llvm::PATypeHolder>::iterator I = yyvsp[-1].TypeList->begin(), |
| E = yyvsp[-1].TypeList->end(); I != E; ++I) |
| Elements.push_back(*I); |
| |
| yyval.TypeVal = new PATypeHolder(HandleUpRefs(StructType::get(Elements))); |
| delete yyvsp[-1].TypeList; |
| ;} |
| break; |
| |
| case 72: |
| #line 1114 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { // Empty structure type? |
| yyval.TypeVal = new PATypeHolder(StructType::get(std::vector<const Type*>())); |
| ;} |
| break; |
| |
| case 73: |
| #line 1117 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { // Pointer type? |
| yyval.TypeVal = new PATypeHolder(HandleUpRefs(PointerType::get(*yyvsp[-1].TypeVal))); |
| delete yyvsp[-1].TypeVal; |
| ;} |
| break; |
| |
| case 74: |
| #line 1125 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.TypeList = new std::list<PATypeHolder>(); |
| yyval.TypeList->push_back(*yyvsp[0].TypeVal); delete yyvsp[0].TypeVal; |
| ;} |
| break; |
| |
| case 75: |
| #line 1129 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.TypeList=yyvsp[-2].TypeList)->push_back(*yyvsp[0].TypeVal); delete yyvsp[0].TypeVal; |
| ;} |
| break; |
| |
| case 77: |
| #line 1135 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.TypeList=yyvsp[-2].TypeList)->push_back(Type::VoidTy); |
| ;} |
| break; |
| |
| case 78: |
| #line 1138 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.TypeList = new std::list<PATypeHolder>())->push_back(Type::VoidTy); |
| ;} |
| break; |
| |
| case 79: |
| #line 1141 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.TypeList = new std::list<PATypeHolder>(); |
| ;} |
| break; |
| |
| case 80: |
| #line 1151 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { // Nonempty unsized arr |
| const ArrayType *ATy = dyn_cast<ArrayType>(yyvsp[-3].TypeVal->get()); |
| if (ATy == 0) |
| ThrowException("Cannot make array constant with type: '" + |
| (*yyvsp[-3].TypeVal)->getDescription() + "'!"); |
| const Type *ETy = ATy->getElementType(); |
| int NumElements = ATy->getNumElements(); |
| |
| // Verify that we have the correct size... |
| if (NumElements != -1 && NumElements != (int)yyvsp[-1].ConstVector->size()) |
| ThrowException("Type mismatch: constant sized array initialized with " + |
| utostr(yyvsp[-1].ConstVector->size()) + " arguments, but has size of " + |
| itostr(NumElements) + "!"); |
| |
| // Verify all elements are correct type! |
| for (unsigned i = 0; i < yyvsp[-1].ConstVector->size(); i++) { |
| if (ETy != (*yyvsp[-1].ConstVector)[i]->getType()) |
| ThrowException("Element #" + utostr(i) + " is not of type '" + |
| ETy->getDescription() +"' as required!\nIt is of type '"+ |
| (*yyvsp[-1].ConstVector)[i]->getType()->getDescription() + "'."); |
| } |
| |
| yyval.ConstVal = ConstantArray::get(ATy, *yyvsp[-1].ConstVector); |
| delete yyvsp[-3].TypeVal; delete yyvsp[-1].ConstVector; |
| ;} |
| break; |
| |
| case 81: |
| #line 1176 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| const ArrayType *ATy = dyn_cast<ArrayType>(yyvsp[-2].TypeVal->get()); |
| if (ATy == 0) |
| ThrowException("Cannot make array constant with type: '" + |
| (*yyvsp[-2].TypeVal)->getDescription() + "'!"); |
| |
| int NumElements = ATy->getNumElements(); |
| if (NumElements != -1 && NumElements != 0) |
| ThrowException("Type mismatch: constant sized array initialized with 0" |
| " arguments, but has size of " + itostr(NumElements) +"!"); |
| yyval.ConstVal = ConstantArray::get(ATy, std::vector<Constant*>()); |
| delete yyvsp[-2].TypeVal; |
| ;} |
| break; |
| |
| case 82: |
| #line 1189 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| const ArrayType *ATy = dyn_cast<ArrayType>(yyvsp[-2].TypeVal->get()); |
| if (ATy == 0) |
| ThrowException("Cannot make array constant with type: '" + |
| (*yyvsp[-2].TypeVal)->getDescription() + "'!"); |
| |
| int NumElements = ATy->getNumElements(); |
| const Type *ETy = ATy->getElementType(); |
| char *EndStr = UnEscapeLexed(yyvsp[0].StrVal, true); |
| if (NumElements != -1 && NumElements != (EndStr-yyvsp[0].StrVal)) |
| ThrowException("Can't build string constant of size " + |
| itostr((int)(EndStr-yyvsp[0].StrVal)) + |
| " when array has size " + itostr(NumElements) + "!"); |
| std::vector<Constant*> Vals; |
| if (ETy == Type::SByteTy) { |
| for (char *C = yyvsp[0].StrVal; C != EndStr; ++C) |
| Vals.push_back(ConstantSInt::get(ETy, *C)); |
| } else if (ETy == Type::UByteTy) { |
| for (char *C = yyvsp[0].StrVal; C != EndStr; ++C) |
| Vals.push_back(ConstantUInt::get(ETy, (unsigned char)*C)); |
| } else { |
| free(yyvsp[0].StrVal); |
| ThrowException("Cannot build string arrays of non byte sized elements!"); |
| } |
| free(yyvsp[0].StrVal); |
| yyval.ConstVal = ConstantArray::get(ATy, Vals); |
| delete yyvsp[-2].TypeVal; |
| ;} |
| break; |
| |
| case 83: |
| #line 1217 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { // Nonempty unsized arr |
| const PackedType *PTy = dyn_cast<PackedType>(yyvsp[-3].TypeVal->get()); |
| if (PTy == 0) |
| ThrowException("Cannot make packed constant with type: '" + |
| (*yyvsp[-3].TypeVal)->getDescription() + "'!"); |
| const Type *ETy = PTy->getElementType(); |
| int NumElements = PTy->getNumElements(); |
| |
| // Verify that we have the correct size... |
| if (NumElements != -1 && NumElements != (int)yyvsp[-1].ConstVector->size()) |
| ThrowException("Type mismatch: constant sized packed initialized with " + |
| utostr(yyvsp[-1].ConstVector->size()) + " arguments, but has size of " + |
| itostr(NumElements) + "!"); |
| |
| // Verify all elements are correct type! |
| for (unsigned i = 0; i < yyvsp[-1].ConstVector->size(); i++) { |
| if (ETy != (*yyvsp[-1].ConstVector)[i]->getType()) |
| ThrowException("Element #" + utostr(i) + " is not of type '" + |
| ETy->getDescription() +"' as required!\nIt is of type '"+ |
| (*yyvsp[-1].ConstVector)[i]->getType()->getDescription() + "'."); |
| } |
| |
| yyval.ConstVal = ConstantPacked::get(PTy, *yyvsp[-1].ConstVector); |
| delete yyvsp[-3].TypeVal; delete yyvsp[-1].ConstVector; |
| ;} |
| break; |
| |
| case 84: |
| #line 1242 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| const StructType *STy = dyn_cast<StructType>(yyvsp[-3].TypeVal->get()); |
| if (STy == 0) |
| ThrowException("Cannot make struct constant with type: '" + |
| (*yyvsp[-3].TypeVal)->getDescription() + "'!"); |
| |
| if (yyvsp[-1].ConstVector->size() != STy->getNumContainedTypes()) |
| ThrowException("Illegal number of initializers for structure type!"); |
| |
| // Check to ensure that constants are compatible with the type initializer! |
| for (unsigned i = 0, e = yyvsp[-1].ConstVector->size(); i != e; ++i) |
| if ((*yyvsp[-1].ConstVector)[i]->getType() != STy->getElementType(i)) |
| ThrowException("Expected type '" + |
| STy->getElementType(i)->getDescription() + |
| "' for element #" + utostr(i) + |
| " of structure initializer!"); |
| |
| yyval.ConstVal = ConstantStruct::get(STy, *yyvsp[-1].ConstVector); |
| delete yyvsp[-3].TypeVal; delete yyvsp[-1].ConstVector; |
| ;} |
| break; |
| |
| case 85: |
| #line 1262 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| const StructType *STy = dyn_cast<StructType>(yyvsp[-2].TypeVal->get()); |
| if (STy == 0) |
| ThrowException("Cannot make struct constant with type: '" + |
| (*yyvsp[-2].TypeVal)->getDescription() + "'!"); |
| |
| if (STy->getNumContainedTypes() != 0) |
| ThrowException("Illegal number of initializers for structure type!"); |
| |
| yyval.ConstVal = ConstantStruct::get(STy, std::vector<Constant*>()); |
| delete yyvsp[-2].TypeVal; |
| ;} |
| break; |
| |
| case 86: |
| #line 1274 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| const PointerType *PTy = dyn_cast<PointerType>(yyvsp[-1].TypeVal->get()); |
| if (PTy == 0) |
| ThrowException("Cannot make null pointer constant with type: '" + |
| (*yyvsp[-1].TypeVal)->getDescription() + "'!"); |
| |
| yyval.ConstVal = ConstantPointerNull::get(PTy); |
| delete yyvsp[-1].TypeVal; |
| ;} |
| break; |
| |
| case 87: |
| #line 1283 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.ConstVal = UndefValue::get(yyvsp[-1].TypeVal->get()); |
| delete yyvsp[-1].TypeVal; |
| ;} |
| break; |
| |
| case 88: |
| #line 1287 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| const PointerType *Ty = dyn_cast<PointerType>(yyvsp[-1].TypeVal->get()); |
| if (Ty == 0) |
| ThrowException("Global const reference must be a pointer type!"); |
| |
| // ConstExprs can exist in the body of a function, thus creating |
| // GlobalValues whenever they refer to a variable. Because we are in |
| // the context of a function, getValNonImprovising will search the functions |
| // symbol table instead of the module symbol table for the global symbol, |
| // which throws things all off. To get around this, we just tell |
| // getValNonImprovising that we are at global scope here. |
| // |
| Function *SavedCurFn = CurFun.CurrentFunction; |
| CurFun.CurrentFunction = 0; |
| |
| Value *V = getValNonImprovising(Ty, yyvsp[0].ValIDVal); |
| |
| CurFun.CurrentFunction = SavedCurFn; |
| |
| // If this is an initializer for a constant pointer, which is referencing a |
| // (currently) undefined variable, create a stub now that shall be replaced |
| // in the future with the right type of variable. |
| // |
| if (V == 0) { |
| assert(isa<PointerType>(Ty) && "Globals may only be used as pointers!"); |
| const PointerType *PT = cast<PointerType>(Ty); |
| |
| // First check to see if the forward references value is already created! |
| PerModuleInfo::GlobalRefsType::iterator I = |
| CurModule.GlobalRefs.find(std::make_pair(PT, yyvsp[0].ValIDVal)); |
| |
| if (I != CurModule.GlobalRefs.end()) { |
| V = I->second; // Placeholder already exists, use it... |
| yyvsp[0].ValIDVal.destroy(); |
| } else { |
| std::string Name; |
| if (yyvsp[0].ValIDVal.Type == ValID::NameVal) Name = yyvsp[0].ValIDVal.Name; |
| |
| // Create the forward referenced global. |
| GlobalValue *GV; |
| if (const FunctionType *FTy = |
| dyn_cast<FunctionType>(PT->getElementType())) { |
| GV = new Function(FTy, GlobalValue::ExternalLinkage, Name, |
| CurModule.CurrentModule); |
| } else { |
| GV = new GlobalVariable(PT->getElementType(), false, |
| GlobalValue::ExternalLinkage, 0, |
| Name, CurModule.CurrentModule); |
| } |
| |
| // Keep track of the fact that we have a forward ref to recycle it |
| CurModule.GlobalRefs.insert(std::make_pair(std::make_pair(PT, yyvsp[0].ValIDVal), GV)); |
| V = GV; |
| } |
| } |
| |
| yyval.ConstVal = cast<GlobalValue>(V); |
| delete yyvsp[-1].TypeVal; // Free the type handle |
| ;} |
| break; |
| |
| case 89: |
| #line 1346 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| if (yyvsp[-1].TypeVal->get() != yyvsp[0].ConstVal->getType()) |
| ThrowException("Mismatched types for constant expression!"); |
| yyval.ConstVal = yyvsp[0].ConstVal; |
| delete yyvsp[-1].TypeVal; |
| ;} |
| break; |
| |
| case 90: |
| #line 1352 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| const Type *Ty = yyvsp[-1].TypeVal->get(); |
| if (isa<FunctionType>(Ty) || Ty == Type::LabelTy || isa<OpaqueType>(Ty)) |
| ThrowException("Cannot create a null initialized value of this type!"); |
| yyval.ConstVal = Constant::getNullValue(Ty); |
| delete yyvsp[-1].TypeVal; |
| ;} |
| break; |
| |
| case 91: |
| #line 1360 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { // integral constants |
| if (!ConstantSInt::isValueValidForType(yyvsp[-1].PrimType, yyvsp[0].SInt64Val)) |
| ThrowException("Constant value doesn't fit in type!"); |
| yyval.ConstVal = ConstantSInt::get(yyvsp[-1].PrimType, yyvsp[0].SInt64Val); |
| ;} |
| break; |
| |
| case 92: |
| #line 1365 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { // integral constants |
| if (!ConstantUInt::isValueValidForType(yyvsp[-1].PrimType, yyvsp[0].UInt64Val)) |
| ThrowException("Constant value doesn't fit in type!"); |
| yyval.ConstVal = ConstantUInt::get(yyvsp[-1].PrimType, yyvsp[0].UInt64Val); |
| ;} |
| break; |
| |
| case 93: |
| #line 1370 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { // Boolean constants |
| yyval.ConstVal = ConstantBool::True; |
| ;} |
| break; |
| |
| case 94: |
| #line 1373 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { // Boolean constants |
| yyval.ConstVal = ConstantBool::False; |
| ;} |
| break; |
| |
| case 95: |
| #line 1376 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { // Float & Double constants |
| if (!ConstantFP::isValueValidForType(yyvsp[-1].PrimType, yyvsp[0].FPVal)) |
| ThrowException("Floating point constant invalid for type!!"); |
| yyval.ConstVal = ConstantFP::get(yyvsp[-1].PrimType, yyvsp[0].FPVal); |
| ;} |
| break; |
| |
| case 96: |
| #line 1383 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!yyvsp[-3].ConstVal->getType()->isFirstClassType()) |
| ThrowException("cast constant expression from a non-primitive type: '" + |
| yyvsp[-3].ConstVal->getType()->getDescription() + "'!"); |
| if (!yyvsp[-1].TypeVal->get()->isFirstClassType()) |
| ThrowException("cast constant expression to a non-primitive type: '" + |
| yyvsp[-1].TypeVal->get()->getDescription() + "'!"); |
| yyval.ConstVal = ConstantExpr::getCast(yyvsp[-3].ConstVal, yyvsp[-1].TypeVal->get()); |
| delete yyvsp[-1].TypeVal; |
| ;} |
| break; |
| |
| case 97: |
| #line 1393 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!isa<PointerType>(yyvsp[-2].ConstVal->getType())) |
| ThrowException("GetElementPtr requires a pointer operand!"); |
| |
| // LLVM 1.2 and earlier used ubyte struct indices. Convert any ubyte struct |
| // indices to uint struct indices for compatibility. |
| generic_gep_type_iterator<std::vector<Value*>::iterator> |
| GTI = gep_type_begin(yyvsp[-2].ConstVal->getType(), yyvsp[-1].ValueList->begin(), yyvsp[-1].ValueList->end()), |
| GTE = gep_type_end(yyvsp[-2].ConstVal->getType(), yyvsp[-1].ValueList->begin(), yyvsp[-1].ValueList->end()); |
| for (unsigned i = 0, e = yyvsp[-1].ValueList->size(); i != e && GTI != GTE; ++i, ++GTI) |
| if (isa<StructType>(*GTI)) // Only change struct indices |
| if (ConstantUInt *CUI = dyn_cast<ConstantUInt>((*yyvsp[-1].ValueList)[i])) |
| if (CUI->getType() == Type::UByteTy) |
| (*yyvsp[-1].ValueList)[i] = ConstantExpr::getCast(CUI, Type::UIntTy); |
| |
| const Type *IdxTy = |
| GetElementPtrInst::getIndexedType(yyvsp[-2].ConstVal->getType(), *yyvsp[-1].ValueList, true); |
| if (!IdxTy) |
| ThrowException("Index list invalid for constant getelementptr!"); |
| |
| std::vector<Constant*> IdxVec; |
| for (unsigned i = 0, e = yyvsp[-1].ValueList->size(); i != e; ++i) |
| if (Constant *C = dyn_cast<Constant>((*yyvsp[-1].ValueList)[i])) |
| IdxVec.push_back(C); |
| else |
| ThrowException("Indices to constant getelementptr must be constants!"); |
| |
| delete yyvsp[-1].ValueList; |
| |
| yyval.ConstVal = ConstantExpr::getGetElementPtr(yyvsp[-2].ConstVal, IdxVec); |
| ;} |
| break; |
| |
| case 98: |
| #line 1424 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| if (yyvsp[-5].ConstVal->getType() != Type::BoolTy) |
| ThrowException("Select condition must be of boolean type!"); |
| if (yyvsp[-3].ConstVal->getType() != yyvsp[-1].ConstVal->getType()) |
| ThrowException("Select operand types must match!"); |
| yyval.ConstVal = ConstantExpr::getSelect(yyvsp[-5].ConstVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal); |
| ;} |
| break; |
| |
| case 99: |
| #line 1431 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| if (yyvsp[-3].ConstVal->getType() != yyvsp[-1].ConstVal->getType()) |
| ThrowException("Binary operator types must match!"); |
| // HACK: llvm 1.3 and earlier used to emit invalid pointer constant exprs. |
| // To retain backward compatibility with these early compilers, we emit a |
| // cast to the appropriate integer type automatically if we are in the |
| // broken case. See PR424 for more information. |
| if (!isa<PointerType>(yyvsp[-3].ConstVal->getType())) { |
| yyval.ConstVal = ConstantExpr::get(yyvsp[-5].BinaryOpVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal); |
| } else { |
| const Type *IntPtrTy = 0; |
| switch (CurModule.CurrentModule->getPointerSize()) { |
| case Module::Pointer32: IntPtrTy = Type::IntTy; break; |
| case Module::Pointer64: IntPtrTy = Type::LongTy; break; |
| default: ThrowException("invalid pointer binary constant expr!"); |
| } |
| yyval.ConstVal = ConstantExpr::get(yyvsp[-5].BinaryOpVal, ConstantExpr::getCast(yyvsp[-3].ConstVal, IntPtrTy), |
| ConstantExpr::getCast(yyvsp[-1].ConstVal, IntPtrTy)); |
| yyval.ConstVal = ConstantExpr::getCast(yyval.ConstVal, yyvsp[-3].ConstVal->getType()); |
| } |
| ;} |
| break; |
| |
| case 100: |
| #line 1452 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| if (yyvsp[-3].ConstVal->getType() != yyvsp[-1].ConstVal->getType()) |
| ThrowException("Logical operator types must match!"); |
| if (!yyvsp[-3].ConstVal->getType()->isIntegral()) |
| ThrowException("Logical operands must have integral types!"); |
| yyval.ConstVal = ConstantExpr::get(yyvsp[-5].BinaryOpVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal); |
| ;} |
| break; |
| |
| case 101: |
| #line 1459 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| if (yyvsp[-3].ConstVal->getType() != yyvsp[-1].ConstVal->getType()) |
| ThrowException("setcc operand types must match!"); |
| yyval.ConstVal = ConstantExpr::get(yyvsp[-5].BinaryOpVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal); |
| ;} |
| break; |
| |
| case 102: |
| #line 1464 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| if (yyvsp[-1].ConstVal->getType() != Type::UByteTy) |
| ThrowException("Shift count for shift constant must be unsigned byte!"); |
| if (!yyvsp[-3].ConstVal->getType()->isInteger()) |
| ThrowException("Shift constant expression requires integer operand!"); |
| yyval.ConstVal = ConstantExpr::get(yyvsp[-5].OtherOpVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal); |
| ;} |
| break; |
| |
| case 103: |
| #line 1474 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| (yyval.ConstVector = yyvsp[-2].ConstVector)->push_back(yyvsp[0].ConstVal); |
| ;} |
| break; |
| |
| case 104: |
| #line 1477 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.ConstVector = new std::vector<Constant*>(); |
| yyval.ConstVector->push_back(yyvsp[0].ConstVal); |
| ;} |
| break; |
| |
| case 105: |
| #line 1484 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { yyval.BoolVal = false; ;} |
| break; |
| |
| case 106: |
| #line 1484 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { yyval.BoolVal = true; ;} |
| break; |
| |
| case 107: |
| #line 1494 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.ModuleVal = ParserResult = yyvsp[0].ModuleVal; |
| CurModule.ModuleDone(); |
| ;} |
| break; |
| |
| case 108: |
| #line 1501 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.ModuleVal = yyvsp[-1].ModuleVal; |
| CurFun.FunctionDone(); |
| ;} |
| break; |
| |
| case 109: |
| #line 1505 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.ModuleVal = yyvsp[-1].ModuleVal; |
| ;} |
| break; |
| |
| case 110: |
| #line 1508 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.ModuleVal = yyvsp[-1].ModuleVal; |
| ;} |
| break; |
| |
| case 111: |
| #line 1511 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.ModuleVal = CurModule.CurrentModule; |
| // Emit an error if there are any unresolved types left. |
| if (!CurModule.LateResolveTypes.empty()) { |
| const ValID &DID = CurModule.LateResolveTypes.begin()->first; |
| if (DID.Type == ValID::NameVal) |
| ThrowException("Reference to an undefined type: '"+DID.getName() + "'"); |
| else |
| ThrowException("Reference to an undefined type: #" + itostr(DID.Num)); |
| } |
| ;} |
| break; |
| |
| case 112: |
| #line 1524 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| // Eagerly resolve types. This is not an optimization, this is a |
| // requirement that is due to the fact that we could have this: |
| // |
| // %list = type { %list * } |
| // %list = type { %list * } ; repeated type decl |
| // |
| // If types are not resolved eagerly, then the two types will not be |
| // determined to be the same type! |
| // |
| ResolveTypeTo(yyvsp[-2].StrVal, *yyvsp[0].TypeVal); |
| |
| if (!setTypeName(*yyvsp[0].TypeVal, yyvsp[-2].StrVal) && !yyvsp[-2].StrVal) { |
| // If this is a named type that is not a redefinition, add it to the slot |
| // table. |
| CurModule.Types.push_back(*yyvsp[0].TypeVal); |
| } |
| |
| delete yyvsp[0].TypeVal; |
| ;} |
| break; |
| |
| case 113: |
| #line 1544 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { // Function prototypes can be in const pool |
| ;} |
| break; |
| |
| case 114: |
| #line 1546 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| if (yyvsp[0].ConstVal == 0) ThrowException("Global value initializer is not a constant!"); |
| ParseGlobalVariable(yyvsp[-3].StrVal, yyvsp[-2].Linkage, yyvsp[-1].BoolVal, yyvsp[0].ConstVal->getType(), yyvsp[0].ConstVal); |
| ;} |
| break; |
| |
| case 115: |
| #line 1550 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| ParseGlobalVariable(yyvsp[-3].StrVal, GlobalValue::ExternalLinkage, yyvsp[-1].BoolVal, *yyvsp[0].TypeVal, 0); |
| delete yyvsp[0].TypeVal; |
| ;} |
| break; |
| |
| case 116: |
| #line 1554 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| ;} |
| break; |
| |
| case 117: |
| #line 1556 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| ;} |
| break; |
| |
| case 118: |
| #line 1558 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| ;} |
| break; |
| |
| case 119: |
| #line 1563 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { yyval.Endianness = Module::BigEndian; ;} |
| break; |
| |
| case 120: |
| #line 1564 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { yyval.Endianness = Module::LittleEndian; ;} |
| break; |
| |
| case 121: |
| #line 1566 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| CurModule.CurrentModule->setEndianness(yyvsp[0].Endianness); |
| ;} |
| break; |
| |
| case 122: |
| #line 1569 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| if (yyvsp[0].UInt64Val == 32) |
| CurModule.CurrentModule->setPointerSize(Module::Pointer32); |
| else if (yyvsp[0].UInt64Val == 64) |
| CurModule.CurrentModule->setPointerSize(Module::Pointer64); |
| else |
| ThrowException("Invalid pointer size: '" + utostr(yyvsp[0].UInt64Val) + "'!"); |
| ;} |
| break; |
| |
| case 123: |
| #line 1577 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| CurModule.CurrentModule->setTargetTriple(yyvsp[0].StrVal); |
| free(yyvsp[0].StrVal); |
| ;} |
| break; |
| |
| case 125: |
| #line 1584 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| CurModule.CurrentModule->addLibrary(yyvsp[0].StrVal); |
| free(yyvsp[0].StrVal); |
| ;} |
| break; |
| |
| case 126: |
| #line 1588 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| CurModule.CurrentModule->addLibrary(yyvsp[0].StrVal); |
| free(yyvsp[0].StrVal); |
| ;} |
| break; |
| |
| case 127: |
| #line 1592 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| ;} |
| break; |
| |
| case 131: |
| #line 1601 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { yyval.StrVal = 0; ;} |
| break; |
| |
| case 132: |
| #line 1603 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| if (*yyvsp[-1].TypeVal == Type::VoidTy) |
| ThrowException("void typed arguments are invalid!"); |
| yyval.ArgVal = new std::pair<PATypeHolder*, char*>(yyvsp[-1].TypeVal, yyvsp[0].StrVal); |
| ;} |
| break; |
| |
| case 133: |
| #line 1609 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.ArgList = yyvsp[-2].ArgList; |
| yyvsp[-2].ArgList->push_back(*yyvsp[0].ArgVal); |
| delete yyvsp[0].ArgVal; |
| ;} |
| break; |
| |
| case 134: |
| #line 1614 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.ArgList = new std::vector<std::pair<PATypeHolder*,char*> >(); |
| yyval.ArgList->push_back(*yyvsp[0].ArgVal); |
| delete yyvsp[0].ArgVal; |
| ;} |
| break; |
| |
| case 135: |
| #line 1620 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.ArgList = yyvsp[0].ArgList; |
| ;} |
| break; |
| |
| case 136: |
| #line 1623 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.ArgList = yyvsp[-2].ArgList; |
| yyval.ArgList->push_back(std::pair<PATypeHolder*, |
| char*>(new PATypeHolder(Type::VoidTy), 0)); |
| ;} |
| break; |
| |
| case 137: |
| #line 1628 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.ArgList = new std::vector<std::pair<PATypeHolder*,char*> >(); |
| yyval.ArgList->push_back(std::make_pair(new PATypeHolder(Type::VoidTy), (char*)0)); |
| ;} |
| break; |
| |
| case 138: |
| #line 1632 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.ArgList = 0; |
| ;} |
| break; |
| |
| case 139: |
| #line 1636 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| UnEscapeLexed(yyvsp[-3].StrVal); |
| std::string FunctionName(yyvsp[-3].StrVal); |
| free(yyvsp[-3].StrVal); // Free strdup'd memory! |
| |
| if (!(*yyvsp[-4].TypeVal)->isFirstClassType() && *yyvsp[-4].TypeVal != Type::VoidTy) |
| ThrowException("LLVM functions cannot return aggregate types!"); |
| |
| std::vector<const Type*> ParamTypeList; |
| if (yyvsp[-1].ArgList) { // If there are arguments... |
| for (std::vector<std::pair<PATypeHolder*,char*> >::iterator I = yyvsp[-1].ArgList->begin(); |
| I != yyvsp[-1].ArgList->end(); ++I) |
| ParamTypeList.push_back(I->first->get()); |
| } |
| |
| bool isVarArg = ParamTypeList.size() && ParamTypeList.back() == Type::VoidTy; |
| if (isVarArg) ParamTypeList.pop_back(); |
| |
| const FunctionType *FT = FunctionType::get(*yyvsp[-4].TypeVal, ParamTypeList, isVarArg); |
| const PointerType *PFT = PointerType::get(FT); |
| delete yyvsp[-4].TypeVal; |
| |
| ValID ID; |
| if (!FunctionName.empty()) { |
| ID = ValID::create((char*)FunctionName.c_str()); |
| } else { |
| ID = ValID::create((int)CurModule.Values[PFT].size()); |
| } |
| |
| Function *Fn = 0; |
| // See if this function was forward referenced. If so, recycle the object. |
| if (GlobalValue *FWRef = CurModule.GetForwardRefForGlobal(PFT, ID)) { |
| // Move the function to the end of the list, from whereever it was |
| // previously inserted. |
| Fn = cast<Function>(FWRef); |
| CurModule.CurrentModule->getFunctionList().remove(Fn); |
| CurModule.CurrentModule->getFunctionList().push_back(Fn); |
| } else if (!FunctionName.empty() && // Merge with an earlier prototype? |
| (Fn = CurModule.CurrentModule->getFunction(FunctionName, FT))) { |
| // If this is the case, either we need to be a forward decl, or it needs |
| // to be. |
| if (!CurFun.isDeclare && !Fn->isExternal()) |
| ThrowException("Redefinition of function '" + FunctionName + "'!"); |
| |
| // Make sure to strip off any argument names so we can't get conflicts. |
| if (Fn->isExternal()) |
| for (Function::arg_iterator AI = Fn->arg_begin(), AE = Fn->arg_end(); |
| AI != AE; ++AI) |
| AI->setName(""); |
| |
| } else { // Not already defined? |
| Fn = new Function(FT, GlobalValue::ExternalLinkage, FunctionName, |
| CurModule.CurrentModule); |
| InsertValue(Fn, CurModule.Values); |
| } |
| |
| CurFun.FunctionStart(Fn); |
| Fn->setCallingConv(yyvsp[-5].UIntVal); |
| |
| // Add all of the arguments we parsed to the function... |
| if (yyvsp[-1].ArgList) { // Is null if empty... |
| if (isVarArg) { // Nuke the last entry |
| assert(yyvsp[-1].ArgList->back().first->get() == Type::VoidTy && yyvsp[-1].ArgList->back().second == 0&& |
| "Not a varargs marker!"); |
| delete yyvsp[-1].ArgList->back().first; |
| yyvsp[-1].ArgList->pop_back(); // Delete the last entry |
| } |
| Function::arg_iterator ArgIt = Fn->arg_begin(); |
| for (std::vector<std::pair<PATypeHolder*,char*> >::iterator I = yyvsp[-1].ArgList->begin(); |
| I != yyvsp[-1].ArgList->end(); ++I, ++ArgIt) { |
| delete I->first; // Delete the typeholder... |
| |
| setValueName(ArgIt, I->second); // Insert arg into symtab... |
| InsertValue(ArgIt); |
| } |
| |
| delete yyvsp[-1].ArgList; // We're now done with the argument list |
| } |
| ;} |
| break; |
| |
| case 142: |
| #line 1718 "/usr/home/llvm/obj/../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 145: |
| #line 1728 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.FunctionVal = yyvsp[-1].FunctionVal; |
| ;} |
| break; |
| |
| case 146: |
| #line 1732 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { CurFun.isDeclare = true; ;} |
| break; |
| |
| case 147: |
| #line 1732 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.FunctionVal = CurFun.CurrentFunction; |
| CurFun.FunctionDone(); |
| ;} |
| break; |
| |
| case 148: |
| #line 1741 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { // A reference to a direct constant |
| yyval.ValIDVal = ValID::create(yyvsp[0].SInt64Val); |
| ;} |
| break; |
| |
| case 149: |
| #line 1744 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.ValIDVal = ValID::create(yyvsp[0].UInt64Val); |
| ;} |
| break; |
| |
| case 150: |
| #line 1747 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { // Perhaps it's an FP constant? |
| yyval.ValIDVal = ValID::create(yyvsp[0].FPVal); |
| ;} |
| break; |
| |
| case 151: |
| #line 1750 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.ValIDVal = ValID::create(ConstantBool::True); |
| ;} |
| break; |
| |
| case 152: |
| #line 1753 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.ValIDVal = ValID::create(ConstantBool::False); |
| ;} |
| break; |
| |
| case 153: |
| #line 1756 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.ValIDVal = ValID::createNull(); |
| ;} |
| break; |
| |
| case 154: |
| #line 1759 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.ValIDVal = ValID::createUndef(); |
| ;} |
| break; |
| |
| case 155: |
| #line 1762 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { // Nonempty unsized packed vector |
| const Type *ETy = (*yyvsp[-1].ConstVector)[0]->getType(); |
| int NumElements = yyvsp[-1].ConstVector->size(); |
| |
| PackedType* pt = PackedType::get(ETy, NumElements); |
| PATypeHolder* PTy = new PATypeHolder( |
| HandleUpRefs( |
| PackedType::get( |
| ETy, |
| NumElements) |
| ) |
| ); |
| |
| // Verify all elements are correct type! |
| for (unsigned i = 0; i < yyvsp[-1].ConstVector->size(); i++) { |
| if (ETy != (*yyvsp[-1].ConstVector)[i]->getType()) |
| ThrowException("Element #" + utostr(i) + " is not of type '" + |
| ETy->getDescription() +"' as required!\nIt is of type '" + |
| (*yyvsp[-1].ConstVector)[i]->getType()->getDescription() + "'."); |
| } |
| |
| yyval.ValIDVal = ValID::create(ConstantPacked::get(pt, *yyvsp[-1].ConstVector)); |
| delete PTy; delete yyvsp[-1].ConstVector; |
| ;} |
| break; |
| |
| case 156: |
| #line 1786 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.ValIDVal = ValID::create(yyvsp[0].ConstVal); |
| ;} |
| break; |
| |
| case 157: |
| #line 1793 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { // Is it an integer reference...? |
| yyval.ValIDVal = ValID::create(yyvsp[0].SIntVal); |
| ;} |
| break; |
| |
| case 158: |
| #line 1796 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { // Is it a named reference...? |
| yyval.ValIDVal = ValID::create(yyvsp[0].StrVal); |
| ;} |
| break; |
| |
| case 161: |
| #line 1807 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.ValueVal = getVal(*yyvsp[-1].TypeVal, yyvsp[0].ValIDVal); delete yyvsp[-1].TypeVal; |
| ;} |
| break; |
| |
| case 162: |
| #line 1811 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.FunctionVal = yyvsp[-1].FunctionVal; |
| ;} |
| break; |
| |
| case 163: |
| #line 1814 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { // Do not allow functions with 0 basic blocks |
| yyval.FunctionVal = yyvsp[-1].FunctionVal; |
| ;} |
| break; |
| |
| case 164: |
| #line 1822 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| setValueName(yyvsp[0].TermInstVal, yyvsp[-1].StrVal); |
| InsertValue(yyvsp[0].TermInstVal); |
| |
| yyvsp[-2].BasicBlockVal->getInstList().push_back(yyvsp[0].TermInstVal); |
| InsertValue(yyvsp[-2].BasicBlockVal); |
| yyval.BasicBlockVal = yyvsp[-2].BasicBlockVal; |
| ;} |
| break; |
| |
| case 165: |
| #line 1831 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyvsp[-1].BasicBlockVal->getInstList().push_back(yyvsp[0].InstVal); |
| yyval.BasicBlockVal = yyvsp[-1].BasicBlockVal; |
| ;} |
| break; |
| |
| case 166: |
| #line 1835 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.BasicBlockVal = CurBB = getBBVal(ValID::create((int)CurFun.NextBBNum++), true); |
| |
| // Make sure to move the basic block to the correct location in the |
| // function, instead of leaving it inserted wherever it was first |
| // referenced. |
| Function::BasicBlockListType &BBL = |
| CurFun.CurrentFunction->getBasicBlockList(); |
| BBL.splice(BBL.end(), BBL, yyval.BasicBlockVal); |
| ;} |
| break; |
| |
| case 167: |
| #line 1845 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.BasicBlockVal = CurBB = getBBVal(ValID::create(yyvsp[0].StrVal), true); |
| |
| // Make sure to move the basic block to the correct location in the |
| // function, instead of leaving it inserted wherever it was first |
| // referenced. |
| Function::BasicBlockListType &BBL = |
| CurFun.CurrentFunction->getBasicBlockList(); |
| BBL.splice(BBL.end(), BBL, yyval.BasicBlockVal); |
| ;} |
| break; |
| |
| case 168: |
| #line 1856 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { // Return with a result... |
| yyval.TermInstVal = new ReturnInst(yyvsp[0].ValueVal); |
| ;} |
| break; |
| |
| case 169: |
| #line 1859 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { // Return with no result... |
| yyval.TermInstVal = new ReturnInst(); |
| ;} |
| break; |
| |
| case 170: |
| #line 1862 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { // Unconditional Branch... |
| yyval.TermInstVal = new BranchInst(getBBVal(yyvsp[0].ValIDVal)); |
| ;} |
| break; |
| |
| case 171: |
| #line 1865 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.TermInstVal = new BranchInst(getBBVal(yyvsp[-3].ValIDVal), getBBVal(yyvsp[0].ValIDVal), getVal(Type::BoolTy, yyvsp[-6].ValIDVal)); |
| ;} |
| break; |
| |
| case 172: |
| #line 1868 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| SwitchInst *S = new SwitchInst(getVal(yyvsp[-7].PrimType, yyvsp[-6].ValIDVal), getBBVal(yyvsp[-3].ValIDVal), yyvsp[-1].JumpTable->size()); |
| yyval.TermInstVal = S; |
| |
| std::vector<std::pair<Constant*,BasicBlock*> >::iterator I = yyvsp[-1].JumpTable->begin(), |
| E = yyvsp[-1].JumpTable->end(); |
| for (; I != E; ++I) { |
| if (ConstantInt *CI = dyn_cast<ConstantInt>(I->first)) |
| S->addCase(CI, I->second); |
| else |
| ThrowException("Switch case is constant, but not a simple integer!"); |
| } |
| delete yyvsp[-1].JumpTable; |
| ;} |
| break; |
| |
| case 173: |
| #line 1882 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| SwitchInst *S = new SwitchInst(getVal(yyvsp[-6].PrimType, yyvsp[-5].ValIDVal), getBBVal(yyvsp[-2].ValIDVal), 0); |
| yyval.TermInstVal = S; |
| ;} |
| break; |
| |
| case 174: |
| #line 1887 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| const PointerType *PFTy; |
| const FunctionType *Ty; |
| |
| if (!(PFTy = dyn_cast<PointerType>(yyvsp[-10].TypeVal->get())) || |
| !(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) { |
| // Pull out the types of all of the arguments... |
| std::vector<const Type*> ParamTypes; |
| if (yyvsp[-7].ValueList) { |
| for (std::vector<Value*>::iterator I = yyvsp[-7].ValueList->begin(), E = yyvsp[-7].ValueList->end(); |
| I != E; ++I) |
| ParamTypes.push_back((*I)->getType()); |
| } |
| |
| bool isVarArg = ParamTypes.size() && ParamTypes.back() == Type::VoidTy; |
| if (isVarArg) ParamTypes.pop_back(); |
| |
| Ty = FunctionType::get(yyvsp[-10].TypeVal->get(), ParamTypes, isVarArg); |
| PFTy = PointerType::get(Ty); |
| } |
| |
| Value *V = getVal(PFTy, yyvsp[-9].ValIDVal); // Get the function we're calling... |
| |
| BasicBlock *Normal = getBBVal(yyvsp[-3].ValIDVal); |
| BasicBlock *Except = getBBVal(yyvsp[0].ValIDVal); |
| |
| // Create the call node... |
| if (!yyvsp[-7].ValueList) { // Has no arguments? |
| yyval.TermInstVal = new InvokeInst(V, Normal, Except, std::vector<Value*>()); |
| } else { // Has arguments? |
| // Loop through FunctionType's arguments and ensure they are specified |
| // correctly! |
| // |
| FunctionType::param_iterator I = Ty->param_begin(); |
| FunctionType::param_iterator E = Ty->param_end(); |
| std::vector<Value*>::iterator ArgI = yyvsp[-7].ValueList->begin(), ArgE = yyvsp[-7].ValueList->end(); |
| |
| for (; ArgI != ArgE && I != E; ++ArgI, ++I) |
| if ((*ArgI)->getType() != *I) |
| ThrowException("Parameter " +(*ArgI)->getName()+ " is not of type '" + |
| (*I)->getDescription() + "'!"); |
| |
| if (I != E || (ArgI != ArgE && !Ty->isVarArg())) |
| ThrowException("Invalid number of parameters detected!"); |
| |
| yyval.TermInstVal = new InvokeInst(V, Normal, Except, *yyvsp[-7].ValueList); |
| } |
| cast<InvokeInst>(yyval.TermInstVal)->setCallingConv(yyvsp[-11].UIntVal); |
| |
| delete yyvsp[-10].TypeVal; |
| delete yyvsp[-7].ValueList; |
| ;} |
| break; |
| |
| case 175: |
| #line 1939 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.TermInstVal = new UnwindInst(); |
| ;} |
| break; |
| |
| case 176: |
| #line 1942 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.TermInstVal = new UnreachableInst(); |
| ;} |
| break; |
| |
| case 177: |
| #line 1948 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.JumpTable = yyvsp[-5].JumpTable; |
| Constant *V = cast<Constant>(getValNonImprovising(yyvsp[-4].PrimType, yyvsp[-3].ValIDVal)); |
| if (V == 0) |
| ThrowException("May only switch on a constant pool value!"); |
| |
| yyval.JumpTable->push_back(std::make_pair(V, getBBVal(yyvsp[0].ValIDVal))); |
| ;} |
| break; |
| |
| case 178: |
| #line 1956 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.JumpTable = new std::vector<std::pair<Constant*, BasicBlock*> >(); |
| Constant *V = cast<Constant>(getValNonImprovising(yyvsp[-4].PrimType, yyvsp[-3].ValIDVal)); |
| |
| if (V == 0) |
| ThrowException("May only switch on a constant pool value!"); |
| |
| yyval.JumpTable->push_back(std::make_pair(V, getBBVal(yyvsp[0].ValIDVal))); |
| ;} |
| break; |
| |
| case 179: |
| #line 1966 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| // Is this definition named?? if so, assign the name... |
| setValueName(yyvsp[0].InstVal, yyvsp[-1].StrVal); |
| InsertValue(yyvsp[0].InstVal); |
| yyval.InstVal = yyvsp[0].InstVal; |
| ;} |
| break; |
| |
| case 180: |
| #line 1973 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { // Used for PHI nodes |
| yyval.PHIList = new std::list<std::pair<Value*, BasicBlock*> >(); |
| yyval.PHIList->push_back(std::make_pair(getVal(*yyvsp[-5].TypeVal, yyvsp[-3].ValIDVal), getBBVal(yyvsp[-1].ValIDVal))); |
| delete yyvsp[-5].TypeVal; |
| ;} |
| break; |
| |
| case 181: |
| #line 1978 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.PHIList = yyvsp[-6].PHIList; |
| yyvsp[-6].PHIList->push_back(std::make_pair(getVal(yyvsp[-6].PHIList->front().first->getType(), yyvsp[-3].ValIDVal), |
| getBBVal(yyvsp[-1].ValIDVal))); |
| ;} |
| break; |
| |
| case 182: |
| #line 1985 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { // Used for call statements, and memory insts... |
| yyval.ValueList = new std::vector<Value*>(); |
| yyval.ValueList->push_back(yyvsp[0].ValueVal); |
| ;} |
| break; |
| |
| case 183: |
| #line 1989 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.ValueList = yyvsp[-2].ValueList; |
| yyvsp[-2].ValueList->push_back(yyvsp[0].ValueVal); |
| ;} |
| break; |
| |
| case 185: |
| #line 1995 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { yyval.ValueList = 0; ;} |
| break; |
| |
| case 186: |
| #line 1997 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.BoolVal = true; |
| ;} |
| break; |
| |
| case 187: |
| #line 2000 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.BoolVal = false; |
| ;} |
| break; |
| |
| case 188: |
| #line 2006 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!(*yyvsp[-3].TypeVal)->isInteger() && !(*yyvsp[-3].TypeVal)->isFloatingPoint() && |
| !isa<PackedType>((*yyvsp[-3].TypeVal).get())) |
| ThrowException( |
| "Arithmetic operator requires integer, FP, or packed operands!"); |
| if (isa<PackedType>((*yyvsp[-3].TypeVal).get()) && yyvsp[-4].BinaryOpVal == Instruction::Rem) |
| ThrowException("Rem not supported on packed types!"); |
| yyval.InstVal = BinaryOperator::create(yyvsp[-4].BinaryOpVal, getVal(*yyvsp[-3].TypeVal, yyvsp[-2].ValIDVal), getVal(*yyvsp[-3].TypeVal, yyvsp[0].ValIDVal)); |
| if (yyval.InstVal == 0) |
| ThrowException("binary operator returned null!"); |
| delete yyvsp[-3].TypeVal; |
| ;} |
| break; |
| |
| case 189: |
| #line 2018 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!(*yyvsp[-3].TypeVal)->isIntegral()) |
| ThrowException("Logical operator requires integral operands!"); |
| yyval.InstVal = BinaryOperator::create(yyvsp[-4].BinaryOpVal, getVal(*yyvsp[-3].TypeVal, yyvsp[-2].ValIDVal), getVal(*yyvsp[-3].TypeVal, yyvsp[0].ValIDVal)); |
| if (yyval.InstVal == 0) |
| ThrowException("binary operator returned null!"); |
| delete yyvsp[-3].TypeVal; |
| ;} |
| break; |
| |
| case 190: |
| #line 2026 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| if(isa<PackedType>((*yyvsp[-3].TypeVal).get())) { |
| ThrowException( |
| "PackedTypes currently not supported in setcc instructions!"); |
| } |
| yyval.InstVal = new SetCondInst(yyvsp[-4].BinaryOpVal, getVal(*yyvsp[-3].TypeVal, yyvsp[-2].ValIDVal), getVal(*yyvsp[-3].TypeVal, yyvsp[0].ValIDVal)); |
| if (yyval.InstVal == 0) |
| ThrowException("binary operator returned null!"); |
| delete yyvsp[-3].TypeVal; |
| ;} |
| break; |
| |
| case 191: |
| #line 2036 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| std::cerr << "WARNING: Use of eliminated 'not' instruction:" |
| << " Replacing with 'xor'.\n"; |
| |
| Value *Ones = ConstantIntegral::getAllOnesValue(yyvsp[0].ValueVal->getType()); |
| if (Ones == 0) |
| ThrowException("Expected integral type for not instruction!"); |
| |
| yyval.InstVal = BinaryOperator::create(Instruction::Xor, yyvsp[0].ValueVal, Ones); |
| if (yyval.InstVal == 0) |
| ThrowException("Could not create a xor instruction!"); |
| ;} |
| break; |
| |
| case 192: |
| #line 2048 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| if (yyvsp[0].ValueVal->getType() != Type::UByteTy) |
| ThrowException("Shift amount must be ubyte!"); |
| if (!yyvsp[-2].ValueVal->getType()->isInteger()) |
| ThrowException("Shift constant expression requires integer operand!"); |
| yyval.InstVal = new ShiftInst(yyvsp[-3].OtherOpVal, yyvsp[-2].ValueVal, yyvsp[0].ValueVal); |
| ;} |
| break; |
| |
| case 193: |
| #line 2055 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!yyvsp[0].TypeVal->get()->isFirstClassType()) |
| ThrowException("cast instruction to a non-primitive type: '" + |
| yyvsp[0].TypeVal->get()->getDescription() + "'!"); |
| yyval.InstVal = new CastInst(yyvsp[-2].ValueVal, *yyvsp[0].TypeVal); |
| delete yyvsp[0].TypeVal; |
| ;} |
| break; |
| |
| case 194: |
| #line 2062 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| if (yyvsp[-4].ValueVal->getType() != Type::BoolTy) |
| ThrowException("select condition must be boolean!"); |
| if (yyvsp[-2].ValueVal->getType() != yyvsp[0].ValueVal->getType()) |
| ThrowException("select value types should match!"); |
| yyval.InstVal = new SelectInst(yyvsp[-4].ValueVal, yyvsp[-2].ValueVal, yyvsp[0].ValueVal); |
| ;} |
| break; |
| |
| case 195: |
| #line 2069 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| NewVarArgs = true; |
| yyval.InstVal = new VAArgInst(yyvsp[-2].ValueVal, *yyvsp[0].TypeVal); |
| delete yyvsp[0].TypeVal; |
| ;} |
| break; |
| |
| case 196: |
| #line 2074 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| ObsoleteVarArgs = true; |
| const Type* ArgTy = yyvsp[-2].ValueVal->getType(); |
| Function* NF = CurModule.CurrentModule-> |
| getOrInsertFunction("llvm.va_copy", ArgTy, ArgTy, (Type *)0); |
| |
| //b = vaarg a, t -> |
| //foo = alloca 1 of t |
| //bar = vacopy a |
| //store bar -> foo |
| //b = vaarg foo, t |
| AllocaInst* foo = new AllocaInst(ArgTy, 0, "vaarg.fix"); |
| CurBB->getInstList().push_back(foo); |
| CallInst* bar = new CallInst(NF, yyvsp[-2].ValueVal); |
| CurBB->getInstList().push_back(bar); |
| CurBB->getInstList().push_back(new StoreInst(bar, foo)); |
| yyval.InstVal = new VAArgInst(foo, *yyvsp[0].TypeVal); |
| delete yyvsp[0].TypeVal; |
| ;} |
| break; |
| |
| case 197: |
| #line 2093 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| ObsoleteVarArgs = true; |
| const Type* ArgTy = yyvsp[-2].ValueVal->getType(); |
| Function* NF = CurModule.CurrentModule-> |
| getOrInsertFunction("llvm.va_copy", ArgTy, ArgTy, (Type *)0); |
| |
| //b = vanext a, t -> |
| //foo = alloca 1 of t |
| //bar = vacopy a |
| //store bar -> foo |
| //tmp = vaarg foo, t |
| //b = load foo |
| AllocaInst* foo = new AllocaInst(ArgTy, 0, "vanext.fix"); |
| CurBB->getInstList().push_back(foo); |
| CallInst* bar = new CallInst(NF, yyvsp[-2].ValueVal); |
| CurBB->getInstList().push_back(bar); |
| CurBB->getInstList().push_back(new StoreInst(bar, foo)); |
| Instruction* tmp = new VAArgInst(foo, *yyvsp[0].TypeVal); |
| CurBB->getInstList().push_back(tmp); |
| yyval.InstVal = new LoadInst(foo); |
| delete yyvsp[0].TypeVal; |
| ;} |
| break; |
| |
| case 198: |
| #line 2115 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| const Type *Ty = yyvsp[0].PHIList->front().first->getType(); |
| if (!Ty->isFirstClassType()) |
| ThrowException("PHI node operands must be of first class type!"); |
| yyval.InstVal = new PHINode(Ty); |
| ((PHINode*)yyval.InstVal)->reserveOperandSpace(yyvsp[0].PHIList->size()); |
| while (yyvsp[0].PHIList->begin() != yyvsp[0].PHIList->end()) { |
| if (yyvsp[0].PHIList->front().first->getType() != Ty) |
| ThrowException("All elements of a PHI node must be of the same type!"); |
| cast<PHINode>(yyval.InstVal)->addIncoming(yyvsp[0].PHIList->front().first, yyvsp[0].PHIList->front().second); |
| yyvsp[0].PHIList->pop_front(); |
| } |
| delete yyvsp[0].PHIList; // Free the list... |
| ;} |
| break; |
| |
| case 199: |
| #line 2129 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| const PointerType *PFTy; |
| const FunctionType *Ty; |
| |
| if (!(PFTy = dyn_cast<PointerType>(yyvsp[-4].TypeVal->get())) || |
| !(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) { |
| // Pull out the types of all of the arguments... |
| std::vector<const Type*> ParamTypes; |
| if (yyvsp[-1].ValueList) { |
| for (std::vector<Value*>::iterator I = yyvsp[-1].ValueList->begin(), E = yyvsp[-1].ValueList->end(); |
| I != E; ++I) |
| ParamTypes.push_back((*I)->getType()); |
| } |
| |
| bool isVarArg = ParamTypes.size() && ParamTypes.back() == Type::VoidTy; |
| if (isVarArg) ParamTypes.pop_back(); |
| |
| if (!(*yyvsp[-4].TypeVal)->isFirstClassType() && *yyvsp[-4].TypeVal != Type::VoidTy) |
| ThrowException("LLVM functions cannot return aggregate types!"); |
| |
| Ty = FunctionType::get(yyvsp[-4].TypeVal->get(), ParamTypes, isVarArg); |
| PFTy = PointerType::get(Ty); |
| } |
| |
| Value *V = getVal(PFTy, yyvsp[-3].ValIDVal); // Get the function we're calling... |
| |
| // Create the call node... |
| if (!yyvsp[-1].ValueList) { // Has no arguments? |
| // Make sure no arguments is a good thing! |
| if (Ty->getNumParams() != 0) |
| ThrowException("No arguments passed to a function that " |
| "expects arguments!"); |
| |
| yyval.InstVal = new CallInst(V, std::vector<Value*>()); |
| } else { // Has arguments? |
| // Loop through FunctionType's arguments and ensure they are specified |
| // correctly! |
| // |
| FunctionType::param_iterator I = Ty->param_begin(); |
| FunctionType::param_iterator E = Ty->param_end(); |
| std::vector<Value*>::iterator ArgI = yyvsp[-1].ValueList->begin(), ArgE = yyvsp[-1].ValueList->end(); |
| |
| for (; ArgI != ArgE && I != E; ++ArgI, ++I) |
| if ((*ArgI)->getType() != *I) |
| ThrowException("Parameter " +(*ArgI)->getName()+ " is not of type '" + |
| (*I)->getDescription() + "'!"); |
| |
| if (I != E || (ArgI != ArgE && !Ty->isVarArg())) |
| ThrowException("Invalid number of parameters detected!"); |
| |
| yyval.InstVal = new CallInst(V, *yyvsp[-1].ValueList); |
| } |
| cast<CallInst>(yyval.InstVal)->setTailCall(yyvsp[-6].BoolVal); |
| cast<CallInst>(yyval.InstVal)->setCallingConv(yyvsp[-5].UIntVal); |
| delete yyvsp[-4].TypeVal; |
| delete yyvsp[-1].ValueList; |
| ;} |
| break; |
| |
| case 200: |
| #line 2186 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.InstVal = yyvsp[0].InstVal; |
| ;} |
| break; |
| |
| case 201: |
| #line 2192 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.ValueList = yyvsp[0].ValueList; |
| ;} |
| break; |
| |
| case 202: |
| #line 2194 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.ValueList = new std::vector<Value*>(); |
| ;} |
| break; |
| |
| case 203: |
| #line 2198 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.BoolVal = true; |
| ;} |
| break; |
| |
| case 204: |
| #line 2201 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.BoolVal = false; |
| ;} |
| break; |
| |
| case 205: |
| #line 2207 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.InstVal = new MallocInst(*yyvsp[0].TypeVal); |
| delete yyvsp[0].TypeVal; |
| ;} |
| break; |
| |
| case 206: |
| #line 2211 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.InstVal = new MallocInst(*yyvsp[-3].TypeVal, getVal(yyvsp[-1].PrimType, yyvsp[0].ValIDVal)); |
| delete yyvsp[-3].TypeVal; |
| ;} |
| break; |
| |
| case 207: |
| #line 2215 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.InstVal = new AllocaInst(*yyvsp[0].TypeVal); |
| delete yyvsp[0].TypeVal; |
| ;} |
| break; |
| |
| case 208: |
| #line 2219 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| yyval.InstVal = new AllocaInst(*yyvsp[-3].TypeVal, getVal(yyvsp[-1].PrimType, yyvsp[0].ValIDVal)); |
| delete yyvsp[-3].TypeVal; |
| ;} |
| break; |
| |
| case 209: |
| #line 2223 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!isa<PointerType>(yyvsp[0].ValueVal->getType())) |
| ThrowException("Trying to free nonpointer type " + |
| yyvsp[0].ValueVal->getType()->getDescription() + "!"); |
| yyval.InstVal = new FreeInst(yyvsp[0].ValueVal); |
| ;} |
| break; |
| |
| case 210: |
| #line 2230 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!isa<PointerType>(yyvsp[-1].TypeVal->get())) |
| ThrowException("Can't load from nonpointer type: " + |
| (*yyvsp[-1].TypeVal)->getDescription()); |
| if (!cast<PointerType>(yyvsp[-1].TypeVal->get())->getElementType()->isFirstClassType()) |
| ThrowException("Can't load from pointer of non-first-class type: " + |
| (*yyvsp[-1].TypeVal)->getDescription()); |
| yyval.InstVal = new LoadInst(getVal(*yyvsp[-1].TypeVal, yyvsp[0].ValIDVal), "", yyvsp[-3].BoolVal); |
| delete yyvsp[-1].TypeVal; |
| ;} |
| break; |
| |
| case 211: |
| #line 2240 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| const PointerType *PT = dyn_cast<PointerType>(yyvsp[-1].TypeVal->get()); |
| if (!PT) |
| ThrowException("Can't store to a nonpointer type: " + |
| (*yyvsp[-1].TypeVal)->getDescription()); |
| const Type *ElTy = PT->getElementType(); |
| if (ElTy != yyvsp[-3].ValueVal->getType()) |
| ThrowException("Can't store '" + yyvsp[-3].ValueVal->getType()->getDescription() + |
| "' into space of type '" + ElTy->getDescription() + "'!"); |
| |
| yyval.InstVal = new StoreInst(yyvsp[-3].ValueVal, getVal(*yyvsp[-1].TypeVal, yyvsp[0].ValIDVal), yyvsp[-5].BoolVal); |
| delete yyvsp[-1].TypeVal; |
| ;} |
| break; |
| |
| case 212: |
| #line 2253 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| { |
| if (!isa<PointerType>(yyvsp[-2].TypeVal->get())) |
| ThrowException("getelementptr insn requires pointer operand!"); |
| |
| // LLVM 1.2 and earlier used ubyte struct indices. Convert any ubyte struct |
| // indices to uint struct indices for compatibility. |
| generic_gep_type_iterator<std::vector<Value*>::iterator> |
| GTI = gep_type_begin(yyvsp[-2].TypeVal->get(), yyvsp[0].ValueList->begin(), yyvsp[0].ValueList->end()), |
| GTE = gep_type_end(yyvsp[-2].TypeVal->get(), yyvsp[0].ValueList->begin(), yyvsp[0].ValueList->end()); |
| for (unsigned i = 0, e = yyvsp[0].ValueList->size(); i != e && GTI != GTE; ++i, ++GTI) |
| if (isa<StructType>(*GTI)) // Only change struct indices |
| if (ConstantUInt *CUI = dyn_cast<ConstantUInt>((*yyvsp[0].ValueList)[i])) |
| if (CUI->getType() == Type::UByteTy) |
| (*yyvsp[0].ValueList)[i] = ConstantExpr::getCast(CUI, Type::UIntTy); |
| |
| if (!GetElementPtrInst::getIndexedType(*yyvsp[-2].TypeVal, *yyvsp[0].ValueList, true)) |
| ThrowException("Invalid getelementptr indices for type '" + |
| (*yyvsp[-2].TypeVal)->getDescription()+ "'!"); |
| yyval.InstVal = new GetElementPtrInst(getVal(*yyvsp[-2].TypeVal, yyvsp[-1].ValIDVal), *yyvsp[0].ValueList); |
| delete yyvsp[-2].TypeVal; delete yyvsp[0].ValueList; |
| ;} |
| break; |
| |
| |
| } |
| |
| /* Line 1010 of yacc.c. */ |
| #line 4354 "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) |
| { |
| YYSIZE_T yysize = 0; |
| int yytype = YYTRANSLATE (yychar); |
| const char* yyprefix; |
| char *yymsg; |
| int yyx; |
| |
| /* 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 = 0; |
| |
| yyprefix = ", expecting "; |
| for (yyx = yyxbegin; yyx < yyxend; ++yyx) |
| if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR) |
| { |
| yysize += yystrlen (yyprefix) + yystrlen (yytname [yyx]); |
| yycount += 1; |
| if (yycount == 5) |
| { |
| yysize = 0; |
| break; |
| } |
| } |
| yysize += (sizeof ("syntax error, unexpected ") |
| + yystrlen (yytname[yytype])); |
| yymsg = (char *) YYSTACK_ALLOC (yysize); |
| if (yymsg != 0) |
| { |
| char *yyp = yystpcpy (yymsg, "syntax error, unexpected "); |
| yyp = yystpcpy (yyp, yytname[yytype]); |
| |
| if (yycount < 5) |
| { |
| yyprefix = ", expecting "; |
| for (yyx = yyxbegin; yyx < yyxend; ++yyx) |
| if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR) |
| { |
| yyp = yystpcpy (yyp, yyprefix); |
| yyp = yystpcpy (yyp, yytname[yyx]); |
| yyprefix = " or "; |
| } |
| } |
| yyerror (yymsg); |
| YYSTACK_FREE (yymsg); |
| } |
| else |
| yyerror ("syntax error; also virtual memory exhausted"); |
| } |
| else |
| #endif /* YYERROR_VERBOSE */ |
| yyerror ("syntax error"); |
| } |
| |
| |
| |
| if (yyerrstatus == 3) |
| { |
| /* If just tried and failed to reuse lookahead token after an |
| error, discard it. */ |
| |
| if (yychar <= YYEOF) |
| { |
| /* If at end of input, pop the error token, |
| then the rest of the stack, then return failure. */ |
| if (yychar == YYEOF) |
| for (;;) |
| { |
| YYPOPSTACK; |
| if (yyssp == yyss) |
| YYABORT; |
| YYDSYMPRINTF ("Error: popping", yystos[*yyssp], yyvsp, yylsp); |
| yydestruct (yystos[*yyssp], yyvsp); |
| } |
| } |
| else |
| { |
| YYDSYMPRINTF ("Error: discarding", yytoken, &yylval, &yylloc); |
| yydestruct (yytoken, &yylval); |
| yychar = YYEMPTY; |
| |
| } |
| } |
| |
| /* Else will try to reuse lookahead token after shifting the error |
| token. */ |
| goto yyerrlab1; |
| |
| |
| /*---------------------------------------------------. |
| | yyerrorlab -- error raised explicitly by YYERROR. | |
| `---------------------------------------------------*/ |
| yyerrorlab: |
| |
| #ifdef __GNUC__ |
| /* Pacify GCC when the user code never invokes YYERROR and the label |
| yyerrorlab therefore never appears in user code. */ |
| if (0) |
| goto yyerrorlab; |
| #endif |
| |
| 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; |
| |
| YYDSYMPRINTF ("Error: popping", yystos[*yyssp], yyvsp, yylsp); |
| yydestruct (yystos[yystate], yyvsp); |
| YYPOPSTACK; |
| yystate = *yyssp; |
| YY_STACK_PRINT (yyss, yyssp); |
| } |
| |
| if (yyn == YYFINAL) |
| YYACCEPT; |
| |
| YYDPRINTF ((stderr, "Shifting error token, ")); |
| |
| *++yyvsp = yylval; |
| |
| |
| yystate = yyn; |
| goto yynewstate; |
| |
| |
| /*-------------------------------------. |
| | yyacceptlab -- YYACCEPT comes here. | |
| `-------------------------------------*/ |
| yyacceptlab: |
| yyresult = 0; |
| goto yyreturn; |
| |
| /*-----------------------------------. |
| | yyabortlab -- YYABORT comes here. | |
| `-----------------------------------*/ |
| yyabortlab: |
| yyresult = 1; |
| goto yyreturn; |
| |
| #ifndef yyoverflow |
| /*----------------------------------------------. |
| | yyoverflowlab -- parser overflow comes here. | |
| `----------------------------------------------*/ |
| yyoverflowlab: |
| yyerror ("parser stack overflow"); |
| yyresult = 2; |
| /* Fall through. */ |
| #endif |
| |
| yyreturn: |
| #ifndef yyoverflow |
| if (yyss != yyssa) |
| YYSTACK_FREE (yyss); |
| #endif |
| return yyresult; |
| } |
| |
| |
| #line 2276 "/usr/home/llvm/obj/../lib/AsmParser/llvmAsmParser.y" |
| |
| int yyerror(const char *ErrorMsg) { |
| std::string where |
| = std::string((CurFilename == "-") ? std::string("<stdin>") : CurFilename) |
| + ":" + utostr((unsigned) llvmAsmlineno) + ": "; |
| std::string errMsg = std::string(ErrorMsg) + "\n" + where + " while reading "; |
| if (yychar == YYEMPTY || yychar == 0) |
| errMsg += "end-of-file."; |
| else |
| errMsg += "token: '" + std::string(llvmAsmtext, llvmAsmleng) + "'"; |
| ThrowException(errMsg); |
| return 0; |
| } |
| |