| blob | 15ecf86d4f86142bf172c97dd2a2abfe53b3218a |
3 <html>
4 <head>
11 </head>
13 <body>
16 <ol>
21 <ol>
24 <ol>
28 <li><a href="#linkage_linker_private_weak_def_auto">'<tt>linker_private_weak_def_auto</tt>' Linkage</a></li>
41 </ol>
42 </li>
56 </ol>
57 </li>
59 <ol>
62 <ol>
69 </ol>
70 </li>
72 <ol>
74 <ol>
79 </ol>
80 </li>
84 </ol>
85 </li>
87 </ol>
88 </li>
90 <ol>
98 </ol>
99 </li>
101 <ol>
104 </ol>
105 </li>
107 <ol>
110 Global Variable</a></li>
112 Global Variable</a></li>
114 Global Variable</a></li>
115 </ol>
116 </li>
118 <ol>
120 <ol>
128 </ol>
129 </li>
131 <ol>
144 </ol>
145 </li>
147 <ol>
154 </ol>
155 </li>
157 <ol>
161 </ol>
162 </li>
164 <ol>
167 </ol>
168 </li>
170 <ol>
175 </ol>
176 </li>
178 <ol>
191 </ol>
192 </li>
194 <ol>
201 </ol>
202 </li>
203 </ol>
204 </li>
206 <ol>
208 <ol>
212 </ol>
213 </li>
215 <ol>
219 </ol>
220 </li>
222 <ol>
230 </ol>
231 </li>
233 <ol>
242 </ol>
243 </li>
245 <ol>
250 </ol>
251 </li>
253 <ol>
260 </ol>
261 </li>
263 <ol>
266 </ol>
267 </li>
271 <ol>
273 </ol>
274 </li>
276 <ol>
290 </ol>
291 </li>
293 <ol>
298 </ol>
299 </li>
301 <ol>
312 </ol>
313 </li>
314 </ol>
315 </li>
316 </ol>
321 </div>
323 <!-- *********************************************************************** -->
325 <!-- *********************************************************************** -->
329 <p>This document is a reference manual for the LLVM assembly language. LLVM is
330 a Static Single Assignment (SSA) based representation that provides type
331 safety, low-level operations, flexibility, and the capability of representing
332 'all' high-level languages cleanly. It is the common code representation
333 used throughout all phases of the LLVM compilation strategy.</p>
335 </div>
337 <!-- *********************************************************************** -->
339 <!-- *********************************************************************** -->
343 <p>The LLVM code representation is designed to be used in three different forms:
344 as an in-memory compiler IR, as an on-disk bitcode representation (suitable
345 for fast loading by a Just-In-Time compiler), and as a human readable
346 assembly language representation. This allows LLVM to provide a powerful
347 intermediate representation for efficient compiler transformations and
348 analysis, while providing a natural means to debug and visualize the
349 transformations. The three different forms of LLVM are all equivalent. This
350 document describes the human readable representation and notation.</p>
352 <p>The LLVM representation aims to be light-weight and low-level while being
353 expressive, typed, and extensible at the same time. It aims to be a
354 "universal IR" of sorts, by being at a low enough level that high-level ideas
355 may be cleanly mapped to it (similar to how microprocessors are "universal
356 IR's", allowing many source languages to be mapped to them). By providing
357 type information, LLVM can be used as the target of optimizations: for
358 example, through pointer analysis, it can be proven that a C automatic
359 variable is never accessed outside of the current function, allowing it to
360 be promoted to a simple SSA value instead of a memory location.</p>
362 </div>
364 <!-- _______________________________________________________________________ -->
369 <p>It is important to note that this document describes 'well formed' LLVM
370 assembly language. There is a difference between what the parser accepts and
371 what is considered 'well formed'. For example, the following instruction is
372 syntactically okay, but not well formed:</p>
376 </pre>
379 LLVM infrastructure provides a verification pass that may be used to verify
380 that an LLVM module is well formed. This pass is automatically run by the
381 parser after parsing input assembly and by the optimizer before it outputs
382 bitcode. The violations pointed out by the verifier pass indicate bugs in
383 transformation passes or input to the parser.</p>
385 </div>
387 <!-- Describe the typesetting conventions here. -->
389 <!-- *********************************************************************** -->
391 <!-- *********************************************************************** -->
395 <p>LLVM identifiers come in two basic types: global and local. Global
397 character. Local identifiers (register names, types) begin with
399 for identifiers, for different purposes:</p>
401 <ol>
402 <li>Named values are represented as a string of characters with their prefix.
406 other characters in their names can be surrounded with quotes. Special
408 ASCII code for the character in hexadecimal. In this way, any character
409 can be used in a name value, even quotes themselves.</li>
411 <li>Unnamed values are represented as an unsigned numeric value with their
416 </ol>
418 <p>LLVM requires that values start with a prefix for two reasons: Compilers
419 don't need to worry about name clashes with reserved words, and the set of
420 reserved words may be expanded in the future without penalty. Additionally,
421 unnamed identifiers allow a compiler to quickly come up with a temporary
422 variable without having to avoid symbol table conflicts.</p>
424 <p>Reserved words in LLVM are very similar to reserved words in other
425 languages. There are keywords for different opcodes
431 reserved words cannot conflict with variable names, because none of them
434 <p>Here is an example of LLVM code to multiply the integer variable
441 </pre>
447 </pre>
455 </pre>
458 lexical features of LLVM:</p>
460 <ol>
462 line.</li>
464 <li>Unnamed temporaries are created when the result of a computation is not
465 assigned to a named value.</li>
468 </ol>
470 <p>It also shows a convention that we follow in this document. When
471 demonstrating instructions, we will follow an instruction with a comment that
472 defines the type and name of value produced. Comments are shown in italic
473 text.</p>
475 </div>
477 <!-- *********************************************************************** -->
479 <!-- *********************************************************************** -->
481 <!-- ======================================================================= -->
483 </div>
488 of the input programs. Each module consists of functions, global variables,
489 and symbol table entries. Modules may be combined together with the LLVM
490 linker, which merges function (and global variable) definitions, resolves
491 forward declarations, and merges symbol table entries. Here is an example of
496 <a href="#identifiers">@.LC0</a> = <a href="#linkage_internal">internal</a> <a href="#globalvars">constant</a> <a href="#t_array">[13 x i8]</a> c"hello world\0A\00" <i>; [13 x i8]*</i>
504 %cast210 = <a href="#i_getelementptr">getelementptr</a> [13 x i8]* @.LC0, i64 0, i64 0 <i>; i8*</i>
509 }
513 !foo = !{!1, null}
514 </pre>
522 <p>In general, a module is made up of a list of global values, where both
523 functions and global variables are global values. Global values are
524 represented by a pointer to a memory location (in this case, a pointer to an
525 array of char, and a pointer to a function), and have one of the
528 </div>
530 <!-- ======================================================================= -->
533 </div>
537 <p>All Global Variables and Functions have one of the following types of
538 linkage:</p>
540 <dl>
543 by objects in the current module. In particular, linking code into a
544 module with an private global value may cause the private to be renamed as
545 necessary to avoid collisions. Because the symbol is private to the
546 module, all references can be updated. This doesn't show up in any symbol
547 table in the object file.</dd>
551 assembler and evaluated by the linker. Unlike normal strong symbols, they
552 are removed by the linker from the final linked image (executable or
553 dynamic library).</dd>
558 linker. The symbols are removed by the linker from the final linked image
559 (executable or dynamic library).</dd>
561 <dt><tt><b><a name="linkage_linker_private_weak_def_auto">linker_private_weak_def_auto</a></b></tt></dt>
563 of the object is not taken. For instance, functions that had an inline
564 definition, but the compiler decided not to inline it. Note,
567 visibility. The symbols are removed by the linker from the final linked
568 image (executable or dynamic library).</dd>
571 <dd>Similar to private, but the value shows as a local symbol
577 into the object file corresponding to the LLVM module. They exist to
578 allow inlining and other optimizations to take place given knowledge of
579 the definition of the global, which is known to be somewhere outside the
582 This linkage type is only allowed on definitions, not declarations.</dd>
586 the same name when linkage occurs. This can be used to implement
587 some forms of inline functions, templates, or other code which must be
588 generated in each translation unit that uses it, but where the body may
589 be overridden with a more definitive definition later. Unreferenced
592 inline the body of this function into callers because it doesn't know if
593 this definition of the function is the definitive definition within the
594 program or whether it will be overridden by a stronger definition.
595 To enable inlining and other optimizations, use "<tt>linkonce_odr</tt>"
596 linkage.</dd>
606 they are used for tentative definitions in C, such as "<tt>int X;</tt>" at
607 global scope.
608 Symbols with "<tt>common</tt>" linkage are merged in the same way as
611 must have a zero initializer, and may not be marked '<a
613 have common linkage.</dd>
618 pointer to array type. When two global variables with appending linkage
619 are linked together, the two global arrays are appended together. This is
620 the LLVM, typesafe, equivalent of having the system linker append together
624 <dd>The semantics of this linkage follow the ELF object file model: the symbol
625 is weak until linked, if not linked, the symbol becomes null instead of
626 being an undefined reference.</dd>
630 <dd>Some languages allow differing globals to be merged, such as two functions
632 that only equivalent globals are ever merged (the "one definition rule"
635 be merged with equivalent globals. These linkage types are otherwise the
639 <dd>If none of the above identifiers are used, the global is externally
640 visible, meaning that it participates in linkage and can be used to
641 resolve external symbol references.</dd>
642 </dl>
644 <p>The next two types of linkage are targeted for Microsoft Windows platform
645 only. They are designed to support importing (exporting) symbols from (to)
646 DLLs (Dynamic Link Libraries).</p>
648 <dl>
651 or variable via a global pointer to a pointer that is set up by the DLL
652 exporting the symbol. On Microsoft Windows targets, the pointer name is
654 name.</dd>
658 pointer to a pointer in a DLL, so that it can be referenced with the
661 variable name.</dd>
662 </dl>
665 another module defined a "<tt>.LC0</tt>" variable and was linked with this
666 one, one of the two would be renamed, preventing a collision. Since
668 declarations), they are accessible outside of the current module.</p>
677 </div>
679 <!-- ======================================================================= -->
682 </div>
688 convention specified for the call. The calling convention of any pair of
689 dynamic caller/callee must match, or the behavior of the program is
690 undefined. The following calling conventions are supported by LLVM, and more
691 may be added in the future:</p>
693 <dl>
695 <dd>This calling convention (the default if no other calling convention is
696 specified) matches the target C calling conventions. This calling
697 convention supports varargs function calls and tolerates some mismatch in
698 the declared prototype and implemented declaration of the function (as
699 does normal C).</dd>
702 <dd>This calling convention attempts to make calls as fast as possible
703 (e.g. by passing things in registers). This calling convention allows the
704 target to use whatever tricks it wants to produce fast code for the
705 target, without having to conform to an externally specified ABI
706 (Application Binary Interface).
708 when this or the GHC convention is used.</a> This calling convention
709 does not support varargs and requires the prototype of all callees to
710 exactly match the prototype of the function definition.</dd>
713 <dd>This calling convention attempts to make code in the caller as efficient
714 as possible under the assumption that the call is not commonly executed.
715 As such, these calls often preserve all registers so that the call does
716 not break any live ranges in the caller side. This calling convention
717 does not support varargs and requires the prototype of all callees to
718 exactly match the prototype of the function definition.</dd>
721 <dd>This calling convention has been implemented specifically for use by the
723 It passes everything in registers, going to extremes to achieve this by
724 disabling callee save registers. This calling convention should not be
725 used lightly but only for specific situations such as an alternative to
727 implementing functional programming languages.At the moment only X86
728 supports this convention and it has the following limitations:
729 <ul>
731 floating point types are supported.</li>
734 </ul>
735 This calling convention supports
737 requires both the caller and callee are using it.
738 </dd>
741 <dd>Any calling convention may be specified by number, allowing
742 target-specific calling conventions to be used. Target specific calling
744 </dl>
746 <p>More calling conventions can be added/defined on an as-needed basis, to
747 support Pascal conventions or any other well-known target-independent
748 convention.</p>
750 </div>
752 <!-- ======================================================================= -->
755 </div>
759 <p>All Global Variables and Functions have one of the following visibility
760 styles:</p>
762 <dl>
764 <dd>On targets that use the ELF object file format, default visibility means
765 that the declaration is visible to other modules and, in shared libraries,
766 means that the declared entity may be overridden. On Darwin, default
767 visibility means that the declaration is visible to other modules. Default
771 <dd>Two declarations of an object with hidden visibility refer to the same
772 object if they are in the same shared object. Usually, hidden visibility
773 indicates that the symbol will not be placed into the dynamic symbol
774 table, so no other module (executable or shared library) can reference it
775 directly.</dd>
778 <dd>On ELF, protected visibility indicates that the symbol will be placed in
779 the dynamic symbol table, but that references within the defining module
780 will bind to the local symbol. That is, the symbol cannot be overridden by
781 another module.</dd>
782 </dl>
784 </div>
786 <!-- ======================================================================= -->
789 </div>
793 <p>LLVM IR allows you to specify name aliases for certain types. This can make
794 it easier to read the IR and make the IR more condensed (particularly when
795 recursive types are involved). An example of a name specification is:</p>
798 %mytype = type { %mytype*, i32 }
799 </pre>
805 <p>Note that type names are aliases for the structural type that they indicate,
806 and that you can therefore specify multiple names for the same type. This
807 often leads to confusing behavior when dumping out a .ll file. Since LLVM IR
808 uses structural typing, the name is not part of the type. When printing out
810 particular shape. This means that if you have code where two different
811 source types end up having the same LLVM type, that the dumper will sometimes
812 print the "wrong" or unexpected type. This is an important design point and
813 isn't going to change.</p>
815 </div>
817 <!-- ======================================================================= -->
820 </div>
824 <p>Global variables define regions of memory allocated at compilation time
825 instead of run-time. Global variables may optionally be initialized, may
826 have an explicit section to be placed in, and may have an optional explicit
827 alignment specified. A variable may be defined as "thread_local", which
828 means that it will not be shared by threads (each thread will have a
829 separated copy of the variable). A variable may be defined as a global
830 "constant," which indicates that the contents of the variable
832 global data to be placed in the read-only section of an executable, etc).
833 Note that variables that need runtime initialization cannot be marked
837 constant, even if the final definition of the global is not. This capability
838 can be used to enable slightly better optimization of the program, but
839 requires the language definition to guarantee that optimizations based on the
840 'constantness' are valid for the translation units that do not include the
841 definition.</p>
843 <p>As SSA values, global variables define pointer values that are in scope
844 (i.e. they dominate) all basic blocks in the program. Global variables
845 always define a pointer to their "content" type because they describe a
846 region of memory, and all memory objects in LLVM are accessed through
847 pointers.</p>
850 that the address is not significant, only the content. Constants marked
851 like this can be merged with other constants if they have the same
854 constant whose address is significant.</p>
856 <p>A global variable may be declared to reside in a target-specific numbered
857 address space. For targets that support them, address spaces may affect how
858 optimizations are performed and/or what target instructions are used to
859 access the variable. The default address space is zero. The address space
860 qualifier must precede any other attributes.</p>
862 <p>LLVM allows an explicit section to be specified for globals. If the target
863 supports it, it will emit globals to the section specified.</p>
865 <p>An explicit alignment may be specified for a global, which must be a power
866 of 2. If not present, or if the alignment is set to zero, the alignment of
867 the global is set by the target to whatever it feels convenient. If an
868 explicit alignment is specified, the global is forced to have exactly that
869 alignment. Targets and optimizers are not allowed to over-align the global
870 if the global has an assigned section. In this case, the extra alignment
871 could be observable: for example, code could assume that the globals are
872 densely packed in their section and try to iterate over them as an array,
873 alignment padding would break this iteration.</p>
875 <p>For example, the following defines a global in a numbered address space with
876 an initializer, section, and alignment:</p>
880 </pre>
882 </div>
885 <!-- ======================================================================= -->
888 </div>
898 name, a (possibly empty) argument list (each with optional
902 curly brace, a list of basic blocks, and a closing curly brace.</p>
910 name, a possibly empty list of arguments, an optional alignment, and an
913 <p>A function definition contains a list of basic blocks, forming the CFG
914 (Control Flow Graph) for the function. Each basic block may optionally start
915 with a label (giving the basic block a symbol table entry), contains a list
917 instruction (such as a branch or function return).</p>
919 <p>The first basic block in a function is special in two ways: it is immediately
920 executed on entrance to the function, and it is not allowed to have
921 predecessor basic blocks (i.e. there can not be any branches to the entry
922 block of a function). Because the block can have no predecessors, it also
925 <p>LLVM allows an explicit section to be specified for functions. If the target
926 supports it, it will emit functions to the section specified.</p>
928 <p>An explicit alignment may be specified for a function. If not present, or if
929 the alignment is set to zero, the alignment of the function is set by the
930 target to whatever it feels convenient. If an explicit alignment is
931 specified, the function is forced to have at least that much alignment. All
935 be significant and two identical functions can be merged</p>.
944 </pre>
946 </div>
948 <!-- ======================================================================= -->
951 </div>
956 function, global variable, another alias or bitcast of global value). Aliases
963 </pre>
965 </div>
967 <!-- ======================================================================= -->
970 </div>
975 nodes</a> (but not metadata strings) are the only valid operands for
976 a named metadata.</p>
980 ; Some unnamed metadata nodes, which are referenced by the named metadata.
984 ; A named metadata.
986 </pre>
988 </div>
990 <!-- ======================================================================= -->
995 <p>The return type and each parameter of a function type may have a set of
997 used to communicate additional information about the result or parameters of
998 a function. Parameter attributes are considered to be part of the function,
999 not of the function type, so functions with different parameter attributes
1000 can have the same function type.</p>
1002 <p>Parameter attributes are simple keywords that follow the type specified. If
1003 multiple parameter attributes are needed, they are space separated. For
1004 example:</p>
1007 declare i32 @printf(i8* noalias nocapture, ...)
1008 declare i32 @atoi(i8 zeroext)
1009 declare signext i8 @returns_signed_char()
1010 </pre>
1017 <dl>
1019 <dd>This indicates to the code generator that the parameter or return value
1020 should be zero-extended to the extent required by the target's ABI (which
1022 parameter) or the callee (for a return value).</dd>
1025 <dd>This indicates to the code generator that the parameter or return value
1026 should be sign-extended to the extent required by the target's ABI (which
1027 is usually 32-bits) by the caller (for a parameter) or the callee (for a
1028 return value).</dd>
1031 <dd>This indicates that this parameter or return value should be treated in a
1032 special target-dependent fashion during while emitting code for a function
1033 call or return (usually, by putting it in a register as opposed to memory,
1034 though some targets use it to distinguish between two different kinds of
1035 registers). Use of this attribute is target-specific.</dd>
1038 <dd><p>This indicates that the pointer parameter should really be passed by
1039 value to the function. The attribute implies that a hidden copy of the
1040 pointee
1041 is made between the caller and the callee, so the callee is unable to
1042 modify the value in the callee. This attribute is only valid on LLVM
1043 pointer arguments. It is generally used to pass structs and arrays by
1044 value, but is also valid on pointers to scalars. The copy is considered
1045 to belong to the caller not the callee (for example,
1048 values.</p>
1050 <p>The byval attribute also supports specifying an alignment with
1051 the align attribute. It indicates the alignment of the stack slot to
1052 form and the known alignment of the pointer specified to the call site. If
1053 the alignment is not specified, then the code generator makes a
1054 target-specific assumption.</p></dd>
1057 <dd>This indicates that the pointer parameter specifies the address of a
1058 structure that is the return value of the function in the source program.
1059 This pointer must be guaranteed by the caller to be valid: loads and
1060 stores to the structure may be assumed by the callee to not to trap. This
1061 may only be applied to the first parameter. This is not a valid attribute
1062 for return values. </dd>
1065 <dd>This indicates that pointer values
1068 ignoring certain "irrelevant" dependencies.
1069 For a call to the parent function, dependencies between memory
1070 references from before or after the call and from those during the call
1072 return value used in that call.
1073 The caller shares the responsibility with the callee for ensuring that
1074 these requirements are met.
1075 For further details, please see the discussion of the NoAlias response in
1077 <br>
1080 arguments, though it is slightly weaker.
1081 <br>
1084 </dd>
1087 <dd>This indicates that the callee does not make any copies of the pointer
1088 that outlive the callee itself. This is not a valid attribute for return
1089 values.</dd>
1092 <dd>This indicates that the pointer parameter can be excised using the
1094 attribute for return values.</dd>
1095 </dl>
1097 </div>
1099 <!-- ======================================================================= -->
1102 </div>
1106 <p>Each function may specify a garbage collector name, which is simply a
1107 string:</p>
1110 define void @f() gc "name" { ... }
1111 </pre>
1114 collector which will cause the compiler to alter its output in order to
1115 support the named garbage collection algorithm.</p>
1117 </div>
1119 <!-- ======================================================================= -->
1122 </div>
1126 <p>Function attributes are set to communicate additional information about a
1127 function. Function attributes are considered to be part of the function, not
1128 of the function type, so functions with different parameter attributes can
1129 have the same function type.</p>
1131 <p>Function attributes are simple keywords that follow the type specified. If
1132 multiple attributes are needed, they are space separated. For example:</p>
1135 define void @f() noinline { ... }
1136 define void @f() alwaysinline { ... }
1137 define void @f() alwaysinline optsize { ... }
1138 define void @f() optsize { ... }
1139 </pre>
1141 <dl>
1143 <dd>This attribute indicates that, when emitting the prologue and epilogue,
1144 the backend should forcibly align the stack pointer. Specify the
1145 desired alignment, which must be a power of two, in parentheses.
1148 <dd>This attribute indicates that the inliner should attempt to inline this
1149 function into callers whenever possible, ignoring any active inlining size
1150 threshold for this caller.</dd>
1153 <dd>This attribute indicates that the function should be 'hotpatchable',
1154 meaning the function can be patched and/or hooked even while it is
1155 loaded into memory. On x86, the function prologue will be preceded
1156 by six bytes of padding and will begin with a two-byte instruction.
1157 Most of the functions in the Windows system DLLs in Windows XP SP2 or
1158 higher were compiled in this fashion.</dd>
1161 <dd>This attribute indicates that the source code contained a hint that inlining
1162 this function is desirable (such as the "inline" keyword in C/C++). It
1163 is just a hint; it imposes no requirements on the inliner.</dd>
1166 <dd>This attribute disables prologue / epilogue emission for the function.
1167 This can have very system-specific consequences.</dd>
1173 <dd>This attribute indicates that the inliner should never inline this
1174 function in any situation. This attribute may not be used together with
1178 <dd>This attribute indicates that the code generator should not use a red
1179 zone, even if the target-specific ABI normally permits it.</dd>
1182 <dd>This function attribute indicates that the function never returns
1183 normally. This produces undefined behavior at runtime if the function
1184 ever does dynamically return.</dd>
1187 <dd>This function attribute indicates that the function never returns with an
1188 unwind or exceptional control flow. If the function does unwind, its
1189 runtime behavior is undefined.</dd>
1192 <dd>This attribute suggests that optimization passes and code generator passes
1193 make choices that keep the code size of this function low, and otherwise
1194 do optimizations specifically to reduce code size.</dd>
1197 <dd>This attribute indicates that the function computes its result (or decides
1198 to unwind an exception) based strictly on its arguments, without
1199 dereferencing any pointer arguments or otherwise accessing any mutable
1200 state (e.g. memory, control registers, etc) visible to caller functions.
1201 It does not write through any pointer arguments
1203 changes any state visible to callers. This means that it cannot unwind
1208 <dd>This attribute indicates that the function does not write through any
1210 arguments) or otherwise modify any state (e.g. memory, control registers,
1211 etc) visible to caller functions. It may dereference pointer arguments
1212 and read state that may be set in the caller. A readonly function always
1213 returns the same value (or unwinds an exception identically) when called
1214 with the same set of arguments and global state. It cannot unwind an
1219 <dd>This attribute indicates that the function should emit a stack smashing
1221 the stack before the local variables that's checked upon return from the
1222 function to see if it has been overwritten. A heuristic is used to
1223 determine if a function needs stack protectors or not.<br>
1224 <br>
1231 stack smashing protector. This overrides
1233 <br>
1238 </dl>
1240 </div>
1242 <!-- ======================================================================= -->
1245 </div>
1250 the GCC "file scope inline asm" blocks. These blocks are internally
1251 concatenated by LLVM and treated as a single unit, but may be separated in
1255 module asm "inline asm code goes here"
1256 module asm "more can go here"
1257 </pre>
1259 <p>The strings can contain any character by escaping non-printable characters.
1261 for the number.</p>
1263 <p>The inline asm code is simply printed to the machine code .s file when
1264 assembly code is generated.</p>
1266 </div>
1268 <!-- ======================================================================= -->
1271 </div>
1275 <p>A module may specify a target specific data layout string that specifies how
1276 data is to be laid out in memory. The syntax for the data layout is
1277 simply:</p>
1280 target datalayout = "<i>layout specification</i>"
1281 </pre>
1284 separated by the minus sign character ('-'). Each specification starts with
1285 a letter and may include other information after the letter to define some
1286 aspect of the data layout. The specifications accepted are as follows:</p>
1288 <dl>
1290 <dd>Specifies that the target lays out data in big-endian form. That is, the
1291 bits with the most significance have the lowest address location.</dd>
1294 <dd>Specifies that the target lays out data in little-endian form. That is,
1295 the bits with the least significance have the lowest address
1296 location.</dd>
1305 <dd>This specifies the alignment for an integer type of a given bit
1309 <dd>This specifies the alignment for a vector type of a given bit
1313 <dd>This specifies the alignment for a floating point type of a given bit
1317 targets.
1320 <dd>This specifies the alignment for an aggregate type of a given bit
1324 <dd>This specifies the alignment for a stack object of a given bit
1328 <dd>This specifies a set of native integer widths for the target CPU
1331 this set are considered to support most general arithmetic
1332 operations efficiently.</dd>
1333 </dl>
1335 <p>When constructing the data layout for a given target, LLVM starts with a
1336 default set of specifications which are then (possibly) overridden by the
1338 are given in this list:</p>
1340 <ul>
1355 </ul>
1357 <p>When LLVM is determining the alignment for a given type, it uses the
1358 following rules:</p>
1360 <ol>
1361 <li>If the type sought is an exact match for one of the specifications, that
1362 specification is used.</li>
1364 <li>If no match is found, and the type sought is an integer type, then the
1365 smallest integer type that is larger than the bitwidth of the sought type
1366 is used. If none of the specifications are larger than the bitwidth then
1367 the the largest integer type is used. For example, given the default
1368 specifications above, the i7 type will use the alignment of i8 (next
1369 largest) while both i65 and i256 will use the alignment of i64 (largest
1370 specified).</li>
1372 <li>If no match is found, and the type sought is a vector type, then the
1373 largest vector type that is smaller than the sought vector type will be
1376 </ol>
1378 </div>
1380 <!-- ======================================================================= -->
1383 </div>
1387 <p>Any memory access must be done through a pointer value associated
1388 with an address range of the memory access, otherwise the behavior
1389 is undefined. Pointer values are associated with address ranges
1390 according to the following rules:</p>
1392 <ul>
1393 <li>A pointer value is associated with the addresses associated with
1395 <li>An address of a global variable is associated with the address
1396 range of the variable's storage.</li>
1397 <li>The result value of an allocation instruction is associated with
1398 the address range of the allocated storage.</li>
1399 <li>A null pointer in the default address-space is associated with
1400 no address.</li>
1401 <li>An integer constant other than zero or a pointer value returned
1402 from a function not defined within LLVM may be associated with address
1403 ranges allocated through mechanisms other than those provided by
1404 LLVM. Such ranges shall not overlap with any ranges of addresses
1405 allocated by mechanisms provided by LLVM.</li>
1406 </ul>
1409 to the following rules:</p>
1411 <ul>
1412 <li>A pointer value formed from a
1415 <li>The result value of a
1418 <li>A pointer value formed by an
1420 pointer values that contribute (directly or indirectly) to the
1421 computation of the pointer's value.</li>
1423 </ul>
1427 slightly weaker.</p>
1429 <p>LLVM IR does not associate types with memory. The result type of a
1431 alignment of the memory from which to load, as well as the
1432 interpretation of the value. The first operand type of a
1434 and alignment of the store.</p>
1436 <p>Consequently, type-based alias analysis, aka TBAA, aka
1439 additional information which specialized optimization passes may use
1440 to implement type-based alias analysis.</p>
1442 </div>
1444 <!-- ======================================================================= -->
1447 </div>
1454 The optimizers must not change the number of volatile operations or change their
1455 order of execution relative to other volatile operations. The optimizers
1457 operations. This is not Java's "volatile" and has no cross-thread
1458 synchronization behavior.</p>
1460 </div>
1462 <!-- *********************************************************************** -->
1464 <!-- *********************************************************************** -->
1468 <p>The LLVM type system is one of the most important features of the
1469 intermediate representation. Being typed enables a number of optimizations
1470 to be performed on the intermediate representation directly, without having
1471 to do extra analyses on the side before the transformation. A strong type
1472 system makes it easier to read the generated code and enables novel analyses
1473 and transformations that are not feasible to perform on normal three address
1474 code representations.</p>
1476 </div>
1478 <!-- ======================================================================= -->
1480 Classifications</a> </div>
1487 <tbody>
1489 <tr>
1492 </tr>
1493 <tr>
1496 </tr>
1497 <tr>
1507 </td>
1508 </tr>
1509 <tr>
1517 </tr>
1518 <tr>
1527 </td>
1528 </tr>
1529 </tbody>
1530 </table>
1533 important. Values of these types are the only ones which can be produced by
1534 instructions.</p>
1536 </div>
1538 <!-- ======================================================================= -->
1543 <p>The primitive types are the fundamental building blocks of the LLVM
1544 system.</p>
1546 </div>
1548 <!-- _______________________________________________________________________ -->
1554 <p>The integer type is a very simple type that simply specifies an arbitrary
1555 bit width for the integer type desired. Any bit width from 1 bit to
1559 <pre>
1560 iN
1561 </pre>
1564 value.</p>
1571 </tr>
1575 </tr>
1579 </tr>
1580 </table>
1582 </div>
1584 <!-- _______________________________________________________________________ -->
1589 <table>
1590 <tbody>
1597 </tbody>
1598 </table>
1600 </div>
1602 <!-- _______________________________________________________________________ -->
1608 <p>The x86mmx type represents a value held in an MMX register on an x86 machine. The operations allowed on it are quite limited: parameters and return values, load and store, and bitcast. User-specified MMX instructions are represented as intrinsic or asm calls with arguments and/or results of this type. There are no arrays, vectors or constants of this type.</p>
1611 <pre>
1612 x86mmx
1613 </pre>
1615 </div>
1617 <!-- _______________________________________________________________________ -->
1626 <pre>
1627 void
1628 </pre>
1630 </div>
1632 <!-- _______________________________________________________________________ -->
1641 <pre>
1642 label
1643 </pre>
1645 </div>
1647 <!-- _______________________________________________________________________ -->
1653 <p>The metadata type represents embedded metadata. No derived types may be
1655 arguments.
1658 <pre>
1659 metadata
1660 </pre>
1662 </div>
1665 <!-- ======================================================================= -->
1670 <p>The real power in LLVM comes from the derived types in the system. This is
1671 what allows a programmer to represent arrays, functions, pointers, and other
1672 useful types. Each of these types contain one or more element types which
1673 may be a primitive type, or another derived type. For example, it is
1674 possible to have a two dimensional array, using an array as the element type
1675 of another array.</p>
1678 </div>
1680 <!-- _______________________________________________________________________ -->
1685 <p>Aggregate Types are a subset of derived types that can contain multiple
1688 aggregate types.</p>
1690 </div>
1692 <!-- _______________________________________________________________________ -->
1698 <p>The array type is a very simple derived type that arranges elements
1699 sequentially in memory. The array type requires a size (number of elements)
1700 and an underlying data type.</p>
1703 <pre>
1705 </pre>
1708 be any type with a size.</p>
1715 </tr>
1719 </tr>
1723 </tr>
1724 </table>
1730 </tr>
1734 </tr>
1738 </tr>
1739 </table>
1741 <p>There is no restriction on indexing beyond the end of the array implied by
1742 a static type (though there are restrictions on indexing beyond the bounds
1743 of an allocated object in some cases). This means that single-dimension
1744 'variable sized array' addressing can be implemented in LLVM with a zero
1745 length array type. An implementation of 'pascal style arrays' in LLVM could
1748 </div>
1750 <!-- _______________________________________________________________________ -->
1756 <p>The function type can be thought of as a function signature. It consists of
1757 a return type and a list of formal parameter types. The return type of a
1758 function type is a first class type or a void type.</p>
1761 <pre>
1763 </pre>
1767 which indicates that the function takes a variable number of arguments.
1768 Variable argument functions can access their arguments with
1778 </td>
1781 </tt></td>
1785 </td>
1791 LLVM.
1792 </td>
1797 </td>
1798 </tr>
1799 </table>
1801 </div>
1803 <!-- _______________________________________________________________________ -->
1809 <p>The structure type is used to represent a collection of data members together
1810 in memory. The packing of the field types is defined to match the ABI of the
1811 underlying processor. The elements of a structure may be any type that has a
1812 size.</p>
1817 Structures in registers are accessed using the
1821 <pre>
1823 </pre>
1836 </tr>
1837 </table>
1839 </div>
1841 <!-- _______________________________________________________________________ -->
1843 </div>
1848 <p>The packed structure type is used to represent a collection of data members
1849 together in memory. There is no padding between fields. Further, the
1850 alignment of a packed structure is 1 byte. The elements of a packed
1851 structure may be any type that has a size.</p>
1858 <pre>
1860 </pre>
1874 </tr>
1875 </table>
1877 </div>
1879 <!-- _______________________________________________________________________ -->
1885 <p>The pointer type is used to specify memory locations.
1886 Pointers are commonly used to reference objects in memory.</p>
1888 <p>Pointer types may have an optional address space attribute defining the
1889 numbered address space where the pointed-to object resides. The default
1890 address space is number zero. The semantics of non-zero address
1891 spaces are target-specific.</p>
1897 <pre>
1899 </pre>
1907 </tr>
1913 </tr>
1918 </tr>
1919 </table>
1921 </div>
1923 <!-- _______________________________________________________________________ -->
1929 <p>A vector type is a simple derived type that represents a vector of elements.
1930 Vector types are used when multiple primitive data are operated in parallel
1931 using a single instruction (SIMD). A vector type requires a size (number of
1932 elements) and an underlying primitive data type. Vector types are considered
1936 <pre>
1938 </pre>
1941 may be any integer or floating point type. Vectors of size zero are not
1942 allowed, and pointers are not allowed as the element type.</p>
1949 </tr>
1953 </tr>
1957 </tr>
1958 </table>
1960 </div>
1962 <!-- _______________________________________________________________________ -->
1967 <p>Opaque types are used to represent unknown types in the system. This
1968 corresponds (for example) to the C notion of a forward declared structure
1969 type. In LLVM, opaque types can eventually be resolved to any type (not just
1970 a structure type).</p>
1973 <pre>
1974 opaque
1975 </pre>
1982 </tr>
1983 </table>
1985 </div>
1987 <!-- ======================================================================= -->
1990 </div>
1996 requiring it to have a name. For instance, a structure declaration may
1997 contain a pointer to any of the types it is lexically a member of. Example
1998 of up references (with their equivalent as named type declarations)
1999 include:</p>
2001 <pre>
2002 { \2 * } %x = type { %x* }
2003 { \2 }* %y = type { %y }*
2004 \1* %z = type %z*
2005 </pre>
2007 <p>An up reference is needed by the asmprinter for printing out cyclic types
2008 when there is no declared name for a type in the cycle. Because the
2009 asmprinter does not want to print out an infinite type string, it needs a
2010 syntax to handle recursive types that have no names (all names are optional
2011 in llvm IR).</p>
2014 <pre>
2016 </pre>
2025 </tr>
2029 structure.</td>
2030 </tr>
2031 </table>
2033 </div>
2035 <!-- *********************************************************************** -->
2037 <!-- *********************************************************************** -->
2041 <p>LLVM has several different basic types of constants. This section describes
2042 them all and their syntax.</p>
2044 </div>
2046 <!-- ======================================================================= -->
2051 <dl>
2059 with integer types.</dd>
2063 exponential notation (e.g. 1.23421e+2), or a more precise hexadecimal
2064 notation (see below). The assembler requires the exact decimal value of a
2065 floating-point constant. For example, the assembler accepts 1.25 but
2072 </dl>
2074 <p>The one non-intuitive notation for constants is the hexadecimal form of
2075 floating point constants. For example, the form '<tt>double
2078 constants are required (and the only time that they are generated by the
2079 disassembler) is when a floating point constant must be emitted but it cannot
2080 be represented as a decimal floating point number in a reasonable number of
2081 digits. For example, NaN's, infinities, and other special values are
2082 represented in their IEEE hexadecimal format so that assembly and disassembly
2083 do not cause any bits to change in the constants.</p>
2085 <p>When using the hexadecimal form, constants of types float and double are
2086 represented using the 16-digit form shown above (which matches the IEEE754
2087 representation for double); float values must, however, be exactly
2088 representable as IEE754 single precision. Hexadecimal format is always used
2089 for long double, and there are three forms of long double. The 80-bit format
2091 The 128-bit format used by PowerPC (two adjacent doubles) is represented
2094 currently supported target uses this format. Long doubles will only work if
2095 they match the long double format on your target. All hexadecimal formats
2096 are big-endian (sign bit at the left).</p>
2099 </div>
2101 <!-- ======================================================================= -->
2105 </div>
2109 <p>Complex constants are a (potentially recursive) combination of simple
2110 constants and smaller complex constants.</p>
2112 <dl>
2114 <dd>Structure constants are represented with notation similar to structure
2115 type definitions (a comma separated list of elements, surrounded by braces
2119 the number and types of elements must match those specified by the
2120 type.</dd>
2123 <dd>Array constants are represented with notation similar to array type
2124 definitions (a comma separated list of elements, surrounded by square
2127 the number and types of elements must match those specified by the
2128 type.</dd>
2131 <dd>Vector constants are represented with notation similar to vector type
2132 definitions (a comma separated list of elements, surrounded by
2134 42, i32 11, i32 74, i32 100 ></tt>". Vector constants must
2136 elements must match those specified by the type.</dd>
2142 This is often used to avoid having to print large zero initializers
2143 (e.g. for large arrays) and is always exactly equivalent to using explicit
2144 zero initializers.</dd>
2147 <dd>A metadata node is a structure-like constant with
2150 be interpreted as part of the instruction stream, metadata is a place to
2151 attach additional information such as debug info.</dd>
2152 </dl>
2154 </div>
2156 <!-- ======================================================================= -->
2159 </div>
2165 (link-time) constants. These constants are explicitly referenced when
2168 legal LLVM file:</p>
2171 @X = global i32 17
2172 @Y = global i32 42
2173 @Z = global [2 x i32*] [ i32* @X, i32* @Y ]
2174 </pre>
2176 </div>
2178 <!-- ======================================================================= -->
2183 indicates that the user of the value may receive an unspecified bit-pattern.
2187 <p>Undefined values are useful because they indicate to the compiler that the
2188 program is well defined no matter what value is used. This gives the
2189 compiler more freedom to optimize. Here are some examples of (potentially
2190 surprising) transformations that are valid (in pseudo IR):</p>
2194 %A = add %X, undef
2195 %B = sub %X, undef
2196 %C = xor %X, undef
2197 Safe:
2198 %A = undef
2199 %B = undef
2200 %C = undef
2201 </pre>
2203 <p>This is safe because all of the output bits are affected by the undef bits.
2204 Any output bit can have a zero or one depending on the input bits.</p>
2207 %A = or %X, undef
2208 %B = and %X, undef
2209 Safe:
2210 %A = -1
2211 %B = 0
2212 Unsafe:
2213 %A = undef
2214 %B = undef
2215 </pre>
2217 <p>These logical operations have bits that are not always affected by the input.
2228 %A = select undef, %X, %Y
2229 %B = select undef, 42, %Y
2230 %C = select %X, %Y, undef
2231 Safe:
2232 %A = %X (or %Y)
2233 %B = 42 (or %Y)
2234 %C = %Y
2235 Unsafe:
2236 %A = undef
2237 %B = undef
2238 %C = undef
2239 </pre>
2248 eliminated.</p>
2251 %A = xor undef, undef
2253 %B = undef
2254 %C = xor %B, %B
2256 %D = undef
2257 %E = icmp lt %D, 4
2258 %F = icmp gte %D, 4
2260 Safe:
2261 %A = undef
2262 %B = undef
2263 %C = undef
2264 %D = undef
2265 %E = undef
2266 %F = undef
2267 </pre>
2270 necessarily the same. This can be surprising to people (and also matches C
2271 semantics) where they assume that "<tt>X^X</tt>" is always zero, even
2274 its value over its "live range". This is true because the variable doesn't
2276 from arbitrary registers that happen to be around when needed, so the value
2278 need to have the same semantics or the core LLVM "replace all uses with"
2279 concept would not hold.</p>
2282 %A = fdiv undef, %X
2283 %B = fdiv %X, undef
2284 Safe:
2285 %A = undef
2286 b: unreachable
2287 </pre>
2294 defined on SNaN's. However, in the second example, we can make a more
2296 arbitrary value, we are allowed to assume that it could be zero. Since a
2298 the operation does not execute at all. This allows us to delete the divide and
2299 all code after it. Because the undefined operation "can't happen", the
2300 optimizer can assume that it occurs in dead code.</p>
2303 a: store undef -> %X
2304 b: store %X -> undef
2305 Safe:
2307 b: unreachable
2308 </pre>
2311 undefined value can be assumed to not have any effect; we can assume that the
2312 value is overwritten with bits that happen to match what was already there.
2314 memory, therefore, it has undefined behavior.</p>
2316 </div>
2318 <!-- ======================================================================= -->
2323 instead of representing an unspecified bit pattern, they represent the
2324 fact that an instruction or constant expression which cannot evoke side
2325 effects has nevertheless detected a condition which results in undefined
2326 behavior.</p>
2328 <p>There is currently no way of representing a trap value in the IR; they
2329 only exist when produced by operations such as
2334 <ul>
2336 their operands.</li>
2339 to their dynamic predecessor basic block.</li>
2341 <li>Function arguments depend on the corresponding actual argument values in
2342 the dynamic callers of their functions.</li>
2346 control back to them.</li>
2350 or exception-throwing call instructions that dynamically transfer control
2351 back to them.</li>
2353 <li>Non-volatile loads and stores depend on the most recent stores to all of the
2354 referenced memory addresses, following the order in the IR
2355 (including loads and stores implied by intrinsics such as
2358 <!-- TODO: In the case of multiple threads, this only applies if the store
2359 "happens-before" the load or store. -->
2361 <!-- TODO: floating-point exception state -->
2363 <li>An instruction with externally visible side effects depends on the most
2364 recent preceding instruction with externally visible side effects, following
2365 the order in the IR. (This includes
2370 if the terminator instruction has multiple successors and the instruction
2371 is always executed when control transfers to one of the successors, and
2372 may not be executed when control is transfered to another.</li>
2376 </ul>
2378 <p>Whenever a trap value is generated, all values which depend on it evaluate
2379 to trap. If they have side effects, the evoke their side effects as if each
2380 operand with a trap value were undef. If they have externally-visible side
2381 effects, the behavior is undefined.</p>
2386 entry:
2389 %trap_yet_again = getelementptr i32* @h, i32 %still_trap
2390 store i32 0, i32* %trap_yet_again ; undefined behavior
2392 store i32 %trap, i32* @g ; Trap value conceptually stored to memory.
2393 %trap2 = load i32* @g ; Returns a trap value, not just undef.
2395 volatile store i32 %trap, i32* @g ; External observation; undefined behavior.
2397 %narrowaddr = bitcast i32* @g to i16*
2398 %wideaddr = bitcast i32* @g to i64*
2399 %trap3 = load 16* %narrowaddr ; Returns a trap value.
2400 %trap4 = load i64* %widaddr ; Returns a trap value.
2402 %cmp = icmp i32 slt %trap, 0 ; Returns a trap value.
2403 %br i1 %cmp, %true, %end ; Branch to either destination.
2405 true:
2406 volatile store i32 0, i32* @g ; This is control-dependent on %cmp, so
2407 ; it has undefined behavior.
2408 br label %end
2410 end:
2412 ; Both edges into this PHI are
2413 ; control-dependent on %cmp, so this
2414 ; always results in a trap value.
2416 volatile store i32 0, i32* @g ; %end is control-equivalent to %entry
2417 ; so this is defined (ignoring earlier
2418 ; undefined behavior in this example).
2419 </pre>
2421 </div>
2423 <!-- ======================================================================= -->
2425 Blocks</a></div>
2431 basic block in the specified function, and always has an i8* type. Taking
2432 the address of the entry block is illegal.</p>
2434 <p>This value only has defined behavior when used as an operand to the
2436 comparisons against null. Pointer equality tests between labels addresses
2437 results in undefined behavior — though, again, comparison against null
2438 is ok, and no label is equal to the null pointer. This may be passed around
2439 as an opaque pointer sized value as long as the bits are not inspected. This
2442 instruction.</p>
2444 <p>Finally, some targets may provide defined semantics when using the value as
2445 the operand to an inline assembly, but that is target specific.</p>
2447 </div>
2450 <!-- ======================================================================= -->
2452 </div>
2456 <p>Constant expressions are used to allow expressions involving other constants
2457 to be used as constants. Constant expressions may be of
2459 operation that does not have side effects (e.g. load and call are not
2460 supported). The following is the syntax for constant expressions:</p>
2462 <dl>
2464 <dd>Truncate a constant to another type. The bit size of CST must be larger
2465 than the bit size of TYPE. Both types must be integers.</dd>
2468 <dd>Zero extend a constant to another type. The bit size of CST must be
2469 smaller than the bit size of TYPE. Both types must be integers.</dd>
2472 <dd>Sign extend a constant to another type. The bit size of CST must be
2473 smaller than the bit size of TYPE. Both types must be integers.</dd>
2476 <dd>Truncate a floating point constant to another floating point type. The
2477 size of CST must be larger than the size of TYPE. Both types must be
2478 floating point.</dd>
2481 <dd>Floating point extend a constant to another type. The size of CST must be
2482 smaller or equal to the size of TYPE. Both types must be floating
2483 point.</dd>
2486 <dd>Convert a floating point constant to the corresponding unsigned integer
2487 constant. TYPE must be a scalar or vector integer type. CST must be of
2488 scalar or vector floating point type. Both CST and TYPE must be scalars,
2489 or vectors of the same number of elements. If the value won't fit in the
2490 integer type, the results are undefined.</dd>
2493 <dd>Convert a floating point constant to the corresponding signed integer
2494 constant. TYPE must be a scalar or vector integer type. CST must be of
2495 scalar or vector floating point type. Both CST and TYPE must be scalars,
2496 or vectors of the same number of elements. If the value won't fit in the
2497 integer type, the results are undefined.</dd>
2500 <dd>Convert an unsigned integer constant to the corresponding floating point
2501 constant. TYPE must be a scalar or vector floating point type. CST must be
2502 of scalar or vector integer type. Both CST and TYPE must be scalars, or
2503 vectors of the same number of elements. If the value won't fit in the
2504 floating point type, the results are undefined.</dd>
2507 <dd>Convert a signed integer constant to the corresponding floating point
2508 constant. TYPE must be a scalar or vector floating point type. CST must be
2509 of scalar or vector integer type. Both CST and TYPE must be scalars, or
2510 vectors of the same number of elements. If the value won't fit in the
2511 floating point type, the results are undefined.</dd>
2514 <dd>Convert a pointer typed constant to the corresponding integer constant
2520 <dd>Convert a integer constant to a pointer constant. TYPE must be a pointer
2521 type. CST must be of integer type. The CST value is zero extended,
2522 truncated, or unchanged to make it fit in a pointer size. This one is
2526 <dd>Convert a constant, CST, to another TYPE. The constraints of the operands
2534 instruction, the index list may have zero or more indexes, which are
2548 constants.</dd>
2552 constants.</dd>
2556 constants.</dd>
2560 constants. The index list is interpreted in a similar manner as indices in
2562 index value must be specified.</dd>
2566 constants. The index list is interpreted in a similar manner as indices in
2568 index value must be specified.</dd>
2571 <dd>Perform the specified operation of the LHS and RHS constants. OPCODE may
2574 on operands are the same as those for the corresponding instruction
2575 (e.g. no bitwise operations on floating point values are allowed).</dd>
2576 </dl>
2578 </div>
2580 <!-- *********************************************************************** -->
2582 <!-- *********************************************************************** -->
2584 <!-- ======================================================================= -->
2587 </div>
2591 <p>LLVM supports inline assembler expressions (as opposed
2593 a special value. This value represents the inline assembler as a string
2594 (containing the instructions to emit), a list of operand constraints (stored
2595 as a string), a flag that indicates whether or not the inline asm
2596 expression has side effects, and a flag indicating whether the function
2597 containing the asm needs to align its stack conservatively. An example
2598 inline assembler expression is:</p>
2602 </pre>
2606 have:</p>
2610 </pre>
2612 <p>Inline asms with side effects not visible in the constraint list must be
2613 marked as having side effects. This is done through the use of the
2618 </pre>
2620 <p>In some cases inline asms will contain code that will not work unless the
2621 stack is aligned in some way, such as calls or SSE instructions on x86,
2622 yet will not contain code that does that alignment within the asm.
2623 The compiler should make conservative assumptions about what the asm might
2624 contain and should generate its usual stack alignment code in the prologue
2629 </pre>
2632 first.</p>
2634 <p>TODO: The format of the asm and constraints string still need to be
2635 documented here. Constraints on what can be done (e.g. duplication, moving,
2636 etc need to be documented). This is probably best done by reference to
2637 another document that covers inline asm from a holistic perspective.</p>
2638 </div>
2642 </div>
2647 attached to it that contains a list of constant integers. If present, the
2648 code generator will use the integer as the location cookie value when report
2649 errors through the LLVMContext error reporting mechanisms. This allows a
2650 front-end to correlate backend errors that occur with inline asm back to the
2651 source code that produced it. For example:</p>
2655 ...
2657 </pre>
2659 <p>It is up to the front-end to make sense of the magic numbers it places in the
2660 IR. If the MDNode contains multiple constants, the code generator will use
2661 the one that corresponds to the line of the asm that the error occurs on.</p>
2663 </div>
2665 <!-- ======================================================================= -->
2667 Strings</a>
2668 </div>
2672 <p>LLVM IR allows metadata to be attached to instructions in the program that
2673 can convey extra information about the code to the optimizers and code
2674 generator. One example application of metadata is source-level debug
2675 information. There are two metadata primitives: strings and nodes. All
2679 <p>A metadata string is a string surrounded by double quotes. It can contain
2683 <p>Metadata nodes are represented with notation similar to structure constants
2684 (a comma separated list of elements, surrounded by braces and preceded by an
2689 metadata nodes, which can be looked up in the module symbol table. For
2690 example: "<tt>!foo = metadata !{!4, !3}</tt>".
2693 function is using two metadata arguments.</p>
2696 <pre>
2698 </pre>
2699 </div>
2705 <pre>
2707 </pre>
2708 </div>
2710 </div>
2713 <!-- *********************************************************************** -->
2716 </div>
2717 <!-- *********************************************************************** -->
2720 code generation or other IR semantics. These are documented here. All globals
2721 of this sort should have a section specified as "<tt>llvm.metadata</tt>". This
2722 section and all globals that start with "<tt>llvm.</tt>" are reserved for use
2723 by LLVM.</p>
2725 <!-- ======================================================================= -->
2728 </div>
2734 pointers to global variables and functions which may optionally have a pointer
2735 cast formed of bitcast or getelementptr. For example, a legal use of it is:</p>
2737 <pre>
2738 @X = global i8 4
2739 @Y = global i32 123
2741 @llvm.used = appending global [2 x i8*] [
2742 i8* @X,
2743 i8* bitcast (i32* @Y to i8*)
2744 ], section "llvm.metadata"
2745 </pre>
2748 compiler, assembler, and linker are required to treat the symbol as if there is
2749 a reference to the global that it cannot see. For example, if a variable has
2751 list, it cannot be deleted. This is commonly used to represent references from
2752 inline asms and other things the compiler cannot "see", and corresponds to
2755 <p>On some targets, the code generator must emit a directive to the assembler or
2756 object file to prevent the assembler and linker from molesting the symbol.</p>
2758 </div>
2760 <!-- ======================================================================= -->
2763 </div>
2769 touching the symbol. On targets that support it, this allows an intelligent
2770 linker to optimize references to the symbol without being impeded as it would be
2773 <p>This is a rare construct that should only be used in rare circumstances, and
2774 should not be exposed to source languages.</p>
2776 </div>
2778 <!-- ======================================================================= -->
2781 </div>
2784 <pre>
2785 %0 = type { i32, void ()* }
2787 </pre>
2788 <p>The <tt>@llvm.global_ctors</tt> array contains a list of constructor functions and associated priorities. The functions referenced by this array will be called in ascending order of priority (i.e. lowest first) when the module is loaded. The order of functions with the same priority is not defined.
2789 </p>
2791 </div>
2793 <!-- ======================================================================= -->
2796 </div>
2799 <pre>
2800 %0 = type { i32, void ()* }
2802 </pre>
2804 <p>The <tt>@llvm.global_dtors</tt> array contains a list of destructor functions and associated priorities. The functions referenced by this array will be called in descending order of priority (i.e. highest first) when the module is loaded. The order of functions with the same priority is not defined.
2805 </p>
2807 </div>
2810 <!-- *********************************************************************** -->
2812 <!-- *********************************************************************** -->
2816 <p>The LLVM instruction set consists of several different classifications of
2823 </div>
2825 <!-- ======================================================================= -->
2827 Instructions</a> </div>
2832 in a program ends with a "Terminator" instruction, which indicates which
2833 block should be executed after the current block is finished. These
2835 control flow, not values (the one exception being the
2838 <p>There are seven different terminator instructions: the
2847 </div>
2849 <!-- _______________________________________________________________________ -->
2851 Instruction</a> </div>
2856 <pre>
2859 </pre>
2863 a value) from a function back to the caller.</p>
2866 value and then causes control flow, and one that just causes control flow to
2867 occur.</p>
2871 return value. The type of the return value must be a
2876 value or a return value with a type that does not match its type, or if it
2878 return value.</p>
2882 the calling function's context. If the caller is a
2884 instruction after the call. If the caller was an
2886 the beginning of the "normal" destination block. If the instruction returns
2887 a value, that value shall set the call or invoke instruction's return
2888 value.</p>
2891 <pre>
2895 </pre>
2897 </div>
2898 <!-- _______________________________________________________________________ -->
2904 <pre>
2905 br i1 <cond>, label <iftrue>, label <iffalse><br> br label <dest> <i>; Unconditional branch</i>
2906 </pre>
2910 different basic block in the current function. There are two forms of this
2911 instruction, corresponding to a conditional branch and an unconditional
2912 branch.</p>
2918 target.</p>
2927 <pre>
2928 Test:
2930 br i1 %cond, label %IfEqual, label %IfUnequal
2931 IfEqual:
2933 IfUnequal:
2935 </pre>
2937 </div>
2939 <!-- _______________________________________________________________________ -->
2942 </div>
2947 <pre>
2948 switch <intty> <value>, label <defaultdest> [ <intty> <val>, label <dest> ... ]
2949 </pre>
2954 instruction, allowing a branch to occur to one of many possible
2955 destinations.</p>
2961 The table is not allowed to contain duplicate constant entries.</p>
2966 is searched for the given value. If the value is found, control flow is
2967 transferred to the corresponding destination; otherwise, control flow is
2968 transferred to the default destination.</p>
2971 <p>Depending on properties of the target machine and the particular
2973 different ways. For example, it could be generated as a series of chained
2974 conditional branches or with a lookup table.</p>
2977 <pre>
2980 switch i32 %Val, label %truedest [ i32 0, label %falsedest ]
2983 switch i32 0, label %dest [ ]
2986 switch i32 %val, label %otherwise [ i32 0, label %onzero
2987 i32 1, label %onone
2988 i32 2, label %ontwo ]
2989 </pre>
2991 </div>
2994 <!-- _______________________________________________________________________ -->
2997 </div>
3002 <pre>
3004 </pre>
3009 within the current function, whose address is specified by
3016 rest of the arguments indicate the full set of possible destinations that the
3017 address may point to. Blocks are allowed to occur multiple times in the
3018 destination list, though this isn't particularly useful.</p>
3020 <p>This destination list is required so that dataflow analysis has an accurate
3021 understanding of the CFG.</p>
3025 <p>Control transfers to the block specified in the address argument. All
3026 possible destination blocks must be listed in the label list, otherwise this
3027 instruction has undefined behavior. This implies that jumps to labels
3028 defined in other functions have undefined behavior as well.</p>
3035 <pre>
3036 indirectbr i8* %Addr, [ label %bb1, label %bb2, label %bb3 ]
3037 </pre>
3039 </div>
3042 <!-- _______________________________________________________________________ -->
3045 </div>
3050 <pre>
3051 <result> = invoke [<a href="#callingconv">cconv</a>] [<a href="#paramattrs">ret attrs</a>] <ptr to function ty> <function ptr val>(<function args>) [<a href="#fnattrs">fn attrs</a>]
3053 </pre>
3057 function, with the possibility of control flow transfer to either the
3060 control flow will return to the "normal" label. If the callee (or any
3062 instruction, control is interrupted and continued at the dynamically nearest
3068 <ol>
3070 convention</a> the call should use. If none is specified, the call
3071 defaults to using C calling conventions.</li>
3078 function value being invoked. In most cases, this is a direct function
3080 off an arbitrary pointer to function value.</li>
3083 function to be invoked. </li>
3086 signature argument types and parameter attributes. All arguments must be
3088 signature indicates the function accepts a variable number of arguments,
3089 the extra arguments can be specified.</li>
3100 </ol>
3103 <p>This instruction is designed to operate as a standard
3105 primary difference is that it establishes an association with a label, which
3106 is used by the runtime library to unwind the stack.</p>
3108 <p>This instruction is used in languages with destructors to ensure that proper
3110 exception. Additionally, this is important for implementation of
3113 <p>For the purposes of the SSA form, the definition of the value returned by the
3115 block to the "normal" label. If the callee unwinds then no return value is
3116 available.</p>
3118 <p>Note that the code generator does not yet completely support unwind, and
3119 that the invoke/unwind semantics are likely to change in future versions.</p>
3122 <pre>
3123 %retval = invoke i32 @Test(i32 15) to label %Continue
3127 </pre>
3129 </div>
3131 <!-- _______________________________________________________________________ -->
3134 Instruction</a> </div>
3139 <pre>
3140 unwind
3141 </pre>
3145 at the first callee in the dynamic call stack which used
3147 This is primarily used to implement exception handling.</p>
3151 immediately halt. The dynamic call stack is then searched for the
3153 Once found, execution continues at the "exceptional" destination block
3155 instruction in the dynamic call chain, undefined behavior results.</p>
3157 <p>Note that the code generator does not yet completely support unwind, and
3158 that the invoke/unwind semantics are likely to change in future versions.</p>
3160 </div>
3162 <!-- _______________________________________________________________________ -->
3165 Instruction</a> </div>
3170 <pre>
3171 unreachable
3172 </pre>
3176 instruction is used to inform the optimizer that a particular portion of the
3177 code is not reachable. This can be used to indicate that the code after a
3178 no-return function cannot be reached, and other facts.</p>
3183 </div>
3185 <!-- ======================================================================= -->
3190 <p>Binary operators are used to do most of the computation in a program. They
3191 require two operands of the same type, execute an operation on them, and
3192 produce a single value. The operands might represent multiple data, as is
3194 has the same type as its operands.</p>
3198 </div>
3200 <!-- _______________________________________________________________________ -->
3203 </div>
3208 <pre>
3213 </pre>
3221 integer values. Both arguments must have identical types.</p>
3226 <p>If the sum has unsigned overflow, the result returned is the mathematical
3229 <p>Because LLVM integers use a two's complement representation, this instruction
3230 is appropriate for both signed and unsigned integers.</p>
3236 respectively, occurs.</p>
3239 <pre>
3241 </pre>
3243 </div>
3245 <!-- _______________________________________________________________________ -->
3248 </div>
3253 <pre>
3255 </pre>
3263 floating point values. Both arguments must have identical types.</p>
3269 <pre>
3271 </pre>
3273 </div>
3275 <!-- _______________________________________________________________________ -->
3278 </div>
3283 <pre>
3288 </pre>
3292 operands.</p>
3296 representations.</p>
3301 integer values. Both arguments must have identical types.</p>
3306 <p>If the difference has unsigned overflow, the result returned is the
3308 result.</p>
3310 <p>Because LLVM integers use a two's complement representation, this instruction
3311 is appropriate for both signed and unsigned integers.</p>
3317 respectively, occurs.</p>
3320 <pre>
3323 </pre>
3325 </div>
3327 <!-- _______________________________________________________________________ -->
3330 </div>
3335 <pre>
3337 </pre>
3341 operands.</p>
3345 representations.</p>
3350 floating point values. Both arguments must have identical types.</p>
3356 <pre>
3359 </pre>
3361 </div>
3363 <!-- _______________________________________________________________________ -->
3366 </div>
3371 <pre>
3376 </pre>
3384 integer values. Both arguments must have identical types.</p>
3389 <p>If the result of the multiplication has unsigned overflow, the result
3391 width of the result.</p>
3393 <p>Because LLVM integers use a two's complement representation, and the result
3394 is the same width as the operands, this instruction returns the correct
3395 result for both signed and unsigned integers. If a full product
3397 be sign-extended or zero-extended as appropriate to the width of the full
3398 product.</p>
3404 respectively, occurs.</p>
3407 <pre>
3409 </pre>
3411 </div>
3413 <!-- _______________________________________________________________________ -->
3416 </div>
3421 <pre>
3423 </pre>
3431 floating point values. Both arguments must have identical types.</p>
3437 <pre>
3439 </pre>
3441 </div>
3443 <!-- _______________________________________________________________________ -->
3445 </a></div>
3450 <pre>
3453 </pre>
3461 values. Both arguments must have identical types.</p>
3466 <p>Note that unsigned integer division and signed integer division are distinct
3477 <pre>
3479 </pre>
3481 </div>
3483 <!-- _______________________________________________________________________ -->
3485 </a> </div>
3490 <pre>
3493 </pre>
3501 values. Both arguments must have identical types.</p>
3504 <p>The value produced is the signed integer quotient of the two operands rounded
3505 towards zero.</p>
3507 <p>Note that signed integer division and unsigned integer division are distinct
3510 <p>Division by zero leads to undefined behavior. Overflow also leads to
3511 undefined behavior; this is a rare case, but can occur, for example, by doing
3516 be rounded.</p>
3519 <pre>
3521 </pre>
3523 </div>
3525 <!-- _______________________________________________________________________ -->
3527 Instruction</a> </div>
3532 <pre>
3534 </pre>
3542 floating point values. Both arguments must have identical types.</p>
3548 <pre>
3550 </pre>
3552 </div>
3554 <!-- _______________________________________________________________________ -->
3556 </div>
3561 <pre>
3563 </pre>
3567 division of its two arguments.</p>
3572 values. Both arguments must have identical types.</p>
3576 This instruction always performs an unsigned division to get the
3577 remainder.</p>
3579 <p>Note that unsigned integer remainder and signed integer remainder are
3585 <pre>
3587 </pre>
3589 </div>
3591 <!-- _______________________________________________________________________ -->
3594 </div>
3599 <pre>
3601 </pre>
3605 division of its two operands. This instruction can also take
3607 elements must be integers.</p>
3612 values. Both arguments must have identical types.</p>
3619 For more information about the difference,
3621 Math Forum</a>. For a table of how this is implemented in various languages,
3625 <p>Note that signed integer remainder and unsigned integer remainder are
3628 <p>Taking the remainder of a division by zero leads to undefined behavior.
3629 Overflow also leads to undefined behavior; this is a rare case, but can
3630 occur, for example, by taking the remainder of a 32-bit division of
3632 lets srem be implemented using instructions that return both the result of
3633 the division and the remainder.)</p>
3636 <pre>
3638 </pre>
3640 </div>
3642 <!-- _______________________________________________________________________ -->
3649 <pre>
3651 </pre>
3655 its two operands.</p>
3660 floating point values. Both arguments must have identical types.</p>
3664 has the same sign as the dividend.</p>
3667 <pre>
3669 </pre>
3671 </div>
3673 <!-- ======================================================================= -->
3675 Operations</a> </div>
3679 <p>Bitwise binary operators are used to do various forms of bit-twiddling in a
3680 program. They are generally very efficient instructions and can commonly be
3681 strength reduced from other instructions. They require two operands of the
3682 same type, execute an operation on them, and produce a single value. The
3683 resulting value is the same type as its operands.</p>
3685 </div>
3687 <!-- _______________________________________________________________________ -->
3689 Instruction</a> </div>
3694 <pre>
3699 </pre>
3703 a specified number of bits.</p>
3713 is (statically or dynamically) negative or equal to or larger than the number
3722 with the resultant sign bit. As such, NUW/NSW have the same semantics as
3723 they would if the shift were expressed as a mul instruction with the same
3727 <pre>
3732 <result> = shl <2 x i32> < i32 1, i32 1>, < i32 1, i32 2> <i>; yields: result=<2 x i32> < i32 2, i32 4></i>
3733 </pre>
3735 </div>
3737 <!-- _______________________________________________________________________ -->
3739 Instruction</a> </div>
3744 <pre>
3747 </pre>
3751 operand shifted to the right a specified number of bits with zero fill.</p>
3759 <p>This instruction always performs a logical shift right operation. The most
3760 significant bits of the result will be filled with zero bits after the shift.
3768 shifted out are non-zero.</p>
3772 <pre>
3778 <result> = lshr <2 x i32> < i32 -2, i32 4>, < i32 1, i32 2> <i>; yields: result=<2 x i32> < i32 0x7FFFFFFF, i32 1></i>
3779 </pre>
3781 </div>
3783 <!-- _______________________________________________________________________ -->
3785 Instruction</a> </div>
3789 <pre>
3792 </pre>
3796 operand shifted to the right a specified number of bits with sign
3797 extension.</p>
3805 <p>This instruction always performs an arithmetic shift right operation, The
3806 most significant bits of the result will be filled with the sign bit
3814 shifted out are non-zero.</p>
3817 <pre>
3823 <result> = ashr <2 x i32> < i32 -2, i32 4>, < i32 1, i32 3> <i>; yields: result=<2 x i32> < i32 -1, i32 0></i>
3824 </pre>
3826 </div>
3828 <!-- _______________________________________________________________________ -->
3830 Instruction</a> </div>
3835 <pre>
3837 </pre>
3841 operands.</p>
3846 values. Both arguments must have identical types.</p>
3852 <tbody>
3853 <tr>
3857 </tr>
3858 <tr>
3862 </tr>
3863 <tr>
3867 </tr>
3868 <tr>
3872 </tr>
3873 <tr>
3877 </tr>
3878 </tbody>
3879 </table>
3882 <pre>
3886 </pre>
3887 </div>
3888 <!-- _______________________________________________________________________ -->
3894 <pre>
3896 </pre>
3900 two operands.</p>
3905 values. Both arguments must have identical types.</p>
3911 <tbody>
3912 <tr>
3916 </tr>
3917 <tr>
3921 </tr>
3922 <tr>
3926 </tr>
3927 <tr>
3931 </tr>
3932 <tr>
3936 </tr>
3937 </tbody>
3938 </table>
3941 <pre>
3945 </pre>
3947 </div>
3949 <!-- _______________________________________________________________________ -->
3951 Instruction</a> </div>
3956 <pre>
3958 </pre>
3968 values. Both arguments must have identical types.</p>
3974 <tbody>
3975 <tr>
3979 </tr>
3980 <tr>
3984 </tr>
3985 <tr>
3989 </tr>
3990 <tr>
3994 </tr>
3995 <tr>
3999 </tr>
4000 </tbody>
4001 </table>
4004 <pre>
4009 </pre>
4011 </div>
4013 <!-- ======================================================================= -->
4016 </div>
4020 <p>LLVM supports several instructions to represent vector operations in a
4021 target-independent manner. These instructions cover the element-access and
4022 vector-specific operations needed to process vectors effectively. While LLVM
4023 does directly support these vector operations, many sophisticated algorithms
4024 will want to use target-specific intrinsics to take full advantage of a
4025 specific target.</p>
4027 </div>
4029 <!-- _______________________________________________________________________ -->
4032 </div>
4037 <pre>
4038 <result> = extractelement <n x <ty>> <val>, i32 <idx> <i>; yields <ty></i>
4039 </pre>
4043 from a vector at a specified index.</p>
4049 indicating the position from which to extract the element. The index may be
4050 a variable.</p>
4053 <p>The result is a scalar of the same type as the element type of
4056 results are undefined.</p>
4059 <pre>
4061 </pre>
4063 </div>
4065 <!-- _______________________________________________________________________ -->
4068 </div>
4073 <pre>
4074 <result> = insertelement <n x <ty>> <val>, <ty> <elt>, i32 <idx> <i>; yields <n x <ty>></i>
4075 </pre>
4079 vector at a specified index.</p>
4084 whose type must equal the element type of the first operand. The third
4085 operand is an index indicating the position at which to insert the value.
4086 The index may be a variable.</p>
4092 results are undefined.</p>
4095 <pre>
4096 <result> = insertelement <4 x i32> %vec, i32 1, i32 0 <i>; yields <4 x i32></i>
4097 </pre>
4099 </div>
4101 <!-- _______________________________________________________________________ -->
4104 </div>
4109 <pre>
4110 <result> = shufflevector <n x <ty>> <v1>, <n x <ty>> <v2>, <m x i32> <mask> <i>; yields <m x <ty>></i>
4111 </pre>
4115 from two input vectors, returning a vector with the same element type as the
4116 input and length that is the same as the shuffle mask.</p>
4120 with types that match each other. The third argument is a shuffle mask whose
4121 element type is always 'i32'. The result of the instruction is a vector
4122 whose length is the same as the shuffle mask and whose element type is the
4123 same as the element type of the first two operands.</p>
4125 <p>The shuffle mask operand is required to be a constant vector with either
4126 constant integer or undef values.</p>
4129 <p>The elements of the two input vectors are numbered from left to right across
4130 both of the vectors. The shuffle mask operand specifies, for each element of
4131 the result vector, which element of the two input vectors the result element
4132 gets. The element selector may be undef (meaning "don't care") and the
4133 second operand may be undef if performing a shuffle from only one vector.</p>
4136 <pre>
4140 <4 x i32> <i32 0, i32 1, i32 2, i32 3> <i>; yields <4 x i32></i> - Identity shuffle.
4144 <8 x i32> <i32 0, i32 1, i32 2, i32 3, i32 4, i32 5, i32 6, i32 7 > <i>; yields <8 x i32></i>
4145 </pre>
4147 </div>
4149 <!-- ======================================================================= -->
4152 </div>
4156 <p>LLVM supports several instructions for working with
4159 </div>
4161 <!-- _______________________________________________________________________ -->
4164 </div>
4169 <pre>
4171 </pre>
4181 specify which value to extract in a similar manner as indices in a
4184 <ul>
4185 <li>Since the value being indexed is not a pointer, the first index is
4186 omitted and assumed to be zero.</li>
4188 <li>Not only struct indices but also array indices must be in
4189 bounds.</li>
4190 </ul>
4193 <p>The result is the value at the position in the aggregate specified by the
4194 index operands.</p>
4197 <pre>
4199 </pre>
4201 </div>
4203 <!-- _______________________________________________________________________ -->
4206 </div>
4211 <pre>
4212 <result> = insertvalue <aggregate type> <val>, <ty> <elt>, <idx> <i>; yields <aggregate type></i>
4213 </pre>
4223 value to insert. The following operands are constant indices indicating
4224 the position at which to insert the value in a similar manner as indices in a
4226 value to insert must have the same type as the value identified by the
4227 indices.</p>
4235 <pre>
4238 </pre>
4240 </div>
4243 <!-- ======================================================================= -->
4246 </div>
4250 <p>A key design point of an SSA-based representation is how it represents
4251 memory. In LLVM, no memory locations are in SSA form, which makes things
4252 very simple. This section describes how to read, write, and allocate
4253 memory in LLVM.</p>
4255 </div>
4257 <!-- _______________________________________________________________________ -->
4260 </div>
4265 <pre>
4266 <result> = alloca <type>[, <ty> <NumElements>][, align <alignment>] <i>; yields {type*}:result</i>
4267 </pre>
4271 currently executing function, to be automatically released when this function
4272 returns to its caller. The object is always allocated in the generic address
4273 space (address space zero).</p>
4278 runtime stack, returning a pointer of the appropriate type to the program.
4279 If "NumElements" is specified, it is the number of elements allocated,
4280 otherwise "NumElements" is defaulted to be one. If a constant alignment is
4281 specified, the value result of the allocation is guaranteed to be aligned to
4282 at least that boundary. If not specified, or if zero, the target can choose
4283 to align the allocation on any convenient boundary compatible with the
4284 type.</p>
4289 <p>Memory is allocated; a pointer is returned. The operation is undefined if
4291 memory is automatically released when the function returns. The
4293 variables that must have an address available. When the function returns
4296 reclaimed. Allocating zero bytes is legal, but the result is undefined.</p>
4299 <pre>
4304 </pre>
4306 </div>
4308 <!-- _______________________________________________________________________ -->
4310 Instruction</a> </div>
4315 <pre>
4316 <result> = load <ty>* <pointer>[, align <alignment>][, !nontemporal !<index>]
4317 <result> = volatile load <ty>* <pointer>[, align <alignment>][, !nontemporal !<index>]
4319 </pre>
4326 from which to load. The pointer must point to
4333 operation (that is, the alignment of the memory address). A value of 0 or an
4335 alignment for the target. It is the responsibility of the code emitter to
4336 ensure that the alignment information is correct. Overestimating the
4337 alignment results in undefined behavior. Underestimating the alignment may
4344 and code generator that this load is not expected to be reused in the cache.
4345 The code generator may select special instructions to save cache bandwidth,
4349 <p>The location of memory pointed to is loaded. If the value being loaded is of
4350 scalar type then the number of bytes read does not exceed the minimum number
4351 of bytes needed to hold all bits of the type. For example, loading an
4354 is undefined if the value was not originally written using a store of the
4355 same type.</p>
4358 <pre>
4362 </pre>
4364 </div>
4366 <!-- _______________________________________________________________________ -->
4368 Instruction</a> </div>
4373 <pre>
4374 store <ty> <value>, <ty>* <pointer>[, align <alignment>][, !nontemporal !<index>] <i>; yields {void}</i>
4375 volatile store <ty> <value>, <ty>* <pointer>[, align <alignment>][, !nontemporal !<index>] <i>; yields {void}</i>
4376 </pre>
4383 and an address at which to store it. The type of the
4392 operation (that is, the alignment of the memory address). A value of 0 or an
4393 omitted "align" argument means that the operation has the preferential
4394 alignment for the target. It is the responsibility of the code emitter to
4395 ensure that the alignment information is correct. Overestimating the
4396 alignment results in an undefined behavior. Underestimating the alignment may
4399 <p>The optional !nontemporal metadata must reference a single metatadata
4401 value 1. The existence of the !nontemporal metatadata on the
4402 instruction tells the optimizer and code generator that this load is
4403 not expected to be reused in the cache. The code generator may
4404 select special instructions to save cache bandwidth, such as the
4405 MOVNT instruction on x86.</p>
4412 does not exceed the minimum number of bytes needed to hold all bits of the
4415 integral number of bytes, it is unspecified what happens to the extra bits
4416 that do not belong to the type, but they will typically be overwritten.</p>
4419 <pre>
4423 </pre>
4425 </div>
4427 <!-- _______________________________________________________________________ -->
4430 </div>
4435 <pre>
4438 </pre>
4443 It performs address calculation only and does not access memory.</p>
4446 <p>The first argument is always a pointer, and forms the basis of the
4447 calculation. The remaining arguments are indices that indicate which of the
4448 elements of the aggregate object are indexed. The interpretation of each
4449 index is dependent on the type being indexed into. The first index always
4450 indexes the pointer value given as the first argument, the second index
4451 indexes a value of the type pointed to (not necessarily the value directly
4452 pointed to, since the first index can be non-zero), etc. The first type
4453 indexed into must be a pointer value, subsequent types can be arrays,
4454 vectors, and structs. Note that subsequent types being indexed into
4455 can never be pointers, since that would require loading the pointer before
4456 continuing calculation.</p>
4458 <p>The type of each index argument depends on the type it is indexing into.
4461 or vector, integers of any width are allowed, and they are not required to be
4462 constant.</p>
4464 <p>For example, let's consider a C code fragment and how it gets compiled to
4465 LLVM:</p>
4468 struct RT {
4469 char A;
4471 char C;
4472 };
4473 struct ST {
4474 int X;
4475 double Y;
4476 struct RT Z;
4477 };
4479 int *foo(struct ST *s) {
4481 }
4482 </pre>
4490 define i32* @foo(%ST* %s) {
4491 entry:
4493 ret i32* %reg
4494 }
4495 </pre>
4500 }</tt>' type, a structure. The second index indexes into the third element
4502 i8 }</tt>' type, another structure. The third index indexes into the second
4504 array. The two dimensions of the array are subscripted into, yielding an
4508 <p>Note that it is perfectly legal to index partially through a structure,
4509 returning a pointer to an inner element. Because of this, the LLVM code for
4510 the given testcase is equivalent to:</p>
4512 <pre>
4513 define i32* @foo(%ST* %s) {
4519 ret i32* %t5
4520 }
4521 </pre>
4526 or if any of the addresses that would be formed by successive addition of
4527 the offsets implied by the indices to the base address with infinitely
4530 the addresses that point into the object, plus the address one byte past
4531 the end.</p>
4534 the base address with silently-wrapping two's complement arithmetic, and
4536 pointed to by the base pointer. The result value may not necessarily be
4537 used to access memory though, even if it happens to point into allocated
4539 section for more information.</p>
4541 <p>The getelementptr instruction is often confusing. For some more insight into
4545 <pre>
4554 </pre>
4556 </div>
4558 <!-- ======================================================================= -->
4560 </div>
4564 <p>The instructions in this category are the conversion instructions (casting)
4565 which all take a single operand and a type. They perform various bit
4566 conversions on the operand.</p>
4568 </div>
4570 <!-- _______________________________________________________________________ -->
4573 </div>
4577 <pre>
4579 </pre>
4588 of the same number of integers.
4591 Equal sized types are not allowed.</p>
4600 <pre>
4604 %W = trunc <2 x i16> <i16 8, i16 7> to <2 x i8> <i>; yields <i8 8, i8 7></i>
4605 </pre>
4607 </div>
4609 <!-- _______________________________________________________________________ -->
4612 </div>
4616 <pre>
4618 </pre>
4628 of the same number of integers.
4630 the bit size of the destination type,
4640 <pre>
4643 %Z = zext <2 x i16> <i16 8, i16 7> to <2 x i32> <i>; yields <i32 8, i32 7></i>
4644 </pre>
4646 </div>
4648 <!-- _______________________________________________________________________ -->
4651 </div>
4655 <pre>
4657 </pre>
4665 of the same number of integers.
4667 the bit size of the destination type,
4678 <pre>
4681 %Z = sext <2 x i16> <i16 8, i16 7> to <2 x i32> <i>; yields <i32 8, i32 7></i>
4682 </pre>
4684 </div>
4686 <!-- _______________________________________________________________________ -->
4689 </div>
4694 <pre>
4696 </pre>
4714 undefined.</p>
4717 <pre>
4720 </pre>
4722 </div>
4724 <!-- _______________________________________________________________________ -->
4727 </div>
4731 <pre>
4733 </pre>
4737 floating point value.</p>
4743 type must be smaller than the destination type.</p>
4753 <pre>
4756 </pre>
4758 </div>
4760 <!-- _______________________________________________________________________ -->
4763 </div>
4767 <pre>
4769 </pre>
4785 towards zero) unsigned integer value. If the value cannot fit
4789 <pre>
4793 </pre>
4795 </div>
4797 <!-- _______________________________________________________________________ -->
4800 </div>
4804 <pre>
4806 </pre>
4824 the results are undefined.</p>
4827 <pre>
4831 </pre>
4833 </div>
4835 <!-- _______________________________________________________________________ -->
4838 </div>
4842 <pre>
4844 </pre>
4859 integer quantity and converts it to the corresponding floating point
4860 value. If the value cannot fit in the floating point value, the results are
4861 undefined.</p>
4864 <pre>
4867 </pre>
4869 </div>
4871 <!-- _______________________________________________________________________ -->
4874 </div>
4878 <pre>
4880 </pre>
4895 quantity and converts it to the corresponding floating point value. If the
4896 value cannot fit in the floating point value, the results are undefined.</p>
4899 <pre>
4902 </pre>
4904 </div>
4906 <!-- _______________________________________________________________________ -->
4909 </div>
4913 <pre>
4915 </pre>
4929 truncating or zero extending that value to the size of the integer type. If
4933 change.</p>
4936 <pre>
4939 </pre>
4941 </div>
4943 <!-- _______________________________________________________________________ -->
4946 </div>
4950 <pre>
4952 </pre>
4960 value to cast, and a type to cast it to, which must be a
4968 than the size of a pointer then a zero extension is done. If they are the
4972 <pre>
4976 </pre>
4978 </div>
4980 <!-- _______________________________________________________________________ -->
4983 </div>
4987 <pre>
4989 </pre>
4997 non-aggregate first class value, and a type to cast it to, which must also be
5000 identical. If the source type is a pointer, the destination type must also be
5001 a pointer. This instruction supports bitwise conversion of vectors to
5002 integers and to vectors of other types (as long as they have the same
5003 size).</p>
5010 be converted to other pointer types with this instruction. To convert
5015 <pre>
5019 </pre>
5021 </div>
5023 <!-- ======================================================================= -->
5029 defy better classification.</p>
5031 </div>
5033 <!-- _______________________________________________________________________ -->
5035 </div>
5040 <pre>
5041 <result> = icmp <cond> <ty> <op1>, <op2> <i>; yields {i1} or {<N x i1>}:result</i>
5042 </pre>
5046 boolean values based on comparison of its two integer, integer vector, or
5047 pointer operands.</p>
5051 the condition code indicating the kind of comparison to perform. It is not a
5052 value, just a keyword. The possible condition code are:</p>
5054 <ol>
5065 </ol>
5069 typed. They must also be identical types.</p>
5075 result, as follows:</p>
5077 <ol>
5080 performed.</li>
5084 performed.</li>
5111 </ol>
5114 values are compared as if they were integers.</p>
5116 <p>If the operands are integer vectors, then they are compared element by
5121 <pre>
5128 </pre>
5130 <p>Note that the code generator does not yet support vector types with
5133 </div>
5135 <!-- _______________________________________________________________________ -->
5137 </div>
5142 <pre>
5143 <result> = fcmp <cond> <ty> <op1>, <op2> <i>; yields {i1} or {<N x i1>}:result</i>
5144 </pre>
5148 values based on comparison of its operands.</p>
5150 <p>If the operands are floating point scalars, then the result type is a boolean
5153 <p>If the operands are floating point vectors, then the result type is a vector
5154 of boolean with the same number of elements as the operands being
5155 compared.</p>
5159 the condition code indicating the kind of comparison to perform. It is not a
5160 value, just a keyword. The possible condition code are:</p>
5162 <ol>
5179 </ol>
5187 identical types.</p>
5192 vectors, then the vectors are compared element by element. Each comparison
5194 follows:</p>
5196 <ol>
5240 </ol>
5243 <pre>
5248 </pre>
5250 <p>Note that the code generator does not yet support vector types with
5253 </div>
5255 <!-- _______________________________________________________________________ -->
5258 </div>
5263 <pre>
5265 </pre>
5269 SSA graph representing the function.</p>
5272 <p>The type of the incoming values is specified with the first type field. After
5274 one pair for each predecessor basic block of the current block. Only values
5276 arguments to the PHI node. Only labels may be used as the label
5277 arguments.</p>
5279 <p>There must be no non-phi instructions between the start of a basic block and
5280 the PHI instructions: i.e. PHI instructions must be first in a basic
5281 block.</p>
5283 <p>For the purposes of the SSA form, the use of each incoming value is deemed to
5284 occur on the edge from the corresponding predecessor block to the current
5286 value on the same edge).</p>
5290 specified by the pair corresponding to the predecessor basic block that
5291 executed just prior to the current block.</p>
5294 <pre>
5295 Loop: ; Infinite loop that counts from 0 on up...
5296 %indvar = phi i32 [ 0, %LoopHeader ], [ %nextindvar, %Loop ]
5297 %nextindvar = add i32 %indvar, 1
5298 br label %Loop
5299 </pre>
5301 </div>
5303 <!-- _______________________________________________________________________ -->
5306 </div>
5311 <pre>
5312 <result> = select <i>selty</i> <cond>, <ty> <val1>, <ty> <val2> <i>; yields ty</i>
5315 </pre>
5319 condition, without branching.</p>
5324 values indicating the condition, and two values of the
5326 vectors and the condition is a scalar, then entire vectors are selected, not
5327 individual elements.</p>
5331 first value argument; otherwise, it returns the second value argument.</p>
5333 <p>If the condition is a vector of i1, then the value arguments must be vectors
5334 of the same size, and the selection is done element by element.</p>
5337 <pre>
5339 </pre>
5341 <p>Note that the code generator does not yet support conditions
5342 with vector type.</p>
5344 </div>
5346 <!-- _______________________________________________________________________ -->
5349 </div>
5354 <pre>
5355 <result> = [tail] call [<a href="#callingconv">cconv</a>] [<a href="#paramattrs">ret attrs</a>] <ty> [<fnty>*] <fnptrval>(<function args>) [<a href="#fnattrs">fn attrs</a>]
5356 </pre>
5364 <ol>
5366 access any allocas or varargs in the caller. Note that calls may be
5367 marked "tail" even if they do not occur before
5369 present, the function call is eligible for tail call optimization,
5371 optimized into a jump</a>. The code generator may optimize calls marked
5373 sibling call optimization</a> when the caller and callee have
5374 matching signatures, or 2) forced tail call optimization when the
5375 following extra requirements are met:
5376 <ul>
5377 <li>Caller and callee both have the calling
5379 <li>The call is in tail position (ret immediately follows call and ret
5380 uses value of call or is void).</li>
5384 constraints are met.</a></li>
5385 </ul>
5386 </li>
5389 convention</a> the call should use. If none is specified, the call
5390 defaults to using C calling conventions. The calling convention of the
5391 call must match the calling convention of the target function, or else the
5392 behavior is undefined.</li>
5399 type of the return value. Functions that return no value are marked
5403 being invoked. The argument types must match the types implied by this
5404 signature. This type can be omitted if the function is not varargs and if
5405 the function type does not return a pointer to a function.</li>
5408 be invoked. In most cases, this is a direct function invocation, but
5410 to function value.</li>
5413 signature argument types and parameter attributes. All arguments must be
5415 signature indicates the function accepts a variable number of arguments,
5416 the extra arguments can be specified.</li>
5421 </ol>
5425 a specified function, with its incoming arguments bound to the specified
5427 function, control flow continues with the instruction after the function
5428 call, and the return value of the function is bound to the result
5429 argument.</p>
5432 <pre>
5433 %retval = call i32 @test(i32 %argc)
5437 call void %foo(i8 97 signext)
5439 %struct.A = type { i32, i8 }
5445 </pre>
5447 <p>llvm treats calls to some functions with names and arguments that match the
5448 standard C99 library as being the C99 library functions, and may perform
5449 optimizations or generate code for them under that assumption. This is
5450 something we'd like to change in the future to provide better support for
5451 freestanding environments and non-C-based languages.</p>
5453 </div>
5455 <!-- _______________________________________________________________________ -->
5458 </div>
5463 <pre>
5465 </pre>
5469 the "variable argument" area of a function call. It is used to implement the
5474 argument. It returns a value of the specified argument type and increments
5481 to the next argument. For more information, see the variable argument
5484 <p>It is legal for this instruction to be called in a function which does not
5486 function.</p>
5490 argument.</p>
5495 <p>Note that the code generator does not yet fully support va_arg on many
5496 targets. Also, it does not currently support va_arg with aggregate types on
5497 any target.</p>
5499 </div>
5501 <!-- *********************************************************************** -->
5503 <!-- *********************************************************************** -->
5508 well known names and semantics and are required to follow certain
5509 restrictions. Overall, these intrinsics represent an extension mechanism for
5510 the LLVM language that does not require changing all of the transformations
5511 in LLVM when adding to the language (or the bitcode reader/writer, the
5512 parser, etc...).</p>
5515 prefix is reserved in LLVM for intrinsic names; thus, function names may not
5516 begin with this prefix. Intrinsic functions must always be external
5517 functions: you cannot define the body of intrinsic functions. Intrinsic
5518 functions may only be used in call or invoke instructions: it is illegal to
5519 take the address of an intrinsic function. Additionally, because intrinsic
5520 functions are part of the LLVM language, it is required if any are added that
5521 they be documented here.</p>
5523 <p>Some intrinsic functions can be overloaded, i.e., the intrinsic represents a
5524 family of functions that perform the same operation but on different data
5525 types. Because LLVM can represent over 8 million different integer types,
5526 overloading is used commonly to allow an intrinsic function to operate on any
5527 integer type. One or more of the argument types or the result type can be
5528 overloaded to accept any integer type. Argument types may also be defined as
5529 exactly matching a previous argument's type or the result type. This allows
5530 an intrinsic function which accepts multiple arguments, but needs all of them
5531 to be of the same type, to only be overloaded with respect to a single
5532 argument or the result.</p>
5534 <p>Overloaded intrinsics will have the names of its overloaded argument types
5535 encoded into its function name, each preceded by a period. Only those types
5536 which are overloaded result in a name suffix. Arguments whose type is matched
5538 can take an integer of any width and returns an integer of exactly the same
5539 integer width. This leads to a family of functions such as
5541 %val)</tt>. Only one type, the return type, is overloaded, and only one type
5542 suffix is required. Because the argument's type is matched against the return
5543 type, it does not require its own name suffix.</p>
5545 <p>To learn how to add an intrinsic function, please see the
5548 </div>
5550 <!-- ======================================================================= -->
5553 </div>
5557 <p>Variable argument support is defined in LLVM with
5559 intrinsic functions. These functions are related to the similarly named
5562 <p>All of these functions operate on arguments that use a target-specific value
5563 type "<tt>va_list</tt>". The LLVM assembly language reference manual does
5564 not define what this type is, so all transformations should be prepared to
5565 handle these functions regardless of the type used.</p>
5568 instruction and the variable argument handling intrinsic functions are
5569 used.</p>
5572 define i32 @test(i32 %X, ...) {
5573 ; Initialize variable argument processing
5574 %ap = alloca i8*
5575 %ap2 = bitcast i8** %ap to i8*
5576 call void @llvm.va_start(i8* %ap2)
5578 ; Read a single integer argument
5579 %tmp = va_arg i8** %ap, i32
5581 ; Demonstrate usage of llvm.va_copy and llvm.va_end
5582 %aq = alloca i8*
5583 %aq2 = bitcast i8** %aq to i8*
5584 call void @llvm.va_copy(i8* %aq2, i8* %ap2)
5585 call void @llvm.va_end(i8* %aq2)
5587 ; Stop processing of arguments.
5588 call void @llvm.va_end(i8* %ap2)
5589 ret i32 %tmp
5590 }
5592 declare void @llvm.va_start(i8*)
5593 declare void @llvm.va_copy(i8*, i8*)
5594 declare void @llvm.va_end(i8*)
5595 </pre>
5597 </div>
5599 <!-- _______________________________________________________________________ -->
5602 </div>
5608 <pre>
5610 </pre>
5621 macro available in C. In a target-dependent way, it initializes
5625 need to know the last argument of the function as the compiler can figure
5626 that out.</p>
5628 </div>
5630 <!-- _______________________________________________________________________ -->
5633 </div>
5638 <pre>
5640 </pre>
5644 which has been initialized previously
5653 macro available in C. In a target-dependent way, it destroys
5659 </div>
5661 <!-- _______________________________________________________________________ -->
5664 </div>
5669 <pre>
5671 </pre>
5675 from the source argument list to the destination argument list.</p>
5680 from.</p>
5684 macro available in C. In a target-dependent way, it copies the
5686 element. This intrinsic is necessary because
5688 arbitrarily complex and require, for example, memory allocation.</p>
5690 </div>
5692 <!-- ======================================================================= -->
5695 </div>
5700 Collection</a> (GC) requires the implementation and generation of these
5702 roots on the stack</a>, as well as garbage collector implementations that
5704 barriers. Front-ends for type-safe garbage collected languages should generate
5705 these intrinsics to make use of the LLVM garbage collectors. For more details,
5709 <p>The garbage collection intrinsics only operate on objects in the generic
5710 address space (address space zero).</p>
5712 </div>
5714 <!-- _______________________________________________________________________ -->
5717 </div>
5722 <pre>
5723 declare void @llvm.gcroot(i8** %ptrloc, i8* %metadata)
5724 </pre>
5728 the code generator, and allows some metadata to be associated with it.</p>
5731 <p>The first argument specifies the address of a stack object that contains the
5732 root pointer. The second pointer (which must be either a constant or a
5733 global value address) contains the meta-data to be associated with the
5734 root.</p>
5738 location. At compile-time, the code generator generates information to allow
5743 </div>
5745 <!-- _______________________________________________________________________ -->
5748 </div>
5753 <pre>
5754 declare i8* @llvm.gcread(i8* %ObjPtr, i8** %Ptr)
5755 </pre>
5759 locations, allowing garbage collector implementations that require read
5760 barriers.</p>
5763 <p>The second argument is the address to read from, which should be an address
5764 allocated from the garbage collector. The first object is a pointer to the
5765 start of the referenced object, if needed by the language runtime (otherwise
5766 null).</p>
5770 instruction, but may be replaced with substantially more complex code by the
5775 </div>
5777 <!-- _______________________________________________________________________ -->
5780 </div>
5785 <pre>
5786 declare void @llvm.gcwrite(i8* %P1, i8* %Obj, i8** %P2)
5787 </pre>
5791 locations, allowing garbage collector implementations that require write
5792 barriers (such as generational or reference counting collectors).</p>
5795 <p>The first argument is the reference to store, the second is the start of the
5796 object to store it to, and the third is the address of the field of Obj to
5797 store to. If the runtime does not require a pointer to the object, Obj may
5798 be null.</p>
5802 instruction, but may be replaced with substantially more complex code by the
5807 </div>
5809 <!-- ======================================================================= -->
5812 </div>
5816 <p>These intrinsics are provided by LLVM to expose special features that may
5817 only be implemented with code generator support.</p>
5819 </div>
5821 <!-- _______________________________________________________________________ -->
5824 </div>
5829 <pre>
5831 </pre>
5835 target-specific value indicating the return address of the current function
5836 or one of its callers.</p>
5839 <p>The argument to this intrinsic indicates which function to return the address
5840 for. Zero indicates the calling function, one indicates its caller, etc.
5845 indicating the return address of the specified call frame, or zero if it
5846 cannot be identified. The value returned by this intrinsic is likely to be
5847 incorrect or 0 for arguments other than zero, so it should only be used for
5848 debugging purposes.</p>
5850 <p>Note that calling this intrinsic does not prevent function inlining or other
5851 aggressive transformations, so the value returned may not be that of the
5852 obvious source-language caller.</p>
5854 </div>
5856 <!-- _______________________________________________________________________ -->
5859 </div>
5864 <pre>
5866 </pre>
5870 target-specific frame pointer value for the specified stack frame.</p>
5873 <p>The argument to this intrinsic indicates which function to return the frame
5874 pointer for. Zero indicates the calling function, one indicates its caller,
5879 indicating the frame address of the specified call frame, or zero if it
5880 cannot be identified. The value returned by this intrinsic is likely to be
5881 incorrect or 0 for arguments other than zero, so it should only be used for
5882 debugging purposes.</p>
5884 <p>Note that calling this intrinsic does not prevent function inlining or other
5885 aggressive transformations, so the value returned may not be that of the
5886 obvious source-language caller.</p>
5888 </div>
5890 <!-- _______________________________________________________________________ -->
5893 </div>
5898 <pre>
5899 declare i8* @llvm.stacksave()
5900 </pre>
5904 of the function stack, for use
5906 useful for implementing language features like scoped automatic variable
5907 sized arrays in C99.</p>
5910 <p>This intrinsic returns a opaque pointer value that can be passed
5918 </div>
5920 <!-- _______________________________________________________________________ -->
5923 </div>
5928 <pre>
5929 declare void @llvm.stackrestore(i8* %ptr)
5930 </pre>
5934 the function stack to the state it was in when the
5936 executed. This is useful for implementing language features like scoped
5937 automatic variable sized arrays in C99.</p>
5940 <p>See the description
5943 </div>
5945 <!-- _______________________________________________________________________ -->
5948 </div>
5953 <pre>
5955 </pre>
5959 insert a prefetch instruction if supported; otherwise, it is a noop.
5960 Prefetches have no effect on the behavior of the program but can change its
5961 performance characteristics.</p>
5971 <p>This intrinsic does not modify the behavior of the program. In particular,
5972 prefetches cannot trap and do not produce a value. On targets that support
5973 this intrinsic, the prefetch can provide hints to the processor cache for
5974 better performance.</p>
5976 </div>
5978 <!-- _______________________________________________________________________ -->
5981 </div>
5986 <pre>
5988 </pre>
5992 Counter (PC) in a region of code to simulators and other tools. The method
5993 is target specific, but it is expected that the marker will use exported
5994 symbols to transmit the PC of the marker. The marker makes no guarantees
5995 that it will remain with any specific instruction after optimizations. It is
5996 possible that the presence of a marker will inhibit optimizations. The
5997 intended use is to be inserted after optimizations to allow correlations of
5998 simulation runs.</p>
6004 <p>This intrinsic does not modify the behavior of the program. Backends that do
6005 not support this intrinsic may ignore it.</p>
6007 </div>
6009 <!-- _______________________________________________________________________ -->
6012 </div>
6017 <pre>
6018 declare i64 @llvm.readcyclecounter()
6019 </pre>
6023 counter register (or similar low latency, high accuracy clocks) on those
6024 targets that support it. On X86, it should map to RDTSC. On Alpha, it
6025 should map to RPCC. As the backing counters overflow quickly (on the order
6029 <p>When directly supported, reading the cycle counter should not modify any
6030 memory. Implementations are allowed to either return a application specific
6031 value or a system wide value. On backends without support, this is lowered
6034 </div>
6036 <!-- ======================================================================= -->
6039 </div>
6043 <p>LLVM provides intrinsics for a few important standard C library functions.
6044 These intrinsics allow source-language front-ends to pass information about
6045 the alignment of the pointer arguments to the code generator, providing
6046 opportunity for more efficient code generation.</p>
6048 </div>
6050 <!-- _______________________________________________________________________ -->
6053 </div>
6059 integer bit width and for different address spaces. Not all targets support
6060 all bit widths however.</p>
6062 <pre>
6067 </pre>
6071 source location to the destination location.</p>
6074 intrinsics do not return a value, takes extra alignment/isvolatile arguments
6075 and the pointers can be in specified address spaces.</p>
6079 <p>The first argument is a pointer to the destination, the second is a pointer
6080 to the source. The third argument is an integer argument specifying the
6081 number of bytes to copy, the fourth argument is the alignment of the
6082 source and destination locations, and the fifth is a boolean indicating a
6083 volatile access.</p>
6086 then the caller guarantees that both the source and destination pointers are
6087 aligned to that boundary.</p>
6091 The detailed access behavior is not very cleanly specified and it is unwise
6092 to depend on it.</p>
6097 source location to the destination location, which are not allowed to
6098 overlap. It copies "len" bytes of memory over. If the argument is known to
6099 be aligned to some boundary, this can be specified as the fourth argument,
6102 </div>
6104 <!-- _______________________________________________________________________ -->
6107 </div>
6112 <p>This is an overloaded intrinsic. You can use llvm.memmove on any integer bit
6113 width and for different address space. Not all targets support all bit
6114 widths however.</p>
6116 <pre>
6121 </pre>
6125 source location to the destination location. It is similar to the
6127 overlap.</p>
6130 intrinsics do not return a value, takes extra alignment/isvolatile arguments
6131 and the pointers can be in specified address spaces.</p>
6135 <p>The first argument is a pointer to the destination, the second is a pointer
6136 to the source. The third argument is an integer argument specifying the
6137 number of bytes to copy, the fourth argument is the alignment of the
6138 source and destination locations, and the fifth is a boolean indicating a
6139 volatile access.</p>
6142 then the caller guarantees that the source and destination pointers are
6143 aligned to that boundary.</p>
6147 The detailed access behavior is not very cleanly specified and it is unwise
6148 to depend on it.</p>
6153 source location to the destination location, which may overlap. It copies
6154 "len" bytes of memory over. If the argument is known to be aligned to some
6155 boundary, this can be specified as the fourth argument, otherwise it should
6158 </div>
6160 <!-- _______________________________________________________________________ -->
6163 </div>
6168 <p>This is an overloaded intrinsic. You can use llvm.memset on any integer bit
6169 width and for different address spaces. However, not all targets support all
6170 bit widths.</p>
6172 <pre>
6177 </pre>
6181 particular byte value.</p>
6184 intrinsic does not return a value and takes extra alignment/volatile
6185 arguments. Also, the destination can be in an arbitrary address space.</p>
6188 <p>The first argument is a pointer to the destination to fill, the second is the
6189 byte value with which to fill it, the third argument is an integer argument
6190 specifying the number of bytes to fill, and the fourth argument is the known
6191 alignment of the destination location.</p>
6194 then the caller guarantees that the destination pointer is aligned to that
6195 boundary.</p>
6199 The detailed access behavior is not very cleanly specified and it is unwise
6200 to depend on it.</p>
6204 at the destination location. If the argument is known to be aligned to some
6205 boundary, this can be specified as the fourth argument, otherwise it should
6208 </div>
6210 <!-- _______________________________________________________________________ -->
6213 </div>
6219 floating point or vector of floating point type. Not all targets support all
6220 types however.</p>
6222 <pre>
6223 declare float @llvm.sqrt.f32(float %Val)
6224 declare double @llvm.sqrt.f64(double %Val)
6225 declare x86_fp80 @llvm.sqrt.f80(x86_fp80 %Val)
6226 declare fp128 @llvm.sqrt.f128(fp128 %Val)
6227 declare ppc_fp128 @llvm.sqrt.ppcf128(ppc_fp128 %Val)
6228 </pre>
6234 behavior for negative numbers other than -0.0 (which allows for better
6235 optimization, because there is no need to worry about errno being
6239 <p>The argument and return value are floating point numbers of the same
6240 type.</p>
6243 <p>This function returns the sqrt of the specified operand if it is a
6244 nonnegative floating point number.</p>
6246 </div>
6248 <!-- _______________________________________________________________________ -->
6251 </div>
6257 floating point or vector of floating point type. Not all targets support all
6258 types however.</p>
6260 <pre>
6261 declare float @llvm.powi.f32(float %Val, i32 %power)
6262 declare double @llvm.powi.f64(double %Val, i32 %power)
6263 declare x86_fp80 @llvm.powi.f80(x86_fp80 %Val, i32 %power)
6264 declare fp128 @llvm.powi.f128(fp128 %Val, i32 %power)
6265 declare ppc_fp128 @llvm.powi.ppcf128(ppc_fp128 %Val, i32 %power)
6266 </pre>
6270 specified (positive or negative) power. The order of evaluation of
6271 multiplications is not defined. When a vector of floating point type is
6272 used, the second argument remains a scalar integer value.</p>
6275 <p>The second argument is an integer power, and the first is a value to raise to
6276 that power.</p>
6279 <p>This function returns the first value raised to the second power with an
6280 unspecified sequence of rounding operations.</p>
6282 </div>
6284 <!-- _______________________________________________________________________ -->
6287 </div>
6293 floating point or vector of floating point type. Not all targets support all
6294 types however.</p>
6296 <pre>
6297 declare float @llvm.sin.f32(float %Val)
6298 declare double @llvm.sin.f64(double %Val)
6299 declare x86_fp80 @llvm.sin.f80(x86_fp80 %Val)
6300 declare fp128 @llvm.sin.f128(fp128 %Val)
6301 declare ppc_fp128 @llvm.sin.ppcf128(ppc_fp128 %Val)
6302 </pre>
6308 <p>The argument and return value are floating point numbers of the same
6309 type.</p>
6312 <p>This function returns the sine of the specified operand, returning the same
6314 in the same way.</p>
6316 </div>
6318 <!-- _______________________________________________________________________ -->
6321 </div>
6327 floating point or vector of floating point type. Not all targets support all
6328 types however.</p>
6330 <pre>
6331 declare float @llvm.cos.f32(float %Val)
6332 declare double @llvm.cos.f64(double %Val)
6333 declare x86_fp80 @llvm.cos.f80(x86_fp80 %Val)
6334 declare fp128 @llvm.cos.f128(fp128 %Val)
6335 declare ppc_fp128 @llvm.cos.ppcf128(ppc_fp128 %Val)
6336 </pre>
6342 <p>The argument and return value are floating point numbers of the same
6343 type.</p>
6346 <p>This function returns the cosine of the specified operand, returning the same
6348 in the same way.</p>
6350 </div>
6352 <!-- _______________________________________________________________________ -->
6355 </div>
6361 floating point or vector of floating point type. Not all targets support all
6362 types however.</p>
6364 <pre>
6365 declare float @llvm.pow.f32(float %Val, float %Power)
6366 declare double @llvm.pow.f64(double %Val, double %Power)
6367 declare x86_fp80 @llvm.pow.f80(x86_fp80 %Val, x86_fp80 %Power)
6368 declare fp128 @llvm.pow.f128(fp128 %Val, fp128 %Power)
6369 declare ppc_fp128 @llvm.pow.ppcf128(ppc_fp128 %Val, ppc_fp128 Power)
6370 </pre>
6374 specified (positive or negative) power.</p>
6377 <p>The second argument is a floating point power, and the first is a value to
6378 raise to that power.</p>
6381 <p>This function returns the first value raised to the second power, returning
6383 conditions in the same way.</p>
6385 </div>
6387 <!-- ======================================================================= -->
6390 </div>
6394 <p>LLVM provides intrinsics for a few important bit manipulation operations.
6395 These allow efficient code generation for some algorithms.</p>
6397 </div>
6399 <!-- _______________________________________________________________________ -->
6402 </div>
6407 <p>This is an overloaded intrinsic function. You can use bswap on any integer
6410 <pre>
6414 </pre>
6418 values with an even number of bytes (positive multiple of 16 bits). These
6419 are useful for performing operations on data that is not in the target's
6420 native byte order.</p>
6424 and low byte of the input i16 swapped. Similarly,
6430 more, respectively).</p>
6432 </div>
6434 <!-- _______________________________________________________________________ -->
6437 </div>
6442 <p>This is an overloaded intrinsic. You can use llvm.ctpop on any integer bit
6443 width. Not all targets support all bit widths however.</p>
6445 <pre>
6451 </pre>
6455 in a value.</p>
6458 <p>The only argument is the value to be counted. The argument may be of any
6459 integer type. The return type must match the argument type.</p>
6464 </div>
6466 <!-- _______________________________________________________________________ -->
6469 </div>
6475 integer bit width. Not all targets support all bit widths however.</p>
6477 <pre>
6483 </pre>
6487 leading zeros in a variable.</p>
6490 <p>The only argument is the value to be counted. The argument may be of any
6491 integer type. The return type must match the argument type.</p>
6495 zeros in a variable. If the src == 0 then the result is the size in bits of
6498 </div>
6500 <!-- _______________________________________________________________________ -->
6503 </div>
6509 integer bit width. Not all targets support all bit widths however.</p>
6511 <pre>
6517 </pre>
6521 trailing zeros.</p>
6524 <p>The only argument is the value to be counted. The argument may be of any
6525 integer type. The return type must match the argument type.</p>
6529 zeros in a variable. If the src == 0 then the result is the size in bits of
6532 </div>
6534 <!-- ======================================================================= -->
6537 </div>
6543 </div>
6545 <!-- _______________________________________________________________________ -->
6548 </div>
6554 on any integer bit width.</p>
6556 <pre>
6557 declare {i16, i1} @llvm.sadd.with.overflow.i16(i16 %a, i16 %b)
6558 declare {i32, i1} @llvm.sadd.with.overflow.i32(i32 %a, i32 %b)
6559 declare {i64, i1} @llvm.sadd.with.overflow.i64(i64 %a, i64 %b)
6560 </pre>
6564 a signed addition of the two arguments, and indicate whether an overflow
6565 occurred during the signed summation.</p>
6568 <p>The arguments (%a and %b) and the first element of the result structure may
6569 be of integer types of any bit width, but they must have the same bit
6570 width. The second element of the result structure must be of
6572 undergo signed addition.</p>
6576 a signed addition of the two variables. They return a structure — the
6577 first element of which is the signed summation, and the second element of
6578 which is a bit specifying if the signed summation resulted in an
6579 overflow.</p>
6582 <pre>
6583 %res = call {i32, i1} @llvm.sadd.with.overflow.i32(i32 %a, i32 %b)
6584 %sum = extractvalue {i32, i1} %res, 0
6585 %obit = extractvalue {i32, i1} %res, 1
6586 br i1 %obit, label %overflow, label %normal
6587 </pre>
6589 </div>
6591 <!-- _______________________________________________________________________ -->
6594 </div>
6600 on any integer bit width.</p>
6602 <pre>
6603 declare {i16, i1} @llvm.uadd.with.overflow.i16(i16 %a, i16 %b)
6604 declare {i32, i1} @llvm.uadd.with.overflow.i32(i32 %a, i32 %b)
6605 declare {i64, i1} @llvm.uadd.with.overflow.i64(i64 %a, i64 %b)
6606 </pre>
6610 an unsigned addition of the two arguments, and indicate whether a carry
6611 occurred during the unsigned summation.</p>
6614 <p>The arguments (%a and %b) and the first element of the result structure may
6615 be of integer types of any bit width, but they must have the same bit
6616 width. The second element of the result structure must be of
6618 undergo unsigned addition.</p>
6622 an unsigned addition of the two arguments. They return a structure —
6623 the first element of which is the sum, and the second element of which is a
6624 bit specifying if the unsigned summation resulted in a carry.</p>
6627 <pre>
6628 %res = call {i32, i1} @llvm.uadd.with.overflow.i32(i32 %a, i32 %b)
6629 %sum = extractvalue {i32, i1} %res, 0
6630 %obit = extractvalue {i32, i1} %res, 1
6631 br i1 %obit, label %carry, label %normal
6632 </pre>
6634 </div>
6636 <!-- _______________________________________________________________________ -->
6639 </div>
6645 on any integer bit width.</p>
6647 <pre>
6648 declare {i16, i1} @llvm.ssub.with.overflow.i16(i16 %a, i16 %b)
6649 declare {i32, i1} @llvm.ssub.with.overflow.i32(i32 %a, i32 %b)
6650 declare {i64, i1} @llvm.ssub.with.overflow.i64(i64 %a, i64 %b)
6651 </pre>
6655 a signed subtraction of the two arguments, and indicate whether an overflow
6656 occurred during the signed subtraction.</p>
6659 <p>The arguments (%a and %b) and the first element of the result structure may
6660 be of integer types of any bit width, but they must have the same bit
6661 width. The second element of the result structure must be of
6663 undergo signed subtraction.</p>
6667 a signed subtraction of the two arguments. They return a structure —
6668 the first element of which is the subtraction, and the second element of
6669 which is a bit specifying if the signed subtraction resulted in an
6670 overflow.</p>
6673 <pre>
6674 %res = call {i32, i1} @llvm.ssub.with.overflow.i32(i32 %a, i32 %b)
6675 %sum = extractvalue {i32, i1} %res, 0
6676 %obit = extractvalue {i32, i1} %res, 1
6677 br i1 %obit, label %overflow, label %normal
6678 </pre>
6680 </div>
6682 <!-- _______________________________________________________________________ -->
6685 </div>
6691 on any integer bit width.</p>
6693 <pre>
6694 declare {i16, i1} @llvm.usub.with.overflow.i16(i16 %a, i16 %b)
6695 declare {i32, i1} @llvm.usub.with.overflow.i32(i32 %a, i32 %b)
6696 declare {i64, i1} @llvm.usub.with.overflow.i64(i64 %a, i64 %b)
6697 </pre>
6701 an unsigned subtraction of the two arguments, and indicate whether an
6702 overflow occurred during the unsigned subtraction.</p>
6705 <p>The arguments (%a and %b) and the first element of the result structure may
6706 be of integer types of any bit width, but they must have the same bit
6707 width. The second element of the result structure must be of
6709 undergo unsigned subtraction.</p>
6713 an unsigned subtraction of the two arguments. They return a structure —
6714 the first element of which is the subtraction, and the second element of
6715 which is a bit specifying if the unsigned subtraction resulted in an
6716 overflow.</p>
6719 <pre>
6720 %res = call {i32, i1} @llvm.usub.with.overflow.i32(i32 %a, i32 %b)
6721 %sum = extractvalue {i32, i1} %res, 0
6722 %obit = extractvalue {i32, i1} %res, 1
6723 br i1 %obit, label %overflow, label %normal
6724 </pre>
6726 </div>
6728 <!-- _______________________________________________________________________ -->
6731 </div>
6737 on any integer bit width.</p>
6739 <pre>
6740 declare {i16, i1} @llvm.smul.with.overflow.i16(i16 %a, i16 %b)
6741 declare {i32, i1} @llvm.smul.with.overflow.i32(i32 %a, i32 %b)
6742 declare {i64, i1} @llvm.smul.with.overflow.i64(i64 %a, i64 %b)
6743 </pre>
6748 a signed multiplication of the two arguments, and indicate whether an
6749 overflow occurred during the signed multiplication.</p>
6752 <p>The arguments (%a and %b) and the first element of the result structure may
6753 be of integer types of any bit width, but they must have the same bit
6754 width. The second element of the result structure must be of
6756 undergo signed multiplication.</p>
6760 a signed multiplication of the two arguments. They return a structure —
6761 the first element of which is the multiplication, and the second element of
6762 which is a bit specifying if the signed multiplication resulted in an
6763 overflow.</p>
6766 <pre>
6767 %res = call {i32, i1} @llvm.smul.with.overflow.i32(i32 %a, i32 %b)
6768 %sum = extractvalue {i32, i1} %res, 0
6769 %obit = extractvalue {i32, i1} %res, 1
6770 br i1 %obit, label %overflow, label %normal
6771 </pre>
6773 </div>
6775 <!-- _______________________________________________________________________ -->
6778 </div>
6784 on any integer bit width.</p>
6786 <pre>
6787 declare {i16, i1} @llvm.umul.with.overflow.i16(i16 %a, i16 %b)
6788 declare {i32, i1} @llvm.umul.with.overflow.i32(i32 %a, i32 %b)
6789 declare {i64, i1} @llvm.umul.with.overflow.i64(i64 %a, i64 %b)
6790 </pre>
6794 a unsigned multiplication of the two arguments, and indicate whether an
6795 overflow occurred during the unsigned multiplication.</p>
6798 <p>The arguments (%a and %b) and the first element of the result structure may
6799 be of integer types of any bit width, but they must have the same bit
6800 width. The second element of the result structure must be of
6802 undergo unsigned multiplication.</p>
6806 an unsigned multiplication of the two arguments. They return a structure
6807 — the first element of which is the multiplication, and the second
6808 element of which is a bit specifying if the unsigned multiplication resulted
6809 in an overflow.</p>
6812 <pre>
6813 %res = call {i32, i1} @llvm.umul.with.overflow.i32(i32 %a, i32 %b)
6814 %sum = extractvalue {i32, i1} %res, 0
6815 %obit = extractvalue {i32, i1} %res, 1
6816 br i1 %obit, label %overflow, label %normal
6817 </pre>
6819 </div>
6821 <!-- ======================================================================= -->
6824 </div>
6828 <p>Half precision floating point is a storage-only format. This means that it is
6829 a dense encoding (in memory) but does not support computation in the
6830 format.</p>
6832 <p>This means that code must first load the half-precision floating point
6833 value as an i16, then convert it to float with <a
6835 Computation can then be performed on the float value (including extending to
6836 double etc). To store the value back to memory, it is first converted to
6837 float if needed, then converted to i16 with
6839 storing as an i16 value.</p>
6840 </div>
6842 <!-- _______________________________________________________________________ -->
6845 </div>
6850 <pre>
6851 declare i16 @llvm.convert.to.fp16(f32 %a)
6852 </pre>
6856 a conversion from single precision floating point format to half precision
6857 floating point format.</p>
6860 <p>The intrinsic function contains single argument - the value to be
6861 converted.</p>
6865 a conversion from single precision floating point format to half precision
6867 contains the converted number.</p>
6870 <pre>
6871 %res = call i16 @llvm.convert.to.fp16(f32 %a)
6872 store i16 %res, i16* @x, align 2
6873 </pre>
6875 </div>
6877 <!-- _______________________________________________________________________ -->
6880 </div>
6885 <pre>
6886 declare f32 @llvm.convert.from.fp16(i16 %a)
6887 </pre>
6891 a conversion from half precision floating point format to single precision
6892 floating point format.</p>
6895 <p>The intrinsic function contains single argument - the value to be
6896 converted.</p>
6900 conversion from half single precision floating point format to single
6901 precision floating point format. The input half-float value is represented by
6905 <pre>
6906 %a = load i16* @x, align 2
6907 %res = call f32 @llvm.convert.from.fp16(i16 %a)
6908 </pre>
6910 </div>
6912 <!-- ======================================================================= -->
6915 </div>
6920 prefix), are described in
6924 </div>
6926 <!-- ======================================================================= -->
6929 </div>
6933 <p>The LLVM exception handling intrinsics (which all start with
6938 </div>
6940 <!-- ======================================================================= -->
6943 </div>
6947 <p>This intrinsic makes it possible to excise one parameter, marked with
6949 The result is a callable
6950 function pointer lacking the nest parameter - the caller does not need to
6951 provide a value for it. Instead, the value to use is stored in advance in a
6952 "trampoline", a block of memory usually allocated on the stack, which also
6953 contains code to splice the nest value into the argument list. This is used
6954 to implement the GCC nested function address extension.</p>
6956 <p>For example, if the function is
6959 follows:</p>
6964 %p = call i8* @llvm.init.trampoline(i8* %tramp1, i8* bitcast (i32 (i8* nest , i32, i32)* @f to i8*), i8* %nval)
6965 %fp = bitcast i8* %p to i32 (i32, i32)*
6966 </pre>
6971 </div>
6973 <!-- _______________________________________________________________________ -->
6976 </div>
6981 <pre>
6983 </pre>
6987 function pointer suitable for executing it.</p>
6992 sufficiently aligned block of memory; this memory is written to by the
6993 intrinsic. Note that the size and the alignment are target-specific - LLVM
6994 currently provides no portable way of determining them, so a front-end that
6995 generates this intrinsic needs to have some target-specific knowledge.
7001 dependent code, turning it into a function. A pointer to this function is
7003 function pointer type</a> before being called. The new function's signature
7006 is allowed, and it must be of pointer type. Calling the new function is
7011 returned function pointer is undefined.</p>
7013 </div>
7015 <!-- ======================================================================= -->
7018 </div>
7023 hardware constructs for atomic operations and memory synchronization. This
7024 provides an interface to the hardware, not an interface to the programmer. It
7025 is aimed at a low enough level to allow any programming models or APIs
7026 (Application Programming Interfaces) which need atomic behaviors to map
7027 cleanly onto it. It is also modeled primarily on hardware behavior. Just as
7028 hardware provides a "universal IR" for source languages, it also provides a
7029 starting point for developing a "universal" atomic operation and
7030 synchronization IR.</p>
7033 software transaction memory systems, atomic primitives, and intrinsic
7034 functions as found in BSD, GNU libc, atomic_ops, APR, and other system and
7035 application libraries. The hardware interface provided by LLVM should allow
7036 a clean implementation of all of these APIs and parallel programming models.
7037 No one model or paradigm should be selected above others unless the hardware
7038 itself ubiquitously does so.</p>
7040 </div>
7042 <!-- _______________________________________________________________________ -->
7045 </div>
7048 <pre>
7049 declare void @llvm.memory.barrier(i1 <ll>, i1 <ls>, i1 <sl>, i1 <ss>, i1 <device>)
7050 </pre>
7054 specific pairs of memory access types.</p>
7058 The first four arguments enables a specific barrier as listed below. The
7059 fifth argument specifies that the barrier applies to io or device or uncached
7060 memory.</p>
7062 <ul>
7068 </ul>
7071 <p>This intrinsic causes the system to enforce some ordering constraints upon
7072 the loads and stores of the program. This barrier does not
7075 and store operations (f.ex. load-load, or store-load), all of the first
7076 operations preceding the barrier will complete before any of the second
7077 operations succeeding the barrier begin. Specifically the semantics for each
7078 pairing is as follows:</p>
7080 <ul>
7082 after the barrier begins.</li>
7084 store after the barrier begins.</li>
7086 store after the barrier begins.</li>
7088 load after the barrier begins.</li>
7089 </ul>
7092 is enabled in a single memory barrier intrinsic.</p>
7094 <p>Backends may implement stronger barriers than those requested when they do
7095 not support as fine grained a barrier as requested. Some architectures do
7096 not need all types of barriers and on such architectures, these become
7097 noops.</p>
7100 <pre>
7101 %mallocP = tail call i8* @malloc(i32 ptrtoint (i32* getelementptr (i32* null, i32 1) to i32))
7102 %ptr = bitcast i8* %mallocP to i32*
7103 store i32 4, %ptr
7106 call void @llvm.memory.barrier(i1 false, i1 true, i1 false, i1 false)
7109 </pre>
7111 </div>
7113 <!-- _______________________________________________________________________ -->
7116 </div>
7122 any integer bit width and for different address spaces. Not all targets
7123 support all bit widths however.</p>
7125 <pre>
7127 declare i16 @llvm.atomic.cmp.swap.i16.p0i16(i16* <ptr>, i16 <cmp>, i16 <val>)
7128 declare i32 @llvm.atomic.cmp.swap.i32.p0i32(i32* <ptr>, i32 <cmp>, i32 <val>)
7129 declare i64 @llvm.atomic.cmp.swap.i64.p0i64(i64* <ptr>, i64 <cmp>, i64 <val>)
7130 </pre>
7133 <p>This loads a value in memory and compares it to a given value. If they are
7134 equal, it stores a new value into the memory.</p>
7140 this integer type. While any bit width integer may be used, targets may only
7141 lower representations they support in hardware.</p>
7144 <p>This entire intrinsic must be executed atomically. It first loads the value
7147 memory. The loaded value is yielded in all cases. This provides the
7148 equivalent of an atomic compare-and-swap operation within the SSA
7149 framework.</p>
7152 <pre>
7153 %mallocP = tail call i8* @malloc(i32 ptrtoint (i32* getelementptr (i32* null, i32 1) to i32))
7154 %ptr = bitcast i8* %mallocP to i32*
7155 store i32 4, %ptr
7158 %result1 = call i32 @llvm.atomic.cmp.swap.i32.p0i32(i32* %ptr, i32 4, %val1)
7164 %result2 = call i32 @llvm.atomic.cmp.swap.i32.p0i32(i32* %ptr, i32 5, %val2)
7169 </pre>
7171 </div>
7173 <!-- _______________________________________________________________________ -->
7176 </div>
7181 integer bit width. Not all targets support all bit widths however.</p>
7183 <pre>
7188 </pre>
7199 integer type. The targets may only lower integer representations they
7200 support.</p>
7205 equivalent of an atomic swap operation within the SSA framework.</p>
7208 <pre>
7209 %mallocP = tail call i8* @malloc(i32 ptrtoint (i32* getelementptr (i32* null, i32 1) to i32))
7210 %ptr = bitcast i8* %mallocP to i32*
7211 store i32 4, %ptr
7214 %result1 = call i32 @llvm.atomic.swap.i32.p0i32(i32* %ptr, i32 %val1)
7220 %result2 = call i32 @llvm.atomic.swap.i32.p0i32(i32* %ptr, i32 %val2)
7225 </pre>
7227 </div>
7229 <!-- _______________________________________________________________________ -->
7233 </div>
7239 any integer bit width. Not all targets support all bit widths however.</p>
7241 <pre>
7246 </pre>
7253 <p>The intrinsic takes two arguments, the first a pointer to an integer value
7254 and the second an integer value. The result is also an integer value. These
7255 integer types can have any bit width, but they must all have the same bit
7256 width. The targets may only lower integer representations they support.</p>
7259 <p>This intrinsic does a series of operations atomically. It first loads the
7264 <pre>
7265 %mallocP = tail call i8* @malloc(i32 ptrtoint (i32* getelementptr (i32* null, i32 1) to i32))
7266 %ptr = bitcast i8* %mallocP to i32*
7267 store i32 4, %ptr
7268 %result1 = call i32 @llvm.atomic.load.add.i32.p0i32(i32* %ptr, i32 4)
7270 %result2 = call i32 @llvm.atomic.load.add.i32.p0i32(i32* %ptr, i32 2)
7272 %result3 = call i32 @llvm.atomic.load.add.i32.p0i32(i32* %ptr, i32 5)
7275 </pre>
7277 </div>
7279 <!-- _______________________________________________________________________ -->
7283 </div>
7289 any integer bit width and for different address spaces. Not all targets
7290 support all bit widths however.</p>
7292 <pre>
7297 </pre>
7304 <p>The intrinsic takes two arguments, the first a pointer to an integer value
7305 and the second an integer value. The result is also an integer value. These
7306 integer types can have any bit width, but they must all have the same bit
7307 width. The targets may only lower integer representations they support.</p>
7310 <p>This intrinsic does a series of operations atomically. It first loads the
7316 <pre>
7317 %mallocP = tail call i8* @malloc(i32 ptrtoint (i32* getelementptr (i32* null, i32 1) to i32))
7318 %ptr = bitcast i8* %mallocP to i32*
7319 store i32 8, %ptr
7320 %result1 = call i32 @llvm.atomic.load.sub.i32.p0i32(i32* %ptr, i32 4)
7322 %result2 = call i32 @llvm.atomic.load.sub.i32.p0i32(i32* %ptr, i32 2)
7324 %result3 = call i32 @llvm.atomic.load.sub.i32.p0i32(i32* %ptr, i32 5)
7327 </pre>
7329 </div>
7331 <!-- _______________________________________________________________________ -->
7337 </div>
7342 <p>These are overloaded intrinsics. You can
7345 bit width and for different address spaces. Not all targets support all bit
7346 widths however.</p>
7348 <pre>
7353 </pre>
7355 <pre>
7360 </pre>
7362 <pre>
7367 </pre>
7369 <pre>
7374 </pre>
7382 <p>These intrinsics take two arguments, the first a pointer to an integer value
7383 and the second an integer value. The result is also an integer value. These
7384 integer types can have any bit width, but they must all have the same bit
7385 width. The targets may only lower integer representations they support.</p>
7388 <p>These intrinsics does a series of operations atomically. They first load the
7394 <pre>
7395 %mallocP = tail call i8* @malloc(i32 ptrtoint (i32* getelementptr (i32* null, i32 1) to i32))
7396 %ptr = bitcast i8* %mallocP to i32*
7397 store i32 0x0F0F, %ptr
7398 %result0 = call i32 @llvm.atomic.load.nand.i32.p0i32(i32* %ptr, i32 0xFF)
7400 %result1 = call i32 @llvm.atomic.load.and.i32.p0i32(i32* %ptr, i32 0xFF)
7402 %result2 = call i32 @llvm.atomic.load.or.i32.p0i32(i32* %ptr, i32 0F)
7404 %result3 = call i32 @llvm.atomic.load.xor.i32.p0i32(i32* %ptr, i32 0F)
7407 </pre>
7409 </div>
7411 <!-- _______________________________________________________________________ -->
7417 </div>
7425 address spaces. Not all targets support all bit widths however.</p>
7427 <pre>
7432 </pre>
7434 <pre>
7439 </pre>
7441 <pre>
7446 </pre>
7448 <pre>
7453 </pre>
7456 <p>These intrinsics takes the signed or unsigned minimum or maximum of
7461 <p>These intrinsics take two arguments, the first a pointer to an integer value
7462 and the second an integer value. The result is also an integer value. These
7463 integer types can have any bit width, but they must all have the same bit
7464 width. The targets may only lower integer representations they support.</p>
7467 <p>These intrinsics does a series of operations atomically. They first load the
7473 <pre>
7474 %mallocP = tail call i8* @malloc(i32 ptrtoint (i32* getelementptr (i32* null, i32 1) to i32))
7475 %ptr = bitcast i8* %mallocP to i32*
7476 store i32 7, %ptr
7477 %result0 = call i32 @llvm.atomic.load.min.i32.p0i32(i32* %ptr, i32 -2)
7479 %result1 = call i32 @llvm.atomic.load.max.i32.p0i32(i32* %ptr, i32 8)
7481 %result2 = call i32 @llvm.atomic.load.umin.i32.p0i32(i32* %ptr, i32 10)
7483 %result3 = call i32 @llvm.atomic.load.umax.i32.p0i32(i32* %ptr, i32 30)
7486 </pre>
7488 </div>
7491 <!-- ======================================================================= -->
7494 </div>
7498 <p>This class of intrinsics exists to information about the lifetime of memory
7499 objects and ranges where variables are immutable.</p>
7501 </div>
7503 <!-- _______________________________________________________________________ -->
7506 </div>
7511 <pre>
7513 </pre>
7517 object's lifetime.</p>
7520 <p>The first argument is a constant integer representing the size of the
7521 object, or -1 if it is variable sized. The second argument is a pointer to
7522 the object.</p>
7525 <p>This intrinsic indicates that before this point in the code, the value of the
7527 never be used and has an undefined value. A load from the pointer that
7528 precedes this intrinsic can be replaced with
7531 </div>
7533 <!-- _______________________________________________________________________ -->
7536 </div>
7541 <pre>
7543 </pre>
7547 object's lifetime.</p>
7550 <p>The first argument is a constant integer representing the size of the
7551 object, or -1 if it is variable sized. The second argument is a pointer to
7552 the object.</p>
7555 <p>This intrinsic indicates that after this point in the code, the value of the
7557 never be used and has an undefined value. Any stores into the memory object
7558 following this intrinsic may be removed as dead.
7560 </div>
7562 <!-- _______________________________________________________________________ -->
7565 </div>
7570 <pre>
7572 </pre>
7576 a memory object will not change.</p>
7579 <p>The first argument is a constant integer representing the size of the
7580 object, or -1 if it is variable sized. The second argument is a pointer to
7581 the object.</p>
7585 the return value, the referenced memory location is constant and
7586 unchanging.</p>
7588 </div>
7590 <!-- _______________________________________________________________________ -->
7593 </div>
7598 <pre>
7599 declare void @llvm.invariant.end({}* <start>, i64 <size>, i8* nocapture <ptr>)
7600 </pre>
7604 a memory object are mutable.</p>
7608 The second argument is a constant integer representing the size of the
7609 object, or -1 if it is variable sized and the third argument is a pointer
7610 to the object.</p>
7615 </div>
7617 <!-- ======================================================================= -->
7620 </div>
7624 <p>This class of intrinsics is designed to be generic and has no specific
7625 purpose.</p>
7627 </div>
7629 <!-- _______________________________________________________________________ -->
7632 </div>
7637 <pre>
7638 declare void @llvm.var.annotation(i8* <val>, i8* <str>, i8* <str>, i32 <int>)
7639 </pre>
7645 <p>The first argument is a pointer to a value, the second is a pointer to a
7646 global string, the third is a pointer to a global string which is the source
7647 file name, and the last argument is the line number.</p>
7650 <p>This intrinsic allows annotation of local variables with arbitrary strings.
7651 This can be useful for special purpose optimizations that want to look for
7652 these annotations. These have no other defined use, they are ignored by code
7653 generation and optimization.</p>
7655 </div>
7657 <!-- _______________________________________________________________________ -->
7660 </div>
7666 any integer bit width.</p>
7668 <pre>
7669 declare i8 @llvm.annotation.i8(i8 <val>, i8* <str>, i8* <str>, i32 <int>)
7670 declare i16 @llvm.annotation.i16(i16 <val>, i8* <str>, i8* <str>, i32 <int>)
7671 declare i32 @llvm.annotation.i32(i32 <val>, i8* <str>, i8* <str>, i32 <int>)
7672 declare i64 @llvm.annotation.i64(i64 <val>, i8* <str>, i8* <str>, i32 <int>)
7673 declare i256 @llvm.annotation.i256(i256 <val>, i8* <str>, i8* <str>, i32 <int>)
7674 </pre>
7680 <p>The first argument is an integer value (result of some expression), the
7681 second is a pointer to a global string, the third is a pointer to a global
7682 string which is the source file name, and the last argument is the line
7683 number. It returns the value of the first argument.</p>
7686 <p>This intrinsic allows annotations to be put on arbitrary expressions with
7687 arbitrary strings. This can be useful for special purpose optimizations that
7688 want to look for these annotations. These have no other defined use, they
7689 are ignored by code generation and optimization.</p>
7691 </div>
7693 <!-- _______________________________________________________________________ -->
7696 </div>
7701 <pre>
7702 declare void @llvm.trap()
7703 </pre>
7712 <p>This intrinsics is lowered to the target dependent trap instruction. If the
7713 target does not have a trap instruction, this intrinsic will be lowered to
7716 </div>
7718 <!-- _______________________________________________________________________ -->
7721 </div>
7726 <pre>
7728 </pre>
7733 ensure that it is placed on the stack before local variables.</p>
7737 arguments. The first argument is the value loaded from the stack
7739 that has enough space to hold the value of the guard.</p>
7742 <p>This intrinsic causes the prologue/epilogue inserter to force the position of
7744 stack. This is to ensure that if a local variable on the stack is
7745 overwritten, it will destroy the value of the guard. When the function exits,
7746 the guard on the stack is checked against the original guard. If they are
7748 function.</p>
7750 </div>
7752 <!-- _______________________________________________________________________ -->
7755 </div>
7760 <pre>
7763 </pre>
7767 the optimizers to determine at compile time whether a) an operation (like
7768 memcpy) will overflow a buffer that corresponds to an object, or b) that a
7769 runtime check for overflow isn't necessary. An object in this context means
7770 an allocation of a specific class, structure, array, or other object.</p>
7783 compile time.</p>
7785 </div>
7787 <!-- *********************************************************************** -->
7788 <hr>
7789 <address>
7797 Last modified: $Date$
7798 </address>
7800 </body>
7801 </html>