blob: 7f94f1d052792b8ff5dac6f3a2d19e06d5940544 [file] [log] [blame]
/* A Bison parser, made from /Volumes/MacOS9/gcc/llvm/lib/AsmParser/llvmAsmParser.y
by GNU Bison version 1.28 */
#define YYBISON 1 /* Identify Bison output. */
#define yyparse llvmAsmparse
#define yylex llvmAsmlex
#define yyerror llvmAsmerror
#define yylval llvmAsmlval
#define yychar llvmAsmchar
#define yydebug llvmAsmdebug
#define yynerrs llvmAsmnerrs
#define ESINT64VAL 257
#define EUINT64VAL 258
#define ESAPINTVAL 259
#define EUAPINTVAL 260
#define LOCALVAL_ID 261
#define GLOBALVAL_ID 262
#define FPVAL 263
#define VOID 264
#define INTTYPE 265
#define FLOAT 266
#define DOUBLE 267
#define X86_FP80 268
#define FP128 269
#define PPC_FP128 270
#define LABEL 271
#define TYPE 272
#define LOCALVAR 273
#define GLOBALVAR 274
#define LABELSTR 275
#define STRINGCONSTANT 276
#define ATSTRINGCONSTANT 277
#define PCTSTRINGCONSTANT 278
#define ZEROINITIALIZER 279
#define TRUETOK 280
#define FALSETOK 281
#define BEGINTOK 282
#define ENDTOK 283
#define DECLARE 284
#define DEFINE 285
#define GLOBAL 286
#define CONSTANT 287
#define SECTION 288
#define ALIAS 289
#define VOLATILE 290
#define THREAD_LOCAL 291
#define TO 292
#define DOTDOTDOT 293
#define NULL_TOK 294
#define UNDEF 295
#define INTERNAL 296
#define LINKONCE 297
#define WEAK 298
#define APPENDING 299
#define DLLIMPORT 300
#define DLLEXPORT 301
#define EXTERN_WEAK 302
#define OPAQUE 303
#define EXTERNAL 304
#define TARGET 305
#define TRIPLE 306
#define ALIGN 307
#define DEPLIBS 308
#define CALL 309
#define TAIL 310
#define ASM_TOK 311
#define MODULE 312
#define SIDEEFFECT 313
#define CC_TOK 314
#define CCC_TOK 315
#define FASTCC_TOK 316
#define COLDCC_TOK 317
#define X86_STDCALLCC_TOK 318
#define X86_FASTCALLCC_TOK 319
#define DATALAYOUT 320
#define RET 321
#define BR 322
#define SWITCH 323
#define INVOKE 324
#define UNWIND 325
#define UNREACHABLE 326
#define ADD 327
#define SUB 328
#define MUL 329
#define UDIV 330
#define SDIV 331
#define FDIV 332
#define UREM 333
#define SREM 334
#define FREM 335
#define AND 336
#define OR 337
#define XOR 338
#define SHL 339
#define LSHR 340
#define ASHR 341
#define ICMP 342
#define FCMP 343
#define EQ 344
#define NE 345
#define SLT 346
#define SGT 347
#define SLE 348
#define SGE 349
#define ULT 350
#define UGT 351
#define ULE 352
#define UGE 353
#define OEQ 354
#define ONE 355
#define OLT 356
#define OGT 357
#define OLE 358
#define OGE 359
#define ORD 360
#define UNO 361
#define UEQ 362
#define UNE 363
#define MALLOC 364
#define ALLOCA 365
#define FREE 366
#define LOAD 367
#define STORE 368
#define GETELEMENTPTR 369
#define TRUNC 370
#define ZEXT 371
#define SEXT 372
#define FPTRUNC 373
#define FPEXT 374
#define BITCAST 375
#define UITOFP 376
#define SITOFP 377
#define FPTOUI 378
#define FPTOSI 379
#define INTTOPTR 380
#define PTRTOINT 381
#define PHI_TOK 382
#define SELECT 383
#define VAARG 384
#define EXTRACTELEMENT 385
#define INSERTELEMENT 386
#define SHUFFLEVECTOR 387
#define SIGNEXT 388
#define ZEROEXT 389
#define NORETURN 390
#define INREG 391
#define SRET 392
#define NOUNWIND 393
#define NOALIAS 394
#define BYVAL 395
#define NEST 396
#define DEFAULT 397
#define HIDDEN 398
#define PROTECTED 399
#line 14 "/Volumes/MacOS9/gcc/llvm/lib/AsmParser/llvmAsmParser.y"
#include "ParserInternals.h"
#include "llvm/CallingConv.h"
#include "llvm/InlineAsm.h"
#include "llvm/Instructions.h"
#include "llvm/Module.h"
#include "llvm/ValueSymbolTable.h"
#include "llvm/AutoUpgrade.h"
#include "llvm/Support/GetElementPtrTypeIterator.h"
#include "llvm/Support/CommandLine.h"
#include "llvm/ADT/SmallVector.h"
#include "llvm/ADT/STLExtras.h"
#include "llvm/Support/MathExtras.h"
#include "llvm/Support/Streams.h"
#include <algorithm>
#include <list>
#include <map>
#include <utility>
#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;
}
// Look for intrinsic functions and CallInst that need to be upgraded
for (Module::iterator FI = CurrentModule->begin(),
FE = CurrentModule->end(); FI != FE; )
UpgradeCallsToIntrinsic(FI++); // must be post-increment, as we remove
Values.clear(); // Clear out function local definitions
Types.clear();
CurrentModule = 0;
}
// GetForwardRefForGlobal - Check to see if there is a forward reference
// for this global. If so, remove it from the GlobalRefs map and return it.
// If not, just return null.
GlobalValue *GetForwardRefForGlobal(const PointerType *PTy, ValID ID) {
// Check to see if there is a forward reference to this global variable...
// if there is, eliminate it and patch the reference to use the new def'n.
GlobalRefsType::iterator I = GlobalRefs.find(std::make_pair(PTy, ID));
GlobalValue *Ret = 0;
if (I != GlobalRefs.end()) {
Ret = I->second;
GlobalRefs.erase(I);
}
return Ret;
}
bool TypeIsUnresolved(PATypeHolder* PATy) {
// If it isn't abstract, its resolved
const Type* Ty = PATy->get();
if (!Ty->isAbstract())
return false;
// Traverse the type looking for abstract types. If it isn't abstract then
// we don't need to traverse that leg of the type.
std::vector<const Type*> WorkList, SeenList;
WorkList.push_back(Ty);
while (!WorkList.empty()) {
const Type* Ty = WorkList.back();
SeenList.push_back(Ty);
WorkList.pop_back();
if (const OpaqueType* OpTy = dyn_cast<OpaqueType>(Ty)) {
// Check to see if this is an unresolved type
std::map<ValID, PATypeHolder>::iterator I = LateResolveTypes.begin();
std::map<ValID, PATypeHolder>::iterator E = LateResolveTypes.end();
for ( ; I != E; ++I) {
if (I->second.get() == OpTy)
return true;
}
} else if (const SequentialType* SeqTy = dyn_cast<SequentialType>(Ty)) {
const Type* TheTy = SeqTy->getElementType();
if (TheTy->isAbstract() && TheTy != Ty) {
std::vector<const Type*>::iterator I = SeenList.begin(),
E = SeenList.end();
for ( ; I != E; ++I)
if (*I == TheTy)
break;
if (I == E)
WorkList.push_back(TheTy);
}
} else if (const StructType* StrTy = dyn_cast<StructType>(Ty)) {
for (unsigned i = 0; i < StrTy->getNumElements(); ++i) {
const Type* TheTy = StrTy->getElementType(i);
if (TheTy->isAbstract() && TheTy != Ty) {
std::vector<const Type*>::iterator I = SeenList.begin(),
E = SeenList.end();
for ( ; I != E; ++I)
if (*I == TheTy)
break;
if (I == E)
WorkList.push_back(TheTy);
}
}
}
}
return false;
}
} CurModule;
static struct PerFunctionInfo {
Function *CurrentFunction; // Pointer to current function being created
ValueList Values; // Keep track of #'d definitions
unsigned NextValNum;
ValueList LateResolveValues;
bool isDeclare; // Is this function a forward declararation?
GlobalValue::LinkageTypes Linkage; // Linkage for forward declaration.
GlobalValue::VisibilityTypes Visibility;
/// BBForwardRefs - When we see forward references to basic blocks, keep
/// track of them here.
std::map<ValID, BasicBlock*> BBForwardRefs;
inline PerFunctionInfo() {
CurrentFunction = 0;
isDeclare = false;
Linkage = GlobalValue::ExternalLinkage;
Visibility = GlobalValue::DefaultVisibility;
}
inline void FunctionStart(Function *M) {
CurrentFunction = M;
NextValNum = 0;
}
void FunctionDone() {
// Any forward referenced blocks left?
if (!BBForwardRefs.empty()) {
GenerateError("Undefined reference to label " +
BBForwardRefs.begin()->second->getName());
return;
}
// Resolve all forward references now.
ResolveDefinitions(LateResolveValues, &CurModule.LateResolveValues);
Values.clear(); // Clear out function local definitions
BBForwardRefs.clear();
CurrentFunction = 0;
isDeclare = false;
Linkage = GlobalValue::ExternalLinkage;
Visibility = GlobalValue::DefaultVisibility;
}
} CurFun; // Info for the current function...
static bool inFunctionScope() { return CurFun.CurrentFunction != 0; }
//===----------------------------------------------------------------------===//
// Code to handle definitions of all the types
//===----------------------------------------------------------------------===//
static void InsertValue(Value *V, ValueList &ValueTab = CurFun.Values) {
// Things that have names or are void typed don't get slot numbers
if (V->hasName() || (V->getType() == Type::VoidTy))
return;
// In the case of function values, we have to allow for the forward reference
// of basic blocks, which are included in the numbering. Consequently, we keep
// track of the next insertion location with NextValNum. When a BB gets
// inserted, it could change the size of the CurFun.Values vector.
if (&ValueTab == &CurFun.Values) {
if (ValueTab.size() <= CurFun.NextValNum)
ValueTab.resize(CurFun.NextValNum+1);
ValueTab[CurFun.NextValNum++] = V;
return;
}
// For all other lists, its okay to just tack it on the back of the vector.
ValueTab.push_back(V);
}
static const Type *getTypeVal(const ValID &D, bool DoNotImprovise = false) {
switch (D.Type) {
case ValID::LocalID: // Is it a numbered definition?
// Module constants occupy the lowest numbered slots...
if (D.Num < CurModule.Types.size())
return CurModule.Types[D.Num];
break;
case ValID::LocalName: // Is it a named definition?
if (const Type *N = CurModule.CurrentModule->getTypeByName(D.getName())) {
D.destroy(); // Free old strdup'd memory...
return N;
}
break;
default:
GenerateError("Internal parser error: Invalid symbol type reference");
return 0;
}
// If we reached here, we referenced either a symbol that we don't know about
// or an id number that hasn't been read yet. We may be referencing something
// forward, so just create an entry to be resolved later and get to it...
//
if (DoNotImprovise) return 0; // Do we just want a null to be returned?
if (inFunctionScope()) {
if (D.Type == ValID::LocalName) {
GenerateError("Reference to an undefined type: '" + D.getName() + "'");
return 0;
} else {
GenerateError("Reference to an undefined type: #" + utostr(D.Num));
return 0;
}
}
std::map<ValID, PATypeHolder>::iterator I =CurModule.LateResolveTypes.find(D);
if (I != CurModule.LateResolveTypes.end())
return I->second;
Type *Typ = OpaqueType::get();
CurModule.LateResolveTypes.insert(std::make_pair(D, Typ));
return Typ;
}
// getExistingVal - Look up the value specified by the provided type and
// the provided ValID. If the value exists and has already been defined, return
// it. Otherwise return null.
//
static Value *getExistingVal(const Type *Ty, const ValID &D) {
if (isa<FunctionType>(Ty)) {
GenerateError("Functions are not values and "
"must be referenced as pointers");
return 0;
}
switch (D.Type) {
case ValID::LocalID: { // Is it a numbered definition?
// Check that the number is within bounds.
if (D.Num >= CurFun.Values.size())
return 0;
Value *Result = CurFun.Values[D.Num];
if (Ty != Result->getType()) {
GenerateError("Numbered value (%" + utostr(D.Num) + ") of type '" +
Result->getType()->getDescription() + "' does not match "
"expected type, '" + Ty->getDescription() + "'");
return 0;
}
return Result;
}
case ValID::GlobalID: { // Is it a numbered definition?
if (D.Num >= CurModule.Values.size())
return 0;
Value *Result = CurModule.Values[D.Num];
if (Ty != Result->getType()) {
GenerateError("Numbered value (@" + utostr(D.Num) + ") of type '" +
Result->getType()->getDescription() + "' does not match "
"expected type, '" + Ty->getDescription() + "'");
return 0;
}
return Result;
}
case ValID::LocalName: { // Is it a named definition?
if (!inFunctionScope())
return 0;
ValueSymbolTable &SymTab = CurFun.CurrentFunction->getValueSymbolTable();
Value *N = SymTab.lookup(D.getName());
if (N == 0)
return 0;
if (N->getType() != Ty)
return 0;
D.destroy(); // Free old strdup'd memory...
return N;
}
case ValID::GlobalName: { // Is it a named definition?
ValueSymbolTable &SymTab = CurModule.CurrentModule->getValueSymbolTable();
Value *N = SymTab.lookup(D.getName());
if (N == 0)
return 0;
if (N->getType() != Ty)
return 0;
D.destroy(); // Free old strdup'd memory...
return N;
}
// Check to make sure that "Ty" is an integral type, and that our
// value will fit into the specified type...
case ValID::ConstSIntVal: // Is it a constant pool reference??
if (!ConstantInt::isValueValidForType(Ty, D.ConstPool64)) {
GenerateError("Signed integral constant '" +
itostr(D.ConstPool64) + "' is invalid for type '" +
Ty->getDescription() + "'");
return 0;
}
return ConstantInt::get(Ty, D.ConstPool64, true);
case ValID::ConstUIntVal: // Is it an unsigned const pool reference?
if (!ConstantInt::isValueValidForType(Ty, D.UConstPool64)) {
if (!ConstantInt::isValueValidForType(Ty, D.ConstPool64)) {
GenerateError("Integral constant '" + utostr(D.UConstPool64) +
"' is invalid or out of range");
return 0;
} else { // This is really a signed reference. Transmogrify.
return ConstantInt::get(Ty, D.ConstPool64, true);
}
} else {
return ConstantInt::get(Ty, D.UConstPool64);
}
case ValID::ConstFPVal: // Is it a floating point const pool reference?
if (!ConstantFP::isValueValidForType(Ty, *D.ConstPoolFP)) {
GenerateError("FP constant invalid for type");
return 0;
}
// Lexer has no type info, so builds all float and double FP constants
// as double. Fix this here. Long double does not need this.
if (&D.ConstPoolFP->getSemantics() == &APFloat::IEEEdouble &&
Ty==Type::FloatTy)
D.ConstPoolFP->convert(APFloat::IEEEsingle, APFloat::rmNearestTiesToEven);
return ConstantFP::get(Ty, *D.ConstPoolFP);
case ValID::ConstNullVal: // Is it a null value?
if (!isa<PointerType>(Ty)) {
GenerateError("Cannot create a a non pointer null");
return 0;
}
return ConstantPointerNull::get(cast<PointerType>(Ty));
case ValID::ConstUndefVal: // Is it an undef value?
return UndefValue::get(Ty);
case ValID::ConstZeroVal: // Is it a zero value?
return Constant::getNullValue(Ty);
case ValID::ConstantVal: // Fully resolved constant?
if (D.ConstantValue->getType() != Ty) {
GenerateError("Constant expression type different from required type");
return 0;
}
return D.ConstantValue;
case ValID::InlineAsmVal: { // Inline asm expression
const PointerType *PTy = dyn_cast<PointerType>(Ty);
const FunctionType *FTy =
PTy ? dyn_cast<FunctionType>(PTy->getElementType()) : 0;
if (!FTy || !InlineAsm::Verify(FTy, D.IAD->Constraints)) {
GenerateError("Invalid type for asm constraint string");
return 0;
}
InlineAsm *IA = InlineAsm::get(FTy, D.IAD->AsmString, D.IAD->Constraints,
D.IAD->HasSideEffects);
D.destroy(); // Free InlineAsmDescriptor.
return IA;
}
default:
assert(0 && "Unhandled case!");
return 0;
} // End of switch
assert(0 && "Unhandled case!");
return 0;
}
// getVal - This function is identical to getExistingVal, except that if a
// value is not already defined, it "improvises" by creating a placeholder var
// that looks and acts just like the requested variable. When the value is
// defined later, all uses of the placeholder variable are replaced with the
// real thing.
//
static Value *getVal(const Type *Ty, const ValID &ID) {
if (Ty == Type::LabelTy) {
GenerateError("Cannot use a basic block here");
return 0;
}
// See if the value has already been defined.
Value *V = getExistingVal(Ty, ID);
if (V) return V;
if (TriggerError) return 0;
if (!Ty->isFirstClassType() && !isa<OpaqueType>(Ty)) {
GenerateError("Invalid use of a composite type");
return 0;
}
// If we reached here, we referenced either a symbol that we don't know about
// or an id number that hasn't been read yet. We may be referencing something
// forward, so just create an entry to be resolved later and get to it...
//
switch (ID.Type) {
case ValID::GlobalName:
case ValID::GlobalID: {
const PointerType *PTy = dyn_cast<PointerType>(Ty);
if (!PTy) {
GenerateError("Invalid type for reference to global" );
return 0;
}
const Type* ElTy = PTy->getElementType();
if (const FunctionType *FTy = dyn_cast<FunctionType>(ElTy))
V = new Function(FTy, GlobalValue::ExternalLinkage);
else
V = new GlobalVariable(ElTy, false, GlobalValue::ExternalLinkage);
break;
}
default:
V = new Argument(Ty);
}
// Remember where this forward reference came from. FIXME, shouldn't we try
// to recycle these things??
CurModule.PlaceHolderInfo.insert(std::make_pair(V, std::make_pair(ID,
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.getName() : "");
BB = new BasicBlock(Name, CurFun.CurrentFunction);
if (ID.Type == ValID::LocalID) {
assert(ID.Num == CurFun.NextValNum && "Invalid new block number");
InsertValue(BB);
}
ID.destroy(); // Free strdup'd memory
return BB;
}
/// getBBVal - get an existing BB value or create a forward reference for it.
///
static BasicBlock *getBBVal(const ValID &ID) {
assert(inFunctionScope() && "Can't get basic block at global scope!");
BasicBlock *BB = 0;
std::map<ValID, BasicBlock*>::iterator BBI = CurFun.BBForwardRefs.find(ID);
if (BBI != CurFun.BBForwardRefs.end()) {
BB = BBI->second;
} if (ID.Type == ValID::LocalName) {
std::string Name = ID.getName();
Value *N = CurFun.CurrentFunction->getValueSymbolTable().lookup(Name);
if (N)
if (N->getType()->getTypeID() == Type::LabelTyID)
BB = cast<BasicBlock>(N);
else
GenerateError("Reference to label '" + Name + "' is actually of type '"+
N->getType()->getDescription() + "'");
} else if (ID.Type == ValID::LocalID) {
if (ID.Num < CurFun.NextValNum && ID.Num < CurFun.Values.size()) {
if (CurFun.Values[ID.Num]->getType()->getTypeID() == Type::LabelTyID)
BB = cast<BasicBlock>(CurFun.Values[ID.Num]);
else
GenerateError("Reference to label '%" + utostr(ID.Num) +
"' is actually of type '"+
CurFun.Values[ID.Num]->getType()->getDescription() + "'");
}
} else {
GenerateError("Illegal label reference " + ID.getName());
return 0;
}
// If its already been defined, return it now.
if (BB) {
ID.destroy(); // Free strdup'd memory.
return BB;
}
// Otherwise, this block has not been seen before, create it.
std::string Name;
if (ID.Type == ValID::LocalName)
Name = ID.getName();
BB = new BasicBlock(Name, CurFun.CurrentFunction);
// Insert it in the forward refs map.
CurFun.BBForwardRefs[ID] = BB;
return BB;
}
//===----------------------------------------------------------------------===//
// Code to handle forward references in instructions
//===----------------------------------------------------------------------===//
//
// This code handles the late binding needed with statements that reference
// values not defined yet... for example, a forward branch, or the PHI node for
// a loop body.
//
// This keeps a table (CurFun.LateResolveValues) of all such forward references
// and back patchs after we are done.
//
// ResolveDefinitions - If we could not resolve some defs at parsing
// time (forward branches, phi functions for loops, etc...) resolve the
// defs now...
//
static void
ResolveDefinitions(ValueList &LateResolvers, ValueList *FutureLateResolvers) {
// Loop over LateResolveDefs fixing up stuff that couldn't be resolved
while (!LateResolvers.empty()) {
Value *V = LateResolvers.back();
LateResolvers.pop_back();
std::map<Value*, std::pair<ValID, int> >::iterator PHI =
CurModule.PlaceHolderInfo.find(V);
assert(PHI != CurModule.PlaceHolderInfo.end() && "Placeholder error!");
ValID &DID = PHI->second.first;
Value *TheRealValue = getExistingVal(V->getType(), DID);
if (TriggerError)
return;
if (TheRealValue) {
V->replaceAllUsesWith(TheRealValue);
delete V;
CurModule.PlaceHolderInfo.erase(PHI);
} else if (FutureLateResolvers) {
// Functions have their unresolved items forwarded to the module late
// resolver table
InsertValue(V, *FutureLateResolvers);
} else {
if (DID.Type == ValID::LocalName || DID.Type == ValID::GlobalName) {
GenerateError("Reference to an invalid definition: '" +DID.getName()+
"' of type '" + V->getType()->getDescription() + "'",
PHI->second.second);
return;
} else {
GenerateError("Reference to an invalid definition: #" +
itostr(DID.Num) + " of type '" +
V->getType()->getDescription() + "'",
PHI->second.second);
return;
}
}
}
LateResolvers.clear();
}
// ResolveTypeTo - A brand new type was just declared. This means that (if
// name is not null) things referencing Name can be resolved. Otherwise, things
// refering to the number can be resolved. Do this now.
//
static void ResolveTypeTo(std::string *Name, const Type *ToTy) {
ValID D;
if (Name)
D = ValID::createLocalName(*Name);
else
D = ValID::createLocalID(CurModule.Types.size());
std::map<ValID, PATypeHolder>::iterator I =
CurModule.LateResolveTypes.find(D);
if (I != CurModule.LateResolveTypes.end()) {
((DerivedType*)I->second.get())->refineAbstractTypeTo(ToTy);
CurModule.LateResolveTypes.erase(I);
}
}
// setValueName - Set the specified value to the name given. The name may be
// null potentially, in which case this is a noop. The string passed in is
// assumed to be a malloc'd string buffer, and is free'd by this function.
//
static void setValueName(Value *V, std::string *NameStr) {
if (!NameStr) return;
std::string Name(*NameStr); // Copy string
delete NameStr; // Free old string
if (V->getType() == Type::VoidTy) {
GenerateError("Can't assign name '" + Name+"' to value with void type");
return;
}
assert(inFunctionScope() && "Must be in function scope!");
ValueSymbolTable &ST = CurFun.CurrentFunction->getValueSymbolTable();
if (ST.lookup(Name)) {
GenerateError("Redefinition of value '" + Name + "' of type '" +
V->getType()->getDescription() + "'");
return;
}
// Set the name.
V->setName(Name);
}
/// ParseGlobalVariable - Handle parsing of a global. If Initializer is null,
/// this is a declaration, otherwise it is a definition.
static GlobalVariable *
ParseGlobalVariable(std::string *NameStr,
GlobalValue::LinkageTypes Linkage,
GlobalValue::VisibilityTypes Visibility,
bool isConstantGlobal, const Type *Ty,
Constant *Initializer, bool IsThreadLocal) {
if (isa<FunctionType>(Ty)) {
GenerateError("Cannot declare global vars of function type");
return 0;
}
const PointerType *PTy = PointerType::get(Ty);
std::string Name;
if (NameStr) {
Name = *NameStr; // Copy string
delete NameStr; // Free old string
}
// See if this global value was forward referenced. If so, recycle the
// object.
ValID ID;
if (!Name.empty()) {
ID = ValID::createGlobalName(Name);
} else {
ID = ValID::createGlobalID(CurModule.Values.size());
}
if (GlobalValue *FWGV = CurModule.GetForwardRefForGlobal(PTy, ID)) {
// Move the global to the end of the list, from whereever it was
// previously inserted.
GlobalVariable *GV = cast<GlobalVariable>(FWGV);
CurModule.CurrentModule->getGlobalList().remove(GV);
CurModule.CurrentModule->getGlobalList().push_back(GV);
GV->setInitializer(Initializer);
GV->setLinkage(Linkage);
GV->setVisibility(Visibility);
GV->setConstant(isConstantGlobal);
GV->setThreadLocal(IsThreadLocal);
InsertValue(GV, CurModule.Values);
return GV;
}
// If this global has a name
if (!Name.empty()) {
// if the global we're parsing has an initializer (is a definition) and
// has external linkage.
if (Initializer && Linkage != GlobalValue::InternalLinkage)
// If there is already a global with external linkage with this name
if (CurModule.CurrentModule->getGlobalVariable(Name, false)) {
// If we allow this GVar to get created, it will be renamed in the
// symbol table because it conflicts with an existing GVar. We can't
// allow redefinition of GVars whose linking indicates that their name
// must stay the same. Issue the error.
GenerateError("Redefinition of global variable named '" + Name +
"' of type '" + Ty->getDescription() + "'");
return 0;
}
}
// Otherwise there is no existing GV to use, create one now.
GlobalVariable *GV =
new GlobalVariable(Ty, isConstantGlobal, Linkage, Initializer, Name,
CurModule.CurrentModule, IsThreadLocal);
GV->setVisibility(Visibility);
InsertValue(GV, CurModule.Values);
return GV;
}
// setTypeName - Set the specified type to the name given. The name may be
// null potentially, in which case this is a noop. The string passed in is
// assumed to be a malloc'd string buffer, and is freed by this function.
//
// This function returns true if the type has already been defined, but is
// allowed to be redefined in the specified context. If the name is a new name
// for the type plane, it is inserted and false is returned.
static bool setTypeName(const Type *T, std::string *NameStr) {
assert(!inFunctionScope() && "Can't give types function-local names!");
if (NameStr == 0) return false;
std::string Name(*NameStr); // Copy string
delete NameStr; // Free old string
// We don't allow assigning names to void type
if (T == Type::VoidTy) {
GenerateError("Can't assign name '" + Name + "' to the void type");
return false;
}
// Set the type name, checking for conflicts as we do so.
bool AlreadyExists = CurModule.CurrentModule->addTypeName(Name, T);
if (AlreadyExists) { // Inserting a name that is already defined???
const Type *Existing = CurModule.CurrentModule->getTypeByName(Name);
assert(Existing && "Conflict but no matching type?!");
// There is only one case where this is allowed: when we are refining an
// opaque type. In this case, Existing will be an opaque type.
if (const OpaqueType *OpTy = dyn_cast<OpaqueType>(Existing)) {
// We ARE replacing an opaque type!
const_cast<OpaqueType*>(OpTy)->refineAbstractTypeTo(T);
return true;
}
// Otherwise, this is an attempt to redefine a type. That's okay if
// the redefinition is identical to the original. This will be so if
// Existing and T point to the same Type object. In this one case we
// allow the equivalent redefinition.
if (Existing == T) return true; // Yes, it's equal.
// Any other kind of (non-equivalent) redefinition is an error.
GenerateError("Redefinition of type named '" + Name + "' of type '" +
T->getDescription() + "'");
}
return false;
}
//===----------------------------------------------------------------------===//
// Code for handling upreferences in type names...
//
// TypeContains - Returns true if Ty directly contains E in it.
//
static bool TypeContains(const Type *Ty, const Type *E) {
return std::find(Ty->subtype_begin(), Ty->subtype_end(),
E) != Ty->subtype_end();
}
namespace {
struct UpRefRecord {
// NestingLevel - The number of nesting levels that need to be popped before
// this type is resolved.
unsigned NestingLevel;
// LastContainedTy - This is the type at the current binding level for the
// type. Every time we reduce the nesting level, this gets updated.
const Type *LastContainedTy;
// UpRefTy - This is the actual opaque type that the upreference is
// represented with.
OpaqueType *UpRefTy;
UpRefRecord(unsigned NL, OpaqueType *URTy)
: NestingLevel(NL), LastContainedTy(URTy), UpRefTy(URTy) {}
};
}
// UpRefs - A list of the outstanding upreferences that need to be resolved.
static std::vector<UpRefRecord> UpRefs;
/// HandleUpRefs - Every time we finish a new layer of types, this function is
/// called. It loops through the UpRefs vector, which is a list of the
/// currently active types. For each type, if the up reference is contained in
/// the newly completed type, we decrement the level count. When the level
/// count reaches zero, the upreferenced type is the type that is passed in:
/// thus we can complete the cycle.
///
static PATypeHolder HandleUpRefs(const Type *ty) {
// If Ty isn't abstract, or if there are no up-references in it, then there is
// nothing to resolve here.
if (!ty->isAbstract() || UpRefs.empty()) return ty;
PATypeHolder Ty(ty);
UR_OUT("Type '" << Ty->getDescription() <<
"' newly formed. Resolving upreferences.\n" <<
UpRefs.size() << " upreferences active!\n");
// If we find any resolvable upreferences (i.e., those whose NestingLevel goes
// to zero), we resolve them all together before we resolve them to Ty. At
// the end of the loop, if there is anything to resolve to Ty, it will be in
// this variable.
OpaqueType *TypeToResolve = 0;
for (unsigned i = 0; i != UpRefs.size(); ++i) {
UR_OUT(" UR#" << i << " - TypeContains(" << Ty->getDescription() << ", "
<< UpRefs[i].second->getDescription() << ") = "
<< (TypeContains(Ty, UpRefs[i].second) ? "true" : "false") << "\n");
if (TypeContains(Ty, UpRefs[i].LastContainedTy)) {
// Decrement level of upreference
unsigned Level = --UpRefs[i].NestingLevel;
UpRefs[i].LastContainedTy = Ty;
UR_OUT(" Uplevel Ref Level = " << Level << "\n");
if (Level == 0) { // Upreference should be resolved!
if (!TypeToResolve) {
TypeToResolve = UpRefs[i].UpRefTy;
} else {
UR_OUT(" * Resolving upreference for "
<< UpRefs[i].second->getDescription() << "\n";
std::string OldName = UpRefs[i].UpRefTy->getDescription());
UpRefs[i].UpRefTy->refineAbstractTypeTo(TypeToResolve);
UR_OUT(" * Type '" << OldName << "' refined upreference to: "
<< (const void*)Ty << ", " << Ty->getDescription() << "\n");
}
UpRefs.erase(UpRefs.begin()+i); // Remove from upreference list...
--i; // Do not skip the next element...
}
}
}
if (TypeToResolve) {
UR_OUT(" * Resolving upreference for "
<< UpRefs[i].second->getDescription() << "\n";
std::string OldName = TypeToResolve->getDescription());
TypeToResolve->refineAbstractTypeTo(Ty);
}
return Ty;
}
//===----------------------------------------------------------------------===//
// RunVMAsmParser - Define an interface to this parser
//===----------------------------------------------------------------------===//
//
static Module* RunParser(Module * M);
Module *llvm::RunVMAsmParser(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);
}
}
#line 968 "/Volumes/MacOS9/gcc/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;
llvm::APFloat *FPVal;
bool BoolVal;
std::string *StrVal; // This memory must be deleted
llvm::ValID ValIDVal;
llvm::Instruction::BinaryOps BinaryOpVal;
llvm::Instruction::TermOps TermOpVal;
llvm::Instruction::MemoryOps MemOpVal;
llvm::Instruction::CastOps CastOpVal;
llvm::Instruction::OtherOps OtherOpVal;
llvm::ICmpInst::Predicate IPredicate;
llvm::FCmpInst::Predicate FPredicate;
} YYSTYPE;
#include <stdio.h>
#ifndef __cplusplus
#ifndef __STDC__
#define const
#endif
#endif
#define YYFINAL 594
#define YYFLAG -32768
#define YYNTBASE 160
#define YYTRANSLATE(x) ((unsigned)(x) <= 399 ? yytranslate[x] : 241)
static const short 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, 150,
151, 148, 2, 147, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 155,
146, 156, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
152, 149, 154, 2, 2, 2, 2, 2, 159, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 153,
2, 2, 157, 2, 158, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 1, 3, 4, 5, 6,
7, 8, 9, 10, 11, 12, 13, 14, 15, 16,
17, 18, 19, 20, 21, 22, 23, 24, 25, 26,
27, 28, 29, 30, 31, 32, 33, 34, 35, 36,
37, 38, 39, 40, 41, 42, 43, 44, 45, 46,
47, 48, 49, 50, 51, 52, 53, 54, 55, 56,
57, 58, 59, 60, 61, 62, 63, 64, 65, 66,
67, 68, 69, 70, 71, 72, 73, 74, 75, 76,
77, 78, 79, 80, 81, 82, 83, 84, 85, 86,
87, 88, 89, 90, 91, 92, 93, 94, 95, 96,
97, 98, 99, 100, 101, 102, 103, 104, 105, 106,
107, 108, 109, 110, 111, 112, 113, 114, 115, 116,
117, 118, 119, 120, 121, 122, 123, 124, 125, 126,
127, 128, 129, 130, 131, 132, 133, 134, 135, 136,
137, 138, 139, 140, 141, 142, 143, 144, 145
};
#if YYDEBUG != 0
static const short yyprhs[] = { 0,
0, 2, 4, 6, 8, 10, 12, 14, 16, 18,
20, 22, 24, 26, 28, 30, 32, 34, 36, 38,
40, 42, 44, 46, 48, 50, 52, 54, 56, 58,
60, 62, 64, 66, 68, 70, 72, 74, 76, 78,
80, 82, 84, 86, 88, 90, 92, 94, 96, 98,
100, 102, 104, 106, 108, 110, 112, 114, 116, 118,
120, 122, 124, 126, 127, 130, 131, 133, 135, 137,
138, 141, 143, 145, 147, 149, 151, 153, 155, 157,
158, 160, 162, 164, 165, 167, 169, 170, 172, 174,
176, 178, 179, 181, 183, 184, 186, 188, 190, 192,
194, 197, 199, 201, 203, 205, 207, 209, 211, 213,
215, 216, 219, 221, 223, 225, 227, 228, 231, 232,
235, 236, 240, 243, 244, 246, 247, 251, 253, 256,
258, 260, 262, 264, 266, 268, 270, 272, 274, 277,
279, 282, 288, 294, 300, 306, 310, 313, 319, 324,
327, 329, 331, 333, 337, 339, 343, 345, 346, 348,
352, 357, 361, 365, 370, 375, 379, 386, 392, 395,
398, 401, 404, 407, 410, 413, 416, 419, 422, 425,
428, 435, 441, 450, 457, 464, 472, 480, 487, 496,
505, 509, 511, 513, 515, 517, 518, 521, 528, 530,
531, 533, 536, 537, 541, 542, 546, 550, 554, 558,
559, 567, 568, 577, 578, 587, 593, 596, 600, 602,
606, 610, 614, 618, 620, 621, 627, 631, 633, 637,
639, 640, 650, 652, 654, 659, 661, 663, 666, 670,
671, 673, 675, 677, 679, 681, 683, 685, 687, 689,
693, 695, 701, 703, 705, 707, 709, 711, 713, 716,
719, 722, 726, 729, 730, 732, 735, 738, 742, 752,
762, 771, 786, 788, 790, 797, 803, 806, 813, 821,
825, 831, 832, 833, 837, 840, 842, 848, 854, 861,
868, 873, 880, 885, 890, 897, 904, 907, 916, 918,
920, 921, 925, 932, 936, 943, 946, 952, 960
};
static const short yyrhs[] = { 73,
0, 74, 0, 75, 0, 76, 0, 77, 0, 78,
0, 79, 0, 80, 0, 81, 0, 85, 0, 86,
0, 87, 0, 82, 0, 83, 0, 84, 0, 116,
0, 117, 0, 118, 0, 119, 0, 120, 0, 121,
0, 122, 0, 123, 0, 124, 0, 125, 0, 126,
0, 127, 0, 90, 0, 91, 0, 92, 0, 93,
0, 94, 0, 95, 0, 96, 0, 97, 0, 98,
0, 99, 0, 100, 0, 101, 0, 102, 0, 103,
0, 104, 0, 105, 0, 106, 0, 107, 0, 108,
0, 109, 0, 96, 0, 97, 0, 98, 0, 99,
0, 26, 0, 27, 0, 11, 0, 12, 0, 13,
0, 16, 0, 15, 0, 14, 0, 19, 0, 22,
0, 24, 0, 167, 0, 0, 167, 146, 0, 0,
20, 0, 23, 0, 172, 0, 0, 170, 146, 0,
42, 0, 44, 0, 43, 0, 45, 0, 47, 0,
46, 0, 48, 0, 50, 0, 0, 143, 0, 144,
0, 145, 0, 0, 46, 0, 48, 0, 0, 42,
0, 43, 0, 44, 0, 47, 0, 0, 44, 0,
42, 0, 0, 61, 0, 62, 0, 63, 0, 64,
0, 65, 0, 60, 4, 0, 135, 0, 117, 0,
134, 0, 118, 0, 137, 0, 138, 0, 140, 0,
141, 0, 142, 0, 0, 181, 180, 0, 136, 0,
139, 0, 135, 0, 134, 0, 0, 183, 182, 0,
0, 53, 4, 0, 0, 147, 53, 4, 0, 34,
22, 0, 0, 186, 0, 0, 147, 189, 188, 0,
186, 0, 53, 4, 0, 11, 0, 12, 0, 13,
0, 16, 0, 15, 0, 14, 0, 17, 0, 49,
0, 190, 0, 191, 148, 0, 225, 0, 149, 4,
0, 191, 150, 195, 151, 183, 0, 10, 150, 195,
151, 183, 0, 152, 4, 153, 191, 154, 0, 155,
4, 153, 191, 156, 0, 157, 196, 158, 0, 157,
158, 0, 155, 157, 196, 158, 156, 0, 155, 157,
158, 156, 0, 191, 181, 0, 191, 0, 10, 0,
192, 0, 194, 147, 192, 0, 194, 0, 194, 147,
39, 0, 39, 0, 0, 191, 0, 196, 147, 191,
0, 191, 152, 199, 154, 0, 191, 152, 154, 0,
191, 159, 22, 0, 191, 155, 199, 156, 0, 191,
157, 199, 158, 0, 191, 157, 158, 0, 191, 155,
157, 199, 158, 156, 0, 191, 155, 157, 158, 156,
0, 191, 40, 0, 191, 41, 0, 191, 225, 0,
191, 198, 0, 191, 25, 0, 165, 3, 0, 165,
5, 0, 165, 4, 0, 165, 6, 0, 11, 26,
0, 11, 27, 0, 166, 9, 0, 162, 150, 197,
38, 191, 151, 0, 115, 150, 197, 236, 151, 0,
129, 150, 197, 147, 197, 147, 197, 151, 0, 160,
150, 197, 147, 197, 151, 0, 161, 150, 197, 147,
197, 151, 0, 88, 163, 150, 197, 147, 197, 151,
0, 89, 164, 150, 197, 147, 197, 151, 0, 131,
150, 197, 147, 197, 151, 0, 132, 150, 197, 147,
197, 147, 197, 151, 0, 133, 150, 197, 147, 197,
147, 197, 151, 0, 199, 147, 197, 0, 197, 0,
32, 0, 33, 0, 37, 0, 0, 193, 225, 0,
121, 150, 202, 38, 191, 151, 0, 204, 0, 0,
205, 0, 204, 205, 0, 0, 31, 206, 221, 0,
0, 30, 207, 222, 0, 58, 57, 211, 0, 169,
18, 191, 0, 169, 18, 10, 0, 0, 171, 175,
201, 200, 197, 208, 188, 0, 0, 171, 173, 175,
201, 200, 197, 209, 188, 0, 0, 171, 174, 175,
201, 200, 191, 210, 188, 0, 171, 175, 35, 178,
202, 0, 51, 212, 0, 54, 146, 213, 0, 22,
0, 52, 146, 22, 0, 66, 146, 22, 0, 152,
214, 154, 0, 214, 147, 22, 0, 22, 0, 0,
215, 147, 191, 181, 168, 0, 191, 181, 168, 0,
215, 0, 215, 147, 39, 0, 39, 0, 0, 179,
193, 170, 150, 216, 151, 183, 187, 184, 0, 28,
0, 157, 0, 177, 175, 217, 218, 0, 29, 0,
158, 0, 228, 220, 0, 176, 175, 217, 0, 0,
59, 0, 3, 0, 4, 0, 9, 0, 26, 0,
27, 0, 40, 0, 41, 0, 25, 0, 155, 199,
156, 0, 198, 0, 57, 223, 22, 147, 22, 0,
7, 0, 8, 0, 167, 0, 170, 0, 225, 0,
224, 0, 191, 226, 0, 228, 229, 0, 219, 229,
0, 230, 169, 231, 0, 230, 233, 0, 0, 21,
0, 67, 227, 0, 67, 10, 0, 68, 17, 226,
0, 68, 11, 226, 147, 17, 226, 147, 17, 226,
0, 69, 165, 226, 147, 17, 226, 152, 232, 154,
0, 69, 165, 226, 147, 17, 226, 152, 154, 0,
70, 179, 193, 226, 150, 235, 151, 183, 38, 17,
226, 71, 17, 226, 0, 71, 0, 72, 0, 232,
165, 224, 147, 17, 226, 0, 165, 224, 147, 17,
226, 0, 169, 238, 0, 191, 152, 226, 147, 226,
154, 0, 234, 147, 152, 226, 147, 226, 154, 0,
191, 226, 181, 0, 235, 147, 191, 226, 181, 0,
0, 0, 236, 147, 227, 0, 56, 55, 0, 55,
0, 160, 191, 226, 147, 226, 0, 161, 191, 226,
147, 226, 0, 88, 163, 191, 226, 147, 226, 0,
89, 164, 191, 226, 147, 226, 0, 162, 227, 38,
191, 0, 129, 227, 147, 227, 147, 227, 0, 130,
227, 147, 191, 0, 131, 227, 147, 227, 0, 132,
227, 147, 227, 147, 227, 0, 133, 227, 147, 227,
147, 227, 0, 128, 234, 0, 237, 179, 193, 226,
150, 235, 151, 183, 0, 240, 0, 36, 0, 0,
110, 191, 185, 0, 110, 191, 147, 11, 226, 185,
0, 111, 191, 185, 0, 111, 191, 147, 11, 226,
185, 0, 112, 227, 0, 239, 113, 191, 226, 185,
0, 239, 114, 227, 147, 191, 226, 185, 0, 115,
191, 226, 236, 0
};
#endif
#if YYDEBUG != 0
static const short yyrline[] = { 0,
1127, 1127, 1127, 1127, 1127, 1127, 1127, 1127, 1127, 1128,
1128, 1128, 1128, 1128, 1128, 1129, 1129, 1129, 1129, 1129,
1129, 1129, 1130, 1130, 1130, 1130, 1130, 1133, 1133, 1134,
1134, 1135, 1135, 1136, 1136, 1137, 1137, 1141, 1141, 1142,
1142, 1143, 1143, 1144, 1144, 1145, 1145, 1146, 1146, 1147,
1147, 1148, 1149, 1154, 1155, 1155, 1155, 1155, 1155, 1157,
1157, 1157, 1158, 1158, 1162, 1166, 1171, 1171, 1173, 1174,
1179, 1185, 1186, 1187, 1188, 1189, 1193, 1194, 1195, 1199,
1200, 1201, 1202, 1206, 1207, 1208, 1212, 1213, 1214, 1215,
1216, 1220, 1221, 1222, 1225, 1225, 1226, 1227, 1228, 1229,
1230, 1238, 1239, 1240, 1241, 1242, 1243, 1244, 1245, 1246,
1249, 1250, 1255, 1256, 1257, 1258, 1261, 1262, 1269, 1269,
1276, 1276, 1285, 1293, 1293, 1299, 1299, 1301, 1306, 1319,
1319, 1319, 1319, 1319, 1319, 1319, 1322, 1326, 1330, 1337,
1342, 1350, 1380, 1411, 1416, 1428, 1438, 1442, 1452, 1459,
1466, 1473, 1478, 1483, 1490, 1491, 1498, 1505, 1513, 1519,
1531, 1559, 1575, 1602, 1630, 1656, 1676, 1702, 1722, 1734,
1741, 1807, 1817, 1827, 1833, 1843, 1849, 1859, 1864, 1869,
1882, 1894, 1916, 1924, 1930, 1941, 1946, 1951, 1957, 1963,
1972, 1976, 1984, 1984, 1987, 1987, 1990, 2002, 2023, 2028,
2036, 2037, 2041, 2041, 2045, 2045, 2048, 2051, 2075, 2086,
2093, 2096, 2102, 2105, 2112, 2116, 2156, 2159, 2165, 2175,
2179, 2184, 2186, 2191, 2196, 2205, 2215, 2226, 2230, 2239,
2248, 2253, 2374, 2374, 2376, 2385, 2385, 2387, 2392, 2404,
2408, 2413, 2417, 2421, 2425, 2429, 2433, 2437, 2441, 2445,
2470, 2474, 2484, 2488, 2492, 2497, 2504, 2504, 2510, 2519,
2523, 2532, 2541, 2550, 2554, 2561, 2565, 2569, 2574, 2584,
2603, 2612, 2692, 2696, 2703, 2714, 2727, 2737, 2748, 2758,
2767, 2776, 2779, 2780, 2787, 2791, 2796, 2817, 2834, 2848,
2862, 2874, 2882, 2889, 2895, 2901, 2907, 2922, 3007, 3012,
3016, 3023, 3030, 3038, 3045, 3053, 3061, 3075, 3092
};
#endif
#if YYDEBUG != 0 || defined (YYERROR_VERBOSE)
static const char * const yytname[] = { "$","error","$undefined.","ESINT64VAL",
"EUINT64VAL","ESAPINTVAL","EUAPINTVAL","LOCALVAL_ID","GLOBALVAL_ID","FPVAL",
"VOID","INTTYPE","FLOAT","DOUBLE","X86_FP80","FP128","PPC_FP128","LABEL","TYPE",
"LOCALVAR","GLOBALVAR","LABELSTR","STRINGCONSTANT","ATSTRINGCONSTANT","PCTSTRINGCONSTANT",
"ZEROINITIALIZER","TRUETOK","FALSETOK","BEGINTOK","ENDTOK","DECLARE","DEFINE",
"GLOBAL","CONSTANT","SECTION","ALIAS","VOLATILE","THREAD_LOCAL","TO","DOTDOTDOT",
"NULL_TOK","UNDEF","INTERNAL","LINKONCE","WEAK","APPENDING","DLLIMPORT","DLLEXPORT",
"EXTERN_WEAK","OPAQUE","EXTERNAL","TARGET","TRIPLE","ALIGN","DEPLIBS","CALL",
"TAIL","ASM_TOK","MODULE","SIDEEFFECT","CC_TOK","CCC_TOK","FASTCC_TOK","COLDCC_TOK",
"X86_STDCALLCC_TOK","X86_FASTCALLCC_TOK","DATALAYOUT","RET","BR","SWITCH","INVOKE",
"UNWIND","UNREACHABLE","ADD","SUB","MUL","UDIV","SDIV","FDIV","UREM","SREM",
"FREM","AND","OR","XOR","SHL","LSHR","ASHR","ICMP","FCMP","EQ","NE","SLT","SGT",
"SLE","SGE","ULT","UGT","ULE","UGE","OEQ","ONE","OLT","OGT","OLE","OGE","ORD",
"UNO","UEQ","UNE","MALLOC","ALLOCA","FREE","LOAD","STORE","GETELEMENTPTR","TRUNC",
"ZEXT","SEXT","FPTRUNC","FPEXT","BITCAST","UITOFP","SITOFP","FPTOUI","FPTOSI",
"INTTOPTR","PTRTOINT","PHI_TOK","SELECT","VAARG","EXTRACTELEMENT","INSERTELEMENT",
"SHUFFLEVECTOR","SIGNEXT","ZEROEXT","NORETURN","INREG","SRET","NOUNWIND","NOALIAS",
"BYVAL","NEST","DEFAULT","HIDDEN","PROTECTED","'='","','","'*'","'\\\\'","'('",
"')'","'['","'x'","']'","'<'","'>'","'{'","'}'","'c'","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", NULL
};
#endif
static const short yyr1[] = { 0,
160, 160, 160, 160, 160, 160, 160, 160, 160, 161,
161, 161, 161, 161, 161, 162, 162, 162, 162, 162,
162, 162, 162, 162, 162, 162, 162, 163, 163, 163,
163, 163, 163, 163, 163, 163, 163, 164, 164, 164,
164, 164, 164, 164, 164, 164, 164, 164, 164, 164,
164, 164, 164, 165, 166, 166, 166, 166, 166, 167,
167, 167, 168, 168, 169, 169, 170, 170, 171, 171,
172, 173, 173, 173, 173, 173, 174, 174, 174, 175,
175, 175, 175, 176, 176, 176, 177, 177, 177, 177,
177, 178, 178, 178, 179, 179, 179, 179, 179, 179,
179, 180, 180, 180, 180, 180, 180, 180, 180, 180,
181, 181, 182, 182, 182, 182, 183, 183, 184, 184,
185, 185, 186, 187, 187, 188, 188, 189, 189, 190,
190, 190, 190, 190, 190, 190, 191, 191, 191, 191,
191, 191, 191, 191, 191, 191, 191, 191, 191, 192,
193, 193, 194, 194, 195, 195, 195, 195, 196, 196,
197, 197, 197, 197, 197, 197, 197, 197, 197, 197,
197, 197, 197, 197, 197, 197, 197, 197, 197, 197,
198, 198, 198, 198, 198, 198, 198, 198, 198, 198,
199, 199, 200, 200, 201, 201, 202, 202, 203, 203,
204, 204, 206, 205, 207, 205, 205, 205, 205, 208,
205, 209, 205, 210, 205, 205, 205, 205, 211, 212,
212, 213, 214, 214, 214, 215, 215, 216, 216, 216,
216, 217, 218, 218, 219, 220, 220, 221, 222, 223,
223, 224, 224, 224, 224, 224, 224, 224, 224, 224,
224, 224, 225, 225, 225, 225, 226, 226, 227, 228,
228, 229, 230, 230, 230, 231, 231, 231, 231, 231,
231, 231, 231, 231, 232, 232, 233, 234, 234, 235,
235, 235, 236, 236, 237, 237, 238, 238, 238, 238,
238, 238, 238, 238, 238, 238, 238, 238, 238, 239,
239, 240, 240, 240, 240, 240, 240, 240, 240
};
static const short yyr2[] = { 0,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 0, 2, 0, 1, 1, 1, 0,
2, 1, 1, 1, 1, 1, 1, 1, 1, 0,
1, 1, 1, 0, 1, 1, 0, 1, 1, 1,
1, 0, 1, 1, 0, 1, 1, 1, 1, 1,
2, 1, 1, 1, 1, 1, 1, 1, 1, 1,
0, 2, 1, 1, 1, 1, 0, 2, 0, 2,
0, 3, 2, 0, 1, 0, 3, 1, 2, 1,
1, 1, 1, 1, 1, 1, 1, 1, 2, 1,
2, 5, 5, 5, 5, 3, 2, 5, 4, 2,
1, 1, 1, 3, 1, 3, 1, 0, 1, 3,
4, 3, 3, 4, 4, 3, 6, 5, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
6, 5, 8, 6, 6, 7, 7, 6, 8, 8,
3, 1, 1, 1, 1, 0, 2, 6, 1, 0,
1, 2, 0, 3, 0, 3, 3, 3, 3, 0,
7, 0, 8, 0, 8, 5, 2, 3, 1, 3,
3, 3, 3, 1, 0, 5, 3, 1, 3, 1,
0, 9, 1, 1, 4, 1, 1, 2, 3, 0,
1, 1, 1, 1, 1, 1, 1, 1, 1, 3,
1, 5, 1, 1, 1, 1, 1, 1, 2, 2,
2, 3, 2, 0, 1, 2, 2, 3, 9, 9,
8, 14, 1, 1, 6, 5, 2, 6, 7, 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
};
static const short yydefact[] = { 70,
60, 67, 61, 68, 62, 205, 203, 0, 0, 0,
0, 0, 0, 80, 69, 70, 201, 84, 87, 0,
0, 217, 0, 0, 65, 0, 71, 72, 74, 73,
75, 77, 76, 78, 79, 81, 82, 83, 80, 80,
196, 202, 85, 86, 80, 206, 88, 89, 90, 91,
80, 264, 204, 264, 0, 0, 225, 218, 219, 207,
253, 254, 209, 130, 131, 132, 135, 134, 133, 136,
137, 0, 0, 0, 0, 255, 256, 138, 208, 140,
196, 196, 92, 195, 0, 95, 95, 265, 261, 66,
236, 237, 238, 260, 220, 221, 224, 0, 158, 141,
0, 0, 0, 0, 147, 159, 0, 139, 158, 0,
0, 94, 93, 0, 193, 194, 0, 0, 96, 97,
98, 99, 100, 0, 239, 0, 301, 263, 0, 222,
157, 111, 153, 155, 0, 0, 0, 0, 0, 0,
146, 0, 0, 0, 152, 0, 151, 0, 216, 130,
131, 132, 135, 134, 133, 0, 0, 0, 210, 101,
0, 233, 234, 235, 300, 286, 0, 0, 0, 0,
95, 273, 274, 1, 2, 3, 4, 5, 6, 7,
8, 9, 13, 14, 15, 10, 11, 12, 0, 0,
0, 0, 0, 0, 16, 17, 18, 19, 20, 21,
22, 23, 24, 25, 26, 27, 0, 0, 0, 0,
0, 0, 0, 0, 0, 262, 95, 277, 0, 299,
223, 150, 0, 117, 0, 0, 149, 0, 160, 117,
212, 214, 0, 197, 178, 179, 174, 176, 175, 177,
180, 173, 169, 170, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 172, 171,
126, 0, 285, 267, 0, 266, 0, 0, 54, 0,
0, 28, 29, 30, 31, 32, 33, 34, 35, 36,
37, 0, 52, 53, 48, 49, 50, 51, 38, 39,
40, 41, 42, 43, 44, 45, 46, 47, 0, 121,
121, 306, 0, 0, 297, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 103, 105, 104, 102,
106, 107, 108, 109, 110, 112, 156, 154, 143, 144,
145, 148, 142, 126, 126, 0, 0, 0, 0, 0,
0, 0, 0, 162, 192, 0, 0, 0, 166, 0,
163, 0, 0, 0, 0, 211, 231, 242, 243, 244,
249, 245, 246, 247, 248, 240, 0, 251, 258, 257,
259, 0, 268, 0, 0, 0, 0, 0, 302, 0,
304, 283, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 116, 115, 113, 114, 118,
213, 215, 0, 0, 0, 283, 0, 0, 0, 0,
0, 161, 147, 159, 0, 164, 165, 0, 0, 0,
0, 0, 128, 126, 230, 111, 228, 0, 241, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 309,
0, 0, 0, 293, 294, 0, 0, 0, 0, 291,
0, 121, 0, 0, 0, 0, 0, 0, 0, 0,
0, 191, 168, 0, 0, 0, 0, 123, 129, 127,
64, 0, 117, 0, 250, 0, 0, 282, 0, 0,
121, 122, 121, 0, 0, 0, 0, 0, 0, 287,
288, 282, 0, 307, 0, 198, 0, 0, 182, 0,
0, 0, 0, 167, 0, 0, 0, 63, 227, 229,
111, 124, 0, 0, 0, 0, 0, 289, 290, 303,
305, 284, 0, 0, 292, 295, 296, 0, 121, 0,
0, 0, 188, 0, 0, 184, 185, 181, 64, 125,
119, 252, 0, 0, 111, 0, 117, 278, 0, 117,
308, 186, 187, 0, 0, 0, 226, 0, 232, 0,
271, 0, 0, 280, 0, 0, 279, 298, 183, 189,
190, 120, 269, 0, 270, 0, 111, 0, 0, 0,
281, 0, 0, 0, 0, 276, 0, 0, 275, 0,
272, 0, 0, 0
};
static const short yydefgoto[] = { 256,
257, 258, 282, 299, 156, 157, 76, 509, 12, 77,
14, 15, 39, 40, 41, 45, 51, 114, 124, 326,
222, 400, 329, 559, 379, 423, 541, 356, 424, 78,
158, 133, 148, 134, 135, 107, 345, 368, 346, 117,
85, 149, 592, 16, 17, 19, 18, 261, 334, 335,
60, 22, 58, 98, 427, 428, 125, 164, 52, 93,
53, 46, 430, 369, 80, 371, 266, 54, 89, 90,
216, 563, 128, 305, 517, 440, 217, 218, 219, 220
};
static const short yypact[] = { 42,
-32768,-32768,-32768,-32768,-32768,-32768,-32768, -21, -131, 60,
-93, 105, -22, 182,-32768, 525,-32768, 46, 168, -12,
19,-32768, 1, 152,-32768, 1277,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 90, 90,
100,-32768,-32768,-32768, 90,-32768,-32768,-32768,-32768,-32768,
90, 186,-32768, 12, 187, 201, 209,-32768,-32768,-32768,
-32768,-32768, 93,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
-32768, 252, 254, 2, 907,-32768,-32768,-32768, 13,-32768,
225, 225, 150,-32768, 76, 116, 116,-32768,-32768, 108,
-32768,-32768,-32768,-32768,-32768,-32768,-32768, -79, 1027,-32768,
111, 114, 947, 93,-32768, 13, -104,-32768, 1027, 76,
76,-32768,-32768, 1067,-32768,-32768, 1299, 266,-32768,-32768,
-32768,-32768,-32768, 1330,-32768, -16, 1572,-32768, 256,-32768,
-32768, 13,-32768, 139, 144, 1370, 1370, 132, -95, 1370,
-32768, 145, 1299, 1370, 93, 147, 13, 311,-32768, 43,
290, 293, 298, 299, 302, 247, 303, 724,-32768,-32768,
35,-32768,-32768,-32768,-32768,-32768, 258, 1450, 70, 305,
116,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 317, 405,
1370, 1370, 1370, 1370,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,-32768,-32768, 1370, 1370, 1370, 1370,
1370, 1370, 1370, 1370, 1370,-32768, 116,-32768, 34,-32768,
-32768, 131, 1107,-32768, 6, -46,-32768, 164, 13,-32768,
-32768, 13, 1067,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768, 317, 405, 173, 178, 179, 189,
192, 1179, 1481, 987, 314, 193, 197, 198,-32768,-32768,
202, 203,-32768, 93, 565,-32768, 699, 699,-32768, 699,
1330,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
-32768, 1370,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 1370, 113,
137,-32768, 565, -10, 205, 207, 208, 210, 218, 219,
565, 565, 330, 1330, 1370, 1370,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 106,-32768,
-32768,-32768, 106, 202, 202, 331, 220, 221, 1299, 1299,
1299, 1299, 1299,-32768,-32768, -41, 1005, -61,-32768, -91,
-32768, 1299, 1299, 1299, -13,-32768, 1219,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,-32768, 313, 1299,-32768,-32768,-32768,
-32768, 226,-32768, 227, 699, 565, 565, 23,-32768, 24,
-32768,-32768, 699, 223, 1370, 1370, 1370, 1370, 1370, 232,
233, 1370, 699, 565, 234,-32768,-32768,-32768,-32768,-32768,
-32768,-32768, 1370, 1299, 1299,-32768, 235, 236, 237, 239,
1299,-32768, 231, 724, -76,-32768,-32768, 241, 242, 352,
369, 388,-32768, 202,-32768, 13, 246, 243,-32768, 374,
-59, 380, 385, 253, 257, 270, 699, 414, 699, 272,
273, 699, 278, 13,-32768, 280, 282, 699, 699, 13,
283, 287, 1370, -112, 288, 289, -33, 1299, 1299, 1299,
1299,-32768,-32768, 294, 1299, 1299, 1370,-32768,-32768,-32768,
79, 1259,-32768, 292,-32768, 699, 699, 1370, 699, 699,
287,-32768, 287, 1370, 699, 307, 1370, 1370, 1370,-32768,
-32768, 1370, 392,-32768, 565,-32768, 1299, 1299,-32768, 308,
295, 309, 310,-32768, 301, 315, 7,-32768,-32768,-32768,
13, 10, 427, 318, 306, 565, 52,-32768,-32768,-32768,
-32768,-32768, 316, 699,-32768,-32768,-32768, 71, 287, 322,
325, 1299,-32768, 1299, 1299,-32768,-32768,-32768, 79,-32768,
407,-32768, 444, -4,-32768, 1370,-32768,-32768, 323,-32768,
-32768,-32768,-32768, 327, 328, 329,-32768, 464,-32768, 699,
-32768, 859, -3, 131, 565, -14,-32768, 106,-32768,-32768,
-32768,-32768,-32768, 334,-32768, 859,-32768, 452, 465, 336,
131, 699, 699, 468, 416,-32768, 699, 471,-32768, 699,
-32768, 490, 491,-32768
};
static const short yypgoto[] = { 365,
366, 367, 255, 251, -168,-32768, 0, -40, 408, 14,
-32768,-32768,-32768,-32768, 40,-32768,-32768,-32768, -158,-32768,
-406,-32768, -226,-32768, -290, 3,-32768, -317,-32768,-32768,
-25, 296, -119,-32768, 409, 413, -60, -155, -231, 166,
119, 284,-32768,-32768, 504,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,-32768,-32768, 435,-32768,-32768,-32768,
-32768,-32768,-32768, -525, -139, 47, -183,-32768, 474,-32768,
-32768,-32768,-32768,-32768, 37, 124,-32768,-32768,-32768,-32768
};
#define YYLAST 1705
static const short yytable[] = { 11,
79, 270, 259, 333, 161, 102, 269, 269, 234, 302,
381, 162, 271, 13, 23, 11, 401, 402, 260, 471,
421, 348, 350, 578, 306, 307, 308, 309, 310, 13,
20, 313, 88, 437, 439, 108, 574, 109, 496, 422,
91, -200, 140, 421, 21, -54, -54, -54, -54, 106,
580, 140, 25, 141, 2, 411, 159, 4, 314, -66,
1, 2, 228, 3, 4, 5, 417, 129, 235, 236,
411, 6, 7, 132, 130, 438, 438, 106, 81, 82,
267, 464, 231, 132, 86, 411, 268, 411, 147, 11,
87, 43, 8, 44, 416, 9, 475, 1, 147, 10,
3, 108, 5, 109, 539, 411, 470, 115, 116, 331,
225, 226, 412, 484, 229, 415, 24, 499, 232, 396,
397, 398, 26, 27, 399, 370, 1, 370, 370, 3,
370, 5, 395, 55, 83, 431, 84, 108, 564, 109,
163, 383, 265, 396, 397, 398, 315, 316, 399, 561,
575, 375, 57, 108, 108, 109, 109, 538, 103, 330,
108, 494, 109, 370, 56, 300, 301, 265, 303, 92,
581, 370, 370, 59, 262, 118, 119, 120, 121, 122,
123, 304, 265, 265, 265, 265, 265, 311, 312, 265,
520, 112, 521, 113, 393, 317, 318, 132, 546, 110,
111, 443, 547, 445, 446, 447, 88, 147, 95, 47,
48, 49, 319, 320, 50, 321, 322, 546, 323, 324,
325, 550, 96, 28, 29, 30, 31, 32, 33, 34,
97, 35, 36, 37, 38, 370, 370, 370, 551, 396,
397, 398, 99, 370, 399, 147, 512, 317, 318, 237,
238, 239, 240, 370, 370, 100, 376, 101, 259, 378,
108, 84, 109, 136, 319, 320, 137, 321, 322, 160,
323, 324, 325, 377, 260, 143, 144, 221, 406, 407,
408, 409, 410, 380, 108, 223, 109, 227, 147, 394,
265, 418, 419, 420, 224, 230, 233, 370, -55, 370,
522, -56, 370, 525, 526, 527, -59, -58, 370, 370,
-57, 241, 263, 372, 373, 269, 374, 61, 62, 332,
566, 414, 339, 568, 36, 37, 38, 340, 341, 1,
2, 426, 3, 4, 5, 351, 370, 370, 342, 370,
370, 343, 352, 455, 456, 370, 353, 354, 355, 382,
462, 384, 357, 385, 386, 370, 387, 390, 391, 265,
444, 265, 265, 265, 388, 389, 450, 392, 403, 404,
405, 429, 432, 433, 442, 562, 370, 454, 448, 449,
453, 458, 459, 460, 370, 461, 463, 465, 466, 467,
468, 469, 472, 473, 576, 474, 476, 500, 501, 502,
503, 477, 478, 479, 505, 506, 272, 273, 274, 275,
276, 277, 278, 279, 280, 281, 480, 482, 484, 485,
370, 434, 435, 436, 487, 370, 488, 495, 489, 441,
283, 284, 492, 493, 497, 498, 530, 531, 513, 451,
452, 507, 370, 370, 438, 533, 511, 370, 542, 504,
370, 536, 516, 524, 532, 534, 535, 544, 265, 558,
560, 265, 265, 265, 543, 537, 516, 572, 582, 548,
508, 554, 552, 555, 556, 553, 567, 569, 570, 571,
579, 583, 584, 481, 587, 483, 588, 590, 486, 593,
594, 213, 214, 215, 490, 491, 338, 127, 557, 337,
285, 286, 287, 288, 289, 290, 291, 292, 293, 294,
295, 296, 297, 298, 540, 139, 336, 142, 328, 42,
565, 126, 514, 515, -199, 518, 519, 94, 528, 457,
0, 523, 0, 0, 0, 0, 0, 0, 508, 0,
0, 529, -66, 1, 2, 0, 3, 4, 5, 0,
0, 0, 0, 0, 6, 7, 0, 0, 0, 0,
0, 0, 545, 0, 0, 0, 0, 358, 359, 0,
549, 61, 62, 360, 0, 8, 0, 0, 9, 0,
0, 0, 10, 1, 2, 0, 3, 4, 5, 361,
362, 363, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 364, 365, 573, 0, 0, 0,
0, 577, 0, 0, 0, 0, 0, 0, 0, 0,
0, 366, 0, 0, 0, 0, 0, 0, 585, 586,
0, 0, 0, 589, 0, 0, 591, 174, 175, 176,
177, 178, 179, 180, 181, 182, 183, 184, 185, 186,
187, 188, 245, 246, 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, 247,
195, 196, 197, 198, 199, 200, 201, 202, 203, 204,
205, 206, 0, 248, 0, 249, 250, 251, 0, 0,
0, 358, 359, 0, 0, 61, 62, 360, 0, 0,
0, 0, 108, 0, 109, 0, 0, 1, 2, 367,
3, 4, 5, 361, 362, 363, 0, 0, 0, 0,
61, 62, 0, 0, 0, 0, 0, 0, 364, 365,
0, 0, 1, 2, 0, 3, 4, 5, 242, 0,
0, 0, 0, 0, 0, 366, 0, 0, 0, 0,
0, 0, 0, 243, 244, 0, 0, 0, 0, 0,
0, 174, 175, 176, 177, 178, 179, 180, 181, 182,
183, 184, 185, 186, 187, 188, 245, 246, 0, 0,
0, 0, 0, 0, 0, 0, 174, 175, 176, 177,
178, 179, 180, 181, 182, 183, 184, 185, 186, 187,
188, 245, 246, 247, 195, 196, 197, 198, 199, 200,
201, 202, 203, 204, 205, 206, 0, 248, 0, 249,
250, 251, 0, 0, 0, 0, 0, 0, 247, 195,
196, 197, 198, 199, 200, 201, 202, 203, 204, 205,
206, 0, 248, 367, 249, 250, 251, 0, 0, 0,
0, 358, 359, 0, 0, 0, 0, 360, 0, 0,
0, 108, 0, 109, 0, 252, 0, 0, 253, 0,
254, 0, 255, 361, 362, 363, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 364, 365,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 61, 62, 366, 104, 64, 65, 66,
67, 68, 69, 70, 0, 1, 2, 0, 3, 4,
5, 174, 175, 176, 177, 178, 179, 180, 181, 182,
183, 184, 185, 186, 187, 188, 245, 246, 0, 0,
0, 0, 0, 61, 62, 71, 104, 64, 65, 66,
67, 68, 69, 70, 0, 1, 2, 0, 3, 4,
5, 0, 0, 247, 195, 196, 197, 198, 199, 200,
201, 202, 203, 204, 205, 206, 0, 248, 0, 249,
250, 251, 0, 61, 62, 71, 104, 150, 151, 152,
153, 154, 155, 70, 0, 1, 2, 0, 3, 4,
5, 61, 62, 367, 104, 150, 151, 152, 153, 154,
155, 70, 0, 1, 2, 0, 3, 4, 5, 0,
0, 0, 0, 61, 62, 71, 104, 64, 65, 66,
67, 68, 69, 70, 0, 1, 2, 0, 3, 4,
5, 0, 0, 71, 0, 72, 0, 0, 73, 0,
0, 74, 0, 75, 105, 131, 0, 0, 0, 0,
0, 0, 0, 61, 62, 71, 145, 64, 65, 66,
67, 68, 69, 70, 0, 1, 2, 0, 3, 4,
5, 0, 0, 0, 0, 72, 0, 0, 73, 0,
0, 74, 0, 75, 138, 0, 0, 0, 0, 0,
0, 0, 0, 61, 62, 71, 104, 64, 65, 66,
67, 68, 69, 70, 0, 1, 2, 0, 3, 4,
5, 0, 0, 0, 0, 72, 0, 0, 73, 0,
0, 74, 0, 75, 349, 327, 0, 0, 0, 0,
0, 0, 0, 72, 0, 71, 73, 0, 0, 74,
0, 75, 413, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 72, 0, 0, 73, 0,
0, 74, 0, 75, 0, 61, 62, 146, 104, 150,
151, 152, 153, 154, 155, 70, 0, 1, 2, 0,
3, 4, 5, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 72, 0, 0, 73, 0,
0, 74, 0, 75, 0, 61, 62, 71, 104, 64,
65, 66, 67, 68, 69, 70, 0, 1, 2, 0,
3, 4, 5, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 72, 0, 425, 73, 0,
0, 74, 0, 75, 0, 61, 62, 71, 104, 64,
65, 66, 67, 68, 69, 70, 0, 1, 2, 0,
3, 4, 5, 61, 62, 0, 63, 64, 65, 66,
67, 68, 69, 70, 0, 1, 2, 510, 3, 4,
5, 0, 0, 0, 0, 61, 62, 71, 104, 150,
151, 152, 153, 154, 155, 70, 0, 1, 2, 0,
3, 4, 5, 0, 0, 71, 0, 72, 0, 0,
73, 0, 344, 74, 0, 75, 61, 62, 0, 145,
64, 65, 66, 67, 68, 69, 70, 71, 1, 2,
0, 3, 4, 5, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 72, 0, 0,
73, 0, 0, 74, 0, 75, 61, 62, 71, 104,
64, 65, 66, 67, 68, 69, 70, 0, 1, 2,
0, 3, 4, 5, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 72, 0, 0,
73, 0, 0, 74, 0, 75, 0, 0, 71, 0,
0, 0, 0, 0, 0, 72, 0, 0, 73, 0,
0, 74, 0, 75, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 72, 0, 0,
73, 0, 0, 74, 0, 75, 61, 62, 0, 264,
64, 65, 66, 67, 68, 69, 70, 0, 1, 2,
0, 3, 4, 5, 0, 0, 0, 0, 72, 0,
0, 73, 0, 0, 74, 0, 75, 61, 62, 0,
104, 150, 151, 152, 153, 154, 155, 70, 71, 1,
2, 0, 3, 4, 5, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 72, 0,
0, 73, 0, 0, 74, 0, 75, 0, 0, 71,
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, 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, 72, 0,
0, 73, 0, 0, 74, 0, 75, 165, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 166, 167, 0, 72,
0, 0, 73, 0, 0, 74, 0, 347, 168, 169,
170, 171, 172, 173, 174, 175, 176, 177, 178, 179,
180, 181, 182, 183, 184, 185, 186, 187, 188, 189,
190, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 191, 192, 193, 0, 0, 194, 195, 196, 197,
198, 199, 200, 201, 202, 203, 204, 205, 206, 207,
208, 209, 210, 211, 212
};
static const short yycheck[] = { 0,
26, 170, 158, 230, 124, 4, 11, 11, 148, 193,
301, 28, 171, 0, 146, 16, 334, 335, 158, 426,
34, 253, 254, 38, 208, 209, 210, 211, 212, 16,
52, 215, 21, 11, 11, 148, 562, 150, 151, 53,
29, 0, 147, 34, 66, 3, 4, 5, 6, 75,
576, 147, 146, 158, 20, 147, 117, 23, 217, 18,
19, 20, 158, 22, 23, 24, 158, 147, 26, 27,
147, 30, 31, 99, 154, 53, 53, 103, 39, 40,
11, 158, 143, 109, 45, 147, 17, 147, 114, 90,
51, 46, 51, 48, 156, 54, 156, 19, 124, 58,
22, 148, 24, 150, 511, 147, 424, 32, 33, 156,
136, 137, 154, 147, 140, 347, 57, 151, 144, 134,
135, 136, 18, 146, 139, 265,