1 ==============================
2 LLVM Language Reference Manual
3 ==============================
12 This document is a reference manual for the LLVM assembly language. LLVM
13 is a Static Single Assignment (SSA) based representation that provides
14 type safety, low-level operations, flexibility, and the capability of
15 representing 'all' high-level languages cleanly. It is the common code
16 representation used throughout all phases of the LLVM compilation
22 The LLVM code representation is designed to be used in three different
23 forms: as an in-memory compiler IR, as an on-disk bitcode representation
24 (suitable for fast loading by a Just-In-Time compiler), and as a human
25 readable assembly language representation. This allows LLVM to provide a
26 powerful intermediate representation for efficient compiler
27 transformations and analysis, while providing a natural means to debug
28 and visualize the transformations. The three different forms of LLVM are
29 all equivalent. This document describes the human readable
30 representation and notation.
32 The LLVM representation aims to be light-weight and low-level while
33 being expressive, typed, and extensible at the same time. It aims to be
34 a "universal IR" of sorts, by being at a low enough level that
35 high-level ideas may be cleanly mapped to it (similar to how
36 microprocessors are "universal IR's", allowing many source languages to
37 be mapped to them). By providing type information, LLVM can be used as
38 the target of optimizations: for example, through pointer analysis, it
39 can be proven that a C automatic variable is never accessed outside of
40 the current function, allowing it to be promoted to a simple SSA value
41 instead of a memory location.
48 It is important to note that this document describes 'well formed' LLVM
49 assembly language. There is a difference between what the parser accepts
50 and what is considered 'well formed'. For example, the following
51 instruction is syntactically okay, but not well formed:
57 because the definition of ``%x`` does not dominate all of its uses. The
58 LLVM infrastructure provides a verification pass that may be used to
59 verify that an LLVM module is well formed. This pass is automatically
60 run by the parser after parsing input assembly and by the optimizer
61 before it outputs bitcode. The violations pointed out by the verifier
62 pass indicate bugs in transformation passes or input to the parser.
69 LLVM identifiers come in two basic types: global and local. Global
70 identifiers (functions, global variables) begin with the ``'@'``
71 character. Local identifiers (register names, types) begin with the
72 ``'%'`` character. Additionally, there are three different formats for
73 identifiers, for different purposes:
75 #. Named values are represented as a string of characters with their
76 prefix. For example, ``%foo``, ``@DivisionByZero``,
77 ``%a.really.long.identifier``. The actual regular expression used is
78 '``[%@][-a-zA-Z$._][-a-zA-Z$._0-9]*``'. Identifiers that require other
79 characters in their names can be surrounded with quotes. Special
80 characters may be escaped using ``"\xx"`` where ``xx`` is the ASCII
81 code for the character in hexadecimal. In this way, any character can
82 be used in a name value, even quotes themselves. The ``"\01"`` prefix
83 can be used on global variables to suppress mangling.
84 #. Unnamed values are represented as an unsigned numeric value with
85 their prefix. For example, ``%12``, ``@2``, ``%44``.
86 #. Constants, which are described in the section Constants_ below.
88 LLVM requires that values start with a prefix for two reasons: Compilers
89 don't need to worry about name clashes with reserved words, and the set
90 of reserved words may be expanded in the future without penalty.
91 Additionally, unnamed identifiers allow a compiler to quickly come up
92 with a temporary variable without having to avoid symbol table
95 Reserved words in LLVM are very similar to reserved words in other
96 languages. There are keywords for different opcodes ('``add``',
97 '``bitcast``', '``ret``', etc...), for primitive type names ('``void``',
98 '``i32``', etc...), and others. These reserved words cannot conflict
99 with variable names, because none of them start with a prefix character
100 (``'%'`` or ``'@'``).
102 Here is an example of LLVM code to multiply the integer variable
109 %result = mul i32 %X, 8
111 After strength reduction:
115 %result = shl i32 %X, 3
121 %0 = add i32 %X, %X ; yields i32:%0
122 %1 = add i32 %0, %0 ; yields i32:%1
123 %result = add i32 %1, %1
125 This last way of multiplying ``%X`` by 8 illustrates several important
126 lexical features of LLVM:
128 #. Comments are delimited with a '``;``' and go until the end of line.
129 #. Unnamed temporaries are created when the result of a computation is
130 not assigned to a named value.
131 #. Unnamed temporaries are numbered sequentially (using a per-function
132 incrementing counter, starting with 0). Note that basic blocks and unnamed
133 function parameters are included in this numbering. For example, if the
134 entry basic block is not given a label name and all function parameters are
135 named, then it will get number 0.
137 It also shows a convention that we follow in this document. When
138 demonstrating instructions, we will follow an instruction with a comment
139 that defines the type and name of value produced.
147 LLVM programs are composed of ``Module``'s, each of which is a
148 translation unit of the input programs. Each module consists of
149 functions, global variables, and symbol table entries. Modules may be
150 combined together with the LLVM linker, which merges function (and
151 global variable) definitions, resolves forward declarations, and merges
152 symbol table entries. Here is an example of the "hello world" module:
156 ; Declare the string constant as a global constant.
157 @.str = private unnamed_addr constant [13 x i8] c"hello world\0A\00"
159 ; External declaration of the puts function
160 declare i32 @puts(i8* nocapture) nounwind
162 ; Definition of main function
163 define i32 @main() { ; i32()*
164 ; Convert [13 x i8]* to i8 *...
165 %cast210 = getelementptr [13 x i8], [13 x i8]* @.str, i64 0, i64 0
167 ; Call puts function to write out the string to stdout.
168 call i32 @puts(i8* %cast210)
173 !0 = !{i32 42, null, !"string"}
176 This example is made up of a :ref:`global variable <globalvars>` named
177 "``.str``", an external declaration of the "``puts``" function, a
178 :ref:`function definition <functionstructure>` for "``main``" and
179 :ref:`named metadata <namedmetadatastructure>` "``foo``".
181 In general, a module is made up of a list of global values (where both
182 functions and global variables are global values). Global values are
183 represented by a pointer to a memory location (in this case, a pointer
184 to an array of char, and a pointer to a function), and have one of the
185 following :ref:`linkage types <linkage>`.
192 All Global Variables and Functions have one of the following types of
196 Global values with "``private``" linkage are only directly
197 accessible by objects in the current module. In particular, linking
198 code into a module with an private global value may cause the
199 private to be renamed as necessary to avoid collisions. Because the
200 symbol is private to the module, all references can be updated. This
201 doesn't show up in any symbol table in the object file.
203 Similar to private, but the value shows as a local symbol
204 (``STB_LOCAL`` in the case of ELF) in the object file. This
205 corresponds to the notion of the '``static``' keyword in C.
206 ``available_externally``
207 Globals with "``available_externally``" linkage are never emitted
208 into the object file corresponding to the LLVM module. They exist to
209 allow inlining and other optimizations to take place given knowledge
210 of the definition of the global, which is known to be somewhere
211 outside the module. Globals with ``available_externally`` linkage
212 are allowed to be discarded at will, and are otherwise the same as
213 ``linkonce_odr``. This linkage type is only allowed on definitions,
216 Globals with "``linkonce``" linkage are merged with other globals of
217 the same name when linkage occurs. This can be used to implement
218 some forms of inline functions, templates, or other code which must
219 be generated in each translation unit that uses it, but where the
220 body may be overridden with a more definitive definition later.
221 Unreferenced ``linkonce`` globals are allowed to be discarded. Note
222 that ``linkonce`` linkage does not actually allow the optimizer to
223 inline the body of this function into callers because it doesn't
224 know if this definition of the function is the definitive definition
225 within the program or whether it will be overridden by a stronger
226 definition. To enable inlining and other optimizations, use
227 "``linkonce_odr``" linkage.
229 "``weak``" linkage has the same merging semantics as ``linkonce``
230 linkage, except that unreferenced globals with ``weak`` linkage may
231 not be discarded. This is used for globals that are declared "weak"
234 "``common``" linkage is most similar to "``weak``" linkage, but they
235 are used for tentative definitions in C, such as "``int X;``" at
236 global scope. Symbols with "``common``" linkage are merged in the
237 same way as ``weak symbols``, and they may not be deleted if
238 unreferenced. ``common`` symbols may not have an explicit section,
239 must have a zero initializer, and may not be marked
240 ':ref:`constant <globalvars>`'. Functions and aliases may not have
243 .. _linkage_appending:
246 "``appending``" linkage may only be applied to global variables of
247 pointer to array type. When two global variables with appending
248 linkage are linked together, the two global arrays are appended
249 together. This is the LLVM, typesafe, equivalent of having the
250 system linker append together "sections" with identical names when
253 The semantics of this linkage follow the ELF object file model: the
254 symbol is weak until linked, if not linked, the symbol becomes null
255 instead of being an undefined reference.
256 ``linkonce_odr``, ``weak_odr``
257 Some languages allow differing globals to be merged, such as two
258 functions with different semantics. Other languages, such as
259 ``C++``, ensure that only equivalent globals are ever merged (the
260 "one definition rule" --- "ODR"). Such languages can use the
261 ``linkonce_odr`` and ``weak_odr`` linkage types to indicate that the
262 global will only be merged with equivalent globals. These linkage
263 types are otherwise the same as their non-``odr`` versions.
265 If none of the above identifiers are used, the global is externally
266 visible, meaning that it participates in linkage and can be used to
267 resolve external symbol references.
269 It is illegal for a function *declaration* to have any linkage type
270 other than ``external`` or ``extern_weak``.
277 LLVM :ref:`functions <functionstructure>`, :ref:`calls <i_call>` and
278 :ref:`invokes <i_invoke>` can all have an optional calling convention
279 specified for the call. The calling convention of any pair of dynamic
280 caller/callee must match, or the behavior of the program is undefined.
281 The following calling conventions are supported by LLVM, and more may be
284 "``ccc``" - The C calling convention
285 This calling convention (the default if no other calling convention
286 is specified) matches the target C calling conventions. This calling
287 convention supports varargs function calls and tolerates some
288 mismatch in the declared prototype and implemented declaration of
289 the function (as does normal C).
290 "``fastcc``" - The fast calling convention
291 This calling convention attempts to make calls as fast as possible
292 (e.g. by passing things in registers). This calling convention
293 allows the target to use whatever tricks it wants to produce fast
294 code for the target, without having to conform to an externally
295 specified ABI (Application Binary Interface). `Tail calls can only
296 be optimized when this, the GHC or the HiPE convention is
297 used. <CodeGenerator.html#id80>`_ This calling convention does not
298 support varargs and requires the prototype of all callees to exactly
299 match the prototype of the function definition.
300 "``coldcc``" - The cold calling convention
301 This calling convention attempts to make code in the caller as
302 efficient as possible under the assumption that the call is not
303 commonly executed. As such, these calls often preserve all registers
304 so that the call does not break any live ranges in the caller side.
305 This calling convention does not support varargs and requires the
306 prototype of all callees to exactly match the prototype of the
307 function definition. Furthermore the inliner doesn't consider such function
309 "``cc 10``" - GHC convention
310 This calling convention has been implemented specifically for use by
311 the `Glasgow Haskell Compiler (GHC) <http://www.haskell.org/ghc>`_.
312 It passes everything in registers, going to extremes to achieve this
313 by disabling callee save registers. This calling convention should
314 not be used lightly but only for specific situations such as an
315 alternative to the *register pinning* performance technique often
316 used when implementing functional programming languages. At the
317 moment only X86 supports this convention and it has the following
320 - On *X86-32* only supports up to 4 bit type parameters. No
321 floating point types are supported.
322 - On *X86-64* only supports up to 10 bit type parameters and 6
323 floating point parameters.
325 This calling convention supports `tail call
326 optimization <CodeGenerator.html#id80>`_ but requires both the
327 caller and callee are using it.
328 "``cc 11``" - The HiPE calling convention
329 This calling convention has been implemented specifically for use by
330 the `High-Performance Erlang
331 (HiPE) <http://www.it.uu.se/research/group/hipe/>`_ compiler, *the*
332 native code compiler of the `Ericsson's Open Source Erlang/OTP
333 system <http://www.erlang.org/download.shtml>`_. It uses more
334 registers for argument passing than the ordinary C calling
335 convention and defines no callee-saved registers. The calling
336 convention properly supports `tail call
337 optimization <CodeGenerator.html#id80>`_ but requires that both the
338 caller and the callee use it. It uses a *register pinning*
339 mechanism, similar to GHC's convention, for keeping frequently
340 accessed runtime components pinned to specific hardware registers.
341 At the moment only X86 supports this convention (both 32 and 64
343 "``webkit_jscc``" - WebKit's JavaScript calling convention
344 This calling convention has been implemented for `WebKit FTL JIT
345 <https://trac.webkit.org/wiki/FTLJIT>`_. It passes arguments on the
346 stack right to left (as cdecl does), and returns a value in the
347 platform's customary return register.
348 "``anyregcc``" - Dynamic calling convention for code patching
349 This is a special convention that supports patching an arbitrary code
350 sequence in place of a call site. This convention forces the call
351 arguments into registers but allows them to be dynamcially
352 allocated. This can currently only be used with calls to
353 llvm.experimental.patchpoint because only this intrinsic records
354 the location of its arguments in a side table. See :doc:`StackMaps`.
355 "``preserve_mostcc``" - The `PreserveMost` calling convention
356 This calling convention attempts to make the code in the caller as little
357 intrusive as possible. This calling convention behaves identical to the `C`
358 calling convention on how arguments and return values are passed, but it
359 uses a different set of caller/callee-saved registers. This alleviates the
360 burden of saving and recovering a large register set before and after the
361 call in the caller. If the arguments are passed in callee-saved registers,
362 then they will be preserved by the callee across the call. This doesn't
363 apply for values returned in callee-saved registers.
365 - On X86-64 the callee preserves all general purpose registers, except for
366 R11. R11 can be used as a scratch register. Floating-point registers
367 (XMMs/YMMs) are not preserved and need to be saved by the caller.
369 The idea behind this convention is to support calls to runtime functions
370 that have a hot path and a cold path. The hot path is usually a small piece
371 of code that doesn't use many registers. The cold path might need to call out to
372 another function and therefore only needs to preserve the caller-saved
373 registers, which haven't already been saved by the caller. The
374 `PreserveMost` calling convention is very similar to the `cold` calling
375 convention in terms of caller/callee-saved registers, but they are used for
376 different types of function calls. `coldcc` is for function calls that are
377 rarely executed, whereas `preserve_mostcc` function calls are intended to be
378 on the hot path and definitely executed a lot. Furthermore `preserve_mostcc`
379 doesn't prevent the inliner from inlining the function call.
381 This calling convention will be used by a future version of the ObjectiveC
382 runtime and should therefore still be considered experimental at this time.
383 Although this convention was created to optimize certain runtime calls to
384 the ObjectiveC runtime, it is not limited to this runtime and might be used
385 by other runtimes in the future too. The current implementation only
386 supports X86-64, but the intention is to support more architectures in the
388 "``preserve_allcc``" - The `PreserveAll` calling convention
389 This calling convention attempts to make the code in the caller even less
390 intrusive than the `PreserveMost` calling convention. This calling
391 convention also behaves identical to the `C` calling convention on how
392 arguments and return values are passed, but it uses a different set of
393 caller/callee-saved registers. This removes the burden of saving and
394 recovering a large register set before and after the call in the caller. If
395 the arguments are passed in callee-saved registers, then they will be
396 preserved by the callee across the call. This doesn't apply for values
397 returned in callee-saved registers.
399 - On X86-64 the callee preserves all general purpose registers, except for
400 R11. R11 can be used as a scratch register. Furthermore it also preserves
401 all floating-point registers (XMMs/YMMs).
403 The idea behind this convention is to support calls to runtime functions
404 that don't need to call out to any other functions.
406 This calling convention, like the `PreserveMost` calling convention, will be
407 used by a future version of the ObjectiveC runtime and should be considered
408 experimental at this time.
409 "``cc <n>``" - Numbered convention
410 Any calling convention may be specified by number, allowing
411 target-specific calling conventions to be used. Target specific
412 calling conventions start at 64.
414 More calling conventions can be added/defined on an as-needed basis, to
415 support Pascal conventions or any other well-known target-independent
418 .. _visibilitystyles:
423 All Global Variables and Functions have one of the following visibility
426 "``default``" - Default style
427 On targets that use the ELF object file format, default visibility
428 means that the declaration is visible to other modules and, in
429 shared libraries, means that the declared entity may be overridden.
430 On Darwin, default visibility means that the declaration is visible
431 to other modules. Default visibility corresponds to "external
432 linkage" in the language.
433 "``hidden``" - Hidden style
434 Two declarations of an object with hidden visibility refer to the
435 same object if they are in the same shared object. Usually, hidden
436 visibility indicates that the symbol will not be placed into the
437 dynamic symbol table, so no other module (executable or shared
438 library) can reference it directly.
439 "``protected``" - Protected style
440 On ELF, protected visibility indicates that the symbol will be
441 placed in the dynamic symbol table, but that references within the
442 defining module will bind to the local symbol. That is, the symbol
443 cannot be overridden by another module.
445 A symbol with ``internal`` or ``private`` linkage must have ``default``
453 All Global Variables, Functions and Aliases can have one of the following
457 "``dllimport``" causes the compiler to reference a function or variable via
458 a global pointer to a pointer that is set up by the DLL exporting the
459 symbol. On Microsoft Windows targets, the pointer name is formed by
460 combining ``__imp_`` and the function or variable name.
462 "``dllexport``" causes the compiler to provide a global pointer to a pointer
463 in a DLL, so that it can be referenced with the ``dllimport`` attribute. On
464 Microsoft Windows targets, the pointer name is formed by combining
465 ``__imp_`` and the function or variable name. Since this storage class
466 exists for defining a dll interface, the compiler, assembler and linker know
467 it is externally referenced and must refrain from deleting the symbol.
471 Thread Local Storage Models
472 ---------------------------
474 A variable may be defined as ``thread_local``, which means that it will
475 not be shared by threads (each thread will have a separated copy of the
476 variable). Not all targets support thread-local variables. Optionally, a
477 TLS model may be specified:
480 For variables that are only used within the current shared library.
482 For variables in modules that will not be loaded dynamically.
484 For variables defined in the executable and only used within it.
486 If no explicit model is given, the "general dynamic" model is used.
488 The models correspond to the ELF TLS models; see `ELF Handling For
489 Thread-Local Storage <http://people.redhat.com/drepper/tls.pdf>`_ for
490 more information on under which circumstances the different models may
491 be used. The target may choose a different TLS model if the specified
492 model is not supported, or if a better choice of model can be made.
494 A model can also be specified in a alias, but then it only governs how
495 the alias is accessed. It will not have any effect in the aliasee.
502 LLVM IR allows you to specify both "identified" and "literal" :ref:`structure
503 types <t_struct>`. Literal types are uniqued structurally, but identified types
504 are never uniqued. An :ref:`opaque structural type <t_opaque>` can also be used
505 to forward declare a type that is not yet available.
507 An example of a identified structure specification is:
511 %mytype = type { %mytype*, i32 }
513 Prior to the LLVM 3.0 release, identified types were structurally uniqued. Only
514 literal types are uniqued in recent versions of LLVM.
521 Global variables define regions of memory allocated at compilation time
524 Global variable definitions must be initialized.
526 Global variables in other translation units can also be declared, in which
527 case they don't have an initializer.
529 Either global variable definitions or declarations may have an explicit section
530 to be placed in and may have an optional explicit alignment specified.
532 A variable may be defined as a global ``constant``, which indicates that
533 the contents of the variable will **never** be modified (enabling better
534 optimization, allowing the global data to be placed in the read-only
535 section of an executable, etc). Note that variables that need runtime
536 initialization cannot be marked ``constant`` as there is a store to the
539 LLVM explicitly allows *declarations* of global variables to be marked
540 constant, even if the final definition of the global is not. This
541 capability can be used to enable slightly better optimization of the
542 program, but requires the language definition to guarantee that
543 optimizations based on the 'constantness' are valid for the translation
544 units that do not include the definition.
546 As SSA values, global variables define pointer values that are in scope
547 (i.e. they dominate) all basic blocks in the program. Global variables
548 always define a pointer to their "content" type because they describe a
549 region of memory, and all memory objects in LLVM are accessed through
552 Global variables can be marked with ``unnamed_addr`` which indicates
553 that the address is not significant, only the content. Constants marked
554 like this can be merged with other constants if they have the same
555 initializer. Note that a constant with significant address *can* be
556 merged with a ``unnamed_addr`` constant, the result being a constant
557 whose address is significant.
559 A global variable may be declared to reside in a target-specific
560 numbered address space. For targets that support them, address spaces
561 may affect how optimizations are performed and/or what target
562 instructions are used to access the variable. The default address space
563 is zero. The address space qualifier must precede any other attributes.
565 LLVM allows an explicit section to be specified for globals. If the
566 target supports it, it will emit globals to the section specified.
567 Additionally, the global can placed in a comdat if the target has the necessary
570 By default, global initializers are optimized by assuming that global
571 variables defined within the module are not modified from their
572 initial values before the start of the global initializer. This is
573 true even for variables potentially accessible from outside the
574 module, including those with external linkage or appearing in
575 ``@llvm.used`` or dllexported variables. This assumption may be suppressed
576 by marking the variable with ``externally_initialized``.
578 An explicit alignment may be specified for a global, which must be a
579 power of 2. If not present, or if the alignment is set to zero, the
580 alignment of the global is set by the target to whatever it feels
581 convenient. If an explicit alignment is specified, the global is forced
582 to have exactly that alignment. Targets and optimizers are not allowed
583 to over-align the global if the global has an assigned section. In this
584 case, the extra alignment could be observable: for example, code could
585 assume that the globals are densely packed in their section and try to
586 iterate over them as an array, alignment padding would break this
587 iteration. The maximum alignment is ``1 << 29``.
589 Globals can also have a :ref:`DLL storage class <dllstorageclass>`.
591 Variables and aliases can have a
592 :ref:`Thread Local Storage Model <tls_model>`.
596 [@<GlobalVarName> =] [Linkage] [Visibility] [DLLStorageClass] [ThreadLocal]
597 [unnamed_addr] [AddrSpace] [ExternallyInitialized]
598 <global | constant> <Type> [<InitializerConstant>]
599 [, section "name"] [, comdat [($name)]]
600 [, align <Alignment>]
602 For example, the following defines a global in a numbered address space
603 with an initializer, section, and alignment:
607 @G = addrspace(5) constant float 1.0, section "foo", align 4
609 The following example just declares a global variable
613 @G = external global i32
615 The following example defines a thread-local global with the
616 ``initialexec`` TLS model:
620 @G = thread_local(initialexec) global i32 0, align 4
622 .. _functionstructure:
627 LLVM function definitions consist of the "``define``" keyword, an
628 optional :ref:`linkage type <linkage>`, an optional :ref:`visibility
629 style <visibility>`, an optional :ref:`DLL storage class <dllstorageclass>`,
630 an optional :ref:`calling convention <callingconv>`,
631 an optional ``unnamed_addr`` attribute, a return type, an optional
632 :ref:`parameter attribute <paramattrs>` for the return type, a function
633 name, a (possibly empty) argument list (each with optional :ref:`parameter
634 attributes <paramattrs>`), optional :ref:`function attributes <fnattrs>`,
635 an optional section, an optional alignment,
636 an optional :ref:`comdat <langref_comdats>`,
637 an optional :ref:`garbage collector name <gc>`, an optional :ref:`prefix <prefixdata>`,
638 an optional :ref:`prologue <prologuedata>`, an opening
639 curly brace, a list of basic blocks, and a closing curly brace.
641 LLVM function declarations consist of the "``declare``" keyword, an
642 optional :ref:`linkage type <linkage>`, an optional :ref:`visibility
643 style <visibility>`, an optional :ref:`DLL storage class <dllstorageclass>`,
644 an optional :ref:`calling convention <callingconv>`,
645 an optional ``unnamed_addr`` attribute, a return type, an optional
646 :ref:`parameter attribute <paramattrs>` for the return type, a function
647 name, a possibly empty list of arguments, an optional alignment, an optional
648 :ref:`garbage collector name <gc>`, an optional :ref:`prefix <prefixdata>`,
649 and an optional :ref:`prologue <prologuedata>`.
651 A function definition contains a list of basic blocks, forming the CFG (Control
652 Flow Graph) for the function. Each basic block may optionally start with a label
653 (giving the basic block a symbol table entry), contains a list of instructions,
654 and ends with a :ref:`terminator <terminators>` instruction (such as a branch or
655 function return). If an explicit label is not provided, a block is assigned an
656 implicit numbered label, using the next value from the same counter as used for
657 unnamed temporaries (:ref:`see above<identifiers>`). For example, if a function
658 entry block does not have an explicit label, it will be assigned label "%0",
659 then the first unnamed temporary in that block will be "%1", etc.
661 The first basic block in a function is special in two ways: it is
662 immediately executed on entrance to the function, and it is not allowed
663 to have predecessor basic blocks (i.e. there can not be any branches to
664 the entry block of a function). Because the block can have no
665 predecessors, it also cannot have any :ref:`PHI nodes <i_phi>`.
667 LLVM allows an explicit section to be specified for functions. If the
668 target supports it, it will emit functions to the section specified.
669 Additionally, the function can be placed in a COMDAT.
671 An explicit alignment may be specified for a function. If not present,
672 or if the alignment is set to zero, the alignment of the function is set
673 by the target to whatever it feels convenient. If an explicit alignment
674 is specified, the function is forced to have at least that much
675 alignment. All alignments must be a power of 2.
677 If the ``unnamed_addr`` attribute is given, the address is known to not
678 be significant and two identical functions can be merged.
682 define [linkage] [visibility] [DLLStorageClass]
684 <ResultType> @<FunctionName> ([argument list])
685 [unnamed_addr] [fn Attrs] [section "name"] [comdat [($name)]]
686 [align N] [gc] [prefix Constant] [prologue Constant] { ... }
688 The argument list is a comma seperated sequence of arguments where each
689 argument is of the following form
693 <type> [parameter Attrs] [name]
701 Aliases, unlike function or variables, don't create any new data. They
702 are just a new symbol and metadata for an existing position.
704 Aliases have a name and an aliasee that is either a global value or a
707 Aliases may have an optional :ref:`linkage type <linkage>`, an optional
708 :ref:`visibility style <visibility>`, an optional :ref:`DLL storage class
709 <dllstorageclass>` and an optional :ref:`tls model <tls_model>`.
713 @<Name> = [Linkage] [Visibility] [DLLStorageClass] [ThreadLocal] [unnamed_addr] alias <AliaseeTy> @<Aliasee>
715 The linkage must be one of ``private``, ``internal``, ``linkonce``, ``weak``,
716 ``linkonce_odr``, ``weak_odr``, ``external``. Note that some system linkers
717 might not correctly handle dropping a weak symbol that is aliased.
719 Aliases that are not ``unnamed_addr`` are guaranteed to have the same address as
720 the aliasee expression. ``unnamed_addr`` ones are only guaranteed to point
723 Since aliases are only a second name, some restrictions apply, of which
724 some can only be checked when producing an object file:
726 * The expression defining the aliasee must be computable at assembly
727 time. Since it is just a name, no relocations can be used.
729 * No alias in the expression can be weak as the possibility of the
730 intermediate alias being overridden cannot be represented in an
733 * No global value in the expression can be a declaration, since that
734 would require a relocation, which is not possible.
741 Comdat IR provides access to COFF and ELF object file COMDAT functionality.
743 Comdats have a name which represents the COMDAT key. All global objects that
744 specify this key will only end up in the final object file if the linker chooses
745 that key over some other key. Aliases are placed in the same COMDAT that their
746 aliasee computes to, if any.
748 Comdats have a selection kind to provide input on how the linker should
749 choose between keys in two different object files.
753 $<Name> = comdat SelectionKind
755 The selection kind must be one of the following:
758 The linker may choose any COMDAT key, the choice is arbitrary.
760 The linker may choose any COMDAT key but the sections must contain the
763 The linker will choose the section containing the largest COMDAT key.
765 The linker requires that only section with this COMDAT key exist.
767 The linker may choose any COMDAT key but the sections must contain the
770 Note that the Mach-O platform doesn't support COMDATs and ELF only supports
771 ``any`` as a selection kind.
773 Here is an example of a COMDAT group where a function will only be selected if
774 the COMDAT key's section is the largest:
778 $foo = comdat largest
779 @foo = global i32 2, comdat($foo)
781 define void @bar() comdat($foo) {
785 As a syntactic sugar the ``$name`` can be omitted if the name is the same as
791 @foo = global i32 2, comdat
794 In a COFF object file, this will create a COMDAT section with selection kind
795 ``IMAGE_COMDAT_SELECT_LARGEST`` containing the contents of the ``@foo`` symbol
796 and another COMDAT section with selection kind
797 ``IMAGE_COMDAT_SELECT_ASSOCIATIVE`` which is associated with the first COMDAT
798 section and contains the contents of the ``@bar`` symbol.
800 There are some restrictions on the properties of the global object.
801 It, or an alias to it, must have the same name as the COMDAT group when
803 The contents and size of this object may be used during link-time to determine
804 which COMDAT groups get selected depending on the selection kind.
805 Because the name of the object must match the name of the COMDAT group, the
806 linkage of the global object must not be local; local symbols can get renamed
807 if a collision occurs in the symbol table.
809 The combined use of COMDATS and section attributes may yield surprising results.
816 @g1 = global i32 42, section "sec", comdat($foo)
817 @g2 = global i32 42, section "sec", comdat($bar)
819 From the object file perspective, this requires the creation of two sections
820 with the same name. This is necessary because both globals belong to different
821 COMDAT groups and COMDATs, at the object file level, are represented by
824 Note that certain IR constructs like global variables and functions may create
825 COMDATs in the object file in addition to any which are specified using COMDAT
826 IR. This arises, for example, when a global variable has linkonce_odr linkage.
828 .. _namedmetadatastructure:
833 Named metadata is a collection of metadata. :ref:`Metadata
834 nodes <metadata>` (but not metadata strings) are the only valid
835 operands for a named metadata.
839 ; Some unnamed metadata nodes, which are referenced by the named metadata.
844 !name = !{!0, !1, !2}
851 The return type and each parameter of a function type may have a set of
852 *parameter attributes* associated with them. Parameter attributes are
853 used to communicate additional information about the result or
854 parameters of a function. Parameter attributes are considered to be part
855 of the function, not of the function type, so functions with different
856 parameter attributes can have the same function type.
858 Parameter attributes are simple keywords that follow the type specified.
859 If multiple parameter attributes are needed, they are space separated.
864 declare i32 @printf(i8* noalias nocapture, ...)
865 declare i32 @atoi(i8 zeroext)
866 declare signext i8 @returns_signed_char()
868 Note that any attributes for the function result (``nounwind``,
869 ``readonly``) come immediately after the argument list.
871 Currently, only the following parameter attributes are defined:
874 This indicates to the code generator that the parameter or return
875 value should be zero-extended to the extent required by the target's
876 ABI (which is usually 32-bits, but is 8-bits for a i1 on x86-64) by
877 the caller (for a parameter) or the callee (for a return value).
879 This indicates to the code generator that the parameter or return
880 value should be sign-extended to the extent required by the target's
881 ABI (which is usually 32-bits) by the caller (for a parameter) or
882 the callee (for a return value).
884 This indicates that this parameter or return value should be treated
885 in a special target-dependent fashion during while emitting code for
886 a function call or return (usually, by putting it in a register as
887 opposed to memory, though some targets use it to distinguish between
888 two different kinds of registers). Use of this attribute is
891 This indicates that the pointer parameter should really be passed by
892 value to the function. The attribute implies that a hidden copy of
893 the pointee is made between the caller and the callee, so the callee
894 is unable to modify the value in the caller. This attribute is only
895 valid on LLVM pointer arguments. It is generally used to pass
896 structs and arrays by value, but is also valid on pointers to
897 scalars. The copy is considered to belong to the caller not the
898 callee (for example, ``readonly`` functions should not write to
899 ``byval`` parameters). This is not a valid attribute for return
902 The byval attribute also supports specifying an alignment with the
903 align attribute. It indicates the alignment of the stack slot to
904 form and the known alignment of the pointer specified to the call
905 site. If the alignment is not specified, then the code generator
906 makes a target-specific assumption.
912 The ``inalloca`` argument attribute allows the caller to take the
913 address of outgoing stack arguments. An ``inalloca`` argument must
914 be a pointer to stack memory produced by an ``alloca`` instruction.
915 The alloca, or argument allocation, must also be tagged with the
916 inalloca keyword. Only the last argument may have the ``inalloca``
917 attribute, and that argument is guaranteed to be passed in memory.
919 An argument allocation may be used by a call at most once because
920 the call may deallocate it. The ``inalloca`` attribute cannot be
921 used in conjunction with other attributes that affect argument
922 storage, like ``inreg``, ``nest``, ``sret``, or ``byval``. The
923 ``inalloca`` attribute also disables LLVM's implicit lowering of
924 large aggregate return values, which means that frontend authors
925 must lower them with ``sret`` pointers.
927 When the call site is reached, the argument allocation must have
928 been the most recent stack allocation that is still live, or the
929 results are undefined. It is possible to allocate additional stack
930 space after an argument allocation and before its call site, but it
931 must be cleared off with :ref:`llvm.stackrestore
934 See :doc:`InAlloca` for more information on how to use this
938 This indicates that the pointer parameter specifies the address of a
939 structure that is the return value of the function in the source
940 program. This pointer must be guaranteed by the caller to be valid:
941 loads and stores to the structure may be assumed by the callee
942 not to trap and to be properly aligned. This may only be applied to
943 the first parameter. This is not a valid attribute for return
947 This indicates that the pointer value may be assumed by the optimizer to
948 have the specified alignment.
950 Note that this attribute has additional semantics when combined with the
956 This indicates that objects accessed via pointer values
957 :ref:`based <pointeraliasing>` on the argument or return value are not also
958 accessed, during the execution of the function, via pointer values not
959 *based* on the argument or return value. The attribute on a return value
960 also has additional semantics described below. The caller shares the
961 responsibility with the callee for ensuring that these requirements are met.
962 For further details, please see the discussion of the NoAlias response in
963 :ref:`alias analysis <Must, May, or No>`.
965 Note that this definition of ``noalias`` is intentionally similar
966 to the definition of ``restrict`` in C99 for function arguments.
968 For function return values, C99's ``restrict`` is not meaningful,
969 while LLVM's ``noalias`` is. Furthermore, the semantics of the ``noalias``
970 attribute on return values are stronger than the semantics of the attribute
971 when used on function arguments. On function return values, the ``noalias``
972 attribute indicates that the function acts like a system memory allocation
973 function, returning a pointer to allocated storage disjoint from the
974 storage for any other object accessible to the caller.
977 This indicates that the callee does not make any copies of the
978 pointer that outlive the callee itself. This is not a valid
979 attribute for return values.
984 This indicates that the pointer parameter can be excised using the
985 :ref:`trampoline intrinsics <int_trampoline>`. This is not a valid
986 attribute for return values and can only be applied to one parameter.
989 This indicates that the function always returns the argument as its return
990 value. This is an optimization hint to the code generator when generating
991 the caller, allowing tail call optimization and omission of register saves
992 and restores in some cases; it is not checked or enforced when generating
993 the callee. The parameter and the function return type must be valid
994 operands for the :ref:`bitcast instruction <i_bitcast>`. This is not a
995 valid attribute for return values and can only be applied to one parameter.
998 This indicates that the parameter or return pointer is not null. This
999 attribute may only be applied to pointer typed parameters. This is not
1000 checked or enforced by LLVM, the caller must ensure that the pointer
1001 passed in is non-null, or the callee must ensure that the returned pointer
1004 ``dereferenceable(<n>)``
1005 This indicates that the parameter or return pointer is dereferenceable. This
1006 attribute may only be applied to pointer typed parameters. A pointer that
1007 is dereferenceable can be loaded from speculatively without a risk of
1008 trapping. The number of bytes known to be dereferenceable must be provided
1009 in parentheses. It is legal for the number of bytes to be less than the
1010 size of the pointee type. The ``nonnull`` attribute does not imply
1011 dereferenceability (consider a pointer to one element past the end of an
1012 array), however ``dereferenceable(<n>)`` does imply ``nonnull`` in
1013 ``addrspace(0)`` (which is the default address space).
1017 Garbage Collector Strategy Names
1018 --------------------------------
1020 Each function may specify a garbage collector strategy name, which is simply a
1023 .. code-block:: llvm
1025 define void @f() gc "name" { ... }
1027 The supported values of *name* includes those :ref:`built in to LLVM
1028 <builtin-gc-strategies>` and any provided by loaded plugins. Specifying a GC
1029 strategy will cause the compiler to alter its output in order to support the
1030 named garbage collection algorithm. Note that LLVM itself does not contain a
1031 garbage collector, this functionality is restricted to generating machine code
1032 which can interoperate with a collector provided externally.
1039 Prefix data is data associated with a function which the code
1040 generator will emit immediately before the function's entrypoint.
1041 The purpose of this feature is to allow frontends to associate
1042 language-specific runtime metadata with specific functions and make it
1043 available through the function pointer while still allowing the
1044 function pointer to be called.
1046 To access the data for a given function, a program may bitcast the
1047 function pointer to a pointer to the constant's type and dereference
1048 index -1. This implies that the IR symbol points just past the end of
1049 the prefix data. For instance, take the example of a function annotated
1050 with a single ``i32``,
1052 .. code-block:: llvm
1054 define void @f() prefix i32 123 { ... }
1056 The prefix data can be referenced as,
1058 .. code-block:: llvm
1060 %0 = bitcast void* () @f to i32*
1061 %a = getelementptr inbounds i32, i32* %0, i32 -1
1062 %b = load i32, i32* %a
1064 Prefix data is laid out as if it were an initializer for a global variable
1065 of the prefix data's type. The function will be placed such that the
1066 beginning of the prefix data is aligned. This means that if the size
1067 of the prefix data is not a multiple of the alignment size, the
1068 function's entrypoint will not be aligned. If alignment of the
1069 function's entrypoint is desired, padding must be added to the prefix
1072 A function may have prefix data but no body. This has similar semantics
1073 to the ``available_externally`` linkage in that the data may be used by the
1074 optimizers but will not be emitted in the object file.
1081 The ``prologue`` attribute allows arbitrary code (encoded as bytes) to
1082 be inserted prior to the function body. This can be used for enabling
1083 function hot-patching and instrumentation.
1085 To maintain the semantics of ordinary function calls, the prologue data must
1086 have a particular format. Specifically, it must begin with a sequence of
1087 bytes which decode to a sequence of machine instructions, valid for the
1088 module's target, which transfer control to the point immediately succeeding
1089 the prologue data, without performing any other visible action. This allows
1090 the inliner and other passes to reason about the semantics of the function
1091 definition without needing to reason about the prologue data. Obviously this
1092 makes the format of the prologue data highly target dependent.
1094 A trivial example of valid prologue data for the x86 architecture is ``i8 144``,
1095 which encodes the ``nop`` instruction:
1097 .. code-block:: llvm
1099 define void @f() prologue i8 144 { ... }
1101 Generally prologue data can be formed by encoding a relative branch instruction
1102 which skips the metadata, as in this example of valid prologue data for the
1103 x86_64 architecture, where the first two bytes encode ``jmp .+10``:
1105 .. code-block:: llvm
1107 %0 = type <{ i8, i8, i8* }>
1109 define void @f() prologue %0 <{ i8 235, i8 8, i8* @md}> { ... }
1111 A function may have prologue data but no body. This has similar semantics
1112 to the ``available_externally`` linkage in that the data may be used by the
1113 optimizers but will not be emitted in the object file.
1120 Attribute groups are groups of attributes that are referenced by objects within
1121 the IR. They are important for keeping ``.ll`` files readable, because a lot of
1122 functions will use the same set of attributes. In the degenerative case of a
1123 ``.ll`` file that corresponds to a single ``.c`` file, the single attribute
1124 group will capture the important command line flags used to build that file.
1126 An attribute group is a module-level object. To use an attribute group, an
1127 object references the attribute group's ID (e.g. ``#37``). An object may refer
1128 to more than one attribute group. In that situation, the attributes from the
1129 different groups are merged.
1131 Here is an example of attribute groups for a function that should always be
1132 inlined, has a stack alignment of 4, and which shouldn't use SSE instructions:
1134 .. code-block:: llvm
1136 ; Target-independent attributes:
1137 attributes #0 = { alwaysinline alignstack=4 }
1139 ; Target-dependent attributes:
1140 attributes #1 = { "no-sse" }
1142 ; Function @f has attributes: alwaysinline, alignstack=4, and "no-sse".
1143 define void @f() #0 #1 { ... }
1150 Function attributes are set to communicate additional information about
1151 a function. Function attributes are considered to be part of the
1152 function, not of the function type, so functions with different function
1153 attributes can have the same function type.
1155 Function attributes are simple keywords that follow the type specified.
1156 If multiple attributes are needed, they are space separated. For
1159 .. code-block:: llvm
1161 define void @f() noinline { ... }
1162 define void @f() alwaysinline { ... }
1163 define void @f() alwaysinline optsize { ... }
1164 define void @f() optsize { ... }
1167 This attribute indicates that, when emitting the prologue and
1168 epilogue, the backend should forcibly align the stack pointer.
1169 Specify the desired alignment, which must be a power of two, in
1172 This attribute indicates that the inliner should attempt to inline
1173 this function into callers whenever possible, ignoring any active
1174 inlining size threshold for this caller.
1176 This indicates that the callee function at a call site should be
1177 recognized as a built-in function, even though the function's declaration
1178 uses the ``nobuiltin`` attribute. This is only valid at call sites for
1179 direct calls to functions that are declared with the ``nobuiltin``
1182 This attribute indicates that this function is rarely called. When
1183 computing edge weights, basic blocks post-dominated by a cold
1184 function call are also considered to be cold; and, thus, given low
1187 This attribute indicates that the source code contained a hint that
1188 inlining this function is desirable (such as the "inline" keyword in
1189 C/C++). It is just a hint; it imposes no requirements on the
1192 This attribute indicates that the function should be added to a
1193 jump-instruction table at code-generation time, and that all address-taken
1194 references to this function should be replaced with a reference to the
1195 appropriate jump-instruction-table function pointer. Note that this creates
1196 a new pointer for the original function, which means that code that depends
1197 on function-pointer identity can break. So, any function annotated with
1198 ``jumptable`` must also be ``unnamed_addr``.
1200 This attribute suggests that optimization passes and code generator
1201 passes make choices that keep the code size of this function as small
1202 as possible and perform optimizations that may sacrifice runtime
1203 performance in order to minimize the size of the generated code.
1205 This attribute disables prologue / epilogue emission for the
1206 function. This can have very system-specific consequences.
1208 This indicates that the callee function at a call site is not recognized as
1209 a built-in function. LLVM will retain the original call and not replace it
1210 with equivalent code based on the semantics of the built-in function, unless
1211 the call site uses the ``builtin`` attribute. This is valid at call sites
1212 and on function declarations and definitions.
1214 This attribute indicates that calls to the function cannot be
1215 duplicated. A call to a ``noduplicate`` function may be moved
1216 within its parent function, but may not be duplicated within
1217 its parent function.
1219 A function containing a ``noduplicate`` call may still
1220 be an inlining candidate, provided that the call is not
1221 duplicated by inlining. That implies that the function has
1222 internal linkage and only has one call site, so the original
1223 call is dead after inlining.
1225 This attributes disables implicit floating point instructions.
1227 This attribute indicates that the inliner should never inline this
1228 function in any situation. This attribute may not be used together
1229 with the ``alwaysinline`` attribute.
1231 This attribute suppresses lazy symbol binding for the function. This
1232 may make calls to the function faster, at the cost of extra program
1233 startup time if the function is not called during program startup.
1235 This attribute indicates that the code generator should not use a
1236 red zone, even if the target-specific ABI normally permits it.
1238 This function attribute indicates that the function never returns
1239 normally. This produces undefined behavior at runtime if the
1240 function ever does dynamically return.
1242 This function attribute indicates that the function never raises an
1243 exception. If the function does raise an exception, its runtime
1244 behavior is undefined. However, functions marked nounwind may still
1245 trap or generate asynchronous exceptions. Exception handling schemes
1246 that are recognized by LLVM to handle asynchronous exceptions, such
1247 as SEH, will still provide their implementation defined semantics.
1249 This function attribute indicates that the function is not optimized
1250 by any optimization or code generator passes with the
1251 exception of interprocedural optimization passes.
1252 This attribute cannot be used together with the ``alwaysinline``
1253 attribute; this attribute is also incompatible
1254 with the ``minsize`` attribute and the ``optsize`` attribute.
1256 This attribute requires the ``noinline`` attribute to be specified on
1257 the function as well, so the function is never inlined into any caller.
1258 Only functions with the ``alwaysinline`` attribute are valid
1259 candidates for inlining into the body of this function.
1261 This attribute suggests that optimization passes and code generator
1262 passes make choices that keep the code size of this function low,
1263 and otherwise do optimizations specifically to reduce code size as
1264 long as they do not significantly impact runtime performance.
1266 On a function, this attribute indicates that the function computes its
1267 result (or decides to unwind an exception) based strictly on its arguments,
1268 without dereferencing any pointer arguments or otherwise accessing
1269 any mutable state (e.g. memory, control registers, etc) visible to
1270 caller functions. It does not write through any pointer arguments
1271 (including ``byval`` arguments) and never changes any state visible
1272 to callers. This means that it cannot unwind exceptions by calling
1273 the ``C++`` exception throwing methods.
1275 On an argument, this attribute indicates that the function does not
1276 dereference that pointer argument, even though it may read or write the
1277 memory that the pointer points to if accessed through other pointers.
1279 On a function, this attribute indicates that the function does not write
1280 through any pointer arguments (including ``byval`` arguments) or otherwise
1281 modify any state (e.g. memory, control registers, etc) visible to
1282 caller functions. It may dereference pointer arguments and read
1283 state that may be set in the caller. A readonly function always
1284 returns the same value (or unwinds an exception identically) when
1285 called with the same set of arguments and global state. It cannot
1286 unwind an exception by calling the ``C++`` exception throwing
1289 On an argument, this attribute indicates that the function does not write
1290 through this pointer argument, even though it may write to the memory that
1291 the pointer points to.
1293 This attribute indicates that this function can return twice. The C
1294 ``setjmp`` is an example of such a function. The compiler disables
1295 some optimizations (like tail calls) in the caller of these
1297 ``sanitize_address``
1298 This attribute indicates that AddressSanitizer checks
1299 (dynamic address safety analysis) are enabled for this function.
1301 This attribute indicates that MemorySanitizer checks (dynamic detection
1302 of accesses to uninitialized memory) are enabled for this function.
1304 This attribute indicates that ThreadSanitizer checks
1305 (dynamic thread safety analysis) are enabled for this function.
1307 This attribute indicates that the function should emit a stack
1308 smashing protector. It is in the form of a "canary" --- a random value
1309 placed on the stack before the local variables that's checked upon
1310 return from the function to see if it has been overwritten. A
1311 heuristic is used to determine if a function needs stack protectors
1312 or not. The heuristic used will enable protectors for functions with:
1314 - Character arrays larger than ``ssp-buffer-size`` (default 8).
1315 - Aggregates containing character arrays larger than ``ssp-buffer-size``.
1316 - Calls to alloca() with variable sizes or constant sizes greater than
1317 ``ssp-buffer-size``.
1319 Variables that are identified as requiring a protector will be arranged
1320 on the stack such that they are adjacent to the stack protector guard.
1322 If a function that has an ``ssp`` attribute is inlined into a
1323 function that doesn't have an ``ssp`` attribute, then the resulting
1324 function will have an ``ssp`` attribute.
1326 This attribute indicates that the function should *always* emit a
1327 stack smashing protector. This overrides the ``ssp`` function
1330 Variables that are identified as requiring a protector will be arranged
1331 on the stack such that they are adjacent to the stack protector guard.
1332 The specific layout rules are:
1334 #. Large arrays and structures containing large arrays
1335 (``>= ssp-buffer-size``) are closest to the stack protector.
1336 #. Small arrays and structures containing small arrays
1337 (``< ssp-buffer-size``) are 2nd closest to the protector.
1338 #. Variables that have had their address taken are 3rd closest to the
1341 If a function that has an ``sspreq`` attribute is inlined into a
1342 function that doesn't have an ``sspreq`` attribute or which has an
1343 ``ssp`` or ``sspstrong`` attribute, then the resulting function will have
1344 an ``sspreq`` attribute.
1346 This attribute indicates that the function should emit a stack smashing
1347 protector. This attribute causes a strong heuristic to be used when
1348 determining if a function needs stack protectors. The strong heuristic
1349 will enable protectors for functions with:
1351 - Arrays of any size and type
1352 - Aggregates containing an array of any size and type.
1353 - Calls to alloca().
1354 - Local variables that have had their address taken.
1356 Variables that are identified as requiring a protector will be arranged
1357 on the stack such that they are adjacent to the stack protector guard.
1358 The specific layout rules are:
1360 #. Large arrays and structures containing large arrays
1361 (``>= ssp-buffer-size``) are closest to the stack protector.
1362 #. Small arrays and structures containing small arrays
1363 (``< ssp-buffer-size``) are 2nd closest to the protector.
1364 #. Variables that have had their address taken are 3rd closest to the
1367 This overrides the ``ssp`` function attribute.
1369 If a function that has an ``sspstrong`` attribute is inlined into a
1370 function that doesn't have an ``sspstrong`` attribute, then the
1371 resulting function will have an ``sspstrong`` attribute.
1373 This attribute indicates that the function will delegate to some other
1374 function with a tail call. The prototype of a thunk should not be used for
1375 optimization purposes. The caller is expected to cast the thunk prototype to
1376 match the thunk target prototype.
1378 This attribute indicates that the ABI being targeted requires that
1379 an unwind table entry be produce for this function even if we can
1380 show that no exceptions passes by it. This is normally the case for
1381 the ELF x86-64 abi, but it can be disabled for some compilation
1386 Module-Level Inline Assembly
1387 ----------------------------
1389 Modules may contain "module-level inline asm" blocks, which corresponds
1390 to the GCC "file scope inline asm" blocks. These blocks are internally
1391 concatenated by LLVM and treated as a single unit, but may be separated
1392 in the ``.ll`` file if desired. The syntax is very simple:
1394 .. code-block:: llvm
1396 module asm "inline asm code goes here"
1397 module asm "more can go here"
1399 The strings can contain any character by escaping non-printable
1400 characters. The escape sequence used is simply "\\xx" where "xx" is the
1401 two digit hex code for the number.
1403 The inline asm code is simply printed to the machine code .s file when
1404 assembly code is generated.
1406 .. _langref_datalayout:
1411 A module may specify a target specific data layout string that specifies
1412 how data is to be laid out in memory. The syntax for the data layout is
1415 .. code-block:: llvm
1417 target datalayout = "layout specification"
1419 The *layout specification* consists of a list of specifications
1420 separated by the minus sign character ('-'). Each specification starts
1421 with a letter and may include other information after the letter to
1422 define some aspect of the data layout. The specifications accepted are
1426 Specifies that the target lays out data in big-endian form. That is,
1427 the bits with the most significance have the lowest address
1430 Specifies that the target lays out data in little-endian form. That
1431 is, the bits with the least significance have the lowest address
1434 Specifies the natural alignment of the stack in bits. Alignment
1435 promotion of stack variables is limited to the natural stack
1436 alignment to avoid dynamic stack realignment. The stack alignment
1437 must be a multiple of 8-bits. If omitted, the natural stack
1438 alignment defaults to "unspecified", which does not prevent any
1439 alignment promotions.
1440 ``p[n]:<size>:<abi>:<pref>``
1441 This specifies the *size* of a pointer and its ``<abi>`` and
1442 ``<pref>``\erred alignments for address space ``n``. All sizes are in
1443 bits. The address space, ``n`` is optional, and if not specified,
1444 denotes the default address space 0. The value of ``n`` must be
1445 in the range [1,2^23).
1446 ``i<size>:<abi>:<pref>``
1447 This specifies the alignment for an integer type of a given bit
1448 ``<size>``. The value of ``<size>`` must be in the range [1,2^23).
1449 ``v<size>:<abi>:<pref>``
1450 This specifies the alignment for a vector type of a given bit
1452 ``f<size>:<abi>:<pref>``
1453 This specifies the alignment for a floating point type of a given bit
1454 ``<size>``. Only values of ``<size>`` that are supported by the target
1455 will work. 32 (float) and 64 (double) are supported on all targets; 80
1456 or 128 (different flavors of long double) are also supported on some
1459 This specifies the alignment for an object of aggregate type.
1461 If present, specifies that llvm names are mangled in the output. The
1464 * ``e``: ELF mangling: Private symbols get a ``.L`` prefix.
1465 * ``m``: Mips mangling: Private symbols get a ``$`` prefix.
1466 * ``o``: Mach-O mangling: Private symbols get ``L`` prefix. Other
1467 symbols get a ``_`` prefix.
1468 * ``w``: Windows COFF prefix: Similar to Mach-O, but stdcall and fastcall
1469 functions also get a suffix based on the frame size.
1470 ``n<size1>:<size2>:<size3>...``
1471 This specifies a set of native integer widths for the target CPU in
1472 bits. For example, it might contain ``n32`` for 32-bit PowerPC,
1473 ``n32:64`` for PowerPC 64, or ``n8:16:32:64`` for X86-64. Elements of
1474 this set are considered to support most general arithmetic operations
1477 On every specification that takes a ``<abi>:<pref>``, specifying the
1478 ``<pref>`` alignment is optional. If omitted, the preceding ``:``
1479 should be omitted too and ``<pref>`` will be equal to ``<abi>``.
1481 When constructing the data layout for a given target, LLVM starts with a
1482 default set of specifications which are then (possibly) overridden by
1483 the specifications in the ``datalayout`` keyword. The default
1484 specifications are given in this list:
1486 - ``E`` - big endian
1487 - ``p:64:64:64`` - 64-bit pointers with 64-bit alignment.
1488 - ``p[n]:64:64:64`` - Other address spaces are assumed to be the
1489 same as the default address space.
1490 - ``S0`` - natural stack alignment is unspecified
1491 - ``i1:8:8`` - i1 is 8-bit (byte) aligned
1492 - ``i8:8:8`` - i8 is 8-bit (byte) aligned
1493 - ``i16:16:16`` - i16 is 16-bit aligned
1494 - ``i32:32:32`` - i32 is 32-bit aligned
1495 - ``i64:32:64`` - i64 has ABI alignment of 32-bits but preferred
1496 alignment of 64-bits
1497 - ``f16:16:16`` - half is 16-bit aligned
1498 - ``f32:32:32`` - float is 32-bit aligned
1499 - ``f64:64:64`` - double is 64-bit aligned
1500 - ``f128:128:128`` - quad is 128-bit aligned
1501 - ``v64:64:64`` - 64-bit vector is 64-bit aligned
1502 - ``v128:128:128`` - 128-bit vector is 128-bit aligned
1503 - ``a:0:64`` - aggregates are 64-bit aligned
1505 When LLVM is determining the alignment for a given type, it uses the
1508 #. If the type sought is an exact match for one of the specifications,
1509 that specification is used.
1510 #. If no match is found, and the type sought is an integer type, then
1511 the smallest integer type that is larger than the bitwidth of the
1512 sought type is used. If none of the specifications are larger than
1513 the bitwidth then the largest integer type is used. For example,
1514 given the default specifications above, the i7 type will use the
1515 alignment of i8 (next largest) while both i65 and i256 will use the
1516 alignment of i64 (largest specified).
1517 #. If no match is found, and the type sought is a vector type, then the
1518 largest vector type that is smaller than the sought vector type will
1519 be used as a fall back. This happens because <128 x double> can be
1520 implemented in terms of 64 <2 x double>, for example.
1522 The function of the data layout string may not be what you expect.
1523 Notably, this is not a specification from the frontend of what alignment
1524 the code generator should use.
1526 Instead, if specified, the target data layout is required to match what
1527 the ultimate *code generator* expects. This string is used by the
1528 mid-level optimizers to improve code, and this only works if it matches
1529 what the ultimate code generator uses. If you would like to generate IR
1530 that does not embed this target-specific detail into the IR, then you
1531 don't have to specify the string. This will disable some optimizations
1532 that require precise layout information, but this also prevents those
1533 optimizations from introducing target specificity into the IR.
1540 A module may specify a target triple string that describes the target
1541 host. The syntax for the target triple is simply:
1543 .. code-block:: llvm
1545 target triple = "x86_64-apple-macosx10.7.0"
1547 The *target triple* string consists of a series of identifiers delimited
1548 by the minus sign character ('-'). The canonical forms are:
1552 ARCHITECTURE-VENDOR-OPERATING_SYSTEM
1553 ARCHITECTURE-VENDOR-OPERATING_SYSTEM-ENVIRONMENT
1555 This information is passed along to the backend so that it generates
1556 code for the proper architecture. It's possible to override this on the
1557 command line with the ``-mtriple`` command line option.
1559 .. _pointeraliasing:
1561 Pointer Aliasing Rules
1562 ----------------------
1564 Any memory access must be done through a pointer value associated with
1565 an address range of the memory access, otherwise the behavior is
1566 undefined. Pointer values are associated with address ranges according
1567 to the following rules:
1569 - A pointer value is associated with the addresses associated with any
1570 value it is *based* on.
1571 - An address of a global variable is associated with the address range
1572 of the variable's storage.
1573 - The result value of an allocation instruction is associated with the
1574 address range of the allocated storage.
1575 - A null pointer in the default address-space is associated with no
1577 - An integer constant other than zero or a pointer value returned from
1578 a function not defined within LLVM may be associated with address
1579 ranges allocated through mechanisms other than those provided by
1580 LLVM. Such ranges shall not overlap with any ranges of addresses
1581 allocated by mechanisms provided by LLVM.
1583 A pointer value is *based* on another pointer value according to the
1586 - A pointer value formed from a ``getelementptr`` operation is *based*
1587 on the first value operand of the ``getelementptr``.
1588 - The result value of a ``bitcast`` is *based* on the operand of the
1590 - A pointer value formed by an ``inttoptr`` is *based* on all pointer
1591 values that contribute (directly or indirectly) to the computation of
1592 the pointer's value.
1593 - The "*based* on" relationship is transitive.
1595 Note that this definition of *"based"* is intentionally similar to the
1596 definition of *"based"* in C99, though it is slightly weaker.
1598 LLVM IR does not associate types with memory. The result type of a
1599 ``load`` merely indicates the size and alignment of the memory from
1600 which to load, as well as the interpretation of the value. The first
1601 operand type of a ``store`` similarly only indicates the size and
1602 alignment of the store.
1604 Consequently, type-based alias analysis, aka TBAA, aka
1605 ``-fstrict-aliasing``, is not applicable to general unadorned LLVM IR.
1606 :ref:`Metadata <metadata>` may be used to encode additional information
1607 which specialized optimization passes may use to implement type-based
1612 Volatile Memory Accesses
1613 ------------------------
1615 Certain memory accesses, such as :ref:`load <i_load>`'s,
1616 :ref:`store <i_store>`'s, and :ref:`llvm.memcpy <int_memcpy>`'s may be
1617 marked ``volatile``. The optimizers must not change the number of
1618 volatile operations or change their order of execution relative to other
1619 volatile operations. The optimizers *may* change the order of volatile
1620 operations relative to non-volatile operations. This is not Java's
1621 "volatile" and has no cross-thread synchronization behavior.
1623 IR-level volatile loads and stores cannot safely be optimized into
1624 llvm.memcpy or llvm.memmove intrinsics even when those intrinsics are
1625 flagged volatile. Likewise, the backend should never split or merge
1626 target-legal volatile load/store instructions.
1628 .. admonition:: Rationale
1630 Platforms may rely on volatile loads and stores of natively supported
1631 data width to be executed as single instruction. For example, in C
1632 this holds for an l-value of volatile primitive type with native
1633 hardware support, but not necessarily for aggregate types. The
1634 frontend upholds these expectations, which are intentionally
1635 unspecified in the IR. The rules above ensure that IR transformation
1636 do not violate the frontend's contract with the language.
1640 Memory Model for Concurrent Operations
1641 --------------------------------------
1643 The LLVM IR does not define any way to start parallel threads of
1644 execution or to register signal handlers. Nonetheless, there are
1645 platform-specific ways to create them, and we define LLVM IR's behavior
1646 in their presence. This model is inspired by the C++0x memory model.
1648 For a more informal introduction to this model, see the :doc:`Atomics`.
1650 We define a *happens-before* partial order as the least partial order
1653 - Is a superset of single-thread program order, and
1654 - When a *synchronizes-with* ``b``, includes an edge from ``a`` to
1655 ``b``. *Synchronizes-with* pairs are introduced by platform-specific
1656 techniques, like pthread locks, thread creation, thread joining,
1657 etc., and by atomic instructions. (See also :ref:`Atomic Memory Ordering
1658 Constraints <ordering>`).
1660 Note that program order does not introduce *happens-before* edges
1661 between a thread and signals executing inside that thread.
1663 Every (defined) read operation (load instructions, memcpy, atomic
1664 loads/read-modify-writes, etc.) R reads a series of bytes written by
1665 (defined) write operations (store instructions, atomic
1666 stores/read-modify-writes, memcpy, etc.). For the purposes of this
1667 section, initialized globals are considered to have a write of the
1668 initializer which is atomic and happens before any other read or write
1669 of the memory in question. For each byte of a read R, R\ :sub:`byte`
1670 may see any write to the same byte, except:
1672 - If write\ :sub:`1` happens before write\ :sub:`2`, and
1673 write\ :sub:`2` happens before R\ :sub:`byte`, then
1674 R\ :sub:`byte` does not see write\ :sub:`1`.
1675 - If R\ :sub:`byte` happens before write\ :sub:`3`, then
1676 R\ :sub:`byte` does not see write\ :sub:`3`.
1678 Given that definition, R\ :sub:`byte` is defined as follows:
1680 - If R is volatile, the result is target-dependent. (Volatile is
1681 supposed to give guarantees which can support ``sig_atomic_t`` in
1682 C/C++, and may be used for accesses to addresses that do not behave
1683 like normal memory. It does not generally provide cross-thread
1685 - Otherwise, if there is no write to the same byte that happens before
1686 R\ :sub:`byte`, R\ :sub:`byte` returns ``undef`` for that byte.
1687 - Otherwise, if R\ :sub:`byte` may see exactly one write,
1688 R\ :sub:`byte` returns the value written by that write.
1689 - Otherwise, if R is atomic, and all the writes R\ :sub:`byte` may
1690 see are atomic, it chooses one of the values written. See the :ref:`Atomic
1691 Memory Ordering Constraints <ordering>` section for additional
1692 constraints on how the choice is made.
1693 - Otherwise R\ :sub:`byte` returns ``undef``.
1695 R returns the value composed of the series of bytes it read. This
1696 implies that some bytes within the value may be ``undef`` **without**
1697 the entire value being ``undef``. Note that this only defines the
1698 semantics of the operation; it doesn't mean that targets will emit more
1699 than one instruction to read the series of bytes.
1701 Note that in cases where none of the atomic intrinsics are used, this
1702 model places only one restriction on IR transformations on top of what
1703 is required for single-threaded execution: introducing a store to a byte
1704 which might not otherwise be stored is not allowed in general.
1705 (Specifically, in the case where another thread might write to and read
1706 from an address, introducing a store can change a load that may see
1707 exactly one write into a load that may see multiple writes.)
1711 Atomic Memory Ordering Constraints
1712 ----------------------------------
1714 Atomic instructions (:ref:`cmpxchg <i_cmpxchg>`,
1715 :ref:`atomicrmw <i_atomicrmw>`, :ref:`fence <i_fence>`,
1716 :ref:`atomic load <i_load>`, and :ref:`atomic store <i_store>`) take
1717 ordering parameters that determine which other atomic instructions on
1718 the same address they *synchronize with*. These semantics are borrowed
1719 from Java and C++0x, but are somewhat more colloquial. If these
1720 descriptions aren't precise enough, check those specs (see spec
1721 references in the :doc:`atomics guide <Atomics>`).
1722 :ref:`fence <i_fence>` instructions treat these orderings somewhat
1723 differently since they don't take an address. See that instruction's
1724 documentation for details.
1726 For a simpler introduction to the ordering constraints, see the
1730 The set of values that can be read is governed by the happens-before
1731 partial order. A value cannot be read unless some operation wrote
1732 it. This is intended to provide a guarantee strong enough to model
1733 Java's non-volatile shared variables. This ordering cannot be
1734 specified for read-modify-write operations; it is not strong enough
1735 to make them atomic in any interesting way.
1737 In addition to the guarantees of ``unordered``, there is a single
1738 total order for modifications by ``monotonic`` operations on each
1739 address. All modification orders must be compatible with the
1740 happens-before order. There is no guarantee that the modification
1741 orders can be combined to a global total order for the whole program
1742 (and this often will not be possible). The read in an atomic
1743 read-modify-write operation (:ref:`cmpxchg <i_cmpxchg>` and
1744 :ref:`atomicrmw <i_atomicrmw>`) reads the value in the modification
1745 order immediately before the value it writes. If one atomic read
1746 happens before another atomic read of the same address, the later
1747 read must see the same value or a later value in the address's
1748 modification order. This disallows reordering of ``monotonic`` (or
1749 stronger) operations on the same address. If an address is written
1750 ``monotonic``-ally by one thread, and other threads ``monotonic``-ally
1751 read that address repeatedly, the other threads must eventually see
1752 the write. This corresponds to the C++0x/C1x
1753 ``memory_order_relaxed``.
1755 In addition to the guarantees of ``monotonic``, a
1756 *synchronizes-with* edge may be formed with a ``release`` operation.
1757 This is intended to model C++'s ``memory_order_acquire``.
1759 In addition to the guarantees of ``monotonic``, if this operation
1760 writes a value which is subsequently read by an ``acquire``
1761 operation, it *synchronizes-with* that operation. (This isn't a
1762 complete description; see the C++0x definition of a release
1763 sequence.) This corresponds to the C++0x/C1x
1764 ``memory_order_release``.
1765 ``acq_rel`` (acquire+release)
1766 Acts as both an ``acquire`` and ``release`` operation on its
1767 address. This corresponds to the C++0x/C1x ``memory_order_acq_rel``.
1768 ``seq_cst`` (sequentially consistent)
1769 In addition to the guarantees of ``acq_rel`` (``acquire`` for an
1770 operation that only reads, ``release`` for an operation that only
1771 writes), there is a global total order on all
1772 sequentially-consistent operations on all addresses, which is
1773 consistent with the *happens-before* partial order and with the
1774 modification orders of all the affected addresses. Each
1775 sequentially-consistent read sees the last preceding write to the
1776 same address in this global order. This corresponds to the C++0x/C1x
1777 ``memory_order_seq_cst`` and Java volatile.
1781 If an atomic operation is marked ``singlethread``, it only *synchronizes
1782 with* or participates in modification and seq\_cst total orderings with
1783 other operations running in the same thread (for example, in signal
1791 LLVM IR floating-point binary ops (:ref:`fadd <i_fadd>`,
1792 :ref:`fsub <i_fsub>`, :ref:`fmul <i_fmul>`, :ref:`fdiv <i_fdiv>`,
1793 :ref:`frem <i_frem>`) have the following flags that can be set to enable
1794 otherwise unsafe floating point operations
1797 No NaNs - Allow optimizations to assume the arguments and result are not
1798 NaN. Such optimizations are required to retain defined behavior over
1799 NaNs, but the value of the result is undefined.
1802 No Infs - Allow optimizations to assume the arguments and result are not
1803 +/-Inf. Such optimizations are required to retain defined behavior over
1804 +/-Inf, but the value of the result is undefined.
1807 No Signed Zeros - Allow optimizations to treat the sign of a zero
1808 argument or result as insignificant.
1811 Allow Reciprocal - Allow optimizations to use the reciprocal of an
1812 argument rather than perform division.
1815 Fast - Allow algebraically equivalent transformations that may
1816 dramatically change results in floating point (e.g. reassociate). This
1817 flag implies all the others.
1821 Use-list Order Directives
1822 -------------------------
1824 Use-list directives encode the in-memory order of each use-list, allowing the
1825 order to be recreated. ``<order-indexes>`` is a comma-separated list of
1826 indexes that are assigned to the referenced value's uses. The referenced
1827 value's use-list is immediately sorted by these indexes.
1829 Use-list directives may appear at function scope or global scope. They are not
1830 instructions, and have no effect on the semantics of the IR. When they're at
1831 function scope, they must appear after the terminator of the final basic block.
1833 If basic blocks have their address taken via ``blockaddress()`` expressions,
1834 ``uselistorder_bb`` can be used to reorder their use-lists from outside their
1841 uselistorder <ty> <value>, { <order-indexes> }
1842 uselistorder_bb @function, %block { <order-indexes> }
1848 define void @foo(i32 %arg1, i32 %arg2) {
1850 ; ... instructions ...
1852 ; ... instructions ...
1854 ; At function scope.
1855 uselistorder i32 %arg1, { 1, 0, 2 }
1856 uselistorder label %bb, { 1, 0 }
1860 uselistorder i32* @global, { 1, 2, 0 }
1861 uselistorder i32 7, { 1, 0 }
1862 uselistorder i32 (i32) @bar, { 1, 0 }
1863 uselistorder_bb @foo, %bb, { 5, 1, 3, 2, 0, 4 }
1870 The LLVM type system is one of the most important features of the
1871 intermediate representation. Being typed enables a number of
1872 optimizations to be performed on the intermediate representation
1873 directly, without having to do extra analyses on the side before the
1874 transformation. A strong type system makes it easier to read the
1875 generated code and enables novel analyses and transformations that are
1876 not feasible to perform on normal three address code representations.
1886 The void type does not represent any value and has no size.
1904 The function type can be thought of as a function signature. It consists of a
1905 return type and a list of formal parameter types. The return type of a function
1906 type is a void type or first class type --- except for :ref:`label <t_label>`
1907 and :ref:`metadata <t_metadata>` types.
1913 <returntype> (<parameter list>)
1915 ...where '``<parameter list>``' is a comma-separated list of type
1916 specifiers. Optionally, the parameter list may include a type ``...``, which
1917 indicates that the function takes a variable number of arguments. Variable
1918 argument functions can access their arguments with the :ref:`variable argument
1919 handling intrinsic <int_varargs>` functions. '``<returntype>``' is any type
1920 except :ref:`label <t_label>` and :ref:`metadata <t_metadata>`.
1924 +---------------------------------+---------------------------------------------------------------------------------------------------------------------------------------------------------------------+
1925 | ``i32 (i32)`` | function taking an ``i32``, returning an ``i32`` |
1926 +---------------------------------+---------------------------------------------------------------------------------------------------------------------------------------------------------------------+
1927 | ``float (i16, i32 *) *`` | :ref:`Pointer <t_pointer>` to a function that takes an ``i16`` and a :ref:`pointer <t_pointer>` to ``i32``, returning ``float``. |
1928 +---------------------------------+---------------------------------------------------------------------------------------------------------------------------------------------------------------------+
1929 | ``i32 (i8*, ...)`` | A vararg function that takes at least one :ref:`pointer <t_pointer>` to ``i8`` (char in C), which returns an integer. This is the signature for ``printf`` in LLVM. |
1930 +---------------------------------+---------------------------------------------------------------------------------------------------------------------------------------------------------------------+
1931 | ``{i32, i32} (i32)`` | A function taking an ``i32``, returning a :ref:`structure <t_struct>` containing two ``i32`` values |
1932 +---------------------------------+---------------------------------------------------------------------------------------------------------------------------------------------------------------------+
1939 The :ref:`first class <t_firstclass>` types are perhaps the most important.
1940 Values of these types are the only ones which can be produced by
1948 These are the types that are valid in registers from CodeGen's perspective.
1957 The integer type is a very simple type that simply specifies an
1958 arbitrary bit width for the integer type desired. Any bit width from 1
1959 bit to 2\ :sup:`23`\ -1 (about 8 million) can be specified.
1967 The number of bits the integer will occupy is specified by the ``N``
1973 +----------------+------------------------------------------------+
1974 | ``i1`` | a single-bit integer. |
1975 +----------------+------------------------------------------------+
1976 | ``i32`` | a 32-bit integer. |
1977 +----------------+------------------------------------------------+
1978 | ``i1942652`` | a really big integer of over 1 million bits. |
1979 +----------------+------------------------------------------------+
1983 Floating Point Types
1984 """"""""""""""""""""
1993 - 16-bit floating point value
1996 - 32-bit floating point value
1999 - 64-bit floating point value
2002 - 128-bit floating point value (112-bit mantissa)
2005 - 80-bit floating point value (X87)
2008 - 128-bit floating point value (two 64-bits)
2015 The x86_mmx type represents a value held in an MMX register on an x86
2016 machine. The operations allowed on it are quite limited: parameters and
2017 return values, load and store, and bitcast. User-specified MMX
2018 instructions are represented as intrinsic or asm calls with arguments
2019 and/or results of this type. There are no arrays, vectors or constants
2036 The pointer type is used to specify memory locations. Pointers are
2037 commonly used to reference objects in memory.
2039 Pointer types may have an optional address space attribute defining the
2040 numbered address space where the pointed-to object resides. The default
2041 address space is number zero. The semantics of non-zero address spaces
2042 are target-specific.
2044 Note that LLVM does not permit pointers to void (``void*``) nor does it
2045 permit pointers to labels (``label*``). Use ``i8*`` instead.
2055 +-------------------------+--------------------------------------------------------------------------------------------------------------+
2056 | ``[4 x i32]*`` | A :ref:`pointer <t_pointer>` to :ref:`array <t_array>` of four ``i32`` values. |
2057 +-------------------------+--------------------------------------------------------------------------------------------------------------+
2058 | ``i32 (i32*) *`` | A :ref:`pointer <t_pointer>` to a :ref:`function <t_function>` that takes an ``i32*``, returning an ``i32``. |
2059 +-------------------------+--------------------------------------------------------------------------------------------------------------+
2060 | ``i32 addrspace(5)*`` | A :ref:`pointer <t_pointer>` to an ``i32`` value that resides in address space #5. |
2061 +-------------------------+--------------------------------------------------------------------------------------------------------------+
2070 A vector type is a simple derived type that represents a vector of
2071 elements. Vector types are used when multiple primitive data are
2072 operated in parallel using a single instruction (SIMD). A vector type
2073 requires a size (number of elements) and an underlying primitive data
2074 type. Vector types are considered :ref:`first class <t_firstclass>`.
2080 < <# elements> x <elementtype> >
2082 The number of elements is a constant integer value larger than 0;
2083 elementtype may be any integer, floating point or pointer type. Vectors
2084 of size zero are not allowed.
2088 +-------------------+--------------------------------------------------+
2089 | ``<4 x i32>`` | Vector of 4 32-bit integer values. |
2090 +-------------------+--------------------------------------------------+
2091 | ``<8 x float>`` | Vector of 8 32-bit floating-point values. |
2092 +-------------------+--------------------------------------------------+
2093 | ``<2 x i64>`` | Vector of 2 64-bit integer values. |
2094 +-------------------+--------------------------------------------------+
2095 | ``<4 x i64*>`` | Vector of 4 pointers to 64-bit integer values. |
2096 +-------------------+--------------------------------------------------+
2105 The label type represents code labels.
2120 The metadata type represents embedded metadata. No derived types may be
2121 created from metadata except for :ref:`function <t_function>` arguments.
2134 Aggregate Types are a subset of derived types that can contain multiple
2135 member types. :ref:`Arrays <t_array>` and :ref:`structs <t_struct>` are
2136 aggregate types. :ref:`Vectors <t_vector>` are not considered to be
2146 The array type is a very simple derived type that arranges elements
2147 sequentially in memory. The array type requires a size (number of
2148 elements) and an underlying data type.
2154 [<# elements> x <elementtype>]
2156 The number of elements is a constant integer value; ``elementtype`` may
2157 be any type with a size.
2161 +------------------+--------------------------------------+
2162 | ``[40 x i32]`` | Array of 40 32-bit integer values. |
2163 +------------------+--------------------------------------+
2164 | ``[41 x i32]`` | Array of 41 32-bit integer values. |
2165 +------------------+--------------------------------------+
2166 | ``[4 x i8]`` | Array of 4 8-bit integer values. |
2167 +------------------+--------------------------------------+
2169 Here are some examples of multidimensional arrays:
2171 +-----------------------------+----------------------------------------------------------+
2172 | ``[3 x [4 x i32]]`` | 3x4 array of 32-bit integer values. |
2173 +-----------------------------+----------------------------------------------------------+
2174 | ``[12 x [10 x float]]`` | 12x10 array of single precision floating point values. |
2175 +-----------------------------+----------------------------------------------------------+
2176 | ``[2 x [3 x [4 x i16]]]`` | 2x3x4 array of 16-bit integer values. |
2177 +-----------------------------+----------------------------------------------------------+
2179 There is no restriction on indexing beyond the end of the array implied
2180 by a static type (though there are restrictions on indexing beyond the
2181 bounds of an allocated object in some cases). This means that
2182 single-dimension 'variable sized array' addressing can be implemented in
2183 LLVM with a zero length array type. An implementation of 'pascal style
2184 arrays' in LLVM could use the type "``{ i32, [0 x float]}``", for
2194 The structure type is used to represent a collection of data members
2195 together in memory. The elements of a structure may be any type that has
2198 Structures in memory are accessed using '``load``' and '``store``' by
2199 getting a pointer to a field with the '``getelementptr``' instruction.
2200 Structures in registers are accessed using the '``extractvalue``' and
2201 '``insertvalue``' instructions.
2203 Structures may optionally be "packed" structures, which indicate that
2204 the alignment of the struct is one byte, and that there is no padding
2205 between the elements. In non-packed structs, padding between field types
2206 is inserted as defined by the DataLayout string in the module, which is
2207 required to match what the underlying code generator expects.
2209 Structures can either be "literal" or "identified". A literal structure
2210 is defined inline with other types (e.g. ``{i32, i32}*``) whereas
2211 identified types are always defined at the top level with a name.
2212 Literal types are uniqued by their contents and can never be recursive
2213 or opaque since there is no way to write one. Identified types can be
2214 recursive, can be opaqued, and are never uniqued.
2220 %T1 = type { <type list> } ; Identified normal struct type
2221 %T2 = type <{ <type list> }> ; Identified packed struct type
2225 +------------------------------+---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
2226 | ``{ i32, i32, i32 }`` | A triple of three ``i32`` values |
2227 +------------------------------+---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
2228 | ``{ float, i32 (i32) * }`` | A pair, where the first element is a ``float`` and the second element is a :ref:`pointer <t_pointer>` to a :ref:`function <t_function>` that takes an ``i32``, returning an ``i32``. |
2229 +------------------------------+---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
2230 | ``<{ i8, i32 }>`` | A packed struct known to be 5 bytes in size. |
2231 +------------------------------+---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
2235 Opaque Structure Types
2236 """"""""""""""""""""""
2240 Opaque structure types are used to represent named structure types that
2241 do not have a body specified. This corresponds (for example) to the C
2242 notion of a forward declared structure.
2253 +--------------+-------------------+
2254 | ``opaque`` | An opaque type. |
2255 +--------------+-------------------+
2262 LLVM has several different basic types of constants. This section
2263 describes them all and their syntax.
2268 **Boolean constants**
2269 The two strings '``true``' and '``false``' are both valid constants
2271 **Integer constants**
2272 Standard integers (such as '4') are constants of the
2273 :ref:`integer <t_integer>` type. Negative numbers may be used with
2275 **Floating point constants**
2276 Floating point constants use standard decimal notation (e.g.
2277 123.421), exponential notation (e.g. 1.23421e+2), or a more precise
2278 hexadecimal notation (see below). The assembler requires the exact
2279 decimal value of a floating-point constant. For example, the
2280 assembler accepts 1.25 but rejects 1.3 because 1.3 is a repeating
2281 decimal in binary. Floating point constants must have a :ref:`floating
2282 point <t_floating>` type.
2283 **Null pointer constants**
2284 The identifier '``null``' is recognized as a null pointer constant
2285 and must be of :ref:`pointer type <t_pointer>`.
2287 The one non-intuitive notation for constants is the hexadecimal form of
2288 floating point constants. For example, the form
2289 '``double 0x432ff973cafa8000``' is equivalent to (but harder to read
2290 than) '``double 4.5e+15``'. The only time hexadecimal floating point
2291 constants are required (and the only time that they are generated by the
2292 disassembler) is when a floating point constant must be emitted but it
2293 cannot be represented as a decimal floating point number in a reasonable
2294 number of digits. For example, NaN's, infinities, and other special
2295 values are represented in their IEEE hexadecimal format so that assembly
2296 and disassembly do not cause any bits to change in the constants.
2298 When using the hexadecimal form, constants of types half, float, and
2299 double are represented using the 16-digit form shown above (which
2300 matches the IEEE754 representation for double); half and float values
2301 must, however, be exactly representable as IEEE 754 half and single
2302 precision, respectively. Hexadecimal format is always used for long
2303 double, and there are three forms of long double. The 80-bit format used
2304 by x86 is represented as ``0xK`` followed by 20 hexadecimal digits. The
2305 128-bit format used by PowerPC (two adjacent doubles) is represented by
2306 ``0xM`` followed by 32 hexadecimal digits. The IEEE 128-bit format is
2307 represented by ``0xL`` followed by 32 hexadecimal digits. Long doubles
2308 will only work if they match the long double format on your target.
2309 The IEEE 16-bit format (half precision) is represented by ``0xH``
2310 followed by 4 hexadecimal digits. All hexadecimal formats are big-endian
2311 (sign bit at the left).
2313 There are no constants of type x86_mmx.
2315 .. _complexconstants:
2320 Complex constants are a (potentially recursive) combination of simple
2321 constants and smaller complex constants.
2323 **Structure constants**
2324 Structure constants are represented with notation similar to
2325 structure type definitions (a comma separated list of elements,
2326 surrounded by braces (``{}``)). For example:
2327 "``{ i32 4, float 17.0, i32* @G }``", where "``@G``" is declared as
2328 "``@G = external global i32``". Structure constants must have
2329 :ref:`structure type <t_struct>`, and the number and types of elements
2330 must match those specified by the type.
2332 Array constants are represented with notation similar to array type
2333 definitions (a comma separated list of elements, surrounded by
2334 square brackets (``[]``)). For example:
2335 "``[ i32 42, i32 11, i32 74 ]``". Array constants must have
2336 :ref:`array type <t_array>`, and the number and types of elements must
2337 match those specified by the type. As a special case, character array
2338 constants may also be represented as a double-quoted string using the ``c``
2339 prefix. For example: "``c"Hello World\0A\00"``".
2340 **Vector constants**
2341 Vector constants are represented with notation similar to vector
2342 type definitions (a comma separated list of elements, surrounded by
2343 less-than/greater-than's (``<>``)). For example:
2344 "``< i32 42, i32 11, i32 74, i32 100 >``". Vector constants
2345 must have :ref:`vector type <t_vector>`, and the number and types of
2346 elements must match those specified by the type.
2347 **Zero initialization**
2348 The string '``zeroinitializer``' can be used to zero initialize a
2349 value to zero of *any* type, including scalar and
2350 :ref:`aggregate <t_aggregate>` types. This is often used to avoid
2351 having to print large zero initializers (e.g. for large arrays) and
2352 is always exactly equivalent to using explicit zero initializers.
2354 A metadata node is a constant tuple without types. For example:
2355 "``!{!0, !{!2, !0}, !"test"}``". Metadata can reference constant values,
2356 for example: "``!{!0, i32 0, i8* @global, i64 (i64)* @function, !"str"}``".
2357 Unlike other typed constants that are meant to be interpreted as part of
2358 the instruction stream, metadata is a place to attach additional
2359 information such as debug info.
2361 Global Variable and Function Addresses
2362 --------------------------------------
2364 The addresses of :ref:`global variables <globalvars>` and
2365 :ref:`functions <functionstructure>` are always implicitly valid
2366 (link-time) constants. These constants are explicitly referenced when
2367 the :ref:`identifier for the global <identifiers>` is used and always have
2368 :ref:`pointer <t_pointer>` type. For example, the following is a legal LLVM
2371 .. code-block:: llvm
2375 @Z = global [2 x i32*] [ i32* @X, i32* @Y ]
2382 The string '``undef``' can be used anywhere a constant is expected, and
2383 indicates that the user of the value may receive an unspecified
2384 bit-pattern. Undefined values may be of any type (other than '``label``'
2385 or '``void``') and be used anywhere a constant is permitted.
2387 Undefined values are useful because they indicate to the compiler that
2388 the program is well defined no matter what value is used. This gives the
2389 compiler more freedom to optimize. Here are some examples of
2390 (potentially surprising) transformations that are valid (in pseudo IR):
2392 .. code-block:: llvm
2402 This is safe because all of the output bits are affected by the undef
2403 bits. Any output bit can have a zero or one depending on the input bits.
2405 .. code-block:: llvm
2416 These logical operations have bits that are not always affected by the
2417 input. For example, if ``%X`` has a zero bit, then the output of the
2418 '``and``' operation will always be a zero for that bit, no matter what
2419 the corresponding bit from the '``undef``' is. As such, it is unsafe to
2420 optimize or assume that the result of the '``and``' is '``undef``'.
2421 However, it is safe to assume that all bits of the '``undef``' could be
2422 0, and optimize the '``and``' to 0. Likewise, it is safe to assume that
2423 all the bits of the '``undef``' operand to the '``or``' could be set,
2424 allowing the '``or``' to be folded to -1.
2426 .. code-block:: llvm
2428 %A = select undef, %X, %Y
2429 %B = select undef, 42, %Y
2430 %C = select %X, %Y, undef
2440 This set of examples shows that undefined '``select``' (and conditional
2441 branch) conditions can go *either way*, but they have to come from one
2442 of the two operands. In the ``%A`` example, if ``%X`` and ``%Y`` were
2443 both known to have a clear low bit, then ``%A`` would have to have a
2444 cleared low bit. However, in the ``%C`` example, the optimizer is
2445 allowed to assume that the '``undef``' operand could be the same as
2446 ``%Y``, allowing the whole '``select``' to be eliminated.
2448 .. code-block:: llvm
2450 %A = xor undef, undef
2467 This example points out that two '``undef``' operands are not
2468 necessarily the same. This can be surprising to people (and also matches
2469 C semantics) where they assume that "``X^X``" is always zero, even if
2470 ``X`` is undefined. This isn't true for a number of reasons, but the
2471 short answer is that an '``undef``' "variable" can arbitrarily change
2472 its value over its "live range". This is true because the variable
2473 doesn't actually *have a live range*. Instead, the value is logically
2474 read from arbitrary registers that happen to be around when needed, so
2475 the value is not necessarily consistent over time. In fact, ``%A`` and
2476 ``%C`` need to have the same semantics or the core LLVM "replace all
2477 uses with" concept would not hold.
2479 .. code-block:: llvm
2487 These examples show the crucial difference between an *undefined value*
2488 and *undefined behavior*. An undefined value (like '``undef``') is
2489 allowed to have an arbitrary bit-pattern. This means that the ``%A``
2490 operation can be constant folded to '``undef``', because the '``undef``'
2491 could be an SNaN, and ``fdiv`` is not (currently) defined on SNaN's.
2492 However, in the second example, we can make a more aggressive
2493 assumption: because the ``undef`` is allowed to be an arbitrary value,
2494 we are allowed to assume that it could be zero. Since a divide by zero
2495 has *undefined behavior*, we are allowed to assume that the operation
2496 does not execute at all. This allows us to delete the divide and all
2497 code after it. Because the undefined operation "can't happen", the
2498 optimizer can assume that it occurs in dead code.
2500 .. code-block:: llvm
2502 a: store undef -> %X
2503 b: store %X -> undef
2508 These examples reiterate the ``fdiv`` example: a store *of* an undefined
2509 value can be assumed to not have any effect; we can assume that the
2510 value is overwritten with bits that happen to match what was already
2511 there. However, a store *to* an undefined location could clobber
2512 arbitrary memory, therefore, it has undefined behavior.
2519 Poison values are similar to :ref:`undef values <undefvalues>`, however
2520 they also represent the fact that an instruction or constant expression
2521 that cannot evoke side effects has nevertheless detected a condition
2522 that results in undefined behavior.
2524 There is currently no way of representing a poison value in the IR; they
2525 only exist when produced by operations such as :ref:`add <i_add>` with
2528 Poison value behavior is defined in terms of value *dependence*:
2530 - Values other than :ref:`phi <i_phi>` nodes depend on their operands.
2531 - :ref:`Phi <i_phi>` nodes depend on the operand corresponding to
2532 their dynamic predecessor basic block.
2533 - Function arguments depend on the corresponding actual argument values
2534 in the dynamic callers of their functions.
2535 - :ref:`Call <i_call>` instructions depend on the :ref:`ret <i_ret>`
2536 instructions that dynamically transfer control back to them.
2537 - :ref:`Invoke <i_invoke>` instructions depend on the
2538 :ref:`ret <i_ret>`, :ref:`resume <i_resume>`, or exception-throwing
2539 call instructions that dynamically transfer control back to them.
2540 - Non-volatile loads and stores depend on the most recent stores to all
2541 of the referenced memory addresses, following the order in the IR
2542 (including loads and stores implied by intrinsics such as
2543 :ref:`@llvm.memcpy <int_memcpy>`.)
2544 - An instruction with externally visible side effects depends on the
2545 most recent preceding instruction with externally visible side
2546 effects, following the order in the IR. (This includes :ref:`volatile
2547 operations <volatile>`.)
2548 - An instruction *control-depends* on a :ref:`terminator
2549 instruction <terminators>` if the terminator instruction has
2550 multiple successors and the instruction is always executed when
2551 control transfers to one of the successors, and may not be executed
2552 when control is transferred to another.
2553 - Additionally, an instruction also *control-depends* on a terminator
2554 instruction if the set of instructions it otherwise depends on would
2555 be different if the terminator had transferred control to a different
2557 - Dependence is transitive.
2559 Poison values have the same behavior as :ref:`undef values <undefvalues>`,
2560 with the additional effect that any instruction that has a *dependence*
2561 on a poison value has undefined behavior.
2563 Here are some examples:
2565 .. code-block:: llvm
2568 %poison = sub nuw i32 0, 1 ; Results in a poison value.
2569 %still_poison = and i32 %poison, 0 ; 0, but also poison.
2570 %poison_yet_again = getelementptr i32, i32* @h, i32 %still_poison
2571 store i32 0, i32* %poison_yet_again ; memory at @h[0] is poisoned
2573 store i32 %poison, i32* @g ; Poison value stored to memory.
2574 %poison2 = load i32, i32* @g ; Poison value loaded back from memory.
2576 store volatile i32 %poison, i32* @g ; External observation; undefined behavior.
2578 %narrowaddr = bitcast i32* @g to i16*
2579 %wideaddr = bitcast i32* @g to i64*
2580 %poison3 = load i16, i16* %narrowaddr ; Returns a poison value.
2581 %poison4 = load i64, i64* %wideaddr ; Returns a poison value.
2583 %cmp = icmp slt i32 %poison, 0 ; Returns a poison value.
2584 br i1 %cmp, label %true, label %end ; Branch to either destination.
2587 store volatile i32 0, i32* @g ; This is control-dependent on %cmp, so
2588 ; it has undefined behavior.
2592 %p = phi i32 [ 0, %entry ], [ 1, %true ]
2593 ; Both edges into this PHI are
2594 ; control-dependent on %cmp, so this
2595 ; always results in a poison value.
2597 store volatile i32 0, i32* @g ; This would depend on the store in %true
2598 ; if %cmp is true, or the store in %entry
2599 ; otherwise, so this is undefined behavior.
2601 br i1 %cmp, label %second_true, label %second_end
2602 ; The same branch again, but this time the
2603 ; true block doesn't have side effects.
2610 store volatile i32 0, i32* @g ; This time, the instruction always depends
2611 ; on the store in %end. Also, it is
2612 ; control-equivalent to %end, so this is
2613 ; well-defined (ignoring earlier undefined
2614 ; behavior in this example).
2618 Addresses of Basic Blocks
2619 -------------------------
2621 ``blockaddress(@function, %block)``
2623 The '``blockaddress``' constant computes the address of the specified
2624 basic block in the specified function, and always has an ``i8*`` type.
2625 Taking the address of the entry block is illegal.
2627 This value only has defined behavior when used as an operand to the
2628 ':ref:`indirectbr <i_indirectbr>`' instruction, or for comparisons
2629 against null. Pointer equality tests between labels addresses results in
2630 undefined behavior --- though, again, comparison against null is ok, and
2631 no label is equal to the null pointer. This may be passed around as an
2632 opaque pointer sized value as long as the bits are not inspected. This
2633 allows ``ptrtoint`` and arithmetic to be performed on these values so
2634 long as the original value is reconstituted before the ``indirectbr``
2637 Finally, some targets may provide defined semantics when using the value
2638 as the operand to an inline assembly, but that is target specific.
2642 Constant Expressions
2643 --------------------
2645 Constant expressions are used to allow expressions involving other
2646 constants to be used as constants. Constant expressions may be of any
2647 :ref:`first class <t_firstclass>` type and may involve any LLVM operation
2648 that does not have side effects (e.g. load and call are not supported).
2649 The following is the syntax for constant expressions:
2651 ``trunc (CST to TYPE)``
2652 Truncate a constant to another type. The bit size of CST must be
2653 larger than the bit size of TYPE. Both types must be integers.
2654 ``zext (CST to TYPE)``
2655 Zero extend a constant to another type. The bit size of CST must be
2656 smaller than the bit size of TYPE. Both types must be integers.
2657 ``sext (CST to TYPE)``
2658 Sign extend a constant to another type. The bit size of CST must be
2659 smaller than the bit size of TYPE. Both types must be integers.
2660 ``fptrunc (CST to TYPE)``
2661 Truncate a floating point constant to another floating point type.
2662 The size of CST must be larger than the size of TYPE. Both types
2663 must be floating point.
2664 ``fpext (CST to TYPE)``
2665 Floating point extend a constant to another type. The size of CST
2666 must be smaller or equal to the size of TYPE. Both types must be
2668 ``fptoui (CST to TYPE)``
2669 Convert a floating point constant to the corresponding unsigned
2670 integer constant. TYPE must be a scalar or vector integer type. CST
2671 must be of scalar or vector floating point type. Both CST and TYPE
2672 must be scalars, or vectors of the same number of elements. If the
2673 value won't fit in the integer type, the results are undefined.
2674 ``fptosi (CST to TYPE)``
2675 Convert a floating point constant to the corresponding signed
2676 integer constant. TYPE must be a scalar or vector integer type. CST
2677 must be of scalar or vector floating point type. Both CST and TYPE
2678 must be scalars, or vectors of the same number of elements. If the
2679 value won't fit in the integer type, the results are undefined.
2680 ``uitofp (CST to TYPE)``
2681 Convert an unsigned integer constant to the corresponding floating
2682 point constant. TYPE must be a scalar or vector floating point type.
2683 CST must be of scalar or vector integer type. Both CST and TYPE must
2684 be scalars, or vectors of the same number of elements. If the value
2685 won't fit in the floating point type, the results are undefined.
2686 ``sitofp (CST to TYPE)``
2687 Convert a signed integer constant to the corresponding floating
2688 point constant. TYPE must be a scalar or vector floating point type.
2689 CST must be of scalar or vector integer type. Both CST and TYPE must
2690 be scalars, or vectors of the same number of elements. If the value
2691 won't fit in the floating point type, the results are undefined.
2692 ``ptrtoint (CST to TYPE)``
2693 Convert a pointer typed constant to the corresponding integer
2694 constant. ``TYPE`` must be an integer type. ``CST`` must be of
2695 pointer type. The ``CST`` value is zero extended, truncated, or
2696 unchanged to make it fit in ``TYPE``.
2697 ``inttoptr (CST to TYPE)``
2698 Convert an integer constant to a pointer constant. TYPE must be a
2699 pointer type. CST must be of integer type. The CST value is zero
2700 extended, truncated, or unchanged to make it fit in a pointer size.
2701 This one is *really* dangerous!
2702 ``bitcast (CST to TYPE)``
2703 Convert a constant, CST, to another TYPE. The constraints of the
2704 operands are the same as those for the :ref:`bitcast
2705 instruction <i_bitcast>`.
2706 ``addrspacecast (CST to TYPE)``
2707 Convert a constant pointer or constant vector of pointer, CST, to another
2708 TYPE in a different address space. The constraints of the operands are the
2709 same as those for the :ref:`addrspacecast instruction <i_addrspacecast>`.
2710 ``getelementptr (CSTPTR, IDX0, IDX1, ...)``, ``getelementptr inbounds (CSTPTR, IDX0, IDX1, ...)``
2711 Perform the :ref:`getelementptr operation <i_getelementptr>` on
2712 constants. As with the :ref:`getelementptr <i_getelementptr>`
2713 instruction, the index list may have zero or more indexes, which are
2714 required to make sense for the type of "CSTPTR".
2715 ``select (COND, VAL1, VAL2)``
2716 Perform the :ref:`select operation <i_select>` on constants.
2717 ``icmp COND (VAL1, VAL2)``
2718 Performs the :ref:`icmp operation <i_icmp>` on constants.
2719 ``fcmp COND (VAL1, VAL2)``
2720 Performs the :ref:`fcmp operation <i_fcmp>` on constants.
2721 ``extractelement (VAL, IDX)``
2722 Perform the :ref:`extractelement operation <i_extractelement>` on
2724 ``insertelement (VAL, ELT, IDX)``
2725 Perform the :ref:`insertelement operation <i_insertelement>` on
2727 ``shufflevector (VEC1, VEC2, IDXMASK)``
2728 Perform the :ref:`shufflevector operation <i_shufflevector>` on
2730 ``extractvalue (VAL, IDX0, IDX1, ...)``
2731 Perform the :ref:`extractvalue operation <i_extractvalue>` on
2732 constants. The index list is interpreted in a similar manner as
2733 indices in a ':ref:`getelementptr <i_getelementptr>`' operation. At
2734 least one index value must be specified.
2735 ``insertvalue (VAL, ELT, IDX0, IDX1, ...)``
2736 Perform the :ref:`insertvalue operation <i_insertvalue>` on constants.
2737 The index list is interpreted in a similar manner as indices in a
2738 ':ref:`getelementptr <i_getelementptr>`' operation. At least one index
2739 value must be specified.
2740 ``OPCODE (LHS, RHS)``
2741 Perform the specified operation of the LHS and RHS constants. OPCODE
2742 may be any of the :ref:`binary <binaryops>` or :ref:`bitwise
2743 binary <bitwiseops>` operations. The constraints on operands are
2744 the same as those for the corresponding instruction (e.g. no bitwise
2745 operations on floating point values are allowed).
2752 Inline Assembler Expressions
2753 ----------------------------
2755 LLVM supports inline assembler expressions (as opposed to :ref:`Module-Level
2756 Inline Assembly <moduleasm>`) through the use of a special value. This
2757 value represents the inline assembler as a string (containing the
2758 instructions to emit), a list of operand constraints (stored as a
2759 string), a flag that indicates whether or not the inline asm expression
2760 has side effects, and a flag indicating whether the function containing
2761 the asm needs to align its stack conservatively. An example inline
2762 assembler expression is:
2764 .. code-block:: llvm
2766 i32 (i32) asm "bswap $0", "=r,r"
2768 Inline assembler expressions may **only** be used as the callee operand
2769 of a :ref:`call <i_call>` or an :ref:`invoke <i_invoke>` instruction.
2770 Thus, typically we have:
2772 .. code-block:: llvm
2774 %X = call i32 asm "bswap $0", "=r,r"(i32 %Y)
2776 Inline asms with side effects not visible in the constraint list must be
2777 marked as having side effects. This is done through the use of the
2778 '``sideeffect``' keyword, like so:
2780 .. code-block:: llvm
2782 call void asm sideeffect "eieio", ""()
2784 In some cases inline asms will contain code that will not work unless
2785 the stack is aligned in some way, such as calls or SSE instructions on
2786 x86, yet will not contain code that does that alignment within the asm.
2787 The compiler should make conservative assumptions about what the asm
2788 might contain and should generate its usual stack alignment code in the
2789 prologue if the '``alignstack``' keyword is present:
2791 .. code-block:: llvm
2793 call void asm alignstack "eieio", ""()
2795 Inline asms also support using non-standard assembly dialects. The
2796 assumed dialect is ATT. When the '``inteldialect``' keyword is present,
2797 the inline asm is using the Intel dialect. Currently, ATT and Intel are
2798 the only supported dialects. An example is:
2800 .. code-block:: llvm
2802 call void asm inteldialect "eieio", ""()
2804 If multiple keywords appear the '``sideeffect``' keyword must come
2805 first, the '``alignstack``' keyword second and the '``inteldialect``'
2811 The call instructions that wrap inline asm nodes may have a
2812 "``!srcloc``" MDNode attached to it that contains a list of constant
2813 integers. If present, the code generator will use the integer as the
2814 location cookie value when report errors through the ``LLVMContext``
2815 error reporting mechanisms. This allows a front-end to correlate backend
2816 errors that occur with inline asm back to the source code that produced
2819 .. code-block:: llvm
2821 call void asm sideeffect "something bad", ""(), !srcloc !42
2823 !42 = !{ i32 1234567 }
2825 It is up to the front-end to make sense of the magic numbers it places
2826 in the IR. If the MDNode contains multiple constants, the code generator
2827 will use the one that corresponds to the line of the asm that the error
2835 LLVM IR allows metadata to be attached to instructions in the program
2836 that can convey extra information about the code to the optimizers and
2837 code generator. One example application of metadata is source-level
2838 debug information. There are two metadata primitives: strings and nodes.
2840 Metadata does not have a type, and is not a value. If referenced from a
2841 ``call`` instruction, it uses the ``metadata`` type.
2843 All metadata are identified in syntax by a exclamation point ('``!``').
2845 .. _metadata-string:
2847 Metadata Nodes and Metadata Strings
2848 -----------------------------------
2850 A metadata string is a string surrounded by double quotes. It can
2851 contain any character by escaping non-printable characters with
2852 "``\xx``" where "``xx``" is the two digit hex code. For example:
2855 Metadata nodes are represented with notation similar to structure
2856 constants (a comma separated list of elements, surrounded by braces and
2857 preceded by an exclamation point). Metadata nodes can have any values as
2858 their operand. For example:
2860 .. code-block:: llvm
2862 !{ !"test\00", i32 10}
2864 Metadata nodes that aren't uniqued use the ``distinct`` keyword. For example:
2866 .. code-block:: llvm
2868 !0 = distinct !{!"test\00", i32 10}
2870 ``distinct`` nodes are useful when nodes shouldn't be merged based on their
2871 content. They can also occur when transformations cause uniquing collisions
2872 when metadata operands change.
2874 A :ref:`named metadata <namedmetadatastructure>` is a collection of
2875 metadata nodes, which can be looked up in the module symbol table. For
2878 .. code-block:: llvm
2882 Metadata can be used as function arguments. Here ``llvm.dbg.value``
2883 function is using two metadata arguments:
2885 .. code-block:: llvm
2887 call void @llvm.dbg.value(metadata !24, i64 0, metadata !25)
2889 Metadata can be attached with an instruction. Here metadata ``!21`` is
2890 attached to the ``add`` instruction using the ``!dbg`` identifier:
2892 .. code-block:: llvm
2894 %indvar.next = add i64 %indvar, 1, !dbg !21
2896 More information about specific metadata nodes recognized by the
2897 optimizers and code generator is found below.
2899 Specialized Metadata Nodes
2900 ^^^^^^^^^^^^^^^^^^^^^^^^^^
2902 Specialized metadata nodes are custom data structures in metadata (as opposed
2903 to generic tuples). Their fields are labelled, and can be specified in any
2906 These aren't inherently debug info centric, but currently all the specialized
2907 metadata nodes are related to debug info.
2912 ``MDCompileUnit`` nodes represent a compile unit. The ``enums:``,
2913 ``retainedTypes:``, ``subprograms:``, ``globals:`` and ``imports:`` fields are
2914 tuples containing the debug info to be emitted along with the compile unit,
2915 regardless of code optimizations (some nodes are only emitted if there are
2916 references to them from instructions).
2918 .. code-block:: llvm
2920 !0 = !MDCompileUnit(language: DW_LANG_C99, file: !1, producer: "clang",
2921 isOptimized: true, flags: "-O2", runtimeVersion: 2,
2922 splitDebugFilename: "abc.debug", emissionKind: 1,
2923 enums: !2, retainedTypes: !3, subprograms: !4,
2924 globals: !5, imports: !6)
2929 ``MDFile`` nodes represent files. The ``filename:`` can include slashes.
2931 .. code-block:: llvm
2933 !0 = !MDFile(filename: "path/to/file", directory: "/path/to/dir")
2940 ``MDBasicType`` nodes represent primitive types. ``tag:`` defaults to
2941 ``DW_TAG_base_type``.
2943 .. code-block:: llvm
2945 !0 = !MDBasicType(name: "unsigned char", size: 8, align: 8,
2946 encoding: DW_ATE_unsigned_char)
2947 !1 = !MDBasicType(tag: DW_TAG_unspecified_type, name: "decltype(nullptr)")
2949 .. _MDSubroutineType:
2954 ``MDSubroutineType`` nodes represent subroutine types. Their ``types:`` field
2955 refers to a tuple; the first operand is the return type, while the rest are the
2956 types of the formal arguments in order. If the first operand is ``null``, that
2957 represents a function with no return value (such as ``void foo() {}`` in C++).
2959 .. code-block:: llvm
2961 !0 = !BasicType(name: "int", size: 32, align: 32, DW_ATE_signed)
2962 !1 = !BasicType(name: "char", size: 8, align: 8, DW_ATE_signed_char)
2963 !2 = !MDSubroutineType(types: !{null, !0, !1}) ; void (int, char)
2968 ``MDDerivedType`` nodes represent types derived from other types, such as
2971 .. code-block:: llvm
2973 !0 = !MDBasicType(name: "unsigned char", size: 8, align: 8,
2974 encoding: DW_ATE_unsigned_char)
2975 !1 = !MDDerivedType(tag: DW_TAG_pointer_type, baseType: !0, size: 32,
2978 .. _MDCompositeType:
2983 ``MDCompositeType`` nodes represent types composed of other types, like
2984 structures and unions. ``elements:`` points to a tuple of the composed types.
2986 If the source language supports ODR, the ``identifier:`` field gives the unique
2987 identifier used for type merging between modules. When specified, other types
2988 can refer to composite types indirectly via a :ref:`metadata string
2989 <metadata-string>` that matches their identifier.
2991 .. code-block:: llvm
2993 !0 = !MDEnumerator(name: "SixKind", value: 7)
2994 !1 = !MDEnumerator(name: "SevenKind", value: 7)
2995 !2 = !MDEnumerator(name: "NegEightKind", value: -8)
2996 !3 = !MDCompositeType(tag: DW_TAG_enumeration_type, name: "Enum", file: !12,
2997 line: 2, size: 32, align: 32, identifier: "_M4Enum",
2998 elements: !{!0, !1, !2})
3003 ``MDSubrange`` nodes are the elements for ``DW_TAG_array_type`` variants of
3004 :ref:`MDCompositeType`. ``count: -1`` indicates an empty array.
3006 .. code-block:: llvm
3008 !0 = !MDSubrange(count: 5, lowerBound: 0) ; array counting from 0
3009 !1 = !MDSubrange(count: 5, lowerBound: 1) ; array counting from 1
3010 !2 = !MDSubrange(count: -1) ; empty array.
3015 ``MDEnumerator`` nodes are the elements for ``DW_TAG_enumeration_type``
3016 variants of :ref:`MDCompositeType`.
3018 .. code-block:: llvm
3020 !0 = !MDEnumerator(name: "SixKind", value: 7)
3021 !1 = !MDEnumerator(name: "SevenKind", value: 7)
3022 !2 = !MDEnumerator(name: "NegEightKind", value: -8)
3024 MDTemplateTypeParameter
3025 """""""""""""""""""""""
3027 ``MDTemplateTypeParameter`` nodes represent type parameters to generic source
3028 language constructs. They are used (optionally) in :ref:`MDCompositeType` and
3029 :ref:`MDSubprogram` ``templateParams:`` fields.
3031 .. code-block:: llvm
3033 !0 = !MDTemplateTypeParameter(name: "Ty", type: !1)
3035 MDTemplateValueParameter
3036 """"""""""""""""""""""""
3038 ``MDTemplateValueParameter`` nodes represent value parameters to generic source
3039 language constructs. ``tag:`` defaults to ``DW_TAG_template_value_parameter``,
3040 but if specified can also be set to ``DW_TAG_GNU_template_template_param`` or
3041 ``DW_TAG_GNU_template_param_pack``. They are used (optionally) in
3042 :ref:`MDCompositeType` and :ref:`MDSubprogram` ``templateParams:`` fields.
3044 .. code-block:: llvm
3046 !0 = !MDTemplateValueParameter(name: "Ty", type: !1, value: i32 7)
3051 ``MDNamespace`` nodes represent namespaces in the source language.
3053 .. code-block:: llvm
3055 !0 = !MDNamespace(name: "myawesomeproject", scope: !1, file: !2, line: 7)
3060 ``MDGlobalVariable`` nodes represent global variables in the source language.
3062 .. code-block:: llvm
3064 !0 = !MDGlobalVariable(name: "foo", linkageName: "foo", scope: !1,
3065 file: !2, line: 7, type: !3, isLocal: true,
3066 isDefinition: false, variable: i32* @foo,
3074 ``MDSubprogram`` nodes represent functions from the source language. The
3075 ``variables:`` field points at :ref:`variables <MDLocalVariable>` that must be
3076 retained, even if their IR counterparts are optimized out of the IR. The
3077 ``type:`` field must point at an :ref:`MDSubroutineType`.
3079 .. code-block:: llvm
3081 !0 = !MDSubprogram(name: "foo", linkageName: "_Zfoov", scope: !1,
3082 file: !2, line: 7, type: !3, isLocal: true,
3083 isDefinition: false, scopeLine: 8, containingType: !4,
3084 virtuality: DW_VIRTUALITY_pure_virtual, virtualIndex: 10,
3085 flags: DIFlagPrototyped, isOptimized: true,
3086 function: void ()* @_Z3foov,
3087 templateParams: !5, declaration: !6, variables: !7)
3094 ``MDLexicalBlock`` nodes represent lexical blocks in the source language (a
3097 .. code-block:: llvm
3099 !0 = !MDLexicalBlock(scope: !1, file: !2, line: 7, column: 35)
3101 .. _MDLexicalBlockFile:
3106 ``MDLexicalBlockFile`` nodes are used to discriminate between sections of a
3107 :ref:`lexical block <MDLexicalBlock>`. The ``file:`` field can be changed to
3108 indicate textual inclusion, or the ``discriminator:`` field can be used to
3109 discriminate between control flow within a single block in the source language.
3111 .. code-block:: llvm
3113 !0 = !MDLexicalBlock(scope: !3, file: !4, line: 7, column: 35)
3114 !1 = !MDLexicalBlockFile(scope: !0, file: !4, discriminator: 0)
3115 !2 = !MDLexicalBlockFile(scope: !0, file: !4, discriminator: 1)
3120 ``MDLocation`` nodes represent source debug locations. The ``scope:`` field is
3121 mandatory, and points at an :ref:`MDLexicalBlockFile`, an
3122 :ref:`MDLexicalBlock`, or an :ref:`MDSubprogram`.
3124 .. code-block:: llvm
3126 !0 = !MDLocation(line: 2900, column: 42, scope: !1, inlinedAt: !2)
3128 .. _MDLocalVariable:
3133 ``MDLocalVariable`` nodes represent local variables in the source language.
3134 Instead of ``DW_TAG_variable``, they use LLVM-specific fake tags to
3135 discriminate between local variables (``DW_TAG_auto_variable``) and subprogram
3136 arguments (``DW_TAG_arg_variable``). In the latter case, the ``arg:`` field
3137 specifies the argument position, and this variable will be included in the
3138 ``variables:`` field of its :ref:`MDSubprogram`.
3140 If set, the ``inlinedAt:`` field points at an :ref:`MDLocation`, and the
3141 variable represents an inlined version of a variable (with all other fields
3142 duplicated from the non-inlined version).
3144 .. code-block:: llvm
3146 !0 = !MDLocalVariable(tag: DW_TAG_arg_variable, name: "this", arg: 0,
3147 scope: !3, file: !2, line: 7, type: !3,
3148 flags: DIFlagArtificial, inlinedAt: !4)
3149 !1 = !MDLocalVariable(tag: DW_TAG_arg_variable, name: "x", arg: 1,
3150 scope: !4, file: !2, line: 7, type: !3,
3152 !1 = !MDLocalVariable(tag: DW_TAG_auto_variable, name: "y",
3153 scope: !5, file: !2, line: 7, type: !3,
3159 ``MDExpression`` nodes represent DWARF expression sequences. They are used in
3160 :ref:`debug intrinsics<dbg_intrinsics>` (such as ``llvm.dbg.declare``) to
3161 describe how the referenced LLVM variable relates to the source language
3164 The current supported vocabulary is limited:
3166 - ``DW_OP_deref`` dereferences the working expression.
3167 - ``DW_OP_plus, 93`` adds ``93`` to the working expression.
3168 - ``DW_OP_bit_piece, 16, 8`` specifies the offset and size (``16`` and ``8``
3169 here, respectively) of the variable piece from the working expression.
3171 .. code-block:: llvm
3173 !0 = !MDExpression(DW_OP_deref)
3174 !1 = !MDExpression(DW_OP_plus, 3)
3175 !2 = !MDExpression(DW_OP_bit_piece, 3, 7)
3176 !3 = !MDExpression(DW_OP_deref, DW_OP_plus, 3, DW_OP_bit_piece, 3, 7)
3181 ``MDObjCProperty`` nodes represent Objective-C property nodes.
3183 .. code-block:: llvm
3185 !3 = !MDObjCProperty(name: "foo", file: !1, line: 7, setter: "setFoo",
3186 getter: "getFoo", attributes: 7, type: !2)
3191 ``MDImportedEntity`` nodes represent entities (such as modules) imported into a
3194 .. code-block:: llvm
3196 !2 = !MDImportedEntity(tag: DW_TAG_imported_module, name: "foo", scope: !0,
3197 entity: !1, line: 7)
3202 In LLVM IR, memory does not have types, so LLVM's own type system is not
3203 suitable for doing TBAA. Instead, metadata is added to the IR to
3204 describe a type system of a higher level language. This can be used to
3205 implement typical C/C++ TBAA, but it can also be used to implement
3206 custom alias analysis behavior for other languages.
3208 The current metadata format is very simple. TBAA metadata nodes have up
3209 to three fields, e.g.:
3211 .. code-block:: llvm
3213 !0 = !{ !"an example type tree" }
3214 !1 = !{ !"int", !0 }
3215 !2 = !{ !"float", !0 }
3216 !3 = !{ !"const float", !2, i64 1 }
3218 The first field is an identity field. It can be any value, usually a
3219 metadata string, which uniquely identifies the type. The most important
3220 name in the tree is the name of the root node. Two trees with different
3221 root node names are entirely disjoint, even if they have leaves with
3224 The second field identifies the type's parent node in the tree, or is
3225 null or omitted for a root node. A type is considered to alias all of
3226 its descendants and all of its ancestors in the tree. Also, a type is
3227 considered to alias all types in other trees, so that bitcode produced
3228 from multiple front-ends is handled conservatively.
3230 If the third field is present, it's an integer which if equal to 1
3231 indicates that the type is "constant" (meaning
3232 ``pointsToConstantMemory`` should return true; see `other useful
3233 AliasAnalysis methods <AliasAnalysis.html#OtherItfs>`_).
3235 '``tbaa.struct``' Metadata
3236 ^^^^^^^^^^^^^^^^^^^^^^^^^^
3238 The :ref:`llvm.memcpy <int_memcpy>` is often used to implement
3239 aggregate assignment operations in C and similar languages, however it
3240 is defined to copy a contiguous region of memory, which is more than
3241 strictly necessary for aggregate types which contain holes due to
3242 padding. Also, it doesn't contain any TBAA information about the fields
3245 ``!tbaa.struct`` metadata can describe which memory subregions in a
3246 memcpy are padding and what the TBAA tags of the struct are.
3248 The current metadata format is very simple. ``!tbaa.struct`` metadata
3249 nodes are a list of operands which are in conceptual groups of three.
3250 For each group of three, the first operand gives the byte offset of a
3251 field in bytes, the second gives its size in bytes, and the third gives
3254 .. code-block:: llvm
3256 !4 = !{ i64 0, i64 4, !1, i64 8, i64 4, !2 }
3258 This describes a struct with two fields. The first is at offset 0 bytes
3259 with size 4 bytes, and has tbaa tag !1. The second is at offset 8 bytes
3260 and has size 4 bytes and has tbaa tag !2.
3262 Note that the fields need not be contiguous. In this example, there is a
3263 4 byte gap between the two fields. This gap represents padding which
3264 does not carry useful data and need not be preserved.
3266 '``noalias``' and '``alias.scope``' Metadata
3267 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
3269 ``noalias`` and ``alias.scope`` metadata provide the ability to specify generic
3270 noalias memory-access sets. This means that some collection of memory access
3271 instructions (loads, stores, memory-accessing calls, etc.) that carry
3272 ``noalias`` metadata can specifically be specified not to alias with some other
3273 collection of memory access instructions that carry ``alias.scope`` metadata.
3274 Each type of metadata specifies a list of scopes where each scope has an id and
3275 a domain. When evaluating an aliasing query, if for some some domain, the set
3276 of scopes with that domain in one instruction's ``alias.scope`` list is a
3277 subset of (or equal to) the set of scopes for that domain in another
3278 instruction's ``noalias`` list, then the two memory accesses are assumed not to
3281 The metadata identifying each domain is itself a list containing one or two
3282 entries. The first entry is the name of the domain. Note that if the name is a
3283 string then it can be combined accross functions and translation units. A
3284 self-reference can be used to create globally unique domain names. A
3285 descriptive string may optionally be provided as a second list entry.
3287 The metadata identifying each scope is also itself a list containing two or
3288 three entries. The first entry is the name of the scope. Note that if the name
3289 is a string then it can be combined accross functions and translation units. A
3290 self-reference can be used to create globally unique scope names. A metadata
3291 reference to the scope's domain is the second entry. A descriptive string may
3292 optionally be provided as a third list entry.
3296 .. code-block:: llvm
3298 ; Two scope domains:
3302 ; Some scopes in these domains:
3308 !5 = !{!4} ; A list containing only scope !4
3312 ; These two instructions don't alias:
3313 %0 = load float, float* %c, align 4, !alias.scope !5
3314 store float %0, float* %arrayidx.i, align 4, !noalias !5
3316 ; These two instructions also don't alias (for domain !1, the set of scopes
3317 ; in the !alias.scope equals that in the !noalias list):
3318 %2 = load float, float* %c, align 4, !alias.scope !5
3319 store float %2, float* %arrayidx.i2, align 4, !noalias !6
3321 ; These two instructions don't alias (for domain !0, the set of scopes in
3322 ; the !noalias list is not a superset of, or equal to, the scopes in the
3323 ; !alias.scope list):
3324 %2 = load float, float* %c, align 4, !alias.scope !6
3325 store float %0, float* %arrayidx.i, align 4, !noalias !7
3327 '``fpmath``' Metadata
3328 ^^^^^^^^^^^^^^^^^^^^^
3330 ``fpmath`` metadata may be attached to any instruction of floating point
3331 type. It can be used to express the maximum acceptable error in the
3332 result of that instruction, in ULPs, thus potentially allowing the
3333 compiler to use a more efficient but less accurate method of computing
3334 it. ULP is defined as follows:
3336 If ``x`` is a real number that lies between two finite consecutive
3337 floating-point numbers ``a`` and ``b``, without being equal to one
3338 of them, then ``ulp(x) = |b - a|``, otherwise ``ulp(x)`` is the
3339 distance between the two non-equal finite floating-point numbers
3340 nearest ``x``. Moreover, ``ulp(NaN)`` is ``NaN``.
3342 The metadata node shall consist of a single positive floating point
3343 number representing the maximum relative error, for example:
3345 .. code-block:: llvm
3347 !0 = !{ float 2.5 } ; maximum acceptable inaccuracy is 2.5 ULPs
3351 '``range``' Metadata
3352 ^^^^^^^^^^^^^^^^^^^^
3354 ``range`` metadata may be attached only to ``load``, ``call`` and ``invoke`` of
3355 integer types. It expresses the possible ranges the loaded value or the value
3356 returned by the called function at this call site is in. The ranges are
3357 represented with a flattened list of integers. The loaded value or the value
3358 returned is known to be in the union of the ranges defined by each consecutive
3359 pair. Each pair has the following properties:
3361 - The type must match the type loaded by the instruction.
3362 - The pair ``a,b`` represents the range ``[a,b)``.
3363 - Both ``a`` and ``b`` are constants.
3364 - The range is allowed to wrap.
3365 - The range should not represent the full or empty set. That is,
3368 In addition, the pairs must be in signed order of the lower bound and
3369 they must be non-contiguous.
3373 .. code-block:: llvm
3375 %a = load i8, i8* %x, align 1, !range !0 ; Can only be 0 or 1
3376 %b = load i8, i8* %y, align 1, !range !1 ; Can only be 255 (-1), 0 or 1
3377 %c = call i8 @foo(), !range !2 ; Can only be 0, 1, 3, 4 or 5
3378 %d = invoke i8 @bar() to label %cont
3379 unwind label %lpad, !range !3 ; Can only be -2, -1, 3, 4 or 5
3381 !0 = !{ i8 0, i8 2 }
3382 !1 = !{ i8 255, i8 2 }
3383 !2 = !{ i8 0, i8 2, i8 3, i8 6 }
3384 !3 = !{ i8 -2, i8 0, i8 3, i8 6 }
3389 It is sometimes useful to attach information to loop constructs. Currently,
3390 loop metadata is implemented as metadata attached to the branch instruction
3391 in the loop latch block. This type of metadata refer to a metadata node that is
3392 guaranteed to be separate for each loop. The loop identifier metadata is
3393 specified with the name ``llvm.loop``.
3395 The loop identifier metadata is implemented using a metadata that refers to
3396 itself to avoid merging it with any other identifier metadata, e.g.,
3397 during module linkage or function inlining. That is, each loop should refer
3398 to their own identification metadata even if they reside in separate functions.
3399 The following example contains loop identifier metadata for two separate loop
3402 .. code-block:: llvm
3407 The loop identifier metadata can be used to specify additional
3408 per-loop metadata. Any operands after the first operand can be treated
3409 as user-defined metadata. For example the ``llvm.loop.unroll.count``
3410 suggests an unroll factor to the loop unroller:
3412 .. code-block:: llvm
3414 br i1 %exitcond, label %._crit_edge, label %.lr.ph, !llvm.loop !0
3417 !1 = !{!"llvm.loop.unroll.count", i32 4}
3419 '``llvm.loop.vectorize``' and '``llvm.loop.interleave``'
3420 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
3422 Metadata prefixed with ``llvm.loop.vectorize`` or ``llvm.loop.interleave`` are
3423 used to control per-loop vectorization and interleaving parameters such as
3424 vectorization width and interleave count. These metadata should be used in
3425 conjunction with ``llvm.loop`` loop identification metadata. The
3426 ``llvm.loop.vectorize`` and ``llvm.loop.interleave`` metadata are only
3427 optimization hints and the optimizer will only interleave and vectorize loops if
3428 it believes it is safe to do so. The ``llvm.mem.parallel_loop_access`` metadata
3429 which contains information about loop-carried memory dependencies can be helpful
3430 in determining the safety of these transformations.
3432 '``llvm.loop.interleave.count``' Metadata
3433 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
3435 This metadata suggests an interleave count to the loop interleaver.
3436 The first operand is the string ``llvm.loop.interleave.count`` and the
3437 second operand is an integer specifying the interleave count. For
3440 .. code-block:: llvm
3442 !0 = !{!"llvm.loop.interleave.count", i32 4}
3444 Note that setting ``llvm.loop.interleave.count`` to 1 disables interleaving
3445 multiple iterations of the loop. If ``llvm.loop.interleave.count`` is set to 0
3446 then the interleave count will be determined automatically.
3448 '``llvm.loop.vectorize.enable``' Metadata
3449 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
3451 This metadata selectively enables or disables vectorization for the loop. The
3452 first operand is the string ``llvm.loop.vectorize.enable`` and the second operand
3453 is a bit. If the bit operand value is 1 vectorization is enabled. A value of
3454 0 disables vectorization:
3456 .. code-block:: llvm
3458 !0 = !{!"llvm.loop.vectorize.enable", i1 0}
3459 !1 = !{!"llvm.loop.vectorize.enable", i1 1}
3461 '``llvm.loop.vectorize.width``' Metadata
3462 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
3464 This metadata sets the target width of the vectorizer. The first
3465 operand is the string ``llvm.loop.vectorize.width`` and the second
3466 operand is an integer specifying the width. For example:
3468 .. code-block:: llvm
3470 !0 = !{!"llvm.loop.vectorize.width", i32 4}
3472 Note that setting ``llvm.loop.vectorize.width`` to 1 disables
3473 vectorization of the loop. If ``llvm.loop.vectorize.width`` is set to
3474 0 or if the loop does not have this metadata the width will be
3475 determined automatically.
3477 '``llvm.loop.unroll``'
3478 ^^^^^^^^^^^^^^^^^^^^^^
3480 Metadata prefixed with ``llvm.loop.unroll`` are loop unrolling
3481 optimization hints such as the unroll factor. ``llvm.loop.unroll``
3482 metadata should be used in conjunction with ``llvm.loop`` loop
3483 identification metadata. The ``llvm.loop.unroll`` metadata are only
3484 optimization hints and the unrolling will only be performed if the
3485 optimizer believes it is safe to do so.
3487 '``llvm.loop.unroll.count``' Metadata
3488 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
3490 This metadata suggests an unroll factor to the loop unroller. The
3491 first operand is the string ``llvm.loop.unroll.count`` and the second
3492 operand is a positive integer specifying the unroll factor. For
3495 .. code-block:: llvm
3497 !0 = !{!"llvm.loop.unroll.count", i32 4}
3499 If the trip count of the loop is less than the unroll count the loop
3500 will be partially unrolled.
3502 '``llvm.loop.unroll.disable``' Metadata
3503 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
3505 This metadata either disables loop unrolling. The metadata has a single operand
3506 which is the string ``llvm.loop.unroll.disable``. For example:
3508 .. code-block:: llvm
3510 !0 = !{!"llvm.loop.unroll.disable"}
3512 '``llvm.loop.unroll.runtime.disable``' Metadata
3513 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
3515 This metadata either disables runtime loop unrolling. The metadata has a single
3516 operand which is the string ``llvm.loop.unroll.runtime.disable``. For example:
3518 .. code-block:: llvm
3520 !0 = !{!"llvm.loop.unroll.runtime.disable"}
3522 '``llvm.loop.unroll.full``' Metadata
3523 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
3525 This metadata either suggests that the loop should be unrolled fully. The
3526 metadata has a single operand which is the string ``llvm.loop.unroll.disable``.
3529 .. code-block:: llvm
3531 !0 = !{!"llvm.loop.unroll.full"}
3536 Metadata types used to annotate memory accesses with information helpful
3537 for optimizations are prefixed with ``llvm.mem``.
3539 '``llvm.mem.parallel_loop_access``' Metadata
3540 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
3542 The ``llvm.mem.parallel_loop_access`` metadata refers to a loop identifier,
3543 or metadata containing a list of loop identifiers for nested loops.
3544 The metadata is attached to memory accessing instructions and denotes that
3545 no loop carried memory dependence exist between it and other instructions denoted
3546 with the same loop identifier.
3548 Precisely, given two instructions ``m1`` and ``m2`` that both have the
3549 ``llvm.mem.parallel_loop_access`` metadata, with ``L1`` and ``L2`` being the
3550 set of loops associated with that metadata, respectively, then there is no loop
3551 carried dependence between ``m1`` and ``m2`` for loops in both ``L1`` and
3554 As a special case, if all memory accessing instructions in a loop have
3555 ``llvm.mem.parallel_loop_access`` metadata that refers to that loop, then the
3556 loop has no loop carried memory dependences and is considered to be a parallel
3559 Note that if not all memory access instructions have such metadata referring to
3560 the loop, then the loop is considered not being trivially parallel. Additional
3561 memory dependence analysis is required to make that determination. As a fail
3562 safe mechanism, this causes loops that were originally parallel to be considered
3563 sequential (if optimization passes that are unaware of the parallel semantics
3564 insert new memory instructions into the loop body).
3566 Example of a loop that is considered parallel due to its correct use of
3567 both ``llvm.loop`` and ``llvm.mem.parallel_loop_access``
3568 metadata types that refer to the same loop identifier metadata.
3570 .. code-block:: llvm
3574 %val0 = load i32, i32* %arrayidx, !llvm.mem.parallel_loop_access !0
3576 store i32 %val0, i32* %arrayidx1, !llvm.mem.parallel_loop_access !0
3578 br i1 %exitcond, label %for.end, label %for.body, !llvm.loop !0
3584 It is also possible to have nested parallel loops. In that case the
3585 memory accesses refer to a list of loop identifier metadata nodes instead of
3586 the loop identifier metadata node directly:
3588 .. code-block:: llvm
3592 %val1 = load i32, i32* %arrayidx3, !llvm.mem.parallel_loop_access !2
3594 br label %inner.for.body
3598 %val0 = load i32, i32* %arrayidx1, !llvm.mem.parallel_loop_access !0
3600 store i32 %val0, i32* %arrayidx2, !llvm.mem.parallel_loop_access !0
3602 br i1 %exitcond, label %inner.for.end, label %inner.for.body, !llvm.loop !1
3606 store i32 %val1, i32* %arrayidx4, !llvm.mem.parallel_loop_access !2
3608 br i1 %exitcond, label %outer.for.end, label %outer.for.body, !llvm.loop !2
3610 outer.for.end: ; preds = %for.body
3612 !0 = !{!1, !2} ; a list of loop identifiers
3613 !1 = !{!1} ; an identifier for the inner loop
3614 !2 = !{!2} ; an identifier for the outer loop
3619 The ``llvm.bitsets`` global metadata is used to implement
3620 :doc:`bitsets <BitSets>`.
3622 Module Flags Metadata
3623 =====================
3625 Information about the module as a whole is difficult to convey to LLVM's
3626 subsystems. The LLVM IR isn't sufficient to transmit this information.
3627 The ``llvm.module.flags`` named metadata exists in order to facilitate
3628 this. These flags are in the form of key / value pairs --- much like a
3629 dictionary --- making it easy for any subsystem who cares about a flag to
3632 The ``llvm.module.flags`` metadata contains a list of metadata triplets.
3633 Each triplet has the following form:
3635 - The first element is a *behavior* flag, which specifies the behavior
3636 when two (or more) modules are merged together, and it encounters two
3637 (or more) metadata with the same ID. The supported behaviors are
3639 - The second element is a metadata string that is a unique ID for the
3640 metadata. Each module may only have one flag entry for each unique ID (not
3641 including entries with the **Require** behavior).
3642 - The third element is the value of the flag.
3644 When two (or more) modules are merged together, the resulting
3645 ``llvm.module.flags`` metadata is the union of the modules' flags. That is, for
3646 each unique metadata ID string, there will be exactly one entry in the merged
3647 modules ``llvm.module.flags`` metadata table, and the value for that entry will
3648 be determined by the merge behavior flag, as described below. The only exception
3649 is that entries with the *Require* behavior are always preserved.
3651 The following behaviors are supported:
3662 Emits an error if two values disagree, otherwise the resulting value
3663 is that of the operands.
3667 Emits a warning if two values disagree. The result value will be the
3668 operand for the flag from the first module being linked.
3672 Adds a requirement that another module flag be present and have a
3673 specified value after linking is performed. The value must be a
3674 metadata pair, where the first element of the pair is the ID of the
3675 module flag to be restricted, and the second element of the pair is
3676 the value the module flag should be restricted to. This behavior can
3677 be used to restrict the allowable results (via triggering of an
3678 error) of linking IDs with the **Override** behavior.
3682 Uses the specified value, regardless of the behavior or value of the
3683 other module. If both modules specify **Override**, but the values
3684 differ, an error will be emitted.
3688 Appends the two values, which are required to be metadata nodes.
3692 Appends the two values, which are required to be metadata
3693 nodes. However, duplicate entries in the second list are dropped
3694 during the append operation.
3696 It is an error for a particular unique flag ID to have multiple behaviors,
3697 except in the case of **Require** (which adds restrictions on another metadata
3698 value) or **Override**.
3700 An example of module flags:
3702 .. code-block:: llvm
3704 !0 = !{ i32 1, !"foo", i32 1 }
3705 !1 = !{ i32 4, !"bar", i32 37 }
3706 !2 = !{ i32 2, !"qux", i32 42 }
3707 !3 = !{ i32 3, !"qux",
3712 !llvm.module.flags = !{ !0, !1, !2, !3 }
3714 - Metadata ``!0`` has the ID ``!"foo"`` and the value '1'. The behavior
3715 if two or more ``!"foo"`` flags are seen is to emit an error if their
3716 values are not equal.
3718 - Metadata ``!1`` has the ID ``!"bar"`` and the value '37'. The
3719 behavior if two or more ``!"bar"`` flags are seen is to use the value
3722 - Metadata ``!2`` has the ID ``!"qux"`` and the value '42'. The
3723 behavior if two or more ``!"qux"`` flags are seen is to emit a
3724 warning if their values are not equal.
3726 - Metadata ``!3`` has the ID ``!"qux"`` and the value:
3732 The behavior is to emit an error if the ``llvm.module.flags`` does not
3733 contain a flag with the ID ``!"foo"`` that has the value '1' after linking is
3736 Objective-C Garbage Collection Module Flags Metadata
3737 ----------------------------------------------------
3739 On the Mach-O platform, Objective-C stores metadata about garbage
3740 collection in a special section called "image info". The metadata
3741 consists of a version number and a bitmask specifying what types of
3742 garbage collection are supported (if any) by the file. If two or more
3743 modules are linked together their garbage collection metadata needs to
3744 be merged rather than appended together.
3746 The Objective-C garbage collection module flags metadata consists of the
3747 following key-value pairs:
3756 * - ``Objective-C Version``
3757 - **[Required]** --- The Objective-C ABI version. Valid values are 1 and 2.
3759 * - ``Objective-C Image Info Version``
3760 - **[Required]** --- The version of the image info section. Currently
3763 * - ``Objective-C Image Info Section``
3764 - **[Required]** --- The section to place the metadata. Valid values are
3765 ``"__OBJC, __image_info, regular"`` for Objective-C ABI version 1, and
3766 ``"__DATA,__objc_imageinfo, regular, no_dead_strip"`` for
3767 Objective-C ABI version 2.
3769 * - ``Objective-C Garbage Collection``
3770 - **[Required]** --- Specifies whether garbage collection is supported or
3771 not. Valid values are 0, for no garbage collection, and 2, for garbage
3772 collection supported.
3774 * - ``Objective-C GC Only``
3775 - **[Optional]** --- Specifies that only garbage collection is supported.
3776 If present, its value must be 6. This flag requires that the
3777 ``Objective-C Garbage Collection`` flag have the value 2.
3779 Some important flag interactions:
3781 - If a module with ``Objective-C Garbage Collection`` set to 0 is
3782 merged with a module with ``Objective-C Garbage Collection`` set to
3783 2, then the resulting module has the
3784 ``Objective-C Garbage Collection`` flag set to 0.
3785 - A module with ``Objective-C Garbage Collection`` set to 0 cannot be
3786 merged with a module with ``Objective-C GC Only`` set to 6.
3788 Automatic Linker Flags Module Flags Metadata
3789 --------------------------------------------
3791 Some targets support embedding flags to the linker inside individual object
3792 files. Typically this is used in conjunction with language extensions which
3793 allow source files to explicitly declare the libraries they depend on, and have
3794 these automatically be transmitted to the linker via object files.
3796 These flags are encoded in the IR using metadata in the module flags section,
3797 using the ``Linker Options`` key. The merge behavior for this flag is required
3798 to be ``AppendUnique``, and the value for the key is expected to be a metadata
3799 node which should be a list of other metadata nodes, each of which should be a
3800 list of metadata strings defining linker options.
3802 For example, the following metadata section specifies two separate sets of
3803 linker options, presumably to link against ``libz`` and the ``Cocoa``
3806 !0 = !{ i32 6, !"Linker Options",
3809 !{ !"-framework", !"Cocoa" } } }
3810 !llvm.module.flags = !{ !0 }
3812 The metadata encoding as lists of lists of options, as opposed to a collapsed
3813 list of options, is chosen so that the IR encoding can use multiple option
3814 strings to specify e.g., a single library, while still having that specifier be
3815 preserved as an atomic element that can be recognized by a target specific
3816 assembly writer or object file emitter.
3818 Each individual option is required to be either a valid option for the target's
3819 linker, or an option that is reserved by the target specific assembly writer or
3820 object file emitter. No other aspect of these options is defined by the IR.
3822 C type width Module Flags Metadata
3823 ----------------------------------
3825 The ARM backend emits a section into each generated object file describing the
3826 options that it was compiled with (in a compiler-independent way) to prevent
3827 linking incompatible objects, and to allow automatic library selection. Some
3828 of these options are not visible at the IR level, namely wchar_t width and enum
3831 To pass this information to the backend, these options are encoded in module
3832 flags metadata, using the following key-value pairs:
3842 - * 0 --- sizeof(wchar_t) == 4
3843 * 1 --- sizeof(wchar_t) == 2
3846 - * 0 --- Enums are at least as large as an ``int``.
3847 * 1 --- Enums are stored in the smallest integer type which can
3848 represent all of its values.
3850 For example, the following metadata section specifies that the module was
3851 compiled with a ``wchar_t`` width of 4 bytes, and the underlying type of an
3852 enum is the smallest type which can represent all of its values::
3854 !llvm.module.flags = !{!0, !1}
3855 !0 = !{i32 1, !"short_wchar", i32 1}
3856 !1 = !{i32 1, !"short_enum", i32 0}
3858 .. _intrinsicglobalvariables:
3860 Intrinsic Global Variables
3861 ==========================
3863 LLVM has a number of "magic" global variables that contain data that
3864 affect code generation or other IR semantics. These are documented here.
3865 All globals of this sort should have a section specified as
3866 "``llvm.metadata``". This section and all globals that start with
3867 "``llvm.``" are reserved for use by LLVM.
3871 The '``llvm.used``' Global Variable
3872 -----------------------------------
3874 The ``@llvm.used`` global is an array which has
3875 :ref:`appending linkage <linkage_appending>`. This array contains a list of
3876 pointers to named global variables, functions and aliases which may optionally
3877 have a pointer cast formed of bitcast or getelementptr. For example, a legal
3880 .. code-block:: llvm
3885 @llvm.used = appending global [2 x i8*] [
3887 i8* bitcast (i32* @Y to i8*)
3888 ], section "llvm.metadata"
3890 If a symbol appears in the ``@llvm.used`` list, then the compiler, assembler,
3891 and linker are required to treat the symbol as if there is a reference to the
3892 symbol that it cannot see (which is why they have to be named). For example, if
3893 a variable has internal linkage and no references other than that from the
3894 ``@llvm.used`` list, it cannot be deleted. This is commonly used to represent
3895 references from inline asms and other things the compiler cannot "see", and
3896 corresponds to "``attribute((used))``" in GNU C.
3898 On some targets, the code generator must emit a directive to the
3899 assembler or object file to prevent the assembler and linker from
3900 molesting the symbol.
3902 .. _gv_llvmcompilerused:
3904 The '``llvm.compiler.used``' Global Variable
3905 --------------------------------------------
3907 The ``@llvm.compiler.used`` directive is the same as the ``@llvm.used``
3908 directive, except that it only prevents the compiler from touching the
3909 symbol. On targets that support it, this allows an intelligent linker to
3910 optimize references to the symbol without being impeded as it would be
3913 This is a rare construct that should only be used in rare circumstances,
3914 and should not be exposed to source languages.
3916 .. _gv_llvmglobalctors:
3918 The '``llvm.global_ctors``' Global Variable
3919 -------------------------------------------
3921 .. code-block:: llvm
3923 %0 = type { i32, void ()*, i8* }
3924 @llvm.global_ctors = appending global [1 x %0] [%0 { i32 65535, void ()* @ctor, i8* @data }]
3926 The ``@llvm.global_ctors`` array contains a list of constructor
3927 functions, priorities, and an optional associated global or function.
3928 The functions referenced by this array will be called in ascending order
3929 of priority (i.e. lowest first) when the module is loaded. The order of
3930 functions with the same priority is not defined.
3932 If the third field is present, non-null, and points to a global variable
3933 or function, the initializer function will only run if the associated
3934 data from the current module is not discarded.
3936 .. _llvmglobaldtors:
3938 The '``llvm.global_dtors``' Global Variable
3939 -------------------------------------------
3941 .. code-block:: llvm
3943 %0 = type { i32, void ()*, i8* }
3944 @llvm.global_dtors = appending global [1 x %0] [%0 { i32 65535, void ()* @dtor, i8* @data }]
3946 The ``@llvm.global_dtors`` array contains a list of destructor
3947 functions, priorities, and an optional associated global or function.
3948 The functions referenced by this array will be called in descending
3949 order of priority (i.e. highest first) when the module is unloaded. The
3950 order of functions with the same priority is not defined.
3952 If the third field is present, non-null, and points to a global variable
3953 or function, the destructor function will only run if the associated
3954 data from the current module is not discarded.
3956 Instruction Reference
3957 =====================
3959 The LLVM instruction set consists of several different classifications
3960 of instructions: :ref:`terminator instructions <terminators>`, :ref:`binary
3961 instructions <binaryops>`, :ref:`bitwise binary
3962 instructions <bitwiseops>`, :ref:`memory instructions <memoryops>`, and
3963 :ref:`other instructions <otherops>`.
3967 Terminator Instructions
3968 -----------------------
3970 As mentioned :ref:`previously <functionstructure>`, every basic block in a
3971 program ends with a "Terminator" instruction, which indicates which
3972 block should be executed after the current block is finished. These
3973 terminator instructions typically yield a '``void``' value: they produce
3974 control flow, not values (the one exception being the
3975 ':ref:`invoke <i_invoke>`' instruction).
3977 The terminator instructions are: ':ref:`ret <i_ret>`',
3978 ':ref:`br <i_br>`', ':ref:`switch <i_switch>`',
3979 ':ref:`indirectbr <i_indirectbr>`', ':ref:`invoke <i_invoke>`',
3980 ':ref:`resume <i_resume>`', and ':ref:`unreachable <i_unreachable>`'.
3984 '``ret``' Instruction
3985 ^^^^^^^^^^^^^^^^^^^^^
3992 ret <type> <value> ; Return a value from a non-void function
3993 ret void ; Return from void function
3998 The '``ret``' instruction is used to return control flow (and optionally
3999 a value) from a function back to the caller.
4001 There are two forms of the '``ret``' instruction: one that returns a
4002 value and then causes control flow, and one that just causes control
4008 The '``ret``' instruction optionally accepts a single argument, the
4009 return value. The type of the return value must be a ':ref:`first
4010 class <t_firstclass>`' type.
4012 A function is not :ref:`well formed <wellformed>` if it it has a non-void
4013 return type and contains a '``ret``' instruction with no return value or
4014 a return value with a type that does not match its type, or if it has a
4015 void return type and contains a '``ret``' instruction with a return
4021 When the '``ret``' instruction is executed, control flow returns back to
4022 the calling function's context. If the caller is a
4023 ":ref:`call <i_call>`" instruction, execution continues at the
4024 instruction after the call. If the caller was an
4025 ":ref:`invoke <i_invoke>`" instruction, execution continues at the
4026 beginning of the "normal" destination block. If the instruction returns
4027 a value, that value shall set the call or invoke instruction's return
4033 .. code-block:: llvm
4035 ret i32 5 ; Return an integer value of 5
4036 ret void ; Return from a void function
4037 ret { i32, i8 } { i32 4, i8 2 } ; Return a struct of values 4 and 2
4041 '``br``' Instruction
4042 ^^^^^^^^^^^^^^^^^^^^
4049 br i1 <cond>, label <iftrue>, label <iffalse>
4050 br label <dest> ; Unconditional branch
4055 The '``br``' instruction is used to cause control flow to transfer to a
4056 different basic block in the current function. There are two forms of
4057 this instruction, corresponding to a conditional branch and an
4058 unconditional branch.
4063 The conditional branch form of the '``br``' instruction takes a single
4064 '``i1``' value and two '``label``' values. The unconditional form of the
4065 '``br``' instruction takes a single '``label``' value as a target.
4070 Upon execution of a conditional '``br``' instruction, the '``i1``'
4071 argument is evaluated. If the value is ``true``, control flows to the
4072 '``iftrue``' ``label`` argument. If "cond" is ``false``, control flows
4073 to the '``iffalse``' ``label`` argument.
4078 .. code-block:: llvm
4081 %cond = icmp eq i32 %a, %b
4082 br i1 %cond, label %IfEqual, label %IfUnequal
4090 '``switch``' Instruction
4091 ^^^^^^^^^^^^^^^^^^^^^^^^
4098 switch <intty> <value>, label <defaultdest> [ <intty> <val>, label <dest> ... ]
4103 The '``switch``' instruction is used to transfer control flow to one of
4104 several different places. It is a generalization of the '``br``'
4105 instruction, allowing a branch to occur to one of many possible
4111 The '``switch``' instruction uses three parameters: an integer
4112 comparison value '``value``', a default '``label``' destination, and an
4113 array of pairs of comparison value constants and '``label``'s. The table
4114 is not allowed to contain duplicate constant entries.
4119 The ``switch`` instruction specifies a table of values and destinations.
4120 When the '``switch``' instruction is executed, this table is searched
4121 for the given value. If the value is found, control flow is transferred
4122 to the corresponding destination; otherwise, control flow is transferred
4123 to the default destination.
4128 Depending on properties of the target machine and the particular
4129 ``switch`` instruction, this instruction may be code generated in
4130 different ways. For example, it could be generated as a series of
4131 chained conditional branches or with a lookup table.
4136 .. code-block:: llvm
4138 ; Emulate a conditional br instruction
4139 %Val = zext i1 %value to i32
4140 switch i32 %Val, label %truedest [ i32 0, label %falsedest ]
4142 ; Emulate an unconditional br instruction
4143 switch i32 0, label %dest [ ]
4145 ; Implement a jump table:
4146 switch i32 %val, label %otherwise [ i32 0, label %onzero
4148 i32 2, label %ontwo ]
4152 '``indirectbr``' Instruction
4153 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
4160 indirectbr <somety>* <address>, [ label <dest1>, label <dest2>, ... ]
4165 The '``indirectbr``' instruction implements an indirect branch to a
4166 label within the current function, whose address is specified by
4167 "``address``". Address must be derived from a
4168 :ref:`blockaddress <blockaddress>` constant.
4173 The '``address``' argument is the address of the label to jump to. The
4174 rest of the arguments indicate the full set of possible destinations
4175 that the address may point to. Blocks are allowed to occur multiple
4176 times in the destination list, though this isn't particularly useful.
4178 This destination list is required so that dataflow analysis has an
4179 accurate understanding of the CFG.
4184 Control transfers to the block specified in the address argument. All
4185 possible destination blocks must be listed in the label list, otherwise
4186 this instruction has undefined behavior. This implies that jumps to
4187 labels defined in other functions have undefined behavior as well.
4192 This is typically implemented with a jump through a register.
4197 .. code-block:: llvm
4199 indirectbr i8* %Addr, [ label %bb1, label %bb2, label %bb3 ]
4203 '``invoke``' Instruction
4204 ^^^^^^^^^^^^^^^^^^^^^^^^
4211 <result> = invoke [cconv] [ret attrs] <ptr to function ty> <function ptr val>(<function args>) [fn attrs]
4212 to label <normal label> unwind label <exception label>
4217 The '``invoke``' instruction causes control to transfer to a specified
4218 function, with the possibility of control flow transfer to either the
4219 '``normal``' label or the '``exception``' label. If the callee function
4220 returns with the "``ret``" instruction, control flow will return to the
4221 "normal" label. If the callee (or any indirect callees) returns via the
4222 ":ref:`resume <i_resume>`" instruction or other exception handling
4223 mechanism, control is interrupted and continued at the dynamically
4224 nearest "exception" label.
4226 The '``exception``' label is a `landing
4227 pad <ExceptionHandling.html#overview>`_ for the exception. As such,
4228 '``exception``' label is required to have the
4229 ":ref:`landingpad <i_landingpad>`" instruction, which contains the
4230 information about the behavior of the program after unwinding happens,
4231 as its first non-PHI instruction. The restrictions on the
4232 "``landingpad``" instruction's tightly couples it to the "``invoke``"
4233 instruction, so that the important information contained within the
4234 "``landingpad``" instruction can't be lost through normal code motion.
4239 This instruction requires several arguments:
4241 #. The optional "cconv" marker indicates which :ref:`calling
4242 convention <callingconv>` the call should use. If none is
4243 specified, the call defaults to using C calling conventions.
4244 #. The optional :ref:`Parameter Attributes <paramattrs>` list for return
4245 values. Only '``zeroext``', '``signext``', and '``inreg``' attributes
4247 #. '``ptr to function ty``': shall be the signature of the pointer to
4248 function value being invoked. In most cases, this is a direct
4249 function invocation, but indirect ``invoke``'s are just as possible,
4250 branching off an arbitrary pointer to function value.
4251 #. '``function ptr val``': An LLVM value containing a pointer to a
4252 function to be invoked.
4253 #. '``function args``': argument list whose types match the function
4254 signature argument types and parameter attributes. All arguments must
4255 be of :ref:`first class <t_firstclass>` type. If the function signature
4256 indicates the function accepts a variable number of arguments, the
4257 extra arguments can be specified.
4258 #. '``normal label``': the label reached when the called function
4259 executes a '``ret``' instruction.
4260 #. '``exception label``': the label reached when a callee returns via
4261 the :ref:`resume <i_resume>` instruction or other exception handling
4263 #. The optional :ref:`function attributes <fnattrs>` list. Only
4264 '``noreturn``', '``nounwind``', '``readonly``' and '``readnone``'
4265 attributes are valid here.
4270 This instruction is designed to operate as a standard '``call``'
4271 instruction in most regards. The primary difference is that it
4272 establishes an association with a label, which is used by the runtime
4273 library to unwind the stack.
4275 This instruction is used in languages with destructors to ensure that
4276 proper cleanup is performed in the case of either a ``longjmp`` or a
4277 thrown exception. Additionally, this is important for implementation of
4278 '``catch``' clauses in high-level languages that support them.
4280 For the purposes of the SSA form, the definition of the value returned
4281 by the '``invoke``' instruction is deemed to occur on the edge from the
4282 current block to the "normal" label. If the callee unwinds then no
4283 return value is available.
4288 .. code-block:: llvm
4290 %retval = invoke i32 @Test(i32 15) to label %Continue
4291 unwind label %TestCleanup ; i32:retval set
4292 %retval = invoke coldcc i32 %Testfnptr(i32 15) to label %Continue
4293 unwind label %TestCleanup ; i32:retval set
4297 '``resume``' Instruction
4298 ^^^^^^^^^^^^^^^^^^^^^^^^
4305 resume <type> <value>
4310 The '``resume``' instruction is a terminator instruction that has no
4316 The '``resume``' instruction requires one argument, which must have the
4317 same type as the result of any '``landingpad``' instruction in the same
4323 The '``resume``' instruction resumes propagation of an existing
4324 (in-flight) exception whose unwinding was interrupted with a
4325 :ref:`landingpad <i_landingpad>` instruction.
4330 .. code-block:: llvm
4332 resume { i8*, i32 } %exn
4336 '``unreachable``' Instruction
4337 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
4349 The '``unreachable``' instruction has no defined semantics. This
4350 instruction is used to inform the optimizer that a particular portion of
4351 the code is not reachable. This can be used to indicate that the code
4352 after a no-return function cannot be reached, and other facts.
4357 The '``unreachable``' instruction has no defined semantics.
4364 Binary operators are used to do most of the computation in a program.
4365 They require two operands of the same type, execute an operation on
4366 them, and produce a single value. The operands might represent multiple
4367 data, as is the case with the :ref:`vector <t_vector>` data type. The
4368 result value has the same type as its operands.
4370 There are several different binary operators:
4374 '``add``' Instruction
4375 ^^^^^^^^^^^^^^^^^^^^^
4382 <result> = add <ty> <op1>, <op2> ; yields ty:result
4383 <result> = add nuw <ty> <op1>, <op2> ; yields ty:result
4384 <result> = add nsw <ty> <op1>, <op2> ; yields ty:result
4385 <result> = add nuw nsw <ty> <op1>, <op2> ; yields ty:result
4390 The '``add``' instruction returns the sum of its two operands.
4395 The two arguments to the '``add``' instruction must be
4396 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer values. Both
4397 arguments must have identical types.
4402 The value produced is the integer sum of the two operands.
4404 If the sum has unsigned overflow, the result returned is the
4405 mathematical result modulo 2\ :sup:`n`\ , where n is the bit width of
4408 Because LLVM integers use a two's complement representation, this
4409 instruction is appropriate for both signed and unsigned integers.
4411 ``nuw`` and ``nsw`` stand for "No Unsigned Wrap" and "No Signed Wrap",
4412 respectively. If the ``nuw`` and/or ``nsw`` keywords are present, the
4413 result value of the ``add`` is a :ref:`poison value <poisonvalues>` if
4414 unsigned and/or signed overflow, respectively, occurs.
4419 .. code-block:: llvm
4421 <result> = add i32 4, %var ; yields i32:result = 4 + %var
4425 '``fadd``' Instruction
4426 ^^^^^^^^^^^^^^^^^^^^^^
4433 <result> = fadd [fast-math flags]* <ty> <op1>, <op2> ; yields ty:result
4438 The '``fadd``' instruction returns the sum of its two operands.
4443 The two arguments to the '``fadd``' instruction must be :ref:`floating
4444 point <t_floating>` or :ref:`vector <t_vector>` of floating point values.
4445 Both arguments must have identical types.
4450 The value produced is the floating point sum of the two operands. This
4451 instruction can also take any number of :ref:`fast-math flags <fastmath>`,
4452 which are optimization hints to enable otherwise unsafe floating point
4458 .. code-block:: llvm
4460 <result> = fadd float 4.0, %var ; yields float:result = 4.0 + %var
4462 '``sub``' Instruction
4463 ^^^^^^^^^^^^^^^^^^^^^
4470 <result> = sub <ty> <op1>, <op2> ; yields ty:result
4471 <result> = sub nuw <ty> <op1>, <op2> ; yields ty:result
4472 <result> = sub nsw <ty> <op1>, <op2> ; yields ty:result
4473 <result> = sub nuw nsw <ty> <op1>, <op2> ; yields ty:result
4478 The '``sub``' instruction returns the difference of its two operands.
4480 Note that the '``sub``' instruction is used to represent the '``neg``'
4481 instruction present in most other intermediate representations.
4486 The two arguments to the '``sub``' instruction must be
4487 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer values. Both
4488 arguments must have identical types.
4493 The value produced is the integer difference of the two operands.
4495 If the difference has unsigned overflow, the result returned is the
4496 mathematical result modulo 2\ :sup:`n`\ , where n is the bit width of
4499 Because LLVM integers use a two's complement representation, this
4500 instruction is appropriate for both signed and unsigned integers.
4502 ``nuw`` and ``nsw`` stand for "No Unsigned Wrap" and "No Signed Wrap",
4503 respectively. If the ``nuw`` and/or ``nsw`` keywords are present, the
4504 result value of the ``sub`` is a :ref:`poison value <poisonvalues>` if
4505 unsigned and/or signed overflow, respectively, occurs.
4510 .. code-block:: llvm
4512 <result> = sub i32 4, %var ; yields i32:result = 4 - %var
4513 <result> = sub i32 0, %val ; yields i32:result = -%var
4517 '``fsub``' Instruction
4518 ^^^^^^^^^^^^^^^^^^^^^^
4525 <result> = fsub [fast-math flags]* <ty> <op1>, <op2> ; yields ty:result
4530 The '``fsub``' instruction returns the difference of its two operands.
4532 Note that the '``fsub``' instruction is used to represent the '``fneg``'
4533 instruction present in most other intermediate representations.
4538 The two arguments to the '``fsub``' instruction must be :ref:`floating
4539 point <t_floating>` or :ref:`vector <t_vector>` of floating point values.
4540 Both arguments must have identical types.
4545 The value produced is the floating point difference of the two operands.
4546 This instruction can also take any number of :ref:`fast-math
4547 flags <fastmath>`, which are optimization hints to enable otherwise
4548 unsafe floating point optimizations:
4553 .. code-block:: llvm
4555 <result> = fsub float 4.0, %var ; yields float:result = 4.0 - %var
4556 <result> = fsub float -0.0, %val ; yields float:result = -%var
4558 '``mul``' Instruction
4559 ^^^^^^^^^^^^^^^^^^^^^
4566 <result> = mul <ty> <op1>, <op2> ; yields ty:result
4567 <result> = mul nuw <ty> <op1>, <op2> ; yields ty:result
4568 <result> = mul nsw <ty> <op1>, <op2> ; yields ty:result
4569 <result> = mul nuw nsw <ty> <op1>, <op2> ; yields ty:result
4574 The '``mul``' instruction returns the product of its two operands.
4579 The two arguments to the '``mul``' instruction must be
4580 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer values. Both
4581 arguments must have identical types.
4586 The value produced is the integer product of the two operands.
4588 If the result of the multiplication has unsigned overflow, the result
4589 returned is the mathematical result modulo 2\ :sup:`n`\ , where n is the
4590 bit width of the result.
4592 Because LLVM integers use a two's complement representation, and the
4593 result is the same width as the operands, this instruction returns the
4594 correct result for both signed and unsigned integers. If a full product
4595 (e.g. ``i32`` * ``i32`` -> ``i64``) is needed, the operands should be
4596 sign-extended or zero-extended as appropriate to the width of the full
4599 ``nuw`` and ``nsw`` stand for "No Unsigned Wrap" and "No Signed Wrap",
4600 respectively. If the ``nuw`` and/or ``nsw`` keywords are present, the
4601 result value of the ``mul`` is a :ref:`poison value <poisonvalues>` if
4602 unsigned and/or signed overflow, respectively, occurs.
4607 .. code-block:: llvm
4609 <result> = mul i32 4, %var ; yields i32:result = 4 * %var
4613 '``fmul``' Instruction
4614 ^^^^^^^^^^^^^^^^^^^^^^
4621 <result> = fmul [fast-math flags]* <ty> <op1>, <op2> ; yields ty:result
4626 The '``fmul``' instruction returns the product of its two operands.
4631 The two arguments to the '``fmul``' instruction must be :ref:`floating
4632 point <t_floating>` or :ref:`vector <t_vector>` of floating point values.
4633 Both arguments must have identical types.
4638 The value produced is the floating point product of the two operands.
4639 This instruction can also take any number of :ref:`fast-math
4640 flags <fastmath>`, which are optimization hints to enable otherwise
4641 unsafe floating point optimizations:
4646 .. code-block:: llvm
4648 <result> = fmul float 4.0, %var ; yields float:result = 4.0 * %var
4650 '``udiv``' Instruction
4651 ^^^^^^^^^^^^^^^^^^^^^^
4658 <result> = udiv <ty> <op1>, <op2> ; yields ty:result
4659 <result> = udiv exact <ty> <op1>, <op2> ; yields ty:result
4664 The '``udiv``' instruction returns the quotient of its two operands.
4669 The two arguments to the '``udiv``' instruction must be
4670 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer values. Both
4671 arguments must have identical types.
4676 The value produced is the unsigned integer quotient of the two operands.
4678 Note that unsigned integer division and signed integer division are
4679 distinct operations; for signed integer division, use '``sdiv``'.
4681 Division by zero leads to undefined behavior.
4683 If the ``exact`` keyword is present, the result value of the ``udiv`` is
4684 a :ref:`poison value <poisonvalues>` if %op1 is not a multiple of %op2 (as
4685 such, "((a udiv exact b) mul b) == a").
4690 .. code-block:: llvm
4692 <result> = udiv i32 4, %var ; yields i32:result = 4 / %var
4694 '``sdiv``' Instruction
4695 ^^^^^^^^^^^^^^^^^^^^^^
4702 <result> = sdiv <ty> <op1>, <op2> ; yields ty:result
4703 <result> = sdiv exact <ty> <op1>, <op2> ; yields ty:result
4708 The '``sdiv``' instruction returns the quotient of its two operands.
4713 The two arguments to the '``sdiv``' instruction must be
4714 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer values. Both
4715 arguments must have identical types.
4720 The value produced is the signed integer quotient of the two operands
4721 rounded towards zero.
4723 Note that signed integer division and unsigned integer division are
4724 distinct operations; for unsigned integer division, use '``udiv``'.
4726 Division by zero leads to undefined behavior. Overflow also leads to
4727 undefined behavior; this is a rare case, but can occur, for example, by
4728 doing a 32-bit division of -2147483648 by -1.
4730 If the ``exact`` keyword is present, the result value of the ``sdiv`` is
4731 a :ref:`poison value <poisonvalues>` if the result would be rounded.
4736 .. code-block:: llvm
4738 <result> = sdiv i32 4, %var ; yields i32:result = 4 / %var
4742 '``fdiv``' Instruction
4743 ^^^^^^^^^^^^^^^^^^^^^^
4750 <result> = fdiv [fast-math flags]* <ty> <op1>, <op2> ; yields ty:result
4755 The '``fdiv``' instruction returns the quotient of its two operands.
4760 The two arguments to the '``fdiv``' instruction must be :ref:`floating
4761 point <t_floating>` or :ref:`vector <t_vector>` of floating point values.
4762 Both arguments must have identical types.
4767 The value produced is the floating point quotient of the two operands.
4768 This instruction can also take any number of :ref:`fast-math
4769 flags <fastmath>`, which are optimization hints to enable otherwise
4770 unsafe floating point optimizations:
4775 .. code-block:: llvm
4777 <result> = fdiv float 4.0, %var ; yields float:result = 4.0 / %var
4779 '``urem``' Instruction
4780 ^^^^^^^^^^^^^^^^^^^^^^
4787 <result> = urem <ty> <op1>, <op2> ; yields ty:result
4792 The '``urem``' instruction returns the remainder from the unsigned
4793 division of its two arguments.
4798 The two arguments to the '``urem``' instruction must be
4799 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer values. Both
4800 arguments must have identical types.
4805 This instruction returns the unsigned integer *remainder* of a division.
4806 This instruction always performs an unsigned division to get the
4809 Note that unsigned integer remainder and signed integer remainder are
4810 distinct operations; for signed integer remainder, use '``srem``'.
4812 Taking the remainder of a division by zero leads to undefined behavior.
4817 .. code-block:: llvm
4819 <result> = urem i32 4, %var ; yields i32:result = 4 % %var
4821 '``srem``' Instruction
4822 ^^^^^^^^^^^^^^^^^^^^^^
4829 <result> = srem <ty> <op1>, <op2> ; yields ty:result
4834 The '``srem``' instruction returns the remainder from the signed
4835 division of its two operands. This instruction can also take
4836 :ref:`vector <t_vector>` versions of the values in which case the elements
4842 The two arguments to the '``srem``' instruction must be
4843 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer values. Both
4844 arguments must have identical types.
4849 This instruction returns the *remainder* of a division (where the result
4850 is either zero or has the same sign as the dividend, ``op1``), not the
4851 *modulo* operator (where the result is either zero or has the same sign
4852 as the divisor, ``op2``) of a value. For more information about the
4853 difference, see `The Math
4854 Forum <http://mathforum.org/dr.math/problems/anne.4.28.99.html>`_. For a
4855 table of how this is implemented in various languages, please see
4857 operation <http://en.wikipedia.org/wiki/Modulo_operation>`_.
4859 Note that signed integer remainder and unsigned integer remainder are
4860 distinct operations; for unsigned integer remainder, use '``urem``'.
4862 Taking the remainder of a division by zero leads to undefined behavior.
4863 Overflow also leads to undefined behavior; this is a rare case, but can
4864 occur, for example, by taking the remainder of a 32-bit division of
4865 -2147483648 by -1. (The remainder doesn't actually overflow, but this
4866 rule lets srem be implemented using instructions that return both the
4867 result of the division and the remainder.)
4872 .. code-block:: llvm
4874 <result> = srem i32 4, %var ; yields i32:result = 4 % %var
4878 '``frem``' Instruction
4879 ^^^^^^^^^^^^^^^^^^^^^^
4886 <result> = frem [fast-math flags]* <ty> <op1>, <op2> ; yields ty:result
4891 The '``frem``' instruction returns the remainder from the division of
4897 The two arguments to the '``frem``' instruction must be :ref:`floating
4898 point <t_floating>` or :ref:`vector <t_vector>` of floating point values.
4899 Both arguments must have identical types.
4904 This instruction returns the *remainder* of a division. The remainder
4905 has the same sign as the dividend. This instruction can also take any
4906 number of :ref:`fast-math flags <fastmath>`, which are optimization hints
4907 to enable otherwise unsafe floating point optimizations:
4912 .. code-block:: llvm
4914 <result> = frem float 4.0, %var ; yields float:result = 4.0 % %var
4918 Bitwise Binary Operations
4919 -------------------------
4921 Bitwise binary operators are used to do various forms of bit-twiddling
4922 in a program. They are generally very efficient instructions and can
4923 commonly be strength reduced from other instructions. They require two
4924 operands of the same type, execute an operation on them, and produce a
4925 single value. The resulting value is the same type as its operands.
4927 '``shl``' Instruction
4928 ^^^^^^^^^^^^^^^^^^^^^
4935 <result> = shl <ty> <op1>, <op2> ; yields ty:result
4936 <result> = shl nuw <ty> <op1>, <op2> ; yields ty:result
4937 <result> = shl nsw <ty> <op1>, <op2> ; yields ty:result
4938 <result> = shl nuw nsw <ty> <op1>, <op2> ; yields ty:result
4943 The '``shl``' instruction returns the first operand shifted to the left
4944 a specified number of bits.
4949 Both arguments to the '``shl``' instruction must be the same
4950 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer type.
4951 '``op2``' is treated as an unsigned value.
4956 The value produced is ``op1`` \* 2\ :sup:`op2` mod 2\ :sup:`n`,
4957 where ``n`` is the width of the result. If ``op2`` is (statically or
4958 dynamically) negative or equal to or larger than the number of bits in
4959 ``op1``, the result is undefined. If the arguments are vectors, each
4960 vector element of ``op1`` is shifted by the corresponding shift amount
4963 If the ``nuw`` keyword is present, then the shift produces a :ref:`poison
4964 value <poisonvalues>` if it shifts out any non-zero bits. If the
4965 ``nsw`` keyword is present, then the shift produces a :ref:`poison
4966 value <poisonvalues>` if it shifts out any bits that disagree with the
4967 resultant sign bit. As such, NUW/NSW have the same semantics as they
4968 would if the shift were expressed as a mul instruction with the same
4969 nsw/nuw bits in (mul %op1, (shl 1, %op2)).
4974 .. code-block:: llvm
4976 <result> = shl i32 4, %var ; yields i32: 4 << %var
4977 <result> = shl i32 4, 2 ; yields i32: 16
4978 <result> = shl i32 1, 10 ; yields i32: 1024
4979 <result> = shl i32 1, 32 ; undefined
4980 <result> = shl <2 x i32> < i32 1, i32 1>, < i32 1, i32 2> ; yields: result=<2 x i32> < i32 2, i32 4>
4982 '``lshr``' Instruction
4983 ^^^^^^^^^^^^^^^^^^^^^^
4990 <result> = lshr <ty> <op1>, <op2> ; yields ty:result
4991 <result> = lshr exact <ty> <op1>, <op2> ; yields ty:result
4996 The '``lshr``' instruction (logical shift right) returns the first
4997 operand shifted to the right a specified number of bits with zero fill.
5002 Both arguments to the '``lshr``' instruction must be the same
5003 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer type.
5004 '``op2``' is treated as an unsigned value.
5009 This instruction always performs a logical shift right operation. The
5010 most significant bits of the result will be filled with zero bits after
5011 the shift. If ``op2`` is (statically or dynamically) equal to or larger
5012 than the number of bits in ``op1``, the result is undefined. If the
5013 arguments are vectors, each vector element of ``op1`` is shifted by the
5014 corresponding shift amount in ``op2``.
5016 If the ``exact`` keyword is present, the result value of the ``lshr`` is
5017 a :ref:`poison value <poisonvalues>` if any of the bits shifted out are
5023 .. code-block:: llvm
5025 <result> = lshr i32 4, 1 ; yields i32:result = 2
5026 <result> = lshr i32 4, 2 ; yields i32:result = 1
5027 <result> = lshr i8 4, 3 ; yields i8:result = 0
5028 <result> = lshr i8 -2, 1 ; yields i8:result = 0x7F
5029 <result> = lshr i32 1, 32 ; undefined
5030 <result> = lshr <2 x i32> < i32 -2, i32 4>, < i32 1, i32 2> ; yields: result=<2 x i32> < i32 0x7FFFFFFF, i32 1>
5032 '``ashr``' Instruction
5033 ^^^^^^^^^^^^^^^^^^^^^^
5040 <result> = ashr <ty> <op1>, <op2> ; yields ty:result
5041 <result> = ashr exact <ty> <op1>, <op2> ; yields ty:result
5046 The '``ashr``' instruction (arithmetic shift right) returns the first
5047 operand shifted to the right a specified number of bits with sign
5053 Both arguments to the '``ashr``' instruction must be the same
5054 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer type.
5055 '``op2``' is treated as an unsigned value.
5060 This instruction always performs an arithmetic shift right operation,
5061 The most significant bits of the result will be filled with the sign bit
5062 of ``op1``. If ``op2`` is (statically or dynamically) equal to or larger
5063 than the number of bits in ``op1``, the result is undefined. If the
5064 arguments are vectors, each vector element of ``op1`` is shifted by the
5065 corresponding shift amount in ``op2``.
5067 If the ``exact`` keyword is present, the result value of the ``ashr`` is
5068 a :ref:`poison value <poisonvalues>` if any of the bits shifted out are
5074 .. code-block:: llvm
5076 <result> = ashr i32 4, 1 ; yields i32:result = 2
5077 <result> = ashr i32 4, 2 ; yields i32:result = 1
5078 <result> = ashr i8 4, 3 ; yields i8:result = 0
5079 <result> = ashr i8 -2, 1 ; yields i8:result = -1
5080 <result> = ashr i32 1, 32 ; undefined
5081 <result> = ashr <2 x i32> < i32 -2, i32 4>, < i32 1, i32 3> ; yields: result=<2 x i32> < i32 -1, i32 0>
5083 '``and``' Instruction
5084 ^^^^^^^^^^^^^^^^^^^^^
5091 <result> = and <ty> <op1>, <op2> ; yields ty:result
5096 The '``and``' instruction returns the bitwise logical and of its two
5102 The two arguments to the '``and``' instruction must be
5103 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer values. Both
5104 arguments must have identical types.
5109 The truth table used for the '``and``' instruction is:
5126 .. code-block:: llvm
5128 <result> = and i32 4, %var ; yields i32:result = 4 & %var
5129 <result> = and i32 15, 40 ; yields i32:result = 8
5130 <result> = and i32 4, 8 ; yields i32:result = 0
5132 '``or``' Instruction
5133 ^^^^^^^^^^^^^^^^^^^^
5140 <result> = or <ty> <op1>, <op2> ; yields ty:result
5145 The '``or``' instruction returns the bitwise logical inclusive or of its
5151 The two arguments to the '``or``' instruction must be
5152 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer values. Both
5153 arguments must have identical types.
5158 The truth table used for the '``or``' instruction is:
5177 <result> = or i32 4, %var ; yields i32:result = 4 | %var
5178 <result> = or i32 15, 40 ; yields i32:result = 47
5179 <result> = or i32 4, 8 ; yields i32:result = 12
5181 '``xor``' Instruction
5182 ^^^^^^^^^^^^^^^^^^^^^
5189 <result> = xor <ty> <op1>, <op2> ; yields ty:result
5194 The '``xor``' instruction returns the bitwise logical exclusive or of
5195 its two operands. The ``xor`` is used to implement the "one's
5196 complement" operation, which is the "~" operator in C.
5201 The two arguments to the '``xor``' instruction must be
5202 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer values. Both
5203 arguments must have identical types.
5208 The truth table used for the '``xor``' instruction is:
5225 .. code-block:: llvm
5227 <result> = xor i32 4, %var ; yields i32:result = 4 ^ %var
5228 <result> = xor i32 15, 40 ; yields i32:result = 39
5229 <result> = xor i32 4, 8 ; yields i32:result = 12
5230 <result> = xor i32 %V, -1 ; yields i32:result = ~%V
5235 LLVM supports several instructions to represent vector operations in a
5236 target-independent manner. These instructions cover the element-access
5237 and vector-specific operations needed to process vectors effectively.
5238 While LLVM does directly support these vector operations, many
5239 sophisticated algorithms will want to use target-specific intrinsics to
5240 take full advantage of a specific target.
5242 .. _i_extractelement:
5244 '``extractelement``' Instruction
5245 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
5252 <result> = extractelement <n x <ty>> <val>, <ty2> <idx> ; yields <ty>
5257 The '``extractelement``' instruction extracts a single scalar element
5258 from a vector at a specified index.
5263 The first operand of an '``extractelement``' instruction is a value of
5264 :ref:`vector <t_vector>` type. The second operand is an index indicating
5265 the position from which to extract the element. The index may be a
5266 variable of any integer type.
5271 The result is a scalar of the same type as the element type of ``val``.
5272 Its value is the value at position ``idx`` of ``val``. If ``idx``
5273 exceeds the length of ``val``, the results are undefined.
5278 .. code-block:: llvm
5280 <result> = extractelement <4 x i32> %vec, i32 0 ; yields i32
5282 .. _i_insertelement:
5284 '``insertelement``' Instruction
5285 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
5292 <result> = insertelement <n x <ty>> <val>, <ty> <elt>, <ty2> <idx> ; yields <n x <ty>>
5297 The '``insertelement``' instruction inserts a scalar element into a
5298 vector at a specified index.
5303 The first operand of an '``insertelement``' instruction is a value of
5304 :ref:`vector <t_vector>` type. The second operand is a scalar value whose
5305 type must equal the element type of the first operand. The third operand
5306 is an index indicating the position at which to insert the value. The
5307 index may be a variable of any integer type.
5312 The result is a vector of the same type as ``val``. Its element values
5313 are those of ``val`` except at position ``idx``, where it gets the value
5314 ``elt``. If ``idx`` exceeds the length of ``val``, the results are
5320 .. code-block:: llvm
5322 <result> = insertelement <4 x i32> %vec, i32 1, i32 0 ; yields <4 x i32>
5324 .. _i_shufflevector:
5326 '``shufflevector``' Instruction
5327 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
5334 <result> = shufflevector <n x <ty>> <v1>, <n x <ty>> <v2>, <m x i32> <mask> ; yields <m x <ty>>
5339 The '``shufflevector``' instruction constructs a permutation of elements
5340 from two input vectors, returning a vector with the same element type as
5341 the input and length that is the same as the shuffle mask.
5346 The first two operands of a '``shufflevector``' instruction are vectors
5347 with the same type. The third argument is a shuffle mask whose element
5348 type is always 'i32'. The result of the instruction is a vector whose
5349 length is the same as the shuffle mask and whose element type is the
5350 same as the element type of the first two operands.
5352 The shuffle mask operand is required to be a constant vector with either
5353 constant integer or undef values.
5358 The elements of the two input vectors are numbered from left to right
5359 across both of the vectors. The shuffle mask operand specifies, for each
5360 element of the result vector, which element of the two input vectors the
5361 result element gets. The element selector may be undef (meaning "don't
5362 care") and the second operand may be undef if performing a shuffle from
5368 .. code-block:: llvm
5370 <result> = shufflevector <4 x i32> %v1, <4 x i32> %v2,
5371 <4 x i32> <i32 0, i32 4, i32 1, i32 5> ; yields <4 x i32>
5372 <result> = shufflevector <4 x i32> %v1, <4 x i32> undef,
5373 <4 x i32> <i32 0, i32 1, i32 2, i32 3> ; yields <4 x i32> - Identity shuffle.
5374 <result> = shufflevector <8 x i32> %v1, <8 x i32> undef,
5375 <4 x i32> <i32 0, i32 1, i32 2, i32 3> ; yields <4 x i32>
5376 <result> = shufflevector <4 x i32> %v1, <4 x i32> %v2,
5377 <8 x i32> <i32 0, i32 1, i32 2, i32 3, i32 4, i32 5, i32 6, i32 7 > ; yields <8 x i32>
5379 Aggregate Operations
5380 --------------------
5382 LLVM supports several instructions for working with
5383 :ref:`aggregate <t_aggregate>` values.
5387 '``extractvalue``' Instruction
5388 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
5395 <result> = extractvalue <aggregate type> <val>, <idx>{, <idx>}*
5400 The '``extractvalue``' instruction extracts the value of a member field
5401 from an :ref:`aggregate <t_aggregate>` value.
5406 The first operand of an '``extractvalue``' instruction is a value of
5407 :ref:`struct <t_struct>` or :ref:`array <t_array>` type. The operands are
5408 constant indices to specify which value to extract in a similar manner
5409 as indices in a '``getelementptr``' instruction.
5411 The major differences to ``getelementptr`` indexing are:
5413 - Since the value being indexed is not a pointer, the first index is
5414 omitted and assumed to be zero.
5415 - At least one index must be specified.
5416 - Not only struct indices but also array indices must be in bounds.
5421 The result is the value at the position in the aggregate specified by
5427 .. code-block:: llvm
5429 <result> = extractvalue {i32, float} %agg, 0 ; yields i32
5433 '``insertvalue``' Instruction
5434 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
5441 <result> = insertvalue <aggregate type> <val>, <ty> <elt>, <idx>{, <idx>}* ; yields <aggregate type>
5446 The '``insertvalue``' instruction inserts a value into a member field in
5447 an :ref:`aggregate <t_aggregate>` value.
5452 The first operand of an '``insertvalue``' instruction is a value of
5453 :ref:`struct <t_struct>` or :ref:`array <t_array>` type. The second operand is
5454 a first-class value to insert. The following operands are constant
5455 indices indicating the position at which to insert the value in a
5456 similar manner as indices in a '``extractvalue``' instruction. The value
5457 to insert must have the same type as the value identified by the
5463 The result is an aggregate of the same type as ``val``. Its value is
5464 that of ``val`` except that the value at the position specified by the
5465 indices is that of ``elt``.
5470 .. code-block:: llvm
5472 %agg1 = insertvalue {i32, float} undef, i32 1, 0 ; yields {i32 1, float undef}
5473 %agg2 = insertvalue {i32, float} %agg1, float %val, 1 ; yields {i32 1, float %val}
5474 %agg3 = insertvalue {i32, {float}} undef, float %val, 1, 0 ; yields {i32 undef, {float %val}}
5478 Memory Access and Addressing Operations
5479 ---------------------------------------
5481 A key design point of an SSA-based representation is how it represents
5482 memory. In LLVM, no memory locations are in SSA form, which makes things
5483 very simple. This section describes how to read, write, and allocate
5488 '``alloca``' Instruction
5489 ^^^^^^^^^^^^^^^^^^^^^^^^
5496 <result> = alloca [inalloca] <type> [, <ty> <NumElements>] [, align <alignment>] ; yields type*:result
5501 The '``alloca``' instruction allocates memory on the stack frame of the
5502 currently executing function, to be automatically released when this
5503 function returns to its caller. The object is always allocated in the
5504 generic address space (address space zero).
5509 The '``alloca``' instruction allocates ``sizeof(<type>)*NumElements``
5510 bytes of memory on the runtime stack, returning a pointer of the
5511 appropriate type to the program. If "NumElements" is specified, it is
5512 the number of elements allocated, otherwise "NumElements" is defaulted
5513 to be one. If a constant alignment is specified, the value result of the
5514 allocation is guaranteed to be aligned to at least that boundary. The
5515 alignment may not be greater than ``1 << 29``. If not specified, or if
5516 zero, the target can choose to align the allocation on any convenient
5517 boundary compatible with the type.
5519 '``type``' may be any sized type.
5524 Memory is allocated; a pointer is returned. The operation is undefined
5525 if there is insufficient stack space for the allocation. '``alloca``'d
5526 memory is automatically released when the function returns. The
5527 '``alloca``' instruction is commonly used to represent automatic
5528 variables that must have an address available. When the function returns
5529 (either with the ``ret`` or ``resume`` instructions), the memory is
5530 reclaimed. Allocating zero bytes is legal, but the result is undefined.
5531 The order in which memory is allocated (ie., which way the stack grows)
5537 .. code-block:: llvm
5539 %ptr = alloca i32 ; yields i32*:ptr
5540 %ptr = alloca i32, i32 4 ; yields i32*:ptr
5541 %ptr = alloca i32, i32 4, align 1024 ; yields i32*:ptr
5542 %ptr = alloca i32, align 1024 ; yields i32*:ptr
5546 '``load``' Instruction
5547 ^^^^^^^^^^^^^^^^^^^^^^
5554 <result> = load [volatile] <ty>, <ty>* <pointer>[, align <alignment>][, !nontemporal !<index>][, !invariant.load !<index>][, !nonnull !<index>]
5555 <result> = load atomic [volatile] <ty>* <pointer> [singlethread] <ordering>, align <alignment>
5556 !<index> = !{ i32 1 }
5561 The '``load``' instruction is used to read from memory.
5566 The argument to the ``load`` instruction specifies the memory address
5567 from which to load. The type specified must be a :ref:`first
5568 class <t_firstclass>` type. If the ``load`` is marked as ``volatile``,
5569 then the optimizer is not allowed to modify the number or order of
5570 execution of this ``load`` with other :ref:`volatile
5571 operations <volatile>`.
5573 If the ``load`` is marked as ``atomic``, it takes an extra
5574 :ref:`ordering <ordering>` and optional ``singlethread`` argument. The
5575 ``release`` and ``acq_rel`` orderings are not valid on ``load``
5576 instructions. Atomic loads produce :ref:`defined <memmodel>` results
5577 when they may see multiple atomic stores. The type of the pointee must
5578 be an integer type whose bit width is a power of two greater than or
5579 equal to eight and less than or equal to a target-specific size limit.
5580 ``align`` must be explicitly specified on atomic loads, and the load has
5581 undefined behavior if the alignment is not set to a value which is at
5582 least the size in bytes of the pointee. ``!nontemporal`` does not have
5583 any defined semantics for atomic loads.
5585 The optional constant ``align`` argument specifies the alignment of the
5586 operation (that is, the alignment of the memory address). A value of 0
5587 or an omitted ``align`` argument means that the operation has the ABI
5588 alignment for the target. It is the responsibility of the code emitter
5589 to ensure that the alignment information is correct. Overestimating the
5590 alignment results in undefined behavior. Underestimating the alignment
5591 may produce less efficient code. An alignment of 1 is always safe. The
5592 maximum possible alignment is ``1 << 29``.
5594 The optional ``!nontemporal`` metadata must reference a single
5595 metadata name ``<index>`` corresponding to a metadata node with one
5596 ``i32`` entry of value 1. The existence of the ``!nontemporal``
5597 metadata on the instruction tells the optimizer and code generator
5598 that this load is not expected to be reused in the cache. The code
5599 generator may select special instructions to save cache bandwidth, such
5600 as the ``MOVNT`` instruction on x86.
5602 The optional ``!invariant.load`` metadata must reference a single
5603 metadata name ``<index>`` corresponding to a metadata node with no
5604 entries. The existence of the ``!invariant.load`` metadata on the
5605 instruction tells the optimizer and code generator that the address
5606 operand to this load points to memory which can be assumed unchanged.
5607 Being invariant does not imply that a location is dereferenceable,
5608 but it does imply that once the location is known dereferenceable
5609 its value is henceforth unchanging.
5611 The optional ``!nonnull`` metadata must reference a single
5612 metadata name ``<index>`` corresponding to a metadata node with no
5613 entries. The existence of the ``!nonnull`` metadata on the
5614 instruction tells the optimizer that the value loaded is known to
5615 never be null. This is analogous to the ''nonnull'' attribute
5616 on parameters and return values. This metadata can only be applied
5617 to loads of a pointer type.
5622 The location of memory pointed to is loaded. If the value being loaded
5623 is of scalar type then the number of bytes read does not exceed the
5624 minimum number of bytes needed to hold all bits of the type. For
5625 example, loading an ``i24`` reads at most three bytes. When loading a
5626 value of a type like ``i20`` with a size that is not an integral number
5627 of bytes, the result is undefined if the value was not originally
5628 written using a store of the same type.
5633 .. code-block:: llvm
5635 %ptr = alloca i32 ; yields i32*:ptr
5636 store i32 3, i32* %ptr ; yields void
5637 %val = load i32, i32* %ptr ; yields i32:val = i32 3
5641 '``store``' Instruction
5642 ^^^^^^^^^^^^^^^^^^^^^^^
5649 store [volatile] <ty> <value>, <ty>* <pointer>[, align <alignment>][, !nontemporal !<index>] ; yields void
5650 store atomic [volatile] <ty> <value>, <ty>* <pointer> [singlethread] <ordering>, align <alignment> ; yields void
5655 The '``store``' instruction is used to write to memory.
5660 There are two arguments to the ``store`` instruction: a value to store
5661 and an address at which to store it. The type of the ``<pointer>``
5662 operand must be a pointer to the :ref:`first class <t_firstclass>` type of
5663 the ``<value>`` operand. If the ``store`` is marked as ``volatile``,
5664 then the optimizer is not allowed to modify the number or order of
5665 execution of this ``store`` with other :ref:`volatile
5666 operations <volatile>`.
5668 If the ``store`` is marked as ``atomic``, it takes an extra
5669 :ref:`ordering <ordering>` and optional ``singlethread`` argument. The
5670 ``acquire`` and ``acq_rel`` orderings aren't valid on ``store``
5671 instructions. Atomic loads produce :ref:`defined <memmodel>` results
5672 when they may see multiple atomic stores. The type of the pointee must
5673 be an integer type whose bit width is a power of two greater than or
5674 equal to eight and less than or equal to a target-specific size limit.
5675 ``align`` must be explicitly specified on atomic stores, and the store
5676 has undefined behavior if the alignment is not set to a value which is
5677 at least the size in bytes of the pointee. ``!nontemporal`` does not
5678 have any defined semantics for atomic stores.
5680 The optional constant ``align`` argument specifies the alignment of the
5681 operation (that is, the alignment of the memory address). A value of 0
5682 or an omitted ``align`` argument means that the operation has the ABI
5683 alignment for the target. It is the responsibility of the code emitter
5684 to ensure that the alignment information is correct. Overestimating the
5685 alignment results in undefined behavior. Underestimating the
5686 alignment may produce less efficient code. An alignment of 1 is always
5687 safe. The maximum possible alignment is ``1 << 29``.
5689 The optional ``!nontemporal`` metadata must reference a single metadata
5690 name ``<index>`` corresponding to a metadata node with one ``i32`` entry of
5691 value 1. The existence of the ``!nontemporal`` metadata on the instruction
5692 tells the optimizer and code generator that this load is not expected to
5693 be reused in the cache. The code generator may select special
5694 instructions to save cache bandwidth, such as the MOVNT instruction on
5700 The contents of memory are updated to contain ``<value>`` at the
5701 location specified by the ``<pointer>`` operand. If ``<value>`` is
5702 of scalar type then the number of bytes written does not exceed the
5703 minimum number of bytes needed to hold all bits of the type. For
5704 example, storing an ``i24`` writes at most three bytes. When writing a
5705 value of a type like ``i20`` with a size that is not an integral number
5706 of bytes, it is unspecified what happens to the extra bits that do not
5707 belong to the type, but they will typically be overwritten.
5712 .. code-block:: llvm
5714 %ptr = alloca i32 ; yields i32*:ptr
5715 store i32 3, i32* %ptr ; yields void
5716 %val = load i32* %ptr ; yields i32:val = i32 3
5720 '``fence``' Instruction
5721 ^^^^^^^^^^^^^^^^^^^^^^^
5728 fence [singlethread] <ordering> ; yields void
5733 The '``fence``' instruction is used to introduce happens-before edges
5739 '``fence``' instructions take an :ref:`ordering <ordering>` argument which
5740 defines what *synchronizes-with* edges they add. They can only be given
5741 ``acquire``, ``release``, ``acq_rel``, and ``seq_cst`` orderings.
5746 A fence A which has (at least) ``release`` ordering semantics
5747 *synchronizes with* a fence B with (at least) ``acquire`` ordering
5748 semantics if and only if there exist atomic operations X and Y, both
5749 operating on some atomic object M, such that A is sequenced before X, X
5750 modifies M (either directly or through some side effect of a sequence
5751 headed by X), Y is sequenced before B, and Y observes M. This provides a
5752 *happens-before* dependency between A and B. Rather than an explicit
5753 ``fence``, one (but not both) of the atomic operations X or Y might
5754 provide a ``release`` or ``acquire`` (resp.) ordering constraint and
5755 still *synchronize-with* the explicit ``fence`` and establish the
5756 *happens-before* edge.
5758 A ``fence`` which has ``seq_cst`` ordering, in addition to having both
5759 ``acquire`` and ``release`` semantics specified above, participates in
5760 the global program order of other ``seq_cst`` operations and/or fences.
5762 The optional ":ref:`singlethread <singlethread>`" argument specifies
5763 that the fence only synchronizes with other fences in the same thread.
5764 (This is useful for interacting with signal handlers.)
5769 .. code-block:: llvm
5771 fence acquire ; yields void
5772 fence singlethread seq_cst ; yields void
5776 '``cmpxchg``' Instruction
5777 ^^^^^^^^^^^^^^^^^^^^^^^^^
5784 cmpxchg [weak] [volatile] <ty>* <pointer>, <ty> <cmp>, <ty> <new> [singlethread] <success ordering> <failure ordering> ; yields { ty, i1 }
5789 The '``cmpxchg``' instruction is used to atomically modify memory. It
5790 loads a value in memory and compares it to a given value. If they are
5791 equal, it tries to store a new value into the memory.
5796 There are three arguments to the '``cmpxchg``' instruction: an address
5797 to operate on, a value to compare to the value currently be at that
5798 address, and a new value to place at that address if the compared values
5799 are equal. The type of '<cmp>' must be an integer type whose bit width
5800 is a power of two greater than or equal to eight and less than or equal
5801 to a target-specific size limit. '<cmp>' and '<new>' must have the same
5802 type, and the type of '<pointer>' must be a pointer to that type. If the
5803 ``cmpxchg`` is marked as ``volatile``, then the optimizer is not allowed
5804 to modify the number or order of execution of this ``cmpxchg`` with
5805 other :ref:`volatile operations <volatile>`.
5807 The success and failure :ref:`ordering <ordering>` arguments specify how this
5808 ``cmpxchg`` synchronizes with other atomic operations. Both ordering parameters
5809 must be at least ``monotonic``, the ordering constraint on failure must be no
5810 stronger than that on success, and the failure ordering cannot be either
5811 ``release`` or ``acq_rel``.
5813 The optional "``singlethread``" argument declares that the ``cmpxchg``
5814 is only atomic with respect to code (usually signal handlers) running in
5815 the same thread as the ``cmpxchg``. Otherwise the cmpxchg is atomic with
5816 respect to all other code in the system.
5818 The pointer passed into cmpxchg must have alignment greater than or
5819 equal to the size in memory of the operand.
5824 The contents of memory at the location specified by the '``<pointer>``' operand
5825 is read and compared to '``<cmp>``'; if the read value is the equal, the
5826 '``<new>``' is written. The original value at the location is returned, together
5827 with a flag indicating success (true) or failure (false).
5829 If the cmpxchg operation is marked as ``weak`` then a spurious failure is
5830 permitted: the operation may not write ``<new>`` even if the comparison
5833 If the cmpxchg operation is strong (the default), the i1 value is 1 if and only
5834 if the value loaded equals ``cmp``.
5836 A successful ``cmpxchg`` is a read-modify-write instruction for the purpose of
5837 identifying release sequences. A failed ``cmpxchg`` is equivalent to an atomic
5838 load with an ordering parameter determined the second ordering parameter.
5843 .. code-block:: llvm
5846 %orig = atomic load i32, i32* %ptr unordered ; yields i32
5850 %cmp = phi i32 [ %orig, %entry ], [%old, %loop]
5851 %squared = mul i32 %cmp, %cmp
5852 %val_success = cmpxchg i32* %ptr, i32 %cmp, i32 %squared acq_rel monotonic ; yields { i32, i1 }
5853 %value_loaded = extractvalue { i32, i1 } %val_success, 0
5854 %success = extractvalue { i32, i1 } %val_success, 1
5855 br i1 %success, label %done, label %loop
5862 '``atomicrmw``' Instruction
5863 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
5870 atomicrmw [volatile] <operation> <ty>* <pointer>, <ty> <value> [singlethread] <ordering> ; yields ty
5875 The '``atomicrmw``' instruction is used to atomically modify memory.
5880 There are three arguments to the '``atomicrmw``' instruction: an
5881 operation to apply, an address whose value to modify, an argument to the
5882 operation. The operation must be one of the following keywords:
5896 The type of '<value>' must be an integer type whose bit width is a power
5897 of two greater than or equal to eight and less than or equal to a
5898 target-specific size limit. The type of the '``<pointer>``' operand must
5899 be a pointer to that type. If the ``atomicrmw`` is marked as
5900 ``volatile``, then the optimizer is not allowed to modify the number or
5901 order of execution of this ``atomicrmw`` with other :ref:`volatile
5902 operations <volatile>`.
5907 The contents of memory at the location specified by the '``<pointer>``'
5908 operand are atomically read, modified, and written back. The original
5909 value at the location is returned. The modification is specified by the
5912 - xchg: ``*ptr = val``
5913 - add: ``*ptr = *ptr + val``
5914 - sub: ``*ptr = *ptr - val``
5915 - and: ``*ptr = *ptr & val``
5916 - nand: ``*ptr = ~(*ptr & val)``
5917 - or: ``*ptr = *ptr | val``
5918 - xor: ``*ptr = *ptr ^ val``
5919 - max: ``*ptr = *ptr > val ? *ptr : val`` (using a signed comparison)
5920 - min: ``*ptr = *ptr < val ? *ptr : val`` (using a signed comparison)
5921 - umax: ``*ptr = *ptr > val ? *ptr : val`` (using an unsigned
5923 - umin: ``*ptr = *ptr < val ? *ptr : val`` (using an unsigned
5929 .. code-block:: llvm
5931 %old = atomicrmw add i32* %ptr, i32 1 acquire ; yields i32
5933 .. _i_getelementptr:
5935 '``getelementptr``' Instruction
5936 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
5943 <result> = getelementptr <ty>, <ty>* <ptrval>{, <ty> <idx>}*
5944 <result> = getelementptr inbounds <ty>, <ty>* <ptrval>{, <ty> <idx>}*
5945 <result> = getelementptr <ty>, <ptr vector> <ptrval>, <vector index type> <idx>
5950 The '``getelementptr``' instruction is used to get the address of a
5951 subelement of an :ref:`aggregate <t_aggregate>` data structure. It performs
5952 address calculation only and does not access memory.
5957 The first argument is always a type used as the basis for the calculations.
5958 The second argument is always a pointer or a vector of pointers, and is the
5959 base address to start from. The remaining arguments are indices
5960 that indicate which of the elements of the aggregate object are indexed.
5961 The interpretation of each index is dependent on the type being indexed
5962 into. The first index always indexes the pointer value given as the
5963 first argument, the second index indexes a value of the type pointed to
5964 (not necessarily the value directly pointed to, since the first index
5965 can be non-zero), etc. The first type indexed into must be a pointer
5966 value, subsequent types can be arrays, vectors, and structs. Note that
5967 subsequent types being indexed into can never be pointers, since that
5968 would require loading the pointer before continuing calculation.
5970 The type of each index argument depends on the type it is indexing into.
5971 When indexing into a (optionally packed) structure, only ``i32`` integer
5972 **constants** are allowed (when using a vector of indices they must all
5973 be the **same** ``i32`` integer constant). When indexing into an array,
5974 pointer or vector, integers of any width are allowed, and they are not
5975 required to be constant. These integers are treated as signed values
5978 For example, let's consider a C code fragment and how it gets compiled
5994 int *foo(struct ST *s) {
5995 return &s[1].Z.B[5][13];
5998 The LLVM code generated by Clang is:
6000 .. code-block:: llvm
6002 %struct.RT = type { i8, [10 x [20 x i32]], i8 }
6003 %struct.ST = type { i32, double, %struct.RT }
6005 define i32* @foo(%struct.ST* %s) nounwind uwtable readnone optsize ssp {
6007 %arrayidx = getelementptr inbounds %struct.ST, %struct.ST* %s, i64 1, i32 2, i32 1, i64 5, i64 13
6014 In the example above, the first index is indexing into the
6015 '``%struct.ST*``' type, which is a pointer, yielding a '``%struct.ST``'
6016 = '``{ i32, double, %struct.RT }``' type, a structure. The second index
6017 indexes into the third element of the structure, yielding a
6018 '``%struct.RT``' = '``{ i8 , [10 x [20 x i32]], i8 }``' type, another
6019 structure. The third index indexes into the second element of the
6020 structure, yielding a '``[10 x [20 x i32]]``' type, an array. The two
6021 dimensions of the array are subscripted into, yielding an '``i32``'
6022 type. The '``getelementptr``' instruction returns a pointer to this
6023 element, thus computing a value of '``i32*``' type.
6025 Note that it is perfectly legal to index partially through a structure,
6026 returning a pointer to an inner element. Because of this, the LLVM code
6027 for the given testcase is equivalent to:
6029 .. code-block:: llvm
6031 define i32* @foo(%struct.ST* %s) {
6032 %t1 = getelementptr %struct.ST, %struct.ST* %s, i32 1 ; yields %struct.ST*:%t1
6033 %t2 = getelementptr %struct.ST, %struct.ST* %t1, i32 0, i32 2 ; yields %struct.RT*:%t2
6034 %t3 = getelementptr %struct.RT, %struct.RT* %t2, i32 0, i32 1 ; yields [10 x [20 x i32]]*:%t3
6035 %t4 = getelementptr [10 x [20 x i32]], [10 x [20 x i32]]* %t3, i32 0, i32 5 ; yields [20 x i32]*:%t4
6036 %t5 = getelementptr [20 x i32], [20 x i32]* %t4, i32 0, i32 13 ; yields i32*:%t5
6040 If the ``inbounds`` keyword is present, the result value of the
6041 ``getelementptr`` is a :ref:`poison value <poisonvalues>` if the base
6042 pointer is not an *in bounds* address of an allocated object, or if any
6043 of the addresses that would be formed by successive addition of the
6044 offsets implied by the indices to the base address with infinitely
6045 precise signed arithmetic are not an *in bounds* address of that
6046 allocated object. The *in bounds* addresses for an allocated object are
6047 all the addresses that point into the object, plus the address one byte
6048 past the end. In cases where the base is a vector of pointers the
6049 ``inbounds`` keyword applies to each of the computations element-wise.
6051 If the ``inbounds`` keyword is not present, the offsets are added to the
6052 base address with silently-wrapping two's complement arithmetic. If the
6053 offsets have a different width from the pointer, they are sign-extended
6054 or truncated to the width of the pointer. The result value of the
6055 ``getelementptr`` may be outside the object pointed to by the base
6056 pointer. The result value may not necessarily be used to access memory
6057 though, even if it happens to point into allocated storage. See the
6058 :ref:`Pointer Aliasing Rules <pointeraliasing>` section for more
6061 The getelementptr instruction is often confusing. For some more insight
6062 into how it works, see :doc:`the getelementptr FAQ <GetElementPtr>`.
6067 .. code-block:: llvm
6069 ; yields [12 x i8]*:aptr
6070 %aptr = getelementptr {i32, [12 x i8]}, {i32, [12 x i8]}* %saptr, i64 0, i32 1
6072 %vptr = getelementptr {i32, <2 x i8>}, {i32, <2 x i8>}* %svptr, i64 0, i32 1, i32 1
6074 %eptr = getelementptr [12 x i8], [12 x i8]* %aptr, i64 0, i32 1
6076 %iptr = getelementptr [10 x i32], [10 x i32]* @arr, i16 0, i16 0
6078 In cases where the pointer argument is a vector of pointers, each index
6079 must be a vector with the same number of elements. For example:
6081 .. code-block:: llvm
6083 %A = getelementptr i8, <4 x i8*> %ptrs, <4 x i64> %offsets,
6085 Conversion Operations
6086 ---------------------
6088 The instructions in this category are the conversion instructions
6089 (casting) which all take a single operand and a type. They perform
6090 various bit conversions on the operand.
6092 '``trunc .. to``' Instruction
6093 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
6100 <result> = trunc <ty> <value> to <ty2> ; yields ty2
6105 The '``trunc``' instruction truncates its operand to the type ``ty2``.
6110 The '``trunc``' instruction takes a value to trunc, and a type to trunc
6111 it to. Both types must be of :ref:`integer <t_integer>` types, or vectors
6112 of the same number of integers. The bit size of the ``value`` must be
6113 larger than the bit size of the destination type, ``ty2``. Equal sized
6114 types are not allowed.
6119 The '``trunc``' instruction truncates the high order bits in ``value``
6120 and converts the remaining bits to ``ty2``. Since the source size must
6121 be larger than the destination size, ``trunc`` cannot be a *no-op cast*.
6122 It will always truncate bits.
6127 .. code-block:: llvm
6129 %X = trunc i32 257 to i8 ; yields i8:1
6130 %Y = trunc i32 123 to i1 ; yields i1:true
6131 %Z = trunc i32 122 to i1 ; yields i1:false
6132 %W = trunc <2 x i16> <i16 8, i16 7> to <2 x i8> ; yields <i8 8, i8 7>
6134 '``zext .. to``' Instruction
6135 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
6142 <result> = zext <ty> <value> to <ty2> ; yields ty2
6147 The '``zext``' instruction zero extends its operand to type ``ty2``.
6152 The '``zext``' instruction takes a value to cast, and a type to cast it
6153 to. Both types must be of :ref:`integer <t_integer>` types, or vectors of
6154 the same number of integers. The bit size of the ``value`` must be
6155 smaller than the bit size of the destination type, ``ty2``.
6160 The ``zext`` fills the high order bits of the ``value`` with zero bits
6161 until it reaches the size of the destination type, ``ty2``.
6163 When zero extending from i1, the result will always be either 0 or 1.
6168 .. code-block:: llvm
6170 %X = zext i32 257 to i64 ; yields i64:257
6171 %Y = zext i1 true to i32 ; yields i32:1
6172 %Z = zext <2 x i16> <i16 8, i16 7> to <2 x i32> ; yields <i32 8, i32 7>
6174 '``sext .. to``' Instruction
6175 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
6182 <result> = sext <ty> <value> to <ty2> ; yields ty2
6187 The '``sext``' sign extends ``value`` to the type ``ty2``.
6192 The '``sext``' instruction takes a value to cast, and a type to cast it
6193 to. Both types must be of :ref:`integer <t_integer>` types, or vectors of
6194 the same number of integers. The bit size of the ``value`` must be
6195 smaller than the bit size of the destination type, ``ty2``.
6200 The '``sext``' instruction performs a sign extension by copying the sign
6201 bit (highest order bit) of the ``value`` until it reaches the bit size
6202 of the type ``ty2``.
6204 When sign extending from i1, the extension always results in -1 or 0.
6209 .. code-block:: llvm
6211 %X = sext i8 -1 to i16 ; yields i16 :65535
6212 %Y = sext i1 true to i32 ; yields i32:-1
6213 %Z = sext <2 x i16> <i16 8, i16 7> to <2 x i32> ; yields <i32 8, i32 7>
6215 '``fptrunc .. to``' Instruction
6216 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
6223 <result> = fptrunc <ty> <value> to <ty2> ; yields ty2
6228 The '``fptrunc``' instruction truncates ``value`` to type ``ty2``.
6233 The '``fptrunc``' instruction takes a :ref:`floating point <t_floating>`
6234 value to cast and a :ref:`floating point <t_floating>` type to cast it to.
6235 The size of ``value`` must be larger than the size of ``ty2``. This
6236 implies that ``fptrunc`` cannot be used to make a *no-op cast*.
6241 The '``fptrunc``' instruction truncates a ``value`` from a larger
6242 :ref:`floating point <t_floating>` type to a smaller :ref:`floating
6243 point <t_floating>` type. If the value cannot fit within the
6244 destination type, ``ty2``, then the results are undefined.
6249 .. code-block:: llvm
6251 %X = fptrunc double 123.0 to float ; yields float:123.0
6252 %Y = fptrunc double 1.0E+300 to float ; yields undefined
6254 '``fpext .. to``' Instruction
6255 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
6262 <result> = fpext <ty> <value> to <ty2> ; yields ty2
6267 The '``fpext``' extends a floating point ``value`` to a larger floating
6273 The '``fpext``' instruction takes a :ref:`floating point <t_floating>`
6274 ``value`` to cast, and a :ref:`floating point <t_floating>` type to cast it
6275 to. The source type must be smaller than the destination type.
6280 The '``fpext``' instruction extends the ``value`` from a smaller
6281 :ref:`floating point <t_floating>` type to a larger :ref:`floating
6282 point <t_floating>` type. The ``fpext`` cannot be used to make a
6283 *no-op cast* because it always changes bits. Use ``bitcast`` to make a
6284 *no-op cast* for a floating point cast.
6289 .. code-block:: llvm
6291 %X = fpext float 3.125 to double ; yields double:3.125000e+00
6292 %Y = fpext double %X to fp128 ; yields fp128:0xL00000000000000004000900000000000
6294 '``fptoui .. to``' Instruction
6295 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
6302 <result> = fptoui <ty> <value> to <ty2> ; yields ty2
6307 The '``fptoui``' converts a floating point ``value`` to its unsigned
6308 integer equivalent of type ``ty2``.
6313 The '``fptoui``' instruction takes a value to cast, which must be a
6314 scalar or vector :ref:`floating point <t_floating>` value, and a type to
6315 cast it to ``ty2``, which must be an :ref:`integer <t_integer>` type. If
6316 ``ty`` is a vector floating point type, ``ty2`` must be a vector integer
6317 type with the same number of elements as ``ty``
6322 The '``fptoui``' instruction converts its :ref:`floating
6323 point <t_floating>` operand into the nearest (rounding towards zero)
6324 unsigned integer value. If the value cannot fit in ``ty2``, the results
6330 .. code-block:: llvm
6332 %X = fptoui double 123.0 to i32 ; yields i32:123
6333 %Y = fptoui float 1.0E+300 to i1 ; yields undefined:1
6334 %Z = fptoui float 1.04E+17 to i8 ; yields undefined:1
6336 '``fptosi .. to``' Instruction
6337 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
6344 <result> = fptosi <ty> <value> to <ty2> ; yields ty2
6349 The '``fptosi``' instruction converts :ref:`floating point <t_floating>`
6350 ``value`` to type ``ty2``.
6355 The '``fptosi``' instruction takes a value to cast, which must be a
6356 scalar or vector :ref:`floating point <t_floating>` value, and a type to
6357 cast it to ``ty2``, which must be an :ref:`integer <t_integer>` type. If
6358 ``ty`` is a vector floating point type, ``ty2`` must be a vector integer
6359 type with the same number of elements as ``ty``
6364 The '``fptosi``' instruction converts its :ref:`floating
6365 point <t_floating>` operand into the nearest (rounding towards zero)
6366 signed integer value. If the value cannot fit in ``ty2``, the results
6372 .. code-block:: llvm
6374 %X = fptosi double -123.0 to i32 ; yields i32:-123
6375 %Y = fptosi float 1.0E-247 to i1 ; yields undefined:1
6376 %Z = fptosi float 1.04E+17 to i8 ; yields undefined:1
6378 '``uitofp .. to``' Instruction
6379 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
6386 <result> = uitofp <ty> <value> to <ty2> ; yields ty2
6391 The '``uitofp``' instruction regards ``value`` as an unsigned integer
6392 and converts that value to the ``ty2`` type.
6397 The '``uitofp``' instruction takes a value to cast, which must be a
6398 scalar or vector :ref:`integer <t_integer>` value, and a type to cast it to
6399 ``ty2``, which must be an :ref:`floating point <t_floating>` type. If
6400 ``ty`` is a vector integer type, ``ty2`` must be a vector floating point
6401 type with the same number of elements as ``ty``
6406 The '``uitofp``' instruction interprets its operand as an unsigned
6407 integer quantity and converts it to the corresponding floating point
6408 value. If the value cannot fit in the floating point value, the results
6414 .. code-block:: llvm
6416 %X = uitofp i32 257 to float ; yields float:257.0
6417 %Y = uitofp i8 -1 to double ; yields double:255.0
6419 '``sitofp .. to``' Instruction
6420 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
6427 <result> = sitofp <ty> <value> to <ty2> ; yields ty2
6432 The '``sitofp``' instruction regards ``value`` as a signed integer and
6433 converts that value to the ``ty2`` type.
6438 The '``sitofp``' instruction takes a value to cast, which must be a
6439 scalar or vector :ref:`integer <t_integer>` value, and a type to cast it to
6440 ``ty2``, which must be an :ref:`floating point <t_floating>` type. If
6441 ``ty`` is a vector integer type, ``ty2`` must be a vector floating point
6442 type with the same number of elements as ``ty``
6447 The '``sitofp``' instruction interprets its operand as a signed integer
6448 quantity and converts it to the corresponding floating point value. If
6449 the value cannot fit in the floating point value, the results are
6455 .. code-block:: llvm
6457 %X = sitofp i32 257 to float ; yields float:257.0
6458 %Y = sitofp i8 -1 to double ; yields double:-1.0
6462 '``ptrtoint .. to``' Instruction
6463 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
6470 <result> = ptrtoint <ty> <value> to <ty2> ; yields ty2
6475 The '``ptrtoint``' instruction converts the pointer or a vector of
6476 pointers ``value`` to the integer (or vector of integers) type ``ty2``.
6481 The '``ptrtoint``' instruction takes a ``value`` to cast, which must be
6482 a a value of type :ref:`pointer <t_pointer>` or a vector of pointers, and a
6483 type to cast it to ``ty2``, which must be an :ref:`integer <t_integer>` or
6484 a vector of integers type.
6489 The '``ptrtoint``' instruction converts ``value`` to integer type
6490 ``ty2`` by interpreting the pointer value as an integer and either
6491 truncating or zero extending that value to the size of the integer type.
6492 If ``value`` is smaller than ``ty2`` then a zero extension is done. If
6493 ``value`` is larger than ``ty2`` then a truncation is done. If they are
6494 the same size, then nothing is done (*no-op cast*) other than a type
6500 .. code-block:: llvm
6502 %X = ptrtoint i32* %P to i8 ; yields truncation on 32-bit architecture
6503 %Y = ptrtoint i32* %P to i64 ; yields zero extension on 32-bit architecture
6504 %Z = ptrtoint <4 x i32*> %P to <4 x i64>; yields vector zero extension for a vector of addresses on 32-bit architecture
6508 '``inttoptr .. to``' Instruction
6509 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
6516 <result> = inttoptr <ty> <value> to <ty2> ; yields ty2
6521 The '``inttoptr``' instruction converts an integer ``value`` to a
6522 pointer type, ``ty2``.
6527 The '``inttoptr``' instruction takes an :ref:`integer <t_integer>` value to
6528 cast, and a type to cast it to, which must be a :ref:`pointer <t_pointer>`
6534 The '``inttoptr``' instruction converts ``value`` to type ``ty2`` by
6535 applying either a zero extension or a truncation depending on the size
6536 of the integer ``value``. If ``value`` is larger than the size of a
6537 pointer then a truncation is done. If ``value`` is smaller than the size
6538 of a pointer then a zero extension is done. If they are the same size,
6539 nothing is done (*no-op cast*).
6544 .. code-block:: llvm
6546 %X = inttoptr i32 255 to i32* ; yields zero extension on 64-bit architecture
6547 %Y = inttoptr i32 255 to i32* ; yields no-op on 32-bit architecture
6548 %Z = inttoptr i64 0 to i32* ; yields truncation on 32-bit architecture
6549 %Z = inttoptr <4 x i32> %G to <4 x i8*>; yields truncation of vector G to four pointers
6553 '``bitcast .. to``' Instruction
6554 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
6561 <result> = bitcast <ty> <value> to <ty2> ; yields ty2
6566 The '``bitcast``' instruction converts ``value`` to type ``ty2`` without
6572 The '``bitcast``' instruction takes a value to cast, which must be a
6573 non-aggregate first class value, and a type to cast it to, which must
6574 also be a non-aggregate :ref:`first class <t_firstclass>` type. The
6575 bit sizes of ``value`` and the destination type, ``ty2``, must be
6576 identical. If the source type is a pointer, the destination type must
6577 also be a pointer of the same size. This instruction supports bitwise
6578 conversion of vectors to integers and to vectors of other types (as
6579 long as they have the same size).
6584 The '``bitcast``' instruction converts ``value`` to type ``ty2``. It
6585 is always a *no-op cast* because no bits change with this
6586 conversion. The conversion is done as if the ``value`` had been stored
6587 to memory and read back as type ``ty2``. Pointer (or vector of
6588 pointers) types may only be converted to other pointer (or vector of
6589 pointers) types with the same address space through this instruction.
6590 To convert pointers to other types, use the :ref:`inttoptr <i_inttoptr>`
6591 or :ref:`ptrtoint <i_ptrtoint>` instructions first.
6596 .. code-block:: llvm
6598 %X = bitcast i8 255 to i8 ; yields i8 :-1
6599 %Y = bitcast i32* %x to sint* ; yields sint*:%x
6600 %Z = bitcast <2 x int> %V to i64; ; yields i64: %V
6601 %Z = bitcast <2 x i32*> %V to <2 x i64*> ; yields <2 x i64*>
6603 .. _i_addrspacecast:
6605 '``addrspacecast .. to``' Instruction
6606 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
6613 <result> = addrspacecast <pty> <ptrval> to <pty2> ; yields pty2
6618 The '``addrspacecast``' instruction converts ``ptrval`` from ``pty`` in
6619 address space ``n`` to type ``pty2`` in address space ``m``.
6624 The '``addrspacecast``' instruction takes a pointer or vector of pointer value
6625 to cast and a pointer type to cast it to, which must have a different
6631 The '``addrspacecast``' instruction converts the pointer value
6632 ``ptrval`` to type ``pty2``. It can be a *no-op cast* or a complex
6633 value modification, depending on the target and the address space
6634 pair. Pointer conversions within the same address space must be
6635 performed with the ``bitcast`` instruction. Note that if the address space
6636 conversion is legal then both result and operand refer to the same memory
6642 .. code-block:: llvm
6644 %X = addrspacecast i32* %x to i32 addrspace(1)* ; yields i32 addrspace(1)*:%x
6645 %Y = addrspacecast i32 addrspace(1)* %y to i64 addrspace(2)* ; yields i64 addrspace(2)*:%y
6646 %Z = addrspacecast <4 x i32*> %z to <4 x float addrspace(3)*> ; yields <4 x float addrspace(3)*>:%z
6653 The instructions in this category are the "miscellaneous" instructions,
6654 which defy better classification.
6658 '``icmp``' Instruction
6659 ^^^^^^^^^^^^^^^^^^^^^^
6666 <result> = icmp <cond> <ty> <op1>, <op2> ; yields i1 or <N x i1>:result
6671 The '``icmp``' instruction returns a boolean value or a vector of
6672 boolean values based on comparison of its two integer, integer vector,
6673 pointer, or pointer vector operands.
6678 The '``icmp``' instruction takes three operands. The first operand is
6679 the condition code indicating the kind of comparison to perform. It is
6680 not a value, just a keyword. The possible condition code are:
6683 #. ``ne``: not equal
6684 #. ``ugt``: unsigned greater than
6685 #. ``uge``: unsigned greater or equal
6686 #. ``ult``: unsigned less than
6687 #. ``ule``: unsigned less or equal
6688 #. ``sgt``: signed greater than
6689 #. ``sge``: signed greater or equal
6690 #. ``slt``: signed less than
6691 #. ``sle``: signed less or equal
6693 The remaining two arguments must be :ref:`integer <t_integer>` or
6694 :ref:`pointer <t_pointer>` or integer :ref:`vector <t_vector>` typed. They
6695 must also be identical types.
6700 The '``icmp``' compares ``op1`` and ``op2`` according to the condition
6701 code given as ``cond``. The comparison performed always yields either an
6702 :ref:`i1 <t_integer>` or vector of ``i1`` result, as follows:
6704 #. ``eq``: yields ``true`` if the operands are equal, ``false``
6705 otherwise. No sign interpretation is necessary or performed.
6706 #. ``ne``: yields ``true`` if the operands are unequal, ``false``
6707 otherwise. No sign interpretation is necessary or performed.
6708 #. ``ugt``: interprets the operands as unsigned values and yields
6709 ``true`` if ``op1`` is greater than ``op2``.
6710 #. ``uge``: interprets the operands as unsigned values and yields
6711 ``true`` if ``op1`` is greater than or equal to ``op2``.
6712 #. ``ult``: interprets the operands as unsigned values and yields
6713 ``true`` if ``op1`` is less than ``op2``.
6714 #. ``ule``: interprets the operands as unsigned values and yields
6715 ``true`` if ``op1`` is less than or equal to ``op2``.
6716 #. ``sgt``: interprets the operands as signed values and yields ``true``
6717 if ``op1`` is greater than ``op2``.
6718 #. ``sge``: interprets the operands as signed values and yields ``true``
6719 if ``op1`` is greater than or equal to ``op2``.
6720 #. ``slt``: interprets the operands as signed values and yields ``true``
6721 if ``op1`` is less than ``op2``.
6722 #. ``sle``: interprets the operands as signed values and yields ``true``
6723 if ``op1`` is less than or equal to ``op2``.
6725 If the operands are :ref:`pointer <t_pointer>` typed, the pointer values
6726 are compared as if they were integers.
6728 If the operands are integer vectors, then they are compared element by
6729 element. The result is an ``i1`` vector with the same number of elements
6730 as the values being compared. Otherwise, the result is an ``i1``.
6735 .. code-block:: llvm
6737 <result> = icmp eq i32 4, 5 ; yields: result=false
6738 <result> = icmp ne float* %X, %X ; yields: result=false
6739 <result> = icmp ult i16 4, 5 ; yields: result=true
6740 <result> = icmp sgt i16 4, 5 ; yields: result=false
6741 <result> = icmp ule i16 -4, 5 ; yields: result=false
6742 <result> = icmp sge i16 4, 5 ; yields: result=false
6744 Note that the code generator does not yet support vector types with the
6745 ``icmp`` instruction.
6749 '``fcmp``' Instruction
6750 ^^^^^^^^^^^^^^^^^^^^^^
6757 <result> = fcmp <cond> <ty> <op1>, <op2> ; yields i1 or <N x i1>:result
6762 The '``fcmp``' instruction returns a boolean value or vector of boolean
6763 values based on comparison of its operands.
6765 If the operands are floating point scalars, then the result type is a
6766 boolean (:ref:`i1 <t_integer>`).
6768 If the operands are floating point vectors, then the result type is a
6769 vector of boolean with the same number of elements as the operands being
6775 The '``fcmp``' instruction takes three operands. The first operand is
6776 the condition code indicating the kind of comparison to perform. It is
6777 not a value, just a keyword. The possible condition code are:
6779 #. ``false``: no comparison, always returns false
6780 #. ``oeq``: ordered and equal
6781 #. ``ogt``: ordered and greater than
6782 #. ``oge``: ordered and greater than or equal
6783 #. ``olt``: ordered and less than
6784 #. ``ole``: ordered and less than or equal
6785 #. ``one``: ordered and not equal
6786 #. ``ord``: ordered (no nans)
6787 #. ``ueq``: unordered or equal
6788 #. ``ugt``: unordered or greater than
6789 #. ``uge``: unordered or greater than or equal
6790 #. ``ult``: unordered or less than
6791 #. ``ule``: unordered or less than or equal
6792 #. ``une``: unordered or not equal
6793 #. ``uno``: unordered (either nans)
6794 #. ``true``: no comparison, always returns true
6796 *Ordered* means that neither operand is a QNAN while *unordered* means
6797 that either operand may be a QNAN.
6799 Each of ``val1`` and ``val2`` arguments must be either a :ref:`floating
6800 point <t_floating>` type or a :ref:`vector <t_vector>` of floating point
6801 type. They must have identical types.
6806 The '``fcmp``' instruction compares ``op1`` and ``op2`` according to the
6807 condition code given as ``cond``. If the operands are vectors, then the
6808 vectors are compared element by element. Each comparison performed
6809 always yields an :ref:`i1 <t_integer>` result, as follows:
6811 #. ``false``: always yields ``false``, regardless of operands.
6812 #. ``oeq``: yields ``true`` if both operands are not a QNAN and ``op1``
6813 is equal to ``op2``.
6814 #. ``ogt``: yields ``true`` if both operands are not a QNAN and ``op1``
6815 is greater than ``op2``.
6816 #. ``oge``: yields ``true`` if both operands are not a QNAN and ``op1``
6817 is greater than or equal to ``op2``.
6818 #. ``olt``: yields ``true`` if both operands are not a QNAN and ``op1``
6819 is less than ``op2``.
6820 #. ``ole``: yields ``true`` if both operands are not a QNAN and ``op1``
6821 is less than or equal to ``op2``.
6822 #. ``one``: yields ``true`` if both operands are not a QNAN and ``op1``
6823 is not equal to ``op2``.
6824 #. ``ord``: yields ``true`` if both operands are not a QNAN.
6825 #. ``ueq``: yields ``true`` if either operand is a QNAN or ``op1`` is
6827 #. ``ugt``: yields ``true`` if either operand is a QNAN or ``op1`` is
6828 greater than ``op2``.
6829 #. ``uge``: yields ``true`` if either operand is a QNAN or ``op1`` is
6830 greater than or equal to ``op2``.
6831 #. ``ult``: yields ``true`` if either operand is a QNAN or ``op1`` is
6833 #. ``ule``: yields ``true`` if either operand is a QNAN or ``op1`` is
6834 less than or equal to ``op2``.
6835 #. ``une``: yields ``true`` if either operand is a QNAN or ``op1`` is
6836 not equal to ``op2``.
6837 #. ``uno``: yields ``true`` if either operand is a QNAN.
6838 #. ``true``: always yields ``true``, regardless of operands.
6843 .. code-block:: llvm
6845 <result> = fcmp oeq float 4.0, 5.0 ; yields: result=false
6846 <result> = fcmp one float 4.0, 5.0 ; yields: result=true
6847 <result> = fcmp olt float 4.0, 5.0 ; yields: result=true
6848 <result> = fcmp ueq double 1.0, 2.0 ; yields: result=false
6850 Note that the code generator does not yet support vector types with the
6851 ``fcmp`` instruction.
6855 '``phi``' Instruction
6856 ^^^^^^^^^^^^^^^^^^^^^
6863 <result> = phi <ty> [ <val0>, <label0>], ...
6868 The '``phi``' instruction is used to implement the φ node in the SSA
6869 graph representing the function.
6874 The type of the incoming values is specified with the first type field.
6875 After this, the '``phi``' instruction takes a list of pairs as
6876 arguments, with one pair for each predecessor basic block of the current
6877 block. Only values of :ref:`first class <t_firstclass>` type may be used as
6878 the value arguments to the PHI node. Only labels may be used as the
6881 There must be no non-phi instructions between the start of a basic block
6882 and the PHI instructions: i.e. PHI instructions must be first in a basic
6885 For the purposes of the SSA form, the use of each incoming value is
6886 deemed to occur on the edge from the corresponding predecessor block to
6887 the current block (but after any definition of an '``invoke``'
6888 instruction's return value on the same edge).
6893 At runtime, the '``phi``' instruction logically takes on the value
6894 specified by the pair corresponding to the predecessor basic block that
6895 executed just prior to the current block.
6900 .. code-block:: llvm
6902 Loop: ; Infinite loop that counts from 0 on up...
6903 %indvar = phi i32 [ 0, %LoopHeader ], [ %nextindvar, %Loop ]
6904 %nextindvar = add i32 %indvar, 1
6909 '``select``' Instruction
6910 ^^^^^^^^^^^^^^^^^^^^^^^^
6917 <result> = select selty <cond>, <ty> <val1>, <ty> <val2> ; yields ty
6919 selty is either i1 or {<N x i1>}
6924 The '``select``' instruction is used to choose one value based on a
6925 condition, without IR-level branching.
6930 The '``select``' instruction requires an 'i1' value or a vector of 'i1'
6931 values indicating the condition, and two values of the same :ref:`first
6932 class <t_firstclass>` type.
6937 If the condition is an i1 and it evaluates to 1, the instruction returns
6938 the first value argument; otherwise, it returns the second value
6941 If the condition is a vector of i1, then the value arguments must be
6942 vectors of the same size, and the selection is done element by element.
6944 If the condition is an i1 and the value arguments are vectors of the
6945 same size, then an entire vector is selected.
6950 .. code-block:: llvm
6952 %X = select i1 true, i8 17, i8 42 ; yields i8:17
6956 '``call``' Instruction
6957 ^^^^^^^^^^^^^^^^^^^^^^
6964 <result> = [tail | musttail] call [cconv] [ret attrs] <ty> [<fnty>*] <fnptrval>(<function args>) [fn attrs]
6969 The '``call``' instruction represents a simple function call.
6974 This instruction requires several arguments:
6976 #. The optional ``tail`` and ``musttail`` markers indicate that the optimizers
6977 should perform tail call optimization. The ``tail`` marker is a hint that
6978 `can be ignored <CodeGenerator.html#sibcallopt>`_. The ``musttail`` marker
6979 means that the call must be tail call optimized in order for the program to
6980 be correct. The ``musttail`` marker provides these guarantees:
6982 #. The call will not cause unbounded stack growth if it is part of a
6983 recursive cycle in the call graph.
6984 #. Arguments with the :ref:`inalloca <attr_inalloca>` attribute are
6987 Both markers imply that the callee does not access allocas or varargs from
6988 the caller. Calls marked ``musttail`` must obey the following additional
6991 - The call must immediately precede a :ref:`ret <i_ret>` instruction,
6992 or a pointer bitcast followed by a ret instruction.
6993 - The ret instruction must return the (possibly bitcasted) value
6994 produced by the call or void.
6995 - The caller and callee prototypes must match. Pointer types of
6996 parameters or return types may differ in pointee type, but not
6998 - The calling conventions of the caller and callee must match.
6999 - All ABI-impacting function attributes, such as sret, byval, inreg,
7000 returned, and inalloca, must match.
7001 - The callee must be varargs iff the caller is varargs. Bitcasting a
7002 non-varargs function to the appropriate varargs type is legal so
7003 long as the non-varargs prefixes obey the other rules.
7005 Tail call optimization for calls marked ``tail`` is guaranteed to occur if
7006 the following conditions are met:
7008 - Caller and callee both have the calling convention ``fastcc``.
7009 - The call is in tail position (ret immediately follows call and ret
7010 uses value of call or is void).
7011 - Option ``-tailcallopt`` is enabled, or
7012 ``llvm::GuaranteedTailCallOpt`` is ``true``.
7013 - `Platform-specific constraints are
7014 met. <CodeGenerator.html#tailcallopt>`_
7016 #. The optional "cconv" marker indicates which :ref:`calling
7017 convention <callingconv>` the call should use. If none is
7018 specified, the call defaults to using C calling conventions. The
7019 calling convention of the call must match the calling convention of
7020 the target function, or else the behavior is undefined.
7021 #. The optional :ref:`Parameter Attributes <paramattrs>` list for return
7022 values. Only '``zeroext``', '``signext``', and '``inreg``' attributes
7024 #. '``ty``': the type of the call instruction itself which is also the
7025 type of the return value. Functions that return no value are marked
7027 #. '``fnty``': shall be the signature of the pointer to function value
7028 being invoked. The argument types must match the types implied by
7029 this signature. This type can be omitted if the function is not
7030 varargs and if the function type does not return a pointer to a
7032 #. '``fnptrval``': An LLVM value containing a pointer to a function to
7033 be invoked. In most cases, this is a direct function invocation, but
7034 indirect ``call``'s are just as possible, calling an arbitrary pointer
7036 #. '``function args``': argument list whose types match the function
7037 signature argument types and parameter attributes. All arguments must
7038 be of :ref:`first class <t_firstclass>` type. If the function signature
7039 indicates the function accepts a variable number of arguments, the
7040 extra arguments can be specified.
7041 #. The optional :ref:`function attributes <fnattrs>` list. Only
7042 '``noreturn``', '``nounwind``', '``readonly``' and '``readnone``'
7043 attributes are valid here.
7048 The '``call``' instruction is used to cause control flow to transfer to
7049 a specified function, with its incoming arguments bound to the specified
7050 values. Upon a '``ret``' instruction in the called function, control
7051 flow continues with the instruction after the function call, and the
7052 return value of the function is bound to the result argument.
7057 .. code-block:: llvm
7059 %retval = call i32 @test(i32 %argc)
7060 call i32 (i8*, ...)* @printf(i8* %msg, i32 12, i8 42) ; yields i32
7061 %X = tail call i32 @foo() ; yields i32
7062 %Y = tail call fastcc i32 @foo() ; yields i32
7063 call void %foo(i8 97 signext)
7065 %struct.A = type { i32, i8 }
7066 %r = call %struct.A @foo() ; yields { i32, i8 }
7067 %gr = extractvalue %struct.A %r, 0 ; yields i32
7068 %gr1 = extractvalue %struct.A %r, 1 ; yields i8
7069 %Z = call void @foo() noreturn ; indicates that %foo never returns normally
7070 %ZZ = call zeroext i32 @bar() ; Return value is %zero extended
7072 llvm treats calls to some functions with names and arguments that match
7073 the standard C99 library as being the C99 library functions, and may
7074 perform optimizations or generate code for them under that assumption.
7075 This is something we'd like to change in the future to provide better
7076 support for freestanding environments and non-C-based languages.
7080 '``va_arg``' Instruction
7081 ^^^^^^^^^^^^^^^^^^^^^^^^
7088 <resultval> = va_arg <va_list*> <arglist>, <argty>
7093 The '``va_arg``' instruction is used to access arguments passed through
7094 the "variable argument" area of a function call. It is used to implement
7095 the ``va_arg`` macro in C.
7100 This instruction takes a ``va_list*`` value and the type of the
7101 argument. It returns a value of the specified argument type and
7102 increments the ``va_list`` to point to the next argument. The actual
7103 type of ``va_list`` is target specific.
7108 The '``va_arg``' instruction loads an argument of the specified type
7109 from the specified ``va_list`` and causes the ``va_list`` to point to
7110 the next argument. For more information, see the variable argument
7111 handling :ref:`Intrinsic Functions <int_varargs>`.
7113 It is legal for this instruction to be called in a function which does
7114 not take a variable number of arguments, for example, the ``vfprintf``
7117 ``va_arg`` is an LLVM instruction instead of an :ref:`intrinsic
7118 function <intrinsics>` because it takes a type as an argument.
7123 See the :ref:`variable argument processing <int_varargs>` section.
7125 Note that the code generator does not yet fully support va\_arg on many
7126 targets. Also, it does not currently support va\_arg with aggregate
7127 types on any target.
7131 '``landingpad``' Instruction
7132 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7139 <resultval> = landingpad <resultty> personality <type> <pers_fn> <clause>+
7140 <resultval> = landingpad <resultty> personality <type> <pers_fn> cleanup <clause>*
7142 <clause> := catch <type> <value>
7143 <clause> := filter <array constant type> <array constant>
7148 The '``landingpad``' instruction is used by `LLVM's exception handling
7149 system <ExceptionHandling.html#overview>`_ to specify that a basic block
7150 is a landing pad --- one where the exception lands, and corresponds to the
7151 code found in the ``catch`` portion of a ``try``/``catch`` sequence. It
7152 defines values supplied by the personality function (``pers_fn``) upon
7153 re-entry to the function. The ``resultval`` has the type ``resultty``.
7158 This instruction takes a ``pers_fn`` value. This is the personality
7159 function associated with the unwinding mechanism. The optional
7160 ``cleanup`` flag indicates that the landing pad block is a cleanup.
7162 A ``clause`` begins with the clause type --- ``catch`` or ``filter`` --- and
7163 contains the global variable representing the "type" that may be caught
7164 or filtered respectively. Unlike the ``catch`` clause, the ``filter``
7165 clause takes an array constant as its argument. Use
7166 "``[0 x i8**] undef``" for a filter which cannot throw. The
7167 '``landingpad``' instruction must contain *at least* one ``clause`` or
7168 the ``cleanup`` flag.
7173 The '``landingpad``' instruction defines the values which are set by the
7174 personality function (``pers_fn``) upon re-entry to the function, and
7175 therefore the "result type" of the ``landingpad`` instruction. As with
7176 calling conventions, how the personality function results are
7177 represented in LLVM IR is target specific.
7179 The clauses are applied in order from top to bottom. If two
7180 ``landingpad`` instructions are merged together through inlining, the
7181 clauses from the calling function are appended to the list of clauses.
7182 When the call stack is being unwound due to an exception being thrown,
7183 the exception is compared against each ``clause`` in turn. If it doesn't
7184 match any of the clauses, and the ``cleanup`` flag is not set, then
7185 unwinding continues further up the call stack.
7187 The ``landingpad`` instruction has several restrictions:
7189 - A landing pad block is a basic block which is the unwind destination
7190 of an '``invoke``' instruction.
7191 - A landing pad block must have a '``landingpad``' instruction as its
7192 first non-PHI instruction.
7193 - There can be only one '``landingpad``' instruction within the landing
7195 - A basic block that is not a landing pad block may not include a
7196 '``landingpad``' instruction.
7197 - All '``landingpad``' instructions in a function must have the same
7198 personality function.
7203 .. code-block:: llvm
7205 ;; A landing pad which can catch an integer.
7206 %res = landingpad { i8*, i32 } personality i32 (...)* @__gxx_personality_v0
7208 ;; A landing pad that is a cleanup.
7209 %res = landingpad { i8*, i32 } personality i32 (...)* @__gxx_personality_v0
7211 ;; A landing pad which can catch an integer and can only throw a double.
7212 %res = landingpad { i8*, i32 } personality i32 (...)* @__gxx_personality_v0
7214 filter [1 x i8**] [@_ZTId]
7221 LLVM supports the notion of an "intrinsic function". These functions
7222 have well known names and semantics and are required to follow certain
7223 restrictions. Overall, these intrinsics represent an extension mechanism
7224 for the LLVM language that does not require changing all of the
7225 transformations in LLVM when adding to the language (or the bitcode
7226 reader/writer, the parser, etc...).
7228 Intrinsic function names must all start with an "``llvm.``" prefix. This
7229 prefix is reserved in LLVM for intrinsic names; thus, function names may
7230 not begin with this prefix. Intrinsic functions must always be external
7231 functions: you cannot define the body of intrinsic functions. Intrinsic
7232 functions may only be used in call or invoke instructions: it is illegal
7233 to take the address of an intrinsic function. Additionally, because
7234 intrinsic functions are part of the LLVM language, it is required if any
7235 are added that they be documented here.
7237 Some intrinsic functions can be overloaded, i.e., the intrinsic
7238 represents a family of functions that perform the same operation but on
7239 different data types. Because LLVM can represent over 8 million
7240 different integer types, overloading is used commonly to allow an
7241 intrinsic function to operate on any integer type. One or more of the
7242 argument types or the result type can be overloaded to accept any
7243 integer type. Argument types may also be defined as exactly matching a
7244 previous argument's type or the result type. This allows an intrinsic
7245 function which accepts multiple arguments, but needs all of them to be
7246 of the same type, to only be overloaded with respect to a single
7247 argument or the result.
7249 Overloaded intrinsics will have the names of its overloaded argument
7250 types encoded into its function name, each preceded by a period. Only
7251 those types which are overloaded result in a name suffix. Arguments
7252 whose type is matched against another type do not. For example, the
7253 ``llvm.ctpop`` function can take an integer of any width and returns an
7254 integer of exactly the same integer width. This leads to a family of
7255 functions such as ``i8 @llvm.ctpop.i8(i8 %val)`` and
7256 ``i29 @llvm.ctpop.i29(i29 %val)``. Only one type, the return type, is
7257 overloaded, and only one type suffix is required. Because the argument's
7258 type is matched against the return type, it does not require its own
7261 To learn how to add an intrinsic function, please see the `Extending
7262 LLVM Guide <ExtendingLLVM.html>`_.
7266 Variable Argument Handling Intrinsics
7267 -------------------------------------
7269 Variable argument support is defined in LLVM with the
7270 :ref:`va_arg <i_va_arg>` instruction and these three intrinsic
7271 functions. These functions are related to the similarly named macros
7272 defined in the ``<stdarg.h>`` header file.
7274 All of these functions operate on arguments that use a target-specific
7275 value type "``va_list``". The LLVM assembly language reference manual
7276 does not define what this type is, so all transformations should be
7277 prepared to handle these functions regardless of the type used.
7279 This example shows how the :ref:`va_arg <i_va_arg>` instruction and the
7280 variable argument handling intrinsic functions are used.
7282 .. code-block:: llvm
7284 ; This struct is different for every platform. For most platforms,
7285 ; it is merely an i8*.
7286 %struct.va_list = type { i8* }
7288 ; For Unix x86_64 platforms, va_list is the following struct:
7289 ; %struct.va_list = type { i32, i32, i8*, i8* }
7291 define i32 @test(i32 %X, ...) {
7292 ; Initialize variable argument processing
7293 %ap = alloca %struct.va_list
7294 %ap2 = bitcast %struct.va_list* %ap to i8*
7295 call void @llvm.va_start(i8* %ap2)
7297 ; Read a single integer argument
7298 %tmp = va_arg i8* %ap2, i32
7300 ; Demonstrate usage of llvm.va_copy and llvm.va_end
7302 %aq2 = bitcast i8** %aq to i8*
7303 call void @llvm.va_copy(i8* %aq2, i8* %ap2)
7304 call void @llvm.va_end(i8* %aq2)
7306 ; Stop processing of arguments.
7307 call void @llvm.va_end(i8* %ap2)
7311 declare void @llvm.va_start(i8*)
7312 declare void @llvm.va_copy(i8*, i8*)
7313 declare void @llvm.va_end(i8*)
7317 '``llvm.va_start``' Intrinsic
7318 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7325 declare void @llvm.va_start(i8* <arglist>)
7330 The '``llvm.va_start``' intrinsic initializes ``*<arglist>`` for
7331 subsequent use by ``va_arg``.
7336 The argument is a pointer to a ``va_list`` element to initialize.
7341 The '``llvm.va_start``' intrinsic works just like the ``va_start`` macro
7342 available in C. In a target-dependent way, it initializes the
7343 ``va_list`` element to which the argument points, so that the next call
7344 to ``va_arg`` will produce the first variable argument passed to the
7345 function. Unlike the C ``va_start`` macro, this intrinsic does not need
7346 to know the last argument of the function as the compiler can figure
7349 '``llvm.va_end``' Intrinsic
7350 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
7357 declare void @llvm.va_end(i8* <arglist>)
7362 The '``llvm.va_end``' intrinsic destroys ``*<arglist>``, which has been
7363 initialized previously with ``llvm.va_start`` or ``llvm.va_copy``.
7368 The argument is a pointer to a ``va_list`` to destroy.
7373 The '``llvm.va_end``' intrinsic works just like the ``va_end`` macro
7374 available in C. In a target-dependent way, it destroys the ``va_list``
7375 element to which the argument points. Calls to
7376 :ref:`llvm.va_start <int_va_start>` and
7377 :ref:`llvm.va_copy <int_va_copy>` must be matched exactly with calls to
7382 '``llvm.va_copy``' Intrinsic
7383 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7390 declare void @llvm.va_copy(i8* <destarglist>, i8* <srcarglist>)
7395 The '``llvm.va_copy``' intrinsic copies the current argument position
7396 from the source argument list to the destination argument list.
7401 The first argument is a pointer to a ``va_list`` element to initialize.
7402 The second argument is a pointer to a ``va_list`` element to copy from.
7407 The '``llvm.va_copy``' intrinsic works just like the ``va_copy`` macro
7408 available in C. In a target-dependent way, it copies the source
7409 ``va_list`` element into the destination ``va_list`` element. This
7410 intrinsic is necessary because the `` llvm.va_start`` intrinsic may be
7411 arbitrarily complex and require, for example, memory allocation.
7413 Accurate Garbage Collection Intrinsics
7414 --------------------------------------
7416 LLVM's support for `Accurate Garbage Collection <GarbageCollection.html>`_
7417 (GC) requires the frontend to generate code containing appropriate intrinsic
7418 calls and select an appropriate GC strategy which knows how to lower these
7419 intrinsics in a manner which is appropriate for the target collector.
7421 These intrinsics allow identification of :ref:`GC roots on the
7422 stack <int_gcroot>`, as well as garbage collector implementations that
7423 require :ref:`read <int_gcread>` and :ref:`write <int_gcwrite>` barriers.
7424 Frontends for type-safe garbage collected languages should generate
7425 these intrinsics to make use of the LLVM garbage collectors. For more
7426 details, see `Garbage Collection with LLVM <GarbageCollection.html>`_.
7428 Experimental Statepoint Intrinsics
7429 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7431 LLVM provides an second experimental set of intrinsics for describing garbage
7432 collection safepoints in compiled code. These intrinsics are an alternative
7433 to the ``llvm.gcroot`` intrinsics, but are compatible with the ones for
7434 :ref:`read <int_gcread>` and :ref:`write <int_gcwrite>` barriers. The
7435 differences in approach are covered in the `Garbage Collection with LLVM
7436 <GarbageCollection.html>`_ documentation. The intrinsics themselves are
7437 described in :doc:`Statepoints`.
7441 '``llvm.gcroot``' Intrinsic
7442 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
7449 declare void @llvm.gcroot(i8** %ptrloc, i8* %metadata)
7454 The '``llvm.gcroot``' intrinsic declares the existence of a GC root to
7455 the code generator, and allows some metadata to be associated with it.
7460 The first argument specifies the address of a stack object that contains
7461 the root pointer. The second pointer (which must be either a constant or
7462 a global value address) contains the meta-data to be associated with the
7468 At runtime, a call to this intrinsic stores a null pointer into the
7469 "ptrloc" location. At compile-time, the code generator generates
7470 information to allow the runtime to find the pointer at GC safe points.
7471 The '``llvm.gcroot``' intrinsic may only be used in a function which
7472 :ref:`specifies a GC algorithm <gc>`.
7476 '``llvm.gcread``' Intrinsic
7477 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
7484 declare i8* @llvm.gcread(i8* %ObjPtr, i8** %Ptr)
7489 The '``llvm.gcread``' intrinsic identifies reads of references from heap
7490 locations, allowing garbage collector implementations that require read
7496 The second argument is the address to read from, which should be an
7497 address allocated from the garbage collector. The first object is a
7498 pointer to the start of the referenced object, if needed by the language
7499 runtime (otherwise null).
7504 The '``llvm.gcread``' intrinsic has the same semantics as a load
7505 instruction, but may be replaced with substantially more complex code by
7506 the garbage collector runtime, as needed. The '``llvm.gcread``'
7507 intrinsic may only be used in a function which :ref:`specifies a GC
7512 '``llvm.gcwrite``' Intrinsic
7513 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7520 declare void @llvm.gcwrite(i8* %P1, i8* %Obj, i8** %P2)
7525 The '``llvm.gcwrite``' intrinsic identifies writes of references to heap
7526 locations, allowing garbage collector implementations that require write
7527 barriers (such as generational or reference counting collectors).
7532 The first argument is the reference to store, the second is the start of
7533 the object to store it to, and the third is the address of the field of
7534 Obj to store to. If the runtime does not require a pointer to the
7535 object, Obj may be null.
7540 The '``llvm.gcwrite``' intrinsic has the same semantics as a store
7541 instruction, but may be replaced with substantially more complex code by
7542 the garbage collector runtime, as needed. The '``llvm.gcwrite``'
7543 intrinsic may only be used in a function which :ref:`specifies a GC
7546 Code Generator Intrinsics
7547 -------------------------
7549 These intrinsics are provided by LLVM to expose special features that
7550 may only be implemented with code generator support.
7552 '``llvm.returnaddress``' Intrinsic
7553 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7560 declare i8 *@llvm.returnaddress(i32 <level>)
7565 The '``llvm.returnaddress``' intrinsic attempts to compute a
7566 target-specific value indicating the return address of the current
7567 function or one of its callers.
7572 The argument to this intrinsic indicates which function to return the
7573 address for. Zero indicates the calling function, one indicates its
7574 caller, etc. The argument is **required** to be a constant integer
7580 The '``llvm.returnaddress``' intrinsic either returns a pointer
7581 indicating the return address of the specified call frame, or zero if it
7582 cannot be identified. The value returned by this intrinsic is likely to
7583 be incorrect or 0 for arguments other than zero, so it should only be
7584 used for debugging purposes.
7586 Note that calling this intrinsic does not prevent function inlining or
7587 other aggressive transformations, so the value returned may not be that
7588 of the obvious source-language caller.
7590 '``llvm.frameaddress``' Intrinsic
7591 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7598 declare i8* @llvm.frameaddress(i32 <level>)
7603 The '``llvm.frameaddress``' intrinsic attempts to return the
7604 target-specific frame pointer value for the specified stack frame.
7609 The argument to this intrinsic indicates which function to return the
7610 frame pointer for. Zero indicates the calling function, one indicates
7611 its caller, etc. The argument is **required** to be a constant integer
7617 The '``llvm.frameaddress``' intrinsic either returns a pointer
7618 indicating the frame address of the specified call frame, or zero if it
7619 cannot be identified. The value returned by this intrinsic is likely to
7620 be incorrect or 0 for arguments other than zero, so it should only be
7621 used for debugging purposes.
7623 Note that calling this intrinsic does not prevent function inlining or
7624 other aggressive transformations, so the value returned may not be that
7625 of the obvious source-language caller.
7627 '``llvm.frameescape``' and '``llvm.framerecover``' Intrinsics
7628 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7635 declare void @llvm.frameescape(...)
7636 declare i8* @llvm.framerecover(i8* %func, i8* %fp, i32 %idx)
7641 The '``llvm.frameescape``' intrinsic escapes offsets of a collection of static
7642 allocas, and the '``llvm.framerecover``' intrinsic applies those offsets to a
7643 live frame pointer to recover the address of the allocation. The offset is
7644 computed during frame layout of the caller of ``llvm.frameescape``.
7649 All arguments to '``llvm.frameescape``' must be pointers to static allocas or
7650 casts of static allocas. Each function can only call '``llvm.frameescape``'
7651 once, and it can only do so from the entry block.
7653 The ``func`` argument to '``llvm.framerecover``' must be a constant
7654 bitcasted pointer to a function defined in the current module. The code
7655 generator cannot determine the frame allocation offset of functions defined in
7658 The ``fp`` argument to '``llvm.framerecover``' must be a frame
7659 pointer of a call frame that is currently live. The return value of
7660 '``llvm.frameaddress``' is one way to produce such a value, but most platforms
7661 also expose the frame pointer through stack unwinding mechanisms.
7663 The ``idx`` argument to '``llvm.framerecover``' indicates which alloca passed to
7664 '``llvm.frameescape``' to recover. It is zero-indexed.
7669 These intrinsics allow a group of functions to access one stack memory
7670 allocation in an ancestor stack frame. The memory returned from
7671 '``llvm.frameallocate``' may be allocated prior to stack realignment, so the
7672 memory is only aligned to the ABI-required stack alignment. Each function may
7673 only call '``llvm.frameallocate``' one or zero times from the function entry
7674 block. The frame allocation intrinsic inhibits inlining, as any frame
7675 allocations in the inlined function frame are likely to be at a different
7676 offset from the one used by '``llvm.framerecover``' called with the
7679 .. _int_read_register:
7680 .. _int_write_register:
7682 '``llvm.read_register``' and '``llvm.write_register``' Intrinsics
7683 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7690 declare i32 @llvm.read_register.i32(metadata)
7691 declare i64 @llvm.read_register.i64(metadata)
7692 declare void @llvm.write_register.i32(metadata, i32 @value)
7693 declare void @llvm.write_register.i64(metadata, i64 @value)
7699 The '``llvm.read_register``' and '``llvm.write_register``' intrinsics
7700 provides access to the named register. The register must be valid on
7701 the architecture being compiled to. The type needs to be compatible
7702 with the register being read.
7707 The '``llvm.read_register``' intrinsic returns the current value of the
7708 register, where possible. The '``llvm.write_register``' intrinsic sets
7709 the current value of the register, where possible.
7711 This is useful to implement named register global variables that need
7712 to always be mapped to a specific register, as is common practice on
7713 bare-metal programs including OS kernels.
7715 The compiler doesn't check for register availability or use of the used
7716 register in surrounding code, including inline assembly. Because of that,
7717 allocatable registers are not supported.
7719 Warning: So far it only works with the stack pointer on selected
7720 architectures (ARM, AArch64, PowerPC and x86_64). Significant amount of
7721 work is needed to support other registers and even more so, allocatable
7726 '``llvm.stacksave``' Intrinsic
7727 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7734 declare i8* @llvm.stacksave()
7739 The '``llvm.stacksave``' intrinsic is used to remember the current state
7740 of the function stack, for use with
7741 :ref:`llvm.stackrestore <int_stackrestore>`. This is useful for
7742 implementing language features like scoped automatic variable sized
7748 This intrinsic returns a opaque pointer value that can be passed to
7749 :ref:`llvm.stackrestore <int_stackrestore>`. When an
7750 ``llvm.stackrestore`` intrinsic is executed with a value saved from
7751 ``llvm.stacksave``, it effectively restores the state of the stack to
7752 the state it was in when the ``llvm.stacksave`` intrinsic executed. In
7753 practice, this pops any :ref:`alloca <i_alloca>` blocks from the stack that
7754 were allocated after the ``llvm.stacksave`` was executed.
7756 .. _int_stackrestore:
7758 '``llvm.stackrestore``' Intrinsic
7759 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7766 declare void @llvm.stackrestore(i8* %ptr)
7771 The '``llvm.stackrestore``' intrinsic is used to restore the state of
7772 the function stack to the state it was in when the corresponding
7773 :ref:`llvm.stacksave <int_stacksave>` intrinsic executed. This is
7774 useful for implementing language features like scoped automatic variable
7775 sized arrays in C99.
7780 See the description for :ref:`llvm.stacksave <int_stacksave>`.
7782 '``llvm.prefetch``' Intrinsic
7783 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7790 declare void @llvm.prefetch(i8* <address>, i32 <rw>, i32 <locality>, i32 <cache type>)
7795 The '``llvm.prefetch``' intrinsic is a hint to the code generator to
7796 insert a prefetch instruction if supported; otherwise, it is a noop.
7797 Prefetches have no effect on the behavior of the program but can change
7798 its performance characteristics.
7803 ``address`` is the address to be prefetched, ``rw`` is the specifier
7804 determining if the fetch should be for a read (0) or write (1), and
7805 ``locality`` is a temporal locality specifier ranging from (0) - no
7806 locality, to (3) - extremely local keep in cache. The ``cache type``
7807 specifies whether the prefetch is performed on the data (1) or
7808 instruction (0) cache. The ``rw``, ``locality`` and ``cache type``
7809 arguments must be constant integers.
7814 This intrinsic does not modify the behavior of the program. In
7815 particular, prefetches cannot trap and do not produce a value. On
7816 targets that support this intrinsic, the prefetch can provide hints to
7817 the processor cache for better performance.
7819 '``llvm.pcmarker``' Intrinsic
7820 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7827 declare void @llvm.pcmarker(i32 <id>)
7832 The '``llvm.pcmarker``' intrinsic is a method to export a Program
7833 Counter (PC) in a region of code to simulators and other tools. The
7834 method is target specific, but it is expected that the marker will use
7835 exported symbols to transmit the PC of the marker. The marker makes no
7836 guarantees that it will remain with any specific instruction after
7837 optimizations. It is possible that the presence of a marker will inhibit
7838 optimizations. The intended use is to be inserted after optimizations to
7839 allow correlations of simulation runs.
7844 ``id`` is a numerical id identifying the marker.
7849 This intrinsic does not modify the behavior of the program. Backends
7850 that do not support this intrinsic may ignore it.
7852 '``llvm.readcyclecounter``' Intrinsic
7853 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7860 declare i64 @llvm.readcyclecounter()
7865 The '``llvm.readcyclecounter``' intrinsic provides access to the cycle
7866 counter register (or similar low latency, high accuracy clocks) on those
7867 targets that support it. On X86, it should map to RDTSC. On Alpha, it
7868 should map to RPCC. As the backing counters overflow quickly (on the
7869 order of 9 seconds on alpha), this should only be used for small
7875 When directly supported, reading the cycle counter should not modify any
7876 memory. Implementations are allowed to either return a application
7877 specific value or a system wide value. On backends without support, this
7878 is lowered to a constant 0.
7880 Note that runtime support may be conditional on the privilege-level code is
7881 running at and the host platform.
7883 '``llvm.clear_cache``' Intrinsic
7884 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7891 declare void @llvm.clear_cache(i8*, i8*)
7896 The '``llvm.clear_cache``' intrinsic ensures visibility of modifications
7897 in the specified range to the execution unit of the processor. On
7898 targets with non-unified instruction and data cache, the implementation
7899 flushes the instruction cache.
7904 On platforms with coherent instruction and data caches (e.g. x86), this
7905 intrinsic is a nop. On platforms with non-coherent instruction and data
7906 cache (e.g. ARM, MIPS), the intrinsic is lowered either to appropriate
7907 instructions or a system call, if cache flushing requires special
7910 The default behavior is to emit a call to ``__clear_cache`` from the run
7913 This instrinsic does *not* empty the instruction pipeline. Modifications
7914 of the current function are outside the scope of the intrinsic.
7916 '``llvm.instrprof_increment``' Intrinsic
7917 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7924 declare void @llvm.instrprof_increment(i8* <name>, i64 <hash>,
7925 i32 <num-counters>, i32 <index>)
7930 The '``llvm.instrprof_increment``' intrinsic can be emitted by a
7931 frontend for use with instrumentation based profiling. These will be
7932 lowered by the ``-instrprof`` pass to generate execution counts of a
7938 The first argument is a pointer to a global variable containing the
7939 name of the entity being instrumented. This should generally be the
7940 (mangled) function name for a set of counters.
7942 The second argument is a hash value that can be used by the consumer
7943 of the profile data to detect changes to the instrumented source, and
7944 the third is the number of counters associated with ``name``. It is an
7945 error if ``hash`` or ``num-counters`` differ between two instances of
7946 ``instrprof_increment`` that refer to the same name.
7948 The last argument refers to which of the counters for ``name`` should
7949 be incremented. It should be a value between 0 and ``num-counters``.
7954 This intrinsic represents an increment of a profiling counter. It will
7955 cause the ``-instrprof`` pass to generate the appropriate data
7956 structures and the code to increment the appropriate value, in a
7957 format that can be written out by a compiler runtime and consumed via
7958 the ``llvm-profdata`` tool.
7960 Standard C Library Intrinsics
7961 -----------------------------
7963 LLVM provides intrinsics for a few important standard C library
7964 functions. These intrinsics allow source-language front-ends to pass
7965 information about the alignment of the pointer arguments to the code
7966 generator, providing opportunity for more efficient code generation.
7970 '``llvm.memcpy``' Intrinsic
7971 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
7976 This is an overloaded intrinsic. You can use ``llvm.memcpy`` on any
7977 integer bit width and for different address spaces. Not all targets
7978 support all bit widths however.
7982 declare void @llvm.memcpy.p0i8.p0i8.i32(i8* <dest>, i8* <src>,
7983 i32 <len>, i32 <align>, i1 <isvolatile>)
7984 declare void @llvm.memcpy.p0i8.p0i8.i64(i8* <dest>, i8* <src>,
7985 i64 <len>, i32 <align>, i1 <isvolatile>)
7990 The '``llvm.memcpy.*``' intrinsics copy a block of memory from the
7991 source location to the destination location.
7993 Note that, unlike the standard libc function, the ``llvm.memcpy.*``
7994 intrinsics do not return a value, takes extra alignment/isvolatile
7995 arguments and the pointers can be in specified address spaces.
8000 The first argument is a pointer to the destination, the second is a
8001 pointer to the source. The third argument is an integer argument
8002 specifying the number of bytes to copy, the fourth argument is the
8003 alignment of the source and destination locations, and the fifth is a
8004 boolean indicating a volatile access.
8006 If the call to this intrinsic has an alignment value that is not 0 or 1,
8007 then the caller guarantees that both the source and destination pointers
8008 are aligned to that boundary.
8010 If the ``isvolatile`` parameter is ``true``, the ``llvm.memcpy`` call is
8011 a :ref:`volatile operation <volatile>`. The detailed access behavior is not
8012 very cleanly specified and it is unwise to depend on it.
8017 The '``llvm.memcpy.*``' intrinsics copy a block of memory from the
8018 source location to the destination location, which are not allowed to
8019 overlap. It copies "len" bytes of memory over. If the argument is known
8020 to be aligned to some boundary, this can be specified as the fourth
8021 argument, otherwise it should be set to 0 or 1 (both meaning no alignment).
8023 '``llvm.memmove``' Intrinsic
8024 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
8029 This is an overloaded intrinsic. You can use llvm.memmove on any integer
8030 bit width and for different address space. Not all targets support all
8035 declare void @llvm.memmove.p0i8.p0i8.i32(i8* <dest>, i8* <src>,
8036 i32 <len>, i32 <align>, i1 <isvolatile>)
8037 declare void @llvm.memmove.p0i8.p0i8.i64(i8* <dest>, i8* <src>,
8038 i64 <len>, i32 <align>, i1 <isvolatile>)
8043 The '``llvm.memmove.*``' intrinsics move a block of memory from the
8044 source location to the destination location. It is similar to the
8045 '``llvm.memcpy``' intrinsic but allows the two memory locations to
8048 Note that, unlike the standard libc function, the ``llvm.memmove.*``
8049 intrinsics do not return a value, takes extra alignment/isvolatile
8050 arguments and the pointers can be in specified address spaces.
8055 The first argument is a pointer to the destination, the second is a
8056 pointer to the source. The third argument is an integer argument
8057 specifying the number of bytes to copy, the fourth argument is the
8058 alignment of the source and destination locations, and the fifth is a
8059 boolean indicating a volatile access.
8061 If the call to this intrinsic has an alignment value that is not 0 or 1,
8062 then the caller guarantees that the source and destination pointers are
8063 aligned to that boundary.
8065 If the ``isvolatile`` parameter is ``true``, the ``llvm.memmove`` call
8066 is a :ref:`volatile operation <volatile>`. The detailed access behavior is
8067 not very cleanly specified and it is unwise to depend on it.
8072 The '``llvm.memmove.*``' intrinsics copy a block of memory from the
8073 source location to the destination location, which may overlap. It
8074 copies "len" bytes of memory over. If the argument is known to be
8075 aligned to some boundary, this can be specified as the fourth argument,
8076 otherwise it should be set to 0 or 1 (both meaning no alignment).
8078 '``llvm.memset.*``' Intrinsics
8079 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
8084 This is an overloaded intrinsic. You can use llvm.memset on any integer
8085 bit width and for different address spaces. However, not all targets
8086 support all bit widths.
8090 declare void @llvm.memset.p0i8.i32(i8* <dest>, i8 <val>,
8091 i32 <len>, i32 <align>, i1 <isvolatile>)
8092 declare void @llvm.memset.p0i8.i64(i8* <dest>, i8 <val>,
8093 i64 <len>, i32 <align>, i1 <isvolatile>)
8098 The '``llvm.memset.*``' intrinsics fill a block of memory with a
8099 particular byte value.
8101 Note that, unlike the standard libc function, the ``llvm.memset``
8102 intrinsic does not return a value and takes extra alignment/volatile
8103 arguments. Also, the destination can be in an arbitrary address space.
8108 The first argument is a pointer to the destination to fill, the second
8109 is the byte value with which to fill it, the third argument is an
8110 integer argument specifying the number of bytes to fill, and the fourth
8111 argument is the known alignment of the destination location.
8113 If the call to this intrinsic has an alignment value that is not 0 or 1,
8114 then the caller guarantees that the destination pointer is aligned to
8117 If the ``isvolatile`` parameter is ``true``, the ``llvm.memset`` call is
8118 a :ref:`volatile operation <volatile>`. The detailed access behavior is not
8119 very cleanly specified and it is unwise to depend on it.
8124 The '``llvm.memset.*``' intrinsics fill "len" bytes of memory starting
8125 at the destination location. If the argument is known to be aligned to
8126 some boundary, this can be specified as the fourth argument, otherwise
8127 it should be set to 0 or 1 (both meaning no alignment).
8129 '``llvm.sqrt.*``' Intrinsic
8130 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
8135 This is an overloaded intrinsic. You can use ``llvm.sqrt`` on any
8136 floating point or vector of floating point type. Not all targets support
8141 declare float @llvm.sqrt.f32(float %Val)
8142 declare double @llvm.sqrt.f64(double %Val)
8143 declare x86_fp80 @llvm.sqrt.f80(x86_fp80 %Val)
8144 declare fp128 @llvm.sqrt.f128(fp128 %Val)
8145 declare ppc_fp128 @llvm.sqrt.ppcf128(ppc_fp128 %Val)
8150 The '``llvm.sqrt``' intrinsics return the sqrt of the specified operand,
8151 returning the same value as the libm '``sqrt``' functions would. Unlike
8152 ``sqrt`` in libm, however, ``llvm.sqrt`` has undefined behavior for
8153 negative numbers other than -0.0 (which allows for better optimization,
8154 because there is no need to worry about errno being set).
8155 ``llvm.sqrt(-0.0)`` is defined to return -0.0 like IEEE sqrt.
8160 The argument and return value are floating point numbers of the same
8166 This function returns the sqrt of the specified operand if it is a
8167 nonnegative floating point number.
8169 '``llvm.powi.*``' Intrinsic
8170 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
8175 This is an overloaded intrinsic. You can use ``llvm.powi`` on any
8176 floating point or vector of floating point type. Not all targets support
8181 declare float @llvm.powi.f32(float %Val, i32 %power)
8182 declare double @llvm.powi.f64(double %Val, i32 %power)
8183 declare x86_fp80 @llvm.powi.f80(x86_fp80 %Val, i32 %power)
8184 declare fp128 @llvm.powi.f128(fp128 %Val, i32 %power)
8185 declare ppc_fp128 @llvm.powi.ppcf128(ppc_fp128 %Val, i32 %power)
8190 The '``llvm.powi.*``' intrinsics return the first operand raised to the
8191 specified (positive or negative) power. The order of evaluation of
8192 multiplications is not defined. When a vector of floating point type is
8193 used, the second argument remains a scalar integer value.
8198 The second argument is an integer power, and the first is a value to
8199 raise to that power.
8204 This function returns the first value raised to the second power with an
8205 unspecified sequence of rounding operations.
8207 '``llvm.sin.*``' Intrinsic
8208 ^^^^^^^^^^^^^^^^^^^^^^^^^^
8213 This is an overloaded intrinsic. You can use ``llvm.sin`` on any
8214 floating point or vector of floating point type. Not all targets support
8219 declare float @llvm.sin.f32(float %Val)
8220 declare double @llvm.sin.f64(double %Val)
8221 declare x86_fp80 @llvm.sin.f80(x86_fp80 %Val)
8222 declare fp128 @llvm.sin.f128(fp128 %Val)
8223 declare ppc_fp128 @llvm.sin.ppcf128(ppc_fp128 %Val)
8228 The '``llvm.sin.*``' intrinsics return the sine of the operand.
8233 The argument and return value are floating point numbers of the same
8239 This function returns the sine of the specified operand, returning the
8240 same values as the libm ``sin`` functions would, and handles error
8241 conditions in the same way.
8243 '``llvm.cos.*``' Intrinsic
8244 ^^^^^^^^^^^^^^^^^^^^^^^^^^
8249 This is an overloaded intrinsic. You can use ``llvm.cos`` on any
8250 floating point or vector of floating point type. Not all targets support
8255 declare float @llvm.cos.f32(float %Val)
8256 declare double @llvm.cos.f64(double %Val)
8257 declare x86_fp80 @llvm.cos.f80(x86_fp80 %Val)
8258 declare fp128 @llvm.cos.f128(fp128 %Val)
8259 declare ppc_fp128 @llvm.cos.ppcf128(ppc_fp128 %Val)
8264 The '``llvm.cos.*``' intrinsics return the cosine of the operand.
8269 The argument and return value are floating point numbers of the same
8275 This function returns the cosine of the specified operand, returning the
8276 same values as the libm ``cos`` functions would, and handles error
8277 conditions in the same way.
8279 '``llvm.pow.*``' Intrinsic
8280 ^^^^^^^^^^^^^^^^^^^^^^^^^^
8285 This is an overloaded intrinsic. You can use ``llvm.pow`` on any
8286 floating point or vector of floating point type. Not all targets support
8291 declare float @llvm.pow.f32(float %Val, float %Power)
8292 declare double @llvm.pow.f64(double %Val, double %Power)
8293 declare x86_fp80 @llvm.pow.f80(x86_fp80 %Val, x86_fp80 %Power)
8294 declare fp128 @llvm.pow.f128(fp128 %Val, fp128 %Power)
8295 declare ppc_fp128 @llvm.pow.ppcf128(ppc_fp128 %Val, ppc_fp128 Power)
8300 The '``llvm.pow.*``' intrinsics return the first operand raised to the
8301 specified (positive or negative) power.
8306 The second argument is a floating point power, and the first is a value
8307 to raise to that power.
8312 This function returns the first value raised to the second power,
8313 returning the same values as the libm ``pow`` functions would, and
8314 handles error conditions in the same way.
8316 '``llvm.exp.*``' Intrinsic
8317 ^^^^^^^^^^^^^^^^^^^^^^^^^^
8322 This is an overloaded intrinsic. You can use ``llvm.exp`` on any
8323 floating point or vector of floating point type. Not all targets support
8328 declare float @llvm.exp.f32(float %Val)
8329 declare double @llvm.exp.f64(double %Val)
8330 declare x86_fp80 @llvm.exp.f80(x86_fp80 %Val)
8331 declare fp128 @llvm.exp.f128(fp128 %Val)
8332 declare ppc_fp128 @llvm.exp.ppcf128(ppc_fp128 %Val)
8337 The '``llvm.exp.*``' intrinsics perform the exp function.
8342 The argument and return value are floating point numbers of the same
8348 This function returns the same values as the libm ``exp`` functions
8349 would, and handles error conditions in the same way.
8351 '``llvm.exp2.*``' Intrinsic
8352 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
8357 This is an overloaded intrinsic. You can use ``llvm.exp2`` on any
8358 floating point or vector of floating point type. Not all targets support
8363 declare float @llvm.exp2.f32(float %Val)
8364 declare double @llvm.exp2.f64(double %Val)
8365 declare x86_fp80 @llvm.exp2.f80(x86_fp80 %Val)
8366 declare fp128 @llvm.exp2.f128(fp128 %Val)
8367 declare ppc_fp128 @llvm.exp2.ppcf128(ppc_fp128 %Val)
8372 The '``llvm.exp2.*``' intrinsics perform the exp2 function.
8377 The argument and return value are floating point numbers of the same
8383 This function returns the same values as the libm ``exp2`` functions
8384 would, and handles error conditions in the same way.
8386 '``llvm.log.*``' Intrinsic
8387 ^^^^^^^^^^^^^^^^^^^^^^^^^^
8392 This is an overloaded intrinsic. You can use ``llvm.log`` on any
8393 floating point or vector of floating point type. Not all targets support
8398 declare float @llvm.log.f32(float %Val)
8399 declare double @llvm.log.f64(double %Val)
8400 declare x86_fp80 @llvm.log.f80(x86_fp80 %Val)
8401 declare fp128 @llvm.log.f128(fp128 %Val)
8402 declare ppc_fp128 @llvm.log.ppcf128(ppc_fp128 %Val)
8407 The '``llvm.log.*``' intrinsics perform the log function.
8412 The argument and return value are floating point numbers of the same
8418 This function returns the same values as the libm ``log`` functions
8419 would, and handles error conditions in the same way.
8421 '``llvm.log10.*``' Intrinsic
8422 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
8427 This is an overloaded intrinsic. You can use ``llvm.log10`` on any
8428 floating point or vector of floating point type. Not all targets support
8433 declare float @llvm.log10.f32(float %Val)
8434 declare double @llvm.log10.f64(double %Val)
8435 declare x86_fp80 @llvm.log10.f80(x86_fp80 %Val)
8436 declare fp128 @llvm.log10.f128(fp128 %Val)
8437 declare ppc_fp128 @llvm.log10.ppcf128(ppc_fp128 %Val)
8442 The '``llvm.log10.*``' intrinsics perform the log10 function.
8447 The argument and return value are floating point numbers of the same
8453 This function returns the same values as the libm ``log10`` functions
8454 would, and handles error conditions in the same way.
8456 '``llvm.log2.*``' Intrinsic
8457 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
8462 This is an overloaded intrinsic. You can use ``llvm.log2`` on any
8463 floating point or vector of floating point type. Not all targets support
8468 declare float @llvm.log2.f32(float %Val)
8469 declare double @llvm.log2.f64(double %Val)
8470 declare x86_fp80 @llvm.log2.f80(x86_fp80 %Val)
8471 declare fp128 @llvm.log2.f128(fp128 %Val)
8472 declare ppc_fp128 @llvm.log2.ppcf128(ppc_fp128 %Val)
8477 The '``llvm.log2.*``' intrinsics perform the log2 function.
8482 The argument and return value are floating point numbers of the same
8488 This function returns the same values as the libm ``log2`` functions
8489 would, and handles error conditions in the same way.
8491 '``llvm.fma.*``' Intrinsic
8492 ^^^^^^^^^^^^^^^^^^^^^^^^^^
8497 This is an overloaded intrinsic. You can use ``llvm.fma`` on any
8498 floating point or vector of floating point type. Not all targets support
8503 declare float @llvm.fma.f32(float %a, float %b, float %c)
8504 declare double @llvm.fma.f64(double %a, double %b, double %c)
8505 declare x86_fp80 @llvm.fma.f80(x86_fp80 %a, x86_fp80 %b, x86_fp80 %c)
8506 declare fp128 @llvm.fma.f128(fp128 %a, fp128 %b, fp128 %c)
8507 declare ppc_fp128 @llvm.fma.ppcf128(ppc_fp128 %a, ppc_fp128 %b, ppc_fp128 %c)
8512 The '``llvm.fma.*``' intrinsics perform the fused multiply-add
8518 The argument and return value are floating point numbers of the same
8524 This function returns the same values as the libm ``fma`` functions
8525 would, and does not set errno.
8527 '``llvm.fabs.*``' Intrinsic
8528 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
8533 This is an overloaded intrinsic. You can use ``llvm.fabs`` on any
8534 floating point or vector of floating point type. Not all targets support
8539 declare float @llvm.fabs.f32(float %Val)
8540 declare double @llvm.fabs.f64(double %Val)
8541 declare x86_fp80 @llvm.fabs.f80(x86_fp80 %Val)
8542 declare fp128 @llvm.fabs.f128(fp128 %Val)
8543 declare ppc_fp128 @llvm.fabs.ppcf128(ppc_fp128 %Val)
8548 The '``llvm.fabs.*``' intrinsics return the absolute value of the
8554 The argument and return value are floating point numbers of the same
8560 This function returns the same values as the libm ``fabs`` functions
8561 would, and handles error conditions in the same way.
8563 '``llvm.minnum.*``' Intrinsic
8564 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
8569 This is an overloaded intrinsic. You can use ``llvm.minnum`` on any
8570 floating point or vector of floating point type. Not all targets support
8575 declare float @llvm.minnum.f32(float %Val0, float %Val1)
8576 declare double @llvm.minnum.f64(double %Val0, double %Val1)
8577 declare x86_fp80 @llvm.minnum.f80(x86_fp80 %Val0, x86_fp80 %Val1)
8578 declare fp128 @llvm.minnum.f128(fp128 %Val0, fp128 %Val1)
8579 declare ppc_fp128 @llvm.minnum.ppcf128(ppc_fp128 %Val0, ppc_fp128 %Val1)
8584 The '``llvm.minnum.*``' intrinsics return the minimum of the two
8591 The arguments and return value are floating point numbers of the same
8597 Follows the IEEE-754 semantics for minNum, which also match for libm's
8600 If either operand is a NaN, returns the other non-NaN operand. Returns
8601 NaN only if both operands are NaN. If the operands compare equal,
8602 returns a value that compares equal to both operands. This means that
8603 fmin(+/-0.0, +/-0.0) could return either -0.0 or 0.0.
8605 '``llvm.maxnum.*``' Intrinsic
8606 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
8611 This is an overloaded intrinsic. You can use ``llvm.maxnum`` on any
8612 floating point or vector of floating point type. Not all targets support
8617 declare float @llvm.maxnum.f32(float %Val0, float %Val1l)
8618 declare double @llvm.maxnum.f64(double %Val0, double %Val1)
8619 declare x86_fp80 @llvm.maxnum.f80(x86_fp80 %Val0, x86_fp80 %Val1)
8620 declare fp128 @llvm.maxnum.f128(fp128 %Val0, fp128 %Val1)
8621 declare ppc_fp128 @llvm.maxnum.ppcf128(ppc_fp128 %Val0, ppc_fp128 %Val1)
8626 The '``llvm.maxnum.*``' intrinsics return the maximum of the two
8633 The arguments and return value are floating point numbers of the same
8638 Follows the IEEE-754 semantics for maxNum, which also match for libm's
8641 If either operand is a NaN, returns the other non-NaN operand. Returns
8642 NaN only if both operands are NaN. If the operands compare equal,
8643 returns a value that compares equal to both operands. This means that
8644 fmax(+/-0.0, +/-0.0) could return either -0.0 or 0.0.
8646 '``llvm.copysign.*``' Intrinsic
8647 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
8652 This is an overloaded intrinsic. You can use ``llvm.copysign`` on any
8653 floating point or vector of floating point type. Not all targets support
8658 declare float @llvm.copysign.f32(float %Mag, float %Sgn)
8659 declare double @llvm.copysign.f64(double %Mag, double %Sgn)
8660 declare x86_fp80 @llvm.copysign.f80(x86_fp80 %Mag, x86_fp80 %Sgn)
8661 declare fp128 @llvm.copysign.f128(fp128 %Mag, fp128 %Sgn)
8662 declare ppc_fp128 @llvm.copysign.ppcf128(ppc_fp128 %Mag, ppc_fp128 %Sgn)
8667 The '``llvm.copysign.*``' intrinsics return a value with the magnitude of the
8668 first operand and the sign of the second operand.
8673 The arguments and return value are floating point numbers of the same
8679 This function returns the same values as the libm ``copysign``
8680 functions would, and handles error conditions in the same way.
8682 '``llvm.floor.*``' Intrinsic
8683 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
8688 This is an overloaded intrinsic. You can use ``llvm.floor`` on any
8689 floating point or vector of floating point type. Not all targets support
8694 declare float @llvm.floor.f32(float %Val)
8695 declare double @llvm.floor.f64(double %Val)
8696 declare x86_fp80 @llvm.floor.f80(x86_fp80 %Val)
8697 declare fp128 @llvm.floor.f128(fp128 %Val)
8698 declare ppc_fp128 @llvm.floor.ppcf128(ppc_fp128 %Val)
8703 The '``llvm.floor.*``' intrinsics return the floor of the operand.
8708 The argument and return value are floating point numbers of the same
8714 This function returns the same values as the libm ``floor`` functions
8715 would, and handles error conditions in the same way.
8717 '``llvm.ceil.*``' Intrinsic
8718 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
8723 This is an overloaded intrinsic. You can use ``llvm.ceil`` on any
8724 floating point or vector of floating point type. Not all targets support
8729 declare float @llvm.ceil.f32(float %Val)
8730 declare double @llvm.ceil.f64(double %Val)
8731 declare x86_fp80 @llvm.ceil.f80(x86_fp80 %Val)
8732 declare fp128 @llvm.ceil.f128(fp128 %Val)
8733 declare ppc_fp128 @llvm.ceil.ppcf128(ppc_fp128 %Val)
8738 The '``llvm.ceil.*``' intrinsics return the ceiling of the operand.
8743 The argument and return value are floating point numbers of the same
8749 This function returns the same values as the libm ``ceil`` functions
8750 would, and handles error conditions in the same way.
8752 '``llvm.trunc.*``' Intrinsic
8753 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
8758 This is an overloaded intrinsic. You can use ``llvm.trunc`` on any
8759 floating point or vector of floating point type. Not all targets support
8764 declare float @llvm.trunc.f32(float %Val)
8765 declare double @llvm.trunc.f64(double %Val)
8766 declare x86_fp80 @llvm.trunc.f80(x86_fp80 %Val)
8767 declare fp128 @llvm.trunc.f128(fp128 %Val)
8768 declare ppc_fp128 @llvm.trunc.ppcf128(ppc_fp128 %Val)
8773 The '``llvm.trunc.*``' intrinsics returns the operand rounded to the
8774 nearest integer not larger in magnitude than the operand.
8779 The argument and return value are floating point numbers of the same
8785 This function returns the same values as the libm ``trunc`` functions
8786 would, and handles error conditions in the same way.
8788 '``llvm.rint.*``' Intrinsic
8789 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
8794 This is an overloaded intrinsic. You can use ``llvm.rint`` on any
8795 floating point or vector of floating point type. Not all targets support
8800 declare float @llvm.rint.f32(float %Val)
8801 declare double @llvm.rint.f64(double %Val)
8802 declare x86_fp80 @llvm.rint.f80(x86_fp80 %Val)
8803 declare fp128 @llvm.rint.f128(fp128 %Val)
8804 declare ppc_fp128 @llvm.rint.ppcf128(ppc_fp128 %Val)
8809 The '``llvm.rint.*``' intrinsics returns the operand rounded to the
8810 nearest integer. It may raise an inexact floating-point exception if the
8811 operand isn't an integer.
8816 The argument and return value are floating point numbers of the same
8822 This function returns the same values as the libm ``rint`` functions
8823 would, and handles error conditions in the same way.
8825 '``llvm.nearbyint.*``' Intrinsic
8826 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
8831 This is an overloaded intrinsic. You can use ``llvm.nearbyint`` on any
8832 floating point or vector of floating point type. Not all targets support
8837 declare float @llvm.nearbyint.f32(float %Val)
8838 declare double @llvm.nearbyint.f64(double %Val)
8839 declare x86_fp80 @llvm.nearbyint.f80(x86_fp80 %Val)
8840 declare fp128 @llvm.nearbyint.f128(fp128 %Val)
8841 declare ppc_fp128 @llvm.nearbyint.ppcf128(ppc_fp128 %Val)
8846 The '``llvm.nearbyint.*``' intrinsics returns the operand rounded to the
8852 The argument and return value are floating point numbers of the same
8858 This function returns the same values as the libm ``nearbyint``
8859 functions would, and handles error conditions in the same way.
8861 '``llvm.round.*``' Intrinsic
8862 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
8867 This is an overloaded intrinsic. You can use ``llvm.round`` on any
8868 floating point or vector of floating point type. Not all targets support
8873 declare float @llvm.round.f32(float %Val)
8874 declare double @llvm.round.f64(double %Val)
8875 declare x86_fp80 @llvm.round.f80(x86_fp80 %Val)
8876 declare fp128 @llvm.round.f128(fp128 %Val)
8877 declare ppc_fp128 @llvm.round.ppcf128(ppc_fp128 %Val)
8882 The '``llvm.round.*``' intrinsics returns the operand rounded to the
8888 The argument and return value are floating point numbers of the same
8894 This function returns the same values as the libm ``round``
8895 functions would, and handles error conditions in the same way.
8897 Bit Manipulation Intrinsics
8898 ---------------------------
8900 LLVM provides intrinsics for a few important bit manipulation
8901 operations. These allow efficient code generation for some algorithms.
8903 '``llvm.bswap.*``' Intrinsics
8904 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
8909 This is an overloaded intrinsic function. You can use bswap on any
8910 integer type that is an even number of bytes (i.e. BitWidth % 16 == 0).
8914 declare i16 @llvm.bswap.i16(i16 <id>)
8915 declare i32 @llvm.bswap.i32(i32 <id>)
8916 declare i64 @llvm.bswap.i64(i64 <id>)
8921 The '``llvm.bswap``' family of intrinsics is used to byte swap integer
8922 values with an even number of bytes (positive multiple of 16 bits).
8923 These are useful for performing operations on data that is not in the
8924 target's native byte order.
8929 The ``llvm.bswap.i16`` intrinsic returns an i16 value that has the high
8930 and low byte of the input i16 swapped. Similarly, the ``llvm.bswap.i32``
8931 intrinsic returns an i32 value that has the four bytes of the input i32
8932 swapped, so that if the input bytes are numbered 0, 1, 2, 3 then the
8933 returned i32 will have its bytes in 3, 2, 1, 0 order. The
8934 ``llvm.bswap.i48``, ``llvm.bswap.i64`` and other intrinsics extend this
8935 concept to additional even-byte lengths (6 bytes, 8 bytes and more,
8938 '``llvm.ctpop.*``' Intrinsic
8939 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
8944 This is an overloaded intrinsic. You can use llvm.ctpop on any integer
8945 bit width, or on any vector with integer elements. Not all targets
8946 support all bit widths or vector types, however.
8950 declare i8 @llvm.ctpop.i8(i8 <src>)
8951 declare i16 @llvm.ctpop.i16(i16 <src>)
8952 declare i32 @llvm.ctpop.i32(i32 <src>)
8953 declare i64 @llvm.ctpop.i64(i64 <src>)
8954 declare i256 @llvm.ctpop.i256(i256 <src>)
8955 declare <2 x i32> @llvm.ctpop.v2i32(<2 x i32> <src>)
8960 The '``llvm.ctpop``' family of intrinsics counts the number of bits set
8966 The only argument is the value to be counted. The argument may be of any
8967 integer type, or a vector with integer elements. The return type must
8968 match the argument type.
8973 The '``llvm.ctpop``' intrinsic counts the 1's in a variable, or within
8974 each element of a vector.
8976 '``llvm.ctlz.*``' Intrinsic
8977 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
8982 This is an overloaded intrinsic. You can use ``llvm.ctlz`` on any
8983 integer bit width, or any vector whose elements are integers. Not all
8984 targets support all bit widths or vector types, however.
8988 declare i8 @llvm.ctlz.i8 (i8 <src>, i1 <is_zero_undef>)
8989 declare i16 @llvm.ctlz.i16 (i16 <src>, i1 <is_zero_undef>)
8990 declare i32 @llvm.ctlz.i32 (i32 <src>, i1 <is_zero_undef>)
8991 declare i64 @llvm.ctlz.i64 (i64 <src>, i1 <is_zero_undef>)
8992 declare i256 @llvm.ctlz.i256(i256 <src>, i1 <is_zero_undef>)
8993 declase <2 x i32> @llvm.ctlz.v2i32(<2 x i32> <src>, i1 <is_zero_undef>)
8998 The '``llvm.ctlz``' family of intrinsic functions counts the number of
8999 leading zeros in a variable.
9004 The first argument is the value to be counted. This argument may be of
9005 any integer type, or a vector with integer element type. The return
9006 type must match the first argument type.
9008 The second argument must be a constant and is a flag to indicate whether
9009 the intrinsic should ensure that a zero as the first argument produces a
9010 defined result. Historically some architectures did not provide a
9011 defined result for zero values as efficiently, and many algorithms are
9012 now predicated on avoiding zero-value inputs.
9017 The '``llvm.ctlz``' intrinsic counts the leading (most significant)
9018 zeros in a variable, or within each element of the vector. If
9019 ``src == 0`` then the result is the size in bits of the type of ``src``
9020 if ``is_zero_undef == 0`` and ``undef`` otherwise. For example,
9021 ``llvm.ctlz(i32 2) = 30``.
9023 '``llvm.cttz.*``' Intrinsic
9024 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
9029 This is an overloaded intrinsic. You can use ``llvm.cttz`` on any
9030 integer bit width, or any vector of integer elements. Not all targets
9031 support all bit widths or vector types, however.
9035 declare i8 @llvm.cttz.i8 (i8 <src>, i1 <is_zero_undef>)
9036 declare i16 @llvm.cttz.i16 (i16 <src>, i1 <is_zero_undef>)
9037 declare i32 @llvm.cttz.i32 (i32 <src>, i1 <is_zero_undef>)
9038 declare i64 @llvm.cttz.i64 (i64 <src>, i1 <is_zero_undef>)
9039 declare i256 @llvm.cttz.i256(i256 <src>, i1 <is_zero_undef>)
9040 declase <2 x i32> @llvm.cttz.v2i32(<2 x i32> <src>, i1 <is_zero_undef>)
9045 The '``llvm.cttz``' family of intrinsic functions counts the number of
9051 The first argument is the value to be counted. This argument may be of
9052 any integer type, or a vector with integer element type. The return
9053 type must match the first argument type.
9055 The second argument must be a constant and is a flag to indicate whether
9056 the intrinsic should ensure that a zero as the first argument produces a
9057 defined result. Historically some architectures did not provide a
9058 defined result for zero values as efficiently, and many algorithms are
9059 now predicated on avoiding zero-value inputs.
9064 The '``llvm.cttz``' intrinsic counts the trailing (least significant)
9065 zeros in a variable, or within each element of a vector. If ``src == 0``
9066 then the result is the size in bits of the type of ``src`` if
9067 ``is_zero_undef == 0`` and ``undef`` otherwise. For example,
9068 ``llvm.cttz(2) = 1``.
9072 Arithmetic with Overflow Intrinsics
9073 -----------------------------------
9075 LLVM provides intrinsics for some arithmetic with overflow operations.
9077 '``llvm.sadd.with.overflow.*``' Intrinsics
9078 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9083 This is an overloaded intrinsic. You can use ``llvm.sadd.with.overflow``
9084 on any integer bit width.
9088 declare {i16, i1} @llvm.sadd.with.overflow.i16(i16 %a, i16 %b)
9089 declare {i32, i1} @llvm.sadd.with.overflow.i32(i32 %a, i32 %b)
9090 declare {i64, i1} @llvm.sadd.with.overflow.i64(i64 %a, i64 %b)
9095 The '``llvm.sadd.with.overflow``' family of intrinsic functions perform
9096 a signed addition of the two arguments, and indicate whether an overflow
9097 occurred during the signed summation.
9102 The arguments (%a and %b) and the first element of the result structure
9103 may be of integer types of any bit width, but they must have the same
9104 bit width. The second element of the result structure must be of type
9105 ``i1``. ``%a`` and ``%b`` are the two values that will undergo signed
9111 The '``llvm.sadd.with.overflow``' family of intrinsic functions perform
9112 a signed addition of the two variables. They return a structure --- the
9113 first element of which is the signed summation, and the second element
9114 of which is a bit specifying if the signed summation resulted in an
9120 .. code-block:: llvm
9122 %res = call {i32, i1} @llvm.sadd.with.overflow.i32(i32 %a, i32 %b)
9123 %sum = extractvalue {i32, i1} %res, 0
9124 %obit = extractvalue {i32, i1} %res, 1
9125 br i1 %obit, label %overflow, label %normal
9127 '``llvm.uadd.with.overflow.*``' Intrinsics
9128 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9133 This is an overloaded intrinsic. You can use ``llvm.uadd.with.overflow``
9134 on any integer bit width.
9138 declare {i16, i1} @llvm.uadd.with.overflow.i16(i16 %a, i16 %b)
9139 declare {i32, i1} @llvm.uadd.with.overflow.i32(i32 %a, i32 %b)
9140 declare {i64, i1} @llvm.uadd.with.overflow.i64(i64 %a, i64 %b)
9145 The '``llvm.uadd.with.overflow``' family of intrinsic functions perform
9146 an unsigned addition of the two arguments, and indicate whether a carry
9147 occurred during the unsigned summation.
9152 The arguments (%a and %b) and the first element of the result structure
9153 may be of integer types of any bit width, but they must have the same
9154 bit width. The second element of the result structure must be of type
9155 ``i1``. ``%a`` and ``%b`` are the two values that will undergo unsigned
9161 The '``llvm.uadd.with.overflow``' family of intrinsic functions perform
9162 an unsigned addition of the two arguments. They return a structure --- the
9163 first element of which is the sum, and the second element of which is a
9164 bit specifying if the unsigned summation resulted in a carry.
9169 .. code-block:: llvm
9171 %res = call {i32, i1} @llvm.uadd.with.overflow.i32(i32 %a, i32 %b)
9172 %sum = extractvalue {i32, i1} %res, 0
9173 %obit = extractvalue {i32, i1} %res, 1
9174 br i1 %obit, label %carry, label %normal
9176 '``llvm.ssub.with.overflow.*``' Intrinsics
9177 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9182 This is an overloaded intrinsic. You can use ``llvm.ssub.with.overflow``
9183 on any integer bit width.
9187 declare {i16, i1} @llvm.ssub.with.overflow.i16(i16 %a, i16 %b)
9188 declare {i32, i1} @llvm.ssub.with.overflow.i32(i32 %a, i32 %b)
9189 declare {i64, i1} @llvm.ssub.with.overflow.i64(i64 %a, i64 %b)
9194 The '``llvm.ssub.with.overflow``' family of intrinsic functions perform
9195 a signed subtraction of the two arguments, and indicate whether an
9196 overflow occurred during the signed subtraction.
9201 The arguments (%a and %b) and the first element of the result structure
9202 may be of integer types of any bit width, but they must have the same
9203 bit width. The second element of the result structure must be of type
9204 ``i1``. ``%a`` and ``%b`` are the two values that will undergo signed
9210 The '``llvm.ssub.with.overflow``' family of intrinsic functions perform
9211 a signed subtraction of the two arguments. They return a structure --- the
9212 first element of which is the subtraction, and the second element of
9213 which is a bit specifying if the signed subtraction resulted in an
9219 .. code-block:: llvm
9221 %res = call {i32, i1} @llvm.ssub.with.overflow.i32(i32 %a, i32 %b)
9222 %sum = extractvalue {i32, i1} %res, 0
9223 %obit = extractvalue {i32, i1} %res, 1
9224 br i1 %obit, label %overflow, label %normal
9226 '``llvm.usub.with.overflow.*``' Intrinsics
9227 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9232 This is an overloaded intrinsic. You can use ``llvm.usub.with.overflow``
9233 on any integer bit width.
9237 declare {i16, i1} @llvm.usub.with.overflow.i16(i16 %a, i16 %b)
9238 declare {i32, i1} @llvm.usub.with.overflow.i32(i32 %a, i32 %b)
9239 declare {i64, i1} @llvm.usub.with.overflow.i64(i64 %a, i64 %b)
9244 The '``llvm.usub.with.overflow``' family of intrinsic functions perform
9245 an unsigned subtraction of the two arguments, and indicate whether an
9246 overflow occurred during the unsigned subtraction.
9251 The arguments (%a and %b) and the first element of the result structure
9252 may be of integer types of any bit width, but they must have the same
9253 bit width. The second element of the result structure must be of type
9254 ``i1``. ``%a`` and ``%b`` are the two values that will undergo unsigned
9260 The '``llvm.usub.with.overflow``' family of intrinsic functions perform
9261 an unsigned subtraction of the two arguments. They return a structure ---
9262 the first element of which is the subtraction, and the second element of
9263 which is a bit specifying if the unsigned subtraction resulted in an
9269 .. code-block:: llvm
9271 %res = call {i32, i1} @llvm.usub.with.overflow.i32(i32 %a, i32 %b)
9272 %sum = extractvalue {i32, i1} %res, 0
9273 %obit = extractvalue {i32, i1} %res, 1
9274 br i1 %obit, label %overflow, label %normal
9276 '``llvm.smul.with.overflow.*``' Intrinsics
9277 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9282 This is an overloaded intrinsic. You can use ``llvm.smul.with.overflow``
9283 on any integer bit width.
9287 declare {i16, i1} @llvm.smul.with.overflow.i16(i16 %a, i16 %b)
9288 declare {i32, i1} @llvm.smul.with.overflow.i32(i32 %a, i32 %b)
9289 declare {i64, i1} @llvm.smul.with.overflow.i64(i64 %a, i64 %b)
9294 The '``llvm.smul.with.overflow``' family of intrinsic functions perform
9295 a signed multiplication of the two arguments, and indicate whether an
9296 overflow occurred during the signed multiplication.
9301 The arguments (%a and %b) and the first element of the result structure
9302 may be of integer types of any bit width, but they must have the same
9303 bit width. The second element of the result structure must be of type
9304 ``i1``. ``%a`` and ``%b`` are the two values that will undergo signed
9310 The '``llvm.smul.with.overflow``' family of intrinsic functions perform
9311 a signed multiplication of the two arguments. They return a structure ---
9312 the first element of which is the multiplication, and the second element
9313 of which is a bit specifying if the signed multiplication resulted in an
9319 .. code-block:: llvm
9321 %res = call {i32, i1} @llvm.smul.with.overflow.i32(i32 %a, i32 %b)
9322 %sum = extractvalue {i32, i1} %res, 0
9323 %obit = extractvalue {i32, i1} %res, 1
9324 br i1 %obit, label %overflow, label %normal
9326 '``llvm.umul.with.overflow.*``' Intrinsics
9327 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9332 This is an overloaded intrinsic. You can use ``llvm.umul.with.overflow``
9333 on any integer bit width.
9337 declare {i16, i1} @llvm.umul.with.overflow.i16(i16 %a, i16 %b)
9338 declare {i32, i1} @llvm.umul.with.overflow.i32(i32 %a, i32 %b)
9339 declare {i64, i1} @llvm.umul.with.overflow.i64(i64 %a, i64 %b)
9344 The '``llvm.umul.with.overflow``' family of intrinsic functions perform
9345 a unsigned multiplication of the two arguments, and indicate whether an
9346 overflow occurred during the unsigned multiplication.
9351 The arguments (%a and %b) and the first element of the result structure
9352 may be of integer types of any bit width, but they must have the same
9353 bit width. The second element of the result structure must be of type
9354 ``i1``. ``%a`` and ``%b`` are the two values that will undergo unsigned
9360 The '``llvm.umul.with.overflow``' family of intrinsic functions perform
9361 an unsigned multiplication of the two arguments. They return a structure ---
9362 the first element of which is the multiplication, and the second
9363 element of which is a bit specifying if the unsigned multiplication
9364 resulted in an overflow.
9369 .. code-block:: llvm
9371 %res = call {i32, i1} @llvm.umul.with.overflow.i32(i32 %a, i32 %b)
9372 %sum = extractvalue {i32, i1} %res, 0
9373 %obit = extractvalue {i32, i1} %res, 1
9374 br i1 %obit, label %overflow, label %normal
9376 Specialised Arithmetic Intrinsics
9377 ---------------------------------
9379 '``llvm.fmuladd.*``' Intrinsic
9380 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9387 declare float @llvm.fmuladd.f32(float %a, float %b, float %c)
9388 declare double @llvm.fmuladd.f64(double %a, double %b, double %c)
9393 The '``llvm.fmuladd.*``' intrinsic functions represent multiply-add
9394 expressions that can be fused if the code generator determines that (a) the
9395 target instruction set has support for a fused operation, and (b) that the
9396 fused operation is more efficient than the equivalent, separate pair of mul
9397 and add instructions.
9402 The '``llvm.fmuladd.*``' intrinsics each take three arguments: two
9403 multiplicands, a and b, and an addend c.
9412 %0 = call float @llvm.fmuladd.f32(%a, %b, %c)
9414 is equivalent to the expression a \* b + c, except that rounding will
9415 not be performed between the multiplication and addition steps if the
9416 code generator fuses the operations. Fusion is not guaranteed, even if
9417 the target platform supports it. If a fused multiply-add is required the
9418 corresponding llvm.fma.\* intrinsic function should be used
9419 instead. This never sets errno, just as '``llvm.fma.*``'.
9424 .. code-block:: llvm
9426 %r2 = call float @llvm.fmuladd.f32(float %a, float %b, float %c) ; yields float:r2 = (a * b) + c
9428 Half Precision Floating Point Intrinsics
9429 ----------------------------------------
9431 For most target platforms, half precision floating point is a
9432 storage-only format. This means that it is a dense encoding (in memory)
9433 but does not support computation in the format.
9435 This means that code must first load the half-precision floating point
9436 value as an i16, then convert it to float with
9437 :ref:`llvm.convert.from.fp16 <int_convert_from_fp16>`. Computation can
9438 then be performed on the float value (including extending to double
9439 etc). To store the value back to memory, it is first converted to float
9440 if needed, then converted to i16 with
9441 :ref:`llvm.convert.to.fp16 <int_convert_to_fp16>`, then storing as an
9444 .. _int_convert_to_fp16:
9446 '``llvm.convert.to.fp16``' Intrinsic
9447 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9454 declare i16 @llvm.convert.to.fp16.f32(float %a)
9455 declare i16 @llvm.convert.to.fp16.f64(double %a)
9460 The '``llvm.convert.to.fp16``' intrinsic function performs a conversion from a
9461 conventional floating point type to half precision floating point format.
9466 The intrinsic function contains single argument - the value to be
9472 The '``llvm.convert.to.fp16``' intrinsic function performs a conversion from a
9473 conventional floating point format to half precision floating point format. The
9474 return value is an ``i16`` which contains the converted number.
9479 .. code-block:: llvm
9481 %res = call i16 @llvm.convert.to.fp16.f32(float %a)
9482 store i16 %res, i16* @x, align 2
9484 .. _int_convert_from_fp16:
9486 '``llvm.convert.from.fp16``' Intrinsic
9487 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9494 declare float @llvm.convert.from.fp16.f32(i16 %a)
9495 declare double @llvm.convert.from.fp16.f64(i16 %a)
9500 The '``llvm.convert.from.fp16``' intrinsic function performs a
9501 conversion from half precision floating point format to single precision
9502 floating point format.
9507 The intrinsic function contains single argument - the value to be
9513 The '``llvm.convert.from.fp16``' intrinsic function performs a
9514 conversion from half single precision floating point format to single
9515 precision floating point format. The input half-float value is
9516 represented by an ``i16`` value.
9521 .. code-block:: llvm
9523 %a = load i16, i16* @x, align 2
9524 %res = call float @llvm.convert.from.fp16(i16 %a)
9531 The LLVM debugger intrinsics (which all start with ``llvm.dbg.``
9532 prefix), are described in the `LLVM Source Level
9533 Debugging <SourceLevelDebugging.html#format_common_intrinsics>`_
9536 Exception Handling Intrinsics
9537 -----------------------------
9539 The LLVM exception handling intrinsics (which all start with
9540 ``llvm.eh.`` prefix), are described in the `LLVM Exception
9541 Handling <ExceptionHandling.html#format_common_intrinsics>`_ document.
9545 Trampoline Intrinsics
9546 ---------------------
9548 These intrinsics make it possible to excise one parameter, marked with
9549 the :ref:`nest <nest>` attribute, from a function. The result is a
9550 callable function pointer lacking the nest parameter - the caller does
9551 not need to provide a value for it. Instead, the value to use is stored
9552 in advance in a "trampoline", a block of memory usually allocated on the
9553 stack, which also contains code to splice the nest value into the
9554 argument list. This is used to implement the GCC nested function address
9557 For example, if the function is ``i32 f(i8* nest %c, i32 %x, i32 %y)``
9558 then the resulting function pointer has signature ``i32 (i32, i32)*``.
9559 It can be created as follows:
9561 .. code-block:: llvm
9563 %tramp = alloca [10 x i8], align 4 ; size and alignment only correct for X86
9564 %tramp1 = getelementptr [10 x i8], [10 x i8]* %tramp, i32 0, i32 0
9565 call i8* @llvm.init.trampoline(i8* %tramp1, i8* bitcast (i32 (i8*, i32, i32)* @f to i8*), i8* %nval)
9566 %p = call i8* @llvm.adjust.trampoline(i8* %tramp1)
9567 %fp = bitcast i8* %p to i32 (i32, i32)*
9569 The call ``%val = call i32 %fp(i32 %x, i32 %y)`` is then equivalent to
9570 ``%val = call i32 %f(i8* %nval, i32 %x, i32 %y)``.
9574 '``llvm.init.trampoline``' Intrinsic
9575 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9582 declare void @llvm.init.trampoline(i8* <tramp>, i8* <func>, i8* <nval>)
9587 This fills the memory pointed to by ``tramp`` with executable code,
9588 turning it into a trampoline.
9593 The ``llvm.init.trampoline`` intrinsic takes three arguments, all
9594 pointers. The ``tramp`` argument must point to a sufficiently large and
9595 sufficiently aligned block of memory; this memory is written to by the
9596 intrinsic. Note that the size and the alignment are target-specific -
9597 LLVM currently provides no portable way of determining them, so a
9598 front-end that generates this intrinsic needs to have some
9599 target-specific knowledge. The ``func`` argument must hold a function
9600 bitcast to an ``i8*``.
9605 The block of memory pointed to by ``tramp`` is filled with target
9606 dependent code, turning it into a function. Then ``tramp`` needs to be
9607 passed to :ref:`llvm.adjust.trampoline <int_at>` to get a pointer which can
9608 be :ref:`bitcast (to a new function) and called <int_trampoline>`. The new
9609 function's signature is the same as that of ``func`` with any arguments
9610 marked with the ``nest`` attribute removed. At most one such ``nest``
9611 argument is allowed, and it must be of pointer type. Calling the new
9612 function is equivalent to calling ``func`` with the same argument list,
9613 but with ``nval`` used for the missing ``nest`` argument. If, after
9614 calling ``llvm.init.trampoline``, the memory pointed to by ``tramp`` is
9615 modified, then the effect of any later call to the returned function
9616 pointer is undefined.
9620 '``llvm.adjust.trampoline``' Intrinsic
9621 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9628 declare i8* @llvm.adjust.trampoline(i8* <tramp>)
9633 This performs any required machine-specific adjustment to the address of
9634 a trampoline (passed as ``tramp``).
9639 ``tramp`` must point to a block of memory which already has trampoline
9640 code filled in by a previous call to
9641 :ref:`llvm.init.trampoline <int_it>`.
9646 On some architectures the address of the code to be executed needs to be
9647 different than the address where the trampoline is actually stored. This
9648 intrinsic returns the executable address corresponding to ``tramp``
9649 after performing the required machine specific adjustments. The pointer
9650 returned can then be :ref:`bitcast and executed <int_trampoline>`.
9652 Masked Vector Load and Store Intrinsics
9653 ---------------------------------------
9655 LLVM provides intrinsics for predicated vector load and store operations. The predicate is specified by a mask operand, which holds one bit per vector element, switching the associated vector lane on or off. The memory addresses corresponding to the "off" lanes are not accessed. When all bits of the mask are on, the intrinsic is identical to a regular vector load or store. When all bits are off, no memory is accessed.
9659 '``llvm.masked.load.*``' Intrinsics
9660 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9664 This is an overloaded intrinsic. The loaded data is a vector of any integer or floating point data type.
9668 declare <16 x float> @llvm.masked.load.v16f32 (<16 x float>* <ptr>, i32 <alignment>, <16 x i1> <mask>, <16 x float> <passthru>)
9669 declare <2 x double> @llvm.masked.load.v2f64 (<2 x double>* <ptr>, i32 <alignment>, <2 x i1> <mask>, <2 x double> <passthru>)
9674 Reads a vector from memory according to the provided mask. The mask holds a bit for each vector lane, and is used to prevent memory accesses to the masked-off lanes. The masked-off lanes in the result vector are taken from the corresponding lanes in the passthru operand.
9680 The first operand is the base pointer for the load. The second operand is the alignment of the source location. It must be a constant integer value. The third operand, mask, is a vector of boolean 'i1' values with the same number of elements as the return type. The fourth is a pass-through value that is used to fill the masked-off lanes of the result. The return type, underlying type of the base pointer and the type of passthru operand are the same vector types.
9686 The '``llvm.masked.load``' intrinsic is designed for conditional reading of selected vector elements in a single IR operation. It is useful for targets that support vector masked loads and allows vectorizing predicated basic blocks on these targets. Other targets may support this intrinsic differently, for example by lowering it into a sequence of branches that guard scalar load operations.
9687 The result of this operation is equivalent to a regular vector load instruction followed by a 'select' between the loaded and the passthru values, predicated on the same mask. However, using this intrinsic prevents exceptions on memory access to masked-off lanes.
9692 %res = call <16 x float> @llvm.masked.load.v16f32 (<16 x float>* %ptr, i32 4, <16 x i1>%mask, <16 x float> %passthru)
9694 ;; The result of the two following instructions is identical aside from potential memory access exception
9695 %loadlal = load <16 x float>, <16 x float>* %ptr, align 4
9696 %res = select <16 x i1> %mask, <16 x float> %loadlal, <16 x float> %passthru
9700 '``llvm.masked.store.*``' Intrinsics
9701 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9705 This is an overloaded intrinsic. The data stored in memory is a vector of any integer or floating point data type.
9709 declare void @llvm.masked.store.v8i32 (<8 x i32> <value>, <8 x i32> * <ptr>, i32 <alignment>, <8 x i1> <mask>)
9710 declare void @llvm.masked.store.v16f32(<16 x i32> <value>, <16 x i32>* <ptr>, i32 <alignment>, <16 x i1> <mask>)
9715 Writes a vector to memory according to the provided mask. The mask holds a bit for each vector lane, and is used to prevent memory accesses to the masked-off lanes.
9720 The first operand is the vector value to be written to memory. The second operand is the base pointer for the store, it has the same underlying type as the value operand. The third operand is the alignment of the destination location. The fourth operand, mask, is a vector of boolean values. The types of the mask and the value operand must have the same number of vector elements.
9726 The '``llvm.masked.store``' intrinsics is designed for conditional writing of selected vector elements in a single IR operation. It is useful for targets that support vector masked store and allows vectorizing predicated basic blocks on these targets. Other targets may support this intrinsic differently, for example by lowering it into a sequence of branches that guard scalar store operations.
9727 The result of this operation is equivalent to a load-modify-store sequence. However, using this intrinsic prevents exceptions and data races on memory access to masked-off lanes.
9731 call void @llvm.masked.store.v16f32(<16 x float> %value, <16 x float>* %ptr, i32 4, <16 x i1> %mask)
9733 ;; The result of the following instructions is identical aside from potential data races and memory access exceptions
9734 %oldval = load <16 x float>, <16 x float>* %ptr, align 4
9735 %res = select <16 x i1> %mask, <16 x float> %value, <16 x float> %oldval
9736 store <16 x float> %res, <16 x float>* %ptr, align 4
9742 This class of intrinsics provides information about the lifetime of
9743 memory objects and ranges where variables are immutable.
9747 '``llvm.lifetime.start``' Intrinsic
9748 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9755 declare void @llvm.lifetime.start(i64 <size>, i8* nocapture <ptr>)
9760 The '``llvm.lifetime.start``' intrinsic specifies the start of a memory
9766 The first argument is a constant integer representing the size of the
9767 object, or -1 if it is variable sized. The second argument is a pointer
9773 This intrinsic indicates that before this point in the code, the value
9774 of the memory pointed to by ``ptr`` is dead. This means that it is known
9775 to never be used and has an undefined value. A load from the pointer
9776 that precedes this intrinsic can be replaced with ``'undef'``.
9780 '``llvm.lifetime.end``' Intrinsic
9781 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9788 declare void @llvm.lifetime.end(i64 <size>, i8* nocapture <ptr>)
9793 The '``llvm.lifetime.end``' intrinsic specifies the end of a memory
9799 The first argument is a constant integer representing the size of the
9800 object, or -1 if it is variable sized. The second argument is a pointer
9806 This intrinsic indicates that after this point in the code, the value of
9807 the memory pointed to by ``ptr`` is dead. This means that it is known to
9808 never be used and has an undefined value. Any stores into the memory
9809 object following this intrinsic may be removed as dead.
9811 '``llvm.invariant.start``' Intrinsic
9812 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9819 declare {}* @llvm.invariant.start(i64 <size>, i8* nocapture <ptr>)
9824 The '``llvm.invariant.start``' intrinsic specifies that the contents of
9825 a memory object will not change.
9830 The first argument is a constant integer representing the size of the
9831 object, or -1 if it is variable sized. The second argument is a pointer
9837 This intrinsic indicates that until an ``llvm.invariant.end`` that uses
9838 the return value, the referenced memory location is constant and
9841 '``llvm.invariant.end``' Intrinsic
9842 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9849 declare void @llvm.invariant.end({}* <start>, i64 <size>, i8* nocapture <ptr>)
9854 The '``llvm.invariant.end``' intrinsic specifies that the contents of a
9855 memory object are mutable.
9860 The first argument is the matching ``llvm.invariant.start`` intrinsic.
9861 The second argument is a constant integer representing the size of the
9862 object, or -1 if it is variable sized and the third argument is a
9863 pointer to the object.
9868 This intrinsic indicates that the memory is mutable again.
9873 This class of intrinsics is designed to be generic and has no specific
9876 '``llvm.var.annotation``' Intrinsic
9877 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9884 declare void @llvm.var.annotation(i8* <val>, i8* <str>, i8* <str>, i32 <int>)
9889 The '``llvm.var.annotation``' intrinsic.
9894 The first argument is a pointer to a value, the second is a pointer to a
9895 global string, the third is a pointer to a global string which is the
9896 source file name, and the last argument is the line number.
9901 This intrinsic allows annotation of local variables with arbitrary
9902 strings. This can be useful for special purpose optimizations that want
9903 to look for these annotations. These have no other defined use; they are
9904 ignored by code generation and optimization.
9906 '``llvm.ptr.annotation.*``' Intrinsic
9907 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9912 This is an overloaded intrinsic. You can use '``llvm.ptr.annotation``' on a
9913 pointer to an integer of any width. *NOTE* you must specify an address space for
9914 the pointer. The identifier for the default address space is the integer
9919 declare i8* @llvm.ptr.annotation.p<address space>i8(i8* <val>, i8* <str>, i8* <str>, i32 <int>)
9920 declare i16* @llvm.ptr.annotation.p<address space>i16(i16* <val>, i8* <str>, i8* <str>, i32 <int>)
9921 declare i32* @llvm.ptr.annotation.p<address space>i32(i32* <val>, i8* <str>, i8* <str>, i32 <int>)
9922 declare i64* @llvm.ptr.annotation.p<address space>i64(i64* <val>, i8* <str>, i8* <str>, i32 <int>)
9923 declare i256* @llvm.ptr.annotation.p<address space>i256(i256* <val>, i8* <str>, i8* <str>, i32 <int>)
9928 The '``llvm.ptr.annotation``' intrinsic.
9933 The first argument is a pointer to an integer value of arbitrary bitwidth
9934 (result of some expression), the second is a pointer to a global string, the
9935 third is a pointer to a global string which is the source file name, and the
9936 last argument is the line number. It returns the value of the first argument.
9941 This intrinsic allows annotation of a pointer to an integer with arbitrary
9942 strings. This can be useful for special purpose optimizations that want to look
9943 for these annotations. These have no other defined use; they are ignored by code
9944 generation and optimization.
9946 '``llvm.annotation.*``' Intrinsic
9947 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9952 This is an overloaded intrinsic. You can use '``llvm.annotation``' on
9953 any integer bit width.
9957 declare i8 @llvm.annotation.i8(i8 <val>, i8* <str>, i8* <str>, i32 <int>)
9958 declare i16 @llvm.annotation.i16(i16 <val>, i8* <str>, i8* <str>, i32 <int>)
9959 declare i32 @llvm.annotation.i32(i32 <val>, i8* <str>, i8* <str>, i32 <int>)
9960 declare i64 @llvm.annotation.i64(i64 <val>, i8* <str>, i8* <str>, i32 <int>)
9961 declare i256 @llvm.annotation.i256(i256 <val>, i8* <str>, i8* <str>, i32 <int>)
9966 The '``llvm.annotation``' intrinsic.
9971 The first argument is an integer value (result of some expression), the
9972 second is a pointer to a global string, the third is a pointer to a
9973 global string which is the source file name, and the last argument is
9974 the line number. It returns the value of the first argument.
9979 This intrinsic allows annotations to be put on arbitrary expressions
9980 with arbitrary strings. This can be useful for special purpose
9981 optimizations that want to look for these annotations. These have no
9982 other defined use; they are ignored by code generation and optimization.
9984 '``llvm.trap``' Intrinsic
9985 ^^^^^^^^^^^^^^^^^^^^^^^^^
9992 declare void @llvm.trap() noreturn nounwind
9997 The '``llvm.trap``' intrinsic.
10007 This intrinsic is lowered to the target dependent trap instruction. If
10008 the target does not have a trap instruction, this intrinsic will be
10009 lowered to a call of the ``abort()`` function.
10011 '``llvm.debugtrap``' Intrinsic
10012 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
10019 declare void @llvm.debugtrap() nounwind
10024 The '``llvm.debugtrap``' intrinsic.
10034 This intrinsic is lowered to code which is intended to cause an
10035 execution trap with the intention of requesting the attention of a
10038 '``llvm.stackprotector``' Intrinsic
10039 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
10046 declare void @llvm.stackprotector(i8* <guard>, i8** <slot>)
10051 The ``llvm.stackprotector`` intrinsic takes the ``guard`` and stores it
10052 onto the stack at ``slot``. The stack slot is adjusted to ensure that it
10053 is placed on the stack before local variables.
10058 The ``llvm.stackprotector`` intrinsic requires two pointer arguments.
10059 The first argument is the value loaded from the stack guard
10060 ``@__stack_chk_guard``. The second variable is an ``alloca`` that has
10061 enough space to hold the value of the guard.
10066 This intrinsic causes the prologue/epilogue inserter to force the position of
10067 the ``AllocaInst`` stack slot to be before local variables on the stack. This is
10068 to ensure that if a local variable on the stack is overwritten, it will destroy
10069 the value of the guard. When the function exits, the guard on the stack is
10070 checked against the original guard by ``llvm.stackprotectorcheck``. If they are
10071 different, then ``llvm.stackprotectorcheck`` causes the program to abort by
10072 calling the ``__stack_chk_fail()`` function.
10074 '``llvm.stackprotectorcheck``' Intrinsic
10075 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
10082 declare void @llvm.stackprotectorcheck(i8** <guard>)
10087 The ``llvm.stackprotectorcheck`` intrinsic compares ``guard`` against an already
10088 created stack protector and if they are not equal calls the
10089 ``__stack_chk_fail()`` function.
10094 The ``llvm.stackprotectorcheck`` intrinsic requires one pointer argument, the
10095 the variable ``@__stack_chk_guard``.
10100 This intrinsic is provided to perform the stack protector check by comparing
10101 ``guard`` with the stack slot created by ``llvm.stackprotector`` and if the
10102 values do not match call the ``__stack_chk_fail()`` function.
10104 The reason to provide this as an IR level intrinsic instead of implementing it
10105 via other IR operations is that in order to perform this operation at the IR
10106 level without an intrinsic, one would need to create additional basic blocks to
10107 handle the success/failure cases. This makes it difficult to stop the stack
10108 protector check from disrupting sibling tail calls in Codegen. With this
10109 intrinsic, we are able to generate the stack protector basic blocks late in
10110 codegen after the tail call decision has occurred.
10112 '``llvm.objectsize``' Intrinsic
10113 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
10120 declare i32 @llvm.objectsize.i32(i8* <object>, i1 <min>)
10121 declare i64 @llvm.objectsize.i64(i8* <object>, i1 <min>)
10126 The ``llvm.objectsize`` intrinsic is designed to provide information to
10127 the optimizers to determine at compile time whether a) an operation
10128 (like memcpy) will overflow a buffer that corresponds to an object, or
10129 b) that a runtime check for overflow isn't necessary. An object in this
10130 context means an allocation of a specific class, structure, array, or
10136 The ``llvm.objectsize`` intrinsic takes two arguments. The first
10137 argument is a pointer to or into the ``object``. The second argument is
10138 a boolean and determines whether ``llvm.objectsize`` returns 0 (if true)
10139 or -1 (if false) when the object size is unknown. The second argument
10140 only accepts constants.
10145 The ``llvm.objectsize`` intrinsic is lowered to a constant representing
10146 the size of the object concerned. If the size cannot be determined at
10147 compile time, ``llvm.objectsize`` returns ``i32/i64 -1 or 0`` (depending
10148 on the ``min`` argument).
10150 '``llvm.expect``' Intrinsic
10151 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
10156 This is an overloaded intrinsic. You can use ``llvm.expect`` on any
10161 declare i1 @llvm.expect.i1(i1 <val>, i1 <expected_val>)
10162 declare i32 @llvm.expect.i32(i32 <val>, i32 <expected_val>)
10163 declare i64 @llvm.expect.i64(i64 <val>, i64 <expected_val>)
10168 The ``llvm.expect`` intrinsic provides information about expected (the
10169 most probable) value of ``val``, which can be used by optimizers.
10174 The ``llvm.expect`` intrinsic takes two arguments. The first argument is
10175 a value. The second argument is an expected value, this needs to be a
10176 constant value, variables are not allowed.
10181 This intrinsic is lowered to the ``val``.
10183 '``llvm.assume``' Intrinsic
10184 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
10191 declare void @llvm.assume(i1 %cond)
10196 The ``llvm.assume`` allows the optimizer to assume that the provided
10197 condition is true. This information can then be used in simplifying other parts
10203 The condition which the optimizer may assume is always true.
10208 The intrinsic allows the optimizer to assume that the provided condition is
10209 always true whenever the control flow reaches the intrinsic call. No code is
10210 generated for this intrinsic, and instructions that contribute only to the
10211 provided condition are not used for code generation. If the condition is
10212 violated during execution, the behavior is undefined.
10214 Note that the optimizer might limit the transformations performed on values
10215 used by the ``llvm.assume`` intrinsic in order to preserve the instructions
10216 only used to form the intrinsic's input argument. This might prove undesirable
10217 if the extra information provided by the ``llvm.assume`` intrinsic does not cause
10218 sufficient overall improvement in code quality. For this reason,
10219 ``llvm.assume`` should not be used to document basic mathematical invariants
10220 that the optimizer can otherwise deduce or facts that are of little use to the
10225 '``llvm.bitset.test``' Intrinsic
10226 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
10233 declare i1 @llvm.bitset.test(i8* %ptr, metadata %bitset) nounwind readnone
10239 The first argument is a pointer to be tested. The second argument is a
10240 metadata string containing the name of a :doc:`bitset <BitSets>`.
10245 The ``llvm.bitset.test`` intrinsic tests whether the given pointer is a
10246 member of the given bitset.
10248 '``llvm.donothing``' Intrinsic
10249 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
10256 declare void @llvm.donothing() nounwind readnone
10261 The ``llvm.donothing`` intrinsic doesn't perform any operation. It's one of only
10262 two intrinsics (besides ``llvm.experimental.patchpoint``) that can be called
10263 with an invoke instruction.
10273 This intrinsic does nothing, and it's removed by optimizers and ignored
10276 Stack Map Intrinsics
10277 --------------------
10279 LLVM provides experimental intrinsics to support runtime patching
10280 mechanisms commonly desired in dynamic language JITs. These intrinsics
10281 are described in :doc:`StackMaps`.