[llvm-commits] CVS: llvm/docs/LangRef.html ProgrammersManual.html llvm.css
Chris Lattner
lattner at cs.uiuc.edu
Mon Nov 24 19:04:03 PST 2003
Changes in directory llvm/docs:
LangRef.html updated: 1.40 -> 1.41
ProgrammersManual.html updated: 1.50 -> 1.51
llvm.css updated: 1.9 -> 1.10
---
Log message:
checkin reid's docpatch
---
Diffs of the changes: (+2720 -3501)
Index: llvm/docs/LangRef.html
diff -u llvm/docs/LangRef.html:1.40 llvm/docs/LangRef.html:1.41
--- llvm/docs/LangRef.html:1.40 Fri Nov 21 11:42:22 2003
+++ llvm/docs/LangRef.html Mon Nov 24 19:02:51 2003
@@ -1,582 +1,508 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN"
- "http://www.w3.org/TR/html4/strict.dtd">
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html4/strict.dtd">
<html>
<head>
<title>LLVM Assembly Language Reference Manual</title>
<link rel="stylesheet" href="llvm.css" type="text/css">
</head>
<body>
-
-<div class="doc_title">
- LLVM Language Reference Manual
-</div>
-
+<div class="doc_title"> LLVM Language Reference Manual </div>
<ol>
<li><a href="#abstract">Abstract</a></li>
<li><a href="#introduction">Introduction</a></li>
<li><a href="#identifiers">Identifiers</a></li>
<li><a href="#typesystem">Type System</a>
<ol>
- <li><a href="#t_primitive">Primitive Types</a>
- <ol>
+ <li><a href="#t_primitive">Primitive Types</a>
+ <ol>
<li><a href="#t_classifications">Type Classifications</a></li>
- </ol></li>
+ </ol>
+ </li>
<li><a href="#t_derived">Derived Types</a>
<ol>
- <li><a href="#t_array" >Array Type</a></li>
+ <li><a href="#t_array">Array Type</a></li>
<li><a href="#t_function">Function Type</a></li>
<li><a href="#t_pointer">Pointer Type</a></li>
- <li><a href="#t_struct" >Structure Type</a></li>
- <!-- <li><a href="#t_packed" >Packed Type</a> -->
- </ol></li>
- </ol></li>
+ <li><a href="#t_struct">Structure Type</a></li>
+<!-- <li><a href="#t_packed" >Packed Type</a> -->
+ </ol>
+ </li>
+ </ol>
+ </li>
<li><a href="#highlevel">High Level Structure</a>
<ol>
<li><a href="#modulestructure">Module Structure</a></li>
<li><a href="#globalvars">Global Variables</a></li>
<li><a href="#functionstructure">Function Structure</a></li>
- </ol></li>
+ </ol>
+ </li>
<li><a href="#instref">Instruction Reference</a>
<ol>
<li><a href="#terminators">Terminator Instructions</a>
<ol>
- <li><a href="#i_ret" >'<tt>ret</tt>' Instruction</a></li>
- <li><a href="#i_br" >'<tt>br</tt>' Instruction</a></li>
+ <li><a href="#i_ret">'<tt>ret</tt>' Instruction</a></li>
+ <li><a href="#i_br">'<tt>br</tt>' Instruction</a></li>
<li><a href="#i_switch">'<tt>switch</tt>' Instruction</a></li>
<li><a href="#i_invoke">'<tt>invoke</tt>' Instruction</a></li>
- <li><a href="#i_unwind" >'<tt>unwind</tt>' Instruction</a></li>
- </ol></li>
+ <li><a href="#i_unwind">'<tt>unwind</tt>' Instruction</a></li>
+ </ol>
+ </li>
<li><a href="#binaryops">Binary Operations</a>
<ol>
- <li><a href="#i_add" >'<tt>add</tt>' Instruction</a></li>
- <li><a href="#i_sub" >'<tt>sub</tt>' Instruction</a></li>
- <li><a href="#i_mul" >'<tt>mul</tt>' Instruction</a></li>
- <li><a href="#i_div" >'<tt>div</tt>' Instruction</a></li>
- <li><a href="#i_rem" >'<tt>rem</tt>' Instruction</a></li>
+ <li><a href="#i_add">'<tt>add</tt>' Instruction</a></li>
+ <li><a href="#i_sub">'<tt>sub</tt>' Instruction</a></li>
+ <li><a href="#i_mul">'<tt>mul</tt>' Instruction</a></li>
+ <li><a href="#i_div">'<tt>div</tt>' Instruction</a></li>
+ <li><a href="#i_rem">'<tt>rem</tt>' Instruction</a></li>
<li><a href="#i_setcc">'<tt>set<i>cc</i></tt>' Instructions</a></li>
- </ol></li>
+ </ol>
+ </li>
<li><a href="#bitwiseops">Bitwise Binary Operations</a>
<ol>
<li><a href="#i_and">'<tt>and</tt>' Instruction</a></li>
- <li><a href="#i_or" >'<tt>or</tt>' Instruction</a></li>
+ <li><a href="#i_or">'<tt>or</tt>' Instruction</a></li>
<li><a href="#i_xor">'<tt>xor</tt>' Instruction</a></li>
<li><a href="#i_shl">'<tt>shl</tt>' Instruction</a></li>
<li><a href="#i_shr">'<tt>shr</tt>' Instruction</a></li>
- </ol></li>
+ </ol>
+ </li>
<li><a href="#memoryops">Memory Access Operations</a>
<ol>
- <li><a href="#i_malloc" >'<tt>malloc</tt>' Instruction</a></li>
- <li><a href="#i_free" >'<tt>free</tt>' Instruction</a></li>
- <li><a href="#i_alloca" >'<tt>alloca</tt>' Instruction</a></li>
- <li><a href="#i_load" >'<tt>load</tt>' Instruction</a></li>
- <li><a href="#i_store" >'<tt>store</tt>' Instruction</a></li>
- <li><a href="#i_getelementptr">'<tt>getelementptr</tt>' Instruction</a></li>
- </ol></li>
+ <li><a href="#i_malloc">'<tt>malloc</tt>' Instruction</a></li>
+ <li><a href="#i_free">'<tt>free</tt>' Instruction</a></li>
+ <li><a href="#i_alloca">'<tt>alloca</tt>' Instruction</a></li>
+ <li><a href="#i_load">'<tt>load</tt>' Instruction</a></li>
+ <li><a href="#i_store">'<tt>store</tt>' Instruction</a></li>
+ <li><a href="#i_getelementptr">'<tt>getelementptr</tt>' Instruction</a></li>
+ </ol>
+ </li>
<li><a href="#otherops">Other Operations</a>
<ol>
- <li><a href="#i_phi" >'<tt>phi</tt>' Instruction</a></li>
+ <li><a href="#i_phi">'<tt>phi</tt>' Instruction</a></li>
<li><a href="#i_cast">'<tt>cast .. to</tt>' Instruction</a></li>
- <li><a href="#i_call" >'<tt>call</tt>' Instruction</a></li>
+ <li><a href="#i_call">'<tt>call</tt>' Instruction</a></li>
<li><a href="#i_vanext">'<tt>vanext</tt>' Instruction</a></li>
- <li><a href="#i_vaarg" >'<tt>vaarg</tt>' Instruction</a></li>
+ <li><a href="#i_vaarg">'<tt>vaarg</tt>' Instruction</a></li>
</ol>
+ </li>
</ol>
+ </li>
<li><a href="#intrinsics">Intrinsic Functions</a>
- <ol>
- <li><a href="#int_varargs">Variable Argument Handling Intrinsics</a>
<ol>
- <li><a href="#i_va_start">'<tt>llvm.va_start</tt>' Intrinsic</a></li>
- <li><a href="#i_va_end" >'<tt>llvm.va_end</tt>' Intrinsic</a></li>
- <li><a href="#i_va_copy" >'<tt>llvm.va_copy</tt>' Intrinsic</a></li>
- </ol></li>
- </ol></li>
-
+ <li><a href="#int_varargs">Variable Argument Handling Intrinsics</a>
+ <ol>
+ <li><a href="#i_va_start">'<tt>llvm.va_start</tt>' Intrinsic</a></li>
+ <li><a href="#i_va_end">'<tt>llvm.va_end</tt>' Intrinsic</a></li>
+ <li><a href="#i_va_copy">'<tt>llvm.va_copy</tt>' Intrinsic</a></li>
+ </ol>
+ </li>
+ </ol>
+ </li>
</ol>
-
<div class="doc_text">
- <p><b>Written by <a href="mailto:sabre at nondot.org">Chris Lattner</a> and <A href="mailto:vadve at cs.uiuc.edu">Vikram Adve</a></b><p>
+<p><b>Written by <a href="mailto:sabre at nondot.org">Chris Lattner</a>
+and <a href="mailto:vadve at cs.uiuc.edu">Vikram Adve</a></b></p>
+<p> </p>
</div>
-
<!-- *********************************************************************** -->
-<div class="doc_section">
- <a name="abstract">Abstract
-</div>
+<div class="doc_section"> <a name="abstract">Abstract </a></div>
<!-- *********************************************************************** -->
-
<div class="doc_text">
-
-<p>This document is a reference manual for the LLVM assembly language. LLVM is
-an SSA based representation that provides type safety, low-level operations,
-flexibility, and the capability of representing 'all' high-level languages
-cleanly. It is the common code representation used throughout all phases of the
-LLVM compilation strategy.</p>
-
+<p>This document is a reference manual for the LLVM assembly language.
+LLVM is an SSA based representation that provides type safety,
+low-level operations, flexibility, and the capability of representing
+'all' high-level languages cleanly. It is the common code
+representation used throughout all phases of the LLVM compilation
+strategy.</p>
</div>
-
<!-- *********************************************************************** -->
-<div class="doc_section">
- <a name="introduction">Introduction</a>
-</div>
+<div class="doc_section"> <a name="introduction">Introduction</a> </div>
<!-- *********************************************************************** -->
-
-<div class="doc_text">
-
-<p>The LLVM code representation is designed to be used in three different forms:
-as an in-memory compiler IR, as an on-disk bytecode representation (suitable for
-fast loading by a Just-In-Time compiler), and as a human readable assembly
-language representation. This allows LLVM to provide a powerful intermediate
-representation for efficient compiler transformations and analysis, while
-providing a natural means to debug and visualize the transformations. The three
-different forms of LLVM are all equivalent. This document describes the human
-readable representation and notation.</p>
-
-<p>The LLVM representation aims to be a light-weight and low-level while being
-expressive, typed, and extensible at the same time. It aims to be a "universal
-IR" of sorts, by being at a low enough level that high-level ideas may be
-cleanly mapped to it (similar to how microprocessors are "universal IR's",
-allowing many source languages to be mapped to them). By providing type
-information, LLVM can be used as the target of optimizations: for example,
-through pointer analysis, it can be proven that a C automatic variable is never
-accessed outside of the current function... allowing it to be promoted to a
-simple SSA value instead of a memory location.</p>
-
-</div>
-
-<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="wellformed">Well-Formedness</a>
-</div>
-
<div class="doc_text">
-
-<p>It is important to note that this document describes 'well formed' LLVM
-assembly language. There is a difference between what the parser accepts and
-what is considered 'well formed'. For example, the following instruction is
-syntactically okay, but not well formed:</p>
-
-<pre>
- %x = <a href="#i_add">add</a> int 1, %x
-</pre>
-
-<p>...because the definition of <tt>%x</tt> does not dominate all of its uses.
-The LLVM infrastructure provides a verification pass that may be used to verify
-that an LLVM module is well formed. This pass is automatically run by the
-parser after parsing input assembly, and by the optimizer before it outputs
-bytecode. The violations pointed out by the verifier pass indicate bugs in
-transformation passes or input to the parser.</p>
-
-<!-- Describe the typesetting conventions here. -->
-
-</div>
-
+<p>The LLVM code representation is designed to be used in three
+different forms: as an in-memory compiler IR, as an on-disk bytecode
+representation (suitable for fast loading by a Just-In-Time compiler),
+and as a human readable assembly language representation. This allows
+LLVM to provide a powerful intermediate representation for efficient
+compiler transformations and analysis, while providing a natural means
+to debug and visualize the transformations. The three different forms
+of LLVM are all equivalent. This document describes the human readable
+representation and notation.</p>
+<p>The LLVM representation aims to be a light-weight and low-level
+while being expressive, typed, and extensible at the same time. It
+aims to be a "universal IR" of sorts, by being at a low enough level
+that high-level ideas may be cleanly mapped to it (similar to how
+microprocessors are "universal IR's", allowing many source languages to
+be mapped to them). By providing type information, LLVM can be used as
+the target of optimizations: for example, through pointer analysis, it
+can be proven that a C automatic variable is never accessed outside of
+the current function... allowing it to be promoted to a simple SSA
+value instead of a memory location.</p>
+</div>
+<!-- _______________________________________________________________________ -->
+<div class="doc_subsubsection"> <a name="wellformed">Well-Formedness</a> </div>
+<div class="doc_text">
+<p>It is important to note that this document describes 'well formed'
+LLVM assembly language. There is a difference between what the parser
+accepts and what is considered 'well formed'. For example, the
+following instruction is syntactically okay, but not well formed:</p>
+<pre> %x = <a href="#i_add">add</a> int 1, %x<br></pre>
+<p>...because the definition of <tt>%x</tt> does not dominate all of
+its uses. The LLVM infrastructure provides a verification pass that may
+be used to verify that an LLVM module is well formed. This pass is
+automatically run by the parser after parsing input assembly, and by
+the optimizer before it outputs bytecode. The violations pointed out
+by the verifier pass indicate bugs in transformation passes or input to
+the parser.</p>
+<!-- Describe the typesetting conventions here. --> </div>
<!-- *********************************************************************** -->
-<div class="doc_section">
- <a name="identifiers">Identifiers</a>
-</div>
+<div class="doc_section"> <a name="identifiers">Identifiers</a> </div>
<!-- *********************************************************************** -->
-
<div class="doc_text">
-
-<p>LLVM uses three different forms of identifiers, for different purposes:</p>
-
+<p>LLVM uses three different forms of identifiers, for different
+purposes:</p>
<ol>
-
- <li>Numeric constants are represented as you would expect: 12, -3 123.421,
- etc. Floating point constants have an optional hexidecimal notation.</li>
-
- <li>Named values are represented as a string of characters with a '%' prefix.
- For example, %foo, %DivisionByZero, %a.really.long.identifier. The actual
- regular expression used is '<tt>%[a-zA-Z$._][a-zA-Z$._0-9]*</tt>'.
- Identifiers which require other characters in their names can be surrounded
- with quotes. In this way, anything except a <tt>"</tt> character can be used
- in a name.</li>
-
- <li>Unnamed values are represented as an unsigned numeric value with a '%'
- prefix. For example, %12, %2, %44.</li>
-
+ <li>Numeric constants are represented as you would expect: 12, -3
+123.421, etc. Floating point constants have an optional hexidecimal
+notation.</li>
+ <li>Named values are represented as a string of characters with a '%'
+prefix. For example, %foo, %DivisionByZero,
+%a.really.long.identifier. The actual regular expression used is '<tt>%[a-zA-Z$._][a-zA-Z$._0-9]*</tt>'.
+Identifiers which require other characters in their names can be
+surrounded with quotes. In this way, anything except a <tt>"</tt>
+character can be used in a name.</li>
+ <li>Unnamed values are represented as an unsigned numeric value with
+a '%' prefix. For example, %12, %2, %44.</li>
</ol>
-
-<p>LLVM requires the values start with a '%' sign for two reasons: Compilers
-don't need to worry about name clashes with reserved words, and the set of
-reserved words may be expanded in the future without penalty. Additionally,
-unnamed identifiers allow a compiler to quickly come up with a temporary
-variable without having to avoid symbol table conflicts.</p>
-
-<p>Reserved words in LLVM are very similar to reserved words in other languages.
-There are keywords for different opcodes ('<tt><a href="#i_add">add</a></tt>',
-'<tt><a href="#i_cast">cast</a></tt>', '<tt><a href="#i_ret">ret</a></tt>',
-etc...), for primitive type names ('<tt><a href="#t_void">void</a></tt>',
-'<tt><a href="#t_uint">uint</a></tt>', etc...), and others. These reserved
-words cannot conflict with variable names, because none of them start with a '%'
-character.</p>
-
-<p>Here is an example of LLVM code to multiply the integer variable
-'<tt>%X</tt>' by 8:</p>
-
+<p>LLVM requires the values start with a '%' sign for two reasons:
+Compilers don't need to worry about name clashes with reserved words,
+and the set of reserved words may be expanded in the future without
+penalty. Additionally, unnamed identifiers allow a compiler to quickly
+come up with a temporary variable without having to avoid symbol table
+conflicts.</p>
+<p>Reserved words in LLVM are very similar to reserved words in other
+languages. There are keywords for different opcodes ('<tt><a
+ href="#i_add">add</a></tt>', '<tt><a href="#i_cast">cast</a></tt>', '<tt><a
+ href="#i_ret">ret</a></tt>', etc...), for primitive type names ('<tt><a
+ href="#t_void">void</a></tt>', '<tt><a href="#t_uint">uint</a></tt>',
+etc...), and others. These reserved words cannot conflict with
+variable names, because none of them start with a '%' character.</p>
+<p>Here is an example of LLVM code to multiply the integer variable '<tt>%X</tt>'
+by 8:</p>
<p>The easy way:</p>
-
-<pre>
- %result = <a href="#i_mul">mul</a> uint %X, 8
-</pre>
-
+<pre> %result = <a href="#i_mul">mul</a> uint %X, 8<br></pre>
<p>After strength reduction:</p>
-
-<pre>
- %result = <a href="#i_shl">shl</a> uint %X, ubyte 3
-</pre>
-
+<pre> %result = <a href="#i_shl">shl</a> uint %X, ubyte 3<br></pre>
<p>And the hard way:</p>
-
-<pre>
- <a href="#i_add">add</a> uint %X, %X <i>; yields {uint}:%0</i>
- <a href="#i_add">add</a> uint %0, %0 <i>; yields {uint}:%1</i>
- %result = <a href="#i_add">add</a> uint %1, %1
-</pre>
-
-<p>This last way of multiplying <tt>%X</tt> by 8 illustrates several important
-lexical features of LLVM:</p>
-
+<pre> <a href="#i_add">add</a> uint %X, %X <i>; yields {uint}:%0</i>
+ <a
+ href="#i_add">add</a> uint %0, %0 <i>; yields {uint}:%1</i>
+ %result = <a
+ href="#i_add">add</a> uint %1, %1<br></pre>
+<p>This last way of multiplying <tt>%X</tt> by 8 illustrates several
+important lexical features of LLVM:</p>
<ol>
- <li>Comments are delimited with a '<tt>;</tt>' and go until the end of
- line.</li>
-
- <li>Unnamed temporaries are created when the result of a computation is not
- assigned to a named value.</li>
-
+ <li>Comments are delimited with a '<tt>;</tt>' and go until the end
+of line.</li>
+ <li>Unnamed temporaries are created when the result of a computation
+is not assigned to a named value.</li>
<li>Unnamed temporaries are numbered sequentially</li>
</ol>
-
-<p>...and it also show a convention that we follow in this document. When
-demonstrating instructions, we will follow an instruction with a comment that
-defines the type and name of value produced. Comments are shown in italic
-text.</p>
-
-<p>The one non-intuitive notation for constants is the optional hexidecimal form
-of floating point constants. For example, the form '<tt>double
+<p>...and it also show a convention that we follow in this document.
+When demonstrating instructions, we will follow an instruction with a
+comment that defines the type and name of value produced. Comments are
+shown in italic text.</p>
+<p>The one non-intuitive notation for constants is the optional
+hexidecimal form of floating point constants. For example, the form '<tt>double
0x432ff973cafa8000</tt>' is equivalent to (but harder to read than) '<tt>double
-4.5e+15</tt>' which is also supported by the parser. The only time hexadecimal
-floating point constants are useful (and the only time that they are generated
-by the disassembler) is when an FP constant has to be emitted that is not
-representable as a decimal floating point number exactly. For example, NaN's,
-infinities, and other special cases are represented in their IEEE hexadecimal
-format so that assembly and disassembly do not cause any bits to change in the
-constants.</p>
-
+4.5e+15</tt>' which is also supported by the parser. The only time
+hexadecimal floating point constants are useful (and the only time that
+they are generated by the disassembler) is when an FP constant has to
+be emitted that is not representable as a decimal floating point number
+exactly. For example, NaN's, infinities, and other special cases are
+represented in their IEEE hexadecimal format so that assembly and
+disassembly do not cause any bits to change in the constants.</p>
</div>
-
<!-- *********************************************************************** -->
-<div class="doc_section">
- <a name="typesystem">Type System</a>
-</div>
+<div class="doc_section"> <a name="typesystem">Type System</a> </div>
<!-- *********************************************************************** -->
-
<div class="doc_text">
-
<p>The LLVM type system is one of the most important features of the
-intermediate representation. Being typed enables a number of optimizations to
-be performed on the IR directly, without having to do extra analyses on the side
-before the transformation. A strong type system makes it easier to read the
-generated code and enables novel analyses and transformations that are not
-feasible to perform on normal three address code representations.</p>
-
+intermediate representation. Being typed enables a number of
+optimizations to be performed on the IR directly, without having to do
+extra analyses on the side before the transformation. A strong type
+system makes it easier to read the generated code and enables novel
+analyses and transformations that are not feasible to perform on normal
+three address code representations.</p>
<!-- The written form for the type system was heavily influenced by the
syntactic problems with types in the C language<sup><a
-href="#rw_stroustrup">1</a></sup>.<p> -->
-
-</div>
-
+href="#rw_stroustrup">1</a></sup>.<p> --> </div>
<!-- ======================================================================= -->
-<div class="doc_subsection">
- <a name="t_primitive">Primitive Types</a>
-</div>
-
+<div class="doc_subsection"> <a name="t_primitive">Primitive Types</a> </div>
<div class="doc_text">
-
-<p>The primitive types are the fundemental building blocks of the LLVM system.
-The current set of primitive types are as follows:</p>
-
+<p>The primitive types are the fundemental building blocks of the LLVM
+system. The current set of primitive types are as follows:</p>
<p>
<table border="0" align="center">
-<tr>
-<td>
-
-<table border="1" cellspacing="0" cellpadding="4" align="center">
-<tr><td><tt>void</tt></td> <td>No value</td></tr>
-<tr><td><tt>ubyte</tt></td> <td>Unsigned 8 bit value</td></tr>
-<tr><td><tt>ushort</tt></td><td>Unsigned 16 bit value</td></tr>
-<tr><td><tt>uint</tt></td> <td>Unsigned 32 bit value</td></tr>
-<tr><td><tt>ulong</tt></td> <td>Unsigned 64 bit value</td></tr>
-<tr><td><tt>float</tt></td> <td>32 bit floating point value</td></tr>
-<tr><td><tt>label</tt></td> <td>Branch destination</td></tr>
-</table>
-
-</td><td valign=top>
-
-<table border="1" cellspacing="0" cellpadding="4" align=center">
-<tr><td><tt>bool</tt></td> <td>True or False value</td></tr>
-<tr><td><tt>sbyte</tt></td> <td>Signed 8 bit value</td></tr>
-<tr><td><tt>short</tt></td> <td>Signed 16 bit value</td></tr>
-<tr><td><tt>int</tt></td> <td>Signed 32 bit value</td></tr>
-<tr><td><tt>long</tt></td> <td>Signed 64 bit value</td></tr>
-<tr><td><tt>double</tt></td><td>64 bit floating point value</td></tr>
-</table>
-
-</td>
-</tr>
+ <tbody>
+ <tr>
+ <td>
+ <table border="1" cellspacing="0" cellpadding="4" align="center">
+ <tbody>
+ <tr>
+ <td><tt>void</tt></td>
+ <td>No value</td>
+ </tr>
+ <tr>
+ <td><tt>ubyte</tt></td>
+ <td>Unsigned 8 bit value</td>
+ </tr>
+ <tr>
+ <td><tt>ushort</tt></td>
+ <td>Unsigned 16 bit value</td>
+ </tr>
+ <tr>
+ <td><tt>uint</tt></td>
+ <td>Unsigned 32 bit value</td>
+ </tr>
+ <tr>
+ <td><tt>ulong</tt></td>
+ <td>Unsigned 64 bit value</td>
+ </tr>
+ <tr>
+ <td><tt>float</tt></td>
+ <td>32 bit floating point value</td>
+ </tr>
+ <tr>
+ <td><tt>label</tt></td>
+ <td>Branch destination</td>
+ </tr>
+ </tbody>
+ </table>
+ </td>
+ <td valign="top">
+ <table border="1" cellspacing="0" cellpadding="4" align="center"">
+ <tbody>
+ <tr>
+ <td><tt>bool</tt></td>
+ <td>True or False value</td>
+ </tr>
+ <tr>
+ <td><tt>sbyte</tt></td>
+ <td>Signed 8 bit value</td>
+ </tr>
+ <tr>
+ <td><tt>short</tt></td>
+ <td>Signed 16 bit value</td>
+ </tr>
+ <tr>
+ <td><tt>int</tt></td>
+ <td>Signed 32 bit value</td>
+ </tr>
+ <tr>
+ <td><tt>long</tt></td>
+ <td>Signed 64 bit value</td>
+ </tr>
+ <tr>
+ <td><tt>double</tt></td>
+ <td>64 bit floating point value</td>
+ </tr>
+ </tbody>
+ </table>
+ </td>
+ </tr>
+ </tbody>
</table>
</p>
-
</div>
-
<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="t_classifications">Type Classifications</a>
-</div>
-
+<div class="doc_subsubsection"> <a name="t_classifications">Type
+Classifications</a> </div>
<div class="doc_text">
-
-<p>These different primitive types fall into a few useful classifications:</p>
-
+<p>These different primitive types fall into a few useful
+classifications:</p>
<p>
<table border="1" cellspacing="0" cellpadding="4" align="center">
-<tr>
- <td><a name="t_signed">signed</td>
- <td><tt>sbyte, short, int, long, float, double</tt></td>
-</tr>
-<tr>
- <td><a name="t_unsigned">unsigned</td>
- <td><tt>ubyte, ushort, uint, ulong</tt></td>
-</tr>
-<tr>
- <td><a name="t_integer">integer</td>
- <td><tt>ubyte, sbyte, ushort, short, uint, int, ulong, long</tt></td>
-</tr>
-<tr>
- <td><a name="t_integral">integral</td>
- <td><tt>bool, ubyte, sbyte, ushort, short, uint, int, ulong, long</tt></td>
-</tr>
-<tr>
- <td><a name="t_floating">floating point</td>
- <td><tt>float, double</tt></td>
-</tr>
-<tr>
- <td><a name="t_firstclass">first class</td>
- <td><tt>bool, ubyte, sbyte, ushort, short,<br>
- uint, int, ulong, long, float, double,
- <a href="#t_pointer">pointer</a></tt></td>
-</tr>
+ <tbody>
+ <tr>
+ <td><a name="t_signed">signed</a></td>
+ <td><tt>sbyte, short, int, long, float, double</tt></td>
+ </tr>
+ <tr>
+ <td><a name="t_unsigned">unsigned</a></td>
+ <td><tt>ubyte, ushort, uint, ulong</tt></td>
+ </tr>
+ <tr>
+ <td><a name="t_integer">integer</a></td>
+ <td><tt>ubyte, sbyte, ushort, short, uint, int, ulong, long</tt></td>
+ </tr>
+ <tr>
+ <td><a name="t_integral">integral</a></td>
+ <td><tt>bool, ubyte, sbyte, ushort, short, uint, int, ulong, long</tt></td>
+ </tr>
+ <tr>
+ <td><a name="t_floating">floating point</a></td>
+ <td><tt>float, double</tt></td>
+ </tr>
+ <tr>
+ <td><a name="t_firstclass">first class</a></td>
+ <td><tt>bool, ubyte, sbyte, ushort, short,<br>
+uint, int, ulong, long, float, double, <a href="#t_pointer">pointer</a></tt></td>
+ </tr>
+ </tbody>
</table>
</p>
-
-<p>The <a href="#t_firstclass">first class</a> types are perhaps the most
-important. Values of these types are the only ones which can be produced by
-instructions, passed as arguments, or used as operands to instructions. This
-means that all structures and arrays must be manipulated either by pointer or by
-component.</p>
-
+<p>The <a href="#t_firstclass">first class</a> types are perhaps the
+most important. Values of these types are the only ones which can be
+produced by instructions, passed as arguments, or used as operands to
+instructions. This means that all structures and arrays must be
+manipulated either by pointer or by component.</p>
</div>
-
<!-- ======================================================================= -->
-<div class="doc_subsection">
- <a name="t_derived">Derived Types</a>
-</div>
-
+<div class="doc_subsection"> <a name="t_derived">Derived Types</a> </div>
<div class="doc_text">
-
-<p>The real power in LLVM comes from the derived types in the system. This is
-what allows a programmer to represent arrays, functions, pointers, and other
-useful types. Note that these derived types may be recursive: For example, it
-is possible to have a two dimensional array.</p>
-
+<p>The real power in LLVM comes from the derived types in the system.
+This is what allows a programmer to represent arrays, functions,
+pointers, and other useful types. Note that these derived types may be
+recursive: For example, it is possible to have a two dimensional array.</p>
</div>
-
<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="t_array">Array Type</a>
-</div>
-
+<div class="doc_subsubsection"> <a name="t_array">Array Type</a> </div>
<div class="doc_text">
-
<h5>Overview:</h5>
-
<p>The array type is a very simple derived type that arranges elements
-sequentially in memory. The array type requires a size (number of elements) and
-an underlying data type.</p>
-
+sequentially in memory. The array type requires a size (number of
+elements) and an underlying data type.</p>
<h5>Syntax:</h5>
-
-<pre>
- [<# elements> x <elementtype>]
-</pre>
-
-<p>The number of elements is a constant integer value, elementtype may be any
-type with a size.</p>
-
+<pre> [<# elements> x <elementtype>]<br></pre>
+<p>The number of elements is a constant integer value, elementtype may
+be any type with a size.</p>
<h5>Examples:</h5>
-
-<p>
- <tt>[40 x int ]</tt>: Array of 40 integer values.<br>
- <tt>[41 x int ]</tt>: Array of 41 integer values.<br>
- <tt>[40 x uint]</tt>: Array of 40 unsigned integer values.<p>
-</p>
-
+<p> <tt>[40 x int ]</tt>: Array of 40 integer values.<br>
+<tt>[41 x int ]</tt>: Array of 41 integer values.<br>
+<tt>[40 x uint]</tt>: Array of 40 unsigned integer values.</p>
+<p> </p>
<p>Here are some examples of multidimensional arrays:</p>
-
<p>
<table border="0" cellpadding="0" cellspacing="0">
-<tr>
- <td><tt>[3 x [4 x int]]</tt></td>
- <td>: 3x4 array integer values.</td>
-</tr>
-<tr>
- <td><tt>[12 x [10 x float]]</tt></td>
- <td>: 12x10 array of single precision floating point values.</td>
-</tr>
-<tr>
- <td><tt>[2 x [3 x [4 x uint]]]</tt></td>
- <td>: 2x3x4 array of unsigned integer values.</td>
-</tr>
+ <tbody>
+ <tr>
+ <td><tt>[3 x [4 x int]]</tt></td>
+ <td>: 3x4 array integer values.</td>
+ </tr>
+ <tr>
+ <td><tt>[12 x [10 x float]]</tt></td>
+ <td>: 12x10 array of single precision floating point values.</td>
+ </tr>
+ <tr>
+ <td><tt>[2 x [3 x [4 x uint]]]</tt></td>
+ <td>: 2x3x4 array of unsigned integer values.</td>
+ </tr>
+ </tbody>
</table>
</p>
-
</div>
-
<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="t_function">Function Type</a>
-</div>
-
+<div class="doc_subsubsection"> <a name="t_function">Function Type</a> </div>
<div class="doc_text">
-
<h5>Overview:</h5>
-
-<p>The function type can be thought of as a function signature. It consists of
-a return type and a list of formal parameter types. Function types are usually
-used when to build virtual function tables (which are structures of pointers to
-functions), for indirect function calls, and when defining a function.</p>
-
-<h5>Syntax:</h5>
-
-<pre>
- <returntype> (<parameter list>)
-</pre>
-
-<p>Where '<tt><parameter list></tt>' is a comma-separated list of type
-specifiers. Optionally, the parameter list may include a type <tt>...</tt>,
+<p>The function type can be thought of as a function signature. It
+consists of a return type and a list of formal parameter types.
+Function types are usually used when to build virtual function tables
+(which are structures of pointers to functions), for indirect function
+calls, and when defining a function.</p>
+<h5>Syntax:</h5>
+<pre> <returntype> (<parameter list>)<br></pre>
+<p>Where '<tt><parameter list></tt>' is a comma-separated list of
+type specifiers. Optionally, the parameter list may include a type <tt>...</tt>,
which indicates that the function takes a variable number of arguments.
Variable argument functions can access their arguments with the <a
-href="#int_varargs">variable argument handling intrinsic</a> functions.</p>
-
+ href="#int_varargs">variable argument handling intrinsic</a> functions.</p>
<h5>Examples:</h5>
-
<p>
<table border="0" cellpadding="0" cellspacing="0">
-
-<tr>
- <td><tt>int (int)</tt></td>
- <td>: function taking an <tt>int</tt>, returning an <tt>int</tt></td>
-</tr>
-<tr>
- <td><tt>float (int, int *) *</tt></td>
- <td>: <a href="#t_pointer">Pointer</a> to a function that takes an
- <tt>int</tt> and a <a href="#t_pointer">pointer</a> to <tt>int</tt>,
- returning <tt>float</tt>.</td>
-</tr>
-<tr>
- <td><tt>int (sbyte *, ...)</tt></td>
- <td>: A vararg function that takes at least one <a
- href="#t_pointer">pointer</a> to <tt>sbyte</tt> (signed char in C), which
- returns an integer. This is the signature for <tt>printf</tt> in
- LLVM.</td>
-</tr>
+ <tbody>
+ <tr>
+ <td><tt>int (int)</tt></td>
+ <td>: function taking an <tt>int</tt>, returning an <tt>int</tt></td>
+ </tr>
+ <tr>
+ <td><tt>float (int, int *) *</tt></td>
+ <td>: <a href="#t_pointer">Pointer</a> to a function that takes
+an <tt>int</tt> and a <a href="#t_pointer">pointer</a> to <tt>int</tt>,
+returning <tt>float</tt>.</td>
+ </tr>
+ <tr>
+ <td><tt>int (sbyte *, ...)</tt></td>
+ <td>: A vararg function that takes at least one <a
+ href="#t_pointer">pointer</a> to <tt>sbyte</tt> (signed char in C),
+which returns an integer. This is the signature for <tt>printf</tt>
+in LLVM.</td>
+ </tr>
+ </tbody>
</table>
</p>
-
</div>
-
<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="t_struct">Structure Type</a>
-</div>
-
+<div class="doc_subsubsection"> <a name="t_struct">Structure Type</a> </div>
<div class="doc_text">
-
<h5>Overview:</h5>
-
-<p>The structure type is used to represent a collection of data members together
-in memory. The packing of the field types is defined to match the ABI of the
-underlying processor. The elements of a structure may be any type that has a
-size.</p>
-
-<p>Structures are accessed using '<tt><a href="#i_load">load</a></tt> and
-'<tt><a href="#i_store">store</a></tt>' by getting a pointer to a field with the
-'<tt><a href="#i_getelementptr">getelementptr</a></tt>' instruction.</p>
-
+<p>The structure type is used to represent a collection of data members
+together in memory. The packing of the field types is defined to match
+the ABI of the underlying processor. The elements of a structure may
+be any type that has a size.</p>
+<p>Structures are accessed using '<tt><a href="#i_load">load</a></tt>
+and '<tt><a href="#i_store">store</a></tt>' by getting a pointer to a
+field with the '<tt><a href="#i_getelementptr">getelementptr</a></tt>'
+instruction.</p>
<h5>Syntax:</h5>
-
-<pre>
- { <type list> }
-</pre>
-
+<pre> { <type list> }<br></pre>
<h5>Examples:</h5>
-
<p>
<table border="0" cellpadding="0" cellspacing="0">
-<tr>
- <td><tt>{ int, int, int }</tt></td>
- <td>: a triple of three <tt>int</tt> values</td>
-</tr>
-<tr>
- <td><tt>{ float, int (int) * }</tt></td>
- <td>: A pair, where the first element is a <tt>float</tt> and the second
- element is a <a href="#t_pointer">pointer</a> to a <a
- href="t_function">function</a> that takes an <tt>int</tt>, returning an
- <tt>int</tt>.</td>
-</tr>
+ <tbody>
+ <tr>
+ <td><tt>{ int, int, int }</tt></td>
+ <td>: a triple of three <tt>int</tt> values</td>
+ </tr>
+ <tr>
+ <td><tt>{ float, int (int) * }</tt></td>
+ <td>: A pair, where the first element is a <tt>float</tt> and the
+second element is a <a href="#t_pointer">pointer</a> to a <a
+ href="t_function">function</a> that takes an <tt>int</tt>, returning
+an <tt>int</tt>.</td>
+ </tr>
+ </tbody>
</table>
</p>
-
</div>
-
<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="t_pointer">Pointer Type</a>
-</div>
-
+<div class="doc_subsubsection"> <a name="t_pointer">Pointer Type</a> </div>
<div class="doc_text">
-
<h5>Overview:</h5>
-
-<p>As in many languages, the pointer type represents a pointer or reference to
-another object, which must live in memory.</p>
-
+<p>As in many languages, the pointer type represents a pointer or
+reference to another object, which must live in memory.</p>
<h5>Syntax:</h5>
-<pre>
- <type> *
-</pre>
-
+<pre> <type> *<br></pre>
<h5>Examples:</h5>
-
<p>
<table border="0" cellpadding="0" cellspacing="0">
-<tr>
- <td><tt>[4x int]*</tt></td>
- <td>: <a href="#t_pointer">pointer</a> to <a href="#t_array">array</a> of four
- <tt>int</tt> values</td>
-</tr>
-<tr>
- <td><tt>int (int *) *</tt></td>
- <td>: A <a href="#t_pointer">pointer</a> to a <a
- href="t_function">function</a> that takes an <tt>int</tt>, returning an
- <tt>int</tt>.</td>
-</tr>
+ <tbody>
+ <tr>
+ <td><tt>[4x int]*</tt></td>
+ <td>: <a href="#t_pointer">pointer</a> to <a href="#t_array">array</a>
+of four <tt>int</tt> values</td>
+ </tr>
+ <tr>
+ <td><tt>int (int *) *</tt></td>
+ <td>: A <a href="#t_pointer">pointer</a> to a <a
+ href="t_function">function</a> that takes an <tt>int</tt>, returning
+an <tt>int</tt>.</td>
+ </tr>
+ </tbody>
</table>
</p>
-
</div>
-
-<!-- _______________________________________________________________________ -->
-<!--
+<!-- _______________________________________________________________________ --><!--
<div class="doc_subsubsection">
<a name="t_packed">Packed Type</a>
</div>
@@ -589,33 +515,20 @@
</div>
--->
-
-
-<!-- *********************************************************************** -->
-<div class="doc_section">
- <a name="highlevel">High Level Structure</a>
-</div>
-<!-- *********************************************************************** -->
-
-
-<!-- ======================================================================= -->
-<div class="doc_subsection">
- <a name="modulestructure">Module Structure</a>
-</div>
-
-<div class="doc_text">
-
-<p>LLVM programs are composed of "Module"s, each of which is a translation unit
-of the input programs. Each module consists of functions, global variables, and
-symbol table entries. Modules may be combined together with the LLVM linker,
-which merges function (and global variable) definitions, resolves forward
-declarations, and merges symbol table entries. Here is an example of the "hello
-world" module:</p>
-
-<pre>
-<i>; Declare the string constant as a global constant...</i>
-<a href="#identifiers">%.LC0</a> = <a href="#linkage_internal">internal</a> <a href="#globalvars">constant</a> <a href="#t_array">[13 x sbyte]</a> c"hello world\0A\00" <i>; [13 x sbyte]*</i>
+--><!-- *********************************************************************** -->
+<div class="doc_section"> <a name="highlevel">High Level Structure</a> </div>
+<!-- *********************************************************************** --><!-- ======================================================================= -->
+<div class="doc_subsection"> <a name="modulestructure">Module Structure</a> </div>
+<div class="doc_text">
+<p>LLVM programs are composed of "Module"s, each of which is a
+translation unit of the input programs. Each module consists of
+functions, global variables, and symbol table entries. Modules may be
+combined together with the LLVM linker, which merges function (and
+global variable) definitions, resolves forward declarations, and merges
+symbol table entries. Here is an example of the "hello world" module:</p>
+<pre><i>; Declare the string constant as a global constant...</i>
+<a href="#identifiers">%.LC0</a> = <a href="#linkage_internal">internal</a> <a
+ href="#globalvars">constant</a> <a href="#t_array">[13 x sbyte]</a> c"hello world\0A\00" <i>; [13 x sbyte]*</i>
<i>; External declaration of the puts function</i>
<a href="#functionstructure">declare</a> int %puts(sbyte*) <i>; int(sbyte*)* </i>
@@ -623,307 +536,223 @@
<i>; Definition of main function</i>
int %main() { <i>; int()* </i>
<i>; Convert [13x sbyte]* to sbyte *...</i>
- %cast210 = <a href="#i_getelementptr">getelementptr</a> [13 x sbyte]* %.LC0, long 0, long 0 <i>; sbyte*</i>
+ %cast210 = <a
+ href="#i_getelementptr">getelementptr</a> [13 x sbyte]* %.LC0, long 0, long 0 <i>; sbyte*</i>
<i>; Call puts function to write out the string to stdout...</i>
- <a href="#i_call">call</a> int %puts(sbyte* %cast210) <i>; int</i>
- <a href="#i_ret">ret</a> int 0
-}
-</pre>
-
-<p>This example is made up of a <a href="#globalvars">global variable</a> named
-"<tt>.LC0</tt>", an external declaration of the "<tt>puts</tt>" function, and a
-<a href="#functionstructure">function definition</a> for "<tt>main</tt>".</p>
-
-<a name="linkage">
-In general, a module is made up of a list of global values, where both functions
-and global variables are global values. Global values are represented by a
-pointer to a memory location (in this case, a pointer to an array of char, and a
-pointer to a function), and have one of the following linkage types:<p>
-
+ <a
+ href="#i_call">call</a> int %puts(sbyte* %cast210) <i>; int</i>
+ <a
+ href="#i_ret">ret</a> int 0<br>}<br></pre>
+<p>This example is made up of a <a href="#globalvars">global variable</a>
+named "<tt>.LC0</tt>", an external declaration of the "<tt>puts</tt>"
+function, and a <a href="#functionstructure">function definition</a>
+for "<tt>main</tt>".</p>
+<a name="linkage"> In general, a module is made up of a list of global
+values, where both functions and global variables are global values.
+Global values are represented by a pointer to a memory location (in
+this case, a pointer to an array of char, and a pointer to a function),
+and have one of the following linkage types:</a>
+<p> </p>
<dl>
-<a name="linkage_internal">
-<dt><tt><b>internal</b></tt>
-
-<dd>Global values with internal linkage are only directly accessible by objects
-in the current module. In particular, linking code into a module with an
-internal global value may cause the internal to be renamed as necessary to avoid
-collisions. Because the symbol is internal to the module, all references can be
-updated. This corresponds to the notion of the '<tt>static</tt>' keyword in C,
-or the idea of "anonymous namespaces" in C++.<p>
-
-<a name="linkage_linkonce">
-<dt><tt><b>linkonce</b></tt>:
-
-<dd>"<tt>linkonce</tt>" linkage is similar to <tt>internal</tt> linkage, with
-the twist that linking together two modules defining the same <tt>linkonce</tt>
-globals will cause one of the globals to be discarded. This is typically used
-to implement inline functions. Unreferenced <tt>linkonce</tt> globals are
-allowed to be discarded.<p>
-
-<a name="linkage_weak">
-<dt><tt><b>weak</b></tt>:
-
-<dd>"<tt>weak</tt>" linkage is exactly the same as <tt>linkonce</tt> linkage,
-except that unreferenced <tt>weak</tt> globals may not be discarded. This is
-used to implement constructs in C such as "<tt>int X;</tt>" at global scope.<p>
-
-<a name="linkage_appending">
-<dt><tt><b>appending</b></tt>:
-
-<dd>"<tt>appending</tt>" linkage may only be applied to global variables of
-pointer
-to array type. When two global variables with appending linkage are linked
-together, the two global arrays are appended together. This is the LLVM,
-typesafe, equivalent of having the system linker append together "sections" with
-identical names when .o files are linked.<p>
-
-<a name="linkage_external">
-<dt><tt><b>externally visible</b></tt>:
-
-<dd>If none of the above identifiers are used, the global is externally visible,
-meaning that it participates in linkage and can be used to resolve external
-symbol references.<p>
-
-</dl><p>
-
-<p>For example, since the "<tt>.LC0</tt>" variable is defined to be internal, if
-another module defined a "<tt>.LC0</tt>" variable and was linked with this one,
-one of the two would be renamed, preventing a collision. Since "<tt>main</tt>"
-and "<tt>puts</tt>" are external (i.e., lacking any linkage declarations), they
-are accessible outside of the current module. It is illegal for a function
-<i>declaration</i> to have any linkage type other than "externally visible".</p>
-
+ <a name="linkage_internal"> <dt><tt><b>internal</b></tt> </dt>
+ <dd>Global values with internal linkage are only directly accessible
+by objects in the current module. In particular, linking code into a
+module with an internal global value may cause the internal to be
+renamed as necessary to avoid collisions. Because the symbol is
+internal to the module, all references can be updated. This
+corresponds to the notion of the '<tt>static</tt>' keyword in C, or the
+idea of "anonymous namespaces" in C++.
+ <p> </p>
+ </dd>
+ </a><a name="linkage_linkonce"> <dt><tt><b>linkonce</b></tt>: </dt>
+ <dd>"<tt>linkonce</tt>" linkage is similar to <tt>internal</tt>
+linkage, with the twist that linking together two modules defining the
+same <tt>linkonce</tt> globals will cause one of the globals to be
+discarded. This is typically used to implement inline functions.
+Unreferenced <tt>linkonce</tt> globals are allowed to be discarded.
+ <p> </p>
+ </dd>
+ </a><a name="linkage_weak"> <dt><tt><b>weak</b></tt>: </dt>
+ <dd>"<tt>weak</tt>" linkage is exactly the same as <tt>linkonce</tt>
+linkage, except that unreferenced <tt>weak</tt> globals may not be
+discarded. This is used to implement constructs in C such as "<tt>int
+X;</tt>" at global scope.
+ <p> </p>
+ </dd>
+ </a><a name="linkage_appending"> <dt><tt><b>appending</b></tt>: </dt>
+ <dd>"<tt>appending</tt>" linkage may only be applied to global
+variables of pointer to array type. When two global variables with
+appending linkage are linked together, the two global arrays are
+appended together. This is the LLVM, typesafe, equivalent of having
+the system linker append together "sections" with identical names when
+.o files are linked.
+ <p> </p>
+ </dd>
+ </a><a name="linkage_external"> <dt><tt><b>externally visible</b></tt>:</dt>
+ <dd>If none of the above identifiers are used, the global is
+externally visible, meaning that it participates in linkage and can be
+used to resolve external symbol references.
+ <p> </p>
+ </dd>
+ </a>
+</dl>
+<p> </p>
+<p><a name="linkage_external">For example, since the "<tt>.LC0</tt>"
+variable is defined to be internal, if another module defined a "<tt>.LC0</tt>"
+variable and was linked with this one, one of the two would be renamed,
+preventing a collision. Since "<tt>main</tt>" and "<tt>puts</tt>" are
+external (i.e., lacking any linkage declarations), they are accessible
+outside of the current module. It is illegal for a function <i>declaration</i>
+to have any linkage type other than "externally visible".</a></p>
</div>
-
<!-- ======================================================================= -->
-<div class="doc_subsection">
- <a name="globalvars">Global Variables</a>
-</div>
-
+<div class="doc_subsection"> <a name="globalvars">Global Variables</a> </div>
<div class="doc_text">
-
-<p>Global variables define regions of memory allocated at compilation time
-instead of run-time. Global variables may optionally be initialized. A
-variable may be defined as a global "constant", which indicates that the
-contents of the variable will never be modified (opening options for
-optimization). Constants must always have an initial value.</p>
-
-<p>As SSA values, global variables define pointer values that are in scope
-(i.e. they dominate) for all basic blocks in the program. Global variables
-always define a pointer to their "content" type because they describe a region
-of memory, and all memory objects in LLVM are accessed through pointers.</p>
-
+<p>Global variables define regions of memory allocated at compilation
+time instead of run-time. Global variables may optionally be
+initialized. A variable may be defined as a global "constant", which
+indicates that the contents of the variable will never be modified
+(opening options for optimization). Constants must always have an
+initial value.</p>
+<p>As SSA values, global variables define pointer values that are in
+scope (i.e. they dominate) for all basic blocks in the program. Global
+variables always define a pointer to their "content" type because they
+describe a region of memory, and all memory objects in LLVM are
+accessed through pointers.</p>
</div>
-
<!-- ======================================================================= -->
-<div class="doc_subsection">
- <a name="functionstructure">Functions</a>
-</div>
-
+<div class="doc_subsection"> <a name="functionstructure">Functions</a> </div>
<div class="doc_text">
-
-<p>LLVM function definitions are composed of a (possibly empty) argument list,
-an opening curly brace, a list of basic blocks, and a closing curly brace. LLVM
-function declarations are defined with the "<tt>declare</tt>" keyword, a
-function name, and a function signature.</p>
-
-<p>A function definition contains a list of basic blocks, forming the CFG for
-the function. Each basic block may optionally start with a label (giving the
-basic block a symbol table entry), contains a list of instructions, and ends
-with a <a href="#terminators">terminator</a> instruction (such as a branch or
-function return).</p>
-
-<p>The first basic block in program is special in two ways: it is immediately
-executed on entrance to the function, and it is not allowed to have predecessor
-basic blocks (i.e. there can not be any branches to the entry block of a
-function). Because the block can have no predecessors, it also cannot have any
-<a href="#i_phi">PHI nodes</a>.</p>
-
+<p>LLVM function definitions are composed of a (possibly empty)
+argument list, an opening curly brace, a list of basic blocks, and a
+closing curly brace. LLVM function declarations are defined with the "<tt>declare</tt>"
+keyword, a function name, and a function signature.</p>
+<p>A function definition contains a list of basic blocks, forming the
+CFG for the function. Each basic block may optionally start with a
+label (giving the basic block a symbol table entry), contains a list of
+instructions, and ends with a <a href="#terminators">terminator</a>
+instruction (such as a branch or function return).</p>
+<p>The first basic block in program is special in two ways: it is
+immediately executed on entrance to the function, and it is not allowed
+to have predecessor basic blocks (i.e. there can not be any branches to
+the entry block of a function). Because the block can have no
+predecessors, it also cannot have any <a href="#i_phi">PHI nodes</a>.</p>
</div>
-
<!-- *********************************************************************** -->
-<div class="doc_section">
- <a name="instref">Instruction Reference</a>
-</div>
+<div class="doc_section"> <a name="instref">Instruction Reference</a> </div>
<!-- *********************************************************************** -->
-
<div class="doc_text">
-
-<p>The LLVM instruction set consists of several different classifications of
-instructions: <a href="#terminators">terminator instructions</a>, <a
-href="#binaryops">binary instructions</a>, <a href="#memoryops">memory
-instructions</a>, and <a href="#otherops">other instructions</a>.</p>
-
+<p>The LLVM instruction set consists of several different
+classifications of instructions: <a href="#terminators">terminator
+instructions</a>, <a href="#binaryops">binary instructions</a>, <a
+ href="#memoryops">memory instructions</a>, and <a href="#otherops">other
+instructions</a>.</p>
</div>
-
<!-- ======================================================================= -->
-<div class="doc_subsection">
- <a name="terminators">Terminator Instructions</a>
-</div>
-
+<div class="doc_subsection"> <a name="terminators">Terminator
+Instructions</a> </div>
<div class="doc_text">
-
-<p>As mentioned <a href="#functionstructure">previously</a>, every basic block
-in a program ends with a "Terminator" instruction, which indicates which block
-should be executed after the current block is finished. These terminator
-instructions typically yield a '<tt>void</tt>' value: they produce control flow,
-not values (the one exception being the '<a
-href="#i_invoke"><tt>invoke</tt></a>' instruction).</p>
-
+<p>As mentioned <a href="#functionstructure">previously</a>, every
+basic block in a program ends with a "Terminator" instruction, which
+indicates which block should be executed after the current block is
+finished. These terminator instructions typically yield a '<tt>void</tt>'
+value: they produce control flow, not values (the one exception being
+the '<a href="#i_invoke"><tt>invoke</tt></a>' instruction).</p>
<p>There are five different terminator instructions: the '<a
-href="#i_ret"><tt>ret</tt></a>' instruction, the '<a
-href="#i_br"><tt>br</tt></a>' instruction, the '<a
-href="#i_switch"><tt>switch</tt></a>' instruction, the '<a
-href="#i_invoke"><tt>invoke</tt></a>' instruction, and the '<a
-href="#i_unwind"><tt>unwind</tt></a>' instruction.</p>
-
+ href="#i_ret"><tt>ret</tt></a>' instruction, the '<a href="#i_br"><tt>br</tt></a>'
+instruction, the '<a href="#i_switch"><tt>switch</tt></a>' instruction,
+the '<a href="#i_invoke"><tt>invoke</tt></a>' instruction, and the '<a
+ href="#i_unwind"><tt>unwind</tt></a>' instruction.</p>
</div>
-
<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="i_ret">'<tt>ret</tt>' Instruction</a>
-</div>
-
+<div class="doc_subsubsection"> <a name="i_ret">'<tt>ret</tt>'
+Instruction</a> </div>
<div class="doc_text">
-
<h5>Syntax:</h5>
-<pre>
- ret <type> <value> <i>; Return a value from a non-void function</i>
+<pre> ret <type> <value> <i>; Return a value from a non-void function</i>
ret void <i>; Return from void function</i>
</pre>
-
<h5>Overview:</h5>
-
-<p>The '<tt>ret</tt>' instruction is used to return control flow (and a value)
-from a function, back to the caller.</p>
-
-<p>There are two forms of the '<tt>ret</tt>' instructruction: one that returns a
-value and then causes control flow, and one that just causes control flow to
-occur.</p>
-
-<h5>Arguments:</h5>
-
-<p>The '<tt>ret</tt>' instruction may return any '<a href="#t_firstclass">first
-class</a>' type. Notice that a function is not <a href="#wellformed">well
-formed</a> if there exists a '<tt>ret</tt>' instruction inside of the function
-that returns a value that does not match the return type of the function.</p>
-
-<h5>Semantics:</h5>
-
-<p>When the '<tt>ret</tt>' instruction is executed, control flow returns back to
-the calling function's context. If the caller is a "<a
-href="#i_call"><tt>call</tt></a> instruction, execution continues at the
-instruction after the call. If the caller was an "<a
-href="#i_invoke"><tt>invoke</tt></a>" instruction, execution continues at the
-beginning "normal" of the destination block. If the instruction returns a
-value, that value shall set the call or invoke instruction's return value.</p>
-
+<p>The '<tt>ret</tt>' instruction is used to return control flow (and a
+value) from a function, back to the caller.</p>
+<p>There are two forms of the '<tt>ret</tt>' instructruction: one that
+returns a value and then causes control flow, and one that just causes
+control flow to occur.</p>
+<h5>Arguments:</h5>
+<p>The '<tt>ret</tt>' instruction may return any '<a
+ href="#t_firstclass">first class</a>' type. Notice that a function is
+not <a href="#wellformed">well formed</a> if there exists a '<tt>ret</tt>'
+instruction inside of the function that returns a value that does not
+match the return type of the function.</p>
+<h5>Semantics:</h5>
+<p>When the '<tt>ret</tt>' instruction is executed, control flow
+returns back to the calling function's context. If the caller is a "<a
+ href="#i_call"><tt>call</tt></a> instruction, execution continues at
+the instruction after the call. If the caller was an "<a
+ href="#i_invoke"><tt>invoke</tt></a>" instruction, execution continues
+at the beginning "normal" of the destination block. If the instruction
+returns a value, that value shall set the call or invoke instruction's
+return value.</p>
<h5>Example:</h5>
-<pre>
- ret int 5 <i>; Return an integer value of 5</i>
+<pre> ret int 5 <i>; Return an integer value of 5</i>
ret void <i>; Return from a void function</i>
</pre>
-
</div>
-
<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="i_br">'<tt>br</tt>' Instruction</a>
-</div>
-
+<div class="doc_subsubsection"> <a name="i_br">'<tt>br</tt>' Instruction</a> </div>
<div class="doc_text">
-
<h5>Syntax:</h5>
-
-<pre>
- br bool <cond>, label <iftrue>, label <iffalse>
- br label <dest> <i>; Unconditional branch</i>
+<pre> br bool <cond>, label <iftrue>, label <iffalse><br> br label <dest> <i>; Unconditional branch</i>
</pre>
-
<h5>Overview:</h5>
-
-<p>The '<tt>br</tt>' instruction is used to cause control flow to transfer to a
-different basic block in the current function. There are two forms of this
-instruction, corresponding to a conditional branch and an unconditional
-branch.</p>
-
+<p>The '<tt>br</tt>' instruction is used to cause control flow to
+transfer to a different basic block in the current function. There are
+two forms of this instruction, corresponding to a conditional branch
+and an unconditional branch.</p>
<h5>Arguments:</h5>
-
-<p>The conditional branch form of the '<tt>br</tt>' instruction takes a single
-'<tt>bool</tt>' value and two '<tt>label</tt>' values. The unconditional form
-of the '<tt>br</tt>' instruction takes a single '<tt>label</tt>' value as a
-target.</p>
-
+<p>The conditional branch form of the '<tt>br</tt>' instruction takes a
+single '<tt>bool</tt>' value and two '<tt>label</tt>' values. The
+unconditional form of the '<tt>br</tt>' instruction takes a single '<tt>label</tt>'
+value as a target.</p>
<h5>Semantics:</h5>
-
-<p>Upon execution of a conditional '<tt>br</tt>' instruction, the
-'<tt>bool</tt>' argument is evaluated. If the value is <tt>true</tt>, control
-flows to the '<tt>iftrue</tt>' <tt>label</tt> argument. If "cond" is
-<tt>false</tt>, control flows to the '<tt>iffalse</tt>' <tt>label</tt>
-argument.</p>
-
+<p>Upon execution of a conditional '<tt>br</tt>' instruction, the '<tt>bool</tt>'
+argument is evaluated. If the value is <tt>true</tt>, control flows
+to the '<tt>iftrue</tt>' <tt>label</tt> argument. If "cond" is <tt>false</tt>,
+control flows to the '<tt>iffalse</tt>' <tt>label</tt> argument.</p>
<h5>Example:</h5>
-
-<pre>
-Test:
- %cond = <a href="#i_setcc">seteq</a> int %a, %b
- br bool %cond, label %IfEqual, label %IfUnequal
-IfEqual:
- <a href="#i_ret">ret</a> int 1
-IfUnequal:
- <a href="#i_ret">ret</a> int 0
-</pre>
-
+<pre>Test:<br> %cond = <a href="#i_setcc">seteq</a> int %a, %b<br> br bool %cond, label %IfEqual, label %IfUnequal<br>IfEqual:<br> <a
+ href="#i_ret">ret</a> int 1<br>IfUnequal:<br> <a href="#i_ret">ret</a> int 0<br></pre>
</div>
-
<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="i_switch">'<tt>switch</tt>' Instruction</a>
-</div>
-
+<div class="doc_subsubsection"> <a name="i_switch">'<tt>switch</tt>'
+Instruction</a> </div>
<div class="doc_text">
-
<h5>Syntax:</h5>
-
-<pre>
- switch uint <value>, label <defaultdest> [ int <val>, label &dest>, ... ]
-</pre>
-
+<pre> switch uint <value>, label <defaultdest> [ int <val>, label &dest>, ... ]<br></pre>
<h5>Overview:</h5>
-
-<p>The '<tt>switch</tt>' instruction is used to transfer control flow to one of
-several different places. It is a generalization of the '<tt>br</tt>'
+<p>The '<tt>switch</tt>' instruction is used to transfer control flow
+to one of several different places. It is a generalization of the '<tt>br</tt>'
instruction, allowing a branch to occur to one of many possible
destinations.</p>
-
<h5>Arguments:</h5>
-
<p>The '<tt>switch</tt>' instruction uses three parameters: a '<tt>uint</tt>'
-comparison value '<tt>value</tt>', a default '<tt>label</tt>' destination, and
-an array of pairs of comparison value constants and '<tt>label</tt>'s.</p>
-
+comparison value '<tt>value</tt>', a default '<tt>label</tt>'
+destination, and an array of pairs of comparison value constants and '<tt>label</tt>'s.</p>
<h5>Semantics:</h5>
-
-<p>The <tt>switch</tt> instruction specifies a table of values and destinations.
-When the '<tt>switch</tt>' instruction is executed, this table is searched for
-the given value. If the value is found, the corresponding destination is
-branched to, otherwise the default value it transfered to.</p>
-
+<p>The <tt>switch</tt> instruction specifies a table of values and
+destinations. When the '<tt>switch</tt>' instruction is executed, this
+table is searched for the given value. If the value is found, the
+corresponding destination is branched to, otherwise the default value
+it transfered to.</p>
<h5>Implementation:</h5>
-
-<p>Depending on properties of the target machine and the particular
-<tt>switch</tt> instruction, this instruction may be code generated as a series
-of chained conditional branches, or with a lookup table.</p>
-
-<h5>Example:</h5>
-
-<pre>
- <i>; Emulate a conditional br instruction</i>
- %Val = <a href="#i_cast">cast</a> bool %value to uint
- switch uint %Val, label %truedest [int 0, label %falsedest ]
-
- <i>; Emulate an unconditional br instruction</i>
+<p>Depending on properties of the target machine and the particular <tt>switch</tt>
+instruction, this instruction may be code generated as a series of
+chained conditional branches, or with a lookup table.</p>
+<h5>Example:</h5>
+<pre> <i>; Emulate a conditional br instruction</i>
+ %Val = <a
+ href="#i_cast">cast</a> bool %value to uint<br> switch uint %Val, label %truedest [int 0, label %falsedest ]<br><br> <i>; Emulate an unconditional br instruction</i>
switch uint 0, label %dest [ ]
<i>; Implement a jump table:</i>
@@ -931,934 +760,647 @@
int 1, label %onone,
int 2, label %ontwo ]
</pre>
-
</div>
-
<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="i_invoke">'<tt>invoke</tt>' Instruction</a>
-</div>
-
+<div class="doc_subsubsection"> <a name="i_invoke">'<tt>invoke</tt>'
+Instruction</a> </div>
<div class="doc_text">
-
<h5>Syntax:</h5>
-
-<pre>
- <result> = invoke <ptr to function ty> %<function ptr val>(<function args>)
- to label <normal label> except label <exception label>
-</pre>
-
+<pre> <result> = invoke <ptr to function ty> %<function ptr val>(<function args>)<br> to label <normal label> except label <exception label><br></pre>
<h5>Overview:</h5>
-
-<p>The '<tt>invoke</tt>' instruction causes control to transfer to a specified
-function, with the possibility of control flow transfer to either the
-'<tt>normal</tt>' <tt>label</tt> label or the '<tt>exception</tt>'
-<tt>label</tt>. If the callee function returns with the "<tt><a
-href="#i_ret">ret</a></tt>" instruction, control flow will return to the
-"normal" label. If the callee (or any indirect callees) returns with the "<a
-href="#i_unwind"><tt>unwind</tt></a>" instruction, control is interrupted, and
-continued at the dynamically nearest "except" label.</p>
-
+<p>The '<tt>invoke</tt>' instruction causes control to transfer to a
+specified function, with the possibility of control flow transfer to
+either the '<tt>normal</tt>' <tt>label</tt> label or the '<tt>exception</tt>'<tt>label</tt>.
+If the callee function returns with the "<tt><a href="#i_ret">ret</a></tt>"
+instruction, control flow will return to the "normal" label. If the
+callee (or any indirect callees) returns with the "<a href="#i_unwind"><tt>unwind</tt></a>"
+instruction, control is interrupted, and continued at the dynamically
+nearest "except" label.</p>
<h5>Arguments:</h5>
-
<p>This instruction requires several arguments:</p>
-
<ol>
-
-<li>'<tt>ptr to function ty</tt>': shall be the signature of the pointer to
-function value being invoked. In most cases, this is a direct function
-invocation, but indirect <tt>invoke</tt>s are just as possible, branching off
-an arbitrary pointer to function value.
-
-<li>'<tt>function ptr val</tt>': An LLVM value containing a pointer to a
-function to be invoked.
-
-<li>'<tt>function args</tt>': argument list whose types match the function
-signature argument types. If the function signature indicates the function
-accepts a variable number of arguments, the extra arguments can be specified.
-
-<li>'<tt>normal label</tt>': the label reached when the called function executes
-a '<tt><a href="#i_ret">ret</a></tt>' instruction.
-
-<li>'<tt>exception label</tt>': the label reached when a callee returns with the
-<a href="#i_unwind"><tt>unwind</tt></a> instruction.
+ <li>'<tt>ptr to function ty</tt>': shall be the signature of the
+pointer to function value being invoked. In most cases, this is a
+direct function invocation, but indirect <tt>invoke</tt>s are just as
+possible, branching off an arbitrary pointer to function value. </li>
+ <li>'<tt>function ptr val</tt>': An LLVM value containing a pointer
+to a function to be invoked. </li>
+ <li>'<tt>function args</tt>': argument list whose types match the
+function signature argument types. If the function signature indicates
+the function accepts a variable number of arguments, the extra
+arguments can be specified. </li>
+ <li>'<tt>normal label</tt>': the label reached when the called
+function executes a '<tt><a href="#i_ret">ret</a></tt>' instruction. </li>
+ <li>'<tt>exception label</tt>': the label reached when a callee
+returns with the <a href="#i_unwind"><tt>unwind</tt></a> instruction. </li>
</ol>
-
<h5>Semantics:</h5>
-
<p>This instruction is designed to operate as a standard '<tt><a
-href="#i_call">call</a></tt>' instruction in most regards. The primary
-difference is that it establishes an association with a label, which is used by the runtime library to unwind the stack.</p>
-
-<p>This instruction is used in languages with destructors to ensure that proper
-cleanup is performed in the case of either a <tt>longjmp</tt> or a thrown
-exception. Additionally, this is important for implementation of
-'<tt>catch</tt>' clauses in high-level languages that support them.</p>
-
+ href="#i_call">call</a></tt>' instruction in most regards. The
+primary difference is that it establishes an association with a label,
+which is used by the runtime library to unwind the stack.</p>
+<p>This instruction is used in languages with destructors to ensure
+that proper cleanup is performed in the case of either a <tt>longjmp</tt>
+or a thrown exception. Additionally, this is important for
+implementation of '<tt>catch</tt>' clauses in high-level languages that
+support them.</p>
<h5>Example:</h5>
-
-<pre>
- %retval = invoke int %Test(int 15)
- to label %Continue
- except label %TestCleanup <i>; {int}:retval set</i>
+<pre> %retval = invoke int %Test(int 15)<br> to label %Continue<br> except label %TestCleanup <i>; {int}:retval set</i>
</pre>
-
</div>
-
<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="i_unwind">'<tt>unwind</tt>' Instruction</a>
-</div>
-
+<div class="doc_subsubsection"> <a name="i_unwind">'<tt>unwind</tt>'
+Instruction</a> </div>
<div class="doc_text">
-
<h5>Syntax:</h5>
-
-<pre>
- unwind
-</pre>
-
+<pre> unwind<br></pre>
<h5>Overview:</h5>
-
-<p>The '<tt>unwind</tt>' instruction unwinds the stack, continuing control flow
-at the first callee in the dynamic call stack which used an <a
-href="#i_invoke"><tt>invoke</tt></a> instruction to perform the call. This is
-primarily used to implement exception handling.</p>
-
+<p>The '<tt>unwind</tt>' instruction unwinds the stack, continuing
+control flow at the first callee in the dynamic call stack which used
+an <a href="#i_invoke"><tt>invoke</tt></a> instruction to perform the
+call. This is primarily used to implement exception handling.</p>
<h5>Semantics:</h5>
-
-<p>The '<tt>unwind</tt>' intrinsic causes execution of the current function to
-immediately halt. The dynamic call stack is then searched for the first <a
-href="#i_invoke"><tt>invoke</tt></a> instruction on the call stack. Once found,
-execution continues at the "exceptional" destination block specified by the
-<tt>invoke</tt> instruction. If there is no <tt>invoke</tt> instruction in the
-dynamic call chain, undefined behavior results.</p>
-
+<p>The '<tt>unwind</tt>' intrinsic causes execution of the current
+function to immediately halt. The dynamic call stack is then searched
+for the first <a href="#i_invoke"><tt>invoke</tt></a> instruction on
+the call stack. Once found, execution continues at the "exceptional"
+destination block specified by the <tt>invoke</tt> instruction. If
+there is no <tt>invoke</tt> instruction in the dynamic call chain,
+undefined behavior results.</p>
</div>
-
<!-- ======================================================================= -->
-<div class="doc_subsection">
- <a name="binaryops">Binary Operations</a>
-</div>
-
+<div class="doc_subsection"> <a name="binaryops">Binary Operations</a> </div>
<div class="doc_text">
-
-<p>Binary operators are used to do most of the computation in a program. They
-require two operands, execute an operation on them, and produce a single value.
-The result value of a binary operator is not necessarily the same type as its
-operands.</p>
-
+<p>Binary operators are used to do most of the computation in a
+program. They require two operands, execute an operation on them, and
+produce a single value. The result value of a binary operator is not
+necessarily the same type as its operands.</p>
<p>There are several different binary operators:</p>
-
</div>
-
<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="i_add">'<tt>add</tt>' Instruction</a>
-</div>
-
+<div class="doc_subsubsection"> <a name="i_add">'<tt>add</tt>'
+Instruction</a> </div>
<div class="doc_text">
-
<h5>Syntax:</h5>
-
-<pre>
- <result> = add <ty> <var1>, <var2> <i>; yields {ty}:result</i>
+<pre> <result> = add <ty> <var1>, <var2> <i>; yields {ty}:result</i>
</pre>
-
<h5>Overview:</h5>
-
<p>The '<tt>add</tt>' instruction returns the sum of its two operands.</p>
-
<h5>Arguments:</h5>
-
<p>The two arguments to the '<tt>add</tt>' instruction must be either <a
-href="#t_integer">integer</a> or <a href="#t_floating">floating point</a>
-values. Both arguments must have identical types.</p>
-
+ href="#t_integer">integer</a> or <a href="#t_floating">floating point</a>
+values. Both arguments must have identical types.</p>
<h5>Semantics:</h5>
-
<p>The value produced is the integer or floating point sum of the two
operands.</p>
-
<h5>Example:</h5>
-
-<pre>
- <result> = add int 4, %var <i>; yields {int}:result = 4 + %var</i>
+<pre> <result> = add int 4, %var <i>; yields {int}:result = 4 + %var</i>
</pre>
-
</div>
-
<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="i_sub">'<tt>sub</tt>' Instruction</a>
-</div>
-
+<div class="doc_subsubsection"> <a name="i_sub">'<tt>sub</tt>'
+Instruction</a> </div>
<div class="doc_text">
-
<h5>Syntax:</h5>
-
-<pre>
- <result> = sub <ty> <var1>, <var2> <i>; yields {ty}:result</i>
+<pre> <result> = sub <ty> <var1>, <var2> <i>; yields {ty}:result</i>
</pre>
-
<h5>Overview:</h5>
-
<p>The '<tt>sub</tt>' instruction returns the difference of its two
operands.</p>
-
-<p>Note that the '<tt>sub</tt>' instruction is used to represent the
-'<tt>neg</tt>' instruction present in most other intermediate
-representations.</p>
-
+<p>Note that the '<tt>sub</tt>' instruction is used to represent the '<tt>neg</tt>'
+instruction present in most other intermediate representations.</p>
<h5>Arguments:</h5>
-
<p>The two arguments to the '<tt>sub</tt>' instruction must be either <a
-href="#t_integer">integer</a> or <a href="#t_floating">floating point</a>
-values. Both arguments must have identical types.</p>
-
+ href="#t_integer">integer</a> or <a href="#t_floating">floating point</a>
+values. Both arguments must have identical types.</p>
<h5>Semantics:</h5>
-
-<p>The value produced is the integer or floating point difference of the two
-operands.</p>
-
+<p>The value produced is the integer or floating point difference of
+the two operands.</p>
<h5>Example:</h5>
-
-<pre>
- <result> = sub int 4, %var <i>; yields {int}:result = 4 - %var</i>
+<pre> <result> = sub int 4, %var <i>; yields {int}:result = 4 - %var</i>
<result> = sub int 0, %val <i>; yields {int}:result = -%var</i>
</pre>
-
</div>
-
<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="i_mul">'<tt>mul</tt>' Instruction</a>
-</div>
-
+<div class="doc_subsubsection"> <a name="i_mul">'<tt>mul</tt>'
+Instruction</a> </div>
<div class="doc_text">
-
<h5>Syntax:</h5>
-
-<pre>
- <result> = mul <ty> <var1>, <var2> <i>; yields {ty}:result</i>
+<pre> <result> = mul <ty> <var1>, <var2> <i>; yields {ty}:result</i>
</pre>
-
<h5>Overview:</h5>
-
-<p>The '<tt>mul</tt>' instruction returns the product of its two operands.</p>
-
+<p>The '<tt>mul</tt>' instruction returns the product of its two
+operands.</p>
<h5>Arguments:</h5>
-
<p>The two arguments to the '<tt>mul</tt>' instruction must be either <a
-href="#t_integer">integer</a> or <a href="#t_floating">floating point</a>
-values. Both arguments must have identical types.</p>
-
+ href="#t_integer">integer</a> or <a href="#t_floating">floating point</a>
+values. Both arguments must have identical types.</p>
<h5>Semantics:</h5>
-
-<p>The value produced is the integer or floating point product of the two
-operands.</p>
-
-<p>There is no signed vs unsigned multiplication. The appropriate action is
-taken based on the type of the operand.</p>
-
+<p>The value produced is the integer or floating point product of the
+two operands.</p>
+<p>There is no signed vs unsigned multiplication. The appropriate
+action is taken based on the type of the operand.</p>
<h5>Example:</h5>
-
-<pre>
- <result> = mul int 4, %var <i>; yields {int}:result = 4 * %var</i>
+<pre> <result> = mul int 4, %var <i>; yields {int}:result = 4 * %var</i>
</pre>
-
</div>
-
<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="i_div">'<tt>div</tt>' Instruction</a>
-</div>
-
+<div class="doc_subsubsection"> <a name="i_div">'<tt>div</tt>'
+Instruction</a> </div>
<div class="doc_text">
-
<h5>Syntax:</h5>
-
-<pre>
- <result> = div <ty> <var1>, <var2> <i>; yields {ty}:result</i>
+<pre> <result> = div <ty> <var1>, <var2> <i>; yields {ty}:result</i>
</pre>
-
<h5>Overview:</h5>
-
-<p>The '<tt>div</tt>' instruction returns the quotient of its two operands.</p>
-
+<p>The '<tt>div</tt>' instruction returns the quotient of its two
+operands.</p>
<h5>Arguments:</h5>
-
<p>The two arguments to the '<tt>div</tt>' instruction must be either <a
-href="#t_integer">integer</a> or <a href="#t_floating">floating point</a>
-values. Both arguments must have identical types.</p>
-
+ href="#t_integer">integer</a> or <a href="#t_floating">floating point</a>
+values. Both arguments must have identical types.</p>
<h5>Semantics:</h5>
-
-<p>The value produced is the integer or floating point quotient of the two
-operands.</p>
-
+<p>The value produced is the integer or floating point quotient of the
+two operands.</p>
<h5>Example:</h5>
-
-<pre>
- <result> = div int 4, %var <i>; yields {int}:result = 4 / %var</i>
+<pre> <result> = div int 4, %var <i>; yields {int}:result = 4 / %var</i>
</pre>
-
</div>
-
<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="i_rem">'<tt>rem</tt>' Instruction</a>
-</div>
-
+<div class="doc_subsubsection"> <a name="i_rem">'<tt>rem</tt>'
+Instruction</a> </div>
<div class="doc_text">
-
<h5>Syntax:</h5>
-
-<pre>
- <result> = rem <ty> <var1>, <var2> <i>; yields {ty}:result</i>
+<pre> <result> = rem <ty> <var1>, <var2> <i>; yields {ty}:result</i>
</pre>
-
<h5>Overview:</h5>
-
-<p>The '<tt>rem</tt>' instruction returns the remainder from the division of its
-two operands.</p>
-
+<p>The '<tt>rem</tt>' instruction returns the remainder from the
+division of its two operands.</p>
<h5>Arguments:</h5>
-
<p>The two arguments to the '<tt>rem</tt>' instruction must be either <a
-href="#t_integer">integer</a> or <a href="#t_floating">floating point</a>
-values. Both arguments must have identical types.</p>
-
+ href="#t_integer">integer</a> or <a href="#t_floating">floating point</a>
+values. Both arguments must have identical types.</p>
<h5>Semantics:</h5>
-
-<p>This returns the <i>remainder</i> of a division (where the result has the
-same sign as the divisor), not the <i>modulus</i> (where the result has the same
-sign as the dividend) of a value. For more information about the difference,
-see: <a href="http://mathforum.org/dr.math/problems/anne.4.28.99.html">The Math
-Forum</a>.</p>
-
+<p>This returns the <i>remainder</i> of a division (where the result
+has the same sign as the divisor), not the <i>modulus</i> (where the
+result has the same sign as the dividend) of a value. For more
+information about the difference, see: <a
+ href="http://mathforum.org/dr.math/problems/anne.4.28.99.html">The
+Math Forum</a>.</p>
<h5>Example:</h5>
-
-<pre>
- <result> = rem int 4, %var <i>; yields {int}:result = 4 % %var</i>
+<pre> <result> = rem int 4, %var <i>; yields {int}:result = 4 % %var</i>
</pre>
-
</div>
-
<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="i_setcc">'<tt>set<i>cc</i></tt>' Instructions</a>
-</div>
-
+<div class="doc_subsubsection"> <a name="i_setcc">'<tt>set<i>cc</i></tt>'
+Instructions</a> </div>
<div class="doc_text">
-
<h5>Syntax:</h5>
-
-<pre>
- <result> = seteq <ty> <var1>, <var2> <i>; yields {bool}:result</i>
+<pre> <result> = seteq <ty> <var1>, <var2> <i>; yields {bool}:result</i>
<result> = setne <ty> <var1>, <var2> <i>; yields {bool}:result</i>
<result> = setlt <ty> <var1>, <var2> <i>; yields {bool}:result</i>
<result> = setgt <ty> <var1>, <var2> <i>; yields {bool}:result</i>
<result> = setle <ty> <var1>, <var2> <i>; yields {bool}:result</i>
<result> = setge <ty> <var1>, <var2> <i>; yields {bool}:result</i>
</pre>
-
-<h5>Overview:</h5>
-
-<p>The '<tt>set<i>cc</i></tt>' family of instructions returns a boolean value
-based on a comparison of their two operands.</p>
-
-<h5>Arguments:</h5>
-
-<p>The two arguments to the '<tt>set<i>cc</i></tt>' instructions must be of <a
-href="#t_firstclass">first class</a> type (it is not possible to compare
-'<tt>label</tt>'s, '<tt>array</tt>'s, '<tt>structure</tt>' or '<tt>void</tt>'
-values, etc...). Both arguments must have identical types.</p>
-
+<h5>Overview:</h5>
+<p>The '<tt>set<i>cc</i></tt>' family of instructions returns a boolean
+value based on a comparison of their two operands.</p>
+<h5>Arguments:</h5>
+<p>The two arguments to the '<tt>set<i>cc</i></tt>' instructions must
+be of <a href="#t_firstclass">first class</a> type (it is not possible
+to compare '<tt>label</tt>'s, '<tt>array</tt>'s, '<tt>structure</tt>'
+or '<tt>void</tt>' values, etc...). Both arguments must have identical
+types.</p>
<h5>Semantics:</h5>
-
-<p>The '<tt>seteq</tt>' instruction yields a <tt>true</tt> '<tt>bool</tt>' value
-if both operands are equal.<br>
-
-The '<tt>setne</tt>' instruction yields a <tt>true</tt> '<tt>bool</tt>' value if
-both operands are unequal.<br>
-
-The '<tt>setlt</tt>' instruction yields a <tt>true</tt> '<tt>bool</tt>' value if
-the first operand is less than the second operand.<br>
-
-The '<tt>setgt</tt>' instruction yields a <tt>true</tt> '<tt>bool</tt>' value if
-the first operand is greater than the second operand.<br>
-
-The '<tt>setle</tt>' instruction yields a <tt>true</tt> '<tt>bool</tt>' value if
-the first operand is less than or equal to the second operand.<br>
-
-The '<tt>setge</tt>' instruction yields a <tt>true</tt> '<tt>bool</tt>' value if
-the first operand is greater than or equal to the second operand.</p>
-
+<p>The '<tt>seteq</tt>' instruction yields a <tt>true</tt> '<tt>bool</tt>'
+value if both operands are equal.<br>
+The '<tt>setne</tt>' instruction yields a <tt>true</tt> '<tt>bool</tt>'
+value if both operands are unequal.<br>
+The '<tt>setlt</tt>' instruction yields a <tt>true</tt> '<tt>bool</tt>'
+value if the first operand is less than the second operand.<br>
+The '<tt>setgt</tt>' instruction yields a <tt>true</tt> '<tt>bool</tt>'
+value if the first operand is greater than the second operand.<br>
+The '<tt>setle</tt>' instruction yields a <tt>true</tt> '<tt>bool</tt>'
+value if the first operand is less than or equal to the second operand.<br>
+The '<tt>setge</tt>' instruction yields a <tt>true</tt> '<tt>bool</tt>'
+value if the first operand is greater than or equal to the second
+operand.</p>
<h5>Example:</h5>
-
-<pre>
- <result> = seteq int 4, 5 <i>; yields {bool}:result = false</i>
+<pre> <result> = seteq int 4, 5 <i>; yields {bool}:result = false</i>
<result> = setne float 4, 5 <i>; yields {bool}:result = true</i>
<result> = setlt uint 4, 5 <i>; yields {bool}:result = true</i>
<result> = setgt sbyte 4, 5 <i>; yields {bool}:result = false</i>
<result> = setle sbyte 4, 5 <i>; yields {bool}:result = true</i>
<result> = setge sbyte 4, 5 <i>; yields {bool}:result = false</i>
</pre>
-
</div>
-
<!-- ======================================================================= -->
-<div class="doc_subsection">
- <a name="bitwiseops">Bitwise Binary Operations</a>
-</div>
-
+<div class="doc_subsection"> <a name="bitwiseops">Bitwise Binary
+Operations</a> </div>
<div class="doc_text">
-
-<p>Bitwise binary operators are used to do various forms of bit-twiddling in a
-program. They are generally very efficient instructions, and can commonly be
-strength reduced from other instructions. They require two operands, execute an
-operation on them, and produce a single value. The resulting value of the
-bitwise binary operators is always the same type as its first operand.</p>
-
+<p>Bitwise binary operators are used to do various forms of
+bit-twiddling in a program. They are generally very efficient
+instructions, and can commonly be strength reduced from other
+instructions. They require two operands, execute an operation on them,
+and produce a single value. The resulting value of the bitwise binary
+operators is always the same type as its first operand.</p>
</div>
-
<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="i_and">'<tt>and</tt>' Instruction</a>
-</div>
-
+<div class="doc_subsubsection"> <a name="i_and">'<tt>and</tt>'
+Instruction</a> </div>
<div class="doc_text">
-
<h5>Syntax:</h5>
-
-<pre>
- <result> = and <ty> <var1>, <var2> <i>; yields {ty}:result</i>
+<pre> <result> = and <ty> <var1>, <var2> <i>; yields {ty}:result</i>
</pre>
-
<h5>Overview:</h5>
-
-<p>The '<tt>and</tt>' instruction returns the bitwise logical and of its two
-operands.</p>
-
+<p>The '<tt>and</tt>' instruction returns the bitwise logical and of
+its two operands.</p>
<h5>Arguments:</h5>
-
<p>The two arguments to the '<tt>and</tt>' instruction must be <a
-href="#t_integral">integral</a> values. Both arguments must have identical
-types.</p>
-
+ href="#t_integral">integral</a> values. Both arguments must have
+identical types.</p>
<h5>Semantics:</h5>
-
<p>The truth table used for the '<tt>and</tt>' instruction is:</p>
-
-<p>
+<p> </p>
<center>
<table border="1" cellspacing="0" cellpadding="4">
-<tr><td>In0</td> <td>In1</td> <td>Out</td></tr>
-<tr><td>0</td> <td>0</td> <td>0</td></tr>
-<tr><td>0</td> <td>1</td> <td>0</td></tr>
-<tr><td>1</td> <td>0</td> <td>0</td></tr>
-<tr><td>1</td> <td>1</td> <td>1</td></tr>
-</table></center>
-</p>
-
+ <tbody>
+ <tr>
+ <td>In0</td>
+ <td>In1</td>
+ <td>Out</td>
+ </tr>
+ <tr>
+ <td>0</td>
+ <td>0</td>
+ <td>0</td>
+ </tr>
+ <tr>
+ <td>0</td>
+ <td>1</td>
+ <td>0</td>
+ </tr>
+ <tr>
+ <td>1</td>
+ <td>0</td>
+ <td>0</td>
+ </tr>
+ <tr>
+ <td>1</td>
+ <td>1</td>
+ <td>1</td>
+ </tr>
+ </tbody>
+</table>
+</center>
<h5>Example:</h5>
-
-<pre>
- <result> = and int 4, %var <i>; yields {int}:result = 4 & %var</i>
+<pre> <result> = and int 4, %var <i>; yields {int}:result = 4 & %var</i>
<result> = and int 15, 40 <i>; yields {int}:result = 8</i>
<result> = and int 4, 8 <i>; yields {int}:result = 0</i>
</pre>
-
</div>
-
<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="i_or">'<tt>or</tt>' Instruction</a>
-</div>
-
+<div class="doc_subsubsection"> <a name="i_or">'<tt>or</tt>' Instruction</a> </div>
<div class="doc_text">
-
<h5>Syntax:</h5>
-
-<pre>
- <result> = or <ty> <var1>, <var2> <i>; yields {ty}:result</i>
+<pre> <result> = or <ty> <var1>, <var2> <i>; yields {ty}:result</i>
</pre>
-
-<h5>Overview:</h5>
-
-<p>The '<tt>or</tt>' instruction returns the bitwise logical inclusive or of its
-two operands.</p>
-
+<h5>Overview:</h5>
+<p>The '<tt>or</tt>' instruction returns the bitwise logical inclusive
+or of its two operands.</p>
<h5>Arguments:</h5>
-
<p>The two arguments to the '<tt>or</tt>' instruction must be <a
-href="#t_integral">integral</a> values. Both arguments must have identical
-types.</p>
-
+ href="#t_integral">integral</a> values. Both arguments must have
+identical types.</p>
<h5>Semantics:</h5>
-
<p>The truth table used for the '<tt>or</tt>' instruction is:</p>
-
-<p>
-<center><table border="1" cellspacing="0" cellpadding="4">
-<tr><td>In0</td> <td>In1</td> <td>Out</td></tr>
-<tr><td>0</td> <td>0</td> <td>0</td></tr>
-<tr><td>0</td> <td>1</td> <td>1</td></tr>
-<tr><td>1</td> <td>0</td> <td>1</td></tr>
-<tr><td>1</td> <td>1</td> <td>1</td></tr>
-</table></center>
-</p>
-
+<p> </p>
+<center>
+<table border="1" cellspacing="0" cellpadding="4">
+ <tbody>
+ <tr>
+ <td>In0</td>
+ <td>In1</td>
+ <td>Out</td>
+ </tr>
+ <tr>
+ <td>0</td>
+ <td>0</td>
+ <td>0</td>
+ </tr>
+ <tr>
+ <td>0</td>
+ <td>1</td>
+ <td>1</td>
+ </tr>
+ <tr>
+ <td>1</td>
+ <td>0</td>
+ <td>1</td>
+ </tr>
+ <tr>
+ <td>1</td>
+ <td>1</td>
+ <td>1</td>
+ </tr>
+ </tbody>
+</table>
+</center>
<h5>Example:</h5>
-
-<pre>
- <result> = or int 4, %var <i>; yields {int}:result = 4 | %var</i>
+<pre> <result> = or int 4, %var <i>; yields {int}:result = 4 | %var</i>
<result> = or int 15, 40 <i>; yields {int}:result = 47</i>
<result> = or int 4, 8 <i>; yields {int}:result = 12</i>
</pre>
-
</div>
-
<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="i_xor">'<tt>xor</tt>' Instruction</a>
-</div>
-
+<div class="doc_subsubsection"> <a name="i_xor">'<tt>xor</tt>'
+Instruction</a> </div>
<div class="doc_text">
-
<h5>Syntax:</h5>
-
-<pre>
- <result> = xor <ty> <var1>, <var2> <i>; yields {ty}:result</i>
+<pre> <result> = xor <ty> <var1>, <var2> <i>; yields {ty}:result</i>
</pre>
-
<h5>Overview:</h5>
-
-<p>The '<tt>xor</tt>' instruction returns the bitwise logical exclusive or of
-its two operands. The <tt>xor</tt> is used to implement the "one's complement"
-operation, which is the "~" operator in C.</p>
-
+<p>The '<tt>xor</tt>' instruction returns the bitwise logical exclusive
+or of its two operands. The <tt>xor</tt> is used to implement the
+"one's complement" operation, which is the "~" operator in C.</p>
<h5>Arguments:</h5>
-
<p>The two arguments to the '<tt>xor</tt>' instruction must be <a
-href="#t_integral">integral</a> values. Both arguments must have identical
-types.</p>
-
+ href="#t_integral">integral</a> values. Both arguments must have
+identical types.</p>
<h5>Semantics:</h5>
-
<p>The truth table used for the '<tt>xor</tt>' instruction is:</p>
-
-<p>
-<center><table border="1" cellspacing="0" cellpadding="4">
-<tr><td>In0</td> <td>In1</td> <td>Out</td></tr>
-<tr><td>0</td> <td>0</td> <td>0</td></tr>
-<tr><td>0</td> <td>1</td> <td>1</td></tr>
-<tr><td>1</td> <td>0</td> <td>1</td></tr>
-<tr><td>1</td> <td>1</td> <td>0</td></tr>
-</table></center>
-<p>
-
+<p> </p>
+<center>
+<table border="1" cellspacing="0" cellpadding="4">
+ <tbody>
+ <tr>
+ <td>In0</td>
+ <td>In1</td>
+ <td>Out</td>
+ </tr>
+ <tr>
+ <td>0</td>
+ <td>0</td>
+ <td>0</td>
+ </tr>
+ <tr>
+ <td>0</td>
+ <td>1</td>
+ <td>1</td>
+ </tr>
+ <tr>
+ <td>1</td>
+ <td>0</td>
+ <td>1</td>
+ </tr>
+ <tr>
+ <td>1</td>
+ <td>1</td>
+ <td>0</td>
+ </tr>
+ </tbody>
+</table>
+</center>
+<p> </p>
<h5>Example:</h5>
-
-<pre>
- <result> = xor int 4, %var <i>; yields {int}:result = 4 ^ %var</i>
+<pre> <result> = xor int 4, %var <i>; yields {int}:result = 4 ^ %var</i>
<result> = xor int 15, 40 <i>; yields {int}:result = 39</i>
<result> = xor int 4, 8 <i>; yields {int}:result = 12</i>
<result> = xor int %V, -1 <i>; yields {int}:result = ~%V</i>
</pre>
-
</div>
-
<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="i_shl">'<tt>shl</tt>' Instruction</a>
-</div>
-
+<div class="doc_subsubsection"> <a name="i_shl">'<tt>shl</tt>'
+Instruction</a> </div>
<div class="doc_text">
-
<h5>Syntax:</h5>
-
-<pre>
- <result> = shl <ty> <var1>, ubyte <var2> <i>; yields {ty}:result</i>
+<pre> <result> = shl <ty> <var1>, ubyte <var2> <i>; yields {ty}:result</i>
</pre>
-
<h5>Overview:</h5>
-
-<p>The '<tt>shl</tt>' instruction returns the first operand shifted to the left
-a specified number of bits.</p>
-
+<p>The '<tt>shl</tt>' instruction returns the first operand shifted to
+the left a specified number of bits.</p>
<h5>Arguments:</h5>
-
<p>The first argument to the '<tt>shl</tt>' instruction must be an <a
-href="#t_integer">integer</a> type. The second argument must be an
-'<tt>ubyte</tt>' type.</p>
-
+ href="#t_integer">integer</a> type. The second argument must be an '<tt>ubyte</tt>'
+type.</p>
<h5>Semantics:</h5>
-
<p>The value produced is <tt>var1</tt> * 2<sup><tt>var2</tt></sup>.</p>
-
<h5>Example:</h5>
-
-<pre>
- <result> = shl int 4, ubyte %var <i>; yields {int}:result = 4 << %var</i>
+<pre> <result> = shl int 4, ubyte %var <i>; yields {int}:result = 4 << %var</i>
<result> = shl int 4, ubyte 2 <i>; yields {int}:result = 16</i>
<result> = shl int 1, ubyte 10 <i>; yields {int}:result = 1024</i>
</pre>
-
</div>
-
<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="i_shr">'<tt>shr</tt>' Instruction</a>
-</div>
-
+<div class="doc_subsubsection"> <a name="i_shr">'<tt>shr</tt>'
+Instruction</a> </div>
<div class="doc_text">
-
<h5>Syntax:</h5>
-
-<pre>
- <result> = shr <ty> <var1>, ubyte <var2> <i>; yields {ty}:result</i>
+<pre> <result> = shr <ty> <var1>, ubyte <var2> <i>; yields {ty}:result</i>
</pre>
-
<h5>Overview:</h5>
-
-<p>The '<tt>shr</tt>' instruction returns the first operand shifted to the right
-a specified number of bits.</p>
-
+<p>The '<tt>shr</tt>' instruction returns the first operand shifted to
+the right a specified number of bits.</p>
<h5>Arguments:</h5>
-
<p>The first argument to the '<tt>shr</tt>' instruction must be an <a
-href="#t_integer">integer</a> type. The second argument must be an
-'<tt>ubyte</tt>' type.</p>
-
+ href="#t_integer">integer</a> type. The second argument must be an '<tt>ubyte</tt>'
+type.</p>
<h5>Semantics:</h5>
-
-<p>If the first argument is a <a href="#t_signed">signed</a> type, the most
-significant bit is duplicated in the newly free'd bit positions. If the first
-argument is unsigned, zero bits shall fill the empty positions.</p>
-
+<p>If the first argument is a <a href="#t_signed">signed</a> type, the
+most significant bit is duplicated in the newly free'd bit positions.
+If the first argument is unsigned, zero bits shall fill the empty
+positions.</p>
<h5>Example:</h5>
-
-<pre>
- <result> = shr int 4, ubyte %var <i>; yields {int}:result = 4 >> %var</i>
+<pre> <result> = shr int 4, ubyte %var <i>; yields {int}:result = 4 >> %var</i>
<result> = shr uint 4, ubyte 1 <i>; yields {uint}:result = 2</i>
<result> = shr int 4, ubyte 2 <i>; yields {int}:result = 1</i>
<result> = shr sbyte 4, ubyte 3 <i>; yields {sbyte}:result = 0</i>
<result> = shr sbyte -2, ubyte 1 <i>; yields {sbyte}:result = -1</i>
</pre>
-
</div>
-
<!-- ======================================================================= -->
-<div class="doc_subsection">
- <a name="memoryops">Memory Access Operations</div>
-</div>
-
+<div class="doc_subsection"> <a name="memoryops">Memory Access
+Operations</a></div>
<div class="doc_text">
-
-<p>A key design point of an SSA-based representation is how it represents
-memory. In LLVM, no memory locations are in SSA form, which makes things very
-simple. This section describes how to read, write, allocate and free memory in
-LLVM.</p>
-
+<p>A key design point of an SSA-based representation is how it
+represents memory. In LLVM, no memory locations are in SSA form, which
+makes things very simple. This section describes how to read, write,
+allocate and free memory in LLVM.</p>
</div>
-
<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="i_malloc">'<tt>malloc</tt>' Instruction</a>
-</div>
-
+<div class="doc_subsubsection"> <a name="i_malloc">'<tt>malloc</tt>'
+Instruction</a> </div>
<div class="doc_text">
-
<h5>Syntax:</h5>
-
-<pre>
- <result> = malloc <type>, uint <NumElements> <i>; yields {type*}:result</i>
+<pre> <result> = malloc <type>, uint <NumElements> <i>; yields {type*}:result</i>
<result> = malloc <type> <i>; yields {type*}:result</i>
</pre>
-
<h5>Overview:</h5>
-
-<p>The '<tt>malloc</tt>' instruction allocates memory from the system heap and
-returns a pointer to it.</p>
-
+<p>The '<tt>malloc</tt>' instruction allocates memory from the system
+heap and returns a pointer to it.</p>
<h5>Arguments:</h5>
-
-<p>The the '<tt>malloc</tt>' instruction allocates
-<tt>sizeof(<type>)*NumElements</tt> bytes of memory from the operating
-system, and returns a pointer of the appropriate type to the program. The
-second form of the instruction is a shorter version of the first instruction
-that defaults to allocating one element.</p>
-
+<p>The the '<tt>malloc</tt>' instruction allocates <tt>sizeof(<type>)*NumElements</tt>
+bytes of memory from the operating system, and returns a pointer of the
+appropriate type to the program. The second form of the instruction is
+a shorter version of the first instruction that defaults to allocating
+one element.</p>
<p>'<tt>type</tt>' must be a sized type.</p>
-
<h5>Semantics:</h5>
-
-<p>Memory is allocated using the system "<tt>malloc</tt>" function, and a
-pointer is returned.</p>
-
+<p>Memory is allocated using the system "<tt>malloc</tt>" function, and
+a pointer is returned.</p>
<h5>Example:</h5>
+<pre> %array = malloc [4 x ubyte ] <i>; yields {[%4 x ubyte]*}:array</i>
-<pre>
- %array = malloc [4 x ubyte ] <i>; yields {[%4 x ubyte]*}:array</i>
-
- %size = <a href="#i_add">add</a> uint 2, 2 <i>; yields {uint}:size = uint 4</i>
+ %size = <a
+ href="#i_add">add</a> uint 2, 2 <i>; yields {uint}:size = uint 4</i>
%array1 = malloc ubyte, uint 4 <i>; yields {ubyte*}:array1</i>
%array2 = malloc [12 x ubyte], uint %size <i>; yields {[12 x ubyte]*}:array2</i>
</pre>
-
</div>
-
<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="i_free">'<tt>free</tt>' Instruction</a>
-</div>
-
+<div class="doc_subsubsection"> <a name="i_free">'<tt>free</tt>'
+Instruction</a> </div>
<div class="doc_text">
-
<h5>Syntax:</h5>
-
-<pre>
- free <type> <value> <i>; yields {void}</i>
+<pre> free <type> <value> <i>; yields {void}</i>
</pre>
-
<h5>Overview:</h5>
-
-<p>The '<tt>free</tt>' instruction returns memory back to the unused memory
-heap, to be reallocated in the future.<p>
-
+<p>The '<tt>free</tt>' instruction returns memory back to the unused
+memory heap, to be reallocated in the future.</p>
+<p> </p>
<h5>Arguments:</h5>
-
-<p>'<tt>value</tt>' shall be a pointer value that points to a value that was
-allocated with the '<tt><a href="#i_malloc">malloc</a></tt>' instruction.</p>
-
+<p>'<tt>value</tt>' shall be a pointer value that points to a value
+that was allocated with the '<tt><a href="#i_malloc">malloc</a></tt>'
+instruction.</p>
<h5>Semantics:</h5>
-
-<p>Access to the memory pointed to by the pointer is not longer defined after
-this instruction executes.</p>
-
+<p>Access to the memory pointed to by the pointer is not longer defined
+after this instruction executes.</p>
<h5>Example:</h5>
-<pre>
- %array = <a href="#i_malloc">malloc</a> [4 x ubyte] <i>; yields {[4 x ubyte]*}:array</i>
+<pre> %array = <a href="#i_malloc">malloc</a> [4 x ubyte] <i>; yields {[4 x ubyte]*}:array</i>
free [4 x ubyte]* %array
</pre>
-
</div>
-
<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="i_alloca">'<tt>alloca</tt>' Instruction</a>
-</div>
-
+<div class="doc_subsubsection"> <a name="i_alloca">'<tt>alloca</tt>'
+Instruction</a> </div>
<div class="doc_text">
-
<h5>Syntax:</h5>
-
-<pre>
- <result> = alloca <type>, uint <NumElements> <i>; yields {type*}:result</i>
+<pre> <result> = alloca <type>, uint <NumElements> <i>; yields {type*}:result</i>
<result> = alloca <type> <i>; yields {type*}:result</i>
</pre>
-
<h5>Overview:</h5>
-
-<p>The '<tt>alloca</tt>' instruction allocates memory on the current stack frame
-of the procedure that is live until the current function returns to its
-caller.</p>
-
-<h5>Arguments:</h5>
-
-<p>The the '<tt>alloca</tt>' instruction allocates
-<tt>sizeof(<type>)*NumElements</tt> bytes of memory on the runtime stack,
-returning a pointer of the appropriate type to the program. The second form of
-the instruction is a shorter version of the first that defaults to allocating
-one element.</p>
-
+<p>The '<tt>alloca</tt>' instruction allocates memory on the current
+stack frame of the procedure that is live until the current function
+returns to its caller.</p>
+<h5>Arguments:</h5>
+<p>The the '<tt>alloca</tt>' instruction allocates <tt>sizeof(<type>)*NumElements</tt>
+bytes of memory on the runtime stack, returning a pointer of the
+appropriate type to the program. The second form of the instruction is
+a shorter version of the first that defaults to allocating one element.</p>
<p>'<tt>type</tt>' may be any sized type.</p>
-
<h5>Semantics:</h5>
-
-<p>Memory is allocated, a pointer is returned. '<tt>alloca</tt>'d memory is
-automatically released when the function returns. The '<tt>alloca</tt>'
-instruction is commonly used to represent automatic variables that must have an
-address available. When the function returns (either with the <tt><a
-href="#i_ret">ret</a></tt> or <tt><a href="#i_invoke">invoke</a></tt>
+<p>Memory is allocated, a pointer is returned. '<tt>alloca</tt>'d
+memory is automatically released when the function returns. The '<tt>alloca</tt>'
+instruction is commonly used to represent automatic variables that must
+have an address available. When the function returns (either with the <tt><a
+ href="#i_ret">ret</a></tt> or <tt><a href="#i_invoke">invoke</a></tt>
instructions), the memory is reclaimed.</p>
-
<h5>Example:</h5>
-
-<pre>
- %ptr = alloca int <i>; yields {int*}:ptr</i>
+<pre> %ptr = alloca int <i>; yields {int*}:ptr</i>
%ptr = alloca int, uint 4 <i>; yields {int*}:ptr</i>
</pre>
-
</div>
-
<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="i_load">'<tt>load</tt>' Instruction</a>
-</div>
-
+<div class="doc_subsubsection"> <a name="i_load">'<tt>load</tt>'
+Instruction</a> </div>
<div class="doc_text">
-
<h5>Syntax:</h5>
-
-<pre>
- <result> = load <ty>* <pointer>
- <result> = volatile load <ty>* <pointer>
-</pre>
-
+<pre> <result> = load <ty>* <pointer><br> <result> = volatile load <ty>* <pointer><br></pre>
<h5>Overview:</h5>
-
<p>The '<tt>load</tt>' instruction is used to read from memory.</p>
-
<h5>Arguments:</h5>
-
-<p>The argument to the '<tt>load</tt>' instruction specifies the memory address
-to load from. The pointer must point to a <a href="t_firstclass">first
-class</a> type. If the <tt>load</tt> is marked as <tt>volatile</tt> then the
-optimizer is not allowed to modify the number or order of execution of this
-<tt>load</tt> with other volatile <tt>load</tt> and <tt><a
-href="#i_store">store</a></tt> instructions. </p>
-
+<p>The argument to the '<tt>load</tt>' instruction specifies the memory
+address to load from. The pointer must point to a <a
+ href="t_firstclass">first class</a> type. If the <tt>load</tt> is
+marked as <tt>volatile</tt> then the optimizer is not allowed to modify
+the number or order of execution of this <tt>load</tt> with other
+volatile <tt>load</tt> and <tt><a href="#i_store">store</a></tt>
+instructions. </p>
<h5>Semantics:</h5>
-
<p>The location of memory pointed to is loaded.</p>
-
<h5>Examples:</h5>
-
-<pre>
- %ptr = <a href="#i_alloca">alloca</a> int <i>; yields {int*}:ptr</i>
- <a href="#i_store">store</a> int 3, int* %ptr <i>; yields {void}</i>
+<pre> %ptr = <a href="#i_alloca">alloca</a> int <i>; yields {int*}:ptr</i>
+ <a
+ href="#i_store">store</a> int 3, int* %ptr <i>; yields {void}</i>
%val = load int* %ptr <i>; yields {int}:val = int 3</i>
</pre>
-
</div>
-
<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="i_store">'<tt>store</tt>' Instruction</a>
-</div>
-
+<div class="doc_subsubsection"> <a name="i_store">'<tt>store</tt>'
+Instruction</a> </div>
<h5>Syntax:</h5>
-
-<pre>
- store <ty> <value>, <ty>* <pointer> <i>; yields {void}</i>
+<pre> store <ty> <value>, <ty>* <pointer> <i>; yields {void}</i>
volatile store <ty> <value>, <ty>* <pointer> <i>; yields {void}</i>
</pre>
-
<h5>Overview:</h5>
-
<p>The '<tt>store</tt>' instruction is used to write to memory.</p>
-
<h5>Arguments:</h5>
-
-<p>There are two arguments to the '<tt>store</tt>' instruction: a value to store
-and an address to store it into. The type of the '<tt><pointer></tt>'
-operand must be a pointer to the type of the '<tt><value></tt>' operand.
-If the <tt>store</tt> is marked as <tt>volatile</tt> then the optimizer is not
-allowed to modify the number or order of execution of this <tt>store</tt> with
-other volatile <tt>load</tt> and <tt><a href="#i_store">store</a></tt>
-instructions.</p>
-
-<h5>Semantics:</h5>
-
-<p>The contents of memory are updated to contain '<tt><value></tt>' at the
-location specified by the '<tt><pointer></tt>' operand.</p>
-
-<h5>Example:</h5>
-
-<pre>
- %ptr = <a href="#i_alloca">alloca</a> int <i>; yields {int*}:ptr</i>
- <a href="#i_store">store</a> int 3, int* %ptr <i>; yields {void}</i>
+<p>There are two arguments to the '<tt>store</tt>' instruction: a value
+to store and an address to store it into. The type of the '<tt><pointer></tt>'
+operand must be a pointer to the type of the '<tt><value></tt>'
+operand. If the <tt>store</tt> is marked as <tt>volatile</tt> then the
+optimizer is not allowed to modify the number or order of execution of
+this <tt>store</tt> with other volatile <tt>load</tt> and <tt><a
+ href="#i_store">store</a></tt> instructions.</p>
+<h5>Semantics:</h5>
+<p>The contents of memory are updated to contain '<tt><value></tt>'
+at the location specified by the '<tt><pointer></tt>' operand.</p>
+<h5>Example:</h5>
+<pre> %ptr = <a href="#i_alloca">alloca</a> int <i>; yields {int*}:ptr</i>
+ <a
+ href="#i_store">store</a> int 3, int* %ptr <i>; yields {void}</i>
%val = load int* %ptr <i>; yields {int}:val = int 3</i>
</pre>
-
-</div>
-
<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="i_getelementptr">'<tt>getelementptr</tt>' Instruction</a>
-</div>
-
+<div class="doc_subsubsection"> <a name="i_getelementptr">'<tt>getelementptr</tt>'
+Instruction</a> </div>
<div class="doc_text">
-
<h5>Syntax:</h5>
-
-<pre>
- <result> = getelementptr <ty>* <ptrval>{, long <aidx>|, ubyte <sidx>}*
-</pre>
-
+<pre> <result> = getelementptr <ty>* <ptrval>{, long <aidx>|, ubyte <sidx>}*<br></pre>
<h5>Overview:</h5>
-
-<p>The '<tt>getelementptr</tt>' instruction is used to get the address of a
-subelement of an aggregate data structure.</p>
-
+<p>The '<tt>getelementptr</tt>' instruction is used to get the address
+of a subelement of an aggregate data structure.</p>
<h5>Arguments:</h5>
-
<p>This instruction takes a list of <tt>long</tt> values and <tt>ubyte</tt>
-constants that indicate what form of addressing to perform. The actual types of
-the arguments provided depend on the type of the first pointer argument. The
-'<tt>getelementptr</tt>' instruction is used to index down through the type
-levels of a structure.</p>
-
-<p>For example, let's consider a C code fragment and how it gets compiled to
-LLVM:</p>
-
-<pre>
-struct RT {
- char A;
- int B[10][20];
- char C;
-};
-struct ST {
- int X;
- double Y;
- struct RT Z;
-};
-
-int *foo(struct ST *s) {
- return &s[1].Z.B[5][13];
-}
-</pre>
-
+constants that indicate what form of addressing to perform. The actual
+types of the arguments provided depend on the type of the first pointer
+argument. The '<tt>getelementptr</tt>' instruction is used to index
+down through the type levels of a structure.</p>
+<p>For example, let's consider a C code fragment and how it gets
+compiled to LLVM:</p>
+<pre>struct RT {<br> char A;<br> int B[10][20];<br> char C;<br>};<br>struct ST {<br> int X;<br> double Y;<br> struct RT Z;<br>};<br><br>int *foo(struct ST *s) {<br> return &s[1].Z.B[5][13];<br>}<br></pre>
<p>The LLVM code generated by the GCC frontend is:</p>
-
-<pre>
-%RT = type { sbyte, [10 x [20 x int]], sbyte }
-%ST = type { int, double, %RT }
-
-int* "foo"(%ST* %s) {
- %reg = getelementptr %ST* %s, long 1, ubyte 2, ubyte 1, long 5, long 13
- ret int* %reg
-}
-</pre>
-
+<pre>%RT = type { sbyte, [10 x [20 x int]], sbyte }<br>%ST = type { int, double, %RT }<br><br>int* "foo"(%ST* %s) {<br> %reg = getelementptr %ST* %s, long 1, ubyte 2, ubyte 1, long 5, long 13<br> ret int* %reg<br>}<br></pre>
<h5>Semantics:</h5>
-
-<p>The index types specified for the '<tt>getelementptr</tt>' instruction depend
-on the pointer type that is being index into. <a href="t_pointer">Pointer</a>
-and <a href="t_array">array</a> types require '<tt>long</tt>' values, and <a
-href="t_struct">structure</a> types require '<tt>ubyte</tt>'
-<b>constants</b>.</p>
-
+<p>The index types specified for the '<tt>getelementptr</tt>'
+instruction depend on the pointer type that is being index into. <a
+ href="t_pointer">Pointer</a> and <a href="t_array">array</a> types
+require '<tt>long</tt>' values, and <a href="t_struct">structure</a>
+types require '<tt>ubyte</tt>' <b>constants</b>.</p>
<p>In the example above, the first index is indexing into the '<tt>%ST*</tt>'
-type, which is a pointer, yielding a '<tt>%ST</tt>' = '<tt>{ int, double, %RT
-}</tt>' type, a structure. The second index indexes into the third element of
-the structure, yielding a '<tt>%RT</tt>' = '<tt>{ sbyte, [10 x [20 x int]],
-sbyte }</tt>' type, another structure. The third index indexes into the second
-element of the structure, yielding a '<tt>[10 x [20 x int]]</tt>' type, an
-array. The two dimensions of the array are subscripted into, yielding an
-'<tt>int</tt>' type. The '<tt>getelementptr</tt>' instruction return a pointer
-to this element, thus yielding a '<tt>int*</tt>' type.</p>
-
-<p>Note that it is perfectly legal to index partially through a structure,
-returning a pointer to an inner element. Because of this, the LLVM code for the
-given testcase is equivalent to:</p>
-
-<pre>
-int* "foo"(%ST* %s) {
- %t1 = getelementptr %ST* %s , long 1 <i>; yields %ST*:%t1</i>
+type, which is a pointer, yielding a '<tt>%ST</tt>' = '<tt>{ int,
+double, %RT }</tt>' type, a structure. The second index indexes into
+the third element of the structure, yielding a '<tt>%RT</tt>' = '<tt>{
+sbyte, [10 x [20 x int]], sbyte }</tt>' type, another structure. The
+third index indexes into the second element of the structure, yielding
+a '<tt>[10 x [20 x int]]</tt>' type, an array. The two dimensions of
+the array are subscripted into, yielding an '<tt>int</tt>' type. The '<tt>getelementptr</tt>'
+instruction return a pointer to this element, thus yielding a '<tt>int*</tt>'
+type.</p>
+<p>Note that it is perfectly legal to index partially through a
+structure, returning a pointer to an inner element. Because of this,
+the LLVM code for the given testcase is equivalent to:</p>
+<pre>int* "foo"(%ST* %s) {<br> %t1 = getelementptr %ST* %s , long 1 <i>; yields %ST*:%t1</i>
%t2 = getelementptr %ST* %t1, long 0, ubyte 2 <i>; yields %RT*:%t2</i>
%t3 = getelementptr %RT* %t2, long 0, ubyte 1 <i>; yields [10 x [20 x int]]*:%t3</i>
%t4 = getelementptr [10 x [20 x int]]* %t3, long 0, long 5 <i>; yields [20 x int]*:%t4</i>
@@ -1866,450 +1408,281 @@
ret int* %t5
}
</pre>
-
<h5>Example:</h5>
-
-<pre>
- <i>; yields [12 x ubyte]*:aptr</i>
- %aptr = getelementptr {int, [12 x ubyte]}* %sptr, long 0, ubyte 1
-</pre>
-
-</div>
-
+<pre> <i>; yields [12 x ubyte]*:aptr</i>
+ %aptr = getelementptr {int, [12 x ubyte]}* %sptr, long 0, ubyte 1<br></pre>
+<h5> Note To The Novice:</h5>
+When using indexing into global arrays with the '<tt>getelementptr</tt>'
+instruction, you must remember that the </div>
<!-- ======================================================================= -->
-<div class="doc_subsection">
- <a name="otherops">Other Operations</a>
-</div>
-
+<div class="doc_subsection"> <a name="otherops">Other Operations</a> </div>
<div class="doc_text">
-
-<p>The instructions in this catagory are the "miscellaneous" instructions, which
-defy better classification.</p>
-
+<p>The instructions in this catagory are the "miscellaneous"
+instructions, which defy better classification.</p>
</div>
-
<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="i_phi">'<tt>phi</tt>' Instruction</a>
-</div>
-
+<div class="doc_subsubsection"> <a name="i_phi">'<tt>phi</tt>'
+Instruction</a> </div>
<div class="doc_text">
-
<h5>Syntax:</h5>
-
-<pre>
- <result> = phi <ty> [ <val0>, <label0>], ...
-</pre>
-
+<pre> <result> = phi <ty> [ <val0>, <label0>], ...<br></pre>
<h5>Overview:</h5>
-
-<p>The '<tt>phi</tt>' instruction is used to implement the φ node in the SSA
-graph representing the function.</p>
-
+<p>The '<tt>phi</tt>' instruction is used to implement the φ node in
+the SSA graph representing the function.</p>
<h5>Arguments:</h5>
-
-<p>The type of the incoming values are specified with the first type field.
-After this, the '<tt>phi</tt>' instruction takes a list of pairs as arguments,
-with one pair for each predecessor basic block of the current block. Only
-values of <a href="#t_firstclass">first class</a> type may be used as the value
-arguments to the PHI node. Only labels may be used as the label arguments.</p>
-
-<p>There must be no non-phi instructions between the start of a basic block and
-the PHI instructions: i.e. PHI instructions must be first in a basic block.</p>
-
+<p>The type of the incoming values are specified with the first type
+field. After this, the '<tt>phi</tt>' instruction takes a list of pairs
+as arguments, with one pair for each predecessor basic block of the
+current block. Only values of <a href="#t_firstclass">first class</a>
+type may be used as the value arguments to the PHI node. Only labels
+may be used as the label arguments.</p>
+<p>There must be no non-phi instructions between the start of a basic
+block and the PHI instructions: i.e. PHI instructions must be first in
+a basic block.</p>
<h5>Semantics:</h5>
-
-<p>At runtime, the '<tt>phi</tt>' instruction logically takes on the value
-specified by the parameter, depending on which basic block we came from in the
-last <a href="#terminators">terminator</a> instruction.</p>
-
+<p>At runtime, the '<tt>phi</tt>' instruction logically takes on the
+value specified by the parameter, depending on which basic block we
+came from in the last <a href="#terminators">terminator</a> instruction.</p>
<h5>Example:</h5>
-
-<pre>
-Loop: ; Infinite loop that counts from 0 on up...
- %indvar = phi uint [ 0, %LoopHeader ], [ %nextindvar, %Loop ]
- %nextindvar = add uint %indvar, 1
- br label %Loop
-</pre>
-
+<pre>Loop: ; Infinite loop that counts from 0 on up...<br> %indvar = phi uint [ 0, %LoopHeader ], [ %nextindvar, %Loop ]<br> %nextindvar = add uint %indvar, 1<br> br label %Loop<br></pre>
</div>
-
<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="i_cast">'<tt>cast .. to</tt>' Instruction</a>
-</div>
-
+<div class="doc_subsubsection"> <a name="i_cast">'<tt>cast .. to</tt>'
+Instruction</a> </div>
<div class="doc_text">
-
<h5>Syntax:</h5>
-
-<pre>
- <result> = cast <ty> <value> to <ty2> <i>; yields ty2</i>
+<pre> <result> = cast <ty> <value> to <ty2> <i>; yields ty2</i>
</pre>
-
<h5>Overview:</h5>
-
-<p>The '<tt>cast</tt>' instruction is used as the primitive means to convert
-integers to floating point, change data type sizes, and break type safety (by
-casting pointers).</p>
-
+<p>The '<tt>cast</tt>' instruction is used as the primitive means to
+convert integers to floating point, change data type sizes, and break
+type safety (by casting pointers).</p>
<h5>Arguments:</h5>
-
-<p>The '<tt>cast</tt>' instruction takes a value to cast, which must be a first
-class value, and a type to cast it to, which must also be a <a
-href="#t_firstclass">first class</a> type.</p>
-
+<p>The '<tt>cast</tt>' instruction takes a value to cast, which must be
+a first class value, and a type to cast it to, which must also be a <a
+ href="#t_firstclass">first class</a> type.</p>
<h5>Semantics:</h5>
-
-<p>This instruction follows the C rules for explicit casts when determining how
-the data being cast must change to fit in its new container.</p>
-
-<p>When casting to bool, any value that would be considered true in the context
-of a C '<tt>if</tt>' condition is converted to the boolean '<tt>true</tt>'
+<p>This instruction follows the C rules for explicit casts when
+determining how the data being cast must change to fit in its new
+container.</p>
+<p>When casting to bool, any value that would be considered true in the
+context of a C '<tt>if</tt>' condition is converted to the boolean '<tt>true</tt>'
values, all else are '<tt>false</tt>'.</p>
-
-<p>When extending an integral value from a type of one signness to another (for
-example '<tt>sbyte</tt>' to '<tt>ulong</tt>'), the value is sign-extended if the
-<b>source</b> value is signed, and zero-extended if the source value is
-unsigned. <tt>bool</tt> values are always zero extended into either zero or
-one.</p>
-
+<p>When extending an integral value from a type of one signness to
+another (for example '<tt>sbyte</tt>' to '<tt>ulong</tt>'), the value
+is sign-extended if the <b>source</b> value is signed, and
+zero-extended if the source value is unsigned. <tt>bool</tt> values
+are always zero extended into either zero or one.</p>
<h5>Example:</h5>
-
-<pre>
- %X = cast int 257 to ubyte <i>; yields ubyte:1</i>
+<pre> %X = cast int 257 to ubyte <i>; yields ubyte:1</i>
%Y = cast int 123 to bool <i>; yields bool:true</i>
</pre>
-
</div>
-
<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="i_call">'<tt>call</tt>' Instruction</a>
-</div>
-
+<div class="doc_subsubsection"> <a name="i_call">'<tt>call</tt>'
+Instruction</a> </div>
<div class="doc_text">
-
<h5>Syntax:</h5>
-
-<pre>
- <result> = call <ty>* <fnptrval>(<param list>)
-</pre>
-
+<pre> <result> = call <ty>* <fnptrval>(<param list>)<br></pre>
<h5>Overview:</h5>
-
<p>The '<tt>call</tt>' instruction represents a simple function call.</p>
-
<h5>Arguments:</h5>
-
<p>This instruction requires several arguments:</p>
-
<ol>
-
- <li><p>'<tt>ty</tt>': shall be the signature of the pointer to function value
- being invoked. The argument types must match the types implied by this
- signature.</p></li>
-
- <li><p>'<tt>fnptrval</tt>': An LLVM value containing a pointer to a function
- to be invoked. In most cases, this is a direct function invocation, but
- indirect <tt>call</tt>s are just as possible, calling an arbitrary pointer to
- function values.</p></li>
-
- <li><p>'<tt>function args</tt>': argument list whose types match the function
- signature argument types. If the function signature indicates the function
- accepts a variable number of arguments, the extra arguments can be
- specified.</p></li>
-
+ <li>
+ <p>'<tt>ty</tt>': shall be the signature of the pointer to function
+value being invoked. The argument types must match the types implied
+by this signature.</p>
+ </li>
+ <li>
+ <p>'<tt>fnptrval</tt>': An LLVM value containing a pointer to a
+function to be invoked. In most cases, this is a direct function
+invocation, but indirect <tt>call</tt>s are just as possible,
+calling an arbitrary pointer to function values.</p>
+ </li>
+ <li>
+ <p>'<tt>function args</tt>': argument list whose types match the
+function signature argument types. If the function signature
+indicates the function accepts a variable number of arguments, the
+extra arguments can be specified.</p>
+ </li>
</ol>
-
-<h5>Semantics:</h5>
-
-<p>The '<tt>call</tt>' instruction is used to cause control flow to transfer to
-a specified function, with its incoming arguments bound to the specified values.
-Upon a '<tt><a href="#i_ret">ret</a></tt>' instruction in the called function,
-control flow continues with the instruction after the function call, and the
-return value of the function is bound to the result argument. This is a simpler
-case of the <a href="#i_invoke">invoke</a> instruction.</p>
-
-<h5>Example:</h5>
-
-<pre>
- %retval = call int %test(int %argc)
- call int(sbyte*, ...) *%printf(sbyte* %msg, int 12, sbyte 42);
-</pre>
-
-</div>
-
-<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="i_vanext">'<tt>vanext</tt>' Instruction</a>
-</div>
-
-<div class="doc_text">
-
-<h5>Syntax:</h5>
-
-<pre>
- <resultarglist> = vanext <va_list> <arglist>, <argty>
-</pre>
-
-<h5>Overview:</h5>
-
-<p>The '<tt>vanext</tt>' instruction is used to access arguments passed through
-the "variable argument" area of a function call. It is used to implement the
-<tt>va_arg</tt> macro in C.</p>
-
-<h5>Arguments:</h5>
-
-<p>This instruction takes a <tt>valist</tt> value and the type of the argument.
-It returns another <tt>valist</tt>.</p>
-
<h5>Semantics:</h5>
-
-<p>The '<tt>vanext</tt>' instruction advances the specified <tt>valist</tt> past
-an argument of the specified type. In conjunction with the <a
-href="#i_vaarg"><tt>vaarg</tt></a> instruction, it is used to implement the
-<tt>va_arg</tt> macro available in C. For more information, see the variable
-argument handling <a href="#int_varargs">Intrinsic Functions</a>.</p>
-
-<p>It is legal for this instruction to be called in a function which does not
-take a variable number of arguments, for example, the <tt>vfprintf</tt>
+<p>The '<tt>call</tt>' instruction is used to cause control flow to
+transfer to a specified function, with its incoming arguments bound to
+the specified values. Upon a '<tt><a href="#i_ret">ret</a></tt>'
+instruction in the called function, control flow continues with the
+instruction after the function call, and the return value of the
+function is bound to the result argument. This is a simpler case of
+the <a href="#i_invoke">invoke</a> instruction.</p>
+<h5>Example:</h5>
+<pre> %retval = call int %test(int %argc)<br> call int(sbyte*, ...) *%printf(sbyte* %msg, int 12, sbyte 42);<br></pre>
+</div>
+<!-- _______________________________________________________________________ -->
+<div class="doc_subsubsection"> <a name="i_vanext">'<tt>vanext</tt>'
+Instruction</a> </div>
+<div class="doc_text">
+<h5>Syntax:</h5>
+<pre> <resultarglist> = vanext <va_list> <arglist>, <argty><br></pre>
+<h5>Overview:</h5>
+<p>The '<tt>vanext</tt>' instruction is used to access arguments passed
+through the "variable argument" area of a function call. It is used to
+implement the <tt>va_arg</tt> macro in C.</p>
+<h5>Arguments:</h5>
+<p>This instruction takes a <tt>valist</tt> value and the type of the
+argument. It returns another <tt>valist</tt>.</p>
+<h5>Semantics:</h5>
+<p>The '<tt>vanext</tt>' instruction advances the specified <tt>valist</tt>
+past an argument of the specified type. In conjunction with the <a
+ href="#i_vaarg"><tt>vaarg</tt></a> instruction, it is used to implement
+the <tt>va_arg</tt> macro available in C. For more information, see
+the variable argument handling <a href="#int_varargs">Intrinsic
+Functions</a>.</p>
+<p>It is legal for this instruction to be called in a function which
+does not take a variable number of arguments, for example, the <tt>vfprintf</tt>
function.</p>
-
<p><tt>vanext</tt> is an LLVM instruction instead of an <a
-href="#intrinsics">intrinsic function</a> because it takes an type as an
-argument.</p>
-
+ href="#intrinsics">intrinsic function</a> because it takes an type as
+an argument.</p>
<h5>Example:</h5>
-
-<p>See the <a href="#int_varargs">variable argument processing</a> section.</p>
-
+<p>See the <a href="#int_varargs">variable argument processing</a>
+section.</p>
</div>
-
<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="i_vaarg">'<tt>vaarg</tt>' Instruction</a>
-</div>
-
+<div class="doc_subsubsection"> <a name="i_vaarg">'<tt>vaarg</tt>'
+Instruction</a> </div>
<div class="doc_text">
-
<h5>Syntax:</h5>
-
-<pre>
- <resultval> = vaarg <va_list> <arglist>, <argty>
-</pre>
-
+<pre> <resultval> = vaarg <va_list> <arglist>, <argty><br></pre>
<h5>Overview:</h5>
-
-<p>The '<tt>vaarg</tt>' instruction is used to access arguments passed through
-the "variable argument" area of a function call. It is used to implement the
-<tt>va_arg</tt> macro in C.</p>
-
+<p>The '<tt>vaarg</tt>' instruction is used to access arguments passed
+through the "variable argument" area of a function call. It is used to
+implement the <tt>va_arg</tt> macro in C.</p>
<h5>Arguments:</h5>
-
-<p>This instruction takes a <tt>valist</tt> value and the type of the argument.
-It returns a value of the specified argument type.</p>
-
+<p>This instruction takes a <tt>valist</tt> value and the type of the
+argument. It returns a value of the specified argument type.</p>
<h5>Semantics:</h5>
-
-<p>The '<tt>vaarg</tt>' instruction loads an argument of the specified type from
-the specified <tt>va_list</tt>. In conjunction with the <a
-href="#i_vanext"><tt>vanext</tt></a> instruction, it is used to implement the
-<tt>va_arg</tt> macro available in C. For more information, see the variable
-argument handling <a href="#int_varargs">Intrinsic Functions</a>.</p>
-
-<p>It is legal for this instruction to be called in a function which does not
-take a variable number of arguments, for example, the <tt>vfprintf</tt>
+<p>The '<tt>vaarg</tt>' instruction loads an argument of the specified
+type from the specified <tt>va_list</tt>. In conjunction with the <a
+ href="#i_vanext"><tt>vanext</tt></a> instruction, it is used to
+implement the <tt>va_arg</tt> macro available in C. For more
+information, see the variable argument handling <a href="#int_varargs">Intrinsic
+Functions</a>.</p>
+<p>It is legal for this instruction to be called in a function which
+does not take a variable number of arguments, for example, the <tt>vfprintf</tt>
function.</p>
-
<p><tt>vaarg</tt> is an LLVM instruction instead of an <a
-href="#intrinsics">intrinsic function</a> because it takes an type as an
-argument.</p>
-
+ href="#intrinsics">intrinsic function</a> because it takes an type as
+an argument.</p>
<h5>Example:</h5>
-
-<p>See the <a href="#int_varargs">variable argument processing</a> section.</p>
-
+<p>See the <a href="#int_varargs">variable argument processing</a>
+section.</p>
</div>
-
<!-- *********************************************************************** -->
-<div class="doc_section">
- <a name="intrinsics">Intrinsic Functions</a>
-</div>
+<div class="doc_section"> <a name="intrinsics">Intrinsic Functions</a> </div>
<!-- *********************************************************************** -->
-
<div class="doc_text">
-
-<p>LLVM supports the notion of an "intrinsic function". These functions have
-well known names and semantics, and are required to follow certain restrictions.
-Overall, these instructions represent an extension mechanism for the LLVM
-language that does not require changing all of the transformations in LLVM to
-add to the language (or the bytecode reader/writer, the parser, etc...).</p>
-
-<p>Intrinsic function names must all start with an "<tt>llvm.</tt>" prefix, this
-prefix is reserved in LLVM for intrinsic names, thus functions may not be named
-this. Intrinsic functions must always be external functions: you cannot define
-the body of intrinsic functions. Intrinsic functions may only be used in call
-or invoke instructions: it is illegal to take the address of an intrinsic
-function. Additionally, because intrinsic functions are part of the LLVM
-language, it is required that they all be documented here if any are added.</p>
-
-<p>Unless an intrinsic function is target-specific, there must be a lowering
-pass to eliminate the intrinsic or all backends must support the intrinsic
-function.</p>
-
+<p>LLVM supports the notion of an "intrinsic function". These
+functions have well known names and semantics, and are required to
+follow certain restrictions. Overall, these instructions represent an
+extension mechanism for the LLVM language that does not require
+changing all of the transformations in LLVM to add to the language (or
+the bytecode reader/writer, the parser, etc...).</p>
+<p>Intrinsic function names must all start with an "<tt>llvm.</tt>"
+prefix, this prefix is reserved in LLVM for intrinsic names, thus
+functions may not be named this. Intrinsic functions must always be
+external functions: you cannot define the body of intrinsic functions.
+Intrinsic functions may only be used in call or invoke instructions: it
+is illegal to take the address of an intrinsic function. Additionally,
+because intrinsic functions are part of the LLVM language, it is
+required that they all be documented here if any are added.</p>
+<p>Unless an intrinsic function is target-specific, there must be a
+lowering pass to eliminate the intrinsic or all backends must support
+the intrinsic function.</p>
</div>
-
<!-- ======================================================================= -->
-<div class="doc_subsection">
- <a name="int_varargs">Variable Argument Handling Intrinsics</a>
-</div>
-
+<div class="doc_subsection"> <a name="int_varargs">Variable Argument
+Handling Intrinsics</a> </div>
<div class="doc_text">
-
<p>Variable argument support is defined in LLVM with the <a
-href="#i_vanext"><tt>vanext</tt></a> instruction and these three intrinsic
-functions. These functions are related to the similarly named macros defined in
-the <tt><stdarg.h></tt> header file.</p>
-
-<p>All of these functions operate on arguments that use a target-specific value
-type "<tt>va_list</tt>". The LLVM assembly language reference manual does not
-define what this type is, so all transformations should be prepared to handle
-intrinsics with any type used.</p>
-
+ href="#i_vanext"><tt>vanext</tt></a> instruction and these three
+intrinsic functions. These functions are related to the similarly
+named macros defined in the <tt><stdarg.h></tt> header file.</p>
+<p>All of these functions operate on arguments that use a
+target-specific value type "<tt>va_list</tt>". The LLVM assembly
+language reference manual does not define what this type is, so all
+transformations should be prepared to handle intrinsics with any type
+used.</p>
<p>This example shows how the <a href="#i_vanext"><tt>vanext</tt></a>
-instruction and the variable argument handling intrinsic functions are used.</p>
-
-<pre>
-int %test(int %X, ...) {
- ; Initialize variable argument processing
- %ap = call sbyte*()* %<a href="#i_va_start">llvm.va_start</a>()
-
- ; Read a single integer argument
- %tmp = vaarg sbyte* %ap, int
-
- ; Advance to the next argument
- %ap2 = vanext sbyte* %ap, int
-
- ; Demonstrate usage of llvm.va_copy and llvm.va_end
- %aq = call sbyte* (sbyte*)* %<a href="#i_va_copy">llvm.va_copy</a>(sbyte* %ap2)
- call void %<a href="#i_va_end">llvm.va_end</a>(sbyte* %aq)
-
- ; Stop processing of arguments.
- call void %<a href="#i_va_end">llvm.va_end</a>(sbyte* %ap2)
- ret int %tmp
-}
-</pre>
-
+instruction and the variable argument handling intrinsic functions are
+used.</p>
+<pre>int %test(int %X, ...) {<br> ; Initialize variable argument processing<br> %ap = call sbyte*()* %<a
+ href="#i_va_start">llvm.va_start</a>()<br><br> ; Read a single integer argument<br> %tmp = vaarg sbyte* %ap, int<br><br> ; Advance to the next argument<br> %ap2 = vanext sbyte* %ap, int<br><br> ; Demonstrate usage of llvm.va_copy and llvm.va_end<br> %aq = call sbyte* (sbyte*)* %<a
+ href="#i_va_copy">llvm.va_copy</a>(sbyte* %ap2)<br> call void %<a
+ href="#i_va_end">llvm.va_end</a>(sbyte* %aq)<br><br> ; Stop processing of arguments.<br> call void %<a
+ href="#i_va_end">llvm.va_end</a>(sbyte* %ap2)<br> ret int %tmp<br>}<br></pre>
</div>
-
<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="i_va_start">'<tt>llvm.va_start</tt>' Intrinsic</a>
-</div>
-
+<div class="doc_subsubsection"> <a name="i_va_start">'<tt>llvm.va_start</tt>'
+Intrinsic</a> </div>
<div class="doc_text">
-
<h5>Syntax:</h5>
-
-<pre>
- call va_list ()* %llvm.va_start()
-</pre>
-
+<pre> call va_list ()* %llvm.va_start()<br></pre>
<h5>Overview:</h5>
-
<p>The '<tt>llvm.va_start</tt>' intrinsic returns a new <tt><arglist></tt>
for subsequent use by the variable argument intrinsics.</p>
-
<h5>Semantics:</h5>
-
<p>The '<tt>llvm.va_start</tt>' intrinsic works just like the <tt>va_start</tt>
-macro available in C. In a target-dependent way, it initializes and returns a
-<tt>va_list</tt> element, so that the next <tt>vaarg</tt> will produce the first
-variable argument passed to the function. Unlike the C <tt>va_start</tt> macro,
-this intrinsic does not need to know the last argument of the function, the
-compiler can figure that out.</p>
-
-<p>Note that this intrinsic function is only legal to be called from within the
-body of a variable argument function.</p>
-
+macro available in C. In a target-dependent way, it initializes and
+returns a <tt>va_list</tt> element, so that the next <tt>vaarg</tt>
+will produce the first variable argument passed to the function. Unlike
+the C <tt>va_start</tt> macro, this intrinsic does not need to know the
+last argument of the function, the compiler can figure that out.</p>
+<p>Note that this intrinsic function is only legal to be called from
+within the body of a variable argument function.</p>
</div>
-
<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="i_va_end">'<tt>llvm.va_end</tt>' Intrinsic</a>
-</div>
-
+<div class="doc_subsubsection"> <a name="i_va_end">'<tt>llvm.va_end</tt>'
+Intrinsic</a> </div>
<div class="doc_text">
-
<h5>Syntax:</h5>
-
-<pre>
- call void (va_list)* %llvm.va_end(va_list <arglist>)
-</pre>
-
+<pre> call void (va_list)* %llvm.va_end(va_list <arglist>)<br></pre>
<h5>Overview:</h5>
-
-<p>The '<tt>llvm.va_end</tt>' intrinsic destroys <tt><arglist></tt> which
-has been initialized previously with <tt><a
-href="#i_va_start">llvm.va_start</a></tt> or <tt><a
-href="#i_va_copy">llvm.va_copy</a></tt>.</p>
-
+<p>The '<tt>llvm.va_end</tt>' intrinsic destroys <tt><arglist></tt>
+which has been initialized previously with <tt><a href="#i_va_start">llvm.va_start</a></tt>
+or <tt><a href="#i_va_copy">llvm.va_copy</a></tt>.</p>
<h5>Arguments:</h5>
-
<p>The argument is a <tt>va_list</tt> to destroy.</p>
-
<h5>Semantics:</h5>
-
<p>The '<tt>llvm.va_end</tt>' intrinsic works just like the <tt>va_end</tt>
-macro available in C. In a target-dependent way, it destroys the
-<tt>va_list</tt>. Calls to <a href="#i_va_start"><tt>llvm.va_start</tt></a> and
-<a href="#i_va_copy"><tt>llvm.va_copy</tt></a> must be matched exactly with
-calls to <tt>llvm.va_end</tt>.</p>
-
+macro available in C. In a target-dependent way, it destroys the <tt>va_list</tt>.
+Calls to <a href="#i_va_start"><tt>llvm.va_start</tt></a> and <a
+ href="#i_va_copy"><tt>llvm.va_copy</tt></a> must be matched exactly
+with calls to <tt>llvm.va_end</tt>.</p>
</div>
-
<!-- _______________________________________________________________________ -->
-<div class="doc_subsubsection">
- <a name="i_va_copy">'<tt>llvm.va_copy</tt>' Intrinsic</a>
-</div>
-
+<div class="doc_subsubsection"> <a name="i_va_copy">'<tt>llvm.va_copy</tt>'
+Intrinsic</a> </div>
<div class="doc_text">
-
<h5>Syntax:</h5>
-
-<pre>
- call va_list (va_list)* %llvm.va_copy(va_list <destarglist>)
-</pre>
-
+<pre> call va_list (va_list)* %llvm.va_copy(va_list <destarglist>)<br></pre>
<h5>Overview:</h5>
-
-<p>The '<tt>llvm.va_copy</tt>' intrinsic copies the current argument position
-from the source argument list to the destination argument list.</p>
-
+<p>The '<tt>llvm.va_copy</tt>' intrinsic copies the current argument
+position from the source argument list to the destination argument list.</p>
<h5>Arguments:</h5>
-
<p>The argument is the <tt>va_list</tt> to copy.</p>
-
<h5>Semantics:</h5>
-
<p>The '<tt>llvm.va_copy</tt>' intrinsic works just like the <tt>va_copy</tt>
-macro available in C. In a target-dependent way, it copies the source
-<tt>va_list</tt> element into the returned list. This intrinsic is necessary
-because the <tt><a href="i_va_start">llvm.va_start</a></tt> intrinsic may be
-arbitrarily complex and require memory allocation, for example.</p>
-
+macro available in C. In a target-dependent way, it copies the source <tt>va_list</tt>
+element into the returned list. This intrinsic is necessary because the <tt><a
+ href="i_va_start">llvm.va_start</a></tt> intrinsic may be arbitrarily
+complex and require memory allocation, for example.</p>
</div>
-
<!-- *********************************************************************** -->
-
<hr>
<div class="doc_footer">
- <address><a href="mailto:sabre at nondot.org">Chris Lattner</a></address>
- <a href="http://llvm.cs.uiuc.edu">The LLVM Compiler Infrastructure</a>
- <br>
- Last modified: $Date: 2003/11/21 17:42:22 $
-</div>
-
+<address><a href="mailto:sabre at nondot.org">Chris Lattner</a></address>
+<a href="http://llvm.cs.uiuc.edu">The LLVM Compiler Infrastructure</a> <br>
+Last modified: $Date: 2003/11/25 01:02:51 $ </div>
</body>
</html>
Index: llvm/docs/ProgrammersManual.html
diff -u llvm/docs/ProgrammersManual.html:1.50 llvm/docs/ProgrammersManual.html:1.51
--- llvm/docs/ProgrammersManual.html:1.50 Mon Nov 10 18:14:41 2003
+++ llvm/docs/ProgrammersManual.html Mon Nov 24 19:02:51 2003
@@ -1,68 +1,75 @@
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html><head><title>LLVM Programmer's Manual</title></head>
-
-<body bgcolor=white>
-
-<table width="100%" bgcolor="#330077" border=0 cellpadding=4 cellspacing=0>
-<tr><td> <font size=+3 color="#EEEEFF" face="Georgia,Palatino,Times,Roman"><b>LLVM Programmer's Manual</b></font></td>
-</tr></table>
-
+<html>
+<head>
+ <title>LLVM Programmer's Manual</title>
+</head>
+<body style="background-color: white;">
+<table width="100%" bgcolor="#330077" border="0" cellpadding="4"
+ cellspacing="0">
+ <tbody>
+ <tr>
+ <td> <font size="+3" color="#eeeeff"
+ face="Georgia,Palatino,Times,Roman"><b>LLVM Programmer's Manual</b></font></td>
+ </tr>
+ </tbody>
+</table>
<ol>
- <li><a href="#introduction">Introduction</a>
+ <li><a href="#introduction">Introduction</a> </li>
<li><a href="#general">General Information</a>
- <ul>
- <li><a href="#stl">The C++ Standard Template Library</a>
-<!--
+ <ul>
+ <li><a href="#stl">The C++ Standard Template Library</a><!--
<li>The <tt>-time-passes</tt> option
<li>How to use the LLVM Makefile system
<li>How to write a regression test
--->
- </ul>
+--> </li>
+ </ul>
+ </li>
<li><a href="#apis">Important and useful LLVM APIs</a>
- <ul>
- <li><a href="#isa">The <tt>isa<></tt>, <tt>cast<></tt> and
- <tt>dyn_cast<></tt> templates</a>
- <li><a href="#DEBUG">The <tt>DEBUG()</tt> macro &
- <tt>-debug</tt> option</a>
<ul>
- <li><a href="#DEBUG_TYPE">Fine grained debug info with
- <tt>DEBUG_TYPE</tt> and the <tt>-debug-only</tt> option</a/>
- </ul>
- <li><a href="#Statistic">The <tt>Statistic</tt> template &
- <tt>-stats</tt> option</a>
-<!--
+ <li><a href="#isa">The <tt>isa<></tt>, <tt>cast<></tt>
+and <tt>dyn_cast<></tt> templates</a> </li>
+ <li><a href="#DEBUG">The <tt>DEBUG()</tt> macro & <tt>-debug</tt>
+option</a>
+ <ul>
+ <li><a href="#DEBUG_TYPE">Fine grained debug info with <tt>DEBUG_TYPE</tt>
+and the <tt>-debug-only</tt> option</a> </li>
+ </ul>
+ </li>
+ <li><a href="#Statistic">The <tt>Statistic</tt> template & <tt>-stats</tt>
+option</a><!--
<li>The <tt>InstVisitor</tt> template
<li>The general graph API
--->
- </ul>
- <li><a href="#common">Helpful Hints for Common Operations</a>
- <ul>
- <li><a href="#inspection">Basic Inspection and Traversal Routines</a>
- <ul>
- <li><a href="#iterate_function">Iterating over the <tt>BasicBlock</tt>s
- in a <tt>Function</tt></a>
- <li><a href="#iterate_basicblock">Iterating over the <tt>Instruction</tt>s
- in a <tt>BasicBlock</tt></a>
- <li><a href="#iterate_institer">Iterating over the <tt>Instruction</tt>s
- in a <tt>Function</tt></a>
- <li><a href="#iterate_convert">Turning an iterator into a class
- pointer</a>
- <li><a href="#iterate_complex">Finding call sites: a more complex
- example</a>
- <li><a href="#calls_and_invokes">Treating calls and invokes the
- same way</a>
- <li><a href="#iterate_chains">Iterating over def-use & use-def
- chains</a>
+--> </li>
</ul>
- <li><a href="#simplechanges">Making simple changes</a>
+ </li>
+ <li><a href="#common">Helpful Hints for Common Operations</a>
<ul>
- <li><a href="#schanges_creating">Creating and inserting new
- <tt>Instruction</tt>s</a>
- <li><a href="#schanges_deleting">Deleting
- <tt>Instruction</tt>s</a>
- <li><a href="#schanges_replacing">Replacing an
- <tt>Instruction</tt> with another <tt>Value</tt></a>
- </ul>
+ <li><a href="#inspection">Basic Inspection and Traversal Routines</a>
+ <ul>
+ <li><a href="#iterate_function">Iterating over the <tt>BasicBlock</tt>s
+in a <tt>Function</tt></a> </li>
+ <li><a href="#iterate_basicblock">Iterating over the <tt>Instruction</tt>s
+in a <tt>BasicBlock</tt></a> </li>
+ <li><a href="#iterate_institer">Iterating over the <tt>Instruction</tt>s
+in a <tt>Function</tt></a> </li>
+ <li><a href="#iterate_convert">Turning an iterator into a
+class pointer</a> </li>
+ <li><a href="#iterate_complex">Finding call sites: a more
+complex example</a> </li>
+ <li><a href="#calls_and_invokes">Treating calls and invokes
+the same way</a> </li>
+ <li><a href="#iterate_chains">Iterating over def-use &
+use-def chains</a> </li>
+ </ul>
+ </li>
+ <li><a href="#simplechanges">Making simple changes</a>
+ <ul>
+ <li><a href="#schanges_creating">Creating and inserting new
+ <tt>Instruction</tt>s</a> </li>
+ <li><a href="#schanges_deleting">Deleting <tt>Instruction</tt>s</a> </li>
+ <li><a href="#schanges_replacing">Replacing an <tt>Instruction</tt>
+with another <tt>Value</tt></a> </li>
+ </ul>
<!--
<li>Working with the Control Flow Graph
<ul>
@@ -70,1769 +77,1606 @@
<li>
<li>
</ul>
--->
- </ul>
+--> </li>
+ </ul>
+ </li>
<li><a href="#coreclasses">The Core LLVM Class Hierarchy Reference</a>
- <ul>
- <li><a href="#Value">The <tt>Value</tt> class</a>
<ul>
- <li><a href="#User">The <tt>User</tt> class</a>
- <ul>
- <li><a href="#Instruction">The <tt>Instruction</tt> class</a>
- <ul>
- <li>
- </ul>
- <li><a href="#GlobalValue">The <tt>GlobalValue</tt> class</a>
+ <li><a href="#Value">The <tt>Value</tt> class</a>
<ul>
- <li><a href="#BasicBlock">The <tt>BasicBlock</tt> class</a>
- <li><a href="#Function">The <tt>Function</tt> class</a>
- <li><a href="#GlobalVariable">The <tt>GlobalVariable</tt> class</a>
+ <li><a href="#User">The <tt>User</tt> class</a>
+ <ul>
+ <li><a href="#Instruction">The <tt>Instruction</tt> class</a>
+ <ul>
+ <li> <a href="#GetElementPtrInst">The <span
+ style="font-family: monospace;">GetElementPtrInst</span> class</a><br>
+ </li>
+ </ul>
+ </li>
+ <li><a href="#GlobalValue">The <tt>GlobalValue</tt> class</a>
+ <ul>
+ <li><a href="#BasicBlock">The <tt>BasicBlock</tt>
+class</a> </li>
+ <li><a href="#Function">The <tt>Function</tt> class</a> </li>
+ <li><a href="#GlobalVariable">The <tt>GlobalVariable</tt>
+class</a> </li>
+ </ul>
+ </li>
+ <li><a href="#Module">The <tt>Module</tt> class</a> </li>
+ <li><a href="#Constant">The <tt>Constant</tt> class</a>
+ <ul>
+ <li> <br>
+ </li>
+ <li> <br>
+ </li>
+ </ul>
+ </li>
+ </ul>
+ </li>
+ <li><a href="#Type">The <tt>Type</tt> class</a> </li>
+ <li><a href="#Argument">The <tt>Argument</tt> class</a> </li>
</ul>
- <li><a href="#Module">The <tt>Module</tt> class</a>
- <li><a href="#Constant">The <tt>Constant</tt> class</a>
+ </li>
+ <li>The <tt>SymbolTable</tt> class </li>
+ <li>The <tt>ilist</tt> and <tt>iplist</tt> classes
<ul>
- <li>
- <li>
+ <li>Creating, inserting, moving and deleting from LLVM lists </li>
</ul>
- </ul>
- <li><a href="#Type">The <tt>Type</tt> class</a>
- <li><a href="#Argument">The <tt>Argument</tt> class</a>
+ </li>
+ <li>Important iterator invalidation semantics to be aware of </li>
</ul>
- <li>The <tt>SymbolTable</tt> class
- <li>The <tt>ilist</tt> and <tt>iplist</tt> classes
- <ul>
- <li>Creating, inserting, moving and deleting from LLVM lists
- </ul>
- <li>Important iterator invalidation semantics to be aware of
- </ul>
-
- <p><b>Written by <a href="mailto:sabre at nondot.org">Chris Lattner</a>,
- <a href="mailto:dhurjati at cs.uiuc.edu">Dinakar Dhurjati</a>, and
- <a href="mailto:jstanley at cs.uiuc.edu">Joel Stanley</a></b><p>
+ <p><b>Written by <a href="mailto:sabre at nondot.org">Chris Lattner</a>,<a
+ href="mailto:dhurjati at cs.uiuc.edu">Dinakar Dhurjati</a>, and <a
+ href="mailto:jstanley at cs.uiuc.edu">Joel Stanley</a></b></p>
+ <p> </p>
+ </li>
</ol>
-
-
-<!-- *********************************************************************** -->
-<table width="100%" bgcolor="#330077" border=0 cellpadding=4 cellspacing=0>
-<tr><td align=center><font color="#EEEEFF" size=+2 face="Georgia,Palatino"><b>
-<a name="introduction">Introduction
-</b></font></td></tr></table><ul>
-<!-- *********************************************************************** -->
-
-This document is meant to highlight some of the important classes and interfaces
-available in the LLVM source-base. This manual is not intended to explain what
-LLVM is, how it works, and what LLVM code looks like. It assumes that you know
-the basics of LLVM and are interested in writing transformations or otherwise
-analyzing or manipulating the code.<p>
-
-This document should get you oriented so that you can find your way in the
-continuously growing source code that makes up the LLVM infrastructure. Note
-that this manual is not intended to serve as a replacement for reading the
-source code, so if you think there should be a method in one of these classes to
-do something, but it's not listed, check the source. Links to the <a
-href="/doxygen/">doxygen</a> sources are provided to make this as easy as
-possible.<p>
-
-The first section of this document describes general information that is useful
-to know when working in the LLVM infrastructure, and the second describes the
-Core LLVM classes. In the future this manual will be extended with information
-describing how to use extension libraries, such as dominator information, CFG
-traversal routines, and useful utilities like the <tt><a
-href="/doxygen/InstVisitor_8h-source.html">InstVisitor</a></tt> template.<p>
-
-
<!-- *********************************************************************** -->
-</ul><table width="100%" bgcolor="#330077" border=0 cellpadding=4 cellspacing=0>
-<tr><td align=center><font color="#EEEEFF" size=+2 face="Georgia,Palatino"><b>
-<a name="general">General Information
-</b></font></td></tr></table><ul>
+<table width="100%" bgcolor="#330077" border="0" cellpadding="4"
+ cellspacing="0">
+ <tbody>
+ <tr>
+ <td align="center"><font color="#eeeeff" size="+2"
+ face="Georgia,Palatino"><b> <a name="introduction">Introduction </a></b></font></td>
+ </tr>
+ </tbody>
+</table>
+<ul>
<!-- *********************************************************************** -->
-
-This section contains general information that is useful if you are working in
-the LLVM source-base, but that isn't specific to any particular API.<p>
-
-
-<!-- ======================================================================= -->
-</ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
-<tr><td> </td><td width="100%">
-<font color="#EEEEFF" face="Georgia,Palatino"><b>
-<a name="stl">The C++ Standard Template Library</a>
-</b></font></td></tr></table><ul>
-
-LLVM makes heavy use of the C++ Standard Template Library (STL), perhaps much
-more than you are used to, or have seen before. Because of this, you might want
-to do a little background reading in the techniques used and capabilities of the
-library. There are many good pages that discuss the STL, and several books on
-the subject that you can get, so it will not be discussed in this document.<p>
-
-Here are some useful links:<p>
-
-<ol>
-<li><a href="http://www.dinkumware.com/refxcpp.html">Dinkumware C++
-Library reference</a> - an excellent reference for the STL and other parts of
-the standard C++ library.
-
-<li><a href="http://www.tempest-sw.com/cpp/">C++ In a Nutshell</a> - This is an
-O'Reilly book in the making. It has a decent <a
-href="http://www.tempest-sw.com/cpp/ch13-libref.html">Standard Library
-Reference</a> that rivals Dinkumware's, and is actually free until the book is
-published.
-
-<li><a href="http://www.parashift.com/c++-faq-lite/">C++ Frequently Asked
-Questions</a>
-
-<li><a href="http://www.sgi.com/tech/stl/">SGI's STL Programmer's Guide</a> -
-Contains a useful <a
-href="http://www.sgi.com/tech/stl/stl_introduction.html">Introduction to the
-STL</a>.
-
-<li><a href="http://www.research.att.com/~bs/C++.html">Bjarne Stroustrup's C++
-Page</a>
-
-</ol><p>
-
-You are also encouraged to take a look at the <a
-href="CodingStandards.html">LLVM Coding Standards</a> guide which focuses on how
-to write maintainable code more than where to put your curly braces.<p>
-
-<!-- ======================================================================= -->
-</ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
-<tr><td> </td><td width="100%">
-<font color="#EEEEFF" face="Georgia,Palatino"><b>
-<a name="stl">Other useful references</a>
-</b></font></td></tr></table><ul>
-
-LLVM is currently using CVS as its source versioning system. You may find this
-reference handy:<p>
-
-<ol>
-<li><a href="http://www.psc.edu/~semke/cvs_branches.html">CVS Branch and Tag
-Primer</a></li>
-</ol><p>
-
+This document is meant to highlight some of the important classes and
+interfaces available in the LLVM source-base. This manual is not
+intended to explain what LLVM is, how it works, and what LLVM code looks
+like. It assumes that you know the basics of LLVM and are interested
+in writing transformations or otherwise analyzing or manipulating the
+code.
+ <p> This document should get you oriented so that you can find your
+way in the continuously growing source code that makes up the LLVM
+infrastructure. Note that this manual is not intended to serve as a
+replacement for reading the source code, so if you think there should be
+a method in one of these classes to do something, but it's not listed,
+check the source. Links to the <a href="/doxygen/">doxygen</a> sources
+are provided to make this as easy as possible.</p>
+ <p> The first section of this document describes general information
+that is useful to know when working in the LLVM infrastructure, and the
+second describes the Core LLVM classes. In the future this manual will
+be extended with information describing how to use extension libraries,
+such as dominator information, CFG traversal routines, and useful
+utilities like the <tt><a href="/doxygen/InstVisitor_8h-source.html">InstVisitor</a></tt>
+template.</p>
+ <p><!-- *********************************************************************** --> </p>
+</ul>
+<table width="100%" bgcolor="#330077" border="0" cellpadding="4"
+ cellspacing="0">
+ <tbody>
+ <tr>
+ <td align="center"><font color="#eeeeff" size="+2"
+ face="Georgia,Palatino"><b> <a name="general">General Information </a></b></font></td>
+ </tr>
+ </tbody>
+</table>
+<ul>
<!-- *********************************************************************** -->
-</ul><table width="100%" bgcolor="#330077" border=0 cellpadding=4 cellspacing=0>
-<tr><td align=center><font color="#EEEEFF" size=+2 face="Georgia,Palatino"><b>
-<a name="apis">Important and useful LLVM APIs
-</b></font></td></tr></table><ul>
+This section contains general information that is useful if you are
+working in the LLVM source-base, but that isn't specific to any
+particular API.
+ <p><!-- ======================================================================= --> </p>
+</ul>
+<table width="100%" bgcolor="#441188" border="0" cellpadding="4"
+ cellspacing="0">
+ <tbody>
+ <tr>
+ <td> </td>
+ <td width="100%"> <font color="#eeeeff"
+ face="Georgia,Palatino"><b> <a name="stl">The C++ Standard Template
+Library</a> </b></font></td>
+ </tr>
+ </tbody>
+</table>
+<ul>
+LLVM makes heavy use of the C++ Standard Template Library (STL),
+perhaps much more than you are used to, or have seen before. Because of
+this, you might want to do a little background reading in the
+techniques used and capabilities of the library. There are many good
+pages that discuss the STL, and several books on the subject that you
+can get, so it will not be discussed in this document.
+ <p> Here are some useful links:</p>
+ <p> </p>
+ <ol>
+ <li><a href="http://www.dinkumware.com/refxcpp.html">Dinkumware C++
+Library reference</a> - an excellent reference for the STL and other
+parts of the standard C++ library. </li>
+ <li><a href="http://www.tempest-sw.com/cpp/">C++ In a Nutshell</a> -
+This is an O'Reilly book in the making. It has a decent <a
+ href="http://www.tempest-sw.com/cpp/ch13-libref.html">Standard Library
+Reference</a> that rivals Dinkumware's, and is actually free until the
+book is published. </li>
+ <li><a href="http://www.parashift.com/c++-faq-lite/">C++ Frequently
+Asked Questions</a> </li>
+ <li><a href="http://www.sgi.com/tech/stl/">SGI's STL Programmer's
+Guide</a> - Contains a useful <a
+ href="http://www.sgi.com/tech/stl/stl_introduction.html">Introduction
+to the STL</a>. </li>
+ <li><a href="http://www.research.att.com/%7Ebs/C++.html">Bjarne
+Stroustrup's C++ Page</a> </li>
+ </ol>
+ <p> You are also encouraged to take a look at the <a
+ href="CodingStandards.html">LLVM Coding Standards</a> guide which
+focuses on how to write maintainable code more than where to put your
+curly braces.</p>
+ <p><!-- ======================================================================= --> </p>
+</ul>
+<table width="100%" bgcolor="#441188" border="0" cellpadding="4"
+ cellspacing="0">
+ <tbody>
+ <tr>
+ <td> </td>
+ <td width="100%"> <font color="#eeeeff"
+ face="Georgia,Palatino"><b> <a name="stl">Other useful references</a> </b></font></td>
+ </tr>
+ </tbody>
+</table>
+<ul>
+LLVM is currently using CVS as its source versioning system. You may
+find this reference handy:
+ <p> </p>
+ <ol>
+ <li><a href="http://www.psc.edu/%7Esemke/cvs_branches.html">CVS
+Branch and Tag Primer</a></li>
+ </ol>
+ <p><!-- *********************************************************************** --> </p>
+</ul>
+<table width="100%" bgcolor="#330077" border="0" cellpadding="4"
+ cellspacing="0">
+ <tbody>
+ <tr>
+ <td align="center"><font color="#eeeeff" size="+2"
+ face="Georgia,Palatino"><b> <a name="apis">Important and useful LLVM
+APIs </a></b></font></td>
+ </tr>
+ </tbody>
+</table>
+<ul>
<!-- *********************************************************************** -->
-
-Here we highlight some LLVM APIs that are generally useful and good to know
-about when writing transformations.<p>
-
-<!-- ======================================================================= -->
-</ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
-<tr><td> </td><td width="100%">
-<font color="#EEEEFF" face="Georgia,Palatino"><b>
-<a name="isa">The isa<>, cast<> and dyn_cast<> templates</a>
-</b></font></td></tr></table><ul>
-
-The LLVM source-base makes extensive use of a custom form of RTTI. These
-templates have many similarities to the C++ <tt>dynamic_cast<></tt>
-operator, but they don't have some drawbacks (primarily stemming from the fact
-that <tt>dynamic_cast<></tt> only works on classes that have a v-table).
-Because they are used so often, you must know what they do and how they work.
-All of these templates are defined in the <a
-href="/doxygen/Casting_8h-source.html"><tt>Support/Casting.h</tt></a> file (note
-that you very rarely have to include this file directly).<p>
-
-<dl>
-
-<dt><tt>isa<></tt>:
-
-<dd>The <tt>isa<></tt> operator works exactly like the Java
-"<tt>instanceof</tt>" operator. It returns true or false depending on whether a
-reference or pointer points to an instance of the specified class. This can be
-very useful for constraint checking of various sorts (example below).<p>
-
-
-<dt><tt>cast<></tt>:
-
-<dd>The <tt>cast<></tt> operator is a "checked cast" operation. It
-converts a pointer or reference from a base class to a derived cast, causing an
-assertion failure if it is not really an instance of the right type. This
-should be used in cases where you have some information that makes you believe
-that something is of the right type. An example of the <tt>isa<></tt> and
-<tt>cast<></tt> template is:<p>
-
-<pre>
-static bool isLoopInvariant(const <a href="#Value">Value</a> *V, const Loop *L) {
- if (isa<<a href="#Constant">Constant</a>>(V) || isa<<a href="#Argument">Argument</a>>(V) || isa<<a href="#GlobalValue">GlobalValue</a>>(V))
- return true;
-
- <i>// Otherwise, it must be an instruction...</i>
- return !L->contains(cast<<a href="#Instruction">Instruction</a>>(V)->getParent());
-</pre><p>
-
-Note that you should <b>not</b> use an <tt>isa<></tt> test followed by a
-<tt>cast<></tt>, for that use the <tt>dyn_cast<></tt> operator.<p>
-
-
-<dt><tt>dyn_cast<></tt>:
-
-<dd>The <tt>dyn_cast<></tt> operator is a "checking cast" operation. It
-checks to see if the operand is of the specified type, and if so, returns a
-pointer to it (this operator does not work with references). If the operand is
-not of the correct type, a null pointer is returned. Thus, this works very much
-like the <tt>dynamic_cast</tt> operator in C++, and should be used in the same
-circumstances. Typically, the <tt>dyn_cast<></tt> operator is used in an
-<tt>if</tt> statement or some other flow control statement like this:<p>
-
-<pre>
- if (<a href="#AllocationInst">AllocationInst</a> *AI = dyn_cast<<a href="#AllocationInst">AllocationInst</a>>(Val)) {
- ...
- }
-</pre><p>
-
-This form of the <tt>if</tt> statement effectively combines together a call to
-<tt>isa<></tt> and a call to <tt>cast<></tt> into one statement,
-which is very convenient.<p>
-
-Another common example is:<p>
-
-<pre>
- <i>// Loop over all of the phi nodes in a basic block</i>
- BasicBlock::iterator BBI = BB->begin();
- for (; <a href="#PhiNode">PHINode</a> *PN = dyn_cast<<a href="#PHINode">PHINode</a>>(BBI); ++BBI)
- cerr << *PN;
-</pre><p>
-
-Note that the <tt>dyn_cast<></tt> operator, like C++'s
-<tt>dynamic_cast</tt> or Java's <tt>instanceof</tt> operator, can be abused. In
-particular you should not use big chained <tt>if/then/else</tt> blocks to check
-for lots of different variants of classes. If you find yourself wanting to do
-this, it is much cleaner and more efficient to use the InstVisitor class to
-dispatch over the instruction type directly.<p>
-
-
-<dt><tt>cast_or_null<></tt>:
-
-<dd>The <tt>cast_or_null<></tt> operator works just like the
-<tt>cast<></tt> operator, except that it allows for a null pointer as an
-argument (which it then propagates). This can sometimes be useful, allowing you
-to combine several null checks into one.<p>
-
-
-<dt><tt>dyn_cast_or_null<></tt>:
-
-<dd>The <tt>dyn_cast_or_null<></tt> operator works just like the
-<tt>dyn_cast<></tt> operator, except that it allows for a null pointer as
-an argument (which it then propagates). This can sometimes be useful, allowing
-you to combine several null checks into one.<p>
-
-</dl>
-
-These five templates can be used with any classes, whether they have a v-table
-or not. To add support for these templates, you simply need to add
-<tt>classof</tt> static methods to the class you are interested casting to.
-Describing this is currently outside the scope of this document, but there are
-lots of examples in the LLVM source base.<p>
-
-
-<!-- ======================================================================= -->
-</ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
-<tr><td> </td><td width="100%">
-<font color="#EEEEFF" face="Georgia,Palatino"><b>
-<a name="DEBUG">The <tt>DEBUG()</tt> macro & <tt>-debug</tt> option</a>
-</b></font></td></tr></table><ul>
-
-Often when working on your pass you will put a bunch of debugging printouts and
-other code into your pass. After you get it working, you want to remove
-it... but you may need it again in the future (to work out new bugs that you run
-across).<p>
-
-Naturally, because of this, you don't want to delete the debug printouts, but
-you don't want them to always be noisy. A standard compromise is to comment
-them out, allowing you to enable them if you need them in the future.<p>
-
-The "<tt><a href="/doxygen/Debug_8h-source.html">Support/Debug.h</a></tt>" file
-provides a macro named <tt>DEBUG()</tt> that is a much nicer solution to this
-problem. Basically, you can put arbitrary code into the argument of the
-<tt>DEBUG</tt> macro, and it is only executed if '<tt>opt</tt>' (or any other
-tool) is run with the '<tt>-debug</tt>' command line argument:
-
-<pre>
- ...
- DEBUG(std::cerr << "I am here!\n");
- ...
-</pre><p>
-
-Then you can run your pass like this:<p>
-
-<pre>
- $ opt < a.bc > /dev/null -mypass
- <no output>
- $ opt < a.bc > /dev/null -mypass -debug
- I am here!
- $
-</pre><p>
-
-Using the <tt>DEBUG()</tt> macro instead of a home-brewed solution allows you to
-now have to create "yet another" command line option for the debug output for
-your pass. Note that <tt>DEBUG()</tt> macros are disabled for optimized builds,
-so they do not cause a performance impact at all (for the same reason, they
-should also not contain side-effects!).<p>
-
-One additional nice thing about the <tt>DEBUG()</tt> macro is that you can
-enable or disable it directly in gdb. Just use "<tt>set DebugFlag=0</tt>" or
-"<tt>set DebugFlag=1</tt>" from the gdb if the program is running. If the
-program hasn't been started yet, you can always just run it with
-<tt>-debug</tt>.<p>
-
-<!-- _______________________________________________________________________ -->
-</ul><h4><a name="DEBUG_TYPE"><hr size=0>Fine grained debug info with
- <tt>DEBUG_TYPE()</tt> and the <tt>-debug-only</tt> option</a> </h4><ul>
-
+Here we highlight some LLVM APIs that are generally useful and good to
+know about when writing transformations.
+ <p><!-- ======================================================================= --> </p>
+</ul>
+<table width="100%" bgcolor="#441188" border="0" cellpadding="4"
+ cellspacing="0">
+ <tbody>
+ <tr>
+ <td> </td>
+ <td width="100%"> <font color="#eeeeff"
+ face="Georgia,Palatino"><b> <a name="isa">The isa<>,
+cast<> and dyn_cast<> templates</a> </b></font></td>
+ </tr>
+ </tbody>
+</table>
+<ul>
+The LLVM source-base makes extensive use of a custom form of RTTI.
+These templates have many similarities to the C++ <tt>dynamic_cast<></tt>
+operator, but they don't have some drawbacks (primarily stemming from
+the fact that <tt>dynamic_cast<></tt> only works on classes that
+have a v-table). Because they are used so often, you must know what they
+do and how they work. All of these templates are defined in the <a
+ href="/doxygen/Casting_8h-source.html"><tt>Support/Casting.h</tt></a>
+file (note that you very rarely have to include this file directly).
+ <p> </p>
+ <dl>
+ <dt><tt>isa<></tt>: </dt>
+ <dd>The <tt>isa<></tt> operator works exactly like the Java "<tt>instanceof</tt>"
+operator. It returns true or false depending on whether a reference or
+pointer points to an instance of the specified class. This can be very
+useful for constraint checking of various sorts (example below).
+ <p> </p>
+ </dd>
+ <dt><tt>cast<></tt>: </dt>
+ <dd>The <tt>cast<></tt> operator is a "checked cast"
+operation. It converts a pointer or reference from a base class to a
+derived cast, causing an assertion failure if it is not really an
+instance of the right type. This should be used in cases where you have
+some information that makes you believe that something is of the right
+type. An example of the <tt>isa<></tt> and <tt>cast<></tt>
+template is:
+ <p> </p>
+ <pre>static bool isLoopInvariant(const <a href="#Value">Value</a> *V, const Loop *L) {<br> if (isa<<a
+ href="#Constant">Constant</a>>(V) || isa<<a href="#Argument">Argument</a>>(V) || isa<<a
+ href="#GlobalValue">GlobalValue</a>>(V))<br> return true;<br><br> <i>// Otherwise, it must be an instruction...</i><br> return !L->contains(cast<<a
+ href="#Instruction">Instruction</a>>(V)->getParent());<br></pre>
+ <p> Note that you should <b>not</b> use an <tt>isa<></tt>
+test followed by a <tt>cast<></tt>, for that use the <tt>dyn_cast<></tt>
+operator.</p>
+ <p> </p>
+ </dd>
+ <dt><tt>dyn_cast<></tt>: </dt>
+ <dd>The <tt>dyn_cast<></tt> operator is a "checking cast"
+operation. It checks to see if the operand is of the specified type, and
+if so, returns a pointer to it (this operator does not work with
+references). If the operand is not of the correct type, a null pointer
+is returned. Thus, this works very much like the <tt>dynamic_cast</tt>
+operator in C++, and should be used in the same circumstances.
+Typically, the <tt>dyn_cast<></tt> operator is used in an <tt>if</tt>
+statement or some other flow control statement like this:
+ <p> </p>
+ <pre> if (<a href="#AllocationInst">AllocationInst</a> *AI = dyn_cast<<a
+ href="#AllocationInst">AllocationInst</a>>(Val)) {<br> ...<br> }<br></pre>
+ <p> This form of the <tt>if</tt> statement effectively combines
+together a call to <tt>isa<></tt> and a call to <tt>cast<></tt>
+into one statement, which is very convenient.</p>
+ <p> Another common example is:</p>
+ <p> </p>
+ <pre> <i>// Loop over all of the phi nodes in a basic block</i><br> BasicBlock::iterator BBI = BB->begin();<br> for (; <a
+ href="#PhiNode">PHINode</a> *PN = dyn_cast<<a href="#PHINode">PHINode</a>>(BBI); ++BBI)<br> cerr << *PN;<br></pre>
+ <p> Note that the <tt>dyn_cast<></tt> operator, like C++'s <tt>dynamic_cast</tt>
+or Java's <tt>instanceof</tt> operator, can be abused. In particular
+you should not use big chained <tt>if/then/else</tt> blocks to check for
+lots of different variants of classes. If you find yourself wanting to
+do this, it is much cleaner and more efficient to use the InstVisitor
+class to dispatch over the instruction type directly.</p>
+ <p> </p>
+ </dd>
+ <dt><tt>cast_or_null<></tt>: </dt>
+ <dd>The <tt>cast_or_null<></tt> operator works just like the <tt>cast<></tt>
+operator, except that it allows for a null pointer as an argument (which
+it then propagates). This can sometimes be useful, allowing you to
+combine several null checks into one.
+ <p> </p>
+ </dd>
+ <dt><tt>dyn_cast_or_null<></tt>: </dt>
+ <dd>The <tt>dyn_cast_or_null<></tt> operator works just like
+the <tt>dyn_cast<></tt> operator, except that it allows for a null
+pointer as an argument (which it then propagates). This can sometimes
+be useful, allowing you to combine several null checks into one.
+ <p> </p>
+ </dd>
+ </dl>
+These five templates can be used with any classes, whether they have a
+v-table or not. To add support for these templates, you simply need to
+add <tt>classof</tt> static methods to the class you are interested
+casting to. Describing this is currently outside the scope of this
+document, but there are lots of examples in the LLVM source base.
+ <p><!-- ======================================================================= --> </p>
+</ul>
+<table width="100%" bgcolor="#441188" border="0" cellpadding="4"
+ cellspacing="0">
+ <tbody>
+ <tr>
+ <td> </td>
+ <td width="100%"> <font color="#eeeeff"
+ face="Georgia,Palatino"><b> <a name="DEBUG">The <tt>DEBUG()</tt> macro
+& <tt>-debug</tt> option</a> </b></font></td>
+ </tr>
+ </tbody>
+</table>
+<ul>
+Often when working on your pass you will put a bunch of debugging
+printouts and other code into your pass. After you get it working, you
+want to remove it... but you may need it again in the future (to work
+out new bugs that you run across).
+ <p> Naturally, because of this, you don't want to delete the debug
+printouts, but you don't want them to always be noisy. A standard
+compromise is to comment them out, allowing you to enable them if you
+need them in the future.</p>
+ <p> The "<tt><a href="/doxygen/Debug_8h-source.html">Support/Debug.h</a></tt>"
+file provides a macro named <tt>DEBUG()</tt> that is a much nicer
+solution to this problem. Basically, you can put arbitrary code into
+the argument of the <tt>DEBUG</tt> macro, and it is only executed if '<tt>opt</tt>'
+(or any other tool) is run with the '<tt>-debug</tt>' command line
+argument: </p>
+ <pre> ... <br> DEBUG(std::cerr << "I am here!\n");<br> ...<br></pre>
+ <p> Then you can run your pass like this:</p>
+ <p> </p>
+ <pre> $ opt < a.bc > /dev/null -mypass<br> <no output><br> $ opt < a.bc > /dev/null -mypass -debug<br> I am here!<br> $<br></pre>
+ <p> Using the <tt>DEBUG()</tt> macro instead of a home-brewed solution
+allows you to now have to create "yet another" command line option for
+the debug output for your pass. Note that <tt>DEBUG()</tt> macros are
+disabled for optimized builds, so they do not cause a performance impact
+at all (for the same reason, they should also not contain
+side-effects!).</p>
+ <p> One additional nice thing about the <tt>DEBUG()</tt> macro is that
+you can enable or disable it directly in gdb. Just use "<tt>set
+DebugFlag=0</tt>" or "<tt>set DebugFlag=1</tt>" from the gdb if the
+program is running. If the program hasn't been started yet, you can
+always just run it with <tt>-debug</tt>.</p>
+ <p><!-- _______________________________________________________________________ --> </p>
+</ul>
+<h4><a name="DEBUG_TYPE">
+<hr size="1">Fine grained debug info with <tt>DEBUG_TYPE()</tt> and the <tt>-debug-only</tt>
+option</a> </h4>
+<ul>
Sometimes you may find yourself in a situation where enabling <tt>-debug</tt>
-just turns on <b>too much</b> information (such as when working on the code
-generator). If you want to enable debug information with more fine-grained
-control, you define the <tt>DEBUG_TYPE</tt> macro and the <tt>-debug</tt> only
-option as follows:<p>
-
-<pre>
- ...
- DEBUG(std::cerr << "No debug type\n");
- #undef DEBUG_TYPE
- #define DEBUG_TYPE "foo"
- DEBUG(std::cerr << "'foo' debug type\n");
- #undef DEBUG_TYPE
- #define DEBUG_TYPE "bar"
- DEBUG(std::cerr << "'bar' debug type\n");
- #undef DEBUG_TYPE
- #define DEBUG_TYPE ""
- DEBUG(std::cerr << "No debug type (2)\n");
- ...
-</pre><p>
-
-Then you can run your pass like this:<p>
-
-<pre>
- $ opt < a.bc > /dev/null -mypass
- <no output>
- $ opt < a.bc > /dev/null -mypass -debug
- No debug type
- 'foo' debug type
- 'bar' debug type
- No debug type (2)
- $ opt < a.bc > /dev/null -mypass -debug-only=foo
- 'foo' debug type
- $ opt < a.bc > /dev/null -mypass -debug-only=bar
- 'bar' debug type
- $
-</pre><p>
-
-Of course, in practice, you should only set <tt>DEBUG_TYPE</tt> at the top of a
-file, to specify the debug type for the entire module (if you do this before you
-<tt>#include "Support/Debug.h"</tt>, you don't have to insert the ugly
-<tt>#undef</tt>'s). Also, you should use names more meaningful that "foo" and
-"bar", because there is no system in place to ensure that names do not conflict:
-if two different modules use the same string, they will all be turned on when
-the name is specified. This allows all, say, instruction scheduling, debug
-information to be enabled with <tt>-debug-type=InstrSched</tt>, even if the
-source lives in multiple files.<p>
-
-
-<!-- ======================================================================= -->
-</ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
-<tr><td> </td><td width="100%">
-<font color="#EEEEFF" face="Georgia,Palatino"><b>
-<a name="Statistic">The <tt>Statistic</tt> template & <tt>-stats</tt>
-option</a>
-</b></font></td></tr></table><ul>
-
-The "<tt><a
-href="/doxygen/Statistic_8h-source.html">Support/Statistic.h</a></tt>"
-file provides a template named <tt>Statistic</tt> that is used as a unified way
-to keeping track of what the LLVM compiler is doing and how effective various
-optimizations are. It is useful to see what optimizations are contributing to
-making a particular program run faster.<p>
-
-Often you may run your pass on some big program, and you're interested to see
-how many times it makes a certain transformation. Although you can do this with
-hand inspection, or some ad-hoc method, this is a real pain and not very useful
-for big programs. Using the <tt>Statistic</tt> template makes it very easy to
-keep track of this information, and the calculated information is presented in a
-uniform manner with the rest of the passes being executed.<p>
-
-There are many examples of <tt>Statistic</tt> users, but this basics of using it
-are as follows:<p>
-
-<ol>
-<li>Define your statistic like this:<p>
-
-<pre>
-static Statistic<> NumXForms("mypassname", "The # of times I did stuff");
-</pre><p>
-
-The <tt>Statistic</tt> template can emulate just about any data-type, but if you
-do not specify a template argument, it defaults to acting like an unsigned int
-counter (this is usually what you want).<p>
-
-<li>Whenever you make a transformation, bump the counter:<p>
-
-<pre>
- ++NumXForms; // I did stuff
-</pre><p>
-
-</ol><p>
-
-That's all you have to do. To get '<tt>opt</tt>' to print out the statistics
-gathered, use the '<tt>-stats</tt>' option:<p>
-
-<pre>
- $ opt -stats -mypassname < program.bc > /dev/null
- ... statistic output ...
-</pre><p>
-
-When running <tt>gccas</tt> on a C file from the SPEC benchmark suite, it gives
-a report that looks like this:<p>
-
-<pre>
- 7646 bytecodewriter - Number of normal instructions
- 725 bytecodewriter - Number of oversized instructions
- 129996 bytecodewriter - Number of bytecode bytes written
- 2817 raise - Number of insts DCEd or constprop'd
- 3213 raise - Number of cast-of-self removed
- 5046 raise - Number of expression trees converted
- 75 raise - Number of other getelementptr's formed
- 138 raise - Number of load/store peepholes
- 42 deadtypeelim - Number of unused typenames removed from symtab
- 392 funcresolve - Number of varargs functions resolved
- 27 globaldce - Number of global variables removed
- 2 adce - Number of basic blocks removed
- 134 cee - Number of branches revectored
- 49 cee - Number of setcc instruction eliminated
- 532 gcse - Number of loads removed
- 2919 gcse - Number of instructions removed
- 86 indvars - Number of canonical indvars added
- 87 indvars - Number of aux indvars removed
- 25 instcombine - Number of dead inst eliminate
- 434 instcombine - Number of insts combined
- 248 licm - Number of load insts hoisted
- 1298 licm - Number of insts hoisted to a loop pre-header
- 3 licm - Number of insts hoisted to multiple loop preds (bad, no loop pre-header)
- 75 mem2reg - Number of alloca's promoted
- 1444 cfgsimplify - Number of blocks simplified
-</pre><p>
-
-Obviously, with so many optimizations, having a unified framework for this stuff
-is very nice. Making your pass fit well into the framework makes it more
-maintainable and useful.<p>
-
-
-<!-- *********************************************************************** -->
-</ul><table width="100%" bgcolor="#330077" border=0 cellpadding=4 cellspacing=0>
-<tr><td align=center><font color="#EEEEFF" size=+2 face="Georgia,Palatino"><b>
-<a name="common">Helpful Hints for Common Operations
-</b></font></td></tr></table><ul> <!--
+just turns on <b>too much</b> information (such as when working on the
+code generator). If you want to enable debug information with more
+fine-grained control, you define the <tt>DEBUG_TYPE</tt> macro and the <tt>-debug</tt>
+only option as follows:
+ <p> </p>
+ <pre> ...<br> DEBUG(std::cerr << "No debug type\n");<br> #undef DEBUG_TYPE<br> #define DEBUG_TYPE "foo"<br> DEBUG(std::cerr << "'foo' debug type\n");<br> #undef DEBUG_TYPE<br> #define DEBUG_TYPE "bar"<br> DEBUG(std::cerr << "'bar' debug type\n");<br> #undef DEBUG_TYPE<br> #define DEBUG_TYPE ""<br> DEBUG(std::cerr << "No debug type (2)\n");<br> ...<br></pre>
+ <p> Then you can run your pass like this:</p>
+ <p> </p>
+ <pre> $ opt < a.bc > /dev/null -mypass<br> <no output><br> $ opt < a.bc > /dev/null -mypass -debug<br> No debug type<br> 'foo' debug type<br> 'bar' debug type<br> No debug type (2)<br> $ opt < a.bc > /dev/null -mypass -debug-only=foo<br> 'foo' debug type<br> $ opt < a.bc > /dev/null -mypass -debug-only=bar<br> 'bar' debug type<br> $<br></pre>
+ <p> Of course, in practice, you should only set <tt>DEBUG_TYPE</tt> at
+the top of a file, to specify the debug type for the entire module (if
+you do this before you <tt>#include "Support/Debug.h"</tt>, you don't
+have to insert the ugly <tt>#undef</tt>'s). Also, you should use names
+more meaningful than "foo" and "bar", because there is no system in
+place to ensure that names do not conflict. If two different modules
+use the same string, they will all be turned on when the name is
+specified. This allows, for example, all debug information for
+instruction scheduling to be enabled with <tt>-debug-type=InstrSched</tt>,
+even if the source lives in multiple files.</p>
+ <p><!-- ======================================================================= --> </p>
+</ul>
+<table width="100%" bgcolor="#441188" border="0" cellpadding="4"
+ cellspacing="0">
+ <tbody>
+ <tr>
+ <td> </td>
+ <td width="100%"> <font color="#eeeeff"
+ face="Georgia,Palatino"><b> <a name="Statistic">The <tt>Statistic</tt>
+template & <tt>-stats</tt> option</a> </b></font></td>
+ </tr>
+ </tbody>
+</table>
+<ul>
+The "<tt><a href="/doxygen/Statistic_8h-source.html">Support/Statistic.h</a></tt>"
+file provides a template named <tt>Statistic</tt> that is used as a
+unified way to keep track of what the LLVM compiler is doing and how
+effective various optimizations are. It is useful to see what
+optimizations are contributing to making a particular program run
+faster.
+ <p> Often you may run your pass on some big program, and you're
+interested to see how many times it makes a certain transformation.
+Although you can do this with hand inspection, or some ad-hoc method,
+this is a real pain and not very useful for big programs. Using the <tt>Statistic</tt>
+template makes it very easy to keep track of this information, and the
+calculated information is presented in a uniform manner with the rest of
+the passes being executed.</p>
+ <p> There are many examples of <tt>Statistic</tt> uses, but the basics
+of using it are as follows:</p>
+ <p> </p>
+ <ol>
+ <li>Define your statistic like this:
+ <p> </p>
+ <pre>static Statistic<> NumXForms("mypassname", "The # of times I did stuff");<br></pre>
+ <p> The <tt>Statistic</tt> template can emulate just about any
+data-type, but if you do not specify a template argument, it defaults to
+acting like an unsigned int counter (this is usually what you want).</p>
+ <p> </p>
+ </li>
+ <li>Whenever you make a transformation, bump the counter:
+ <p> </p>
+ <pre> ++NumXForms; // I did stuff<br></pre>
+ <p> </p>
+ </li>
+ </ol>
+ <p> That's all you have to do. To get '<tt>opt</tt>' to print out the
+statistics gathered, use the '<tt>-stats</tt>' option:</p>
+ <p> </p>
+ <pre> $ opt -stats -mypassname < program.bc > /dev/null<br> ... statistic output ...<br></pre>
+ <p> When running <tt>gccas</tt> on a C file from the SPEC benchmark
+suite, it gives a report that looks like this:</p>
+ <p> </p>
+ <pre> 7646 bytecodewriter - Number of normal instructions<br> 725 bytecodewriter - Number of oversized instructions<br> 129996 bytecodewriter - Number of bytecode bytes written<br> 2817 raise - Number of insts DCEd or constprop'd<br> 3213 raise - Number of cast-of-self removed<br> 5046 raise - Number of expression trees converted<br> 75 raise - Number of other getelementptr's formed<br> 138 raise - Number of load/store peepholes<br> 42 deadtypeelim - Number of unused typenames removed from symtab<br> 392 funcresolve - Number of varargs functions resolved<br> 27 globaldce - Number of global variables removed<br> 2 adce - Number of basic blocks removed<br> 134 cee - Number of branches revectored<br> 49 cee - Number of setcc instruction eliminated<br> 532 gcse - Number of loads removed<br> 2919 gcse - Number !
of instructions removed<br> 86 indvars - Number of canonical indvars added<br> 87 indvars - Number of aux indvars removed<br> 25 instcombine - Number of dead inst eliminate<br> 434 instcombine - Number of insts combined<br> 248 licm - Number of load insts hoisted<br> 1298 licm - Number of insts hoisted to a loop pre-header<br> 3 licm - Number of insts hoisted to multiple loop preds (bad, no loop pre-header)<br> 75 mem2reg - Number of alloca's promoted<br> 1444 cfgsimplify - Number of blocks simplified<br></pre>
+ <p> Obviously, with so many optimizations, having a unified framework
+for this stuff is very nice. Making your pass fit well into the
+framework makes it more maintainable and useful.</p>
+ <p><!-- *********************************************************************** --> </p>
+</ul>
+<table width="100%" bgcolor="#330077" border="0" cellpadding="4"
+ cellspacing="0">
+ <tbody>
+ <tr>
+ <td align="center"><font color="#eeeeff" size="+2"
+ face="Georgia,Palatino"><b> <a name="common">Helpful Hints for Common
+Operations </a></b></font></td>
+ </tr>
+ </tbody>
+</table>
+<ul>
+<!--
*********************************************************************** -->
-
-This section describes how to perform some very simple transformations of LLVM
-code. This is meant to give examples of common idioms used, showing the
-practical side of LLVM transformations.<p>
-
-Because this is a "how-to" section, you should also read about the main classes
-that you will be working with. The <a href="#coreclasses">Core LLVM Class
-Hierarchy Reference</a> contains details and descriptions of the main classes
-that you should know about.<p>
-
-<!-- NOTE: this section should be heavy on example code -->
-
-
-<!-- ======================================================================= -->
-</ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
-<tr><td> </td><td width="100%">
-<font color="#EEEEFF" face="Georgia,Palatino"><b>
-<a name="inspection">Basic Inspection and Traversal Routines</a>
-</b></font></td></tr></table><ul>
-
-The LLVM compiler infrastructure have many different data structures that may be
-traversed. Following the example of the C++ standard template library, the
-techniques used to traverse these various data structures are all basically the
-same. For a enumerable sequence of values, the <tt>XXXbegin()</tt> function (or
-method) returns an iterator to the start of the sequence, the <tt>XXXend()</tt>
-function returns an iterator pointing to one past the last valid element of the
-sequence, and there is some <tt>XXXiterator</tt> data type that is common
-between the two operations.<p>
-
-Because the pattern for iteration is common across many different aspects of the
-program representation, the standard template library algorithms may be used on
-them, and it is easier to remember how to iterate. First we show a few common
-examples of the data structures that need to be traversed. Other data
-structures are traversed in very similar ways.<p>
-
-
-<!-- _______________________________________________________________________ -->
-</ul><h4><a name="iterate_function"><hr size=0>Iterating over the <a
-href="#BasicBlock"><tt>BasicBlock</tt></a>s in a <a
-href="#Function"><tt>Function</tt></a> </h4><ul>
-
+This section describes how to perform some very simple transformations
+of LLVM code. This is meant to give examples of common idioms used,
+showing the practical side of LLVM transformations.
+ <p> Because this is a "how-to" section, you should also read about the
+main classes that you will be working with. The <a href="#coreclasses">Core
+LLVM Class Hierarchy Reference</a> contains details and descriptions of
+the main classes that you should know about.</p>
+ <p><!-- NOTE: this section should be heavy on example code --><!-- ======================================================================= --> </p>
+</ul>
+<table width="100%" bgcolor="#441188" border="0" cellpadding="4"
+ cellspacing="0">
+ <tbody>
+ <tr>
+ <td> </td>
+ <td width="100%"> <font color="#eeeeff"
+ face="Georgia,Palatino"><b> <a name="inspection">Basic Inspection and
+Traversal Routines</a> </b></font></td>
+ </tr>
+ </tbody>
+</table>
+<ul>
+The LLVM compiler infrastructure have many different data structures
+that may be traversed. Following the example of the C++ standard
+template library, the techniques used to traverse these various data
+structures are all basically the same. For a enumerable sequence of
+values, the <tt>XXXbegin()</tt> function (or method) returns an iterator
+to the start of the sequence, the <tt>XXXend()</tt> function returns an
+iterator pointing to one past the last valid element of the sequence,
+and there is some <tt>XXXiterator</tt> data type that is common between
+the two operations.
+ <p> Because the pattern for iteration is common across many different
+aspects of the program representation, the standard template library
+algorithms may be used on them, and it is easier to remember how to
+iterate. First we show a few common examples of the data structures that
+need to be traversed. Other data structures are traversed in very
+similar ways.</p>
+ <p><!-- _______________________________________________________________________ --> </p>
+</ul>
+<h4>
+<hr size="1"><a name="iterate_function">Iterating over the </a><a
+ href="#BasicBlock"><tt>BasicBlock</tt></a>s in a <a href="#Function"><tt>Function</tt></a> </h4>
+<ul>
It's quite common to have a <tt>Function</tt> instance that you'd like
-to transform in some way; in particular, you'd like to manipulate its
-<tt>BasicBlock</tt>s. To facilitate this, you'll need to iterate over
-all of the <tt>BasicBlock</tt>s that constitute the <tt>Function</tt>.
-The following is an example that prints the name of a
-<tt>BasicBlock</tt> and the number of <tt>Instruction</tt>s it
-contains:
-
-<pre>
- // func is a pointer to a Function instance
- for (Function::iterator i = func->begin(), e = func->end(); i != e; ++i) {
-
- // print out the name of the basic block if it has one, and then the
- // number of instructions that it contains
-
- cerr << "Basic block (name=" << i->getName() << ") has "
- << i->size() << " instructions.\n";
- }
-</pre>
-
+to transform in some way; in particular, you'd like to manipulate its <tt>BasicBlock</tt>s.
+To facilitate this, you'll need to iterate over all of the <tt>BasicBlock</tt>s
+that constitute the <tt>Function</tt>. The following is an example
+that prints the name of a <tt>BasicBlock</tt> and the number of <tt>Instruction</tt>s
+it contains:
+ <pre> // func is a pointer to a Function instance<br> for (Function::iterator i = func->begin(), e = func->end(); i != e; ++i) {<br><br> // print out the name of the basic block if it has one, and then the<br> // number of instructions that it contains<br><br> cerr << "Basic block (name=" << i->getName() << ") has " <br> << i->size() << " instructions.\n";<br> }<br></pre>
Note that i can be used as if it were a pointer for the purposes of
invoking member functions of the <tt>Instruction</tt> class. This is
because the indirection operator is overloaded for the iterator
classes. In the above code, the expression <tt>i->size()</tt> is
-exactly equivalent to <tt>(*i).size()</tt> just like you'd expect.
-
-<!-- _______________________________________________________________________ -->
-</ul><h4><a name="iterate_basicblock"><hr size=0>Iterating over the <a
-href="#Instruction"><tt>Instruction</tt></a>s in a <a
-href="#BasicBlock"><tt>BasicBlock</tt></a> </h4><ul>
-
-Just like when dealing with <tt>BasicBlock</tt>s in
-<tt>Function</tt>s, it's easy to iterate over the individual
-instructions that make up <tt>BasicBlock</tt>s. Here's a code snippet
-that prints out each instruction in a <tt>BasicBlock</tt>:
-
-<pre>
- // blk is a pointer to a BasicBlock instance
- for (BasicBlock::iterator i = blk->begin(), e = blk->end(); i != e; ++i)
- // the next statement works since operator<<(ostream&,...)
- // is overloaded for Instruction&
- cerr << *i << "\n";
-</pre>
-
-However, this isn't really the best way to print out the contents of a
-<tt>BasicBlock</tt>! Since the ostream operators are overloaded for
-virtually anything you'll care about, you could have just invoked the
-print routine on the basic block itself: <tt>cerr << *blk <<
-"\n";</tt>.<p>
-
-Note that currently operator<< is implemented for <tt>Value*</tt>, so it
-will print out the contents of the pointer, instead of
-the pointer value you might expect. This is a deprecated interface that will
-be removed in the future, so it's best not to depend on it. To print out the
-pointer value for now, you must cast to <tt>void*</tt>.<p>
-
-
-<!-- _______________________________________________________________________ -->
-</ul><h4><a name="iterate_institer"><hr size=0>Iterating over the <a
-href="#Instruction"><tt>Instruction</tt></a>s in a <a
-href="#Function"><tt>Function</tt></a></h4><ul>
-
-If you're finding that you commonly iterate over a <tt>Function</tt>'s
-<tt>BasicBlock</tt>s and then that <tt>BasicBlock</tt>'s
-<tt>Instruction</tt>s, <tt>InstIterator</tt> should be used instead.
-You'll need to include <a href="/doxygen/InstIterator_8h-source.html"><tt>llvm/Support/InstIterator.h</tt></a>, and then
-instantiate <tt>InstIterator</tt>s explicitly in your code. Here's a
-small example that shows how to dump all instructions in a function to
-stderr (<b>Note:</b> Dereferencing an <tt>InstIterator</tt> yields an
-<tt>Instruction*</tt>, <i>not</i> an <tt>Instruction&</tt>!):
-
-<pre>
-#include "<a href="/doxygen/InstIterator_8h-source.html">llvm/Support/InstIterator.h</a>"
-...
-// Suppose F is a ptr to a function
-for (inst_iterator i = inst_begin(F), e = inst_end(F); i != e; ++i)
- cerr << **i << "\n";
-</pre>
-
+exactly equivalent to <tt>(*i).size()</tt> just like you'd expect.<!-- _______________________________________________________________________ -->
+</ul>
+<h4>
+<hr size="1"><a name="iterate_basicblock">Iterating over the </a><a
+ href="#Instruction"><tt>Instruction</tt></a>s in a <a
+ href="#BasicBlock"><tt>BasicBlock</tt></a> </h4>
+<ul>
+Just like when dealing with <tt>BasicBlock</tt>s in <tt>Function</tt>s,
+it's easy to iterate over the individual instructions that make up <tt>BasicBlock</tt>s.
+Here's a code snippet that prints out each instruction in a <tt>BasicBlock</tt>:
+ <pre> // blk is a pointer to a BasicBlock instance<br> for (BasicBlock::iterator i = blk->begin(), e = blk->end(); i != e; ++i)<br> // the next statement works since operator<<(ostream&,...) <br> // is overloaded for Instruction&<br> cerr << *i << "\n";<br></pre>
+However, this isn't really the best way to print out the contents of a <tt>BasicBlock</tt>!
+Since the ostream operators are overloaded for virtually anything
+you'll care about, you could have just invoked the print routine on the
+basic block itself: <tt>cerr << *blk << "\n";</tt>.
+ <p> Note that currently operator<< is implemented for <tt>Value*</tt>,
+so it will print out the contents of the pointer, instead of the
+pointer value you might expect. This is a deprecated interface that
+will be removed in the future, so it's best not to depend on it. To
+print out the pointer value for now, you must cast to <tt>void*</tt>.</p>
+ <p><!-- _______________________________________________________________________ --> </p>
+</ul>
+<h4>
+<hr size="1"><a name="iterate_institer">Iterating over the </a><a
+ href="#Instruction"><tt>Instruction</tt></a>s in a <a href="#Function"><tt>Function</tt></a></h4>
+<ul>
+If you're finding that you commonly iterate over a <tt>Function</tt>'s <tt>BasicBlock</tt>s
+and then that <tt>BasicBlock</tt>'s <tt>Instruction</tt>s, <tt>InstIterator</tt>
+should be used instead. You'll need to include <a
+ href="/doxygen/InstIterator_8h-source.html"><tt>llvm/Support/InstIterator.h</tt></a>,
+and then instantiate <tt>InstIterator</tt>s explicitly in your code.
+Here's a small example that shows how to dump all instructions in a
+function to stderr (<b>Note:</b> Dereferencing an <tt>InstIterator</tt>
+yields an <tt>Instruction*</tt>, <i>not</i> an <tt>Instruction&</tt>!):
+ <pre>#include "<a href="/doxygen/InstIterator_8h-source.html">llvm/Support/InstIterator.h</a>"<br>...<br>// Suppose F is a ptr to a function<br>for (inst_iterator i = inst_begin(F), e = inst_end(F); i != e; ++i)<br> cerr << **i << "\n";<br></pre>
Easy, isn't it? You can also use <tt>InstIterator</tt>s to fill a
worklist with its initial contents. For example, if you wanted to
-initialize a worklist to contain all instructions in a
-<tt>Function</tt> F, all you would need to do is something like:
-
-<pre>
-std::set<Instruction*> worklist;
-worklist.insert(inst_begin(F), inst_end(F));
-</pre>
-
-The STL set <tt>worklist</tt> would now contain all instructions in
-the <tt>Function</tt> pointed to by F.
-
-<!-- _______________________________________________________________________ -->
-</ul><h4><a name="iterate_convert"><hr size=0>Turning an iterator into a class
-pointer (and vice-versa) </h4><ul>
-
+initialize a worklist to contain all instructions in a <tt>Function</tt>
+F, all you would need to do is something like:
+ <pre>std::set<Instruction*> worklist;<br>worklist.insert(inst_begin(F), inst_end(F));<br></pre>
+The STL set <tt>worklist</tt> would now contain all instructions in the <tt>Function</tt>
+pointed to by F.<!-- _______________________________________________________________________ -->
+</ul>
+<h4>
+<hr size="1"><a name="iterate_convert">Turning an iterator into a class
+pointer (and vice-versa) </a></h4>
+<ul>
Sometimes, it'll be useful to grab a reference (or pointer) to a class
instance when all you've got at hand is an iterator. Well, extracting
a reference or a pointer from an iterator is very straightforward.
-Assuming that <tt>i</tt> is a <tt>BasicBlock::iterator</tt> and
-<tt>j</tt> is a <tt>BasicBlock::const_iterator</tt>:
-
-<pre>
- Instruction& inst = *i; // grab reference to instruction reference
- Instruction* pinst = &*i; // grab pointer to instruction reference
- const Instruction& inst = *j;
-</pre>
-However, the iterators you'll be working with in the LLVM framework
-are special: they will automatically convert to a ptr-to-instance type
+Assuming that <tt>i</tt> is a <tt>BasicBlock::iterator</tt> and <tt>j</tt>
+is a <tt>BasicBlock::const_iterator</tt>:
+ <pre> Instruction& inst = *i; // grab reference to instruction reference<br> Instruction* pinst = &*i; // grab pointer to instruction reference<br> const Instruction& inst = *j;<br></pre>
+However, the iterators you'll be working with in the LLVM framework are
+special: they will automatically convert to a ptr-to-instance type
whenever they need to. Instead of dereferencing the iterator and then
-taking the address of the result, you can simply assign the iterator
-to the proper pointer type and you get the dereference and address-of
+taking the address of the result, you can simply assign the iterator to
+the proper pointer type and you get the dereference and address-of
operation as a result of the assignment (behind the scenes, this is a
result of overloading casting mechanisms). Thus the last line of the
last example,
-
-<pre>Instruction* pinst = &*i;</pre>
-
+ <pre>Instruction* pinst = &*i;</pre>
is semantically equivalent to
-
-<pre>Instruction* pinst = i;</pre>
-
+ <pre>Instruction* pinst = i;</pre>
It's also possible to turn a class pointer into the corresponding
iterator. Usually, this conversion is quite inexpensive. The
following code snippet illustrates use of the conversion constructors
provided by LLVM iterators. By using these, you can explicitly grab
the iterator of something without actually obtaining it via iteration
over some structure:
-
-<pre>
-void printNextInstruction(Instruction* inst) {
- BasicBlock::iterator it(inst);
- ++it; // after this line, it refers to the instruction after *inst.
- if (it != inst->getParent()->end()) cerr << *it << "\n";
-}
-</pre>
+ <pre>void printNextInstruction(Instruction* inst) {<br> BasicBlock::iterator it(inst);<br> ++it; // after this line, it refers to the instruction after *inst.<br> if (it != inst->getParent()->end()) cerr << *it << "\n";<br>}<br></pre>
Of course, this example is strictly pedagogical, because it'd be much
-better to explicitly grab the next instruction directly from inst.
-
-
-<!--_______________________________________________________________________-->
-</ul><h4><a name="iterate_complex"><hr size=0>Finding call sites: a slightly
-more complex example </h4><ul>
-
+better to explicitly grab the next instruction directly from inst.<!--_______________________________________________________________________-->
+</ul>
+<h4>
+<hr size="1"><a name="iterate_complex">Finding call sites: a slightly
+more complex example </a></h4>
+<ul>
Say that you're writing a FunctionPass and would like to count all the
-locations in the entire module (that is, across every
-<tt>Function</tt>) where a certain function (i.e., some
-<tt>Function</tt>*) is already in scope. As you'll learn later, you may
-want to use an <tt>InstVisitor</tt> to accomplish this in a much more
-straightforward manner, but this example will allow us to explore how
-you'd do it if you didn't have <tt>InstVisitor</tt> around. In
-pseudocode, this is what we want to do:
-
-<pre>
-initialize callCounter to zero
-for each Function f in the Module
- for each BasicBlock b in f
- for each Instruction i in b
- if (i is a CallInst and calls the given function)
- increment callCounter
-</pre>
-
-And the actual code is (remember, since we're writing a
-<tt>FunctionPass</tt>, our <tt>FunctionPass</tt>-derived class simply
-has to override the <tt>runOnFunction</tt> method...):
-
-<pre>
-Function* targetFunc = ...;
-
-class OurFunctionPass : public FunctionPass {
- public:
- OurFunctionPass(): callCounter(0) { }
-
- virtual runOnFunction(Function& F) {
- for (Function::iterator b = F.begin(), be = F.end(); b != be; ++b) {
- for (BasicBlock::iterator i = b->begin(); ie = b->end(); i != ie; ++i) {
- if (<a href="#CallInst">CallInst</a>* callInst = <a href="#isa">dyn_cast</a><<a href="#CallInst">CallInst</a>>(&*i)) {
- // we know we've encountered a call instruction, so we
- // need to determine if it's a call to the
- // function pointed to by m_func or not.
-
- if (callInst->getCalledFunction() == targetFunc)
- ++callCounter;
- }
- }
- }
-
- private:
- unsigned callCounter;
-};
-</pre>
-
-
+locations in the entire module (that is, across every <tt>Function</tt>)
+where a certain function (i.e., some <tt>Function</tt>*) is already in
+scope. As you'll learn later, you may want to use an <tt>InstVisitor</tt>
+to accomplish this in a much more straightforward manner, but this
+example will allow us to explore how you'd do it if you didn't have <tt>InstVisitor</tt>
+around. In pseudocode, this is what we want to do:
+ <pre>initialize callCounter to zero<br>for each Function f in the Module<br> for each BasicBlock b in f<br> for each Instruction i in b<br> if (i is a CallInst and calls the given function)<br> increment callCounter<br></pre>
+And the actual code is (remember, since we're writing a <tt>FunctionPass</tt>,
+our <tt>FunctionPass</tt>-derived class simply has to override the <tt>runOnFunction</tt>
+method...):
+ <pre>Function* targetFunc = ...;<br><br>class OurFunctionPass : public FunctionPass {<br> public:<br> OurFunctionPass(): callCounter(0) { }<br><br> virtual runOnFunction(Function& F) {<br> for (Function::iterator b = F.begin(), be = F.end(); b != be; ++b) {<br> for (BasicBlock::iterator i = b->begin(); ie = b->end(); i != ie; ++i) {<br> if (<a
+ href="#CallInst">CallInst</a>* callInst = <a href="#isa">dyn_cast</a><<a
+ href="#CallInst">CallInst</a>>(&*i)) {<br> // we know we've encountered a call instruction, so we<br> // need to determine if it's a call to the<br> // function pointed to by m_func or not.<br> <br> if (callInst->getCalledFunction() == targetFunc)<br> ++callCounter;<br> }<br> }<br> }<br> <br> private:<br> unsigned callCounter;<br>};<br></pre>
<!--_______________________________________________________________________-->
-</ul><h4><a name="calls_and_invokes"><hr size=0>Treating calls and
-invokes the same way</h4><ul>
-
-<p>You may have noticed that the previous example was a bit
+</ul>
+<h4>
+<hr size="1"><a name="calls_and_invokes">Treating calls and invokes the
+same way</a></h4>
+<ul>
+ <p>You may have noticed that the previous example was a bit
oversimplified in that it did not deal with call sites generated by
'invoke' instructions. In this, and in other situations, you may find
-that you want to treat <tt>CallInst</tt>s and <tt>InvokeInst</tt>s the
-same way, even though their most-specific common base class is
-<tt>Instruction</tt>, which includes lots of less closely-related
-things. For these cases, LLVM provides a handy wrapper class called <a
-href="http://llvm.cs.uiuc.edu/doxygen/classCallSite.html"><tt>CallSite
-</tt></a>. It is essentially a wrapper around an <tt>Instruction</tt>
-pointer, with some methods that provide functionality common to
-<tt>CallInst</tt>s and <tt>InvokeInst</tt>s.</p>
-
-<p>This class is supposed to have "value semantics". So it should be
+that you want to treat <tt>CallInst</tt>s and <tt>InvokeInst</tt>s
+the same way, even though their most-specific common base class is <tt>Instruction</tt>,
+which includes lots of less closely-related things. For these cases,
+LLVM provides a handy wrapper class called <a
+ href="http://llvm.cs.uiuc.edu/doxygen/classCallSite.html"><tt>CallSite </tt></a>.
+It is essentially a wrapper around an <tt>Instruction</tt> pointer,
+with some methods that provide functionality common to <tt>CallInst</tt>s
+and <tt>InvokeInst</tt>s.</p>
+ <p>This class is supposed to have "value semantics". So it should be
passed by value, not by reference; it should not be dynamically
allocated or deallocated using <tt>operator new</tt> or <tt>operator
delete</tt>. It is efficiently copyable, assignable and constructable,
with costs equivalents to that of a bare pointer. (You will notice, if
you look at its definition, that it has only a single data member.)</p>
-
-
<!--_______________________________________________________________________-->
-</ul><h4><a name="iterate_chains"><hr size=0>Iterating over def-use &
-use-def chains</h4><ul>
-
+</ul>
+<h4>
+<hr size="1"><a name="iterate_chains">Iterating over def-use &
+use-def chains</a></h4>
+<ul>
Frequently, we might have an instance of the <a
-href="/doxygen/classValue.html">Value Class</a> and we want to
+ href="/doxygen/classValue.html">Value Class</a> and we want to
determine which <tt>User</tt>s use the <tt>Value</tt>. The list of
-all <tt>User</tt>s of a particular <tt>Value</tt> is called a
-<i>def-use</i> chain. For example, let's say we have a
-<tt>Function*</tt> named <tt>F</tt> to a particular function
-<tt>foo</tt>. Finding all of the instructions that <i>use</i>
-<tt>foo</tt> is as simple as iterating over the <i>def-use</i> chain of
-<tt>F</tt>:
-
-<pre>
-Function* F = ...;
-
-for (Value::use_iterator i = F->use_begin(), e = F->use_end(); i != e; ++i) {
- if (Instruction *Inst = dyn_cast<Instruction>(*i)) {
- cerr << "F is used in instruction:\n";
- cerr << *Inst << "\n";
- }
-}
-</pre>
-
+all <tt>User</tt>s of a particular <tt>Value</tt> is called a <i>def-use</i>
+chain. For example, let's say we have a <tt>Function*</tt> named <tt>F</tt>
+to a particular function <tt>foo</tt>. Finding all of the instructions
+that <i>use</i> <tt>foo</tt> is as simple as iterating over the <i>def-use</i>
+chain of <tt>F</tt>:
+ <pre>Function* F = ...;<br><br>for (Value::use_iterator i = F->use_begin(), e = F->use_end(); i != e; ++i) {<br> if (Instruction *Inst = dyn_cast<Instruction>(*i)) {<br> cerr << "F is used in instruction:\n";<br> cerr << *Inst << "\n";<br> }<br>}<br></pre>
Alternately, it's common to have an instance of the <a
-href="/doxygen/classUser.html">User Class</a> and need to know what
-<tt>Value</tt>s are used by it. The list of all <tt>Value</tt>s used
-by a <tt>User</tt> is known as a <i>use-def</i> chain. Instances of
-class <tt>Instruction</tt> are common <tt>User</tt>s, so we might want
-to iterate over all of the values that a particular instruction uses
-(that is, the operands of the particular <tt>Instruction</tt>):
-
-<pre>
-Instruction* pi = ...;
-
-for (User::op_iterator i = pi->op_begin(), e = pi->op_end(); i != e; ++i) {
- Value* v = *i;
- ...
-}
-</pre>
-
-
+ href="/doxygen/classUser.html">User Class</a> and need to know what <tt>Value</tt>s
+are used by it. The list of all <tt>Value</tt>s used by a <tt>User</tt>
+is known as a <i>use-def</i> chain. Instances of class <tt>Instruction</tt>
+are common <tt>User</tt>s, so we might want to iterate over all of the
+values that a particular instruction uses (that is, the operands of the
+particular <tt>Instruction</tt>):
+ <pre>Instruction* pi = ...;<br><br>for (User::op_iterator i = pi->op_begin(), e = pi->op_end(); i != e; ++i) {<br> Value* v = *i;<br> ...<br>}<br></pre>
<!--
def-use chains ("finding all users of"): Value::use_begin/use_end
use-def chains ("finding all values used"): User::op_begin/op_end [op=operand]
--->
-
-<!-- ======================================================================= -->
-</ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
-<tr><td> </td><td width="100%">
-<font color="#EEEEFF" face="Georgia,Palatino"><b>
-<a name="simplechanges">Making simple changes</a>
-</b></font></td></tr></table><ul>
-
+--><!-- ======================================================================= -->
+</ul>
+<table width="100%" bgcolor="#441188" border="0" cellpadding="4"
+ cellspacing="0">
+ <tbody>
+ <tr>
+ <td> </td>
+ <td width="100%"> <font color="#eeeeff"
+ face="Georgia,Palatino"><b> <a name="simplechanges">Making simple
+changes</a> </b></font></td>
+ </tr>
+ </tbody>
+</table>
+<ul>
There are some primitive transformation operations present in the LLVM
infrastructure that are worth knowing about. When performing
-transformations, it's fairly common to manipulate the contents of
-basic blocks. This section describes some of the common methods for
-doing so and gives example code.
-
-<!--_______________________________________________________________________-->
-</ul><h4><a name="schanges_creating"><hr size=0>Creating and inserting
- new <tt>Instruction</tt>s</h4><ul>
-
-<i>Instantiating Instructions</i>
-
-<p>Creation of <tt>Instruction</tt>s is straightforward: simply call the
-constructor for the kind of instruction to instantiate and provide the
-necessary parameters. For example, an <tt>AllocaInst</tt> only
-<i>requires</i> a (const-ptr-to) <tt>Type</tt>. Thus:
-
-<pre>AllocaInst* ai = new AllocaInst(Type::IntTy);</pre>
-
+transformations, it's fairly common to manipulate the contents of basic
+blocks. This section describes some of the common methods for doing so
+and gives example code.<!--_______________________________________________________________________-->
+</ul>
+<h4>
+<hr size="1"><a name="schanges_creating">Creating and inserting new <tt>Instruction</tt>s</a></h4>
+<ul>
+ <i>Instantiating Instructions</i>
+ <p>Creation of <tt>Instruction</tt>s is straightforward: simply call
+the constructor for the kind of instruction to instantiate and provide
+the necessary parameters. For example, an <tt>AllocaInst</tt> only <i>requires</i>
+a (const-ptr-to) <tt>Type</tt>. Thus: </p>
+ <pre>AllocaInst* ai = new AllocaInst(Type::IntTy);</pre>
will create an <tt>AllocaInst</tt> instance that represents the
-allocation of one integer in the current stack frame, at runtime.
-Each <tt>Instruction</tt> subclass is likely to have varying default
-parameters which change the semantics of the instruction, so refer to
-the <a href="/doxygen/classInstruction.html">doxygen documentation for
-the subclass of Instruction</a> that you're interested in
-instantiating.</p>
-
-<p><i>Naming values</i></p>
-
-<p>
-It is very useful to name the values of instructions when you're able
-to, as this facilitates the debugging of your transformations. If you
-end up looking at generated LLVM machine code, you definitely want to
-have logical names associated with the results of instructions! By
-supplying a value for the <tt>Name</tt> (default) parameter of the
-<tt>Instruction</tt> constructor, you associate a logical name with
-the result of the instruction's execution at runtime. For example,
-say that I'm writing a transformation that dynamically allocates space
-for an integer on the stack, and that integer is going to be used as
-some kind of index by some other code. To accomplish this, I place an
-<tt>AllocaInst</tt> at the first point in the first
-<tt>BasicBlock</tt> of some <tt>Function</tt>, and I'm intending to
-use it within the same <tt>Function</tt>. I might do:
-
-<pre>AllocaInst* pa = new AllocaInst(Type::IntTy, 0, "indexLoc");</pre>
-
+allocation of one integer in the current stack frame, at runtime. Each <tt>Instruction</tt>
+subclass is likely to have varying default parameters which change the
+semantics of the instruction, so refer to the <a
+ href="/doxygen/classInstruction.html">doxygen documentation for the
+subclass of Instruction</a> that you're interested in instantiating.
+ <p><i>Naming values</i></p>
+ <p> It is very useful to name the values of instructions when you're
+able to, as this facilitates the debugging of your transformations. If
+you end up looking at generated LLVM machine code, you definitely want
+to have logical names associated with the results of instructions! By
+supplying a value for the <tt>Name</tt> (default) parameter of the <tt>Instruction</tt>
+constructor, you associate a logical name with the result of the
+instruction's execution at runtime. For example, say that I'm writing a
+transformation that dynamically allocates space for an integer on the
+stack, and that integer is going to be used as some kind of index by
+some other code. To accomplish this, I place an <tt>AllocaInst</tt> at
+the first point in the first <tt>BasicBlock</tt> of some <tt>Function</tt>,
+and I'm intending to use it within the same <tt>Function</tt>. I
+might do: </p>
+ <pre>AllocaInst* pa = new AllocaInst(Type::IntTy, 0, "indexLoc");</pre>
where <tt>indexLoc</tt> is now the logical name of the instruction's
-execution value, which is a pointer to an integer on the runtime
-stack.
-</p>
-
-<p><i>Inserting instructions</i></p>
-
-<p>
-There are essentially two ways to insert an <tt>Instruction</tt> into
-an existing sequence of instructions that form a <tt>BasicBlock</tt>:
-<ul>
-<li>Insertion into an explicit instruction list
-
-<p>Given a <tt>BasicBlock* pb</tt>, an <tt>Instruction* pi</tt> within
-that <tt>BasicBlock</tt>, and a newly-created instruction
-we wish to insert before <tt>*pi</tt>, we do the following:
-
-<pre>
- BasicBlock *pb = ...;
- Instruction *pi = ...;
- Instruction *newInst = new Instruction(...);
- pb->getInstList().insert(pi, newInst); // inserts newInst before pi in pb
-</pre>
-</p>
-
-<li>Insertion into an implicit instruction list
-<p><tt>Instruction</tt> instances that are already in
-<tt>BasicBlock</tt>s are implicitly associated with an existing
-instruction list: the instruction list of the enclosing basic block.
-Thus, we could have accomplished the same thing as the above code
-without being given a <tt>BasicBlock</tt> by doing:
-<pre>
- Instruction *pi = ...;
- Instruction *newInst = new Instruction(...);
- pi->getParent()->getInstList().insert(pi, newInst);
-</pre>
-In fact, this sequence of steps occurs so frequently that the
-<tt>Instruction</tt> class and <tt>Instruction</tt>-derived classes
-provide constructors which take (as a default parameter) a pointer to
-an <tt>Instruction</tt> which the newly-created <tt>Instruction</tt>
-should precede. That is, <tt>Instruction</tt> constructors are
-capable of inserting the newly-created instance into the
-<tt>BasicBlock</tt> of a provided instruction, immediately before that
-instruction. Using an <tt>Instruction</tt> constructor with a
-<tt>insertBefore</tt> (default) parameter, the above code becomes:
-<pre>
-Instruction* pi = ...;
-Instruction* newInst = new Instruction(..., pi);
-</pre>
+execution value, which is a pointer to an integer on the runtime stack.
+ <p><i>Inserting instructions</i></p>
+ <p> There are essentially two ways to insert an <tt>Instruction</tt>
+into an existing sequence of instructions that form a <tt>BasicBlock</tt>:</p>
+ <ul>
+ <li>Insertion into an explicit instruction list
+ <p>Given a <tt>BasicBlock* pb</tt>, an <tt>Instruction* pi</tt>
+within that <tt>BasicBlock</tt>, and a newly-created instruction we
+wish to insert before <tt>*pi</tt>, we do the following: </p>
+ <pre> BasicBlock *pb = ...;<br> Instruction *pi = ...;<br> Instruction *newInst = new Instruction(...);<br> pb->getInstList().insert(pi, newInst); // inserts newInst before pi in pb<br></pre>
+ </li>
+ <li>Insertion into an implicit instruction list
+ <p><tt>Instruction</tt> instances that are already in <tt>BasicBlock</tt>s
+are implicitly associated with an existing instruction list: the
+instruction list of the enclosing basic block. Thus, we could have
+accomplished the same thing as the above code without being given a <tt>BasicBlock</tt>
+by doing: </p>
+ <pre> Instruction *pi = ...;<br> Instruction *newInst = new Instruction(...);<br> pi->getParent()->getInstList().insert(pi, newInst);<br></pre>
+In fact, this sequence of steps occurs so frequently that the <tt>Instruction</tt>
+class and <tt>Instruction</tt>-derived classes provide constructors
+which take (as a default parameter) a pointer to an <tt>Instruction</tt>
+which the newly-created <tt>Instruction</tt> should precede. That is, <tt>Instruction</tt>
+constructors are capable of inserting the newly-created instance into
+the <tt>BasicBlock</tt> of a provided instruction, immediately before
+that instruction. Using an <tt>Instruction</tt> constructor with a <tt>insertBefore</tt>
+(default) parameter, the above code becomes:
+ <pre>Instruction* pi = ...;<br>Instruction* newInst = new Instruction(..., pi);<br></pre>
which is much cleaner, especially if you're creating a lot of
-instructions and adding them to <tt>BasicBlock</tt>s.
- </p>
-</p>
-</ul>
-
-<!--_______________________________________________________________________-->
-</ul><h4><a name="schanges_deleting"><hr size=0>Deleting
-<tt>Instruction</tt>s</h4><ul>
-
-Deleting an instruction from an existing sequence of instructions that form a <a
-href="#BasicBlock"><tt>BasicBlock</tt></a> is very straightforward. First, you
-must have a pointer to the instruction that you wish to delete. Second, you
-need to obtain the pointer to that instruction's basic block. You use the
-pointer to the basic block to get its list of instructions and then use the
-erase function to remove your instruction.<p>
-
-For example:<p>
-
-<pre>
- <a href="#Instruction">Instruction</a> *I = .. ;
- <a href="#BasicBlock">BasicBlock</a> *BB = I->getParent();
- BB->getInstList().erase(I);
-</pre><p>
-
+instructions and adding them to <tt>BasicBlock</tt>s. </li>
+ </ul>
<!--_______________________________________________________________________-->
-</ul><h4><a name="schanges_replacing"><hr size=0>Replacing an
- <tt>Instruction</tt> with another <tt>Value</tt></h4><ul>
-
-<p><i>Replacing individual instructions</i></p>
-<p>
-Including "<a
-href="/doxygen/BasicBlockUtils_8h-source.html">llvm/Transforms/Utils/BasicBlockUtils.h</a>" permits use of two very useful replace functions:
-<tt>ReplaceInstWithValue</tt> and <tt>ReplaceInstWithInst</tt>.
-
-<ul>
-
-<li><tt>ReplaceInstWithValue</tt>
-
-<p>This function replaces all uses (within a basic block) of a given
-instruction with a value, and then removes the original instruction.
-The following example illustrates the replacement of the result of a
-particular <tt>AllocaInst</tt> that allocates memory for a single
-integer with an null pointer to an integer.</p>
-
-<pre>
-AllocaInst* instToReplace = ...;
-BasicBlock::iterator ii(instToReplace);
-ReplaceInstWithValue(instToReplace->getParent()->getInstList(), ii,
- Constant::getNullValue(PointerType::get(Type::IntTy)));
-</pre>
-
-<li><tt>ReplaceInstWithInst</tt>
-
-<p>This function replaces a particular instruction with another
-instruction. The following example illustrates the replacement of one
-<tt>AllocaInst</tt> with another.<p>
-
-<pre>
-AllocaInst* instToReplace = ...;
-BasicBlock::iterator ii(instToReplace);
-ReplaceInstWithInst(instToReplace->getParent()->getInstList(), ii,
- new AllocaInst(Type::IntTy, 0, "ptrToReplacedInt"));
-</pre>
-
-</ul>
-<p><i>Replacing multiple uses of <tt>User</tt>s and
- <tt>Value</tt>s</i></p>
-
-You can use <tt>Value::replaceAllUsesWith</tt> and
-<tt>User::replaceUsesOfWith</tt> to change more than one use at a
-time. See the doxygen documentation for the <a
-href="/doxygen/classValue.html">Value Class</a> and <a
-href="/doxygen/classUser.html">User Class</a>, respectively, for more
-information.
-
-<!-- Value::replaceAllUsesWith User::replaceUsesOfWith Point out:
+</ul>
+<h4>
+<hr size="1"><a name="schanges_deleting">Deleting <tt>Instruction</tt>s</a></h4>
+<ul>
+Deleting an instruction from an existing sequence of instructions that
+form a <a href="#BasicBlock"><tt>BasicBlock</tt></a> is very
+straightforward. First, you must have a pointer to the instruction that
+you wish to delete. Second, you need to obtain the pointer to that
+instruction's basic block. You use the pointer to the basic block to
+get its list of instructions and then use the erase function to remove
+your instruction.
+ <p> For example:</p>
+ <p> </p>
+ <pre> <a href="#Instruction">Instruction</a> *I = .. ;<br> <a
+ href="#BasicBlock">BasicBlock</a> *BB = I->getParent();<br> BB->getInstList().erase(I);<br></pre>
+ <p><!--_______________________________________________________________________--> </p>
+</ul>
+<h4>
+<hr size="1"><a name="schanges_replacing">Replacing an <tt>Instruction</tt>
+with another <tt>Value</tt></a></h4>
+<ul>
+ <p><i>Replacing individual instructions</i></p>
+ <p> Including "<a href="/doxygen/BasicBlockUtils_8h-source.html">llvm/Transforms/Utils/BasicBlockUtils.h</a>"
+permits use of two very useful replace functions: <tt>ReplaceInstWithValue</tt>
+and <tt>ReplaceInstWithInst</tt>. </p>
+</ul>
+<h4><a name="schanges_deleting">Deleting <tt>Instruction</tt>s</a></h4>
+<ul>
+ <ul>
+ <li><tt>ReplaceInstWithValue</tt>
+ <p>This function replaces all uses (within a basic block) of a
+given instruction with a value, and then removes the original
+instruction. The following example illustrates the replacement of the
+result of a particular <tt>AllocaInst</tt> that allocates memory for a
+single integer with an null pointer to an integer.</p>
+ <pre>AllocaInst* instToReplace = ...;<br>BasicBlock::iterator ii(instToReplace);<br>ReplaceInstWithValue(instToReplace->getParent()->getInstList(), ii,<br> Constant::getNullValue(PointerType::get(Type::IntTy)));<br></pre>
+ </li>
+ <li><tt>ReplaceInstWithInst</tt>
+ <p>This function replaces a particular instruction with another
+instruction. The following example illustrates the replacement of one <tt>AllocaInst</tt>
+with another.</p>
+ <p> </p>
+ <pre>AllocaInst* instToReplace = ...;<br>BasicBlock::iterator ii(instToReplace);<br>ReplaceInstWithInst(instToReplace->getParent()->getInstList(), ii,<br> new AllocaInst(Type::IntTy, 0, "ptrToReplacedInt"));<br></pre>
+ </li>
+ </ul>
+ <p><i>Replacing multiple uses of <tt>User</tt>s and <tt>Value</tt>s</i></p>
+You can use <tt>Value::replaceAllUsesWith</tt> and <tt>User::replaceUsesOfWith</tt>
+to change more than one use at a time. See the doxygen documentation
+for the <a href="/doxygen/classValue.html">Value Class</a> and <a
+ href="/doxygen/classUser.html">User Class</a>, respectively, for more
+information.<!-- Value::replaceAllUsesWith User::replaceUsesOfWith Point out:
include/llvm/Transforms/Utils/ especially BasicBlockUtils.h with:
ReplaceInstWithValue, ReplaceInstWithInst
--->
-
-<!-- *********************************************************************** -->
-</ul><table width="100%" bgcolor="#330077" border=0 cellpadding=4 cellspacing=0>
-<tr><td align=center><font color="#EEEEFF" size=+2 face="Georgia,Palatino"><b>
-<a name="coreclasses">The Core LLVM Class Hierarchy Reference
-</b></font></td></tr></table><ul>
+--><!-- *********************************************************************** -->
+</ul>
+<table width="100%" bgcolor="#330077" border="0" cellpadding="4"
+ cellspacing="0">
+ <tbody>
+ <tr>
+ <td align="center"><font color="#eeeeff" size="+2"
+ face="Georgia,Palatino"><b> <a name="coreclasses">The Core LLVM Class
+Hierarchy Reference </a></b></font></td>
+ </tr>
+ </tbody>
+</table>
+<ul>
<!-- *********************************************************************** -->
-
-The Core LLVM classes are the primary means of representing the program being
-inspected or transformed. The core LLVM classes are defined in header files in
-the <tt>include/llvm/</tt> directory, and implemented in the <tt>lib/VMCore</tt>
-directory.<p>
-
-
-<!-- ======================================================================= -->
-</ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
-<tr><td> </td><td width="100%">
-<font color="#EEEEFF" face="Georgia,Palatino"><b>
-<a name="Value">The <tt>Value</tt> class</a>
-</b></font></td></tr></table><ul>
-
-<tt>#include "<a href="/doxygen/Value_8h-source.html">llvm/Value.h</a>"</tt></b><br>
-doxygen info: <a href="/doxygen/classValue.html">Value Class</a><p>
-
-
-The <tt>Value</tt> class is the most important class in LLVM Source base. It
-represents a typed value that may be used (among other things) as an operand to
-an instruction. There are many different types of <tt>Value</tt>s, such as <a
-href="#Constant"><tt>Constant</tt></a>s, <a
-href="#Argument"><tt>Argument</tt></a>s, and even <a
-href="#Instruction"><tt>Instruction</tt></a>s and <a
-href="#Function"><tt>Function</tt></a>s are <tt>Value</tt>s.<p>
-
-A particular <tt>Value</tt> may be used many times in the LLVM representation
-for a program. For example, an incoming argument to a function (represented
-with an instance of the <a href="#Argument">Argument</a> class) is "used" by
-every instruction in the function that references the argument. To keep track
-of this relationship, the <tt>Value</tt> class keeps a list of all of the <a
-href="#User"><tt>User</tt></a>s that is using it (the <a
-href="#User"><tt>User</tt></a> class is a base class for all nodes in the LLVM
-graph that can refer to <tt>Value</tt>s). This use list is how LLVM represents
-def-use information in the program, and is accessible through the <tt>use_</tt>*
-methods, shown below.<p>
-
-Because LLVM is a typed representation, every LLVM <tt>Value</tt> is typed, and
-this <a href="#Type">Type</a> is available through the <tt>getType()</tt>
-method. <a name="#nameWarning">In addition, all LLVM values can be named. The
-"name" of the <tt>Value</tt> is symbolic string printed in the LLVM code:<p>
-
-<pre>
- %<b>foo</b> = add int 1, 2
-</pre>
-
-The name of this instruction is "foo". <b>NOTE</b> that the name of any value
-may be missing (an empty string), so names should <b>ONLY</b> be used for
-debugging (making the source code easier to read, debugging printouts), they
-should not be used to keep track of values or map between them. For this
-purpose, use a <tt>std::map</tt> of pointers to the <tt>Value</tt> itself
-instead.<p>
-
-One important aspect of LLVM is that there is no distinction between an SSA
-variable and the operation that produces it. Because of this, any reference to
-the value produced by an instruction (or the value available as an incoming
-argument, for example) is represented as a direct pointer to the class that
-represents this value. Although this may take some getting used to, it
-simplifies the representation and makes it easier to manipulate.<p>
-
-
-<!-- _______________________________________________________________________ -->
-</ul><h4><a name="m_Value"><hr size=0>Important Public Members of
-the <tt>Value</tt> class</h4><ul>
-
-<li><tt>Value::use_iterator</tt> - Typedef for iterator over the use-list<br>
- <tt>Value::use_const_iterator</tt>
- - Typedef for const_iterator over the use-list<br>
- <tt>unsigned use_size()</tt> - Returns the number of users of the value.<br>
+The Core LLVM classes are the primary means of representing the program
+being inspected or transformed. The core LLVM classes are defined in
+header files in the <tt>include/llvm/</tt> directory, and implemented in
+the <tt>lib/VMCore</tt> directory.
+ <p><!-- ======================================================================= --> </p>
+</ul>
+<table width="100%" bgcolor="#441188" border="0" cellpadding="4"
+ cellspacing="0">
+ <tbody>
+ <tr>
+ <td> </td>
+ <td width="100%"> <font color="#eeeeff"
+ face="Georgia,Palatino"><b> <a name="Value">The <tt>Value</tt> class</a> </b></font></td>
+ </tr>
+ </tbody>
+</table>
+<ul>
+ <tt>#include "<a href="/doxygen/Value_8h-source.html">llvm/Value.h</a>"</tt><br>
+doxygen info: <a href="/doxygen/classValue.html">Value Class</a>
+ <p> The <tt>Value</tt> class is the most important class in the LLVM
+Source base. It represents a typed value that may be used (among other
+things) as an operand to an instruction. There are many different types
+of <tt>Value</tt>s, such as <a href="#Constant"><tt>Constant</tt></a>s,<a
+ href="#Argument"><tt>Argument</tt></a>s. Even <a href="#Instruction"><tt>Instruction</tt></a>s
+and <a href="#Function"><tt>Function</tt></a>s are <tt>Value</tt>s.</p>
+ <p> A particular <tt>Value</tt> may be used many times in the LLVM
+representation for a program. For example, an incoming argument to a
+function (represented with an instance of the <a href="#Argument">Argument</a>
+class) is "used" by every instruction in the function that references
+the argument. To keep track of this relationship, the <tt>Value</tt>
+class keeps a list of all of the <a href="#User"><tt>User</tt></a>s
+that is using it (the <a href="#User"><tt>User</tt></a> class is a base
+class for all nodes in the LLVM graph that can refer to <tt>Value</tt>s).
+This use list is how LLVM represents def-use information in the
+program, and is accessible through the <tt>use_</tt>* methods, shown
+below.</p>
+ <p> Because LLVM is a typed representation, every LLVM <tt>Value</tt>
+is typed, and this <a href="#Type">Type</a> is available through the <tt>getType()</tt>
+method. In addition, all LLVM values can be named. The "name" of the <tt>Value</tt>
+is a symbolic string printed in the LLVM code:</p>
+ <p> </p>
+ <pre> %<b>foo</b> = add int 1, 2<br></pre>
+ <a name="#nameWarning">The name of this instruction is "foo". <b>NOTE</b>
+that the name of any value may be missing (an empty string), so names
+should <b>ONLY</b> be used for debugging (making the source code easier
+to read, debugging printouts), they should not be used to keep track of
+values or map between them. For this purpose, use a <tt>std::map</tt>
+of pointers to the <tt>Value</tt> itself instead.</a>
+ <p> One important aspect of LLVM is that there is no distinction
+between an SSA variable and the operation that produces it. Because of
+this, any reference to the value produced by an instruction (or the
+value available as an incoming argument, for example) is represented as
+a direct pointer to the class that represents this value. Although
+this may take some getting used to, it simplifies the representation
+and makes it easier to manipulate.</p>
+ <p><!-- _______________________________________________________________________ --> </p>
+</ul>
+<h4>
+<hr size="1"><a name="m_Value">Important Public Members of the <tt>Value</tt>
+class</a></h4>
+<ul>
+ <li><tt>Value::use_iterator</tt> - Typedef for iterator over the
+use-list<br>
+ <tt>Value::use_const_iterator</tt> - Typedef for const_iterator over
+the use-list<br>
+ <tt>unsigned use_size()</tt> - Returns the number of users of the
+value.<br>
<tt>bool use_empty()</tt> - Returns true if there are no users.<br>
- <tt>use_iterator use_begin()</tt>
- - Get an iterator to the start of the use-list.<br>
- <tt>use_iterator use_end()</tt>
- - Get an iterator to the end of the use-list.<br>
- <tt><a href="#User">User</a> *use_back()</tt>
- - Returns the last element in the list.<p>
-
-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>
-
-<li><tt><a href="#Type">Type</a> *getType() const</tt><p>
-This method returns the Type of the Value.
-
-<li><tt>bool hasName() const</tt><br>
+ <tt>use_iterator use_begin()</tt> - Get an iterator to the start of
+the use-list.<br>
+ <tt>use_iterator use_end()</tt> - Get an iterator to the end of the
+use-list.<br>
+ <tt><a href="#User">User</a> *use_back()</tt> - Returns the last
+element in the list.
+ <p> 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>
+ <p> </p>
+ </li>
+ <li><tt><a href="#Type">Type</a> *getType() const</tt>
+ <p> This method returns the Type of the Value. </p>
+ </li>
+ <li><tt>bool hasName() const</tt><br>
<tt>std::string getName() const</tt><br>
- <tt>void setName(const std::string &Name)</tt><p>
-
-This family of methods is used to access and assign a name to a <tt>Value</tt>,
-be aware of the <a href="#nameWarning">precaution above</a>.<p>
-
-
-<li><tt>void replaceAllUsesWith(Value *V)</tt><p>
-
-This method traverses the use list of a <tt>Value</tt> changing all <a
-href="#User"><tt>User</tt>s</a> of the current value to refer to "<tt>V</tt>"
-instead. For example, if you detect that an instruction always produces a
-constant value (for example through constant folding), you can replace all uses
-of the instruction with the constant like this:<p>
-
-<pre>
- Inst->replaceAllUsesWith(ConstVal);
-</pre><p>
-
-
-
-<!-- ======================================================================= -->
-</ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
-<tr><td> </td><td width="100%">
-<font color="#EEEEFF" face="Georgia,Palatino"><b>
-<a name="User">The <tt>User</tt> class</a>
-</b></font></td></tr></table><ul>
-
-<tt>#include "<a href="/doxygen/User_8h-source.html">llvm/User.h</a>"</tt></b><br>
+ <tt>void setName(const std::string &Name)</tt>
+ <p> This family of methods is used to access and assign a name to a <tt>Value</tt>,
+be aware of the <a href="#nameWarning">precaution above</a>.</p>
+ <p> </p>
+ </li>
+ <li><tt>void replaceAllUsesWith(Value *V)</tt>
+ <p> This method traverses the use list of a <tt>Value</tt> changing
+all <a href="#User"><tt>User</tt>s</a> of the current value to refer to "<tt>V</tt>"
+instead. For example, if you detect that an instruction always
+produces a constant value (for example through constant folding), you
+can replace all uses of the instruction with the constant like this:</p>
+ <p> </p>
+ <pre> Inst->replaceAllUsesWith(ConstVal);<br></pre>
+ <p><!-- ======================================================================= --> </p>
+ </li>
+</ul>
+<table width="100%" bgcolor="#441188" border="0" cellpadding="4"
+ cellspacing="0">
+ <tbody>
+ <tr>
+ <td> </td>
+ <td width="100%"> <font color="#eeeeff"
+ face="Georgia,Palatino"><b> <a name="User">The <tt>User</tt> class</a> </b></font></td>
+ </tr>
+ </tbody>
+</table>
+<ul>
+ <tt>#include "<a href="/doxygen/User_8h-source.html">llvm/User.h</a>"</tt><br>
doxygen info: <a href="/doxygen/classUser.html">User Class</a><br>
-Superclass: <a href="#Value"><tt>Value</tt></a><p>
-
-
-The <tt>User</tt> class is the common base class of all LLVM nodes that may
-refer to <a href="#Value"><tt>Value</tt></a>s. It exposes a list of "Operands"
-that are all of the <a href="#Value"><tt>Value</tt></a>s that the User is
-referring to. The <tt>User</tt> class itself is a subclass of
-<tt>Value</tt>.<p>
-
-The operands of a <tt>User</tt> point directly to the LLVM <a
-href="#Value"><tt>Value</tt></a> that it refers to. Because LLVM uses Static
-Single Assignment (SSA) form, there can only be one definition referred to,
-allowing this direct connection. This connection provides the use-def
-information in LLVM.<p>
-
-<!-- _______________________________________________________________________ -->
-</ul><h4><a name="m_User"><hr size=0>Important Public Members of
-the <tt>User</tt> class</h4><ul>
-
-The <tt>User</tt> class exposes the operand list in two ways: through an index
-access interface and through an iterator based interface.<p>
-
-<li><tt>Value *getOperand(unsigned i)</tt><br>
- <tt>unsigned getNumOperands()</tt><p>
-
-These two methods expose the operands of the <tt>User</tt> in a convenient form
-for direct access.<p>
-
-<li><tt>User::op_iterator</tt> - Typedef for iterator over the operand list<br>
- <tt>User::op_const_iterator</tt>
- <tt>use_iterator op_begin()</tt>
- - Get an iterator to the start of the operand list.<br>
- <tt>use_iterator op_end()</tt>
- - Get an iterator to the end of the operand list.<p>
-
-Together, these methods make up the iterator based interface to the operands of
-a <tt>User</tt>.<p>
-
-
-
-<!-- ======================================================================= -->
-</ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
-<tr><td> </td><td width="100%">
-<font color="#EEEEFF" face="Georgia,Palatino"><b>
-<a name="Instruction">The <tt>Instruction</tt> class</a>
-</b></font></td></tr></table><ul>
-
-<tt>#include "<a
-href="/doxygen/Instruction_8h-source.html">llvm/Instruction.h</a>"</tt></b><br>
-doxygen info: <a href="/doxygen/classInstruction.html">Instruction Class</a><br>
-Superclasses: <a href="#User"><tt>User</tt></a>, <a
-href="#Value"><tt>Value</tt></a><p>
-
-The <tt>Instruction</tt> class is the common base class for all LLVM
-instructions. It provides only a few methods, but is a very commonly used
-class. The primary data tracked by the <tt>Instruction</tt> class itself is the
-opcode (instruction type) and the parent <a
-href="#BasicBlock"><tt>BasicBlock</tt></a> the <tt>Instruction</tt> is embedded
-into. To represent a specific type of instruction, one of many subclasses of
-<tt>Instruction</tt> are used.<p>
-
-Because the <tt>Instruction</tt> class subclasses the <a
-href="#User"><tt>User</tt></a> class, its operands can be accessed in the same
-way as for other <a href="#User"><tt>User</tt></a>s (with the
-<tt>getOperand()</tt>/<tt>getNumOperands()</tt> and
-<tt>op_begin()</tt>/<tt>op_end()</tt> methods).<p>
-
-An important file for the <tt>Instruction</tt> class is the
-<tt>llvm/Instruction.def</tt> file. This file contains some meta-data about the
-various different types of instructions in LLVM. It describes the enum values
-that are used as opcodes (for example <tt>Instruction::Add</tt> and
-<tt>Instruction::SetLE</tt>), as well as the concrete sub-classes of
-<tt>Instruction</tt> that implement the instruction (for example <tt><a
-href="#BinaryOperator">BinaryOperator</a></tt> and <tt><a
-href="#SetCondInst">SetCondInst</a></tt>). Unfortunately, the use of macros in
-this file confused doxygen, so these enum values don't show up correctly in the
-<a href="/doxygen/classInstruction.html">doxygen output</a>.<p>
-
-
-<!-- _______________________________________________________________________ -->
-</ul><h4><a name="m_Instruction"><hr size=0>Important Public Members of
-the <tt>Instruction</tt> class</h4><ul>
-
-<li><tt><a href="#BasicBlock">BasicBlock</a> *getParent()</tt><p>
-
-Returns the <a href="#BasicBlock"><tt>BasicBlock</tt></a> that this
-<tt>Instruction</tt> is embedded into.<p>
-
-<li><tt>bool mayWriteToMemory()</tt><p>
-
-Returns true if the instruction writes to memory, i.e. it is a <tt>call</tt>,
-<tt>free</tt>, <tt>invoke</tt>, or <tt>store</tt>.<p>
-
-<li><tt>unsigned getOpcode()</tt><p>
-
-Returns the opcode for the <tt>Instruction</tt>.<p>
-
-<li><tt><a href="#Instruction">Instruction</a> *clone() const</tt><p>
-
-Returns another instance of the specified instruction, identical in all ways to
-the original except that the instruction has no parent (ie it's not embedded
-into a <a href="#BasicBlock"><tt>BasicBlock</tt></a>), and it has no name.<p>
-
-
-
-<!--
-
-\subsection{Subclasses of Instruction :}
-\begin{itemize}
-<li>BinaryOperator : This subclass of Instruction defines a general interface to the all the instructions involvong binary operators in LLVM.
- \begin{itemize}
- <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.
- \end{itemize}
-<li>TerminatorInst : This subclass of Instructions defines an interface for all instructions that can terminate a BasicBlock.
- \begin{itemize}
- <li> <tt>unsigned getNumSuccessors()</tt>: Returns the number of successors for this terminator instruction.
- <li><tt>BasicBlock *getSuccessor(unsigned i)</tt>: As the name suggests returns the ith successor BasicBlock.
- <li><tt>void setSuccessor(unsigned i, BasicBlock *B)</tt>: sets BasicBlock B as the ith succesor to this terminator instruction.
- \end{itemize}
-
-<li>PHINode : This represents the PHI instructions in the SSA form.
- \begin{itemize}
- <li><tt> unsigned getNumIncomingValues()</tt>: Returns the number of incoming edges to this PHI node.
- <li><tt> Value *getIncomingValue(unsigned i)</tt>: Returns the ith incoming Value.
- <li><tt>void setIncomingValue(unsigned i, Value *V)</tt>: Sets the ith incoming Value as V
- <li><tt>BasicBlock *getIncomingBlock(unsigned i)</tt>: Returns the Basic Block corresponding to the ith incoming Value.
- <li><tt> void addIncoming(Value *D, BasicBlock *BB)</tt>:
- Add an incoming value to the end of the PHI list
- <li><tt> int getBasicBlockIndex(const BasicBlock *BB) const</tt>:
- Returns the first index of the specified basic block in the value list for this PHI. Returns -1 if no instance.
- \end{itemize}
-<li>CastInst : In LLVM all casts have to be done through explicit cast instructions. CastInst defines the interface to the cast instructions.
-<li>CallInst : This defines an interface to the call instruction in LLVM. ARguments to the function are nothing but operands of the instruction.
- \begin{itemize}
- <li>: <tt>Function *getCalledFunction()</tt>: Returns a handle to the function that is being called by this Function.
- \end{itemize}
-<li>LoadInst, StoreInst, GetElemPtrInst : These subclasses represent load, store and getelementptr instructions in LLVM.
- \begin{itemize}
- <li><tt>Value * getPointerOperand()</tt>: Returns the Pointer Operand which is typically the 0th operand.
- \end{itemize}
-<li>BranchInst : This is a subclass of TerminatorInst and defines the interface for conditional and unconditional branches in LLVM.
- \begin{itemize}
- <li><tt>bool isConditional()</tt>: Returns true if the branch is a conditional branch else returns false
- <li> <tt>Value *getCondition()</tt>: Returns the condition if it is a conditional branch else returns null.
- <li> <tt>void setUnconditionalDest(BasicBlock *Dest)</tt>: Changes the current branch to an unconditional one targetting the specified block.
- \end{itemize}
-
-\end{itemize}
-
--->
-
-
-<!-- ======================================================================= -->
-</ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
-<tr><td> </td><td width="100%">
-<font color="#EEEEFF" face="Georgia,Palatino"><b>
-<a name="BasicBlock">The <tt>BasicBlock</tt> class</a>
-</b></font></td></tr></table><ul>
-
-<tt>#include "<a
-href="/doxygen/BasicBlock_8h-source.html">llvm/BasicBlock.h</a>"</tt></b><br>
+Superclass: <a href="#Value"><tt>Value</tt></a>
+ <p> The <tt>User</tt> class is the common base class of all LLVM nodes
+that may refer to <a href="#Value"><tt>Value</tt></a>s. It exposes a
+list of "Operands" that are all of the <a href="#Value"><tt>Value</tt></a>s
+that the User is referring to. The <tt>User</tt> class itself is a
+subclass of <tt>Value</tt>.</p>
+ <p> The operands of a <tt>User</tt> point directly to the LLVM <a
+ href="#Value"><tt>Value</tt></a> that it refers to. Because LLVM uses
+Static Single Assignment (SSA) form, there can only be one definition
+referred to, allowing this direct connection. This connection provides
+the use-def information in LLVM.</p>
+ <p><!-- _______________________________________________________________________ --> </p>
+</ul>
+<h4>
+<hr size="1"><a name="m_User">Important Public Members of the <tt>User</tt>
+class</a></h4>
+<ul>
+The <tt>User</tt> class exposes the operand list in two ways: through
+an index access interface and through an iterator based interface.
+ <p> </p>
+ <li><tt>Value *getOperand(unsigned i)</tt><br>
+ <tt>unsigned getNumOperands()</tt>
+ <p> These two methods expose the operands of the <tt>User</tt> in a
+convenient form for direct access.</p>
+ <p> </p>
+ </li>
+ <li><tt>User::op_iterator</tt> - Typedef for iterator over the operand
+list<br>
+ <tt>User::op_const_iterator</tt> <tt>use_iterator op_begin()</tt> -
+Get an iterator to the start of the operand list.<br>
+ <tt>use_iterator op_end()</tt> - Get an iterator to the end of the
+operand list.
+ <p> Together, these methods make up the iterator based interface to
+the operands of a <tt>User</tt>.</p>
+ <p><!-- ======================================================================= --> </p>
+ </li>
+</ul>
+<table width="100%" bgcolor="#441188" border="0" cellpadding="4"
+ cellspacing="0">
+ <tbody>
+ <tr>
+ <td> </td>
+ <td width="100%"> <font color="#eeeeff"
+ face="Georgia,Palatino"><b> <a name="Instruction">The <tt>Instruction</tt>
+class</a> </b></font></td>
+ </tr>
+ </tbody>
+</table>
+<ul>
+ <tt>#include "</tt><tt><a href="/doxygen/Instruction_8h-source.html">llvm/Instruction.h</a>"</tt><br>
+doxygen info: <a href="/doxygen/classInstruction.html">Instruction
+Class</a><br>
+Superclasses: <a href="#User"><tt>User</tt></a>, <a href="#Value"><tt>Value</tt></a>
+ <p> The <tt>Instruction</tt> class is the common base class for all
+LLVM instructions. It provides only a few methods, but is a very
+commonly used class. The primary data tracked by the <tt>Instruction</tt>
+class itself is the opcode (instruction type) and the parent <a
+ href="#BasicBlock"><tt>BasicBlock</tt></a> the <tt>Instruction</tt> is
+embedded into. To represent a specific type of instruction, one of many
+subclasses of <tt>Instruction</tt> are used.</p>
+ <p> Because the <tt>Instruction</tt> class subclasses the <a
+ href="#User"><tt>User</tt></a> class, its operands can be accessed in
+the same way as for other <a href="#User"><tt>User</tt></a>s (with the <tt>getOperand()</tt>/<tt>getNumOperands()</tt>
+and <tt>op_begin()</tt>/<tt>op_end()</tt> methods).</p>
+ <p> An important file for the <tt>Instruction</tt> class is the <tt>llvm/Instruction.def</tt>
+file. This file contains some meta-data about the various different
+types of instructions in LLVM. It describes the enum values that are
+used as opcodes (for example <tt>Instruction::Add</tt> and <tt>Instruction::SetLE</tt>),
+as well as the concrete sub-classes of <tt>Instruction</tt> that
+implement the instruction (for example <tt><a href="#BinaryOperator">BinaryOperator</a></tt>
+and <tt><a href="#SetCondInst">SetCondInst</a></tt>). Unfortunately,
+the use of macros in this file confuses doxygen, so these enum values
+don't show up correctly in the <a href="/doxygen/classInstruction.html">doxygen
+output</a>.</p>
+ <p><!-- _______________________________________________________________________ --> </p>
+</ul>
+<h4>
+<hr size="1"><a name="m_Instruction">Important Public Members of the <tt>Instruction</tt>
+class</a></h4>
+<ul>
+ <li><tt><a href="#BasicBlock">BasicBlock</a> *getParent()</tt>
+ <p> Returns the <a href="#BasicBlock"><tt>BasicBlock</tt></a> that
+this <tt>Instruction</tt> is embedded into.</p>
+ <p> </p>
+ </li>
+ <li><tt>bool mayWriteToMemory()</tt>
+ <p> Returns true if the instruction writes to memory, i.e. it is a <tt>call</tt>,<tt>free</tt>,<tt>invoke</tt>,
+or <tt>store</tt>.</p>
+ <p> </p>
+ </li>
+ <li><tt>unsigned getOpcode()</tt>
+ <p> Returns the opcode for the <tt>Instruction</tt>.</p>
+ <p> </p>
+ </li>
+ <li><tt><a href="#Instruction">Instruction</a> *clone() const</tt>
+ <p> Returns another instance of the specified instruction, identical
+in all ways to the original except that the instruction has no parent
+(ie it's not embedded into a <a href="#BasicBlock"><tt>BasicBlock</tt></a>),
+and it has no name</p>
+ </li>
+</ul>
+<table width="100%" bgcolor="#441188" border="0" cellpadding="4"
+ cellspacing="0">
+ <tbody>
+ <tr>
+ <td> </td>
+ <td width="100%"> <font color="#eeeeff"
+ face="Georgia,Palatino"><b> <a name="BasicBlock">The <tt>BasicBlock</tt>
+class</a> </b></font></td>
+ </tr>
+ </tbody>
+</table>
+<ul>
+ <tt>#include "<a href="/doxygen/BasicBlock_8h-source.html">llvm/BasicBlock.h</a>"</tt><br>
doxygen info: <a href="/doxygen/classBasicBlock.html">BasicBlock Class</a><br>
-Superclass: <a href="#Value"><tt>Value</tt></a><p>
-
-
-This class represents a single entry multiple exit section of the code, commonly
-known as a basic block by the compiler community. The <tt>BasicBlock</tt> class
-maintains a list of <a href="#Instruction"><tt>Instruction</tt></a>s, which form
-the body of the block. Matching the language definition, the last element of
-this list of instructions is always a terminator instruction (a subclass of the
-<a href="#TerminatorInst"><tt>TerminatorInst</tt></a> class).<p>
-
-In addition to tracking the list of instructions that make up the block, the
-<tt>BasicBlock</tt> class also keeps track of the <a
-href="#Function"><tt>Function</tt></a> that it is embedded into.<p>
-
-Note that <tt>BasicBlock</tt>s themselves are <a
-href="#Value"><tt>Value</tt></a>s, because they are referenced by instructions
-like branches and can go in the switch tables. <tt>BasicBlock</tt>s have type
-<tt>label</tt>.<p>
-
-
-<!-- _______________________________________________________________________ -->
-</ul><h4><a name="m_BasicBlock"><hr size=0>Important Public Members of
-the <tt>BasicBlock</tt> class</h4><ul>
-
-<li><tt>BasicBlock(const std::string &Name = "", <a
-href="#Function">Function</a> *Parent = 0)</tt><p>
-
-The <tt>BasicBlock</tt> constructor is used to create new basic blocks for
-insertion into a function. The constructor simply takes a name for the new
-block, and optionally a <a href="#Function"><tt>Function</tt></a> to insert it
-into. If the <tt>Parent</tt> parameter is specified, the new
-<tt>BasicBlock</tt> is automatically inserted at the end of the specified <a
-href="#Function"><tt>Function</tt></a>, if not specified, the BasicBlock must be
-manually inserted into the <a href="#Function"><tt>Function</tt></a>.<p>
-
-<li><tt>BasicBlock::iterator</tt> - Typedef for instruction list iterator<br>
+Superclass: <a href="#Value"><tt>Value</tt></a>
+ <p> This class represents a single entry multiple exit section of the
+code, commonly known as a basic block by the compiler community. The <tt>BasicBlock</tt>
+class maintains a list of <a href="#Instruction"><tt>Instruction</tt></a>s,
+which form the body of the block. Matching the language definition,
+the last element of this list of instructions is always a terminator
+instruction (a subclass of the <a href="#TerminatorInst"><tt>TerminatorInst</tt></a>
+class).</p>
+ <p> In addition to tracking the list of instructions that make up the
+block, the <tt>BasicBlock</tt> class also keeps track of the <a
+ href="#Function"><tt>Function</tt></a> that it is embedded into.</p>
+ <p> Note that <tt>BasicBlock</tt>s themselves are <a href="#Value"><tt>Value</tt></a>s,
+because they are referenced by instructions like branches and can go in
+the switch tables. <tt>BasicBlock</tt>s have type <tt>label</tt>.</p>
+ <p><!-- _______________________________________________________________________ --> </p>
+</ul>
+<h4>
+<hr size="1"><a name="m_BasicBlock">Important Public Members of the <tt>BasicBlock</tt>
+class</a></h4>
+<ul>
+ <li><tt>BasicBlock(const std::string &Name = "", </tt><tt><a
+ href="#Function">Function</a> *Parent = 0)</tt>
+ <p> The <tt>BasicBlock</tt> constructor is used to create new basic
+blocks for insertion into a function. The constructor optionally takes
+a name for the new block, and a <a href="#Function"><tt>Function</tt></a>
+to insert it into. If the <tt>Parent</tt> parameter is specified, the
+new <tt>BasicBlock</tt> is automatically inserted at the end of the
+specified <a href="#Function"><tt>Function</tt></a>, if not specified,
+the BasicBlock must be manually inserted into the <a href="#Function"><tt>Function</tt></a>.</p>
+ <p> </p>
+ </li>
+ <li><tt>BasicBlock::iterator</tt> - Typedef for instruction list
+iterator<br>
<tt>BasicBlock::const_iterator</tt> - Typedef for const_iterator.<br>
- <tt>begin()</tt>, <tt>end()</tt>, <tt>front()</tt>, <tt>back()</tt>,
- <tt>size()</tt>, <tt>empty()</tt>, <tt>rbegin()</tt>, <tt>rend()</tt><p>
-
-These methods and typedefs are forwarding functions that have the same semantics
-as the standard library methods of the same names. These methods expose the
-underlying instruction list of a basic block in a way that is easy to
-manipulate. To get the full complement of container operations (including
-operations to update the list), you must use the <tt>getInstList()</tt>
-method.<p>
-
-<li><tt>BasicBlock::InstListType &getInstList()</tt><p>
-
-This method is used to get access to the underlying container that actually
-holds the Instructions. This method must be used when there isn't a forwarding
-function in the <tt>BasicBlock</tt> class for the operation that you would like
-to perform. Because there are no forwarding functions for "updating"
-operations, you need to use this if you want to update the contents of a
-<tt>BasicBlock</tt>.<p>
-
-<li><tt><A href="#Function">Function</a> *getParent()</tt><p>
-
-Returns a pointer to <a href="#Function"><tt>Function</tt></a> the block is
-embedded into, or a null pointer if it is homeless.<p>
-
-<li><tt><a href="#TerminatorInst">TerminatorInst</a> *getTerminator()</tt><p>
-
-Returns a pointer to the terminator instruction that appears at the end of the
-<tt>BasicBlock</tt>. If there is no terminator instruction, or if the last
-instruction in the block is not a terminator, then a null pointer is
-returned.<p>
-
-
-<!-- ======================================================================= -->
-</ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
-<tr><td> </td><td width="100%">
-<font color="#EEEEFF" face="Georgia,Palatino"><b>
-<a name="GlobalValue">The <tt>GlobalValue</tt> class</a>
-</b></font></td></tr></table><ul>
-
-<tt>#include "<a
-href="/doxygen/GlobalValue_8h-source.html">llvm/GlobalValue.h</a>"</tt></b><br>
-doxygen info: <a href="/doxygen/classGlobalValue.html">GlobalValue Class</a><br>
-Superclasses: <a href="#User"><tt>User</tt></a>, <a
-href="#Value"><tt>Value</tt></a><p>
-
-Global values (<A href="#GlobalVariable"><tt>GlobalVariable</tt></a>s or <a
-href="#Function"><tt>Function</tt></a>s) are the only LLVM values that are
-visible in the bodies of all <a href="#Function"><tt>Function</tt></a>s.
-Because they are visible at global scope, they are also subject to linking with
-other globals defined in different translation units. To control the linking
-process, <tt>GlobalValue</tt>s know their linkage rules. Specifically,
-<tt>GlobalValue</tt>s know whether they have internal or external linkage.<p>
-
-If a <tt>GlobalValue</tt> has internal linkage (equivalent to being
-<tt>static</tt> in C), it is not visible to code outside the current translation
-unit, and does not participate in linking. If it has external linkage, it is
-visible to external code, and does participate in linking. In addition to
-linkage information, <tt>GlobalValue</tt>s keep track of which <a
-href="#Module"><tt>Module</tt></a> they are currently part of.<p>
-
-Because <tt>GlobalValue</tt>s are memory objects, they are always referred to by
-their address. As such, the <a href="#Type"><tt>Type</tt></a> of a global is
-always a pointer to its contents. This is explained in the LLVM Language
-Reference Manual.<p>
-
-
-<!-- _______________________________________________________________________ -->
-</ul><h4><a name="m_GlobalValue"><hr size=0>Important Public Members of
-the <tt>GlobalValue</tt> class</h4><ul>
-
-<li><tt>bool hasInternalLinkage() const</tt><br>
+ <tt>begin()</tt>, <tt>end()</tt>, <tt>front()</tt>, <tt>back()</tt>,<tt>size()</tt>,<tt>empty()</tt>,<tt>rbegin()</tt>,<tt>rend()
+- </tt>STL style functions for accessing the instruction list.
+ <p> These methods and typedefs are forwarding functions that have
+the same semantics as the standard library methods of the same names.
+These methods expose the underlying instruction list of a basic block in
+a way that is easy to manipulate. To get the full complement of
+container operations (including operations to update the list), you must
+use the <tt>getInstList()</tt> method.</p>
+ <p> </p>
+ </li>
+ <li><tt>BasicBlock::InstListType &getInstList()</tt>
+ <p> This method is used to get access to the underlying container
+that actually holds the Instructions. This method must be used when
+there isn't a forwarding function in the <tt>BasicBlock</tt> class for
+the operation that you would like to perform. Because there are no
+forwarding functions for "updating" operations, you need to use this if
+you want to update the contents of a <tt>BasicBlock</tt>.</p>
+ <p> </p>
+ </li>
+ <li><tt><a href="#Function">Function</a> *getParent()</tt>
+ <p> Returns a pointer to <a href="#Function"><tt>Function</tt></a>
+the block is embedded into, or a null pointer if it is homeless.</p>
+ <p> </p>
+ </li>
+ <li><tt><a href="#TerminatorInst">TerminatorInst</a> *getTerminator()</tt>
+ <p> Returns a pointer to the terminator instruction that appears at
+the end of the <tt>BasicBlock</tt>. If there is no terminator
+instruction, or if the last instruction in the block is not a
+terminator, then a null pointer is returned.</p>
+ <p><!-- ======================================================================= --> </p>
+ </li>
+</ul>
+<table width="100%" bgcolor="#441188" border="0" cellpadding="4"
+ cellspacing="0">
+ <tbody>
+ <tr>
+ <td> </td>
+ <td width="100%"> <font color="#eeeeff"
+ face="Georgia,Palatino"><b> <a name="GlobalValue">The <tt>GlobalValue</tt>
+class</a> </b></font></td>
+ </tr>
+ </tbody>
+</table>
+<ul>
+ <tt>#include "<a href="/doxygen/GlobalValue_8h-source.html">llvm/GlobalValue.h</a>"</tt><br>
+doxygen info: <a href="/doxygen/classGlobalValue.html">GlobalValue
+Class</a><br>
+Superclasses: <a href="#User"><tt>User</tt></a>, <a href="#Value"><tt>Value</tt></a>
+ <p> Global values (<a href="#GlobalVariable"><tt>GlobalVariable</tt></a>s
+or <a href="#Function"><tt>Function</tt></a>s) are the only LLVM
+values that are visible in the bodies of all <a href="#Function"><tt>Function</tt></a>s.
+Because they are visible at global scope, they are also subject to
+linking with other globals defined in different translation units. To
+control the linking process, <tt>GlobalValue</tt>s know their linkage
+rules. Specifically, <tt>GlobalValue</tt>s know whether they have
+internal or external linkage, as defined by the <span
+ style="font-family: monospace;">LinkageTypes</span> enumerator.</p>
+ <p> If a <tt>GlobalValue</tt> has internal linkage (equivalent to
+being <tt>static</tt> in C), it is not visible to code outside the
+current translation unit, and does not participate in linking. If it
+has external linkage, it is visible to external code, and does
+participate in linking. In addition to linkage information, <tt>GlobalValue</tt>s
+keep track of which <a href="#Module"><tt>Module</tt></a> they are
+currently part of.</p>
+ <p> Because <tt>GlobalValue</tt>s are memory objects, they are always
+referred to by their <span style="font-weight: bold;">address</span><span
+ style="font-weight: bold;">.</span> As such, the <a href="#Type"><tt>Type</tt></a>
+of a global is always a pointer to its contents. It is important to
+remember this when using the <span style="font-family: monospace;">GetElementPtrInst</span>
+instruction because this pointer must be dereferenced first. For
+example, if you have a <span style="font-family: monospace;">GlobalVariable</span>
+(a subclass of <span style="font-family: monospace;">GlobalValue)</span>
+that is an array of 24 ints, type <span style="font-family: monospace;">[24
+x int]</span>, then the <span style="font-family: monospace;">GlobalVariable</span>
+is a pointer to that array. Although the address of the first element of
+this array and the value of the <span style="font-family: monospace;">GlobalVariable</span>
+are the same, they have different types. The <span
+ style="font-family: monospace;">GlobalVariable</span>'s type is <span
+ style="font-family: monospace;">[24 x int]</span>. The first element's
+type is <span style="font-family: monospace;">int.</span> Because of
+this, accessing a global value requires you to dereference the pointer
+with <span style="font-family: monospace;">GetElementPtrInst</span>
+first, then its elements can be accessed. This is explained in
+the <a href="LangRef.html#globalvars">LLVM Language Reference Manual</a>.</p>
+ <p><!-- _______________________________________________________________________ --> </p>
+</ul>
+<h4>
+<hr size="1"><a name="m_GlobalValue">Important Public Members of the <tt>GlobalValue</tt>
+class</a></h4>
+<ul>
+ <li><tt>bool hasInternalLinkage() const</tt><br>
<tt>bool hasExternalLinkage() const</tt><br>
- <tt>void setInternalLinkage(bool HasInternalLinkage)</tt><p>
-
-These methods manipulate the linkage characteristics of the
-<tt>GlobalValue</tt>.<p>
-
-<li><tt><a href="#Module">Module</a> *getParent()</tt><p>
-
-This returns the <a href="#Module"><tt>Module</tt></a> that the GlobalValue is
-currently embedded into.<p>
-
-
-
-<!-- ======================================================================= -->
-</ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
-<tr><td> </td><td width="100%">
-<font color="#EEEEFF" face="Georgia,Palatino"><b>
-<a name="Function">The <tt>Function</tt> class</a>
-</b></font></td></tr></table><ul>
-
-<tt>#include "<a
-href="/doxygen/Function_8h-source.html">llvm/Function.h</a>"</tt></b><br>
+ <tt>void setInternalLinkage(bool HasInternalLinkage)</tt>
+ <p> These methods manipulate the linkage characteristics of the <tt>GlobalValue</tt>.</p>
+ <p> </p>
+ </li>
+ <li><tt><a href="#Module">Module</a> *getParent()</tt>
+ <p> This returns the <a href="#Module"><tt>Module</tt></a> that the
+GlobalValue is currently embedded into.</p>
+ <p><!-- ======================================================================= --> </p>
+ </li>
+</ul>
+<table width="100%" bgcolor="#441188" border="0" cellpadding="4"
+ cellspacing="0">
+ <tbody>
+ <tr>
+ <td> </td>
+ <td width="100%"> <font color="#eeeeff"
+ face="Georgia,Palatino"><b> <a name="Function">The <tt>Function</tt>
+class</a> </b></font></td>
+ </tr>
+ </tbody>
+</table>
+<ul>
+ <tt>#include "<a href="/doxygen/Function_8h-source.html">llvm/Function.h</a>"</tt><br>
doxygen info: <a href="/doxygen/classFunction.html">Function Class</a><br>
Superclasses: <a href="#GlobalValue"><tt>GlobalValue</tt></a>, <a
-href="#User"><tt>User</tt></a>, <a href="#Value"><tt>Value</tt></a><p>
-
-The <tt>Function</tt> class represents a single procedure in LLVM. It is
-actually one of the more complex classes in the LLVM heirarchy because it must
-keep track of a large amount of data. The <tt>Function</tt> class keeps track
-of a list of <a href="#BasicBlock"><tt>BasicBlock</tt></a>s, a list of formal <a
-href="#Argument"><tt>Argument</tt></a>s, and a <a
-href="#SymbolTable"><tt>SymbolTable</tt></a>.<p>
-
-The list of <a href="#BasicBlock"><tt>BasicBlock</tt></a>s is the most commonly
-used part of <tt>Function</tt> objects. The list imposes an implicit ordering
-of the blocks in the function, which indicate how the code will be layed out by
-the backend. Additionally, the first <a
-href="#BasicBlock"><tt>BasicBlock</tt></a> is the implicit entry node for the
-<tt>Function</tt>. It is not legal in LLVM explicitly branch to this initial
-block. There are no implicit exit nodes, and in fact there may be multiple exit
-nodes from a single <tt>Function</tt>. If the <a
-href="#BasicBlock"><tt>BasicBlock</tt></a> list is empty, this indicates that
-the <tt>Function</tt> is actually a function declaration: the actual body of the
-function hasn't been linked in yet.<p>
-
-In addition to a list of <a href="#BasicBlock"><tt>BasicBlock</tt></a>s, the
-<tt>Function</tt> class also keeps track of the list of formal <a
-href="#Argument"><tt>Argument</tt></a>s that the function receives. This
-container manages the lifetime of the <a href="#Argument"><tt>Argument</tt></a>
-nodes, just like the <a href="#BasicBlock"><tt>BasicBlock</tt></a> list does for
-the <a href="#BasicBlock"><tt>BasicBlock</tt></a>s.<p>
-
-The <a href="#SymbolTable"><tt>SymbolTable</tt></a> is a very rarely used LLVM
-feature that is only used when you have to look up a value by name. Aside from
-that, the <a href="#SymbolTable"><tt>SymbolTable</tt></a> is used internally to
-make sure that there are not conflicts between the names of <a
-href="#Instruction"><tt>Instruction</tt></a>s, <a
-href="#BasicBlock"><tt>BasicBlock</tt></a>s, or <a
-href="#Argument"><tt>Argument</tt></a>s in the function body.<p>
-
-
-<!-- _______________________________________________________________________ -->
-</ul><h4><a name="m_Function"><hr size=0>Important Public Members of
-the <tt>Function</tt> class</h4><ul>
-
-<li><tt>Function(const <a href="#FunctionType">FunctionType</a> *Ty, bool isInternal, const std::string &N = "")</tt><p>
-
-Constructor used when you need to create new <tt>Function</tt>s to add the the
-program. The constructor must specify the type of the function to create and
-whether or not it should start out with internal or external linkage.<p>
-
-<li><tt>bool isExternal()</tt><p>
-
-Return whether or not the <tt>Function</tt> has a body defined. If the function
-is "external", it does not have a body, and thus must be resolved by linking
-with a function defined in a different translation unit.<p>
-
-
-<li><tt>Function::iterator</tt> - Typedef for basic block list iterator<br>
+ href="#User"><tt>User</tt></a>, <a href="#Value"><tt>Value</tt></a>
+ <p> The <tt>Function</tt> class represents a single procedure in LLVM.
+It is actually one of the more complex classes in the LLVM heirarchy
+because it must keep track of a large amount of data. The <tt>Function</tt>
+class keeps track of a list of <a href="#BasicBlock"><tt>BasicBlock</tt></a>s,
+a list of formal <a href="#Argument"><tt>Argument</tt></a>s, and a <a
+ href="#SymbolTable"><tt>SymbolTable</tt></a>.</p>
+ <p> The list of <a href="#BasicBlock"><tt>BasicBlock</tt></a>s is the
+most commonly used part of <tt>Function</tt> objects. The list imposes
+an implicit ordering of the blocks in the function, which indicate how
+the code will be layed out by the backend. Additionally, the first <a
+ href="#BasicBlock"><tt>BasicBlock</tt></a> is the implicit entry node
+for the <tt>Function</tt>. It is not legal in LLVM to explicitly
+branch to this initial block. There are no implicit exit nodes, and in
+fact there may be multiple exit nodes from a single <tt>Function</tt>.
+If the <a href="#BasicBlock"><tt>BasicBlock</tt></a> list is empty,
+this indicates that the <tt>Function</tt> is actually a function
+declaration: the actual body of the function hasn't been linked in yet.</p>
+ <p> In addition to a list of <a href="#BasicBlock"><tt>BasicBlock</tt></a>s,
+the <tt>Function</tt> class also keeps track of the list of formal <a
+ href="#Argument"><tt>Argument</tt></a>s that the function receives.
+This container manages the lifetime of the <a href="#Argument"><tt>Argument</tt></a>
+nodes, just like the <a href="#BasicBlock"><tt>BasicBlock</tt></a> list
+does for the <a href="#BasicBlock"><tt>BasicBlock</tt></a>s.</p>
+ <p> The <a href="#SymbolTable"><tt>SymbolTable</tt></a> is a very
+rarely used LLVM feature that is only used when you have to look up a
+value by name. Aside from that, the <a href="#SymbolTable"><tt>SymbolTable</tt></a>
+is used internally to make sure that there are not conflicts between the
+names of <a href="#Instruction"><tt>Instruction</tt></a>s, <a
+ href="#BasicBlock"><tt>BasicBlock</tt></a>s, or <a href="#Argument"><tt>Argument</tt></a>s
+in the function body.</p>
+ <p><!-- _______________________________________________________________________ --> </p>
+</ul>
+<h4>
+<hr size="1"><a name="m_Function">Important Public Members of the <tt>Function</tt>
+class</a></h4>
+<ul>
+ <li><tt>Function(const </tt><tt><a href="#FunctionType">FunctionType</a>
+*Ty, bool isInternal, const std::string &N = "", Module* Parent = 0)</tt>
+ <p> Constructor used when you need to create new <tt>Function</tt>s
+to add the the program. The constructor must specify the type of the
+function to create and whether or not it should start out with internal
+or external linkage. The <a href="#FunctionType"
+ style="font-family: monospace;">FunctionType</a> argument specifies the
+formal arguments and return value for the function. The same <a
+ href="#FunctionTypel" style="font-family: monospace;">FunctionType</a>
+value can be used to create multiple functions. The <span
+ style="font-family: monospace;">Parent</span> argument specifies the
+Module in which the function is defined. If this argument is provided,
+the function will automatically be inserted into that module's list of
+functions.</p>
+ <p> </p>
+ </li>
+ <li><tt>bool isExternal()</tt>
+ <p> Return whether or not the <tt>Function</tt> has a body defined.
+If the function is "external", it does not have a body, and thus must be
+resolved by linking with a function defined in a different translation
+unit.</p>
+ <p> </p>
+ </li>
+ <li><tt>Function::iterator</tt> - Typedef for basic block list iterator<br>
<tt>Function::const_iterator</tt> - Typedef for const_iterator.<br>
- <tt>begin()</tt>, <tt>end()</tt>, <tt>front()</tt>, <tt>back()</tt>,
- <tt>size()</tt>, <tt>empty()</tt>, <tt>rbegin()</tt>, <tt>rend()</tt><p>
-
-These are forwarding methods that make it easy to access the contents of a
-<tt>Function</tt> object's <a href="#BasicBlock"><tt>BasicBlock</tt></a>
-list.<p>
-
-<li><tt>Function::BasicBlockListType &getBasicBlockList()</tt><p>
-
-Returns the list of <a href="#BasicBlock"><tt>BasicBlock</tt></a>s. This is
-necessary to use when you need to update the list or perform a complex action
-that doesn't have a forwarding method.<p>
-
-
-<li><tt>Function::aiterator</tt> - Typedef for the argument list iterator<br>
+ <tt>begin()</tt>, <tt>end()</tt>, <tt>front()</tt>, <tt>back()</tt>,<tt>size()</tt>,<tt>empty()</tt>,<tt>rbegin()</tt>,<tt>rend()</tt>
+ <p> These are forwarding methods that make it easy to access the
+contents of a <tt>Function</tt> object's <a href="#BasicBlock"><tt>BasicBlock</tt></a>
+list.</p>
+ <p> </p>
+ </li>
+ <li><tt>Function::BasicBlockListType &getBasicBlockList()</tt>
+ <p> Returns the list of <a href="#BasicBlock"><tt>BasicBlock</tt></a>s.
+This is necessary to use when you need to update the list or perform a
+complex action that doesn't have a forwarding method.</p>
+ <p> </p>
+ </li>
+ <li><tt>Function::aiterator</tt> - Typedef for the argument list
+iterator<br>
<tt>Function::const_aiterator</tt> - Typedef for const_iterator.<br>
- <tt>abegin()</tt>, <tt>aend()</tt>, <tt>afront()</tt>, <tt>aback()</tt>,
- <tt>asize()</tt>, <tt>aempty()</tt>, <tt>arbegin()</tt>, <tt>arend()</tt><p>
-
-These are forwarding methods that make it easy to access the contents of a
-<tt>Function</tt> object's <a href="#Argument"><tt>Argument</tt></a> list.<p>
-
-<li><tt>Function::ArgumentListType &getArgumentList()</tt><p>
-
-Returns the list of <a href="#Argument"><tt>Argument</tt></a>s. This is
-necessary to use when you need to update the list or perform a complex action
-that doesn't have a forwarding method.<p>
-
-
-
-<li><tt><a href="#BasicBlock">BasicBlock</a> &getEntryBlock()</tt><p>
-
-Returns the entry <a href="#BasicBlock"><tt>BasicBlock</tt></a> for the
-function. Because the entry block for the function is always the first block,
-this returns the first block of the <tt>Function</tt>.<p>
-
-<li><tt><a href="#Type">Type</a> *getReturnType()</tt><br>
- <tt><a href="#FunctionType">FunctionType</a> *getFunctionType()</tt><p>
-
-This traverses the <a href="#Type"><tt>Type</tt></a> of the <tt>Function</tt>
+ <tt>abegin()</tt>, <tt>aend()</tt>, <tt>afront()</tt>, <tt>aback()</tt>,<tt>asize()</tt>,<tt>aempty()</tt>,<tt>arbegin()</tt>,<tt>arend()</tt>
+ <p> These are forwarding methods that make it easy to access the
+contents of a <tt>Function</tt> object's <a href="#Argument"><tt>Argument</tt></a>
+list.</p>
+ <p> </p>
+ </li>
+ <li><tt>Function::ArgumentListType &getArgumentList()</tt>
+ <p> Returns the list of <a href="#Argument"><tt>Argument</tt></a>s.
+This is necessary to use when you need to update the list or perform a
+complex action that doesn't have a forwarding method.</p>
+ <p> </p>
+ </li>
+ <li><tt><a href="#BasicBlock">BasicBlock</a> &getEntryBlock()</tt>
+ <p> Returns the entry <a href="#BasicBlock"><tt>BasicBlock</tt></a>
+for the function. Because the entry block for the function is always
+the first block, this returns the first block of the <tt>Function</tt>.</p>
+ <p> </p>
+ </li>
+ <li><tt><a href="#Type">Type</a> *getReturnType()</tt><br>
+ <tt><a href="#FunctionType">FunctionType</a> *getFunctionType()</tt>
+ <p> This traverses the <a href="#Type"><tt>Type</tt></a> of the <tt>Function</tt>
and returns the return type of the function, or the <a
-href="#FunctionType"><tt>FunctionType</tt></a> of the actual function.<p>
-
-<li><tt><a href="#SymbolTable">SymbolTable</a> *getSymbolTable()</tt><p>
-
-Return a pointer to the <a href="#SymbolTable"><tt>SymbolTable</tt></a> for this
-<tt>Function</tt>.<p>
-
-
-
-<!-- ======================================================================= -->
-</ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
-<tr><td> </td><td width="100%">
-<font color="#EEEEFF" face="Georgia,Palatino"><b>
-<a name="GlobalVariable">The <tt>GlobalVariable</tt> class</a>
-</b></font></td></tr></table><ul>
-
-<tt>#include "<a
-href="/doxygen/GlobalVariable_8h-source.html">llvm/GlobalVariable.h</a>"</tt></b><br>
-doxygen info: <a href="/doxygen/classGlobalVariable.html">GlobalVariable Class</a><br>
+ href="#FunctionType"><tt>FunctionType</tt></a> of the actual function.</p>
+ <p> </p>
+ </li>
+ <li><tt><a href="#SymbolTable">SymbolTable</a> *getSymbolTable()</tt>
+ <p> Return a pointer to the <a href="#SymbolTable"><tt>SymbolTable</tt></a>
+for this <tt>Function</tt>.</p>
+ <p><!-- ======================================================================= --> </p>
+ </li>
+</ul>
+<table width="100%" bgcolor="#441188" border="0" cellpadding="4"
+ cellspacing="0">
+ <tbody>
+ <tr>
+ <td> </td>
+ <td width="100%"> <font color="#eeeeff"
+ face="Georgia,Palatino"><b> <a name="GlobalVariable">The <tt>GlobalVariable</tt>
+class</a> </b></font></td>
+ </tr>
+ </tbody>
+</table>
+<ul>
+ <tt>#include "<a href="/doxygen/GlobalVariable_8h-source.html">llvm/GlobalVariable.h</a>"</tt><br>
+doxygen info: <a href="/doxygen/classGlobalVariable.html">GlobalVariable
+Class</a><br>
Superclasses: <a href="#GlobalValue"><tt>GlobalValue</tt></a>, <a
-href="#User"><tt>User</tt></a>, <a href="#Value"><tt>Value</tt></a><p>
-
-Global variables are represented with the (suprise suprise)
-<tt>GlobalVariable</tt> class. Like functions, <tt>GlobalVariable</tt>s are
-also subclasses of <a href="#GlobalValue"><tt>GlobalValue</tt></a>, and as such
-are always referenced by their address (global values must live in memory, so
-their "name" refers to their address). Global variables may have an initial
-value (which must be a <a href="#Constant"><tt>Constant</tt></a>), and if they
-have an initializer, they may be marked as "constant" themselves (indicating
-that their contents never change at runtime).<p>
-
-
-<!-- _______________________________________________________________________ -->
-</ul><h4><a name="m_GlobalVariable"><hr size=0>Important Public Members of the
-<tt>GlobalVariable</tt> class</h4><ul>
-
-<li><tt>GlobalVariable(const <a href="#Type">Type</a> *Ty, bool isConstant, bool
-isInternal, <a href="#Constant">Constant</a> *Initializer = 0, const std::string
-&Name = "")</tt><p>
-
-Create a new global variable of the specified type. If <tt>isConstant</tt> is
-true then the global variable will be marked as unchanging for the program, and
-if <tt>isInternal</tt> is true the resultant global variable will have internal
-linkage. Optionally an initializer and name may be specified for the global variable as well.<p>
-
-
-<li><tt>bool isConstant() const</tt><p>
-
-Returns true if this is a global variable is known not to be modified at
-runtime.<p>
-
-
-<li><tt>bool hasInitializer()</tt><p>
-
-Returns true if this <tt>GlobalVariable</tt> has an intializer.<p>
-
-
-<li><tt><a href="#Constant">Constant</a> *getInitializer()</tt><p>
-
-Returns the intial value for a <tt>GlobalVariable</tt>. It is not legal to call
-this method if there is no initializer.<p>
-
-
-<!-- ======================================================================= -->
-</ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
-<tr><td> </td><td width="100%">
-<font color="#EEEEFF" face="Georgia,Palatino"><b>
-<a name="Module">The <tt>Module</tt> class</a>
-</b></font></td></tr></table><ul>
-
-<tt>#include "<a
-href="/doxygen/Module_8h-source.html">llvm/Module.h</a>"</tt></b><br>
-doxygen info: <a href="/doxygen/classModule.html">Module Class</a><p>
-
-The <tt>Module</tt> class represents the top level structure present in LLVM
-programs. An LLVM module is effectively either a translation unit of the
-original program or a combination of several translation units merged by the
-linker. The <tt>Module</tt> class keeps track of a list of <a
-href="#Function"><tt>Function</tt></a>s, a list of <a
-href="#GlobalVariable"><tt>GlobalVariable</tt></a>s, and a <a
-href="#SymbolTable"><tt>SymbolTable</tt></a>. Additionally, it contains a few
-helpful member functions that try to make common operations easy.<p>
-
-
-<!-- _______________________________________________________________________ -->
-</ul><h4><a name="m_Module"><hr size=0>Important Public Members of the
-<tt>Module</tt> class</h4><ul>
-
-<li><tt>Module::iterator</tt> - Typedef for function list iterator<br>
+ href="#User"><tt>User</tt></a>, <a href="#Value"><tt>Value</tt></a>
+ <p> Global variables are represented with the (suprise suprise) <tt>GlobalVariable</tt>
+class. Like functions, <tt>GlobalVariable</tt>s are also subclasses of <a
+ href="#GlobalValue"><tt>GlobalValue</tt></a>, and as such are always
+referenced by their address (global values must live in memory, so their
+"name" refers to their address). See <a href="#GlobalValue"><span
+ style="font-family: monospace;">GlobalValue</span></a> for more on
+this. Global variables may have an initial value (which must be a <a
+ href="#Constant"><tt>Constant</tt></a>), and if they have an
+initializer, they may be marked as "constant" themselves (indicating
+that their contents never change at runtime). </p>
+ <p><!-- _______________________________________________________________________ --> </p>
+</ul>
+<h4>
+<hr size="1"><a name="m_GlobalVariable">Important Public Members of the <tt>GlobalVariable</tt>
+class</a></h4>
+<ul>
+ <li><tt>GlobalVariable(const </tt><tt><a href="#Type">Type</a> *Ty,
+bool isConstant, LinkageTypes& Linkage, <a href="#Constant">Constant</a>
+*Initializer = 0, const std::string &Name = "", Module* Parent = 0)</tt>
+ <p> Create a new global variable of the specified type. If <tt>isConstant</tt>
+is true then the global variable will be marked as unchanging for the
+program. The Linkage parameter specifies the type of linkage (internal,
+external, weak, linkonce, appending) for the variable. If the linkage
+is InternalLinkage, WeakLinkage, or LinkOnceLinkage, then the
+resultant global variable will have internal linkage. AppendingLinkage
+concatenates together all instances (in different translation units) of
+the variable into a single variable but is only applicable to arrays.
+ See the <a href="LangRef.html#modulestructure">LLVM Language
+Reference</a> for further details on linkage types. Optionally an
+initializer, a name, and the module to put the variable into may be
+specified for the global variable as well.</p>
+ <p> </p>
+ </li>
+ <li><tt>bool isConstant() const</tt>
+ <p> Returns true if this is a global variable that is known not to
+be modified at runtime.</p>
+ <p> </p>
+ </li>
+ <li><tt>bool hasInitializer()</tt>
+ <p> Returns true if this <tt>GlobalVariable</tt> has an intializer.</p>
+ <p> </p>
+ </li>
+ <li><tt><a href="#Constant">Constant</a> *getInitializer()</tt>
+ <p> Returns the intial value for a <tt>GlobalVariable</tt>. It is
+not legal to call this method if there is no initializer.</p>
+ <p><!-- ======================================================================= --> </p>
+ </li>
+</ul>
+<table width="100%" bgcolor="#441188" border="0" cellpadding="4"
+ cellspacing="0">
+ <tbody>
+ <tr>
+ <td> </td>
+ <td width="100%"> <font color="#eeeeff"
+ face="Georgia,Palatino"><b> <a name="Module">The <tt>Module</tt> class</a> </b></font></td>
+ </tr>
+ </tbody>
+</table>
+<ul>
+ <tt>#include "<a href="/doxygen/Module_8h-source.html">llvm/Module.h</a>"</tt><br>
+doxygen info: <a href="/doxygen/classModule.html">Module Class</a>
+ <p> The <tt>Module</tt> class represents the top level structure
+present in LLVM programs. An LLVM module is effectively either a
+translation unit of the original program or a combination of several
+translation units merged by the linker. The <tt>Module</tt> class keeps
+track of a list of <a href="#Function"><tt>Function</tt></a>s, a list
+of <a href="#GlobalVariable"><tt>GlobalVariable</tt></a>s, and a <a
+ href="#SymbolTable"><tt>SymbolTable</tt></a>. Additionally, it
+contains a few helpful member functions that try to make common
+operations easy.</p>
+ <p><!-- _______________________________________________________________________ --> </p>
+</ul>
+<h4>
+<hr size="1"><a name="m_Module">Important Public Members of the <tt>Module</tt>
+class<span style="font-family: monospace;"></span></a></h4>
+<ul>
+ <li><span style="font-family: monospace;">Module::Module( std::string
+name = "" ) </span></li>
+</ul>
+<p style="margin-left: 40px;">Constructing a <a href="#Module">Module</a>
+is easy. You can optionally provide a name for it (probably based on the
+name of the translation unit).</p>
+<ul>
+ <li><tt>Module::iterator</tt> - Typedef for function list iterator<br>
<tt>Module::const_iterator</tt> - Typedef for const_iterator.<br>
- <tt>begin()</tt>, <tt>end()</tt>, <tt>front()</tt>, <tt>back()</tt>,
- <tt>size()</tt>, <tt>empty()</tt>, <tt>rbegin()</tt>, <tt>rend()</tt><p>
-
-These are forwarding methods that make it easy to access the contents of a
-<tt>Module</tt> object's <a href="#Function"><tt>Function</tt></a>
-list.<p>
-
-<li><tt>Module::FunctionListType &getFunctionList()</tt><p>
-
-Returns the list of <a href="#Function"><tt>Function</tt></a>s. This is
-necessary to use when you need to update the list or perform a complex action
-that doesn't have a forwarding method.<p>
-
-<!-- Global Variable -->
-<hr size=0>
-
-<li><tt>Module::giterator</tt> - Typedef for global variable list iterator<br>
+ <tt>begin()</tt>, <tt>end()</tt>, <tt>front()</tt>, <tt>back()</tt>,<tt>size()</tt>,<tt>empty()</tt>,<tt>rbegin()</tt>,<tt>rend()</tt>
+ <p> These are forwarding methods that make it easy to access the
+contents of a <tt>Module</tt> object's <a href="#Function"><tt>Function</tt></a>
+list.</p>
+ <p> </p>
+ </li>
+ <li><tt>Module::FunctionListType &getFunctionList()</tt>
+ <p> Returns the list of <a href="#Function"><tt>Function</tt></a>s.
+This is necessary to use when you need to update the list or perform a
+complex action that doesn't have a forwarding method.</p>
+ <p><!-- Global Variable --> </p>
+ <hr size="1"> </li>
+ <li><tt>Module::giterator</tt> - Typedef for global variable list
+iterator<br>
<tt>Module::const_giterator</tt> - Typedef for const_iterator.<br>
- <tt>gbegin()</tt>, <tt>gend()</tt>, <tt>gfront()</tt>, <tt>gback()</tt>,
- <tt>gsize()</tt>, <tt>gempty()</tt>, <tt>grbegin()</tt>, <tt>grend()</tt><p>
-
-These are forwarding methods that make it easy to access the contents of a
-<tt>Module</tt> object's <a href="#GlobalVariable"><tt>GlobalVariable</tt></a>
-list.<p>
-
-<li><tt>Module::GlobalListType &getGlobalList()</tt><p>
-
-Returns the list of <a href="#GlobalVariable"><tt>GlobalVariable</tt></a>s.
-This is necessary to use when you need to update the list or perform a complex
-action that doesn't have a forwarding method.<p>
-
-
-<!-- Symbol table stuff -->
-<hr size=0>
-
-<li><tt><a href="#SymbolTable">SymbolTable</a> *getSymbolTable()</tt><p>
-
-Return a reference to the <a href="#SymbolTable"><tt>SymbolTable</tt></a> for
-this <tt>Module</tt>.<p>
-
-
-<!-- Convenience methods -->
-<hr size=0>
-
-<li><tt><a href="#Function">Function</a> *getFunction(const std::string &Name, const <a href="#FunctionType">FunctionType</a> *Ty)</tt><p>
-
-Look up the specified function in the <tt>Module</tt> <a
-href="#SymbolTable"><tt>SymbolTable</tt></a>. If it does not exist, return
-<tt>null</tt>.<p>
-
-
-<li><tt><a href="#Function">Function</a> *getOrInsertFunction(const std::string
- &Name, const <a href="#FunctionType">FunctionType</a> *T)</tt><p>
-
-Look up the specified function in the <tt>Module</tt> <a
-href="#SymbolTable"><tt>SymbolTable</tt></a>. If it does not exist, add an
-external declaration for the function and return it.<p>
-
-
-<li><tt>std::string getTypeName(const <a href="#Type">Type</a> *Ty)</tt><p>
-
-If there is at least one entry in the <a
-href="#SymbolTable"><tt>SymbolTable</tt></a> for the specified <a
-href="#Type"><tt>Type</tt></a>, return it. Otherwise return the empty
-string.<p>
-
-
-<li><tt>bool addTypeName(const std::string &Name, const <a href="#Type">Type</a>
-*Ty)</tt><p>
-
-Insert an entry in the <a href="#SymbolTable"><tt>SymbolTable</tt></a> mapping
-<tt>Name</tt> to <tt>Ty</tt>. If there is already an entry for this name, true
-is returned and the <a href="#SymbolTable"><tt>SymbolTable</tt></a> is not
-modified.<p>
-
-
-<!-- ======================================================================= -->
-</ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
-<tr><td> </td><td width="100%">
-<font color="#EEEEFF" face="Georgia,Palatino"><b>
-<a name="Constant">The <tt>Constant</tt> class and subclasses</a>
-</b></font></td></tr></table><ul>
-
-Constant represents a base class for different types of constants. It is
-subclassed by ConstantBool, ConstantInt, ConstantSInt, ConstantUInt,
-ConstantArray etc for representing the various types of Constants.<p>
-
-
-<!-- _______________________________________________________________________ -->
-</ul><h4><a name="m_Value"><hr size=0>Important Public Methods</h4><ul>
-
-<li><tt>bool isConstantExpr()</tt>: Returns true if it is a ConstantExpr
-
-
-<hr>
-Important Subclasses of Constant<p>
-
-<ul>
-<li>ConstantSInt : This subclass of Constant represents a signed integer constant.
-<ul>
- <li><tt>int64_t getValue() const</tt>: Returns the underlying value of this constant.
-</ul>
-<li>ConstantUInt : This class represents an unsigned integer.
-<ul>
- <li><tt>uint64_t getValue() const</tt>: Returns the underlying value of this constant.
-</ul>
-<li>ConstantFP : This class represents a floating point constant.
-<ul>
- <li><tt>double getValue() const</tt>: Returns the underlying value of this constant.
-</ul>
-<li>ConstantBool : This represents a boolean constant.
-<ul>
- <li><tt>bool getValue() const</tt>: Returns the underlying value of this constant.
-</ul>
-<li>ConstantArray : This represents a constant array.
-<ul>
- <li><tt>const std::vector<Use> &getValues() const</tt>: Returns a Vecotr of component constants that makeup this array.
-</ul>
-<li>ConstantStruct : This represents a constant struct.
-<ul>
- <li><tt>const std::vector<Use> &getValues() const</tt>: Returns a Vecotr of component constants that makeup this array.
-</ul>
-<li>ConstantPointerRef : This represents a constant pointer value that is initialized to point to a global value, which lies at a constant fixed address.
-<ul>
-<li><tt>GlobalValue *getValue()</tt>: Returns the global value to which this pointer is pointing to.
-</ul>
-</ul>
-
-
-<!-- ======================================================================= -->
-</ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
-<tr><td> </td><td width="100%">
-<font color="#EEEEFF" face="Georgia,Palatino"><b>
-<a name="Type">The <tt>Type</tt> class and Derived Types</a>
-</b></font></td></tr></table><ul>
-
-Type as noted earlier is also a subclass of a Value class. Any primitive
-type (like int, short etc) in LLVM is an instance of Type Class. All
-other types are instances of subclasses of type like FunctionType,
-ArrayType etc. DerivedType is the interface for all such dervied types
-including FunctionType, ArrayType, PointerType, StructType. Types can have
-names. They can be recursive (StructType). There exists exactly one instance
-of any type structure at a time. This allows using pointer equality of Type *s for comparing types.
-
-<!-- _______________________________________________________________________ -->
-</ul><h4><a name="m_Value"><hr size=0>Important Public Methods</h4><ul>
-
-<li><tt>PrimitiveID getPrimitiveID() const</tt>: Returns the base type of the type.
-<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.
-<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.
-<li><tt> bool isInteger() const</tt>: Equilivent to isSigned() || isUnsigned(), but with only a single virtual function invocation.
-<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.
-
-<li><tt>bool isFloatingPoint()</tt>: Return true if this is one of the two floating point types.
-<li><tt>bool isRecursive() const</tt>: Returns rue if the type graph contains a cycle.
-<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.
-<li><tt>bool isPrimitiveType() const</tt>: Returns true if it is a primitive type.
-<li><tt>bool isDerivedType() const</tt>: Returns true if it is a derived type.
-<li><tt>const Type * getContainedType (unsigned i) const</tt>:
-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.
-<li><tt>unsigned getNumContainedTypes() const</tt>: Return the number of types in the derived type.
-
-<p>
-
-<hr>
-Derived Types<p>
-
-<ul>
-<li>SequentialType : This is subclassed by ArrayType and PointerType
-<ul>
- <li><tt>const Type * getElementType() const</tt>: Returns the type of each of the elements in the sequential type.
-</ul>
-<li>ArrayType : This is a subclass of SequentialType and defines interface for array types.
-<ul>
- <li><tt>unsigned getNumElements() const</tt>: Returns the number of elements in the array.
-</ul>
-<li>PointerType : Subclass of SequentialType for pointer types.
-<li>StructType : subclass of DerivedTypes for struct types
-<li>FunctionType : subclass of DerivedTypes for function types.
-
-<ul>
-
- <li><tt>bool isVarArg() const</tt>: Returns true if its a vararg function
- <li><tt> const Type * getReturnType() const</tt>: Returns the return type of the function.
- <li><tt> const ParamTypes &getParamTypes() const</tt>: Returns a vector of parameter types.
- <li><tt>const Type * getParamType (unsigned i)</tt>: Returns the type of the ith parameter.
- <li><tt> const unsigned getNumParams() const</tt>: Returns the number of formal parameters.
-</ul>
-</ul>
-
-
-
-
-<!-- ======================================================================= -->
-</ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
-<tr><td> </td><td width="100%">
-<font color="#EEEEFF" face="Georgia,Palatino"><b>
-<a name="Argument">The <tt>Argument</tt> class</a>
-</b></font></td></tr></table><ul>
-
-This subclass of Value defines the interface for incoming formal arguments to a
-function. A Function maitanis a list of its formal arguments. An argument has a
-pointer to the parent Function.
-
-
-
-
-<!-- *********************************************************************** -->
+ <tt>gbegin()</tt>, <tt>gend()</tt>, <tt>gfront()</tt>, <tt>gback()</tt>,<tt>gsize()</tt>,<tt>gempty()</tt>,<tt>grbegin()</tt>,<tt>grend()</tt>
+ <p> These are forwarding methods that make it easy to access the
+contents of a <tt>Module</tt> object's <a href="#GlobalVariable"><tt>GlobalVariable</tt></a>
+list.</p>
+ <p> </p>
+ </li>
+ <li><tt>Module::GlobalListType &getGlobalList()</tt>
+ <p> Returns the list of <a href="#GlobalVariable"><tt>GlobalVariable</tt></a>s.
+This is necessary to use when you need to update the list or perform a
+complex action that doesn't have a forwarding method.</p>
+ <p><!-- Symbol table stuff --> </p>
+ <hr size="1"> </li>
+ <li><tt><a href="#SymbolTable">SymbolTable</a> *getSymbolTable()</tt>
+ <p> Return a reference to the <a href="#SymbolTable"><tt>SymbolTable</tt></a>
+for this <tt>Module</tt>.</p>
+ <p><!-- Convenience methods --> </p>
+ <hr size="1"> </li>
+ <li><tt><a href="#Function">Function</a> *getFunction(const
+std::string &Name, const <a href="#FunctionType">FunctionType</a>
+*Ty)</tt>
+ <p> Look up the specified function in the <tt>Module</tt> <a
+ href="#SymbolTable"><tt>SymbolTable</tt></a>. If it does not exist,
+return <tt>null</tt>.</p>
+ <p> </p>
+ </li>
+ <li><tt><a href="#Function">Function</a> *getOrInsertFunction(const
+std::string &Name, const <a href="#FunctionType">FunctionType</a> *T)</tt>
+ <p> Look up the specified function in the <tt>Module</tt> <a
+ href="#SymbolTable"><tt>SymbolTable</tt></a>. If it does not exist,
+add an external declaration for the function and return it.</p>
+ <p> </p>
+ </li>
+ <li><tt>std::string getTypeName(const <a href="#Type">Type</a> *Ty)</tt>
+ <p> If there is at least one entry in the <a href="#SymbolTable"><tt>SymbolTable</tt></a>
+for the specified <a href="#Type"><tt>Type</tt></a>, return it.
+Otherwise return the empty string.</p>
+ <p> </p>
+ </li>
+ <li><tt>bool addTypeName(const std::string &Name, const <a
+ href="#Type">Type</a> *Ty)</tt>
+ <p> Insert an entry in the <a href="#SymbolTable"><tt>SymbolTable</tt></a>
+mapping <tt>Name</tt> to <tt>Ty</tt>. If there is already an entry for
+this name, true is returned and the <a href="#SymbolTable"><tt>SymbolTable</tt></a>
+is not modified.</p>
+ <p><!-- ======================================================================= --> </p>
+ </li>
+</ul>
+<table width="100%" bgcolor="#441188" border="0" cellpadding="4"
+ cellspacing="0">
+ <tbody>
+ <tr>
+ <td> </td>
+ <td width="100%"> <font color="#eeeeff"
+ face="Georgia,Palatino"><b> <a name="Constant">The <tt>Constant</tt>
+class and subclasses</a> </b></font></td>
+ </tr>
+ </tbody>
+</table>
+<ul>
+Constant represents a base class for different types of constants. It
+is subclassed by ConstantBool, ConstantInt, ConstantSInt, ConstantUInt,
+ConstantArray etc for representing the various types of Constants.
+ <p><!-- _______________________________________________________________________ --> </p>
+</ul>
+<h4>
+<hr size="1"><a name="m_Value">Important Public Methods</a></h4>
+<ul>
+ <li><tt>bool isConstantExpr()</tt>: Returns true if it is a
+ConstantExpr
+ <hr> Important Subclasses of Constant
+ <p> </p>
+ <ul>
+ <li>ConstantSInt : This subclass of Constant represents a signed
+integer constant.
+ <ul>
+ <li><tt>int64_t getValue() const</tt>: Returns the underlying value of
+this constant. </li>
+ </ul>
+ </li>
+ <li>ConstantUInt : This class represents an unsigned integer.
+ <ul>
+ <li><tt>uint64_t getValue() const</tt>: Returns the underlying value
+of this constant. </li>
+ </ul>
+ </li>
+ <li>ConstantFP : This class represents a floating point constant.
+ <ul>
+ <li><tt>double getValue() const</tt>: Returns the underlying value of
+this constant. </li>
+ </ul>
+ </li>
+ <li>ConstantBool : This represents a boolean constant.
+ <ul>
+ <li><tt>bool getValue() const</tt>: Returns the underlying value of
+this constant. </li>
+ </ul>
+ </li>
+ <li>ConstantArray : This represents a constant array.
+ <ul>
+ <li><tt>const std::vector<Use> &getValues() const</tt>:
+Returns a Vecotr of component constants that makeup this array. </li>
+ </ul>
+ </li>
+ <li>ConstantStruct : This represents a constant struct.
+ <ul>
+ <li><tt>const std::vector<Use> &getValues() const</tt>:
+Returns a Vecotr of component constants that makeup this array. </li>
+ </ul>
+ </li>
+ <li>ConstantPointerRef : This represents a constant pointer value
+that is initialized to point to a global value, which lies at a
+constant fixed address.
+ <ul>
+ <li><tt>GlobalValue *getValue()</tt>: Returns the global
+value to which this pointer is pointing to. </li>
+ </ul>
+ </li>
+ </ul>
+<!-- ======================================================================= --> </li>
+</ul>
+<table width="100%" bgcolor="#441188" border="0" cellpadding="4"
+ cellspacing="0">
+ <tbody>
+ <tr>
+ <td> </td>
+ <td width="100%"> <font color="#eeeeff"
+ face="Georgia,Palatino"><b> <a name="Type">The <tt>Type</tt> class and
+Derived Types</a> </b></font></td>
+ </tr>
+ </tbody>
+</table>
+<ul>
+Type as noted earlier is also a subclass of a Value class. Any
+primitive type (like int, short etc) in LLVM is an instance of Type
+Class. All other types are instances of subclasses of type like
+FunctionType, ArrayType etc. DerivedType is the interface for all such
+dervied types including FunctionType, ArrayType, PointerType,
+StructType. Types can have names. They can be recursive (StructType).
+There exists exactly one instance of any type structure at a time. This
+allows using pointer equality of Type *s for comparing types.<!-- _______________________________________________________________________ -->
+</ul>
+<h4>
+<hr size="1"><a name="m_Value">Important Public Methods</a></h4>
+<ul>
+ <li><tt>PrimitiveID getPrimitiveID() const</tt>: Returns the base
+type of the type. </li>
+ <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. </li>
+ <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. </li>
+ <li><tt> bool isInteger() const</tt>: Equilivent to isSigned() ||
+isUnsigned(), but with only a single virtual function invocation. </li>
+ <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. </li>
+ <li><tt>bool isFloatingPoint()</tt>: Return true if this is one of
+the two floating point types. </li>
+ <li><tt>bool isRecursive() const</tt>: Returns rue if the type graph
+contains a cycle. </li>
+ <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. </li>
+ <li><tt>bool isPrimitiveType() const</tt>: Returns true if it is a
+primitive type. </li>
+ <li><tt>bool isDerivedType() const</tt>: Returns true if it is a
+derived type. </li>
+ <li><tt>const Type * getContainedType (unsigned i) const</tt>: 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. </li>
+ <li><tt>unsigned getNumContainedTypes() const</tt>: Return the number
+of types in the derived type.
+ <p> </p>
+ <hr> Derived Types
+ <p> </p>
+ <ul>
+ <li>SequentialType : This is subclassed by ArrayType and
+PointerType
+ <ul>
+ <li><tt>const Type * getElementType() const</tt>: Returns the type of
+each of the elements in the sequential type. </li>
+ </ul>
+ </li>
+ <li>ArrayType : This is a subclass of SequentialType and defines
+interface for array types.
+ <ul>
+ <li><tt>unsigned getNumElements() const</tt>: Returns the number of
+elements in the array. </li>
+ </ul>
+ </li>
+ <li>PointerType : Subclass of SequentialType for pointer types. </li>
+ <li>StructType : subclass of DerivedTypes for struct types </li>
+ <li>FunctionType : subclass of DerivedTypes for function types.
+ <ul>
+ <li><tt>bool isVarArg() const</tt>: Returns true if its a vararg
+function </li>
+ <li><tt> const Type * getReturnType() const</tt>: Returns the
+return type of the function. </li>
+ <li><tt> const ParamTypes &getParamTypes() const</tt>:
+Returns a vector of parameter types. </li>
+ <li><tt>const Type * getParamType (unsigned i)</tt>: Returns
+the type of the ith parameter. </li>
+ <li><tt> const unsigned getNumParams() const</tt>: Returns the
+number of formal parameters. </li>
+ </ul>
+ </li>
+ </ul>
+<!-- ======================================================================= --> </li>
+</ul>
+<table width="100%" bgcolor="#441188" border="0" cellpadding="4"
+ cellspacing="0">
+ <tbody>
+ <tr>
+ <td> </td>
+ <td width="100%"> <font color="#eeeeff"
+ face="Georgia,Palatino"><b> <a name="Argument">The <tt>Argument</tt>
+class</a> </b></font></td>
+ </tr>
+ </tbody>
+</table>
+<ul>
+This subclass of Value defines the interface for incoming formal
+arguments to a function. A Function maitanis a list of its formal
+arguments. An argument has a pointer to the parent Function.<!-- *********************************************************************** -->
</ul>
<!-- *********************************************************************** -->
-
-<hr><font size-1>
-<address>By: <a href="mailto:dhurjati at cs.uiuc.edu">Dinakar Dhurjati</a> and
-<a href="mailto:sabre at nondot.org">Chris Lattner</a></address>
-<a href="http://llvm.cs.uiuc.edu">The LLVM Compiler Infrastructure</a>
-<br>
-<!-- Created: Tue Aug 6 15:00:33 CDT 2002 -->
-<!-- hhmts start -->
-Last modified: Fri Nov 7 13:24:22 CST 2003
-<!-- hhmts end -->
-</font></body></html>
+<hr><font size-1="">
+<address>By: <a href="mailto:dhurjati at cs.uiuc.edu">Dinakar Dhurjati</a>
+and <a href="mailto:sabre at nondot.org">Chris Lattner</a></address>
+</font><font size-1=""><a href="http://llvm.cs.uiuc.edu">The LLVM
+Compiler Infrastructure</a> <br>
+<!-- Created: Tue Aug 6 15:00:33 CDT 2002 --><!-- hhmts start --> Last
+modified: Fri Nov 7 13:24:22 CST 2003<!-- hhmts end --> </font>
+</body>
+</html>
Index: llvm/docs/llvm.css
diff -u llvm/docs/llvm.css:1.9 llvm/docs/llvm.css:1.10
--- llvm/docs/llvm.css:1.9 Fri Nov 21 19:23:53 2003
+++ llvm/docs/llvm.css Mon Nov 24 19:02:51 2003
@@ -47,3 +47,5 @@
.doc_red { color: red }
+.doc_table { text-align: center; width: 90%; padding: 1 1 1 1; border: 1 1 1 1 ; }
+
More information about the llvm-commits
mailing list