mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-30 07:22:55 +01:00
32bc5710a6
llvm-svn: 29769
5277 lines
187 KiB
Plaintext
5277 lines
187 KiB
Plaintext
/* A Bison parser, made by GNU Bison 2.1. */
|
||
|
||
/* Skeleton parser for Yacc-like parsing with Bison,
|
||
Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005 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., 51 Franklin Street, Fifth Floor,
|
||
Boston, MA 02110-1301, 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
|
||
|
||
/* Bison version. */
|
||
#define YYBISON_VERSION "2.1"
|
||
|
||
/* Skeleton name. */
|
||
#define YYSKELETON_NAME "yacc.c"
|
||
|
||
/* Pure parsers. */
|
||
#define YYPURE 0
|
||
|
||
/* Using locations. */
|
||
#define YYLSP_NEEDED 0
|
||
|
||
/* Substitute the variable and function 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,
|
||
BOOL = 264,
|
||
SBYTE = 265,
|
||
UBYTE = 266,
|
||
SHORT = 267,
|
||
USHORT = 268,
|
||
INT = 269,
|
||
UINT = 270,
|
||
LONG = 271,
|
||
ULONG = 272,
|
||
FLOAT = 273,
|
||
DOUBLE = 274,
|
||
TYPE = 275,
|
||
LABEL = 276,
|
||
VAR_ID = 277,
|
||
LABELSTR = 278,
|
||
STRINGCONSTANT = 279,
|
||
IMPLEMENTATION = 280,
|
||
ZEROINITIALIZER = 281,
|
||
TRUETOK = 282,
|
||
FALSETOK = 283,
|
||
BEGINTOK = 284,
|
||
ENDTOK = 285,
|
||
DECLARE = 286,
|
||
GLOBAL = 287,
|
||
CONSTANT = 288,
|
||
SECTION = 289,
|
||
VOLATILE = 290,
|
||
TO = 291,
|
||
DOTDOTDOT = 292,
|
||
NULL_TOK = 293,
|
||
UNDEF = 294,
|
||
CONST = 295,
|
||
INTERNAL = 296,
|
||
LINKONCE = 297,
|
||
WEAK = 298,
|
||
APPENDING = 299,
|
||
OPAQUE = 300,
|
||
NOT = 301,
|
||
EXTERNAL = 302,
|
||
TARGET = 303,
|
||
TRIPLE = 304,
|
||
ENDIAN = 305,
|
||
POINTERSIZE = 306,
|
||
LITTLE = 307,
|
||
BIG = 308,
|
||
ALIGN = 309,
|
||
DEPLIBS = 310,
|
||
CALL = 311,
|
||
TAIL = 312,
|
||
ASM_TOK = 313,
|
||
MODULE = 314,
|
||
SIDEEFFECT = 315,
|
||
CC_TOK = 316,
|
||
CCC_TOK = 317,
|
||
CSRETCC_TOK = 318,
|
||
FASTCC_TOK = 319,
|
||
COLDCC_TOK = 320,
|
||
RET = 321,
|
||
BR = 322,
|
||
SWITCH = 323,
|
||
INVOKE = 324,
|
||
UNWIND = 325,
|
||
UNREACHABLE = 326,
|
||
ADD = 327,
|
||
SUB = 328,
|
||
MUL = 329,
|
||
DIV = 330,
|
||
REM = 331,
|
||
AND = 332,
|
||
OR = 333,
|
||
XOR = 334,
|
||
SETLE = 335,
|
||
SETGE = 336,
|
||
SETLT = 337,
|
||
SETGT = 338,
|
||
SETEQ = 339,
|
||
SETNE = 340,
|
||
MALLOC = 341,
|
||
ALLOCA = 342,
|
||
FREE = 343,
|
||
LOAD = 344,
|
||
STORE = 345,
|
||
GETELEMENTPTR = 346,
|
||
PHI_TOK = 347,
|
||
CAST = 348,
|
||
SELECT = 349,
|
||
SHL = 350,
|
||
SHR = 351,
|
||
VAARG = 352,
|
||
EXTRACTELEMENT = 353,
|
||
INSERTELEMENT = 354,
|
||
SHUFFLEVECTOR = 355,
|
||
VAARG_old = 356,
|
||
VANEXT_old = 357
|
||
};
|
||
#endif
|
||
/* Tokens. */
|
||
#define ESINT64VAL 258
|
||
#define EUINT64VAL 259
|
||
#define SINTVAL 260
|
||
#define UINTVAL 261
|
||
#define FPVAL 262
|
||
#define VOID 263
|
||
#define BOOL 264
|
||
#define SBYTE 265
|
||
#define UBYTE 266
|
||
#define SHORT 267
|
||
#define USHORT 268
|
||
#define INT 269
|
||
#define UINT 270
|
||
#define LONG 271
|
||
#define ULONG 272
|
||
#define FLOAT 273
|
||
#define DOUBLE 274
|
||
#define TYPE 275
|
||
#define LABEL 276
|
||
#define VAR_ID 277
|
||
#define LABELSTR 278
|
||
#define STRINGCONSTANT 279
|
||
#define IMPLEMENTATION 280
|
||
#define ZEROINITIALIZER 281
|
||
#define TRUETOK 282
|
||
#define FALSETOK 283
|
||
#define BEGINTOK 284
|
||
#define ENDTOK 285
|
||
#define DECLARE 286
|
||
#define GLOBAL 287
|
||
#define CONSTANT 288
|
||
#define SECTION 289
|
||
#define VOLATILE 290
|
||
#define TO 291
|
||
#define DOTDOTDOT 292
|
||
#define NULL_TOK 293
|
||
#define UNDEF 294
|
||
#define CONST 295
|
||
#define INTERNAL 296
|
||
#define LINKONCE 297
|
||
#define WEAK 298
|
||
#define APPENDING 299
|
||
#define OPAQUE 300
|
||
#define NOT 301
|
||
#define EXTERNAL 302
|
||
#define TARGET 303
|
||
#define TRIPLE 304
|
||
#define ENDIAN 305
|
||
#define POINTERSIZE 306
|
||
#define LITTLE 307
|
||
#define BIG 308
|
||
#define ALIGN 309
|
||
#define DEPLIBS 310
|
||
#define CALL 311
|
||
#define TAIL 312
|
||
#define ASM_TOK 313
|
||
#define MODULE 314
|
||
#define SIDEEFFECT 315
|
||
#define CC_TOK 316
|
||
#define CCC_TOK 317
|
||
#define CSRETCC_TOK 318
|
||
#define FASTCC_TOK 319
|
||
#define COLDCC_TOK 320
|
||
#define RET 321
|
||
#define BR 322
|
||
#define SWITCH 323
|
||
#define INVOKE 324
|
||
#define UNWIND 325
|
||
#define UNREACHABLE 326
|
||
#define ADD 327
|
||
#define SUB 328
|
||
#define MUL 329
|
||
#define DIV 330
|
||
#define REM 331
|
||
#define AND 332
|
||
#define OR 333
|
||
#define XOR 334
|
||
#define SETLE 335
|
||
#define SETGE 336
|
||
#define SETLT 337
|
||
#define SETGT 338
|
||
#define SETEQ 339
|
||
#define SETNE 340
|
||
#define MALLOC 341
|
||
#define ALLOCA 342
|
||
#define FREE 343
|
||
#define LOAD 344
|
||
#define STORE 345
|
||
#define GETELEMENTPTR 346
|
||
#define PHI_TOK 347
|
||
#define CAST 348
|
||
#define SELECT 349
|
||
#define SHL 350
|
||
#define SHR 351
|
||
#define VAARG 352
|
||
#define EXTRACTELEMENT 353
|
||
#define INSERTELEMENT 354
|
||
#define SHUFFLEVECTOR 355
|
||
#define VAARG_old 356
|
||
#define VANEXT_old 357
|
||
|
||
|
||
|
||
|
||
/* Copy the first part of user declarations. */
|
||
#line 14 "/proj/llvm/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/Assembly/AutoUpgrade.h"
|
||
#include "llvm/Support/GetElementPtrTypeIterator.h"
|
||
#include "llvm/ADT/STLExtras.h"
|
||
#include "llvm/Support/MathExtras.h"
|
||
#include <algorithm>
|
||
#include <iostream>
|
||
#include <list>
|
||
#include <utility>
|
||
|
||
// 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; YYERROR; } }
|
||
#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;
|
||
}
|
||
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) std::cerr << X
|
||
#else
|
||
#define UR_OUT(X)
|
||
#endif
|
||
|
||
#define YYERROR_VERBOSE 1
|
||
|
||
static bool ObsoleteVarArgs;
|
||
static bool NewVarArgs;
|
||
static BasicBlock *CurBB;
|
||
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);
|
||
|
||
// 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);
|
||
}
|
||
|
||
// Look for intrinsic functions and CallInst that need to be upgraded
|
||
for (Module::iterator FI = CurrentModule->begin(),
|
||
FE = CurrentModule->end(); FI != FE; )
|
||
UpgradeCallsToIntrinsic(FI++);
|
||
|
||
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;
|
||
}
|
||
} 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?
|
||
|
||
/// 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;
|
||
}
|
||
|
||
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());
|
||
|
||
// Resolve all forward references now.
|
||
ResolveDefinitions(LateResolveValues, &CurModule.LateResolveValues);
|
||
|
||
Values.clear(); // Clear out function local definitions
|
||
CurrentFunction = 0;
|
||
isDeclare = false;
|
||
}
|
||
} 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!");
|
||
}
|
||
|
||
// 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() + "'");
|
||
else
|
||
GenerateError("Reference to an undefined type: #" + itostr(D.Num));
|
||
}
|
||
|
||
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->getSymbolTable() :
|
||
CurModule.CurrentModule->getSymbolTable();
|
||
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");
|
||
|
||
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 (!ConstantSInt::isValueValidForType(Ty, D.ConstPool64))
|
||
GenerateError("Signed integral constant '" +
|
||
itostr(D.ConstPool64) + "' is invalid for type '" +
|
||
Ty->getDescription() + "'!");
|
||
return ConstantSInt::get(Ty, D.ConstPool64);
|
||
|
||
case ValID::ConstUIntVal: // Is it an unsigned const pool reference?
|
||
if (!ConstantUInt::isValueValidForType(Ty, D.UConstPool64)) {
|
||
if (!ConstantSInt::isValueValidForType(Ty, D.ConstPool64)) {
|
||
GenerateError("Integral constant '" + utostr(D.UConstPool64) +
|
||
"' is invalid or out of range!");
|
||
} else { // This is really a signed reference. Transmogrify.
|
||
return ConstantSInt::get(Ty, D.ConstPool64);
|
||
}
|
||
} else {
|
||
return ConstantUInt::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 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 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 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!");
|
||
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");
|
||
|
||
// See if the value has already been defined.
|
||
Value *V = getValNonImprovising(Ty, ID);
|
||
if (V) return V;
|
||
|
||
if (!Ty->isFirstClassType() && !isa<OpaqueType>(Ty))
|
||
GenerateError("Invalid use of a composite type!");
|
||
|
||
// 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());
|
||
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->
|
||
getSymbolTable().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());
|
||
|
||
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 (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);
|
||
else
|
||
GenerateError("Reference to an invalid definition: #" +
|
||
itostr(DID.Num) + " of type '" +
|
||
V->getType()->getDescription() + "'",
|
||
PHI->second.second);
|
||
}
|
||
}
|
||
}
|
||
|
||
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!");
|
||
|
||
assert(inFunctionScope() && "Must be in function scope!");
|
||
SymbolTable &ST = CurFun.CurrentFunction->getSymbolTable();
|
||
if (ST.lookup(V->getType(), Name))
|
||
GenerateError("Redefinition of value named '" + Name + "' in the '" +
|
||
V->getType()->getDescription() + "' type plane!");
|
||
|
||
// 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,
|
||
bool isConstantGlobal, const Type *Ty,
|
||
Constant *Initializer) {
|
||
if (isa<FunctionType>(Ty))
|
||
GenerateError("Cannot declare global vars of function type!");
|
||
|
||
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->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, merge as appropriate. Note that
|
||
// this is really just a hack around problems in the CFE. :(
|
||
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 (GlobalVariable *EGV =
|
||
CurModule.CurrentModule->getGlobalVariable(Name, Ty)) {
|
||
// We are allowed to redefine a global variable in two circumstances:
|
||
// 1. If at least one of the globals is uninitialized or
|
||
// 2. If both initializers have the same value.
|
||
//
|
||
if (!EGV->hasInitializer() || !Initializer ||
|
||
EGV->getInitializer() == Initializer) {
|
||
|
||
// Make sure the existing global version gets the initializer! Make
|
||
// sure that it also gets marked const if the new version is.
|
||
if (Initializer && !EGV->hasInitializer())
|
||
EGV->setInitializer(Initializer);
|
||
if (isConstantGlobal)
|
||
EGV->setConstant(true);
|
||
EGV->setLinkage(Linkage);
|
||
return EGV;
|
||
}
|
||
|
||
GenerateError("Redefinition of global variable named '" + Name +
|
||
"' in the '" + Ty->getDescription() + "' type plane!");
|
||
}
|
||
}
|
||
|
||
// Otherwise there is no existing GV to use, create one now.
|
||
GlobalVariable *GV =
|
||
new GlobalVariable(Ty, isConstantGlobal, Linkage, Initializer, Name,
|
||
CurModule.CurrentModule);
|
||
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!");
|
||
|
||
// 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 + "' in the '" +
|
||
T->getDescription() + "' type plane!");
|
||
}
|
||
|
||
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->isAbstract()) 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;
|
||
}
|
||
|
||
|
||
// common code from the two 'RunVMAsmParser' functions
|
||
static Module * RunParser(Module * M) {
|
||
|
||
llvmAsmlineno = 1; // Reset the current line number...
|
||
ObsoleteVarArgs = false;
|
||
NewVarArgs = false;
|
||
|
||
CurModule.CurrentModule = M;
|
||
yyparse(); // Parse the file, potentially throwing exception
|
||
if (!ParserResult)
|
||
return 0;
|
||
|
||
Module *Result = ParserResult;
|
||
ParserResult = 0;
|
||
|
||
//Not all functions use vaarg, so make a second check for ObsoleteVarArgs
|
||
{
|
||
Function* F;
|
||
if ((F = Result->getNamedFunction("llvm.va_start"))
|
||
&& F->getFunctionType()->getNumParams() == 0)
|
||
ObsoleteVarArgs = true;
|
||
if((F = Result->getNamedFunction("llvm.va_copy"))
|
||
&& F->getFunctionType()->getNumParams() == 1)
|
||
ObsoleteVarArgs = true;
|
||
}
|
||
|
||
if (ObsoleteVarArgs && NewVarArgs)
|
||
GenerateError("This file is corrupt: it uses both new and old style varargs");
|
||
|
||
if(ObsoleteVarArgs) {
|
||
if(Function* F = Result->getNamedFunction("llvm.va_start")) {
|
||
if (F->arg_size() != 0)
|
||
GenerateError("Obsolete va_start takes 0 argument!");
|
||
|
||
//foo = va_start()
|
||
// ->
|
||
//bar = alloca typeof(foo)
|
||
//va_start(bar)
|
||
//foo = load bar
|
||
|
||
const Type* RetTy = Type::getPrimitiveType(Type::VoidTyID);
|
||
const Type* ArgTy = F->getFunctionType()->getReturnType();
|
||
const Type* ArgTyPtr = PointerType::get(ArgTy);
|
||
Function* NF = Result->getOrInsertFunction("llvm.va_start",
|
||
RetTy, ArgTyPtr, (Type *)0);
|
||
|
||
while (!F->use_empty()) {
|
||
CallInst* CI = cast<CallInst>(F->use_back());
|
||
AllocaInst* bar = new AllocaInst(ArgTy, 0, "vastart.fix.1", CI);
|
||
new CallInst(NF, bar, "", CI);
|
||
Value* foo = new LoadInst(bar, "vastart.fix.2", CI);
|
||
CI->replaceAllUsesWith(foo);
|
||
CI->getParent()->getInstList().erase(CI);
|
||
}
|
||
Result->getFunctionList().erase(F);
|
||
}
|
||
|
||
if(Function* F = Result->getNamedFunction("llvm.va_end")) {
|
||
if(F->arg_size() != 1)
|
||
GenerateError("Obsolete va_end takes 1 argument!");
|
||
|
||
//vaend foo
|
||
// ->
|
||
//bar = alloca 1 of typeof(foo)
|
||
//vaend bar
|
||
const Type* RetTy = Type::getPrimitiveType(Type::VoidTyID);
|
||
const Type* ArgTy = F->getFunctionType()->getParamType(0);
|
||
const Type* ArgTyPtr = PointerType::get(ArgTy);
|
||
Function* NF = Result->getOrInsertFunction("llvm.va_end",
|
||
RetTy, ArgTyPtr, (Type *)0);
|
||
|
||
while (!F->use_empty()) {
|
||
CallInst* CI = cast<CallInst>(F->use_back());
|
||
AllocaInst* bar = new AllocaInst(ArgTy, 0, "vaend.fix.1", CI);
|
||
new StoreInst(CI->getOperand(1), bar, CI);
|
||
new CallInst(NF, bar, "", CI);
|
||
CI->getParent()->getInstList().erase(CI);
|
||
}
|
||
Result->getFunctionList().erase(F);
|
||
}
|
||
|
||
if(Function* F = Result->getNamedFunction("llvm.va_copy")) {
|
||
if(F->arg_size() != 1)
|
||
GenerateError("Obsolete va_copy takes 1 argument!");
|
||
//foo = vacopy(bar)
|
||
// ->
|
||
//a = alloca 1 of typeof(foo)
|
||
//b = alloca 1 of typeof(foo)
|
||
//store bar -> b
|
||
//vacopy(a, b)
|
||
//foo = load a
|
||
|
||
const Type* RetTy = Type::getPrimitiveType(Type::VoidTyID);
|
||
const Type* ArgTy = F->getFunctionType()->getReturnType();
|
||
const Type* ArgTyPtr = PointerType::get(ArgTy);
|
||
Function* NF = Result->getOrInsertFunction("llvm.va_copy",
|
||
RetTy, ArgTyPtr, ArgTyPtr,
|
||
(Type *)0);
|
||
|
||
while (!F->use_empty()) {
|
||
CallInst* CI = cast<CallInst>(F->use_back());
|
||
AllocaInst* a = new AllocaInst(ArgTy, 0, "vacopy.fix.1", CI);
|
||
AllocaInst* b = new AllocaInst(ArgTy, 0, "vacopy.fix.2", CI);
|
||
new StoreInst(CI->getOperand(1), b, CI);
|
||
new CallInst(NF, a, b, "", CI);
|
||
Value* foo = new LoadInst(a, "vacopy.fix.3", CI);
|
||
CI->replaceAllUsesWith(foo);
|
||
CI->getParent()->getInstList().erase(CI);
|
||
}
|
||
Result->getFunctionList().erase(F);
|
||
}
|
||
}
|
||
|
||
return Result;
|
||
|
||
}
|
||
|
||
//===----------------------------------------------------------------------===//
|
||
// RunVMAsmParser - Define an interface to this parser
|
||
//===----------------------------------------------------------------------===//
|
||
//
|
||
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
|
||
|
||
/* Enabling the token table. */
|
||
#ifndef YYTOKEN_TABLE
|
||
# define YYTOKEN_TABLE 0
|
||
#endif
|
||
|
||
#if ! defined (YYSTYPE) && ! defined (YYSTYPE_IS_DECLARED)
|
||
#line 907 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
typedef union YYSTYPE {
|
||
llvm::Module *ModuleVal;
|
||
llvm::Function *FunctionVal;
|
||
std::pair<llvm::PATypeHolder*, char*> *ArgVal;
|
||
llvm::BasicBlock *BasicBlockVal;
|
||
llvm::TerminatorInst *TermInstVal;
|
||
llvm::Instruction *InstVal;
|
||
llvm::Constant *ConstVal;
|
||
|
||
const llvm::Type *PrimType;
|
||
llvm::PATypeHolder *TypeVal;
|
||
llvm::Value *ValueVal;
|
||
|
||
std::vector<std::pair<llvm::PATypeHolder*,char*> > *ArgList;
|
||
std::vector<llvm::Value*> *ValueList;
|
||
std::list<llvm::PATypeHolder> *TypeList;
|
||
// 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;
|
||
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::OtherOps OtherOpVal;
|
||
llvm::Module::Endianness Endianness;
|
||
} YYSTYPE;
|
||
/* Line 196 of yacc.c. */
|
||
#line 1230 "llvmAsmParser.tab.c"
|
||
# define yystype YYSTYPE /* obsolescent; will be withdrawn */
|
||
# define YYSTYPE_IS_DECLARED 1
|
||
# define YYSTYPE_IS_TRIVIAL 1
|
||
#endif
|
||
|
||
|
||
|
||
/* Copy the second part of user declarations. */
|
||
|
||
|
||
/* Line 219 of yacc.c. */
|
||
#line 1242 "llvmAsmParser.tab.c"
|
||
|
||
#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) && (defined (__STDC__) || defined (__cplusplus))
|
||
# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
|
||
# define YYSIZE_T size_t
|
||
#endif
|
||
#if ! defined (YYSIZE_T)
|
||
# define YYSIZE_T unsigned int
|
||
#endif
|
||
|
||
#ifndef YY_
|
||
# if YYENABLE_NLS
|
||
# if ENABLE_NLS
|
||
# include <libintl.h> /* INFRINGES ON USER NAME SPACE */
|
||
# define YY_(msgid) dgettext ("bison-runtime", msgid)
|
||
# endif
|
||
# endif
|
||
# ifndef YY_
|
||
# define YY_(msgid) msgid
|
||
# endif
|
||
#endif
|
||
|
||
#if ! defined (yyoverflow) || YYERROR_VERBOSE
|
||
|
||
/* The parser invokes alloca or malloc; define the necessary symbols. */
|
||
|
||
# ifdef YYSTACK_USE_ALLOCA
|
||
# if YYSTACK_USE_ALLOCA
|
||
# ifdef __GNUC__
|
||
# define YYSTACK_ALLOC __builtin_alloca
|
||
# else
|
||
# define YYSTACK_ALLOC alloca
|
||
# if defined (__STDC__) || defined (__cplusplus)
|
||
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
|
||
# define YYINCLUDED_STDLIB_H
|
||
# endif
|
||
# endif
|
||
# endif
|
||
# endif
|
||
|
||
# ifdef YYSTACK_ALLOC
|
||
/* Pacify GCC's `empty if-body' warning. */
|
||
# define YYSTACK_FREE(Ptr) do { /* empty */; } while (0)
|
||
# ifndef YYSTACK_ALLOC_MAXIMUM
|
||
/* The OS might guarantee only one guard page at the bottom of the stack,
|
||
and a page size can be as small as 4096 bytes. So we cannot safely
|
||
invoke alloca (N) if N exceeds 4096. Use a slightly smaller number
|
||
to allow for a few compiler-allocated temporary stack slots. */
|
||
# define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2005 */
|
||
# endif
|
||
# else
|
||
# define YYSTACK_ALLOC YYMALLOC
|
||
# define YYSTACK_FREE YYFREE
|
||
# ifndef YYSTACK_ALLOC_MAXIMUM
|
||
# define YYSTACK_ALLOC_MAXIMUM ((YYSIZE_T) -1)
|
||
# endif
|
||
# ifdef __cplusplus
|
||
extern "C" {
|
||
# endif
|
||
# ifndef YYMALLOC
|
||
# define YYMALLOC malloc
|
||
# if (! defined (malloc) && ! defined (YYINCLUDED_STDLIB_H) \
|
||
&& (defined (__STDC__) || defined (__cplusplus)))
|
||
void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */
|
||
# endif
|
||
# endif
|
||
# ifndef YYFREE
|
||
# define YYFREE free
|
||
# if (! defined (free) && ! defined (YYINCLUDED_STDLIB_H) \
|
||
&& (defined (__STDC__) || defined (__cplusplus)))
|
||
void free (void *); /* INFRINGES ON USER NAME SPACE */
|
||
# endif
|
||
# endif
|
||
# ifdef __cplusplus
|
||
}
|
||
# endif
|
||
# endif
|
||
#endif /* ! defined (yyoverflow) || YYERROR_VERBOSE */
|
||
|
||
|
||
#if (! defined (yyoverflow) \
|
||
&& (! defined (__cplusplus) \
|
||
|| (defined (YYSTYPE_IS_TRIVIAL) && YYSTYPE_IS_TRIVIAL)))
|
||
|
||
/* A type that is properly aligned for any stack member. */
|
||
union yyalloc
|
||
{
|
||
short int yyss;
|
||
YYSTYPE yyvs;
|
||
};
|
||
|
||
/* The size of the maximum gap between one aligned stack and the next. */
|
||
# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1)
|
||
|
||
/* The size of an array large to enough to hold all stacks, each with
|
||
N elements. */
|
||
# define YYSTACK_BYTES(N) \
|
||
((N) * (sizeof (short int) + sizeof (YYSTYPE)) \
|
||
+ YYSTACK_GAP_MAXIMUM)
|
||
|
||
/* Copy COUNT objects from FROM to TO. The source and destination do
|
||
not overlap. */
|
||
# ifndef YYCOPY
|
||
# if defined (__GNUC__) && 1 < __GNUC__
|
||
# define YYCOPY(To, From, Count) \
|
||
__builtin_memcpy (To, From, (Count) * sizeof (*(From)))
|
||
# else
|
||
# define YYCOPY(To, From, Count) \
|
||
do \
|
||
{ \
|
||
YYSIZE_T yyi; \
|
||
for (yyi = 0; yyi < (Count); yyi++) \
|
||
(To)[yyi] = (From)[yyi]; \
|
||
} \
|
||
while (0)
|
||
# endif
|
||
# endif
|
||
|
||
/* Relocate STACK from its old location to the new one. The
|
||
local variables YYSIZE and YYSTACKSIZE give the old and new number of
|
||
elements in the stack, and YYPTR gives the new location of the
|
||
stack. Advance YYPTR to a properly aligned location for the next
|
||
stack. */
|
||
# define YYSTACK_RELOCATE(Stack) \
|
||
do \
|
||
{ \
|
||
YYSIZE_T yynewbytes; \
|
||
YYCOPY (&yyptr->Stack, Stack, yysize); \
|
||
Stack = &yyptr->Stack; \
|
||
yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \
|
||
yyptr += yynewbytes / sizeof (*yyptr); \
|
||
} \
|
||
while (0)
|
||
|
||
#endif
|
||
|
||
#if defined (__STDC__) || defined (__cplusplus)
|
||
typedef signed char yysigned_char;
|
||
#else
|
||
typedef short int yysigned_char;
|
||
#endif
|
||
|
||
/* YYFINAL -- State number of the termination state. */
|
||
#define YYFINAL 4
|
||
/* YYLAST -- Last index in YYTABLE. */
|
||
#define YYLAST 1278
|
||
|
||
/* YYNTOKENS -- Number of terminals. */
|
||
#define YYNTOKENS 117
|
||
/* YYNNTS -- Number of nonterminals. */
|
||
#define YYNNTS 72
|
||
/* YYNRULES -- Number of rules. */
|
||
#define YYNRULES 239
|
||
/* YYNRULES -- Number of states. */
|
||
#define YYNSTATES 496
|
||
|
||
/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */
|
||
#define YYUNDEFTOK 2
|
||
#define YYMAXUTOK 357
|
||
|
||
#define YYTRANSLATE(YYX) \
|
||
((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)
|
||
|
||
/* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */
|
||
static const unsigned char yytranslate[] =
|
||
{
|
||
0, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
106, 107, 115, 2, 104, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
111, 103, 112, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 108, 105, 110, 2, 2, 2, 2, 2, 116,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
109, 2, 2, 113, 2, 114, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||
2, 2, 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
|
||
};
|
||
|
||
#if YYDEBUG
|
||
/* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in
|
||
YYRHS. */
|
||
static const unsigned short int 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, 70, 71, 73, 75, 77,
|
||
79, 80, 81, 83, 85, 87, 89, 92, 93, 96,
|
||
97, 101, 104, 105, 107, 108, 112, 114, 117, 119,
|
||
121, 123, 125, 127, 129, 131, 133, 135, 137, 139,
|
||
141, 143, 145, 147, 149, 151, 153, 155, 157, 159,
|
||
162, 167, 173, 179, 183, 186, 189, 191, 195, 197,
|
||
201, 203, 204, 209, 213, 217, 222, 227, 231, 234,
|
||
237, 240, 243, 246, 249, 252, 255, 258, 261, 268,
|
||
274, 283, 290, 297, 304, 311, 318, 327, 336, 340,
|
||
342, 344, 346, 348, 351, 354, 359, 362, 364, 369,
|
||
372, 377, 378, 386, 387, 395, 399, 404, 405, 407,
|
||
409, 411, 415, 419, 423, 427, 431, 433, 434, 436,
|
||
438, 440, 441, 444, 448, 450, 452, 456, 458, 459,
|
||
468, 470, 472, 476, 478, 480, 483, 484, 488, 489,
|
||
491, 493, 495, 497, 499, 501, 503, 505, 507, 511,
|
||
513, 519, 521, 523, 525, 527, 530, 533, 536, 540,
|
||
543, 544, 546, 549, 552, 556, 566, 576, 585, 599,
|
||
601, 603, 610, 616, 619, 626, 634, 636, 640, 642,
|
||
643, 646, 648, 654, 660, 666, 669, 674, 679, 686,
|
||
691, 696, 701, 706, 713, 720, 723, 731, 733, 736,
|
||
737, 739, 740, 744, 751, 755, 762, 765, 770, 777
|
||
};
|
||
|
||
/* YYRHS -- A `-1'-separated list of the rules' RHS. */
|
||
static const short int yyrhs[] =
|
||
{
|
||
148, 0, -1, 5, -1, 6, -1, 3, -1, 4,
|
||
-1, 72, -1, 73, -1, 74, -1, 75, -1, 76,
|
||
-1, 77, -1, 78, -1, 79, -1, 80, -1, 81,
|
||
-1, 82, -1, 83, -1, 84, -1, 85, -1, 95,
|
||
-1, 96, -1, 16, -1, 14, -1, 12, -1, 10,
|
||
-1, 17, -1, 15, -1, 13, -1, 11, -1, 124,
|
||
-1, 125, -1, 18, -1, 19, -1, 158, 103, -1,
|
||
-1, 41, -1, 42, -1, 43, -1, 44, -1, -1,
|
||
-1, 62, -1, 63, -1, 64, -1, 65, -1, 61,
|
||
4, -1, -1, 54, 4, -1, -1, 104, 54, 4,
|
||
-1, 34, 24, -1, -1, 133, -1, -1, 104, 136,
|
||
135, -1, 133, -1, 54, 4, -1, 139, -1, 8,
|
||
-1, 141, -1, 8, -1, 141, -1, 9, -1, 10,
|
||
-1, 11, -1, 12, -1, 13, -1, 14, -1, 15,
|
||
-1, 16, -1, 17, -1, 18, -1, 19, -1, 20,
|
||
-1, 21, -1, 45, -1, 140, -1, 172, -1, 105,
|
||
4, -1, 138, 106, 143, 107, -1, 108, 4, 109,
|
||
141, 110, -1, 111, 4, 109, 141, 112, -1, 113,
|
||
142, 114, -1, 113, 114, -1, 141, 115, -1, 141,
|
||
-1, 142, 104, 141, -1, 142, -1, 142, 104, 37,
|
||
-1, 37, -1, -1, 139, 108, 146, 110, -1, 139,
|
||
108, 110, -1, 139, 116, 24, -1, 139, 111, 146,
|
||
112, -1, 139, 113, 146, 114, -1, 139, 113, 114,
|
||
-1, 139, 38, -1, 139, 39, -1, 139, 172, -1,
|
||
139, 145, -1, 139, 26, -1, 124, 119, -1, 125,
|
||
4, -1, 9, 27, -1, 9, 28, -1, 127, 7,
|
||
-1, 93, 106, 144, 36, 139, 107, -1, 91, 106,
|
||
144, 186, 107, -1, 94, 106, 144, 104, 144, 104,
|
||
144, 107, -1, 120, 106, 144, 104, 144, 107, -1,
|
||
121, 106, 144, 104, 144, 107, -1, 122, 106, 144,
|
||
104, 144, 107, -1, 123, 106, 144, 104, 144, 107,
|
||
-1, 98, 106, 144, 104, 144, 107, -1, 99, 106,
|
||
144, 104, 144, 104, 144, 107, -1, 100, 106, 144,
|
||
104, 144, 104, 144, 107, -1, 146, 104, 144, -1,
|
||
144, -1, 32, -1, 33, -1, 149, -1, 149, 167,
|
||
-1, 149, 168, -1, 149, 59, 58, 153, -1, 149,
|
||
25, -1, 150, -1, 150, 128, 20, 137, -1, 150,
|
||
168, -1, 150, 59, 58, 153, -1, -1, 150, 128,
|
||
129, 147, 144, 151, 135, -1, -1, 150, 128, 47,
|
||
147, 139, 152, 135, -1, 150, 48, 155, -1, 150,
|
||
55, 103, 156, -1, -1, 24, -1, 53, -1, 52,
|
||
-1, 50, 103, 154, -1, 51, 103, 4, -1, 49,
|
||
103, 24, -1, 108, 157, 110, -1, 157, 104, 24,
|
||
-1, 24, -1, -1, 22, -1, 24, -1, 158, -1,
|
||
-1, 139, 159, -1, 161, 104, 160, -1, 160, -1,
|
||
161, -1, 161, 104, 37, -1, 37, -1, -1, 130,
|
||
137, 158, 106, 162, 107, 134, 131, -1, 29, -1,
|
||
113, -1, 129, 163, 164, -1, 30, -1, 114, -1,
|
||
175, 166, -1, -1, 31, 169, 163, -1, -1, 60,
|
||
-1, 3, -1, 4, -1, 7, -1, 27, -1, 28,
|
||
-1, 38, -1, 39, -1, 26, -1, 111, 146, 112,
|
||
-1, 145, -1, 58, 170, 24, 104, 24, -1, 118,
|
||
-1, 158, -1, 172, -1, 171, -1, 139, 173, -1,
|
||
175, 176, -1, 165, 176, -1, 177, 128, 178, -1,
|
||
177, 180, -1, -1, 23, -1, 66, 174, -1, 66,
|
||
8, -1, 67, 21, 173, -1, 67, 9, 173, 104,
|
||
21, 173, 104, 21, 173, -1, 68, 126, 173, 104,
|
||
21, 173, 108, 179, 110, -1, 68, 126, 173, 104,
|
||
21, 173, 108, 110, -1, 69, 130, 137, 173, 106,
|
||
183, 107, 36, 21, 173, 70, 21, 173, -1, 70,
|
||
-1, 71, -1, 179, 126, 171, 104, 21, 173, -1,
|
||
126, 171, 104, 21, 173, -1, 128, 185, -1, 139,
|
||
108, 173, 104, 173, 110, -1, 181, 104, 108, 173,
|
||
104, 173, 110, -1, 174, -1, 182, 104, 174, -1,
|
||
182, -1, -1, 57, 56, -1, 56, -1, 120, 139,
|
||
173, 104, 173, -1, 121, 139, 173, 104, 173, -1,
|
||
122, 139, 173, 104, 173, -1, 46, 174, -1, 123,
|
||
174, 104, 174, -1, 93, 174, 36, 139, -1, 94,
|
||
174, 104, 174, 104, 174, -1, 97, 174, 104, 139,
|
||
-1, 101, 174, 104, 139, -1, 102, 174, 104, 139,
|
||
-1, 98, 174, 104, 174, -1, 99, 174, 104, 174,
|
||
104, 174, -1, 100, 174, 104, 174, 104, 174, -1,
|
||
92, 181, -1, 184, 130, 137, 173, 106, 183, 107,
|
||
-1, 188, -1, 104, 182, -1, -1, 35, -1, -1,
|
||
86, 139, 132, -1, 86, 139, 104, 15, 173, 132,
|
||
-1, 87, 139, 132, -1, 87, 139, 104, 15, 173,
|
||
132, -1, 88, 174, -1, 187, 89, 139, 173, -1,
|
||
187, 90, 174, 104, 139, 173, -1, 91, 139, 173,
|
||
186, -1
|
||
};
|
||
|
||
/* YYRLINE[YYN] -- source line where rule number YYN was defined. */
|
||
static const unsigned short int yyrline[] =
|
||
{
|
||
0, 1027, 1027, 1028, 1036, 1037, 1047, 1047, 1047, 1047,
|
||
1047, 1048, 1048, 1048, 1049, 1049, 1049, 1049, 1049, 1049,
|
||
1051, 1051, 1055, 1055, 1055, 1055, 1056, 1056, 1056, 1056,
|
||
1057, 1057, 1058, 1058, 1061, 1065, 1070, 1071, 1072, 1073,
|
||
1074, 1076, 1077, 1078, 1079, 1080, 1081, 1090, 1091, 1097,
|
||
1098, 1106, 1114, 1115, 1120, 1121, 1122, 1127, 1141, 1141,
|
||
1142, 1142, 1144, 1154, 1154, 1154, 1154, 1154, 1154, 1154,
|
||
1155, 1155, 1155, 1155, 1155, 1155, 1156, 1160, 1164, 1171,
|
||
1179, 1192, 1197, 1209, 1219, 1223, 1232, 1237, 1243, 1244,
|
||
1248, 1252, 1263, 1289, 1303, 1333, 1359, 1380, 1393, 1403,
|
||
1408, 1468, 1475, 1484, 1490, 1496, 1500, 1504, 1512, 1523,
|
||
1555, 1563, 1585, 1596, 1602, 1610, 1616, 1622, 1631, 1635,
|
||
1643, 1643, 1653, 1661, 1666, 1670, 1674, 1678, 1693, 1714,
|
||
1717, 1720, 1720, 1727, 1727, 1735, 1738, 1741, 1745, 1758,
|
||
1759, 1761, 1765, 1774, 1780, 1782, 1787, 1792, 1801, 1801,
|
||
1802, 1802, 1804, 1811, 1817, 1824, 1828, 1834, 1839, 1844,
|
||
1931, 1931, 1933, 1941, 1941, 1943, 1948, 1948, 1958, 1962,
|
||
1967, 1971, 1975, 1979, 1983, 1987, 1991, 1995, 1999, 2024,
|
||
2028, 2042, 2046, 2052, 2052, 2058, 2063, 2067, 2076, 2086,
|
||
2091, 2102, 2114, 2118, 2122, 2126, 2130, 2145, 2150, 2204,
|
||
2208, 2215, 2224, 2235, 2243, 2249, 2257, 2262, 2269, 2269,
|
||
2271, 2275, 2282, 2295, 2307, 2318, 2331, 2339, 2347, 2355,
|
||
2361, 2381, 2404, 2410, 2416, 2422, 2437, 2495, 2502, 2505,
|
||
2510, 2514, 2521, 2526, 2531, 2536, 2541, 2549, 2560, 2574
|
||
};
|
||
#endif
|
||
|
||
#if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE
|
||
/* YYTNAME[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", "BOOL", "SBYTE", "UBYTE", "SHORT", "USHORT",
|
||
"INT", "UINT", "LONG", "ULONG", "FLOAT", "DOUBLE", "TYPE", "LABEL",
|
||
"VAR_ID", "LABELSTR", "STRINGCONSTANT", "IMPLEMENTATION",
|
||
"ZEROINITIALIZER", "TRUETOK", "FALSETOK", "BEGINTOK", "ENDTOK",
|
||
"DECLARE", "GLOBAL", "CONSTANT", "SECTION", "VOLATILE", "TO",
|
||
"DOTDOTDOT", "NULL_TOK", "UNDEF", "CONST", "INTERNAL", "LINKONCE",
|
||
"WEAK", "APPENDING", "OPAQUE", "NOT", "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", "RET", "BR", "SWITCH",
|
||
"INVOKE", "UNWIND", "UNREACHABLE", "ADD", "SUB", "MUL", "DIV", "REM",
|
||
"AND", "OR", "XOR", "SETLE", "SETGE", "SETLT", "SETGT", "SETEQ", "SETNE",
|
||
"MALLOC", "ALLOCA", "FREE", "LOAD", "STORE", "GETELEMENTPTR", "PHI_TOK",
|
||
"CAST", "SELECT", "SHL", "SHR", "VAARG", "EXTRACTELEMENT",
|
||
"INSERTELEMENT", "SHUFFLEVECTOR", "VAARG_old", "VANEXT_old", "'='",
|
||
"','", "'\\\\'", "'('", "')'", "'['", "'x'", "']'", "'<'", "'>'", "'{'",
|
||
"'}'", "'*'", "'c'", "$accept", "INTVAL", "EINT64VAL", "ArithmeticOps",
|
||
"LogicalOps", "SetCondOps", "ShiftOps", "SIntType", "UIntType",
|
||
"IntType", "FPType", "OptAssign", "OptLinkage", "OptCallingConv",
|
||
"OptAlign", "OptCAlign", "SectionString", "OptSection",
|
||
"GlobalVarAttributes", "GlobalVarAttribute", "TypesV", "UpRTypesV",
|
||
"Types", "PrimType", "UpRTypes", "TypeListI", "ArgTypeListI", "ConstVal",
|
||
"ConstExpr", "ConstVector", "GlobalType", "Module", "FunctionList",
|
||
"ConstPool", "@1", "@2", "AsmBlock", "BigOrLittle", "TargetDefinition",
|
||
"LibrariesDefinition", "LibList", "Name", "OptName", "ArgVal",
|
||
"ArgListH", "ArgList", "FunctionHeaderH", "BEGIN", "FunctionHeader",
|
||
"END", "Function", "FunctionProto", "@3", "OptSideEffect",
|
||
"ConstValueRef", "SymbolicValueRef", "ValueRef", "ResolvedVal",
|
||
"BasicBlockList", "BasicBlock", "InstructionList", "BBTerminatorInst",
|
||
"JumpTable", "Inst", "PHIList", "ValueRefList", "ValueRefListE",
|
||
"OptTailCall", "InstVal", "IndexList", "OptVolatile", "MemoryInst", 0
|
||
};
|
||
#endif
|
||
|
||
# ifdef YYPRINT
|
||
/* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to
|
||
token YYLEX-NUM. */
|
||
static const unsigned short int 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, 61, 44, 92, 40, 41, 91, 120,
|
||
93, 60, 62, 123, 125, 42, 99
|
||
};
|
||
# endif
|
||
|
||
/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
|
||
static const unsigned char yyr1[] =
|
||
{
|
||
0, 117, 118, 118, 119, 119, 120, 120, 120, 120,
|
||
120, 121, 121, 121, 122, 122, 122, 122, 122, 122,
|
||
123, 123, 124, 124, 124, 124, 125, 125, 125, 125,
|
||
126, 126, 127, 127, 128, 128, 129, 129, 129, 129,
|
||
129, 130, 130, 130, 130, 130, 130, 131, 131, 132,
|
||
132, 133, 134, 134, 135, 135, 136, 136, 137, 137,
|
||
138, 138, 139, 140, 140, 140, 140, 140, 140, 140,
|
||
140, 140, 140, 140, 140, 140, 141, 141, 141, 141,
|
||
141, 141, 141, 141, 141, 141, 142, 142, 143, 143,
|
||
143, 143, 144, 144, 144, 144, 144, 144, 144, 144,
|
||
144, 144, 144, 144, 144, 144, 144, 144, 145, 145,
|
||
145, 145, 145, 145, 145, 145, 145, 145, 146, 146,
|
||
147, 147, 148, 149, 149, 149, 149, 149, 150, 150,
|
||
150, 151, 150, 152, 150, 150, 150, 150, 153, 154,
|
||
154, 155, 155, 155, 156, 157, 157, 157, 158, 158,
|
||
159, 159, 160, 161, 161, 162, 162, 162, 162, 163,
|
||
164, 164, 165, 166, 166, 167, 169, 168, 170, 170,
|
||
171, 171, 171, 171, 171, 171, 171, 171, 171, 171,
|
||
171, 172, 172, 173, 173, 174, 175, 175, 176, 177,
|
||
177, 177, 178, 178, 178, 178, 178, 178, 178, 178,
|
||
178, 179, 179, 180, 181, 181, 182, 182, 183, 183,
|
||
184, 184, 185, 185, 185, 185, 185, 185, 185, 185,
|
||
185, 185, 185, 185, 185, 185, 185, 185, 186, 186,
|
||
187, 187, 188, 188, 188, 188, 188, 188, 188, 188
|
||
};
|
||
|
||
/* 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, 2, 0, 1, 1, 1, 1,
|
||
0, 0, 1, 1, 1, 1, 2, 0, 2, 0,
|
||
3, 2, 0, 1, 0, 3, 1, 2, 1, 1,
|
||
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
||
1, 1, 1, 1, 1, 1, 1, 1, 1, 2,
|
||
4, 5, 5, 3, 2, 2, 1, 3, 1, 3,
|
||
1, 0, 4, 3, 3, 4, 4, 3, 2, 2,
|
||
2, 2, 2, 2, 2, 2, 2, 2, 6, 5,
|
||
8, 6, 6, 6, 6, 6, 8, 8, 3, 1,
|
||
1, 1, 1, 2, 2, 4, 2, 1, 4, 2,
|
||
4, 0, 7, 0, 7, 3, 4, 0, 1, 1,
|
||
1, 3, 3, 3, 3, 3, 1, 0, 1, 1,
|
||
1, 0, 2, 3, 1, 1, 3, 1, 0, 8,
|
||
1, 1, 3, 1, 1, 2, 0, 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, 13, 1,
|
||
1, 6, 5, 2, 6, 7, 1, 3, 1, 0,
|
||
2, 1, 5, 5, 5, 2, 4, 4, 6, 4,
|
||
4, 4, 4, 6, 6, 2, 7, 1, 2, 0,
|
||
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 char yydefact[] =
|
||
{
|
||
137, 0, 40, 127, 1, 126, 166, 36, 37, 38,
|
||
39, 0, 41, 190, 123, 124, 190, 148, 149, 0,
|
||
0, 0, 40, 0, 129, 41, 0, 0, 42, 43,
|
||
44, 45, 0, 0, 191, 187, 35, 163, 164, 165,
|
||
186, 0, 0, 0, 135, 0, 0, 0, 0, 0,
|
||
34, 167, 138, 125, 46, 2, 3, 59, 63, 64,
|
||
65, 66, 67, 68, 69, 70, 71, 72, 73, 74,
|
||
75, 76, 0, 0, 0, 0, 181, 0, 0, 58,
|
||
77, 62, 182, 78, 160, 161, 162, 231, 189, 0,
|
||
0, 0, 147, 136, 130, 128, 120, 121, 0, 0,
|
||
79, 0, 0, 61, 84, 86, 0, 0, 91, 85,
|
||
230, 0, 211, 0, 0, 0, 0, 41, 199, 200,
|
||
6, 7, 8, 9, 10, 11, 12, 13, 14, 15,
|
||
16, 17, 18, 19, 0, 0, 0, 0, 0, 0,
|
||
0, 20, 21, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 188, 41, 203, 0, 227, 143, 140,
|
||
139, 141, 142, 146, 0, 133, 63, 64, 65, 66,
|
||
67, 68, 69, 70, 71, 72, 73, 0, 0, 0,
|
||
0, 131, 0, 0, 0, 83, 158, 90, 88, 0,
|
||
0, 215, 210, 193, 192, 0, 0, 25, 29, 24,
|
||
28, 23, 27, 22, 26, 30, 31, 0, 0, 49,
|
||
49, 236, 0, 0, 225, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 144, 54, 105, 106, 4, 5, 103, 104, 107,
|
||
102, 98, 99, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 0, 0, 0, 0, 101, 100, 54,
|
||
60, 60, 87, 157, 151, 154, 155, 0, 0, 80,
|
||
170, 171, 172, 177, 173, 174, 175, 176, 168, 0,
|
||
179, 184, 183, 185, 0, 194, 0, 0, 0, 232,
|
||
0, 234, 229, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
145, 0, 134, 0, 0, 0, 0, 0, 0, 93,
|
||
119, 0, 0, 97, 0, 94, 0, 0, 0, 0,
|
||
132, 81, 82, 150, 152, 0, 52, 89, 169, 0,
|
||
0, 0, 0, 0, 0, 0, 0, 0, 239, 0,
|
||
0, 217, 0, 219, 222, 0, 0, 220, 221, 0,
|
||
0, 0, 216, 0, 237, 0, 0, 0, 56, 54,
|
||
229, 0, 0, 0, 0, 0, 0, 92, 95, 96,
|
||
0, 0, 0, 0, 156, 153, 53, 47, 0, 178,
|
||
0, 0, 209, 49, 50, 49, 206, 228, 0, 0,
|
||
0, 0, 0, 212, 213, 214, 209, 0, 51, 57,
|
||
55, 0, 0, 0, 0, 0, 0, 118, 0, 0,
|
||
0, 0, 0, 159, 0, 0, 0, 208, 0, 0,
|
||
233, 235, 0, 0, 0, 218, 223, 224, 0, 238,
|
||
109, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
48, 180, 0, 0, 0, 207, 204, 0, 226, 108,
|
||
0, 115, 0, 0, 111, 112, 113, 114, 0, 197,
|
||
0, 0, 0, 205, 0, 0, 0, 195, 0, 196,
|
||
0, 0, 110, 116, 117, 0, 0, 0, 0, 0,
|
||
0, 202, 0, 0, 201, 198
|
||
};
|
||
|
||
/* YYDEFGOTO[NTERM-NUM]. */
|
||
static const short int yydefgoto[] =
|
||
{
|
||
-1, 76, 237, 253, 254, 255, 256, 177, 178, 207,
|
||
179, 22, 12, 32, 423, 289, 368, 387, 312, 369,
|
||
77, 78, 180, 80, 81, 106, 189, 320, 280, 321,
|
||
98, 1, 2, 3, 259, 232, 53, 161, 44, 93,
|
||
164, 82, 334, 265, 266, 267, 33, 86, 13, 39,
|
||
14, 15, 25, 339, 281, 83, 283, 396, 16, 35,
|
||
36, 153, 471, 88, 214, 427, 428, 154, 155, 348,
|
||
156, 157
|
||
};
|
||
|
||
/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
|
||
STATE-NUM. */
|
||
#define YYPACT_NINF -442
|
||
static const short int yypact[] =
|
||
{
|
||
-442, 25, 181, 372, -442, -442, -442, -442, -442, -442,
|
||
-442, -16, 33, 42, -442, -442, -14, -442, -442, 12,
|
||
-57, 18, 44, -25, -442, 33, 75, 106, -442, -442,
|
||
-442, -442, 1012, -21, -442, -442, 4, -442, -442, -442,
|
||
-442, 29, 32, 49, -442, 47, 75, 1012, 97, 97,
|
||
-442, -442, -442, -442, -442, -442, -442, 63, -442, -442,
|
||
-442, -442, -442, -442, -442, -442, -442, -442, -442, -442,
|
||
-442, -442, 170, 171, 173, 524, -442, 4, 72, -442,
|
||
-442, -84, -442, -442, -442, -442, -442, 1176, -442, 156,
|
||
94, 175, 158, -442, -442, -442, -442, -442, 1050, 1088,
|
||
-442, 74, 76, -442, -442, -84, -37, 78, 819, -442,
|
||
-442, 1050, -442, 131, 1126, 14, 128, 33, -442, -442,
|
||
-442, -442, -442, -442, -442, -442, -442, -442, -442, -442,
|
||
-442, -442, -442, -442, 1050, 1050, 1050, 1050, 1050, 1050,
|
||
1050, -442, -442, 1050, 1050, 1050, 1050, 1050, 1050, 1050,
|
||
1050, 1050, 1050, -442, 33, -442, 60, -442, -442, -442,
|
||
-442, -442, -442, -442, 23, -442, 129, 155, 190, 157,
|
||
194, 159, 196, 167, 197, 195, 198, 169, 199, 200,
|
||
406, -442, 1050, 1050, 1050, -442, 857, -442, 100, 101,
|
||
617, -442, -442, 63, -442, 617, 617, -442, -442, -442,
|
||
-442, -442, -442, -442, -442, -442, -442, 617, 1012, 105,
|
||
107, -442, 617, 118, 109, 178, 111, 123, 132, 133,
|
||
134, 135, 137, 617, 617, 617, 138, 1012, 1050, 1050,
|
||
209, -442, 139, -442, -442, -442, -442, -442, -442, -442,
|
||
-442, -442, -442, 140, 141, 144, 145, 146, 147, 895,
|
||
1088, 566, 211, 148, 149, 150, 151, -442, -442, 139,
|
||
-66, -88, -84, -442, 4, -442, 154, 152, 936, -442,
|
||
-442, -442, -442, -442, -442, -442, -442, -442, 184, 1088,
|
||
-442, -442, -442, -442, 168, -442, 172, 617, 5, -442,
|
||
6, -442, 174, 617, 153, 1050, 1050, 1050, 1050, 1050,
|
||
1050, 1050, 1050, 176, 177, 179, 1050, 617, 617, 180,
|
||
-442, -20, -442, 1088, 1088, 1088, 1088, 1088, 1088, -442,
|
||
-442, 24, -23, -442, -24, -442, 1088, 1088, 1088, 1088,
|
||
-442, -442, -442, -442, -442, 974, 226, -442, -442, 221,
|
||
-3, 241, 252, 182, 617, 271, 617, 1050, -442, 185,
|
||
617, -442, 186, -442, -442, 188, 192, -442, -442, 617,
|
||
617, 617, -442, 191, -442, 1050, 253, 278, -442, 139,
|
||
174, 250, 201, 202, 203, 204, 1088, -442, -442, -442,
|
||
205, 206, 207, 208, -442, -442, -442, 244, 210, -442,
|
||
617, 617, 1050, 216, -442, 216, -442, 222, 617, 223,
|
||
1050, 1050, 1050, -442, -442, -442, 1050, 617, -442, -442,
|
||
-442, 227, 1050, 1088, 1088, 1088, 1088, -442, 1088, 1088,
|
||
1088, 1088, 295, -442, 280, 224, 228, 222, 230, 259,
|
||
-442, -442, 1050, 219, 617, -442, -442, -442, 234, -442,
|
||
-442, 235, 231, 236, 240, 242, 238, 243, 245, 246,
|
||
-442, -442, 309, 41, 311, -442, -442, 239, -442, -442,
|
||
1088, -442, 1088, 1088, -442, -442, -442, -442, 617, -442,
|
||
715, 58, 330, -442, 247, 248, 257, -442, 255, -442,
|
||
715, 617, -442, -442, -442, 336, 263, 301, 617, 351,
|
||
355, -442, 617, 617, -442, -442
|
||
};
|
||
|
||
/* YYPGOTO[NTERM-NUM]. */
|
||
static const short int yypgoto[] =
|
||
{
|
||
-442, -442, -442, 290, 292, 294, 296, -115, -113, -441,
|
||
-442, 346, 362, -106, -442, -205, 50, -442, -246, -442,
|
||
-41, -442, -32, -442, -58, 277, -442, -97, 213, -232,
|
||
338, -442, -442, -442, -442, -442, 342, -442, -442, -442,
|
||
-442, 7, -442, 62, -442, -442, 370, -442, -442, -442,
|
||
-442, 395, -442, -442, -387, -59, 166, -107, -442, 383,
|
||
-442, -442, -442, -442, -442, 54, -4, -442, -442, 36,
|
||
-442, -442
|
||
};
|
||
|
||
/* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If
|
||
positive, shift that token. If negative, reduce the rule which
|
||
number is the opposite. If zero, do what YYDEFACT says.
|
||
If YYTABLE_NINF, syntax error. */
|
||
#define YYTABLE_NINF -123
|
||
static const short int yytable[] =
|
||
{
|
||
79, 205, 181, 206, 191, 291, 95, 194, 84, 34,
|
||
23, 208, 470, 330, 366, 79, 37, 105, 322, 324,
|
||
344, 346, -60, 195, 332, 4, 17, 109, 18, 211,
|
||
480, 109, 215, 216, 367, 196, 217, 218, 219, 220,
|
||
221, 222, 26, 23, 331, 226, 45, 340, 227, 109,
|
||
105, 197, 198, 199, 200, 201, 202, 203, 204, 345,
|
||
345, 41, 42, 43, 47, 34, 165, 184, 197, 198,
|
||
199, 200, 201, 202, 203, 204, 46, 185, 50, 190,
|
||
376, 376, 190, 478, 107, 7, 8, 9, 10, 378,
|
||
379, 48, 85, 486, 27, 28, 29, 30, 31, 52,
|
||
38, 376, 209, 210, 190, 212, 213, 190, 190, 389,
|
||
54, 190, 190, 190, 190, 190, 190, 223, 224, 225,
|
||
190, 258, 309, 410, 260, 261, 262, 230, 376, 96,
|
||
97, 282, 89, 231, 377, 90, 282, 282, 197, 198,
|
||
199, 200, 201, 202, 203, 204, 159, 160, 282, 228,
|
||
229, 469, 91, 282, 264, 92, 233, 234, -25, -25,
|
||
-24, -24, -23, -23, 282, 282, 282, 287, 479, -61,
|
||
-22, -22, 235, 236, 100, 101, 79, 102, 108, 162,
|
||
158, -122, 163, 182, 186, 183, 307, 192, 430, 352,
|
||
431, 354, 355, 356, -29, 79, 308, 190, -28, 362,
|
||
-27, -26, -32, 238, 268, -33, 5, 239, 269, 288,
|
||
262, 290, 6, 294, 295, 296, 370, 371, 372, 373,
|
||
374, 375, 7, 8, 9, 10, 293, 297, 282, 380,
|
||
381, 382, 383, 310, 282, 325, 298, 299, 300, 301,
|
||
11, 302, 306, 311, 338, 388, 313, 314, 282, 282,
|
||
315, 316, 317, 318, 326, 327, 328, 329, 335, 336,
|
||
366, 350, 390, 351, 190, 353, 190, 190, 190, 357,
|
||
358, 333, 341, 391, 190, 394, 342, 408, 347, 417,
|
||
359, 360, 409, 361, 365, 282, 412, 282, 392, 398,
|
||
400, 282, 401, 435, 436, 437, 402, 406, 422, 450,
|
||
282, 282, 282, 264, 451, 413, 414, 415, 416, 418,
|
||
419, 420, 421, 345, 424, 190, 442, 443, 444, 445,
|
||
429, 446, 447, 448, 449, 455, 432, 434, 452, 456,
|
||
468, 282, 282, 407, 440, 460, 453, 454, 205, 282,
|
||
206, 458, 459, 461, 462, 464, 463, 472, 282, 473,
|
||
465, 481, 466, 467, 482, 483, 205, 488, 206, 485,
|
||
190, 284, 285, 474, 484, 475, 476, 489, 190, 190,
|
||
190, 490, 492, 286, 190, 282, 493, 149, 292, 150,
|
||
441, 151, 87, 152, 49, 188, 386, 99, 94, 303,
|
||
304, 305, -35, 257, 17, 51, 18, 385, 24, 40,
|
||
190, 397, 438, 6, -35, -35, 411, 0, 0, 282,
|
||
0, 55, 56, -35, -35, -35, -35, 0, 0, -35,
|
||
19, 0, 282, 0, 0, 0, 0, 20, 17, 282,
|
||
18, 21, 240, 282, 282, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 0, 241, 242, 0, 0, 0, 0,
|
||
0, 0, 0, 343, 0, 0, 0, 0, 0, 349,
|
||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 363, 364, 0, 0, 0, 120, 121,
|
||
122, 123, 124, 125, 126, 127, 128, 129, 130, 131,
|
||
132, 133, 0, 0, 0, 0, 0, 243, 0, 244,
|
||
245, 141, 142, 0, 246, 247, 248, 0, 0, 0,
|
||
393, 0, 395, 0, 249, 0, 399, 250, 0, 251,
|
||
0, 0, 252, 0, 0, 403, 404, 405, 0, 55,
|
||
56, 0, 103, 58, 59, 60, 61, 62, 63, 64,
|
||
65, 66, 67, 68, 69, 70, 17, 0, 18, 0,
|
||
0, 0, 0, 0, 0, 0, 425, 426, 0, 0,
|
||
0, 0, 0, 0, 433, 0, 0, 0, 0, 71,
|
||
0, 55, 56, 439, 103, 166, 167, 168, 169, 170,
|
||
171, 172, 173, 174, 175, 176, 69, 70, 17, 0,
|
||
18, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
457, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 71, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
270, 271, 55, 56, 272, 0, 0, 0, 0, 72,
|
||
0, 0, 73, 0, 477, 74, 0, 75, 104, 17,
|
||
0, 18, 0, 273, 274, 275, 0, 487, 0, 0,
|
||
0, 0, 0, 0, 491, 276, 277, 0, 494, 495,
|
||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 72, 0, 0, 73, 278, 0, 74, 0, 75,
|
||
323, 0, 0, 0, 0, 0, 0, 0, 0, 120,
|
||
121, 122, 123, 124, 125, 126, 127, 128, 129, 130,
|
||
131, 132, 133, 0, 0, 0, 0, 0, 243, 0,
|
||
244, 245, 141, 142, 0, 246, 247, 248, 270, 271,
|
||
0, 0, 272, 0, 0, 0, 0, 0, 279, 0,
|
||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 273, 274, 275, 0, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 276, 277, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 278, 0, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 0, 0, 0, 0, 120, 121, 122,
|
||
123, 124, 125, 126, 127, 128, 129, 130, 131, 132,
|
||
133, 0, 0, 0, 0, 0, 243, 0, 244, 245,
|
||
141, 142, 0, 246, 247, 248, 0, 0, 0, 0,
|
||
0, 0, 0, 0, 55, 56, 279, 103, 58, 59,
|
||
60, 61, 62, 63, 64, 65, 66, 67, 68, 69,
|
||
70, 17, 0, 18, 0, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 0, 0, 0, 187, 0, 0, 0,
|
||
0, 0, 55, 56, 71, 103, 58, 59, 60, 61,
|
||
62, 63, 64, 65, 66, 67, 68, 69, 70, 17,
|
||
0, 18, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 0, 263, 0, 0, 0, 0, 0,
|
||
55, 56, 71, 103, 166, 167, 168, 169, 170, 171,
|
||
172, 173, 174, 175, 176, 69, 70, 17, 0, 18,
|
||
0, 0, 0, 0, 72, 0, 0, 73, 0, 0,
|
||
74, 0, 75, 0, 0, 0, 0, 0, 0, 0,
|
||
71, 55, 56, 0, 103, 58, 59, 60, 61, 62,
|
||
63, 64, 65, 66, 67, 68, 69, 70, 17, 0,
|
||
18, 0, 72, 0, 0, 73, 0, 0, 74, 0,
|
||
75, 0, 0, 337, 0, 0, 0, 0, 0, 55,
|
||
56, 71, 103, 58, 59, 60, 61, 62, 63, 64,
|
||
65, 66, 67, 68, 69, 70, 17, 0, 18, 0,
|
||
72, 0, 0, 73, 0, 319, 74, 0, 75, 0,
|
||
0, 384, 0, 0, 0, 0, 0, 55, 56, 71,
|
||
57, 58, 59, 60, 61, 62, 63, 64, 65, 66,
|
||
67, 68, 69, 70, 17, 0, 18, 0, 0, 0,
|
||
0, 72, 0, 0, 73, 0, 0, 74, 0, 75,
|
||
0, 0, 0, 0, 0, 55, 56, 71, 103, 58,
|
||
59, 60, 61, 62, 63, 64, 65, 66, 67, 68,
|
||
69, 70, 17, 0, 18, 0, 0, 0, 0, 72,
|
||
0, 0, 73, 0, 0, 74, 0, 75, 0, 0,
|
||
0, 0, 0, 55, 56, 71, 103, 166, 167, 168,
|
||
169, 170, 171, 172, 173, 174, 175, 176, 69, 70,
|
||
17, 0, 18, 0, 0, 0, 0, 72, 0, 0,
|
||
73, 0, 0, 74, 0, 75, 0, 0, 0, 0,
|
||
0, 55, 56, 71, 193, 58, 59, 60, 61, 62,
|
||
63, 64, 65, 66, 67, 68, 69, 70, 17, 0,
|
||
18, 0, 0, 0, 0, 72, 0, 0, 73, 0,
|
||
0, 74, 0, 75, 0, 0, 0, 0, 0, 0,
|
||
0, 71, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 0, 0, 72, 0, 0, 73, 0, 0, 74,
|
||
0, 75, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 110, 0, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 0, 111, 0, 0, 0, 0, 0, 0, 0,
|
||
0, 72, 112, 113, 73, 0, 0, 74, 0, 75,
|
||
0, 0, 114, 115, 116, 117, 118, 119, 120, 121,
|
||
122, 123, 124, 125, 126, 127, 128, 129, 130, 131,
|
||
132, 133, 134, 135, 136, 0, 0, 137, 138, 139,
|
||
140, 141, 142, 143, 144, 145, 146, 147, 148
|
||
};
|
||
|
||
static const short int yycheck[] =
|
||
{
|
||
32, 116, 99, 116, 111, 210, 47, 114, 29, 23,
|
||
3, 117, 453, 259, 34, 47, 30, 75, 250, 251,
|
||
15, 15, 106, 9, 112, 0, 22, 115, 24, 136,
|
||
471, 115, 139, 140, 54, 21, 143, 144, 145, 146,
|
||
147, 148, 58, 36, 110, 152, 103, 279, 154, 115,
|
||
108, 10, 11, 12, 13, 14, 15, 16, 17, 54,
|
||
54, 49, 50, 51, 20, 23, 98, 104, 10, 11,
|
||
12, 13, 14, 15, 16, 17, 58, 114, 103, 111,
|
||
104, 104, 114, 470, 77, 41, 42, 43, 44, 112,
|
||
114, 47, 113, 480, 61, 62, 63, 64, 65, 24,
|
||
114, 104, 134, 135, 136, 137, 138, 139, 140, 112,
|
||
4, 143, 144, 145, 146, 147, 148, 149, 150, 151,
|
||
152, 180, 229, 369, 182, 183, 184, 104, 104, 32,
|
||
33, 190, 103, 110, 110, 103, 195, 196, 10, 11,
|
||
12, 13, 14, 15, 16, 17, 52, 53, 207, 89,
|
||
90, 110, 103, 212, 186, 108, 27, 28, 3, 4,
|
||
3, 4, 3, 4, 223, 224, 225, 208, 110, 106,
|
||
3, 4, 3, 4, 4, 4, 208, 4, 106, 4,
|
||
24, 0, 24, 109, 106, 109, 227, 56, 393, 296,
|
||
395, 298, 299, 300, 4, 227, 228, 229, 4, 306,
|
||
4, 4, 7, 4, 104, 7, 25, 7, 107, 104,
|
||
268, 104, 31, 104, 36, 104, 313, 314, 315, 316,
|
||
317, 318, 41, 42, 43, 44, 108, 104, 287, 326,
|
||
327, 328, 329, 24, 293, 24, 104, 104, 104, 104,
|
||
59, 104, 104, 104, 60, 24, 106, 106, 307, 308,
|
||
106, 106, 106, 106, 106, 106, 106, 106, 104, 107,
|
||
34, 108, 21, 295, 296, 297, 298, 299, 300, 301,
|
||
302, 264, 104, 21, 306, 4, 104, 24, 104, 376,
|
||
104, 104, 4, 104, 104, 344, 36, 346, 106, 104,
|
||
104, 350, 104, 400, 401, 402, 104, 106, 54, 4,
|
||
359, 360, 361, 335, 24, 104, 104, 104, 104, 104,
|
||
104, 104, 104, 54, 104, 347, 413, 414, 415, 416,
|
||
104, 418, 419, 420, 421, 432, 104, 104, 104, 110,
|
||
21, 390, 391, 365, 107, 104, 108, 107, 453, 398,
|
||
453, 107, 107, 107, 104, 107, 104, 36, 407, 110,
|
||
107, 21, 107, 107, 107, 107, 471, 21, 471, 104,
|
||
392, 195, 196, 460, 107, 462, 463, 104, 400, 401,
|
||
402, 70, 21, 207, 406, 434, 21, 87, 212, 87,
|
||
412, 87, 36, 87, 22, 108, 336, 49, 46, 223,
|
||
224, 225, 20, 180, 22, 25, 24, 335, 3, 16,
|
||
432, 347, 406, 31, 32, 33, 370, -1, -1, 468,
|
||
-1, 5, 6, 41, 42, 43, 44, -1, -1, 47,
|
||
48, -1, 481, -1, -1, -1, -1, 55, 22, 488,
|
||
24, 59, 26, 492, 493, -1, -1, -1, -1, -1,
|
||
-1, -1, -1, -1, 38, 39, -1, -1, -1, -1,
|
||
-1, -1, -1, 287, -1, -1, -1, -1, -1, 293,
|
||
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
||
-1, -1, -1, 307, 308, -1, -1, -1, 72, 73,
|
||
74, 75, 76, 77, 78, 79, 80, 81, 82, 83,
|
||
84, 85, -1, -1, -1, -1, -1, 91, -1, 93,
|
||
94, 95, 96, -1, 98, 99, 100, -1, -1, -1,
|
||
344, -1, 346, -1, 108, -1, 350, 111, -1, 113,
|
||
-1, -1, 116, -1, -1, 359, 360, 361, -1, 5,
|
||
6, -1, 8, 9, 10, 11, 12, 13, 14, 15,
|
||
16, 17, 18, 19, 20, 21, 22, -1, 24, -1,
|
||
-1, -1, -1, -1, -1, -1, 390, 391, -1, -1,
|
||
-1, -1, -1, -1, 398, -1, -1, -1, -1, 45,
|
||
-1, 5, 6, 407, 8, 9, 10, 11, 12, 13,
|
||
14, 15, 16, 17, 18, 19, 20, 21, 22, -1,
|
||
24, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
||
434, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
||
-1, 45, -1, -1, -1, -1, -1, -1, -1, -1,
|
||
3, 4, 5, 6, 7, -1, -1, -1, -1, 105,
|
||
-1, -1, 108, -1, 468, 111, -1, 113, 114, 22,
|
||
-1, 24, -1, 26, 27, 28, -1, 481, -1, -1,
|
||
-1, -1, -1, -1, 488, 38, 39, -1, 492, 493,
|
||
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
||
-1, 105, -1, -1, 108, 58, -1, 111, -1, 113,
|
||
114, -1, -1, -1, -1, -1, -1, -1, -1, 72,
|
||
73, 74, 75, 76, 77, 78, 79, 80, 81, 82,
|
||
83, 84, 85, -1, -1, -1, -1, -1, 91, -1,
|
||
93, 94, 95, 96, -1, 98, 99, 100, 3, 4,
|
||
-1, -1, 7, -1, -1, -1, -1, -1, 111, -1,
|
||
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
||
-1, 26, 27, 28, -1, -1, -1, -1, -1, -1,
|
||
-1, -1, -1, 38, 39, -1, -1, -1, -1, -1,
|
||
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
||
-1, -1, -1, 58, -1, -1, -1, -1, -1, -1,
|
||
-1, -1, -1, -1, -1, -1, -1, 72, 73, 74,
|
||
75, 76, 77, 78, 79, 80, 81, 82, 83, 84,
|
||
85, -1, -1, -1, -1, -1, 91, -1, 93, 94,
|
||
95, 96, -1, 98, 99, 100, -1, -1, -1, -1,
|
||
-1, -1, -1, -1, 5, 6, 111, 8, 9, 10,
|
||
11, 12, 13, 14, 15, 16, 17, 18, 19, 20,
|
||
21, 22, -1, 24, -1, -1, -1, -1, -1, -1,
|
||
-1, -1, -1, -1, -1, -1, 37, -1, -1, -1,
|
||
-1, -1, 5, 6, 45, 8, 9, 10, 11, 12,
|
||
13, 14, 15, 16, 17, 18, 19, 20, 21, 22,
|
||
-1, 24, -1, -1, -1, -1, -1, -1, -1, -1,
|
||
-1, -1, -1, -1, 37, -1, -1, -1, -1, -1,
|
||
5, 6, 45, 8, 9, 10, 11, 12, 13, 14,
|
||
15, 16, 17, 18, 19, 20, 21, 22, -1, 24,
|
||
-1, -1, -1, -1, 105, -1, -1, 108, -1, -1,
|
||
111, -1, 113, -1, -1, -1, -1, -1, -1, -1,
|
||
45, 5, 6, -1, 8, 9, 10, 11, 12, 13,
|
||
14, 15, 16, 17, 18, 19, 20, 21, 22, -1,
|
||
24, -1, 105, -1, -1, 108, -1, -1, 111, -1,
|
||
113, -1, -1, 37, -1, -1, -1, -1, -1, 5,
|
||
6, 45, 8, 9, 10, 11, 12, 13, 14, 15,
|
||
16, 17, 18, 19, 20, 21, 22, -1, 24, -1,
|
||
105, -1, -1, 108, -1, 110, 111, -1, 113, -1,
|
||
-1, 37, -1, -1, -1, -1, -1, 5, 6, 45,
|
||
8, 9, 10, 11, 12, 13, 14, 15, 16, 17,
|
||
18, 19, 20, 21, 22, -1, 24, -1, -1, -1,
|
||
-1, 105, -1, -1, 108, -1, -1, 111, -1, 113,
|
||
-1, -1, -1, -1, -1, 5, 6, 45, 8, 9,
|
||
10, 11, 12, 13, 14, 15, 16, 17, 18, 19,
|
||
20, 21, 22, -1, 24, -1, -1, -1, -1, 105,
|
||
-1, -1, 108, -1, -1, 111, -1, 113, -1, -1,
|
||
-1, -1, -1, 5, 6, 45, 8, 9, 10, 11,
|
||
12, 13, 14, 15, 16, 17, 18, 19, 20, 21,
|
||
22, -1, 24, -1, -1, -1, -1, 105, -1, -1,
|
||
108, -1, -1, 111, -1, 113, -1, -1, -1, -1,
|
||
-1, 5, 6, 45, 8, 9, 10, 11, 12, 13,
|
||
14, 15, 16, 17, 18, 19, 20, 21, 22, -1,
|
||
24, -1, -1, -1, -1, 105, -1, -1, 108, -1,
|
||
-1, 111, -1, 113, -1, -1, -1, -1, -1, -1,
|
||
-1, 45, -1, -1, -1, -1, -1, -1, -1, -1,
|
||
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
||
-1, -1, -1, 105, -1, -1, 108, -1, -1, 111,
|
||
-1, 113, -1, -1, -1, -1, -1, -1, -1, -1,
|
||
-1, 35, -1, -1, -1, -1, -1, -1, -1, -1,
|
||
-1, -1, 46, -1, -1, -1, -1, -1, -1, -1,
|
||
-1, 105, 56, 57, 108, -1, -1, 111, -1, 113,
|
||
-1, -1, 66, 67, 68, 69, 70, 71, 72, 73,
|
||
74, 75, 76, 77, 78, 79, 80, 81, 82, 83,
|
||
84, 85, 86, 87, 88, -1, -1, 91, 92, 93,
|
||
94, 95, 96, 97, 98, 99, 100, 101, 102
|
||
};
|
||
|
||
/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
|
||
symbol of state STATE-NUM. */
|
||
static const unsigned char yystos[] =
|
||
{
|
||
0, 148, 149, 150, 0, 25, 31, 41, 42, 43,
|
||
44, 59, 129, 165, 167, 168, 175, 22, 24, 48,
|
||
55, 59, 128, 158, 168, 169, 58, 61, 62, 63,
|
||
64, 65, 130, 163, 23, 176, 177, 30, 114, 166,
|
||
176, 49, 50, 51, 155, 103, 58, 20, 47, 129,
|
||
103, 163, 24, 153, 4, 5, 6, 8, 9, 10,
|
||
11, 12, 13, 14, 15, 16, 17, 18, 19, 20,
|
||
21, 45, 105, 108, 111, 113, 118, 137, 138, 139,
|
||
140, 141, 158, 172, 29, 113, 164, 128, 180, 103,
|
||
103, 103, 108, 156, 153, 137, 32, 33, 147, 147,
|
||
4, 4, 4, 8, 114, 141, 142, 158, 106, 115,
|
||
35, 46, 56, 57, 66, 67, 68, 69, 70, 71,
|
||
72, 73, 74, 75, 76, 77, 78, 79, 80, 81,
|
||
82, 83, 84, 85, 86, 87, 88, 91, 92, 93,
|
||
94, 95, 96, 97, 98, 99, 100, 101, 102, 120,
|
||
121, 122, 123, 178, 184, 185, 187, 188, 24, 52,
|
||
53, 154, 4, 24, 157, 139, 9, 10, 11, 12,
|
||
13, 14, 15, 16, 17, 18, 19, 124, 125, 127,
|
||
139, 144, 109, 109, 104, 114, 106, 37, 142, 143,
|
||
139, 174, 56, 8, 174, 9, 21, 10, 11, 12,
|
||
13, 14, 15, 16, 17, 124, 125, 126, 130, 139,
|
||
139, 174, 139, 139, 181, 174, 174, 174, 174, 174,
|
||
174, 174, 174, 139, 139, 139, 174, 130, 89, 90,
|
||
104, 110, 152, 27, 28, 3, 4, 119, 4, 7,
|
||
26, 38, 39, 91, 93, 94, 98, 99, 100, 108,
|
||
111, 113, 116, 120, 121, 122, 123, 145, 172, 151,
|
||
141, 141, 141, 37, 139, 160, 161, 162, 104, 107,
|
||
3, 4, 7, 26, 27, 28, 38, 39, 58, 111,
|
||
145, 171, 172, 173, 173, 173, 173, 137, 104, 132,
|
||
104, 132, 173, 108, 104, 36, 104, 104, 104, 104,
|
||
104, 104, 104, 173, 173, 173, 104, 137, 139, 174,
|
||
24, 104, 135, 106, 106, 106, 106, 106, 106, 110,
|
||
144, 146, 146, 114, 146, 24, 106, 106, 106, 106,
|
||
135, 110, 112, 158, 159, 104, 107, 37, 60, 170,
|
||
146, 104, 104, 173, 15, 54, 15, 104, 186, 173,
|
||
108, 139, 174, 139, 174, 174, 174, 139, 139, 104,
|
||
104, 104, 174, 173, 173, 104, 34, 54, 133, 136,
|
||
144, 144, 144, 144, 144, 144, 104, 110, 112, 114,
|
||
144, 144, 144, 144, 37, 160, 133, 134, 24, 112,
|
||
21, 21, 106, 173, 4, 173, 174, 182, 104, 173,
|
||
104, 104, 104, 173, 173, 173, 106, 139, 24, 4,
|
||
135, 186, 36, 104, 104, 104, 104, 144, 104, 104,
|
||
104, 104, 54, 131, 104, 173, 173, 182, 183, 104,
|
||
132, 132, 104, 173, 104, 174, 174, 174, 183, 173,
|
||
107, 139, 144, 144, 144, 144, 144, 144, 144, 144,
|
||
4, 24, 104, 108, 107, 174, 110, 173, 107, 107,
|
||
104, 107, 104, 104, 107, 107, 107, 107, 21, 110,
|
||
126, 179, 36, 110, 144, 144, 144, 173, 171, 110,
|
||
126, 21, 107, 107, 107, 104, 171, 173, 21, 104,
|
||
70, 173, 21, 21, 173, 173
|
||
};
|
||
|
||
#define yyerrok (yyerrstatus = 0)
|
||
#define yyclearin (yychar = YYEMPTY)
|
||
#define YYEMPTY (-2)
|
||
#define YYEOF 0
|
||
|
||
#define YYACCEPT goto yyacceptlab
|
||
#define YYABORT goto yyabortlab
|
||
#define YYERROR goto yyerrorlab
|
||
|
||
|
||
/* Like YYERROR except do call yyerror. This remains here temporarily
|
||
to ease the transition to the new meaning of YYERROR, for GCC.
|
||
Once GCC version 2 has supplanted version 1, this can go. */
|
||
|
||
#define YYFAIL goto yyerrlab
|
||
|
||
#define YYRECOVERING() (!!yyerrstatus)
|
||
|
||
#define YYBACKUP(Token, Value) \
|
||
do \
|
||
if (yychar == YYEMPTY && yylen == 1) \
|
||
{ \
|
||
yychar = (Token); \
|
||
yylval = (Value); \
|
||
yytoken = YYTRANSLATE (yychar); \
|
||
YYPOPSTACK; \
|
||
goto yybackup; \
|
||
} \
|
||
else \
|
||
{ \
|
||
yyerror (YY_("syntax error: cannot back up")); \
|
||
YYERROR; \
|
||
} \
|
||
while (0)
|
||
|
||
|
||
#define YYTERROR 1
|
||
#define YYERRCODE 256
|
||
|
||
|
||
/* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N].
|
||
If N is 0, then set CURRENT to the empty location which ends
|
||
the previous symbol: RHS[0] (always defined). */
|
||
|
||
#define YYRHSLOC(Rhs, K) ((Rhs)[K])
|
||
#ifndef YYLLOC_DEFAULT
|
||
# define YYLLOC_DEFAULT(Current, Rhs, N) \
|
||
do \
|
||
if (N) \
|
||
{ \
|
||
(Current).first_line = YYRHSLOC (Rhs, 1).first_line; \
|
||
(Current).first_column = YYRHSLOC (Rhs, 1).first_column; \
|
||
(Current).last_line = YYRHSLOC (Rhs, N).last_line; \
|
||
(Current).last_column = YYRHSLOC (Rhs, N).last_column; \
|
||
} \
|
||
else \
|
||
{ \
|
||
(Current).first_line = (Current).last_line = \
|
||
YYRHSLOC (Rhs, 0).last_line; \
|
||
(Current).first_column = (Current).last_column = \
|
||
YYRHSLOC (Rhs, 0).last_column; \
|
||
} \
|
||
while (0)
|
||
#endif
|
||
|
||
|
||
/* YY_LOCATION_PRINT -- Print the location on the stream.
|
||
This macro was not mandated originally: define only if we know
|
||
we won't break user code: when these are the locations we know. */
|
||
|
||
#ifndef YY_LOCATION_PRINT
|
||
# if YYLTYPE_IS_TRIVIAL
|
||
# define YY_LOCATION_PRINT(File, Loc) \
|
||
fprintf (File, "%d.%d-%d.%d", \
|
||
(Loc).first_line, (Loc).first_column, \
|
||
(Loc).last_line, (Loc).last_column)
|
||
# else
|
||
# define YY_LOCATION_PRINT(File, Loc) ((void) 0)
|
||
# endif
|
||
#endif
|
||
|
||
|
||
/* YYLEX -- calling `yylex' with the right arguments. */
|
||
|
||
#ifdef YYLEX_PARAM
|
||
# define YYLEX yylex (YYLEX_PARAM)
|
||
#else
|
||
# define YYLEX yylex ()
|
||
#endif
|
||
|
||
/* Enable debugging if requested. */
|
||
#if YYDEBUG
|
||
|
||
# ifndef YYFPRINTF
|
||
# include <stdio.h> /* INFRINGES ON USER NAME SPACE */
|
||
# define YYFPRINTF fprintf
|
||
# endif
|
||
|
||
# define YYDPRINTF(Args) \
|
||
do { \
|
||
if (yydebug) \
|
||
YYFPRINTF Args; \
|
||
} while (0)
|
||
|
||
# define YY_SYMBOL_PRINT(Title, Type, Value, Location) \
|
||
do { \
|
||
if (yydebug) \
|
||
{ \
|
||
YYFPRINTF (stderr, "%s ", Title); \
|
||
yysymprint (stderr, \
|
||
Type, Value); \
|
||
YYFPRINTF (stderr, "\n"); \
|
||
} \
|
||
} while (0)
|
||
|
||
/*------------------------------------------------------------------.
|
||
| yy_stack_print -- Print the state stack from its BOTTOM up to its |
|
||
| TOP (included). |
|
||
`------------------------------------------------------------------*/
|
||
|
||
#if defined (__STDC__) || defined (__cplusplus)
|
||
static void
|
||
yy_stack_print (short int *bottom, short int *top)
|
||
#else
|
||
static void
|
||
yy_stack_print (bottom, top)
|
||
short int *bottom;
|
||
short int *top;
|
||
#endif
|
||
{
|
||
YYFPRINTF (stderr, "Stack now");
|
||
for (/* Nothing. */; bottom <= top; ++bottom)
|
||
YYFPRINTF (stderr, " %d", *bottom);
|
||
YYFPRINTF (stderr, "\n");
|
||
}
|
||
|
||
# define YY_STACK_PRINT(Bottom, Top) \
|
||
do { \
|
||
if (yydebug) \
|
||
yy_stack_print ((Bottom), (Top)); \
|
||
} while (0)
|
||
|
||
|
||
/*------------------------------------------------.
|
||
| Report that the YYRULE is going to be reduced. |
|
||
`------------------------------------------------*/
|
||
|
||
#if defined (__STDC__) || defined (__cplusplus)
|
||
static void
|
||
yy_reduce_print (int yyrule)
|
||
#else
|
||
static void
|
||
yy_reduce_print (yyrule)
|
||
int yyrule;
|
||
#endif
|
||
{
|
||
int yyi;
|
||
unsigned long int yylno = yyrline[yyrule];
|
||
YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu), ",
|
||
yyrule - 1, yylno);
|
||
/* Print the symbols being reduced, and their result. */
|
||
for (yyi = yyprhs[yyrule]; 0 <= yyrhs[yyi]; yyi++)
|
||
YYFPRINTF (stderr, "%s ", yytname[yyrhs[yyi]]);
|
||
YYFPRINTF (stderr, "-> %s\n", yytname[yyr1[yyrule]]);
|
||
}
|
||
|
||
# define YY_REDUCE_PRINT(Rule) \
|
||
do { \
|
||
if (yydebug) \
|
||
yy_reduce_print (Rule); \
|
||
} while (0)
|
||
|
||
/* Nonzero means print parse trace. It is left uninitialized so that
|
||
multiple parsers can coexist. */
|
||
int yydebug;
|
||
#else /* !YYDEBUG */
|
||
# define YYDPRINTF(Args)
|
||
# define YY_SYMBOL_PRINT(Title, Type, Value, Location)
|
||
# define YY_STACK_PRINT(Bottom, Top)
|
||
# define YY_REDUCE_PRINT(Rule)
|
||
#endif /* !YYDEBUG */
|
||
|
||
|
||
/* YYINITDEPTH -- initial size of the parser's stacks. */
|
||
#ifndef YYINITDEPTH
|
||
# define YYINITDEPTH 200
|
||
#endif
|
||
|
||
/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
|
||
if the built-in stack extension method is used).
|
||
|
||
Do not make this value too large; the results are undefined if
|
||
YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH)
|
||
evaluated with infinite-precision integer arithmetic. */
|
||
|
||
#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
|
||
{
|
||
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
|
||
{
|
||
char *yyd = yydest;
|
||
const char *yys = yysrc;
|
||
|
||
while ((*yyd++ = *yys++) != '\0')
|
||
continue;
|
||
|
||
return yyd - 1;
|
||
}
|
||
# endif
|
||
# endif
|
||
|
||
# ifndef yytnamerr
|
||
/* Copy to YYRES the contents of YYSTR after stripping away unnecessary
|
||
quotes and backslashes, so that it's suitable for yyerror. The
|
||
heuristic is that double-quoting is unnecessary unless the string
|
||
contains an apostrophe, a comma, or backslash (other than
|
||
backslash-backslash). YYSTR is taken from yytname. If YYRES is
|
||
null, do not copy; instead, return the length of what the result
|
||
would have been. */
|
||
static YYSIZE_T
|
||
yytnamerr (char *yyres, const char *yystr)
|
||
{
|
||
if (*yystr == '"')
|
||
{
|
||
size_t yyn = 0;
|
||
char const *yyp = yystr;
|
||
|
||
for (;;)
|
||
switch (*++yyp)
|
||
{
|
||
case '\'':
|
||
case ',':
|
||
goto do_not_strip_quotes;
|
||
|
||
case '\\':
|
||
if (*++yyp != '\\')
|
||
goto do_not_strip_quotes;
|
||
/* Fall through. */
|
||
default:
|
||
if (yyres)
|
||
yyres[yyn] = *yyp;
|
||
yyn++;
|
||
break;
|
||
|
||
case '"':
|
||
if (yyres)
|
||
yyres[yyn] = '\0';
|
||
return yyn;
|
||
}
|
||
do_not_strip_quotes: ;
|
||
}
|
||
|
||
if (! yyres)
|
||
return yystrlen (yystr);
|
||
|
||
return yystpcpy (yyres, yystr) - yyres;
|
||
}
|
||
# endif
|
||
|
||
#endif /* YYERROR_VERBOSE */
|
||
|
||
|
||
|
||
#if YYDEBUG
|
||
/*--------------------------------.
|
||
| Print this symbol on YYOUTPUT. |
|
||
`--------------------------------*/
|
||
|
||
#if defined (__STDC__) || defined (__cplusplus)
|
||
static void
|
||
yysymprint (FILE *yyoutput, int yytype, YYSTYPE *yyvaluep)
|
||
#else
|
||
static void
|
||
yysymprint (yyoutput, yytype, yyvaluep)
|
||
FILE *yyoutput;
|
||
int yytype;
|
||
YYSTYPE *yyvaluep;
|
||
#endif
|
||
{
|
||
/* Pacify ``unused variable'' warnings. */
|
||
(void) yyvaluep;
|
||
|
||
if (yytype < YYNTOKENS)
|
||
YYFPRINTF (yyoutput, "token %s (", yytname[yytype]);
|
||
else
|
||
YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]);
|
||
|
||
|
||
# ifdef YYPRINT
|
||
if (yytype < YYNTOKENS)
|
||
YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep);
|
||
# endif
|
||
switch (yytype)
|
||
{
|
||
default:
|
||
break;
|
||
}
|
||
YYFPRINTF (yyoutput, ")");
|
||
}
|
||
|
||
#endif /* ! YYDEBUG */
|
||
/*-----------------------------------------------.
|
||
| Release the memory associated to this symbol. |
|
||
`-----------------------------------------------*/
|
||
|
||
#if defined (__STDC__) || defined (__cplusplus)
|
||
static void
|
||
yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep)
|
||
#else
|
||
static void
|
||
yydestruct (yymsg, yytype, yyvaluep)
|
||
const char *yymsg;
|
||
int yytype;
|
||
YYSTYPE *yyvaluep;
|
||
#endif
|
||
{
|
||
/* Pacify ``unused variable'' warnings. */
|
||
(void) yyvaluep;
|
||
|
||
if (!yymsg)
|
||
yymsg = "Deleting";
|
||
YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp);
|
||
|
||
switch (yytype)
|
||
{
|
||
|
||
default:
|
||
break;
|
||
}
|
||
}
|
||
|
||
|
||
/* Prevent warnings from -Wmissing-prototypes. */
|
||
|
||
#ifdef YYPARSE_PARAM
|
||
# if defined (__STDC__) || defined (__cplusplus)
|
||
int yyparse (void *YYPARSE_PARAM);
|
||
# else
|
||
int yyparse ();
|
||
# endif
|
||
#else /* ! YYPARSE_PARAM */
|
||
#if defined (__STDC__) || defined (__cplusplus)
|
||
int yyparse (void);
|
||
#else
|
||
int yyparse ();
|
||
#endif
|
||
#endif /* ! YYPARSE_PARAM */
|
||
|
||
|
||
|
||
/* The look-ahead symbol. */
|
||
int yychar;
|
||
|
||
/* The semantic value of the look-ahead symbol. */
|
||
YYSTYPE yylval;
|
||
|
||
/* Number of syntax errors so far. */
|
||
int yynerrs;
|
||
|
||
|
||
|
||
/*----------.
|
||
| yyparse. |
|
||
`----------*/
|
||
|
||
#ifdef YYPARSE_PARAM
|
||
# if defined (__STDC__) || defined (__cplusplus)
|
||
int yyparse (void *YYPARSE_PARAM)
|
||
# else
|
||
int yyparse (YYPARSE_PARAM)
|
||
void *YYPARSE_PARAM;
|
||
# endif
|
||
#else /* ! YYPARSE_PARAM */
|
||
#if defined (__STDC__) || defined (__cplusplus)
|
||
int
|
||
yyparse (void)
|
||
#else
|
||
int
|
||
yyparse ()
|
||
|
||
#endif
|
||
#endif
|
||
{
|
||
|
||
int yystate;
|
||
int yyn;
|
||
int yyresult;
|
||
/* Number of tokens to shift before error messages enabled. */
|
||
int yyerrstatus;
|
||
/* Look-ahead token as an internal (translated) token number. */
|
||
int yytoken = 0;
|
||
|
||
/* Three stacks and their tools:
|
||
`yyss': related to states,
|
||
`yyvs': related to semantic values,
|
||
`yyls': related to locations.
|
||
|
||
Refer to the stacks thru separate pointers, to allow yyoverflow
|
||
to reallocate them elsewhere. */
|
||
|
||
/* The state stack. */
|
||
short int yyssa[YYINITDEPTH];
|
||
short int *yyss = yyssa;
|
||
short int *yyssp;
|
||
|
||
/* The semantic value stack. */
|
||
YYSTYPE yyvsa[YYINITDEPTH];
|
||
YYSTYPE *yyvs = yyvsa;
|
||
YYSTYPE *yyvsp;
|
||
|
||
|
||
|
||
#define YYPOPSTACK (yyvsp--, yyssp--)
|
||
|
||
YYSIZE_T yystacksize = YYINITDEPTH;
|
||
|
||
/* The variables used to return semantic value and location from the
|
||
action routines. */
|
||
YYSTYPE yyval;
|
||
|
||
|
||
/* When reducing, the number of symbols on the RHS of the reduced
|
||
rule. */
|
||
int yylen;
|
||
|
||
YYDPRINTF ((stderr, "Starting parse\n"));
|
||
|
||
yystate = 0;
|
||
yyerrstatus = 0;
|
||
yynerrs = 0;
|
||
yychar = YYEMPTY; /* Cause a token to be read. */
|
||
|
||
/* Initialize stack pointers.
|
||
Waste one element of value and location stack
|
||
so that they stay on the same level as the state stack.
|
||
The wasted elements are never initialized. */
|
||
|
||
yyssp = yyss;
|
||
yyvsp = yyvs;
|
||
|
||
goto yysetstate;
|
||
|
||
/*------------------------------------------------------------.
|
||
| yynewstate -- Push a new state, which is found in yystate. |
|
||
`------------------------------------------------------------*/
|
||
yynewstate:
|
||
/* In all cases, when you get here, the value and location stacks
|
||
have just been pushed. so pushing a state here evens the stacks.
|
||
*/
|
||
yyssp++;
|
||
|
||
yysetstate:
|
||
*yyssp = yystate;
|
||
|
||
if (yyss + yystacksize - 1 <= yyssp)
|
||
{
|
||
/* Get the current used size of the three stacks, in elements. */
|
||
YYSIZE_T yysize = yyssp - yyss + 1;
|
||
|
||
#ifdef yyoverflow
|
||
{
|
||
/* Give user a chance to reallocate the stack. Use copies of
|
||
these so that the &'s don't force the real ones into
|
||
memory. */
|
||
YYSTYPE *yyvs1 = yyvs;
|
||
short int *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 (YY_("memory exhausted"),
|
||
&yyss1, yysize * sizeof (*yyssp),
|
||
&yyvs1, yysize * sizeof (*yyvsp),
|
||
|
||
&yystacksize);
|
||
|
||
yyss = yyss1;
|
||
yyvs = yyvs1;
|
||
}
|
||
#else /* no yyoverflow */
|
||
# ifndef YYSTACK_RELOCATE
|
||
goto yyexhaustedlab;
|
||
# else
|
||
/* Extend the stack our own way. */
|
||
if (YYMAXDEPTH <= yystacksize)
|
||
goto yyexhaustedlab;
|
||
yystacksize *= 2;
|
||
if (YYMAXDEPTH < yystacksize)
|
||
yystacksize = YYMAXDEPTH;
|
||
|
||
{
|
||
short int *yyss1 = yyss;
|
||
union yyalloc *yyptr =
|
||
(union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
|
||
if (! yyptr)
|
||
goto yyexhaustedlab;
|
||
YYSTACK_RELOCATE (yyss);
|
||
YYSTACK_RELOCATE (yyvs);
|
||
|
||
# undef YYSTACK_RELOCATE
|
||
if (yyss1 != yyssa)
|
||
YYSTACK_FREE (yyss1);
|
||
}
|
||
# endif
|
||
#endif /* no yyoverflow */
|
||
|
||
yyssp = yyss + yysize - 1;
|
||
yyvsp = yyvs + yysize - 1;
|
||
|
||
|
||
YYDPRINTF ((stderr, "Stack size increased to %lu\n",
|
||
(unsigned long int) yystacksize));
|
||
|
||
if (yyss + yystacksize - 1 <= yyssp)
|
||
YYABORT;
|
||
}
|
||
|
||
YYDPRINTF ((stderr, "Entering state %d\n", yystate));
|
||
|
||
goto yybackup;
|
||
|
||
/*-----------.
|
||
| yybackup. |
|
||
`-----------*/
|
||
yybackup:
|
||
|
||
/* Do appropriate processing given the current state. */
|
||
/* Read a look-ahead token if we need one and don't already have one. */
|
||
/* yyresume: */
|
||
|
||
/* First try to decide what to do without reference to look-ahead token. */
|
||
|
||
yyn = yypact[yystate];
|
||
if (yyn == YYPACT_NINF)
|
||
goto yydefault;
|
||
|
||
/* Not known => get a look-ahead token if don't already have one. */
|
||
|
||
/* YYCHAR is either YYEMPTY or YYEOF or a valid look-ahead symbol. */
|
||
if (yychar == YYEMPTY)
|
||
{
|
||
YYDPRINTF ((stderr, "Reading a token: "));
|
||
yychar = YYLEX;
|
||
}
|
||
|
||
if (yychar <= YYEOF)
|
||
{
|
||
yychar = yytoken = YYEOF;
|
||
YYDPRINTF ((stderr, "Now at end of input.\n"));
|
||
}
|
||
else
|
||
{
|
||
yytoken = YYTRANSLATE (yychar);
|
||
YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
|
||
}
|
||
|
||
/* If the proper action on seeing token YYTOKEN is to reduce or to
|
||
detect an error, take that action. */
|
||
yyn += yytoken;
|
||
if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken)
|
||
goto yydefault;
|
||
yyn = yytable[yyn];
|
||
if (yyn <= 0)
|
||
{
|
||
if (yyn == 0 || yyn == YYTABLE_NINF)
|
||
goto yyerrlab;
|
||
yyn = -yyn;
|
||
goto yyreduce;
|
||
}
|
||
|
||
if (yyn == YYFINAL)
|
||
YYACCEPT;
|
||
|
||
/* Shift the look-ahead token. */
|
||
YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);
|
||
|
||
/* Discard the token being shifted unless it is eof. */
|
||
if (yychar != YYEOF)
|
||
yychar = YYEMPTY;
|
||
|
||
*++yyvsp = yylval;
|
||
|
||
|
||
/* Count tokens shifted since error; after three, turn off error
|
||
status. */
|
||
if (yyerrstatus)
|
||
yyerrstatus--;
|
||
|
||
yystate = yyn;
|
||
goto yynewstate;
|
||
|
||
|
||
/*-----------------------------------------------------------.
|
||
| yydefault -- do the default action for the current state. |
|
||
`-----------------------------------------------------------*/
|
||
yydefault:
|
||
yyn = yydefact[yystate];
|
||
if (yyn == 0)
|
||
goto yyerrlab;
|
||
goto yyreduce;
|
||
|
||
|
||
/*-----------------------------.
|
||
| yyreduce -- Do a reduction. |
|
||
`-----------------------------*/
|
||
yyreduce:
|
||
/* yyn is the number of a rule to reduce with. */
|
||
yylen = yyr2[yyn];
|
||
|
||
/* If YYLEN is nonzero, implement the default value of the action:
|
||
`$$ = $1'.
|
||
|
||
Otherwise, the following line sets YYVAL to garbage.
|
||
This behavior is undocumented and Bison
|
||
users should not rely upon it. Assigning to YYVAL
|
||
unconditionally makes the parser a bit smaller, and it avoids a
|
||
GCC warning that YYVAL may be used uninitialized. */
|
||
yyval = yyvsp[1-yylen];
|
||
|
||
|
||
YY_REDUCE_PRINT (yyn);
|
||
switch (yyn)
|
||
{
|
||
case 3:
|
||
#line 1028 "/proj/llvm/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 5:
|
||
#line 1037 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if ((yyvsp[0].UInt64Val) > (uint64_t)INT64_MAX) // Outside of my range!
|
||
GEN_ERROR("Value too large for type!");
|
||
(yyval.SInt64Val) = (int64_t)(yyvsp[0].UInt64Val);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 34:
|
||
#line 1061 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.StrVal) = (yyvsp[-1].StrVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 35:
|
||
#line 1065 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.StrVal) = 0;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 36:
|
||
#line 1070 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ (yyval.Linkage) = GlobalValue::InternalLinkage; ;}
|
||
break;
|
||
|
||
case 37:
|
||
#line 1071 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ (yyval.Linkage) = GlobalValue::LinkOnceLinkage; ;}
|
||
break;
|
||
|
||
case 38:
|
||
#line 1072 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ (yyval.Linkage) = GlobalValue::WeakLinkage; ;}
|
||
break;
|
||
|
||
case 39:
|
||
#line 1073 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ (yyval.Linkage) = GlobalValue::AppendingLinkage; ;}
|
||
break;
|
||
|
||
case 40:
|
||
#line 1074 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ (yyval.Linkage) = GlobalValue::ExternalLinkage; ;}
|
||
break;
|
||
|
||
case 41:
|
||
#line 1076 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ (yyval.UIntVal) = CallingConv::C; ;}
|
||
break;
|
||
|
||
case 42:
|
||
#line 1077 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ (yyval.UIntVal) = CallingConv::C; ;}
|
||
break;
|
||
|
||
case 43:
|
||
#line 1078 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ (yyval.UIntVal) = CallingConv::CSRet; ;}
|
||
break;
|
||
|
||
case 44:
|
||
#line 1079 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ (yyval.UIntVal) = CallingConv::Fast; ;}
|
||
break;
|
||
|
||
case 45:
|
||
#line 1080 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ (yyval.UIntVal) = CallingConv::Cold; ;}
|
||
break;
|
||
|
||
case 46:
|
||
#line 1081 "/proj/llvm/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 47:
|
||
#line 1090 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ (yyval.UIntVal) = 0; ;}
|
||
break;
|
||
|
||
case 48:
|
||
#line 1091 "/proj/llvm/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 49:
|
||
#line 1097 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ (yyval.UIntVal) = 0; ;}
|
||
break;
|
||
|
||
case 50:
|
||
#line 1098 "/proj/llvm/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 51:
|
||
#line 1106 "/proj/llvm/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 52:
|
||
#line 1114 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ (yyval.StrVal) = 0; ;}
|
||
break;
|
||
|
||
case 53:
|
||
#line 1115 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ (yyval.StrVal) = (yyvsp[0].StrVal); ;}
|
||
break;
|
||
|
||
case 54:
|
||
#line 1120 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{;}
|
||
break;
|
||
|
||
case 55:
|
||
#line 1121 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{;}
|
||
break;
|
||
|
||
case 56:
|
||
#line 1122 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CurGV->setSection((yyvsp[0].StrVal));
|
||
free((yyvsp[0].StrVal));
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 57:
|
||
#line 1127 "/proj/llvm/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 59:
|
||
#line 1141 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ (yyval.TypeVal) = new PATypeHolder((yyvsp[0].PrimType)); ;}
|
||
break;
|
||
|
||
case 61:
|
||
#line 1142 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ (yyval.TypeVal) = new PATypeHolder((yyvsp[0].PrimType)); ;}
|
||
break;
|
||
|
||
case 62:
|
||
#line 1144 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!UpRefs.empty())
|
||
GEN_ERROR("Invalid upreference in type: " + (*(yyvsp[0].TypeVal))->getDescription());
|
||
(yyval.TypeVal) = (yyvsp[0].TypeVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 76:
|
||
#line 1156 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.TypeVal) = new PATypeHolder(OpaqueType::get());
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 77:
|
||
#line 1160 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.TypeVal) = new PATypeHolder((yyvsp[0].PrimType));
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 78:
|
||
#line 1164 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Named types are also simple types...
|
||
(yyval.TypeVal) = new PATypeHolder(getTypeVal((yyvsp[0].ValIDVal)));
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 79:
|
||
#line 1171 "/proj/llvm/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 80:
|
||
#line 1179 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Function derived type?
|
||
std::vector<const Type*> Params;
|
||
for (std::list<llvm::PATypeHolder>::iterator I = (yyvsp[-1].TypeList)->begin(),
|
||
E = (yyvsp[-1].TypeList)->end(); I != E; ++I)
|
||
Params.push_back(*I);
|
||
bool isVarArg = Params.size() && Params.back() == Type::VoidTy;
|
||
if (isVarArg) Params.pop_back();
|
||
|
||
(yyval.TypeVal) = new PATypeHolder(HandleUpRefs(FunctionType::get(*(yyvsp[-3].TypeVal),Params,isVarArg)));
|
||
delete (yyvsp[-1].TypeList); // Delete the argument list
|
||
delete (yyvsp[-3].TypeVal); // Delete the return type handle
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 81:
|
||
#line 1192 "/proj/llvm/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 82:
|
||
#line 1197 "/proj/llvm/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->isPrimitiveType())
|
||
GEN_ERROR("Elemental 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 83:
|
||
#line 1209 "/proj/llvm/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 84:
|
||
#line 1219 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Empty structure type?
|
||
(yyval.TypeVal) = new PATypeHolder(StructType::get(std::vector<const Type*>()));
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 85:
|
||
#line 1223 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Pointer type?
|
||
(yyval.TypeVal) = new PATypeHolder(HandleUpRefs(PointerType::get(*(yyvsp[-1].TypeVal))));
|
||
delete (yyvsp[-1].TypeVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 86:
|
||
#line 1232 "/proj/llvm/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 87:
|
||
#line 1237 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
((yyval.TypeList)=(yyvsp[-2].TypeList))->push_back(*(yyvsp[0].TypeVal)); delete (yyvsp[0].TypeVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 89:
|
||
#line 1244 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
((yyval.TypeList)=(yyvsp[-2].TypeList))->push_back(Type::VoidTy);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 90:
|
||
#line 1248 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
((yyval.TypeList) = new std::list<PATypeHolder>())->push_back(Type::VoidTy);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 91:
|
||
#line 1252 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.TypeList) = new std::list<PATypeHolder>();
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 92:
|
||
#line 1263 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Nonempty unsized arr
|
||
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 93:
|
||
#line 1289 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
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 94:
|
||
#line 1303 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
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::SByteTy) {
|
||
for (signed char *C = (signed char *)(yyvsp[0].StrVal); C != (signed char *)EndStr; ++C)
|
||
Vals.push_back(ConstantSInt::get(ETy, *C));
|
||
} else if (ETy == Type::UByteTy) {
|
||
for (unsigned char *C = (unsigned char *)(yyvsp[0].StrVal);
|
||
C != (unsigned char*)EndStr; ++C)
|
||
Vals.push_back(ConstantUInt::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 95:
|
||
#line 1333 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Nonempty unsized arr
|
||
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 96:
|
||
#line 1359 "/proj/llvm/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!");
|
||
|
||
(yyval.ConstVal) = ConstantStruct::get(STy, *(yyvsp[-1].ConstVector));
|
||
delete (yyvsp[-3].TypeVal); delete (yyvsp[-1].ConstVector);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 97:
|
||
#line 1380 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
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!");
|
||
|
||
(yyval.ConstVal) = ConstantStruct::get(STy, std::vector<Constant*>());
|
||
delete (yyvsp[-2].TypeVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 98:
|
||
#line 1393 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
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 99:
|
||
#line 1403 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.ConstVal) = UndefValue::get((yyvsp[-1].TypeVal)->get());
|
||
delete (yyvsp[-1].TypeVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 100:
|
||
#line 1408 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
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));
|
||
|
||
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 101:
|
||
#line 1468 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if ((yyvsp[-1].TypeVal)->get() != (yyvsp[0].ConstVal)->getType())
|
||
GEN_ERROR("Mismatched types for constant expression!");
|
||
(yyval.ConstVal) = (yyvsp[0].ConstVal);
|
||
delete (yyvsp[-1].TypeVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 102:
|
||
#line 1475 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
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 103:
|
||
#line 1484 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // integral constants
|
||
if (!ConstantSInt::isValueValidForType((yyvsp[-1].PrimType), (yyvsp[0].SInt64Val)))
|
||
GEN_ERROR("Constant value doesn't fit in type!");
|
||
(yyval.ConstVal) = ConstantSInt::get((yyvsp[-1].PrimType), (yyvsp[0].SInt64Val));
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 104:
|
||
#line 1490 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // integral constants
|
||
if (!ConstantUInt::isValueValidForType((yyvsp[-1].PrimType), (yyvsp[0].UInt64Val)))
|
||
GEN_ERROR("Constant value doesn't fit in type!");
|
||
(yyval.ConstVal) = ConstantUInt::get((yyvsp[-1].PrimType), (yyvsp[0].UInt64Val));
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 105:
|
||
#line 1496 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Boolean constants
|
||
(yyval.ConstVal) = ConstantBool::True;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 106:
|
||
#line 1500 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Boolean constants
|
||
(yyval.ConstVal) = ConstantBool::False;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 107:
|
||
#line 1504 "/proj/llvm/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 108:
|
||
#line 1512 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!(yyvsp[-3].ConstVal)->getType()->isFirstClassType())
|
||
GEN_ERROR("cast constant expression from a non-primitive type: '" +
|
||
(yyvsp[-3].ConstVal)->getType()->getDescription() + "'!");
|
||
if (!(yyvsp[-1].TypeVal)->get()->isFirstClassType())
|
||
GEN_ERROR("cast constant expression to a non-primitive type: '" +
|
||
(yyvsp[-1].TypeVal)->get()->getDescription() + "'!");
|
||
(yyval.ConstVal) = ConstantExpr::getCast((yyvsp[-3].ConstVal), (yyvsp[-1].TypeVal)->get());
|
||
delete (yyvsp[-1].TypeVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 109:
|
||
#line 1523 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!isa<PointerType>((yyvsp[-2].ConstVal)->getType()))
|
||
GEN_ERROR("GetElementPtr requires a pointer operand!");
|
||
|
||
// LLVM 1.2 and earlier used ubyte struct indices. Convert any ubyte struct
|
||
// indices to uint struct indices for compatibility.
|
||
generic_gep_type_iterator<std::vector<Value*>::iterator>
|
||
GTI = gep_type_begin((yyvsp[-2].ConstVal)->getType(), (yyvsp[-1].ValueList)->begin(), (yyvsp[-1].ValueList)->end()),
|
||
GTE = gep_type_end((yyvsp[-2].ConstVal)->getType(), (yyvsp[-1].ValueList)->begin(), (yyvsp[-1].ValueList)->end());
|
||
for (unsigned i = 0, e = (yyvsp[-1].ValueList)->size(); i != e && GTI != GTE; ++i, ++GTI)
|
||
if (isa<StructType>(*GTI)) // Only change struct indices
|
||
if (ConstantUInt *CUI = dyn_cast<ConstantUInt>((*(yyvsp[-1].ValueList))[i]))
|
||
if (CUI->getType() == Type::UByteTy)
|
||
(*(yyvsp[-1].ValueList))[i] = ConstantExpr::getCast(CUI, Type::UIntTy);
|
||
|
||
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 110:
|
||
#line 1555 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if ((yyvsp[-5].ConstVal)->getType() != Type::BoolTy)
|
||
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 111:
|
||
#line 1563 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if ((yyvsp[-3].ConstVal)->getType() != (yyvsp[-1].ConstVal)->getType())
|
||
GEN_ERROR("Binary operator types must match!");
|
||
// HACK: llvm 1.3 and earlier used to emit invalid pointer constant exprs.
|
||
// To retain backward compatibility with these early compilers, we emit a
|
||
// cast to the appropriate integer type automatically if we are in the
|
||
// broken case. See PR424 for more information.
|
||
if (!isa<PointerType>((yyvsp[-3].ConstVal)->getType())) {
|
||
(yyval.ConstVal) = ConstantExpr::get((yyvsp[-5].BinaryOpVal), (yyvsp[-3].ConstVal), (yyvsp[-1].ConstVal));
|
||
} else {
|
||
const Type *IntPtrTy = 0;
|
||
switch (CurModule.CurrentModule->getPointerSize()) {
|
||
case Module::Pointer32: IntPtrTy = Type::IntTy; break;
|
||
case Module::Pointer64: IntPtrTy = Type::LongTy; break;
|
||
default: GEN_ERROR("invalid pointer binary constant expr!");
|
||
}
|
||
(yyval.ConstVal) = ConstantExpr::get((yyvsp[-5].BinaryOpVal), ConstantExpr::getCast((yyvsp[-3].ConstVal), IntPtrTy),
|
||
ConstantExpr::getCast((yyvsp[-1].ConstVal), IntPtrTy));
|
||
(yyval.ConstVal) = ConstantExpr::getCast((yyval.ConstVal), (yyvsp[-3].ConstVal)->getType());
|
||
}
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 112:
|
||
#line 1585 "/proj/llvm/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()->isIntegral()) {
|
||
if (!isa<PackedType>((yyvsp[-3].ConstVal)->getType()) ||
|
||
!cast<PackedType>((yyvsp[-3].ConstVal)->getType())->getElementType()->isIntegral())
|
||
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 113:
|
||
#line 1596 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if ((yyvsp[-3].ConstVal)->getType() != (yyvsp[-1].ConstVal)->getType())
|
||
GEN_ERROR("setcc operand types must match!");
|
||
(yyval.ConstVal) = ConstantExpr::get((yyvsp[-5].BinaryOpVal), (yyvsp[-3].ConstVal), (yyvsp[-1].ConstVal));
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 114:
|
||
#line 1602 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if ((yyvsp[-1].ConstVal)->getType() != Type::UByteTy)
|
||
GEN_ERROR("Shift count for shift constant must be unsigned byte!");
|
||
if (!(yyvsp[-3].ConstVal)->getType()->isInteger())
|
||
GEN_ERROR("Shift constant expression requires integer operand!");
|
||
(yyval.ConstVal) = ConstantExpr::get((yyvsp[-5].OtherOpVal), (yyvsp[-3].ConstVal), (yyvsp[-1].ConstVal));
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 115:
|
||
#line 1610 "/proj/llvm/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 116:
|
||
#line 1616 "/proj/llvm/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 117:
|
||
#line 1622 "/proj/llvm/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 118:
|
||
#line 1631 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
((yyval.ConstVector) = (yyvsp[-2].ConstVector))->push_back((yyvsp[0].ConstVal));
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 119:
|
||
#line 1635 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.ConstVector) = new std::vector<Constant*>();
|
||
(yyval.ConstVector)->push_back((yyvsp[0].ConstVal));
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 120:
|
||
#line 1643 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ (yyval.BoolVal) = false; ;}
|
||
break;
|
||
|
||
case 121:
|
||
#line 1643 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ (yyval.BoolVal) = true; ;}
|
||
break;
|
||
|
||
case 122:
|
||
#line 1653 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.ModuleVal) = ParserResult = (yyvsp[0].ModuleVal);
|
||
CurModule.ModuleDone();
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 123:
|
||
#line 1661 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.ModuleVal) = (yyvsp[-1].ModuleVal);
|
||
CurFun.FunctionDone();
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 124:
|
||
#line 1666 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.ModuleVal) = (yyvsp[-1].ModuleVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 125:
|
||
#line 1670 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.ModuleVal) = (yyvsp[-3].ModuleVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 126:
|
||
#line 1674 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.ModuleVal) = (yyvsp[-1].ModuleVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 127:
|
||
#line 1678 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.ModuleVal) = CurModule.CurrentModule;
|
||
// 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 128:
|
||
#line 1693 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
// 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)) {
|
||
// 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 129:
|
||
#line 1714 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Function prototypes can be in const pool
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 130:
|
||
#line 1717 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Asm blocks can be in the const pool
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 131:
|
||
#line 1720 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if ((yyvsp[0].ConstVal) == 0) GEN_ERROR("Global value initializer is not a constant!");
|
||
CurGV = ParseGlobalVariable((yyvsp[-3].StrVal), (yyvsp[-2].Linkage), (yyvsp[-1].BoolVal), (yyvsp[0].ConstVal)->getType(), (yyvsp[0].ConstVal));
|
||
;}
|
||
break;
|
||
|
||
case 132:
|
||
#line 1723 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CurGV = 0;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 133:
|
||
#line 1727 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CurGV = ParseGlobalVariable((yyvsp[-3].StrVal), GlobalValue::ExternalLinkage,
|
||
(yyvsp[-1].BoolVal), *(yyvsp[0].TypeVal), 0);
|
||
delete (yyvsp[0].TypeVal);
|
||
;}
|
||
break;
|
||
|
||
case 134:
|
||
#line 1731 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CurGV = 0;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 135:
|
||
#line 1735 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 136:
|
||
#line 1738 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 137:
|
||
#line 1741 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
;}
|
||
break;
|
||
|
||
case 138:
|
||
#line 1745 "/proj/llvm/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 139:
|
||
#line 1758 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ (yyval.Endianness) = Module::BigEndian; ;}
|
||
break;
|
||
|
||
case 140:
|
||
#line 1759 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ (yyval.Endianness) = Module::LittleEndian; ;}
|
||
break;
|
||
|
||
case 141:
|
||
#line 1761 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CurModule.CurrentModule->setEndianness((yyvsp[0].Endianness));
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 142:
|
||
#line 1765 "/proj/llvm/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 143:
|
||
#line 1774 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CurModule.CurrentModule->setTargetTriple((yyvsp[0].StrVal));
|
||
free((yyvsp[0].StrVal));
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 145:
|
||
#line 1782 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CurModule.CurrentModule->addLibrary((yyvsp[0].StrVal));
|
||
free((yyvsp[0].StrVal));
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 146:
|
||
#line 1787 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CurModule.CurrentModule->addLibrary((yyvsp[0].StrVal));
|
||
free((yyvsp[0].StrVal));
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 147:
|
||
#line 1792 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 151:
|
||
#line 1802 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ (yyval.StrVal) = 0; ;}
|
||
break;
|
||
|
||
case 152:
|
||
#line 1804 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (*(yyvsp[-1].TypeVal) == Type::VoidTy)
|
||
GEN_ERROR("void typed arguments are invalid!");
|
||
(yyval.ArgVal) = new std::pair<PATypeHolder*, char*>((yyvsp[-1].TypeVal), (yyvsp[0].StrVal));
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 153:
|
||
#line 1811 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.ArgList) = (yyvsp[-2].ArgList);
|
||
(yyvsp[-2].ArgList)->push_back(*(yyvsp[0].ArgVal));
|
||
delete (yyvsp[0].ArgVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 154:
|
||
#line 1817 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.ArgList) = new std::vector<std::pair<PATypeHolder*,char*> >();
|
||
(yyval.ArgList)->push_back(*(yyvsp[0].ArgVal));
|
||
delete (yyvsp[0].ArgVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 155:
|
||
#line 1824 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.ArgList) = (yyvsp[0].ArgList);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 156:
|
||
#line 1828 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.ArgList) = (yyvsp[-2].ArgList);
|
||
(yyval.ArgList)->push_back(std::pair<PATypeHolder*,
|
||
char*>(new PATypeHolder(Type::VoidTy), 0));
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 157:
|
||
#line 1834 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.ArgList) = new std::vector<std::pair<PATypeHolder*,char*> >();
|
||
(yyval.ArgList)->push_back(std::make_pair(new PATypeHolder(Type::VoidTy), (char*)0));
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 158:
|
||
#line 1839 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.ArgList) = 0;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 159:
|
||
#line 1845 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
UnEscapeLexed((yyvsp[-5].StrVal));
|
||
std::string FunctionName((yyvsp[-5].StrVal));
|
||
free((yyvsp[-5].StrVal)); // Free strdup'd memory!
|
||
|
||
if (!(*(yyvsp[-6].TypeVal))->isFirstClassType() && *(yyvsp[-6].TypeVal) != Type::VoidTy)
|
||
GEN_ERROR("LLVM functions cannot return aggregate types!");
|
||
|
||
std::vector<const Type*> ParamTypeList;
|
||
if ((yyvsp[-3].ArgList)) { // If there are arguments...
|
||
for (std::vector<std::pair<PATypeHolder*,char*> >::iterator I = (yyvsp[-3].ArgList)->begin();
|
||
I != (yyvsp[-3].ArgList)->end(); ++I)
|
||
ParamTypeList.push_back(I->first->get());
|
||
}
|
||
|
||
bool isVarArg = ParamTypeList.size() && ParamTypeList.back() == Type::VoidTy;
|
||
if (isVarArg) ParamTypeList.pop_back();
|
||
|
||
const FunctionType *FT = FunctionType::get(*(yyvsp[-6].TypeVal), ParamTypeList, isVarArg);
|
||
const PointerType *PFT = PointerType::get(FT);
|
||
delete (yyvsp[-6].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);
|
||
Fn->setCallingConv((yyvsp[-7].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[-3].ArgList)) { // Is null if empty...
|
||
if (isVarArg) { // Nuke the last entry
|
||
assert((yyvsp[-3].ArgList)->back().first->get() == Type::VoidTy && (yyvsp[-3].ArgList)->back().second == 0&&
|
||
"Not a varargs marker!");
|
||
delete (yyvsp[-3].ArgList)->back().first;
|
||
(yyvsp[-3].ArgList)->pop_back(); // Delete the last entry
|
||
}
|
||
Function::arg_iterator ArgIt = Fn->arg_begin();
|
||
for (std::vector<std::pair<PATypeHolder*,char*> >::iterator I = (yyvsp[-3].ArgList)->begin();
|
||
I != (yyvsp[-3].ArgList)->end(); ++I, ++ArgIt) {
|
||
delete I->first; // Delete the typeholder...
|
||
|
||
setValueName(ArgIt, I->second); // Insert arg into symtab...
|
||
InsertValue(ArgIt);
|
||
}
|
||
|
||
delete (yyvsp[-3].ArgList); // We're now done with the argument list
|
||
}
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 162:
|
||
#line 1933 "/proj/llvm/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[-2].Linkage));
|
||
;}
|
||
break;
|
||
|
||
case 165:
|
||
#line 1943 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.FunctionVal) = (yyvsp[-1].FunctionVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 166:
|
||
#line 1948 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ CurFun.isDeclare = true; ;}
|
||
break;
|
||
|
||
case 167:
|
||
#line 1948 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.FunctionVal) = CurFun.CurrentFunction;
|
||
CurFun.FunctionDone();
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 168:
|
||
#line 1958 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.BoolVal) = false;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 169:
|
||
#line 1962 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.BoolVal) = true;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 170:
|
||
#line 1967 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // A reference to a direct constant
|
||
(yyval.ValIDVal) = ValID::create((yyvsp[0].SInt64Val));
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 171:
|
||
#line 1971 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.ValIDVal) = ValID::create((yyvsp[0].UInt64Val));
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 172:
|
||
#line 1975 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Perhaps it's an FP constant?
|
||
(yyval.ValIDVal) = ValID::create((yyvsp[0].FPVal));
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 173:
|
||
#line 1979 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.ValIDVal) = ValID::create(ConstantBool::True);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 174:
|
||
#line 1983 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.ValIDVal) = ValID::create(ConstantBool::False);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 175:
|
||
#line 1987 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.ValIDVal) = ValID::createNull();
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 176:
|
||
#line 1991 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.ValIDVal) = ValID::createUndef();
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 177:
|
||
#line 1995 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // A vector zero constant.
|
||
(yyval.ValIDVal) = ValID::createZeroInit();
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 178:
|
||
#line 1999 "/proj/llvm/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 179:
|
||
#line 2024 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.ValIDVal) = ValID::create((yyvsp[0].ConstVal));
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 180:
|
||
#line 2028 "/proj/llvm/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 181:
|
||
#line 2042 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Is it an integer reference...?
|
||
(yyval.ValIDVal) = ValID::create((yyvsp[0].SIntVal));
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 182:
|
||
#line 2046 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Is it a named reference...?
|
||
(yyval.ValIDVal) = ValID::create((yyvsp[0].StrVal));
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 185:
|
||
#line 2058 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.ValueVal) = getVal(*(yyvsp[-1].TypeVal), (yyvsp[0].ValIDVal)); delete (yyvsp[-1].TypeVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 186:
|
||
#line 2063 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.FunctionVal) = (yyvsp[-1].FunctionVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 187:
|
||
#line 2067 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Do not allow functions with 0 basic blocks
|
||
(yyval.FunctionVal) = (yyvsp[-1].FunctionVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 188:
|
||
#line 2076 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
setValueName((yyvsp[0].TermInstVal), (yyvsp[-1].StrVal));
|
||
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 189:
|
||
#line 2086 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyvsp[-1].BasicBlockVal)->getInstList().push_back((yyvsp[0].InstVal));
|
||
(yyval.BasicBlockVal) = (yyvsp[-1].BasicBlockVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 190:
|
||
#line 2091 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.BasicBlockVal) = CurBB = getBBVal(ValID::create((int)CurFun.NextBBNum++), true);
|
||
|
||
// 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 191:
|
||
#line 2102 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.BasicBlockVal) = CurBB = getBBVal(ValID::create((yyvsp[0].StrVal)), true);
|
||
|
||
// 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 192:
|
||
#line 2114 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Return with a result...
|
||
(yyval.TermInstVal) = new ReturnInst((yyvsp[0].ValueVal));
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 193:
|
||
#line 2118 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Return with no result...
|
||
(yyval.TermInstVal) = new ReturnInst();
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 194:
|
||
#line 2122 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Unconditional Branch...
|
||
(yyval.TermInstVal) = new BranchInst(getBBVal((yyvsp[0].ValIDVal)));
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 195:
|
||
#line 2126 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.TermInstVal) = new BranchInst(getBBVal((yyvsp[-3].ValIDVal)), getBBVal((yyvsp[0].ValIDVal)), getVal(Type::BoolTy, (yyvsp[-6].ValIDVal)));
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 196:
|
||
#line 2130 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
SwitchInst *S = new SwitchInst(getVal((yyvsp[-7].PrimType), (yyvsp[-6].ValIDVal)), getBBVal((yyvsp[-3].ValIDVal)), (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 197:
|
||
#line 2145 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
SwitchInst *S = new SwitchInst(getVal((yyvsp[-6].PrimType), (yyvsp[-5].ValIDVal)), getBBVal((yyvsp[-2].ValIDVal)), 0);
|
||
(yyval.TermInstVal) = S;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 198:
|
||
#line 2151 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
const PointerType *PFTy;
|
||
const FunctionType *Ty;
|
||
|
||
if (!(PFTy = dyn_cast<PointerType>((yyvsp[-10].TypeVal)->get())) ||
|
||
!(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) {
|
||
// Pull out the types of all of the arguments...
|
||
std::vector<const Type*> ParamTypes;
|
||
if ((yyvsp[-7].ValueList)) {
|
||
for (std::vector<Value*>::iterator I = (yyvsp[-7].ValueList)->begin(), E = (yyvsp[-7].ValueList)->end();
|
||
I != E; ++I)
|
||
ParamTypes.push_back((*I)->getType());
|
||
}
|
||
|
||
bool isVarArg = ParamTypes.size() && ParamTypes.back() == Type::VoidTy;
|
||
if (isVarArg) ParamTypes.pop_back();
|
||
|
||
Ty = FunctionType::get((yyvsp[-10].TypeVal)->get(), ParamTypes, isVarArg);
|
||
PFTy = PointerType::get(Ty);
|
||
}
|
||
|
||
Value *V = getVal(PFTy, (yyvsp[-9].ValIDVal)); // Get the function we're calling...
|
||
|
||
BasicBlock *Normal = getBBVal((yyvsp[-3].ValIDVal));
|
||
BasicBlock *Except = getBBVal((yyvsp[0].ValIDVal));
|
||
|
||
// Create the call node...
|
||
if (!(yyvsp[-7].ValueList)) { // Has no arguments?
|
||
(yyval.TermInstVal) = new InvokeInst(V, Normal, Except, std::vector<Value*>());
|
||
} 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();
|
||
std::vector<Value*>::iterator ArgI = (yyvsp[-7].ValueList)->begin(), ArgE = (yyvsp[-7].ValueList)->end();
|
||
|
||
for (; ArgI != ArgE && I != E; ++ArgI, ++I)
|
||
if ((*ArgI)->getType() != *I)
|
||
GEN_ERROR("Parameter " +(*ArgI)->getName()+ " is not of type '" +
|
||
(*I)->getDescription() + "'!");
|
||
|
||
if (I != E || (ArgI != ArgE && !Ty->isVarArg()))
|
||
GEN_ERROR("Invalid number of parameters detected!");
|
||
|
||
(yyval.TermInstVal) = new InvokeInst(V, Normal, Except, *(yyvsp[-7].ValueList));
|
||
}
|
||
cast<InvokeInst>((yyval.TermInstVal))->setCallingConv((yyvsp[-11].UIntVal));
|
||
|
||
delete (yyvsp[-10].TypeVal);
|
||
delete (yyvsp[-7].ValueList);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 199:
|
||
#line 2204 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.TermInstVal) = new UnwindInst();
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 200:
|
||
#line 2208 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.TermInstVal) = new UnreachableInst();
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 201:
|
||
#line 2215 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.JumpTable) = (yyvsp[-5].JumpTable);
|
||
Constant *V = cast<Constant>(getValNonImprovising((yyvsp[-4].PrimType), (yyvsp[-3].ValIDVal)));
|
||
if (V == 0)
|
||
GEN_ERROR("May only switch on a constant pool value!");
|
||
|
||
(yyval.JumpTable)->push_back(std::make_pair(V, getBBVal((yyvsp[0].ValIDVal))));
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 202:
|
||
#line 2224 "/proj/llvm/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)));
|
||
|
||
if (V == 0)
|
||
GEN_ERROR("May only switch on a constant pool value!");
|
||
|
||
(yyval.JumpTable)->push_back(std::make_pair(V, getBBVal((yyvsp[0].ValIDVal))));
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 203:
|
||
#line 2235 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
// Is this definition named?? if so, assign the name...
|
||
setValueName((yyvsp[0].InstVal), (yyvsp[-1].StrVal));
|
||
InsertValue((yyvsp[0].InstVal));
|
||
(yyval.InstVal) = (yyvsp[0].InstVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 204:
|
||
#line 2243 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Used for PHI nodes
|
||
(yyval.PHIList) = new std::list<std::pair<Value*, BasicBlock*> >();
|
||
(yyval.PHIList)->push_back(std::make_pair(getVal(*(yyvsp[-5].TypeVal), (yyvsp[-3].ValIDVal)), getBBVal((yyvsp[-1].ValIDVal))));
|
||
delete (yyvsp[-5].TypeVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 205:
|
||
#line 2249 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.PHIList) = (yyvsp[-6].PHIList);
|
||
(yyvsp[-6].PHIList)->push_back(std::make_pair(getVal((yyvsp[-6].PHIList)->front().first->getType(), (yyvsp[-3].ValIDVal)),
|
||
getBBVal((yyvsp[-1].ValIDVal))));
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 206:
|
||
#line 2257 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ // Used for call statements, and memory insts...
|
||
(yyval.ValueList) = new std::vector<Value*>();
|
||
(yyval.ValueList)->push_back((yyvsp[0].ValueVal));
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 207:
|
||
#line 2262 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.ValueList) = (yyvsp[-2].ValueList);
|
||
(yyvsp[-2].ValueList)->push_back((yyvsp[0].ValueVal));
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 209:
|
||
#line 2269 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{ (yyval.ValueList) = 0; ;}
|
||
break;
|
||
|
||
case 210:
|
||
#line 2271 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.BoolVal) = true;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 211:
|
||
#line 2275 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.BoolVal) = false;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 212:
|
||
#line 2282 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
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::Rem)
|
||
GEN_ERROR("Rem not supported on packed types!");
|
||
(yyval.InstVal) = BinaryOperator::create((yyvsp[-4].BinaryOpVal), getVal(*(yyvsp[-3].TypeVal), (yyvsp[-2].ValIDVal)), getVal(*(yyvsp[-3].TypeVal), (yyvsp[0].ValIDVal)));
|
||
if ((yyval.InstVal) == 0)
|
||
GEN_ERROR("binary operator returned null!");
|
||
delete (yyvsp[-3].TypeVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 213:
|
||
#line 2295 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!(*(yyvsp[-3].TypeVal))->isIntegral()) {
|
||
if (!isa<PackedType>((yyvsp[-3].TypeVal)->get()) ||
|
||
!cast<PackedType>((yyvsp[-3].TypeVal)->get())->getElementType()->isIntegral())
|
||
GEN_ERROR("Logical operator requires integral operands!");
|
||
}
|
||
(yyval.InstVal) = BinaryOperator::create((yyvsp[-4].BinaryOpVal), getVal(*(yyvsp[-3].TypeVal), (yyvsp[-2].ValIDVal)), getVal(*(yyvsp[-3].TypeVal), (yyvsp[0].ValIDVal)));
|
||
if ((yyval.InstVal) == 0)
|
||
GEN_ERROR("binary operator returned null!");
|
||
delete (yyvsp[-3].TypeVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 214:
|
||
#line 2307 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if(isa<PackedType>((*(yyvsp[-3].TypeVal)).get())) {
|
||
GEN_ERROR(
|
||
"PackedTypes currently not supported in setcc instructions!");
|
||
}
|
||
(yyval.InstVal) = new SetCondInst((yyvsp[-4].BinaryOpVal), getVal(*(yyvsp[-3].TypeVal), (yyvsp[-2].ValIDVal)), getVal(*(yyvsp[-3].TypeVal), (yyvsp[0].ValIDVal)));
|
||
if ((yyval.InstVal) == 0)
|
||
GEN_ERROR("binary operator returned null!");
|
||
delete (yyvsp[-3].TypeVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 215:
|
||
#line 2318 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
std::cerr << "WARNING: Use of eliminated 'not' instruction:"
|
||
<< " Replacing with 'xor'.\n";
|
||
|
||
Value *Ones = ConstantIntegral::getAllOnesValue((yyvsp[0].ValueVal)->getType());
|
||
if (Ones == 0)
|
||
GEN_ERROR("Expected integral type for not instruction!");
|
||
|
||
(yyval.InstVal) = BinaryOperator::create(Instruction::Xor, (yyvsp[0].ValueVal), Ones);
|
||
if ((yyval.InstVal) == 0)
|
||
GEN_ERROR("Could not create a xor instruction!");
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 216:
|
||
#line 2331 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if ((yyvsp[0].ValueVal)->getType() != Type::UByteTy)
|
||
GEN_ERROR("Shift amount must be ubyte!");
|
||
if (!(yyvsp[-2].ValueVal)->getType()->isInteger())
|
||
GEN_ERROR("Shift constant expression requires integer operand!");
|
||
(yyval.InstVal) = new ShiftInst((yyvsp[-3].OtherOpVal), (yyvsp[-2].ValueVal), (yyvsp[0].ValueVal));
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 217:
|
||
#line 2339 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!(yyvsp[0].TypeVal)->get()->isFirstClassType())
|
||
GEN_ERROR("cast instruction to a non-primitive type: '" +
|
||
(yyvsp[0].TypeVal)->get()->getDescription() + "'!");
|
||
(yyval.InstVal) = new CastInst((yyvsp[-2].ValueVal), *(yyvsp[0].TypeVal));
|
||
delete (yyvsp[0].TypeVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 218:
|
||
#line 2347 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if ((yyvsp[-4].ValueVal)->getType() != Type::BoolTy)
|
||
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 219:
|
||
#line 2355 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
NewVarArgs = true;
|
||
(yyval.InstVal) = new VAArgInst((yyvsp[-2].ValueVal), *(yyvsp[0].TypeVal));
|
||
delete (yyvsp[0].TypeVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 220:
|
||
#line 2361 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
ObsoleteVarArgs = true;
|
||
const Type* ArgTy = (yyvsp[-2].ValueVal)->getType();
|
||
Function* NF = CurModule.CurrentModule->
|
||
getOrInsertFunction("llvm.va_copy", ArgTy, ArgTy, (Type *)0);
|
||
|
||
//b = vaarg a, t ->
|
||
//foo = alloca 1 of t
|
||
//bar = vacopy a
|
||
//store bar -> foo
|
||
//b = vaarg foo, t
|
||
AllocaInst* foo = new AllocaInst(ArgTy, 0, "vaarg.fix");
|
||
CurBB->getInstList().push_back(foo);
|
||
CallInst* bar = new CallInst(NF, (yyvsp[-2].ValueVal));
|
||
CurBB->getInstList().push_back(bar);
|
||
CurBB->getInstList().push_back(new StoreInst(bar, foo));
|
||
(yyval.InstVal) = new VAArgInst(foo, *(yyvsp[0].TypeVal));
|
||
delete (yyvsp[0].TypeVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 221:
|
||
#line 2381 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
ObsoleteVarArgs = true;
|
||
const Type* ArgTy = (yyvsp[-2].ValueVal)->getType();
|
||
Function* NF = CurModule.CurrentModule->
|
||
getOrInsertFunction("llvm.va_copy", ArgTy, ArgTy, (Type *)0);
|
||
|
||
//b = vanext a, t ->
|
||
//foo = alloca 1 of t
|
||
//bar = vacopy a
|
||
//store bar -> foo
|
||
//tmp = vaarg foo, t
|
||
//b = load foo
|
||
AllocaInst* foo = new AllocaInst(ArgTy, 0, "vanext.fix");
|
||
CurBB->getInstList().push_back(foo);
|
||
CallInst* bar = new CallInst(NF, (yyvsp[-2].ValueVal));
|
||
CurBB->getInstList().push_back(bar);
|
||
CurBB->getInstList().push_back(new StoreInst(bar, foo));
|
||
Instruction* tmp = new VAArgInst(foo, *(yyvsp[0].TypeVal));
|
||
CurBB->getInstList().push_back(tmp);
|
||
(yyval.InstVal) = new LoadInst(foo);
|
||
delete (yyvsp[0].TypeVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 222:
|
||
#line 2404 "/proj/llvm/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 223:
|
||
#line 2410 "/proj/llvm/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 224:
|
||
#line 2416 "/proj/llvm/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 225:
|
||
#line 2422 "/proj/llvm/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 226:
|
||
#line 2437 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
const PointerType *PFTy;
|
||
const FunctionType *Ty;
|
||
|
||
if (!(PFTy = dyn_cast<PointerType>((yyvsp[-4].TypeVal)->get())) ||
|
||
!(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) {
|
||
// Pull out the types of all of the arguments...
|
||
std::vector<const Type*> ParamTypes;
|
||
if ((yyvsp[-1].ValueList)) {
|
||
for (std::vector<Value*>::iterator I = (yyvsp[-1].ValueList)->begin(), E = (yyvsp[-1].ValueList)->end();
|
||
I != E; ++I)
|
||
ParamTypes.push_back((*I)->getType());
|
||
}
|
||
|
||
bool isVarArg = ParamTypes.size() && ParamTypes.back() == Type::VoidTy;
|
||
if (isVarArg) ParamTypes.pop_back();
|
||
|
||
if (!(*(yyvsp[-4].TypeVal))->isFirstClassType() && *(yyvsp[-4].TypeVal) != Type::VoidTy)
|
||
GEN_ERROR("LLVM functions cannot return aggregate types!");
|
||
|
||
Ty = FunctionType::get((yyvsp[-4].TypeVal)->get(), ParamTypes, isVarArg);
|
||
PFTy = PointerType::get(Ty);
|
||
}
|
||
|
||
Value *V = getVal(PFTy, (yyvsp[-3].ValIDVal)); // Get the function we're calling...
|
||
|
||
// Create the call node...
|
||
if (!(yyvsp[-1].ValueList)) { // 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!");
|
||
|
||
(yyval.InstVal) = new CallInst(V, std::vector<Value*>());
|
||
} 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();
|
||
std::vector<Value*>::iterator ArgI = (yyvsp[-1].ValueList)->begin(), ArgE = (yyvsp[-1].ValueList)->end();
|
||
|
||
for (; ArgI != ArgE && I != E; ++ArgI, ++I)
|
||
if ((*ArgI)->getType() != *I)
|
||
GEN_ERROR("Parameter " +(*ArgI)->getName()+ " is not of type '" +
|
||
(*I)->getDescription() + "'!");
|
||
|
||
if (I != E || (ArgI != ArgE && !Ty->isVarArg()))
|
||
GEN_ERROR("Invalid number of parameters detected!");
|
||
|
||
(yyval.InstVal) = new CallInst(V, *(yyvsp[-1].ValueList));
|
||
}
|
||
cast<CallInst>((yyval.InstVal))->setTailCall((yyvsp[-6].BoolVal));
|
||
cast<CallInst>((yyval.InstVal))->setCallingConv((yyvsp[-5].UIntVal));
|
||
delete (yyvsp[-4].TypeVal);
|
||
delete (yyvsp[-1].ValueList);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 227:
|
||
#line 2495 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.InstVal) = (yyvsp[0].InstVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 228:
|
||
#line 2502 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.ValueList) = (yyvsp[0].ValueList);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 229:
|
||
#line 2505 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.ValueList) = new std::vector<Value*>();
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 230:
|
||
#line 2510 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.BoolVal) = true;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 231:
|
||
#line 2514 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.BoolVal) = false;
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 232:
|
||
#line 2521 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.InstVal) = new MallocInst(*(yyvsp[-1].TypeVal), 0, (yyvsp[0].UIntVal));
|
||
delete (yyvsp[-1].TypeVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 233:
|
||
#line 2526 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.InstVal) = new MallocInst(*(yyvsp[-4].TypeVal), getVal((yyvsp[-2].PrimType), (yyvsp[-1].ValIDVal)), (yyvsp[0].UIntVal));
|
||
delete (yyvsp[-4].TypeVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 234:
|
||
#line 2531 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.InstVal) = new AllocaInst(*(yyvsp[-1].TypeVal), 0, (yyvsp[0].UIntVal));
|
||
delete (yyvsp[-1].TypeVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 235:
|
||
#line 2536 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
(yyval.InstVal) = new AllocaInst(*(yyvsp[-4].TypeVal), getVal((yyvsp[-2].PrimType), (yyvsp[-1].ValIDVal)), (yyvsp[0].UIntVal));
|
||
delete (yyvsp[-4].TypeVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 236:
|
||
#line 2541 "/proj/llvm/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 237:
|
||
#line 2549 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
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());
|
||
(yyval.InstVal) = new LoadInst(getVal(*(yyvsp[-1].TypeVal), (yyvsp[0].ValIDVal)), "", (yyvsp[-3].BoolVal));
|
||
delete (yyvsp[-1].TypeVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 238:
|
||
#line 2560 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
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() + "'!");
|
||
|
||
(yyval.InstVal) = new StoreInst((yyvsp[-3].ValueVal), getVal(*(yyvsp[-1].TypeVal), (yyvsp[0].ValIDVal)), (yyvsp[-5].BoolVal));
|
||
delete (yyvsp[-1].TypeVal);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
case 239:
|
||
#line 2574 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
{
|
||
if (!isa<PointerType>((yyvsp[-2].TypeVal)->get()))
|
||
GEN_ERROR("getelementptr insn requires pointer operand!");
|
||
|
||
// LLVM 1.2 and earlier used ubyte struct indices. Convert any ubyte struct
|
||
// indices to uint struct indices for compatibility.
|
||
generic_gep_type_iterator<std::vector<Value*>::iterator>
|
||
GTI = gep_type_begin((yyvsp[-2].TypeVal)->get(), (yyvsp[0].ValueList)->begin(), (yyvsp[0].ValueList)->end()),
|
||
GTE = gep_type_end((yyvsp[-2].TypeVal)->get(), (yyvsp[0].ValueList)->begin(), (yyvsp[0].ValueList)->end());
|
||
for (unsigned i = 0, e = (yyvsp[0].ValueList)->size(); i != e && GTI != GTE; ++i, ++GTI)
|
||
if (isa<StructType>(*GTI)) // Only change struct indices
|
||
if (ConstantUInt *CUI = dyn_cast<ConstantUInt>((*(yyvsp[0].ValueList))[i]))
|
||
if (CUI->getType() == Type::UByteTy)
|
||
(*(yyvsp[0].ValueList))[i] = ConstantExpr::getCast(CUI, Type::UIntTy);
|
||
|
||
if (!GetElementPtrInst::getIndexedType(*(yyvsp[-2].TypeVal), *(yyvsp[0].ValueList), true))
|
||
GEN_ERROR("Invalid getelementptr indices for type '" +
|
||
(*(yyvsp[-2].TypeVal))->getDescription()+ "'!");
|
||
(yyval.InstVal) = new GetElementPtrInst(getVal(*(yyvsp[-2].TypeVal), (yyvsp[-1].ValIDVal)), *(yyvsp[0].ValueList));
|
||
delete (yyvsp[-2].TypeVal); delete (yyvsp[0].ValueList);
|
||
CHECK_FOR_ERROR
|
||
;}
|
||
break;
|
||
|
||
|
||
default: break;
|
||
}
|
||
|
||
/* Line 1126 of yacc.c. */
|
||
#line 4986 "llvmAsmParser.tab.c"
|
||
|
||
yyvsp -= yylen;
|
||
yyssp -= yylen;
|
||
|
||
|
||
YY_STACK_PRINT (yyss, yyssp);
|
||
|
||
*++yyvsp = yyval;
|
||
|
||
|
||
/* Now `shift' the result of the reduction. Determine what state
|
||
that goes to, based on the state we popped back to and the rule
|
||
number reduced by. */
|
||
|
||
yyn = yyr1[yyn];
|
||
|
||
yystate = yypgoto[yyn - YYNTOKENS] + *yyssp;
|
||
if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp)
|
||
yystate = yytable[yystate];
|
||
else
|
||
yystate = yydefgoto[yyn - YYNTOKENS];
|
||
|
||
goto yynewstate;
|
||
|
||
|
||
/*------------------------------------.
|
||
| yyerrlab -- here on detecting error |
|
||
`------------------------------------*/
|
||
yyerrlab:
|
||
/* If not already recovering from an error, report this error. */
|
||
if (!yyerrstatus)
|
||
{
|
||
++yynerrs;
|
||
#if YYERROR_VERBOSE
|
||
yyn = yypact[yystate];
|
||
|
||
if (YYPACT_NINF < yyn && yyn < YYLAST)
|
||
{
|
||
int yytype = YYTRANSLATE (yychar);
|
||
YYSIZE_T yysize0 = yytnamerr (0, yytname[yytype]);
|
||
YYSIZE_T yysize = yysize0;
|
||
YYSIZE_T yysize1;
|
||
int yysize_overflow = 0;
|
||
char *yymsg = 0;
|
||
# define YYERROR_VERBOSE_ARGS_MAXIMUM 5
|
||
char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM];
|
||
int yyx;
|
||
|
||
#if 0
|
||
/* This is so xgettext sees the translatable formats that are
|
||
constructed on the fly. */
|
||
YY_("syntax error, unexpected %s");
|
||
YY_("syntax error, unexpected %s, expecting %s");
|
||
YY_("syntax error, unexpected %s, expecting %s or %s");
|
||
YY_("syntax error, unexpected %s, expecting %s or %s or %s");
|
||
YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s");
|
||
#endif
|
||
char *yyfmt;
|
||
char const *yyf;
|
||
static char const yyunexpected[] = "syntax error, unexpected %s";
|
||
static char const yyexpecting[] = ", expecting %s";
|
||
static char const yyor[] = " or %s";
|
||
char yyformat[sizeof yyunexpected
|
||
+ sizeof yyexpecting - 1
|
||
+ ((YYERROR_VERBOSE_ARGS_MAXIMUM - 2)
|
||
* (sizeof yyor - 1))];
|
||
char const *yyprefix = yyexpecting;
|
||
|
||
/* Start YYX at -YYN if negative to avoid negative indexes in
|
||
YYCHECK. */
|
||
int yyxbegin = yyn < 0 ? -yyn : 0;
|
||
|
||
/* Stay within bounds of both yycheck and yytname. */
|
||
int yychecklim = YYLAST - yyn;
|
||
int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;
|
||
int yycount = 1;
|
||
|
||
yyarg[0] = yytname[yytype];
|
||
yyfmt = yystpcpy (yyformat, yyunexpected);
|
||
|
||
for (yyx = yyxbegin; yyx < yyxend; ++yyx)
|
||
if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
|
||
{
|
||
if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM)
|
||
{
|
||
yycount = 1;
|
||
yysize = yysize0;
|
||
yyformat[sizeof yyunexpected - 1] = '\0';
|
||
break;
|
||
}
|
||
yyarg[yycount++] = yytname[yyx];
|
||
yysize1 = yysize + yytnamerr (0, yytname[yyx]);
|
||
yysize_overflow |= yysize1 < yysize;
|
||
yysize = yysize1;
|
||
yyfmt = yystpcpy (yyfmt, yyprefix);
|
||
yyprefix = yyor;
|
||
}
|
||
|
||
yyf = YY_(yyformat);
|
||
yysize1 = yysize + yystrlen (yyf);
|
||
yysize_overflow |= yysize1 < yysize;
|
||
yysize = yysize1;
|
||
|
||
if (!yysize_overflow && yysize <= YYSTACK_ALLOC_MAXIMUM)
|
||
yymsg = (char *) YYSTACK_ALLOC (yysize);
|
||
if (yymsg)
|
||
{
|
||
/* Avoid sprintf, as that infringes on the user's name space.
|
||
Don't have undefined behavior even if the translation
|
||
produced a string with the wrong number of "%s"s. */
|
||
char *yyp = yymsg;
|
||
int yyi = 0;
|
||
while ((*yyp = *yyf))
|
||
{
|
||
if (*yyp == '%' && yyf[1] == 's' && yyi < yycount)
|
||
{
|
||
yyp += yytnamerr (yyp, yyarg[yyi++]);
|
||
yyf += 2;
|
||
}
|
||
else
|
||
{
|
||
yyp++;
|
||
yyf++;
|
||
}
|
||
}
|
||
yyerror (yymsg);
|
||
YYSTACK_FREE (yymsg);
|
||
}
|
||
else
|
||
{
|
||
yyerror (YY_("syntax error"));
|
||
goto yyexhaustedlab;
|
||
}
|
||
}
|
||
else
|
||
#endif /* YYERROR_VERBOSE */
|
||
yyerror (YY_("syntax error"));
|
||
}
|
||
|
||
|
||
|
||
if (yyerrstatus == 3)
|
||
{
|
||
/* If just tried and failed to reuse look-ahead token after an
|
||
error, discard it. */
|
||
|
||
if (yychar <= YYEOF)
|
||
{
|
||
/* Return failure if at end of input. */
|
||
if (yychar == YYEOF)
|
||
YYABORT;
|
||
}
|
||
else
|
||
{
|
||
yydestruct ("Error: discarding", yytoken, &yylval);
|
||
yychar = YYEMPTY;
|
||
}
|
||
}
|
||
|
||
/* Else will try to reuse look-ahead token after shifting the error
|
||
token. */
|
||
goto yyerrlab1;
|
||
|
||
|
||
/*---------------------------------------------------.
|
||
| yyerrorlab -- error raised explicitly by YYERROR. |
|
||
`---------------------------------------------------*/
|
||
yyerrorlab:
|
||
|
||
/* Pacify compilers like GCC when the user code never invokes
|
||
YYERROR and the label yyerrorlab therefore never appears in user
|
||
code. */
|
||
if (0)
|
||
goto yyerrorlab;
|
||
|
||
yyvsp -= yylen;
|
||
yyssp -= yylen;
|
||
yystate = *yyssp;
|
||
goto yyerrlab1;
|
||
|
||
|
||
/*-------------------------------------------------------------.
|
||
| yyerrlab1 -- common code for both syntax error and YYERROR. |
|
||
`-------------------------------------------------------------*/
|
||
yyerrlab1:
|
||
yyerrstatus = 3; /* Each real token shifted decrements this. */
|
||
|
||
for (;;)
|
||
{
|
||
yyn = yypact[yystate];
|
||
if (yyn != YYPACT_NINF)
|
||
{
|
||
yyn += YYTERROR;
|
||
if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR)
|
||
{
|
||
yyn = yytable[yyn];
|
||
if (0 < yyn)
|
||
break;
|
||
}
|
||
}
|
||
|
||
/* Pop the current state because it cannot handle the error token. */
|
||
if (yyssp == yyss)
|
||
YYABORT;
|
||
|
||
|
||
yydestruct ("Error: popping", yystos[yystate], yyvsp);
|
||
YYPOPSTACK;
|
||
yystate = *yyssp;
|
||
YY_STACK_PRINT (yyss, yyssp);
|
||
}
|
||
|
||
if (yyn == YYFINAL)
|
||
YYACCEPT;
|
||
|
||
*++yyvsp = yylval;
|
||
|
||
|
||
/* Shift the error token. */
|
||
YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp);
|
||
|
||
yystate = yyn;
|
||
goto yynewstate;
|
||
|
||
|
||
/*-------------------------------------.
|
||
| yyacceptlab -- YYACCEPT comes here. |
|
||
`-------------------------------------*/
|
||
yyacceptlab:
|
||
yyresult = 0;
|
||
goto yyreturn;
|
||
|
||
/*-----------------------------------.
|
||
| yyabortlab -- YYABORT comes here. |
|
||
`-----------------------------------*/
|
||
yyabortlab:
|
||
yyresult = 1;
|
||
goto yyreturn;
|
||
|
||
#ifndef yyoverflow
|
||
/*-------------------------------------------------.
|
||
| yyexhaustedlab -- memory exhaustion comes here. |
|
||
`-------------------------------------------------*/
|
||
yyexhaustedlab:
|
||
yyerror (YY_("memory exhausted"));
|
||
yyresult = 2;
|
||
/* Fall through. */
|
||
#endif
|
||
|
||
yyreturn:
|
||
if (yychar != YYEOF && yychar != YYEMPTY)
|
||
yydestruct ("Cleanup: discarding lookahead",
|
||
yytoken, &yylval);
|
||
while (yyssp != yyss)
|
||
{
|
||
yydestruct ("Cleanup: popping",
|
||
yystos[*yyssp], yyvsp);
|
||
YYPOPSTACK;
|
||
}
|
||
#ifndef yyoverflow
|
||
if (yyss != yyssa)
|
||
YYSTACK_FREE (yyss);
|
||
#endif
|
||
return yyresult;
|
||
}
|
||
|
||
|
||
#line 2598 "/proj/llvm/llvm/lib/AsmParser/llvmAsmParser.y"
|
||
|
||
|
||
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;
|
||
}
|
||
|