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. There is no way to generate IR
1530 that does not embed this target-specific detail into the IR. If you
1531 don't specify the string, the default specifications will be used to
1532 generate a Data Layout and the optimization phases will operate
1533 accordingly and introduce target specificity into the IR with respect to
1534 these default specifications.
1541 A module may specify a target triple string that describes the target
1542 host. The syntax for the target triple is simply:
1544 .. code-block:: llvm
1546 target triple = "x86_64-apple-macosx10.7.0"
1548 The *target triple* string consists of a series of identifiers delimited
1549 by the minus sign character ('-'). The canonical forms are:
1553 ARCHITECTURE-VENDOR-OPERATING_SYSTEM
1554 ARCHITECTURE-VENDOR-OPERATING_SYSTEM-ENVIRONMENT
1556 This information is passed along to the backend so that it generates
1557 code for the proper architecture. It's possible to override this on the
1558 command line with the ``-mtriple`` command line option.
1560 .. _pointeraliasing:
1562 Pointer Aliasing Rules
1563 ----------------------
1565 Any memory access must be done through a pointer value associated with
1566 an address range of the memory access, otherwise the behavior is
1567 undefined. Pointer values are associated with address ranges according
1568 to the following rules:
1570 - A pointer value is associated with the addresses associated with any
1571 value it is *based* on.
1572 - An address of a global variable is associated with the address range
1573 of the variable's storage.
1574 - The result value of an allocation instruction is associated with the
1575 address range of the allocated storage.
1576 - A null pointer in the default address-space is associated with no
1578 - An integer constant other than zero or a pointer value returned from
1579 a function not defined within LLVM may be associated with address
1580 ranges allocated through mechanisms other than those provided by
1581 LLVM. Such ranges shall not overlap with any ranges of addresses
1582 allocated by mechanisms provided by LLVM.
1584 A pointer value is *based* on another pointer value according to the
1587 - A pointer value formed from a ``getelementptr`` operation is *based*
1588 on the first value operand of the ``getelementptr``.
1589 - The result value of a ``bitcast`` is *based* on the operand of the
1591 - A pointer value formed by an ``inttoptr`` is *based* on all pointer
1592 values that contribute (directly or indirectly) to the computation of
1593 the pointer's value.
1594 - The "*based* on" relationship is transitive.
1596 Note that this definition of *"based"* is intentionally similar to the
1597 definition of *"based"* in C99, though it is slightly weaker.
1599 LLVM IR does not associate types with memory. The result type of a
1600 ``load`` merely indicates the size and alignment of the memory from
1601 which to load, as well as the interpretation of the value. The first
1602 operand type of a ``store`` similarly only indicates the size and
1603 alignment of the store.
1605 Consequently, type-based alias analysis, aka TBAA, aka
1606 ``-fstrict-aliasing``, is not applicable to general unadorned LLVM IR.
1607 :ref:`Metadata <metadata>` may be used to encode additional information
1608 which specialized optimization passes may use to implement type-based
1613 Volatile Memory Accesses
1614 ------------------------
1616 Certain memory accesses, such as :ref:`load <i_load>`'s,
1617 :ref:`store <i_store>`'s, and :ref:`llvm.memcpy <int_memcpy>`'s may be
1618 marked ``volatile``. The optimizers must not change the number of
1619 volatile operations or change their order of execution relative to other
1620 volatile operations. The optimizers *may* change the order of volatile
1621 operations relative to non-volatile operations. This is not Java's
1622 "volatile" and has no cross-thread synchronization behavior.
1624 IR-level volatile loads and stores cannot safely be optimized into
1625 llvm.memcpy or llvm.memmove intrinsics even when those intrinsics are
1626 flagged volatile. Likewise, the backend should never split or merge
1627 target-legal volatile load/store instructions.
1629 .. admonition:: Rationale
1631 Platforms may rely on volatile loads and stores of natively supported
1632 data width to be executed as single instruction. For example, in C
1633 this holds for an l-value of volatile primitive type with native
1634 hardware support, but not necessarily for aggregate types. The
1635 frontend upholds these expectations, which are intentionally
1636 unspecified in the IR. The rules above ensure that IR transformation
1637 do not violate the frontend's contract with the language.
1641 Memory Model for Concurrent Operations
1642 --------------------------------------
1644 The LLVM IR does not define any way to start parallel threads of
1645 execution or to register signal handlers. Nonetheless, there are
1646 platform-specific ways to create them, and we define LLVM IR's behavior
1647 in their presence. This model is inspired by the C++0x memory model.
1649 For a more informal introduction to this model, see the :doc:`Atomics`.
1651 We define a *happens-before* partial order as the least partial order
1654 - Is a superset of single-thread program order, and
1655 - When a *synchronizes-with* ``b``, includes an edge from ``a`` to
1656 ``b``. *Synchronizes-with* pairs are introduced by platform-specific
1657 techniques, like pthread locks, thread creation, thread joining,
1658 etc., and by atomic instructions. (See also :ref:`Atomic Memory Ordering
1659 Constraints <ordering>`).
1661 Note that program order does not introduce *happens-before* edges
1662 between a thread and signals executing inside that thread.
1664 Every (defined) read operation (load instructions, memcpy, atomic
1665 loads/read-modify-writes, etc.) R reads a series of bytes written by
1666 (defined) write operations (store instructions, atomic
1667 stores/read-modify-writes, memcpy, etc.). For the purposes of this
1668 section, initialized globals are considered to have a write of the
1669 initializer which is atomic and happens before any other read or write
1670 of the memory in question. For each byte of a read R, R\ :sub:`byte`
1671 may see any write to the same byte, except:
1673 - If write\ :sub:`1` happens before write\ :sub:`2`, and
1674 write\ :sub:`2` happens before R\ :sub:`byte`, then
1675 R\ :sub:`byte` does not see write\ :sub:`1`.
1676 - If R\ :sub:`byte` happens before write\ :sub:`3`, then
1677 R\ :sub:`byte` does not see write\ :sub:`3`.
1679 Given that definition, R\ :sub:`byte` is defined as follows:
1681 - If R is volatile, the result is target-dependent. (Volatile is
1682 supposed to give guarantees which can support ``sig_atomic_t`` in
1683 C/C++, and may be used for accesses to addresses that do not behave
1684 like normal memory. It does not generally provide cross-thread
1686 - Otherwise, if there is no write to the same byte that happens before
1687 R\ :sub:`byte`, R\ :sub:`byte` returns ``undef`` for that byte.
1688 - Otherwise, if R\ :sub:`byte` may see exactly one write,
1689 R\ :sub:`byte` returns the value written by that write.
1690 - Otherwise, if R is atomic, and all the writes R\ :sub:`byte` may
1691 see are atomic, it chooses one of the values written. See the :ref:`Atomic
1692 Memory Ordering Constraints <ordering>` section for additional
1693 constraints on how the choice is made.
1694 - Otherwise R\ :sub:`byte` returns ``undef``.
1696 R returns the value composed of the series of bytes it read. This
1697 implies that some bytes within the value may be ``undef`` **without**
1698 the entire value being ``undef``. Note that this only defines the
1699 semantics of the operation; it doesn't mean that targets will emit more
1700 than one instruction to read the series of bytes.
1702 Note that in cases where none of the atomic intrinsics are used, this
1703 model places only one restriction on IR transformations on top of what
1704 is required for single-threaded execution: introducing a store to a byte
1705 which might not otherwise be stored is not allowed in general.
1706 (Specifically, in the case where another thread might write to and read
1707 from an address, introducing a store can change a load that may see
1708 exactly one write into a load that may see multiple writes.)
1712 Atomic Memory Ordering Constraints
1713 ----------------------------------
1715 Atomic instructions (:ref:`cmpxchg <i_cmpxchg>`,
1716 :ref:`atomicrmw <i_atomicrmw>`, :ref:`fence <i_fence>`,
1717 :ref:`atomic load <i_load>`, and :ref:`atomic store <i_store>`) take
1718 ordering parameters that determine which other atomic instructions on
1719 the same address they *synchronize with*. These semantics are borrowed
1720 from Java and C++0x, but are somewhat more colloquial. If these
1721 descriptions aren't precise enough, check those specs (see spec
1722 references in the :doc:`atomics guide <Atomics>`).
1723 :ref:`fence <i_fence>` instructions treat these orderings somewhat
1724 differently since they don't take an address. See that instruction's
1725 documentation for details.
1727 For a simpler introduction to the ordering constraints, see the
1731 The set of values that can be read is governed by the happens-before
1732 partial order. A value cannot be read unless some operation wrote
1733 it. This is intended to provide a guarantee strong enough to model
1734 Java's non-volatile shared variables. This ordering cannot be
1735 specified for read-modify-write operations; it is not strong enough
1736 to make them atomic in any interesting way.
1738 In addition to the guarantees of ``unordered``, there is a single
1739 total order for modifications by ``monotonic`` operations on each
1740 address. All modification orders must be compatible with the
1741 happens-before order. There is no guarantee that the modification
1742 orders can be combined to a global total order for the whole program
1743 (and this often will not be possible). The read in an atomic
1744 read-modify-write operation (:ref:`cmpxchg <i_cmpxchg>` and
1745 :ref:`atomicrmw <i_atomicrmw>`) reads the value in the modification
1746 order immediately before the value it writes. If one atomic read
1747 happens before another atomic read of the same address, the later
1748 read must see the same value or a later value in the address's
1749 modification order. This disallows reordering of ``monotonic`` (or
1750 stronger) operations on the same address. If an address is written
1751 ``monotonic``-ally by one thread, and other threads ``monotonic``-ally
1752 read that address repeatedly, the other threads must eventually see
1753 the write. This corresponds to the C++0x/C1x
1754 ``memory_order_relaxed``.
1756 In addition to the guarantees of ``monotonic``, a
1757 *synchronizes-with* edge may be formed with a ``release`` operation.
1758 This is intended to model C++'s ``memory_order_acquire``.
1760 In addition to the guarantees of ``monotonic``, if this operation
1761 writes a value which is subsequently read by an ``acquire``
1762 operation, it *synchronizes-with* that operation. (This isn't a
1763 complete description; see the C++0x definition of a release
1764 sequence.) This corresponds to the C++0x/C1x
1765 ``memory_order_release``.
1766 ``acq_rel`` (acquire+release)
1767 Acts as both an ``acquire`` and ``release`` operation on its
1768 address. This corresponds to the C++0x/C1x ``memory_order_acq_rel``.
1769 ``seq_cst`` (sequentially consistent)
1770 In addition to the guarantees of ``acq_rel`` (``acquire`` for an
1771 operation that only reads, ``release`` for an operation that only
1772 writes), there is a global total order on all
1773 sequentially-consistent operations on all addresses, which is
1774 consistent with the *happens-before* partial order and with the
1775 modification orders of all the affected addresses. Each
1776 sequentially-consistent read sees the last preceding write to the
1777 same address in this global order. This corresponds to the C++0x/C1x
1778 ``memory_order_seq_cst`` and Java volatile.
1782 If an atomic operation is marked ``singlethread``, it only *synchronizes
1783 with* or participates in modification and seq\_cst total orderings with
1784 other operations running in the same thread (for example, in signal
1792 LLVM IR floating-point binary ops (:ref:`fadd <i_fadd>`,
1793 :ref:`fsub <i_fsub>`, :ref:`fmul <i_fmul>`, :ref:`fdiv <i_fdiv>`,
1794 :ref:`frem <i_frem>`) have the following flags that can be set to enable
1795 otherwise unsafe floating point operations
1798 No NaNs - Allow optimizations to assume the arguments and result are not
1799 NaN. Such optimizations are required to retain defined behavior over
1800 NaNs, but the value of the result is undefined.
1803 No Infs - Allow optimizations to assume the arguments and result are not
1804 +/-Inf. Such optimizations are required to retain defined behavior over
1805 +/-Inf, but the value of the result is undefined.
1808 No Signed Zeros - Allow optimizations to treat the sign of a zero
1809 argument or result as insignificant.
1812 Allow Reciprocal - Allow optimizations to use the reciprocal of an
1813 argument rather than perform division.
1816 Fast - Allow algebraically equivalent transformations that may
1817 dramatically change results in floating point (e.g. reassociate). This
1818 flag implies all the others.
1822 Use-list Order Directives
1823 -------------------------
1825 Use-list directives encode the in-memory order of each use-list, allowing the
1826 order to be recreated. ``<order-indexes>`` is a comma-separated list of
1827 indexes that are assigned to the referenced value's uses. The referenced
1828 value's use-list is immediately sorted by these indexes.
1830 Use-list directives may appear at function scope or global scope. They are not
1831 instructions, and have no effect on the semantics of the IR. When they're at
1832 function scope, they must appear after the terminator of the final basic block.
1834 If basic blocks have their address taken via ``blockaddress()`` expressions,
1835 ``uselistorder_bb`` can be used to reorder their use-lists from outside their
1842 uselistorder <ty> <value>, { <order-indexes> }
1843 uselistorder_bb @function, %block { <order-indexes> }
1849 define void @foo(i32 %arg1, i32 %arg2) {
1851 ; ... instructions ...
1853 ; ... instructions ...
1855 ; At function scope.
1856 uselistorder i32 %arg1, { 1, 0, 2 }
1857 uselistorder label %bb, { 1, 0 }
1861 uselistorder i32* @global, { 1, 2, 0 }
1862 uselistorder i32 7, { 1, 0 }
1863 uselistorder i32 (i32) @bar, { 1, 0 }
1864 uselistorder_bb @foo, %bb, { 5, 1, 3, 2, 0, 4 }
1871 The LLVM type system is one of the most important features of the
1872 intermediate representation. Being typed enables a number of
1873 optimizations to be performed on the intermediate representation
1874 directly, without having to do extra analyses on the side before the
1875 transformation. A strong type system makes it easier to read the
1876 generated code and enables novel analyses and transformations that are
1877 not feasible to perform on normal three address code representations.
1887 The void type does not represent any value and has no size.
1905 The function type can be thought of as a function signature. It consists of a
1906 return type and a list of formal parameter types. The return type of a function
1907 type is a void type or first class type --- except for :ref:`label <t_label>`
1908 and :ref:`metadata <t_metadata>` types.
1914 <returntype> (<parameter list>)
1916 ...where '``<parameter list>``' is a comma-separated list of type
1917 specifiers. Optionally, the parameter list may include a type ``...``, which
1918 indicates that the function takes a variable number of arguments. Variable
1919 argument functions can access their arguments with the :ref:`variable argument
1920 handling intrinsic <int_varargs>` functions. '``<returntype>``' is any type
1921 except :ref:`label <t_label>` and :ref:`metadata <t_metadata>`.
1925 +---------------------------------+---------------------------------------------------------------------------------------------------------------------------------------------------------------------+
1926 | ``i32 (i32)`` | function taking an ``i32``, returning an ``i32`` |
1927 +---------------------------------+---------------------------------------------------------------------------------------------------------------------------------------------------------------------+
1928 | ``float (i16, i32 *) *`` | :ref:`Pointer <t_pointer>` to a function that takes an ``i16`` and a :ref:`pointer <t_pointer>` to ``i32``, returning ``float``. |
1929 +---------------------------------+---------------------------------------------------------------------------------------------------------------------------------------------------------------------+
1930 | ``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. |
1931 +---------------------------------+---------------------------------------------------------------------------------------------------------------------------------------------------------------------+
1932 | ``{i32, i32} (i32)`` | A function taking an ``i32``, returning a :ref:`structure <t_struct>` containing two ``i32`` values |
1933 +---------------------------------+---------------------------------------------------------------------------------------------------------------------------------------------------------------------+
1940 The :ref:`first class <t_firstclass>` types are perhaps the most important.
1941 Values of these types are the only ones which can be produced by
1949 These are the types that are valid in registers from CodeGen's perspective.
1958 The integer type is a very simple type that simply specifies an
1959 arbitrary bit width for the integer type desired. Any bit width from 1
1960 bit to 2\ :sup:`23`\ -1 (about 8 million) can be specified.
1968 The number of bits the integer will occupy is specified by the ``N``
1974 +----------------+------------------------------------------------+
1975 | ``i1`` | a single-bit integer. |
1976 +----------------+------------------------------------------------+
1977 | ``i32`` | a 32-bit integer. |
1978 +----------------+------------------------------------------------+
1979 | ``i1942652`` | a really big integer of over 1 million bits. |
1980 +----------------+------------------------------------------------+
1984 Floating Point Types
1985 """"""""""""""""""""
1994 - 16-bit floating point value
1997 - 32-bit floating point value
2000 - 64-bit floating point value
2003 - 128-bit floating point value (112-bit mantissa)
2006 - 80-bit floating point value (X87)
2009 - 128-bit floating point value (two 64-bits)
2016 The x86_mmx type represents a value held in an MMX register on an x86
2017 machine. The operations allowed on it are quite limited: parameters and
2018 return values, load and store, and bitcast. User-specified MMX
2019 instructions are represented as intrinsic or asm calls with arguments
2020 and/or results of this type. There are no arrays, vectors or constants
2037 The pointer type is used to specify memory locations. Pointers are
2038 commonly used to reference objects in memory.
2040 Pointer types may have an optional address space attribute defining the
2041 numbered address space where the pointed-to object resides. The default
2042 address space is number zero. The semantics of non-zero address spaces
2043 are target-specific.
2045 Note that LLVM does not permit pointers to void (``void*``) nor does it
2046 permit pointers to labels (``label*``). Use ``i8*`` instead.
2056 +-------------------------+--------------------------------------------------------------------------------------------------------------+
2057 | ``[4 x i32]*`` | A :ref:`pointer <t_pointer>` to :ref:`array <t_array>` of four ``i32`` values. |
2058 +-------------------------+--------------------------------------------------------------------------------------------------------------+
2059 | ``i32 (i32*) *`` | A :ref:`pointer <t_pointer>` to a :ref:`function <t_function>` that takes an ``i32*``, returning an ``i32``. |
2060 +-------------------------+--------------------------------------------------------------------------------------------------------------+
2061 | ``i32 addrspace(5)*`` | A :ref:`pointer <t_pointer>` to an ``i32`` value that resides in address space #5. |
2062 +-------------------------+--------------------------------------------------------------------------------------------------------------+
2071 A vector type is a simple derived type that represents a vector of
2072 elements. Vector types are used when multiple primitive data are
2073 operated in parallel using a single instruction (SIMD). A vector type
2074 requires a size (number of elements) and an underlying primitive data
2075 type. Vector types are considered :ref:`first class <t_firstclass>`.
2081 < <# elements> x <elementtype> >
2083 The number of elements is a constant integer value larger than 0;
2084 elementtype may be any integer, floating point or pointer type. Vectors
2085 of size zero are not allowed.
2089 +-------------------+--------------------------------------------------+
2090 | ``<4 x i32>`` | Vector of 4 32-bit integer values. |
2091 +-------------------+--------------------------------------------------+
2092 | ``<8 x float>`` | Vector of 8 32-bit floating-point values. |
2093 +-------------------+--------------------------------------------------+
2094 | ``<2 x i64>`` | Vector of 2 64-bit integer values. |
2095 +-------------------+--------------------------------------------------+
2096 | ``<4 x i64*>`` | Vector of 4 pointers to 64-bit integer values. |
2097 +-------------------+--------------------------------------------------+
2106 The label type represents code labels.
2121 The metadata type represents embedded metadata. No derived types may be
2122 created from metadata except for :ref:`function <t_function>` arguments.
2135 Aggregate Types are a subset of derived types that can contain multiple
2136 member types. :ref:`Arrays <t_array>` and :ref:`structs <t_struct>` are
2137 aggregate types. :ref:`Vectors <t_vector>` are not considered to be
2147 The array type is a very simple derived type that arranges elements
2148 sequentially in memory. The array type requires a size (number of
2149 elements) and an underlying data type.
2155 [<# elements> x <elementtype>]
2157 The number of elements is a constant integer value; ``elementtype`` may
2158 be any type with a size.
2162 +------------------+--------------------------------------+
2163 | ``[40 x i32]`` | Array of 40 32-bit integer values. |
2164 +------------------+--------------------------------------+
2165 | ``[41 x i32]`` | Array of 41 32-bit integer values. |
2166 +------------------+--------------------------------------+
2167 | ``[4 x i8]`` | Array of 4 8-bit integer values. |
2168 +------------------+--------------------------------------+
2170 Here are some examples of multidimensional arrays:
2172 +-----------------------------+----------------------------------------------------------+
2173 | ``[3 x [4 x i32]]`` | 3x4 array of 32-bit integer values. |
2174 +-----------------------------+----------------------------------------------------------+
2175 | ``[12 x [10 x float]]`` | 12x10 array of single precision floating point values. |
2176 +-----------------------------+----------------------------------------------------------+
2177 | ``[2 x [3 x [4 x i16]]]`` | 2x3x4 array of 16-bit integer values. |
2178 +-----------------------------+----------------------------------------------------------+
2180 There is no restriction on indexing beyond the end of the array implied
2181 by a static type (though there are restrictions on indexing beyond the
2182 bounds of an allocated object in some cases). This means that
2183 single-dimension 'variable sized array' addressing can be implemented in
2184 LLVM with a zero length array type. An implementation of 'pascal style
2185 arrays' in LLVM could use the type "``{ i32, [0 x float]}``", for
2195 The structure type is used to represent a collection of data members
2196 together in memory. The elements of a structure may be any type that has
2199 Structures in memory are accessed using '``load``' and '``store``' by
2200 getting a pointer to a field with the '``getelementptr``' instruction.
2201 Structures in registers are accessed using the '``extractvalue``' and
2202 '``insertvalue``' instructions.
2204 Structures may optionally be "packed" structures, which indicate that
2205 the alignment of the struct is one byte, and that there is no padding
2206 between the elements. In non-packed structs, padding between field types
2207 is inserted as defined by the DataLayout string in the module, which is
2208 required to match what the underlying code generator expects.
2210 Structures can either be "literal" or "identified". A literal structure
2211 is defined inline with other types (e.g. ``{i32, i32}*``) whereas
2212 identified types are always defined at the top level with a name.
2213 Literal types are uniqued by their contents and can never be recursive
2214 or opaque since there is no way to write one. Identified types can be
2215 recursive, can be opaqued, and are never uniqued.
2221 %T1 = type { <type list> } ; Identified normal struct type
2222 %T2 = type <{ <type list> }> ; Identified packed struct type
2226 +------------------------------+---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
2227 | ``{ i32, i32, i32 }`` | A triple of three ``i32`` values |
2228 +------------------------------+---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
2229 | ``{ 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``. |
2230 +------------------------------+---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
2231 | ``<{ i8, i32 }>`` | A packed struct known to be 5 bytes in size. |
2232 +------------------------------+---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
2236 Opaque Structure Types
2237 """"""""""""""""""""""
2241 Opaque structure types are used to represent named structure types that
2242 do not have a body specified. This corresponds (for example) to the C
2243 notion of a forward declared structure.
2254 +--------------+-------------------+
2255 | ``opaque`` | An opaque type. |
2256 +--------------+-------------------+
2263 LLVM has several different basic types of constants. This section
2264 describes them all and their syntax.
2269 **Boolean constants**
2270 The two strings '``true``' and '``false``' are both valid constants
2272 **Integer constants**
2273 Standard integers (such as '4') are constants of the
2274 :ref:`integer <t_integer>` type. Negative numbers may be used with
2276 **Floating point constants**
2277 Floating point constants use standard decimal notation (e.g.
2278 123.421), exponential notation (e.g. 1.23421e+2), or a more precise
2279 hexadecimal notation (see below). The assembler requires the exact
2280 decimal value of a floating-point constant. For example, the
2281 assembler accepts 1.25 but rejects 1.3 because 1.3 is a repeating
2282 decimal in binary. Floating point constants must have a :ref:`floating
2283 point <t_floating>` type.
2284 **Null pointer constants**
2285 The identifier '``null``' is recognized as a null pointer constant
2286 and must be of :ref:`pointer type <t_pointer>`.
2288 The one non-intuitive notation for constants is the hexadecimal form of
2289 floating point constants. For example, the form
2290 '``double 0x432ff973cafa8000``' is equivalent to (but harder to read
2291 than) '``double 4.5e+15``'. The only time hexadecimal floating point
2292 constants are required (and the only time that they are generated by the
2293 disassembler) is when a floating point constant must be emitted but it
2294 cannot be represented as a decimal floating point number in a reasonable
2295 number of digits. For example, NaN's, infinities, and other special
2296 values are represented in their IEEE hexadecimal format so that assembly
2297 and disassembly do not cause any bits to change in the constants.
2299 When using the hexadecimal form, constants of types half, float, and
2300 double are represented using the 16-digit form shown above (which
2301 matches the IEEE754 representation for double); half and float values
2302 must, however, be exactly representable as IEEE 754 half and single
2303 precision, respectively. Hexadecimal format is always used for long
2304 double, and there are three forms of long double. The 80-bit format used
2305 by x86 is represented as ``0xK`` followed by 20 hexadecimal digits. The
2306 128-bit format used by PowerPC (two adjacent doubles) is represented by
2307 ``0xM`` followed by 32 hexadecimal digits. The IEEE 128-bit format is
2308 represented by ``0xL`` followed by 32 hexadecimal digits. Long doubles
2309 will only work if they match the long double format on your target.
2310 The IEEE 16-bit format (half precision) is represented by ``0xH``
2311 followed by 4 hexadecimal digits. All hexadecimal formats are big-endian
2312 (sign bit at the left).
2314 There are no constants of type x86_mmx.
2316 .. _complexconstants:
2321 Complex constants are a (potentially recursive) combination of simple
2322 constants and smaller complex constants.
2324 **Structure constants**
2325 Structure constants are represented with notation similar to
2326 structure type definitions (a comma separated list of elements,
2327 surrounded by braces (``{}``)). For example:
2328 "``{ i32 4, float 17.0, i32* @G }``", where "``@G``" is declared as
2329 "``@G = external global i32``". Structure constants must have
2330 :ref:`structure type <t_struct>`, and the number and types of elements
2331 must match those specified by the type.
2333 Array constants are represented with notation similar to array type
2334 definitions (a comma separated list of elements, surrounded by
2335 square brackets (``[]``)). For example:
2336 "``[ i32 42, i32 11, i32 74 ]``". Array constants must have
2337 :ref:`array type <t_array>`, and the number and types of elements must
2338 match those specified by the type. As a special case, character array
2339 constants may also be represented as a double-quoted string using the ``c``
2340 prefix. For example: "``c"Hello World\0A\00"``".
2341 **Vector constants**
2342 Vector constants are represented with notation similar to vector
2343 type definitions (a comma separated list of elements, surrounded by
2344 less-than/greater-than's (``<>``)). For example:
2345 "``< i32 42, i32 11, i32 74, i32 100 >``". Vector constants
2346 must have :ref:`vector type <t_vector>`, and the number and types of
2347 elements must match those specified by the type.
2348 **Zero initialization**
2349 The string '``zeroinitializer``' can be used to zero initialize a
2350 value to zero of *any* type, including scalar and
2351 :ref:`aggregate <t_aggregate>` types. This is often used to avoid
2352 having to print large zero initializers (e.g. for large arrays) and
2353 is always exactly equivalent to using explicit zero initializers.
2355 A metadata node is a constant tuple without types. For example:
2356 "``!{!0, !{!2, !0}, !"test"}``". Metadata can reference constant values,
2357 for example: "``!{!0, i32 0, i8* @global, i64 (i64)* @function, !"str"}``".
2358 Unlike other typed constants that are meant to be interpreted as part of
2359 the instruction stream, metadata is a place to attach additional
2360 information such as debug info.
2362 Global Variable and Function Addresses
2363 --------------------------------------
2365 The addresses of :ref:`global variables <globalvars>` and
2366 :ref:`functions <functionstructure>` are always implicitly valid
2367 (link-time) constants. These constants are explicitly referenced when
2368 the :ref:`identifier for the global <identifiers>` is used and always have
2369 :ref:`pointer <t_pointer>` type. For example, the following is a legal LLVM
2372 .. code-block:: llvm
2376 @Z = global [2 x i32*] [ i32* @X, i32* @Y ]
2383 The string '``undef``' can be used anywhere a constant is expected, and
2384 indicates that the user of the value may receive an unspecified
2385 bit-pattern. Undefined values may be of any type (other than '``label``'
2386 or '``void``') and be used anywhere a constant is permitted.
2388 Undefined values are useful because they indicate to the compiler that
2389 the program is well defined no matter what value is used. This gives the
2390 compiler more freedom to optimize. Here are some examples of
2391 (potentially surprising) transformations that are valid (in pseudo IR):
2393 .. code-block:: llvm
2403 This is safe because all of the output bits are affected by the undef
2404 bits. Any output bit can have a zero or one depending on the input bits.
2406 .. code-block:: llvm
2417 These logical operations have bits that are not always affected by the
2418 input. For example, if ``%X`` has a zero bit, then the output of the
2419 '``and``' operation will always be a zero for that bit, no matter what
2420 the corresponding bit from the '``undef``' is. As such, it is unsafe to
2421 optimize or assume that the result of the '``and``' is '``undef``'.
2422 However, it is safe to assume that all bits of the '``undef``' could be
2423 0, and optimize the '``and``' to 0. Likewise, it is safe to assume that
2424 all the bits of the '``undef``' operand to the '``or``' could be set,
2425 allowing the '``or``' to be folded to -1.
2427 .. code-block:: llvm
2429 %A = select undef, %X, %Y
2430 %B = select undef, 42, %Y
2431 %C = select %X, %Y, undef
2441 This set of examples shows that undefined '``select``' (and conditional
2442 branch) conditions can go *either way*, but they have to come from one
2443 of the two operands. In the ``%A`` example, if ``%X`` and ``%Y`` were
2444 both known to have a clear low bit, then ``%A`` would have to have a
2445 cleared low bit. However, in the ``%C`` example, the optimizer is
2446 allowed to assume that the '``undef``' operand could be the same as
2447 ``%Y``, allowing the whole '``select``' to be eliminated.
2449 .. code-block:: llvm
2451 %A = xor undef, undef
2468 This example points out that two '``undef``' operands are not
2469 necessarily the same. This can be surprising to people (and also matches
2470 C semantics) where they assume that "``X^X``" is always zero, even if
2471 ``X`` is undefined. This isn't true for a number of reasons, but the
2472 short answer is that an '``undef``' "variable" can arbitrarily change
2473 its value over its "live range". This is true because the variable
2474 doesn't actually *have a live range*. Instead, the value is logically
2475 read from arbitrary registers that happen to be around when needed, so
2476 the value is not necessarily consistent over time. In fact, ``%A`` and
2477 ``%C`` need to have the same semantics or the core LLVM "replace all
2478 uses with" concept would not hold.
2480 .. code-block:: llvm
2488 These examples show the crucial difference between an *undefined value*
2489 and *undefined behavior*. An undefined value (like '``undef``') is
2490 allowed to have an arbitrary bit-pattern. This means that the ``%A``
2491 operation can be constant folded to '``undef``', because the '``undef``'
2492 could be an SNaN, and ``fdiv`` is not (currently) defined on SNaN's.
2493 However, in the second example, we can make a more aggressive
2494 assumption: because the ``undef`` is allowed to be an arbitrary value,
2495 we are allowed to assume that it could be zero. Since a divide by zero
2496 has *undefined behavior*, we are allowed to assume that the operation
2497 does not execute at all. This allows us to delete the divide and all
2498 code after it. Because the undefined operation "can't happen", the
2499 optimizer can assume that it occurs in dead code.
2501 .. code-block:: llvm
2503 a: store undef -> %X
2504 b: store %X -> undef
2509 These examples reiterate the ``fdiv`` example: a store *of* an undefined
2510 value can be assumed to not have any effect; we can assume that the
2511 value is overwritten with bits that happen to match what was already
2512 there. However, a store *to* an undefined location could clobber
2513 arbitrary memory, therefore, it has undefined behavior.
2520 Poison values are similar to :ref:`undef values <undefvalues>`, however
2521 they also represent the fact that an instruction or constant expression
2522 that cannot evoke side effects has nevertheless detected a condition
2523 that results in undefined behavior.
2525 There is currently no way of representing a poison value in the IR; they
2526 only exist when produced by operations such as :ref:`add <i_add>` with
2529 Poison value behavior is defined in terms of value *dependence*:
2531 - Values other than :ref:`phi <i_phi>` nodes depend on their operands.
2532 - :ref:`Phi <i_phi>` nodes depend on the operand corresponding to
2533 their dynamic predecessor basic block.
2534 - Function arguments depend on the corresponding actual argument values
2535 in the dynamic callers of their functions.
2536 - :ref:`Call <i_call>` instructions depend on the :ref:`ret <i_ret>`
2537 instructions that dynamically transfer control back to them.
2538 - :ref:`Invoke <i_invoke>` instructions depend on the
2539 :ref:`ret <i_ret>`, :ref:`resume <i_resume>`, or exception-throwing
2540 call instructions that dynamically transfer control back to them.
2541 - Non-volatile loads and stores depend on the most recent stores to all
2542 of the referenced memory addresses, following the order in the IR
2543 (including loads and stores implied by intrinsics such as
2544 :ref:`@llvm.memcpy <int_memcpy>`.)
2545 - An instruction with externally visible side effects depends on the
2546 most recent preceding instruction with externally visible side
2547 effects, following the order in the IR. (This includes :ref:`volatile
2548 operations <volatile>`.)
2549 - An instruction *control-depends* on a :ref:`terminator
2550 instruction <terminators>` if the terminator instruction has
2551 multiple successors and the instruction is always executed when
2552 control transfers to one of the successors, and may not be executed
2553 when control is transferred to another.
2554 - Additionally, an instruction also *control-depends* on a terminator
2555 instruction if the set of instructions it otherwise depends on would
2556 be different if the terminator had transferred control to a different
2558 - Dependence is transitive.
2560 Poison values have the same behavior as :ref:`undef values <undefvalues>`,
2561 with the additional effect that any instruction that has a *dependence*
2562 on a poison value has undefined behavior.
2564 Here are some examples:
2566 .. code-block:: llvm
2569 %poison = sub nuw i32 0, 1 ; Results in a poison value.
2570 %still_poison = and i32 %poison, 0 ; 0, but also poison.
2571 %poison_yet_again = getelementptr i32, i32* @h, i32 %still_poison
2572 store i32 0, i32* %poison_yet_again ; memory at @h[0] is poisoned
2574 store i32 %poison, i32* @g ; Poison value stored to memory.
2575 %poison2 = load i32, i32* @g ; Poison value loaded back from memory.
2577 store volatile i32 %poison, i32* @g ; External observation; undefined behavior.
2579 %narrowaddr = bitcast i32* @g to i16*
2580 %wideaddr = bitcast i32* @g to i64*
2581 %poison3 = load i16, i16* %narrowaddr ; Returns a poison value.
2582 %poison4 = load i64, i64* %wideaddr ; Returns a poison value.
2584 %cmp = icmp slt i32 %poison, 0 ; Returns a poison value.
2585 br i1 %cmp, label %true, label %end ; Branch to either destination.
2588 store volatile i32 0, i32* @g ; This is control-dependent on %cmp, so
2589 ; it has undefined behavior.
2593 %p = phi i32 [ 0, %entry ], [ 1, %true ]
2594 ; Both edges into this PHI are
2595 ; control-dependent on %cmp, so this
2596 ; always results in a poison value.
2598 store volatile i32 0, i32* @g ; This would depend on the store in %true
2599 ; if %cmp is true, or the store in %entry
2600 ; otherwise, so this is undefined behavior.
2602 br i1 %cmp, label %second_true, label %second_end
2603 ; The same branch again, but this time the
2604 ; true block doesn't have side effects.
2611 store volatile i32 0, i32* @g ; This time, the instruction always depends
2612 ; on the store in %end. Also, it is
2613 ; control-equivalent to %end, so this is
2614 ; well-defined (ignoring earlier undefined
2615 ; behavior in this example).
2619 Addresses of Basic Blocks
2620 -------------------------
2622 ``blockaddress(@function, %block)``
2624 The '``blockaddress``' constant computes the address of the specified
2625 basic block in the specified function, and always has an ``i8*`` type.
2626 Taking the address of the entry block is illegal.
2628 This value only has defined behavior when used as an operand to the
2629 ':ref:`indirectbr <i_indirectbr>`' instruction, or for comparisons
2630 against null. Pointer equality tests between labels addresses results in
2631 undefined behavior --- though, again, comparison against null is ok, and
2632 no label is equal to the null pointer. This may be passed around as an
2633 opaque pointer sized value as long as the bits are not inspected. This
2634 allows ``ptrtoint`` and arithmetic to be performed on these values so
2635 long as the original value is reconstituted before the ``indirectbr``
2638 Finally, some targets may provide defined semantics when using the value
2639 as the operand to an inline assembly, but that is target specific.
2643 Constant Expressions
2644 --------------------
2646 Constant expressions are used to allow expressions involving other
2647 constants to be used as constants. Constant expressions may be of any
2648 :ref:`first class <t_firstclass>` type and may involve any LLVM operation
2649 that does not have side effects (e.g. load and call are not supported).
2650 The following is the syntax for constant expressions:
2652 ``trunc (CST to TYPE)``
2653 Truncate a constant to another type. The bit size of CST must be
2654 larger than the bit size of TYPE. Both types must be integers.
2655 ``zext (CST to TYPE)``
2656 Zero extend a constant to another type. The bit size of CST must be
2657 smaller than the bit size of TYPE. Both types must be integers.
2658 ``sext (CST to TYPE)``
2659 Sign extend a constant to another type. The bit size of CST must be
2660 smaller than the bit size of TYPE. Both types must be integers.
2661 ``fptrunc (CST to TYPE)``
2662 Truncate a floating point constant to another floating point type.
2663 The size of CST must be larger than the size of TYPE. Both types
2664 must be floating point.
2665 ``fpext (CST to TYPE)``
2666 Floating point extend a constant to another type. The size of CST
2667 must be smaller or equal to the size of TYPE. Both types must be
2669 ``fptoui (CST to TYPE)``
2670 Convert a floating point constant to the corresponding unsigned
2671 integer constant. TYPE must be a scalar or vector integer type. CST
2672 must be of scalar or vector floating point type. Both CST and TYPE
2673 must be scalars, or vectors of the same number of elements. If the
2674 value won't fit in the integer type, the results are undefined.
2675 ``fptosi (CST to TYPE)``
2676 Convert a floating point constant to the corresponding signed
2677 integer constant. TYPE must be a scalar or vector integer type. CST
2678 must be of scalar or vector floating point type. Both CST and TYPE
2679 must be scalars, or vectors of the same number of elements. If the
2680 value won't fit in the integer type, the results are undefined.
2681 ``uitofp (CST to TYPE)``
2682 Convert an unsigned integer constant to the corresponding floating
2683 point constant. TYPE must be a scalar or vector floating point type.
2684 CST must be of scalar or vector integer type. Both CST and TYPE must
2685 be scalars, or vectors of the same number of elements. If the value
2686 won't fit in the floating point type, the results are undefined.
2687 ``sitofp (CST to TYPE)``
2688 Convert a signed integer constant to the corresponding floating
2689 point constant. TYPE must be a scalar or vector floating point type.
2690 CST must be of scalar or vector integer type. Both CST and TYPE must
2691 be scalars, or vectors of the same number of elements. If the value
2692 won't fit in the floating point type, the results are undefined.
2693 ``ptrtoint (CST to TYPE)``
2694 Convert a pointer typed constant to the corresponding integer
2695 constant. ``TYPE`` must be an integer type. ``CST`` must be of
2696 pointer type. The ``CST`` value is zero extended, truncated, or
2697 unchanged to make it fit in ``TYPE``.
2698 ``inttoptr (CST to TYPE)``
2699 Convert an integer constant to a pointer constant. TYPE must be a
2700 pointer type. CST must be of integer type. The CST value is zero
2701 extended, truncated, or unchanged to make it fit in a pointer size.
2702 This one is *really* dangerous!
2703 ``bitcast (CST to TYPE)``
2704 Convert a constant, CST, to another TYPE. The constraints of the
2705 operands are the same as those for the :ref:`bitcast
2706 instruction <i_bitcast>`.
2707 ``addrspacecast (CST to TYPE)``
2708 Convert a constant pointer or constant vector of pointer, CST, to another
2709 TYPE in a different address space. The constraints of the operands are the
2710 same as those for the :ref:`addrspacecast instruction <i_addrspacecast>`.
2711 ``getelementptr (TY, CSTPTR, IDX0, IDX1, ...)``, ``getelementptr inbounds (TY, CSTPTR, IDX0, IDX1, ...)``
2712 Perform the :ref:`getelementptr operation <i_getelementptr>` on
2713 constants. As with the :ref:`getelementptr <i_getelementptr>`
2714 instruction, the index list may have zero or more indexes, which are
2715 required to make sense for the type of "pointer to TY".
2716 ``select (COND, VAL1, VAL2)``
2717 Perform the :ref:`select operation <i_select>` on constants.
2718 ``icmp COND (VAL1, VAL2)``
2719 Performs the :ref:`icmp operation <i_icmp>` on constants.
2720 ``fcmp COND (VAL1, VAL2)``
2721 Performs the :ref:`fcmp operation <i_fcmp>` on constants.
2722 ``extractelement (VAL, IDX)``
2723 Perform the :ref:`extractelement operation <i_extractelement>` on
2725 ``insertelement (VAL, ELT, IDX)``
2726 Perform the :ref:`insertelement operation <i_insertelement>` on
2728 ``shufflevector (VEC1, VEC2, IDXMASK)``
2729 Perform the :ref:`shufflevector operation <i_shufflevector>` on
2731 ``extractvalue (VAL, IDX0, IDX1, ...)``
2732 Perform the :ref:`extractvalue operation <i_extractvalue>` on
2733 constants. The index list is interpreted in a similar manner as
2734 indices in a ':ref:`getelementptr <i_getelementptr>`' operation. At
2735 least one index value must be specified.
2736 ``insertvalue (VAL, ELT, IDX0, IDX1, ...)``
2737 Perform the :ref:`insertvalue operation <i_insertvalue>` on constants.
2738 The index list is interpreted in a similar manner as indices in a
2739 ':ref:`getelementptr <i_getelementptr>`' operation. At least one index
2740 value must be specified.
2741 ``OPCODE (LHS, RHS)``
2742 Perform the specified operation of the LHS and RHS constants. OPCODE
2743 may be any of the :ref:`binary <binaryops>` or :ref:`bitwise
2744 binary <bitwiseops>` operations. The constraints on operands are
2745 the same as those for the corresponding instruction (e.g. no bitwise
2746 operations on floating point values are allowed).
2753 Inline Assembler Expressions
2754 ----------------------------
2756 LLVM supports inline assembler expressions (as opposed to :ref:`Module-Level
2757 Inline Assembly <moduleasm>`) through the use of a special value. This
2758 value represents the inline assembler as a string (containing the
2759 instructions to emit), a list of operand constraints (stored as a
2760 string), a flag that indicates whether or not the inline asm expression
2761 has side effects, and a flag indicating whether the function containing
2762 the asm needs to align its stack conservatively. An example inline
2763 assembler expression is:
2765 .. code-block:: llvm
2767 i32 (i32) asm "bswap $0", "=r,r"
2769 Inline assembler expressions may **only** be used as the callee operand
2770 of a :ref:`call <i_call>` or an :ref:`invoke <i_invoke>` instruction.
2771 Thus, typically we have:
2773 .. code-block:: llvm
2775 %X = call i32 asm "bswap $0", "=r,r"(i32 %Y)
2777 Inline asms with side effects not visible in the constraint list must be
2778 marked as having side effects. This is done through the use of the
2779 '``sideeffect``' keyword, like so:
2781 .. code-block:: llvm
2783 call void asm sideeffect "eieio", ""()
2785 In some cases inline asms will contain code that will not work unless
2786 the stack is aligned in some way, such as calls or SSE instructions on
2787 x86, yet will not contain code that does that alignment within the asm.
2788 The compiler should make conservative assumptions about what the asm
2789 might contain and should generate its usual stack alignment code in the
2790 prologue if the '``alignstack``' keyword is present:
2792 .. code-block:: llvm
2794 call void asm alignstack "eieio", ""()
2796 Inline asms also support using non-standard assembly dialects. The
2797 assumed dialect is ATT. When the '``inteldialect``' keyword is present,
2798 the inline asm is using the Intel dialect. Currently, ATT and Intel are
2799 the only supported dialects. An example is:
2801 .. code-block:: llvm
2803 call void asm inteldialect "eieio", ""()
2805 If multiple keywords appear the '``sideeffect``' keyword must come
2806 first, the '``alignstack``' keyword second and the '``inteldialect``'
2812 The call instructions that wrap inline asm nodes may have a
2813 "``!srcloc``" MDNode attached to it that contains a list of constant
2814 integers. If present, the code generator will use the integer as the
2815 location cookie value when report errors through the ``LLVMContext``
2816 error reporting mechanisms. This allows a front-end to correlate backend
2817 errors that occur with inline asm back to the source code that produced
2820 .. code-block:: llvm
2822 call void asm sideeffect "something bad", ""(), !srcloc !42
2824 !42 = !{ i32 1234567 }
2826 It is up to the front-end to make sense of the magic numbers it places
2827 in the IR. If the MDNode contains multiple constants, the code generator
2828 will use the one that corresponds to the line of the asm that the error
2836 LLVM IR allows metadata to be attached to instructions in the program
2837 that can convey extra information about the code to the optimizers and
2838 code generator. One example application of metadata is source-level
2839 debug information. There are two metadata primitives: strings and nodes.
2841 Metadata does not have a type, and is not a value. If referenced from a
2842 ``call`` instruction, it uses the ``metadata`` type.
2844 All metadata are identified in syntax by a exclamation point ('``!``').
2846 .. _metadata-string:
2848 Metadata Nodes and Metadata Strings
2849 -----------------------------------
2851 A metadata string is a string surrounded by double quotes. It can
2852 contain any character by escaping non-printable characters with
2853 "``\xx``" where "``xx``" is the two digit hex code. For example:
2856 Metadata nodes are represented with notation similar to structure
2857 constants (a comma separated list of elements, surrounded by braces and
2858 preceded by an exclamation point). Metadata nodes can have any values as
2859 their operand. For example:
2861 .. code-block:: llvm
2863 !{ !"test\00", i32 10}
2865 Metadata nodes that aren't uniqued use the ``distinct`` keyword. For example:
2867 .. code-block:: llvm
2869 !0 = distinct !{!"test\00", i32 10}
2871 ``distinct`` nodes are useful when nodes shouldn't be merged based on their
2872 content. They can also occur when transformations cause uniquing collisions
2873 when metadata operands change.
2875 A :ref:`named metadata <namedmetadatastructure>` is a collection of
2876 metadata nodes, which can be looked up in the module symbol table. For
2879 .. code-block:: llvm
2883 Metadata can be used as function arguments. Here ``llvm.dbg.value``
2884 function is using two metadata arguments:
2886 .. code-block:: llvm
2888 call void @llvm.dbg.value(metadata !24, i64 0, metadata !25)
2890 Metadata can be attached with an instruction. Here metadata ``!21`` is
2891 attached to the ``add`` instruction using the ``!dbg`` identifier:
2893 .. code-block:: llvm
2895 %indvar.next = add i64 %indvar, 1, !dbg !21
2897 More information about specific metadata nodes recognized by the
2898 optimizers and code generator is found below.
2900 Specialized Metadata Nodes
2901 ^^^^^^^^^^^^^^^^^^^^^^^^^^
2903 Specialized metadata nodes are custom data structures in metadata (as opposed
2904 to generic tuples). Their fields are labelled, and can be specified in any
2907 These aren't inherently debug info centric, but currently all the specialized
2908 metadata nodes are related to debug info.
2913 ``MDCompileUnit`` nodes represent a compile unit. The ``enums:``,
2914 ``retainedTypes:``, ``subprograms:``, ``globals:`` and ``imports:`` fields are
2915 tuples containing the debug info to be emitted along with the compile unit,
2916 regardless of code optimizations (some nodes are only emitted if there are
2917 references to them from instructions).
2919 .. code-block:: llvm
2921 !0 = !MDCompileUnit(language: DW_LANG_C99, file: !1, producer: "clang",
2922 isOptimized: true, flags: "-O2", runtimeVersion: 2,
2923 splitDebugFilename: "abc.debug", emissionKind: 1,
2924 enums: !2, retainedTypes: !3, subprograms: !4,
2925 globals: !5, imports: !6)
2930 ``MDFile`` nodes represent files. The ``filename:`` can include slashes.
2932 .. code-block:: llvm
2934 !0 = !MDFile(filename: "path/to/file", directory: "/path/to/dir")
2941 ``MDBasicType`` nodes represent primitive types. ``tag:`` defaults to
2942 ``DW_TAG_base_type``.
2944 .. code-block:: llvm
2946 !0 = !MDBasicType(name: "unsigned char", size: 8, align: 8,
2947 encoding: DW_ATE_unsigned_char)
2948 !1 = !MDBasicType(tag: DW_TAG_unspecified_type, name: "decltype(nullptr)")
2950 .. _MDSubroutineType:
2955 ``MDSubroutineType`` nodes represent subroutine types. Their ``types:`` field
2956 refers to a tuple; the first operand is the return type, while the rest are the
2957 types of the formal arguments in order. If the first operand is ``null``, that
2958 represents a function with no return value (such as ``void foo() {}`` in C++).
2960 .. code-block:: llvm
2962 !0 = !BasicType(name: "int", size: 32, align: 32, DW_ATE_signed)
2963 !1 = !BasicType(name: "char", size: 8, align: 8, DW_ATE_signed_char)
2964 !2 = !MDSubroutineType(types: !{null, !0, !1}) ; void (int, char)
2969 ``MDDerivedType`` nodes represent types derived from other types, such as
2972 .. code-block:: llvm
2974 !0 = !MDBasicType(name: "unsigned char", size: 8, align: 8,
2975 encoding: DW_ATE_unsigned_char)
2976 !1 = !MDDerivedType(tag: DW_TAG_pointer_type, baseType: !0, size: 32,
2979 .. _MDCompositeType:
2984 ``MDCompositeType`` nodes represent types composed of other types, like
2985 structures and unions. ``elements:`` points to a tuple of the composed types.
2987 If the source language supports ODR, the ``identifier:`` field gives the unique
2988 identifier used for type merging between modules. When specified, other types
2989 can refer to composite types indirectly via a :ref:`metadata string
2990 <metadata-string>` that matches their identifier.
2992 .. code-block:: llvm
2994 !0 = !MDEnumerator(name: "SixKind", value: 7)
2995 !1 = !MDEnumerator(name: "SevenKind", value: 7)
2996 !2 = !MDEnumerator(name: "NegEightKind", value: -8)
2997 !3 = !MDCompositeType(tag: DW_TAG_enumeration_type, name: "Enum", file: !12,
2998 line: 2, size: 32, align: 32, identifier: "_M4Enum",
2999 elements: !{!0, !1, !2})
3004 ``MDSubrange`` nodes are the elements for ``DW_TAG_array_type`` variants of
3005 :ref:`MDCompositeType`. ``count: -1`` indicates an empty array.
3007 .. code-block:: llvm
3009 !0 = !MDSubrange(count: 5, lowerBound: 0) ; array counting from 0
3010 !1 = !MDSubrange(count: 5, lowerBound: 1) ; array counting from 1
3011 !2 = !MDSubrange(count: -1) ; empty array.
3016 ``MDEnumerator`` nodes are the elements for ``DW_TAG_enumeration_type``
3017 variants of :ref:`MDCompositeType`.
3019 .. code-block:: llvm
3021 !0 = !MDEnumerator(name: "SixKind", value: 7)
3022 !1 = !MDEnumerator(name: "SevenKind", value: 7)
3023 !2 = !MDEnumerator(name: "NegEightKind", value: -8)
3025 MDTemplateTypeParameter
3026 """""""""""""""""""""""
3028 ``MDTemplateTypeParameter`` nodes represent type parameters to generic source
3029 language constructs. They are used (optionally) in :ref:`MDCompositeType` and
3030 :ref:`MDSubprogram` ``templateParams:`` fields.
3032 .. code-block:: llvm
3034 !0 = !MDTemplateTypeParameter(name: "Ty", type: !1)
3036 MDTemplateValueParameter
3037 """"""""""""""""""""""""
3039 ``MDTemplateValueParameter`` nodes represent value parameters to generic source
3040 language constructs. ``tag:`` defaults to ``DW_TAG_template_value_parameter``,
3041 but if specified can also be set to ``DW_TAG_GNU_template_template_param`` or
3042 ``DW_TAG_GNU_template_param_pack``. They are used (optionally) in
3043 :ref:`MDCompositeType` and :ref:`MDSubprogram` ``templateParams:`` fields.
3045 .. code-block:: llvm
3047 !0 = !MDTemplateValueParameter(name: "Ty", type: !1, value: i32 7)
3052 ``MDNamespace`` nodes represent namespaces in the source language.
3054 .. code-block:: llvm
3056 !0 = !MDNamespace(name: "myawesomeproject", scope: !1, file: !2, line: 7)
3061 ``MDGlobalVariable`` nodes represent global variables in the source language.
3063 .. code-block:: llvm
3065 !0 = !MDGlobalVariable(name: "foo", linkageName: "foo", scope: !1,
3066 file: !2, line: 7, type: !3, isLocal: true,
3067 isDefinition: false, variable: i32* @foo,
3075 ``MDSubprogram`` nodes represent functions from the source language. The
3076 ``variables:`` field points at :ref:`variables <MDLocalVariable>` that must be
3077 retained, even if their IR counterparts are optimized out of the IR. The
3078 ``type:`` field must point at an :ref:`MDSubroutineType`.
3080 .. code-block:: llvm
3082 !0 = !MDSubprogram(name: "foo", linkageName: "_Zfoov", scope: !1,
3083 file: !2, line: 7, type: !3, isLocal: true,
3084 isDefinition: false, scopeLine: 8, containingType: !4,
3085 virtuality: DW_VIRTUALITY_pure_virtual, virtualIndex: 10,
3086 flags: DIFlagPrototyped, isOptimized: true,
3087 function: void ()* @_Z3foov,
3088 templateParams: !5, declaration: !6, variables: !7)
3095 ``MDLexicalBlock`` nodes represent lexical blocks in the source language (a
3098 .. code-block:: llvm
3100 !0 = !MDLexicalBlock(scope: !1, file: !2, line: 7, column: 35)
3102 .. _MDLexicalBlockFile:
3107 ``MDLexicalBlockFile`` nodes are used to discriminate between sections of a
3108 :ref:`lexical block <MDLexicalBlock>`. The ``file:`` field can be changed to
3109 indicate textual inclusion, or the ``discriminator:`` field can be used to
3110 discriminate between control flow within a single block in the source language.
3112 .. code-block:: llvm
3114 !0 = !MDLexicalBlock(scope: !3, file: !4, line: 7, column: 35)
3115 !1 = !MDLexicalBlockFile(scope: !0, file: !4, discriminator: 0)
3116 !2 = !MDLexicalBlockFile(scope: !0, file: !4, discriminator: 1)
3121 ``MDLocation`` nodes represent source debug locations. The ``scope:`` field is
3122 mandatory, and points at an :ref:`MDLexicalBlockFile`, an
3123 :ref:`MDLexicalBlock`, or an :ref:`MDSubprogram`.
3125 .. code-block:: llvm
3127 !0 = !MDLocation(line: 2900, column: 42, scope: !1, inlinedAt: !2)
3129 .. _MDLocalVariable:
3134 ``MDLocalVariable`` nodes represent local variables in the source language.
3135 Instead of ``DW_TAG_variable``, they use LLVM-specific fake tags to
3136 discriminate between local variables (``DW_TAG_auto_variable``) and subprogram
3137 arguments (``DW_TAG_arg_variable``). In the latter case, the ``arg:`` field
3138 specifies the argument position, and this variable will be included in the
3139 ``variables:`` field of its :ref:`MDSubprogram`.
3141 If set, the ``inlinedAt:`` field points at an :ref:`MDLocation`, and the
3142 variable represents an inlined version of a variable (with all other fields
3143 duplicated from the non-inlined version).
3145 .. code-block:: llvm
3147 !0 = !MDLocalVariable(tag: DW_TAG_arg_variable, name: "this", arg: 0,
3148 scope: !3, file: !2, line: 7, type: !3,
3149 flags: DIFlagArtificial, inlinedAt: !4)
3150 !1 = !MDLocalVariable(tag: DW_TAG_arg_variable, name: "x", arg: 1,
3151 scope: !4, file: !2, line: 7, type: !3,
3153 !1 = !MDLocalVariable(tag: DW_TAG_auto_variable, name: "y",
3154 scope: !5, file: !2, line: 7, type: !3,
3160 ``MDExpression`` nodes represent DWARF expression sequences. They are used in
3161 :ref:`debug intrinsics<dbg_intrinsics>` (such as ``llvm.dbg.declare``) to
3162 describe how the referenced LLVM variable relates to the source language
3165 The current supported vocabulary is limited:
3167 - ``DW_OP_deref`` dereferences the working expression.
3168 - ``DW_OP_plus, 93`` adds ``93`` to the working expression.
3169 - ``DW_OP_bit_piece, 16, 8`` specifies the offset and size (``16`` and ``8``
3170 here, respectively) of the variable piece from the working expression.
3172 .. code-block:: llvm
3174 !0 = !MDExpression(DW_OP_deref)
3175 !1 = !MDExpression(DW_OP_plus, 3)
3176 !2 = !MDExpression(DW_OP_bit_piece, 3, 7)
3177 !3 = !MDExpression(DW_OP_deref, DW_OP_plus, 3, DW_OP_bit_piece, 3, 7)
3182 ``MDObjCProperty`` nodes represent Objective-C property nodes.
3184 .. code-block:: llvm
3186 !3 = !MDObjCProperty(name: "foo", file: !1, line: 7, setter: "setFoo",
3187 getter: "getFoo", attributes: 7, type: !2)
3192 ``MDImportedEntity`` nodes represent entities (such as modules) imported into a
3195 .. code-block:: llvm
3197 !2 = !MDImportedEntity(tag: DW_TAG_imported_module, name: "foo", scope: !0,
3198 entity: !1, line: 7)
3203 In LLVM IR, memory does not have types, so LLVM's own type system is not
3204 suitable for doing TBAA. Instead, metadata is added to the IR to
3205 describe a type system of a higher level language. This can be used to
3206 implement typical C/C++ TBAA, but it can also be used to implement
3207 custom alias analysis behavior for other languages.
3209 The current metadata format is very simple. TBAA metadata nodes have up
3210 to three fields, e.g.:
3212 .. code-block:: llvm
3214 !0 = !{ !"an example type tree" }
3215 !1 = !{ !"int", !0 }
3216 !2 = !{ !"float", !0 }
3217 !3 = !{ !"const float", !2, i64 1 }
3219 The first field is an identity field. It can be any value, usually a
3220 metadata string, which uniquely identifies the type. The most important
3221 name in the tree is the name of the root node. Two trees with different
3222 root node names are entirely disjoint, even if they have leaves with
3225 The second field identifies the type's parent node in the tree, or is
3226 null or omitted for a root node. A type is considered to alias all of
3227 its descendants and all of its ancestors in the tree. Also, a type is
3228 considered to alias all types in other trees, so that bitcode produced
3229 from multiple front-ends is handled conservatively.
3231 If the third field is present, it's an integer which if equal to 1
3232 indicates that the type is "constant" (meaning
3233 ``pointsToConstantMemory`` should return true; see `other useful
3234 AliasAnalysis methods <AliasAnalysis.html#OtherItfs>`_).
3236 '``tbaa.struct``' Metadata
3237 ^^^^^^^^^^^^^^^^^^^^^^^^^^
3239 The :ref:`llvm.memcpy <int_memcpy>` is often used to implement
3240 aggregate assignment operations in C and similar languages, however it
3241 is defined to copy a contiguous region of memory, which is more than
3242 strictly necessary for aggregate types which contain holes due to
3243 padding. Also, it doesn't contain any TBAA information about the fields
3246 ``!tbaa.struct`` metadata can describe which memory subregions in a
3247 memcpy are padding and what the TBAA tags of the struct are.
3249 The current metadata format is very simple. ``!tbaa.struct`` metadata
3250 nodes are a list of operands which are in conceptual groups of three.
3251 For each group of three, the first operand gives the byte offset of a
3252 field in bytes, the second gives its size in bytes, and the third gives
3255 .. code-block:: llvm
3257 !4 = !{ i64 0, i64 4, !1, i64 8, i64 4, !2 }
3259 This describes a struct with two fields. The first is at offset 0 bytes
3260 with size 4 bytes, and has tbaa tag !1. The second is at offset 8 bytes
3261 and has size 4 bytes and has tbaa tag !2.
3263 Note that the fields need not be contiguous. In this example, there is a
3264 4 byte gap between the two fields. This gap represents padding which
3265 does not carry useful data and need not be preserved.
3267 '``noalias``' and '``alias.scope``' Metadata
3268 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
3270 ``noalias`` and ``alias.scope`` metadata provide the ability to specify generic
3271 noalias memory-access sets. This means that some collection of memory access
3272 instructions (loads, stores, memory-accessing calls, etc.) that carry
3273 ``noalias`` metadata can specifically be specified not to alias with some other
3274 collection of memory access instructions that carry ``alias.scope`` metadata.
3275 Each type of metadata specifies a list of scopes where each scope has an id and
3276 a domain. When evaluating an aliasing query, if for some some domain, the set
3277 of scopes with that domain in one instruction's ``alias.scope`` list is a
3278 subset of (or equal to) the set of scopes for that domain in another
3279 instruction's ``noalias`` list, then the two memory accesses are assumed not to
3282 The metadata identifying each domain is itself a list containing one or two
3283 entries. The first entry is the name of the domain. Note that if the name is a
3284 string then it can be combined accross functions and translation units. A
3285 self-reference can be used to create globally unique domain names. A
3286 descriptive string may optionally be provided as a second list entry.
3288 The metadata identifying each scope is also itself a list containing two or
3289 three entries. The first entry is the name of the scope. Note that if the name
3290 is a string then it can be combined accross functions and translation units. A
3291 self-reference can be used to create globally unique scope names. A metadata
3292 reference to the scope's domain is the second entry. A descriptive string may
3293 optionally be provided as a third list entry.
3297 .. code-block:: llvm
3299 ; Two scope domains:
3303 ; Some scopes in these domains:
3309 !5 = !{!4} ; A list containing only scope !4
3313 ; These two instructions don't alias:
3314 %0 = load float, float* %c, align 4, !alias.scope !5
3315 store float %0, float* %arrayidx.i, align 4, !noalias !5
3317 ; These two instructions also don't alias (for domain !1, the set of scopes
3318 ; in the !alias.scope equals that in the !noalias list):
3319 %2 = load float, float* %c, align 4, !alias.scope !5
3320 store float %2, float* %arrayidx.i2, align 4, !noalias !6
3322 ; These two instructions don't alias (for domain !0, the set of scopes in
3323 ; the !noalias list is not a superset of, or equal to, the scopes in the
3324 ; !alias.scope list):
3325 %2 = load float, float* %c, align 4, !alias.scope !6
3326 store float %0, float* %arrayidx.i, align 4, !noalias !7
3328 '``fpmath``' Metadata
3329 ^^^^^^^^^^^^^^^^^^^^^
3331 ``fpmath`` metadata may be attached to any instruction of floating point
3332 type. It can be used to express the maximum acceptable error in the
3333 result of that instruction, in ULPs, thus potentially allowing the
3334 compiler to use a more efficient but less accurate method of computing
3335 it. ULP is defined as follows:
3337 If ``x`` is a real number that lies between two finite consecutive
3338 floating-point numbers ``a`` and ``b``, without being equal to one
3339 of them, then ``ulp(x) = |b - a|``, otherwise ``ulp(x)`` is the
3340 distance between the two non-equal finite floating-point numbers
3341 nearest ``x``. Moreover, ``ulp(NaN)`` is ``NaN``.
3343 The metadata node shall consist of a single positive floating point
3344 number representing the maximum relative error, for example:
3346 .. code-block:: llvm
3348 !0 = !{ float 2.5 } ; maximum acceptable inaccuracy is 2.5 ULPs
3352 '``range``' Metadata
3353 ^^^^^^^^^^^^^^^^^^^^
3355 ``range`` metadata may be attached only to ``load``, ``call`` and ``invoke`` of
3356 integer types. It expresses the possible ranges the loaded value or the value
3357 returned by the called function at this call site is in. The ranges are
3358 represented with a flattened list of integers. The loaded value or the value
3359 returned is known to be in the union of the ranges defined by each consecutive
3360 pair. Each pair has the following properties:
3362 - The type must match the type loaded by the instruction.
3363 - The pair ``a,b`` represents the range ``[a,b)``.
3364 - Both ``a`` and ``b`` are constants.
3365 - The range is allowed to wrap.
3366 - The range should not represent the full or empty set. That is,
3369 In addition, the pairs must be in signed order of the lower bound and
3370 they must be non-contiguous.
3374 .. code-block:: llvm
3376 %a = load i8, i8* %x, align 1, !range !0 ; Can only be 0 or 1
3377 %b = load i8, i8* %y, align 1, !range !1 ; Can only be 255 (-1), 0 or 1
3378 %c = call i8 @foo(), !range !2 ; Can only be 0, 1, 3, 4 or 5
3379 %d = invoke i8 @bar() to label %cont
3380 unwind label %lpad, !range !3 ; Can only be -2, -1, 3, 4 or 5
3382 !0 = !{ i8 0, i8 2 }
3383 !1 = !{ i8 255, i8 2 }
3384 !2 = !{ i8 0, i8 2, i8 3, i8 6 }
3385 !3 = !{ i8 -2, i8 0, i8 3, i8 6 }
3390 It is sometimes useful to attach information to loop constructs. Currently,
3391 loop metadata is implemented as metadata attached to the branch instruction
3392 in the loop latch block. This type of metadata refer to a metadata node that is
3393 guaranteed to be separate for each loop. The loop identifier metadata is
3394 specified with the name ``llvm.loop``.
3396 The loop identifier metadata is implemented using a metadata that refers to
3397 itself to avoid merging it with any other identifier metadata, e.g.,
3398 during module linkage or function inlining. That is, each loop should refer
3399 to their own identification metadata even if they reside in separate functions.
3400 The following example contains loop identifier metadata for two separate loop
3403 .. code-block:: llvm
3408 The loop identifier metadata can be used to specify additional
3409 per-loop metadata. Any operands after the first operand can be treated
3410 as user-defined metadata. For example the ``llvm.loop.unroll.count``
3411 suggests an unroll factor to the loop unroller:
3413 .. code-block:: llvm
3415 br i1 %exitcond, label %._crit_edge, label %.lr.ph, !llvm.loop !0
3418 !1 = !{!"llvm.loop.unroll.count", i32 4}
3420 '``llvm.loop.vectorize``' and '``llvm.loop.interleave``'
3421 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
3423 Metadata prefixed with ``llvm.loop.vectorize`` or ``llvm.loop.interleave`` are
3424 used to control per-loop vectorization and interleaving parameters such as
3425 vectorization width and interleave count. These metadata should be used in
3426 conjunction with ``llvm.loop`` loop identification metadata. The
3427 ``llvm.loop.vectorize`` and ``llvm.loop.interleave`` metadata are only
3428 optimization hints and the optimizer will only interleave and vectorize loops if
3429 it believes it is safe to do so. The ``llvm.mem.parallel_loop_access`` metadata
3430 which contains information about loop-carried memory dependencies can be helpful
3431 in determining the safety of these transformations.
3433 '``llvm.loop.interleave.count``' Metadata
3434 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
3436 This metadata suggests an interleave count to the loop interleaver.
3437 The first operand is the string ``llvm.loop.interleave.count`` and the
3438 second operand is an integer specifying the interleave count. For
3441 .. code-block:: llvm
3443 !0 = !{!"llvm.loop.interleave.count", i32 4}
3445 Note that setting ``llvm.loop.interleave.count`` to 1 disables interleaving
3446 multiple iterations of the loop. If ``llvm.loop.interleave.count`` is set to 0
3447 then the interleave count will be determined automatically.
3449 '``llvm.loop.vectorize.enable``' Metadata
3450 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
3452 This metadata selectively enables or disables vectorization for the loop. The
3453 first operand is the string ``llvm.loop.vectorize.enable`` and the second operand
3454 is a bit. If the bit operand value is 1 vectorization is enabled. A value of
3455 0 disables vectorization:
3457 .. code-block:: llvm
3459 !0 = !{!"llvm.loop.vectorize.enable", i1 0}
3460 !1 = !{!"llvm.loop.vectorize.enable", i1 1}
3462 '``llvm.loop.vectorize.width``' Metadata
3463 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
3465 This metadata sets the target width of the vectorizer. The first
3466 operand is the string ``llvm.loop.vectorize.width`` and the second
3467 operand is an integer specifying the width. For example:
3469 .. code-block:: llvm
3471 !0 = !{!"llvm.loop.vectorize.width", i32 4}
3473 Note that setting ``llvm.loop.vectorize.width`` to 1 disables
3474 vectorization of the loop. If ``llvm.loop.vectorize.width`` is set to
3475 0 or if the loop does not have this metadata the width will be
3476 determined automatically.
3478 '``llvm.loop.unroll``'
3479 ^^^^^^^^^^^^^^^^^^^^^^
3481 Metadata prefixed with ``llvm.loop.unroll`` are loop unrolling
3482 optimization hints such as the unroll factor. ``llvm.loop.unroll``
3483 metadata should be used in conjunction with ``llvm.loop`` loop
3484 identification metadata. The ``llvm.loop.unroll`` metadata are only
3485 optimization hints and the unrolling will only be performed if the
3486 optimizer believes it is safe to do so.
3488 '``llvm.loop.unroll.count``' Metadata
3489 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
3491 This metadata suggests an unroll factor to the loop unroller. The
3492 first operand is the string ``llvm.loop.unroll.count`` and the second
3493 operand is a positive integer specifying the unroll factor. For
3496 .. code-block:: llvm
3498 !0 = !{!"llvm.loop.unroll.count", i32 4}
3500 If the trip count of the loop is less than the unroll count the loop
3501 will be partially unrolled.
3503 '``llvm.loop.unroll.disable``' Metadata
3504 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
3506 This metadata either disables loop unrolling. The metadata has a single operand
3507 which is the string ``llvm.loop.unroll.disable``. For example:
3509 .. code-block:: llvm
3511 !0 = !{!"llvm.loop.unroll.disable"}
3513 '``llvm.loop.unroll.runtime.disable``' Metadata
3514 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
3516 This metadata either disables runtime loop unrolling. The metadata has a single
3517 operand which is the string ``llvm.loop.unroll.runtime.disable``. For example:
3519 .. code-block:: llvm
3521 !0 = !{!"llvm.loop.unroll.runtime.disable"}
3523 '``llvm.loop.unroll.full``' Metadata
3524 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
3526 This metadata either suggests that the loop should be unrolled fully. The
3527 metadata has a single operand which is the string ``llvm.loop.unroll.disable``.
3530 .. code-block:: llvm
3532 !0 = !{!"llvm.loop.unroll.full"}
3537 Metadata types used to annotate memory accesses with information helpful
3538 for optimizations are prefixed with ``llvm.mem``.
3540 '``llvm.mem.parallel_loop_access``' Metadata
3541 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
3543 The ``llvm.mem.parallel_loop_access`` metadata refers to a loop identifier,
3544 or metadata containing a list of loop identifiers for nested loops.
3545 The metadata is attached to memory accessing instructions and denotes that
3546 no loop carried memory dependence exist between it and other instructions denoted
3547 with the same loop identifier.
3549 Precisely, given two instructions ``m1`` and ``m2`` that both have the
3550 ``llvm.mem.parallel_loop_access`` metadata, with ``L1`` and ``L2`` being the
3551 set of loops associated with that metadata, respectively, then there is no loop
3552 carried dependence between ``m1`` and ``m2`` for loops in both ``L1`` and
3555 As a special case, if all memory accessing instructions in a loop have
3556 ``llvm.mem.parallel_loop_access`` metadata that refers to that loop, then the
3557 loop has no loop carried memory dependences and is considered to be a parallel
3560 Note that if not all memory access instructions have such metadata referring to
3561 the loop, then the loop is considered not being trivially parallel. Additional
3562 memory dependence analysis is required to make that determination. As a fail
3563 safe mechanism, this causes loops that were originally parallel to be considered
3564 sequential (if optimization passes that are unaware of the parallel semantics
3565 insert new memory instructions into the loop body).
3567 Example of a loop that is considered parallel due to its correct use of
3568 both ``llvm.loop`` and ``llvm.mem.parallel_loop_access``
3569 metadata types that refer to the same loop identifier metadata.
3571 .. code-block:: llvm
3575 %val0 = load i32, i32* %arrayidx, !llvm.mem.parallel_loop_access !0
3577 store i32 %val0, i32* %arrayidx1, !llvm.mem.parallel_loop_access !0
3579 br i1 %exitcond, label %for.end, label %for.body, !llvm.loop !0
3585 It is also possible to have nested parallel loops. In that case the
3586 memory accesses refer to a list of loop identifier metadata nodes instead of
3587 the loop identifier metadata node directly:
3589 .. code-block:: llvm
3593 %val1 = load i32, i32* %arrayidx3, !llvm.mem.parallel_loop_access !2
3595 br label %inner.for.body
3599 %val0 = load i32, i32* %arrayidx1, !llvm.mem.parallel_loop_access !0
3601 store i32 %val0, i32* %arrayidx2, !llvm.mem.parallel_loop_access !0
3603 br i1 %exitcond, label %inner.for.end, label %inner.for.body, !llvm.loop !1
3607 store i32 %val1, i32* %arrayidx4, !llvm.mem.parallel_loop_access !2
3609 br i1 %exitcond, label %outer.for.end, label %outer.for.body, !llvm.loop !2
3611 outer.for.end: ; preds = %for.body
3613 !0 = !{!1, !2} ; a list of loop identifiers
3614 !1 = !{!1} ; an identifier for the inner loop
3615 !2 = !{!2} ; an identifier for the outer loop
3620 The ``llvm.bitsets`` global metadata is used to implement
3621 :doc:`bitsets <BitSets>`.
3623 Module Flags Metadata
3624 =====================
3626 Information about the module as a whole is difficult to convey to LLVM's
3627 subsystems. The LLVM IR isn't sufficient to transmit this information.
3628 The ``llvm.module.flags`` named metadata exists in order to facilitate
3629 this. These flags are in the form of key / value pairs --- much like a
3630 dictionary --- making it easy for any subsystem who cares about a flag to
3633 The ``llvm.module.flags`` metadata contains a list of metadata triplets.
3634 Each triplet has the following form:
3636 - The first element is a *behavior* flag, which specifies the behavior
3637 when two (or more) modules are merged together, and it encounters two
3638 (or more) metadata with the same ID. The supported behaviors are
3640 - The second element is a metadata string that is a unique ID for the
3641 metadata. Each module may only have one flag entry for each unique ID (not
3642 including entries with the **Require** behavior).
3643 - The third element is the value of the flag.
3645 When two (or more) modules are merged together, the resulting
3646 ``llvm.module.flags`` metadata is the union of the modules' flags. That is, for
3647 each unique metadata ID string, there will be exactly one entry in the merged
3648 modules ``llvm.module.flags`` metadata table, and the value for that entry will
3649 be determined by the merge behavior flag, as described below. The only exception
3650 is that entries with the *Require* behavior are always preserved.
3652 The following behaviors are supported:
3663 Emits an error if two values disagree, otherwise the resulting value
3664 is that of the operands.
3668 Emits a warning if two values disagree. The result value will be the
3669 operand for the flag from the first module being linked.
3673 Adds a requirement that another module flag be present and have a
3674 specified value after linking is performed. The value must be a
3675 metadata pair, where the first element of the pair is the ID of the
3676 module flag to be restricted, and the second element of the pair is
3677 the value the module flag should be restricted to. This behavior can
3678 be used to restrict the allowable results (via triggering of an
3679 error) of linking IDs with the **Override** behavior.
3683 Uses the specified value, regardless of the behavior or value of the
3684 other module. If both modules specify **Override**, but the values
3685 differ, an error will be emitted.
3689 Appends the two values, which are required to be metadata nodes.
3693 Appends the two values, which are required to be metadata
3694 nodes. However, duplicate entries in the second list are dropped
3695 during the append operation.
3697 It is an error for a particular unique flag ID to have multiple behaviors,
3698 except in the case of **Require** (which adds restrictions on another metadata
3699 value) or **Override**.
3701 An example of module flags:
3703 .. code-block:: llvm
3705 !0 = !{ i32 1, !"foo", i32 1 }
3706 !1 = !{ i32 4, !"bar", i32 37 }
3707 !2 = !{ i32 2, !"qux", i32 42 }
3708 !3 = !{ i32 3, !"qux",
3713 !llvm.module.flags = !{ !0, !1, !2, !3 }
3715 - Metadata ``!0`` has the ID ``!"foo"`` and the value '1'. The behavior
3716 if two or more ``!"foo"`` flags are seen is to emit an error if their
3717 values are not equal.
3719 - Metadata ``!1`` has the ID ``!"bar"`` and the value '37'. The
3720 behavior if two or more ``!"bar"`` flags are seen is to use the value
3723 - Metadata ``!2`` has the ID ``!"qux"`` and the value '42'. The
3724 behavior if two or more ``!"qux"`` flags are seen is to emit a
3725 warning if their values are not equal.
3727 - Metadata ``!3`` has the ID ``!"qux"`` and the value:
3733 The behavior is to emit an error if the ``llvm.module.flags`` does not
3734 contain a flag with the ID ``!"foo"`` that has the value '1' after linking is
3737 Objective-C Garbage Collection Module Flags Metadata
3738 ----------------------------------------------------
3740 On the Mach-O platform, Objective-C stores metadata about garbage
3741 collection in a special section called "image info". The metadata
3742 consists of a version number and a bitmask specifying what types of
3743 garbage collection are supported (if any) by the file. If two or more
3744 modules are linked together their garbage collection metadata needs to
3745 be merged rather than appended together.
3747 The Objective-C garbage collection module flags metadata consists of the
3748 following key-value pairs:
3757 * - ``Objective-C Version``
3758 - **[Required]** --- The Objective-C ABI version. Valid values are 1 and 2.
3760 * - ``Objective-C Image Info Version``
3761 - **[Required]** --- The version of the image info section. Currently
3764 * - ``Objective-C Image Info Section``
3765 - **[Required]** --- The section to place the metadata. Valid values are
3766 ``"__OBJC, __image_info, regular"`` for Objective-C ABI version 1, and
3767 ``"__DATA,__objc_imageinfo, regular, no_dead_strip"`` for
3768 Objective-C ABI version 2.
3770 * - ``Objective-C Garbage Collection``
3771 - **[Required]** --- Specifies whether garbage collection is supported or
3772 not. Valid values are 0, for no garbage collection, and 2, for garbage
3773 collection supported.
3775 * - ``Objective-C GC Only``
3776 - **[Optional]** --- Specifies that only garbage collection is supported.
3777 If present, its value must be 6. This flag requires that the
3778 ``Objective-C Garbage Collection`` flag have the value 2.
3780 Some important flag interactions:
3782 - If a module with ``Objective-C Garbage Collection`` set to 0 is
3783 merged with a module with ``Objective-C Garbage Collection`` set to
3784 2, then the resulting module has the
3785 ``Objective-C Garbage Collection`` flag set to 0.
3786 - A module with ``Objective-C Garbage Collection`` set to 0 cannot be
3787 merged with a module with ``Objective-C GC Only`` set to 6.
3789 Automatic Linker Flags Module Flags Metadata
3790 --------------------------------------------
3792 Some targets support embedding flags to the linker inside individual object
3793 files. Typically this is used in conjunction with language extensions which
3794 allow source files to explicitly declare the libraries they depend on, and have
3795 these automatically be transmitted to the linker via object files.
3797 These flags are encoded in the IR using metadata in the module flags section,
3798 using the ``Linker Options`` key. The merge behavior for this flag is required
3799 to be ``AppendUnique``, and the value for the key is expected to be a metadata
3800 node which should be a list of other metadata nodes, each of which should be a
3801 list of metadata strings defining linker options.
3803 For example, the following metadata section specifies two separate sets of
3804 linker options, presumably to link against ``libz`` and the ``Cocoa``
3807 !0 = !{ i32 6, !"Linker Options",
3810 !{ !"-framework", !"Cocoa" } } }
3811 !llvm.module.flags = !{ !0 }
3813 The metadata encoding as lists of lists of options, as opposed to a collapsed
3814 list of options, is chosen so that the IR encoding can use multiple option
3815 strings to specify e.g., a single library, while still having that specifier be
3816 preserved as an atomic element that can be recognized by a target specific
3817 assembly writer or object file emitter.
3819 Each individual option is required to be either a valid option for the target's
3820 linker, or an option that is reserved by the target specific assembly writer or
3821 object file emitter. No other aspect of these options is defined by the IR.
3823 C type width Module Flags Metadata
3824 ----------------------------------
3826 The ARM backend emits a section into each generated object file describing the
3827 options that it was compiled with (in a compiler-independent way) to prevent
3828 linking incompatible objects, and to allow automatic library selection. Some
3829 of these options are not visible at the IR level, namely wchar_t width and enum
3832 To pass this information to the backend, these options are encoded in module
3833 flags metadata, using the following key-value pairs:
3843 - * 0 --- sizeof(wchar_t) == 4
3844 * 1 --- sizeof(wchar_t) == 2
3847 - * 0 --- Enums are at least as large as an ``int``.
3848 * 1 --- Enums are stored in the smallest integer type which can
3849 represent all of its values.
3851 For example, the following metadata section specifies that the module was
3852 compiled with a ``wchar_t`` width of 4 bytes, and the underlying type of an
3853 enum is the smallest type which can represent all of its values::
3855 !llvm.module.flags = !{!0, !1}
3856 !0 = !{i32 1, !"short_wchar", i32 1}
3857 !1 = !{i32 1, !"short_enum", i32 0}
3859 .. _intrinsicglobalvariables:
3861 Intrinsic Global Variables
3862 ==========================
3864 LLVM has a number of "magic" global variables that contain data that
3865 affect code generation or other IR semantics. These are documented here.
3866 All globals of this sort should have a section specified as
3867 "``llvm.metadata``". This section and all globals that start with
3868 "``llvm.``" are reserved for use by LLVM.
3872 The '``llvm.used``' Global Variable
3873 -----------------------------------
3875 The ``@llvm.used`` global is an array which has
3876 :ref:`appending linkage <linkage_appending>`. This array contains a list of
3877 pointers to named global variables, functions and aliases which may optionally
3878 have a pointer cast formed of bitcast or getelementptr. For example, a legal
3881 .. code-block:: llvm
3886 @llvm.used = appending global [2 x i8*] [
3888 i8* bitcast (i32* @Y to i8*)
3889 ], section "llvm.metadata"
3891 If a symbol appears in the ``@llvm.used`` list, then the compiler, assembler,
3892 and linker are required to treat the symbol as if there is a reference to the
3893 symbol that it cannot see (which is why they have to be named). For example, if
3894 a variable has internal linkage and no references other than that from the
3895 ``@llvm.used`` list, it cannot be deleted. This is commonly used to represent
3896 references from inline asms and other things the compiler cannot "see", and
3897 corresponds to "``attribute((used))``" in GNU C.
3899 On some targets, the code generator must emit a directive to the
3900 assembler or object file to prevent the assembler and linker from
3901 molesting the symbol.
3903 .. _gv_llvmcompilerused:
3905 The '``llvm.compiler.used``' Global Variable
3906 --------------------------------------------
3908 The ``@llvm.compiler.used`` directive is the same as the ``@llvm.used``
3909 directive, except that it only prevents the compiler from touching the
3910 symbol. On targets that support it, this allows an intelligent linker to
3911 optimize references to the symbol without being impeded as it would be
3914 This is a rare construct that should only be used in rare circumstances,
3915 and should not be exposed to source languages.
3917 .. _gv_llvmglobalctors:
3919 The '``llvm.global_ctors``' Global Variable
3920 -------------------------------------------
3922 .. code-block:: llvm
3924 %0 = type { i32, void ()*, i8* }
3925 @llvm.global_ctors = appending global [1 x %0] [%0 { i32 65535, void ()* @ctor, i8* @data }]
3927 The ``@llvm.global_ctors`` array contains a list of constructor
3928 functions, priorities, and an optional associated global or function.
3929 The functions referenced by this array will be called in ascending order
3930 of priority (i.e. lowest first) when the module is loaded. The order of
3931 functions with the same priority is not defined.
3933 If the third field is present, non-null, and points to a global variable
3934 or function, the initializer function will only run if the associated
3935 data from the current module is not discarded.
3937 .. _llvmglobaldtors:
3939 The '``llvm.global_dtors``' Global Variable
3940 -------------------------------------------
3942 .. code-block:: llvm
3944 %0 = type { i32, void ()*, i8* }
3945 @llvm.global_dtors = appending global [1 x %0] [%0 { i32 65535, void ()* @dtor, i8* @data }]
3947 The ``@llvm.global_dtors`` array contains a list of destructor
3948 functions, priorities, and an optional associated global or function.
3949 The functions referenced by this array will be called in descending
3950 order of priority (i.e. highest first) when the module is unloaded. The
3951 order of functions with the same priority is not defined.
3953 If the third field is present, non-null, and points to a global variable
3954 or function, the destructor function will only run if the associated
3955 data from the current module is not discarded.
3957 Instruction Reference
3958 =====================
3960 The LLVM instruction set consists of several different classifications
3961 of instructions: :ref:`terminator instructions <terminators>`, :ref:`binary
3962 instructions <binaryops>`, :ref:`bitwise binary
3963 instructions <bitwiseops>`, :ref:`memory instructions <memoryops>`, and
3964 :ref:`other instructions <otherops>`.
3968 Terminator Instructions
3969 -----------------------
3971 As mentioned :ref:`previously <functionstructure>`, every basic block in a
3972 program ends with a "Terminator" instruction, which indicates which
3973 block should be executed after the current block is finished. These
3974 terminator instructions typically yield a '``void``' value: they produce
3975 control flow, not values (the one exception being the
3976 ':ref:`invoke <i_invoke>`' instruction).
3978 The terminator instructions are: ':ref:`ret <i_ret>`',
3979 ':ref:`br <i_br>`', ':ref:`switch <i_switch>`',
3980 ':ref:`indirectbr <i_indirectbr>`', ':ref:`invoke <i_invoke>`',
3981 ':ref:`resume <i_resume>`', and ':ref:`unreachable <i_unreachable>`'.
3985 '``ret``' Instruction
3986 ^^^^^^^^^^^^^^^^^^^^^
3993 ret <type> <value> ; Return a value from a non-void function
3994 ret void ; Return from void function
3999 The '``ret``' instruction is used to return control flow (and optionally
4000 a value) from a function back to the caller.
4002 There are two forms of the '``ret``' instruction: one that returns a
4003 value and then causes control flow, and one that just causes control
4009 The '``ret``' instruction optionally accepts a single argument, the
4010 return value. The type of the return value must be a ':ref:`first
4011 class <t_firstclass>`' type.
4013 A function is not :ref:`well formed <wellformed>` if it it has a non-void
4014 return type and contains a '``ret``' instruction with no return value or
4015 a return value with a type that does not match its type, or if it has a
4016 void return type and contains a '``ret``' instruction with a return
4022 When the '``ret``' instruction is executed, control flow returns back to
4023 the calling function's context. If the caller is a
4024 ":ref:`call <i_call>`" instruction, execution continues at the
4025 instruction after the call. If the caller was an
4026 ":ref:`invoke <i_invoke>`" instruction, execution continues at the
4027 beginning of the "normal" destination block. If the instruction returns
4028 a value, that value shall set the call or invoke instruction's return
4034 .. code-block:: llvm
4036 ret i32 5 ; Return an integer value of 5
4037 ret void ; Return from a void function
4038 ret { i32, i8 } { i32 4, i8 2 } ; Return a struct of values 4 and 2
4042 '``br``' Instruction
4043 ^^^^^^^^^^^^^^^^^^^^
4050 br i1 <cond>, label <iftrue>, label <iffalse>
4051 br label <dest> ; Unconditional branch
4056 The '``br``' instruction is used to cause control flow to transfer to a
4057 different basic block in the current function. There are two forms of
4058 this instruction, corresponding to a conditional branch and an
4059 unconditional branch.
4064 The conditional branch form of the '``br``' instruction takes a single
4065 '``i1``' value and two '``label``' values. The unconditional form of the
4066 '``br``' instruction takes a single '``label``' value as a target.
4071 Upon execution of a conditional '``br``' instruction, the '``i1``'
4072 argument is evaluated. If the value is ``true``, control flows to the
4073 '``iftrue``' ``label`` argument. If "cond" is ``false``, control flows
4074 to the '``iffalse``' ``label`` argument.
4079 .. code-block:: llvm
4082 %cond = icmp eq i32 %a, %b
4083 br i1 %cond, label %IfEqual, label %IfUnequal
4091 '``switch``' Instruction
4092 ^^^^^^^^^^^^^^^^^^^^^^^^
4099 switch <intty> <value>, label <defaultdest> [ <intty> <val>, label <dest> ... ]
4104 The '``switch``' instruction is used to transfer control flow to one of
4105 several different places. It is a generalization of the '``br``'
4106 instruction, allowing a branch to occur to one of many possible
4112 The '``switch``' instruction uses three parameters: an integer
4113 comparison value '``value``', a default '``label``' destination, and an
4114 array of pairs of comparison value constants and '``label``'s. The table
4115 is not allowed to contain duplicate constant entries.
4120 The ``switch`` instruction specifies a table of values and destinations.
4121 When the '``switch``' instruction is executed, this table is searched
4122 for the given value. If the value is found, control flow is transferred
4123 to the corresponding destination; otherwise, control flow is transferred
4124 to the default destination.
4129 Depending on properties of the target machine and the particular
4130 ``switch`` instruction, this instruction may be code generated in
4131 different ways. For example, it could be generated as a series of
4132 chained conditional branches or with a lookup table.
4137 .. code-block:: llvm
4139 ; Emulate a conditional br instruction
4140 %Val = zext i1 %value to i32
4141 switch i32 %Val, label %truedest [ i32 0, label %falsedest ]
4143 ; Emulate an unconditional br instruction
4144 switch i32 0, label %dest [ ]
4146 ; Implement a jump table:
4147 switch i32 %val, label %otherwise [ i32 0, label %onzero
4149 i32 2, label %ontwo ]
4153 '``indirectbr``' Instruction
4154 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
4161 indirectbr <somety>* <address>, [ label <dest1>, label <dest2>, ... ]
4166 The '``indirectbr``' instruction implements an indirect branch to a
4167 label within the current function, whose address is specified by
4168 "``address``". Address must be derived from a
4169 :ref:`blockaddress <blockaddress>` constant.
4174 The '``address``' argument is the address of the label to jump to. The
4175 rest of the arguments indicate the full set of possible destinations
4176 that the address may point to. Blocks are allowed to occur multiple
4177 times in the destination list, though this isn't particularly useful.
4179 This destination list is required so that dataflow analysis has an
4180 accurate understanding of the CFG.
4185 Control transfers to the block specified in the address argument. All
4186 possible destination blocks must be listed in the label list, otherwise
4187 this instruction has undefined behavior. This implies that jumps to
4188 labels defined in other functions have undefined behavior as well.
4193 This is typically implemented with a jump through a register.
4198 .. code-block:: llvm
4200 indirectbr i8* %Addr, [ label %bb1, label %bb2, label %bb3 ]
4204 '``invoke``' Instruction
4205 ^^^^^^^^^^^^^^^^^^^^^^^^
4212 <result> = invoke [cconv] [ret attrs] <ptr to function ty> <function ptr val>(<function args>) [fn attrs]
4213 to label <normal label> unwind label <exception label>
4218 The '``invoke``' instruction causes control to transfer to a specified
4219 function, with the possibility of control flow transfer to either the
4220 '``normal``' label or the '``exception``' label. If the callee function
4221 returns with the "``ret``" instruction, control flow will return to the
4222 "normal" label. If the callee (or any indirect callees) returns via the
4223 ":ref:`resume <i_resume>`" instruction or other exception handling
4224 mechanism, control is interrupted and continued at the dynamically
4225 nearest "exception" label.
4227 The '``exception``' label is a `landing
4228 pad <ExceptionHandling.html#overview>`_ for the exception. As such,
4229 '``exception``' label is required to have the
4230 ":ref:`landingpad <i_landingpad>`" instruction, which contains the
4231 information about the behavior of the program after unwinding happens,
4232 as its first non-PHI instruction. The restrictions on the
4233 "``landingpad``" instruction's tightly couples it to the "``invoke``"
4234 instruction, so that the important information contained within the
4235 "``landingpad``" instruction can't be lost through normal code motion.
4240 This instruction requires several arguments:
4242 #. The optional "cconv" marker indicates which :ref:`calling
4243 convention <callingconv>` the call should use. If none is
4244 specified, the call defaults to using C calling conventions.
4245 #. The optional :ref:`Parameter Attributes <paramattrs>` list for return
4246 values. Only '``zeroext``', '``signext``', and '``inreg``' attributes
4248 #. '``ptr to function ty``': shall be the signature of the pointer to
4249 function value being invoked. In most cases, this is a direct
4250 function invocation, but indirect ``invoke``'s are just as possible,
4251 branching off an arbitrary pointer to function value.
4252 #. '``function ptr val``': An LLVM value containing a pointer to a
4253 function to be invoked.
4254 #. '``function args``': argument list whose types match the function
4255 signature argument types and parameter attributes. All arguments must
4256 be of :ref:`first class <t_firstclass>` type. If the function signature
4257 indicates the function accepts a variable number of arguments, the
4258 extra arguments can be specified.
4259 #. '``normal label``': the label reached when the called function
4260 executes a '``ret``' instruction.
4261 #. '``exception label``': the label reached when a callee returns via
4262 the :ref:`resume <i_resume>` instruction or other exception handling
4264 #. The optional :ref:`function attributes <fnattrs>` list. Only
4265 '``noreturn``', '``nounwind``', '``readonly``' and '``readnone``'
4266 attributes are valid here.
4271 This instruction is designed to operate as a standard '``call``'
4272 instruction in most regards. The primary difference is that it
4273 establishes an association with a label, which is used by the runtime
4274 library to unwind the stack.
4276 This instruction is used in languages with destructors to ensure that
4277 proper cleanup is performed in the case of either a ``longjmp`` or a
4278 thrown exception. Additionally, this is important for implementation of
4279 '``catch``' clauses in high-level languages that support them.
4281 For the purposes of the SSA form, the definition of the value returned
4282 by the '``invoke``' instruction is deemed to occur on the edge from the
4283 current block to the "normal" label. If the callee unwinds then no
4284 return value is available.
4289 .. code-block:: llvm
4291 %retval = invoke i32 @Test(i32 15) to label %Continue
4292 unwind label %TestCleanup ; i32:retval set
4293 %retval = invoke coldcc i32 %Testfnptr(i32 15) to label %Continue
4294 unwind label %TestCleanup ; i32:retval set
4298 '``resume``' Instruction
4299 ^^^^^^^^^^^^^^^^^^^^^^^^
4306 resume <type> <value>
4311 The '``resume``' instruction is a terminator instruction that has no
4317 The '``resume``' instruction requires one argument, which must have the
4318 same type as the result of any '``landingpad``' instruction in the same
4324 The '``resume``' instruction resumes propagation of an existing
4325 (in-flight) exception whose unwinding was interrupted with a
4326 :ref:`landingpad <i_landingpad>` instruction.
4331 .. code-block:: llvm
4333 resume { i8*, i32 } %exn
4337 '``unreachable``' Instruction
4338 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
4350 The '``unreachable``' instruction has no defined semantics. This
4351 instruction is used to inform the optimizer that a particular portion of
4352 the code is not reachable. This can be used to indicate that the code
4353 after a no-return function cannot be reached, and other facts.
4358 The '``unreachable``' instruction has no defined semantics.
4365 Binary operators are used to do most of the computation in a program.
4366 They require two operands of the same type, execute an operation on
4367 them, and produce a single value. The operands might represent multiple
4368 data, as is the case with the :ref:`vector <t_vector>` data type. The
4369 result value has the same type as its operands.
4371 There are several different binary operators:
4375 '``add``' Instruction
4376 ^^^^^^^^^^^^^^^^^^^^^
4383 <result> = add <ty> <op1>, <op2> ; yields ty:result
4384 <result> = add nuw <ty> <op1>, <op2> ; yields ty:result
4385 <result> = add nsw <ty> <op1>, <op2> ; yields ty:result
4386 <result> = add nuw nsw <ty> <op1>, <op2> ; yields ty:result
4391 The '``add``' instruction returns the sum of its two operands.
4396 The two arguments to the '``add``' instruction must be
4397 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer values. Both
4398 arguments must have identical types.
4403 The value produced is the integer sum of the two operands.
4405 If the sum has unsigned overflow, the result returned is the
4406 mathematical result modulo 2\ :sup:`n`\ , where n is the bit width of
4409 Because LLVM integers use a two's complement representation, this
4410 instruction is appropriate for both signed and unsigned integers.
4412 ``nuw`` and ``nsw`` stand for "No Unsigned Wrap" and "No Signed Wrap",
4413 respectively. If the ``nuw`` and/or ``nsw`` keywords are present, the
4414 result value of the ``add`` is a :ref:`poison value <poisonvalues>` if
4415 unsigned and/or signed overflow, respectively, occurs.
4420 .. code-block:: llvm
4422 <result> = add i32 4, %var ; yields i32:result = 4 + %var
4426 '``fadd``' Instruction
4427 ^^^^^^^^^^^^^^^^^^^^^^
4434 <result> = fadd [fast-math flags]* <ty> <op1>, <op2> ; yields ty:result
4439 The '``fadd``' instruction returns the sum of its two operands.
4444 The two arguments to the '``fadd``' instruction must be :ref:`floating
4445 point <t_floating>` or :ref:`vector <t_vector>` of floating point values.
4446 Both arguments must have identical types.
4451 The value produced is the floating point sum of the two operands. This
4452 instruction can also take any number of :ref:`fast-math flags <fastmath>`,
4453 which are optimization hints to enable otherwise unsafe floating point
4459 .. code-block:: llvm
4461 <result> = fadd float 4.0, %var ; yields float:result = 4.0 + %var
4463 '``sub``' Instruction
4464 ^^^^^^^^^^^^^^^^^^^^^
4471 <result> = sub <ty> <op1>, <op2> ; yields ty:result
4472 <result> = sub nuw <ty> <op1>, <op2> ; yields ty:result
4473 <result> = sub nsw <ty> <op1>, <op2> ; yields ty:result
4474 <result> = sub nuw nsw <ty> <op1>, <op2> ; yields ty:result
4479 The '``sub``' instruction returns the difference of its two operands.
4481 Note that the '``sub``' instruction is used to represent the '``neg``'
4482 instruction present in most other intermediate representations.
4487 The two arguments to the '``sub``' instruction must be
4488 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer values. Both
4489 arguments must have identical types.
4494 The value produced is the integer difference of the two operands.
4496 If the difference has unsigned overflow, the result returned is the
4497 mathematical result modulo 2\ :sup:`n`\ , where n is the bit width of
4500 Because LLVM integers use a two's complement representation, this
4501 instruction is appropriate for both signed and unsigned integers.
4503 ``nuw`` and ``nsw`` stand for "No Unsigned Wrap" and "No Signed Wrap",
4504 respectively. If the ``nuw`` and/or ``nsw`` keywords are present, the
4505 result value of the ``sub`` is a :ref:`poison value <poisonvalues>` if
4506 unsigned and/or signed overflow, respectively, occurs.
4511 .. code-block:: llvm
4513 <result> = sub i32 4, %var ; yields i32:result = 4 - %var
4514 <result> = sub i32 0, %val ; yields i32:result = -%var
4518 '``fsub``' Instruction
4519 ^^^^^^^^^^^^^^^^^^^^^^
4526 <result> = fsub [fast-math flags]* <ty> <op1>, <op2> ; yields ty:result
4531 The '``fsub``' instruction returns the difference of its two operands.
4533 Note that the '``fsub``' instruction is used to represent the '``fneg``'
4534 instruction present in most other intermediate representations.
4539 The two arguments to the '``fsub``' instruction must be :ref:`floating
4540 point <t_floating>` or :ref:`vector <t_vector>` of floating point values.
4541 Both arguments must have identical types.
4546 The value produced is the floating point difference of the two operands.
4547 This instruction can also take any number of :ref:`fast-math
4548 flags <fastmath>`, which are optimization hints to enable otherwise
4549 unsafe floating point optimizations:
4554 .. code-block:: llvm
4556 <result> = fsub float 4.0, %var ; yields float:result = 4.0 - %var
4557 <result> = fsub float -0.0, %val ; yields float:result = -%var
4559 '``mul``' Instruction
4560 ^^^^^^^^^^^^^^^^^^^^^
4567 <result> = mul <ty> <op1>, <op2> ; yields ty:result
4568 <result> = mul nuw <ty> <op1>, <op2> ; yields ty:result
4569 <result> = mul nsw <ty> <op1>, <op2> ; yields ty:result
4570 <result> = mul nuw nsw <ty> <op1>, <op2> ; yields ty:result
4575 The '``mul``' instruction returns the product of its two operands.
4580 The two arguments to the '``mul``' instruction must be
4581 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer values. Both
4582 arguments must have identical types.
4587 The value produced is the integer product of the two operands.
4589 If the result of the multiplication has unsigned overflow, the result
4590 returned is the mathematical result modulo 2\ :sup:`n`\ , where n is the
4591 bit width of the result.
4593 Because LLVM integers use a two's complement representation, and the
4594 result is the same width as the operands, this instruction returns the
4595 correct result for both signed and unsigned integers. If a full product
4596 (e.g. ``i32`` * ``i32`` -> ``i64``) is needed, the operands should be
4597 sign-extended or zero-extended as appropriate to the width of the full
4600 ``nuw`` and ``nsw`` stand for "No Unsigned Wrap" and "No Signed Wrap",
4601 respectively. If the ``nuw`` and/or ``nsw`` keywords are present, the
4602 result value of the ``mul`` is a :ref:`poison value <poisonvalues>` if
4603 unsigned and/or signed overflow, respectively, occurs.
4608 .. code-block:: llvm
4610 <result> = mul i32 4, %var ; yields i32:result = 4 * %var
4614 '``fmul``' Instruction
4615 ^^^^^^^^^^^^^^^^^^^^^^
4622 <result> = fmul [fast-math flags]* <ty> <op1>, <op2> ; yields ty:result
4627 The '``fmul``' instruction returns the product of its two operands.
4632 The two arguments to the '``fmul``' instruction must be :ref:`floating
4633 point <t_floating>` or :ref:`vector <t_vector>` of floating point values.
4634 Both arguments must have identical types.
4639 The value produced is the floating point product of the two operands.
4640 This instruction can also take any number of :ref:`fast-math
4641 flags <fastmath>`, which are optimization hints to enable otherwise
4642 unsafe floating point optimizations:
4647 .. code-block:: llvm
4649 <result> = fmul float 4.0, %var ; yields float:result = 4.0 * %var
4651 '``udiv``' Instruction
4652 ^^^^^^^^^^^^^^^^^^^^^^
4659 <result> = udiv <ty> <op1>, <op2> ; yields ty:result
4660 <result> = udiv exact <ty> <op1>, <op2> ; yields ty:result
4665 The '``udiv``' instruction returns the quotient of its two operands.
4670 The two arguments to the '``udiv``' instruction must be
4671 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer values. Both
4672 arguments must have identical types.
4677 The value produced is the unsigned integer quotient of the two operands.
4679 Note that unsigned integer division and signed integer division are
4680 distinct operations; for signed integer division, use '``sdiv``'.
4682 Division by zero leads to undefined behavior.
4684 If the ``exact`` keyword is present, the result value of the ``udiv`` is
4685 a :ref:`poison value <poisonvalues>` if %op1 is not a multiple of %op2 (as
4686 such, "((a udiv exact b) mul b) == a").
4691 .. code-block:: llvm
4693 <result> = udiv i32 4, %var ; yields i32:result = 4 / %var
4695 '``sdiv``' Instruction
4696 ^^^^^^^^^^^^^^^^^^^^^^
4703 <result> = sdiv <ty> <op1>, <op2> ; yields ty:result
4704 <result> = sdiv exact <ty> <op1>, <op2> ; yields ty:result
4709 The '``sdiv``' instruction returns the quotient of its two operands.
4714 The two arguments to the '``sdiv``' instruction must be
4715 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer values. Both
4716 arguments must have identical types.
4721 The value produced is the signed integer quotient of the two operands
4722 rounded towards zero.
4724 Note that signed integer division and unsigned integer division are
4725 distinct operations; for unsigned integer division, use '``udiv``'.
4727 Division by zero leads to undefined behavior. Overflow also leads to
4728 undefined behavior; this is a rare case, but can occur, for example, by
4729 doing a 32-bit division of -2147483648 by -1.
4731 If the ``exact`` keyword is present, the result value of the ``sdiv`` is
4732 a :ref:`poison value <poisonvalues>` if the result would be rounded.
4737 .. code-block:: llvm
4739 <result> = sdiv i32 4, %var ; yields i32:result = 4 / %var
4743 '``fdiv``' Instruction
4744 ^^^^^^^^^^^^^^^^^^^^^^
4751 <result> = fdiv [fast-math flags]* <ty> <op1>, <op2> ; yields ty:result
4756 The '``fdiv``' instruction returns the quotient of its two operands.
4761 The two arguments to the '``fdiv``' instruction must be :ref:`floating
4762 point <t_floating>` or :ref:`vector <t_vector>` of floating point values.
4763 Both arguments must have identical types.
4768 The value produced is the floating point quotient of the two operands.
4769 This instruction can also take any number of :ref:`fast-math
4770 flags <fastmath>`, which are optimization hints to enable otherwise
4771 unsafe floating point optimizations:
4776 .. code-block:: llvm
4778 <result> = fdiv float 4.0, %var ; yields float:result = 4.0 / %var
4780 '``urem``' Instruction
4781 ^^^^^^^^^^^^^^^^^^^^^^
4788 <result> = urem <ty> <op1>, <op2> ; yields ty:result
4793 The '``urem``' instruction returns the remainder from the unsigned
4794 division of its two arguments.
4799 The two arguments to the '``urem``' instruction must be
4800 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer values. Both
4801 arguments must have identical types.
4806 This instruction returns the unsigned integer *remainder* of a division.
4807 This instruction always performs an unsigned division to get the
4810 Note that unsigned integer remainder and signed integer remainder are
4811 distinct operations; for signed integer remainder, use '``srem``'.
4813 Taking the remainder of a division by zero leads to undefined behavior.
4818 .. code-block:: llvm
4820 <result> = urem i32 4, %var ; yields i32:result = 4 % %var
4822 '``srem``' Instruction
4823 ^^^^^^^^^^^^^^^^^^^^^^
4830 <result> = srem <ty> <op1>, <op2> ; yields ty:result
4835 The '``srem``' instruction returns the remainder from the signed
4836 division of its two operands. This instruction can also take
4837 :ref:`vector <t_vector>` versions of the values in which case the elements
4843 The two arguments to the '``srem``' instruction must be
4844 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer values. Both
4845 arguments must have identical types.
4850 This instruction returns the *remainder* of a division (where the result
4851 is either zero or has the same sign as the dividend, ``op1``), not the
4852 *modulo* operator (where the result is either zero or has the same sign
4853 as the divisor, ``op2``) of a value. For more information about the
4854 difference, see `The Math
4855 Forum <http://mathforum.org/dr.math/problems/anne.4.28.99.html>`_. For a
4856 table of how this is implemented in various languages, please see
4858 operation <http://en.wikipedia.org/wiki/Modulo_operation>`_.
4860 Note that signed integer remainder and unsigned integer remainder are
4861 distinct operations; for unsigned integer remainder, use '``urem``'.
4863 Taking the remainder of a division by zero leads to undefined behavior.
4864 Overflow also leads to undefined behavior; this is a rare case, but can
4865 occur, for example, by taking the remainder of a 32-bit division of
4866 -2147483648 by -1. (The remainder doesn't actually overflow, but this
4867 rule lets srem be implemented using instructions that return both the
4868 result of the division and the remainder.)
4873 .. code-block:: llvm
4875 <result> = srem i32 4, %var ; yields i32:result = 4 % %var
4879 '``frem``' Instruction
4880 ^^^^^^^^^^^^^^^^^^^^^^
4887 <result> = frem [fast-math flags]* <ty> <op1>, <op2> ; yields ty:result
4892 The '``frem``' instruction returns the remainder from the division of
4898 The two arguments to the '``frem``' instruction must be :ref:`floating
4899 point <t_floating>` or :ref:`vector <t_vector>` of floating point values.
4900 Both arguments must have identical types.
4905 This instruction returns the *remainder* of a division. The remainder
4906 has the same sign as the dividend. This instruction can also take any
4907 number of :ref:`fast-math flags <fastmath>`, which are optimization hints
4908 to enable otherwise unsafe floating point optimizations:
4913 .. code-block:: llvm
4915 <result> = frem float 4.0, %var ; yields float:result = 4.0 % %var
4919 Bitwise Binary Operations
4920 -------------------------
4922 Bitwise binary operators are used to do various forms of bit-twiddling
4923 in a program. They are generally very efficient instructions and can
4924 commonly be strength reduced from other instructions. They require two
4925 operands of the same type, execute an operation on them, and produce a
4926 single value. The resulting value is the same type as its operands.
4928 '``shl``' Instruction
4929 ^^^^^^^^^^^^^^^^^^^^^
4936 <result> = shl <ty> <op1>, <op2> ; yields ty:result
4937 <result> = shl nuw <ty> <op1>, <op2> ; yields ty:result
4938 <result> = shl nsw <ty> <op1>, <op2> ; yields ty:result
4939 <result> = shl nuw nsw <ty> <op1>, <op2> ; yields ty:result
4944 The '``shl``' instruction returns the first operand shifted to the left
4945 a specified number of bits.
4950 Both arguments to the '``shl``' instruction must be the same
4951 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer type.
4952 '``op2``' is treated as an unsigned value.
4957 The value produced is ``op1`` \* 2\ :sup:`op2` mod 2\ :sup:`n`,
4958 where ``n`` is the width of the result. If ``op2`` is (statically or
4959 dynamically) negative or equal to or larger than the number of bits in
4960 ``op1``, the result is undefined. If the arguments are vectors, each
4961 vector element of ``op1`` is shifted by the corresponding shift amount
4964 If the ``nuw`` keyword is present, then the shift produces a :ref:`poison
4965 value <poisonvalues>` if it shifts out any non-zero bits. If the
4966 ``nsw`` keyword is present, then the shift produces a :ref:`poison
4967 value <poisonvalues>` if it shifts out any bits that disagree with the
4968 resultant sign bit. As such, NUW/NSW have the same semantics as they
4969 would if the shift were expressed as a mul instruction with the same
4970 nsw/nuw bits in (mul %op1, (shl 1, %op2)).
4975 .. code-block:: llvm
4977 <result> = shl i32 4, %var ; yields i32: 4 << %var
4978 <result> = shl i32 4, 2 ; yields i32: 16
4979 <result> = shl i32 1, 10 ; yields i32: 1024
4980 <result> = shl i32 1, 32 ; undefined
4981 <result> = shl <2 x i32> < i32 1, i32 1>, < i32 1, i32 2> ; yields: result=<2 x i32> < i32 2, i32 4>
4983 '``lshr``' Instruction
4984 ^^^^^^^^^^^^^^^^^^^^^^
4991 <result> = lshr <ty> <op1>, <op2> ; yields ty:result
4992 <result> = lshr exact <ty> <op1>, <op2> ; yields ty:result
4997 The '``lshr``' instruction (logical shift right) returns the first
4998 operand shifted to the right a specified number of bits with zero fill.
5003 Both arguments to the '``lshr``' instruction must be the same
5004 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer type.
5005 '``op2``' is treated as an unsigned value.
5010 This instruction always performs a logical shift right operation. The
5011 most significant bits of the result will be filled with zero bits after
5012 the shift. If ``op2`` is (statically or dynamically) equal to or larger
5013 than the number of bits in ``op1``, the result is undefined. If the
5014 arguments are vectors, each vector element of ``op1`` is shifted by the
5015 corresponding shift amount in ``op2``.
5017 If the ``exact`` keyword is present, the result value of the ``lshr`` is
5018 a :ref:`poison value <poisonvalues>` if any of the bits shifted out are
5024 .. code-block:: llvm
5026 <result> = lshr i32 4, 1 ; yields i32:result = 2
5027 <result> = lshr i32 4, 2 ; yields i32:result = 1
5028 <result> = lshr i8 4, 3 ; yields i8:result = 0
5029 <result> = lshr i8 -2, 1 ; yields i8:result = 0x7F
5030 <result> = lshr i32 1, 32 ; undefined
5031 <result> = lshr <2 x i32> < i32 -2, i32 4>, < i32 1, i32 2> ; yields: result=<2 x i32> < i32 0x7FFFFFFF, i32 1>
5033 '``ashr``' Instruction
5034 ^^^^^^^^^^^^^^^^^^^^^^
5041 <result> = ashr <ty> <op1>, <op2> ; yields ty:result
5042 <result> = ashr exact <ty> <op1>, <op2> ; yields ty:result
5047 The '``ashr``' instruction (arithmetic shift right) returns the first
5048 operand shifted to the right a specified number of bits with sign
5054 Both arguments to the '``ashr``' instruction must be the same
5055 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer type.
5056 '``op2``' is treated as an unsigned value.
5061 This instruction always performs an arithmetic shift right operation,
5062 The most significant bits of the result will be filled with the sign bit
5063 of ``op1``. If ``op2`` is (statically or dynamically) equal to or larger
5064 than the number of bits in ``op1``, the result is undefined. If the
5065 arguments are vectors, each vector element of ``op1`` is shifted by the
5066 corresponding shift amount in ``op2``.
5068 If the ``exact`` keyword is present, the result value of the ``ashr`` is
5069 a :ref:`poison value <poisonvalues>` if any of the bits shifted out are
5075 .. code-block:: llvm
5077 <result> = ashr i32 4, 1 ; yields i32:result = 2
5078 <result> = ashr i32 4, 2 ; yields i32:result = 1
5079 <result> = ashr i8 4, 3 ; yields i8:result = 0
5080 <result> = ashr i8 -2, 1 ; yields i8:result = -1
5081 <result> = ashr i32 1, 32 ; undefined
5082 <result> = ashr <2 x i32> < i32 -2, i32 4>, < i32 1, i32 3> ; yields: result=<2 x i32> < i32 -1, i32 0>
5084 '``and``' Instruction
5085 ^^^^^^^^^^^^^^^^^^^^^
5092 <result> = and <ty> <op1>, <op2> ; yields ty:result
5097 The '``and``' instruction returns the bitwise logical and of its two
5103 The two arguments to the '``and``' instruction must be
5104 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer values. Both
5105 arguments must have identical types.
5110 The truth table used for the '``and``' instruction is:
5127 .. code-block:: llvm
5129 <result> = and i32 4, %var ; yields i32:result = 4 & %var
5130 <result> = and i32 15, 40 ; yields i32:result = 8
5131 <result> = and i32 4, 8 ; yields i32:result = 0
5133 '``or``' Instruction
5134 ^^^^^^^^^^^^^^^^^^^^
5141 <result> = or <ty> <op1>, <op2> ; yields ty:result
5146 The '``or``' instruction returns the bitwise logical inclusive or of its
5152 The two arguments to the '``or``' instruction must be
5153 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer values. Both
5154 arguments must have identical types.
5159 The truth table used for the '``or``' instruction is:
5178 <result> = or i32 4, %var ; yields i32:result = 4 | %var
5179 <result> = or i32 15, 40 ; yields i32:result = 47
5180 <result> = or i32 4, 8 ; yields i32:result = 12
5182 '``xor``' Instruction
5183 ^^^^^^^^^^^^^^^^^^^^^
5190 <result> = xor <ty> <op1>, <op2> ; yields ty:result
5195 The '``xor``' instruction returns the bitwise logical exclusive or of
5196 its two operands. The ``xor`` is used to implement the "one's
5197 complement" operation, which is the "~" operator in C.
5202 The two arguments to the '``xor``' instruction must be
5203 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer values. Both
5204 arguments must have identical types.
5209 The truth table used for the '``xor``' instruction is:
5226 .. code-block:: llvm
5228 <result> = xor i32 4, %var ; yields i32:result = 4 ^ %var
5229 <result> = xor i32 15, 40 ; yields i32:result = 39
5230 <result> = xor i32 4, 8 ; yields i32:result = 12
5231 <result> = xor i32 %V, -1 ; yields i32:result = ~%V
5236 LLVM supports several instructions to represent vector operations in a
5237 target-independent manner. These instructions cover the element-access
5238 and vector-specific operations needed to process vectors effectively.
5239 While LLVM does directly support these vector operations, many
5240 sophisticated algorithms will want to use target-specific intrinsics to
5241 take full advantage of a specific target.
5243 .. _i_extractelement:
5245 '``extractelement``' Instruction
5246 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
5253 <result> = extractelement <n x <ty>> <val>, <ty2> <idx> ; yields <ty>
5258 The '``extractelement``' instruction extracts a single scalar element
5259 from a vector at a specified index.
5264 The first operand of an '``extractelement``' instruction is a value of
5265 :ref:`vector <t_vector>` type. The second operand is an index indicating
5266 the position from which to extract the element. The index may be a
5267 variable of any integer type.
5272 The result is a scalar of the same type as the element type of ``val``.
5273 Its value is the value at position ``idx`` of ``val``. If ``idx``
5274 exceeds the length of ``val``, the results are undefined.
5279 .. code-block:: llvm
5281 <result> = extractelement <4 x i32> %vec, i32 0 ; yields i32
5283 .. _i_insertelement:
5285 '``insertelement``' Instruction
5286 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
5293 <result> = insertelement <n x <ty>> <val>, <ty> <elt>, <ty2> <idx> ; yields <n x <ty>>
5298 The '``insertelement``' instruction inserts a scalar element into a
5299 vector at a specified index.
5304 The first operand of an '``insertelement``' instruction is a value of
5305 :ref:`vector <t_vector>` type. The second operand is a scalar value whose
5306 type must equal the element type of the first operand. The third operand
5307 is an index indicating the position at which to insert the value. The
5308 index may be a variable of any integer type.
5313 The result is a vector of the same type as ``val``. Its element values
5314 are those of ``val`` except at position ``idx``, where it gets the value
5315 ``elt``. If ``idx`` exceeds the length of ``val``, the results are
5321 .. code-block:: llvm
5323 <result> = insertelement <4 x i32> %vec, i32 1, i32 0 ; yields <4 x i32>
5325 .. _i_shufflevector:
5327 '``shufflevector``' Instruction
5328 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
5335 <result> = shufflevector <n x <ty>> <v1>, <n x <ty>> <v2>, <m x i32> <mask> ; yields <m x <ty>>
5340 The '``shufflevector``' instruction constructs a permutation of elements
5341 from two input vectors, returning a vector with the same element type as
5342 the input and length that is the same as the shuffle mask.
5347 The first two operands of a '``shufflevector``' instruction are vectors
5348 with the same type. The third argument is a shuffle mask whose element
5349 type is always 'i32'. The result of the instruction is a vector whose
5350 length is the same as the shuffle mask and whose element type is the
5351 same as the element type of the first two operands.
5353 The shuffle mask operand is required to be a constant vector with either
5354 constant integer or undef values.
5359 The elements of the two input vectors are numbered from left to right
5360 across both of the vectors. The shuffle mask operand specifies, for each
5361 element of the result vector, which element of the two input vectors the
5362 result element gets. The element selector may be undef (meaning "don't
5363 care") and the second operand may be undef if performing a shuffle from
5369 .. code-block:: llvm
5371 <result> = shufflevector <4 x i32> %v1, <4 x i32> %v2,
5372 <4 x i32> <i32 0, i32 4, i32 1, i32 5> ; yields <4 x i32>
5373 <result> = shufflevector <4 x i32> %v1, <4 x i32> undef,
5374 <4 x i32> <i32 0, i32 1, i32 2, i32 3> ; yields <4 x i32> - Identity shuffle.
5375 <result> = shufflevector <8 x i32> %v1, <8 x i32> undef,
5376 <4 x i32> <i32 0, i32 1, i32 2, i32 3> ; yields <4 x i32>
5377 <result> = shufflevector <4 x i32> %v1, <4 x i32> %v2,
5378 <8 x i32> <i32 0, i32 1, i32 2, i32 3, i32 4, i32 5, i32 6, i32 7 > ; yields <8 x i32>
5380 Aggregate Operations
5381 --------------------
5383 LLVM supports several instructions for working with
5384 :ref:`aggregate <t_aggregate>` values.
5388 '``extractvalue``' Instruction
5389 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
5396 <result> = extractvalue <aggregate type> <val>, <idx>{, <idx>}*
5401 The '``extractvalue``' instruction extracts the value of a member field
5402 from an :ref:`aggregate <t_aggregate>` value.
5407 The first operand of an '``extractvalue``' instruction is a value of
5408 :ref:`struct <t_struct>` or :ref:`array <t_array>` type. The operands are
5409 constant indices to specify which value to extract in a similar manner
5410 as indices in a '``getelementptr``' instruction.
5412 The major differences to ``getelementptr`` indexing are:
5414 - Since the value being indexed is not a pointer, the first index is
5415 omitted and assumed to be zero.
5416 - At least one index must be specified.
5417 - Not only struct indices but also array indices must be in bounds.
5422 The result is the value at the position in the aggregate specified by
5428 .. code-block:: llvm
5430 <result> = extractvalue {i32, float} %agg, 0 ; yields i32
5434 '``insertvalue``' Instruction
5435 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
5442 <result> = insertvalue <aggregate type> <val>, <ty> <elt>, <idx>{, <idx>}* ; yields <aggregate type>
5447 The '``insertvalue``' instruction inserts a value into a member field in
5448 an :ref:`aggregate <t_aggregate>` value.
5453 The first operand of an '``insertvalue``' instruction is a value of
5454 :ref:`struct <t_struct>` or :ref:`array <t_array>` type. The second operand is
5455 a first-class value to insert. The following operands are constant
5456 indices indicating the position at which to insert the value in a
5457 similar manner as indices in a '``extractvalue``' instruction. The value
5458 to insert must have the same type as the value identified by the
5464 The result is an aggregate of the same type as ``val``. Its value is
5465 that of ``val`` except that the value at the position specified by the
5466 indices is that of ``elt``.
5471 .. code-block:: llvm
5473 %agg1 = insertvalue {i32, float} undef, i32 1, 0 ; yields {i32 1, float undef}
5474 %agg2 = insertvalue {i32, float} %agg1, float %val, 1 ; yields {i32 1, float %val}
5475 %agg3 = insertvalue {i32, {float}} undef, float %val, 1, 0 ; yields {i32 undef, {float %val}}
5479 Memory Access and Addressing Operations
5480 ---------------------------------------
5482 A key design point of an SSA-based representation is how it represents
5483 memory. In LLVM, no memory locations are in SSA form, which makes things
5484 very simple. This section describes how to read, write, and allocate
5489 '``alloca``' Instruction
5490 ^^^^^^^^^^^^^^^^^^^^^^^^
5497 <result> = alloca [inalloca] <type> [, <ty> <NumElements>] [, align <alignment>] ; yields type*:result
5502 The '``alloca``' instruction allocates memory on the stack frame of the
5503 currently executing function, to be automatically released when this
5504 function returns to its caller. The object is always allocated in the
5505 generic address space (address space zero).
5510 The '``alloca``' instruction allocates ``sizeof(<type>)*NumElements``
5511 bytes of memory on the runtime stack, returning a pointer of the
5512 appropriate type to the program. If "NumElements" is specified, it is
5513 the number of elements allocated, otherwise "NumElements" is defaulted
5514 to be one. If a constant alignment is specified, the value result of the
5515 allocation is guaranteed to be aligned to at least that boundary. The
5516 alignment may not be greater than ``1 << 29``. If not specified, or if
5517 zero, the target can choose to align the allocation on any convenient
5518 boundary compatible with the type.
5520 '``type``' may be any sized type.
5525 Memory is allocated; a pointer is returned. The operation is undefined
5526 if there is insufficient stack space for the allocation. '``alloca``'d
5527 memory is automatically released when the function returns. The
5528 '``alloca``' instruction is commonly used to represent automatic
5529 variables that must have an address available. When the function returns
5530 (either with the ``ret`` or ``resume`` instructions), the memory is
5531 reclaimed. Allocating zero bytes is legal, but the result is undefined.
5532 The order in which memory is allocated (ie., which way the stack grows)
5538 .. code-block:: llvm
5540 %ptr = alloca i32 ; yields i32*:ptr
5541 %ptr = alloca i32, i32 4 ; yields i32*:ptr
5542 %ptr = alloca i32, i32 4, align 1024 ; yields i32*:ptr
5543 %ptr = alloca i32, align 1024 ; yields i32*:ptr
5547 '``load``' Instruction
5548 ^^^^^^^^^^^^^^^^^^^^^^
5555 <result> = load [volatile] <ty>, <ty>* <pointer>[, align <alignment>][, !nontemporal !<index>][, !invariant.load !<index>][, !nonnull !<index>]
5556 <result> = load atomic [volatile] <ty>* <pointer> [singlethread] <ordering>, align <alignment>
5557 !<index> = !{ i32 1 }
5562 The '``load``' instruction is used to read from memory.
5567 The argument to the ``load`` instruction specifies the memory address
5568 from which to load. The type specified must be a :ref:`first
5569 class <t_firstclass>` type. If the ``load`` is marked as ``volatile``,
5570 then the optimizer is not allowed to modify the number or order of
5571 execution of this ``load`` with other :ref:`volatile
5572 operations <volatile>`.
5574 If the ``load`` is marked as ``atomic``, it takes an extra
5575 :ref:`ordering <ordering>` and optional ``singlethread`` argument. The
5576 ``release`` and ``acq_rel`` orderings are not valid on ``load``
5577 instructions. Atomic loads produce :ref:`defined <memmodel>` results
5578 when they may see multiple atomic stores. The type of the pointee must
5579 be an integer type whose bit width is a power of two greater than or
5580 equal to eight and less than or equal to a target-specific size limit.
5581 ``align`` must be explicitly specified on atomic loads, and the load has
5582 undefined behavior if the alignment is not set to a value which is at
5583 least the size in bytes of the pointee. ``!nontemporal`` does not have
5584 any defined semantics for atomic loads.
5586 The optional constant ``align`` argument specifies the alignment of the
5587 operation (that is, the alignment of the memory address). A value of 0
5588 or an omitted ``align`` argument means that the operation has the ABI
5589 alignment for the target. It is the responsibility of the code emitter
5590 to ensure that the alignment information is correct. Overestimating the
5591 alignment results in undefined behavior. Underestimating the alignment
5592 may produce less efficient code. An alignment of 1 is always safe. The
5593 maximum possible alignment is ``1 << 29``.
5595 The optional ``!nontemporal`` metadata must reference a single
5596 metadata name ``<index>`` corresponding to a metadata node with one
5597 ``i32`` entry of value 1. The existence of the ``!nontemporal``
5598 metadata on the instruction tells the optimizer and code generator
5599 that this load is not expected to be reused in the cache. The code
5600 generator may select special instructions to save cache bandwidth, such
5601 as the ``MOVNT`` instruction on x86.
5603 The optional ``!invariant.load`` metadata must reference a single
5604 metadata name ``<index>`` corresponding to a metadata node with no
5605 entries. The existence of the ``!invariant.load`` metadata on the
5606 instruction tells the optimizer and code generator that the address
5607 operand to this load points to memory which can be assumed unchanged.
5608 Being invariant does not imply that a location is dereferenceable,
5609 but it does imply that once the location is known dereferenceable
5610 its value is henceforth unchanging.
5612 The optional ``!nonnull`` metadata must reference a single
5613 metadata name ``<index>`` corresponding to a metadata node with no
5614 entries. The existence of the ``!nonnull`` metadata on the
5615 instruction tells the optimizer that the value loaded is known to
5616 never be null. This is analogous to the ''nonnull'' attribute
5617 on parameters and return values. This metadata can only be applied
5618 to loads of a pointer type.
5623 The location of memory pointed to is loaded. If the value being loaded
5624 is of scalar type then the number of bytes read does not exceed the
5625 minimum number of bytes needed to hold all bits of the type. For
5626 example, loading an ``i24`` reads at most three bytes. When loading a
5627 value of a type like ``i20`` with a size that is not an integral number
5628 of bytes, the result is undefined if the value was not originally
5629 written using a store of the same type.
5634 .. code-block:: llvm
5636 %ptr = alloca i32 ; yields i32*:ptr
5637 store i32 3, i32* %ptr ; yields void
5638 %val = load i32, i32* %ptr ; yields i32:val = i32 3
5642 '``store``' Instruction
5643 ^^^^^^^^^^^^^^^^^^^^^^^
5650 store [volatile] <ty> <value>, <ty>* <pointer>[, align <alignment>][, !nontemporal !<index>] ; yields void
5651 store atomic [volatile] <ty> <value>, <ty>* <pointer> [singlethread] <ordering>, align <alignment> ; yields void
5656 The '``store``' instruction is used to write to memory.
5661 There are two arguments to the ``store`` instruction: a value to store
5662 and an address at which to store it. The type of the ``<pointer>``
5663 operand must be a pointer to the :ref:`first class <t_firstclass>` type of
5664 the ``<value>`` operand. If the ``store`` is marked as ``volatile``,
5665 then the optimizer is not allowed to modify the number or order of
5666 execution of this ``store`` with other :ref:`volatile
5667 operations <volatile>`.
5669 If the ``store`` is marked as ``atomic``, it takes an extra
5670 :ref:`ordering <ordering>` and optional ``singlethread`` argument. The
5671 ``acquire`` and ``acq_rel`` orderings aren't valid on ``store``
5672 instructions. Atomic loads produce :ref:`defined <memmodel>` results
5673 when they may see multiple atomic stores. The type of the pointee must
5674 be an integer type whose bit width is a power of two greater than or
5675 equal to eight and less than or equal to a target-specific size limit.
5676 ``align`` must be explicitly specified on atomic stores, and the store
5677 has undefined behavior if the alignment is not set to a value which is
5678 at least the size in bytes of the pointee. ``!nontemporal`` does not
5679 have any defined semantics for atomic stores.
5681 The optional constant ``align`` argument specifies the alignment of the
5682 operation (that is, the alignment of the memory address). A value of 0
5683 or an omitted ``align`` argument means that the operation has the ABI
5684 alignment for the target. It is the responsibility of the code emitter
5685 to ensure that the alignment information is correct. Overestimating the
5686 alignment results in undefined behavior. Underestimating the
5687 alignment may produce less efficient code. An alignment of 1 is always
5688 safe. The maximum possible alignment is ``1 << 29``.
5690 The optional ``!nontemporal`` metadata must reference a single metadata
5691 name ``<index>`` corresponding to a metadata node with one ``i32`` entry of
5692 value 1. The existence of the ``!nontemporal`` metadata on the instruction
5693 tells the optimizer and code generator that this load is not expected to
5694 be reused in the cache. The code generator may select special
5695 instructions to save cache bandwidth, such as the MOVNT instruction on
5701 The contents of memory are updated to contain ``<value>`` at the
5702 location specified by the ``<pointer>`` operand. If ``<value>`` is
5703 of scalar type then the number of bytes written does not exceed the
5704 minimum number of bytes needed to hold all bits of the type. For
5705 example, storing an ``i24`` writes at most three bytes. When writing a
5706 value of a type like ``i20`` with a size that is not an integral number
5707 of bytes, it is unspecified what happens to the extra bits that do not
5708 belong to the type, but they will typically be overwritten.
5713 .. code-block:: llvm
5715 %ptr = alloca i32 ; yields i32*:ptr
5716 store i32 3, i32* %ptr ; yields void
5717 %val = load i32* %ptr ; yields i32:val = i32 3
5721 '``fence``' Instruction
5722 ^^^^^^^^^^^^^^^^^^^^^^^
5729 fence [singlethread] <ordering> ; yields void
5734 The '``fence``' instruction is used to introduce happens-before edges
5740 '``fence``' instructions take an :ref:`ordering <ordering>` argument which
5741 defines what *synchronizes-with* edges they add. They can only be given
5742 ``acquire``, ``release``, ``acq_rel``, and ``seq_cst`` orderings.
5747 A fence A which has (at least) ``release`` ordering semantics
5748 *synchronizes with* a fence B with (at least) ``acquire`` ordering
5749 semantics if and only if there exist atomic operations X and Y, both
5750 operating on some atomic object M, such that A is sequenced before X, X
5751 modifies M (either directly or through some side effect of a sequence
5752 headed by X), Y is sequenced before B, and Y observes M. This provides a
5753 *happens-before* dependency between A and B. Rather than an explicit
5754 ``fence``, one (but not both) of the atomic operations X or Y might
5755 provide a ``release`` or ``acquire`` (resp.) ordering constraint and
5756 still *synchronize-with* the explicit ``fence`` and establish the
5757 *happens-before* edge.
5759 A ``fence`` which has ``seq_cst`` ordering, in addition to having both
5760 ``acquire`` and ``release`` semantics specified above, participates in
5761 the global program order of other ``seq_cst`` operations and/or fences.
5763 The optional ":ref:`singlethread <singlethread>`" argument specifies
5764 that the fence only synchronizes with other fences in the same thread.
5765 (This is useful for interacting with signal handlers.)
5770 .. code-block:: llvm
5772 fence acquire ; yields void
5773 fence singlethread seq_cst ; yields void
5777 '``cmpxchg``' Instruction
5778 ^^^^^^^^^^^^^^^^^^^^^^^^^
5785 cmpxchg [weak] [volatile] <ty>* <pointer>, <ty> <cmp>, <ty> <new> [singlethread] <success ordering> <failure ordering> ; yields { ty, i1 }
5790 The '``cmpxchg``' instruction is used to atomically modify memory. It
5791 loads a value in memory and compares it to a given value. If they are
5792 equal, it tries to store a new value into the memory.
5797 There are three arguments to the '``cmpxchg``' instruction: an address
5798 to operate on, a value to compare to the value currently be at that
5799 address, and a new value to place at that address if the compared values
5800 are equal. The type of '<cmp>' must be an integer type whose bit width
5801 is a power of two greater than or equal to eight and less than or equal
5802 to a target-specific size limit. '<cmp>' and '<new>' must have the same
5803 type, and the type of '<pointer>' must be a pointer to that type. If the
5804 ``cmpxchg`` is marked as ``volatile``, then the optimizer is not allowed
5805 to modify the number or order of execution of this ``cmpxchg`` with
5806 other :ref:`volatile operations <volatile>`.
5808 The success and failure :ref:`ordering <ordering>` arguments specify how this
5809 ``cmpxchg`` synchronizes with other atomic operations. Both ordering parameters
5810 must be at least ``monotonic``, the ordering constraint on failure must be no
5811 stronger than that on success, and the failure ordering cannot be either
5812 ``release`` or ``acq_rel``.
5814 The optional "``singlethread``" argument declares that the ``cmpxchg``
5815 is only atomic with respect to code (usually signal handlers) running in
5816 the same thread as the ``cmpxchg``. Otherwise the cmpxchg is atomic with
5817 respect to all other code in the system.
5819 The pointer passed into cmpxchg must have alignment greater than or
5820 equal to the size in memory of the operand.
5825 The contents of memory at the location specified by the '``<pointer>``' operand
5826 is read and compared to '``<cmp>``'; if the read value is the equal, the
5827 '``<new>``' is written. The original value at the location is returned, together
5828 with a flag indicating success (true) or failure (false).
5830 If the cmpxchg operation is marked as ``weak`` then a spurious failure is
5831 permitted: the operation may not write ``<new>`` even if the comparison
5834 If the cmpxchg operation is strong (the default), the i1 value is 1 if and only
5835 if the value loaded equals ``cmp``.
5837 A successful ``cmpxchg`` is a read-modify-write instruction for the purpose of
5838 identifying release sequences. A failed ``cmpxchg`` is equivalent to an atomic
5839 load with an ordering parameter determined the second ordering parameter.
5844 .. code-block:: llvm
5847 %orig = atomic load i32, i32* %ptr unordered ; yields i32
5851 %cmp = phi i32 [ %orig, %entry ], [%old, %loop]
5852 %squared = mul i32 %cmp, %cmp
5853 %val_success = cmpxchg i32* %ptr, i32 %cmp, i32 %squared acq_rel monotonic ; yields { i32, i1 }
5854 %value_loaded = extractvalue { i32, i1 } %val_success, 0
5855 %success = extractvalue { i32, i1 } %val_success, 1
5856 br i1 %success, label %done, label %loop
5863 '``atomicrmw``' Instruction
5864 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
5871 atomicrmw [volatile] <operation> <ty>* <pointer>, <ty> <value> [singlethread] <ordering> ; yields ty
5876 The '``atomicrmw``' instruction is used to atomically modify memory.
5881 There are three arguments to the '``atomicrmw``' instruction: an
5882 operation to apply, an address whose value to modify, an argument to the
5883 operation. The operation must be one of the following keywords:
5897 The type of '<value>' must be an integer type whose bit width is a power
5898 of two greater than or equal to eight and less than or equal to a
5899 target-specific size limit. The type of the '``<pointer>``' operand must
5900 be a pointer to that type. If the ``atomicrmw`` is marked as
5901 ``volatile``, then the optimizer is not allowed to modify the number or
5902 order of execution of this ``atomicrmw`` with other :ref:`volatile
5903 operations <volatile>`.
5908 The contents of memory at the location specified by the '``<pointer>``'
5909 operand are atomically read, modified, and written back. The original
5910 value at the location is returned. The modification is specified by the
5913 - xchg: ``*ptr = val``
5914 - add: ``*ptr = *ptr + val``
5915 - sub: ``*ptr = *ptr - val``
5916 - and: ``*ptr = *ptr & val``
5917 - nand: ``*ptr = ~(*ptr & val)``
5918 - or: ``*ptr = *ptr | val``
5919 - xor: ``*ptr = *ptr ^ val``
5920 - max: ``*ptr = *ptr > val ? *ptr : val`` (using a signed comparison)
5921 - min: ``*ptr = *ptr < val ? *ptr : val`` (using a signed comparison)
5922 - umax: ``*ptr = *ptr > val ? *ptr : val`` (using an unsigned
5924 - umin: ``*ptr = *ptr < val ? *ptr : val`` (using an unsigned
5930 .. code-block:: llvm
5932 %old = atomicrmw add i32* %ptr, i32 1 acquire ; yields i32
5934 .. _i_getelementptr:
5936 '``getelementptr``' Instruction
5937 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
5944 <result> = getelementptr <ty>, <ty>* <ptrval>{, <ty> <idx>}*
5945 <result> = getelementptr inbounds <ty>, <ty>* <ptrval>{, <ty> <idx>}*
5946 <result> = getelementptr <ty>, <ptr vector> <ptrval>, <vector index type> <idx>
5951 The '``getelementptr``' instruction is used to get the address of a
5952 subelement of an :ref:`aggregate <t_aggregate>` data structure. It performs
5953 address calculation only and does not access memory.
5958 The first argument is always a type used as the basis for the calculations.
5959 The second argument is always a pointer or a vector of pointers, and is the
5960 base address to start from. The remaining arguments are indices
5961 that indicate which of the elements of the aggregate object are indexed.
5962 The interpretation of each index is dependent on the type being indexed
5963 into. The first index always indexes the pointer value given as the
5964 first argument, the second index indexes a value of the type pointed to
5965 (not necessarily the value directly pointed to, since the first index
5966 can be non-zero), etc. The first type indexed into must be a pointer
5967 value, subsequent types can be arrays, vectors, and structs. Note that
5968 subsequent types being indexed into can never be pointers, since that
5969 would require loading the pointer before continuing calculation.
5971 The type of each index argument depends on the type it is indexing into.
5972 When indexing into a (optionally packed) structure, only ``i32`` integer
5973 **constants** are allowed (when using a vector of indices they must all
5974 be the **same** ``i32`` integer constant). When indexing into an array,
5975 pointer or vector, integers of any width are allowed, and they are not
5976 required to be constant. These integers are treated as signed values
5979 For example, let's consider a C code fragment and how it gets compiled
5995 int *foo(struct ST *s) {
5996 return &s[1].Z.B[5][13];
5999 The LLVM code generated by Clang is:
6001 .. code-block:: llvm
6003 %struct.RT = type { i8, [10 x [20 x i32]], i8 }
6004 %struct.ST = type { i32, double, %struct.RT }
6006 define i32* @foo(%struct.ST* %s) nounwind uwtable readnone optsize ssp {
6008 %arrayidx = getelementptr inbounds %struct.ST, %struct.ST* %s, i64 1, i32 2, i32 1, i64 5, i64 13
6015 In the example above, the first index is indexing into the
6016 '``%struct.ST*``' type, which is a pointer, yielding a '``%struct.ST``'
6017 = '``{ i32, double, %struct.RT }``' type, a structure. The second index
6018 indexes into the third element of the structure, yielding a
6019 '``%struct.RT``' = '``{ i8 , [10 x [20 x i32]], i8 }``' type, another
6020 structure. The third index indexes into the second element of the
6021 structure, yielding a '``[10 x [20 x i32]]``' type, an array. The two
6022 dimensions of the array are subscripted into, yielding an '``i32``'
6023 type. The '``getelementptr``' instruction returns a pointer to this
6024 element, thus computing a value of '``i32*``' type.
6026 Note that it is perfectly legal to index partially through a structure,
6027 returning a pointer to an inner element. Because of this, the LLVM code
6028 for the given testcase is equivalent to:
6030 .. code-block:: llvm
6032 define i32* @foo(%struct.ST* %s) {
6033 %t1 = getelementptr %struct.ST, %struct.ST* %s, i32 1 ; yields %struct.ST*:%t1
6034 %t2 = getelementptr %struct.ST, %struct.ST* %t1, i32 0, i32 2 ; yields %struct.RT*:%t2
6035 %t3 = getelementptr %struct.RT, %struct.RT* %t2, i32 0, i32 1 ; yields [10 x [20 x i32]]*:%t3
6036 %t4 = getelementptr [10 x [20 x i32]], [10 x [20 x i32]]* %t3, i32 0, i32 5 ; yields [20 x i32]*:%t4
6037 %t5 = getelementptr [20 x i32], [20 x i32]* %t4, i32 0, i32 13 ; yields i32*:%t5
6041 If the ``inbounds`` keyword is present, the result value of the
6042 ``getelementptr`` is a :ref:`poison value <poisonvalues>` if the base
6043 pointer is not an *in bounds* address of an allocated object, or if any
6044 of the addresses that would be formed by successive addition of the
6045 offsets implied by the indices to the base address with infinitely
6046 precise signed arithmetic are not an *in bounds* address of that
6047 allocated object. The *in bounds* addresses for an allocated object are
6048 all the addresses that point into the object, plus the address one byte
6049 past the end. In cases where the base is a vector of pointers the
6050 ``inbounds`` keyword applies to each of the computations element-wise.
6052 If the ``inbounds`` keyword is not present, the offsets are added to the
6053 base address with silently-wrapping two's complement arithmetic. If the
6054 offsets have a different width from the pointer, they are sign-extended
6055 or truncated to the width of the pointer. The result value of the
6056 ``getelementptr`` may be outside the object pointed to by the base
6057 pointer. The result value may not necessarily be used to access memory
6058 though, even if it happens to point into allocated storage. See the
6059 :ref:`Pointer Aliasing Rules <pointeraliasing>` section for more
6062 The getelementptr instruction is often confusing. For some more insight
6063 into how it works, see :doc:`the getelementptr FAQ <GetElementPtr>`.
6068 .. code-block:: llvm
6070 ; yields [12 x i8]*:aptr
6071 %aptr = getelementptr {i32, [12 x i8]}, {i32, [12 x i8]}* %saptr, i64 0, i32 1
6073 %vptr = getelementptr {i32, <2 x i8>}, {i32, <2 x i8>}* %svptr, i64 0, i32 1, i32 1
6075 %eptr = getelementptr [12 x i8], [12 x i8]* %aptr, i64 0, i32 1
6077 %iptr = getelementptr [10 x i32], [10 x i32]* @arr, i16 0, i16 0
6079 In cases where the pointer argument is a vector of pointers, each index
6080 must be a vector with the same number of elements. For example:
6082 .. code-block:: llvm
6084 %A = getelementptr i8, <4 x i8*> %ptrs, <4 x i64> %offsets,
6086 Conversion Operations
6087 ---------------------
6089 The instructions in this category are the conversion instructions
6090 (casting) which all take a single operand and a type. They perform
6091 various bit conversions on the operand.
6093 '``trunc .. to``' Instruction
6094 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
6101 <result> = trunc <ty> <value> to <ty2> ; yields ty2
6106 The '``trunc``' instruction truncates its operand to the type ``ty2``.
6111 The '``trunc``' instruction takes a value to trunc, and a type to trunc
6112 it to. Both types must be of :ref:`integer <t_integer>` types, or vectors
6113 of the same number of integers. The bit size of the ``value`` must be
6114 larger than the bit size of the destination type, ``ty2``. Equal sized
6115 types are not allowed.
6120 The '``trunc``' instruction truncates the high order bits in ``value``
6121 and converts the remaining bits to ``ty2``. Since the source size must
6122 be larger than the destination size, ``trunc`` cannot be a *no-op cast*.
6123 It will always truncate bits.
6128 .. code-block:: llvm
6130 %X = trunc i32 257 to i8 ; yields i8:1
6131 %Y = trunc i32 123 to i1 ; yields i1:true
6132 %Z = trunc i32 122 to i1 ; yields i1:false
6133 %W = trunc <2 x i16> <i16 8, i16 7> to <2 x i8> ; yields <i8 8, i8 7>
6135 '``zext .. to``' Instruction
6136 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
6143 <result> = zext <ty> <value> to <ty2> ; yields ty2
6148 The '``zext``' instruction zero extends its operand to type ``ty2``.
6153 The '``zext``' instruction takes a value to cast, and a type to cast it
6154 to. Both types must be of :ref:`integer <t_integer>` types, or vectors of
6155 the same number of integers. The bit size of the ``value`` must be
6156 smaller than the bit size of the destination type, ``ty2``.
6161 The ``zext`` fills the high order bits of the ``value`` with zero bits
6162 until it reaches the size of the destination type, ``ty2``.
6164 When zero extending from i1, the result will always be either 0 or 1.
6169 .. code-block:: llvm
6171 %X = zext i32 257 to i64 ; yields i64:257
6172 %Y = zext i1 true to i32 ; yields i32:1
6173 %Z = zext <2 x i16> <i16 8, i16 7> to <2 x i32> ; yields <i32 8, i32 7>
6175 '``sext .. to``' Instruction
6176 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
6183 <result> = sext <ty> <value> to <ty2> ; yields ty2
6188 The '``sext``' sign extends ``value`` to the type ``ty2``.
6193 The '``sext``' instruction takes a value to cast, and a type to cast it
6194 to. Both types must be of :ref:`integer <t_integer>` types, or vectors of
6195 the same number of integers. The bit size of the ``value`` must be
6196 smaller than the bit size of the destination type, ``ty2``.
6201 The '``sext``' instruction performs a sign extension by copying the sign
6202 bit (highest order bit) of the ``value`` until it reaches the bit size
6203 of the type ``ty2``.
6205 When sign extending from i1, the extension always results in -1 or 0.
6210 .. code-block:: llvm
6212 %X = sext i8 -1 to i16 ; yields i16 :65535
6213 %Y = sext i1 true to i32 ; yields i32:-1
6214 %Z = sext <2 x i16> <i16 8, i16 7> to <2 x i32> ; yields <i32 8, i32 7>
6216 '``fptrunc .. to``' Instruction
6217 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
6224 <result> = fptrunc <ty> <value> to <ty2> ; yields ty2
6229 The '``fptrunc``' instruction truncates ``value`` to type ``ty2``.
6234 The '``fptrunc``' instruction takes a :ref:`floating point <t_floating>`
6235 value to cast and a :ref:`floating point <t_floating>` type to cast it to.
6236 The size of ``value`` must be larger than the size of ``ty2``. This
6237 implies that ``fptrunc`` cannot be used to make a *no-op cast*.
6242 The '``fptrunc``' instruction truncates a ``value`` from a larger
6243 :ref:`floating point <t_floating>` type to a smaller :ref:`floating
6244 point <t_floating>` type. If the value cannot fit within the
6245 destination type, ``ty2``, then the results are undefined.
6250 .. code-block:: llvm
6252 %X = fptrunc double 123.0 to float ; yields float:123.0
6253 %Y = fptrunc double 1.0E+300 to float ; yields undefined
6255 '``fpext .. to``' Instruction
6256 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
6263 <result> = fpext <ty> <value> to <ty2> ; yields ty2
6268 The '``fpext``' extends a floating point ``value`` to a larger floating
6274 The '``fpext``' instruction takes a :ref:`floating point <t_floating>`
6275 ``value`` to cast, and a :ref:`floating point <t_floating>` type to cast it
6276 to. The source type must be smaller than the destination type.
6281 The '``fpext``' instruction extends the ``value`` from a smaller
6282 :ref:`floating point <t_floating>` type to a larger :ref:`floating
6283 point <t_floating>` type. The ``fpext`` cannot be used to make a
6284 *no-op cast* because it always changes bits. Use ``bitcast`` to make a
6285 *no-op cast* for a floating point cast.
6290 .. code-block:: llvm
6292 %X = fpext float 3.125 to double ; yields double:3.125000e+00
6293 %Y = fpext double %X to fp128 ; yields fp128:0xL00000000000000004000900000000000
6295 '``fptoui .. to``' Instruction
6296 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
6303 <result> = fptoui <ty> <value> to <ty2> ; yields ty2
6308 The '``fptoui``' converts a floating point ``value`` to its unsigned
6309 integer equivalent of type ``ty2``.
6314 The '``fptoui``' instruction takes a value to cast, which must be a
6315 scalar or vector :ref:`floating point <t_floating>` value, and a type to
6316 cast it to ``ty2``, which must be an :ref:`integer <t_integer>` type. If
6317 ``ty`` is a vector floating point type, ``ty2`` must be a vector integer
6318 type with the same number of elements as ``ty``
6323 The '``fptoui``' instruction converts its :ref:`floating
6324 point <t_floating>` operand into the nearest (rounding towards zero)
6325 unsigned integer value. If the value cannot fit in ``ty2``, the results
6331 .. code-block:: llvm
6333 %X = fptoui double 123.0 to i32 ; yields i32:123
6334 %Y = fptoui float 1.0E+300 to i1 ; yields undefined:1
6335 %Z = fptoui float 1.04E+17 to i8 ; yields undefined:1
6337 '``fptosi .. to``' Instruction
6338 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
6345 <result> = fptosi <ty> <value> to <ty2> ; yields ty2
6350 The '``fptosi``' instruction converts :ref:`floating point <t_floating>`
6351 ``value`` to type ``ty2``.
6356 The '``fptosi``' instruction takes a value to cast, which must be a
6357 scalar or vector :ref:`floating point <t_floating>` value, and a type to
6358 cast it to ``ty2``, which must be an :ref:`integer <t_integer>` type. If
6359 ``ty`` is a vector floating point type, ``ty2`` must be a vector integer
6360 type with the same number of elements as ``ty``
6365 The '``fptosi``' instruction converts its :ref:`floating
6366 point <t_floating>` operand into the nearest (rounding towards zero)
6367 signed integer value. If the value cannot fit in ``ty2``, the results
6373 .. code-block:: llvm
6375 %X = fptosi double -123.0 to i32 ; yields i32:-123
6376 %Y = fptosi float 1.0E-247 to i1 ; yields undefined:1
6377 %Z = fptosi float 1.04E+17 to i8 ; yields undefined:1
6379 '``uitofp .. to``' Instruction
6380 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
6387 <result> = uitofp <ty> <value> to <ty2> ; yields ty2
6392 The '``uitofp``' instruction regards ``value`` as an unsigned integer
6393 and converts that value to the ``ty2`` type.
6398 The '``uitofp``' instruction takes a value to cast, which must be a
6399 scalar or vector :ref:`integer <t_integer>` value, and a type to cast it to
6400 ``ty2``, which must be an :ref:`floating point <t_floating>` type. If
6401 ``ty`` is a vector integer type, ``ty2`` must be a vector floating point
6402 type with the same number of elements as ``ty``
6407 The '``uitofp``' instruction interprets its operand as an unsigned
6408 integer quantity and converts it to the corresponding floating point
6409 value. If the value cannot fit in the floating point value, the results
6415 .. code-block:: llvm
6417 %X = uitofp i32 257 to float ; yields float:257.0
6418 %Y = uitofp i8 -1 to double ; yields double:255.0
6420 '``sitofp .. to``' Instruction
6421 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
6428 <result> = sitofp <ty> <value> to <ty2> ; yields ty2
6433 The '``sitofp``' instruction regards ``value`` as a signed integer and
6434 converts that value to the ``ty2`` type.
6439 The '``sitofp``' instruction takes a value to cast, which must be a
6440 scalar or vector :ref:`integer <t_integer>` value, and a type to cast it to
6441 ``ty2``, which must be an :ref:`floating point <t_floating>` type. If
6442 ``ty`` is a vector integer type, ``ty2`` must be a vector floating point
6443 type with the same number of elements as ``ty``
6448 The '``sitofp``' instruction interprets its operand as a signed integer
6449 quantity and converts it to the corresponding floating point value. If
6450 the value cannot fit in the floating point value, the results are
6456 .. code-block:: llvm
6458 %X = sitofp i32 257 to float ; yields float:257.0
6459 %Y = sitofp i8 -1 to double ; yields double:-1.0
6463 '``ptrtoint .. to``' Instruction
6464 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
6471 <result> = ptrtoint <ty> <value> to <ty2> ; yields ty2
6476 The '``ptrtoint``' instruction converts the pointer or a vector of
6477 pointers ``value`` to the integer (or vector of integers) type ``ty2``.
6482 The '``ptrtoint``' instruction takes a ``value`` to cast, which must be
6483 a a value of type :ref:`pointer <t_pointer>` or a vector of pointers, and a
6484 type to cast it to ``ty2``, which must be an :ref:`integer <t_integer>` or
6485 a vector of integers type.
6490 The '``ptrtoint``' instruction converts ``value`` to integer type
6491 ``ty2`` by interpreting the pointer value as an integer and either
6492 truncating or zero extending that value to the size of the integer type.
6493 If ``value`` is smaller than ``ty2`` then a zero extension is done. If
6494 ``value`` is larger than ``ty2`` then a truncation is done. If they are
6495 the same size, then nothing is done (*no-op cast*) other than a type
6501 .. code-block:: llvm
6503 %X = ptrtoint i32* %P to i8 ; yields truncation on 32-bit architecture
6504 %Y = ptrtoint i32* %P to i64 ; yields zero extension on 32-bit architecture
6505 %Z = ptrtoint <4 x i32*> %P to <4 x i64>; yields vector zero extension for a vector of addresses on 32-bit architecture
6509 '``inttoptr .. to``' Instruction
6510 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
6517 <result> = inttoptr <ty> <value> to <ty2> ; yields ty2
6522 The '``inttoptr``' instruction converts an integer ``value`` to a
6523 pointer type, ``ty2``.
6528 The '``inttoptr``' instruction takes an :ref:`integer <t_integer>` value to
6529 cast, and a type to cast it to, which must be a :ref:`pointer <t_pointer>`
6535 The '``inttoptr``' instruction converts ``value`` to type ``ty2`` by
6536 applying either a zero extension or a truncation depending on the size
6537 of the integer ``value``. If ``value`` is larger than the size of a
6538 pointer then a truncation is done. If ``value`` is smaller than the size
6539 of a pointer then a zero extension is done. If they are the same size,
6540 nothing is done (*no-op cast*).
6545 .. code-block:: llvm
6547 %X = inttoptr i32 255 to i32* ; yields zero extension on 64-bit architecture
6548 %Y = inttoptr i32 255 to i32* ; yields no-op on 32-bit architecture
6549 %Z = inttoptr i64 0 to i32* ; yields truncation on 32-bit architecture
6550 %Z = inttoptr <4 x i32> %G to <4 x i8*>; yields truncation of vector G to four pointers
6554 '``bitcast .. to``' Instruction
6555 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
6562 <result> = bitcast <ty> <value> to <ty2> ; yields ty2
6567 The '``bitcast``' instruction converts ``value`` to type ``ty2`` without
6573 The '``bitcast``' instruction takes a value to cast, which must be a
6574 non-aggregate first class value, and a type to cast it to, which must
6575 also be a non-aggregate :ref:`first class <t_firstclass>` type. The
6576 bit sizes of ``value`` and the destination type, ``ty2``, must be
6577 identical. If the source type is a pointer, the destination type must
6578 also be a pointer of the same size. This instruction supports bitwise
6579 conversion of vectors to integers and to vectors of other types (as
6580 long as they have the same size).
6585 The '``bitcast``' instruction converts ``value`` to type ``ty2``. It
6586 is always a *no-op cast* because no bits change with this
6587 conversion. The conversion is done as if the ``value`` had been stored
6588 to memory and read back as type ``ty2``. Pointer (or vector of
6589 pointers) types may only be converted to other pointer (or vector of
6590 pointers) types with the same address space through this instruction.
6591 To convert pointers to other types, use the :ref:`inttoptr <i_inttoptr>`
6592 or :ref:`ptrtoint <i_ptrtoint>` instructions first.
6597 .. code-block:: llvm
6599 %X = bitcast i8 255 to i8 ; yields i8 :-1
6600 %Y = bitcast i32* %x to sint* ; yields sint*:%x
6601 %Z = bitcast <2 x int> %V to i64; ; yields i64: %V
6602 %Z = bitcast <2 x i32*> %V to <2 x i64*> ; yields <2 x i64*>
6604 .. _i_addrspacecast:
6606 '``addrspacecast .. to``' Instruction
6607 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
6614 <result> = addrspacecast <pty> <ptrval> to <pty2> ; yields pty2
6619 The '``addrspacecast``' instruction converts ``ptrval`` from ``pty`` in
6620 address space ``n`` to type ``pty2`` in address space ``m``.
6625 The '``addrspacecast``' instruction takes a pointer or vector of pointer value
6626 to cast and a pointer type to cast it to, which must have a different
6632 The '``addrspacecast``' instruction converts the pointer value
6633 ``ptrval`` to type ``pty2``. It can be a *no-op cast* or a complex
6634 value modification, depending on the target and the address space
6635 pair. Pointer conversions within the same address space must be
6636 performed with the ``bitcast`` instruction. Note that if the address space
6637 conversion is legal then both result and operand refer to the same memory
6643 .. code-block:: llvm
6645 %X = addrspacecast i32* %x to i32 addrspace(1)* ; yields i32 addrspace(1)*:%x
6646 %Y = addrspacecast i32 addrspace(1)* %y to i64 addrspace(2)* ; yields i64 addrspace(2)*:%y
6647 %Z = addrspacecast <4 x i32*> %z to <4 x float addrspace(3)*> ; yields <4 x float addrspace(3)*>:%z
6654 The instructions in this category are the "miscellaneous" instructions,
6655 which defy better classification.
6659 '``icmp``' Instruction
6660 ^^^^^^^^^^^^^^^^^^^^^^
6667 <result> = icmp <cond> <ty> <op1>, <op2> ; yields i1 or <N x i1>:result
6672 The '``icmp``' instruction returns a boolean value or a vector of
6673 boolean values based on comparison of its two integer, integer vector,
6674 pointer, or pointer vector operands.
6679 The '``icmp``' instruction takes three operands. The first operand is
6680 the condition code indicating the kind of comparison to perform. It is
6681 not a value, just a keyword. The possible condition code are:
6684 #. ``ne``: not equal
6685 #. ``ugt``: unsigned greater than
6686 #. ``uge``: unsigned greater or equal
6687 #. ``ult``: unsigned less than
6688 #. ``ule``: unsigned less or equal
6689 #. ``sgt``: signed greater than
6690 #. ``sge``: signed greater or equal
6691 #. ``slt``: signed less than
6692 #. ``sle``: signed less or equal
6694 The remaining two arguments must be :ref:`integer <t_integer>` or
6695 :ref:`pointer <t_pointer>` or integer :ref:`vector <t_vector>` typed. They
6696 must also be identical types.
6701 The '``icmp``' compares ``op1`` and ``op2`` according to the condition
6702 code given as ``cond``. The comparison performed always yields either an
6703 :ref:`i1 <t_integer>` or vector of ``i1`` result, as follows:
6705 #. ``eq``: yields ``true`` if the operands are equal, ``false``
6706 otherwise. No sign interpretation is necessary or performed.
6707 #. ``ne``: yields ``true`` if the operands are unequal, ``false``
6708 otherwise. No sign interpretation is necessary or performed.
6709 #. ``ugt``: interprets the operands as unsigned values and yields
6710 ``true`` if ``op1`` is greater than ``op2``.
6711 #. ``uge``: interprets the operands as unsigned values and yields
6712 ``true`` if ``op1`` is greater than or equal to ``op2``.
6713 #. ``ult``: interprets the operands as unsigned values and yields
6714 ``true`` if ``op1`` is less than ``op2``.
6715 #. ``ule``: interprets the operands as unsigned values and yields
6716 ``true`` if ``op1`` is less than or equal to ``op2``.
6717 #. ``sgt``: interprets the operands as signed values and yields ``true``
6718 if ``op1`` is greater than ``op2``.
6719 #. ``sge``: interprets the operands as signed values and yields ``true``
6720 if ``op1`` is greater than or equal to ``op2``.
6721 #. ``slt``: interprets the operands as signed values and yields ``true``
6722 if ``op1`` is less than ``op2``.
6723 #. ``sle``: interprets the operands as signed values and yields ``true``
6724 if ``op1`` is less than or equal to ``op2``.
6726 If the operands are :ref:`pointer <t_pointer>` typed, the pointer values
6727 are compared as if they were integers.
6729 If the operands are integer vectors, then they are compared element by
6730 element. The result is an ``i1`` vector with the same number of elements
6731 as the values being compared. Otherwise, the result is an ``i1``.
6736 .. code-block:: llvm
6738 <result> = icmp eq i32 4, 5 ; yields: result=false
6739 <result> = icmp ne float* %X, %X ; yields: result=false
6740 <result> = icmp ult i16 4, 5 ; yields: result=true
6741 <result> = icmp sgt i16 4, 5 ; yields: result=false
6742 <result> = icmp ule i16 -4, 5 ; yields: result=false
6743 <result> = icmp sge i16 4, 5 ; yields: result=false
6745 Note that the code generator does not yet support vector types with the
6746 ``icmp`` instruction.
6750 '``fcmp``' Instruction
6751 ^^^^^^^^^^^^^^^^^^^^^^
6758 <result> = fcmp <cond> <ty> <op1>, <op2> ; yields i1 or <N x i1>:result
6763 The '``fcmp``' instruction returns a boolean value or vector of boolean
6764 values based on comparison of its operands.
6766 If the operands are floating point scalars, then the result type is a
6767 boolean (:ref:`i1 <t_integer>`).
6769 If the operands are floating point vectors, then the result type is a
6770 vector of boolean with the same number of elements as the operands being
6776 The '``fcmp``' instruction takes three operands. The first operand is
6777 the condition code indicating the kind of comparison to perform. It is
6778 not a value, just a keyword. The possible condition code are:
6780 #. ``false``: no comparison, always returns false
6781 #. ``oeq``: ordered and equal
6782 #. ``ogt``: ordered and greater than
6783 #. ``oge``: ordered and greater than or equal
6784 #. ``olt``: ordered and less than
6785 #. ``ole``: ordered and less than or equal
6786 #. ``one``: ordered and not equal
6787 #. ``ord``: ordered (no nans)
6788 #. ``ueq``: unordered or equal
6789 #. ``ugt``: unordered or greater than
6790 #. ``uge``: unordered or greater than or equal
6791 #. ``ult``: unordered or less than
6792 #. ``ule``: unordered or less than or equal
6793 #. ``une``: unordered or not equal
6794 #. ``uno``: unordered (either nans)
6795 #. ``true``: no comparison, always returns true
6797 *Ordered* means that neither operand is a QNAN while *unordered* means
6798 that either operand may be a QNAN.
6800 Each of ``val1`` and ``val2`` arguments must be either a :ref:`floating
6801 point <t_floating>` type or a :ref:`vector <t_vector>` of floating point
6802 type. They must have identical types.
6807 The '``fcmp``' instruction compares ``op1`` and ``op2`` according to the
6808 condition code given as ``cond``. If the operands are vectors, then the
6809 vectors are compared element by element. Each comparison performed
6810 always yields an :ref:`i1 <t_integer>` result, as follows:
6812 #. ``false``: always yields ``false``, regardless of operands.
6813 #. ``oeq``: yields ``true`` if both operands are not a QNAN and ``op1``
6814 is equal to ``op2``.
6815 #. ``ogt``: yields ``true`` if both operands are not a QNAN and ``op1``
6816 is greater than ``op2``.
6817 #. ``oge``: yields ``true`` if both operands are not a QNAN and ``op1``
6818 is greater than or equal to ``op2``.
6819 #. ``olt``: yields ``true`` if both operands are not a QNAN and ``op1``
6820 is less than ``op2``.
6821 #. ``ole``: yields ``true`` if both operands are not a QNAN and ``op1``
6822 is less than or equal to ``op2``.
6823 #. ``one``: yields ``true`` if both operands are not a QNAN and ``op1``
6824 is not equal to ``op2``.
6825 #. ``ord``: yields ``true`` if both operands are not a QNAN.
6826 #. ``ueq``: yields ``true`` if either operand is a QNAN or ``op1`` is
6828 #. ``ugt``: yields ``true`` if either operand is a QNAN or ``op1`` is
6829 greater than ``op2``.
6830 #. ``uge``: yields ``true`` if either operand is a QNAN or ``op1`` is
6831 greater than or equal to ``op2``.
6832 #. ``ult``: yields ``true`` if either operand is a QNAN or ``op1`` is
6834 #. ``ule``: yields ``true`` if either operand is a QNAN or ``op1`` is
6835 less than or equal to ``op2``.
6836 #. ``une``: yields ``true`` if either operand is a QNAN or ``op1`` is
6837 not equal to ``op2``.
6838 #. ``uno``: yields ``true`` if either operand is a QNAN.
6839 #. ``true``: always yields ``true``, regardless of operands.
6844 .. code-block:: llvm
6846 <result> = fcmp oeq float 4.0, 5.0 ; yields: result=false
6847 <result> = fcmp one float 4.0, 5.0 ; yields: result=true
6848 <result> = fcmp olt float 4.0, 5.0 ; yields: result=true
6849 <result> = fcmp ueq double 1.0, 2.0 ; yields: result=false
6851 Note that the code generator does not yet support vector types with the
6852 ``fcmp`` instruction.
6856 '``phi``' Instruction
6857 ^^^^^^^^^^^^^^^^^^^^^
6864 <result> = phi <ty> [ <val0>, <label0>], ...
6869 The '``phi``' instruction is used to implement the φ node in the SSA
6870 graph representing the function.
6875 The type of the incoming values is specified with the first type field.
6876 After this, the '``phi``' instruction takes a list of pairs as
6877 arguments, with one pair for each predecessor basic block of the current
6878 block. Only values of :ref:`first class <t_firstclass>` type may be used as
6879 the value arguments to the PHI node. Only labels may be used as the
6882 There must be no non-phi instructions between the start of a basic block
6883 and the PHI instructions: i.e. PHI instructions must be first in a basic
6886 For the purposes of the SSA form, the use of each incoming value is
6887 deemed to occur on the edge from the corresponding predecessor block to
6888 the current block (but after any definition of an '``invoke``'
6889 instruction's return value on the same edge).
6894 At runtime, the '``phi``' instruction logically takes on the value
6895 specified by the pair corresponding to the predecessor basic block that
6896 executed just prior to the current block.
6901 .. code-block:: llvm
6903 Loop: ; Infinite loop that counts from 0 on up...
6904 %indvar = phi i32 [ 0, %LoopHeader ], [ %nextindvar, %Loop ]
6905 %nextindvar = add i32 %indvar, 1
6910 '``select``' Instruction
6911 ^^^^^^^^^^^^^^^^^^^^^^^^
6918 <result> = select selty <cond>, <ty> <val1>, <ty> <val2> ; yields ty
6920 selty is either i1 or {<N x i1>}
6925 The '``select``' instruction is used to choose one value based on a
6926 condition, without IR-level branching.
6931 The '``select``' instruction requires an 'i1' value or a vector of 'i1'
6932 values indicating the condition, and two values of the same :ref:`first
6933 class <t_firstclass>` type.
6938 If the condition is an i1 and it evaluates to 1, the instruction returns
6939 the first value argument; otherwise, it returns the second value
6942 If the condition is a vector of i1, then the value arguments must be
6943 vectors of the same size, and the selection is done element by element.
6945 If the condition is an i1 and the value arguments are vectors of the
6946 same size, then an entire vector is selected.
6951 .. code-block:: llvm
6953 %X = select i1 true, i8 17, i8 42 ; yields i8:17
6957 '``call``' Instruction
6958 ^^^^^^^^^^^^^^^^^^^^^^
6965 <result> = [tail | musttail] call [cconv] [ret attrs] <ty> [<fnty>*] <fnptrval>(<function args>) [fn attrs]
6970 The '``call``' instruction represents a simple function call.
6975 This instruction requires several arguments:
6977 #. The optional ``tail`` and ``musttail`` markers indicate that the optimizers
6978 should perform tail call optimization. The ``tail`` marker is a hint that
6979 `can be ignored <CodeGenerator.html#sibcallopt>`_. The ``musttail`` marker
6980 means that the call must be tail call optimized in order for the program to
6981 be correct. The ``musttail`` marker provides these guarantees:
6983 #. The call will not cause unbounded stack growth if it is part of a
6984 recursive cycle in the call graph.
6985 #. Arguments with the :ref:`inalloca <attr_inalloca>` attribute are
6988 Both markers imply that the callee does not access allocas or varargs from
6989 the caller. Calls marked ``musttail`` must obey the following additional
6992 - The call must immediately precede a :ref:`ret <i_ret>` instruction,
6993 or a pointer bitcast followed by a ret instruction.
6994 - The ret instruction must return the (possibly bitcasted) value
6995 produced by the call or void.
6996 - The caller and callee prototypes must match. Pointer types of
6997 parameters or return types may differ in pointee type, but not
6999 - The calling conventions of the caller and callee must match.
7000 - All ABI-impacting function attributes, such as sret, byval, inreg,
7001 returned, and inalloca, must match.
7002 - The callee must be varargs iff the caller is varargs. Bitcasting a
7003 non-varargs function to the appropriate varargs type is legal so
7004 long as the non-varargs prefixes obey the other rules.
7006 Tail call optimization for calls marked ``tail`` is guaranteed to occur if
7007 the following conditions are met:
7009 - Caller and callee both have the calling convention ``fastcc``.
7010 - The call is in tail position (ret immediately follows call and ret
7011 uses value of call or is void).
7012 - Option ``-tailcallopt`` is enabled, or
7013 ``llvm::GuaranteedTailCallOpt`` is ``true``.
7014 - `Platform-specific constraints are
7015 met. <CodeGenerator.html#tailcallopt>`_
7017 #. The optional "cconv" marker indicates which :ref:`calling
7018 convention <callingconv>` the call should use. If none is
7019 specified, the call defaults to using C calling conventions. The
7020 calling convention of the call must match the calling convention of
7021 the target function, or else the behavior is undefined.
7022 #. The optional :ref:`Parameter Attributes <paramattrs>` list for return
7023 values. Only '``zeroext``', '``signext``', and '``inreg``' attributes
7025 #. '``ty``': the type of the call instruction itself which is also the
7026 type of the return value. Functions that return no value are marked
7028 #. '``fnty``': shall be the signature of the pointer to function value
7029 being invoked. The argument types must match the types implied by
7030 this signature. This type can be omitted if the function is not
7031 varargs and if the function type does not return a pointer to a
7033 #. '``fnptrval``': An LLVM value containing a pointer to a function to
7034 be invoked. In most cases, this is a direct function invocation, but
7035 indirect ``call``'s are just as possible, calling an arbitrary pointer
7037 #. '``function args``': argument list whose types match the function
7038 signature argument types and parameter attributes. All arguments must
7039 be of :ref:`first class <t_firstclass>` type. If the function signature
7040 indicates the function accepts a variable number of arguments, the
7041 extra arguments can be specified.
7042 #. The optional :ref:`function attributes <fnattrs>` list. Only
7043 '``noreturn``', '``nounwind``', '``readonly``' and '``readnone``'
7044 attributes are valid here.
7049 The '``call``' instruction is used to cause control flow to transfer to
7050 a specified function, with its incoming arguments bound to the specified
7051 values. Upon a '``ret``' instruction in the called function, control
7052 flow continues with the instruction after the function call, and the
7053 return value of the function is bound to the result argument.
7058 .. code-block:: llvm
7060 %retval = call i32 @test(i32 %argc)
7061 call i32 (i8*, ...)* @printf(i8* %msg, i32 12, i8 42) ; yields i32
7062 %X = tail call i32 @foo() ; yields i32
7063 %Y = tail call fastcc i32 @foo() ; yields i32
7064 call void %foo(i8 97 signext)
7066 %struct.A = type { i32, i8 }
7067 %r = call %struct.A @foo() ; yields { i32, i8 }
7068 %gr = extractvalue %struct.A %r, 0 ; yields i32
7069 %gr1 = extractvalue %struct.A %r, 1 ; yields i8
7070 %Z = call void @foo() noreturn ; indicates that %foo never returns normally
7071 %ZZ = call zeroext i32 @bar() ; Return value is %zero extended
7073 llvm treats calls to some functions with names and arguments that match
7074 the standard C99 library as being the C99 library functions, and may
7075 perform optimizations or generate code for them under that assumption.
7076 This is something we'd like to change in the future to provide better
7077 support for freestanding environments and non-C-based languages.
7081 '``va_arg``' Instruction
7082 ^^^^^^^^^^^^^^^^^^^^^^^^
7089 <resultval> = va_arg <va_list*> <arglist>, <argty>
7094 The '``va_arg``' instruction is used to access arguments passed through
7095 the "variable argument" area of a function call. It is used to implement
7096 the ``va_arg`` macro in C.
7101 This instruction takes a ``va_list*`` value and the type of the
7102 argument. It returns a value of the specified argument type and
7103 increments the ``va_list`` to point to the next argument. The actual
7104 type of ``va_list`` is target specific.
7109 The '``va_arg``' instruction loads an argument of the specified type
7110 from the specified ``va_list`` and causes the ``va_list`` to point to
7111 the next argument. For more information, see the variable argument
7112 handling :ref:`Intrinsic Functions <int_varargs>`.
7114 It is legal for this instruction to be called in a function which does
7115 not take a variable number of arguments, for example, the ``vfprintf``
7118 ``va_arg`` is an LLVM instruction instead of an :ref:`intrinsic
7119 function <intrinsics>` because it takes a type as an argument.
7124 See the :ref:`variable argument processing <int_varargs>` section.
7126 Note that the code generator does not yet fully support va\_arg on many
7127 targets. Also, it does not currently support va\_arg with aggregate
7128 types on any target.
7132 '``landingpad``' Instruction
7133 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7140 <resultval> = landingpad <resultty> personality <type> <pers_fn> <clause>+
7141 <resultval> = landingpad <resultty> personality <type> <pers_fn> cleanup <clause>*
7143 <clause> := catch <type> <value>
7144 <clause> := filter <array constant type> <array constant>
7149 The '``landingpad``' instruction is used by `LLVM's exception handling
7150 system <ExceptionHandling.html#overview>`_ to specify that a basic block
7151 is a landing pad --- one where the exception lands, and corresponds to the
7152 code found in the ``catch`` portion of a ``try``/``catch`` sequence. It
7153 defines values supplied by the personality function (``pers_fn``) upon
7154 re-entry to the function. The ``resultval`` has the type ``resultty``.
7159 This instruction takes a ``pers_fn`` value. This is the personality
7160 function associated with the unwinding mechanism. The optional
7161 ``cleanup`` flag indicates that the landing pad block is a cleanup.
7163 A ``clause`` begins with the clause type --- ``catch`` or ``filter`` --- and
7164 contains the global variable representing the "type" that may be caught
7165 or filtered respectively. Unlike the ``catch`` clause, the ``filter``
7166 clause takes an array constant as its argument. Use
7167 "``[0 x i8**] undef``" for a filter which cannot throw. The
7168 '``landingpad``' instruction must contain *at least* one ``clause`` or
7169 the ``cleanup`` flag.
7174 The '``landingpad``' instruction defines the values which are set by the
7175 personality function (``pers_fn``) upon re-entry to the function, and
7176 therefore the "result type" of the ``landingpad`` instruction. As with
7177 calling conventions, how the personality function results are
7178 represented in LLVM IR is target specific.
7180 The clauses are applied in order from top to bottom. If two
7181 ``landingpad`` instructions are merged together through inlining, the
7182 clauses from the calling function are appended to the list of clauses.
7183 When the call stack is being unwound due to an exception being thrown,
7184 the exception is compared against each ``clause`` in turn. If it doesn't
7185 match any of the clauses, and the ``cleanup`` flag is not set, then
7186 unwinding continues further up the call stack.
7188 The ``landingpad`` instruction has several restrictions:
7190 - A landing pad block is a basic block which is the unwind destination
7191 of an '``invoke``' instruction.
7192 - A landing pad block must have a '``landingpad``' instruction as its
7193 first non-PHI instruction.
7194 - There can be only one '``landingpad``' instruction within the landing
7196 - A basic block that is not a landing pad block may not include a
7197 '``landingpad``' instruction.
7198 - All '``landingpad``' instructions in a function must have the same
7199 personality function.
7204 .. code-block:: llvm
7206 ;; A landing pad which can catch an integer.
7207 %res = landingpad { i8*, i32 } personality i32 (...)* @__gxx_personality_v0
7209 ;; A landing pad that is a cleanup.
7210 %res = landingpad { i8*, i32 } personality i32 (...)* @__gxx_personality_v0
7212 ;; A landing pad which can catch an integer and can only throw a double.
7213 %res = landingpad { i8*, i32 } personality i32 (...)* @__gxx_personality_v0
7215 filter [1 x i8**] [@_ZTId]
7222 LLVM supports the notion of an "intrinsic function". These functions
7223 have well known names and semantics and are required to follow certain
7224 restrictions. Overall, these intrinsics represent an extension mechanism
7225 for the LLVM language that does not require changing all of the
7226 transformations in LLVM when adding to the language (or the bitcode
7227 reader/writer, the parser, etc...).
7229 Intrinsic function names must all start with an "``llvm.``" prefix. This
7230 prefix is reserved in LLVM for intrinsic names; thus, function names may
7231 not begin with this prefix. Intrinsic functions must always be external
7232 functions: you cannot define the body of intrinsic functions. Intrinsic
7233 functions may only be used in call or invoke instructions: it is illegal
7234 to take the address of an intrinsic function. Additionally, because
7235 intrinsic functions are part of the LLVM language, it is required if any
7236 are added that they be documented here.
7238 Some intrinsic functions can be overloaded, i.e., the intrinsic
7239 represents a family of functions that perform the same operation but on
7240 different data types. Because LLVM can represent over 8 million
7241 different integer types, overloading is used commonly to allow an
7242 intrinsic function to operate on any integer type. One or more of the
7243 argument types or the result type can be overloaded to accept any
7244 integer type. Argument types may also be defined as exactly matching a
7245 previous argument's type or the result type. This allows an intrinsic
7246 function which accepts multiple arguments, but needs all of them to be
7247 of the same type, to only be overloaded with respect to a single
7248 argument or the result.
7250 Overloaded intrinsics will have the names of its overloaded argument
7251 types encoded into its function name, each preceded by a period. Only
7252 those types which are overloaded result in a name suffix. Arguments
7253 whose type is matched against another type do not. For example, the
7254 ``llvm.ctpop`` function can take an integer of any width and returns an
7255 integer of exactly the same integer width. This leads to a family of
7256 functions such as ``i8 @llvm.ctpop.i8(i8 %val)`` and
7257 ``i29 @llvm.ctpop.i29(i29 %val)``. Only one type, the return type, is
7258 overloaded, and only one type suffix is required. Because the argument's
7259 type is matched against the return type, it does not require its own
7262 To learn how to add an intrinsic function, please see the `Extending
7263 LLVM Guide <ExtendingLLVM.html>`_.
7267 Variable Argument Handling Intrinsics
7268 -------------------------------------
7270 Variable argument support is defined in LLVM with the
7271 :ref:`va_arg <i_va_arg>` instruction and these three intrinsic
7272 functions. These functions are related to the similarly named macros
7273 defined in the ``<stdarg.h>`` header file.
7275 All of these functions operate on arguments that use a target-specific
7276 value type "``va_list``". The LLVM assembly language reference manual
7277 does not define what this type is, so all transformations should be
7278 prepared to handle these functions regardless of the type used.
7280 This example shows how the :ref:`va_arg <i_va_arg>` instruction and the
7281 variable argument handling intrinsic functions are used.
7283 .. code-block:: llvm
7285 ; This struct is different for every platform. For most platforms,
7286 ; it is merely an i8*.
7287 %struct.va_list = type { i8* }
7289 ; For Unix x86_64 platforms, va_list is the following struct:
7290 ; %struct.va_list = type { i32, i32, i8*, i8* }
7292 define i32 @test(i32 %X, ...) {
7293 ; Initialize variable argument processing
7294 %ap = alloca %struct.va_list
7295 %ap2 = bitcast %struct.va_list* %ap to i8*
7296 call void @llvm.va_start(i8* %ap2)
7298 ; Read a single integer argument
7299 %tmp = va_arg i8* %ap2, i32
7301 ; Demonstrate usage of llvm.va_copy and llvm.va_end
7303 %aq2 = bitcast i8** %aq to i8*
7304 call void @llvm.va_copy(i8* %aq2, i8* %ap2)
7305 call void @llvm.va_end(i8* %aq2)
7307 ; Stop processing of arguments.
7308 call void @llvm.va_end(i8* %ap2)
7312 declare void @llvm.va_start(i8*)
7313 declare void @llvm.va_copy(i8*, i8*)
7314 declare void @llvm.va_end(i8*)
7318 '``llvm.va_start``' Intrinsic
7319 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7326 declare void @llvm.va_start(i8* <arglist>)
7331 The '``llvm.va_start``' intrinsic initializes ``*<arglist>`` for
7332 subsequent use by ``va_arg``.
7337 The argument is a pointer to a ``va_list`` element to initialize.
7342 The '``llvm.va_start``' intrinsic works just like the ``va_start`` macro
7343 available in C. In a target-dependent way, it initializes the
7344 ``va_list`` element to which the argument points, so that the next call
7345 to ``va_arg`` will produce the first variable argument passed to the
7346 function. Unlike the C ``va_start`` macro, this intrinsic does not need
7347 to know the last argument of the function as the compiler can figure
7350 '``llvm.va_end``' Intrinsic
7351 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
7358 declare void @llvm.va_end(i8* <arglist>)
7363 The '``llvm.va_end``' intrinsic destroys ``*<arglist>``, which has been
7364 initialized previously with ``llvm.va_start`` or ``llvm.va_copy``.
7369 The argument is a pointer to a ``va_list`` to destroy.
7374 The '``llvm.va_end``' intrinsic works just like the ``va_end`` macro
7375 available in C. In a target-dependent way, it destroys the ``va_list``
7376 element to which the argument points. Calls to
7377 :ref:`llvm.va_start <int_va_start>` and
7378 :ref:`llvm.va_copy <int_va_copy>` must be matched exactly with calls to
7383 '``llvm.va_copy``' Intrinsic
7384 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7391 declare void @llvm.va_copy(i8* <destarglist>, i8* <srcarglist>)
7396 The '``llvm.va_copy``' intrinsic copies the current argument position
7397 from the source argument list to the destination argument list.
7402 The first argument is a pointer to a ``va_list`` element to initialize.
7403 The second argument is a pointer to a ``va_list`` element to copy from.
7408 The '``llvm.va_copy``' intrinsic works just like the ``va_copy`` macro
7409 available in C. In a target-dependent way, it copies the source
7410 ``va_list`` element into the destination ``va_list`` element. This
7411 intrinsic is necessary because the `` llvm.va_start`` intrinsic may be
7412 arbitrarily complex and require, for example, memory allocation.
7414 Accurate Garbage Collection Intrinsics
7415 --------------------------------------
7417 LLVM's support for `Accurate Garbage Collection <GarbageCollection.html>`_
7418 (GC) requires the frontend to generate code containing appropriate intrinsic
7419 calls and select an appropriate GC strategy which knows how to lower these
7420 intrinsics in a manner which is appropriate for the target collector.
7422 These intrinsics allow identification of :ref:`GC roots on the
7423 stack <int_gcroot>`, as well as garbage collector implementations that
7424 require :ref:`read <int_gcread>` and :ref:`write <int_gcwrite>` barriers.
7425 Frontends for type-safe garbage collected languages should generate
7426 these intrinsics to make use of the LLVM garbage collectors. For more
7427 details, see `Garbage Collection with LLVM <GarbageCollection.html>`_.
7429 Experimental Statepoint Intrinsics
7430 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7432 LLVM provides an second experimental set of intrinsics for describing garbage
7433 collection safepoints in compiled code. These intrinsics are an alternative
7434 to the ``llvm.gcroot`` intrinsics, but are compatible with the ones for
7435 :ref:`read <int_gcread>` and :ref:`write <int_gcwrite>` barriers. The
7436 differences in approach are covered in the `Garbage Collection with LLVM
7437 <GarbageCollection.html>`_ documentation. The intrinsics themselves are
7438 described in :doc:`Statepoints`.
7442 '``llvm.gcroot``' Intrinsic
7443 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
7450 declare void @llvm.gcroot(i8** %ptrloc, i8* %metadata)
7455 The '``llvm.gcroot``' intrinsic declares the existence of a GC root to
7456 the code generator, and allows some metadata to be associated with it.
7461 The first argument specifies the address of a stack object that contains
7462 the root pointer. The second pointer (which must be either a constant or
7463 a global value address) contains the meta-data to be associated with the
7469 At runtime, a call to this intrinsic stores a null pointer into the
7470 "ptrloc" location. At compile-time, the code generator generates
7471 information to allow the runtime to find the pointer at GC safe points.
7472 The '``llvm.gcroot``' intrinsic may only be used in a function which
7473 :ref:`specifies a GC algorithm <gc>`.
7477 '``llvm.gcread``' Intrinsic
7478 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
7485 declare i8* @llvm.gcread(i8* %ObjPtr, i8** %Ptr)
7490 The '``llvm.gcread``' intrinsic identifies reads of references from heap
7491 locations, allowing garbage collector implementations that require read
7497 The second argument is the address to read from, which should be an
7498 address allocated from the garbage collector. The first object is a
7499 pointer to the start of the referenced object, if needed by the language
7500 runtime (otherwise null).
7505 The '``llvm.gcread``' intrinsic has the same semantics as a load
7506 instruction, but may be replaced with substantially more complex code by
7507 the garbage collector runtime, as needed. The '``llvm.gcread``'
7508 intrinsic may only be used in a function which :ref:`specifies a GC
7513 '``llvm.gcwrite``' Intrinsic
7514 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7521 declare void @llvm.gcwrite(i8* %P1, i8* %Obj, i8** %P2)
7526 The '``llvm.gcwrite``' intrinsic identifies writes of references to heap
7527 locations, allowing garbage collector implementations that require write
7528 barriers (such as generational or reference counting collectors).
7533 The first argument is the reference to store, the second is the start of
7534 the object to store it to, and the third is the address of the field of
7535 Obj to store to. If the runtime does not require a pointer to the
7536 object, Obj may be null.
7541 The '``llvm.gcwrite``' intrinsic has the same semantics as a store
7542 instruction, but may be replaced with substantially more complex code by
7543 the garbage collector runtime, as needed. The '``llvm.gcwrite``'
7544 intrinsic may only be used in a function which :ref:`specifies a GC
7547 Code Generator Intrinsics
7548 -------------------------
7550 These intrinsics are provided by LLVM to expose special features that
7551 may only be implemented with code generator support.
7553 '``llvm.returnaddress``' Intrinsic
7554 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7561 declare i8 *@llvm.returnaddress(i32 <level>)
7566 The '``llvm.returnaddress``' intrinsic attempts to compute a
7567 target-specific value indicating the return address of the current
7568 function or one of its callers.
7573 The argument to this intrinsic indicates which function to return the
7574 address for. Zero indicates the calling function, one indicates its
7575 caller, etc. The argument is **required** to be a constant integer
7581 The '``llvm.returnaddress``' intrinsic either returns a pointer
7582 indicating the return address of the specified call frame, or zero if it
7583 cannot be identified. The value returned by this intrinsic is likely to
7584 be incorrect or 0 for arguments other than zero, so it should only be
7585 used for debugging purposes.
7587 Note that calling this intrinsic does not prevent function inlining or
7588 other aggressive transformations, so the value returned may not be that
7589 of the obvious source-language caller.
7591 '``llvm.frameaddress``' Intrinsic
7592 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7599 declare i8* @llvm.frameaddress(i32 <level>)
7604 The '``llvm.frameaddress``' intrinsic attempts to return the
7605 target-specific frame pointer value for the specified stack frame.
7610 The argument to this intrinsic indicates which function to return the
7611 frame pointer for. Zero indicates the calling function, one indicates
7612 its caller, etc. The argument is **required** to be a constant integer
7618 The '``llvm.frameaddress``' intrinsic either returns a pointer
7619 indicating the frame address of the specified call frame, or zero if it
7620 cannot be identified. The value returned by this intrinsic is likely to
7621 be incorrect or 0 for arguments other than zero, so it should only be
7622 used for debugging purposes.
7624 Note that calling this intrinsic does not prevent function inlining or
7625 other aggressive transformations, so the value returned may not be that
7626 of the obvious source-language caller.
7628 '``llvm.frameescape``' and '``llvm.framerecover``' Intrinsics
7629 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7636 declare void @llvm.frameescape(...)
7637 declare i8* @llvm.framerecover(i8* %func, i8* %fp, i32 %idx)
7642 The '``llvm.frameescape``' intrinsic escapes offsets of a collection of static
7643 allocas, and the '``llvm.framerecover``' intrinsic applies those offsets to a
7644 live frame pointer to recover the address of the allocation. The offset is
7645 computed during frame layout of the caller of ``llvm.frameescape``.
7650 All arguments to '``llvm.frameescape``' must be pointers to static allocas or
7651 casts of static allocas. Each function can only call '``llvm.frameescape``'
7652 once, and it can only do so from the entry block.
7654 The ``func`` argument to '``llvm.framerecover``' must be a constant
7655 bitcasted pointer to a function defined in the current module. The code
7656 generator cannot determine the frame allocation offset of functions defined in
7659 The ``fp`` argument to '``llvm.framerecover``' must be a frame
7660 pointer of a call frame that is currently live. The return value of
7661 '``llvm.frameaddress``' is one way to produce such a value, but most platforms
7662 also expose the frame pointer through stack unwinding mechanisms.
7664 The ``idx`` argument to '``llvm.framerecover``' indicates which alloca passed to
7665 '``llvm.frameescape``' to recover. It is zero-indexed.
7670 These intrinsics allow a group of functions to access one stack memory
7671 allocation in an ancestor stack frame. The memory returned from
7672 '``llvm.frameallocate``' may be allocated prior to stack realignment, so the
7673 memory is only aligned to the ABI-required stack alignment. Each function may
7674 only call '``llvm.frameallocate``' one or zero times from the function entry
7675 block. The frame allocation intrinsic inhibits inlining, as any frame
7676 allocations in the inlined function frame are likely to be at a different
7677 offset from the one used by '``llvm.framerecover``' called with the
7680 .. _int_read_register:
7681 .. _int_write_register:
7683 '``llvm.read_register``' and '``llvm.write_register``' Intrinsics
7684 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7691 declare i32 @llvm.read_register.i32(metadata)
7692 declare i64 @llvm.read_register.i64(metadata)
7693 declare void @llvm.write_register.i32(metadata, i32 @value)
7694 declare void @llvm.write_register.i64(metadata, i64 @value)
7700 The '``llvm.read_register``' and '``llvm.write_register``' intrinsics
7701 provides access to the named register. The register must be valid on
7702 the architecture being compiled to. The type needs to be compatible
7703 with the register being read.
7708 The '``llvm.read_register``' intrinsic returns the current value of the
7709 register, where possible. The '``llvm.write_register``' intrinsic sets
7710 the current value of the register, where possible.
7712 This is useful to implement named register global variables that need
7713 to always be mapped to a specific register, as is common practice on
7714 bare-metal programs including OS kernels.
7716 The compiler doesn't check for register availability or use of the used
7717 register in surrounding code, including inline assembly. Because of that,
7718 allocatable registers are not supported.
7720 Warning: So far it only works with the stack pointer on selected
7721 architectures (ARM, AArch64, PowerPC and x86_64). Significant amount of
7722 work is needed to support other registers and even more so, allocatable
7727 '``llvm.stacksave``' Intrinsic
7728 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7735 declare i8* @llvm.stacksave()
7740 The '``llvm.stacksave``' intrinsic is used to remember the current state
7741 of the function stack, for use with
7742 :ref:`llvm.stackrestore <int_stackrestore>`. This is useful for
7743 implementing language features like scoped automatic variable sized
7749 This intrinsic returns a opaque pointer value that can be passed to
7750 :ref:`llvm.stackrestore <int_stackrestore>`. When an
7751 ``llvm.stackrestore`` intrinsic is executed with a value saved from
7752 ``llvm.stacksave``, it effectively restores the state of the stack to
7753 the state it was in when the ``llvm.stacksave`` intrinsic executed. In
7754 practice, this pops any :ref:`alloca <i_alloca>` blocks from the stack that
7755 were allocated after the ``llvm.stacksave`` was executed.
7757 .. _int_stackrestore:
7759 '``llvm.stackrestore``' Intrinsic
7760 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7767 declare void @llvm.stackrestore(i8* %ptr)
7772 The '``llvm.stackrestore``' intrinsic is used to restore the state of
7773 the function stack to the state it was in when the corresponding
7774 :ref:`llvm.stacksave <int_stacksave>` intrinsic executed. This is
7775 useful for implementing language features like scoped automatic variable
7776 sized arrays in C99.
7781 See the description for :ref:`llvm.stacksave <int_stacksave>`.
7783 '``llvm.prefetch``' Intrinsic
7784 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7791 declare void @llvm.prefetch(i8* <address>, i32 <rw>, i32 <locality>, i32 <cache type>)
7796 The '``llvm.prefetch``' intrinsic is a hint to the code generator to
7797 insert a prefetch instruction if supported; otherwise, it is a noop.
7798 Prefetches have no effect on the behavior of the program but can change
7799 its performance characteristics.
7804 ``address`` is the address to be prefetched, ``rw`` is the specifier
7805 determining if the fetch should be for a read (0) or write (1), and
7806 ``locality`` is a temporal locality specifier ranging from (0) - no
7807 locality, to (3) - extremely local keep in cache. The ``cache type``
7808 specifies whether the prefetch is performed on the data (1) or
7809 instruction (0) cache. The ``rw``, ``locality`` and ``cache type``
7810 arguments must be constant integers.
7815 This intrinsic does not modify the behavior of the program. In
7816 particular, prefetches cannot trap and do not produce a value. On
7817 targets that support this intrinsic, the prefetch can provide hints to
7818 the processor cache for better performance.
7820 '``llvm.pcmarker``' Intrinsic
7821 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7828 declare void @llvm.pcmarker(i32 <id>)
7833 The '``llvm.pcmarker``' intrinsic is a method to export a Program
7834 Counter (PC) in a region of code to simulators and other tools. The
7835 method is target specific, but it is expected that the marker will use
7836 exported symbols to transmit the PC of the marker. The marker makes no
7837 guarantees that it will remain with any specific instruction after
7838 optimizations. It is possible that the presence of a marker will inhibit
7839 optimizations. The intended use is to be inserted after optimizations to
7840 allow correlations of simulation runs.
7845 ``id`` is a numerical id identifying the marker.
7850 This intrinsic does not modify the behavior of the program. Backends
7851 that do not support this intrinsic may ignore it.
7853 '``llvm.readcyclecounter``' Intrinsic
7854 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7861 declare i64 @llvm.readcyclecounter()
7866 The '``llvm.readcyclecounter``' intrinsic provides access to the cycle
7867 counter register (or similar low latency, high accuracy clocks) on those
7868 targets that support it. On X86, it should map to RDTSC. On Alpha, it
7869 should map to RPCC. As the backing counters overflow quickly (on the
7870 order of 9 seconds on alpha), this should only be used for small
7876 When directly supported, reading the cycle counter should not modify any
7877 memory. Implementations are allowed to either return a application
7878 specific value or a system wide value. On backends without support, this
7879 is lowered to a constant 0.
7881 Note that runtime support may be conditional on the privilege-level code is
7882 running at and the host platform.
7884 '``llvm.clear_cache``' Intrinsic
7885 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7892 declare void @llvm.clear_cache(i8*, i8*)
7897 The '``llvm.clear_cache``' intrinsic ensures visibility of modifications
7898 in the specified range to the execution unit of the processor. On
7899 targets with non-unified instruction and data cache, the implementation
7900 flushes the instruction cache.
7905 On platforms with coherent instruction and data caches (e.g. x86), this
7906 intrinsic is a nop. On platforms with non-coherent instruction and data
7907 cache (e.g. ARM, MIPS), the intrinsic is lowered either to appropriate
7908 instructions or a system call, if cache flushing requires special
7911 The default behavior is to emit a call to ``__clear_cache`` from the run
7914 This instrinsic does *not* empty the instruction pipeline. Modifications
7915 of the current function are outside the scope of the intrinsic.
7917 '``llvm.instrprof_increment``' Intrinsic
7918 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7925 declare void @llvm.instrprof_increment(i8* <name>, i64 <hash>,
7926 i32 <num-counters>, i32 <index>)
7931 The '``llvm.instrprof_increment``' intrinsic can be emitted by a
7932 frontend for use with instrumentation based profiling. These will be
7933 lowered by the ``-instrprof`` pass to generate execution counts of a
7939 The first argument is a pointer to a global variable containing the
7940 name of the entity being instrumented. This should generally be the
7941 (mangled) function name for a set of counters.
7943 The second argument is a hash value that can be used by the consumer
7944 of the profile data to detect changes to the instrumented source, and
7945 the third is the number of counters associated with ``name``. It is an
7946 error if ``hash`` or ``num-counters`` differ between two instances of
7947 ``instrprof_increment`` that refer to the same name.
7949 The last argument refers to which of the counters for ``name`` should
7950 be incremented. It should be a value between 0 and ``num-counters``.
7955 This intrinsic represents an increment of a profiling counter. It will
7956 cause the ``-instrprof`` pass to generate the appropriate data
7957 structures and the code to increment the appropriate value, in a
7958 format that can be written out by a compiler runtime and consumed via
7959 the ``llvm-profdata`` tool.
7961 Standard C Library Intrinsics
7962 -----------------------------
7964 LLVM provides intrinsics for a few important standard C library
7965 functions. These intrinsics allow source-language front-ends to pass
7966 information about the alignment of the pointer arguments to the code
7967 generator, providing opportunity for more efficient code generation.
7971 '``llvm.memcpy``' Intrinsic
7972 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
7977 This is an overloaded intrinsic. You can use ``llvm.memcpy`` on any
7978 integer bit width and for different address spaces. Not all targets
7979 support all bit widths however.
7983 declare void @llvm.memcpy.p0i8.p0i8.i32(i8* <dest>, i8* <src>,
7984 i32 <len>, i32 <align>, i1 <isvolatile>)
7985 declare void @llvm.memcpy.p0i8.p0i8.i64(i8* <dest>, i8* <src>,
7986 i64 <len>, i32 <align>, i1 <isvolatile>)
7991 The '``llvm.memcpy.*``' intrinsics copy a block of memory from the
7992 source location to the destination location.
7994 Note that, unlike the standard libc function, the ``llvm.memcpy.*``
7995 intrinsics do not return a value, takes extra alignment/isvolatile
7996 arguments and the pointers can be in specified address spaces.
8001 The first argument is a pointer to the destination, the second is a
8002 pointer to the source. The third argument is an integer argument
8003 specifying the number of bytes to copy, the fourth argument is the
8004 alignment of the source and destination locations, and the fifth is a
8005 boolean indicating a volatile access.
8007 If the call to this intrinsic has an alignment value that is not 0 or 1,
8008 then the caller guarantees that both the source and destination pointers
8009 are aligned to that boundary.
8011 If the ``isvolatile`` parameter is ``true``, the ``llvm.memcpy`` call is
8012 a :ref:`volatile operation <volatile>`. The detailed access behavior is not
8013 very cleanly specified and it is unwise to depend on it.
8018 The '``llvm.memcpy.*``' intrinsics copy a block of memory from the
8019 source location to the destination location, which are not allowed to
8020 overlap. It copies "len" bytes of memory over. If the argument is known
8021 to be aligned to some boundary, this can be specified as the fourth
8022 argument, otherwise it should be set to 0 or 1 (both meaning no alignment).
8024 '``llvm.memmove``' Intrinsic
8025 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
8030 This is an overloaded intrinsic. You can use llvm.memmove on any integer
8031 bit width and for different address space. Not all targets support all
8036 declare void @llvm.memmove.p0i8.p0i8.i32(i8* <dest>, i8* <src>,
8037 i32 <len>, i32 <align>, i1 <isvolatile>)
8038 declare void @llvm.memmove.p0i8.p0i8.i64(i8* <dest>, i8* <src>,
8039 i64 <len>, i32 <align>, i1 <isvolatile>)
8044 The '``llvm.memmove.*``' intrinsics move a block of memory from the
8045 source location to the destination location. It is similar to the
8046 '``llvm.memcpy``' intrinsic but allows the two memory locations to
8049 Note that, unlike the standard libc function, the ``llvm.memmove.*``
8050 intrinsics do not return a value, takes extra alignment/isvolatile
8051 arguments and the pointers can be in specified address spaces.
8056 The first argument is a pointer to the destination, the second is a
8057 pointer to the source. The third argument is an integer argument
8058 specifying the number of bytes to copy, the fourth argument is the
8059 alignment of the source and destination locations, and the fifth is a
8060 boolean indicating a volatile access.
8062 If the call to this intrinsic has an alignment value that is not 0 or 1,
8063 then the caller guarantees that the source and destination pointers are
8064 aligned to that boundary.
8066 If the ``isvolatile`` parameter is ``true``, the ``llvm.memmove`` call
8067 is a :ref:`volatile operation <volatile>`. The detailed access behavior is
8068 not very cleanly specified and it is unwise to depend on it.
8073 The '``llvm.memmove.*``' intrinsics copy a block of memory from the
8074 source location to the destination location, which may overlap. It
8075 copies "len" bytes of memory over. If the argument is known to be
8076 aligned to some boundary, this can be specified as the fourth argument,
8077 otherwise it should be set to 0 or 1 (both meaning no alignment).
8079 '``llvm.memset.*``' Intrinsics
8080 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
8085 This is an overloaded intrinsic. You can use llvm.memset on any integer
8086 bit width and for different address spaces. However, not all targets
8087 support all bit widths.
8091 declare void @llvm.memset.p0i8.i32(i8* <dest>, i8 <val>,
8092 i32 <len>, i32 <align>, i1 <isvolatile>)
8093 declare void @llvm.memset.p0i8.i64(i8* <dest>, i8 <val>,
8094 i64 <len>, i32 <align>, i1 <isvolatile>)
8099 The '``llvm.memset.*``' intrinsics fill a block of memory with a
8100 particular byte value.
8102 Note that, unlike the standard libc function, the ``llvm.memset``
8103 intrinsic does not return a value and takes extra alignment/volatile
8104 arguments. Also, the destination can be in an arbitrary address space.
8109 The first argument is a pointer to the destination to fill, the second
8110 is the byte value with which to fill it, the third argument is an
8111 integer argument specifying the number of bytes to fill, and the fourth
8112 argument is the known alignment of the destination location.
8114 If the call to this intrinsic has an alignment value that is not 0 or 1,
8115 then the caller guarantees that the destination pointer is aligned to
8118 If the ``isvolatile`` parameter is ``true``, the ``llvm.memset`` call is
8119 a :ref:`volatile operation <volatile>`. The detailed access behavior is not
8120 very cleanly specified and it is unwise to depend on it.
8125 The '``llvm.memset.*``' intrinsics fill "len" bytes of memory starting
8126 at the destination location. If the argument is known to be aligned to
8127 some boundary, this can be specified as the fourth argument, otherwise
8128 it should be set to 0 or 1 (both meaning no alignment).
8130 '``llvm.sqrt.*``' Intrinsic
8131 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
8136 This is an overloaded intrinsic. You can use ``llvm.sqrt`` on any
8137 floating point or vector of floating point type. Not all targets support
8142 declare float @llvm.sqrt.f32(float %Val)
8143 declare double @llvm.sqrt.f64(double %Val)
8144 declare x86_fp80 @llvm.sqrt.f80(x86_fp80 %Val)
8145 declare fp128 @llvm.sqrt.f128(fp128 %Val)
8146 declare ppc_fp128 @llvm.sqrt.ppcf128(ppc_fp128 %Val)
8151 The '``llvm.sqrt``' intrinsics return the sqrt of the specified operand,
8152 returning the same value as the libm '``sqrt``' functions would. Unlike
8153 ``sqrt`` in libm, however, ``llvm.sqrt`` has undefined behavior for
8154 negative numbers other than -0.0 (which allows for better optimization,
8155 because there is no need to worry about errno being set).
8156 ``llvm.sqrt(-0.0)`` is defined to return -0.0 like IEEE sqrt.
8161 The argument and return value are floating point numbers of the same
8167 This function returns the sqrt of the specified operand if it is a
8168 nonnegative floating point number.
8170 '``llvm.powi.*``' Intrinsic
8171 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
8176 This is an overloaded intrinsic. You can use ``llvm.powi`` on any
8177 floating point or vector of floating point type. Not all targets support
8182 declare float @llvm.powi.f32(float %Val, i32 %power)
8183 declare double @llvm.powi.f64(double %Val, i32 %power)
8184 declare x86_fp80 @llvm.powi.f80(x86_fp80 %Val, i32 %power)
8185 declare fp128 @llvm.powi.f128(fp128 %Val, i32 %power)
8186 declare ppc_fp128 @llvm.powi.ppcf128(ppc_fp128 %Val, i32 %power)
8191 The '``llvm.powi.*``' intrinsics return the first operand raised to the
8192 specified (positive or negative) power. The order of evaluation of
8193 multiplications is not defined. When a vector of floating point type is
8194 used, the second argument remains a scalar integer value.
8199 The second argument is an integer power, and the first is a value to
8200 raise to that power.
8205 This function returns the first value raised to the second power with an
8206 unspecified sequence of rounding operations.
8208 '``llvm.sin.*``' Intrinsic
8209 ^^^^^^^^^^^^^^^^^^^^^^^^^^
8214 This is an overloaded intrinsic. You can use ``llvm.sin`` on any
8215 floating point or vector of floating point type. Not all targets support
8220 declare float @llvm.sin.f32(float %Val)
8221 declare double @llvm.sin.f64(double %Val)
8222 declare x86_fp80 @llvm.sin.f80(x86_fp80 %Val)
8223 declare fp128 @llvm.sin.f128(fp128 %Val)
8224 declare ppc_fp128 @llvm.sin.ppcf128(ppc_fp128 %Val)
8229 The '``llvm.sin.*``' intrinsics return the sine of the operand.
8234 The argument and return value are floating point numbers of the same
8240 This function returns the sine of the specified operand, returning the
8241 same values as the libm ``sin`` functions would, and handles error
8242 conditions in the same way.
8244 '``llvm.cos.*``' Intrinsic
8245 ^^^^^^^^^^^^^^^^^^^^^^^^^^
8250 This is an overloaded intrinsic. You can use ``llvm.cos`` on any
8251 floating point or vector of floating point type. Not all targets support
8256 declare float @llvm.cos.f32(float %Val)
8257 declare double @llvm.cos.f64(double %Val)
8258 declare x86_fp80 @llvm.cos.f80(x86_fp80 %Val)
8259 declare fp128 @llvm.cos.f128(fp128 %Val)
8260 declare ppc_fp128 @llvm.cos.ppcf128(ppc_fp128 %Val)
8265 The '``llvm.cos.*``' intrinsics return the cosine of the operand.
8270 The argument and return value are floating point numbers of the same
8276 This function returns the cosine of the specified operand, returning the
8277 same values as the libm ``cos`` functions would, and handles error
8278 conditions in the same way.
8280 '``llvm.pow.*``' Intrinsic
8281 ^^^^^^^^^^^^^^^^^^^^^^^^^^
8286 This is an overloaded intrinsic. You can use ``llvm.pow`` on any
8287 floating point or vector of floating point type. Not all targets support
8292 declare float @llvm.pow.f32(float %Val, float %Power)
8293 declare double @llvm.pow.f64(double %Val, double %Power)
8294 declare x86_fp80 @llvm.pow.f80(x86_fp80 %Val, x86_fp80 %Power)
8295 declare fp128 @llvm.pow.f128(fp128 %Val, fp128 %Power)
8296 declare ppc_fp128 @llvm.pow.ppcf128(ppc_fp128 %Val, ppc_fp128 Power)
8301 The '``llvm.pow.*``' intrinsics return the first operand raised to the
8302 specified (positive or negative) power.
8307 The second argument is a floating point power, and the first is a value
8308 to raise to that power.
8313 This function returns the first value raised to the second power,
8314 returning the same values as the libm ``pow`` functions would, and
8315 handles error conditions in the same way.
8317 '``llvm.exp.*``' Intrinsic
8318 ^^^^^^^^^^^^^^^^^^^^^^^^^^
8323 This is an overloaded intrinsic. You can use ``llvm.exp`` on any
8324 floating point or vector of floating point type. Not all targets support
8329 declare float @llvm.exp.f32(float %Val)
8330 declare double @llvm.exp.f64(double %Val)
8331 declare x86_fp80 @llvm.exp.f80(x86_fp80 %Val)
8332 declare fp128 @llvm.exp.f128(fp128 %Val)
8333 declare ppc_fp128 @llvm.exp.ppcf128(ppc_fp128 %Val)
8338 The '``llvm.exp.*``' intrinsics perform the exp function.
8343 The argument and return value are floating point numbers of the same
8349 This function returns the same values as the libm ``exp`` functions
8350 would, and handles error conditions in the same way.
8352 '``llvm.exp2.*``' Intrinsic
8353 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
8358 This is an overloaded intrinsic. You can use ``llvm.exp2`` on any
8359 floating point or vector of floating point type. Not all targets support
8364 declare float @llvm.exp2.f32(float %Val)
8365 declare double @llvm.exp2.f64(double %Val)
8366 declare x86_fp80 @llvm.exp2.f80(x86_fp80 %Val)
8367 declare fp128 @llvm.exp2.f128(fp128 %Val)
8368 declare ppc_fp128 @llvm.exp2.ppcf128(ppc_fp128 %Val)
8373 The '``llvm.exp2.*``' intrinsics perform the exp2 function.
8378 The argument and return value are floating point numbers of the same
8384 This function returns the same values as the libm ``exp2`` functions
8385 would, and handles error conditions in the same way.
8387 '``llvm.log.*``' Intrinsic
8388 ^^^^^^^^^^^^^^^^^^^^^^^^^^
8393 This is an overloaded intrinsic. You can use ``llvm.log`` on any
8394 floating point or vector of floating point type. Not all targets support
8399 declare float @llvm.log.f32(float %Val)
8400 declare double @llvm.log.f64(double %Val)
8401 declare x86_fp80 @llvm.log.f80(x86_fp80 %Val)
8402 declare fp128 @llvm.log.f128(fp128 %Val)
8403 declare ppc_fp128 @llvm.log.ppcf128(ppc_fp128 %Val)
8408 The '``llvm.log.*``' intrinsics perform the log function.
8413 The argument and return value are floating point numbers of the same
8419 This function returns the same values as the libm ``log`` functions
8420 would, and handles error conditions in the same way.
8422 '``llvm.log10.*``' Intrinsic
8423 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
8428 This is an overloaded intrinsic. You can use ``llvm.log10`` on any
8429 floating point or vector of floating point type. Not all targets support
8434 declare float @llvm.log10.f32(float %Val)
8435 declare double @llvm.log10.f64(double %Val)
8436 declare x86_fp80 @llvm.log10.f80(x86_fp80 %Val)
8437 declare fp128 @llvm.log10.f128(fp128 %Val)
8438 declare ppc_fp128 @llvm.log10.ppcf128(ppc_fp128 %Val)
8443 The '``llvm.log10.*``' intrinsics perform the log10 function.
8448 The argument and return value are floating point numbers of the same
8454 This function returns the same values as the libm ``log10`` functions
8455 would, and handles error conditions in the same way.
8457 '``llvm.log2.*``' Intrinsic
8458 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
8463 This is an overloaded intrinsic. You can use ``llvm.log2`` on any
8464 floating point or vector of floating point type. Not all targets support
8469 declare float @llvm.log2.f32(float %Val)
8470 declare double @llvm.log2.f64(double %Val)
8471 declare x86_fp80 @llvm.log2.f80(x86_fp80 %Val)
8472 declare fp128 @llvm.log2.f128(fp128 %Val)
8473 declare ppc_fp128 @llvm.log2.ppcf128(ppc_fp128 %Val)
8478 The '``llvm.log2.*``' intrinsics perform the log2 function.
8483 The argument and return value are floating point numbers of the same
8489 This function returns the same values as the libm ``log2`` functions
8490 would, and handles error conditions in the same way.
8492 '``llvm.fma.*``' Intrinsic
8493 ^^^^^^^^^^^^^^^^^^^^^^^^^^
8498 This is an overloaded intrinsic. You can use ``llvm.fma`` on any
8499 floating point or vector of floating point type. Not all targets support
8504 declare float @llvm.fma.f32(float %a, float %b, float %c)
8505 declare double @llvm.fma.f64(double %a, double %b, double %c)
8506 declare x86_fp80 @llvm.fma.f80(x86_fp80 %a, x86_fp80 %b, x86_fp80 %c)
8507 declare fp128 @llvm.fma.f128(fp128 %a, fp128 %b, fp128 %c)
8508 declare ppc_fp128 @llvm.fma.ppcf128(ppc_fp128 %a, ppc_fp128 %b, ppc_fp128 %c)
8513 The '``llvm.fma.*``' intrinsics perform the fused multiply-add
8519 The argument and return value are floating point numbers of the same
8525 This function returns the same values as the libm ``fma`` functions
8526 would, and does not set errno.
8528 '``llvm.fabs.*``' Intrinsic
8529 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
8534 This is an overloaded intrinsic. You can use ``llvm.fabs`` on any
8535 floating point or vector of floating point type. Not all targets support
8540 declare float @llvm.fabs.f32(float %Val)
8541 declare double @llvm.fabs.f64(double %Val)
8542 declare x86_fp80 @llvm.fabs.f80(x86_fp80 %Val)
8543 declare fp128 @llvm.fabs.f128(fp128 %Val)
8544 declare ppc_fp128 @llvm.fabs.ppcf128(ppc_fp128 %Val)
8549 The '``llvm.fabs.*``' intrinsics return the absolute value of the
8555 The argument and return value are floating point numbers of the same
8561 This function returns the same values as the libm ``fabs`` functions
8562 would, and handles error conditions in the same way.
8564 '``llvm.minnum.*``' Intrinsic
8565 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
8570 This is an overloaded intrinsic. You can use ``llvm.minnum`` on any
8571 floating point or vector of floating point type. Not all targets support
8576 declare float @llvm.minnum.f32(float %Val0, float %Val1)
8577 declare double @llvm.minnum.f64(double %Val0, double %Val1)
8578 declare x86_fp80 @llvm.minnum.f80(x86_fp80 %Val0, x86_fp80 %Val1)
8579 declare fp128 @llvm.minnum.f128(fp128 %Val0, fp128 %Val1)
8580 declare ppc_fp128 @llvm.minnum.ppcf128(ppc_fp128 %Val0, ppc_fp128 %Val1)
8585 The '``llvm.minnum.*``' intrinsics return the minimum of the two
8592 The arguments and return value are floating point numbers of the same
8598 Follows the IEEE-754 semantics for minNum, which also match for libm's
8601 If either operand is a NaN, returns the other non-NaN operand. Returns
8602 NaN only if both operands are NaN. If the operands compare equal,
8603 returns a value that compares equal to both operands. This means that
8604 fmin(+/-0.0, +/-0.0) could return either -0.0 or 0.0.
8606 '``llvm.maxnum.*``' Intrinsic
8607 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
8612 This is an overloaded intrinsic. You can use ``llvm.maxnum`` on any
8613 floating point or vector of floating point type. Not all targets support
8618 declare float @llvm.maxnum.f32(float %Val0, float %Val1l)
8619 declare double @llvm.maxnum.f64(double %Val0, double %Val1)
8620 declare x86_fp80 @llvm.maxnum.f80(x86_fp80 %Val0, x86_fp80 %Val1)
8621 declare fp128 @llvm.maxnum.f128(fp128 %Val0, fp128 %Val1)
8622 declare ppc_fp128 @llvm.maxnum.ppcf128(ppc_fp128 %Val0, ppc_fp128 %Val1)
8627 The '``llvm.maxnum.*``' intrinsics return the maximum of the two
8634 The arguments and return value are floating point numbers of the same
8639 Follows the IEEE-754 semantics for maxNum, which also match for libm's
8642 If either operand is a NaN, returns the other non-NaN operand. Returns
8643 NaN only if both operands are NaN. If the operands compare equal,
8644 returns a value that compares equal to both operands. This means that
8645 fmax(+/-0.0, +/-0.0) could return either -0.0 or 0.0.
8647 '``llvm.copysign.*``' Intrinsic
8648 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
8653 This is an overloaded intrinsic. You can use ``llvm.copysign`` on any
8654 floating point or vector of floating point type. Not all targets support
8659 declare float @llvm.copysign.f32(float %Mag, float %Sgn)
8660 declare double @llvm.copysign.f64(double %Mag, double %Sgn)
8661 declare x86_fp80 @llvm.copysign.f80(x86_fp80 %Mag, x86_fp80 %Sgn)
8662 declare fp128 @llvm.copysign.f128(fp128 %Mag, fp128 %Sgn)
8663 declare ppc_fp128 @llvm.copysign.ppcf128(ppc_fp128 %Mag, ppc_fp128 %Sgn)
8668 The '``llvm.copysign.*``' intrinsics return a value with the magnitude of the
8669 first operand and the sign of the second operand.
8674 The arguments and return value are floating point numbers of the same
8680 This function returns the same values as the libm ``copysign``
8681 functions would, and handles error conditions in the same way.
8683 '``llvm.floor.*``' Intrinsic
8684 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
8689 This is an overloaded intrinsic. You can use ``llvm.floor`` on any
8690 floating point or vector of floating point type. Not all targets support
8695 declare float @llvm.floor.f32(float %Val)
8696 declare double @llvm.floor.f64(double %Val)
8697 declare x86_fp80 @llvm.floor.f80(x86_fp80 %Val)
8698 declare fp128 @llvm.floor.f128(fp128 %Val)
8699 declare ppc_fp128 @llvm.floor.ppcf128(ppc_fp128 %Val)
8704 The '``llvm.floor.*``' intrinsics return the floor of the operand.
8709 The argument and return value are floating point numbers of the same
8715 This function returns the same values as the libm ``floor`` functions
8716 would, and handles error conditions in the same way.
8718 '``llvm.ceil.*``' Intrinsic
8719 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
8724 This is an overloaded intrinsic. You can use ``llvm.ceil`` on any
8725 floating point or vector of floating point type. Not all targets support
8730 declare float @llvm.ceil.f32(float %Val)
8731 declare double @llvm.ceil.f64(double %Val)
8732 declare x86_fp80 @llvm.ceil.f80(x86_fp80 %Val)
8733 declare fp128 @llvm.ceil.f128(fp128 %Val)
8734 declare ppc_fp128 @llvm.ceil.ppcf128(ppc_fp128 %Val)
8739 The '``llvm.ceil.*``' intrinsics return the ceiling of the operand.
8744 The argument and return value are floating point numbers of the same
8750 This function returns the same values as the libm ``ceil`` functions
8751 would, and handles error conditions in the same way.
8753 '``llvm.trunc.*``' Intrinsic
8754 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
8759 This is an overloaded intrinsic. You can use ``llvm.trunc`` on any
8760 floating point or vector of floating point type. Not all targets support
8765 declare float @llvm.trunc.f32(float %Val)
8766 declare double @llvm.trunc.f64(double %Val)
8767 declare x86_fp80 @llvm.trunc.f80(x86_fp80 %Val)
8768 declare fp128 @llvm.trunc.f128(fp128 %Val)
8769 declare ppc_fp128 @llvm.trunc.ppcf128(ppc_fp128 %Val)
8774 The '``llvm.trunc.*``' intrinsics returns the operand rounded to the
8775 nearest integer not larger in magnitude than the operand.
8780 The argument and return value are floating point numbers of the same
8786 This function returns the same values as the libm ``trunc`` functions
8787 would, and handles error conditions in the same way.
8789 '``llvm.rint.*``' Intrinsic
8790 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
8795 This is an overloaded intrinsic. You can use ``llvm.rint`` on any
8796 floating point or vector of floating point type. Not all targets support
8801 declare float @llvm.rint.f32(float %Val)
8802 declare double @llvm.rint.f64(double %Val)
8803 declare x86_fp80 @llvm.rint.f80(x86_fp80 %Val)
8804 declare fp128 @llvm.rint.f128(fp128 %Val)
8805 declare ppc_fp128 @llvm.rint.ppcf128(ppc_fp128 %Val)
8810 The '``llvm.rint.*``' intrinsics returns the operand rounded to the
8811 nearest integer. It may raise an inexact floating-point exception if the
8812 operand isn't an integer.
8817 The argument and return value are floating point numbers of the same
8823 This function returns the same values as the libm ``rint`` functions
8824 would, and handles error conditions in the same way.
8826 '``llvm.nearbyint.*``' Intrinsic
8827 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
8832 This is an overloaded intrinsic. You can use ``llvm.nearbyint`` on any
8833 floating point or vector of floating point type. Not all targets support
8838 declare float @llvm.nearbyint.f32(float %Val)
8839 declare double @llvm.nearbyint.f64(double %Val)
8840 declare x86_fp80 @llvm.nearbyint.f80(x86_fp80 %Val)
8841 declare fp128 @llvm.nearbyint.f128(fp128 %Val)
8842 declare ppc_fp128 @llvm.nearbyint.ppcf128(ppc_fp128 %Val)
8847 The '``llvm.nearbyint.*``' intrinsics returns the operand rounded to the
8853 The argument and return value are floating point numbers of the same
8859 This function returns the same values as the libm ``nearbyint``
8860 functions would, and handles error conditions in the same way.
8862 '``llvm.round.*``' Intrinsic
8863 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
8868 This is an overloaded intrinsic. You can use ``llvm.round`` on any
8869 floating point or vector of floating point type. Not all targets support
8874 declare float @llvm.round.f32(float %Val)
8875 declare double @llvm.round.f64(double %Val)
8876 declare x86_fp80 @llvm.round.f80(x86_fp80 %Val)
8877 declare fp128 @llvm.round.f128(fp128 %Val)
8878 declare ppc_fp128 @llvm.round.ppcf128(ppc_fp128 %Val)
8883 The '``llvm.round.*``' intrinsics returns the operand rounded to the
8889 The argument and return value are floating point numbers of the same
8895 This function returns the same values as the libm ``round``
8896 functions would, and handles error conditions in the same way.
8898 Bit Manipulation Intrinsics
8899 ---------------------------
8901 LLVM provides intrinsics for a few important bit manipulation
8902 operations. These allow efficient code generation for some algorithms.
8904 '``llvm.bswap.*``' Intrinsics
8905 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
8910 This is an overloaded intrinsic function. You can use bswap on any
8911 integer type that is an even number of bytes (i.e. BitWidth % 16 == 0).
8915 declare i16 @llvm.bswap.i16(i16 <id>)
8916 declare i32 @llvm.bswap.i32(i32 <id>)
8917 declare i64 @llvm.bswap.i64(i64 <id>)
8922 The '``llvm.bswap``' family of intrinsics is used to byte swap integer
8923 values with an even number of bytes (positive multiple of 16 bits).
8924 These are useful for performing operations on data that is not in the
8925 target's native byte order.
8930 The ``llvm.bswap.i16`` intrinsic returns an i16 value that has the high
8931 and low byte of the input i16 swapped. Similarly, the ``llvm.bswap.i32``
8932 intrinsic returns an i32 value that has the four bytes of the input i32
8933 swapped, so that if the input bytes are numbered 0, 1, 2, 3 then the
8934 returned i32 will have its bytes in 3, 2, 1, 0 order. The
8935 ``llvm.bswap.i48``, ``llvm.bswap.i64`` and other intrinsics extend this
8936 concept to additional even-byte lengths (6 bytes, 8 bytes and more,
8939 '``llvm.ctpop.*``' Intrinsic
8940 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
8945 This is an overloaded intrinsic. You can use llvm.ctpop on any integer
8946 bit width, or on any vector with integer elements. Not all targets
8947 support all bit widths or vector types, however.
8951 declare i8 @llvm.ctpop.i8(i8 <src>)
8952 declare i16 @llvm.ctpop.i16(i16 <src>)
8953 declare i32 @llvm.ctpop.i32(i32 <src>)
8954 declare i64 @llvm.ctpop.i64(i64 <src>)
8955 declare i256 @llvm.ctpop.i256(i256 <src>)
8956 declare <2 x i32> @llvm.ctpop.v2i32(<2 x i32> <src>)
8961 The '``llvm.ctpop``' family of intrinsics counts the number of bits set
8967 The only argument is the value to be counted. The argument may be of any
8968 integer type, or a vector with integer elements. The return type must
8969 match the argument type.
8974 The '``llvm.ctpop``' intrinsic counts the 1's in a variable, or within
8975 each element of a vector.
8977 '``llvm.ctlz.*``' Intrinsic
8978 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
8983 This is an overloaded intrinsic. You can use ``llvm.ctlz`` on any
8984 integer bit width, or any vector whose elements are integers. Not all
8985 targets support all bit widths or vector types, however.
8989 declare i8 @llvm.ctlz.i8 (i8 <src>, i1 <is_zero_undef>)
8990 declare i16 @llvm.ctlz.i16 (i16 <src>, i1 <is_zero_undef>)
8991 declare i32 @llvm.ctlz.i32 (i32 <src>, i1 <is_zero_undef>)
8992 declare i64 @llvm.ctlz.i64 (i64 <src>, i1 <is_zero_undef>)
8993 declare i256 @llvm.ctlz.i256(i256 <src>, i1 <is_zero_undef>)
8994 declase <2 x i32> @llvm.ctlz.v2i32(<2 x i32> <src>, i1 <is_zero_undef>)
8999 The '``llvm.ctlz``' family of intrinsic functions counts the number of
9000 leading zeros in a variable.
9005 The first argument is the value to be counted. This argument may be of
9006 any integer type, or a vector with integer element type. The return
9007 type must match the first argument type.
9009 The second argument must be a constant and is a flag to indicate whether
9010 the intrinsic should ensure that a zero as the first argument produces a
9011 defined result. Historically some architectures did not provide a
9012 defined result for zero values as efficiently, and many algorithms are
9013 now predicated on avoiding zero-value inputs.
9018 The '``llvm.ctlz``' intrinsic counts the leading (most significant)
9019 zeros in a variable, or within each element of the vector. If
9020 ``src == 0`` then the result is the size in bits of the type of ``src``
9021 if ``is_zero_undef == 0`` and ``undef`` otherwise. For example,
9022 ``llvm.ctlz(i32 2) = 30``.
9024 '``llvm.cttz.*``' Intrinsic
9025 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
9030 This is an overloaded intrinsic. You can use ``llvm.cttz`` on any
9031 integer bit width, or any vector of integer elements. Not all targets
9032 support all bit widths or vector types, however.
9036 declare i8 @llvm.cttz.i8 (i8 <src>, i1 <is_zero_undef>)
9037 declare i16 @llvm.cttz.i16 (i16 <src>, i1 <is_zero_undef>)
9038 declare i32 @llvm.cttz.i32 (i32 <src>, i1 <is_zero_undef>)
9039 declare i64 @llvm.cttz.i64 (i64 <src>, i1 <is_zero_undef>)
9040 declare i256 @llvm.cttz.i256(i256 <src>, i1 <is_zero_undef>)
9041 declase <2 x i32> @llvm.cttz.v2i32(<2 x i32> <src>, i1 <is_zero_undef>)
9046 The '``llvm.cttz``' family of intrinsic functions counts the number of
9052 The first argument is the value to be counted. This argument may be of
9053 any integer type, or a vector with integer element type. The return
9054 type must match the first argument type.
9056 The second argument must be a constant and is a flag to indicate whether
9057 the intrinsic should ensure that a zero as the first argument produces a
9058 defined result. Historically some architectures did not provide a
9059 defined result for zero values as efficiently, and many algorithms are
9060 now predicated on avoiding zero-value inputs.
9065 The '``llvm.cttz``' intrinsic counts the trailing (least significant)
9066 zeros in a variable, or within each element of a vector. If ``src == 0``
9067 then the result is the size in bits of the type of ``src`` if
9068 ``is_zero_undef == 0`` and ``undef`` otherwise. For example,
9069 ``llvm.cttz(2) = 1``.
9073 Arithmetic with Overflow Intrinsics
9074 -----------------------------------
9076 LLVM provides intrinsics for some arithmetic with overflow operations.
9078 '``llvm.sadd.with.overflow.*``' Intrinsics
9079 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9084 This is an overloaded intrinsic. You can use ``llvm.sadd.with.overflow``
9085 on any integer bit width.
9089 declare {i16, i1} @llvm.sadd.with.overflow.i16(i16 %a, i16 %b)
9090 declare {i32, i1} @llvm.sadd.with.overflow.i32(i32 %a, i32 %b)
9091 declare {i64, i1} @llvm.sadd.with.overflow.i64(i64 %a, i64 %b)
9096 The '``llvm.sadd.with.overflow``' family of intrinsic functions perform
9097 a signed addition of the two arguments, and indicate whether an overflow
9098 occurred during the signed summation.
9103 The arguments (%a and %b) and the first element of the result structure
9104 may be of integer types of any bit width, but they must have the same
9105 bit width. The second element of the result structure must be of type
9106 ``i1``. ``%a`` and ``%b`` are the two values that will undergo signed
9112 The '``llvm.sadd.with.overflow``' family of intrinsic functions perform
9113 a signed addition of the two variables. They return a structure --- the
9114 first element of which is the signed summation, and the second element
9115 of which is a bit specifying if the signed summation resulted in an
9121 .. code-block:: llvm
9123 %res = call {i32, i1} @llvm.sadd.with.overflow.i32(i32 %a, i32 %b)
9124 %sum = extractvalue {i32, i1} %res, 0
9125 %obit = extractvalue {i32, i1} %res, 1
9126 br i1 %obit, label %overflow, label %normal
9128 '``llvm.uadd.with.overflow.*``' Intrinsics
9129 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9134 This is an overloaded intrinsic. You can use ``llvm.uadd.with.overflow``
9135 on any integer bit width.
9139 declare {i16, i1} @llvm.uadd.with.overflow.i16(i16 %a, i16 %b)
9140 declare {i32, i1} @llvm.uadd.with.overflow.i32(i32 %a, i32 %b)
9141 declare {i64, i1} @llvm.uadd.with.overflow.i64(i64 %a, i64 %b)
9146 The '``llvm.uadd.with.overflow``' family of intrinsic functions perform
9147 an unsigned addition of the two arguments, and indicate whether a carry
9148 occurred during the unsigned summation.
9153 The arguments (%a and %b) and the first element of the result structure
9154 may be of integer types of any bit width, but they must have the same
9155 bit width. The second element of the result structure must be of type
9156 ``i1``. ``%a`` and ``%b`` are the two values that will undergo unsigned
9162 The '``llvm.uadd.with.overflow``' family of intrinsic functions perform
9163 an unsigned addition of the two arguments. They return a structure --- the
9164 first element of which is the sum, and the second element of which is a
9165 bit specifying if the unsigned summation resulted in a carry.
9170 .. code-block:: llvm
9172 %res = call {i32, i1} @llvm.uadd.with.overflow.i32(i32 %a, i32 %b)
9173 %sum = extractvalue {i32, i1} %res, 0
9174 %obit = extractvalue {i32, i1} %res, 1
9175 br i1 %obit, label %carry, label %normal
9177 '``llvm.ssub.with.overflow.*``' Intrinsics
9178 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9183 This is an overloaded intrinsic. You can use ``llvm.ssub.with.overflow``
9184 on any integer bit width.
9188 declare {i16, i1} @llvm.ssub.with.overflow.i16(i16 %a, i16 %b)
9189 declare {i32, i1} @llvm.ssub.with.overflow.i32(i32 %a, i32 %b)
9190 declare {i64, i1} @llvm.ssub.with.overflow.i64(i64 %a, i64 %b)
9195 The '``llvm.ssub.with.overflow``' family of intrinsic functions perform
9196 a signed subtraction of the two arguments, and indicate whether an
9197 overflow occurred during the signed subtraction.
9202 The arguments (%a and %b) and the first element of the result structure
9203 may be of integer types of any bit width, but they must have the same
9204 bit width. The second element of the result structure must be of type
9205 ``i1``. ``%a`` and ``%b`` are the two values that will undergo signed
9211 The '``llvm.ssub.with.overflow``' family of intrinsic functions perform
9212 a signed subtraction of the two arguments. They return a structure --- the
9213 first element of which is the subtraction, and the second element of
9214 which is a bit specifying if the signed subtraction resulted in an
9220 .. code-block:: llvm
9222 %res = call {i32, i1} @llvm.ssub.with.overflow.i32(i32 %a, i32 %b)
9223 %sum = extractvalue {i32, i1} %res, 0
9224 %obit = extractvalue {i32, i1} %res, 1
9225 br i1 %obit, label %overflow, label %normal
9227 '``llvm.usub.with.overflow.*``' Intrinsics
9228 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9233 This is an overloaded intrinsic. You can use ``llvm.usub.with.overflow``
9234 on any integer bit width.
9238 declare {i16, i1} @llvm.usub.with.overflow.i16(i16 %a, i16 %b)
9239 declare {i32, i1} @llvm.usub.with.overflow.i32(i32 %a, i32 %b)
9240 declare {i64, i1} @llvm.usub.with.overflow.i64(i64 %a, i64 %b)
9245 The '``llvm.usub.with.overflow``' family of intrinsic functions perform
9246 an unsigned subtraction of the two arguments, and indicate whether an
9247 overflow occurred during the unsigned subtraction.
9252 The arguments (%a and %b) and the first element of the result structure
9253 may be of integer types of any bit width, but they must have the same
9254 bit width. The second element of the result structure must be of type
9255 ``i1``. ``%a`` and ``%b`` are the two values that will undergo unsigned
9261 The '``llvm.usub.with.overflow``' family of intrinsic functions perform
9262 an unsigned subtraction of the two arguments. They return a structure ---
9263 the first element of which is the subtraction, and the second element of
9264 which is a bit specifying if the unsigned subtraction resulted in an
9270 .. code-block:: llvm
9272 %res = call {i32, i1} @llvm.usub.with.overflow.i32(i32 %a, i32 %b)
9273 %sum = extractvalue {i32, i1} %res, 0
9274 %obit = extractvalue {i32, i1} %res, 1
9275 br i1 %obit, label %overflow, label %normal
9277 '``llvm.smul.with.overflow.*``' Intrinsics
9278 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9283 This is an overloaded intrinsic. You can use ``llvm.smul.with.overflow``
9284 on any integer bit width.
9288 declare {i16, i1} @llvm.smul.with.overflow.i16(i16 %a, i16 %b)
9289 declare {i32, i1} @llvm.smul.with.overflow.i32(i32 %a, i32 %b)
9290 declare {i64, i1} @llvm.smul.with.overflow.i64(i64 %a, i64 %b)
9295 The '``llvm.smul.with.overflow``' family of intrinsic functions perform
9296 a signed multiplication of the two arguments, and indicate whether an
9297 overflow occurred during the signed multiplication.
9302 The arguments (%a and %b) and the first element of the result structure
9303 may be of integer types of any bit width, but they must have the same
9304 bit width. The second element of the result structure must be of type
9305 ``i1``. ``%a`` and ``%b`` are the two values that will undergo signed
9311 The '``llvm.smul.with.overflow``' family of intrinsic functions perform
9312 a signed multiplication of the two arguments. They return a structure ---
9313 the first element of which is the multiplication, and the second element
9314 of which is a bit specifying if the signed multiplication resulted in an
9320 .. code-block:: llvm
9322 %res = call {i32, i1} @llvm.smul.with.overflow.i32(i32 %a, i32 %b)
9323 %sum = extractvalue {i32, i1} %res, 0
9324 %obit = extractvalue {i32, i1} %res, 1
9325 br i1 %obit, label %overflow, label %normal
9327 '``llvm.umul.with.overflow.*``' Intrinsics
9328 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9333 This is an overloaded intrinsic. You can use ``llvm.umul.with.overflow``
9334 on any integer bit width.
9338 declare {i16, i1} @llvm.umul.with.overflow.i16(i16 %a, i16 %b)
9339 declare {i32, i1} @llvm.umul.with.overflow.i32(i32 %a, i32 %b)
9340 declare {i64, i1} @llvm.umul.with.overflow.i64(i64 %a, i64 %b)
9345 The '``llvm.umul.with.overflow``' family of intrinsic functions perform
9346 a unsigned multiplication of the two arguments, and indicate whether an
9347 overflow occurred during the unsigned multiplication.
9352 The arguments (%a and %b) and the first element of the result structure
9353 may be of integer types of any bit width, but they must have the same
9354 bit width. The second element of the result structure must be of type
9355 ``i1``. ``%a`` and ``%b`` are the two values that will undergo unsigned
9361 The '``llvm.umul.with.overflow``' family of intrinsic functions perform
9362 an unsigned multiplication of the two arguments. They return a structure ---
9363 the first element of which is the multiplication, and the second
9364 element of which is a bit specifying if the unsigned multiplication
9365 resulted in an overflow.
9370 .. code-block:: llvm
9372 %res = call {i32, i1} @llvm.umul.with.overflow.i32(i32 %a, i32 %b)
9373 %sum = extractvalue {i32, i1} %res, 0
9374 %obit = extractvalue {i32, i1} %res, 1
9375 br i1 %obit, label %overflow, label %normal
9377 Specialised Arithmetic Intrinsics
9378 ---------------------------------
9380 '``llvm.fmuladd.*``' Intrinsic
9381 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9388 declare float @llvm.fmuladd.f32(float %a, float %b, float %c)
9389 declare double @llvm.fmuladd.f64(double %a, double %b, double %c)
9394 The '``llvm.fmuladd.*``' intrinsic functions represent multiply-add
9395 expressions that can be fused if the code generator determines that (a) the
9396 target instruction set has support for a fused operation, and (b) that the
9397 fused operation is more efficient than the equivalent, separate pair of mul
9398 and add instructions.
9403 The '``llvm.fmuladd.*``' intrinsics each take three arguments: two
9404 multiplicands, a and b, and an addend c.
9413 %0 = call float @llvm.fmuladd.f32(%a, %b, %c)
9415 is equivalent to the expression a \* b + c, except that rounding will
9416 not be performed between the multiplication and addition steps if the
9417 code generator fuses the operations. Fusion is not guaranteed, even if
9418 the target platform supports it. If a fused multiply-add is required the
9419 corresponding llvm.fma.\* intrinsic function should be used
9420 instead. This never sets errno, just as '``llvm.fma.*``'.
9425 .. code-block:: llvm
9427 %r2 = call float @llvm.fmuladd.f32(float %a, float %b, float %c) ; yields float:r2 = (a * b) + c
9429 Half Precision Floating Point Intrinsics
9430 ----------------------------------------
9432 For most target platforms, half precision floating point is a
9433 storage-only format. This means that it is a dense encoding (in memory)
9434 but does not support computation in the format.
9436 This means that code must first load the half-precision floating point
9437 value as an i16, then convert it to float with
9438 :ref:`llvm.convert.from.fp16 <int_convert_from_fp16>`. Computation can
9439 then be performed on the float value (including extending to double
9440 etc). To store the value back to memory, it is first converted to float
9441 if needed, then converted to i16 with
9442 :ref:`llvm.convert.to.fp16 <int_convert_to_fp16>`, then storing as an
9445 .. _int_convert_to_fp16:
9447 '``llvm.convert.to.fp16``' Intrinsic
9448 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9455 declare i16 @llvm.convert.to.fp16.f32(float %a)
9456 declare i16 @llvm.convert.to.fp16.f64(double %a)
9461 The '``llvm.convert.to.fp16``' intrinsic function performs a conversion from a
9462 conventional floating point type to half precision floating point format.
9467 The intrinsic function contains single argument - the value to be
9473 The '``llvm.convert.to.fp16``' intrinsic function performs a conversion from a
9474 conventional floating point format to half precision floating point format. The
9475 return value is an ``i16`` which contains the converted number.
9480 .. code-block:: llvm
9482 %res = call i16 @llvm.convert.to.fp16.f32(float %a)
9483 store i16 %res, i16* @x, align 2
9485 .. _int_convert_from_fp16:
9487 '``llvm.convert.from.fp16``' Intrinsic
9488 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9495 declare float @llvm.convert.from.fp16.f32(i16 %a)
9496 declare double @llvm.convert.from.fp16.f64(i16 %a)
9501 The '``llvm.convert.from.fp16``' intrinsic function performs a
9502 conversion from half precision floating point format to single precision
9503 floating point format.
9508 The intrinsic function contains single argument - the value to be
9514 The '``llvm.convert.from.fp16``' intrinsic function performs a
9515 conversion from half single precision floating point format to single
9516 precision floating point format. The input half-float value is
9517 represented by an ``i16`` value.
9522 .. code-block:: llvm
9524 %a = load i16, i16* @x, align 2
9525 %res = call float @llvm.convert.from.fp16(i16 %a)
9532 The LLVM debugger intrinsics (which all start with ``llvm.dbg.``
9533 prefix), are described in the `LLVM Source Level
9534 Debugging <SourceLevelDebugging.html#format_common_intrinsics>`_
9537 Exception Handling Intrinsics
9538 -----------------------------
9540 The LLVM exception handling intrinsics (which all start with
9541 ``llvm.eh.`` prefix), are described in the `LLVM Exception
9542 Handling <ExceptionHandling.html#format_common_intrinsics>`_ document.
9546 Trampoline Intrinsics
9547 ---------------------
9549 These intrinsics make it possible to excise one parameter, marked with
9550 the :ref:`nest <nest>` attribute, from a function. The result is a
9551 callable function pointer lacking the nest parameter - the caller does
9552 not need to provide a value for it. Instead, the value to use is stored
9553 in advance in a "trampoline", a block of memory usually allocated on the
9554 stack, which also contains code to splice the nest value into the
9555 argument list. This is used to implement the GCC nested function address
9558 For example, if the function is ``i32 f(i8* nest %c, i32 %x, i32 %y)``
9559 then the resulting function pointer has signature ``i32 (i32, i32)*``.
9560 It can be created as follows:
9562 .. code-block:: llvm
9564 %tramp = alloca [10 x i8], align 4 ; size and alignment only correct for X86
9565 %tramp1 = getelementptr [10 x i8], [10 x i8]* %tramp, i32 0, i32 0
9566 call i8* @llvm.init.trampoline(i8* %tramp1, i8* bitcast (i32 (i8*, i32, i32)* @f to i8*), i8* %nval)
9567 %p = call i8* @llvm.adjust.trampoline(i8* %tramp1)
9568 %fp = bitcast i8* %p to i32 (i32, i32)*
9570 The call ``%val = call i32 %fp(i32 %x, i32 %y)`` is then equivalent to
9571 ``%val = call i32 %f(i8* %nval, i32 %x, i32 %y)``.
9575 '``llvm.init.trampoline``' Intrinsic
9576 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9583 declare void @llvm.init.trampoline(i8* <tramp>, i8* <func>, i8* <nval>)
9588 This fills the memory pointed to by ``tramp`` with executable code,
9589 turning it into a trampoline.
9594 The ``llvm.init.trampoline`` intrinsic takes three arguments, all
9595 pointers. The ``tramp`` argument must point to a sufficiently large and
9596 sufficiently aligned block of memory; this memory is written to by the
9597 intrinsic. Note that the size and the alignment are target-specific -
9598 LLVM currently provides no portable way of determining them, so a
9599 front-end that generates this intrinsic needs to have some
9600 target-specific knowledge. The ``func`` argument must hold a function
9601 bitcast to an ``i8*``.
9606 The block of memory pointed to by ``tramp`` is filled with target
9607 dependent code, turning it into a function. Then ``tramp`` needs to be
9608 passed to :ref:`llvm.adjust.trampoline <int_at>` to get a pointer which can
9609 be :ref:`bitcast (to a new function) and called <int_trampoline>`. The new
9610 function's signature is the same as that of ``func`` with any arguments
9611 marked with the ``nest`` attribute removed. At most one such ``nest``
9612 argument is allowed, and it must be of pointer type. Calling the new
9613 function is equivalent to calling ``func`` with the same argument list,
9614 but with ``nval`` used for the missing ``nest`` argument. If, after
9615 calling ``llvm.init.trampoline``, the memory pointed to by ``tramp`` is
9616 modified, then the effect of any later call to the returned function
9617 pointer is undefined.
9621 '``llvm.adjust.trampoline``' Intrinsic
9622 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9629 declare i8* @llvm.adjust.trampoline(i8* <tramp>)
9634 This performs any required machine-specific adjustment to the address of
9635 a trampoline (passed as ``tramp``).
9640 ``tramp`` must point to a block of memory which already has trampoline
9641 code filled in by a previous call to
9642 :ref:`llvm.init.trampoline <int_it>`.
9647 On some architectures the address of the code to be executed needs to be
9648 different than the address where the trampoline is actually stored. This
9649 intrinsic returns the executable address corresponding to ``tramp``
9650 after performing the required machine specific adjustments. The pointer
9651 returned can then be :ref:`bitcast and executed <int_trampoline>`.
9653 Masked Vector Load and Store Intrinsics
9654 ---------------------------------------
9656 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.
9660 '``llvm.masked.load.*``' Intrinsics
9661 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9665 This is an overloaded intrinsic. The loaded data is a vector of any integer or floating point data type.
9669 declare <16 x float> @llvm.masked.load.v16f32 (<16 x float>* <ptr>, i32 <alignment>, <16 x i1> <mask>, <16 x float> <passthru>)
9670 declare <2 x double> @llvm.masked.load.v2f64 (<2 x double>* <ptr>, i32 <alignment>, <2 x i1> <mask>, <2 x double> <passthru>)
9675 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.
9681 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.
9687 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.
9688 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.
9693 %res = call <16 x float> @llvm.masked.load.v16f32 (<16 x float>* %ptr, i32 4, <16 x i1>%mask, <16 x float> %passthru)
9695 ;; The result of the two following instructions is identical aside from potential memory access exception
9696 %loadlal = load <16 x float>, <16 x float>* %ptr, align 4
9697 %res = select <16 x i1> %mask, <16 x float> %loadlal, <16 x float> %passthru
9701 '``llvm.masked.store.*``' Intrinsics
9702 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9706 This is an overloaded intrinsic. The data stored in memory is a vector of any integer or floating point data type.
9710 declare void @llvm.masked.store.v8i32 (<8 x i32> <value>, <8 x i32> * <ptr>, i32 <alignment>, <8 x i1> <mask>)
9711 declare void @llvm.masked.store.v16f32(<16 x i32> <value>, <16 x i32>* <ptr>, i32 <alignment>, <16 x i1> <mask>)
9716 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.
9721 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.
9727 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.
9728 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.
9732 call void @llvm.masked.store.v16f32(<16 x float> %value, <16 x float>* %ptr, i32 4, <16 x i1> %mask)
9734 ;; The result of the following instructions is identical aside from potential data races and memory access exceptions
9735 %oldval = load <16 x float>, <16 x float>* %ptr, align 4
9736 %res = select <16 x i1> %mask, <16 x float> %value, <16 x float> %oldval
9737 store <16 x float> %res, <16 x float>* %ptr, align 4
9743 This class of intrinsics provides information about the lifetime of
9744 memory objects and ranges where variables are immutable.
9748 '``llvm.lifetime.start``' Intrinsic
9749 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9756 declare void @llvm.lifetime.start(i64 <size>, i8* nocapture <ptr>)
9761 The '``llvm.lifetime.start``' intrinsic specifies the start of a memory
9767 The first argument is a constant integer representing the size of the
9768 object, or -1 if it is variable sized. The second argument is a pointer
9774 This intrinsic indicates that before this point in the code, the value
9775 of the memory pointed to by ``ptr`` is dead. This means that it is known
9776 to never be used and has an undefined value. A load from the pointer
9777 that precedes this intrinsic can be replaced with ``'undef'``.
9781 '``llvm.lifetime.end``' Intrinsic
9782 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9789 declare void @llvm.lifetime.end(i64 <size>, i8* nocapture <ptr>)
9794 The '``llvm.lifetime.end``' intrinsic specifies the end of a memory
9800 The first argument is a constant integer representing the size of the
9801 object, or -1 if it is variable sized. The second argument is a pointer
9807 This intrinsic indicates that after this point in the code, the value of
9808 the memory pointed to by ``ptr`` is dead. This means that it is known to
9809 never be used and has an undefined value. Any stores into the memory
9810 object following this intrinsic may be removed as dead.
9812 '``llvm.invariant.start``' Intrinsic
9813 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9820 declare {}* @llvm.invariant.start(i64 <size>, i8* nocapture <ptr>)
9825 The '``llvm.invariant.start``' intrinsic specifies that the contents of
9826 a memory object will not change.
9831 The first argument is a constant integer representing the size of the
9832 object, or -1 if it is variable sized. The second argument is a pointer
9838 This intrinsic indicates that until an ``llvm.invariant.end`` that uses
9839 the return value, the referenced memory location is constant and
9842 '``llvm.invariant.end``' Intrinsic
9843 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9850 declare void @llvm.invariant.end({}* <start>, i64 <size>, i8* nocapture <ptr>)
9855 The '``llvm.invariant.end``' intrinsic specifies that the contents of a
9856 memory object are mutable.
9861 The first argument is the matching ``llvm.invariant.start`` intrinsic.
9862 The second argument is a constant integer representing the size of the
9863 object, or -1 if it is variable sized and the third argument is a
9864 pointer to the object.
9869 This intrinsic indicates that the memory is mutable again.
9874 This class of intrinsics is designed to be generic and has no specific
9877 '``llvm.var.annotation``' Intrinsic
9878 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9885 declare void @llvm.var.annotation(i8* <val>, i8* <str>, i8* <str>, i32 <int>)
9890 The '``llvm.var.annotation``' intrinsic.
9895 The first argument is a pointer to a value, the second is a pointer to a
9896 global string, the third is a pointer to a global string which is the
9897 source file name, and the last argument is the line number.
9902 This intrinsic allows annotation of local variables with arbitrary
9903 strings. This can be useful for special purpose optimizations that want
9904 to look for these annotations. These have no other defined use; they are
9905 ignored by code generation and optimization.
9907 '``llvm.ptr.annotation.*``' Intrinsic
9908 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9913 This is an overloaded intrinsic. You can use '``llvm.ptr.annotation``' on a
9914 pointer to an integer of any width. *NOTE* you must specify an address space for
9915 the pointer. The identifier for the default address space is the integer
9920 declare i8* @llvm.ptr.annotation.p<address space>i8(i8* <val>, i8* <str>, i8* <str>, i32 <int>)
9921 declare i16* @llvm.ptr.annotation.p<address space>i16(i16* <val>, i8* <str>, i8* <str>, i32 <int>)
9922 declare i32* @llvm.ptr.annotation.p<address space>i32(i32* <val>, i8* <str>, i8* <str>, i32 <int>)
9923 declare i64* @llvm.ptr.annotation.p<address space>i64(i64* <val>, i8* <str>, i8* <str>, i32 <int>)
9924 declare i256* @llvm.ptr.annotation.p<address space>i256(i256* <val>, i8* <str>, i8* <str>, i32 <int>)
9929 The '``llvm.ptr.annotation``' intrinsic.
9934 The first argument is a pointer to an integer value of arbitrary bitwidth
9935 (result of some expression), the second is a pointer to a global string, the
9936 third is a pointer to a global string which is the source file name, and the
9937 last argument is the line number. It returns the value of the first argument.
9942 This intrinsic allows annotation of a pointer to an integer with arbitrary
9943 strings. This can be useful for special purpose optimizations that want to look
9944 for these annotations. These have no other defined use; they are ignored by code
9945 generation and optimization.
9947 '``llvm.annotation.*``' Intrinsic
9948 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9953 This is an overloaded intrinsic. You can use '``llvm.annotation``' on
9954 any integer bit width.
9958 declare i8 @llvm.annotation.i8(i8 <val>, i8* <str>, i8* <str>, i32 <int>)
9959 declare i16 @llvm.annotation.i16(i16 <val>, i8* <str>, i8* <str>, i32 <int>)
9960 declare i32 @llvm.annotation.i32(i32 <val>, i8* <str>, i8* <str>, i32 <int>)
9961 declare i64 @llvm.annotation.i64(i64 <val>, i8* <str>, i8* <str>, i32 <int>)
9962 declare i256 @llvm.annotation.i256(i256 <val>, i8* <str>, i8* <str>, i32 <int>)
9967 The '``llvm.annotation``' intrinsic.
9972 The first argument is an integer value (result of some expression), the
9973 second is a pointer to a global string, the third is a pointer to a
9974 global string which is the source file name, and the last argument is
9975 the line number. It returns the value of the first argument.
9980 This intrinsic allows annotations to be put on arbitrary expressions
9981 with arbitrary strings. This can be useful for special purpose
9982 optimizations that want to look for these annotations. These have no
9983 other defined use; they are ignored by code generation and optimization.
9985 '``llvm.trap``' Intrinsic
9986 ^^^^^^^^^^^^^^^^^^^^^^^^^
9993 declare void @llvm.trap() noreturn nounwind
9998 The '``llvm.trap``' intrinsic.
10008 This intrinsic is lowered to the target dependent trap instruction. If
10009 the target does not have a trap instruction, this intrinsic will be
10010 lowered to a call of the ``abort()`` function.
10012 '``llvm.debugtrap``' Intrinsic
10013 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
10020 declare void @llvm.debugtrap() nounwind
10025 The '``llvm.debugtrap``' intrinsic.
10035 This intrinsic is lowered to code which is intended to cause an
10036 execution trap with the intention of requesting the attention of a
10039 '``llvm.stackprotector``' Intrinsic
10040 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
10047 declare void @llvm.stackprotector(i8* <guard>, i8** <slot>)
10052 The ``llvm.stackprotector`` intrinsic takes the ``guard`` and stores it
10053 onto the stack at ``slot``. The stack slot is adjusted to ensure that it
10054 is placed on the stack before local variables.
10059 The ``llvm.stackprotector`` intrinsic requires two pointer arguments.
10060 The first argument is the value loaded from the stack guard
10061 ``@__stack_chk_guard``. The second variable is an ``alloca`` that has
10062 enough space to hold the value of the guard.
10067 This intrinsic causes the prologue/epilogue inserter to force the position of
10068 the ``AllocaInst`` stack slot to be before local variables on the stack. This is
10069 to ensure that if a local variable on the stack is overwritten, it will destroy
10070 the value of the guard. When the function exits, the guard on the stack is
10071 checked against the original guard by ``llvm.stackprotectorcheck``. If they are
10072 different, then ``llvm.stackprotectorcheck`` causes the program to abort by
10073 calling the ``__stack_chk_fail()`` function.
10075 '``llvm.stackprotectorcheck``' Intrinsic
10076 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
10083 declare void @llvm.stackprotectorcheck(i8** <guard>)
10088 The ``llvm.stackprotectorcheck`` intrinsic compares ``guard`` against an already
10089 created stack protector and if they are not equal calls the
10090 ``__stack_chk_fail()`` function.
10095 The ``llvm.stackprotectorcheck`` intrinsic requires one pointer argument, the
10096 the variable ``@__stack_chk_guard``.
10101 This intrinsic is provided to perform the stack protector check by comparing
10102 ``guard`` with the stack slot created by ``llvm.stackprotector`` and if the
10103 values do not match call the ``__stack_chk_fail()`` function.
10105 The reason to provide this as an IR level intrinsic instead of implementing it
10106 via other IR operations is that in order to perform this operation at the IR
10107 level without an intrinsic, one would need to create additional basic blocks to
10108 handle the success/failure cases. This makes it difficult to stop the stack
10109 protector check from disrupting sibling tail calls in Codegen. With this
10110 intrinsic, we are able to generate the stack protector basic blocks late in
10111 codegen after the tail call decision has occurred.
10113 '``llvm.objectsize``' Intrinsic
10114 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
10121 declare i32 @llvm.objectsize.i32(i8* <object>, i1 <min>)
10122 declare i64 @llvm.objectsize.i64(i8* <object>, i1 <min>)
10127 The ``llvm.objectsize`` intrinsic is designed to provide information to
10128 the optimizers to determine at compile time whether a) an operation
10129 (like memcpy) will overflow a buffer that corresponds to an object, or
10130 b) that a runtime check for overflow isn't necessary. An object in this
10131 context means an allocation of a specific class, structure, array, or
10137 The ``llvm.objectsize`` intrinsic takes two arguments. The first
10138 argument is a pointer to or into the ``object``. The second argument is
10139 a boolean and determines whether ``llvm.objectsize`` returns 0 (if true)
10140 or -1 (if false) when the object size is unknown. The second argument
10141 only accepts constants.
10146 The ``llvm.objectsize`` intrinsic is lowered to a constant representing
10147 the size of the object concerned. If the size cannot be determined at
10148 compile time, ``llvm.objectsize`` returns ``i32/i64 -1 or 0`` (depending
10149 on the ``min`` argument).
10151 '``llvm.expect``' Intrinsic
10152 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
10157 This is an overloaded intrinsic. You can use ``llvm.expect`` on any
10162 declare i1 @llvm.expect.i1(i1 <val>, i1 <expected_val>)
10163 declare i32 @llvm.expect.i32(i32 <val>, i32 <expected_val>)
10164 declare i64 @llvm.expect.i64(i64 <val>, i64 <expected_val>)
10169 The ``llvm.expect`` intrinsic provides information about expected (the
10170 most probable) value of ``val``, which can be used by optimizers.
10175 The ``llvm.expect`` intrinsic takes two arguments. The first argument is
10176 a value. The second argument is an expected value, this needs to be a
10177 constant value, variables are not allowed.
10182 This intrinsic is lowered to the ``val``.
10184 '``llvm.assume``' Intrinsic
10185 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
10192 declare void @llvm.assume(i1 %cond)
10197 The ``llvm.assume`` allows the optimizer to assume that the provided
10198 condition is true. This information can then be used in simplifying other parts
10204 The condition which the optimizer may assume is always true.
10209 The intrinsic allows the optimizer to assume that the provided condition is
10210 always true whenever the control flow reaches the intrinsic call. No code is
10211 generated for this intrinsic, and instructions that contribute only to the
10212 provided condition are not used for code generation. If the condition is
10213 violated during execution, the behavior is undefined.
10215 Note that the optimizer might limit the transformations performed on values
10216 used by the ``llvm.assume`` intrinsic in order to preserve the instructions
10217 only used to form the intrinsic's input argument. This might prove undesirable
10218 if the extra information provided by the ``llvm.assume`` intrinsic does not cause
10219 sufficient overall improvement in code quality. For this reason,
10220 ``llvm.assume`` should not be used to document basic mathematical invariants
10221 that the optimizer can otherwise deduce or facts that are of little use to the
10226 '``llvm.bitset.test``' Intrinsic
10227 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
10234 declare i1 @llvm.bitset.test(i8* %ptr, metadata %bitset) nounwind readnone
10240 The first argument is a pointer to be tested. The second argument is a
10241 metadata string containing the name of a :doc:`bitset <BitSets>`.
10246 The ``llvm.bitset.test`` intrinsic tests whether the given pointer is a
10247 member of the given bitset.
10249 '``llvm.donothing``' Intrinsic
10250 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
10257 declare void @llvm.donothing() nounwind readnone
10262 The ``llvm.donothing`` intrinsic doesn't perform any operation. It's one of only
10263 two intrinsics (besides ``llvm.experimental.patchpoint``) that can be called
10264 with an invoke instruction.
10274 This intrinsic does nothing, and it's removed by optimizers and ignored
10277 Stack Map Intrinsics
10278 --------------------
10280 LLVM provides experimental intrinsics to support runtime patching
10281 mechanisms commonly desired in dynamic language JITs. These intrinsics
10282 are described in :doc:`StackMaps`.