blob: 5a3f17c1470a313515763edd60e15302de08c1f9 [file] [log] [blame]
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001//===-- llvmAsmParser.y - Parser for llvm assembly files --------*- C++ -*-===//
2//
3// The LLVM Compiler Infrastructure
4//
Chris Lattner081ce942007-12-29 20:36:04 +00005// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
Dan Gohmanf17a25c2007-07-18 16:29:46 +00007//
8//===----------------------------------------------------------------------===//
9//
10// This file implements the bison parser for LLVM assembly languages files.
11//
12//===----------------------------------------------------------------------===//
13
14%{
15#include "ParserInternals.h"
16#include "llvm/CallingConv.h"
17#include "llvm/InlineAsm.h"
18#include "llvm/Instructions.h"
19#include "llvm/Module.h"
20#include "llvm/ValueSymbolTable.h"
Chandler Carrutha228e392007-08-04 01:51:18 +000021#include "llvm/AutoUpgrade.h"
Dan Gohmanf17a25c2007-07-18 16:29:46 +000022#include "llvm/Support/GetElementPtrTypeIterator.h"
23#include "llvm/Support/CommandLine.h"
24#include "llvm/ADT/SmallVector.h"
25#include "llvm/ADT/STLExtras.h"
26#include "llvm/Support/MathExtras.h"
27#include "llvm/Support/Streams.h"
28#include <algorithm>
29#include <list>
30#include <map>
31#include <utility>
Dan Gohmanf17a25c2007-07-18 16:29:46 +000032
33// The following is a gross hack. In order to rid the libAsmParser library of
34// exceptions, we have to have a way of getting the yyparse function to go into
35// an error situation. So, whenever we want an error to occur, the GenerateError
36// function (see bottom of file) sets TriggerError. Then, at the end of each
37// production in the grammer we use CHECK_FOR_ERROR which will invoke YYERROR
38// (a goto) to put YACC in error state. Furthermore, several calls to
39// GenerateError are made from inside productions and they must simulate the
40// previous exception behavior by exiting the production immediately. We have
41// replaced these with the GEN_ERROR macro which calls GeneratError and then
42// immediately invokes YYERROR. This would be so much cleaner if it was a
43// recursive descent parser.
44static bool TriggerError = false;
45#define CHECK_FOR_ERROR { if (TriggerError) { TriggerError = false; YYABORT; } }
46#define GEN_ERROR(msg) { GenerateError(msg); YYERROR; }
47
48int yyerror(const char *ErrorMsg); // Forward declarations to prevent "implicit
49int yylex(); // declaration" of xxx warnings.
50int yyparse();
Dan Gohmanf17a25c2007-07-18 16:29:46 +000051using namespace llvm;
52
53static Module *ParserResult;
54
55// DEBUG_UPREFS - Define this symbol if you want to enable debugging output
56// relating to upreferences in the input stream.
57//
58//#define DEBUG_UPREFS 1
59#ifdef DEBUG_UPREFS
60#define UR_OUT(X) cerr << X
61#else
62#define UR_OUT(X)
63#endif
64
65#define YYERROR_VERBOSE 1
66
67static GlobalVariable *CurGV;
68
69
70// This contains info used when building the body of a function. It is
71// destroyed when the function is completed.
72//
73typedef std::vector<Value *> ValueList; // Numbered defs
74
75static void
76ResolveDefinitions(ValueList &LateResolvers, ValueList *FutureLateResolvers=0);
77
78static struct PerModuleInfo {
79 Module *CurrentModule;
80 ValueList Values; // Module level numbered definitions
81 ValueList LateResolveValues;
82 std::vector<PATypeHolder> Types;
83 std::map<ValID, PATypeHolder> LateResolveTypes;
84
85 /// PlaceHolderInfo - When temporary placeholder objects are created, remember
86 /// how they were referenced and on which line of the input they came from so
87 /// that we can resolve them later and print error messages as appropriate.
88 std::map<Value*, std::pair<ValID, int> > PlaceHolderInfo;
89
90 // GlobalRefs - This maintains a mapping between <Type, ValID>'s and forward
91 // references to global values. Global values may be referenced before they
92 // are defined, and if so, the temporary object that they represent is held
93 // here. This is used for forward references of GlobalValues.
94 //
95 typedef std::map<std::pair<const PointerType *,
96 ValID>, GlobalValue*> GlobalRefsType;
97 GlobalRefsType GlobalRefs;
98
99 void ModuleDone() {
100 // If we could not resolve some functions at function compilation time
101 // (calls to functions before they are defined), resolve them now... Types
102 // are resolved when the constant pool has been completely parsed.
103 //
104 ResolveDefinitions(LateResolveValues);
105 if (TriggerError)
106 return;
107
108 // Check to make sure that all global value forward references have been
109 // resolved!
110 //
111 if (!GlobalRefs.empty()) {
112 std::string UndefinedReferences = "Unresolved global references exist:\n";
113
114 for (GlobalRefsType::iterator I = GlobalRefs.begin(), E =GlobalRefs.end();
115 I != E; ++I) {
116 UndefinedReferences += " " + I->first.first->getDescription() + " " +
117 I->first.second.getName() + "\n";
118 }
119 GenerateError(UndefinedReferences);
120 return;
121 }
122
Chandler Carrutha228e392007-08-04 01:51:18 +0000123 // Look for intrinsic functions and CallInst that need to be upgraded
124 for (Module::iterator FI = CurrentModule->begin(),
125 FE = CurrentModule->end(); FI != FE; )
126 UpgradeCallsToIntrinsic(FI++); // must be post-increment, as we remove
127
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000128 Values.clear(); // Clear out function local definitions
129 Types.clear();
130 CurrentModule = 0;
131 }
132
133 // GetForwardRefForGlobal - Check to see if there is a forward reference
134 // for this global. If so, remove it from the GlobalRefs map and return it.
135 // If not, just return null.
136 GlobalValue *GetForwardRefForGlobal(const PointerType *PTy, ValID ID) {
137 // Check to see if there is a forward reference to this global variable...
138 // if there is, eliminate it and patch the reference to use the new def'n.
139 GlobalRefsType::iterator I = GlobalRefs.find(std::make_pair(PTy, ID));
140 GlobalValue *Ret = 0;
141 if (I != GlobalRefs.end()) {
142 Ret = I->second;
143 GlobalRefs.erase(I);
144 }
145 return Ret;
146 }
147
148 bool TypeIsUnresolved(PATypeHolder* PATy) {
149 // If it isn't abstract, its resolved
150 const Type* Ty = PATy->get();
151 if (!Ty->isAbstract())
152 return false;
153 // Traverse the type looking for abstract types. If it isn't abstract then
154 // we don't need to traverse that leg of the type.
155 std::vector<const Type*> WorkList, SeenList;
156 WorkList.push_back(Ty);
157 while (!WorkList.empty()) {
158 const Type* Ty = WorkList.back();
159 SeenList.push_back(Ty);
160 WorkList.pop_back();
161 if (const OpaqueType* OpTy = dyn_cast<OpaqueType>(Ty)) {
162 // Check to see if this is an unresolved type
163 std::map<ValID, PATypeHolder>::iterator I = LateResolveTypes.begin();
164 std::map<ValID, PATypeHolder>::iterator E = LateResolveTypes.end();
165 for ( ; I != E; ++I) {
166 if (I->second.get() == OpTy)
167 return true;
168 }
169 } else if (const SequentialType* SeqTy = dyn_cast<SequentialType>(Ty)) {
170 const Type* TheTy = SeqTy->getElementType();
171 if (TheTy->isAbstract() && TheTy != Ty) {
172 std::vector<const Type*>::iterator I = SeenList.begin(),
173 E = SeenList.end();
174 for ( ; I != E; ++I)
175 if (*I == TheTy)
176 break;
177 if (I == E)
178 WorkList.push_back(TheTy);
179 }
180 } else if (const StructType* StrTy = dyn_cast<StructType>(Ty)) {
181 for (unsigned i = 0; i < StrTy->getNumElements(); ++i) {
182 const Type* TheTy = StrTy->getElementType(i);
183 if (TheTy->isAbstract() && TheTy != Ty) {
184 std::vector<const Type*>::iterator I = SeenList.begin(),
185 E = SeenList.end();
186 for ( ; I != E; ++I)
187 if (*I == TheTy)
188 break;
189 if (I == E)
190 WorkList.push_back(TheTy);
191 }
192 }
193 }
194 }
195 return false;
196 }
197} CurModule;
198
199static struct PerFunctionInfo {
200 Function *CurrentFunction; // Pointer to current function being created
201
202 ValueList Values; // Keep track of #'d definitions
203 unsigned NextValNum;
204 ValueList LateResolveValues;
205 bool isDeclare; // Is this function a forward declararation?
206 GlobalValue::LinkageTypes Linkage; // Linkage for forward declaration.
207 GlobalValue::VisibilityTypes Visibility;
208
209 /// BBForwardRefs - When we see forward references to basic blocks, keep
210 /// track of them here.
211 std::map<ValID, BasicBlock*> BBForwardRefs;
212
213 inline PerFunctionInfo() {
214 CurrentFunction = 0;
215 isDeclare = false;
216 Linkage = GlobalValue::ExternalLinkage;
217 Visibility = GlobalValue::DefaultVisibility;
218 }
219
220 inline void FunctionStart(Function *M) {
221 CurrentFunction = M;
222 NextValNum = 0;
223 }
224
225 void FunctionDone() {
226 // Any forward referenced blocks left?
227 if (!BBForwardRefs.empty()) {
228 GenerateError("Undefined reference to label " +
229 BBForwardRefs.begin()->second->getName());
230 return;
231 }
232
233 // Resolve all forward references now.
234 ResolveDefinitions(LateResolveValues, &CurModule.LateResolveValues);
235
236 Values.clear(); // Clear out function local definitions
237 BBForwardRefs.clear();
238 CurrentFunction = 0;
239 isDeclare = false;
240 Linkage = GlobalValue::ExternalLinkage;
241 Visibility = GlobalValue::DefaultVisibility;
242 }
243} CurFun; // Info for the current function...
244
245static bool inFunctionScope() { return CurFun.CurrentFunction != 0; }
246
247
248//===----------------------------------------------------------------------===//
249// Code to handle definitions of all the types
250//===----------------------------------------------------------------------===//
251
252static void InsertValue(Value *V, ValueList &ValueTab = CurFun.Values) {
253 // Things that have names or are void typed don't get slot numbers
254 if (V->hasName() || (V->getType() == Type::VoidTy))
255 return;
256
257 // In the case of function values, we have to allow for the forward reference
258 // of basic blocks, which are included in the numbering. Consequently, we keep
259 // track of the next insertion location with NextValNum. When a BB gets
260 // inserted, it could change the size of the CurFun.Values vector.
261 if (&ValueTab == &CurFun.Values) {
262 if (ValueTab.size() <= CurFun.NextValNum)
263 ValueTab.resize(CurFun.NextValNum+1);
264 ValueTab[CurFun.NextValNum++] = V;
265 return;
266 }
267 // For all other lists, its okay to just tack it on the back of the vector.
268 ValueTab.push_back(V);
269}
270
271static const Type *getTypeVal(const ValID &D, bool DoNotImprovise = false) {
272 switch (D.Type) {
273 case ValID::LocalID: // Is it a numbered definition?
274 // Module constants occupy the lowest numbered slots...
275 if (D.Num < CurModule.Types.size())
276 return CurModule.Types[D.Num];
277 break;
278 case ValID::LocalName: // Is it a named definition?
279 if (const Type *N = CurModule.CurrentModule->getTypeByName(D.getName())) {
280 D.destroy(); // Free old strdup'd memory...
281 return N;
282 }
283 break;
284 default:
285 GenerateError("Internal parser error: Invalid symbol type reference");
286 return 0;
287 }
288
289 // If we reached here, we referenced either a symbol that we don't know about
290 // or an id number that hasn't been read yet. We may be referencing something
291 // forward, so just create an entry to be resolved later and get to it...
292 //
293 if (DoNotImprovise) return 0; // Do we just want a null to be returned?
294
295
296 if (inFunctionScope()) {
297 if (D.Type == ValID::LocalName) {
298 GenerateError("Reference to an undefined type: '" + D.getName() + "'");
299 return 0;
300 } else {
301 GenerateError("Reference to an undefined type: #" + utostr(D.Num));
302 return 0;
303 }
304 }
305
306 std::map<ValID, PATypeHolder>::iterator I =CurModule.LateResolveTypes.find(D);
307 if (I != CurModule.LateResolveTypes.end())
308 return I->second;
309
310 Type *Typ = OpaqueType::get();
311 CurModule.LateResolveTypes.insert(std::make_pair(D, Typ));
312 return Typ;
313 }
314
315// getExistingVal - Look up the value specified by the provided type and
316// the provided ValID. If the value exists and has already been defined, return
317// it. Otherwise return null.
318//
319static Value *getExistingVal(const Type *Ty, const ValID &D) {
320 if (isa<FunctionType>(Ty)) {
321 GenerateError("Functions are not values and "
322 "must be referenced as pointers");
323 return 0;
324 }
325
326 switch (D.Type) {
327 case ValID::LocalID: { // Is it a numbered definition?
328 // Check that the number is within bounds.
329 if (D.Num >= CurFun.Values.size())
330 return 0;
331 Value *Result = CurFun.Values[D.Num];
332 if (Ty != Result->getType()) {
333 GenerateError("Numbered value (%" + utostr(D.Num) + ") of type '" +
334 Result->getType()->getDescription() + "' does not match "
335 "expected type, '" + Ty->getDescription() + "'");
336 return 0;
337 }
338 return Result;
339 }
340 case ValID::GlobalID: { // Is it a numbered definition?
341 if (D.Num >= CurModule.Values.size())
342 return 0;
343 Value *Result = CurModule.Values[D.Num];
344 if (Ty != Result->getType()) {
345 GenerateError("Numbered value (@" + utostr(D.Num) + ") of type '" +
346 Result->getType()->getDescription() + "' does not match "
347 "expected type, '" + Ty->getDescription() + "'");
348 return 0;
349 }
350 return Result;
351 }
352
353 case ValID::LocalName: { // Is it a named definition?
354 if (!inFunctionScope())
355 return 0;
356 ValueSymbolTable &SymTab = CurFun.CurrentFunction->getValueSymbolTable();
357 Value *N = SymTab.lookup(D.getName());
358 if (N == 0)
359 return 0;
360 if (N->getType() != Ty)
361 return 0;
362
363 D.destroy(); // Free old strdup'd memory...
364 return N;
365 }
366 case ValID::GlobalName: { // Is it a named definition?
367 ValueSymbolTable &SymTab = CurModule.CurrentModule->getValueSymbolTable();
368 Value *N = SymTab.lookup(D.getName());
369 if (N == 0)
370 return 0;
371 if (N->getType() != Ty)
372 return 0;
373
374 D.destroy(); // Free old strdup'd memory...
375 return N;
376 }
377
378 // Check to make sure that "Ty" is an integral type, and that our
379 // value will fit into the specified type...
380 case ValID::ConstSIntVal: // Is it a constant pool reference??
Chris Lattner97d8e5f2008-02-19 04:36:07 +0000381 if (!isa<IntegerType>(Ty) ||
382 !ConstantInt::isValueValidForType(Ty, D.ConstPool64)) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000383 GenerateError("Signed integral constant '" +
384 itostr(D.ConstPool64) + "' is invalid for type '" +
385 Ty->getDescription() + "'");
386 return 0;
387 }
388 return ConstantInt::get(Ty, D.ConstPool64, true);
389
390 case ValID::ConstUIntVal: // Is it an unsigned const pool reference?
Chris Lattner97d8e5f2008-02-19 04:36:07 +0000391 if (isa<IntegerType>(Ty) &&
392 ConstantInt::isValueValidForType(Ty, D.UConstPool64))
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000393 return ConstantInt::get(Ty, D.UConstPool64);
Chris Lattner97d8e5f2008-02-19 04:36:07 +0000394
395 if (!isa<IntegerType>(Ty) ||
396 !ConstantInt::isValueValidForType(Ty, D.ConstPool64)) {
397 GenerateError("Integral constant '" + utostr(D.UConstPool64) +
398 "' is invalid or out of range for type '" +
399 Ty->getDescription() + "'");
400 return 0;
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000401 }
Chris Lattner97d8e5f2008-02-19 04:36:07 +0000402 // This is really a signed reference. Transmogrify.
403 return ConstantInt::get(Ty, D.ConstPool64, true);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000404
405 case ValID::ConstFPVal: // Is it a floating point const pool reference?
Chris Lattner97d8e5f2008-02-19 04:36:07 +0000406 if (!Ty->isFloatingPoint() ||
407 !ConstantFP::isValueValidForType(Ty, *D.ConstPoolFP)) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000408 GenerateError("FP constant invalid for type");
409 return 0;
410 }
Dale Johannesen1616e902007-09-11 18:32:33 +0000411 // Lexer has no type info, so builds all float and double FP constants
412 // as double. Fix this here. Long double does not need this.
413 if (&D.ConstPoolFP->getSemantics() == &APFloat::IEEEdouble &&
414 Ty==Type::FloatTy)
Dale Johannesenb9de9f02007-09-06 18:13:44 +0000415 D.ConstPoolFP->convert(APFloat::IEEEsingle, APFloat::rmNearestTiesToEven);
416 return ConstantFP::get(Ty, *D.ConstPoolFP);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000417
418 case ValID::ConstNullVal: // Is it a null value?
419 if (!isa<PointerType>(Ty)) {
420 GenerateError("Cannot create a a non pointer null");
421 return 0;
422 }
423 return ConstantPointerNull::get(cast<PointerType>(Ty));
424
425 case ValID::ConstUndefVal: // Is it an undef value?
426 return UndefValue::get(Ty);
427
428 case ValID::ConstZeroVal: // Is it a zero value?
429 return Constant::getNullValue(Ty);
430
431 case ValID::ConstantVal: // Fully resolved constant?
432 if (D.ConstantValue->getType() != Ty) {
433 GenerateError("Constant expression type different from required type");
434 return 0;
435 }
436 return D.ConstantValue;
437
438 case ValID::InlineAsmVal: { // Inline asm expression
439 const PointerType *PTy = dyn_cast<PointerType>(Ty);
440 const FunctionType *FTy =
441 PTy ? dyn_cast<FunctionType>(PTy->getElementType()) : 0;
442 if (!FTy || !InlineAsm::Verify(FTy, D.IAD->Constraints)) {
443 GenerateError("Invalid type for asm constraint string");
444 return 0;
445 }
446 InlineAsm *IA = InlineAsm::get(FTy, D.IAD->AsmString, D.IAD->Constraints,
447 D.IAD->HasSideEffects);
448 D.destroy(); // Free InlineAsmDescriptor.
449 return IA;
450 }
451 default:
452 assert(0 && "Unhandled case!");
453 return 0;
454 } // End of switch
455
456 assert(0 && "Unhandled case!");
457 return 0;
458}
459
460// getVal - This function is identical to getExistingVal, except that if a
461// value is not already defined, it "improvises" by creating a placeholder var
462// that looks and acts just like the requested variable. When the value is
463// defined later, all uses of the placeholder variable are replaced with the
464// real thing.
465//
466static Value *getVal(const Type *Ty, const ValID &ID) {
467 if (Ty == Type::LabelTy) {
468 GenerateError("Cannot use a basic block here");
469 return 0;
470 }
471
472 // See if the value has already been defined.
473 Value *V = getExistingVal(Ty, ID);
474 if (V) return V;
475 if (TriggerError) return 0;
476
477 if (!Ty->isFirstClassType() && !isa<OpaqueType>(Ty)) {
478 GenerateError("Invalid use of a composite type");
479 return 0;
480 }
481
482 // If we reached here, we referenced either a symbol that we don't know about
483 // or an id number that hasn't been read yet. We may be referencing something
484 // forward, so just create an entry to be resolved later and get to it...
485 //
486 switch (ID.Type) {
487 case ValID::GlobalName:
488 case ValID::GlobalID: {
489 const PointerType *PTy = dyn_cast<PointerType>(Ty);
490 if (!PTy) {
491 GenerateError("Invalid type for reference to global" );
492 return 0;
493 }
494 const Type* ElTy = PTy->getElementType();
495 if (const FunctionType *FTy = dyn_cast<FunctionType>(ElTy))
496 V = new Function(FTy, GlobalValue::ExternalLinkage);
497 else
Christopher Lamb44d62f62007-12-11 08:59:05 +0000498 V = new GlobalVariable(ElTy, false, GlobalValue::ExternalLinkage, 0, "",
499 (Module*)0, false, PTy->getAddressSpace());
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000500 break;
501 }
502 default:
503 V = new Argument(Ty);
504 }
505
506 // Remember where this forward reference came from. FIXME, shouldn't we try
507 // to recycle these things??
508 CurModule.PlaceHolderInfo.insert(std::make_pair(V, std::make_pair(ID,
Chris Lattner17e73c22007-11-18 08:46:26 +0000509 LLLgetLineNo())));
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000510
511 if (inFunctionScope())
512 InsertValue(V, CurFun.LateResolveValues);
513 else
514 InsertValue(V, CurModule.LateResolveValues);
515 return V;
516}
517
518/// defineBBVal - This is a definition of a new basic block with the specified
519/// identifier which must be the same as CurFun.NextValNum, if its numeric.
520static BasicBlock *defineBBVal(const ValID &ID) {
521 assert(inFunctionScope() && "Can't get basic block at global scope!");
522
523 BasicBlock *BB = 0;
524
525 // First, see if this was forward referenced
526
527 std::map<ValID, BasicBlock*>::iterator BBI = CurFun.BBForwardRefs.find(ID);
528 if (BBI != CurFun.BBForwardRefs.end()) {
529 BB = BBI->second;
530 // The forward declaration could have been inserted anywhere in the
531 // function: insert it into the correct place now.
532 CurFun.CurrentFunction->getBasicBlockList().remove(BB);
533 CurFun.CurrentFunction->getBasicBlockList().push_back(BB);
534
535 // We're about to erase the entry, save the key so we can clean it up.
536 ValID Tmp = BBI->first;
537
538 // Erase the forward ref from the map as its no longer "forward"
539 CurFun.BBForwardRefs.erase(ID);
540
541 // The key has been removed from the map but so we don't want to leave
542 // strdup'd memory around so destroy it too.
543 Tmp.destroy();
544
545 // If its a numbered definition, bump the number and set the BB value.
546 if (ID.Type == ValID::LocalID) {
547 assert(ID.Num == CurFun.NextValNum && "Invalid new block number");
548 InsertValue(BB);
549 }
550
551 ID.destroy();
552 return BB;
553 }
554
555 // We haven't seen this BB before and its first mention is a definition.
556 // Just create it and return it.
557 std::string Name (ID.Type == ValID::LocalName ? ID.getName() : "");
558 BB = new BasicBlock(Name, CurFun.CurrentFunction);
559 if (ID.Type == ValID::LocalID) {
560 assert(ID.Num == CurFun.NextValNum && "Invalid new block number");
561 InsertValue(BB);
562 }
563
564 ID.destroy(); // Free strdup'd memory
565 return BB;
566}
567
568/// getBBVal - get an existing BB value or create a forward reference for it.
569///
570static BasicBlock *getBBVal(const ValID &ID) {
571 assert(inFunctionScope() && "Can't get basic block at global scope!");
572
573 BasicBlock *BB = 0;
574
575 std::map<ValID, BasicBlock*>::iterator BBI = CurFun.BBForwardRefs.find(ID);
576 if (BBI != CurFun.BBForwardRefs.end()) {
577 BB = BBI->second;
578 } if (ID.Type == ValID::LocalName) {
579 std::string Name = ID.getName();
580 Value *N = CurFun.CurrentFunction->getValueSymbolTable().lookup(Name);
581 if (N)
582 if (N->getType()->getTypeID() == Type::LabelTyID)
583 BB = cast<BasicBlock>(N);
584 else
585 GenerateError("Reference to label '" + Name + "' is actually of type '"+
586 N->getType()->getDescription() + "'");
587 } else if (ID.Type == ValID::LocalID) {
588 if (ID.Num < CurFun.NextValNum && ID.Num < CurFun.Values.size()) {
589 if (CurFun.Values[ID.Num]->getType()->getTypeID() == Type::LabelTyID)
590 BB = cast<BasicBlock>(CurFun.Values[ID.Num]);
591 else
592 GenerateError("Reference to label '%" + utostr(ID.Num) +
593 "' is actually of type '"+
594 CurFun.Values[ID.Num]->getType()->getDescription() + "'");
595 }
596 } else {
597 GenerateError("Illegal label reference " + ID.getName());
598 return 0;
599 }
600
601 // If its already been defined, return it now.
602 if (BB) {
603 ID.destroy(); // Free strdup'd memory.
604 return BB;
605 }
606
607 // Otherwise, this block has not been seen before, create it.
608 std::string Name;
609 if (ID.Type == ValID::LocalName)
610 Name = ID.getName();
611 BB = new BasicBlock(Name, CurFun.CurrentFunction);
612
613 // Insert it in the forward refs map.
614 CurFun.BBForwardRefs[ID] = BB;
615
616 return BB;
617}
618
619
620//===----------------------------------------------------------------------===//
621// Code to handle forward references in instructions
622//===----------------------------------------------------------------------===//
623//
624// This code handles the late binding needed with statements that reference
625// values not defined yet... for example, a forward branch, or the PHI node for
626// a loop body.
627//
628// This keeps a table (CurFun.LateResolveValues) of all such forward references
629// and back patchs after we are done.
630//
631
632// ResolveDefinitions - If we could not resolve some defs at parsing
633// time (forward branches, phi functions for loops, etc...) resolve the
634// defs now...
635//
636static void
637ResolveDefinitions(ValueList &LateResolvers, ValueList *FutureLateResolvers) {
638 // Loop over LateResolveDefs fixing up stuff that couldn't be resolved
639 while (!LateResolvers.empty()) {
640 Value *V = LateResolvers.back();
641 LateResolvers.pop_back();
642
643 std::map<Value*, std::pair<ValID, int> >::iterator PHI =
644 CurModule.PlaceHolderInfo.find(V);
645 assert(PHI != CurModule.PlaceHolderInfo.end() && "Placeholder error!");
646
647 ValID &DID = PHI->second.first;
648
649 Value *TheRealValue = getExistingVal(V->getType(), DID);
650 if (TriggerError)
651 return;
652 if (TheRealValue) {
653 V->replaceAllUsesWith(TheRealValue);
654 delete V;
655 CurModule.PlaceHolderInfo.erase(PHI);
656 } else if (FutureLateResolvers) {
657 // Functions have their unresolved items forwarded to the module late
658 // resolver table
659 InsertValue(V, *FutureLateResolvers);
660 } else {
661 if (DID.Type == ValID::LocalName || DID.Type == ValID::GlobalName) {
662 GenerateError("Reference to an invalid definition: '" +DID.getName()+
663 "' of type '" + V->getType()->getDescription() + "'",
664 PHI->second.second);
665 return;
666 } else {
667 GenerateError("Reference to an invalid definition: #" +
668 itostr(DID.Num) + " of type '" +
669 V->getType()->getDescription() + "'",
670 PHI->second.second);
671 return;
672 }
673 }
674 }
675 LateResolvers.clear();
676}
677
678// ResolveTypeTo - A brand new type was just declared. This means that (if
679// name is not null) things referencing Name can be resolved. Otherwise, things
680// refering to the number can be resolved. Do this now.
681//
682static void ResolveTypeTo(std::string *Name, const Type *ToTy) {
683 ValID D;
684 if (Name)
685 D = ValID::createLocalName(*Name);
686 else
687 D = ValID::createLocalID(CurModule.Types.size());
688
689 std::map<ValID, PATypeHolder>::iterator I =
690 CurModule.LateResolveTypes.find(D);
691 if (I != CurModule.LateResolveTypes.end()) {
692 ((DerivedType*)I->second.get())->refineAbstractTypeTo(ToTy);
693 CurModule.LateResolveTypes.erase(I);
694 }
695}
696
697// setValueName - Set the specified value to the name given. The name may be
698// null potentially, in which case this is a noop. The string passed in is
699// assumed to be a malloc'd string buffer, and is free'd by this function.
700//
701static void setValueName(Value *V, std::string *NameStr) {
702 if (!NameStr) return;
703 std::string Name(*NameStr); // Copy string
704 delete NameStr; // Free old string
705
706 if (V->getType() == Type::VoidTy) {
707 GenerateError("Can't assign name '" + Name+"' to value with void type");
708 return;
709 }
710
711 assert(inFunctionScope() && "Must be in function scope!");
712 ValueSymbolTable &ST = CurFun.CurrentFunction->getValueSymbolTable();
713 if (ST.lookup(Name)) {
714 GenerateError("Redefinition of value '" + Name + "' of type '" +
715 V->getType()->getDescription() + "'");
716 return;
717 }
718
719 // Set the name.
720 V->setName(Name);
721}
722
723/// ParseGlobalVariable - Handle parsing of a global. If Initializer is null,
724/// this is a declaration, otherwise it is a definition.
725static GlobalVariable *
726ParseGlobalVariable(std::string *NameStr,
727 GlobalValue::LinkageTypes Linkage,
728 GlobalValue::VisibilityTypes Visibility,
729 bool isConstantGlobal, const Type *Ty,
Christopher Lamb44d62f62007-12-11 08:59:05 +0000730 Constant *Initializer, bool IsThreadLocal,
731 unsigned AddressSpace = 0) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000732 if (isa<FunctionType>(Ty)) {
733 GenerateError("Cannot declare global vars of function type");
734 return 0;
735 }
736
Christopher Lamb44d62f62007-12-11 08:59:05 +0000737 const PointerType *PTy = PointerType::get(Ty, AddressSpace);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000738
739 std::string Name;
740 if (NameStr) {
741 Name = *NameStr; // Copy string
742 delete NameStr; // Free old string
743 }
744
745 // See if this global value was forward referenced. If so, recycle the
746 // object.
747 ValID ID;
748 if (!Name.empty()) {
749 ID = ValID::createGlobalName(Name);
750 } else {
751 ID = ValID::createGlobalID(CurModule.Values.size());
752 }
753
754 if (GlobalValue *FWGV = CurModule.GetForwardRefForGlobal(PTy, ID)) {
755 // Move the global to the end of the list, from whereever it was
756 // previously inserted.
757 GlobalVariable *GV = cast<GlobalVariable>(FWGV);
758 CurModule.CurrentModule->getGlobalList().remove(GV);
759 CurModule.CurrentModule->getGlobalList().push_back(GV);
760 GV->setInitializer(Initializer);
761 GV->setLinkage(Linkage);
762 GV->setVisibility(Visibility);
763 GV->setConstant(isConstantGlobal);
764 GV->setThreadLocal(IsThreadLocal);
765 InsertValue(GV, CurModule.Values);
766 return GV;
767 }
768
769 // If this global has a name
770 if (!Name.empty()) {
771 // if the global we're parsing has an initializer (is a definition) and
772 // has external linkage.
773 if (Initializer && Linkage != GlobalValue::InternalLinkage)
774 // If there is already a global with external linkage with this name
775 if (CurModule.CurrentModule->getGlobalVariable(Name, false)) {
776 // If we allow this GVar to get created, it will be renamed in the
777 // symbol table because it conflicts with an existing GVar. We can't
778 // allow redefinition of GVars whose linking indicates that their name
779 // must stay the same. Issue the error.
780 GenerateError("Redefinition of global variable named '" + Name +
781 "' of type '" + Ty->getDescription() + "'");
782 return 0;
783 }
784 }
785
786 // Otherwise there is no existing GV to use, create one now.
787 GlobalVariable *GV =
788 new GlobalVariable(Ty, isConstantGlobal, Linkage, Initializer, Name,
Christopher Lamb44d62f62007-12-11 08:59:05 +0000789 CurModule.CurrentModule, IsThreadLocal, AddressSpace);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000790 GV->setVisibility(Visibility);
791 InsertValue(GV, CurModule.Values);
792 return GV;
793}
794
795// setTypeName - Set the specified type to the name given. The name may be
796// null potentially, in which case this is a noop. The string passed in is
797// assumed to be a malloc'd string buffer, and is freed by this function.
798//
799// This function returns true if the type has already been defined, but is
800// allowed to be redefined in the specified context. If the name is a new name
801// for the type plane, it is inserted and false is returned.
802static bool setTypeName(const Type *T, std::string *NameStr) {
803 assert(!inFunctionScope() && "Can't give types function-local names!");
804 if (NameStr == 0) return false;
805
806 std::string Name(*NameStr); // Copy string
807 delete NameStr; // Free old string
808
809 // We don't allow assigning names to void type
810 if (T == Type::VoidTy) {
811 GenerateError("Can't assign name '" + Name + "' to the void type");
812 return false;
813 }
814
815 // Set the type name, checking for conflicts as we do so.
816 bool AlreadyExists = CurModule.CurrentModule->addTypeName(Name, T);
817
818 if (AlreadyExists) { // Inserting a name that is already defined???
819 const Type *Existing = CurModule.CurrentModule->getTypeByName(Name);
820 assert(Existing && "Conflict but no matching type?!");
821
822 // There is only one case where this is allowed: when we are refining an
823 // opaque type. In this case, Existing will be an opaque type.
824 if (const OpaqueType *OpTy = dyn_cast<OpaqueType>(Existing)) {
825 // We ARE replacing an opaque type!
826 const_cast<OpaqueType*>(OpTy)->refineAbstractTypeTo(T);
827 return true;
828 }
829
830 // Otherwise, this is an attempt to redefine a type. That's okay if
831 // the redefinition is identical to the original. This will be so if
832 // Existing and T point to the same Type object. In this one case we
833 // allow the equivalent redefinition.
834 if (Existing == T) return true; // Yes, it's equal.
835
836 // Any other kind of (non-equivalent) redefinition is an error.
837 GenerateError("Redefinition of type named '" + Name + "' of type '" +
838 T->getDescription() + "'");
839 }
840
841 return false;
842}
843
844//===----------------------------------------------------------------------===//
845// Code for handling upreferences in type names...
846//
847
848// TypeContains - Returns true if Ty directly contains E in it.
849//
850static bool TypeContains(const Type *Ty, const Type *E) {
851 return std::find(Ty->subtype_begin(), Ty->subtype_end(),
852 E) != Ty->subtype_end();
853}
854
855namespace {
856 struct UpRefRecord {
857 // NestingLevel - The number of nesting levels that need to be popped before
858 // this type is resolved.
859 unsigned NestingLevel;
860
861 // LastContainedTy - This is the type at the current binding level for the
862 // type. Every time we reduce the nesting level, this gets updated.
863 const Type *LastContainedTy;
864
865 // UpRefTy - This is the actual opaque type that the upreference is
866 // represented with.
867 OpaqueType *UpRefTy;
868
869 UpRefRecord(unsigned NL, OpaqueType *URTy)
870 : NestingLevel(NL), LastContainedTy(URTy), UpRefTy(URTy) {}
871 };
872}
873
874// UpRefs - A list of the outstanding upreferences that need to be resolved.
875static std::vector<UpRefRecord> UpRefs;
876
877/// HandleUpRefs - Every time we finish a new layer of types, this function is
878/// called. It loops through the UpRefs vector, which is a list of the
879/// currently active types. For each type, if the up reference is contained in
880/// the newly completed type, we decrement the level count. When the level
881/// count reaches zero, the upreferenced type is the type that is passed in:
882/// thus we can complete the cycle.
883///
884static PATypeHolder HandleUpRefs(const Type *ty) {
885 // If Ty isn't abstract, or if there are no up-references in it, then there is
886 // nothing to resolve here.
887 if (!ty->isAbstract() || UpRefs.empty()) return ty;
888
889 PATypeHolder Ty(ty);
890 UR_OUT("Type '" << Ty->getDescription() <<
891 "' newly formed. Resolving upreferences.\n" <<
892 UpRefs.size() << " upreferences active!\n");
893
894 // If we find any resolvable upreferences (i.e., those whose NestingLevel goes
895 // to zero), we resolve them all together before we resolve them to Ty. At
896 // the end of the loop, if there is anything to resolve to Ty, it will be in
897 // this variable.
898 OpaqueType *TypeToResolve = 0;
899
900 for (unsigned i = 0; i != UpRefs.size(); ++i) {
901 UR_OUT(" UR#" << i << " - TypeContains(" << Ty->getDescription() << ", "
902 << UpRefs[i].second->getDescription() << ") = "
903 << (TypeContains(Ty, UpRefs[i].second) ? "true" : "false") << "\n");
904 if (TypeContains(Ty, UpRefs[i].LastContainedTy)) {
905 // Decrement level of upreference
906 unsigned Level = --UpRefs[i].NestingLevel;
907 UpRefs[i].LastContainedTy = Ty;
908 UR_OUT(" Uplevel Ref Level = " << Level << "\n");
909 if (Level == 0) { // Upreference should be resolved!
910 if (!TypeToResolve) {
911 TypeToResolve = UpRefs[i].UpRefTy;
912 } else {
913 UR_OUT(" * Resolving upreference for "
914 << UpRefs[i].second->getDescription() << "\n";
915 std::string OldName = UpRefs[i].UpRefTy->getDescription());
916 UpRefs[i].UpRefTy->refineAbstractTypeTo(TypeToResolve);
917 UR_OUT(" * Type '" << OldName << "' refined upreference to: "
918 << (const void*)Ty << ", " << Ty->getDescription() << "\n");
919 }
920 UpRefs.erase(UpRefs.begin()+i); // Remove from upreference list...
921 --i; // Do not skip the next element...
922 }
923 }
924 }
925
926 if (TypeToResolve) {
927 UR_OUT(" * Resolving upreference for "
928 << UpRefs[i].second->getDescription() << "\n";
929 std::string OldName = TypeToResolve->getDescription());
930 TypeToResolve->refineAbstractTypeTo(Ty);
931 }
932
933 return Ty;
934}
935
936//===----------------------------------------------------------------------===//
937// RunVMAsmParser - Define an interface to this parser
938//===----------------------------------------------------------------------===//
939//
940static Module* RunParser(Module * M);
941
Chris Lattner17e73c22007-11-18 08:46:26 +0000942Module *llvm::RunVMAsmParser(llvm::MemoryBuffer *MB) {
943 InitLLLexer(MB);
944 Module *M = RunParser(new Module(LLLgetFilename()));
945 FreeLexer();
946 return M;
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000947}
948
949%}
950
951%union {
952 llvm::Module *ModuleVal;
953 llvm::Function *FunctionVal;
954 llvm::BasicBlock *BasicBlockVal;
955 llvm::TerminatorInst *TermInstVal;
956 llvm::Instruction *InstVal;
957 llvm::Constant *ConstVal;
958
959 const llvm::Type *PrimType;
960 std::list<llvm::PATypeHolder> *TypeList;
961 llvm::PATypeHolder *TypeVal;
962 llvm::Value *ValueVal;
963 std::vector<llvm::Value*> *ValueList;
964 llvm::ArgListType *ArgList;
965 llvm::TypeWithAttrs TypeWithAttrs;
966 llvm::TypeWithAttrsList *TypeWithAttrsList;
Dale Johannesencfb19e62007-11-05 21:20:28 +0000967 llvm::ParamList *ParamList;
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000968
969 // Represent the RHS of PHI node
970 std::list<std::pair<llvm::Value*,
971 llvm::BasicBlock*> > *PHIList;
972 std::vector<std::pair<llvm::Constant*, llvm::BasicBlock*> > *JumpTable;
973 std::vector<llvm::Constant*> *ConstVector;
974
975 llvm::GlobalValue::LinkageTypes Linkage;
976 llvm::GlobalValue::VisibilityTypes Visibility;
Dale Johannesenf4666f52008-02-19 21:38:47 +0000977 llvm::ParameterAttributes ParamAttrs;
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000978 llvm::APInt *APIntVal;
979 int64_t SInt64Val;
980 uint64_t UInt64Val;
981 int SIntVal;
982 unsigned UIntVal;
Dale Johannesenb9de9f02007-09-06 18:13:44 +0000983 llvm::APFloat *FPVal;
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000984 bool BoolVal;
985
986 std::string *StrVal; // This memory must be deleted
987 llvm::ValID ValIDVal;
988
989 llvm::Instruction::BinaryOps BinaryOpVal;
990 llvm::Instruction::TermOps TermOpVal;
991 llvm::Instruction::MemoryOps MemOpVal;
992 llvm::Instruction::CastOps CastOpVal;
993 llvm::Instruction::OtherOps OtherOpVal;
994 llvm::ICmpInst::Predicate IPredicate;
995 llvm::FCmpInst::Predicate FPredicate;
996}
997
998%type <ModuleVal> Module
999%type <FunctionVal> Function FunctionProto FunctionHeader BasicBlockList
1000%type <BasicBlockVal> BasicBlock InstructionList
1001%type <TermInstVal> BBTerminatorInst
1002%type <InstVal> Inst InstVal MemoryInst
1003%type <ConstVal> ConstVal ConstExpr AliaseeRef
1004%type <ConstVector> ConstVector
1005%type <ArgList> ArgList ArgListH
1006%type <PHIList> PHIList
Dale Johannesencfb19e62007-11-05 21:20:28 +00001007%type <ParamList> ParamList // For call param lists & GEP indices
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001008%type <ValueList> IndexList // For GEP indices
1009%type <TypeList> TypeListI
1010%type <TypeWithAttrsList> ArgTypeList ArgTypeListI
1011%type <TypeWithAttrs> ArgType
1012%type <JumpTable> JumpTable
1013%type <BoolVal> GlobalType // GLOBAL or CONSTANT?
1014%type <BoolVal> ThreadLocal // 'thread_local' or not
1015%type <BoolVal> OptVolatile // 'volatile' or not
1016%type <BoolVal> OptTailCall // TAIL CALL or plain CALL.
1017%type <BoolVal> OptSideEffect // 'sideeffect' or not.
1018%type <Linkage> GVInternalLinkage GVExternalLinkage
1019%type <Linkage> FunctionDefineLinkage FunctionDeclareLinkage
1020%type <Linkage> AliasLinkage
1021%type <Visibility> GVVisibilityStyle
1022
1023// ValueRef - Unresolved reference to a definition or BB
1024%type <ValIDVal> ValueRef ConstValueRef SymbolicValueRef
1025%type <ValueVal> ResolvedVal // <type> <valref> pair
1026// Tokens and types for handling constant integer values
1027//
1028// ESINT64VAL - A negative number within long long range
1029%token <SInt64Val> ESINT64VAL
1030
1031// EUINT64VAL - A positive number within uns. long long range
1032%token <UInt64Val> EUINT64VAL
1033
1034// ESAPINTVAL - A negative number with arbitrary precision
1035%token <APIntVal> ESAPINTVAL
1036
1037// EUAPINTVAL - A positive number with arbitrary precision
1038%token <APIntVal> EUAPINTVAL
1039
1040%token <UIntVal> LOCALVAL_ID GLOBALVAL_ID // %123 @123
1041%token <FPVal> FPVAL // Float or Double constant
1042
1043// Built in types...
1044%type <TypeVal> Types ResultTypes
1045%type <PrimType> IntType FPType PrimType // Classifications
1046%token <PrimType> VOID INTTYPE
Dale Johannesenf325d9f2007-08-03 01:03:46 +00001047%token <PrimType> FLOAT DOUBLE X86_FP80 FP128 PPC_FP128 LABEL
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001048%token TYPE
1049
1050
1051%token<StrVal> LOCALVAR GLOBALVAR LABELSTR
1052%token<StrVal> STRINGCONSTANT ATSTRINGCONSTANT PCTSTRINGCONSTANT
1053%type <StrVal> LocalName OptLocalName OptLocalAssign
1054%type <StrVal> GlobalName OptGlobalAssign GlobalAssign
Gordon Henriksen13fe5e32007-12-10 03:18:06 +00001055%type <StrVal> OptSection SectionString OptGC
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001056
Christopher Lamb20a39e92007-12-12 08:44:39 +00001057%type <UIntVal> OptAlign OptCAlign OptAddrSpace
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001058
1059%token ZEROINITIALIZER TRUETOK FALSETOK BEGINTOK ENDTOK
1060%token DECLARE DEFINE GLOBAL CONSTANT SECTION ALIAS VOLATILE THREAD_LOCAL
1061%token TO DOTDOTDOT NULL_TOK UNDEF INTERNAL LINKONCE WEAK APPENDING
1062%token DLLIMPORT DLLEXPORT EXTERN_WEAK
Christopher Lamb44d62f62007-12-11 08:59:05 +00001063%token OPAQUE EXTERNAL TARGET TRIPLE ALIGN ADDRSPACE
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001064%token DEPLIBS CALL TAIL ASM_TOK MODULE SIDEEFFECT
1065%token CC_TOK CCC_TOK FASTCC_TOK COLDCC_TOK X86_STDCALLCC_TOK X86_FASTCALLCC_TOK
1066%token DATALAYOUT
1067%type <UIntVal> OptCallingConv
1068%type <ParamAttrs> OptParamAttrs ParamAttr
1069%type <ParamAttrs> OptFuncAttrs FuncAttr
1070
1071// Basic Block Terminating Operators
1072%token <TermOpVal> RET BR SWITCH INVOKE UNWIND UNREACHABLE
1073
1074// Binary Operators
1075%type <BinaryOpVal> ArithmeticOps LogicalOps // Binops Subcatagories
1076%token <BinaryOpVal> ADD SUB MUL UDIV SDIV FDIV UREM SREM FREM AND OR XOR
1077%token <BinaryOpVal> SHL LSHR ASHR
1078
1079%token <OtherOpVal> ICMP FCMP
1080%type <IPredicate> IPredicates
1081%type <FPredicate> FPredicates
1082%token EQ NE SLT SGT SLE SGE ULT UGT ULE UGE
1083%token OEQ ONE OLT OGT OLE OGE ORD UNO UEQ UNE
1084
1085// Memory Instructions
1086%token <MemOpVal> MALLOC ALLOCA FREE LOAD STORE GETELEMENTPTR
1087
1088// Cast Operators
1089%type <CastOpVal> CastOps
1090%token <CastOpVal> TRUNC ZEXT SEXT FPTRUNC FPEXT BITCAST
1091%token <CastOpVal> UITOFP SITOFP FPTOUI FPTOSI INTTOPTR PTRTOINT
1092
1093// Other Operators
1094%token <OtherOpVal> PHI_TOK SELECT VAARG
1095%token <OtherOpVal> EXTRACTELEMENT INSERTELEMENT SHUFFLEVECTOR
Devang Patele5c806a2008-02-19 22:26:37 +00001096%token <OtherOpVal> GETRESULT
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001097
1098// Function Attributes
Duncan Sands38947cd2007-07-27 12:58:54 +00001099%token SIGNEXT ZEROEXT NORETURN INREG SRET NOUNWIND NOALIAS BYVAL NEST
Gordon Henriksen13fe5e32007-12-10 03:18:06 +00001100%token READNONE READONLY GC
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001101
1102// Visibility Styles
1103%token DEFAULT HIDDEN PROTECTED
1104
1105%start Module
1106%%
1107
1108
1109// Operations that are notably excluded from this list include:
1110// RET, BR, & SWITCH because they end basic blocks and are treated specially.
1111//
1112ArithmeticOps: ADD | SUB | MUL | UDIV | SDIV | FDIV | UREM | SREM | FREM;
1113LogicalOps : SHL | LSHR | ASHR | AND | OR | XOR;
1114CastOps : TRUNC | ZEXT | SEXT | FPTRUNC | FPEXT | BITCAST |
1115 UITOFP | SITOFP | FPTOUI | FPTOSI | INTTOPTR | PTRTOINT;
1116
1117IPredicates
1118 : EQ { $$ = ICmpInst::ICMP_EQ; } | NE { $$ = ICmpInst::ICMP_NE; }
1119 | SLT { $$ = ICmpInst::ICMP_SLT; } | SGT { $$ = ICmpInst::ICMP_SGT; }
1120 | SLE { $$ = ICmpInst::ICMP_SLE; } | SGE { $$ = ICmpInst::ICMP_SGE; }
1121 | ULT { $$ = ICmpInst::ICMP_ULT; } | UGT { $$ = ICmpInst::ICMP_UGT; }
1122 | ULE { $$ = ICmpInst::ICMP_ULE; } | UGE { $$ = ICmpInst::ICMP_UGE; }
1123 ;
1124
1125FPredicates
1126 : OEQ { $$ = FCmpInst::FCMP_OEQ; } | ONE { $$ = FCmpInst::FCMP_ONE; }
1127 | OLT { $$ = FCmpInst::FCMP_OLT; } | OGT { $$ = FCmpInst::FCMP_OGT; }
1128 | OLE { $$ = FCmpInst::FCMP_OLE; } | OGE { $$ = FCmpInst::FCMP_OGE; }
1129 | ORD { $$ = FCmpInst::FCMP_ORD; } | UNO { $$ = FCmpInst::FCMP_UNO; }
1130 | UEQ { $$ = FCmpInst::FCMP_UEQ; } | UNE { $$ = FCmpInst::FCMP_UNE; }
1131 | ULT { $$ = FCmpInst::FCMP_ULT; } | UGT { $$ = FCmpInst::FCMP_UGT; }
1132 | ULE { $$ = FCmpInst::FCMP_ULE; } | UGE { $$ = FCmpInst::FCMP_UGE; }
1133 | TRUETOK { $$ = FCmpInst::FCMP_TRUE; }
1134 | FALSETOK { $$ = FCmpInst::FCMP_FALSE; }
1135 ;
1136
1137// These are some types that allow classification if we only want a particular
1138// thing... for example, only a signed, unsigned, or integral type.
1139IntType : INTTYPE;
Dale Johannesenf325d9f2007-08-03 01:03:46 +00001140FPType : FLOAT | DOUBLE | PPC_FP128 | FP128 | X86_FP80;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001141
1142LocalName : LOCALVAR | STRINGCONSTANT | PCTSTRINGCONSTANT ;
1143OptLocalName : LocalName | /*empty*/ { $$ = 0; };
1144
Christopher Lamb20a39e92007-12-12 08:44:39 +00001145OptAddrSpace : ADDRSPACE '(' EUINT64VAL ')' { $$=$3; }
1146 | /*empty*/ { $$=0; };
1147
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001148/// OptLocalAssign - Value producing statements have an optional assignment
1149/// component.
1150OptLocalAssign : LocalName '=' {
1151 $$ = $1;
1152 CHECK_FOR_ERROR
1153 }
1154 | /*empty*/ {
1155 $$ = 0;
1156 CHECK_FOR_ERROR
1157 };
1158
1159GlobalName : GLOBALVAR | ATSTRINGCONSTANT ;
1160
1161OptGlobalAssign : GlobalAssign
1162 | /*empty*/ {
1163 $$ = 0;
1164 CHECK_FOR_ERROR
1165 };
1166
1167GlobalAssign : GlobalName '=' {
1168 $$ = $1;
1169 CHECK_FOR_ERROR
1170 };
1171
1172GVInternalLinkage
1173 : INTERNAL { $$ = GlobalValue::InternalLinkage; }
1174 | WEAK { $$ = GlobalValue::WeakLinkage; }
1175 | LINKONCE { $$ = GlobalValue::LinkOnceLinkage; }
1176 | APPENDING { $$ = GlobalValue::AppendingLinkage; }
1177 | DLLEXPORT { $$ = GlobalValue::DLLExportLinkage; }
1178 ;
1179
1180GVExternalLinkage
1181 : DLLIMPORT { $$ = GlobalValue::DLLImportLinkage; }
1182 | EXTERN_WEAK { $$ = GlobalValue::ExternalWeakLinkage; }
1183 | EXTERNAL { $$ = GlobalValue::ExternalLinkage; }
1184 ;
1185
1186GVVisibilityStyle
1187 : /*empty*/ { $$ = GlobalValue::DefaultVisibility; }
1188 | DEFAULT { $$ = GlobalValue::DefaultVisibility; }
1189 | HIDDEN { $$ = GlobalValue::HiddenVisibility; }
1190 | PROTECTED { $$ = GlobalValue::ProtectedVisibility; }
1191 ;
1192
1193FunctionDeclareLinkage
1194 : /*empty*/ { $$ = GlobalValue::ExternalLinkage; }
1195 | DLLIMPORT { $$ = GlobalValue::DLLImportLinkage; }
1196 | EXTERN_WEAK { $$ = GlobalValue::ExternalWeakLinkage; }
1197 ;
1198
1199FunctionDefineLinkage
1200 : /*empty*/ { $$ = GlobalValue::ExternalLinkage; }
1201 | INTERNAL { $$ = GlobalValue::InternalLinkage; }
1202 | LINKONCE { $$ = GlobalValue::LinkOnceLinkage; }
1203 | WEAK { $$ = GlobalValue::WeakLinkage; }
1204 | DLLEXPORT { $$ = GlobalValue::DLLExportLinkage; }
1205 ;
1206
1207AliasLinkage
1208 : /*empty*/ { $$ = GlobalValue::ExternalLinkage; }
1209 | WEAK { $$ = GlobalValue::WeakLinkage; }
1210 | INTERNAL { $$ = GlobalValue::InternalLinkage; }
1211 ;
1212
1213OptCallingConv : /*empty*/ { $$ = CallingConv::C; } |
1214 CCC_TOK { $$ = CallingConv::C; } |
1215 FASTCC_TOK { $$ = CallingConv::Fast; } |
1216 COLDCC_TOK { $$ = CallingConv::Cold; } |
1217 X86_STDCALLCC_TOK { $$ = CallingConv::X86_StdCall; } |
1218 X86_FASTCALLCC_TOK { $$ = CallingConv::X86_FastCall; } |
1219 CC_TOK EUINT64VAL {
1220 if ((unsigned)$2 != $2)
1221 GEN_ERROR("Calling conv too large");
1222 $$ = $2;
1223 CHECK_FOR_ERROR
1224 };
1225
Reid Spencerf234bed2007-07-19 23:13:04 +00001226ParamAttr : ZEROEXT { $$ = ParamAttr::ZExt; }
Reid Spencer2abbad92007-07-31 02:57:37 +00001227 | ZEXT { $$ = ParamAttr::ZExt; }
Reid Spencerf234bed2007-07-19 23:13:04 +00001228 | SIGNEXT { $$ = ParamAttr::SExt; }
Reid Spencer2abbad92007-07-31 02:57:37 +00001229 | SEXT { $$ = ParamAttr::SExt; }
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001230 | INREG { $$ = ParamAttr::InReg; }
1231 | SRET { $$ = ParamAttr::StructRet; }
1232 | NOALIAS { $$ = ParamAttr::NoAlias; }
Duncan Sands38947cd2007-07-27 12:58:54 +00001233 | BYVAL { $$ = ParamAttr::ByVal; }
1234 | NEST { $$ = ParamAttr::Nest; }
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001235 ;
1236
1237OptParamAttrs : /* empty */ { $$ = ParamAttr::None; }
1238 | OptParamAttrs ParamAttr {
1239 $$ = $1 | $2;
1240 }
1241 ;
1242
1243FuncAttr : NORETURN { $$ = ParamAttr::NoReturn; }
1244 | NOUNWIND { $$ = ParamAttr::NoUnwind; }
Reid Spencerf234bed2007-07-19 23:13:04 +00001245 | ZEROEXT { $$ = ParamAttr::ZExt; }
1246 | SIGNEXT { $$ = ParamAttr::SExt; }
Duncan Sands13e13f82007-11-22 20:23:04 +00001247 | READNONE { $$ = ParamAttr::ReadNone; }
1248 | READONLY { $$ = ParamAttr::ReadOnly; }
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001249 ;
1250
1251OptFuncAttrs : /* empty */ { $$ = ParamAttr::None; }
1252 | OptFuncAttrs FuncAttr {
1253 $$ = $1 | $2;
1254 }
1255 ;
1256
Gordon Henriksen13fe5e32007-12-10 03:18:06 +00001257OptGC : /* empty */ { $$ = 0; }
1258 | GC STRINGCONSTANT {
1259 $$ = $2;
1260 }
1261 ;
1262
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001263// OptAlign/OptCAlign - An optional alignment, and an optional alignment with
1264// a comma before it.
1265OptAlign : /*empty*/ { $$ = 0; } |
1266 ALIGN EUINT64VAL {
1267 $$ = $2;
1268 if ($$ != 0 && !isPowerOf2_32($$))
1269 GEN_ERROR("Alignment must be a power of two");
1270 CHECK_FOR_ERROR
1271};
1272OptCAlign : /*empty*/ { $$ = 0; } |
1273 ',' ALIGN EUINT64VAL {
1274 $$ = $3;
1275 if ($$ != 0 && !isPowerOf2_32($$))
1276 GEN_ERROR("Alignment must be a power of two");
1277 CHECK_FOR_ERROR
1278};
1279
1280
Christopher Lamb44d62f62007-12-11 08:59:05 +00001281
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001282SectionString : SECTION STRINGCONSTANT {
1283 for (unsigned i = 0, e = $2->length(); i != e; ++i)
1284 if ((*$2)[i] == '"' || (*$2)[i] == '\\')
1285 GEN_ERROR("Invalid character in section name");
1286 $$ = $2;
1287 CHECK_FOR_ERROR
1288};
1289
1290OptSection : /*empty*/ { $$ = 0; } |
1291 SectionString { $$ = $1; };
1292
1293// GlobalVarAttributes - Used to pass the attributes string on a global. CurGV
1294// is set to be the global we are processing.
1295//
1296GlobalVarAttributes : /* empty */ {} |
1297 ',' GlobalVarAttribute GlobalVarAttributes {};
1298GlobalVarAttribute : SectionString {
1299 CurGV->setSection(*$1);
1300 delete $1;
1301 CHECK_FOR_ERROR
1302 }
1303 | ALIGN EUINT64VAL {
1304 if ($2 != 0 && !isPowerOf2_32($2))
1305 GEN_ERROR("Alignment must be a power of two");
1306 CurGV->setAlignment($2);
1307 CHECK_FOR_ERROR
1308 };
1309
1310//===----------------------------------------------------------------------===//
1311// Types includes all predefined types... except void, because it can only be
1312// used in specific contexts (function returning void for example).
1313
1314// Derived types are added later...
1315//
Dale Johannesenf325d9f2007-08-03 01:03:46 +00001316PrimType : INTTYPE | FLOAT | DOUBLE | PPC_FP128 | FP128 | X86_FP80 | LABEL ;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001317
1318Types
1319 : OPAQUE {
1320 $$ = new PATypeHolder(OpaqueType::get());
1321 CHECK_FOR_ERROR
1322 }
1323 | PrimType {
1324 $$ = new PATypeHolder($1);
1325 CHECK_FOR_ERROR
1326 }
Christopher Lamb20a39e92007-12-12 08:44:39 +00001327 | Types OptAddrSpace '*' { // Pointer type?
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001328 if (*$1 == Type::LabelTy)
1329 GEN_ERROR("Cannot form a pointer to a basic block");
Christopher Lamb20a39e92007-12-12 08:44:39 +00001330 $$ = new PATypeHolder(HandleUpRefs(PointerType::get(*$1, $2)));
Christopher Lamb44d62f62007-12-11 08:59:05 +00001331 delete $1;
1332 CHECK_FOR_ERROR
1333 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001334 | SymbolicValueRef { // Named types are also simple types...
1335 const Type* tmp = getTypeVal($1);
1336 CHECK_FOR_ERROR
1337 $$ = new PATypeHolder(tmp);
1338 }
1339 | '\\' EUINT64VAL { // Type UpReference
1340 if ($2 > (uint64_t)~0U) GEN_ERROR("Value out of range");
1341 OpaqueType *OT = OpaqueType::get(); // Use temporary placeholder
1342 UpRefs.push_back(UpRefRecord((unsigned)$2, OT)); // Add to vector...
1343 $$ = new PATypeHolder(OT);
1344 UR_OUT("New Upreference!\n");
1345 CHECK_FOR_ERROR
1346 }
1347 | Types '(' ArgTypeListI ')' OptFuncAttrs {
Duncan Sandsf5588dc2007-11-27 13:23:08 +00001348 // Allow but ignore attributes on function types; this permits auto-upgrade.
1349 // FIXME: remove in LLVM 3.0.
Anton Korobeynikova2c02272007-12-03 19:16:54 +00001350 const Type* RetTy = *$1;
Anton Korobeynikov9ab58082007-12-03 21:00:45 +00001351 if (!(RetTy->isFirstClassType() || RetTy == Type::VoidTy ||
1352 isa<OpaqueType>(RetTy)))
Anton Korobeynikova2c02272007-12-03 19:16:54 +00001353 GEN_ERROR("LLVM Functions cannot return aggregates");
1354
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001355 std::vector<const Type*> Params;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001356 TypeWithAttrsList::iterator I = $3->begin(), E = $3->end();
Duncan Sandsf5588dc2007-11-27 13:23:08 +00001357 for (; I != E; ++I ) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001358 const Type *Ty = I->Ty->get();
1359 Params.push_back(Ty);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001360 }
Anton Korobeynikova2c02272007-12-03 19:16:54 +00001361
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001362 bool isVarArg = Params.size() && Params.back() == Type::VoidTy;
1363 if (isVarArg) Params.pop_back();
1364
Anton Korobeynikov9ab58082007-12-03 21:00:45 +00001365 for (unsigned i = 0; i != Params.size(); ++i)
1366 if (!(Params[i]->isFirstClassType() || isa<OpaqueType>(Params[i])))
1367 GEN_ERROR("Function arguments must be value types!");
1368
1369 CHECK_FOR_ERROR
1370
Anton Korobeynikova2c02272007-12-03 19:16:54 +00001371 FunctionType *FT = FunctionType::get(RetTy, Params, isVarArg);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001372 delete $3; // Delete the argument list
1373 delete $1; // Delete the return type handle
1374 $$ = new PATypeHolder(HandleUpRefs(FT));
1375 CHECK_FOR_ERROR
1376 }
1377 | VOID '(' ArgTypeListI ')' OptFuncAttrs {
Duncan Sandsf5588dc2007-11-27 13:23:08 +00001378 // Allow but ignore attributes on function types; this permits auto-upgrade.
1379 // FIXME: remove in LLVM 3.0.
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001380 std::vector<const Type*> Params;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001381 TypeWithAttrsList::iterator I = $3->begin(), E = $3->end();
Duncan Sandsf5588dc2007-11-27 13:23:08 +00001382 for ( ; I != E; ++I ) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001383 const Type* Ty = I->Ty->get();
1384 Params.push_back(Ty);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001385 }
Anton Korobeynikova2c02272007-12-03 19:16:54 +00001386
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001387 bool isVarArg = Params.size() && Params.back() == Type::VoidTy;
1388 if (isVarArg) Params.pop_back();
1389
Anton Korobeynikov9ab58082007-12-03 21:00:45 +00001390 for (unsigned i = 0; i != Params.size(); ++i)
1391 if (!(Params[i]->isFirstClassType() || isa<OpaqueType>(Params[i])))
1392 GEN_ERROR("Function arguments must be value types!");
1393
1394 CHECK_FOR_ERROR
1395
Duncan Sandsf5588dc2007-11-27 13:23:08 +00001396 FunctionType *FT = FunctionType::get($1, Params, isVarArg);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001397 delete $3; // Delete the argument list
1398 $$ = new PATypeHolder(HandleUpRefs(FT));
1399 CHECK_FOR_ERROR
1400 }
1401
1402 | '[' EUINT64VAL 'x' Types ']' { // Sized array type?
1403 $$ = new PATypeHolder(HandleUpRefs(ArrayType::get(*$4, (unsigned)$2)));
1404 delete $4;
1405 CHECK_FOR_ERROR
1406 }
1407 | '<' EUINT64VAL 'x' Types '>' { // Vector type?
1408 const llvm::Type* ElemTy = $4->get();
1409 if ((unsigned)$2 != $2)
1410 GEN_ERROR("Unsigned result not equal to signed result");
1411 if (!ElemTy->isFloatingPoint() && !ElemTy->isInteger())
1412 GEN_ERROR("Element type of a VectorType must be primitive");
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001413 $$ = new PATypeHolder(HandleUpRefs(VectorType::get(*$4, (unsigned)$2)));
1414 delete $4;
1415 CHECK_FOR_ERROR
1416 }
1417 | '{' TypeListI '}' { // Structure type?
1418 std::vector<const Type*> Elements;
1419 for (std::list<llvm::PATypeHolder>::iterator I = $2->begin(),
1420 E = $2->end(); I != E; ++I)
1421 Elements.push_back(*I);
1422
1423 $$ = new PATypeHolder(HandleUpRefs(StructType::get(Elements)));
1424 delete $2;
1425 CHECK_FOR_ERROR
1426 }
1427 | '{' '}' { // Empty structure type?
1428 $$ = new PATypeHolder(StructType::get(std::vector<const Type*>()));
1429 CHECK_FOR_ERROR
1430 }
1431 | '<' '{' TypeListI '}' '>' {
1432 std::vector<const Type*> Elements;
1433 for (std::list<llvm::PATypeHolder>::iterator I = $3->begin(),
1434 E = $3->end(); I != E; ++I)
1435 Elements.push_back(*I);
1436
1437 $$ = new PATypeHolder(HandleUpRefs(StructType::get(Elements, true)));
1438 delete $3;
1439 CHECK_FOR_ERROR
1440 }
1441 | '<' '{' '}' '>' { // Empty structure type?
1442 $$ = new PATypeHolder(StructType::get(std::vector<const Type*>(), true));
1443 CHECK_FOR_ERROR
1444 }
1445 ;
1446
1447ArgType
Duncan Sandsf5588dc2007-11-27 13:23:08 +00001448 : Types OptParamAttrs {
1449 // Allow but ignore attributes on function types; this permits auto-upgrade.
1450 // FIXME: remove in LLVM 3.0.
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001451 $$.Ty = $1;
Duncan Sandsf5588dc2007-11-27 13:23:08 +00001452 $$.Attrs = ParamAttr::None;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001453 }
1454 ;
1455
1456ResultTypes
1457 : Types {
1458 if (!UpRefs.empty())
1459 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1460 if (!(*$1)->isFirstClassType())
1461 GEN_ERROR("LLVM functions cannot return aggregate types");
1462 $$ = $1;
1463 }
1464 | VOID {
1465 $$ = new PATypeHolder(Type::VoidTy);
1466 }
1467 ;
1468
1469ArgTypeList : ArgType {
1470 $$ = new TypeWithAttrsList();
1471 $$->push_back($1);
1472 CHECK_FOR_ERROR
1473 }
1474 | ArgTypeList ',' ArgType {
1475 ($$=$1)->push_back($3);
1476 CHECK_FOR_ERROR
1477 }
1478 ;
1479
1480ArgTypeListI
1481 : ArgTypeList
1482 | ArgTypeList ',' DOTDOTDOT {
1483 $$=$1;
1484 TypeWithAttrs TWA; TWA.Attrs = ParamAttr::None;
1485 TWA.Ty = new PATypeHolder(Type::VoidTy);
1486 $$->push_back(TWA);
1487 CHECK_FOR_ERROR
1488 }
1489 | DOTDOTDOT {
1490 $$ = new TypeWithAttrsList;
1491 TypeWithAttrs TWA; TWA.Attrs = ParamAttr::None;
1492 TWA.Ty = new PATypeHolder(Type::VoidTy);
1493 $$->push_back(TWA);
1494 CHECK_FOR_ERROR
1495 }
1496 | /*empty*/ {
1497 $$ = new TypeWithAttrsList();
1498 CHECK_FOR_ERROR
1499 };
1500
1501// TypeList - Used for struct declarations and as a basis for function type
1502// declaration type lists
1503//
1504TypeListI : Types {
1505 $$ = new std::list<PATypeHolder>();
1506 $$->push_back(*$1);
1507 delete $1;
1508 CHECK_FOR_ERROR
1509 }
1510 | TypeListI ',' Types {
1511 ($$=$1)->push_back(*$3);
1512 delete $3;
1513 CHECK_FOR_ERROR
1514 };
1515
1516// ConstVal - The various declarations that go into the constant pool. This
1517// production is used ONLY to represent constants that show up AFTER a 'const',
1518// 'constant' or 'global' token at global scope. Constants that can be inlined
1519// into other expressions (such as integers and constexprs) are handled by the
1520// ResolvedVal, ValueRef and ConstValueRef productions.
1521//
1522ConstVal: Types '[' ConstVector ']' { // Nonempty unsized arr
1523 if (!UpRefs.empty())
1524 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1525 const ArrayType *ATy = dyn_cast<ArrayType>($1->get());
1526 if (ATy == 0)
1527 GEN_ERROR("Cannot make array constant with type: '" +
1528 (*$1)->getDescription() + "'");
1529 const Type *ETy = ATy->getElementType();
1530 int NumElements = ATy->getNumElements();
1531
1532 // Verify that we have the correct size...
1533 if (NumElements != -1 && NumElements != (int)$3->size())
1534 GEN_ERROR("Type mismatch: constant sized array initialized with " +
1535 utostr($3->size()) + " arguments, but has size of " +
1536 itostr(NumElements) + "");
1537
1538 // Verify all elements are correct type!
1539 for (unsigned i = 0; i < $3->size(); i++) {
1540 if (ETy != (*$3)[i]->getType())
1541 GEN_ERROR("Element #" + utostr(i) + " is not of type '" +
1542 ETy->getDescription() +"' as required!\nIt is of type '"+
1543 (*$3)[i]->getType()->getDescription() + "'.");
1544 }
1545
1546 $$ = ConstantArray::get(ATy, *$3);
1547 delete $1; delete $3;
1548 CHECK_FOR_ERROR
1549 }
1550 | Types '[' ']' {
1551 if (!UpRefs.empty())
1552 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1553 const ArrayType *ATy = dyn_cast<ArrayType>($1->get());
1554 if (ATy == 0)
1555 GEN_ERROR("Cannot make array constant with type: '" +
1556 (*$1)->getDescription() + "'");
1557
1558 int NumElements = ATy->getNumElements();
1559 if (NumElements != -1 && NumElements != 0)
1560 GEN_ERROR("Type mismatch: constant sized array initialized with 0"
1561 " arguments, but has size of " + itostr(NumElements) +"");
1562 $$ = ConstantArray::get(ATy, std::vector<Constant*>());
1563 delete $1;
1564 CHECK_FOR_ERROR
1565 }
1566 | Types 'c' STRINGCONSTANT {
1567 if (!UpRefs.empty())
1568 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1569 const ArrayType *ATy = dyn_cast<ArrayType>($1->get());
1570 if (ATy == 0)
1571 GEN_ERROR("Cannot make array constant with type: '" +
1572 (*$1)->getDescription() + "'");
1573
1574 int NumElements = ATy->getNumElements();
1575 const Type *ETy = ATy->getElementType();
1576 if (NumElements != -1 && NumElements != int($3->length()))
1577 GEN_ERROR("Can't build string constant of size " +
1578 itostr((int)($3->length())) +
1579 " when array has size " + itostr(NumElements) + "");
1580 std::vector<Constant*> Vals;
1581 if (ETy == Type::Int8Ty) {
1582 for (unsigned i = 0; i < $3->length(); ++i)
1583 Vals.push_back(ConstantInt::get(ETy, (*$3)[i]));
1584 } else {
1585 delete $3;
1586 GEN_ERROR("Cannot build string arrays of non byte sized elements");
1587 }
1588 delete $3;
1589 $$ = ConstantArray::get(ATy, Vals);
1590 delete $1;
1591 CHECK_FOR_ERROR
1592 }
1593 | Types '<' ConstVector '>' { // Nonempty unsized arr
1594 if (!UpRefs.empty())
1595 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1596 const VectorType *PTy = dyn_cast<VectorType>($1->get());
1597 if (PTy == 0)
1598 GEN_ERROR("Cannot make packed constant with type: '" +
1599 (*$1)->getDescription() + "'");
1600 const Type *ETy = PTy->getElementType();
1601 int NumElements = PTy->getNumElements();
1602
1603 // Verify that we have the correct size...
1604 if (NumElements != -1 && NumElements != (int)$3->size())
1605 GEN_ERROR("Type mismatch: constant sized packed initialized with " +
1606 utostr($3->size()) + " arguments, but has size of " +
1607 itostr(NumElements) + "");
1608
1609 // Verify all elements are correct type!
1610 for (unsigned i = 0; i < $3->size(); i++) {
1611 if (ETy != (*$3)[i]->getType())
1612 GEN_ERROR("Element #" + utostr(i) + " is not of type '" +
1613 ETy->getDescription() +"' as required!\nIt is of type '"+
1614 (*$3)[i]->getType()->getDescription() + "'.");
1615 }
1616
1617 $$ = ConstantVector::get(PTy, *$3);
1618 delete $1; delete $3;
1619 CHECK_FOR_ERROR
1620 }
1621 | Types '{' ConstVector '}' {
1622 const StructType *STy = dyn_cast<StructType>($1->get());
1623 if (STy == 0)
1624 GEN_ERROR("Cannot make struct constant with type: '" +
1625 (*$1)->getDescription() + "'");
1626
1627 if ($3->size() != STy->getNumContainedTypes())
1628 GEN_ERROR("Illegal number of initializers for structure type");
1629
1630 // Check to ensure that constants are compatible with the type initializer!
1631 for (unsigned i = 0, e = $3->size(); i != e; ++i)
1632 if ((*$3)[i]->getType() != STy->getElementType(i))
1633 GEN_ERROR("Expected type '" +
1634 STy->getElementType(i)->getDescription() +
1635 "' for element #" + utostr(i) +
1636 " of structure initializer");
1637
1638 // Check to ensure that Type is not packed
1639 if (STy->isPacked())
1640 GEN_ERROR("Unpacked Initializer to vector type '" +
1641 STy->getDescription() + "'");
1642
1643 $$ = ConstantStruct::get(STy, *$3);
1644 delete $1; delete $3;
1645 CHECK_FOR_ERROR
1646 }
1647 | Types '{' '}' {
1648 if (!UpRefs.empty())
1649 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1650 const StructType *STy = dyn_cast<StructType>($1->get());
1651 if (STy == 0)
1652 GEN_ERROR("Cannot make struct constant with type: '" +
1653 (*$1)->getDescription() + "'");
1654
1655 if (STy->getNumContainedTypes() != 0)
1656 GEN_ERROR("Illegal number of initializers for structure type");
1657
1658 // Check to ensure that Type is not packed
1659 if (STy->isPacked())
1660 GEN_ERROR("Unpacked Initializer to vector type '" +
1661 STy->getDescription() + "'");
1662
1663 $$ = ConstantStruct::get(STy, std::vector<Constant*>());
1664 delete $1;
1665 CHECK_FOR_ERROR
1666 }
1667 | Types '<' '{' ConstVector '}' '>' {
1668 const StructType *STy = dyn_cast<StructType>($1->get());
1669 if (STy == 0)
1670 GEN_ERROR("Cannot make struct constant with type: '" +
1671 (*$1)->getDescription() + "'");
1672
1673 if ($4->size() != STy->getNumContainedTypes())
1674 GEN_ERROR("Illegal number of initializers for structure type");
1675
1676 // Check to ensure that constants are compatible with the type initializer!
1677 for (unsigned i = 0, e = $4->size(); i != e; ++i)
1678 if ((*$4)[i]->getType() != STy->getElementType(i))
1679 GEN_ERROR("Expected type '" +
1680 STy->getElementType(i)->getDescription() +
1681 "' for element #" + utostr(i) +
1682 " of structure initializer");
1683
1684 // Check to ensure that Type is packed
1685 if (!STy->isPacked())
1686 GEN_ERROR("Vector initializer to non-vector type '" +
1687 STy->getDescription() + "'");
1688
1689 $$ = ConstantStruct::get(STy, *$4);
1690 delete $1; delete $4;
1691 CHECK_FOR_ERROR
1692 }
1693 | Types '<' '{' '}' '>' {
1694 if (!UpRefs.empty())
1695 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1696 const StructType *STy = dyn_cast<StructType>($1->get());
1697 if (STy == 0)
1698 GEN_ERROR("Cannot make struct constant with type: '" +
1699 (*$1)->getDescription() + "'");
1700
1701 if (STy->getNumContainedTypes() != 0)
1702 GEN_ERROR("Illegal number of initializers for structure type");
1703
1704 // Check to ensure that Type is packed
1705 if (!STy->isPacked())
1706 GEN_ERROR("Vector initializer to non-vector type '" +
1707 STy->getDescription() + "'");
1708
1709 $$ = ConstantStruct::get(STy, std::vector<Constant*>());
1710 delete $1;
1711 CHECK_FOR_ERROR
1712 }
1713 | Types NULL_TOK {
1714 if (!UpRefs.empty())
1715 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1716 const PointerType *PTy = dyn_cast<PointerType>($1->get());
1717 if (PTy == 0)
1718 GEN_ERROR("Cannot make null pointer constant with type: '" +
1719 (*$1)->getDescription() + "'");
1720
1721 $$ = ConstantPointerNull::get(PTy);
1722 delete $1;
1723 CHECK_FOR_ERROR
1724 }
1725 | Types UNDEF {
1726 if (!UpRefs.empty())
1727 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1728 $$ = UndefValue::get($1->get());
1729 delete $1;
1730 CHECK_FOR_ERROR
1731 }
1732 | Types SymbolicValueRef {
1733 if (!UpRefs.empty())
1734 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1735 const PointerType *Ty = dyn_cast<PointerType>($1->get());
1736 if (Ty == 0)
Devang Patele5c806a2008-02-19 22:26:37 +00001737 GEN_ERROR("Global const reference must be a pointer type " + (*$1)->getDescription());
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001738
1739 // ConstExprs can exist in the body of a function, thus creating
1740 // GlobalValues whenever they refer to a variable. Because we are in
1741 // the context of a function, getExistingVal will search the functions
1742 // symbol table instead of the module symbol table for the global symbol,
1743 // which throws things all off. To get around this, we just tell
1744 // getExistingVal that we are at global scope here.
1745 //
1746 Function *SavedCurFn = CurFun.CurrentFunction;
1747 CurFun.CurrentFunction = 0;
1748
1749 Value *V = getExistingVal(Ty, $2);
1750 CHECK_FOR_ERROR
1751
1752 CurFun.CurrentFunction = SavedCurFn;
1753
1754 // If this is an initializer for a constant pointer, which is referencing a
1755 // (currently) undefined variable, create a stub now that shall be replaced
1756 // in the future with the right type of variable.
1757 //
1758 if (V == 0) {
1759 assert(isa<PointerType>(Ty) && "Globals may only be used as pointers!");
1760 const PointerType *PT = cast<PointerType>(Ty);
1761
1762 // First check to see if the forward references value is already created!
1763 PerModuleInfo::GlobalRefsType::iterator I =
1764 CurModule.GlobalRefs.find(std::make_pair(PT, $2));
1765
1766 if (I != CurModule.GlobalRefs.end()) {
1767 V = I->second; // Placeholder already exists, use it...
1768 $2.destroy();
1769 } else {
1770 std::string Name;
1771 if ($2.Type == ValID::GlobalName)
1772 Name = $2.getName();
1773 else if ($2.Type != ValID::GlobalID)
1774 GEN_ERROR("Invalid reference to global");
1775
1776 // Create the forward referenced global.
1777 GlobalValue *GV;
1778 if (const FunctionType *FTy =
1779 dyn_cast<FunctionType>(PT->getElementType())) {
1780 GV = new Function(FTy, GlobalValue::ExternalWeakLinkage, Name,
1781 CurModule.CurrentModule);
1782 } else {
1783 GV = new GlobalVariable(PT->getElementType(), false,
1784 GlobalValue::ExternalWeakLinkage, 0,
1785 Name, CurModule.CurrentModule);
1786 }
1787
1788 // Keep track of the fact that we have a forward ref to recycle it
1789 CurModule.GlobalRefs.insert(std::make_pair(std::make_pair(PT, $2), GV));
1790 V = GV;
1791 }
1792 }
1793
1794 $$ = cast<GlobalValue>(V);
1795 delete $1; // Free the type handle
1796 CHECK_FOR_ERROR
1797 }
1798 | Types ConstExpr {
1799 if (!UpRefs.empty())
1800 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1801 if ($1->get() != $2->getType())
1802 GEN_ERROR("Mismatched types for constant expression: " +
1803 (*$1)->getDescription() + " and " + $2->getType()->getDescription());
1804 $$ = $2;
1805 delete $1;
1806 CHECK_FOR_ERROR
1807 }
1808 | Types ZEROINITIALIZER {
1809 if (!UpRefs.empty())
1810 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1811 const Type *Ty = $1->get();
1812 if (isa<FunctionType>(Ty) || Ty == Type::LabelTy || isa<OpaqueType>(Ty))
1813 GEN_ERROR("Cannot create a null initialized value of this type");
1814 $$ = Constant::getNullValue(Ty);
1815 delete $1;
1816 CHECK_FOR_ERROR
1817 }
1818 | IntType ESINT64VAL { // integral constants
1819 if (!ConstantInt::isValueValidForType($1, $2))
1820 GEN_ERROR("Constant value doesn't fit in type");
1821 $$ = ConstantInt::get($1, $2, true);
1822 CHECK_FOR_ERROR
1823 }
1824 | IntType ESAPINTVAL { // arbitrary precision integer constants
1825 uint32_t BitWidth = cast<IntegerType>($1)->getBitWidth();
1826 if ($2->getBitWidth() > BitWidth) {
1827 GEN_ERROR("Constant value does not fit in type");
1828 }
1829 $2->sextOrTrunc(BitWidth);
1830 $$ = ConstantInt::get(*$2);
1831 delete $2;
1832 CHECK_FOR_ERROR
1833 }
1834 | IntType EUINT64VAL { // integral constants
1835 if (!ConstantInt::isValueValidForType($1, $2))
1836 GEN_ERROR("Constant value doesn't fit in type");
1837 $$ = ConstantInt::get($1, $2, false);
1838 CHECK_FOR_ERROR
1839 }
1840 | IntType EUAPINTVAL { // arbitrary precision integer constants
1841 uint32_t BitWidth = cast<IntegerType>($1)->getBitWidth();
1842 if ($2->getBitWidth() > BitWidth) {
1843 GEN_ERROR("Constant value does not fit in type");
1844 }
1845 $2->zextOrTrunc(BitWidth);
1846 $$ = ConstantInt::get(*$2);
1847 delete $2;
1848 CHECK_FOR_ERROR
1849 }
1850 | INTTYPE TRUETOK { // Boolean constants
1851 assert(cast<IntegerType>($1)->getBitWidth() == 1 && "Not Bool?");
1852 $$ = ConstantInt::getTrue();
1853 CHECK_FOR_ERROR
1854 }
1855 | INTTYPE FALSETOK { // Boolean constants
1856 assert(cast<IntegerType>($1)->getBitWidth() == 1 && "Not Bool?");
1857 $$ = ConstantInt::getFalse();
1858 CHECK_FOR_ERROR
1859 }
Dale Johannesenfbd9cda2007-09-12 03:30:33 +00001860 | FPType FPVAL { // Floating point constants
Dale Johannesenb9de9f02007-09-06 18:13:44 +00001861 if (!ConstantFP::isValueValidForType($1, *$2))
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001862 GEN_ERROR("Floating point constant invalid for type");
Dale Johannesen1616e902007-09-11 18:32:33 +00001863 // Lexer has no type info, so builds all float and double FP constants
1864 // as double. Fix this here. Long double is done right.
1865 if (&$2->getSemantics()==&APFloat::IEEEdouble && $1==Type::FloatTy)
Dale Johannesenb9de9f02007-09-06 18:13:44 +00001866 $2->convert(APFloat::IEEEsingle, APFloat::rmNearestTiesToEven);
1867 $$ = ConstantFP::get($1, *$2);
Dale Johannesen3afee192007-09-07 21:07:57 +00001868 delete $2;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001869 CHECK_FOR_ERROR
1870 };
1871
1872
1873ConstExpr: CastOps '(' ConstVal TO Types ')' {
1874 if (!UpRefs.empty())
1875 GEN_ERROR("Invalid upreference in type: " + (*$5)->getDescription());
1876 Constant *Val = $3;
1877 const Type *DestTy = $5->get();
1878 if (!CastInst::castIsValid($1, $3, DestTy))
1879 GEN_ERROR("invalid cast opcode for cast from '" +
1880 Val->getType()->getDescription() + "' to '" +
1881 DestTy->getDescription() + "'");
1882 $$ = ConstantExpr::getCast($1, $3, DestTy);
1883 delete $5;
1884 }
1885 | GETELEMENTPTR '(' ConstVal IndexList ')' {
1886 if (!isa<PointerType>($3->getType()))
1887 GEN_ERROR("GetElementPtr requires a pointer operand");
1888
1889 const Type *IdxTy =
David Greene393be882007-09-04 15:46:09 +00001890 GetElementPtrInst::getIndexedType($3->getType(), $4->begin(), $4->end(),
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001891 true);
1892 if (!IdxTy)
1893 GEN_ERROR("Index list invalid for constant getelementptr");
1894
1895 SmallVector<Constant*, 8> IdxVec;
1896 for (unsigned i = 0, e = $4->size(); i != e; ++i)
1897 if (Constant *C = dyn_cast<Constant>((*$4)[i]))
1898 IdxVec.push_back(C);
1899 else
1900 GEN_ERROR("Indices to constant getelementptr must be constants");
1901
1902 delete $4;
1903
1904 $$ = ConstantExpr::getGetElementPtr($3, &IdxVec[0], IdxVec.size());
1905 CHECK_FOR_ERROR
1906 }
1907 | SELECT '(' ConstVal ',' ConstVal ',' ConstVal ')' {
1908 if ($3->getType() != Type::Int1Ty)
1909 GEN_ERROR("Select condition must be of boolean type");
1910 if ($5->getType() != $7->getType())
1911 GEN_ERROR("Select operand types must match");
1912 $$ = ConstantExpr::getSelect($3, $5, $7);
1913 CHECK_FOR_ERROR
1914 }
1915 | ArithmeticOps '(' ConstVal ',' ConstVal ')' {
1916 if ($3->getType() != $5->getType())
1917 GEN_ERROR("Binary operator types must match");
1918 CHECK_FOR_ERROR;
1919 $$ = ConstantExpr::get($1, $3, $5);
1920 }
1921 | LogicalOps '(' ConstVal ',' ConstVal ')' {
1922 if ($3->getType() != $5->getType())
1923 GEN_ERROR("Logical operator types must match");
1924 if (!$3->getType()->isInteger()) {
1925 if (Instruction::isShift($1) || !isa<VectorType>($3->getType()) ||
1926 !cast<VectorType>($3->getType())->getElementType()->isInteger())
1927 GEN_ERROR("Logical operator requires integral operands");
1928 }
1929 $$ = ConstantExpr::get($1, $3, $5);
1930 CHECK_FOR_ERROR
1931 }
1932 | ICMP IPredicates '(' ConstVal ',' ConstVal ')' {
1933 if ($4->getType() != $6->getType())
1934 GEN_ERROR("icmp operand types must match");
1935 $$ = ConstantExpr::getICmp($2, $4, $6);
1936 }
1937 | FCMP FPredicates '(' ConstVal ',' ConstVal ')' {
1938 if ($4->getType() != $6->getType())
1939 GEN_ERROR("fcmp operand types must match");
1940 $$ = ConstantExpr::getFCmp($2, $4, $6);
1941 }
1942 | EXTRACTELEMENT '(' ConstVal ',' ConstVal ')' {
1943 if (!ExtractElementInst::isValidOperands($3, $5))
1944 GEN_ERROR("Invalid extractelement operands");
1945 $$ = ConstantExpr::getExtractElement($3, $5);
1946 CHECK_FOR_ERROR
1947 }
1948 | INSERTELEMENT '(' ConstVal ',' ConstVal ',' ConstVal ')' {
1949 if (!InsertElementInst::isValidOperands($3, $5, $7))
1950 GEN_ERROR("Invalid insertelement operands");
1951 $$ = ConstantExpr::getInsertElement($3, $5, $7);
1952 CHECK_FOR_ERROR
1953 }
1954 | SHUFFLEVECTOR '(' ConstVal ',' ConstVal ',' ConstVal ')' {
1955 if (!ShuffleVectorInst::isValidOperands($3, $5, $7))
1956 GEN_ERROR("Invalid shufflevector operands");
1957 $$ = ConstantExpr::getShuffleVector($3, $5, $7);
1958 CHECK_FOR_ERROR
1959 };
1960
1961
1962// ConstVector - A list of comma separated constants.
1963ConstVector : ConstVector ',' ConstVal {
1964 ($$ = $1)->push_back($3);
1965 CHECK_FOR_ERROR
1966 }
1967 | ConstVal {
1968 $$ = new std::vector<Constant*>();
1969 $$->push_back($1);
1970 CHECK_FOR_ERROR
1971 };
1972
1973
1974// GlobalType - Match either GLOBAL or CONSTANT for global declarations...
1975GlobalType : GLOBAL { $$ = false; } | CONSTANT { $$ = true; };
1976
1977// ThreadLocal
1978ThreadLocal : THREAD_LOCAL { $$ = true; } | { $$ = false; };
1979
1980// AliaseeRef - Match either GlobalValue or bitcast to GlobalValue.
1981AliaseeRef : ResultTypes SymbolicValueRef {
1982 const Type* VTy = $1->get();
1983 Value *V = getVal(VTy, $2);
Chris Lattner0f800522007-08-06 21:00:37 +00001984 CHECK_FOR_ERROR
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001985 GlobalValue* Aliasee = dyn_cast<GlobalValue>(V);
1986 if (!Aliasee)
1987 GEN_ERROR("Aliases can be created only to global values");
1988
1989 $$ = Aliasee;
1990 CHECK_FOR_ERROR
1991 delete $1;
1992 }
1993 | BITCAST '(' AliaseeRef TO Types ')' {
1994 Constant *Val = $3;
1995 const Type *DestTy = $5->get();
1996 if (!CastInst::castIsValid($1, $3, DestTy))
1997 GEN_ERROR("invalid cast opcode for cast from '" +
1998 Val->getType()->getDescription() + "' to '" +
1999 DestTy->getDescription() + "'");
2000
2001 $$ = ConstantExpr::getCast($1, $3, DestTy);
2002 CHECK_FOR_ERROR
2003 delete $5;
2004 };
2005
2006//===----------------------------------------------------------------------===//
2007// Rules to match Modules
2008//===----------------------------------------------------------------------===//
2009
2010// Module rule: Capture the result of parsing the whole file into a result
2011// variable...
2012//
2013Module
2014 : DefinitionList {
2015 $$ = ParserResult = CurModule.CurrentModule;
2016 CurModule.ModuleDone();
2017 CHECK_FOR_ERROR;
2018 }
2019 | /*empty*/ {
2020 $$ = ParserResult = CurModule.CurrentModule;
2021 CurModule.ModuleDone();
2022 CHECK_FOR_ERROR;
2023 }
2024 ;
2025
2026DefinitionList
2027 : Definition
2028 | DefinitionList Definition
2029 ;
2030
2031Definition
2032 : DEFINE { CurFun.isDeclare = false; } Function {
2033 CurFun.FunctionDone();
2034 CHECK_FOR_ERROR
2035 }
2036 | DECLARE { CurFun.isDeclare = true; } FunctionProto {
2037 CHECK_FOR_ERROR
2038 }
2039 | MODULE ASM_TOK AsmBlock {
2040 CHECK_FOR_ERROR
2041 }
2042 | OptLocalAssign TYPE Types {
2043 if (!UpRefs.empty())
2044 GEN_ERROR("Invalid upreference in type: " + (*$3)->getDescription());
2045 // Eagerly resolve types. This is not an optimization, this is a
2046 // requirement that is due to the fact that we could have this:
2047 //
2048 // %list = type { %list * }
2049 // %list = type { %list * } ; repeated type decl
2050 //
2051 // If types are not resolved eagerly, then the two types will not be
2052 // determined to be the same type!
2053 //
2054 ResolveTypeTo($1, *$3);
2055
2056 if (!setTypeName(*$3, $1) && !$1) {
2057 CHECK_FOR_ERROR
2058 // If this is a named type that is not a redefinition, add it to the slot
2059 // table.
2060 CurModule.Types.push_back(*$3);
2061 }
2062
2063 delete $3;
2064 CHECK_FOR_ERROR
2065 }
2066 | OptLocalAssign TYPE VOID {
2067 ResolveTypeTo($1, $3);
2068
2069 if (!setTypeName($3, $1) && !$1) {
2070 CHECK_FOR_ERROR
2071 // If this is a named type that is not a redefinition, add it to the slot
2072 // table.
2073 CurModule.Types.push_back($3);
2074 }
2075 CHECK_FOR_ERROR
2076 }
Christopher Lamb20a39e92007-12-12 08:44:39 +00002077 | OptGlobalAssign GVVisibilityStyle ThreadLocal GlobalType ConstVal
2078 OptAddrSpace {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002079 /* "Externally Visible" Linkage */
2080 if ($5 == 0)
2081 GEN_ERROR("Global value initializer is not a constant");
2082 CurGV = ParseGlobalVariable($1, GlobalValue::ExternalLinkage,
Christopher Lamb20a39e92007-12-12 08:44:39 +00002083 $2, $4, $5->getType(), $5, $3, $6);
Christopher Lamb44d62f62007-12-11 08:59:05 +00002084 CHECK_FOR_ERROR
2085 } GlobalVarAttributes {
2086 CurGV = 0;
2087 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002088 | OptGlobalAssign GVInternalLinkage GVVisibilityStyle ThreadLocal GlobalType
Christopher Lamb20a39e92007-12-12 08:44:39 +00002089 ConstVal OptAddrSpace {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002090 if ($6 == 0)
2091 GEN_ERROR("Global value initializer is not a constant");
Christopher Lamb20a39e92007-12-12 08:44:39 +00002092 CurGV = ParseGlobalVariable($1, $2, $3, $5, $6->getType(), $6, $4, $7);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002093 CHECK_FOR_ERROR
2094 } GlobalVarAttributes {
2095 CurGV = 0;
2096 }
2097 | OptGlobalAssign GVExternalLinkage GVVisibilityStyle ThreadLocal GlobalType
Christopher Lamb20a39e92007-12-12 08:44:39 +00002098 Types OptAddrSpace {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002099 if (!UpRefs.empty())
2100 GEN_ERROR("Invalid upreference in type: " + (*$6)->getDescription());
Christopher Lamb20a39e92007-12-12 08:44:39 +00002101 CurGV = ParseGlobalVariable($1, $2, $3, $5, *$6, 0, $4, $7);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002102 CHECK_FOR_ERROR
2103 delete $6;
2104 } GlobalVarAttributes {
2105 CurGV = 0;
2106 CHECK_FOR_ERROR
2107 }
2108 | OptGlobalAssign GVVisibilityStyle ALIAS AliasLinkage AliaseeRef {
2109 std::string Name;
2110 if ($1) {
2111 Name = *$1;
2112 delete $1;
2113 }
2114 if (Name.empty())
2115 GEN_ERROR("Alias name cannot be empty");
2116
2117 Constant* Aliasee = $5;
2118 if (Aliasee == 0)
2119 GEN_ERROR(std::string("Invalid aliasee for alias: ") + Name);
2120
2121 GlobalAlias* GA = new GlobalAlias(Aliasee->getType(), $4, Name, Aliasee,
2122 CurModule.CurrentModule);
2123 GA->setVisibility($2);
2124 InsertValue(GA, CurModule.Values);
Chris Lattner9d99b312007-09-10 23:23:53 +00002125
2126
2127 // If there was a forward reference of this alias, resolve it now.
2128
2129 ValID ID;
2130 if (!Name.empty())
2131 ID = ValID::createGlobalName(Name);
2132 else
2133 ID = ValID::createGlobalID(CurModule.Values.size()-1);
2134
2135 if (GlobalValue *FWGV =
2136 CurModule.GetForwardRefForGlobal(GA->getType(), ID)) {
2137 // Replace uses of the fwdref with the actual alias.
2138 FWGV->replaceAllUsesWith(GA);
2139 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(FWGV))
2140 GV->eraseFromParent();
2141 else
2142 cast<Function>(FWGV)->eraseFromParent();
2143 }
2144 ID.destroy();
2145
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002146 CHECK_FOR_ERROR
2147 }
2148 | TARGET TargetDefinition {
2149 CHECK_FOR_ERROR
2150 }
2151 | DEPLIBS '=' LibrariesDefinition {
2152 CHECK_FOR_ERROR
2153 }
2154 ;
2155
2156
2157AsmBlock : STRINGCONSTANT {
2158 const std::string &AsmSoFar = CurModule.CurrentModule->getModuleInlineAsm();
2159 if (AsmSoFar.empty())
2160 CurModule.CurrentModule->setModuleInlineAsm(*$1);
2161 else
2162 CurModule.CurrentModule->setModuleInlineAsm(AsmSoFar+"\n"+*$1);
2163 delete $1;
2164 CHECK_FOR_ERROR
2165};
2166
2167TargetDefinition : TRIPLE '=' STRINGCONSTANT {
2168 CurModule.CurrentModule->setTargetTriple(*$3);
2169 delete $3;
2170 }
2171 | DATALAYOUT '=' STRINGCONSTANT {
2172 CurModule.CurrentModule->setDataLayout(*$3);
2173 delete $3;
2174 };
2175
2176LibrariesDefinition : '[' LibList ']';
2177
2178LibList : LibList ',' STRINGCONSTANT {
2179 CurModule.CurrentModule->addLibrary(*$3);
2180 delete $3;
2181 CHECK_FOR_ERROR
2182 }
2183 | STRINGCONSTANT {
2184 CurModule.CurrentModule->addLibrary(*$1);
2185 delete $1;
2186 CHECK_FOR_ERROR
2187 }
2188 | /* empty: end of list */ {
2189 CHECK_FOR_ERROR
2190 }
2191 ;
2192
2193//===----------------------------------------------------------------------===//
2194// Rules to match Function Headers
2195//===----------------------------------------------------------------------===//
2196
2197ArgListH : ArgListH ',' Types OptParamAttrs OptLocalName {
2198 if (!UpRefs.empty())
2199 GEN_ERROR("Invalid upreference in type: " + (*$3)->getDescription());
2200 if (*$3 == Type::VoidTy)
2201 GEN_ERROR("void typed arguments are invalid");
2202 ArgListEntry E; E.Attrs = $4; E.Ty = $3; E.Name = $5;
2203 $$ = $1;
2204 $1->push_back(E);
2205 CHECK_FOR_ERROR
2206 }
2207 | Types OptParamAttrs OptLocalName {
2208 if (!UpRefs.empty())
2209 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
2210 if (*$1 == Type::VoidTy)
2211 GEN_ERROR("void typed arguments are invalid");
2212 ArgListEntry E; E.Attrs = $2; E.Ty = $1; E.Name = $3;
2213 $$ = new ArgListType;
2214 $$->push_back(E);
2215 CHECK_FOR_ERROR
2216 };
2217
2218ArgList : ArgListH {
2219 $$ = $1;
2220 CHECK_FOR_ERROR
2221 }
2222 | ArgListH ',' DOTDOTDOT {
2223 $$ = $1;
2224 struct ArgListEntry E;
2225 E.Ty = new PATypeHolder(Type::VoidTy);
2226 E.Name = 0;
2227 E.Attrs = ParamAttr::None;
2228 $$->push_back(E);
2229 CHECK_FOR_ERROR
2230 }
2231 | DOTDOTDOT {
2232 $$ = new ArgListType;
2233 struct ArgListEntry E;
2234 E.Ty = new PATypeHolder(Type::VoidTy);
2235 E.Name = 0;
2236 E.Attrs = ParamAttr::None;
2237 $$->push_back(E);
2238 CHECK_FOR_ERROR
2239 }
2240 | /* empty */ {
2241 $$ = 0;
2242 CHECK_FOR_ERROR
2243 };
2244
2245FunctionHeaderH : OptCallingConv ResultTypes GlobalName '(' ArgList ')'
Gordon Henriksen13fe5e32007-12-10 03:18:06 +00002246 OptFuncAttrs OptSection OptAlign OptGC {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002247 std::string FunctionName(*$3);
2248 delete $3; // Free strdup'd memory!
2249
2250 // Check the function result for abstractness if this is a define. We should
2251 // have no abstract types at this point
2252 if (!CurFun.isDeclare && CurModule.TypeIsUnresolved($2))
2253 GEN_ERROR("Reference to abstract result: "+ $2->get()->getDescription());
2254
2255 std::vector<const Type*> ParamTypeList;
2256 ParamAttrsVector Attrs;
2257 if ($7 != ParamAttr::None) {
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002258 ParamAttrsWithIndex PAWI;
2259 PAWI.index = 0;
2260 PAWI.attrs = $7;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002261 Attrs.push_back(PAWI);
2262 }
2263 if ($5) { // If there are arguments...
2264 unsigned index = 1;
2265 for (ArgListType::iterator I = $5->begin(); I != $5->end(); ++I, ++index) {
2266 const Type* Ty = I->Ty->get();
2267 if (!CurFun.isDeclare && CurModule.TypeIsUnresolved(I->Ty))
2268 GEN_ERROR("Reference to abstract argument: " + Ty->getDescription());
2269 ParamTypeList.push_back(Ty);
2270 if (Ty != Type::VoidTy)
2271 if (I->Attrs != ParamAttr::None) {
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002272 ParamAttrsWithIndex PAWI;
2273 PAWI.index = index;
2274 PAWI.attrs = I->Attrs;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002275 Attrs.push_back(PAWI);
2276 }
2277 }
2278 }
2279
2280 bool isVarArg = ParamTypeList.size() && ParamTypeList.back() == Type::VoidTy;
2281 if (isVarArg) ParamTypeList.pop_back();
2282
Duncan Sandsc2141722007-11-30 18:19:18 +00002283 const ParamAttrsList *PAL = 0;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002284 if (!Attrs.empty())
2285 PAL = ParamAttrsList::get(Attrs);
2286
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002287 FunctionType *FT = FunctionType::get(*$2, ParamTypeList, isVarArg);
Christopher Lambbb2f2222007-12-17 01:12:55 +00002288 const PointerType *PFT = PointerType::getUnqual(FT);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002289 delete $2;
2290
2291 ValID ID;
2292 if (!FunctionName.empty()) {
2293 ID = ValID::createGlobalName((char*)FunctionName.c_str());
2294 } else {
2295 ID = ValID::createGlobalID(CurModule.Values.size());
2296 }
2297
2298 Function *Fn = 0;
2299 // See if this function was forward referenced. If so, recycle the object.
2300 if (GlobalValue *FWRef = CurModule.GetForwardRefForGlobal(PFT, ID)) {
2301 // Move the function to the end of the list, from whereever it was
2302 // previously inserted.
2303 Fn = cast<Function>(FWRef);
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002304 assert(!Fn->getParamAttrs() && "Forward reference has parameter attributes!");
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002305 CurModule.CurrentModule->getFunctionList().remove(Fn);
2306 CurModule.CurrentModule->getFunctionList().push_back(Fn);
2307 } else if (!FunctionName.empty() && // Merge with an earlier prototype?
2308 (Fn = CurModule.CurrentModule->getFunction(FunctionName))) {
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002309 if (Fn->getFunctionType() != FT ) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002310 // The existing function doesn't have the same type. This is an overload
2311 // error.
2312 GEN_ERROR("Overload of function '" + FunctionName + "' not permitted.");
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002313 } else if (Fn->getParamAttrs() != PAL) {
2314 // The existing function doesn't have the same parameter attributes.
2315 // This is an overload error.
2316 GEN_ERROR("Overload of function '" + FunctionName + "' not permitted.");
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002317 } else if (!CurFun.isDeclare && !Fn->isDeclaration()) {
2318 // Neither the existing or the current function is a declaration and they
2319 // have the same name and same type. Clearly this is a redefinition.
2320 GEN_ERROR("Redefinition of function '" + FunctionName + "'");
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002321 } else if (Fn->isDeclaration()) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002322 // Make sure to strip off any argument names so we can't get conflicts.
2323 for (Function::arg_iterator AI = Fn->arg_begin(), AE = Fn->arg_end();
2324 AI != AE; ++AI)
2325 AI->setName("");
2326 }
2327 } else { // Not already defined?
2328 Fn = new Function(FT, GlobalValue::ExternalWeakLinkage, FunctionName,
2329 CurModule.CurrentModule);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002330 InsertValue(Fn, CurModule.Values);
2331 }
2332
2333 CurFun.FunctionStart(Fn);
2334
2335 if (CurFun.isDeclare) {
2336 // If we have declaration, always overwrite linkage. This will allow us to
2337 // correctly handle cases, when pointer to function is passed as argument to
2338 // another function.
2339 Fn->setLinkage(CurFun.Linkage);
2340 Fn->setVisibility(CurFun.Visibility);
2341 }
2342 Fn->setCallingConv($1);
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002343 Fn->setParamAttrs(PAL);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002344 Fn->setAlignment($9);
2345 if ($8) {
2346 Fn->setSection(*$8);
2347 delete $8;
2348 }
Gordon Henriksen13fe5e32007-12-10 03:18:06 +00002349 if ($10) {
2350 Fn->setCollector($10->c_str());
2351 delete $10;
2352 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002353
2354 // Add all of the arguments we parsed to the function...
2355 if ($5) { // Is null if empty...
2356 if (isVarArg) { // Nuke the last entry
2357 assert($5->back().Ty->get() == Type::VoidTy && $5->back().Name == 0 &&
2358 "Not a varargs marker!");
2359 delete $5->back().Ty;
2360 $5->pop_back(); // Delete the last entry
2361 }
2362 Function::arg_iterator ArgIt = Fn->arg_begin();
2363 Function::arg_iterator ArgEnd = Fn->arg_end();
2364 unsigned Idx = 1;
2365 for (ArgListType::iterator I = $5->begin();
2366 I != $5->end() && ArgIt != ArgEnd; ++I, ++ArgIt) {
2367 delete I->Ty; // Delete the typeholder...
2368 setValueName(ArgIt, I->Name); // Insert arg into symtab...
2369 CHECK_FOR_ERROR
2370 InsertValue(ArgIt);
2371 Idx++;
2372 }
2373
2374 delete $5; // We're now done with the argument list
2375 }
2376 CHECK_FOR_ERROR
2377};
2378
2379BEGIN : BEGINTOK | '{'; // Allow BEGIN or '{' to start a function
2380
2381FunctionHeader : FunctionDefineLinkage GVVisibilityStyle FunctionHeaderH BEGIN {
2382 $$ = CurFun.CurrentFunction;
2383
2384 // Make sure that we keep track of the linkage type even if there was a
2385 // previous "declare".
2386 $$->setLinkage($1);
2387 $$->setVisibility($2);
2388};
2389
2390END : ENDTOK | '}'; // Allow end of '}' to end a function
2391
2392Function : BasicBlockList END {
2393 $$ = $1;
2394 CHECK_FOR_ERROR
2395};
2396
2397FunctionProto : FunctionDeclareLinkage GVVisibilityStyle FunctionHeaderH {
2398 CurFun.CurrentFunction->setLinkage($1);
2399 CurFun.CurrentFunction->setVisibility($2);
2400 $$ = CurFun.CurrentFunction;
2401 CurFun.FunctionDone();
2402 CHECK_FOR_ERROR
2403 };
2404
2405//===----------------------------------------------------------------------===//
2406// Rules to match Basic Blocks
2407//===----------------------------------------------------------------------===//
2408
2409OptSideEffect : /* empty */ {
2410 $$ = false;
2411 CHECK_FOR_ERROR
2412 }
2413 | SIDEEFFECT {
2414 $$ = true;
2415 CHECK_FOR_ERROR
2416 };
2417
2418ConstValueRef : ESINT64VAL { // A reference to a direct constant
2419 $$ = ValID::create($1);
2420 CHECK_FOR_ERROR
2421 }
2422 | EUINT64VAL {
2423 $$ = ValID::create($1);
2424 CHECK_FOR_ERROR
2425 }
2426 | FPVAL { // Perhaps it's an FP constant?
2427 $$ = ValID::create($1);
2428 CHECK_FOR_ERROR
2429 }
2430 | TRUETOK {
2431 $$ = ValID::create(ConstantInt::getTrue());
2432 CHECK_FOR_ERROR
2433 }
2434 | FALSETOK {
2435 $$ = ValID::create(ConstantInt::getFalse());
2436 CHECK_FOR_ERROR
2437 }
2438 | NULL_TOK {
2439 $$ = ValID::createNull();
2440 CHECK_FOR_ERROR
2441 }
2442 | UNDEF {
2443 $$ = ValID::createUndef();
2444 CHECK_FOR_ERROR
2445 }
2446 | ZEROINITIALIZER { // A vector zero constant.
2447 $$ = ValID::createZeroInit();
2448 CHECK_FOR_ERROR
2449 }
2450 | '<' ConstVector '>' { // Nonempty unsized packed vector
2451 const Type *ETy = (*$2)[0]->getType();
2452 int NumElements = $2->size();
2453
2454 VectorType* pt = VectorType::get(ETy, NumElements);
2455 PATypeHolder* PTy = new PATypeHolder(
2456 HandleUpRefs(
2457 VectorType::get(
2458 ETy,
2459 NumElements)
2460 )
2461 );
2462
2463 // Verify all elements are correct type!
2464 for (unsigned i = 0; i < $2->size(); i++) {
2465 if (ETy != (*$2)[i]->getType())
2466 GEN_ERROR("Element #" + utostr(i) + " is not of type '" +
2467 ETy->getDescription() +"' as required!\nIt is of type '" +
2468 (*$2)[i]->getType()->getDescription() + "'.");
2469 }
2470
2471 $$ = ValID::create(ConstantVector::get(pt, *$2));
2472 delete PTy; delete $2;
2473 CHECK_FOR_ERROR
2474 }
2475 | ConstExpr {
2476 $$ = ValID::create($1);
2477 CHECK_FOR_ERROR
2478 }
2479 | ASM_TOK OptSideEffect STRINGCONSTANT ',' STRINGCONSTANT {
2480 $$ = ValID::createInlineAsm(*$3, *$5, $2);
2481 delete $3;
2482 delete $5;
2483 CHECK_FOR_ERROR
2484 };
2485
2486// SymbolicValueRef - Reference to one of two ways of symbolically refering to
2487// another value.
2488//
2489SymbolicValueRef : LOCALVAL_ID { // Is it an integer reference...?
2490 $$ = ValID::createLocalID($1);
2491 CHECK_FOR_ERROR
2492 }
2493 | GLOBALVAL_ID {
2494 $$ = ValID::createGlobalID($1);
2495 CHECK_FOR_ERROR
2496 }
2497 | LocalName { // Is it a named reference...?
2498 $$ = ValID::createLocalName(*$1);
2499 delete $1;
2500 CHECK_FOR_ERROR
2501 }
2502 | GlobalName { // Is it a named reference...?
2503 $$ = ValID::createGlobalName(*$1);
2504 delete $1;
2505 CHECK_FOR_ERROR
2506 };
2507
2508// ValueRef - A reference to a definition... either constant or symbolic
2509ValueRef : SymbolicValueRef | ConstValueRef;
2510
2511
2512// ResolvedVal - a <type> <value> pair. This is used only in cases where the
2513// type immediately preceeds the value reference, and allows complex constant
2514// pool references (for things like: 'ret [2 x int] [ int 12, int 42]')
2515ResolvedVal : Types ValueRef {
2516 if (!UpRefs.empty())
2517 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
2518 $$ = getVal(*$1, $2);
2519 delete $1;
2520 CHECK_FOR_ERROR
2521 }
2522 ;
2523
2524BasicBlockList : BasicBlockList BasicBlock {
2525 $$ = $1;
2526 CHECK_FOR_ERROR
2527 }
2528 | FunctionHeader BasicBlock { // Do not allow functions with 0 basic blocks
2529 $$ = $1;
2530 CHECK_FOR_ERROR
2531 };
2532
2533
2534// Basic blocks are terminated by branching instructions:
2535// br, br/cc, switch, ret
2536//
2537BasicBlock : InstructionList OptLocalAssign BBTerminatorInst {
2538 setValueName($3, $2);
2539 CHECK_FOR_ERROR
2540 InsertValue($3);
2541 $1->getInstList().push_back($3);
2542 $$ = $1;
2543 CHECK_FOR_ERROR
2544 };
2545
2546InstructionList : InstructionList Inst {
2547 if (CastInst *CI1 = dyn_cast<CastInst>($2))
2548 if (CastInst *CI2 = dyn_cast<CastInst>(CI1->getOperand(0)))
2549 if (CI2->getParent() == 0)
2550 $1->getInstList().push_back(CI2);
2551 $1->getInstList().push_back($2);
2552 $$ = $1;
2553 CHECK_FOR_ERROR
2554 }
2555 | /* empty */ { // Empty space between instruction lists
2556 $$ = defineBBVal(ValID::createLocalID(CurFun.NextValNum));
2557 CHECK_FOR_ERROR
2558 }
2559 | LABELSTR { // Labelled (named) basic block
2560 $$ = defineBBVal(ValID::createLocalName(*$1));
2561 delete $1;
2562 CHECK_FOR_ERROR
2563
2564 };
2565
2566BBTerminatorInst : RET ResolvedVal { // Return with a result...
2567 $$ = new ReturnInst($2);
2568 CHECK_FOR_ERROR
2569 }
2570 | RET VOID { // Return with no result...
2571 $$ = new ReturnInst();
2572 CHECK_FOR_ERROR
2573 }
2574 | BR LABEL ValueRef { // Unconditional Branch...
2575 BasicBlock* tmpBB = getBBVal($3);
2576 CHECK_FOR_ERROR
2577 $$ = new BranchInst(tmpBB);
2578 } // Conditional Branch...
2579 | BR INTTYPE ValueRef ',' LABEL ValueRef ',' LABEL ValueRef {
2580 assert(cast<IntegerType>($2)->getBitWidth() == 1 && "Not Bool?");
2581 BasicBlock* tmpBBA = getBBVal($6);
2582 CHECK_FOR_ERROR
2583 BasicBlock* tmpBBB = getBBVal($9);
2584 CHECK_FOR_ERROR
2585 Value* tmpVal = getVal(Type::Int1Ty, $3);
2586 CHECK_FOR_ERROR
2587 $$ = new BranchInst(tmpBBA, tmpBBB, tmpVal);
2588 }
2589 | SWITCH IntType ValueRef ',' LABEL ValueRef '[' JumpTable ']' {
2590 Value* tmpVal = getVal($2, $3);
2591 CHECK_FOR_ERROR
2592 BasicBlock* tmpBB = getBBVal($6);
2593 CHECK_FOR_ERROR
2594 SwitchInst *S = new SwitchInst(tmpVal, tmpBB, $8->size());
2595 $$ = S;
2596
2597 std::vector<std::pair<Constant*,BasicBlock*> >::iterator I = $8->begin(),
2598 E = $8->end();
2599 for (; I != E; ++I) {
2600 if (ConstantInt *CI = dyn_cast<ConstantInt>(I->first))
2601 S->addCase(CI, I->second);
2602 else
2603 GEN_ERROR("Switch case is constant, but not a simple integer");
2604 }
2605 delete $8;
2606 CHECK_FOR_ERROR
2607 }
2608 | SWITCH IntType ValueRef ',' LABEL ValueRef '[' ']' {
2609 Value* tmpVal = getVal($2, $3);
2610 CHECK_FOR_ERROR
2611 BasicBlock* tmpBB = getBBVal($6);
2612 CHECK_FOR_ERROR
2613 SwitchInst *S = new SwitchInst(tmpVal, tmpBB, 0);
2614 $$ = S;
2615 CHECK_FOR_ERROR
2616 }
Dale Johannesencfb19e62007-11-05 21:20:28 +00002617 | INVOKE OptCallingConv ResultTypes ValueRef '(' ParamList ')' OptFuncAttrs
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002618 TO LABEL ValueRef UNWIND LABEL ValueRef {
2619
2620 // Handle the short syntax
2621 const PointerType *PFTy = 0;
2622 const FunctionType *Ty = 0;
2623 if (!(PFTy = dyn_cast<PointerType>($3->get())) ||
2624 !(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) {
2625 // Pull out the types of all of the arguments...
2626 std::vector<const Type*> ParamTypes;
Dale Johannesencfb19e62007-11-05 21:20:28 +00002627 ParamList::iterator I = $6->begin(), E = $6->end();
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002628 for (; I != E; ++I) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002629 const Type *Ty = I->Val->getType();
2630 if (Ty == Type::VoidTy)
2631 GEN_ERROR("Short call syntax cannot be used with varargs");
2632 ParamTypes.push_back(Ty);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002633 }
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002634 Ty = FunctionType::get($3->get(), ParamTypes, false);
Christopher Lambbb2f2222007-12-17 01:12:55 +00002635 PFTy = PointerType::getUnqual(Ty);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002636 }
2637
2638 delete $3;
2639
2640 Value *V = getVal(PFTy, $4); // Get the function we're calling...
2641 CHECK_FOR_ERROR
2642 BasicBlock *Normal = getBBVal($11);
2643 CHECK_FOR_ERROR
2644 BasicBlock *Except = getBBVal($14);
2645 CHECK_FOR_ERROR
2646
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002647 ParamAttrsVector Attrs;
2648 if ($8 != ParamAttr::None) {
2649 ParamAttrsWithIndex PAWI; PAWI.index = 0; PAWI.attrs = $8;
2650 Attrs.push_back(PAWI);
2651 }
2652
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002653 // Check the arguments
2654 ValueList Args;
2655 if ($6->empty()) { // Has no arguments?
2656 // Make sure no arguments is a good thing!
2657 if (Ty->getNumParams() != 0)
2658 GEN_ERROR("No arguments passed to a function that "
2659 "expects arguments");
2660 } else { // Has arguments?
2661 // Loop through FunctionType's arguments and ensure they are specified
2662 // correctly!
2663 FunctionType::param_iterator I = Ty->param_begin();
2664 FunctionType::param_iterator E = Ty->param_end();
Dale Johannesencfb19e62007-11-05 21:20:28 +00002665 ParamList::iterator ArgI = $6->begin(), ArgE = $6->end();
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002666 unsigned index = 1;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002667
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002668 for (; ArgI != ArgE && I != E; ++ArgI, ++I, ++index) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002669 if (ArgI->Val->getType() != *I)
2670 GEN_ERROR("Parameter " + ArgI->Val->getName()+ " is not of type '" +
2671 (*I)->getDescription() + "'");
2672 Args.push_back(ArgI->Val);
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002673 if (ArgI->Attrs != ParamAttr::None) {
2674 ParamAttrsWithIndex PAWI;
2675 PAWI.index = index;
2676 PAWI.attrs = ArgI->Attrs;
2677 Attrs.push_back(PAWI);
2678 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002679 }
2680
2681 if (Ty->isVarArg()) {
2682 if (I == E)
Duncan Sands6c3314b2008-01-11 21:23:39 +00002683 for (; ArgI != ArgE; ++ArgI, ++index) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002684 Args.push_back(ArgI->Val); // push the remaining varargs
Duncan Sands6c3314b2008-01-11 21:23:39 +00002685 if (ArgI->Attrs != ParamAttr::None) {
2686 ParamAttrsWithIndex PAWI;
2687 PAWI.index = index;
2688 PAWI.attrs = ArgI->Attrs;
2689 Attrs.push_back(PAWI);
2690 }
2691 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002692 } else if (I != E || ArgI != ArgE)
2693 GEN_ERROR("Invalid number of parameters detected");
2694 }
2695
Duncan Sandsc2141722007-11-30 18:19:18 +00002696 const ParamAttrsList *PAL = 0;
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002697 if (!Attrs.empty())
2698 PAL = ParamAttrsList::get(Attrs);
2699
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002700 // Create the InvokeInst
David Greene8278ef52007-08-27 19:04:21 +00002701 InvokeInst *II = new InvokeInst(V, Normal, Except, Args.begin(), Args.end());
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002702 II->setCallingConv($2);
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002703 II->setParamAttrs(PAL);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002704 $$ = II;
2705 delete $6;
2706 CHECK_FOR_ERROR
2707 }
2708 | UNWIND {
2709 $$ = new UnwindInst();
2710 CHECK_FOR_ERROR
2711 }
2712 | UNREACHABLE {
2713 $$ = new UnreachableInst();
2714 CHECK_FOR_ERROR
2715 };
2716
2717
2718
2719JumpTable : JumpTable IntType ConstValueRef ',' LABEL ValueRef {
2720 $$ = $1;
2721 Constant *V = cast<Constant>(getExistingVal($2, $3));
2722 CHECK_FOR_ERROR
2723 if (V == 0)
2724 GEN_ERROR("May only switch on a constant pool value");
2725
2726 BasicBlock* tmpBB = getBBVal($6);
2727 CHECK_FOR_ERROR
2728 $$->push_back(std::make_pair(V, tmpBB));
2729 }
2730 | IntType ConstValueRef ',' LABEL ValueRef {
2731 $$ = new std::vector<std::pair<Constant*, BasicBlock*> >();
2732 Constant *V = cast<Constant>(getExistingVal($1, $2));
2733 CHECK_FOR_ERROR
2734
2735 if (V == 0)
2736 GEN_ERROR("May only switch on a constant pool value");
2737
2738 BasicBlock* tmpBB = getBBVal($5);
2739 CHECK_FOR_ERROR
2740 $$->push_back(std::make_pair(V, tmpBB));
2741 };
2742
2743Inst : OptLocalAssign InstVal {
2744 // Is this definition named?? if so, assign the name...
2745 setValueName($2, $1);
2746 CHECK_FOR_ERROR
2747 InsertValue($2);
2748 $$ = $2;
2749 CHECK_FOR_ERROR
2750 };
2751
2752
2753PHIList : Types '[' ValueRef ',' ValueRef ']' { // Used for PHI nodes
2754 if (!UpRefs.empty())
2755 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
2756 $$ = new std::list<std::pair<Value*, BasicBlock*> >();
2757 Value* tmpVal = getVal(*$1, $3);
2758 CHECK_FOR_ERROR
2759 BasicBlock* tmpBB = getBBVal($5);
2760 CHECK_FOR_ERROR
2761 $$->push_back(std::make_pair(tmpVal, tmpBB));
2762 delete $1;
2763 }
2764 | PHIList ',' '[' ValueRef ',' ValueRef ']' {
2765 $$ = $1;
2766 Value* tmpVal = getVal($1->front().first->getType(), $4);
2767 CHECK_FOR_ERROR
2768 BasicBlock* tmpBB = getBBVal($6);
2769 CHECK_FOR_ERROR
2770 $1->push_back(std::make_pair(tmpVal, tmpBB));
2771 };
2772
2773
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002774ParamList : Types OptParamAttrs ValueRef OptParamAttrs {
2775 // FIXME: Remove trailing OptParamAttrs in LLVM 3.0, it was a mistake in 2.0
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002776 if (!UpRefs.empty())
2777 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
2778 // Used for call and invoke instructions
Dale Johannesencfb19e62007-11-05 21:20:28 +00002779 $$ = new ParamList();
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002780 ParamListEntry E; E.Attrs = $2 | $4; E.Val = getVal($1->get(), $3);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002781 $$->push_back(E);
2782 delete $1;
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002783 CHECK_FOR_ERROR
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002784 }
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002785 | LABEL OptParamAttrs ValueRef OptParamAttrs {
2786 // FIXME: Remove trailing OptParamAttrs in LLVM 3.0, it was a mistake in 2.0
Dale Johannesencfb19e62007-11-05 21:20:28 +00002787 // Labels are only valid in ASMs
2788 $$ = new ParamList();
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002789 ParamListEntry E; E.Attrs = $2 | $4; E.Val = getBBVal($3);
Dale Johannesencfb19e62007-11-05 21:20:28 +00002790 $$->push_back(E);
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002791 CHECK_FOR_ERROR
Dale Johannesencfb19e62007-11-05 21:20:28 +00002792 }
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002793 | ParamList ',' Types OptParamAttrs ValueRef OptParamAttrs {
2794 // FIXME: Remove trailing OptParamAttrs in LLVM 3.0, it was a mistake in 2.0
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002795 if (!UpRefs.empty())
2796 GEN_ERROR("Invalid upreference in type: " + (*$3)->getDescription());
2797 $$ = $1;
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002798 ParamListEntry E; E.Attrs = $4 | $6; E.Val = getVal($3->get(), $5);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002799 $$->push_back(E);
2800 delete $3;
2801 CHECK_FOR_ERROR
2802 }
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002803 | ParamList ',' LABEL OptParamAttrs ValueRef OptParamAttrs {
2804 // FIXME: Remove trailing OptParamAttrs in LLVM 3.0, it was a mistake in 2.0
Dale Johannesencfb19e62007-11-05 21:20:28 +00002805 $$ = $1;
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002806 ParamListEntry E; E.Attrs = $4 | $6; E.Val = getBBVal($5);
Dale Johannesencfb19e62007-11-05 21:20:28 +00002807 $$->push_back(E);
2808 CHECK_FOR_ERROR
2809 }
2810 | /*empty*/ { $$ = new ParamList(); };
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002811
2812IndexList // Used for gep instructions and constant expressions
2813 : /*empty*/ { $$ = new std::vector<Value*>(); }
2814 | IndexList ',' ResolvedVal {
2815 $$ = $1;
2816 $$->push_back($3);
2817 CHECK_FOR_ERROR
2818 }
2819 ;
2820
2821OptTailCall : TAIL CALL {
2822 $$ = true;
2823 CHECK_FOR_ERROR
2824 }
2825 | CALL {
2826 $$ = false;
2827 CHECK_FOR_ERROR
2828 };
2829
2830InstVal : ArithmeticOps Types ValueRef ',' ValueRef {
2831 if (!UpRefs.empty())
2832 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
2833 if (!(*$2)->isInteger() && !(*$2)->isFloatingPoint() &&
2834 !isa<VectorType>((*$2).get()))
2835 GEN_ERROR(
2836 "Arithmetic operator requires integer, FP, or packed operands");
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002837 Value* val1 = getVal(*$2, $3);
2838 CHECK_FOR_ERROR
2839 Value* val2 = getVal(*$2, $5);
2840 CHECK_FOR_ERROR
2841 $$ = BinaryOperator::create($1, val1, val2);
2842 if ($$ == 0)
2843 GEN_ERROR("binary operator returned null");
2844 delete $2;
2845 }
2846 | LogicalOps Types ValueRef ',' ValueRef {
2847 if (!UpRefs.empty())
2848 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
2849 if (!(*$2)->isInteger()) {
2850 if (Instruction::isShift($1) || !isa<VectorType>($2->get()) ||
2851 !cast<VectorType>($2->get())->getElementType()->isInteger())
2852 GEN_ERROR("Logical operator requires integral operands");
2853 }
2854 Value* tmpVal1 = getVal(*$2, $3);
2855 CHECK_FOR_ERROR
2856 Value* tmpVal2 = getVal(*$2, $5);
2857 CHECK_FOR_ERROR
2858 $$ = BinaryOperator::create($1, tmpVal1, tmpVal2);
2859 if ($$ == 0)
2860 GEN_ERROR("binary operator returned null");
2861 delete $2;
2862 }
2863 | ICMP IPredicates Types ValueRef ',' ValueRef {
2864 if (!UpRefs.empty())
2865 GEN_ERROR("Invalid upreference in type: " + (*$3)->getDescription());
2866 if (isa<VectorType>((*$3).get()))
2867 GEN_ERROR("Vector types not supported by icmp instruction");
2868 Value* tmpVal1 = getVal(*$3, $4);
2869 CHECK_FOR_ERROR
2870 Value* tmpVal2 = getVal(*$3, $6);
2871 CHECK_FOR_ERROR
2872 $$ = CmpInst::create($1, $2, tmpVal1, tmpVal2);
2873 if ($$ == 0)
2874 GEN_ERROR("icmp operator returned null");
2875 delete $3;
2876 }
2877 | FCMP FPredicates Types ValueRef ',' ValueRef {
2878 if (!UpRefs.empty())
2879 GEN_ERROR("Invalid upreference in type: " + (*$3)->getDescription());
2880 if (isa<VectorType>((*$3).get()))
2881 GEN_ERROR("Vector types not supported by fcmp instruction");
2882 Value* tmpVal1 = getVal(*$3, $4);
2883 CHECK_FOR_ERROR
2884 Value* tmpVal2 = getVal(*$3, $6);
2885 CHECK_FOR_ERROR
2886 $$ = CmpInst::create($1, $2, tmpVal1, tmpVal2);
2887 if ($$ == 0)
2888 GEN_ERROR("fcmp operator returned null");
2889 delete $3;
2890 }
2891 | CastOps ResolvedVal TO Types {
2892 if (!UpRefs.empty())
2893 GEN_ERROR("Invalid upreference in type: " + (*$4)->getDescription());
2894 Value* Val = $2;
2895 const Type* DestTy = $4->get();
2896 if (!CastInst::castIsValid($1, Val, DestTy))
2897 GEN_ERROR("invalid cast opcode for cast from '" +
2898 Val->getType()->getDescription() + "' to '" +
2899 DestTy->getDescription() + "'");
2900 $$ = CastInst::create($1, Val, DestTy);
2901 delete $4;
2902 }
2903 | SELECT ResolvedVal ',' ResolvedVal ',' ResolvedVal {
2904 if ($2->getType() != Type::Int1Ty)
2905 GEN_ERROR("select condition must be boolean");
2906 if ($4->getType() != $6->getType())
2907 GEN_ERROR("select value types should match");
2908 $$ = new SelectInst($2, $4, $6);
2909 CHECK_FOR_ERROR
2910 }
2911 | VAARG ResolvedVal ',' Types {
2912 if (!UpRefs.empty())
2913 GEN_ERROR("Invalid upreference in type: " + (*$4)->getDescription());
2914 $$ = new VAArgInst($2, *$4);
2915 delete $4;
2916 CHECK_FOR_ERROR
2917 }
2918 | EXTRACTELEMENT ResolvedVal ',' ResolvedVal {
2919 if (!ExtractElementInst::isValidOperands($2, $4))
2920 GEN_ERROR("Invalid extractelement operands");
2921 $$ = new ExtractElementInst($2, $4);
2922 CHECK_FOR_ERROR
2923 }
2924 | INSERTELEMENT ResolvedVal ',' ResolvedVal ',' ResolvedVal {
2925 if (!InsertElementInst::isValidOperands($2, $4, $6))
2926 GEN_ERROR("Invalid insertelement operands");
2927 $$ = new InsertElementInst($2, $4, $6);
2928 CHECK_FOR_ERROR
2929 }
2930 | SHUFFLEVECTOR ResolvedVal ',' ResolvedVal ',' ResolvedVal {
2931 if (!ShuffleVectorInst::isValidOperands($2, $4, $6))
2932 GEN_ERROR("Invalid shufflevector operands");
2933 $$ = new ShuffleVectorInst($2, $4, $6);
2934 CHECK_FOR_ERROR
2935 }
2936 | PHI_TOK PHIList {
2937 const Type *Ty = $2->front().first->getType();
2938 if (!Ty->isFirstClassType())
2939 GEN_ERROR("PHI node operands must be of first class type");
2940 $$ = new PHINode(Ty);
2941 ((PHINode*)$$)->reserveOperandSpace($2->size());
2942 while ($2->begin() != $2->end()) {
2943 if ($2->front().first->getType() != Ty)
2944 GEN_ERROR("All elements of a PHI node must be of the same type");
2945 cast<PHINode>($$)->addIncoming($2->front().first, $2->front().second);
2946 $2->pop_front();
2947 }
2948 delete $2; // Free the list...
2949 CHECK_FOR_ERROR
2950 }
Dale Johannesencfb19e62007-11-05 21:20:28 +00002951 | OptTailCall OptCallingConv ResultTypes ValueRef '(' ParamList ')'
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002952 OptFuncAttrs {
2953
2954 // Handle the short syntax
2955 const PointerType *PFTy = 0;
2956 const FunctionType *Ty = 0;
2957 if (!(PFTy = dyn_cast<PointerType>($3->get())) ||
2958 !(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) {
2959 // Pull out the types of all of the arguments...
2960 std::vector<const Type*> ParamTypes;
Dale Johannesencfb19e62007-11-05 21:20:28 +00002961 ParamList::iterator I = $6->begin(), E = $6->end();
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002962 for (; I != E; ++I) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002963 const Type *Ty = I->Val->getType();
2964 if (Ty == Type::VoidTy)
2965 GEN_ERROR("Short call syntax cannot be used with varargs");
2966 ParamTypes.push_back(Ty);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002967 }
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002968 Ty = FunctionType::get($3->get(), ParamTypes, false);
Christopher Lambbb2f2222007-12-17 01:12:55 +00002969 PFTy = PointerType::getUnqual(Ty);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002970 }
2971
2972 Value *V = getVal(PFTy, $4); // Get the function we're calling...
2973 CHECK_FOR_ERROR
2974
2975 // Check for call to invalid intrinsic to avoid crashing later.
2976 if (Function *theF = dyn_cast<Function>(V)) {
2977 if (theF->hasName() && (theF->getValueName()->getKeyLength() >= 5) &&
2978 (0 == strncmp(theF->getValueName()->getKeyData(), "llvm.", 5)) &&
2979 !theF->getIntrinsicID(true))
2980 GEN_ERROR("Call to invalid LLVM intrinsic function '" +
2981 theF->getName() + "'");
2982 }
2983
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002984 // Set up the ParamAttrs for the function
2985 ParamAttrsVector Attrs;
2986 if ($8 != ParamAttr::None) {
2987 ParamAttrsWithIndex PAWI;
2988 PAWI.index = 0;
2989 PAWI.attrs = $8;
2990 Attrs.push_back(PAWI);
2991 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002992 // Check the arguments
2993 ValueList Args;
2994 if ($6->empty()) { // Has no arguments?
2995 // Make sure no arguments is a good thing!
2996 if (Ty->getNumParams() != 0)
2997 GEN_ERROR("No arguments passed to a function that "
2998 "expects arguments");
2999 } else { // Has arguments?
3000 // Loop through FunctionType's arguments and ensure they are specified
Duncan Sandsf5588dc2007-11-27 13:23:08 +00003001 // correctly. Also, gather any parameter attributes.
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003002 FunctionType::param_iterator I = Ty->param_begin();
3003 FunctionType::param_iterator E = Ty->param_end();
Dale Johannesencfb19e62007-11-05 21:20:28 +00003004 ParamList::iterator ArgI = $6->begin(), ArgE = $6->end();
Duncan Sandsf5588dc2007-11-27 13:23:08 +00003005 unsigned index = 1;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003006
Duncan Sandsf5588dc2007-11-27 13:23:08 +00003007 for (; ArgI != ArgE && I != E; ++ArgI, ++I, ++index) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003008 if (ArgI->Val->getType() != *I)
3009 GEN_ERROR("Parameter " + ArgI->Val->getName()+ " is not of type '" +
3010 (*I)->getDescription() + "'");
3011 Args.push_back(ArgI->Val);
Duncan Sandsf5588dc2007-11-27 13:23:08 +00003012 if (ArgI->Attrs != ParamAttr::None) {
3013 ParamAttrsWithIndex PAWI;
3014 PAWI.index = index;
3015 PAWI.attrs = ArgI->Attrs;
3016 Attrs.push_back(PAWI);
3017 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003018 }
3019 if (Ty->isVarArg()) {
3020 if (I == E)
Duncan Sands6c3314b2008-01-11 21:23:39 +00003021 for (; ArgI != ArgE; ++ArgI, ++index) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003022 Args.push_back(ArgI->Val); // push the remaining varargs
Duncan Sands6c3314b2008-01-11 21:23:39 +00003023 if (ArgI->Attrs != ParamAttr::None) {
3024 ParamAttrsWithIndex PAWI;
3025 PAWI.index = index;
3026 PAWI.attrs = ArgI->Attrs;
3027 Attrs.push_back(PAWI);
3028 }
3029 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003030 } else if (I != E || ArgI != ArgE)
3031 GEN_ERROR("Invalid number of parameters detected");
3032 }
Duncan Sandsf5588dc2007-11-27 13:23:08 +00003033
3034 // Finish off the ParamAttrs and check them
Duncan Sandsc2141722007-11-30 18:19:18 +00003035 const ParamAttrsList *PAL = 0;
Duncan Sandsf5588dc2007-11-27 13:23:08 +00003036 if (!Attrs.empty())
3037 PAL = ParamAttrsList::get(Attrs);
3038
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003039 // Create the call node
David Greeneb1c4a7b2007-08-01 03:43:44 +00003040 CallInst *CI = new CallInst(V, Args.begin(), Args.end());
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003041 CI->setTailCall($1);
3042 CI->setCallingConv($2);
Duncan Sandsf5588dc2007-11-27 13:23:08 +00003043 CI->setParamAttrs(PAL);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003044 $$ = CI;
3045 delete $6;
3046 delete $3;
3047 CHECK_FOR_ERROR
3048 }
3049 | MemoryInst {
3050 $$ = $1;
3051 CHECK_FOR_ERROR
3052 };
3053
3054OptVolatile : VOLATILE {
3055 $$ = true;
3056 CHECK_FOR_ERROR
3057 }
3058 | /* empty */ {
3059 $$ = false;
3060 CHECK_FOR_ERROR
3061 };
3062
3063
3064
3065MemoryInst : MALLOC Types OptCAlign {
3066 if (!UpRefs.empty())
3067 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
3068 $$ = new MallocInst(*$2, 0, $3);
3069 delete $2;
3070 CHECK_FOR_ERROR
3071 }
3072 | MALLOC Types ',' INTTYPE ValueRef OptCAlign {
3073 if (!UpRefs.empty())
3074 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
3075 Value* tmpVal = getVal($4, $5);
3076 CHECK_FOR_ERROR
3077 $$ = new MallocInst(*$2, tmpVal, $6);
3078 delete $2;
3079 }
3080 | ALLOCA Types OptCAlign {
3081 if (!UpRefs.empty())
3082 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
3083 $$ = new AllocaInst(*$2, 0, $3);
3084 delete $2;
3085 CHECK_FOR_ERROR
3086 }
3087 | ALLOCA Types ',' INTTYPE ValueRef OptCAlign {
3088 if (!UpRefs.empty())
3089 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
3090 Value* tmpVal = getVal($4, $5);
3091 CHECK_FOR_ERROR
3092 $$ = new AllocaInst(*$2, tmpVal, $6);
3093 delete $2;
3094 }
3095 | FREE ResolvedVal {
3096 if (!isa<PointerType>($2->getType()))
3097 GEN_ERROR("Trying to free nonpointer type " +
3098 $2->getType()->getDescription() + "");
3099 $$ = new FreeInst($2);
3100 CHECK_FOR_ERROR
3101 }
3102
3103 | OptVolatile LOAD Types ValueRef OptCAlign {
3104 if (!UpRefs.empty())
3105 GEN_ERROR("Invalid upreference in type: " + (*$3)->getDescription());
3106 if (!isa<PointerType>($3->get()))
3107 GEN_ERROR("Can't load from nonpointer type: " +
3108 (*$3)->getDescription());
3109 if (!cast<PointerType>($3->get())->getElementType()->isFirstClassType())
3110 GEN_ERROR("Can't load from pointer of non-first-class type: " +
3111 (*$3)->getDescription());
3112 Value* tmpVal = getVal(*$3, $4);
3113 CHECK_FOR_ERROR
3114 $$ = new LoadInst(tmpVal, "", $1, $5);
3115 delete $3;
3116 }
3117 | OptVolatile STORE ResolvedVal ',' Types ValueRef OptCAlign {
3118 if (!UpRefs.empty())
3119 GEN_ERROR("Invalid upreference in type: " + (*$5)->getDescription());
3120 const PointerType *PT = dyn_cast<PointerType>($5->get());
3121 if (!PT)
3122 GEN_ERROR("Can't store to a nonpointer type: " +
3123 (*$5)->getDescription());
3124 const Type *ElTy = PT->getElementType();
3125 if (ElTy != $3->getType())
3126 GEN_ERROR("Can't store '" + $3->getType()->getDescription() +
3127 "' into space of type '" + ElTy->getDescription() + "'");
3128
3129 Value* tmpVal = getVal(*$5, $6);
3130 CHECK_FOR_ERROR
3131 $$ = new StoreInst($3, tmpVal, $1, $7);
3132 delete $5;
3133 }
Devang Patele5c806a2008-02-19 22:26:37 +00003134| GETRESULT Types LocalName ',' ConstVal {
3135 ValID TmpVID = ValID::createLocalName(*$3);
3136 Value *TmpVal = getVal($2->get(), TmpVID);
3137 if (!GetResultInst::isValidOperands(TmpVal, $5))
3138 GEN_ERROR("Invalid getresult operands");
3139 $$ = new GetResultInst(TmpVal, $5);
3140 CHECK_FOR_ERROR
3141 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003142 | GETELEMENTPTR Types ValueRef IndexList {
3143 if (!UpRefs.empty())
3144 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
3145 if (!isa<PointerType>($2->get()))
3146 GEN_ERROR("getelementptr insn requires pointer operand");
3147
David Greene393be882007-09-04 15:46:09 +00003148 if (!GetElementPtrInst::getIndexedType(*$2, $4->begin(), $4->end(), true))
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003149 GEN_ERROR("Invalid getelementptr indices for type '" +
3150 (*$2)->getDescription()+ "'");
3151 Value* tmpVal = getVal(*$2, $3);
3152 CHECK_FOR_ERROR
David Greene393be882007-09-04 15:46:09 +00003153 $$ = new GetElementPtrInst(tmpVal, $4->begin(), $4->end());
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003154 delete $2;
3155 delete $4;
3156 };
3157
3158
3159%%
3160
3161// common code from the two 'RunVMAsmParser' functions
3162static Module* RunParser(Module * M) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003163 CurModule.CurrentModule = M;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003164 // Check to make sure the parser succeeded
3165 if (yyparse()) {
3166 if (ParserResult)
3167 delete ParserResult;
3168 return 0;
3169 }
3170
3171 // Emit an error if there are any unresolved types left.
3172 if (!CurModule.LateResolveTypes.empty()) {
3173 const ValID &DID = CurModule.LateResolveTypes.begin()->first;
3174 if (DID.Type == ValID::LocalName) {
3175 GenerateError("Undefined type remains at eof: '"+DID.getName() + "'");
3176 } else {
3177 GenerateError("Undefined type remains at eof: #" + itostr(DID.Num));
3178 }
3179 if (ParserResult)
3180 delete ParserResult;
3181 return 0;
3182 }
3183
3184 // Emit an error if there are any unresolved values left.
3185 if (!CurModule.LateResolveValues.empty()) {
3186 Value *V = CurModule.LateResolveValues.back();
3187 std::map<Value*, std::pair<ValID, int> >::iterator I =
3188 CurModule.PlaceHolderInfo.find(V);
3189
3190 if (I != CurModule.PlaceHolderInfo.end()) {
3191 ValID &DID = I->second.first;
3192 if (DID.Type == ValID::LocalName) {
3193 GenerateError("Undefined value remains at eof: "+DID.getName() + "'");
3194 } else {
3195 GenerateError("Undefined value remains at eof: #" + itostr(DID.Num));
3196 }
3197 if (ParserResult)
3198 delete ParserResult;
3199 return 0;
3200 }
3201 }
3202
3203 // Check to make sure that parsing produced a result
3204 if (!ParserResult)
3205 return 0;
3206
3207 // Reset ParserResult variable while saving its value for the result.
3208 Module *Result = ParserResult;
3209 ParserResult = 0;
3210
3211 return Result;
3212}
3213
3214void llvm::GenerateError(const std::string &message, int LineNo) {
Chris Lattner17e73c22007-11-18 08:46:26 +00003215 if (LineNo == -1) LineNo = LLLgetLineNo();
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003216 // TODO: column number in exception
3217 if (TheParseError)
Chris Lattner17e73c22007-11-18 08:46:26 +00003218 TheParseError->setError(LLLgetFilename(), message, LineNo);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003219 TriggerError = 1;
3220}
3221
3222int yyerror(const char *ErrorMsg) {
Chris Lattner17e73c22007-11-18 08:46:26 +00003223 std::string where = LLLgetFilename() + ":" + utostr(LLLgetLineNo()) + ": ";
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003224 std::string errMsg = where + "error: " + std::string(ErrorMsg);
Chris Lattner17e73c22007-11-18 08:46:26 +00003225 if (yychar != YYEMPTY && yychar != 0) {
3226 errMsg += " while reading token: '";
3227 errMsg += std::string(LLLgetTokenStart(),
3228 LLLgetTokenStart()+LLLgetTokenLength()) + "'";
3229 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003230 GenerateError(errMsg);
3231 return 0;
3232}