diff options
| -rw-r--r-- | lib/AsmParser/Parser.cpp | 26 | ||||
| -rw-r--r-- | lib/AsmParser/ParserInternals.h | 7 | ||||
| -rw-r--r-- | lib/AsmParser/llvmAsmParser.cpp | 2420 | ||||
| -rw-r--r-- | lib/AsmParser/llvmAsmParser.y | 7 |
4 files changed, 19 insertions, 2441 deletions
diff --git a/lib/AsmParser/Parser.cpp b/lib/AsmParser/Parser.cpp index 57c831e9e1..626fe263ad 100644 --- a/lib/AsmParser/Parser.cpp +++ b/lib/AsmParser/Parser.cpp @@ -12,19 +12,19 @@ // The useful interface defined by this file... Parse an ascii file, and return // the internal representation in a nice slice'n'dice'able representation. // -Module *ParseAssemblyFile(const ToolCommandLine &Opts) throw (ParseException) { +Module *ParseAssemblyFile(const string &Filename) throw (ParseException) { FILE *F = stdin; - if (Opts.getInputFilename() != "-") - F = fopen(Opts.getInputFilename().c_str(), "r"); + if (Filename != "-") + F = fopen(Filename.c_str(), "r"); if (F == 0) { - throw ParseException(Opts, string("Could not open file '") + - Opts.getInputFilename() + "'"); + throw ParseException(Filename, string("Could not open file '") + + Filename + "'"); } // TODO: If this throws an exception, F is not closed. - Module *Result = RunVMAsmParser(Opts, F); + Module *Result = RunVMAsmParser(Filename, F); if (F != stdin) fclose(F); @@ -38,7 +38,7 @@ Module *ParseAssemblyFile(const ToolCommandLine &Opts) throw (ParseException) { for (unsigned i = 0; i < Errors.size(); i++) Message += Errors[i] + "\n"; - throw ParseException(Opts, Message); + throw ParseException(Filename, Message); } } return Result; @@ -50,14 +50,14 @@ Module *ParseAssemblyFile(const ToolCommandLine &Opts) throw (ParseException) { //===------------------------------------------------------------------------=== -ParseException::ParseException(const ToolCommandLine &opts, - const string &message, int lineNo, int colNo) - : Opts(opts), Message(message) { +ParseException::ParseException(const string &filename, const string &message, + int lineNo, int colNo) + : Filename(filename), Message(message) { LineNo = lineNo; ColumnNo = colNo; } ParseException::ParseException(const ParseException &E) - : Opts(E.Opts), Message(E.Message) { + : Filename(E.Filename), Message(E.Message) { LineNo = E.LineNo; ColumnNo = E.ColumnNo; } @@ -66,10 +66,10 @@ const string ParseException::getMessage() const { // Includes info from options string Result; char Buffer[10]; - if (Opts.getInputFilename() == "-") + if (Filename == "-") Result += "<stdin>"; else - Result += Opts.getInputFilename(); + Result += Filename; if (LineNo != -1) { sprintf(Buffer, "%d", LineNo); diff --git a/lib/AsmParser/ParserInternals.h b/lib/AsmParser/ParserInternals.h index d9f34440b8..5d97bc605d 100644 --- a/lib/AsmParser/ParserInternals.h +++ b/lib/AsmParser/ParserInternals.h @@ -18,7 +18,6 @@ #include "llvm/Method.h" #include "llvm/Type.h" #include "llvm/Assembly/Parser.h" -#include "llvm/Tools/CommandLine.h" #include "llvm/Tools/StringExtras.h" class Module; @@ -28,8 +27,8 @@ extern FILE *llvmAsmin; extern int llvmAsmlineno; // Globals exported by the parser... -extern const ToolCommandLine *CurOptions; -Module *RunVMAsmParser(const ToolCommandLine &Opts, FILE *F); +extern string CurFilename; +Module *RunVMAsmParser(const string &Filename, FILE *F); // ThrowException - Wrapper around the ParseException class that automatically @@ -40,7 +39,7 @@ Module *RunVMAsmParser(const ToolCommandLine &Opts, FILE *F); // static inline void ThrowException(const string &message) { // TODO: column number in exception - throw ParseException(*CurOptions, message, llvmAsmlineno); + throw ParseException(CurFilename, message, llvmAsmlineno); } // ValID - Represents a reference of a definition of some sort. This may either diff --git a/lib/AsmParser/llvmAsmParser.cpp b/lib/AsmParser/llvmAsmParser.cpp deleted file mode 100644 index 649759b768..0000000000 --- a/lib/AsmParser/llvmAsmParser.cpp +++ /dev/null @@ -1,2420 +0,0 @@ - -/* A Bison parser, made from llvmAsmParser.y - by GNU Bison version 1.28 */ - -#define YYBISON 1 /* Identify Bison output. */ - -#define yyparse llvmAsmparse -#define yylex llvmAsmlex -#define yyerror llvmAsmerror -#define yylval llvmAsmlval -#define yychar llvmAsmchar -#define yydebug llvmAsmdebug -#define yynerrs llvmAsmnerrs -#define ESINT64VAL 257 -#define EUINT64VAL 258 -#define SINTVAL 259 -#define UINTVAL 260 -#define FPVAL 261 -#define VOID 262 -#define BOOL 263 -#define SBYTE 264 -#define UBYTE 265 -#define SHORT 266 -#define USHORT 267 -#define INT 268 -#define UINT 269 -#define LONG 270 -#define ULONG 271 -#define FLOAT 272 -#define DOUBLE 273 -#define STRING 274 -#define TYPE 275 -#define LABEL 276 -#define VAR_ID 277 -#define LABELSTR 278 -#define STRINGCONSTANT 279 -#define IMPLEMENTATION 280 -#define TRUE 281 -#define FALSE 282 -#define BEGINTOK 283 -#define END 284 -#define DECLARE 285 -#define TO 286 -#define RET 287 -#define BR 288 -#define SWITCH 289 -#define NOT 290 -#define ADD 291 -#define SUB 292 -#define MUL 293 -#define DIV 294 -#define REM 295 -#define SETLE 296 -#define SETGE 297 -#define SETLT 298 -#define SETGT 299 -#define SETEQ 300 -#define SETNE 301 -#define MALLOC 302 -#define ALLOCA 303 -#define FREE 304 -#define LOAD 305 -#define STORE 306 -#define GETELEMENTPTR 307 -#define PHI 308 -#define CALL 309 -#define CAST 310 -#define SHL 311 -#define SHR 312 - -#line 13 "llvmAsmParser.y" - -#include "ParserInternals.h" -#include "llvm/BasicBlock.h" -#include "llvm/Method.h" -#include "llvm/SymbolTable.h" -#include "llvm/Module.h" -#include "llvm/Type.h" -#include "llvm/DerivedTypes.h" -#include "llvm/Assembly/Parser.h" -#include "llvm/ConstantPool.h" -#include "llvm/iTerminators.h" -#include "llvm/iMemory.h" -#include <list> -#include <utility> // Get definition of pair class -#include <algorithm> // Get definition of find_if -#include <stdio.h> // This embarasment is due to our flex lexer... - -int yyerror(const char *ErrorMsg); // Forward declarations to prevent "implicit -int yylex(); // declaration" of xxx warnings. -int yyparse(); - -static Module *ParserResult; -const ToolCommandLine *CurOptions = 0; - -// This contains info used when building the body of a method. It is destroyed -// when the method is completed. -// -typedef vector<Value *> ValueList; // Numbered defs -static void ResolveDefinitions(vector<ValueList> &LateResolvers); - -static struct PerModuleInfo { - Module *CurrentModule; - vector<ValueList> Values; // Module level numbered definitions - vector<ValueList> LateResolveValues; - - void ModuleDone() { - // If we could not resolve some blocks at parsing time (forward branches) - // resolve the branches now... - ResolveDefinitions(LateResolveValues); - - Values.clear(); // Clear out method local definitions - CurrentModule = 0; - } -} CurModule; - -static struct PerMethodInfo { - Method *CurrentMethod; // Pointer to current method being created - - vector<ValueList> Values; // Keep track of numbered definitions - vector<ValueList> LateResolveValues; - bool isDeclare; // Is this method a forward declararation? - - inline PerMethodInfo() { - CurrentMethod = 0; - isDeclare = false; - } - - inline ~PerMethodInfo() {} - - inline void MethodStart(Method *M) { - CurrentMethod = M; - } - - void MethodDone() { - // If we could not resolve some blocks at parsing time (forward branches) - // resolve the branches now... - ResolveDefinitions(LateResolveValues); - - Values.clear(); // Clear out method local definitions - CurrentMethod = 0; - isDeclare = false; - } -} CurMeth; // Info for the current method... - - -//===----------------------------------------------------------------------===// -// Code to handle definitions of all the types -//===----------------------------------------------------------------------===// - -static void InsertValue(Value *D, vector<ValueList> &ValueTab = CurMeth.Values) { - if (!D->hasName()) { // Is this a numbered definition? - unsigned type = D->getType()->getUniqueID(); - if (ValueTab.size() <= type) - ValueTab.resize(type+1, ValueList()); - //printf("Values[%d][%d] = %d\n", type, ValueTab[type].size(), D); - ValueTab[type].push_back(D); - } -} - -static Value *getVal(const Type *Type, ValID &D, - bool DoNotImprovise = false) { - switch (D.Type) { - case 0: { // Is it a numbered definition? - unsigned type = Type->getUniqueID(); - unsigned Num = (unsigned)D.Num; - - // Module constants occupy the lowest numbered slots... - if (type < CurModule.Values.size()) { - if (Num < CurModule.Values[type].size()) - return CurModule.Values[type][Num]; - - Num -= CurModule.Values[type].size(); - } - - // Make sure that our type is within bounds - if (CurMeth.Values.size() <= type) - break; - - // Check that the number is within bounds... - if (CurMeth.Values[type].size() <= Num) - break; - - return CurMeth.Values[type][Num]; - } - case 1: { // Is it a named definition? - string Name(D.Name); - SymbolTable *SymTab = 0; - if (CurMeth.CurrentMethod) - SymTab = CurMeth.CurrentMethod->getSymbolTable(); - Value *N = SymTab ? SymTab->lookup(Type, Name) : 0; - - if (N == 0) { - SymTab = CurModule.CurrentModule->getSymbolTable(); - if (SymTab) - N = SymTab->lookup(Type, Name); - if (N == 0) break; - } - - D.destroy(); // Free old strdup'd memory... - return N; - } - - case 2: // Is it a constant pool reference?? - case 3: // Is it an unsigned const pool reference? - case 4: // Is it a string const pool reference? - case 5:{ // Is it a floating point const pool reference? - ConstPoolVal *CPV = 0; - - // Check to make sure that "Type" is an integral type, and that our - // value will fit into the specified type... - switch (D.Type) { - case 2: - if (Type == Type::BoolTy) { // Special handling for boolean data - CPV = new ConstPoolBool(D.ConstPool64 != 0); - } else { - if (!ConstPoolSInt::isValueValidForType(Type, D.ConstPool64)) - ThrowException("Symbolic constant pool value '" + - itostr(D.ConstPool64) + "' is invalid for type '" + - Type->getName() + "'!"); - CPV = new ConstPoolSInt(Type, D.ConstPool64); - } - break; - case 3: - if (!ConstPoolUInt::isValueValidForType(Type, D.UConstPool64)) { - if (!ConstPoolSInt::isValueValidForType(Type, D.ConstPool64)) { - ThrowException("Integral constant pool reference is invalid!"); - } else { // This is really a signed reference. Transmogrify. - CPV = new ConstPoolSInt(Type, D.ConstPool64); - } - } else { - CPV = new ConstPoolUInt(Type, D.UConstPool64); - } - break; - case 4: - cerr << "FIXME: TODO: String constants [sbyte] not implemented yet!\n"; - abort(); - //CPV = new ConstPoolString(D.Name); - D.destroy(); // Free the string memory - break; - case 5: - if (!ConstPoolFP::isValueValidForType(Type, D.ConstPoolFP)) - ThrowException("FP constant invalid for type!!"); - else - CPV = new ConstPoolFP(Type, D.ConstPoolFP); - break; - } - assert(CPV && "How did we escape creating a constant??"); - - // Scan through the constant table and see if we already have loaded this - // constant. - // - ConstantPool &CP = CurMeth.CurrentMethod ? - CurMeth.CurrentMethod->getConstantPool() : - CurModule.CurrentModule->getConstantPool(); - ConstPoolVal *C = CP.find(CPV); // Already have this constant? - if (C) { - delete CPV; // Didn't need this after all, oh well. - return C; // Yup, we already have one, recycle it! - } - CP.insert(CPV); - - // Success, everything is kosher. Lets go! - return CPV; - } // End of case 2,3,4 - } // End of switch - - - // 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? - - // TODO: Attempt to coallecse nodes that are the same with previous ones. - Value *d = 0; - switch (Type->getPrimitiveID()) { - case Type::LabelTyID: d = new BBPlaceHolder(Type, D); break; - case Type::MethodTyID: - d = new MethPlaceHolder(Type, D); - InsertValue(d, CurModule.LateResolveValues); - return d; -//case Type::ClassTyID: d = new ClassPlaceHolder(Type, D); break; - default: d = new DefPlaceHolder(Type, D); break; - } - - assert(d != 0 && "How did we not make something?"); - InsertValue(d, CurMeth.LateResolveValues); - return d; -} - - -//===----------------------------------------------------------------------===// -// 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 (CurMeth.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(vector<ValueList> &LateResolvers) { - // Loop over LateResolveDefs fixing up stuff that couldn't be resolved - for (unsigned ty = 0; ty < LateResolvers.size(); ty++) { - while (!LateResolvers[ty].empty()) { - Value *V = LateResolvers[ty].back(); - LateResolvers[ty].pop_back(); - ValID &DID = getValIDFromPlaceHolder(V); - - Value *TheRealValue = getVal(Type::getUniqueIDType(ty), DID, true); - - if (TheRealValue == 0 && DID.Type == 1) - ThrowException("Reference to an invalid definition: '" +DID.getName() + - "' of type '" + V->getType()->getName() + "'"); - else if (TheRealValue == 0) - ThrowException("Reference to an invalid definition: #" +itostr(DID.Num)+ - " of type '" + V->getType()->getName() + "'"); - - V->replaceAllUsesWith(TheRealValue); - assert(V->use_empty()); - delete V; - } - } - - LateResolvers.clear(); -} - -// addConstValToConstantPool - This code is used to insert a constant into the -// current constant pool. This is designed to make maximal (but not more than -// possible) reuse (merging) of constants in the constant pool. This means that -// multiple references to %4, for example will all get merged. -// -static ConstPoolVal *addConstValToConstantPool(ConstPoolVal *C) { - vector<ValueList> &ValTab = CurMeth.CurrentMethod ? - CurMeth.Values : CurModule.Values; - ConstantPool &CP = CurMeth.CurrentMethod ? - CurMeth.CurrentMethod->getConstantPool() : - CurModule.CurrentModule->getConstantPool(); - - if (ConstPoolVal *CPV = CP.find(C)) { - // Constant already in constant pool. Try to merge the two constants - if (CPV->hasName() && !C->hasName()) { - // Merge the two values, we inherit the existing CPV's name. - // InsertValue requires that the value have no name to insert correctly - // (because we want to fill the slot this constant would have filled) - // - string Name = CPV->getName(); - CPV->setName(""); - InsertValue(CPV, ValTab); - CPV->setName(Name); - delete C; - return CPV; - } else if (!CPV->hasName() && C->hasName()) { - // If we have a name on this value and there isn't one in the const - // pool val already, propogate it. - // - CPV->setName(C->getName()); - delete C; // Sorry, you're toast - return CPV; - } else if (CPV->hasName() && C->hasName()) { - // Both values have distinct names. We cannot merge them. - CP.insert(C); - InsertValue(C, ValTab); - return C; - } else if (!CPV->hasName() && !C->hasName()) { - // Neither value has a name, trivially merge them. - InsertValue(CPV, ValTab); - delete C; - return CPV; - } - - assert(0 && "Not reached!"); - return 0; - } else { // No duplication of value. - CP.insert(C); - InsertValue(C, ValTab); - return C; - } -} - - -struct EqualsType { - const Type *T; - inline EqualsType(const Type *t) { T = t; } - inline bool operator()(const ConstPoolVal *CPV) const { - return static_cast<const ConstPoolType*>(CPV)->getValue() == T; - } -}; - - -// checkNewType - We have to be careful to add all types referenced by the -// program to the constant pool of the method or module. Because of this, we -// often want to check to make sure that types used are in the constant pool, -// and add them if they aren't. That's what this function does. -// -static const Type *checkNewType(const Type *Ty) { - ConstantPool &CP = CurMeth.CurrentMethod ? - CurMeth.CurrentMethod->getConstantPool() : - CurModule.CurrentModule->getConstantPool(); - - // TODO: This should use ConstantPool::ensureTypeAvailable - - // Get the type type plane... - ConstantPool::PlaneType &P = CP.getPlane(Type::TypeTy); - ConstantPool::PlaneType::const_iterator PI = find_if(P.begin(), P.end(), - EqualsType(Ty)); - if (PI == P.end()) { - vector<ValueList> &ValTab = CurMeth.CurrentMethod ? - CurMeth.Values : CurModule.Values; - ConstPoolVal *CPT = new ConstPoolType(Ty); - CP.insert(CPT); - InsertValue(CPT, ValTab); - } - return Ty; -} - - -//===----------------------------------------------------------------------===// -// RunVMAsmParser - Define an interface to this parser -//===----------------------------------------------------------------------===// -// -Module *RunVMAsmParser(const ToolCommandLine &Opts, FILE *F) { - llvmAsmin = F; - CurOptions = &Opts; - llvmAsmlineno = 1; // Reset the current line number... - - CurModule.CurrentModule = new Module(); // Allocate a new module to read - yyparse(); // Parse the file. - Module *Result = ParserResult; - CurOptions = 0; - llvmAsmin = stdin; // F is about to go away, don't use it anymore... - ParserResult = 0; - - return Result; -} - - -#line 387 "llvmAsmParser.y" -typedef union { - Module *ModuleVal; - Method *MethodVal; - MethodArgument *MethArgVal; - BasicBlock *BasicBlockVal; - TerminatorInst *TermInstVal; - Instruction *InstVal; - ConstPoolVal *ConstVal; - const Type *TypeVal; - - list<MethodArgument*> *MethodArgList; - list<Value*> *ValueList; - list<const Type*> *TypeList; - list<pair<Value*, BasicBlock*> > *PHIList; // Represent the RHS of PHI node - list<pair<ConstPoolVal*, BasicBlock*> > *JumpTable; - vector<ConstPoolVal*> *ConstVector; - - int64_t SInt64Val; - uint64_t UInt64Val; - int SIntVal; - unsigned UIntVal; - double FPVal; - - char *StrVal; // This memory is allocated by strdup! - ValID ValIDVal; // May contain memory allocated by strdup - - Instruction::UnaryOps UnaryOpVal; - Instruction::BinaryOps BinaryOpVal; - Instruction::TermOps TermOpVal; - Instruction::MemoryOps MemOpVal; - Instruction::OtherOps OtherOpVal; -} YYSTYPE; -#include <stdio.h> - -#ifndef __cplusplus -#ifndef __STDC__ -#define const -#endif -#endif - - - -#define YYFINAL 269 -#define YYFLAG -32768 -#define YYNTBASE 69 - -#define YYTRANSLATE(x) ((unsigned)(x) <= 312 ? yytranslate[x] : 110) - -static const 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, 66, - 67, 68, 2, 65, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 59, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 60, 2, 61, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 62, - 2, 2, 63, 2, 64, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 1, 3, 4, 5, 6, - 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, - 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, - 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, - 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, - 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, - 57, 58 -}; - -#if YYDEBUG != 0 -static const short yyprhs[] = { 0, - 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, - 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, - 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, - 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, - 80, 82, 84, 86, 88, 90, 92, 95, 96, 99, - 102, 105, 108, 111, 114, 117, 124, 130, 139, 147, - 154, 159, 163, 165, 169, 170, 172, 175, 178, 181, - 183, 184, 187, 191, 193, 195, 196, 202, 206, 209, - 210, 214, 216, 218, 220, 222, 224, 226, 228, 230, - 232, 234, 239, 243, 247, 253, 257, 260, 263, 265, - 269, 272, 275, 278, 282, 285, 286, 290, 293, 297, - 307, 317, 324, 330, 333, 340, 348, 351, 356, 358, - 359, 365, 369, 376, 382, 385, 392, 394, 397, 398, - 401, 407, 410, 416, 420, 425, 433 -}; - -static const short yyrhs[] = { 5, - 0, 6, 0, 3, 0, 4, 0, 9, 0, 10, - 0, 11, 0, 12, 0, 13, 0, 14, 0, 15, - 0, 16, 0, 17, 0, 18, 0, 19, 0, 20, - 0, 21, 0, 22, 0, 71, 0, 8, 0, 36, - 0, 37, 0, 38, 0, 39, 0, 40, 0, 41, - 0, 42, 0, 43, 0, 44, 0, 45, 0, 46, - 0, 47, 0, 57, 0, 58, 0, 16, 0, 14, - 0, 12, 0, 10, 0, 17, 0, 15, 0, 13, - 0, 11, 0, 76, 0, 77, 0, 18, 0, 19, - 0, 23, 59, 0, 0, 76, 70, 0, 77, 4, - 0, 9, 27, 0, 9, 28, 0, 79, 7, 0, - 20, 25, 0, 21, 71, 0, 60, 71, 61, 60, - 82, 61, 0, 60, 71, 61, 60, 61, 0, 60, - 4, 62, 71, 61, 60, 82, 61, 0, 60, 4, - 62, 71, 61, 60, 61, 0, 63, 97, 64, 63, - 82, 64, 0, 63, 64, 63, 64, 0, 82, 65, - 81, 0, 81, 0, 83, 80, 81, 0, 0, 85, - 0, 85, 92, 0, 85, 93, 0, 83, 26, 0, - 23, 0, 0, 71, 86, 0, 87, 65, 88, 0, - 87, 0, 88, 0, 0, 72, 25, 66, 89, 67, - 0, 90, 83, 29, 0, 98, 30, 0, 0, 31, - 94, 90, 0, 3, 0, 4, 0, 7, 0, 27, - 0, 28, 0, 25, 0, 69, 0, 23, 0, 95, - 0, 96, 0, 72, 66, 97, 67, 0, 72, 66, - 67, 0, 60, 71, 61, 0, 60, 4, 62, 71, - 61, 0, 63, 97, 64, 0, 63, 64, 0, 71, - 68, 0, 71, 0, 97, 65, 71, 0, 98, 99, - 0, 91, 99, 0, 100, 101, 0, 24, 100, 101, - 0, 100, 103, 0, 0, 33, 71, 96, 0, 33, - 8, 0, 34, 22, 96, 0, 34, 9, 96, 65, - 22, 96, 65, 22, 96, 0, 35, 78, 96, 65, - 22, 96, 60, 102, 61, 0, 102, 78, 95, 65, - 22, 96, 0, 78, 95, 65, 22, 96, 0, 80, - 107, 0, 71, 60, 96, 65, 96, 61, 0, 104, - 65, 60, 96, 65, 96, 61, 0, 71, 96, 0, - 105, 65, 71, 96, 0, 105, 0, 0, 74, 71, - 96, 65, 96, 0, 73, 71, 96, 0, 75, 71, - 96, 65, 71, 96, 0, 56, 71, 96, 32, 71, - 0, 54, 104, 0, 55, 71, 96, 66, 106, 67, - 0, 109, 0, 65, 82, 0, 0, 48, 71, 0, - 48, 71, 65, 15, 96, 0, 49, 71, 0, 49, - 71, 65, 15, 96, 0, 50, 71, 96, 0, 51, - 71, 96, 108, 0, 52, 71, 96, 65, 71, 96, - 108, 0, 53, 71, 96, 108, 0 -}; - -#endif - -#if YYDEBUG != 0 -static const short yyrline[] = { 0, - 486, 487, 494, 495, 506, 506, 506, 506, 506, 506, - 506, 507, 507, 507, 507, 507, 507, 507, 510, 510, - 515, 516, 516, 516, 516, 516, 517, 517, 517, 517, - 517, 517, 518, 518, 522, 522, 522, 522, 523, 523, - 523, 523, 524, 524, 525, 525, 528, 531, 538, 543, - 548, 551, 554, 557, 563, 566, 579, 583, 601, 608, - 616, 630, 633, 643, 660, 671, 678, 684, 690, 699, - 699, 701, 709, 713, 718, 721, 725, 766, 770, 774, - 774, 782, 785, 788, 791, 794, 797, 802, 805, 808, - 815, 823, 828, 832, 835, 838, 843, 846, 851, 855, - 860, 864, 873, 878, 887, 891, 895, 898, 901, 904, - 909, 920, 928, 938, 946, 951, 958, 962, 968, 968, - 970, 975, 980, 984, 987, 998, 1035, 1040, 1042, 1046, - 1049, 1056, 1059, 1067, 1073, 1082, 1094 -}; -#endif - - -#if YYDEBUG != 0 || defined (YYERROR_VERBOSE) - -static const char * const yytname[] = { "$","error","$undefined.","ESINT64VAL", -"EUINT64VAL","SINTVAL","UINTVAL","FPVAL","VOID","BOOL","SBYTE","UBYTE","SHORT", -"USHORT","INT","UINT","LONG","ULONG","FLOAT","DOUBLE","STRING","TYPE","LABEL", -"VAR_ID","LABELSTR","STRINGCONSTANT","IMPLEMENTATION","TRUE","FALSE","BEGINTOK", -"END","DECLARE","TO","RET","BR","SWITCH","NOT","ADD","SUB","MUL","DIV","REM", -"SETLE","SETGE","SETLT","SETGT","SETEQ","SETNE","MALLOC","ALLOCA","FREE","LOAD", -"STORE","GETELEMENTPTR","PHI","CALL","CAST","SHL","SHR","'='","'['","']'","'x'", -"'{'","'}'","','","'('","')'","'*'","INTVAL","EINT64VAL","Types","TypesV","UnaryOps", -"BinaryOps","ShiftOps","SIntType","UIntType","IntType","FPType","OptAssign", -"ConstVal","ConstVector","ConstPool","Module","MethodList","OptVAR_ID","ArgVal", -"ArgListH","ArgList","MethodHeaderH","MethodHeader","Method","MethodProto","@1", -"ConstValueRef","ValueRef","TypeList","BasicBlockList","BasicBlock","InstructionList", -"BBTerminatorInst","JumpTable","Inst","PHIList","ValueRefList","ValueRefListE", -"InstVal","UByteList","MemoryInst", NULL -}; -#endif - -static const short yyr1[] = { 0, - 69, 69, 70, 70, 71, 71, 71, 71, 71, 71, - 71, 71, 71, 71, 71, 71, 71, 71, 72, 72, - 73, 74, 74, 74, 74, 74, 74, 74, 74, 74, - 74, 74, 75, 75, 76, 76, 76, 76, 77, 77, - 77, 77, 78, 78, 79, 79, 80, 80, 81, 81, - 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, - 81, 82, 82, 83, 83, 84, 85, 85, 85, 86, - 86, 87, 88, 88, 89, 89, 90, 91, 92, 94, - 93, 95, 95, 95, 95, 95, 95, 96, 96, 96, - 71, 71, 71, 71, 71, 71, 71, 71, 97, 97, - 98, 98, 99, 99, 100, 100, 101, 101, 101, 101, - 101, 102, 102, 103, 104, 104, 105, 105, 106, 106, - 107, 107, 107, 107, 107, 107, 107, 108, 108, 109, - 109, 109, 109, 109, 109, 109, 109 -}; - -static const short yyr2[] = { 0, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 2, 0, 2, 2, - 2, 2, 2, 2, 2, 6, 5, 8, 7, 6, - 4, 3, 1, 3, 0, 1, 2, 2, 2, 1, - 0, 2, 3, 1, 1, 0, 5, 3, 2, 0, - 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 4, 3, 3, 5, 3, 2, 2, 1, 3, - 2, 2, 2, 3, 2, 0, 3, 2, 3, 9, - 9, 6, 5, 2, 6, 7, 2, 4, 1, 0, - 5, 3, 6, 5, 2, 6, 1, 2, 0, 2, - 5, 2, 5, 3, 4, 7, 4 -}; - -static const short yydefact[] = { 65, - 48, 66, 0, 69, 0, 82, 83, 1, 2, 84, - 20, 5, 6, 7, 8, 9, 10, 11, 12, 13, - 14, 15, 16, 17, 18, 89, 87, 85, 86, 80, - 0, 0, 88, 19, 0, 65, 106, 67, 68, 90, - 91, 106, 47, 0, 38, 42, 37, 41, 36, 40, - 35, 39, 45, 46, 0, 0, 0, 0, 0, 0, - 0, 64, 0, 83, 19, 0, 97, 99, 0, 98, - 0, 0, 48, 106, 102, 48, 79, 101, 51, 52, - 54, 55, 83, 19, 0, 0, 3, 4, 49, 50, - 53, 81, 0, 94, 96, 0, 76, 93, 0, 78, - 48, 0, 0, 0, 0, 103, 105, 0, 0, 0, - 0, 19, 100, 71, 74, 75, 0, 92, 104, 108, - 19, 0, 0, 43, 44, 0, 21, 22, 23, 24, - 25, 26, 27, 28, 29, 30, 31, 32, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 33, 34, 0, - 0, 0, 114, 127, 19, 0, 61, 0, 95, 70, - 72, 0, 77, 107, 0, 109, 0, 130, 132, 19, - 19, 19, 19, 19, 125, 19, 19, 19, 19, 19, - 0, 57, 63, 0, 0, 73, 0, 0, 0, 0, - 134, 129, 0, 129, 0, 0, 0, 0, 122, 0, - 0, 0, 56, 0, 60, 0, 0, 0, 0, 0, - 135, 0, 137, 0, 0, 120, 0, 0, 0, 59, - 0, 62, 0, 0, 131, 133, 128, 19, 0, 0, - 19, 119, 0, 124, 121, 19, 58, 0, 0, 129, - 0, 0, 117, 0, 126, 123, 0, 0, 0, 136, - 115, 0, 19, 110, 0, 111, 0, 116, 118, 0, - 0, 0, 0, 113, 0, 112, 0, 0, 0 -}; - -static const short yydefgoto[] = { 33, - 89, 68, 66, 150, 151, 152, 59, 60, 126, 61, - 5, 183, 184, 1, 267, 2, 161, 115, 116, 117, - 36, 37, 38, 39, 63, 40, 41, 69, 42, 75, - 76, 106, 249, 107, 175, 232, 233, 153, 211, 154 -}; - -static const short yypact[] = {-32768, - 2, 354, -36,-32768, 557,-32768,-32768,-32768,-32768,-32768, --32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, --32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, - 415, 266,-32768, -9, -16,-32768, 66,-32768,-32768,-32768, --32768, 46,-32768, 145,-32768,-32768,-32768,-32768,-32768,-32768, --32768,-32768,-32768,-32768, 68, 441, 502, 328, 191, 119, - 124,-32768, 441, 92, -3, 117,-32768, 37, 132,-32768, - 133, 240, 101,-32768,-32768, 64,-32768,-32768,-32768,-32768, --32768, 37, 144, 13, 148, 137,-32768,-32768,-32768,-32768, --32768,-32768, 441,-32768,-32768, 441, 441,-32768, 55,-32768, - 64, 528, 40, 165, 556,-32768,-32768, 441, 147, 149, - 153, 24, 37, 7, 143,-32768, 152,-32768,-32768, 146, - -1, 163, 163,-32768,-32768, 163,-32768,-32768,-32768,-32768, --32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 441, 441, - 441, 441, 441, 441, 441, 441, 441,-32768,-32768, 441, - 441, 441,-32768,-32768, 28, 23,-32768, 557,-32768,-32768, --32768, 441,-32768,-32768, 155,-32768, 157, 36, 87, -1, - -1, -1, -1, 20, 158, -1, -1, -1, -1, -1, - 164,-32768,-32768, 60, 140,-32768, 203, 204, 212, 213, --32768, 166, 167, 166, 163, 169, 168, 198,-32768, 170, - 171, 98,-32768, 557,-32768, 163, 163, 163, 163, 557, --32768, 441,-32768, 172, 163, 441, 441, 163, 441,-32768, - 128,-32768, 173, 179,-32768,-32768, 175, -1, 163, 176, - -1, 199, 223, 37,-32768, -1,-32768, 211, 165, 166, - 205, 163,-32768, 441,-32768,-32768, 163, 44, 3,-32768, --32768, 231, -1,-32768, 230,-32768, 44,-32768,-32768, 274, - 232, 163, 276,-32768, 163,-32768, 299, 301,-32768 -}; - -static const short yypgoto[] = {-32768, --32768, -2, 5,-32768,-32768,-32768, -93, -92, -186,-32768, - -55, -4, -150, 268,-32768,-32768,-32768,-32768, 150,-32768, - 239,-32768,-32768,-32768,-32768, -191, -44, -27,-32768, 263, - 234, 208,-32768,-32768,-32768,-32768,-32768,-32768, -184,-32768 -}; - - -#define YYLAST 620 - - -static const short yytable[] = { 34, - 62, 6, 7, 8, 9, 10, 35, 185, 71, 213, - 124, 125, 45, 46, 47, 48, 49, 50, 51, 52, - 105, 26, 43, 27, 3, 28, 29, 4, 65, 160, - 86, 44, 45, 46, 47, 48, 49, 50, 51, 52, - 53, 54, 55, 56, 99, 105, 6, 7, 122, 72, - 10, 221, 248, 82, 84, 250, 255, 94, 70, 227, - 34, 123, 257, 256, 70, 261, 70, 35, 27, 74, - 28, 29, -19, 109, 70, 77, 164, 165, 166, 195, - 70, 167, 57, 182, 159, 58, 3, 70, 181, 74, - 112, 70, 81, 113, 114, 70, 102, 103, 104, 121, - 189, -19, -19, 70, 70, 155, 44, 45, 46, 47, - 48, 49, 50, 51, 52, 53, 54, 55, 56, 96, - 203, 118, 90, 3, 204, 191, 192, 193, 194, 100, - 91, 197, 198, 199, 200, 201, 168, 169, 170, 171, - 172, 173, 174, 176, 177, 124, 125, 178, 179, 180, - 214, 190, -19, 93, 70, 124, 125, 57, 220, 114, - 58, 223, 224, 225, 226, 6, 7, 8, 9, 10, - 230, 79, 80, 235, 45, 46, 47, 48, 49, 50, - 51, 52, 72, 240, 241, 26, 243, 27, 237, 28, - 29, 246, 204, 87, 88, 95, 96, 252, 97, 222, - 111, 96, 254, 205, 204, 108, 156, 162, 259, 228, - 110, -20, 157, 231, 234, 158, 236, 264, 163, 187, - 266, 188, 196, 202, 206, 207, 208, 209, 215, 217, - 210, 212, 247, 216, 218, 219, 229, 238, 239, 204, - 242, 253, 6, 7, 8, 9, 10, 11, 12, 13, - 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, - 24, 25, 26, 244, 27, 251, 28, 29, 6, 7, - 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, - 18, 19, 20, 21, 22, 23, 24, 25, 26, 245, - 27, 258, 28, 29, 260, 262, 263, 265, 268, 31, - 269, 92, 32, 73, 78, 0, 98, 101, 119, 0, - 0, 186, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 31, 0, 0, 32, 67, - 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, - 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, - 26, 0, 27, 0, 28, 29, 6, 7, 8, 9, - 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, - 20, 21, 22, 23, 24, 25, 26, 0, 27, 0, - 28, 29, 0, 0, 30, 0, 0, 31, 0, 0, - 32, 85, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 0, 31, 0, 0, 32, 6, 64, 8, - 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, - 19, 20, 21, 22, 23, 24, 25, 26, 0, 27, - 0, 28, 29, 6, 7, 8, 9, 10, 11, 12, - 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, - 23, 24, 25, 26, 0, 27, 0, 28, 29, 0, - 0, 0, 0, 0, 31, 0, 0, 32, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, - 31, 0, 0, 32, 6, 83, 8, 9, 10, 11, - 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, - 22, 23, 24, 25, 26, 0, 27, 0, 28, 29, - 6, 7, 8, 9, 10, 120, 12, 13, 14, 15, - 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, - 26, 0, 27, 0, 28, 29, 0, 0, 0, 0, - 0, 31, 0, 0, 32, 44, 45, 46, 47, 48, - 49, 50, 51, 52, 53, 54, 55, 56, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 31, 0, 0, - 32, 127, 128, 129, 130, 131, 132, 133, 134, 135, - 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, - 146, 147, 148, 149, 0, 0, 57, 0, 0, 58 -}; - -static const short yycheck[] = { 2, - 5, 3, 4, 5, 6, 7, 2, 158, 25, 194, - 104, 104, 10, 11, 12, 13, 14, 15, 16, 17, - 76, 23, 59, 25, 23, 27, 28, 26, 31, 23, - 58, 9, 10, 11, 12, 13, 14, 15, 16, 17, - 18, 19, 20, 21, 72, 101, 3, 4, 9, 66, - 7, 202, 239, 56, 57, 240, 248, 61, 68, 210, - 63, 22, 249, 61, 68, 257, 68, 63, 25, 24, - 27, 28, 66, 61, 68, 30, 121, 122, 123, 60, - 68, 126, 60, 61, 61, 63, 23, 68, 61, 24, - 93, 68, 25, 96, 97, 68, 33, 34, 35, 102, - 65, 66, 66, 68, 68, 108, 9, 10, 11, 12, - 13, 14, 15, 16, 17, 18, 19, 20, 21, 65, - 61, 67, 4, 23, 65, 170, 171, 172, 173, 29, - 7, 176, 177, 178, 179, 180, 139, 140, 141, 142, - 143, 144, 145, 146, 147, 239, 239, 150, 151, 152, - 195, 65, 66, 62, 68, 249, 249, 60, 61, 162, - 63, 206, 207, 208, 209, 3, 4, 5, 6, 7, - 215, 27, 28, 218, 10, 11, 12, 13, 14, 15, - 16, 17, 66, 228, 229, 23, 231, 25, 61, 27, - 28, 236, 65, 3, 4, 64, 65, 242, 66, 204, - 64, 65, 247, 64, 65, 62, 60, 65, 253, 212, - 63, 66, 64, 216, 217, 63, 219, 262, 67, 65, - 265, 65, 65, 60, 22, 22, 15, 15, 60, 32, - 65, 65, 22, 66, 65, 65, 65, 65, 60, 65, - 65, 244, 3, 4, 5, 6, 7, 8, 9, 10, - 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, - 21, 22, 23, 65, 25, 61, 27, 28, 3, 4, - 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, - 15, 16, 17, 18, 19, 20, 21, 22, 23, 67, - 25, 61, 27, 28, 65, 22, 65, 22, 0, 60, - 0, 63, 63, 36, 42, -1, 67, 74, 101, -1, - -1, 162, -1, -1, -1, -1, -1, -1, -1, -1, - -1, -1, -1, -1, -1, 60, -1, -1, 63, 64, - 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, - 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, - 23, -1, 25, -1, 27, 28, 3, 4, 5, 6, - 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, - 17, 18, 19, 20, 21, 22, 23, -1, 25, -1, - 27, 28, -1, -1, 31, -1, -1, 60, -1, -1, - 63, 64, -1, -1, -1, -1, -1, -1, -1, -1, - -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, - -1, -1, -1, 60, -1, -1, 63, 3, 4, 5, - 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, - 16, 17, 18, 19, 20, 21, 22, 23, -1, 25, - -1, 27, 28, 3, 4, 5, 6, 7, 8, 9, - 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, - 20, 21, 22, 23, -1, 25, -1, 27, 28, -1, - -1, -1, -1, -1, 60, -1, -1, 63, -1, -1, - -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, - -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, - 60, -1, -1, 63, 3, 4, 5, 6, 7, 8, - 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, - 19, 20, 21, 22, 23, -1, 25, -1, 27, 28, - 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, - 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, - 23, -1, 25, -1, 27, 28, -1, -1, -1, -1, - -1, 60, -1, -1, 63, 9, 10, 11, 12, 13, - 14, 15, 16, 17, 18, 19, 20, 21, -1, -1, - -1, -1, -1, -1, -1, -1, -1, 60, -1, -1, - 63, 36, 37, 38, 39, 40, 41, 42, 43, 44, - 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, - 55, 56, 57, 58, -1, -1, 60, -1, -1, 63 -}; -/* -*-C-*- Note some compilers choke on comments on `#line' lines. */ -#line 3 "/usr/dcs/software/supported/encap/bison-1.28/share/bison.simple" -/* This file comes from bison-1.28. */ - -/* Skeleton output parser for bison, - Copyright (C) 1984, 1989, 1990 Free Software Foundation, Inc. - - This program is free software; you can redistribute it and/or modify - it under the terms of the GNU General Public License as published by - the Free Software Foundation; either version 2, or (at your option) - any later version. - - This program is distributed in the hope that it will be useful, - but WITHOUT ANY WARRANTY; without even the implied warranty of - MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - GNU General Public License for more details. - - You should have received a copy of the GNU General Public License - along with this program; if not, write to the Free Software - Foundation, Inc., 59 Temple Place - Suite 330, - Boston, MA 02111-1307, USA. */ - -/* As a special exception, when this file is copied by Bison into a - Bison output file, you may use that output file without restriction. - This special exception was added by the Free Software Foundation - in version 1.24 of Bison. */ - -/* This is the parser code that is written into each bison parser - when the %semantic_parser declaration is not specified in the grammar. - It was written by Richard Stallman by simplifying the hairy parser - used when %semantic_parser is specified. */ - -#ifndef YYSTACK_USE_ALLOCA -#ifdef alloca -#define YYSTACK_USE_ALLOCA -#else /* alloca not defined */ -#ifdef __GNUC__ -#define YYSTACK_USE_ALLOCA -#define alloca __builtin_alloca -#else /* not GNU C. */ -#if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi) || (defined (__sun) && defined (__i386)) -#define YYSTACK_USE_ALLOCA -#include <alloca.h> -#else /* not sparc */ -/* We think this test detects Watcom and Microsoft C. */ -/* This used to test MSDOS, but that is a bad idea - since that symbol is in the user namespace. */ -#if (defined (_MSDOS) || defined (_MSDOS_)) && !defined (__TURBOC__) -#if 0 /* No need for malloc.h, which pollutes the namespace; - instead, just don't use alloca. */ -#include <malloc.h> -#endif -#else /* not MSDOS, or __TURBOC__ */ -#if defined(_AIX) -/* I don't know what this was needed for, but it pollutes the namespace. - So I turned it off. rms, 2 May 1997. */ -/* #include <malloc.h> */ - #pragma alloca -#define YYSTACK_USE_ALLOCA -#else /* not MSDOS, or __TURBOC__, or _AIX */ -#if 0 -#ifdef __hpux /* haible@ilog.fr says this works for HPUX 9.05 and up, - and on HPUX 10. Eventually we can turn this on. */ -#define YYSTACK_USE_ALLOCA -#define alloca __builtin_alloca -#endif /* __hpux */ -#endif -#endif /* not _AIX */ -#endif /* not MSDOS, or __TURBOC__ */ -#endif /* not sparc */ -#endif /* not GNU C */ -#endif /* alloca not defined */ -#endif /* YYSTACK_USE_ALLOCA not defined */ - -#ifdef YYSTACK_USE_ALLOCA -#define YYSTACK_ALLOC alloca -#else -#define YYSTACK_ALLOC malloc -#endif - -/* Note: there must be only one dollar sign in this file. - It is replaced by the list of actions, each action - as one case of the switch. */ - -#define yyerrok (yyerrstatus = 0) -#define yyclearin (yychar = YYEMPTY) -#define YYEMPTY -2 -#define YYEOF 0 -#define YYACCEPT goto yyacceptlab -#define YYABORT goto yyabortlab -#define YYERROR goto yyerrlab1 -/* Like YYERROR except do call yyerror. - This remains here temporarily to ease the - transition to the new meaning of YYERROR, for GCC. - Once GCC version 2 has supplanted version 1, this can go. */ -#define YYFAIL goto yyerrlab -#define YYRECOVERING() (!!yyerrstatus) -#define YYBACKUP(token, value) \ -do \ - if (yychar == YYEMPTY && yylen == 1) \ - { yychar = (token), yylval = (value); \ - yychar1 = YYTRANSLATE (yychar); \ - YYPOPSTACK; \ - goto yybackup; \ - } \ - else \ - { yyerror ("syntax error: cannot back up"); YYERROR; } \ -while (0) - -#define YYTERROR 1 -#define YYERRCODE 256 - -#ifndef YYPURE -#define YYLEX yylex() -#endif - -#ifdef YYPURE -#ifdef YYLSP_NEEDED -#ifdef YYLEX_PARAM -#define YYLEX yylex(&yylval, &yylloc, YYLEX_PARAM) -#else -#define YYLEX yylex(&yylval, &yylloc) -#endif -#else /* not YYLSP_NEEDED */ -#ifdef YYLEX_PARAM -#define YYLEX yylex(&yylval, YYLEX_PARAM) -#else -#define YYLEX yylex(&yylval) -#endif -#endif /* not YYLSP_NEEDED */ -#endif - -/* If nonreentrant, generate the variables here */ - -#ifndef YYPURE - -int yychar; /* the lookahead symbol */ -YYSTYPE yylval; /* the semantic value of the */ - /* lookahead symbol */ - -#ifdef YYLSP_NEEDED -YYLTYPE yylloc; /* location data for the lookahead */ - /* symbol */ -#endif - -int yynerrs; /* number of parse errors so far */ -#endif /* not YYPURE */ - -#if YYDEBUG != 0 -int yydebug; /* nonzero means print parse trace */ -/* Since this is uninitialized, it does not stop multiple parsers - from coexisting. */ -#endif - -/* YYINITDEPTH indicates the initial size of the parser's stacks */ - -#ifndef YYINITDEPTH -#define YYINITDEPTH 200 -#endif - -/* YYMAXDEPTH is the maximum size the stacks can grow to - (effective only if the built-in stack extension method is used). */ - -#if YYMAXDEPTH == 0 -#undef YYMAXDEPTH -#endif - -#ifndef YYMAXDEPTH -#define YYMAXDEPTH 10000 -#endif - -/* Define __yy_memcpy. Note that the size argument - should be passed with type unsigned int, because that is what the non-GCC - definitions require. With GCC, __builtin_memcpy takes an arg - of type size_t, but it can handle unsigned int. */ - -#if __GNUC__ > 1 /* GNU C and GNU C++ define this. */ -#define __yy_memcpy(TO,FROM,COUNT) __builtin_memcpy(TO,FROM,COUNT) -#else /* not GNU C or C++ */ -#ifndef __cplusplus - -/* This is the most reliable way to avoid incompatibilities - in available built-in functions on various systems. */ -static void -__yy_memcpy (to, from, count) - char *to; - char *from; - unsigned int count; -{ - register char *f = from; - register char *t = to; - register int i = count; - - while (i-- > 0) - *t++ = *f++; -} - -#else /* __cplusplus */ - -/* This is the most reliable way to avoid incompatibilities - in available built-in functions on various systems. */ -static void -__yy_memcpy (char *to, char *from, unsigned int count) -{ - register char *t = to; - register char *f = from; - register int i = count; - - while (i-- > 0) - *t++ = *f++; -} - -#endif -#endif - -#line 217 "/usr/dcs/software/supported/encap/bison-1.28/share/bison.simple" - -/* The user can define YYPARSE_PARAM as the name of an argument to be passed - into yyparse. The argument should have type void *. - It should actually point to an object. - Grammar actions can access the variable by casting it - to the proper pointer type. */ - -#ifdef YYPARSE_PARAM -#ifdef __cplusplus -#define YYPARSE_PARAM_ARG void *YYPARSE_PARAM -#define YYPARSE_PARAM_DECL -#else /* not __cplusplus */ -#define YYPARSE_PARAM_ARG YYPARSE_PARAM -#define YYPARSE_PARAM_DECL void *YYPARSE_PARAM; -#endif /* not __cplusplus */ -#else /* not YYPARSE_PARAM */ -#define YYPARSE_PARAM_ARG -#define YYPARSE_PARAM_DECL -#endif /* not YYPARSE_PARAM */ - -/* Prevent warning if -Wstrict-prototypes. */ -#ifdef __GNUC__ -#ifdef YYPARSE_PARAM -int yyparse (void *); -#else -int yyparse (void); -#endif -#endif - -int -yyparse(YYPARSE_PARAM_ARG) - YYPARSE_PARAM_DECL -{ - register int yystate; - register int yyn; - register short *yyssp; - register YYSTYPE *yyvsp; - int yyerrstatus; /* number of tokens to shift before error messages enabled */ - int yychar1 = 0; /* lookahead token as an internal (translated) token number */ - - short yyssa[YYINITDEPTH]; /* the state stack */ - YYSTYPE yyvsa[YYINITDEPTH]; /* the semantic value stack */ - - short *yyss = yyssa; /* refer to the stacks thru separate pointers */ - YYSTYPE *yyvs = yyvsa; /* to allow yyoverflow to reallocate them elsewhere */ - -#ifdef YYLSP_NEEDED - YYLTYPE yylsa[YYINITDEPTH]; /* the location stack */ - YYLTYPE *yyls = yylsa; - YYLTYPE *yylsp; - -#define YYPOPSTACK (yyvsp--, yyssp--, yylsp--) -#else -#define YYPOPSTACK (yyvsp--, yyssp--) -#endif - - int yystacksize = YYINITDEPTH; - int yyfree_stacks = 0; - -#ifdef YYPURE - int yychar; - YYSTYPE yylval; - int yynerrs; -#ifdef YYLSP_NEEDED - YYLTYPE yylloc; -#endif -#endif - - YYSTYPE yyval; /* the variable used to return */ - /* semantic values from the action */ - /* routines */ - - int yylen; - -#if YYDEBUG != 0 - if (yydebug) - fprintf(stderr, "Starting parse\n"); -#endif - - yystate = 0; - yyerrstatus = 0; - yynerrs = 0; - yychar = YYEMPTY; /* Cause a token to be read. */ - - /* Initialize stack pointers. - Waste one element of value and location stack - so that they stay on the same level as the state stack. - The wasted elements are never initialized. */ - - yyssp = yyss - 1; - yyvsp = yyvs; -#ifdef YYLSP_NEEDED - yylsp = yyls; -#endif - -/* Push a new state, which is found in yystate . */ -/* In all cases, when you get here, the value and location stacks - have just been pushed. so pushing a state here evens the stacks. */ -yynewstate: - - *++yyssp = yystate; - - if (yyssp >= yyss + yystacksize - 1) - { - /* Give user a chance to reallocate the stack */ - /* Use copies of these so that the &'s don't force the real ones into memory. */ - YYSTYPE *yyvs1 = yyvs; - short *yyss1 = yyss; -#ifdef YYLSP_NEEDED - YYLTYPE *yyls1 = yyls; -#endif - - /* Get the current used size of the three stacks, in elements. */ - int size = yyssp - yyss + 1; - -#ifdef yyoverflow - /* Each stack pointer address is followed by the size of - the data in use in that stack, in bytes. */ -#ifdef YYLSP_NEEDED - /* This used to be a conditional around just the two extra args, - but that might be undefined if yyoverflow is a macro. */ - yyoverflow("parser stack overflow", - &yyss1, size * sizeof (*yyssp), - &yyvs1, size * sizeof (*yyvsp), - &yyls1, size * sizeof (*yylsp), - &yystacksize); -#else - yyoverflow("parser stack overflow", - &yyss1, size * sizeof (*yyssp), - &yyvs1, size * sizeof (*yyvsp), - &yystacksize); -#endif - - yyss = yyss1; yyvs = yyvs1; -#ifdef YYLSP_NEEDED - yyls = yyls1; -#endif -#else /* no yyoverflow */ - /* Extend the stack our own way. */ - if (yystacksize >= YYMAXDEPTH) - { - yyerror("parser stack overflow"); - if (yyfree_stacks) - { - free (yyss); - free (yyvs); -#ifdef YYLSP_NEEDED - free (yyls); -#endif - } - return 2; - } - yystacksize *= 2; - if (yystacksize > YYMAXDEPTH) - yystacksize = YYMAXDEPTH; -#ifndef YYSTACK_USE_ALLOCA - yyfree_stacks = 1; -#endif - yyss = (short *) YYSTACK_ALLOC (yystacksize * sizeof (*yyssp)); - __yy_memcpy ((char *)yyss, (char *)yyss1, - size * (unsigned int) sizeof (*yyssp)); - yyvs = (YYSTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yyvsp)); - __yy_memcpy ((char *)yyvs, (char *)yyvs1, - size * (unsigned int) sizeof (*yyvsp)); -#ifdef YYLSP_NEEDED - yyls = (YYLTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yylsp)); - __yy_memcpy ((char *)yyls, (char *)yyls1, - size * (unsigned int) sizeof (*yylsp)); -#endif -#endif /* no yyoverflow */ - - yyssp = yyss + size - 1; - yyvsp = yyvs + size - 1; -#ifdef YYLSP_NEEDED - yylsp = yyls + size - 1; -#endif - -#if YYDEBUG != 0 - if (yydebug) - fprintf(stderr, "Stack size increased to %d\n", yystacksize); -#endif - - if (yyssp >= yyss + yystacksize - 1) - YYABORT; - } - -#if YYDEBUG != 0 - if (yydebug) - fprintf(stderr, "Entering state %d\n", yystate); -#endif - - goto yybackup; - yybackup: - -/* Do appropriate processing given the current state. */ -/* Read a lookahead token if we need one and don't already have one. */ -/* yyresume: */ - - /* First try to decide what to do without reference to lookahead token. */ - - yyn = yypact[yystate]; - if (yyn == YYFLAG) - goto yydefault; - - /* Not known => get a lookahead token if don't already have one. */ - - /* yychar is either YYEMPTY or YYEOF - or a valid token in external form. */ - - if (yychar == YYEMPTY) - { -#if YYDEBUG != 0 - if (yydebug) - fprintf(stderr, "Reading a token: "); -#endif - yychar = YYLEX; - } - - /* Convert token to internal form (in yychar1) for indexing tables with */ - - if (yychar <= 0) /* This means end of input. */ - { - yychar1 = 0; - yychar = YYEOF; /* Don't call YYLEX any more */ - -#if YYDEBUG != 0 - if (yydebug) - fprintf(stderr, "Now at end of input.\n"); -#endif - } - else - { - yychar1 = YYTRANSLATE(yychar); - -#if YYDEBUG != 0 - if (yydebug) - { - fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]); - /* Give the individual parser a way to print the precise meaning - of a token, for further debugging info. */ -#ifdef YYPRINT - YYPRINT (stderr, yychar, yylval); -#endif - fprintf (stderr, ")\n"); - } -#endif - } - - yyn += yychar1; - if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1) - goto yydefault; - - yyn = yytable[yyn]; - - /* yyn is what to do for this token type in this state. - Negative => reduce, -yyn is rule number. - Positive => shift, yyn is new state. - New state is final state => don't bother to shift, - just return success. - 0, or most negative number => error. */ - - if (yyn < 0) - { - if (yyn == YYFLAG) - goto yyerrlab; - yyn = -yyn; - goto yyreduce; - } - else if (yyn == 0) - goto yyerrlab; - - if (yyn == YYFINAL) - YYACCEPT; - - /* Shift the lookahead token. */ - -#if YYDEBUG != 0 - if (yydebug) - fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]); -#endif - - /* Discard the token being shifted unless it is eof. */ - if (yychar != YYEOF) - yychar = YYEMPTY; - - *++yyvsp = yylval; -#ifdef YYLSP_NEEDED - *++yylsp = yylloc; -#endif - - /* count tokens shifted since error; after three, turn off error status. */ - if (yyerrstatus) yyerrstatus--; - - yystate = yyn; - goto yynewstate; - -/* Do the default action for the current state. */ -yydefault: - - yyn = yydefact[yystate]; - if (yyn == 0) - goto yyerrlab; - -/* Do a reduction. yyn is the number of a rule to reduce with. */ -yyreduce: - yylen = yyr2[yyn]; - if (yylen > 0) - yyval = yyvsp[1-yylen]; /* implement default value of the action */ - -#if YYDEBUG != 0 - if (yydebug) - { - int i; - - fprintf (stderr, "Reducing via rule %d (line %d), ", - yyn, yyrline[yyn]); - - /* Print the symbols being reduced, and their result. */ - for (i = yyprhs[yyn]; yyrhs[i] > 0; i++) - fprintf (stderr, "%s ", yytname[yyrhs[i]]); - fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]); - } -#endif - - - switch (yyn) { - -case 2: -#line 487 "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 4: -#line 495 "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 47: -#line 528 "llvmAsmParser.y" -{ - yyval.StrVal = yyvsp[-1].StrVal; - ; - break;} -case 48: -#line 531 "llvmAsmParser.y" -{ - yyval.StrVal = 0; - ; - break;} -case 49: -#line 538 "llvmAsmParser.y" -{ // integral constants - if (!ConstPoolSInt::isValueValidForType(yyvsp[-1].TypeVal, yyvsp[0].SInt64Val)) - ThrowException("Constant value doesn't fit in type!"); - yyval.ConstVal = new ConstPoolSInt(yyvsp[-1].TypeVal, yyvsp[0].SInt64Val); - ; - break;} -case 50: -#line 543 "llvmAsmParser.y" -{ // integral constants - if (!ConstPoolUInt::isValueValidForType(yyvsp[-1].TypeVal, yyvsp[0].UInt64Val)) - ThrowException("Constant value doesn't fit in type!"); - yyval.ConstVal = new ConstPoolUInt(yyvsp[-1].TypeVal, yyvsp[0].UInt64Val); - ; - break;} -case 51: -#line 548 "llvmAsmParser.y" -{ // Boolean constants - yyval.ConstVal = new ConstPoolBool(true); - ; - break;} -case 52: -#line 551 "llvmAsmParser.y" -{ // Boolean constants - yyval.ConstVal = new ConstPoolBool(false); - ; - break;} -case 53: -#line 554 "llvmAsmParser.y" -{ // Float & Double constants - yyval.ConstVal = new ConstPoolFP(yyvsp[-1].TypeVal, yyvsp[0].FPVal); - ; - break;} -case 54: -#line 557 "llvmAsmParser.y" -{ // String constants - cerr << "FIXME: TODO: String constants [sbyte] not implemented yet!\n"; - abort(); - //$$ = new ConstPoolString($2); - free(yyvsp[0].StrVal); - ; - break;} -case 55: -#line 563 "llvmAsmParser.y" -{ // Type constants - yyval.ConstVal = new ConstPoolType(yyvsp[0].TypeVal); - ; - break;} -case 56: -#line 566 "llvmAsmParser.y" -{ // Nonempty array constant - // Verify all elements are correct type! - const ArrayType *AT = ArrayType::getArrayType(yyvsp[-4].TypeVal); - for (unsigned i = 0; i < yyvsp[-1].ConstVector->size(); i++) { - if (yyvsp[-4].TypeVal != (*yyvsp[-1].ConstVector)[i]->getType()) - ThrowException("Element #" + utostr(i) + " is not of type '" + - yyvsp[-4].TypeVal->getName() + "' as required!\nIt is of type '" + - (*yyvsp[-1].ConstVector)[i]->getType()->getName() + "'."); - } - - yyval.ConstVal = new ConstPoolArray(AT, *yyvsp[-1].ConstVector); - delete yyvsp[-1].ConstVector; - ; - break;} -case 57: -#line 579 "llvmAsmParser.y" -{ // Empty array constant - vector<ConstPoolVal*> Empty; - yyval.ConstVal = new ConstPoolArray(ArrayType::getArrayType(yyvsp[-3].TypeVal), Empty); - ; - break;} -case 58: -#line 583 "llvmAsmParser.y" -{ - // Verify all elements are correct type! - const ArrayType *AT = ArrayType::getArrayType(yyvsp[-4].TypeVal, (int)yyvsp[-6].UInt64Val); - if (yyvsp[-6].UInt64Val != yyvsp[-1].ConstVector->size()) - ThrowException("Type mismatch: constant sized array initialized with " + - utostr(yyvsp[-1].ConstVector->size()) + " arguments, but has size of " + - itostr((int)yyvsp[-6].UInt64Val) + "!"); - - for (unsigned i = 0; i < yyvsp[-1].ConstVector->size(); i++) { - if (yyvsp[-4].TypeVal != (*yyvsp[-1].ConstVector)[i]->getType()) - ThrowException("Element #" + utostr(i) + " is not of type '" + - yyvsp[-4].TypeVal->getName() + "' as required!\nIt is of type '" + - (*yyvsp[-1].ConstVector)[i]->getType()->getName() + "'."); - } - - yyval.ConstVal = new ConstPoolArray(AT, *yyvsp[-1].ConstVector); - delete yyvsp[-1].ConstVector; - ; - break;} -case 59: -#line 601 "llvmAsmParser.y" -{ - if (yyvsp[-5].UInt64Val != 0) - ThrowException("Type mismatch: constant sized array initialized with 0" - " arguments, but has size of " + itostr((int)yyvsp[-5].UInt64Val) + "!"); - vector<ConstPoolVal*> Empty; - yyval.ConstVal = new ConstPoolArray(ArrayType::getArrayType(yyvsp[-3].TypeVal, 0), Empty); - ; - break;} -case 60: -#line 608 "llvmAsmParser.y" -{ - StructType::ElementTypes Types(yyvsp[-4].TypeList->begin(), yyvsp[-4].TypeList->end()); - delete yyvsp[-4].TypeList; - - const StructType *St = StructType::getStructType(Types); - yyval.ConstVal = new ConstPoolStruct(St, *yyvsp[-1].ConstVector); - delete yyvsp[-1].ConstVector; - ; - break;} -case 61: -#line 616 "llvmAsmParser.y" -{ - const StructType *St = - StructType::getStructType(StructType::ElementTypes()); - vector<ConstPoolVal*> Empty; - yyval.ConstVal = new ConstPoolStruct(St, Empty); - ; - break;} -case 62: -#line 630 "llvmAsmParser.y" -{ - (yyval.ConstVector = yyvsp[-2].ConstVector)->push_back(addConstValToConstantPool(yyvsp[0].ConstVal)); - ; - break;} -case 63: -#line 633 "llvmAsmParser.y" -{ - yyval.ConstVector = new vector<ConstPoolVal*>(); - yyval.ConstVector->push_back(addConstValToConstantPool(yyvsp[0].ConstVal)); - ; - break;} -case 64: -#line 643 "llvmAsmParser.y" -{ - if (yyvsp[-1].StrVal) { - yyvsp[0].ConstVal->setName(yyvsp[-1].StrVal); - free(yyvsp[-1].StrVal); - } - - addConstValToConstantPool(yyvsp[0].ConstVal); - ; - break;} -case 65: -#line 660 "llvmAsmParser.y" -{ - ; - break;} -case 66: -#line 671 "llvmAsmParser.y" -{ - yyval.ModuleVal = ParserResult = yyvsp[0].ModuleVal; - CurModule.ModuleDone(); -; - break;} -case 67: -#line 678 "llvmAsmParser.y" -{ - yyval.ModuleVal = yyvsp[-1].ModuleVal; - if (!yyvsp[0].MethodVal->getParent()) - yyvsp[-1].ModuleVal->getMethodList().push_back(yyvsp[0].MethodVal); - CurMeth.MethodDone(); - ; - break;} -case 68: -#line 684 "llvmAsmParser.y" -{ - yyval.ModuleVal = yyvsp[-1].ModuleVal; - if (!yyvsp[0].MethodVal->getParent()) - yyvsp[-1].ModuleVal->getMethodList().push_back(yyvsp[0].MethodVal); - CurMeth.MethodDone(); - ; - break;} -case 69: -#line 690 "llvmAsmParser.y" -{ - yyval.ModuleVal = CurModule.CurrentModule; - ; - break;} -case 71: -#line 699 "llvmAsmParser.y" -{ yyval.StrVal = 0; ; - break;} -case 72: -#line 701 "llvmAsmParser.y" -{ - yyval.MethArgVal = new MethodArgument(yyvsp[-1].TypeVal); - if (yyvsp[0].StrVal) { // Was the argument named? - yyval.MethArgVal->setName(yyvsp[0].StrVal); - free(yyvsp[0].StrVal); // The string was strdup'd, so free it now. - } -; - break;} -case 73: -#line 709 "llvmAsmParser.y" -{ - yyval.MethodArgList = yyvsp[0].MethodArgList; - yyvsp[0].MethodArgList->push_front(yyvsp[-2].MethArgVal); - ; - break;} -case 74: -#line 713 "llvmAsmParser.y" -{ - yyval.MethodArgList = new list<MethodArgument*>(); - yyval.MethodArgList->push_front(yyvsp[0].MethArgVal); - ; - break;} -case 75: -#line 718 "llvmAsmParser.y" -{ - yyval.MethodArgList = yyvsp[0].MethodArgList; - ; - break;} -case 76: -#line 721 "llvmAsmParser.y" -{ - yyval.MethodArgList = 0; - ; - break;} -case 77: -#line 725 "llvmAsmParser.y" -{ - MethodType::ParamTypes ParamTypeList; - if (yyvsp[-1].MethodArgList) - for (list<MethodArgument*>::iterator I = yyvsp[-1].MethodArgList->begin(); I != yyvsp[-1].MethodArgList->end(); ++I) - ParamTypeList.push_back((*I)->getType()); - - const MethodType *MT = MethodType::getMethodType(yyvsp[-4].TypeVal, ParamTypeList); - - Method *M = 0; - if (SymbolTable *ST = CurModule.CurrentModule->getSymbolTable()) { - if (Value *V = ST->lookup(MT, yyvsp[-3].StrVal)) { // Method already in symtab? - M = V->castMethodAsserting(); - - // Yes it is. If this is the case, either we need to be a forward decl, - // or it needs to be. - if (!CurMeth.isDeclare && !M->isExternal()) - ThrowException("Redefinition of method '" + string(yyvsp[-3].StrVal) + "'!"); - } - } - - if (M == 0) { // Not already defined? - M = new Method(MT, yyvsp[-3].StrVal); - InsertValue(M, CurModule.Values); - } - - free(yyvsp[-3].StrVal); // Free strdup'd memory! - - CurMeth.MethodStart(M); - - // Add all of the arguments we parsed to the method... - if (yyvsp[-1].MethodArgList && !CurMeth.isDeclare) { // Is null if empty... - Method::ArgumentListType &ArgList = M->getArgumentList(); - - for (list<MethodArgument*>::iterator I = yyvsp[-1].MethodArgList->begin(); I != yyvsp[-1].MethodArgList->end(); ++I) { - InsertValue(*I); - ArgList.push_back(*I); - } - delete yyvsp[-1].MethodArgList; // We're now done with the argument list - } -; - break;} -case 78: -#line 766 "llvmAsmParser.y" -{ - yyval.MethodVal = CurMeth.CurrentMethod; -; - break;} -case 79: -#line 770 "llvmAsmParser.y" -{ - yyval.MethodVal = yyvsp[-1].MethodVal; -; - break;} -case 80: -#line 774 "llvmAsmParser.y" -{ CurMeth.isDeclare = true; ; - break;} -case 81: -#line 774 "llvmAsmParser.y" -{ - yyval.MethodVal = CurMeth.CurrentMethod; -; - break;} -case 82: -#line 782 "llvmAsmParser.y" -{ // A reference to a direct constant - yyval.ValIDVal = ValID::create(yyvsp[0].SInt64Val); - ; - break;} -case 83: -#line 785 "llvmAsmParser.y" -{ - yyval.ValIDVal = ValID::create(yyvsp[0].UInt64Val); - ; - break;} -case 84: -#line 788 "llvmAsmParser.y" -{ // Perhaps it's an FP constant? - yyval.ValIDVal = ValID::create(yyvsp[0].FPVal); - ; - break;} -case 85: -#line 791 "llvmAsmParser.y" -{ - yyval.ValIDVal = ValID::create((int64_t)1); - ; - break;} -case 86: -#line 794 "llvmAsmParser.y" -{ - yyval.ValIDVal = ValID::create((int64_t)0); - ; - break;} -case 87: -#line 797 "llvmAsmParser.y" -{ // Quoted strings work too... especially for methods - yyval.ValIDVal = ValID::create_conststr(yyvsp[0].StrVal); - ; - break;} -case 88: -#line 802 "llvmAsmParser.y" -{ // Is it an integer reference...? - yyval.ValIDVal = ValID::create(yyvsp[0].SIntVal); - ; - break;} -case 89: -#line 805 "llvmAsmParser.y" -{ // Is it a named reference...? - yyval.ValIDVal = ValID::create(yyvsp[0].StrVal); - ; - break;} -case 90: -#line 808 "llvmAsmParser.y" -{ - yyval.ValIDVal = yyvsp[0].ValIDVal; - ; - break;} -case 91: -#line 815 "llvmAsmParser.y" -{ - Value *D = getVal(Type::TypeTy, yyvsp[0].ValIDVal, true); - if (D == 0) ThrowException("Invalid user defined type: " + yyvsp[0].ValIDVal.getName()); - - // User defined type not in const pool! - ConstPoolType *CPT = (ConstPoolType*)D->castConstantAsserting(); - yyval.TypeVal = CPT->getValue(); - ; - break;} -case 92: -#line 823 "llvmAsmParser.y" -{ // Method derived type? - MethodType::ParamTypes Params(yyvsp[-1].TypeList->begin(), yyvsp[-1].TypeList->end()); - delete yyvsp[-1].TypeList; - yyval.TypeVal = checkNewType(MethodType::getMethodType(yyvsp[-3].TypeVal, Params)); - ; - break;} -case 93: -#line 828 "llvmAsmParser.y" -{ // Method derived type? - MethodType::ParamTypes Params; // Empty list - yyval.TypeVal = checkNewType(MethodType::getMethodType(yyvsp[-2].TypeVal, Params)); - ; - break;} -case 94: -#line 832 "llvmAsmParser.y" -{ - yyval.TypeVal = checkNewType(ArrayType::getArrayType(yyvsp[-1].TypeVal)); - ; - break;} -case 95: -#line 835 "llvmAsmParser.y" -{ - yyval.TypeVal = checkNewType(ArrayType::getArrayType(yyvsp[-1].TypeVal, (int)yyvsp[-3].UInt64Val)); - ; - break;} -case 96: -#line 838 "llvmAsmParser.y" -{ - StructType::ElementTypes Elements(yyvsp[-1].TypeList->begin(), yyvsp[-1].TypeList->end()); - delete yyvsp[-1].TypeList; - yyval.TypeVal = checkNewType(StructType::getStructType(Elements)); - ; - break;} -case 97: -#line 843 "llvmAsmParser.y" -{ - yyval.TypeVal = checkNewType(StructType::getStructType(StructType::ElementTypes())); - ; - break;} -case 98: -#line 846 "llvmAsmParser.y" -{ - yyval.TypeVal = checkNewType(PointerType::getPointerType(yyvsp[-1].TypeVal)); - ; - break;} -case 99: -#line 851 "llvmAsmParser.y" -{ - yyval.TypeList = new list<const Type*>(); - yyval.TypeList->push_back(yyvsp[0].TypeVal); - ; - break;} -case 100: -#line 855 "llvmAsmParser.y" -{ - (yyval.TypeList=yyvsp[-2].TypeList)->push_back(yyvsp[0].TypeVal); - ; - break;} -case 101: -#line 860 "llvmAsmParser.y" -{ - yyvsp[-1].MethodVal->getBasicBlocks().push_back(yyvsp[0].BasicBlockVal); - yyval.MethodVal = yyvsp[-1].MethodVal; - ; - break;} -case 102: -#line 864 "llvmAsmParser.y" -{ // Do not allow methods with 0 basic blocks - yyval.MethodVal = yyvsp[-1].MethodVal; // in them... - yyvsp[-1].MethodVal->getBasicBlocks().push_back(yyvsp[0].BasicBlockVal); - ; - break;} -case 103: -#line 873 "llvmAsmParser.y" -{ - yyvsp[-1].BasicBlockVal->getInstList().push_back(yyvsp[0].TermInstVal); - InsertValue(yyvsp[-1].BasicBlockVal); - yyval.BasicBlockVal = yyvsp[-1].BasicBlockVal; - ; - break;} -case 104: -#line 878 "llvmAsmParser.y" -{ - yyvsp[-1].BasicBlockVal->getInstList().push_back(yyvsp[0].TermInstVal); - yyvsp[-1].BasicBlockVal->setName(yyvsp[-2].StrVal); - free(yyvsp[-2].StrVal); // Free the strdup'd memory... - - InsertValue(yyvsp[-1].BasicBlockVal); - yyval.BasicBlockVal = yyvsp[-1].BasicBlockVal; - ; - break;} -case 105: -#line 887 "llvmAsmParser.y" -{ - yyvsp[-1].BasicBlockVal->getInstList().push_back(yyvsp[0].InstVal); - yyval.BasicBlockVal = yyvsp[-1].BasicBlockVal; - ; - break;} -case 106: -#line 891 "llvmAsmParser.y" -{ - yyval.BasicBlockVal = new BasicBlock(); - ; - break;} -case 107: -#line 895 "llvmAsmParser.y" -{ // Return with a result... - yyval.TermInstVal = new ReturnInst(getVal(yyvsp[-1].TypeVal, yyvsp[0].ValIDVal)); - ; - break;} -case 108: -#line 898 "llvmAsmParser.y" -{ // Return with no result... - yyval.TermInstVal = new ReturnInst(); - ; - break;} -case 109: -#line 901 "llvmAsmParser.y" -{ // Unconditional Branch... - yyval.TermInstVal = new BranchInst((BasicBlock*)getVal(Type::LabelTy, yyvsp[0].ValIDVal)); - ; - break;} -case 110: -#line 904 "llvmAsmParser.y" -{ - yyval.TermInstVal = new BranchInst((BasicBlock*)getVal(Type::LabelTy, yyvsp[-3].ValIDVal), - (BasicBlock*)getVal(Type::LabelTy, yyvsp[0].ValIDVal), - getVal(Type::BoolTy, yyvsp[-6].ValIDVal)); - ; - break;} -case 111: -#line 909 "llvmAsmParser.y" -{ - SwitchInst *S = new SwitchInst(getVal(yyvsp[-7].TypeVal, yyvsp[-6].ValIDVal), - (BasicBlock*)getVal(Type::LabelTy, yyvsp[-3].ValIDVal)); - yyval.TermInstVal = S; - - list<pair<ConstPoolVal*, BasicBlock*> >::iterator I = yyvsp[-1].JumpTable->begin(), - end = yyvsp[-1].JumpTable->end(); - for (; I != end; ++I) - S->dest_push_back(I->first, I->second); - ; - break;} -case 112: -#line 920 "llvmAsmParser.y" -{ - yyval.JumpTable = yyvsp[-5].JumpTable; - ConstPoolVal *V = (ConstPoolVal*)getVal(yyvsp[-4].TypeVal, yyvsp[-3].ValIDVal, true); - if (V == 0) - ThrowException("May only switch on a constant pool value!"); - - yyval.JumpTable->push_back(make_pair(V, (BasicBlock*)getVal(yyvsp[-1].TypeVal, yyvsp[0].ValIDVal))); - ; - break;} -case 113: -#line 928 "llvmAsmParser.y" -{ - yyval.JumpTable = new list<pair<ConstPoolVal*, BasicBlock*> >(); - ConstPoolVal *V = (ConstPoolVal*)getVal(yyvsp[-4].TypeVal, yyvsp[-3].ValIDVal, true); - - if (V == 0) - ThrowException("May only switch on a constant pool value!"); - - yyval.JumpTable->push_back(make_pair(V, (BasicBlock*)getVal(yyvsp[-1].TypeVal, yyvsp[0].ValIDVal))); - ; - break;} -case 114: -#line 938 "llvmAsmParser.y" -{ - if (yyvsp[-1].StrVal) // Is this definition named?? - yyvsp[0].InstVal->setName(yyvsp[-1].StrVal); // if so, assign the name... - - InsertValue(yyvsp[0].InstVal); - yyval.InstVal = yyvsp[0].InstVal; -; - break;} -case 115: -#line 946 "llvmAsmParser.y" -{ // Used for PHI nodes - yyval.PHIList = new list<pair<Value*, BasicBlock*> >(); - yyval.PHIList->push_back(make_pair(getVal(yyvsp[-5].TypeVal, yyvsp[-3].ValIDVal), - (BasicBlock*)getVal(Type::LabelTy, yyvsp[-1].ValIDVal))); - ; - break;} -case 116: -#line 951 "llvmAsmParser.y" -{ - yyval.PHIList = yyvsp[-6].PHIList; - yyvsp[-6].PHIList->push_back(make_pair(getVal(yyvsp[-6].PHIList->front().first->getType(), yyvsp[-3].ValIDVal), - (BasicBlock*)getVal(Type::LabelTy, yyvsp[-1].ValIDVal))); - ; - break;} -case 117: -#line 958 "llvmAsmParser.y" -{ // Used for call statements... - yyval.ValueList = new list<Value*>(); - yyval.ValueList->push_back(getVal(yyvsp[-1].TypeVal, yyvsp[0].ValIDVal)); - ; - break;} -case 118: -#line 962 "llvmAsmParser.y" -{ - yyval.ValueList = yyvsp[-3].ValueList; - yyvsp[-3].ValueList->push_back(getVal(yyvsp[-1].TypeVal, yyvsp[0].ValIDVal)); - ; - break;} -case 120: -#line 968 "llvmAsmParser.y" -{ yyval.ValueList = 0; ; - break;} -case 121: -#line 970 "llvmAsmParser.y" -{ - 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!"); - ; - break;} -case 122: -#line 975 "llvmAsmParser.y" -{ - yyval.InstVal = UnaryOperator::create(yyvsp[-2].UnaryOpVal, getVal(yyvsp[-1].TypeVal, yyvsp[0].ValIDVal)); - if (yyval.InstVal == 0) - ThrowException("unary operator returned null!"); - ; - break;} -case 123: -#line 980 "llvmAsmParser.y" -{ - if (yyvsp[-1].TypeVal != Type::UByteTy) ThrowException("Shift amount must be ubyte!"); - yyval.InstVal = new ShiftInst(yyvsp[-5].OtherOpVal, getVal(yyvsp[-4].TypeVal, yyvsp[-3].ValIDVal), getVal(yyvsp[-1].TypeVal, yyvsp[0].ValIDVal)); - ; - break;} -case 124: -#line 984 "llvmAsmParser.y" -{ - yyval.InstVal = new CastInst(getVal(yyvsp[-3].TypeVal, yyvsp[-2].ValIDVal), yyvsp[0].TypeVal); - ; - break;} -case 125: -#line 987 "llvmAsmParser.y" -{ - const Type *Ty = yyvsp[0].PHIList->front().first->getType(); - yyval.InstVal = new PHINode(Ty); - 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!"); - ((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 126: -#line 998 "llvmAsmParser.y" -{ - if (!yyvsp[-4].TypeVal->isMethodType()) - ThrowException("Can only call methods: invalid type '" + - yyvsp[-4].TypeVal->getName() + "'!"); - - const MethodType *Ty = (const MethodType*)yyvsp[-4].TypeVal; - - Value *V = getVal(Ty, yyvsp[-3].ValIDVal); - if (!V->isMethod() || V->getType() != Ty) - ThrowException("Cannot call: " + yyvsp[-3].ValIDVal.getName() + "!"); - - // Create or access a new type that corresponds to the function call... - vector<Value *> Params; - - if (yyvsp[-1].ValueList) { - // Pull out just the arguments... - Params.insert(Params.begin(), yyvsp[-1].ValueList->begin(), yyvsp[-1].ValueList->end()); - delete yyvsp[-1].ValueList; - - // Loop through MethodType's arguments and ensure they are specified - // correctly! - // - MethodType::ParamTypes::const_iterator I = Ty->getParamTypes().begin(); - unsigned i; - for (i = 0; i < Params.size() && I != Ty->getParamTypes().end(); ++i,++I){ - if (Params[i]->getType() != *I) - ThrowException("Parameter " + utostr(i) + " is not of type '" + - (*I)->getName() + "'!"); - } - - if (i != Params.size() || I != Ty->getParamTypes().end()) - ThrowException("Invalid number of parameters detected!"); - } - - // Create the call node... - yyval.InstVal = new CallInst((Method*)V, Params); - ; - break;} -case 127: -#line 1035 "llvmAsmParser.y" -{ - yyval.InstVal = yyvsp[0].InstVal; - ; - break;} -case 128: -#line 1040 "llvmAsmParser.y" -{ - yyval.ConstVector = yyvsp[0].ConstVector; -; - break;} -case 129: -#line 1042 "llvmAsmParser.y" -{ - yyval.ConstVector = new vector<ConstPoolVal*>(); -; - break;} -case 130: -#line 1046 "llvmAsmParser.y" -{ - yyval.InstVal = new MallocInst(checkNewType(PointerType::getPointerType(yyvsp[0].TypeVal))); - ; - break;} -case 131: -#line 1049 "llvmAsmParser.y" -{ - if (!yyvsp[-3].TypeVal->isArrayType() || ((const ArrayType*)yyvsp[-3].TypeVal)->isSized()) - ThrowException("Trying to allocate " + yyvsp[-3].TypeVal->getName() + - " as unsized array!"); - const Type *Ty = checkNewType(PointerType::getPointerType(yyvsp[-3].TypeVal)); - yyval.InstVal = new MallocInst(Ty, getVal(yyvsp[-1].TypeVal, yyvsp[0].ValIDVal)); - ; - break;} -case 132: -#line 1056 "llvmAsmParser.y" -{ - yyval.InstVal = new AllocaInst(checkNewType(PointerType::getPointerType(yyvsp[0].TypeVal))); - ; - break;} -case 133: -#line 1059 "llvmAsmParser.y" -{ - if (!yyvsp[-3].TypeVal->isArrayType() || ((const ArrayType*)yyvsp[-3].TypeVal)->isSized()) - ThrowException("Trying to allocate " + yyvsp[-3].TypeVal->getName() + - " as unsized array!"); - const Type *Ty = checkNewType(PointerType::getPointerType(yyvsp[-3].TypeVal)); - Value *ArrSize = getVal(yyvsp[-1].TypeVal, yyvsp[0].ValIDVal); - yyval.InstVal = new AllocaInst(Ty, ArrSize); - ; - break;} -case 134: -#line 1067 "llvmAsmParser.y" -{ - if (!yyvsp[-1].TypeVal->isPointerType()) - ThrowException("Trying to free nonpointer type " + yyvsp[-1].TypeVal->getName() + "!"); - yyval.InstVal = new FreeInst(getVal(yyvsp[-1].TypeVal, yyvsp[0].ValIDVal)); - ; - break;} -case 135: -#line 1073 "llvmAsmParser.y" -{ - if (!yyvsp[-2].TypeVal->isPointerType()) - ThrowException("Can't load from nonpointer type: " + yyvsp[-2].TypeVal->getName()); - if (LoadInst::getIndexedType(yyvsp[-2].TypeVal, *yyvsp[0].ConstVector) == 0) - ThrowException("Invalid indices for load instruction!"); - - yyval.InstVal = new LoadInst(getVal(yyvsp[-2].TypeVal, yyvsp[-1].ValIDVal), *yyvsp[0].ConstVector); - delete yyvsp[0].ConstVector; // Free the vector... - ; - break;} -case 136: -#line 1082 "llvmAsmParser.y" -{ - if (!yyvsp[-2].TypeVal->isPointerType()) - ThrowException("Can't store to a nonpointer type: " + yyvsp[-2].TypeVal->getName()); - const Type *ElTy = StoreInst::getIndexedType(yyvsp[-2].TypeVal, *yyvsp[0].ConstVector); - if (ElTy == 0) - ThrowException("Can't store into that field list!"); - if (ElTy != yyvsp[-5].TypeVal) - ThrowException("Can't store '" + yyvsp[-5].TypeVal->getName() + "' into space of type '"+ - ElTy->getName() + "'!"); - yyval.InstVal = new StoreInst(getVal(yyvsp[-5].TypeVal, yyvsp[-4].ValIDVal), getVal(yyvsp[-2].TypeVal, yyvsp[-1].ValIDVal), *yyvsp[0].ConstVector); - delete yyvsp[0].ConstVector; - ; - break;} -case 137: -#line 1094 "llvmAsmParser.y" -{ - if (!yyvsp[-2].TypeVal->isPointerType()) - ThrowException("getelementptr insn requires pointer operand!"); - if (!GetElementPtrInst::getIndexedType(yyvsp[-2].TypeVal, *yyvsp[0].ConstVector, true)) - ThrowException("Can't get element ptr '" + yyvsp[-2].TypeVal->getName() + "'!"); - yyval.InstVal = new GetElementPtrInst(getVal(yyvsp[-2].TypeVal, yyvsp[-1].ValIDVal), *yyvsp[0].ConstVector); - delete yyvsp[0].ConstVector; - checkNewType(yyval.InstVal->getType()); - ; - break;} -} - /* the action file gets copied in in place of this dollarsign */ -#line 543 "/usr/dcs/software/supported/encap/bison-1.28/share/bison.simple" - - yyvsp -= yylen; - yyssp -= yylen; -#ifdef YYLSP_NEEDED - yylsp -= yylen; -#endif - -#if YYDEBUG != 0 - if (yydebug) - { - short *ssp1 = yyss - 1; - fprintf (stderr, "state stack now"); - while (ssp1 != yyssp) - fprintf (stderr, " %d", *++ssp1); - fprintf (stderr, "\n"); - } -#endif - - *++yyvsp = yyval; - -#ifdef YYLSP_NEEDED - yylsp++; - if (yylen == 0) - { - yylsp->first_line = yylloc.first_line; - yylsp->first_column = yylloc.first_column; - yylsp->last_line = (yylsp-1)->last_line; - yylsp->last_column = (yylsp-1)->last_column; - yylsp->text = 0; - } - else - { - yylsp->last_line = (yylsp+yylen-1)->last_line; - yylsp->last_column = (yylsp+yylen-1)->last_column; - } -#endif - - /* Now "shift" the result of the reduction. - Determine what state that goes to, - based on the state we popped back to - and the rule number reduced by. */ - - yyn = yyr1[yyn]; - - yystate = yypgoto[yyn - YYNTBASE] + *yyssp; - if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp) - yystate = yytable[yystate]; - else - yystate = yydefgoto[yyn - YYNTBASE]; - - goto yynewstate; - -yyerrlab: /* here on detecting error */ - - if (! yyerrstatus) - /* If not already recovering from an error, report this error. */ - { - ++yynerrs; - -#ifdef YYERROR_VERBOSE - yyn = yypact[yystate]; - - if (yyn > YYFLAG && yyn < YYLAST) - { - int size = 0; - char *msg; - int x, count; - - count = 0; - /* Start X at -yyn if nec to avoid negative indexes in yycheck. */ - for (x = (yyn < 0 ? -yyn : 0); - x < (sizeof(yytname) / sizeof(char *)); x++) - if (yycheck[x + yyn] == x) - size += strlen(yytname[x]) + 15, count++; - msg = (char *) malloc(size + 15); - if (msg != 0) - { - strcpy(msg, "parse error"); - - if (count < 5) - { - count = 0; - for (x = (yyn < 0 ? -yyn : 0); - x < (sizeof(yytname) / sizeof(char *)); x++) - if (yycheck[x + yyn] == x) - { - strcat(msg, count == 0 ? ", expecting `" : " or `"); - strcat(msg, yytname[x]); - strcat(msg, "'"); - count++; - } - } - yyerror(msg); - free(msg); - } - else - yyerror ("parse error; also virtual memory exceeded"); - } - else -#endif /* YYERROR_VERBOSE */ - yyerror("parse error"); - } - - goto yyerrlab1; -yyerrlab1: /* here on error raised explicitly by an action */ - - if (yyerrstatus == 3) - { - /* if just tried and failed to reuse lookahead token after an error, discard it. */ - - /* return failure if at end of input */ - if (yychar == YYEOF) - YYABORT; - -#if YYDEBUG != 0 - if (yydebug) - fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]); -#endif - - yychar = YYEMPTY; - } - - /* Else will try to reuse lookahead token - after shifting the error token. */ - - yyerrstatus = 3; /* Each real token shifted decrements this */ - - goto yyerrhandle; - -yyerrdefault: /* current state does not do anything special for the error token. */ - -#if 0 - /* This is wrong; only states that explicitly want error tokens - should shift them. */ - yyn = yydefact[yystate]; /* If its default is to accept any token, ok. Otherwise pop it.*/ - if (yyn) goto yydefault; -#endif - -yyerrpop: /* pop the current state because it cannot handle the error token */ - - if (yyssp == yyss) YYABORT; - yyvsp--; - yystate = *--yyssp; -#ifdef YYLSP_NEEDED - yylsp--; -#endif - -#if YYDEBUG != 0 - if (yydebug) - { - short *ssp1 = yyss - 1; - fprintf (stderr, "Error: state stack now"); - while (ssp1 != yyssp) - fprintf (stderr, " %d", *++ssp1); - fprintf (stderr, "\n"); - } -#endif - -yyerrhandle: - - yyn = yypact[yystate]; - if (yyn == YYFLAG) - goto yyerrdefault; - - yyn += YYTERROR; - if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR) - goto yyerrdefault; - - yyn = yytable[yyn]; - if (yyn < 0) - { - if (yyn == YYFLAG) - goto yyerrpop; - yyn = -yyn; - goto yyreduce; - } - else if (yyn == 0) - goto yyerrpop; - - if (yyn == YYFINAL) - YYACCEPT; - -#if YYDEBUG != 0 - if (yydebug) - fprintf(stderr, "Shifting error token, "); -#endif - - *++yyvsp = yylval; -#ifdef YYLSP_NEEDED - *++yylsp = yylloc; -#endif - - yystate = yyn; - goto yynewstate; - - yyacceptlab: - /* YYACCEPT comes here. */ - if (yyfree_stacks) - { - free (yyss); - free (yyvs); -#ifdef YYLSP_NEEDED - free (yyls); -#endif - } - return 0; - - yyabortlab: - /* YYABORT comes here. */ - if (yyfree_stacks) - { - free (yyss); - free (yyvs); -#ifdef YYLSP_NEEDED - free (yyls); -#endif - } - return 1; -} -#line 1104 "llvmAsmParser.y" - -int yyerror(const char *ErrorMsg) { - ThrowException(string("Parse error: ") + ErrorMsg); - return 0; -} diff --git a/lib/AsmParser/llvmAsmParser.y b/lib/AsmParser/llvmAsmParser.y index ff7dccaea5..28a768d1ff 100644 --- a/lib/AsmParser/llvmAsmParser.y +++ b/lib/AsmParser/llvmAsmParser.y @@ -32,7 +32,7 @@ int yylex(); // declaration" of xxx warnings. int yyparse(); static Module *ParserResult; -const ToolCommandLine *CurOptions = 0; +string CurFilename; // This contains info used when building the body of a method. It is destroyed // when the method is completed. @@ -367,15 +367,14 @@ static const Type *checkNewType(const Type *Ty) { // RunVMAsmParser - Define an interface to this parser //===----------------------------------------------------------------------===// // -Module *RunVMAsmParser(const ToolCommandLine &Opts, FILE *F) { +Module *RunVMAsmParser(const string &Filename, FILE *F) { llvmAsmin = F; - CurOptions = &Opts; + CurFilename = Filename; llvmAsmlineno = 1; // Reset the current line number... CurModule.CurrentModule = new Module(); // Allocate a new module to read yyparse(); // Parse the file. Module *Result = ParserResult; - CurOptions = 0; llvmAsmin = stdin; // F is about to go away, don't use it anymore... ParserResult = 0; |