Gitiles
Code Review Sign In
gerrit-public.fairphone.software / fp2-dev / platform / external / llvm / 930c0fead9ad8cb91322c02fdead15cdd8dcbe0d / . / lib / AsmParser / llvmAsmParser.cpp.cvs
blob: 7a2cddc6d0e21818bbd39badeffcf2d9a8f061bc [file] [log] [blame]
/* A Bison parser, made from /usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y, by GNU bison 1.75. */
/* Skeleton parser for Yacc-like parsing with Bison,
Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002 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
/* 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,
ESAPINTVAL = 260,
EUAPINTVAL = 261,
LOCALVAL_ID = 262,
GLOBALVAL_ID = 263,
FPVAL = 264,
VOID = 265,
INTTYPE = 266,
FLOAT = 267,
DOUBLE = 268,
LABEL = 269,
TYPE = 270,
LOCALVAR = 271,
GLOBALVAR = 272,
LABELSTR = 273,
STRINGCONSTANT = 274,
ATSTRINGCONSTANT = 275,
ZEROINITIALIZER = 276,
TRUETOK = 277,
FALSETOK = 278,
BEGINTOK = 279,
ENDTOK = 280,
DECLARE = 281,
DEFINE = 282,
GLOBAL = 283,
CONSTANT = 284,
SECTION = 285,
ALIAS = 286,
VOLATILE = 287,
THREAD_LOCAL = 288,
TO = 289,
DOTDOTDOT = 290,
NULL_TOK = 291,
UNDEF = 292,
INTERNAL = 293,
LINKONCE = 294,
WEAK = 295,
APPENDING = 296,
DLLIMPORT = 297,
DLLEXPORT = 298,
EXTERN_WEAK = 299,
OPAQUE = 300,
EXTERNAL = 301,
TARGET = 302,
TRIPLE = 303,
ALIGN = 304,
DEPLIBS = 305,
CALL = 306,
TAIL = 307,
ASM_TOK = 308,
MODULE = 309,
SIDEEFFECT = 310,
CC_TOK = 311,
CCC_TOK = 312,
FASTCC_TOK = 313,
COLDCC_TOK = 314,
X86_STDCALLCC_TOK = 315,
X86_FASTCALLCC_TOK = 316,
DATALAYOUT = 317,
RET = 318,
BR = 319,
SWITCH = 320,
INVOKE = 321,
UNWIND = 322,
UNREACHABLE = 323,
ADD = 324,
SUB = 325,
MUL = 326,
UDIV = 327,
SDIV = 328,
FDIV = 329,
UREM = 330,
SREM = 331,
FREM = 332,
AND = 333,
OR = 334,
XOR = 335,
SHL = 336,
LSHR = 337,
ASHR = 338,
ICMP = 339,
FCMP = 340,
EQ = 341,
NE = 342,
SLT = 343,
SGT = 344,
SLE = 345,
SGE = 346,
ULT = 347,
UGT = 348,
ULE = 349,
UGE = 350,
OEQ = 351,
ONE = 352,
OLT = 353,
OGT = 354,
OLE = 355,
OGE = 356,
ORD = 357,
UNO = 358,
UEQ = 359,
UNE = 360,
MALLOC = 361,
ALLOCA = 362,
FREE = 363,
LOAD = 364,
STORE = 365,
GETELEMENTPTR = 366,
TRUNC = 367,
ZEXT = 368,
SEXT = 369,
FPTRUNC = 370,
FPEXT = 371,
BITCAST = 372,
UITOFP = 373,
SITOFP = 374,
FPTOUI = 375,
FPTOSI = 376,
INTTOPTR = 377,
PTRTOINT = 378,
PHI_TOK = 379,
SELECT = 380,
VAARG = 381,
EXTRACTELEMENT = 382,
INSERTELEMENT = 383,
SHUFFLEVECTOR = 384,
NORETURN = 385,
INREG = 386,
SRET = 387,
NOUNWIND = 388,
DEFAULT = 389,
HIDDEN = 390
};
#endif
#define ESINT64VAL 258
#define EUINT64VAL 259
#define ESAPINTVAL 260
#define EUAPINTVAL 261
#define LOCALVAL_ID 262
#define GLOBALVAL_ID 263
#define FPVAL 264
#define VOID 265
#define INTTYPE 266
#define FLOAT 267
#define DOUBLE 268
#define LABEL 269
#define TYPE 270
#define LOCALVAR 271
#define GLOBALVAR 272
#define LABELSTR 273
#define STRINGCONSTANT 274
#define ATSTRINGCONSTANT 275
#define ZEROINITIALIZER 276
#define TRUETOK 277
#define FALSETOK 278
#define BEGINTOK 279
#define ENDTOK 280
#define DECLARE 281
#define DEFINE 282
#define GLOBAL 283
#define CONSTANT 284
#define SECTION 285
#define ALIAS 286
#define VOLATILE 287
#define THREAD_LOCAL 288
#define TO 289
#define DOTDOTDOT 290
#define NULL_TOK 291
#define UNDEF 292
#define INTERNAL 293
#define LINKONCE 294
#define WEAK 295
#define APPENDING 296
#define DLLIMPORT 297
#define DLLEXPORT 298
#define EXTERN_WEAK 299
#define OPAQUE 300
#define EXTERNAL 301
#define TARGET 302
#define TRIPLE 303
#define ALIGN 304
#define DEPLIBS 305
#define CALL 306
#define TAIL 307
#define ASM_TOK 308
#define MODULE 309
#define SIDEEFFECT 310
#define CC_TOK 311
#define CCC_TOK 312
#define FASTCC_TOK 313
#define COLDCC_TOK 314
#define X86_STDCALLCC_TOK 315
#define X86_FASTCALLCC_TOK 316
#define DATALAYOUT 317
#define RET 318
#define BR 319
#define SWITCH 320
#define INVOKE 321
#define UNWIND 322
#define UNREACHABLE 323
#define ADD 324
#define SUB 325
#define MUL 326
#define UDIV 327
#define SDIV 328
#define FDIV 329
#define UREM 330
#define SREM 331
#define FREM 332
#define AND 333
#define OR 334
#define XOR 335
#define SHL 336
#define LSHR 337
#define ASHR 338
#define ICMP 339
#define FCMP 340
#define EQ 341
#define NE 342
#define SLT 343
#define SGT 344
#define SLE 345
#define SGE 346
#define ULT 347
#define UGT 348
#define ULE 349
#define UGE 350
#define OEQ 351
#define ONE 352
#define OLT 353
#define OGT 354
#define OLE 355
#define OGE 356
#define ORD 357
#define UNO 358
#define UEQ 359
#define UNE 360
#define MALLOC 361
#define ALLOCA 362
#define FREE 363
#define LOAD 364
#define STORE 365
#define GETELEMENTPTR 366
#define TRUNC 367
#define ZEXT 368
#define SEXT 369
#define FPTRUNC 370
#define FPEXT 371
#define BITCAST 372
#define UITOFP 373
#define SITOFP 374
#define FPTOUI 375
#define FPTOSI 376
#define INTTOPTR 377
#define PTRTOINT 378
#define PHI_TOK 379
#define SELECT 380
#define VAARG 381
#define EXTRACTELEMENT 382
#define INSERTELEMENT 383
#define SHUFFLEVECTOR 384
#define NORETURN 385
#define INREG 386
#define SRET 387
#define NOUNWIND 388
#define DEFAULT 389
#define HIDDEN 390
/* Copy the first part of user declarations. */
#line 14 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
#include "ParserInternals.h"
#include "llvm/CallingConv.h"
#include "llvm/InlineAsm.h"
#include "llvm/Instructions.h"
#include "llvm/Module.h"
#include "llvm/ValueSymbolTable.h"
#include "llvm/Support/GetElementPtrTypeIterator.h"
#include "llvm/Support/CommandLine.h"
#include "llvm/ADT/SmallVector.h"
#include "llvm/ADT/STLExtras.h"
#include "llvm/Support/MathExtras.h"
#include "llvm/Support/Streams.h"
#include <algorithm>
#include <list>
#include <map>
#include <utility>
#ifndef NDEBUG
#define YYDEBUG 1
#endif
// The following is a gross hack. In order to rid the libAsmParser library of
// exceptions, we have to have a way of getting the yyparse function to go into
// an error situation. So, whenever we want an error to occur, the GenerateError
// function (see bottom of file) sets TriggerError. Then, at the end of each
// production in the grammer we use CHECK_FOR_ERROR which will invoke YYERROR
// (a goto) to put YACC in error state. Furthermore, several calls to
// GenerateError are made from inside productions and they must simulate the
// previous exception behavior by exiting the production immediately. We have
// replaced these with the GEN_ERROR macro which calls GeneratError and then
// immediately invokes YYERROR. This would be so much cleaner if it was a
// recursive descent parser.
static bool TriggerError = false;
#define CHECK_FOR_ERROR { if (TriggerError) { TriggerError = false; YYABORT; } }
#define GEN_ERROR(msg) { GenerateError(msg); YYERROR; }
int yyerror(const char *ErrorMsg); // Forward declarations to prevent "implicit
int yylex(); // declaration" of xxx warnings.
int yyparse();
namespace llvm {
std::string CurFilename;
#if YYDEBUG
static cl::opt<bool>
Debug("debug-yacc", cl::desc("Print yacc debug state changes"),
cl::Hidden, cl::init(false));
#endif
}
using namespace llvm;
static Module *ParserResult;
// DEBUG_UPREFS - Define this symbol if you want to enable debugging output
// relating to upreferences in the input stream.
//
//#define DEBUG_UPREFS 1
#ifdef DEBUG_UPREFS
#define UR_OUT(X) cerr << X
#else
#define UR_OUT(X)
#endif
#define YYERROR_VERBOSE 1
static GlobalVariable *CurGV;
// This contains info used when building the body of a function. It is
// destroyed when the function is completed.
//
typedef std::vector<Value *> ValueList; // Numbered defs
static void
ResolveDefinitions(ValueList &LateResolvers, ValueList *FutureLateResolvers=0);
static struct PerModuleInfo {
Module *CurrentModule;
ValueList Values; // Module level numbered definitions
ValueList LateResolveValues;
std::vector<PATypeHolder> Types;
std::map<ValID, PATypeHolder> LateResolveTypes;
/// PlaceHolderInfo - When temporary placeholder objects are created, remember
/// how they were referenced and on which line of the input they came from so
/// that we can resolve them later and print error messages as appropriate.
std::map<Value*, std::pair<ValID, int> > PlaceHolderInfo;
// GlobalRefs - This maintains a mapping between <Type, ValID>'s and forward
// references to global values. Global values may be referenced before they
// are defined, and if so, the temporary object that they represent is held
// here. This is used for forward references of GlobalValues.
//
typedef std::map<std::pair<const PointerType *,
ValID>, GlobalValue*> GlobalRefsType;
GlobalRefsType GlobalRefs;
void ModuleDone() {
// If we could not resolve some functions at function compilation time
// (calls to functions before they are defined), resolve them now... Types
// are resolved when the constant pool has been completely parsed.
//
ResolveDefinitions(LateResolveValues);
if (TriggerError)
return;
// Check to make sure that all global value forward references have been
// resolved!
//
if (!GlobalRefs.empty()) {
std::string UndefinedReferences = "Unresolved global references exist:\n";
for (GlobalRefsType::iterator I = GlobalRefs.begin(), E =GlobalRefs.end();
I != E; ++I) {
UndefinedReferences += " " + I->first.first->getDescription() + " " +
I->first.second.getName() + "\n";
}
GenerateError(UndefinedReferences);
return;
}
Values.clear(); // Clear out function local definitions
Types.clear();
CurrentModule = 0;
}
// GetForwardRefForGlobal - Check to see if there is a forward reference
// for this global. If so, remove it from the GlobalRefs map and return it.
// If not, just return null.
GlobalValue *GetForwardRefForGlobal(const PointerType *PTy, ValID ID) {
// Check to see if there is a forward reference to this global variable...
// if there is, eliminate it and patch the reference to use the new def'n.
GlobalRefsType::iterator I = GlobalRefs.find(std::make_pair(PTy, ID));
GlobalValue *Ret = 0;
if (I != GlobalRefs.end()) {
Ret = I->second;
GlobalRefs.erase(I);
}
return Ret;
}
bool TypeIsUnresolved(PATypeHolder* PATy) {
// If it isn't abstract, its resolved
const Type* Ty = PATy->get();
if (!Ty->isAbstract())
return false;
// Traverse the type looking for abstract types. If it isn't abstract then
// we don't need to traverse that leg of the type.
std::vector<const Type*> WorkList, SeenList;
WorkList.push_back(Ty);
while (!WorkList.empty()) {
const Type* Ty = WorkList.back();
SeenList.push_back(Ty);
WorkList.pop_back();
if (const OpaqueType* OpTy = dyn_cast<OpaqueType>(Ty)) {
// Check to see if this is an unresolved type
std::map<ValID, PATypeHolder>::iterator I = LateResolveTypes.begin();
std::map<ValID, PATypeHolder>::iterator E = LateResolveTypes.end();
for ( ; I != E; ++I) {
if (I->second.get() == OpTy)
return true;
}
} else if (const SequentialType* SeqTy = dyn_cast<SequentialType>(Ty)) {
const Type* TheTy = SeqTy->getElementType();
if (TheTy->isAbstract() && TheTy != Ty) {
std::vector<const Type*>::iterator I = SeenList.begin(),
E = SeenList.end();
for ( ; I != E; ++I)
if (*I == TheTy)
break;
if (I == E)
WorkList.push_back(TheTy);
}
} else if (const StructType* StrTy = dyn_cast<StructType>(Ty)) {
for (unsigned i = 0; i < StrTy->getNumElements(); ++i) {
const Type* TheTy = StrTy->getElementType(i);
if (TheTy->isAbstract() && TheTy != Ty) {
std::vector<const Type*>::iterator I = SeenList.begin(),
E = SeenList.end();
for ( ; I != E; ++I)
if (*I == TheTy)
break;
if (I == E)
WorkList.push_back(TheTy);
}
}
}
}
return false;
}
} CurModule;
static struct PerFunctionInfo {
Function *CurrentFunction; // Pointer to current function being created
ValueList Values; // Keep track of #'d definitions
unsigned NextValNum;
ValueList LateResolveValues;
bool isDeclare; // Is this function a forward declararation?
GlobalValue::LinkageTypes Linkage; // Linkage for forward declaration.
GlobalValue::VisibilityTypes Visibility;
/// BBForwardRefs - When we see forward references to basic blocks, keep
/// track of them here.
std::map<ValID, BasicBlock*> BBForwardRefs;
inline PerFunctionInfo() {
CurrentFunction = 0;
isDeclare = false;
Linkage = GlobalValue::ExternalLinkage;
Visibility = GlobalValue::DefaultVisibility;
}
inline void FunctionStart(Function *M) {
CurrentFunction = M;
NextValNum = 0;
}
void FunctionDone() {
// Any forward referenced blocks left?
if (!BBForwardRefs.empty()) {
GenerateError("Undefined reference to label " +
BBForwardRefs.begin()->second->getName());
return;
}
// Resolve all forward references now.
ResolveDefinitions(LateResolveValues, &CurModule.LateResolveValues);
Values.clear(); // Clear out function local definitions
BBForwardRefs.clear();
CurrentFunction = 0;
isDeclare = false;
Linkage = GlobalValue::ExternalLinkage;
Visibility = GlobalValue::DefaultVisibility;
}
} CurFun; // Info for the current function...
static bool inFunctionScope() { return CurFun.CurrentFunction != 0; }
//===----------------------------------------------------------------------===//
// Code to handle definitions of all the types
//===----------------------------------------------------------------------===//
static void InsertValue(Value *V, ValueList &ValueTab = CurFun.Values) {
// Things that have names or are void typed don't get slot numbers
if (V->hasName() || (V->getType() == Type::VoidTy))
return;
// In the case of function values, we have to allow for the forward reference
// of basic blocks, which are included in the numbering. Consequently, we keep
// track of the next insertion location with NextValNum. When a BB gets
// inserted, it could change the size of the CurFun.Values vector.
if (&ValueTab == &CurFun.Values) {
if (ValueTab.size() <= CurFun.NextValNum)
ValueTab.resize(CurFun.NextValNum+1);
ValueTab[CurFun.NextValNum++] = V;
return;
}
// For all other lists, its okay to just tack it on the back of the vector.
ValueTab.push_back(V);
}
static const Type *getTypeVal(const ValID &D, bool DoNotImprovise = false) {
switch (D.Type) {
case ValID::LocalID: // Is it a numbered definition?
// Module constants occupy the lowest numbered slots...
if (D.Num < CurModule.Types.size())
return CurModule.Types[D.Num];
break;
case ValID::LocalName: // Is it a named definition?
if (const Type *N = CurModule.CurrentModule->getTypeByName(D.Name)) {
D.destroy(); // Free old strdup'd memory...
return N;
}
break;
default:
GenerateError("Internal parser error: Invalid symbol type reference");
return 0;
}
// If we reached here, we referenced either a symbol that we don't know about
// or an id number that hasn't been read yet. We may be referencing something
// forward, so just create an entry to be resolved later and get to it...
//
if (DoNotImprovise) return 0; // Do we just want a null to be returned?
if (inFunctionScope()) {
if (D.Type == ValID::LocalName) {
GenerateError("Reference to an undefined type: '" + D.getName() + "'");
return 0;
} else {
GenerateError("Reference to an undefined type: #" + utostr(D.Num));
return 0;
}
}
std::map<ValID, PATypeHolder>::iterator I =CurModule.LateResolveTypes.find(D);
if (I != CurModule.LateResolveTypes.end())
return I->second;
Type *Typ = OpaqueType::get();
CurModule.LateResolveTypes.insert(std::make_pair(D, Typ));
return Typ;
}
// getExistingVal - Look up the value specified by the provided type and
// the provided ValID. If the value exists and has already been defined, return
// it. Otherwise return null.
//
static Value *getExistingVal(const Type *Ty, const ValID &D) {
if (isa<FunctionType>(Ty)) {
GenerateError("Functions are not values and "
"must be referenced as pointers");
return 0;
}
switch (D.Type) {
case ValID::LocalID: { // Is it a numbered definition?
// Check that the number is within bounds.
if (D.Num >= CurFun.Values.size())
return 0;
Value *Result = CurFun.Values[D.Num];
if (Ty != Result->getType()) {
GenerateError("Numbered value (%" + utostr(D.Num) + ") of type '" +
Result->getType()->getDescription() + "' does not match "
"expected type, '" + Ty->getDescription() + "'");
return 0;
}
return Result;
}
case ValID::GlobalID: { // Is it a numbered definition?
if (D.Num >= CurModule.Values.size())
return 0;
Value *Result = CurModule.Values[D.Num];
if (Ty != Result->getType()) {
GenerateError("Numbered value (@" + utostr(D.Num) + ") of type '" +
Result->getType()->getDescription() + "' does not match "
"expected type, '" + Ty->getDescription() + "'");
return 0;
}
return Result;
}
case ValID::LocalName: { // Is it a named definition?
if (!inFunctionScope())
return 0;
ValueSymbolTable &SymTab = CurFun.CurrentFunction->getValueSymbolTable();
Value *N = SymTab.lookup(D.Name);
if (N == 0)
return 0;
if (N->getType() != Ty)
return 0;
D.destroy(); // Free old strdup'd memory...
return N;
}
case ValID::GlobalName: { // Is it a named definition?
ValueSymbolTable &SymTab = CurModule.CurrentModule->getValueSymbolTable();
Value *N = SymTab.lookup(D.Name);
if (N == 0)
return 0;
if (N->getType() != Ty)
return 0;
D.destroy(); // Free old strdup'd memory...
return N;
}
// Check to make sure that "Ty" is an integral type, and that our
// value will fit into the specified type...
case ValID::ConstSIntVal: // Is it a constant pool reference??
if (!ConstantInt::isValueValidForType(Ty, D.ConstPool64)) {
GenerateError("Signed integral constant '" +
itostr(D.ConstPool64) + "' is invalid for type '" +
Ty->getDescription() + "'");
return 0;
}
return ConstantInt::get(Ty, D.ConstPool64, true);
case ValID::ConstUIntVal: // Is it an unsigned const pool reference?
if (!ConstantInt::isValueValidForType(Ty, D.UConstPool64)) {
if (!ConstantInt::isValueValidForType(Ty, D.ConstPool64)) {
GenerateError("Integral constant '" + utostr(D.UConstPool64) +
"' is invalid or out of range");
return 0;
} else { // This is really a signed reference. Transmogrify.
return ConstantInt::get(Ty, D.ConstPool64, true);
}
} else {
return ConstantInt::get(Ty, D.UConstPool64);
}
case ValID::ConstFPVal: // Is it a floating point const pool reference?
if (!ConstantFP::isValueValidForType(Ty, D.ConstPoolFP)) {
GenerateError("FP constant invalid for type");
return 0;
}
return ConstantFP::get(Ty, D.ConstPoolFP);
case ValID::ConstNullVal: // Is it a null value?
if (!isa<PointerType>(Ty)) {
GenerateError("Cannot create a a non pointer null");
return 0;
}
return ConstantPointerNull::get(cast<PointerType>(Ty));
case ValID::ConstUndefVal: // Is it an undef value?
return UndefValue::get(Ty);
case ValID::ConstZeroVal: // Is it a zero value?
return Constant::getNullValue(Ty);
case ValID::ConstantVal: // Fully resolved constant?
if (D.ConstantValue->getType() != Ty) {
GenerateError("Constant expression type different from required type");
return 0;
}
return D.ConstantValue;
case ValID::InlineAsmVal: { // Inline asm expression
const PointerType *PTy = dyn_cast<PointerType>(Ty);
const FunctionType *FTy =
PTy ? dyn_cast<FunctionType>(PTy->getElementType()) : 0;
if (!FTy || !InlineAsm::Verify(FTy, D.IAD->Constraints)) {
GenerateError("Invalid type for asm constraint string");
return 0;
}
InlineAsm *IA = InlineAsm::get(FTy, D.IAD->AsmString, D.IAD->Constraints,
D.IAD->HasSideEffects);
D.destroy(); // Free InlineAsmDescriptor.
return IA;
}
default:
assert(0 && "Unhandled case!");
return 0;
} // End of switch
assert(0 && "Unhandled case!");
return 0;
}
// getVal - This function is identical to getExistingVal, except that if a
// value is not already defined, it "improvises" by creating a placeholder var
// that looks and acts just like the requested variable. When the value is
// defined later, all uses of the placeholder variable are replaced with the
// real thing.
//
static Value *getVal(const Type *Ty, const ValID &ID) {
if (Ty == Type::LabelTy) {
GenerateError("Cannot use a basic block here");
return 0;
}
// See if the value has already been defined.
Value *V = getExistingVal(Ty, ID);
if (V) return V;
if (TriggerError) return 0;
if (!Ty->isFirstClassType() && !isa<OpaqueType>(Ty)) {
GenerateError("Invalid use of a composite type");
return 0;
}
// If we reached here, we referenced either a symbol that we don't know about
// or an id number that hasn't been read yet. We may be referencing something
// forward, so just create an entry to be resolved later and get to it...
//
switch (ID.Type) {
case ValID::GlobalName:
case ValID::GlobalID: {
const PointerType *PTy = dyn_cast<PointerType>(Ty);
if (!PTy) {
GenerateError("Invalid type for reference to global" );
return 0;
}
const Type* ElTy = PTy->getElementType();
if (const FunctionType *FTy = dyn_cast<FunctionType>(ElTy))
V = new Function(FTy, GlobalValue::ExternalLinkage);
else
V = new GlobalVariable(ElTy, false, GlobalValue::ExternalLinkage);
break;
}
default:
V = new Argument(Ty);
}
// Remember where this forward reference came from. FIXME, shouldn't we try
// to recycle these things??
CurModule.PlaceHolderInfo.insert(std::make_pair(V, std::make_pair(ID,
llvmAsmlineno)));
if (inFunctionScope())
InsertValue(V, CurFun.LateResolveValues);
else
InsertValue(V, CurModule.LateResolveValues);
return V;
}
/// defineBBVal - This is a definition of a new basic block with the specified
/// identifier which must be the same as CurFun.NextValNum, if its numeric.
static BasicBlock *defineBBVal(const ValID &ID) {
assert(inFunctionScope() && "Can't get basic block at global scope!");
BasicBlock *BB = 0;
// First, see if this was forward referenced
std::map<ValID, BasicBlock*>::iterator BBI = CurFun.BBForwardRefs.find(ID);
if (BBI != CurFun.BBForwardRefs.end()) {
BB = BBI->second;
// The forward declaration could have been inserted anywhere in the
// function: insert it into the correct place now.
CurFun.CurrentFunction->getBasicBlockList().remove(BB);
CurFun.CurrentFunction->getBasicBlockList().push_back(BB);
// We're about to erase the entry, save the key so we can clean it up.
ValID Tmp = BBI->first;
// Erase the forward ref from the map as its no longer "forward"
CurFun.BBForwardRefs.erase(ID);
// The key has been removed from the map but so we don't want to leave
// strdup'd memory around so destroy it too.
Tmp.destroy();
// If its a numbered definition, bump the number and set the BB value.
if (ID.Type == ValID::LocalID) {
assert(ID.Num == CurFun.NextValNum && "Invalid new block number");
InsertValue(BB);
}
ID.destroy();
return BB;
}
// We haven't seen this BB before and its first mention is a definition.
// Just create it and return it.
std::string Name (ID.Type == ValID::LocalName ? ID.Name : "");
BB = new BasicBlock(Name, CurFun.CurrentFunction);
if (ID.Type == ValID::LocalID) {
assert(ID.Num == CurFun.NextValNum && "Invalid new block number");
InsertValue(BB);
}
ID.destroy(); // Free strdup'd memory
return BB;
}
/// getBBVal - get an existing BB value or create a forward reference for it.
///
static BasicBlock *getBBVal(const ValID &ID) {
assert(inFunctionScope() && "Can't get basic block at global scope!");
BasicBlock *BB = 0;
std::map<ValID, BasicBlock*>::iterator BBI = CurFun.BBForwardRefs.find(ID);
if (BBI != CurFun.BBForwardRefs.end()) {
BB = BBI->second;
} if (ID.Type == ValID::LocalName) {
std::string Name = ID.Name;
Value *N = CurFun.CurrentFunction->getValueSymbolTable().lookup(Name);
if (N)
if (N->getType()->getTypeID() == Type::LabelTyID)
BB = cast<BasicBlock>(N);
else
GenerateError("Reference to label '" + Name + "' is actually of type '"+
N->getType()->getDescription() + "'");
} else if (ID.Type == ValID::LocalID) {
if (ID.Num < CurFun.NextValNum && ID.Num < CurFun.Values.size()) {
if (CurFun.Values[ID.Num]->getType()->getTypeID() == Type::LabelTyID)
BB = cast<BasicBlock>(CurFun.Values[ID.Num]);
else
GenerateError("Reference to label '%" + utostr(ID.Num) +
"' is actually of type '"+
CurFun.Values[ID.Num]->getType()->getDescription() + "'");
}
} else {
GenerateError("Illegal label reference " + ID.getName());
return 0;
}
// If its already been defined, return it now.
if (BB) {
ID.destroy(); // Free strdup'd memory.
return BB;
}
// Otherwise, this block has not been seen before, create it.
std::string Name;
if (ID.Type == ValID::LocalName)
Name = ID.Name;
BB = new BasicBlock(Name, CurFun.CurrentFunction);
// Insert it in the forward refs map.
CurFun.BBForwardRefs[ID] = BB;
return BB;
}
//===----------------------------------------------------------------------===//
// Code to handle forward references in instructions
//===----------------------------------------------------------------------===//
//
// This code handles the late binding needed with statements that reference
// values not defined yet... for example, a forward branch, or the PHI node for
// a loop body.
//
// This keeps a table (CurFun.LateResolveValues) of all such forward references
// and back patchs after we are done.
//
// ResolveDefinitions - If we could not resolve some defs at parsing
// time (forward branches, phi functions for loops, etc...) resolve the
// defs now...
//
static void
ResolveDefinitions(ValueList &LateResolvers, ValueList *FutureLateResolvers) {
// Loop over LateResolveDefs fixing up stuff that couldn't be resolved
while (!LateResolvers.empty()) {
Value *V = LateResolvers.back();
LateResolvers.pop_back();
std::map<Value*, std::pair<ValID, int> >::iterator PHI =
CurModule.PlaceHolderInfo.find(V);
assert(PHI != CurModule.PlaceHolderInfo.end() && "Placeholder error!");
ValID &DID = PHI->second.first;
Value *TheRealValue = getExistingVal(V->getType(), DID);
if (TriggerError)
return;
if (TheRealValue) {
V->replaceAllUsesWith(TheRealValue);
delete V;
CurModule.PlaceHolderInfo.erase(PHI);
} else if (FutureLateResolvers) {
// Functions have their unresolved items forwarded to the module late
// resolver table
InsertValue(V, *FutureLateResolvers);
} else {
if (DID.Type == ValID::LocalName || DID.Type == ValID::GlobalName) {
GenerateError("Reference to an invalid definition: '" +DID.getName()+
"' of type '" + V->getType()->getDescription() + "'",
PHI->second.second);
return;
} else {
GenerateError("Reference to an invalid definition: #" +
itostr(DID.Num) + " of type '" +
V->getType()->getDescription() + "'",
PHI->second.second);
return;
}
}
}
LateResolvers.clear();
}
// ResolveTypeTo - A brand new type was just declared. This means that (if
// name is not null) things referencing Name can be resolved. Otherwise, things
// refering to the number can be resolved. Do this now.
//
static void ResolveTypeTo(char *Name, const Type *ToTy) {
ValID D;
if (Name) D = ValID::createLocalName(Name);
else D = ValID::createLocalID(CurModule.Types.size());
std::map<ValID, PATypeHolder>::iterator I =
CurModule.LateResolveTypes.find(D);
if (I != CurModule.LateResolveTypes.end()) {
((DerivedType*)I->second.get())->refineAbstractTypeTo(ToTy);
CurModule.LateResolveTypes.erase(I);
}
}
// setValueName - Set the specified value to the name given. The name may be
// null potentially, in which case this is a noop. The string passed in is
// assumed to be a malloc'd string buffer, and is free'd by this function.
//
static void setValueName(Value *V, char *NameStr) {
if (!NameStr) return;
std::string Name(NameStr); // Copy string
free(NameStr); // Free old string
if (V->getType() == Type::VoidTy) {
GenerateError("Can't assign name '" + Name+"' to value with void type");
return;
}
assert(inFunctionScope() && "Must be in function scope!");
ValueSymbolTable &ST = CurFun.CurrentFunction->getValueSymbolTable();
if (ST.lookup(Name)) {
GenerateError("Redefinition of value '" + Name + "' of type '" +
V->getType()->getDescription() + "'");
return;
}
// Set the name.
V->setName(Name);
}
/// ParseGlobalVariable - Handle parsing of a global. If Initializer is null,
/// this is a declaration, otherwise it is a definition.
static GlobalVariable *
ParseGlobalVariable(char *NameStr,
GlobalValue::LinkageTypes Linkage,
GlobalValue::VisibilityTypes Visibility,
bool isConstantGlobal, const Type *Ty,
Constant *Initializer, bool IsThreadLocal) {
if (isa<FunctionType>(Ty)) {
GenerateError("Cannot declare global vars of function type");
return 0;
}
const PointerType *PTy = PointerType::get(Ty);
std::string Name;
if (NameStr) {
Name = NameStr; // Copy string
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::createGlobalName((char*)Name.c_str());
} else {
ID = ValID::createGlobalID(CurModule.Values.size());
}
if (GlobalValue *FWGV = CurModule.GetForwardRefForGlobal(PTy, ID)) {
// Move the global to the end of the list, from whereever it was
// previously inserted.
GlobalVariable *GV = cast<GlobalVariable>(FWGV);
CurModule.CurrentModule->getGlobalList().remove(GV);
CurModule.CurrentModule->getGlobalList().push_back(GV);
GV->setInitializer(Initializer);
GV->setLinkage(Linkage);
GV->setVisibility(Visibility);
GV->setConstant(isConstantGlobal);
GV->setThreadLocal(IsThreadLocal);
InsertValue(GV, CurModule.Values);
return GV;
}
// If this global has a name
if (!Name.empty()) {
// if the global we're parsing has an initializer (is a definition) and
// has external linkage.
if (Initializer && Linkage != GlobalValue::InternalLinkage)
// If there is already a global with external linkage with this name
if (CurModule.CurrentModule->getGlobalVariable(Name, false)) {
// If we allow this GVar to get created, it will be renamed in the
// symbol table because it conflicts with an existing GVar. We can't
// allow redefinition of GVars whose linking indicates that their name
// must stay the same. Issue the error.
GenerateError("Redefinition of global variable named '" + Name +
"' of type '" + Ty->getDescription() + "'");
return 0;
}
}
// Otherwise there is no existing GV to use, create one now.
GlobalVariable *GV =
new GlobalVariable(Ty, isConstantGlobal, Linkage, Initializer, Name,
CurModule.CurrentModule, IsThreadLocal);
GV->setVisibility(Visibility);
InsertValue(GV, CurModule.Values);
return GV;
}
// setTypeName - Set the specified type to the name given. The name may be
// null potentially, in which case this is a noop. The string passed in is
// assumed to be a malloc'd string buffer, and is freed by this function.
//
// This function returns true if the type has already been defined, but is
// allowed to be redefined in the specified context. If the name is a new name
// for the type plane, it is inserted and false is returned.
static bool setTypeName(const Type *T, char *NameStr) {
assert(!inFunctionScope() && "Can't give types function-local names!");
if (NameStr == 0) return false;
std::string Name(NameStr); // Copy string
free(NameStr); // Free old string
// We don't allow assigning names to void type
if (T == Type::VoidTy) {
GenerateError("Can't assign name '" + Name + "' to the void type");
return false;
}
// Set the type name, checking for conflicts as we do so.
bool AlreadyExists = CurModule.CurrentModule->addTypeName(Name, T);
if (AlreadyExists) { // Inserting a name that is already defined???
const Type *Existing = CurModule.CurrentModule->getTypeByName(Name);
assert(Existing && "Conflict but no matching type?!");
// There is only one case where this is allowed: when we are refining an
// opaque type. In this case, Existing will be an opaque type.
if (const OpaqueType *OpTy = dyn_cast<OpaqueType>(Existing)) {
// We ARE replacing an opaque type!
const_cast<OpaqueType*>(OpTy)->refineAbstractTypeTo(T);
return true;
}
// Otherwise, this is an attempt to redefine a type. That's okay if
// the redefinition is identical to the original. This will be so if
// Existing and T point to the same Type object. In this one case we
// allow the equivalent redefinition.
if (Existing == T) return true; // Yes, it's equal.
// Any other kind of (non-equivalent) redefinition is an error.
GenerateError("Redefinition of type named '" + Name + "' of type '" +
T->getDescription() + "'");
}
return false;
}
//===----------------------------------------------------------------------===//
// Code for handling upreferences in type names...
//
// TypeContains - Returns true if Ty directly contains E in it.
//
static bool TypeContains(const Type *Ty, const Type *E) {
return std::find(Ty->subtype_begin(), Ty->subtype_end(),
E) != Ty->subtype_end();
}
namespace {
struct UpRefRecord {
// NestingLevel - The number of nesting levels that need to be popped before
// this type is resolved.
unsigned NestingLevel;
// LastContainedTy - This is the type at the current binding level for the
// type. Every time we reduce the nesting level, this gets updated.
const Type *LastContainedTy;
// UpRefTy - This is the actual opaque type that the upreference is
// represented with.
OpaqueType *UpRefTy;
UpRefRecord(unsigned NL, OpaqueType *URTy)
: NestingLevel(NL), LastContainedTy(URTy), UpRefTy(URTy) {}
};
}
// UpRefs - A list of the outstanding upreferences that need to be resolved.
static std::vector<UpRefRecord> UpRefs;
/// HandleUpRefs - Every time we finish a new layer of types, this function is
/// called. It loops through the UpRefs vector, which is a list of the
/// currently active types. For each type, if the up reference is contained in
/// the newly completed type, we decrement the level count. When the level
/// count reaches zero, the upreferenced type is the type that is passed in:
/// thus we can complete the cycle.
///
static PATypeHolder HandleUpRefs(const Type *ty) {
// If Ty isn't abstract, or if there are no up-references in it, then there is
// nothing to resolve here.
if (!ty->isAbstract() || UpRefs.empty()) return ty;
PATypeHolder Ty(ty);
UR_OUT("Type '" << Ty->getDescription() <<
"' newly formed. Resolving upreferences.\n" <<
UpRefs.size() << " upreferences active!\n");
// If we find any resolvable upreferences (i.e., those whose NestingLevel goes
// to zero), we resolve them all together before we resolve them to Ty. At
// the end of the loop, if there is anything to resolve to Ty, it will be in
// this variable.
OpaqueType *TypeToResolve = 0;
for (unsigned i = 0; i != UpRefs.size(); ++i) {
UR_OUT(" UR#" << i << " - TypeContains(" << Ty->getDescription() << ", "
<< UpRefs[i].second->getDescription() << ") = "
<< (TypeContains(Ty, UpRefs[i].second) ? "true" : "false") << "\n");
if (TypeContains(Ty, UpRefs[i].LastContainedTy)) {
// Decrement level of upreference
unsigned Level = --UpRefs[i].NestingLevel;
UpRefs[i].LastContainedTy = Ty;
UR_OUT(" Uplevel Ref Level = " << Level << "\n");
if (Level == 0) { // Upreference should be resolved!
if (!TypeToResolve) {
TypeToResolve = UpRefs[i].UpRefTy;
} else {
UR_OUT(" * Resolving upreference for "
<< UpRefs[i].second->getDescription() << "\n";
std::string OldName = UpRefs[i].UpRefTy->getDescription());
UpRefs[i].UpRefTy->refineAbstractTypeTo(TypeToResolve);
UR_OUT(" * Type '" << OldName << "' refined upreference to: "
<< (const void*)Ty << ", " << Ty->getDescription() << "\n");
}
UpRefs.erase(UpRefs.begin()+i); // Remove from upreference list...
--i; // Do not skip the next element...
}
}
}
if (TypeToResolve) {
UR_OUT(" * Resolving upreference for "
<< UpRefs[i].second->getDescription() << "\n";
std::string OldName = TypeToResolve->getDescription());
TypeToResolve->refineAbstractTypeTo(Ty);
}
return Ty;
}
//===----------------------------------------------------------------------===//
// RunVMAsmParser - Define an interface to this parser
//===----------------------------------------------------------------------===//
//
static Module* RunParser(Module * M);
Module *llvm::RunVMAsmParser(const std::string &Filename, FILE *F) {
set_scan_file(F);
CurFilename = Filename;
return RunParser(new Module(CurFilename));
}
Module *llvm::RunVMAsmParser(const char * AsmString, Module * M) {
set_scan_string(AsmString);
CurFilename = "from_memory";
if (M == NULL) {
return RunParser(new Module (CurFilename));
} else {
return RunParser(M);
}
}
/* Enabling traces. */
#ifndef YYDEBUG
# define YYDEBUG 0
#endif
/* Enabling verbose error messages. */
#ifdef YYERROR_VERBOSE
# undef YYERROR_VERBOSE
# define YYERROR_VERBOSE 1
#else
# define YYERROR_VERBOSE 0
#endif
#ifndef YYSTYPE
#line 955 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
typedef union {
llvm::Module *ModuleVal;
llvm::Function *FunctionVal;
llvm::BasicBlock *BasicBlockVal;
llvm::TerminatorInst *TermInstVal;
llvm::Instruction *InstVal;
llvm::Constant *ConstVal;
const llvm::Type *PrimType;
std::list<llvm::PATypeHolder> *TypeList;
llvm::PATypeHolder *TypeVal;
llvm::Value *ValueVal;
std::vector<llvm::Value*> *ValueList;
llvm::ArgListType *ArgList;
llvm::TypeWithAttrs TypeWithAttrs;
llvm::TypeWithAttrsList *TypeWithAttrsList;
llvm::ValueRefList *ValueRefList;
// Represent the RHS of PHI node
std::list<std::pair<llvm::Value*,
llvm::BasicBlock*> > *PHIList;
std::vector<std::pair<llvm::Constant*, llvm::BasicBlock*> > *JumpTable;
std::vector<llvm::Constant*> *ConstVector;
llvm::GlobalValue::LinkageTypes Linkage;
llvm::GlobalValue::VisibilityTypes Visibility;
uint16_t ParamAttrs;
llvm::APInt *APIntVal;
int64_t SInt64Val;
uint64_t UInt64Val;
int SIntVal;
unsigned UIntVal;
double FPVal;
bool BoolVal;
char *StrVal; // This memory is strdup'd!
llvm::ValID ValIDVal; // strdup'd memory maybe!
llvm::Instruction::BinaryOps BinaryOpVal;
llvm::Instruction::TermOps TermOpVal;
llvm::Instruction::MemoryOps MemOpVal;
llvm::Instruction::CastOps CastOpVal;
llvm::Instruction::OtherOps OtherOpVal;
llvm::ICmpInst::Predicate IPredicate;
llvm::FCmpInst::Predicate FPredicate;
} yystype;
/* Line 188 of /usr/local/share/bison/yacc.c. */
#line 1340 "llvmAsmParser.tab.c"
# define YYSTYPE yystype
# define YYSTYPE_IS_TRIVIAL 1
#endif
#ifndef YYLTYPE
typedef struct yyltype
{
int first_line;
int first_column;
int last_line;
int last_column;
} yyltype;
# define YYLTYPE yyltype
# define YYLTYPE_IS_TRIVIAL 1
#endif
/* Copy the second part of user declarations. */
/* Line 213 of /usr/local/share/bison/yacc.c. */
#line 1361 "llvmAsmParser.tab.c"
#if ! defined (yyoverflow) || YYERROR_VERBOSE
/* The parser invokes alloca or malloc; define the necessary symbols. */
# if YYSTACK_USE_ALLOCA
# define YYSTACK_ALLOC alloca
# else
# ifndef YYSTACK_USE_ALLOCA
# if defined (alloca) || defined (_ALLOCA_H)
# define YYSTACK_ALLOC alloca
# else
# ifdef __GNUC__
# define YYSTACK_ALLOC __builtin_alloca
# endif
# 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 malloc
# define YYSTACK_FREE free
# endif
#endif /* ! defined (yyoverflow) || YYERROR_VERBOSE */
#if (! defined (yyoverflow) \
&& (! defined (__cplusplus) \
|| (YYLTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
/* A type that is properly aligned for any stack member. */
union yyalloc
{
short yyss;
YYSTYPE yyvs;
};
/* The size of the maximum gap between one aligned stack and the next. */
# define YYSTACK_GAP_MAX (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) + sizeof (YYSTYPE)) \
+ YYSTACK_GAP_MAX)
/* Copy COUNT objects from FROM to TO. The source and destination do
not overlap. */
# ifndef YYCOPY
# if 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_MAX; \
yyptr += yynewbytes / sizeof (*yyptr); \
} \
while (0)
#endif
#if defined (__STDC__) || defined (__cplusplus)
typedef signed char yysigned_char;
#else
typedef short yysigned_char;
#endif
/* YYFINAL -- State number of the termination state. */
#define YYFINAL 41
#define YYLAST 1600
/* YYNTOKENS -- Number of terminals. */
#define YYNTOKENS 150
/* YYNNTS -- Number of nonterminals. */
#define YYNNTS 82
/* YYNRULES -- Number of rules. */
#define YYNRULES 296
/* YYNRULES -- Number of states. */
#define YYNSTATES 580
/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */
#define YYUNDEFTOK 2
#define YYMAXUTOK 390
#define YYTRANSLATE(X) \
((unsigned)(X) <= YYMAXUTOK ? yytranslate[X] : YYUNDEFTOK)
/* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */
static const unsigned char yytranslate[] =
{
0, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
140, 141, 138, 2, 137, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
145, 136, 146, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 142, 139, 144, 2, 2, 2, 2, 2, 149,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
143, 2, 2, 147, 2, 148, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 1, 2, 3, 4,
5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
15, 16, 17, 18, 19, 20, 21, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 33, 34,
35, 36, 37, 38, 39, 40, 41, 42, 43, 44,
45, 46, 47, 48, 49, 50, 51, 52, 53, 54,
55, 56, 57, 58, 59, 60, 61, 62, 63, 64,
65, 66, 67, 68, 69, 70, 71, 72, 73, 74,
75, 76, 77, 78, 79, 80, 81, 82, 83, 84,
85, 86, 87, 88, 89, 90, 91, 92, 93, 94,
95, 96, 97, 98, 99, 100, 101, 102, 103, 104,
105, 106, 107, 108, 109, 110, 111, 112, 113, 114,
115, 116, 117, 118, 119, 120, 121, 122, 123, 124,
125, 126, 127, 128, 129, 130, 131, 132, 133, 134,
135
};
#if YYDEBUG
/* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in
YYRHS. */
static const unsigned short yyprhs[] =
{
0, 0, 3, 5, 7, 9, 11, 13, 15, 17,
19, 21, 23, 25, 27, 29, 31, 33, 35, 37,
39, 41, 43, 45, 47, 49, 51, 53, 55, 57,
59, 61, 63, 65, 67, 69, 71, 73, 75, 77,
79, 81, 83, 85, 87, 89, 91, 93, 95, 97,
99, 101, 103, 105, 107, 109, 111, 113, 115, 117,
119, 121, 122, 125, 126, 128, 130, 132, 133, 136,
138, 140, 142, 144, 146, 148, 150, 152, 153, 155,
157, 158, 160, 162, 163, 165, 167, 169, 171, 172,
174, 176, 177, 179, 181, 183, 185, 187, 190, 192,
194, 196, 198, 199, 202, 204, 206, 208, 209, 212,
213, 216, 217, 221, 224, 225, 227, 228, 232, 234,
237, 239, 241, 243, 245, 247, 249, 252, 254, 257,
263, 269, 275, 281, 285, 288, 294, 299, 302, 304,
306, 308, 312, 314, 318, 320, 321, 323, 327, 332,
336, 340, 345, 350, 354, 361, 367, 370, 373, 376,
379, 382, 385, 388, 391, 394, 397, 400, 403, 410,
416, 425, 432, 439, 447, 455, 462, 471, 480, 484,
486, 488, 490, 492, 493, 496, 503, 505, 506, 508,
511, 512, 516, 517, 521, 525, 529, 533, 534, 542,
543, 552, 553, 562, 568, 571, 575, 577, 581, 585,
589, 593, 595, 596, 602, 606, 608, 612, 614, 615,
625, 627, 629, 634, 636, 638, 641, 645, 646, 648,
650, 652, 654, 656, 658, 660, 662, 664, 668, 670,
676, 678, 680, 682, 684, 686, 688, 691, 694, 697,
701, 704, 705, 707, 710, 713, 717, 727, 737, 746,
761, 763, 765, 772, 778, 781, 788, 796, 800, 806,
807, 808, 812, 815, 817, 823, 829, 836, 843, 848,
855, 860, 865, 872, 879, 882, 891, 893, 895, 896,
900, 907, 911, 918, 921, 927, 935
};
/* YYRHS -- A `-1'-separated list of the rules' RHS. */
static const short yyrhs[] =
{
194, 0, -1, 69, -1, 70, -1, 71, -1, 72,
-1, 73, -1, 74, -1, 75, -1, 76, -1, 77,
-1, 81, -1, 82, -1, 83, -1, 78, -1, 79,
-1, 80, -1, 112, -1, 113, -1, 114, -1, 115,
-1, 116, -1, 117, -1, 118, -1, 119, -1, 120,
-1, 121, -1, 122, -1, 123, -1, 86, -1, 87,
-1, 88, -1, 89, -1, 90, -1, 91, -1, 92,
-1, 93, -1, 94, -1, 95, -1, 96, -1, 97,
-1, 98, -1, 99, -1, 100, -1, 101, -1, 102,
-1, 103, -1, 104, -1, 105, -1, 92, -1, 93,
-1, 94, -1, 95, -1, 22, -1, 23, -1, 11,
-1, 12, -1, 13, -1, 16, -1, 19, -1, 158,
-1, -1, 158, 136, -1, -1, 17, -1, 20, -1,
163, -1, -1, 161, 136, -1, 38, -1, 40, -1,
39, -1, 41, -1, 43, -1, 42, -1, 44, -1,
46, -1, -1, 134, -1, 135, -1, -1, 42, -1,
44, -1, -1, 38, -1, 39, -1, 40, -1, 43,
-1, -1, 40, -1, 38, -1, -1, 57, -1, 58,
-1, 59, -1, 60, -1, 61, -1, 56, 4, -1,
113, -1, 114, -1, 131, -1, 132, -1, -1, 172,
171, -1, 130, -1, 133, -1, 171, -1, -1, 174,
173, -1, -1, 49, 4, -1, -1, 137, 49, 4,
-1, 30, 19, -1, -1, 177, -1, -1, 137, 180,
179, -1, 177, -1, 49, 4, -1, 11, -1, 12,
-1, 13, -1, 14, -1, 45, -1, 181, -1, 182,
138, -1, 216, -1, 139, 4, -1, 182, 140, 186,
141, 174, -1, 10, 140, 186, 141, 174, -1, 142,
4, 143, 182, 144, -1, 145, 4, 143, 182, 146,
-1, 147, 187, 148, -1, 147, 148, -1, 145, 147,
187, 148, 146, -1, 145, 147, 148, 146, -1, 182,
172, -1, 182, -1, 10, -1, 183, -1, 185, 137,
183, -1, 185, -1, 185, 137, 35, -1, 35, -1,
-1, 182, -1, 187, 137, 182, -1, 182, 142, 190,
144, -1, 182, 142, 144, -1, 182, 149, 19, -1,
182, 145, 190, 146, -1, 182, 147, 190, 148, -1,
182, 147, 148, -1, 182, 145, 147, 190, 148, 146,
-1, 182, 145, 147, 148, 146, -1, 182, 36, -1,
182, 37, -1, 182, 216, -1, 182, 189, -1, 182,
21, -1, 156, 3, -1, 156, 5, -1, 156, 4,
-1, 156, 6, -1, 11, 22, -1, 11, 23, -1,
157, 9, -1, 153, 140, 188, 34, 182, 141, -1,
111, 140, 188, 227, 141, -1, 125, 140, 188, 137,
188, 137, 188, 141, -1, 151, 140, 188, 137, 188,
141, -1, 152, 140, 188, 137, 188, 141, -1, 84,
154, 140, 188, 137, 188, 141, -1, 85, 155, 140,
188, 137, 188, 141, -1, 127, 140, 188, 137, 188,
141, -1, 128, 140, 188, 137, 188, 137, 188, 141,
-1, 129, 140, 188, 137, 188, 137, 188, 141, -1,
190, 137, 188, -1, 188, -1, 28, -1, 29, -1,
33, -1, -1, 184, 216, -1, 117, 140, 193, 34,
182, 141, -1, 195, -1, -1, 196, -1, 195, 196,
-1, -1, 27, 197, 212, -1, -1, 26, 198, 213,
-1, 54, 53, 202, -1, 160, 15, 182, -1, 160,
15, 10, -1, -1, 162, 166, 192, 191, 188, 199,
179, -1, -1, 162, 164, 166, 192, 191, 188, 200,
179, -1, -1, 162, 165, 166, 192, 191, 182, 201,
179, -1, 162, 166, 31, 169, 193, -1, 47, 203,
-1, 50, 136, 204, -1, 19, -1, 48, 136, 19,
-1, 62, 136, 19, -1, 142, 205, 144, -1, 205,
137, 19, -1, 19, -1, -1, 206, 137, 182, 172,
159, -1, 182, 172, 159, -1, 206, -1, 206, 137,
35, -1, 35, -1, -1, 170, 184, 161, 140, 207,
141, 174, 178, 175, -1, 24, -1, 147, -1, 168,
166, 208, 209, -1, 25, -1, 148, -1, 219, 211,
-1, 167, 166, 208, -1, -1, 55, -1, 3, -1,
4, -1, 9, -1, 22, -1, 23, -1, 36, -1,
37, -1, 21, -1, 145, 190, 146, -1, 189, -1,
53, 214, 19, 137, 19, -1, 7, -1, 8, -1,
158, -1, 161, -1, 216, -1, 215, -1, 182, 217,
-1, 219, 220, -1, 210, 220, -1, 221, 160, 222,
-1, 221, 224, -1, -1, 18, -1, 63, 218, -1,
63, 10, -1, 64, 14, 217, -1, 64, 11, 217,
137, 14, 217, 137, 14, 217, -1, 65, 156, 217,
137, 14, 217, 142, 223, 144, -1, 65, 156, 217,
137, 14, 217, 142, 144, -1, 66, 170, 184, 217,
140, 226, 141, 174, 34, 14, 217, 67, 14, 217,
-1, 67, -1, 68, -1, 223, 156, 215, 137, 14,
217, -1, 156, 215, 137, 14, 217, -1, 160, 229,
-1, 182, 142, 217, 137, 217, 144, -1, 225, 137,
142, 217, 137, 217, 144, -1, 182, 217, 172, -1,
226, 137, 182, 217, 172, -1, -1, -1, 227, 137,
218, -1, 52, 51, -1, 51, -1, 151, 182, 217,
137, 217, -1, 152, 182, 217, 137, 217, -1, 84,
154, 182, 217, 137, 217, -1, 85, 155, 182, 217,
137, 217, -1, 153, 218, 34, 182, -1, 125, 218,
137, 218, 137, 218, -1, 126, 218, 137, 182, -1,
127, 218, 137, 218, -1, 128, 218, 137, 218, 137,
218, -1, 129, 218, 137, 218, 137, 218, -1, 124,
225, -1, 228, 170, 184, 217, 140, 226, 141, 174,
-1, 231, -1, 32, -1, -1, 106, 182, 176, -1,
106, 182, 137, 11, 217, 176, -1, 107, 182, 176,
-1, 107, 182, 137, 11, 217, 176, -1, 108, 218,
-1, 230, 109, 182, 217, 176, -1, 230, 110, 218,
137, 182, 217, 176, -1, 111, 182, 217, 227, -1
};
/* YYRLINE[YYN] -- source line where rule number YYN was defined. */
static const unsigned short yyrline[] =
{
0, 1111, 1111, 1111, 1111, 1111, 1111, 1111, 1111, 1111,
1111, 1112, 1112, 1112, 1112, 1112, 1112, 1113, 1113, 1113,
1113, 1113, 1113, 1113, 1114, 1114, 1114, 1114, 1114, 1117,
1117, 1118, 1118, 1119, 1119, 1120, 1120, 1121, 1121, 1125,
1125, 1126, 1126, 1127, 1127, 1128, 1128, 1129, 1129, 1130,
1130, 1131, 1131, 1132, 1133, 1138, 1139, 1139, 1141, 1141,
1142, 1142, 1146, 1150, 1155, 1155, 1157, 1158, 1163, 1169,
1170, 1171, 1172, 1173, 1177, 1178, 1179, 1183, 1184, 1185,
1189, 1190, 1191, 1195, 1196, 1197, 1198, 1199, 1203, 1204,
1205, 1208, 1208, 1209, 1210, 1211, 1212, 1213, 1221, 1222,
1223, 1224, 1227, 1228, 1233, 1234, 1235, 1238, 1239, 1246,
1246, 1253, 1253, 1262, 1270, 1270, 1276, 1276, 1278, 1283,
1296, 1296, 1296, 1296, 1299, 1303, 1307, 1314, 1319, 1327,
1357, 1388, 1393, 1405, 1415, 1419, 1429, 1436, 1443, 1450,
1455, 1460, 1467, 1468, 1475, 1482, 1490, 1496, 1508, 1536,
1552, 1581, 1609, 1635, 1655, 1681, 1701, 1713, 1720, 1786,
1796, 1806, 1812, 1822, 1828, 1838, 1843, 1848, 1856, 1868,
1890, 1898, 1904, 1915, 1920, 1925, 1931, 1937, 1946, 1950,
1958, 1958, 1961, 1961, 1964, 1975, 1996, 2001, 2009, 2010,
2014, 2014, 2018, 2018, 2021, 2024, 2048, 2059, 2059, 2070,
2069, 2079, 2078, 2089, 2104, 2107, 2113, 2126, 2130, 2135,
2137, 2142, 2147, 2156, 2166, 2177, 2181, 2190, 2199, 2204,
2326, 2326, 2328, 2337, 2337, 2339, 2344, 2356, 2360, 2365,
2369, 2373, 2377, 2381, 2385, 2389, 2393, 2397, 2422, 2426,
2440, 2444, 2448, 2452, 2458, 2458, 2464, 2473, 2477, 2486,
2495, 2504, 2508, 2513, 2517, 2521, 2526, 2536, 2555, 2564,
2644, 2648, 2655, 2666, 2679, 2689, 2700, 2710, 2719, 2728,
2731, 2732, 2739, 2743, 2748, 2769, 2786, 2800, 2814, 2826,
2834, 2841, 2847, 2853, 2859, 2874, 2959, 2964, 2968, 2975,
2982, 2990, 2997, 3005, 3013, 3027, 3044
};
#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", "ESAPINTVAL",
"EUAPINTVAL", "LOCALVAL_ID", "GLOBALVAL_ID", "FPVAL", "VOID", "INTTYPE",
"FLOAT", "DOUBLE", "LABEL", "TYPE", "LOCALVAR", "GLOBALVAR", "LABELSTR",
"STRINGCONSTANT", "ATSTRINGCONSTANT", "ZEROINITIALIZER", "TRUETOK",
"FALSETOK", "BEGINTOK", "ENDTOK", "DECLARE", "DEFINE", "GLOBAL",
"CONSTANT", "SECTION", "ALIAS", "VOLATILE", "THREAD_LOCAL", "TO",
"DOTDOTDOT", "NULL_TOK", "UNDEF", "INTERNAL", "LINKONCE", "WEAK",
"APPENDING", "DLLIMPORT", "DLLEXPORT", "EXTERN_WEAK", "OPAQUE",
"EXTERNAL", "TARGET", "TRIPLE", "ALIGN", "DEPLIBS", "CALL", "TAIL",
"ASM_TOK", "MODULE", "SIDEEFFECT", "CC_TOK", "CCC_TOK", "FASTCC_TOK",
"COLDCC_TOK", "X86_STDCALLCC_TOK", "X86_FASTCALLCC_TOK", "DATALAYOUT",
"RET", "BR", "SWITCH", "INVOKE", "UNWIND", "UNREACHABLE", "ADD", "SUB",
"MUL", "UDIV", "SDIV", "FDIV", "UREM", "SREM", "FREM", "AND", "OR",
"XOR", "SHL", "LSHR", "ASHR", "ICMP", "FCMP", "EQ", "NE", "SLT", "SGT",
"SLE", "SGE", "ULT", "UGT", "ULE", "UGE", "OEQ", "ONE", "OLT", "OGT",
"OLE", "OGE", "ORD", "UNO", "UEQ", "UNE", "MALLOC", "ALLOCA", "FREE",
"LOAD", "STORE", "GETELEMENTPTR", "TRUNC", "ZEXT", "SEXT", "FPTRUNC",
"FPEXT", "BITCAST", "UITOFP", "SITOFP", "FPTOUI", "FPTOSI", "INTTOPTR",
"PTRTOINT", "PHI_TOK", "SELECT", "VAARG", "EXTRACTELEMENT",
"INSERTELEMENT", "SHUFFLEVECTOR", "NORETURN", "INREG", "SRET",
"NOUNWIND", "DEFAULT", "HIDDEN", "'='", "','", "'*'", "'\\\\'", "'('",
"')'", "'['", "'x'", "']'", "'<'", "'>'", "'{'", "'}'", "'c'",
"$accept", "ArithmeticOps", "LogicalOps", "CastOps", "IPredicates",
"FPredicates", "IntType", "FPType", "LocalName", "OptLocalName",
"OptLocalAssign", "GlobalName", "OptGlobalAssign", "GlobalAssign",
"GVInternalLinkage", "GVExternalLinkage", "GVVisibilityStyle",
"FunctionDeclareLinkage", "FunctionDefineLinkage", "AliasLinkage",
"OptCallingConv", "ParamAttr", "OptParamAttrs", "FuncAttr",
"OptFuncAttrs", "OptAlign", "OptCAlign", "SectionString", "OptSection",
"GlobalVarAttributes", "GlobalVarAttribute", "PrimType", "Types",
"ArgType", "ResultTypes", "ArgTypeList", "ArgTypeListI", "TypeListI",
"ConstVal", "ConstExpr", "ConstVector", "GlobalType", "ThreadLocal",
"AliaseeRef", "Module", "DefinitionList", "Definition", "@1", "@2",
"@3", "@4", "@5", "AsmBlock", "TargetDefinition", "LibrariesDefinition",
"LibList", "ArgListH", "ArgList", "FunctionHeaderH", "BEGIN",
"FunctionHeader", "END", "Function", "FunctionProto", "OptSideEffect",
"ConstValueRef", "SymbolicValueRef", "ValueRef", "ResolvedVal",
"BasicBlockList", "BasicBlock", "InstructionList", "BBTerminatorInst",
"JumpTable", "Inst", "PHIList", "ValueRefList", "IndexList",
"OptTailCall", "InstVal", "OptVolatile", "MemoryInst", 0
};
#endif
# ifdef YYPRINT
/* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to
token YYLEX-NUM. */
static const unsigned short yytoknum[] =
{
0, 256, 257, 258, 259, 260, 261, 262, 263, 264,
265, 266, 267, 268, 269, 270, 271, 272, 273, 274,
275, 276, 277, 278, 279, 280, 281, 282, 283, 284,
285, 286, 287, 288, 289, 290, 291, 292, 293, 294,
295, 296, 297, 298, 299, 300, 301, 302, 303, 304,
305, 306, 307, 308, 309, 310, 311, 312, 313, 314,
315, 316, 317, 318, 319, 320, 321, 322, 323, 324,
325, 326, 327, 328, 329, 330, 331, 332, 333, 334,
335, 336, 337, 338, 339, 340, 341, 342, 343, 344,
345, 346, 347, 348, 349, 350, 351, 352, 353, 354,
355, 356, 357, 358, 359, 360, 361, 362, 363, 364,
365, 366, 367, 368, 369, 370, 371, 372, 373, 374,
375, 376, 377, 378, 379, 380, 381, 382, 383, 384,
385, 386, 387, 388, 389, 390, 61, 44, 42, 92,
40, 41, 91, 120, 93, 60, 62, 123, 125, 99
};
# endif
/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
static const unsigned char yyr1[] =
{
0, 150, 151, 151, 151, 151, 151, 151, 151, 151,
151, 152, 152, 152, 152, 152, 152, 153, 153, 153,
153, 153, 153, 153, 153, 153, 153, 153, 153, 154,
154, 154, 154, 154, 154, 154, 154, 154, 154, 155,
155, 155, 155, 155, 155, 155, 155, 155, 155, 155,
155, 155, 155, 155, 155, 156, 157, 157, 158, 158,
159, 159, 160, 160, 161, 161, 162, 162, 163, 164,
164, 164, 164, 164, 165, 165, 165, 166, 166, 166,
167, 167, 167, 168, 168, 168, 168, 168, 169, 169,
169, 170, 170, 170, 170, 170, 170, 170, 171, 171,
171, 171, 172, 172, 173, 173, 173, 174, 174, 175,
175, 176, 176, 177, 178, 178, 179, 179, 180, 180,
181, 181, 181, 181, 182, 182, 182, 182, 182, 182,
182, 182, 182, 182, 182, 182, 182, 183, 184, 184,
185, 185, 186, 186, 186, 186, 187, 187, 188, 188,
188, 188, 188, 188, 188, 188, 188, 188, 188, 188,
188, 188, 188, 188, 188, 188, 188, 188, 189, 189,
189, 189, 189, 189, 189, 189, 189, 189, 190, 190,
191, 191, 192, 192, 193, 193, 194, 194, 195, 195,
197, 196, 198, 196, 196, 196, 196, 199, 196, 200,
196, 201, 196, 196, 196, 196, 202, 203, 203, 204,
205, 205, 205, 206, 206, 207, 207, 207, 207, 208,
209, 209, 210, 211, 211, 212, 213, 214, 214, 215,
215, 215, 215, 215, 215, 215, 215, 215, 215, 215,
216, 216, 216, 216, 217, 217, 218, 219, 219, 220,
221, 221, 221, 222, 222, 222, 222, 222, 222, 222,
222, 222, 223, 223, 224, 225, 225, 226, 226, 226,
227, 227, 228, 228, 229, 229, 229, 229, 229, 229,
229, 229, 229, 229, 229, 229, 229, 230, 230, 231,
231, 231, 231, 231, 231, 231, 231
};
/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */
static const unsigned char yyr2[] =
{
0, 2, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 0, 2, 0, 1, 1, 1, 0, 2, 1,
1, 1, 1, 1, 1, 1, 1, 0, 1, 1,
0, 1, 1, 0, 1, 1, 1, 1, 0, 1,
1, 0, 1, 1, 1, 1, 1, 2, 1, 1,
1, 1, 0, 2, 1, 1, 1, 0, 2, 0,
2, 0, 3, 2, 0, 1, 0, 3, 1, 2,
1, 1, 1, 1, 1, 1, 2, 1, 2, 5,
5, 5, 5, 3, 2, 5, 4, 2, 1, 1,
1, 3, 1, 3, 1, 0, 1, 3, 4, 3,
3, 4, 4, 3, 6, 5, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 6, 5,
8, 6, 6, 7, 7, 6, 8, 8, 3, 1,
1, 1, 1, 0, 2, 6, 1, 0, 1, 2,
0, 3, 0, 3, 3, 3, 3, 0, 7, 0,
8, 0, 8, 5, 2, 3, 1, 3, 3, 3,
3, 1, 0, 5, 3, 1, 3, 1, 0, 9,
1, 1, 4, 1, 1, 2, 3, 0, 1, 1,
1, 1, 1, 1, 1, 1, 1, 3, 1, 5,
1, 1, 1, 1, 1, 1, 2, 2, 2, 3,
2, 0, 1, 2, 2, 3, 9, 9, 8, 14,
1, 1, 6, 5, 2, 6, 7, 3, 5, 0,
0, 3, 2, 1, 5, 5, 6, 6, 4, 6,
4, 4, 6, 6, 2, 8, 1, 1, 0, 3,
6, 3, 6, 2, 5, 7, 4
};
/* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state
STATE-NUM when YYTABLE doesn't specify something else to do. Zero
means the default is an error. */
static const unsigned short yydefact[] =
{
67, 58, 64, 59, 65, 192, 190, 0, 0, 0,
0, 0, 0, 77, 66, 0, 67, 188, 80, 83,
0, 0, 204, 0, 0, 62, 0, 68, 69, 71,
70, 72, 74, 73, 75, 76, 78, 79, 77, 77,
183, 1, 189, 81, 82, 77, 193, 84, 85, 86,
87, 77, 251, 191, 251, 0, 0, 212, 205, 206,
194, 240, 241, 196, 120, 121, 122, 123, 124, 0,
0, 0, 0, 242, 243, 125, 195, 127, 183, 183,
88, 182, 0, 91, 91, 252, 248, 63, 223, 224,
225, 247, 207, 208, 211, 0, 145, 128, 0, 0,
0, 0, 134, 146, 0, 126, 145, 0, 0, 90,
89, 0, 180, 181, 0, 0, 92, 93, 94, 95,
96, 0, 226, 0, 288, 250, 0, 209, 144, 102,
140, 142, 0, 0, 0, 0, 0, 0, 133, 0,
0, 0, 139, 0, 138, 0, 203, 120, 121, 122,
0, 0, 0, 197, 97, 0, 220, 221, 222, 287,
273, 0, 0, 0, 0, 91, 260, 261, 2, 3,
4, 5, 6, 7, 8, 9, 10, 14, 15, 16,
11, 12, 13, 0, 0, 0, 0, 0, 0, 17,
18, 19, 20, 21, 22, 23, 24, 25, 26, 27,
28, 0, 0, 0, 0, 0, 0, 0, 0, 0,
249, 91, 264, 0, 286, 210, 137, 0, 107, 0,
0, 136, 0, 147, 107, 199, 201, 0, 184, 165,
166, 161, 163, 162, 164, 167, 160, 156, 157, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 159, 158, 116, 0, 272, 254, 0,
253, 0, 0, 55, 0, 0, 29, 30, 31, 32,
33, 34, 35, 36, 37, 38, 0, 53, 54, 49,
50, 51, 52, 39, 40, 41, 42, 43, 44, 45,
46, 47, 48, 0, 111, 111, 293, 0, 0, 284,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 98, 99, 100, 101, 103, 143, 141, 130, 131,
132, 135, 129, 116, 116, 0, 0, 0, 0, 0,
0, 0, 0, 149, 179, 0, 0, 0, 153, 0,
150, 0, 0, 0, 0, 198, 218, 229, 230, 231,
236, 232, 233, 234, 235, 227, 0, 238, 245, 244,
246, 0, 255, 0, 0, 0, 0, 0, 289, 0,
291, 270, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 104, 105, 106, 108, 200,
202, 0, 0, 0, 270, 0, 0, 0, 0, 0,
148, 134, 146, 0, 151, 152, 0, 0, 0, 0,
0, 118, 116, 217, 102, 215, 0, 228, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 296, 0,
0, 0, 280, 281, 0, 0, 0, 0, 278, 0,
111, 0, 0, 0, 0, 0, 0, 0, 0, 0,
178, 155, 0, 0, 0, 0, 113, 119, 117, 61,
0, 107, 0, 237, 0, 0, 269, 0, 0, 111,
112, 111, 0, 0, 0, 0, 0, 0, 274, 275,
269, 0, 294, 0, 185, 0, 0, 169, 0, 0,
0, 0, 154, 0, 0, 0, 60, 214, 216, 102,
114, 0, 0, 0, 0, 0, 276, 277, 290, 292,
271, 0, 0, 279, 282, 283, 0, 111, 0, 0,
0, 175, 0, 0, 171, 172, 168, 61, 115, 109,
239, 0, 0, 102, 0, 107, 265, 0, 107, 295,
173, 174, 0, 0, 0, 213, 0, 219, 0, 258,
0, 0, 267, 0, 0, 266, 285, 170, 176, 177,
110, 256, 0, 257, 0, 102, 0, 0, 0, 268,
0, 0, 0, 0, 263, 0, 0, 262, 0, 259
};
/* YYDEFGOTO[NTERM-NUM]. */
static const short yydefgoto[] =
{
-1, 250, 251, 252, 276, 293, 150, 151, 73, 497,
11, 74, 13, 14, 38, 39, 40, 45, 51, 111,
121, 315, 216, 388, 318, 547, 368, 411, 529, 345,
412, 75, 152, 130, 145, 131, 132, 104, 334, 357,
335, 114, 82, 146, 15, 16, 17, 19, 18, 255,
323, 324, 60, 22, 58, 95, 415, 416, 122, 158,
52, 90, 53, 46, 418, 358, 77, 360, 260, 54,
86, 87, 210, 551, 125, 299, 505, 428, 211, 212,
213, 214
};
/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
STATE-NUM. */
#define YYPACT_NINF -472
static const short yypact[] =
{
50, -472, -472, -472, -472, -472, -472, -20, -110, 93,
-64, 160, 68, 14, -472, 185, 203, -472, 77, 199,
76, 81, -472, 79, 205, -472, 1214, -472, -472, -472,
-472, -472, -472, -472, -472, -472, -472, -472, 56, 56,
137, -472, -472, -472, -472, 56, -472, -472, -472, -472,
-472, 56, 210, -472, 2, 236, 246, 277, -472, -472,
-472, -472, -472, 170, -472, -472, -472, -472, -472, 315,
318, 6, 368, -472, -472, -472, 154, -472, 287, 287,
255, -472, 207, 281, 281, -472, -472, 82, -472, -472,
-472, -472, -472, -472, -472, -1, 1109, -472, 184, 188,
685, 170, -472, 154, -49, -472, 1109, 207, 207, -472,
-472, 777, -472, -472, 1230, 326, -472, -472, -472, -472,
-472, 1269, -472, -7, 1471, -472, 324, -472, -472, 154,
-472, 208, 206, 1312, 1312, 200, -43, 1312, -472, 213,
1230, 1312, 170, 215, 154, 316, -472, 40, 339, 350,
256, 352, 856, -472, -472, 86, -472, -472, -472, -472,
-472, 311, 1372, 187, 356, 281, -472, -472, -472, -472,
-472, -472, -472, -472, -472, -472, -472, -472, -472, -472,
-472, -472, -472, 394, 177, 1312, 1312, 1312, 1312, -472,
-472, -472, -472, -472, -472, -472, -472, -472, -472, -472,
-472, 1312, 1312, 1312, 1312, 1312, 1312, 1312, 1312, 1312,
-472, 281, -472, 122, -472, -472, -40, 1126, -472, 67,
49, -472, 222, 154, -472, -472, 154, 777, -472, -472,
-472, -472, -472, -472, -472, -472, -472, -472, -472, 394,
177, 229, 232, 234, 237, 243, 1156, 1386, 898, 367,
249, 251, 252, -472, -472, 257, 258, -472, 170, 606,
-472, 733, 733, -472, 733, 1269, -472, -472, -472, -472,
-472, -472, -472, -472, -472, -472, 1312, -472, -472, -472,
-472, -472, -472, -472, -472, -472, -472, -472, -472, -472,
-472, -472, -472, 1312, -89, 108, -472, 606, 116, 259,
260, 262, 263, 266, 267, 606, 606, 361, 1269, 1312,
1312, -472, -472, -472, -472, -472, -472, -472, 41, -472,
-472, -472, 41, 257, 257, 371, 268, 270, 1230, 1230,
1230, 1230, 1230, -472, -472, 15, 937, -113, -472, -35,
-472, 1230, 1230, 1230, 29, -472, 1170, -472, -472, -472,
-472, -472, -472, -472, -472, 351, 1230, -472, -472, -472,
-472, 274, -472, 275, 733, 606, 606, 12, -472, 19,
-472, -472, 733, 265, 1312, 1312, 1312, 1312, 1312, 278,
284, 1312, 733, 606, 285, -472, -472, -472, -472, -472,
-472, 1312, 1230, 1230, -472, 286, 289, 290, 291, 1230,
-472, 283, 856, -30, -472, -472, 296, 297, 403, 419,
436, -472, 257, -472, 154, 305, 302, -472, 425, -8,
431, 432, 308, 312, 317, 733, 449, 733, 321, 327,
733, 328, 154, -472, 329, 330, 733, 733, 154, 323,
332, 1312, 126, 333, 334, -57, 1230, 1230, 1230, 1230,
-472, -472, 331, 1230, 1230, 1312, -472, -472, -472, 13,
1200, -472, 335, -472, 733, 733, 1312, 733, 733, 332,
-472, 332, 1312, 733, 336, 1312, 1312, 1312, -472, -472,
1312, 426, -472, 606, -472, 1230, 1230, -472, 337, 349,
355, 358, -472, 357, 359, 149, -472, -472, -472, 154,
1, 457, 360, 354, 606, -2, -472, -472, -472, -472,
-472, 362, 733, -472, -472, -472, 28, 332, 363, 364,
1230, -472, 1230, 1230, -472, -472, -472, 13, -472, 450,
-472, 487, -3, -472, 1312, -472, -472, 370, -472, -472,
-472, -472, 376, 377, 378, -472, 498, -472, 733, -472,
986, 3, -40, 606, 83, -472, 41, -472, -472, -472,
-472, -472, 366, -472, 986, -472, 494, 497, 375, -40,
733, 733, 506, 455, -472, 733, 510, -472, 733, -472
};
/* YYPGOTO[NTERM-NUM]. */
static const short yypgoto[] =
{
-472, 401, 404, 405, 292, 294, -161, -472, 0, 8,
443, 9, -472, -472, -472, -472, 44, -472, -472, -472,
-147, -307, -409, -472, -220, -472, -283, 36, -472, -284,
-472, -472, -25, 320, -114, -472, 433, 438, -29, -150,
-226, 198, 238, 313, -472, -472, 525, -472, -472, -472,
-472, -472, -472, -472, -472, -472, -472, -472, 458, -472,
-472, -472, -472, -472, -472, -471, -139, 96, -168, -472,
489, -472, -472, -472, -472, -472, 64, 151, -472, -472,
-472, -472
};
/* 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, parse error. */
#define YYTABLE_NINF -188
static const short yytable[] =
{
10, 76, 253, 264, 322, 459, 228, 155, 263, 12,
99, 387, 370, 254, 263, 387, 10, 156, 265, 296,
85, 337, 339, 425, 399, 12, 23, 88, 20, 1,
427, 409, 3, 404, 300, 301, 302, 303, 304, 389,
390, 307, 21, -55, -55, -55, -55, 103, 367, 105,
-187, 106, 28, 29, 30, 31, 32, 33, 34, 409,
35, 426, 229, 230, 308, -63, 1, 2, 426, 3,
4, 129, 25, 311, 312, 103, 5, 6, 410, 562,
472, 129, 78, 79, 487, 153, 144, 10, 137, 83,
527, 313, 314, 568, 137, 84, 144, 7, 1, 138,
8, 3, 399, 2, 9, 222, 4, 399, 219, 220,
403, 225, 223, 405, 311, 312, 226, 566, 452, 43,
359, 44, 359, 359, 552, 359, 311, 312, 458, 399,
419, 385, 313, 314, 386, 534, 126, 259, 463, 535,
157, 549, 384, 127, 313, 314, 24, 563, 36, 37,
89, 364, 399, 100, 311, 312, 569, 482, 359, 400,
294, 295, 259, 297, 256, 534, 359, 359, 80, 538,
81, 385, 313, 314, 386, 26, 298, 259, 259, 259,
259, 259, 305, 306, 259, 41, 508, 105, 509, 106,
36, 37, 129, 387, 382, 320, 311, 312, 261, 277,
278, 262, 144, -186, 27, 105, 431, 106, 433, 434,
435, 319, 55, 385, 313, 314, 386, 56, -63, 1,
2, 57, 3, 4, 59, 359, 359, 359, 85, 5,
6, 309, 310, 359, 539, 112, 113, 47, 48, 49,
144, 500, 50, 359, 359, 369, 105, 387, 106, 387,
7, 365, 253, 8, 105, 92, 106, 9, 372, 231,
232, 233, 234, 254, 105, 93, 106, 484, 366, 279,
280, 281, 282, 283, 284, 285, 286, 287, 288, 289,
290, 291, 292, 144, 383, 259, 359, 105, 359, 106,
526, 359, 105, 109, 106, 110, 94, 359, 359, 394,
395, 396, 397, 398, 510, 140, 141, 513, 514, 515,
96, 402, 406, 407, 408, 554, 107, 108, 556, 97,
81, 414, 98, 61, 62, 359, 359, 133, 359, 359,
154, 134, 1, 2, 359, 3, 4, 115, 116, 117,
118, 119, 120, 215, 359, 217, 221, 218, -56, 259,
432, 259, 259, 259, 224, 227, 438, 361, 362, -57,
363, 235, 257, 443, 444, 359, 442, 263, 321, 328,
450, 550, 329, 359, 330, 61, 62, 331, 101, 64,
65, 66, 67, 332, 1, 2, 340, 3, 4, 341,
564, 342, 343, 371, 344, 381, 373, 374, 346, 375,
376, 379, 380, 377, 378, 391, 417, 430, 392, 359,
393, 420, 421, 68, 359, 436, 483, 488, 489, 490,
491, 437, 441, 446, 493, 494, 447, 448, 449, 451,
495, 359, 359, 453, 454, 499, 359, 455, 456, 359,
457, 504, 460, 461, 462, 464, 465, 259, 466, 467,
259, 259, 259, 470, 468, 504, 518, 519, 472, 496,
422, 423, 424, 480, 473, 475, 476, 477, 429, 481,
485, 486, 501, 512, 520, 426, 530, 492, 439, 440,
266, 267, 268, 269, 270, 271, 272, 273, 274, 275,
521, 542, 522, 543, 544, 523, 532, 531, 524, 546,
525, 548, 560, 567, 540, 541, 536, 69, 570, 553,
70, 571, 572, 71, 555, 72, 102, 557, 558, 559,
575, 469, 576, 471, 578, 207, 474, 496, 208, 209,
124, 326, 478, 479, 327, 545, 528, 317, 136, 139,
325, 42, 123, 91, 516, 445, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
502, 503, 0, 506, 507, 0, 0, 0, 0, 511,
0, 0, 0, 0, 0, 0, 0, 0, 0, 517,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
533, 0, 0, 0, 0, 0, 0, 0, 537, 347,
348, 0, 0, 61, 62, 349, 0, 0, 0, 0,
0, 0, 1, 2, 0, 3, 4, 350, 351, 352,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 353, 354, 561, 0, 0, 0, 0, 565,
0, 0, 0, 0, 0, 0, 0, 0, 0, 355,
0, 0, 0, 0, 0, 0, 573, 574, 0, 0,
0, 577, 0, 0, 579, 168, 169, 170, 171, 172,
173, 174, 175, 176, 177, 178, 179, 180, 181, 182,
239, 240, 61, 62, 0, 101, 64, 65, 66, 67,
0, 1, 2, 0, 3, 4, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 241, 189, 190,
191, 192, 193, 194, 195, 196, 197, 198, 199, 200,
68, 242, 0, 243, 244, 245, 347, 348, 0, 0,
61, 62, 349, 0, 105, 0, 106, 0, 0, 1,
2, 356, 3, 4, 350, 351, 352, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 353,
354, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 61, 62, 355, 142, 64, 65,
66, 67, 0, 1, 2, 0, 3, 4, 0, 0,
0, 0, 168, 169, 170, 171, 172, 173, 174, 175,
176, 177, 178, 179, 180, 181, 182, 239, 240, 0,
0, 0, 68, 0, 69, 0, 0, 70, 0, 0,
71, 0, 72, 135, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 241, 189, 190, 191, 192, 193,
194, 195, 196, 197, 198, 199, 200, 0, 242, 0,
243, 244, 245, 61, 62, 0, 0, 0, 0, 0,
0, 0, 1, 2, 0, 3, 4, 236, 356, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 237, 238, 143, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 61, 62, 0, 101, 147,
148, 149, 67, 0, 1, 2, 69, 3, 4, 70,
0, 0, 71, 0, 72, 168, 169, 170, 171, 172,
173, 174, 175, 176, 177, 178, 179, 180, 181, 182,
239, 240, 0, 68, 61, 62, 0, 101, 147, 148,
149, 67, 0, 1, 2, 0, 3, 4, 0, 0,
0, 0, 0, 0, 0, 0, 0, 241, 189, 190,
191, 192, 193, 194, 195, 196, 197, 198, 199, 200,
0, 242, 68, 243, 244, 245, 0, 0, 0, 347,
348, 0, 0, 0, 105, 349, 106, 0, 246, 0,
0, 247, 0, 248, 0, 249, 0, 350, 351, 352,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 353, 354, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 69, 0, 355,
70, 0, 0, 71, 0, 72, 338, 0, 0, 0,
0, 0, 0, 0, 0, 168, 169, 170, 171, 172,
173, 174, 175, 176, 177, 178, 179, 180, 181, 182,
239, 240, 0, 0, 0, 0, 69, 0, 0, 70,
0, 0, 71, 0, 72, 401, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 241, 189, 190,
191, 192, 193, 194, 195, 196, 197, 198, 199, 200,
0, 242, 0, 243, 244, 245, 61, 62, 0, 101,
64, 65, 66, 67, 0, 1, 2, 0, 3, 4,
0, 356, 0, 61, 62, 0, 101, 64, 65, 66,
67, 0, 1, 2, 128, 3, 4, 0, 0, 0,
0, 0, 0, 0, 68, 0, 0, 0, 0, 0,
0, 316, 0, 61, 62, 0, 101, 147, 148, 149,
67, 68, 1, 2, 0, 3, 4, 61, 62, 0,
101, 64, 65, 66, 67, 0, 1, 2, 0, 3,
4, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 68, 0, 0, 0, 413, 0, 61, 62, 0,
101, 64, 65, 66, 67, 68, 1, 2, 0, 3,
4, 61, 62, 0, 63, 64, 65, 66, 67, 0,
1, 2, 0, 3, 4, 498, 0, 61, 62, 0,
101, 147, 148, 149, 67, 68, 1, 2, 69, 3,
4, 70, 0, 0, 71, 0, 72, 0, 0, 68,
0, 0, 0, 0, 0, 69, 0, 0, 70, 0,
0, 71, 0, 72, 0, 68, 61, 62, 0, 142,
64, 65, 66, 67, 0, 1, 2, 0, 3, 4,
0, 0, 0, 0, 0, 69, 0, 0, 70, 0,
333, 71, 0, 72, 0, 0, 0, 0, 0, 69,
0, 0, 70, 0, 68, 71, 0, 72, 0, 61,
62, 0, 101, 64, 65, 66, 67, 0, 1, 2,
0, 3, 4, 0, 0, 0, 0, 0, 0, 69,
0, 0, 70, 0, 0, 71, 0, 72, 0, 0,
0, 0, 0, 69, 0, 0, 70, 68, 0, 71,
0, 72, 0, 0, 0, 0, 0, 0, 0, 69,
0, 0, 70, 0, 0, 71, 0, 72, 0, 61,
62, 0, 258, 64, 65, 66, 67, 0, 1, 2,
0, 3, 4, 61, 62, 0, 101, 147, 148, 149,
67, 0, 1, 2, 0, 3, 4, 0, 69, 0,
0, 70, 0, 0, 71, 0, 72, 68, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 68, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 69, 0, 0, 70, 0, 0, 71, 0, 72,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 159, 0, 0, 0, 0, 0, 0,
0, 69, 0, 0, 70, 0, 0, 71, 0, 72,
0, 0, 160, 161, 0, 69, 0, 0, 70, 0,
0, 71, 0, 336, 162, 163, 164, 165, 166, 167,
168, 169, 170, 171, 172, 173, 174, 175, 176, 177,
178, 179, 180, 181, 182, 183, 184, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 185, 186, 187,
0, 0, 188, 189, 190, 191, 192, 193, 194, 195,
196, 197, 198, 199, 200, 201, 202, 203, 204, 205,
206
};
static const short yycheck[] =
{
0, 26, 152, 164, 224, 414, 145, 121, 11, 0,
4, 318, 295, 152, 11, 322, 16, 24, 165, 187,
18, 247, 248, 11, 137, 16, 136, 25, 48, 16,
11, 30, 19, 146, 202, 203, 204, 205, 206, 323,
324, 209, 62, 3, 4, 5, 6, 72, 137, 138,
0, 140, 38, 39, 40, 41, 42, 43, 44, 30,
46, 49, 22, 23, 211, 15, 16, 17, 49, 19,
20, 96, 136, 113, 114, 100, 26, 27, 49, 550,
137, 106, 38, 39, 141, 114, 111, 87, 137, 45,
499, 131, 132, 564, 137, 51, 121, 47, 16, 148,
50, 19, 137, 17, 54, 148, 20, 137, 133, 134,
336, 140, 137, 148, 113, 114, 141, 34, 148, 42,
259, 44, 261, 262, 533, 264, 113, 114, 412, 137,
356, 130, 131, 132, 133, 137, 137, 162, 146, 141,
147, 144, 310, 144, 131, 132, 53, 144, 134, 135,
148, 265, 137, 147, 113, 114, 565, 440, 297, 144,
185, 186, 187, 188, 155, 137, 305, 306, 31, 141,
33, 130, 131, 132, 133, 15, 201, 202, 203, 204,
205, 206, 207, 208, 209, 0, 469, 138, 471, 140,
134, 135, 217, 500, 308, 146, 113, 114, 11, 22,
23, 14, 227, 0, 136, 138, 374, 140, 376, 377,
378, 144, 136, 130, 131, 132, 133, 136, 15, 16,
17, 142, 19, 20, 19, 364, 365, 366, 18, 26,
27, 109, 110, 372, 517, 28, 29, 38, 39, 40,
265, 461, 43, 382, 383, 137, 138, 554, 140, 556,
47, 276, 402, 50, 138, 19, 140, 54, 142, 3,
4, 5, 6, 402, 138, 19, 140, 141, 293, 92,
93, 94, 95, 96, 97, 98, 99, 100, 101, 102,
103, 104, 105, 308, 309, 310, 425, 138, 427, 140,
141, 430, 138, 38, 140, 40, 19, 436, 437, 328,
329, 330, 331, 332, 472, 107, 108, 475, 476, 477,
140, 336, 341, 342, 343, 535, 78, 79, 538, 4,
33, 346, 4, 7, 8, 464, 465, 143, 467, 468,
4, 143, 16, 17, 473, 19, 20, 56, 57, 58,
59, 60, 61, 19, 483, 137, 146, 141, 9, 374,
375, 376, 377, 378, 141, 140, 381, 261, 262, 9,
264, 9, 51, 392, 393, 504, 391, 11, 146, 140,
399, 532, 140, 512, 140, 7, 8, 140, 10, 11,
12, 13, 14, 140, 16, 17, 19, 19, 20, 140,
551, 140, 140, 297, 137, 34, 137, 137, 140, 137,
137, 305, 306, 137, 137, 34, 55, 142, 140, 548,
140, 137, 137, 45, 553, 137, 441, 446, 447, 448,
449, 137, 137, 137, 453, 454, 137, 137, 137, 146,
455, 570, 571, 137, 137, 460, 575, 34, 19, 578,
4, 466, 137, 141, 19, 14, 14, 472, 140, 137,
475, 476, 477, 4, 137, 480, 485, 486, 137, 459,
364, 365, 366, 140, 137, 137, 137, 137, 372, 137,
137, 137, 137, 137, 137, 49, 19, 146, 382, 383,
86, 87, 88, 89, 90, 91, 92, 93, 94, 95,
141, 520, 137, 522, 523, 137, 142, 137, 141, 49,
141, 14, 4, 137, 141, 141, 144, 139, 14, 534,
142, 14, 137, 145, 144, 147, 148, 141, 141, 141,
14, 425, 67, 427, 14, 124, 430, 527, 124, 124,
87, 239, 436, 437, 240, 527, 500, 217, 100, 106,
227, 16, 84, 54, 480, 394, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
464, 465, -1, 467, 468, -1, -1, -1, -1, 473,
-1, -1, -1, -1, -1, -1, -1, -1, -1, 483,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
504, -1, -1, -1, -1, -1, -1, -1, 512, 3,
4, -1, -1, 7, 8, 9, -1, -1, -1, -1,
-1, -1, 16, 17, -1, 19, 20, 21, 22, 23,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, 36, 37, 548, -1, -1, -1, -1, 553,
-1, -1, -1, -1, -1, -1, -1, -1, -1, 53,
-1, -1, -1, -1, -1, -1, 570, 571, -1, -1,
-1, 575, -1, -1, 578, 69, 70, 71, 72, 73,
74, 75, 76, 77, 78, 79, 80, 81, 82, 83,
84, 85, 7, 8, -1, 10, 11, 12, 13, 14,
-1, 16, 17, -1, 19, 20, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, 111, 112, 113,
114, 115, 116, 117, 118, 119, 120, 121, 122, 123,
45, 125, -1, 127, 128, 129, 3, 4, -1, -1,
7, 8, 9, -1, 138, -1, 140, -1, -1, 16,
17, 145, 19, 20, 21, 22, 23, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, 36,
37, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, 7, 8, 53, 10, 11, 12,
13, 14, -1, 16, 17, -1, 19, 20, -1, -1,
-1, -1, 69, 70, 71, 72, 73, 74, 75, 76,
77, 78, 79, 80, 81, 82, 83, 84, 85, -1,
-1, -1, 45, -1, 139, -1, -1, 142, -1, -1,
145, -1, 147, 148, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, 111, 112, 113, 114, 115, 116,
117, 118, 119, 120, 121, 122, 123, -1, 125, -1,
127, 128, 129, 7, 8, -1, -1, -1, -1, -1,
-1, -1, 16, 17, -1, 19, 20, 21, 145, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, 36, 37, 117, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, 7, 8, -1, 10, 11,
12, 13, 14, -1, 16, 17, 139, 19, 20, 142,
-1, -1, 145, -1, 147, 69, 70, 71, 72, 73,
74, 75, 76, 77, 78, 79, 80, 81, 82, 83,
84, 85, -1, 45, 7, 8, -1, 10, 11, 12,
13, 14, -1, 16, 17, -1, 19, 20, -1, -1,
-1, -1, -1, -1, -1, -1, -1, 111, 112, 113,
114, 115, 116, 117, 118, 119, 120, 121, 122, 123,
-1, 125, 45, 127, 128, 129, -1, -1, -1, 3,
4, -1, -1, -1, 138, 9, 140, -1, 142, -1,
-1, 145, -1, 147, -1, 149, -1, 21, 22, 23,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, 36, 37, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, 139, -1, 53,
142, -1, -1, 145, -1, 147, 148, -1, -1, -1,
-1, -1, -1, -1, -1, 69, 70, 71, 72, 73,
74, 75, 76, 77, 78, 79, 80, 81, 82, 83,
84, 85, -1, -1, -1, -1, 139, -1, -1, 142,
-1, -1, 145, -1, 147, 148, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, 111, 112, 113,
114, 115, 116, 117, 118, 119, 120, 121, 122, 123,
-1, 125, -1, 127, 128, 129, 7, 8, -1, 10,
11, 12, 13, 14, -1, 16, 17, -1, 19, 20,
-1, 145, -1, 7, 8, -1, 10, 11, 12, 13,
14, -1, 16, 17, 35, 19, 20, -1, -1, -1,
-1, -1, -1, -1, 45, -1, -1, -1, -1, -1,
-1, 35, -1, 7, 8, -1, 10, 11, 12, 13,
14, 45, 16, 17, -1, 19, 20, 7, 8, -1,
10, 11, 12, 13, 14, -1, 16, 17, -1, 19,
20, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, 45, -1, -1, -1, 35, -1, 7, 8, -1,
10, 11, 12, 13, 14, 45, 16, 17, -1, 19,
20, 7, 8, -1, 10, 11, 12, 13, 14, -1,
16, 17, -1, 19, 20, 35, -1, 7, 8, -1,
10, 11, 12, 13, 14, 45, 16, 17, 139, 19,
20, 142, -1, -1, 145, -1, 147, -1, -1, 45,
-1, -1, -1, -1, -1, 139, -1, -1, 142, -1,
-1, 145, -1, 147, -1, 45, 7, 8, -1, 10,
11, 12, 13, 14, -1, 16, 17, -1, 19, 20,
-1, -1, -1, -1, -1, 139, -1, -1, 142, -1,
144, 145, -1, 147, -1, -1, -1, -1, -1, 139,
-1, -1, 142, -1, 45, 145, -1, 147, -1, 7,
8, -1, 10, 11, 12, 13, 14, -1, 16, 17,
-1, 19, 20, -1, -1, -1, -1, -1, -1, 139,
-1, -1, 142, -1, -1, 145, -1, 147, -1, -1,
-1, -1, -1, 139, -1, -1, 142, 45, -1, 145,
-1, 147, -1, -1, -1, -1, -1, -1, -1, 139,
-1, -1, 142, -1, -1, 145, -1, 147, -1, 7,
8, -1, 10, 11, 12, 13, 14, -1, 16, 17,
-1, 19, 20, 7, 8, -1, 10, 11, 12, 13,
14, -1, 16, 17, -1, 19, 20, -1, 139, -1,
-1, 142, -1, -1, 145, -1, 147, 45, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, 45, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, 139, -1, -1, 142, -1, -1, 145, -1, 147,
-1, -1, -1, -1, -1, -1, -1, -1, -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, 32, -1, -1, -1, -1, -1, -1,
-1, 139, -1, -1, 142, -1, -1, 145, -1, 147,
-1, -1, 51, 52, -1, 139, -1, -1, 142, -1,
-1, 145, -1, 147, 63, 64, 65, 66, 67, 68,
69, 70, 71, 72, 73, 74, 75, 76, 77, 78,
79, 80, 81, 82, 83, 84, 85, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, 106, 107, 108,
-1, -1, 111, 112, 113, 114, 115, 116, 117, 118,
119, 120, 121, 122, 123, 124, 125, 126, 127, 128,
129
};
/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
symbol of state STATE-NUM. */
static const unsigned char yystos[] =
{
0, 16, 17, 19, 20, 26, 27, 47, 50, 54,
158, 160, 161, 162, 163, 194, 195, 196, 198, 197,
48, 62, 203, 136, 53, 136, 15, 136, 38, 39,
40, 41, 42, 43, 44, 46, 134, 135, 164, 165,
166, 0, 196, 42, 44, 167, 213, 38, 39, 40,
43, 168, 210, 212, 219, 136, 136, 142, 204, 19,
202, 7, 8, 10, 11, 12, 13, 14, 45, 139,
142, 145, 147, 158, 161, 181, 182, 216, 166, 166,
31, 33, 192, 166, 166, 18, 220, 221, 25, 148,
211, 220, 19, 19, 19, 205, 140, 4, 4, 4,
147, 10, 148, 182, 187, 138, 140, 192, 192, 38,
40, 169, 28, 29, 191, 56, 57, 58, 59, 60,
61, 170, 208, 208, 160, 224, 137, 144, 35, 182,
183, 185, 186, 143, 143, 148, 187, 137, 148, 186,
191, 191, 10, 117, 182, 184, 193, 11, 12, 13,
156, 157, 182, 188, 4, 184, 24, 147, 209, 32,
51, 52, 63, 64, 65, 66, 67, 68, 69, 70,
71, 72, 73, 74, 75, 76, 77, 78, 79, 80,
81, 82, 83, 84, 85, 106, 107, 108, 111, 112,
113, 114, 115, 116, 117, 118, 119, 120, 121, 122,
123, 124, 125, 126, 127, 128, 129, 151, 152, 153,
222, 228, 229, 230, 231, 19, 172, 137, 141, 182,
182, 146, 148, 182, 141, 188, 182, 140, 216, 22,
23, 3, 4, 5, 6, 9, 21, 36, 37, 84,
85, 111, 125, 127, 128, 129, 142, 145, 147, 149,
151, 152, 153, 189, 216, 199, 161, 51, 10, 182,
218, 11, 14, 11, 156, 170, 86, 87, 88, 89,
90, 91, 92, 93, 94, 95, 154, 22, 23, 92,
93, 94, 95, 96, 97, 98, 99, 100, 101, 102,
103, 104, 105, 155, 182, 182, 218, 182, 182, 225,
218, 218, 218, 218, 218, 182, 182, 218, 170, 109,
110, 113, 114, 131, 132, 171, 35, 183, 174, 144,
146, 146, 174, 200, 201, 193, 154, 155, 140, 140,
140, 140, 140, 144, 188, 190, 147, 190, 148, 190,
19, 140, 140, 140, 137, 179, 140, 3, 4, 9,
21, 22, 23, 36, 37, 53, 145, 189, 215, 216,
217, 217, 217, 217, 184, 182, 182, 137, 176, 137,
176, 217, 142, 137, 137, 137, 137, 137, 137, 217,
217, 34, 184, 182, 218, 130, 133, 171, 173, 179,
179, 34, 140, 140, 188, 188, 188, 188, 188, 137,
144, 148, 182, 190, 146, 148, 188, 188, 188, 30,
49, 177, 180, 35, 182, 206, 207, 55, 214, 190,
137, 137, 217, 217, 217, 11, 49, 11, 227, 217,
142, 218, 182, 218, 218, 218, 137, 137, 182, 217,
217, 137, 182, 188, 188, 227, 137, 137, 137, 137,
188, 146, 148, 137, 137, 34, 19, 4, 179, 172,
137, 141, 19, 146, 14, 14, 140, 137, 137, 217,
4, 217, 137, 137, 217, 137, 137, 137, 217, 217,
140, 137, 176, 182, 141, 137, 137, 141, 188, 188,
188, 188, 146, 188, 188, 182, 158, 159, 35, 182,
174, 137, 217, 217, 182, 226, 217, 217, 176, 176,
218, 217, 137, 218, 218, 218, 226, 217, 188, 188,
137, 141, 137, 137, 141, 141, 141, 172, 177, 178,
19, 137, 142, 217, 137, 141, 144, 217, 141, 176,
141, 141, 188, 188, 188, 159, 49, 175, 14, 144,
156, 223, 172, 182, 174, 144, 174, 141, 141, 141,
4, 217, 215, 144, 156, 217, 34, 137, 215, 172,
14, 14, 137, 217, 217, 14, 67, 217, 14, 217
};
#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 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
/* 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. */
#define YYLEX yylex ()
/* 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)
/* 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)
#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 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 YYOUT. |
`-----------------------------*/
static void
#if defined (__STDC__) || defined (__cplusplus)
yysymprint (FILE* yyout, int yytype, YYSTYPE yyvalue)
#else
yysymprint (yyout, yytype, yyvalue)
FILE* yyout;
int yytype;
YYSTYPE yyvalue;
#endif
{
/* Pacify ``unused variable'' warnings. */
(void) yyvalue;
if (yytype < YYNTOKENS)
{
YYFPRINTF (yyout, "token %s (", yytname[yytype]);
# ifdef YYPRINT
YYPRINT (yyout, yytoknum[yytype], yyvalue);
# endif
}
else
YYFPRINTF (yyout, "nterm %s (", yytname[yytype]);
switch (yytype)
{
default:
break;
}
YYFPRINTF (yyout, ")");
}
#endif /* YYDEBUG. */
/*-----------------------------------------------.
| Release the memory associated to this symbol. |
`-----------------------------------------------*/
static void
#if defined (__STDC__) || defined (__cplusplus)
yydestruct (int yytype, YYSTYPE yyvalue)
#else
yydestruct (yytype, yyvalue)
int yytype;
YYSTYPE yyvalue;
#endif
{
/* Pacify ``unused variable'' warnings. */
(void) yyvalue;
switch (yytype)
{
default:
break;
}
}
/* 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
# if defined (__STDC__) || defined (__cplusplus)
# define YYPARSE_PARAM_ARG void *YYPARSE_PARAM
# define YYPARSE_PARAM_DECL
# else
# define YYPARSE_PARAM_ARG YYPARSE_PARAM
# define YYPARSE_PARAM_DECL void *YYPARSE_PARAM;
# endif
#else /* !YYPARSE_PARAM */
# define YYPARSE_PARAM_ARG
# define YYPARSE_PARAM_DECL
#endif /* !YYPARSE_PARAM */
/* Prevent warning if -Wstrict-prototypes. */
#ifdef __GNUC__
# ifdef YYPARSE_PARAM
int yyparse (void *);
# else
int yyparse (void);
# endif
#endif
/* The lookahead symbol. */
int yychar;
/* The semantic value of the lookahead symbol. */
YYSTYPE yylval;
/* Number of parse errors so far. */
int yynerrs;
int
yyparse (YYPARSE_PARAM_ARG)
YYPARSE_PARAM_DECL
{
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 yychar1 = 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 yyssa[YYINITDEPTH];
short *yyss = yyssa;
register short *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 (yyssp >= yyss + yystacksize - 1)
{
/* 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 *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 (yystacksize >= YYMAXDEPTH)
goto yyoverflowlab;
yystacksize *= 2;
if (yystacksize > YYMAXDEPTH)
yystacksize = YYMAXDEPTH;
{
short *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 (yyssp >= yyss + yystacksize - 1)
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 token in external form. */
if (yychar == YYEMPTY)
{
YYDPRINTF ((stderr, "Reading a token: "));
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. */
YYDPRINTF ((stderr, "Now at end of input.\n"));
}
else
{
yychar1 = YYTRANSLATE (yychar);
/* We have to keep this `#if YYDEBUG', since we use variables
which are defined only if `YYDEBUG' is set. */
YYDPRINTF ((stderr, "Next token is "));
YYDSYMPRINT ((stderr, yychar1, yylval));
YYDPRINTF ((stderr, "\n"));
}
/* If the proper action on seeing token YYCHAR1 is to reduce or to
detect an error, take that action. */
yyn += yychar1;
if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yychar1)
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 %d (%s), ",
yychar, yytname[yychar1]));
/* 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];
#if YYDEBUG
/* We have to keep this `#if YYDEBUG', since we use variables which
are defined only if `YYDEBUG' is set. */
if (yydebug)
{
int yyi;
YYFPRINTF (stderr, "Reducing via rule %d (line %d), ",
yyn - 1, yyrline[yyn]);
/* Print the symbols being reduced, and their result. */
for (yyi = yyprhs[yyn]; yyrhs[yyi] >= 0; yyi++)
YYFPRINTF (stderr, "%s ", yytname[yyrhs[yyi]]);
YYFPRINTF (stderr, " -> %s\n", yytname[yyr1[yyn]]);
}
#endif
switch (yyn)
{
case 29:
#line 1117 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.IPredicate = ICmpInst::ICMP_EQ; }
break;
case 30:
#line 1117 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.IPredicate = ICmpInst::ICMP_NE; }
break;
case 31:
#line 1118 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.IPredicate = ICmpInst::ICMP_SLT; }
break;
case 32:
#line 1118 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.IPredicate = ICmpInst::ICMP_SGT; }
break;
case 33:
#line 1119 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.IPredicate = ICmpInst::ICMP_SLE; }
break;
case 34:
#line 1119 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.IPredicate = ICmpInst::ICMP_SGE; }
break;
case 35:
#line 1120 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.IPredicate = ICmpInst::ICMP_ULT; }
break;
case 36:
#line 1120 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.IPredicate = ICmpInst::ICMP_UGT; }
break;
case 37:
#line 1121 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.IPredicate = ICmpInst::ICMP_ULE; }
break;
case 38:
#line 1121 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.IPredicate = ICmpInst::ICMP_UGE; }
break;
case 39:
#line 1125 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.FPredicate = FCmpInst::FCMP_OEQ; }
break;
case 40:
#line 1125 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.FPredicate = FCmpInst::FCMP_ONE; }
break;
case 41:
#line 1126 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.FPredicate = FCmpInst::FCMP_OLT; }
break;
case 42:
#line 1126 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.FPredicate = FCmpInst::FCMP_OGT; }
break;
case 43:
#line 1127 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.FPredicate = FCmpInst::FCMP_OLE; }
break;
case 44:
#line 1127 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.FPredicate = FCmpInst::FCMP_OGE; }
break;
case 45:
#line 1128 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.FPredicate = FCmpInst::FCMP_ORD; }
break;
case 46:
#line 1128 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.FPredicate = FCmpInst::FCMP_UNO; }
break;
case 47:
#line 1129 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.FPredicate = FCmpInst::FCMP_UEQ; }
break;
case 48:
#line 1129 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.FPredicate = FCmpInst::FCMP_UNE; }
break;
case 49:
#line 1130 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.FPredicate = FCmpInst::FCMP_ULT; }
break;
case 50:
#line 1130 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.FPredicate = FCmpInst::FCMP_UGT; }
break;
case 51:
#line 1131 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.FPredicate = FCmpInst::FCMP_ULE; }
break;
case 52:
#line 1131 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.FPredicate = FCmpInst::FCMP_UGE; }
break;
case 53:
#line 1132 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.FPredicate = FCmpInst::FCMP_TRUE; }
break;
case 54:
#line 1133 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.FPredicate = FCmpInst::FCMP_FALSE; }
break;
case 61:
#line 1142 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.StrVal = 0; }
break;
case 62:
#line 1146 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.StrVal = yyvsp[-1].StrVal;
CHECK_FOR_ERROR
}
break;
case 63:
#line 1150 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.StrVal = 0;
CHECK_FOR_ERROR
}
break;
case 67:
#line 1158 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.StrVal = 0;
CHECK_FOR_ERROR
}
break;
case 68:
#line 1163 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.StrVal = yyvsp[-1].StrVal;
CHECK_FOR_ERROR
}
break;
case 69:
#line 1169 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Linkage = GlobalValue::InternalLinkage; }
break;
case 70:
#line 1170 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Linkage = GlobalValue::WeakLinkage; }
break;
case 71:
#line 1171 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Linkage = GlobalValue::LinkOnceLinkage; }
break;
case 72:
#line 1172 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Linkage = GlobalValue::AppendingLinkage; }
break;
case 73:
#line 1173 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Linkage = GlobalValue::DLLExportLinkage; }
break;
case 74:
#line 1177 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Linkage = GlobalValue::DLLImportLinkage; }
break;
case 75:
#line 1178 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Linkage = GlobalValue::ExternalWeakLinkage; }
break;
case 76:
#line 1179 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Linkage = GlobalValue::ExternalLinkage; }
break;
case 77:
#line 1183 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Visibility = GlobalValue::DefaultVisibility; }
break;
case 78:
#line 1184 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Visibility = GlobalValue::DefaultVisibility; }
break;
case 79:
#line 1185 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Visibility = GlobalValue::HiddenVisibility; }
break;
case 80:
#line 1189 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Linkage = GlobalValue::ExternalLinkage; }
break;
case 81:
#line 1190 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Linkage = GlobalValue::DLLImportLinkage; }
break;
case 82:
#line 1191 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Linkage = GlobalValue::ExternalWeakLinkage; }
break;
case 83:
#line 1195 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Linkage = GlobalValue::ExternalLinkage; }
break;
case 84:
#line 1196 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Linkage = GlobalValue::InternalLinkage; }
break;
case 85:
#line 1197 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Linkage = GlobalValue::LinkOnceLinkage; }
break;
case 86:
#line 1198 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Linkage = GlobalValue::WeakLinkage; }
break;
case 87:
#line 1199 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Linkage = GlobalValue::DLLExportLinkage; }
break;
case 88:
#line 1203 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Linkage = GlobalValue::ExternalLinkage; }
break;
case 89:
#line 1204 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Linkage = GlobalValue::WeakLinkage; }
break;
case 90:
#line 1205 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Linkage = GlobalValue::InternalLinkage; }
break;
case 91:
#line 1208 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.UIntVal = CallingConv::C; }
break;
case 92:
#line 1209 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.UIntVal = CallingConv::C; }
break;
case 93:
#line 1210 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.UIntVal = CallingConv::Fast; }
break;
case 94:
#line 1211 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.UIntVal = CallingConv::Cold; }
break;
case 95:
#line 1212 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.UIntVal = CallingConv::X86_StdCall; }
break;
case 96:
#line 1213 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.UIntVal = CallingConv::X86_FastCall; }
break;
case 97:
#line 1214 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if ((unsigned)yyvsp[0].UInt64Val != yyvsp[0].UInt64Val)
GEN_ERROR("Calling conv too large");
yyval.UIntVal = yyvsp[0].UInt64Val;
CHECK_FOR_ERROR
}
break;
case 98:
#line 1221 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.ParamAttrs = ParamAttr::ZExt; }
break;
case 99:
#line 1222 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.ParamAttrs = ParamAttr::SExt; }
break;
case 100:
#line 1223 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.ParamAttrs = ParamAttr::InReg; }
break;
case 101:
#line 1224 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.ParamAttrs = ParamAttr::StructRet; }
break;
case 102:
#line 1227 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.ParamAttrs = ParamAttr::None; }
break;
case 103:
#line 1228 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.ParamAttrs = yyvsp[-1].ParamAttrs | yyvsp[0].ParamAttrs;
}
break;
case 104:
#line 1233 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.ParamAttrs = ParamAttr::NoReturn; }
break;
case 105:
#line 1234 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.ParamAttrs = ParamAttr::NoUnwind; }
break;
case 107:
#line 1238 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.ParamAttrs = ParamAttr::None; }
break;
case 108:
#line 1239 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.ParamAttrs = yyvsp[-1].ParamAttrs | yyvsp[0].ParamAttrs;
}
break;
case 109:
#line 1246 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.UIntVal = 0; }
break;
case 110:
#line 1247 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.UIntVal = yyvsp[0].UInt64Val;
if (yyval.UIntVal != 0 && !isPowerOf2_32(yyval.UIntVal))
GEN_ERROR("Alignment must be a power of two");
CHECK_FOR_ERROR
}
break;
case 111:
#line 1253 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.UIntVal = 0; }
break;
case 112:
#line 1254 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.UIntVal = yyvsp[0].UInt64Val;
if (yyval.UIntVal != 0 && !isPowerOf2_32(yyval.UIntVal))
GEN_ERROR("Alignment must be a power of two");
CHECK_FOR_ERROR
}
break;
case 113:
#line 1262 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
for (unsigned i = 0, e = strlen(yyvsp[0].StrVal); i != e; ++i)
if (yyvsp[0].StrVal[i] == '"' || yyvsp[0].StrVal[i] == '\\')
GEN_ERROR("Invalid character in section name");
yyval.StrVal = yyvsp[0].StrVal;
CHECK_FOR_ERROR
}
break;
case 114:
#line 1270 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.StrVal = 0; }
break;
case 115:
#line 1271 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.StrVal = yyvsp[0].StrVal; }
break;
case 116:
#line 1276 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{}
break;
case 117:
#line 1277 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{}
break;
case 118:
#line 1278 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
CurGV->setSection(yyvsp[0].StrVal);
free(yyvsp[0].StrVal);
CHECK_FOR_ERROR
}
break;
case 119:
#line 1283 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (yyvsp[0].UInt64Val != 0 && !isPowerOf2_32(yyvsp[0].UInt64Val))
GEN_ERROR("Alignment must be a power of two");
CurGV->setAlignment(yyvsp[0].UInt64Val);
CHECK_FOR_ERROR
}
break;
case 124:
#line 1299 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.TypeVal = new PATypeHolder(OpaqueType::get());
CHECK_FOR_ERROR
}
break;
case 125:
#line 1303 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.TypeVal = new PATypeHolder(yyvsp[0].PrimType);
CHECK_FOR_ERROR
}
break;
case 126:
#line 1307 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Pointer type?
if (*yyvsp[-1].TypeVal == Type::LabelTy)
GEN_ERROR("Cannot form a pointer to a basic block");
yyval.TypeVal = new PATypeHolder(HandleUpRefs(PointerType::get(*yyvsp[-1].TypeVal)));
delete yyvsp[-1].TypeVal;
CHECK_FOR_ERROR
}
break;
case 127:
#line 1314 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Named types are also simple types...
const Type* tmp = getTypeVal(yyvsp[0].ValIDVal);
CHECK_FOR_ERROR
yyval.TypeVal = new PATypeHolder(tmp);
}
break;
case 128:
#line 1319 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Type UpReference
if (yyvsp[0].UInt64Val > (uint64_t)~0U) GEN_ERROR("Value out of range");
OpaqueType *OT = OpaqueType::get(); // Use temporary placeholder
UpRefs.push_back(UpRefRecord((unsigned)yyvsp[0].UInt64Val, OT)); // Add to vector...
yyval.TypeVal = new PATypeHolder(OT);
UR_OUT("New Upreference!\n");
CHECK_FOR_ERROR
}
break;
case 129:
#line 1327 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
std::vector<const Type*> Params;
ParamAttrsVector Attrs;
if (yyvsp[0].ParamAttrs != ParamAttr::None) {
ParamAttrsWithIndex X; X.index = 0; X.attrs = yyvsp[0].ParamAttrs;
Attrs.push_back(X);
}
unsigned index = 1;
TypeWithAttrsList::iterator I = yyvsp[-2].TypeWithAttrsList->begin(), E = yyvsp[-2].TypeWithAttrsList->end();
for (; I != E; ++I, ++index) {
const Type *Ty = I->Ty->get();
Params.push_back(Ty);
if (Ty != Type::VoidTy)
if (I->Attrs != ParamAttr::None) {
ParamAttrsWithIndex X; X.index = index; X.attrs = I->Attrs;
Attrs.push_back(X);
}
}
bool isVarArg = Params.size() && Params.back() == Type::VoidTy;
if (isVarArg) Params.pop_back();
ParamAttrsList *ActualAttrs = 0;
if (!Attrs.empty())
ActualAttrs = ParamAttrsList::get(Attrs);
FunctionType *FT = FunctionType::get(*yyvsp[-4].TypeVal, Params, isVarArg, ActualAttrs);
delete yyvsp[-2].TypeWithAttrsList; // Delete the argument list
delete yyvsp[-4].TypeVal; // Delete the return type handle
yyval.TypeVal = new PATypeHolder(HandleUpRefs(FT));
CHECK_FOR_ERROR
}
break;
case 130:
#line 1357 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
std::vector<const Type*> Params;
ParamAttrsVector Attrs;
if (yyvsp[0].ParamAttrs != ParamAttr::None) {
ParamAttrsWithIndex X; X.index = 0; X.attrs = yyvsp[0].ParamAttrs;
Attrs.push_back(X);
}
TypeWithAttrsList::iterator I = yyvsp[-2].TypeWithAttrsList->begin(), E = yyvsp[-2].TypeWithAttrsList->end();
unsigned index = 1;
for ( ; I != E; ++I, ++index) {
const Type* Ty = I->Ty->get();
Params.push_back(Ty);
if (Ty != Type::VoidTy)
if (I->Attrs != ParamAttr::None) {
ParamAttrsWithIndex X; X.index = index; X.attrs = I->Attrs;
Attrs.push_back(X);
}
}
bool isVarArg = Params.size() && Params.back() == Type::VoidTy;
if (isVarArg) Params.pop_back();
ParamAttrsList *ActualAttrs = 0;
if (!Attrs.empty())
ActualAttrs = ParamAttrsList::get(Attrs);
FunctionType *FT = FunctionType::get(yyvsp[-4].PrimType, Params, isVarArg, ActualAttrs);
delete yyvsp[-2].TypeWithAttrsList; // Delete the argument list
yyval.TypeVal = new PATypeHolder(HandleUpRefs(FT));
CHECK_FOR_ERROR
}
break;
case 131:
#line 1388 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Sized array type?
yyval.TypeVal = new PATypeHolder(HandleUpRefs(ArrayType::get(*yyvsp[-1].TypeVal, (unsigned)yyvsp[-3].UInt64Val)));
delete yyvsp[-1].TypeVal;
CHECK_FOR_ERROR
}
break;
case 132:
#line 1393 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Vector type?
const llvm::Type* ElemTy = yyvsp[-1].TypeVal->get();
if ((unsigned)yyvsp[-3].UInt64Val != yyvsp[-3].UInt64Val)
GEN_ERROR("Unsigned result not equal to signed result");
if (!ElemTy->isFloatingPoint() && !ElemTy->isInteger())
GEN_ERROR("Element type of a VectorType must be primitive");
if (!isPowerOf2_32(yyvsp[-3].UInt64Val))
GEN_ERROR("Vector length should be a power of 2");
yyval.TypeVal = new PATypeHolder(HandleUpRefs(VectorType::get(*yyvsp[-1].TypeVal, (unsigned)yyvsp[-3].UInt64Val)));
delete yyvsp[-1].TypeVal;
CHECK_FOR_ERROR
}
break;
case 133:
#line 1405 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Structure type?
std::vector<const Type*> Elements;
for (std::list<llvm::PATypeHolder>::iterator I = yyvsp[-1].TypeList->begin(),
E = yyvsp[-1].TypeList->end(); I != E; ++I)
Elements.push_back(*I);
yyval.TypeVal = new PATypeHolder(HandleUpRefs(StructType::get(Elements)));
delete yyvsp[-1].TypeList;
CHECK_FOR_ERROR
}
break;
case 134:
#line 1415 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Empty structure type?
yyval.TypeVal = new PATypeHolder(StructType::get(std::vector<const Type*>()));
CHECK_FOR_ERROR
}
break;
case 135:
#line 1419 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
std::vector<const Type*> Elements;
for (std::list<llvm::PATypeHolder>::iterator I = yyvsp[-2].TypeList->begin(),
E = yyvsp[-2].TypeList->end(); I != E; ++I)
Elements.push_back(*I);
yyval.TypeVal = new PATypeHolder(HandleUpRefs(StructType::get(Elements, true)));
delete yyvsp[-2].TypeList;
CHECK_FOR_ERROR
}
break;
case 136:
#line 1429 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Empty structure type?
yyval.TypeVal = new PATypeHolder(StructType::get(std::vector<const Type*>(), true));
CHECK_FOR_ERROR
}
break;
case 137:
#line 1436 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.TypeWithAttrs.Ty = yyvsp[-1].TypeVal;
yyval.TypeWithAttrs.Attrs = yyvsp[0].ParamAttrs;
}
break;
case 138:
#line 1443 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[0].TypeVal)->getDescription());
if (!(*yyvsp[0].TypeVal)->isFirstClassType())
GEN_ERROR("LLVM functions cannot return aggregate types");
yyval.TypeVal = yyvsp[0].TypeVal;
}
break;
case 139:
#line 1450 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.TypeVal = new PATypeHolder(Type::VoidTy);
}
break;
case 140:
#line 1455 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.TypeWithAttrsList = new TypeWithAttrsList();
yyval.TypeWithAttrsList->push_back(yyvsp[0].TypeWithAttrs);
CHECK_FOR_ERROR
}
break;
case 141:
#line 1460 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
(yyval.TypeWithAttrsList=yyvsp[-2].TypeWithAttrsList)->push_back(yyvsp[0].TypeWithAttrs);
CHECK_FOR_ERROR
}
break;
case 143:
#line 1468 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.TypeWithAttrsList=yyvsp[-2].TypeWithAttrsList;
TypeWithAttrs TWA; TWA.Attrs = ParamAttr::None;
TWA.Ty = new PATypeHolder(Type::VoidTy);
yyval.TypeWithAttrsList->push_back(TWA);
CHECK_FOR_ERROR
}
break;
case 144:
#line 1475 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.TypeWithAttrsList = new TypeWithAttrsList;
TypeWithAttrs TWA; TWA.Attrs = ParamAttr::None;
TWA.Ty = new PATypeHolder(Type::VoidTy);
yyval.TypeWithAttrsList->push_back(TWA);
CHECK_FOR_ERROR
}
break;
case 145:
#line 1482 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.TypeWithAttrsList = new TypeWithAttrsList();
CHECK_FOR_ERROR
}
break;
case 146:
#line 1490 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.TypeList = new std::list<PATypeHolder>();
yyval.TypeList->push_back(*yyvsp[0].TypeVal);
delete yyvsp[0].TypeVal;
CHECK_FOR_ERROR
}
break;
case 147:
#line 1496 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
(yyval.TypeList=yyvsp[-2].TypeList)->push_back(*yyvsp[0].TypeVal);
delete yyvsp[0].TypeVal;
CHECK_FOR_ERROR
}
break;
case 148:
#line 1508 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Nonempty unsized arr
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-3].TypeVal)->getDescription());
const ArrayType *ATy = dyn_cast<ArrayType>(yyvsp[-3].TypeVal->get());
if (ATy == 0)
GEN_ERROR("Cannot make array constant with type: '" +
(*yyvsp[-3].TypeVal)->getDescription() + "'");
const Type *ETy = ATy->getElementType();
int NumElements = ATy->getNumElements();
// Verify that we have the correct size...
if (NumElements != -1 && NumElements != (int)yyvsp[-1].ConstVector->size())
GEN_ERROR("Type mismatch: constant sized array initialized with " +
utostr(yyvsp[-1].ConstVector->size()) + " arguments, but has size of " +
itostr(NumElements) + "");
// Verify all elements are correct type!
for (unsigned i = 0; i < yyvsp[-1].ConstVector->size(); i++) {
if (ETy != (*yyvsp[-1].ConstVector)[i]->getType())
GEN_ERROR("Element #" + utostr(i) + " is not of type '" +
ETy->getDescription() +"' as required!\nIt is of type '"+
(*yyvsp[-1].ConstVector)[i]->getType()->getDescription() + "'.");
}
yyval.ConstVal = ConstantArray::get(ATy, *yyvsp[-1].ConstVector);
delete yyvsp[-3].TypeVal; delete yyvsp[-1].ConstVector;
CHECK_FOR_ERROR
}
break;
case 149:
#line 1536 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-2].TypeVal)->getDescription());
const ArrayType *ATy = dyn_cast<ArrayType>(yyvsp[-2].TypeVal->get());
if (ATy == 0)
GEN_ERROR("Cannot make array constant with type: '" +
(*yyvsp[-2].TypeVal)->getDescription() + "'");
int NumElements = ATy->getNumElements();
if (NumElements != -1 && NumElements != 0)
GEN_ERROR("Type mismatch: constant sized array initialized with 0"
" arguments, but has size of " + itostr(NumElements) +"");
yyval.ConstVal = ConstantArray::get(ATy, std::vector<Constant*>());
delete yyvsp[-2].TypeVal;
CHECK_FOR_ERROR
}
break;
case 150:
#line 1552 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-2].TypeVal)->getDescription());
const ArrayType *ATy = dyn_cast<ArrayType>(yyvsp[-2].TypeVal->get());
if (ATy == 0)
GEN_ERROR("Cannot make array constant with type: '" +
(*yyvsp[-2].TypeVal)->getDescription() + "'");
int NumElements = ATy->getNumElements();
const Type *ETy = ATy->getElementType();
char *EndStr = UnEscapeLexed(yyvsp[0].StrVal, true);
if (NumElements != -1 && NumElements != (EndStr-yyvsp[0].StrVal))
GEN_ERROR("Can't build string constant of size " +
itostr((int)(EndStr-yyvsp[0].StrVal)) +
" when array has size " + itostr(NumElements) + "");
std::vector<Constant*> Vals;
if (ETy == Type::Int8Ty) {
for (unsigned char *C = (unsigned char *)yyvsp[0].StrVal;
C != (unsigned char*)EndStr; ++C)
Vals.push_back(ConstantInt::get(ETy, *C));
} else {
free(yyvsp[0].StrVal);
GEN_ERROR("Cannot build string arrays of non byte sized elements");
}
free(yyvsp[0].StrVal);
yyval.ConstVal = ConstantArray::get(ATy, Vals);
delete yyvsp[-2].TypeVal;
CHECK_FOR_ERROR
}
break;
case 151:
#line 1581 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Nonempty unsized arr
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-3].TypeVal)->getDescription());
const VectorType *PTy = dyn_cast<VectorType>(yyvsp[-3].TypeVal->get());
if (PTy == 0)
GEN_ERROR("Cannot make packed constant with type: '" +
(*yyvsp[-3].TypeVal)->getDescription() + "'");
const Type *ETy = PTy->getElementType();
int NumElements = PTy->getNumElements();
// Verify that we have the correct size...
if (NumElements != -1 && NumElements != (int)yyvsp[-1].ConstVector->size())
GEN_ERROR("Type mismatch: constant sized packed initialized with " +
utostr(yyvsp[-1].ConstVector->size()) + " arguments, but has size of " +
itostr(NumElements) + "");
// Verify all elements are correct type!
for (unsigned i = 0; i < yyvsp[-1].ConstVector->size(); i++) {
if (ETy != (*yyvsp[-1].ConstVector)[i]->getType())
GEN_ERROR("Element #" + utostr(i) + " is not of type '" +
ETy->getDescription() +"' as required!\nIt is of type '"+
(*yyvsp[-1].ConstVector)[i]->getType()->getDescription() + "'.");
}
yyval.ConstVal = ConstantVector::get(PTy, *yyvsp[-1].ConstVector);
delete yyvsp[-3].TypeVal; delete yyvsp[-1].ConstVector;
CHECK_FOR_ERROR
}
break;
case 152:
#line 1609 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
const StructType *STy = dyn_cast<StructType>(yyvsp[-3].TypeVal->get());
if (STy == 0)
GEN_ERROR("Cannot make struct constant with type: '" +
(*yyvsp[-3].TypeVal)->getDescription() + "'");
if (yyvsp[-1].ConstVector->size() != STy->getNumContainedTypes())
GEN_ERROR("Illegal number of initializers for structure type");
// Check to ensure that constants are compatible with the type initializer!
for (unsigned i = 0, e = yyvsp[-1].ConstVector->size(); i != e; ++i)
if ((*yyvsp[-1].ConstVector)[i]->getType() != STy->getElementType(i))
GEN_ERROR("Expected type '" +
STy->getElementType(i)->getDescription() +
"' for element #" + utostr(i) +
" of structure initializer");
// Check to ensure that Type is not packed
if (STy->isPacked())
GEN_ERROR("Unpacked Initializer to vector type '" +
STy->getDescription() + "'");
yyval.ConstVal = ConstantStruct::get(STy, *yyvsp[-1].ConstVector);
delete yyvsp[-3].TypeVal; delete yyvsp[-1].ConstVector;
CHECK_FOR_ERROR
}
break;
case 153:
#line 1635 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-2].TypeVal)->getDescription());
const StructType *STy = dyn_cast<StructType>(yyvsp[-2].TypeVal->get());
if (STy == 0)
GEN_ERROR("Cannot make struct constant with type: '" +
(*yyvsp[-2].TypeVal)->getDescription() + "'");
if (STy->getNumContainedTypes() != 0)
GEN_ERROR("Illegal number of initializers for structure type");
// Check to ensure that Type is not packed
if (STy->isPacked())
GEN_ERROR("Unpacked Initializer to vector type '" +
STy->getDescription() + "'");
yyval.ConstVal = ConstantStruct::get(STy, std::vector<Constant*>());
delete yyvsp[-2].TypeVal;
CHECK_FOR_ERROR
}
break;
case 154:
#line 1655 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
const StructType *STy = dyn_cast<StructType>(yyvsp[-5].TypeVal->get());
if (STy == 0)
GEN_ERROR("Cannot make struct constant with type: '" +
(*yyvsp[-5].TypeVal)->getDescription() + "'");
if (yyvsp[-2].ConstVector->size() != STy->getNumContainedTypes())
GEN_ERROR("Illegal number of initializers for structure type");
// Check to ensure that constants are compatible with the type initializer!
for (unsigned i = 0, e = yyvsp[-2].ConstVector->size(); i != e; ++i)
if ((*yyvsp[-2].ConstVector)[i]->getType() != STy->getElementType(i))
GEN_ERROR("Expected type '" +
STy->getElementType(i)->getDescription() +
"' for element #" + utostr(i) +
" of structure initializer");
// Check to ensure that Type is packed
if (!STy->isPacked())
GEN_ERROR("Vector initializer to non-vector type '" +
STy->getDescription() + "'");
yyval.ConstVal = ConstantStruct::get(STy, *yyvsp[-2].ConstVector);
delete yyvsp[-5].TypeVal; delete yyvsp[-2].ConstVector;
CHECK_FOR_ERROR
}
break;
case 155:
#line 1681 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-4].TypeVal)->getDescription());
const StructType *STy = dyn_cast<StructType>(yyvsp[-4].TypeVal->get());
if (STy == 0)
GEN_ERROR("Cannot make struct constant with type: '" +
(*yyvsp[-4].TypeVal)->getDescription() + "'");
if (STy->getNumContainedTypes() != 0)
GEN_ERROR("Illegal number of initializers for structure type");
// Check to ensure that Type is packed
if (!STy->isPacked())
GEN_ERROR("Vector initializer to non-vector type '" +
STy->getDescription() + "'");
yyval.ConstVal = ConstantStruct::get(STy, std::vector<Constant*>());
delete yyvsp[-4].TypeVal;
CHECK_FOR_ERROR
}
break;
case 156:
#line 1701 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription());
const PointerType *PTy = dyn_cast<PointerType>(yyvsp[-1].TypeVal->get());
if (PTy == 0)
GEN_ERROR("Cannot make null pointer constant with type: '" +
(*yyvsp[-1].TypeVal)->getDescription() + "'");
yyval.ConstVal = ConstantPointerNull::get(PTy);
delete yyvsp[-1].TypeVal;
CHECK_FOR_ERROR
}
break;
case 157:
#line 1713 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription());
yyval.ConstVal = UndefValue::get(yyvsp[-1].TypeVal->get());
delete yyvsp[-1].TypeVal;
CHECK_FOR_ERROR
}
break;
case 158:
#line 1720 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription());
const PointerType *Ty = dyn_cast<PointerType>(yyvsp[-1].TypeVal->get());
if (Ty == 0)
GEN_ERROR("Global const reference must be a pointer type");
// ConstExprs can exist in the body of a function, thus creating
// GlobalValues whenever they refer to a variable. Because we are in
// the context of a function, getExistingVal will search the functions
// symbol table instead of the module symbol table for the global symbol,
// which throws things all off. To get around this, we just tell
// getExistingVal that we are at global scope here.
//
Function *SavedCurFn = CurFun.CurrentFunction;
CurFun.CurrentFunction = 0;
Value *V = getExistingVal(Ty, yyvsp[0].ValIDVal);
CHECK_FOR_ERROR
CurFun.CurrentFunction = SavedCurFn;
// If this is an initializer for a constant pointer, which is referencing a
// (currently) undefined variable, create a stub now that shall be replaced
// in the future with the right type of variable.
//
if (V == 0) {
assert(isa<PointerType>(Ty) && "Globals may only be used as pointers!");
const PointerType *PT = cast<PointerType>(Ty);
// First check to see if the forward references value is already created!
PerModuleInfo::GlobalRefsType::iterator I =
CurModule.GlobalRefs.find(std::make_pair(PT, yyvsp[0].ValIDVal));
if (I != CurModule.GlobalRefs.end()) {
V = I->second; // Placeholder already exists, use it...
yyvsp[0].ValIDVal.destroy();
} else {
std::string Name;
if (yyvsp[0].ValIDVal.Type == ValID::GlobalName)
Name = yyvsp[0].ValIDVal.Name;
else if (yyvsp[0].ValIDVal.Type != ValID::GlobalID)
GEN_ERROR("Invalid reference to global");
// Create the forward referenced global.
GlobalValue *GV;
if (const FunctionType *FTy =
dyn_cast<FunctionType>(PT->getElementType())) {
GV = new Function(FTy, GlobalValue::ExternalWeakLinkage, Name,
CurModule.CurrentModule);
} else {
GV = new GlobalVariable(PT->getElementType(), false,
GlobalValue::ExternalWeakLinkage, 0,
Name, CurModule.CurrentModule);
}
// Keep track of the fact that we have a forward ref to recycle it
CurModule.GlobalRefs.insert(std::make_pair(std::make_pair(PT, yyvsp[0].ValIDVal), GV));
V = GV;
}
}
yyval.ConstVal = cast<GlobalValue>(V);
delete yyvsp[-1].TypeVal; // Free the type handle
CHECK_FOR_ERROR
}
break;
case 159:
#line 1786 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription());
if (yyvsp[-1].TypeVal->get() != yyvsp[0].ConstVal->getType())
GEN_ERROR("Mismatched types for constant expression: " +
(*yyvsp[-1].TypeVal)->getDescription() + " and " + yyvsp[0].ConstVal->getType()->getDescription());
yyval.ConstVal = yyvsp[0].ConstVal;
delete yyvsp[-1].TypeVal;
CHECK_FOR_ERROR
}
break;
case 160:
#line 1796 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription());
const Type *Ty = yyvsp[-1].TypeVal->get();
if (isa<FunctionType>(Ty) || Ty == Type::LabelTy || isa<OpaqueType>(Ty))
GEN_ERROR("Cannot create a null initialized value of this type");
yyval.ConstVal = Constant::getNullValue(Ty);
delete yyvsp[-1].TypeVal;
CHECK_FOR_ERROR
}
break;
case 161:
#line 1806 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ // integral constants
if (!ConstantInt::isValueValidForType(yyvsp[-1].PrimType, yyvsp[0].SInt64Val))
GEN_ERROR("Constant value doesn't fit in type");
yyval.ConstVal = ConstantInt::get(yyvsp[-1].PrimType, yyvsp[0].SInt64Val, true);
CHECK_FOR_ERROR
}
break;
case 162:
#line 1812 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ // arbitrary precision integer constants
uint32_t BitWidth = cast<IntegerType>(yyvsp[-1].PrimType)->getBitWidth();
if (yyvsp[0].APIntVal->getBitWidth() > BitWidth) {
GEN_ERROR("Constant value does not fit in type");
}
yyvsp[0].APIntVal->sextOrTrunc(BitWidth);
yyval.ConstVal = ConstantInt::get(*yyvsp[0].APIntVal);
delete yyvsp[0].APIntVal;
CHECK_FOR_ERROR
}
break;
case 163:
#line 1822 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ // integral constants
if (!ConstantInt::isValueValidForType(yyvsp[-1].PrimType, yyvsp[0].UInt64Val))
GEN_ERROR("Constant value doesn't fit in type");
yyval.ConstVal = ConstantInt::get(yyvsp[-1].PrimType, yyvsp[0].UInt64Val, false);
CHECK_FOR_ERROR
}
break;
case 164:
#line 1828 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ // arbitrary precision integer constants
uint32_t BitWidth = cast<IntegerType>(yyvsp[-1].PrimType)->getBitWidth();
if (yyvsp[0].APIntVal->getBitWidth() > BitWidth) {
GEN_ERROR("Constant value does not fit in type");
}
yyvsp[0].APIntVal->zextOrTrunc(BitWidth);
yyval.ConstVal = ConstantInt::get(*yyvsp[0].APIntVal);
delete yyvsp[0].APIntVal;
CHECK_FOR_ERROR
}
break;
case 165:
#line 1838 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Boolean constants
assert(cast<IntegerType>(yyvsp[-1].PrimType)->getBitWidth() == 1 && "Not Bool?");
yyval.ConstVal = ConstantInt::getTrue();
CHECK_FOR_ERROR
}
break;
case 166:
#line 1843 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Boolean constants
assert(cast<IntegerType>(yyvsp[-1].PrimType)->getBitWidth() == 1 && "Not Bool?");
yyval.ConstVal = ConstantInt::getFalse();
CHECK_FOR_ERROR
}
break;
case 167:
#line 1848 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Float & Double constants
if (!ConstantFP::isValueValidForType(yyvsp[-1].PrimType, yyvsp[0].FPVal))
GEN_ERROR("Floating point constant invalid for type");
yyval.ConstVal = ConstantFP::get(yyvsp[-1].PrimType, yyvsp[0].FPVal);
CHECK_FOR_ERROR
}
break;
case 168:
#line 1856 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription());
Constant *Val = yyvsp[-3].ConstVal;
const Type *DestTy = yyvsp[-1].TypeVal->get();
if (!CastInst::castIsValid(yyvsp[-5].CastOpVal, yyvsp[-3].ConstVal, DestTy))
GEN_ERROR("invalid cast opcode for cast from '" +
Val->getType()->getDescription() + "' to '" +
DestTy->getDescription() + "'");
yyval.ConstVal = ConstantExpr::getCast(yyvsp[-5].CastOpVal, yyvsp[-3].ConstVal, DestTy);
delete yyvsp[-1].TypeVal;
}
break;
case 169:
#line 1868 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!isa<PointerType>(yyvsp[-2].ConstVal->getType()))
GEN_ERROR("GetElementPtr requires a pointer operand");
const Type *IdxTy =
GetElementPtrInst::getIndexedType(yyvsp[-2].ConstVal->getType(), &(*yyvsp[-1].ValueList)[0], yyvsp[-1].ValueList->size(),
true);
if (!IdxTy)
GEN_ERROR("Index list invalid for constant getelementptr");
SmallVector<Constant*, 8> IdxVec;
for (unsigned i = 0, e = yyvsp[-1].ValueList->size(); i != e; ++i)
if (Constant *C = dyn_cast<Constant>((*yyvsp[-1].ValueList)[i]))
IdxVec.push_back(C);
else
GEN_ERROR("Indices to constant getelementptr must be constants");
delete yyvsp[-1].ValueList;
yyval.ConstVal = ConstantExpr::getGetElementPtr(yyvsp[-2].ConstVal, &IdxVec[0], IdxVec.size());
CHECK_FOR_ERROR
}
break;
case 170:
#line 1890 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (yyvsp[-5].ConstVal->getType() != Type::Int1Ty)
GEN_ERROR("Select condition must be of boolean type");
if (yyvsp[-3].ConstVal->getType() != yyvsp[-1].ConstVal->getType())
GEN_ERROR("Select operand types must match");
yyval.ConstVal = ConstantExpr::getSelect(yyvsp[-5].ConstVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal);
CHECK_FOR_ERROR
}
break;
case 171:
#line 1898 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (yyvsp[-3].ConstVal->getType() != yyvsp[-1].ConstVal->getType())
GEN_ERROR("Binary operator types must match");
CHECK_FOR_ERROR;
yyval.ConstVal = ConstantExpr::get(yyvsp[-5].BinaryOpVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal);
}
break;
case 172:
#line 1904 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (yyvsp[-3].ConstVal->getType() != yyvsp[-1].ConstVal->getType())
GEN_ERROR("Logical operator types must match");
if (!yyvsp[-3].ConstVal->getType()->isInteger()) {
if (Instruction::isShift(yyvsp[-5].BinaryOpVal) || !isa<VectorType>(yyvsp[-3].ConstVal->getType()) ||
!cast<VectorType>(yyvsp[-3].ConstVal->getType())->getElementType()->isInteger())
GEN_ERROR("Logical operator requires integral operands");
}
yyval.ConstVal = ConstantExpr::get(yyvsp[-5].BinaryOpVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal);
CHECK_FOR_ERROR
}
break;
case 173:
#line 1915 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (yyvsp[-3].ConstVal->getType() != yyvsp[-1].ConstVal->getType())
GEN_ERROR("icmp operand types must match");
yyval.ConstVal = ConstantExpr::getICmp(yyvsp[-5].IPredicate, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal);
}
break;
case 174:
#line 1920 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (yyvsp[-3].ConstVal->getType() != yyvsp[-1].ConstVal->getType())
GEN_ERROR("fcmp operand types must match");
yyval.ConstVal = ConstantExpr::getFCmp(yyvsp[-5].FPredicate, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal);
}
break;
case 175:
#line 1925 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!ExtractElementInst::isValidOperands(yyvsp[-3].ConstVal, yyvsp[-1].ConstVal))
GEN_ERROR("Invalid extractelement operands");
yyval.ConstVal = ConstantExpr::getExtractElement(yyvsp[-3].ConstVal, yyvsp[-1].ConstVal);
CHECK_FOR_ERROR
}
break;
case 176:
#line 1931 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!InsertElementInst::isValidOperands(yyvsp[-5].ConstVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal))
GEN_ERROR("Invalid insertelement operands");
yyval.ConstVal = ConstantExpr::getInsertElement(yyvsp[-5].ConstVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal);
CHECK_FOR_ERROR
}
break;
case 177:
#line 1937 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!ShuffleVectorInst::isValidOperands(yyvsp[-5].ConstVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal))
GEN_ERROR("Invalid shufflevector operands");
yyval.ConstVal = ConstantExpr::getShuffleVector(yyvsp[-5].ConstVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal);
CHECK_FOR_ERROR
}
break;
case 178:
#line 1946 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
(yyval.ConstVector = yyvsp[-2].ConstVector)->push_back(yyvsp[0].ConstVal);
CHECK_FOR_ERROR
}
break;
case 179:
#line 1950 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.ConstVector = new std::vector<Constant*>();
yyval.ConstVector->push_back(yyvsp[0].ConstVal);
CHECK_FOR_ERROR
}
break;
case 180:
#line 1958 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.BoolVal = false; }
break;
case 181:
#line 1958 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.BoolVal = true; }
break;
case 182:
#line 1961 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.BoolVal = true; }
break;
case 183:
#line 1961 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.BoolVal = false; }
break;
case 184:
#line 1964 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
const Type* VTy = yyvsp[-1].TypeVal->get();
Value *V = getVal(VTy, yyvsp[0].ValIDVal);
GlobalValue* Aliasee = dyn_cast<GlobalValue>(V);
if (!Aliasee)
GEN_ERROR("Aliases can be created only to global values");
yyval.ConstVal = Aliasee;
CHECK_FOR_ERROR
delete yyvsp[-1].TypeVal;
}
break;
case 185:
#line 1975 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
Constant *Val = yyvsp[-3].ConstVal;
const Type *DestTy = yyvsp[-1].TypeVal->get();
if (!CastInst::castIsValid(yyvsp[-5].CastOpVal, yyvsp[-3].ConstVal, DestTy))
GEN_ERROR("invalid cast opcode for cast from '" +
Val->getType()->getDescription() + "' to '" +
DestTy->getDescription() + "'");
yyval.ConstVal = ConstantExpr::getCast(yyvsp[-5].CastOpVal, yyvsp[-3].ConstVal, DestTy);
CHECK_FOR_ERROR
delete yyvsp[-1].TypeVal;
}
break;
case 186:
#line 1996 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.ModuleVal = ParserResult = CurModule.CurrentModule;
CurModule.ModuleDone();
CHECK_FOR_ERROR;
}
break;
case 187:
#line 2001 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.ModuleVal = ParserResult = CurModule.CurrentModule;
CurModule.ModuleDone();
CHECK_FOR_ERROR;
}
break;
case 190:
#line 2014 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ CurFun.isDeclare = false; }
break;
case 191:
#line 2014 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
CurFun.FunctionDone();
CHECK_FOR_ERROR
}
break;
case 192:
#line 2018 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ CurFun.isDeclare = true; }
break;
case 193:
#line 2018 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
CHECK_FOR_ERROR
}
break;
case 194:
#line 2021 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
CHECK_FOR_ERROR
}
break;
case 195:
#line 2024 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[0].TypeVal)->getDescription());
// Eagerly resolve types. This is not an optimization, this is a
// requirement that is due to the fact that we could have this:
//
// %list = type { %list * }
// %list = type { %list * } ; repeated type decl
//
// If types are not resolved eagerly, then the two types will not be
// determined to be the same type!
//
ResolveTypeTo(yyvsp[-2].StrVal, *yyvsp[0].TypeVal);
if (!setTypeName(*yyvsp[0].TypeVal, yyvsp[-2].StrVal) && !yyvsp[-2].StrVal) {
CHECK_FOR_ERROR
// If this is a named type that is not a redefinition, add it to the slot
// table.
CurModule.Types.push_back(*yyvsp[0].TypeVal);
}
delete yyvsp[0].TypeVal;
CHECK_FOR_ERROR
}
break;
case 196:
#line 2048 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
ResolveTypeTo(yyvsp[-2].StrVal, yyvsp[0].PrimType);
if (!setTypeName(yyvsp[0].PrimType, yyvsp[-2].StrVal) && !yyvsp[-2].StrVal) {
CHECK_FOR_ERROR
// If this is a named type that is not a redefinition, add it to the slot
// table.
CurModule.Types.push_back(yyvsp[0].PrimType);
}
CHECK_FOR_ERROR
}
break;
case 197:
#line 2059 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
/* "Externally Visible" Linkage */
if (yyvsp[0].ConstVal == 0)
GEN_ERROR("Global value initializer is not a constant");
CurGV = ParseGlobalVariable(yyvsp[-4].StrVal, GlobalValue::ExternalLinkage,
yyvsp[-3].Visibility, yyvsp[-1].BoolVal, yyvsp[0].ConstVal->getType(), yyvsp[0].ConstVal, yyvsp[-2].BoolVal);
CHECK_FOR_ERROR
}
break;
case 198:
#line 2066 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
CurGV = 0;
}
break;
case 199:
#line 2070 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (yyvsp[0].ConstVal == 0)
GEN_ERROR("Global value initializer is not a constant");
CurGV = ParseGlobalVariable(yyvsp[-5].StrVal, yyvsp[-4].Linkage, yyvsp[-3].Visibility, yyvsp[-1].BoolVal, yyvsp[0].ConstVal->getType(), yyvsp[0].ConstVal, yyvsp[-2].BoolVal);
CHECK_FOR_ERROR
}
break;
case 200:
#line 2075 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
CurGV = 0;
}
break;
case 201:
#line 2079 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[0].TypeVal)->getDescription());
CurGV = ParseGlobalVariable(yyvsp[-5].StrVal, yyvsp[-4].Linkage, yyvsp[-3].Visibility, yyvsp[-1].BoolVal, *yyvsp[0].TypeVal, 0, yyvsp[-2].BoolVal);
CHECK_FOR_ERROR
delete yyvsp[0].TypeVal;
}
break;
case 202:
#line 2085 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
CurGV = 0;
CHECK_FOR_ERROR
}
break;
case 203:
#line 2089 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
std::string Name(yyvsp[-4].StrVal);
if (Name.empty())
GEN_ERROR("Alias name cannot be empty");
Constant* Aliasee = yyvsp[0].ConstVal;
if (Aliasee == 0)
GEN_ERROR(std::string("Invalid aliasee for alias: ") + yyvsp[-4].StrVal);
GlobalAlias* GA = new GlobalAlias(Aliasee->getType(), yyvsp[-1].Linkage, Name, Aliasee,
CurModule.CurrentModule);
GA->setVisibility(yyvsp[-3].Visibility);
InsertValue(GA, CurModule.Values);
CHECK_FOR_ERROR
}
break;
case 204:
#line 2104 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
CHECK_FOR_ERROR
}
break;
case 205:
#line 2107 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
CHECK_FOR_ERROR
}
break;
case 206:
#line 2113 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
const std::string &AsmSoFar = CurModule.CurrentModule->getModuleInlineAsm();
char *EndStr = UnEscapeLexed(yyvsp[0].StrVal, true);
std::string NewAsm(yyvsp[0].StrVal, EndStr);
free(yyvsp[0].StrVal);
if (AsmSoFar.empty())
CurModule.CurrentModule->setModuleInlineAsm(NewAsm);
else
CurModule.CurrentModule->setModuleInlineAsm(AsmSoFar+"\n"+NewAsm);
CHECK_FOR_ERROR
}
break;
case 207:
#line 2126 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
CurModule.CurrentModule->setTargetTriple(yyvsp[0].StrVal);
free(yyvsp[0].StrVal);
}
break;
case 208:
#line 2130 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
CurModule.CurrentModule->setDataLayout(yyvsp[0].StrVal);
free(yyvsp[0].StrVal);
}
break;
case 210:
#line 2137 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
CurModule.CurrentModule->addLibrary(yyvsp[0].StrVal);
free(yyvsp[0].StrVal);
CHECK_FOR_ERROR
}
break;
case 211:
#line 2142 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
CurModule.CurrentModule->addLibrary(yyvsp[0].StrVal);
free(yyvsp[0].StrVal);
CHECK_FOR_ERROR
}
break;
case 212:
#line 2147 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
CHECK_FOR_ERROR
}
break;
case 213:
#line 2156 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-2].TypeVal)->getDescription());
if (*yyvsp[-2].TypeVal == Type::VoidTy)
GEN_ERROR("void typed arguments are invalid");
ArgListEntry E; E.Attrs = yyvsp[-1].ParamAttrs; E.Ty = yyvsp[-2].TypeVal; E.Name = yyvsp[0].StrVal;
yyval.ArgList = yyvsp[-4].ArgList;
yyvsp[-4].ArgList->push_back(E);
CHECK_FOR_ERROR
}
break;
case 214:
#line 2166 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-2].TypeVal)->getDescription());
if (*yyvsp[-2].TypeVal == Type::VoidTy)
GEN_ERROR("void typed arguments are invalid");
ArgListEntry E; E.Attrs = yyvsp[-1].ParamAttrs; E.Ty = yyvsp[-2].TypeVal; E.Name = yyvsp[0].StrVal;
yyval.ArgList = new ArgListType;
yyval.ArgList->push_back(E);
CHECK_FOR_ERROR
}
break;
case 215:
#line 2177 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.ArgList = yyvsp[0].ArgList;
CHECK_FOR_ERROR
}
break;
case 216:
#line 2181 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.ArgList = yyvsp[-2].ArgList;
struct ArgListEntry E;
E.Ty = new PATypeHolder(Type::VoidTy);
E.Name = 0;
E.Attrs = ParamAttr::None;
yyval.ArgList->push_back(E);
CHECK_FOR_ERROR
}
break;
case 217:
#line 2190 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.ArgList = new ArgListType;
struct ArgListEntry E;
E.Ty = new PATypeHolder(Type::VoidTy);
E.Name = 0;
E.Attrs = ParamAttr::None;
yyval.ArgList->push_back(E);
CHECK_FOR_ERROR
}
break;
case 218:
#line 2199 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.ArgList = 0;
CHECK_FOR_ERROR
}
break;
case 219:
#line 2205 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
UnEscapeLexed(yyvsp[-6].StrVal);
std::string FunctionName(yyvsp[-6].StrVal);
free(yyvsp[-6].StrVal); // Free strdup'd memory!
// Check the function result for abstractness if this is a define. We should
// have no abstract types at this point
if (!CurFun.isDeclare && CurModule.TypeIsUnresolved(yyvsp[-7].TypeVal))
GEN_ERROR("Reference to abstract result: "+ yyvsp[-7].TypeVal->get()->getDescription());
std::vector<const Type*> ParamTypeList;
ParamAttrsVector Attrs;
if (yyvsp[-2].ParamAttrs != ParamAttr::None) {
ParamAttrsWithIndex PAWI; PAWI.index = 0; PAWI.attrs = yyvsp[-2].ParamAttrs;
Attrs.push_back(PAWI);
}
if (yyvsp[-4].ArgList) { // If there are arguments...
unsigned index = 1;
for (ArgListType::iterator I = yyvsp[-4].ArgList->begin(); I != yyvsp[-4].ArgList->end(); ++I, ++index) {
const Type* Ty = I->Ty->get();
if (!CurFun.isDeclare && CurModule.TypeIsUnresolved(I->Ty))
GEN_ERROR("Reference to abstract argument: " + Ty->getDescription());
ParamTypeList.push_back(Ty);
if (Ty != Type::VoidTy)
if (I->Attrs != ParamAttr::None) {
ParamAttrsWithIndex PAWI; PAWI.index = index; PAWI.attrs = I->Attrs;
Attrs.push_back(PAWI);
}
}
}
bool isVarArg = ParamTypeList.size() && ParamTypeList.back() == Type::VoidTy;
if (isVarArg) ParamTypeList.pop_back();
ParamAttrsList *PAL = 0;
if (!Attrs.empty())
PAL = ParamAttrsList::get(Attrs);
FunctionType *FT = FunctionType::get(*yyvsp[-7].TypeVal, ParamTypeList, isVarArg, PAL);
const PointerType *PFT = PointerType::get(FT);
delete yyvsp[-7].TypeVal;
ValID ID;
if (!FunctionName.empty()) {
ID = ValID::createGlobalName((char*)FunctionName.c_str());
} else {
ID = ValID::createGlobalID(CurModule.Values.size());
}
Function *Fn = 0;
// See if this function was forward referenced. If so, recycle the object.
if (GlobalValue *FWRef = CurModule.GetForwardRefForGlobal(PFT, ID)) {
// Move the function to the end of the list, from whereever it was
// previously inserted.
Fn = cast<Function>(FWRef);
CurModule.CurrentModule->getFunctionList().remove(Fn);
CurModule.CurrentModule->getFunctionList().push_back(Fn);
} else if (!FunctionName.empty() && // Merge with an earlier prototype?
(Fn = CurModule.CurrentModule->getFunction(FunctionName))) {
if (Fn->getFunctionType() != FT) {
// The existing function doesn't have the same type. This is an overload
// error.
GEN_ERROR("Overload of function '" + FunctionName + "' not permitted.");
} else if (!CurFun.isDeclare && !Fn->isDeclaration()) {
// Neither the existing or the current function is a declaration and they
// have the same name and same type. Clearly this is a redefinition.
GEN_ERROR("Redefinition of function '" + FunctionName + "'");
} if (Fn->isDeclaration()) {
// Make sure to strip off any argument names so we can't get conflicts.
for (Function::arg_iterator AI = Fn->arg_begin(), AE = Fn->arg_end();
AI != AE; ++AI)
AI->setName("");
}
} else { // Not already defined?
Fn = new Function(FT, GlobalValue::ExternalWeakLinkage, FunctionName,
CurModule.CurrentModule);
InsertValue(Fn, CurModule.Values);
}
CurFun.FunctionStart(Fn);
if (CurFun.isDeclare) {
// If we have declaration, always overwrite linkage. This will allow us to
// correctly handle cases, when pointer to function is passed as argument to
// another function.
Fn->setLinkage(CurFun.Linkage);
Fn->setVisibility(CurFun.Visibility);
}
Fn->setCallingConv(yyvsp[-8].UIntVal);
Fn->setAlignment(yyvsp[0].UIntVal);
if (yyvsp[-1].StrVal) {
Fn->setSection(yyvsp[-1].StrVal);
free(yyvsp[-1].StrVal);
}
// Add all of the arguments we parsed to the function...
if (yyvsp[-4].ArgList) { // Is null if empty...
if (isVarArg) { // Nuke the last entry
assert(yyvsp[-4].ArgList->back().Ty->get() == Type::VoidTy && yyvsp[-4].ArgList->back().Name == 0 &&
"Not a varargs marker!");
delete yyvsp[-4].ArgList->back().Ty;
yyvsp[-4].ArgList->pop_back(); // Delete the last entry
}
Function::arg_iterator ArgIt = Fn->arg_begin();
Function::arg_iterator ArgEnd = Fn->arg_end();
unsigned Idx = 1;
for (ArgListType::iterator I = yyvsp[-4].ArgList->begin();
I != yyvsp[-4].ArgList->end() && ArgIt != ArgEnd; ++I, ++ArgIt) {
delete I->Ty; // Delete the typeholder...
setValueName(ArgIt, I->Name); // Insert arg into symtab...
CHECK_FOR_ERROR
InsertValue(ArgIt);
Idx++;
}
delete yyvsp[-4].ArgList; // We're now done with the argument list
}
CHECK_FOR_ERROR
}
break;
case 222:
#line 2328 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.FunctionVal = CurFun.CurrentFunction;
// Make sure that we keep track of the linkage type even if there was a
// previous "declare".
yyval.FunctionVal->setLinkage(yyvsp[-3].Linkage);
yyval.FunctionVal->setVisibility(yyvsp[-2].Visibility);
}
break;
case 225:
#line 2339 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.FunctionVal = yyvsp[-1].FunctionVal;
CHECK_FOR_ERROR
}
break;
case 226:
#line 2344 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
CurFun.CurrentFunction->setLinkage(yyvsp[-2].Linkage);
CurFun.CurrentFunction->setVisibility(yyvsp[-1].Visibility);
yyval.FunctionVal = CurFun.CurrentFunction;
CurFun.FunctionDone();
CHECK_FOR_ERROR
}
break;
case 227:
#line 2356 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.BoolVal = false;
CHECK_FOR_ERROR
}
break;
case 228:
#line 2360 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.BoolVal = true;
CHECK_FOR_ERROR
}
break;
case 229:
#line 2365 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ // A reference to a direct constant
yyval.ValIDVal = ValID::create(yyvsp[0].SInt64Val);
CHECK_FOR_ERROR
}
break;
case 230:
#line 2369 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.ValIDVal = ValID::create(yyvsp[0].UInt64Val);
CHECK_FOR_ERROR
}
break;
case 231:
#line 2373 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Perhaps it's an FP constant?
yyval.ValIDVal = ValID::create(yyvsp[0].FPVal);
CHECK_FOR_ERROR
}
break;
case 232:
#line 2377 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.ValIDVal = ValID::create(ConstantInt::getTrue());
CHECK_FOR_ERROR
}
break;
case 233:
#line 2381 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.ValIDVal = ValID::create(ConstantInt::getFalse());
CHECK_FOR_ERROR
}
break;
case 234:
#line 2385 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.ValIDVal = ValID::createNull();
CHECK_FOR_ERROR
}
break;
case 235:
#line 2389 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.ValIDVal = ValID::createUndef();
CHECK_FOR_ERROR
}
break;
case 236:
#line 2393 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ // A vector zero constant.
yyval.ValIDVal = ValID::createZeroInit();
CHECK_FOR_ERROR
}
break;
case 237:
#line 2397 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Nonempty unsized packed vector
const Type *ETy = (*yyvsp[-1].ConstVector)[0]->getType();
int NumElements = yyvsp[-1].ConstVector->size();
VectorType* pt = VectorType::get(ETy, NumElements);
PATypeHolder* PTy = new PATypeHolder(
HandleUpRefs(
VectorType::get(
ETy,
NumElements)
)
);
// Verify all elements are correct type!
for (unsigned i = 0; i < yyvsp[-1].ConstVector->size(); i++) {
if (ETy != (*yyvsp[-1].ConstVector)[i]->getType())
GEN_ERROR("Element #" + utostr(i) + " is not of type '" +
ETy->getDescription() +"' as required!\nIt is of type '" +
(*yyvsp[-1].ConstVector)[i]->getType()->getDescription() + "'.");
}
yyval.ValIDVal = ValID::create(ConstantVector::get(pt, *yyvsp[-1].ConstVector));
delete PTy; delete yyvsp[-1].ConstVector;
CHECK_FOR_ERROR
}
break;
case 238:
#line 2422 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.ValIDVal = ValID::create(yyvsp[0].ConstVal);
CHECK_FOR_ERROR
}
break;
case 239:
#line 2426 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
char *End = UnEscapeLexed(yyvsp[-2].StrVal, true);
std::string AsmStr = std::string(yyvsp[-2].StrVal, End);
End = UnEscapeLexed(yyvsp[0].StrVal, true);
std::string Constraints = std::string(yyvsp[0].StrVal, End);
yyval.ValIDVal = ValID::createInlineAsm(AsmStr, Constraints, yyvsp[-3].BoolVal);
free(yyvsp[-2].StrVal);
free(yyvsp[0].StrVal);
CHECK_FOR_ERROR
}
break;
case 240:
#line 2440 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Is it an integer reference...?
yyval.ValIDVal = ValID::createLocalID(yyvsp[0].UIntVal);
CHECK_FOR_ERROR
}
break;
case 241:
#line 2444 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.ValIDVal = ValID::createGlobalID(yyvsp[0].UIntVal);
CHECK_FOR_ERROR
}
break;
case 242:
#line 2448 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Is it a named reference...?
yyval.ValIDVal = ValID::createLocalName(yyvsp[0].StrVal);
CHECK_FOR_ERROR
}
break;
case 243:
#line 2452 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Is it a named reference...?
yyval.ValIDVal = ValID::createGlobalName(yyvsp[0].StrVal);
CHECK_FOR_ERROR
}
break;
case 246:
#line 2464 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription());
yyval.ValueVal = getVal(*yyvsp[-1].TypeVal, yyvsp[0].ValIDVal);
delete yyvsp[-1].TypeVal;
CHECK_FOR_ERROR
}
break;
case 247:
#line 2473 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.FunctionVal = yyvsp[-1].FunctionVal;
CHECK_FOR_ERROR
}
break;
case 248:
#line 2477 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Do not allow functions with 0 basic blocks
yyval.FunctionVal = yyvsp[-1].FunctionVal;
CHECK_FOR_ERROR
}
break;
case 249:
#line 2486 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
setValueName(yyvsp[0].TermInstVal, yyvsp[-1].StrVal);
CHECK_FOR_ERROR
InsertValue(yyvsp[0].TermInstVal);
yyvsp[-2].BasicBlockVal->getInstList().push_back(yyvsp[0].TermInstVal);
yyval.BasicBlockVal = yyvsp[-2].BasicBlockVal;
CHECK_FOR_ERROR
}
break;
case 250:
#line 2495 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (CastInst *CI1 = dyn_cast<CastInst>(yyvsp[0].InstVal))
if (CastInst *CI2 = dyn_cast<CastInst>(CI1->getOperand(0)))
if (CI2->getParent() == 0)
yyvsp[-1].BasicBlockVal->getInstList().push_back(CI2);
yyvsp[-1].BasicBlockVal->getInstList().push_back(yyvsp[0].InstVal);
yyval.BasicBlockVal = yyvsp[-1].BasicBlockVal;
CHECK_FOR_ERROR
}
break;
case 251:
#line 2504 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Empty space between instruction lists
yyval.BasicBlockVal = defineBBVal(ValID::createLocalID(CurFun.NextValNum));
CHECK_FOR_ERROR
}
break;
case 252:
#line 2508 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Labelled (named) basic block
yyval.BasicBlockVal = defineBBVal(ValID::createLocalName(yyvsp[0].StrVal));
CHECK_FOR_ERROR
}
break;
case 253:
#line 2513 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Return with a result...
yyval.TermInstVal = new ReturnInst(yyvsp[0].ValueVal);
CHECK_FOR_ERROR
}
break;
case 254:
#line 2517 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Return with no result...
yyval.TermInstVal = new ReturnInst();
CHECK_FOR_ERROR
}
break;
case 255:
#line 2521 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Unconditional Branch...
BasicBlock* tmpBB = getBBVal(yyvsp[0].ValIDVal);
CHECK_FOR_ERROR
yyval.TermInstVal = new BranchInst(tmpBB);
}
break;
case 256:
#line 2526 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
assert(cast<IntegerType>(yyvsp[-7].PrimType)->getBitWidth() == 1 && "Not Bool?");
BasicBlock* tmpBBA = getBBVal(yyvsp[-3].ValIDVal);
CHECK_FOR_ERROR
BasicBlock* tmpBBB = getBBVal(yyvsp[0].ValIDVal);
CHECK_FOR_ERROR
Value* tmpVal = getVal(Type::Int1Ty, yyvsp[-6].ValIDVal);
CHECK_FOR_ERROR
yyval.TermInstVal = new BranchInst(tmpBBA, tmpBBB, tmpVal);
}
break;
case 257:
#line 2536 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
Value* tmpVal = getVal(yyvsp[-7].PrimType, yyvsp[-6].ValIDVal);
CHECK_FOR_ERROR
BasicBlock* tmpBB = getBBVal(yyvsp[-3].ValIDVal);
CHECK_FOR_ERROR
SwitchInst *S = new SwitchInst(tmpVal, tmpBB, yyvsp[-1].JumpTable->size());
yyval.TermInstVal = S;
std::vector<std::pair<Constant*,BasicBlock*> >::iterator I = yyvsp[-1].JumpTable->begin(),
E = yyvsp[-1].JumpTable->end();
for (; I != E; ++I) {
if (ConstantInt *CI = dyn_cast<ConstantInt>(I->first))
S->addCase(CI, I->second);
else
GEN_ERROR("Switch case is constant, but not a simple integer");
}
delete yyvsp[-1].JumpTable;
CHECK_FOR_ERROR
}
break;
case 258:
#line 2555 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
Value* tmpVal = getVal(yyvsp[-6].PrimType, yyvsp[-5].ValIDVal);
CHECK_FOR_ERROR
BasicBlock* tmpBB = getBBVal(yyvsp[-2].ValIDVal);
CHECK_FOR_ERROR
SwitchInst *S = new SwitchInst(tmpVal, tmpBB, 0);
yyval.TermInstVal = S;
CHECK_FOR_ERROR
}
break;
case 259:
#line 2565 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
// Handle the short syntax
const PointerType *PFTy = 0;
const FunctionType *Ty = 0;
if (!(PFTy = dyn_cast<PointerType>(yyvsp[-11].TypeVal->get())) ||
!(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) {
// Pull out the types of all of the arguments...
std::vector<const Type*> ParamTypes;
ParamAttrsVector Attrs;
if (yyvsp[-6].ParamAttrs != ParamAttr::None) {
ParamAttrsWithIndex PAWI; PAWI.index = 0; PAWI.attrs = 8;
Attrs.push_back(PAWI);
}
ValueRefList::iterator I = yyvsp[-8].ValueRefList->begin(), E = yyvsp[-8].ValueRefList->end();
unsigned index = 1;
for (; I != E; ++I, ++index) {
const Type *Ty = I->Val->getType();
if (Ty == Type::VoidTy)
GEN_ERROR("Short call syntax cannot be used with varargs");
ParamTypes.push_back(Ty);
if (I->Attrs != ParamAttr::None) {
ParamAttrsWithIndex PAWI; PAWI.index = index; PAWI.attrs = I->Attrs;
Attrs.push_back(PAWI);
}
}
ParamAttrsList *PAL = 0;
if (!Attrs.empty())
PAL = ParamAttrsList::get(Attrs);
Ty = FunctionType::get(yyvsp[-11].TypeVal->get(), ParamTypes, false, PAL);
PFTy = PointerType::get(Ty);
}
delete yyvsp[-11].TypeVal;
Value *V = getVal(PFTy, yyvsp[-10].ValIDVal); // Get the function we're calling...
CHECK_FOR_ERROR
BasicBlock *Normal = getBBVal(yyvsp[-3].ValIDVal);
CHECK_FOR_ERROR
BasicBlock *Except = getBBVal(yyvsp[0].ValIDVal);
CHECK_FOR_ERROR
// Check the arguments
ValueList Args;
if (yyvsp[-8].ValueRefList->empty()) { // Has no arguments?
// Make sure no arguments is a good thing!
if (Ty->getNumParams() != 0)
GEN_ERROR("No arguments passed to a function that "
"expects arguments");
} else { // Has arguments?
// Loop through FunctionType's arguments and ensure they are specified
// correctly!
FunctionType::param_iterator I = Ty->param_begin();
FunctionType::param_iterator E = Ty->param_end();
ValueRefList::iterator ArgI = yyvsp[-8].ValueRefList->begin(), ArgE = yyvsp[-8].ValueRefList->end();
for (; ArgI != ArgE && I != E; ++ArgI, ++I) {
if (ArgI->Val->getType() != *I)
GEN_ERROR("Parameter " + ArgI->Val->getName()+ " is not of type '" +
(*I)->getDescription() + "'");
Args.push_back(ArgI->Val);
}
if (Ty->isVarArg()) {
if (I == E)
for (; ArgI != ArgE; ++ArgI)
Args.push_back(ArgI->Val); // push the remaining varargs
} else if (I != E || ArgI != ArgE)
GEN_ERROR("Invalid number of parameters detected");
}
// Create the InvokeInst
InvokeInst *II = new InvokeInst(V, Normal, Except, &Args[0], Args.size());
II->setCallingConv(yyvsp[-12].UIntVal);
yyval.TermInstVal = II;
delete yyvsp[-8].ValueRefList;
CHECK_FOR_ERROR
}
break;
case 260:
#line 2644 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.TermInstVal = new UnwindInst();
CHECK_FOR_ERROR
}
break;
case 261:
#line 2648 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.TermInstVal = new UnreachableInst();
CHECK_FOR_ERROR
}
break;
case 262:
#line 2655 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.JumpTable = yyvsp[-5].JumpTable;
Constant *V = cast<Constant>(getExistingVal(yyvsp[-4].PrimType, yyvsp[-3].ValIDVal));
CHECK_FOR_ERROR
if (V == 0)
GEN_ERROR("May only switch on a constant pool value");
BasicBlock* tmpBB = getBBVal(yyvsp[0].ValIDVal);
CHECK_FOR_ERROR
yyval.JumpTable->push_back(std::make_pair(V, tmpBB));
}
break;
case 263:
#line 2666 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.JumpTable = new std::vector<std::pair<Constant*, BasicBlock*> >();
Constant *V = cast<Constant>(getExistingVal(yyvsp[-4].PrimType, yyvsp[-3].ValIDVal));
CHECK_FOR_ERROR
if (V == 0)
GEN_ERROR("May only switch on a constant pool value");
BasicBlock* tmpBB = getBBVal(yyvsp[0].ValIDVal);
CHECK_FOR_ERROR
yyval.JumpTable->push_back(std::make_pair(V, tmpBB));
}
break;
case 264:
#line 2679 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
// Is this definition named?? if so, assign the name...
setValueName(yyvsp[0].InstVal, yyvsp[-1].StrVal);
CHECK_FOR_ERROR
InsertValue(yyvsp[0].InstVal);
yyval.InstVal = yyvsp[0].InstVal;
CHECK_FOR_ERROR
}
break;
case 265:
#line 2689 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Used for PHI nodes
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-5].TypeVal)->getDescription());
yyval.PHIList = new std::list<std::pair<Value*, BasicBlock*> >();
Value* tmpVal = getVal(*yyvsp[-5].TypeVal, yyvsp[-3].ValIDVal);
CHECK_FOR_ERROR
BasicBlock* tmpBB = getBBVal(yyvsp[-1].ValIDVal);
CHECK_FOR_ERROR
yyval.PHIList->push_back(std::make_pair(tmpVal, tmpBB));
delete yyvsp[-5].TypeVal;
}
break;
case 266:
#line 2700 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.PHIList = yyvsp[-6].PHIList;
Value* tmpVal = getVal(yyvsp[-6].PHIList->front().first->getType(), yyvsp[-3].ValIDVal);
CHECK_FOR_ERROR
BasicBlock* tmpBB = getBBVal(yyvsp[-1].ValIDVal);
CHECK_FOR_ERROR
yyvsp[-6].PHIList->push_back(std::make_pair(tmpVal, tmpBB));
}
break;
case 267:
#line 2710 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-2].TypeVal)->getDescription());
// Used for call and invoke instructions
yyval.ValueRefList = new ValueRefList();
ValueRefListEntry E; E.Attrs = yyvsp[0].ParamAttrs; E.Val = getVal(yyvsp[-2].TypeVal->get(), yyvsp[-1].ValIDVal);
yyval.ValueRefList->push_back(E);
delete yyvsp[-2].TypeVal;
}
break;
case 268:
#line 2719 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-2].TypeVal)->getDescription());
yyval.ValueRefList = yyvsp[-4].ValueRefList;
ValueRefListEntry E; E.Attrs = yyvsp[0].ParamAttrs; E.Val = getVal(yyvsp[-2].TypeVal->get(), yyvsp[-1].ValIDVal);
yyval.ValueRefList->push_back(E);
delete yyvsp[-2].TypeVal;
CHECK_FOR_ERROR
}
break;
case 269:
#line 2728 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.ValueRefList = new ValueRefList(); }
break;
case 270:
#line 2731 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.ValueList = new std::vector<Value*>(); }
break;
case 271:
#line 2732 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.ValueList = yyvsp[-2].ValueList;
yyval.ValueList->push_back(yyvsp[0].ValueVal);
CHECK_FOR_ERROR
}
break;
case 272:
#line 2739 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.BoolVal = true;
CHECK_FOR_ERROR
}
break;
case 273:
#line 2743 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.BoolVal = false;
CHECK_FOR_ERROR
}
break;
case 274:
#line 2748 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-3].TypeVal)->getDescription());
if (!(*yyvsp[-3].TypeVal)->isInteger() && !(*yyvsp[-3].TypeVal)->isFloatingPoint() &&
!isa<VectorType>((*yyvsp[-3].TypeVal).get()))
GEN_ERROR(
"Arithmetic operator requires integer, FP, or packed operands");
if (isa<VectorType>((*yyvsp[-3].TypeVal).get()) &&
(yyvsp[-4].BinaryOpVal == Instruction::URem ||
yyvsp[-4].BinaryOpVal == Instruction::SRem ||
yyvsp[-4].BinaryOpVal == Instruction::FRem))
GEN_ERROR("Remainder not supported on vector types");
Value* val1 = getVal(*yyvsp[-3].TypeVal, yyvsp[-2].ValIDVal);
CHECK_FOR_ERROR
Value* val2 = getVal(*yyvsp[-3].TypeVal, yyvsp[0].ValIDVal);
CHECK_FOR_ERROR
yyval.InstVal = BinaryOperator::create(yyvsp[-4].BinaryOpVal, val1, val2);
if (yyval.InstVal == 0)
GEN_ERROR("binary operator returned null");
delete yyvsp[-3].TypeVal;
}
break;
case 275:
#line 2769 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-3].TypeVal)->getDescription());
if (!(*yyvsp[-3].TypeVal)->isInteger()) {
if (Instruction::isShift(yyvsp[-4].BinaryOpVal) || !isa<VectorType>(yyvsp[-3].TypeVal->get()) ||
!cast<VectorType>(yyvsp[-3].TypeVal->get())->getElementType()->isInteger())
GEN_ERROR("Logical operator requires integral operands");
}
Value* tmpVal1 = getVal(*yyvsp[-3].TypeVal, yyvsp[-2].ValIDVal);
CHECK_FOR_ERROR
Value* tmpVal2 = getVal(*yyvsp[-3].TypeVal, yyvsp[0].ValIDVal);
CHECK_FOR_ERROR
yyval.InstVal = BinaryOperator::create(yyvsp[-4].BinaryOpVal, tmpVal1, tmpVal2);
if (yyval.InstVal == 0)
GEN_ERROR("binary operator returned null");
delete yyvsp[-3].TypeVal;
}
break;
case 276:
#line 2786 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-3].TypeVal)->getDescription());
if (isa<VectorType>((*yyvsp[-3].TypeVal).get()))
GEN_ERROR("Vector types not supported by icmp instruction");
Value* tmpVal1 = getVal(*yyvsp[-3].TypeVal, yyvsp[-2].ValIDVal);
CHECK_FOR_ERROR
Value* tmpVal2 = getVal(*yyvsp[-3].TypeVal, yyvsp[0].ValIDVal);
CHECK_FOR_ERROR
yyval.InstVal = CmpInst::create(yyvsp[-5].OtherOpVal, yyvsp[-4].IPredicate, tmpVal1, tmpVal2);
if (yyval.InstVal == 0)
GEN_ERROR("icmp operator returned null");
delete yyvsp[-3].TypeVal;
}
break;
case 277:
#line 2800 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-3].TypeVal)->getDescription());
if (isa<VectorType>((*yyvsp[-3].TypeVal).get()))
GEN_ERROR("Vector types not supported by fcmp instruction");
Value* tmpVal1 = getVal(*yyvsp[-3].TypeVal, yyvsp[-2].ValIDVal);
CHECK_FOR_ERROR
Value* tmpVal2 = getVal(*yyvsp[-3].TypeVal, yyvsp[0].ValIDVal);
CHECK_FOR_ERROR
yyval.InstVal = CmpInst::create(yyvsp[-5].OtherOpVal, yyvsp[-4].FPredicate, tmpVal1, tmpVal2);
if (yyval.InstVal == 0)
GEN_ERROR("fcmp operator returned null");
delete yyvsp[-3].TypeVal;
}
break;
case 278:
#line 2814 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[0].TypeVal)->getDescription());
Value* Val = yyvsp[-2].ValueVal;
const Type* DestTy = yyvsp[0].TypeVal->get();
if (!CastInst::castIsValid(yyvsp[-3].CastOpVal, Val, DestTy))
GEN_ERROR("invalid cast opcode for cast from '" +
Val->getType()->getDescription() + "' to '" +
DestTy->getDescription() + "'");
yyval.InstVal = CastInst::create(yyvsp[-3].CastOpVal, Val, DestTy);
delete yyvsp[0].TypeVal;
}
break;
case 279:
#line 2826 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (yyvsp[-4].ValueVal->getType() != Type::Int1Ty)
GEN_ERROR("select condition must be boolean");
if (yyvsp[-2].ValueVal->getType() != yyvsp[0].ValueVal->getType())
GEN_ERROR("select value types should match");
yyval.InstVal = new SelectInst(yyvsp[-4].ValueVal, yyvsp[-2].ValueVal, yyvsp[0].ValueVal);
CHECK_FOR_ERROR
}
break;
case 280:
#line 2834 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[0].TypeVal)->getDescription());
yyval.InstVal = new VAArgInst(yyvsp[-2].ValueVal, *yyvsp[0].TypeVal);
delete yyvsp[0].TypeVal;
CHECK_FOR_ERROR
}
break;
case 281:
#line 2841 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!ExtractElementInst::isValidOperands(yyvsp[-2].ValueVal, yyvsp[0].ValueVal))
GEN_ERROR("Invalid extractelement operands");
yyval.InstVal = new ExtractElementInst(yyvsp[-2].ValueVal, yyvsp[0].ValueVal);
CHECK_FOR_ERROR
}
break;
case 282:
#line 2847 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!InsertElementInst::isValidOperands(yyvsp[-4].ValueVal, yyvsp[-2].ValueVal, yyvsp[0].ValueVal))
GEN_ERROR("Invalid insertelement operands");
yyval.InstVal = new InsertElementInst(yyvsp[-4].ValueVal, yyvsp[-2].ValueVal, yyvsp[0].ValueVal);
CHECK_FOR_ERROR
}
break;
case 283:
#line 2853 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!ShuffleVectorInst::isValidOperands(yyvsp[-4].ValueVal, yyvsp[-2].ValueVal, yyvsp[0].ValueVal))
GEN_ERROR("Invalid shufflevector operands");
yyval.InstVal = new ShuffleVectorInst(yyvsp[-4].ValueVal, yyvsp[-2].ValueVal, yyvsp[0].ValueVal);
CHECK_FOR_ERROR
}
break;
case 284:
#line 2859 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
const Type *Ty = yyvsp[0].PHIList->front().first->getType();
if (!Ty->isFirstClassType())
GEN_ERROR("PHI node operands must be of first class type");
yyval.InstVal = new PHINode(Ty);
((PHINode*)yyval.InstVal)->reserveOperandSpace(yyvsp[0].PHIList->size());
while (yyvsp[0].PHIList->begin() != yyvsp[0].PHIList->end()) {
if (yyvsp[0].PHIList->front().first->getType() != Ty)
GEN_ERROR("All elements of a PHI node must be of the same type");
cast<PHINode>(yyval.InstVal)->addIncoming(yyvsp[0].PHIList->front().first, yyvsp[0].PHIList->front().second);
yyvsp[0].PHIList->pop_front();
}
delete yyvsp[0].PHIList; // Free the list...
CHECK_FOR_ERROR
}
break;
case 285:
#line 2875 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
// Handle the short syntax
const PointerType *PFTy = 0;
const FunctionType *Ty = 0;
if (!(PFTy = dyn_cast<PointerType>(yyvsp[-5].TypeVal->get())) ||
!(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) {
// Pull out the types of all of the arguments...
std::vector<const Type*> ParamTypes;
ParamAttrsVector Attrs;
if (yyvsp[0].ParamAttrs != ParamAttr::None) {
ParamAttrsWithIndex PAWI; PAWI.index = 0; PAWI.attrs = yyvsp[0].ParamAttrs;
Attrs.push_back(PAWI);
}
unsigned index = 1;
ValueRefList::iterator I = yyvsp[-2].ValueRefList->begin(), E = yyvsp[-2].ValueRefList->end();
for (; I != E; ++I, ++index) {
const Type *Ty = I->Val->getType();
if (Ty == Type::VoidTy)
GEN_ERROR("Short call syntax cannot be used with varargs");
ParamTypes.push_back(Ty);
if (I->Attrs != ParamAttr::None) {
ParamAttrsWithIndex PAWI; PAWI.index = index; PAWI.attrs = I->Attrs;
Attrs.push_back(PAWI);
}
}
ParamAttrsList *PAL = 0;
if (!Attrs.empty())
PAL = ParamAttrsList::get(Attrs);
Ty = FunctionType::get(yyvsp[-5].TypeVal->get(), ParamTypes, false, PAL);
PFTy = PointerType::get(Ty);
}
Value *V = getVal(PFTy, yyvsp[-4].ValIDVal); // Get the function we're calling...
CHECK_FOR_ERROR
// Check for call to invalid intrinsic to avoid crashing later.
if (Function *theF = dyn_cast<Function>(V)) {
if (theF->hasName() && (theF->getValueName()->getKeyLength() >= 5) &&
(0 == strncmp(theF->getValueName()->getKeyData(), "llvm.", 5)) &&
!theF->getIntrinsicID(true))
GEN_ERROR("Call to invalid LLVM intrinsic function '" +
theF->getName() + "'");
}
// Check the arguments
ValueList Args;
if (yyvsp[-2].ValueRefList->empty()) { // Has no arguments?
// Make sure no arguments is a good thing!
if (Ty->getNumParams() != 0)
GEN_ERROR("No arguments passed to a function that "
"expects arguments");
} else { // Has arguments?
// Loop through FunctionType's arguments and ensure they are specified
// correctly!
//
FunctionType::param_iterator I = Ty->param_begin();
FunctionType::param_iterator E = Ty->param_end();
ValueRefList::iterator ArgI = yyvsp[-2].ValueRefList->begin(), ArgE = yyvsp[-2].ValueRefList->end();
for (; ArgI != ArgE && I != E; ++ArgI, ++I) {
if (ArgI->Val->getType() != *I)
GEN_ERROR("Parameter " + ArgI->Val->getName()+ " is not of type '" +
(*I)->getDescription() + "'");
Args.push_back(ArgI->Val);
}
if (Ty->isVarArg()) {
if (I == E)
for (; ArgI != ArgE; ++ArgI)
Args.push_back(ArgI->Val); // push the remaining varargs
} else if (I != E || ArgI != ArgE)
GEN_ERROR("Invalid number of parameters detected");
}
// Create the call node
CallInst *CI = new CallInst(V, &Args[0], Args.size());
CI->setTailCall(yyvsp[-7].BoolVal);
CI->setCallingConv(yyvsp[-6].UIntVal);
yyval.InstVal = CI;
delete yyvsp[-2].ValueRefList;
delete yyvsp[-5].TypeVal;
CHECK_FOR_ERROR
}
break;
case 286:
#line 2959 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.InstVal = yyvsp[0].InstVal;
CHECK_FOR_ERROR
}
break;
case 287:
#line 2964 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.BoolVal = true;
CHECK_FOR_ERROR
}
break;
case 288:
#line 2968 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.BoolVal = false;
CHECK_FOR_ERROR
}
break;
case 289:
#line 2975 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription());
yyval.InstVal = new MallocInst(*yyvsp[-1].TypeVal, 0, yyvsp[0].UIntVal);
delete yyvsp[-1].TypeVal;
CHECK_FOR_ERROR
}
break;
case 290:
#line 2982 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-4].TypeVal)->getDescription());
Value* tmpVal = getVal(yyvsp[-2].PrimType, yyvsp[-1].ValIDVal);
CHECK_FOR_ERROR
yyval.InstVal = new MallocInst(*yyvsp[-4].TypeVal, tmpVal, yyvsp[0].UIntVal);
delete yyvsp[-4].TypeVal;
}
break;
case 291:
#line 2990 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription());
yyval.InstVal = new AllocaInst(*yyvsp[-1].TypeVal, 0, yyvsp[0].UIntVal);
delete yyvsp[-1].TypeVal;
CHECK_FOR_ERROR
}
break;
case 292:
#line 2997 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-4].TypeVal)->getDescription());
Value* tmpVal = getVal(yyvsp[-2].PrimType, yyvsp[-1].ValIDVal);
CHECK_FOR_ERROR
yyval.InstVal = new AllocaInst(*yyvsp[-4].TypeVal, tmpVal, yyvsp[0].UIntVal);
delete yyvsp[-4].TypeVal;
}
break;
case 293:
#line 3005 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!isa<PointerType>(yyvsp[0].ValueVal->getType()))
GEN_ERROR("Trying to free nonpointer type " +
yyvsp[0].ValueVal->getType()->getDescription() + "");
yyval.InstVal = new FreeInst(yyvsp[0].ValueVal);
CHECK_FOR_ERROR
}
break;
case 294:
#line 3013 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-2].TypeVal)->getDescription());
if (!isa<PointerType>(yyvsp[-2].TypeVal->get()))
GEN_ERROR("Can't load from nonpointer type: " +
(*yyvsp[-2].TypeVal)->getDescription());
if (!cast<PointerType>(yyvsp[-2].TypeVal->get())->getElementType()->isFirstClassType())
GEN_ERROR("Can't load from pointer of non-first-class type: " +
(*yyvsp[-2].TypeVal)->getDescription());
Value* tmpVal = getVal(*yyvsp[-2].TypeVal, yyvsp[-1].ValIDVal);
CHECK_FOR_ERROR
yyval.InstVal = new LoadInst(tmpVal, "", yyvsp[-4].BoolVal, yyvsp[0].UIntVal);
delete yyvsp[-2].TypeVal;
}
break;
case 295:
#line 3027 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-2].TypeVal)->getDescription());
const PointerType *PT = dyn_cast<PointerType>(yyvsp[-2].TypeVal->get());
if (!PT)
GEN_ERROR("Can't store to a nonpointer type: " +
(*yyvsp[-2].TypeVal)->getDescription());
const Type *ElTy = PT->getElementType();
if (ElTy != yyvsp[-4].ValueVal->getType())
GEN_ERROR("Can't store '" + yyvsp[-4].ValueVal->getType()->getDescription() +
"' into space of type '" + ElTy->getDescription() + "'");
Value* tmpVal = getVal(*yyvsp[-2].TypeVal, yyvsp[-1].ValIDVal);
CHECK_FOR_ERROR
yyval.InstVal = new StoreInst(yyvsp[-4].ValueVal, tmpVal, yyvsp[-6].BoolVal, yyvsp[0].UIntVal);
delete yyvsp[-2].TypeVal;
}
break;
case 296:
#line 3044 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-2].TypeVal)->getDescription());
if (!isa<PointerType>(yyvsp[-2].TypeVal->get()))
GEN_ERROR("getelementptr insn requires pointer operand");
if (!GetElementPtrInst::getIndexedType(*yyvsp[-2].TypeVal, &(*yyvsp[0].ValueList)[0], yyvsp[0].ValueList->size(), true))
GEN_ERROR("Invalid getelementptr indices for type '" +
(*yyvsp[-2].TypeVal)->getDescription()+ "'");
Value* tmpVal = getVal(*yyvsp[-2].TypeVal, yyvsp[-1].ValIDVal);
CHECK_FOR_ERROR
yyval.InstVal = new GetElementPtrInst(tmpVal, &(*yyvsp[0].ValueList)[0], yyvsp[0].ValueList->size());
delete yyvsp[-2].TypeVal;
delete yyvsp[0].ValueList;
}
break;
}
/* Line 1016 of /usr/local/share/bison/yacc.c. */
#line 5688 "llvmAsmParser.tab.c"
yyvsp -= yylen;
yyssp -= yylen;
#if YYDEBUG
if (yydebug)
{
short *yyssp1 = yyss - 1;
YYFPRINTF (stderr, "state stack now");
while (yyssp1 != yyssp)
YYFPRINTF (stderr, " %d", *++yyssp1);
YYFPRINTF (stderr, "\n");
}
#endif
*++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);
char *yymsg;
int yyx, yycount;
yycount = 0;
/* Start YYX at -YYN if negative to avoid negative indexes in
YYCHECK. */
for (yyx = yyn < 0 ? -yyn : 0;
yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++)
if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
yysize += yystrlen (yytname[yyx]) + 15, yycount++;
yysize += yystrlen ("parse error, unexpected ") + 1;
yysize += yystrlen (yytname[yytype]);
yymsg = (char *) YYSTACK_ALLOC (yysize);
if (yymsg != 0)
{
char *yyp = yystpcpy (yymsg, "parse error, unexpected ");
yyp = yystpcpy (yyp, yytname[yytype]);
if (yycount < 5)
{
yycount = 0;
for (yyx = yyn < 0 ? -yyn : 0;
yyx < (int) (sizeof (yytname) / sizeof (char *));
yyx++)
if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
{
const char *yyq = ! yycount ? ", expecting " : " or ";
yyp = yystpcpy (yyp, yyq);
yyp = yystpcpy (yyp, yytname[yyx]);
yycount++;
}
}
yyerror (yymsg);
YYSTACK_FREE (yymsg);
}
else
yyerror ("parse error; also virtual memory exhausted");
}
else
#endif /* YYERROR_VERBOSE */
yyerror ("parse error");
}
goto yyerrlab1;
/*----------------------------------------------------.
| yyerrlab1 -- error raised explicitly by an action. |
`----------------------------------------------------*/
yyerrlab1:
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)
{
/* Pop the error token. */
YYPOPSTACK;
/* Pop the rest of the stack. */
while (yyssp > yyss)
{
YYDPRINTF ((stderr, "Error: popping "));
YYDSYMPRINT ((stderr,
yystos[*yyssp],
*yyvsp));
YYDPRINTF ((stderr, "\n"));
yydestruct (yystos[*yyssp], *yyvsp);
YYPOPSTACK;
}
YYABORT;
}
YYDPRINTF ((stderr, "Discarding token %d (%s).\n",
yychar, yytname[yychar1]));
yydestruct (yychar1, yylval);
yychar = YYEMPTY;
}
/* Else will try to reuse lookahead token after shifting the error
token. */
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;
YYDPRINTF ((stderr, "Error: popping "));
YYDSYMPRINT ((stderr,
yystos[*yyssp], *yyvsp));
YYDPRINTF ((stderr, "\n"));
yydestruct (yystos[yystate], *yyvsp);
yyvsp--;
yystate = *--yyssp;
#if YYDEBUG
if (yydebug)
{
short *yyssp1 = yyss - 1;
YYFPRINTF (stderr, "Error: state stack now");
while (yyssp1 != yyssp)
YYFPRINTF (stderr, " %d", *++yyssp1);
YYFPRINTF (stderr, "\n");
}
#endif
}
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 3061 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
// common code from the two 'RunVMAsmParser' functions
static Module* RunParser(Module * M) {
llvmAsmlineno = 1; // Reset the current line number...
CurModule.CurrentModule = M;
#if YYDEBUG
yydebug = Debug;
#endif
// Check to make sure the parser succeeded
if (yyparse()) {
if (ParserResult)
delete ParserResult;
return 0;
}
// Emit an error if there are any unresolved types left.
if (!CurModule.LateResolveTypes.empty()) {
const ValID &DID = CurModule.LateResolveTypes.begin()->first;
if (DID.Type == ValID::LocalName) {
GenerateError("Undefined type remains at eof: '"+DID.getName() + "'");
} else {
GenerateError("Undefined type remains at eof: #" + itostr(DID.Num));
}
if (ParserResult)
delete ParserResult;
return 0;
}
// Emit an error if there are any unresolved values left.
if (!CurModule.LateResolveValues.empty()) {
Value *V = CurModule.LateResolveValues.back();
std::map<Value*, std::pair<ValID, int> >::iterator I =
CurModule.PlaceHolderInfo.find(V);
if (I != CurModule.PlaceHolderInfo.end()) {
ValID &DID = I->second.first;
if (DID.Type == ValID::LocalName) {
GenerateError("Undefined value remains at eof: "+DID.getName() + "'");
} else {
GenerateError("Undefined value remains at eof: #" + itostr(DID.Num));
}
if (ParserResult)
delete ParserResult;
return 0;
}
}
// Check to make sure that parsing produced a result
if (!ParserResult)
return 0;
// Reset ParserResult variable while saving its value for the result.
Module *Result = ParserResult;
ParserResult = 0;
return Result;
}
void llvm::GenerateError(const std::string &message, int LineNo) {
if (LineNo == -1) LineNo = llvmAsmlineno;
// TODO: column number in exception
if (TheParseError)
TheParseError->setError(CurFilename, message, LineNo);
TriggerError = 1;
}
int yyerror(const char *ErrorMsg) {
std::string where
= std::string((CurFilename == "-") ? std::string("<stdin>") : CurFilename)
+ ":" + utostr((unsigned) llvmAsmlineno) + ": ";
std::string errMsg = where + "error: " + std::string(ErrorMsg);
if (yychar != YYEMPTY && yychar != 0)
errMsg += " while reading token: '" + std::string(llvmAsmtext, llvmAsmleng)+
"'";
GenerateError(errMsg);
return 0;
}