1 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN"
2 "http://www.w3.org/TR/html4/strict.dtd">
5 <title>LLVM Assembly Language Reference Manual</title>
6 <meta http-equiv="Content-Type" content="text/html; charset=utf-8">
7 <meta name="author" content="Chris Lattner">
8 <meta name="description"
9 content="LLVM Assembly Language Reference Manual.">
10 <link rel="stylesheet" href="llvm.css" type="text/css">
15 <div class="doc_title"> LLVM Language Reference Manual </div>
17 <li><a href="#abstract">Abstract</a></li>
18 <li><a href="#introduction">Introduction</a></li>
19 <li><a href="#identifiers">Identifiers</a></li>
20 <li><a href="#highlevel">High Level Structure</a>
22 <li><a href="#modulestructure">Module Structure</a></li>
23 <li><a href="#linkage">Linkage Types</a></li>
24 <li><a href="#callingconv">Calling Conventions</a></li>
25 <li><a href="#globalvars">Global Variables</a></li>
26 <li><a href="#functionstructure">Functions</a></li>
27 <li><a href="#moduleasm">Module-Level Inline Assembly</a></li>
30 <li><a href="#typesystem">Type System</a>
32 <li><a href="#t_primitive">Primitive Types</a>
34 <li><a href="#t_classifications">Type Classifications</a></li>
37 <li><a href="#t_derived">Derived Types</a>
39 <li><a href="#t_array">Array Type</a></li>
40 <li><a href="#t_function">Function Type</a></li>
41 <li><a href="#t_pointer">Pointer Type</a></li>
42 <li><a href="#t_struct">Structure Type</a></li>
43 <li><a href="#t_packed">Packed Type</a></li>
44 <li><a href="#t_opaque">Opaque Type</a></li>
49 <li><a href="#constants">Constants</a>
51 <li><a href="#simpleconstants">Simple Constants</a>
52 <li><a href="#aggregateconstants">Aggregate Constants</a>
53 <li><a href="#globalconstants">Global Variable and Function Addresses</a>
54 <li><a href="#undefvalues">Undefined Values</a>
55 <li><a href="#constantexprs">Constant Expressions</a>
58 <li><a href="#othervalues">Other Values</a>
60 <li><a href="#inlineasm">Inline Assembler Expressions</a>
63 <li><a href="#instref">Instruction Reference</a>
65 <li><a href="#terminators">Terminator Instructions</a>
67 <li><a href="#i_ret">'<tt>ret</tt>' Instruction</a></li>
68 <li><a href="#i_br">'<tt>br</tt>' Instruction</a></li>
69 <li><a href="#i_switch">'<tt>switch</tt>' Instruction</a></li>
70 <li><a href="#i_invoke">'<tt>invoke</tt>' Instruction</a></li>
71 <li><a href="#i_unwind">'<tt>unwind</tt>' Instruction</a></li>
72 <li><a href="#i_unreachable">'<tt>unreachable</tt>' Instruction</a></li>
75 <li><a href="#binaryops">Binary Operations</a>
77 <li><a href="#i_add">'<tt>add</tt>' Instruction</a></li>
78 <li><a href="#i_sub">'<tt>sub</tt>' Instruction</a></li>
79 <li><a href="#i_mul">'<tt>mul</tt>' Instruction</a></li>
80 <li><a href="#i_udiv">'<tt>udiv</tt>' Instruction</a></li>
81 <li><a href="#i_sdiv">'<tt>sdiv</tt>' Instruction</a></li>
82 <li><a href="#i_fdiv">'<tt>fdiv</tt>' Instruction</a></li>
83 <li><a href="#i_urem">'<tt>urem</tt>' Instruction</a></li>
84 <li><a href="#i_srem">'<tt>srem</tt>' Instruction</a></li>
85 <li><a href="#i_frem">'<tt>frem</tt>' Instruction</a></li>
86 <li><a href="#i_setcc">'<tt>set<i>cc</i></tt>' Instructions</a></li>
89 <li><a href="#bitwiseops">Bitwise Binary Operations</a>
91 <li><a href="#i_and">'<tt>and</tt>' Instruction</a></li>
92 <li><a href="#i_or">'<tt>or</tt>' Instruction</a></li>
93 <li><a href="#i_xor">'<tt>xor</tt>' Instruction</a></li>
94 <li><a href="#i_shl">'<tt>shl</tt>' Instruction</a></li>
95 <li><a href="#i_shr">'<tt>shr</tt>' Instruction</a></li>
98 <li><a href="#vectorops">Vector Operations</a>
100 <li><a href="#i_extractelement">'<tt>extractelement</tt>' Instruction</a></li>
101 <li><a href="#i_insertelement">'<tt>insertelement</tt>' Instruction</a></li>
102 <li><a href="#i_shufflevector">'<tt>shufflevector</tt>' Instruction</a></li>
103 <li><a href="#i_vsetint">'<tt>vsetint</tt>' Instruction</a></li>
104 <li><a href="#i_vsetfp">'<tt>vsetfp</tt>' Instruction</a></li>
105 <li><a href="#i_vselect">'<tt>vselect</tt>' Instruction</a></li>
108 <li><a href="#memoryops">Memory Access and Addressing Operations</a>
110 <li><a href="#i_malloc">'<tt>malloc</tt>' Instruction</a></li>
111 <li><a href="#i_free">'<tt>free</tt>' Instruction</a></li>
112 <li><a href="#i_alloca">'<tt>alloca</tt>' Instruction</a></li>
113 <li><a href="#i_load">'<tt>load</tt>' Instruction</a></li>
114 <li><a href="#i_store">'<tt>store</tt>' Instruction</a></li>
115 <li><a href="#i_getelementptr">'<tt>getelementptr</tt>' Instruction</a></li>
118 <li><a href="#otherops">Cast Operations</a>
120 <li><a href="#i_trunc">'<tt>trunc .. to</tt>' Instruction</a></li>
121 <li><a href="#i_zext">'<tt>zext .. to</tt>' Instruction</a></li>
122 <li><a href="#i_sext">'<tt>sext .. to</tt>' Instruction</a></li>
123 <li><a href="#i_fptrunc">'<tt>fptrunc .. to</tt>' Instruction</a></li>
124 <li><a href="#i_fpext">'<tt>fpext .. to</tt>' Instruction</a></li>
125 <li><a href="#i_fp2uint">'<tt>fp2uint .. to</tt>' Instruction</a></li>
126 <li><a href="#i_fp2sint">'<tt>fp2sint .. to</tt>' Instruction</a></li>
127 <li><a href="#i_uint2fp">'<tt>uint2fp .. to</tt>' Instruction</a></li>
128 <li><a href="#i_sint2fp">'<tt>sint2fp .. to</tt>' Instruction</a></li>
129 <li><a href="#i_bitconvert">'<tt>bitconvert .. to</tt>' Instruction</a></li>
131 <li><a href="#otherops">Other Operations</a>
133 <li><a href="#i_phi">'<tt>phi</tt>' Instruction</a></li>
134 <li><a href="#i_select">'<tt>select</tt>' Instruction</a></li>
135 <li><a href="#i_call">'<tt>call</tt>' Instruction</a></li>
136 <li><a href="#i_va_arg">'<tt>va_arg</tt>' Instruction</a></li>
141 <li><a href="#intrinsics">Intrinsic Functions</a>
143 <li><a href="#int_varargs">Variable Argument Handling Intrinsics</a>
145 <li><a href="#i_va_start">'<tt>llvm.va_start</tt>' Intrinsic</a></li>
146 <li><a href="#i_va_end">'<tt>llvm.va_end</tt>' Intrinsic</a></li>
147 <li><a href="#i_va_copy">'<tt>llvm.va_copy</tt>' Intrinsic</a></li>
150 <li><a href="#int_gc">Accurate Garbage Collection Intrinsics</a>
152 <li><a href="#i_gcroot">'<tt>llvm.gcroot</tt>' Intrinsic</a></li>
153 <li><a href="#i_gcread">'<tt>llvm.gcread</tt>' Intrinsic</a></li>
154 <li><a href="#i_gcwrite">'<tt>llvm.gcwrite</tt>' Intrinsic</a></li>
157 <li><a href="#int_codegen">Code Generator Intrinsics</a>
159 <li><a href="#i_returnaddress">'<tt>llvm.returnaddress</tt>' Intrinsic</a></li>
160 <li><a href="#i_frameaddress">'<tt>llvm.frameaddress</tt>' Intrinsic</a></li>
161 <li><a href="#i_stacksave">'<tt>llvm.stacksave</tt>' Intrinsic</a></li>
162 <li><a href="#i_stackrestore">'<tt>llvm.stackrestore</tt>' Intrinsic</a></li>
163 <li><a href="#i_prefetch">'<tt>llvm.prefetch</tt>' Intrinsic</a></li>
164 <li><a href="#i_pcmarker">'<tt>llvm.pcmarker</tt>' Intrinsic</a></li>
165 <li><a href="#i_readcyclecounter"><tt>llvm.readcyclecounter</tt>' Intrinsic</a></li>
168 <li><a href="#int_libc">Standard C Library Intrinsics</a>
170 <li><a href="#i_memcpy">'<tt>llvm.memcpy.*</tt>' Intrinsic</a></li>
171 <li><a href="#i_memmove">'<tt>llvm.memmove.*</tt>' Intrinsic</a></li>
172 <li><a href="#i_memset">'<tt>llvm.memset.*</tt>' Intrinsic</a></li>
173 <li><a href="#i_isunordered">'<tt>llvm.isunordered.*</tt>' Intrinsic</a></li>
174 <li><a href="#i_sqrt">'<tt>llvm.sqrt.*</tt>' Intrinsic</a></li>
175 <li><a href="#i_powi">'<tt>llvm.powi.*</tt>' Intrinsic</a></li>
178 <li><a href="#int_manip">Bit Manipulation Intrinsics</a>
180 <li><a href="#i_bswap">'<tt>llvm.bswap.*</tt>' Intrinsics</a></li>
181 <li><a href="#int_ctpop">'<tt>llvm.ctpop.*</tt>' Intrinsic </a></li>
182 <li><a href="#int_ctlz">'<tt>llvm.ctlz.*</tt>' Intrinsic </a></li>
183 <li><a href="#int_cttz">'<tt>llvm.cttz.*</tt>' Intrinsic </a></li>
186 <li><a href="#int_debugger">Debugger intrinsics</a></li>
191 <div class="doc_author">
192 <p>Written by <a href="mailto:sabre@nondot.org">Chris Lattner</a>
193 and <a href="mailto:vadve@cs.uiuc.edu">Vikram Adve</a></p>
196 <!-- *********************************************************************** -->
197 <div class="doc_section"> <a name="abstract">Abstract </a></div>
198 <!-- *********************************************************************** -->
200 <div class="doc_text">
201 <p>This document is a reference manual for the LLVM assembly language.
202 LLVM is an SSA based representation that provides type safety,
203 low-level operations, flexibility, and the capability of representing
204 'all' high-level languages cleanly. It is the common code
205 representation used throughout all phases of the LLVM compilation
209 <!-- *********************************************************************** -->
210 <div class="doc_section"> <a name="introduction">Introduction</a> </div>
211 <!-- *********************************************************************** -->
213 <div class="doc_text">
215 <p>The LLVM code representation is designed to be used in three
216 different forms: as an in-memory compiler IR, as an on-disk bytecode
217 representation (suitable for fast loading by a Just-In-Time compiler),
218 and as a human readable assembly language representation. This allows
219 LLVM to provide a powerful intermediate representation for efficient
220 compiler transformations and analysis, while providing a natural means
221 to debug and visualize the transformations. The three different forms
222 of LLVM are all equivalent. This document describes the human readable
223 representation and notation.</p>
225 <p>The LLVM representation aims to be light-weight and low-level
226 while being expressive, typed, and extensible at the same time. It
227 aims to be a "universal IR" of sorts, by being at a low enough level
228 that high-level ideas may be cleanly mapped to it (similar to how
229 microprocessors are "universal IR's", allowing many source languages to
230 be mapped to them). By providing type information, LLVM can be used as
231 the target of optimizations: for example, through pointer analysis, it
232 can be proven that a C automatic variable is never accessed outside of
233 the current function... allowing it to be promoted to a simple SSA
234 value instead of a memory location.</p>
238 <!-- _______________________________________________________________________ -->
239 <div class="doc_subsubsection"> <a name="wellformed">Well-Formedness</a> </div>
241 <div class="doc_text">
243 <p>It is important to note that this document describes 'well formed'
244 LLVM assembly language. There is a difference between what the parser
245 accepts and what is considered 'well formed'. For example, the
246 following instruction is syntactically okay, but not well formed:</p>
249 %x = <a href="#i_add">add</a> int 1, %x
252 <p>...because the definition of <tt>%x</tt> does not dominate all of
253 its uses. The LLVM infrastructure provides a verification pass that may
254 be used to verify that an LLVM module is well formed. This pass is
255 automatically run by the parser after parsing input assembly and by
256 the optimizer before it outputs bytecode. The violations pointed out
257 by the verifier pass indicate bugs in transformation passes or input to
260 <!-- Describe the typesetting conventions here. --> </div>
262 <!-- *********************************************************************** -->
263 <div class="doc_section"> <a name="identifiers">Identifiers</a> </div>
264 <!-- *********************************************************************** -->
266 <div class="doc_text">
268 <p>LLVM uses three different forms of identifiers, for different
272 <li>Named values are represented as a string of characters with a '%' prefix.
273 For example, %foo, %DivisionByZero, %a.really.long.identifier. The actual
274 regular expression used is '<tt>%[a-zA-Z$._][a-zA-Z$._0-9]*</tt>'.
275 Identifiers which require other characters in their names can be surrounded
276 with quotes. In this way, anything except a <tt>"</tt> character can be used
279 <li>Unnamed values are represented as an unsigned numeric value with a '%'
280 prefix. For example, %12, %2, %44.</li>
282 <li>Constants, which are described in a <a href="#constants">section about
283 constants</a>, below.</li>
286 <p>LLVM requires that values start with a '%' sign for two reasons: Compilers
287 don't need to worry about name clashes with reserved words, and the set of
288 reserved words may be expanded in the future without penalty. Additionally,
289 unnamed identifiers allow a compiler to quickly come up with a temporary
290 variable without having to avoid symbol table conflicts.</p>
292 <p>Reserved words in LLVM are very similar to reserved words in other
293 languages. There are keywords for different opcodes ('<tt><a
294 href="#i_add">add</a></tt>', '<tt><a href="#i_cast">cast</a></tt>', '<tt><a
295 href="#i_ret">ret</a></tt>', etc...), for primitive type names ('<tt><a
296 href="#t_void">void</a></tt>', '<tt><a href="#t_uint">uint</a></tt>', etc...),
297 and others. These reserved words cannot conflict with variable names, because
298 none of them start with a '%' character.</p>
300 <p>Here is an example of LLVM code to multiply the integer variable
301 '<tt>%X</tt>' by 8:</p>
306 %result = <a href="#i_mul">mul</a> uint %X, 8
309 <p>After strength reduction:</p>
312 %result = <a href="#i_shl">shl</a> uint %X, ubyte 3
315 <p>And the hard way:</p>
318 <a href="#i_add">add</a> uint %X, %X <i>; yields {uint}:%0</i>
319 <a href="#i_add">add</a> uint %0, %0 <i>; yields {uint}:%1</i>
320 %result = <a href="#i_add">add</a> uint %1, %1
323 <p>This last way of multiplying <tt>%X</tt> by 8 illustrates several
324 important lexical features of LLVM:</p>
328 <li>Comments are delimited with a '<tt>;</tt>' and go until the end of
331 <li>Unnamed temporaries are created when the result of a computation is not
332 assigned to a named value.</li>
334 <li>Unnamed temporaries are numbered sequentially</li>
338 <p>...and it also shows a convention that we follow in this document. When
339 demonstrating instructions, we will follow an instruction with a comment that
340 defines the type and name of value produced. Comments are shown in italic
345 <!-- *********************************************************************** -->
346 <div class="doc_section"> <a name="highlevel">High Level Structure</a> </div>
347 <!-- *********************************************************************** -->
349 <!-- ======================================================================= -->
350 <div class="doc_subsection"> <a name="modulestructure">Module Structure</a>
353 <div class="doc_text">
355 <p>LLVM programs are composed of "Module"s, each of which is a
356 translation unit of the input programs. Each module consists of
357 functions, global variables, and symbol table entries. Modules may be
358 combined together with the LLVM linker, which merges function (and
359 global variable) definitions, resolves forward declarations, and merges
360 symbol table entries. Here is an example of the "hello world" module:</p>
362 <pre><i>; Declare the string constant as a global constant...</i>
363 <a href="#identifiers">%.LC0</a> = <a href="#linkage_internal">internal</a> <a
364 href="#globalvars">constant</a> <a href="#t_array">[13 x sbyte]</a> c"hello world\0A\00" <i>; [13 x sbyte]*</i>
366 <i>; External declaration of the puts function</i>
367 <a href="#functionstructure">declare</a> int %puts(sbyte*) <i>; int(sbyte*)* </i>
369 <i>; Global variable / Function body section separator</i>
372 <i>; Definition of main function</i>
373 int %main() { <i>; int()* </i>
374 <i>; Convert [13x sbyte]* to sbyte *...</i>
376 href="#i_getelementptr">getelementptr</a> [13 x sbyte]* %.LC0, long 0, long 0 <i>; sbyte*</i>
378 <i>; Call puts function to write out the string to stdout...</i>
380 href="#i_call">call</a> int %puts(sbyte* %cast210) <i>; int</i>
382 href="#i_ret">ret</a> int 0<br>}<br></pre>
384 <p>This example is made up of a <a href="#globalvars">global variable</a>
385 named "<tt>.LC0</tt>", an external declaration of the "<tt>puts</tt>"
386 function, and a <a href="#functionstructure">function definition</a>
387 for "<tt>main</tt>".</p>
389 <p>In general, a module is made up of a list of global values,
390 where both functions and global variables are global values. Global values are
391 represented by a pointer to a memory location (in this case, a pointer to an
392 array of char, and a pointer to a function), and have one of the following <a
393 href="#linkage">linkage types</a>.</p>
395 <p>Due to a limitation in the current LLVM assembly parser (it is limited by
396 one-token lookahead), modules are split into two pieces by the "implementation"
397 keyword. Global variable prototypes and definitions must occur before the
398 keyword, and function definitions must occur after it. Function prototypes may
399 occur either before or after it. In the future, the implementation keyword may
400 become a noop, if the parser gets smarter.</p>
404 <!-- ======================================================================= -->
405 <div class="doc_subsection">
406 <a name="linkage">Linkage Types</a>
409 <div class="doc_text">
412 All Global Variables and Functions have one of the following types of linkage:
417 <dt><tt><b><a name="linkage_internal">internal</a></b></tt> </dt>
419 <dd>Global values with internal linkage are only directly accessible by
420 objects in the current module. In particular, linking code into a module with
421 an internal global value may cause the internal to be renamed as necessary to
422 avoid collisions. Because the symbol is internal to the module, all
423 references can be updated. This corresponds to the notion of the
424 '<tt>static</tt>' keyword in C, or the idea of "anonymous namespaces" in C++.
427 <dt><tt><b><a name="linkage_linkonce">linkonce</a></b></tt>: </dt>
429 <dd>"<tt>linkonce</tt>" linkage is similar to <tt>internal</tt> linkage, with
430 the twist that linking together two modules defining the same
431 <tt>linkonce</tt> globals will cause one of the globals to be discarded. This
432 is typically used to implement inline functions. Unreferenced
433 <tt>linkonce</tt> globals are allowed to be discarded.
436 <dt><tt><b><a name="linkage_weak">weak</a></b></tt>: </dt>
438 <dd>"<tt>weak</tt>" linkage is exactly the same as <tt>linkonce</tt> linkage,
439 except that unreferenced <tt>weak</tt> globals may not be discarded. This is
440 used to implement constructs in C such as "<tt>int X;</tt>" at global scope.
443 <dt><tt><b><a name="linkage_appending">appending</a></b></tt>: </dt>
445 <dd>"<tt>appending</tt>" linkage may only be applied to global variables of
446 pointer to array type. When two global variables with appending linkage are
447 linked together, the two global arrays are appended together. This is the
448 LLVM, typesafe, equivalent of having the system linker append together
449 "sections" with identical names when .o files are linked.
452 <dt><tt><b><a name="linkage_external">externally visible</a></b></tt>:</dt>
454 <dd>If none of the above identifiers are used, the global is externally
455 visible, meaning that it participates in linkage and can be used to resolve
456 external symbol references.
459 <dt><tt><b><a name="linkage_externweak">extern_weak</a></b></tt>: </dt>
461 <dd>"<tt>extern_weak</tt>" TBD
465 The next two types of linkage are targeted for Microsoft Windows platform
466 only. They are designed to support importing (exporting) symbols from (to)
470 <dt><tt><b><a name="linkage_dllimport">dllimport</a></b></tt>: </dt>
472 <dd>"<tt>dllimport</tt>" linkage causes the compiler to reference a function
473 or variable via a global pointer to a pointer that is set up by the DLL
474 exporting the symbol. On Microsoft Windows targets, the pointer name is
475 formed by combining <code>_imp__</code> and the function or variable name.
478 <dt><tt><b><a name="linkage_dllexport">dllexport</a></b></tt>: </dt>
480 <dd>"<tt>dllexport</tt>" linkage causes the compiler to provide a global
481 pointer to a pointer in a DLL, so that it can be referenced with the
482 <tt>dllimport</tt> attribute. On Microsoft Windows targets, the pointer
483 name is formed by combining <code>_imp__</code> and the function or variable
489 <p><a name="linkage_external">For example, since the "<tt>.LC0</tt>"
490 variable is defined to be internal, if another module defined a "<tt>.LC0</tt>"
491 variable and was linked with this one, one of the two would be renamed,
492 preventing a collision. Since "<tt>main</tt>" and "<tt>puts</tt>" are
493 external (i.e., lacking any linkage declarations), they are accessible
494 outside of the current module. It is illegal for a function <i>declaration</i>
495 to have any linkage type other than "externally visible".</a></p>
499 <!-- ======================================================================= -->
500 <div class="doc_subsection">
501 <a name="callingconv">Calling Conventions</a>
504 <div class="doc_text">
506 <p>LLVM <a href="#functionstructure">functions</a>, <a href="#i_call">calls</a>
507 and <a href="#i_invoke">invokes</a> can all have an optional calling convention
508 specified for the call. The calling convention of any pair of dynamic
509 caller/callee must match, or the behavior of the program is undefined. The
510 following calling conventions are supported by LLVM, and more may be added in
514 <dt><b>"<tt>ccc</tt>" - The C calling convention</b>:</dt>
516 <dd>This calling convention (the default if no other calling convention is
517 specified) matches the target C calling conventions. This calling convention
518 supports varargs function calls and tolerates some mismatch in the declared
519 prototype and implemented declaration of the function (as does normal C).
522 <dt><b>"<tt>csretcc</tt>" - The C struct return calling convention</b>:</dt>
524 <dd>This calling convention matches the target C calling conventions, except
525 that functions with this convention are required to take a pointer as their
526 first argument, and the return type of the function must be void. This is
527 used for C functions that return aggregates by-value. In this case, the
528 function has been transformed to take a pointer to the struct as the first
529 argument to the function. For targets where the ABI specifies specific
530 behavior for structure-return calls, the calling convention can be used to
531 distinguish between struct return functions and other functions that take a
532 pointer to a struct as the first argument.
535 <dt><b>"<tt>fastcc</tt>" - The fast calling convention</b>:</dt>
537 <dd>This calling convention attempts to make calls as fast as possible
538 (e.g. by passing things in registers). This calling convention allows the
539 target to use whatever tricks it wants to produce fast code for the target,
540 without having to conform to an externally specified ABI. Implementations of
541 this convention should allow arbitrary tail call optimization to be supported.
542 This calling convention does not support varargs and requires the prototype of
543 all callees to exactly match the prototype of the function definition.
546 <dt><b>"<tt>coldcc</tt>" - The cold calling convention</b>:</dt>
548 <dd>This calling convention attempts to make code in the caller as efficient
549 as possible under the assumption that the call is not commonly executed. As
550 such, these calls often preserve all registers so that the call does not break
551 any live ranges in the caller side. This calling convention does not support
552 varargs and requires the prototype of all callees to exactly match the
553 prototype of the function definition.
556 <dt><b>"<tt>cc <<em>n</em>></tt>" - Numbered convention</b>:</dt>
558 <dd>Any calling convention may be specified by number, allowing
559 target-specific calling conventions to be used. Target specific calling
560 conventions start at 64.
564 <p>More calling conventions can be added/defined on an as-needed basis, to
565 support pascal conventions or any other well-known target-independent
570 <!-- ======================================================================= -->
571 <div class="doc_subsection">
572 <a name="globalvars">Global Variables</a>
575 <div class="doc_text">
577 <p>Global variables define regions of memory allocated at compilation time
578 instead of run-time. Global variables may optionally be initialized, may have
579 an explicit section to be placed in, and may
580 have an optional explicit alignment specified. A
581 variable may be defined as a global "constant," which indicates that the
582 contents of the variable will <b>never</b> be modified (enabling better
583 optimization, allowing the global data to be placed in the read-only section of
584 an executable, etc). Note that variables that need runtime initialization
585 cannot be marked "constant" as there is a store to the variable.</p>
588 LLVM explicitly allows <em>declarations</em> of global variables to be marked
589 constant, even if the final definition of the global is not. This capability
590 can be used to enable slightly better optimization of the program, but requires
591 the language definition to guarantee that optimizations based on the
592 'constantness' are valid for the translation units that do not include the
596 <p>As SSA values, global variables define pointer values that are in
597 scope (i.e. they dominate) all basic blocks in the program. Global
598 variables always define a pointer to their "content" type because they
599 describe a region of memory, and all memory objects in LLVM are
600 accessed through pointers.</p>
602 <p>LLVM allows an explicit section to be specified for globals. If the target
603 supports it, it will emit globals to the section specified.</p>
605 <p>An explicit alignment may be specified for a global. If not present, or if
606 the alignment is set to zero, the alignment of the global is set by the target
607 to whatever it feels convenient. If an explicit alignment is specified, the
608 global is forced to have at least that much alignment. All alignments must be
614 <!-- ======================================================================= -->
615 <div class="doc_subsection">
616 <a name="functionstructure">Functions</a>
619 <div class="doc_text">
621 <p>LLVM function definitions consist of an optional <a href="#linkage">linkage
622 type</a>, an optional <a href="#callingconv">calling convention</a>, a return
623 type, a function name, a (possibly empty) argument list, an optional section,
624 an optional alignment, an opening curly brace,
625 a list of basic blocks, and a closing curly brace. LLVM function declarations
626 are defined with the "<tt>declare</tt>" keyword, an optional <a
627 href="#callingconv">calling convention</a>, a return type, a function name,
628 a possibly empty list of arguments, and an optional alignment.</p>
630 <p>A function definition contains a list of basic blocks, forming the CFG for
631 the function. Each basic block may optionally start with a label (giving the
632 basic block a symbol table entry), contains a list of instructions, and ends
633 with a <a href="#terminators">terminator</a> instruction (such as a branch or
634 function return).</p>
636 <p>The first basic block in a program is special in two ways: it is immediately
637 executed on entrance to the function, and it is not allowed to have predecessor
638 basic blocks (i.e. there can not be any branches to the entry block of a
639 function). Because the block can have no predecessors, it also cannot have any
640 <a href="#i_phi">PHI nodes</a>.</p>
642 <p>LLVM functions are identified by their name and type signature. Hence, two
643 functions with the same name but different parameter lists or return values are
644 considered different functions, and LLVM will resolve references to each
647 <p>LLVM allows an explicit section to be specified for functions. If the target
648 supports it, it will emit functions to the section specified.</p>
650 <p>An explicit alignment may be specified for a function. If not present, or if
651 the alignment is set to zero, the alignment of the function is set by the target
652 to whatever it feels convenient. If an explicit alignment is specified, the
653 function is forced to have at least that much alignment. All alignments must be
658 <!-- ======================================================================= -->
659 <div class="doc_subsection">
660 <a name="moduleasm">Module-Level Inline Assembly</a>
663 <div class="doc_text">
665 Modules may contain "module-level inline asm" blocks, which corresponds to the
666 GCC "file scope inline asm" blocks. These blocks are internally concatenated by
667 LLVM and treated as a single unit, but may be separated in the .ll file if
668 desired. The syntax is very simple:
671 <div class="doc_code"><pre>
672 module asm "inline asm code goes here"
673 module asm "more can go here"
676 <p>The strings can contain any character by escaping non-printable characters.
677 The escape sequence used is simply "\xx" where "xx" is the two digit hex code
682 The inline asm code is simply printed to the machine code .s file when
683 assembly code is generated.
688 <!-- *********************************************************************** -->
689 <div class="doc_section"> <a name="typesystem">Type System</a> </div>
690 <!-- *********************************************************************** -->
692 <div class="doc_text">
694 <p>The LLVM type system is one of the most important features of the
695 intermediate representation. Being typed enables a number of
696 optimizations to be performed on the IR directly, without having to do
697 extra analyses on the side before the transformation. A strong type
698 system makes it easier to read the generated code and enables novel
699 analyses and transformations that are not feasible to perform on normal
700 three address code representations.</p>
704 <!-- ======================================================================= -->
705 <div class="doc_subsection"> <a name="t_primitive">Primitive Types</a> </div>
706 <div class="doc_text">
707 <p>The primitive types are the fundamental building blocks of the LLVM
708 system. The current set of primitive types is as follows:</p>
710 <table class="layout">
715 <tr><th>Type</th><th>Description</th></tr>
716 <tr><td><tt>void</tt></td><td>No value</td></tr>
717 <tr><td><tt>ubyte</tt></td><td>Unsigned 8-bit value</td></tr>
718 <tr><td><tt>ushort</tt></td><td>Unsigned 16-bit value</td></tr>
719 <tr><td><tt>uint</tt></td><td>Unsigned 32-bit value</td></tr>
720 <tr><td><tt>ulong</tt></td><td>Unsigned 64-bit value</td></tr>
721 <tr><td><tt>float</tt></td><td>32-bit floating point value</td></tr>
722 <tr><td><tt>label</tt></td><td>Branch destination</td></tr>
729 <tr><th>Type</th><th>Description</th></tr>
730 <tr><td><tt>bool</tt></td><td>True or False value</td></tr>
731 <tr><td><tt>sbyte</tt></td><td>Signed 8-bit value</td></tr>
732 <tr><td><tt>short</tt></td><td>Signed 16-bit value</td></tr>
733 <tr><td><tt>int</tt></td><td>Signed 32-bit value</td></tr>
734 <tr><td><tt>long</tt></td><td>Signed 64-bit value</td></tr>
735 <tr><td><tt>double</tt></td><td>64-bit floating point value</td></tr>
743 <!-- _______________________________________________________________________ -->
744 <div class="doc_subsubsection"> <a name="t_classifications">Type
745 Classifications</a> </div>
746 <div class="doc_text">
747 <p>These different primitive types fall into a few useful
750 <table border="1" cellspacing="0" cellpadding="4">
752 <tr><th>Classification</th><th>Types</th></tr>
754 <td><a name="t_signed">signed</a></td>
755 <td><tt>sbyte, short, int, long, float, double</tt></td>
758 <td><a name="t_unsigned">unsigned</a></td>
759 <td><tt>ubyte, ushort, uint, ulong</tt></td>
762 <td><a name="t_integer">integer</a></td>
763 <td><tt>ubyte, sbyte, ushort, short, uint, int, ulong, long</tt></td>
766 <td><a name="t_integral">integral</a></td>
767 <td><tt>bool, ubyte, sbyte, ushort, short, uint, int, ulong, long</tt>
771 <td><a name="t_floating">floating point</a></td>
772 <td><tt>float, double</tt></td>
775 <td><a name="t_firstclass">first class</a></td>
776 <td><tt>bool, ubyte, sbyte, ushort, short, uint, int, ulong, long,<br>
777 float, double, <a href="#t_pointer">pointer</a>,
778 <a href="#t_packed">packed</a></tt></td>
783 <p>The <a href="#t_firstclass">first class</a> types are perhaps the
784 most important. Values of these types are the only ones which can be
785 produced by instructions, passed as arguments, or used as operands to
786 instructions. This means that all structures and arrays must be
787 manipulated either by pointer or by component.</p>
790 <!-- ======================================================================= -->
791 <div class="doc_subsection"> <a name="t_derived">Derived Types</a> </div>
793 <div class="doc_text">
795 <p>The real power in LLVM comes from the derived types in the system.
796 This is what allows a programmer to represent arrays, functions,
797 pointers, and other useful types. Note that these derived types may be
798 recursive: For example, it is possible to have a two dimensional array.</p>
802 <!-- _______________________________________________________________________ -->
803 <div class="doc_subsubsection"> <a name="t_array">Array Type</a> </div>
805 <div class="doc_text">
809 <p>The array type is a very simple derived type that arranges elements
810 sequentially in memory. The array type requires a size (number of
811 elements) and an underlying data type.</p>
816 [<# elements> x <elementtype>]
819 <p>The number of elements is a constant integer value; elementtype may
820 be any type with a size.</p>
823 <table class="layout">
826 <tt>[40 x int ]</tt><br/>
827 <tt>[41 x int ]</tt><br/>
828 <tt>[40 x uint]</tt><br/>
831 Array of 40 integer values.<br/>
832 Array of 41 integer values.<br/>
833 Array of 40 unsigned integer values.<br/>
837 <p>Here are some examples of multidimensional arrays:</p>
838 <table class="layout">
841 <tt>[3 x [4 x int]]</tt><br/>
842 <tt>[12 x [10 x float]]</tt><br/>
843 <tt>[2 x [3 x [4 x uint]]]</tt><br/>
846 3x4 array of integer values.<br/>
847 12x10 array of single precision floating point values.<br/>
848 2x3x4 array of unsigned integer values.<br/>
853 <p>Note that 'variable sized arrays' can be implemented in LLVM with a zero
854 length array. Normally, accesses past the end of an array are undefined in
855 LLVM (e.g. it is illegal to access the 5th element of a 3 element array).
856 As a special case, however, zero length arrays are recognized to be variable
857 length. This allows implementation of 'pascal style arrays' with the LLVM
858 type "{ int, [0 x float]}", for example.</p>
862 <!-- _______________________________________________________________________ -->
863 <div class="doc_subsubsection"> <a name="t_function">Function Type</a> </div>
864 <div class="doc_text">
866 <p>The function type can be thought of as a function signature. It
867 consists of a return type and a list of formal parameter types.
868 Function types are usually used to build virtual function tables
869 (which are structures of pointers to functions), for indirect function
870 calls, and when defining a function.</p>
872 The return type of a function type cannot be an aggregate type.
875 <pre> <returntype> (<parameter list>)<br></pre>
876 <p>...where '<tt><parameter list></tt>' is a comma-separated list of type
877 specifiers. Optionally, the parameter list may include a type <tt>...</tt>,
878 which indicates that the function takes a variable number of arguments.
879 Variable argument functions can access their arguments with the <a
880 href="#int_varargs">variable argument handling intrinsic</a> functions.</p>
882 <table class="layout">
885 <tt>int (int)</tt> <br/>
886 <tt>float (int, int *) *</tt><br/>
887 <tt>int (sbyte *, ...)</tt><br/>
890 function taking an <tt>int</tt>, returning an <tt>int</tt><br/>
891 <a href="#t_pointer">Pointer</a> to a function that takes an
892 <tt>int</tt> and a <a href="#t_pointer">pointer</a> to <tt>int</tt>,
893 returning <tt>float</tt>.<br/>
894 A vararg function that takes at least one <a href="#t_pointer">pointer</a>
895 to <tt>sbyte</tt> (signed char in C), which returns an integer. This is
896 the signature for <tt>printf</tt> in LLVM.<br/>
902 <!-- _______________________________________________________________________ -->
903 <div class="doc_subsubsection"> <a name="t_struct">Structure Type</a> </div>
904 <div class="doc_text">
906 <p>The structure type is used to represent a collection of data members
907 together in memory. The packing of the field types is defined to match
908 the ABI of the underlying processor. The elements of a structure may
909 be any type that has a size.</p>
910 <p>Structures are accessed using '<tt><a href="#i_load">load</a></tt>
911 and '<tt><a href="#i_store">store</a></tt>' by getting a pointer to a
912 field with the '<tt><a href="#i_getelementptr">getelementptr</a></tt>'
915 <pre> { <type list> }<br></pre>
917 <table class="layout">
920 <tt>{ int, int, int }</tt><br/>
921 <tt>{ float, int (int) * }</tt><br/>
924 a triple of three <tt>int</tt> values<br/>
925 A pair, where the first element is a <tt>float</tt> and the second element
926 is a <a href="#t_pointer">pointer</a> to a <a href="#t_function">function</a>
927 that takes an <tt>int</tt>, returning an <tt>int</tt>.<br/>
933 <!-- _______________________________________________________________________ -->
934 <div class="doc_subsubsection"> <a name="t_pointer">Pointer Type</a> </div>
935 <div class="doc_text">
937 <p>As in many languages, the pointer type represents a pointer or
938 reference to another object, which must live in memory.</p>
940 <pre> <type> *<br></pre>
942 <table class="layout">
945 <tt>[4x int]*</tt><br/>
946 <tt>int (int *) *</tt><br/>
949 A <a href="#t_pointer">pointer</a> to <a href="#t_array">array</a> of
950 four <tt>int</tt> values<br/>
951 A <a href="#t_pointer">pointer</a> to a <a
952 href="#t_function">function</a> that takes an <tt>int*</tt>, returning an
959 <!-- _______________________________________________________________________ -->
960 <div class="doc_subsubsection"> <a name="t_packed">Packed Type</a> </div>
961 <div class="doc_text">
965 <p>A packed type is a simple derived type that represents a vector
966 of elements. Packed types are used when multiple primitive data
967 are operated in parallel using a single instruction (SIMD).
968 A packed type requires a size (number of
969 elements) and an underlying primitive data type. Vectors must have a power
970 of two length (1, 2, 4, 8, 16 ...). Packed types are
971 considered <a href="#t_firstclass">first class</a>.</p>
976 < <# elements> x <elementtype> >
979 <p>The number of elements is a constant integer value; elementtype may
980 be any integral or floating point type.</p>
984 <table class="layout">
987 <tt><4 x int></tt><br/>
988 <tt><8 x float></tt><br/>
989 <tt><2 x uint></tt><br/>
992 Packed vector of 4 integer values.<br/>
993 Packed vector of 8 floating-point values.<br/>
994 Packed vector of 2 unsigned integer values.<br/>
1000 <!-- _______________________________________________________________________ -->
1001 <div class="doc_subsubsection"> <a name="t_opaque">Opaque Type</a> </div>
1002 <div class="doc_text">
1006 <p>Opaque types are used to represent unknown types in the system. This
1007 corresponds (for example) to the C notion of a foward declared structure type.
1008 In LLVM, opaque types can eventually be resolved to any type (not just a
1009 structure type).</p>
1019 <table class="layout">
1025 An opaque type.<br/>
1032 <!-- *********************************************************************** -->
1033 <div class="doc_section"> <a name="constants">Constants</a> </div>
1034 <!-- *********************************************************************** -->
1036 <div class="doc_text">
1038 <p>LLVM has several different basic types of constants. This section describes
1039 them all and their syntax.</p>
1043 <!-- ======================================================================= -->
1044 <div class="doc_subsection"><a name="simpleconstants">Simple Constants</a></div>
1046 <div class="doc_text">
1049 <dt><b>Boolean constants</b></dt>
1051 <dd>The two strings '<tt>true</tt>' and '<tt>false</tt>' are both valid
1052 constants of the <tt><a href="#t_primitive">bool</a></tt> type.
1055 <dt><b>Integer constants</b></dt>
1057 <dd>Standard integers (such as '4') are constants of the <a
1058 href="#t_integer">integer</a> type. Negative numbers may be used with signed
1062 <dt><b>Floating point constants</b></dt>
1064 <dd>Floating point constants use standard decimal notation (e.g. 123.421),
1065 exponential notation (e.g. 1.23421e+2), or a more precise hexadecimal
1066 notation (see below). Floating point constants must have a <a
1067 href="#t_floating">floating point</a> type. </dd>
1069 <dt><b>Null pointer constants</b></dt>
1071 <dd>The identifier '<tt>null</tt>' is recognized as a null pointer constant
1072 and must be of <a href="#t_pointer">pointer type</a>.</dd>
1076 <p>The one non-intuitive notation for constants is the optional hexadecimal form
1077 of floating point constants. For example, the form '<tt>double
1078 0x432ff973cafa8000</tt>' is equivalent to (but harder to read than) '<tt>double
1079 4.5e+15</tt>'. The only time hexadecimal floating point constants are required
1080 (and the only time that they are generated by the disassembler) is when a
1081 floating point constant must be emitted but it cannot be represented as a
1082 decimal floating point number. For example, NaN's, infinities, and other
1083 special values are represented in their IEEE hexadecimal format so that
1084 assembly and disassembly do not cause any bits to change in the constants.</p>
1088 <!-- ======================================================================= -->
1089 <div class="doc_subsection"><a name="aggregateconstants">Aggregate Constants</a>
1092 <div class="doc_text">
1093 <p>Aggregate constants arise from aggregation of simple constants
1094 and smaller aggregate constants.</p>
1097 <dt><b>Structure constants</b></dt>
1099 <dd>Structure constants are represented with notation similar to structure
1100 type definitions (a comma separated list of elements, surrounded by braces
1101 (<tt>{}</tt>)). For example: "<tt>{ int 4, float 17.0, int* %G }</tt>",
1102 where "<tt>%G</tt>" is declared as "<tt>%G = external global int</tt>". Structure constants
1103 must have <a href="#t_struct">structure type</a>, and the number and
1104 types of elements must match those specified by the type.
1107 <dt><b>Array constants</b></dt>
1109 <dd>Array constants are represented with notation similar to array type
1110 definitions (a comma separated list of elements, surrounded by square brackets
1111 (<tt>[]</tt>)). For example: "<tt>[ int 42, int 11, int 74 ]</tt>". Array
1112 constants must have <a href="#t_array">array type</a>, and the number and
1113 types of elements must match those specified by the type.
1116 <dt><b>Packed constants</b></dt>
1118 <dd>Packed constants are represented with notation similar to packed type
1119 definitions (a comma separated list of elements, surrounded by
1120 less-than/greater-than's (<tt><></tt>)). For example: "<tt>< int 42,
1121 int 11, int 74, int 100 ></tt>". Packed constants must have <a
1122 href="#t_packed">packed type</a>, and the number and types of elements must
1123 match those specified by the type.
1126 <dt><b>Zero initialization</b></dt>
1128 <dd>The string '<tt>zeroinitializer</tt>' can be used to zero initialize a
1129 value to zero of <em>any</em> type, including scalar and aggregate types.
1130 This is often used to avoid having to print large zero initializers (e.g. for
1131 large arrays) and is always exactly equivalent to using explicit zero
1138 <!-- ======================================================================= -->
1139 <div class="doc_subsection">
1140 <a name="globalconstants">Global Variable and Function Addresses</a>
1143 <div class="doc_text">
1145 <p>The addresses of <a href="#globalvars">global variables</a> and <a
1146 href="#functionstructure">functions</a> are always implicitly valid (link-time)
1147 constants. These constants are explicitly referenced when the <a
1148 href="#identifiers">identifier for the global</a> is used and always have <a
1149 href="#t_pointer">pointer</a> type. For example, the following is a legal LLVM
1155 %Z = global [2 x int*] [ int* %X, int* %Y ]
1160 <!-- ======================================================================= -->
1161 <div class="doc_subsection"><a name="undefvalues">Undefined Values</a></div>
1162 <div class="doc_text">
1163 <p>The string '<tt>undef</tt>' is recognized as a type-less constant that has
1164 no specific value. Undefined values may be of any type and be used anywhere
1165 a constant is permitted.</p>
1167 <p>Undefined values indicate to the compiler that the program is well defined
1168 no matter what value is used, giving the compiler more freedom to optimize.
1172 <!-- ======================================================================= -->
1173 <div class="doc_subsection"><a name="constantexprs">Constant Expressions</a>
1176 <div class="doc_text">
1178 <p>Constant expressions are used to allow expressions involving other constants
1179 to be used as constants. Constant expressions may be of any <a
1180 href="#t_firstclass">first class</a> type and may involve any LLVM operation
1181 that does not have side effects (e.g. load and call are not supported). The
1182 following is the syntax for constant expressions:</p>
1185 <dt><b><tt>trunc ( CST to TYPE )</tt></b></dt>
1186 <dd>Truncate a constant to another type. The bit size of CST must be larger
1187 than the bit size of TYPE. Both types must be integral.</dd>
1189 <dt><b><tt>zext ( CST to TYPE )</tt></b></dt>
1190 <dd>Zero extend a constant to another type. The bit size of CST must be
1191 smaller or equal to the bit size of TYPE. Both types must be integral.</dd>
1193 <dt><b><tt>sext ( CST to TYPE )</tt></b></dt>
1194 <dd>Sign extend a constant to another type. The bit size of CST must be
1195 smaller or equal to the bit size of TYPE. Both types must be integral.</dd>
1197 <dt><b><tt>fptrunc ( CST to TYPE )</tt></b></dt>
1198 <dd>Truncate a floating point constant to another floating point type. The
1199 size of CST must be larger than the size of TYPE. Both types must be
1200 floating point.</dd>
1202 <dt><b><tt>fpext ( CST to TYPE )</tt></b></dt>
1203 <dd>Floating point extend a constant to another type. The size of CST must be
1204 smaller or equal to the size of TYPE. Both types must be floating point.</dd>
1206 <dt><b><tt>fp2uint ( CST to TYPE )</tt></b></dt>
1207 <dd>Convert a floating point constant to the corresponding unsigned integer
1208 constant. TYPE must be an integer type. CST must be floating point. If the
1209 value won't fit in the integer type, the results are undefined.</dd>
1211 <dt><b><tt>fp2sint ( CST to TYPE )</tt></b></dt>
1212 <dd>Convert a floating point constant to the corresponding signed integer
1213 constant. TYPE must be an integer type. CST must be floating point. If the
1214 value won't fit in the integer type, the results are undefined.</dd>
1216 <dt><b><tt>uint2fp ( CST to TYPE )</tt></b></dt>
1217 <dd>Convert an unsigned integer constant to the corresponding floating point
1218 constant. TYPE must be floating point. CST must be of integer type. If the
1219 value won't fit in the floating point type, the results are undefined.</dd>
1221 <dt><b><tt>sint2fp ( CST to TYPE )</tt></b></dt>
1222 <dd>Convert a signed integer constant to the corresponding floating point
1223 constant. TYPE must be floating point. CST must be of integer type. If the
1224 value won't fit in the floating point type, the results are undefined.</dd>
1226 <dt><b><tt>bitconvert ( CST to TYPE )</tt></b></dt>
1227 <dd>Convert a constant, CST, to another TYPE. The size of CST and TYPE must be
1228 identical (same number of bits). The conversion is done as if the CST value
1229 was stored to memory and read back as TYPE. In other words, no bits change
1230 with this operator, just the type. This can be used for conversion of pointer
1231 and packed types to any other type, as long as they have the same bit width.
1234 <dt><b><tt>getelementptr ( CSTPTR, IDX0, IDX1, ... )</tt></b></dt>
1236 <dd>Perform the <a href="#i_getelementptr">getelementptr operation</a> on
1237 constants. As with the <a href="#i_getelementptr">getelementptr</a>
1238 instruction, the index list may have zero or more indexes, which are required
1239 to make sense for the type of "CSTPTR".</dd>
1241 <dt><b><tt>select ( COND, VAL1, VAL2 )</tt></b></dt>
1243 <dd>Perform the <a href="#i_select">select operation</a> on
1246 <dt><b><tt>extractelement ( VAL, IDX )</tt></b></dt>
1248 <dd>Perform the <a href="#i_extractelement">extractelement
1249 operation</a> on constants.
1251 <dt><b><tt>insertelement ( VAL, ELT, IDX )</tt></b></dt>
1253 <dd>Perform the <a href="#i_insertelement">insertelement
1254 operation</a> on constants.
1257 <dt><b><tt>shufflevector ( VEC1, VEC2, IDXMASK )</tt></b></dt>
1259 <dd>Perform the <a href="#i_shufflevector">shufflevector
1260 operation</a> on constants.
1262 <dt><b><tt>OPCODE ( LHS, RHS )</tt></b></dt>
1264 <dd>Perform the specified operation of the LHS and RHS constants. OPCODE may
1265 be any of the <a href="#binaryops">binary</a> or <a href="#bitwiseops">bitwise
1266 binary</a> operations. The constraints on operands are the same as those for
1267 the corresponding instruction (e.g. no bitwise operations on floating point
1268 values are allowed).</dd>
1272 <!-- *********************************************************************** -->
1273 <div class="doc_section"> <a name="othervalues">Other Values</a> </div>
1274 <!-- *********************************************************************** -->
1276 <!-- ======================================================================= -->
1277 <div class="doc_subsection">
1278 <a name="inlineasm">Inline Assembler Expressions</a>
1281 <div class="doc_text">
1284 LLVM supports inline assembler expressions (as opposed to <a href="#moduleasm">
1285 Module-Level Inline Assembly</a>) through the use of a special value. This
1286 value represents the inline assembler as a string (containing the instructions
1287 to emit), a list of operand constraints (stored as a string), and a flag that
1288 indicates whether or not the inline asm expression has side effects. An example
1289 inline assembler expression is:
1293 int(int) asm "bswap $0", "=r,r"
1297 Inline assembler expressions may <b>only</b> be used as the callee operand of
1298 a <a href="#i_call"><tt>call</tt> instruction</a>. Thus, typically we have:
1302 %X = call int asm "<a href="#i_bswap">bswap</a> $0", "=r,r"(int %Y)
1306 Inline asms with side effects not visible in the constraint list must be marked
1307 as having side effects. This is done through the use of the
1308 '<tt>sideeffect</tt>' keyword, like so:
1312 call void asm sideeffect "eieio", ""()
1315 <p>TODO: The format of the asm and constraints string still need to be
1316 documented here. Constraints on what can be done (e.g. duplication, moving, etc
1317 need to be documented).
1322 <!-- *********************************************************************** -->
1323 <div class="doc_section"> <a name="instref">Instruction Reference</a> </div>
1324 <!-- *********************************************************************** -->
1326 <div class="doc_text">
1328 <p>The LLVM instruction set consists of several different
1329 classifications of instructions: <a href="#terminators">terminator
1330 instructions</a>, <a href="#binaryops">binary instructions</a>,
1331 <a href="#bitwiseops">bitwise binary instructions</a>, <a
1332 href="#memoryops">memory instructions</a>, and <a href="#otherops">other
1333 instructions</a>.</p>
1337 <!-- ======================================================================= -->
1338 <div class="doc_subsection"> <a name="terminators">Terminator
1339 Instructions</a> </div>
1341 <div class="doc_text">
1343 <p>As mentioned <a href="#functionstructure">previously</a>, every
1344 basic block in a program ends with a "Terminator" instruction, which
1345 indicates which block should be executed after the current block is
1346 finished. These terminator instructions typically yield a '<tt>void</tt>'
1347 value: they produce control flow, not values (the one exception being
1348 the '<a href="#i_invoke"><tt>invoke</tt></a>' instruction).</p>
1349 <p>There are six different terminator instructions: the '<a
1350 href="#i_ret"><tt>ret</tt></a>' instruction, the '<a href="#i_br"><tt>br</tt></a>'
1351 instruction, the '<a href="#i_switch"><tt>switch</tt></a>' instruction,
1352 the '<a href="#i_invoke"><tt>invoke</tt></a>' instruction, the '<a
1353 href="#i_unwind"><tt>unwind</tt></a>' instruction, and the '<a
1354 href="#i_unreachable"><tt>unreachable</tt></a>' instruction.</p>
1358 <!-- _______________________________________________________________________ -->
1359 <div class="doc_subsubsection"> <a name="i_ret">'<tt>ret</tt>'
1360 Instruction</a> </div>
1361 <div class="doc_text">
1363 <pre> ret <type> <value> <i>; Return a value from a non-void function</i>
1364 ret void <i>; Return from void function</i>
1367 <p>The '<tt>ret</tt>' instruction is used to return control flow (and a
1368 value) from a function back to the caller.</p>
1369 <p>There are two forms of the '<tt>ret</tt>' instruction: one that
1370 returns a value and then causes control flow, and one that just causes
1371 control flow to occur.</p>
1373 <p>The '<tt>ret</tt>' instruction may return any '<a
1374 href="#t_firstclass">first class</a>' type. Notice that a function is
1375 not <a href="#wellformed">well formed</a> if there exists a '<tt>ret</tt>'
1376 instruction inside of the function that returns a value that does not
1377 match the return type of the function.</p>
1379 <p>When the '<tt>ret</tt>' instruction is executed, control flow
1380 returns back to the calling function's context. If the caller is a "<a
1381 href="#i_call"><tt>call</tt></a>" instruction, execution continues at
1382 the instruction after the call. If the caller was an "<a
1383 href="#i_invoke"><tt>invoke</tt></a>" instruction, execution continues
1384 at the beginning of the "normal" destination block. If the instruction
1385 returns a value, that value shall set the call or invoke instruction's
1388 <pre> ret int 5 <i>; Return an integer value of 5</i>
1389 ret void <i>; Return from a void function</i>
1392 <!-- _______________________________________________________________________ -->
1393 <div class="doc_subsubsection"> <a name="i_br">'<tt>br</tt>' Instruction</a> </div>
1394 <div class="doc_text">
1396 <pre> br bool <cond>, label <iftrue>, label <iffalse><br> br label <dest> <i>; Unconditional branch</i>
1399 <p>The '<tt>br</tt>' instruction is used to cause control flow to
1400 transfer to a different basic block in the current function. There are
1401 two forms of this instruction, corresponding to a conditional branch
1402 and an unconditional branch.</p>
1404 <p>The conditional branch form of the '<tt>br</tt>' instruction takes a
1405 single '<tt>bool</tt>' value and two '<tt>label</tt>' values. The
1406 unconditional form of the '<tt>br</tt>' instruction takes a single '<tt>label</tt>'
1407 value as a target.</p>
1409 <p>Upon execution of a conditional '<tt>br</tt>' instruction, the '<tt>bool</tt>'
1410 argument is evaluated. If the value is <tt>true</tt>, control flows
1411 to the '<tt>iftrue</tt>' <tt>label</tt> argument. If "cond" is <tt>false</tt>,
1412 control flows to the '<tt>iffalse</tt>' <tt>label</tt> argument.</p>
1414 <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
1415 href="#i_ret">ret</a> int 1<br>IfUnequal:<br> <a href="#i_ret">ret</a> int 0<br></pre>
1417 <!-- _______________________________________________________________________ -->
1418 <div class="doc_subsubsection">
1419 <a name="i_switch">'<tt>switch</tt>' Instruction</a>
1422 <div class="doc_text">
1426 switch <intty> <value>, label <defaultdest> [ <intty> <val>, label <dest> ... ]
1431 <p>The '<tt>switch</tt>' instruction is used to transfer control flow to one of
1432 several different places. It is a generalization of the '<tt>br</tt>'
1433 instruction, allowing a branch to occur to one of many possible
1439 <p>The '<tt>switch</tt>' instruction uses three parameters: an integer
1440 comparison value '<tt>value</tt>', a default '<tt>label</tt>' destination, and
1441 an array of pairs of comparison value constants and '<tt>label</tt>'s. The
1442 table is not allowed to contain duplicate constant entries.</p>
1446 <p>The <tt>switch</tt> instruction specifies a table of values and
1447 destinations. When the '<tt>switch</tt>' instruction is executed, this
1448 table is searched for the given value. If the value is found, control flow is
1449 transfered to the corresponding destination; otherwise, control flow is
1450 transfered to the default destination.</p>
1452 <h5>Implementation:</h5>
1454 <p>Depending on properties of the target machine and the particular
1455 <tt>switch</tt> instruction, this instruction may be code generated in different
1456 ways. For example, it could be generated as a series of chained conditional
1457 branches or with a lookup table.</p>
1462 <i>; Emulate a conditional br instruction</i>
1463 %Val = <a href="#i_zext">zext</a> bool %value to int
1464 switch int %Val, label %truedest [int 0, label %falsedest ]
1466 <i>; Emulate an unconditional br instruction</i>
1467 switch uint 0, label %dest [ ]
1469 <i>; Implement a jump table:</i>
1470 switch uint %val, label %otherwise [ uint 0, label %onzero
1471 uint 1, label %onone
1472 uint 2, label %ontwo ]
1476 <!-- _______________________________________________________________________ -->
1477 <div class="doc_subsubsection">
1478 <a name="i_invoke">'<tt>invoke</tt>' Instruction</a>
1481 <div class="doc_text">
1486 <result> = invoke [<a href="#callingconv">cconv</a>] <ptr to function ty> %<function ptr val>(<function args>)
1487 to label <normal label> unwind label <exception label>
1492 <p>The '<tt>invoke</tt>' instruction causes control to transfer to a specified
1493 function, with the possibility of control flow transfer to either the
1494 '<tt>normal</tt>' label or the
1495 '<tt>exception</tt>' label. If the callee function returns with the
1496 "<tt><a href="#i_ret">ret</a></tt>" instruction, control flow will return to the
1497 "normal" label. If the callee (or any indirect callees) returns with the "<a
1498 href="#i_unwind"><tt>unwind</tt></a>" instruction, control is interrupted and
1499 continued at the dynamically nearest "exception" label.</p>
1503 <p>This instruction requires several arguments:</p>
1507 The optional "cconv" marker indicates which <a href="callingconv">calling
1508 convention</a> the call should use. If none is specified, the call defaults
1509 to using C calling conventions.
1511 <li>'<tt>ptr to function ty</tt>': shall be the signature of the pointer to
1512 function value being invoked. In most cases, this is a direct function
1513 invocation, but indirect <tt>invoke</tt>s are just as possible, branching off
1514 an arbitrary pointer to function value.
1517 <li>'<tt>function ptr val</tt>': An LLVM value containing a pointer to a
1518 function to be invoked. </li>
1520 <li>'<tt>function args</tt>': argument list whose types match the function
1521 signature argument types. If the function signature indicates the function
1522 accepts a variable number of arguments, the extra arguments can be
1525 <li>'<tt>normal label</tt>': the label reached when the called function
1526 executes a '<tt><a href="#i_ret">ret</a></tt>' instruction. </li>
1528 <li>'<tt>exception label</tt>': the label reached when a callee returns with
1529 the <a href="#i_unwind"><tt>unwind</tt></a> instruction. </li>
1535 <p>This instruction is designed to operate as a standard '<tt><a
1536 href="#i_call">call</a></tt>' instruction in most regards. The primary
1537 difference is that it establishes an association with a label, which is used by
1538 the runtime library to unwind the stack.</p>
1540 <p>This instruction is used in languages with destructors to ensure that proper
1541 cleanup is performed in the case of either a <tt>longjmp</tt> or a thrown
1542 exception. Additionally, this is important for implementation of
1543 '<tt>catch</tt>' clauses in high-level languages that support them.</p>
1547 %retval = invoke int %Test(int 15) to label %Continue
1548 unwind label %TestCleanup <i>; {int}:retval set</i>
1549 %retval = invoke <a href="#callingconv">coldcc</a> int %Test(int 15) to label %Continue
1550 unwind label %TestCleanup <i>; {int}:retval set</i>
1555 <!-- _______________________________________________________________________ -->
1557 <div class="doc_subsubsection"> <a name="i_unwind">'<tt>unwind</tt>'
1558 Instruction</a> </div>
1560 <div class="doc_text">
1569 <p>The '<tt>unwind</tt>' instruction unwinds the stack, continuing control flow
1570 at the first callee in the dynamic call stack which used an <a
1571 href="#i_invoke"><tt>invoke</tt></a> instruction to perform the call. This is
1572 primarily used to implement exception handling.</p>
1576 <p>The '<tt>unwind</tt>' intrinsic causes execution of the current function to
1577 immediately halt. The dynamic call stack is then searched for the first <a
1578 href="#i_invoke"><tt>invoke</tt></a> instruction on the call stack. Once found,
1579 execution continues at the "exceptional" destination block specified by the
1580 <tt>invoke</tt> instruction. If there is no <tt>invoke</tt> instruction in the
1581 dynamic call chain, undefined behavior results.</p>
1584 <!-- _______________________________________________________________________ -->
1586 <div class="doc_subsubsection"> <a name="i_unreachable">'<tt>unreachable</tt>'
1587 Instruction</a> </div>
1589 <div class="doc_text">
1598 <p>The '<tt>unreachable</tt>' instruction has no defined semantics. This
1599 instruction is used to inform the optimizer that a particular portion of the
1600 code is not reachable. This can be used to indicate that the code after a
1601 no-return function cannot be reached, and other facts.</p>
1605 <p>The '<tt>unreachable</tt>' instruction has no defined semantics.</p>
1610 <!-- ======================================================================= -->
1611 <div class="doc_subsection"> <a name="binaryops">Binary Operations</a> </div>
1612 <div class="doc_text">
1613 <p>Binary operators are used to do most of the computation in a
1614 program. They require two operands, execute an operation on them, and
1615 produce a single value. The operands might represent
1616 multiple data, as is the case with the <a href="#t_packed">packed</a> data type.
1617 The result value of a binary operator is not
1618 necessarily the same type as its operands.</p>
1619 <p>There are several different binary operators:</p>
1621 <!-- _______________________________________________________________________ -->
1622 <div class="doc_subsubsection"> <a name="i_add">'<tt>add</tt>'
1623 Instruction</a> </div>
1624 <div class="doc_text">
1626 <pre> <result> = add <ty> <var1>, <var2> <i>; yields {ty}:result</i>
1629 <p>The '<tt>add</tt>' instruction returns the sum of its two operands.</p>
1631 <p>The two arguments to the '<tt>add</tt>' instruction must be either <a
1632 href="#t_integer">integer</a> or <a href="#t_floating">floating point</a> values.
1633 This instruction can also take <a href="#t_packed">packed</a> versions of the values.
1634 Both arguments must have identical types.</p>
1636 <p>The value produced is the integer or floating point sum of the two
1639 <pre> <result> = add int 4, %var <i>; yields {int}:result = 4 + %var</i>
1642 <!-- _______________________________________________________________________ -->
1643 <div class="doc_subsubsection"> <a name="i_sub">'<tt>sub</tt>'
1644 Instruction</a> </div>
1645 <div class="doc_text">
1647 <pre> <result> = sub <ty> <var1>, <var2> <i>; yields {ty}:result</i>
1650 <p>The '<tt>sub</tt>' instruction returns the difference of its two
1652 <p>Note that the '<tt>sub</tt>' instruction is used to represent the '<tt>neg</tt>'
1653 instruction present in most other intermediate representations.</p>
1655 <p>The two arguments to the '<tt>sub</tt>' instruction must be either <a
1656 href="#t_integer">integer</a> or <a href="#t_floating">floating point</a>
1658 This instruction can also take <a href="#t_packed">packed</a> versions of the values.
1659 Both arguments must have identical types.</p>
1661 <p>The value produced is the integer or floating point difference of
1662 the two operands.</p>
1664 <pre> <result> = sub int 4, %var <i>; yields {int}:result = 4 - %var</i>
1665 <result> = sub int 0, %val <i>; yields {int}:result = -%var</i>
1668 <!-- _______________________________________________________________________ -->
1669 <div class="doc_subsubsection"> <a name="i_mul">'<tt>mul</tt>'
1670 Instruction</a> </div>
1671 <div class="doc_text">
1673 <pre> <result> = mul <ty> <var1>, <var2> <i>; yields {ty}:result</i>
1676 <p>The '<tt>mul</tt>' instruction returns the product of its two
1679 <p>The two arguments to the '<tt>mul</tt>' instruction must be either <a
1680 href="#t_integer">integer</a> or <a href="#t_floating">floating point</a>
1682 This instruction can also take <a href="#t_packed">packed</a> versions of the values.
1683 Both arguments must have identical types.</p>
1685 <p>The value produced is the integer or floating point product of the
1687 <p>There is no signed vs unsigned multiplication. The appropriate
1688 action is taken based on the type of the operand.</p>
1690 <pre> <result> = mul int 4, %var <i>; yields {int}:result = 4 * %var</i>
1693 <!-- _______________________________________________________________________ -->
1694 <div class="doc_subsubsection"> <a name="i_udiv">'<tt>udiv</tt>' Instruction
1696 <div class="doc_text">
1698 <pre> <result> = udiv <ty> <var1>, <var2> <i>; yields {ty}:result</i>
1701 <p>The '<tt>udiv</tt>' instruction returns the quotient of its two
1704 <p>The two arguments to the '<tt>udiv</tt>' instruction must be
1705 <a href="#t_integer">integer</a> values. Both arguments must have identical
1706 types. This instruction can also take <a href="#t_packed">packed</a> versions
1707 of the values in which case the elements must be integers.</p>
1709 <p>The value produced is the unsigned integer quotient of the two operands. This
1710 instruction always performs an unsigned division operation, regardless of
1711 whether the arguments are unsigned or not.</p>
1713 <pre> <result> = udiv uint 4, %var <i>; yields {uint}:result = 4 / %var</i>
1716 <!-- _______________________________________________________________________ -->
1717 <div class="doc_subsubsection"> <a name="i_sdiv">'<tt>sdiv</tt>' Instruction
1719 <div class="doc_text">
1721 <pre> <result> = sdiv <ty> <var1>, <var2> <i>; yields {ty}:result</i>
1724 <p>The '<tt>sdiv</tt>' instruction returns the quotient of its two
1727 <p>The two arguments to the '<tt>sdiv</tt>' instruction must be
1728 <a href="#t_integer">integer</a> values. Both arguments must have identical
1729 types. This instruction can also take <a href="#t_packed">packed</a> versions
1730 of the values in which case the elements must be integers.</p>
1732 <p>The value produced is the signed integer quotient of the two operands. This
1733 instruction always performs a signed division operation, regardless of whether
1734 the arguments are signed or not.</p>
1736 <pre> <result> = sdiv int 4, %var <i>; yields {int}:result = 4 / %var</i>
1739 <!-- _______________________________________________________________________ -->
1740 <div class="doc_subsubsection"> <a name="i_fdiv">'<tt>fdiv</tt>'
1741 Instruction</a> </div>
1742 <div class="doc_text">
1744 <pre> <result> = fdiv <ty> <var1>, <var2> <i>; yields {ty}:result</i>
1747 <p>The '<tt>fdiv</tt>' instruction returns the quotient of its two
1750 <p>The two arguments to the '<tt>div</tt>' instruction must be
1751 <a href="#t_floating">floating point</a> values. Both arguments must have
1752 identical types. This instruction can also take <a href="#t_packed">packed</a>
1753 versions of the values in which case the elements must be floating point.</p>
1755 <p>The value produced is the floating point quotient of the two operands.</p>
1757 <pre> <result> = fdiv float 4.0, %var <i>; yields {float}:result = 4.0 / %var</i>
1760 <!-- _______________________________________________________________________ -->
1761 <div class="doc_subsubsection"> <a name="i_urem">'<tt>urem</tt>' Instruction</a>
1763 <div class="doc_text">
1765 <pre> <result> = urem <ty> <var1>, <var2> <i>; yields {ty}:result</i>
1768 <p>The '<tt>urem</tt>' instruction returns the remainder from the
1769 unsigned division of its two arguments.</p>
1771 <p>The two arguments to the '<tt>urem</tt>' instruction must be
1772 <a href="#t_integer">integer</a> values. Both arguments must have identical
1775 <p>This instruction returns the unsigned integer <i>remainder</i> of a division.
1776 This instruction always performs an unsigned division to get the remainder,
1777 regardless of whether the arguments are unsigned or not.</p>
1779 <pre> <result> = urem uint 4, %var <i>; yields {uint}:result = 4 % %var</i>
1783 <!-- _______________________________________________________________________ -->
1784 <div class="doc_subsubsection"> <a name="i_srem">'<tt>srem</tt>'
1785 Instruction</a> </div>
1786 <div class="doc_text">
1788 <pre> <result> = srem <ty> <var1>, <var2> <i>; yields {ty}:result</i>
1791 <p>The '<tt>srem</tt>' instruction returns the remainder from the
1792 signed division of its two operands.</p>
1794 <p>The two arguments to the '<tt>srem</tt>' instruction must be
1795 <a href="#t_integer">integer</a> values. Both arguments must have identical
1798 <p>This instruction returns the <i>remainder</i> of a division (where the result
1799 has the same sign as the divisor), not the <i>modulus</i> (where the
1800 result has the same sign as the dividend) of a value. For more
1801 information about the difference, see <a
1802 href="http://mathforum.org/dr.math/problems/anne.4.28.99.html">The
1805 <pre> <result> = srem int 4, %var <i>; yields {int}:result = 4 % %var</i>
1809 <!-- _______________________________________________________________________ -->
1810 <div class="doc_subsubsection"> <a name="i_frem">'<tt>frem</tt>'
1811 Instruction</a> </div>
1812 <div class="doc_text">
1814 <pre> <result> = frem <ty> <var1>, <var2> <i>; yields {ty}:result</i>
1817 <p>The '<tt>frem</tt>' instruction returns the remainder from the
1818 division of its two operands.</p>
1820 <p>The two arguments to the '<tt>frem</tt>' instruction must be
1821 <a href="#t_floating">floating point</a> values. Both arguments must have
1822 identical types.</p>
1824 <p>This instruction returns the <i>remainder</i> of a division.</p>
1826 <pre> <result> = frem float 4.0, %var <i>; yields {float}:result = 4.0 % %var</i>
1830 <!-- _______________________________________________________________________ -->
1831 <div class="doc_subsubsection"> <a name="i_setcc">'<tt>set<i>cc</i></tt>'
1832 Instructions</a> </div>
1833 <div class="doc_text">
1835 <pre> <result> = seteq <ty> <var1>, <var2> <i>; yields {bool}:result</i>
1836 <result> = setne <ty> <var1>, <var2> <i>; yields {bool}:result</i>
1837 <result> = setlt <ty> <var1>, <var2> <i>; yields {bool}:result</i>
1838 <result> = setgt <ty> <var1>, <var2> <i>; yields {bool}:result</i>
1839 <result> = setle <ty> <var1>, <var2> <i>; yields {bool}:result</i>
1840 <result> = setge <ty> <var1>, <var2> <i>; yields {bool}:result</i>
1843 <p>The '<tt>set<i>cc</i></tt>' family of instructions returns a boolean
1844 value based on a comparison of their two operands.</p>
1846 <p>The two arguments to the '<tt>set<i>cc</i></tt>' instructions must
1847 be of <a href="#t_firstclass">first class</a> type (it is not possible
1848 to compare '<tt>label</tt>'s, '<tt>array</tt>'s, '<tt>structure</tt>'
1849 or '<tt>void</tt>' values, etc...). Both arguments must have identical
1852 <p>The '<tt>seteq</tt>' instruction yields a <tt>true</tt> '<tt>bool</tt>'
1853 value if both operands are equal.<br>
1854 The '<tt>setne</tt>' instruction yields a <tt>true</tt> '<tt>bool</tt>'
1855 value if both operands are unequal.<br>
1856 The '<tt>setlt</tt>' instruction yields a <tt>true</tt> '<tt>bool</tt>'
1857 value if the first operand is less than the second operand.<br>
1858 The '<tt>setgt</tt>' instruction yields a <tt>true</tt> '<tt>bool</tt>'
1859 value if the first operand is greater than the second operand.<br>
1860 The '<tt>setle</tt>' instruction yields a <tt>true</tt> '<tt>bool</tt>'
1861 value if the first operand is less than or equal to the second operand.<br>
1862 The '<tt>setge</tt>' instruction yields a <tt>true</tt> '<tt>bool</tt>'
1863 value if the first operand is greater than or equal to the second
1866 <pre> <result> = seteq int 4, 5 <i>; yields {bool}:result = false</i>
1867 <result> = setne float 4, 5 <i>; yields {bool}:result = true</i>
1868 <result> = setlt uint 4, 5 <i>; yields {bool}:result = true</i>
1869 <result> = setgt sbyte 4, 5 <i>; yields {bool}:result = false</i>
1870 <result> = setle sbyte 4, 5 <i>; yields {bool}:result = true</i>
1871 <result> = setge sbyte 4, 5 <i>; yields {bool}:result = false</i>
1875 <!-- ======================================================================= -->
1876 <div class="doc_subsection"> <a name="bitwiseops">Bitwise Binary
1877 Operations</a> </div>
1878 <div class="doc_text">
1879 <p>Bitwise binary operators are used to do various forms of
1880 bit-twiddling in a program. They are generally very efficient
1881 instructions and can commonly be strength reduced from other
1882 instructions. They require two operands, execute an operation on them,
1883 and produce a single value. The resulting value of the bitwise binary
1884 operators is always the same type as its first operand.</p>
1886 <!-- _______________________________________________________________________ -->
1887 <div class="doc_subsubsection"> <a name="i_and">'<tt>and</tt>'
1888 Instruction</a> </div>
1889 <div class="doc_text">
1891 <pre> <result> = and <ty> <var1>, <var2> <i>; yields {ty}:result</i>
1894 <p>The '<tt>and</tt>' instruction returns the bitwise logical and of
1895 its two operands.</p>
1897 <p>The two arguments to the '<tt>and</tt>' instruction must be <a
1898 href="#t_integral">integral</a> values. Both arguments must have
1899 identical types.</p>
1901 <p>The truth table used for the '<tt>and</tt>' instruction is:</p>
1903 <div style="align: center">
1904 <table border="1" cellspacing="0" cellpadding="4">
1935 <pre> <result> = and int 4, %var <i>; yields {int}:result = 4 & %var</i>
1936 <result> = and int 15, 40 <i>; yields {int}:result = 8</i>
1937 <result> = and int 4, 8 <i>; yields {int}:result = 0</i>
1940 <!-- _______________________________________________________________________ -->
1941 <div class="doc_subsubsection"> <a name="i_or">'<tt>or</tt>' Instruction</a> </div>
1942 <div class="doc_text">
1944 <pre> <result> = or <ty> <var1>, <var2> <i>; yields {ty}:result</i>
1947 <p>The '<tt>or</tt>' instruction returns the bitwise logical inclusive
1948 or of its two operands.</p>
1950 <p>The two arguments to the '<tt>or</tt>' instruction must be <a
1951 href="#t_integral">integral</a> values. Both arguments must have
1952 identical types.</p>
1954 <p>The truth table used for the '<tt>or</tt>' instruction is:</p>
1956 <div style="align: center">
1957 <table border="1" cellspacing="0" cellpadding="4">
1988 <pre> <result> = or int 4, %var <i>; yields {int}:result = 4 | %var</i>
1989 <result> = or int 15, 40 <i>; yields {int}:result = 47</i>
1990 <result> = or int 4, 8 <i>; yields {int}:result = 12</i>
1993 <!-- _______________________________________________________________________ -->
1994 <div class="doc_subsubsection"> <a name="i_xor">'<tt>xor</tt>'
1995 Instruction</a> </div>
1996 <div class="doc_text">
1998 <pre> <result> = xor <ty> <var1>, <var2> <i>; yields {ty}:result</i>
2001 <p>The '<tt>xor</tt>' instruction returns the bitwise logical exclusive
2002 or of its two operands. The <tt>xor</tt> is used to implement the
2003 "one's complement" operation, which is the "~" operator in C.</p>
2005 <p>The two arguments to the '<tt>xor</tt>' instruction must be <a
2006 href="#t_integral">integral</a> values. Both arguments must have
2007 identical types.</p>
2009 <p>The truth table used for the '<tt>xor</tt>' instruction is:</p>
2011 <div style="align: center">
2012 <table border="1" cellspacing="0" cellpadding="4">
2044 <pre> <result> = xor int 4, %var <i>; yields {int}:result = 4 ^ %var</i>
2045 <result> = xor int 15, 40 <i>; yields {int}:result = 39</i>
2046 <result> = xor int 4, 8 <i>; yields {int}:result = 12</i>
2047 <result> = xor int %V, -1 <i>; yields {int}:result = ~%V</i>
2050 <!-- _______________________________________________________________________ -->
2051 <div class="doc_subsubsection"> <a name="i_shl">'<tt>shl</tt>'
2052 Instruction</a> </div>
2053 <div class="doc_text">
2055 <pre> <result> = shl <ty> <var1>, ubyte <var2> <i>; yields {ty}:result</i>
2058 <p>The '<tt>shl</tt>' instruction returns the first operand shifted to
2059 the left a specified number of bits.</p>
2061 <p>The first argument to the '<tt>shl</tt>' instruction must be an <a
2062 href="#t_integer">integer</a> type. The second argument must be an '<tt>ubyte</tt>'
2065 <p>The value produced is <tt>var1</tt> * 2<sup><tt>var2</tt></sup>.</p>
2067 <pre> <result> = shl int 4, ubyte %var <i>; yields {int}:result = 4 << %var</i>
2068 <result> = shl int 4, ubyte 2 <i>; yields {int}:result = 16</i>
2069 <result> = shl int 1, ubyte 10 <i>; yields {int}:result = 1024</i>
2072 <!-- _______________________________________________________________________ -->
2073 <div class="doc_subsubsection"> <a name="i_shr">'<tt>shr</tt>'
2074 Instruction</a> </div>
2075 <div class="doc_text">
2077 <pre> <result> = shr <ty> <var1>, ubyte <var2> <i>; yields {ty}:result</i>
2080 <p>The '<tt>shr</tt>' instruction returns the first operand shifted to
2081 the right a specified number of bits.</p>
2083 <p>The first argument to the '<tt>shr</tt>' instruction must be an <a
2084 href="#t_integer">integer</a> type. The second argument must be an '<tt>ubyte</tt>'
2087 <p>If the first argument is a <a href="#t_signed">signed</a> type, the
2088 most significant bit is duplicated in the newly free'd bit positions.
2089 If the first argument is unsigned, zero bits shall fill the empty
2092 <pre> <result> = shr int 4, ubyte %var <i>; yields {int}:result = 4 >> %var</i>
2093 <result> = shr uint 4, ubyte 1 <i>; yields {uint}:result = 2</i>
2094 <result> = shr int 4, ubyte 2 <i>; yields {int}:result = 1</i>
2095 <result> = shr sbyte 4, ubyte 3 <i>; yields {sbyte}:result = 0</i>
2096 <result> = shr sbyte -2, ubyte 1 <i>; yields {sbyte}:result = -1</i>
2100 <!-- ======================================================================= -->
2101 <div class="doc_subsection">
2102 <a name="vectorops">Vector Operations</a>
2105 <div class="doc_text">
2107 <p>LLVM supports several instructions to represent vector operations in a
2108 target-independent manner. This instructions cover the element-access and
2109 vector-specific operations needed to process vectors effectively. While LLVM
2110 does directly support these vector operations, many sophisticated algorithms
2111 will want to use target-specific intrinsics to take full advantage of a specific
2116 <!-- _______________________________________________________________________ -->
2117 <div class="doc_subsubsection">
2118 <a name="i_extractelement">'<tt>extractelement</tt>' Instruction</a>
2121 <div class="doc_text">
2126 <result> = extractelement <n x <ty>> <val>, uint <idx> <i>; yields <ty></i>
2132 The '<tt>extractelement</tt>' instruction extracts a single scalar
2133 element from a packed vector at a specified index.
2140 The first operand of an '<tt>extractelement</tt>' instruction is a
2141 value of <a href="#t_packed">packed</a> type. The second operand is
2142 an index indicating the position from which to extract the element.
2143 The index may be a variable.</p>
2148 The result is a scalar of the same type as the element type of
2149 <tt>val</tt>. Its value is the value at position <tt>idx</tt> of
2150 <tt>val</tt>. If <tt>idx</tt> exceeds the length of <tt>val</tt>, the
2151 results are undefined.
2157 %result = extractelement <4 x int> %vec, uint 0 <i>; yields int</i>
2162 <!-- _______________________________________________________________________ -->
2163 <div class="doc_subsubsection">
2164 <a name="i_insertelement">'<tt>insertelement</tt>' Instruction</a>
2167 <div class="doc_text">
2172 <result> = insertelement <n x <ty>> <val>, <ty> <elt>, uint <idx> <i>; yields <n x <ty>></i>
2178 The '<tt>insertelement</tt>' instruction inserts a scalar
2179 element into a packed vector at a specified index.
2186 The first operand of an '<tt>insertelement</tt>' instruction is a
2187 value of <a href="#t_packed">packed</a> type. The second operand is a
2188 scalar value whose type must equal the element type of the first
2189 operand. The third operand is an index indicating the position at
2190 which to insert the value. The index may be a variable.</p>
2195 The result is a packed vector of the same type as <tt>val</tt>. Its
2196 element values are those of <tt>val</tt> except at position
2197 <tt>idx</tt>, where it gets the value <tt>elt</tt>. If <tt>idx</tt>
2198 exceeds the length of <tt>val</tt>, the results are undefined.
2204 %result = insertelement <4 x int> %vec, int 1, uint 0 <i>; yields <4 x int></i>
2208 <!-- _______________________________________________________________________ -->
2209 <div class="doc_subsubsection">
2210 <a name="i_shufflevector">'<tt>shufflevector</tt>' Instruction</a>
2213 <div class="doc_text">
2218 <result> = shufflevector <n x <ty>> <v1>, <n x <ty>> <v2>, <n x uint> <mask> <i>; yields <n x <ty>></i>
2224 The '<tt>shufflevector</tt>' instruction constructs a permutation of elements
2225 from two input vectors, returning a vector of the same type.
2231 The first two operands of a '<tt>shufflevector</tt>' instruction are vectors
2232 with types that match each other and types that match the result of the
2233 instruction. The third argument is a shuffle mask, which has the same number
2234 of elements as the other vector type, but whose element type is always 'uint'.
2238 The shuffle mask operand is required to be a constant vector with either
2239 constant integer or undef values.
2245 The elements of the two input vectors are numbered from left to right across
2246 both of the vectors. The shuffle mask operand specifies, for each element of
2247 the result vector, which element of the two input registers the result element
2248 gets. The element selector may be undef (meaning "don't care") and the second
2249 operand may be undef if performing a shuffle from only one vector.
2255 %result = shufflevector <4 x int> %v1, <4 x int> %v2,
2256 <4 x uint> <uint 0, uint 4, uint 1, uint 5> <i>; yields <4 x int></i>
2257 %result = shufflevector <4 x int> %v1, <4 x int> undef,
2258 <4 x uint> <uint 0, uint 1, uint 2, uint 3> <i>; yields <4 x int></i> - Identity shuffle.
2263 <!-- _______________________________________________________________________ -->
2264 <div class="doc_subsubsection"> <a name="i_vsetint">'<tt>vsetint</tt>'
2265 Instruction</a> </div>
2266 <div class="doc_text">
2268 <pre><result> = vsetint <op>, <n x <ty>> <var1>, <var2> <i>; yields <n x bool></i>
2273 <p>The '<tt>vsetint</tt>' instruction takes two integer vectors and
2274 returns a vector of boolean values representing, at each position, the
2275 result of the comparison between the values at that position in the
2280 <p>The arguments to a '<tt>vsetint</tt>' instruction are a comparison
2281 operation and two value arguments. The value arguments must be of <a
2282 href="#t_integral">integral</a> <a href="#t_packed">packed</a> type,
2283 and they must have identical types. The operation argument must be
2284 one of <tt>eq</tt>, <tt>ne</tt>, <tt>slt</tt>, <tt>sgt</tt>,
2285 <tt>sle</tt>, <tt>sge</tt>, <tt>ult</tt>, <tt>ugt</tt>, <tt>ule</tt>,
2286 <tt>uge</tt>, <tt>true</tt>, and <tt>false</tt>. The result is a
2287 packed <tt>bool</tt> value with the same length as each operand.</p>
2291 <p>The following table shows the semantics of '<tt>vsetint</tt>'. For
2292 each position of the result, the comparison is done on the
2293 corresponding positions of the two value arguments. Note that the
2294 signedness of the comparison depends on the comparison opcode and
2295 <i>not</i> on the signedness of the value operands. E.g., <tt>vsetint
2296 slt <4 x unsigned> %x, %y</tt> does an elementwise <i>signed</i>
2297 comparison of <tt>%x</tt> and <tt>%y</tt>.</p>
2299 <table border="1" cellspacing="0" cellpadding="4">
2301 <tr><th>Operation</th><th>Result is true iff</th><th>Comparison is</th></tr>
2302 <tr><td><tt>eq</tt></td><td>var1 == var2</td><td>--</td></tr>
2303 <tr><td><tt>ne</tt></td><td>var1 != var2</td><td>--</td></tr>
2304 <tr><td><tt>slt</tt></td><td>var1 < var2</td><td>signed</td></tr>
2305 <tr><td><tt>sgt</tt></td><td>var1 > var2</td><td>signed</td></tr>
2306 <tr><td><tt>sle</tt></td><td>var1 <= var2</td><td>signed</td></tr>
2307 <tr><td><tt>sge</tt></td><td>var1 >= var2</td><td>signed</td></tr>
2308 <tr><td><tt>ult</tt></td><td>var1 < var2</td><td>unsigned</td></tr>
2309 <tr><td><tt>ugt</tt></td><td>var1 > var2</td><td>unsigned</td></tr>
2310 <tr><td><tt>ule</tt></td><td>var1 <= var2</td><td>unsigned</td></tr>
2311 <tr><td><tt>uge</tt></td><td>var1 >= var2</td><td>unsigned</td></tr>
2312 <tr><td><tt>true</tt></td><td>always</td><td>--</td></tr>
2313 <tr><td><tt>false</tt></td><td>never</td><td>--</td></tr>
2318 <pre> <result> = vsetint eq <2 x int> <int 0, int 1>, <int 1, int 0> <i>; yields {<2 x bool>}:result = false, false</i>
2319 <result> = vsetint ne <2 x int> <int 0, int 1>, <int 1, int 0> <i>; yields {<2 x bool>}:result = true, true</i>
2320 <result> = vsetint slt <2 x int> <int 0, int 1>, <int 1, int 0> <i>; yields {<2 x bool>}:result = true, false</i>
2321 <result> = vsetint sgt <2 x int> <int 0, int 1>, <int 1, int 0> <i>; yields {<2 x bool>}:result = false, true</i>
2322 <result> = vsetint sle <2 x int> <int 0, int 1>, <int 1, int 0> <i>; yields {<2 x bool>}:result = true, false</i>
2323 <result> = vsetint sge <2 x int> <int 0, int 1>, <int 1, int 0> <i>; yields {<2 x bool>}:result = false, true</i>
2327 <!-- _______________________________________________________________________ -->
2328 <div class="doc_subsubsection"> <a name="i_vsetfp">'<tt>vsetfp</tt>'
2329 Instruction</a> </div>
2330 <div class="doc_text">
2332 <pre><result> = vsetfp <op>, <n x <ty>> <var1>, <var2> <i>; yields <n x bool></i>
2337 <p>The '<tt>vsetfp</tt>' instruction takes two floating point vector
2338 arguments and returns a vector of boolean values representing, at each
2339 position, the result of the comparison between the values at that
2340 position in the two operands.</p>
2344 <p>The arguments to a '<tt>vsetfp</tt>' instruction are a comparison
2345 operation and two value arguments. The value arguments must be of <a
2346 href="t_floating">floating point</a> <a href="#t_packed">packed</a>
2347 type, and they must have identical types. The operation argument must
2348 be one of <tt>eq</tt>, <tt>ne</tt>, <tt>lt</tt>, <tt>gt</tt>,
2349 <tt>le</tt>, <tt>ge</tt>, <tt>oeq</tt>, <tt>one</tt>, <tt>olt</tt>,
2350 <tt>ogt</tt>, <tt>ole</tt>, <tt>oge</tt>, <tt>ueq</tt>, <tt>une</tt>,
2351 <tt>ult</tt>, <tt>ugt</tt>, <tt>ule</tt>, <tt>uge</tt>, <tt>o</tt>,
2352 <tt>u</tt>, <tt>true</tt>, and <tt>false</tt>. The result is a packed
2353 <tt>bool</tt> value with the same length as each operand.</p>
2357 <p>The following table shows the semantics of '<tt>vsetfp</tt>' for
2358 floating point types. If either operand is a floating point Not a
2359 Number (NaN) value, the operation is unordered, and the value in the
2360 first column below is produced at that position. Otherwise, the
2361 operation is ordered, and the value in the second column is
2364 <table border="1" cellspacing="0" cellpadding="4">
2366 <tr><th>Operation</th><th>If unordered<th>Otherwise true iff</th></tr>
2367 <tr><td><tt>eq</tt></td><td>undefined</td><td>var1 == var2</td></tr>
2368 <tr><td><tt>ne</tt></td><td>undefined</td><td>var1 != var2</td></tr>
2369 <tr><td><tt>lt</tt></td><td>undefined</td><td>var1 < var2</td></tr>
2370 <tr><td><tt>gt</tt></td><td>undefined</td><td>var1 > var2</td></tr>
2371 <tr><td><tt>le</tt></td><td>undefined</td><td>var1 <= var2</td></tr>
2372 <tr><td><tt>ge</tt></td><td>undefined</td><td>var1 >= var2</td></tr>
2373 <tr><td><tt>oeq</tt></td><td>false</td><td>var1 == var2</td></tr>
2374 <tr><td><tt>one</tt></td><td>false</td><td>var1 != var2</td></tr>
2375 <tr><td><tt>olt</tt></td><td>false</td><td>var1 < var2</td></tr>
2376 <tr><td><tt>ogt</tt></td><td>false</td><td>var1 > var2</td></tr>
2377 <tr><td><tt>ole</tt></td><td>false</td><td>var1 <= var2</td></tr>
2378 <tr><td><tt>oge</tt></td><td>false</td><td>var1 >= var2</td></tr>
2379 <tr><td><tt>ueq</tt></td><td>true</td><td>var1 == var2</td></tr>
2380 <tr><td><tt>une</tt></td><td>true</td><td>var1 != var2</td></tr>
2381 <tr><td><tt>ult</tt></td><td>true</td><td>var1 < var2</td></tr>
2382 <tr><td><tt>ugt</tt></td><td>true</td><td>var1 > var2</td></tr>
2383 <tr><td><tt>ule</tt></td><td>true</td><td>var1 <= var2</td></tr>
2384 <tr><td><tt>uge</tt></td><td>true</td><td>var1 >= var2</td></tr>
2385 <tr><td><tt>o</tt></td><td>false</td><td>always</td></tr>
2386 <tr><td><tt>u</tt></td><td>true</td><td>never</td></tr>
2387 <tr><td><tt>true</tt></td><td>true</td><td>always</td></tr>
2388 <tr><td><tt>false</tt></td><td>false</td><td>never</td></tr>
2393 <pre> <result> = vsetfp eq <2 x float> <float 0.0, float 1.0>, <float 1.0, float 0.0> <i>; yields {<2 x bool>}:result = false, false</i>
2394 <result> = vsetfp ne <2 x float> <float 0.0, float 1.0>, <float 1.0, float 0.0> <i>; yields {<2 x bool>}:result = true, true</i>
2395 <result> = vsetfp lt <2 x float> <float 0.0, float 1.0>, <float 1.0, float 0.0> <i>; yields {<2 x bool>}:result = true, false</i>
2396 <result> = vsetfp gt <2 x float> <float 0.0, float 1.0>, <float 1.0, float 0.0> <i>; yields {<2 x bool>}:result = false, true</i>
2397 <result> = vsetfp le <2 x float> <float 0.0, float 1.0>, <float 1.0, float 0.0> <i>; yields {<2 x bool>}:result = true, false</i>
2398 <result> = vsetfp ge <2 x float> <float 0.0, float 1.0>, <float 1.0, float 0.0> <i>; yields {<2 x bool>}:result = false, true</i>
2402 <!-- _______________________________________________________________________ -->
2403 <div class="doc_subsubsection">
2404 <a name="i_vselect">'<tt>vselect</tt>' Instruction</a>
2407 <div class="doc_text">
2412 <result> = vselect <n x bool> <cond>, <n x <ty>> <val1>, <n x <ty>> <val2> <i>; yields <n x <ty>></i>
2418 The '<tt>vselect</tt>' instruction chooses one value at each position
2419 of a vector based on a condition.
2426 The '<tt>vselect</tt>' instruction requires a <a
2427 href="#t_packed">packed</a> <tt>bool</tt> value indicating the
2428 condition at each vector position, and two values of the same packed
2429 type. All three operands must have the same length. The type of the
2430 result is the same as the type of the two value operands.</p>
2435 At each position where the <tt>bool</tt> vector is true, that position
2436 of the result gets its value from the first value argument; otherwise,
2437 it gets its value from the second value argument.
2443 %X = vselect bool <2 x bool> <bool true, bool false>, <2 x ubyte> <ubyte 17, ubyte 17>,
2444 <2 x ubyte> <ubyte 42, ubyte 42> <i>; yields <2 x ubyte>:17, 42</i>
2450 <!-- ======================================================================= -->
2451 <div class="doc_subsection">
2452 <a name="memoryops">Memory Access and Addressing Operations</a>
2455 <div class="doc_text">
2457 <p>A key design point of an SSA-based representation is how it
2458 represents memory. In LLVM, no memory locations are in SSA form, which
2459 makes things very simple. This section describes how to read, write,
2460 allocate, and free memory in LLVM.</p>
2464 <!-- _______________________________________________________________________ -->
2465 <div class="doc_subsubsection">
2466 <a name="i_malloc">'<tt>malloc</tt>' Instruction</a>
2469 <div class="doc_text">
2474 <result> = malloc <type>[, uint <NumElements>][, align <alignment>] <i>; yields {type*}:result</i>
2479 <p>The '<tt>malloc</tt>' instruction allocates memory from the system
2480 heap and returns a pointer to it.</p>
2484 <p>The '<tt>malloc</tt>' instruction allocates
2485 <tt>sizeof(<type>)*NumElements</tt>
2486 bytes of memory from the operating system and returns a pointer of the
2487 appropriate type to the program. If "NumElements" is specified, it is the
2488 number of elements allocated. If an alignment is specified, the value result
2489 of the allocation is guaranteed to be aligned to at least that boundary. If
2490 not specified, or if zero, the target can choose to align the allocation on any
2491 convenient boundary.</p>
2493 <p>'<tt>type</tt>' must be a sized type.</p>
2497 <p>Memory is allocated using the system "<tt>malloc</tt>" function, and
2498 a pointer is returned.</p>
2503 %array = malloc [4 x ubyte ] <i>; yields {[%4 x ubyte]*}:array</i>
2505 %size = <a href="#i_add">add</a> uint 2, 2 <i>; yields {uint}:size = uint 4</i>
2506 %array1 = malloc ubyte, uint 4 <i>; yields {ubyte*}:array1</i>
2507 %array2 = malloc [12 x ubyte], uint %size <i>; yields {[12 x ubyte]*}:array2</i>
2508 %array3 = malloc int, uint 4, align 1024 <i>; yields {int*}:array3</i>
2509 %array4 = malloc int, align 1024 <i>; yields {int*}:array4</i>
2513 <!-- _______________________________________________________________________ -->
2514 <div class="doc_subsubsection">
2515 <a name="i_free">'<tt>free</tt>' Instruction</a>
2518 <div class="doc_text">
2523 free <type> <value> <i>; yields {void}</i>
2528 <p>The '<tt>free</tt>' instruction returns memory back to the unused
2529 memory heap to be reallocated in the future.</p>
2533 <p>'<tt>value</tt>' shall be a pointer value that points to a value
2534 that was allocated with the '<tt><a href="#i_malloc">malloc</a></tt>'
2539 <p>Access to the memory pointed to by the pointer is no longer defined
2540 after this instruction executes.</p>
2545 %array = <a href="#i_malloc">malloc</a> [4 x ubyte] <i>; yields {[4 x ubyte]*}:array</i>
2546 free [4 x ubyte]* %array
2550 <!-- _______________________________________________________________________ -->
2551 <div class="doc_subsubsection">
2552 <a name="i_alloca">'<tt>alloca</tt>' Instruction</a>
2555 <div class="doc_text">
2560 <result> = alloca <type>[, uint <NumElements>][, align <alignment>] <i>; yields {type*}:result</i>
2565 <p>The '<tt>alloca</tt>' instruction allocates memory on the current
2566 stack frame of the procedure that is live until the current function
2567 returns to its caller.</p>
2571 <p>The '<tt>alloca</tt>' instruction allocates <tt>sizeof(<type>)*NumElements</tt>
2572 bytes of memory on the runtime stack, returning a pointer of the
2573 appropriate type to the program. If "NumElements" is specified, it is the
2574 number of elements allocated. If an alignment is specified, the value result
2575 of the allocation is guaranteed to be aligned to at least that boundary. If
2576 not specified, or if zero, the target can choose to align the allocation on any
2577 convenient boundary.</p>
2579 <p>'<tt>type</tt>' may be any sized type.</p>
2583 <p>Memory is allocated; a pointer is returned. '<tt>alloca</tt>'d
2584 memory is automatically released when the function returns. The '<tt>alloca</tt>'
2585 instruction is commonly used to represent automatic variables that must
2586 have an address available. When the function returns (either with the <tt><a
2587 href="#i_ret">ret</a></tt> or <tt><a href="#i_unwind">unwind</a></tt>
2588 instructions), the memory is reclaimed.</p>
2593 %ptr = alloca int <i>; yields {int*}:ptr</i>
2594 %ptr = alloca int, uint 4 <i>; yields {int*}:ptr</i>
2595 %ptr = alloca int, uint 4, align 1024 <i>; yields {int*}:ptr</i>
2596 %ptr = alloca int, align 1024 <i>; yields {int*}:ptr</i>
2600 <!-- _______________________________________________________________________ -->
2601 <div class="doc_subsubsection"> <a name="i_load">'<tt>load</tt>'
2602 Instruction</a> </div>
2603 <div class="doc_text">
2605 <pre> <result> = load <ty>* <pointer><br> <result> = volatile load <ty>* <pointer><br></pre>
2607 <p>The '<tt>load</tt>' instruction is used to read from memory.</p>
2609 <p>The argument to the '<tt>load</tt>' instruction specifies the memory
2610 address from which to load. The pointer must point to a <a
2611 href="#t_firstclass">first class</a> type. If the <tt>load</tt> is
2612 marked as <tt>volatile</tt>, then the optimizer is not allowed to modify
2613 the number or order of execution of this <tt>load</tt> with other
2614 volatile <tt>load</tt> and <tt><a href="#i_store">store</a></tt>
2617 <p>The location of memory pointed to is loaded.</p>
2619 <pre> %ptr = <a href="#i_alloca">alloca</a> int <i>; yields {int*}:ptr</i>
2621 href="#i_store">store</a> int 3, int* %ptr <i>; yields {void}</i>
2622 %val = load int* %ptr <i>; yields {int}:val = int 3</i>
2625 <!-- _______________________________________________________________________ -->
2626 <div class="doc_subsubsection"> <a name="i_store">'<tt>store</tt>'
2627 Instruction</a> </div>
2629 <pre> store <ty> <value>, <ty>* <pointer> <i>; yields {void}</i>
2630 volatile store <ty> <value>, <ty>* <pointer> <i>; yields {void}</i>
2633 <p>The '<tt>store</tt>' instruction is used to write to memory.</p>
2635 <p>There are two arguments to the '<tt>store</tt>' instruction: a value
2636 to store and an address in which to store it. The type of the '<tt><pointer></tt>'
2637 operand must be a pointer to the type of the '<tt><value></tt>'
2638 operand. If the <tt>store</tt> is marked as <tt>volatile</tt>, then the
2639 optimizer is not allowed to modify the number or order of execution of
2640 this <tt>store</tt> with other volatile <tt>load</tt> and <tt><a
2641 href="#i_store">store</a></tt> instructions.</p>
2643 <p>The contents of memory are updated to contain '<tt><value></tt>'
2644 at the location specified by the '<tt><pointer></tt>' operand.</p>
2646 <pre> %ptr = <a href="#i_alloca">alloca</a> int <i>; yields {int*}:ptr</i>
2648 href="#i_store">store</a> int 3, int* %ptr <i>; yields {void}</i>
2649 %val = load int* %ptr <i>; yields {int}:val = int 3</i>
2651 <!-- _______________________________________________________________________ -->
2652 <div class="doc_subsubsection">
2653 <a name="i_getelementptr">'<tt>getelementptr</tt>' Instruction</a>
2656 <div class="doc_text">
2659 <result> = getelementptr <ty>* <ptrval>{, <ty> <idx>}*
2665 The '<tt>getelementptr</tt>' instruction is used to get the address of a
2666 subelement of an aggregate data structure.</p>
2670 <p>This instruction takes a list of integer constants that indicate what
2671 elements of the aggregate object to index to. The actual types of the arguments
2672 provided depend on the type of the first pointer argument. The
2673 '<tt>getelementptr</tt>' instruction is used to index down through the type
2674 levels of a structure or to a specific index in an array. When indexing into a
2675 structure, only <tt>uint</tt>
2676 integer constants are allowed. When indexing into an array or pointer,
2677 <tt>int</tt> and <tt>long</tt> indexes are allowed of any sign.</p>
2679 <p>For example, let's consider a C code fragment and how it gets
2680 compiled to LLVM:</p>
2694 int *foo(struct ST *s) {
2695 return &s[1].Z.B[5][13];
2699 <p>The LLVM code generated by the GCC frontend is:</p>
2702 %RT = type { sbyte, [10 x [20 x int]], sbyte }
2703 %ST = type { int, double, %RT }
2707 int* %foo(%ST* %s) {
2709 %reg = getelementptr %ST* %s, int 1, uint 2, uint 1, int 5, int 13
2716 <p>The index types specified for the '<tt>getelementptr</tt>' instruction depend
2717 on the pointer type that is being indexed into. <a href="#t_pointer">Pointer</a>
2718 and <a href="#t_array">array</a> types require <tt>uint</tt>, <tt>int</tt>,
2719 <tt>ulong</tt>, or <tt>long</tt> values, and <a href="#t_struct">structure</a>
2720 types require <tt>uint</tt> <b>constants</b>.</p>
2722 <p>In the example above, the first index is indexing into the '<tt>%ST*</tt>'
2723 type, which is a pointer, yielding a '<tt>%ST</tt>' = '<tt>{ int, double, %RT
2724 }</tt>' type, a structure. The second index indexes into the third element of
2725 the structure, yielding a '<tt>%RT</tt>' = '<tt>{ sbyte, [10 x [20 x int]],
2726 sbyte }</tt>' type, another structure. The third index indexes into the second
2727 element of the structure, yielding a '<tt>[10 x [20 x int]]</tt>' type, an
2728 array. The two dimensions of the array are subscripted into, yielding an
2729 '<tt>int</tt>' type. The '<tt>getelementptr</tt>' instruction returns a pointer
2730 to this element, thus computing a value of '<tt>int*</tt>' type.</p>
2732 <p>Note that it is perfectly legal to index partially through a
2733 structure, returning a pointer to an inner element. Because of this,
2734 the LLVM code for the given testcase is equivalent to:</p>
2737 int* %foo(%ST* %s) {
2738 %t1 = getelementptr %ST* %s, int 1 <i>; yields %ST*:%t1</i>
2739 %t2 = getelementptr %ST* %t1, int 0, uint 2 <i>; yields %RT*:%t2</i>
2740 %t3 = getelementptr %RT* %t2, int 0, uint 1 <i>; yields [10 x [20 x int]]*:%t3</i>
2741 %t4 = getelementptr [10 x [20 x int]]* %t3, int 0, int 5 <i>; yields [20 x int]*:%t4</i>
2742 %t5 = getelementptr [20 x int]* %t4, int 0, int 13 <i>; yields int*:%t5</i>
2747 <p>Note that it is undefined to access an array out of bounds: array and
2748 pointer indexes must always be within the defined bounds of the array type.
2749 The one exception for this rules is zero length arrays. These arrays are
2750 defined to be accessible as variable length arrays, which requires access
2751 beyond the zero'th element.</p>
2753 <p>The getelementptr instruction is often confusing. For some more insight
2754 into how it works, see <a href="GetElementPtr.html">the getelementptr
2760 <i>; yields [12 x ubyte]*:aptr</i>
2761 %aptr = getelementptr {int, [12 x ubyte]}* %sptr, long 0, uint 1
2765 <!-- ======================================================================= -->
2766 <div class="doc_subsection"> <a name="otherops">Other Operations</a> </div>
2767 <div class="doc_text">
2768 <p>The instructions in this category are the "miscellaneous"
2769 instructions, which defy better classification.</p>
2771 <!-- _______________________________________________________________________ -->
2772 <div class="doc_subsubsection"> <a name="i_phi">'<tt>phi</tt>'
2773 Instruction</a> </div>
2774 <div class="doc_text">
2776 <pre> <result> = phi <ty> [ <val0>, <label0>], ...<br></pre>
2778 <p>The '<tt>phi</tt>' instruction is used to implement the φ node in
2779 the SSA graph representing the function.</p>
2781 <p>The type of the incoming values are specified with the first type
2782 field. After this, the '<tt>phi</tt>' instruction takes a list of pairs
2783 as arguments, with one pair for each predecessor basic block of the
2784 current block. Only values of <a href="#t_firstclass">first class</a>
2785 type may be used as the value arguments to the PHI node. Only labels
2786 may be used as the label arguments.</p>
2787 <p>There must be no non-phi instructions between the start of a basic
2788 block and the PHI instructions: i.e. PHI instructions must be first in
2791 <p>At runtime, the '<tt>phi</tt>' instruction logically takes on the
2792 value specified by the parameter, depending on which basic block we
2793 came from in the last <a href="#terminators">terminator</a> instruction.</p>
2795 <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>
2798 <!-- _______________________________________________________________________ -->
2799 <div class="doc_subsubsection">
2800 <a name="i_trunc">'<tt>trunc .. to</tt>' Instruction</a>
2802 <div class="doc_text">
2806 <result> = trunc <ty> <value> to <ty2> <i>; yields ty2</i>
2811 The '<tt>trunc</tt>' instruction truncates its operand to the type <tt>ty2</tt>.
2816 The '<tt>trunc</tt>' instruction takes a <tt>value</tt> to trunc, which must
2817 be an <a href="#t_integer">integer</a> type, and a type that specifies the size
2818 and type of the result, which must be an <a href="#t_integral">integral</a>
2823 The '<tt>trunc</tt>' instruction truncates the high order bits in <tt>value</tt>
2824 and converts the reamining bits to <tt>ty2</tt>. The bit size of <tt>value</tt>
2825 must be larger than the bit size of <tt>ty2</tt>. Equal sized types are not
2826 allowed. This implies that a <tt>trunc</tt> cannot be a <i>no-op cast</i>. It
2827 will always truncate bits.</p>
2829 <p>When truncating to bool, the truncation is done as a comparison against
2830 zero. If the <tt>value</tt> was zero, the bool result will be <tt>false</tt>.
2831 If the <tt>value</tt> was non-zero, the bool result will be <tt>true</tt>.</p>
2835 %X = trunc int 257 to ubyte <i>; yields ubyte:1</i>
2836 %Y = trunc int 123 to bool <i>; yields bool:true</i>
2840 <!-- _______________________________________________________________________ -->
2841 <div class="doc_subsubsection">
2842 <a name="i_zext">'<tt>zext .. to</tt>' Instruction</a>
2844 <div class="doc_text">
2848 <result> = zext <ty> <value> to <ty2> <i>; yields ty2</i>
2852 <p>The '<tt>zext</tt>' instruction zero extends its operand to type
2857 <p>The '<tt>zext</tt>' instruction takes a value to cast, which must be of
2858 <a href="#t_integral">integral</a> type, and a type to cast it to, which must
2859 also be of <a href="#t_integral">integral</a> type. The bit size of the
2860 <tt>value</tt> must be smaller than or equal to the bit size of the
2861 destination type, <tt>ty2</tt>.</p>
2864 <p>The <tt>zext</tt> fills the high order bits of the <tt>value</tt> with zero
2865 bits until it reaches the size of the destination type, <tt>ty2</tt>. When the
2866 the operand and the type are the same size, no bit filling is done and the
2867 cast is considered a <i>no-op cast</i> because no bits change (only the type
2870 <p>When zero extending to bool, the extension is done as a comparison against
2871 zero. If the <tt>value</tt> was zero, the bool result will be <tt>false</tt>.
2872 If the <tt>value</tt> was non-zero, the bool result will be <tt>true</tt>.</p>
2876 %X = zext int 257 to ulong <i>; yields ulong:257</i>
2877 %Y = zext bool true to int <i>; yields int:1</i>
2881 <!-- _______________________________________________________________________ -->
2882 <div class="doc_subsubsection">
2883 <a name="i_sext">'<tt>sext .. to</tt>' Instruction</a>
2885 <div class="doc_text">
2889 <result> = sext <ty> <value> to <ty2> <i>; yields ty2</i>
2893 <p>The '<tt>sext</tt>' sign extends <tt>value</tt> to the type <tt>ty2</tt>.</p>
2897 The '<tt>sext</tt>' instruction takes a value to cast, which must be of
2898 <a href="#t_integral">integral</a> type, and a type to cast it to, which must
2899 also be of <a href="#t_integral">integral</a> type.</p>
2903 The '<tt>sext</tt>' instruction performs a sign extension by copying the sign
2904 bit (highest order bit) of the <tt>value</tt> until it reaches the bit size of
2905 the type <tt>ty2</tt>. When the the operand and the type are the same size,
2906 no bit filling is done and the cast is considered a <i>no-op cast</i> because
2907 no bits change (only the type changes).</p>
2909 <p>When sign extending to bool, the extension is done as a comparison against
2910 zero. If the <tt>value</tt> was zero, the bool result will be <tt>false</tt>.
2911 If the <tt>value</tt> was non-zero, the bool result will be <tt>true</tt>.</p>
2916 %X = sext sbyte -1 to ushort <i>; yields ushort:65535</i>
2917 %Y = sext bool true to int <i>; yields int:-1</i>
2921 <!-- _______________________________________________________________________ -->
2922 <div class="doc_subsubsection">
2923 <a name="i_fpext">'<tt>fpext .. to</tt>' Instruction</a>
2925 <div class="doc_text">
2929 <result> = fpext <ty> <value> to <ty2> <i>; yields ty2</i>
2933 <p>The '<tt>fpext</tt>' extends a floating point <tt>value</tt> to a larger
2934 floating point value.</p>
2937 <p>The '<tt>fpext</tt>' instruction takes a
2938 <a href="#t_floating">floating point</a> <tt>value</tt> to cast,
2939 and a <a href="#t_floating">floating point</a> type to cast it to.</p>
2942 <p>The '<tt>fpext</tt>' instruction extends the <tt>value</tt> from one floating
2943 point type to another. If the type of the <tt>value</tt> and <tt>ty2</tt> are
2944 the same, the instruction is considered a <i>no-op cast</i> because no bits
2949 %X = fpext float 3.1415 to double <i>; yields double:3.1415</i>
2950 %Y = fpext float 1.0 to float <i>; yields float:1.0 (no-op)</i>
2954 <!-- _______________________________________________________________________ -->
2955 <div class="doc_subsubsection">
2956 <a name="i_fptrunc">'<tt>fptrunc .. to</tt>' Instruction</a>
2959 <div class="doc_text">
2964 <result> = fptrunc <ty> <value> to <ty2> <i>; yields ty2</i>
2968 <p>The '<tt>fptrunc</tt>' instruction truncates <tt>value</tt> to type
2973 <p>The '<tt>fptrunc</tt>' instruction takes a <a href="#t_floating">floating
2974 point</a> value to cast and a <a href="#t_floating">floating point</a> type to
2975 cast it to. The size of <tt>value</tt> must be larger than the size of
2976 <tt>ty2</a>. This implies that <tt>fptrunc</tt> cannot be used to make a
2977 <i>no-op cast</i>.</p>
2980 <p> The '<tt>fptrunc</tt>' instruction converts a
2981 <a href="#t_floating">floating point</a> value from a larger type to a smaller
2982 type. If the value cannot fit within the destination type, <tt>ty2</tt>, then
2983 the results are undefined.</p>
2987 %X = fptrunc double 123.0 to float <i>; yields float:123.0</i>
2988 %Y = fptrunc double 1.0E+300 to float <i>; yields undefined</i>
2992 <!-- _______________________________________________________________________ -->
2993 <div class="doc_subsubsection">
2994 <a name="i_fp2uint">'<tt>fp2uint .. to</tt>' Instruction</a>
2996 <div class="doc_text">
3000 <result> = fp2uint <ty> <value> to <ty2> <i>; yields ty2</i>
3004 <p>The '<tt>fp2uint</tt>' converts a floating point <tt>value</tt> to its
3005 unsigned integer equivalent of type <tt>ty2</tt>.
3009 <p>The '<tt>fp2uint</tt>' instruction takes a value to cast, which must be a
3010 <a href="#t_floating">floating point</a> value, and a type to cast it to, which
3011 must be an <a href="#t_integral">integral</a> type.</p>
3014 <p> The '<tt>fp2uint</tt>' instruction converts its
3015 <a href="#t_floating">floating point</a> operand into the nearest (rounding
3016 towards zero) unsigned integer value. If the value cannot fit in <tt>ty2</tt>,
3017 the results are undefined.</p>
3019 <p>When converting to bool, the conversion is done as a comparison against
3020 zero. If the <tt>value</tt> was zero, the bool result will be <tt>false</tt>.
3021 If the <tt>value</tt> was non-zero, the bool result will be <tt>true</tt>.</p>
3025 %X = fp2uint double 123.0 to int <i>; yields int:123</i>
3026 %Y = fp2uint float 1.0E+300 to bool <i>; yields bool:true</i>
3027 %X = fp2uint float 1.04E+17 to ubyte <i>; yields undefined:1</i>
3031 <!-- _______________________________________________________________________ -->
3032 <div class="doc_subsubsection">
3033 <a name="i_fp2sint">'<tt>fp2sint .. to</tt>' Instruction</a>
3035 <div class="doc_text">
3039 <result> = fp2sint <ty> <value> to <ty2> <i>; yields ty2</i>
3043 <p>The '<tt>fp2sint</tt>' instruction converts
3044 <a href="#t_floating">floating point</a> <tt>value</tt> to type <tt>ty2</tt>.
3049 <p> The '<tt>fp2sint</tt>' instruction takes a value to cast, which must be a
3050 <a href="#t_floating">floating point</a> value, and a type to cast it to, which
3051 must also be an <a href="#t_integral">integral</a> type.</p>
3054 <p>The '<tt>fp2sint</tt>' instruction converts its
3055 <a href="#t_floating">floating point</a> operand into the nearest (rounding
3056 towards zero) signed integer value. If the value cannot fit in <tt>ty2</tt>,
3057 the results are undefined.</p>
3059 <p>When converting to bool, the conversion is done as a comparison against
3060 zero. If the <tt>value</tt> was zero, the bool result will be <tt>false</tt>.
3061 If the <tt>value</tt> was non-zero, the bool result will be <tt>true</tt>.</p>
3065 %X = fp2sint double -123.0 to int <i>; yields int:-123</i>
3066 %Y = fp2sint float 1.0E-247 to bool <i>; yields bool:true</i>
3067 %X = fp2sint float 1.04E+17 to sbyte <i>; yields undefined:1</i>
3071 <!-- _______________________________________________________________________ -->
3072 <div class="doc_subsubsection">
3073 <a name="i_uint2fp">'<tt>uint2fp .. to</tt>' Instruction</a>
3075 <div class="doc_text">
3079 <result> = uint2fp <ty> <value> to <ty2> <i>; yields ty2</i>
3083 <p>The '<tt>uint2fp</tt>' instruction regards <tt>value</tt> as an unsigned
3084 integer and converts that value to the <tt>ty2</tt> type.</p>
3088 <p>The '<tt>uint2fp</tt>' instruction takes a value to cast, which must be an
3089 <a href="#t_integral">integral</a> value, and a type to cast it to, which must
3090 be a <a href="#t_floating">floating point</a> type.</p>
3093 <p>The '<tt>uint2fp</tt>' instruction interprets its operand as an unsigned
3094 integer quantity and converts it to the corresponding floating point value. If
3095 the value cannot fit in the floating point value, the results are undefined.</p>
3100 %X = uint2fp int 257 to float <i>; yields float:257.0</i>
3101 %Y = uint2fp sbyte -1 to double <i>; yields double:255.0</i>
3105 <!-- _______________________________________________________________________ -->
3106 <div class="doc_subsubsection">
3107 <a name="i_sint2fp">'<tt>sint2fp .. to</tt>' Instruction</a>
3109 <div class="doc_text">
3113 <result> = sint2fp <ty> <value> to <ty2> <i>; yields ty2</i>
3117 <p>The '<tt>sint2fp</tt>' instruction regards <tt>value</tt> as a signed
3118 integer and converts that value to the <tt>ty2</tt> type.</p>
3121 <p>The '<tt>sint2fp</tt>' instruction takes a value to cast, which must be an
3122 <a href="#t_integral">integral</a> value, and a type to cast it to, which must be
3123 a <a href="#t_floating">floating point</a> type.</p>
3126 <p>The '<tt>sint2fp</tt>' instruction interprets its operand as a signed
3127 integer quantity and converts it to the corresponding floating point value. If
3128 the value cannot fit in the floating point value, the results are undefined.</p>
3132 %X = sint2fp int 257 to float <i>; yields float:257.0</i>
3133 %Y = sint2fp sbyte -1 to double <i>; yields double:-1.0</i>
3137 <!-- _______________________________________________________________________ -->
3138 <div class="doc_subsubsection">
3139 <a name="i_bitconvert">'<tt>bitconvert .. to</tt>' Instruction</a>
3141 <div class="doc_text">
3145 <result> = bitconvert <ty> <value> to <ty2> <i>; yields ty2</i>
3149 <p>The '<tt>bitconvert</tt>' instruction converts <tt>value</tt> to type
3150 <tt>ty2</tt> without changing any bits.</p>
3153 <p>The '<tt>bitconvert</tt>' instruction takes a value to cast, which must be
3154 a first class value, and a type to cast it to, which must also be a <a
3155 href="#t_firstclass">first class</a> type. The bit sizes of <tt>value</tt>
3156 and the destination type, <tt>ty2</tt>, must be identical.</p>
3159 <p>The '<tt>bitconvert</tt>' instruction converts <tt>value</tt> to type
3160 <tt>ty2</tt> as if the value had been stored to memory and read back as type
3161 <tt>ty2</tt>. That is, no bits are changed during the conversion. The
3162 <tt>bitconvert</tt> instruction may be used to construct <i>no-op casts</i> that
3163 the <tt>zext, sext, and fpext</tt> instructions do not permit.</p>
3167 %X = bitconvert ubyte 255 to sbyte <i>; yields sbyte:-1</i>
3168 %Y = bitconvert uint* %x to uint <i>; yields uint:%x</i>
3172 <!-- _______________________________________________________________________ -->
3173 <div class="doc_subsubsection">
3174 <a name="i_select">'<tt>select</tt>' Instruction</a>
3177 <div class="doc_text">
3182 <result> = select bool <cond>, <ty> <val1>, <ty> <val2> <i>; yields ty</i>
3188 The '<tt>select</tt>' instruction is used to choose one value based on a
3189 condition, without branching.
3196 The '<tt>select</tt>' instruction requires a boolean value indicating the condition, and two values of the same <a href="#t_firstclass">first class</a> type.
3202 If the boolean condition evaluates to true, the instruction returns the first
3203 value argument; otherwise, it returns the second value argument.
3209 %X = select bool true, ubyte 17, ubyte 42 <i>; yields ubyte:17</i>
3214 <!-- _______________________________________________________________________ -->
3215 <div class="doc_subsubsection">
3216 <a name="i_call">'<tt>call</tt>' Instruction</a>
3219 <div class="doc_text">
3223 <result> = [tail] call [<a href="#callingconv">cconv</a>] <ty>* <fnptrval>(<param list>)
3228 <p>The '<tt>call</tt>' instruction represents a simple function call.</p>
3232 <p>This instruction requires several arguments:</p>
3236 <p>The optional "tail" marker indicates whether the callee function accesses
3237 any allocas or varargs in the caller. If the "tail" marker is present, the
3238 function call is eligible for tail call optimization. Note that calls may
3239 be marked "tail" even if they do not occur before a <a
3240 href="#i_ret"><tt>ret</tt></a> instruction.
3243 <p>The optional "cconv" marker indicates which <a href="callingconv">calling
3244 convention</a> the call should use. If none is specified, the call defaults
3245 to using C calling conventions.
3248 <p>'<tt>ty</tt>': shall be the signature of the pointer to function value
3249 being invoked. The argument types must match the types implied by this
3250 signature. This type can be omitted if the function is not varargs and
3251 if the function type does not return a pointer to a function.</p>
3254 <p>'<tt>fnptrval</tt>': An LLVM value containing a pointer to a function to
3255 be invoked. In most cases, this is a direct function invocation, but
3256 indirect <tt>call</tt>s are just as possible, calling an arbitrary pointer
3257 to function value.</p>
3260 <p>'<tt>function args</tt>': argument list whose types match the
3261 function signature argument types. All arguments must be of
3262 <a href="#t_firstclass">first class</a> type. If the function signature
3263 indicates the function accepts a variable number of arguments, the extra
3264 arguments can be specified.</p>
3270 <p>The '<tt>call</tt>' instruction is used to cause control flow to
3271 transfer to a specified function, with its incoming arguments bound to
3272 the specified values. Upon a '<tt><a href="#i_ret">ret</a></tt>'
3273 instruction in the called function, control flow continues with the
3274 instruction after the function call, and the return value of the
3275 function is bound to the result argument. This is a simpler case of
3276 the <a href="#i_invoke">invoke</a> instruction.</p>
3281 %retval = call int %test(int %argc)
3282 call int(sbyte*, ...) *%printf(sbyte* %msg, int 12, sbyte 42);
3283 %X = tail call int %foo()
3284 %Y = tail call <a href="#callingconv">fastcc</a> int %foo()
3289 <!-- _______________________________________________________________________ -->
3290 <div class="doc_subsubsection">
3291 <a name="i_va_arg">'<tt>va_arg</tt>' Instruction</a>
3294 <div class="doc_text">
3299 <resultval> = va_arg <va_list*> <arglist>, <argty>
3304 <p>The '<tt>va_arg</tt>' instruction is used to access arguments passed through
3305 the "variable argument" area of a function call. It is used to implement the
3306 <tt>va_arg</tt> macro in C.</p>
3310 <p>This instruction takes a <tt>va_list*</tt> value and the type of
3311 the argument. It returns a value of the specified argument type and
3312 increments the <tt>va_list</tt> to point to the next argument. Again, the
3313 actual type of <tt>va_list</tt> is target specific.</p>
3317 <p>The '<tt>va_arg</tt>' instruction loads an argument of the specified
3318 type from the specified <tt>va_list</tt> and causes the
3319 <tt>va_list</tt> to point to the next argument. For more information,
3320 see the variable argument handling <a href="#int_varargs">Intrinsic
3323 <p>It is legal for this instruction to be called in a function which does not
3324 take a variable number of arguments, for example, the <tt>vfprintf</tt>
3327 <p><tt>va_arg</tt> is an LLVM instruction instead of an <a
3328 href="#intrinsics">intrinsic function</a> because it takes a type as an
3333 <p>See the <a href="#int_varargs">variable argument processing</a> section.</p>
3337 <!-- *********************************************************************** -->
3338 <div class="doc_section"> <a name="intrinsics">Intrinsic Functions</a> </div>
3339 <!-- *********************************************************************** -->
3341 <div class="doc_text">
3343 <p>LLVM supports the notion of an "intrinsic function". These functions have
3344 well known names and semantics and are required to follow certain
3345 restrictions. Overall, these instructions represent an extension mechanism for
3346 the LLVM language that does not require changing all of the transformations in
3347 LLVM to add to the language (or the bytecode reader/writer, the parser,
3350 <p>Intrinsic function names must all start with an "<tt>llvm.</tt>" prefix. This
3351 prefix is reserved in LLVM for intrinsic names; thus, functions may not be named
3352 this. Intrinsic functions must always be external functions: you cannot define
3353 the body of intrinsic functions. Intrinsic functions may only be used in call
3354 or invoke instructions: it is illegal to take the address of an intrinsic
3355 function. Additionally, because intrinsic functions are part of the LLVM
3356 language, it is required that they all be documented here if any are added.</p>
3359 <p>To learn how to add an intrinsic function, please see the <a
3360 href="ExtendingLLVM.html">Extending LLVM Guide</a>.
3365 <!-- ======================================================================= -->
3366 <div class="doc_subsection">
3367 <a name="int_varargs">Variable Argument Handling Intrinsics</a>
3370 <div class="doc_text">
3372 <p>Variable argument support is defined in LLVM with the <a
3373 href="#i_va_arg"><tt>va_arg</tt></a> instruction and these three
3374 intrinsic functions. These functions are related to the similarly
3375 named macros defined in the <tt><stdarg.h></tt> header file.</p>
3377 <p>All of these functions operate on arguments that use a
3378 target-specific value type "<tt>va_list</tt>". The LLVM assembly
3379 language reference manual does not define what this type is, so all
3380 transformations should be prepared to handle intrinsics with any type
3383 <p>This example shows how the <a href="#i_va_arg"><tt>va_arg</tt></a>
3384 instruction and the variable argument handling intrinsic functions are
3388 int %test(int %X, ...) {
3389 ; Initialize variable argument processing
3391 call void %<a href="#i_va_start">llvm.va_start</a>(sbyte** %ap)
3393 ; Read a single integer argument
3394 %tmp = va_arg sbyte** %ap, int
3396 ; Demonstrate usage of llvm.va_copy and llvm.va_end
3398 call void %<a href="#i_va_copy">llvm.va_copy</a>(sbyte** %aq, sbyte** %ap)
3399 call void %<a href="#i_va_end">llvm.va_end</a>(sbyte** %aq)
3401 ; Stop processing of arguments.
3402 call void %<a href="#i_va_end">llvm.va_end</a>(sbyte** %ap)
3408 <!-- _______________________________________________________________________ -->
3409 <div class="doc_subsubsection">
3410 <a name="i_va_start">'<tt>llvm.va_start</tt>' Intrinsic</a>
3414 <div class="doc_text">
3416 <pre> declare void %llvm.va_start(<va_list>* <arglist>)<br></pre>
3418 <P>The '<tt>llvm.va_start</tt>' intrinsic initializes
3419 <tt>*<arglist></tt> for subsequent use by <tt><a
3420 href="#i_va_arg">va_arg</a></tt>.</p>
3424 <P>The argument is a pointer to a <tt>va_list</tt> element to initialize.</p>
3428 <P>The '<tt>llvm.va_start</tt>' intrinsic works just like the <tt>va_start</tt>
3429 macro available in C. In a target-dependent way, it initializes the
3430 <tt>va_list</tt> element the argument points to, so that the next call to
3431 <tt>va_arg</tt> will produce the first variable argument passed to the function.
3432 Unlike the C <tt>va_start</tt> macro, this intrinsic does not need to know the
3433 last argument of the function, the compiler can figure that out.</p>
3437 <!-- _______________________________________________________________________ -->
3438 <div class="doc_subsubsection">
3439 <a name="i_va_end">'<tt>llvm.va_end</tt>' Intrinsic</a>
3442 <div class="doc_text">
3444 <pre> declare void %llvm.va_end(<va_list*> <arglist>)<br></pre>
3446 <p>The '<tt>llvm.va_end</tt>' intrinsic destroys <tt><arglist></tt>
3447 which has been initialized previously with <tt><a href="#i_va_start">llvm.va_start</a></tt>
3448 or <tt><a href="#i_va_copy">llvm.va_copy</a></tt>.</p>
3450 <p>The argument is a <tt>va_list</tt> to destroy.</p>
3452 <p>The '<tt>llvm.va_end</tt>' intrinsic works just like the <tt>va_end</tt>
3453 macro available in C. In a target-dependent way, it destroys the <tt>va_list</tt>.
3454 Calls to <a href="#i_va_start"><tt>llvm.va_start</tt></a> and <a
3455 href="#i_va_copy"><tt>llvm.va_copy</tt></a> must be matched exactly
3456 with calls to <tt>llvm.va_end</tt>.</p>
3459 <!-- _______________________________________________________________________ -->
3460 <div class="doc_subsubsection">
3461 <a name="i_va_copy">'<tt>llvm.va_copy</tt>' Intrinsic</a>
3464 <div class="doc_text">
3469 declare void %llvm.va_copy(<va_list>* <destarglist>,
3470 <va_list>* <srcarglist>)
3475 <p>The '<tt>llvm.va_copy</tt>' intrinsic copies the current argument position from
3476 the source argument list to the destination argument list.</p>
3480 <p>The first argument is a pointer to a <tt>va_list</tt> element to initialize.
3481 The second argument is a pointer to a <tt>va_list</tt> element to copy from.</p>
3486 <p>The '<tt>llvm.va_copy</tt>' intrinsic works just like the <tt>va_copy</tt> macro
3487 available in C. In a target-dependent way, it copies the source
3488 <tt>va_list</tt> element into the destination list. This intrinsic is necessary
3489 because the <tt><a href="i_va_begin">llvm.va_begin</a></tt> intrinsic may be
3490 arbitrarily complex and require memory allocation, for example.</p>
3494 <!-- ======================================================================= -->
3495 <div class="doc_subsection">
3496 <a name="int_gc">Accurate Garbage Collection Intrinsics</a>
3499 <div class="doc_text">
3502 LLVM support for <a href="GarbageCollection.html">Accurate Garbage
3503 Collection</a> requires the implementation and generation of these intrinsics.
3504 These intrinsics allow identification of <a href="#i_gcroot">GC roots on the
3505 stack</a>, as well as garbage collector implementations that require <a
3506 href="#i_gcread">read</a> and <a href="#i_gcwrite">write</a> barriers.
3507 Front-ends for type-safe garbage collected languages should generate these
3508 intrinsics to make use of the LLVM garbage collectors. For more details, see <a
3509 href="GarbageCollection.html">Accurate Garbage Collection with LLVM</a>.
3513 <!-- _______________________________________________________________________ -->
3514 <div class="doc_subsubsection">
3515 <a name="i_gcroot">'<tt>llvm.gcroot</tt>' Intrinsic</a>
3518 <div class="doc_text">
3523 declare void %llvm.gcroot(<ty>** %ptrloc, <ty2>* %metadata)
3528 <p>The '<tt>llvm.gcroot</tt>' intrinsic declares the existence of a GC root to
3529 the code generator, and allows some metadata to be associated with it.</p>
3533 <p>The first argument specifies the address of a stack object that contains the
3534 root pointer. The second pointer (which must be either a constant or a global
3535 value address) contains the meta-data to be associated with the root.</p>
3539 <p>At runtime, a call to this intrinsics stores a null pointer into the "ptrloc"
3540 location. At compile-time, the code generator generates information to allow
3541 the runtime to find the pointer at GC safe points.
3547 <!-- _______________________________________________________________________ -->
3548 <div class="doc_subsubsection">
3549 <a name="i_gcread">'<tt>llvm.gcread</tt>' Intrinsic</a>
3552 <div class="doc_text">
3557 declare sbyte* %llvm.gcread(sbyte* %ObjPtr, sbyte** %Ptr)
3562 <p>The '<tt>llvm.gcread</tt>' intrinsic identifies reads of references from heap
3563 locations, allowing garbage collector implementations that require read
3568 <p>The second argument is the address to read from, which should be an address
3569 allocated from the garbage collector. The first object is a pointer to the
3570 start of the referenced object, if needed by the language runtime (otherwise
3575 <p>The '<tt>llvm.gcread</tt>' intrinsic has the same semantics as a load
3576 instruction, but may be replaced with substantially more complex code by the
3577 garbage collector runtime, as needed.</p>
3582 <!-- _______________________________________________________________________ -->
3583 <div class="doc_subsubsection">
3584 <a name="i_gcwrite">'<tt>llvm.gcwrite</tt>' Intrinsic</a>
3587 <div class="doc_text">
3592 declare void %llvm.gcwrite(sbyte* %P1, sbyte* %Obj, sbyte** %P2)
3597 <p>The '<tt>llvm.gcwrite</tt>' intrinsic identifies writes of references to heap
3598 locations, allowing garbage collector implementations that require write
3599 barriers (such as generational or reference counting collectors).</p>
3603 <p>The first argument is the reference to store, the second is the start of the
3604 object to store it to, and the third is the address of the field of Obj to
3605 store to. If the runtime does not require a pointer to the object, Obj may be
3610 <p>The '<tt>llvm.gcwrite</tt>' intrinsic has the same semantics as a store
3611 instruction, but may be replaced with substantially more complex code by the
3612 garbage collector runtime, as needed.</p>
3618 <!-- ======================================================================= -->
3619 <div class="doc_subsection">
3620 <a name="int_codegen">Code Generator Intrinsics</a>
3623 <div class="doc_text">
3625 These intrinsics are provided by LLVM to expose special features that may only
3626 be implemented with code generator support.
3631 <!-- _______________________________________________________________________ -->
3632 <div class="doc_subsubsection">
3633 <a name="i_returnaddress">'<tt>llvm.returnaddress</tt>' Intrinsic</a>
3636 <div class="doc_text">
3640 declare sbyte *%llvm.returnaddress(uint <level>)
3646 The '<tt>llvm.returnaddress</tt>' intrinsic attempts to compute a
3647 target-specific value indicating the return address of the current function
3648 or one of its callers.
3654 The argument to this intrinsic indicates which function to return the address
3655 for. Zero indicates the calling function, one indicates its caller, etc. The
3656 argument is <b>required</b> to be a constant integer value.
3662 The '<tt>llvm.returnaddress</tt>' intrinsic either returns a pointer indicating
3663 the return address of the specified call frame, or zero if it cannot be
3664 identified. The value returned by this intrinsic is likely to be incorrect or 0
3665 for arguments other than zero, so it should only be used for debugging purposes.
3669 Note that calling this intrinsic does not prevent function inlining or other
3670 aggressive transformations, so the value returned may not be that of the obvious
3671 source-language caller.
3676 <!-- _______________________________________________________________________ -->
3677 <div class="doc_subsubsection">
3678 <a name="i_frameaddress">'<tt>llvm.frameaddress</tt>' Intrinsic</a>
3681 <div class="doc_text">
3685 declare sbyte *%llvm.frameaddress(uint <level>)
3691 The '<tt>llvm.frameaddress</tt>' intrinsic attempts to return the
3692 target-specific frame pointer value for the specified stack frame.
3698 The argument to this intrinsic indicates which function to return the frame
3699 pointer for. Zero indicates the calling function, one indicates its caller,
3700 etc. The argument is <b>required</b> to be a constant integer value.
3706 The '<tt>llvm.frameaddress</tt>' intrinsic either returns a pointer indicating
3707 the frame address of the specified call frame, or zero if it cannot be
3708 identified. The value returned by this intrinsic is likely to be incorrect or 0
3709 for arguments other than zero, so it should only be used for debugging purposes.
3713 Note that calling this intrinsic does not prevent function inlining or other
3714 aggressive transformations, so the value returned may not be that of the obvious
3715 source-language caller.
3719 <!-- _______________________________________________________________________ -->
3720 <div class="doc_subsubsection">
3721 <a name="i_stacksave">'<tt>llvm.stacksave</tt>' Intrinsic</a>
3724 <div class="doc_text">
3728 declare sbyte *%llvm.stacksave()
3734 The '<tt>llvm.stacksave</tt>' intrinsic is used to remember the current state of
3735 the function stack, for use with <a href="#i_stackrestore">
3736 <tt>llvm.stackrestore</tt></a>. This is useful for implementing language
3737 features like scoped automatic variable sized arrays in C99.
3743 This intrinsic returns a opaque pointer value that can be passed to <a
3744 href="#i_stackrestore"><tt>llvm.stackrestore</tt></a>. When an
3745 <tt>llvm.stackrestore</tt> intrinsic is executed with a value saved from
3746 <tt>llvm.stacksave</tt>, it effectively restores the state of the stack to the
3747 state it was in when the <tt>llvm.stacksave</tt> intrinsic executed. In
3748 practice, this pops any <a href="#i_alloca">alloca</a> blocks from the stack
3749 that were allocated after the <tt>llvm.stacksave</tt> was executed.
3754 <!-- _______________________________________________________________________ -->
3755 <div class="doc_subsubsection">
3756 <a name="i_stackrestore">'<tt>llvm.stackrestore</tt>' Intrinsic</a>
3759 <div class="doc_text">
3763 declare void %llvm.stackrestore(sbyte* %ptr)
3769 The '<tt>llvm.stackrestore</tt>' intrinsic is used to restore the state of
3770 the function stack to the state it was in when the corresponding <a
3771 href="#llvm.stacksave"><tt>llvm.stacksave</tt></a> intrinsic executed. This is
3772 useful for implementing language features like scoped automatic variable sized
3779 See the description for <a href="#i_stacksave"><tt>llvm.stacksave</tt></a>.
3785 <!-- _______________________________________________________________________ -->
3786 <div class="doc_subsubsection">
3787 <a name="i_prefetch">'<tt>llvm.prefetch</tt>' Intrinsic</a>
3790 <div class="doc_text">
3794 declare void %llvm.prefetch(sbyte * <address>,
3795 uint <rw>, uint <locality>)
3802 The '<tt>llvm.prefetch</tt>' intrinsic is a hint to the code generator to insert
3803 a prefetch instruction if supported; otherwise, it is a noop. Prefetches have
3805 effect on the behavior of the program but can change its performance
3812 <tt>address</tt> is the address to be prefetched, <tt>rw</tt> is the specifier
3813 determining if the fetch should be for a read (0) or write (1), and
3814 <tt>locality</tt> is a temporal locality specifier ranging from (0) - no
3815 locality, to (3) - extremely local keep in cache. The <tt>rw</tt> and
3816 <tt>locality</tt> arguments must be constant integers.
3822 This intrinsic does not modify the behavior of the program. In particular,
3823 prefetches cannot trap and do not produce a value. On targets that support this
3824 intrinsic, the prefetch can provide hints to the processor cache for better
3830 <!-- _______________________________________________________________________ -->
3831 <div class="doc_subsubsection">
3832 <a name="i_pcmarker">'<tt>llvm.pcmarker</tt>' Intrinsic</a>
3835 <div class="doc_text">
3839 declare void %llvm.pcmarker( uint <id> )
3846 The '<tt>llvm.pcmarker</tt>' intrinsic is a method to export a Program Counter
3848 code to simulators and other tools. The method is target specific, but it is
3849 expected that the marker will use exported symbols to transmit the PC of the marker.
3850 The marker makes no guarantees that it will remain with any specific instruction
3851 after optimizations. It is possible that the presence of a marker will inhibit
3852 optimizations. The intended use is to be inserted after optimizations to allow
3853 correlations of simulation runs.
3859 <tt>id</tt> is a numerical id identifying the marker.
3865 This intrinsic does not modify the behavior of the program. Backends that do not
3866 support this intrinisic may ignore it.
3871 <!-- _______________________________________________________________________ -->
3872 <div class="doc_subsubsection">
3873 <a name="i_readcyclecounter">'<tt>llvm.readcyclecounter</tt>' Intrinsic</a>
3876 <div class="doc_text">
3880 declare ulong %llvm.readcyclecounter( )
3887 The '<tt>llvm.readcyclecounter</tt>' intrinsic provides access to the cycle
3888 counter register (or similar low latency, high accuracy clocks) on those targets
3889 that support it. On X86, it should map to RDTSC. On Alpha, it should map to RPCC.
3890 As the backing counters overflow quickly (on the order of 9 seconds on alpha), this
3891 should only be used for small timings.
3897 When directly supported, reading the cycle counter should not modify any memory.
3898 Implementations are allowed to either return a application specific value or a
3899 system wide value. On backends without support, this is lowered to a constant 0.
3904 <!-- ======================================================================= -->
3905 <div class="doc_subsection">
3906 <a name="int_libc">Standard C Library Intrinsics</a>
3909 <div class="doc_text">
3911 LLVM provides intrinsics for a few important standard C library functions.
3912 These intrinsics allow source-language front-ends to pass information about the
3913 alignment of the pointer arguments to the code generator, providing opportunity
3914 for more efficient code generation.
3919 <!-- _______________________________________________________________________ -->
3920 <div class="doc_subsubsection">
3921 <a name="i_memcpy">'<tt>llvm.memcpy</tt>' Intrinsic</a>
3924 <div class="doc_text">
3928 declare void %llvm.memcpy.i32(sbyte* <dest>, sbyte* <src>,
3929 uint <len>, uint <align>)
3930 declare void %llvm.memcpy.i64(sbyte* <dest>, sbyte* <src>,
3931 ulong <len>, uint <align>)
3937 The '<tt>llvm.memcpy.*</tt>' intrinsics copy a block of memory from the source
3938 location to the destination location.
3942 Note that, unlike the standard libc function, the <tt>llvm.memcpy.*</tt>
3943 intrinsics do not return a value, and takes an extra alignment argument.
3949 The first argument is a pointer to the destination, the second is a pointer to
3950 the source. The third argument is an integer argument
3951 specifying the number of bytes to copy, and the fourth argument is the alignment
3952 of the source and destination locations.
3956 If the call to this intrinisic has an alignment value that is not 0 or 1, then
3957 the caller guarantees that both the source and destination pointers are aligned
3964 The '<tt>llvm.memcpy.*</tt>' intrinsics copy a block of memory from the source
3965 location to the destination location, which are not allowed to overlap. It
3966 copies "len" bytes of memory over. If the argument is known to be aligned to
3967 some boundary, this can be specified as the fourth argument, otherwise it should
3973 <!-- _______________________________________________________________________ -->
3974 <div class="doc_subsubsection">
3975 <a name="i_memmove">'<tt>llvm.memmove</tt>' Intrinsic</a>
3978 <div class="doc_text">
3982 declare void %llvm.memmove.i32(sbyte* <dest>, sbyte* <src>,
3983 uint <len>, uint <align>)
3984 declare void %llvm.memmove.i64(sbyte* <dest>, sbyte* <src>,
3985 ulong <len>, uint <align>)
3991 The '<tt>llvm.memmove.*</tt>' intrinsics move a block of memory from the source
3992 location to the destination location. It is similar to the
3993 '<tt>llvm.memcmp</tt>' intrinsic but allows the two memory locations to overlap.
3997 Note that, unlike the standard libc function, the <tt>llvm.memmove.*</tt>
3998 intrinsics do not return a value, and takes an extra alignment argument.
4004 The first argument is a pointer to the destination, the second is a pointer to
4005 the source. The third argument is an integer argument
4006 specifying the number of bytes to copy, and the fourth argument is the alignment
4007 of the source and destination locations.
4011 If the call to this intrinisic has an alignment value that is not 0 or 1, then
4012 the caller guarantees that the source and destination pointers are aligned to
4019 The '<tt>llvm.memmove.*</tt>' intrinsics copy a block of memory from the source
4020 location to the destination location, which may overlap. It
4021 copies "len" bytes of memory over. If the argument is known to be aligned to
4022 some boundary, this can be specified as the fourth argument, otherwise it should
4028 <!-- _______________________________________________________________________ -->
4029 <div class="doc_subsubsection">
4030 <a name="i_memset">'<tt>llvm.memset.*</tt>' Intrinsics</a>
4033 <div class="doc_text">
4037 declare void %llvm.memset.i32(sbyte* <dest>, ubyte <val>,
4038 uint <len>, uint <align>)
4039 declare void %llvm.memset.i64(sbyte* <dest>, ubyte <val>,
4040 ulong <len>, uint <align>)
4046 The '<tt>llvm.memset.*</tt>' intrinsics fill a block of memory with a particular
4051 Note that, unlike the standard libc function, the <tt>llvm.memset</tt> intrinsic
4052 does not return a value, and takes an extra alignment argument.
4058 The first argument is a pointer to the destination to fill, the second is the
4059 byte value to fill it with, the third argument is an integer
4060 argument specifying the number of bytes to fill, and the fourth argument is the
4061 known alignment of destination location.
4065 If the call to this intrinisic has an alignment value that is not 0 or 1, then
4066 the caller guarantees that the destination pointer is aligned to that boundary.
4072 The '<tt>llvm.memset.*</tt>' intrinsics fill "len" bytes of memory starting at
4074 destination location. If the argument is known to be aligned to some boundary,
4075 this can be specified as the fourth argument, otherwise it should be set to 0 or
4081 <!-- _______________________________________________________________________ -->
4082 <div class="doc_subsubsection">
4083 <a name="i_isunordered">'<tt>llvm.isunordered.*</tt>' Intrinsic</a>
4086 <div class="doc_text">
4090 declare bool %llvm.isunordered.f32(float Val1, float Val2)
4091 declare bool %llvm.isunordered.f64(double Val1, double Val2)
4097 The '<tt>llvm.isunordered</tt>' intrinsics return true if either or both of the
4098 specified floating point values is a NAN.
4104 The arguments are floating point numbers of the same type.
4110 If either or both of the arguments is a SNAN or QNAN, it returns true, otherwise
4116 <!-- _______________________________________________________________________ -->
4117 <div class="doc_subsubsection">
4118 <a name="i_sqrt">'<tt>llvm.sqrt.*</tt>' Intrinsic</a>
4121 <div class="doc_text">
4125 declare float %llvm.sqrt.f32(float %Val)
4126 declare double %llvm.sqrt.f64(double %Val)
4132 The '<tt>llvm.sqrt</tt>' intrinsics return the sqrt of the specified operand,
4133 returning the same value as the libm '<tt>sqrt</tt>' function would. Unlike
4134 <tt>sqrt</tt> in libm, however, <tt>llvm.sqrt</tt> has undefined behavior for
4135 negative numbers (which allows for better optimization).
4141 The argument and return value are floating point numbers of the same type.
4147 This function returns the sqrt of the specified operand if it is a positive
4148 floating point number.
4152 <!-- _______________________________________________________________________ -->
4153 <div class="doc_subsubsection">
4154 <a name="i_powi">'<tt>llvm.powi.*</tt>' Intrinsic</a>
4157 <div class="doc_text">
4161 declare float %llvm.powi.f32(float %Val, int %power)
4162 declare double %llvm.powi.f64(double %Val, int %power)
4168 The '<tt>llvm.powi.*</tt>' intrinsics return the first operand raised to the
4169 specified (positive or negative) power. The order of evaluation of
4170 multiplications is not defined.
4176 The second argument is an integer power, and the first is a value to raise to
4183 This function returns the first value raised to the second power with an
4184 unspecified sequence of rounding operations.</p>
4188 <!-- ======================================================================= -->
4189 <div class="doc_subsection">
4190 <a name="int_manip">Bit Manipulation Intrinsics</a>
4193 <div class="doc_text">
4195 LLVM provides intrinsics for a few important bit manipulation operations.
4196 These allow efficient code generation for some algorithms.
4201 <!-- _______________________________________________________________________ -->
4202 <div class="doc_subsubsection">
4203 <a name="i_bswap">'<tt>llvm.bswap.*</tt>' Intrinsics</a>
4206 <div class="doc_text">
4210 declare ushort %llvm.bswap.i16(ushort <id>)
4211 declare uint %llvm.bswap.i32(uint <id>)
4212 declare ulong %llvm.bswap.i64(ulong <id>)
4218 The '<tt>llvm.bwsap</tt>' family of intrinsics is used to byteswap a 16, 32 or
4219 64 bit quantity. These are useful for performing operations on data that is not
4220 in the target's native byte order.
4226 The <tt>llvm.bswap.16</tt> intrinsic returns a ushort value that has the high and low
4227 byte of the input ushort swapped. Similarly, the <tt>llvm.bswap.i32</tt> intrinsic
4228 returns a uint value that has the four bytes of the input uint swapped, so that
4229 if the input bytes are numbered 0, 1, 2, 3 then the returned uint will have its
4230 bytes in 3, 2, 1, 0 order. The <tt>llvm.bswap.i64</tt> intrinsic extends this concept
4236 <!-- _______________________________________________________________________ -->
4237 <div class="doc_subsubsection">
4238 <a name="int_ctpop">'<tt>llvm.ctpop.*</tt>' Intrinsic</a>
4241 <div class="doc_text">
4245 declare ubyte %llvm.ctpop.i8 (ubyte <src>)
4246 declare ushort %llvm.ctpop.i16(ushort <src>)
4247 declare uint %llvm.ctpop.i32(uint <src>)
4248 declare ulong %llvm.ctpop.i64(ulong <src>)
4254 The '<tt>llvm.ctpop</tt>' family of intrinsics counts the number of bits set in a
4261 The only argument is the value to be counted. The argument may be of any
4262 unsigned integer type. The return type must match the argument type.
4268 The '<tt>llvm.ctpop</tt>' intrinsic counts the 1's in a variable.
4272 <!-- _______________________________________________________________________ -->
4273 <div class="doc_subsubsection">
4274 <a name="int_ctlz">'<tt>llvm.ctlz.*</tt>' Intrinsic</a>
4277 <div class="doc_text">
4281 declare ubyte %llvm.ctlz.i8 (ubyte <src>)
4282 declare ushort %llvm.ctlz.i16(ushort <src>)
4283 declare uint %llvm.ctlz.i32(uint <src>)
4284 declare ulong %llvm.ctlz.i64(ulong <src>)
4290 The '<tt>llvm.ctlz</tt>' family of intrinsic functions counts the number of
4291 leading zeros in a variable.
4297 The only argument is the value to be counted. The argument may be of any
4298 unsigned integer type. The return type must match the argument type.
4304 The '<tt>llvm.ctlz</tt>' intrinsic counts the leading (most significant) zeros
4305 in a variable. If the src == 0 then the result is the size in bits of the type
4306 of src. For example, <tt>llvm.ctlz(int 2) = 30</tt>.
4312 <!-- _______________________________________________________________________ -->
4313 <div class="doc_subsubsection">
4314 <a name="int_cttz">'<tt>llvm.cttz.*</tt>' Intrinsic</a>
4317 <div class="doc_text">
4321 declare ubyte %llvm.cttz.i8 (ubyte <src>)
4322 declare ushort %llvm.cttz.i16(ushort <src>)
4323 declare uint %llvm.cttz.i32(uint <src>)
4324 declare ulong %llvm.cttz.i64(ulong <src>)
4330 The '<tt>llvm.cttz</tt>' family of intrinsic functions counts the number of
4337 The only argument is the value to be counted. The argument may be of any
4338 unsigned integer type. The return type must match the argument type.
4344 The '<tt>llvm.cttz</tt>' intrinsic counts the trailing (least significant) zeros
4345 in a variable. If the src == 0 then the result is the size in bits of the type
4346 of src. For example, <tt>llvm.cttz(2) = 1</tt>.
4350 <!-- ======================================================================= -->
4351 <div class="doc_subsection">
4352 <a name="int_debugger">Debugger Intrinsics</a>
4355 <div class="doc_text">
4357 The LLVM debugger intrinsics (which all start with <tt>llvm.dbg.</tt> prefix),
4358 are described in the <a
4359 href="SourceLevelDebugging.html#format_common_intrinsics">LLVM Source Level
4360 Debugging</a> document.
4365 <!-- *********************************************************************** -->
4368 <a href="http://jigsaw.w3.org/css-validator/check/referer"><img
4369 src="http://jigsaw.w3.org/css-validator/images/vcss" alt="Valid CSS!"></a>
4370 <a href="http://validator.w3.org/check/referer"><img
4371 src="http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01!" /></a>
4373 <a href="mailto:sabre@nondot.org">Chris Lattner</a><br>
4374 <a href="http://llvm.org">The LLVM Compiler Infrastructure</a><br>
4375 Last modified: $Date$