mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-12-22 07:32:48 +00:00
361c3efd9a
llvm[2]: Compiling llvmAsmParser.cpp for Debug build /usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y: In function 'int llvmAsmparse()': /usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y:1846: error: expected `;' before '}' token git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@33425 91177308-0d34-0410-b5e6-96231b3b80d8
5675 lines
202 KiB
Plaintext
5675 lines
202 KiB
Plaintext
/* A Bison parser, made from /usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y, by GNU bison 1.75. */
|
||
|
||
/* Skeleton parser for Yacc-like parsing with Bison,
|
||
Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002 Free Software Foundation, Inc.
|
||
|
||
This program is free software; you can redistribute it and/or modify
|
||
it under the terms of the GNU General Public License as published by
|
||
the Free Software Foundation; either version 2, or (at your option)
|
||
any later version.
|
||
|
||
This program is distributed in the hope that it will be useful,
|
||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||
GNU General Public License for more details.
|
||
|
||
You should have received a copy of the GNU General Public License
|
||
along with this program; if not, write to the Free Software
|
||
Foundation, Inc., 59 Temple Place - Suite 330,
|
||
Boston, MA 02111-1307, USA. */
|
||
|
||
/* As a special exception, when this file is copied by Bison into a
|
||
Bison output file, you may use that output file without restriction.
|
||
This special exception was added by the Free Software Foundation
|
||
in version 1.24 of Bison. */
|
||
|
||
/* Written by Richard Stallman by simplifying the original so called
|
||
``semantic'' parser. */
|
||
|
||
/* All symbols defined below should begin with yy or YY, to avoid
|
||
infringing on user name space. This should be done even for local
|
||
variables, as they might otherwise be expanded by user macros.
|
||
There are some unavoidable exceptions within include files to
|
||
define necessary library symbols; they are noted "INFRINGES ON
|
||
USER NAME SPACE" below. */
|
||
|
||
/* Identify Bison output. */
|
||
#define YYBISON 1
|
||
|
||
/* Pure parsers. */
|
||
#define YYPURE 0
|
||
|
||
/* Using locations. */
|
||
#define YYLSP_NEEDED 0
|
||
|
||
/* If NAME_PREFIX is specified substitute the variables and functions
|
||
names. */
|
||
#define yyparse llvmAsmparse
|
||
#define yylex llvmAsmlex
|
||
#define yyerror llvmAsmerror
|
||
#define yylval llvmAsmlval
|
||
#define yychar llvmAsmchar
|
||
#define yydebug llvmAsmdebug
|
||
#define yynerrs llvmAsmnerrs
|
||
|
||
|
||
/* Tokens. */
|
||
#ifndef YYTOKENTYPE
|
||
# define YYTOKENTYPE
|
||
/* Put the tokens into the symbol table, so that GDB and other debuggers
|
||
know about them. */
|
||
enum yytokentype {
|
||
ESINT64VAL = 258,
|
||
EUINT64VAL = 259,
|
||
SINTVAL = 260,
|
||
UINTVAL = 261,
|
||
FPVAL = 262,
|
||
VOID = 263,
|
||
INTTYPE = 264,
|
||
FLOAT = 265,
|
||
DOUBLE = 266,
|
||
LABEL = 267,
|
||
TYPE = 268,
|
||
VAR_ID = 269,
|
||
LABELSTR = 270,
|
||
STRINGCONSTANT = 271,
|
||
IMPLEMENTATION = 272,
|
||
ZEROINITIALIZER = 273,
|
||
TRUETOK = 274,
|
||
FALSETOK = 275,
|
||
BEGINTOK = 276,
|
||
ENDTOK = 277,
|
||
DECLARE = 278,
|
||
DEFINE = 279,
|
||
GLOBAL = 280,
|
||
CONSTANT = 281,
|
||
SECTION = 282,
|
||
VOLATILE = 283,
|
||
TO = 284,
|
||
DOTDOTDOT = 285,
|
||
NULL_TOK = 286,
|
||
UNDEF = 287,
|
||
INTERNAL = 288,
|
||
LINKONCE = 289,
|
||
WEAK = 290,
|
||
APPENDING = 291,
|
||
DLLIMPORT = 292,
|
||
DLLEXPORT = 293,
|
||
EXTERN_WEAK = 294,
|
||
OPAQUE = 295,
|
||
EXTERNAL = 296,
|
||
TARGET = 297,
|
||
TRIPLE = 298,
|
||
ENDIAN = 299,
|
||
POINTERSIZE = 300,
|
||
LITTLE = 301,
|
||
BIG = 302,
|
||
ALIGN = 303,
|
||
DEPLIBS = 304,
|
||
CALL = 305,
|
||
TAIL = 306,
|
||
ASM_TOK = 307,
|
||
MODULE = 308,
|
||
SIDEEFFECT = 309,
|
||
CC_TOK = 310,
|
||
CCC_TOK = 311,
|
||
CSRETCC_TOK = 312,
|
||
FASTCC_TOK = 313,
|
||
COLDCC_TOK = 314,
|
||
X86_STDCALLCC_TOK = 315,
|
||
X86_FASTCALLCC_TOK = 316,
|
||
DATALAYOUT = 317,
|
||
RET = 318,
|
||
BR = 319,
|
||
SWITCH = 320,
|
||
INVOKE = 321,
|
||
UNWIND = 322,
|
||
UNREACHABLE = 323,
|
||
ADD = 324,
|
||
SUB = 325,
|
||
MUL = 326,
|
||
UDIV = 327,
|
||
SDIV = 328,
|
||
FDIV = 329,
|
||
UREM = 330,
|
||
SREM = 331,
|
||
FREM = 332,
|
||
AND = 333,
|
||
OR = 334,
|
||
XOR = 335,
|
||
ICMP = 336,
|
||
FCMP = 337,
|
||
EQ = 338,
|
||
NE = 339,
|
||
SLT = 340,
|
||
SGT = 341,
|
||
SLE = 342,
|
||
SGE = 343,
|
||
ULT = 344,
|
||
UGT = 345,
|
||
ULE = 346,
|
||
UGE = 347,
|
||
OEQ = 348,
|
||
ONE = 349,
|
||
OLT = 350,
|
||
OGT = 351,
|
||
OLE = 352,
|
||
OGE = 353,
|
||
ORD = 354,
|
||
UNO = 355,
|
||
UEQ = 356,
|
||
UNE = 357,
|
||
MALLOC = 358,
|
||
ALLOCA = 359,
|
||
FREE = 360,
|
||
LOAD = 361,
|
||
STORE = 362,
|
||
GETELEMENTPTR = 363,
|
||
TRUNC = 364,
|
||
ZEXT = 365,
|
||
SEXT = 366,
|
||
FPTRUNC = 367,
|
||
FPEXT = 368,
|
||
BITCAST = 369,
|
||
UITOFP = 370,
|
||
SITOFP = 371,
|
||
FPTOUI = 372,
|
||
FPTOSI = 373,
|
||
INTTOPTR = 374,
|
||
PTRTOINT = 375,
|
||
PHI_TOK = 376,
|
||
SELECT = 377,
|
||
SHL = 378,
|
||
LSHR = 379,
|
||
ASHR = 380,
|
||
VAARG = 381,
|
||
EXTRACTELEMENT = 382,
|
||
INSERTELEMENT = 383,
|
||
SHUFFLEVECTOR = 384,
|
||
NORETURN = 385,
|
||
DEFAULT = 386,
|
||
HIDDEN = 387
|
||
};
|
||
#endif
|
||
#define ESINT64VAL 258
|
||
#define EUINT64VAL 259
|
||
#define SINTVAL 260
|
||
#define UINTVAL 261
|
||
#define FPVAL 262
|
||
#define VOID 263
|
||
#define INTTYPE 264
|
||
#define FLOAT 265
|
||
#define DOUBLE 266
|
||
#define LABEL 267
|
||
#define TYPE 268
|
||
#define VAR_ID 269
|
||
#define LABELSTR 270
|
||
#define STRINGCONSTANT 271
|
||
#define IMPLEMENTATION 272
|
||
#define ZEROINITIALIZER 273
|
||
#define TRUETOK 274
|
||
#define FALSETOK 275
|
||
#define BEGINTOK 276
|
||
#define ENDTOK 277
|
||
#define DECLARE 278
|
||
#define DEFINE 279
|
||
#define GLOBAL 280
|
||
#define CONSTANT 281
|
||
#define SECTION 282
|
||
#define VOLATILE 283
|
||
#define TO 284
|
||
#define DOTDOTDOT 285
|
||
#define NULL_TOK 286
|
||
#define UNDEF 287
|
||
#define INTERNAL 288
|
||
#define LINKONCE 289
|
||
#define WEAK 290
|
||
#define APPENDING 291
|
||
#define DLLIMPORT 292
|
||
#define DLLEXPORT 293
|
||
#define EXTERN_WEAK 294
|
||
#define OPAQUE 295
|
||
#define EXTERNAL 296
|
||
#define TARGET 297
|
||
#define TRIPLE 298
|
||
#define ENDIAN 299
|
||
#define POINTERSIZE 300
|
||
#define LITTLE 301
|
||
#define BIG 302
|
||
#define ALIGN 303
|
||
#define DEPLIBS 304
|
||
#define CALL 305
|
||
#define TAIL 306
|
||
#define ASM_TOK 307
|
||
#define MODULE 308
|
||
#define SIDEEFFECT 309
|
||
#define CC_TOK 310
|
||
#define CCC_TOK 311
|
||
#define CSRETCC_TOK 312
|
||
#define FASTCC_TOK 313
|
||
#define COLDCC_TOK 314
|
||
#define X86_STDCALLCC_TOK 315
|
||
#define X86_FASTCALLCC_TOK 316
|
||
#define DATALAYOUT 317
|
||
#define RET 318
|
||
#define BR 319
|
||
#define SWITCH 320
|
||
#define INVOKE 321
|
||
#define UNWIND 322
|
||
#define UNREACHABLE 323
|
||
#define ADD 324
|
||
#define SUB 325
|
||
#define MUL 326
|
||
#define UDIV 327
|
||
#define SDIV 328
|
||
#define FDIV 329
|
||
#define UREM 330
|
||
#define SREM 331
|
||
#define FREM 332
|
||
#define AND 333
|
||
#define OR 334
|
||
#define XOR 335
|
||
#define ICMP 336
|
||
#define FCMP 337
|
||
#define EQ 338
|
||
#define NE 339
|
||
#define SLT 340
|
||
#define SGT 341
|
||
#define SLE 342
|
||
#define SGE 343
|
||
#define ULT 344
|
||
#define UGT 345
|
||
#define ULE 346
|
||
#define UGE 347
|
||
#define OEQ 348
|
||
#define ONE 349
|
||
#define OLT 350
|
||
#define OGT 351
|
||
#define OLE 352
|
||
#define OGE 353
|
||
#define ORD 354
|
||
#define UNO 355
|
||
#define UEQ 356
|
||
#define UNE 357
|
||
#define MALLOC 358
|
||
#define ALLOCA 359
|
||
#define FREE 360
|
||
#define LOAD 361
|
||
#define STORE 362
|
||
#define GETELEMENTPTR 363
|
||
#define TRUNC 364
|
||
#define ZEXT 365
|
||
#define SEXT 366
|
||
#define FPTRUNC 367
|
||
#define FPEXT 368
|
||
#define BITCAST 369
|
||
#define UITOFP 370
|
||
#define SITOFP 371
|
||
#define FPTOUI 372
|
||
#define FPTOSI 373
|
||
#define INTTOPTR 374
|
||
#define PTRTOINT 375
|
||
#define PHI_TOK 376
|
||
#define SELECT 377
|
||
#define SHL 378
|
||
#define LSHR 379
|
||
#define ASHR 380
|
||
#define VAARG 381
|
||
#define EXTRACTELEMENT 382
|
||
#define INSERTELEMENT 383
|
||
#define SHUFFLEVECTOR 384
|
||
#define NORETURN 385
|
||
#define DEFAULT 386
|
||
#define HIDDEN 387
|
||
|
||
|
||
|
||
|
||
/* Copy the first part of user declarations. */
|
||
#line 14 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
|
||
#include "ParserInternals.h"
|
||
#include "llvm/CallingConv.h"
|
||
#include "llvm/InlineAsm.h"
|
||
#include "llvm/Instructions.h"
|
||
#include "llvm/Module.h"
|
||
#include "llvm/SymbolTable.h"
|
||
#include "llvm/Support/GetElementPtrTypeIterator.h"
|
||
#include "llvm/Support/CommandLine.h"
|
||
#include "llvm/ADT/STLExtras.h"
|
||
#include "llvm/Support/MathExtras.h"
|
||
#include "llvm/Support/Streams.h"
|
||
#include <algorithm>
|
||
#include <list>
|
||
#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(std::map<const Type *,ValueList> &LateResolvers,
|
||
std::map<const Type *,ValueList> *FutureLateResolvers = 0);
|
||
|
||
static struct PerModuleInfo {
|
||
Module *CurrentModule;
|
||
std::map<const Type *, ValueList> Values; // Module level numbered definitions
|
||
std::map<const Type *,ValueList> LateResolveValues;
|
||
std::vector<PATypeHolder> Types;
|
||
std::map<ValID, PATypeHolder> LateResolveTypes;
|
||
|
||
/// PlaceHolderInfo - When temporary placeholder objects are created, remember
|
||
/// how they were referenced and on which line of the input they came from so
|
||
/// that we can resolve them later and print error messages as appropriate.
|
||
std::map<Value*, std::pair<ValID, int> > PlaceHolderInfo;
|
||
|
||
// GlobalRefs - This maintains a mapping between <Type, ValID>'s and forward
|
||
// references to global values. Global values may be referenced before they
|
||
// are defined, and if so, the temporary object that they represent is held
|
||
// here. This is used for forward references of GlobalValues.
|
||
//
|
||
typedef std::map<std::pair<const PointerType *,
|
||
ValID>, GlobalValue*> GlobalRefsType;
|
||
GlobalRefsType GlobalRefs;
|
||
|
||
void ModuleDone() {
|
||
// If we could not resolve some functions at function compilation time
|
||
// (calls to functions before they are defined), resolve them now... Types
|
||
// are resolved when the constant pool has been completely parsed.
|
||
//
|
||
ResolveDefinitions(LateResolveValues);
|
||
if (TriggerError)
|
||
return;
|
||
|
||
// Check to make sure that all global value forward references have been
|
||
// resolved!
|
||
//
|
||
if (!GlobalRefs.empty()) {
|
||
std::string UndefinedReferences = "Unresolved global references exist:\n";
|
||
|
||
for (GlobalRefsType::iterator I = GlobalRefs.begin(), E =GlobalRefs.end();
|
||
I != E; ++I) {
|
||
UndefinedReferences += " " + I->first.first->getDescription() + " " +
|
||
I->first.second.getName() + "\n";
|
||
}
|
||
GenerateError(UndefinedReferences);
|
||
return;
|
||
}
|
||
|
||
Values.clear(); // Clear out function local definitions
|
||
Types.clear();
|
||
CurrentModule = 0;
|
||
}
|
||
|
||
// GetForwardRefForGlobal - Check to see if there is a forward reference
|
||
// for this global. If so, remove it from the GlobalRefs map and return it.
|
||
// If not, just return null.
|
||
GlobalValue *GetForwardRefForGlobal(const PointerType *PTy, ValID ID) {
|
||
// Check to see if there is a forward reference to this global variable...
|
||
// if there is, eliminate it and patch the reference to use the new def'n.
|
||
GlobalRefsType::iterator I = GlobalRefs.find(std::make_pair(PTy, ID));
|
||
GlobalValue *Ret = 0;
|
||
if (I != GlobalRefs.end()) {
|
||
Ret = I->second;
|
||
GlobalRefs.erase(I);
|
||
}
|
||
return Ret;
|
||
}
|
||
|
||
bool TypeIsUnresolved(PATypeHolder* PATy) {
|
||
// If it isn't abstract, its resolved
|
||
const Type* Ty = PATy->get();
|
||
if (!Ty->isAbstract())
|
||
return false;
|
||
// Traverse the type looking for abstract types. If it isn't abstract then
|
||
// we don't need to traverse that leg of the type.
|
||
std::vector<const Type*> WorkList, SeenList;
|
||
WorkList.push_back(Ty);
|
||
while (!WorkList.empty()) {
|
||
const Type* Ty = WorkList.back();
|
||
SeenList.push_back(Ty);
|
||
WorkList.pop_back();
|
||
if (const OpaqueType* OpTy = dyn_cast<OpaqueType>(Ty)) {
|
||
// Check to see if this is an unresolved type
|
||
std::map<ValID, PATypeHolder>::iterator I = LateResolveTypes.begin();
|
||
std::map<ValID, PATypeHolder>::iterator E = LateResolveTypes.end();
|
||
for ( ; I != E; ++I) {
|
||
if (I->second.get() == OpTy)
|
||
return true;
|
||
}
|
||
} else if (const SequentialType* SeqTy = dyn_cast<SequentialType>(Ty)) {
|
||
const Type* TheTy = SeqTy->getElementType();
|
||
if (TheTy->isAbstract() && TheTy != Ty) {
|
||
std::vector<const Type*>::iterator I = SeenList.begin(),
|
||
E = SeenList.end();
|
||
for ( ; I != E; ++I)
|
||
if (*I == TheTy)
|
||
break;
|
||
if (I == E)
|
||
WorkList.push_back(TheTy);
|
||
}
|
||
} else if (const StructType* StrTy = dyn_cast<StructType>(Ty)) {
|
||
for (unsigned i = 0; i < StrTy->getNumElements(); ++i) {
|
||
const Type* TheTy = StrTy->getElementType(i);
|
||
if (TheTy->isAbstract() && TheTy != Ty) {
|
||
std::vector<const Type*>::iterator I = SeenList.begin(),
|
||
E = SeenList.end();
|
||
for ( ; I != E; ++I)
|
||
if (*I == TheTy)
|
||
break;
|
||
if (I == E)
|
||
WorkList.push_back(TheTy);
|
||
}
|
||
}
|
||
}
|
||
}
|
||
return false;
|
||
}
|
||
|
||
|
||
} CurModule;
|
||
|
||
static struct PerFunctionInfo {
|
||
Function *CurrentFunction; // Pointer to current function being created
|
||
|
||
std::map<const Type*, ValueList> Values; // Keep track of #'d definitions
|
||
std::map<const Type*, ValueList> LateResolveValues;
|
||
bool isDeclare; // Is this function a forward declararation?
|
||
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<BasicBlock*, std::pair<ValID, int> > BBForwardRefs;
|
||
std::vector<BasicBlock*> NumberedBlocks;
|
||
unsigned NextBBNum;
|
||
|
||
inline PerFunctionInfo() {
|
||
CurrentFunction = 0;
|
||
isDeclare = false;
|
||
Linkage = GlobalValue::ExternalLinkage;
|
||
Visibility = GlobalValue::DefaultVisibility;
|
||
}
|
||
|
||
inline void FunctionStart(Function *M) {
|
||
CurrentFunction = M;
|
||
NextBBNum = 0;
|
||
}
|
||
|
||
void FunctionDone() {
|
||
NumberedBlocks.clear();
|
||
|
||
// Any forward referenced blocks left?
|
||
if (!BBForwardRefs.empty()) {
|
||
GenerateError("Undefined reference to label " +
|
||
BBForwardRefs.begin()->first->getName());
|
||
return;
|
||
}
|
||
|
||
// Resolve all forward references now.
|
||
ResolveDefinitions(LateResolveValues, &CurModule.LateResolveValues);
|
||
|
||
Values.clear(); // Clear out function local definitions
|
||
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 int InsertValue(Value *V,
|
||
std::map<const Type*,ValueList> &ValueTab = CurFun.Values) {
|
||
if (V->hasName()) return -1; // Is this a numbered definition?
|
||
|
||
// Yes, insert the value into the value table...
|
||
ValueList &List = ValueTab[V->getType()];
|
||
List.push_back(V);
|
||
return List.size()-1;
|
||
}
|
||
|
||
static const Type *getTypeVal(const ValID &D, bool DoNotImprovise = false) {
|
||
switch (D.Type) {
|
||
case ValID::NumberVal: // Is it a numbered definition?
|
||
// Module constants occupy the lowest numbered slots...
|
||
if ((unsigned)D.Num < CurModule.Types.size())
|
||
return CurModule.Types[(unsigned)D.Num];
|
||
break;
|
||
case ValID::NameVal: // Is it a named definition?
|
||
if (const Type *N = CurModule.CurrentModule->getTypeByName(D.Name)) {
|
||
D.destroy(); // Free old strdup'd memory...
|
||
return N;
|
||
}
|
||
break;
|
||
default:
|
||
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::NameVal) {
|
||
GenerateError("Reference to an undefined type: '" + D.getName() + "'");
|
||
return 0;
|
||
} else {
|
||
GenerateError("Reference to an undefined type: #" + itostr(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;
|
||
}
|
||
|
||
static Value *lookupInSymbolTable(const Type *Ty, const std::string &Name) {
|
||
SymbolTable &SymTab =
|
||
inFunctionScope() ? CurFun.CurrentFunction->getValueSymbolTable() :
|
||
CurModule.CurrentModule->getValueSymbolTable();
|
||
return SymTab.lookup(Ty, Name);
|
||
}
|
||
|
||
// getValNonImprovising - Look up the value specified by the provided type and
|
||
// the provided ValID. If the value exists and has already been defined, return
|
||
// it. Otherwise return null.
|
||
//
|
||
static Value *getValNonImprovising(const Type *Ty, const ValID &D) {
|
||
if (isa<FunctionType>(Ty)) {
|
||
GenerateError("Functions are not values and "
|
||
"must be referenced as pointers");
|
||
return 0;
|
||
}
|
||
|
||
switch (D.Type) {
|
||
case ValID::NumberVal: { // Is it a numbered definition?
|
||
unsigned Num = (unsigned)D.Num;
|
||
|
||
// Module constants occupy the lowest numbered slots...
|
||
std::map<const Type*,ValueList>::iterator VI = CurModule.Values.find(Ty);
|
||
if (VI != CurModule.Values.end()) {
|
||
if (Num < VI->second.size())
|
||
return VI->second[Num];
|
||
Num -= VI->second.size();
|
||
}
|
||
|
||
// Make sure that our type is within bounds
|
||
VI = CurFun.Values.find(Ty);
|
||
if (VI == CurFun.Values.end()) return 0;
|
||
|
||
// Check that the number is within bounds...
|
||
if (VI->second.size() <= Num) return 0;
|
||
|
||
return VI->second[Num];
|
||
}
|
||
|
||
case ValID::NameVal: { // Is it a named definition?
|
||
Value *N = lookupInSymbolTable(Ty, std::string(D.Name));
|
||
if (N == 0) return 0;
|
||
|
||
D.destroy(); // Free old strdup'd memory...
|
||
return N;
|
||
}
|
||
|
||
// Check to make sure that "Ty" is an integral type, and that our
|
||
// value will fit into the specified type...
|
||
case ValID::ConstSIntVal: // Is it a constant pool reference??
|
||
if (!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);
|
||
|
||
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);
|
||
}
|
||
} 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 getValNonImprovising, except that if a
|
||
// value is not already defined, it "improvises" by creating a placeholder var
|
||
// that looks and acts just like the requested variable. When the value is
|
||
// defined later, all uses of the placeholder variable are replaced with the
|
||
// real thing.
|
||
//
|
||
static Value *getVal(const Type *Ty, const ValID &ID) {
|
||
if (Ty == Type::LabelTy) {
|
||
GenerateError("Cannot use a basic block here");
|
||
return 0;
|
||
}
|
||
|
||
// See if the value has already been defined.
|
||
Value *V = getValNonImprovising(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...
|
||
//
|
||
V = new Argument(Ty);
|
||
|
||
// Remember where this forward reference came from. FIXME, shouldn't we try
|
||
// to recycle these things??
|
||
CurModule.PlaceHolderInfo.insert(std::make_pair(V, std::make_pair(ID,
|
||
llvmAsmlineno)));
|
||
|
||
if (inFunctionScope())
|
||
InsertValue(V, CurFun.LateResolveValues);
|
||
else
|
||
InsertValue(V, CurModule.LateResolveValues);
|
||
return V;
|
||
}
|
||
|
||
/// getBBVal - This is used for two purposes:
|
||
/// * If isDefinition is true, a new basic block with the specified ID is being
|
||
/// defined.
|
||
/// * If isDefinition is true, this is a reference to a basic block, which may
|
||
/// or may not be a forward reference.
|
||
///
|
||
static BasicBlock *getBBVal(const ValID &ID, bool isDefinition = false) {
|
||
assert(inFunctionScope() && "Can't get basic block at global scope!");
|
||
|
||
std::string Name;
|
||
BasicBlock *BB = 0;
|
||
switch (ID.Type) {
|
||
default:
|
||
GenerateError("Illegal label reference " + ID.getName());
|
||
return 0;
|
||
case ValID::NumberVal: // Is it a numbered definition?
|
||
if (unsigned(ID.Num) >= CurFun.NumberedBlocks.size())
|
||
CurFun.NumberedBlocks.resize(ID.Num+1);
|
||
BB = CurFun.NumberedBlocks[ID.Num];
|
||
break;
|
||
case ValID::NameVal: // Is it a named definition?
|
||
Name = ID.Name;
|
||
if (Value *N = CurFun.CurrentFunction->
|
||
getValueSymbolTable().lookup(Type::LabelTy, Name))
|
||
BB = cast<BasicBlock>(N);
|
||
break;
|
||
}
|
||
|
||
// See if the block has already been defined.
|
||
if (BB) {
|
||
// If this is the definition of the block, make sure the existing value was
|
||
// just a forward reference. If it was a forward reference, there will be
|
||
// an entry for it in the PlaceHolderInfo map.
|
||
if (isDefinition && !CurFun.BBForwardRefs.erase(BB)) {
|
||
// The existing value was a definition, not a forward reference.
|
||
GenerateError("Redefinition of label " + ID.getName());
|
||
return 0;
|
||
}
|
||
|
||
ID.destroy(); // Free strdup'd memory.
|
||
return BB;
|
||
}
|
||
|
||
// Otherwise this block has not been seen before.
|
||
BB = new BasicBlock("", CurFun.CurrentFunction);
|
||
if (ID.Type == ValID::NameVal) {
|
||
BB->setName(ID.Name);
|
||
} else {
|
||
CurFun.NumberedBlocks[ID.Num] = BB;
|
||
}
|
||
|
||
// If this is not a definition, keep track of it so we can use it as a forward
|
||
// reference.
|
||
if (!isDefinition) {
|
||
// Remember where this forward reference came from.
|
||
CurFun.BBForwardRefs[BB] = std::make_pair(ID, llvmAsmlineno);
|
||
} else {
|
||
// The forward declaration could have been inserted anywhere in the
|
||
// function: insert it into the correct place now.
|
||
CurFun.CurrentFunction->getBasicBlockList().remove(BB);
|
||
CurFun.CurrentFunction->getBasicBlockList().push_back(BB);
|
||
}
|
||
ID.destroy();
|
||
return BB;
|
||
}
|
||
|
||
|
||
//===----------------------------------------------------------------------===//
|
||
// Code to handle forward references in instructions
|
||
//===----------------------------------------------------------------------===//
|
||
//
|
||
// This code handles the late binding needed with statements that reference
|
||
// values not defined yet... for example, a forward branch, or the PHI node for
|
||
// a loop body.
|
||
//
|
||
// This keeps a table (CurFun.LateResolveValues) of all such forward references
|
||
// and back patchs after we are done.
|
||
//
|
||
|
||
// ResolveDefinitions - If we could not resolve some defs at parsing
|
||
// time (forward branches, phi functions for loops, etc...) resolve the
|
||
// defs now...
|
||
//
|
||
static void
|
||
ResolveDefinitions(std::map<const Type*,ValueList> &LateResolvers,
|
||
std::map<const Type*,ValueList> *FutureLateResolvers) {
|
||
// Loop over LateResolveDefs fixing up stuff that couldn't be resolved
|
||
for (std::map<const Type*,ValueList>::iterator LRI = LateResolvers.begin(),
|
||
E = LateResolvers.end(); LRI != E; ++LRI) {
|
||
ValueList &List = LRI->second;
|
||
while (!List.empty()) {
|
||
Value *V = List.back();
|
||
List.pop_back();
|
||
|
||
std::map<Value*, std::pair<ValID, int> >::iterator PHI =
|
||
CurModule.PlaceHolderInfo.find(V);
|
||
assert(PHI != CurModule.PlaceHolderInfo.end() && "Placeholder error!");
|
||
|
||
ValID &DID = PHI->second.first;
|
||
|
||
Value *TheRealValue = getValNonImprovising(LRI->first, DID);
|
||
if (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::NameVal) {
|
||
GenerateError("Reference to an invalid definition: '" +DID.getName()+
|
||
"' of type '" + V->getType()->getDescription() + "'",
|
||
PHI->second.second);
|
||
return;
|
||
} else {
|
||
GenerateError("Reference to an invalid definition: #" +
|
||
itostr(DID.Num) + " of type '" +
|
||
V->getType()->getDescription() + "'",
|
||
PHI->second.second);
|
||
return;
|
||
}
|
||
}
|
||
}
|
||
}
|
||
|
||
LateResolvers.clear();
|
||
}
|
||
|
||
// ResolveTypeTo - A brand new type was just declared. This means that (if
|
||
// name is not null) things referencing Name can be resolved. Otherwise, things
|
||
// refering to the number can be resolved. Do this now.
|
||
//
|
||
static void ResolveTypeTo(char *Name, const Type *ToTy) {
|
||
ValID D;
|
||
if (Name) D = ValID::create(Name);
|
||
else D = ValID::create((int)CurModule.Types.size());
|
||
|
||
std::map<ValID, PATypeHolder>::iterator I =
|
||
CurModule.LateResolveTypes.find(D);
|
||
if (I != CurModule.LateResolveTypes.end()) {
|
||
((DerivedType*)I->second.get())->refineAbstractTypeTo(ToTy);
|
||
CurModule.LateResolveTypes.erase(I);
|
||
}
|
||
}
|
||
|
||
// setValueName - Set the specified value to the name given. The name may be
|
||
// null potentially, in which case this is a noop. The string passed in is
|
||
// assumed to be a malloc'd string buffer, and is free'd by this function.
|
||
//
|
||
static void setValueName(Value *V, char *NameStr) {
|
||
if (NameStr) {
|
||
std::string Name(NameStr); // Copy string
|
||
free(NameStr); // Free old string
|
||
|
||
if (V->getType() == Type::VoidTy) {
|
||
GenerateError("Can't assign name '" + Name+"' to value with void type!");
|
||
return;
|
||
}
|
||
|
||
assert(inFunctionScope() && "Must be in function scope!");
|
||
SymbolTable &ST = CurFun.CurrentFunction->getValueSymbolTable();
|
||
if (ST.lookup(V->getType(), Name)) {
|
||
GenerateError("Redefinition of value '" + Name + "' of type '" +
|
||
V->getType()->getDescription() + "'!");
|
||
return;
|
||
}
|
||
|
||
// Set the name.
|
||
V->setName(Name);
|
||
}
|
||
}
|
||
|
||
/// ParseGlobalVariable - Handle parsing of a global. If Initializer is null,
|
||
/// this is a declaration, otherwise it is a definition.
|
||
static GlobalVariable *
|
||
ParseGlobalVariable(char *NameStr,
|
||
GlobalValue::LinkageTypes Linkage,
|
||
GlobalValue::VisibilityTypes Visibility,
|
||
bool isConstantGlobal, const Type *Ty,
|
||
Constant *Initializer) {
|
||
if (isa<FunctionType>(Ty)) {
|
||
GenerateError("Cannot declare global vars of function type!");
|
||
return 0;
|
||
}
|
||
|
||
const PointerType *PTy = PointerType::get(Ty);
|
||
|
||
std::string Name;
|
||
if (NameStr) {
|
||
Name = NameStr; // Copy string
|
||
free(NameStr); // Free old string
|
||
}
|
||
|
||
// See if this global value was forward referenced. If so, recycle the
|
||
// object.
|
||
ValID ID;
|
||
if (!Name.empty()) {
|
||
ID = ValID::create((char*)Name.c_str());
|
||
} else {
|
||
ID = ValID::create((int)CurModule.Values[PTy].size());
|
||
}
|
||
|
||
if (GlobalValue *FWGV = CurModule.GetForwardRefForGlobal(PTy, ID)) {
|
||
// Move the global to the end of the list, from whereever it was
|
||
// previously inserted.
|
||
GlobalVariable *GV = cast<GlobalVariable>(FWGV);
|
||
CurModule.CurrentModule->getGlobalList().remove(GV);
|
||
CurModule.CurrentModule->getGlobalList().push_back(GV);
|
||
GV->setInitializer(Initializer);
|
||
GV->setLinkage(Linkage);
|
||
GV->setVisibility(Visibility);
|
||
GV->setConstant(isConstantGlobal);
|
||
InsertValue(GV, CurModule.Values);
|
||
return GV;
|
||
}
|
||
|
||
// If this global has a name, check to see if there is already a definition
|
||
// of this global in the module. If so, it is an error.
|
||
if (!Name.empty()) {
|
||
// We are a simple redefinition of a value, check to see if it is defined
|
||
// the same as the old one.
|
||
if (CurModule.CurrentModule->getGlobalVariable(Name, Ty)) {
|
||
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);
|
||
GV->setVisibility(Visibility);
|
||
InsertValue(GV, CurModule.Values);
|
||
return GV;
|
||
}
|
||
|
||
// setTypeName - Set the specified type to the name given. The name may be
|
||
// null potentially, in which case this is a noop. The string passed in is
|
||
// assumed to be a malloc'd string buffer, and is freed by this function.
|
||
//
|
||
// This function returns true if the type has already been defined, but is
|
||
// allowed to be redefined in the specified context. If the name is a new name
|
||
// for the type plane, it is inserted and false is returned.
|
||
static bool setTypeName(const Type *T, char *NameStr) {
|
||
assert(!inFunctionScope() && "Can't give types function-local names!");
|
||
if (NameStr == 0) return false;
|
||
|
||
std::string Name(NameStr); // Copy string
|
||
free(NameStr); // Free old string
|
||
|
||
// We don't allow assigning names to void type
|
||
if (T == Type::VoidTy) {
|
||
GenerateError("Can't assign name '" + Name + "' to the void type!");
|
||
return false;
|
||
}
|
||
|
||
// Set the type name, checking for conflicts as we do so.
|
||
bool AlreadyExists = CurModule.CurrentModule->addTypeName(Name, T);
|
||
|
||
if (AlreadyExists) { // Inserting a name that is already defined???
|
||
const Type *Existing = CurModule.CurrentModule->getTypeByName(Name);
|
||
assert(Existing && "Conflict but no matching type?");
|
||
|
||
// There is only one case where this is allowed: when we are refining an
|
||
// opaque type. In this case, Existing will be an opaque type.
|
||
if (const OpaqueType *OpTy = dyn_cast<OpaqueType>(Existing)) {
|
||
// We ARE replacing an opaque type!
|
||
const_cast<OpaqueType*>(OpTy)->refineAbstractTypeTo(T);
|
||
return true;
|
||
}
|
||
|
||
// Otherwise, this is an attempt to redefine a type. That's okay if
|
||
// the redefinition is identical to the original. This will be so if
|
||
// Existing and T point to the same Type object. In this one case we
|
||
// allow the equivalent redefinition.
|
||
if (Existing == T) return true; // Yes, it's equal.
|
||
|
||
// Any other kind of (non-equivalent) redefinition is an error.
|
||
GenerateError("Redefinition of type named '" + Name + "' of type '" +
|
||
T->getDescription() + "'!");
|
||
}
|
||
|
||
return false;
|
||
}
|
||
|
||
//===----------------------------------------------------------------------===//
|
||
// Code for handling upreferences in type names...
|
||
//
|
||
|
||
// TypeContains - Returns true if Ty directly contains E in it.
|
||
//
|
||
static bool TypeContains(const Type *Ty, const Type *E) {
|
||
return std::find(Ty->subtype_begin(), Ty->subtype_end(),
|
||
E) != Ty->subtype_end();
|
||
}
|
||
|
||
namespace {
|
||
struct UpRefRecord {
|
||
// NestingLevel - The number of nesting levels that need to be popped before
|
||
// this type is resolved.
|
||
unsigned NestingLevel;
|
||
|
||
// LastContainedTy - This is the type at the current binding level for the
|
||
// type. Every time we reduce the nesting level, this gets updated.
|
||
const Type *LastContainedTy;
|
||
|
||
// UpRefTy - This is the actual opaque type that the upreference is
|
||
// represented with.
|
||
OpaqueType *UpRefTy;
|
||
|
||
UpRefRecord(unsigned NL, OpaqueType *URTy)
|
||
: NestingLevel(NL), LastContainedTy(URTy), UpRefTy(URTy) {}
|
||
};
|
||
}
|
||
|
||
// UpRefs - A list of the outstanding upreferences that need to be resolved.
|
||
static std::vector<UpRefRecord> UpRefs;
|
||
|
||
/// HandleUpRefs - Every time we finish a new layer of types, this function is
|
||
/// called. It loops through the UpRefs vector, which is a list of the
|
||
/// currently active types. For each type, if the up reference is contained in
|
||
/// the newly completed type, we decrement the level count. When the level
|
||
/// count reaches zero, the upreferenced type is the type that is passed in:
|
||
/// thus we can complete the cycle.
|
||
///
|
||
static PATypeHolder HandleUpRefs(const Type *ty) {
|
||
// If Ty isn't abstract, or if there are no up-references in it, then there is
|
||
// nothing to resolve here.
|
||
if (!ty->isAbstract() || UpRefs.empty()) return ty;
|
||
|
||
PATypeHolder Ty(ty);
|
||
UR_OUT("Type '" << Ty->getDescription() <<
|
||
"' newly formed. Resolving upreferences.\n" <<
|
||
UpRefs.size() << " upreferences active!\n");
|
||
|
||
// If we find any resolvable upreferences (i.e., those whose NestingLevel goes
|
||
// to zero), we resolve them all together before we resolve them to Ty. At
|
||
// the end of the loop, if there is anything to resolve to Ty, it will be in
|
||
// this variable.
|
||
OpaqueType *TypeToResolve = 0;
|
||
|
||
for (unsigned i = 0; i != UpRefs.size(); ++i) {
|
||
UR_OUT(" UR#" << i << " - TypeContains(" << Ty->getDescription() << ", "
|
||
<< UpRefs[i].second->getDescription() << ") = "
|
||
<< (TypeContains(Ty, UpRefs[i].second) ? "true" : "false") << "\n");
|
||
if (TypeContains(Ty, UpRefs[i].LastContainedTy)) {
|
||
// Decrement level of upreference
|
||
unsigned Level = --UpRefs[i].NestingLevel;
|
||
UpRefs[i].LastContainedTy = Ty;
|
||
UR_OUT(" Uplevel Ref Level = " << Level << "\n");
|
||
if (Level == 0) { // Upreference should be resolved!
|
||
if (!TypeToResolve) {
|
||
TypeToResolve = UpRefs[i].UpRefTy;
|
||
} else {
|
||
UR_OUT(" * Resolving upreference for "
|
||
<< UpRefs[i].second->getDescription() << "\n";
|
||
std::string OldName = UpRefs[i].UpRefTy->getDescription());
|
||
UpRefs[i].UpRefTy->refineAbstractTypeTo(TypeToResolve);
|
||
UR_OUT(" * Type '" << OldName << "' refined upreference to: "
|
||
<< (const void*)Ty << ", " << Ty->getDescription() << "\n");
|
||
}
|
||
UpRefs.erase(UpRefs.begin()+i); // Remove from upreference list...
|
||
--i; // Do not skip the next element...
|
||
}
|
||
}
|
||
}
|
||
|
||
if (TypeToResolve) {
|
||
UR_OUT(" * Resolving upreference for "
|
||
<< UpRefs[i].second->getDescription() << "\n";
|
||
std::string OldName = TypeToResolve->getDescription());
|
||
TypeToResolve->refineAbstractTypeTo(Ty);
|
||
}
|
||
|
||
return Ty;
|
||
}
|
||
|
||
//===----------------------------------------------------------------------===//
|
||
// RunVMAsmParser - Define an interface to this parser
|
||
//===----------------------------------------------------------------------===//
|
||
//
|
||
static Module* RunParser(Module * M);
|
||
|
||
Module *llvm::RunVMAsmParser(const std::string &Filename, FILE *F) {
|
||
set_scan_file(F);
|
||
|
||
CurFilename = Filename;
|
||
return RunParser(new Module(CurFilename));
|
||
}
|
||
|
||
Module *llvm::RunVMAsmParser(const char * AsmString, Module * M) {
|
||
set_scan_string(AsmString);
|
||
|
||
CurFilename = "from_memory";
|
||
if (M == NULL) {
|
||
return RunParser(new Module (CurFilename));
|
||
} else {
|
||
return RunParser(M);
|
||
}
|
||
}
|
||
|
||
|
||
|
||
/* Enabling traces. */
|
||
#ifndef YYDEBUG
|
||
# define YYDEBUG 0
|
||
#endif
|
||
|
||
/* Enabling verbose error messages. */
|
||
#ifdef YYERROR_VERBOSE
|
||
# undef YYERROR_VERBOSE
|
||
# define YYERROR_VERBOSE 1
|
||
#else
|
||
# define YYERROR_VERBOSE 0
|
||
#endif
|
||
|
||
#ifndef YYSTYPE
|
||
#line 883 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
typedef union {
|
||
llvm::Module *ModuleVal;
|
||
llvm::Function *FunctionVal;
|
||
llvm::BasicBlock *BasicBlockVal;
|
||
llvm::TerminatorInst *TermInstVal;
|
||
llvm::Instruction *InstVal;
|
||
llvm::Constant *ConstVal;
|
||
|
||
const llvm::Type *PrimType;
|
||
std::list<llvm::PATypeHolder> *TypeList;
|
||
llvm::PATypeHolder *TypeVal;
|
||
llvm::Value *ValueVal;
|
||
std::vector<llvm::Value*> *ValueList;
|
||
llvm::ArgListType *ArgList;
|
||
llvm::TypeWithAttrs TypeWithAttrs;
|
||
llvm::TypeWithAttrsList *TypeWithAttrsList;
|
||
llvm::ValueRefList *ValueRefList;
|
||
|
||
// Represent the RHS of PHI node
|
||
std::list<std::pair<llvm::Value*,
|
||
llvm::BasicBlock*> > *PHIList;
|
||
std::vector<std::pair<llvm::Constant*, llvm::BasicBlock*> > *JumpTable;
|
||
std::vector<llvm::Constant*> *ConstVector;
|
||
|
||
llvm::GlobalValue::LinkageTypes Linkage;
|
||
llvm::GlobalValue::VisibilityTypes Visibility;
|
||
llvm::FunctionType::ParameterAttributes ParamAttrs;
|
||
int64_t SInt64Val;
|
||
uint64_t UInt64Val;
|
||
int SIntVal;
|
||
unsigned UIntVal;
|
||
double FPVal;
|
||
bool BoolVal;
|
||
|
||
char *StrVal; // This memory is strdup'd!
|
||
llvm::ValID ValIDVal; // strdup'd memory maybe!
|
||
|
||
llvm::Instruction::BinaryOps BinaryOpVal;
|
||
llvm::Instruction::TermOps TermOpVal;
|
||
llvm::Instruction::MemoryOps MemOpVal;
|
||
llvm::Instruction::CastOps CastOpVal;
|
||
llvm::Instruction::OtherOps OtherOpVal;
|
||
llvm::Module::Endianness Endianness;
|
||
llvm::ICmpInst::Predicate IPredicate;
|
||
llvm::FCmpInst::Predicate FPredicate;
|
||
} yystype;
|
||
/* Line 188 of /usr/local/share/bison/yacc.c. */
|
||
#line 1262 "llvmAsmParser.tab.c"
|
||
# define YYSTYPE yystype
|
||
# define YYSTYPE_IS_TRIVIAL 1
|
||
#endif
|
||
|
||
#ifndef YYLTYPE
|
||
typedef struct yyltype
|
||
{
|
||
int first_line;
|
||
int first_column;
|
||
int last_line;
|
||
int last_column;
|
||
} yyltype;
|
||
# define YYLTYPE yyltype
|
||
# define YYLTYPE_IS_TRIVIAL 1
|
||
#endif
|
||
|
||
/* Copy the second part of user declarations. */
|
||
|
||
|
||
/* Line 213 of /usr/local/share/bison/yacc.c. */
|
||
#line 1283 "llvmAsmParser.tab.c"
|
||
|
||
#if ! defined (yyoverflow) || YYERROR_VERBOSE
|
||
|
||
/* The parser invokes alloca or malloc; define the necessary symbols. */
|
||
|
||
# if YYSTACK_USE_ALLOCA
|
||
# define YYSTACK_ALLOC alloca
|
||
# else
|
||
# ifndef YYSTACK_USE_ALLOCA
|
||
# if defined (alloca) || defined (_ALLOCA_H)
|
||
# define YYSTACK_ALLOC alloca
|
||
# else
|
||
# ifdef __GNUC__
|
||
# define YYSTACK_ALLOC __builtin_alloca
|
||
# endif
|
||
# endif
|
||
# endif
|
||
# endif
|
||
|
||
# ifdef YYSTACK_ALLOC
|
||
/* Pacify GCC's `empty if-body' warning. */
|
||
# define YYSTACK_FREE(Ptr) do { /* empty */; } while (0)
|
||
# else
|
||
# if defined (__STDC__) || defined (__cplusplus)
|
||
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
|
||
# define YYSIZE_T size_t
|
||
# endif
|
||
# define YYSTACK_ALLOC malloc
|
||
# define YYSTACK_FREE free
|
||
# endif
|
||
#endif /* ! defined (yyoverflow) || YYERROR_VERBOSE */
|
||
|
||
|
||
#if (! defined (yyoverflow) \
|
||
&& (! defined (__cplusplus) \
|
||
|| (YYLTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
|
||
|
||
/* A type that is properly aligned for any stack member. */
|
||
union yyalloc
|
||
{
|
||
short yyss;
|
||
YYSTYPE yyvs;
|
||
};
|
||
|
||
/* The size of the maximum gap between one aligned stack and the next. */
|
||
# define YYSTACK_GAP_MAX (sizeof (union yyalloc) - 1)
|
||
|
||
/* The size of an array large to enough to hold all stacks, each with
|
||
N elements. */
|
||
# define YYSTACK_BYTES(N) \
|
||
((N) * (sizeof (short) + sizeof (YYSTYPE)) \
|
||
+ YYSTACK_GAP_MAX)
|
||
|
||
/* Copy COUNT objects from FROM to TO. The source and destination do
|
||
not overlap. */
|
||
# ifndef YYCOPY
|
||
# if 1 < __GNUC__
|
||
# define YYCOPY(To, From, Count) \
|
||
__builtin_memcpy (To, From, (Count) * sizeof (*(From)))
|
||
# else
|
||
# define YYCOPY(To, From, Count) \
|
||
do \
|
||
{ \
|
||
register YYSIZE_T yyi; \
|
||
for (yyi = 0; yyi < (Count); yyi++) \
|
||
(To)[yyi] = (From)[yyi]; \
|
||
} \
|
||
while (0)
|
||
# endif
|
||
# endif
|
||
|
||
/* Relocate STACK from its old location to the new one. The
|
||
local variables YYSIZE and YYSTACKSIZE give the old and new number of
|
||
elements in the stack, and YYPTR gives the new location of the
|
||
stack. Advance YYPTR to a properly aligned location for the next
|
||
stack. */
|
||
# define YYSTACK_RELOCATE(Stack) \
|
||
do \
|
||
{ \
|
||
YYSIZE_T yynewbytes; \
|
||
YYCOPY (&yyptr->Stack, Stack, yysize); \
|
||
Stack = &yyptr->Stack; \
|
||
yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAX; \
|
||
yyptr += yynewbytes / sizeof (*yyptr); \
|
||
} \
|
||
while (0)
|
||
|
||
#endif
|
||
|
||
#if defined (__STDC__) || defined (__cplusplus)
|
||
typedef signed char yysigned_char;
|
||
#else
|
||
typedef short yysigned_char;
|
||
#endif
|
||
|
||
/* YYFINAL -- State number of the termination state. */
|
||
#define YYFINAL 36
|
||
#define YYLAST 1357
|
||
|
||
/* YYNTOKENS -- Number of terminals. */
|
||
#define YYNTOKENS 147
|
||
/* YYNNTS -- Number of nonterminals. */
|
||
#define YYNNTS 79
|
||
/* YYNRULES -- Number of rules. */
|
||
#define YYNRULES 285
|
||
/* YYNRULES -- Number of states. */
|
||
#define YYNSTATES 569
|
||
|
||
/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */
|
||
#define YYUNDEFTOK 2
|
||
#define YYMAXUTOK 387
|
||
|
||
#define YYTRANSLATE(X) \
|
||
((unsigned)(X) <= YYMAXUTOK ? yytranslate[X] : YYUNDEFTOK)
|
||
|
||
/* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */
|
||
static const unsigned char yytranslate[] =
|
||
{
|
||
0, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
137, 138, 135, 2, 134, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
142, 133, 143, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 139, 136, 141, 2, 2, 2, 2, 2, 146,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
140, 2, 2, 144, 2, 145, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 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
|
||
};
|
||
|
||
#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, 122, 123, 125, 127, 129, 131, 133, 135, 137,
|
||
139, 140, 142, 143, 145, 147, 148, 150, 152, 154,
|
||
156, 157, 159, 161, 163, 165, 167, 169, 172, 174,
|
||
176, 177, 180, 182, 184, 185, 188, 189, 192, 193,
|
||
197, 200, 201, 203, 204, 208, 210, 213, 215, 217,
|
||
219, 221, 223, 225, 228, 230, 233, 239, 245, 251,
|
||
257, 261, 264, 270, 275, 278, 280, 282, 284, 288,
|
||
290, 294, 296, 297, 299, 303, 308, 312, 316, 321,
|
||
326, 330, 337, 343, 346, 349, 352, 355, 358, 361,
|
||
364, 367, 370, 373, 380, 386, 395, 402, 409, 417,
|
||
425, 432, 439, 448, 457, 461, 463, 465, 467, 469,
|
||
470, 472, 475, 476, 480, 481, 485, 489, 491, 495,
|
||
499, 500, 507, 508, 516, 517, 525, 528, 532, 534,
|
||
536, 538, 542, 546, 550, 554, 558, 562, 564, 565,
|
||
567, 569, 571, 572, 578, 582, 584, 588, 590, 591,
|
||
601, 603, 605, 610, 612, 614, 617, 621, 622, 624,
|
||
626, 628, 630, 632, 634, 636, 638, 640, 644, 646,
|
||
652, 654, 656, 658, 660, 663, 666, 669, 673, 676,
|
||
677, 679, 682, 685, 689, 699, 709, 718, 733, 735,
|
||
737, 744, 750, 753, 760, 768, 772, 778, 779, 780,
|
||
784, 787, 789, 795, 801, 808, 815, 820, 825, 832,
|
||
837, 842, 849, 856, 859, 868, 870, 872, 873, 877,
|
||
884, 888, 895, 898, 903, 910
|
||
};
|
||
|
||
/* YYRHS -- A `-1'-separated list of the rules' RHS. */
|
||
static const short yyrhs[] =
|
||
{
|
||
185, 0, -1, 5, -1, 6, -1, 69, -1, 70,
|
||
-1, 71, -1, 72, -1, 73, -1, 74, -1, 75,
|
||
-1, 76, -1, 77, -1, 78, -1, 79, -1, 80,
|
||
-1, 109, -1, 110, -1, 111, -1, 112, -1, 113,
|
||
-1, 114, -1, 115, -1, 116, -1, 117, -1, 118,
|
||
-1, 119, -1, 120, -1, 123, -1, 124, -1, 125,
|
||
-1, 83, -1, 84, -1, 85, -1, 86, -1, 87,
|
||
-1, 88, -1, 89, -1, 90, -1, 91, -1, 92,
|
||
-1, 93, -1, 94, -1, 95, -1, 96, -1, 97,
|
||
-1, 98, -1, 99, -1, 100, -1, 101, -1, 102,
|
||
-1, 89, -1, 90, -1, 91, -1, 92, -1, 19,
|
||
-1, 20, -1, 9, -1, 10, -1, 11, -1, 198,
|
||
133, -1, -1, 33, -1, 35, -1, 34, -1, 36,
|
||
-1, 38, -1, 37, -1, 39, -1, 41, -1, -1,
|
||
132, -1, -1, 37, -1, 39, -1, -1, 33, -1,
|
||
34, -1, 35, -1, 38, -1, -1, 56, -1, 57,
|
||
-1, 58, -1, 59, -1, 60, -1, 61, -1, 55,
|
||
4, -1, 110, -1, 111, -1, -1, 165, 164, -1,
|
||
130, -1, 164, -1, -1, 167, 166, -1, -1, 48,
|
||
4, -1, -1, 134, 48, 4, -1, 27, 16, -1,
|
||
-1, 170, -1, -1, 134, 173, 172, -1, 170, -1,
|
||
48, 4, -1, 9, -1, 10, -1, 11, -1, 12,
|
||
-1, 40, -1, 174, -1, 175, 135, -1, 210, -1,
|
||
136, 4, -1, 175, 137, 179, 138, 167, -1, 8,
|
||
137, 179, 138, 167, -1, 139, 4, 140, 175, 141,
|
||
-1, 142, 4, 140, 175, 143, -1, 144, 180, 145,
|
||
-1, 144, 145, -1, 142, 144, 180, 145, 143, -1,
|
||
142, 144, 145, 143, -1, 175, 165, -1, 175, -1,
|
||
8, -1, 176, -1, 178, 134, 176, -1, 178, -1,
|
||
178, 134, 30, -1, 30, -1, -1, 175, -1, 180,
|
||
134, 175, -1, 175, 139, 183, 141, -1, 175, 139,
|
||
141, -1, 175, 146, 16, -1, 175, 142, 183, 143,
|
||
-1, 175, 144, 183, 145, -1, 175, 144, 145, -1,
|
||
175, 142, 144, 183, 145, 143, -1, 175, 142, 144,
|
||
145, 143, -1, 175, 31, -1, 175, 32, -1, 175,
|
||
210, -1, 175, 182, -1, 175, 18, -1, 155, 3,
|
||
-1, 155, 4, -1, 9, 19, -1, 9, 20, -1,
|
||
156, 7, -1, 151, 137, 181, 29, 175, 138, -1,
|
||
108, 137, 181, 221, 138, -1, 122, 137, 181, 134,
|
||
181, 134, 181, 138, -1, 149, 137, 181, 134, 181,
|
||
138, -1, 150, 137, 181, 134, 181, 138, -1, 81,
|
||
153, 137, 181, 134, 181, 138, -1, 82, 154, 137,
|
||
181, 134, 181, 138, -1, 152, 137, 181, 134, 181,
|
||
138, -1, 127, 137, 181, 134, 181, 138, -1, 128,
|
||
137, 181, 134, 181, 134, 181, 138, -1, 129, 137,
|
||
181, 134, 181, 134, 181, 138, -1, 183, 134, 181,
|
||
-1, 181, -1, 25, -1, 26, -1, 186, -1, -1,
|
||
187, -1, 186, 187, -1, -1, 24, 188, 206, -1,
|
||
-1, 23, 189, 207, -1, 53, 52, 193, -1, 17,
|
||
-1, 157, 13, 175, -1, 157, 13, 8, -1, -1,
|
||
157, 160, 184, 181, 190, 172, -1, -1, 157, 158,
|
||
160, 184, 181, 191, 172, -1, -1, 157, 159, 160,
|
||
184, 175, 192, 172, -1, 42, 195, -1, 49, 133,
|
||
196, -1, 16, -1, 47, -1, 46, -1, 44, 133,
|
||
194, -1, 45, 133, 4, -1, 43, 133, 16, -1,
|
||
62, 133, 16, -1, 139, 197, 141, -1, 197, 134,
|
||
16, -1, 16, -1, -1, 14, -1, 16, -1, 198,
|
||
-1, -1, 200, 134, 175, 165, 199, -1, 175, 165,
|
||
199, -1, 200, -1, 200, 134, 30, -1, 30, -1,
|
||
-1, 163, 177, 198, 137, 201, 138, 167, 171, 168,
|
||
-1, 21, -1, 144, -1, 162, 160, 202, 203, -1,
|
||
22, -1, 145, -1, 213, 205, -1, 161, 160, 202,
|
||
-1, -1, 54, -1, 3, -1, 4, -1, 7, -1,
|
||
19, -1, 20, -1, 31, -1, 32, -1, 18, -1,
|
||
142, 183, 143, -1, 182, -1, 52, 208, 16, 134,
|
||
16, -1, 148, -1, 198, -1, 210, -1, 209, -1,
|
||
175, 211, -1, 213, 214, -1, 204, 214, -1, 215,
|
||
157, 216, -1, 215, 218, -1, -1, 15, -1, 63,
|
||
212, -1, 63, 8, -1, 64, 12, 211, -1, 64,
|
||
9, 211, 134, 12, 211, 134, 12, 211, -1, 65,
|
||
155, 211, 134, 12, 211, 139, 217, 141, -1, 65,
|
||
155, 211, 134, 12, 211, 139, 141, -1, 66, 163,
|
||
177, 211, 137, 220, 138, 167, 29, 12, 211, 67,
|
||
12, 211, -1, 67, -1, 68, -1, 217, 155, 209,
|
||
134, 12, 211, -1, 155, 209, 134, 12, 211, -1,
|
||
157, 223, -1, 175, 139, 211, 134, 211, 141, -1,
|
||
219, 134, 139, 211, 134, 211, 141, -1, 175, 211,
|
||
165, -1, 220, 134, 175, 211, 165, -1, -1, -1,
|
||
221, 134, 212, -1, 51, 50, -1, 50, -1, 149,
|
||
175, 211, 134, 211, -1, 150, 175, 211, 134, 211,
|
||
-1, 81, 153, 175, 211, 134, 211, -1, 82, 154,
|
||
175, 211, 134, 211, -1, 152, 212, 134, 212, -1,
|
||
151, 212, 29, 175, -1, 122, 212, 134, 212, 134,
|
||
212, -1, 126, 212, 134, 175, -1, 127, 212, 134,
|
||
212, -1, 128, 212, 134, 212, 134, 212, -1, 129,
|
||
212, 134, 212, 134, 212, -1, 121, 219, -1, 222,
|
||
163, 177, 211, 137, 220, 138, 167, -1, 225, -1,
|
||
28, -1, -1, 103, 175, 169, -1, 103, 175, 134,
|
||
9, 211, 169, -1, 104, 175, 169, -1, 104, 175,
|
||
134, 9, 211, 169, -1, 105, 212, -1, 224, 106,
|
||
175, 211, -1, 224, 107, 212, 134, 175, 211, -1,
|
||
108, 175, 211, 221, -1
|
||
};
|
||
|
||
/* YYRLINE[YYN] -- source line where rule number YYN was defined. */
|
||
static const unsigned short yyrline[] =
|
||
{
|
||
0, 1031, 1031, 1032, 1042, 1042, 1042, 1042, 1042, 1042,
|
||
1042, 1042, 1042, 1043, 1043, 1043, 1044, 1044, 1044, 1044,
|
||
1044, 1044, 1044, 1045, 1045, 1045, 1045, 1045, 1046, 1046,
|
||
1046, 1048, 1048, 1049, 1049, 1050, 1050, 1051, 1051, 1052,
|
||
1052, 1056, 1056, 1057, 1057, 1058, 1058, 1059, 1059, 1060,
|
||
1060, 1061, 1061, 1062, 1062, 1063, 1064, 1069, 1070, 1070,
|
||
1073, 1077, 1083, 1084, 1085, 1086, 1087, 1091, 1092, 1093,
|
||
1097, 1098, 1102, 1103, 1104, 1108, 1109, 1110, 1111, 1112,
|
||
1115, 1115, 1116, 1117, 1118, 1119, 1120, 1121, 1129, 1130,
|
||
1133, 1134, 1139, 1140, 1143, 1144, 1151, 1151, 1158, 1158,
|
||
1167, 1175, 1175, 1181, 1181, 1183, 1188, 1201, 1201, 1201,
|
||
1201, 1204, 1208, 1212, 1219, 1224, 1232, 1250, 1268, 1273,
|
||
1285, 1295, 1299, 1309, 1316, 1323, 1330, 1335, 1340, 1347,
|
||
1348, 1355, 1362, 1370, 1375, 1386, 1414, 1430, 1459, 1487,
|
||
1512, 1531, 1556, 1575, 1587, 1594, 1657, 1667, 1677, 1683,
|
||
1689, 1694, 1699, 1707, 1719, 1740, 1748, 1754, 1765, 1770,
|
||
1775, 1784, 1790, 1796, 1805, 1809, 1817, 1817, 1828, 1833,
|
||
1841, 1842, 1846, 1846, 1850, 1850, 1853, 1856, 1868, 1892,
|
||
1903, 1903, 1912, 1912, 1920, 1920, 1930, 1933, 1939, 1952,
|
||
1953, 1955, 1959, 1968, 1972, 1977, 1979, 1984, 1989, 1998,
|
||
1998, 1999, 1999, 2001, 2011, 2022, 2026, 2035, 2044, 2049,
|
||
2155, 2155, 2157, 2166, 2166, 2168, 2173, 2185, 2189, 2194,
|
||
2198, 2202, 2206, 2210, 2214, 2218, 2222, 2226, 2251, 2255,
|
||
2269, 2273, 2279, 2279, 2285, 2294, 2298, 2307, 2318, 2327,
|
||
2339, 2352, 2356, 2360, 2365, 2375, 2394, 2403, 2470, 2474,
|
||
2481, 2492, 2505, 2514, 2525, 2535, 2543, 2551, 2554, 2555,
|
||
2562, 2566, 2571, 2592, 2609, 2622, 2635, 2644, 2656, 2664,
|
||
2671, 2677, 2683, 2689, 2704, 2767, 2772, 2776, 2783, 2790,
|
||
2798, 2805, 2813, 2821, 2835, 2852
|
||
};
|
||
#endif
|
||
|
||
#if YYDEBUG || YYERROR_VERBOSE
|
||
/* YYTNME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
|
||
First, the terminals, then, starting at YYNTOKENS, nonterminals. */
|
||
static const char *const yytname[] =
|
||
{
|
||
"$end", "error", "$undefined", "ESINT64VAL", "EUINT64VAL", "SINTVAL",
|
||
"UINTVAL", "FPVAL", "VOID", "INTTYPE", "FLOAT", "DOUBLE", "LABEL",
|
||
"TYPE", "VAR_ID", "LABELSTR", "STRINGCONSTANT", "IMPLEMENTATION",
|
||
"ZEROINITIALIZER", "TRUETOK", "FALSETOK", "BEGINTOK", "ENDTOK",
|
||
"DECLARE", "DEFINE", "GLOBAL", "CONSTANT", "SECTION", "VOLATILE", "TO",
|
||
"DOTDOTDOT", "NULL_TOK", "UNDEF", "INTERNAL", "LINKONCE", "WEAK",
|
||
"APPENDING", "DLLIMPORT", "DLLEXPORT", "EXTERN_WEAK", "OPAQUE",
|
||
"EXTERNAL", "TARGET", "TRIPLE", "ENDIAN", "POINTERSIZE", "LITTLE",
|
||
"BIG", "ALIGN", "DEPLIBS", "CALL", "TAIL", "ASM_TOK", "MODULE",
|
||
"SIDEEFFECT", "CC_TOK", "CCC_TOK", "CSRETCC_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", "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", "SHL", "LSHR", "ASHR", "VAARG", "EXTRACTELEMENT",
|
||
"INSERTELEMENT", "SHUFFLEVECTOR", "NORETURN", "DEFAULT", "HIDDEN",
|
||
"'='", "','", "'*'", "'\\\\'", "'('", "')'", "'['", "'x'", "']'", "'<'",
|
||
"'>'", "'{'", "'}'", "'c'", "$accept", "INTVAL", "ArithmeticOps",
|
||
"LogicalOps", "CastOps", "ShiftOps", "IPredicates", "FPredicates",
|
||
"IntType", "FPType", "OptAssign", "GVInternalLinkage",
|
||
"GVExternalLinkage", "GVVisibilityStyle", "FunctionDeclareLinkage",
|
||
"FunctionDefineLinkage", "OptCallingConv", "ParamAttr", "OptParamAttrs",
|
||
"FuncAttr", "OptFuncAttrs", "OptAlign", "OptCAlign", "SectionString",
|
||
"OptSection", "GlobalVarAttributes", "GlobalVarAttribute", "PrimType",
|
||
"Types", "ArgType", "ResultTypes", "ArgTypeList", "ArgTypeListI",
|
||
"TypeListI", "ConstVal", "ConstExpr", "ConstVector", "GlobalType",
|
||
"Module", "DefinitionList", "Definition", "@1", "@2", "@3", "@4", "@5",
|
||
"AsmBlock", "BigOrLittle", "TargetDefinition", "LibrariesDefinition",
|
||
"LibList", "Name", "OptName", "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, 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, 147, 148, 148, 149, 149, 149, 149, 149, 149,
|
||
149, 149, 149, 150, 150, 150, 151, 151, 151, 151,
|
||
151, 151, 151, 151, 151, 151, 151, 151, 152, 152,
|
||
152, 153, 153, 153, 153, 153, 153, 153, 153, 153,
|
||
153, 154, 154, 154, 154, 154, 154, 154, 154, 154,
|
||
154, 154, 154, 154, 154, 154, 154, 155, 156, 156,
|
||
157, 157, 158, 158, 158, 158, 158, 159, 159, 159,
|
||
160, 160, 161, 161, 161, 162, 162, 162, 162, 162,
|
||
163, 163, 163, 163, 163, 163, 163, 163, 164, 164,
|
||
165, 165, 166, 166, 167, 167, 168, 168, 169, 169,
|
||
170, 171, 171, 172, 172, 173, 173, 174, 174, 174,
|
||
174, 175, 175, 175, 175, 175, 175, 175, 175, 175,
|
||
175, 175, 175, 175, 176, 177, 177, 178, 178, 179,
|
||
179, 179, 179, 180, 180, 181, 181, 181, 181, 181,
|
||
181, 181, 181, 181, 181, 181, 181, 181, 181, 181,
|
||
181, 181, 181, 182, 182, 182, 182, 182, 182, 182,
|
||
182, 182, 182, 182, 183, 183, 184, 184, 185, 185,
|
||
186, 186, 188, 187, 189, 187, 187, 187, 187, 187,
|
||
190, 187, 191, 187, 192, 187, 187, 187, 193, 194,
|
||
194, 195, 195, 195, 195, 196, 197, 197, 197, 198,
|
||
198, 199, 199, 200, 200, 201, 201, 201, 201, 202,
|
||
203, 203, 204, 205, 205, 206, 207, 208, 208, 209,
|
||
209, 209, 209, 209, 209, 209, 209, 209, 209, 209,
|
||
210, 210, 211, 211, 212, 213, 213, 214, 215, 215,
|
||
215, 216, 216, 216, 216, 216, 216, 216, 216, 216,
|
||
217, 217, 218, 219, 219, 220, 220, 220, 221, 221,
|
||
222, 222, 223, 223, 223, 223, 223, 223, 223, 223,
|
||
223, 223, 223, 223, 223, 223, 224, 224, 225, 225,
|
||
225, 225, 225, 225, 225, 225
|
||
};
|
||
|
||
/* 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,
|
||
2, 0, 1, 1, 1, 1, 1, 1, 1, 1,
|
||
0, 1, 0, 1, 1, 0, 1, 1, 1, 1,
|
||
0, 1, 1, 1, 1, 1, 1, 2, 1, 1,
|
||
0, 2, 1, 1, 0, 2, 0, 2, 0, 3,
|
||
2, 0, 1, 0, 3, 1, 2, 1, 1, 1,
|
||
1, 1, 1, 2, 1, 2, 5, 5, 5, 5,
|
||
3, 2, 5, 4, 2, 1, 1, 1, 3, 1,
|
||
3, 1, 0, 1, 3, 4, 3, 3, 4, 4,
|
||
3, 6, 5, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 6, 5, 8, 6, 6, 7, 7,
|
||
6, 6, 8, 8, 3, 1, 1, 1, 1, 0,
|
||
1, 2, 0, 3, 0, 3, 3, 1, 3, 3,
|
||
0, 6, 0, 7, 0, 7, 2, 3, 1, 1,
|
||
1, 3, 3, 3, 3, 3, 3, 1, 0, 1,
|
||
1, 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, 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, 4, 6, 4,
|
||
4, 6, 6, 2, 8, 1, 1, 0, 3, 6,
|
||
3, 6, 2, 4, 6, 4
|
||
};
|
||
|
||
/* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state
|
||
STATE-NUM when YYTABLE doesn't specify something else to do. Zero
|
||
means the default is an error. */
|
||
static const unsigned short yydefact[] =
|
||
{
|
||
61, 199, 200, 177, 174, 172, 0, 0, 0, 70,
|
||
0, 61, 170, 0, 72, 75, 0, 0, 0, 0,
|
||
186, 0, 0, 0, 62, 64, 63, 65, 67, 66,
|
||
68, 69, 71, 70, 70, 0, 1, 171, 60, 73,
|
||
74, 70, 175, 76, 77, 78, 79, 70, 239, 173,
|
||
239, 0, 0, 0, 0, 198, 187, 188, 176, 2,
|
||
3, 179, 107, 108, 109, 110, 111, 0, 0, 0,
|
||
0, 230, 112, 178, 231, 114, 0, 0, 166, 167,
|
||
0, 80, 80, 240, 236, 61, 213, 214, 215, 235,
|
||
193, 190, 189, 191, 192, 194, 197, 0, 132, 115,
|
||
0, 0, 0, 0, 121, 133, 0, 113, 132, 0,
|
||
0, 107, 108, 109, 0, 0, 0, 180, 0, 81,
|
||
82, 83, 84, 85, 86, 0, 216, 0, 277, 238,
|
||
0, 195, 131, 90, 127, 129, 0, 0, 0, 0,
|
||
0, 0, 120, 0, 182, 184, 150, 151, 148, 149,
|
||
152, 147, 143, 144, 4, 5, 6, 7, 8, 9,
|
||
10, 11, 12, 13, 14, 15, 0, 0, 0, 16,
|
||
17, 18, 19, 20, 21, 22, 23, 24, 25, 26,
|
||
27, 0, 28, 29, 30, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 0, 0, 0, 146, 145, 103, 87,
|
||
126, 125, 0, 210, 211, 212, 276, 261, 0, 0,
|
||
0, 0, 80, 248, 249, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 237, 80, 252, 0, 275, 196, 124, 0, 94,
|
||
0, 0, 123, 0, 134, 94, 103, 103, 31, 32,
|
||
33, 34, 35, 36, 37, 38, 39, 40, 0, 55,
|
||
56, 51, 52, 53, 54, 41, 42, 43, 44, 45,
|
||
46, 47, 48, 49, 50, 0, 0, 0, 0, 0,
|
||
0, 136, 165, 0, 0, 0, 140, 0, 137, 0,
|
||
0, 0, 0, 0, 181, 0, 260, 242, 0, 241,
|
||
0, 0, 57, 0, 0, 0, 0, 98, 98, 282,
|
||
0, 0, 273, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 0, 0, 88, 89, 91, 130, 128,
|
||
117, 118, 119, 122, 116, 183, 185, 0, 0, 258,
|
||
0, 0, 0, 0, 0, 135, 121, 133, 0, 138,
|
||
139, 0, 0, 0, 0, 0, 0, 105, 103, 208,
|
||
219, 220, 221, 226, 222, 223, 224, 225, 217, 0,
|
||
228, 233, 232, 234, 0, 243, 0, 0, 0, 0,
|
||
0, 278, 0, 280, 258, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 0, 0, 0, 0, 0, 0, 92,
|
||
93, 95, 0, 0, 0, 0, 0, 0, 0, 164,
|
||
142, 0, 0, 0, 0, 0, 100, 106, 104, 207,
|
||
90, 205, 0, 218, 0, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 0, 285, 0, 0, 0, 269, 270,
|
||
0, 0, 0, 0, 267, 266, 0, 283, 0, 0,
|
||
0, 0, 154, 0, 0, 0, 0, 141, 0, 0,
|
||
0, 0, 202, 0, 94, 0, 227, 0, 0, 257,
|
||
0, 0, 98, 99, 98, 0, 0, 0, 0, 0,
|
||
262, 263, 257, 0, 0, 0, 259, 0, 161, 0,
|
||
0, 156, 157, 153, 160, 201, 204, 206, 90, 101,
|
||
0, 0, 0, 0, 0, 264, 265, 0, 279, 281,
|
||
0, 0, 268, 271, 272, 0, 284, 158, 159, 0,
|
||
0, 0, 202, 102, 96, 229, 0, 0, 90, 0,
|
||
94, 253, 0, 94, 155, 162, 163, 203, 0, 209,
|
||
0, 246, 0, 0, 255, 0, 0, 254, 274, 97,
|
||
244, 0, 245, 0, 90, 0, 0, 0, 256, 0,
|
||
0, 0, 0, 251, 0, 0, 250, 0, 247
|
||
};
|
||
|
||
/* YYDEFGOTO[NTERM-NUM]. */
|
||
static const short yydefgoto[] =
|
||
{
|
||
-1, 71, 192, 193, 194, 195, 258, 275, 114, 115,
|
||
9, 33, 34, 35, 41, 47, 125, 327, 237, 401,
|
||
330, 539, 381, 357, 524, 294, 358, 72, 116, 134,
|
||
202, 135, 136, 106, 282, 370, 283, 80, 10, 11,
|
||
12, 15, 14, 198, 246, 247, 58, 93, 20, 56,
|
||
97, 74, 496, 421, 422, 126, 205, 48, 88, 49,
|
||
42, 424, 371, 75, 373, 299, 50, 84, 85, 231,
|
||
543, 129, 312, 504, 404, 232, 233, 234, 235
|
||
};
|
||
|
||
/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
|
||
STATE-NUM. */
|
||
#define YYPACT_NINF -413
|
||
static const short yypact[] =
|
||
{
|
||
401, -413, -413, -413, -413, -413, 110, -107, 30, 67,
|
||
77, 527, -413, -43, 2, 238, -16, 8, 47, 84,
|
||
-413, -4, 132, 791, -413, -413, -413, -413, -413, -413,
|
||
-413, -413, -413, 91, 91, 149, -413, -413, -413, -413,
|
||
-413, 91, -413, -413, -413, -413, -413, 91, 147, -413,
|
||
20, 210, 208, 280, 226, 273, -413, -413, -413, -413,
|
||
-413, 160, -413, -413, -413, -413, -413, 295, 299, 3,
|
||
7, -413, -413, 140, -413, -413, 149, 149, -413, -413,
|
||
954, 192, 192, -413, -413, 184, -413, -413, -413, -413,
|
||
-413, -413, -413, -413, -413, -413, -413, -65, 549, -413,
|
||
167, 171, 22, 160, -413, 140, -81, -413, 549, 954,
|
||
1045, 95, 311, 312, 284, 313, 602, -413, 317, -413,
|
||
-413, -413, -413, -413, -413, 1125, -413, -7, 1228, -413,
|
||
306, -413, -413, 140, -413, 191, 193, 1045, 1045, 186,
|
||
-64, 1045, -413, 194, -413, 140, -413, -413, -413, -413,
|
||
-413, -413, -413, -413, -413, -413, -413, -413, -413, -413,
|
||
-413, -413, -413, -413, -413, -413, 251, 501, 207, -413,
|
||
-413, -413, -413, -413, -413, -413, -413, -413, -413, -413,
|
||
-413, 209, -413, -413, -413, 214, 215, 216, 49, 1138,
|
||
120, 314, 219, 222, 224, 225, -413, -413, 230, -413,
|
||
160, 140, 184, -413, -413, -413, -413, -413, 315, 1185,
|
||
175, 357, 192, -413, -413, 251, 501, 1045, 1045, 1045,
|
||
1045, 1045, 1045, 1045, 1045, 1045, 1045, 1045, 1045, 1045,
|
||
1045, -413, 192, -413, 195, -413, -413, 203, 693, -413,
|
||
126, 46, -413, 228, 140, -413, 230, 230, -413, -413,
|
||
-413, -413, -413, -413, -413, -413, -413, -413, 231, -413,
|
||
-413, -413, -413, -413, -413, -413, -413, -413, -413, -413,
|
||
-413, -413, -413, -413, -413, 235, 954, 954, 954, 954,
|
||
954, -413, -413, 29, 500, -24, -413, -27, -413, 954,
|
||
954, 954, 954, 39, -413, 241, -413, 160, 746, -413,
|
||
873, 873, -413, 873, 1125, 1045, 1045, 123, 159, -413,
|
||
746, 146, 233, 245, 248, 249, 250, 252, 746, 746,
|
||
356, 253, 1125, 1045, 1045, -413, -413, -413, -413, -413,
|
||
-18, -413, -413, -413, -18, -413, -413, 954, 954, -413,
|
||
254, 255, 256, 259, 954, -413, 262, 602, -12, -413,
|
||
-413, 265, 274, 367, 275, 391, 407, -413, 230, 774,
|
||
-413, -413, -413, -413, -413, -413, -413, -413, 358, 954,
|
||
-413, -413, -413, -413, 282, -413, 285, 873, 746, 746,
|
||
35, -413, 43, -413, -413, 873, 281, 1045, 1045, 1045,
|
||
1045, 1045, 289, 292, 1045, 1045, 873, 746, 293, -413,
|
||
-413, -413, 294, 301, -25, 954, 954, 954, 954, -413,
|
||
-413, 271, 954, 954, 1045, 954, -413, -413, -413, -413,
|
||
140, 302, 303, -413, 417, 25, 427, 428, 305, 310,
|
||
318, 873, 441, 873, 319, 322, 873, 323, 140, -413,
|
||
324, 325, 873, 873, 140, -413, 309, -413, 1045, 954,
|
||
954, 1045, -413, 326, 328, 327, 335, -413, 332, 333,
|
||
131, 336, 34, 1028, -413, 339, -413, 873, 873, 1045,
|
||
873, 873, 341, -413, 341, 873, 342, 1045, 1045, 1045,
|
||
-413, -413, 1045, 746, 340, 345, -413, 954, -413, 954,
|
||
954, -413, -413, -413, -413, -413, -413, -413, 140, 10,
|
||
431, 343, 346, 746, 63, -413, -413, 400, -413, -413,
|
||
338, 873, -413, -413, -413, 144, -413, -413, -413, 351,
|
||
352, 354, 34, -413, 403, -413, 472, -3, -413, 1045,
|
||
-413, -413, 355, -413, -413, -413, -413, -413, 489, -413,
|
||
873, -413, 1000, 15, 203, 746, 66, -413, -18, -413,
|
||
-413, 361, -413, 1000, -413, 485, 486, 368, 203, 873,
|
||
873, 491, 434, -413, 873, 492, -413, 873, -413
|
||
};
|
||
|
||
/* YYPGOTO[NTERM-NUM]. */
|
||
static const short yypgoto[] =
|
||
{
|
||
-413, -413, 379, 385, 389, 390, 304, 307, -210, -413,
|
||
439, -413, -413, 145, -413, -413, -192, -305, -412, -413,
|
||
-235, -413, -303, 26, -413, -201, -413, -413, -14, 288,
|
||
-255, -413, 420, 429, -58, -112, -187, 239, -413, -413,
|
||
518, -413, -413, -413, -413, -413, -413, -413, -413, -413,
|
||
-413, 0, 11, -413, -413, 448, -413, -413, -413, -413,
|
||
-413, -413, -403, -73, 103, -151, -413, 482, -413, -413,
|
||
-413, -413, -413, 53, 153, -413, -413, -413, -413
|
||
};
|
||
|
||
/* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If
|
||
positive, shift that token. If negative, reduce the rule which
|
||
number is the opposite. If zero, do what YYDEFACT says.
|
||
If YYTABLE_NINF, parse error. */
|
||
#define YYTABLE_NINF -170
|
||
static const short yytable[] =
|
||
{
|
||
13, 303, 285, 287, 196, 383, 302, 101, 462, 73,
|
||
334, 13, 59, 60, 203, 103, 62, 63, 64, 65,
|
||
304, 1, 117, 2, 302, 400, 21, 59, 60, 400,
|
||
103, 62, 63, 64, 65, 83, 1, 355, 2, 39,
|
||
322, 40, 86, 197, 431, 335, 336, 66, 1, 377,
|
||
2, 144, 433, 141, 59, 60, 105, 103, 111, 112,
|
||
113, 65, 66, 1, 142, 2, 355, 396, 309, 130,
|
||
141, 313, 314, 315, 316, 317, 131, 36, 320, 321,
|
||
23, 243, 22, 432, 133, 13, 522, 356, 105, 66,
|
||
38, 432, 325, 326, 133, 555, 145, 348, -57, -57,
|
||
24, 25, 26, 27, 28, 29, 30, 344, 31, 451,
|
||
344, 201, 399, 452, 146, 147, 544, 51, 350, 349,
|
||
325, 326, 344, 240, 241, 59, 60, 244, 103, 111,
|
||
112, 113, 65, 411, 1, 55, 2, 204, 541, 551,
|
||
399, 52, 558, 67, 325, 326, 68, 102, 57, 69,
|
||
557, 70, 104, 16, 17, 18, 552, 418, 67, 344,
|
||
66, 68, 83, 344, 69, 87, 70, 139, 466, 508,
|
||
345, 509, 19, 398, 78, 79, 325, 326, 76, 77,
|
||
53, 107, 425, 108, 300, 67, 81, 301, 68, 332,
|
||
281, 69, 82, 70, 400, 298, 399, 529, 1, 32,
|
||
2, 530, 295, 307, 308, 298, 310, 311, 298, 298,
|
||
298, 298, 298, 318, 319, 298, 298, 54, 339, 340,
|
||
341, 342, 343, 32, 133, 372, 90, 372, 372, 499,
|
||
372, 351, 352, 353, 354, 196, 437, 372, 439, 440,
|
||
441, 400, 95, 400, 445, 372, 372, 118, 119, 120,
|
||
121, 122, 123, 124, 91, 92, 67, 380, 107, 68,
|
||
108, 107, 69, 108, 70, 286, 107, 331, 108, 493,
|
||
347, 43, 44, 45, 197, 107, 46, 108, 529, 402,
|
||
403, 107, 533, 108, 94, 385, 409, 148, 149, 96,
|
||
201, 378, 379, 382, 107, 546, 108, 98, 548, 99,
|
||
486, 323, 324, 100, 372, 372, 372, 137, 201, 397,
|
||
298, 138, 372, 325, 326, 109, 110, 542, -58, -59,
|
||
150, 199, 236, 372, 372, 238, 512, 513, 514, 242,
|
||
288, 239, 245, 553, 248, 249, 250, 251, 252, 253,
|
||
254, 255, 256, 257, 276, 420, 277, 453, 454, 455,
|
||
456, 278, 279, 280, 458, 459, 289, 461, 372, 290,
|
||
372, 291, 292, 372, 293, 296, 302, 386, 337, 372,
|
||
372, 333, 338, 298, 438, 298, 298, 298, 359, 387,
|
||
444, 298, 388, 389, 390, 394, 391, 395, 405, 406,
|
||
407, 484, 485, 408, 372, 372, 414, 372, 372, 412,
|
||
460, -169, 372, 374, 375, 410, 376, 416, 413, 415,
|
||
372, 417, 423, 384, 457, 1, 426, 2, 3, 427,
|
||
436, 392, 393, 442, 4, 5, 443, 448, 449, 519,
|
||
372, 520, 521, 465, 483, 450, 463, 298, 372, 467,
|
||
468, 464, 469, 6, 470, 473, 482, 525, 432, 498,
|
||
7, 538, 471, 451, 8, 503, 475, 477, 478, 479,
|
||
487, 489, 495, 298, 298, 298, 488, 372, 503, 490,
|
||
491, 492, 372, 500, 494, 507, 511, 526, 517, 531,
|
||
428, 429, 430, 518, 540, 527, 372, 372, 435, 534,
|
||
535, 372, 536, 549, 372, 556, 547, 559, 560, 446,
|
||
447, 565, 561, 564, 567, 59, 60, 227, 103, 111,
|
||
112, 113, 65, 228, 1, 545, 2, 229, 230, 305,
|
||
259, 260, 495, 306, 128, 523, 329, -168, 143, 37,
|
||
127, 140, 89, 537, 472, 515, 474, 434, 0, 476,
|
||
66, 1, 0, 2, 3, 480, 481, 0, 0, 0,
|
||
4, 5, 0, 0, 59, 60, 0, 103, 62, 63,
|
||
64, 65, 0, 1, 0, 2, 0, 0, 0, 6,
|
||
501, 502, 0, 505, 506, 0, 7, 0, 510, 132,
|
||
8, 0, 0, 0, 0, 0, 516, 0, 0, 66,
|
||
261, 262, 263, 264, 265, 266, 267, 268, 269, 270,
|
||
271, 272, 273, 274, 0, 0, 528, 59, 60, 0,
|
||
0, 0, 0, 0, 532, 0, 1, 0, 2, 0,
|
||
151, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 152, 153, 0, 67, 0, 0, 68,
|
||
0, 0, 69, 550, 70, 346, 0, 0, 554, 0,
|
||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 0, 562, 563, 0, 0, 0, 566, 0, 0,
|
||
568, 154, 155, 156, 157, 158, 159, 160, 161, 162,
|
||
163, 164, 165, 166, 167, 67, 0, 0, 68, 0,
|
||
0, 69, 0, 70, 0, 0, 0, 0, 59, 60,
|
||
0, 103, 62, 63, 64, 65, 0, 1, 0, 2,
|
||
168, 169, 170, 171, 172, 173, 174, 175, 176, 177,
|
||
178, 179, 180, 328, 181, 182, 183, 184, 0, 185,
|
||
186, 187, 0, 66, 0, 0, 0, 107, 0, 108,
|
||
0, 188, 0, 0, 189, 0, 190, 0, 191, 360,
|
||
361, 59, 60, 362, 0, 0, 0, 0, 0, 0,
|
||
1, 0, 2, 0, 363, 364, 365, 0, 0, 0,
|
||
0, 0, 0, 0, 0, 0, 0, 366, 367, 59,
|
||
60, 0, 103, 62, 63, 64, 65, 0, 1, 0,
|
||
2, 0, 0, 0, 0, 0, 59, 60, 368, 61,
|
||
62, 63, 64, 65, 419, 1, 0, 2, 0, 0,
|
||
0, 0, 0, 0, 66, 154, 155, 156, 157, 158,
|
||
159, 160, 161, 162, 163, 164, 165, 166, 167, 67,
|
||
0, 66, 68, 0, 0, 69, 0, 70, 0, 0,
|
||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 0, 168, 169, 170, 171, 172, 173,
|
||
174, 175, 176, 177, 178, 179, 180, 0, 181, 182,
|
||
183, 184, 0, 185, 186, 187, 360, 361, 59, 60,
|
||
362, 107, 0, 108, 0, 0, 0, 1, 369, 2,
|
||
0, 363, 364, 365, 0, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 0, 366, 367, 0, 0, 0, 0,
|
||
67, 0, 0, 68, 0, 0, 69, 0, 70, 0,
|
||
0, 0, 0, 0, 0, 368, 0, 67, 0, 0,
|
||
68, 0, 0, 69, 0, 70, 0, 0, 0, 0,
|
||
0, 0, 154, 155, 156, 157, 158, 159, 160, 161,
|
||
162, 163, 164, 165, 166, 167, 0, 0, 0, 59,
|
||
60, 0, 103, 111, 112, 113, 65, 0, 1, 0,
|
||
2, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 168, 169, 170, 171, 172, 173, 174, 175, 176,
|
||
177, 178, 179, 180, 66, 181, 182, 183, 184, 0,
|
||
185, 186, 187, 360, 361, 0, 0, 362, 0, 0,
|
||
0, 0, 0, 0, 0, 369, 0, 0, 363, 364,
|
||
365, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 366, 367, 59, 60, 0, 103, 62, 63, 64,
|
||
65, 0, 1, 0, 2, 0, 0, 0, 0, 0,
|
||
59, 60, 368, 103, 62, 63, 64, 65, 497, 1,
|
||
0, 2, 0, 0, 0, 0, 0, 0, 66, 154,
|
||
155, 156, 157, 158, 159, 160, 161, 162, 163, 164,
|
||
165, 166, 167, 0, 0, 66, 0, 0, 0, 0,
|
||
67, 0, 0, 68, 0, 0, 69, 0, 70, 0,
|
||
0, 0, 0, 0, 0, 0, 0, 0, 168, 169,
|
||
170, 171, 172, 173, 174, 175, 176, 177, 178, 179,
|
||
180, 0, 181, 182, 183, 184, 0, 185, 186, 187,
|
||
59, 60, 0, 200, 62, 63, 64, 65, 0, 1,
|
||
0, 2, 369, 59, 60, 0, 103, 111, 112, 113,
|
||
65, 0, 1, 0, 2, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 0, 67, 66, 0, 68, 0, 0,
|
||
69, 0, 70, 0, 0, 0, 0, 0, 66, 0,
|
||
0, 67, 0, 0, 68, 0, 0, 69, 0, 70,
|
||
59, 60, 0, 297, 62, 63, 64, 65, 0, 1,
|
||
0, 2, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 0, 0, 66, 0, 0, 0, 0,
|
||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 0, 0, 0, 206, 0, 0, 0,
|
||
0, 67, 0, 0, 68, 0, 0, 69, 0, 70,
|
||
0, 0, 0, 0, 67, 0, 0, 68, 207, 208,
|
||
69, 0, 284, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 209, 210, 211, 212, 213, 214, 154, 155, 156,
|
||
157, 158, 159, 160, 161, 162, 163, 164, 165, 215,
|
||
216, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 67, 0, 0, 68, 0, 0, 69, 0, 70,
|
||
0, 217, 218, 219, 0, 0, 220, 169, 170, 171,
|
||
172, 173, 174, 175, 176, 177, 178, 179, 180, 221,
|
||
222, 182, 183, 184, 223, 224, 225, 226
|
||
};
|
||
|
||
static const short yycheck[] =
|
||
{
|
||
0, 211, 189, 190, 116, 308, 9, 4, 420, 23,
|
||
245, 11, 5, 6, 21, 8, 9, 10, 11, 12,
|
||
212, 14, 80, 16, 9, 330, 133, 5, 6, 334,
|
||
8, 9, 10, 11, 12, 15, 14, 27, 16, 37,
|
||
232, 39, 22, 116, 9, 246, 247, 40, 14, 304,
|
||
16, 109, 9, 134, 5, 6, 70, 8, 9, 10,
|
||
11, 12, 40, 14, 145, 16, 27, 322, 219, 134,
|
||
134, 222, 223, 224, 225, 226, 141, 0, 229, 230,
|
||
13, 145, 52, 48, 98, 85, 498, 48, 102, 40,
|
||
133, 48, 110, 111, 108, 29, 110, 284, 3, 4,
|
||
33, 34, 35, 36, 37, 38, 39, 134, 41, 134,
|
||
134, 125, 130, 138, 19, 20, 528, 133, 145, 143,
|
||
110, 111, 134, 137, 138, 5, 6, 141, 8, 9,
|
||
10, 11, 12, 145, 14, 139, 16, 144, 141, 542,
|
||
130, 133, 554, 136, 110, 111, 139, 144, 16, 142,
|
||
553, 144, 145, 43, 44, 45, 141, 358, 136, 134,
|
||
40, 139, 15, 134, 142, 145, 144, 145, 143, 472,
|
||
141, 474, 62, 324, 25, 26, 110, 111, 33, 34,
|
||
133, 135, 369, 137, 9, 136, 41, 12, 139, 143,
|
||
141, 142, 47, 144, 499, 209, 130, 134, 14, 132,
|
||
16, 138, 202, 217, 218, 219, 220, 221, 222, 223,
|
||
224, 225, 226, 227, 228, 229, 230, 133, 276, 277,
|
||
278, 279, 280, 132, 238, 298, 16, 300, 301, 464,
|
||
303, 289, 290, 291, 292, 347, 387, 310, 389, 390,
|
||
391, 546, 16, 548, 395, 318, 319, 55, 56, 57,
|
||
58, 59, 60, 61, 46, 47, 136, 134, 135, 139,
|
||
137, 135, 142, 137, 144, 145, 135, 141, 137, 138,
|
||
284, 33, 34, 35, 347, 135, 38, 137, 134, 337,
|
||
338, 135, 138, 137, 4, 139, 344, 3, 4, 16,
|
||
304, 305, 306, 134, 135, 530, 137, 137, 533, 4,
|
||
451, 106, 107, 4, 377, 378, 379, 140, 322, 323,
|
||
324, 140, 385, 110, 111, 76, 77, 527, 7, 7,
|
||
7, 4, 16, 396, 397, 134, 477, 478, 479, 143,
|
||
16, 138, 138, 543, 83, 84, 85, 86, 87, 88,
|
||
89, 90, 91, 92, 137, 359, 137, 405, 406, 407,
|
||
408, 137, 137, 137, 412, 413, 137, 415, 431, 137,
|
||
433, 137, 137, 436, 134, 50, 9, 134, 137, 442,
|
||
443, 143, 137, 387, 388, 389, 390, 391, 137, 134,
|
||
394, 395, 134, 134, 134, 29, 134, 134, 134, 134,
|
||
134, 449, 450, 134, 467, 468, 29, 470, 471, 134,
|
||
414, 0, 475, 300, 301, 143, 303, 16, 134, 134,
|
||
483, 4, 54, 310, 143, 14, 134, 16, 17, 134,
|
||
139, 318, 319, 134, 23, 24, 134, 134, 134, 487,
|
||
503, 489, 490, 16, 448, 134, 134, 451, 511, 12,
|
||
12, 138, 137, 42, 134, 4, 137, 16, 48, 463,
|
||
49, 48, 134, 134, 53, 469, 134, 134, 134, 134,
|
||
134, 134, 462, 477, 478, 479, 138, 540, 482, 134,
|
||
138, 138, 545, 134, 138, 134, 134, 134, 138, 141,
|
||
377, 378, 379, 138, 12, 139, 559, 560, 385, 138,
|
||
138, 564, 138, 4, 567, 134, 141, 12, 12, 396,
|
||
397, 67, 134, 12, 12, 5, 6, 128, 8, 9,
|
||
10, 11, 12, 128, 14, 529, 16, 128, 128, 215,
|
||
19, 20, 522, 216, 85, 499, 238, 0, 108, 11,
|
||
82, 102, 50, 522, 431, 482, 433, 384, -1, 436,
|
||
40, 14, -1, 16, 17, 442, 443, -1, -1, -1,
|
||
23, 24, -1, -1, 5, 6, -1, 8, 9, 10,
|
||
11, 12, -1, 14, -1, 16, -1, -1, -1, 42,
|
||
467, 468, -1, 470, 471, -1, 49, -1, 475, 30,
|
||
53, -1, -1, -1, -1, -1, 483, -1, -1, 40,
|
||
89, 90, 91, 92, 93, 94, 95, 96, 97, 98,
|
||
99, 100, 101, 102, -1, -1, 503, 5, 6, -1,
|
||
-1, -1, -1, -1, 511, -1, 14, -1, 16, -1,
|
||
18, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
||
-1, -1, -1, 31, 32, -1, 136, -1, -1, 139,
|
||
-1, -1, 142, 540, 144, 145, -1, -1, 545, -1,
|
||
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
||
-1, -1, 559, 560, -1, -1, -1, 564, -1, -1,
|
||
567, 69, 70, 71, 72, 73, 74, 75, 76, 77,
|
||
78, 79, 80, 81, 82, 136, -1, -1, 139, -1,
|
||
-1, 142, -1, 144, -1, -1, -1, -1, 5, 6,
|
||
-1, 8, 9, 10, 11, 12, -1, 14, -1, 16,
|
||
108, 109, 110, 111, 112, 113, 114, 115, 116, 117,
|
||
118, 119, 120, 30, 122, 123, 124, 125, -1, 127,
|
||
128, 129, -1, 40, -1, -1, -1, 135, -1, 137,
|
||
-1, 139, -1, -1, 142, -1, 144, -1, 146, 3,
|
||
4, 5, 6, 7, -1, -1, -1, -1, -1, -1,
|
||
14, -1, 16, -1, 18, 19, 20, -1, -1, -1,
|
||
-1, -1, -1, -1, -1, -1, -1, 31, 32, 5,
|
||
6, -1, 8, 9, 10, 11, 12, -1, 14, -1,
|
||
16, -1, -1, -1, -1, -1, 5, 6, 52, 8,
|
||
9, 10, 11, 12, 30, 14, -1, 16, -1, -1,
|
||
-1, -1, -1, -1, 40, 69, 70, 71, 72, 73,
|
||
74, 75, 76, 77, 78, 79, 80, 81, 82, 136,
|
||
-1, 40, 139, -1, -1, 142, -1, 144, -1, -1,
|
||
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
||
-1, -1, -1, -1, 108, 109, 110, 111, 112, 113,
|
||
114, 115, 116, 117, 118, 119, 120, -1, 122, 123,
|
||
124, 125, -1, 127, 128, 129, 3, 4, 5, 6,
|
||
7, 135, -1, 137, -1, -1, -1, 14, 142, 16,
|
||
-1, 18, 19, 20, -1, -1, -1, -1, -1, -1,
|
||
-1, -1, -1, -1, 31, 32, -1, -1, -1, -1,
|
||
136, -1, -1, 139, -1, -1, 142, -1, 144, -1,
|
||
-1, -1, -1, -1, -1, 52, -1, 136, -1, -1,
|
||
139, -1, -1, 142, -1, 144, -1, -1, -1, -1,
|
||
-1, -1, 69, 70, 71, 72, 73, 74, 75, 76,
|
||
77, 78, 79, 80, 81, 82, -1, -1, -1, 5,
|
||
6, -1, 8, 9, 10, 11, 12, -1, 14, -1,
|
||
16, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
||
-1, 108, 109, 110, 111, 112, 113, 114, 115, 116,
|
||
117, 118, 119, 120, 40, 122, 123, 124, 125, -1,
|
||
127, 128, 129, 3, 4, -1, -1, 7, -1, -1,
|
||
-1, -1, -1, -1, -1, 142, -1, -1, 18, 19,
|
||
20, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
||
-1, 31, 32, 5, 6, -1, 8, 9, 10, 11,
|
||
12, -1, 14, -1, 16, -1, -1, -1, -1, -1,
|
||
5, 6, 52, 8, 9, 10, 11, 12, 30, 14,
|
||
-1, 16, -1, -1, -1, -1, -1, -1, 40, 69,
|
||
70, 71, 72, 73, 74, 75, 76, 77, 78, 79,
|
||
80, 81, 82, -1, -1, 40, -1, -1, -1, -1,
|
||
136, -1, -1, 139, -1, -1, 142, -1, 144, -1,
|
||
-1, -1, -1, -1, -1, -1, -1, -1, 108, 109,
|
||
110, 111, 112, 113, 114, 115, 116, 117, 118, 119,
|
||
120, -1, 122, 123, 124, 125, -1, 127, 128, 129,
|
||
5, 6, -1, 8, 9, 10, 11, 12, -1, 14,
|
||
-1, 16, 142, 5, 6, -1, 8, 9, 10, 11,
|
||
12, -1, 14, -1, 16, -1, -1, -1, -1, -1,
|
||
-1, -1, -1, -1, 136, 40, -1, 139, -1, -1,
|
||
142, -1, 144, -1, -1, -1, -1, -1, 40, -1,
|
||
-1, 136, -1, -1, 139, -1, -1, 142, -1, 144,
|
||
5, 6, -1, 8, 9, 10, 11, 12, -1, 14,
|
||
-1, 16, -1, -1, -1, -1, -1, -1, -1, -1,
|
||
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
||
-1, -1, -1, -1, -1, 40, -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, 28, -1, -1, -1,
|
||
-1, 136, -1, -1, 139, -1, -1, 142, -1, 144,
|
||
-1, -1, -1, -1, 136, -1, -1, 139, 50, 51,
|
||
142, -1, 144, -1, -1, -1, -1, -1, -1, -1,
|
||
-1, 63, 64, 65, 66, 67, 68, 69, 70, 71,
|
||
72, 73, 74, 75, 76, 77, 78, 79, 80, 81,
|
||
82, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
||
-1, 136, -1, -1, 139, -1, -1, 142, -1, 144,
|
||
-1, 103, 104, 105, -1, -1, 108, 109, 110, 111,
|
||
112, 113, 114, 115, 116, 117, 118, 119, 120, 121,
|
||
122, 123, 124, 125, 126, 127, 128, 129
|
||
};
|
||
|
||
/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
|
||
symbol of state STATE-NUM. */
|
||
static const unsigned char yystos[] =
|
||
{
|
||
0, 14, 16, 17, 23, 24, 42, 49, 53, 157,
|
||
185, 186, 187, 198, 189, 188, 43, 44, 45, 62,
|
||
195, 133, 52, 13, 33, 34, 35, 36, 37, 38,
|
||
39, 41, 132, 158, 159, 160, 0, 187, 133, 37,
|
||
39, 161, 207, 33, 34, 35, 38, 162, 204, 206,
|
||
213, 133, 133, 133, 133, 139, 196, 16, 193, 5,
|
||
6, 8, 9, 10, 11, 12, 40, 136, 139, 142,
|
||
144, 148, 174, 175, 198, 210, 160, 160, 25, 26,
|
||
184, 160, 160, 15, 214, 215, 22, 145, 205, 214,
|
||
16, 46, 47, 194, 4, 16, 16, 197, 137, 4,
|
||
4, 4, 144, 8, 145, 175, 180, 135, 137, 184,
|
||
184, 9, 10, 11, 155, 156, 175, 181, 55, 56,
|
||
57, 58, 59, 60, 61, 163, 202, 202, 157, 218,
|
||
134, 141, 30, 175, 176, 178, 179, 140, 140, 145,
|
||
180, 134, 145, 179, 181, 175, 19, 20, 3, 4,
|
||
7, 18, 31, 32, 69, 70, 71, 72, 73, 74,
|
||
75, 76, 77, 78, 79, 80, 81, 82, 108, 109,
|
||
110, 111, 112, 113, 114, 115, 116, 117, 118, 119,
|
||
120, 122, 123, 124, 125, 127, 128, 129, 139, 142,
|
||
144, 146, 149, 150, 151, 152, 182, 210, 190, 4,
|
||
8, 175, 177, 21, 144, 203, 28, 50, 51, 63,
|
||
64, 65, 66, 67, 68, 81, 82, 103, 104, 105,
|
||
108, 121, 122, 126, 127, 128, 129, 149, 150, 151,
|
||
152, 216, 222, 223, 224, 225, 16, 165, 134, 138,
|
||
175, 175, 143, 145, 175, 138, 191, 192, 83, 84,
|
||
85, 86, 87, 88, 89, 90, 91, 92, 153, 19,
|
||
20, 89, 90, 91, 92, 93, 94, 95, 96, 97,
|
||
98, 99, 100, 101, 102, 154, 137, 137, 137, 137,
|
||
137, 141, 181, 183, 144, 183, 145, 183, 16, 137,
|
||
137, 137, 137, 134, 172, 198, 50, 8, 175, 212,
|
||
9, 12, 9, 155, 163, 153, 154, 175, 175, 212,
|
||
175, 175, 219, 212, 212, 212, 212, 212, 175, 175,
|
||
212, 212, 163, 106, 107, 110, 111, 164, 30, 176,
|
||
167, 141, 143, 143, 167, 172, 172, 137, 137, 181,
|
||
181, 181, 181, 181, 134, 141, 145, 175, 183, 143,
|
||
145, 181, 181, 181, 181, 27, 48, 170, 173, 137,
|
||
3, 4, 7, 18, 19, 20, 31, 32, 52, 142,
|
||
182, 209, 210, 211, 211, 211, 211, 177, 175, 175,
|
||
134, 169, 134, 169, 211, 139, 134, 134, 134, 134,
|
||
134, 134, 211, 211, 29, 134, 177, 175, 212, 130,
|
||
164, 166, 181, 181, 221, 134, 134, 134, 134, 181,
|
||
143, 145, 134, 134, 29, 134, 16, 4, 172, 30,
|
||
175, 200, 201, 54, 208, 183, 134, 134, 211, 211,
|
||
211, 9, 48, 9, 221, 211, 139, 212, 175, 212,
|
||
212, 212, 134, 134, 175, 212, 211, 211, 134, 134,
|
||
134, 134, 138, 181, 181, 181, 181, 143, 181, 181,
|
||
175, 181, 165, 134, 138, 16, 143, 12, 12, 137,
|
||
134, 134, 211, 4, 211, 134, 211, 134, 134, 134,
|
||
211, 211, 137, 175, 181, 181, 212, 134, 138, 134,
|
||
134, 138, 138, 138, 138, 198, 199, 30, 175, 167,
|
||
134, 211, 211, 175, 220, 211, 211, 134, 169, 169,
|
||
211, 134, 212, 212, 212, 220, 211, 138, 138, 181,
|
||
181, 181, 165, 170, 171, 16, 134, 139, 211, 134,
|
||
138, 141, 211, 138, 138, 138, 138, 199, 48, 168,
|
||
12, 141, 155, 217, 165, 175, 167, 141, 167, 4,
|
||
211, 209, 141, 155, 211, 29, 134, 209, 165, 12,
|
||
12, 134, 211, 211, 12, 67, 211, 12, 211
|
||
};
|
||
|
||
#if ! defined (YYSIZE_T) && defined (__SIZE_TYPE__)
|
||
# define YYSIZE_T __SIZE_TYPE__
|
||
#endif
|
||
#if ! defined (YYSIZE_T) && defined (size_t)
|
||
# define YYSIZE_T size_t
|
||
#endif
|
||
#if ! defined (YYSIZE_T)
|
||
# if defined (__STDC__) || defined (__cplusplus)
|
||
# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
|
||
# define YYSIZE_T size_t
|
||
# endif
|
||
#endif
|
||
#if ! defined (YYSIZE_T)
|
||
# define YYSIZE_T unsigned int
|
||
#endif
|
||
|
||
#define yyerrok (yyerrstatus = 0)
|
||
#define yyclearin (yychar = YYEMPTY)
|
||
#define YYEMPTY -2
|
||
#define YYEOF 0
|
||
|
||
#define YYACCEPT goto yyacceptlab
|
||
#define YYABORT goto yyabortlab
|
||
#define YYERROR goto yyerrlab1
|
||
|
||
/* Like YYERROR except do call yyerror. This remains here temporarily
|
||
to ease the transition to the new meaning of YYERROR, for GCC.
|
||
Once GCC version 2 has supplanted version 1, this can go. */
|
||
|
||
#define YYFAIL goto yyerrlab
|
||
|
||
#define YYRECOVERING() (!!yyerrstatus)
|
||
|
||
#define YYBACKUP(Token, Value) \
|
||
do \
|
||
if (yychar == YYEMPTY && yylen == 1) \
|
||
{ \
|
||
yychar = (Token); \
|
||
yylval = (Value); \
|
||
yychar1 = YYTRANSLATE (yychar); \
|
||
YYPOPSTACK; \
|
||
goto yybackup; \
|
||
} \
|
||
else \
|
||
{ \
|
||
yyerror ("syntax error: cannot back up"); \
|
||
YYERROR; \
|
||
} \
|
||
while (0)
|
||
|
||
#define YYTERROR 1
|
||
#define YYERRCODE 256
|
||
|
||
/* YYLLOC_DEFAULT -- Compute the default location (before the actions
|
||
are run). */
|
||
|
||
#ifndef YYLLOC_DEFAULT
|
||
# define YYLLOC_DEFAULT(Current, Rhs, N) \
|
||
Current.first_line = Rhs[1].first_line; \
|
||
Current.first_column = Rhs[1].first_column; \
|
||
Current.last_line = Rhs[N].last_line; \
|
||
Current.last_column = Rhs[N].last_column;
|
||
#endif
|
||
|
||
/* YYLEX -- calling `yylex' with the right arguments. */
|
||
|
||
#define YYLEX yylex ()
|
||
|
||
/* Enable debugging if requested. */
|
||
#if YYDEBUG
|
||
|
||
# ifndef YYFPRINTF
|
||
# include <stdio.h> /* INFRINGES ON USER NAME SPACE */
|
||
# define YYFPRINTF fprintf
|
||
# endif
|
||
|
||
# define YYDPRINTF(Args) \
|
||
do { \
|
||
if (yydebug) \
|
||
YYFPRINTF Args; \
|
||
} while (0)
|
||
# define YYDSYMPRINT(Args) \
|
||
do { \
|
||
if (yydebug) \
|
||
yysymprint Args; \
|
||
} while (0)
|
||
/* Nonzero means print parse trace. It is left uninitialized so that
|
||
multiple parsers can coexist. */
|
||
int yydebug;
|
||
#else /* !YYDEBUG */
|
||
# define YYDPRINTF(Args)
|
||
# define YYDSYMPRINT(Args)
|
||
#endif /* !YYDEBUG */
|
||
|
||
/* YYINITDEPTH -- initial size of the parser's stacks. */
|
||
#ifndef YYINITDEPTH
|
||
# define YYINITDEPTH 200
|
||
#endif
|
||
|
||
/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
|
||
if the built-in stack extension method is used).
|
||
|
||
Do not make this value too large; the results are undefined if
|
||
SIZE_MAX < YYSTACK_BYTES (YYMAXDEPTH)
|
||
evaluated with infinite-precision integer arithmetic. */
|
||
|
||
#if YYMAXDEPTH == 0
|
||
# undef YYMAXDEPTH
|
||
#endif
|
||
|
||
#ifndef YYMAXDEPTH
|
||
# define YYMAXDEPTH 10000
|
||
#endif
|
||
|
||
|
||
|
||
#if YYERROR_VERBOSE
|
||
|
||
# ifndef yystrlen
|
||
# if defined (__GLIBC__) && defined (_STRING_H)
|
||
# define yystrlen strlen
|
||
# else
|
||
/* Return the length of YYSTR. */
|
||
static YYSIZE_T
|
||
# if defined (__STDC__) || defined (__cplusplus)
|
||
yystrlen (const char *yystr)
|
||
# else
|
||
yystrlen (yystr)
|
||
const char *yystr;
|
||
# endif
|
||
{
|
||
register const char *yys = yystr;
|
||
|
||
while (*yys++ != '\0')
|
||
continue;
|
||
|
||
return yys - yystr - 1;
|
||
}
|
||
# endif
|
||
# endif
|
||
|
||
# ifndef yystpcpy
|
||
# if defined (__GLIBC__) && defined (_STRING_H) && defined (_GNU_SOURCE)
|
||
# define yystpcpy stpcpy
|
||
# else
|
||
/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in
|
||
YYDEST. */
|
||
static char *
|
||
# if defined (__STDC__) || defined (__cplusplus)
|
||
yystpcpy (char *yydest, const char *yysrc)
|
||
# else
|
||
yystpcpy (yydest, yysrc)
|
||
char *yydest;
|
||
const char *yysrc;
|
||
# endif
|
||
{
|
||
register char *yyd = yydest;
|
||
register const char *yys = yysrc;
|
||
|
||
while ((*yyd++ = *yys++) != '\0')
|
||
continue;
|
||
|
||
return yyd - 1;
|
||
}
|
||
# endif
|
||
# endif
|
||
|
||
#endif /* !YYERROR_VERBOSE */
|
||
|
||
|
||
|
||
#if YYDEBUG
|
||
/*-----------------------------.
|
||
| Print this symbol on YYOUT. |
|
||
`-----------------------------*/
|
||
|
||
static void
|
||
#if defined (__STDC__) || defined (__cplusplus)
|
||
yysymprint (FILE* yyout, int yytype, YYSTYPE yyvalue)
|
||
#else
|
||
yysymprint (yyout, yytype, yyvalue)
|
||
FILE* yyout;
|
||
int yytype;
|
||
YYSTYPE yyvalue;
|
||
#endif
|
||
{
|
||
/* Pacify ``unused variable'' warnings. */
|
||
(void) yyvalue;
|
||
|
||
if (yytype < YYNTOKENS)
|
||
{
|
||
YYFPRINTF (yyout, "token %s (", yytname[yytype]);
|
||
# ifdef YYPRINT
|
||
YYPRINT (yyout, yytoknum[yytype], yyvalue);
|
||
# endif
|
||
}
|
||
else
|
||
YYFPRINTF (yyout, "nterm %s (", yytname[yytype]);
|
||
|
||
switch (yytype)
|
||
{
|
||
default:
|
||
break;
|
||
}
|
||
YYFPRINTF (yyout, ")");
|
||
}
|
||
#endif /* YYDEBUG. */
|
||
|
||
|
||
/*-----------------------------------------------.
|
||
| Release the memory associated to this symbol. |
|
||
`-----------------------------------------------*/
|
||
|
||
static void
|
||
#if defined (__STDC__) || defined (__cplusplus)
|
||
yydestruct (int yytype, YYSTYPE yyvalue)
|
||
#else
|
||
yydestruct (yytype, yyvalue)
|
||
int yytype;
|
||
YYSTYPE yyvalue;
|
||
#endif
|
||
{
|
||
/* Pacify ``unused variable'' warnings. */
|
||
(void) yyvalue;
|
||
|
||
switch (yytype)
|
||
{
|
||
default:
|
||
break;
|
||
}
|
||
}
|
||
|
||
|
||
|
||
/* The user can define YYPARSE_PARAM as the name of an argument to be passed
|
||
into yyparse. The argument should have type void *.
|
||
It should actually point to an object.
|
||
Grammar actions can access the variable by casting it
|
||
to the proper pointer type. */
|
||
|
||
#ifdef YYPARSE_PARAM
|
||
# if defined (__STDC__) || defined (__cplusplus)
|
||
# define YYPARSE_PARAM_ARG void *YYPARSE_PARAM
|
||
# define YYPARSE_PARAM_DECL
|
||
# else
|
||
# define YYPARSE_PARAM_ARG YYPARSE_PARAM
|
||
# define YYPARSE_PARAM_DECL void *YYPARSE_PARAM;
|
||
# endif
|
||
#else /* !YYPARSE_PARAM */
|
||
# define YYPARSE_PARAM_ARG
|
||
# define YYPARSE_PARAM_DECL
|
||
#endif /* !YYPARSE_PARAM */
|
||
|
||
/* Prevent warning if -Wstrict-prototypes. */
|
||
#ifdef __GNUC__
|
||
# ifdef YYPARSE_PARAM
|
||
int yyparse (void *);
|
||
# else
|
||
int yyparse (void);
|
||
# endif
|
||
#endif
|
||
|
||
|
||
/* The lookahead symbol. */
|
||
int yychar;
|
||
|
||
/* The semantic value of the lookahead symbol. */
|
||
YYSTYPE yylval;
|
||
|
||
/* Number of parse errors so far. */
|
||
int yynerrs;
|
||
|
||
|
||
int
|
||
yyparse (YYPARSE_PARAM_ARG)
|
||
YYPARSE_PARAM_DECL
|
||
{
|
||
|
||
register int yystate;
|
||
register int yyn;
|
||
int yyresult;
|
||
/* Number of tokens to shift before error messages enabled. */
|
||
int yyerrstatus;
|
||
/* Lookahead token as an internal (translated) token number. */
|
||
int yychar1 = 0;
|
||
|
||
/* Three stacks and their tools:
|
||
`yyss': related to states,
|
||
`yyvs': related to semantic values,
|
||
`yyls': related to locations.
|
||
|
||
Refer to the stacks thru separate pointers, to allow yyoverflow
|
||
to reallocate them elsewhere. */
|
||
|
||
/* The state stack. */
|
||
short yyssa[YYINITDEPTH];
|
||
short *yyss = yyssa;
|
||
register short *yyssp;
|
||
|
||
/* The semantic value stack. */
|
||
YYSTYPE yyvsa[YYINITDEPTH];
|
||
YYSTYPE *yyvs = yyvsa;
|
||
register YYSTYPE *yyvsp;
|
||
|
||
|
||
|
||
#define YYPOPSTACK (yyvsp--, yyssp--)
|
||
|
||
YYSIZE_T yystacksize = YYINITDEPTH;
|
||
|
||
/* The variables used to return semantic value and location from the
|
||
action routines. */
|
||
YYSTYPE yyval;
|
||
|
||
|
||
/* When reducing, the number of symbols on the RHS of the reduced
|
||
rule. */
|
||
int yylen;
|
||
|
||
YYDPRINTF ((stderr, "Starting parse\n"));
|
||
|
||
yystate = 0;
|
||
yyerrstatus = 0;
|
||
yynerrs = 0;
|
||
yychar = YYEMPTY; /* Cause a token to be read. */
|
||
|
||
/* Initialize stack pointers.
|
||
Waste one element of value and location stack
|
||
so that they stay on the same level as the state stack.
|
||
The wasted elements are never initialized. */
|
||
|
||
yyssp = yyss;
|
||
yyvsp = yyvs;
|
||
|
||
goto yysetstate;
|
||
|
||
/*------------------------------------------------------------.
|
||
| yynewstate -- Push a new state, which is found in yystate. |
|
||
`------------------------------------------------------------*/
|
||
yynewstate:
|
||
/* In all cases, when you get here, the value and location stacks
|
||
have just been pushed. so pushing a state here evens the stacks.
|
||
*/
|
||
yyssp++;
|
||
|
||
yysetstate:
|
||
*yyssp = yystate;
|
||
|
||
if (yyssp >= yyss + yystacksize - 1)
|
||
{
|
||
/* Get the current used size of the three stacks, in elements. */
|
||
YYSIZE_T yysize = yyssp - yyss + 1;
|
||
|
||
#ifdef yyoverflow
|
||
{
|
||
/* Give user a chance to reallocate the stack. Use copies of
|
||
these so that the &'s don't force the real ones into
|
||
memory. */
|
||
YYSTYPE *yyvs1 = yyvs;
|
||
short *yyss1 = yyss;
|
||
|
||
|
||
/* Each stack pointer address is followed by the size of the
|
||
data in use in that stack, in bytes. This used to be a
|
||
conditional around just the two extra args, but that might
|
||
be undefined if yyoverflow is a macro. */
|
||
yyoverflow ("parser stack overflow",
|
||
&yyss1, yysize * sizeof (*yyssp),
|
||
&yyvs1, yysize * sizeof (*yyvsp),
|
||
|
||
&yystacksize);
|
||
|
||
yyss = yyss1;
|
||
yyvs = yyvs1;
|
||
}
|
||
#else /* no yyoverflow */
|
||
# ifndef YYSTACK_RELOCATE
|
||
goto yyoverflowlab;
|
||
# else
|
||
/* Extend the stack our own way. */
|
||
if (yystacksize >= YYMAXDEPTH)
|
||
goto yyoverflowlab;
|
||
yystacksize *= 2;
|
||
if (yystacksize > YYMAXDEPTH)
|
||
yystacksize = YYMAXDEPTH;
|
||
|
||
{
|
||
short *yyss1 = yyss;
|
||
union yyalloc *yyptr =
|
||
(union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
|
||
if (! yyptr)
|
||
goto yyoverflowlab;
|
||
YYSTACK_RELOCATE (yyss);
|
||
YYSTACK_RELOCATE (yyvs);
|
||
|
||
# undef YYSTACK_RELOCATE
|
||
if (yyss1 != yyssa)
|
||
YYSTACK_FREE (yyss1);
|
||
}
|
||
# endif
|
||
#endif /* no yyoverflow */
|
||
|
||
yyssp = yyss + yysize - 1;
|
||
yyvsp = yyvs + yysize - 1;
|
||
|
||
|
||
YYDPRINTF ((stderr, "Stack size increased to %lu\n",
|
||
(unsigned long int) yystacksize));
|
||
|
||
if (yyssp >= yyss + yystacksize - 1)
|
||
YYABORT;
|
||
}
|
||
|
||
YYDPRINTF ((stderr, "Entering state %d\n", yystate));
|
||
|
||
goto yybackup;
|
||
|
||
/*-----------.
|
||
| yybackup. |
|
||
`-----------*/
|
||
yybackup:
|
||
|
||
/* Do appropriate processing given the current state. */
|
||
/* Read a lookahead token if we need one and don't already have one. */
|
||
/* yyresume: */
|
||
|
||
/* First try to decide what to do without reference to lookahead token. */
|
||
|
||
yyn = yypact[yystate];
|
||
if (yyn == YYPACT_NINF)
|
||
goto yydefault;
|
||
|
||
/* Not known => get a lookahead token if don't already have one. */
|
||
|
||
/* yychar is either YYEMPTY or YYEOF
|
||
or a valid token in external form. */
|
||
|
||
if (yychar == YYEMPTY)
|
||
{
|
||
YYDPRINTF ((stderr, "Reading a token: "));
|
||
yychar = YYLEX;
|
||
}
|
||
|
||
/* Convert token to internal form (in yychar1) for indexing tables with. */
|
||
|
||
if (yychar <= 0) /* This means end of input. */
|
||
{
|
||
yychar1 = 0;
|
||
yychar = YYEOF; /* Don't call YYLEX any more. */
|
||
|
||
YYDPRINTF ((stderr, "Now at end of input.\n"));
|
||
}
|
||
else
|
||
{
|
||
yychar1 = YYTRANSLATE (yychar);
|
||
|
||
/* We have to keep this `#if YYDEBUG', since we use variables
|
||
which are defined only if `YYDEBUG' is set. */
|
||
YYDPRINTF ((stderr, "Next token is "));
|
||
YYDSYMPRINT ((stderr, yychar1, yylval));
|
||
YYDPRINTF ((stderr, "\n"));
|
||
}
|
||
|
||
/* If the proper action on seeing token YYCHAR1 is to reduce or to
|
||
detect an error, take that action. */
|
||
yyn += yychar1;
|
||
if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yychar1)
|
||
goto yydefault;
|
||
yyn = yytable[yyn];
|
||
if (yyn <= 0)
|
||
{
|
||
if (yyn == 0 || yyn == YYTABLE_NINF)
|
||
goto yyerrlab;
|
||
yyn = -yyn;
|
||
goto yyreduce;
|
||
}
|
||
|
||
if (yyn == YYFINAL)
|
||
YYACCEPT;
|
||
|
||
/* Shift the lookahead token. */
|
||
YYDPRINTF ((stderr, "Shifting token %d (%s), ",
|
||
yychar, yytname[yychar1]));
|
||
|
||
/* Discard the token being shifted unless it is eof. */
|
||
if (yychar != YYEOF)
|
||
yychar = YYEMPTY;
|
||
|
||
*++yyvsp = yylval;
|
||
|
||
|
||
/* Count tokens shifted since error; after three, turn off error
|
||
status. */
|
||
if (yyerrstatus)
|
||
yyerrstatus--;
|
||
|
||
yystate = yyn;
|
||
goto yynewstate;
|
||
|
||
|
||
/*-----------------------------------------------------------.
|
||
| yydefault -- do the default action for the current state. |
|
||
`-----------------------------------------------------------*/
|
||
yydefault:
|
||
yyn = yydefact[yystate];
|
||
if (yyn == 0)
|
||
goto yyerrlab;
|
||
goto yyreduce;
|
||
|
||
|
||
/*-----------------------------.
|
||
| yyreduce -- Do a reduction. |
|
||
`-----------------------------*/
|
||
yyreduce:
|
||
/* yyn is the number of a rule to reduce with. */
|
||
yylen = yyr2[yyn];
|
||
|
||
/* If YYLEN is nonzero, implement the default value of the action:
|
||
`$$ = $1'.
|
||
|
||
Otherwise, the following line sets YYVAL to garbage.
|
||
This behavior is undocumented and Bison
|
||
users should not rely upon it. Assigning to YYVAL
|
||
unconditionally makes the parser a bit smaller, and it avoids a
|
||
GCC warning that YYVAL may be used uninitialized. */
|
||
yyval = yyvsp[1-yylen];
|
||
|
||
|
||
|
||
#if YYDEBUG
|
||
/* We have to keep this `#if YYDEBUG', since we use variables which
|
||
are defined only if `YYDEBUG' is set. */
|
||
if (yydebug)
|
||
{
|
||
int yyi;
|
||
|
||
YYFPRINTF (stderr, "Reducing via rule %d (line %d), ",
|
||
yyn - 1, yyrline[yyn]);
|
||
|
||
/* Print the symbols being reduced, and their result. */
|
||
for (yyi = yyprhs[yyn]; yyrhs[yyi] >= 0; yyi++)
|
||
YYFPRINTF (stderr, "%s ", yytname[yyrhs[yyi]]);
|
||
YYFPRINTF (stderr, " -> %s\n", yytname[yyr1[yyn]]);
|
||
}
|
||
#endif
|
||
switch (yyn)
|
||
{
|
||
case 3:
|
||
#line 1032 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (yyvsp[0].UIntVal > (uint32_t)INT32_MAX) // Outside of my range!
|
||
GEN_ERROR("Value too large for type!");
|
||
yyval.SIntVal = (int32_t)yyvsp[0].UIntVal;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 31:
|
||
#line 1048 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.IPredicate = ICmpInst::ICMP_EQ; }
|
||
break;
|
||
|
||
case 32:
|
||
#line 1048 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.IPredicate = ICmpInst::ICMP_NE; }
|
||
break;
|
||
|
||
case 33:
|
||
#line 1049 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.IPredicate = ICmpInst::ICMP_SLT; }
|
||
break;
|
||
|
||
case 34:
|
||
#line 1049 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.IPredicate = ICmpInst::ICMP_SGT; }
|
||
break;
|
||
|
||
case 35:
|
||
#line 1050 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.IPredicate = ICmpInst::ICMP_SLE; }
|
||
break;
|
||
|
||
case 36:
|
||
#line 1050 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.IPredicate = ICmpInst::ICMP_SGE; }
|
||
break;
|
||
|
||
case 37:
|
||
#line 1051 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.IPredicate = ICmpInst::ICMP_ULT; }
|
||
break;
|
||
|
||
case 38:
|
||
#line 1051 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.IPredicate = ICmpInst::ICMP_UGT; }
|
||
break;
|
||
|
||
case 39:
|
||
#line 1052 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.IPredicate = ICmpInst::ICMP_ULE; }
|
||
break;
|
||
|
||
case 40:
|
||
#line 1052 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.IPredicate = ICmpInst::ICMP_UGE; }
|
||
break;
|
||
|
||
case 41:
|
||
#line 1056 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.FPredicate = FCmpInst::FCMP_OEQ; }
|
||
break;
|
||
|
||
case 42:
|
||
#line 1056 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.FPredicate = FCmpInst::FCMP_ONE; }
|
||
break;
|
||
|
||
case 43:
|
||
#line 1057 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.FPredicate = FCmpInst::FCMP_OLT; }
|
||
break;
|
||
|
||
case 44:
|
||
#line 1057 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.FPredicate = FCmpInst::FCMP_OGT; }
|
||
break;
|
||
|
||
case 45:
|
||
#line 1058 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.FPredicate = FCmpInst::FCMP_OLE; }
|
||
break;
|
||
|
||
case 46:
|
||
#line 1058 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.FPredicate = FCmpInst::FCMP_OGE; }
|
||
break;
|
||
|
||
case 47:
|
||
#line 1059 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.FPredicate = FCmpInst::FCMP_ORD; }
|
||
break;
|
||
|
||
case 48:
|
||
#line 1059 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.FPredicate = FCmpInst::FCMP_UNO; }
|
||
break;
|
||
|
||
case 49:
|
||
#line 1060 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.FPredicate = FCmpInst::FCMP_UEQ; }
|
||
break;
|
||
|
||
case 50:
|
||
#line 1060 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.FPredicate = FCmpInst::FCMP_UNE; }
|
||
break;
|
||
|
||
case 51:
|
||
#line 1061 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.FPredicate = FCmpInst::FCMP_ULT; }
|
||
break;
|
||
|
||
case 52:
|
||
#line 1061 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.FPredicate = FCmpInst::FCMP_UGT; }
|
||
break;
|
||
|
||
case 53:
|
||
#line 1062 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.FPredicate = FCmpInst::FCMP_ULE; }
|
||
break;
|
||
|
||
case 54:
|
||
#line 1062 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.FPredicate = FCmpInst::FCMP_UGE; }
|
||
break;
|
||
|
||
case 55:
|
||
#line 1063 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.FPredicate = FCmpInst::FCMP_TRUE; }
|
||
break;
|
||
|
||
case 56:
|
||
#line 1064 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.FPredicate = FCmpInst::FCMP_FALSE; }
|
||
break;
|
||
|
||
case 60:
|
||
#line 1073 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.StrVal = yyvsp[-1].StrVal;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 61:
|
||
#line 1077 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.StrVal = 0;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 62:
|
||
#line 1083 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Linkage = GlobalValue::InternalLinkage; }
|
||
break;
|
||
|
||
case 63:
|
||
#line 1084 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Linkage = GlobalValue::WeakLinkage; }
|
||
break;
|
||
|
||
case 64:
|
||
#line 1085 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Linkage = GlobalValue::LinkOnceLinkage; }
|
||
break;
|
||
|
||
case 65:
|
||
#line 1086 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Linkage = GlobalValue::AppendingLinkage; }
|
||
break;
|
||
|
||
case 66:
|
||
#line 1087 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Linkage = GlobalValue::DLLExportLinkage; }
|
||
break;
|
||
|
||
case 67:
|
||
#line 1091 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Linkage = GlobalValue::DLLImportLinkage; }
|
||
break;
|
||
|
||
case 68:
|
||
#line 1092 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Linkage = GlobalValue::ExternalWeakLinkage; }
|
||
break;
|
||
|
||
case 69:
|
||
#line 1093 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Linkage = GlobalValue::ExternalLinkage; }
|
||
break;
|
||
|
||
case 70:
|
||
#line 1097 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Visibility = GlobalValue::DefaultVisibility; }
|
||
break;
|
||
|
||
case 71:
|
||
#line 1098 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Visibility = GlobalValue::HiddenVisibility; }
|
||
break;
|
||
|
||
case 72:
|
||
#line 1102 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Linkage = GlobalValue::ExternalLinkage; }
|
||
break;
|
||
|
||
case 73:
|
||
#line 1103 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Linkage = GlobalValue::DLLImportLinkage; }
|
||
break;
|
||
|
||
case 74:
|
||
#line 1104 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Linkage = GlobalValue::ExternalWeakLinkage; }
|
||
break;
|
||
|
||
case 75:
|
||
#line 1108 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Linkage = GlobalValue::ExternalLinkage; }
|
||
break;
|
||
|
||
case 76:
|
||
#line 1109 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Linkage = GlobalValue::InternalLinkage; }
|
||
break;
|
||
|
||
case 77:
|
||
#line 1110 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Linkage = GlobalValue::LinkOnceLinkage; }
|
||
break;
|
||
|
||
case 78:
|
||
#line 1111 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Linkage = GlobalValue::WeakLinkage; }
|
||
break;
|
||
|
||
case 79:
|
||
#line 1112 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Linkage = GlobalValue::DLLExportLinkage; }
|
||
break;
|
||
|
||
case 80:
|
||
#line 1115 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.UIntVal = CallingConv::C; }
|
||
break;
|
||
|
||
case 81:
|
||
#line 1116 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.UIntVal = CallingConv::C; }
|
||
break;
|
||
|
||
case 82:
|
||
#line 1117 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.UIntVal = CallingConv::CSRet; }
|
||
break;
|
||
|
||
case 83:
|
||
#line 1118 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.UIntVal = CallingConv::Fast; }
|
||
break;
|
||
|
||
case 84:
|
||
#line 1119 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.UIntVal = CallingConv::Cold; }
|
||
break;
|
||
|
||
case 85:
|
||
#line 1120 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.UIntVal = CallingConv::X86_StdCall; }
|
||
break;
|
||
|
||
case 86:
|
||
#line 1121 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.UIntVal = CallingConv::X86_FastCall; }
|
||
break;
|
||
|
||
case 87:
|
||
#line 1122 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if ((unsigned)yyvsp[0].UInt64Val != yyvsp[0].UInt64Val)
|
||
GEN_ERROR("Calling conv too large!");
|
||
yyval.UIntVal = yyvsp[0].UInt64Val;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 88:
|
||
#line 1129 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.ParamAttrs = FunctionType::ZExtAttribute; }
|
||
break;
|
||
|
||
case 89:
|
||
#line 1130 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.ParamAttrs = FunctionType::SExtAttribute; }
|
||
break;
|
||
|
||
case 90:
|
||
#line 1133 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.ParamAttrs = FunctionType::NoAttributeSet; }
|
||
break;
|
||
|
||
case 91:
|
||
#line 1134 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.ParamAttrs = FunctionType::ParameterAttributes(yyvsp[-1].ParamAttrs | yyvsp[0].ParamAttrs);
|
||
}
|
||
break;
|
||
|
||
case 92:
|
||
#line 1139 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.ParamAttrs = FunctionType::NoReturnAttribute; }
|
||
break;
|
||
|
||
case 94:
|
||
#line 1143 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.ParamAttrs = FunctionType::NoAttributeSet; }
|
||
break;
|
||
|
||
case 95:
|
||
#line 1144 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.ParamAttrs = FunctionType::ParameterAttributes(yyvsp[-1].ParamAttrs | yyvsp[0].ParamAttrs);
|
||
}
|
||
break;
|
||
|
||
case 96:
|
||
#line 1151 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.UIntVal = 0; }
|
||
break;
|
||
|
||
case 97:
|
||
#line 1152 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.UIntVal = yyvsp[0].UInt64Val;
|
||
if (yyval.UIntVal != 0 && !isPowerOf2_32(yyval.UIntVal))
|
||
GEN_ERROR("Alignment must be a power of two!");
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 98:
|
||
#line 1158 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.UIntVal = 0; }
|
||
break;
|
||
|
||
case 99:
|
||
#line 1159 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.UIntVal = yyvsp[0].UInt64Val;
|
||
if (yyval.UIntVal != 0 && !isPowerOf2_32(yyval.UIntVal))
|
||
GEN_ERROR("Alignment must be a power of two!");
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 100:
|
||
#line 1167 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
for (unsigned i = 0, e = strlen(yyvsp[0].StrVal); i != e; ++i)
|
||
if (yyvsp[0].StrVal[i] == '"' || yyvsp[0].StrVal[i] == '\\')
|
||
GEN_ERROR("Invalid character in section name!");
|
||
yyval.StrVal = yyvsp[0].StrVal;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 101:
|
||
#line 1175 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.StrVal = 0; }
|
||
break;
|
||
|
||
case 102:
|
||
#line 1176 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.StrVal = yyvsp[0].StrVal; }
|
||
break;
|
||
|
||
case 103:
|
||
#line 1181 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{}
|
||
break;
|
||
|
||
case 104:
|
||
#line 1182 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{}
|
||
break;
|
||
|
||
case 105:
|
||
#line 1183 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CurGV->setSection(yyvsp[0].StrVal);
|
||
free(yyvsp[0].StrVal);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 106:
|
||
#line 1188 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (yyvsp[0].UInt64Val != 0 && !isPowerOf2_32(yyvsp[0].UInt64Val))
|
||
GEN_ERROR("Alignment must be a power of two!");
|
||
CurGV->setAlignment(yyvsp[0].UInt64Val);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 111:
|
||
#line 1204 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.TypeVal = new PATypeHolder(OpaqueType::get());
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 112:
|
||
#line 1208 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.TypeVal = new PATypeHolder(yyvsp[0].PrimType);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 113:
|
||
#line 1212 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Pointer type?
|
||
if (*yyvsp[-1].TypeVal == Type::LabelTy)
|
||
GEN_ERROR("Cannot form a pointer to a basic block");
|
||
yyval.TypeVal = new PATypeHolder(HandleUpRefs(PointerType::get(*yyvsp[-1].TypeVal)));
|
||
delete yyvsp[-1].TypeVal;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 114:
|
||
#line 1219 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Named types are also simple types...
|
||
const Type* tmp = getTypeVal(yyvsp[0].ValIDVal);
|
||
CHECK_FOR_ERROR
|
||
yyval.TypeVal = new PATypeHolder(tmp);
|
||
}
|
||
break;
|
||
|
||
case 115:
|
||
#line 1224 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Type UpReference
|
||
if (yyvsp[0].UInt64Val > (uint64_t)~0U) GEN_ERROR("Value out of range!");
|
||
OpaqueType *OT = OpaqueType::get(); // Use temporary placeholder
|
||
UpRefs.push_back(UpRefRecord((unsigned)yyvsp[0].UInt64Val, OT)); // Add to vector...
|
||
yyval.TypeVal = new PATypeHolder(OT);
|
||
UR_OUT("New Upreference!\n");
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 116:
|
||
#line 1232 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
std::vector<const Type*> Params;
|
||
std::vector<FunctionType::ParameterAttributes> Attrs;
|
||
Attrs.push_back(yyvsp[0].ParamAttrs);
|
||
for (TypeWithAttrsList::iterator I=yyvsp[-2].TypeWithAttrsList->begin(), E=yyvsp[-2].TypeWithAttrsList->end(); I != E; ++I) {
|
||
Params.push_back(I->Ty->get());
|
||
if (I->Ty->get() != Type::VoidTy)
|
||
Attrs.push_back(I->Attrs);
|
||
}
|
||
bool isVarArg = Params.size() && Params.back() == Type::VoidTy;
|
||
if (isVarArg) Params.pop_back();
|
||
|
||
FunctionType *FT = FunctionType::get(*yyvsp[-4].TypeVal, Params, isVarArg, Attrs);
|
||
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 117:
|
||
#line 1250 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
std::vector<const Type*> Params;
|
||
std::vector<FunctionType::ParameterAttributes> Attrs;
|
||
Attrs.push_back(yyvsp[0].ParamAttrs);
|
||
for (TypeWithAttrsList::iterator I=yyvsp[-2].TypeWithAttrsList->begin(), E=yyvsp[-2].TypeWithAttrsList->end(); I != E; ++I) {
|
||
Params.push_back(I->Ty->get());
|
||
if (I->Ty->get() != Type::VoidTy)
|
||
Attrs.push_back(I->Attrs);
|
||
}
|
||
bool isVarArg = Params.size() && Params.back() == Type::VoidTy;
|
||
if (isVarArg) Params.pop_back();
|
||
|
||
FunctionType *FT = FunctionType::get(yyvsp[-4].PrimType, Params, isVarArg, Attrs);
|
||
delete yyvsp[-2].TypeWithAttrsList; // Delete the argument list
|
||
yyval.TypeVal = new PATypeHolder(HandleUpRefs(FT));
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 118:
|
||
#line 1268 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Sized array type?
|
||
yyval.TypeVal = new PATypeHolder(HandleUpRefs(ArrayType::get(*yyvsp[-1].TypeVal, (unsigned)yyvsp[-3].UInt64Val)));
|
||
delete yyvsp[-1].TypeVal;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 119:
|
||
#line 1273 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Packed array 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 PackedType must be primitive");
|
||
if (!isPowerOf2_32(yyvsp[-3].UInt64Val))
|
||
GEN_ERROR("Vector length should be a power of 2!");
|
||
yyval.TypeVal = new PATypeHolder(HandleUpRefs(PackedType::get(*yyvsp[-1].TypeVal, (unsigned)yyvsp[-3].UInt64Val)));
|
||
delete yyvsp[-1].TypeVal;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 120:
|
||
#line 1285 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Structure type?
|
||
std::vector<const Type*> Elements;
|
||
for (std::list<llvm::PATypeHolder>::iterator I = yyvsp[-1].TypeList->begin(),
|
||
E = yyvsp[-1].TypeList->end(); I != E; ++I)
|
||
Elements.push_back(*I);
|
||
|
||
yyval.TypeVal = new PATypeHolder(HandleUpRefs(StructType::get(Elements)));
|
||
delete yyvsp[-1].TypeList;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 121:
|
||
#line 1295 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Empty structure type?
|
||
yyval.TypeVal = new PATypeHolder(StructType::get(std::vector<const Type*>()));
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 122:
|
||
#line 1299 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
std::vector<const Type*> Elements;
|
||
for (std::list<llvm::PATypeHolder>::iterator I = yyvsp[-2].TypeList->begin(),
|
||
E = yyvsp[-2].TypeList->end(); I != E; ++I)
|
||
Elements.push_back(*I);
|
||
|
||
yyval.TypeVal = new PATypeHolder(HandleUpRefs(StructType::get(Elements, true)));
|
||
delete yyvsp[-2].TypeList;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 123:
|
||
#line 1309 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Empty structure type?
|
||
yyval.TypeVal = new PATypeHolder(StructType::get(std::vector<const Type*>(), true));
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 124:
|
||
#line 1316 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.TypeWithAttrs.Ty = yyvsp[-1].TypeVal;
|
||
yyval.TypeWithAttrs.Attrs = yyvsp[0].ParamAttrs;
|
||
}
|
||
break;
|
||
|
||
case 125:
|
||
#line 1323 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!UpRefs.empty())
|
||
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[0].TypeVal)->getDescription());
|
||
if (!(*yyvsp[0].TypeVal)->isFirstClassType())
|
||
GEN_ERROR("LLVM functions cannot return aggregate types!");
|
||
yyval.TypeVal = yyvsp[0].TypeVal;
|
||
}
|
||
break;
|
||
|
||
case 126:
|
||
#line 1330 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.TypeVal = new PATypeHolder(Type::VoidTy);
|
||
}
|
||
break;
|
||
|
||
case 127:
|
||
#line 1335 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.TypeWithAttrsList = new TypeWithAttrsList();
|
||
yyval.TypeWithAttrsList->push_back(yyvsp[0].TypeWithAttrs);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 128:
|
||
#line 1340 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.TypeWithAttrsList=yyvsp[-2].TypeWithAttrsList)->push_back(yyvsp[0].TypeWithAttrs);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 130:
|
||
#line 1348 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.TypeWithAttrsList=yyvsp[-2].TypeWithAttrsList;
|
||
TypeWithAttrs TWA; TWA.Attrs = FunctionType::NoAttributeSet;
|
||
TWA.Ty = new PATypeHolder(Type::VoidTy);
|
||
yyval.TypeWithAttrsList->push_back(TWA);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 131:
|
||
#line 1355 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.TypeWithAttrsList = new TypeWithAttrsList;
|
||
TypeWithAttrs TWA; TWA.Attrs = FunctionType::NoAttributeSet;
|
||
TWA.Ty = new PATypeHolder(Type::VoidTy);
|
||
yyval.TypeWithAttrsList->push_back(TWA);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 132:
|
||
#line 1362 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.TypeWithAttrsList = new TypeWithAttrsList();
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 133:
|
||
#line 1370 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.TypeList = new std::list<PATypeHolder>();
|
||
yyval.TypeList->push_back(*yyvsp[0].TypeVal); delete yyvsp[0].TypeVal;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 134:
|
||
#line 1375 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.TypeList=yyvsp[-2].TypeList)->push_back(*yyvsp[0].TypeVal); delete yyvsp[0].TypeVal;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 135:
|
||
#line 1386 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Nonempty unsized arr
|
||
if (!UpRefs.empty())
|
||
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-3].TypeVal)->getDescription());
|
||
const ArrayType *ATy = dyn_cast<ArrayType>(yyvsp[-3].TypeVal->get());
|
||
if (ATy == 0)
|
||
GEN_ERROR("Cannot make array constant with type: '" +
|
||
(*yyvsp[-3].TypeVal)->getDescription() + "'!");
|
||
const Type *ETy = ATy->getElementType();
|
||
int NumElements = ATy->getNumElements();
|
||
|
||
// Verify that we have the correct size...
|
||
if (NumElements != -1 && NumElements != (int)yyvsp[-1].ConstVector->size())
|
||
GEN_ERROR("Type mismatch: constant sized array initialized with " +
|
||
utostr(yyvsp[-1].ConstVector->size()) + " arguments, but has size of " +
|
||
itostr(NumElements) + "!");
|
||
|
||
// Verify all elements are correct type!
|
||
for (unsigned i = 0; i < yyvsp[-1].ConstVector->size(); i++) {
|
||
if (ETy != (*yyvsp[-1].ConstVector)[i]->getType())
|
||
GEN_ERROR("Element #" + utostr(i) + " is not of type '" +
|
||
ETy->getDescription() +"' as required!\nIt is of type '"+
|
||
(*yyvsp[-1].ConstVector)[i]->getType()->getDescription() + "'.");
|
||
}
|
||
|
||
yyval.ConstVal = ConstantArray::get(ATy, *yyvsp[-1].ConstVector);
|
||
delete yyvsp[-3].TypeVal; delete yyvsp[-1].ConstVector;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 136:
|
||
#line 1414 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!UpRefs.empty())
|
||
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-2].TypeVal)->getDescription());
|
||
const ArrayType *ATy = dyn_cast<ArrayType>(yyvsp[-2].TypeVal->get());
|
||
if (ATy == 0)
|
||
GEN_ERROR("Cannot make array constant with type: '" +
|
||
(*yyvsp[-2].TypeVal)->getDescription() + "'!");
|
||
|
||
int NumElements = ATy->getNumElements();
|
||
if (NumElements != -1 && NumElements != 0)
|
||
GEN_ERROR("Type mismatch: constant sized array initialized with 0"
|
||
" arguments, but has size of " + itostr(NumElements) +"!");
|
||
yyval.ConstVal = ConstantArray::get(ATy, std::vector<Constant*>());
|
||
delete yyvsp[-2].TypeVal;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 137:
|
||
#line 1430 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!UpRefs.empty())
|
||
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-2].TypeVal)->getDescription());
|
||
const ArrayType *ATy = dyn_cast<ArrayType>(yyvsp[-2].TypeVal->get());
|
||
if (ATy == 0)
|
||
GEN_ERROR("Cannot make array constant with type: '" +
|
||
(*yyvsp[-2].TypeVal)->getDescription() + "'!");
|
||
|
||
int NumElements = ATy->getNumElements();
|
||
const Type *ETy = ATy->getElementType();
|
||
char *EndStr = UnEscapeLexed(yyvsp[0].StrVal, true);
|
||
if (NumElements != -1 && NumElements != (EndStr-yyvsp[0].StrVal))
|
||
GEN_ERROR("Can't build string constant of size " +
|
||
itostr((int)(EndStr-yyvsp[0].StrVal)) +
|
||
" when array has size " + itostr(NumElements) + "!");
|
||
std::vector<Constant*> Vals;
|
||
if (ETy == Type::Int8Ty) {
|
||
for (unsigned char *C = (unsigned char *)yyvsp[0].StrVal;
|
||
C != (unsigned char*)EndStr; ++C)
|
||
Vals.push_back(ConstantInt::get(ETy, *C));
|
||
} else {
|
||
free(yyvsp[0].StrVal);
|
||
GEN_ERROR("Cannot build string arrays of non byte sized elements!");
|
||
}
|
||
free(yyvsp[0].StrVal);
|
||
yyval.ConstVal = ConstantArray::get(ATy, Vals);
|
||
delete yyvsp[-2].TypeVal;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 138:
|
||
#line 1459 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Nonempty unsized arr
|
||
if (!UpRefs.empty())
|
||
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-3].TypeVal)->getDescription());
|
||
const PackedType *PTy = dyn_cast<PackedType>(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 = ConstantPacked::get(PTy, *yyvsp[-1].ConstVector);
|
||
delete yyvsp[-3].TypeVal; delete yyvsp[-1].ConstVector;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 139:
|
||
#line 1487 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
const StructType *STy = dyn_cast<StructType>(yyvsp[-3].TypeVal->get());
|
||
if (STy == 0)
|
||
GEN_ERROR("Cannot make struct constant with type: '" +
|
||
(*yyvsp[-3].TypeVal)->getDescription() + "'!");
|
||
|
||
if (yyvsp[-1].ConstVector->size() != STy->getNumContainedTypes())
|
||
GEN_ERROR("Illegal number of initializers for structure type!");
|
||
|
||
// Check to ensure that constants are compatible with the type initializer!
|
||
for (unsigned i = 0, e = yyvsp[-1].ConstVector->size(); i != e; ++i)
|
||
if ((*yyvsp[-1].ConstVector)[i]->getType() != STy->getElementType(i))
|
||
GEN_ERROR("Expected type '" +
|
||
STy->getElementType(i)->getDescription() +
|
||
"' for element #" + utostr(i) +
|
||
" of structure initializer!");
|
||
|
||
// Check to ensure that Type is not packed
|
||
if (STy->isPacked())
|
||
GEN_ERROR("Unpacked Initializer to packed type '" + STy->getDescription() + "'");
|
||
|
||
yyval.ConstVal = ConstantStruct::get(STy, *yyvsp[-1].ConstVector);
|
||
delete yyvsp[-3].TypeVal; delete yyvsp[-1].ConstVector;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 140:
|
||
#line 1512 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!UpRefs.empty())
|
||
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-2].TypeVal)->getDescription());
|
||
const StructType *STy = dyn_cast<StructType>(yyvsp[-2].TypeVal->get());
|
||
if (STy == 0)
|
||
GEN_ERROR("Cannot make struct constant with type: '" +
|
||
(*yyvsp[-2].TypeVal)->getDescription() + "'!");
|
||
|
||
if (STy->getNumContainedTypes() != 0)
|
||
GEN_ERROR("Illegal number of initializers for structure type!");
|
||
|
||
// Check to ensure that Type is not packed
|
||
if (STy->isPacked())
|
||
GEN_ERROR("Unpacked Initializer to packed type '" + STy->getDescription() + "'");
|
||
|
||
yyval.ConstVal = ConstantStruct::get(STy, std::vector<Constant*>());
|
||
delete yyvsp[-2].TypeVal;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 141:
|
||
#line 1531 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
const StructType *STy = dyn_cast<StructType>(yyvsp[-5].TypeVal->get());
|
||
if (STy == 0)
|
||
GEN_ERROR("Cannot make struct constant with type: '" +
|
||
(*yyvsp[-5].TypeVal)->getDescription() + "'!");
|
||
|
||
if (yyvsp[-2].ConstVector->size() != STy->getNumContainedTypes())
|
||
GEN_ERROR("Illegal number of initializers for structure type!");
|
||
|
||
// Check to ensure that constants are compatible with the type initializer!
|
||
for (unsigned i = 0, e = yyvsp[-2].ConstVector->size(); i != e; ++i)
|
||
if ((*yyvsp[-2].ConstVector)[i]->getType() != STy->getElementType(i))
|
||
GEN_ERROR("Expected type '" +
|
||
STy->getElementType(i)->getDescription() +
|
||
"' for element #" + utostr(i) +
|
||
" of structure initializer!");
|
||
|
||
// Check to ensure that Type is packed
|
||
if (!STy->isPacked())
|
||
GEN_ERROR("Packed Initializer to unpacked type '" + STy->getDescription() + "'");
|
||
|
||
yyval.ConstVal = ConstantStruct::get(STy, *yyvsp[-2].ConstVector);
|
||
delete yyvsp[-5].TypeVal; delete yyvsp[-2].ConstVector;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 142:
|
||
#line 1556 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!UpRefs.empty())
|
||
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-4].TypeVal)->getDescription());
|
||
const StructType *STy = dyn_cast<StructType>(yyvsp[-4].TypeVal->get());
|
||
if (STy == 0)
|
||
GEN_ERROR("Cannot make struct constant with type: '" +
|
||
(*yyvsp[-4].TypeVal)->getDescription() + "'!");
|
||
|
||
if (STy->getNumContainedTypes() != 0)
|
||
GEN_ERROR("Illegal number of initializers for structure type!");
|
||
|
||
// Check to ensure that Type is packed
|
||
if (!STy->isPacked())
|
||
GEN_ERROR("Packed Initializer to unpacked type '" + STy->getDescription() + "'");
|
||
|
||
yyval.ConstVal = ConstantStruct::get(STy, std::vector<Constant*>());
|
||
delete yyvsp[-4].TypeVal;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 143:
|
||
#line 1575 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!UpRefs.empty())
|
||
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription());
|
||
const PointerType *PTy = dyn_cast<PointerType>(yyvsp[-1].TypeVal->get());
|
||
if (PTy == 0)
|
||
GEN_ERROR("Cannot make null pointer constant with type: '" +
|
||
(*yyvsp[-1].TypeVal)->getDescription() + "'!");
|
||
|
||
yyval.ConstVal = ConstantPointerNull::get(PTy);
|
||
delete yyvsp[-1].TypeVal;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 144:
|
||
#line 1587 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!UpRefs.empty())
|
||
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription());
|
||
yyval.ConstVal = UndefValue::get(yyvsp[-1].TypeVal->get());
|
||
delete yyvsp[-1].TypeVal;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 145:
|
||
#line 1594 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!UpRefs.empty())
|
||
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription());
|
||
const PointerType *Ty = dyn_cast<PointerType>(yyvsp[-1].TypeVal->get());
|
||
if (Ty == 0)
|
||
GEN_ERROR("Global const reference must be a pointer type!");
|
||
|
||
// ConstExprs can exist in the body of a function, thus creating
|
||
// GlobalValues whenever they refer to a variable. Because we are in
|
||
// the context of a function, getValNonImprovising will search the functions
|
||
// symbol table instead of the module symbol table for the global symbol,
|
||
// which throws things all off. To get around this, we just tell
|
||
// getValNonImprovising that we are at global scope here.
|
||
//
|
||
Function *SavedCurFn = CurFun.CurrentFunction;
|
||
CurFun.CurrentFunction = 0;
|
||
|
||
Value *V = getValNonImprovising(Ty, yyvsp[0].ValIDVal);
|
||
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::NameVal) Name = yyvsp[0].ValIDVal.Name;
|
||
|
||
// Create the forward referenced global.
|
||
GlobalValue *GV;
|
||
if (const FunctionType *FTy =
|
||
dyn_cast<FunctionType>(PT->getElementType())) {
|
||
GV = new Function(FTy, GlobalValue::ExternalLinkage, Name,
|
||
CurModule.CurrentModule);
|
||
} else {
|
||
GV = new GlobalVariable(PT->getElementType(), false,
|
||
GlobalValue::ExternalLinkage, 0,
|
||
Name, CurModule.CurrentModule);
|
||
}
|
||
|
||
// Keep track of the fact that we have a forward ref to recycle it
|
||
CurModule.GlobalRefs.insert(std::make_pair(std::make_pair(PT, yyvsp[0].ValIDVal), GV));
|
||
V = GV;
|
||
}
|
||
}
|
||
|
||
yyval.ConstVal = cast<GlobalValue>(V);
|
||
delete yyvsp[-1].TypeVal; // Free the type handle
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 146:
|
||
#line 1657 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!UpRefs.empty())
|
||
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription());
|
||
if (yyvsp[-1].TypeVal->get() != yyvsp[0].ConstVal->getType())
|
||
GEN_ERROR("Mismatched types for constant expression: " +
|
||
(*yyvsp[-1].TypeVal)->getDescription() + " and " + yyvsp[0].ConstVal->getType()->getDescription());
|
||
yyval.ConstVal = yyvsp[0].ConstVal;
|
||
delete yyvsp[-1].TypeVal;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 147:
|
||
#line 1667 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!UpRefs.empty())
|
||
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription());
|
||
const Type *Ty = yyvsp[-1].TypeVal->get();
|
||
if (isa<FunctionType>(Ty) || Ty == Type::LabelTy || isa<OpaqueType>(Ty))
|
||
GEN_ERROR("Cannot create a null initialized value of this type!");
|
||
yyval.ConstVal = Constant::getNullValue(Ty);
|
||
delete yyvsp[-1].TypeVal;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 148:
|
||
#line 1677 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // integral constants
|
||
if (!ConstantInt::isValueValidForType(yyvsp[-1].PrimType, yyvsp[0].SInt64Val))
|
||
GEN_ERROR("Constant value doesn't fit in type!");
|
||
yyval.ConstVal = ConstantInt::get(yyvsp[-1].PrimType, yyvsp[0].SInt64Val);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 149:
|
||
#line 1683 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // integral constants
|
||
if (!ConstantInt::isValueValidForType(yyvsp[-1].PrimType, yyvsp[0].UInt64Val))
|
||
GEN_ERROR("Constant value doesn't fit in type!");
|
||
yyval.ConstVal = ConstantInt::get(yyvsp[-1].PrimType, yyvsp[0].UInt64Val);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 150:
|
||
#line 1689 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Boolean constants
|
||
assert(cast<IntegerType>(yyvsp[-1].PrimType)->getBitWidth() == 1 && "Not Bool?");
|
||
yyval.ConstVal = ConstantInt::getTrue();
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 151:
|
||
#line 1694 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Boolean constants
|
||
assert(cast<IntegerType>(yyvsp[-1].PrimType)->getBitWidth() == 1 && "Not Bool?");
|
||
yyval.ConstVal = ConstantInt::getFalse();
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 152:
|
||
#line 1699 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Float & Double constants
|
||
if (!ConstantFP::isValueValidForType(yyvsp[-1].PrimType, yyvsp[0].FPVal))
|
||
GEN_ERROR("Floating point constant invalid for type!!");
|
||
yyval.ConstVal = ConstantFP::get(yyvsp[-1].PrimType, yyvsp[0].FPVal);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 153:
|
||
#line 1707 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!UpRefs.empty())
|
||
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription());
|
||
Constant *Val = yyvsp[-3].ConstVal;
|
||
const Type *DestTy = yyvsp[-1].TypeVal->get();
|
||
if (!CastInst::castIsValid(yyvsp[-5].CastOpVal, yyvsp[-3].ConstVal, DestTy))
|
||
GEN_ERROR("invalid cast opcode for cast from '" +
|
||
Val->getType()->getDescription() + "' to '" +
|
||
DestTy->getDescription() + "'!");
|
||
yyval.ConstVal = ConstantExpr::getCast(yyvsp[-5].CastOpVal, yyvsp[-3].ConstVal, DestTy);
|
||
delete yyvsp[-1].TypeVal;
|
||
}
|
||
break;
|
||
|
||
case 154:
|
||
#line 1719 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!isa<PointerType>(yyvsp[-2].ConstVal->getType()))
|
||
GEN_ERROR("GetElementPtr requires a pointer operand!");
|
||
|
||
const Type *IdxTy =
|
||
GetElementPtrInst::getIndexedType(yyvsp[-2].ConstVal->getType(), *yyvsp[-1].ValueList, true);
|
||
if (!IdxTy)
|
||
GEN_ERROR("Index list invalid for constant getelementptr!");
|
||
|
||
std::vector<Constant*> IdxVec;
|
||
for (unsigned i = 0, e = yyvsp[-1].ValueList->size(); i != e; ++i)
|
||
if (Constant *C = dyn_cast<Constant>((*yyvsp[-1].ValueList)[i]))
|
||
IdxVec.push_back(C);
|
||
else
|
||
GEN_ERROR("Indices to constant getelementptr must be constants!");
|
||
|
||
delete yyvsp[-1].ValueList;
|
||
|
||
yyval.ConstVal = ConstantExpr::getGetElementPtr(yyvsp[-2].ConstVal, IdxVec);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 155:
|
||
#line 1740 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (yyvsp[-5].ConstVal->getType() != Type::Int1Ty)
|
||
GEN_ERROR("Select condition must be of boolean type!");
|
||
if (yyvsp[-3].ConstVal->getType() != yyvsp[-1].ConstVal->getType())
|
||
GEN_ERROR("Select operand types must match!");
|
||
yyval.ConstVal = ConstantExpr::getSelect(yyvsp[-5].ConstVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 156:
|
||
#line 1748 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (yyvsp[-3].ConstVal->getType() != yyvsp[-1].ConstVal->getType())
|
||
GEN_ERROR("Binary operator types must match!");
|
||
CHECK_FOR_ERROR;
|
||
yyval.ConstVal = ConstantExpr::get(yyvsp[-5].BinaryOpVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal);
|
||
}
|
||
break;
|
||
|
||
case 157:
|
||
#line 1754 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (yyvsp[-3].ConstVal->getType() != yyvsp[-1].ConstVal->getType())
|
||
GEN_ERROR("Logical operator types must match!");
|
||
if (!yyvsp[-3].ConstVal->getType()->isInteger()) {
|
||
if (!isa<PackedType>(yyvsp[-3].ConstVal->getType()) ||
|
||
!cast<PackedType>(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 158:
|
||
#line 1765 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (yyvsp[-3].ConstVal->getType() != yyvsp[-1].ConstVal->getType())
|
||
GEN_ERROR("icmp operand types must match!");
|
||
yyval.ConstVal = ConstantExpr::getICmp(yyvsp[-5].IPredicate, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal);
|
||
}
|
||
break;
|
||
|
||
case 159:
|
||
#line 1770 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (yyvsp[-3].ConstVal->getType() != yyvsp[-1].ConstVal->getType())
|
||
GEN_ERROR("fcmp operand types must match!");
|
||
yyval.ConstVal = ConstantExpr::getFCmp(yyvsp[-5].FPredicate, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal);
|
||
}
|
||
break;
|
||
|
||
case 160:
|
||
#line 1775 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (yyvsp[-1].ConstVal->getType() != Type::Int8Ty)
|
||
GEN_ERROR("Shift count for shift constant must be i8 type!");
|
||
if (!yyvsp[-3].ConstVal->getType()->isInteger())
|
||
GEN_ERROR("Shift constant expression requires integer operand!");
|
||
CHECK_FOR_ERROR;
|
||
yyval.ConstVal = ConstantExpr::get(yyvsp[-5].OtherOpVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 161:
|
||
#line 1784 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!ExtractElementInst::isValidOperands(yyvsp[-3].ConstVal, yyvsp[-1].ConstVal))
|
||
GEN_ERROR("Invalid extractelement operands!");
|
||
yyval.ConstVal = ConstantExpr::getExtractElement(yyvsp[-3].ConstVal, yyvsp[-1].ConstVal);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 162:
|
||
#line 1790 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!InsertElementInst::isValidOperands(yyvsp[-5].ConstVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal))
|
||
GEN_ERROR("Invalid insertelement operands!");
|
||
yyval.ConstVal = ConstantExpr::getInsertElement(yyvsp[-5].ConstVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 163:
|
||
#line 1796 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!ShuffleVectorInst::isValidOperands(yyvsp[-5].ConstVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal))
|
||
GEN_ERROR("Invalid shufflevector operands!");
|
||
yyval.ConstVal = ConstantExpr::getShuffleVector(yyvsp[-5].ConstVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 164:
|
||
#line 1805 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.ConstVector = yyvsp[-2].ConstVector)->push_back(yyvsp[0].ConstVal);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 165:
|
||
#line 1809 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.ConstVector = new std::vector<Constant*>();
|
||
yyval.ConstVector->push_back(yyvsp[0].ConstVal);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 166:
|
||
#line 1817 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.BoolVal = false; }
|
||
break;
|
||
|
||
case 167:
|
||
#line 1817 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.BoolVal = true; }
|
||
break;
|
||
|
||
case 168:
|
||
#line 1828 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.ModuleVal = ParserResult = CurModule.CurrentModule;
|
||
CurModule.ModuleDone();
|
||
CHECK_FOR_ERROR;
|
||
}
|
||
break;
|
||
|
||
case 169:
|
||
#line 1833 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.ModuleVal = ParserResult = CurModule.CurrentModule;
|
||
CurModule.ModuleDone();
|
||
CHECK_FOR_ERROR;
|
||
}
|
||
break;
|
||
|
||
case 172:
|
||
#line 1846 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ CurFun.isDeclare = false; }
|
||
break;
|
||
|
||
case 173:
|
||
#line 1846 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CurFun.FunctionDone();
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 174:
|
||
#line 1850 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ CurFun.isDeclare = true; }
|
||
break;
|
||
|
||
case 175:
|
||
#line 1850 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 176:
|
||
#line 1853 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 177:
|
||
#line 1856 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
// Emit an error if there are any unresolved types left.
|
||
if (!CurModule.LateResolveTypes.empty()) {
|
||
const ValID &DID = CurModule.LateResolveTypes.begin()->first;
|
||
if (DID.Type == ValID::NameVal) {
|
||
GEN_ERROR("Reference to an undefined type: '"+DID.getName() + "'");
|
||
} else {
|
||
GEN_ERROR("Reference to an undefined type: #" + itostr(DID.Num));
|
||
}
|
||
}
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 178:
|
||
#line 1868 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!UpRefs.empty())
|
||
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[0].TypeVal)->getDescription());
|
||
// Eagerly resolve types. This is not an optimization, this is a
|
||
// requirement that is due to the fact that we could have this:
|
||
//
|
||
// %list = type { %list * }
|
||
// %list = type { %list * } ; repeated type decl
|
||
//
|
||
// If types are not resolved eagerly, then the two types will not be
|
||
// determined to be the same type!
|
||
//
|
||
ResolveTypeTo(yyvsp[-2].StrVal, *yyvsp[0].TypeVal);
|
||
|
||
if (!setTypeName(*yyvsp[0].TypeVal, yyvsp[-2].StrVal) && !yyvsp[-2].StrVal) {
|
||
CHECK_FOR_ERROR
|
||
// If this is a named type that is not a redefinition, add it to the slot
|
||
// table.
|
||
CurModule.Types.push_back(*yyvsp[0].TypeVal);
|
||
}
|
||
|
||
delete yyvsp[0].TypeVal;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 179:
|
||
#line 1892 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
ResolveTypeTo(yyvsp[-2].StrVal, yyvsp[0].PrimType);
|
||
|
||
if (!setTypeName(yyvsp[0].PrimType, yyvsp[-2].StrVal) && !yyvsp[-2].StrVal) {
|
||
CHECK_FOR_ERROR
|
||
// If this is a named type that is not a redefinition, add it to the slot
|
||
// table.
|
||
CurModule.Types.push_back(yyvsp[0].PrimType);
|
||
}
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 180:
|
||
#line 1903 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ /* "Externally Visible" Linkage */
|
||
if (yyvsp[0].ConstVal == 0)
|
||
GEN_ERROR("Global value initializer is not a constant!");
|
||
CurGV = ParseGlobalVariable(yyvsp[-3].StrVal, GlobalValue::ExternalLinkage,
|
||
yyvsp[-2].Visibility, yyvsp[-1].BoolVal, yyvsp[0].ConstVal->getType(), yyvsp[0].ConstVal);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 181:
|
||
#line 1909 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CurGV = 0;
|
||
}
|
||
break;
|
||
|
||
case 182:
|
||
#line 1912 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (yyvsp[0].ConstVal == 0)
|
||
GEN_ERROR("Global value initializer is not a constant!");
|
||
CurGV = ParseGlobalVariable(yyvsp[-4].StrVal, yyvsp[-3].Linkage, yyvsp[-2].Visibility, yyvsp[-1].BoolVal, yyvsp[0].ConstVal->getType(), yyvsp[0].ConstVal);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 183:
|
||
#line 1917 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CurGV = 0;
|
||
}
|
||
break;
|
||
|
||
case 184:
|
||
#line 1920 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!UpRefs.empty())
|
||
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[0].TypeVal)->getDescription());
|
||
CurGV = ParseGlobalVariable(yyvsp[-4].StrVal, yyvsp[-3].Linkage, yyvsp[-2].Visibility, yyvsp[-1].BoolVal, *yyvsp[0].TypeVal, 0);
|
||
CHECK_FOR_ERROR
|
||
delete yyvsp[0].TypeVal;
|
||
}
|
||
break;
|
||
|
||
case 185:
|
||
#line 1926 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CurGV = 0;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 186:
|
||
#line 1930 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 187:
|
||
#line 1933 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 188:
|
||
#line 1939 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
const std::string &AsmSoFar = CurModule.CurrentModule->getModuleInlineAsm();
|
||
char *EndStr = UnEscapeLexed(yyvsp[0].StrVal, true);
|
||
std::string NewAsm(yyvsp[0].StrVal, EndStr);
|
||
free(yyvsp[0].StrVal);
|
||
|
||
if (AsmSoFar.empty())
|
||
CurModule.CurrentModule->setModuleInlineAsm(NewAsm);
|
||
else
|
||
CurModule.CurrentModule->setModuleInlineAsm(AsmSoFar+"\n"+NewAsm);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 189:
|
||
#line 1952 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Endianness = Module::BigEndian; }
|
||
break;
|
||
|
||
case 190:
|
||
#line 1953 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.Endianness = Module::LittleEndian; }
|
||
break;
|
||
|
||
case 191:
|
||
#line 1955 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CurModule.CurrentModule->setEndianness(yyvsp[0].Endianness);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 192:
|
||
#line 1959 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (yyvsp[0].UInt64Val == 32)
|
||
CurModule.CurrentModule->setPointerSize(Module::Pointer32);
|
||
else if (yyvsp[0].UInt64Val == 64)
|
||
CurModule.CurrentModule->setPointerSize(Module::Pointer64);
|
||
else
|
||
GEN_ERROR("Invalid pointer size: '" + utostr(yyvsp[0].UInt64Val) + "'!");
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 193:
|
||
#line 1968 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CurModule.CurrentModule->setTargetTriple(yyvsp[0].StrVal);
|
||
free(yyvsp[0].StrVal);
|
||
}
|
||
break;
|
||
|
||
case 194:
|
||
#line 1972 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CurModule.CurrentModule->setDataLayout(yyvsp[0].StrVal);
|
||
free(yyvsp[0].StrVal);
|
||
}
|
||
break;
|
||
|
||
case 196:
|
||
#line 1979 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CurModule.CurrentModule->addLibrary(yyvsp[0].StrVal);
|
||
free(yyvsp[0].StrVal);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 197:
|
||
#line 1984 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CurModule.CurrentModule->addLibrary(yyvsp[0].StrVal);
|
||
free(yyvsp[0].StrVal);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 198:
|
||
#line 1989 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 202:
|
||
#line 1999 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.StrVal = 0; }
|
||
break;
|
||
|
||
case 203:
|
||
#line 2001 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!UpRefs.empty())
|
||
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-2].TypeVal)->getDescription());
|
||
if (*yyvsp[-2].TypeVal == Type::VoidTy)
|
||
GEN_ERROR("void typed arguments are invalid!");
|
||
ArgListEntry E; E.Attrs = yyvsp[-1].ParamAttrs; E.Ty = yyvsp[-2].TypeVal; E.Name = yyvsp[0].StrVal;
|
||
yyval.ArgList = yyvsp[-4].ArgList;
|
||
yyvsp[-4].ArgList->push_back(E);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 204:
|
||
#line 2011 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!UpRefs.empty())
|
||
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-2].TypeVal)->getDescription());
|
||
if (*yyvsp[-2].TypeVal == Type::VoidTy)
|
||
GEN_ERROR("void typed arguments are invalid!");
|
||
ArgListEntry E; E.Attrs = yyvsp[-1].ParamAttrs; E.Ty = yyvsp[-2].TypeVal; E.Name = yyvsp[0].StrVal;
|
||
yyval.ArgList = new ArgListType;
|
||
yyval.ArgList->push_back(E);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 205:
|
||
#line 2022 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.ArgList = yyvsp[0].ArgList;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 206:
|
||
#line 2026 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.ArgList = yyvsp[-2].ArgList;
|
||
struct ArgListEntry E;
|
||
E.Ty = new PATypeHolder(Type::VoidTy);
|
||
E.Name = 0;
|
||
E.Attrs = FunctionType::NoAttributeSet;
|
||
yyval.ArgList->push_back(E);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 207:
|
||
#line 2035 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.ArgList = new ArgListType;
|
||
struct ArgListEntry E;
|
||
E.Ty = new PATypeHolder(Type::VoidTy);
|
||
E.Name = 0;
|
||
E.Attrs = FunctionType::NoAttributeSet;
|
||
yyval.ArgList->push_back(E);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 208:
|
||
#line 2044 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.ArgList = 0;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 209:
|
||
#line 2050 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
UnEscapeLexed(yyvsp[-6].StrVal);
|
||
std::string FunctionName(yyvsp[-6].StrVal);
|
||
free(yyvsp[-6].StrVal); // Free strdup'd memory!
|
||
|
||
// Check the function result for abstractness if this is a define. We should
|
||
// have no abstract types at this point
|
||
if (!CurFun.isDeclare && CurModule.TypeIsUnresolved(yyvsp[-7].TypeVal))
|
||
GEN_ERROR("Reference to abstract result: "+ yyvsp[-7].TypeVal->get()->getDescription());
|
||
|
||
std::vector<const Type*> ParamTypeList;
|
||
std::vector<FunctionType::ParameterAttributes> ParamAttrs;
|
||
ParamAttrs.push_back(yyvsp[-2].ParamAttrs);
|
||
if (yyvsp[-4].ArgList) { // If there are arguments...
|
||
for (ArgListType::iterator I = yyvsp[-4].ArgList->begin(); I != yyvsp[-4].ArgList->end(); ++I) {
|
||
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)
|
||
ParamAttrs.push_back(I->Attrs);
|
||
}
|
||
}
|
||
|
||
bool isVarArg = ParamTypeList.size() && ParamTypeList.back() == Type::VoidTy;
|
||
if (isVarArg) ParamTypeList.pop_back();
|
||
|
||
FunctionType *FT = FunctionType::get(*yyvsp[-7].TypeVal, ParamTypeList, isVarArg,
|
||
ParamAttrs);
|
||
const PointerType *PFT = PointerType::get(FT);
|
||
delete yyvsp[-7].TypeVal;
|
||
|
||
ValID ID;
|
||
if (!FunctionName.empty()) {
|
||
ID = ValID::create((char*)FunctionName.c_str());
|
||
} else {
|
||
ID = ValID::create((int)CurModule.Values[PFT].size());
|
||
}
|
||
|
||
Function *Fn = 0;
|
||
// See if this function was forward referenced. If so, recycle the object.
|
||
if (GlobalValue *FWRef = CurModule.GetForwardRefForGlobal(PFT, ID)) {
|
||
// Move the function to the end of the list, from whereever it was
|
||
// previously inserted.
|
||
Fn = cast<Function>(FWRef);
|
||
CurModule.CurrentModule->getFunctionList().remove(Fn);
|
||
CurModule.CurrentModule->getFunctionList().push_back(Fn);
|
||
} else if (!FunctionName.empty() && // Merge with an earlier prototype?
|
||
(Fn = CurModule.CurrentModule->getFunction(FunctionName, FT))) {
|
||
// If this is the case, either we need to be a forward decl, or it needs
|
||
// to be.
|
||
if (!CurFun.isDeclare && !Fn->isExternal())
|
||
GEN_ERROR("Redefinition of function '" + FunctionName + "'!");
|
||
|
||
// Make sure to strip off any argument names so we can't get conflicts.
|
||
if (Fn->isExternal())
|
||
for (Function::arg_iterator AI = Fn->arg_begin(), AE = Fn->arg_end();
|
||
AI != AE; ++AI)
|
||
AI->setName("");
|
||
} else { // Not already defined?
|
||
Fn = new Function(FT, GlobalValue::ExternalLinkage, FunctionName,
|
||
CurModule.CurrentModule);
|
||
|
||
InsertValue(Fn, CurModule.Values);
|
||
}
|
||
|
||
CurFun.FunctionStart(Fn);
|
||
|
||
if (CurFun.isDeclare) {
|
||
// If we have declaration, always overwrite linkage. This will allow us to
|
||
// correctly handle cases, when pointer to function is passed as argument to
|
||
// another function.
|
||
Fn->setLinkage(CurFun.Linkage);
|
||
Fn->setVisibility(CurFun.Visibility);
|
||
}
|
||
Fn->setCallingConv(yyvsp[-8].UIntVal);
|
||
Fn->setAlignment(yyvsp[0].UIntVal);
|
||
if (yyvsp[-1].StrVal) {
|
||
Fn->setSection(yyvsp[-1].StrVal);
|
||
free(yyvsp[-1].StrVal);
|
||
}
|
||
|
||
// Add all of the arguments we parsed to the function...
|
||
if (yyvsp[-4].ArgList) { // Is null if empty...
|
||
if (isVarArg) { // Nuke the last entry
|
||
assert(yyvsp[-4].ArgList->back().Ty->get() == Type::VoidTy && yyvsp[-4].ArgList->back().Name == 0&&
|
||
"Not a varargs marker!");
|
||
delete yyvsp[-4].ArgList->back().Ty;
|
||
yyvsp[-4].ArgList->pop_back(); // Delete the last entry
|
||
}
|
||
Function::arg_iterator ArgIt = Fn->arg_begin();
|
||
unsigned Idx = 1;
|
||
for (ArgListType::iterator I = yyvsp[-4].ArgList->begin(); I != yyvsp[-4].ArgList->end(); ++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 212:
|
||
#line 2157 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.FunctionVal = CurFun.CurrentFunction;
|
||
|
||
// Make sure that we keep track of the linkage type even if there was a
|
||
// previous "declare".
|
||
yyval.FunctionVal->setLinkage(yyvsp[-3].Linkage);
|
||
yyval.FunctionVal->setVisibility(yyvsp[-2].Visibility);
|
||
}
|
||
break;
|
||
|
||
case 215:
|
||
#line 2168 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.FunctionVal = yyvsp[-1].FunctionVal;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 216:
|
||
#line 2173 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CurFun.CurrentFunction->setLinkage(yyvsp[-2].Linkage);
|
||
CurFun.CurrentFunction->setVisibility(yyvsp[-1].Visibility);
|
||
yyval.FunctionVal = CurFun.CurrentFunction;
|
||
CurFun.FunctionDone();
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 217:
|
||
#line 2185 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.BoolVal = false;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 218:
|
||
#line 2189 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.BoolVal = true;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 219:
|
||
#line 2194 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // A reference to a direct constant
|
||
yyval.ValIDVal = ValID::create(yyvsp[0].SInt64Val);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 220:
|
||
#line 2198 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.ValIDVal = ValID::create(yyvsp[0].UInt64Val);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 221:
|
||
#line 2202 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Perhaps it's an FP constant?
|
||
yyval.ValIDVal = ValID::create(yyvsp[0].FPVal);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 222:
|
||
#line 2206 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.ValIDVal = ValID::create(ConstantInt::getTrue());
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 223:
|
||
#line 2210 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.ValIDVal = ValID::create(ConstantInt::getFalse());
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 224:
|
||
#line 2214 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.ValIDVal = ValID::createNull();
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 225:
|
||
#line 2218 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.ValIDVal = ValID::createUndef();
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 226:
|
||
#line 2222 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // A vector zero constant.
|
||
yyval.ValIDVal = ValID::createZeroInit();
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 227:
|
||
#line 2226 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Nonempty unsized packed vector
|
||
const Type *ETy = (*yyvsp[-1].ConstVector)[0]->getType();
|
||
int NumElements = yyvsp[-1].ConstVector->size();
|
||
|
||
PackedType* pt = PackedType::get(ETy, NumElements);
|
||
PATypeHolder* PTy = new PATypeHolder(
|
||
HandleUpRefs(
|
||
PackedType::get(
|
||
ETy,
|
||
NumElements)
|
||
)
|
||
);
|
||
|
||
// Verify all elements are correct type!
|
||
for (unsigned i = 0; i < yyvsp[-1].ConstVector->size(); i++) {
|
||
if (ETy != (*yyvsp[-1].ConstVector)[i]->getType())
|
||
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(ConstantPacked::get(pt, *yyvsp[-1].ConstVector));
|
||
delete PTy; delete yyvsp[-1].ConstVector;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 228:
|
||
#line 2251 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.ValIDVal = ValID::create(yyvsp[0].ConstVal);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 229:
|
||
#line 2255 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
char *End = UnEscapeLexed(yyvsp[-2].StrVal, true);
|
||
std::string AsmStr = std::string(yyvsp[-2].StrVal, End);
|
||
End = UnEscapeLexed(yyvsp[0].StrVal, true);
|
||
std::string Constraints = std::string(yyvsp[0].StrVal, End);
|
||
yyval.ValIDVal = ValID::createInlineAsm(AsmStr, Constraints, yyvsp[-3].BoolVal);
|
||
free(yyvsp[-2].StrVal);
|
||
free(yyvsp[0].StrVal);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 230:
|
||
#line 2269 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Is it an integer reference...?
|
||
yyval.ValIDVal = ValID::create(yyvsp[0].SIntVal);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 231:
|
||
#line 2273 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Is it a named reference...?
|
||
yyval.ValIDVal = ValID::create(yyvsp[0].StrVal);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 234:
|
||
#line 2285 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!UpRefs.empty())
|
||
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription());
|
||
yyval.ValueVal = getVal(*yyvsp[-1].TypeVal, yyvsp[0].ValIDVal);
|
||
delete yyvsp[-1].TypeVal;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 235:
|
||
#line 2294 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.FunctionVal = yyvsp[-1].FunctionVal;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 236:
|
||
#line 2298 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Do not allow functions with 0 basic blocks
|
||
yyval.FunctionVal = yyvsp[-1].FunctionVal;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 237:
|
||
#line 2307 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
setValueName(yyvsp[0].TermInstVal, yyvsp[-1].StrVal);
|
||
CHECK_FOR_ERROR
|
||
InsertValue(yyvsp[0].TermInstVal);
|
||
|
||
yyvsp[-2].BasicBlockVal->getInstList().push_back(yyvsp[0].TermInstVal);
|
||
InsertValue(yyvsp[-2].BasicBlockVal);
|
||
yyval.BasicBlockVal = yyvsp[-2].BasicBlockVal;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 238:
|
||
#line 2318 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (CastInst *CI1 = dyn_cast<CastInst>(yyvsp[0].InstVal))
|
||
if (CastInst *CI2 = dyn_cast<CastInst>(CI1->getOperand(0)))
|
||
if (CI2->getParent() == 0)
|
||
yyvsp[-1].BasicBlockVal->getInstList().push_back(CI2);
|
||
yyvsp[-1].BasicBlockVal->getInstList().push_back(yyvsp[0].InstVal);
|
||
yyval.BasicBlockVal = yyvsp[-1].BasicBlockVal;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 239:
|
||
#line 2327 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.BasicBlockVal = getBBVal(ValID::create((int)CurFun.NextBBNum++), true);
|
||
CHECK_FOR_ERROR
|
||
|
||
// Make sure to move the basic block to the correct location in the
|
||
// function, instead of leaving it inserted wherever it was first
|
||
// referenced.
|
||
Function::BasicBlockListType &BBL =
|
||
CurFun.CurrentFunction->getBasicBlockList();
|
||
BBL.splice(BBL.end(), BBL, yyval.BasicBlockVal);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 240:
|
||
#line 2339 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.BasicBlockVal = getBBVal(ValID::create(yyvsp[0].StrVal), true);
|
||
CHECK_FOR_ERROR
|
||
|
||
// Make sure to move the basic block to the correct location in the
|
||
// function, instead of leaving it inserted wherever it was first
|
||
// referenced.
|
||
Function::BasicBlockListType &BBL =
|
||
CurFun.CurrentFunction->getBasicBlockList();
|
||
BBL.splice(BBL.end(), BBL, yyval.BasicBlockVal);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 241:
|
||
#line 2352 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Return with a result...
|
||
yyval.TermInstVal = new ReturnInst(yyvsp[0].ValueVal);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 242:
|
||
#line 2356 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Return with no result...
|
||
yyval.TermInstVal = new ReturnInst();
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 243:
|
||
#line 2360 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Unconditional Branch...
|
||
BasicBlock* tmpBB = getBBVal(yyvsp[0].ValIDVal);
|
||
CHECK_FOR_ERROR
|
||
yyval.TermInstVal = new BranchInst(tmpBB);
|
||
}
|
||
break;
|
||
|
||
case 244:
|
||
#line 2365 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
assert(cast<IntegerType>(yyvsp[-7].PrimType)->getBitWidth() == 1 && "Not Bool?");
|
||
BasicBlock* tmpBBA = getBBVal(yyvsp[-3].ValIDVal);
|
||
CHECK_FOR_ERROR
|
||
BasicBlock* tmpBBB = getBBVal(yyvsp[0].ValIDVal);
|
||
CHECK_FOR_ERROR
|
||
Value* tmpVal = getVal(Type::Int1Ty, yyvsp[-6].ValIDVal);
|
||
CHECK_FOR_ERROR
|
||
yyval.TermInstVal = new BranchInst(tmpBBA, tmpBBB, tmpVal);
|
||
}
|
||
break;
|
||
|
||
case 245:
|
||
#line 2375 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
Value* tmpVal = getVal(yyvsp[-7].PrimType, yyvsp[-6].ValIDVal);
|
||
CHECK_FOR_ERROR
|
||
BasicBlock* tmpBB = getBBVal(yyvsp[-3].ValIDVal);
|
||
CHECK_FOR_ERROR
|
||
SwitchInst *S = new SwitchInst(tmpVal, tmpBB, yyvsp[-1].JumpTable->size());
|
||
yyval.TermInstVal = S;
|
||
|
||
std::vector<std::pair<Constant*,BasicBlock*> >::iterator I = yyvsp[-1].JumpTable->begin(),
|
||
E = yyvsp[-1].JumpTable->end();
|
||
for (; I != E; ++I) {
|
||
if (ConstantInt *CI = dyn_cast<ConstantInt>(I->first))
|
||
S->addCase(CI, I->second);
|
||
else
|
||
GEN_ERROR("Switch case is constant, but not a simple integer!");
|
||
}
|
||
delete yyvsp[-1].JumpTable;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 246:
|
||
#line 2394 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
Value* tmpVal = getVal(yyvsp[-6].PrimType, yyvsp[-5].ValIDVal);
|
||
CHECK_FOR_ERROR
|
||
BasicBlock* tmpBB = getBBVal(yyvsp[-2].ValIDVal);
|
||
CHECK_FOR_ERROR
|
||
SwitchInst *S = new SwitchInst(tmpVal, tmpBB, 0);
|
||
yyval.TermInstVal = S;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 247:
|
||
#line 2404 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
|
||
// Handle the short syntax
|
||
const PointerType *PFTy = 0;
|
||
const FunctionType *Ty = 0;
|
||
if (!(PFTy = dyn_cast<PointerType>(yyvsp[-11].TypeVal->get())) ||
|
||
!(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) {
|
||
// Pull out the types of all of the arguments...
|
||
std::vector<const Type*> ParamTypes;
|
||
FunctionType::ParamAttrsList ParamAttrs;
|
||
ParamAttrs.push_back(yyvsp[-6].ParamAttrs);
|
||
for (ValueRefList::iterator I = yyvsp[-8].ValueRefList->begin(), E = yyvsp[-8].ValueRefList->end(); I != E; ++I) {
|
||
const Type *Ty = I->Val->getType();
|
||
if (Ty == Type::VoidTy)
|
||
GEN_ERROR("Short call syntax cannot be used with varargs");
|
||
ParamTypes.push_back(Ty);
|
||
ParamAttrs.push_back(I->Attrs);
|
||
}
|
||
|
||
Ty = FunctionType::get(yyvsp[-11].TypeVal->get(), ParamTypes, false, ParamAttrs);
|
||
PFTy = PointerType::get(Ty);
|
||
}
|
||
|
||
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);
|
||
II->setCallingConv(yyvsp[-12].UIntVal);
|
||
yyval.TermInstVal = II;
|
||
delete yyvsp[-8].ValueRefList;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 248:
|
||
#line 2470 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.TermInstVal = new UnwindInst();
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 249:
|
||
#line 2474 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.TermInstVal = new UnreachableInst();
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 250:
|
||
#line 2481 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.JumpTable = yyvsp[-5].JumpTable;
|
||
Constant *V = cast<Constant>(getValNonImprovising(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 251:
|
||
#line 2492 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.JumpTable = new std::vector<std::pair<Constant*, BasicBlock*> >();
|
||
Constant *V = cast<Constant>(getValNonImprovising(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 252:
|
||
#line 2505 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
// Is this definition named?? if so, assign the name...
|
||
setValueName(yyvsp[0].InstVal, yyvsp[-1].StrVal);
|
||
CHECK_FOR_ERROR
|
||
InsertValue(yyvsp[0].InstVal);
|
||
yyval.InstVal = yyvsp[0].InstVal;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 253:
|
||
#line 2514 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Used for PHI nodes
|
||
if (!UpRefs.empty())
|
||
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-5].TypeVal)->getDescription());
|
||
yyval.PHIList = new std::list<std::pair<Value*, BasicBlock*> >();
|
||
Value* tmpVal = getVal(*yyvsp[-5].TypeVal, yyvsp[-3].ValIDVal);
|
||
CHECK_FOR_ERROR
|
||
BasicBlock* tmpBB = getBBVal(yyvsp[-1].ValIDVal);
|
||
CHECK_FOR_ERROR
|
||
yyval.PHIList->push_back(std::make_pair(tmpVal, tmpBB));
|
||
delete yyvsp[-5].TypeVal;
|
||
}
|
||
break;
|
||
|
||
case 254:
|
||
#line 2525 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.PHIList = yyvsp[-6].PHIList;
|
||
Value* tmpVal = getVal(yyvsp[-6].PHIList->front().first->getType(), yyvsp[-3].ValIDVal);
|
||
CHECK_FOR_ERROR
|
||
BasicBlock* tmpBB = getBBVal(yyvsp[-1].ValIDVal);
|
||
CHECK_FOR_ERROR
|
||
yyvsp[-6].PHIList->push_back(std::make_pair(tmpVal, tmpBB));
|
||
}
|
||
break;
|
||
|
||
case 255:
|
||
#line 2535 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!UpRefs.empty())
|
||
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-2].TypeVal)->getDescription());
|
||
// Used for call and invoke instructions
|
||
yyval.ValueRefList = new ValueRefList();
|
||
ValueRefListEntry E; E.Attrs = yyvsp[0].ParamAttrs; E.Val = getVal(yyvsp[-2].TypeVal->get(), yyvsp[-1].ValIDVal);
|
||
yyval.ValueRefList->push_back(E);
|
||
}
|
||
break;
|
||
|
||
case 256:
|
||
#line 2543 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!UpRefs.empty())
|
||
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-2].TypeVal)->getDescription());
|
||
yyval.ValueRefList = yyvsp[-4].ValueRefList;
|
||
ValueRefListEntry E; E.Attrs = yyvsp[0].ParamAttrs; E.Val = getVal(yyvsp[-2].TypeVal->get(), yyvsp[-1].ValIDVal);
|
||
yyval.ValueRefList->push_back(E);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 257:
|
||
#line 2551 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.ValueRefList = new ValueRefList(); }
|
||
break;
|
||
|
||
case 258:
|
||
#line 2554 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ yyval.ValueList = new std::vector<Value*>(); }
|
||
break;
|
||
|
||
case 259:
|
||
#line 2555 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.ValueList = yyvsp[-2].ValueList;
|
||
yyval.ValueList->push_back(yyvsp[0].ValueVal);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 260:
|
||
#line 2562 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.BoolVal = true;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 261:
|
||
#line 2566 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.BoolVal = false;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 262:
|
||
#line 2571 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!UpRefs.empty())
|
||
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-3].TypeVal)->getDescription());
|
||
if (!(*yyvsp[-3].TypeVal)->isInteger() && !(*yyvsp[-3].TypeVal)->isFloatingPoint() &&
|
||
!isa<PackedType>((*yyvsp[-3].TypeVal).get()))
|
||
GEN_ERROR(
|
||
"Arithmetic operator requires integer, FP, or packed operands!");
|
||
if (isa<PackedType>((*yyvsp[-3].TypeVal).get()) &&
|
||
(yyvsp[-4].BinaryOpVal == Instruction::URem ||
|
||
yyvsp[-4].BinaryOpVal == Instruction::SRem ||
|
||
yyvsp[-4].BinaryOpVal == Instruction::FRem))
|
||
GEN_ERROR("U/S/FRem not supported on packed 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 263:
|
||
#line 2592 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!UpRefs.empty())
|
||
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-3].TypeVal)->getDescription());
|
||
if (!(*yyvsp[-3].TypeVal)->isInteger()) {
|
||
if (!isa<PackedType>(yyvsp[-3].TypeVal->get()) ||
|
||
!cast<PackedType>(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 264:
|
||
#line 2609 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!UpRefs.empty())
|
||
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-3].TypeVal)->getDescription());
|
||
if (isa<PackedType>((*yyvsp[-3].TypeVal).get()))
|
||
GEN_ERROR("Packed 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!");
|
||
}
|
||
break;
|
||
|
||
case 265:
|
||
#line 2622 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!UpRefs.empty())
|
||
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-3].TypeVal)->getDescription());
|
||
if (isa<PackedType>((*yyvsp[-3].TypeVal).get()))
|
||
GEN_ERROR("Packed 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!");
|
||
}
|
||
break;
|
||
|
||
case 266:
|
||
#line 2635 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (yyvsp[0].ValueVal->getType() != Type::Int8Ty)
|
||
GEN_ERROR("Shift amount must be i8 type!");
|
||
if (!yyvsp[-2].ValueVal->getType()->isInteger())
|
||
GEN_ERROR("Shift constant expression requires integer operand!");
|
||
CHECK_FOR_ERROR;
|
||
yyval.InstVal = new ShiftInst(yyvsp[-3].OtherOpVal, yyvsp[-2].ValueVal, yyvsp[0].ValueVal);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 267:
|
||
#line 2644 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!UpRefs.empty())
|
||
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[0].TypeVal)->getDescription());
|
||
Value* Val = yyvsp[-2].ValueVal;
|
||
const Type* DestTy = yyvsp[0].TypeVal->get();
|
||
if (!CastInst::castIsValid(yyvsp[-3].CastOpVal, Val, DestTy))
|
||
GEN_ERROR("invalid cast opcode for cast from '" +
|
||
Val->getType()->getDescription() + "' to '" +
|
||
DestTy->getDescription() + "'!");
|
||
yyval.InstVal = CastInst::create(yyvsp[-3].CastOpVal, Val, DestTy);
|
||
delete yyvsp[0].TypeVal;
|
||
}
|
||
break;
|
||
|
||
case 268:
|
||
#line 2656 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (yyvsp[-4].ValueVal->getType() != Type::Int1Ty)
|
||
GEN_ERROR("select condition must be boolean!");
|
||
if (yyvsp[-2].ValueVal->getType() != yyvsp[0].ValueVal->getType())
|
||
GEN_ERROR("select value types should match!");
|
||
yyval.InstVal = new SelectInst(yyvsp[-4].ValueVal, yyvsp[-2].ValueVal, yyvsp[0].ValueVal);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 269:
|
||
#line 2664 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!UpRefs.empty())
|
||
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[0].TypeVal)->getDescription());
|
||
yyval.InstVal = new VAArgInst(yyvsp[-2].ValueVal, *yyvsp[0].TypeVal);
|
||
delete yyvsp[0].TypeVal;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 270:
|
||
#line 2671 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!ExtractElementInst::isValidOperands(yyvsp[-2].ValueVal, yyvsp[0].ValueVal))
|
||
GEN_ERROR("Invalid extractelement operands!");
|
||
yyval.InstVal = new ExtractElementInst(yyvsp[-2].ValueVal, yyvsp[0].ValueVal);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 271:
|
||
#line 2677 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!InsertElementInst::isValidOperands(yyvsp[-4].ValueVal, yyvsp[-2].ValueVal, yyvsp[0].ValueVal))
|
||
GEN_ERROR("Invalid insertelement operands!");
|
||
yyval.InstVal = new InsertElementInst(yyvsp[-4].ValueVal, yyvsp[-2].ValueVal, yyvsp[0].ValueVal);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 272:
|
||
#line 2683 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!ShuffleVectorInst::isValidOperands(yyvsp[-4].ValueVal, yyvsp[-2].ValueVal, yyvsp[0].ValueVal))
|
||
GEN_ERROR("Invalid shufflevector operands!");
|
||
yyval.InstVal = new ShuffleVectorInst(yyvsp[-4].ValueVal, yyvsp[-2].ValueVal, yyvsp[0].ValueVal);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 273:
|
||
#line 2689 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
const Type *Ty = yyvsp[0].PHIList->front().first->getType();
|
||
if (!Ty->isFirstClassType())
|
||
GEN_ERROR("PHI node operands must be of first class type!");
|
||
yyval.InstVal = new PHINode(Ty);
|
||
((PHINode*)yyval.InstVal)->reserveOperandSpace(yyvsp[0].PHIList->size());
|
||
while (yyvsp[0].PHIList->begin() != yyvsp[0].PHIList->end()) {
|
||
if (yyvsp[0].PHIList->front().first->getType() != Ty)
|
||
GEN_ERROR("All elements of a PHI node must be of the same type!");
|
||
cast<PHINode>(yyval.InstVal)->addIncoming(yyvsp[0].PHIList->front().first, yyvsp[0].PHIList->front().second);
|
||
yyvsp[0].PHIList->pop_front();
|
||
}
|
||
delete yyvsp[0].PHIList; // Free the list...
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 274:
|
||
#line 2705 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
|
||
// Handle the short syntax
|
||
const PointerType *PFTy = 0;
|
||
const FunctionType *Ty = 0;
|
||
if (!(PFTy = dyn_cast<PointerType>(yyvsp[-5].TypeVal->get())) ||
|
||
!(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) {
|
||
// Pull out the types of all of the arguments...
|
||
std::vector<const Type*> ParamTypes;
|
||
FunctionType::ParamAttrsList ParamAttrs;
|
||
ParamAttrs.push_back(yyvsp[0].ParamAttrs);
|
||
for (ValueRefList::iterator I = yyvsp[-2].ValueRefList->begin(), E = yyvsp[-2].ValueRefList->end(); I != E; ++I) {
|
||
const Type *Ty = I->Val->getType();
|
||
if (Ty == Type::VoidTy)
|
||
GEN_ERROR("Short call syntax cannot be used with varargs");
|
||
ParamTypes.push_back(Ty);
|
||
ParamAttrs.push_back(I->Attrs);
|
||
}
|
||
|
||
Ty = FunctionType::get(yyvsp[-5].TypeVal->get(), ParamTypes, false, ParamAttrs);
|
||
PFTy = PointerType::get(Ty);
|
||
}
|
||
|
||
Value *V = getVal(PFTy, yyvsp[-4].ValIDVal); // Get the function we're calling...
|
||
CHECK_FOR_ERROR
|
||
|
||
// 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);
|
||
CI->setTailCall(yyvsp[-7].BoolVal);
|
||
CI->setCallingConv(yyvsp[-6].UIntVal);
|
||
yyval.InstVal = CI;
|
||
delete yyvsp[-2].ValueRefList;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 275:
|
||
#line 2767 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.InstVal = yyvsp[0].InstVal;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 276:
|
||
#line 2772 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.BoolVal = true;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 277:
|
||
#line 2776 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
yyval.BoolVal = false;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 278:
|
||
#line 2783 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!UpRefs.empty())
|
||
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription());
|
||
yyval.InstVal = new MallocInst(*yyvsp[-1].TypeVal, 0, yyvsp[0].UIntVal);
|
||
delete yyvsp[-1].TypeVal;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 279:
|
||
#line 2790 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!UpRefs.empty())
|
||
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-4].TypeVal)->getDescription());
|
||
Value* tmpVal = getVal(yyvsp[-2].PrimType, yyvsp[-1].ValIDVal);
|
||
CHECK_FOR_ERROR
|
||
yyval.InstVal = new MallocInst(*yyvsp[-4].TypeVal, tmpVal, yyvsp[0].UIntVal);
|
||
delete yyvsp[-4].TypeVal;
|
||
}
|
||
break;
|
||
|
||
case 280:
|
||
#line 2798 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!UpRefs.empty())
|
||
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription());
|
||
yyval.InstVal = new AllocaInst(*yyvsp[-1].TypeVal, 0, yyvsp[0].UIntVal);
|
||
delete yyvsp[-1].TypeVal;
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 281:
|
||
#line 2805 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!UpRefs.empty())
|
||
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-4].TypeVal)->getDescription());
|
||
Value* tmpVal = getVal(yyvsp[-2].PrimType, yyvsp[-1].ValIDVal);
|
||
CHECK_FOR_ERROR
|
||
yyval.InstVal = new AllocaInst(*yyvsp[-4].TypeVal, tmpVal, yyvsp[0].UIntVal);
|
||
delete yyvsp[-4].TypeVal;
|
||
}
|
||
break;
|
||
|
||
case 282:
|
||
#line 2813 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!isa<PointerType>(yyvsp[0].ValueVal->getType()))
|
||
GEN_ERROR("Trying to free nonpointer type " +
|
||
yyvsp[0].ValueVal->getType()->getDescription() + "!");
|
||
yyval.InstVal = new FreeInst(yyvsp[0].ValueVal);
|
||
CHECK_FOR_ERROR
|
||
}
|
||
break;
|
||
|
||
case 283:
|
||
#line 2821 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!UpRefs.empty())
|
||
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription());
|
||
if (!isa<PointerType>(yyvsp[-1].TypeVal->get()))
|
||
GEN_ERROR("Can't load from nonpointer type: " +
|
||
(*yyvsp[-1].TypeVal)->getDescription());
|
||
if (!cast<PointerType>(yyvsp[-1].TypeVal->get())->getElementType()->isFirstClassType())
|
||
GEN_ERROR("Can't load from pointer of non-first-class type: " +
|
||
(*yyvsp[-1].TypeVal)->getDescription());
|
||
Value* tmpVal = getVal(*yyvsp[-1].TypeVal, yyvsp[0].ValIDVal);
|
||
CHECK_FOR_ERROR
|
||
yyval.InstVal = new LoadInst(tmpVal, "", yyvsp[-3].BoolVal);
|
||
delete yyvsp[-1].TypeVal;
|
||
}
|
||
break;
|
||
|
||
case 284:
|
||
#line 2835 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!UpRefs.empty())
|
||
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription());
|
||
const PointerType *PT = dyn_cast<PointerType>(yyvsp[-1].TypeVal->get());
|
||
if (!PT)
|
||
GEN_ERROR("Can't store to a nonpointer type: " +
|
||
(*yyvsp[-1].TypeVal)->getDescription());
|
||
const Type *ElTy = PT->getElementType();
|
||
if (ElTy != yyvsp[-3].ValueVal->getType())
|
||
GEN_ERROR("Can't store '" + yyvsp[-3].ValueVal->getType()->getDescription() +
|
||
"' into space of type '" + ElTy->getDescription() + "'!");
|
||
|
||
Value* tmpVal = getVal(*yyvsp[-1].TypeVal, yyvsp[0].ValIDVal);
|
||
CHECK_FOR_ERROR
|
||
yyval.InstVal = new StoreInst(yyvsp[-3].ValueVal, tmpVal, yyvsp[-5].BoolVal);
|
||
delete yyvsp[-1].TypeVal;
|
||
}
|
||
break;
|
||
|
||
case 285:
|
||
#line 2852 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!UpRefs.empty())
|
||
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-2].TypeVal)->getDescription());
|
||
if (!isa<PointerType>(yyvsp[-2].TypeVal->get()))
|
||
GEN_ERROR("getelementptr insn requires pointer operand!");
|
||
|
||
if (!GetElementPtrInst::getIndexedType(*yyvsp[-2].TypeVal, *yyvsp[0].ValueList, 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);
|
||
delete yyvsp[-2].TypeVal;
|
||
delete yyvsp[0].ValueList;
|
||
}
|
||
break;
|
||
|
||
|
||
}
|
||
|
||
/* Line 1016 of /usr/local/share/bison/yacc.c. */
|
||
#line 5406 "llvmAsmParser.tab.c"
|
||
|
||
yyvsp -= yylen;
|
||
yyssp -= yylen;
|
||
|
||
|
||
#if YYDEBUG
|
||
if (yydebug)
|
||
{
|
||
short *yyssp1 = yyss - 1;
|
||
YYFPRINTF (stderr, "state stack now");
|
||
while (yyssp1 != yyssp)
|
||
YYFPRINTF (stderr, " %d", *++yyssp1);
|
||
YYFPRINTF (stderr, "\n");
|
||
}
|
||
#endif
|
||
|
||
*++yyvsp = yyval;
|
||
|
||
|
||
/* Now `shift' the result of the reduction. Determine what state
|
||
that goes to, based on the state we popped back to and the rule
|
||
number reduced by. */
|
||
|
||
yyn = yyr1[yyn];
|
||
|
||
yystate = yypgoto[yyn - YYNTOKENS] + *yyssp;
|
||
if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp)
|
||
yystate = yytable[yystate];
|
||
else
|
||
yystate = yydefgoto[yyn - YYNTOKENS];
|
||
|
||
goto yynewstate;
|
||
|
||
|
||
/*------------------------------------.
|
||
| yyerrlab -- here on detecting error |
|
||
`------------------------------------*/
|
||
yyerrlab:
|
||
/* If not already recovering from an error, report this error. */
|
||
if (!yyerrstatus)
|
||
{
|
||
++yynerrs;
|
||
#if YYERROR_VERBOSE
|
||
yyn = yypact[yystate];
|
||
|
||
if (YYPACT_NINF < yyn && yyn < YYLAST)
|
||
{
|
||
YYSIZE_T yysize = 0;
|
||
int yytype = YYTRANSLATE (yychar);
|
||
char *yymsg;
|
||
int yyx, yycount;
|
||
|
||
yycount = 0;
|
||
/* Start YYX at -YYN if negative to avoid negative indexes in
|
||
YYCHECK. */
|
||
for (yyx = yyn < 0 ? -yyn : 0;
|
||
yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++)
|
||
if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
|
||
yysize += yystrlen (yytname[yyx]) + 15, yycount++;
|
||
yysize += yystrlen ("parse error, unexpected ") + 1;
|
||
yysize += yystrlen (yytname[yytype]);
|
||
yymsg = (char *) YYSTACK_ALLOC (yysize);
|
||
if (yymsg != 0)
|
||
{
|
||
char *yyp = yystpcpy (yymsg, "parse error, unexpected ");
|
||
yyp = yystpcpy (yyp, yytname[yytype]);
|
||
|
||
if (yycount < 5)
|
||
{
|
||
yycount = 0;
|
||
for (yyx = yyn < 0 ? -yyn : 0;
|
||
yyx < (int) (sizeof (yytname) / sizeof (char *));
|
||
yyx++)
|
||
if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
|
||
{
|
||
const char *yyq = ! yycount ? ", expecting " : " or ";
|
||
yyp = yystpcpy (yyp, yyq);
|
||
yyp = yystpcpy (yyp, yytname[yyx]);
|
||
yycount++;
|
||
}
|
||
}
|
||
yyerror (yymsg);
|
||
YYSTACK_FREE (yymsg);
|
||
}
|
||
else
|
||
yyerror ("parse error; also virtual memory exhausted");
|
||
}
|
||
else
|
||
#endif /* YYERROR_VERBOSE */
|
||
yyerror ("parse error");
|
||
}
|
||
goto yyerrlab1;
|
||
|
||
|
||
/*----------------------------------------------------.
|
||
| yyerrlab1 -- error raised explicitly by an action. |
|
||
`----------------------------------------------------*/
|
||
yyerrlab1:
|
||
if (yyerrstatus == 3)
|
||
{
|
||
/* If just tried and failed to reuse lookahead token after an
|
||
error, discard it. */
|
||
|
||
/* Return failure if at end of input. */
|
||
if (yychar == YYEOF)
|
||
{
|
||
/* Pop the error token. */
|
||
YYPOPSTACK;
|
||
/* Pop the rest of the stack. */
|
||
while (yyssp > yyss)
|
||
{
|
||
YYDPRINTF ((stderr, "Error: popping "));
|
||
YYDSYMPRINT ((stderr,
|
||
yystos[*yyssp],
|
||
*yyvsp));
|
||
YYDPRINTF ((stderr, "\n"));
|
||
yydestruct (yystos[*yyssp], *yyvsp);
|
||
YYPOPSTACK;
|
||
}
|
||
YYABORT;
|
||
}
|
||
|
||
YYDPRINTF ((stderr, "Discarding token %d (%s).\n",
|
||
yychar, yytname[yychar1]));
|
||
yydestruct (yychar1, yylval);
|
||
yychar = YYEMPTY;
|
||
}
|
||
|
||
/* Else will try to reuse lookahead token after shifting the error
|
||
token. */
|
||
|
||
yyerrstatus = 3; /* Each real token shifted decrements this. */
|
||
|
||
for (;;)
|
||
{
|
||
yyn = yypact[yystate];
|
||
if (yyn != YYPACT_NINF)
|
||
{
|
||
yyn += YYTERROR;
|
||
if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR)
|
||
{
|
||
yyn = yytable[yyn];
|
||
if (0 < yyn)
|
||
break;
|
||
}
|
||
}
|
||
|
||
/* Pop the current state because it cannot handle the error token. */
|
||
if (yyssp == yyss)
|
||
YYABORT;
|
||
|
||
YYDPRINTF ((stderr, "Error: popping "));
|
||
YYDSYMPRINT ((stderr,
|
||
yystos[*yyssp], *yyvsp));
|
||
YYDPRINTF ((stderr, "\n"));
|
||
|
||
yydestruct (yystos[yystate], *yyvsp);
|
||
yyvsp--;
|
||
yystate = *--yyssp;
|
||
|
||
|
||
#if YYDEBUG
|
||
if (yydebug)
|
||
{
|
||
short *yyssp1 = yyss - 1;
|
||
YYFPRINTF (stderr, "Error: state stack now");
|
||
while (yyssp1 != yyssp)
|
||
YYFPRINTF (stderr, " %d", *++yyssp1);
|
||
YYFPRINTF (stderr, "\n");
|
||
}
|
||
#endif
|
||
}
|
||
|
||
if (yyn == YYFINAL)
|
||
YYACCEPT;
|
||
|
||
YYDPRINTF ((stderr, "Shifting error token, "));
|
||
|
||
*++yyvsp = yylval;
|
||
|
||
|
||
yystate = yyn;
|
||
goto yynewstate;
|
||
|
||
|
||
/*-------------------------------------.
|
||
| yyacceptlab -- YYACCEPT comes here. |
|
||
`-------------------------------------*/
|
||
yyacceptlab:
|
||
yyresult = 0;
|
||
goto yyreturn;
|
||
|
||
/*-----------------------------------.
|
||
| yyabortlab -- YYABORT comes here. |
|
||
`-----------------------------------*/
|
||
yyabortlab:
|
||
yyresult = 1;
|
||
goto yyreturn;
|
||
|
||
#ifndef yyoverflow
|
||
/*----------------------------------------------.
|
||
| yyoverflowlab -- parser overflow comes here. |
|
||
`----------------------------------------------*/
|
||
yyoverflowlab:
|
||
yyerror ("parser stack overflow");
|
||
yyresult = 2;
|
||
/* Fall through. */
|
||
#endif
|
||
|
||
yyreturn:
|
||
#ifndef yyoverflow
|
||
if (yyss != yyssa)
|
||
YYSTACK_FREE (yyss);
|
||
#endif
|
||
return yyresult;
|
||
}
|
||
|
||
|
||
#line 2869 "/usr/home/jeffc/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
|
||
|
||
// common code from the two 'RunVMAsmParser' functions
|
||
static Module* RunParser(Module * M) {
|
||
|
||
llvmAsmlineno = 1; // Reset the current line number...
|
||
CurModule.CurrentModule = M;
|
||
#if YYDEBUG
|
||
yydebug = Debug;
|
||
#endif
|
||
|
||
// Check to make sure the parser succeeded
|
||
if (yyparse()) {
|
||
if (ParserResult)
|
||
delete ParserResult;
|
||
return 0;
|
||
}
|
||
|
||
// 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 = std::string(ErrorMsg) + "\n" + where + " while reading ";
|
||
if (yychar == YYEMPTY || yychar == 0)
|
||
errMsg += "end-of-file.";
|
||
else
|
||
errMsg += "token: '" + std::string(llvmAsmtext, llvmAsmleng) + "'";
|
||
GenerateError(errMsg);
|
||
return 0;
|
||
}
|
||
|