RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-24 03:33:20 +01:00
Code Issues Projects Releases Wiki Activity
ad283250fa
llvm-mirror/lib/AsmParser/llvmAsmParser.cpp.cvs
Chris Lattner ad283250fa regenerate 
llvm-svn: 33224
2007-01-15 02:12:07 +00:00

5004 lines
187 KiB
Plaintext
Raw Blame History

This file contains invisible Unicode characters

This file contains invisible Unicode characters that are indistinguishable to humans but may be processed differently by a computer. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

/* A Bison parser, made from /Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y
by GNU Bison version 1.28 */
#define YYBISON 1 /* Identify Bison output. */
#define yyparse llvmAsmparse
#define yylex llvmAsmlex
#define yyerror llvmAsmerror
#define yylval llvmAsmlval
#define yychar llvmAsmchar
#define yydebug llvmAsmdebug
#define yynerrs llvmAsmnerrs
#define ESINT64VAL 257
#define EUINT64VAL 258
#define SINTVAL 259
#define UINTVAL 260
#define FPVAL 261
#define VOID 262
#define INTTYPE 263
#define FLOAT 264
#define DOUBLE 265
#define LABEL 266
#define TYPE 267
#define VAR_ID 268
#define LABELSTR 269
#define STRINGCONSTANT 270
#define IMPLEMENTATION 271
#define ZEROINITIALIZER 272
#define TRUETOK 273
#define FALSETOK 274
#define BEGINTOK 275
#define ENDTOK 276
#define DECLARE 277
#define DEFINE 278
#define GLOBAL 279
#define CONSTANT 280
#define SECTION 281
#define VOLATILE 282
#define TO 283
#define DOTDOTDOT 284
#define NULL_TOK 285
#define UNDEF 286
#define INTERNAL 287
#define LINKONCE 288
#define WEAK 289
#define APPENDING 290
#define DLLIMPORT 291
#define DLLEXPORT 292
#define EXTERN_WEAK 293
#define OPAQUE 294
#define EXTERNAL 295
#define TARGET 296
#define TRIPLE 297
#define ENDIAN 298
#define POINTERSIZE 299
#define LITTLE 300
#define BIG 301
#define ALIGN 302
#define DEPLIBS 303
#define CALL 304
#define TAIL 305
#define ASM_TOK 306
#define MODULE 307
#define SIDEEFFECT 308
#define CC_TOK 309
#define CCC_TOK 310
#define CSRETCC_TOK 311
#define FASTCC_TOK 312
#define COLDCC_TOK 313
#define X86_STDCALLCC_TOK 314
#define X86_FASTCALLCC_TOK 315
#define DATALAYOUT 316
#define RET 317
#define BR 318
#define SWITCH 319
#define INVOKE 320
#define UNWIND 321
#define UNREACHABLE 322
#define ADD 323
#define SUB 324
#define MUL 325
#define UDIV 326
#define SDIV 327
#define FDIV 328
#define UREM 329
#define SREM 330
#define FREM 331
#define AND 332
#define OR 333
#define XOR 334
#define ICMP 335
#define FCMP 336
#define EQ 337
#define NE 338
#define SLT 339
#define SGT 340
#define SLE 341
#define SGE 342
#define ULT 343
#define UGT 344
#define ULE 345
#define UGE 346
#define OEQ 347
#define ONE 348
#define OLT 349
#define OGT 350
#define OLE 351
#define OGE 352
#define ORD 353
#define UNO 354
#define UEQ 355
#define UNE 356
#define MALLOC 357
#define ALLOCA 358
#define FREE 359
#define LOAD 360
#define STORE 361
#define GETELEMENTPTR 362
#define TRUNC 363
#define ZEXT 364
#define SEXT 365
#define FPTRUNC 366
#define FPEXT 367
#define BITCAST 368
#define UITOFP 369
#define SITOFP 370
#define FPTOUI 371
#define FPTOSI 372
#define INTTOPTR 373
#define PTRTOINT 374
#define PHI_TOK 375
#define SELECT 376
#define SHL 377
#define LSHR 378
#define ASHR 379
#define VAARG 380
#define EXTRACTELEMENT 381
#define INSERTELEMENT 382
#define SHUFFLEVECTOR 383
#define NORETURN 384
#define DEFAULT 385
#define HIDDEN 386
#line 14 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
#include "ParserInternals.h"
#include "llvm/CallingConv.h"
#include "llvm/InlineAsm.h"
#include "llvm/Instructions.h"
#include "llvm/Module.h"
#include "llvm/SymbolTable.h"
#include "llvm/Support/GetElementPtrTypeIterator.h"
#include "llvm/Support/CommandLine.h"
#include "llvm/ADT/STLExtras.h"
#include "llvm/Support/MathExtras.h"
#include "llvm/Support/Streams.h"
#include <algorithm>
#include <list>
#include <utility>
#ifndef NDEBUG
#define YYDEBUG 1
#endif
// The following is a gross hack. In order to rid the libAsmParser library of
// exceptions, we have to have a way of getting the yyparse function to go into
// an error situation. So, whenever we want an error to occur, the GenerateError
// function (see bottom of file) sets TriggerError. Then, at the end of each
// production in the grammer we use CHECK_FOR_ERROR which will invoke YYERROR
// (a goto) to put YACC in error state. Furthermore, several calls to
// GenerateError are made from inside productions and they must simulate the
// previous exception behavior by exiting the production immediately. We have
// replaced these with the GEN_ERROR macro which calls GeneratError and then
// immediately invokes YYERROR. This would be so much cleaner if it was a
// recursive descent parser.
static bool TriggerError = false;
#define CHECK_FOR_ERROR { if (TriggerError) { TriggerError = false; YYABORT; } }
#define GEN_ERROR(msg) { GenerateError(msg); YYERROR; }
int yyerror(const char *ErrorMsg); // Forward declarations to prevent "implicit
int yylex(); // declaration" of xxx warnings.
int yyparse();
namespace llvm {
std::string CurFilename;
#if YYDEBUG
static cl::opt<bool>
Debug("debug-yacc", cl::desc("Print yacc debug state changes"),
cl::Hidden, cl::init(false));
#endif
}
using namespace llvm;
static Module *ParserResult;
// DEBUG_UPREFS - Define this symbol if you want to enable debugging output
// relating to upreferences in the input stream.
//
//#define DEBUG_UPREFS 1
#ifdef DEBUG_UPREFS
#define UR_OUT(X) cerr << X
#else
#define UR_OUT(X)
#endif
#define YYERROR_VERBOSE 1
static GlobalVariable *CurGV;
// This contains info used when building the body of a function. It is
// destroyed when the function is completed.
//
typedef std::vector<Value *> ValueList; // Numbered defs
static void
ResolveDefinitions(std::map<const Type *,ValueList> &LateResolvers,
std::map<const Type *,ValueList> *FutureLateResolvers = 0);
static struct PerModuleInfo {
Module *CurrentModule;
std::map<const Type *, ValueList> Values; // Module level numbered definitions
std::map<const Type *,ValueList> LateResolveValues;
std::vector<PATypeHolder> Types;
std::map<ValID, PATypeHolder> LateResolveTypes;
/// PlaceHolderInfo - When temporary placeholder objects are created, remember
/// how they were referenced and on which line of the input they came from so
/// that we can resolve them later and print error messages as appropriate.
std::map<Value*, std::pair<ValID, int> > PlaceHolderInfo;
// GlobalRefs - This maintains a mapping between <Type, ValID>'s and forward
// references to global values. Global values may be referenced before they
// are defined, and if so, the temporary object that they represent is held
// here. This is used for forward references of GlobalValues.
//
typedef std::map<std::pair<const PointerType *,
ValID>, GlobalValue*> GlobalRefsType;
GlobalRefsType GlobalRefs;
void ModuleDone() {
// If we could not resolve some functions at function compilation time
// (calls to functions before they are defined), resolve them now... Types
// are resolved when the constant pool has been completely parsed.
//
ResolveDefinitions(LateResolveValues);
if (TriggerError)
return;
// Check to make sure that all global value forward references have been
// resolved!
//
if (!GlobalRefs.empty()) {
std::string UndefinedReferences = "Unresolved global references exist:\n";
for (GlobalRefsType::iterator I = GlobalRefs.begin(), E =GlobalRefs.end();
I != E; ++I) {
UndefinedReferences += " " + I->first.first->getDescription() + " " +
I->first.second.getName() + "\n";
}
GenerateError(UndefinedReferences);
return;
}
Values.clear(); // Clear out function local definitions
Types.clear();
CurrentModule = 0;
}
// GetForwardRefForGlobal - Check to see if there is a forward reference
// for this global. If so, remove it from the GlobalRefs map and return it.
// If not, just return null.
GlobalValue *GetForwardRefForGlobal(const PointerType *PTy, ValID ID) {
// Check to see if there is a forward reference to this global variable...
// if there is, eliminate it and patch the reference to use the new def'n.
GlobalRefsType::iterator I = GlobalRefs.find(std::make_pair(PTy, ID));
GlobalValue *Ret = 0;
if (I != GlobalRefs.end()) {
Ret = I->second;
GlobalRefs.erase(I);
}
return Ret;
}
bool TypeIsUnresolved(PATypeHolder* PATy) {
// If it isn't abstract, its resolved
const Type* Ty = PATy->get();
if (!Ty->isAbstract())
return false;
// Traverse the type looking for abstract types. If it isn't abstract then
// we don't need to traverse that leg of the type.
std::vector<const Type*> WorkList, SeenList;
WorkList.push_back(Ty);
while (!WorkList.empty()) {
const Type* Ty = WorkList.back();
SeenList.push_back(Ty);
WorkList.pop_back();
if (const OpaqueType* OpTy = dyn_cast<OpaqueType>(Ty)) {
// Check to see if this is an unresolved type
std::map<ValID, PATypeHolder>::iterator I = LateResolveTypes.begin();
std::map<ValID, PATypeHolder>::iterator E = LateResolveTypes.end();
for ( ; I != E; ++I) {
if (I->second.get() == OpTy)
return true;
}
} else if (const SequentialType* SeqTy = dyn_cast<SequentialType>(Ty)) {
const Type* TheTy = SeqTy->getElementType();
if (TheTy->isAbstract() && TheTy != Ty) {
std::vector<const Type*>::iterator I = SeenList.begin(),
E = SeenList.end();
for ( ; I != E; ++I)
if (*I == TheTy)
break;
if (I == E)
WorkList.push_back(TheTy);
}
} else if (const StructType* StrTy = dyn_cast<StructType>(Ty)) {
for (unsigned i = 0; i < StrTy->getNumElements(); ++i) {
const Type* TheTy = StrTy->getElementType(i);
if (TheTy->isAbstract() && TheTy != Ty) {
std::vector<const Type*>::iterator I = SeenList.begin(),
E = SeenList.end();
for ( ; I != E; ++I)
if (*I == TheTy)
break;
if (I == E)
WorkList.push_back(TheTy);
}
}
}
}
return false;
}
} CurModule;
static struct PerFunctionInfo {
Function *CurrentFunction; // Pointer to current function being created
std::map<const Type*, ValueList> Values; // Keep track of #'d definitions
std::map<const Type*, ValueList> LateResolveValues;
bool isDeclare; // Is this function a forward declararation?
GlobalValue::LinkageTypes Linkage; // Linkage for forward declaration.
GlobalValue::VisibilityTypes Visibility;
/// BBForwardRefs - When we see forward references to basic blocks, keep
/// track of them here.
std::map<BasicBlock*, std::pair<ValID, int> > BBForwardRefs;
std::vector<BasicBlock*> NumberedBlocks;
unsigned NextBBNum;
inline PerFunctionInfo() {
CurrentFunction = 0;
isDeclare = false;
Linkage = GlobalValue::ExternalLinkage;
Visibility = GlobalValue::DefaultVisibility;
}
inline void FunctionStart(Function *M) {
CurrentFunction = M;
NextBBNum = 0;
}
void FunctionDone() {
NumberedBlocks.clear();
// Any forward referenced blocks left?
if (!BBForwardRefs.empty()) {
GenerateError("Undefined reference to label " +
BBForwardRefs.begin()->first->getName());
return;
}
// Resolve all forward references now.
ResolveDefinitions(LateResolveValues, &CurModule.LateResolveValues);
Values.clear(); // Clear out function local definitions
CurrentFunction = 0;
isDeclare = false;
Linkage = GlobalValue::ExternalLinkage;
Visibility = GlobalValue::DefaultVisibility;
}
} CurFun; // Info for the current function...
static bool inFunctionScope() { return CurFun.CurrentFunction != 0; }
//===----------------------------------------------------------------------===//
// Code to handle definitions of all the types
//===----------------------------------------------------------------------===//
static int InsertValue(Value *V,
std::map<const Type*,ValueList> &ValueTab = CurFun.Values) {
if (V->hasName()) return -1; // Is this a numbered definition?
// Yes, insert the value into the value table...
ValueList &List = ValueTab[V->getType()];
List.push_back(V);
return List.size()-1;
}
static const Type *getTypeVal(const ValID &D, bool DoNotImprovise = false) {
switch (D.Type) {
case ValID::NumberVal: // Is it a numbered definition?
// Module constants occupy the lowest numbered slots...
if ((unsigned)D.Num < CurModule.Types.size())
return CurModule.Types[(unsigned)D.Num];
break;
case ValID::NameVal: // Is it a named definition?
if (const Type *N = CurModule.CurrentModule->getTypeByName(D.Name)) {
D.destroy(); // Free old strdup'd memory...
return N;
}
break;
default:
GenerateError("Internal parser error: Invalid symbol type reference!");
return 0;
}
// If we reached here, we referenced either a symbol that we don't know about
// or an id number that hasn't been read yet. We may be referencing something
// forward, so just create an entry to be resolved later and get to it...
//
if (DoNotImprovise) return 0; // Do we just want a null to be returned?
if (inFunctionScope()) {
if (D.Type == ValID::NameVal) {
GenerateError("Reference to an undefined type: '" + D.getName() + "'");
return 0;
} else {
GenerateError("Reference to an undefined type: #" + itostr(D.Num));
return 0;
}
}
std::map<ValID, PATypeHolder>::iterator I =CurModule.LateResolveTypes.find(D);
if (I != CurModule.LateResolveTypes.end())
return I->second;
Type *Typ = OpaqueType::get();
CurModule.LateResolveTypes.insert(std::make_pair(D, Typ));
return Typ;
}
static Value *lookupInSymbolTable(const Type *Ty, const std::string &Name) {
SymbolTable &SymTab =
inFunctionScope() ? CurFun.CurrentFunction->getValueSymbolTable() :
CurModule.CurrentModule->getValueSymbolTable();
return SymTab.lookup(Ty, Name);
}
// getValNonImprovising - Look up the value specified by the provided type and
// the provided ValID. If the value exists and has already been defined, return
// it. Otherwise return null.
//
static Value *getValNonImprovising(const Type *Ty, const ValID &D) {
if (isa<FunctionType>(Ty)) {
GenerateError("Functions are not values and "
"must be referenced as pointers");
return 0;
}
switch (D.Type) {
case ValID::NumberVal: { // Is it a numbered definition?
unsigned Num = (unsigned)D.Num;
// Module constants occupy the lowest numbered slots...
std::map<const Type*,ValueList>::iterator VI = CurModule.Values.find(Ty);
if (VI != CurModule.Values.end()) {
if (Num < VI->second.size())
return VI->second[Num];
Num -= VI->second.size();
}
// Make sure that our type is within bounds
VI = CurFun.Values.find(Ty);
if (VI == CurFun.Values.end()) return 0;
// Check that the number is within bounds...
if (VI->second.size() <= Num) return 0;
return VI->second[Num];
}
case ValID::NameVal: { // Is it a named definition?
Value *N = lookupInSymbolTable(Ty, std::string(D.Name));
if (N == 0) return 0;
D.destroy(); // Free old strdup'd memory...
return N;
}
// Check to make sure that "Ty" is an integral type, and that our
// value will fit into the specified type...
case ValID::ConstSIntVal: // Is it a constant pool reference??
if (!ConstantInt::isValueValidForType(Ty, D.ConstPool64)) {
GenerateError("Signed integral constant '" +
itostr(D.ConstPool64) + "' is invalid for type '" +
Ty->getDescription() + "'!");
return 0;
}
return ConstantInt::get(Ty, D.ConstPool64);
case ValID::ConstUIntVal: // Is it an unsigned const pool reference?
if (!ConstantInt::isValueValidForType(Ty, D.UConstPool64)) {
if (!ConstantInt::isValueValidForType(Ty, D.ConstPool64)) {
GenerateError("Integral constant '" + utostr(D.UConstPool64) +
"' is invalid or out of range!");
return 0;
} else { // This is really a signed reference. Transmogrify.
return ConstantInt::get(Ty, D.ConstPool64);
}
} else {
return ConstantInt::get(Ty, D.UConstPool64);
}
case ValID::ConstFPVal: // Is it a floating point const pool reference?
if (!ConstantFP::isValueValidForType(Ty, D.ConstPoolFP)) {
GenerateError("FP constant invalid for type!!");
return 0;
}
return ConstantFP::get(Ty, D.ConstPoolFP);
case ValID::ConstNullVal: // Is it a null value?
if (!isa<PointerType>(Ty)) {
GenerateError("Cannot create a a non pointer null!");
return 0;
}
return ConstantPointerNull::get(cast<PointerType>(Ty));
case ValID::ConstUndefVal: // Is it an undef value?
return UndefValue::get(Ty);
case ValID::ConstZeroVal: // Is it a zero value?
return Constant::getNullValue(Ty);
case ValID::ConstantVal: // Fully resolved constant?
if (D.ConstantValue->getType() != Ty) {
GenerateError("Constant expression type different from required type!");
return 0;
}
return D.ConstantValue;
case ValID::InlineAsmVal: { // Inline asm expression
const PointerType *PTy = dyn_cast<PointerType>(Ty);
const FunctionType *FTy =
PTy ? dyn_cast<FunctionType>(PTy->getElementType()) : 0;
if (!FTy || !InlineAsm::Verify(FTy, D.IAD->Constraints)) {
GenerateError("Invalid type for asm constraint string!");
return 0;
}
InlineAsm *IA = InlineAsm::get(FTy, D.IAD->AsmString, D.IAD->Constraints,
D.IAD->HasSideEffects);
D.destroy(); // Free InlineAsmDescriptor.
return IA;
}
default:
assert(0 && "Unhandled case!");
return 0;
} // End of switch
assert(0 && "Unhandled case!");
return 0;
}
// getVal - This function is identical to getValNonImprovising, except that if a
// value is not already defined, it "improvises" by creating a placeholder var
// that looks and acts just like the requested variable. When the value is
// defined later, all uses of the placeholder variable are replaced with the
// real thing.
//
static Value *getVal(const Type *Ty, const ValID &ID) {
if (Ty == Type::LabelTy) {
GenerateError("Cannot use a basic block here");
return 0;
}
// See if the value has already been defined.
Value *V = getValNonImprovising(Ty, ID);
if (V) return V;
if (TriggerError) return 0;
if (!Ty->isFirstClassType() && !isa<OpaqueType>(Ty)) {
GenerateError("Invalid use of a composite type!");
return 0;
}
// If we reached here, we referenced either a symbol that we don't know about
// or an id number that hasn't been read yet. We may be referencing something
// forward, so just create an entry to be resolved later and get to it...
//
V = new Argument(Ty);
// Remember where this forward reference came from. FIXME, shouldn't we try
// to recycle these things??
CurModule.PlaceHolderInfo.insert(std::make_pair(V, std::make_pair(ID,
llvmAsmlineno)));
if (inFunctionScope())
InsertValue(V, CurFun.LateResolveValues);
else
InsertValue(V, CurModule.LateResolveValues);
return V;
}
/// getBBVal - This is used for two purposes:
/// * If isDefinition is true, a new basic block with the specified ID is being
/// defined.
/// * If isDefinition is true, this is a reference to a basic block, which may
/// or may not be a forward reference.
///
static BasicBlock *getBBVal(const ValID &ID, bool isDefinition = false) {
assert(inFunctionScope() && "Can't get basic block at global scope!");
std::string Name;
BasicBlock *BB = 0;
switch (ID.Type) {
default:
GenerateError("Illegal label reference " + ID.getName());
return 0;
case ValID::NumberVal: // Is it a numbered definition?
if (unsigned(ID.Num) >= CurFun.NumberedBlocks.size())
CurFun.NumberedBlocks.resize(ID.Num+1);
BB = CurFun.NumberedBlocks[ID.Num];
break;
case ValID::NameVal: // Is it a named definition?
Name = ID.Name;
if (Value *N = CurFun.CurrentFunction->
getValueSymbolTable().lookup(Type::LabelTy, Name))
BB = cast<BasicBlock>(N);
break;
}
// See if the block has already been defined.
if (BB) {
// If this is the definition of the block, make sure the existing value was
// just a forward reference. If it was a forward reference, there will be
// an entry for it in the PlaceHolderInfo map.
if (isDefinition && !CurFun.BBForwardRefs.erase(BB)) {
// The existing value was a definition, not a forward reference.
GenerateError("Redefinition of label " + ID.getName());
return 0;
}
ID.destroy(); // Free strdup'd memory.
return BB;
}
// Otherwise this block has not been seen before.
BB = new BasicBlock("", CurFun.CurrentFunction);
if (ID.Type == ValID::NameVal) {
BB->setName(ID.Name);
} else {
CurFun.NumberedBlocks[ID.Num] = BB;
}
// If this is not a definition, keep track of it so we can use it as a forward
// reference.
if (!isDefinition) {
// Remember where this forward reference came from.
CurFun.BBForwardRefs[BB] = std::make_pair(ID, llvmAsmlineno);
} else {
// The forward declaration could have been inserted anywhere in the
// function: insert it into the correct place now.
CurFun.CurrentFunction->getBasicBlockList().remove(BB);
CurFun.CurrentFunction->getBasicBlockList().push_back(BB);
}
ID.destroy();
return BB;
}
//===----------------------------------------------------------------------===//
// Code to handle forward references in instructions
//===----------------------------------------------------------------------===//
//
// This code handles the late binding needed with statements that reference
// values not defined yet... for example, a forward branch, or the PHI node for
// a loop body.
//
// This keeps a table (CurFun.LateResolveValues) of all such forward references
// and back patchs after we are done.
//
// ResolveDefinitions - If we could not resolve some defs at parsing
// time (forward branches, phi functions for loops, etc...) resolve the
// defs now...
//
static void
ResolveDefinitions(std::map<const Type*,ValueList> &LateResolvers,
std::map<const Type*,ValueList> *FutureLateResolvers) {
// Loop over LateResolveDefs fixing up stuff that couldn't be resolved
for (std::map<const Type*,ValueList>::iterator LRI = LateResolvers.begin(),
E = LateResolvers.end(); LRI != E; ++LRI) {
ValueList &List = LRI->second;
while (!List.empty()) {
Value *V = List.back();
List.pop_back();
std::map<Value*, std::pair<ValID, int> >::iterator PHI =
CurModule.PlaceHolderInfo.find(V);
assert(PHI != CurModule.PlaceHolderInfo.end() && "Placeholder error!");
ValID &DID = PHI->second.first;
Value *TheRealValue = getValNonImprovising(LRI->first, DID);
if (TriggerError)
return;
if (TheRealValue) {
V->replaceAllUsesWith(TheRealValue);
delete V;
CurModule.PlaceHolderInfo.erase(PHI);
} else if (FutureLateResolvers) {
// Functions have their unresolved items forwarded to the module late
// resolver table
InsertValue(V, *FutureLateResolvers);
} else {
if (DID.Type == ValID::NameVal) {
GenerateError("Reference to an invalid definition: '" +DID.getName()+
"' of type '" + V->getType()->getDescription() + "'",
PHI->second.second);
return;
} else {
GenerateError("Reference to an invalid definition: #" +
itostr(DID.Num) + " of type '" +
V->getType()->getDescription() + "'",
PHI->second.second);
return;
}
}
}
}
LateResolvers.clear();
}
// ResolveTypeTo - A brand new type was just declared. This means that (if
// name is not null) things referencing Name can be resolved. Otherwise, things
// refering to the number can be resolved. Do this now.
//
static void ResolveTypeTo(char *Name, const Type *ToTy) {
ValID D;
if (Name) D = ValID::create(Name);
else D = ValID::create((int)CurModule.Types.size());
std::map<ValID, PATypeHolder>::iterator I =
CurModule.LateResolveTypes.find(D);
if (I != CurModule.LateResolveTypes.end()) {
((DerivedType*)I->second.get())->refineAbstractTypeTo(ToTy);
CurModule.LateResolveTypes.erase(I);
}
}
// setValueName - Set the specified value to the name given. The name may be
// null potentially, in which case this is a noop. The string passed in is
// assumed to be a malloc'd string buffer, and is free'd by this function.
//
static void setValueName(Value *V, char *NameStr) {
if (NameStr) {
std::string Name(NameStr); // Copy string
free(NameStr); // Free old string
if (V->getType() == Type::VoidTy) {
GenerateError("Can't assign name '" + Name+"' to value with void type!");
return;
}
assert(inFunctionScope() && "Must be in function scope!");
SymbolTable &ST = CurFun.CurrentFunction->getValueSymbolTable();
if (ST.lookup(V->getType(), Name)) {
GenerateError("Redefinition of value '" + Name + "' of type '" +
V->getType()->getDescription() + "'!");
return;
}
// Set the name.
V->setName(Name);
}
}
/// ParseGlobalVariable - Handle parsing of a global. If Initializer is null,
/// this is a declaration, otherwise it is a definition.
static GlobalVariable *
ParseGlobalVariable(char *NameStr,
GlobalValue::LinkageTypes Linkage,
GlobalValue::VisibilityTypes Visibility,
bool isConstantGlobal, const Type *Ty,
Constant *Initializer) {
if (isa<FunctionType>(Ty)) {
GenerateError("Cannot declare global vars of function type!");
return 0;
}
const PointerType *PTy = PointerType::get(Ty);
std::string Name;
if (NameStr) {
Name = NameStr; // Copy string
free(NameStr); // Free old string
}
// See if this global value was forward referenced. If so, recycle the
// object.
ValID ID;
if (!Name.empty()) {
ID = ValID::create((char*)Name.c_str());
} else {
ID = ValID::create((int)CurModule.Values[PTy].size());
}
if (GlobalValue *FWGV = CurModule.GetForwardRefForGlobal(PTy, ID)) {
// Move the global to the end of the list, from whereever it was
// previously inserted.
GlobalVariable *GV = cast<GlobalVariable>(FWGV);
CurModule.CurrentModule->getGlobalList().remove(GV);
CurModule.CurrentModule->getGlobalList().push_back(GV);
GV->setInitializer(Initializer);
GV->setLinkage(Linkage);
GV->setVisibility(Visibility);
GV->setConstant(isConstantGlobal);
InsertValue(GV, CurModule.Values);
return GV;
}
// If this global has a name, check to see if there is already a definition
// of this global in the module. If so, it is an error.
if (!Name.empty()) {
// We are a simple redefinition of a value, check to see if it is defined
// the same as the old one.
if (CurModule.CurrentModule->getGlobalVariable(Name, Ty)) {
GenerateError("Redefinition of global variable named '" + Name +
"' of type '" + Ty->getDescription() + "'!");
return 0;
}
}
// Otherwise there is no existing GV to use, create one now.
GlobalVariable *GV =
new GlobalVariable(Ty, isConstantGlobal, Linkage, Initializer, Name,
CurModule.CurrentModule);
GV->setVisibility(Visibility);
InsertValue(GV, CurModule.Values);
return GV;
}
// setTypeName - Set the specified type to the name given. The name may be
// null potentially, in which case this is a noop. The string passed in is
// assumed to be a malloc'd string buffer, and is freed by this function.
//
// This function returns true if the type has already been defined, but is
// allowed to be redefined in the specified context. If the name is a new name
// for the type plane, it is inserted and false is returned.
static bool setTypeName(const Type *T, char *NameStr) {
assert(!inFunctionScope() && "Can't give types function-local names!");
if (NameStr == 0) return false;
std::string Name(NameStr); // Copy string
free(NameStr); // Free old string
// We don't allow assigning names to void type
if (T == Type::VoidTy) {
GenerateError("Can't assign name '" + Name + "' to the void type!");
return false;
}
// Set the type name, checking for conflicts as we do so.
bool AlreadyExists = CurModule.CurrentModule->addTypeName(Name, T);
if (AlreadyExists) { // Inserting a name that is already defined???
const Type *Existing = CurModule.CurrentModule->getTypeByName(Name);
assert(Existing && "Conflict but no matching type?");
// There is only one case where this is allowed: when we are refining an
// opaque type. In this case, Existing will be an opaque type.
if (const OpaqueType *OpTy = dyn_cast<OpaqueType>(Existing)) {
// We ARE replacing an opaque type!
const_cast<OpaqueType*>(OpTy)->refineAbstractTypeTo(T);
return true;
}
// Otherwise, this is an attempt to redefine a type. That's okay if
// the redefinition is identical to the original. This will be so if
// Existing and T point to the same Type object. In this one case we
// allow the equivalent redefinition.
if (Existing == T) return true; // Yes, it's equal.
// Any other kind of (non-equivalent) redefinition is an error.
GenerateError("Redefinition of type named '" + Name + "' of type '" +
T->getDescription() + "'!");
}
return false;
}
//===----------------------------------------------------------------------===//
// Code for handling upreferences in type names...
//
// TypeContains - Returns true if Ty directly contains E in it.
//
static bool TypeContains(const Type *Ty, const Type *E) {
return std::find(Ty->subtype_begin(), Ty->subtype_end(),
E) != Ty->subtype_end();
}
namespace {
struct UpRefRecord {
// NestingLevel - The number of nesting levels that need to be popped before
// this type is resolved.
unsigned NestingLevel;
// LastContainedTy - This is the type at the current binding level for the
// type. Every time we reduce the nesting level, this gets updated.
const Type *LastContainedTy;
// UpRefTy - This is the actual opaque type that the upreference is
// represented with.
OpaqueType *UpRefTy;
UpRefRecord(unsigned NL, OpaqueType *URTy)
: NestingLevel(NL), LastContainedTy(URTy), UpRefTy(URTy) {}
};
}
// UpRefs - A list of the outstanding upreferences that need to be resolved.
static std::vector<UpRefRecord> UpRefs;
/// HandleUpRefs - Every time we finish a new layer of types, this function is
/// called. It loops through the UpRefs vector, which is a list of the
/// currently active types. For each type, if the up reference is contained in
/// the newly completed type, we decrement the level count. When the level
/// count reaches zero, the upreferenced type is the type that is passed in:
/// thus we can complete the cycle.
///
static PATypeHolder HandleUpRefs(const Type *ty) {
// If Ty isn't abstract, or if there are no up-references in it, then there is
// nothing to resolve here.
if (!ty->isAbstract() || UpRefs.empty()) return ty;
PATypeHolder Ty(ty);
UR_OUT("Type '" << Ty->getDescription() <<
"' newly formed. Resolving upreferences.\n" <<
UpRefs.size() << " upreferences active!\n");
// If we find any resolvable upreferences (i.e., those whose NestingLevel goes
// to zero), we resolve them all together before we resolve them to Ty. At
// the end of the loop, if there is anything to resolve to Ty, it will be in
// this variable.
OpaqueType *TypeToResolve = 0;
for (unsigned i = 0; i != UpRefs.size(); ++i) {
UR_OUT(" UR#" << i << " - TypeContains(" << Ty->getDescription() << ", "
<< UpRefs[i].second->getDescription() << ") = "
<< (TypeContains(Ty, UpRefs[i].second) ? "true" : "false") << "\n");
if (TypeContains(Ty, UpRefs[i].LastContainedTy)) {
// Decrement level of upreference
unsigned Level = --UpRefs[i].NestingLevel;
UpRefs[i].LastContainedTy = Ty;
UR_OUT(" Uplevel Ref Level = " << Level << "\n");
if (Level == 0) { // Upreference should be resolved!
if (!TypeToResolve) {
TypeToResolve = UpRefs[i].UpRefTy;
} else {
UR_OUT(" * Resolving upreference for "
<< UpRefs[i].second->getDescription() << "\n";
std::string OldName = UpRefs[i].UpRefTy->getDescription());
UpRefs[i].UpRefTy->refineAbstractTypeTo(TypeToResolve);
UR_OUT(" * Type '" << OldName << "' refined upreference to: "
<< (const void*)Ty << ", " << Ty->getDescription() << "\n");
}
UpRefs.erase(UpRefs.begin()+i); // Remove from upreference list...
--i; // Do not skip the next element...
}
}
}
if (TypeToResolve) {
UR_OUT(" * Resolving upreference for "
<< UpRefs[i].second->getDescription() << "\n";
std::string OldName = TypeToResolve->getDescription());
TypeToResolve->refineAbstractTypeTo(Ty);
}
return Ty;
}
//===----------------------------------------------------------------------===//
// RunVMAsmParser - Define an interface to this parser
//===----------------------------------------------------------------------===//
//
static Module* RunParser(Module * M);
Module *llvm::RunVMAsmParser(const std::string &Filename, FILE *F) {
set_scan_file(F);
CurFilename = Filename;
return RunParser(new Module(CurFilename));
}
Module *llvm::RunVMAsmParser(const char * AsmString, Module * M) {
set_scan_string(AsmString);
CurFilename = "from_memory";
if (M == NULL) {
return RunParser(new Module (CurFilename));
} else {
return RunParser(M);
}
}
#line 883 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
typedef union {
llvm::Module *ModuleVal;
llvm::Function *FunctionVal;
llvm::BasicBlock *BasicBlockVal;
llvm::TerminatorInst *TermInstVal;
llvm::Instruction *InstVal;
llvm::Constant *ConstVal;
const llvm::Type *PrimType;
std::list<llvm::PATypeHolder> *TypeList;
llvm::PATypeHolder *TypeVal;
llvm::Value *ValueVal;
std::vector<llvm::Value*> *ValueList;
llvm::ArgListType *ArgList;
llvm::TypeWithAttrs TypeWithAttrs;
llvm::TypeWithAttrsList *TypeWithAttrsList;
llvm::ValueRefList *ValueRefList;
// Represent the RHS of PHI node
std::list<std::pair<llvm::Value*,
llvm::BasicBlock*> > *PHIList;
std::vector<std::pair<llvm::Constant*, llvm::BasicBlock*> > *JumpTable;
std::vector<llvm::Constant*> *ConstVector;
llvm::GlobalValue::LinkageTypes Linkage;
llvm::GlobalValue::VisibilityTypes Visibility;
llvm::FunctionType::ParameterAttributes ParamAttrs;
int64_t SInt64Val;
uint64_t UInt64Val;
int SIntVal;
unsigned UIntVal;
double FPVal;
bool BoolVal;
char *StrVal; // This memory is strdup'd!
llvm::ValID ValIDVal; // strdup'd memory maybe!
llvm::Instruction::BinaryOps BinaryOpVal;
llvm::Instruction::TermOps TermOpVal;
llvm::Instruction::MemoryOps MemOpVal;
llvm::Instruction::CastOps CastOpVal;
llvm::Instruction::OtherOps OtherOpVal;
llvm::Module::Endianness Endianness;
llvm::ICmpInst::Predicate IPredicate;
llvm::FCmpInst::Predicate FPredicate;
} YYSTYPE;
#include <stdio.h>
#ifndef __cplusplus
#ifndef __STDC__
#define const
#endif
#endif
#define YYFINAL 569
#define YYFLAG -32768
#define YYNTBASE 147
#define YYTRANSLATE(x) ((unsigned)(x) <= 386 ? yytranslate[x] : 225)
static const short yytranslate[] = { 0,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 137,
138, 135, 2, 134, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 142,
133, 143, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
139, 136, 141, 2, 2, 2, 2, 2, 146, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 140,
2, 2, 144, 2, 145, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 1, 3, 4, 5, 6,
7, 8, 9, 10, 11, 12, 13, 14, 15, 16,
17, 18, 19, 20, 21, 22, 23, 24, 25, 26,
27, 28, 29, 30, 31, 32, 33, 34, 35, 36,
37, 38, 39, 40, 41, 42, 43, 44, 45, 46,
47, 48, 49, 50, 51, 52, 53, 54, 55, 56,
57, 58, 59, 60, 61, 62, 63, 64, 65, 66,
67, 68, 69, 70, 71, 72, 73, 74, 75, 76,
77, 78, 79, 80, 81, 82, 83, 84, 85, 86,
87, 88, 89, 90, 91, 92, 93, 94, 95, 96,
97, 98, 99, 100, 101, 102, 103, 104, 105, 106,
107, 108, 109, 110, 111, 112, 113, 114, 115, 116,
117, 118, 119, 120, 121, 122, 123, 124, 125, 126,
127, 128, 129, 130, 131, 132
};
#if YYDEBUG != 0
static const short yyprhs[] = { 0,
0, 2, 4, 6, 8, 10, 12, 14, 16, 18,
20, 22, 24, 26, 28, 30, 32, 34, 36, 38,
40, 42, 44, 46, 48, 50, 52, 54, 56, 58,
60, 62, 64, 66, 68, 70, 72, 74, 76, 78,
80, 82, 84, 86, 88, 90, 92, 94, 96, 98,
100, 102, 104, 106, 108, 110, 112, 114, 116, 119,
120, 122, 124, 126, 128, 130, 132, 134, 136, 137,
139, 140, 142, 144, 145, 147, 149, 151, 153, 154,
156, 158, 160, 162, 164, 166, 169, 171, 173, 174,
177, 179, 181, 182, 185, 186, 189, 190, 194, 197,
198, 200, 201, 205, 207, 210, 212, 214, 216, 218,
220, 222, 225, 227, 230, 236, 242, 248, 254, 258,
261, 267, 272, 275, 277, 279, 281, 285, 287, 291,
293, 294, 296, 300, 305, 309, 313, 318, 323, 327,
334, 340, 343, 346, 349, 352, 355, 358, 361, 364,
367, 370, 377, 383, 392, 399, 406, 414, 422, 429,
436, 445, 454, 458, 460, 462, 464, 466, 467, 469,
472, 473, 477, 478, 482, 486, 488, 492, 496, 497,
504, 505, 513, 514, 522, 525, 529, 531, 533, 535,
539, 543, 547, 551, 555, 559, 561, 562, 564, 566,
568, 569, 575, 579, 581, 585, 587, 588, 598, 600,
602, 607, 609, 611, 614, 618, 619, 621, 623, 625,
627, 629, 631, 633, 635, 637, 641, 643, 649, 651,
653, 655, 657, 660, 663, 666, 670, 673, 674, 676,
679, 682, 686, 696, 706, 715, 730, 732, 734, 741,
747, 750, 757, 765, 769, 775, 776, 777, 781, 784,
786, 792, 798, 805, 812, 817, 822, 829, 834, 839,
846, 853, 856, 865, 867, 869, 870, 874, 881, 885,
892, 895, 900, 907
};
static const short yyrhs[] = { 5,
0, 6, 0, 69, 0, 70, 0, 71, 0, 72,
0, 73, 0, 74, 0, 75, 0, 76, 0, 77,
0, 78, 0, 79, 0, 80, 0, 109, 0, 110,
0, 111, 0, 112, 0, 113, 0, 114, 0, 115,
0, 116, 0, 117, 0, 118, 0, 119, 0, 120,
0, 123, 0, 124, 0, 125, 0, 83, 0, 84,
0, 85, 0, 86, 0, 87, 0, 88, 0, 89,
0, 90, 0, 91, 0, 92, 0, 93, 0, 94,
0, 95, 0, 96, 0, 97, 0, 98, 0, 99,
0, 100, 0, 101, 0, 102, 0, 89, 0, 90,
0, 91, 0, 92, 0, 19, 0, 20, 0, 9,
0, 10, 0, 11, 0, 197, 133, 0, 0, 33,
0, 35, 0, 34, 0, 36, 0, 38, 0, 37,
0, 39, 0, 41, 0, 0, 132, 0, 0, 37,
0, 39, 0, 0, 33, 0, 34, 0, 35, 0,
38, 0, 0, 56, 0, 57, 0, 58, 0, 59,
0, 60, 0, 61, 0, 55, 4, 0, 110, 0,
111, 0, 0, 164, 163, 0, 130, 0, 163, 0,
0, 166, 165, 0, 0, 48, 4, 0, 0, 134,
48, 4, 0, 27, 16, 0, 0, 169, 0, 0,
134, 172, 171, 0, 169, 0, 48, 4, 0, 9,
0, 10, 0, 11, 0, 12, 0, 40, 0, 173,
0, 174, 135, 0, 209, 0, 136, 4, 0, 174,
137, 178, 138, 166, 0, 8, 137, 178, 138, 166,
0, 139, 4, 140, 174, 141, 0, 142, 4, 140,
174, 143, 0, 144, 179, 145, 0, 144, 145, 0,
142, 144, 179, 145, 143, 0, 142, 144, 145, 143,
0, 174, 164, 0, 174, 0, 8, 0, 175, 0,
177, 134, 175, 0, 177, 0, 177, 134, 30, 0,
30, 0, 0, 174, 0, 179, 134, 174, 0, 174,
139, 182, 141, 0, 174, 139, 141, 0, 174, 146,
16, 0, 174, 142, 182, 143, 0, 174, 144, 182,
145, 0, 174, 144, 145, 0, 174, 142, 144, 182,
145, 143, 0, 174, 142, 144, 145, 143, 0, 174,
31, 0, 174, 32, 0, 174, 209, 0, 174, 181,
0, 174, 18, 0, 154, 3, 0, 154, 4, 0,
9, 19, 0, 9, 20, 0, 155, 7, 0, 150,
137, 180, 29, 174, 138, 0, 108, 137, 180, 220,
138, 0, 122, 137, 180, 134, 180, 134, 180, 138,
0, 148, 137, 180, 134, 180, 138, 0, 149, 137,
180, 134, 180, 138, 0, 81, 152, 137, 180, 134,
180, 138, 0, 82, 153, 137, 180, 134, 180, 138,
0, 151, 137, 180, 134, 180, 138, 0, 127, 137,
180, 134, 180, 138, 0, 128, 137, 180, 134, 180,
134, 180, 138, 0, 129, 137, 180, 134, 180, 134,
180, 138, 0, 182, 134, 180, 0, 180, 0, 25,
0, 26, 0, 185, 0, 0, 186, 0, 185, 186,
0, 0, 24, 187, 205, 0, 0, 23, 188, 206,
0, 53, 52, 192, 0, 17, 0, 156, 13, 174,
0, 156, 13, 8, 0, 0, 156, 159, 183, 180,
189, 171, 0, 0, 156, 157, 159, 183, 180, 190,
171, 0, 0, 156, 158, 159, 183, 174, 191, 171,
0, 42, 194, 0, 49, 133, 195, 0, 16, 0,
47, 0, 46, 0, 44, 133, 193, 0, 45, 133,
4, 0, 43, 133, 16, 0, 62, 133, 16, 0,
139, 196, 141, 0, 196, 134, 16, 0, 16, 0,
0, 14, 0, 16, 0, 197, 0, 0, 199, 134,
174, 164, 198, 0, 174, 164, 198, 0, 199, 0,
199, 134, 30, 0, 30, 0, 0, 162, 176, 197,
137, 200, 138, 166, 170, 167, 0, 21, 0, 144,
0, 161, 159, 201, 202, 0, 22, 0, 145, 0,
212, 204, 0, 160, 159, 201, 0, 0, 54, 0,
3, 0, 4, 0, 7, 0, 19, 0, 20, 0,
31, 0, 32, 0, 18, 0, 142, 182, 143, 0,
181, 0, 52, 207, 16, 134, 16, 0, 147, 0,
197, 0, 209, 0, 208, 0, 174, 210, 0, 212,
213, 0, 203, 213, 0, 214, 156, 215, 0, 214,
217, 0, 0, 15, 0, 63, 211, 0, 63, 8,
0, 64, 12, 210, 0, 64, 9, 210, 134, 12,
210, 134, 12, 210, 0, 65, 154, 210, 134, 12,
210, 139, 216, 141, 0, 65, 154, 210, 134, 12,
210, 139, 141, 0, 66, 162, 176, 210, 137, 219,
138, 166, 29, 12, 210, 67, 12, 210, 0, 67,
0, 68, 0, 216, 154, 208, 134, 12, 210, 0,
154, 208, 134, 12, 210, 0, 156, 222, 0, 174,
139, 210, 134, 210, 141, 0, 218, 134, 139, 210,
134, 210, 141, 0, 174, 210, 164, 0, 219, 134,
174, 210, 164, 0, 0, 0, 220, 134, 211, 0,
51, 50, 0, 50, 0, 148, 174, 210, 134, 210,
0, 149, 174, 210, 134, 210, 0, 81, 152, 174,
210, 134, 210, 0, 82, 153, 174, 210, 134, 210,
0, 151, 211, 134, 211, 0, 150, 211, 29, 174,
0, 122, 211, 134, 211, 134, 211, 0, 126, 211,
134, 174, 0, 127, 211, 134, 211, 0, 128, 211,
134, 211, 134, 211, 0, 129, 211, 134, 211, 134,
211, 0, 121, 218, 0, 221, 162, 176, 210, 137,
219, 138, 166, 0, 224, 0, 28, 0, 0, 103,
174, 168, 0, 103, 174, 134, 9, 210, 168, 0,
104, 174, 168, 0, 104, 174, 134, 9, 210, 168,
0, 105, 211, 0, 223, 106, 174, 210, 0, 223,
107, 211, 134, 174, 210, 0, 108, 174, 210, 220,
0
};
#endif
#if YYDEBUG != 0
static const short yyrline[] = { 0,
1031, 1032, 1042, 1042, 1042, 1042, 1042, 1042, 1042, 1042,
1042, 1043, 1043, 1043, 1044, 1044, 1044, 1044, 1044, 1044,
1044, 1045, 1045, 1045, 1045, 1045, 1046, 1046, 1046, 1048,
1048, 1049, 1049, 1050, 1050, 1051, 1051, 1052, 1052, 1056,
1056, 1057, 1057, 1058, 1058, 1059, 1059, 1060, 1060, 1061,
1061, 1062, 1062, 1063, 1064, 1069, 1070, 1070, 1073, 1077,
1083, 1084, 1085, 1086, 1087, 1091, 1092, 1093, 1097, 1098,
1102, 1103, 1104, 1108, 1109, 1110, 1111, 1112, 1115, 1115,
1116, 1117, 1118, 1119, 1120, 1121, 1129, 1130, 1133, 1134,
1139, 1140, 1143, 1144, 1151, 1151, 1158, 1158, 1167, 1175,
1175, 1181, 1181, 1183, 1188, 1201, 1201, 1201, 1201, 1204,
1208, 1212, 1219, 1224, 1232, 1250, 1268, 1273, 1285, 1295,
1299, 1309, 1316, 1323, 1330, 1335, 1340, 1347, 1348, 1355,
1362, 1370, 1375, 1386, 1414, 1430, 1459, 1487, 1512, 1531,
1556, 1575, 1587, 1594, 1657, 1667, 1677, 1683, 1689, 1694,
1699, 1707, 1721, 1742, 1750, 1756, 1767, 1772, 1777, 1786,
1792, 1798, 1807, 1811, 1819, 1819, 1830, 1835, 1843, 1844,
1848, 1848, 1852, 1852, 1855, 1858, 1870, 1894, 1905, 1911,
1914, 1919, 1922, 1928, 1932, 1935, 1941, 1954, 1955, 1957,
1961, 1970, 1974, 1979, 1981, 1986, 1991, 2000, 2000, 2001,
2001, 2003, 2013, 2024, 2028, 2037, 2046, 2051, 2157, 2157,
2159, 2168, 2168, 2170, 2175, 2187, 2191, 2196, 2200, 2204,
2208, 2212, 2216, 2220, 2224, 2228, 2253, 2257, 2271, 2275,
2281, 2281, 2287, 2296, 2300, 2309, 2320, 2329, 2341, 2354,
2358, 2362, 2367, 2377, 2396, 2405, 2472, 2476, 2483, 2494,
2507, 2516, 2527, 2537, 2545, 2553, 2556, 2557, 2564, 2568,
2573, 2594, 2611, 2624, 2637, 2646, 2659, 2667, 2674, 2680,
2686, 2692, 2707, 2770, 2775, 2779, 2786, 2793, 2801, 2808,
2816, 2824, 2838, 2855
};
#endif
#if YYDEBUG != 0 || defined (YYERROR_VERBOSE)
static const char * const yytname[] = { "$","error","$undefined.","ESINT64VAL",
"EUINT64VAL","SINTVAL","UINTVAL","FPVAL","VOID","INTTYPE","FLOAT","DOUBLE","LABEL",
"TYPE","VAR_ID","LABELSTR","STRINGCONSTANT","IMPLEMENTATION","ZEROINITIALIZER",
"TRUETOK","FALSETOK","BEGINTOK","ENDTOK","DECLARE","DEFINE","GLOBAL","CONSTANT",
"SECTION","VOLATILE","TO","DOTDOTDOT","NULL_TOK","UNDEF","INTERNAL","LINKONCE",
"WEAK","APPENDING","DLLIMPORT","DLLEXPORT","EXTERN_WEAK","OPAQUE","EXTERNAL",
"TARGET","TRIPLE","ENDIAN","POINTERSIZE","LITTLE","BIG","ALIGN","DEPLIBS","CALL",
"TAIL","ASM_TOK","MODULE","SIDEEFFECT","CC_TOK","CCC_TOK","CSRETCC_TOK","FASTCC_TOK",
"COLDCC_TOK","X86_STDCALLCC_TOK","X86_FASTCALLCC_TOK","DATALAYOUT","RET","BR",
"SWITCH","INVOKE","UNWIND","UNREACHABLE","ADD","SUB","MUL","UDIV","SDIV","FDIV",
"UREM","SREM","FREM","AND","OR","XOR","ICMP","FCMP","EQ","NE","SLT","SGT","SLE",
"SGE","ULT","UGT","ULE","UGE","OEQ","ONE","OLT","OGT","OLE","OGE","ORD","UNO",
"UEQ","UNE","MALLOC","ALLOCA","FREE","LOAD","STORE","GETELEMENTPTR","TRUNC",
"ZEXT","SEXT","FPTRUNC","FPEXT","BITCAST","UITOFP","SITOFP","FPTOUI","FPTOSI",
"INTTOPTR","PTRTOINT","PHI_TOK","SELECT","SHL","LSHR","ASHR","VAARG","EXTRACTELEMENT",
"INSERTELEMENT","SHUFFLEVECTOR","NORETURN","DEFAULT","HIDDEN","'='","','","'*'",
"'\\\\'","'('","')'","'['","'x'","']'","'<'","'>'","'{'","'}'","'c'","INTVAL",
"ArithmeticOps","LogicalOps","CastOps","ShiftOps","IPredicates","FPredicates",
"IntType","FPType","OptAssign","GVInternalLinkage","GVExternalLinkage","GVVisibilityStyle",
"FunctionDeclareLinkage","FunctionDefineLinkage","OptCallingConv","ParamAttr",
"OptParamAttrs","FuncAttr","OptFuncAttrs","OptAlign","OptCAlign","SectionString",
"OptSection","GlobalVarAttributes","GlobalVarAttribute","PrimType","Types","ArgType",
"ResultTypes","ArgTypeList","ArgTypeListI","TypeListI","ConstVal","ConstExpr",
"ConstVector","GlobalType","Module","DefinitionList","Definition","@1","@2",
"@3","@4","@5","AsmBlock","BigOrLittle","TargetDefinition","LibrariesDefinition",
"LibList","Name","OptName","ArgListH","ArgList","FunctionHeaderH","BEGIN","FunctionHeader",
"END","Function","FunctionProto","OptSideEffect","ConstValueRef","SymbolicValueRef",
"ValueRef","ResolvedVal","BasicBlockList","BasicBlock","InstructionList","BBTerminatorInst",
"JumpTable","Inst","PHIList","ValueRefList","IndexList","OptTailCall","InstVal",
"OptVolatile","MemoryInst", NULL
};
#endif
static const short yyr1[] = { 0,
147, 147, 148, 148, 148, 148, 148, 148, 148, 148,
148, 149, 149, 149, 150, 150, 150, 150, 150, 150,
150, 150, 150, 150, 150, 150, 151, 151, 151, 152,
152, 152, 152, 152, 152, 152, 152, 152, 152, 153,
153, 153, 153, 153, 153, 153, 153, 153, 153, 153,
153, 153, 153, 153, 153, 154, 155, 155, 156, 156,
157, 157, 157, 157, 157, 158, 158, 158, 159, 159,
160, 160, 160, 161, 161, 161, 161, 161, 162, 162,
162, 162, 162, 162, 162, 162, 163, 163, 164, 164,
165, 165, 166, 166, 167, 167, 168, 168, 169, 170,
170, 171, 171, 172, 172, 173, 173, 173, 173, 174,
174, 174, 174, 174, 174, 174, 174, 174, 174, 174,
174, 174, 175, 176, 176, 177, 177, 178, 178, 178,
178, 179, 179, 180, 180, 180, 180, 180, 180, 180,
180, 180, 180, 180, 180, 180, 180, 180, 180, 180,
180, 181, 181, 181, 181, 181, 181, 181, 181, 181,
181, 181, 182, 182, 183, 183, 184, 184, 185, 185,
187, 186, 188, 186, 186, 186, 186, 186, 189, 186,
190, 186, 191, 186, 186, 186, 192, 193, 193, 194,
194, 194, 194, 195, 196, 196, 196, 197, 197, 198,
198, 199, 199, 200, 200, 200, 200, 201, 202, 202,
203, 204, 204, 205, 206, 207, 207, 208, 208, 208,
208, 208, 208, 208, 208, 208, 208, 208, 209, 209,
210, 210, 211, 212, 212, 213, 214, 214, 214, 215,
215, 215, 215, 215, 215, 215, 215, 215, 216, 216,
217, 218, 218, 219, 219, 219, 220, 220, 221, 221,
222, 222, 222, 222, 222, 222, 222, 222, 222, 222,
222, 222, 222, 222, 223, 223, 224, 224, 224, 224,
224, 224, 224, 224
};
static const short yyr2[] = { 0,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 2, 0,
1, 1, 1, 1, 1, 1, 1, 1, 0, 1,
0, 1, 1, 0, 1, 1, 1, 1, 0, 1,
1, 1, 1, 1, 1, 2, 1, 1, 0, 2,
1, 1, 0, 2, 0, 2, 0, 3, 2, 0,
1, 0, 3, 1, 2, 1, 1, 1, 1, 1,
1, 2, 1, 2, 5, 5, 5, 5, 3, 2,
5, 4, 2, 1, 1, 1, 3, 1, 3, 1,
0, 1, 3, 4, 3, 3, 4, 4, 3, 6,
5, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 6, 5, 8, 6, 6, 7, 7, 6, 6,
8, 8, 3, 1, 1, 1, 1, 0, 1, 2,
0, 3, 0, 3, 3, 1, 3, 3, 0, 6,
0, 7, 0, 7, 2, 3, 1, 1, 1, 3,
3, 3, 3, 3, 3, 1, 0, 1, 1, 1,
0, 5, 3, 1, 3, 1, 0, 9, 1, 1,
4, 1, 1, 2, 3, 0, 1, 1, 1, 1,
1, 1, 1, 1, 1, 3, 1, 5, 1, 1,
1, 1, 2, 2, 2, 3, 2, 0, 1, 2,
2, 3, 9, 9, 8, 14, 1, 1, 6, 5,
2, 6, 7, 3, 5, 0, 0, 3, 2, 1,
5, 5, 6, 6, 4, 4, 6, 4, 4, 6,
6, 2, 8, 1, 1, 0, 3, 6, 3, 6,
2, 4, 6, 4
};
static const short yydefact[] = { 60,
198, 199, 176, 173, 171, 0, 0, 0, 69, 60,
169, 0, 71, 74, 0, 0, 0, 0, 185, 0,
0, 0, 61, 63, 62, 64, 66, 65, 67, 68,
70, 69, 69, 0, 170, 59, 72, 73, 69, 174,
75, 76, 77, 78, 69, 238, 172, 238, 0, 0,
0, 0, 197, 186, 187, 175, 1, 2, 178, 106,
107, 108, 109, 110, 0, 0, 0, 0, 229, 111,
177, 230, 113, 0, 0, 165, 166, 0, 79, 79,
239, 235, 60, 212, 213, 214, 234, 192, 189, 188,
190, 191, 193, 196, 0, 131, 114, 0, 0, 0,
0, 120, 132, 0, 112, 131, 0, 0, 106, 107,
108, 0, 0, 0, 179, 0, 80, 81, 82, 83,
84, 85, 0, 215, 0, 276, 237, 0, 194, 130,
89, 126, 128, 0, 0, 0, 0, 0, 0, 119,
0, 181, 183, 149, 150, 147, 148, 151, 146, 142,
143, 3, 4, 5, 6, 7, 8, 9, 10, 11,
12, 13, 14, 0, 0, 0, 15, 16, 17, 18,
19, 20, 21, 22, 23, 24, 25, 26, 0, 27,
28, 29, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 145, 144, 102, 86, 125, 124, 0,
209, 210, 211, 275, 260, 0, 0, 0, 0, 79,
247, 248, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 236, 79,
251, 0, 274, 195, 123, 0, 93, 0, 0, 122,
0, 133, 93, 102, 102, 30, 31, 32, 33, 34,
35, 36, 37, 38, 39, 0, 54, 55, 50, 51,
52, 53, 40, 41, 42, 43, 44, 45, 46, 47,
48, 49, 0, 0, 0, 0, 0, 0, 135, 164,
0, 0, 0, 139, 0, 136, 0, 0, 0, 0,
0, 180, 0, 259, 241, 0, 240, 0, 0, 56,
0, 0, 0, 0, 97, 97, 281, 0, 0, 272,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 87, 88, 90, 129, 127, 116, 117, 118,
121, 115, 182, 184, 0, 0, 257, 0, 0, 0,
0, 0, 134, 120, 132, 0, 137, 138, 0, 0,
0, 0, 0, 0, 104, 102, 207, 218, 219, 220,
225, 221, 222, 223, 224, 216, 0, 227, 232, 231,
233, 0, 242, 0, 0, 0, 0, 0, 277, 0,
279, 257, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 91, 92, 94, 0,
0, 0, 0, 0, 0, 0, 163, 141, 0, 0,
0, 0, 0, 99, 105, 103, 206, 89, 204, 0,
217, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 284, 0, 0, 0, 268, 269, 0, 0, 0,
0, 266, 265, 0, 282, 0, 0, 0, 0, 153,
0, 0, 0, 0, 140, 0, 0, 0, 0, 201,
0, 93, 0, 226, 0, 0, 256, 0, 0, 97,
98, 97, 0, 0, 0, 0, 0, 261, 262, 256,
0, 0, 0, 258, 0, 160, 0, 0, 155, 156,
152, 159, 200, 203, 205, 89, 100, 0, 0, 0,
0, 0, 263, 264, 0, 278, 280, 0, 0, 267,
270, 271, 0, 283, 157, 158, 0, 0, 0, 201,
101, 95, 228, 0, 0, 89, 0, 93, 252, 0,
93, 154, 161, 162, 202, 0, 208, 0, 245, 0,
0, 254, 0, 0, 253, 273, 96, 243, 0, 244,
0, 89, 0, 0, 0, 255, 0, 0, 0, 0,
250, 0, 0, 249, 0, 246, 0, 0, 0
};
static const short yydefgoto[] = { 69,
190, 191, 192, 193, 256, 273, 112, 113, 9, 32,
33, 34, 39, 45, 123, 325, 235, 399, 328, 537,
379, 355, 522, 292, 356, 70, 114, 132, 200, 133,
134, 104, 280, 368, 281, 78, 567, 10, 11, 14,
13, 196, 244, 245, 56, 91, 19, 54, 95, 72,
494, 419, 420, 124, 203, 46, 86, 47, 40, 422,
369, 73, 371, 297, 48, 82, 83, 229, 541, 127,
310, 502, 402, 230, 231, 232, 233
};
static const short yypact[] = { 399,
-32768,-32768,-32768,-32768,-32768, 12, -43, -5, 66, 525,
-32768, 47, 142, 122, 58, 63, 82, 88,-32768, -33,
119, 789,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
-32768, -13, -13, 222,-32768,-32768,-32768,-32768, -13,-32768,
-32768,-32768,-32768,-32768, -13, 123,-32768, -6, 208, 218,
223, 224, 243,-32768,-32768,-32768,-32768,-32768, 124,-32768,
-32768,-32768,-32768,-32768, 267, 276, 8, 23,-32768,-32768,
121,-32768,-32768, 222, 222,-32768,-32768, 1043, 129, 129,
-32768,-32768, 239,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768, -45, 547,-32768, 143, 147, 118,
124,-32768, 121, -94,-32768, 547, 1043, 1127, 42, 284,
285, 263, 286, 600,-32768, 290,-32768,-32768,-32768,-32768,
-32768,-32768, 1140,-32768, -8, 1278,-32768, 279,-32768,-32768,
121,-32768, 162, 159, 1127, 1127, 156, -70, 1127,-32768,
167,-32768, 121,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,-32768, 536, 499, 172,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 175,-32768,
-32768,-32768, 176, 178, 179, 691, 1183, 137, 302, 182,
183, 186, 190,-32768,-32768, 166,-32768, 124, 121, 239,
-32768,-32768,-32768,-32768,-32768, 251, 1195, 56, 319, 129,
-32768,-32768, 536, 499, 1127, 1127, 1127, 1127, 1127, 1127,
1127, 1127, 1127, 1127, 1127, 1127, 1127, 1127,-32768, 129,
-32768, 163,-32768,-32768, 164, 772,-32768, 41, -27,-32768,
187, 121,-32768, 166, 166,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,-32768, 192,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,-32768, 194, 1043, 1043, 1043, 1043, 1043,-32768,-32768,
20, 498, -91,-32768, -67,-32768, 1043, 1043, 1043, 1043,
-12,-32768, 195,-32768, 124, 744,-32768, 871, 871,-32768,
871, 1140, 1127, 1127, -17, 29,-32768, 744, 60, 200,
201, 202, 203, 204, 205, 744, 744, 311, 207, 1140,
1127, 1127,-32768,-32768,-32768,-32768,-32768, -86,-32768,-32768,
-32768, -86,-32768,-32768, 1043, 1043,-32768, 210, 215, 216,
217, 1043,-32768, 199, 600, -50,-32768,-32768, 220, 225,
328, 226, 346, 359,-32768, 166, 1026,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,-32768, 310, 1043,-32768,-32768,-32768,
-32768, 231,-32768, 232, 871, 744, 744, 2,-32768, 5,
-32768,-32768, 871, 230, 1127, 1127, 1127, 1127, 1127, 236,
242, 1127, 1127, 871, 744, 246,-32768,-32768,-32768, 247,
248, 6, 1043, 1043, 1043, 1043,-32768,-32768, 234, 1043,
1043, 1127, 1043,-32768,-32768,-32768,-32768, 121, 249, 250,
-32768, 368, -46, 373, 374, 254, 253, 260, 871, 393,
871, 269, 271, 871, 272, 121,-32768, 273, 275, 871,
871, 121,-32768, 277,-32768, 1127, 1043, 1043, 1127,-32768,
278, 280, 283, 287,-32768, 288, 293, 114, 295, 3,
1089,-32768, 291,-32768, 871, 871, 1127, 871, 871, 300,
-32768, 300, 871, 303, 1127, 1127, 1127,-32768,-32768, 1127,
744, 301, 304,-32768, 1043,-32768, 1043, 1043,-32768,-32768,
-32768,-32768,-32768,-32768,-32768, 121, 64, 394, 306, 299,
744, 35,-32768,-32768, 376,-32768,-32768, 305, 871,-32768,
-32768,-32768, 112,-32768,-32768,-32768, 307, 312, 313, 3,
-32768, 395,-32768, 432, -4,-32768, 1127,-32768,-32768, 308,
-32768,-32768,-32768,-32768,-32768, 450,-32768, 871,-32768, 998,
9, 164, 744, 1,-32768, -86,-32768,-32768, 321,-32768,
998,-32768, 444, 445, 324, 164, 871, 871, 447, 397,
-32768, 871, 455,-32768, 871,-32768, 468, 469,-32768
};
static const short yypgoto[] = {-32768,
345, 347, 348, 349, 259, 262, -208,-32768, 398,-32768,
-32768, 48,-32768,-32768, -172, -305, -411,-32768, -217,-32768,
-300, -20,-32768, -223,-32768,-32768, -14, 252, -260,-32768,
377, 382, -58, -112, -184, 211,-32768,-32768, 477,-32768,
-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 0,
-30,-32768,-32768, 411,-32768,-32768,-32768,-32768,-32768,-32768,
-492, -73, 103, -151,-32768, 446,-32768,-32768,-32768,-32768,
-32768, 13, 113,-32768,-32768,-32768,-32768
};
#define YYLAST 1407
static const short yytable[] = { 12,
301, 194, 283, 285, 300, 381, 460, 71, 81, 12,
429, 99, 201, 431, 353, 84, 1, 300, 2, 115,
333, 334, 398, 323, 324, 332, 398, 57, 58, 553,
101, 60, 61, 62, 63, 354, 1, 302, 2, 139,
195, 375, 342, 397, -56, -56, 21, 549, 142, 430,
140, 347, 430, 103, 15, 16, 17, 320, 555, 394,
144, 145, 64, 139, 298, 307, 342, 299, 311, 312,
313, 314, 315, 18, 241, 318, 319, 348, 22, 74,
75, 131, 12, 342, 520, 103, 79, 342, 128, 20,
353, 131, 80, 143, 409, 129, 464, 346, 23, 24,
25, 26, 27, 28, 29, 53, 30, 105, 199, 106,
323, 324, 323, 324, 542, 330, 378, 105, 31, 106,
238, 239, 57, 58, 242, 101, 60, 61, 62, 63,
397, 1, 416, 2, 55, 202, 539, 81, 85, 449,
556, 57, 58, 450, 101, 109, 110, 111, 63, 550,
1, 100, 2, 342, 41, 42, 43, 64, 65, 44,
343, 66, 380, 105, 67, 106, 68, 102, 527, 506,
396, 507, 528, 323, 324, 105, 64, 106, 37, 36,
38, 329, 423, 116, 117, 118, 119, 120, 121, 122,
49, 398, 296, 397, 105, 50, 106, 31, 383, 293,
305, 306, 296, 308, 309, 296, 296, 296, 296, 296,
316, 317, 296, 296, 51, 337, 338, 339, 340, 341,
52, 131, 370, 88, 370, 370, 92, 370, 349, 350,
351, 352, 194, 435, 370, 437, 438, 439, 398, 93,
398, 443, 370, 370, 497, 527, 76, 77, 105, 531,
106, 491, 1, 65, 2, 105, 66, 106, 94, 67,
96, 68, 137, 89, 90, 146, 147, 345, 321, 322,
97, 195, 65, 323, 324, 66, 400, 401, 67, 98,
68, 284, 135, 407, 107, 108, 136, 199, 376, 377,
-57, -58, 148, 197, 234, 236, 237, 484, 240, 291,
294, 370, 370, 370, 243, 199, 395, 296, 274, 370,
544, 275, 276, 546, 277, 278, 540, 286, 287, 288,
370, 370, 289, 510, 511, 512, 290, 300, 335, 331,
336, 357, 551, 384, 385, 386, 387, 388, 389, 392,
393, 408, 418, 403, 451, 452, 453, 454, 404, 405,
406, 456, 457, 410, 459, 370, 412, 370, 411, 413,
370, 414, 415, 421, 424, 425, 370, 370, 434, 440,
296, 436, 296, 296, 296, 441, 455, 442, 296, 446,
447, 448, 461, 463, 465, 466, 468, 462, 482, 483,
467, 370, 370, 469, 370, 370, 471, 458, -168, 370,
372, 373, 449, 374, 473, 475, 476, 370, 477, 523,
382, 485, 1, 480, 2, 3, 487, 486, 390, 391,
488, 4, 5, 430, 498, 489, 517, 370, 518, 519,
490, 481, 492, 505, 296, 370, 509, 525, 515, 524,
6, 516, 536, 538, 532, 529, 496, 7, 545, 533,
534, 8, 501, 547, 554, 557, 558, 559, 562, 493,
296, 296, 296, 563, 370, 501, 565, 568, 569, 370,
225, 303, 226, 227, 228, 304, 521, 426, 427, 428,
126, 138, 141, 370, 370, 433, 35, 327, 370, 535,
125, 370, 513, 87, 432, 0, 444, 445, 0, 0,
0, 0, 57, 58, 0, 101, 109, 110, 111, 63,
0, 1, 543, 2, 0, 0, 0, 257, 258, 493,
0, 0, 0, 0, -167, 0, 0, 0, 0, 0,
0, 470, 0, 472, 0, 0, 474, 64, 1, 0,
2, 3, 478, 479, 0, 0, 0, 4, 5, 0,
0, 57, 58, 0, 101, 60, 61, 62, 63, 0,
1, 0, 2, 0, 0, 0, 6, 499, 500, 0,
503, 504, 0, 7, 0, 508, 130, 8, 0, 0,
0, 0, 0, 514, 0, 0, 64, 259, 260, 261,
262, 263, 264, 265, 266, 267, 268, 269, 270, 271,
272, 0, 0, 526, 57, 58, 0, 0, 0, 0,
0, 530, 0, 1, 0, 2, 0, 149, 246, 247,
248, 249, 250, 251, 252, 253, 254, 255, 0, 0,
150, 151, 0, 65, 0, 0, 66, 0, 0, 67,
548, 68, 344, 0, 0, 552, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 560,
561, 0, 0, 0, 564, 0, 0, 566, 152, 153,
154, 155, 156, 157, 158, 159, 160, 161, 162, 163,
164, 165, 65, 0, 0, 66, 0, 0, 67, 0,
68, 0, 0, 0, 0, 57, 58, 0, 101, 109,
110, 111, 63, 0, 1, 0, 2, 166, 167, 168,
169, 170, 171, 172, 173, 174, 175, 176, 177, 178,
0, 179, 180, 181, 182, 0, 183, 184, 185, 0,
64, 0, 0, 0, 105, 0, 106, 0, 186, 0,
0, 187, 0, 188, 0, 189, 358, 359, 57, 58,
360, 0, 0, 0, 0, 0, 0, 1, 0, 2,
0, 361, 362, 363, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 364, 365, 57, 58, 0, 101,
60, 61, 62, 63, 0, 1, 0, 2, 0, 0,
0, 0, 0, 57, 58, 366, 59, 60, 61, 62,
63, 326, 1, 0, 2, 0, 0, 0, 0, 0,
0, 64, 152, 153, 154, 155, 156, 157, 158, 159,
160, 161, 162, 163, 164, 165, 65, 0, 64, 66,
0, 279, 67, 0, 68, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 166, 167, 168, 169, 170, 171, 172, 173, 174,
175, 176, 177, 178, 0, 179, 180, 181, 182, 0,
183, 184, 185, 358, 359, 57, 58, 360, 105, 0,
106, 0, 0, 0, 1, 367, 2, 0, 361, 362,
363, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 364, 365, 0, 0, 0, 0, 65, 0, 0,
66, 0, 0, 67, 0, 68, 0, 0, 0, 0,
0, 0, 366, 0, 65, 0, 0, 66, 0, 0,
67, 0, 68, 0, 0, 0, 0, 0, 0, 152,
153, 154, 155, 156, 157, 158, 159, 160, 161, 162,
163, 164, 165, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 166, 167,
168, 169, 170, 171, 172, 173, 174, 175, 176, 177,
178, 0, 179, 180, 181, 182, 0, 183, 184, 185,
358, 359, 0, 0, 360, 0, 0, 0, 0, 0,
0, 0, 367, 0, 0, 361, 362, 363, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 364, 365,
57, 58, 0, 101, 60, 61, 62, 63, 0, 1,
0, 2, 0, 0, 0, 0, 0, 57, 58, 366,
101, 109, 110, 111, 63, 417, 1, 0, 2, 0,
0, 0, 0, 0, 0, 64, 152, 153, 154, 155,
156, 157, 158, 159, 160, 161, 162, 163, 164, 165,
0, 0, 64, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 57, 58, 0, 101, 60, 61, 62,
63, 0, 1, 0, 2, 166, 167, 168, 169, 170,
171, 172, 173, 174, 175, 176, 177, 178, 495, 179,
180, 181, 182, 0, 183, 184, 185, 0, 64, 0,
0, 57, 58, 0, 101, 60, 61, 62, 63, 367,
1, 0, 2, 0, 57, 58, 0, 198, 60, 61,
62, 63, 0, 1, 0, 2, 0, 0, 0, 0,
0, 65, 0, 0, 66, 0, 64, 67, 0, 68,
0, 0, 0, 0, 0, 0, 0, 0, 65, 64,
0, 66, 0, 0, 67, 0, 68, 57, 58, 0,
101, 109, 110, 111, 63, 0, 1, 0, 2, 57,
58, 0, 295, 60, 61, 62, 63, 0, 1, 0,
2, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 64, 0, 65, 0, 0, 66, 0, 0,
67, 0, 68, 0, 64, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 65, 0, 0, 66, 0, 0, 67, 0,
68, 0, 0, 0, 0, 65, 0, 0, 66, 0,
0, 67, 0, 68, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 204, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 65, 0,
0, 66, 0, 0, 67, 0, 282, 205, 206, 0,
65, 0, 0, 66, 0, 0, 67, 0, 68, 0,
207, 208, 209, 210, 211, 212, 152, 153, 154, 155,
156, 157, 158, 159, 160, 161, 162, 163, 213, 214,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
215, 216, 217, 0, 0, 218, 167, 168, 169, 170,
171, 172, 173, 174, 175, 176, 177, 178, 219, 220,
180, 181, 182, 221, 222, 223, 224
};
static const short yycheck[] = { 0,
209, 114, 187, 188, 9, 306, 418, 22, 15, 10,
9, 4, 21, 9, 27, 22, 14, 9, 16, 78,
244, 245, 328, 110, 111, 243, 332, 5, 6, 29,
8, 9, 10, 11, 12, 48, 14, 210, 16, 134,
114, 302, 134, 130, 3, 4, 52, 540, 107, 48,
145, 143, 48, 68, 43, 44, 45, 230, 551, 320,
19, 20, 40, 134, 9, 217, 134, 12, 220, 221,
222, 223, 224, 62, 145, 227, 228, 145, 13, 32,
33, 96, 83, 134, 496, 100, 39, 134, 134, 133,
27, 106, 45, 108, 145, 141, 143, 282, 33, 34,
35, 36, 37, 38, 39, 139, 41, 135, 123, 137,
110, 111, 110, 111, 526, 143, 134, 135, 132, 137,
135, 136, 5, 6, 139, 8, 9, 10, 11, 12,
130, 14, 356, 16, 16, 144, 141, 15, 145, 134,
552, 5, 6, 138, 8, 9, 10, 11, 12, 141,
14, 144, 16, 134, 33, 34, 35, 40, 136, 38,
141, 139, 134, 135, 142, 137, 144, 145, 134, 470,
322, 472, 138, 110, 111, 135, 40, 137, 37, 133,
39, 141, 367, 55, 56, 57, 58, 59, 60, 61,
133, 497, 207, 130, 135, 133, 137, 132, 139, 200,
215, 216, 217, 218, 219, 220, 221, 222, 223, 224,
225, 226, 227, 228, 133, 274, 275, 276, 277, 278,
133, 236, 296, 16, 298, 299, 4, 301, 287, 288,
289, 290, 345, 385, 308, 387, 388, 389, 544, 16,
546, 393, 316, 317, 462, 134, 25, 26, 135, 138,
137, 138, 14, 136, 16, 135, 139, 137, 16, 142,
137, 144, 145, 46, 47, 3, 4, 282, 106, 107,
4, 345, 136, 110, 111, 139, 335, 336, 142, 4,
144, 145, 140, 342, 74, 75, 140, 302, 303, 304,
7, 7, 7, 4, 16, 134, 138, 449, 143, 134,
50, 375, 376, 377, 138, 320, 321, 322, 137, 383,
528, 137, 137, 531, 137, 137, 525, 16, 137, 137,
394, 395, 137, 475, 476, 477, 137, 9, 137, 143,
137, 137, 541, 134, 134, 134, 134, 134, 134, 29,
134, 143, 357, 134, 403, 404, 405, 406, 134, 134,
134, 410, 411, 134, 413, 429, 29, 431, 134, 134,
434, 16, 4, 54, 134, 134, 440, 441, 139, 134,
385, 386, 387, 388, 389, 134, 143, 392, 393, 134,
134, 134, 134, 16, 12, 12, 134, 138, 447, 448,
137, 465, 466, 134, 468, 469, 4, 412, 0, 473,
298, 299, 134, 301, 134, 134, 134, 481, 134, 16,
308, 134, 14, 137, 16, 17, 134, 138, 316, 317,
134, 23, 24, 48, 134, 138, 485, 501, 487, 488,
138, 446, 138, 134, 449, 509, 134, 139, 138, 134,
42, 138, 48, 12, 138, 141, 461, 49, 141, 138,
138, 53, 467, 4, 134, 12, 12, 134, 12, 460,
475, 476, 477, 67, 538, 480, 12, 0, 0, 543,
126, 213, 126, 126, 126, 214, 497, 375, 376, 377,
83, 100, 106, 557, 558, 383, 10, 236, 562, 520,
80, 565, 480, 48, 382, -1, 394, 395, -1, -1,
-1, -1, 5, 6, -1, 8, 9, 10, 11, 12,
-1, 14, 527, 16, -1, -1, -1, 19, 20, 520,
-1, -1, -1, -1, 0, -1, -1, -1, -1, -1,
-1, 429, -1, 431, -1, -1, 434, 40, 14, -1,
16, 17, 440, 441, -1, -1, -1, 23, 24, -1,
-1, 5, 6, -1, 8, 9, 10, 11, 12, -1,
14, -1, 16, -1, -1, -1, 42, 465, 466, -1,
468, 469, -1, 49, -1, 473, 30, 53, -1, -1,
-1, -1, -1, 481, -1, -1, 40, 89, 90, 91,
92, 93, 94, 95, 96, 97, 98, 99, 100, 101,
102, -1, -1, 501, 5, 6, -1, -1, -1, -1,
-1, 509, -1, 14, -1, 16, -1, 18, 83, 84,
85, 86, 87, 88, 89, 90, 91, 92, -1, -1,
31, 32, -1, 136, -1, -1, 139, -1, -1, 142,
538, 144, 145, -1, -1, 543, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, 557,
558, -1, -1, -1, 562, -1, -1, 565, 69, 70,
71, 72, 73, 74, 75, 76, 77, 78, 79, 80,
81, 82, 136, -1, -1, 139, -1, -1, 142, -1,
144, -1, -1, -1, -1, 5, 6, -1, 8, 9,
10, 11, 12, -1, 14, -1, 16, 108, 109, 110,
111, 112, 113, 114, 115, 116, 117, 118, 119, 120,
-1, 122, 123, 124, 125, -1, 127, 128, 129, -1,
40, -1, -1, -1, 135, -1, 137, -1, 139, -1,
-1, 142, -1, 144, -1, 146, 3, 4, 5, 6,
7, -1, -1, -1, -1, -1, -1, 14, -1, 16,
-1, 18, 19, 20, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, 31, 32, 5, 6, -1, 8,
9, 10, 11, 12, -1, 14, -1, 16, -1, -1,
-1, -1, -1, 5, 6, 52, 8, 9, 10, 11,
12, 30, 14, -1, 16, -1, -1, -1, -1, -1,
-1, 40, 69, 70, 71, 72, 73, 74, 75, 76,
77, 78, 79, 80, 81, 82, 136, -1, 40, 139,
-1, 141, 142, -1, 144, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, 108, 109, 110, 111, 112, 113, 114, 115, 116,
117, 118, 119, 120, -1, 122, 123, 124, 125, -1,
127, 128, 129, 3, 4, 5, 6, 7, 135, -1,
137, -1, -1, -1, 14, 142, 16, -1, 18, 19,
20, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, 31, 32, -1, -1, -1, -1, 136, -1, -1,
139, -1, -1, 142, -1, 144, -1, -1, -1, -1,
-1, -1, 52, -1, 136, -1, -1, 139, -1, -1,
142, -1, 144, -1, -1, -1, -1, -1, -1, 69,
70, 71, 72, 73, 74, 75, 76, 77, 78, 79,
80, 81, 82, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, 108, 109,
110, 111, 112, 113, 114, 115, 116, 117, 118, 119,
120, -1, 122, 123, 124, 125, -1, 127, 128, 129,
3, 4, -1, -1, 7, -1, -1, -1, -1, -1,
-1, -1, 142, -1, -1, 18, 19, 20, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, 31, 32,
5, 6, -1, 8, 9, 10, 11, 12, -1, 14,
-1, 16, -1, -1, -1, -1, -1, 5, 6, 52,
8, 9, 10, 11, 12, 30, 14, -1, 16, -1,
-1, -1, -1, -1, -1, 40, 69, 70, 71, 72,
73, 74, 75, 76, 77, 78, 79, 80, 81, 82,
-1, -1, 40, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, 5, 6, -1, 8, 9, 10, 11,
12, -1, 14, -1, 16, 108, 109, 110, 111, 112,
113, 114, 115, 116, 117, 118, 119, 120, 30, 122,
123, 124, 125, -1, 127, 128, 129, -1, 40, -1,
-1, 5, 6, -1, 8, 9, 10, 11, 12, 142,
14, -1, 16, -1, 5, 6, -1, 8, 9, 10,
11, 12, -1, 14, -1, 16, -1, -1, -1, -1,
-1, 136, -1, -1, 139, -1, 40, 142, -1, 144,
-1, -1, -1, -1, -1, -1, -1, -1, 136, 40,
-1, 139, -1, -1, 142, -1, 144, 5, 6, -1,
8, 9, 10, 11, 12, -1, 14, -1, 16, 5,
6, -1, 8, 9, 10, 11, 12, -1, 14, -1,
16, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, 40, -1, 136, -1, -1, 139, -1, -1,
142, -1, 144, -1, 40, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, 136, -1, -1, 139, -1, -1, 142, -1,
144, -1, -1, -1, -1, 136, -1, -1, 139, -1,
-1, 142, -1, 144, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, 28, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, 136, -1,
-1, 139, -1, -1, 142, -1, 144, 50, 51, -1,
136, -1, -1, 139, -1, -1, 142, -1, 144, -1,
63, 64, 65, 66, 67, 68, 69, 70, 71, 72,
73, 74, 75, 76, 77, 78, 79, 80, 81, 82,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
103, 104, 105, -1, -1, 108, 109, 110, 111, 112,
113, 114, 115, 116, 117, 118, 119, 120, 121, 122,
123, 124, 125, 126, 127, 128, 129
};
/* -*-C-*- Note some compilers choke on comments on `#line' lines. */
#line 3 "/usr/share/bison.simple"
/* This file comes from bison-1.28. */
/* Skeleton output parser for bison,
Copyright (C) 1984, 1989, 1990 Free Software Foundation, Inc.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330,
Boston, MA 02111-1307, USA. */
/* As a special exception, when this file is copied by Bison into a
Bison output file, you may use that output file without restriction.
This special exception was added by the Free Software Foundation
in version 1.24 of Bison. */
/* This is the parser code that is written into each bison parser
when the %semantic_parser declaration is not specified in the grammar.
It was written by Richard Stallman by simplifying the hairy parser
used when %semantic_parser is specified. */
#ifndef YYSTACK_USE_ALLOCA
#ifdef alloca
#define YYSTACK_USE_ALLOCA
#else /* alloca not defined */
#ifdef __GNUC__
#define YYSTACK_USE_ALLOCA
#define alloca __builtin_alloca
#else /* not GNU C. */
#if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi) || (defined (__sun) && defined (__i386))
#define YYSTACK_USE_ALLOCA
#include <alloca.h>
#else /* not sparc */
/* We think this test detects Watcom and Microsoft C. */
/* This used to test MSDOS, but that is a bad idea
since that symbol is in the user namespace. */
#if (defined (_MSDOS) || defined (_MSDOS_)) && !defined (__TURBOC__)
#if 0 /* No need for malloc.h, which pollutes the namespace;
instead, just don't use alloca. */
#include <malloc.h>
#endif
#else /* not MSDOS, or __TURBOC__ */
#if defined(_AIX)
/* I don't know what this was needed for, but it pollutes the namespace.
So I turned it off. rms, 2 May 1997. */
/* #include <malloc.h> */
#pragma alloca
#define YYSTACK_USE_ALLOCA
#else /* not MSDOS, or __TURBOC__, or _AIX */
#if 0
#ifdef __hpux /* haible@ilog.fr says this works for HPUX 9.05 and up,
and on HPUX 10. Eventually we can turn this on. */
#define YYSTACK_USE_ALLOCA
#define alloca __builtin_alloca
#endif /* __hpux */
#endif
#endif /* not _AIX */
#endif /* not MSDOS, or __TURBOC__ */
#endif /* not sparc */
#endif /* not GNU C */
#endif /* alloca not defined */
#endif /* YYSTACK_USE_ALLOCA not defined */
#ifdef YYSTACK_USE_ALLOCA
#define YYSTACK_ALLOC alloca
#else
#define YYSTACK_ALLOC malloc
#endif
/* Note: there must be only one dollar sign in this file.
It is replaced by the list of actions, each action
as one case of the switch. */
#define yyerrok (yyerrstatus = 0)
#define yyclearin (yychar = YYEMPTY)
#define YYEMPTY -2
#define YYEOF 0
#define YYACCEPT goto yyacceptlab
#define YYABORT goto yyabortlab
#define YYERROR goto yyerrlab1
/* Like YYERROR except do call yyerror.
This remains here temporarily to ease the
transition to the new meaning of YYERROR, for GCC.
Once GCC version 2 has supplanted version 1, this can go. */
#define YYFAIL goto yyerrlab
#define YYRECOVERING() (!!yyerrstatus)
#define YYBACKUP(token, value) \
do \
if (yychar == YYEMPTY && yylen == 1) \
{ yychar = (token), yylval = (value); \
yychar1 = YYTRANSLATE (yychar); \
YYPOPSTACK; \
goto yybackup; \
} \
else \
{ yyerror ("syntax error: cannot back up"); YYERROR; } \
while (0)
#define YYTERROR 1
#define YYERRCODE 256
#ifndef YYPURE
#define YYLEX yylex()
#endif
#ifdef YYPURE
#ifdef YYLSP_NEEDED
#ifdef YYLEX_PARAM
#define YYLEX yylex(&yylval, &yylloc, YYLEX_PARAM)
#else
#define YYLEX yylex(&yylval, &yylloc)
#endif
#else /* not YYLSP_NEEDED */
#ifdef YYLEX_PARAM
#define YYLEX yylex(&yylval, YYLEX_PARAM)
#else
#define YYLEX yylex(&yylval)
#endif
#endif /* not YYLSP_NEEDED */
#endif
/* If nonreentrant, generate the variables here */
#ifndef YYPURE
int yychar; /* the lookahead symbol */
YYSTYPE yylval; /* the semantic value of the */
/* lookahead symbol */
#ifdef YYLSP_NEEDED
YYLTYPE yylloc; /* location data for the lookahead */
/* symbol */
#endif
int yynerrs; /* number of parse errors so far */
#endif /* not YYPURE */
#if YYDEBUG != 0
int yydebug; /* nonzero means print parse trace */
/* Since this is uninitialized, it does not stop multiple parsers
from coexisting. */
#endif
/* YYINITDEPTH indicates the initial size of the parser's stacks */
#ifndef YYINITDEPTH
#define YYINITDEPTH 200
#endif
/* YYMAXDEPTH is the maximum size the stacks can grow to
(effective only if the built-in stack extension method is used). */
#if YYMAXDEPTH == 0
#undef YYMAXDEPTH
#endif
#ifndef YYMAXDEPTH
#define YYMAXDEPTH 10000
#endif
/* Define __yy_memcpy. Note that the size argument
should be passed with type unsigned int, because that is what the non-GCC
definitions require. With GCC, __builtin_memcpy takes an arg
of type size_t, but it can handle unsigned int. */
#if __GNUC__ > 1 /* GNU C and GNU C++ define this. */
#define __yy_memcpy(TO,FROM,COUNT) __builtin_memcpy(TO,FROM,COUNT)
#else /* not GNU C or C++ */
#ifndef __cplusplus
/* This is the most reliable way to avoid incompatibilities
in available built-in functions on various systems. */
static void
__yy_memcpy (to, from, count)
char *to;
char *from;
unsigned int count;
{
register char *f = from;
register char *t = to;
register int i = count;
while (i-- > 0)
*t++ = *f++;
}
#else /* __cplusplus */
/* This is the most reliable way to avoid incompatibilities
in available built-in functions on various systems. */
static void
__yy_memcpy (char *to, char *from, unsigned int count)
{
register char *t = to;
register char *f = from;
register int i = count;
while (i-- > 0)
*t++ = *f++;
}
#endif
#endif
#line 217 "/usr/share/bison.simple"
/* The user can define YYPARSE_PARAM as the name of an argument to be passed
into yyparse. The argument should have type void *.
It should actually point to an object.
Grammar actions can access the variable by casting it
to the proper pointer type. */
#ifdef YYPARSE_PARAM
#ifdef __cplusplus
#define YYPARSE_PARAM_ARG void *YYPARSE_PARAM
#define YYPARSE_PARAM_DECL
#else /* not __cplusplus */
#define YYPARSE_PARAM_ARG YYPARSE_PARAM
#define YYPARSE_PARAM_DECL void *YYPARSE_PARAM;
#endif /* not __cplusplus */
#else /* not YYPARSE_PARAM */
#define YYPARSE_PARAM_ARG
#define YYPARSE_PARAM_DECL
#endif /* not YYPARSE_PARAM */
/* Prevent warning if -Wstrict-prototypes. */
#ifdef __GNUC__
#ifdef YYPARSE_PARAM
int yyparse (void *);
#else
int yyparse (void);
#endif
#endif
int
yyparse(YYPARSE_PARAM_ARG)
YYPARSE_PARAM_DECL
{
register int yystate;
register int yyn;
register short *yyssp;
register YYSTYPE *yyvsp;
int yyerrstatus; /* number of tokens to shift before error messages enabled */
int yychar1 = 0; /* lookahead token as an internal (translated) token number */
short yyssa[YYINITDEPTH]; /* the state stack */
YYSTYPE yyvsa[YYINITDEPTH]; /* the semantic value stack */
short *yyss = yyssa; /* refer to the stacks thru separate pointers */
YYSTYPE *yyvs = yyvsa; /* to allow yyoverflow to reallocate them elsewhere */
#ifdef YYLSP_NEEDED
YYLTYPE yylsa[YYINITDEPTH]; /* the location stack */
YYLTYPE *yyls = yylsa;
YYLTYPE *yylsp;
#define YYPOPSTACK (yyvsp--, yyssp--, yylsp--)
#else
#define YYPOPSTACK (yyvsp--, yyssp--)
#endif
int yystacksize = YYINITDEPTH;
int yyfree_stacks = 0;
#ifdef YYPURE
int yychar;
YYSTYPE yylval;
int yynerrs;
#ifdef YYLSP_NEEDED
YYLTYPE yylloc;
#endif
#endif
YYSTYPE yyval; /* the variable used to return */
/* semantic values from the action */
/* routines */
int yylen;
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Starting parse\n");
#endif
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 - 1;
yyvsp = yyvs;
#ifdef YYLSP_NEEDED
yylsp = yyls;
#endif
/* Push a new state, which is found in yystate . */
/* In all cases, when you get here, the value and location stacks
have just been pushed. so pushing a state here evens the stacks. */
yynewstate:
*++yyssp = yystate;
if (yyssp >= yyss + yystacksize - 1)
{
/* Give user a chance to reallocate the stack */
/* Use copies of these so that the &'s don't force the real ones into memory. */
YYSTYPE *yyvs1 = yyvs;
short *yyss1 = yyss;
#ifdef YYLSP_NEEDED
YYLTYPE *yyls1 = yyls;
#endif
/* Get the current used size of the three stacks, in elements. */
int size = yyssp - yyss + 1;
#ifdef yyoverflow
/* Each stack pointer address is followed by the size of
the data in use in that stack, in bytes. */
#ifdef YYLSP_NEEDED
/* This used to be a conditional around just the two extra args,
but that might be undefined if yyoverflow is a macro. */
yyoverflow("parser stack overflow",
&yyss1, size * sizeof (*yyssp),
&yyvs1, size * sizeof (*yyvsp),
&yyls1, size * sizeof (*yylsp),
&yystacksize);
#else
yyoverflow("parser stack overflow",
&yyss1, size * sizeof (*yyssp),
&yyvs1, size * sizeof (*yyvsp),
&yystacksize);
#endif
yyss = yyss1; yyvs = yyvs1;
#ifdef YYLSP_NEEDED
yyls = yyls1;
#endif
#else /* no yyoverflow */
/* Extend the stack our own way. */
if (yystacksize >= YYMAXDEPTH)
{
yyerror("parser stack overflow");
if (yyfree_stacks)
{
free (yyss);
free (yyvs);
#ifdef YYLSP_NEEDED
free (yyls);
#endif
}
return 2;
}
yystacksize *= 2;
if (yystacksize > YYMAXDEPTH)
yystacksize = YYMAXDEPTH;
#ifndef YYSTACK_USE_ALLOCA
yyfree_stacks = 1;
#endif
yyss = (short *) YYSTACK_ALLOC (yystacksize * sizeof (*yyssp));
__yy_memcpy ((char *)yyss, (char *)yyss1,
size * (unsigned int) sizeof (*yyssp));
yyvs = (YYSTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yyvsp));
__yy_memcpy ((char *)yyvs, (char *)yyvs1,
size * (unsigned int) sizeof (*yyvsp));
#ifdef YYLSP_NEEDED
yyls = (YYLTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yylsp));
__yy_memcpy ((char *)yyls, (char *)yyls1,
size * (unsigned int) sizeof (*yylsp));
#endif
#endif /* no yyoverflow */
yyssp = yyss + size - 1;
yyvsp = yyvs + size - 1;
#ifdef YYLSP_NEEDED
yylsp = yyls + size - 1;
#endif
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Stack size increased to %d\n", yystacksize);
#endif
if (yyssp >= yyss + yystacksize - 1)
YYABORT;
}
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Entering state %d\n", yystate);
#endif
goto yybackup;
yybackup:
/* Do appropriate processing given the current state. */
/* Read a lookahead token if we need one and don't already have one. */
/* yyresume: */
/* First try to decide what to do without reference to lookahead token. */
yyn = yypact[yystate];
if (yyn == YYFLAG)
goto yydefault;
/* Not known => get a lookahead token if don't already have one. */
/* yychar is either YYEMPTY or YYEOF
or a valid token in external form. */
if (yychar == YYEMPTY)
{
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Reading a token: ");
#endif
yychar = YYLEX;
}
/* Convert token to internal form (in yychar1) for indexing tables with */
if (yychar <= 0) /* This means end of input. */
{
yychar1 = 0;
yychar = YYEOF; /* Don't call YYLEX any more */
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Now at end of input.\n");
#endif
}
else
{
yychar1 = YYTRANSLATE(yychar);
#if YYDEBUG != 0
if (yydebug)
{
fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]);
/* Give the individual parser a way to print the precise meaning
of a token, for further debugging info. */
#ifdef YYPRINT
YYPRINT (stderr, yychar, yylval);
#endif
fprintf (stderr, ")\n");
}
#endif
}
yyn += yychar1;
if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1)
goto yydefault;
yyn = yytable[yyn];
/* yyn is what to do for this token type in this state.
Negative => reduce, -yyn is rule number.
Positive => shift, yyn is new state.
New state is final state => don't bother to shift,
just return success.
0, or most negative number => error. */
if (yyn < 0)
{
if (yyn == YYFLAG)
goto yyerrlab;
yyn = -yyn;
goto yyreduce;
}
else if (yyn == 0)
goto yyerrlab;
if (yyn == YYFINAL)
YYACCEPT;
/* Shift the lookahead token. */
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]);
#endif
/* Discard the token being shifted unless it is eof. */
if (yychar != YYEOF)
yychar = YYEMPTY;
*++yyvsp = yylval;
#ifdef YYLSP_NEEDED
*++yylsp = yylloc;
#endif
/* count tokens shifted since error; after three, turn off error status. */
if (yyerrstatus) yyerrstatus--;
yystate = yyn;
goto yynewstate;
/* Do the default action for the current state. */
yydefault:
yyn = yydefact[yystate];
if (yyn == 0)
goto yyerrlab;
/* Do a reduction. yyn is the number of a rule to reduce with. */
yyreduce:
yylen = yyr2[yyn];
if (yylen > 0)
yyval = yyvsp[1-yylen]; /* implement default value of the action */
#if YYDEBUG != 0
if (yydebug)
{
int i;
fprintf (stderr, "Reducing via rule %d (line %d), ",
yyn, yyrline[yyn]);
/* Print the symbols being reduced, and their result. */
for (i = yyprhs[yyn]; yyrhs[i] > 0; i++)
fprintf (stderr, "%s ", yytname[yyrhs[i]]);
fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]);
}
#endif
switch (yyn) {
case 2:
#line 1032 "/Users/sabre/cvs/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 30:
#line 1048 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.IPredicate = ICmpInst::ICMP_EQ; ;
break;}
case 31:
#line 1048 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.IPredicate = ICmpInst::ICMP_NE; ;
break;}
case 32:
#line 1049 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.IPredicate = ICmpInst::ICMP_SLT; ;
break;}
case 33:
#line 1049 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.IPredicate = ICmpInst::ICMP_SGT; ;
break;}
case 34:
#line 1050 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.IPredicate = ICmpInst::ICMP_SLE; ;
break;}
case 35:
#line 1050 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.IPredicate = ICmpInst::ICMP_SGE; ;
break;}
case 36:
#line 1051 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.IPredicate = ICmpInst::ICMP_ULT; ;
break;}
case 37:
#line 1051 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.IPredicate = ICmpInst::ICMP_UGT; ;
break;}
case 38:
#line 1052 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.IPredicate = ICmpInst::ICMP_ULE; ;
break;}
case 39:
#line 1052 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.IPredicate = ICmpInst::ICMP_UGE; ;
break;}
case 40:
#line 1056 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.FPredicate = FCmpInst::FCMP_OEQ; ;
break;}
case 41:
#line 1056 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.FPredicate = FCmpInst::FCMP_ONE; ;
break;}
case 42:
#line 1057 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.FPredicate = FCmpInst::FCMP_OLT; ;
break;}
case 43:
#line 1057 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.FPredicate = FCmpInst::FCMP_OGT; ;
break;}
case 44:
#line 1058 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.FPredicate = FCmpInst::FCMP_OLE; ;
break;}
case 45:
#line 1058 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.FPredicate = FCmpInst::FCMP_OGE; ;
break;}
case 46:
#line 1059 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.FPredicate = FCmpInst::FCMP_ORD; ;
break;}
case 47:
#line 1059 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.FPredicate = FCmpInst::FCMP_UNO; ;
break;}
case 48:
#line 1060 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.FPredicate = FCmpInst::FCMP_UEQ; ;
break;}
case 49:
#line 1060 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.FPredicate = FCmpInst::FCMP_UNE; ;
break;}
case 50:
#line 1061 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.FPredicate = FCmpInst::FCMP_ULT; ;
break;}
case 51:
#line 1061 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.FPredicate = FCmpInst::FCMP_UGT; ;
break;}
case 52:
#line 1062 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.FPredicate = FCmpInst::FCMP_ULE; ;
break;}
case 53:
#line 1062 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.FPredicate = FCmpInst::FCMP_UGE; ;
break;}
case 54:
#line 1063 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.FPredicate = FCmpInst::FCMP_TRUE; ;
break;}
case 55:
#line 1064 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.FPredicate = FCmpInst::FCMP_FALSE; ;
break;}
case 59:
#line 1073 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.StrVal = yyvsp[-1].StrVal;
CHECK_FOR_ERROR
;
break;}
case 60:
#line 1077 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.StrVal = 0;
CHECK_FOR_ERROR
;
break;}
case 61:
#line 1083 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Linkage = GlobalValue::InternalLinkage; ;
break;}
case 62:
#line 1084 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Linkage = GlobalValue::WeakLinkage; ;
break;}
case 63:
#line 1085 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Linkage = GlobalValue::LinkOnceLinkage; ;
break;}
case 64:
#line 1086 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Linkage = GlobalValue::AppendingLinkage; ;
break;}
case 65:
#line 1087 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Linkage = GlobalValue::DLLExportLinkage; ;
break;}
case 66:
#line 1091 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Linkage = GlobalValue::DLLImportLinkage; ;
break;}
case 67:
#line 1092 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Linkage = GlobalValue::ExternalWeakLinkage; ;
break;}
case 68:
#line 1093 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Linkage = GlobalValue::ExternalLinkage; ;
break;}
case 69:
#line 1097 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Visibility = GlobalValue::DefaultVisibility; ;
break;}
case 70:
#line 1098 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Visibility = GlobalValue::HiddenVisibility; ;
break;}
case 71:
#line 1102 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Linkage = GlobalValue::ExternalLinkage; ;
break;}
case 72:
#line 1103 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Linkage = GlobalValue::DLLImportLinkage; ;
break;}
case 73:
#line 1104 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Linkage = GlobalValue::ExternalWeakLinkage; ;
break;}
case 74:
#line 1108 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Linkage = GlobalValue::ExternalLinkage; ;
break;}
case 75:
#line 1109 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Linkage = GlobalValue::InternalLinkage; ;
break;}
case 76:
#line 1110 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Linkage = GlobalValue::LinkOnceLinkage; ;
break;}
case 77:
#line 1111 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Linkage = GlobalValue::WeakLinkage; ;
break;}
case 78:
#line 1112 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Linkage = GlobalValue::DLLExportLinkage; ;
break;}
case 79:
#line 1115 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.UIntVal = CallingConv::C; ;
break;}
case 80:
#line 1116 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.UIntVal = CallingConv::C; ;
break;}
case 81:
#line 1117 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.UIntVal = CallingConv::CSRet; ;
break;}
case 82:
#line 1118 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.UIntVal = CallingConv::Fast; ;
break;}
case 83:
#line 1119 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.UIntVal = CallingConv::Cold; ;
break;}
case 84:
#line 1120 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.UIntVal = CallingConv::X86_StdCall; ;
break;}
case 85:
#line 1121 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.UIntVal = CallingConv::X86_FastCall; ;
break;}
case 86:
#line 1122 "/Users/sabre/cvs/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 87:
#line 1129 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.ParamAttrs = FunctionType::ZExtAttribute; ;
break;}
case 88:
#line 1130 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.ParamAttrs = FunctionType::SExtAttribute; ;
break;}
case 89:
#line 1133 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.ParamAttrs = FunctionType::NoAttributeSet; ;
break;}
case 90:
#line 1134 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.ParamAttrs = FunctionType::ParameterAttributes(yyvsp[-1].ParamAttrs | yyvsp[0].ParamAttrs);
;
break;}
case 91:
#line 1139 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.ParamAttrs = FunctionType::NoReturnAttribute; ;
break;}
case 93:
#line 1143 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.ParamAttrs = FunctionType::NoAttributeSet; ;
break;}
case 94:
#line 1144 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.ParamAttrs = FunctionType::ParameterAttributes(yyvsp[-1].ParamAttrs | yyvsp[0].ParamAttrs);
;
break;}
case 95:
#line 1151 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.UIntVal = 0; ;
break;}
case 96:
#line 1152 "/Users/sabre/cvs/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 97:
#line 1158 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.UIntVal = 0; ;
break;}
case 98:
#line 1159 "/Users/sabre/cvs/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 99:
#line 1167 "/Users/sabre/cvs/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 100:
#line 1175 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.StrVal = 0; ;
break;}
case 101:
#line 1176 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.StrVal = yyvsp[0].StrVal; ;
break;}
case 102:
#line 1181 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{;
break;}
case 103:
#line 1182 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{;
break;}
case 104:
#line 1183 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
CurGV->setSection(yyvsp[0].StrVal);
free(yyvsp[0].StrVal);
CHECK_FOR_ERROR
;
break;}
case 105:
#line 1188 "/Users/sabre/cvs/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 110:
#line 1204 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.TypeVal = new PATypeHolder(OpaqueType::get());
CHECK_FOR_ERROR
;
break;}
case 111:
#line 1208 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.TypeVal = new PATypeHolder(yyvsp[0].PrimType);
CHECK_FOR_ERROR
;
break;}
case 112:
#line 1212 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Pointer type?
if (*yyvsp[-1].TypeVal == Type::LabelTy)
GEN_ERROR("Cannot form a pointer to a basic block");
yyval.TypeVal = new PATypeHolder(HandleUpRefs(PointerType::get(*yyvsp[-1].TypeVal)));
delete yyvsp[-1].TypeVal;
CHECK_FOR_ERROR
;
break;}
case 113:
#line 1219 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Named types are also simple types...
const Type* tmp = getTypeVal(yyvsp[0].ValIDVal);
CHECK_FOR_ERROR
yyval.TypeVal = new PATypeHolder(tmp);
;
break;}
case 114:
#line 1224 "/Users/sabre/cvs/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 115:
#line 1232 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
std::vector<const Type*> Params;
std::vector<FunctionType::ParameterAttributes> Attrs;
Attrs.push_back(yyvsp[0].ParamAttrs);
for (TypeWithAttrsList::iterator I=yyvsp[-2].TypeWithAttrsList->begin(), E=yyvsp[-2].TypeWithAttrsList->end(); I != E; ++I) {
Params.push_back(I->Ty->get());
if (I->Ty->get() != Type::VoidTy)
Attrs.push_back(I->Attrs);
}
bool isVarArg = Params.size() && Params.back() == Type::VoidTy;
if (isVarArg) Params.pop_back();
FunctionType *FT = FunctionType::get(*yyvsp[-4].TypeVal, Params, isVarArg, Attrs);
delete yyvsp[-2].TypeWithAttrsList; // Delete the argument list
delete yyvsp[-4].TypeVal; // Delete the return type handle
yyval.TypeVal = new PATypeHolder(HandleUpRefs(FT));
CHECK_FOR_ERROR
;
break;}
case 116:
#line 1250 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
std::vector<const Type*> Params;
std::vector<FunctionType::ParameterAttributes> Attrs;
Attrs.push_back(yyvsp[0].ParamAttrs);
for (TypeWithAttrsList::iterator I=yyvsp[-2].TypeWithAttrsList->begin(), E=yyvsp[-2].TypeWithAttrsList->end(); I != E; ++I) {
Params.push_back(I->Ty->get());
if (I->Ty->get() != Type::VoidTy)
Attrs.push_back(I->Attrs);
}
bool isVarArg = Params.size() && Params.back() == Type::VoidTy;
if (isVarArg) Params.pop_back();
FunctionType *FT = FunctionType::get(yyvsp[-4].PrimType, Params, isVarArg, Attrs);
delete yyvsp[-2].TypeWithAttrsList; // Delete the argument list
yyval.TypeVal = new PATypeHolder(HandleUpRefs(FT));
CHECK_FOR_ERROR
;
break;}
case 117:
#line 1268 "/Users/sabre/cvs/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 118:
#line 1273 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Packed array type?
const llvm::Type* ElemTy = yyvsp[-1].TypeVal->get();
if ((unsigned)yyvsp[-3].UInt64Val != yyvsp[-3].UInt64Val)
GEN_ERROR("Unsigned result not equal to signed result");
if (!ElemTy->isFloatingPoint() && !ElemTy->isIntegral())
GEN_ERROR("Element type of a PackedType must be primitive");
if (!isPowerOf2_32(yyvsp[-3].UInt64Val))
GEN_ERROR("Vector length should be a power of 2!");
yyval.TypeVal = new PATypeHolder(HandleUpRefs(PackedType::get(*yyvsp[-1].TypeVal, (unsigned)yyvsp[-3].UInt64Val)));
delete yyvsp[-1].TypeVal;
CHECK_FOR_ERROR
;
break;}
case 119:
#line 1285 "/Users/sabre/cvs/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 120:
#line 1295 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Empty structure type?
yyval.TypeVal = new PATypeHolder(StructType::get(std::vector<const Type*>()));
CHECK_FOR_ERROR
;
break;}
case 121:
#line 1299 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
std::vector<const Type*> Elements;
for (std::list<llvm::PATypeHolder>::iterator I = yyvsp[-2].TypeList->begin(),
E = yyvsp[-2].TypeList->end(); I != E; ++I)
Elements.push_back(*I);
yyval.TypeVal = new PATypeHolder(HandleUpRefs(StructType::get(Elements, true)));
delete yyvsp[-2].TypeList;
CHECK_FOR_ERROR
;
break;}
case 122:
#line 1309 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Empty structure type?
yyval.TypeVal = new PATypeHolder(StructType::get(std::vector<const Type*>(), true));
CHECK_FOR_ERROR
;
break;}
case 123:
#line 1316 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.TypeWithAttrs.Ty = yyvsp[-1].TypeVal;
yyval.TypeWithAttrs.Attrs = yyvsp[0].ParamAttrs;
;
break;}
case 124:
#line 1323 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[0].TypeVal)->getDescription());
if (!(*yyvsp[0].TypeVal)->isFirstClassType())
GEN_ERROR("LLVM functions cannot return aggregate types!");
yyval.TypeVal = yyvsp[0].TypeVal;
;
break;}
case 125:
#line 1330 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.TypeVal = new PATypeHolder(Type::VoidTy);
;
break;}
case 126:
#line 1335 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.TypeWithAttrsList = new TypeWithAttrsList();
yyval.TypeWithAttrsList->push_back(yyvsp[0].TypeWithAttrs);
CHECK_FOR_ERROR
;
break;}
case 127:
#line 1340 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
(yyval.TypeWithAttrsList=yyvsp[-2].TypeWithAttrsList)->push_back(yyvsp[0].TypeWithAttrs);
CHECK_FOR_ERROR
;
break;}
case 129:
#line 1348 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.TypeWithAttrsList=yyvsp[-2].TypeWithAttrsList;
TypeWithAttrs TWA; TWA.Attrs = FunctionType::NoAttributeSet;
TWA.Ty = new PATypeHolder(Type::VoidTy);
yyval.TypeWithAttrsList->push_back(TWA);
CHECK_FOR_ERROR
;
break;}
case 130:
#line 1355 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.TypeWithAttrsList = new TypeWithAttrsList;
TypeWithAttrs TWA; TWA.Attrs = FunctionType::NoAttributeSet;
TWA.Ty = new PATypeHolder(Type::VoidTy);
yyval.TypeWithAttrsList->push_back(TWA);
CHECK_FOR_ERROR
;
break;}
case 131:
#line 1362 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.TypeWithAttrsList = new TypeWithAttrsList();
CHECK_FOR_ERROR
;
break;}
case 132:
#line 1370 "/Users/sabre/cvs/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 133:
#line 1375 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
(yyval.TypeList=yyvsp[-2].TypeList)->push_back(*yyvsp[0].TypeVal); delete yyvsp[0].TypeVal;
CHECK_FOR_ERROR
;
break;}
case 134:
#line 1386 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Nonempty unsized arr
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-3].TypeVal)->getDescription());
const ArrayType *ATy = dyn_cast<ArrayType>(yyvsp[-3].TypeVal->get());
if (ATy == 0)
GEN_ERROR("Cannot make array constant with type: '" +
(*yyvsp[-3].TypeVal)->getDescription() + "'!");
const Type *ETy = ATy->getElementType();
int NumElements = ATy->getNumElements();
// Verify that we have the correct size...
if (NumElements != -1 && NumElements != (int)yyvsp[-1].ConstVector->size())
GEN_ERROR("Type mismatch: constant sized array initialized with " +
utostr(yyvsp[-1].ConstVector->size()) + " arguments, but has size of " +
itostr(NumElements) + "!");
// Verify all elements are correct type!
for (unsigned i = 0; i < yyvsp[-1].ConstVector->size(); i++) {
if (ETy != (*yyvsp[-1].ConstVector)[i]->getType())
GEN_ERROR("Element #" + utostr(i) + " is not of type '" +
ETy->getDescription() +"' as required!\nIt is of type '"+
(*yyvsp[-1].ConstVector)[i]->getType()->getDescription() + "'.");
}
yyval.ConstVal = ConstantArray::get(ATy, *yyvsp[-1].ConstVector);
delete yyvsp[-3].TypeVal; delete yyvsp[-1].ConstVector;
CHECK_FOR_ERROR
;
break;}
case 135:
#line 1414 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-2].TypeVal)->getDescription());
const ArrayType *ATy = dyn_cast<ArrayType>(yyvsp[-2].TypeVal->get());
if (ATy == 0)
GEN_ERROR("Cannot make array constant with type: '" +
(*yyvsp[-2].TypeVal)->getDescription() + "'!");
int NumElements = ATy->getNumElements();
if (NumElements != -1 && NumElements != 0)
GEN_ERROR("Type mismatch: constant sized array initialized with 0"
" arguments, but has size of " + itostr(NumElements) +"!");
yyval.ConstVal = ConstantArray::get(ATy, std::vector<Constant*>());
delete yyvsp[-2].TypeVal;
CHECK_FOR_ERROR
;
break;}
case 136:
#line 1430 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-2].TypeVal)->getDescription());
const ArrayType *ATy = dyn_cast<ArrayType>(yyvsp[-2].TypeVal->get());
if (ATy == 0)
GEN_ERROR("Cannot make array constant with type: '" +
(*yyvsp[-2].TypeVal)->getDescription() + "'!");
int NumElements = ATy->getNumElements();
const Type *ETy = ATy->getElementType();
char *EndStr = UnEscapeLexed(yyvsp[0].StrVal, true);
if (NumElements != -1 && NumElements != (EndStr-yyvsp[0].StrVal))
GEN_ERROR("Can't build string constant of size " +
itostr((int)(EndStr-yyvsp[0].StrVal)) +
" when array has size " + itostr(NumElements) + "!");
std::vector<Constant*> Vals;
if (ETy == Type::Int8Ty) {
for (unsigned char *C = (unsigned char *)yyvsp[0].StrVal;
C != (unsigned char*)EndStr; ++C)
Vals.push_back(ConstantInt::get(ETy, *C));
} else {
free(yyvsp[0].StrVal);
GEN_ERROR("Cannot build string arrays of non byte sized elements!");
}
free(yyvsp[0].StrVal);
yyval.ConstVal = ConstantArray::get(ATy, Vals);
delete yyvsp[-2].TypeVal;
CHECK_FOR_ERROR
;
break;}
case 137:
#line 1459 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Nonempty unsized arr
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-3].TypeVal)->getDescription());
const PackedType *PTy = dyn_cast<PackedType>(yyvsp[-3].TypeVal->get());
if (PTy == 0)
GEN_ERROR("Cannot make packed constant with type: '" +
(*yyvsp[-3].TypeVal)->getDescription() + "'!");
const Type *ETy = PTy->getElementType();
int NumElements = PTy->getNumElements();
// Verify that we have the correct size...
if (NumElements != -1 && NumElements != (int)yyvsp[-1].ConstVector->size())
GEN_ERROR("Type mismatch: constant sized packed initialized with " +
utostr(yyvsp[-1].ConstVector->size()) + " arguments, but has size of " +
itostr(NumElements) + "!");
// Verify all elements are correct type!
for (unsigned i = 0; i < yyvsp[-1].ConstVector->size(); i++) {
if (ETy != (*yyvsp[-1].ConstVector)[i]->getType())
GEN_ERROR("Element #" + utostr(i) + " is not of type '" +
ETy->getDescription() +"' as required!\nIt is of type '"+
(*yyvsp[-1].ConstVector)[i]->getType()->getDescription() + "'.");
}
yyval.ConstVal = ConstantPacked::get(PTy, *yyvsp[-1].ConstVector);
delete yyvsp[-3].TypeVal; delete yyvsp[-1].ConstVector;
CHECK_FOR_ERROR
;
break;}
case 138:
#line 1487 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
const StructType *STy = dyn_cast<StructType>(yyvsp[-3].TypeVal->get());
if (STy == 0)
GEN_ERROR("Cannot make struct constant with type: '" +
(*yyvsp[-3].TypeVal)->getDescription() + "'!");
if (yyvsp[-1].ConstVector->size() != STy->getNumContainedTypes())
GEN_ERROR("Illegal number of initializers for structure type!");
// Check to ensure that constants are compatible with the type initializer!
for (unsigned i = 0, e = yyvsp[-1].ConstVector->size(); i != e; ++i)
if ((*yyvsp[-1].ConstVector)[i]->getType() != STy->getElementType(i))
GEN_ERROR("Expected type '" +
STy->getElementType(i)->getDescription() +
"' for element #" + utostr(i) +
" of structure initializer!");
// Check to ensure that Type is not packed
if (STy->isPacked())
GEN_ERROR("Unpacked Initializer to packed type '" + STy->getDescription() + "'");
yyval.ConstVal = ConstantStruct::get(STy, *yyvsp[-1].ConstVector);
delete yyvsp[-3].TypeVal; delete yyvsp[-1].ConstVector;
CHECK_FOR_ERROR
;
break;}
case 139:
#line 1512 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-2].TypeVal)->getDescription());
const StructType *STy = dyn_cast<StructType>(yyvsp[-2].TypeVal->get());
if (STy == 0)
GEN_ERROR("Cannot make struct constant with type: '" +
(*yyvsp[-2].TypeVal)->getDescription() + "'!");
if (STy->getNumContainedTypes() != 0)
GEN_ERROR("Illegal number of initializers for structure type!");
// Check to ensure that Type is not packed
if (STy->isPacked())
GEN_ERROR("Unpacked Initializer to packed type '" + STy->getDescription() + "'");
yyval.ConstVal = ConstantStruct::get(STy, std::vector<Constant*>());
delete yyvsp[-2].TypeVal;
CHECK_FOR_ERROR
;
break;}
case 140:
#line 1531 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
const StructType *STy = dyn_cast<StructType>(yyvsp[-5].TypeVal->get());
if (STy == 0)
GEN_ERROR("Cannot make struct constant with type: '" +
(*yyvsp[-5].TypeVal)->getDescription() + "'!");
if (yyvsp[-2].ConstVector->size() != STy->getNumContainedTypes())
GEN_ERROR("Illegal number of initializers for structure type!");
// Check to ensure that constants are compatible with the type initializer!
for (unsigned i = 0, e = yyvsp[-2].ConstVector->size(); i != e; ++i)
if ((*yyvsp[-2].ConstVector)[i]->getType() != STy->getElementType(i))
GEN_ERROR("Expected type '" +
STy->getElementType(i)->getDescription() +
"' for element #" + utostr(i) +
" of structure initializer!");
// Check to ensure that Type is packed
if (!STy->isPacked())
GEN_ERROR("Packed Initializer to unpacked type '" + STy->getDescription() + "'");
yyval.ConstVal = ConstantStruct::get(STy, *yyvsp[-2].ConstVector);
delete yyvsp[-5].TypeVal; delete yyvsp[-2].ConstVector;
CHECK_FOR_ERROR
;
break;}
case 141:
#line 1556 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-4].TypeVal)->getDescription());
const StructType *STy = dyn_cast<StructType>(yyvsp[-4].TypeVal->get());
if (STy == 0)
GEN_ERROR("Cannot make struct constant with type: '" +
(*yyvsp[-4].TypeVal)->getDescription() + "'!");
if (STy->getNumContainedTypes() != 0)
GEN_ERROR("Illegal number of initializers for structure type!");
// Check to ensure that Type is packed
if (!STy->isPacked())
GEN_ERROR("Packed Initializer to unpacked type '" + STy->getDescription() + "'");
yyval.ConstVal = ConstantStruct::get(STy, std::vector<Constant*>());
delete yyvsp[-4].TypeVal;
CHECK_FOR_ERROR
;
break;}
case 142:
#line 1575 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription());
const PointerType *PTy = dyn_cast<PointerType>(yyvsp[-1].TypeVal->get());
if (PTy == 0)
GEN_ERROR("Cannot make null pointer constant with type: '" +
(*yyvsp[-1].TypeVal)->getDescription() + "'!");
yyval.ConstVal = ConstantPointerNull::get(PTy);
delete yyvsp[-1].TypeVal;
CHECK_FOR_ERROR
;
break;}
case 143:
#line 1587 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription());
yyval.ConstVal = UndefValue::get(yyvsp[-1].TypeVal->get());
delete yyvsp[-1].TypeVal;
CHECK_FOR_ERROR
;
break;}
case 144:
#line 1594 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription());
const PointerType *Ty = dyn_cast<PointerType>(yyvsp[-1].TypeVal->get());
if (Ty == 0)
GEN_ERROR("Global const reference must be a pointer type!");
// ConstExprs can exist in the body of a function, thus creating
// GlobalValues whenever they refer to a variable. Because we are in
// the context of a function, getValNonImprovising will search the functions
// symbol table instead of the module symbol table for the global symbol,
// which throws things all off. To get around this, we just tell
// getValNonImprovising that we are at global scope here.
//
Function *SavedCurFn = CurFun.CurrentFunction;
CurFun.CurrentFunction = 0;
Value *V = getValNonImprovising(Ty, yyvsp[0].ValIDVal);
CHECK_FOR_ERROR
CurFun.CurrentFunction = SavedCurFn;
// If this is an initializer for a constant pointer, which is referencing a
// (currently) undefined variable, create a stub now that shall be replaced
// in the future with the right type of variable.
//
if (V == 0) {
assert(isa<PointerType>(Ty) && "Globals may only be used as pointers!");
const PointerType *PT = cast<PointerType>(Ty);
// First check to see if the forward references value is already created!
PerModuleInfo::GlobalRefsType::iterator I =
CurModule.GlobalRefs.find(std::make_pair(PT, yyvsp[0].ValIDVal));
if (I != CurModule.GlobalRefs.end()) {
V = I->second; // Placeholder already exists, use it...
yyvsp[0].ValIDVal.destroy();
} else {
std::string Name;
if (yyvsp[0].ValIDVal.Type == ValID::NameVal) Name = yyvsp[0].ValIDVal.Name;
// Create the forward referenced global.
GlobalValue *GV;
if (const FunctionType *FTy =
dyn_cast<FunctionType>(PT->getElementType())) {
GV = new Function(FTy, GlobalValue::ExternalLinkage, Name,
CurModule.CurrentModule);
} else {
GV = new GlobalVariable(PT->getElementType(), false,
GlobalValue::ExternalLinkage, 0,
Name, CurModule.CurrentModule);
}
// Keep track of the fact that we have a forward ref to recycle it
CurModule.GlobalRefs.insert(std::make_pair(std::make_pair(PT, yyvsp[0].ValIDVal), GV));
V = GV;
}
}
yyval.ConstVal = cast<GlobalValue>(V);
delete yyvsp[-1].TypeVal; // Free the type handle
CHECK_FOR_ERROR
;
break;}
case 145:
#line 1657 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription());
if (yyvsp[-1].TypeVal->get() != yyvsp[0].ConstVal->getType())
GEN_ERROR("Mismatched types for constant expression: " +
(*yyvsp[-1].TypeVal)->getDescription() + " and " + yyvsp[0].ConstVal->getType()->getDescription());
yyval.ConstVal = yyvsp[0].ConstVal;
delete yyvsp[-1].TypeVal;
CHECK_FOR_ERROR
;
break;}
case 146:
#line 1667 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription());
const Type *Ty = yyvsp[-1].TypeVal->get();
if (isa<FunctionType>(Ty) || Ty == Type::LabelTy || isa<OpaqueType>(Ty))
GEN_ERROR("Cannot create a null initialized value of this type!");
yyval.ConstVal = Constant::getNullValue(Ty);
delete yyvsp[-1].TypeVal;
CHECK_FOR_ERROR
;
break;}
case 147:
#line 1677 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ // integral constants
if (!ConstantInt::isValueValidForType(yyvsp[-1].PrimType, yyvsp[0].SInt64Val))
GEN_ERROR("Constant value doesn't fit in type!");
yyval.ConstVal = ConstantInt::get(yyvsp[-1].PrimType, yyvsp[0].SInt64Val);
CHECK_FOR_ERROR
;
break;}
case 148:
#line 1683 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ // integral constants
if (!ConstantInt::isValueValidForType(yyvsp[-1].PrimType, yyvsp[0].UInt64Val))
GEN_ERROR("Constant value doesn't fit in type!");
yyval.ConstVal = ConstantInt::get(yyvsp[-1].PrimType, yyvsp[0].UInt64Val);
CHECK_FOR_ERROR
;
break;}
case 149:
#line 1689 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Boolean constants
assert(cast<IntegerType>(yyvsp[-1].PrimType)->getBitWidth() == 1 && "Not Bool?");
yyval.ConstVal = ConstantInt::getTrue();
CHECK_FOR_ERROR
;
break;}
case 150:
#line 1694 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Boolean constants
assert(cast<IntegerType>(yyvsp[-1].PrimType)->getBitWidth() == 1 && "Not Bool?");
yyval.ConstVal = ConstantInt::getFalse();
CHECK_FOR_ERROR
;
break;}
case 151:
#line 1699 "/Users/sabre/cvs/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 152:
#line 1707 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription());
Constant *Val = yyvsp[-3].ConstVal;
const Type *Ty = yyvsp[-1].TypeVal->get();
if (!Val->getType()->isFirstClassType())
GEN_ERROR("cast constant expression from a non-primitive type: '" +
Val->getType()->getDescription() + "'!");
if (!Ty->isFirstClassType())
GEN_ERROR("cast constant expression to a non-primitive type: '" +
Ty->getDescription() + "'!");
yyval.ConstVal = ConstantExpr::getCast(yyvsp[-5].CastOpVal, yyvsp[-3].ConstVal, yyvsp[-1].TypeVal->get());
delete yyvsp[-1].TypeVal;
;
break;}
case 153:
#line 1721 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!isa<PointerType>(yyvsp[-2].ConstVal->getType()))
GEN_ERROR("GetElementPtr requires a pointer operand!");
const Type *IdxTy =
GetElementPtrInst::getIndexedType(yyvsp[-2].ConstVal->getType(), *yyvsp[-1].ValueList, true);
if (!IdxTy)
GEN_ERROR("Index list invalid for constant getelementptr!");
std::vector<Constant*> IdxVec;
for (unsigned i = 0, e = yyvsp[-1].ValueList->size(); i != e; ++i)
if (Constant *C = dyn_cast<Constant>((*yyvsp[-1].ValueList)[i]))
IdxVec.push_back(C);
else
GEN_ERROR("Indices to constant getelementptr must be constants!");
delete yyvsp[-1].ValueList;
yyval.ConstVal = ConstantExpr::getGetElementPtr(yyvsp[-2].ConstVal, IdxVec);
CHECK_FOR_ERROR
;
break;}
case 154:
#line 1742 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (yyvsp[-5].ConstVal->getType() != Type::Int1Ty)
GEN_ERROR("Select condition must be of boolean type!");
if (yyvsp[-3].ConstVal->getType() != yyvsp[-1].ConstVal->getType())
GEN_ERROR("Select operand types must match!");
yyval.ConstVal = ConstantExpr::getSelect(yyvsp[-5].ConstVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal);
CHECK_FOR_ERROR
;
break;}
case 155:
#line 1750 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (yyvsp[-3].ConstVal->getType() != yyvsp[-1].ConstVal->getType())
GEN_ERROR("Binary operator types must match!");
CHECK_FOR_ERROR;
yyval.ConstVal = ConstantExpr::get(yyvsp[-5].BinaryOpVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal);
;
break;}
case 156:
#line 1756 "/Users/sabre/cvs/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 157:
#line 1767 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (yyvsp[-3].ConstVal->getType() != yyvsp[-1].ConstVal->getType())
GEN_ERROR("icmp operand types must match!");
yyval.ConstVal = ConstantExpr::getICmp(yyvsp[-5].IPredicate, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal);
;
break;}
case 158:
#line 1772 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (yyvsp[-3].ConstVal->getType() != yyvsp[-1].ConstVal->getType())
GEN_ERROR("fcmp operand types must match!");
yyval.ConstVal = ConstantExpr::getFCmp(yyvsp[-5].FPredicate, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal);
;
break;}
case 159:
#line 1777 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (yyvsp[-1].ConstVal->getType() != Type::Int8Ty)
GEN_ERROR("Shift count for shift constant must be i8 type!");
if (!yyvsp[-3].ConstVal->getType()->isIntegral())
GEN_ERROR("Shift constant expression requires integer operand!");
CHECK_FOR_ERROR;
yyval.ConstVal = ConstantExpr::get(yyvsp[-5].OtherOpVal, yyvsp[-3].ConstVal, yyvsp[-1].ConstVal);
CHECK_FOR_ERROR
;
break;}
case 160:
#line 1786 "/Users/sabre/cvs/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 161:
#line 1792 "/Users/sabre/cvs/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 162:
#line 1798 "/Users/sabre/cvs/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 163:
#line 1807 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
(yyval.ConstVector = yyvsp[-2].ConstVector)->push_back(yyvsp[0].ConstVal);
CHECK_FOR_ERROR
;
break;}
case 164:
#line 1811 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.ConstVector = new std::vector<Constant*>();
yyval.ConstVector->push_back(yyvsp[0].ConstVal);
CHECK_FOR_ERROR
;
break;}
case 165:
#line 1819 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.BoolVal = false; ;
break;}
case 166:
#line 1819 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.BoolVal = true; ;
break;}
case 167:
#line 1830 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.ModuleVal = ParserResult = CurModule.CurrentModule;
CurModule.ModuleDone();
CHECK_FOR_ERROR;
;
break;}
case 168:
#line 1835 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.ModuleVal = ParserResult = CurModule.CurrentModule;
CurModule.ModuleDone();
CHECK_FOR_ERROR;
;
break;}
case 171:
#line 1848 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ CurFun.isDeclare = false ;
break;}
case 172:
#line 1848 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
CurFun.FunctionDone();
CHECK_FOR_ERROR
;
break;}
case 173:
#line 1852 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ CurFun.isDeclare = true; ;
break;}
case 174:
#line 1852 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
CHECK_FOR_ERROR
;
break;}
case 175:
#line 1855 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
CHECK_FOR_ERROR
;
break;}
case 176:
#line 1858 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
// Emit an error if there are any unresolved types left.
if (!CurModule.LateResolveTypes.empty()) {
const ValID &DID = CurModule.LateResolveTypes.begin()->first;
if (DID.Type == ValID::NameVal) {
GEN_ERROR("Reference to an undefined type: '"+DID.getName() + "'");
} else {
GEN_ERROR("Reference to an undefined type: #" + itostr(DID.Num));
}
}
CHECK_FOR_ERROR
;
break;}
case 177:
#line 1870 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[0].TypeVal)->getDescription());
// Eagerly resolve types. This is not an optimization, this is a
// requirement that is due to the fact that we could have this:
//
// %list = type { %list * }
// %list = type { %list * } ; repeated type decl
//
// If types are not resolved eagerly, then the two types will not be
// determined to be the same type!
//
ResolveTypeTo(yyvsp[-2].StrVal, *yyvsp[0].TypeVal);
if (!setTypeName(*yyvsp[0].TypeVal, yyvsp[-2].StrVal) && !yyvsp[-2].StrVal) {
CHECK_FOR_ERROR
// If this is a named type that is not a redefinition, add it to the slot
// table.
CurModule.Types.push_back(*yyvsp[0].TypeVal);
}
delete yyvsp[0].TypeVal;
CHECK_FOR_ERROR
;
break;}
case 178:
#line 1894 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
ResolveTypeTo(yyvsp[-2].StrVal, yyvsp[0].PrimType);
if (!setTypeName(yyvsp[0].PrimType, yyvsp[-2].StrVal) && !yyvsp[-2].StrVal) {
CHECK_FOR_ERROR
// If this is a named type that is not a redefinition, add it to the slot
// table.
CurModule.Types.push_back(yyvsp[0].PrimType);
}
CHECK_FOR_ERROR
;
break;}
case 179:
#line 1905 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ /* "Externally Visible" Linkage */
if (yyvsp[0].ConstVal == 0)
GEN_ERROR("Global value initializer is not a constant!");
CurGV = ParseGlobalVariable(yyvsp[-3].StrVal, GlobalValue::ExternalLinkage,
yyvsp[-2].Visibility, yyvsp[-1].BoolVal, yyvsp[0].ConstVal->getType(), yyvsp[0].ConstVal);
CHECK_FOR_ERROR
;
break;}
case 180:
#line 1911 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
CurGV = 0;
;
break;}
case 181:
#line 1914 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (yyvsp[0].ConstVal == 0)
GEN_ERROR("Global value initializer is not a constant!");
CurGV = ParseGlobalVariable(yyvsp[-4].StrVal, yyvsp[-3].Linkage, yyvsp[-2].Visibility, yyvsp[-1].BoolVal, yyvsp[0].ConstVal->getType(), yyvsp[0].ConstVal);
CHECK_FOR_ERROR
;
break;}
case 182:
#line 1919 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
CurGV = 0;
;
break;}
case 183:
#line 1922 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[0].TypeVal)->getDescription());
CurGV = ParseGlobalVariable(yyvsp[-4].StrVal, yyvsp[-3].Linkage, yyvsp[-2].Visibility, yyvsp[-1].BoolVal, *yyvsp[0].TypeVal, 0);
CHECK_FOR_ERROR
delete yyvsp[0].TypeVal;
;
break;}
case 184:
#line 1928 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
CurGV = 0;
CHECK_FOR_ERROR
;
break;}
case 185:
#line 1932 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
CHECK_FOR_ERROR
;
break;}
case 186:
#line 1935 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
CHECK_FOR_ERROR
;
break;}
case 187:
#line 1941 "/Users/sabre/cvs/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 188:
#line 1954 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Endianness = Module::BigEndian; ;
break;}
case 189:
#line 1955 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.Endianness = Module::LittleEndian; ;
break;}
case 190:
#line 1957 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
CurModule.CurrentModule->setEndianness(yyvsp[0].Endianness);
CHECK_FOR_ERROR
;
break;}
case 191:
#line 1961 "/Users/sabre/cvs/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 192:
#line 1970 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
CurModule.CurrentModule->setTargetTriple(yyvsp[0].StrVal);
free(yyvsp[0].StrVal);
;
break;}
case 193:
#line 1974 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
CurModule.CurrentModule->setDataLayout(yyvsp[0].StrVal);
free(yyvsp[0].StrVal);
;
break;}
case 195:
#line 1981 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
CurModule.CurrentModule->addLibrary(yyvsp[0].StrVal);
free(yyvsp[0].StrVal);
CHECK_FOR_ERROR
;
break;}
case 196:
#line 1986 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
CurModule.CurrentModule->addLibrary(yyvsp[0].StrVal);
free(yyvsp[0].StrVal);
CHECK_FOR_ERROR
;
break;}
case 197:
#line 1991 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
CHECK_FOR_ERROR
;
break;}
case 201:
#line 2001 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.StrVal = 0; ;
break;}
case 202:
#line 2003 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-2].TypeVal)->getDescription());
if (*yyvsp[-2].TypeVal == Type::VoidTy)
GEN_ERROR("void typed arguments are invalid!");
ArgListEntry E; E.Attrs = yyvsp[-1].ParamAttrs; E.Ty = yyvsp[-2].TypeVal; E.Name = yyvsp[0].StrVal;
yyval.ArgList = yyvsp[-4].ArgList;
yyvsp[-4].ArgList->push_back(E);
CHECK_FOR_ERROR
;
break;}
case 203:
#line 2013 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-2].TypeVal)->getDescription());
if (*yyvsp[-2].TypeVal == Type::VoidTy)
GEN_ERROR("void typed arguments are invalid!");
ArgListEntry E; E.Attrs = yyvsp[-1].ParamAttrs; E.Ty = yyvsp[-2].TypeVal; E.Name = yyvsp[0].StrVal;
yyval.ArgList = new ArgListType;
yyval.ArgList->push_back(E);
CHECK_FOR_ERROR
;
break;}
case 204:
#line 2024 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.ArgList = yyvsp[0].ArgList;
CHECK_FOR_ERROR
;
break;}
case 205:
#line 2028 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.ArgList = yyvsp[-2].ArgList;
struct ArgListEntry E;
E.Ty = new PATypeHolder(Type::VoidTy);
E.Name = 0;
E.Attrs = FunctionType::NoAttributeSet;
yyval.ArgList->push_back(E);
CHECK_FOR_ERROR
;
break;}
case 206:
#line 2037 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.ArgList = new ArgListType;
struct ArgListEntry E;
E.Ty = new PATypeHolder(Type::VoidTy);
E.Name = 0;
E.Attrs = FunctionType::NoAttributeSet;
yyval.ArgList->push_back(E);
CHECK_FOR_ERROR
;
break;}
case 207:
#line 2046 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.ArgList = 0;
CHECK_FOR_ERROR
;
break;}
case 208:
#line 2052 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
UnEscapeLexed(yyvsp[-6].StrVal);
std::string FunctionName(yyvsp[-6].StrVal);
free(yyvsp[-6].StrVal); // Free strdup'd memory!
// Check the function result for abstractness if this is a define. We should
// have no abstract types at this point
if (!CurFun.isDeclare && CurModule.TypeIsUnresolved(yyvsp[-7].TypeVal))
GEN_ERROR("Reference to abstract result: "+ yyvsp[-7].TypeVal->get()->getDescription());
std::vector<const Type*> ParamTypeList;
std::vector<FunctionType::ParameterAttributes> ParamAttrs;
ParamAttrs.push_back(yyvsp[-2].ParamAttrs);
if (yyvsp[-4].ArgList) { // If there are arguments...
for (ArgListType::iterator I = yyvsp[-4].ArgList->begin(); I != yyvsp[-4].ArgList->end(); ++I) {
const Type* Ty = I->Ty->get();
if (!CurFun.isDeclare && CurModule.TypeIsUnresolved(I->Ty))
GEN_ERROR("Reference to abstract argument: " + Ty->getDescription());
ParamTypeList.push_back(Ty);
if (Ty != Type::VoidTy)
ParamAttrs.push_back(I->Attrs);
}
}
bool isVarArg = ParamTypeList.size() && ParamTypeList.back() == Type::VoidTy;
if (isVarArg) ParamTypeList.pop_back();
FunctionType *FT = FunctionType::get(*yyvsp[-7].TypeVal, ParamTypeList, isVarArg,
ParamAttrs);
const PointerType *PFT = PointerType::get(FT);
delete yyvsp[-7].TypeVal;
ValID ID;
if (!FunctionName.empty()) {
ID = ValID::create((char*)FunctionName.c_str());
} else {
ID = ValID::create((int)CurModule.Values[PFT].size());
}
Function *Fn = 0;
// See if this function was forward referenced. If so, recycle the object.
if (GlobalValue *FWRef = CurModule.GetForwardRefForGlobal(PFT, ID)) {
// Move the function to the end of the list, from whereever it was
// previously inserted.
Fn = cast<Function>(FWRef);
CurModule.CurrentModule->getFunctionList().remove(Fn);
CurModule.CurrentModule->getFunctionList().push_back(Fn);
} else if (!FunctionName.empty() && // Merge with an earlier prototype?
(Fn = CurModule.CurrentModule->getFunction(FunctionName, FT))) {
// If this is the case, either we need to be a forward decl, or it needs
// to be.
if (!CurFun.isDeclare && !Fn->isExternal())
GEN_ERROR("Redefinition of function '" + FunctionName + "'!");
// Make sure to strip off any argument names so we can't get conflicts.
if (Fn->isExternal())
for (Function::arg_iterator AI = Fn->arg_begin(), AE = Fn->arg_end();
AI != AE; ++AI)
AI->setName("");
} else { // Not already defined?
Fn = new Function(FT, GlobalValue::ExternalLinkage, FunctionName,
CurModule.CurrentModule);
InsertValue(Fn, CurModule.Values);
}
CurFun.FunctionStart(Fn);
if (CurFun.isDeclare) {
// If we have declaration, always overwrite linkage. This will allow us to
// correctly handle cases, when pointer to function is passed as argument to
// another function.
Fn->setLinkage(CurFun.Linkage);
Fn->setVisibility(CurFun.Visibility);
}
Fn->setCallingConv(yyvsp[-8].UIntVal);
Fn->setAlignment(yyvsp[0].UIntVal);
if (yyvsp[-1].StrVal) {
Fn->setSection(yyvsp[-1].StrVal);
free(yyvsp[-1].StrVal);
}
// Add all of the arguments we parsed to the function...
if (yyvsp[-4].ArgList) { // Is null if empty...
if (isVarArg) { // Nuke the last entry
assert(yyvsp[-4].ArgList->back().Ty->get() == Type::VoidTy && yyvsp[-4].ArgList->back().Name == 0&&
"Not a varargs marker!");
delete yyvsp[-4].ArgList->back().Ty;
yyvsp[-4].ArgList->pop_back(); // Delete the last entry
}
Function::arg_iterator ArgIt = Fn->arg_begin();
unsigned Idx = 1;
for (ArgListType::iterator I = yyvsp[-4].ArgList->begin(); I != yyvsp[-4].ArgList->end(); ++I, ++ArgIt) {
delete I->Ty; // Delete the typeholder...
setValueName(ArgIt, I->Name); // Insert arg into symtab...
CHECK_FOR_ERROR
InsertValue(ArgIt);
Idx++;
}
delete yyvsp[-4].ArgList; // We're now done with the argument list
}
CHECK_FOR_ERROR
;
break;}
case 211:
#line 2159 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.FunctionVal = CurFun.CurrentFunction;
// Make sure that we keep track of the linkage type even if there was a
// previous "declare".
yyval.FunctionVal->setLinkage(yyvsp[-3].Linkage);
yyval.FunctionVal->setVisibility(yyvsp[-2].Visibility);
;
break;}
case 214:
#line 2170 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.FunctionVal = yyvsp[-1].FunctionVal;
CHECK_FOR_ERROR
;
break;}
case 215:
#line 2175 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
CurFun.CurrentFunction->setLinkage(yyvsp[-2].Linkage);
CurFun.CurrentFunction->setVisibility(yyvsp[-1].Visibility);
yyval.FunctionVal = CurFun.CurrentFunction;
CurFun.FunctionDone();
CHECK_FOR_ERROR
;
break;}
case 216:
#line 2187 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.BoolVal = false;
CHECK_FOR_ERROR
;
break;}
case 217:
#line 2191 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.BoolVal = true;
CHECK_FOR_ERROR
;
break;}
case 218:
#line 2196 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ // A reference to a direct constant
yyval.ValIDVal = ValID::create(yyvsp[0].SInt64Val);
CHECK_FOR_ERROR
;
break;}
case 219:
#line 2200 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.ValIDVal = ValID::create(yyvsp[0].UInt64Val);
CHECK_FOR_ERROR
;
break;}
case 220:
#line 2204 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Perhaps it's an FP constant?
yyval.ValIDVal = ValID::create(yyvsp[0].FPVal);
CHECK_FOR_ERROR
;
break;}
case 221:
#line 2208 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.ValIDVal = ValID::create(ConstantInt::getTrue());
CHECK_FOR_ERROR
;
break;}
case 222:
#line 2212 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.ValIDVal = ValID::create(ConstantInt::getFalse());
CHECK_FOR_ERROR
;
break;}
case 223:
#line 2216 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.ValIDVal = ValID::createNull();
CHECK_FOR_ERROR
;
break;}
case 224:
#line 2220 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.ValIDVal = ValID::createUndef();
CHECK_FOR_ERROR
;
break;}
case 225:
#line 2224 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ // A vector zero constant.
yyval.ValIDVal = ValID::createZeroInit();
CHECK_FOR_ERROR
;
break;}
case 226:
#line 2228 "/Users/sabre/cvs/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 227:
#line 2253 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.ValIDVal = ValID::create(yyvsp[0].ConstVal);
CHECK_FOR_ERROR
;
break;}
case 228:
#line 2257 "/Users/sabre/cvs/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 229:
#line 2271 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Is it an integer reference...?
yyval.ValIDVal = ValID::create(yyvsp[0].SIntVal);
CHECK_FOR_ERROR
;
break;}
case 230:
#line 2275 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Is it a named reference...?
yyval.ValIDVal = ValID::create(yyvsp[0].StrVal);
CHECK_FOR_ERROR
;
break;}
case 233:
#line 2287 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription());
yyval.ValueVal = getVal(*yyvsp[-1].TypeVal, yyvsp[0].ValIDVal);
delete yyvsp[-1].TypeVal;
CHECK_FOR_ERROR
;
break;}
case 234:
#line 2296 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.FunctionVal = yyvsp[-1].FunctionVal;
CHECK_FOR_ERROR
;
break;}
case 235:
#line 2300 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Do not allow functions with 0 basic blocks
yyval.FunctionVal = yyvsp[-1].FunctionVal;
CHECK_FOR_ERROR
;
break;}
case 236:
#line 2309 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
setValueName(yyvsp[0].TermInstVal, yyvsp[-1].StrVal);
CHECK_FOR_ERROR
InsertValue(yyvsp[0].TermInstVal);
yyvsp[-2].BasicBlockVal->getInstList().push_back(yyvsp[0].TermInstVal);
InsertValue(yyvsp[-2].BasicBlockVal);
yyval.BasicBlockVal = yyvsp[-2].BasicBlockVal;
CHECK_FOR_ERROR
;
break;}
case 237:
#line 2320 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (CastInst *CI1 = dyn_cast<CastInst>(yyvsp[0].InstVal))
if (CastInst *CI2 = dyn_cast<CastInst>(CI1->getOperand(0)))
if (CI2->getParent() == 0)
yyvsp[-1].BasicBlockVal->getInstList().push_back(CI2);
yyvsp[-1].BasicBlockVal->getInstList().push_back(yyvsp[0].InstVal);
yyval.BasicBlockVal = yyvsp[-1].BasicBlockVal;
CHECK_FOR_ERROR
;
break;}
case 238:
#line 2329 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.BasicBlockVal = getBBVal(ValID::create((int)CurFun.NextBBNum++), true);
CHECK_FOR_ERROR
// Make sure to move the basic block to the correct location in the
// function, instead of leaving it inserted wherever it was first
// referenced.
Function::BasicBlockListType &BBL =
CurFun.CurrentFunction->getBasicBlockList();
BBL.splice(BBL.end(), BBL, yyval.BasicBlockVal);
CHECK_FOR_ERROR
;
break;}
case 239:
#line 2341 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.BasicBlockVal = getBBVal(ValID::create(yyvsp[0].StrVal), true);
CHECK_FOR_ERROR
// Make sure to move the basic block to the correct location in the
// function, instead of leaving it inserted wherever it was first
// referenced.
Function::BasicBlockListType &BBL =
CurFun.CurrentFunction->getBasicBlockList();
BBL.splice(BBL.end(), BBL, yyval.BasicBlockVal);
CHECK_FOR_ERROR
;
break;}
case 240:
#line 2354 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Return with a result...
yyval.TermInstVal = new ReturnInst(yyvsp[0].ValueVal);
CHECK_FOR_ERROR
;
break;}
case 241:
#line 2358 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Return with no result...
yyval.TermInstVal = new ReturnInst();
CHECK_FOR_ERROR
;
break;}
case 242:
#line 2362 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Unconditional Branch...
BasicBlock* tmpBB = getBBVal(yyvsp[0].ValIDVal);
CHECK_FOR_ERROR
yyval.TermInstVal = new BranchInst(tmpBB);
;
break;}
case 243:
#line 2367 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
assert(cast<IntegerType>(yyvsp[-7].PrimType)->getBitWidth() == 1 && "Not Bool?");
BasicBlock* tmpBBA = getBBVal(yyvsp[-3].ValIDVal);
CHECK_FOR_ERROR
BasicBlock* tmpBBB = getBBVal(yyvsp[0].ValIDVal);
CHECK_FOR_ERROR
Value* tmpVal = getVal(Type::Int1Ty, yyvsp[-6].ValIDVal);
CHECK_FOR_ERROR
yyval.TermInstVal = new BranchInst(tmpBBA, tmpBBB, tmpVal);
;
break;}
case 244:
#line 2377 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
Value* tmpVal = getVal(yyvsp[-7].PrimType, yyvsp[-6].ValIDVal);
CHECK_FOR_ERROR
BasicBlock* tmpBB = getBBVal(yyvsp[-3].ValIDVal);
CHECK_FOR_ERROR
SwitchInst *S = new SwitchInst(tmpVal, tmpBB, yyvsp[-1].JumpTable->size());
yyval.TermInstVal = S;
std::vector<std::pair<Constant*,BasicBlock*> >::iterator I = yyvsp[-1].JumpTable->begin(),
E = yyvsp[-1].JumpTable->end();
for (; I != E; ++I) {
if (ConstantInt *CI = dyn_cast<ConstantInt>(I->first))
S->addCase(CI, I->second);
else
GEN_ERROR("Switch case is constant, but not a simple integer!");
}
delete yyvsp[-1].JumpTable;
CHECK_FOR_ERROR
;
break;}
case 245:
#line 2396 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
Value* tmpVal = getVal(yyvsp[-6].PrimType, yyvsp[-5].ValIDVal);
CHECK_FOR_ERROR
BasicBlock* tmpBB = getBBVal(yyvsp[-2].ValIDVal);
CHECK_FOR_ERROR
SwitchInst *S = new SwitchInst(tmpVal, tmpBB, 0);
yyval.TermInstVal = S;
CHECK_FOR_ERROR
;
break;}
case 246:
#line 2406 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
// Handle the short syntax
const PointerType *PFTy = 0;
const FunctionType *Ty = 0;
if (!(PFTy = dyn_cast<PointerType>(yyvsp[-11].TypeVal->get())) ||
!(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) {
// Pull out the types of all of the arguments...
std::vector<const Type*> ParamTypes;
FunctionType::ParamAttrsList ParamAttrs;
ParamAttrs.push_back(yyvsp[-6].ParamAttrs);
for (ValueRefList::iterator I = yyvsp[-8].ValueRefList->begin(), E = yyvsp[-8].ValueRefList->end(); I != E; ++I) {
const Type *Ty = I->Val->getType();
if (Ty == Type::VoidTy)
GEN_ERROR("Short call syntax cannot be used with varargs");
ParamTypes.push_back(Ty);
ParamAttrs.push_back(I->Attrs);
}
Ty = FunctionType::get(yyvsp[-11].TypeVal->get(), ParamTypes, false, ParamAttrs);
PFTy = PointerType::get(Ty);
}
Value *V = getVal(PFTy, yyvsp[-10].ValIDVal); // Get the function we're calling...
CHECK_FOR_ERROR
BasicBlock *Normal = getBBVal(yyvsp[-3].ValIDVal);
CHECK_FOR_ERROR
BasicBlock *Except = getBBVal(yyvsp[0].ValIDVal);
CHECK_FOR_ERROR
// Check the arguments
ValueList Args;
if (yyvsp[-8].ValueRefList->empty()) { // Has no arguments?
// Make sure no arguments is a good thing!
if (Ty->getNumParams() != 0)
GEN_ERROR("No arguments passed to a function that "
"expects arguments!");
} else { // Has arguments?
// Loop through FunctionType's arguments and ensure they are specified
// correctly!
FunctionType::param_iterator I = Ty->param_begin();
FunctionType::param_iterator E = Ty->param_end();
ValueRefList::iterator ArgI = yyvsp[-8].ValueRefList->begin(), ArgE = yyvsp[-8].ValueRefList->end();
for (; ArgI != ArgE && I != E; ++ArgI, ++I) {
if (ArgI->Val->getType() != *I)
GEN_ERROR("Parameter " + ArgI->Val->getName()+ " is not of type '" +
(*I)->getDescription() + "'!");
Args.push_back(ArgI->Val);
}
if (Ty->isVarArg()) {
if (I == E)
for (; ArgI != ArgE; ++ArgI)
Args.push_back(ArgI->Val); // push the remaining varargs
} else if (I != E || ArgI != ArgE)
GEN_ERROR("Invalid number of parameters detected!");
}
// Create the InvokeInst
InvokeInst *II = new InvokeInst(V, Normal, Except, Args);
II->setCallingConv(yyvsp[-12].UIntVal);
yyval.TermInstVal = II;
delete yyvsp[-8].ValueRefList;
CHECK_FOR_ERROR
;
break;}
case 247:
#line 2472 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.TermInstVal = new UnwindInst();
CHECK_FOR_ERROR
;
break;}
case 248:
#line 2476 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.TermInstVal = new UnreachableInst();
CHECK_FOR_ERROR
;
break;}
case 249:
#line 2483 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.JumpTable = yyvsp[-5].JumpTable;
Constant *V = cast<Constant>(getValNonImprovising(yyvsp[-4].PrimType, yyvsp[-3].ValIDVal));
CHECK_FOR_ERROR
if (V == 0)
GEN_ERROR("May only switch on a constant pool value!");
BasicBlock* tmpBB = getBBVal(yyvsp[0].ValIDVal);
CHECK_FOR_ERROR
yyval.JumpTable->push_back(std::make_pair(V, tmpBB));
;
break;}
case 250:
#line 2494 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.JumpTable = new std::vector<std::pair<Constant*, BasicBlock*> >();
Constant *V = cast<Constant>(getValNonImprovising(yyvsp[-4].PrimType, yyvsp[-3].ValIDVal));
CHECK_FOR_ERROR
if (V == 0)
GEN_ERROR("May only switch on a constant pool value!");
BasicBlock* tmpBB = getBBVal(yyvsp[0].ValIDVal);
CHECK_FOR_ERROR
yyval.JumpTable->push_back(std::make_pair(V, tmpBB));
;
break;}
case 251:
#line 2507 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
// Is this definition named?? if so, assign the name...
setValueName(yyvsp[0].InstVal, yyvsp[-1].StrVal);
CHECK_FOR_ERROR
InsertValue(yyvsp[0].InstVal);
yyval.InstVal = yyvsp[0].InstVal;
CHECK_FOR_ERROR
;
break;}
case 252:
#line 2516 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ // Used for PHI nodes
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-5].TypeVal)->getDescription());
yyval.PHIList = new std::list<std::pair<Value*, BasicBlock*> >();
Value* tmpVal = getVal(*yyvsp[-5].TypeVal, yyvsp[-3].ValIDVal);
CHECK_FOR_ERROR
BasicBlock* tmpBB = getBBVal(yyvsp[-1].ValIDVal);
CHECK_FOR_ERROR
yyval.PHIList->push_back(std::make_pair(tmpVal, tmpBB));
delete yyvsp[-5].TypeVal;
;
break;}
case 253:
#line 2527 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.PHIList = yyvsp[-6].PHIList;
Value* tmpVal = getVal(yyvsp[-6].PHIList->front().first->getType(), yyvsp[-3].ValIDVal);
CHECK_FOR_ERROR
BasicBlock* tmpBB = getBBVal(yyvsp[-1].ValIDVal);
CHECK_FOR_ERROR
yyvsp[-6].PHIList->push_back(std::make_pair(tmpVal, tmpBB));
;
break;}
case 254:
#line 2537 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-2].TypeVal)->getDescription());
// Used for call and invoke instructions
yyval.ValueRefList = new ValueRefList();
ValueRefListEntry E; E.Attrs = yyvsp[0].ParamAttrs; E.Val = getVal(yyvsp[-2].TypeVal->get(), yyvsp[-1].ValIDVal);
yyval.ValueRefList->push_back(E);
;
break;}
case 255:
#line 2545 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-2].TypeVal)->getDescription());
yyval.ValueRefList = yyvsp[-4].ValueRefList;
ValueRefListEntry E; E.Attrs = yyvsp[0].ParamAttrs; E.Val = getVal(yyvsp[-2].TypeVal->get(), yyvsp[-1].ValIDVal);
yyval.ValueRefList->push_back(E);
CHECK_FOR_ERROR
;
break;}
case 256:
#line 2553 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.ValueRefList = new ValueRefList(); ;
break;}
case 257:
#line 2556 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{ yyval.ValueList = new std::vector<Value*>(); ;
break;}
case 258:
#line 2557 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.ValueList = yyvsp[-2].ValueList;
yyval.ValueList->push_back(yyvsp[0].ValueVal);
CHECK_FOR_ERROR
;
break;}
case 259:
#line 2564 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.BoolVal = true;
CHECK_FOR_ERROR
;
break;}
case 260:
#line 2568 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.BoolVal = false;
CHECK_FOR_ERROR
;
break;}
case 261:
#line 2573 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-3].TypeVal)->getDescription());
if (!(*yyvsp[-3].TypeVal)->isIntegral() && !(*yyvsp[-3].TypeVal)->isFloatingPoint() &&
!isa<PackedType>((*yyvsp[-3].TypeVal).get()))
GEN_ERROR(
"Arithmetic operator requires integer, FP, or packed operands!");
if (isa<PackedType>((*yyvsp[-3].TypeVal).get()) &&
(yyvsp[-4].BinaryOpVal == Instruction::URem ||
yyvsp[-4].BinaryOpVal == Instruction::SRem ||
yyvsp[-4].BinaryOpVal == Instruction::FRem))
GEN_ERROR("U/S/FRem not supported on packed types!");
Value* val1 = getVal(*yyvsp[-3].TypeVal, yyvsp[-2].ValIDVal);
CHECK_FOR_ERROR
Value* val2 = getVal(*yyvsp[-3].TypeVal, yyvsp[0].ValIDVal);
CHECK_FOR_ERROR
yyval.InstVal = BinaryOperator::create(yyvsp[-4].BinaryOpVal, val1, val2);
if (yyval.InstVal == 0)
GEN_ERROR("binary operator returned null!");
delete yyvsp[-3].TypeVal;
;
break;}
case 262:
#line 2594 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-3].TypeVal)->getDescription());
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!");
}
Value* tmpVal1 = getVal(*yyvsp[-3].TypeVal, yyvsp[-2].ValIDVal);
CHECK_FOR_ERROR
Value* tmpVal2 = getVal(*yyvsp[-3].TypeVal, yyvsp[0].ValIDVal);
CHECK_FOR_ERROR
yyval.InstVal = BinaryOperator::create(yyvsp[-4].BinaryOpVal, tmpVal1, tmpVal2);
if (yyval.InstVal == 0)
GEN_ERROR("binary operator returned null!");
delete yyvsp[-3].TypeVal;
;
break;}
case 263:
#line 2611 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-3].TypeVal)->getDescription());
if (isa<PackedType>((*yyvsp[-3].TypeVal).get()))
GEN_ERROR("Packed types not supported by icmp instruction");
Value* tmpVal1 = getVal(*yyvsp[-3].TypeVal, yyvsp[-2].ValIDVal);
CHECK_FOR_ERROR
Value* tmpVal2 = getVal(*yyvsp[-3].TypeVal, yyvsp[0].ValIDVal);
CHECK_FOR_ERROR
yyval.InstVal = CmpInst::create(yyvsp[-5].OtherOpVal, yyvsp[-4].IPredicate, tmpVal1, tmpVal2);
if (yyval.InstVal == 0)
GEN_ERROR("icmp operator returned null!");
;
break;}
case 264:
#line 2624 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-3].TypeVal)->getDescription());
if (isa<PackedType>((*yyvsp[-3].TypeVal).get()))
GEN_ERROR("Packed types not supported by fcmp instruction");
Value* tmpVal1 = getVal(*yyvsp[-3].TypeVal, yyvsp[-2].ValIDVal);
CHECK_FOR_ERROR
Value* tmpVal2 = getVal(*yyvsp[-3].TypeVal, yyvsp[0].ValIDVal);
CHECK_FOR_ERROR
yyval.InstVal = CmpInst::create(yyvsp[-5].OtherOpVal, yyvsp[-4].FPredicate, tmpVal1, tmpVal2);
if (yyval.InstVal == 0)
GEN_ERROR("fcmp operator returned null!");
;
break;}
case 265:
#line 2637 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (yyvsp[0].ValueVal->getType() != Type::Int8Ty)
GEN_ERROR("Shift amount must be i8 type!");
if (!yyvsp[-2].ValueVal->getType()->isIntegral())
GEN_ERROR("Shift constant expression requires integer operand!");
CHECK_FOR_ERROR;
yyval.InstVal = new ShiftInst(yyvsp[-3].OtherOpVal, yyvsp[-2].ValueVal, yyvsp[0].ValueVal);
CHECK_FOR_ERROR
;
break;}
case 266:
#line 2646 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[0].TypeVal)->getDescription());
Value* Val = yyvsp[-2].ValueVal;
const Type* Ty = yyvsp[0].TypeVal->get();
if (!Val->getType()->isFirstClassType())
GEN_ERROR("cast from a non-primitive type: '" +
Val->getType()->getDescription() + "'!");
if (!Ty->isFirstClassType())
GEN_ERROR("cast to a non-primitive type: '" + Ty->getDescription() +"'!");
yyval.InstVal = CastInst::create(yyvsp[-3].CastOpVal, Val, yyvsp[0].TypeVal->get());
delete yyvsp[0].TypeVal;
;
break;}
case 267:
#line 2659 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (yyvsp[-4].ValueVal->getType() != Type::Int1Ty)
GEN_ERROR("select condition must be boolean!");
if (yyvsp[-2].ValueVal->getType() != yyvsp[0].ValueVal->getType())
GEN_ERROR("select value types should match!");
yyval.InstVal = new SelectInst(yyvsp[-4].ValueVal, yyvsp[-2].ValueVal, yyvsp[0].ValueVal);
CHECK_FOR_ERROR
;
break;}
case 268:
#line 2667 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[0].TypeVal)->getDescription());
yyval.InstVal = new VAArgInst(yyvsp[-2].ValueVal, *yyvsp[0].TypeVal);
delete yyvsp[0].TypeVal;
CHECK_FOR_ERROR
;
break;}
case 269:
#line 2674 "/Users/sabre/cvs/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 270:
#line 2680 "/Users/sabre/cvs/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 271:
#line 2686 "/Users/sabre/cvs/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 272:
#line 2692 "/Users/sabre/cvs/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 273:
#line 2708 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
// Handle the short syntax
const PointerType *PFTy = 0;
const FunctionType *Ty = 0;
if (!(PFTy = dyn_cast<PointerType>(yyvsp[-5].TypeVal->get())) ||
!(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) {
// Pull out the types of all of the arguments...
std::vector<const Type*> ParamTypes;
FunctionType::ParamAttrsList ParamAttrs;
ParamAttrs.push_back(yyvsp[0].ParamAttrs);
for (ValueRefList::iterator I = yyvsp[-2].ValueRefList->begin(), E = yyvsp[-2].ValueRefList->end(); I != E; ++I) {
const Type *Ty = I->Val->getType();
if (Ty == Type::VoidTy)
GEN_ERROR("Short call syntax cannot be used with varargs");
ParamTypes.push_back(Ty);
ParamAttrs.push_back(I->Attrs);
}
Ty = FunctionType::get(yyvsp[-5].TypeVal->get(), ParamTypes, false, ParamAttrs);
PFTy = PointerType::get(Ty);
}
Value *V = getVal(PFTy, yyvsp[-4].ValIDVal); // Get the function we're calling...
CHECK_FOR_ERROR
// Check the arguments
ValueList Args;
if (yyvsp[-2].ValueRefList->empty()) { // Has no arguments?
// Make sure no arguments is a good thing!
if (Ty->getNumParams() != 0)
GEN_ERROR("No arguments passed to a function that "
"expects arguments!");
} else { // Has arguments?
// Loop through FunctionType's arguments and ensure they are specified
// correctly!
//
FunctionType::param_iterator I = Ty->param_begin();
FunctionType::param_iterator E = Ty->param_end();
ValueRefList::iterator ArgI = yyvsp[-2].ValueRefList->begin(), ArgE = yyvsp[-2].ValueRefList->end();
for (; ArgI != ArgE && I != E; ++ArgI, ++I) {
if (ArgI->Val->getType() != *I)
GEN_ERROR("Parameter " + ArgI->Val->getName()+ " is not of type '" +
(*I)->getDescription() + "'!");
Args.push_back(ArgI->Val);
}
if (Ty->isVarArg()) {
if (I == E)
for (; ArgI != ArgE; ++ArgI)
Args.push_back(ArgI->Val); // push the remaining varargs
} else if (I != E || ArgI != ArgE)
GEN_ERROR("Invalid number of parameters detected!");
}
// Create the call node
CallInst *CI = new CallInst(V, Args);
CI->setTailCall(yyvsp[-7].BoolVal);
CI->setCallingConv(yyvsp[-6].UIntVal);
yyval.InstVal = CI;
delete yyvsp[-2].ValueRefList;
CHECK_FOR_ERROR
;
break;}
case 274:
#line 2770 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.InstVal = yyvsp[0].InstVal;
CHECK_FOR_ERROR
;
break;}
case 275:
#line 2775 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.BoolVal = true;
CHECK_FOR_ERROR
;
break;}
case 276:
#line 2779 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
yyval.BoolVal = false;
CHECK_FOR_ERROR
;
break;}
case 277:
#line 2786 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription());
yyval.InstVal = new MallocInst(*yyvsp[-1].TypeVal, 0, yyvsp[0].UIntVal);
delete yyvsp[-1].TypeVal;
CHECK_FOR_ERROR
;
break;}
case 278:
#line 2793 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-4].TypeVal)->getDescription());
Value* tmpVal = getVal(yyvsp[-2].PrimType, yyvsp[-1].ValIDVal);
CHECK_FOR_ERROR
yyval.InstVal = new MallocInst(*yyvsp[-4].TypeVal, tmpVal, yyvsp[0].UIntVal);
delete yyvsp[-4].TypeVal;
;
break;}
case 279:
#line 2801 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription());
yyval.InstVal = new AllocaInst(*yyvsp[-1].TypeVal, 0, yyvsp[0].UIntVal);
delete yyvsp[-1].TypeVal;
CHECK_FOR_ERROR
;
break;}
case 280:
#line 2808 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-4].TypeVal)->getDescription());
Value* tmpVal = getVal(yyvsp[-2].PrimType, yyvsp[-1].ValIDVal);
CHECK_FOR_ERROR
yyval.InstVal = new AllocaInst(*yyvsp[-4].TypeVal, tmpVal, yyvsp[0].UIntVal);
delete yyvsp[-4].TypeVal;
;
break;}
case 281:
#line 2816 "/Users/sabre/cvs/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 282:
#line 2824 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription());
if (!isa<PointerType>(yyvsp[-1].TypeVal->get()))
GEN_ERROR("Can't load from nonpointer type: " +
(*yyvsp[-1].TypeVal)->getDescription());
if (!cast<PointerType>(yyvsp[-1].TypeVal->get())->getElementType()->isFirstClassType())
GEN_ERROR("Can't load from pointer of non-first-class type: " +
(*yyvsp[-1].TypeVal)->getDescription());
Value* tmpVal = getVal(*yyvsp[-1].TypeVal, yyvsp[0].ValIDVal);
CHECK_FOR_ERROR
yyval.InstVal = new LoadInst(tmpVal, "", yyvsp[-3].BoolVal);
delete yyvsp[-1].TypeVal;
;
break;}
case 283:
#line 2838 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-1].TypeVal)->getDescription());
const PointerType *PT = dyn_cast<PointerType>(yyvsp[-1].TypeVal->get());
if (!PT)
GEN_ERROR("Can't store to a nonpointer type: " +
(*yyvsp[-1].TypeVal)->getDescription());
const Type *ElTy = PT->getElementType();
if (ElTy != yyvsp[-3].ValueVal->getType())
GEN_ERROR("Can't store '" + yyvsp[-3].ValueVal->getType()->getDescription() +
"' into space of type '" + ElTy->getDescription() + "'!");
Value* tmpVal = getVal(*yyvsp[-1].TypeVal, yyvsp[0].ValIDVal);
CHECK_FOR_ERROR
yyval.InstVal = new StoreInst(yyvsp[-3].ValueVal, tmpVal, yyvsp[-5].BoolVal);
delete yyvsp[-1].TypeVal;
;
break;}
case 284:
#line 2855 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
{
if (!UpRefs.empty())
GEN_ERROR("Invalid upreference in type: " + (*yyvsp[-2].TypeVal)->getDescription());
if (!isa<PointerType>(yyvsp[-2].TypeVal->get()))
GEN_ERROR("getelementptr insn requires pointer operand!");
if (!GetElementPtrInst::getIndexedType(*yyvsp[-2].TypeVal, *yyvsp[0].ValueList, true))
GEN_ERROR("Invalid getelementptr indices for type '" +
(*yyvsp[-2].TypeVal)->getDescription()+ "'!");
Value* tmpVal = getVal(*yyvsp[-2].TypeVal, yyvsp[-1].ValIDVal);
CHECK_FOR_ERROR
yyval.InstVal = new GetElementPtrInst(tmpVal, *yyvsp[0].ValueList);
delete yyvsp[-2].TypeVal;
delete yyvsp[0].ValueList;
;
break;}
}
/* the action file gets copied in in place of this dollarsign */
#line 543 "/usr/share/bison.simple"
yyvsp -= yylen;
yyssp -= yylen;
#ifdef YYLSP_NEEDED
yylsp -= yylen;
#endif
#if YYDEBUG != 0
if (yydebug)
{
short *ssp1 = yyss - 1;
fprintf (stderr, "state stack now");
while (ssp1 != yyssp)
fprintf (stderr, " %d", *++ssp1);
fprintf (stderr, "\n");
}
#endif
*++yyvsp = yyval;
#ifdef YYLSP_NEEDED
yylsp++;
if (yylen == 0)
{
yylsp->first_line = yylloc.first_line;
yylsp->first_column = yylloc.first_column;
yylsp->last_line = (yylsp-1)->last_line;
yylsp->last_column = (yylsp-1)->last_column;
yylsp->text = 0;
}
else
{
yylsp->last_line = (yylsp+yylen-1)->last_line;
yylsp->last_column = (yylsp+yylen-1)->last_column;
}
#endif
/* 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 - YYNTBASE] + *yyssp;
if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp)
yystate = yytable[yystate];
else
yystate = yydefgoto[yyn - YYNTBASE];
goto yynewstate;
yyerrlab: /* here on detecting error */
if (! yyerrstatus)
/* If not already recovering from an error, report this error. */
{
++yynerrs;
#ifdef YYERROR_VERBOSE
yyn = yypact[yystate];
if (yyn > YYFLAG && yyn < YYLAST)
{
int size = 0;
char *msg;
int x, count;
count = 0;
/* Start X at -yyn if nec to avoid negative indexes in yycheck. */
for (x = (yyn < 0 ? -yyn : 0);
x < (sizeof(yytname) / sizeof(char *)); x++)
if (yycheck[x + yyn] == x)
size += strlen(yytname[x]) + 15, count++;
msg = (char *) malloc(size + 15);
if (msg != 0)
{
strcpy(msg, "parse error");
if (count < 5)
{
count = 0;
for (x = (yyn < 0 ? -yyn : 0);
x < (sizeof(yytname) / sizeof(char *)); x++)
if (yycheck[x + yyn] == x)
{
strcat(msg, count == 0 ? ", expecting `" : " or `");
strcat(msg, yytname[x]);
strcat(msg, "'");
count++;
}
}
yyerror(msg);
free(msg);
}
else
yyerror ("parse error; also virtual memory exceeded");
}
else
#endif /* YYERROR_VERBOSE */
yyerror("parse error");
}
goto yyerrlab1;
yyerrlab1: /* here on error raised explicitly by an action */
if (yyerrstatus == 3)
{
/* if just tried and failed to reuse lookahead token after an error, discard it. */
/* return failure if at end of input */
if (yychar == YYEOF)
YYABORT;
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]);
#endif
yychar = YYEMPTY;
}
/* Else will try to reuse lookahead token
after shifting the error token. */
yyerrstatus = 3; /* Each real token shifted decrements this */
goto yyerrhandle;
yyerrdefault: /* current state does not do anything special for the error token. */
#if 0
/* This is wrong; only states that explicitly want error tokens
should shift them. */
yyn = yydefact[yystate]; /* If its default is to accept any token, ok. Otherwise pop it.*/
if (yyn) goto yydefault;
#endif
yyerrpop: /* pop the current state because it cannot handle the error token */
if (yyssp == yyss) YYABORT;
yyvsp--;
yystate = *--yyssp;
#ifdef YYLSP_NEEDED
yylsp--;
#endif
#if YYDEBUG != 0
if (yydebug)
{
short *ssp1 = yyss - 1;
fprintf (stderr, "Error: state stack now");
while (ssp1 != yyssp)
fprintf (stderr, " %d", *++ssp1);
fprintf (stderr, "\n");
}
#endif
yyerrhandle:
yyn = yypact[yystate];
if (yyn == YYFLAG)
goto yyerrdefault;
yyn += YYTERROR;
if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR)
goto yyerrdefault;
yyn = yytable[yyn];
if (yyn < 0)
{
if (yyn == YYFLAG)
goto yyerrpop;
yyn = -yyn;
goto yyreduce;
}
else if (yyn == 0)
goto yyerrpop;
if (yyn == YYFINAL)
YYACCEPT;
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Shifting error token, ");
#endif
*++yyvsp = yylval;
#ifdef YYLSP_NEEDED
*++yylsp = yylloc;
#endif
yystate = yyn;
goto yynewstate;
yyacceptlab:
/* YYACCEPT comes here. */
if (yyfree_stacks)
{
free (yyss);
free (yyvs);
#ifdef YYLSP_NEEDED
free (yyls);
#endif
}
return 0;
yyabortlab:
/* YYABORT comes here. */
if (yyfree_stacks)
{
free (yyss);
free (yyvs);
#ifdef YYLSP_NEEDED
free (yyls);
#endif
}
return 1;
}
#line 2872 "/Users/sabre/cvs/llvm/lib/AsmParser/llvmAsmParser.y"
// common code from the two 'RunVMAsmParser' functions
static Module* RunParser(Module * M) {
llvmAsmlineno = 1; // Reset the current line number...
CurModule.CurrentModule = M;
#if YYDEBUG
yydebug = Debug;
#endif
// Check to make sure the parser succeeded
if (yyparse()) {
if (ParserResult)
delete ParserResult;
return 0;
}
// Check to make sure that parsing produced a result
if (!ParserResult)
return 0;
// Reset ParserResult variable while saving its value for the result.
Module *Result = ParserResult;
ParserResult = 0;
return Result;
}
void llvm::GenerateError(const std::string &message, int LineNo) {
if (LineNo == -1) LineNo = llvmAsmlineno;
// TODO: column number in exception
if (TheParseError)
TheParseError->setError(CurFilename, message, LineNo);
TriggerError = 1;
}
int yyerror(const char *ErrorMsg) {
std::string where
= std::string((CurFilename == "-") ? std::string("<stdin>") : CurFilename)
+ ":" + utostr((unsigned) llvmAsmlineno) + ": ";
std::string errMsg = std::string(ErrorMsg) + "\n" + where + " while reading ";
if (yychar == YYEMPTY || yychar == 0)
errMsg += "end-of-file.";
else
errMsg += "token: '" + std::string(llvmAsmtext, llvmAsmleng) + "'";
GenerateError(errMsg);
return 0;
}
Reference in New Issue View Git Blame Copy Permalink