mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-08-21 03:29:40 +00:00
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@41706 91177308-0d34-0410-b5e6-96231b3b80d8
6153 lines
225 KiB
Plaintext
6153 lines
225 KiB
Plaintext
/* A Bison parser, made by GNU Bison 1.875c. */
|
||
|
||
/* Skeleton parser for Yacc-like parsing with Bison,
|
||
Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003 Free Software Foundation, Inc.
|
||
|
||
This program is free software; you can redistribute it and/or modify
|
||
it under the terms of the GNU General Public License as published by
|
||
the Free Software Foundation; either version 2, or (at your option)
|
||
any later version.
|
||
|
||
This program is distributed in the hope that it will be useful,
|
||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||
GNU General Public License for more details.
|
||
|
||
You should have received a copy of the GNU General Public License
|
||
along with this program; if not, write to the Free Software
|
||
Foundation, Inc., 59 Temple Place - Suite 330,
|
||
Boston, MA 02111-1307, USA. */
|
||
|
||
/* As a special exception, when this file is copied by Bison into a
|
||
Bison output file, you may use that output file without restriction.
|
||
This special exception was added by the Free Software Foundation
|
||
in version 1.24 of Bison. */
|
||
|
||
/* Written by Richard Stallman by simplifying the original so called
|
||
``semantic'' parser. */
|
||
|
||
/* All symbols defined below should begin with yy or YY, to avoid
|
||
infringing on user name space. This should be done even for local
|
||
variables, as they might otherwise be expanded by user macros.
|
||
There are some unavoidable exceptions within include files to
|
||
define necessary library symbols; they are noted "INFRINGES ON
|
||
USER NAME SPACE" below. */
|
||
|
||
/* Identify Bison output. */
|
||
#define YYBISON 1
|
||
|
||
/* Skeleton name. */
|
||
#define YYSKELETON_NAME "yacc.c"
|
||
|
||
/* Pure parsers. */
|
||
#define YYPURE 0
|
||
|
||
/* Using locations. */
|
||
#define YYLSP_NEEDED 0
|
||
|
||
/* If NAME_PREFIX is specified substitute the variables and functions
|
||
names. */
|
||
#define yyparse llvmAsmparse
|
||
#define yylex llvmAsmlex
|
||
#define yyerror llvmAsmerror
|
||
#define yylval llvmAsmlval
|
||
#define yychar llvmAsmchar
|
||
#define yydebug llvmAsmdebug
|
||
#define yynerrs llvmAsmnerrs
|
||
|
||
|
||
/* Tokens. */
|
||
#ifndef YYTOKENTYPE
|
||
# define YYTOKENTYPE
|
||
/* Put the tokens into the symbol table, so that GDB and other debuggers
|
||
know about them. */
|
||
enum yytokentype {
|
||
ESINT64VAL = 258,
|
||
EUINT64VAL = 259,
|
||
ESAPINTVAL = 260,
|
||
EUAPINTVAL = 261,
|
||
LOCALVAL_ID = 262,
|
||
GLOBALVAL_ID = 263,
|
||
FPVAL = 264,
|
||
VOID = 265,
|
||
INTTYPE = 266,
|
||
FLOAT = 267,
|
||
DOUBLE = 268,
|
||
X86_FP80 = 269,
|
||
FP128 = 270,
|
||
PPC_FP128 = 271,
|
||
LABEL = 272,
|
||
TYPE = 273,
|
||
LOCALVAR = 274,
|
||
GLOBALVAR = 275,
|
||
LABELSTR = 276,
|
||
STRINGCONSTANT = 277,
|
||
ATSTRINGCONSTANT = 278,
|
||
PCTSTRINGCONSTANT = 279,
|
||
ZEROINITIALIZER = 280,
|
||
TRUETOK = 281,
|
||
FALSETOK = 282,
|
||
BEGINTOK = 283,
|
||
ENDTOK = 284,
|
||
DECLARE = 285,
|
||
DEFINE = 286,
|
||
GLOBAL = 287,
|
||
CONSTANT = 288,
|
||
SECTION = 289,
|
||
ALIAS = 290,
|
||
VOLATILE = 291,
|
||
THREAD_LOCAL = 292,
|
||
TO = 293,
|
||
DOTDOTDOT = 294,
|
||
NULL_TOK = 295,
|
||
UNDEF = 296,
|
||
INTERNAL = 297,
|
||
LINKONCE = 298,
|
||
WEAK = 299,
|
||
APPENDING = 300,
|
||
DLLIMPORT = 301,
|
||
DLLEXPORT = 302,
|
||
EXTERN_WEAK = 303,
|
||
OPAQUE = 304,
|
||
EXTERNAL = 305,
|
||
TARGET = 306,
|
||
TRIPLE = 307,
|
||
ALIGN = 308,
|
||
DEPLIBS = 309,
|
||
CALL = 310,
|
||
TAIL = 311,
|
||
ASM_TOK = 312,
|
||
MODULE = 313,
|
||
SIDEEFFECT = 314,
|
||
CC_TOK = 315,
|
||
CCC_TOK = 316,
|
||
FASTCC_TOK = 317,
|
||
COLDCC_TOK = 318,
|
||
X86_STDCALLCC_TOK = 319,
|
||
X86_FASTCALLCC_TOK = 320,
|
||
DATALAYOUT = 321,
|
||
RET = 322,
|
||
BR = 323,
|
||
SWITCH = 324,
|
||
INVOKE = 325,
|
||
UNWIND = 326,
|
||
UNREACHABLE = 327,
|
||
ADD = 328,
|
||
SUB = 329,
|
||
MUL = 330,
|
||
UDIV = 331,
|
||
SDIV = 332,
|
||
FDIV = 333,
|
||
UREM = 334,
|
||
SREM = 335,
|
||
FREM = 336,
|
||
AND = 337,
|
||
OR = 338,
|
||
XOR = 339,
|
||
SHL = 340,
|
||
LSHR = 341,
|
||
ASHR = 342,
|
||
ICMP = 343,
|
||
FCMP = 344,
|
||
EQ = 345,
|
||
NE = 346,
|
||
SLT = 347,
|
||
SGT = 348,
|
||
SLE = 349,
|
||
SGE = 350,
|
||
ULT = 351,
|
||
UGT = 352,
|
||
ULE = 353,
|
||
UGE = 354,
|
||
OEQ = 355,
|
||
ONE = 356,
|
||
OLT = 357,
|
||
OGT = 358,
|
||
OLE = 359,
|
||
OGE = 360,
|
||
ORD = 361,
|
||
UNO = 362,
|
||
UEQ = 363,
|
||
UNE = 364,
|
||
MALLOC = 365,
|
||
ALLOCA = 366,
|
||
FREE = 367,
|
||
LOAD = 368,
|
||
STORE = 369,
|
||
GETELEMENTPTR = 370,
|
||
TRUNC = 371,
|
||
ZEXT = 372,
|
||
SEXT = 373,
|
||
FPTRUNC = 374,
|
||
FPEXT = 375,
|
||
BITCAST = 376,
|
||
UITOFP = 377,
|
||
SITOFP = 378,
|
||
FPTOUI = 379,
|
||
FPTOSI = 380,
|
||
INTTOPTR = 381,
|
||
PTRTOINT = 382,
|
||
PHI_TOK = 383,
|
||
SELECT = 384,
|
||
VAARG = 385,
|
||
EXTRACTELEMENT = 386,
|
||
INSERTELEMENT = 387,
|
||
SHUFFLEVECTOR = 388,
|
||
SIGNEXT = 389,
|
||
ZEROEXT = 390,
|
||
NORETURN = 391,
|
||
INREG = 392,
|
||
SRET = 393,
|
||
NOUNWIND = 394,
|
||
NOALIAS = 395,
|
||
BYVAL = 396,
|
||
NEST = 397,
|
||
DEFAULT = 398,
|
||
HIDDEN = 399,
|
||
PROTECTED = 400
|
||
};
|
||
#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 X86_FP80 269
|
||
#define FP128 270
|
||
#define PPC_FP128 271
|
||
#define LABEL 272
|
||
#define TYPE 273
|
||
#define LOCALVAR 274
|
||
#define GLOBALVAR 275
|
||
#define LABELSTR 276
|
||
#define STRINGCONSTANT 277
|
||
#define ATSTRINGCONSTANT 278
|
||
#define PCTSTRINGCONSTANT 279
|
||
#define ZEROINITIALIZER 280
|
||
#define TRUETOK 281
|
||
#define FALSETOK 282
|
||
#define BEGINTOK 283
|
||
#define ENDTOK 284
|
||
#define DECLARE 285
|
||
#define DEFINE 286
|
||
#define GLOBAL 287
|
||
#define CONSTANT 288
|
||
#define SECTION 289
|
||
#define ALIAS 290
|
||
#define VOLATILE 291
|
||
#define THREAD_LOCAL 292
|
||
#define TO 293
|
||
#define DOTDOTDOT 294
|
||
#define NULL_TOK 295
|
||
#define UNDEF 296
|
||
#define INTERNAL 297
|
||
#define LINKONCE 298
|
||
#define WEAK 299
|
||
#define APPENDING 300
|
||
#define DLLIMPORT 301
|
||
#define DLLEXPORT 302
|
||
#define EXTERN_WEAK 303
|
||
#define OPAQUE 304
|
||
#define EXTERNAL 305
|
||
#define TARGET 306
|
||
#define TRIPLE 307
|
||
#define ALIGN 308
|
||
#define DEPLIBS 309
|
||
#define CALL 310
|
||
#define TAIL 311
|
||
#define ASM_TOK 312
|
||
#define MODULE 313
|
||
#define SIDEEFFECT 314
|
||
#define CC_TOK 315
|
||
#define CCC_TOK 316
|
||
#define FASTCC_TOK 317
|
||
#define COLDCC_TOK 318
|
||
#define X86_STDCALLCC_TOK 319
|
||
#define X86_FASTCALLCC_TOK 320
|
||
#define DATALAYOUT 321
|
||
#define RET 322
|
||
#define BR 323
|
||
#define SWITCH 324
|
||
#define INVOKE 325
|
||
#define UNWIND 326
|
||
#define UNREACHABLE 327
|
||
#define ADD 328
|
||
#define SUB 329
|
||
#define MUL 330
|
||
#define UDIV 331
|
||
#define SDIV 332
|
||
#define FDIV 333
|
||
#define UREM 334
|
||
#define SREM 335
|
||
#define FREM 336
|
||
#define AND 337
|
||
#define OR 338
|
||
#define XOR 339
|
||
#define SHL 340
|
||
#define LSHR 341
|
||
#define ASHR 342
|
||
#define ICMP 343
|
||
#define FCMP 344
|
||
#define EQ 345
|
||
#define NE 346
|
||
#define SLT 347
|
||
#define SGT 348
|
||
#define SLE 349
|
||
#define SGE 350
|
||
#define ULT 351
|
||
#define UGT 352
|
||
#define ULE 353
|
||
#define UGE 354
|
||
#define OEQ 355
|
||
#define ONE 356
|
||
#define OLT 357
|
||
#define OGT 358
|
||
#define OLE 359
|
||
#define OGE 360
|
||
#define ORD 361
|
||
#define UNO 362
|
||
#define UEQ 363
|
||
#define UNE 364
|
||
#define MALLOC 365
|
||
#define ALLOCA 366
|
||
#define FREE 367
|
||
#define LOAD 368
|
||
#define STORE 369
|
||
#define GETELEMENTPTR 370
|
||
#define TRUNC 371
|
||
#define ZEXT 372
|
||
#define SEXT 373
|
||
#define FPTRUNC 374
|
||
#define FPEXT 375
|
||
#define BITCAST 376
|
||
#define UITOFP 377
|
||
#define SITOFP 378
|
||
#define FPTOUI 379
|
||
#define FPTOSI 380
|
||
#define INTTOPTR 381
|
||
#define PTRTOINT 382
|
||
#define PHI_TOK 383
|
||
#define SELECT 384
|
||
#define VAARG 385
|
||
#define EXTRACTELEMENT 386
|
||
#define INSERTELEMENT 387
|
||
#define SHUFFLEVECTOR 388
|
||
#define SIGNEXT 389
|
||
#define ZEROEXT 390
|
||
#define NORETURN 391
|
||
#define INREG 392
|
||
#define SRET 393
|
||
#define NOUNWIND 394
|
||
#define NOALIAS 395
|
||
#define BYVAL 396
|
||
#define NEST 397
|
||
#define DEFAULT 398
|
||
#define HIDDEN 399
|
||
#define PROTECTED 400
|
||
|
||
|
||
|
||
|
||
/* Copy the first part of user declarations. */
|
||
#line 14 "/users/dag/projects/cascade/llvm.modified/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;
|
||
}
|
||
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);
|
||
}
|
||
}
|
||
|
||
|
||
|
||
/* Enabling traces. */
|
||
#ifndef YYDEBUG
|
||
# define YYDEBUG 0
|
||
#endif
|
||
|
||
/* Enabling verbose error messages. */
|
||
#ifdef YYERROR_VERBOSE
|
||
# undef YYERROR_VERBOSE
|
||
# define YYERROR_VERBOSE 1
|
||
#else
|
||
# define YYERROR_VERBOSE 0
|
||
#endif
|
||
|
||
#if ! defined (YYSTYPE) && ! defined (YYSTYPE_IS_DECLARED)
|
||
#line 963 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
typedef union YYSTYPE {
|
||
llvm::Module *ModuleVal;
|
||
llvm::Function *FunctionVal;
|
||
llvm::BasicBlock *BasicBlockVal;
|
||
llvm::TerminatorInst *TermInstVal;
|
||
llvm::Instruction *InstVal;
|
||
llvm::Constant *ConstVal;
|
||
|
||
const llvm::Type *PrimType;
|
||
std::list<llvm::PATypeHolder> *TypeList;
|
||
llvm::PATypeHolder *TypeVal;
|
||
llvm::Value *ValueVal;
|
||
std::vector<llvm::Value*> *ValueList;
|
||
llvm::ArgListType *ArgList;
|
||
llvm::TypeWithAttrs TypeWithAttrs;
|
||
llvm::TypeWithAttrsList *TypeWithAttrsList;
|
||
llvm::ValueRefList *ValueRefList;
|
||
|
||
// Represent the RHS of PHI node
|
||
std::list<std::pair<llvm::Value*,
|
||
llvm::BasicBlock*> > *PHIList;
|
||
std::vector<std::pair<llvm::Constant*, llvm::BasicBlock*> > *JumpTable;
|
||
std::vector<llvm::Constant*> *ConstVector;
|
||
|
||
llvm::GlobalValue::LinkageTypes Linkage;
|
||
llvm::GlobalValue::VisibilityTypes Visibility;
|
||
uint16_t ParamAttrs;
|
||
llvm::APInt *APIntVal;
|
||
int64_t SInt64Val;
|
||
uint64_t UInt64Val;
|
||
int SIntVal;
|
||
unsigned UIntVal;
|
||
double 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;
|
||
/* Line 191 of yacc.c. */
|
||
#line 1371 "llvmAsmParser.tab.c"
|
||
# define yystype YYSTYPE /* obsolescent; will be withdrawn */
|
||
# define YYSTYPE_IS_DECLARED 1
|
||
# define YYSTYPE_IS_TRIVIAL 1
|
||
#endif
|
||
|
||
|
||
|
||
/* Copy the second part of user declarations. */
|
||
|
||
|
||
/* Line 214 of yacc.c. */
|
||
#line 1383 "llvmAsmParser.tab.c"
|
||
|
||
#if ! defined (yyoverflow) || YYERROR_VERBOSE
|
||
|
||
/* The parser invokes alloca or malloc; define the necessary symbols. */
|
||
|
||
# ifdef YYSTACK_USE_ALLOCA
|
||
# if YYSTACK_USE_ALLOCA
|
||
# define YYSTACK_ALLOC alloca
|
||
# endif
|
||
# else
|
||
# if defined (alloca) || defined (_ALLOCA_H)
|
||
# define YYSTACK_ALLOC alloca
|
||
# else
|
||
# ifdef __GNUC__
|
||
# define YYSTACK_ALLOC __builtin_alloca
|
||
# endif
|
||
# endif
|
||
# endif
|
||
|
||
# ifdef YYSTACK_ALLOC
|
||
/* Pacify GCC's `empty if-body' warning. */
|
||
# define YYSTACK_FREE(Ptr) do { /* empty */; } while (0)
|
||
# else
|
||
# if defined (__STDC__) || defined (__cplusplus)
|
||
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
|
||
# define YYSIZE_T size_t
|
||
# endif
|
||
# define YYSTACK_ALLOC malloc
|
||
# define YYSTACK_FREE free
|
||
# endif
|
||
#endif /* ! defined (yyoverflow) || YYERROR_VERBOSE */
|
||
|
||
|
||
#if (! defined (yyoverflow) \
|
||
&& (! defined (__cplusplus) \
|
||
|| (defined (YYSTYPE_IS_TRIVIAL) && YYSTYPE_IS_TRIVIAL)))
|
||
|
||
/* A type that is properly aligned for any stack member. */
|
||
union yyalloc
|
||
{
|
||
short yyss;
|
||
YYSTYPE yyvs;
|
||
};
|
||
|
||
/* The size of the maximum gap between one aligned stack and the next. */
|
||
# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1)
|
||
|
||
/* The size of an array large to enough to hold all stacks, each with
|
||
N elements. */
|
||
# define YYSTACK_BYTES(N) \
|
||
((N) * (sizeof (short) + sizeof (YYSTYPE)) \
|
||
+ YYSTACK_GAP_MAXIMUM)
|
||
|
||
/* Copy COUNT objects from FROM to TO. The source and destination do
|
||
not overlap. */
|
||
# ifndef YYCOPY
|
||
# if defined (__GNUC__) && 1 < __GNUC__
|
||
# define YYCOPY(To, From, Count) \
|
||
__builtin_memcpy (To, From, (Count) * sizeof (*(From)))
|
||
# else
|
||
# define YYCOPY(To, From, Count) \
|
||
do \
|
||
{ \
|
||
register YYSIZE_T yyi; \
|
||
for (yyi = 0; yyi < (Count); yyi++) \
|
||
(To)[yyi] = (From)[yyi]; \
|
||
} \
|
||
while (0)
|
||
# endif
|
||
# endif
|
||
|
||
/* Relocate STACK from its old location to the new one. The
|
||
local variables YYSIZE and YYSTACKSIZE give the old and new number of
|
||
elements in the stack, and YYPTR gives the new location of the
|
||
stack. Advance YYPTR to a properly aligned location for the next
|
||
stack. */
|
||
# define YYSTACK_RELOCATE(Stack) \
|
||
do \
|
||
{ \
|
||
YYSIZE_T yynewbytes; \
|
||
YYCOPY (&yyptr->Stack, Stack, yysize); \
|
||
Stack = &yyptr->Stack; \
|
||
yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \
|
||
yyptr += yynewbytes / sizeof (*yyptr); \
|
||
} \
|
||
while (0)
|
||
|
||
#endif
|
||
|
||
#if defined (__STDC__) || defined (__cplusplus)
|
||
typedef signed char yysigned_char;
|
||
#else
|
||
typedef short yysigned_char;
|
||
#endif
|
||
|
||
/* YYFINAL -- State number of the termination state. */
|
||
#define YYFINAL 43
|
||
/* YYLAST -- Last index in YYTABLE. */
|
||
#define YYLAST 1685
|
||
|
||
/* YYNTOKENS -- Number of terminals. */
|
||
#define YYNTOKENS 160
|
||
/* YYNNTS -- Number of nonterminals. */
|
||
#define YYNNTS 82
|
||
/* YYNRULES -- Number of rules. */
|
||
#define YYNRULES 310
|
||
/* YYNRULES -- Number of states. */
|
||
#define YYNSTATES 594
|
||
|
||
/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */
|
||
#define YYUNDEFTOK 2
|
||
#define YYMAXUTOK 400
|
||
|
||
#define YYTRANSLATE(YYX) \
|
||
((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)
|
||
|
||
/* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */
|
||
static const unsigned char yytranslate[] =
|
||
{
|
||
0, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
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, 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, 136, 137, 138, 139, 140, 141, 142, 143, 144,
|
||
145
|
||
};
|
||
|
||
#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, 123, 125, 127, 129, 130, 133, 134, 136,
|
||
138, 140, 141, 144, 146, 148, 150, 152, 154, 156,
|
||
158, 160, 161, 163, 165, 167, 168, 170, 172, 173,
|
||
175, 177, 179, 181, 182, 184, 186, 187, 189, 191,
|
||
193, 195, 197, 200, 202, 204, 206, 208, 210, 212,
|
||
214, 216, 218, 219, 222, 224, 226, 228, 230, 231,
|
||
234, 235, 238, 239, 243, 246, 247, 249, 250, 254,
|
||
256, 259, 261, 263, 265, 267, 269, 271, 273, 275,
|
||
277, 280, 282, 285, 291, 297, 303, 309, 313, 316,
|
||
322, 327, 330, 332, 334, 336, 340, 342, 346, 348,
|
||
349, 351, 355, 360, 364, 368, 373, 378, 382, 389,
|
||
395, 398, 401, 404, 407, 410, 413, 416, 419, 422,
|
||
425, 428, 431, 438, 444, 453, 460, 467, 475, 483,
|
||
490, 499, 508, 512, 514, 516, 518, 520, 521, 524,
|
||
531, 533, 534, 536, 539, 540, 544, 545, 549, 553,
|
||
557, 561, 562, 570, 571, 580, 581, 590, 596, 599,
|
||
603, 605, 609, 613, 617, 621, 623, 624, 630, 634,
|
||
636, 640, 642, 643, 653, 655, 657, 662, 664, 666,
|
||
669, 673, 674, 676, 678, 680, 682, 684, 686, 688,
|
||
690, 692, 696, 698, 704, 706, 708, 710, 712, 714,
|
||
716, 719, 722, 725, 729, 732, 733, 735, 738, 741,
|
||
745, 755, 765, 774, 789, 791, 793, 800, 806, 809,
|
||
816, 824, 828, 834, 835, 836, 840, 843, 845, 851,
|
||
857, 864, 871, 876, 883, 888, 893, 900, 907, 910,
|
||
919, 921, 923, 924, 928, 935, 939, 946, 949, 955,
|
||
963
|
||
};
|
||
|
||
/* YYRHS -- A `-1'-separated list of the rules' RHS. */
|
||
static const short yyrhs[] =
|
||
{
|
||
204, 0, -1, 73, -1, 74, -1, 75, -1, 76,
|
||
-1, 77, -1, 78, -1, 79, -1, 80, -1, 81,
|
||
-1, 85, -1, 86, -1, 87, -1, 82, -1, 83,
|
||
-1, 84, -1, 116, -1, 117, -1, 118, -1, 119,
|
||
-1, 120, -1, 121, -1, 122, -1, 123, -1, 124,
|
||
-1, 125, -1, 126, -1, 127, -1, 90, -1, 91,
|
||
-1, 92, -1, 93, -1, 94, -1, 95, -1, 96,
|
||
-1, 97, -1, 98, -1, 99, -1, 100, -1, 101,
|
||
-1, 102, -1, 103, -1, 104, -1, 105, -1, 106,
|
||
-1, 107, -1, 108, -1, 109, -1, 96, -1, 97,
|
||
-1, 98, -1, 99, -1, 26, -1, 27, -1, 11,
|
||
-1, 12, -1, 13, -1, 16, -1, 15, -1, 14,
|
||
-1, 19, -1, 22, -1, 24, -1, 168, -1, -1,
|
||
168, 146, -1, -1, 20, -1, 23, -1, 173, -1,
|
||
-1, 171, 146, -1, 42, -1, 44, -1, 43, -1,
|
||
45, -1, 47, -1, 46, -1, 48, -1, 50, -1,
|
||
-1, 143, -1, 144, -1, 145, -1, -1, 46, -1,
|
||
48, -1, -1, 42, -1, 43, -1, 44, -1, 47,
|
||
-1, -1, 44, -1, 42, -1, -1, 61, -1, 62,
|
||
-1, 63, -1, 64, -1, 65, -1, 60, 4, -1,
|
||
135, -1, 117, -1, 134, -1, 118, -1, 137, -1,
|
||
138, -1, 140, -1, 141, -1, 142, -1, -1, 182,
|
||
181, -1, 136, -1, 139, -1, 135, -1, 134, -1,
|
||
-1, 184, 183, -1, -1, 53, 4, -1, -1, 147,
|
||
53, 4, -1, 34, 22, -1, -1, 187, -1, -1,
|
||
147, 190, 189, -1, 187, -1, 53, 4, -1, 11,
|
||
-1, 12, -1, 13, -1, 16, -1, 15, -1, 14,
|
||
-1, 17, -1, 49, -1, 191, -1, 192, 148, -1,
|
||
226, -1, 149, 4, -1, 192, 150, 196, 151, 184,
|
||
-1, 10, 150, 196, 151, 184, -1, 152, 4, 153,
|
||
192, 154, -1, 155, 4, 153, 192, 156, -1, 157,
|
||
197, 158, -1, 157, 158, -1, 155, 157, 197, 158,
|
||
156, -1, 155, 157, 158, 156, -1, 192, 182, -1,
|
||
192, -1, 10, -1, 193, -1, 195, 147, 193, -1,
|
||
195, -1, 195, 147, 39, -1, 39, -1, -1, 192,
|
||
-1, 197, 147, 192, -1, 192, 152, 200, 154, -1,
|
||
192, 152, 154, -1, 192, 159, 22, -1, 192, 155,
|
||
200, 156, -1, 192, 157, 200, 158, -1, 192, 157,
|
||
158, -1, 192, 155, 157, 200, 158, 156, -1, 192,
|
||
155, 157, 158, 156, -1, 192, 40, -1, 192, 41,
|
||
-1, 192, 226, -1, 192, 199, -1, 192, 25, -1,
|
||
166, 3, -1, 166, 5, -1, 166, 4, -1, 166,
|
||
6, -1, 11, 26, -1, 11, 27, -1, 167, 9,
|
||
-1, 163, 150, 198, 38, 192, 151, -1, 115, 150,
|
||
198, 237, 151, -1, 129, 150, 198, 147, 198, 147,
|
||
198, 151, -1, 161, 150, 198, 147, 198, 151, -1,
|
||
162, 150, 198, 147, 198, 151, -1, 88, 164, 150,
|
||
198, 147, 198, 151, -1, 89, 165, 150, 198, 147,
|
||
198, 151, -1, 131, 150, 198, 147, 198, 151, -1,
|
||
132, 150, 198, 147, 198, 147, 198, 151, -1, 133,
|
||
150, 198, 147, 198, 147, 198, 151, -1, 200, 147,
|
||
198, -1, 198, -1, 32, -1, 33, -1, 37, -1,
|
||
-1, 194, 226, -1, 121, 150, 203, 38, 192, 151,
|
||
-1, 205, -1, -1, 206, -1, 205, 206, -1, -1,
|
||
31, 207, 222, -1, -1, 30, 208, 223, -1, 58,
|
||
57, 212, -1, 170, 18, 192, -1, 170, 18, 10,
|
||
-1, -1, 172, 176, 202, 201, 198, 209, 189, -1,
|
||
-1, 172, 174, 176, 202, 201, 198, 210, 189, -1,
|
||
-1, 172, 175, 176, 202, 201, 192, 211, 189, -1,
|
||
172, 176, 35, 179, 203, -1, 51, 213, -1, 54,
|
||
146, 214, -1, 22, -1, 52, 146, 22, -1, 66,
|
||
146, 22, -1, 152, 215, 154, -1, 215, 147, 22,
|
||
-1, 22, -1, -1, 216, 147, 192, 182, 169, -1,
|
||
192, 182, 169, -1, 216, -1, 216, 147, 39, -1,
|
||
39, -1, -1, 180, 194, 171, 150, 217, 151, 184,
|
||
188, 185, -1, 28, -1, 157, -1, 178, 176, 218,
|
||
219, -1, 29, -1, 158, -1, 229, 221, -1, 177,
|
||
176, 218, -1, -1, 59, -1, 3, -1, 4, -1,
|
||
9, -1, 26, -1, 27, -1, 40, -1, 41, -1,
|
||
25, -1, 155, 200, 156, -1, 199, -1, 57, 224,
|
||
22, 147, 22, -1, 7, -1, 8, -1, 168, -1,
|
||
171, -1, 226, -1, 225, -1, 192, 227, -1, 229,
|
||
230, -1, 220, 230, -1, 231, 170, 232, -1, 231,
|
||
234, -1, -1, 21, -1, 67, 228, -1, 67, 10,
|
||
-1, 68, 17, 227, -1, 68, 11, 227, 147, 17,
|
||
227, 147, 17, 227, -1, 69, 166, 227, 147, 17,
|
||
227, 152, 233, 154, -1, 69, 166, 227, 147, 17,
|
||
227, 152, 154, -1, 70, 180, 194, 227, 150, 236,
|
||
151, 184, 38, 17, 227, 71, 17, 227, -1, 71,
|
||
-1, 72, -1, 233, 166, 225, 147, 17, 227, -1,
|
||
166, 225, 147, 17, 227, -1, 170, 239, -1, 192,
|
||
152, 227, 147, 227, 154, -1, 235, 147, 152, 227,
|
||
147, 227, 154, -1, 192, 227, 182, -1, 236, 147,
|
||
192, 227, 182, -1, -1, -1, 237, 147, 228, -1,
|
||
56, 55, -1, 55, -1, 161, 192, 227, 147, 227,
|
||
-1, 162, 192, 227, 147, 227, -1, 88, 164, 192,
|
||
227, 147, 227, -1, 89, 165, 192, 227, 147, 227,
|
||
-1, 163, 228, 38, 192, -1, 129, 228, 147, 228,
|
||
147, 228, -1, 130, 228, 147, 192, -1, 131, 228,
|
||
147, 228, -1, 132, 228, 147, 228, 147, 228, -1,
|
||
133, 228, 147, 228, 147, 228, -1, 128, 235, -1,
|
||
238, 180, 194, 227, 150, 236, 151, 184, -1, 241,
|
||
-1, 36, -1, -1, 110, 192, 186, -1, 110, 192,
|
||
147, 11, 227, 186, -1, 111, 192, 186, -1, 111,
|
||
192, 147, 11, 227, 186, -1, 112, 228, -1, 240,
|
||
113, 192, 227, 186, -1, 240, 114, 228, 147, 192,
|
||
227, 186, -1, 115, 192, 227, 237, -1
|
||
};
|
||
|
||
/* YYRLINE[YYN] -- source line where rule number YYN was defined. */
|
||
static const unsigned short yyrline[] =
|
||
{
|
||
0, 1122, 1122, 1122, 1122, 1122, 1122, 1122, 1122, 1122,
|
||
1122, 1123, 1123, 1123, 1123, 1123, 1123, 1124, 1124, 1124,
|
||
1124, 1124, 1124, 1125, 1125, 1125, 1125, 1125, 1125, 1128,
|
||
1128, 1129, 1129, 1130, 1130, 1131, 1131, 1132, 1132, 1136,
|
||
1136, 1137, 1137, 1138, 1138, 1139, 1139, 1140, 1140, 1141,
|
||
1141, 1142, 1142, 1143, 1144, 1149, 1150, 1150, 1150, 1150,
|
||
1150, 1152, 1152, 1152, 1153, 1153, 1157, 1161, 1166, 1166,
|
||
1168, 1169, 1174, 1180, 1181, 1182, 1183, 1184, 1188, 1189,
|
||
1190, 1194, 1195, 1196, 1197, 1201, 1202, 1203, 1207, 1208,
|
||
1209, 1210, 1211, 1215, 1216, 1217, 1220, 1221, 1222, 1223,
|
||
1224, 1225, 1226, 1233, 1234, 1235, 1236, 1237, 1238, 1239,
|
||
1240, 1241, 1244, 1245, 1250, 1251, 1252, 1253, 1256, 1257,
|
||
1264, 1265, 1271, 1272, 1280, 1288, 1289, 1294, 1295, 1296,
|
||
1301, 1314, 1314, 1314, 1314, 1314, 1314, 1314, 1317, 1321,
|
||
1325, 1332, 1337, 1345, 1375, 1406, 1411, 1423, 1433, 1437,
|
||
1447, 1454, 1461, 1468, 1473, 1478, 1485, 1486, 1493, 1500,
|
||
1508, 1514, 1526, 1554, 1570, 1597, 1625, 1651, 1671, 1697,
|
||
1717, 1729, 1736, 1802, 1812, 1822, 1828, 1838, 1844, 1854,
|
||
1859, 1864, 1872, 1884, 1906, 1914, 1920, 1931, 1936, 1941,
|
||
1947, 1953, 1962, 1966, 1974, 1974, 1977, 1977, 1980, 1992,
|
||
2013, 2018, 2026, 2027, 2031, 2031, 2035, 2035, 2038, 2041,
|
||
2065, 2076, 2076, 2087, 2086, 2096, 2095, 2106, 2125, 2128,
|
||
2134, 2144, 2148, 2153, 2155, 2160, 2165, 2174, 2184, 2195,
|
||
2199, 2208, 2217, 2222, 2343, 2343, 2345, 2354, 2354, 2356,
|
||
2361, 2373, 2377, 2382, 2386, 2390, 2394, 2398, 2402, 2406,
|
||
2410, 2414, 2439, 2443, 2453, 2457, 2461, 2466, 2473, 2473,
|
||
2479, 2488, 2492, 2501, 2510, 2519, 2523, 2530, 2534, 2538,
|
||
2543, 2553, 2572, 2581, 2661, 2665, 2672, 2683, 2696, 2706,
|
||
2717, 2727, 2736, 2745, 2748, 2749, 2756, 2760, 2765, 2786,
|
||
2803, 2817, 2831, 2843, 2851, 2858, 2864, 2870, 2876, 2891,
|
||
2976, 2981, 2985, 2992, 2999, 3007, 3014, 3022, 3030, 3044,
|
||
3061
|
||
};
|
||
#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", "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'", "$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, 391, 392, 393, 394,
|
||
395, 396, 397, 398, 399, 400, 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, 160, 161, 161, 161, 161, 161, 161, 161, 161,
|
||
161, 162, 162, 162, 162, 162, 162, 163, 163, 163,
|
||
163, 163, 163, 163, 163, 163, 163, 163, 163, 164,
|
||
164, 164, 164, 164, 164, 164, 164, 164, 164, 165,
|
||
165, 165, 165, 165, 165, 165, 165, 165, 165, 165,
|
||
165, 165, 165, 165, 165, 166, 167, 167, 167, 167,
|
||
167, 168, 168, 168, 169, 169, 170, 170, 171, 171,
|
||
172, 172, 173, 174, 174, 174, 174, 174, 175, 175,
|
||
175, 176, 176, 176, 176, 177, 177, 177, 178, 178,
|
||
178, 178, 178, 179, 179, 179, 180, 180, 180, 180,
|
||
180, 180, 180, 181, 181, 181, 181, 181, 181, 181,
|
||
181, 181, 182, 182, 183, 183, 183, 183, 184, 184,
|
||
185, 185, 186, 186, 187, 188, 188, 189, 189, 190,
|
||
190, 191, 191, 191, 191, 191, 191, 191, 192, 192,
|
||
192, 192, 192, 192, 192, 192, 192, 192, 192, 192,
|
||
192, 193, 194, 194, 195, 195, 196, 196, 196, 196,
|
||
197, 197, 198, 198, 198, 198, 198, 198, 198, 198,
|
||
198, 198, 198, 198, 198, 198, 198, 198, 198, 198,
|
||
198, 198, 199, 199, 199, 199, 199, 199, 199, 199,
|
||
199, 199, 200, 200, 201, 201, 202, 202, 203, 203,
|
||
204, 204, 205, 205, 207, 206, 208, 206, 206, 206,
|
||
206, 209, 206, 210, 206, 211, 206, 206, 206, 206,
|
||
212, 213, 213, 214, 215, 215, 215, 216, 216, 217,
|
||
217, 217, 217, 218, 219, 219, 220, 221, 221, 222,
|
||
223, 224, 224, 225, 225, 225, 225, 225, 225, 225,
|
||
225, 225, 225, 225, 226, 226, 226, 226, 227, 227,
|
||
228, 229, 229, 230, 231, 231, 231, 232, 232, 232,
|
||
232, 232, 232, 232, 232, 232, 233, 233, 234, 235,
|
||
235, 236, 236, 236, 237, 237, 238, 238, 239, 239,
|
||
239, 239, 239, 239, 239, 239, 239, 239, 239, 239,
|
||
239, 240, 240, 241, 241, 241, 241, 241, 241, 241,
|
||
241
|
||
};
|
||
|
||
/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */
|
||
static const unsigned char yyr2[] =
|
||
{
|
||
0, 2, 1, 1, 1, 1, 1, 1, 1, 1,
|
||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||
1, 1, 1, 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
|
||
};
|
||
|
||
/* 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[] =
|
||
{
|
||
71, 61, 68, 62, 69, 63, 206, 204, 0, 0,
|
||
0, 0, 0, 0, 81, 70, 0, 71, 202, 85,
|
||
88, 0, 0, 218, 0, 0, 66, 0, 72, 73,
|
||
75, 74, 76, 78, 77, 79, 80, 82, 83, 84,
|
||
81, 81, 197, 1, 203, 86, 87, 81, 207, 89,
|
||
90, 91, 92, 81, 265, 205, 265, 0, 0, 226,
|
||
219, 220, 208, 254, 255, 210, 131, 132, 133, 136,
|
||
135, 134, 137, 138, 0, 0, 0, 0, 256, 257,
|
||
139, 209, 141, 197, 197, 93, 196, 0, 96, 96,
|
||
266, 262, 67, 237, 238, 239, 261, 221, 222, 225,
|
||
0, 159, 142, 0, 0, 0, 0, 148, 160, 0,
|
||
140, 159, 0, 0, 95, 94, 0, 194, 195, 0,
|
||
0, 97, 98, 99, 100, 101, 0, 240, 0, 302,
|
||
264, 0, 223, 158, 112, 154, 156, 0, 0, 0,
|
||
0, 0, 0, 147, 0, 0, 0, 153, 0, 152,
|
||
0, 217, 131, 132, 133, 136, 135, 134, 0, 0,
|
||
0, 211, 102, 0, 234, 235, 236, 301, 287, 0,
|
||
0, 0, 0, 96, 274, 275, 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, 263, 96,
|
||
278, 0, 300, 224, 151, 0, 118, 0, 0, 150,
|
||
0, 161, 118, 213, 215, 0, 198, 179, 180, 175,
|
||
177, 176, 178, 181, 174, 170, 171, 0, 0, 0,
|
||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 173, 172, 127, 0, 286, 268, 0, 267, 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, 122, 122, 307, 0, 0, 298, 0, 0,
|
||
0, 0, 0, 0, 0, 0, 0, 0, 0, 104,
|
||
106, 105, 103, 107, 108, 109, 110, 111, 113, 157,
|
||
155, 144, 145, 146, 149, 143, 127, 127, 0, 0,
|
||
0, 0, 0, 0, 0, 0, 163, 193, 0, 0,
|
||
0, 167, 0, 164, 0, 0, 0, 0, 212, 232,
|
||
243, 244, 245, 250, 246, 247, 248, 249, 241, 0,
|
||
252, 259, 258, 260, 0, 269, 0, 0, 0, 0,
|
||
0, 303, 0, 305, 284, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 0, 0, 0, 0, 0, 117, 116,
|
||
114, 115, 119, 214, 216, 0, 0, 0, 284, 0,
|
||
0, 0, 0, 0, 162, 148, 160, 0, 165, 166,
|
||
0, 0, 0, 0, 0, 129, 127, 231, 112, 229,
|
||
0, 242, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 0, 310, 0, 0, 0, 294, 295, 0, 0,
|
||
0, 0, 292, 0, 122, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 0, 192, 169, 0, 0, 0, 0,
|
||
124, 130, 128, 65, 0, 118, 0, 251, 0, 0,
|
||
283, 0, 0, 122, 123, 122, 0, 0, 0, 0,
|
||
0, 0, 288, 289, 283, 0, 308, 0, 199, 0,
|
||
0, 183, 0, 0, 0, 0, 168, 0, 0, 0,
|
||
64, 228, 230, 112, 125, 0, 0, 0, 0, 0,
|
||
290, 291, 304, 306, 285, 0, 0, 293, 296, 297,
|
||
0, 122, 0, 0, 0, 189, 0, 0, 185, 186,
|
||
182, 65, 126, 120, 253, 0, 0, 112, 0, 118,
|
||
279, 0, 118, 309, 187, 188, 0, 0, 0, 227,
|
||
0, 233, 0, 272, 0, 0, 281, 0, 0, 280,
|
||
299, 184, 190, 191, 121, 270, 0, 271, 0, 112,
|
||
0, 0, 0, 282, 0, 0, 0, 0, 277, 0,
|
||
0, 276, 0, 273
|
||
};
|
||
|
||
/* YYDEFGOTO[NTERM-NUM]. */
|
||
static const short yydefgoto[] =
|
||
{
|
||
-1, 258, 259, 260, 284, 301, 158, 159, 78, 511,
|
||
12, 79, 14, 15, 40, 41, 42, 47, 53, 116,
|
||
126, 328, 224, 402, 331, 561, 381, 425, 543, 358,
|
||
426, 80, 160, 135, 150, 136, 137, 109, 347, 370,
|
||
348, 119, 87, 151, 16, 17, 18, 20, 19, 263,
|
||
336, 337, 62, 23, 60, 100, 429, 430, 127, 166,
|
||
54, 95, 55, 48, 432, 371, 82, 373, 268, 56,
|
||
91, 92, 218, 565, 130, 307, 519, 442, 219, 220,
|
||
221, 222
|
||
};
|
||
|
||
/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
|
||
STATE-NUM. */
|
||
#define YYPACT_NINF -529
|
||
static const short yypact[] =
|
||
{
|
||
40, -529, -529, -529, -529, -529, -529, -529, -17, -107,
|
||
12, -64, 78, -40, 183, -529, 150, 370, -529, 147,
|
||
115, -5, 26, -529, 14, 132, -529, 1319, -529, -529,
|
||
-529, -529, -529, -529, -529, -529, -529, -529, -529, -529,
|
||
-90, -90, 173, -529, -529, -529, -529, -90, -529, -529,
|
||
-529, -529, -529, -90, 154, -529, -7, 179, 197, 214,
|
||
-529, -529, -529, -529, -529, 96, -529, -529, -529, -529,
|
||
-529, -529, -529, -529, 253, 258, 3, 791, -529, -529,
|
||
-529, 145, -529, 228, 228, 287, -529, 191, 189, 189,
|
||
-529, -529, 109, -529, -529, -529, -529, -529, -529, -529,
|
||
-66, 1052, -529, 125, 135, 835, 96, -529, 145, -110,
|
||
-529, 1052, 191, 191, -529, -529, 1092, -529, -529, 1359,
|
||
285, -529, -529, -529, -529, -529, 1377, -529, -12, 1525,
|
||
-529, 272, -529, -529, 145, -529, 153, 152, 1430, 1430,
|
||
168, -106, 1430, -529, 157, 1359, 1430, 96, 159, 145,
|
||
102, -529, 39, 321, 323, 325, 326, 327, 266, 328,
|
||
750, -529, -529, 141, -529, -529, -529, -529, -529, 288,
|
||
1470, 94, 329, 189, -529, -529, -529, -529, -529, -529,
|
||
-529, -529, -529, -529, -529, -529, -529, -529, -529, -529,
|
||
-529, 222, 625, 1430, 1430, 1430, 1430, -529, -529, -529,
|
||
-529, -529, -529, -529, -529, -529, -529, -529, -529, 1430,
|
||
1430, 1430, 1430, 1430, 1430, 1430, 1430, 1430, -529, 189,
|
||
-529, 128, -529, -529, 126, 1110, -529, -53, -72, -529,
|
||
188, 145, -529, -529, 145, 1092, -529, -529, -529, -529,
|
||
-529, -529, -529, -529, -529, -529, -529, 222, 625, 195,
|
||
196, 200, 201, 202, 1204, 1528, 1012, 331, 204, 206,
|
||
208, -529, -529, 212, 210, -529, 96, 486, -529, 623,
|
||
623, -529, 623, 1377, -529, -529, -529, -529, -529, -529,
|
||
-529, -529, -529, -529, 1430, -529, -529, -529, -529, -529,
|
||
-529, -529, -529, -529, -529, -529, -529, -529, -529, -529,
|
||
-529, 1430, -1, 32, -529, 486, 52, 219, 220, 224,
|
||
227, 230, 233, 486, 486, 343, 1377, 1430, 1430, -529,
|
||
-529, -529, -529, -529, -529, -529, -529, -529, -529, -529,
|
||
-529, 77, -529, -529, -529, 77, 212, 212, 344, 234,
|
||
235, 1359, 1359, 1359, 1359, 1359, -529, -529, -61, 1031,
|
||
-100, -529, -101, -529, 1359, 1359, 1359, -19, -529, 1261,
|
||
-529, -529, -529, -529, -529, -529, -529, -529, 310, 1359,
|
||
-529, -529, -529, -529, 236, -529, 240, 623, 486, 486,
|
||
20, -529, 21, -529, -529, 623, 239, 1430, 1430, 1430,
|
||
1430, 1430, 249, 250, 1430, 623, 486, 251, -529, -529,
|
||
-529, -529, -529, -529, -529, 1430, 1359, 1359, -529, 252,
|
||
259, 260, 264, 1359, -529, 256, 750, -75, -529, -529,
|
||
267, 268, 375, 396, 415, -529, 212, -529, 145, 273,
|
||
274, -529, 401, -79, 409, 413, 281, 286, 289, 623,
|
||
428, 623, 290, 291, 623, 292, 145, -529, 293, 299,
|
||
623, 623, 145, 284, 300, 1430, 84, 303, 304, -44,
|
||
1359, 1359, 1359, 1359, -529, -529, 279, 1359, 1359, 1430,
|
||
-529, -529, -529, 80, 1279, -529, 306, -529, 623, 623,
|
||
1430, 623, 623, 300, -529, 300, 1430, 623, 308, 1430,
|
||
1430, 1430, -529, -529, 1430, 403, -529, 486, -529, 1359,
|
||
1359, -529, 311, 315, 312, 314, -529, 316, 318, 129,
|
||
-529, -529, -529, 145, 4, 435, 324, 320, 486, -33,
|
||
-529, -529, -529, -529, -529, 330, 623, -529, -529, -529,
|
||
-32, 300, 319, 332, 1359, -529, 1359, 1359, -529, -529,
|
||
-529, 80, -529, 421, -529, 445, -2, -529, 1430, -529,
|
||
-529, 333, -529, -529, -529, -529, 334, 335, 340, -529,
|
||
471, -529, 623, -529, 885, 2, 126, 486, 42, -529,
|
||
77, -529, -529, -529, -529, -529, 345, -529, 885, -529,
|
||
460, 479, 350, 126, 623, 623, 483, 430, -529, 623,
|
||
485, -529, 623, -529
|
||
};
|
||
|
||
/* YYPGOTO[NTERM-NUM]. */
|
||
static const short yypgoto[] =
|
||
{
|
||
-529, 374, 378, 385, 257, 269, -170, -529, 0, -25,
|
||
423, 8, -529, -529, -529, -529, 95, -529, -529, -529,
|
||
-152, -529, -424, -529, -227, -529, -291, 5, -529, -318,
|
||
-529, -529, -26, 295, -120, -529, 407, 416, -58, -157,
|
||
-232, 161, 198, 294, -529, -529, 506, -529, -529, -529,
|
||
-529, -529, -529, -529, -529, -529, -529, -529, 436, -529,
|
||
-529, -529, -529, -529, -529, -528, -140, 103, -184, -529,
|
||
468, -529, -529, -529, -529, -529, 34, 122, -529, -529,
|
||
-529, -529
|
||
};
|
||
|
||
/* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If
|
||
positive, shift that token. If negative, reduce the rule which
|
||
number is the opposite. If zero, do what YYDEFACT says.
|
||
If YYTABLE_NINF, syntax error. */
|
||
#define YYTABLE_NINF -202
|
||
static const short yytable[] =
|
||
{
|
||
11, 81, 272, 261, 473, 335, 163, 104, 13, 271,
|
||
236, 304, 383, 271, 90, 423, 164, 11, 403, 404,
|
||
262, 273, 93, 350, 352, 13, 308, 309, 310, 311,
|
||
312, 439, 441, 315, 424, 21, 576, 142, 423, 24,
|
||
-201, 142, -55, -55, -55, -55, 413, 413, 143, 22,
|
||
582, 108, 230, 37, 38, 39, 418, 419, -67, 1,
|
||
2, 161, 3, 4, 5, 237, 238, 316, 413, 25,
|
||
6, 7, 413, 440, 440, 134, 110, 477, 111, 108,
|
||
580, 131, 26, 466, 333, 134, 413, 233, 132, 541,
|
||
149, 8, 11, 414, 9, 110, 27, 111, 10, 1,
|
||
149, 332, 3, 486, 5, 269, 28, 501, 472, 63,
|
||
64, 270, 227, 228, 548, 548, 231, 417, 549, 552,
|
||
234, 1, 2, 566, 3, 4, 5, 372, 1, 372,
|
||
372, 3, 372, 5, 397, 83, 84, 433, 398, 399,
|
||
400, 57, 88, 401, 267, 165, 380, 110, 89, 111,
|
||
43, 94, 563, 377, 61, 583, 577, 49, 50, 51,
|
||
105, 2, 52, 496, 4, 372, 59, 302, 303, 267,
|
||
305, 264, 58, 372, 372, 90, 398, 399, 400, 382,
|
||
110, 401, 111, 306, 267, 267, 267, 267, 267, 313,
|
||
314, 267, 522, 45, 523, 46, 395, 319, 320, 134,
|
||
110, 97, 111, 445, 385, 447, 448, 449, 85, 149,
|
||
86, 398, 399, 400, 321, 322, 401, 323, 324, 98,
|
||
325, 326, 327, 117, 118, 29, 30, 31, 32, 33,
|
||
34, 35, 110, 36, 111, 498, 99, 372, 372, 372,
|
||
553, 317, 318, 319, 320, 372, 101, 149, 514, 120,
|
||
121, 122, 123, 124, 125, 372, 372, 102, 378, 261,
|
||
321, 322, 103, 323, 324, 86, 325, 326, 327, 239,
|
||
240, 241, 242, 145, 146, 379, 262, 110, 138, 111,
|
||
540, 112, 113, 408, 409, 410, 411, 412, 139, 162,
|
||
149, 396, 267, 110, 223, 111, 420, 421, 422, 372,
|
||
225, 372, 524, 226, 372, 527, 528, 529, 232, 235,
|
||
372, 372, 274, 275, 276, 277, 278, 279, 280, 281,
|
||
282, 283, 568, 416, 229, 570, 37, 38, 39, 114,
|
||
-56, 115, -57, 428, -60, -59, -58, 243, 372, 372,
|
||
271, 372, 372, 265, 334, 341, 342, 372, 457, 458,
|
||
343, 344, 345, 353, 354, 464, 355, 372, 356, 357,
|
||
359, 267, 446, 267, 267, 267, 386, 387, 452, 431,
|
||
-200, 388, 374, 375, 389, 376, 564, 390, 372, 456,
|
||
391, 394, 405, 434, 406, 407, 372, 435, -67, 1,
|
||
2, 444, 3, 4, 5, 578, 450, 451, 455, 460,
|
||
6, 7, 502, 503, 504, 505, 461, 462, 384, 507,
|
||
508, 463, 465, 469, 467, 468, 392, 393, 470, 471,
|
||
474, 8, 372, 476, 9, 475, 478, 372, 10, 497,
|
||
479, 480, 484, 481, 494, 506, 482, 486, 487, 489,
|
||
490, 532, 533, 509, 372, 372, 491, 495, 513, 372,
|
||
499, 500, 372, 515, 518, 526, 440, 544, 534, 536,
|
||
267, 537, 562, 267, 267, 267, 535, 538, 518, 539,
|
||
554, 545, 546, 510, 560, 574, 556, 584, 557, 558,
|
||
436, 437, 438, 555, 550, 571, 572, 569, 443, 360,
|
||
361, 573, 581, 63, 64, 362, 585, 586, 453, 454,
|
||
589, 590, 592, 215, 339, 1, 2, 216, 3, 4,
|
||
5, 363, 364, 365, 217, 129, 559, 340, 144, 542,
|
||
330, 141, 567, 44, 96, 128, 366, 367, 530, 338,
|
||
459, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 510, 483, 368, 485, 0, 0, 488, 0, 0,
|
||
0, 0, 0, 492, 493, 0, 0, 0, 0, 176,
|
||
177, 178, 179, 180, 181, 182, 183, 184, 185, 186,
|
||
187, 188, 189, 190, 247, 248, 0, 0, 0, 0,
|
||
0, 516, 517, 0, 520, 521, 0, 0, 0, 0,
|
||
525, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
531, 249, 197, 198, 199, 200, 201, 202, 203, 204,
|
||
205, 206, 207, 208, 0, 250, 0, 251, 252, 253,
|
||
0, 547, 0, 0, 0, 0, 360, 361, 0, 551,
|
||
63, 64, 362, 0, 110, 0, 111, 0, 0, 0,
|
||
0, 369, 1, 2, 0, 3, 4, 5, 363, 364,
|
||
365, 285, 286, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 366, 367, 575, 0, 0, 0, 0,
|
||
579, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
368, 0, 0, 0, 0, 0, 0, 587, 588, 0,
|
||
0, 0, 591, 0, 0, 593, 176, 177, 178, 179,
|
||
180, 181, 182, 183, 184, 185, 186, 187, 188, 189,
|
||
190, 247, 248, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 287, 288, 289, 290, 291, 292, 293, 294, 295,
|
||
296, 297, 298, 299, 300, 0, 0, 0, 249, 197,
|
||
198, 199, 200, 201, 202, 203, 204, 205, 206, 207,
|
||
208, 0, 250, 0, 251, 252, 253, 63, 64, 0,
|
||
0, 0, 0, 0, 0, 0, 0, 0, 0, 1,
|
||
2, 0, 3, 4, 5, 244, 0, 0, 369, 0,
|
||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
245, 246, 0, 0, 0, 0, 0, 0, 63, 64,
|
||
0, 106, 66, 67, 68, 69, 70, 71, 72, 0,
|
||
1, 2, 0, 3, 4, 5, 0, 0, 0, 0,
|
||
0, 0, 0, 176, 177, 178, 179, 180, 181, 182,
|
||
183, 184, 185, 186, 187, 188, 189, 190, 247, 248,
|
||
73, 0, 63, 64, 0, 106, 66, 67, 68, 69,
|
||
70, 71, 72, 0, 1, 2, 0, 3, 4, 5,
|
||
0, 0, 0, 0, 0, 249, 197, 198, 199, 200,
|
||
201, 202, 203, 204, 205, 206, 207, 208, 0, 250,
|
||
0, 251, 252, 253, 73, 0, 0, 0, 360, 361,
|
||
0, 0, 0, 0, 362, 0, 0, 0, 110, 0,
|
||
111, 0, 254, 0, 0, 255, 0, 256, 0, 257,
|
||
363, 364, 365, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 0, 0, 366, 367, 0, 0, 0,
|
||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
74, 0, 368, 75, 0, 0, 76, 0, 77, 107,
|
||
0, 0, 0, 0, 0, 0, 0, 0, 176, 177,
|
||
178, 179, 180, 181, 182, 183, 184, 185, 186, 187,
|
||
188, 189, 190, 247, 248, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 0, 74, 0, 0, 75, 0, 0,
|
||
76, 0, 77, 140, 0, 0, 0, 0, 0, 0,
|
||
249, 197, 198, 199, 200, 201, 202, 203, 204, 205,
|
||
206, 207, 208, 0, 250, 0, 251, 252, 253, 63,
|
||
64, 0, 106, 152, 153, 154, 155, 156, 157, 72,
|
||
0, 1, 2, 0, 3, 4, 5, 0, 63, 64,
|
||
369, 106, 152, 153, 154, 155, 156, 157, 72, 0,
|
||
1, 2, 0, 3, 4, 5, 0, 0, 0, 63,
|
||
64, 73, 106, 66, 67, 68, 69, 70, 71, 72,
|
||
0, 1, 2, 0, 3, 4, 5, 0, 0, 0,
|
||
73, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 133, 0, 0, 0, 0, 0, 0, 0, 63,
|
||
64, 73, 147, 66, 67, 68, 69, 70, 71, 72,
|
||
0, 1, 2, 0, 3, 4, 5, 63, 64, 0,
|
||
106, 66, 67, 68, 69, 70, 71, 72, 0, 1,
|
||
2, 0, 3, 4, 5, 0, 0, 0, 0, 0,
|
||
0, 73, 0, 0, 0, 0, 0, 0, 0, 329,
|
||
0, 0, 0, 0, 0, 0, 0, 0, 0, 73,
|
||
0, 74, 0, 0, 75, 0, 0, 76, 0, 77,
|
||
351, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
74, 0, 0, 75, 0, 0, 76, 0, 77, 415,
|
||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 74, 0, 0, 75, 0, 0, 76, 0, 77,
|
||
0, 63, 64, 148, 106, 152, 153, 154, 155, 156,
|
||
157, 72, 0, 1, 2, 0, 3, 4, 5, 0,
|
||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 74, 0, 0, 75, 0, 0, 76, 0, 77,
|
||
0, 0, 0, 73, 0, 0, 0, 0, 0, 74,
|
||
0, 0, 75, 0, 0, 76, 0, 77, 63, 64,
|
||
0, 106, 66, 67, 68, 69, 70, 71, 72, 0,
|
||
1, 2, 0, 3, 4, 5, 63, 64, 0, 106,
|
||
66, 67, 68, 69, 70, 71, 72, 0, 1, 2,
|
||
427, 3, 4, 5, 0, 0, 0, 0, 0, 0,
|
||
73, 0, 0, 0, 0, 0, 0, 0, 512, 0,
|
||
0, 0, 0, 0, 0, 0, 63, 64, 73, 65,
|
||
66, 67, 68, 69, 70, 71, 72, 0, 1, 2,
|
||
0, 3, 4, 5, 0, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 74, 0, 0, 75, 0, 346, 76,
|
||
0, 77, 0, 0, 0, 0, 63, 64, 73, 106,
|
||
152, 153, 154, 155, 156, 157, 72, 0, 1, 2,
|
||
0, 3, 4, 5, 63, 64, 0, 147, 66, 67,
|
||
68, 69, 70, 71, 72, 0, 1, 2, 0, 3,
|
||
4, 5, 0, 0, 0, 0, 0, 0, 73, 0,
|
||
74, 0, 0, 75, 0, 0, 76, 0, 77, 0,
|
||
0, 0, 0, 0, 0, 0, 73, 0, 74, 0,
|
||
0, 75, 0, 0, 76, 0, 77, 63, 64, 0,
|
||
106, 66, 67, 68, 69, 70, 71, 72, 0, 1,
|
||
2, 0, 3, 4, 5, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 0, 0, 0, 0, 0, 74, 0,
|
||
0, 75, 0, 0, 76, 0, 77, 63, 64, 73,
|
||
266, 66, 67, 68, 69, 70, 71, 72, 0, 1,
|
||
2, 0, 3, 4, 5, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 0, 0, 0, 0, 0, 74, 0,
|
||
0, 75, 0, 0, 76, 0, 77, 0, 0, 73,
|
||
0, 0, 0, 0, 0, 0, 74, 0, 0, 75,
|
||
0, 0, 76, 0, 77, 63, 64, 0, 106, 152,
|
||
153, 154, 155, 156, 157, 72, 0, 1, 2, 0,
|
||
3, 4, 5, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 167, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 0, 0, 0, 0, 73, 0, 74,
|
||
168, 169, 75, 0, 0, 76, 0, 77, 0, 0,
|
||
0, 0, 170, 171, 172, 173, 174, 175, 176, 177,
|
||
178, 179, 180, 181, 182, 183, 184, 185, 186, 187,
|
||
188, 189, 190, 191, 192, 0, 0, 0, 0, 74,
|
||
0, 0, 75, 0, 0, 76, 0, 77, 0, 0,
|
||
0, 0, 0, 0, 0, 193, 194, 195, 0, 0,
|
||
196, 197, 198, 199, 200, 201, 202, 203, 204, 205,
|
||
206, 207, 208, 209, 210, 211, 212, 213, 214, 0,
|
||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 0, 0, 0, 0, 74, 0, 0,
|
||
75, 0, 0, 76, 0, 349
|
||
};
|
||
|
||
static const short yycheck[] =
|
||
{
|
||
0, 27, 172, 160, 428, 232, 126, 4, 0, 11,
|
||
150, 195, 303, 11, 21, 34, 28, 17, 336, 337,
|
||
160, 173, 29, 255, 256, 17, 210, 211, 212, 213,
|
||
214, 11, 11, 217, 53, 52, 564, 147, 34, 146,
|
||
0, 147, 3, 4, 5, 6, 147, 147, 158, 66,
|
||
578, 77, 158, 143, 144, 145, 156, 158, 18, 19,
|
||
20, 119, 22, 23, 24, 26, 27, 219, 147, 57,
|
||
30, 31, 147, 53, 53, 101, 148, 156, 150, 105,
|
||
38, 147, 146, 158, 156, 111, 147, 145, 154, 513,
|
||
116, 51, 92, 154, 54, 148, 18, 150, 58, 19,
|
||
126, 154, 22, 147, 24, 11, 146, 151, 426, 7,
|
||
8, 17, 138, 139, 147, 147, 142, 349, 151, 151,
|
||
146, 19, 20, 547, 22, 23, 24, 267, 19, 269,
|
||
270, 22, 272, 24, 318, 40, 41, 369, 134, 135,
|
||
136, 146, 47, 139, 170, 157, 147, 148, 53, 150,
|
||
0, 158, 154, 273, 22, 579, 154, 42, 43, 44,
|
||
157, 20, 47, 454, 23, 305, 152, 193, 194, 195,
|
||
196, 163, 146, 313, 314, 21, 134, 135, 136, 147,
|
||
148, 139, 150, 209, 210, 211, 212, 213, 214, 215,
|
||
216, 217, 483, 46, 485, 48, 316, 117, 118, 225,
|
||
148, 22, 150, 387, 152, 389, 390, 391, 35, 235,
|
||
37, 134, 135, 136, 134, 135, 139, 137, 138, 22,
|
||
140, 141, 142, 32, 33, 42, 43, 44, 45, 46,
|
||
47, 48, 148, 50, 150, 151, 22, 377, 378, 379,
|
||
531, 113, 114, 117, 118, 385, 150, 273, 475, 60,
|
||
61, 62, 63, 64, 65, 395, 396, 4, 284, 416,
|
||
134, 135, 4, 137, 138, 37, 140, 141, 142, 3,
|
||
4, 5, 6, 112, 113, 301, 416, 148, 153, 150,
|
||
151, 83, 84, 341, 342, 343, 344, 345, 153, 4,
|
||
316, 317, 318, 148, 22, 150, 354, 355, 356, 439,
|
||
147, 441, 486, 151, 444, 489, 490, 491, 151, 150,
|
||
450, 451, 90, 91, 92, 93, 94, 95, 96, 97,
|
||
98, 99, 549, 349, 156, 552, 143, 144, 145, 42,
|
||
9, 44, 9, 359, 9, 9, 9, 9, 478, 479,
|
||
11, 481, 482, 55, 156, 150, 150, 487, 406, 407,
|
||
150, 150, 150, 22, 150, 413, 150, 497, 150, 147,
|
||
150, 387, 388, 389, 390, 391, 147, 147, 394, 59,
|
||
0, 147, 269, 270, 147, 272, 546, 147, 518, 405,
|
||
147, 38, 38, 147, 150, 150, 526, 147, 18, 19,
|
||
20, 152, 22, 23, 24, 565, 147, 147, 147, 147,
|
||
30, 31, 460, 461, 462, 463, 147, 147, 305, 467,
|
||
468, 147, 156, 38, 147, 147, 313, 314, 22, 4,
|
||
147, 51, 562, 22, 54, 151, 17, 567, 58, 455,
|
||
17, 150, 4, 147, 150, 156, 147, 147, 147, 147,
|
||
147, 499, 500, 469, 584, 585, 147, 147, 474, 589,
|
||
147, 147, 592, 147, 480, 147, 53, 22, 147, 147,
|
||
486, 147, 17, 489, 490, 491, 151, 151, 494, 151,
|
||
151, 147, 152, 473, 53, 4, 534, 17, 536, 537,
|
||
377, 378, 379, 151, 154, 151, 151, 154, 385, 3,
|
||
4, 151, 147, 7, 8, 9, 17, 147, 395, 396,
|
||
17, 71, 17, 129, 247, 19, 20, 129, 22, 23,
|
||
24, 25, 26, 27, 129, 92, 541, 248, 111, 514,
|
||
225, 105, 548, 17, 56, 89, 40, 41, 494, 235,
|
||
408, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
||
-1, 541, 439, 57, 441, -1, -1, 444, -1, -1,
|
||
-1, -1, -1, 450, 451, -1, -1, -1, -1, 73,
|
||
74, 75, 76, 77, 78, 79, 80, 81, 82, 83,
|
||
84, 85, 86, 87, 88, 89, -1, -1, -1, -1,
|
||
-1, 478, 479, -1, 481, 482, -1, -1, -1, -1,
|
||
487, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
||
497, 115, 116, 117, 118, 119, 120, 121, 122, 123,
|
||
124, 125, 126, 127, -1, 129, -1, 131, 132, 133,
|
||
-1, 518, -1, -1, -1, -1, 3, 4, -1, 526,
|
||
7, 8, 9, -1, 148, -1, 150, -1, -1, -1,
|
||
-1, 155, 19, 20, -1, 22, 23, 24, 25, 26,
|
||
27, 26, 27, -1, -1, -1, -1, -1, -1, -1,
|
||
-1, -1, -1, 40, 41, 562, -1, -1, -1, -1,
|
||
567, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
||
57, -1, -1, -1, -1, -1, -1, 584, 585, -1,
|
||
-1, -1, 589, -1, -1, 592, 73, 74, 75, 76,
|
||
77, 78, 79, 80, 81, 82, 83, 84, 85, 86,
|
||
87, 88, 89, -1, -1, -1, -1, -1, -1, -1,
|
||
-1, 96, 97, 98, 99, 100, 101, 102, 103, 104,
|
||
105, 106, 107, 108, 109, -1, -1, -1, 115, 116,
|
||
117, 118, 119, 120, 121, 122, 123, 124, 125, 126,
|
||
127, -1, 129, -1, 131, 132, 133, 7, 8, -1,
|
||
-1, -1, -1, -1, -1, -1, -1, -1, -1, 19,
|
||
20, -1, 22, 23, 24, 25, -1, -1, 155, -1,
|
||
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
||
40, 41, -1, -1, -1, -1, -1, -1, 7, 8,
|
||
-1, 10, 11, 12, 13, 14, 15, 16, 17, -1,
|
||
19, 20, -1, 22, 23, 24, -1, -1, -1, -1,
|
||
-1, -1, -1, 73, 74, 75, 76, 77, 78, 79,
|
||
80, 81, 82, 83, 84, 85, 86, 87, 88, 89,
|
||
49, -1, 7, 8, -1, 10, 11, 12, 13, 14,
|
||
15, 16, 17, -1, 19, 20, -1, 22, 23, 24,
|
||
-1, -1, -1, -1, -1, 115, 116, 117, 118, 119,
|
||
120, 121, 122, 123, 124, 125, 126, 127, -1, 129,
|
||
-1, 131, 132, 133, 49, -1, -1, -1, 3, 4,
|
||
-1, -1, -1, -1, 9, -1, -1, -1, 148, -1,
|
||
150, -1, 152, -1, -1, 155, -1, 157, -1, 159,
|
||
25, 26, 27, -1, -1, -1, -1, -1, -1, -1,
|
||
-1, -1, -1, -1, -1, 40, 41, -1, -1, -1,
|
||
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
||
149, -1, 57, 152, -1, -1, 155, -1, 157, 158,
|
||
-1, -1, -1, -1, -1, -1, -1, -1, 73, 74,
|
||
75, 76, 77, 78, 79, 80, 81, 82, 83, 84,
|
||
85, 86, 87, 88, 89, -1, -1, -1, -1, -1,
|
||
-1, -1, -1, -1, 149, -1, -1, 152, -1, -1,
|
||
155, -1, 157, 158, -1, -1, -1, -1, -1, -1,
|
||
115, 116, 117, 118, 119, 120, 121, 122, 123, 124,
|
||
125, 126, 127, -1, 129, -1, 131, 132, 133, 7,
|
||
8, -1, 10, 11, 12, 13, 14, 15, 16, 17,
|
||
-1, 19, 20, -1, 22, 23, 24, -1, 7, 8,
|
||
155, 10, 11, 12, 13, 14, 15, 16, 17, -1,
|
||
19, 20, -1, 22, 23, 24, -1, -1, -1, 7,
|
||
8, 49, 10, 11, 12, 13, 14, 15, 16, 17,
|
||
-1, 19, 20, -1, 22, 23, 24, -1, -1, -1,
|
||
49, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
||
-1, 39, -1, -1, -1, -1, -1, -1, -1, 7,
|
||
8, 49, 10, 11, 12, 13, 14, 15, 16, 17,
|
||
-1, 19, 20, -1, 22, 23, 24, 7, 8, -1,
|
||
10, 11, 12, 13, 14, 15, 16, 17, -1, 19,
|
||
20, -1, 22, 23, 24, -1, -1, -1, -1, -1,
|
||
-1, 49, -1, -1, -1, -1, -1, -1, -1, 39,
|
||
-1, -1, -1, -1, -1, -1, -1, -1, -1, 49,
|
||
-1, 149, -1, -1, 152, -1, -1, 155, -1, 157,
|
||
158, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
||
149, -1, -1, 152, -1, -1, 155, -1, 157, 158,
|
||
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
||
-1, 149, -1, -1, 152, -1, -1, 155, -1, 157,
|
||
-1, 7, 8, 121, 10, 11, 12, 13, 14, 15,
|
||
16, 17, -1, 19, 20, -1, 22, 23, 24, -1,
|
||
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
||
-1, 149, -1, -1, 152, -1, -1, 155, -1, 157,
|
||
-1, -1, -1, 49, -1, -1, -1, -1, -1, 149,
|
||
-1, -1, 152, -1, -1, 155, -1, 157, 7, 8,
|
||
-1, 10, 11, 12, 13, 14, 15, 16, 17, -1,
|
||
19, 20, -1, 22, 23, 24, 7, 8, -1, 10,
|
||
11, 12, 13, 14, 15, 16, 17, -1, 19, 20,
|
||
39, 22, 23, 24, -1, -1, -1, -1, -1, -1,
|
||
49, -1, -1, -1, -1, -1, -1, -1, 39, -1,
|
||
-1, -1, -1, -1, -1, -1, 7, 8, 49, 10,
|
||
11, 12, 13, 14, 15, 16, 17, -1, 19, 20,
|
||
-1, 22, 23, 24, -1, -1, -1, -1, -1, -1,
|
||
-1, -1, -1, 149, -1, -1, 152, -1, 154, 155,
|
||
-1, 157, -1, -1, -1, -1, 7, 8, 49, 10,
|
||
11, 12, 13, 14, 15, 16, 17, -1, 19, 20,
|
||
-1, 22, 23, 24, 7, 8, -1, 10, 11, 12,
|
||
13, 14, 15, 16, 17, -1, 19, 20, -1, 22,
|
||
23, 24, -1, -1, -1, -1, -1, -1, 49, -1,
|
||
149, -1, -1, 152, -1, -1, 155, -1, 157, -1,
|
||
-1, -1, -1, -1, -1, -1, 49, -1, 149, -1,
|
||
-1, 152, -1, -1, 155, -1, 157, 7, 8, -1,
|
||
10, 11, 12, 13, 14, 15, 16, 17, -1, 19,
|
||
20, -1, 22, 23, 24, -1, -1, -1, -1, -1,
|
||
-1, -1, -1, -1, -1, -1, -1, -1, 149, -1,
|
||
-1, 152, -1, -1, 155, -1, 157, 7, 8, 49,
|
||
10, 11, 12, 13, 14, 15, 16, 17, -1, 19,
|
||
20, -1, 22, 23, 24, -1, -1, -1, -1, -1,
|
||
-1, -1, -1, -1, -1, -1, -1, -1, 149, -1,
|
||
-1, 152, -1, -1, 155, -1, 157, -1, -1, 49,
|
||
-1, -1, -1, -1, -1, -1, 149, -1, -1, 152,
|
||
-1, -1, 155, -1, 157, 7, 8, -1, 10, 11,
|
||
12, 13, 14, 15, 16, 17, -1, 19, 20, -1,
|
||
22, 23, 24, -1, -1, -1, -1, -1, -1, -1,
|
||
-1, 36, -1, -1, -1, -1, -1, -1, -1, -1,
|
||
-1, -1, -1, -1, -1, -1, -1, 49, -1, 149,
|
||
55, 56, 152, -1, -1, 155, -1, 157, -1, -1,
|
||
-1, -1, 67, 68, 69, 70, 71, 72, 73, 74,
|
||
75, 76, 77, 78, 79, 80, 81, 82, 83, 84,
|
||
85, 86, 87, 88, 89, -1, -1, -1, -1, 149,
|
||
-1, -1, 152, -1, -1, 155, -1, 157, -1, -1,
|
||
-1, -1, -1, -1, -1, 110, 111, 112, -1, -1,
|
||
115, 116, 117, 118, 119, 120, 121, 122, 123, 124,
|
||
125, 126, 127, 128, 129, 130, 131, 132, 133, -1,
|
||
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
||
-1, -1, -1, -1, -1, -1, -1, 149, -1, -1,
|
||
152, -1, -1, 155, -1, 157
|
||
};
|
||
|
||
/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
|
||
symbol of state STATE-NUM. */
|
||
static const unsigned char yystos[] =
|
||
{
|
||
0, 19, 20, 22, 23, 24, 30, 31, 51, 54,
|
||
58, 168, 170, 171, 172, 173, 204, 205, 206, 208,
|
||
207, 52, 66, 213, 146, 57, 146, 18, 146, 42,
|
||
43, 44, 45, 46, 47, 48, 50, 143, 144, 145,
|
||
174, 175, 176, 0, 206, 46, 48, 177, 223, 42,
|
||
43, 44, 47, 178, 220, 222, 229, 146, 146, 152,
|
||
214, 22, 212, 7, 8, 10, 11, 12, 13, 14,
|
||
15, 16, 17, 49, 149, 152, 155, 157, 168, 171,
|
||
191, 192, 226, 176, 176, 35, 37, 202, 176, 176,
|
||
21, 230, 231, 29, 158, 221, 230, 22, 22, 22,
|
||
215, 150, 4, 4, 4, 157, 10, 158, 192, 197,
|
||
148, 150, 202, 202, 42, 44, 179, 32, 33, 201,
|
||
60, 61, 62, 63, 64, 65, 180, 218, 218, 170,
|
||
234, 147, 154, 39, 192, 193, 195, 196, 153, 153,
|
||
158, 197, 147, 158, 196, 201, 201, 10, 121, 192,
|
||
194, 203, 11, 12, 13, 14, 15, 16, 166, 167,
|
||
192, 198, 4, 194, 28, 157, 219, 36, 55, 56,
|
||
67, 68, 69, 70, 71, 72, 73, 74, 75, 76,
|
||
77, 78, 79, 80, 81, 82, 83, 84, 85, 86,
|
||
87, 88, 89, 110, 111, 112, 115, 116, 117, 118,
|
||
119, 120, 121, 122, 123, 124, 125, 126, 127, 128,
|
||
129, 130, 131, 132, 133, 161, 162, 163, 232, 238,
|
||
239, 240, 241, 22, 182, 147, 151, 192, 192, 156,
|
||
158, 192, 151, 198, 192, 150, 226, 26, 27, 3,
|
||
4, 5, 6, 9, 25, 40, 41, 88, 89, 115,
|
||
129, 131, 132, 133, 152, 155, 157, 159, 161, 162,
|
||
163, 199, 226, 209, 171, 55, 10, 192, 228, 11,
|
||
17, 11, 166, 180, 90, 91, 92, 93, 94, 95,
|
||
96, 97, 98, 99, 164, 26, 27, 96, 97, 98,
|
||
99, 100, 101, 102, 103, 104, 105, 106, 107, 108,
|
||
109, 165, 192, 192, 228, 192, 192, 235, 228, 228,
|
||
228, 228, 228, 192, 192, 228, 180, 113, 114, 117,
|
||
118, 134, 135, 137, 138, 140, 141, 142, 181, 39,
|
||
193, 184, 154, 156, 156, 184, 210, 211, 203, 164,
|
||
165, 150, 150, 150, 150, 150, 154, 198, 200, 157,
|
||
200, 158, 200, 22, 150, 150, 150, 147, 189, 150,
|
||
3, 4, 9, 25, 26, 27, 40, 41, 57, 155,
|
||
199, 225, 226, 227, 227, 227, 227, 194, 192, 192,
|
||
147, 186, 147, 186, 227, 152, 147, 147, 147, 147,
|
||
147, 147, 227, 227, 38, 194, 192, 228, 134, 135,
|
||
136, 139, 183, 189, 189, 38, 150, 150, 198, 198,
|
||
198, 198, 198, 147, 154, 158, 192, 200, 156, 158,
|
||
198, 198, 198, 34, 53, 187, 190, 39, 192, 216,
|
||
217, 59, 224, 200, 147, 147, 227, 227, 227, 11,
|
||
53, 11, 237, 227, 152, 228, 192, 228, 228, 228,
|
||
147, 147, 192, 227, 227, 147, 192, 198, 198, 237,
|
||
147, 147, 147, 147, 198, 156, 158, 147, 147, 38,
|
||
22, 4, 189, 182, 147, 151, 22, 156, 17, 17,
|
||
150, 147, 147, 227, 4, 227, 147, 147, 227, 147,
|
||
147, 147, 227, 227, 150, 147, 186, 192, 151, 147,
|
||
147, 151, 198, 198, 198, 198, 156, 198, 198, 192,
|
||
168, 169, 39, 192, 184, 147, 227, 227, 192, 236,
|
||
227, 227, 186, 186, 228, 227, 147, 228, 228, 228,
|
||
236, 227, 198, 198, 147, 151, 147, 147, 151, 151,
|
||
151, 182, 187, 188, 22, 147, 152, 227, 147, 151,
|
||
154, 227, 151, 186, 151, 151, 198, 198, 198, 169,
|
||
53, 185, 17, 154, 166, 233, 182, 192, 184, 154,
|
||
184, 151, 151, 151, 4, 227, 225, 154, 166, 227,
|
||
38, 147, 225, 182, 17, 17, 147, 227, 227, 17,
|
||
71, 227, 17, 227
|
||
};
|
||
|
||
#if ! defined (YYSIZE_T) && defined (__SIZE_TYPE__)
|
||
# define YYSIZE_T __SIZE_TYPE__
|
||
#endif
|
||
#if ! defined (YYSIZE_T) && defined (size_t)
|
||
# define YYSIZE_T size_t
|
||
#endif
|
||
#if ! defined (YYSIZE_T)
|
||
# if defined (__STDC__) || defined (__cplusplus)
|
||
# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
|
||
# define YYSIZE_T size_t
|
||
# endif
|
||
#endif
|
||
#if ! defined (YYSIZE_T)
|
||
# define YYSIZE_T unsigned int
|
||
#endif
|
||
|
||
#define yyerrok (yyerrstatus = 0)
|
||
#define yyclearin (yychar = YYEMPTY)
|
||
#define YYEMPTY (-2)
|
||
#define YYEOF 0
|
||
|
||
#define YYACCEPT goto yyacceptlab
|
||
#define YYABORT goto yyabortlab
|
||
#define YYERROR goto yyerrorlab
|
||
|
||
|
||
/* Like YYERROR except do call yyerror. This remains here temporarily
|
||
to ease the transition to the new meaning of YYERROR, for GCC.
|
||
Once GCC version 2 has supplanted version 1, this can go. */
|
||
|
||
#define YYFAIL goto yyerrlab
|
||
|
||
#define YYRECOVERING() (!!yyerrstatus)
|
||
|
||
#define YYBACKUP(Token, Value) \
|
||
do \
|
||
if (yychar == YYEMPTY && yylen == 1) \
|
||
{ \
|
||
yychar = (Token); \
|
||
yylval = (Value); \
|
||
yytoken = YYTRANSLATE (yychar); \
|
||
YYPOPSTACK; \
|
||
goto yybackup; \
|
||
} \
|
||
else \
|
||
{ \
|
||
yyerror ("syntax error: cannot back up");\
|
||
YYERROR; \
|
||
} \
|
||
while (0)
|
||
|
||
#define YYTERROR 1
|
||
#define YYERRCODE 256
|
||
|
||
/* YYLLOC_DEFAULT -- Compute the default location (before the actions
|
||
are run). */
|
||
|
||
#ifndef YYLLOC_DEFAULT
|
||
# define YYLLOC_DEFAULT(Current, Rhs, N) \
|
||
((Current).first_line = (Rhs)[1].first_line, \
|
||
(Current).first_column = (Rhs)[1].first_column, \
|
||
(Current).last_line = (Rhs)[N].last_line, \
|
||
(Current).last_column = (Rhs)[N].last_column)
|
||
#endif
|
||
|
||
/* YYLEX -- calling `yylex' with the right arguments. */
|
||
|
||
#ifdef YYLEX_PARAM
|
||
# define YYLEX yylex (YYLEX_PARAM)
|
||
#else
|
||
# define YYLEX yylex ()
|
||
#endif
|
||
|
||
/* Enable debugging if requested. */
|
||
#if YYDEBUG
|
||
|
||
# ifndef YYFPRINTF
|
||
# include <stdio.h> /* INFRINGES ON USER NAME SPACE */
|
||
# define YYFPRINTF fprintf
|
||
# endif
|
||
|
||
# define YYDPRINTF(Args) \
|
||
do { \
|
||
if (yydebug) \
|
||
YYFPRINTF Args; \
|
||
} while (0)
|
||
|
||
# define YYDSYMPRINT(Args) \
|
||
do { \
|
||
if (yydebug) \
|
||
yysymprint Args; \
|
||
} while (0)
|
||
|
||
# define YYDSYMPRINTF(Title, Token, Value, Location) \
|
||
do { \
|
||
if (yydebug) \
|
||
{ \
|
||
YYFPRINTF (stderr, "%s ", Title); \
|
||
yysymprint (stderr, \
|
||
Token, Value); \
|
||
YYFPRINTF (stderr, "\n"); \
|
||
} \
|
||
} while (0)
|
||
|
||
/*------------------------------------------------------------------.
|
||
| yy_stack_print -- Print the state stack from its BOTTOM up to its |
|
||
| TOP (included). |
|
||
`------------------------------------------------------------------*/
|
||
|
||
#if defined (__STDC__) || defined (__cplusplus)
|
||
static void
|
||
yy_stack_print (short *bottom, short *top)
|
||
#else
|
||
static void
|
||
yy_stack_print (bottom, top)
|
||
short *bottom;
|
||
short *top;
|
||
#endif
|
||
{
|
||
YYFPRINTF (stderr, "Stack now");
|
||
for (/* Nothing. */; bottom <= top; ++bottom)
|
||
YYFPRINTF (stderr, " %d", *bottom);
|
||
YYFPRINTF (stderr, "\n");
|
||
}
|
||
|
||
# define YY_STACK_PRINT(Bottom, Top) \
|
||
do { \
|
||
if (yydebug) \
|
||
yy_stack_print ((Bottom), (Top)); \
|
||
} while (0)
|
||
|
||
|
||
/*------------------------------------------------.
|
||
| Report that the YYRULE is going to be reduced. |
|
||
`------------------------------------------------*/
|
||
|
||
#if defined (__STDC__) || defined (__cplusplus)
|
||
static void
|
||
yy_reduce_print (int yyrule)
|
||
#else
|
||
static void
|
||
yy_reduce_print (yyrule)
|
||
int yyrule;
|
||
#endif
|
||
{
|
||
int yyi;
|
||
unsigned int yylno = yyrline[yyrule];
|
||
YYFPRINTF (stderr, "Reducing stack by rule %d (line %u), ",
|
||
yyrule - 1, yylno);
|
||
/* Print the symbols being reduced, and their result. */
|
||
for (yyi = yyprhs[yyrule]; 0 <= yyrhs[yyi]; yyi++)
|
||
YYFPRINTF (stderr, "%s ", yytname [yyrhs[yyi]]);
|
||
YYFPRINTF (stderr, "-> %s\n", yytname [yyr1[yyrule]]);
|
||
}
|
||
|
||
# define YY_REDUCE_PRINT(Rule) \
|
||
do { \
|
||
if (yydebug) \
|
||
yy_reduce_print (Rule); \
|
||
} while (0)
|
||
|
||
/* Nonzero means print parse trace. It is left uninitialized so that
|
||
multiple parsers can coexist. */
|
||
int yydebug;
|
||
#else /* !YYDEBUG */
|
||
# define YYDPRINTF(Args)
|
||
# define YYDSYMPRINT(Args)
|
||
# define YYDSYMPRINTF(Title, Token, Value, Location)
|
||
# define YY_STACK_PRINT(Bottom, Top)
|
||
# define YY_REDUCE_PRINT(Rule)
|
||
#endif /* !YYDEBUG */
|
||
|
||
|
||
/* YYINITDEPTH -- initial size of the parser's stacks. */
|
||
#ifndef YYINITDEPTH
|
||
# define YYINITDEPTH 200
|
||
#endif
|
||
|
||
/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
|
||
if the built-in stack extension method is used).
|
||
|
||
Do not make this value too large; the results are undefined if
|
||
SIZE_MAX < YYSTACK_BYTES (YYMAXDEPTH)
|
||
evaluated with infinite-precision integer arithmetic. */
|
||
|
||
#if defined (YYMAXDEPTH) && YYMAXDEPTH == 0
|
||
# undef YYMAXDEPTH
|
||
#endif
|
||
|
||
#ifndef YYMAXDEPTH
|
||
# define YYMAXDEPTH 10000
|
||
#endif
|
||
|
||
|
||
|
||
#if YYERROR_VERBOSE
|
||
|
||
# ifndef yystrlen
|
||
# if defined (__GLIBC__) && defined (_STRING_H)
|
||
# define yystrlen strlen
|
||
# else
|
||
/* Return the length of YYSTR. */
|
||
static YYSIZE_T
|
||
# if defined (__STDC__) || defined (__cplusplus)
|
||
yystrlen (const char *yystr)
|
||
# else
|
||
yystrlen (yystr)
|
||
const char *yystr;
|
||
# endif
|
||
{
|
||
register const char *yys = yystr;
|
||
|
||
while (*yys++ != '\0')
|
||
continue;
|
||
|
||
return yys - yystr - 1;
|
||
}
|
||
# endif
|
||
# endif
|
||
|
||
# ifndef yystpcpy
|
||
# if defined (__GLIBC__) && defined (_STRING_H) && defined (_GNU_SOURCE)
|
||
# define yystpcpy stpcpy
|
||
# else
|
||
/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in
|
||
YYDEST. */
|
||
static char *
|
||
# if defined (__STDC__) || defined (__cplusplus)
|
||
yystpcpy (char *yydest, const char *yysrc)
|
||
# else
|
||
yystpcpy (yydest, yysrc)
|
||
char *yydest;
|
||
const char *yysrc;
|
||
# endif
|
||
{
|
||
register char *yyd = yydest;
|
||
register const char *yys = yysrc;
|
||
|
||
while ((*yyd++ = *yys++) != '\0')
|
||
continue;
|
||
|
||
return yyd - 1;
|
||
}
|
||
# endif
|
||
# endif
|
||
|
||
#endif /* !YYERROR_VERBOSE */
|
||
|
||
|
||
|
||
#if YYDEBUG
|
||
/*--------------------------------.
|
||
| Print this symbol on YYOUTPUT. |
|
||
`--------------------------------*/
|
||
|
||
#if defined (__STDC__) || defined (__cplusplus)
|
||
static void
|
||
yysymprint (FILE *yyoutput, int yytype, YYSTYPE *yyvaluep)
|
||
#else
|
||
static void
|
||
yysymprint (yyoutput, yytype, yyvaluep)
|
||
FILE *yyoutput;
|
||
int yytype;
|
||
YYSTYPE *yyvaluep;
|
||
#endif
|
||
{
|
||
/* Pacify ``unused variable'' warnings. */
|
||
(void) yyvaluep;
|
||
|
||
if (yytype < YYNTOKENS)
|
||
{
|
||
YYFPRINTF (yyoutput, "token %s (", yytname[yytype]);
|
||
# ifdef YYPRINT
|
||
YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep);
|
||
# endif
|
||
}
|
||
else
|
||
YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]);
|
||
|
||
switch (yytype)
|
||
{
|
||
default:
|
||
break;
|
||
}
|
||
YYFPRINTF (yyoutput, ")");
|
||
}
|
||
|
||
#endif /* ! YYDEBUG */
|
||
/*-----------------------------------------------.
|
||
| Release the memory associated to this symbol. |
|
||
`-----------------------------------------------*/
|
||
|
||
#if defined (__STDC__) || defined (__cplusplus)
|
||
static void
|
||
yydestruct (int yytype, YYSTYPE *yyvaluep)
|
||
#else
|
||
static void
|
||
yydestruct (yytype, yyvaluep)
|
||
int yytype;
|
||
YYSTYPE *yyvaluep;
|
||
#endif
|
||
{
|
||
/* Pacify ``unused variable'' warnings. */
|
||
(void) yyvaluep;
|
||
|
||
switch (yytype)
|
||
{
|
||
|
||
default:
|
||
break;
|
||
}
|
||
}
|
||
|
||
|
||
/* Prevent warnings from -Wmissing-prototypes. */
|
||
|
||
#ifdef YYPARSE_PARAM
|
||
# if defined (__STDC__) || defined (__cplusplus)
|
||
int yyparse (void *YYPARSE_PARAM);
|
||
# else
|
||
int yyparse ();
|
||
# endif
|
||
#else /* ! YYPARSE_PARAM */
|
||
#if defined (__STDC__) || defined (__cplusplus)
|
||
int yyparse (void);
|
||
#else
|
||
int yyparse ();
|
||
#endif
|
||
#endif /* ! YYPARSE_PARAM */
|
||
|
||
|
||
|
||
/* The lookahead symbol. */
|
||
int yychar;
|
||
|
||
/* The semantic value of the lookahead symbol. */
|
||
YYSTYPE yylval;
|
||
|
||
/* Number of syntax errors so far. */
|
||
int yynerrs;
|
||
|
||
|
||
|
||
/*----------.
|
||
| yyparse. |
|
||
`----------*/
|
||
|
||
#ifdef YYPARSE_PARAM
|
||
# if defined (__STDC__) || defined (__cplusplus)
|
||
int yyparse (void *YYPARSE_PARAM)
|
||
# else
|
||
int yyparse (YYPARSE_PARAM)
|
||
void *YYPARSE_PARAM;
|
||
# endif
|
||
#else /* ! YYPARSE_PARAM */
|
||
#if defined (__STDC__) || defined (__cplusplus)
|
||
int
|
||
yyparse (void)
|
||
#else
|
||
int
|
||
yyparse ()
|
||
|
||
#endif
|
||
#endif
|
||
{
|
||
|
||
register int yystate;
|
||
register int yyn;
|
||
int yyresult;
|
||
/* Number of tokens to shift before error messages enabled. */
|
||
int yyerrstatus;
|
||
/* Lookahead token as an internal (translated) token number. */
|
||
int yytoken = 0;
|
||
|
||
/* Three stacks and their tools:
|
||
`yyss': related to states,
|
||
`yyvs': related to semantic values,
|
||
`yyls': related to locations.
|
||
|
||
Refer to the stacks thru separate pointers, to allow yyoverflow
|
||
to reallocate them elsewhere. */
|
||
|
||
/* The state stack. */
|
||
short 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 (yyss + yystacksize - 1 <= yyssp)
|
||
{
|
||
/* Get the current used size of the three stacks, in elements. */
|
||
YYSIZE_T yysize = yyssp - yyss + 1;
|
||
|
||
#ifdef yyoverflow
|
||
{
|
||
/* Give user a chance to reallocate the stack. Use copies of
|
||
these so that the &'s don't force the real ones into
|
||
memory. */
|
||
YYSTYPE *yyvs1 = yyvs;
|
||
short *yyss1 = yyss;
|
||
|
||
|
||
/* Each stack pointer address is followed by the size of the
|
||
data in use in that stack, in bytes. This used to be a
|
||
conditional around just the two extra args, but that might
|
||
be undefined if yyoverflow is a macro. */
|
||
yyoverflow ("parser stack overflow",
|
||
&yyss1, yysize * sizeof (*yyssp),
|
||
&yyvs1, yysize * sizeof (*yyvsp),
|
||
|
||
&yystacksize);
|
||
|
||
yyss = yyss1;
|
||
yyvs = yyvs1;
|
||
}
|
||
#else /* no yyoverflow */
|
||
# ifndef YYSTACK_RELOCATE
|
||
goto yyoverflowlab;
|
||
# else
|
||
/* Extend the stack our own way. */
|
||
if (YYMAXDEPTH <= yystacksize)
|
||
goto yyoverflowlab;
|
||
yystacksize *= 2;
|
||
if (YYMAXDEPTH < yystacksize)
|
||
yystacksize = YYMAXDEPTH;
|
||
|
||
{
|
||
short *yyss1 = yyss;
|
||
union yyalloc *yyptr =
|
||
(union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
|
||
if (! yyptr)
|
||
goto yyoverflowlab;
|
||
YYSTACK_RELOCATE (yyss);
|
||
YYSTACK_RELOCATE (yyvs);
|
||
|
||
# undef YYSTACK_RELOCATE
|
||
if (yyss1 != yyssa)
|
||
YYSTACK_FREE (yyss1);
|
||
}
|
||
# endif
|
||
#endif /* no yyoverflow */
|
||
|
||
yyssp = yyss + yysize - 1;
|
||
yyvsp = yyvs + yysize - 1;
|
||
|
||
|
||
YYDPRINTF ((stderr, "Stack size increased to %lu\n",
|
||
(unsigned long int) yystacksize));
|
||
|
||
if (yyss + yystacksize - 1 <= yyssp)
|
||
YYABORT;
|
||
}
|
||
|
||
YYDPRINTF ((stderr, "Entering state %d\n", yystate));
|
||
|
||
goto yybackup;
|
||
|
||
/*-----------.
|
||
| yybackup. |
|
||
`-----------*/
|
||
yybackup:
|
||
|
||
/* Do appropriate processing given the current state. */
|
||
/* Read a lookahead token if we need one and don't already have one. */
|
||
/* yyresume: */
|
||
|
||
/* First try to decide what to do without reference to lookahead token. */
|
||
|
||
yyn = yypact[yystate];
|
||
if (yyn == YYPACT_NINF)
|
||
goto yydefault;
|
||
|
||
/* Not known => get a lookahead token if don't already have one. */
|
||
|
||
/* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol. */
|
||
if (yychar == YYEMPTY)
|
||
{
|
||
YYDPRINTF ((stderr, "Reading a token: "));
|
||
yychar = YYLEX;
|
||
}
|
||
|
||
if (yychar <= YYEOF)
|
||
{
|
||
yychar = yytoken = YYEOF;
|
||
YYDPRINTF ((stderr, "Now at end of input.\n"));
|
||
}
|
||
else
|
||
{
|
||
yytoken = YYTRANSLATE (yychar);
|
||
YYDSYMPRINTF ("Next token is", yytoken, &yylval, &yylloc);
|
||
}
|
||
|
||
/* If the proper action on seeing token YYTOKEN is to reduce or to
|
||
detect an error, take that action. */
|
||
yyn += yytoken;
|
||
if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken)
|
||
goto yydefault;
|
||
yyn = yytable[yyn];
|
||
if (yyn <= 0)
|
||
{
|
||
if (yyn == 0 || yyn == YYTABLE_NINF)
|
||
goto yyerrlab;
|
||
yyn = -yyn;
|
||
goto yyreduce;
|
||
}
|
||
|
||
if (yyn == YYFINAL)
|
||
YYACCEPT;
|
||
|
||
/* Shift the lookahead token. */
|
||
YYDPRINTF ((stderr, "Shifting token %s, ", yytname[yytoken]));
|
||
|
||
/* Discard the token being shifted unless it is eof. */
|
||
if (yychar != YYEOF)
|
||
yychar = YYEMPTY;
|
||
|
||
*++yyvsp = yylval;
|
||
|
||
|
||
/* Count tokens shifted since error; after three, turn off error
|
||
status. */
|
||
if (yyerrstatus)
|
||
yyerrstatus--;
|
||
|
||
yystate = yyn;
|
||
goto yynewstate;
|
||
|
||
|
||
/*-----------------------------------------------------------.
|
||
| yydefault -- do the default action for the current state. |
|
||
`-----------------------------------------------------------*/
|
||
yydefault:
|
||
yyn = yydefact[yystate];
|
||
if (yyn == 0)
|
||
goto yyerrlab;
|
||
goto yyreduce;
|
||
|
||
|
||
/*-----------------------------.
|
||
| yyreduce -- Do a reduction. |
|
||
`-----------------------------*/
|
||
yyreduce:
|
||
/* yyn is the number of a rule to reduce with. */
|
||
yylen = yyr2[yyn];
|
||
|
||
/* If YYLEN is nonzero, implement the default value of the action:
|
||
`$$ = $1'.
|
||
|
||
Otherwise, the following line sets YYVAL to garbage.
|
||
This behavior is undocumented and Bison
|
||
users should not rely upon it. Assigning to YYVAL
|
||
unconditionally makes the parser a bit smaller, and it avoids a
|
||
GCC warning that YYVAL may be used uninitialized. */
|
||
yyval = yyvsp[1-yylen];
|
||
|
||
|
||
YY_REDUCE_PRINT (yyn);
|
||
switch (yyn)
|
||
{
|
||
case 29:
|
||
#line 1128 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.IPredicate = ICmpInst::ICMP_EQ; ;}
|
||
break;
|
||
|
||
case 30:
|
||
#line 1128 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.IPredicate = ICmpInst::ICMP_NE; ;}
|
||
break;
|
||
|
||
case 31:
|
||
#line 1129 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.IPredicate = ICmpInst::ICMP_SLT; ;}
|
||
break;
|
||
|
||
case 32:
|
||
#line 1129 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.IPredicate = ICmpInst::ICMP_SGT; ;}
|
||
break;
|
||
|
||
case 33:
|
||
#line 1130 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.IPredicate = ICmpInst::ICMP_SLE; ;}
|
||
break;
|
||
|
||
case 34:
|
||
#line 1130 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.IPredicate = ICmpInst::ICMP_SGE; ;}
|
||
break;
|
||
|
||
case 35:
|
||
#line 1131 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.IPredicate = ICmpInst::ICMP_ULT; ;}
|
||
break;
|
||
|
||
case 36:
|
||
#line 1131 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.IPredicate = ICmpInst::ICMP_UGT; ;}
|
||
break;
|
||
|
||
case 37:
|
||
#line 1132 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.IPredicate = ICmpInst::ICMP_ULE; ;}
|
||
break;
|
||
|
||
case 38:
|
||
#line 1132 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.IPredicate = ICmpInst::ICMP_UGE; ;}
|
||
break;
|
||
|
||
case 39:
|
||
#line 1136 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.FPredicate = FCmpInst::FCMP_OEQ; ;}
|
||
break;
|
||
|
||
case 40:
|
||
#line 1136 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.FPredicate = FCmpInst::FCMP_ONE; ;}
|
||
break;
|
||
|
||
case 41:
|
||
#line 1137 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.FPredicate = FCmpInst::FCMP_OLT; ;}
|
||
break;
|
||
|
||
case 42:
|
||
#line 1137 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.FPredicate = FCmpInst::FCMP_OGT; ;}
|
||
break;
|
||
|
||
case 43:
|
||
#line 1138 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.FPredicate = FCmpInst::FCMP_OLE; ;}
|
||
break;
|
||
|
||
case 44:
|
||
#line 1138 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.FPredicate = FCmpInst::FCMP_OGE; ;}
|
||
break;
|
||
|
||
case 45:
|
||
#line 1139 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.FPredicate = FCmpInst::FCMP_ORD; ;}
|
||
break;
|
||
|
||
case 46:
|
||
#line 1139 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.FPredicate = FCmpInst::FCMP_UNO; ;}
|
||
break;
|
||
|
||
case 47:
|
||
#line 1140 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.FPredicate = FCmpInst::FCMP_UEQ; ;}
|
||
break;
|
||
|
||
case 48:
|
||
#line 1140 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.FPredicate = FCmpInst::FCMP_UNE; ;}
|
||
break;
|
||
|
||
case 49:
|
||
#line 1141 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.FPredicate = FCmpInst::FCMP_ULT; ;}
|
||
break;
|
||
|
||
case 50:
|
||
#line 1141 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.FPredicate = FCmpInst::FCMP_UGT; ;}
|
||
break;
|
||
|
||
case 51:
|
||
#line 1142 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.FPredicate = FCmpInst::FCMP_ULE; ;}
|
||
break;
|
||
|
||
case 52:
|
||
#line 1142 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.FPredicate = FCmpInst::FCMP_UGE; ;}
|
||
break;
|
||
|
||
case 53:
|
||
#line 1143 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.FPredicate = FCmpInst::FCMP_TRUE; ;}
|
||
break;
|
||
|
||
case 54:
|
||
#line 1144 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.FPredicate = FCmpInst::FCMP_FALSE; ;}
|
||
break;
|
||
|
||
case 65:
|
||
#line 1153 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.StrVal = 0; ;}
|
||
break;
|
||
|
||
case 66:
|
||
#line 1157 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.StrVal = yyvsp[-1].StrVal;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 67:
|
||
#line 1161 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.StrVal = 0;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 71:
|
||
#line 1169 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.StrVal = 0;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 72:
|
||
#line 1174 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.StrVal = yyvsp[-1].StrVal;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 73:
|
||
#line 1180 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Linkage = GlobalValue::InternalLinkage; ;}
|
||
break;
|
||
|
||
case 74:
|
||
#line 1181 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Linkage = GlobalValue::WeakLinkage; ;}
|
||
break;
|
||
|
||
case 75:
|
||
#line 1182 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Linkage = GlobalValue::LinkOnceLinkage; ;}
|
||
break;
|
||
|
||
case 76:
|
||
#line 1183 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Linkage = GlobalValue::AppendingLinkage; ;}
|
||
break;
|
||
|
||
case 77:
|
||
#line 1184 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Linkage = GlobalValue::DLLExportLinkage; ;}
|
||
break;
|
||
|
||
case 78:
|
||
#line 1188 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Linkage = GlobalValue::DLLImportLinkage; ;}
|
||
break;
|
||
|
||
case 79:
|
||
#line 1189 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Linkage = GlobalValue::ExternalWeakLinkage; ;}
|
||
break;
|
||
|
||
case 80:
|
||
#line 1190 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Linkage = GlobalValue::ExternalLinkage; ;}
|
||
break;
|
||
|
||
case 81:
|
||
#line 1194 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Visibility = GlobalValue::DefaultVisibility; ;}
|
||
break;
|
||
|
||
case 82:
|
||
#line 1195 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Visibility = GlobalValue::DefaultVisibility; ;}
|
||
break;
|
||
|
||
case 83:
|
||
#line 1196 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Visibility = GlobalValue::HiddenVisibility; ;}
|
||
break;
|
||
|
||
case 84:
|
||
#line 1197 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Visibility = GlobalValue::ProtectedVisibility; ;}
|
||
break;
|
||
|
||
case 85:
|
||
#line 1201 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Linkage = GlobalValue::ExternalLinkage; ;}
|
||
break;
|
||
|
||
case 86:
|
||
#line 1202 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Linkage = GlobalValue::DLLImportLinkage; ;}
|
||
break;
|
||
|
||
case 87:
|
||
#line 1203 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Linkage = GlobalValue::ExternalWeakLinkage; ;}
|
||
break;
|
||
|
||
case 88:
|
||
#line 1207 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Linkage = GlobalValue::ExternalLinkage; ;}
|
||
break;
|
||
|
||
case 89:
|
||
#line 1208 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Linkage = GlobalValue::InternalLinkage; ;}
|
||
break;
|
||
|
||
case 90:
|
||
#line 1209 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Linkage = GlobalValue::LinkOnceLinkage; ;}
|
||
break;
|
||
|
||
case 91:
|
||
#line 1210 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Linkage = GlobalValue::WeakLinkage; ;}
|
||
break;
|
||
|
||
case 92:
|
||
#line 1211 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Linkage = GlobalValue::DLLExportLinkage; ;}
|
||
break;
|
||
|
||
case 93:
|
||
#line 1215 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Linkage = GlobalValue::ExternalLinkage; ;}
|
||
break;
|
||
|
||
case 94:
|
||
#line 1216 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Linkage = GlobalValue::WeakLinkage; ;}
|
||
break;
|
||
|
||
case 95:
|
||
#line 1217 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Linkage = GlobalValue::InternalLinkage; ;}
|
||
break;
|
||
|
||
case 96:
|
||
#line 1220 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.UIntVal = CallingConv::C; ;}
|
||
break;
|
||
|
||
case 97:
|
||
#line 1221 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.UIntVal = CallingConv::C; ;}
|
||
break;
|
||
|
||
case 98:
|
||
#line 1222 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.UIntVal = CallingConv::Fast; ;}
|
||
break;
|
||
|
||
case 99:
|
||
#line 1223 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.UIntVal = CallingConv::Cold; ;}
|
||
break;
|
||
|
||
case 100:
|
||
#line 1224 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.UIntVal = CallingConv::X86_StdCall; ;}
|
||
break;
|
||
|
||
case 101:
|
||
#line 1225 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.UIntVal = CallingConv::X86_FastCall; ;}
|
||
break;
|
||
|
||
case 102:
|
||
#line 1226 "/users/dag/projects/cascade/llvm.modified/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 103:
|
||
#line 1233 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.ParamAttrs = ParamAttr::ZExt; ;}
|
||
break;
|
||
|
||
case 104:
|
||
#line 1234 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.ParamAttrs = ParamAttr::ZExt; ;}
|
||
break;
|
||
|
||
case 105:
|
||
#line 1235 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.ParamAttrs = ParamAttr::SExt; ;}
|
||
break;
|
||
|
||
case 106:
|
||
#line 1236 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.ParamAttrs = ParamAttr::SExt; ;}
|
||
break;
|
||
|
||
case 107:
|
||
#line 1237 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.ParamAttrs = ParamAttr::InReg; ;}
|
||
break;
|
||
|
||
case 108:
|
||
#line 1238 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.ParamAttrs = ParamAttr::StructRet; ;}
|
||
break;
|
||
|
||
case 109:
|
||
#line 1239 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.ParamAttrs = ParamAttr::NoAlias; ;}
|
||
break;
|
||
|
||
case 110:
|
||
#line 1240 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.ParamAttrs = ParamAttr::ByVal; ;}
|
||
break;
|
||
|
||
case 111:
|
||
#line 1241 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.ParamAttrs = ParamAttr::Nest; ;}
|
||
break;
|
||
|
||
case 112:
|
||
#line 1244 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.ParamAttrs = ParamAttr::None; ;}
|
||
break;
|
||
|
||
case 113:
|
||
#line 1245 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.ParamAttrs = yyvsp[-1].ParamAttrs | yyvsp[0].ParamAttrs;
|
||
;}
|
||
break;
|
||
|
||
case 114:
|
||
#line 1250 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.ParamAttrs = ParamAttr::NoReturn; ;}
|
||
break;
|
||
|
||
case 115:
|
||
#line 1251 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.ParamAttrs = ParamAttr::NoUnwind; ;}
|
||
break;
|
||
|
||
case 116:
|
||
#line 1252 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.ParamAttrs = ParamAttr::ZExt; ;}
|
||
break;
|
||
|
||
case 117:
|
||
#line 1253 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.ParamAttrs = ParamAttr::SExt; ;}
|
||
break;
|
||
|
||
case 118:
|
||
#line 1256 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.ParamAttrs = ParamAttr::None; ;}
|
||
break;
|
||
|
||
case 119:
|
||
#line 1257 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.ParamAttrs = yyvsp[-1].ParamAttrs | yyvsp[0].ParamAttrs;
|
||
;}
|
||
break;
|
||
|
||
case 120:
|
||
#line 1264 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.UIntVal = 0; ;}
|
||
break;
|
||
|
||
case 121:
|
||
#line 1265 "/users/dag/projects/cascade/llvm.modified/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 122:
|
||
#line 1271 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.UIntVal = 0; ;}
|
||
break;
|
||
|
||
case 123:
|
||
#line 1272 "/users/dag/projects/cascade/llvm.modified/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 124:
|
||
#line 1280 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
for (unsigned i = 0, e = yyvsp[0].StrVal->length(); 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 125:
|
||
#line 1288 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.StrVal = 0; ;}
|
||
break;
|
||
|
||
case 126:
|
||
#line 1289 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.StrVal = yyvsp[0].StrVal; ;}
|
||
break;
|
||
|
||
case 127:
|
||
#line 1294 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{;}
|
||
break;
|
||
|
||
case 128:
|
||
#line 1295 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{;}
|
||
break;
|
||
|
||
case 129:
|
||
#line 1296 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CurGV->setSection(*yyvsp[0].StrVal);
|
||
delete yyvsp[0].StrVal;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 130:
|
||
#line 1301 "/users/dag/projects/cascade/llvm.modified/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 138:
|
||
#line 1317 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.TypeVal = new PATypeHolder(OpaqueType::get());
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 139:
|
||
#line 1321 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.TypeVal = new PATypeHolder(yyvsp[0].PrimType);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 140:
|
||
#line 1325 "/users/dag/projects/cascade/llvm.modified/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 141:
|
||
#line 1332 "/users/dag/projects/cascade/llvm.modified/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 142:
|
||
#line 1337 "/users/dag/projects/cascade/llvm.modified/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 143:
|
||
#line 1345 "/users/dag/projects/cascade/llvm.modified/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 144:
|
||
#line 1375 "/users/dag/projects/cascade/llvm.modified/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 145:
|
||
#line 1406 "/users/dag/projects/cascade/llvm.modified/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 146:
|
||
#line 1411 "/users/dag/projects/cascade/llvm.modified/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 147:
|
||
#line 1423 "/users/dag/projects/cascade/llvm.modified/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 148:
|
||
#line 1433 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Empty structure type?
|
||
yyval.TypeVal = new PATypeHolder(StructType::get(std::vector<const Type*>()));
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 149:
|
||
#line 1437 "/users/dag/projects/cascade/llvm.modified/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 150:
|
||
#line 1447 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Empty structure type?
|
||
yyval.TypeVal = new PATypeHolder(StructType::get(std::vector<const Type*>(), true));
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 151:
|
||
#line 1454 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.TypeWithAttrs.Ty = yyvsp[-1].TypeVal;
|
||
yyval.TypeWithAttrs.Attrs = yyvsp[0].ParamAttrs;
|
||
;}
|
||
break;
|
||
|
||
case 152:
|
||
#line 1461 "/users/dag/projects/cascade/llvm.modified/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 153:
|
||
#line 1468 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.TypeVal = new PATypeHolder(Type::VoidTy);
|
||
;}
|
||
break;
|
||
|
||
case 154:
|
||
#line 1473 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.TypeWithAttrsList = new TypeWithAttrsList();
|
||
yyval.TypeWithAttrsList->push_back(yyvsp[0].TypeWithAttrs);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 155:
|
||
#line 1478 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.TypeWithAttrsList=yyvsp[-2].TypeWithAttrsList)->push_back(yyvsp[0].TypeWithAttrs);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 157:
|
||
#line 1486 "/users/dag/projects/cascade/llvm.modified/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 158:
|
||
#line 1493 "/users/dag/projects/cascade/llvm.modified/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 159:
|
||
#line 1500 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.TypeWithAttrsList = new TypeWithAttrsList();
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 160:
|
||
#line 1508 "/users/dag/projects/cascade/llvm.modified/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 161:
|
||
#line 1514 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.TypeList=yyvsp[-2].TypeList)->push_back(*yyvsp[0].TypeVal);
|
||
delete yyvsp[0].TypeVal;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 162:
|
||
#line 1526 "/users/dag/projects/cascade/llvm.modified/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 163:
|
||
#line 1554 "/users/dag/projects/cascade/llvm.modified/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 164:
|
||
#line 1570 "/users/dag/projects/cascade/llvm.modified/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();
|
||
if (NumElements != -1 && NumElements != int(yyvsp[0].StrVal->length()))
|
||
GEN_ERROR("Can't build string constant of size " +
|
||
itostr((int)(yyvsp[0].StrVal->length())) +
|
||
" when array has size " + itostr(NumElements) + "");
|
||
std::vector<Constant*> Vals;
|
||
if (ETy == Type::Int8Ty) {
|
||
for (unsigned i = 0; i < yyvsp[0].StrVal->length(); ++i)
|
||
Vals.push_back(ConstantInt::get(ETy, (*yyvsp[0].StrVal)[i]));
|
||
} else {
|
||
delete yyvsp[0].StrVal;
|
||
GEN_ERROR("Cannot build string arrays of non byte sized elements");
|
||
}
|
||
delete yyvsp[0].StrVal;
|
||
yyval.ConstVal = ConstantArray::get(ATy, Vals);
|
||
delete yyvsp[-2].TypeVal;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 165:
|
||
#line 1597 "/users/dag/projects/cascade/llvm.modified/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 166:
|
||
#line 1625 "/users/dag/projects/cascade/llvm.modified/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 167:
|
||
#line 1651 "/users/dag/projects/cascade/llvm.modified/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 168:
|
||
#line 1671 "/users/dag/projects/cascade/llvm.modified/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 169:
|
||
#line 1697 "/users/dag/projects/cascade/llvm.modified/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 170:
|
||
#line 1717 "/users/dag/projects/cascade/llvm.modified/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 171:
|
||
#line 1729 "/users/dag/projects/cascade/llvm.modified/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 172:
|
||
#line 1736 "/users/dag/projects/cascade/llvm.modified/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.getName();
|
||
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 173:
|
||
#line 1802 "/users/dag/projects/cascade/llvm.modified/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 174:
|
||
#line 1812 "/users/dag/projects/cascade/llvm.modified/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 175:
|
||
#line 1822 "/users/dag/projects/cascade/llvm.modified/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 176:
|
||
#line 1828 "/users/dag/projects/cascade/llvm.modified/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 177:
|
||
#line 1838 "/users/dag/projects/cascade/llvm.modified/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 178:
|
||
#line 1844 "/users/dag/projects/cascade/llvm.modified/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 179:
|
||
#line 1854 "/users/dag/projects/cascade/llvm.modified/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 180:
|
||
#line 1859 "/users/dag/projects/cascade/llvm.modified/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 181:
|
||
#line 1864 "/users/dag/projects/cascade/llvm.modified/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 182:
|
||
#line 1872 "/users/dag/projects/cascade/llvm.modified/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 183:
|
||
#line 1884 "/users/dag/projects/cascade/llvm.modified/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->begin(), yyvsp[-1].ValueList->end(),
|
||
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 184:
|
||
#line 1906 "/users/dag/projects/cascade/llvm.modified/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 185:
|
||
#line 1914 "/users/dag/projects/cascade/llvm.modified/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 186:
|
||
#line 1920 "/users/dag/projects/cascade/llvm.modified/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 187:
|
||
#line 1931 "/users/dag/projects/cascade/llvm.modified/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 188:
|
||
#line 1936 "/users/dag/projects/cascade/llvm.modified/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 189:
|
||
#line 1941 "/users/dag/projects/cascade/llvm.modified/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 190:
|
||
#line 1947 "/users/dag/projects/cascade/llvm.modified/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 191:
|
||
#line 1953 "/users/dag/projects/cascade/llvm.modified/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 192:
|
||
#line 1962 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.ConstVector = yyvsp[-2].ConstVector)->push_back(yyvsp[0].ConstVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 193:
|
||
#line 1966 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.ConstVector = new std::vector<Constant*>();
|
||
yyval.ConstVector->push_back(yyvsp[0].ConstVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 194:
|
||
#line 1974 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.BoolVal = false; ;}
|
||
break;
|
||
|
||
case 195:
|
||
#line 1974 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.BoolVal = true; ;}
|
||
break;
|
||
|
||
case 196:
|
||
#line 1977 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.BoolVal = true; ;}
|
||
break;
|
||
|
||
case 197:
|
||
#line 1977 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.BoolVal = false; ;}
|
||
break;
|
||
|
||
case 198:
|
||
#line 1980 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
const Type* VTy = yyvsp[-1].TypeVal->get();
|
||
Value *V = getVal(VTy, yyvsp[0].ValIDVal);
|
||
CHECK_FOR_ERROR
|
||
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 199:
|
||
#line 1992 "/users/dag/projects/cascade/llvm.modified/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 200:
|
||
#line 2013 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.ModuleVal = ParserResult = CurModule.CurrentModule;
|
||
CurModule.ModuleDone();
|
||
CHECK_FOR_ERROR;
|
||
;}
|
||
break;
|
||
|
||
case 201:
|
||
#line 2018 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.ModuleVal = ParserResult = CurModule.CurrentModule;
|
||
CurModule.ModuleDone();
|
||
CHECK_FOR_ERROR;
|
||
;}
|
||
break;
|
||
|
||
case 204:
|
||
#line 2031 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ CurFun.isDeclare = false; ;}
|
||
break;
|
||
|
||
case 205:
|
||
#line 2031 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CurFun.FunctionDone();
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 206:
|
||
#line 2035 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ CurFun.isDeclare = true; ;}
|
||
break;
|
||
|
||
case 207:
|
||
#line 2035 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 208:
|
||
#line 2038 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 209:
|
||
#line 2041 "/users/dag/projects/cascade/llvm.modified/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 210:
|
||
#line 2065 "/users/dag/projects/cascade/llvm.modified/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 211:
|
||
#line 2076 "/users/dag/projects/cascade/llvm.modified/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 212:
|
||
#line 2083 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CurGV = 0;
|
||
;}
|
||
break;
|
||
|
||
case 213:
|
||
#line 2087 "/users/dag/projects/cascade/llvm.modified/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 214:
|
||
#line 2092 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CurGV = 0;
|
||
;}
|
||
break;
|
||
|
||
case 215:
|
||
#line 2096 "/users/dag/projects/cascade/llvm.modified/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 216:
|
||
#line 2102 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CurGV = 0;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 217:
|
||
#line 2106 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
std::string Name;
|
||
if (yyvsp[-4].StrVal) {
|
||
Name = *yyvsp[-4].StrVal;
|
||
delete 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: ") + Name);
|
||
|
||
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 218:
|
||
#line 2125 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 219:
|
||
#line 2128 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 220:
|
||
#line 2134 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
const std::string &AsmSoFar = CurModule.CurrentModule->getModuleInlineAsm();
|
||
if (AsmSoFar.empty())
|
||
CurModule.CurrentModule->setModuleInlineAsm(*yyvsp[0].StrVal);
|
||
else
|
||
CurModule.CurrentModule->setModuleInlineAsm(AsmSoFar+"\n"+*yyvsp[0].StrVal);
|
||
delete yyvsp[0].StrVal;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 221:
|
||
#line 2144 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CurModule.CurrentModule->setTargetTriple(*yyvsp[0].StrVal);
|
||
delete yyvsp[0].StrVal;
|
||
;}
|
||
break;
|
||
|
||
case 222:
|
||
#line 2148 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CurModule.CurrentModule->setDataLayout(*yyvsp[0].StrVal);
|
||
delete yyvsp[0].StrVal;
|
||
;}
|
||
break;
|
||
|
||
case 224:
|
||
#line 2155 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CurModule.CurrentModule->addLibrary(*yyvsp[0].StrVal);
|
||
delete yyvsp[0].StrVal;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 225:
|
||
#line 2160 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CurModule.CurrentModule->addLibrary(*yyvsp[0].StrVal);
|
||
delete yyvsp[0].StrVal;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 226:
|
||
#line 2165 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 227:
|
||
#line 2174 "/users/dag/projects/cascade/llvm.modified/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 228:
|
||
#line 2184 "/users/dag/projects/cascade/llvm.modified/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 229:
|
||
#line 2195 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.ArgList = yyvsp[0].ArgList;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 230:
|
||
#line 2199 "/users/dag/projects/cascade/llvm.modified/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 231:
|
||
#line 2208 "/users/dag/projects/cascade/llvm.modified/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 232:
|
||
#line 2217 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.ArgList = 0;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 233:
|
||
#line 2223 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
std::string FunctionName(*yyvsp[-6].StrVal);
|
||
delete 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);
|
||
delete 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 236:
|
||
#line 2345 "/users/dag/projects/cascade/llvm.modified/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 239:
|
||
#line 2356 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.FunctionVal = yyvsp[-1].FunctionVal;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 240:
|
||
#line 2361 "/users/dag/projects/cascade/llvm.modified/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 241:
|
||
#line 2373 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.BoolVal = false;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 242:
|
||
#line 2377 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.BoolVal = true;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 243:
|
||
#line 2382 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ // A reference to a direct constant
|
||
yyval.ValIDVal = ValID::create(yyvsp[0].SInt64Val);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 244:
|
||
#line 2386 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.ValIDVal = ValID::create(yyvsp[0].UInt64Val);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 245:
|
||
#line 2390 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Perhaps it's an FP constant?
|
||
yyval.ValIDVal = ValID::create(yyvsp[0].FPVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 246:
|
||
#line 2394 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.ValIDVal = ValID::create(ConstantInt::getTrue());
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 247:
|
||
#line 2398 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.ValIDVal = ValID::create(ConstantInt::getFalse());
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 248:
|
||
#line 2402 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.ValIDVal = ValID::createNull();
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 249:
|
||
#line 2406 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.ValIDVal = ValID::createUndef();
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 250:
|
||
#line 2410 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ // A vector zero constant.
|
||
yyval.ValIDVal = ValID::createZeroInit();
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 251:
|
||
#line 2414 "/users/dag/projects/cascade/llvm.modified/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 252:
|
||
#line 2439 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.ValIDVal = ValID::create(yyvsp[0].ConstVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 253:
|
||
#line 2443 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.ValIDVal = ValID::createInlineAsm(*yyvsp[-2].StrVal, *yyvsp[0].StrVal, yyvsp[-3].BoolVal);
|
||
delete yyvsp[-2].StrVal;
|
||
delete yyvsp[0].StrVal;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 254:
|
||
#line 2453 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Is it an integer reference...?
|
||
yyval.ValIDVal = ValID::createLocalID(yyvsp[0].UIntVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 255:
|
||
#line 2457 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.ValIDVal = ValID::createGlobalID(yyvsp[0].UIntVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 256:
|
||
#line 2461 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Is it a named reference...?
|
||
yyval.ValIDVal = ValID::createLocalName(*yyvsp[0].StrVal);
|
||
delete yyvsp[0].StrVal;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 257:
|
||
#line 2466 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Is it a named reference...?
|
||
yyval.ValIDVal = ValID::createGlobalName(*yyvsp[0].StrVal);
|
||
delete yyvsp[0].StrVal;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 260:
|
||
#line 2479 "/users/dag/projects/cascade/llvm.modified/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 261:
|
||
#line 2488 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.FunctionVal = yyvsp[-1].FunctionVal;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 262:
|
||
#line 2492 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Do not allow functions with 0 basic blocks
|
||
yyval.FunctionVal = yyvsp[-1].FunctionVal;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 263:
|
||
#line 2501 "/users/dag/projects/cascade/llvm.modified/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 264:
|
||
#line 2510 "/users/dag/projects/cascade/llvm.modified/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 265:
|
||
#line 2519 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Empty space between instruction lists
|
||
yyval.BasicBlockVal = defineBBVal(ValID::createLocalID(CurFun.NextValNum));
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 266:
|
||
#line 2523 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Labelled (named) basic block
|
||
yyval.BasicBlockVal = defineBBVal(ValID::createLocalName(*yyvsp[0].StrVal));
|
||
delete yyvsp[0].StrVal;
|
||
CHECK_FOR_ERROR
|
||
|
||
;}
|
||
break;
|
||
|
||
case 267:
|
||
#line 2530 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Return with a result...
|
||
yyval.TermInstVal = new ReturnInst(yyvsp[0].ValueVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 268:
|
||
#line 2534 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Return with no result...
|
||
yyval.TermInstVal = new ReturnInst();
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 269:
|
||
#line 2538 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Unconditional Branch...
|
||
BasicBlock* tmpBB = getBBVal(yyvsp[0].ValIDVal);
|
||
CHECK_FOR_ERROR
|
||
yyval.TermInstVal = new BranchInst(tmpBB);
|
||
;}
|
||
break;
|
||
|
||
case 270:
|
||
#line 2543 "/users/dag/projects/cascade/llvm.modified/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 271:
|
||
#line 2553 "/users/dag/projects/cascade/llvm.modified/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 272:
|
||
#line 2572 "/users/dag/projects/cascade/llvm.modified/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 273:
|
||
#line 2582 "/users/dag/projects/cascade/llvm.modified/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 = yyvsp[-6].ParamAttrs;
|
||
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.begin(), Args.end());
|
||
II->setCallingConv(yyvsp[-12].UIntVal);
|
||
yyval.TermInstVal = II;
|
||
delete yyvsp[-8].ValueRefList;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 274:
|
||
#line 2661 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.TermInstVal = new UnwindInst();
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 275:
|
||
#line 2665 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.TermInstVal = new UnreachableInst();
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 276:
|
||
#line 2672 "/users/dag/projects/cascade/llvm.modified/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 277:
|
||
#line 2683 "/users/dag/projects/cascade/llvm.modified/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 278:
|
||
#line 2696 "/users/dag/projects/cascade/llvm.modified/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 279:
|
||
#line 2706 "/users/dag/projects/cascade/llvm.modified/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 280:
|
||
#line 2717 "/users/dag/projects/cascade/llvm.modified/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 281:
|
||
#line 2727 "/users/dag/projects/cascade/llvm.modified/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 282:
|
||
#line 2736 "/users/dag/projects/cascade/llvm.modified/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 283:
|
||
#line 2745 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.ValueRefList = new ValueRefList(); ;}
|
||
break;
|
||
|
||
case 284:
|
||
#line 2748 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.ValueList = new std::vector<Value*>(); ;}
|
||
break;
|
||
|
||
case 285:
|
||
#line 2749 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.ValueList = yyvsp[-2].ValueList;
|
||
yyval.ValueList->push_back(yyvsp[0].ValueVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 286:
|
||
#line 2756 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.BoolVal = true;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 287:
|
||
#line 2760 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.BoolVal = false;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 288:
|
||
#line 2765 "/users/dag/projects/cascade/llvm.modified/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 289:
|
||
#line 2786 "/users/dag/projects/cascade/llvm.modified/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 290:
|
||
#line 2803 "/users/dag/projects/cascade/llvm.modified/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 291:
|
||
#line 2817 "/users/dag/projects/cascade/llvm.modified/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 292:
|
||
#line 2831 "/users/dag/projects/cascade/llvm.modified/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 293:
|
||
#line 2843 "/users/dag/projects/cascade/llvm.modified/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 294:
|
||
#line 2851 "/users/dag/projects/cascade/llvm.modified/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 295:
|
||
#line 2858 "/users/dag/projects/cascade/llvm.modified/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 296:
|
||
#line 2864 "/users/dag/projects/cascade/llvm.modified/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 297:
|
||
#line 2870 "/users/dag/projects/cascade/llvm.modified/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 298:
|
||
#line 2876 "/users/dag/projects/cascade/llvm.modified/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 299:
|
||
#line 2892 "/users/dag/projects/cascade/llvm.modified/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.begin(), Args.end());
|
||
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 300:
|
||
#line 2976 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.InstVal = yyvsp[0].InstVal;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 301:
|
||
#line 2981 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.BoolVal = true;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 302:
|
||
#line 2985 "/users/dag/projects/cascade/llvm.modified/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.BoolVal = false;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 303:
|
||
#line 2992 "/users/dag/projects/cascade/llvm.modified/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 304:
|
||
#line 2999 "/users/dag/projects/cascade/llvm.modified/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 305:
|
||
#line 3007 "/users/dag/projects/cascade/llvm.modified/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 306:
|
||
#line 3014 "/users/dag/projects/cascade/llvm.modified/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 307:
|
||
#line 3022 "/users/dag/projects/cascade/llvm.modified/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 308:
|
||
#line 3030 "/users/dag/projects/cascade/llvm.modified/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 309:
|
||
#line 3044 "/users/dag/projects/cascade/llvm.modified/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 310:
|
||
#line 3061 "/users/dag/projects/cascade/llvm.modified/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->begin(), yyvsp[0].ValueList->end(), 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->begin(), yyvsp[0].ValueList->end());
|
||
delete yyvsp[-2].TypeVal;
|
||
delete yyvsp[0].ValueList;
|
||
;}
|
||
break;
|
||
|
||
|
||
}
|
||
|
||
/* Line 993 of yacc.c. */
|
||
#line 5847 "llvmAsmParser.tab.c"
|
||
|
||
yyvsp -= yylen;
|
||
yyssp -= yylen;
|
||
|
||
|
||
YY_STACK_PRINT (yyss, yyssp);
|
||
|
||
*++yyvsp = yyval;
|
||
|
||
|
||
/* Now `shift' the result of the reduction. Determine what state
|
||
that goes to, based on the state we popped back to and the rule
|
||
number reduced by. */
|
||
|
||
yyn = yyr1[yyn];
|
||
|
||
yystate = yypgoto[yyn - YYNTOKENS] + *yyssp;
|
||
if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp)
|
||
yystate = yytable[yystate];
|
||
else
|
||
yystate = yydefgoto[yyn - YYNTOKENS];
|
||
|
||
goto yynewstate;
|
||
|
||
|
||
/*------------------------------------.
|
||
| yyerrlab -- here on detecting error |
|
||
`------------------------------------*/
|
||
yyerrlab:
|
||
/* If not already recovering from an error, report this error. */
|
||
if (!yyerrstatus)
|
||
{
|
||
++yynerrs;
|
||
#if YYERROR_VERBOSE
|
||
yyn = yypact[yystate];
|
||
|
||
if (YYPACT_NINF < yyn && yyn < YYLAST)
|
||
{
|
||
YYSIZE_T yysize = 0;
|
||
int yytype = YYTRANSLATE (yychar);
|
||
const char* yyprefix;
|
||
char *yymsg;
|
||
int yyx;
|
||
|
||
/* Start YYX at -YYN if negative to avoid negative indexes in
|
||
YYCHECK. */
|
||
int yyxbegin = yyn < 0 ? -yyn : 0;
|
||
|
||
/* Stay within bounds of both yycheck and yytname. */
|
||
int yychecklim = YYLAST - yyn;
|
||
int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;
|
||
int yycount = 0;
|
||
|
||
yyprefix = ", expecting ";
|
||
for (yyx = yyxbegin; yyx < yyxend; ++yyx)
|
||
if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
|
||
{
|
||
yysize += yystrlen (yyprefix) + yystrlen (yytname [yyx]);
|
||
yycount += 1;
|
||
if (yycount == 5)
|
||
{
|
||
yysize = 0;
|
||
break;
|
||
}
|
||
}
|
||
yysize += (sizeof ("syntax error, unexpected ")
|
||
+ yystrlen (yytname[yytype]));
|
||
yymsg = (char *) YYSTACK_ALLOC (yysize);
|
||
if (yymsg != 0)
|
||
{
|
||
char *yyp = yystpcpy (yymsg, "syntax error, unexpected ");
|
||
yyp = yystpcpy (yyp, yytname[yytype]);
|
||
|
||
if (yycount < 5)
|
||
{
|
||
yyprefix = ", expecting ";
|
||
for (yyx = yyxbegin; yyx < yyxend; ++yyx)
|
||
if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
|
||
{
|
||
yyp = yystpcpy (yyp, yyprefix);
|
||
yyp = yystpcpy (yyp, yytname[yyx]);
|
||
yyprefix = " or ";
|
||
}
|
||
}
|
||
yyerror (yymsg);
|
||
YYSTACK_FREE (yymsg);
|
||
}
|
||
else
|
||
yyerror ("syntax error; also virtual memory exhausted");
|
||
}
|
||
else
|
||
#endif /* YYERROR_VERBOSE */
|
||
yyerror ("syntax error");
|
||
}
|
||
|
||
|
||
|
||
if (yyerrstatus == 3)
|
||
{
|
||
/* If just tried and failed to reuse lookahead token after an
|
||
error, discard it. */
|
||
|
||
if (yychar <= YYEOF)
|
||
{
|
||
/* If at end of input, pop the error token,
|
||
then the rest of the stack, then return failure. */
|
||
if (yychar == YYEOF)
|
||
for (;;)
|
||
{
|
||
YYPOPSTACK;
|
||
if (yyssp == yyss)
|
||
YYABORT;
|
||
YYDSYMPRINTF ("Error: popping", yystos[*yyssp], yyvsp, yylsp);
|
||
yydestruct (yystos[*yyssp], yyvsp);
|
||
}
|
||
}
|
||
else
|
||
{
|
||
YYDSYMPRINTF ("Error: discarding", yytoken, &yylval, &yylloc);
|
||
yydestruct (yytoken, &yylval);
|
||
yychar = YYEMPTY;
|
||
|
||
}
|
||
}
|
||
|
||
/* Else will try to reuse lookahead token after shifting the error
|
||
token. */
|
||
goto yyerrlab1;
|
||
|
||
|
||
/*---------------------------------------------------.
|
||
| yyerrorlab -- error raised explicitly by YYERROR. |
|
||
`---------------------------------------------------*/
|
||
yyerrorlab:
|
||
|
||
#ifdef __GNUC__
|
||
/* Pacify GCC when the user code never invokes YYERROR and the label
|
||
yyerrorlab therefore never appears in user code. */
|
||
if (0)
|
||
goto yyerrorlab;
|
||
#endif
|
||
|
||
yyvsp -= yylen;
|
||
yyssp -= yylen;
|
||
yystate = *yyssp;
|
||
goto yyerrlab1;
|
||
|
||
|
||
/*-------------------------------------------------------------.
|
||
| yyerrlab1 -- common code for both syntax error and YYERROR. |
|
||
`-------------------------------------------------------------*/
|
||
yyerrlab1:
|
||
yyerrstatus = 3; /* Each real token shifted decrements this. */
|
||
|
||
for (;;)
|
||
{
|
||
yyn = yypact[yystate];
|
||
if (yyn != YYPACT_NINF)
|
||
{
|
||
yyn += YYTERROR;
|
||
if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR)
|
||
{
|
||
yyn = yytable[yyn];
|
||
if (0 < yyn)
|
||
break;
|
||
}
|
||
}
|
||
|
||
/* Pop the current state because it cannot handle the error token. */
|
||
if (yyssp == yyss)
|
||
YYABORT;
|
||
|
||
YYDSYMPRINTF ("Error: popping", yystos[*yyssp], yyvsp, yylsp);
|
||
yydestruct (yystos[yystate], yyvsp);
|
||
YYPOPSTACK;
|
||
yystate = *yyssp;
|
||
YY_STACK_PRINT (yyss, yyssp);
|
||
}
|
||
|
||
if (yyn == YYFINAL)
|
||
YYACCEPT;
|
||
|
||
YYDPRINTF ((stderr, "Shifting error token, "));
|
||
|
||
*++yyvsp = yylval;
|
||
|
||
|
||
yystate = yyn;
|
||
goto yynewstate;
|
||
|
||
|
||
/*-------------------------------------.
|
||
| yyacceptlab -- YYACCEPT comes here. |
|
||
`-------------------------------------*/
|
||
yyacceptlab:
|
||
yyresult = 0;
|
||
goto yyreturn;
|
||
|
||
/*-----------------------------------.
|
||
| yyabortlab -- YYABORT comes here. |
|
||
`-----------------------------------*/
|
||
yyabortlab:
|
||
yyresult = 1;
|
||
goto yyreturn;
|
||
|
||
#ifndef yyoverflow
|
||
/*----------------------------------------------.
|
||
| yyoverflowlab -- parser overflow comes here. |
|
||
`----------------------------------------------*/
|
||
yyoverflowlab:
|
||
yyerror ("parser stack overflow");
|
||
yyresult = 2;
|
||
/* Fall through. */
|
||
#endif
|
||
|
||
yyreturn:
|
||
#ifndef yyoverflow
|
||
if (yyss != yyssa)
|
||
YYSTACK_FREE (yyss);
|
||
#endif
|
||
return yyresult;
|
||
}
|
||
|
||
|
||
#line 3078 "/users/dag/projects/cascade/llvm.modified/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;
|
||
}
|
||
|