blob: b0cdbc7c9bc262f764da036748c09b936918abf7 [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 Carruth563d4a42007-08-04 01:56:21 +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 Carruth563d4a42007-08-04 01:56:21 +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 Lattner59363a32008-02-19 04:36:25 +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 Lattner59363a32008-02-19 04:36:25 +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 Lattner59363a32008-02-19 04:36:25 +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 Lattner59363a32008-02-19 04:36:25 +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 Lattner59363a32008-02-19 04:36:25 +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 Johannesen255b8fe2007-09-11 18:33:39 +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 Lamb0a243582007-12-11 09:02:08 +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,
Duncan Sandsf5588dc2007-11-27 13:23:08 +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);
Anton Korobeynikov6a4a9332008-02-20 12:07:57 +0000581 if (N) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000582 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() + "'");
Anton Korobeynikov6a4a9332008-02-20 12:07:57 +0000587 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000588 } else if (ID.Type == ValID::LocalID) {
589 if (ID.Num < CurFun.NextValNum && ID.Num < CurFun.Values.size()) {
590 if (CurFun.Values[ID.Num]->getType()->getTypeID() == Type::LabelTyID)
591 BB = cast<BasicBlock>(CurFun.Values[ID.Num]);
592 else
593 GenerateError("Reference to label '%" + utostr(ID.Num) +
594 "' is actually of type '"+
595 CurFun.Values[ID.Num]->getType()->getDescription() + "'");
596 }
597 } else {
598 GenerateError("Illegal label reference " + ID.getName());
599 return 0;
600 }
601
602 // If its already been defined, return it now.
603 if (BB) {
604 ID.destroy(); // Free strdup'd memory.
605 return BB;
606 }
607
608 // Otherwise, this block has not been seen before, create it.
609 std::string Name;
610 if (ID.Type == ValID::LocalName)
611 Name = ID.getName();
612 BB = new BasicBlock(Name, CurFun.CurrentFunction);
613
614 // Insert it in the forward refs map.
615 CurFun.BBForwardRefs[ID] = BB;
616
617 return BB;
618}
619
620
621//===----------------------------------------------------------------------===//
622// Code to handle forward references in instructions
623//===----------------------------------------------------------------------===//
624//
625// This code handles the late binding needed with statements that reference
626// values not defined yet... for example, a forward branch, or the PHI node for
627// a loop body.
628//
629// This keeps a table (CurFun.LateResolveValues) of all such forward references
630// and back patchs after we are done.
631//
632
633// ResolveDefinitions - If we could not resolve some defs at parsing
634// time (forward branches, phi functions for loops, etc...) resolve the
635// defs now...
636//
637static void
638ResolveDefinitions(ValueList &LateResolvers, ValueList *FutureLateResolvers) {
639 // Loop over LateResolveDefs fixing up stuff that couldn't be resolved
640 while (!LateResolvers.empty()) {
641 Value *V = LateResolvers.back();
642 LateResolvers.pop_back();
643
644 std::map<Value*, std::pair<ValID, int> >::iterator PHI =
645 CurModule.PlaceHolderInfo.find(V);
646 assert(PHI != CurModule.PlaceHolderInfo.end() && "Placeholder error!");
647
648 ValID &DID = PHI->second.first;
649
650 Value *TheRealValue = getExistingVal(V->getType(), DID);
651 if (TriggerError)
652 return;
653 if (TheRealValue) {
654 V->replaceAllUsesWith(TheRealValue);
655 delete V;
656 CurModule.PlaceHolderInfo.erase(PHI);
657 } else if (FutureLateResolvers) {
658 // Functions have their unresolved items forwarded to the module late
659 // resolver table
660 InsertValue(V, *FutureLateResolvers);
661 } else {
662 if (DID.Type == ValID::LocalName || DID.Type == ValID::GlobalName) {
663 GenerateError("Reference to an invalid definition: '" +DID.getName()+
664 "' of type '" + V->getType()->getDescription() + "'",
665 PHI->second.second);
666 return;
667 } else {
668 GenerateError("Reference to an invalid definition: #" +
669 itostr(DID.Num) + " of type '" +
670 V->getType()->getDescription() + "'",
671 PHI->second.second);
672 return;
673 }
674 }
675 }
676 LateResolvers.clear();
677}
678
679// ResolveTypeTo - A brand new type was just declared. This means that (if
680// name is not null) things referencing Name can be resolved. Otherwise, things
681// refering to the number can be resolved. Do this now.
682//
683static void ResolveTypeTo(std::string *Name, const Type *ToTy) {
684 ValID D;
685 if (Name)
686 D = ValID::createLocalName(*Name);
687 else
688 D = ValID::createLocalID(CurModule.Types.size());
689
690 std::map<ValID, PATypeHolder>::iterator I =
691 CurModule.LateResolveTypes.find(D);
692 if (I != CurModule.LateResolveTypes.end()) {
693 ((DerivedType*)I->second.get())->refineAbstractTypeTo(ToTy);
694 CurModule.LateResolveTypes.erase(I);
695 }
696}
697
698// setValueName - Set the specified value to the name given. The name may be
699// null potentially, in which case this is a noop. The string passed in is
700// assumed to be a malloc'd string buffer, and is free'd by this function.
701//
702static void setValueName(Value *V, std::string *NameStr) {
703 if (!NameStr) return;
704 std::string Name(*NameStr); // Copy string
705 delete NameStr; // Free old string
706
707 if (V->getType() == Type::VoidTy) {
708 GenerateError("Can't assign name '" + Name+"' to value with void type");
709 return;
710 }
711
712 assert(inFunctionScope() && "Must be in function scope!");
713 ValueSymbolTable &ST = CurFun.CurrentFunction->getValueSymbolTable();
714 if (ST.lookup(Name)) {
715 GenerateError("Redefinition of value '" + Name + "' of type '" +
716 V->getType()->getDescription() + "'");
717 return;
718 }
719
720 // Set the name.
721 V->setName(Name);
722}
723
724/// ParseGlobalVariable - Handle parsing of a global. If Initializer is null,
725/// this is a declaration, otherwise it is a definition.
726static GlobalVariable *
727ParseGlobalVariable(std::string *NameStr,
728 GlobalValue::LinkageTypes Linkage,
729 GlobalValue::VisibilityTypes Visibility,
730 bool isConstantGlobal, const Type *Ty,
Christopher Lamb0a243582007-12-11 09:02:08 +0000731 Constant *Initializer, bool IsThreadLocal,
732 unsigned AddressSpace = 0) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000733 if (isa<FunctionType>(Ty)) {
734 GenerateError("Cannot declare global vars of function type");
735 return 0;
736 }
737
Christopher Lamb0a243582007-12-11 09:02:08 +0000738 const PointerType *PTy = PointerType::get(Ty, AddressSpace);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000739
740 std::string Name;
741 if (NameStr) {
742 Name = *NameStr; // Copy string
743 delete NameStr; // Free old string
744 }
745
746 // See if this global value was forward referenced. If so, recycle the
747 // object.
748 ValID ID;
749 if (!Name.empty()) {
750 ID = ValID::createGlobalName(Name);
751 } else {
752 ID = ValID::createGlobalID(CurModule.Values.size());
753 }
754
755 if (GlobalValue *FWGV = CurModule.GetForwardRefForGlobal(PTy, ID)) {
756 // Move the global to the end of the list, from whereever it was
757 // previously inserted.
758 GlobalVariable *GV = cast<GlobalVariable>(FWGV);
759 CurModule.CurrentModule->getGlobalList().remove(GV);
760 CurModule.CurrentModule->getGlobalList().push_back(GV);
761 GV->setInitializer(Initializer);
762 GV->setLinkage(Linkage);
763 GV->setVisibility(Visibility);
764 GV->setConstant(isConstantGlobal);
765 GV->setThreadLocal(IsThreadLocal);
766 InsertValue(GV, CurModule.Values);
767 return GV;
768 }
769
770 // If this global has a name
771 if (!Name.empty()) {
772 // if the global we're parsing has an initializer (is a definition) and
773 // has external linkage.
774 if (Initializer && Linkage != GlobalValue::InternalLinkage)
775 // If there is already a global with external linkage with this name
776 if (CurModule.CurrentModule->getGlobalVariable(Name, false)) {
777 // If we allow this GVar to get created, it will be renamed in the
778 // symbol table because it conflicts with an existing GVar. We can't
779 // allow redefinition of GVars whose linking indicates that their name
780 // must stay the same. Issue the error.
781 GenerateError("Redefinition of global variable named '" + Name +
782 "' of type '" + Ty->getDescription() + "'");
783 return 0;
784 }
785 }
786
787 // Otherwise there is no existing GV to use, create one now.
788 GlobalVariable *GV =
789 new GlobalVariable(Ty, isConstantGlobal, Linkage, Initializer, Name,
Christopher Lamb0a243582007-12-11 09:02:08 +0000790 CurModule.CurrentModule, IsThreadLocal, AddressSpace);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000791 GV->setVisibility(Visibility);
792 InsertValue(GV, CurModule.Values);
793 return GV;
794}
795
796// setTypeName - Set the specified type to the name given. The name may be
797// null potentially, in which case this is a noop. The string passed in is
798// assumed to be a malloc'd string buffer, and is freed by this function.
799//
800// This function returns true if the type has already been defined, but is
801// allowed to be redefined in the specified context. If the name is a new name
802// for the type plane, it is inserted and false is returned.
803static bool setTypeName(const Type *T, std::string *NameStr) {
804 assert(!inFunctionScope() && "Can't give types function-local names!");
805 if (NameStr == 0) return false;
806
807 std::string Name(*NameStr); // Copy string
808 delete NameStr; // Free old string
809
810 // We don't allow assigning names to void type
811 if (T == Type::VoidTy) {
812 GenerateError("Can't assign name '" + Name + "' to the void type");
813 return false;
814 }
815
816 // Set the type name, checking for conflicts as we do so.
817 bool AlreadyExists = CurModule.CurrentModule->addTypeName(Name, T);
818
819 if (AlreadyExists) { // Inserting a name that is already defined???
820 const Type *Existing = CurModule.CurrentModule->getTypeByName(Name);
821 assert(Existing && "Conflict but no matching type?!");
822
823 // There is only one case where this is allowed: when we are refining an
824 // opaque type. In this case, Existing will be an opaque type.
825 if (const OpaqueType *OpTy = dyn_cast<OpaqueType>(Existing)) {
826 // We ARE replacing an opaque type!
827 const_cast<OpaqueType*>(OpTy)->refineAbstractTypeTo(T);
828 return true;
829 }
830
831 // Otherwise, this is an attempt to redefine a type. That's okay if
832 // the redefinition is identical to the original. This will be so if
833 // Existing and T point to the same Type object. In this one case we
834 // allow the equivalent redefinition.
835 if (Existing == T) return true; // Yes, it's equal.
836
837 // Any other kind of (non-equivalent) redefinition is an error.
838 GenerateError("Redefinition of type named '" + Name + "' of type '" +
839 T->getDescription() + "'");
840 }
841
842 return false;
843}
844
845//===----------------------------------------------------------------------===//
846// Code for handling upreferences in type names...
847//
848
849// TypeContains - Returns true if Ty directly contains E in it.
850//
851static bool TypeContains(const Type *Ty, const Type *E) {
852 return std::find(Ty->subtype_begin(), Ty->subtype_end(),
853 E) != Ty->subtype_end();
854}
855
856namespace {
857 struct UpRefRecord {
858 // NestingLevel - The number of nesting levels that need to be popped before
859 // this type is resolved.
860 unsigned NestingLevel;
861
862 // LastContainedTy - This is the type at the current binding level for the
863 // type. Every time we reduce the nesting level, this gets updated.
864 const Type *LastContainedTy;
865
866 // UpRefTy - This is the actual opaque type that the upreference is
867 // represented with.
868 OpaqueType *UpRefTy;
869
870 UpRefRecord(unsigned NL, OpaqueType *URTy)
871 : NestingLevel(NL), LastContainedTy(URTy), UpRefTy(URTy) {}
872 };
873}
874
875// UpRefs - A list of the outstanding upreferences that need to be resolved.
876static std::vector<UpRefRecord> UpRefs;
877
878/// HandleUpRefs - Every time we finish a new layer of types, this function is
879/// called. It loops through the UpRefs vector, which is a list of the
880/// currently active types. For each type, if the up reference is contained in
881/// the newly completed type, we decrement the level count. When the level
882/// count reaches zero, the upreferenced type is the type that is passed in:
883/// thus we can complete the cycle.
884///
885static PATypeHolder HandleUpRefs(const Type *ty) {
886 // If Ty isn't abstract, or if there are no up-references in it, then there is
887 // nothing to resolve here.
888 if (!ty->isAbstract() || UpRefs.empty()) return ty;
889
890 PATypeHolder Ty(ty);
891 UR_OUT("Type '" << Ty->getDescription() <<
892 "' newly formed. Resolving upreferences.\n" <<
893 UpRefs.size() << " upreferences active!\n");
894
895 // If we find any resolvable upreferences (i.e., those whose NestingLevel goes
896 // to zero), we resolve them all together before we resolve them to Ty. At
897 // the end of the loop, if there is anything to resolve to Ty, it will be in
898 // this variable.
899 OpaqueType *TypeToResolve = 0;
900
901 for (unsigned i = 0; i != UpRefs.size(); ++i) {
902 UR_OUT(" UR#" << i << " - TypeContains(" << Ty->getDescription() << ", "
903 << UpRefs[i].second->getDescription() << ") = "
904 << (TypeContains(Ty, UpRefs[i].second) ? "true" : "false") << "\n");
905 if (TypeContains(Ty, UpRefs[i].LastContainedTy)) {
906 // Decrement level of upreference
907 unsigned Level = --UpRefs[i].NestingLevel;
908 UpRefs[i].LastContainedTy = Ty;
909 UR_OUT(" Uplevel Ref Level = " << Level << "\n");
910 if (Level == 0) { // Upreference should be resolved!
911 if (!TypeToResolve) {
912 TypeToResolve = UpRefs[i].UpRefTy;
913 } else {
914 UR_OUT(" * Resolving upreference for "
915 << UpRefs[i].second->getDescription() << "\n";
916 std::string OldName = UpRefs[i].UpRefTy->getDescription());
917 UpRefs[i].UpRefTy->refineAbstractTypeTo(TypeToResolve);
918 UR_OUT(" * Type '" << OldName << "' refined upreference to: "
919 << (const void*)Ty << ", " << Ty->getDescription() << "\n");
920 }
921 UpRefs.erase(UpRefs.begin()+i); // Remove from upreference list...
922 --i; // Do not skip the next element...
923 }
924 }
925 }
926
927 if (TypeToResolve) {
928 UR_OUT(" * Resolving upreference for "
929 << UpRefs[i].second->getDescription() << "\n";
930 std::string OldName = TypeToResolve->getDescription());
931 TypeToResolve->refineAbstractTypeTo(Ty);
932 }
933
934 return Ty;
935}
936
937//===----------------------------------------------------------------------===//
938// RunVMAsmParser - Define an interface to this parser
939//===----------------------------------------------------------------------===//
940//
941static Module* RunParser(Module * M);
942
Duncan Sandsf5588dc2007-11-27 13:23:08 +0000943Module *llvm::RunVMAsmParser(llvm::MemoryBuffer *MB) {
944 InitLLLexer(MB);
945 Module *M = RunParser(new Module(LLLgetFilename()));
946 FreeLexer();
947 return M;
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000948}
949
950%}
951
952%union {
953 llvm::Module *ModuleVal;
954 llvm::Function *FunctionVal;
955 llvm::BasicBlock *BasicBlockVal;
956 llvm::TerminatorInst *TermInstVal;
957 llvm::Instruction *InstVal;
958 llvm::Constant *ConstVal;
959
960 const llvm::Type *PrimType;
961 std::list<llvm::PATypeHolder> *TypeList;
962 llvm::PATypeHolder *TypeVal;
963 llvm::Value *ValueVal;
964 std::vector<llvm::Value*> *ValueList;
965 llvm::ArgListType *ArgList;
966 llvm::TypeWithAttrs TypeWithAttrs;
967 llvm::TypeWithAttrsList *TypeWithAttrsList;
Dale Johannesencfb19e62007-11-05 21:20:28 +0000968 llvm::ParamList *ParamList;
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000969
970 // Represent the RHS of PHI node
971 std::list<std::pair<llvm::Value*,
972 llvm::BasicBlock*> > *PHIList;
973 std::vector<std::pair<llvm::Constant*, llvm::BasicBlock*> > *JumpTable;
974 std::vector<llvm::Constant*> *ConstVector;
975
976 llvm::GlobalValue::LinkageTypes Linkage;
977 llvm::GlobalValue::VisibilityTypes Visibility;
Dale Johannesend915ee52008-02-19 21:40:51 +0000978 llvm::ParameterAttributes ParamAttrs;
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000979 llvm::APInt *APIntVal;
980 int64_t SInt64Val;
981 uint64_t UInt64Val;
982 int SIntVal;
983 unsigned UIntVal;
Dale Johannesenb9de9f02007-09-06 18:13:44 +0000984 llvm::APFloat *FPVal;
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000985 bool BoolVal;
986
987 std::string *StrVal; // This memory must be deleted
988 llvm::ValID ValIDVal;
989
990 llvm::Instruction::BinaryOps BinaryOpVal;
991 llvm::Instruction::TermOps TermOpVal;
992 llvm::Instruction::MemoryOps MemOpVal;
993 llvm::Instruction::CastOps CastOpVal;
994 llvm::Instruction::OtherOps OtherOpVal;
995 llvm::ICmpInst::Predicate IPredicate;
996 llvm::FCmpInst::Predicate FPredicate;
997}
998
999%type <ModuleVal> Module
1000%type <FunctionVal> Function FunctionProto FunctionHeader BasicBlockList
1001%type <BasicBlockVal> BasicBlock InstructionList
1002%type <TermInstVal> BBTerminatorInst
1003%type <InstVal> Inst InstVal MemoryInst
1004%type <ConstVal> ConstVal ConstExpr AliaseeRef
1005%type <ConstVector> ConstVector
1006%type <ArgList> ArgList ArgListH
1007%type <PHIList> PHIList
Dale Johannesencfb19e62007-11-05 21:20:28 +00001008%type <ParamList> ParamList // For call param lists & GEP indices
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001009%type <ValueList> IndexList // For GEP indices
1010%type <TypeList> TypeListI
1011%type <TypeWithAttrsList> ArgTypeList ArgTypeListI
1012%type <TypeWithAttrs> ArgType
1013%type <JumpTable> JumpTable
1014%type <BoolVal> GlobalType // GLOBAL or CONSTANT?
1015%type <BoolVal> ThreadLocal // 'thread_local' or not
1016%type <BoolVal> OptVolatile // 'volatile' or not
1017%type <BoolVal> OptTailCall // TAIL CALL or plain CALL.
1018%type <BoolVal> OptSideEffect // 'sideeffect' or not.
1019%type <Linkage> GVInternalLinkage GVExternalLinkage
1020%type <Linkage> FunctionDefineLinkage FunctionDeclareLinkage
1021%type <Linkage> AliasLinkage
1022%type <Visibility> GVVisibilityStyle
1023
1024// ValueRef - Unresolved reference to a definition or BB
1025%type <ValIDVal> ValueRef ConstValueRef SymbolicValueRef
1026%type <ValueVal> ResolvedVal // <type> <valref> pair
Devang Patelbf507402008-02-20 22:40:23 +00001027%type <ValueList> ReturnedVal
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001028// Tokens and types for handling constant integer values
1029//
1030// ESINT64VAL - A negative number within long long range
1031%token <SInt64Val> ESINT64VAL
1032
1033// EUINT64VAL - A positive number within uns. long long range
1034%token <UInt64Val> EUINT64VAL
1035
1036// ESAPINTVAL - A negative number with arbitrary precision
1037%token <APIntVal> ESAPINTVAL
1038
1039// EUAPINTVAL - A positive number with arbitrary precision
1040%token <APIntVal> EUAPINTVAL
1041
1042%token <UIntVal> LOCALVAL_ID GLOBALVAL_ID // %123 @123
1043%token <FPVal> FPVAL // Float or Double constant
1044
1045// Built in types...
1046%type <TypeVal> Types ResultTypes
1047%type <PrimType> IntType FPType PrimType // Classifications
1048%token <PrimType> VOID INTTYPE
Dale Johannesenf325d9f2007-08-03 01:03:46 +00001049%token <PrimType> FLOAT DOUBLE X86_FP80 FP128 PPC_FP128 LABEL
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001050%token TYPE
1051
1052
1053%token<StrVal> LOCALVAR GLOBALVAR LABELSTR
1054%token<StrVal> STRINGCONSTANT ATSTRINGCONSTANT PCTSTRINGCONSTANT
1055%type <StrVal> LocalName OptLocalName OptLocalAssign
1056%type <StrVal> GlobalName OptGlobalAssign GlobalAssign
Gordon Henriksen13fe5e32007-12-10 03:18:06 +00001057%type <StrVal> OptSection SectionString OptGC
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001058
Christopher Lamb668d9a02007-12-12 08:45:45 +00001059%type <UIntVal> OptAlign OptCAlign OptAddrSpace
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001060
1061%token ZEROINITIALIZER TRUETOK FALSETOK BEGINTOK ENDTOK
1062%token DECLARE DEFINE GLOBAL CONSTANT SECTION ALIAS VOLATILE THREAD_LOCAL
1063%token TO DOTDOTDOT NULL_TOK UNDEF INTERNAL LINKONCE WEAK APPENDING
1064%token DLLIMPORT DLLEXPORT EXTERN_WEAK
Christopher Lamb0a243582007-12-11 09:02:08 +00001065%token OPAQUE EXTERNAL TARGET TRIPLE ALIGN ADDRSPACE
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001066%token DEPLIBS CALL TAIL ASM_TOK MODULE SIDEEFFECT
1067%token CC_TOK CCC_TOK FASTCC_TOK COLDCC_TOK X86_STDCALLCC_TOK X86_FASTCALLCC_TOK
1068%token DATALAYOUT
1069%type <UIntVal> OptCallingConv
1070%type <ParamAttrs> OptParamAttrs ParamAttr
1071%type <ParamAttrs> OptFuncAttrs FuncAttr
1072
1073// Basic Block Terminating Operators
1074%token <TermOpVal> RET BR SWITCH INVOKE UNWIND UNREACHABLE
1075
1076// Binary Operators
1077%type <BinaryOpVal> ArithmeticOps LogicalOps // Binops Subcatagories
1078%token <BinaryOpVal> ADD SUB MUL UDIV SDIV FDIV UREM SREM FREM AND OR XOR
1079%token <BinaryOpVal> SHL LSHR ASHR
1080
1081%token <OtherOpVal> ICMP FCMP
1082%type <IPredicate> IPredicates
1083%type <FPredicate> FPredicates
1084%token EQ NE SLT SGT SLE SGE ULT UGT ULE UGE
1085%token OEQ ONE OLT OGT OLE OGE ORD UNO UEQ UNE
1086
1087// Memory Instructions
1088%token <MemOpVal> MALLOC ALLOCA FREE LOAD STORE GETELEMENTPTR
1089
1090// Cast Operators
1091%type <CastOpVal> CastOps
1092%token <CastOpVal> TRUNC ZEXT SEXT FPTRUNC FPEXT BITCAST
1093%token <CastOpVal> UITOFP SITOFP FPTOUI FPTOSI INTTOPTR PTRTOINT
1094
1095// Other Operators
1096%token <OtherOpVal> PHI_TOK SELECT VAARG
1097%token <OtherOpVal> EXTRACTELEMENT INSERTELEMENT SHUFFLEVECTOR
Devang Patel3b8849c2008-02-19 22:27:01 +00001098%token <OtherOpVal> GETRESULT
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001099
1100// Function Attributes
Reid Spenceraa8ae282007-07-31 03:50:36 +00001101%token SIGNEXT ZEROEXT NORETURN INREG SRET NOUNWIND NOALIAS BYVAL NEST
Gordon Henriksen13fe5e32007-12-10 03:18:06 +00001102%token READNONE READONLY GC
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001103
1104// Visibility Styles
1105%token DEFAULT HIDDEN PROTECTED
1106
1107%start Module
1108%%
1109
1110
1111// Operations that are notably excluded from this list include:
1112// RET, BR, & SWITCH because they end basic blocks and are treated specially.
1113//
1114ArithmeticOps: ADD | SUB | MUL | UDIV | SDIV | FDIV | UREM | SREM | FREM;
1115LogicalOps : SHL | LSHR | ASHR | AND | OR | XOR;
1116CastOps : TRUNC | ZEXT | SEXT | FPTRUNC | FPEXT | BITCAST |
1117 UITOFP | SITOFP | FPTOUI | FPTOSI | INTTOPTR | PTRTOINT;
1118
1119IPredicates
1120 : EQ { $$ = ICmpInst::ICMP_EQ; } | NE { $$ = ICmpInst::ICMP_NE; }
1121 | SLT { $$ = ICmpInst::ICMP_SLT; } | SGT { $$ = ICmpInst::ICMP_SGT; }
1122 | SLE { $$ = ICmpInst::ICMP_SLE; } | SGE { $$ = ICmpInst::ICMP_SGE; }
1123 | ULT { $$ = ICmpInst::ICMP_ULT; } | UGT { $$ = ICmpInst::ICMP_UGT; }
1124 | ULE { $$ = ICmpInst::ICMP_ULE; } | UGE { $$ = ICmpInst::ICMP_UGE; }
1125 ;
1126
1127FPredicates
1128 : OEQ { $$ = FCmpInst::FCMP_OEQ; } | ONE { $$ = FCmpInst::FCMP_ONE; }
1129 | OLT { $$ = FCmpInst::FCMP_OLT; } | OGT { $$ = FCmpInst::FCMP_OGT; }
1130 | OLE { $$ = FCmpInst::FCMP_OLE; } | OGE { $$ = FCmpInst::FCMP_OGE; }
1131 | ORD { $$ = FCmpInst::FCMP_ORD; } | UNO { $$ = FCmpInst::FCMP_UNO; }
1132 | UEQ { $$ = FCmpInst::FCMP_UEQ; } | UNE { $$ = FCmpInst::FCMP_UNE; }
1133 | ULT { $$ = FCmpInst::FCMP_ULT; } | UGT { $$ = FCmpInst::FCMP_UGT; }
1134 | ULE { $$ = FCmpInst::FCMP_ULE; } | UGE { $$ = FCmpInst::FCMP_UGE; }
1135 | TRUETOK { $$ = FCmpInst::FCMP_TRUE; }
1136 | FALSETOK { $$ = FCmpInst::FCMP_FALSE; }
1137 ;
1138
1139// These are some types that allow classification if we only want a particular
1140// thing... for example, only a signed, unsigned, or integral type.
1141IntType : INTTYPE;
Dale Johannesenf325d9f2007-08-03 01:03:46 +00001142FPType : FLOAT | DOUBLE | PPC_FP128 | FP128 | X86_FP80;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001143
1144LocalName : LOCALVAR | STRINGCONSTANT | PCTSTRINGCONSTANT ;
1145OptLocalName : LocalName | /*empty*/ { $$ = 0; };
1146
Christopher Lamb668d9a02007-12-12 08:45:45 +00001147OptAddrSpace : ADDRSPACE '(' EUINT64VAL ')' { $$=$3; }
1148 | /*empty*/ { $$=0; };
1149
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001150/// OptLocalAssign - Value producing statements have an optional assignment
1151/// component.
1152OptLocalAssign : LocalName '=' {
1153 $$ = $1;
1154 CHECK_FOR_ERROR
1155 }
1156 | /*empty*/ {
1157 $$ = 0;
1158 CHECK_FOR_ERROR
1159 };
1160
1161GlobalName : GLOBALVAR | ATSTRINGCONSTANT ;
1162
1163OptGlobalAssign : GlobalAssign
1164 | /*empty*/ {
1165 $$ = 0;
1166 CHECK_FOR_ERROR
1167 };
1168
1169GlobalAssign : GlobalName '=' {
1170 $$ = $1;
1171 CHECK_FOR_ERROR
1172 };
1173
1174GVInternalLinkage
1175 : INTERNAL { $$ = GlobalValue::InternalLinkage; }
1176 | WEAK { $$ = GlobalValue::WeakLinkage; }
1177 | LINKONCE { $$ = GlobalValue::LinkOnceLinkage; }
1178 | APPENDING { $$ = GlobalValue::AppendingLinkage; }
1179 | DLLEXPORT { $$ = GlobalValue::DLLExportLinkage; }
1180 ;
1181
1182GVExternalLinkage
1183 : DLLIMPORT { $$ = GlobalValue::DLLImportLinkage; }
1184 | EXTERN_WEAK { $$ = GlobalValue::ExternalWeakLinkage; }
1185 | EXTERNAL { $$ = GlobalValue::ExternalLinkage; }
1186 ;
1187
1188GVVisibilityStyle
1189 : /*empty*/ { $$ = GlobalValue::DefaultVisibility; }
1190 | DEFAULT { $$ = GlobalValue::DefaultVisibility; }
1191 | HIDDEN { $$ = GlobalValue::HiddenVisibility; }
1192 | PROTECTED { $$ = GlobalValue::ProtectedVisibility; }
1193 ;
1194
1195FunctionDeclareLinkage
1196 : /*empty*/ { $$ = GlobalValue::ExternalLinkage; }
1197 | DLLIMPORT { $$ = GlobalValue::DLLImportLinkage; }
1198 | EXTERN_WEAK { $$ = GlobalValue::ExternalWeakLinkage; }
1199 ;
1200
1201FunctionDefineLinkage
1202 : /*empty*/ { $$ = GlobalValue::ExternalLinkage; }
1203 | INTERNAL { $$ = GlobalValue::InternalLinkage; }
1204 | LINKONCE { $$ = GlobalValue::LinkOnceLinkage; }
1205 | WEAK { $$ = GlobalValue::WeakLinkage; }
1206 | DLLEXPORT { $$ = GlobalValue::DLLExportLinkage; }
1207 ;
1208
1209AliasLinkage
1210 : /*empty*/ { $$ = GlobalValue::ExternalLinkage; }
1211 | WEAK { $$ = GlobalValue::WeakLinkage; }
1212 | INTERNAL { $$ = GlobalValue::InternalLinkage; }
1213 ;
1214
1215OptCallingConv : /*empty*/ { $$ = CallingConv::C; } |
1216 CCC_TOK { $$ = CallingConv::C; } |
1217 FASTCC_TOK { $$ = CallingConv::Fast; } |
1218 COLDCC_TOK { $$ = CallingConv::Cold; } |
1219 X86_STDCALLCC_TOK { $$ = CallingConv::X86_StdCall; } |
1220 X86_FASTCALLCC_TOK { $$ = CallingConv::X86_FastCall; } |
1221 CC_TOK EUINT64VAL {
1222 if ((unsigned)$2 != $2)
1223 GEN_ERROR("Calling conv too large");
1224 $$ = $2;
1225 CHECK_FOR_ERROR
1226 };
1227
Reid Spenceraa8ae282007-07-31 03:50:36 +00001228ParamAttr : ZEROEXT { $$ = ParamAttr::ZExt; }
1229 | ZEXT { $$ = ParamAttr::ZExt; }
1230 | SIGNEXT { $$ = ParamAttr::SExt; }
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001231 | SEXT { $$ = ParamAttr::SExt; }
1232 | INREG { $$ = ParamAttr::InReg; }
1233 | SRET { $$ = ParamAttr::StructRet; }
1234 | NOALIAS { $$ = ParamAttr::NoAlias; }
Reid Spenceraa8ae282007-07-31 03:50:36 +00001235 | BYVAL { $$ = ParamAttr::ByVal; }
1236 | NEST { $$ = ParamAttr::Nest; }
Dale Johannesena79ecf32008-02-20 21:15:43 +00001237 | ALIGN EUINT64VAL { $$ = $2 << 16; }
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001238 ;
1239
1240OptParamAttrs : /* empty */ { $$ = ParamAttr::None; }
1241 | OptParamAttrs ParamAttr {
1242 $$ = $1 | $2;
1243 }
1244 ;
1245
1246FuncAttr : NORETURN { $$ = ParamAttr::NoReturn; }
1247 | NOUNWIND { $$ = ParamAttr::NoUnwind; }
Reid Spenceraa8ae282007-07-31 03:50:36 +00001248 | ZEROEXT { $$ = ParamAttr::ZExt; }
1249 | SIGNEXT { $$ = ParamAttr::SExt; }
Duncan Sandsf5588dc2007-11-27 13:23:08 +00001250 | READNONE { $$ = ParamAttr::ReadNone; }
1251 | READONLY { $$ = ParamAttr::ReadOnly; }
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001252 ;
1253
1254OptFuncAttrs : /* empty */ { $$ = ParamAttr::None; }
1255 | OptFuncAttrs FuncAttr {
1256 $$ = $1 | $2;
1257 }
1258 ;
1259
Gordon Henriksen13fe5e32007-12-10 03:18:06 +00001260OptGC : /* empty */ { $$ = 0; }
1261 | GC STRINGCONSTANT {
1262 $$ = $2;
1263 }
1264 ;
1265
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001266// OptAlign/OptCAlign - An optional alignment, and an optional alignment with
1267// a comma before it.
1268OptAlign : /*empty*/ { $$ = 0; } |
1269 ALIGN EUINT64VAL {
1270 $$ = $2;
1271 if ($$ != 0 && !isPowerOf2_32($$))
1272 GEN_ERROR("Alignment must be a power of two");
1273 CHECK_FOR_ERROR
1274};
1275OptCAlign : /*empty*/ { $$ = 0; } |
1276 ',' ALIGN EUINT64VAL {
1277 $$ = $3;
1278 if ($$ != 0 && !isPowerOf2_32($$))
1279 GEN_ERROR("Alignment must be a power of two");
1280 CHECK_FOR_ERROR
1281};
1282
1283
Christopher Lamb0a243582007-12-11 09:02:08 +00001284
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001285SectionString : SECTION STRINGCONSTANT {
1286 for (unsigned i = 0, e = $2->length(); i != e; ++i)
1287 if ((*$2)[i] == '"' || (*$2)[i] == '\\')
1288 GEN_ERROR("Invalid character in section name");
1289 $$ = $2;
1290 CHECK_FOR_ERROR
1291};
1292
1293OptSection : /*empty*/ { $$ = 0; } |
1294 SectionString { $$ = $1; };
1295
1296// GlobalVarAttributes - Used to pass the attributes string on a global. CurGV
1297// is set to be the global we are processing.
1298//
1299GlobalVarAttributes : /* empty */ {} |
1300 ',' GlobalVarAttribute GlobalVarAttributes {};
1301GlobalVarAttribute : SectionString {
1302 CurGV->setSection(*$1);
1303 delete $1;
1304 CHECK_FOR_ERROR
1305 }
1306 | ALIGN EUINT64VAL {
1307 if ($2 != 0 && !isPowerOf2_32($2))
1308 GEN_ERROR("Alignment must be a power of two");
1309 CurGV->setAlignment($2);
1310 CHECK_FOR_ERROR
1311 };
1312
1313//===----------------------------------------------------------------------===//
1314// Types includes all predefined types... except void, because it can only be
1315// used in specific contexts (function returning void for example).
1316
1317// Derived types are added later...
1318//
Dale Johannesenf325d9f2007-08-03 01:03:46 +00001319PrimType : INTTYPE | FLOAT | DOUBLE | PPC_FP128 | FP128 | X86_FP80 | LABEL ;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001320
1321Types
1322 : OPAQUE {
1323 $$ = new PATypeHolder(OpaqueType::get());
1324 CHECK_FOR_ERROR
1325 }
1326 | PrimType {
1327 $$ = new PATypeHolder($1);
1328 CHECK_FOR_ERROR
1329 }
Christopher Lamb668d9a02007-12-12 08:45:45 +00001330 | Types OptAddrSpace '*' { // Pointer type?
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001331 if (*$1 == Type::LabelTy)
1332 GEN_ERROR("Cannot form a pointer to a basic block");
Christopher Lamb668d9a02007-12-12 08:45:45 +00001333 $$ = new PATypeHolder(HandleUpRefs(PointerType::get(*$1, $2)));
Christopher Lamb0a243582007-12-11 09:02:08 +00001334 delete $1;
1335 CHECK_FOR_ERROR
1336 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001337 | SymbolicValueRef { // Named types are also simple types...
1338 const Type* tmp = getTypeVal($1);
1339 CHECK_FOR_ERROR
1340 $$ = new PATypeHolder(tmp);
1341 }
1342 | '\\' EUINT64VAL { // Type UpReference
1343 if ($2 > (uint64_t)~0U) GEN_ERROR("Value out of range");
1344 OpaqueType *OT = OpaqueType::get(); // Use temporary placeholder
1345 UpRefs.push_back(UpRefRecord((unsigned)$2, OT)); // Add to vector...
1346 $$ = new PATypeHolder(OT);
1347 UR_OUT("New Upreference!\n");
1348 CHECK_FOR_ERROR
1349 }
1350 | Types '(' ArgTypeListI ')' OptFuncAttrs {
Duncan Sandsf5588dc2007-11-27 13:23:08 +00001351 // Allow but ignore attributes on function types; this permits auto-upgrade.
1352 // FIXME: remove in LLVM 3.0.
Anton Korobeynikova2c02272007-12-03 19:16:54 +00001353 const Type* RetTy = *$1;
Anton Korobeynikove286f6d2007-12-03 21:01:29 +00001354 if (!(RetTy->isFirstClassType() || RetTy == Type::VoidTy ||
1355 isa<OpaqueType>(RetTy)))
Anton Korobeynikova2c02272007-12-03 19:16:54 +00001356 GEN_ERROR("LLVM Functions cannot return aggregates");
1357
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001358 std::vector<const Type*> Params;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001359 TypeWithAttrsList::iterator I = $3->begin(), E = $3->end();
Duncan Sandsf5588dc2007-11-27 13:23:08 +00001360 for (; I != E; ++I ) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001361 const Type *Ty = I->Ty->get();
1362 Params.push_back(Ty);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001363 }
Anton Korobeynikova2c02272007-12-03 19:16:54 +00001364
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001365 bool isVarArg = Params.size() && Params.back() == Type::VoidTy;
1366 if (isVarArg) Params.pop_back();
1367
Anton Korobeynikove286f6d2007-12-03 21:01:29 +00001368 for (unsigned i = 0; i != Params.size(); ++i)
1369 if (!(Params[i]->isFirstClassType() || isa<OpaqueType>(Params[i])))
1370 GEN_ERROR("Function arguments must be value types!");
1371
1372 CHECK_FOR_ERROR
1373
Anton Korobeynikova2c02272007-12-03 19:16:54 +00001374 FunctionType *FT = FunctionType::get(RetTy, Params, isVarArg);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001375 delete $3; // Delete the argument list
1376 delete $1; // Delete the return type handle
1377 $$ = new PATypeHolder(HandleUpRefs(FT));
1378 CHECK_FOR_ERROR
1379 }
1380 | VOID '(' ArgTypeListI ')' OptFuncAttrs {
Duncan Sandsf5588dc2007-11-27 13:23:08 +00001381 // Allow but ignore attributes on function types; this permits auto-upgrade.
1382 // FIXME: remove in LLVM 3.0.
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001383 std::vector<const Type*> Params;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001384 TypeWithAttrsList::iterator I = $3->begin(), E = $3->end();
Duncan Sandsf5588dc2007-11-27 13:23:08 +00001385 for ( ; I != E; ++I ) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001386 const Type* Ty = I->Ty->get();
1387 Params.push_back(Ty);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001388 }
Anton Korobeynikova2c02272007-12-03 19:16:54 +00001389
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001390 bool isVarArg = Params.size() && Params.back() == Type::VoidTy;
1391 if (isVarArg) Params.pop_back();
1392
Anton Korobeynikove286f6d2007-12-03 21:01:29 +00001393 for (unsigned i = 0; i != Params.size(); ++i)
1394 if (!(Params[i]->isFirstClassType() || isa<OpaqueType>(Params[i])))
1395 GEN_ERROR("Function arguments must be value types!");
1396
1397 CHECK_FOR_ERROR
1398
Duncan Sandsf5588dc2007-11-27 13:23:08 +00001399 FunctionType *FT = FunctionType::get($1, Params, isVarArg);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001400 delete $3; // Delete the argument list
1401 $$ = new PATypeHolder(HandleUpRefs(FT));
1402 CHECK_FOR_ERROR
1403 }
1404
1405 | '[' EUINT64VAL 'x' Types ']' { // Sized array type?
1406 $$ = new PATypeHolder(HandleUpRefs(ArrayType::get(*$4, (unsigned)$2)));
1407 delete $4;
1408 CHECK_FOR_ERROR
1409 }
1410 | '<' EUINT64VAL 'x' Types '>' { // Vector type?
1411 const llvm::Type* ElemTy = $4->get();
1412 if ((unsigned)$2 != $2)
1413 GEN_ERROR("Unsigned result not equal to signed result");
1414 if (!ElemTy->isFloatingPoint() && !ElemTy->isInteger())
1415 GEN_ERROR("Element type of a VectorType must be primitive");
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001416 $$ = new PATypeHolder(HandleUpRefs(VectorType::get(*$4, (unsigned)$2)));
1417 delete $4;
1418 CHECK_FOR_ERROR
1419 }
1420 | '{' TypeListI '}' { // Structure type?
1421 std::vector<const Type*> Elements;
1422 for (std::list<llvm::PATypeHolder>::iterator I = $2->begin(),
1423 E = $2->end(); I != E; ++I)
1424 Elements.push_back(*I);
1425
1426 $$ = new PATypeHolder(HandleUpRefs(StructType::get(Elements)));
1427 delete $2;
1428 CHECK_FOR_ERROR
1429 }
1430 | '{' '}' { // Empty structure type?
1431 $$ = new PATypeHolder(StructType::get(std::vector<const Type*>()));
1432 CHECK_FOR_ERROR
1433 }
1434 | '<' '{' TypeListI '}' '>' {
1435 std::vector<const Type*> Elements;
1436 for (std::list<llvm::PATypeHolder>::iterator I = $3->begin(),
1437 E = $3->end(); I != E; ++I)
1438 Elements.push_back(*I);
1439
1440 $$ = new PATypeHolder(HandleUpRefs(StructType::get(Elements, true)));
1441 delete $3;
1442 CHECK_FOR_ERROR
1443 }
1444 | '<' '{' '}' '>' { // Empty structure type?
1445 $$ = new PATypeHolder(StructType::get(std::vector<const Type*>(), true));
1446 CHECK_FOR_ERROR
1447 }
1448 ;
1449
1450ArgType
Duncan Sandsf5588dc2007-11-27 13:23:08 +00001451 : Types OptParamAttrs {
1452 // Allow but ignore attributes on function types; this permits auto-upgrade.
1453 // FIXME: remove in LLVM 3.0.
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001454 $$.Ty = $1;
Duncan Sandsf5588dc2007-11-27 13:23:08 +00001455 $$.Attrs = ParamAttr::None;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001456 }
1457 ;
1458
1459ResultTypes
1460 : Types {
1461 if (!UpRefs.empty())
1462 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
Devang Patelbf507402008-02-20 22:40:23 +00001463 if (!(*$1)->isFirstClassType() && (*$1)->getTypeID() != Type::StructTyID)
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001464 GEN_ERROR("LLVM functions cannot return aggregate types");
1465 $$ = $1;
1466 }
1467 | VOID {
1468 $$ = new PATypeHolder(Type::VoidTy);
1469 }
1470 ;
1471
1472ArgTypeList : ArgType {
1473 $$ = new TypeWithAttrsList();
1474 $$->push_back($1);
1475 CHECK_FOR_ERROR
1476 }
1477 | ArgTypeList ',' ArgType {
1478 ($$=$1)->push_back($3);
1479 CHECK_FOR_ERROR
1480 }
1481 ;
1482
1483ArgTypeListI
1484 : ArgTypeList
1485 | ArgTypeList ',' DOTDOTDOT {
1486 $$=$1;
1487 TypeWithAttrs TWA; TWA.Attrs = ParamAttr::None;
1488 TWA.Ty = new PATypeHolder(Type::VoidTy);
1489 $$->push_back(TWA);
1490 CHECK_FOR_ERROR
1491 }
1492 | DOTDOTDOT {
1493 $$ = new TypeWithAttrsList;
1494 TypeWithAttrs TWA; TWA.Attrs = ParamAttr::None;
1495 TWA.Ty = new PATypeHolder(Type::VoidTy);
1496 $$->push_back(TWA);
1497 CHECK_FOR_ERROR
1498 }
1499 | /*empty*/ {
1500 $$ = new TypeWithAttrsList();
1501 CHECK_FOR_ERROR
1502 };
1503
1504// TypeList - Used for struct declarations and as a basis for function type
1505// declaration type lists
1506//
1507TypeListI : Types {
1508 $$ = new std::list<PATypeHolder>();
1509 $$->push_back(*$1);
1510 delete $1;
1511 CHECK_FOR_ERROR
1512 }
1513 | TypeListI ',' Types {
1514 ($$=$1)->push_back(*$3);
1515 delete $3;
1516 CHECK_FOR_ERROR
1517 };
1518
1519// ConstVal - The various declarations that go into the constant pool. This
1520// production is used ONLY to represent constants that show up AFTER a 'const',
1521// 'constant' or 'global' token at global scope. Constants that can be inlined
1522// into other expressions (such as integers and constexprs) are handled by the
1523// ResolvedVal, ValueRef and ConstValueRef productions.
1524//
1525ConstVal: Types '[' ConstVector ']' { // Nonempty unsized arr
1526 if (!UpRefs.empty())
1527 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1528 const ArrayType *ATy = dyn_cast<ArrayType>($1->get());
1529 if (ATy == 0)
1530 GEN_ERROR("Cannot make array constant with type: '" +
1531 (*$1)->getDescription() + "'");
1532 const Type *ETy = ATy->getElementType();
1533 int NumElements = ATy->getNumElements();
1534
1535 // Verify that we have the correct size...
1536 if (NumElements != -1 && NumElements != (int)$3->size())
1537 GEN_ERROR("Type mismatch: constant sized array initialized with " +
1538 utostr($3->size()) + " arguments, but has size of " +
1539 itostr(NumElements) + "");
1540
1541 // Verify all elements are correct type!
1542 for (unsigned i = 0; i < $3->size(); i++) {
1543 if (ETy != (*$3)[i]->getType())
1544 GEN_ERROR("Element #" + utostr(i) + " is not of type '" +
1545 ETy->getDescription() +"' as required!\nIt is of type '"+
1546 (*$3)[i]->getType()->getDescription() + "'.");
1547 }
1548
1549 $$ = ConstantArray::get(ATy, *$3);
1550 delete $1; delete $3;
1551 CHECK_FOR_ERROR
1552 }
1553 | Types '[' ']' {
1554 if (!UpRefs.empty())
1555 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1556 const ArrayType *ATy = dyn_cast<ArrayType>($1->get());
1557 if (ATy == 0)
1558 GEN_ERROR("Cannot make array constant with type: '" +
1559 (*$1)->getDescription() + "'");
1560
1561 int NumElements = ATy->getNumElements();
1562 if (NumElements != -1 && NumElements != 0)
1563 GEN_ERROR("Type mismatch: constant sized array initialized with 0"
1564 " arguments, but has size of " + itostr(NumElements) +"");
1565 $$ = ConstantArray::get(ATy, std::vector<Constant*>());
1566 delete $1;
1567 CHECK_FOR_ERROR
1568 }
1569 | Types 'c' STRINGCONSTANT {
1570 if (!UpRefs.empty())
1571 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1572 const ArrayType *ATy = dyn_cast<ArrayType>($1->get());
1573 if (ATy == 0)
1574 GEN_ERROR("Cannot make array constant with type: '" +
1575 (*$1)->getDescription() + "'");
1576
1577 int NumElements = ATy->getNumElements();
1578 const Type *ETy = ATy->getElementType();
1579 if (NumElements != -1 && NumElements != int($3->length()))
1580 GEN_ERROR("Can't build string constant of size " +
1581 itostr((int)($3->length())) +
1582 " when array has size " + itostr(NumElements) + "");
1583 std::vector<Constant*> Vals;
1584 if (ETy == Type::Int8Ty) {
1585 for (unsigned i = 0; i < $3->length(); ++i)
1586 Vals.push_back(ConstantInt::get(ETy, (*$3)[i]));
1587 } else {
1588 delete $3;
1589 GEN_ERROR("Cannot build string arrays of non byte sized elements");
1590 }
1591 delete $3;
1592 $$ = ConstantArray::get(ATy, Vals);
1593 delete $1;
1594 CHECK_FOR_ERROR
1595 }
1596 | Types '<' ConstVector '>' { // Nonempty unsized arr
1597 if (!UpRefs.empty())
1598 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1599 const VectorType *PTy = dyn_cast<VectorType>($1->get());
1600 if (PTy == 0)
1601 GEN_ERROR("Cannot make packed constant with type: '" +
1602 (*$1)->getDescription() + "'");
1603 const Type *ETy = PTy->getElementType();
1604 int NumElements = PTy->getNumElements();
1605
1606 // Verify that we have the correct size...
1607 if (NumElements != -1 && NumElements != (int)$3->size())
1608 GEN_ERROR("Type mismatch: constant sized packed initialized with " +
1609 utostr($3->size()) + " arguments, but has size of " +
1610 itostr(NumElements) + "");
1611
1612 // Verify all elements are correct type!
1613 for (unsigned i = 0; i < $3->size(); i++) {
1614 if (ETy != (*$3)[i]->getType())
1615 GEN_ERROR("Element #" + utostr(i) + " is not of type '" +
1616 ETy->getDescription() +"' as required!\nIt is of type '"+
1617 (*$3)[i]->getType()->getDescription() + "'.");
1618 }
1619
1620 $$ = ConstantVector::get(PTy, *$3);
1621 delete $1; delete $3;
1622 CHECK_FOR_ERROR
1623 }
1624 | Types '{' ConstVector '}' {
1625 const StructType *STy = dyn_cast<StructType>($1->get());
1626 if (STy == 0)
1627 GEN_ERROR("Cannot make struct constant with type: '" +
1628 (*$1)->getDescription() + "'");
1629
1630 if ($3->size() != STy->getNumContainedTypes())
1631 GEN_ERROR("Illegal number of initializers for structure type");
1632
1633 // Check to ensure that constants are compatible with the type initializer!
1634 for (unsigned i = 0, e = $3->size(); i != e; ++i)
1635 if ((*$3)[i]->getType() != STy->getElementType(i))
1636 GEN_ERROR("Expected type '" +
1637 STy->getElementType(i)->getDescription() +
1638 "' for element #" + utostr(i) +
1639 " of structure initializer");
1640
1641 // Check to ensure that Type is not packed
1642 if (STy->isPacked())
1643 GEN_ERROR("Unpacked Initializer to vector type '" +
1644 STy->getDescription() + "'");
1645
1646 $$ = ConstantStruct::get(STy, *$3);
1647 delete $1; delete $3;
1648 CHECK_FOR_ERROR
1649 }
1650 | Types '{' '}' {
1651 if (!UpRefs.empty())
1652 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1653 const StructType *STy = dyn_cast<StructType>($1->get());
1654 if (STy == 0)
1655 GEN_ERROR("Cannot make struct constant with type: '" +
1656 (*$1)->getDescription() + "'");
1657
1658 if (STy->getNumContainedTypes() != 0)
1659 GEN_ERROR("Illegal number of initializers for structure type");
1660
1661 // Check to ensure that Type is not packed
1662 if (STy->isPacked())
1663 GEN_ERROR("Unpacked Initializer to vector type '" +
1664 STy->getDescription() + "'");
1665
1666 $$ = ConstantStruct::get(STy, std::vector<Constant*>());
1667 delete $1;
1668 CHECK_FOR_ERROR
1669 }
1670 | Types '<' '{' ConstVector '}' '>' {
1671 const StructType *STy = dyn_cast<StructType>($1->get());
1672 if (STy == 0)
1673 GEN_ERROR("Cannot make struct constant with type: '" +
1674 (*$1)->getDescription() + "'");
1675
1676 if ($4->size() != STy->getNumContainedTypes())
1677 GEN_ERROR("Illegal number of initializers for structure type");
1678
1679 // Check to ensure that constants are compatible with the type initializer!
1680 for (unsigned i = 0, e = $4->size(); i != e; ++i)
1681 if ((*$4)[i]->getType() != STy->getElementType(i))
1682 GEN_ERROR("Expected type '" +
1683 STy->getElementType(i)->getDescription() +
1684 "' for element #" + utostr(i) +
1685 " of structure initializer");
1686
1687 // Check to ensure that Type is packed
1688 if (!STy->isPacked())
1689 GEN_ERROR("Vector initializer to non-vector type '" +
1690 STy->getDescription() + "'");
1691
1692 $$ = ConstantStruct::get(STy, *$4);
1693 delete $1; delete $4;
1694 CHECK_FOR_ERROR
1695 }
1696 | Types '<' '{' '}' '>' {
1697 if (!UpRefs.empty())
1698 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1699 const StructType *STy = dyn_cast<StructType>($1->get());
1700 if (STy == 0)
1701 GEN_ERROR("Cannot make struct constant with type: '" +
1702 (*$1)->getDescription() + "'");
1703
1704 if (STy->getNumContainedTypes() != 0)
1705 GEN_ERROR("Illegal number of initializers for structure type");
1706
1707 // Check to ensure that Type is packed
1708 if (!STy->isPacked())
1709 GEN_ERROR("Vector initializer to non-vector type '" +
1710 STy->getDescription() + "'");
1711
1712 $$ = ConstantStruct::get(STy, std::vector<Constant*>());
1713 delete $1;
1714 CHECK_FOR_ERROR
1715 }
1716 | Types NULL_TOK {
1717 if (!UpRefs.empty())
1718 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1719 const PointerType *PTy = dyn_cast<PointerType>($1->get());
1720 if (PTy == 0)
1721 GEN_ERROR("Cannot make null pointer constant with type: '" +
1722 (*$1)->getDescription() + "'");
1723
1724 $$ = ConstantPointerNull::get(PTy);
1725 delete $1;
1726 CHECK_FOR_ERROR
1727 }
1728 | Types UNDEF {
1729 if (!UpRefs.empty())
1730 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1731 $$ = UndefValue::get($1->get());
1732 delete $1;
1733 CHECK_FOR_ERROR
1734 }
1735 | Types SymbolicValueRef {
1736 if (!UpRefs.empty())
1737 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1738 const PointerType *Ty = dyn_cast<PointerType>($1->get());
1739 if (Ty == 0)
Devang Patel3b8849c2008-02-19 22:27:01 +00001740 GEN_ERROR("Global const reference must be a pointer type " + (*$1)->getDescription());
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001741
1742 // ConstExprs can exist in the body of a function, thus creating
1743 // GlobalValues whenever they refer to a variable. Because we are in
1744 // the context of a function, getExistingVal will search the functions
1745 // symbol table instead of the module symbol table for the global symbol,
1746 // which throws things all off. To get around this, we just tell
1747 // getExistingVal that we are at global scope here.
1748 //
1749 Function *SavedCurFn = CurFun.CurrentFunction;
1750 CurFun.CurrentFunction = 0;
1751
1752 Value *V = getExistingVal(Ty, $2);
1753 CHECK_FOR_ERROR
1754
1755 CurFun.CurrentFunction = SavedCurFn;
1756
1757 // If this is an initializer for a constant pointer, which is referencing a
1758 // (currently) undefined variable, create a stub now that shall be replaced
1759 // in the future with the right type of variable.
1760 //
1761 if (V == 0) {
1762 assert(isa<PointerType>(Ty) && "Globals may only be used as pointers!");
1763 const PointerType *PT = cast<PointerType>(Ty);
1764
1765 // First check to see if the forward references value is already created!
1766 PerModuleInfo::GlobalRefsType::iterator I =
1767 CurModule.GlobalRefs.find(std::make_pair(PT, $2));
1768
1769 if (I != CurModule.GlobalRefs.end()) {
1770 V = I->second; // Placeholder already exists, use it...
1771 $2.destroy();
1772 } else {
1773 std::string Name;
1774 if ($2.Type == ValID::GlobalName)
1775 Name = $2.getName();
1776 else if ($2.Type != ValID::GlobalID)
1777 GEN_ERROR("Invalid reference to global");
1778
1779 // Create the forward referenced global.
1780 GlobalValue *GV;
1781 if (const FunctionType *FTy =
1782 dyn_cast<FunctionType>(PT->getElementType())) {
1783 GV = new Function(FTy, GlobalValue::ExternalWeakLinkage, Name,
1784 CurModule.CurrentModule);
1785 } else {
1786 GV = new GlobalVariable(PT->getElementType(), false,
1787 GlobalValue::ExternalWeakLinkage, 0,
1788 Name, CurModule.CurrentModule);
1789 }
1790
1791 // Keep track of the fact that we have a forward ref to recycle it
1792 CurModule.GlobalRefs.insert(std::make_pair(std::make_pair(PT, $2), GV));
1793 V = GV;
1794 }
1795 }
1796
1797 $$ = cast<GlobalValue>(V);
1798 delete $1; // Free the type handle
1799 CHECK_FOR_ERROR
1800 }
1801 | Types ConstExpr {
1802 if (!UpRefs.empty())
1803 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1804 if ($1->get() != $2->getType())
1805 GEN_ERROR("Mismatched types for constant expression: " +
1806 (*$1)->getDescription() + " and " + $2->getType()->getDescription());
1807 $$ = $2;
1808 delete $1;
1809 CHECK_FOR_ERROR
1810 }
1811 | Types ZEROINITIALIZER {
1812 if (!UpRefs.empty())
1813 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1814 const Type *Ty = $1->get();
1815 if (isa<FunctionType>(Ty) || Ty == Type::LabelTy || isa<OpaqueType>(Ty))
1816 GEN_ERROR("Cannot create a null initialized value of this type");
1817 $$ = Constant::getNullValue(Ty);
1818 delete $1;
1819 CHECK_FOR_ERROR
1820 }
1821 | IntType ESINT64VAL { // integral constants
1822 if (!ConstantInt::isValueValidForType($1, $2))
1823 GEN_ERROR("Constant value doesn't fit in type");
1824 $$ = ConstantInt::get($1, $2, true);
1825 CHECK_FOR_ERROR
1826 }
1827 | IntType ESAPINTVAL { // arbitrary precision integer constants
1828 uint32_t BitWidth = cast<IntegerType>($1)->getBitWidth();
1829 if ($2->getBitWidth() > BitWidth) {
1830 GEN_ERROR("Constant value does not fit in type");
1831 }
1832 $2->sextOrTrunc(BitWidth);
1833 $$ = ConstantInt::get(*$2);
1834 delete $2;
1835 CHECK_FOR_ERROR
1836 }
1837 | IntType EUINT64VAL { // integral constants
1838 if (!ConstantInt::isValueValidForType($1, $2))
1839 GEN_ERROR("Constant value doesn't fit in type");
1840 $$ = ConstantInt::get($1, $2, false);
1841 CHECK_FOR_ERROR
1842 }
1843 | IntType EUAPINTVAL { // arbitrary precision integer constants
1844 uint32_t BitWidth = cast<IntegerType>($1)->getBitWidth();
1845 if ($2->getBitWidth() > BitWidth) {
1846 GEN_ERROR("Constant value does not fit in type");
1847 }
1848 $2->zextOrTrunc(BitWidth);
1849 $$ = ConstantInt::get(*$2);
1850 delete $2;
1851 CHECK_FOR_ERROR
1852 }
1853 | INTTYPE TRUETOK { // Boolean constants
1854 assert(cast<IntegerType>($1)->getBitWidth() == 1 && "Not Bool?");
1855 $$ = ConstantInt::getTrue();
1856 CHECK_FOR_ERROR
1857 }
1858 | INTTYPE FALSETOK { // Boolean constants
1859 assert(cast<IntegerType>($1)->getBitWidth() == 1 && "Not Bool?");
1860 $$ = ConstantInt::getFalse();
1861 CHECK_FOR_ERROR
1862 }
Dale Johannesen043064d2007-09-12 03:31:28 +00001863 | FPType FPVAL { // Floating point constants
Dale Johannesenb9de9f02007-09-06 18:13:44 +00001864 if (!ConstantFP::isValueValidForType($1, *$2))
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001865 GEN_ERROR("Floating point constant invalid for type");
Dale Johannesen255b8fe2007-09-11 18:33:39 +00001866 // Lexer has no type info, so builds all float and double FP constants
1867 // as double. Fix this here. Long double is done right.
1868 if (&$2->getSemantics()==&APFloat::IEEEdouble && $1==Type::FloatTy)
Dale Johannesenb9de9f02007-09-06 18:13:44 +00001869 $2->convert(APFloat::IEEEsingle, APFloat::rmNearestTiesToEven);
1870 $$ = ConstantFP::get($1, *$2);
Dale Johannesen3afee192007-09-07 21:07:57 +00001871 delete $2;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001872 CHECK_FOR_ERROR
1873 };
1874
1875
1876ConstExpr: CastOps '(' ConstVal TO Types ')' {
1877 if (!UpRefs.empty())
1878 GEN_ERROR("Invalid upreference in type: " + (*$5)->getDescription());
1879 Constant *Val = $3;
1880 const Type *DestTy = $5->get();
1881 if (!CastInst::castIsValid($1, $3, DestTy))
1882 GEN_ERROR("invalid cast opcode for cast from '" +
1883 Val->getType()->getDescription() + "' to '" +
1884 DestTy->getDescription() + "'");
1885 $$ = ConstantExpr::getCast($1, $3, DestTy);
1886 delete $5;
1887 }
1888 | GETELEMENTPTR '(' ConstVal IndexList ')' {
1889 if (!isa<PointerType>($3->getType()))
1890 GEN_ERROR("GetElementPtr requires a pointer operand");
1891
1892 const Type *IdxTy =
David Greene48556392007-09-04 18:46:50 +00001893 GetElementPtrInst::getIndexedType($3->getType(), $4->begin(), $4->end(),
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001894 true);
1895 if (!IdxTy)
1896 GEN_ERROR("Index list invalid for constant getelementptr");
1897
1898 SmallVector<Constant*, 8> IdxVec;
1899 for (unsigned i = 0, e = $4->size(); i != e; ++i)
1900 if (Constant *C = dyn_cast<Constant>((*$4)[i]))
1901 IdxVec.push_back(C);
1902 else
1903 GEN_ERROR("Indices to constant getelementptr must be constants");
1904
1905 delete $4;
1906
1907 $$ = ConstantExpr::getGetElementPtr($3, &IdxVec[0], IdxVec.size());
1908 CHECK_FOR_ERROR
1909 }
1910 | SELECT '(' ConstVal ',' ConstVal ',' ConstVal ')' {
1911 if ($3->getType() != Type::Int1Ty)
1912 GEN_ERROR("Select condition must be of boolean type");
1913 if ($5->getType() != $7->getType())
1914 GEN_ERROR("Select operand types must match");
1915 $$ = ConstantExpr::getSelect($3, $5, $7);
1916 CHECK_FOR_ERROR
1917 }
1918 | ArithmeticOps '(' ConstVal ',' ConstVal ')' {
1919 if ($3->getType() != $5->getType())
1920 GEN_ERROR("Binary operator types must match");
1921 CHECK_FOR_ERROR;
1922 $$ = ConstantExpr::get($1, $3, $5);
1923 }
1924 | LogicalOps '(' ConstVal ',' ConstVal ')' {
1925 if ($3->getType() != $5->getType())
1926 GEN_ERROR("Logical operator types must match");
1927 if (!$3->getType()->isInteger()) {
1928 if (Instruction::isShift($1) || !isa<VectorType>($3->getType()) ||
1929 !cast<VectorType>($3->getType())->getElementType()->isInteger())
1930 GEN_ERROR("Logical operator requires integral operands");
1931 }
1932 $$ = ConstantExpr::get($1, $3, $5);
1933 CHECK_FOR_ERROR
1934 }
1935 | ICMP IPredicates '(' ConstVal ',' ConstVal ')' {
1936 if ($4->getType() != $6->getType())
1937 GEN_ERROR("icmp operand types must match");
1938 $$ = ConstantExpr::getICmp($2, $4, $6);
1939 }
1940 | FCMP FPredicates '(' ConstVal ',' ConstVal ')' {
1941 if ($4->getType() != $6->getType())
1942 GEN_ERROR("fcmp operand types must match");
1943 $$ = ConstantExpr::getFCmp($2, $4, $6);
1944 }
1945 | EXTRACTELEMENT '(' ConstVal ',' ConstVal ')' {
1946 if (!ExtractElementInst::isValidOperands($3, $5))
1947 GEN_ERROR("Invalid extractelement operands");
1948 $$ = ConstantExpr::getExtractElement($3, $5);
1949 CHECK_FOR_ERROR
1950 }
1951 | INSERTELEMENT '(' ConstVal ',' ConstVal ',' ConstVal ')' {
1952 if (!InsertElementInst::isValidOperands($3, $5, $7))
1953 GEN_ERROR("Invalid insertelement operands");
1954 $$ = ConstantExpr::getInsertElement($3, $5, $7);
1955 CHECK_FOR_ERROR
1956 }
1957 | SHUFFLEVECTOR '(' ConstVal ',' ConstVal ',' ConstVal ')' {
1958 if (!ShuffleVectorInst::isValidOperands($3, $5, $7))
1959 GEN_ERROR("Invalid shufflevector operands");
1960 $$ = ConstantExpr::getShuffleVector($3, $5, $7);
1961 CHECK_FOR_ERROR
1962 };
1963
1964
1965// ConstVector - A list of comma separated constants.
1966ConstVector : ConstVector ',' ConstVal {
1967 ($$ = $1)->push_back($3);
1968 CHECK_FOR_ERROR
1969 }
1970 | ConstVal {
1971 $$ = new std::vector<Constant*>();
1972 $$->push_back($1);
1973 CHECK_FOR_ERROR
1974 };
1975
1976
1977// GlobalType - Match either GLOBAL or CONSTANT for global declarations...
1978GlobalType : GLOBAL { $$ = false; } | CONSTANT { $$ = true; };
1979
1980// ThreadLocal
1981ThreadLocal : THREAD_LOCAL { $$ = true; } | { $$ = false; };
1982
1983// AliaseeRef - Match either GlobalValue or bitcast to GlobalValue.
1984AliaseeRef : ResultTypes SymbolicValueRef {
1985 const Type* VTy = $1->get();
1986 Value *V = getVal(VTy, $2);
Chris Lattnerbb856a32007-08-06 21:00:46 +00001987 CHECK_FOR_ERROR
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001988 GlobalValue* Aliasee = dyn_cast<GlobalValue>(V);
1989 if (!Aliasee)
1990 GEN_ERROR("Aliases can be created only to global values");
1991
1992 $$ = Aliasee;
1993 CHECK_FOR_ERROR
1994 delete $1;
1995 }
1996 | BITCAST '(' AliaseeRef TO Types ')' {
1997 Constant *Val = $3;
1998 const Type *DestTy = $5->get();
1999 if (!CastInst::castIsValid($1, $3, DestTy))
2000 GEN_ERROR("invalid cast opcode for cast from '" +
2001 Val->getType()->getDescription() + "' to '" +
2002 DestTy->getDescription() + "'");
2003
2004 $$ = ConstantExpr::getCast($1, $3, DestTy);
2005 CHECK_FOR_ERROR
2006 delete $5;
2007 };
2008
2009//===----------------------------------------------------------------------===//
2010// Rules to match Modules
2011//===----------------------------------------------------------------------===//
2012
2013// Module rule: Capture the result of parsing the whole file into a result
2014// variable...
2015//
2016Module
2017 : DefinitionList {
2018 $$ = ParserResult = CurModule.CurrentModule;
2019 CurModule.ModuleDone();
2020 CHECK_FOR_ERROR;
2021 }
2022 | /*empty*/ {
2023 $$ = ParserResult = CurModule.CurrentModule;
2024 CurModule.ModuleDone();
2025 CHECK_FOR_ERROR;
2026 }
2027 ;
2028
2029DefinitionList
2030 : Definition
2031 | DefinitionList Definition
2032 ;
2033
2034Definition
2035 : DEFINE { CurFun.isDeclare = false; } Function {
2036 CurFun.FunctionDone();
2037 CHECK_FOR_ERROR
2038 }
2039 | DECLARE { CurFun.isDeclare = true; } FunctionProto {
2040 CHECK_FOR_ERROR
2041 }
2042 | MODULE ASM_TOK AsmBlock {
2043 CHECK_FOR_ERROR
2044 }
2045 | OptLocalAssign TYPE Types {
2046 if (!UpRefs.empty())
2047 GEN_ERROR("Invalid upreference in type: " + (*$3)->getDescription());
2048 // Eagerly resolve types. This is not an optimization, this is a
2049 // requirement that is due to the fact that we could have this:
2050 //
2051 // %list = type { %list * }
2052 // %list = type { %list * } ; repeated type decl
2053 //
2054 // If types are not resolved eagerly, then the two types will not be
2055 // determined to be the same type!
2056 //
2057 ResolveTypeTo($1, *$3);
2058
2059 if (!setTypeName(*$3, $1) && !$1) {
2060 CHECK_FOR_ERROR
2061 // If this is a named type that is not a redefinition, add it to the slot
2062 // table.
2063 CurModule.Types.push_back(*$3);
2064 }
2065
2066 delete $3;
2067 CHECK_FOR_ERROR
2068 }
2069 | OptLocalAssign TYPE VOID {
2070 ResolveTypeTo($1, $3);
2071
2072 if (!setTypeName($3, $1) && !$1) {
2073 CHECK_FOR_ERROR
2074 // If this is a named type that is not a redefinition, add it to the slot
2075 // table.
2076 CurModule.Types.push_back($3);
2077 }
2078 CHECK_FOR_ERROR
2079 }
Christopher Lamb668d9a02007-12-12 08:45:45 +00002080 | OptGlobalAssign GVVisibilityStyle ThreadLocal GlobalType ConstVal
2081 OptAddrSpace {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002082 /* "Externally Visible" Linkage */
2083 if ($5 == 0)
2084 GEN_ERROR("Global value initializer is not a constant");
2085 CurGV = ParseGlobalVariable($1, GlobalValue::ExternalLinkage,
Christopher Lamb668d9a02007-12-12 08:45:45 +00002086 $2, $4, $5->getType(), $5, $3, $6);
Christopher Lamb0a243582007-12-11 09:02:08 +00002087 CHECK_FOR_ERROR
2088 } GlobalVarAttributes {
2089 CurGV = 0;
2090 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002091 | OptGlobalAssign GVInternalLinkage GVVisibilityStyle ThreadLocal GlobalType
Christopher Lamb668d9a02007-12-12 08:45:45 +00002092 ConstVal OptAddrSpace {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002093 if ($6 == 0)
2094 GEN_ERROR("Global value initializer is not a constant");
Christopher Lamb668d9a02007-12-12 08:45:45 +00002095 CurGV = ParseGlobalVariable($1, $2, $3, $5, $6->getType(), $6, $4, $7);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002096 CHECK_FOR_ERROR
2097 } GlobalVarAttributes {
2098 CurGV = 0;
2099 }
2100 | OptGlobalAssign GVExternalLinkage GVVisibilityStyle ThreadLocal GlobalType
Christopher Lamb668d9a02007-12-12 08:45:45 +00002101 Types OptAddrSpace {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002102 if (!UpRefs.empty())
2103 GEN_ERROR("Invalid upreference in type: " + (*$6)->getDescription());
Christopher Lamb668d9a02007-12-12 08:45:45 +00002104 CurGV = ParseGlobalVariable($1, $2, $3, $5, *$6, 0, $4, $7);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002105 CHECK_FOR_ERROR
2106 delete $6;
2107 } GlobalVarAttributes {
2108 CurGV = 0;
2109 CHECK_FOR_ERROR
2110 }
2111 | OptGlobalAssign GVVisibilityStyle ALIAS AliasLinkage AliaseeRef {
2112 std::string Name;
2113 if ($1) {
2114 Name = *$1;
2115 delete $1;
2116 }
2117 if (Name.empty())
2118 GEN_ERROR("Alias name cannot be empty");
2119
2120 Constant* Aliasee = $5;
2121 if (Aliasee == 0)
2122 GEN_ERROR(std::string("Invalid aliasee for alias: ") + Name);
2123
2124 GlobalAlias* GA = new GlobalAlias(Aliasee->getType(), $4, Name, Aliasee,
2125 CurModule.CurrentModule);
2126 GA->setVisibility($2);
2127 InsertValue(GA, CurModule.Values);
Chris Lattner5eefce32007-09-10 23:24:14 +00002128
2129
2130 // If there was a forward reference of this alias, resolve it now.
2131
2132 ValID ID;
2133 if (!Name.empty())
2134 ID = ValID::createGlobalName(Name);
2135 else
2136 ID = ValID::createGlobalID(CurModule.Values.size()-1);
2137
2138 if (GlobalValue *FWGV =
2139 CurModule.GetForwardRefForGlobal(GA->getType(), ID)) {
2140 // Replace uses of the fwdref with the actual alias.
2141 FWGV->replaceAllUsesWith(GA);
2142 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(FWGV))
2143 GV->eraseFromParent();
2144 else
2145 cast<Function>(FWGV)->eraseFromParent();
2146 }
2147 ID.destroy();
2148
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002149 CHECK_FOR_ERROR
2150 }
2151 | TARGET TargetDefinition {
2152 CHECK_FOR_ERROR
2153 }
2154 | DEPLIBS '=' LibrariesDefinition {
2155 CHECK_FOR_ERROR
2156 }
2157 ;
2158
2159
2160AsmBlock : STRINGCONSTANT {
2161 const std::string &AsmSoFar = CurModule.CurrentModule->getModuleInlineAsm();
2162 if (AsmSoFar.empty())
2163 CurModule.CurrentModule->setModuleInlineAsm(*$1);
2164 else
2165 CurModule.CurrentModule->setModuleInlineAsm(AsmSoFar+"\n"+*$1);
2166 delete $1;
2167 CHECK_FOR_ERROR
2168};
2169
2170TargetDefinition : TRIPLE '=' STRINGCONSTANT {
2171 CurModule.CurrentModule->setTargetTriple(*$3);
2172 delete $3;
2173 }
2174 | DATALAYOUT '=' STRINGCONSTANT {
2175 CurModule.CurrentModule->setDataLayout(*$3);
2176 delete $3;
2177 };
2178
2179LibrariesDefinition : '[' LibList ']';
2180
2181LibList : LibList ',' STRINGCONSTANT {
2182 CurModule.CurrentModule->addLibrary(*$3);
2183 delete $3;
2184 CHECK_FOR_ERROR
2185 }
2186 | STRINGCONSTANT {
2187 CurModule.CurrentModule->addLibrary(*$1);
2188 delete $1;
2189 CHECK_FOR_ERROR
2190 }
2191 | /* empty: end of list */ {
2192 CHECK_FOR_ERROR
2193 }
2194 ;
2195
2196//===----------------------------------------------------------------------===//
2197// Rules to match Function Headers
2198//===----------------------------------------------------------------------===//
2199
2200ArgListH : ArgListH ',' Types OptParamAttrs OptLocalName {
2201 if (!UpRefs.empty())
2202 GEN_ERROR("Invalid upreference in type: " + (*$3)->getDescription());
2203 if (*$3 == Type::VoidTy)
2204 GEN_ERROR("void typed arguments are invalid");
2205 ArgListEntry E; E.Attrs = $4; E.Ty = $3; E.Name = $5;
2206 $$ = $1;
2207 $1->push_back(E);
2208 CHECK_FOR_ERROR
2209 }
2210 | Types OptParamAttrs OptLocalName {
2211 if (!UpRefs.empty())
2212 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
2213 if (*$1 == Type::VoidTy)
2214 GEN_ERROR("void typed arguments are invalid");
2215 ArgListEntry E; E.Attrs = $2; E.Ty = $1; E.Name = $3;
2216 $$ = new ArgListType;
2217 $$->push_back(E);
2218 CHECK_FOR_ERROR
2219 };
2220
2221ArgList : ArgListH {
2222 $$ = $1;
2223 CHECK_FOR_ERROR
2224 }
2225 | ArgListH ',' DOTDOTDOT {
2226 $$ = $1;
2227 struct ArgListEntry E;
2228 E.Ty = new PATypeHolder(Type::VoidTy);
2229 E.Name = 0;
2230 E.Attrs = ParamAttr::None;
2231 $$->push_back(E);
2232 CHECK_FOR_ERROR
2233 }
2234 | DOTDOTDOT {
2235 $$ = new ArgListType;
2236 struct ArgListEntry E;
2237 E.Ty = new PATypeHolder(Type::VoidTy);
2238 E.Name = 0;
2239 E.Attrs = ParamAttr::None;
2240 $$->push_back(E);
2241 CHECK_FOR_ERROR
2242 }
2243 | /* empty */ {
2244 $$ = 0;
2245 CHECK_FOR_ERROR
2246 };
2247
2248FunctionHeaderH : OptCallingConv ResultTypes GlobalName '(' ArgList ')'
Gordon Henriksen13fe5e32007-12-10 03:18:06 +00002249 OptFuncAttrs OptSection OptAlign OptGC {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002250 std::string FunctionName(*$3);
2251 delete $3; // Free strdup'd memory!
2252
2253 // Check the function result for abstractness if this is a define. We should
2254 // have no abstract types at this point
2255 if (!CurFun.isDeclare && CurModule.TypeIsUnresolved($2))
2256 GEN_ERROR("Reference to abstract result: "+ $2->get()->getDescription());
2257
2258 std::vector<const Type*> ParamTypeList;
2259 ParamAttrsVector Attrs;
2260 if ($7 != ParamAttr::None) {
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002261 ParamAttrsWithIndex PAWI;
2262 PAWI.index = 0;
2263 PAWI.attrs = $7;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002264 Attrs.push_back(PAWI);
2265 }
2266 if ($5) { // If there are arguments...
2267 unsigned index = 1;
2268 for (ArgListType::iterator I = $5->begin(); I != $5->end(); ++I, ++index) {
2269 const Type* Ty = I->Ty->get();
2270 if (!CurFun.isDeclare && CurModule.TypeIsUnresolved(I->Ty))
2271 GEN_ERROR("Reference to abstract argument: " + Ty->getDescription());
2272 ParamTypeList.push_back(Ty);
2273 if (Ty != Type::VoidTy)
2274 if (I->Attrs != ParamAttr::None) {
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002275 ParamAttrsWithIndex PAWI;
2276 PAWI.index = index;
2277 PAWI.attrs = I->Attrs;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002278 Attrs.push_back(PAWI);
2279 }
2280 }
2281 }
2282
2283 bool isVarArg = ParamTypeList.size() && ParamTypeList.back() == Type::VoidTy;
2284 if (isVarArg) ParamTypeList.pop_back();
2285
Duncan Sands637ec552007-11-28 17:07:01 +00002286 const ParamAttrsList *PAL = 0;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002287 if (!Attrs.empty())
2288 PAL = ParamAttrsList::get(Attrs);
2289
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002290 FunctionType *FT = FunctionType::get(*$2, ParamTypeList, isVarArg);
Christopher Lambfb623c62007-12-17 01:17:35 +00002291 const PointerType *PFT = PointerType::getUnqual(FT);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002292 delete $2;
2293
2294 ValID ID;
2295 if (!FunctionName.empty()) {
2296 ID = ValID::createGlobalName((char*)FunctionName.c_str());
2297 } else {
2298 ID = ValID::createGlobalID(CurModule.Values.size());
2299 }
2300
2301 Function *Fn = 0;
2302 // See if this function was forward referenced. If so, recycle the object.
2303 if (GlobalValue *FWRef = CurModule.GetForwardRefForGlobal(PFT, ID)) {
2304 // Move the function to the end of the list, from whereever it was
2305 // previously inserted.
2306 Fn = cast<Function>(FWRef);
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002307 assert(!Fn->getParamAttrs() && "Forward reference has parameter attributes!");
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002308 CurModule.CurrentModule->getFunctionList().remove(Fn);
2309 CurModule.CurrentModule->getFunctionList().push_back(Fn);
2310 } else if (!FunctionName.empty() && // Merge with an earlier prototype?
2311 (Fn = CurModule.CurrentModule->getFunction(FunctionName))) {
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002312 if (Fn->getFunctionType() != FT ) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002313 // The existing function doesn't have the same type. This is an overload
2314 // error.
2315 GEN_ERROR("Overload of function '" + FunctionName + "' not permitted.");
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002316 } else if (Fn->getParamAttrs() != PAL) {
2317 // The existing function doesn't have the same parameter attributes.
2318 // This is an overload error.
2319 GEN_ERROR("Overload of function '" + FunctionName + "' not permitted.");
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002320 } else if (!CurFun.isDeclare && !Fn->isDeclaration()) {
2321 // Neither the existing or the current function is a declaration and they
2322 // have the same name and same type. Clearly this is a redefinition.
2323 GEN_ERROR("Redefinition of function '" + FunctionName + "'");
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002324 } else if (Fn->isDeclaration()) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002325 // Make sure to strip off any argument names so we can't get conflicts.
2326 for (Function::arg_iterator AI = Fn->arg_begin(), AE = Fn->arg_end();
2327 AI != AE; ++AI)
2328 AI->setName("");
2329 }
2330 } else { // Not already defined?
2331 Fn = new Function(FT, GlobalValue::ExternalWeakLinkage, FunctionName,
2332 CurModule.CurrentModule);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002333 InsertValue(Fn, CurModule.Values);
2334 }
2335
2336 CurFun.FunctionStart(Fn);
2337
2338 if (CurFun.isDeclare) {
2339 // If we have declaration, always overwrite linkage. This will allow us to
2340 // correctly handle cases, when pointer to function is passed as argument to
2341 // another function.
2342 Fn->setLinkage(CurFun.Linkage);
2343 Fn->setVisibility(CurFun.Visibility);
2344 }
2345 Fn->setCallingConv($1);
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002346 Fn->setParamAttrs(PAL);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002347 Fn->setAlignment($9);
2348 if ($8) {
2349 Fn->setSection(*$8);
2350 delete $8;
2351 }
Gordon Henriksen13fe5e32007-12-10 03:18:06 +00002352 if ($10) {
2353 Fn->setCollector($10->c_str());
2354 delete $10;
2355 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002356
2357 // Add all of the arguments we parsed to the function...
2358 if ($5) { // Is null if empty...
2359 if (isVarArg) { // Nuke the last entry
2360 assert($5->back().Ty->get() == Type::VoidTy && $5->back().Name == 0 &&
2361 "Not a varargs marker!");
2362 delete $5->back().Ty;
2363 $5->pop_back(); // Delete the last entry
2364 }
2365 Function::arg_iterator ArgIt = Fn->arg_begin();
2366 Function::arg_iterator ArgEnd = Fn->arg_end();
2367 unsigned Idx = 1;
2368 for (ArgListType::iterator I = $5->begin();
2369 I != $5->end() && ArgIt != ArgEnd; ++I, ++ArgIt) {
2370 delete I->Ty; // Delete the typeholder...
2371 setValueName(ArgIt, I->Name); // Insert arg into symtab...
2372 CHECK_FOR_ERROR
2373 InsertValue(ArgIt);
2374 Idx++;
2375 }
2376
2377 delete $5; // We're now done with the argument list
2378 }
2379 CHECK_FOR_ERROR
2380};
2381
2382BEGIN : BEGINTOK | '{'; // Allow BEGIN or '{' to start a function
2383
2384FunctionHeader : FunctionDefineLinkage GVVisibilityStyle FunctionHeaderH BEGIN {
2385 $$ = CurFun.CurrentFunction;
2386
2387 // Make sure that we keep track of the linkage type even if there was a
2388 // previous "declare".
2389 $$->setLinkage($1);
2390 $$->setVisibility($2);
2391};
2392
2393END : ENDTOK | '}'; // Allow end of '}' to end a function
2394
2395Function : BasicBlockList END {
2396 $$ = $1;
2397 CHECK_FOR_ERROR
2398};
2399
2400FunctionProto : FunctionDeclareLinkage GVVisibilityStyle FunctionHeaderH {
2401 CurFun.CurrentFunction->setLinkage($1);
2402 CurFun.CurrentFunction->setVisibility($2);
2403 $$ = CurFun.CurrentFunction;
2404 CurFun.FunctionDone();
2405 CHECK_FOR_ERROR
2406 };
2407
2408//===----------------------------------------------------------------------===//
2409// Rules to match Basic Blocks
2410//===----------------------------------------------------------------------===//
2411
2412OptSideEffect : /* empty */ {
2413 $$ = false;
2414 CHECK_FOR_ERROR
2415 }
2416 | SIDEEFFECT {
2417 $$ = true;
2418 CHECK_FOR_ERROR
2419 };
2420
2421ConstValueRef : ESINT64VAL { // A reference to a direct constant
2422 $$ = ValID::create($1);
2423 CHECK_FOR_ERROR
2424 }
2425 | EUINT64VAL {
2426 $$ = ValID::create($1);
2427 CHECK_FOR_ERROR
2428 }
2429 | FPVAL { // Perhaps it's an FP constant?
2430 $$ = ValID::create($1);
2431 CHECK_FOR_ERROR
2432 }
2433 | TRUETOK {
2434 $$ = ValID::create(ConstantInt::getTrue());
2435 CHECK_FOR_ERROR
2436 }
2437 | FALSETOK {
2438 $$ = ValID::create(ConstantInt::getFalse());
2439 CHECK_FOR_ERROR
2440 }
2441 | NULL_TOK {
2442 $$ = ValID::createNull();
2443 CHECK_FOR_ERROR
2444 }
2445 | UNDEF {
2446 $$ = ValID::createUndef();
2447 CHECK_FOR_ERROR
2448 }
2449 | ZEROINITIALIZER { // A vector zero constant.
2450 $$ = ValID::createZeroInit();
2451 CHECK_FOR_ERROR
2452 }
2453 | '<' ConstVector '>' { // Nonempty unsized packed vector
2454 const Type *ETy = (*$2)[0]->getType();
2455 int NumElements = $2->size();
2456
2457 VectorType* pt = VectorType::get(ETy, NumElements);
2458 PATypeHolder* PTy = new PATypeHolder(
2459 HandleUpRefs(
2460 VectorType::get(
2461 ETy,
2462 NumElements)
2463 )
2464 );
2465
2466 // Verify all elements are correct type!
2467 for (unsigned i = 0; i < $2->size(); i++) {
2468 if (ETy != (*$2)[i]->getType())
2469 GEN_ERROR("Element #" + utostr(i) + " is not of type '" +
2470 ETy->getDescription() +"' as required!\nIt is of type '" +
2471 (*$2)[i]->getType()->getDescription() + "'.");
2472 }
2473
2474 $$ = ValID::create(ConstantVector::get(pt, *$2));
2475 delete PTy; delete $2;
2476 CHECK_FOR_ERROR
2477 }
2478 | ConstExpr {
2479 $$ = ValID::create($1);
2480 CHECK_FOR_ERROR
2481 }
2482 | ASM_TOK OptSideEffect STRINGCONSTANT ',' STRINGCONSTANT {
2483 $$ = ValID::createInlineAsm(*$3, *$5, $2);
2484 delete $3;
2485 delete $5;
2486 CHECK_FOR_ERROR
2487 };
2488
2489// SymbolicValueRef - Reference to one of two ways of symbolically refering to
2490// another value.
2491//
2492SymbolicValueRef : LOCALVAL_ID { // Is it an integer reference...?
2493 $$ = ValID::createLocalID($1);
2494 CHECK_FOR_ERROR
2495 }
2496 | GLOBALVAL_ID {
2497 $$ = ValID::createGlobalID($1);
2498 CHECK_FOR_ERROR
2499 }
2500 | LocalName { // Is it a named reference...?
2501 $$ = ValID::createLocalName(*$1);
2502 delete $1;
2503 CHECK_FOR_ERROR
2504 }
2505 | GlobalName { // Is it a named reference...?
2506 $$ = ValID::createGlobalName(*$1);
2507 delete $1;
2508 CHECK_FOR_ERROR
2509 };
2510
2511// ValueRef - A reference to a definition... either constant or symbolic
2512ValueRef : SymbolicValueRef | ConstValueRef;
2513
2514
2515// ResolvedVal - a <type> <value> pair. This is used only in cases where the
2516// type immediately preceeds the value reference, and allows complex constant
2517// pool references (for things like: 'ret [2 x int] [ int 12, int 42]')
2518ResolvedVal : Types ValueRef {
2519 if (!UpRefs.empty())
2520 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
2521 $$ = getVal(*$1, $2);
2522 delete $1;
2523 CHECK_FOR_ERROR
2524 }
2525 ;
2526
Devang Patelbf507402008-02-20 22:40:23 +00002527ReturnedVal : ResolvedVal {
2528 $$ = new std::vector<Value *>();
2529 $$->push_back($1);
2530 CHECK_FOR_ERROR
2531 }
2532 | ReturnedVal ',' ConstVal {
2533 ($$=$1)->push_back($3);
2534 CHECK_FOR_ERROR
2535 };
2536
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002537BasicBlockList : BasicBlockList BasicBlock {
2538 $$ = $1;
2539 CHECK_FOR_ERROR
2540 }
2541 | FunctionHeader BasicBlock { // Do not allow functions with 0 basic blocks
2542 $$ = $1;
2543 CHECK_FOR_ERROR
2544 };
2545
2546
2547// Basic blocks are terminated by branching instructions:
2548// br, br/cc, switch, ret
2549//
2550BasicBlock : InstructionList OptLocalAssign BBTerminatorInst {
2551 setValueName($3, $2);
2552 CHECK_FOR_ERROR
2553 InsertValue($3);
2554 $1->getInstList().push_back($3);
2555 $$ = $1;
2556 CHECK_FOR_ERROR
2557 };
2558
2559InstructionList : InstructionList Inst {
2560 if (CastInst *CI1 = dyn_cast<CastInst>($2))
2561 if (CastInst *CI2 = dyn_cast<CastInst>(CI1->getOperand(0)))
2562 if (CI2->getParent() == 0)
2563 $1->getInstList().push_back(CI2);
2564 $1->getInstList().push_back($2);
2565 $$ = $1;
2566 CHECK_FOR_ERROR
2567 }
2568 | /* empty */ { // Empty space between instruction lists
2569 $$ = defineBBVal(ValID::createLocalID(CurFun.NextValNum));
2570 CHECK_FOR_ERROR
2571 }
2572 | LABELSTR { // Labelled (named) basic block
2573 $$ = defineBBVal(ValID::createLocalName(*$1));
2574 delete $1;
2575 CHECK_FOR_ERROR
2576
2577 };
2578
Devang Patelbf507402008-02-20 22:40:23 +00002579BBTerminatorInst :
2580 RET ReturnedVal { // Return with a result...
2581 if($2->size() == 1)
2582 $$ = new ReturnInst($2->back());
2583 else {
2584
2585 std::vector<const Type*> Elements;
2586 std::vector<Constant*> Vals;
2587 for (std::vector<Value *>::iterator I = $2->begin(),
2588 E = $2->end(); I != E; ++I) {
2589 Value *V = *I;
2590 Constant *C = cast<Constant>(V);
2591 Elements.push_back(V->getType());
2592 Vals.push_back(C);
2593 }
2594
2595 const StructType *STy = StructType::get(Elements);
2596 PATypeHolder *PTy =
2597 new PATypeHolder(HandleUpRefs(StructType::get(Elements)));
2598
2599 Constant *CS = ConstantStruct::get(STy, Vals); // *$2);
2600 $$ = new ReturnInst(CS);
2601 delete PTy;
2602 }
2603 delete $2;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002604 CHECK_FOR_ERROR
2605 }
2606 | RET VOID { // Return with no result...
2607 $$ = new ReturnInst();
2608 CHECK_FOR_ERROR
2609 }
2610 | BR LABEL ValueRef { // Unconditional Branch...
2611 BasicBlock* tmpBB = getBBVal($3);
2612 CHECK_FOR_ERROR
2613 $$ = new BranchInst(tmpBB);
2614 } // Conditional Branch...
2615 | BR INTTYPE ValueRef ',' LABEL ValueRef ',' LABEL ValueRef {
2616 assert(cast<IntegerType>($2)->getBitWidth() == 1 && "Not Bool?");
2617 BasicBlock* tmpBBA = getBBVal($6);
2618 CHECK_FOR_ERROR
2619 BasicBlock* tmpBBB = getBBVal($9);
2620 CHECK_FOR_ERROR
2621 Value* tmpVal = getVal(Type::Int1Ty, $3);
2622 CHECK_FOR_ERROR
2623 $$ = new BranchInst(tmpBBA, tmpBBB, tmpVal);
2624 }
2625 | SWITCH IntType ValueRef ',' LABEL ValueRef '[' JumpTable ']' {
2626 Value* tmpVal = getVal($2, $3);
2627 CHECK_FOR_ERROR
2628 BasicBlock* tmpBB = getBBVal($6);
2629 CHECK_FOR_ERROR
2630 SwitchInst *S = new SwitchInst(tmpVal, tmpBB, $8->size());
2631 $$ = S;
2632
2633 std::vector<std::pair<Constant*,BasicBlock*> >::iterator I = $8->begin(),
2634 E = $8->end();
2635 for (; I != E; ++I) {
2636 if (ConstantInt *CI = dyn_cast<ConstantInt>(I->first))
2637 S->addCase(CI, I->second);
2638 else
2639 GEN_ERROR("Switch case is constant, but not a simple integer");
2640 }
2641 delete $8;
2642 CHECK_FOR_ERROR
2643 }
2644 | SWITCH IntType ValueRef ',' LABEL ValueRef '[' ']' {
2645 Value* tmpVal = getVal($2, $3);
2646 CHECK_FOR_ERROR
2647 BasicBlock* tmpBB = getBBVal($6);
2648 CHECK_FOR_ERROR
2649 SwitchInst *S = new SwitchInst(tmpVal, tmpBB, 0);
2650 $$ = S;
2651 CHECK_FOR_ERROR
2652 }
Dale Johannesencfb19e62007-11-05 21:20:28 +00002653 | INVOKE OptCallingConv ResultTypes ValueRef '(' ParamList ')' OptFuncAttrs
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002654 TO LABEL ValueRef UNWIND LABEL ValueRef {
2655
2656 // Handle the short syntax
2657 const PointerType *PFTy = 0;
2658 const FunctionType *Ty = 0;
2659 if (!(PFTy = dyn_cast<PointerType>($3->get())) ||
2660 !(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) {
2661 // Pull out the types of all of the arguments...
2662 std::vector<const Type*> ParamTypes;
Dale Johannesencfb19e62007-11-05 21:20:28 +00002663 ParamList::iterator I = $6->begin(), E = $6->end();
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002664 for (; I != E; ++I) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002665 const Type *Ty = I->Val->getType();
2666 if (Ty == Type::VoidTy)
2667 GEN_ERROR("Short call syntax cannot be used with varargs");
2668 ParamTypes.push_back(Ty);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002669 }
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002670 Ty = FunctionType::get($3->get(), ParamTypes, false);
Christopher Lambfb623c62007-12-17 01:17:35 +00002671 PFTy = PointerType::getUnqual(Ty);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002672 }
2673
2674 delete $3;
2675
2676 Value *V = getVal(PFTy, $4); // Get the function we're calling...
2677 CHECK_FOR_ERROR
2678 BasicBlock *Normal = getBBVal($11);
2679 CHECK_FOR_ERROR
2680 BasicBlock *Except = getBBVal($14);
2681 CHECK_FOR_ERROR
2682
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002683 ParamAttrsVector Attrs;
2684 if ($8 != ParamAttr::None) {
2685 ParamAttrsWithIndex PAWI; PAWI.index = 0; PAWI.attrs = $8;
2686 Attrs.push_back(PAWI);
2687 }
2688
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002689 // Check the arguments
2690 ValueList Args;
2691 if ($6->empty()) { // Has no arguments?
2692 // Make sure no arguments is a good thing!
2693 if (Ty->getNumParams() != 0)
2694 GEN_ERROR("No arguments passed to a function that "
2695 "expects arguments");
2696 } else { // Has arguments?
2697 // Loop through FunctionType's arguments and ensure they are specified
2698 // correctly!
2699 FunctionType::param_iterator I = Ty->param_begin();
2700 FunctionType::param_iterator E = Ty->param_end();
Dale Johannesencfb19e62007-11-05 21:20:28 +00002701 ParamList::iterator ArgI = $6->begin(), ArgE = $6->end();
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002702 unsigned index = 1;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002703
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002704 for (; ArgI != ArgE && I != E; ++ArgI, ++I, ++index) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002705 if (ArgI->Val->getType() != *I)
2706 GEN_ERROR("Parameter " + ArgI->Val->getName()+ " is not of type '" +
2707 (*I)->getDescription() + "'");
2708 Args.push_back(ArgI->Val);
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002709 if (ArgI->Attrs != ParamAttr::None) {
2710 ParamAttrsWithIndex PAWI;
2711 PAWI.index = index;
2712 PAWI.attrs = ArgI->Attrs;
2713 Attrs.push_back(PAWI);
2714 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002715 }
2716
2717 if (Ty->isVarArg()) {
2718 if (I == E)
Chris Lattner59363a32008-02-19 04:36:25 +00002719 for (; ArgI != ArgE; ++ArgI, ++index) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002720 Args.push_back(ArgI->Val); // push the remaining varargs
Chris Lattner59363a32008-02-19 04:36:25 +00002721 if (ArgI->Attrs != ParamAttr::None) {
2722 ParamAttrsWithIndex PAWI;
2723 PAWI.index = index;
2724 PAWI.attrs = ArgI->Attrs;
2725 Attrs.push_back(PAWI);
2726 }
2727 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002728 } else if (I != E || ArgI != ArgE)
2729 GEN_ERROR("Invalid number of parameters detected");
2730 }
2731
Duncan Sands637ec552007-11-28 17:07:01 +00002732 const ParamAttrsList *PAL = 0;
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002733 if (!Attrs.empty())
2734 PAL = ParamAttrsList::get(Attrs);
2735
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002736 // Create the InvokeInst
Chris Lattnerd140ada2007-08-29 16:15:23 +00002737 InvokeInst *II = new InvokeInst(V, Normal, Except, Args.begin(), Args.end());
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002738 II->setCallingConv($2);
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002739 II->setParamAttrs(PAL);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002740 $$ = II;
2741 delete $6;
2742 CHECK_FOR_ERROR
2743 }
2744 | UNWIND {
2745 $$ = new UnwindInst();
2746 CHECK_FOR_ERROR
2747 }
2748 | UNREACHABLE {
2749 $$ = new UnreachableInst();
2750 CHECK_FOR_ERROR
2751 };
2752
2753
2754
2755JumpTable : JumpTable IntType ConstValueRef ',' LABEL ValueRef {
2756 $$ = $1;
2757 Constant *V = cast<Constant>(getExistingVal($2, $3));
2758 CHECK_FOR_ERROR
2759 if (V == 0)
2760 GEN_ERROR("May only switch on a constant pool value");
2761
2762 BasicBlock* tmpBB = getBBVal($6);
2763 CHECK_FOR_ERROR
2764 $$->push_back(std::make_pair(V, tmpBB));
2765 }
2766 | IntType ConstValueRef ',' LABEL ValueRef {
2767 $$ = new std::vector<std::pair<Constant*, BasicBlock*> >();
2768 Constant *V = cast<Constant>(getExistingVal($1, $2));
2769 CHECK_FOR_ERROR
2770
2771 if (V == 0)
2772 GEN_ERROR("May only switch on a constant pool value");
2773
2774 BasicBlock* tmpBB = getBBVal($5);
2775 CHECK_FOR_ERROR
2776 $$->push_back(std::make_pair(V, tmpBB));
2777 };
2778
2779Inst : OptLocalAssign InstVal {
2780 // Is this definition named?? if so, assign the name...
2781 setValueName($2, $1);
2782 CHECK_FOR_ERROR
2783 InsertValue($2);
2784 $$ = $2;
2785 CHECK_FOR_ERROR
2786 };
2787
2788
2789PHIList : Types '[' ValueRef ',' ValueRef ']' { // Used for PHI nodes
2790 if (!UpRefs.empty())
2791 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
2792 $$ = new std::list<std::pair<Value*, BasicBlock*> >();
2793 Value* tmpVal = getVal(*$1, $3);
2794 CHECK_FOR_ERROR
2795 BasicBlock* tmpBB = getBBVal($5);
2796 CHECK_FOR_ERROR
2797 $$->push_back(std::make_pair(tmpVal, tmpBB));
2798 delete $1;
2799 }
2800 | PHIList ',' '[' ValueRef ',' ValueRef ']' {
2801 $$ = $1;
2802 Value* tmpVal = getVal($1->front().first->getType(), $4);
2803 CHECK_FOR_ERROR
2804 BasicBlock* tmpBB = getBBVal($6);
2805 CHECK_FOR_ERROR
2806 $1->push_back(std::make_pair(tmpVal, tmpBB));
2807 };
2808
2809
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002810ParamList : Types OptParamAttrs ValueRef OptParamAttrs {
2811 // FIXME: Remove trailing OptParamAttrs in LLVM 3.0, it was a mistake in 2.0
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002812 if (!UpRefs.empty())
2813 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
2814 // Used for call and invoke instructions
Dale Johannesencfb19e62007-11-05 21:20:28 +00002815 $$ = new ParamList();
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002816 ParamListEntry E; E.Attrs = $2 | $4; E.Val = getVal($1->get(), $3);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002817 $$->push_back(E);
2818 delete $1;
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002819 CHECK_FOR_ERROR
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002820 }
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002821 | LABEL OptParamAttrs ValueRef OptParamAttrs {
2822 // FIXME: Remove trailing OptParamAttrs in LLVM 3.0, it was a mistake in 2.0
Dale Johannesencfb19e62007-11-05 21:20:28 +00002823 // Labels are only valid in ASMs
2824 $$ = new ParamList();
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002825 ParamListEntry E; E.Attrs = $2 | $4; E.Val = getBBVal($3);
Dale Johannesencfb19e62007-11-05 21:20:28 +00002826 $$->push_back(E);
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002827 CHECK_FOR_ERROR
Dale Johannesencfb19e62007-11-05 21:20:28 +00002828 }
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002829 | ParamList ',' Types OptParamAttrs ValueRef OptParamAttrs {
2830 // FIXME: Remove trailing OptParamAttrs in LLVM 3.0, it was a mistake in 2.0
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002831 if (!UpRefs.empty())
2832 GEN_ERROR("Invalid upreference in type: " + (*$3)->getDescription());
2833 $$ = $1;
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002834 ParamListEntry E; E.Attrs = $4 | $6; E.Val = getVal($3->get(), $5);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002835 $$->push_back(E);
2836 delete $3;
2837 CHECK_FOR_ERROR
2838 }
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002839 | ParamList ',' LABEL OptParamAttrs ValueRef OptParamAttrs {
2840 // FIXME: Remove trailing OptParamAttrs in LLVM 3.0, it was a mistake in 2.0
Dale Johannesencfb19e62007-11-05 21:20:28 +00002841 $$ = $1;
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002842 ParamListEntry E; E.Attrs = $4 | $6; E.Val = getBBVal($5);
Dale Johannesencfb19e62007-11-05 21:20:28 +00002843 $$->push_back(E);
2844 CHECK_FOR_ERROR
2845 }
2846 | /*empty*/ { $$ = new ParamList(); };
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002847
2848IndexList // Used for gep instructions and constant expressions
2849 : /*empty*/ { $$ = new std::vector<Value*>(); }
2850 | IndexList ',' ResolvedVal {
2851 $$ = $1;
2852 $$->push_back($3);
2853 CHECK_FOR_ERROR
2854 }
2855 ;
2856
2857OptTailCall : TAIL CALL {
2858 $$ = true;
2859 CHECK_FOR_ERROR
2860 }
2861 | CALL {
2862 $$ = false;
2863 CHECK_FOR_ERROR
2864 };
2865
2866InstVal : ArithmeticOps Types ValueRef ',' ValueRef {
2867 if (!UpRefs.empty())
2868 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
2869 if (!(*$2)->isInteger() && !(*$2)->isFloatingPoint() &&
2870 !isa<VectorType>((*$2).get()))
2871 GEN_ERROR(
2872 "Arithmetic operator requires integer, FP, or packed operands");
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002873 Value* val1 = getVal(*$2, $3);
2874 CHECK_FOR_ERROR
2875 Value* val2 = getVal(*$2, $5);
2876 CHECK_FOR_ERROR
2877 $$ = BinaryOperator::create($1, val1, val2);
2878 if ($$ == 0)
2879 GEN_ERROR("binary operator returned null");
2880 delete $2;
2881 }
2882 | LogicalOps Types ValueRef ',' ValueRef {
2883 if (!UpRefs.empty())
2884 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
2885 if (!(*$2)->isInteger()) {
2886 if (Instruction::isShift($1) || !isa<VectorType>($2->get()) ||
2887 !cast<VectorType>($2->get())->getElementType()->isInteger())
2888 GEN_ERROR("Logical operator requires integral operands");
2889 }
2890 Value* tmpVal1 = getVal(*$2, $3);
2891 CHECK_FOR_ERROR
2892 Value* tmpVal2 = getVal(*$2, $5);
2893 CHECK_FOR_ERROR
2894 $$ = BinaryOperator::create($1, tmpVal1, tmpVal2);
2895 if ($$ == 0)
2896 GEN_ERROR("binary operator returned null");
2897 delete $2;
2898 }
2899 | ICMP IPredicates Types ValueRef ',' ValueRef {
2900 if (!UpRefs.empty())
2901 GEN_ERROR("Invalid upreference in type: " + (*$3)->getDescription());
2902 if (isa<VectorType>((*$3).get()))
2903 GEN_ERROR("Vector types not supported by icmp instruction");
2904 Value* tmpVal1 = getVal(*$3, $4);
2905 CHECK_FOR_ERROR
2906 Value* tmpVal2 = getVal(*$3, $6);
2907 CHECK_FOR_ERROR
2908 $$ = CmpInst::create($1, $2, tmpVal1, tmpVal2);
2909 if ($$ == 0)
2910 GEN_ERROR("icmp operator returned null");
2911 delete $3;
2912 }
2913 | FCMP FPredicates Types ValueRef ',' ValueRef {
2914 if (!UpRefs.empty())
2915 GEN_ERROR("Invalid upreference in type: " + (*$3)->getDescription());
2916 if (isa<VectorType>((*$3).get()))
2917 GEN_ERROR("Vector types not supported by fcmp instruction");
2918 Value* tmpVal1 = getVal(*$3, $4);
2919 CHECK_FOR_ERROR
2920 Value* tmpVal2 = getVal(*$3, $6);
2921 CHECK_FOR_ERROR
2922 $$ = CmpInst::create($1, $2, tmpVal1, tmpVal2);
2923 if ($$ == 0)
2924 GEN_ERROR("fcmp operator returned null");
2925 delete $3;
2926 }
2927 | CastOps ResolvedVal TO Types {
2928 if (!UpRefs.empty())
2929 GEN_ERROR("Invalid upreference in type: " + (*$4)->getDescription());
2930 Value* Val = $2;
2931 const Type* DestTy = $4->get();
2932 if (!CastInst::castIsValid($1, Val, DestTy))
2933 GEN_ERROR("invalid cast opcode for cast from '" +
2934 Val->getType()->getDescription() + "' to '" +
2935 DestTy->getDescription() + "'");
2936 $$ = CastInst::create($1, Val, DestTy);
2937 delete $4;
2938 }
2939 | SELECT ResolvedVal ',' ResolvedVal ',' ResolvedVal {
2940 if ($2->getType() != Type::Int1Ty)
2941 GEN_ERROR("select condition must be boolean");
2942 if ($4->getType() != $6->getType())
2943 GEN_ERROR("select value types should match");
2944 $$ = new SelectInst($2, $4, $6);
2945 CHECK_FOR_ERROR
2946 }
2947 | VAARG ResolvedVal ',' Types {
2948 if (!UpRefs.empty())
2949 GEN_ERROR("Invalid upreference in type: " + (*$4)->getDescription());
2950 $$ = new VAArgInst($2, *$4);
2951 delete $4;
2952 CHECK_FOR_ERROR
2953 }
2954 | EXTRACTELEMENT ResolvedVal ',' ResolvedVal {
2955 if (!ExtractElementInst::isValidOperands($2, $4))
2956 GEN_ERROR("Invalid extractelement operands");
2957 $$ = new ExtractElementInst($2, $4);
2958 CHECK_FOR_ERROR
2959 }
2960 | INSERTELEMENT ResolvedVal ',' ResolvedVal ',' ResolvedVal {
2961 if (!InsertElementInst::isValidOperands($2, $4, $6))
2962 GEN_ERROR("Invalid insertelement operands");
2963 $$ = new InsertElementInst($2, $4, $6);
2964 CHECK_FOR_ERROR
2965 }
2966 | SHUFFLEVECTOR ResolvedVal ',' ResolvedVal ',' ResolvedVal {
2967 if (!ShuffleVectorInst::isValidOperands($2, $4, $6))
2968 GEN_ERROR("Invalid shufflevector operands");
2969 $$ = new ShuffleVectorInst($2, $4, $6);
2970 CHECK_FOR_ERROR
2971 }
2972 | PHI_TOK PHIList {
2973 const Type *Ty = $2->front().first->getType();
2974 if (!Ty->isFirstClassType())
2975 GEN_ERROR("PHI node operands must be of first class type");
2976 $$ = new PHINode(Ty);
2977 ((PHINode*)$$)->reserveOperandSpace($2->size());
2978 while ($2->begin() != $2->end()) {
2979 if ($2->front().first->getType() != Ty)
2980 GEN_ERROR("All elements of a PHI node must be of the same type");
2981 cast<PHINode>($$)->addIncoming($2->front().first, $2->front().second);
2982 $2->pop_front();
2983 }
2984 delete $2; // Free the list...
2985 CHECK_FOR_ERROR
2986 }
Dale Johannesencfb19e62007-11-05 21:20:28 +00002987 | OptTailCall OptCallingConv ResultTypes ValueRef '(' ParamList ')'
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002988 OptFuncAttrs {
2989
2990 // Handle the short syntax
2991 const PointerType *PFTy = 0;
2992 const FunctionType *Ty = 0;
2993 if (!(PFTy = dyn_cast<PointerType>($3->get())) ||
2994 !(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) {
2995 // Pull out the types of all of the arguments...
2996 std::vector<const Type*> ParamTypes;
Dale Johannesencfb19e62007-11-05 21:20:28 +00002997 ParamList::iterator I = $6->begin(), E = $6->end();
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002998 for (; I != E; ++I) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002999 const Type *Ty = I->Val->getType();
3000 if (Ty == Type::VoidTy)
3001 GEN_ERROR("Short call syntax cannot be used with varargs");
3002 ParamTypes.push_back(Ty);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003003 }
Duncan Sandsf5588dc2007-11-27 13:23:08 +00003004 Ty = FunctionType::get($3->get(), ParamTypes, false);
Christopher Lambfb623c62007-12-17 01:17:35 +00003005 PFTy = PointerType::getUnqual(Ty);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003006 }
3007
3008 Value *V = getVal(PFTy, $4); // Get the function we're calling...
3009 CHECK_FOR_ERROR
3010
3011 // Check for call to invalid intrinsic to avoid crashing later.
3012 if (Function *theF = dyn_cast<Function>(V)) {
3013 if (theF->hasName() && (theF->getValueName()->getKeyLength() >= 5) &&
3014 (0 == strncmp(theF->getValueName()->getKeyData(), "llvm.", 5)) &&
3015 !theF->getIntrinsicID(true))
3016 GEN_ERROR("Call to invalid LLVM intrinsic function '" +
3017 theF->getName() + "'");
3018 }
3019
Duncan Sandsf5588dc2007-11-27 13:23:08 +00003020 // Set up the ParamAttrs for the function
3021 ParamAttrsVector Attrs;
3022 if ($8 != ParamAttr::None) {
3023 ParamAttrsWithIndex PAWI;
3024 PAWI.index = 0;
3025 PAWI.attrs = $8;
3026 Attrs.push_back(PAWI);
3027 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003028 // Check the arguments
3029 ValueList Args;
3030 if ($6->empty()) { // Has no arguments?
3031 // Make sure no arguments is a good thing!
3032 if (Ty->getNumParams() != 0)
3033 GEN_ERROR("No arguments passed to a function that "
3034 "expects arguments");
3035 } else { // Has arguments?
3036 // Loop through FunctionType's arguments and ensure they are specified
Duncan Sandsf5588dc2007-11-27 13:23:08 +00003037 // correctly. Also, gather any parameter attributes.
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003038 FunctionType::param_iterator I = Ty->param_begin();
3039 FunctionType::param_iterator E = Ty->param_end();
Dale Johannesencfb19e62007-11-05 21:20:28 +00003040 ParamList::iterator ArgI = $6->begin(), ArgE = $6->end();
Duncan Sandsf5588dc2007-11-27 13:23:08 +00003041 unsigned index = 1;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003042
Duncan Sandsf5588dc2007-11-27 13:23:08 +00003043 for (; ArgI != ArgE && I != E; ++ArgI, ++I, ++index) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003044 if (ArgI->Val->getType() != *I)
3045 GEN_ERROR("Parameter " + ArgI->Val->getName()+ " is not of type '" +
3046 (*I)->getDescription() + "'");
3047 Args.push_back(ArgI->Val);
Duncan Sandsf5588dc2007-11-27 13:23:08 +00003048 if (ArgI->Attrs != ParamAttr::None) {
3049 ParamAttrsWithIndex PAWI;
3050 PAWI.index = index;
3051 PAWI.attrs = ArgI->Attrs;
3052 Attrs.push_back(PAWI);
3053 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003054 }
3055 if (Ty->isVarArg()) {
3056 if (I == E)
Chris Lattner59363a32008-02-19 04:36:25 +00003057 for (; ArgI != ArgE; ++ArgI, ++index) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003058 Args.push_back(ArgI->Val); // push the remaining varargs
Chris Lattner59363a32008-02-19 04:36:25 +00003059 if (ArgI->Attrs != ParamAttr::None) {
3060 ParamAttrsWithIndex PAWI;
3061 PAWI.index = index;
3062 PAWI.attrs = ArgI->Attrs;
3063 Attrs.push_back(PAWI);
3064 }
3065 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003066 } else if (I != E || ArgI != ArgE)
3067 GEN_ERROR("Invalid number of parameters detected");
3068 }
Duncan Sandsf5588dc2007-11-27 13:23:08 +00003069
3070 // Finish off the ParamAttrs and check them
Duncan Sands637ec552007-11-28 17:07:01 +00003071 const ParamAttrsList *PAL = 0;
Duncan Sandsf5588dc2007-11-27 13:23:08 +00003072 if (!Attrs.empty())
3073 PAL = ParamAttrsList::get(Attrs);
3074
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003075 // Create the call node
David Greene9145dd22007-08-01 03:59:32 +00003076 CallInst *CI = new CallInst(V, Args.begin(), Args.end());
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003077 CI->setTailCall($1);
3078 CI->setCallingConv($2);
Duncan Sandsf5588dc2007-11-27 13:23:08 +00003079 CI->setParamAttrs(PAL);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003080 $$ = CI;
3081 delete $6;
3082 delete $3;
3083 CHECK_FOR_ERROR
3084 }
3085 | MemoryInst {
3086 $$ = $1;
3087 CHECK_FOR_ERROR
3088 };
3089
3090OptVolatile : VOLATILE {
3091 $$ = true;
3092 CHECK_FOR_ERROR
3093 }
3094 | /* empty */ {
3095 $$ = false;
3096 CHECK_FOR_ERROR
3097 };
3098
3099
3100
3101MemoryInst : MALLOC Types OptCAlign {
3102 if (!UpRefs.empty())
3103 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
3104 $$ = new MallocInst(*$2, 0, $3);
3105 delete $2;
3106 CHECK_FOR_ERROR
3107 }
3108 | MALLOC Types ',' INTTYPE ValueRef OptCAlign {
3109 if (!UpRefs.empty())
3110 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
3111 Value* tmpVal = getVal($4, $5);
3112 CHECK_FOR_ERROR
3113 $$ = new MallocInst(*$2, tmpVal, $6);
3114 delete $2;
3115 }
3116 | ALLOCA Types OptCAlign {
3117 if (!UpRefs.empty())
3118 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
3119 $$ = new AllocaInst(*$2, 0, $3);
3120 delete $2;
3121 CHECK_FOR_ERROR
3122 }
3123 | ALLOCA Types ',' INTTYPE ValueRef OptCAlign {
3124 if (!UpRefs.empty())
3125 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
3126 Value* tmpVal = getVal($4, $5);
3127 CHECK_FOR_ERROR
3128 $$ = new AllocaInst(*$2, tmpVal, $6);
3129 delete $2;
3130 }
3131 | FREE ResolvedVal {
3132 if (!isa<PointerType>($2->getType()))
3133 GEN_ERROR("Trying to free nonpointer type " +
3134 $2->getType()->getDescription() + "");
3135 $$ = new FreeInst($2);
3136 CHECK_FOR_ERROR
3137 }
3138
3139 | OptVolatile LOAD Types ValueRef OptCAlign {
3140 if (!UpRefs.empty())
3141 GEN_ERROR("Invalid upreference in type: " + (*$3)->getDescription());
3142 if (!isa<PointerType>($3->get()))
3143 GEN_ERROR("Can't load from nonpointer type: " +
3144 (*$3)->getDescription());
3145 if (!cast<PointerType>($3->get())->getElementType()->isFirstClassType())
3146 GEN_ERROR("Can't load from pointer of non-first-class type: " +
3147 (*$3)->getDescription());
3148 Value* tmpVal = getVal(*$3, $4);
3149 CHECK_FOR_ERROR
3150 $$ = new LoadInst(tmpVal, "", $1, $5);
3151 delete $3;
3152 }
3153 | OptVolatile STORE ResolvedVal ',' Types ValueRef OptCAlign {
3154 if (!UpRefs.empty())
3155 GEN_ERROR("Invalid upreference in type: " + (*$5)->getDescription());
3156 const PointerType *PT = dyn_cast<PointerType>($5->get());
3157 if (!PT)
3158 GEN_ERROR("Can't store to a nonpointer type: " +
3159 (*$5)->getDescription());
3160 const Type *ElTy = PT->getElementType();
3161 if (ElTy != $3->getType())
3162 GEN_ERROR("Can't store '" + $3->getType()->getDescription() +
3163 "' into space of type '" + ElTy->getDescription() + "'");
3164
3165 Value* tmpVal = getVal(*$5, $6);
3166 CHECK_FOR_ERROR
3167 $$ = new StoreInst($3, tmpVal, $1, $7);
3168 delete $5;
3169 }
Devang Pateleb293342008-02-20 19:13:10 +00003170| GETRESULT Types LocalName ',' EUINT64VAL {
Devang Patel3b8849c2008-02-19 22:27:01 +00003171 ValID TmpVID = ValID::createLocalName(*$3);
3172 Value *TmpVal = getVal($2->get(), TmpVID);
3173 if (!GetResultInst::isValidOperands(TmpVal, $5))
3174 GEN_ERROR("Invalid getresult operands");
3175 $$ = new GetResultInst(TmpVal, $5);
3176 CHECK_FOR_ERROR
3177 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003178 | GETELEMENTPTR Types ValueRef IndexList {
3179 if (!UpRefs.empty())
3180 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
3181 if (!isa<PointerType>($2->get()))
3182 GEN_ERROR("getelementptr insn requires pointer operand");
3183
David Greene48556392007-09-04 18:46:50 +00003184 if (!GetElementPtrInst::getIndexedType(*$2, $4->begin(), $4->end(), true))
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003185 GEN_ERROR("Invalid getelementptr indices for type '" +
3186 (*$2)->getDescription()+ "'");
3187 Value* tmpVal = getVal(*$2, $3);
3188 CHECK_FOR_ERROR
David Greene48556392007-09-04 18:46:50 +00003189 $$ = new GetElementPtrInst(tmpVal, $4->begin(), $4->end());
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003190 delete $2;
3191 delete $4;
3192 };
3193
3194
3195%%
3196
3197// common code from the two 'RunVMAsmParser' functions
3198static Module* RunParser(Module * M) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003199 CurModule.CurrentModule = M;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003200 // Check to make sure the parser succeeded
3201 if (yyparse()) {
3202 if (ParserResult)
3203 delete ParserResult;
3204 return 0;
3205 }
3206
3207 // Emit an error if there are any unresolved types left.
3208 if (!CurModule.LateResolveTypes.empty()) {
3209 const ValID &DID = CurModule.LateResolveTypes.begin()->first;
3210 if (DID.Type == ValID::LocalName) {
3211 GenerateError("Undefined type remains at eof: '"+DID.getName() + "'");
3212 } else {
3213 GenerateError("Undefined type remains at eof: #" + itostr(DID.Num));
3214 }
3215 if (ParserResult)
3216 delete ParserResult;
3217 return 0;
3218 }
3219
3220 // Emit an error if there are any unresolved values left.
3221 if (!CurModule.LateResolveValues.empty()) {
3222 Value *V = CurModule.LateResolveValues.back();
3223 std::map<Value*, std::pair<ValID, int> >::iterator I =
3224 CurModule.PlaceHolderInfo.find(V);
3225
3226 if (I != CurModule.PlaceHolderInfo.end()) {
3227 ValID &DID = I->second.first;
3228 if (DID.Type == ValID::LocalName) {
3229 GenerateError("Undefined value remains at eof: "+DID.getName() + "'");
3230 } else {
3231 GenerateError("Undefined value remains at eof: #" + itostr(DID.Num));
3232 }
3233 if (ParserResult)
3234 delete ParserResult;
3235 return 0;
3236 }
3237 }
3238
3239 // Check to make sure that parsing produced a result
3240 if (!ParserResult)
3241 return 0;
3242
3243 // Reset ParserResult variable while saving its value for the result.
3244 Module *Result = ParserResult;
3245 ParserResult = 0;
3246
3247 return Result;
3248}
3249
3250void llvm::GenerateError(const std::string &message, int LineNo) {
Duncan Sandsf5588dc2007-11-27 13:23:08 +00003251 if (LineNo == -1) LineNo = LLLgetLineNo();
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003252 // TODO: column number in exception
3253 if (TheParseError)
Duncan Sandsf5588dc2007-11-27 13:23:08 +00003254 TheParseError->setError(LLLgetFilename(), message, LineNo);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003255 TriggerError = 1;
3256}
3257
3258int yyerror(const char *ErrorMsg) {
Duncan Sandsf5588dc2007-11-27 13:23:08 +00003259 std::string where = LLLgetFilename() + ":" + utostr(LLLgetLineNo()) + ": ";
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003260 std::string errMsg = where + "error: " + std::string(ErrorMsg);
Duncan Sandsf5588dc2007-11-27 13:23:08 +00003261 if (yychar != YYEMPTY && yychar != 0) {
3262 errMsg += " while reading token: '";
3263 errMsg += std::string(LLLgetTokenStart(),
3264 LLLgetTokenStart()+LLLgetTokenLength()) + "'";
3265 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003266 GenerateError(errMsg);
3267 return 0;
3268}