1 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
2 <html><head><title>LLVM Programmer's Manual</title></head>
6 <table width="100%" bgcolor="#330077" border=0 cellpadding=4 cellspacing=0>
7 <tr><td> <font size=+3 color="#EEEEFF" face="Georgia,Palatino,Times,Roman"><b>LLVM Programmer's Manual</b></font></td>
11 <li><a href="#introduction">Introduction</a>
12 <li><a href="#general">General Information</a>
14 <li><a href="#stl">The C++ Standard Template Library</a>
15 <li><a href="#isa">The <tt>isa<></tt>, <tt>cast<></tt> and
16 <tt>dyn_cast<></tt> templates</a>
18 <li><a href="#common">Helpful Hints for Common Operations</a>
20 <li><a href="#inspection">Basic Inspection and Traversal Routines</a>
22 <li><a href="#iterate_function">Iterating over the <tt>BasicBlock</tt>s
23 in a <tt>Function</tt></a>
24 <li><a href="#iterate_basicblock">Iterating over the <tt>Instruction</tt>s
25 in a <tt>BasicBlock</tt></a>
26 <li><a href="#iterate_institer">Iterating over the <tt>Instruction</tt>s
27 in a <tt>Function</tt></a>
28 <li><a href="#iterate_convert">Turning an iterator into a class
30 <li><a href="#iterate_complex">Finding call sites: a more complex
32 <li><a href="#iterate_chains">Iterating over def-use & use-def
35 <li><a href="#simplechanges">Making simple changes</a>
37 <li><a href="#schanges_creating">Creating and inserting new
38 <tt>Instruction</tt>s</a>
39 <li><a href="#schanges_deleting">Deleting
40 <tt>Instruction</tt>s</a>
41 <li><a href="#schanges_replacing">Replacing an
42 <tt>Instruction</tt> with another <tt>Value</tt></a>
45 <li>Working with the Control Flow Graph
47 <li>Accessing predecessors and successors of a <tt>BasicBlock</tt>
53 <li>The general graph API
54 <li>The <tt>InstVisitor</tt> template
56 <li>The <tt>Statistic</tt> template
60 <li>Useful related topics
62 <li>The <tt>-time-passes</tt> option
63 <li>How to use the LLVM Makefile system
64 <li>How to write a regression test
69 <li><a href="#coreclasses">The Core LLVM Class Hierarchy Reference</a>
71 <li><a href="#Value">The <tt>Value</tt> class</a>
73 <li><a href="#User">The <tt>User</tt> class</a>
75 <li><a href="#Instruction">The <tt>Instruction</tt> class</a>
79 <li><a href="#GlobalValue">The <tt>GlobalValue</tt> class</a>
81 <li><a href="#BasicBlock">The <tt>BasicBlock</tt> class</a>
82 <li><a href="#Function">The <tt>Function</tt> class</a>
83 <li><a href="#GlobalVariable">The <tt>GlobalVariable</tt> class</a>
85 <li><a href="#Module">The <tt>Module</tt> class</a>
86 <li><a href="#Constant">The <tt>Constant</tt> class</a>
92 <li><a href="#Type">The <tt>Type</tt> class</a>
93 <li><a href="#Argument">The <tt>Argument</tt> class</a>
95 <li>The <tt>SymbolTable</tt> class
96 <li>The <tt>ilist</tt> and <tt>iplist</tt> classes
98 <li>Creating, inserting, moving and deleting from LLVM lists
100 <li>Important iterator invalidation semantics to be aware of
103 <p><b>Written by <a href="mailto:sabre@nondot.org">Chris Lattner</a>,
104 <a href="mailto:dhurjati@cs.uiuc.edu">Dinakar Dhurjati</a>, and
105 <a href="mailto:jstanley@cs.uiuc.edu">Joel Stanley</a></b><p>
109 <!-- *********************************************************************** -->
110 <table width="100%" bgcolor="#330077" border=0 cellpadding=4 cellspacing=0>
111 <tr><td align=center><font color="#EEEEFF" size=+2 face="Georgia,Palatino"><b>
112 <a name="introduction">Introduction
113 </b></font></td></tr></table><ul>
114 <!-- *********************************************************************** -->
116 This document is meant to highlight some of the important classes and interfaces
117 available in the LLVM source-base. This manual is not intended to explain what
118 LLVM is, how it works, and what LLVM code looks like. It assumes that you know
119 the basics of LLVM and are interested in writing transformations or otherwise
120 analyzing or manipulating the code.<p>
122 This document should get you oriented so that you can find your way in the
123 continuously growing source code that makes up the LLVM infrastructure. Note
124 that this manual is not intended to serve as a replacement for reading the
125 source code, so if you think there should be a method in one of these classes to
126 do something, but it's not listed, check the source. Links to the <a
127 href="/doxygen/">doxygen</a> sources are provided to make this as easy as
130 The first section of this document describes general information that is useful
131 to know when working in the LLVM infrastructure, and the second describes the
132 Core LLVM classes. In the future this manual will be extended with information
133 describing how to use extension libraries, such as dominator information, CFG
134 traversal routines, and useful utilities like the <tt><a
135 href="/doxygen/InstVisitor_8h-source.html">InstVisitor</a></tt> template.<p>
138 <!-- *********************************************************************** -->
139 </ul><table width="100%" bgcolor="#330077" border=0 cellpadding=4 cellspacing=0>
140 <tr><td align=center><font color="#EEEEFF" size=+2 face="Georgia,Palatino"><b>
141 <a name="general">General Information
142 </b></font></td></tr></table><ul>
143 <!-- *********************************************************************** -->
145 This section contains general information that is useful if you are working in
146 the LLVM source-base, but that isn't specific to any particular API.<p>
149 <!-- ======================================================================= -->
150 </ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
151 <tr><td> </td><td width="100%">
152 <font color="#EEEEFF" face="Georgia,Palatino"><b>
153 <a name="stl">The C++ Standard Template Library</a>
154 </b></font></td></tr></table><ul>
156 LLVM makes heavy use of the C++ Standard Template Library (STL), perhaps much
157 more than you are used to, or have seen before. Because of this, you might want
158 to do a little background reading in the techniques used and capabilities of the
159 library. There are many good pages that discuss the STL, and several books on
160 the subject that you can get, so it will not be discussed in this document.<p>
162 Here are some useful links:<p>
164 <li><a href="http://www.dinkumware.com/htm_cpl/index.html">Dinkumware C++
165 Library reference</a> - an excellent reference for the STL and other parts of
166 the standard C++ library.<br>
168 <li><a href="http://www.parashift.com/c++-faq-lite/">C++ Frequently Asked
171 <li><a href="http://www.sgi.com/tech/stl/">SGI's STL Programmer's Guide</a> -
173 href="http://www.sgi.com/tech/stl/stl_introduction.html">Introduction to the
176 <li><a href="http://www.research.att.com/~bs/C++.html">Bjarne Stroustrup's C++
181 You are also encouraged to take a look at the <a
182 href="CodingStandards.html">LLVM Coding Standards</a> guide which focuses on how
183 to write maintainable code more than where to put your curly braces.<p>
186 <!-- ======================================================================= -->
187 </ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
188 <tr><td> </td><td width="100%">
189 <font color="#EEEEFF" face="Georgia,Palatino"><b>
190 <a name="isa">The isa<>, cast<> and dyn_cast<> templates</a>
191 </b></font></td></tr></table><ul>
193 The LLVM source-base makes extensive use of a custom form of RTTI. These
194 templates have many similarities to the C++ <tt>dynamic_cast<></tt>
195 operator, but they don't have some drawbacks (primarily stemming from the fact
196 that <tt>dynamic_cast<></tt> only works on classes that have a v-table).
197 Because they are used so often, you must know what they do and how they work.
198 All of these templates are defined in the <a
199 href="/doxygen/Casting_8h-source.html"><tt>Support/Casting.h</tt></a> file (note
200 that you very rarely have to include this file directly).<p>
204 <dt><tt>isa<></tt>:
206 <dd>The <tt>isa<></tt> operator works exactly like the Java
207 "<tt>instanceof</tt>" operator. It returns true or false depending on whether a
208 reference or pointer points to an instance of the specified class. This can be
209 very useful for constraint checking of various sorts (example below).<p>
212 <dt><tt>cast<></tt>:
214 <dd>The <tt>cast<></tt> operator is a "checked cast" operation. It
215 converts a pointer or reference from a base class to a derived cast, causing an
216 assertion failure if it is not really an instance of the right type. This
217 should be used in cases where you have some information that makes you believe
218 that something is of the right type. An example of the <tt>isa<></tt> and
219 <tt>cast<></tt> template is:<p>
222 static bool isLoopInvariant(const <a href="#Value">Value</a> *V, const Loop *L) {
223 if (isa<<a href="#Constant">Constant</a>>(V) || isa<<a href="#Argument">Argument</a>>(V) || isa<<a href="#GlobalValue">GlobalValue</a>>(V))
226 <i>// Otherwise, it must be an instruction...</i>
227 return !L->contains(cast<<a href="#Instruction">Instruction</a>>(V)->getParent());
230 Note that you should <b>not</b> use an <tt>isa<></tt> test followed by a
231 <tt>cast<></tt>, for that use the <tt>dyn_cast<></tt> operator.<p>
234 <dt><tt>dyn_cast<></tt>:
236 <dd>The <tt>dyn_cast<></tt> operator is a "checking cast" operation. It
237 checks to see if the operand is of the specified type, and if so, returns a
238 pointer to it (this operator does not work with references). If the operand is
239 not of the correct type, a null pointer is returned. Thus, this works very much
240 like the <tt>dynamic_cast</tt> operator in C++, and should be used in the same
241 circumstances. Typically, the <tt>dyn_cast<></tt> operator is used in an
242 <tt>if</tt> statement or some other flow control statement like this:<p>
245 if (<a href="#AllocationInst">AllocationInst</a> *AI = dyn_cast<<a href="#AllocationInst">AllocationInst</a>>(Val)) {
250 This form of the <tt>if</tt> statement effectively combines together a call to
251 <tt>isa<></tt> and a call to <tt>cast<></tt> into one statement,
252 which is very convenient.<p>
254 Another common example is:<p>
257 <i>// Loop over all of the phi nodes in a basic block</i>
258 BasicBlock::iterator BBI = BB->begin();
259 for (; <a href="#PhiNode">PHINode</a> *PN = dyn_cast<<a href="#PHINode">PHINode</a>>(&*BBI); ++BBI)
263 Note that the <tt>dyn_cast<></tt> operator, like C++'s
264 <tt>dynamic_cast</tt> or Java's <tt>instanceof</tt> operator, can be abused. In
265 particular you should not use big chained <tt>if/then/else</tt> blocks to check
266 for lots of different variants of classes. If you find yourself wanting to do
267 this, it is much cleaner and more efficient to use the InstVisitor class to
268 dispatch over the instruction type directly.<p>
271 <dt><tt>cast_or_null<></tt>:
273 <dd>The <tt>cast_or_null<></tt> operator works just like the
274 <tt>cast<></tt> operator, except that it allows for a null pointer as an
275 argument (which it then propagates). This can sometimes be useful, allowing you
276 to combine several null checks into one.<p>
279 <dt><tt>dyn_cast_or_null<></tt>:
281 <dd>The <tt>dyn_cast_or_null<></tt> operator works just like the
282 <tt>dyn_cast<></tt> operator, except that it allows for a null pointer as
283 an argument (which it then propagates). This can sometimes be useful, allowing
284 you to combine several null checks into one.<p>
288 These five templates can be used with any classes, whether they have a v-table
289 or not. To add support for these templates, you simply need to add
290 <tt>classof</tt> static methods to the class you are interested casting to.
291 Describing this is currently outside the scope of this document, but there are
292 lots of examples in the LLVM source base.<p>
296 <!-- *********************************************************************** -->
297 </ul><table width="100%" bgcolor="#330077" border=0 cellpadding=4 cellspacing=0>
298 <tr><td align=center><font color="#EEEEFF" size=+2 face="Georgia,Palatino"><b>
299 <a name="common">Helpful Hints for Common Operations
300 </b></font></td></tr></table><ul>
301 <!-- *********************************************************************** -->
303 This section describes how to perform some very simple transformations of LLVM
304 code. This is meant to give examples of common idioms used, showing the
305 practical side of LLVM transformations.<p>
307 Because this is a "how-to" section, you should also read about the main classes
308 that you will be working with. The <a href="#coreclasses">Core LLVM Class
309 Hierarchy Reference</a> contains details and descriptions of the main classes
310 that you should know about.<p>
312 <!-- NOTE: this section should be heavy on example code -->
315 <!-- ======================================================================= -->
316 </ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
317 <tr><td> </td><td width="100%">
318 <font color="#EEEEFF" face="Georgia,Palatino"><b>
319 <a name="inspection">Basic Inspection and Traversal Routines</a>
320 </b></font></td></tr></table><ul>
322 The LLVM compiler infrastructure have many different data structures that may be
323 traversed. Following the example of the C++ standard template library, the
324 techniques used to traverse these various data structures are all basically the
325 same. For a enumerable sequence of values, the <tt>XXXbegin()</tt> function (or
326 method) returns an iterator to the start of the sequence, the <tt>XXXend()</tt>
327 function returns an iterator pointing to one past the last valid element of the
328 sequence, and there is some <tt>XXXiterator</tt> data type that is common
329 between the two operations.<p>
331 Because the pattern for iteration is common across many different aspects of the
332 program representation, the standard template library algorithms may be used on
333 them, and it is easier to remember how to iterate. First we show a few common
334 examples of the data structures that need to be traversed. Other data
335 structures are traversed in very similar ways.<p>
338 <!-- _______________________________________________________________________ -->
339 </ul><h4><a name="iterate_function"><hr size=0>Iterating over the <a
340 href="#BasicBlock"><tt>BasicBlock</tt></a>s in a <a
341 href="#Function"><tt>Function</tt></a> </h4><ul>
343 It's quite common to have a <tt>Function</tt> instance that you'd like
344 to transform in some way; in particular, you'd like to manipulate its
345 <tt>BasicBlock</tt>s. To facilitate this, you'll need to iterate over
346 all of the <tt>BasicBlock</tt>s that constitute the <tt>Function</tt>.
347 The following is an example that prints the name of a
348 <tt>BasicBlock</tt> and the number of <tt>Instruction</tt>s it
352 // func is a pointer to a Function instance
353 for(Function::iterator i = func->begin(), e = func->end(); i != e; ++i) {
355 // print out the name of the basic block if it has one, and then the
356 // number of instructions that it contains
358 cerr << "Basic block (name=" << i->getName() << ") has "
359 << i->size() << " instructions.\n";
363 Note that i can be used as if it were a pointer for the purposes of
364 invoking member functions of the <tt>Instruction</tt> class. This is
365 because the indirection operator is overloaded for the iterator
366 classes. In the above code, the expression <tt>i->size()</tt> is
367 exactly equivalent to <tt>(*i).size()</tt> just like you'd expect.
369 <!-- _______________________________________________________________________ -->
370 </ul><h4><a name="iterate_basicblock"><hr size=0>Iterating over the <a
371 href="#Instruction"><tt>Instruction</tt></a>s in a <a
372 href="#BasicBlock"><tt>BasicBlock</tt></a> </h4><ul>
374 Just like when dealing with <tt>BasicBlock</tt>s in
375 <tt>Function</tt>s, it's easy to iterate over the individual
376 instructions that make up <tt>BasicBlock</tt>s. Here's a code snippet
377 that prints out each instruction in a <tt>BasicBlock</tt>:
380 // blk is a pointer to a BasicBlock instance
381 for(BasicBlock::iterator i = blk->begin(), e = blk->end(); i != e; ++i)
382 // the next statement works since operator<<(ostream&,...)
383 // is overloaded for Instruction&
384 cerr << *i << "\n";
387 However, this isn't really the best way to print out the contents of a
388 <tt>BasicBlock</tt>! Since the ostream operators are overloaded for
389 virtually anything you'll care about, you could have just invoked the
390 print routine on the basic block itself: <tt>cerr << *blk <<
393 Note that currently operator<< is implemented for <tt>Value*</tt>, so it
394 will print out the contents of the pointer, instead of
395 the pointer value you might expect. This is a deprecated interface that will
396 be removed in the future, so it's best not to depend on it. To print out the
397 pointer value for now, you must cast to <tt>void*</tt>.<p>
400 <!-- _______________________________________________________________________ -->
401 </ul><h4><a name="iterate_institer"><hr size=0>Iterating over the <a
402 href="#Instruction"><tt>Instruction</tt></a>s in a <a
403 href="#Function"><tt>Function</tt></a></h4><ul>
405 If you're finding that you commonly iterate over a <tt>Function</tt>'s
406 <tt>BasicBlock</tt>s and then that <tt>BasicBlock</tt>'s
407 <tt>Instruction</tt>s, <tt>InstIterator</tt> should be used instead.
408 You'll need to include <a href="/doxygen/InstIterator_8h-source.html"><tt>llvm/Support/InstIterator.h</tt></a>, and then
409 instantiate <tt>InstIterator</tt>s explicitly in your code. Here's a
410 small example that shows how to dump all instructions in a function to
411 stderr (<b>Note:</b> Dereferencing an <tt>InstIterator</tt> yields an
412 <tt>Instruction*</tt>, <i>not</i> an <tt>Instruction&</tt>!):
415 #include "<a href="/doxygen/InstIterator_8h-source.html">llvm/Support/InstIterator.h</a>"
417 // Suppose F is a ptr to a function
418 for(inst_iterator i = inst_begin(F), e = inst_end(F); i != e; ++i)
419 cerr << **i << "\n";
422 Easy, isn't it? You can also use <tt>InstIterator</tt>s to fill a
423 worklist with its initial contents. For example, if you wanted to
424 initialize a worklist to contain all instructions in a
425 <tt>Function</tt> F, all you would need to do is something like:
428 std::set<Instruction*> worklist;
429 worklist.insert(inst_begin(F), inst_end(F));
432 The STL set <tt>worklist</tt> would now contain all instructions in
433 the <tt>Function</tt> pointed to by F.
435 <!-- _______________________________________________________________________ -->
436 </ul><h4><a name="iterate_convert"><hr size=0>Turning an iterator into a class
437 pointer (and vice-versa) </h4><ul>
439 Sometimes, it'll be useful to grab a reference (or pointer) to a class
440 instance when all you've got at hand is an iterator. Well, extracting
441 a reference or a pointer from an iterator is very straightforward.
442 Assuming that <tt>i</tt> is a <tt>BasicBlock::iterator</tt> and
443 <tt>j</tt> is a <tt>BasicBlock::const_iterator</tt>:
446 Instruction& inst = *i; // grab reference to instruction reference
447 Instruction* pinst = &*i; // grab pointer to instruction reference
448 const Instruction& inst = *j;
450 However, the iterators you'll be working with in the LLVM framework
451 are special: they will automatically convert to a ptr-to-instance type
452 whenever they need to. Instead of dereferencing the iterator and then
453 taking the address of the result, you can simply assign the iterator
454 to the proper pointer type and you get the dereference and address-of
455 operation as a result of the assignment (behind the scenes, this is a
456 result of overloading casting mechanisms). Thus the last line of the
459 <pre>Instruction* pinst = &*i;</pre>
461 is semantically equivalent to
463 <pre>Instruction* pinst = i;</pre>
465 <b>Caveat emptor</b>: The above syntax works <i>only</i> when you're <i>not</i>
466 working with <tt>dyn_cast</tt>. The template definition of <tt><a
467 href="#isa">dyn_cast</a></tt> isn't implemented to handle this yet, so you'll
468 still need the following in order for things to work properly:
471 BasicBlock::iterator bbi = ...;
472 <a href="#BranchInst">BranchInst</a>* b = <a href="#isa">dyn_cast</a><<a href="#BranchInst">BranchInst</a>>(&*bbi);
475 It's also possible to turn a class pointer into the corresponding
476 iterator. Usually, this conversion is quite inexpensive. The
477 following code snippet illustrates use of the conversion constructors
478 provided by LLVM iterators. By using these, you can explicitly grab
479 the iterator of something without actually obtaining it via iteration
483 void printNextInstruction(Instruction* inst) {
484 BasicBlock::iterator it(inst);
485 ++it; // after this line, it refers to the instruction after *inst.
486 if(it != inst->getParent()->end()) cerr << *it << "\n";
489 Of course, this example is strictly pedagogical, because it'd be much
490 better to explicitly grab the next instruction directly from inst.
493 <!--_______________________________________________________________________-->
494 </ul><h4><a name="iterate_complex"><hr size=0>Finding call sites: a slightly
495 more complex example </h4><ul>
497 Say that you're writing a FunctionPass and would like to count all the
498 locations in the entire module (that is, across every
499 <tt>Function</tt>) where a certain function (i.e. some
500 <tt>Function</tt>*) already in scope. As you'll learn later, you may
501 want to use an <tt>InstVisitor</tt> to accomplish this in a much more
502 straightforward manner, but this example will allow us to explore how
503 you'd do it if you didn't have <tt>InstVisitor</tt> around. In
504 pseudocode, this is what we want to do:
507 initialize callCounter to zero
508 for each Function f in the Module
509 for each BasicBlock b in f
510 for each Instruction i in b
511 if(i is a CallInst and calls the given function)
512 increment callCounter
515 And the actual code is (remember, since we're writing a
516 <tt>FunctionPass</tt>, our <tt>FunctionPass</tt>-derived class simply
517 has to override the <tt>runOnFunction</tt> method...):
520 Function* targetFunc = ...;
522 class OurFunctionPass : public FunctionPass {
524 OurFunctionPass(): callCounter(0) { }
526 virtual runOnFunction(Function& F) {
527 for(Function::iterator b = F.begin(), be = F.end(); b != be; ++b) {
528 for(BasicBlock::iterator i = b->begin(); ie = b->end(); i != ie; ++i) {
529 if (<a href="#CallInst">CallInst</a>* callInst = <a href="#isa">dyn_cast</a><<a href="#CallInst">CallInst</a>>(&*i)) {
530 // we know we've encountered a call instruction, so we
531 // need to determine if it's a call to the
532 // function pointed to by m_func or not.
534 if(callInst->getCalledFunction() == targetFunc)
541 unsigned callCounter;
545 <!--_______________________________________________________________________-->
546 </ul><h4><a name="iterate_chains"><hr size=0>Iterating over def-use &
547 use-def chains</h4><ul>
549 Frequently, we might have an instance of the <a
550 href="/doxygen/classValue.html">Value Class</a> and we want to
551 determine which <tt>User</tt>s use the <tt>Value</tt>. The list of
552 all <tt>User</tt>s of a particular <tt>Value</tt> is called a
553 <i>def-use</i> chain. For example, let's say we have a
554 <tt>Function*</tt> named <tt>F</tt> to a particular function
555 <tt>foo</tt>. Finding all of the instructions that <i>use</i>
556 <tt>foo</tt> is as simple as iterating over the <i>def-use</i> chain of
562 for(Value::use_iterator i = F->use_begin(), e = F->use_end(); i != e; ++i) {
563 if(Instruction* Inst = dyn_cast<Instruction>(*i)) {
564 cerr << "F is used in instruction:\n";
565 cerr << *Inst << "\n";
570 Alternately, it's common to have an instance of the <a
571 href="/doxygen/classUser.html">User Class</a> and need to know what
572 <tt>Value</tt>s are used by it. The list of all <tt>Value</tt>s used
573 by a <tt>User</tt> is known as a <i>use-def</i> chain. Instances of
574 class <tt>Instruction</tt> are common <tt>User</tt>s, so we might want
575 to iterate over all of the values that a particular instruction uses
576 (that is, the operands of the particular <tt>Instruction</tt>):
579 Instruction* pi = ...;
581 for(User::op_iterator i = pi->op_begin(), e = pi->op_end(); i != e; ++i) {
589 def-use chains ("finding all users of"): Value::use_begin/use_end
590 use-def chains ("finding all values used"): User::op_begin/op_end [op=operand]
593 <!-- ======================================================================= -->
594 </ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
595 <tr><td> </td><td width="100%">
596 <font color="#EEEEFF" face="Georgia,Palatino"><b>
597 <a name="simplechanges">Making simple changes</a>
598 </b></font></td></tr></table><ul>
600 There are some primitive transformation operations present in the LLVM
601 infrastructure that are worth knowing about. When performing
602 transformations, it's fairly common to manipulate the contents of
603 basic blocks. This section describes some of the common methods for
604 doing so and gives example code.
606 <!--_______________________________________________________________________-->
607 </ul><h4><a name="schanges_creating"><hr size=0>Creating and inserting
608 new <tt>Instruction</tt>s</h4><ul>
610 <i>Instantiating Instructions</i>
612 <p>Creation of <tt>Instruction</tt>s is straightforward: simply call the
613 constructor for the kind of instruction to instantiate and provide the
614 necessary parameters. For example, an <tt>AllocaInst</tt> only
615 <i>requires</i> a (const-ptr-to) <tt>Type</tt>. Thus:
617 <pre>AllocaInst* ai = new AllocaInst(Type::IntTy);</pre>
619 will create an <tt>AllocaInst</tt> instance that represents the
620 allocation of one integer in the current stack frame, at runtime.
621 Each <tt>Instruction</tt> subclass is likely to have varying default
622 parameters which change the semantics of the instruction, so refer to
623 the <a href="/doxygen/classInstruction.html">doxygen documentation for
624 the subclass of Instruction</a> that you're interested in
627 <p><i>Naming values</i></p>
630 It is very useful to name the values of instructions when you're able
631 to, as this facilitates the debugging of your transformations. If you
632 end up looking at generated LLVM machine code, you definitely want to
633 have logical names associated with the results of instructions! By
634 supplying a value for the <tt>Name</tt> (default) parameter of the
635 <tt>Instruction</tt> constructor, you associate a logical name with
636 the result of the instruction's execution at runtime. For example,
637 say that I'm writing a transformation that dynamically allocates space
638 for an integer on the stack, and that integer is going to be used as
639 some kind of index by some other code. To accomplish this, I place an
640 <tt>AllocaInst</tt> at the first point in the first
641 <tt>BasicBlock</tt> of some <tt>Function</tt>, and I'm intending to
642 use it within the same <tt>Function</tt>. I might do:
644 <pre>AllocaInst* pa = new AllocaInst(Type::IntTy, 0, "indexLoc");</pre>
646 where <tt>indexLoc</tt> is now the logical name of the instruction's
647 execution value, which is a pointer to an integer on the runtime
651 <p><i>Inserting instructions</i></p>
654 There are essentially two ways to insert an <tt>Instruction</tt> into
655 an existing sequence of instructions that form a <tt>BasicBlock</tt>:
657 <li>Insertion into an explicit instruction list
659 <p>Given a <tt>BasicBlock* pb</tt>, an <tt>Instruction* pi</tt> within
660 that <tt>BasicBlock</tt>, and a newly-created instruction
661 we wish to insert before <tt>*pi</tt>, we do the following:
664 BasicBlock* pb = ...;
665 Instruction* pi = ...;
666 Instruction* newInst = new Instruction(...);
667 pb->getInstList().insert(pi, newInst); // inserts newInst before pi in pb
671 <li>Insertion into an implicit instruction list
672 <p><tt>Instruction</tt> instances that are already in
673 <tt>BasicBlock</tt>s are implicitly associated with an existing
674 instruction list: the instruction list of the enclosing basic block.
675 Thus, we could have accomplished the same thing as the above code
676 without being given a <tt>BasicBlock</tt> by doing:
678 Instruction* pi = ...;
679 Instruction* newInst = new Instruction(...);
680 pi->getParent()->getInstList().insert(pi, newInst);
682 In fact, this sequence of steps occurs so frequently that the
683 <tt>Instruction</tt> class and <tt>Instruction</tt>-derived classes
684 provide constructors which take (as a default parameter) a pointer to
685 an <tt>Instruction</tt> which the newly-created <tt>Instruction</tt>
686 should precede. That is, <tt>Instruction</tt> constructors are
687 capable of inserting the newly-created instance into the
688 <tt>BasicBlock</tt> of a provided instruction, immediately before that
689 instruction. Using an <tt>Instruction</tt> constructor with a
690 <tt>insertBefore</tt> (default) parameter, the above code becomes:
692 Instruction* pi = ...;
693 Instruction* newInst = new Instruction(..., pi);
695 which is much cleaner, especially if you're creating a lot of
696 instructions and adding them to <tt>BasicBlock</tt>s.
701 <!--_______________________________________________________________________-->
702 </ul><h4><a name="schanges_deleting"><hr size=0>Deleting
703 <tt>Instruction</tt>s</h4><ul>
705 Deleting an instruction from an existing sequence of instructions that form a <a
706 href="#BasicBlock"><tt>BasicBlock</tt></a> is very straightforward. First, you
707 must have a pointer to the instruction that you wish to delete. Second, you
708 need to obtain the pointer to that instruction's basic block. You use the
709 pointer to the basic block to get its list of instructions and then use the
710 erase function to remove your instruction.<p>
715 <a href="#Instruction">Instruction</a> *I = .. ;
716 <a href="#BasicBlock">BasicBlock</a> *BB = I->getParent();
717 BB->getInstList().erase(I);
720 <!--_______________________________________________________________________-->
721 </ul><h4><a name="schanges_replacing"><hr size=0>Replacing an
722 <tt>Instruction</tt> with another <tt>Value</tt></h4><ul>
724 <p><i>Replacing individual instructions</i></p>
727 href="/doxygen/BasicBlock_8h-source.html">llvm/Transforms/Utils/BasicBlock.h
728 </a>" permits use of two very useful replace functions:
729 <tt>ReplaceInstWithValue</tt> and <tt>ReplaceInstWithInst</tt>.
733 <li>ReplaceInstWithValue
735 <p>This function replaces all uses (within a basic block) of a given
736 instruction with a value, and then removes the original instruction.
737 The following example illustrates the replacement of the result of a
738 particular <tt>AllocaInst</tt> that allocates memory for a single
739 integer with an null pointer to an integer.</p>
742 AllocaInst* instToReplace = ...;
743 ReplaceInstWithValue(*instToReplace->getParent(), instToReplace,
744 Constant::getNullValue(PointerType::get(Type::IntTy)));
747 <li>ReplaceInstWithInst
749 <p>This function replaces a particular instruction with another
750 instruction. The following example illustrates the replacement of one
751 <tt>AllocaInst</tt> with another.<p>
754 AllocaInst* instToReplace = ...;
755 ReplaceInstWithInst(*instToReplace->getParent(), instToReplace,
756 new AllocaInst(Type::IntTy, 0, "ptrToReplacedInt");
760 <p><i>Replacing multiple uses of <tt>User</tt>s and
761 <tt>Value</tt>s</i></p>
763 You can use <tt>Value::replaceAllUsesWith</tt> and
764 <tt>User::replaceUsesOfWith</tt> to change more than one use at a
765 time. See the doxygen documentation for the <a
766 href="/doxygen/classValue.html">Value Class</a> and <a
767 href="/doxygen/classUser.html">User Class</a>, respectively, for more
770 <!-- Value::replaceAllUsesWith User::replaceUsesOfWith Point out:
771 include/llvm/Transforms/Utils/ especially BasicBlockUtils.h with:
772 ReplaceInstWithValue, ReplaceInstWithInst
775 <!-- *********************************************************************** -->
776 </ul><table width="100%" bgcolor="#330077" border=0 cellpadding=4 cellspacing=0>
777 <tr><td align=center><font color="#EEEEFF" size=+2 face="Georgia,Palatino"><b>
778 <a name="coreclasses">The Core LLVM Class Hierarchy Reference
779 </b></font></td></tr></table><ul>
780 <!-- *********************************************************************** -->
782 The Core LLVM classes are the primary means of representing the program being
783 inspected or transformed. The core LLVM classes are defined in header files in
784 the <tt>include/llvm/</tt> directory, and implemented in the <tt>lib/VMCore</tt>
788 <!-- ======================================================================= -->
789 </ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
790 <tr><td> </td><td width="100%">
791 <font color="#EEEEFF" face="Georgia,Palatino"><b>
792 <a name="Value">The <tt>Value</tt> class</a>
793 </b></font></td></tr></table><ul>
795 <tt>#include "<a href="/doxygen/Value_8h-source.html">llvm/Value.h</a>"</tt></b><br>
796 doxygen info: <a href="/doxygen/classValue.html">Value Class</a><p>
799 The <tt>Value</tt> class is the most important class in LLVM Source base. It
800 represents a typed value that may be used (among other things) as an operand to
801 an instruction. There are many different types of <tt>Value</tt>s, such as <a
802 href="#Constant"><tt>Constant</tt></a>s, <a
803 href="#Argument"><tt>Argument</tt></a>s, and even <a
804 href="#Instruction"><tt>Instruction</tt></a>s and <a
805 href="#Function"><tt>Function</tt></a>s are <tt>Value</tt>s.<p>
807 A particular <tt>Value</tt> may be used many times in the LLVM representation
808 for a program. For example, an incoming argument to a function (represented
809 with an instance of the <a href="#Argument">Argument</a> class) is "used" by
810 every instruction in the function that references the argument. To keep track
811 of this relationship, the <tt>Value</tt> class keeps a list of all of the <a
812 href="#User"><tt>User</tt></a>s that is using it (the <a
813 href="#User"><tt>User</tt></a> class is a base class for all nodes in the LLVM
814 graph that can refer to <tt>Value</tt>s). This use list is how LLVM represents
815 def-use information in the program, and is accessible through the <tt>use_</tt>*
816 methods, shown below.<p>
818 Because LLVM is a typed representation, every LLVM <tt>Value</tt> is typed, and
819 this <a href="#Type">Type</a> is available through the <tt>getType()</tt>
820 method. <a name="#nameWarning">In addition, all LLVM values can be named. The
821 "name" of the <tt>Value</tt> is symbolic string printed in the LLVM code:<p>
824 %<b>foo</b> = add int 1, 2
827 The name of this instruction is "foo". <b>NOTE</b> that the name of any value
828 may be missing (an empty string), so names should <b>ONLY</b> be used for
829 debugging (making the source code easier to read, debugging printouts), they
830 should not be used to keep track of values or map between them. For this
831 purpose, use a <tt>std::map</tt> of pointers to the <tt>Value</tt> itself
834 One important aspect of LLVM is that there is no distinction between an SSA
835 variable and the operation that produces it. Because of this, any reference to
836 the value produced by an instruction (or the value available as an incoming
837 argument, for example) is represented as a direct pointer to the class that
838 represents this value. Although this may take some getting used to, it
839 simplifies the representation and makes it easier to manipulate.<p>
842 <!-- _______________________________________________________________________ -->
843 </ul><h4><a name="m_Value"><hr size=0>Important Public Members of
844 the <tt>Value</tt> class</h4><ul>
846 <li><tt>Value::use_iterator</tt> - Typedef for iterator over the use-list<br>
847 <tt>Value::use_const_iterator</tt>
848 - Typedef for const_iterator over the use-list<br>
849 <tt>unsigned use_size()</tt> - Returns the number of users of the value.<br>
850 <tt>bool use_empty()</tt> - Returns true if there are no users.<br>
851 <tt>use_iterator use_begin()</tt>
852 - Get an iterator to the start of the use-list.<br>
853 <tt>use_iterator use_end()</tt>
854 - Get an iterator to the end of the use-list.<br>
855 <tt><a href="#User">User</a> *use_back()</tt>
856 - Returns the last element in the list.<p>
858 These methods are the interface to access the def-use information in LLVM. As with all other iterators in LLVM, the naming conventions follow the conventions defined by the <a href="#stl">STL</a>.<p>
860 <li><tt><a href="#Type">Type</a> *getType() const</tt><p>
861 This method returns the Type of the Value.
863 <li><tt>bool hasName() const</tt><br>
864 <tt>std::string getName() const</tt><br>
865 <tt>void setName(const std::string &Name)</tt><p>
867 This family of methods is used to access and assign a name to a <tt>Value</tt>,
868 be aware of the <a href="#nameWarning">precaution above</a>.<p>
871 <li><tt>void replaceAllUsesWith(Value *V)</tt><p>
873 This method traverses the use list of a <tt>Value</tt> changing all <a
874 href="#User"><tt>User</tt>s</a> of the current value to refer to "<tt>V</tt>"
875 instead. For example, if you detect that an instruction always produces a
876 constant value (for example through constant folding), you can replace all uses
877 of the instruction with the constant like this:<p>
880 Inst->replaceAllUsesWith(ConstVal);
885 <!-- ======================================================================= -->
886 </ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
887 <tr><td> </td><td width="100%">
888 <font color="#EEEEFF" face="Georgia,Palatino"><b>
889 <a name="User">The <tt>User</tt> class</a>
890 </b></font></td></tr></table><ul>
892 <tt>#include "<a href="/doxygen/User_8h-source.html">llvm/User.h</a>"</tt></b><br>
893 doxygen info: <a href="/doxygen/classUser.html">User Class</a><br>
894 Superclass: <a href="#Value"><tt>Value</tt></a><p>
897 The <tt>User</tt> class is the common base class of all LLVM nodes that may
898 refer to <a href="#Value"><tt>Value</tt></a>s. It exposes a list of "Operands"
899 that are all of the <a href="#Value"><tt>Value</tt></a>s that the User is
900 referring to. The <tt>User</tt> class itself is a subclass of
903 The operands of a <tt>User</tt> point directly to the LLVM <a
904 href="#Value"><tt>Value</tt></a> that it refers to. Because LLVM uses Static
905 Single Assignment (SSA) form, there can only be one definition referred to,
906 allowing this direct connection. This connection provides the use-def
907 information in LLVM.<p>
909 <!-- _______________________________________________________________________ -->
910 </ul><h4><a name="m_User"><hr size=0>Important Public Members of
911 the <tt>User</tt> class</h4><ul>
913 The <tt>User</tt> class exposes the operand list in two ways: through an index
914 access interface and through an iterator based interface.<p>
916 <li><tt>Value *getOperand(unsigned i)</tt><br>
917 <tt>unsigned getNumOperands()</tt><p>
919 These two methods expose the operands of the <tt>User</tt> in a convenient form
920 for direct access.<p>
922 <li><tt>User::op_iterator</tt> - Typedef for iterator over the operand list<br>
923 <tt>User::op_const_iterator</tt>
924 <tt>use_iterator op_begin()</tt>
925 - Get an iterator to the start of the operand list.<br>
926 <tt>use_iterator op_end()</tt>
927 - Get an iterator to the end of the operand list.<p>
929 Together, these methods make up the iterator based interface to the operands of
934 <!-- ======================================================================= -->
935 </ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
936 <tr><td> </td><td width="100%">
937 <font color="#EEEEFF" face="Georgia,Palatino"><b>
938 <a name="Instruction">The <tt>Instruction</tt> class</a>
939 </b></font></td></tr></table><ul>
942 href="/doxygen/Instruction_8h-source.html">llvm/Instruction.h</a>"</tt></b><br>
943 doxygen info: <a href="/doxygen/classInstruction.html">Instruction Class</a><br>
944 Superclasses: <a href="#User"><tt>User</tt></a>, <a
945 href="#Value"><tt>Value</tt></a><p>
947 The <tt>Instruction</tt> class is the common base class for all LLVM
948 instructions. It provides only a few methods, but is a very commonly used
949 class. The primary data tracked by the <tt>Instruction</tt> class itself is the
950 opcode (instruction type) and the parent <a
951 href="#BasicBlock"><tt>BasicBlock</tt></a> the <tt>Instruction</tt> is embedded
952 into. To represent a specific type of instruction, one of many subclasses of
953 <tt>Instruction</tt> are used.<p>
955 Because the <tt>Instruction</tt> class subclasses the <a
956 href="#User"><tt>User</tt></a> class, its operands can be accessed in the same
957 way as for other <a href="#User"><tt>User</tt></a>s (with the
958 <tt>getOperand()</tt>/<tt>getNumOperands()</tt> and
959 <tt>op_begin()</tt>/<tt>op_end()</tt> methods).<p>
961 An important file for the <tt>Instruction</tt> class is the
962 <tt>llvm/Instruction.def</tt> file. This file contains some meta-data about the
963 various different types of instructions in LLVM. It describes the enum values
964 that are used as opcodes (for example <tt>Instruction::Add</tt> and
965 <tt>Instruction::SetLE</tt>), as well as the concrete sub-classes of
966 <tt>Instruction</tt> that implement the instruction (for example <tt><a
967 href="#BinaryOperator">BinaryOperator</a></tt> and <tt><a
968 href="#SetCondInst">SetCondInst</a></tt>). Unfortunately, the use of macros in
969 this file confused doxygen, so these enum values don't show up correctly in the
970 <a href="/doxygen/classInstruction.html">doxygen output</a>.<p>
973 <!-- _______________________________________________________________________ -->
974 </ul><h4><a name="m_Instruction"><hr size=0>Important Public Members of
975 the <tt>Instruction</tt> class</h4><ul>
977 <li><tt><a href="#BasicBlock">BasicBlock</a> *getParent()</tt><p>
979 Returns the <a href="#BasicBlock"><tt>BasicBlock</tt></a> that this
980 <tt>Instruction</tt> is embedded into.<p>
982 <li><tt>bool hasSideEffects()</tt><p>
984 Returns true if the instruction has side effects, i.e. it is a <tt>call</tt>,
985 <tt>free</tt>, <tt>invoke</tt>, or <tt>store</tt>.<p>
987 <li><tt>unsigned getOpcode()</tt><p>
989 Returns the opcode for the <tt>Instruction</tt>.<p>
991 <li><tt><a href="#Instruction">Instruction</a> *clone() const</tt><p>
993 Returns another instance of the specified instruction, identical in all ways to
994 the original except that the instruction has no parent (ie it's not embedded
995 into a <a href="#BasicBlock"><tt>BasicBlock</tt></a>), and it has no name.<p>
1001 \subsection{Subclasses of Instruction :}
1003 <li>BinaryOperator : This subclass of Instruction defines a general interface to the all the instructions involvong binary operators in LLVM.
1005 <li><tt>bool swapOperands()</tt>: Exchange the two operands to this instruction. If the instruction cannot be reversed (i.e. if it's a Div), it returns true.
1007 <li>TerminatorInst : This subclass of Instructions defines an interface for all instructions that can terminate a BasicBlock.
1009 <li> <tt>unsigned getNumSuccessors()</tt>: Returns the number of successors for this terminator instruction.
1010 <li><tt>BasicBlock *getSuccessor(unsigned i)</tt>: As the name suggests returns the ith successor BasicBlock.
1011 <li><tt>void setSuccessor(unsigned i, BasicBlock *B)</tt>: sets BasicBlock B as the ith succesor to this terminator instruction.
1014 <li>PHINode : This represents the PHI instructions in the SSA form.
1016 <li><tt> unsigned getNumIncomingValues()</tt>: Returns the number of incoming edges to this PHI node.
1017 <li><tt> Value *getIncomingValue(unsigned i)</tt>: Returns the ith incoming Value.
1018 <li><tt>void setIncomingValue(unsigned i, Value *V)</tt>: Sets the ith incoming Value as V
1019 <li><tt>BasicBlock *getIncomingBlock(unsigned i)</tt>: Returns the Basic Block corresponding to the ith incoming Value.
1020 <li><tt> void addIncoming(Value *D, BasicBlock *BB)</tt>:
1021 Add an incoming value to the end of the PHI list
1022 <li><tt> int getBasicBlockIndex(const BasicBlock *BB) const</tt>:
1023 Returns the first index of the specified basic block in the value list for this PHI. Returns -1 if no instance.
1025 <li>CastInst : In LLVM all casts have to be done through explicit cast instructions. CastInst defines the interface to the cast instructions.
1026 <li>CallInst : This defines an interface to the call instruction in LLVM. ARguments to the function are nothing but operands of the instruction.
1028 <li>: <tt>Function *getCalledFunction()</tt>: Returns a handle to the function that is being called by this Function.
1030 <li>LoadInst, StoreInst, GetElemPtrInst : These subclasses represent load, store and getelementptr instructions in LLVM.
1032 <li><tt>Value * getPointerOperand ()</tt>: Returns the Pointer Operand which is typically the 0th operand.
1034 <li>BranchInst : This is a subclass of TerminatorInst and defines the interface for conditional and unconditional branches in LLVM.
1036 <li><tt>bool isConditional()</tt>: Returns true if the branch is a conditional branch else returns false
1037 <li> <tt>Value *getCondition()</tt>: Returns the condition if it is a conditional branch else returns null.
1038 <li> <tt>void setUnconditionalDest(BasicBlock *Dest)</tt>: Changes the current branch to an unconditional one targetting the specified block.
1046 <!-- ======================================================================= -->
1047 </ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
1048 <tr><td> </td><td width="100%">
1049 <font color="#EEEEFF" face="Georgia,Palatino"><b>
1050 <a name="BasicBlock">The <tt>BasicBlock</tt> class</a>
1051 </b></font></td></tr></table><ul>
1054 href="/doxygen/BasicBlock_8h-source.html">llvm/BasicBlock.h</a>"</tt></b><br>
1055 doxygen info: <a href="/doxygen/classBasicBlock.html">BasicBlock Class</a><br>
1056 Superclass: <a href="#Value"><tt>Value</tt></a><p>
1059 This class represents a single entry multiple exit section of the code, commonly
1060 known as a basic block by the compiler community. The <tt>BasicBlock</tt> class
1061 maintains a list of <a href="#Instruction"><tt>Instruction</tt></a>s, which form
1062 the body of the block. Matching the language definition, the last element of
1063 this list of instructions is always a terminator instruction (a subclass of the
1064 <a href="#TerminatorInst"><tt>TerminatorInst</tt></a> class).<p>
1066 In addition to tracking the list of instructions that make up the block, the
1067 <tt>BasicBlock</tt> class also keeps track of the <a
1068 href="#Function"><tt>Function</tt></a> that it is embedded into.<p>
1070 Note that <tt>BasicBlock</tt>s themselves are <a
1071 href="#Value"><tt>Value</tt></a>s, because they are referenced by instructions
1072 like branches and can go in the switch tables. <tt>BasicBlock</tt>s have type
1076 <!-- _______________________________________________________________________ -->
1077 </ul><h4><a name="m_BasicBlock"><hr size=0>Important Public Members of
1078 the <tt>BasicBlock</tt> class</h4><ul>
1080 <li><tt>BasicBlock(const std::string &Name = "", <a
1081 href="#Function">Function</a> *Parent = 0)</tt><p>
1083 The <tt>BasicBlock</tt> constructor is used to create new basic blocks for
1084 insertion into a function. The constructor simply takes a name for the new
1085 block, and optionally a <a href="#Function"><tt>Function</tt></a> to insert it
1086 into. If the <tt>Parent</tt> parameter is specified, the new
1087 <tt>BasicBlock</tt> is automatically inserted at the end of the specified <a
1088 href="#Function"><tt>Function</tt></a>, if not specified, the BasicBlock must be
1089 manually inserted into the <a href="#Function"><tt>Function</tt></a>.<p>
1091 <li><tt>BasicBlock::iterator</tt> - Typedef for instruction list iterator<br>
1092 <tt>BasicBlock::const_iterator</tt> - Typedef for const_iterator.<br>
1093 <tt>begin()</tt>, <tt>end()</tt>, <tt>front()</tt>, <tt>back()</tt>,
1094 <tt>size()</tt>, <tt>empty()</tt>, <tt>rbegin()</tt>, <tt>rend()</tt><p>
1096 These methods and typedefs are forwarding functions that have the same semantics
1097 as the standard library methods of the same names. These methods expose the
1098 underlying instruction list of a basic block in a way that is easy to
1099 manipulate. To get the full complement of container operations (including
1100 operations to update the list), you must use the <tt>getInstList()</tt>
1103 <li><tt>BasicBlock::InstListType &getInstList()</tt><p>
1105 This method is used to get access to the underlying container that actually
1106 holds the Instructions. This method must be used when there isn't a forwarding
1107 function in the <tt>BasicBlock</tt> class for the operation that you would like
1108 to perform. Because there are no forwarding functions for "updating"
1109 operations, you need to use this if you want to update the contents of a
1110 <tt>BasicBlock</tt>.<p>
1112 <li><tt><A href="#Function">Function</a> *getParent()</tt><p>
1114 Returns a pointer to <a href="#Function"><tt>Function</tt></a> the block is
1115 embedded into, or a null pointer if it is homeless.<p>
1117 <li><tt><a href="#TerminatorInst">TerminatorInst</a> *getTerminator()</tt><p>
1119 Returns a pointer to the terminator instruction that appears at the end of the
1120 <tt>BasicBlock</tt>. If there is no terminator instruction, or if the last
1121 instruction in the block is not a terminator, then a null pointer is
1125 <!-- ======================================================================= -->
1126 </ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
1127 <tr><td> </td><td width="100%">
1128 <font color="#EEEEFF" face="Georgia,Palatino"><b>
1129 <a name="GlobalValue">The <tt>GlobalValue</tt> class</a>
1130 </b></font></td></tr></table><ul>
1133 href="/doxygen/GlobalValue_8h-source.html">llvm/GlobalValue.h</a>"</tt></b><br>
1134 doxygen info: <a href="/doxygen/classGlobalValue.html">GlobalValue Class</a><br>
1135 Superclasses: <a href="#User"><tt>User</tt></a>, <a
1136 href="#Value"><tt>Value</tt></a><p>
1138 Global values (<A href="#GlobalVariable"><tt>GlobalVariable</tt></a>s or <a
1139 href="#Function"><tt>Function</tt></a>s) are the only LLVM values that are
1140 visible in the bodies of all <a href="#Function"><tt>Function</tt></a>s.
1141 Because they are visible at global scope, they are also subject to linking with
1142 other globals defined in different translation units. To control the linking
1143 process, <tt>GlobalValue</tt>s know their linkage rules. Specifically,
1144 <tt>GlobalValue</tt>s know whether they have internal or external linkage.<p>
1146 If a <tt>GlobalValue</tt> has internal linkage (equivalent to being
1147 <tt>static</tt> in C), it is not visible to code outside the current translation
1148 unit, and does not participate in linking. If it has external linkage, it is
1149 visible to external code, and does participate in linking. In addition to
1150 linkage information, <tt>GlobalValue</tt>s keep track of which <a
1151 href="#Module"><tt>Module</tt></a> they are currently part of.<p>
1153 Because <tt>GlobalValue</tt>s are memory objects, they are always referred to by
1154 their address. As such, the <a href="#Type"><tt>Type</tt></a> of a global is
1155 always a pointer to its contents. This is explained in the LLVM Language
1156 Reference Manual.<p>
1159 <!-- _______________________________________________________________________ -->
1160 </ul><h4><a name="m_GlobalValue"><hr size=0>Important Public Members of
1161 the <tt>GlobalValue</tt> class</h4><ul>
1163 <li><tt>bool hasInternalLinkage() const</tt><br>
1164 <tt>bool hasExternalLinkage() const</tt><br>
1165 <tt>void setInternalLinkage(bool HasInternalLinkage)</tt><p>
1167 These methods manipulate the linkage characteristics of the
1168 <tt>GlobalValue</tt>.<p>
1170 <li><tt><a href="#Module">Module</a> *getParent()</tt><p>
1172 This returns the <a href="#Module"><tt>Module</tt></a> that the GlobalValue is
1173 currently embedded into.<p>
1177 <!-- ======================================================================= -->
1178 </ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
1179 <tr><td> </td><td width="100%">
1180 <font color="#EEEEFF" face="Georgia,Palatino"><b>
1181 <a name="Function">The <tt>Function</tt> class</a>
1182 </b></font></td></tr></table><ul>
1185 href="/doxygen/Function_8h-source.html">llvm/Function.h</a>"</tt></b><br>
1186 doxygen info: <a href="/doxygen/classFunction.html">Function Class</a><br>
1187 Superclasses: <a href="#GlobalValue"><tt>GlobalValue</tt></a>, <a
1188 href="#User"><tt>User</tt></a>, <a href="#Value"><tt>Value</tt></a><p>
1190 The <tt>Function</tt> class represents a single procedure in LLVM. It is
1191 actually one of the more complex classes in the LLVM heirarchy because it must
1192 keep track of a large amount of data. The <tt>Function</tt> class keeps track
1193 of a list of <a href="#BasicBlock"><tt>BasicBlock</tt></a>s, a list of formal <a
1194 href="#Argument"><tt>Argument</tt></a>s, and a <a
1195 href="#SymbolTable"><tt>SymbolTable</tt></a>.<p>
1197 The list of <a href="#BasicBlock"><tt>BasicBlock</tt></a>s is the most commonly
1198 used part of <tt>Function</tt> objects. The list imposes an implicit ordering
1199 of the blocks in the function, which indicate how the code will be layed out by
1200 the backend. Additionally, the first <a
1201 href="#BasicBlock"><tt>BasicBlock</tt></a> is the implicit entry node for the
1202 <tt>Function</tt>. It is not legal in LLVM explicitly branch to this initial
1203 block. There are no implicit exit nodes, and in fact there may be multiple exit
1204 nodes from a single <tt>Function</tt>. If the <a
1205 href="#BasicBlock"><tt>BasicBlock</tt></a> list is empty, this indicates that
1206 the <tt>Function</tt> is actually a function declaration: the actual body of the
1207 function hasn't been linked in yet.<p>
1209 In addition to a list of <a href="#BasicBlock"><tt>BasicBlock</tt></a>s, the
1210 <tt>Function</tt> class also keeps track of the list of formal <a
1211 href="#Argument"><tt>Argument</tt></a>s that the function receives. This
1212 container manages the lifetime of the <a href="#Argument"><tt>Argument</tt></a>
1213 nodes, just like the <a href="#BasicBlock"><tt>BasicBlock</tt></a> list does for
1214 the <a href="#BasicBlock"><tt>BasicBlock</tt></a>s.<p>
1216 The <a href="#SymbolTable"><tt>SymbolTable</tt></a> is a very rarely used LLVM
1217 feature that is only used when you have to look up a value by name. Aside from
1218 that, the <a href="#SymbolTable"><tt>SymbolTable</tt></a> is used internally to
1219 make sure that there are not conflicts between the names of <a
1220 href="#Instruction"><tt>Instruction</tt></a>s, <a
1221 href="#BasicBlock"><tt>BasicBlock</tt></a>s, or <a
1222 href="#Argument"><tt>Argument</tt></a>s in the function body.<p>
1225 <!-- _______________________________________________________________________ -->
1226 </ul><h4><a name="m_Function"><hr size=0>Important Public Members of
1227 the <tt>Function</tt> class</h4><ul>
1229 <li><tt>Function(const <a href="#FunctionType">FunctionType</a> *Ty, bool isInternal, const std::string &N = "")</tt><p>
1231 Constructor used when you need to create new <tt>Function</tt>s to add the the
1232 program. The constructor must specify the type of the function to create and
1233 whether or not it should start out with internal or external linkage.<p>
1235 <li><tt>bool isExternal()</tt><p>
1237 Return whether or not the <tt>Function</tt> has a body defined. If the function
1238 is "external", it does not have a body, and thus must be resolved by linking
1239 with a function defined in a different translation unit.<p>
1242 <li><tt>Function::iterator</tt> - Typedef for basic block list iterator<br>
1243 <tt>Function::const_iterator</tt> - Typedef for const_iterator.<br>
1244 <tt>begin()</tt>, <tt>end()</tt>, <tt>front()</tt>, <tt>back()</tt>,
1245 <tt>size()</tt>, <tt>empty()</tt>, <tt>rbegin()</tt>, <tt>rend()</tt><p>
1247 These are forwarding methods that make it easy to access the contents of a
1248 <tt>Function</tt> object's <a href="#BasicBlock"><tt>BasicBlock</tt></a>
1251 <li><tt>Function::BasicBlockListType &getBasicBlockList()</tt><p>
1253 Returns the list of <a href="#BasicBlock"><tt>BasicBlock</tt></a>s. This is
1254 neccesary to use when you need to update the list or perform a complex action
1255 that doesn't have a forwarding method.<p>
1258 <li><tt>Function::aiterator</tt> - Typedef for the argument list iterator<br>
1259 <tt>Function::const_aiterator</tt> - Typedef for const_iterator.<br>
1260 <tt>abegin()</tt>, <tt>aend()</tt>, <tt>afront()</tt>, <tt>aback()</tt>,
1261 <tt>asize()</tt>, <tt>aempty()</tt>, <tt>arbegin()</tt>, <tt>arend()</tt><p>
1263 These are forwarding methods that make it easy to access the contents of a
1264 <tt>Function</tt> object's <a href="#Argument"><tt>Argument</tt></a> list.<p>
1266 <li><tt>Function::ArgumentListType &getArgumentList()</tt><p>
1268 Returns the list of <a href="#Argument"><tt>Argument</tt></a>s. This is
1269 neccesary to use when you need to update the list or perform a complex action
1270 that doesn't have a forwarding method.<p>
1274 <li><tt><a href="#BasicBlock">BasicBlock</a> &getEntryNode()</tt><p>
1276 Returns the entry <a href="#BasicBlock"><tt>BasicBlock</tt></a> for the
1277 function. Because the entry block for the function is always the first block,
1278 this returns the first block of the <tt>Function</tt>.<p>
1280 <li><tt><a href="#Type">Type</a> *getReturnType()</tt><br>
1281 <tt><a href="#FunctionType">FunctionType</a> *getFunctionType()</tt><p>
1283 This traverses the <a href="#Type"><tt>Type</tt></a> of the <tt>Function</tt>
1284 and returns the return type of the function, or the <a
1285 href="#FunctionType"><tt>FunctionType</tt></a> of the actual function.<p>
1288 <li><tt>bool hasSymbolTable() const</tt><p>
1290 Return true if the <tt>Function</tt> has a symbol table allocated to it and if
1291 there is at least one entry in it.<p>
1293 <li><tt><a href="#SymbolTable">SymbolTable</a> *getSymbolTable()</tt><p>
1295 Return a pointer to the <a href="#SymbolTable"><tt>SymbolTable</tt></a> for this
1296 <tt>Function</tt> or a null pointer if one has not been allocated (because there
1297 are no named values in the function).<p>
1299 <li><tt><a href="#SymbolTable">SymbolTable</a> *getSymbolTableSure()</tt><p>
1301 Return a pointer to the <a href="#SymbolTable"><tt>SymbolTable</tt></a> for this
1302 <tt>Function</tt> or allocate a new <a
1303 href="#SymbolTable"><tt>SymbolTable</tt></a> if one is not already around. This
1304 should only be used when adding elements to the <a
1305 href="#SymbolTable"><tt>SymbolTable</tt></a>, so that empty symbol tables are
1306 not left laying around.<p>
1310 <!-- ======================================================================= -->
1311 </ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
1312 <tr><td> </td><td width="100%">
1313 <font color="#EEEEFF" face="Georgia,Palatino"><b>
1314 <a name="GlobalVariable">The <tt>GlobalVariable</tt> class</a>
1315 </b></font></td></tr></table><ul>
1318 href="/doxygen/GlobalVariable_8h-source.html">llvm/GlobalVariable.h</a>"</tt></b><br>
1319 doxygen info: <a href="/doxygen/classGlobalVariable.html">GlobalVariable Class</a><br>
1320 Superclasses: <a href="#GlobalValue"><tt>GlobalValue</tt></a>, <a
1321 href="#User"><tt>User</tt></a>, <a href="#Value"><tt>Value</tt></a><p>
1323 Global variables are represented with the (suprise suprise)
1324 <tt>GlobalVariable</tt> class. Like functions, <tt>GlobalVariable</tt>s are
1325 also subclasses of <a href="#GlobalValue"><tt>GlobalValue</tt></a>, and as such
1326 are always referenced by their address (global values must live in memory, so
1327 their "name" refers to their address). Global variables may have an initial
1328 value (which must be a <a href="#Constant"><tt>Constant</tt></a>), and if they
1329 have an initializer, they may be marked as "constant" themselves (indicating
1330 that their contents never change at runtime).<p>
1333 <!-- _______________________________________________________________________ -->
1334 </ul><h4><a name="m_GlobalVariable"><hr size=0>Important Public Members of the
1335 <tt>GlobalVariable</tt> class</h4><ul>
1337 <li><tt>GlobalVariable(const <a href="#Type">Type</a> *Ty, bool isConstant, bool
1338 isInternal, <a href="#Constant">Constant</a> *Initializer = 0, const std::string
1339 &Name = "")</tt><p>
1341 Create a new global variable of the specified type. If <tt>isConstant</tt> is
1342 true then the global variable will be marked as unchanging for the program, and
1343 if <tt>isInternal</tt> is true the resultant global variable will have internal
1344 linkage. Optionally an initializer and name may be specified for the global variable as well.<p>
1347 <li><tt>bool isConstant() const</tt><p>
1349 Returns true if this is a global variable is known not to be modified at
1353 <li><tt>bool hasInitializer()</tt><p>
1355 Returns true if this <tt>GlobalVariable</tt> has an intializer.<p>
1358 <li><tt><a href="#Constant">Constant</a> *getInitializer()</tt><p>
1360 Returns the intial value for a <tt>GlobalVariable</tt>. It is not legal to call
1361 this method if there is no initializer.<p>
1364 <!-- ======================================================================= -->
1365 </ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
1366 <tr><td> </td><td width="100%">
1367 <font color="#EEEEFF" face="Georgia,Palatino"><b>
1368 <a name="Module">The <tt>Module</tt> class</a>
1369 </b></font></td></tr></table><ul>
1372 href="/doxygen/Module_8h-source.html">llvm/Module.h</a>"</tt></b><br>
1373 doxygen info: <a href="/doxygen/classModule.html">Module Class</a><p>
1375 The <tt>Module</tt> class represents the top level structure present in LLVM
1376 programs. An LLVM module is effectively either a translation unit of the
1377 original program or a combination of several translation units merged by the
1378 linker. The <tt>Module</tt> class keeps track of a list of <a
1379 href="#Function"><tt>Function</tt></a>s, a list of <a
1380 href="#GlobalVariable"><tt>GlobalVariable</tt></a>s, and a <a
1381 href="#SymbolTable"><tt>SymbolTable</tt></a>. Additionally, it contains a few
1382 helpful member functions that try to make common operations easy.<p>
1385 <!-- _______________________________________________________________________ -->
1386 </ul><h4><a name="m_Module"><hr size=0>Important Public Members of the
1387 <tt>Module</tt> class</h4><ul>
1389 <li><tt>Module::iterator</tt> - Typedef for function list iterator<br>
1390 <tt>Module::const_iterator</tt> - Typedef for const_iterator.<br>
1391 <tt>begin()</tt>, <tt>end()</tt>, <tt>front()</tt>, <tt>back()</tt>,
1392 <tt>size()</tt>, <tt>empty()</tt>, <tt>rbegin()</tt>, <tt>rend()</tt><p>
1394 These are forwarding methods that make it easy to access the contents of a
1395 <tt>Module</tt> object's <a href="#Function"><tt>Function</tt></a>
1398 <li><tt>Module::FunctionListType &getFunctionList()</tt><p>
1400 Returns the list of <a href="#Function"><tt>Function</tt></a>s. This is
1401 neccesary to use when you need to update the list or perform a complex action
1402 that doesn't have a forwarding method.<p>
1404 <!-- Global Variable -->
1407 <li><tt>Module::giterator</tt> - Typedef for global variable list iterator<br>
1408 <tt>Module::const_giterator</tt> - Typedef for const_iterator.<br>
1409 <tt>gbegin()</tt>, <tt>gend()</tt>, <tt>gfront()</tt>, <tt>gback()</tt>,
1410 <tt>gsize()</tt>, <tt>gempty()</tt>, <tt>grbegin()</tt>, <tt>grend()</tt><p>
1412 These are forwarding methods that make it easy to access the contents of a
1413 <tt>Module</tt> object's <a href="#GlobalVariable"><tt>GlobalVariable</tt></a>
1416 <li><tt>Module::GlobalListType &getGlobalList()</tt><p>
1418 Returns the list of <a href="#GlobalVariable"><tt>GlobalVariable</tt></a>s.
1419 This is neccesary to use when you need to update the list or perform a complex
1420 action that doesn't have a forwarding method.<p>
1423 <!-- Symbol table stuff -->
1426 <li><tt>bool hasSymbolTable() const</tt><p>
1428 Return true if the <tt>Module</tt> has a symbol table allocated to it and if
1429 there is at least one entry in it.<p>
1431 <li><tt><a href="#SymbolTable">SymbolTable</a> *getSymbolTable()</tt><p>
1433 Return a pointer to the <a href="#SymbolTable"><tt>SymbolTable</tt></a> for this
1434 <tt>Module</tt> or a null pointer if one has not been allocated (because there
1435 are no named values in the function).<p>
1437 <li><tt><a href="#SymbolTable">SymbolTable</a> *getSymbolTableSure()</tt><p>
1439 Return a pointer to the <a href="#SymbolTable"><tt>SymbolTable</tt></a> for this
1440 <tt>Module</tt> or allocate a new <a
1441 href="#SymbolTable"><tt>SymbolTable</tt></a> if one is not already around. This
1442 should only be used when adding elements to the <a
1443 href="#SymbolTable"><tt>SymbolTable</tt></a>, so that empty symbol tables are
1444 not left laying around.<p>
1447 <!-- Convenience methods -->
1450 <li><tt><a href="#Function">Function</a> *getFunction(const std::string &Name, const <a href="#FunctionType">FunctionType</a> *Ty)</tt><p>
1452 Look up the specified function in the <tt>Module</tt> <a
1453 href="#SymbolTable"><tt>SymbolTable</tt></a>. If it does not exist, return
1457 <li><tt><a href="#Function">Function</a> *getOrInsertFunction(const std::string
1458 &Name, const <a href="#FunctionType">FunctionType</a> *T)</tt><p>
1460 Look up the specified function in the <tt>Module</tt> <a
1461 href="#SymbolTable"><tt>SymbolTable</tt></a>. If it does not exist, add an
1462 external declaration for the function and return it.<p>
1465 <li><tt>std::string getTypeName(const <a href="#Type">Type</a> *Ty)</tt><p>
1467 If there is at least one entry in the <a
1468 href="#SymbolTable"><tt>SymbolTable</tt></a> for the specified <a
1469 href="#Type"><tt>Type</tt></a>, return it. Otherwise return the empty
1473 <li><tt>bool addTypeName(const std::string &Name, const <a href="#Type">Type</a>
1476 Insert an entry in the <a href="#SymbolTable"><tt>SymbolTable</tt></a> mapping
1477 <tt>Name</tt> to <tt>Ty</tt>. If there is already an entry for this name, true
1478 is returned and the <a href="#SymbolTable"><tt>SymbolTable</tt></a> is not
1482 <!-- ======================================================================= -->
1483 </ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
1484 <tr><td> </td><td width="100%">
1485 <font color="#EEEEFF" face="Georgia,Palatino"><b>
1486 <a name="Constant">The <tt>Constant</tt> class and subclasses</a>
1487 </b></font></td></tr></table><ul>
1489 Constant represents a base class for different types of constants. It is
1490 subclassed by ConstantBool, ConstantInt, ConstantSInt, ConstantUInt,
1491 ConstantArray etc for representing the various types of Constants.<p>
1494 <!-- _______________________________________________________________________ -->
1495 </ul><h4><a name="m_Value"><hr size=0>Important Public Methods</h4><ul>
1497 <li><tt>bool isConstantExpr()</tt>: Returns true if it is a ConstantExpr
1502 \subsection{Important Subclasses of Constant}
1504 <li>ConstantSInt : This subclass of Constant represents a signed integer constant.
1506 <li><tt>int64_t getValue () const</tt>: Returns the underlying value of this constant.
1508 <li>ConstantUInt : This class represents an unsigned integer.
1510 <li><tt>uint64_t getValue () const</tt>: Returns the underlying value of this constant.
1512 <li>ConstantFP : This class represents a floating point constant.
1514 <li><tt>double getValue () const</tt>: Returns the underlying value of this constant.
1516 <li>ConstantBool : This represents a boolean constant.
1518 <li><tt>bool getValue () const</tt>: Returns the underlying value of this constant.
1520 <li>ConstantArray : This represents a constant array.
1522 <li><tt>const std::vector<Use> &getValues() const</tt>: Returns a Vecotr of component constants that makeup this array.
1524 <li>ConstantStruct : This represents a constant struct.
1526 <li><tt>const std::vector<Use> &getValues() const</tt>: Returns a Vecotr of component constants that makeup this array.
1528 <li>ConstantPointerRef : This represents a constant pointer value that is initialized to point to a global value, which lies at a constant fixed address.
1530 <li><tt>GlobalValue *getValue()</tt>: Returns the global value to which this pointer is pointing to.
1535 <!-- ======================================================================= -->
1536 </ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
1537 <tr><td> </td><td width="100%">
1538 <font color="#EEEEFF" face="Georgia,Palatino"><b>
1539 <a name="Type">The <tt>Type</tt> class and Derived Types</a>
1540 </b></font></td></tr></table><ul>
1542 Type as noted earlier is also a subclass of a Value class. Any primitive
1543 type (like int, short etc) in LLVM is an instance of Type Class. All
1544 other types are instances of subclasses of type like FunctionType,
1545 ArrayType etc. DerivedType is the interface for all such dervied types
1546 including FunctionType, ArrayType, PointerType, StructType. Types can have
1547 names. They can be recursive (StructType). There exists exactly one instance
1548 of any type structure at a time. This allows using pointer equality of Type *s for comparing types.
1550 <!-- _______________________________________________________________________ -->
1551 </ul><h4><a name="m_Value"><hr size=0>Important Public Methods</h4><ul>
1553 <li><tt>PrimitiveID getPrimitiveID () const</tt>: Returns the base type of the type.
1554 <li><tt> bool isSigned () const</tt>: Returns whether an integral numeric type is signed. This is true for SByteTy, ShortTy, IntTy, LongTy. Note that this is not true for Float and Double.
1555 <li><tt>bool isUnsigned () const</tt>: Returns whether a numeric type is unsigned. This is not quite the complement of isSigned... nonnumeric types return false as they do with isSigned. This returns true for UByteTy, UShortTy, UIntTy, and ULongTy.
1556 <li><tt> bool isInteger () const</tt>: Equilivent to isSigned() || isUnsigned(), but with only a single virtual function invocation.
1557 <li><tt>bool isIntegral () const</tt>: Returns true if this is an integral type, which is either Bool type or one of the Integer types.
1559 <li><tt>bool isFloatingPoint ()</tt>: Return true if this is one of the two floating point types.
1560 <li><tt>bool isRecursive () const</tt>: Returns rue if the type graph contains a cycle.
1561 <li><tt>isLosslesslyConvertableTo (const Type *Ty) const</tt>: Return true if this type can be converted to 'Ty' without any reinterpretation of bits. For example, uint to int.
1562 <li><tt>bool isPrimitiveType () const</tt>: Returns true if it is a primitive type.
1563 <li><tt>bool isDerivedType () const</tt>: Returns true if it is a derived type.
1564 <li><tt>const Type * getContainedType (unsigned i) const</tt>:
1565 This method is used to implement the type iterator. For derived types, this returns the types 'contained' in the derived type, returning 0 when 'i' becomes invalid. This allows the user to iterate over the types in a struct, for example, really easily.
1566 <li><tt>unsigned getNumContainedTypes () const</tt>: Return the number of types in the derived type.
1570 \subsection{Derived Types}
1572 <li>SequentialType : This is subclassed by ArrayType and PointerType
1574 <li><tt>const Type * getElementType () const</tt>: Returns the type of each of the elements in the sequential type.
1576 <li>ArrayType : This is a subclass of SequentialType and defines interface for array types.
1578 <li><tt>unsigned getNumElements () const</tt>: Returns the number of elements in the array.
1580 <li>PointerType : Subclass of SequentialType for pointer types.
1581 <li>StructType : subclass of DerivedTypes for struct types
1582 <li>FunctionType : subclass of DerivedTypes for function types.
1585 <li><tt>bool isVarArg () const</tt>: Returns true if its a vararg function
1586 <li><tt> const Type * getReturnType () const</tt>: Returns the return type of the function.
1587 <li><tt> const ParamTypes &getParamTypes () const</tt>: Returns a vector of parameter types.
1588 <li><tt>const Type * getParamType (unsigned i)</tt>: Returns the type of the ith parameter.
1589 <li><tt> const unsigned getNumParams () const</tt>: Returns the number of formal parameters.
1596 <!-- ======================================================================= -->
1597 </ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
1598 <tr><td> </td><td width="100%">
1599 <font color="#EEEEFF" face="Georgia,Palatino"><b>
1600 <a name="Argument">The <tt>Argument</tt> class</a>
1601 </b></font></td></tr></table><ul>
1603 This subclass of Value defines the interface for incoming formal arguments to a
1604 function. A Function maitanis a list of its formal arguments. An argument has a
1605 pointer to the parent Function.
1610 <!-- *********************************************************************** -->
1612 <!-- *********************************************************************** -->
1615 <address>By: <a href="mailto:dhurjati@cs.uiuc.edu">Dinakar Dhurjati</a> and
1616 <a href="mailto:sabre@nondot.org">Chris Lattner</a></address>
1617 <!-- Created: Tue Aug 6 15:00:33 CDT 2002 -->
1618 <!-- hhmts start -->
1619 Last modified: Tue Sep 17 22:16:24 CDT 2002
1621 </font></body></html>