blob: ae6da07893f3e93c6a8a734a6faa09061b9ba432 [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//
5// This file was developed by the LLVM research group and is distributed under
6// the University of Illinois Open Source License. See LICENSE.TXT for details.
7//
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??
381 if (!ConstantInt::isValueValidForType(Ty, D.ConstPool64)) {
382 GenerateError("Signed integral constant '" +
383 itostr(D.ConstPool64) + "' is invalid for type '" +
384 Ty->getDescription() + "'");
385 return 0;
386 }
387 return ConstantInt::get(Ty, D.ConstPool64, true);
388
389 case ValID::ConstUIntVal: // Is it an unsigned const pool reference?
390 if (!ConstantInt::isValueValidForType(Ty, D.UConstPool64)) {
391 if (!ConstantInt::isValueValidForType(Ty, D.ConstPool64)) {
392 GenerateError("Integral constant '" + utostr(D.UConstPool64) +
393 "' is invalid or out of range");
394 return 0;
395 } else { // This is really a signed reference. Transmogrify.
396 return ConstantInt::get(Ty, D.ConstPool64, true);
397 }
398 } else {
399 return ConstantInt::get(Ty, D.UConstPool64);
400 }
401
402 case ValID::ConstFPVal: // Is it a floating point const pool reference?
Dale Johannesenb9de9f02007-09-06 18:13:44 +0000403 if (!ConstantFP::isValueValidForType(Ty, *D.ConstPoolFP)) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000404 GenerateError("FP constant invalid for type");
405 return 0;
406 }
Dale Johannesen255b8fe2007-09-11 18:33:39 +0000407 // Lexer has no type info, so builds all float and double FP constants
408 // as double. Fix this here. Long double does not need this.
409 if (&D.ConstPoolFP->getSemantics() == &APFloat::IEEEdouble &&
410 Ty==Type::FloatTy)
Dale Johannesenb9de9f02007-09-06 18:13:44 +0000411 D.ConstPoolFP->convert(APFloat::IEEEsingle, APFloat::rmNearestTiesToEven);
412 return ConstantFP::get(Ty, *D.ConstPoolFP);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000413
414 case ValID::ConstNullVal: // Is it a null value?
415 if (!isa<PointerType>(Ty)) {
416 GenerateError("Cannot create a a non pointer null");
417 return 0;
418 }
419 return ConstantPointerNull::get(cast<PointerType>(Ty));
420
421 case ValID::ConstUndefVal: // Is it an undef value?
422 return UndefValue::get(Ty);
423
424 case ValID::ConstZeroVal: // Is it a zero value?
425 return Constant::getNullValue(Ty);
426
427 case ValID::ConstantVal: // Fully resolved constant?
428 if (D.ConstantValue->getType() != Ty) {
429 GenerateError("Constant expression type different from required type");
430 return 0;
431 }
432 return D.ConstantValue;
433
434 case ValID::InlineAsmVal: { // Inline asm expression
435 const PointerType *PTy = dyn_cast<PointerType>(Ty);
436 const FunctionType *FTy =
437 PTy ? dyn_cast<FunctionType>(PTy->getElementType()) : 0;
438 if (!FTy || !InlineAsm::Verify(FTy, D.IAD->Constraints)) {
439 GenerateError("Invalid type for asm constraint string");
440 return 0;
441 }
442 InlineAsm *IA = InlineAsm::get(FTy, D.IAD->AsmString, D.IAD->Constraints,
443 D.IAD->HasSideEffects);
444 D.destroy(); // Free InlineAsmDescriptor.
445 return IA;
446 }
447 default:
448 assert(0 && "Unhandled case!");
449 return 0;
450 } // End of switch
451
452 assert(0 && "Unhandled case!");
453 return 0;
454}
455
456// getVal - This function is identical to getExistingVal, except that if a
457// value is not already defined, it "improvises" by creating a placeholder var
458// that looks and acts just like the requested variable. When the value is
459// defined later, all uses of the placeholder variable are replaced with the
460// real thing.
461//
462static Value *getVal(const Type *Ty, const ValID &ID) {
463 if (Ty == Type::LabelTy) {
464 GenerateError("Cannot use a basic block here");
465 return 0;
466 }
467
468 // See if the value has already been defined.
469 Value *V = getExistingVal(Ty, ID);
470 if (V) return V;
471 if (TriggerError) return 0;
472
473 if (!Ty->isFirstClassType() && !isa<OpaqueType>(Ty)) {
474 GenerateError("Invalid use of a composite type");
475 return 0;
476 }
477
478 // If we reached here, we referenced either a symbol that we don't know about
479 // or an id number that hasn't been read yet. We may be referencing something
480 // forward, so just create an entry to be resolved later and get to it...
481 //
482 switch (ID.Type) {
483 case ValID::GlobalName:
484 case ValID::GlobalID: {
485 const PointerType *PTy = dyn_cast<PointerType>(Ty);
486 if (!PTy) {
487 GenerateError("Invalid type for reference to global" );
488 return 0;
489 }
490 const Type* ElTy = PTy->getElementType();
491 if (const FunctionType *FTy = dyn_cast<FunctionType>(ElTy))
492 V = new Function(FTy, GlobalValue::ExternalLinkage);
493 else
494 V = new GlobalVariable(ElTy, false, GlobalValue::ExternalLinkage);
495 break;
496 }
497 default:
498 V = new Argument(Ty);
499 }
500
501 // Remember where this forward reference came from. FIXME, shouldn't we try
502 // to recycle these things??
503 CurModule.PlaceHolderInfo.insert(std::make_pair(V, std::make_pair(ID,
Duncan Sandsf5588dc2007-11-27 13:23:08 +0000504 LLLgetLineNo())));
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000505
506 if (inFunctionScope())
507 InsertValue(V, CurFun.LateResolveValues);
508 else
509 InsertValue(V, CurModule.LateResolveValues);
510 return V;
511}
512
513/// defineBBVal - This is a definition of a new basic block with the specified
514/// identifier which must be the same as CurFun.NextValNum, if its numeric.
515static BasicBlock *defineBBVal(const ValID &ID) {
516 assert(inFunctionScope() && "Can't get basic block at global scope!");
517
518 BasicBlock *BB = 0;
519
520 // First, see if this was forward referenced
521
522 std::map<ValID, BasicBlock*>::iterator BBI = CurFun.BBForwardRefs.find(ID);
523 if (BBI != CurFun.BBForwardRefs.end()) {
524 BB = BBI->second;
525 // The forward declaration could have been inserted anywhere in the
526 // function: insert it into the correct place now.
527 CurFun.CurrentFunction->getBasicBlockList().remove(BB);
528 CurFun.CurrentFunction->getBasicBlockList().push_back(BB);
529
530 // We're about to erase the entry, save the key so we can clean it up.
531 ValID Tmp = BBI->first;
532
533 // Erase the forward ref from the map as its no longer "forward"
534 CurFun.BBForwardRefs.erase(ID);
535
536 // The key has been removed from the map but so we don't want to leave
537 // strdup'd memory around so destroy it too.
538 Tmp.destroy();
539
540 // If its a numbered definition, bump the number and set the BB value.
541 if (ID.Type == ValID::LocalID) {
542 assert(ID.Num == CurFun.NextValNum && "Invalid new block number");
543 InsertValue(BB);
544 }
545
546 ID.destroy();
547 return BB;
548 }
549
550 // We haven't seen this BB before and its first mention is a definition.
551 // Just create it and return it.
552 std::string Name (ID.Type == ValID::LocalName ? ID.getName() : "");
553 BB = new BasicBlock(Name, CurFun.CurrentFunction);
554 if (ID.Type == ValID::LocalID) {
555 assert(ID.Num == CurFun.NextValNum && "Invalid new block number");
556 InsertValue(BB);
557 }
558
559 ID.destroy(); // Free strdup'd memory
560 return BB;
561}
562
563/// getBBVal - get an existing BB value or create a forward reference for it.
564///
565static BasicBlock *getBBVal(const ValID &ID) {
566 assert(inFunctionScope() && "Can't get basic block at global scope!");
567
568 BasicBlock *BB = 0;
569
570 std::map<ValID, BasicBlock*>::iterator BBI = CurFun.BBForwardRefs.find(ID);
571 if (BBI != CurFun.BBForwardRefs.end()) {
572 BB = BBI->second;
573 } if (ID.Type == ValID::LocalName) {
574 std::string Name = ID.getName();
575 Value *N = CurFun.CurrentFunction->getValueSymbolTable().lookup(Name);
576 if (N)
577 if (N->getType()->getTypeID() == Type::LabelTyID)
578 BB = cast<BasicBlock>(N);
579 else
580 GenerateError("Reference to label '" + Name + "' is actually of type '"+
581 N->getType()->getDescription() + "'");
582 } else if (ID.Type == ValID::LocalID) {
583 if (ID.Num < CurFun.NextValNum && ID.Num < CurFun.Values.size()) {
584 if (CurFun.Values[ID.Num]->getType()->getTypeID() == Type::LabelTyID)
585 BB = cast<BasicBlock>(CurFun.Values[ID.Num]);
586 else
587 GenerateError("Reference to label '%" + utostr(ID.Num) +
588 "' is actually of type '"+
589 CurFun.Values[ID.Num]->getType()->getDescription() + "'");
590 }
591 } else {
592 GenerateError("Illegal label reference " + ID.getName());
593 return 0;
594 }
595
596 // If its already been defined, return it now.
597 if (BB) {
598 ID.destroy(); // Free strdup'd memory.
599 return BB;
600 }
601
602 // Otherwise, this block has not been seen before, create it.
603 std::string Name;
604 if (ID.Type == ValID::LocalName)
605 Name = ID.getName();
606 BB = new BasicBlock(Name, CurFun.CurrentFunction);
607
608 // Insert it in the forward refs map.
609 CurFun.BBForwardRefs[ID] = BB;
610
611 return BB;
612}
613
614
615//===----------------------------------------------------------------------===//
616// Code to handle forward references in instructions
617//===----------------------------------------------------------------------===//
618//
619// This code handles the late binding needed with statements that reference
620// values not defined yet... for example, a forward branch, or the PHI node for
621// a loop body.
622//
623// This keeps a table (CurFun.LateResolveValues) of all such forward references
624// and back patchs after we are done.
625//
626
627// ResolveDefinitions - If we could not resolve some defs at parsing
628// time (forward branches, phi functions for loops, etc...) resolve the
629// defs now...
630//
631static void
632ResolveDefinitions(ValueList &LateResolvers, ValueList *FutureLateResolvers) {
633 // Loop over LateResolveDefs fixing up stuff that couldn't be resolved
634 while (!LateResolvers.empty()) {
635 Value *V = LateResolvers.back();
636 LateResolvers.pop_back();
637
638 std::map<Value*, std::pair<ValID, int> >::iterator PHI =
639 CurModule.PlaceHolderInfo.find(V);
640 assert(PHI != CurModule.PlaceHolderInfo.end() && "Placeholder error!");
641
642 ValID &DID = PHI->second.first;
643
644 Value *TheRealValue = getExistingVal(V->getType(), DID);
645 if (TriggerError)
646 return;
647 if (TheRealValue) {
648 V->replaceAllUsesWith(TheRealValue);
649 delete V;
650 CurModule.PlaceHolderInfo.erase(PHI);
651 } else if (FutureLateResolvers) {
652 // Functions have their unresolved items forwarded to the module late
653 // resolver table
654 InsertValue(V, *FutureLateResolvers);
655 } else {
656 if (DID.Type == ValID::LocalName || DID.Type == ValID::GlobalName) {
657 GenerateError("Reference to an invalid definition: '" +DID.getName()+
658 "' of type '" + V->getType()->getDescription() + "'",
659 PHI->second.second);
660 return;
661 } else {
662 GenerateError("Reference to an invalid definition: #" +
663 itostr(DID.Num) + " of type '" +
664 V->getType()->getDescription() + "'",
665 PHI->second.second);
666 return;
667 }
668 }
669 }
670 LateResolvers.clear();
671}
672
673// ResolveTypeTo - A brand new type was just declared. This means that (if
674// name is not null) things referencing Name can be resolved. Otherwise, things
675// refering to the number can be resolved. Do this now.
676//
677static void ResolveTypeTo(std::string *Name, const Type *ToTy) {
678 ValID D;
679 if (Name)
680 D = ValID::createLocalName(*Name);
681 else
682 D = ValID::createLocalID(CurModule.Types.size());
683
684 std::map<ValID, PATypeHolder>::iterator I =
685 CurModule.LateResolveTypes.find(D);
686 if (I != CurModule.LateResolveTypes.end()) {
687 ((DerivedType*)I->second.get())->refineAbstractTypeTo(ToTy);
688 CurModule.LateResolveTypes.erase(I);
689 }
690}
691
692// setValueName - Set the specified value to the name given. The name may be
693// null potentially, in which case this is a noop. The string passed in is
694// assumed to be a malloc'd string buffer, and is free'd by this function.
695//
696static void setValueName(Value *V, std::string *NameStr) {
697 if (!NameStr) return;
698 std::string Name(*NameStr); // Copy string
699 delete NameStr; // Free old string
700
701 if (V->getType() == Type::VoidTy) {
702 GenerateError("Can't assign name '" + Name+"' to value with void type");
703 return;
704 }
705
706 assert(inFunctionScope() && "Must be in function scope!");
707 ValueSymbolTable &ST = CurFun.CurrentFunction->getValueSymbolTable();
708 if (ST.lookup(Name)) {
709 GenerateError("Redefinition of value '" + Name + "' of type '" +
710 V->getType()->getDescription() + "'");
711 return;
712 }
713
714 // Set the name.
715 V->setName(Name);
716}
717
718/// ParseGlobalVariable - Handle parsing of a global. If Initializer is null,
719/// this is a declaration, otherwise it is a definition.
720static GlobalVariable *
721ParseGlobalVariable(std::string *NameStr,
722 GlobalValue::LinkageTypes Linkage,
723 GlobalValue::VisibilityTypes Visibility,
724 bool isConstantGlobal, const Type *Ty,
725 Constant *Initializer, bool IsThreadLocal) {
726 if (isa<FunctionType>(Ty)) {
727 GenerateError("Cannot declare global vars of function type");
728 return 0;
729 }
730
731 const PointerType *PTy = PointerType::get(Ty);
732
733 std::string Name;
734 if (NameStr) {
735 Name = *NameStr; // Copy string
736 delete NameStr; // Free old string
737 }
738
739 // See if this global value was forward referenced. If so, recycle the
740 // object.
741 ValID ID;
742 if (!Name.empty()) {
743 ID = ValID::createGlobalName(Name);
744 } else {
745 ID = ValID::createGlobalID(CurModule.Values.size());
746 }
747
748 if (GlobalValue *FWGV = CurModule.GetForwardRefForGlobal(PTy, ID)) {
749 // Move the global to the end of the list, from whereever it was
750 // previously inserted.
751 GlobalVariable *GV = cast<GlobalVariable>(FWGV);
752 CurModule.CurrentModule->getGlobalList().remove(GV);
753 CurModule.CurrentModule->getGlobalList().push_back(GV);
754 GV->setInitializer(Initializer);
755 GV->setLinkage(Linkage);
756 GV->setVisibility(Visibility);
757 GV->setConstant(isConstantGlobal);
758 GV->setThreadLocal(IsThreadLocal);
759 InsertValue(GV, CurModule.Values);
760 return GV;
761 }
762
763 // If this global has a name
764 if (!Name.empty()) {
765 // if the global we're parsing has an initializer (is a definition) and
766 // has external linkage.
767 if (Initializer && Linkage != GlobalValue::InternalLinkage)
768 // If there is already a global with external linkage with this name
769 if (CurModule.CurrentModule->getGlobalVariable(Name, false)) {
770 // If we allow this GVar to get created, it will be renamed in the
771 // symbol table because it conflicts with an existing GVar. We can't
772 // allow redefinition of GVars whose linking indicates that their name
773 // must stay the same. Issue the error.
774 GenerateError("Redefinition of global variable named '" + Name +
775 "' of type '" + Ty->getDescription() + "'");
776 return 0;
777 }
778 }
779
780 // Otherwise there is no existing GV to use, create one now.
781 GlobalVariable *GV =
782 new GlobalVariable(Ty, isConstantGlobal, Linkage, Initializer, Name,
783 CurModule.CurrentModule, IsThreadLocal);
784 GV->setVisibility(Visibility);
785 InsertValue(GV, CurModule.Values);
786 return GV;
787}
788
789// setTypeName - Set the specified type to the name given. The name may be
790// null potentially, in which case this is a noop. The string passed in is
791// assumed to be a malloc'd string buffer, and is freed by this function.
792//
793// This function returns true if the type has already been defined, but is
794// allowed to be redefined in the specified context. If the name is a new name
795// for the type plane, it is inserted and false is returned.
796static bool setTypeName(const Type *T, std::string *NameStr) {
797 assert(!inFunctionScope() && "Can't give types function-local names!");
798 if (NameStr == 0) return false;
799
800 std::string Name(*NameStr); // Copy string
801 delete NameStr; // Free old string
802
803 // We don't allow assigning names to void type
804 if (T == Type::VoidTy) {
805 GenerateError("Can't assign name '" + Name + "' to the void type");
806 return false;
807 }
808
809 // Set the type name, checking for conflicts as we do so.
810 bool AlreadyExists = CurModule.CurrentModule->addTypeName(Name, T);
811
812 if (AlreadyExists) { // Inserting a name that is already defined???
813 const Type *Existing = CurModule.CurrentModule->getTypeByName(Name);
814 assert(Existing && "Conflict but no matching type?!");
815
816 // There is only one case where this is allowed: when we are refining an
817 // opaque type. In this case, Existing will be an opaque type.
818 if (const OpaqueType *OpTy = dyn_cast<OpaqueType>(Existing)) {
819 // We ARE replacing an opaque type!
820 const_cast<OpaqueType*>(OpTy)->refineAbstractTypeTo(T);
821 return true;
822 }
823
824 // Otherwise, this is an attempt to redefine a type. That's okay if
825 // the redefinition is identical to the original. This will be so if
826 // Existing and T point to the same Type object. In this one case we
827 // allow the equivalent redefinition.
828 if (Existing == T) return true; // Yes, it's equal.
829
830 // Any other kind of (non-equivalent) redefinition is an error.
831 GenerateError("Redefinition of type named '" + Name + "' of type '" +
832 T->getDescription() + "'");
833 }
834
835 return false;
836}
837
838//===----------------------------------------------------------------------===//
839// Code for handling upreferences in type names...
840//
841
842// TypeContains - Returns true if Ty directly contains E in it.
843//
844static bool TypeContains(const Type *Ty, const Type *E) {
845 return std::find(Ty->subtype_begin(), Ty->subtype_end(),
846 E) != Ty->subtype_end();
847}
848
849namespace {
850 struct UpRefRecord {
851 // NestingLevel - The number of nesting levels that need to be popped before
852 // this type is resolved.
853 unsigned NestingLevel;
854
855 // LastContainedTy - This is the type at the current binding level for the
856 // type. Every time we reduce the nesting level, this gets updated.
857 const Type *LastContainedTy;
858
859 // UpRefTy - This is the actual opaque type that the upreference is
860 // represented with.
861 OpaqueType *UpRefTy;
862
863 UpRefRecord(unsigned NL, OpaqueType *URTy)
864 : NestingLevel(NL), LastContainedTy(URTy), UpRefTy(URTy) {}
865 };
866}
867
868// UpRefs - A list of the outstanding upreferences that need to be resolved.
869static std::vector<UpRefRecord> UpRefs;
870
871/// HandleUpRefs - Every time we finish a new layer of types, this function is
872/// called. It loops through the UpRefs vector, which is a list of the
873/// currently active types. For each type, if the up reference is contained in
874/// the newly completed type, we decrement the level count. When the level
875/// count reaches zero, the upreferenced type is the type that is passed in:
876/// thus we can complete the cycle.
877///
878static PATypeHolder HandleUpRefs(const Type *ty) {
879 // If Ty isn't abstract, or if there are no up-references in it, then there is
880 // nothing to resolve here.
881 if (!ty->isAbstract() || UpRefs.empty()) return ty;
882
883 PATypeHolder Ty(ty);
884 UR_OUT("Type '" << Ty->getDescription() <<
885 "' newly formed. Resolving upreferences.\n" <<
886 UpRefs.size() << " upreferences active!\n");
887
888 // If we find any resolvable upreferences (i.e., those whose NestingLevel goes
889 // to zero), we resolve them all together before we resolve them to Ty. At
890 // the end of the loop, if there is anything to resolve to Ty, it will be in
891 // this variable.
892 OpaqueType *TypeToResolve = 0;
893
894 for (unsigned i = 0; i != UpRefs.size(); ++i) {
895 UR_OUT(" UR#" << i << " - TypeContains(" << Ty->getDescription() << ", "
896 << UpRefs[i].second->getDescription() << ") = "
897 << (TypeContains(Ty, UpRefs[i].second) ? "true" : "false") << "\n");
898 if (TypeContains(Ty, UpRefs[i].LastContainedTy)) {
899 // Decrement level of upreference
900 unsigned Level = --UpRefs[i].NestingLevel;
901 UpRefs[i].LastContainedTy = Ty;
902 UR_OUT(" Uplevel Ref Level = " << Level << "\n");
903 if (Level == 0) { // Upreference should be resolved!
904 if (!TypeToResolve) {
905 TypeToResolve = UpRefs[i].UpRefTy;
906 } else {
907 UR_OUT(" * Resolving upreference for "
908 << UpRefs[i].second->getDescription() << "\n";
909 std::string OldName = UpRefs[i].UpRefTy->getDescription());
910 UpRefs[i].UpRefTy->refineAbstractTypeTo(TypeToResolve);
911 UR_OUT(" * Type '" << OldName << "' refined upreference to: "
912 << (const void*)Ty << ", " << Ty->getDescription() << "\n");
913 }
914 UpRefs.erase(UpRefs.begin()+i); // Remove from upreference list...
915 --i; // Do not skip the next element...
916 }
917 }
918 }
919
920 if (TypeToResolve) {
921 UR_OUT(" * Resolving upreference for "
922 << UpRefs[i].second->getDescription() << "\n";
923 std::string OldName = TypeToResolve->getDescription());
924 TypeToResolve->refineAbstractTypeTo(Ty);
925 }
926
927 return Ty;
928}
929
930//===----------------------------------------------------------------------===//
931// RunVMAsmParser - Define an interface to this parser
932//===----------------------------------------------------------------------===//
933//
934static Module* RunParser(Module * M);
935
Duncan Sandsf5588dc2007-11-27 13:23:08 +0000936Module *llvm::RunVMAsmParser(llvm::MemoryBuffer *MB) {
937 InitLLLexer(MB);
938 Module *M = RunParser(new Module(LLLgetFilename()));
939 FreeLexer();
940 return M;
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000941}
942
943%}
944
945%union {
946 llvm::Module *ModuleVal;
947 llvm::Function *FunctionVal;
948 llvm::BasicBlock *BasicBlockVal;
949 llvm::TerminatorInst *TermInstVal;
950 llvm::Instruction *InstVal;
951 llvm::Constant *ConstVal;
952
953 const llvm::Type *PrimType;
954 std::list<llvm::PATypeHolder> *TypeList;
955 llvm::PATypeHolder *TypeVal;
956 llvm::Value *ValueVal;
957 std::vector<llvm::Value*> *ValueList;
958 llvm::ArgListType *ArgList;
959 llvm::TypeWithAttrs TypeWithAttrs;
960 llvm::TypeWithAttrsList *TypeWithAttrsList;
Dale Johannesencfb19e62007-11-05 21:20:28 +0000961 llvm::ParamList *ParamList;
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000962
963 // Represent the RHS of PHI node
964 std::list<std::pair<llvm::Value*,
965 llvm::BasicBlock*> > *PHIList;
966 std::vector<std::pair<llvm::Constant*, llvm::BasicBlock*> > *JumpTable;
967 std::vector<llvm::Constant*> *ConstVector;
968
969 llvm::GlobalValue::LinkageTypes Linkage;
970 llvm::GlobalValue::VisibilityTypes Visibility;
971 uint16_t ParamAttrs;
972 llvm::APInt *APIntVal;
973 int64_t SInt64Val;
974 uint64_t UInt64Val;
975 int SIntVal;
976 unsigned UIntVal;
Dale Johannesenb9de9f02007-09-06 18:13:44 +0000977 llvm::APFloat *FPVal;
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000978 bool BoolVal;
979
980 std::string *StrVal; // This memory must be deleted
981 llvm::ValID ValIDVal;
982
983 llvm::Instruction::BinaryOps BinaryOpVal;
984 llvm::Instruction::TermOps TermOpVal;
985 llvm::Instruction::MemoryOps MemOpVal;
986 llvm::Instruction::CastOps CastOpVal;
987 llvm::Instruction::OtherOps OtherOpVal;
988 llvm::ICmpInst::Predicate IPredicate;
989 llvm::FCmpInst::Predicate FPredicate;
990}
991
992%type <ModuleVal> Module
993%type <FunctionVal> Function FunctionProto FunctionHeader BasicBlockList
994%type <BasicBlockVal> BasicBlock InstructionList
995%type <TermInstVal> BBTerminatorInst
996%type <InstVal> Inst InstVal MemoryInst
997%type <ConstVal> ConstVal ConstExpr AliaseeRef
998%type <ConstVector> ConstVector
999%type <ArgList> ArgList ArgListH
1000%type <PHIList> PHIList
Dale Johannesencfb19e62007-11-05 21:20:28 +00001001%type <ParamList> ParamList // For call param lists & GEP indices
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001002%type <ValueList> IndexList // For GEP indices
1003%type <TypeList> TypeListI
1004%type <TypeWithAttrsList> ArgTypeList ArgTypeListI
1005%type <TypeWithAttrs> ArgType
1006%type <JumpTable> JumpTable
1007%type <BoolVal> GlobalType // GLOBAL or CONSTANT?
1008%type <BoolVal> ThreadLocal // 'thread_local' or not
1009%type <BoolVal> OptVolatile // 'volatile' or not
1010%type <BoolVal> OptTailCall // TAIL CALL or plain CALL.
1011%type <BoolVal> OptSideEffect // 'sideeffect' or not.
1012%type <Linkage> GVInternalLinkage GVExternalLinkage
1013%type <Linkage> FunctionDefineLinkage FunctionDeclareLinkage
1014%type <Linkage> AliasLinkage
1015%type <Visibility> GVVisibilityStyle
1016
1017// ValueRef - Unresolved reference to a definition or BB
1018%type <ValIDVal> ValueRef ConstValueRef SymbolicValueRef
1019%type <ValueVal> ResolvedVal // <type> <valref> pair
1020// Tokens and types for handling constant integer values
1021//
1022// ESINT64VAL - A negative number within long long range
1023%token <SInt64Val> ESINT64VAL
1024
1025// EUINT64VAL - A positive number within uns. long long range
1026%token <UInt64Val> EUINT64VAL
1027
1028// ESAPINTVAL - A negative number with arbitrary precision
1029%token <APIntVal> ESAPINTVAL
1030
1031// EUAPINTVAL - A positive number with arbitrary precision
1032%token <APIntVal> EUAPINTVAL
1033
1034%token <UIntVal> LOCALVAL_ID GLOBALVAL_ID // %123 @123
1035%token <FPVal> FPVAL // Float or Double constant
1036
1037// Built in types...
1038%type <TypeVal> Types ResultTypes
1039%type <PrimType> IntType FPType PrimType // Classifications
1040%token <PrimType> VOID INTTYPE
Dale Johannesenf325d9f2007-08-03 01:03:46 +00001041%token <PrimType> FLOAT DOUBLE X86_FP80 FP128 PPC_FP128 LABEL
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001042%token TYPE
1043
1044
1045%token<StrVal> LOCALVAR GLOBALVAR LABELSTR
1046%token<StrVal> STRINGCONSTANT ATSTRINGCONSTANT PCTSTRINGCONSTANT
1047%type <StrVal> LocalName OptLocalName OptLocalAssign
1048%type <StrVal> GlobalName OptGlobalAssign GlobalAssign
1049%type <StrVal> OptSection SectionString
1050
1051%type <UIntVal> OptAlign OptCAlign
1052
1053%token ZEROINITIALIZER TRUETOK FALSETOK BEGINTOK ENDTOK
1054%token DECLARE DEFINE GLOBAL CONSTANT SECTION ALIAS VOLATILE THREAD_LOCAL
1055%token TO DOTDOTDOT NULL_TOK UNDEF INTERNAL LINKONCE WEAK APPENDING
1056%token DLLIMPORT DLLEXPORT EXTERN_WEAK
1057%token OPAQUE EXTERNAL TARGET TRIPLE ALIGN
1058%token DEPLIBS CALL TAIL ASM_TOK MODULE SIDEEFFECT
1059%token CC_TOK CCC_TOK FASTCC_TOK COLDCC_TOK X86_STDCALLCC_TOK X86_FASTCALLCC_TOK
1060%token DATALAYOUT
1061%type <UIntVal> OptCallingConv
1062%type <ParamAttrs> OptParamAttrs ParamAttr
1063%type <ParamAttrs> OptFuncAttrs FuncAttr
1064
1065// Basic Block Terminating Operators
1066%token <TermOpVal> RET BR SWITCH INVOKE UNWIND UNREACHABLE
1067
1068// Binary Operators
1069%type <BinaryOpVal> ArithmeticOps LogicalOps // Binops Subcatagories
1070%token <BinaryOpVal> ADD SUB MUL UDIV SDIV FDIV UREM SREM FREM AND OR XOR
1071%token <BinaryOpVal> SHL LSHR ASHR
1072
1073%token <OtherOpVal> ICMP FCMP
1074%type <IPredicate> IPredicates
1075%type <FPredicate> FPredicates
1076%token EQ NE SLT SGT SLE SGE ULT UGT ULE UGE
1077%token OEQ ONE OLT OGT OLE OGE ORD UNO UEQ UNE
1078
1079// Memory Instructions
1080%token <MemOpVal> MALLOC ALLOCA FREE LOAD STORE GETELEMENTPTR
1081
1082// Cast Operators
1083%type <CastOpVal> CastOps
1084%token <CastOpVal> TRUNC ZEXT SEXT FPTRUNC FPEXT BITCAST
1085%token <CastOpVal> UITOFP SITOFP FPTOUI FPTOSI INTTOPTR PTRTOINT
1086
1087// Other Operators
1088%token <OtherOpVal> PHI_TOK SELECT VAARG
1089%token <OtherOpVal> EXTRACTELEMENT INSERTELEMENT SHUFFLEVECTOR
1090
1091// Function Attributes
Reid Spenceraa8ae282007-07-31 03:50:36 +00001092%token SIGNEXT ZEROEXT NORETURN INREG SRET NOUNWIND NOALIAS BYVAL NEST
Duncan Sandsf5588dc2007-11-27 13:23:08 +00001093%token READNONE READONLY
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001094
1095// Visibility Styles
1096%token DEFAULT HIDDEN PROTECTED
1097
1098%start Module
1099%%
1100
1101
1102// Operations that are notably excluded from this list include:
1103// RET, BR, & SWITCH because they end basic blocks and are treated specially.
1104//
1105ArithmeticOps: ADD | SUB | MUL | UDIV | SDIV | FDIV | UREM | SREM | FREM;
1106LogicalOps : SHL | LSHR | ASHR | AND | OR | XOR;
1107CastOps : TRUNC | ZEXT | SEXT | FPTRUNC | FPEXT | BITCAST |
1108 UITOFP | SITOFP | FPTOUI | FPTOSI | INTTOPTR | PTRTOINT;
1109
1110IPredicates
1111 : EQ { $$ = ICmpInst::ICMP_EQ; } | NE { $$ = ICmpInst::ICMP_NE; }
1112 | SLT { $$ = ICmpInst::ICMP_SLT; } | SGT { $$ = ICmpInst::ICMP_SGT; }
1113 | SLE { $$ = ICmpInst::ICMP_SLE; } | SGE { $$ = ICmpInst::ICMP_SGE; }
1114 | ULT { $$ = ICmpInst::ICMP_ULT; } | UGT { $$ = ICmpInst::ICMP_UGT; }
1115 | ULE { $$ = ICmpInst::ICMP_ULE; } | UGE { $$ = ICmpInst::ICMP_UGE; }
1116 ;
1117
1118FPredicates
1119 : OEQ { $$ = FCmpInst::FCMP_OEQ; } | ONE { $$ = FCmpInst::FCMP_ONE; }
1120 | OLT { $$ = FCmpInst::FCMP_OLT; } | OGT { $$ = FCmpInst::FCMP_OGT; }
1121 | OLE { $$ = FCmpInst::FCMP_OLE; } | OGE { $$ = FCmpInst::FCMP_OGE; }
1122 | ORD { $$ = FCmpInst::FCMP_ORD; } | UNO { $$ = FCmpInst::FCMP_UNO; }
1123 | UEQ { $$ = FCmpInst::FCMP_UEQ; } | UNE { $$ = FCmpInst::FCMP_UNE; }
1124 | ULT { $$ = FCmpInst::FCMP_ULT; } | UGT { $$ = FCmpInst::FCMP_UGT; }
1125 | ULE { $$ = FCmpInst::FCMP_ULE; } | UGE { $$ = FCmpInst::FCMP_UGE; }
1126 | TRUETOK { $$ = FCmpInst::FCMP_TRUE; }
1127 | FALSETOK { $$ = FCmpInst::FCMP_FALSE; }
1128 ;
1129
1130// These are some types that allow classification if we only want a particular
1131// thing... for example, only a signed, unsigned, or integral type.
1132IntType : INTTYPE;
Dale Johannesenf325d9f2007-08-03 01:03:46 +00001133FPType : FLOAT | DOUBLE | PPC_FP128 | FP128 | X86_FP80;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001134
1135LocalName : LOCALVAR | STRINGCONSTANT | PCTSTRINGCONSTANT ;
1136OptLocalName : LocalName | /*empty*/ { $$ = 0; };
1137
1138/// OptLocalAssign - Value producing statements have an optional assignment
1139/// component.
1140OptLocalAssign : LocalName '=' {
1141 $$ = $1;
1142 CHECK_FOR_ERROR
1143 }
1144 | /*empty*/ {
1145 $$ = 0;
1146 CHECK_FOR_ERROR
1147 };
1148
1149GlobalName : GLOBALVAR | ATSTRINGCONSTANT ;
1150
1151OptGlobalAssign : GlobalAssign
1152 | /*empty*/ {
1153 $$ = 0;
1154 CHECK_FOR_ERROR
1155 };
1156
1157GlobalAssign : GlobalName '=' {
1158 $$ = $1;
1159 CHECK_FOR_ERROR
1160 };
1161
1162GVInternalLinkage
1163 : INTERNAL { $$ = GlobalValue::InternalLinkage; }
1164 | WEAK { $$ = GlobalValue::WeakLinkage; }
1165 | LINKONCE { $$ = GlobalValue::LinkOnceLinkage; }
1166 | APPENDING { $$ = GlobalValue::AppendingLinkage; }
1167 | DLLEXPORT { $$ = GlobalValue::DLLExportLinkage; }
1168 ;
1169
1170GVExternalLinkage
1171 : DLLIMPORT { $$ = GlobalValue::DLLImportLinkage; }
1172 | EXTERN_WEAK { $$ = GlobalValue::ExternalWeakLinkage; }
1173 | EXTERNAL { $$ = GlobalValue::ExternalLinkage; }
1174 ;
1175
1176GVVisibilityStyle
1177 : /*empty*/ { $$ = GlobalValue::DefaultVisibility; }
1178 | DEFAULT { $$ = GlobalValue::DefaultVisibility; }
1179 | HIDDEN { $$ = GlobalValue::HiddenVisibility; }
1180 | PROTECTED { $$ = GlobalValue::ProtectedVisibility; }
1181 ;
1182
1183FunctionDeclareLinkage
1184 : /*empty*/ { $$ = GlobalValue::ExternalLinkage; }
1185 | DLLIMPORT { $$ = GlobalValue::DLLImportLinkage; }
1186 | EXTERN_WEAK { $$ = GlobalValue::ExternalWeakLinkage; }
1187 ;
1188
1189FunctionDefineLinkage
1190 : /*empty*/ { $$ = GlobalValue::ExternalLinkage; }
1191 | INTERNAL { $$ = GlobalValue::InternalLinkage; }
1192 | LINKONCE { $$ = GlobalValue::LinkOnceLinkage; }
1193 | WEAK { $$ = GlobalValue::WeakLinkage; }
1194 | DLLEXPORT { $$ = GlobalValue::DLLExportLinkage; }
1195 ;
1196
1197AliasLinkage
1198 : /*empty*/ { $$ = GlobalValue::ExternalLinkage; }
1199 | WEAK { $$ = GlobalValue::WeakLinkage; }
1200 | INTERNAL { $$ = GlobalValue::InternalLinkage; }
1201 ;
1202
1203OptCallingConv : /*empty*/ { $$ = CallingConv::C; } |
1204 CCC_TOK { $$ = CallingConv::C; } |
1205 FASTCC_TOK { $$ = CallingConv::Fast; } |
1206 COLDCC_TOK { $$ = CallingConv::Cold; } |
1207 X86_STDCALLCC_TOK { $$ = CallingConv::X86_StdCall; } |
1208 X86_FASTCALLCC_TOK { $$ = CallingConv::X86_FastCall; } |
1209 CC_TOK EUINT64VAL {
1210 if ((unsigned)$2 != $2)
1211 GEN_ERROR("Calling conv too large");
1212 $$ = $2;
1213 CHECK_FOR_ERROR
1214 };
1215
Reid Spenceraa8ae282007-07-31 03:50:36 +00001216ParamAttr : ZEROEXT { $$ = ParamAttr::ZExt; }
1217 | ZEXT { $$ = ParamAttr::ZExt; }
1218 | SIGNEXT { $$ = ParamAttr::SExt; }
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001219 | SEXT { $$ = ParamAttr::SExt; }
1220 | INREG { $$ = ParamAttr::InReg; }
1221 | SRET { $$ = ParamAttr::StructRet; }
1222 | NOALIAS { $$ = ParamAttr::NoAlias; }
Reid Spenceraa8ae282007-07-31 03:50:36 +00001223 | BYVAL { $$ = ParamAttr::ByVal; }
1224 | NEST { $$ = ParamAttr::Nest; }
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001225 ;
1226
1227OptParamAttrs : /* empty */ { $$ = ParamAttr::None; }
1228 | OptParamAttrs ParamAttr {
1229 $$ = $1 | $2;
1230 }
1231 ;
1232
1233FuncAttr : NORETURN { $$ = ParamAttr::NoReturn; }
1234 | NOUNWIND { $$ = ParamAttr::NoUnwind; }
Reid Spenceraa8ae282007-07-31 03:50:36 +00001235 | ZEROEXT { $$ = ParamAttr::ZExt; }
1236 | SIGNEXT { $$ = ParamAttr::SExt; }
Duncan Sandsf5588dc2007-11-27 13:23:08 +00001237 | READNONE { $$ = ParamAttr::ReadNone; }
1238 | READONLY { $$ = ParamAttr::ReadOnly; }
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001239 ;
1240
1241OptFuncAttrs : /* empty */ { $$ = ParamAttr::None; }
1242 | OptFuncAttrs FuncAttr {
1243 $$ = $1 | $2;
1244 }
1245 ;
1246
1247// OptAlign/OptCAlign - An optional alignment, and an optional alignment with
1248// a comma before it.
1249OptAlign : /*empty*/ { $$ = 0; } |
1250 ALIGN EUINT64VAL {
1251 $$ = $2;
1252 if ($$ != 0 && !isPowerOf2_32($$))
1253 GEN_ERROR("Alignment must be a power of two");
1254 CHECK_FOR_ERROR
1255};
1256OptCAlign : /*empty*/ { $$ = 0; } |
1257 ',' ALIGN EUINT64VAL {
1258 $$ = $3;
1259 if ($$ != 0 && !isPowerOf2_32($$))
1260 GEN_ERROR("Alignment must be a power of two");
1261 CHECK_FOR_ERROR
1262};
1263
1264
1265SectionString : SECTION STRINGCONSTANT {
1266 for (unsigned i = 0, e = $2->length(); i != e; ++i)
1267 if ((*$2)[i] == '"' || (*$2)[i] == '\\')
1268 GEN_ERROR("Invalid character in section name");
1269 $$ = $2;
1270 CHECK_FOR_ERROR
1271};
1272
1273OptSection : /*empty*/ { $$ = 0; } |
1274 SectionString { $$ = $1; };
1275
1276// GlobalVarAttributes - Used to pass the attributes string on a global. CurGV
1277// is set to be the global we are processing.
1278//
1279GlobalVarAttributes : /* empty */ {} |
1280 ',' GlobalVarAttribute GlobalVarAttributes {};
1281GlobalVarAttribute : SectionString {
1282 CurGV->setSection(*$1);
1283 delete $1;
1284 CHECK_FOR_ERROR
1285 }
1286 | ALIGN EUINT64VAL {
1287 if ($2 != 0 && !isPowerOf2_32($2))
1288 GEN_ERROR("Alignment must be a power of two");
1289 CurGV->setAlignment($2);
1290 CHECK_FOR_ERROR
1291 };
1292
1293//===----------------------------------------------------------------------===//
1294// Types includes all predefined types... except void, because it can only be
1295// used in specific contexts (function returning void for example).
1296
1297// Derived types are added later...
1298//
Dale Johannesenf325d9f2007-08-03 01:03:46 +00001299PrimType : INTTYPE | FLOAT | DOUBLE | PPC_FP128 | FP128 | X86_FP80 | LABEL ;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001300
1301Types
1302 : OPAQUE {
1303 $$ = new PATypeHolder(OpaqueType::get());
1304 CHECK_FOR_ERROR
1305 }
1306 | PrimType {
1307 $$ = new PATypeHolder($1);
1308 CHECK_FOR_ERROR
1309 }
1310 | Types '*' { // Pointer type?
1311 if (*$1 == Type::LabelTy)
1312 GEN_ERROR("Cannot form a pointer to a basic block");
1313 $$ = new PATypeHolder(HandleUpRefs(PointerType::get(*$1)));
1314 delete $1;
1315 CHECK_FOR_ERROR
1316 }
1317 | SymbolicValueRef { // Named types are also simple types...
1318 const Type* tmp = getTypeVal($1);
1319 CHECK_FOR_ERROR
1320 $$ = new PATypeHolder(tmp);
1321 }
1322 | '\\' EUINT64VAL { // Type UpReference
1323 if ($2 > (uint64_t)~0U) GEN_ERROR("Value out of range");
1324 OpaqueType *OT = OpaqueType::get(); // Use temporary placeholder
1325 UpRefs.push_back(UpRefRecord((unsigned)$2, OT)); // Add to vector...
1326 $$ = new PATypeHolder(OT);
1327 UR_OUT("New Upreference!\n");
1328 CHECK_FOR_ERROR
1329 }
1330 | Types '(' ArgTypeListI ')' OptFuncAttrs {
Duncan Sandsf5588dc2007-11-27 13:23:08 +00001331 // Allow but ignore attributes on function types; this permits auto-upgrade.
1332 // FIXME: remove in LLVM 3.0.
Anton Korobeynikova2c02272007-12-03 19:16:54 +00001333 const Type* RetTy = *$1;
1334 if (!(RetTy->isFirstClassType() || isa<OpaqueType>(RetTy)))
1335 GEN_ERROR("LLVM Functions cannot return aggregates");
1336
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001337 std::vector<const Type*> Params;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001338 TypeWithAttrsList::iterator I = $3->begin(), E = $3->end();
Duncan Sandsf5588dc2007-11-27 13:23:08 +00001339 for (; I != E; ++I ) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001340 const Type *Ty = I->Ty->get();
Anton Korobeynikova2c02272007-12-03 19:16:54 +00001341 if (!(Ty->isFirstClassType() || isa<OpaqueType>(Ty)))
1342 GEN_ERROR("Function arguments must be value types!");
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001343 Params.push_back(Ty);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001344 }
Anton Korobeynikova2c02272007-12-03 19:16:54 +00001345 CHECK_FOR_ERROR
1346
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001347 bool isVarArg = Params.size() && Params.back() == Type::VoidTy;
1348 if (isVarArg) Params.pop_back();
1349
Anton Korobeynikova2c02272007-12-03 19:16:54 +00001350 FunctionType *FT = FunctionType::get(RetTy, Params, isVarArg);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001351 delete $3; // Delete the argument list
1352 delete $1; // Delete the return type handle
1353 $$ = new PATypeHolder(HandleUpRefs(FT));
1354 CHECK_FOR_ERROR
1355 }
1356 | VOID '(' ArgTypeListI ')' OptFuncAttrs {
Duncan Sandsf5588dc2007-11-27 13:23:08 +00001357 // Allow but ignore attributes on function types; this permits auto-upgrade.
1358 // FIXME: remove in LLVM 3.0.
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001359 std::vector<const Type*> Params;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001360 TypeWithAttrsList::iterator I = $3->begin(), E = $3->end();
Duncan Sandsf5588dc2007-11-27 13:23:08 +00001361 for ( ; I != E; ++I ) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001362 const Type* Ty = I->Ty->get();
Anton Korobeynikova2c02272007-12-03 19:16:54 +00001363 if (!(Ty->isFirstClassType() || isa<OpaqueType>(Ty)))
1364 GEN_ERROR("Function arguments must be value types!");
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001365 Params.push_back(Ty);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001366 }
Anton Korobeynikova2c02272007-12-03 19:16:54 +00001367 CHECK_FOR_ERROR
1368
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001369 bool isVarArg = Params.size() && Params.back() == Type::VoidTy;
1370 if (isVarArg) Params.pop_back();
1371
Duncan Sandsf5588dc2007-11-27 13:23:08 +00001372 FunctionType *FT = FunctionType::get($1, Params, isVarArg);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001373 delete $3; // Delete the argument list
1374 $$ = new PATypeHolder(HandleUpRefs(FT));
1375 CHECK_FOR_ERROR
1376 }
1377
1378 | '[' EUINT64VAL 'x' Types ']' { // Sized array type?
1379 $$ = new PATypeHolder(HandleUpRefs(ArrayType::get(*$4, (unsigned)$2)));
1380 delete $4;
1381 CHECK_FOR_ERROR
1382 }
1383 | '<' EUINT64VAL 'x' Types '>' { // Vector type?
1384 const llvm::Type* ElemTy = $4->get();
1385 if ((unsigned)$2 != $2)
1386 GEN_ERROR("Unsigned result not equal to signed result");
1387 if (!ElemTy->isFloatingPoint() && !ElemTy->isInteger())
1388 GEN_ERROR("Element type of a VectorType must be primitive");
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001389 $$ = new PATypeHolder(HandleUpRefs(VectorType::get(*$4, (unsigned)$2)));
1390 delete $4;
1391 CHECK_FOR_ERROR
1392 }
1393 | '{' TypeListI '}' { // Structure type?
1394 std::vector<const Type*> Elements;
1395 for (std::list<llvm::PATypeHolder>::iterator I = $2->begin(),
1396 E = $2->end(); I != E; ++I)
1397 Elements.push_back(*I);
1398
1399 $$ = new PATypeHolder(HandleUpRefs(StructType::get(Elements)));
1400 delete $2;
1401 CHECK_FOR_ERROR
1402 }
1403 | '{' '}' { // Empty structure type?
1404 $$ = new PATypeHolder(StructType::get(std::vector<const Type*>()));
1405 CHECK_FOR_ERROR
1406 }
1407 | '<' '{' TypeListI '}' '>' {
1408 std::vector<const Type*> Elements;
1409 for (std::list<llvm::PATypeHolder>::iterator I = $3->begin(),
1410 E = $3->end(); I != E; ++I)
1411 Elements.push_back(*I);
1412
1413 $$ = new PATypeHolder(HandleUpRefs(StructType::get(Elements, true)));
1414 delete $3;
1415 CHECK_FOR_ERROR
1416 }
1417 | '<' '{' '}' '>' { // Empty structure type?
1418 $$ = new PATypeHolder(StructType::get(std::vector<const Type*>(), true));
1419 CHECK_FOR_ERROR
1420 }
1421 ;
1422
1423ArgType
Duncan Sandsf5588dc2007-11-27 13:23:08 +00001424 : Types OptParamAttrs {
1425 // Allow but ignore attributes on function types; this permits auto-upgrade.
1426 // FIXME: remove in LLVM 3.0.
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001427 $$.Ty = $1;
Duncan Sandsf5588dc2007-11-27 13:23:08 +00001428 $$.Attrs = ParamAttr::None;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001429 }
1430 ;
1431
1432ResultTypes
1433 : Types {
1434 if (!UpRefs.empty())
1435 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1436 if (!(*$1)->isFirstClassType())
1437 GEN_ERROR("LLVM functions cannot return aggregate types");
1438 $$ = $1;
1439 }
1440 | VOID {
1441 $$ = new PATypeHolder(Type::VoidTy);
1442 }
1443 ;
1444
1445ArgTypeList : ArgType {
1446 $$ = new TypeWithAttrsList();
1447 $$->push_back($1);
1448 CHECK_FOR_ERROR
1449 }
1450 | ArgTypeList ',' ArgType {
1451 ($$=$1)->push_back($3);
1452 CHECK_FOR_ERROR
1453 }
1454 ;
1455
1456ArgTypeListI
1457 : ArgTypeList
1458 | ArgTypeList ',' DOTDOTDOT {
1459 $$=$1;
1460 TypeWithAttrs TWA; TWA.Attrs = ParamAttr::None;
1461 TWA.Ty = new PATypeHolder(Type::VoidTy);
1462 $$->push_back(TWA);
1463 CHECK_FOR_ERROR
1464 }
1465 | DOTDOTDOT {
1466 $$ = new TypeWithAttrsList;
1467 TypeWithAttrs TWA; TWA.Attrs = ParamAttr::None;
1468 TWA.Ty = new PATypeHolder(Type::VoidTy);
1469 $$->push_back(TWA);
1470 CHECK_FOR_ERROR
1471 }
1472 | /*empty*/ {
1473 $$ = new TypeWithAttrsList();
1474 CHECK_FOR_ERROR
1475 };
1476
1477// TypeList - Used for struct declarations and as a basis for function type
1478// declaration type lists
1479//
1480TypeListI : Types {
1481 $$ = new std::list<PATypeHolder>();
1482 $$->push_back(*$1);
1483 delete $1;
1484 CHECK_FOR_ERROR
1485 }
1486 | TypeListI ',' Types {
1487 ($$=$1)->push_back(*$3);
1488 delete $3;
1489 CHECK_FOR_ERROR
1490 };
1491
1492// ConstVal - The various declarations that go into the constant pool. This
1493// production is used ONLY to represent constants that show up AFTER a 'const',
1494// 'constant' or 'global' token at global scope. Constants that can be inlined
1495// into other expressions (such as integers and constexprs) are handled by the
1496// ResolvedVal, ValueRef and ConstValueRef productions.
1497//
1498ConstVal: Types '[' ConstVector ']' { // Nonempty unsized arr
1499 if (!UpRefs.empty())
1500 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1501 const ArrayType *ATy = dyn_cast<ArrayType>($1->get());
1502 if (ATy == 0)
1503 GEN_ERROR("Cannot make array constant with type: '" +
1504 (*$1)->getDescription() + "'");
1505 const Type *ETy = ATy->getElementType();
1506 int NumElements = ATy->getNumElements();
1507
1508 // Verify that we have the correct size...
1509 if (NumElements != -1 && NumElements != (int)$3->size())
1510 GEN_ERROR("Type mismatch: constant sized array initialized with " +
1511 utostr($3->size()) + " arguments, but has size of " +
1512 itostr(NumElements) + "");
1513
1514 // Verify all elements are correct type!
1515 for (unsigned i = 0; i < $3->size(); i++) {
1516 if (ETy != (*$3)[i]->getType())
1517 GEN_ERROR("Element #" + utostr(i) + " is not of type '" +
1518 ETy->getDescription() +"' as required!\nIt is of type '"+
1519 (*$3)[i]->getType()->getDescription() + "'.");
1520 }
1521
1522 $$ = ConstantArray::get(ATy, *$3);
1523 delete $1; delete $3;
1524 CHECK_FOR_ERROR
1525 }
1526 | Types '[' ']' {
1527 if (!UpRefs.empty())
1528 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1529 const ArrayType *ATy = dyn_cast<ArrayType>($1->get());
1530 if (ATy == 0)
1531 GEN_ERROR("Cannot make array constant with type: '" +
1532 (*$1)->getDescription() + "'");
1533
1534 int NumElements = ATy->getNumElements();
1535 if (NumElements != -1 && NumElements != 0)
1536 GEN_ERROR("Type mismatch: constant sized array initialized with 0"
1537 " arguments, but has size of " + itostr(NumElements) +"");
1538 $$ = ConstantArray::get(ATy, std::vector<Constant*>());
1539 delete $1;
1540 CHECK_FOR_ERROR
1541 }
1542 | Types 'c' STRINGCONSTANT {
1543 if (!UpRefs.empty())
1544 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1545 const ArrayType *ATy = dyn_cast<ArrayType>($1->get());
1546 if (ATy == 0)
1547 GEN_ERROR("Cannot make array constant with type: '" +
1548 (*$1)->getDescription() + "'");
1549
1550 int NumElements = ATy->getNumElements();
1551 const Type *ETy = ATy->getElementType();
1552 if (NumElements != -1 && NumElements != int($3->length()))
1553 GEN_ERROR("Can't build string constant of size " +
1554 itostr((int)($3->length())) +
1555 " when array has size " + itostr(NumElements) + "");
1556 std::vector<Constant*> Vals;
1557 if (ETy == Type::Int8Ty) {
1558 for (unsigned i = 0; i < $3->length(); ++i)
1559 Vals.push_back(ConstantInt::get(ETy, (*$3)[i]));
1560 } else {
1561 delete $3;
1562 GEN_ERROR("Cannot build string arrays of non byte sized elements");
1563 }
1564 delete $3;
1565 $$ = ConstantArray::get(ATy, Vals);
1566 delete $1;
1567 CHECK_FOR_ERROR
1568 }
1569 | Types '<' ConstVector '>' { // Nonempty unsized arr
1570 if (!UpRefs.empty())
1571 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1572 const VectorType *PTy = dyn_cast<VectorType>($1->get());
1573 if (PTy == 0)
1574 GEN_ERROR("Cannot make packed constant with type: '" +
1575 (*$1)->getDescription() + "'");
1576 const Type *ETy = PTy->getElementType();
1577 int NumElements = PTy->getNumElements();
1578
1579 // Verify that we have the correct size...
1580 if (NumElements != -1 && NumElements != (int)$3->size())
1581 GEN_ERROR("Type mismatch: constant sized packed initialized with " +
1582 utostr($3->size()) + " arguments, but has size of " +
1583 itostr(NumElements) + "");
1584
1585 // Verify all elements are correct type!
1586 for (unsigned i = 0; i < $3->size(); i++) {
1587 if (ETy != (*$3)[i]->getType())
1588 GEN_ERROR("Element #" + utostr(i) + " is not of type '" +
1589 ETy->getDescription() +"' as required!\nIt is of type '"+
1590 (*$3)[i]->getType()->getDescription() + "'.");
1591 }
1592
1593 $$ = ConstantVector::get(PTy, *$3);
1594 delete $1; delete $3;
1595 CHECK_FOR_ERROR
1596 }
1597 | Types '{' ConstVector '}' {
1598 const StructType *STy = dyn_cast<StructType>($1->get());
1599 if (STy == 0)
1600 GEN_ERROR("Cannot make struct constant with type: '" +
1601 (*$1)->getDescription() + "'");
1602
1603 if ($3->size() != STy->getNumContainedTypes())
1604 GEN_ERROR("Illegal number of initializers for structure type");
1605
1606 // Check to ensure that constants are compatible with the type initializer!
1607 for (unsigned i = 0, e = $3->size(); i != e; ++i)
1608 if ((*$3)[i]->getType() != STy->getElementType(i))
1609 GEN_ERROR("Expected type '" +
1610 STy->getElementType(i)->getDescription() +
1611 "' for element #" + utostr(i) +
1612 " of structure initializer");
1613
1614 // Check to ensure that Type is not packed
1615 if (STy->isPacked())
1616 GEN_ERROR("Unpacked Initializer to vector type '" +
1617 STy->getDescription() + "'");
1618
1619 $$ = ConstantStruct::get(STy, *$3);
1620 delete $1; delete $3;
1621 CHECK_FOR_ERROR
1622 }
1623 | Types '{' '}' {
1624 if (!UpRefs.empty())
1625 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1626 const StructType *STy = dyn_cast<StructType>($1->get());
1627 if (STy == 0)
1628 GEN_ERROR("Cannot make struct constant with type: '" +
1629 (*$1)->getDescription() + "'");
1630
1631 if (STy->getNumContainedTypes() != 0)
1632 GEN_ERROR("Illegal number of initializers for structure type");
1633
1634 // Check to ensure that Type is not packed
1635 if (STy->isPacked())
1636 GEN_ERROR("Unpacked Initializer to vector type '" +
1637 STy->getDescription() + "'");
1638
1639 $$ = ConstantStruct::get(STy, std::vector<Constant*>());
1640 delete $1;
1641 CHECK_FOR_ERROR
1642 }
1643 | Types '<' '{' ConstVector '}' '>' {
1644 const StructType *STy = dyn_cast<StructType>($1->get());
1645 if (STy == 0)
1646 GEN_ERROR("Cannot make struct constant with type: '" +
1647 (*$1)->getDescription() + "'");
1648
1649 if ($4->size() != STy->getNumContainedTypes())
1650 GEN_ERROR("Illegal number of initializers for structure type");
1651
1652 // Check to ensure that constants are compatible with the type initializer!
1653 for (unsigned i = 0, e = $4->size(); i != e; ++i)
1654 if ((*$4)[i]->getType() != STy->getElementType(i))
1655 GEN_ERROR("Expected type '" +
1656 STy->getElementType(i)->getDescription() +
1657 "' for element #" + utostr(i) +
1658 " of structure initializer");
1659
1660 // Check to ensure that Type is packed
1661 if (!STy->isPacked())
1662 GEN_ERROR("Vector initializer to non-vector type '" +
1663 STy->getDescription() + "'");
1664
1665 $$ = ConstantStruct::get(STy, *$4);
1666 delete $1; delete $4;
1667 CHECK_FOR_ERROR
1668 }
1669 | Types '<' '{' '}' '>' {
1670 if (!UpRefs.empty())
1671 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1672 const StructType *STy = dyn_cast<StructType>($1->get());
1673 if (STy == 0)
1674 GEN_ERROR("Cannot make struct constant with type: '" +
1675 (*$1)->getDescription() + "'");
1676
1677 if (STy->getNumContainedTypes() != 0)
1678 GEN_ERROR("Illegal number of initializers for structure type");
1679
1680 // Check to ensure that Type is packed
1681 if (!STy->isPacked())
1682 GEN_ERROR("Vector initializer to non-vector type '" +
1683 STy->getDescription() + "'");
1684
1685 $$ = ConstantStruct::get(STy, std::vector<Constant*>());
1686 delete $1;
1687 CHECK_FOR_ERROR
1688 }
1689 | Types NULL_TOK {
1690 if (!UpRefs.empty())
1691 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1692 const PointerType *PTy = dyn_cast<PointerType>($1->get());
1693 if (PTy == 0)
1694 GEN_ERROR("Cannot make null pointer constant with type: '" +
1695 (*$1)->getDescription() + "'");
1696
1697 $$ = ConstantPointerNull::get(PTy);
1698 delete $1;
1699 CHECK_FOR_ERROR
1700 }
1701 | Types UNDEF {
1702 if (!UpRefs.empty())
1703 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1704 $$ = UndefValue::get($1->get());
1705 delete $1;
1706 CHECK_FOR_ERROR
1707 }
1708 | Types SymbolicValueRef {
1709 if (!UpRefs.empty())
1710 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1711 const PointerType *Ty = dyn_cast<PointerType>($1->get());
1712 if (Ty == 0)
1713 GEN_ERROR("Global const reference must be a pointer type");
1714
1715 // ConstExprs can exist in the body of a function, thus creating
1716 // GlobalValues whenever they refer to a variable. Because we are in
1717 // the context of a function, getExistingVal will search the functions
1718 // symbol table instead of the module symbol table for the global symbol,
1719 // which throws things all off. To get around this, we just tell
1720 // getExistingVal that we are at global scope here.
1721 //
1722 Function *SavedCurFn = CurFun.CurrentFunction;
1723 CurFun.CurrentFunction = 0;
1724
1725 Value *V = getExistingVal(Ty, $2);
1726 CHECK_FOR_ERROR
1727
1728 CurFun.CurrentFunction = SavedCurFn;
1729
1730 // If this is an initializer for a constant pointer, which is referencing a
1731 // (currently) undefined variable, create a stub now that shall be replaced
1732 // in the future with the right type of variable.
1733 //
1734 if (V == 0) {
1735 assert(isa<PointerType>(Ty) && "Globals may only be used as pointers!");
1736 const PointerType *PT = cast<PointerType>(Ty);
1737
1738 // First check to see if the forward references value is already created!
1739 PerModuleInfo::GlobalRefsType::iterator I =
1740 CurModule.GlobalRefs.find(std::make_pair(PT, $2));
1741
1742 if (I != CurModule.GlobalRefs.end()) {
1743 V = I->second; // Placeholder already exists, use it...
1744 $2.destroy();
1745 } else {
1746 std::string Name;
1747 if ($2.Type == ValID::GlobalName)
1748 Name = $2.getName();
1749 else if ($2.Type != ValID::GlobalID)
1750 GEN_ERROR("Invalid reference to global");
1751
1752 // Create the forward referenced global.
1753 GlobalValue *GV;
1754 if (const FunctionType *FTy =
1755 dyn_cast<FunctionType>(PT->getElementType())) {
1756 GV = new Function(FTy, GlobalValue::ExternalWeakLinkage, Name,
1757 CurModule.CurrentModule);
1758 } else {
1759 GV = new GlobalVariable(PT->getElementType(), false,
1760 GlobalValue::ExternalWeakLinkage, 0,
1761 Name, CurModule.CurrentModule);
1762 }
1763
1764 // Keep track of the fact that we have a forward ref to recycle it
1765 CurModule.GlobalRefs.insert(std::make_pair(std::make_pair(PT, $2), GV));
1766 V = GV;
1767 }
1768 }
1769
1770 $$ = cast<GlobalValue>(V);
1771 delete $1; // Free the type handle
1772 CHECK_FOR_ERROR
1773 }
1774 | Types ConstExpr {
1775 if (!UpRefs.empty())
1776 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1777 if ($1->get() != $2->getType())
1778 GEN_ERROR("Mismatched types for constant expression: " +
1779 (*$1)->getDescription() + " and " + $2->getType()->getDescription());
1780 $$ = $2;
1781 delete $1;
1782 CHECK_FOR_ERROR
1783 }
1784 | Types ZEROINITIALIZER {
1785 if (!UpRefs.empty())
1786 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
1787 const Type *Ty = $1->get();
1788 if (isa<FunctionType>(Ty) || Ty == Type::LabelTy || isa<OpaqueType>(Ty))
1789 GEN_ERROR("Cannot create a null initialized value of this type");
1790 $$ = Constant::getNullValue(Ty);
1791 delete $1;
1792 CHECK_FOR_ERROR
1793 }
1794 | IntType ESINT64VAL { // integral constants
1795 if (!ConstantInt::isValueValidForType($1, $2))
1796 GEN_ERROR("Constant value doesn't fit in type");
1797 $$ = ConstantInt::get($1, $2, true);
1798 CHECK_FOR_ERROR
1799 }
1800 | IntType ESAPINTVAL { // arbitrary precision integer constants
1801 uint32_t BitWidth = cast<IntegerType>($1)->getBitWidth();
1802 if ($2->getBitWidth() > BitWidth) {
1803 GEN_ERROR("Constant value does not fit in type");
1804 }
1805 $2->sextOrTrunc(BitWidth);
1806 $$ = ConstantInt::get(*$2);
1807 delete $2;
1808 CHECK_FOR_ERROR
1809 }
1810 | IntType EUINT64VAL { // integral constants
1811 if (!ConstantInt::isValueValidForType($1, $2))
1812 GEN_ERROR("Constant value doesn't fit in type");
1813 $$ = ConstantInt::get($1, $2, false);
1814 CHECK_FOR_ERROR
1815 }
1816 | IntType EUAPINTVAL { // arbitrary precision integer constants
1817 uint32_t BitWidth = cast<IntegerType>($1)->getBitWidth();
1818 if ($2->getBitWidth() > BitWidth) {
1819 GEN_ERROR("Constant value does not fit in type");
1820 }
1821 $2->zextOrTrunc(BitWidth);
1822 $$ = ConstantInt::get(*$2);
1823 delete $2;
1824 CHECK_FOR_ERROR
1825 }
1826 | INTTYPE TRUETOK { // Boolean constants
1827 assert(cast<IntegerType>($1)->getBitWidth() == 1 && "Not Bool?");
1828 $$ = ConstantInt::getTrue();
1829 CHECK_FOR_ERROR
1830 }
1831 | INTTYPE FALSETOK { // Boolean constants
1832 assert(cast<IntegerType>($1)->getBitWidth() == 1 && "Not Bool?");
1833 $$ = ConstantInt::getFalse();
1834 CHECK_FOR_ERROR
1835 }
Dale Johannesen043064d2007-09-12 03:31:28 +00001836 | FPType FPVAL { // Floating point constants
Dale Johannesenb9de9f02007-09-06 18:13:44 +00001837 if (!ConstantFP::isValueValidForType($1, *$2))
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001838 GEN_ERROR("Floating point constant invalid for type");
Dale Johannesen255b8fe2007-09-11 18:33:39 +00001839 // Lexer has no type info, so builds all float and double FP constants
1840 // as double. Fix this here. Long double is done right.
1841 if (&$2->getSemantics()==&APFloat::IEEEdouble && $1==Type::FloatTy)
Dale Johannesenb9de9f02007-09-06 18:13:44 +00001842 $2->convert(APFloat::IEEEsingle, APFloat::rmNearestTiesToEven);
1843 $$ = ConstantFP::get($1, *$2);
Dale Johannesen3afee192007-09-07 21:07:57 +00001844 delete $2;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001845 CHECK_FOR_ERROR
1846 };
1847
1848
1849ConstExpr: CastOps '(' ConstVal TO Types ')' {
1850 if (!UpRefs.empty())
1851 GEN_ERROR("Invalid upreference in type: " + (*$5)->getDescription());
1852 Constant *Val = $3;
1853 const Type *DestTy = $5->get();
1854 if (!CastInst::castIsValid($1, $3, DestTy))
1855 GEN_ERROR("invalid cast opcode for cast from '" +
1856 Val->getType()->getDescription() + "' to '" +
1857 DestTy->getDescription() + "'");
1858 $$ = ConstantExpr::getCast($1, $3, DestTy);
1859 delete $5;
1860 }
1861 | GETELEMENTPTR '(' ConstVal IndexList ')' {
1862 if (!isa<PointerType>($3->getType()))
1863 GEN_ERROR("GetElementPtr requires a pointer operand");
1864
1865 const Type *IdxTy =
David Greene48556392007-09-04 18:46:50 +00001866 GetElementPtrInst::getIndexedType($3->getType(), $4->begin(), $4->end(),
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001867 true);
1868 if (!IdxTy)
1869 GEN_ERROR("Index list invalid for constant getelementptr");
1870
1871 SmallVector<Constant*, 8> IdxVec;
1872 for (unsigned i = 0, e = $4->size(); i != e; ++i)
1873 if (Constant *C = dyn_cast<Constant>((*$4)[i]))
1874 IdxVec.push_back(C);
1875 else
1876 GEN_ERROR("Indices to constant getelementptr must be constants");
1877
1878 delete $4;
1879
1880 $$ = ConstantExpr::getGetElementPtr($3, &IdxVec[0], IdxVec.size());
1881 CHECK_FOR_ERROR
1882 }
1883 | SELECT '(' ConstVal ',' ConstVal ',' ConstVal ')' {
1884 if ($3->getType() != Type::Int1Ty)
1885 GEN_ERROR("Select condition must be of boolean type");
1886 if ($5->getType() != $7->getType())
1887 GEN_ERROR("Select operand types must match");
1888 $$ = ConstantExpr::getSelect($3, $5, $7);
1889 CHECK_FOR_ERROR
1890 }
1891 | ArithmeticOps '(' ConstVal ',' ConstVal ')' {
1892 if ($3->getType() != $5->getType())
1893 GEN_ERROR("Binary operator types must match");
1894 CHECK_FOR_ERROR;
1895 $$ = ConstantExpr::get($1, $3, $5);
1896 }
1897 | LogicalOps '(' ConstVal ',' ConstVal ')' {
1898 if ($3->getType() != $5->getType())
1899 GEN_ERROR("Logical operator types must match");
1900 if (!$3->getType()->isInteger()) {
1901 if (Instruction::isShift($1) || !isa<VectorType>($3->getType()) ||
1902 !cast<VectorType>($3->getType())->getElementType()->isInteger())
1903 GEN_ERROR("Logical operator requires integral operands");
1904 }
1905 $$ = ConstantExpr::get($1, $3, $5);
1906 CHECK_FOR_ERROR
1907 }
1908 | ICMP IPredicates '(' ConstVal ',' ConstVal ')' {
1909 if ($4->getType() != $6->getType())
1910 GEN_ERROR("icmp operand types must match");
1911 $$ = ConstantExpr::getICmp($2, $4, $6);
1912 }
1913 | FCMP FPredicates '(' ConstVal ',' ConstVal ')' {
1914 if ($4->getType() != $6->getType())
1915 GEN_ERROR("fcmp operand types must match");
1916 $$ = ConstantExpr::getFCmp($2, $4, $6);
1917 }
1918 | EXTRACTELEMENT '(' ConstVal ',' ConstVal ')' {
1919 if (!ExtractElementInst::isValidOperands($3, $5))
1920 GEN_ERROR("Invalid extractelement operands");
1921 $$ = ConstantExpr::getExtractElement($3, $5);
1922 CHECK_FOR_ERROR
1923 }
1924 | INSERTELEMENT '(' ConstVal ',' ConstVal ',' ConstVal ')' {
1925 if (!InsertElementInst::isValidOperands($3, $5, $7))
1926 GEN_ERROR("Invalid insertelement operands");
1927 $$ = ConstantExpr::getInsertElement($3, $5, $7);
1928 CHECK_FOR_ERROR
1929 }
1930 | SHUFFLEVECTOR '(' ConstVal ',' ConstVal ',' ConstVal ')' {
1931 if (!ShuffleVectorInst::isValidOperands($3, $5, $7))
1932 GEN_ERROR("Invalid shufflevector operands");
1933 $$ = ConstantExpr::getShuffleVector($3, $5, $7);
1934 CHECK_FOR_ERROR
1935 };
1936
1937
1938// ConstVector - A list of comma separated constants.
1939ConstVector : ConstVector ',' ConstVal {
1940 ($$ = $1)->push_back($3);
1941 CHECK_FOR_ERROR
1942 }
1943 | ConstVal {
1944 $$ = new std::vector<Constant*>();
1945 $$->push_back($1);
1946 CHECK_FOR_ERROR
1947 };
1948
1949
1950// GlobalType - Match either GLOBAL or CONSTANT for global declarations...
1951GlobalType : GLOBAL { $$ = false; } | CONSTANT { $$ = true; };
1952
1953// ThreadLocal
1954ThreadLocal : THREAD_LOCAL { $$ = true; } | { $$ = false; };
1955
1956// AliaseeRef - Match either GlobalValue or bitcast to GlobalValue.
1957AliaseeRef : ResultTypes SymbolicValueRef {
1958 const Type* VTy = $1->get();
1959 Value *V = getVal(VTy, $2);
Chris Lattnerbb856a32007-08-06 21:00:46 +00001960 CHECK_FOR_ERROR
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001961 GlobalValue* Aliasee = dyn_cast<GlobalValue>(V);
1962 if (!Aliasee)
1963 GEN_ERROR("Aliases can be created only to global values");
1964
1965 $$ = Aliasee;
1966 CHECK_FOR_ERROR
1967 delete $1;
1968 }
1969 | BITCAST '(' AliaseeRef TO Types ')' {
1970 Constant *Val = $3;
1971 const Type *DestTy = $5->get();
1972 if (!CastInst::castIsValid($1, $3, DestTy))
1973 GEN_ERROR("invalid cast opcode for cast from '" +
1974 Val->getType()->getDescription() + "' to '" +
1975 DestTy->getDescription() + "'");
1976
1977 $$ = ConstantExpr::getCast($1, $3, DestTy);
1978 CHECK_FOR_ERROR
1979 delete $5;
1980 };
1981
1982//===----------------------------------------------------------------------===//
1983// Rules to match Modules
1984//===----------------------------------------------------------------------===//
1985
1986// Module rule: Capture the result of parsing the whole file into a result
1987// variable...
1988//
1989Module
1990 : DefinitionList {
1991 $$ = ParserResult = CurModule.CurrentModule;
1992 CurModule.ModuleDone();
1993 CHECK_FOR_ERROR;
1994 }
1995 | /*empty*/ {
1996 $$ = ParserResult = CurModule.CurrentModule;
1997 CurModule.ModuleDone();
1998 CHECK_FOR_ERROR;
1999 }
2000 ;
2001
2002DefinitionList
2003 : Definition
2004 | DefinitionList Definition
2005 ;
2006
2007Definition
2008 : DEFINE { CurFun.isDeclare = false; } Function {
2009 CurFun.FunctionDone();
2010 CHECK_FOR_ERROR
2011 }
2012 | DECLARE { CurFun.isDeclare = true; } FunctionProto {
2013 CHECK_FOR_ERROR
2014 }
2015 | MODULE ASM_TOK AsmBlock {
2016 CHECK_FOR_ERROR
2017 }
2018 | OptLocalAssign TYPE Types {
2019 if (!UpRefs.empty())
2020 GEN_ERROR("Invalid upreference in type: " + (*$3)->getDescription());
2021 // Eagerly resolve types. This is not an optimization, this is a
2022 // requirement that is due to the fact that we could have this:
2023 //
2024 // %list = type { %list * }
2025 // %list = type { %list * } ; repeated type decl
2026 //
2027 // If types are not resolved eagerly, then the two types will not be
2028 // determined to be the same type!
2029 //
2030 ResolveTypeTo($1, *$3);
2031
2032 if (!setTypeName(*$3, $1) && !$1) {
2033 CHECK_FOR_ERROR
2034 // If this is a named type that is not a redefinition, add it to the slot
2035 // table.
2036 CurModule.Types.push_back(*$3);
2037 }
2038
2039 delete $3;
2040 CHECK_FOR_ERROR
2041 }
2042 | OptLocalAssign TYPE VOID {
2043 ResolveTypeTo($1, $3);
2044
2045 if (!setTypeName($3, $1) && !$1) {
2046 CHECK_FOR_ERROR
2047 // If this is a named type that is not a redefinition, add it to the slot
2048 // table.
2049 CurModule.Types.push_back($3);
2050 }
2051 CHECK_FOR_ERROR
2052 }
2053 | OptGlobalAssign GVVisibilityStyle ThreadLocal GlobalType ConstVal {
2054 /* "Externally Visible" Linkage */
2055 if ($5 == 0)
2056 GEN_ERROR("Global value initializer is not a constant");
2057 CurGV = ParseGlobalVariable($1, GlobalValue::ExternalLinkage,
2058 $2, $4, $5->getType(), $5, $3);
2059 CHECK_FOR_ERROR
2060 } GlobalVarAttributes {
2061 CurGV = 0;
2062 }
2063 | OptGlobalAssign GVInternalLinkage GVVisibilityStyle ThreadLocal GlobalType
2064 ConstVal {
2065 if ($6 == 0)
2066 GEN_ERROR("Global value initializer is not a constant");
2067 CurGV = ParseGlobalVariable($1, $2, $3, $5, $6->getType(), $6, $4);
2068 CHECK_FOR_ERROR
2069 } GlobalVarAttributes {
2070 CurGV = 0;
2071 }
2072 | OptGlobalAssign GVExternalLinkage GVVisibilityStyle ThreadLocal GlobalType
2073 Types {
2074 if (!UpRefs.empty())
2075 GEN_ERROR("Invalid upreference in type: " + (*$6)->getDescription());
2076 CurGV = ParseGlobalVariable($1, $2, $3, $5, *$6, 0, $4);
2077 CHECK_FOR_ERROR
2078 delete $6;
2079 } GlobalVarAttributes {
2080 CurGV = 0;
2081 CHECK_FOR_ERROR
2082 }
2083 | OptGlobalAssign GVVisibilityStyle ALIAS AliasLinkage AliaseeRef {
2084 std::string Name;
2085 if ($1) {
2086 Name = *$1;
2087 delete $1;
2088 }
2089 if (Name.empty())
2090 GEN_ERROR("Alias name cannot be empty");
2091
2092 Constant* Aliasee = $5;
2093 if (Aliasee == 0)
2094 GEN_ERROR(std::string("Invalid aliasee for alias: ") + Name);
2095
2096 GlobalAlias* GA = new GlobalAlias(Aliasee->getType(), $4, Name, Aliasee,
2097 CurModule.CurrentModule);
2098 GA->setVisibility($2);
2099 InsertValue(GA, CurModule.Values);
Chris Lattner5eefce32007-09-10 23:24:14 +00002100
2101
2102 // If there was a forward reference of this alias, resolve it now.
2103
2104 ValID ID;
2105 if (!Name.empty())
2106 ID = ValID::createGlobalName(Name);
2107 else
2108 ID = ValID::createGlobalID(CurModule.Values.size()-1);
2109
2110 if (GlobalValue *FWGV =
2111 CurModule.GetForwardRefForGlobal(GA->getType(), ID)) {
2112 // Replace uses of the fwdref with the actual alias.
2113 FWGV->replaceAllUsesWith(GA);
2114 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(FWGV))
2115 GV->eraseFromParent();
2116 else
2117 cast<Function>(FWGV)->eraseFromParent();
2118 }
2119 ID.destroy();
2120
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002121 CHECK_FOR_ERROR
2122 }
2123 | TARGET TargetDefinition {
2124 CHECK_FOR_ERROR
2125 }
2126 | DEPLIBS '=' LibrariesDefinition {
2127 CHECK_FOR_ERROR
2128 }
2129 ;
2130
2131
2132AsmBlock : STRINGCONSTANT {
2133 const std::string &AsmSoFar = CurModule.CurrentModule->getModuleInlineAsm();
2134 if (AsmSoFar.empty())
2135 CurModule.CurrentModule->setModuleInlineAsm(*$1);
2136 else
2137 CurModule.CurrentModule->setModuleInlineAsm(AsmSoFar+"\n"+*$1);
2138 delete $1;
2139 CHECK_FOR_ERROR
2140};
2141
2142TargetDefinition : TRIPLE '=' STRINGCONSTANT {
2143 CurModule.CurrentModule->setTargetTriple(*$3);
2144 delete $3;
2145 }
2146 | DATALAYOUT '=' STRINGCONSTANT {
2147 CurModule.CurrentModule->setDataLayout(*$3);
2148 delete $3;
2149 };
2150
2151LibrariesDefinition : '[' LibList ']';
2152
2153LibList : LibList ',' STRINGCONSTANT {
2154 CurModule.CurrentModule->addLibrary(*$3);
2155 delete $3;
2156 CHECK_FOR_ERROR
2157 }
2158 | STRINGCONSTANT {
2159 CurModule.CurrentModule->addLibrary(*$1);
2160 delete $1;
2161 CHECK_FOR_ERROR
2162 }
2163 | /* empty: end of list */ {
2164 CHECK_FOR_ERROR
2165 }
2166 ;
2167
2168//===----------------------------------------------------------------------===//
2169// Rules to match Function Headers
2170//===----------------------------------------------------------------------===//
2171
2172ArgListH : ArgListH ',' Types OptParamAttrs OptLocalName {
2173 if (!UpRefs.empty())
2174 GEN_ERROR("Invalid upreference in type: " + (*$3)->getDescription());
2175 if (*$3 == Type::VoidTy)
2176 GEN_ERROR("void typed arguments are invalid");
2177 ArgListEntry E; E.Attrs = $4; E.Ty = $3; E.Name = $5;
2178 $$ = $1;
2179 $1->push_back(E);
2180 CHECK_FOR_ERROR
2181 }
2182 | Types OptParamAttrs OptLocalName {
2183 if (!UpRefs.empty())
2184 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
2185 if (*$1 == Type::VoidTy)
2186 GEN_ERROR("void typed arguments are invalid");
2187 ArgListEntry E; E.Attrs = $2; E.Ty = $1; E.Name = $3;
2188 $$ = new ArgListType;
2189 $$->push_back(E);
2190 CHECK_FOR_ERROR
2191 };
2192
2193ArgList : ArgListH {
2194 $$ = $1;
2195 CHECK_FOR_ERROR
2196 }
2197 | ArgListH ',' DOTDOTDOT {
2198 $$ = $1;
2199 struct ArgListEntry E;
2200 E.Ty = new PATypeHolder(Type::VoidTy);
2201 E.Name = 0;
2202 E.Attrs = ParamAttr::None;
2203 $$->push_back(E);
2204 CHECK_FOR_ERROR
2205 }
2206 | DOTDOTDOT {
2207 $$ = new ArgListType;
2208 struct ArgListEntry E;
2209 E.Ty = new PATypeHolder(Type::VoidTy);
2210 E.Name = 0;
2211 E.Attrs = ParamAttr::None;
2212 $$->push_back(E);
2213 CHECK_FOR_ERROR
2214 }
2215 | /* empty */ {
2216 $$ = 0;
2217 CHECK_FOR_ERROR
2218 };
2219
2220FunctionHeaderH : OptCallingConv ResultTypes GlobalName '(' ArgList ')'
2221 OptFuncAttrs OptSection OptAlign {
2222 std::string FunctionName(*$3);
2223 delete $3; // Free strdup'd memory!
2224
2225 // Check the function result for abstractness if this is a define. We should
2226 // have no abstract types at this point
2227 if (!CurFun.isDeclare && CurModule.TypeIsUnresolved($2))
2228 GEN_ERROR("Reference to abstract result: "+ $2->get()->getDescription());
2229
2230 std::vector<const Type*> ParamTypeList;
2231 ParamAttrsVector Attrs;
2232 if ($7 != ParamAttr::None) {
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002233 ParamAttrsWithIndex PAWI;
2234 PAWI.index = 0;
2235 PAWI.attrs = $7;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002236 Attrs.push_back(PAWI);
2237 }
2238 if ($5) { // If there are arguments...
2239 unsigned index = 1;
2240 for (ArgListType::iterator I = $5->begin(); I != $5->end(); ++I, ++index) {
2241 const Type* Ty = I->Ty->get();
2242 if (!CurFun.isDeclare && CurModule.TypeIsUnresolved(I->Ty))
2243 GEN_ERROR("Reference to abstract argument: " + Ty->getDescription());
2244 ParamTypeList.push_back(Ty);
2245 if (Ty != Type::VoidTy)
2246 if (I->Attrs != ParamAttr::None) {
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002247 ParamAttrsWithIndex PAWI;
2248 PAWI.index = index;
2249 PAWI.attrs = I->Attrs;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002250 Attrs.push_back(PAWI);
2251 }
2252 }
2253 }
2254
2255 bool isVarArg = ParamTypeList.size() && ParamTypeList.back() == Type::VoidTy;
2256 if (isVarArg) ParamTypeList.pop_back();
2257
Duncan Sands637ec552007-11-28 17:07:01 +00002258 const ParamAttrsList *PAL = 0;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002259 if (!Attrs.empty())
2260 PAL = ParamAttrsList::get(Attrs);
2261
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002262 FunctionType *FT = FunctionType::get(*$2, ParamTypeList, isVarArg);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002263 const PointerType *PFT = PointerType::get(FT);
2264 delete $2;
2265
2266 ValID ID;
2267 if (!FunctionName.empty()) {
2268 ID = ValID::createGlobalName((char*)FunctionName.c_str());
2269 } else {
2270 ID = ValID::createGlobalID(CurModule.Values.size());
2271 }
2272
2273 Function *Fn = 0;
2274 // See if this function was forward referenced. If so, recycle the object.
2275 if (GlobalValue *FWRef = CurModule.GetForwardRefForGlobal(PFT, ID)) {
2276 // Move the function to the end of the list, from whereever it was
2277 // previously inserted.
2278 Fn = cast<Function>(FWRef);
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002279 assert(!Fn->getParamAttrs() && "Forward reference has parameter attributes!");
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002280 CurModule.CurrentModule->getFunctionList().remove(Fn);
2281 CurModule.CurrentModule->getFunctionList().push_back(Fn);
2282 } else if (!FunctionName.empty() && // Merge with an earlier prototype?
2283 (Fn = CurModule.CurrentModule->getFunction(FunctionName))) {
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002284 if (Fn->getFunctionType() != FT ) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002285 // The existing function doesn't have the same type. This is an overload
2286 // error.
2287 GEN_ERROR("Overload of function '" + FunctionName + "' not permitted.");
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002288 } else if (Fn->getParamAttrs() != PAL) {
2289 // The existing function doesn't have the same parameter attributes.
2290 // This is an overload error.
2291 GEN_ERROR("Overload of function '" + FunctionName + "' not permitted.");
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002292 } else if (!CurFun.isDeclare && !Fn->isDeclaration()) {
2293 // Neither the existing or the current function is a declaration and they
2294 // have the same name and same type. Clearly this is a redefinition.
2295 GEN_ERROR("Redefinition of function '" + FunctionName + "'");
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002296 } else if (Fn->isDeclaration()) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002297 // Make sure to strip off any argument names so we can't get conflicts.
2298 for (Function::arg_iterator AI = Fn->arg_begin(), AE = Fn->arg_end();
2299 AI != AE; ++AI)
2300 AI->setName("");
2301 }
2302 } else { // Not already defined?
2303 Fn = new Function(FT, GlobalValue::ExternalWeakLinkage, FunctionName,
2304 CurModule.CurrentModule);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002305 InsertValue(Fn, CurModule.Values);
2306 }
2307
2308 CurFun.FunctionStart(Fn);
2309
2310 if (CurFun.isDeclare) {
2311 // If we have declaration, always overwrite linkage. This will allow us to
2312 // correctly handle cases, when pointer to function is passed as argument to
2313 // another function.
2314 Fn->setLinkage(CurFun.Linkage);
2315 Fn->setVisibility(CurFun.Visibility);
2316 }
2317 Fn->setCallingConv($1);
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002318 Fn->setParamAttrs(PAL);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002319 Fn->setAlignment($9);
2320 if ($8) {
2321 Fn->setSection(*$8);
2322 delete $8;
2323 }
2324
2325 // Add all of the arguments we parsed to the function...
2326 if ($5) { // Is null if empty...
2327 if (isVarArg) { // Nuke the last entry
2328 assert($5->back().Ty->get() == Type::VoidTy && $5->back().Name == 0 &&
2329 "Not a varargs marker!");
2330 delete $5->back().Ty;
2331 $5->pop_back(); // Delete the last entry
2332 }
2333 Function::arg_iterator ArgIt = Fn->arg_begin();
2334 Function::arg_iterator ArgEnd = Fn->arg_end();
2335 unsigned Idx = 1;
2336 for (ArgListType::iterator I = $5->begin();
2337 I != $5->end() && ArgIt != ArgEnd; ++I, ++ArgIt) {
2338 delete I->Ty; // Delete the typeholder...
2339 setValueName(ArgIt, I->Name); // Insert arg into symtab...
2340 CHECK_FOR_ERROR
2341 InsertValue(ArgIt);
2342 Idx++;
2343 }
2344
2345 delete $5; // We're now done with the argument list
2346 }
2347 CHECK_FOR_ERROR
2348};
2349
2350BEGIN : BEGINTOK | '{'; // Allow BEGIN or '{' to start a function
2351
2352FunctionHeader : FunctionDefineLinkage GVVisibilityStyle FunctionHeaderH BEGIN {
2353 $$ = CurFun.CurrentFunction;
2354
2355 // Make sure that we keep track of the linkage type even if there was a
2356 // previous "declare".
2357 $$->setLinkage($1);
2358 $$->setVisibility($2);
2359};
2360
2361END : ENDTOK | '}'; // Allow end of '}' to end a function
2362
2363Function : BasicBlockList END {
2364 $$ = $1;
2365 CHECK_FOR_ERROR
2366};
2367
2368FunctionProto : FunctionDeclareLinkage GVVisibilityStyle FunctionHeaderH {
2369 CurFun.CurrentFunction->setLinkage($1);
2370 CurFun.CurrentFunction->setVisibility($2);
2371 $$ = CurFun.CurrentFunction;
2372 CurFun.FunctionDone();
2373 CHECK_FOR_ERROR
2374 };
2375
2376//===----------------------------------------------------------------------===//
2377// Rules to match Basic Blocks
2378//===----------------------------------------------------------------------===//
2379
2380OptSideEffect : /* empty */ {
2381 $$ = false;
2382 CHECK_FOR_ERROR
2383 }
2384 | SIDEEFFECT {
2385 $$ = true;
2386 CHECK_FOR_ERROR
2387 };
2388
2389ConstValueRef : ESINT64VAL { // A reference to a direct constant
2390 $$ = ValID::create($1);
2391 CHECK_FOR_ERROR
2392 }
2393 | EUINT64VAL {
2394 $$ = ValID::create($1);
2395 CHECK_FOR_ERROR
2396 }
2397 | FPVAL { // Perhaps it's an FP constant?
2398 $$ = ValID::create($1);
2399 CHECK_FOR_ERROR
2400 }
2401 | TRUETOK {
2402 $$ = ValID::create(ConstantInt::getTrue());
2403 CHECK_FOR_ERROR
2404 }
2405 | FALSETOK {
2406 $$ = ValID::create(ConstantInt::getFalse());
2407 CHECK_FOR_ERROR
2408 }
2409 | NULL_TOK {
2410 $$ = ValID::createNull();
2411 CHECK_FOR_ERROR
2412 }
2413 | UNDEF {
2414 $$ = ValID::createUndef();
2415 CHECK_FOR_ERROR
2416 }
2417 | ZEROINITIALIZER { // A vector zero constant.
2418 $$ = ValID::createZeroInit();
2419 CHECK_FOR_ERROR
2420 }
2421 | '<' ConstVector '>' { // Nonempty unsized packed vector
2422 const Type *ETy = (*$2)[0]->getType();
2423 int NumElements = $2->size();
2424
2425 VectorType* pt = VectorType::get(ETy, NumElements);
2426 PATypeHolder* PTy = new PATypeHolder(
2427 HandleUpRefs(
2428 VectorType::get(
2429 ETy,
2430 NumElements)
2431 )
2432 );
2433
2434 // Verify all elements are correct type!
2435 for (unsigned i = 0; i < $2->size(); i++) {
2436 if (ETy != (*$2)[i]->getType())
2437 GEN_ERROR("Element #" + utostr(i) + " is not of type '" +
2438 ETy->getDescription() +"' as required!\nIt is of type '" +
2439 (*$2)[i]->getType()->getDescription() + "'.");
2440 }
2441
2442 $$ = ValID::create(ConstantVector::get(pt, *$2));
2443 delete PTy; delete $2;
2444 CHECK_FOR_ERROR
2445 }
2446 | ConstExpr {
2447 $$ = ValID::create($1);
2448 CHECK_FOR_ERROR
2449 }
2450 | ASM_TOK OptSideEffect STRINGCONSTANT ',' STRINGCONSTANT {
2451 $$ = ValID::createInlineAsm(*$3, *$5, $2);
2452 delete $3;
2453 delete $5;
2454 CHECK_FOR_ERROR
2455 };
2456
2457// SymbolicValueRef - Reference to one of two ways of symbolically refering to
2458// another value.
2459//
2460SymbolicValueRef : LOCALVAL_ID { // Is it an integer reference...?
2461 $$ = ValID::createLocalID($1);
2462 CHECK_FOR_ERROR
2463 }
2464 | GLOBALVAL_ID {
2465 $$ = ValID::createGlobalID($1);
2466 CHECK_FOR_ERROR
2467 }
2468 | LocalName { // Is it a named reference...?
2469 $$ = ValID::createLocalName(*$1);
2470 delete $1;
2471 CHECK_FOR_ERROR
2472 }
2473 | GlobalName { // Is it a named reference...?
2474 $$ = ValID::createGlobalName(*$1);
2475 delete $1;
2476 CHECK_FOR_ERROR
2477 };
2478
2479// ValueRef - A reference to a definition... either constant or symbolic
2480ValueRef : SymbolicValueRef | ConstValueRef;
2481
2482
2483// ResolvedVal - a <type> <value> pair. This is used only in cases where the
2484// type immediately preceeds the value reference, and allows complex constant
2485// pool references (for things like: 'ret [2 x int] [ int 12, int 42]')
2486ResolvedVal : Types ValueRef {
2487 if (!UpRefs.empty())
2488 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
2489 $$ = getVal(*$1, $2);
2490 delete $1;
2491 CHECK_FOR_ERROR
2492 }
2493 ;
2494
2495BasicBlockList : BasicBlockList BasicBlock {
2496 $$ = $1;
2497 CHECK_FOR_ERROR
2498 }
2499 | FunctionHeader BasicBlock { // Do not allow functions with 0 basic blocks
2500 $$ = $1;
2501 CHECK_FOR_ERROR
2502 };
2503
2504
2505// Basic blocks are terminated by branching instructions:
2506// br, br/cc, switch, ret
2507//
2508BasicBlock : InstructionList OptLocalAssign BBTerminatorInst {
2509 setValueName($3, $2);
2510 CHECK_FOR_ERROR
2511 InsertValue($3);
2512 $1->getInstList().push_back($3);
2513 $$ = $1;
2514 CHECK_FOR_ERROR
2515 };
2516
2517InstructionList : InstructionList Inst {
2518 if (CastInst *CI1 = dyn_cast<CastInst>($2))
2519 if (CastInst *CI2 = dyn_cast<CastInst>(CI1->getOperand(0)))
2520 if (CI2->getParent() == 0)
2521 $1->getInstList().push_back(CI2);
2522 $1->getInstList().push_back($2);
2523 $$ = $1;
2524 CHECK_FOR_ERROR
2525 }
2526 | /* empty */ { // Empty space between instruction lists
2527 $$ = defineBBVal(ValID::createLocalID(CurFun.NextValNum));
2528 CHECK_FOR_ERROR
2529 }
2530 | LABELSTR { // Labelled (named) basic block
2531 $$ = defineBBVal(ValID::createLocalName(*$1));
2532 delete $1;
2533 CHECK_FOR_ERROR
2534
2535 };
2536
2537BBTerminatorInst : RET ResolvedVal { // Return with a result...
2538 $$ = new ReturnInst($2);
2539 CHECK_FOR_ERROR
2540 }
2541 | RET VOID { // Return with no result...
2542 $$ = new ReturnInst();
2543 CHECK_FOR_ERROR
2544 }
2545 | BR LABEL ValueRef { // Unconditional Branch...
2546 BasicBlock* tmpBB = getBBVal($3);
2547 CHECK_FOR_ERROR
2548 $$ = new BranchInst(tmpBB);
2549 } // Conditional Branch...
2550 | BR INTTYPE ValueRef ',' LABEL ValueRef ',' LABEL ValueRef {
2551 assert(cast<IntegerType>($2)->getBitWidth() == 1 && "Not Bool?");
2552 BasicBlock* tmpBBA = getBBVal($6);
2553 CHECK_FOR_ERROR
2554 BasicBlock* tmpBBB = getBBVal($9);
2555 CHECK_FOR_ERROR
2556 Value* tmpVal = getVal(Type::Int1Ty, $3);
2557 CHECK_FOR_ERROR
2558 $$ = new BranchInst(tmpBBA, tmpBBB, tmpVal);
2559 }
2560 | SWITCH IntType ValueRef ',' LABEL ValueRef '[' JumpTable ']' {
2561 Value* tmpVal = getVal($2, $3);
2562 CHECK_FOR_ERROR
2563 BasicBlock* tmpBB = getBBVal($6);
2564 CHECK_FOR_ERROR
2565 SwitchInst *S = new SwitchInst(tmpVal, tmpBB, $8->size());
2566 $$ = S;
2567
2568 std::vector<std::pair<Constant*,BasicBlock*> >::iterator I = $8->begin(),
2569 E = $8->end();
2570 for (; I != E; ++I) {
2571 if (ConstantInt *CI = dyn_cast<ConstantInt>(I->first))
2572 S->addCase(CI, I->second);
2573 else
2574 GEN_ERROR("Switch case is constant, but not a simple integer");
2575 }
2576 delete $8;
2577 CHECK_FOR_ERROR
2578 }
2579 | SWITCH IntType ValueRef ',' LABEL ValueRef '[' ']' {
2580 Value* tmpVal = getVal($2, $3);
2581 CHECK_FOR_ERROR
2582 BasicBlock* tmpBB = getBBVal($6);
2583 CHECK_FOR_ERROR
2584 SwitchInst *S = new SwitchInst(tmpVal, tmpBB, 0);
2585 $$ = S;
2586 CHECK_FOR_ERROR
2587 }
Dale Johannesencfb19e62007-11-05 21:20:28 +00002588 | INVOKE OptCallingConv ResultTypes ValueRef '(' ParamList ')' OptFuncAttrs
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002589 TO LABEL ValueRef UNWIND LABEL ValueRef {
2590
2591 // Handle the short syntax
2592 const PointerType *PFTy = 0;
2593 const FunctionType *Ty = 0;
2594 if (!(PFTy = dyn_cast<PointerType>($3->get())) ||
2595 !(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) {
2596 // Pull out the types of all of the arguments...
2597 std::vector<const Type*> ParamTypes;
Dale Johannesencfb19e62007-11-05 21:20:28 +00002598 ParamList::iterator I = $6->begin(), E = $6->end();
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002599 for (; I != E; ++I) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002600 const Type *Ty = I->Val->getType();
2601 if (Ty == Type::VoidTy)
2602 GEN_ERROR("Short call syntax cannot be used with varargs");
2603 ParamTypes.push_back(Ty);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002604 }
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002605 Ty = FunctionType::get($3->get(), ParamTypes, false);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002606 PFTy = PointerType::get(Ty);
2607 }
2608
2609 delete $3;
2610
2611 Value *V = getVal(PFTy, $4); // Get the function we're calling...
2612 CHECK_FOR_ERROR
2613 BasicBlock *Normal = getBBVal($11);
2614 CHECK_FOR_ERROR
2615 BasicBlock *Except = getBBVal($14);
2616 CHECK_FOR_ERROR
2617
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002618 ParamAttrsVector Attrs;
2619 if ($8 != ParamAttr::None) {
2620 ParamAttrsWithIndex PAWI; PAWI.index = 0; PAWI.attrs = $8;
2621 Attrs.push_back(PAWI);
2622 }
2623
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002624 // Check the arguments
2625 ValueList Args;
2626 if ($6->empty()) { // Has no arguments?
2627 // Make sure no arguments is a good thing!
2628 if (Ty->getNumParams() != 0)
2629 GEN_ERROR("No arguments passed to a function that "
2630 "expects arguments");
2631 } else { // Has arguments?
2632 // Loop through FunctionType's arguments and ensure they are specified
2633 // correctly!
2634 FunctionType::param_iterator I = Ty->param_begin();
2635 FunctionType::param_iterator E = Ty->param_end();
Dale Johannesencfb19e62007-11-05 21:20:28 +00002636 ParamList::iterator ArgI = $6->begin(), ArgE = $6->end();
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002637 unsigned index = 1;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002638
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002639 for (; ArgI != ArgE && I != E; ++ArgI, ++I, ++index) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002640 if (ArgI->Val->getType() != *I)
2641 GEN_ERROR("Parameter " + ArgI->Val->getName()+ " is not of type '" +
2642 (*I)->getDescription() + "'");
2643 Args.push_back(ArgI->Val);
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002644 if (ArgI->Attrs != ParamAttr::None) {
2645 ParamAttrsWithIndex PAWI;
2646 PAWI.index = index;
2647 PAWI.attrs = ArgI->Attrs;
2648 Attrs.push_back(PAWI);
2649 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002650 }
2651
2652 if (Ty->isVarArg()) {
2653 if (I == E)
2654 for (; ArgI != ArgE; ++ArgI)
2655 Args.push_back(ArgI->Val); // push the remaining varargs
2656 } else if (I != E || ArgI != ArgE)
2657 GEN_ERROR("Invalid number of parameters detected");
2658 }
2659
Duncan Sands637ec552007-11-28 17:07:01 +00002660 const ParamAttrsList *PAL = 0;
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002661 if (!Attrs.empty())
2662 PAL = ParamAttrsList::get(Attrs);
2663
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002664 // Create the InvokeInst
Chris Lattnerd140ada2007-08-29 16:15:23 +00002665 InvokeInst *II = new InvokeInst(V, Normal, Except, Args.begin(), Args.end());
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002666 II->setCallingConv($2);
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002667 II->setParamAttrs(PAL);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002668 $$ = II;
2669 delete $6;
2670 CHECK_FOR_ERROR
2671 }
2672 | UNWIND {
2673 $$ = new UnwindInst();
2674 CHECK_FOR_ERROR
2675 }
2676 | UNREACHABLE {
2677 $$ = new UnreachableInst();
2678 CHECK_FOR_ERROR
2679 };
2680
2681
2682
2683JumpTable : JumpTable IntType ConstValueRef ',' LABEL ValueRef {
2684 $$ = $1;
2685 Constant *V = cast<Constant>(getExistingVal($2, $3));
2686 CHECK_FOR_ERROR
2687 if (V == 0)
2688 GEN_ERROR("May only switch on a constant pool value");
2689
2690 BasicBlock* tmpBB = getBBVal($6);
2691 CHECK_FOR_ERROR
2692 $$->push_back(std::make_pair(V, tmpBB));
2693 }
2694 | IntType ConstValueRef ',' LABEL ValueRef {
2695 $$ = new std::vector<std::pair<Constant*, BasicBlock*> >();
2696 Constant *V = cast<Constant>(getExistingVal($1, $2));
2697 CHECK_FOR_ERROR
2698
2699 if (V == 0)
2700 GEN_ERROR("May only switch on a constant pool value");
2701
2702 BasicBlock* tmpBB = getBBVal($5);
2703 CHECK_FOR_ERROR
2704 $$->push_back(std::make_pair(V, tmpBB));
2705 };
2706
2707Inst : OptLocalAssign InstVal {
2708 // Is this definition named?? if so, assign the name...
2709 setValueName($2, $1);
2710 CHECK_FOR_ERROR
2711 InsertValue($2);
2712 $$ = $2;
2713 CHECK_FOR_ERROR
2714 };
2715
2716
2717PHIList : Types '[' ValueRef ',' ValueRef ']' { // Used for PHI nodes
2718 if (!UpRefs.empty())
2719 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
2720 $$ = new std::list<std::pair<Value*, BasicBlock*> >();
2721 Value* tmpVal = getVal(*$1, $3);
2722 CHECK_FOR_ERROR
2723 BasicBlock* tmpBB = getBBVal($5);
2724 CHECK_FOR_ERROR
2725 $$->push_back(std::make_pair(tmpVal, tmpBB));
2726 delete $1;
2727 }
2728 | PHIList ',' '[' ValueRef ',' ValueRef ']' {
2729 $$ = $1;
2730 Value* tmpVal = getVal($1->front().first->getType(), $4);
2731 CHECK_FOR_ERROR
2732 BasicBlock* tmpBB = getBBVal($6);
2733 CHECK_FOR_ERROR
2734 $1->push_back(std::make_pair(tmpVal, tmpBB));
2735 };
2736
2737
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002738ParamList : Types OptParamAttrs ValueRef OptParamAttrs {
2739 // FIXME: Remove trailing OptParamAttrs in LLVM 3.0, it was a mistake in 2.0
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002740 if (!UpRefs.empty())
2741 GEN_ERROR("Invalid upreference in type: " + (*$1)->getDescription());
2742 // Used for call and invoke instructions
Dale Johannesencfb19e62007-11-05 21:20:28 +00002743 $$ = new ParamList();
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002744 ParamListEntry E; E.Attrs = $2 | $4; E.Val = getVal($1->get(), $3);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002745 $$->push_back(E);
2746 delete $1;
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002747 CHECK_FOR_ERROR
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002748 }
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002749 | LABEL OptParamAttrs ValueRef OptParamAttrs {
2750 // FIXME: Remove trailing OptParamAttrs in LLVM 3.0, it was a mistake in 2.0
Dale Johannesencfb19e62007-11-05 21:20:28 +00002751 // Labels are only valid in ASMs
2752 $$ = new ParamList();
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002753 ParamListEntry E; E.Attrs = $2 | $4; E.Val = getBBVal($3);
Dale Johannesencfb19e62007-11-05 21:20:28 +00002754 $$->push_back(E);
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002755 CHECK_FOR_ERROR
Dale Johannesencfb19e62007-11-05 21:20:28 +00002756 }
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002757 | ParamList ',' Types OptParamAttrs ValueRef OptParamAttrs {
2758 // FIXME: Remove trailing OptParamAttrs in LLVM 3.0, it was a mistake in 2.0
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002759 if (!UpRefs.empty())
2760 GEN_ERROR("Invalid upreference in type: " + (*$3)->getDescription());
2761 $$ = $1;
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002762 ParamListEntry E; E.Attrs = $4 | $6; E.Val = getVal($3->get(), $5);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002763 $$->push_back(E);
2764 delete $3;
2765 CHECK_FOR_ERROR
2766 }
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002767 | ParamList ',' LABEL OptParamAttrs ValueRef OptParamAttrs {
2768 // FIXME: Remove trailing OptParamAttrs in LLVM 3.0, it was a mistake in 2.0
Dale Johannesencfb19e62007-11-05 21:20:28 +00002769 $$ = $1;
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002770 ParamListEntry E; E.Attrs = $4 | $6; E.Val = getBBVal($5);
Dale Johannesencfb19e62007-11-05 21:20:28 +00002771 $$->push_back(E);
2772 CHECK_FOR_ERROR
2773 }
2774 | /*empty*/ { $$ = new ParamList(); };
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002775
2776IndexList // Used for gep instructions and constant expressions
2777 : /*empty*/ { $$ = new std::vector<Value*>(); }
2778 | IndexList ',' ResolvedVal {
2779 $$ = $1;
2780 $$->push_back($3);
2781 CHECK_FOR_ERROR
2782 }
2783 ;
2784
2785OptTailCall : TAIL CALL {
2786 $$ = true;
2787 CHECK_FOR_ERROR
2788 }
2789 | CALL {
2790 $$ = false;
2791 CHECK_FOR_ERROR
2792 };
2793
2794InstVal : ArithmeticOps Types ValueRef ',' ValueRef {
2795 if (!UpRefs.empty())
2796 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
2797 if (!(*$2)->isInteger() && !(*$2)->isFloatingPoint() &&
2798 !isa<VectorType>((*$2).get()))
2799 GEN_ERROR(
2800 "Arithmetic operator requires integer, FP, or packed operands");
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002801 Value* val1 = getVal(*$2, $3);
2802 CHECK_FOR_ERROR
2803 Value* val2 = getVal(*$2, $5);
2804 CHECK_FOR_ERROR
2805 $$ = BinaryOperator::create($1, val1, val2);
2806 if ($$ == 0)
2807 GEN_ERROR("binary operator returned null");
2808 delete $2;
2809 }
2810 | LogicalOps Types ValueRef ',' ValueRef {
2811 if (!UpRefs.empty())
2812 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
2813 if (!(*$2)->isInteger()) {
2814 if (Instruction::isShift($1) || !isa<VectorType>($2->get()) ||
2815 !cast<VectorType>($2->get())->getElementType()->isInteger())
2816 GEN_ERROR("Logical operator requires integral operands");
2817 }
2818 Value* tmpVal1 = getVal(*$2, $3);
2819 CHECK_FOR_ERROR
2820 Value* tmpVal2 = getVal(*$2, $5);
2821 CHECK_FOR_ERROR
2822 $$ = BinaryOperator::create($1, tmpVal1, tmpVal2);
2823 if ($$ == 0)
2824 GEN_ERROR("binary operator returned null");
2825 delete $2;
2826 }
2827 | ICMP IPredicates Types ValueRef ',' ValueRef {
2828 if (!UpRefs.empty())
2829 GEN_ERROR("Invalid upreference in type: " + (*$3)->getDescription());
2830 if (isa<VectorType>((*$3).get()))
2831 GEN_ERROR("Vector types not supported by icmp instruction");
2832 Value* tmpVal1 = getVal(*$3, $4);
2833 CHECK_FOR_ERROR
2834 Value* tmpVal2 = getVal(*$3, $6);
2835 CHECK_FOR_ERROR
2836 $$ = CmpInst::create($1, $2, tmpVal1, tmpVal2);
2837 if ($$ == 0)
2838 GEN_ERROR("icmp operator returned null");
2839 delete $3;
2840 }
2841 | FCMP FPredicates Types ValueRef ',' ValueRef {
2842 if (!UpRefs.empty())
2843 GEN_ERROR("Invalid upreference in type: " + (*$3)->getDescription());
2844 if (isa<VectorType>((*$3).get()))
2845 GEN_ERROR("Vector types not supported by fcmp instruction");
2846 Value* tmpVal1 = getVal(*$3, $4);
2847 CHECK_FOR_ERROR
2848 Value* tmpVal2 = getVal(*$3, $6);
2849 CHECK_FOR_ERROR
2850 $$ = CmpInst::create($1, $2, tmpVal1, tmpVal2);
2851 if ($$ == 0)
2852 GEN_ERROR("fcmp operator returned null");
2853 delete $3;
2854 }
2855 | CastOps ResolvedVal TO Types {
2856 if (!UpRefs.empty())
2857 GEN_ERROR("Invalid upreference in type: " + (*$4)->getDescription());
2858 Value* Val = $2;
2859 const Type* DestTy = $4->get();
2860 if (!CastInst::castIsValid($1, Val, DestTy))
2861 GEN_ERROR("invalid cast opcode for cast from '" +
2862 Val->getType()->getDescription() + "' to '" +
2863 DestTy->getDescription() + "'");
2864 $$ = CastInst::create($1, Val, DestTy);
2865 delete $4;
2866 }
2867 | SELECT ResolvedVal ',' ResolvedVal ',' ResolvedVal {
2868 if ($2->getType() != Type::Int1Ty)
2869 GEN_ERROR("select condition must be boolean");
2870 if ($4->getType() != $6->getType())
2871 GEN_ERROR("select value types should match");
2872 $$ = new SelectInst($2, $4, $6);
2873 CHECK_FOR_ERROR
2874 }
2875 | VAARG ResolvedVal ',' Types {
2876 if (!UpRefs.empty())
2877 GEN_ERROR("Invalid upreference in type: " + (*$4)->getDescription());
2878 $$ = new VAArgInst($2, *$4);
2879 delete $4;
2880 CHECK_FOR_ERROR
2881 }
2882 | EXTRACTELEMENT ResolvedVal ',' ResolvedVal {
2883 if (!ExtractElementInst::isValidOperands($2, $4))
2884 GEN_ERROR("Invalid extractelement operands");
2885 $$ = new ExtractElementInst($2, $4);
2886 CHECK_FOR_ERROR
2887 }
2888 | INSERTELEMENT ResolvedVal ',' ResolvedVal ',' ResolvedVal {
2889 if (!InsertElementInst::isValidOperands($2, $4, $6))
2890 GEN_ERROR("Invalid insertelement operands");
2891 $$ = new InsertElementInst($2, $4, $6);
2892 CHECK_FOR_ERROR
2893 }
2894 | SHUFFLEVECTOR ResolvedVal ',' ResolvedVal ',' ResolvedVal {
2895 if (!ShuffleVectorInst::isValidOperands($2, $4, $6))
2896 GEN_ERROR("Invalid shufflevector operands");
2897 $$ = new ShuffleVectorInst($2, $4, $6);
2898 CHECK_FOR_ERROR
2899 }
2900 | PHI_TOK PHIList {
2901 const Type *Ty = $2->front().first->getType();
2902 if (!Ty->isFirstClassType())
2903 GEN_ERROR("PHI node operands must be of first class type");
2904 $$ = new PHINode(Ty);
2905 ((PHINode*)$$)->reserveOperandSpace($2->size());
2906 while ($2->begin() != $2->end()) {
2907 if ($2->front().first->getType() != Ty)
2908 GEN_ERROR("All elements of a PHI node must be of the same type");
2909 cast<PHINode>($$)->addIncoming($2->front().first, $2->front().second);
2910 $2->pop_front();
2911 }
2912 delete $2; // Free the list...
2913 CHECK_FOR_ERROR
2914 }
Dale Johannesencfb19e62007-11-05 21:20:28 +00002915 | OptTailCall OptCallingConv ResultTypes ValueRef '(' ParamList ')'
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002916 OptFuncAttrs {
2917
2918 // Handle the short syntax
2919 const PointerType *PFTy = 0;
2920 const FunctionType *Ty = 0;
2921 if (!(PFTy = dyn_cast<PointerType>($3->get())) ||
2922 !(Ty = dyn_cast<FunctionType>(PFTy->getElementType()))) {
2923 // Pull out the types of all of the arguments...
2924 std::vector<const Type*> ParamTypes;
Dale Johannesencfb19e62007-11-05 21:20:28 +00002925 ParamList::iterator I = $6->begin(), E = $6->end();
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002926 for (; I != E; ++I) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002927 const Type *Ty = I->Val->getType();
2928 if (Ty == Type::VoidTy)
2929 GEN_ERROR("Short call syntax cannot be used with varargs");
2930 ParamTypes.push_back(Ty);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002931 }
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002932 Ty = FunctionType::get($3->get(), ParamTypes, false);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002933 PFTy = PointerType::get(Ty);
2934 }
2935
2936 Value *V = getVal(PFTy, $4); // Get the function we're calling...
2937 CHECK_FOR_ERROR
2938
2939 // Check for call to invalid intrinsic to avoid crashing later.
2940 if (Function *theF = dyn_cast<Function>(V)) {
2941 if (theF->hasName() && (theF->getValueName()->getKeyLength() >= 5) &&
2942 (0 == strncmp(theF->getValueName()->getKeyData(), "llvm.", 5)) &&
2943 !theF->getIntrinsicID(true))
2944 GEN_ERROR("Call to invalid LLVM intrinsic function '" +
2945 theF->getName() + "'");
2946 }
2947
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002948 // Set up the ParamAttrs for the function
2949 ParamAttrsVector Attrs;
2950 if ($8 != ParamAttr::None) {
2951 ParamAttrsWithIndex PAWI;
2952 PAWI.index = 0;
2953 PAWI.attrs = $8;
2954 Attrs.push_back(PAWI);
2955 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002956 // Check the arguments
2957 ValueList Args;
2958 if ($6->empty()) { // Has no arguments?
2959 // Make sure no arguments is a good thing!
2960 if (Ty->getNumParams() != 0)
2961 GEN_ERROR("No arguments passed to a function that "
2962 "expects arguments");
2963 } else { // Has arguments?
2964 // Loop through FunctionType's arguments and ensure they are specified
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002965 // correctly. Also, gather any parameter attributes.
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002966 FunctionType::param_iterator I = Ty->param_begin();
2967 FunctionType::param_iterator E = Ty->param_end();
Dale Johannesencfb19e62007-11-05 21:20:28 +00002968 ParamList::iterator ArgI = $6->begin(), ArgE = $6->end();
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002969 unsigned index = 1;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002970
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002971 for (; ArgI != ArgE && I != E; ++ArgI, ++I, ++index) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002972 if (ArgI->Val->getType() != *I)
2973 GEN_ERROR("Parameter " + ArgI->Val->getName()+ " is not of type '" +
2974 (*I)->getDescription() + "'");
2975 Args.push_back(ArgI->Val);
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002976 if (ArgI->Attrs != ParamAttr::None) {
2977 ParamAttrsWithIndex PAWI;
2978 PAWI.index = index;
2979 PAWI.attrs = ArgI->Attrs;
2980 Attrs.push_back(PAWI);
2981 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002982 }
2983 if (Ty->isVarArg()) {
2984 if (I == E)
2985 for (; ArgI != ArgE; ++ArgI)
2986 Args.push_back(ArgI->Val); // push the remaining varargs
2987 } else if (I != E || ArgI != ArgE)
2988 GEN_ERROR("Invalid number of parameters detected");
2989 }
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002990
2991 // Finish off the ParamAttrs and check them
Duncan Sands637ec552007-11-28 17:07:01 +00002992 const ParamAttrsList *PAL = 0;
Duncan Sandsf5588dc2007-11-27 13:23:08 +00002993 if (!Attrs.empty())
2994 PAL = ParamAttrsList::get(Attrs);
2995
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002996 // Create the call node
David Greene9145dd22007-08-01 03:59:32 +00002997 CallInst *CI = new CallInst(V, Args.begin(), Args.end());
Dan Gohmanf17a25c2007-07-18 16:29:46 +00002998 CI->setTailCall($1);
2999 CI->setCallingConv($2);
Duncan Sandsf5588dc2007-11-27 13:23:08 +00003000 CI->setParamAttrs(PAL);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003001 $$ = CI;
3002 delete $6;
3003 delete $3;
3004 CHECK_FOR_ERROR
3005 }
3006 | MemoryInst {
3007 $$ = $1;
3008 CHECK_FOR_ERROR
3009 };
3010
3011OptVolatile : VOLATILE {
3012 $$ = true;
3013 CHECK_FOR_ERROR
3014 }
3015 | /* empty */ {
3016 $$ = false;
3017 CHECK_FOR_ERROR
3018 };
3019
3020
3021
3022MemoryInst : MALLOC Types OptCAlign {
3023 if (!UpRefs.empty())
3024 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
3025 $$ = new MallocInst(*$2, 0, $3);
3026 delete $2;
3027 CHECK_FOR_ERROR
3028 }
3029 | MALLOC Types ',' INTTYPE ValueRef OptCAlign {
3030 if (!UpRefs.empty())
3031 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
3032 Value* tmpVal = getVal($4, $5);
3033 CHECK_FOR_ERROR
3034 $$ = new MallocInst(*$2, tmpVal, $6);
3035 delete $2;
3036 }
3037 | ALLOCA Types OptCAlign {
3038 if (!UpRefs.empty())
3039 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
3040 $$ = new AllocaInst(*$2, 0, $3);
3041 delete $2;
3042 CHECK_FOR_ERROR
3043 }
3044 | ALLOCA Types ',' INTTYPE ValueRef OptCAlign {
3045 if (!UpRefs.empty())
3046 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
3047 Value* tmpVal = getVal($4, $5);
3048 CHECK_FOR_ERROR
3049 $$ = new AllocaInst(*$2, tmpVal, $6);
3050 delete $2;
3051 }
3052 | FREE ResolvedVal {
3053 if (!isa<PointerType>($2->getType()))
3054 GEN_ERROR("Trying to free nonpointer type " +
3055 $2->getType()->getDescription() + "");
3056 $$ = new FreeInst($2);
3057 CHECK_FOR_ERROR
3058 }
3059
3060 | OptVolatile LOAD Types ValueRef OptCAlign {
3061 if (!UpRefs.empty())
3062 GEN_ERROR("Invalid upreference in type: " + (*$3)->getDescription());
3063 if (!isa<PointerType>($3->get()))
3064 GEN_ERROR("Can't load from nonpointer type: " +
3065 (*$3)->getDescription());
3066 if (!cast<PointerType>($3->get())->getElementType()->isFirstClassType())
3067 GEN_ERROR("Can't load from pointer of non-first-class type: " +
3068 (*$3)->getDescription());
3069 Value* tmpVal = getVal(*$3, $4);
3070 CHECK_FOR_ERROR
3071 $$ = new LoadInst(tmpVal, "", $1, $5);
3072 delete $3;
3073 }
3074 | OptVolatile STORE ResolvedVal ',' Types ValueRef OptCAlign {
3075 if (!UpRefs.empty())
3076 GEN_ERROR("Invalid upreference in type: " + (*$5)->getDescription());
3077 const PointerType *PT = dyn_cast<PointerType>($5->get());
3078 if (!PT)
3079 GEN_ERROR("Can't store to a nonpointer type: " +
3080 (*$5)->getDescription());
3081 const Type *ElTy = PT->getElementType();
3082 if (ElTy != $3->getType())
3083 GEN_ERROR("Can't store '" + $3->getType()->getDescription() +
3084 "' into space of type '" + ElTy->getDescription() + "'");
3085
3086 Value* tmpVal = getVal(*$5, $6);
3087 CHECK_FOR_ERROR
3088 $$ = new StoreInst($3, tmpVal, $1, $7);
3089 delete $5;
3090 }
3091 | GETELEMENTPTR Types ValueRef IndexList {
3092 if (!UpRefs.empty())
3093 GEN_ERROR("Invalid upreference in type: " + (*$2)->getDescription());
3094 if (!isa<PointerType>($2->get()))
3095 GEN_ERROR("getelementptr insn requires pointer operand");
3096
David Greene48556392007-09-04 18:46:50 +00003097 if (!GetElementPtrInst::getIndexedType(*$2, $4->begin(), $4->end(), true))
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003098 GEN_ERROR("Invalid getelementptr indices for type '" +
3099 (*$2)->getDescription()+ "'");
3100 Value* tmpVal = getVal(*$2, $3);
3101 CHECK_FOR_ERROR
David Greene48556392007-09-04 18:46:50 +00003102 $$ = new GetElementPtrInst(tmpVal, $4->begin(), $4->end());
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003103 delete $2;
3104 delete $4;
3105 };
3106
3107
3108%%
3109
3110// common code from the two 'RunVMAsmParser' functions
3111static Module* RunParser(Module * M) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003112 CurModule.CurrentModule = M;
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003113 // Check to make sure the parser succeeded
3114 if (yyparse()) {
3115 if (ParserResult)
3116 delete ParserResult;
3117 return 0;
3118 }
3119
3120 // Emit an error if there are any unresolved types left.
3121 if (!CurModule.LateResolveTypes.empty()) {
3122 const ValID &DID = CurModule.LateResolveTypes.begin()->first;
3123 if (DID.Type == ValID::LocalName) {
3124 GenerateError("Undefined type remains at eof: '"+DID.getName() + "'");
3125 } else {
3126 GenerateError("Undefined type remains at eof: #" + itostr(DID.Num));
3127 }
3128 if (ParserResult)
3129 delete ParserResult;
3130 return 0;
3131 }
3132
3133 // Emit an error if there are any unresolved values left.
3134 if (!CurModule.LateResolveValues.empty()) {
3135 Value *V = CurModule.LateResolveValues.back();
3136 std::map<Value*, std::pair<ValID, int> >::iterator I =
3137 CurModule.PlaceHolderInfo.find(V);
3138
3139 if (I != CurModule.PlaceHolderInfo.end()) {
3140 ValID &DID = I->second.first;
3141 if (DID.Type == ValID::LocalName) {
3142 GenerateError("Undefined value remains at eof: "+DID.getName() + "'");
3143 } else {
3144 GenerateError("Undefined value remains at eof: #" + itostr(DID.Num));
3145 }
3146 if (ParserResult)
3147 delete ParserResult;
3148 return 0;
3149 }
3150 }
3151
3152 // Check to make sure that parsing produced a result
3153 if (!ParserResult)
3154 return 0;
3155
3156 // Reset ParserResult variable while saving its value for the result.
3157 Module *Result = ParserResult;
3158 ParserResult = 0;
3159
3160 return Result;
3161}
3162
3163void llvm::GenerateError(const std::string &message, int LineNo) {
Duncan Sandsf5588dc2007-11-27 13:23:08 +00003164 if (LineNo == -1) LineNo = LLLgetLineNo();
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003165 // TODO: column number in exception
3166 if (TheParseError)
Duncan Sandsf5588dc2007-11-27 13:23:08 +00003167 TheParseError->setError(LLLgetFilename(), message, LineNo);
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003168 TriggerError = 1;
3169}
3170
3171int yyerror(const char *ErrorMsg) {
Duncan Sandsf5588dc2007-11-27 13:23:08 +00003172 std::string where = LLLgetFilename() + ":" + utostr(LLLgetLineNo()) + ": ";
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003173 std::string errMsg = where + "error: " + std::string(ErrorMsg);
Duncan Sandsf5588dc2007-11-27 13:23:08 +00003174 if (yychar != YYEMPTY && yychar != 0) {
3175 errMsg += " while reading token: '";
3176 errMsg += std::string(LLLgetTokenStart(),
3177 LLLgetTokenStart()+LLLgetTokenLength()) + "'";
3178 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +00003179 GenerateError(errMsg);
3180 return 0;
3181}