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 dynamically
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
357 unintrusive as possible. This convention behaves identically 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 an alias, but then it only governs how
495 the alias is accessed. It will not have any effect in the aliasee.
497 For platforms without linker support of ELF TLS model, the -femulated-tls
498 flag can be used to generate GCC compatible emulated TLS code.
505 LLVM IR allows you to specify both "identified" and "literal" :ref:`structure
506 types <t_struct>`. Literal types are uniqued structurally, but identified types
507 are never uniqued. An :ref:`opaque structural type <t_opaque>` can also be used
508 to forward declare a type that is not yet available.
510 An example of an identified structure specification is:
514 %mytype = type { %mytype*, i32 }
516 Prior to the LLVM 3.0 release, identified types were structurally uniqued. Only
517 literal types are uniqued in recent versions of LLVM.
524 Global variables define regions of memory allocated at compilation time
527 Global variable definitions must be initialized.
529 Global variables in other translation units can also be declared, in which
530 case they don't have an initializer.
532 Either global variable definitions or declarations may have an explicit section
533 to be placed in and may have an optional explicit alignment specified.
535 A variable may be defined as a global ``constant``, which indicates that
536 the contents of the variable will **never** be modified (enabling better
537 optimization, allowing the global data to be placed in the read-only
538 section of an executable, etc). Note that variables that need runtime
539 initialization cannot be marked ``constant`` as there is a store to the
542 LLVM explicitly allows *declarations* of global variables to be marked
543 constant, even if the final definition of the global is not. This
544 capability can be used to enable slightly better optimization of the
545 program, but requires the language definition to guarantee that
546 optimizations based on the 'constantness' are valid for the translation
547 units that do not include the definition.
549 As SSA values, global variables define pointer values that are in scope
550 (i.e. they dominate) all basic blocks in the program. Global variables
551 always define a pointer to their "content" type because they describe a
552 region of memory, and all memory objects in LLVM are accessed through
555 Global variables can be marked with ``unnamed_addr`` which indicates
556 that the address is not significant, only the content. Constants marked
557 like this can be merged with other constants if they have the same
558 initializer. Note that a constant with significant address *can* be
559 merged with a ``unnamed_addr`` constant, the result being a constant
560 whose address is significant.
562 A global variable may be declared to reside in a target-specific
563 numbered address space. For targets that support them, address spaces
564 may affect how optimizations are performed and/or what target
565 instructions are used to access the variable. The default address space
566 is zero. The address space qualifier must precede any other attributes.
568 LLVM allows an explicit section to be specified for globals. If the
569 target supports it, it will emit globals to the section specified.
570 Additionally, the global can placed in a comdat if the target has the necessary
573 By default, global initializers are optimized by assuming that global
574 variables defined within the module are not modified from their
575 initial values before the start of the global initializer. This is
576 true even for variables potentially accessible from outside the
577 module, including those with external linkage or appearing in
578 ``@llvm.used`` or dllexported variables. This assumption may be suppressed
579 by marking the variable with ``externally_initialized``.
581 An explicit alignment may be specified for a global, which must be a
582 power of 2. If not present, or if the alignment is set to zero, the
583 alignment of the global is set by the target to whatever it feels
584 convenient. If an explicit alignment is specified, the global is forced
585 to have exactly that alignment. Targets and optimizers are not allowed
586 to over-align the global if the global has an assigned section. In this
587 case, the extra alignment could be observable: for example, code could
588 assume that the globals are densely packed in their section and try to
589 iterate over them as an array, alignment padding would break this
590 iteration. The maximum alignment is ``1 << 29``.
592 Globals can also have a :ref:`DLL storage class <dllstorageclass>`.
594 Variables and aliases can have a
595 :ref:`Thread Local Storage Model <tls_model>`.
599 [@<GlobalVarName> =] [Linkage] [Visibility] [DLLStorageClass] [ThreadLocal]
600 [unnamed_addr] [AddrSpace] [ExternallyInitialized]
601 <global | constant> <Type> [<InitializerConstant>]
602 [, section "name"] [, comdat [($name)]]
603 [, align <Alignment>]
605 For example, the following defines a global in a numbered address space
606 with an initializer, section, and alignment:
610 @G = addrspace(5) constant float 1.0, section "foo", align 4
612 The following example just declares a global variable
616 @G = external global i32
618 The following example defines a thread-local global with the
619 ``initialexec`` TLS model:
623 @G = thread_local(initialexec) global i32 0, align 4
625 .. _functionstructure:
630 LLVM function definitions consist of the "``define``" keyword, an
631 optional :ref:`linkage type <linkage>`, an optional :ref:`visibility
632 style <visibility>`, an optional :ref:`DLL storage class <dllstorageclass>`,
633 an optional :ref:`calling convention <callingconv>`,
634 an optional ``unnamed_addr`` attribute, a return type, an optional
635 :ref:`parameter attribute <paramattrs>` for the return type, a function
636 name, a (possibly empty) argument list (each with optional :ref:`parameter
637 attributes <paramattrs>`), optional :ref:`function attributes <fnattrs>`,
638 an optional section, an optional alignment,
639 an optional :ref:`comdat <langref_comdats>`,
640 an optional :ref:`garbage collector name <gc>`, an optional :ref:`prefix <prefixdata>`,
641 an optional :ref:`prologue <prologuedata>`,
642 an optional :ref:`personality <personalityfn>`,
643 an opening curly brace, a list of basic blocks, and a closing curly brace.
645 LLVM function declarations consist of the "``declare``" keyword, an
646 optional :ref:`linkage type <linkage>`, an optional :ref:`visibility
647 style <visibility>`, an optional :ref:`DLL storage class <dllstorageclass>`,
648 an optional :ref:`calling convention <callingconv>`,
649 an optional ``unnamed_addr`` attribute, a return type, an optional
650 :ref:`parameter attribute <paramattrs>` for the return type, a function
651 name, a possibly empty list of arguments, an optional alignment, an optional
652 :ref:`garbage collector name <gc>`, an optional :ref:`prefix <prefixdata>`,
653 and an optional :ref:`prologue <prologuedata>`.
655 A function definition contains a list of basic blocks, forming the CFG (Control
656 Flow Graph) for the function. Each basic block may optionally start with a label
657 (giving the basic block a symbol table entry), contains a list of instructions,
658 and ends with a :ref:`terminator <terminators>` instruction (such as a branch or
659 function return). If an explicit label is not provided, a block is assigned an
660 implicit numbered label, using the next value from the same counter as used for
661 unnamed temporaries (:ref:`see above<identifiers>`). For example, if a function
662 entry block does not have an explicit label, it will be assigned label "%0",
663 then the first unnamed temporary in that block will be "%1", etc.
665 The first basic block in a function is special in two ways: it is
666 immediately executed on entrance to the function, and it is not allowed
667 to have predecessor basic blocks (i.e. there can not be any branches to
668 the entry block of a function). Because the block can have no
669 predecessors, it also cannot have any :ref:`PHI nodes <i_phi>`.
671 LLVM allows an explicit section to be specified for functions. If the
672 target supports it, it will emit functions to the section specified.
673 Additionally, the function can be placed in a COMDAT.
675 An explicit alignment may be specified for a function. If not present,
676 or if the alignment is set to zero, the alignment of the function is set
677 by the target to whatever it feels convenient. If an explicit alignment
678 is specified, the function is forced to have at least that much
679 alignment. All alignments must be a power of 2.
681 If the ``unnamed_addr`` attribute is given, the address is known to not
682 be significant and two identical functions can be merged.
686 define [linkage] [visibility] [DLLStorageClass]
688 <ResultType> @<FunctionName> ([argument list])
689 [unnamed_addr] [fn Attrs] [section "name"] [comdat [($name)]]
690 [align N] [gc] [prefix Constant] [prologue Constant]
691 [personality Constant] { ... }
693 The argument list is a comma separated sequence of arguments where each
694 argument is of the following form:
698 <type> [parameter Attrs] [name]
706 Aliases, unlike function or variables, don't create any new data. They
707 are just a new symbol and metadata for an existing position.
709 Aliases have a name and an aliasee that is either a global value or a
712 Aliases may have an optional :ref:`linkage type <linkage>`, an optional
713 :ref:`visibility style <visibility>`, an optional :ref:`DLL storage class
714 <dllstorageclass>` and an optional :ref:`tls model <tls_model>`.
718 @<Name> = [Linkage] [Visibility] [DLLStorageClass] [ThreadLocal] [unnamed_addr] alias <AliaseeTy> @<Aliasee>
720 The linkage must be one of ``private``, ``internal``, ``linkonce``, ``weak``,
721 ``linkonce_odr``, ``weak_odr``, ``external``. Note that some system linkers
722 might not correctly handle dropping a weak symbol that is aliased.
724 Aliases that are not ``unnamed_addr`` are guaranteed to have the same address as
725 the aliasee expression. ``unnamed_addr`` ones are only guaranteed to point
728 Since aliases are only a second name, some restrictions apply, of which
729 some can only be checked when producing an object file:
731 * The expression defining the aliasee must be computable at assembly
732 time. Since it is just a name, no relocations can be used.
734 * No alias in the expression can be weak as the possibility of the
735 intermediate alias being overridden cannot be represented in an
738 * No global value in the expression can be a declaration, since that
739 would require a relocation, which is not possible.
746 Comdat IR provides access to COFF and ELF object file COMDAT functionality.
748 Comdats have a name which represents the COMDAT key. All global objects that
749 specify this key will only end up in the final object file if the linker chooses
750 that key over some other key. Aliases are placed in the same COMDAT that their
751 aliasee computes to, if any.
753 Comdats have a selection kind to provide input on how the linker should
754 choose between keys in two different object files.
758 $<Name> = comdat SelectionKind
760 The selection kind must be one of the following:
763 The linker may choose any COMDAT key, the choice is arbitrary.
765 The linker may choose any COMDAT key but the sections must contain the
768 The linker will choose the section containing the largest COMDAT key.
770 The linker requires that only section with this COMDAT key exist.
772 The linker may choose any COMDAT key but the sections must contain the
775 Note that the Mach-O platform doesn't support COMDATs and ELF only supports
776 ``any`` as a selection kind.
778 Here is an example of a COMDAT group where a function will only be selected if
779 the COMDAT key's section is the largest:
783 $foo = comdat largest
784 @foo = global i32 2, comdat($foo)
786 define void @bar() comdat($foo) {
790 As a syntactic sugar the ``$name`` can be omitted if the name is the same as
796 @foo = global i32 2, comdat
799 In a COFF object file, this will create a COMDAT section with selection kind
800 ``IMAGE_COMDAT_SELECT_LARGEST`` containing the contents of the ``@foo`` symbol
801 and another COMDAT section with selection kind
802 ``IMAGE_COMDAT_SELECT_ASSOCIATIVE`` which is associated with the first COMDAT
803 section and contains the contents of the ``@bar`` symbol.
805 There are some restrictions on the properties of the global object.
806 It, or an alias to it, must have the same name as the COMDAT group when
808 The contents and size of this object may be used during link-time to determine
809 which COMDAT groups get selected depending on the selection kind.
810 Because the name of the object must match the name of the COMDAT group, the
811 linkage of the global object must not be local; local symbols can get renamed
812 if a collision occurs in the symbol table.
814 The combined use of COMDATS and section attributes may yield surprising results.
821 @g1 = global i32 42, section "sec", comdat($foo)
822 @g2 = global i32 42, section "sec", comdat($bar)
824 From the object file perspective, this requires the creation of two sections
825 with the same name. This is necessary because both globals belong to different
826 COMDAT groups and COMDATs, at the object file level, are represented by
829 Note that certain IR constructs like global variables and functions may
830 create COMDATs in the object file in addition to any which are specified using
831 COMDAT IR. This arises when the code generator is configured to emit globals
832 in individual sections (e.g. when `-data-sections` or `-function-sections`
833 is supplied to `llc`).
835 .. _namedmetadatastructure:
840 Named metadata is a collection of metadata. :ref:`Metadata
841 nodes <metadata>` (but not metadata strings) are the only valid
842 operands for a named metadata.
844 #. Named metadata are represented as a string of characters with the
845 metadata prefix. The rules for metadata names are the same as for
846 identifiers, but quoted names are not allowed. ``"\xx"`` type escapes
847 are still valid, which allows any character to be part of a name.
851 ; Some unnamed metadata nodes, which are referenced by the named metadata.
856 !name = !{!0, !1, !2}
863 The return type and each parameter of a function type may have a set of
864 *parameter attributes* associated with them. Parameter attributes are
865 used to communicate additional information about the result or
866 parameters of a function. Parameter attributes are considered to be part
867 of the function, not of the function type, so functions with different
868 parameter attributes can have the same function type.
870 Parameter attributes are simple keywords that follow the type specified.
871 If multiple parameter attributes are needed, they are space separated.
876 declare i32 @printf(i8* noalias nocapture, ...)
877 declare i32 @atoi(i8 zeroext)
878 declare signext i8 @returns_signed_char()
880 Note that any attributes for the function result (``nounwind``,
881 ``readonly``) come immediately after the argument list.
883 Currently, only the following parameter attributes are defined:
886 This indicates to the code generator that the parameter or return
887 value should be zero-extended to the extent required by the target's
888 ABI (which is usually 32-bits, but is 8-bits for a i1 on x86-64) by
889 the caller (for a parameter) or the callee (for a return value).
891 This indicates to the code generator that the parameter or return
892 value should be sign-extended to the extent required by the target's
893 ABI (which is usually 32-bits) by the caller (for a parameter) or
894 the callee (for a return value).
896 This indicates that this parameter or return value should be treated
897 in a special target-dependent fashion while emitting code for
898 a function call or return (usually, by putting it in a register as
899 opposed to memory, though some targets use it to distinguish between
900 two different kinds of registers). Use of this attribute is
903 This indicates that the pointer parameter should really be passed by
904 value to the function. The attribute implies that a hidden copy of
905 the pointee is made between the caller and the callee, so the callee
906 is unable to modify the value in the caller. This attribute is only
907 valid on LLVM pointer arguments. It is generally used to pass
908 structs and arrays by value, but is also valid on pointers to
909 scalars. The copy is considered to belong to the caller not the
910 callee (for example, ``readonly`` functions should not write to
911 ``byval`` parameters). This is not a valid attribute for return
914 The byval attribute also supports specifying an alignment with the
915 align attribute. It indicates the alignment of the stack slot to
916 form and the known alignment of the pointer specified to the call
917 site. If the alignment is not specified, then the code generator
918 makes a target-specific assumption.
924 The ``inalloca`` argument attribute allows the caller to take the
925 address of outgoing stack arguments. An ``inalloca`` argument must
926 be a pointer to stack memory produced by an ``alloca`` instruction.
927 The alloca, or argument allocation, must also be tagged with the
928 inalloca keyword. Only the last argument may have the ``inalloca``
929 attribute, and that argument is guaranteed to be passed in memory.
931 An argument allocation may be used by a call at most once because
932 the call may deallocate it. The ``inalloca`` attribute cannot be
933 used in conjunction with other attributes that affect argument
934 storage, like ``inreg``, ``nest``, ``sret``, or ``byval``. The
935 ``inalloca`` attribute also disables LLVM's implicit lowering of
936 large aggregate return values, which means that frontend authors
937 must lower them with ``sret`` pointers.
939 When the call site is reached, the argument allocation must have
940 been the most recent stack allocation that is still live, or the
941 results are undefined. It is possible to allocate additional stack
942 space after an argument allocation and before its call site, but it
943 must be cleared off with :ref:`llvm.stackrestore
946 See :doc:`InAlloca` for more information on how to use this
950 This indicates that the pointer parameter specifies the address of a
951 structure that is the return value of the function in the source
952 program. This pointer must be guaranteed by the caller to be valid:
953 loads and stores to the structure may be assumed by the callee
954 not to trap and to be properly aligned. This may only be applied to
955 the first parameter. This is not a valid attribute for return
959 This indicates that the pointer value may be assumed by the optimizer to
960 have the specified alignment.
962 Note that this attribute has additional semantics when combined with the
968 This indicates that objects accessed via pointer values
969 :ref:`based <pointeraliasing>` on the argument or return value are not also
970 accessed, during the execution of the function, via pointer values not
971 *based* on the argument or return value. The attribute on a return value
972 also has additional semantics described below. The caller shares the
973 responsibility with the callee for ensuring that these requirements are met.
974 For further details, please see the discussion of the NoAlias response in
975 :ref:`alias analysis <Must, May, or No>`.
977 Note that this definition of ``noalias`` is intentionally similar
978 to the definition of ``restrict`` in C99 for function arguments.
980 For function return values, C99's ``restrict`` is not meaningful,
981 while LLVM's ``noalias`` is. Furthermore, the semantics of the ``noalias``
982 attribute on return values are stronger than the semantics of the attribute
983 when used on function arguments. On function return values, the ``noalias``
984 attribute indicates that the function acts like a system memory allocation
985 function, returning a pointer to allocated storage disjoint from the
986 storage for any other object accessible to the caller.
989 This indicates that the callee does not make any copies of the
990 pointer that outlive the callee itself. This is not a valid
991 attribute for return values.
996 This indicates that the pointer parameter can be excised using the
997 :ref:`trampoline intrinsics <int_trampoline>`. This is not a valid
998 attribute for return values and can only be applied to one parameter.
1001 This indicates that the function always returns the argument as its return
1002 value. This is an optimization hint to the code generator when generating
1003 the caller, allowing tail call optimization and omission of register saves
1004 and restores in some cases; it is not checked or enforced when generating
1005 the callee. The parameter and the function return type must be valid
1006 operands for the :ref:`bitcast instruction <i_bitcast>`. This is not a
1007 valid attribute for return values and can only be applied to one parameter.
1010 This indicates that the parameter or return pointer is not null. This
1011 attribute may only be applied to pointer typed parameters. This is not
1012 checked or enforced by LLVM, the caller must ensure that the pointer
1013 passed in is non-null, or the callee must ensure that the returned pointer
1016 ``dereferenceable(<n>)``
1017 This indicates that the parameter or return pointer is dereferenceable. This
1018 attribute may only be applied to pointer typed parameters. A pointer that
1019 is dereferenceable can be loaded from speculatively without a risk of
1020 trapping. The number of bytes known to be dereferenceable must be provided
1021 in parentheses. It is legal for the number of bytes to be less than the
1022 size of the pointee type. The ``nonnull`` attribute does not imply
1023 dereferenceability (consider a pointer to one element past the end of an
1024 array), however ``dereferenceable(<n>)`` does imply ``nonnull`` in
1025 ``addrspace(0)`` (which is the default address space).
1027 ``dereferenceable_or_null(<n>)``
1028 This indicates that the parameter or return value isn't both
1029 non-null and non-dereferenceable (up to ``<n>`` bytes) at the same
1030 time. All non-null pointers tagged with
1031 ``dereferenceable_or_null(<n>)`` are ``dereferenceable(<n>)``.
1032 For address space 0 ``dereferenceable_or_null(<n>)`` implies that
1033 a pointer is exactly one of ``dereferenceable(<n>)`` or ``null``,
1034 and in other address spaces ``dereferenceable_or_null(<n>)``
1035 implies that a pointer is at least one of ``dereferenceable(<n>)``
1036 or ``null`` (i.e. it may be both ``null`` and
1037 ``dereferenceable(<n>)``). This attribute may only be applied to
1038 pointer typed parameters.
1042 Garbage Collector Strategy Names
1043 --------------------------------
1045 Each function may specify a garbage collector strategy name, which is simply a
1048 .. code-block:: llvm
1050 define void @f() gc "name" { ... }
1052 The supported values of *name* includes those :ref:`built in to LLVM
1053 <builtin-gc-strategies>` and any provided by loaded plugins. Specifying a GC
1054 strategy will cause the compiler to alter its output in order to support the
1055 named garbage collection algorithm. Note that LLVM itself does not contain a
1056 garbage collector, this functionality is restricted to generating machine code
1057 which can interoperate with a collector provided externally.
1064 Prefix data is data associated with a function which the code
1065 generator will emit immediately before the function's entrypoint.
1066 The purpose of this feature is to allow frontends to associate
1067 language-specific runtime metadata with specific functions and make it
1068 available through the function pointer while still allowing the
1069 function pointer to be called.
1071 To access the data for a given function, a program may bitcast the
1072 function pointer to a pointer to the constant's type and dereference
1073 index -1. This implies that the IR symbol points just past the end of
1074 the prefix data. For instance, take the example of a function annotated
1075 with a single ``i32``,
1077 .. code-block:: llvm
1079 define void @f() prefix i32 123 { ... }
1081 The prefix data can be referenced as,
1083 .. code-block:: llvm
1085 %0 = bitcast void* () @f to i32*
1086 %a = getelementptr inbounds i32, i32* %0, i32 -1
1087 %b = load i32, i32* %a
1089 Prefix data is laid out as if it were an initializer for a global variable
1090 of the prefix data's type. The function will be placed such that the
1091 beginning of the prefix data is aligned. This means that if the size
1092 of the prefix data is not a multiple of the alignment size, the
1093 function's entrypoint will not be aligned. If alignment of the
1094 function's entrypoint is desired, padding must be added to the prefix
1097 A function may have prefix data but no body. This has similar semantics
1098 to the ``available_externally`` linkage in that the data may be used by the
1099 optimizers but will not be emitted in the object file.
1106 The ``prologue`` attribute allows arbitrary code (encoded as bytes) to
1107 be inserted prior to the function body. This can be used for enabling
1108 function hot-patching and instrumentation.
1110 To maintain the semantics of ordinary function calls, the prologue data must
1111 have a particular format. Specifically, it must begin with a sequence of
1112 bytes which decode to a sequence of machine instructions, valid for the
1113 module's target, which transfer control to the point immediately succeeding
1114 the prologue data, without performing any other visible action. This allows
1115 the inliner and other passes to reason about the semantics of the function
1116 definition without needing to reason about the prologue data. Obviously this
1117 makes the format of the prologue data highly target dependent.
1119 A trivial example of valid prologue data for the x86 architecture is ``i8 144``,
1120 which encodes the ``nop`` instruction:
1122 .. code-block:: llvm
1124 define void @f() prologue i8 144 { ... }
1126 Generally prologue data can be formed by encoding a relative branch instruction
1127 which skips the metadata, as in this example of valid prologue data for the
1128 x86_64 architecture, where the first two bytes encode ``jmp .+10``:
1130 .. code-block:: llvm
1132 %0 = type <{ i8, i8, i8* }>
1134 define void @f() prologue %0 <{ i8 235, i8 8, i8* @md}> { ... }
1136 A function may have prologue data but no body. This has similar semantics
1137 to the ``available_externally`` linkage in that the data may be used by the
1138 optimizers but will not be emitted in the object file.
1142 Personality Function
1143 --------------------
1145 The ``personality`` attribute permits functions to specify what function
1146 to use for exception handling.
1153 Attribute groups are groups of attributes that are referenced by objects within
1154 the IR. They are important for keeping ``.ll`` files readable, because a lot of
1155 functions will use the same set of attributes. In the degenerative case of a
1156 ``.ll`` file that corresponds to a single ``.c`` file, the single attribute
1157 group will capture the important command line flags used to build that file.
1159 An attribute group is a module-level object. To use an attribute group, an
1160 object references the attribute group's ID (e.g. ``#37``). An object may refer
1161 to more than one attribute group. In that situation, the attributes from the
1162 different groups are merged.
1164 Here is an example of attribute groups for a function that should always be
1165 inlined, has a stack alignment of 4, and which shouldn't use SSE instructions:
1167 .. code-block:: llvm
1169 ; Target-independent attributes:
1170 attributes #0 = { alwaysinline alignstack=4 }
1172 ; Target-dependent attributes:
1173 attributes #1 = { "no-sse" }
1175 ; Function @f has attributes: alwaysinline, alignstack=4, and "no-sse".
1176 define void @f() #0 #1 { ... }
1183 Function attributes are set to communicate additional information about
1184 a function. Function attributes are considered to be part of the
1185 function, not of the function type, so functions with different function
1186 attributes can have the same function type.
1188 Function attributes are simple keywords that follow the type specified.
1189 If multiple attributes are needed, they are space separated. For
1192 .. code-block:: llvm
1194 define void @f() noinline { ... }
1195 define void @f() alwaysinline { ... }
1196 define void @f() alwaysinline optsize { ... }
1197 define void @f() optsize { ... }
1200 This attribute indicates that, when emitting the prologue and
1201 epilogue, the backend should forcibly align the stack pointer.
1202 Specify the desired alignment, which must be a power of two, in
1205 This attribute indicates that the inliner should attempt to inline
1206 this function into callers whenever possible, ignoring any active
1207 inlining size threshold for this caller.
1209 This indicates that the callee function at a call site should be
1210 recognized as a built-in function, even though the function's declaration
1211 uses the ``nobuiltin`` attribute. This is only valid at call sites for
1212 direct calls to functions that are declared with the ``nobuiltin``
1215 This attribute indicates that this function is rarely called. When
1216 computing edge weights, basic blocks post-dominated by a cold
1217 function call are also considered to be cold; and, thus, given low
1220 This attribute indicates that the callee is dependent on a convergent
1221 thread execution pattern under certain parallel execution models.
1222 Transformations that are execution model agnostic may only move or
1223 tranform this call if the final location is control equivalent to its
1224 original position in the program, where control equivalence is defined as
1225 A dominates B and B post-dominates A, or vice versa.
1227 This attribute indicates that the source code contained a hint that
1228 inlining this function is desirable (such as the "inline" keyword in
1229 C/C++). It is just a hint; it imposes no requirements on the
1232 This attribute indicates that the function should be added to a
1233 jump-instruction table at code-generation time, and that all address-taken
1234 references to this function should be replaced with a reference to the
1235 appropriate jump-instruction-table function pointer. Note that this creates
1236 a new pointer for the original function, which means that code that depends
1237 on function-pointer identity can break. So, any function annotated with
1238 ``jumptable`` must also be ``unnamed_addr``.
1240 This attribute suggests that optimization passes and code generator
1241 passes make choices that keep the code size of this function as small
1242 as possible and perform optimizations that may sacrifice runtime
1243 performance in order to minimize the size of the generated code.
1245 This attribute disables prologue / epilogue emission for the
1246 function. This can have very system-specific consequences.
1248 This indicates that the callee function at a call site is not recognized as
1249 a built-in function. LLVM will retain the original call and not replace it
1250 with equivalent code based on the semantics of the built-in function, unless
1251 the call site uses the ``builtin`` attribute. This is valid at call sites
1252 and on function declarations and definitions.
1254 This attribute indicates that calls to the function cannot be
1255 duplicated. A call to a ``noduplicate`` function may be moved
1256 within its parent function, but may not be duplicated within
1257 its parent function.
1259 A function containing a ``noduplicate`` call may still
1260 be an inlining candidate, provided that the call is not
1261 duplicated by inlining. That implies that the function has
1262 internal linkage and only has one call site, so the original
1263 call is dead after inlining.
1265 This attributes disables implicit floating point instructions.
1267 This attribute indicates that the inliner should never inline this
1268 function in any situation. This attribute may not be used together
1269 with the ``alwaysinline`` attribute.
1271 This attribute suppresses lazy symbol binding for the function. This
1272 may make calls to the function faster, at the cost of extra program
1273 startup time if the function is not called during program startup.
1275 This attribute indicates that the code generator should not use a
1276 red zone, even if the target-specific ABI normally permits it.
1278 This function attribute indicates that the function never returns
1279 normally. This produces undefined behavior at runtime if the
1280 function ever does dynamically return.
1282 This function attribute indicates that the function never raises an
1283 exception. If the function does raise an exception, its runtime
1284 behavior is undefined. However, functions marked nounwind may still
1285 trap or generate asynchronous exceptions. Exception handling schemes
1286 that are recognized by LLVM to handle asynchronous exceptions, such
1287 as SEH, will still provide their implementation defined semantics.
1289 This function attribute indicates that the function is not optimized
1290 by any optimization or code generator passes with the
1291 exception of interprocedural optimization passes.
1292 This attribute cannot be used together with the ``alwaysinline``
1293 attribute; this attribute is also incompatible
1294 with the ``minsize`` attribute and the ``optsize`` attribute.
1296 This attribute requires the ``noinline`` attribute to be specified on
1297 the function as well, so the function is never inlined into any caller.
1298 Only functions with the ``alwaysinline`` attribute are valid
1299 candidates for inlining into the body of this function.
1301 This attribute suggests that optimization passes and code generator
1302 passes make choices that keep the code size of this function low,
1303 and otherwise do optimizations specifically to reduce code size as
1304 long as they do not significantly impact runtime performance.
1306 On a function, this attribute indicates that the function computes its
1307 result (or decides to unwind an exception) based strictly on its arguments,
1308 without dereferencing any pointer arguments or otherwise accessing
1309 any mutable state (e.g. memory, control registers, etc) visible to
1310 caller functions. It does not write through any pointer arguments
1311 (including ``byval`` arguments) and never changes any state visible
1312 to callers. This means that it cannot unwind exceptions by calling
1313 the ``C++`` exception throwing methods.
1315 On an argument, this attribute indicates that the function does not
1316 dereference that pointer argument, even though it may read or write the
1317 memory that the pointer points to if accessed through other pointers.
1319 On a function, this attribute indicates that the function does not write
1320 through any pointer arguments (including ``byval`` arguments) or otherwise
1321 modify any state (e.g. memory, control registers, etc) visible to
1322 caller functions. It may dereference pointer arguments and read
1323 state that may be set in the caller. A readonly function always
1324 returns the same value (or unwinds an exception identically) when
1325 called with the same set of arguments and global state. It cannot
1326 unwind an exception by calling the ``C++`` exception throwing
1329 On an argument, this attribute indicates that the function does not write
1330 through this pointer argument, even though it may write to the memory that
1331 the pointer points to.
1333 This attribute indicates that the only memory accesses inside function are
1334 loads and stores from objects pointed to by its pointer-typed arguments,
1335 with arbitrary offsets. Or in other words, all memory operations in the
1336 function can refer to memory only using pointers based on its function
1338 Note that ``argmemonly`` can be used together with ``readonly`` attribute
1339 in order to specify that function reads only from its arguments.
1341 This attribute indicates that this function can return twice. The C
1342 ``setjmp`` is an example of such a function. The compiler disables
1343 some optimizations (like tail calls) in the caller of these
1346 This attribute indicates that
1347 `SafeStack <http://clang.llvm.org/docs/SafeStack.html>`_
1348 protection is enabled for this function.
1350 If a function that has a ``safestack`` attribute is inlined into a
1351 function that doesn't have a ``safestack`` attribute or which has an
1352 ``ssp``, ``sspstrong`` or ``sspreq`` attribute, then the resulting
1353 function will have a ``safestack`` attribute.
1354 ``sanitize_address``
1355 This attribute indicates that AddressSanitizer checks
1356 (dynamic address safety analysis) are enabled for this function.
1358 This attribute indicates that MemorySanitizer checks (dynamic detection
1359 of accesses to uninitialized memory) are enabled for this function.
1361 This attribute indicates that ThreadSanitizer checks
1362 (dynamic thread safety analysis) are enabled for this function.
1364 This attribute indicates that the function should emit a stack
1365 smashing protector. It is in the form of a "canary" --- a random value
1366 placed on the stack before the local variables that's checked upon
1367 return from the function to see if it has been overwritten. A
1368 heuristic is used to determine if a function needs stack protectors
1369 or not. The heuristic used will enable protectors for functions with:
1371 - Character arrays larger than ``ssp-buffer-size`` (default 8).
1372 - Aggregates containing character arrays larger than ``ssp-buffer-size``.
1373 - Calls to alloca() with variable sizes or constant sizes greater than
1374 ``ssp-buffer-size``.
1376 Variables that are identified as requiring a protector will be arranged
1377 on the stack such that they are adjacent to the stack protector guard.
1379 If a function that has an ``ssp`` attribute is inlined into a
1380 function that doesn't have an ``ssp`` attribute, then the resulting
1381 function will have an ``ssp`` attribute.
1383 This attribute indicates that the function should *always* emit a
1384 stack smashing protector. This overrides the ``ssp`` function
1387 Variables that are identified as requiring a protector will be arranged
1388 on the stack such that they are adjacent to the stack protector guard.
1389 The specific layout rules are:
1391 #. Large arrays and structures containing large arrays
1392 (``>= ssp-buffer-size``) are closest to the stack protector.
1393 #. Small arrays and structures containing small arrays
1394 (``< ssp-buffer-size``) are 2nd closest to the protector.
1395 #. Variables that have had their address taken are 3rd closest to the
1398 If a function that has an ``sspreq`` attribute is inlined into a
1399 function that doesn't have an ``sspreq`` attribute or which has an
1400 ``ssp`` or ``sspstrong`` attribute, then the resulting function will have
1401 an ``sspreq`` attribute.
1403 This attribute indicates that the function should emit a stack smashing
1404 protector. This attribute causes a strong heuristic to be used when
1405 determining if a function needs stack protectors. The strong heuristic
1406 will enable protectors for functions with:
1408 - Arrays of any size and type
1409 - Aggregates containing an array of any size and type.
1410 - Calls to alloca().
1411 - Local variables that have had their address taken.
1413 Variables that are identified as requiring a protector will be arranged
1414 on the stack such that they are adjacent to the stack protector guard.
1415 The specific layout rules are:
1417 #. Large arrays and structures containing large arrays
1418 (``>= ssp-buffer-size``) are closest to the stack protector.
1419 #. Small arrays and structures containing small arrays
1420 (``< ssp-buffer-size``) are 2nd closest to the protector.
1421 #. Variables that have had their address taken are 3rd closest to the
1424 This overrides the ``ssp`` function attribute.
1426 If a function that has an ``sspstrong`` attribute is inlined into a
1427 function that doesn't have an ``sspstrong`` attribute, then the
1428 resulting function will have an ``sspstrong`` attribute.
1430 This attribute indicates that the function will delegate to some other
1431 function with a tail call. The prototype of a thunk should not be used for
1432 optimization purposes. The caller is expected to cast the thunk prototype to
1433 match the thunk target prototype.
1435 This attribute indicates that the ABI being targeted requires that
1436 an unwind table entry be produced for this function even if we can
1437 show that no exceptions passes by it. This is normally the case for
1438 the ELF x86-64 abi, but it can be disabled for some compilation
1443 Module-Level Inline Assembly
1444 ----------------------------
1446 Modules may contain "module-level inline asm" blocks, which corresponds
1447 to the GCC "file scope inline asm" blocks. These blocks are internally
1448 concatenated by LLVM and treated as a single unit, but may be separated
1449 in the ``.ll`` file if desired. The syntax is very simple:
1451 .. code-block:: llvm
1453 module asm "inline asm code goes here"
1454 module asm "more can go here"
1456 The strings can contain any character by escaping non-printable
1457 characters. The escape sequence used is simply "\\xx" where "xx" is the
1458 two digit hex code for the number.
1460 Note that the assembly string *must* be parseable by LLVM's integrated assembler
1461 (unless it is disabled), even when emitting a ``.s`` file.
1463 .. _langref_datalayout:
1468 A module may specify a target specific data layout string that specifies
1469 how data is to be laid out in memory. The syntax for the data layout is
1472 .. code-block:: llvm
1474 target datalayout = "layout specification"
1476 The *layout specification* consists of a list of specifications
1477 separated by the minus sign character ('-'). Each specification starts
1478 with a letter and may include other information after the letter to
1479 define some aspect of the data layout. The specifications accepted are
1483 Specifies that the target lays out data in big-endian form. That is,
1484 the bits with the most significance have the lowest address
1487 Specifies that the target lays out data in little-endian form. That
1488 is, the bits with the least significance have the lowest address
1491 Specifies the natural alignment of the stack in bits. Alignment
1492 promotion of stack variables is limited to the natural stack
1493 alignment to avoid dynamic stack realignment. The stack alignment
1494 must be a multiple of 8-bits. If omitted, the natural stack
1495 alignment defaults to "unspecified", which does not prevent any
1496 alignment promotions.
1497 ``p[n]:<size>:<abi>:<pref>``
1498 This specifies the *size* of a pointer and its ``<abi>`` and
1499 ``<pref>``\erred alignments for address space ``n``. All sizes are in
1500 bits. The address space, ``n``, is optional, and if not specified,
1501 denotes the default address space 0. The value of ``n`` must be
1502 in the range [1,2^23).
1503 ``i<size>:<abi>:<pref>``
1504 This specifies the alignment for an integer type of a given bit
1505 ``<size>``. The value of ``<size>`` must be in the range [1,2^23).
1506 ``v<size>:<abi>:<pref>``
1507 This specifies the alignment for a vector type of a given bit
1509 ``f<size>:<abi>:<pref>``
1510 This specifies the alignment for a floating point type of a given bit
1511 ``<size>``. Only values of ``<size>`` that are supported by the target
1512 will work. 32 (float) and 64 (double) are supported on all targets; 80
1513 or 128 (different flavors of long double) are also supported on some
1516 This specifies the alignment for an object of aggregate type.
1518 If present, specifies that llvm names are mangled in the output. The
1521 * ``e``: ELF mangling: Private symbols get a ``.L`` prefix.
1522 * ``m``: Mips mangling: Private symbols get a ``$`` prefix.
1523 * ``o``: Mach-O mangling: Private symbols get ``L`` prefix. Other
1524 symbols get a ``_`` prefix.
1525 * ``w``: Windows COFF prefix: Similar to Mach-O, but stdcall and fastcall
1526 functions also get a suffix based on the frame size.
1527 ``n<size1>:<size2>:<size3>...``
1528 This specifies a set of native integer widths for the target CPU in
1529 bits. For example, it might contain ``n32`` for 32-bit PowerPC,
1530 ``n32:64`` for PowerPC 64, or ``n8:16:32:64`` for X86-64. Elements of
1531 this set are considered to support most general arithmetic operations
1534 On every specification that takes a ``<abi>:<pref>``, specifying the
1535 ``<pref>`` alignment is optional. If omitted, the preceding ``:``
1536 should be omitted too and ``<pref>`` will be equal to ``<abi>``.
1538 When constructing the data layout for a given target, LLVM starts with a
1539 default set of specifications which are then (possibly) overridden by
1540 the specifications in the ``datalayout`` keyword. The default
1541 specifications are given in this list:
1543 - ``E`` - big endian
1544 - ``p:64:64:64`` - 64-bit pointers with 64-bit alignment.
1545 - ``p[n]:64:64:64`` - Other address spaces are assumed to be the
1546 same as the default address space.
1547 - ``S0`` - natural stack alignment is unspecified
1548 - ``i1:8:8`` - i1 is 8-bit (byte) aligned
1549 - ``i8:8:8`` - i8 is 8-bit (byte) aligned
1550 - ``i16:16:16`` - i16 is 16-bit aligned
1551 - ``i32:32:32`` - i32 is 32-bit aligned
1552 - ``i64:32:64`` - i64 has ABI alignment of 32-bits but preferred
1553 alignment of 64-bits
1554 - ``f16:16:16`` - half is 16-bit aligned
1555 - ``f32:32:32`` - float is 32-bit aligned
1556 - ``f64:64:64`` - double is 64-bit aligned
1557 - ``f128:128:128`` - quad is 128-bit aligned
1558 - ``v64:64:64`` - 64-bit vector is 64-bit aligned
1559 - ``v128:128:128`` - 128-bit vector is 128-bit aligned
1560 - ``a:0:64`` - aggregates are 64-bit aligned
1562 When LLVM is determining the alignment for a given type, it uses the
1565 #. If the type sought is an exact match for one of the specifications,
1566 that specification is used.
1567 #. If no match is found, and the type sought is an integer type, then
1568 the smallest integer type that is larger than the bitwidth of the
1569 sought type is used. If none of the specifications are larger than
1570 the bitwidth then the largest integer type is used. For example,
1571 given the default specifications above, the i7 type will use the
1572 alignment of i8 (next largest) while both i65 and i256 will use the
1573 alignment of i64 (largest specified).
1574 #. If no match is found, and the type sought is a vector type, then the
1575 largest vector type that is smaller than the sought vector type will
1576 be used as a fall back. This happens because <128 x double> can be
1577 implemented in terms of 64 <2 x double>, for example.
1579 The function of the data layout string may not be what you expect.
1580 Notably, this is not a specification from the frontend of what alignment
1581 the code generator should use.
1583 Instead, if specified, the target data layout is required to match what
1584 the ultimate *code generator* expects. This string is used by the
1585 mid-level optimizers to improve code, and this only works if it matches
1586 what the ultimate code generator uses. There is no way to generate IR
1587 that does not embed this target-specific detail into the IR. If you
1588 don't specify the string, the default specifications will be used to
1589 generate a Data Layout and the optimization phases will operate
1590 accordingly and introduce target specificity into the IR with respect to
1591 these default specifications.
1598 A module may specify a target triple string that describes the target
1599 host. The syntax for the target triple is simply:
1601 .. code-block:: llvm
1603 target triple = "x86_64-apple-macosx10.7.0"
1605 The *target triple* string consists of a series of identifiers delimited
1606 by the minus sign character ('-'). The canonical forms are:
1610 ARCHITECTURE-VENDOR-OPERATING_SYSTEM
1611 ARCHITECTURE-VENDOR-OPERATING_SYSTEM-ENVIRONMENT
1613 This information is passed along to the backend so that it generates
1614 code for the proper architecture. It's possible to override this on the
1615 command line with the ``-mtriple`` command line option.
1617 .. _pointeraliasing:
1619 Pointer Aliasing Rules
1620 ----------------------
1622 Any memory access must be done through a pointer value associated with
1623 an address range of the memory access, otherwise the behavior is
1624 undefined. Pointer values are associated with address ranges according
1625 to the following rules:
1627 - A pointer value is associated with the addresses associated with any
1628 value it is *based* on.
1629 - An address of a global variable is associated with the address range
1630 of the variable's storage.
1631 - The result value of an allocation instruction is associated with the
1632 address range of the allocated storage.
1633 - A null pointer in the default address-space is associated with no
1635 - An integer constant other than zero or a pointer value returned from
1636 a function not defined within LLVM may be associated with address
1637 ranges allocated through mechanisms other than those provided by
1638 LLVM. Such ranges shall not overlap with any ranges of addresses
1639 allocated by mechanisms provided by LLVM.
1641 A pointer value is *based* on another pointer value according to the
1644 - A pointer value formed from a ``getelementptr`` operation is *based*
1645 on the first value operand of the ``getelementptr``.
1646 - The result value of a ``bitcast`` is *based* on the operand of the
1648 - A pointer value formed by an ``inttoptr`` is *based* on all pointer
1649 values that contribute (directly or indirectly) to the computation of
1650 the pointer's value.
1651 - The "*based* on" relationship is transitive.
1653 Note that this definition of *"based"* is intentionally similar to the
1654 definition of *"based"* in C99, though it is slightly weaker.
1656 LLVM IR does not associate types with memory. The result type of a
1657 ``load`` merely indicates the size and alignment of the memory from
1658 which to load, as well as the interpretation of the value. The first
1659 operand type of a ``store`` similarly only indicates the size and
1660 alignment of the store.
1662 Consequently, type-based alias analysis, aka TBAA, aka
1663 ``-fstrict-aliasing``, is not applicable to general unadorned LLVM IR.
1664 :ref:`Metadata <metadata>` may be used to encode additional information
1665 which specialized optimization passes may use to implement type-based
1670 Volatile Memory Accesses
1671 ------------------------
1673 Certain memory accesses, such as :ref:`load <i_load>`'s,
1674 :ref:`store <i_store>`'s, and :ref:`llvm.memcpy <int_memcpy>`'s may be
1675 marked ``volatile``. The optimizers must not change the number of
1676 volatile operations or change their order of execution relative to other
1677 volatile operations. The optimizers *may* change the order of volatile
1678 operations relative to non-volatile operations. This is not Java's
1679 "volatile" and has no cross-thread synchronization behavior.
1681 IR-level volatile loads and stores cannot safely be optimized into
1682 llvm.memcpy or llvm.memmove intrinsics even when those intrinsics are
1683 flagged volatile. Likewise, the backend should never split or merge
1684 target-legal volatile load/store instructions.
1686 .. admonition:: Rationale
1688 Platforms may rely on volatile loads and stores of natively supported
1689 data width to be executed as single instruction. For example, in C
1690 this holds for an l-value of volatile primitive type with native
1691 hardware support, but not necessarily for aggregate types. The
1692 frontend upholds these expectations, which are intentionally
1693 unspecified in the IR. The rules above ensure that IR transformations
1694 do not violate the frontend's contract with the language.
1698 Memory Model for Concurrent Operations
1699 --------------------------------------
1701 The LLVM IR does not define any way to start parallel threads of
1702 execution or to register signal handlers. Nonetheless, there are
1703 platform-specific ways to create them, and we define LLVM IR's behavior
1704 in their presence. This model is inspired by the C++0x memory model.
1706 For a more informal introduction to this model, see the :doc:`Atomics`.
1708 We define a *happens-before* partial order as the least partial order
1711 - Is a superset of single-thread program order, and
1712 - When a *synchronizes-with* ``b``, includes an edge from ``a`` to
1713 ``b``. *Synchronizes-with* pairs are introduced by platform-specific
1714 techniques, like pthread locks, thread creation, thread joining,
1715 etc., and by atomic instructions. (See also :ref:`Atomic Memory Ordering
1716 Constraints <ordering>`).
1718 Note that program order does not introduce *happens-before* edges
1719 between a thread and signals executing inside that thread.
1721 Every (defined) read operation (load instructions, memcpy, atomic
1722 loads/read-modify-writes, etc.) R reads a series of bytes written by
1723 (defined) write operations (store instructions, atomic
1724 stores/read-modify-writes, memcpy, etc.). For the purposes of this
1725 section, initialized globals are considered to have a write of the
1726 initializer which is atomic and happens before any other read or write
1727 of the memory in question. For each byte of a read R, R\ :sub:`byte`
1728 may see any write to the same byte, except:
1730 - If write\ :sub:`1` happens before write\ :sub:`2`, and
1731 write\ :sub:`2` happens before R\ :sub:`byte`, then
1732 R\ :sub:`byte` does not see write\ :sub:`1`.
1733 - If R\ :sub:`byte` happens before write\ :sub:`3`, then
1734 R\ :sub:`byte` does not see write\ :sub:`3`.
1736 Given that definition, R\ :sub:`byte` is defined as follows:
1738 - If R is volatile, the result is target-dependent. (Volatile is
1739 supposed to give guarantees which can support ``sig_atomic_t`` in
1740 C/C++, and may be used for accesses to addresses that do not behave
1741 like normal memory. It does not generally provide cross-thread
1743 - Otherwise, if there is no write to the same byte that happens before
1744 R\ :sub:`byte`, R\ :sub:`byte` returns ``undef`` for that byte.
1745 - Otherwise, if R\ :sub:`byte` may see exactly one write,
1746 R\ :sub:`byte` returns the value written by that write.
1747 - Otherwise, if R is atomic, and all the writes R\ :sub:`byte` may
1748 see are atomic, it chooses one of the values written. See the :ref:`Atomic
1749 Memory Ordering Constraints <ordering>` section for additional
1750 constraints on how the choice is made.
1751 - Otherwise R\ :sub:`byte` returns ``undef``.
1753 R returns the value composed of the series of bytes it read. This
1754 implies that some bytes within the value may be ``undef`` **without**
1755 the entire value being ``undef``. Note that this only defines the
1756 semantics of the operation; it doesn't mean that targets will emit more
1757 than one instruction to read the series of bytes.
1759 Note that in cases where none of the atomic intrinsics are used, this
1760 model places only one restriction on IR transformations on top of what
1761 is required for single-threaded execution: introducing a store to a byte
1762 which might not otherwise be stored is not allowed in general.
1763 (Specifically, in the case where another thread might write to and read
1764 from an address, introducing a store can change a load that may see
1765 exactly one write into a load that may see multiple writes.)
1769 Atomic Memory Ordering Constraints
1770 ----------------------------------
1772 Atomic instructions (:ref:`cmpxchg <i_cmpxchg>`,
1773 :ref:`atomicrmw <i_atomicrmw>`, :ref:`fence <i_fence>`,
1774 :ref:`atomic load <i_load>`, and :ref:`atomic store <i_store>`) take
1775 ordering parameters that determine which other atomic instructions on
1776 the same address they *synchronize with*. These semantics are borrowed
1777 from Java and C++0x, but are somewhat more colloquial. If these
1778 descriptions aren't precise enough, check those specs (see spec
1779 references in the :doc:`atomics guide <Atomics>`).
1780 :ref:`fence <i_fence>` instructions treat these orderings somewhat
1781 differently since they don't take an address. See that instruction's
1782 documentation for details.
1784 For a simpler introduction to the ordering constraints, see the
1788 The set of values that can be read is governed by the happens-before
1789 partial order. A value cannot be read unless some operation wrote
1790 it. This is intended to provide a guarantee strong enough to model
1791 Java's non-volatile shared variables. This ordering cannot be
1792 specified for read-modify-write operations; it is not strong enough
1793 to make them atomic in any interesting way.
1795 In addition to the guarantees of ``unordered``, there is a single
1796 total order for modifications by ``monotonic`` operations on each
1797 address. All modification orders must be compatible with the
1798 happens-before order. There is no guarantee that the modification
1799 orders can be combined to a global total order for the whole program
1800 (and this often will not be possible). The read in an atomic
1801 read-modify-write operation (:ref:`cmpxchg <i_cmpxchg>` and
1802 :ref:`atomicrmw <i_atomicrmw>`) reads the value in the modification
1803 order immediately before the value it writes. If one atomic read
1804 happens before another atomic read of the same address, the later
1805 read must see the same value or a later value in the address's
1806 modification order. This disallows reordering of ``monotonic`` (or
1807 stronger) operations on the same address. If an address is written
1808 ``monotonic``-ally by one thread, and other threads ``monotonic``-ally
1809 read that address repeatedly, the other threads must eventually see
1810 the write. This corresponds to the C++0x/C1x
1811 ``memory_order_relaxed``.
1813 In addition to the guarantees of ``monotonic``, a
1814 *synchronizes-with* edge may be formed with a ``release`` operation.
1815 This is intended to model C++'s ``memory_order_acquire``.
1817 In addition to the guarantees of ``monotonic``, if this operation
1818 writes a value which is subsequently read by an ``acquire``
1819 operation, it *synchronizes-with* that operation. (This isn't a
1820 complete description; see the C++0x definition of a release
1821 sequence.) This corresponds to the C++0x/C1x
1822 ``memory_order_release``.
1823 ``acq_rel`` (acquire+release)
1824 Acts as both an ``acquire`` and ``release`` operation on its
1825 address. This corresponds to the C++0x/C1x ``memory_order_acq_rel``.
1826 ``seq_cst`` (sequentially consistent)
1827 In addition to the guarantees of ``acq_rel`` (``acquire`` for an
1828 operation that only reads, ``release`` for an operation that only
1829 writes), there is a global total order on all
1830 sequentially-consistent operations on all addresses, which is
1831 consistent with the *happens-before* partial order and with the
1832 modification orders of all the affected addresses. Each
1833 sequentially-consistent read sees the last preceding write to the
1834 same address in this global order. This corresponds to the C++0x/C1x
1835 ``memory_order_seq_cst`` and Java volatile.
1839 If an atomic operation is marked ``singlethread``, it only *synchronizes
1840 with* or participates in modification and seq\_cst total orderings with
1841 other operations running in the same thread (for example, in signal
1849 LLVM IR floating-point binary ops (:ref:`fadd <i_fadd>`,
1850 :ref:`fsub <i_fsub>`, :ref:`fmul <i_fmul>`, :ref:`fdiv <i_fdiv>`,
1851 :ref:`frem <i_frem>`, :ref:`fcmp <i_fcmp>`) have the following flags that can
1852 be set to enable otherwise unsafe floating point operations
1855 No NaNs - Allow optimizations to assume the arguments and result are not
1856 NaN. Such optimizations are required to retain defined behavior over
1857 NaNs, but the value of the result is undefined.
1860 No Infs - Allow optimizations to assume the arguments and result are not
1861 +/-Inf. Such optimizations are required to retain defined behavior over
1862 +/-Inf, but the value of the result is undefined.
1865 No Signed Zeros - Allow optimizations to treat the sign of a zero
1866 argument or result as insignificant.
1869 Allow Reciprocal - Allow optimizations to use the reciprocal of an
1870 argument rather than perform division.
1873 Fast - Allow algebraically equivalent transformations that may
1874 dramatically change results in floating point (e.g. reassociate). This
1875 flag implies all the others.
1879 Use-list Order Directives
1880 -------------------------
1882 Use-list directives encode the in-memory order of each use-list, allowing the
1883 order to be recreated. ``<order-indexes>`` is a comma-separated list of
1884 indexes that are assigned to the referenced value's uses. The referenced
1885 value's use-list is immediately sorted by these indexes.
1887 Use-list directives may appear at function scope or global scope. They are not
1888 instructions, and have no effect on the semantics of the IR. When they're at
1889 function scope, they must appear after the terminator of the final basic block.
1891 If basic blocks have their address taken via ``blockaddress()`` expressions,
1892 ``uselistorder_bb`` can be used to reorder their use-lists from outside their
1899 uselistorder <ty> <value>, { <order-indexes> }
1900 uselistorder_bb @function, %block { <order-indexes> }
1906 define void @foo(i32 %arg1, i32 %arg2) {
1908 ; ... instructions ...
1910 ; ... instructions ...
1912 ; At function scope.
1913 uselistorder i32 %arg1, { 1, 0, 2 }
1914 uselistorder label %bb, { 1, 0 }
1918 uselistorder i32* @global, { 1, 2, 0 }
1919 uselistorder i32 7, { 1, 0 }
1920 uselistorder i32 (i32) @bar, { 1, 0 }
1921 uselistorder_bb @foo, %bb, { 5, 1, 3, 2, 0, 4 }
1928 The LLVM type system is one of the most important features of the
1929 intermediate representation. Being typed enables a number of
1930 optimizations to be performed on the intermediate representation
1931 directly, without having to do extra analyses on the side before the
1932 transformation. A strong type system makes it easier to read the
1933 generated code and enables novel analyses and transformations that are
1934 not feasible to perform on normal three address code representations.
1944 The void type does not represent any value and has no size.
1962 The function type can be thought of as a function signature. It consists of a
1963 return type and a list of formal parameter types. The return type of a function
1964 type is a void type or first class type --- except for :ref:`label <t_label>`
1965 and :ref:`metadata <t_metadata>` types.
1971 <returntype> (<parameter list>)
1973 ...where '``<parameter list>``' is a comma-separated list of type
1974 specifiers. Optionally, the parameter list may include a type ``...``, which
1975 indicates that the function takes a variable number of arguments. Variable
1976 argument functions can access their arguments with the :ref:`variable argument
1977 handling intrinsic <int_varargs>` functions. '``<returntype>``' is any type
1978 except :ref:`label <t_label>` and :ref:`metadata <t_metadata>`.
1982 +---------------------------------+---------------------------------------------------------------------------------------------------------------------------------------------------------------------+
1983 | ``i32 (i32)`` | function taking an ``i32``, returning an ``i32`` |
1984 +---------------------------------+---------------------------------------------------------------------------------------------------------------------------------------------------------------------+
1985 | ``float (i16, i32 *) *`` | :ref:`Pointer <t_pointer>` to a function that takes an ``i16`` and a :ref:`pointer <t_pointer>` to ``i32``, returning ``float``. |
1986 +---------------------------------+---------------------------------------------------------------------------------------------------------------------------------------------------------------------+
1987 | ``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. |
1988 +---------------------------------+---------------------------------------------------------------------------------------------------------------------------------------------------------------------+
1989 | ``{i32, i32} (i32)`` | A function taking an ``i32``, returning a :ref:`structure <t_struct>` containing two ``i32`` values |
1990 +---------------------------------+---------------------------------------------------------------------------------------------------------------------------------------------------------------------+
1997 The :ref:`first class <t_firstclass>` types are perhaps the most important.
1998 Values of these types are the only ones which can be produced by
2006 These are the types that are valid in registers from CodeGen's perspective.
2015 The integer type is a very simple type that simply specifies an
2016 arbitrary bit width for the integer type desired. Any bit width from 1
2017 bit to 2\ :sup:`23`\ -1 (about 8 million) can be specified.
2025 The number of bits the integer will occupy is specified by the ``N``
2031 +----------------+------------------------------------------------+
2032 | ``i1`` | a single-bit integer. |
2033 +----------------+------------------------------------------------+
2034 | ``i32`` | a 32-bit integer. |
2035 +----------------+------------------------------------------------+
2036 | ``i1942652`` | a really big integer of over 1 million bits. |
2037 +----------------+------------------------------------------------+
2041 Floating Point Types
2042 """"""""""""""""""""
2051 - 16-bit floating point value
2054 - 32-bit floating point value
2057 - 64-bit floating point value
2060 - 128-bit floating point value (112-bit mantissa)
2063 - 80-bit floating point value (X87)
2066 - 128-bit floating point value (two 64-bits)
2073 The x86_mmx type represents a value held in an MMX register on an x86
2074 machine. The operations allowed on it are quite limited: parameters and
2075 return values, load and store, and bitcast. User-specified MMX
2076 instructions are represented as intrinsic or asm calls with arguments
2077 and/or results of this type. There are no arrays, vectors or constants
2094 The pointer type is used to specify memory locations. Pointers are
2095 commonly used to reference objects in memory.
2097 Pointer types may have an optional address space attribute defining the
2098 numbered address space where the pointed-to object resides. The default
2099 address space is number zero. The semantics of non-zero address spaces
2100 are target-specific.
2102 Note that LLVM does not permit pointers to void (``void*``) nor does it
2103 permit pointers to labels (``label*``). Use ``i8*`` instead.
2113 +-------------------------+--------------------------------------------------------------------------------------------------------------+
2114 | ``[4 x i32]*`` | A :ref:`pointer <t_pointer>` to :ref:`array <t_array>` of four ``i32`` values. |
2115 +-------------------------+--------------------------------------------------------------------------------------------------------------+
2116 | ``i32 (i32*) *`` | A :ref:`pointer <t_pointer>` to a :ref:`function <t_function>` that takes an ``i32*``, returning an ``i32``. |
2117 +-------------------------+--------------------------------------------------------------------------------------------------------------+
2118 | ``i32 addrspace(5)*`` | A :ref:`pointer <t_pointer>` to an ``i32`` value that resides in address space #5. |
2119 +-------------------------+--------------------------------------------------------------------------------------------------------------+
2128 A vector type is a simple derived type that represents a vector of
2129 elements. Vector types are used when multiple primitive data are
2130 operated in parallel using a single instruction (SIMD). A vector type
2131 requires a size (number of elements) and an underlying primitive data
2132 type. Vector types are considered :ref:`first class <t_firstclass>`.
2138 < <# elements> x <elementtype> >
2140 The number of elements is a constant integer value larger than 0;
2141 elementtype may be any integer, floating point or pointer type. Vectors
2142 of size zero are not allowed.
2146 +-------------------+--------------------------------------------------+
2147 | ``<4 x i32>`` | Vector of 4 32-bit integer values. |
2148 +-------------------+--------------------------------------------------+
2149 | ``<8 x float>`` | Vector of 8 32-bit floating-point values. |
2150 +-------------------+--------------------------------------------------+
2151 | ``<2 x i64>`` | Vector of 2 64-bit integer values. |
2152 +-------------------+--------------------------------------------------+
2153 | ``<4 x i64*>`` | Vector of 4 pointers to 64-bit integer values. |
2154 +-------------------+--------------------------------------------------+
2163 The label type represents code labels.
2178 The token type is used when a value is associated with an instruction
2179 but all uses of the value must not attempt to introspect or obscure it.
2180 As such, it is not appropriate to have a :ref:`phi <i_phi>` or
2181 :ref:`select <i_select>` of type token.
2198 The metadata type represents embedded metadata. No derived types may be
2199 created from metadata except for :ref:`function <t_function>` arguments.
2212 Aggregate Types are a subset of derived types that can contain multiple
2213 member types. :ref:`Arrays <t_array>` and :ref:`structs <t_struct>` are
2214 aggregate types. :ref:`Vectors <t_vector>` are not considered to be
2224 The array type is a very simple derived type that arranges elements
2225 sequentially in memory. The array type requires a size (number of
2226 elements) and an underlying data type.
2232 [<# elements> x <elementtype>]
2234 The number of elements is a constant integer value; ``elementtype`` may
2235 be any type with a size.
2239 +------------------+--------------------------------------+
2240 | ``[40 x i32]`` | Array of 40 32-bit integer values. |
2241 +------------------+--------------------------------------+
2242 | ``[41 x i32]`` | Array of 41 32-bit integer values. |
2243 +------------------+--------------------------------------+
2244 | ``[4 x i8]`` | Array of 4 8-bit integer values. |
2245 +------------------+--------------------------------------+
2247 Here are some examples of multidimensional arrays:
2249 +-----------------------------+----------------------------------------------------------+
2250 | ``[3 x [4 x i32]]`` | 3x4 array of 32-bit integer values. |
2251 +-----------------------------+----------------------------------------------------------+
2252 | ``[12 x [10 x float]]`` | 12x10 array of single precision floating point values. |
2253 +-----------------------------+----------------------------------------------------------+
2254 | ``[2 x [3 x [4 x i16]]]`` | 2x3x4 array of 16-bit integer values. |
2255 +-----------------------------+----------------------------------------------------------+
2257 There is no restriction on indexing beyond the end of the array implied
2258 by a static type (though there are restrictions on indexing beyond the
2259 bounds of an allocated object in some cases). This means that
2260 single-dimension 'variable sized array' addressing can be implemented in
2261 LLVM with a zero length array type. An implementation of 'pascal style
2262 arrays' in LLVM could use the type "``{ i32, [0 x float]}``", for
2272 The structure type is used to represent a collection of data members
2273 together in memory. The elements of a structure may be any type that has
2276 Structures in memory are accessed using '``load``' and '``store``' by
2277 getting a pointer to a field with the '``getelementptr``' instruction.
2278 Structures in registers are accessed using the '``extractvalue``' and
2279 '``insertvalue``' instructions.
2281 Structures may optionally be "packed" structures, which indicate that
2282 the alignment of the struct is one byte, and that there is no padding
2283 between the elements. In non-packed structs, padding between field types
2284 is inserted as defined by the DataLayout string in the module, which is
2285 required to match what the underlying code generator expects.
2287 Structures can either be "literal" or "identified". A literal structure
2288 is defined inline with other types (e.g. ``{i32, i32}*``) whereas
2289 identified types are always defined at the top level with a name.
2290 Literal types are uniqued by their contents and can never be recursive
2291 or opaque since there is no way to write one. Identified types can be
2292 recursive, can be opaqued, and are never uniqued.
2298 %T1 = type { <type list> } ; Identified normal struct type
2299 %T2 = type <{ <type list> }> ; Identified packed struct type
2303 +------------------------------+---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
2304 | ``{ i32, i32, i32 }`` | A triple of three ``i32`` values |
2305 +------------------------------+---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
2306 | ``{ 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``. |
2307 +------------------------------+---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
2308 | ``<{ i8, i32 }>`` | A packed struct known to be 5 bytes in size. |
2309 +------------------------------+---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
2313 Opaque Structure Types
2314 """"""""""""""""""""""
2318 Opaque structure types are used to represent named structure types that
2319 do not have a body specified. This corresponds (for example) to the C
2320 notion of a forward declared structure.
2331 +--------------+-------------------+
2332 | ``opaque`` | An opaque type. |
2333 +--------------+-------------------+
2340 LLVM has several different basic types of constants. This section
2341 describes them all and their syntax.
2346 **Boolean constants**
2347 The two strings '``true``' and '``false``' are both valid constants
2349 **Integer constants**
2350 Standard integers (such as '4') are constants of the
2351 :ref:`integer <t_integer>` type. Negative numbers may be used with
2353 **Floating point constants**
2354 Floating point constants use standard decimal notation (e.g.
2355 123.421), exponential notation (e.g. 1.23421e+2), or a more precise
2356 hexadecimal notation (see below). The assembler requires the exact
2357 decimal value of a floating-point constant. For example, the
2358 assembler accepts 1.25 but rejects 1.3 because 1.3 is a repeating
2359 decimal in binary. Floating point constants must have a :ref:`floating
2360 point <t_floating>` type.
2361 **Null pointer constants**
2362 The identifier '``null``' is recognized as a null pointer constant
2363 and must be of :ref:`pointer type <t_pointer>`.
2365 The one non-intuitive notation for constants is the hexadecimal form of
2366 floating point constants. For example, the form
2367 '``double 0x432ff973cafa8000``' is equivalent to (but harder to read
2368 than) '``double 4.5e+15``'. The only time hexadecimal floating point
2369 constants are required (and the only time that they are generated by the
2370 disassembler) is when a floating point constant must be emitted but it
2371 cannot be represented as a decimal floating point number in a reasonable
2372 number of digits. For example, NaN's, infinities, and other special
2373 values are represented in their IEEE hexadecimal format so that assembly
2374 and disassembly do not cause any bits to change in the constants.
2376 When using the hexadecimal form, constants of types half, float, and
2377 double are represented using the 16-digit form shown above (which
2378 matches the IEEE754 representation for double); half and float values
2379 must, however, be exactly representable as IEEE 754 half and single
2380 precision, respectively. Hexadecimal format is always used for long
2381 double, and there are three forms of long double. The 80-bit format used
2382 by x86 is represented as ``0xK`` followed by 20 hexadecimal digits. The
2383 128-bit format used by PowerPC (two adjacent doubles) is represented by
2384 ``0xM`` followed by 32 hexadecimal digits. The IEEE 128-bit format is
2385 represented by ``0xL`` followed by 32 hexadecimal digits. Long doubles
2386 will only work if they match the long double format on your target.
2387 The IEEE 16-bit format (half precision) is represented by ``0xH``
2388 followed by 4 hexadecimal digits. All hexadecimal formats are big-endian
2389 (sign bit at the left).
2391 There are no constants of type x86_mmx.
2393 .. _complexconstants:
2398 Complex constants are a (potentially recursive) combination of simple
2399 constants and smaller complex constants.
2401 **Structure constants**
2402 Structure constants are represented with notation similar to
2403 structure type definitions (a comma separated list of elements,
2404 surrounded by braces (``{}``)). For example:
2405 "``{ i32 4, float 17.0, i32* @G }``", where "``@G``" is declared as
2406 "``@G = external global i32``". Structure constants must have
2407 :ref:`structure type <t_struct>`, and the number and types of elements
2408 must match those specified by the type.
2410 Array constants are represented with notation similar to array type
2411 definitions (a comma separated list of elements, surrounded by
2412 square brackets (``[]``)). For example:
2413 "``[ i32 42, i32 11, i32 74 ]``". Array constants must have
2414 :ref:`array type <t_array>`, and the number and types of elements must
2415 match those specified by the type. As a special case, character array
2416 constants may also be represented as a double-quoted string using the ``c``
2417 prefix. For example: "``c"Hello World\0A\00"``".
2418 **Vector constants**
2419 Vector constants are represented with notation similar to vector
2420 type definitions (a comma separated list of elements, surrounded by
2421 less-than/greater-than's (``<>``)). For example:
2422 "``< i32 42, i32 11, i32 74, i32 100 >``". Vector constants
2423 must have :ref:`vector type <t_vector>`, and the number and types of
2424 elements must match those specified by the type.
2425 **Zero initialization**
2426 The string '``zeroinitializer``' can be used to zero initialize a
2427 value to zero of *any* type, including scalar and
2428 :ref:`aggregate <t_aggregate>` types. This is often used to avoid
2429 having to print large zero initializers (e.g. for large arrays) and
2430 is always exactly equivalent to using explicit zero initializers.
2432 A metadata node is a constant tuple without types. For example:
2433 "``!{!0, !{!2, !0}, !"test"}``". Metadata can reference constant values,
2434 for example: "``!{!0, i32 0, i8* @global, i64 (i64)* @function, !"str"}``".
2435 Unlike other typed constants that are meant to be interpreted as part of
2436 the instruction stream, metadata is a place to attach additional
2437 information such as debug info.
2439 Global Variable and Function Addresses
2440 --------------------------------------
2442 The addresses of :ref:`global variables <globalvars>` and
2443 :ref:`functions <functionstructure>` are always implicitly valid
2444 (link-time) constants. These constants are explicitly referenced when
2445 the :ref:`identifier for the global <identifiers>` is used and always have
2446 :ref:`pointer <t_pointer>` type. For example, the following is a legal LLVM
2449 .. code-block:: llvm
2453 @Z = global [2 x i32*] [ i32* @X, i32* @Y ]
2460 The string '``undef``' can be used anywhere a constant is expected, and
2461 indicates that the user of the value may receive an unspecified
2462 bit-pattern. Undefined values may be of any type (other than '``label``'
2463 or '``void``') and be used anywhere a constant is permitted.
2465 Undefined values are useful because they indicate to the compiler that
2466 the program is well defined no matter what value is used. This gives the
2467 compiler more freedom to optimize. Here are some examples of
2468 (potentially surprising) transformations that are valid (in pseudo IR):
2470 .. code-block:: llvm
2480 This is safe because all of the output bits are affected by the undef
2481 bits. Any output bit can have a zero or one depending on the input bits.
2483 .. code-block:: llvm
2494 These logical operations have bits that are not always affected by the
2495 input. For example, if ``%X`` has a zero bit, then the output of the
2496 '``and``' operation will always be a zero for that bit, no matter what
2497 the corresponding bit from the '``undef``' is. As such, it is unsafe to
2498 optimize or assume that the result of the '``and``' is '``undef``'.
2499 However, it is safe to assume that all bits of the '``undef``' could be
2500 0, and optimize the '``and``' to 0. Likewise, it is safe to assume that
2501 all the bits of the '``undef``' operand to the '``or``' could be set,
2502 allowing the '``or``' to be folded to -1.
2504 .. code-block:: llvm
2506 %A = select undef, %X, %Y
2507 %B = select undef, 42, %Y
2508 %C = select %X, %Y, undef
2518 This set of examples shows that undefined '``select``' (and conditional
2519 branch) conditions can go *either way*, but they have to come from one
2520 of the two operands. In the ``%A`` example, if ``%X`` and ``%Y`` were
2521 both known to have a clear low bit, then ``%A`` would have to have a
2522 cleared low bit. However, in the ``%C`` example, the optimizer is
2523 allowed to assume that the '``undef``' operand could be the same as
2524 ``%Y``, allowing the whole '``select``' to be eliminated.
2526 .. code-block:: llvm
2528 %A = xor undef, undef
2545 This example points out that two '``undef``' operands are not
2546 necessarily the same. This can be surprising to people (and also matches
2547 C semantics) where they assume that "``X^X``" is always zero, even if
2548 ``X`` is undefined. This isn't true for a number of reasons, but the
2549 short answer is that an '``undef``' "variable" can arbitrarily change
2550 its value over its "live range". This is true because the variable
2551 doesn't actually *have a live range*. Instead, the value is logically
2552 read from arbitrary registers that happen to be around when needed, so
2553 the value is not necessarily consistent over time. In fact, ``%A`` and
2554 ``%C`` need to have the same semantics or the core LLVM "replace all
2555 uses with" concept would not hold.
2557 .. code-block:: llvm
2565 These examples show the crucial difference between an *undefined value*
2566 and *undefined behavior*. An undefined value (like '``undef``') is
2567 allowed to have an arbitrary bit-pattern. This means that the ``%A``
2568 operation can be constant folded to '``undef``', because the '``undef``'
2569 could be an SNaN, and ``fdiv`` is not (currently) defined on SNaN's.
2570 However, in the second example, we can make a more aggressive
2571 assumption: because the ``undef`` is allowed to be an arbitrary value,
2572 we are allowed to assume that it could be zero. Since a divide by zero
2573 has *undefined behavior*, we are allowed to assume that the operation
2574 does not execute at all. This allows us to delete the divide and all
2575 code after it. Because the undefined operation "can't happen", the
2576 optimizer can assume that it occurs in dead code.
2578 .. code-block:: llvm
2580 a: store undef -> %X
2581 b: store %X -> undef
2586 These examples reiterate the ``fdiv`` example: a store *of* an undefined
2587 value can be assumed to not have any effect; we can assume that the
2588 value is overwritten with bits that happen to match what was already
2589 there. However, a store *to* an undefined location could clobber
2590 arbitrary memory, therefore, it has undefined behavior.
2597 Poison values are similar to :ref:`undef values <undefvalues>`, however
2598 they also represent the fact that an instruction or constant expression
2599 that cannot evoke side effects has nevertheless detected a condition
2600 that results in undefined behavior.
2602 There is currently no way of representing a poison value in the IR; they
2603 only exist when produced by operations such as :ref:`add <i_add>` with
2606 Poison value behavior is defined in terms of value *dependence*:
2608 - Values other than :ref:`phi <i_phi>` nodes depend on their operands.
2609 - :ref:`Phi <i_phi>` nodes depend on the operand corresponding to
2610 their dynamic predecessor basic block.
2611 - Function arguments depend on the corresponding actual argument values
2612 in the dynamic callers of their functions.
2613 - :ref:`Call <i_call>` instructions depend on the :ref:`ret <i_ret>`
2614 instructions that dynamically transfer control back to them.
2615 - :ref:`Invoke <i_invoke>` instructions depend on the
2616 :ref:`ret <i_ret>`, :ref:`resume <i_resume>`, or exception-throwing
2617 call instructions that dynamically transfer control back to them.
2618 - Non-volatile loads and stores depend on the most recent stores to all
2619 of the referenced memory addresses, following the order in the IR
2620 (including loads and stores implied by intrinsics such as
2621 :ref:`@llvm.memcpy <int_memcpy>`.)
2622 - An instruction with externally visible side effects depends on the
2623 most recent preceding instruction with externally visible side
2624 effects, following the order in the IR. (This includes :ref:`volatile
2625 operations <volatile>`.)
2626 - An instruction *control-depends* on a :ref:`terminator
2627 instruction <terminators>` if the terminator instruction has
2628 multiple successors and the instruction is always executed when
2629 control transfers to one of the successors, and may not be executed
2630 when control is transferred to another.
2631 - Additionally, an instruction also *control-depends* on a terminator
2632 instruction if the set of instructions it otherwise depends on would
2633 be different if the terminator had transferred control to a different
2635 - Dependence is transitive.
2637 Poison values have the same behavior as :ref:`undef values <undefvalues>`,
2638 with the additional effect that any instruction that has a *dependence*
2639 on a poison value has undefined behavior.
2641 Here are some examples:
2643 .. code-block:: llvm
2646 %poison = sub nuw i32 0, 1 ; Results in a poison value.
2647 %still_poison = and i32 %poison, 0 ; 0, but also poison.
2648 %poison_yet_again = getelementptr i32, i32* @h, i32 %still_poison
2649 store i32 0, i32* %poison_yet_again ; memory at @h[0] is poisoned
2651 store i32 %poison, i32* @g ; Poison value stored to memory.
2652 %poison2 = load i32, i32* @g ; Poison value loaded back from memory.
2654 store volatile i32 %poison, i32* @g ; External observation; undefined behavior.
2656 %narrowaddr = bitcast i32* @g to i16*
2657 %wideaddr = bitcast i32* @g to i64*
2658 %poison3 = load i16, i16* %narrowaddr ; Returns a poison value.
2659 %poison4 = load i64, i64* %wideaddr ; Returns a poison value.
2661 %cmp = icmp slt i32 %poison, 0 ; Returns a poison value.
2662 br i1 %cmp, label %true, label %end ; Branch to either destination.
2665 store volatile i32 0, i32* @g ; This is control-dependent on %cmp, so
2666 ; it has undefined behavior.
2670 %p = phi i32 [ 0, %entry ], [ 1, %true ]
2671 ; Both edges into this PHI are
2672 ; control-dependent on %cmp, so this
2673 ; always results in a poison value.
2675 store volatile i32 0, i32* @g ; This would depend on the store in %true
2676 ; if %cmp is true, or the store in %entry
2677 ; otherwise, so this is undefined behavior.
2679 br i1 %cmp, label %second_true, label %second_end
2680 ; The same branch again, but this time the
2681 ; true block doesn't have side effects.
2688 store volatile i32 0, i32* @g ; This time, the instruction always depends
2689 ; on the store in %end. Also, it is
2690 ; control-equivalent to %end, so this is
2691 ; well-defined (ignoring earlier undefined
2692 ; behavior in this example).
2696 Addresses of Basic Blocks
2697 -------------------------
2699 ``blockaddress(@function, %block)``
2701 The '``blockaddress``' constant computes the address of the specified
2702 basic block in the specified function, and always has an ``i8*`` type.
2703 Taking the address of the entry block is illegal.
2705 This value only has defined behavior when used as an operand to the
2706 ':ref:`indirectbr <i_indirectbr>`' instruction, or for comparisons
2707 against null. Pointer equality tests between labels addresses results in
2708 undefined behavior --- though, again, comparison against null is ok, and
2709 no label is equal to the null pointer. This may be passed around as an
2710 opaque pointer sized value as long as the bits are not inspected. This
2711 allows ``ptrtoint`` and arithmetic to be performed on these values so
2712 long as the original value is reconstituted before the ``indirectbr``
2715 Finally, some targets may provide defined semantics when using the value
2716 as the operand to an inline assembly, but that is target specific.
2720 Constant Expressions
2721 --------------------
2723 Constant expressions are used to allow expressions involving other
2724 constants to be used as constants. Constant expressions may be of any
2725 :ref:`first class <t_firstclass>` type and may involve any LLVM operation
2726 that does not have side effects (e.g. load and call are not supported).
2727 The following is the syntax for constant expressions:
2729 ``trunc (CST to TYPE)``
2730 Truncate a constant to another type. The bit size of CST must be
2731 larger than the bit size of TYPE. Both types must be integers.
2732 ``zext (CST to TYPE)``
2733 Zero extend a constant to another type. The bit size of CST must be
2734 smaller than the bit size of TYPE. Both types must be integers.
2735 ``sext (CST to TYPE)``
2736 Sign extend a constant to another type. The bit size of CST must be
2737 smaller than the bit size of TYPE. Both types must be integers.
2738 ``fptrunc (CST to TYPE)``
2739 Truncate a floating point constant to another floating point type.
2740 The size of CST must be larger than the size of TYPE. Both types
2741 must be floating point.
2742 ``fpext (CST to TYPE)``
2743 Floating point extend a constant to another type. The size of CST
2744 must be smaller or equal to the size of TYPE. Both types must be
2746 ``fptoui (CST to TYPE)``
2747 Convert a floating point constant to the corresponding unsigned
2748 integer constant. TYPE must be a scalar or vector integer type. CST
2749 must be of scalar or vector floating point type. Both CST and TYPE
2750 must be scalars, or vectors of the same number of elements. If the
2751 value won't fit in the integer type, the results are undefined.
2752 ``fptosi (CST to TYPE)``
2753 Convert a floating point constant to the corresponding signed
2754 integer constant. TYPE must be a scalar or vector integer type. CST
2755 must be of scalar or vector floating point type. Both CST and TYPE
2756 must be scalars, or vectors of the same number of elements. If the
2757 value won't fit in the integer type, the results are undefined.
2758 ``uitofp (CST to TYPE)``
2759 Convert an unsigned integer constant to the corresponding floating
2760 point constant. TYPE must be a scalar or vector floating point type.
2761 CST must be of scalar or vector integer type. Both CST and TYPE must
2762 be scalars, or vectors of the same number of elements. If the value
2763 won't fit in the floating point type, the results are undefined.
2764 ``sitofp (CST to TYPE)``
2765 Convert a signed integer constant to the corresponding floating
2766 point constant. TYPE must be a scalar or vector floating point type.
2767 CST must be of scalar or vector integer type. Both CST and TYPE must
2768 be scalars, or vectors of the same number of elements. If the value
2769 won't fit in the floating point type, the results are undefined.
2770 ``ptrtoint (CST to TYPE)``
2771 Convert a pointer typed constant to the corresponding integer
2772 constant. ``TYPE`` must be an integer type. ``CST`` must be of
2773 pointer type. The ``CST`` value is zero extended, truncated, or
2774 unchanged to make it fit in ``TYPE``.
2775 ``inttoptr (CST to TYPE)``
2776 Convert an integer constant to a pointer constant. TYPE must be a
2777 pointer type. CST must be of integer type. The CST value is zero
2778 extended, truncated, or unchanged to make it fit in a pointer size.
2779 This one is *really* dangerous!
2780 ``bitcast (CST to TYPE)``
2781 Convert a constant, CST, to another TYPE. The constraints of the
2782 operands are the same as those for the :ref:`bitcast
2783 instruction <i_bitcast>`.
2784 ``addrspacecast (CST to TYPE)``
2785 Convert a constant pointer or constant vector of pointer, CST, to another
2786 TYPE in a different address space. The constraints of the operands are the
2787 same as those for the :ref:`addrspacecast instruction <i_addrspacecast>`.
2788 ``getelementptr (TY, CSTPTR, IDX0, IDX1, ...)``, ``getelementptr inbounds (TY, CSTPTR, IDX0, IDX1, ...)``
2789 Perform the :ref:`getelementptr operation <i_getelementptr>` on
2790 constants. As with the :ref:`getelementptr <i_getelementptr>`
2791 instruction, the index list may have zero or more indexes, which are
2792 required to make sense for the type of "pointer to TY".
2793 ``select (COND, VAL1, VAL2)``
2794 Perform the :ref:`select operation <i_select>` on constants.
2795 ``icmp COND (VAL1, VAL2)``
2796 Performs the :ref:`icmp operation <i_icmp>` on constants.
2797 ``fcmp COND (VAL1, VAL2)``
2798 Performs the :ref:`fcmp operation <i_fcmp>` on constants.
2799 ``extractelement (VAL, IDX)``
2800 Perform the :ref:`extractelement operation <i_extractelement>` on
2802 ``insertelement (VAL, ELT, IDX)``
2803 Perform the :ref:`insertelement operation <i_insertelement>` on
2805 ``shufflevector (VEC1, VEC2, IDXMASK)``
2806 Perform the :ref:`shufflevector operation <i_shufflevector>` on
2808 ``extractvalue (VAL, IDX0, IDX1, ...)``
2809 Perform the :ref:`extractvalue operation <i_extractvalue>` on
2810 constants. The index list is interpreted in a similar manner as
2811 indices in a ':ref:`getelementptr <i_getelementptr>`' operation. At
2812 least one index value must be specified.
2813 ``insertvalue (VAL, ELT, IDX0, IDX1, ...)``
2814 Perform the :ref:`insertvalue operation <i_insertvalue>` on constants.
2815 The index list is interpreted in a similar manner as indices in a
2816 ':ref:`getelementptr <i_getelementptr>`' operation. At least one index
2817 value must be specified.
2818 ``OPCODE (LHS, RHS)``
2819 Perform the specified operation of the LHS and RHS constants. OPCODE
2820 may be any of the :ref:`binary <binaryops>` or :ref:`bitwise
2821 binary <bitwiseops>` operations. The constraints on operands are
2822 the same as those for the corresponding instruction (e.g. no bitwise
2823 operations on floating point values are allowed).
2830 Inline Assembler Expressions
2831 ----------------------------
2833 LLVM supports inline assembler expressions (as opposed to :ref:`Module-Level
2834 Inline Assembly <moduleasm>`) through the use of a special value. This value
2835 represents the inline assembler as a template string (containing the
2836 instructions to emit), a list of operand constraints (stored as a string), a
2837 flag that indicates whether or not the inline asm expression has side effects,
2838 and a flag indicating whether the function containing the asm needs to align its
2839 stack conservatively.
2841 The template string supports argument substitution of the operands using "``$``"
2842 followed by a number, to indicate substitution of the given register/memory
2843 location, as specified by the constraint string. "``${NUM:MODIFIER}``" may also
2844 be used, where ``MODIFIER`` is a target-specific annotation for how to print the
2845 operand (See :ref:`inline-asm-modifiers`).
2847 A literal "``$``" may be included by using "``$$``" in the template. To include
2848 other special characters into the output, the usual "``\XX``" escapes may be
2849 used, just as in other strings. Note that after template substitution, the
2850 resulting assembly string is parsed by LLVM's integrated assembler unless it is
2851 disabled -- even when emitting a ``.s`` file -- and thus must contain assembly
2852 syntax known to LLVM.
2854 LLVM's support for inline asm is modeled closely on the requirements of Clang's
2855 GCC-compatible inline-asm support. Thus, the feature-set and the constraint and
2856 modifier codes listed here are similar or identical to those in GCC's inline asm
2857 support. However, to be clear, the syntax of the template and constraint strings
2858 described here is *not* the same as the syntax accepted by GCC and Clang, and,
2859 while most constraint letters are passed through as-is by Clang, some get
2860 translated to other codes when converting from the C source to the LLVM
2863 An example inline assembler expression is:
2865 .. code-block:: llvm
2867 i32 (i32) asm "bswap $0", "=r,r"
2869 Inline assembler expressions may **only** be used as the callee operand
2870 of a :ref:`call <i_call>` or an :ref:`invoke <i_invoke>` instruction.
2871 Thus, typically we have:
2873 .. code-block:: llvm
2875 %X = call i32 asm "bswap $0", "=r,r"(i32 %Y)
2877 Inline asms with side effects not visible in the constraint list must be
2878 marked as having side effects. This is done through the use of the
2879 '``sideeffect``' keyword, like so:
2881 .. code-block:: llvm
2883 call void asm sideeffect "eieio", ""()
2885 In some cases inline asms will contain code that will not work unless
2886 the stack is aligned in some way, such as calls or SSE instructions on
2887 x86, yet will not contain code that does that alignment within the asm.
2888 The compiler should make conservative assumptions about what the asm
2889 might contain and should generate its usual stack alignment code in the
2890 prologue if the '``alignstack``' keyword is present:
2892 .. code-block:: llvm
2894 call void asm alignstack "eieio", ""()
2896 Inline asms also support using non-standard assembly dialects. The
2897 assumed dialect is ATT. When the '``inteldialect``' keyword is present,
2898 the inline asm is using the Intel dialect. Currently, ATT and Intel are
2899 the only supported dialects. An example is:
2901 .. code-block:: llvm
2903 call void asm inteldialect "eieio", ""()
2905 If multiple keywords appear the '``sideeffect``' keyword must come
2906 first, the '``alignstack``' keyword second and the '``inteldialect``'
2909 Inline Asm Constraint String
2910 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
2912 The constraint list is a comma-separated string, each element containing one or
2913 more constraint codes.
2915 For each element in the constraint list an appropriate register or memory
2916 operand will be chosen, and it will be made available to assembly template
2917 string expansion as ``$0`` for the first constraint in the list, ``$1`` for the
2920 There are three different types of constraints, which are distinguished by a
2921 prefix symbol in front of the constraint code: Output, Input, and Clobber. The
2922 constraints must always be given in that order: outputs first, then inputs, then
2923 clobbers. They cannot be intermingled.
2925 There are also three different categories of constraint codes:
2927 - Register constraint. This is either a register class, or a fixed physical
2928 register. This kind of constraint will allocate a register, and if necessary,
2929 bitcast the argument or result to the appropriate type.
2930 - Memory constraint. This kind of constraint is for use with an instruction
2931 taking a memory operand. Different constraints allow for different addressing
2932 modes used by the target.
2933 - Immediate value constraint. This kind of constraint is for an integer or other
2934 immediate value which can be rendered directly into an instruction. The
2935 various target-specific constraints allow the selection of a value in the
2936 proper range for the instruction you wish to use it with.
2941 Output constraints are specified by an "``=``" prefix (e.g. "``=r``"). This
2942 indicates that the assembly will write to this operand, and the operand will
2943 then be made available as a return value of the ``asm`` expression. Output
2944 constraints do not consume an argument from the call instruction. (Except, see
2945 below about indirect outputs).
2947 Normally, it is expected that no output locations are written to by the assembly
2948 expression until *all* of the inputs have been read. As such, LLVM may assign
2949 the same register to an output and an input. If this is not safe (e.g. if the
2950 assembly contains two instructions, where the first writes to one output, and
2951 the second reads an input and writes to a second output), then the "``&``"
2952 modifier must be used (e.g. "``=&r``") to specify that the output is an
2953 "early-clobber" output. Marking an ouput as "early-clobber" ensures that LLVM
2954 will not use the same register for any inputs (other than an input tied to this
2960 Input constraints do not have a prefix -- just the constraint codes. Each input
2961 constraint will consume one argument from the call instruction. It is not
2962 permitted for the asm to write to any input register or memory location (unless
2963 that input is tied to an output). Note also that multiple inputs may all be
2964 assigned to the same register, if LLVM can determine that they necessarily all
2965 contain the same value.
2967 Instead of providing a Constraint Code, input constraints may also "tie"
2968 themselves to an output constraint, by providing an integer as the constraint
2969 string. Tied inputs still consume an argument from the call instruction, and
2970 take up a position in the asm template numbering as is usual -- they will simply
2971 be constrained to always use the same register as the output they've been tied
2972 to. For example, a constraint string of "``=r,0``" says to assign a register for
2973 output, and use that register as an input as well (it being the 0'th
2976 It is permitted to tie an input to an "early-clobber" output. In that case, no
2977 *other* input may share the same register as the input tied to the early-clobber
2978 (even when the other input has the same value).
2980 You may only tie an input to an output which has a register constraint, not a
2981 memory constraint. Only a single input may be tied to an output.
2983 There is also an "interesting" feature which deserves a bit of explanation: if a
2984 register class constraint allocates a register which is too small for the value
2985 type operand provided as input, the input value will be split into multiple
2986 registers, and all of them passed to the inline asm.
2988 However, this feature is often not as useful as you might think.
2990 Firstly, the registers are *not* guaranteed to be consecutive. So, on those
2991 architectures that have instructions which operate on multiple consecutive
2992 instructions, this is not an appropriate way to support them. (e.g. the 32-bit
2993 SparcV8 has a 64-bit load, which instruction takes a single 32-bit register. The
2994 hardware then loads into both the named register, and the next register. This
2995 feature of inline asm would not be useful to support that.)
2997 A few of the targets provide a template string modifier allowing explicit access
2998 to the second register of a two-register operand (e.g. MIPS ``L``, ``M``, and
2999 ``D``). On such an architecture, you can actually access the second allocated
3000 register (yet, still, not any subsequent ones). But, in that case, you're still
3001 probably better off simply splitting the value into two separate operands, for
3002 clarity. (e.g. see the description of the ``A`` constraint on X86, which,
3003 despite existing only for use with this feature, is not really a good idea to
3006 Indirect inputs and outputs
3007 """""""""""""""""""""""""""
3009 Indirect output or input constraints can be specified by the "``*``" modifier
3010 (which goes after the "``=``" in case of an output). This indicates that the asm
3011 will write to or read from the contents of an *address* provided as an input
3012 argument. (Note that in this way, indirect outputs act more like an *input* than
3013 an output: just like an input, they consume an argument of the call expression,
3014 rather than producing a return value. An indirect output constraint is an
3015 "output" only in that the asm is expected to write to the contents of the input
3016 memory location, instead of just read from it).
3018 This is most typically used for memory constraint, e.g. "``=*m``", to pass the
3019 address of a variable as a value.
3021 It is also possible to use an indirect *register* constraint, but only on output
3022 (e.g. "``=*r``"). This will cause LLVM to allocate a register for an output
3023 value normally, and then, separately emit a store to the address provided as
3024 input, after the provided inline asm. (It's not clear what value this
3025 functionality provides, compared to writing the store explicitly after the asm
3026 statement, and it can only produce worse code, since it bypasses many
3027 optimization passes. I would recommend not using it.)
3033 A clobber constraint is indicated by a "``~``" prefix. A clobber does not
3034 consume an input operand, nor generate an output. Clobbers cannot use any of the
3035 general constraint code letters -- they may use only explicit register
3036 constraints, e.g. "``~{eax}``". The one exception is that a clobber string of
3037 "``~{memory}``" indicates that the assembly writes to arbitrary undeclared
3038 memory locations -- not only the memory pointed to by a declared indirect
3044 After a potential prefix comes constraint code, or codes.
3046 A Constraint Code is either a single letter (e.g. "``r``"), a "``^``" character
3047 followed by two letters (e.g. "``^wc``"), or "``{``" register-name "``}``"
3050 The one and two letter constraint codes are typically chosen to be the same as
3051 GCC's constraint codes.
3053 A single constraint may include one or more than constraint code in it, leaving
3054 it up to LLVM to choose which one to use. This is included mainly for
3055 compatibility with the translation of GCC inline asm coming from clang.
3057 There are two ways to specify alternatives, and either or both may be used in an
3058 inline asm constraint list:
3060 1) Append the codes to each other, making a constraint code set. E.g. "``im``"
3061 or "``{eax}m``". This means "choose any of the options in the set". The
3062 choice of constraint is made independently for each constraint in the
3065 2) Use "``|``" between constraint code sets, creating alternatives. Every
3066 constraint in the constraint list must have the same number of alternative
3067 sets. With this syntax, the same alternative in *all* of the items in the
3068 constraint list will be chosen together.
3070 Putting those together, you might have a two operand constraint string like
3071 ``"rm|r,ri|rm"``. This indicates that if operand 0 is ``r`` or ``m``, then
3072 operand 1 may be one of ``r`` or ``i``. If operand 0 is ``r``, then operand 1
3073 may be one of ``r`` or ``m``. But, operand 0 and 1 cannot both be of type m.
3075 However, the use of either of the alternatives features is *NOT* recommended, as
3076 LLVM is not able to make an intelligent choice about which one to use. (At the
3077 point it currently needs to choose, not enough information is available to do so
3078 in a smart way.) Thus, it simply tries to make a choice that's most likely to
3079 compile, not one that will be optimal performance. (e.g., given "``rm``", it'll
3080 always choose to use memory, not registers). And, if given multiple registers,
3081 or multiple register classes, it will simply choose the first one. (In fact, it
3082 doesn't currently even ensure explicitly specified physical registers are
3083 unique, so specifying multiple physical registers as alternatives, like
3084 ``{r11}{r12},{r11}{r12}``, will assign r11 to both operands, not at all what was
3087 Supported Constraint Code List
3088 """"""""""""""""""""""""""""""
3090 The constraint codes are, in general, expected to behave the same way they do in
3091 GCC. LLVM's support is often implemented on an 'as-needed' basis, to support C
3092 inline asm code which was supported by GCC. A mismatch in behavior between LLVM
3093 and GCC likely indicates a bug in LLVM.
3095 Some constraint codes are typically supported by all targets:
3097 - ``r``: A register in the target's general purpose register class.
3098 - ``m``: A memory address operand. It is target-specific what addressing modes
3099 are supported, typical examples are register, or register + register offset,
3100 or register + immediate offset (of some target-specific size).
3101 - ``i``: An integer constant (of target-specific width). Allows either a simple
3102 immediate, or a relocatable value.
3103 - ``n``: An integer constant -- *not* including relocatable values.
3104 - ``s``: An integer constant, but allowing *only* relocatable values.
3105 - ``X``: Allows an operand of any kind, no constraint whatsoever. Typically
3106 useful to pass a label for an asm branch or call.
3108 .. FIXME: but that surely isn't actually okay to jump out of an asm
3109 block without telling llvm about the control transfer???)
3111 - ``{register-name}``: Requires exactly the named physical register.
3113 Other constraints are target-specific:
3117 - ``z``: An immediate integer 0. Outputs ``WZR`` or ``XZR``, as appropriate.
3118 - ``I``: An immediate integer valid for an ``ADD`` or ``SUB`` instruction,
3119 i.e. 0 to 4095 with optional shift by 12.
3120 - ``J``: An immediate integer that, when negated, is valid for an ``ADD`` or
3121 ``SUB`` instruction, i.e. -1 to -4095 with optional left shift by 12.
3122 - ``K``: An immediate integer that is valid for the 'bitmask immediate 32' of a
3123 logical instruction like ``AND``, ``EOR``, or ``ORR`` with a 32-bit register.
3124 - ``L``: An immediate integer that is valid for the 'bitmask immediate 64' of a
3125 logical instruction like ``AND``, ``EOR``, or ``ORR`` with a 64-bit register.
3126 - ``M``: An immediate integer for use with the ``MOV`` assembly alias on a
3127 32-bit register. This is a superset of ``K``: in addition to the bitmask
3128 immediate, also allows immediate integers which can be loaded with a single
3129 ``MOVZ`` or ``MOVL`` instruction.
3130 - ``N``: An immediate integer for use with the ``MOV`` assembly alias on a
3131 64-bit register. This is a superset of ``L``.
3132 - ``Q``: Memory address operand must be in a single register (no
3133 offsets). (However, LLVM currently does this for the ``m`` constraint as
3135 - ``r``: A 32 or 64-bit integer register (W* or X*).
3136 - ``w``: A 32, 64, or 128-bit floating-point/SIMD register.
3137 - ``x``: A lower 128-bit floating-point/SIMD register (``V0`` to ``V15``).
3141 - ``r``: A 32 or 64-bit integer register.
3142 - ``[0-9]v``: The 32-bit VGPR register, number 0-9.
3143 - ``[0-9]s``: The 32-bit SGPR register, number 0-9.
3148 - ``Q``, ``Um``, ``Un``, ``Uq``, ``Us``, ``Ut``, ``Uv``, ``Uy``: Memory address
3149 operand. Treated the same as operand ``m``, at the moment.
3151 ARM and ARM's Thumb2 mode:
3153 - ``j``: An immediate integer between 0 and 65535 (valid for ``MOVW``)
3154 - ``I``: An immediate integer valid for a data-processing instruction.
3155 - ``J``: An immediate integer between -4095 and 4095.
3156 - ``K``: An immediate integer whose bitwise inverse is valid for a
3157 data-processing instruction. (Can be used with template modifier "``B``" to
3158 print the inverted value).
3159 - ``L``: An immediate integer whose negation is valid for a data-processing
3160 instruction. (Can be used with template modifier "``n``" to print the negated
3162 - ``M``: A power of two or a integer between 0 and 32.
3163 - ``N``: Invalid immediate constraint.
3164 - ``O``: Invalid immediate constraint.
3165 - ``r``: A general-purpose 32-bit integer register (``r0-r15``).
3166 - ``l``: In Thumb2 mode, low 32-bit GPR registers (``r0-r7``). In ARM mode, same
3168 - ``h``: In Thumb2 mode, a high 32-bit GPR register (``r8-r15``). In ARM mode,
3170 - ``w``: A 32, 64, or 128-bit floating-point/SIMD register: ``s0-s31``,
3171 ``d0-d31``, or ``q0-q15``.
3172 - ``x``: A 32, 64, or 128-bit floating-point/SIMD register: ``s0-s15``,
3173 ``d0-d7``, or ``q0-q3``.
3174 - ``t``: A floating-point/SIMD register, only supports 32-bit values:
3179 - ``I``: An immediate integer between 0 and 255.
3180 - ``J``: An immediate integer between -255 and -1.
3181 - ``K``: An immediate integer between 0 and 255, with optional left-shift by
3183 - ``L``: An immediate integer between -7 and 7.
3184 - ``M``: An immediate integer which is a multiple of 4 between 0 and 1020.
3185 - ``N``: An immediate integer between 0 and 31.
3186 - ``O``: An immediate integer which is a multiple of 4 between -508 and 508.
3187 - ``r``: A low 32-bit GPR register (``r0-r7``).
3188 - ``l``: A low 32-bit GPR register (``r0-r7``).
3189 - ``h``: A high GPR register (``r0-r7``).
3190 - ``w``: A 32, 64, or 128-bit floating-point/SIMD register: ``s0-s31``,
3191 ``d0-d31``, or ``q0-q15``.
3192 - ``x``: A 32, 64, or 128-bit floating-point/SIMD register: ``s0-s15``,
3193 ``d0-d7``, or ``q0-q3``.
3194 - ``t``: A floating-point/SIMD register, only supports 32-bit values:
3200 - ``o``, ``v``: A memory address operand, treated the same as constraint ``m``,
3202 - ``r``: A 32 or 64-bit register.
3206 - ``r``: An 8 or 16-bit register.
3210 - ``I``: An immediate signed 16-bit integer.
3211 - ``J``: An immediate integer zero.
3212 - ``K``: An immediate unsigned 16-bit integer.
3213 - ``L``: An immediate 32-bit integer, where the lower 16 bits are 0.
3214 - ``N``: An immediate integer between -65535 and -1.
3215 - ``O``: An immediate signed 15-bit integer.
3216 - ``P``: An immediate integer between 1 and 65535.
3217 - ``m``: A memory address operand. In MIPS-SE mode, allows a base address
3218 register plus 16-bit immediate offset. In MIPS mode, just a base register.
3219 - ``R``: A memory address operand. In MIPS-SE mode, allows a base address
3220 register plus a 9-bit signed offset. In MIPS mode, the same as constraint
3222 - ``ZC``: A memory address operand, suitable for use in a ``pref``, ``ll``, or
3223 ``sc`` instruction on the given subtarget (details vary).
3224 - ``r``, ``d``, ``y``: A 32 or 64-bit GPR register.
3225 - ``f``: A 32 or 64-bit FPU register (``F0-F31``), or a 128-bit MSA register
3226 (``W0-W31``). In the case of MSA registers, it is recommended to use the ``w``
3227 argument modifier for compatibility with GCC.
3228 - ``c``: A 32-bit or 64-bit GPR register suitable for indirect jump (always
3230 - ``l``: The ``lo`` register, 32 or 64-bit.
3235 - ``b``: A 1-bit integer register.
3236 - ``c`` or ``h``: A 16-bit integer register.
3237 - ``r``: A 32-bit integer register.
3238 - ``l`` or ``N``: A 64-bit integer register.
3239 - ``f``: A 32-bit float register.
3240 - ``d``: A 64-bit float register.
3245 - ``I``: An immediate signed 16-bit integer.
3246 - ``J``: An immediate unsigned 16-bit integer, shifted left 16 bits.
3247 - ``K``: An immediate unsigned 16-bit integer.
3248 - ``L``: An immediate signed 16-bit integer, shifted left 16 bits.
3249 - ``M``: An immediate integer greater than 31.
3250 - ``N``: An immediate integer that is an exact power of 2.
3251 - ``O``: The immediate integer constant 0.
3252 - ``P``: An immediate integer constant whose negation is a signed 16-bit
3254 - ``es``, ``o``, ``Q``, ``Z``, ``Zy``: A memory address operand, currently
3255 treated the same as ``m``.
3256 - ``r``: A 32 or 64-bit integer register.
3257 - ``b``: A 32 or 64-bit integer register, excluding ``R0`` (that is:
3259 - ``f``: A 32 or 64-bit float register (``F0-F31``), or when QPX is enabled, a
3260 128 or 256-bit QPX register (``Q0-Q31``; aliases the ``F`` registers).
3261 - ``v``: For ``4 x f32`` or ``4 x f64`` types, when QPX is enabled, a
3262 128 or 256-bit QPX register (``Q0-Q31``), otherwise a 128-bit
3263 altivec vector register (``V0-V31``).
3265 .. FIXME: is this a bug that v accepts QPX registers? I think this
3266 is supposed to only use the altivec vector registers?
3268 - ``y``: Condition register (``CR0-CR7``).
3269 - ``wc``: An individual CR bit in a CR register.
3270 - ``wa``, ``wd``, ``wf``: Any 128-bit VSX vector register, from the full VSX
3271 register set (overlapping both the floating-point and vector register files).
3272 - ``ws``: A 32 or 64-bit floating point register, from the full VSX register
3277 - ``I``: An immediate 13-bit signed integer.
3278 - ``r``: A 32-bit integer register.
3282 - ``I``: An immediate unsigned 8-bit integer.
3283 - ``J``: An immediate unsigned 12-bit integer.
3284 - ``K``: An immediate signed 16-bit integer.
3285 - ``L``: An immediate signed 20-bit integer.
3286 - ``M``: An immediate integer 0x7fffffff.
3287 - ``Q``, ``R``, ``S``, ``T``: A memory address operand, treated the same as
3288 ``m``, at the moment.
3289 - ``r`` or ``d``: A 32, 64, or 128-bit integer register.
3290 - ``a``: A 32, 64, or 128-bit integer address register (excludes R0, which in an
3291 address context evaluates as zero).
3292 - ``h``: A 32-bit value in the high part of a 64bit data register
3294 - ``f``: A 32, 64, or 128-bit floating point register.
3298 - ``I``: An immediate integer between 0 and 31.
3299 - ``J``: An immediate integer between 0 and 64.
3300 - ``K``: An immediate signed 8-bit integer.
3301 - ``L``: An immediate integer, 0xff or 0xffff or (in 64-bit mode only)
3303 - ``M``: An immediate integer between 0 and 3.
3304 - ``N``: An immediate unsigned 8-bit integer.
3305 - ``O``: An immediate integer between 0 and 127.
3306 - ``e``: An immediate 32-bit signed integer.
3307 - ``Z``: An immediate 32-bit unsigned integer.
3308 - ``o``, ``v``: Treated the same as ``m``, at the moment.
3309 - ``q``: An 8, 16, 32, or 64-bit register which can be accessed as an 8-bit
3310 ``l`` integer register. On X86-32, this is the ``a``, ``b``, ``c``, and ``d``
3311 registers, and on X86-64, it is all of the integer registers.
3312 - ``Q``: An 8, 16, 32, or 64-bit register which can be accessed as an 8-bit
3313 ``h`` integer register. This is the ``a``, ``b``, ``c``, and ``d`` registers.
3314 - ``r`` or ``l``: An 8, 16, 32, or 64-bit integer register.
3315 - ``R``: An 8, 16, 32, or 64-bit "legacy" integer register -- one which has
3316 existed since i386, and can be accessed without the REX prefix.
3317 - ``f``: A 32, 64, or 80-bit '387 FPU stack pseudo-register.
3318 - ``y``: A 64-bit MMX register, if MMX is enabled.
3319 - ``x``: If SSE is enabled: a 32 or 64-bit scalar operand, or 128-bit vector
3320 operand in a SSE register. If AVX is also enabled, can also be a 256-bit
3321 vector operand in an AVX register. If AVX-512 is also enabled, can also be a
3322 512-bit vector operand in an AVX512 register, Otherwise, an error.
3323 - ``Y``: The same as ``x``, if *SSE2* is enabled, otherwise an error.
3324 - ``A``: Special case: allocates EAX first, then EDX, for a single operand (in
3325 32-bit mode, a 64-bit integer operand will get split into two registers). It
3326 is not recommended to use this constraint, as in 64-bit mode, the 64-bit
3327 operand will get allocated only to RAX -- if two 32-bit operands are needed,
3328 you're better off splitting it yourself, before passing it to the asm
3333 - ``r``: A 32-bit integer register.
3336 .. _inline-asm-modifiers:
3338 Asm template argument modifiers
3339 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
3341 In the asm template string, modifiers can be used on the operand reference, like
3344 The modifiers are, in general, expected to behave the same way they do in
3345 GCC. LLVM's support is often implemented on an 'as-needed' basis, to support C
3346 inline asm code which was supported by GCC. A mismatch in behavior between LLVM
3347 and GCC likely indicates a bug in LLVM.
3351 - ``c``: Print an immediate integer constant unadorned, without
3352 the target-specific immediate punctuation (e.g. no ``$`` prefix).
3353 - ``n``: Negate and print immediate integer constant unadorned, without the
3354 target-specific immediate punctuation (e.g. no ``$`` prefix).
3355 - ``l``: Print as an unadorned label, without the target-specific label
3356 punctuation (e.g. no ``$`` prefix).
3360 - ``w``: Print a GPR register with a ``w*`` name instead of ``x*`` name. E.g.,
3361 instead of ``x30``, print ``w30``.
3362 - ``x``: Print a GPR register with a ``x*`` name. (this is the default, anyhow).
3363 - ``b``, ``h``, ``s``, ``d``, ``q``: Print a floating-point/SIMD register with a
3364 ``b*``, ``h*``, ``s*``, ``d*``, or ``q*`` name, rather than the default of
3373 - ``a``: Print an operand as an address (with ``[`` and ``]`` surrounding a
3377 - ``y``: Print a VFP single-precision register as an indexed double (e.g. print
3378 as ``d4[1]`` instead of ``s9``)
3379 - ``B``: Bitwise invert and print an immediate integer constant without ``#``
3381 - ``L``: Print the low 16-bits of an immediate integer constant.
3382 - ``M``: Print as a register set suitable for ldm/stm. Also prints *all*
3383 register operands subsequent to the specified one (!), so use carefully.
3384 - ``Q``: Print the low-order register of a register-pair, or the low-order
3385 register of a two-register operand.
3386 - ``R``: Print the high-order register of a register-pair, or the high-order
3387 register of a two-register operand.
3388 - ``H``: Print the second register of a register-pair. (On a big-endian system,
3389 ``H`` is equivalent to ``Q``, and on little-endian system, ``H`` is equivalent
3392 .. FIXME: H doesn't currently support printing the second register
3393 of a two-register operand.
3395 - ``e``: Print the low doubleword register of a NEON quad register.
3396 - ``f``: Print the high doubleword register of a NEON quad register.
3397 - ``m``: Print the base register of a memory operand without the ``[`` and ``]``
3402 - ``L``: Print the second register of a two-register operand. Requires that it
3403 has been allocated consecutively to the first.
3405 .. FIXME: why is it restricted to consecutive ones? And there's
3406 nothing that ensures that happens, is there?
3408 - ``I``: Print the letter 'i' if the operand is an integer constant, otherwise
3409 nothing. Used to print 'addi' vs 'add' instructions.
3413 No additional modifiers.
3417 - ``X``: Print an immediate integer as hexadecimal
3418 - ``x``: Print the low 16 bits of an immediate integer as hexadecimal.
3419 - ``d``: Print an immediate integer as decimal.
3420 - ``m``: Subtract one and print an immediate integer as decimal.
3421 - ``z``: Print $0 if an immediate zero, otherwise print normally.
3422 - ``L``: Print the low-order register of a two-register operand, or prints the
3423 address of the low-order word of a double-word memory operand.
3425 .. FIXME: L seems to be missing memory operand support.
3427 - ``M``: Print the high-order register of a two-register operand, or prints the
3428 address of the high-order word of a double-word memory operand.
3430 .. FIXME: M seems to be missing memory operand support.
3432 - ``D``: Print the second register of a two-register operand, or prints the
3433 second word of a double-word memory operand. (On a big-endian system, ``D`` is
3434 equivalent to ``L``, and on little-endian system, ``D`` is equivalent to
3436 - ``w``: No effect. Provided for compatibility with GCC which requires this
3437 modifier in order to print MSA registers (``W0-W31``) with the ``f``
3446 - ``L``: Print the second register of a two-register operand. Requires that it
3447 has been allocated consecutively to the first.
3449 .. FIXME: why is it restricted to consecutive ones? And there's
3450 nothing that ensures that happens, is there?
3452 - ``I``: Print the letter 'i' if the operand is an integer constant, otherwise
3453 nothing. Used to print 'addi' vs 'add' instructions.
3454 - ``y``: For a memory operand, prints formatter for a two-register X-form
3455 instruction. (Currently always prints ``r0,OPERAND``).
3456 - ``U``: Prints 'u' if the memory operand is an update form, and nothing
3457 otherwise. (NOTE: LLVM does not support update form, so this will currently
3458 always print nothing)
3459 - ``X``: Prints 'x' if the memory operand is an indexed form. (NOTE: LLVM does
3460 not support indexed form, so this will currently always print nothing)
3468 SystemZ implements only ``n``, and does *not* support any of the other
3469 target-independent modifiers.
3473 - ``c``: Print an unadorned integer or symbol name. (The latter is
3474 target-specific behavior for this typically target-independent modifier).
3475 - ``A``: Print a register name with a '``*``' before it.
3476 - ``b``: Print an 8-bit register name (e.g. ``al``); do nothing on a memory
3478 - ``h``: Print the upper 8-bit register name (e.g. ``ah``); do nothing on a
3480 - ``w``: Print the 16-bit register name (e.g. ``ax``); do nothing on a memory
3482 - ``k``: Print the 32-bit register name (e.g. ``eax``); do nothing on a memory
3484 - ``q``: Print the 64-bit register name (e.g. ``rax``), if 64-bit registers are
3485 available, otherwise the 32-bit register name; do nothing on a memory operand.
3486 - ``n``: Negate and print an unadorned integer, or, for operands other than an
3487 immediate integer (e.g. a relocatable symbol expression), print a '-' before
3488 the operand. (The behavior for relocatable symbol expressions is a
3489 target-specific behavior for this typically target-independent modifier)
3490 - ``H``: Print a memory reference with additional offset +8.
3491 - ``P``: Print a memory reference or operand for use as the argument of a call
3492 instruction. (E.g. omit ``(rip)``, even though it's PC-relative.)
3496 No additional modifiers.
3502 The call instructions that wrap inline asm nodes may have a
3503 "``!srcloc``" MDNode attached to it that contains a list of constant
3504 integers. If present, the code generator will use the integer as the
3505 location cookie value when report errors through the ``LLVMContext``
3506 error reporting mechanisms. This allows a front-end to correlate backend
3507 errors that occur with inline asm back to the source code that produced
3510 .. code-block:: llvm
3512 call void asm sideeffect "something bad", ""(), !srcloc !42
3514 !42 = !{ i32 1234567 }
3516 It is up to the front-end to make sense of the magic numbers it places
3517 in the IR. If the MDNode contains multiple constants, the code generator
3518 will use the one that corresponds to the line of the asm that the error
3526 LLVM IR allows metadata to be attached to instructions in the program
3527 that can convey extra information about the code to the optimizers and
3528 code generator. One example application of metadata is source-level
3529 debug information. There are two metadata primitives: strings and nodes.
3531 Metadata does not have a type, and is not a value. If referenced from a
3532 ``call`` instruction, it uses the ``metadata`` type.
3534 All metadata are identified in syntax by a exclamation point ('``!``').
3536 .. _metadata-string:
3538 Metadata Nodes and Metadata Strings
3539 -----------------------------------
3541 A metadata string is a string surrounded by double quotes. It can
3542 contain any character by escaping non-printable characters with
3543 "``\xx``" where "``xx``" is the two digit hex code. For example:
3546 Metadata nodes are represented with notation similar to structure
3547 constants (a comma separated list of elements, surrounded by braces and
3548 preceded by an exclamation point). Metadata nodes can have any values as
3549 their operand. For example:
3551 .. code-block:: llvm
3553 !{ !"test\00", i32 10}
3555 Metadata nodes that aren't uniqued use the ``distinct`` keyword. For example:
3557 .. code-block:: llvm
3559 !0 = distinct !{!"test\00", i32 10}
3561 ``distinct`` nodes are useful when nodes shouldn't be merged based on their
3562 content. They can also occur when transformations cause uniquing collisions
3563 when metadata operands change.
3565 A :ref:`named metadata <namedmetadatastructure>` is a collection of
3566 metadata nodes, which can be looked up in the module symbol table. For
3569 .. code-block:: llvm
3573 Metadata can be used as function arguments. Here ``llvm.dbg.value``
3574 function is using two metadata arguments:
3576 .. code-block:: llvm
3578 call void @llvm.dbg.value(metadata !24, i64 0, metadata !25)
3580 Metadata can be attached with an instruction. Here metadata ``!21`` is
3581 attached to the ``add`` instruction using the ``!dbg`` identifier:
3583 .. code-block:: llvm
3585 %indvar.next = add i64 %indvar, 1, !dbg !21
3587 More information about specific metadata nodes recognized by the
3588 optimizers and code generator is found below.
3590 .. _specialized-metadata:
3592 Specialized Metadata Nodes
3593 ^^^^^^^^^^^^^^^^^^^^^^^^^^
3595 Specialized metadata nodes are custom data structures in metadata (as opposed
3596 to generic tuples). Their fields are labelled, and can be specified in any
3599 These aren't inherently debug info centric, but currently all the specialized
3600 metadata nodes are related to debug info.
3607 ``DICompileUnit`` nodes represent a compile unit. The ``enums:``,
3608 ``retainedTypes:``, ``subprograms:``, ``globals:`` and ``imports:`` fields are
3609 tuples containing the debug info to be emitted along with the compile unit,
3610 regardless of code optimizations (some nodes are only emitted if there are
3611 references to them from instructions).
3613 .. code-block:: llvm
3615 !0 = !DICompileUnit(language: DW_LANG_C99, file: !1, producer: "clang",
3616 isOptimized: true, flags: "-O2", runtimeVersion: 2,
3617 splitDebugFilename: "abc.debug", emissionKind: 1,
3618 enums: !2, retainedTypes: !3, subprograms: !4,
3619 globals: !5, imports: !6)
3621 Compile unit descriptors provide the root scope for objects declared in a
3622 specific compilation unit. File descriptors are defined using this scope.
3623 These descriptors are collected by a named metadata ``!llvm.dbg.cu``. They
3624 keep track of subprograms, global variables, type information, and imported
3625 entities (declarations and namespaces).
3632 ``DIFile`` nodes represent files. The ``filename:`` can include slashes.
3634 .. code-block:: llvm
3636 !0 = !DIFile(filename: "path/to/file", directory: "/path/to/dir")
3638 Files are sometimes used in ``scope:`` fields, and are the only valid target
3639 for ``file:`` fields.
3646 ``DIBasicType`` nodes represent primitive types, such as ``int``, ``bool`` and
3647 ``float``. ``tag:`` defaults to ``DW_TAG_base_type``.
3649 .. code-block:: llvm
3651 !0 = !DIBasicType(name: "unsigned char", size: 8, align: 8,
3652 encoding: DW_ATE_unsigned_char)
3653 !1 = !DIBasicType(tag: DW_TAG_unspecified_type, name: "decltype(nullptr)")
3655 The ``encoding:`` describes the details of the type. Usually it's one of the
3658 .. code-block:: llvm
3664 DW_ATE_signed_char = 6
3666 DW_ATE_unsigned_char = 8
3668 .. _DISubroutineType:
3673 ``DISubroutineType`` nodes represent subroutine types. Their ``types:`` field
3674 refers to a tuple; the first operand is the return type, while the rest are the
3675 types of the formal arguments in order. If the first operand is ``null``, that
3676 represents a function with no return value (such as ``void foo() {}`` in C++).
3678 .. code-block:: llvm
3680 !0 = !BasicType(name: "int", size: 32, align: 32, DW_ATE_signed)
3681 !1 = !BasicType(name: "char", size: 8, align: 8, DW_ATE_signed_char)
3682 !2 = !DISubroutineType(types: !{null, !0, !1}) ; void (int, char)
3689 ``DIDerivedType`` nodes represent types derived from other types, such as
3692 .. code-block:: llvm
3694 !0 = !DIBasicType(name: "unsigned char", size: 8, align: 8,
3695 encoding: DW_ATE_unsigned_char)
3696 !1 = !DIDerivedType(tag: DW_TAG_pointer_type, baseType: !0, size: 32,
3699 The following ``tag:`` values are valid:
3701 .. code-block:: llvm
3703 DW_TAG_formal_parameter = 5
3705 DW_TAG_pointer_type = 15
3706 DW_TAG_reference_type = 16
3708 DW_TAG_ptr_to_member_type = 31
3709 DW_TAG_const_type = 38
3710 DW_TAG_volatile_type = 53
3711 DW_TAG_restrict_type = 55
3713 ``DW_TAG_member`` is used to define a member of a :ref:`composite type
3714 <DICompositeType>` or :ref:`subprogram <DISubprogram>`. The type of the member
3715 is the ``baseType:``. The ``offset:`` is the member's bit offset.
3716 ``DW_TAG_formal_parameter`` is used to define a member which is a formal
3717 argument of a subprogram.
3719 ``DW_TAG_typedef`` is used to provide a name for the ``baseType:``.
3721 ``DW_TAG_pointer_type``, ``DW_TAG_reference_type``, ``DW_TAG_const_type``,
3722 ``DW_TAG_volatile_type`` and ``DW_TAG_restrict_type`` are used to qualify the
3725 Note that the ``void *`` type is expressed as a type derived from NULL.
3727 .. _DICompositeType:
3732 ``DICompositeType`` nodes represent types composed of other types, like
3733 structures and unions. ``elements:`` points to a tuple of the composed types.
3735 If the source language supports ODR, the ``identifier:`` field gives the unique
3736 identifier used for type merging between modules. When specified, other types
3737 can refer to composite types indirectly via a :ref:`metadata string
3738 <metadata-string>` that matches their identifier.
3740 .. code-block:: llvm
3742 !0 = !DIEnumerator(name: "SixKind", value: 7)
3743 !1 = !DIEnumerator(name: "SevenKind", value: 7)
3744 !2 = !DIEnumerator(name: "NegEightKind", value: -8)
3745 !3 = !DICompositeType(tag: DW_TAG_enumeration_type, name: "Enum", file: !12,
3746 line: 2, size: 32, align: 32, identifier: "_M4Enum",
3747 elements: !{!0, !1, !2})
3749 The following ``tag:`` values are valid:
3751 .. code-block:: llvm
3753 DW_TAG_array_type = 1
3754 DW_TAG_class_type = 2
3755 DW_TAG_enumeration_type = 4
3756 DW_TAG_structure_type = 19
3757 DW_TAG_union_type = 23
3758 DW_TAG_subroutine_type = 21
3759 DW_TAG_inheritance = 28
3762 For ``DW_TAG_array_type``, the ``elements:`` should be :ref:`subrange
3763 descriptors <DISubrange>`, each representing the range of subscripts at that
3764 level of indexing. The ``DIFlagVector`` flag to ``flags:`` indicates that an
3765 array type is a native packed vector.
3767 For ``DW_TAG_enumeration_type``, the ``elements:`` should be :ref:`enumerator
3768 descriptors <DIEnumerator>`, each representing the definition of an enumeration
3769 value for the set. All enumeration type descriptors are collected in the
3770 ``enums:`` field of the :ref:`compile unit <DICompileUnit>`.
3772 For ``DW_TAG_structure_type``, ``DW_TAG_class_type``, and
3773 ``DW_TAG_union_type``, the ``elements:`` should be :ref:`derived types
3774 <DIDerivedType>` with ``tag: DW_TAG_member`` or ``tag: DW_TAG_inheritance``.
3781 ``DISubrange`` nodes are the elements for ``DW_TAG_array_type`` variants of
3782 :ref:`DICompositeType`. ``count: -1`` indicates an empty array.
3784 .. code-block:: llvm
3786 !0 = !DISubrange(count: 5, lowerBound: 0) ; array counting from 0
3787 !1 = !DISubrange(count: 5, lowerBound: 1) ; array counting from 1
3788 !2 = !DISubrange(count: -1) ; empty array.
3795 ``DIEnumerator`` nodes are the elements for ``DW_TAG_enumeration_type``
3796 variants of :ref:`DICompositeType`.
3798 .. code-block:: llvm
3800 !0 = !DIEnumerator(name: "SixKind", value: 7)
3801 !1 = !DIEnumerator(name: "SevenKind", value: 7)
3802 !2 = !DIEnumerator(name: "NegEightKind", value: -8)
3804 DITemplateTypeParameter
3805 """""""""""""""""""""""
3807 ``DITemplateTypeParameter`` nodes represent type parameters to generic source
3808 language constructs. They are used (optionally) in :ref:`DICompositeType` and
3809 :ref:`DISubprogram` ``templateParams:`` fields.
3811 .. code-block:: llvm
3813 !0 = !DITemplateTypeParameter(name: "Ty", type: !1)
3815 DITemplateValueParameter
3816 """"""""""""""""""""""""
3818 ``DITemplateValueParameter`` nodes represent value parameters to generic source
3819 language constructs. ``tag:`` defaults to ``DW_TAG_template_value_parameter``,
3820 but if specified can also be set to ``DW_TAG_GNU_template_template_param`` or
3821 ``DW_TAG_GNU_template_param_pack``. They are used (optionally) in
3822 :ref:`DICompositeType` and :ref:`DISubprogram` ``templateParams:`` fields.
3824 .. code-block:: llvm
3826 !0 = !DITemplateValueParameter(name: "Ty", type: !1, value: i32 7)
3831 ``DINamespace`` nodes represent namespaces in the source language.
3833 .. code-block:: llvm
3835 !0 = !DINamespace(name: "myawesomeproject", scope: !1, file: !2, line: 7)
3840 ``DIGlobalVariable`` nodes represent global variables in the source language.
3842 .. code-block:: llvm
3844 !0 = !DIGlobalVariable(name: "foo", linkageName: "foo", scope: !1,
3845 file: !2, line: 7, type: !3, isLocal: true,
3846 isDefinition: false, variable: i32* @foo,
3849 All global variables should be referenced by the `globals:` field of a
3850 :ref:`compile unit <DICompileUnit>`.
3857 ``DISubprogram`` nodes represent functions from the source language. The
3858 ``variables:`` field points at :ref:`variables <DILocalVariable>` that must be
3859 retained, even if their IR counterparts are optimized out of the IR. The
3860 ``type:`` field must point at an :ref:`DISubroutineType`.
3862 .. code-block:: llvm
3864 !0 = !DISubprogram(name: "foo", linkageName: "_Zfoov", scope: !1,
3865 file: !2, line: 7, type: !3, isLocal: true,
3866 isDefinition: false, scopeLine: 8, containingType: !4,
3867 virtuality: DW_VIRTUALITY_pure_virtual, virtualIndex: 10,
3868 flags: DIFlagPrototyped, isOptimized: true,
3869 function: void ()* @_Z3foov,
3870 templateParams: !5, declaration: !6, variables: !7)
3877 ``DILexicalBlock`` nodes describe nested blocks within a :ref:`subprogram
3878 <DISubprogram>`. The line number and column numbers are used to distinguish
3879 two lexical blocks at same depth. They are valid targets for ``scope:``
3882 .. code-block:: llvm
3884 !0 = distinct !DILexicalBlock(scope: !1, file: !2, line: 7, column: 35)
3886 Usually lexical blocks are ``distinct`` to prevent node merging based on
3889 .. _DILexicalBlockFile:
3894 ``DILexicalBlockFile`` nodes are used to discriminate between sections of a
3895 :ref:`lexical block <DILexicalBlock>`. The ``file:`` field can be changed to
3896 indicate textual inclusion, or the ``discriminator:`` field can be used to
3897 discriminate between control flow within a single block in the source language.
3899 .. code-block:: llvm
3901 !0 = !DILexicalBlock(scope: !3, file: !4, line: 7, column: 35)
3902 !1 = !DILexicalBlockFile(scope: !0, file: !4, discriminator: 0)
3903 !2 = !DILexicalBlockFile(scope: !0, file: !4, discriminator: 1)
3910 ``DILocation`` nodes represent source debug locations. The ``scope:`` field is
3911 mandatory, and points at an :ref:`DILexicalBlockFile`, an
3912 :ref:`DILexicalBlock`, or an :ref:`DISubprogram`.
3914 .. code-block:: llvm
3916 !0 = !DILocation(line: 2900, column: 42, scope: !1, inlinedAt: !2)
3918 .. _DILocalVariable:
3923 ``DILocalVariable`` nodes represent local variables in the source language. If
3924 the ``arg:`` field is set to non-zero, then this variable is a subprogram
3925 parameter, and it will be included in the ``variables:`` field of its
3926 :ref:`DISubprogram`.
3928 .. code-block:: llvm
3930 !0 = !DILocalVariable(name: "this", arg: 1, scope: !3, file: !2, line: 7,
3931 type: !3, flags: DIFlagArtificial)
3932 !1 = !DILocalVariable(name: "x", arg: 2, scope: !4, file: !2, line: 7,
3934 !2 = !DILocalVariable(name: "y", scope: !5, file: !2, line: 7, type: !3)
3939 ``DIExpression`` nodes represent DWARF expression sequences. They are used in
3940 :ref:`debug intrinsics<dbg_intrinsics>` (such as ``llvm.dbg.declare``) to
3941 describe how the referenced LLVM variable relates to the source language
3944 The current supported vocabulary is limited:
3946 - ``DW_OP_deref`` dereferences the working expression.
3947 - ``DW_OP_plus, 93`` adds ``93`` to the working expression.
3948 - ``DW_OP_bit_piece, 16, 8`` specifies the offset and size (``16`` and ``8``
3949 here, respectively) of the variable piece from the working expression.
3951 .. code-block:: llvm
3953 !0 = !DIExpression(DW_OP_deref)
3954 !1 = !DIExpression(DW_OP_plus, 3)
3955 !2 = !DIExpression(DW_OP_bit_piece, 3, 7)
3956 !3 = !DIExpression(DW_OP_deref, DW_OP_plus, 3, DW_OP_bit_piece, 3, 7)
3961 ``DIObjCProperty`` nodes represent Objective-C property nodes.
3963 .. code-block:: llvm
3965 !3 = !DIObjCProperty(name: "foo", file: !1, line: 7, setter: "setFoo",
3966 getter: "getFoo", attributes: 7, type: !2)
3971 ``DIImportedEntity`` nodes represent entities (such as modules) imported into a
3974 .. code-block:: llvm
3976 !2 = !DIImportedEntity(tag: DW_TAG_imported_module, name: "foo", scope: !0,
3977 entity: !1, line: 7)
3982 In LLVM IR, memory does not have types, so LLVM's own type system is not
3983 suitable for doing TBAA. Instead, metadata is added to the IR to
3984 describe a type system of a higher level language. This can be used to
3985 implement typical C/C++ TBAA, but it can also be used to implement
3986 custom alias analysis behavior for other languages.
3988 The current metadata format is very simple. TBAA metadata nodes have up
3989 to three fields, e.g.:
3991 .. code-block:: llvm
3993 !0 = !{ !"an example type tree" }
3994 !1 = !{ !"int", !0 }
3995 !2 = !{ !"float", !0 }
3996 !3 = !{ !"const float", !2, i64 1 }
3998 The first field is an identity field. It can be any value, usually a
3999 metadata string, which uniquely identifies the type. The most important
4000 name in the tree is the name of the root node. Two trees with different
4001 root node names are entirely disjoint, even if they have leaves with
4004 The second field identifies the type's parent node in the tree, or is
4005 null or omitted for a root node. A type is considered to alias all of
4006 its descendants and all of its ancestors in the tree. Also, a type is
4007 considered to alias all types in other trees, so that bitcode produced
4008 from multiple front-ends is handled conservatively.
4010 If the third field is present, it's an integer which if equal to 1
4011 indicates that the type is "constant" (meaning
4012 ``pointsToConstantMemory`` should return true; see `other useful
4013 AliasAnalysis methods <AliasAnalysis.html#OtherItfs>`_).
4015 '``tbaa.struct``' Metadata
4016 ^^^^^^^^^^^^^^^^^^^^^^^^^^
4018 The :ref:`llvm.memcpy <int_memcpy>` is often used to implement
4019 aggregate assignment operations in C and similar languages, however it
4020 is defined to copy a contiguous region of memory, which is more than
4021 strictly necessary for aggregate types which contain holes due to
4022 padding. Also, it doesn't contain any TBAA information about the fields
4025 ``!tbaa.struct`` metadata can describe which memory subregions in a
4026 memcpy are padding and what the TBAA tags of the struct are.
4028 The current metadata format is very simple. ``!tbaa.struct`` metadata
4029 nodes are a list of operands which are in conceptual groups of three.
4030 For each group of three, the first operand gives the byte offset of a
4031 field in bytes, the second gives its size in bytes, and the third gives
4034 .. code-block:: llvm
4036 !4 = !{ i64 0, i64 4, !1, i64 8, i64 4, !2 }
4038 This describes a struct with two fields. The first is at offset 0 bytes
4039 with size 4 bytes, and has tbaa tag !1. The second is at offset 8 bytes
4040 and has size 4 bytes and has tbaa tag !2.
4042 Note that the fields need not be contiguous. In this example, there is a
4043 4 byte gap between the two fields. This gap represents padding which
4044 does not carry useful data and need not be preserved.
4046 '``noalias``' and '``alias.scope``' Metadata
4047 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
4049 ``noalias`` and ``alias.scope`` metadata provide the ability to specify generic
4050 noalias memory-access sets. This means that some collection of memory access
4051 instructions (loads, stores, memory-accessing calls, etc.) that carry
4052 ``noalias`` metadata can specifically be specified not to alias with some other
4053 collection of memory access instructions that carry ``alias.scope`` metadata.
4054 Each type of metadata specifies a list of scopes where each scope has an id and
4055 a domain. When evaluating an aliasing query, if for some domain, the set
4056 of scopes with that domain in one instruction's ``alias.scope`` list is a
4057 subset of (or equal to) the set of scopes for that domain in another
4058 instruction's ``noalias`` list, then the two memory accesses are assumed not to
4061 The metadata identifying each domain is itself a list containing one or two
4062 entries. The first entry is the name of the domain. Note that if the name is a
4063 string then it can be combined across functions and translation units. A
4064 self-reference can be used to create globally unique domain names. A
4065 descriptive string may optionally be provided as a second list entry.
4067 The metadata identifying each scope is also itself a list containing two or
4068 three entries. The first entry is the name of the scope. Note that if the name
4069 is a string then it can be combined across functions and translation units. A
4070 self-reference can be used to create globally unique scope names. A metadata
4071 reference to the scope's domain is the second entry. A descriptive string may
4072 optionally be provided as a third list entry.
4076 .. code-block:: llvm
4078 ; Two scope domains:
4082 ; Some scopes in these domains:
4088 !5 = !{!4} ; A list containing only scope !4
4092 ; These two instructions don't alias:
4093 %0 = load float, float* %c, align 4, !alias.scope !5
4094 store float %0, float* %arrayidx.i, align 4, !noalias !5
4096 ; These two instructions also don't alias (for domain !1, the set of scopes
4097 ; in the !alias.scope equals that in the !noalias list):
4098 %2 = load float, float* %c, align 4, !alias.scope !5
4099 store float %2, float* %arrayidx.i2, align 4, !noalias !6
4101 ; These two instructions may alias (for domain !0, the set of scopes in
4102 ; the !noalias list is not a superset of, or equal to, the scopes in the
4103 ; !alias.scope list):
4104 %2 = load float, float* %c, align 4, !alias.scope !6
4105 store float %0, float* %arrayidx.i, align 4, !noalias !7
4107 '``fpmath``' Metadata
4108 ^^^^^^^^^^^^^^^^^^^^^
4110 ``fpmath`` metadata may be attached to any instruction of floating point
4111 type. It can be used to express the maximum acceptable error in the
4112 result of that instruction, in ULPs, thus potentially allowing the
4113 compiler to use a more efficient but less accurate method of computing
4114 it. ULP is defined as follows:
4116 If ``x`` is a real number that lies between two finite consecutive
4117 floating-point numbers ``a`` and ``b``, without being equal to one
4118 of them, then ``ulp(x) = |b - a|``, otherwise ``ulp(x)`` is the
4119 distance between the two non-equal finite floating-point numbers
4120 nearest ``x``. Moreover, ``ulp(NaN)`` is ``NaN``.
4122 The metadata node shall consist of a single positive floating point
4123 number representing the maximum relative error, for example:
4125 .. code-block:: llvm
4127 !0 = !{ float 2.5 } ; maximum acceptable inaccuracy is 2.5 ULPs
4131 '``range``' Metadata
4132 ^^^^^^^^^^^^^^^^^^^^
4134 ``range`` metadata may be attached only to ``load``, ``call`` and ``invoke`` of
4135 integer types. It expresses the possible ranges the loaded value or the value
4136 returned by the called function at this call site is in. The ranges are
4137 represented with a flattened list of integers. The loaded value or the value
4138 returned is known to be in the union of the ranges defined by each consecutive
4139 pair. Each pair has the following properties:
4141 - The type must match the type loaded by the instruction.
4142 - The pair ``a,b`` represents the range ``[a,b)``.
4143 - Both ``a`` and ``b`` are constants.
4144 - The range is allowed to wrap.
4145 - The range should not represent the full or empty set. That is,
4148 In addition, the pairs must be in signed order of the lower bound and
4149 they must be non-contiguous.
4153 .. code-block:: llvm
4155 %a = load i8, i8* %x, align 1, !range !0 ; Can only be 0 or 1
4156 %b = load i8, i8* %y, align 1, !range !1 ; Can only be 255 (-1), 0 or 1
4157 %c = call i8 @foo(), !range !2 ; Can only be 0, 1, 3, 4 or 5
4158 %d = invoke i8 @bar() to label %cont
4159 unwind label %lpad, !range !3 ; Can only be -2, -1, 3, 4 or 5
4161 !0 = !{ i8 0, i8 2 }
4162 !1 = !{ i8 255, i8 2 }
4163 !2 = !{ i8 0, i8 2, i8 3, i8 6 }
4164 !3 = !{ i8 -2, i8 0, i8 3, i8 6 }
4166 '``unpredictable``' Metadata
4167 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
4169 ``unpredictable`` metadata may be attached to any branch or switch
4170 instruction. It can be used to express the unpredictability of control
4171 flow. Similar to the llvm.expect intrinsic, it may be used to alter
4172 optimizations related to compare and branch instructions. The metadata
4173 is treated as a boolean value; if it exists, it signals that the branch
4174 or switch that it is attached to is completely unpredictable.
4179 It is sometimes useful to attach information to loop constructs. Currently,
4180 loop metadata is implemented as metadata attached to the branch instruction
4181 in the loop latch block. This type of metadata refer to a metadata node that is
4182 guaranteed to be separate for each loop. The loop identifier metadata is
4183 specified with the name ``llvm.loop``.
4185 The loop identifier metadata is implemented using a metadata that refers to
4186 itself to avoid merging it with any other identifier metadata, e.g.,
4187 during module linkage or function inlining. That is, each loop should refer
4188 to their own identification metadata even if they reside in separate functions.
4189 The following example contains loop identifier metadata for two separate loop
4192 .. code-block:: llvm
4197 The loop identifier metadata can be used to specify additional
4198 per-loop metadata. Any operands after the first operand can be treated
4199 as user-defined metadata. For example the ``llvm.loop.unroll.count``
4200 suggests an unroll factor to the loop unroller:
4202 .. code-block:: llvm
4204 br i1 %exitcond, label %._crit_edge, label %.lr.ph, !llvm.loop !0
4207 !1 = !{!"llvm.loop.unroll.count", i32 4}
4209 '``llvm.loop.vectorize``' and '``llvm.loop.interleave``'
4210 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
4212 Metadata prefixed with ``llvm.loop.vectorize`` or ``llvm.loop.interleave`` are
4213 used to control per-loop vectorization and interleaving parameters such as
4214 vectorization width and interleave count. These metadata should be used in
4215 conjunction with ``llvm.loop`` loop identification metadata. The
4216 ``llvm.loop.vectorize`` and ``llvm.loop.interleave`` metadata are only
4217 optimization hints and the optimizer will only interleave and vectorize loops if
4218 it believes it is safe to do so. The ``llvm.mem.parallel_loop_access`` metadata
4219 which contains information about loop-carried memory dependencies can be helpful
4220 in determining the safety of these transformations.
4222 '``llvm.loop.interleave.count``' Metadata
4223 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
4225 This metadata suggests an interleave count to the loop interleaver.
4226 The first operand is the string ``llvm.loop.interleave.count`` and the
4227 second operand is an integer specifying the interleave count. For
4230 .. code-block:: llvm
4232 !0 = !{!"llvm.loop.interleave.count", i32 4}
4234 Note that setting ``llvm.loop.interleave.count`` to 1 disables interleaving
4235 multiple iterations of the loop. If ``llvm.loop.interleave.count`` is set to 0
4236 then the interleave count will be determined automatically.
4238 '``llvm.loop.vectorize.enable``' Metadata
4239 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
4241 This metadata selectively enables or disables vectorization for the loop. The
4242 first operand is the string ``llvm.loop.vectorize.enable`` and the second operand
4243 is a bit. If the bit operand value is 1 vectorization is enabled. A value of
4244 0 disables vectorization:
4246 .. code-block:: llvm
4248 !0 = !{!"llvm.loop.vectorize.enable", i1 0}
4249 !1 = !{!"llvm.loop.vectorize.enable", i1 1}
4251 '``llvm.loop.vectorize.width``' Metadata
4252 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
4254 This metadata sets the target width of the vectorizer. The first
4255 operand is the string ``llvm.loop.vectorize.width`` and the second
4256 operand is an integer specifying the width. For example:
4258 .. code-block:: llvm
4260 !0 = !{!"llvm.loop.vectorize.width", i32 4}
4262 Note that setting ``llvm.loop.vectorize.width`` to 1 disables
4263 vectorization of the loop. If ``llvm.loop.vectorize.width`` is set to
4264 0 or if the loop does not have this metadata the width will be
4265 determined automatically.
4267 '``llvm.loop.unroll``'
4268 ^^^^^^^^^^^^^^^^^^^^^^
4270 Metadata prefixed with ``llvm.loop.unroll`` are loop unrolling
4271 optimization hints such as the unroll factor. ``llvm.loop.unroll``
4272 metadata should be used in conjunction with ``llvm.loop`` loop
4273 identification metadata. The ``llvm.loop.unroll`` metadata are only
4274 optimization hints and the unrolling will only be performed if the
4275 optimizer believes it is safe to do so.
4277 '``llvm.loop.unroll.count``' Metadata
4278 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
4280 This metadata suggests an unroll factor to the loop unroller. The
4281 first operand is the string ``llvm.loop.unroll.count`` and the second
4282 operand is a positive integer specifying the unroll factor. For
4285 .. code-block:: llvm
4287 !0 = !{!"llvm.loop.unroll.count", i32 4}
4289 If the trip count of the loop is less than the unroll count the loop
4290 will be partially unrolled.
4292 '``llvm.loop.unroll.disable``' Metadata
4293 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
4295 This metadata disables loop unrolling. The metadata has a single operand
4296 which is the string ``llvm.loop.unroll.disable``. For example:
4298 .. code-block:: llvm
4300 !0 = !{!"llvm.loop.unroll.disable"}
4302 '``llvm.loop.unroll.runtime.disable``' Metadata
4303 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
4305 This metadata disables runtime loop unrolling. The metadata has a single
4306 operand which is the string ``llvm.loop.unroll.runtime.disable``. For example:
4308 .. code-block:: llvm
4310 !0 = !{!"llvm.loop.unroll.runtime.disable"}
4312 '``llvm.loop.unroll.enable``' Metadata
4313 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
4315 This metadata suggests that the loop should be fully unrolled if the trip count
4316 is known at compile time and partially unrolled if the trip count is not known
4317 at compile time. The metadata has a single operand which is the string
4318 ``llvm.loop.unroll.enable``. For example:
4320 .. code-block:: llvm
4322 !0 = !{!"llvm.loop.unroll.enable"}
4324 '``llvm.loop.unroll.full``' Metadata
4325 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
4327 This metadata suggests that the loop should be unrolled fully. The
4328 metadata has a single operand which is the string ``llvm.loop.unroll.full``.
4331 .. code-block:: llvm
4333 !0 = !{!"llvm.loop.unroll.full"}
4338 Metadata types used to annotate memory accesses with information helpful
4339 for optimizations are prefixed with ``llvm.mem``.
4341 '``llvm.mem.parallel_loop_access``' Metadata
4342 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
4344 The ``llvm.mem.parallel_loop_access`` metadata refers to a loop identifier,
4345 or metadata containing a list of loop identifiers for nested loops.
4346 The metadata is attached to memory accessing instructions and denotes that
4347 no loop carried memory dependence exist between it and other instructions denoted
4348 with the same loop identifier.
4350 Precisely, given two instructions ``m1`` and ``m2`` that both have the
4351 ``llvm.mem.parallel_loop_access`` metadata, with ``L1`` and ``L2`` being the
4352 set of loops associated with that metadata, respectively, then there is no loop
4353 carried dependence between ``m1`` and ``m2`` for loops in both ``L1`` and
4356 As a special case, if all memory accessing instructions in a loop have
4357 ``llvm.mem.parallel_loop_access`` metadata that refers to that loop, then the
4358 loop has no loop carried memory dependences and is considered to be a parallel
4361 Note that if not all memory access instructions have such metadata referring to
4362 the loop, then the loop is considered not being trivially parallel. Additional
4363 memory dependence analysis is required to make that determination. As a fail
4364 safe mechanism, this causes loops that were originally parallel to be considered
4365 sequential (if optimization passes that are unaware of the parallel semantics
4366 insert new memory instructions into the loop body).
4368 Example of a loop that is considered parallel due to its correct use of
4369 both ``llvm.loop`` and ``llvm.mem.parallel_loop_access``
4370 metadata types that refer to the same loop identifier metadata.
4372 .. code-block:: llvm
4376 %val0 = load i32, i32* %arrayidx, !llvm.mem.parallel_loop_access !0
4378 store i32 %val0, i32* %arrayidx1, !llvm.mem.parallel_loop_access !0
4380 br i1 %exitcond, label %for.end, label %for.body, !llvm.loop !0
4386 It is also possible to have nested parallel loops. In that case the
4387 memory accesses refer to a list of loop identifier metadata nodes instead of
4388 the loop identifier metadata node directly:
4390 .. code-block:: llvm
4394 %val1 = load i32, i32* %arrayidx3, !llvm.mem.parallel_loop_access !2
4396 br label %inner.for.body
4400 %val0 = load i32, i32* %arrayidx1, !llvm.mem.parallel_loop_access !0
4402 store i32 %val0, i32* %arrayidx2, !llvm.mem.parallel_loop_access !0
4404 br i1 %exitcond, label %inner.for.end, label %inner.for.body, !llvm.loop !1
4408 store i32 %val1, i32* %arrayidx4, !llvm.mem.parallel_loop_access !2
4410 br i1 %exitcond, label %outer.for.end, label %outer.for.body, !llvm.loop !2
4412 outer.for.end: ; preds = %for.body
4414 !0 = !{!1, !2} ; a list of loop identifiers
4415 !1 = !{!1} ; an identifier for the inner loop
4416 !2 = !{!2} ; an identifier for the outer loop
4421 The ``llvm.bitsets`` global metadata is used to implement
4422 :doc:`bitsets <BitSets>`.
4424 '``invariant.group``' Metadata
4425 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
4427 The ``invariant.group`` metadata may be attached to ``load``/``store`` instructions.
4428 The existence of the ``invariant.group`` metadata on the instruction tells
4429 the optimizer that every ``load`` and ``store`` to the same pointer operand
4430 within the same invariant group can be assumed to load or store the same
4431 value (but see the ``llvm.invariant.group.barrier`` intrinsic which affects
4432 when two pointers are considered the same).
4436 .. code-block:: llvm
4438 @unknownPtr = external global i8
4441 store i8 42, i8* %ptr, !invariant.group !0
4442 call void @foo(i8* %ptr)
4444 %a = load i8, i8* %ptr, !invariant.group !0 ; Can assume that value under %ptr didn't change
4445 call void @foo(i8* %ptr)
4446 %b = load i8, i8* %ptr, !invariant.group !1 ; Can't assume anything, because group changed
4448 %newPtr = call i8* @getPointer(i8* %ptr)
4449 %c = load i8, i8* %newPtr, !invariant.group !0 ; Can't assume anything, because we only have information about %ptr
4451 %unknownValue = load i8, i8* @unknownPtr
4452 store i8 %unknownValue, i8* %ptr, !invariant.group !0 ; Can assume that %unknownValue == 42
4454 call void @foo(i8* %ptr)
4455 %newPtr2 = call i8* @llvm.invariant.group.barrier(i8* %ptr)
4456 %d = load i8, i8* %newPtr2, !invariant.group !0 ; Can't step through invariant.group.barrier to get value of %ptr
4459 declare void @foo(i8*)
4460 declare i8* @getPointer(i8*)
4461 declare i8* @llvm.invariant.group.barrier(i8*)
4463 !0 = !{!"magic ptr"}
4464 !1 = !{!"other ptr"}
4468 Module Flags Metadata
4469 =====================
4471 Information about the module as a whole is difficult to convey to LLVM's
4472 subsystems. The LLVM IR isn't sufficient to transmit this information.
4473 The ``llvm.module.flags`` named metadata exists in order to facilitate
4474 this. These flags are in the form of key / value pairs --- much like a
4475 dictionary --- making it easy for any subsystem who cares about a flag to
4478 The ``llvm.module.flags`` metadata contains a list of metadata triplets.
4479 Each triplet has the following form:
4481 - The first element is a *behavior* flag, which specifies the behavior
4482 when two (or more) modules are merged together, and it encounters two
4483 (or more) metadata with the same ID. The supported behaviors are
4485 - The second element is a metadata string that is a unique ID for the
4486 metadata. Each module may only have one flag entry for each unique ID (not
4487 including entries with the **Require** behavior).
4488 - The third element is the value of the flag.
4490 When two (or more) modules are merged together, the resulting
4491 ``llvm.module.flags`` metadata is the union of the modules' flags. That is, for
4492 each unique metadata ID string, there will be exactly one entry in the merged
4493 modules ``llvm.module.flags`` metadata table, and the value for that entry will
4494 be determined by the merge behavior flag, as described below. The only exception
4495 is that entries with the *Require* behavior are always preserved.
4497 The following behaviors are supported:
4508 Emits an error if two values disagree, otherwise the resulting value
4509 is that of the operands.
4513 Emits a warning if two values disagree. The result value will be the
4514 operand for the flag from the first module being linked.
4518 Adds a requirement that another module flag be present and have a
4519 specified value after linking is performed. The value must be a
4520 metadata pair, where the first element of the pair is the ID of the
4521 module flag to be restricted, and the second element of the pair is
4522 the value the module flag should be restricted to. This behavior can
4523 be used to restrict the allowable results (via triggering of an
4524 error) of linking IDs with the **Override** behavior.
4528 Uses the specified value, regardless of the behavior or value of the
4529 other module. If both modules specify **Override**, but the values
4530 differ, an error will be emitted.
4534 Appends the two values, which are required to be metadata nodes.
4538 Appends the two values, which are required to be metadata
4539 nodes. However, duplicate entries in the second list are dropped
4540 during the append operation.
4542 It is an error for a particular unique flag ID to have multiple behaviors,
4543 except in the case of **Require** (which adds restrictions on another metadata
4544 value) or **Override**.
4546 An example of module flags:
4548 .. code-block:: llvm
4550 !0 = !{ i32 1, !"foo", i32 1 }
4551 !1 = !{ i32 4, !"bar", i32 37 }
4552 !2 = !{ i32 2, !"qux", i32 42 }
4553 !3 = !{ i32 3, !"qux",
4558 !llvm.module.flags = !{ !0, !1, !2, !3 }
4560 - Metadata ``!0`` has the ID ``!"foo"`` and the value '1'. The behavior
4561 if two or more ``!"foo"`` flags are seen is to emit an error if their
4562 values are not equal.
4564 - Metadata ``!1`` has the ID ``!"bar"`` and the value '37'. The
4565 behavior if two or more ``!"bar"`` flags are seen is to use the value
4568 - Metadata ``!2`` has the ID ``!"qux"`` and the value '42'. The
4569 behavior if two or more ``!"qux"`` flags are seen is to emit a
4570 warning if their values are not equal.
4572 - Metadata ``!3`` has the ID ``!"qux"`` and the value:
4578 The behavior is to emit an error if the ``llvm.module.flags`` does not
4579 contain a flag with the ID ``!"foo"`` that has the value '1' after linking is
4582 Objective-C Garbage Collection Module Flags Metadata
4583 ----------------------------------------------------
4585 On the Mach-O platform, Objective-C stores metadata about garbage
4586 collection in a special section called "image info". The metadata
4587 consists of a version number and a bitmask specifying what types of
4588 garbage collection are supported (if any) by the file. If two or more
4589 modules are linked together their garbage collection metadata needs to
4590 be merged rather than appended together.
4592 The Objective-C garbage collection module flags metadata consists of the
4593 following key-value pairs:
4602 * - ``Objective-C Version``
4603 - **[Required]** --- The Objective-C ABI version. Valid values are 1 and 2.
4605 * - ``Objective-C Image Info Version``
4606 - **[Required]** --- The version of the image info section. Currently
4609 * - ``Objective-C Image Info Section``
4610 - **[Required]** --- The section to place the metadata. Valid values are
4611 ``"__OBJC, __image_info, regular"`` for Objective-C ABI version 1, and
4612 ``"__DATA,__objc_imageinfo, regular, no_dead_strip"`` for
4613 Objective-C ABI version 2.
4615 * - ``Objective-C Garbage Collection``
4616 - **[Required]** --- Specifies whether garbage collection is supported or
4617 not. Valid values are 0, for no garbage collection, and 2, for garbage
4618 collection supported.
4620 * - ``Objective-C GC Only``
4621 - **[Optional]** --- Specifies that only garbage collection is supported.
4622 If present, its value must be 6. This flag requires that the
4623 ``Objective-C Garbage Collection`` flag have the value 2.
4625 Some important flag interactions:
4627 - If a module with ``Objective-C Garbage Collection`` set to 0 is
4628 merged with a module with ``Objective-C Garbage Collection`` set to
4629 2, then the resulting module has the
4630 ``Objective-C Garbage Collection`` flag set to 0.
4631 - A module with ``Objective-C Garbage Collection`` set to 0 cannot be
4632 merged with a module with ``Objective-C GC Only`` set to 6.
4634 Automatic Linker Flags Module Flags Metadata
4635 --------------------------------------------
4637 Some targets support embedding flags to the linker inside individual object
4638 files. Typically this is used in conjunction with language extensions which
4639 allow source files to explicitly declare the libraries they depend on, and have
4640 these automatically be transmitted to the linker via object files.
4642 These flags are encoded in the IR using metadata in the module flags section,
4643 using the ``Linker Options`` key. The merge behavior for this flag is required
4644 to be ``AppendUnique``, and the value for the key is expected to be a metadata
4645 node which should be a list of other metadata nodes, each of which should be a
4646 list of metadata strings defining linker options.
4648 For example, the following metadata section specifies two separate sets of
4649 linker options, presumably to link against ``libz`` and the ``Cocoa``
4652 !0 = !{ i32 6, !"Linker Options",
4655 !{ !"-framework", !"Cocoa" } } }
4656 !llvm.module.flags = !{ !0 }
4658 The metadata encoding as lists of lists of options, as opposed to a collapsed
4659 list of options, is chosen so that the IR encoding can use multiple option
4660 strings to specify e.g., a single library, while still having that specifier be
4661 preserved as an atomic element that can be recognized by a target specific
4662 assembly writer or object file emitter.
4664 Each individual option is required to be either a valid option for the target's
4665 linker, or an option that is reserved by the target specific assembly writer or
4666 object file emitter. No other aspect of these options is defined by the IR.
4668 C type width Module Flags Metadata
4669 ----------------------------------
4671 The ARM backend emits a section into each generated object file describing the
4672 options that it was compiled with (in a compiler-independent way) to prevent
4673 linking incompatible objects, and to allow automatic library selection. Some
4674 of these options are not visible at the IR level, namely wchar_t width and enum
4677 To pass this information to the backend, these options are encoded in module
4678 flags metadata, using the following key-value pairs:
4688 - * 0 --- sizeof(wchar_t) == 4
4689 * 1 --- sizeof(wchar_t) == 2
4692 - * 0 --- Enums are at least as large as an ``int``.
4693 * 1 --- Enums are stored in the smallest integer type which can
4694 represent all of its values.
4696 For example, the following metadata section specifies that the module was
4697 compiled with a ``wchar_t`` width of 4 bytes, and the underlying type of an
4698 enum is the smallest type which can represent all of its values::
4700 !llvm.module.flags = !{!0, !1}
4701 !0 = !{i32 1, !"short_wchar", i32 1}
4702 !1 = !{i32 1, !"short_enum", i32 0}
4704 .. _intrinsicglobalvariables:
4706 Intrinsic Global Variables
4707 ==========================
4709 LLVM has a number of "magic" global variables that contain data that
4710 affect code generation or other IR semantics. These are documented here.
4711 All globals of this sort should have a section specified as
4712 "``llvm.metadata``". This section and all globals that start with
4713 "``llvm.``" are reserved for use by LLVM.
4717 The '``llvm.used``' Global Variable
4718 -----------------------------------
4720 The ``@llvm.used`` global is an array which has
4721 :ref:`appending linkage <linkage_appending>`. This array contains a list of
4722 pointers to named global variables, functions and aliases which may optionally
4723 have a pointer cast formed of bitcast or getelementptr. For example, a legal
4726 .. code-block:: llvm
4731 @llvm.used = appending global [2 x i8*] [
4733 i8* bitcast (i32* @Y to i8*)
4734 ], section "llvm.metadata"
4736 If a symbol appears in the ``@llvm.used`` list, then the compiler, assembler,
4737 and linker are required to treat the symbol as if there is a reference to the
4738 symbol that it cannot see (which is why they have to be named). For example, if
4739 a variable has internal linkage and no references other than that from the
4740 ``@llvm.used`` list, it cannot be deleted. This is commonly used to represent
4741 references from inline asms and other things the compiler cannot "see", and
4742 corresponds to "``attribute((used))``" in GNU C.
4744 On some targets, the code generator must emit a directive to the
4745 assembler or object file to prevent the assembler and linker from
4746 molesting the symbol.
4748 .. _gv_llvmcompilerused:
4750 The '``llvm.compiler.used``' Global Variable
4751 --------------------------------------------
4753 The ``@llvm.compiler.used`` directive is the same as the ``@llvm.used``
4754 directive, except that it only prevents the compiler from touching the
4755 symbol. On targets that support it, this allows an intelligent linker to
4756 optimize references to the symbol without being impeded as it would be
4759 This is a rare construct that should only be used in rare circumstances,
4760 and should not be exposed to source languages.
4762 .. _gv_llvmglobalctors:
4764 The '``llvm.global_ctors``' Global Variable
4765 -------------------------------------------
4767 .. code-block:: llvm
4769 %0 = type { i32, void ()*, i8* }
4770 @llvm.global_ctors = appending global [1 x %0] [%0 { i32 65535, void ()* @ctor, i8* @data }]
4772 The ``@llvm.global_ctors`` array contains a list of constructor
4773 functions, priorities, and an optional associated global or function.
4774 The functions referenced by this array will be called in ascending order
4775 of priority (i.e. lowest first) when the module is loaded. The order of
4776 functions with the same priority is not defined.
4778 If the third field is present, non-null, and points to a global variable
4779 or function, the initializer function will only run if the associated
4780 data from the current module is not discarded.
4782 .. _llvmglobaldtors:
4784 The '``llvm.global_dtors``' Global Variable
4785 -------------------------------------------
4787 .. code-block:: llvm
4789 %0 = type { i32, void ()*, i8* }
4790 @llvm.global_dtors = appending global [1 x %0] [%0 { i32 65535, void ()* @dtor, i8* @data }]
4792 The ``@llvm.global_dtors`` array contains a list of destructor
4793 functions, priorities, and an optional associated global or function.
4794 The functions referenced by this array will be called in descending
4795 order of priority (i.e. highest first) when the module is unloaded. The
4796 order of functions with the same priority is not defined.
4798 If the third field is present, non-null, and points to a global variable
4799 or function, the destructor function will only run if the associated
4800 data from the current module is not discarded.
4802 Instruction Reference
4803 =====================
4805 The LLVM instruction set consists of several different classifications
4806 of instructions: :ref:`terminator instructions <terminators>`, :ref:`binary
4807 instructions <binaryops>`, :ref:`bitwise binary
4808 instructions <bitwiseops>`, :ref:`memory instructions <memoryops>`, and
4809 :ref:`other instructions <otherops>`.
4813 Terminator Instructions
4814 -----------------------
4816 As mentioned :ref:`previously <functionstructure>`, every basic block in a
4817 program ends with a "Terminator" instruction, which indicates which
4818 block should be executed after the current block is finished. These
4819 terminator instructions typically yield a '``void``' value: they produce
4820 control flow, not values (the one exception being the
4821 ':ref:`invoke <i_invoke>`' instruction).
4823 The terminator instructions are: ':ref:`ret <i_ret>`',
4824 ':ref:`br <i_br>`', ':ref:`switch <i_switch>`',
4825 ':ref:`indirectbr <i_indirectbr>`', ':ref:`invoke <i_invoke>`',
4826 ':ref:`resume <i_resume>`', ':ref:`catchpad <i_catchpad>`',
4827 ':ref:`catchendpad <i_catchendpad>`',
4828 ':ref:`catchret <i_catchret>`',
4829 ':ref:`cleanupendpad <i_cleanupendpad>`',
4830 ':ref:`cleanupret <i_cleanupret>`',
4831 ':ref:`terminatepad <i_terminatepad>`',
4832 and ':ref:`unreachable <i_unreachable>`'.
4836 '``ret``' Instruction
4837 ^^^^^^^^^^^^^^^^^^^^^
4844 ret <type> <value> ; Return a value from a non-void function
4845 ret void ; Return from void function
4850 The '``ret``' instruction is used to return control flow (and optionally
4851 a value) from a function back to the caller.
4853 There are two forms of the '``ret``' instruction: one that returns a
4854 value and then causes control flow, and one that just causes control
4860 The '``ret``' instruction optionally accepts a single argument, the
4861 return value. The type of the return value must be a ':ref:`first
4862 class <t_firstclass>`' type.
4864 A function is not :ref:`well formed <wellformed>` if it it has a non-void
4865 return type and contains a '``ret``' instruction with no return value or
4866 a return value with a type that does not match its type, or if it has a
4867 void return type and contains a '``ret``' instruction with a return
4873 When the '``ret``' instruction is executed, control flow returns back to
4874 the calling function's context. If the caller is a
4875 ":ref:`call <i_call>`" instruction, execution continues at the
4876 instruction after the call. If the caller was an
4877 ":ref:`invoke <i_invoke>`" instruction, execution continues at the
4878 beginning of the "normal" destination block. If the instruction returns
4879 a value, that value shall set the call or invoke instruction's return
4885 .. code-block:: llvm
4887 ret i32 5 ; Return an integer value of 5
4888 ret void ; Return from a void function
4889 ret { i32, i8 } { i32 4, i8 2 } ; Return a struct of values 4 and 2
4893 '``br``' Instruction
4894 ^^^^^^^^^^^^^^^^^^^^
4901 br i1 <cond>, label <iftrue>, label <iffalse>
4902 br label <dest> ; Unconditional branch
4907 The '``br``' instruction is used to cause control flow to transfer to a
4908 different basic block in the current function. There are two forms of
4909 this instruction, corresponding to a conditional branch and an
4910 unconditional branch.
4915 The conditional branch form of the '``br``' instruction takes a single
4916 '``i1``' value and two '``label``' values. The unconditional form of the
4917 '``br``' instruction takes a single '``label``' value as a target.
4922 Upon execution of a conditional '``br``' instruction, the '``i1``'
4923 argument is evaluated. If the value is ``true``, control flows to the
4924 '``iftrue``' ``label`` argument. If "cond" is ``false``, control flows
4925 to the '``iffalse``' ``label`` argument.
4930 .. code-block:: llvm
4933 %cond = icmp eq i32 %a, %b
4934 br i1 %cond, label %IfEqual, label %IfUnequal
4942 '``switch``' Instruction
4943 ^^^^^^^^^^^^^^^^^^^^^^^^
4950 switch <intty> <value>, label <defaultdest> [ <intty> <val>, label <dest> ... ]
4955 The '``switch``' instruction is used to transfer control flow to one of
4956 several different places. It is a generalization of the '``br``'
4957 instruction, allowing a branch to occur to one of many possible
4963 The '``switch``' instruction uses three parameters: an integer
4964 comparison value '``value``', a default '``label``' destination, and an
4965 array of pairs of comparison value constants and '``label``'s. The table
4966 is not allowed to contain duplicate constant entries.
4971 The ``switch`` instruction specifies a table of values and destinations.
4972 When the '``switch``' instruction is executed, this table is searched
4973 for the given value. If the value is found, control flow is transferred
4974 to the corresponding destination; otherwise, control flow is transferred
4975 to the default destination.
4980 Depending on properties of the target machine and the particular
4981 ``switch`` instruction, this instruction may be code generated in
4982 different ways. For example, it could be generated as a series of
4983 chained conditional branches or with a lookup table.
4988 .. code-block:: llvm
4990 ; Emulate a conditional br instruction
4991 %Val = zext i1 %value to i32
4992 switch i32 %Val, label %truedest [ i32 0, label %falsedest ]
4994 ; Emulate an unconditional br instruction
4995 switch i32 0, label %dest [ ]
4997 ; Implement a jump table:
4998 switch i32 %val, label %otherwise [ i32 0, label %onzero
5000 i32 2, label %ontwo ]
5004 '``indirectbr``' Instruction
5005 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
5012 indirectbr <somety>* <address>, [ label <dest1>, label <dest2>, ... ]
5017 The '``indirectbr``' instruction implements an indirect branch to a
5018 label within the current function, whose address is specified by
5019 "``address``". Address must be derived from a
5020 :ref:`blockaddress <blockaddress>` constant.
5025 The '``address``' argument is the address of the label to jump to. The
5026 rest of the arguments indicate the full set of possible destinations
5027 that the address may point to. Blocks are allowed to occur multiple
5028 times in the destination list, though this isn't particularly useful.
5030 This destination list is required so that dataflow analysis has an
5031 accurate understanding of the CFG.
5036 Control transfers to the block specified in the address argument. All
5037 possible destination blocks must be listed in the label list, otherwise
5038 this instruction has undefined behavior. This implies that jumps to
5039 labels defined in other functions have undefined behavior as well.
5044 This is typically implemented with a jump through a register.
5049 .. code-block:: llvm
5051 indirectbr i8* %Addr, [ label %bb1, label %bb2, label %bb3 ]
5055 '``invoke``' Instruction
5056 ^^^^^^^^^^^^^^^^^^^^^^^^
5063 <result> = invoke [cconv] [ret attrs] <ptr to function ty> <function ptr val>(<function args>) [fn attrs]
5064 to label <normal label> unwind label <exception label>
5069 The '``invoke``' instruction causes control to transfer to a specified
5070 function, with the possibility of control flow transfer to either the
5071 '``normal``' label or the '``exception``' label. If the callee function
5072 returns with the "``ret``" instruction, control flow will return to the
5073 "normal" label. If the callee (or any indirect callees) returns via the
5074 ":ref:`resume <i_resume>`" instruction or other exception handling
5075 mechanism, control is interrupted and continued at the dynamically
5076 nearest "exception" label.
5078 The '``exception``' label is a `landing
5079 pad <ExceptionHandling.html#overview>`_ for the exception. As such,
5080 '``exception``' label is required to have the
5081 ":ref:`landingpad <i_landingpad>`" instruction, which contains the
5082 information about the behavior of the program after unwinding happens,
5083 as its first non-PHI instruction. The restrictions on the
5084 "``landingpad``" instruction's tightly couples it to the "``invoke``"
5085 instruction, so that the important information contained within the
5086 "``landingpad``" instruction can't be lost through normal code motion.
5091 This instruction requires several arguments:
5093 #. The optional "cconv" marker indicates which :ref:`calling
5094 convention <callingconv>` the call should use. If none is
5095 specified, the call defaults to using C calling conventions.
5096 #. The optional :ref:`Parameter Attributes <paramattrs>` list for return
5097 values. Only '``zeroext``', '``signext``', and '``inreg``' attributes
5099 #. '``ptr to function ty``': shall be the signature of the pointer to
5100 function value being invoked. In most cases, this is a direct
5101 function invocation, but indirect ``invoke``'s are just as possible,
5102 branching off an arbitrary pointer to function value.
5103 #. '``function ptr val``': An LLVM value containing a pointer to a
5104 function to be invoked.
5105 #. '``function args``': argument list whose types match the function
5106 signature argument types and parameter attributes. All arguments must
5107 be of :ref:`first class <t_firstclass>` type. If the function signature
5108 indicates the function accepts a variable number of arguments, the
5109 extra arguments can be specified.
5110 #. '``normal label``': the label reached when the called function
5111 executes a '``ret``' instruction.
5112 #. '``exception label``': the label reached when a callee returns via
5113 the :ref:`resume <i_resume>` instruction or other exception handling
5115 #. The optional :ref:`function attributes <fnattrs>` list. Only
5116 '``noreturn``', '``nounwind``', '``readonly``' and '``readnone``'
5117 attributes are valid here.
5122 This instruction is designed to operate as a standard '``call``'
5123 instruction in most regards. The primary difference is that it
5124 establishes an association with a label, which is used by the runtime
5125 library to unwind the stack.
5127 This instruction is used in languages with destructors to ensure that
5128 proper cleanup is performed in the case of either a ``longjmp`` or a
5129 thrown exception. Additionally, this is important for implementation of
5130 '``catch``' clauses in high-level languages that support them.
5132 For the purposes of the SSA form, the definition of the value returned
5133 by the '``invoke``' instruction is deemed to occur on the edge from the
5134 current block to the "normal" label. If the callee unwinds then no
5135 return value is available.
5140 .. code-block:: llvm
5142 %retval = invoke i32 @Test(i32 15) to label %Continue
5143 unwind label %TestCleanup ; i32:retval set
5144 %retval = invoke coldcc i32 %Testfnptr(i32 15) to label %Continue
5145 unwind label %TestCleanup ; i32:retval set
5149 '``resume``' Instruction
5150 ^^^^^^^^^^^^^^^^^^^^^^^^
5157 resume <type> <value>
5162 The '``resume``' instruction is a terminator instruction that has no
5168 The '``resume``' instruction requires one argument, which must have the
5169 same type as the result of any '``landingpad``' instruction in the same
5175 The '``resume``' instruction resumes propagation of an existing
5176 (in-flight) exception whose unwinding was interrupted with a
5177 :ref:`landingpad <i_landingpad>` instruction.
5182 .. code-block:: llvm
5184 resume { i8*, i32 } %exn
5188 '``catchpad``' Instruction
5189 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
5196 <resultval> = catchpad [<args>*]
5197 to label <normal label> unwind label <exception label>
5202 The '``catchpad``' instruction is used by `LLVM's exception handling
5203 system <ExceptionHandling.html#overview>`_ to specify that a basic block
5204 is a catch block --- one where a personality routine attempts to transfer
5205 control to catch an exception.
5206 The ``args`` correspond to whatever information the personality
5207 routine requires to know if this is an appropriate place to catch the
5208 exception. Control is transfered to the ``exception`` label if the
5209 ``catchpad`` is not an appropriate handler for the in-flight exception.
5210 The ``normal`` label should contain the code found in the ``catch``
5211 portion of a ``try``/``catch`` sequence. The ``resultval`` has the type
5212 :ref:`token <t_token>` and is used to match the ``catchpad`` to
5213 corresponding :ref:`catchrets <i_catchret>`.
5218 The instruction takes a list of arbitrary values which are interpreted
5219 by the :ref:`personality function <personalityfn>`.
5221 The ``catchpad`` must be provided a ``normal`` label to transfer control
5222 to if the ``catchpad`` matches the exception and an ``exception``
5223 label to transfer control to if it doesn't.
5228 When the call stack is being unwound due to an exception being thrown,
5229 the exception is compared against the ``args``. If it doesn't match,
5230 then control is transfered to the ``exception`` basic block.
5231 As with calling conventions, how the personality function results are
5232 represented in LLVM IR is target specific.
5234 The ``catchpad`` instruction has several restrictions:
5236 - A catch block is a basic block which is the unwind destination of
5237 an exceptional instruction.
5238 - A catch block must have a '``catchpad``' instruction as its
5239 first non-PHI instruction.
5240 - A catch block's ``exception`` edge must refer to a catch block or a
5242 - There can be only one '``catchpad``' instruction within the
5244 - A basic block that is not a catch block may not include a
5245 '``catchpad``' instruction.
5246 - A catch block which has another catch block as a predecessor may not have
5247 any other predecessors.
5248 - It is undefined behavior for control to transfer from a ``catchpad`` to a
5249 ``ret`` without first executing a ``catchret`` that consumes the
5250 ``catchpad`` or unwinding through its ``catchendpad``.
5251 - It is undefined behavior for control to transfer from a ``catchpad`` to
5252 itself without first executing a ``catchret`` that consumes the
5253 ``catchpad`` or unwinding through its ``catchendpad``.
5258 .. code-block:: llvm
5260 ;; A catch block which can catch an integer.
5261 %tok = catchpad [i8** @_ZTIi]
5262 to label %int.handler unwind label %terminate
5266 '``catchendpad``' Instruction
5267 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
5274 catchendpad unwind label <nextaction>
5275 catchendpad unwind to caller
5280 The '``catchendpad``' instruction is used by `LLVM's exception handling
5281 system <ExceptionHandling.html#overview>`_ to communicate to the
5282 :ref:`personality function <personalityfn>` which invokes are associated
5283 with a chain of :ref:`catchpad <i_catchpad>` instructions; propagating an
5284 exception out of a catch handler is represented by unwinding through its
5285 ``catchendpad``. Unwinding to the outer scope when a chain of catch handlers
5286 do not handle an exception is also represented by unwinding through their
5289 The ``nextaction`` label indicates where control should transfer to if
5290 none of the ``catchpad`` instructions are suitable for catching the
5291 in-flight exception.
5293 If a ``nextaction`` label is not present, the instruction unwinds out of
5294 its parent function. The
5295 :ref:`personality function <personalityfn>` will continue processing
5296 exception handling actions in the caller.
5301 The instruction optionally takes a label, ``nextaction``, indicating
5302 where control should transfer to if none of the preceding
5303 ``catchpad`` instructions are suitable for the in-flight exception.
5308 When the call stack is being unwound due to an exception being thrown
5309 and none of the constituent ``catchpad`` instructions match, then
5310 control is transfered to ``nextaction`` if it is present. If it is not
5311 present, control is transfered to the caller.
5313 The ``catchendpad`` instruction has several restrictions:
5315 - A catch-end block is a basic block which is the unwind destination of
5316 an exceptional instruction.
5317 - A catch-end block must have a '``catchendpad``' instruction as its
5318 first non-PHI instruction.
5319 - There can be only one '``catchendpad``' instruction within the
5321 - A basic block that is not a catch-end block may not include a
5322 '``catchendpad``' instruction.
5323 - Exactly one catch block may unwind to a ``catchendpad``.
5324 - It is undefined behavior to execute a ``catchendpad`` if none of the
5325 '``catchpad``'s chained to it have been executed.
5326 - It is undefined behavior to execute a ``catchendpad`` twice without an
5327 intervening execution of one or more of the '``catchpad``'s chained to it.
5328 - It is undefined behavior to execute a ``catchendpad`` if, after the most
5329 recent execution of the normal successor edge of any ``catchpad`` chained
5330 to it, some ``catchret`` consuming that ``catchpad`` has already been
5332 - It is undefined behavior to execute a ``catchendpad`` if, after the most
5333 recent execution of the normal successor edge of any ``catchpad`` chained
5334 to it, any other ``catchpad`` or ``cleanuppad`` has been executed but has
5335 not had a corresponding
5336 ``catchret``/``cleanupret``/``catchendpad``/``cleanupendpad`` executed.
5341 .. code-block:: llvm
5343 catchendpad unwind label %terminate
5344 catchendpad unwind to caller
5348 '``catchret``' Instruction
5349 ^^^^^^^^^^^^^^^^^^^^^^^^^^
5356 catchret <value> to label <normal>
5361 The '``catchret``' instruction is a terminator instruction that has a
5368 The first argument to a '``catchret``' indicates which ``catchpad`` it
5369 exits. It must be a :ref:`catchpad <i_catchpad>`.
5370 The second argument to a '``catchret``' specifies where control will
5376 The '``catchret``' instruction ends the existing (in-flight) exception
5377 whose unwinding was interrupted with a
5378 :ref:`catchpad <i_catchpad>` instruction.
5379 The :ref:`personality function <personalityfn>` gets a chance to execute
5380 arbitrary code to, for example, run a C++ destructor.
5381 Control then transfers to ``normal``.
5382 It may be passed an optional, personality specific, value.
5384 It is undefined behavior to execute a ``catchret`` whose ``catchpad`` has
5387 It is undefined behavior to execute a ``catchret`` if, after the most recent
5388 execution of its ``catchpad``, some ``catchret`` or ``catchendpad`` linked
5389 to the same ``catchpad`` has already been executed.
5391 It is undefined behavior to execute a ``catchret`` if, after the most recent
5392 execution of its ``catchpad``, any other ``catchpad`` or ``cleanuppad`` has
5393 been executed but has not had a corresponding
5394 ``catchret``/``cleanupret``/``catchendpad``/``cleanupendpad`` executed.
5399 .. code-block:: llvm
5401 catchret %catch label %continue
5403 .. _i_cleanupendpad:
5405 '``cleanupendpad``' Instruction
5406 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
5413 cleanupendpad <value> unwind label <nextaction>
5414 cleanupendpad <value> unwind to caller
5419 The '``cleanupendpad``' instruction is used by `LLVM's exception handling
5420 system <ExceptionHandling.html#overview>`_ to communicate to the
5421 :ref:`personality function <personalityfn>` which invokes are associated
5422 with a :ref:`cleanuppad <i_cleanuppad>` instructions; propagating an exception
5423 out of a cleanup is represented by unwinding through its ``cleanupendpad``.
5425 The ``nextaction`` label indicates where control should unwind to next, in the
5426 event that a cleanup is exited by means of an(other) exception being raised.
5428 If a ``nextaction`` label is not present, the instruction unwinds out of
5429 its parent function. The
5430 :ref:`personality function <personalityfn>` will continue processing
5431 exception handling actions in the caller.
5436 The '``cleanupendpad``' instruction requires one argument, which indicates
5437 which ``cleanuppad`` it exits, and must be a :ref:`cleanuppad <i_cleanuppad>`.
5438 It also has an optional successor, ``nextaction``, indicating where control
5444 When and exception propagates to a ``cleanupendpad``, control is transfered to
5445 ``nextaction`` if it is present. If it is not present, control is transfered to
5448 The ``cleanupendpad`` instruction has several restrictions:
5450 - A cleanup-end block is a basic block which is the unwind destination of
5451 an exceptional instruction.
5452 - A cleanup-end block must have a '``cleanupendpad``' instruction as its
5453 first non-PHI instruction.
5454 - There can be only one '``cleanupendpad``' instruction within the
5456 - A basic block that is not a cleanup-end block may not include a
5457 '``cleanupendpad``' instruction.
5458 - It is undefined behavior to execute a ``cleanupendpad`` whose ``cleanuppad``
5459 has not been executed.
5460 - It is undefined behavior to execute a ``cleanupendpad`` if, after the most
5461 recent execution of its ``cleanuppad``, some ``cleanupret`` or ``cleanupendpad``
5462 consuming the same ``cleanuppad`` has already been executed.
5463 - It is undefined behavior to execute a ``cleanupendpad`` if, after the most
5464 recent execution of its ``cleanuppad``, any other ``cleanuppad`` or
5465 ``catchpad`` has been executed but has not had a corresponding
5466 ``cleanupret``/``catchret``/``cleanupendpad``/``catchendpad`` executed.
5471 .. code-block:: llvm
5473 cleanupendpad %cleanup unwind label %terminate
5474 cleanupendpad %cleanup unwind to caller
5478 '``cleanupret``' Instruction
5479 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
5486 cleanupret <value> unwind label <continue>
5487 cleanupret <value> unwind to caller
5492 The '``cleanupret``' instruction is a terminator instruction that has
5493 an optional successor.
5499 The '``cleanupret``' instruction requires one argument, which indicates
5500 which ``cleanuppad`` it exits, and must be a :ref:`cleanuppad <i_cleanuppad>`.
5501 It also has an optional successor, ``continue``.
5506 The '``cleanupret``' instruction indicates to the
5507 :ref:`personality function <personalityfn>` that one
5508 :ref:`cleanuppad <i_cleanuppad>` it transferred control to has ended.
5509 It transfers control to ``continue`` or unwinds out of the function.
5511 It is undefined behavior to execute a ``cleanupret`` whose ``cleanuppad`` has
5514 It is undefined behavior to execute a ``cleanupret`` if, after the most recent
5515 execution of its ``cleanuppad``, some ``cleanupret`` or ``cleanupendpad``
5516 consuming the same ``cleanuppad`` has already been executed.
5518 It is undefined behavior to execute a ``cleanupret`` if, after the most recent
5519 execution of its ``cleanuppad``, any other ``cleanuppad`` or ``catchpad`` has
5520 been executed but has not had a corresponding
5521 ``cleanupret``/``catchret``/``cleanupendpad``/``catchendpad`` executed.
5526 .. code-block:: llvm
5528 cleanupret %cleanup unwind to caller
5529 cleanupret %cleanup unwind label %continue
5533 '``terminatepad``' Instruction
5534 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
5541 terminatepad [<args>*] unwind label <exception label>
5542 terminatepad [<args>*] unwind to caller
5547 The '``terminatepad``' instruction is used by `LLVM's exception handling
5548 system <ExceptionHandling.html#overview>`_ to specify that a basic block
5549 is a terminate block --- one where a personality routine may decide to
5550 terminate the program.
5551 The ``args`` correspond to whatever information the personality
5552 routine requires to know if this is an appropriate place to terminate the
5553 program. Control is transferred to the ``exception`` label if the
5554 personality routine decides not to terminate the program for the
5555 in-flight exception.
5560 The instruction takes a list of arbitrary values which are interpreted
5561 by the :ref:`personality function <personalityfn>`.
5563 The ``terminatepad`` may be given an ``exception`` label to
5564 transfer control to if the in-flight exception matches the ``args``.
5569 When the call stack is being unwound due to an exception being thrown,
5570 the exception is compared against the ``args``. If it matches,
5571 then control is transfered to the ``exception`` basic block. Otherwise,
5572 the program is terminated via personality-specific means. Typically,
5573 the first argument to ``terminatepad`` specifies what function the
5574 personality should defer to in order to terminate the program.
5576 The ``terminatepad`` instruction has several restrictions:
5578 - A terminate block is a basic block which is the unwind destination of
5579 an exceptional instruction.
5580 - A terminate block must have a '``terminatepad``' instruction as its
5581 first non-PHI instruction.
5582 - There can be only one '``terminatepad``' instruction within the
5584 - A basic block that is not a terminate block may not include a
5585 '``terminatepad``' instruction.
5590 .. code-block:: llvm
5592 ;; A terminate block which only permits integers.
5593 terminatepad [i8** @_ZTIi] unwind label %continue
5597 '``unreachable``' Instruction
5598 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
5610 The '``unreachable``' instruction has no defined semantics. This
5611 instruction is used to inform the optimizer that a particular portion of
5612 the code is not reachable. This can be used to indicate that the code
5613 after a no-return function cannot be reached, and other facts.
5618 The '``unreachable``' instruction has no defined semantics.
5625 Binary operators are used to do most of the computation in a program.
5626 They require two operands of the same type, execute an operation on
5627 them, and produce a single value. The operands might represent multiple
5628 data, as is the case with the :ref:`vector <t_vector>` data type. The
5629 result value has the same type as its operands.
5631 There are several different binary operators:
5635 '``add``' Instruction
5636 ^^^^^^^^^^^^^^^^^^^^^
5643 <result> = add <ty> <op1>, <op2> ; yields ty:result
5644 <result> = add nuw <ty> <op1>, <op2> ; yields ty:result
5645 <result> = add nsw <ty> <op1>, <op2> ; yields ty:result
5646 <result> = add nuw nsw <ty> <op1>, <op2> ; yields ty:result
5651 The '``add``' instruction returns the sum of its two operands.
5656 The two arguments to the '``add``' instruction must be
5657 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer values. Both
5658 arguments must have identical types.
5663 The value produced is the integer sum of the two operands.
5665 If the sum has unsigned overflow, the result returned is the
5666 mathematical result modulo 2\ :sup:`n`\ , where n is the bit width of
5669 Because LLVM integers use a two's complement representation, this
5670 instruction is appropriate for both signed and unsigned integers.
5672 ``nuw`` and ``nsw`` stand for "No Unsigned Wrap" and "No Signed Wrap",
5673 respectively. If the ``nuw`` and/or ``nsw`` keywords are present, the
5674 result value of the ``add`` is a :ref:`poison value <poisonvalues>` if
5675 unsigned and/or signed overflow, respectively, occurs.
5680 .. code-block:: llvm
5682 <result> = add i32 4, %var ; yields i32:result = 4 + %var
5686 '``fadd``' Instruction
5687 ^^^^^^^^^^^^^^^^^^^^^^
5694 <result> = fadd [fast-math flags]* <ty> <op1>, <op2> ; yields ty:result
5699 The '``fadd``' instruction returns the sum of its two operands.
5704 The two arguments to the '``fadd``' instruction must be :ref:`floating
5705 point <t_floating>` or :ref:`vector <t_vector>` of floating point values.
5706 Both arguments must have identical types.
5711 The value produced is the floating point sum of the two operands. This
5712 instruction can also take any number of :ref:`fast-math flags <fastmath>`,
5713 which are optimization hints to enable otherwise unsafe floating point
5719 .. code-block:: llvm
5721 <result> = fadd float 4.0, %var ; yields float:result = 4.0 + %var
5723 '``sub``' Instruction
5724 ^^^^^^^^^^^^^^^^^^^^^
5731 <result> = sub <ty> <op1>, <op2> ; yields ty:result
5732 <result> = sub nuw <ty> <op1>, <op2> ; yields ty:result
5733 <result> = sub nsw <ty> <op1>, <op2> ; yields ty:result
5734 <result> = sub nuw nsw <ty> <op1>, <op2> ; yields ty:result
5739 The '``sub``' instruction returns the difference of its two operands.
5741 Note that the '``sub``' instruction is used to represent the '``neg``'
5742 instruction present in most other intermediate representations.
5747 The two arguments to the '``sub``' instruction must be
5748 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer values. Both
5749 arguments must have identical types.
5754 The value produced is the integer difference of the two operands.
5756 If the difference has unsigned overflow, the result returned is the
5757 mathematical result modulo 2\ :sup:`n`\ , where n is the bit width of
5760 Because LLVM integers use a two's complement representation, this
5761 instruction is appropriate for both signed and unsigned integers.
5763 ``nuw`` and ``nsw`` stand for "No Unsigned Wrap" and "No Signed Wrap",
5764 respectively. If the ``nuw`` and/or ``nsw`` keywords are present, the
5765 result value of the ``sub`` is a :ref:`poison value <poisonvalues>` if
5766 unsigned and/or signed overflow, respectively, occurs.
5771 .. code-block:: llvm
5773 <result> = sub i32 4, %var ; yields i32:result = 4 - %var
5774 <result> = sub i32 0, %val ; yields i32:result = -%var
5778 '``fsub``' Instruction
5779 ^^^^^^^^^^^^^^^^^^^^^^
5786 <result> = fsub [fast-math flags]* <ty> <op1>, <op2> ; yields ty:result
5791 The '``fsub``' instruction returns the difference of its two operands.
5793 Note that the '``fsub``' instruction is used to represent the '``fneg``'
5794 instruction present in most other intermediate representations.
5799 The two arguments to the '``fsub``' instruction must be :ref:`floating
5800 point <t_floating>` or :ref:`vector <t_vector>` of floating point values.
5801 Both arguments must have identical types.
5806 The value produced is the floating point difference of the two operands.
5807 This instruction can also take any number of :ref:`fast-math
5808 flags <fastmath>`, which are optimization hints to enable otherwise
5809 unsafe floating point optimizations:
5814 .. code-block:: llvm
5816 <result> = fsub float 4.0, %var ; yields float:result = 4.0 - %var
5817 <result> = fsub float -0.0, %val ; yields float:result = -%var
5819 '``mul``' Instruction
5820 ^^^^^^^^^^^^^^^^^^^^^
5827 <result> = mul <ty> <op1>, <op2> ; yields ty:result
5828 <result> = mul nuw <ty> <op1>, <op2> ; yields ty:result
5829 <result> = mul nsw <ty> <op1>, <op2> ; yields ty:result
5830 <result> = mul nuw nsw <ty> <op1>, <op2> ; yields ty:result
5835 The '``mul``' instruction returns the product of its two operands.
5840 The two arguments to the '``mul``' instruction must be
5841 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer values. Both
5842 arguments must have identical types.
5847 The value produced is the integer product of the two operands.
5849 If the result of the multiplication has unsigned overflow, the result
5850 returned is the mathematical result modulo 2\ :sup:`n`\ , where n is the
5851 bit width of the result.
5853 Because LLVM integers use a two's complement representation, and the
5854 result is the same width as the operands, this instruction returns the
5855 correct result for both signed and unsigned integers. If a full product
5856 (e.g. ``i32`` * ``i32`` -> ``i64``) is needed, the operands should be
5857 sign-extended or zero-extended as appropriate to the width of the full
5860 ``nuw`` and ``nsw`` stand for "No Unsigned Wrap" and "No Signed Wrap",
5861 respectively. If the ``nuw`` and/or ``nsw`` keywords are present, the
5862 result value of the ``mul`` is a :ref:`poison value <poisonvalues>` if
5863 unsigned and/or signed overflow, respectively, occurs.
5868 .. code-block:: llvm
5870 <result> = mul i32 4, %var ; yields i32:result = 4 * %var
5874 '``fmul``' Instruction
5875 ^^^^^^^^^^^^^^^^^^^^^^
5882 <result> = fmul [fast-math flags]* <ty> <op1>, <op2> ; yields ty:result
5887 The '``fmul``' instruction returns the product of its two operands.
5892 The two arguments to the '``fmul``' instruction must be :ref:`floating
5893 point <t_floating>` or :ref:`vector <t_vector>` of floating point values.
5894 Both arguments must have identical types.
5899 The value produced is the floating point product of the two operands.
5900 This instruction can also take any number of :ref:`fast-math
5901 flags <fastmath>`, which are optimization hints to enable otherwise
5902 unsafe floating point optimizations:
5907 .. code-block:: llvm
5909 <result> = fmul float 4.0, %var ; yields float:result = 4.0 * %var
5911 '``udiv``' Instruction
5912 ^^^^^^^^^^^^^^^^^^^^^^
5919 <result> = udiv <ty> <op1>, <op2> ; yields ty:result
5920 <result> = udiv exact <ty> <op1>, <op2> ; yields ty:result
5925 The '``udiv``' instruction returns the quotient of its two operands.
5930 The two arguments to the '``udiv``' instruction must be
5931 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer values. Both
5932 arguments must have identical types.
5937 The value produced is the unsigned integer quotient of the two operands.
5939 Note that unsigned integer division and signed integer division are
5940 distinct operations; for signed integer division, use '``sdiv``'.
5942 Division by zero leads to undefined behavior.
5944 If the ``exact`` keyword is present, the result value of the ``udiv`` is
5945 a :ref:`poison value <poisonvalues>` if %op1 is not a multiple of %op2 (as
5946 such, "((a udiv exact b) mul b) == a").
5951 .. code-block:: llvm
5953 <result> = udiv i32 4, %var ; yields i32:result = 4 / %var
5955 '``sdiv``' Instruction
5956 ^^^^^^^^^^^^^^^^^^^^^^
5963 <result> = sdiv <ty> <op1>, <op2> ; yields ty:result
5964 <result> = sdiv exact <ty> <op1>, <op2> ; yields ty:result
5969 The '``sdiv``' instruction returns the quotient of its two operands.
5974 The two arguments to the '``sdiv``' instruction must be
5975 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer values. Both
5976 arguments must have identical types.
5981 The value produced is the signed integer quotient of the two operands
5982 rounded towards zero.
5984 Note that signed integer division and unsigned integer division are
5985 distinct operations; for unsigned integer division, use '``udiv``'.
5987 Division by zero leads to undefined behavior. Overflow also leads to
5988 undefined behavior; this is a rare case, but can occur, for example, by
5989 doing a 32-bit division of -2147483648 by -1.
5991 If the ``exact`` keyword is present, the result value of the ``sdiv`` is
5992 a :ref:`poison value <poisonvalues>` if the result would be rounded.
5997 .. code-block:: llvm
5999 <result> = sdiv i32 4, %var ; yields i32:result = 4 / %var
6003 '``fdiv``' Instruction
6004 ^^^^^^^^^^^^^^^^^^^^^^
6011 <result> = fdiv [fast-math flags]* <ty> <op1>, <op2> ; yields ty:result
6016 The '``fdiv``' instruction returns the quotient of its two operands.
6021 The two arguments to the '``fdiv``' instruction must be :ref:`floating
6022 point <t_floating>` or :ref:`vector <t_vector>` of floating point values.
6023 Both arguments must have identical types.
6028 The value produced is the floating point quotient of the two operands.
6029 This instruction can also take any number of :ref:`fast-math
6030 flags <fastmath>`, which are optimization hints to enable otherwise
6031 unsafe floating point optimizations:
6036 .. code-block:: llvm
6038 <result> = fdiv float 4.0, %var ; yields float:result = 4.0 / %var
6040 '``urem``' Instruction
6041 ^^^^^^^^^^^^^^^^^^^^^^
6048 <result> = urem <ty> <op1>, <op2> ; yields ty:result
6053 The '``urem``' instruction returns the remainder from the unsigned
6054 division of its two arguments.
6059 The two arguments to the '``urem``' instruction must be
6060 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer values. Both
6061 arguments must have identical types.
6066 This instruction returns the unsigned integer *remainder* of a division.
6067 This instruction always performs an unsigned division to get the
6070 Note that unsigned integer remainder and signed integer remainder are
6071 distinct operations; for signed integer remainder, use '``srem``'.
6073 Taking the remainder of a division by zero leads to undefined behavior.
6078 .. code-block:: llvm
6080 <result> = urem i32 4, %var ; yields i32:result = 4 % %var
6082 '``srem``' Instruction
6083 ^^^^^^^^^^^^^^^^^^^^^^
6090 <result> = srem <ty> <op1>, <op2> ; yields ty:result
6095 The '``srem``' instruction returns the remainder from the signed
6096 division of its two operands. This instruction can also take
6097 :ref:`vector <t_vector>` versions of the values in which case the elements
6103 The two arguments to the '``srem``' instruction must be
6104 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer values. Both
6105 arguments must have identical types.
6110 This instruction returns the *remainder* of a division (where the result
6111 is either zero or has the same sign as the dividend, ``op1``), not the
6112 *modulo* operator (where the result is either zero or has the same sign
6113 as the divisor, ``op2``) of a value. For more information about the
6114 difference, see `The Math
6115 Forum <http://mathforum.org/dr.math/problems/anne.4.28.99.html>`_. For a
6116 table of how this is implemented in various languages, please see
6118 operation <http://en.wikipedia.org/wiki/Modulo_operation>`_.
6120 Note that signed integer remainder and unsigned integer remainder are
6121 distinct operations; for unsigned integer remainder, use '``urem``'.
6123 Taking the remainder of a division by zero leads to undefined behavior.
6124 Overflow also leads to undefined behavior; this is a rare case, but can
6125 occur, for example, by taking the remainder of a 32-bit division of
6126 -2147483648 by -1. (The remainder doesn't actually overflow, but this
6127 rule lets srem be implemented using instructions that return both the
6128 result of the division and the remainder.)
6133 .. code-block:: llvm
6135 <result> = srem i32 4, %var ; yields i32:result = 4 % %var
6139 '``frem``' Instruction
6140 ^^^^^^^^^^^^^^^^^^^^^^
6147 <result> = frem [fast-math flags]* <ty> <op1>, <op2> ; yields ty:result
6152 The '``frem``' instruction returns the remainder from the division of
6158 The two arguments to the '``frem``' instruction must be :ref:`floating
6159 point <t_floating>` or :ref:`vector <t_vector>` of floating point values.
6160 Both arguments must have identical types.
6165 This instruction returns the *remainder* of a division. The remainder
6166 has the same sign as the dividend. This instruction can also take any
6167 number of :ref:`fast-math flags <fastmath>`, which are optimization hints
6168 to enable otherwise unsafe floating point optimizations:
6173 .. code-block:: llvm
6175 <result> = frem float 4.0, %var ; yields float:result = 4.0 % %var
6179 Bitwise Binary Operations
6180 -------------------------
6182 Bitwise binary operators are used to do various forms of bit-twiddling
6183 in a program. They are generally very efficient instructions and can
6184 commonly be strength reduced from other instructions. They require two
6185 operands of the same type, execute an operation on them, and produce a
6186 single value. The resulting value is the same type as its operands.
6188 '``shl``' Instruction
6189 ^^^^^^^^^^^^^^^^^^^^^
6196 <result> = shl <ty> <op1>, <op2> ; yields ty:result
6197 <result> = shl nuw <ty> <op1>, <op2> ; yields ty:result
6198 <result> = shl nsw <ty> <op1>, <op2> ; yields ty:result
6199 <result> = shl nuw nsw <ty> <op1>, <op2> ; yields ty:result
6204 The '``shl``' instruction returns the first operand shifted to the left
6205 a specified number of bits.
6210 Both arguments to the '``shl``' instruction must be the same
6211 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer type.
6212 '``op2``' is treated as an unsigned value.
6217 The value produced is ``op1`` \* 2\ :sup:`op2` mod 2\ :sup:`n`,
6218 where ``n`` is the width of the result. If ``op2`` is (statically or
6219 dynamically) equal to or larger than the number of bits in
6220 ``op1``, the result is undefined. If the arguments are vectors, each
6221 vector element of ``op1`` is shifted by the corresponding shift amount
6224 If the ``nuw`` keyword is present, then the shift produces a :ref:`poison
6225 value <poisonvalues>` if it shifts out any non-zero bits. If the
6226 ``nsw`` keyword is present, then the shift produces a :ref:`poison
6227 value <poisonvalues>` if it shifts out any bits that disagree with the
6228 resultant sign bit. As such, NUW/NSW have the same semantics as they
6229 would if the shift were expressed as a mul instruction with the same
6230 nsw/nuw bits in (mul %op1, (shl 1, %op2)).
6235 .. code-block:: llvm
6237 <result> = shl i32 4, %var ; yields i32: 4 << %var
6238 <result> = shl i32 4, 2 ; yields i32: 16
6239 <result> = shl i32 1, 10 ; yields i32: 1024
6240 <result> = shl i32 1, 32 ; undefined
6241 <result> = shl <2 x i32> < i32 1, i32 1>, < i32 1, i32 2> ; yields: result=<2 x i32> < i32 2, i32 4>
6243 '``lshr``' Instruction
6244 ^^^^^^^^^^^^^^^^^^^^^^
6251 <result> = lshr <ty> <op1>, <op2> ; yields ty:result
6252 <result> = lshr exact <ty> <op1>, <op2> ; yields ty:result
6257 The '``lshr``' instruction (logical shift right) returns the first
6258 operand shifted to the right a specified number of bits with zero fill.
6263 Both arguments to the '``lshr``' instruction must be the same
6264 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer type.
6265 '``op2``' is treated as an unsigned value.
6270 This instruction always performs a logical shift right operation. The
6271 most significant bits of the result will be filled with zero bits after
6272 the shift. If ``op2`` is (statically or dynamically) equal to or larger
6273 than the number of bits in ``op1``, the result is undefined. If the
6274 arguments are vectors, each vector element of ``op1`` is shifted by the
6275 corresponding shift amount in ``op2``.
6277 If the ``exact`` keyword is present, the result value of the ``lshr`` is
6278 a :ref:`poison value <poisonvalues>` if any of the bits shifted out are
6284 .. code-block:: llvm
6286 <result> = lshr i32 4, 1 ; yields i32:result = 2
6287 <result> = lshr i32 4, 2 ; yields i32:result = 1
6288 <result> = lshr i8 4, 3 ; yields i8:result = 0
6289 <result> = lshr i8 -2, 1 ; yields i8:result = 0x7F
6290 <result> = lshr i32 1, 32 ; undefined
6291 <result> = lshr <2 x i32> < i32 -2, i32 4>, < i32 1, i32 2> ; yields: result=<2 x i32> < i32 0x7FFFFFFF, i32 1>
6293 '``ashr``' Instruction
6294 ^^^^^^^^^^^^^^^^^^^^^^
6301 <result> = ashr <ty> <op1>, <op2> ; yields ty:result
6302 <result> = ashr exact <ty> <op1>, <op2> ; yields ty:result
6307 The '``ashr``' instruction (arithmetic shift right) returns the first
6308 operand shifted to the right a specified number of bits with sign
6314 Both arguments to the '``ashr``' instruction must be the same
6315 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer type.
6316 '``op2``' is treated as an unsigned value.
6321 This instruction always performs an arithmetic shift right operation,
6322 The most significant bits of the result will be filled with the sign bit
6323 of ``op1``. If ``op2`` is (statically or dynamically) equal to or larger
6324 than the number of bits in ``op1``, the result is undefined. If the
6325 arguments are vectors, each vector element of ``op1`` is shifted by the
6326 corresponding shift amount in ``op2``.
6328 If the ``exact`` keyword is present, the result value of the ``ashr`` is
6329 a :ref:`poison value <poisonvalues>` if any of the bits shifted out are
6335 .. code-block:: llvm
6337 <result> = ashr i32 4, 1 ; yields i32:result = 2
6338 <result> = ashr i32 4, 2 ; yields i32:result = 1
6339 <result> = ashr i8 4, 3 ; yields i8:result = 0
6340 <result> = ashr i8 -2, 1 ; yields i8:result = -1
6341 <result> = ashr i32 1, 32 ; undefined
6342 <result> = ashr <2 x i32> < i32 -2, i32 4>, < i32 1, i32 3> ; yields: result=<2 x i32> < i32 -1, i32 0>
6344 '``and``' Instruction
6345 ^^^^^^^^^^^^^^^^^^^^^
6352 <result> = and <ty> <op1>, <op2> ; yields ty:result
6357 The '``and``' instruction returns the bitwise logical and of its two
6363 The two arguments to the '``and``' instruction must be
6364 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer values. Both
6365 arguments must have identical types.
6370 The truth table used for the '``and``' instruction is:
6387 .. code-block:: llvm
6389 <result> = and i32 4, %var ; yields i32:result = 4 & %var
6390 <result> = and i32 15, 40 ; yields i32:result = 8
6391 <result> = and i32 4, 8 ; yields i32:result = 0
6393 '``or``' Instruction
6394 ^^^^^^^^^^^^^^^^^^^^
6401 <result> = or <ty> <op1>, <op2> ; yields ty:result
6406 The '``or``' instruction returns the bitwise logical inclusive or of its
6412 The two arguments to the '``or``' instruction must be
6413 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer values. Both
6414 arguments must have identical types.
6419 The truth table used for the '``or``' instruction is:
6438 <result> = or i32 4, %var ; yields i32:result = 4 | %var
6439 <result> = or i32 15, 40 ; yields i32:result = 47
6440 <result> = or i32 4, 8 ; yields i32:result = 12
6442 '``xor``' Instruction
6443 ^^^^^^^^^^^^^^^^^^^^^
6450 <result> = xor <ty> <op1>, <op2> ; yields ty:result
6455 The '``xor``' instruction returns the bitwise logical exclusive or of
6456 its two operands. The ``xor`` is used to implement the "one's
6457 complement" operation, which is the "~" operator in C.
6462 The two arguments to the '``xor``' instruction must be
6463 :ref:`integer <t_integer>` or :ref:`vector <t_vector>` of integer values. Both
6464 arguments must have identical types.
6469 The truth table used for the '``xor``' instruction is:
6486 .. code-block:: llvm
6488 <result> = xor i32 4, %var ; yields i32:result = 4 ^ %var
6489 <result> = xor i32 15, 40 ; yields i32:result = 39
6490 <result> = xor i32 4, 8 ; yields i32:result = 12
6491 <result> = xor i32 %V, -1 ; yields i32:result = ~%V
6496 LLVM supports several instructions to represent vector operations in a
6497 target-independent manner. These instructions cover the element-access
6498 and vector-specific operations needed to process vectors effectively.
6499 While LLVM does directly support these vector operations, many
6500 sophisticated algorithms will want to use target-specific intrinsics to
6501 take full advantage of a specific target.
6503 .. _i_extractelement:
6505 '``extractelement``' Instruction
6506 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
6513 <result> = extractelement <n x <ty>> <val>, <ty2> <idx> ; yields <ty>
6518 The '``extractelement``' instruction extracts a single scalar element
6519 from a vector at a specified index.
6524 The first operand of an '``extractelement``' instruction is a value of
6525 :ref:`vector <t_vector>` type. The second operand is an index indicating
6526 the position from which to extract the element. The index may be a
6527 variable of any integer type.
6532 The result is a scalar of the same type as the element type of ``val``.
6533 Its value is the value at position ``idx`` of ``val``. If ``idx``
6534 exceeds the length of ``val``, the results are undefined.
6539 .. code-block:: llvm
6541 <result> = extractelement <4 x i32> %vec, i32 0 ; yields i32
6543 .. _i_insertelement:
6545 '``insertelement``' Instruction
6546 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
6553 <result> = insertelement <n x <ty>> <val>, <ty> <elt>, <ty2> <idx> ; yields <n x <ty>>
6558 The '``insertelement``' instruction inserts a scalar element into a
6559 vector at a specified index.
6564 The first operand of an '``insertelement``' instruction is a value of
6565 :ref:`vector <t_vector>` type. The second operand is a scalar value whose
6566 type must equal the element type of the first operand. The third operand
6567 is an index indicating the position at which to insert the value. The
6568 index may be a variable of any integer type.
6573 The result is a vector of the same type as ``val``. Its element values
6574 are those of ``val`` except at position ``idx``, where it gets the value
6575 ``elt``. If ``idx`` exceeds the length of ``val``, the results are
6581 .. code-block:: llvm
6583 <result> = insertelement <4 x i32> %vec, i32 1, i32 0 ; yields <4 x i32>
6585 .. _i_shufflevector:
6587 '``shufflevector``' Instruction
6588 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
6595 <result> = shufflevector <n x <ty>> <v1>, <n x <ty>> <v2>, <m x i32> <mask> ; yields <m x <ty>>
6600 The '``shufflevector``' instruction constructs a permutation of elements
6601 from two input vectors, returning a vector with the same element type as
6602 the input and length that is the same as the shuffle mask.
6607 The first two operands of a '``shufflevector``' instruction are vectors
6608 with the same type. The third argument is a shuffle mask whose element
6609 type is always 'i32'. The result of the instruction is a vector whose
6610 length is the same as the shuffle mask and whose element type is the
6611 same as the element type of the first two operands.
6613 The shuffle mask operand is required to be a constant vector with either
6614 constant integer or undef values.
6619 The elements of the two input vectors are numbered from left to right
6620 across both of the vectors. The shuffle mask operand specifies, for each
6621 element of the result vector, which element of the two input vectors the
6622 result element gets. The element selector may be undef (meaning "don't
6623 care") and the second operand may be undef if performing a shuffle from
6629 .. code-block:: llvm
6631 <result> = shufflevector <4 x i32> %v1, <4 x i32> %v2,
6632 <4 x i32> <i32 0, i32 4, i32 1, i32 5> ; yields <4 x i32>
6633 <result> = shufflevector <4 x i32> %v1, <4 x i32> undef,
6634 <4 x i32> <i32 0, i32 1, i32 2, i32 3> ; yields <4 x i32> - Identity shuffle.
6635 <result> = shufflevector <8 x i32> %v1, <8 x i32> undef,
6636 <4 x i32> <i32 0, i32 1, i32 2, i32 3> ; yields <4 x i32>
6637 <result> = shufflevector <4 x i32> %v1, <4 x i32> %v2,
6638 <8 x i32> <i32 0, i32 1, i32 2, i32 3, i32 4, i32 5, i32 6, i32 7 > ; yields <8 x i32>
6640 Aggregate Operations
6641 --------------------
6643 LLVM supports several instructions for working with
6644 :ref:`aggregate <t_aggregate>` values.
6648 '``extractvalue``' Instruction
6649 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
6656 <result> = extractvalue <aggregate type> <val>, <idx>{, <idx>}*
6661 The '``extractvalue``' instruction extracts the value of a member field
6662 from an :ref:`aggregate <t_aggregate>` value.
6667 The first operand of an '``extractvalue``' instruction is a value of
6668 :ref:`struct <t_struct>` or :ref:`array <t_array>` type. The operands are
6669 constant indices to specify which value to extract in a similar manner
6670 as indices in a '``getelementptr``' instruction.
6672 The major differences to ``getelementptr`` indexing are:
6674 - Since the value being indexed is not a pointer, the first index is
6675 omitted and assumed to be zero.
6676 - At least one index must be specified.
6677 - Not only struct indices but also array indices must be in bounds.
6682 The result is the value at the position in the aggregate specified by
6688 .. code-block:: llvm
6690 <result> = extractvalue {i32, float} %agg, 0 ; yields i32
6694 '``insertvalue``' Instruction
6695 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
6702 <result> = insertvalue <aggregate type> <val>, <ty> <elt>, <idx>{, <idx>}* ; yields <aggregate type>
6707 The '``insertvalue``' instruction inserts a value into a member field in
6708 an :ref:`aggregate <t_aggregate>` value.
6713 The first operand of an '``insertvalue``' instruction is a value of
6714 :ref:`struct <t_struct>` or :ref:`array <t_array>` type. The second operand is
6715 a first-class value to insert. The following operands are constant
6716 indices indicating the position at which to insert the value in a
6717 similar manner as indices in a '``extractvalue``' instruction. The value
6718 to insert must have the same type as the value identified by the
6724 The result is an aggregate of the same type as ``val``. Its value is
6725 that of ``val`` except that the value at the position specified by the
6726 indices is that of ``elt``.
6731 .. code-block:: llvm
6733 %agg1 = insertvalue {i32, float} undef, i32 1, 0 ; yields {i32 1, float undef}
6734 %agg2 = insertvalue {i32, float} %agg1, float %val, 1 ; yields {i32 1, float %val}
6735 %agg3 = insertvalue {i32, {float}} undef, float %val, 1, 0 ; yields {i32 undef, {float %val}}
6739 Memory Access and Addressing Operations
6740 ---------------------------------------
6742 A key design point of an SSA-based representation is how it represents
6743 memory. In LLVM, no memory locations are in SSA form, which makes things
6744 very simple. This section describes how to read, write, and allocate
6749 '``alloca``' Instruction
6750 ^^^^^^^^^^^^^^^^^^^^^^^^
6757 <result> = alloca [inalloca] <type> [, <ty> <NumElements>] [, align <alignment>] ; yields type*:result
6762 The '``alloca``' instruction allocates memory on the stack frame of the
6763 currently executing function, to be automatically released when this
6764 function returns to its caller. The object is always allocated in the
6765 generic address space (address space zero).
6770 The '``alloca``' instruction allocates ``sizeof(<type>)*NumElements``
6771 bytes of memory on the runtime stack, returning a pointer of the
6772 appropriate type to the program. If "NumElements" is specified, it is
6773 the number of elements allocated, otherwise "NumElements" is defaulted
6774 to be one. If a constant alignment is specified, the value result of the
6775 allocation is guaranteed to be aligned to at least that boundary. The
6776 alignment may not be greater than ``1 << 29``. If not specified, or if
6777 zero, the target can choose to align the allocation on any convenient
6778 boundary compatible with the type.
6780 '``type``' may be any sized type.
6785 Memory is allocated; a pointer is returned. The operation is undefined
6786 if there is insufficient stack space for the allocation. '``alloca``'d
6787 memory is automatically released when the function returns. The
6788 '``alloca``' instruction is commonly used to represent automatic
6789 variables that must have an address available. When the function returns
6790 (either with the ``ret`` or ``resume`` instructions), the memory is
6791 reclaimed. Allocating zero bytes is legal, but the result is undefined.
6792 The order in which memory is allocated (ie., which way the stack grows)
6798 .. code-block:: llvm
6800 %ptr = alloca i32 ; yields i32*:ptr
6801 %ptr = alloca i32, i32 4 ; yields i32*:ptr
6802 %ptr = alloca i32, i32 4, align 1024 ; yields i32*:ptr
6803 %ptr = alloca i32, align 1024 ; yields i32*:ptr
6807 '``load``' Instruction
6808 ^^^^^^^^^^^^^^^^^^^^^^
6815 <result> = load [volatile] <ty>, <ty>* <pointer>[, align <alignment>][, !nontemporal !<index>][, !invariant.load !<index>][, !invariant.group !<index>][, !nonnull !<index>][, !dereferenceable !<deref_bytes_node>][, !dereferenceable_or_null !<deref_bytes_node>]
6816 <result> = load atomic [volatile] <ty>* <pointer> [singlethread] <ordering>, align <alignment> [, !invariant.group !<index>]
6817 !<index> = !{ i32 1 }
6818 !<deref_bytes_node> = !{i64 <dereferenceable_bytes>}
6823 The '``load``' instruction is used to read from memory.
6828 The argument to the ``load`` instruction specifies the memory address
6829 from which to load. The type specified must be a :ref:`first
6830 class <t_firstclass>` type. If the ``load`` is marked as ``volatile``,
6831 then the optimizer is not allowed to modify the number or order of
6832 execution of this ``load`` with other :ref:`volatile
6833 operations <volatile>`.
6835 If the ``load`` is marked as ``atomic``, it takes an extra
6836 :ref:`ordering <ordering>` and optional ``singlethread`` argument. The
6837 ``release`` and ``acq_rel`` orderings are not valid on ``load``
6838 instructions. Atomic loads produce :ref:`defined <memmodel>` results
6839 when they may see multiple atomic stores. The type of the pointee must
6840 be an integer type whose bit width is a power of two greater than or
6841 equal to eight and less than or equal to a target-specific size limit.
6842 ``align`` must be explicitly specified on atomic loads, and the load has
6843 undefined behavior if the alignment is not set to a value which is at
6844 least the size in bytes of the pointee. ``!nontemporal`` does not have
6845 any defined semantics for atomic loads.
6847 The optional constant ``align`` argument specifies the alignment of the
6848 operation (that is, the alignment of the memory address). A value of 0
6849 or an omitted ``align`` argument means that the operation has the ABI
6850 alignment for the target. It is the responsibility of the code emitter
6851 to ensure that the alignment information is correct. Overestimating the
6852 alignment results in undefined behavior. Underestimating the alignment
6853 may produce less efficient code. An alignment of 1 is always safe. The
6854 maximum possible alignment is ``1 << 29``.
6856 The optional ``!nontemporal`` metadata must reference a single
6857 metadata name ``<index>`` corresponding to a metadata node with one
6858 ``i32`` entry of value 1. The existence of the ``!nontemporal``
6859 metadata on the instruction tells the optimizer and code generator
6860 that this load is not expected to be reused in the cache. The code
6861 generator may select special instructions to save cache bandwidth, such
6862 as the ``MOVNT`` instruction on x86.
6864 The optional ``!invariant.load`` metadata must reference a single
6865 metadata name ``<index>`` corresponding to a metadata node with no
6866 entries. The existence of the ``!invariant.load`` metadata on the
6867 instruction tells the optimizer and code generator that the address
6868 operand to this load points to memory which can be assumed unchanged.
6869 Being invariant does not imply that a location is dereferenceable,
6870 but it does imply that once the location is known dereferenceable
6871 its value is henceforth unchanging.
6873 The optional ``!invariant.group`` metadata must reference a single metadata name
6874 ``<index>`` corresponding to a metadata node. See ``invariant.group`` metadata.
6876 The optional ``!nonnull`` metadata must reference a single
6877 metadata name ``<index>`` corresponding to a metadata node with no
6878 entries. The existence of the ``!nonnull`` metadata on the
6879 instruction tells the optimizer that the value loaded is known to
6880 never be null. This is analogous to the ``nonnull`` attribute
6881 on parameters and return values. This metadata can only be applied
6882 to loads of a pointer type.
6884 The optional ``!dereferenceable`` metadata must reference a single metadata
6885 name ``<deref_bytes_node>`` corresponding to a metadata node with one ``i64``
6886 entry. The existence of the ``!dereferenceable`` metadata on the instruction
6887 tells the optimizer that the value loaded is known to be dereferenceable.
6888 The number of bytes known to be dereferenceable is specified by the integer
6889 value in the metadata node. This is analogous to the ''dereferenceable''
6890 attribute on parameters and return values. This metadata can only be applied
6891 to loads of a pointer type.
6893 The optional ``!dereferenceable_or_null`` metadata must reference a single
6894 metadata name ``<deref_bytes_node>`` corresponding to a metadata node with one
6895 ``i64`` entry. The existence of the ``!dereferenceable_or_null`` metadata on the
6896 instruction tells the optimizer that the value loaded is known to be either
6897 dereferenceable or null.
6898 The number of bytes known to be dereferenceable is specified by the integer
6899 value in the metadata node. This is analogous to the ''dereferenceable_or_null''
6900 attribute on parameters and return values. This metadata can only be applied
6901 to loads of a pointer type.
6906 The location of memory pointed to is loaded. If the value being loaded
6907 is of scalar type then the number of bytes read does not exceed the
6908 minimum number of bytes needed to hold all bits of the type. For
6909 example, loading an ``i24`` reads at most three bytes. When loading a
6910 value of a type like ``i20`` with a size that is not an integral number
6911 of bytes, the result is undefined if the value was not originally
6912 written using a store of the same type.
6917 .. code-block:: llvm
6919 %ptr = alloca i32 ; yields i32*:ptr
6920 store i32 3, i32* %ptr ; yields void
6921 %val = load i32, i32* %ptr ; yields i32:val = i32 3
6925 '``store``' Instruction
6926 ^^^^^^^^^^^^^^^^^^^^^^^
6933 store [volatile] <ty> <value>, <ty>* <pointer>[, align <alignment>][, !nontemporal !<index>][, !invariant.group !<index>] ; yields void
6934 store atomic [volatile] <ty> <value>, <ty>* <pointer> [singlethread] <ordering>, align <alignment> [, !invariant.group !<index>] ; yields void
6939 The '``store``' instruction is used to write to memory.
6944 There are two arguments to the ``store`` instruction: a value to store
6945 and an address at which to store it. The type of the ``<pointer>``
6946 operand must be a pointer to the :ref:`first class <t_firstclass>` type of
6947 the ``<value>`` operand. If the ``store`` is marked as ``volatile``,
6948 then the optimizer is not allowed to modify the number or order of
6949 execution of this ``store`` with other :ref:`volatile
6950 operations <volatile>`.
6952 If the ``store`` is marked as ``atomic``, it takes an extra
6953 :ref:`ordering <ordering>` and optional ``singlethread`` argument. The
6954 ``acquire`` and ``acq_rel`` orderings aren't valid on ``store``
6955 instructions. Atomic loads produce :ref:`defined <memmodel>` results
6956 when they may see multiple atomic stores. The type of the pointee must
6957 be an integer type whose bit width is a power of two greater than or
6958 equal to eight and less than or equal to a target-specific size limit.
6959 ``align`` must be explicitly specified on atomic stores, and the store
6960 has undefined behavior if the alignment is not set to a value which is
6961 at least the size in bytes of the pointee. ``!nontemporal`` does not
6962 have any defined semantics for atomic stores.
6964 The optional constant ``align`` argument specifies the alignment of the
6965 operation (that is, the alignment of the memory address). A value of 0
6966 or an omitted ``align`` argument means that the operation has the ABI
6967 alignment for the target. It is the responsibility of the code emitter
6968 to ensure that the alignment information is correct. Overestimating the
6969 alignment results in undefined behavior. Underestimating the
6970 alignment may produce less efficient code. An alignment of 1 is always
6971 safe. The maximum possible alignment is ``1 << 29``.
6973 The optional ``!nontemporal`` metadata must reference a single metadata
6974 name ``<index>`` corresponding to a metadata node with one ``i32`` entry of
6975 value 1. The existence of the ``!nontemporal`` metadata on the instruction
6976 tells the optimizer and code generator that this load is not expected to
6977 be reused in the cache. The code generator may select special
6978 instructions to save cache bandwidth, such as the MOVNT instruction on
6981 The optional ``!invariant.group`` metadata must reference a
6982 single metadata name ``<index>``. See ``invariant.group`` metadata.
6987 The contents of memory are updated to contain ``<value>`` at the
6988 location specified by the ``<pointer>`` operand. If ``<value>`` is
6989 of scalar type then the number of bytes written does not exceed the
6990 minimum number of bytes needed to hold all bits of the type. For
6991 example, storing an ``i24`` writes at most three bytes. When writing a
6992 value of a type like ``i20`` with a size that is not an integral number
6993 of bytes, it is unspecified what happens to the extra bits that do not
6994 belong to the type, but they will typically be overwritten.
6999 .. code-block:: llvm
7001 %ptr = alloca i32 ; yields i32*:ptr
7002 store i32 3, i32* %ptr ; yields void
7003 %val = load i32, i32* %ptr ; yields i32:val = i32 3
7007 '``fence``' Instruction
7008 ^^^^^^^^^^^^^^^^^^^^^^^
7015 fence [singlethread] <ordering> ; yields void
7020 The '``fence``' instruction is used to introduce happens-before edges
7026 '``fence``' instructions take an :ref:`ordering <ordering>` argument which
7027 defines what *synchronizes-with* edges they add. They can only be given
7028 ``acquire``, ``release``, ``acq_rel``, and ``seq_cst`` orderings.
7033 A fence A which has (at least) ``release`` ordering semantics
7034 *synchronizes with* a fence B with (at least) ``acquire`` ordering
7035 semantics if and only if there exist atomic operations X and Y, both
7036 operating on some atomic object M, such that A is sequenced before X, X
7037 modifies M (either directly or through some side effect of a sequence
7038 headed by X), Y is sequenced before B, and Y observes M. This provides a
7039 *happens-before* dependency between A and B. Rather than an explicit
7040 ``fence``, one (but not both) of the atomic operations X or Y might
7041 provide a ``release`` or ``acquire`` (resp.) ordering constraint and
7042 still *synchronize-with* the explicit ``fence`` and establish the
7043 *happens-before* edge.
7045 A ``fence`` which has ``seq_cst`` ordering, in addition to having both
7046 ``acquire`` and ``release`` semantics specified above, participates in
7047 the global program order of other ``seq_cst`` operations and/or fences.
7049 The optional ":ref:`singlethread <singlethread>`" argument specifies
7050 that the fence only synchronizes with other fences in the same thread.
7051 (This is useful for interacting with signal handlers.)
7056 .. code-block:: llvm
7058 fence acquire ; yields void
7059 fence singlethread seq_cst ; yields void
7063 '``cmpxchg``' Instruction
7064 ^^^^^^^^^^^^^^^^^^^^^^^^^
7071 cmpxchg [weak] [volatile] <ty>* <pointer>, <ty> <cmp>, <ty> <new> [singlethread] <success ordering> <failure ordering> ; yields { ty, i1 }
7076 The '``cmpxchg``' instruction is used to atomically modify memory. It
7077 loads a value in memory and compares it to a given value. If they are
7078 equal, it tries to store a new value into the memory.
7083 There are three arguments to the '``cmpxchg``' instruction: an address
7084 to operate on, a value to compare to the value currently be at that
7085 address, and a new value to place at that address if the compared values
7086 are equal. The type of '<cmp>' must be an integer type whose bit width
7087 is a power of two greater than or equal to eight and less than or equal
7088 to a target-specific size limit. '<cmp>' and '<new>' must have the same
7089 type, and the type of '<pointer>' must be a pointer to that type. If the
7090 ``cmpxchg`` is marked as ``volatile``, then the optimizer is not allowed
7091 to modify the number or order of execution of this ``cmpxchg`` with
7092 other :ref:`volatile operations <volatile>`.
7094 The success and failure :ref:`ordering <ordering>` arguments specify how this
7095 ``cmpxchg`` synchronizes with other atomic operations. Both ordering parameters
7096 must be at least ``monotonic``, the ordering constraint on failure must be no
7097 stronger than that on success, and the failure ordering cannot be either
7098 ``release`` or ``acq_rel``.
7100 The optional "``singlethread``" argument declares that the ``cmpxchg``
7101 is only atomic with respect to code (usually signal handlers) running in
7102 the same thread as the ``cmpxchg``. Otherwise the cmpxchg is atomic with
7103 respect to all other code in the system.
7105 The pointer passed into cmpxchg must have alignment greater than or
7106 equal to the size in memory of the operand.
7111 The contents of memory at the location specified by the '``<pointer>``' operand
7112 is read and compared to '``<cmp>``'; if the read value is the equal, the
7113 '``<new>``' is written. The original value at the location is returned, together
7114 with a flag indicating success (true) or failure (false).
7116 If the cmpxchg operation is marked as ``weak`` then a spurious failure is
7117 permitted: the operation may not write ``<new>`` even if the comparison
7120 If the cmpxchg operation is strong (the default), the i1 value is 1 if and only
7121 if the value loaded equals ``cmp``.
7123 A successful ``cmpxchg`` is a read-modify-write instruction for the purpose of
7124 identifying release sequences. A failed ``cmpxchg`` is equivalent to an atomic
7125 load with an ordering parameter determined the second ordering parameter.
7130 .. code-block:: llvm
7133 %orig = atomic load i32, i32* %ptr unordered ; yields i32
7137 %cmp = phi i32 [ %orig, %entry ], [%old, %loop]
7138 %squared = mul i32 %cmp, %cmp
7139 %val_success = cmpxchg i32* %ptr, i32 %cmp, i32 %squared acq_rel monotonic ; yields { i32, i1 }
7140 %value_loaded = extractvalue { i32, i1 } %val_success, 0
7141 %success = extractvalue { i32, i1 } %val_success, 1
7142 br i1 %success, label %done, label %loop
7149 '``atomicrmw``' Instruction
7150 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
7157 atomicrmw [volatile] <operation> <ty>* <pointer>, <ty> <value> [singlethread] <ordering> ; yields ty
7162 The '``atomicrmw``' instruction is used to atomically modify memory.
7167 There are three arguments to the '``atomicrmw``' instruction: an
7168 operation to apply, an address whose value to modify, an argument to the
7169 operation. The operation must be one of the following keywords:
7183 The type of '<value>' must be an integer type whose bit width is a power
7184 of two greater than or equal to eight and less than or equal to a
7185 target-specific size limit. The type of the '``<pointer>``' operand must
7186 be a pointer to that type. If the ``atomicrmw`` is marked as
7187 ``volatile``, then the optimizer is not allowed to modify the number or
7188 order of execution of this ``atomicrmw`` with other :ref:`volatile
7189 operations <volatile>`.
7194 The contents of memory at the location specified by the '``<pointer>``'
7195 operand are atomically read, modified, and written back. The original
7196 value at the location is returned. The modification is specified by the
7199 - xchg: ``*ptr = val``
7200 - add: ``*ptr = *ptr + val``
7201 - sub: ``*ptr = *ptr - val``
7202 - and: ``*ptr = *ptr & val``
7203 - nand: ``*ptr = ~(*ptr & val)``
7204 - or: ``*ptr = *ptr | val``
7205 - xor: ``*ptr = *ptr ^ val``
7206 - max: ``*ptr = *ptr > val ? *ptr : val`` (using a signed comparison)
7207 - min: ``*ptr = *ptr < val ? *ptr : val`` (using a signed comparison)
7208 - umax: ``*ptr = *ptr > val ? *ptr : val`` (using an unsigned
7210 - umin: ``*ptr = *ptr < val ? *ptr : val`` (using an unsigned
7216 .. code-block:: llvm
7218 %old = atomicrmw add i32* %ptr, i32 1 acquire ; yields i32
7220 .. _i_getelementptr:
7222 '``getelementptr``' Instruction
7223 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7230 <result> = getelementptr <ty>, <ty>* <ptrval>{, <ty> <idx>}*
7231 <result> = getelementptr inbounds <ty>, <ty>* <ptrval>{, <ty> <idx>}*
7232 <result> = getelementptr <ty>, <ptr vector> <ptrval>, <vector index type> <idx>
7237 The '``getelementptr``' instruction is used to get the address of a
7238 subelement of an :ref:`aggregate <t_aggregate>` data structure. It performs
7239 address calculation only and does not access memory. The instruction can also
7240 be used to calculate a vector of such addresses.
7245 The first argument is always a type used as the basis for the calculations.
7246 The second argument is always a pointer or a vector of pointers, and is the
7247 base address to start from. The remaining arguments are indices
7248 that indicate which of the elements of the aggregate object are indexed.
7249 The interpretation of each index is dependent on the type being indexed
7250 into. The first index always indexes the pointer value given as the
7251 first argument, the second index indexes a value of the type pointed to
7252 (not necessarily the value directly pointed to, since the first index
7253 can be non-zero), etc. The first type indexed into must be a pointer
7254 value, subsequent types can be arrays, vectors, and structs. Note that
7255 subsequent types being indexed into can never be pointers, since that
7256 would require loading the pointer before continuing calculation.
7258 The type of each index argument depends on the type it is indexing into.
7259 When indexing into a (optionally packed) structure, only ``i32`` integer
7260 **constants** are allowed (when using a vector of indices they must all
7261 be the **same** ``i32`` integer constant). When indexing into an array,
7262 pointer or vector, integers of any width are allowed, and they are not
7263 required to be constant. These integers are treated as signed values
7266 For example, let's consider a C code fragment and how it gets compiled
7282 int *foo(struct ST *s) {
7283 return &s[1].Z.B[5][13];
7286 The LLVM code generated by Clang is:
7288 .. code-block:: llvm
7290 %struct.RT = type { i8, [10 x [20 x i32]], i8 }
7291 %struct.ST = type { i32, double, %struct.RT }
7293 define i32* @foo(%struct.ST* %s) nounwind uwtable readnone optsize ssp {
7295 %arrayidx = getelementptr inbounds %struct.ST, %struct.ST* %s, i64 1, i32 2, i32 1, i64 5, i64 13
7302 In the example above, the first index is indexing into the
7303 '``%struct.ST*``' type, which is a pointer, yielding a '``%struct.ST``'
7304 = '``{ i32, double, %struct.RT }``' type, a structure. The second index
7305 indexes into the third element of the structure, yielding a
7306 '``%struct.RT``' = '``{ i8 , [10 x [20 x i32]], i8 }``' type, another
7307 structure. The third index indexes into the second element of the
7308 structure, yielding a '``[10 x [20 x i32]]``' type, an array. The two
7309 dimensions of the array are subscripted into, yielding an '``i32``'
7310 type. The '``getelementptr``' instruction returns a pointer to this
7311 element, thus computing a value of '``i32*``' type.
7313 Note that it is perfectly legal to index partially through a structure,
7314 returning a pointer to an inner element. Because of this, the LLVM code
7315 for the given testcase is equivalent to:
7317 .. code-block:: llvm
7319 define i32* @foo(%struct.ST* %s) {
7320 %t1 = getelementptr %struct.ST, %struct.ST* %s, i32 1 ; yields %struct.ST*:%t1
7321 %t2 = getelementptr %struct.ST, %struct.ST* %t1, i32 0, i32 2 ; yields %struct.RT*:%t2
7322 %t3 = getelementptr %struct.RT, %struct.RT* %t2, i32 0, i32 1 ; yields [10 x [20 x i32]]*:%t3
7323 %t4 = getelementptr [10 x [20 x i32]], [10 x [20 x i32]]* %t3, i32 0, i32 5 ; yields [20 x i32]*:%t4
7324 %t5 = getelementptr [20 x i32], [20 x i32]* %t4, i32 0, i32 13 ; yields i32*:%t5
7328 If the ``inbounds`` keyword is present, the result value of the
7329 ``getelementptr`` is a :ref:`poison value <poisonvalues>` if the base
7330 pointer is not an *in bounds* address of an allocated object, or if any
7331 of the addresses that would be formed by successive addition of the
7332 offsets implied by the indices to the base address with infinitely
7333 precise signed arithmetic are not an *in bounds* address of that
7334 allocated object. The *in bounds* addresses for an allocated object are
7335 all the addresses that point into the object, plus the address one byte
7336 past the end. In cases where the base is a vector of pointers the
7337 ``inbounds`` keyword applies to each of the computations element-wise.
7339 If the ``inbounds`` keyword is not present, the offsets are added to the
7340 base address with silently-wrapping two's complement arithmetic. If the
7341 offsets have a different width from the pointer, they are sign-extended
7342 or truncated to the width of the pointer. The result value of the
7343 ``getelementptr`` may be outside the object pointed to by the base
7344 pointer. The result value may not necessarily be used to access memory
7345 though, even if it happens to point into allocated storage. See the
7346 :ref:`Pointer Aliasing Rules <pointeraliasing>` section for more
7349 The getelementptr instruction is often confusing. For some more insight
7350 into how it works, see :doc:`the getelementptr FAQ <GetElementPtr>`.
7355 .. code-block:: llvm
7357 ; yields [12 x i8]*:aptr
7358 %aptr = getelementptr {i32, [12 x i8]}, {i32, [12 x i8]}* %saptr, i64 0, i32 1
7360 %vptr = getelementptr {i32, <2 x i8>}, {i32, <2 x i8>}* %svptr, i64 0, i32 1, i32 1
7362 %eptr = getelementptr [12 x i8], [12 x i8]* %aptr, i64 0, i32 1
7364 %iptr = getelementptr [10 x i32], [10 x i32]* @arr, i16 0, i16 0
7369 The ``getelementptr`` returns a vector of pointers, instead of a single address,
7370 when one or more of its arguments is a vector. In such cases, all vector
7371 arguments should have the same number of elements, and every scalar argument
7372 will be effectively broadcast into a vector during address calculation.
7374 .. code-block:: llvm
7376 ; All arguments are vectors:
7377 ; A[i] = ptrs[i] + offsets[i]*sizeof(i8)
7378 %A = getelementptr i8, <4 x i8*> %ptrs, <4 x i64> %offsets
7380 ; Add the same scalar offset to each pointer of a vector:
7381 ; A[i] = ptrs[i] + offset*sizeof(i8)
7382 %A = getelementptr i8, <4 x i8*> %ptrs, i64 %offset
7384 ; Add distinct offsets to the same pointer:
7385 ; A[i] = ptr + offsets[i]*sizeof(i8)
7386 %A = getelementptr i8, i8* %ptr, <4 x i64> %offsets
7388 ; In all cases described above the type of the result is <4 x i8*>
7390 The two following instructions are equivalent:
7392 .. code-block:: llvm
7394 getelementptr %struct.ST, <4 x %struct.ST*> %s, <4 x i64> %ind1,
7395 <4 x i32> <i32 2, i32 2, i32 2, i32 2>,
7396 <4 x i32> <i32 1, i32 1, i32 1, i32 1>,
7398 <4 x i64> <i64 13, i64 13, i64 13, i64 13>
7400 getelementptr %struct.ST, <4 x %struct.ST*> %s, <4 x i64> %ind1,
7401 i32 2, i32 1, <4 x i32> %ind4, i64 13
7403 Let's look at the C code, where the vector version of ``getelementptr``
7408 // Let's assume that we vectorize the following loop:
7409 double *A, B; int *C;
7410 for (int i = 0; i < size; ++i) {
7414 .. code-block:: llvm
7416 ; get pointers for 8 elements from array B
7417 %ptrs = getelementptr double, double* %B, <8 x i32> %C
7418 ; load 8 elements from array B into A
7419 %A = call <8 x double> @llvm.masked.gather.v8f64(<8 x double*> %ptrs,
7420 i32 8, <8 x i1> %mask, <8 x double> %passthru)
7422 Conversion Operations
7423 ---------------------
7425 The instructions in this category are the conversion instructions
7426 (casting) which all take a single operand and a type. They perform
7427 various bit conversions on the operand.
7429 '``trunc .. to``' Instruction
7430 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7437 <result> = trunc <ty> <value> to <ty2> ; yields ty2
7442 The '``trunc``' instruction truncates its operand to the type ``ty2``.
7447 The '``trunc``' instruction takes a value to trunc, and a type to trunc
7448 it to. Both types must be of :ref:`integer <t_integer>` types, or vectors
7449 of the same number of integers. The bit size of the ``value`` must be
7450 larger than the bit size of the destination type, ``ty2``. Equal sized
7451 types are not allowed.
7456 The '``trunc``' instruction truncates the high order bits in ``value``
7457 and converts the remaining bits to ``ty2``. Since the source size must
7458 be larger than the destination size, ``trunc`` cannot be a *no-op cast*.
7459 It will always truncate bits.
7464 .. code-block:: llvm
7466 %X = trunc i32 257 to i8 ; yields i8:1
7467 %Y = trunc i32 123 to i1 ; yields i1:true
7468 %Z = trunc i32 122 to i1 ; yields i1:false
7469 %W = trunc <2 x i16> <i16 8, i16 7> to <2 x i8> ; yields <i8 8, i8 7>
7471 '``zext .. to``' Instruction
7472 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7479 <result> = zext <ty> <value> to <ty2> ; yields ty2
7484 The '``zext``' instruction zero extends its operand to type ``ty2``.
7489 The '``zext``' instruction takes a value to cast, and a type to cast it
7490 to. Both types must be of :ref:`integer <t_integer>` types, or vectors of
7491 the same number of integers. The bit size of the ``value`` must be
7492 smaller than the bit size of the destination type, ``ty2``.
7497 The ``zext`` fills the high order bits of the ``value`` with zero bits
7498 until it reaches the size of the destination type, ``ty2``.
7500 When zero extending from i1, the result will always be either 0 or 1.
7505 .. code-block:: llvm
7507 %X = zext i32 257 to i64 ; yields i64:257
7508 %Y = zext i1 true to i32 ; yields i32:1
7509 %Z = zext <2 x i16> <i16 8, i16 7> to <2 x i32> ; yields <i32 8, i32 7>
7511 '``sext .. to``' Instruction
7512 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7519 <result> = sext <ty> <value> to <ty2> ; yields ty2
7524 The '``sext``' sign extends ``value`` to the type ``ty2``.
7529 The '``sext``' instruction takes a value to cast, and a type to cast it
7530 to. Both types must be of :ref:`integer <t_integer>` types, or vectors of
7531 the same number of integers. The bit size of the ``value`` must be
7532 smaller than the bit size of the destination type, ``ty2``.
7537 The '``sext``' instruction performs a sign extension by copying the sign
7538 bit (highest order bit) of the ``value`` until it reaches the bit size
7539 of the type ``ty2``.
7541 When sign extending from i1, the extension always results in -1 or 0.
7546 .. code-block:: llvm
7548 %X = sext i8 -1 to i16 ; yields i16 :65535
7549 %Y = sext i1 true to i32 ; yields i32:-1
7550 %Z = sext <2 x i16> <i16 8, i16 7> to <2 x i32> ; yields <i32 8, i32 7>
7552 '``fptrunc .. to``' Instruction
7553 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7560 <result> = fptrunc <ty> <value> to <ty2> ; yields ty2
7565 The '``fptrunc``' instruction truncates ``value`` to type ``ty2``.
7570 The '``fptrunc``' instruction takes a :ref:`floating point <t_floating>`
7571 value to cast and a :ref:`floating point <t_floating>` type to cast it to.
7572 The size of ``value`` must be larger than the size of ``ty2``. This
7573 implies that ``fptrunc`` cannot be used to make a *no-op cast*.
7578 The '``fptrunc``' instruction casts a ``value`` from a larger
7579 :ref:`floating point <t_floating>` type to a smaller :ref:`floating
7580 point <t_floating>` type. If the value cannot fit (i.e. overflows) within the
7581 destination type, ``ty2``, then the results are undefined. If the cast produces
7582 an inexact result, how rounding is performed (e.g. truncation, also known as
7583 round to zero) is undefined.
7588 .. code-block:: llvm
7590 %X = fptrunc double 123.0 to float ; yields float:123.0
7591 %Y = fptrunc double 1.0E+300 to float ; yields undefined
7593 '``fpext .. to``' Instruction
7594 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7601 <result> = fpext <ty> <value> to <ty2> ; yields ty2
7606 The '``fpext``' extends a floating point ``value`` to a larger floating
7612 The '``fpext``' instruction takes a :ref:`floating point <t_floating>`
7613 ``value`` to cast, and a :ref:`floating point <t_floating>` type to cast it
7614 to. The source type must be smaller than the destination type.
7619 The '``fpext``' instruction extends the ``value`` from a smaller
7620 :ref:`floating point <t_floating>` type to a larger :ref:`floating
7621 point <t_floating>` type. The ``fpext`` cannot be used to make a
7622 *no-op cast* because it always changes bits. Use ``bitcast`` to make a
7623 *no-op cast* for a floating point cast.
7628 .. code-block:: llvm
7630 %X = fpext float 3.125 to double ; yields double:3.125000e+00
7631 %Y = fpext double %X to fp128 ; yields fp128:0xL00000000000000004000900000000000
7633 '``fptoui .. to``' Instruction
7634 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7641 <result> = fptoui <ty> <value> to <ty2> ; yields ty2
7646 The '``fptoui``' converts a floating point ``value`` to its unsigned
7647 integer equivalent of type ``ty2``.
7652 The '``fptoui``' instruction takes a value to cast, which must be a
7653 scalar or vector :ref:`floating point <t_floating>` value, and a type to
7654 cast it to ``ty2``, which must be an :ref:`integer <t_integer>` type. If
7655 ``ty`` is a vector floating point type, ``ty2`` must be a vector integer
7656 type with the same number of elements as ``ty``
7661 The '``fptoui``' instruction converts its :ref:`floating
7662 point <t_floating>` operand into the nearest (rounding towards zero)
7663 unsigned integer value. If the value cannot fit in ``ty2``, the results
7669 .. code-block:: llvm
7671 %X = fptoui double 123.0 to i32 ; yields i32:123
7672 %Y = fptoui float 1.0E+300 to i1 ; yields undefined:1
7673 %Z = fptoui float 1.04E+17 to i8 ; yields undefined:1
7675 '``fptosi .. to``' Instruction
7676 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7683 <result> = fptosi <ty> <value> to <ty2> ; yields ty2
7688 The '``fptosi``' instruction converts :ref:`floating point <t_floating>`
7689 ``value`` to type ``ty2``.
7694 The '``fptosi``' instruction takes a value to cast, which must be a
7695 scalar or vector :ref:`floating point <t_floating>` value, and a type to
7696 cast it to ``ty2``, which must be an :ref:`integer <t_integer>` type. If
7697 ``ty`` is a vector floating point type, ``ty2`` must be a vector integer
7698 type with the same number of elements as ``ty``
7703 The '``fptosi``' instruction converts its :ref:`floating
7704 point <t_floating>` operand into the nearest (rounding towards zero)
7705 signed integer value. If the value cannot fit in ``ty2``, the results
7711 .. code-block:: llvm
7713 %X = fptosi double -123.0 to i32 ; yields i32:-123
7714 %Y = fptosi float 1.0E-247 to i1 ; yields undefined:1
7715 %Z = fptosi float 1.04E+17 to i8 ; yields undefined:1
7717 '``uitofp .. to``' Instruction
7718 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7725 <result> = uitofp <ty> <value> to <ty2> ; yields ty2
7730 The '``uitofp``' instruction regards ``value`` as an unsigned integer
7731 and converts that value to the ``ty2`` type.
7736 The '``uitofp``' instruction takes a value to cast, which must be a
7737 scalar or vector :ref:`integer <t_integer>` value, and a type to cast it to
7738 ``ty2``, which must be an :ref:`floating point <t_floating>` type. If
7739 ``ty`` is a vector integer type, ``ty2`` must be a vector floating point
7740 type with the same number of elements as ``ty``
7745 The '``uitofp``' instruction interprets its operand as an unsigned
7746 integer quantity and converts it to the corresponding floating point
7747 value. If the value cannot fit in the floating point value, the results
7753 .. code-block:: llvm
7755 %X = uitofp i32 257 to float ; yields float:257.0
7756 %Y = uitofp i8 -1 to double ; yields double:255.0
7758 '``sitofp .. to``' Instruction
7759 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7766 <result> = sitofp <ty> <value> to <ty2> ; yields ty2
7771 The '``sitofp``' instruction regards ``value`` as a signed integer and
7772 converts that value to the ``ty2`` type.
7777 The '``sitofp``' instruction takes a value to cast, which must be a
7778 scalar or vector :ref:`integer <t_integer>` value, and a type to cast it to
7779 ``ty2``, which must be an :ref:`floating point <t_floating>` type. If
7780 ``ty`` is a vector integer type, ``ty2`` must be a vector floating point
7781 type with the same number of elements as ``ty``
7786 The '``sitofp``' instruction interprets its operand as a signed integer
7787 quantity and converts it to the corresponding floating point value. If
7788 the value cannot fit in the floating point value, the results are
7794 .. code-block:: llvm
7796 %X = sitofp i32 257 to float ; yields float:257.0
7797 %Y = sitofp i8 -1 to double ; yields double:-1.0
7801 '``ptrtoint .. to``' Instruction
7802 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7809 <result> = ptrtoint <ty> <value> to <ty2> ; yields ty2
7814 The '``ptrtoint``' instruction converts the pointer or a vector of
7815 pointers ``value`` to the integer (or vector of integers) type ``ty2``.
7820 The '``ptrtoint``' instruction takes a ``value`` to cast, which must be
7821 a value of type :ref:`pointer <t_pointer>` or a vector of pointers, and a
7822 type to cast it to ``ty2``, which must be an :ref:`integer <t_integer>` or
7823 a vector of integers type.
7828 The '``ptrtoint``' instruction converts ``value`` to integer type
7829 ``ty2`` by interpreting the pointer value as an integer and either
7830 truncating or zero extending that value to the size of the integer type.
7831 If ``value`` is smaller than ``ty2`` then a zero extension is done. If
7832 ``value`` is larger than ``ty2`` then a truncation is done. If they are
7833 the same size, then nothing is done (*no-op cast*) other than a type
7839 .. code-block:: llvm
7841 %X = ptrtoint i32* %P to i8 ; yields truncation on 32-bit architecture
7842 %Y = ptrtoint i32* %P to i64 ; yields zero extension on 32-bit architecture
7843 %Z = ptrtoint <4 x i32*> %P to <4 x i64>; yields vector zero extension for a vector of addresses on 32-bit architecture
7847 '``inttoptr .. to``' Instruction
7848 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7855 <result> = inttoptr <ty> <value> to <ty2> ; yields ty2
7860 The '``inttoptr``' instruction converts an integer ``value`` to a
7861 pointer type, ``ty2``.
7866 The '``inttoptr``' instruction takes an :ref:`integer <t_integer>` value to
7867 cast, and a type to cast it to, which must be a :ref:`pointer <t_pointer>`
7873 The '``inttoptr``' instruction converts ``value`` to type ``ty2`` by
7874 applying either a zero extension or a truncation depending on the size
7875 of the integer ``value``. If ``value`` is larger than the size of a
7876 pointer then a truncation is done. If ``value`` is smaller than the size
7877 of a pointer then a zero extension is done. If they are the same size,
7878 nothing is done (*no-op cast*).
7883 .. code-block:: llvm
7885 %X = inttoptr i32 255 to i32* ; yields zero extension on 64-bit architecture
7886 %Y = inttoptr i32 255 to i32* ; yields no-op on 32-bit architecture
7887 %Z = inttoptr i64 0 to i32* ; yields truncation on 32-bit architecture
7888 %Z = inttoptr <4 x i32> %G to <4 x i8*>; yields truncation of vector G to four pointers
7892 '``bitcast .. to``' Instruction
7893 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7900 <result> = bitcast <ty> <value> to <ty2> ; yields ty2
7905 The '``bitcast``' instruction converts ``value`` to type ``ty2`` without
7911 The '``bitcast``' instruction takes a value to cast, which must be a
7912 non-aggregate first class value, and a type to cast it to, which must
7913 also be a non-aggregate :ref:`first class <t_firstclass>` type. The
7914 bit sizes of ``value`` and the destination type, ``ty2``, must be
7915 identical. If the source type is a pointer, the destination type must
7916 also be a pointer of the same size. This instruction supports bitwise
7917 conversion of vectors to integers and to vectors of other types (as
7918 long as they have the same size).
7923 The '``bitcast``' instruction converts ``value`` to type ``ty2``. It
7924 is always a *no-op cast* because no bits change with this
7925 conversion. The conversion is done as if the ``value`` had been stored
7926 to memory and read back as type ``ty2``. Pointer (or vector of
7927 pointers) types may only be converted to other pointer (or vector of
7928 pointers) types with the same address space through this instruction.
7929 To convert pointers to other types, use the :ref:`inttoptr <i_inttoptr>`
7930 or :ref:`ptrtoint <i_ptrtoint>` instructions first.
7935 .. code-block:: llvm
7937 %X = bitcast i8 255 to i8 ; yields i8 :-1
7938 %Y = bitcast i32* %x to sint* ; yields sint*:%x
7939 %Z = bitcast <2 x int> %V to i64; ; yields i64: %V
7940 %Z = bitcast <2 x i32*> %V to <2 x i64*> ; yields <2 x i64*>
7942 .. _i_addrspacecast:
7944 '``addrspacecast .. to``' Instruction
7945 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
7952 <result> = addrspacecast <pty> <ptrval> to <pty2> ; yields pty2
7957 The '``addrspacecast``' instruction converts ``ptrval`` from ``pty`` in
7958 address space ``n`` to type ``pty2`` in address space ``m``.
7963 The '``addrspacecast``' instruction takes a pointer or vector of pointer value
7964 to cast and a pointer type to cast it to, which must have a different
7970 The '``addrspacecast``' instruction converts the pointer value
7971 ``ptrval`` to type ``pty2``. It can be a *no-op cast* or a complex
7972 value modification, depending on the target and the address space
7973 pair. Pointer conversions within the same address space must be
7974 performed with the ``bitcast`` instruction. Note that if the address space
7975 conversion is legal then both result and operand refer to the same memory
7981 .. code-block:: llvm
7983 %X = addrspacecast i32* %x to i32 addrspace(1)* ; yields i32 addrspace(1)*:%x
7984 %Y = addrspacecast i32 addrspace(1)* %y to i64 addrspace(2)* ; yields i64 addrspace(2)*:%y
7985 %Z = addrspacecast <4 x i32*> %z to <4 x float addrspace(3)*> ; yields <4 x float addrspace(3)*>:%z
7992 The instructions in this category are the "miscellaneous" instructions,
7993 which defy better classification.
7997 '``icmp``' Instruction
7998 ^^^^^^^^^^^^^^^^^^^^^^
8005 <result> = icmp <cond> <ty> <op1>, <op2> ; yields i1 or <N x i1>:result
8010 The '``icmp``' instruction returns a boolean value or a vector of
8011 boolean values based on comparison of its two integer, integer vector,
8012 pointer, or pointer vector operands.
8017 The '``icmp``' instruction takes three operands. The first operand is
8018 the condition code indicating the kind of comparison to perform. It is
8019 not a value, just a keyword. The possible condition code are:
8022 #. ``ne``: not equal
8023 #. ``ugt``: unsigned greater than
8024 #. ``uge``: unsigned greater or equal
8025 #. ``ult``: unsigned less than
8026 #. ``ule``: unsigned less or equal
8027 #. ``sgt``: signed greater than
8028 #. ``sge``: signed greater or equal
8029 #. ``slt``: signed less than
8030 #. ``sle``: signed less or equal
8032 The remaining two arguments must be :ref:`integer <t_integer>` or
8033 :ref:`pointer <t_pointer>` or integer :ref:`vector <t_vector>` typed. They
8034 must also be identical types.
8039 The '``icmp``' compares ``op1`` and ``op2`` according to the condition
8040 code given as ``cond``. The comparison performed always yields either an
8041 :ref:`i1 <t_integer>` or vector of ``i1`` result, as follows:
8043 #. ``eq``: yields ``true`` if the operands are equal, ``false``
8044 otherwise. No sign interpretation is necessary or performed.
8045 #. ``ne``: yields ``true`` if the operands are unequal, ``false``
8046 otherwise. No sign interpretation is necessary or performed.
8047 #. ``ugt``: interprets the operands as unsigned values and yields
8048 ``true`` if ``op1`` is greater than ``op2``.
8049 #. ``uge``: interprets the operands as unsigned values and yields
8050 ``true`` if ``op1`` is greater than or equal to ``op2``.
8051 #. ``ult``: interprets the operands as unsigned values and yields
8052 ``true`` if ``op1`` is less than ``op2``.
8053 #. ``ule``: interprets the operands as unsigned values and yields
8054 ``true`` if ``op1`` is less than or equal to ``op2``.
8055 #. ``sgt``: interprets the operands as signed values and yields ``true``
8056 if ``op1`` is greater than ``op2``.
8057 #. ``sge``: interprets the operands as signed values and yields ``true``
8058 if ``op1`` is greater than or equal to ``op2``.
8059 #. ``slt``: interprets the operands as signed values and yields ``true``
8060 if ``op1`` is less than ``op2``.
8061 #. ``sle``: interprets the operands as signed values and yields ``true``
8062 if ``op1`` is less than or equal to ``op2``.
8064 If the operands are :ref:`pointer <t_pointer>` typed, the pointer values
8065 are compared as if they were integers.
8067 If the operands are integer vectors, then they are compared element by
8068 element. The result is an ``i1`` vector with the same number of elements
8069 as the values being compared. Otherwise, the result is an ``i1``.
8074 .. code-block:: llvm
8076 <result> = icmp eq i32 4, 5 ; yields: result=false
8077 <result> = icmp ne float* %X, %X ; yields: result=false
8078 <result> = icmp ult i16 4, 5 ; yields: result=true
8079 <result> = icmp sgt i16 4, 5 ; yields: result=false
8080 <result> = icmp ule i16 -4, 5 ; yields: result=false
8081 <result> = icmp sge i16 4, 5 ; yields: result=false
8083 Note that the code generator does not yet support vector types with the
8084 ``icmp`` instruction.
8088 '``fcmp``' Instruction
8089 ^^^^^^^^^^^^^^^^^^^^^^
8096 <result> = fcmp [fast-math flags]* <cond> <ty> <op1>, <op2> ; yields i1 or <N x i1>:result
8101 The '``fcmp``' instruction returns a boolean value or vector of boolean
8102 values based on comparison of its operands.
8104 If the operands are floating point scalars, then the result type is a
8105 boolean (:ref:`i1 <t_integer>`).
8107 If the operands are floating point vectors, then the result type is a
8108 vector of boolean with the same number of elements as the operands being
8114 The '``fcmp``' instruction takes three operands. The first operand is
8115 the condition code indicating the kind of comparison to perform. It is
8116 not a value, just a keyword. The possible condition code are:
8118 #. ``false``: no comparison, always returns false
8119 #. ``oeq``: ordered and equal
8120 #. ``ogt``: ordered and greater than
8121 #. ``oge``: ordered and greater than or equal
8122 #. ``olt``: ordered and less than
8123 #. ``ole``: ordered and less than or equal
8124 #. ``one``: ordered and not equal
8125 #. ``ord``: ordered (no nans)
8126 #. ``ueq``: unordered or equal
8127 #. ``ugt``: unordered or greater than
8128 #. ``uge``: unordered or greater than or equal
8129 #. ``ult``: unordered or less than
8130 #. ``ule``: unordered or less than or equal
8131 #. ``une``: unordered or not equal
8132 #. ``uno``: unordered (either nans)
8133 #. ``true``: no comparison, always returns true
8135 *Ordered* means that neither operand is a QNAN while *unordered* means
8136 that either operand may be a QNAN.
8138 Each of ``val1`` and ``val2`` arguments must be either a :ref:`floating
8139 point <t_floating>` type or a :ref:`vector <t_vector>` of floating point
8140 type. They must have identical types.
8145 The '``fcmp``' instruction compares ``op1`` and ``op2`` according to the
8146 condition code given as ``cond``. If the operands are vectors, then the
8147 vectors are compared element by element. Each comparison performed
8148 always yields an :ref:`i1 <t_integer>` result, as follows:
8150 #. ``false``: always yields ``false``, regardless of operands.
8151 #. ``oeq``: yields ``true`` if both operands are not a QNAN and ``op1``
8152 is equal to ``op2``.
8153 #. ``ogt``: yields ``true`` if both operands are not a QNAN and ``op1``
8154 is greater than ``op2``.
8155 #. ``oge``: yields ``true`` if both operands are not a QNAN and ``op1``
8156 is greater than or equal to ``op2``.
8157 #. ``olt``: yields ``true`` if both operands are not a QNAN and ``op1``
8158 is less than ``op2``.
8159 #. ``ole``: yields ``true`` if both operands are not a QNAN and ``op1``
8160 is less than or equal to ``op2``.
8161 #. ``one``: yields ``true`` if both operands are not a QNAN and ``op1``
8162 is not equal to ``op2``.
8163 #. ``ord``: yields ``true`` if both operands are not a QNAN.
8164 #. ``ueq``: yields ``true`` if either operand is a QNAN or ``op1`` is
8166 #. ``ugt``: yields ``true`` if either operand is a QNAN or ``op1`` is
8167 greater than ``op2``.
8168 #. ``uge``: yields ``true`` if either operand is a QNAN or ``op1`` is
8169 greater than or equal to ``op2``.
8170 #. ``ult``: yields ``true`` if either operand is a QNAN or ``op1`` is
8172 #. ``ule``: yields ``true`` if either operand is a QNAN or ``op1`` is
8173 less than or equal to ``op2``.
8174 #. ``une``: yields ``true`` if either operand is a QNAN or ``op1`` is
8175 not equal to ``op2``.
8176 #. ``uno``: yields ``true`` if either operand is a QNAN.
8177 #. ``true``: always yields ``true``, regardless of operands.
8179 The ``fcmp`` instruction can also optionally take any number of
8180 :ref:`fast-math flags <fastmath>`, which are optimization hints to enable
8181 otherwise unsafe floating point optimizations.
8183 Any set of fast-math flags are legal on an ``fcmp`` instruction, but the
8184 only flags that have any effect on its semantics are those that allow
8185 assumptions to be made about the values of input arguments; namely
8186 ``nnan``, ``ninf``, and ``nsz``. See :ref:`fastmath` for more information.
8191 .. code-block:: llvm
8193 <result> = fcmp oeq float 4.0, 5.0 ; yields: result=false
8194 <result> = fcmp one float 4.0, 5.0 ; yields: result=true
8195 <result> = fcmp olt float 4.0, 5.0 ; yields: result=true
8196 <result> = fcmp ueq double 1.0, 2.0 ; yields: result=false
8198 Note that the code generator does not yet support vector types with the
8199 ``fcmp`` instruction.
8203 '``phi``' Instruction
8204 ^^^^^^^^^^^^^^^^^^^^^
8211 <result> = phi <ty> [ <val0>, <label0>], ...
8216 The '``phi``' instruction is used to implement the φ node in the SSA
8217 graph representing the function.
8222 The type of the incoming values is specified with the first type field.
8223 After this, the '``phi``' instruction takes a list of pairs as
8224 arguments, with one pair for each predecessor basic block of the current
8225 block. Only values of :ref:`first class <t_firstclass>` type may be used as
8226 the value arguments to the PHI node. Only labels may be used as the
8229 There must be no non-phi instructions between the start of a basic block
8230 and the PHI instructions: i.e. PHI instructions must be first in a basic
8233 For the purposes of the SSA form, the use of each incoming value is
8234 deemed to occur on the edge from the corresponding predecessor block to
8235 the current block (but after any definition of an '``invoke``'
8236 instruction's return value on the same edge).
8241 At runtime, the '``phi``' instruction logically takes on the value
8242 specified by the pair corresponding to the predecessor basic block that
8243 executed just prior to the current block.
8248 .. code-block:: llvm
8250 Loop: ; Infinite loop that counts from 0 on up...
8251 %indvar = phi i32 [ 0, %LoopHeader ], [ %nextindvar, %Loop ]
8252 %nextindvar = add i32 %indvar, 1
8257 '``select``' Instruction
8258 ^^^^^^^^^^^^^^^^^^^^^^^^
8265 <result> = select selty <cond>, <ty> <val1>, <ty> <val2> ; yields ty
8267 selty is either i1 or {<N x i1>}
8272 The '``select``' instruction is used to choose one value based on a
8273 condition, without IR-level branching.
8278 The '``select``' instruction requires an 'i1' value or a vector of 'i1'
8279 values indicating the condition, and two values of the same :ref:`first
8280 class <t_firstclass>` type.
8285 If the condition is an i1 and it evaluates to 1, the instruction returns
8286 the first value argument; otherwise, it returns the second value
8289 If the condition is a vector of i1, then the value arguments must be
8290 vectors of the same size, and the selection is done element by element.
8292 If the condition is an i1 and the value arguments are vectors of the
8293 same size, then an entire vector is selected.
8298 .. code-block:: llvm
8300 %X = select i1 true, i8 17, i8 42 ; yields i8:17
8304 '``call``' Instruction
8305 ^^^^^^^^^^^^^^^^^^^^^^
8312 <result> = [tail | musttail] call [cconv] [ret attrs] <ty> [<fnty>*] <fnptrval>(<function args>) [fn attrs]
8317 The '``call``' instruction represents a simple function call.
8322 This instruction requires several arguments:
8324 #. The optional ``tail`` and ``musttail`` markers indicate that the optimizers
8325 should perform tail call optimization. The ``tail`` marker is a hint that
8326 `can be ignored <CodeGenerator.html#sibcallopt>`_. The ``musttail`` marker
8327 means that the call must be tail call optimized in order for the program to
8328 be correct. The ``musttail`` marker provides these guarantees:
8330 #. The call will not cause unbounded stack growth if it is part of a
8331 recursive cycle in the call graph.
8332 #. Arguments with the :ref:`inalloca <attr_inalloca>` attribute are
8335 Both markers imply that the callee does not access allocas or varargs from
8336 the caller. Calls marked ``musttail`` must obey the following additional
8339 - The call must immediately precede a :ref:`ret <i_ret>` instruction,
8340 or a pointer bitcast followed by a ret instruction.
8341 - The ret instruction must return the (possibly bitcasted) value
8342 produced by the call or void.
8343 - The caller and callee prototypes must match. Pointer types of
8344 parameters or return types may differ in pointee type, but not
8346 - The calling conventions of the caller and callee must match.
8347 - All ABI-impacting function attributes, such as sret, byval, inreg,
8348 returned, and inalloca, must match.
8349 - The callee must be varargs iff the caller is varargs. Bitcasting a
8350 non-varargs function to the appropriate varargs type is legal so
8351 long as the non-varargs prefixes obey the other rules.
8353 Tail call optimization for calls marked ``tail`` is guaranteed to occur if
8354 the following conditions are met:
8356 - Caller and callee both have the calling convention ``fastcc``.
8357 - The call is in tail position (ret immediately follows call and ret
8358 uses value of call or is void).
8359 - Option ``-tailcallopt`` is enabled, or
8360 ``llvm::GuaranteedTailCallOpt`` is ``true``.
8361 - `Platform-specific constraints are
8362 met. <CodeGenerator.html#tailcallopt>`_
8364 #. The optional "cconv" marker indicates which :ref:`calling
8365 convention <callingconv>` the call should use. If none is
8366 specified, the call defaults to using C calling conventions. The
8367 calling convention of the call must match the calling convention of
8368 the target function, or else the behavior is undefined.
8369 #. The optional :ref:`Parameter Attributes <paramattrs>` list for return
8370 values. Only '``zeroext``', '``signext``', and '``inreg``' attributes
8372 #. '``ty``': the type of the call instruction itself which is also the
8373 type of the return value. Functions that return no value are marked
8375 #. '``fnty``': shall be the signature of the pointer to function value
8376 being invoked. The argument types must match the types implied by
8377 this signature. This type can be omitted if the function is not
8378 varargs and if the function type does not return a pointer to a
8380 #. '``fnptrval``': An LLVM value containing a pointer to a function to
8381 be invoked. In most cases, this is a direct function invocation, but
8382 indirect ``call``'s are just as possible, calling an arbitrary pointer
8384 #. '``function args``': argument list whose types match the function
8385 signature argument types and parameter attributes. All arguments must
8386 be of :ref:`first class <t_firstclass>` type. If the function signature
8387 indicates the function accepts a variable number of arguments, the
8388 extra arguments can be specified.
8389 #. The optional :ref:`function attributes <fnattrs>` list. Only
8390 '``noreturn``', '``nounwind``', '``readonly``' and '``readnone``'
8391 attributes are valid here.
8396 The '``call``' instruction is used to cause control flow to transfer to
8397 a specified function, with its incoming arguments bound to the specified
8398 values. Upon a '``ret``' instruction in the called function, control
8399 flow continues with the instruction after the function call, and the
8400 return value of the function is bound to the result argument.
8405 .. code-block:: llvm
8407 %retval = call i32 @test(i32 %argc)
8408 call i32 (i8*, ...)* @printf(i8* %msg, i32 12, i8 42) ; yields i32
8409 %X = tail call i32 @foo() ; yields i32
8410 %Y = tail call fastcc i32 @foo() ; yields i32
8411 call void %foo(i8 97 signext)
8413 %struct.A = type { i32, i8 }
8414 %r = call %struct.A @foo() ; yields { i32, i8 }
8415 %gr = extractvalue %struct.A %r, 0 ; yields i32
8416 %gr1 = extractvalue %struct.A %r, 1 ; yields i8
8417 %Z = call void @foo() noreturn ; indicates that %foo never returns normally
8418 %ZZ = call zeroext i32 @bar() ; Return value is %zero extended
8420 llvm treats calls to some functions with names and arguments that match
8421 the standard C99 library as being the C99 library functions, and may
8422 perform optimizations or generate code for them under that assumption.
8423 This is something we'd like to change in the future to provide better
8424 support for freestanding environments and non-C-based languages.
8428 '``va_arg``' Instruction
8429 ^^^^^^^^^^^^^^^^^^^^^^^^
8436 <resultval> = va_arg <va_list*> <arglist>, <argty>
8441 The '``va_arg``' instruction is used to access arguments passed through
8442 the "variable argument" area of a function call. It is used to implement
8443 the ``va_arg`` macro in C.
8448 This instruction takes a ``va_list*`` value and the type of the
8449 argument. It returns a value of the specified argument type and
8450 increments the ``va_list`` to point to the next argument. The actual
8451 type of ``va_list`` is target specific.
8456 The '``va_arg``' instruction loads an argument of the specified type
8457 from the specified ``va_list`` and causes the ``va_list`` to point to
8458 the next argument. For more information, see the variable argument
8459 handling :ref:`Intrinsic Functions <int_varargs>`.
8461 It is legal for this instruction to be called in a function which does
8462 not take a variable number of arguments, for example, the ``vfprintf``
8465 ``va_arg`` is an LLVM instruction instead of an :ref:`intrinsic
8466 function <intrinsics>` because it takes a type as an argument.
8471 See the :ref:`variable argument processing <int_varargs>` section.
8473 Note that the code generator does not yet fully support va\_arg on many
8474 targets. Also, it does not currently support va\_arg with aggregate
8475 types on any target.
8479 '``landingpad``' Instruction
8480 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
8487 <resultval> = landingpad <resultty> <clause>+
8488 <resultval> = landingpad <resultty> cleanup <clause>*
8490 <clause> := catch <type> <value>
8491 <clause> := filter <array constant type> <array constant>
8496 The '``landingpad``' instruction is used by `LLVM's exception handling
8497 system <ExceptionHandling.html#overview>`_ to specify that a basic block
8498 is a landing pad --- one where the exception lands, and corresponds to the
8499 code found in the ``catch`` portion of a ``try``/``catch`` sequence. It
8500 defines values supplied by the :ref:`personality function <personalityfn>` upon
8501 re-entry to the function. The ``resultval`` has the type ``resultty``.
8507 ``cleanup`` flag indicates that the landing pad block is a cleanup.
8509 A ``clause`` begins with the clause type --- ``catch`` or ``filter`` --- and
8510 contains the global variable representing the "type" that may be caught
8511 or filtered respectively. Unlike the ``catch`` clause, the ``filter``
8512 clause takes an array constant as its argument. Use
8513 "``[0 x i8**] undef``" for a filter which cannot throw. The
8514 '``landingpad``' instruction must contain *at least* one ``clause`` or
8515 the ``cleanup`` flag.
8520 The '``landingpad``' instruction defines the values which are set by the
8521 :ref:`personality function <personalityfn>` upon re-entry to the function, and
8522 therefore the "result type" of the ``landingpad`` instruction. As with
8523 calling conventions, how the personality function results are
8524 represented in LLVM IR is target specific.
8526 The clauses are applied in order from top to bottom. If two
8527 ``landingpad`` instructions are merged together through inlining, the
8528 clauses from the calling function are appended to the list of clauses.
8529 When the call stack is being unwound due to an exception being thrown,
8530 the exception is compared against each ``clause`` in turn. If it doesn't
8531 match any of the clauses, and the ``cleanup`` flag is not set, then
8532 unwinding continues further up the call stack.
8534 The ``landingpad`` instruction has several restrictions:
8536 - A landing pad block is a basic block which is the unwind destination
8537 of an '``invoke``' instruction.
8538 - A landing pad block must have a '``landingpad``' instruction as its
8539 first non-PHI instruction.
8540 - There can be only one '``landingpad``' instruction within the landing
8542 - A basic block that is not a landing pad block may not include a
8543 '``landingpad``' instruction.
8548 .. code-block:: llvm
8550 ;; A landing pad which can catch an integer.
8551 %res = landingpad { i8*, i32 }
8553 ;; A landing pad that is a cleanup.
8554 %res = landingpad { i8*, i32 }
8556 ;; A landing pad which can catch an integer and can only throw a double.
8557 %res = landingpad { i8*, i32 }
8559 filter [1 x i8**] [@_ZTId]
8563 '``cleanuppad``' Instruction
8564 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
8571 <resultval> = cleanuppad [<args>*]
8576 The '``cleanuppad``' instruction is used by `LLVM's exception handling
8577 system <ExceptionHandling.html#overview>`_ to specify that a basic block
8578 is a cleanup block --- one where a personality routine attempts to
8579 transfer control to run cleanup actions.
8580 The ``args`` correspond to whatever additional
8581 information the :ref:`personality function <personalityfn>` requires to
8582 execute the cleanup.
8583 The ``resultval`` has the type :ref:`token <t_token>` and is used to
8584 match the ``cleanuppad`` to corresponding :ref:`cleanuprets <i_cleanupret>`
8585 and :ref:`cleanupendpads <i_cleanupendpad>`.
8590 The instruction takes a list of arbitrary values which are interpreted
8591 by the :ref:`personality function <personalityfn>`.
8596 When the call stack is being unwound due to an exception being thrown,
8597 the :ref:`personality function <personalityfn>` transfers control to the
8598 ``cleanuppad`` with the aid of the personality-specific arguments.
8599 As with calling conventions, how the personality function results are
8600 represented in LLVM IR is target specific.
8602 The ``cleanuppad`` instruction has several restrictions:
8604 - A cleanup block is a basic block which is the unwind destination of
8605 an exceptional instruction.
8606 - A cleanup block must have a '``cleanuppad``' instruction as its
8607 first non-PHI instruction.
8608 - There can be only one '``cleanuppad``' instruction within the
8610 - A basic block that is not a cleanup block may not include a
8611 '``cleanuppad``' instruction.
8612 - All '``cleanupret``'s and '``cleanupendpad``'s which consume a ``cleanuppad``
8613 must have the same exceptional successor.
8614 - It is undefined behavior for control to transfer from a ``cleanuppad`` to a
8615 ``ret`` without first executing a ``cleanupret`` or ``cleanupendpad`` that
8616 consumes the ``cleanuppad``.
8617 - It is undefined behavior for control to transfer from a ``cleanuppad`` to
8618 itself without first executing a ``cleanupret`` or ``cleanupendpad`` that
8619 consumes the ``cleanuppad``.
8624 .. code-block:: llvm
8626 %tok = cleanuppad []
8633 LLVM supports the notion of an "intrinsic function". These functions
8634 have well known names and semantics and are required to follow certain
8635 restrictions. Overall, these intrinsics represent an extension mechanism
8636 for the LLVM language that does not require changing all of the
8637 transformations in LLVM when adding to the language (or the bitcode
8638 reader/writer, the parser, etc...).
8640 Intrinsic function names must all start with an "``llvm.``" prefix. This
8641 prefix is reserved in LLVM for intrinsic names; thus, function names may
8642 not begin with this prefix. Intrinsic functions must always be external
8643 functions: you cannot define the body of intrinsic functions. Intrinsic
8644 functions may only be used in call or invoke instructions: it is illegal
8645 to take the address of an intrinsic function. Additionally, because
8646 intrinsic functions are part of the LLVM language, it is required if any
8647 are added that they be documented here.
8649 Some intrinsic functions can be overloaded, i.e., the intrinsic
8650 represents a family of functions that perform the same operation but on
8651 different data types. Because LLVM can represent over 8 million
8652 different integer types, overloading is used commonly to allow an
8653 intrinsic function to operate on any integer type. One or more of the
8654 argument types or the result type can be overloaded to accept any
8655 integer type. Argument types may also be defined as exactly matching a
8656 previous argument's type or the result type. This allows an intrinsic
8657 function which accepts multiple arguments, but needs all of them to be
8658 of the same type, to only be overloaded with respect to a single
8659 argument or the result.
8661 Overloaded intrinsics will have the names of its overloaded argument
8662 types encoded into its function name, each preceded by a period. Only
8663 those types which are overloaded result in a name suffix. Arguments
8664 whose type is matched against another type do not. For example, the
8665 ``llvm.ctpop`` function can take an integer of any width and returns an
8666 integer of exactly the same integer width. This leads to a family of
8667 functions such as ``i8 @llvm.ctpop.i8(i8 %val)`` and
8668 ``i29 @llvm.ctpop.i29(i29 %val)``. Only one type, the return type, is
8669 overloaded, and only one type suffix is required. Because the argument's
8670 type is matched against the return type, it does not require its own
8673 To learn how to add an intrinsic function, please see the `Extending
8674 LLVM Guide <ExtendingLLVM.html>`_.
8678 Variable Argument Handling Intrinsics
8679 -------------------------------------
8681 Variable argument support is defined in LLVM with the
8682 :ref:`va_arg <i_va_arg>` instruction and these three intrinsic
8683 functions. These functions are related to the similarly named macros
8684 defined in the ``<stdarg.h>`` header file.
8686 All of these functions operate on arguments that use a target-specific
8687 value type "``va_list``". The LLVM assembly language reference manual
8688 does not define what this type is, so all transformations should be
8689 prepared to handle these functions regardless of the type used.
8691 This example shows how the :ref:`va_arg <i_va_arg>` instruction and the
8692 variable argument handling intrinsic functions are used.
8694 .. code-block:: llvm
8696 ; This struct is different for every platform. For most platforms,
8697 ; it is merely an i8*.
8698 %struct.va_list = type { i8* }
8700 ; For Unix x86_64 platforms, va_list is the following struct:
8701 ; %struct.va_list = type { i32, i32, i8*, i8* }
8703 define i32 @test(i32 %X, ...) {
8704 ; Initialize variable argument processing
8705 %ap = alloca %struct.va_list
8706 %ap2 = bitcast %struct.va_list* %ap to i8*
8707 call void @llvm.va_start(i8* %ap2)
8709 ; Read a single integer argument
8710 %tmp = va_arg i8* %ap2, i32
8712 ; Demonstrate usage of llvm.va_copy and llvm.va_end
8714 %aq2 = bitcast i8** %aq to i8*
8715 call void @llvm.va_copy(i8* %aq2, i8* %ap2)
8716 call void @llvm.va_end(i8* %aq2)
8718 ; Stop processing of arguments.
8719 call void @llvm.va_end(i8* %ap2)
8723 declare void @llvm.va_start(i8*)
8724 declare void @llvm.va_copy(i8*, i8*)
8725 declare void @llvm.va_end(i8*)
8729 '``llvm.va_start``' Intrinsic
8730 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
8737 declare void @llvm.va_start(i8* <arglist>)
8742 The '``llvm.va_start``' intrinsic initializes ``*<arglist>`` for
8743 subsequent use by ``va_arg``.
8748 The argument is a pointer to a ``va_list`` element to initialize.
8753 The '``llvm.va_start``' intrinsic works just like the ``va_start`` macro
8754 available in C. In a target-dependent way, it initializes the
8755 ``va_list`` element to which the argument points, so that the next call
8756 to ``va_arg`` will produce the first variable argument passed to the
8757 function. Unlike the C ``va_start`` macro, this intrinsic does not need
8758 to know the last argument of the function as the compiler can figure
8761 '``llvm.va_end``' Intrinsic
8762 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
8769 declare void @llvm.va_end(i8* <arglist>)
8774 The '``llvm.va_end``' intrinsic destroys ``*<arglist>``, which has been
8775 initialized previously with ``llvm.va_start`` or ``llvm.va_copy``.
8780 The argument is a pointer to a ``va_list`` to destroy.
8785 The '``llvm.va_end``' intrinsic works just like the ``va_end`` macro
8786 available in C. In a target-dependent way, it destroys the ``va_list``
8787 element to which the argument points. Calls to
8788 :ref:`llvm.va_start <int_va_start>` and
8789 :ref:`llvm.va_copy <int_va_copy>` must be matched exactly with calls to
8794 '``llvm.va_copy``' Intrinsic
8795 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
8802 declare void @llvm.va_copy(i8* <destarglist>, i8* <srcarglist>)
8807 The '``llvm.va_copy``' intrinsic copies the current argument position
8808 from the source argument list to the destination argument list.
8813 The first argument is a pointer to a ``va_list`` element to initialize.
8814 The second argument is a pointer to a ``va_list`` element to copy from.
8819 The '``llvm.va_copy``' intrinsic works just like the ``va_copy`` macro
8820 available in C. In a target-dependent way, it copies the source
8821 ``va_list`` element into the destination ``va_list`` element. This
8822 intrinsic is necessary because the `` llvm.va_start`` intrinsic may be
8823 arbitrarily complex and require, for example, memory allocation.
8825 Accurate Garbage Collection Intrinsics
8826 --------------------------------------
8828 LLVM's support for `Accurate Garbage Collection <GarbageCollection.html>`_
8829 (GC) requires the frontend to generate code containing appropriate intrinsic
8830 calls and select an appropriate GC strategy which knows how to lower these
8831 intrinsics in a manner which is appropriate for the target collector.
8833 These intrinsics allow identification of :ref:`GC roots on the
8834 stack <int_gcroot>`, as well as garbage collector implementations that
8835 require :ref:`read <int_gcread>` and :ref:`write <int_gcwrite>` barriers.
8836 Frontends for type-safe garbage collected languages should generate
8837 these intrinsics to make use of the LLVM garbage collectors. For more
8838 details, see `Garbage Collection with LLVM <GarbageCollection.html>`_.
8840 Experimental Statepoint Intrinsics
8841 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
8843 LLVM provides an second experimental set of intrinsics for describing garbage
8844 collection safepoints in compiled code. These intrinsics are an alternative
8845 to the ``llvm.gcroot`` intrinsics, but are compatible with the ones for
8846 :ref:`read <int_gcread>` and :ref:`write <int_gcwrite>` barriers. The
8847 differences in approach are covered in the `Garbage Collection with LLVM
8848 <GarbageCollection.html>`_ documentation. The intrinsics themselves are
8849 described in :doc:`Statepoints`.
8853 '``llvm.gcroot``' Intrinsic
8854 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
8861 declare void @llvm.gcroot(i8** %ptrloc, i8* %metadata)
8866 The '``llvm.gcroot``' intrinsic declares the existence of a GC root to
8867 the code generator, and allows some metadata to be associated with it.
8872 The first argument specifies the address of a stack object that contains
8873 the root pointer. The second pointer (which must be either a constant or
8874 a global value address) contains the meta-data to be associated with the
8880 At runtime, a call to this intrinsic stores a null pointer into the
8881 "ptrloc" location. At compile-time, the code generator generates
8882 information to allow the runtime to find the pointer at GC safe points.
8883 The '``llvm.gcroot``' intrinsic may only be used in a function which
8884 :ref:`specifies a GC algorithm <gc>`.
8888 '``llvm.gcread``' Intrinsic
8889 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
8896 declare i8* @llvm.gcread(i8* %ObjPtr, i8** %Ptr)
8901 The '``llvm.gcread``' intrinsic identifies reads of references from heap
8902 locations, allowing garbage collector implementations that require read
8908 The second argument is the address to read from, which should be an
8909 address allocated from the garbage collector. The first object is a
8910 pointer to the start of the referenced object, if needed by the language
8911 runtime (otherwise null).
8916 The '``llvm.gcread``' intrinsic has the same semantics as a load
8917 instruction, but may be replaced with substantially more complex code by
8918 the garbage collector runtime, as needed. The '``llvm.gcread``'
8919 intrinsic may only be used in a function which :ref:`specifies a GC
8924 '``llvm.gcwrite``' Intrinsic
8925 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
8932 declare void @llvm.gcwrite(i8* %P1, i8* %Obj, i8** %P2)
8937 The '``llvm.gcwrite``' intrinsic identifies writes of references to heap
8938 locations, allowing garbage collector implementations that require write
8939 barriers (such as generational or reference counting collectors).
8944 The first argument is the reference to store, the second is the start of
8945 the object to store it to, and the third is the address of the field of
8946 Obj to store to. If the runtime does not require a pointer to the
8947 object, Obj may be null.
8952 The '``llvm.gcwrite``' intrinsic has the same semantics as a store
8953 instruction, but may be replaced with substantially more complex code by
8954 the garbage collector runtime, as needed. The '``llvm.gcwrite``'
8955 intrinsic may only be used in a function which :ref:`specifies a GC
8958 Code Generator Intrinsics
8959 -------------------------
8961 These intrinsics are provided by LLVM to expose special features that
8962 may only be implemented with code generator support.
8964 '``llvm.returnaddress``' Intrinsic
8965 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
8972 declare i8 *@llvm.returnaddress(i32 <level>)
8977 The '``llvm.returnaddress``' intrinsic attempts to compute a
8978 target-specific value indicating the return address of the current
8979 function or one of its callers.
8984 The argument to this intrinsic indicates which function to return the
8985 address for. Zero indicates the calling function, one indicates its
8986 caller, etc. The argument is **required** to be a constant integer
8992 The '``llvm.returnaddress``' intrinsic either returns a pointer
8993 indicating the return address of the specified call frame, or zero if it
8994 cannot be identified. The value returned by this intrinsic is likely to
8995 be incorrect or 0 for arguments other than zero, so it should only be
8996 used for debugging purposes.
8998 Note that calling this intrinsic does not prevent function inlining or
8999 other aggressive transformations, so the value returned may not be that
9000 of the obvious source-language caller.
9002 '``llvm.frameaddress``' Intrinsic
9003 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9010 declare i8* @llvm.frameaddress(i32 <level>)
9015 The '``llvm.frameaddress``' intrinsic attempts to return the
9016 target-specific frame pointer value for the specified stack frame.
9021 The argument to this intrinsic indicates which function to return the
9022 frame pointer for. Zero indicates the calling function, one indicates
9023 its caller, etc. The argument is **required** to be a constant integer
9029 The '``llvm.frameaddress``' intrinsic either returns a pointer
9030 indicating the frame address of the specified call frame, or zero if it
9031 cannot be identified. The value returned by this intrinsic is likely to
9032 be incorrect or 0 for arguments other than zero, so it should only be
9033 used for debugging purposes.
9035 Note that calling this intrinsic does not prevent function inlining or
9036 other aggressive transformations, so the value returned may not be that
9037 of the obvious source-language caller.
9039 '``llvm.localescape``' and '``llvm.localrecover``' Intrinsics
9040 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9047 declare void @llvm.localescape(...)
9048 declare i8* @llvm.localrecover(i8* %func, i8* %fp, i32 %idx)
9053 The '``llvm.localescape``' intrinsic escapes offsets of a collection of static
9054 allocas, and the '``llvm.localrecover``' intrinsic applies those offsets to a
9055 live frame pointer to recover the address of the allocation. The offset is
9056 computed during frame layout of the caller of ``llvm.localescape``.
9061 All arguments to '``llvm.localescape``' must be pointers to static allocas or
9062 casts of static allocas. Each function can only call '``llvm.localescape``'
9063 once, and it can only do so from the entry block.
9065 The ``func`` argument to '``llvm.localrecover``' must be a constant
9066 bitcasted pointer to a function defined in the current module. The code
9067 generator cannot determine the frame allocation offset of functions defined in
9070 The ``fp`` argument to '``llvm.localrecover``' must be a frame pointer of a
9071 call frame that is currently live. The return value of '``llvm.localaddress``'
9072 is one way to produce such a value, but various runtimes also expose a suitable
9073 pointer in platform-specific ways.
9075 The ``idx`` argument to '``llvm.localrecover``' indicates which alloca passed to
9076 '``llvm.localescape``' to recover. It is zero-indexed.
9081 These intrinsics allow a group of functions to share access to a set of local
9082 stack allocations of a one parent function. The parent function may call the
9083 '``llvm.localescape``' intrinsic once from the function entry block, and the
9084 child functions can use '``llvm.localrecover``' to access the escaped allocas.
9085 The '``llvm.localescape``' intrinsic blocks inlining, as inlining changes where
9086 the escaped allocas are allocated, which would break attempts to use
9087 '``llvm.localrecover``'.
9089 .. _int_read_register:
9090 .. _int_write_register:
9092 '``llvm.read_register``' and '``llvm.write_register``' Intrinsics
9093 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9100 declare i32 @llvm.read_register.i32(metadata)
9101 declare i64 @llvm.read_register.i64(metadata)
9102 declare void @llvm.write_register.i32(metadata, i32 @value)
9103 declare void @llvm.write_register.i64(metadata, i64 @value)
9109 The '``llvm.read_register``' and '``llvm.write_register``' intrinsics
9110 provides access to the named register. The register must be valid on
9111 the architecture being compiled to. The type needs to be compatible
9112 with the register being read.
9117 The '``llvm.read_register``' intrinsic returns the current value of the
9118 register, where possible. The '``llvm.write_register``' intrinsic sets
9119 the current value of the register, where possible.
9121 This is useful to implement named register global variables that need
9122 to always be mapped to a specific register, as is common practice on
9123 bare-metal programs including OS kernels.
9125 The compiler doesn't check for register availability or use of the used
9126 register in surrounding code, including inline assembly. Because of that,
9127 allocatable registers are not supported.
9129 Warning: So far it only works with the stack pointer on selected
9130 architectures (ARM, AArch64, PowerPC and x86_64). Significant amount of
9131 work is needed to support other registers and even more so, allocatable
9136 '``llvm.stacksave``' Intrinsic
9137 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9144 declare i8* @llvm.stacksave()
9149 The '``llvm.stacksave``' intrinsic is used to remember the current state
9150 of the function stack, for use with
9151 :ref:`llvm.stackrestore <int_stackrestore>`. This is useful for
9152 implementing language features like scoped automatic variable sized
9158 This intrinsic returns a opaque pointer value that can be passed to
9159 :ref:`llvm.stackrestore <int_stackrestore>`. When an
9160 ``llvm.stackrestore`` intrinsic is executed with a value saved from
9161 ``llvm.stacksave``, it effectively restores the state of the stack to
9162 the state it was in when the ``llvm.stacksave`` intrinsic executed. In
9163 practice, this pops any :ref:`alloca <i_alloca>` blocks from the stack that
9164 were allocated after the ``llvm.stacksave`` was executed.
9166 .. _int_stackrestore:
9168 '``llvm.stackrestore``' Intrinsic
9169 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9176 declare void @llvm.stackrestore(i8* %ptr)
9181 The '``llvm.stackrestore``' intrinsic is used to restore the state of
9182 the function stack to the state it was in when the corresponding
9183 :ref:`llvm.stacksave <int_stacksave>` intrinsic executed. This is
9184 useful for implementing language features like scoped automatic variable
9185 sized arrays in C99.
9190 See the description for :ref:`llvm.stacksave <int_stacksave>`.
9192 '``llvm.prefetch``' Intrinsic
9193 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9200 declare void @llvm.prefetch(i8* <address>, i32 <rw>, i32 <locality>, i32 <cache type>)
9205 The '``llvm.prefetch``' intrinsic is a hint to the code generator to
9206 insert a prefetch instruction if supported; otherwise, it is a noop.
9207 Prefetches have no effect on the behavior of the program but can change
9208 its performance characteristics.
9213 ``address`` is the address to be prefetched, ``rw`` is the specifier
9214 determining if the fetch should be for a read (0) or write (1), and
9215 ``locality`` is a temporal locality specifier ranging from (0) - no
9216 locality, to (3) - extremely local keep in cache. The ``cache type``
9217 specifies whether the prefetch is performed on the data (1) or
9218 instruction (0) cache. The ``rw``, ``locality`` and ``cache type``
9219 arguments must be constant integers.
9224 This intrinsic does not modify the behavior of the program. In
9225 particular, prefetches cannot trap and do not produce a value. On
9226 targets that support this intrinsic, the prefetch can provide hints to
9227 the processor cache for better performance.
9229 '``llvm.pcmarker``' Intrinsic
9230 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9237 declare void @llvm.pcmarker(i32 <id>)
9242 The '``llvm.pcmarker``' intrinsic is a method to export a Program
9243 Counter (PC) in a region of code to simulators and other tools. The
9244 method is target specific, but it is expected that the marker will use
9245 exported symbols to transmit the PC of the marker. The marker makes no
9246 guarantees that it will remain with any specific instruction after
9247 optimizations. It is possible that the presence of a marker will inhibit
9248 optimizations. The intended use is to be inserted after optimizations to
9249 allow correlations of simulation runs.
9254 ``id`` is a numerical id identifying the marker.
9259 This intrinsic does not modify the behavior of the program. Backends
9260 that do not support this intrinsic may ignore it.
9262 '``llvm.readcyclecounter``' Intrinsic
9263 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9270 declare i64 @llvm.readcyclecounter()
9275 The '``llvm.readcyclecounter``' intrinsic provides access to the cycle
9276 counter register (or similar low latency, high accuracy clocks) on those
9277 targets that support it. On X86, it should map to RDTSC. On Alpha, it
9278 should map to RPCC. As the backing counters overflow quickly (on the
9279 order of 9 seconds on alpha), this should only be used for small
9285 When directly supported, reading the cycle counter should not modify any
9286 memory. Implementations are allowed to either return a application
9287 specific value or a system wide value. On backends without support, this
9288 is lowered to a constant 0.
9290 Note that runtime support may be conditional on the privilege-level code is
9291 running at and the host platform.
9293 '``llvm.clear_cache``' Intrinsic
9294 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9301 declare void @llvm.clear_cache(i8*, i8*)
9306 The '``llvm.clear_cache``' intrinsic ensures visibility of modifications
9307 in the specified range to the execution unit of the processor. On
9308 targets with non-unified instruction and data cache, the implementation
9309 flushes the instruction cache.
9314 On platforms with coherent instruction and data caches (e.g. x86), this
9315 intrinsic is a nop. On platforms with non-coherent instruction and data
9316 cache (e.g. ARM, MIPS), the intrinsic is lowered either to appropriate
9317 instructions or a system call, if cache flushing requires special
9320 The default behavior is to emit a call to ``__clear_cache`` from the run
9323 This instrinsic does *not* empty the instruction pipeline. Modifications
9324 of the current function are outside the scope of the intrinsic.
9326 '``llvm.instrprof_increment``' Intrinsic
9327 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9334 declare void @llvm.instrprof_increment(i8* <name>, i64 <hash>,
9335 i32 <num-counters>, i32 <index>)
9340 The '``llvm.instrprof_increment``' intrinsic can be emitted by a
9341 frontend for use with instrumentation based profiling. These will be
9342 lowered by the ``-instrprof`` pass to generate execution counts of a
9348 The first argument is a pointer to a global variable containing the
9349 name of the entity being instrumented. This should generally be the
9350 (mangled) function name for a set of counters.
9352 The second argument is a hash value that can be used by the consumer
9353 of the profile data to detect changes to the instrumented source, and
9354 the third is the number of counters associated with ``name``. It is an
9355 error if ``hash`` or ``num-counters`` differ between two instances of
9356 ``instrprof_increment`` that refer to the same name.
9358 The last argument refers to which of the counters for ``name`` should
9359 be incremented. It should be a value between 0 and ``num-counters``.
9364 This intrinsic represents an increment of a profiling counter. It will
9365 cause the ``-instrprof`` pass to generate the appropriate data
9366 structures and the code to increment the appropriate value, in a
9367 format that can be written out by a compiler runtime and consumed via
9368 the ``llvm-profdata`` tool.
9370 Standard C Library Intrinsics
9371 -----------------------------
9373 LLVM provides intrinsics for a few important standard C library
9374 functions. These intrinsics allow source-language front-ends to pass
9375 information about the alignment of the pointer arguments to the code
9376 generator, providing opportunity for more efficient code generation.
9380 '``llvm.memcpy``' Intrinsic
9381 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
9386 This is an overloaded intrinsic. You can use ``llvm.memcpy`` on any
9387 integer bit width and for different address spaces. Not all targets
9388 support all bit widths however.
9392 declare void @llvm.memcpy.p0i8.p0i8.i32(i8* <dest>, i8* <src>,
9393 i32 <len>, i32 <align>, i1 <isvolatile>)
9394 declare void @llvm.memcpy.p0i8.p0i8.i64(i8* <dest>, i8* <src>,
9395 i64 <len>, i32 <align>, i1 <isvolatile>)
9400 The '``llvm.memcpy.*``' intrinsics copy a block of memory from the
9401 source location to the destination location.
9403 Note that, unlike the standard libc function, the ``llvm.memcpy.*``
9404 intrinsics do not return a value, takes extra alignment/isvolatile
9405 arguments and the pointers can be in specified address spaces.
9410 The first argument is a pointer to the destination, the second is a
9411 pointer to the source. The third argument is an integer argument
9412 specifying the number of bytes to copy, the fourth argument is the
9413 alignment of the source and destination locations, and the fifth is a
9414 boolean indicating a volatile access.
9416 If the call to this intrinsic has an alignment value that is not 0 or 1,
9417 then the caller guarantees that both the source and destination pointers
9418 are aligned to that boundary.
9420 If the ``isvolatile`` parameter is ``true``, the ``llvm.memcpy`` call is
9421 a :ref:`volatile operation <volatile>`. The detailed access behavior is not
9422 very cleanly specified and it is unwise to depend on it.
9427 The '``llvm.memcpy.*``' intrinsics copy a block of memory from the
9428 source location to the destination location, which are not allowed to
9429 overlap. It copies "len" bytes of memory over. If the argument is known
9430 to be aligned to some boundary, this can be specified as the fourth
9431 argument, otherwise it should be set to 0 or 1 (both meaning no alignment).
9433 '``llvm.memmove``' Intrinsic
9434 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9439 This is an overloaded intrinsic. You can use llvm.memmove on any integer
9440 bit width and for different address space. Not all targets support all
9445 declare void @llvm.memmove.p0i8.p0i8.i32(i8* <dest>, i8* <src>,
9446 i32 <len>, i32 <align>, i1 <isvolatile>)
9447 declare void @llvm.memmove.p0i8.p0i8.i64(i8* <dest>, i8* <src>,
9448 i64 <len>, i32 <align>, i1 <isvolatile>)
9453 The '``llvm.memmove.*``' intrinsics move a block of memory from the
9454 source location to the destination location. It is similar to the
9455 '``llvm.memcpy``' intrinsic but allows the two memory locations to
9458 Note that, unlike the standard libc function, the ``llvm.memmove.*``
9459 intrinsics do not return a value, takes extra alignment/isvolatile
9460 arguments and the pointers can be in specified address spaces.
9465 The first argument is a pointer to the destination, the second is a
9466 pointer to the source. The third argument is an integer argument
9467 specifying the number of bytes to copy, the fourth argument is the
9468 alignment of the source and destination locations, and the fifth is a
9469 boolean indicating a volatile access.
9471 If the call to this intrinsic has an alignment value that is not 0 or 1,
9472 then the caller guarantees that the source and destination pointers are
9473 aligned to that boundary.
9475 If the ``isvolatile`` parameter is ``true``, the ``llvm.memmove`` call
9476 is a :ref:`volatile operation <volatile>`. The detailed access behavior is
9477 not very cleanly specified and it is unwise to depend on it.
9482 The '``llvm.memmove.*``' intrinsics copy a block of memory from the
9483 source location to the destination location, which may overlap. It
9484 copies "len" bytes of memory over. If the argument is known to be
9485 aligned to some boundary, this can be specified as the fourth argument,
9486 otherwise it should be set to 0 or 1 (both meaning no alignment).
9488 '``llvm.memset.*``' Intrinsics
9489 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9494 This is an overloaded intrinsic. You can use llvm.memset on any integer
9495 bit width and for different address spaces. However, not all targets
9496 support all bit widths.
9500 declare void @llvm.memset.p0i8.i32(i8* <dest>, i8 <val>,
9501 i32 <len>, i32 <align>, i1 <isvolatile>)
9502 declare void @llvm.memset.p0i8.i64(i8* <dest>, i8 <val>,
9503 i64 <len>, i32 <align>, i1 <isvolatile>)
9508 The '``llvm.memset.*``' intrinsics fill a block of memory with a
9509 particular byte value.
9511 Note that, unlike the standard libc function, the ``llvm.memset``
9512 intrinsic does not return a value and takes extra alignment/volatile
9513 arguments. Also, the destination can be in an arbitrary address space.
9518 The first argument is a pointer to the destination to fill, the second
9519 is the byte value with which to fill it, the third argument is an
9520 integer argument specifying the number of bytes to fill, and the fourth
9521 argument is the known alignment of the destination location.
9523 If the call to this intrinsic has an alignment value that is not 0 or 1,
9524 then the caller guarantees that the destination pointer is aligned to
9527 If the ``isvolatile`` parameter is ``true``, the ``llvm.memset`` call is
9528 a :ref:`volatile operation <volatile>`. The detailed access behavior is not
9529 very cleanly specified and it is unwise to depend on it.
9534 The '``llvm.memset.*``' intrinsics fill "len" bytes of memory starting
9535 at the destination location. If the argument is known to be aligned to
9536 some boundary, this can be specified as the fourth argument, otherwise
9537 it should be set to 0 or 1 (both meaning no alignment).
9539 '``llvm.sqrt.*``' Intrinsic
9540 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
9545 This is an overloaded intrinsic. You can use ``llvm.sqrt`` on any
9546 floating point or vector of floating point type. Not all targets support
9551 declare float @llvm.sqrt.f32(float %Val)
9552 declare double @llvm.sqrt.f64(double %Val)
9553 declare x86_fp80 @llvm.sqrt.f80(x86_fp80 %Val)
9554 declare fp128 @llvm.sqrt.f128(fp128 %Val)
9555 declare ppc_fp128 @llvm.sqrt.ppcf128(ppc_fp128 %Val)
9560 The '``llvm.sqrt``' intrinsics return the sqrt of the specified operand,
9561 returning the same value as the libm '``sqrt``' functions would. Unlike
9562 ``sqrt`` in libm, however, ``llvm.sqrt`` has undefined behavior for
9563 negative numbers other than -0.0 (which allows for better optimization,
9564 because there is no need to worry about errno being set).
9565 ``llvm.sqrt(-0.0)`` is defined to return -0.0 like IEEE sqrt.
9570 The argument and return value are floating point numbers of the same
9576 This function returns the sqrt of the specified operand if it is a
9577 nonnegative floating point number.
9579 '``llvm.powi.*``' Intrinsic
9580 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
9585 This is an overloaded intrinsic. You can use ``llvm.powi`` on any
9586 floating point or vector of floating point type. Not all targets support
9591 declare float @llvm.powi.f32(float %Val, i32 %power)
9592 declare double @llvm.powi.f64(double %Val, i32 %power)
9593 declare x86_fp80 @llvm.powi.f80(x86_fp80 %Val, i32 %power)
9594 declare fp128 @llvm.powi.f128(fp128 %Val, i32 %power)
9595 declare ppc_fp128 @llvm.powi.ppcf128(ppc_fp128 %Val, i32 %power)
9600 The '``llvm.powi.*``' intrinsics return the first operand raised to the
9601 specified (positive or negative) power. The order of evaluation of
9602 multiplications is not defined. When a vector of floating point type is
9603 used, the second argument remains a scalar integer value.
9608 The second argument is an integer power, and the first is a value to
9609 raise to that power.
9614 This function returns the first value raised to the second power with an
9615 unspecified sequence of rounding operations.
9617 '``llvm.sin.*``' Intrinsic
9618 ^^^^^^^^^^^^^^^^^^^^^^^^^^
9623 This is an overloaded intrinsic. You can use ``llvm.sin`` on any
9624 floating point or vector of floating point type. Not all targets support
9629 declare float @llvm.sin.f32(float %Val)
9630 declare double @llvm.sin.f64(double %Val)
9631 declare x86_fp80 @llvm.sin.f80(x86_fp80 %Val)
9632 declare fp128 @llvm.sin.f128(fp128 %Val)
9633 declare ppc_fp128 @llvm.sin.ppcf128(ppc_fp128 %Val)
9638 The '``llvm.sin.*``' intrinsics return the sine of the operand.
9643 The argument and return value are floating point numbers of the same
9649 This function returns the sine of the specified operand, returning the
9650 same values as the libm ``sin`` functions would, and handles error
9651 conditions in the same way.
9653 '``llvm.cos.*``' Intrinsic
9654 ^^^^^^^^^^^^^^^^^^^^^^^^^^
9659 This is an overloaded intrinsic. You can use ``llvm.cos`` on any
9660 floating point or vector of floating point type. Not all targets support
9665 declare float @llvm.cos.f32(float %Val)
9666 declare double @llvm.cos.f64(double %Val)
9667 declare x86_fp80 @llvm.cos.f80(x86_fp80 %Val)
9668 declare fp128 @llvm.cos.f128(fp128 %Val)
9669 declare ppc_fp128 @llvm.cos.ppcf128(ppc_fp128 %Val)
9674 The '``llvm.cos.*``' intrinsics return the cosine of the operand.
9679 The argument and return value are floating point numbers of the same
9685 This function returns the cosine of the specified operand, returning the
9686 same values as the libm ``cos`` functions would, and handles error
9687 conditions in the same way.
9689 '``llvm.pow.*``' Intrinsic
9690 ^^^^^^^^^^^^^^^^^^^^^^^^^^
9695 This is an overloaded intrinsic. You can use ``llvm.pow`` on any
9696 floating point or vector of floating point type. Not all targets support
9701 declare float @llvm.pow.f32(float %Val, float %Power)
9702 declare double @llvm.pow.f64(double %Val, double %Power)
9703 declare x86_fp80 @llvm.pow.f80(x86_fp80 %Val, x86_fp80 %Power)
9704 declare fp128 @llvm.pow.f128(fp128 %Val, fp128 %Power)
9705 declare ppc_fp128 @llvm.pow.ppcf128(ppc_fp128 %Val, ppc_fp128 Power)
9710 The '``llvm.pow.*``' intrinsics return the first operand raised to the
9711 specified (positive or negative) power.
9716 The second argument is a floating point power, and the first is a value
9717 to raise to that power.
9722 This function returns the first value raised to the second power,
9723 returning the same values as the libm ``pow`` functions would, and
9724 handles error conditions in the same way.
9726 '``llvm.exp.*``' Intrinsic
9727 ^^^^^^^^^^^^^^^^^^^^^^^^^^
9732 This is an overloaded intrinsic. You can use ``llvm.exp`` on any
9733 floating point or vector of floating point type. Not all targets support
9738 declare float @llvm.exp.f32(float %Val)
9739 declare double @llvm.exp.f64(double %Val)
9740 declare x86_fp80 @llvm.exp.f80(x86_fp80 %Val)
9741 declare fp128 @llvm.exp.f128(fp128 %Val)
9742 declare ppc_fp128 @llvm.exp.ppcf128(ppc_fp128 %Val)
9747 The '``llvm.exp.*``' intrinsics perform the exp function.
9752 The argument and return value are floating point numbers of the same
9758 This function returns the same values as the libm ``exp`` functions
9759 would, and handles error conditions in the same way.
9761 '``llvm.exp2.*``' Intrinsic
9762 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
9767 This is an overloaded intrinsic. You can use ``llvm.exp2`` on any
9768 floating point or vector of floating point type. Not all targets support
9773 declare float @llvm.exp2.f32(float %Val)
9774 declare double @llvm.exp2.f64(double %Val)
9775 declare x86_fp80 @llvm.exp2.f80(x86_fp80 %Val)
9776 declare fp128 @llvm.exp2.f128(fp128 %Val)
9777 declare ppc_fp128 @llvm.exp2.ppcf128(ppc_fp128 %Val)
9782 The '``llvm.exp2.*``' intrinsics perform the exp2 function.
9787 The argument and return value are floating point numbers of the same
9793 This function returns the same values as the libm ``exp2`` functions
9794 would, and handles error conditions in the same way.
9796 '``llvm.log.*``' Intrinsic
9797 ^^^^^^^^^^^^^^^^^^^^^^^^^^
9802 This is an overloaded intrinsic. You can use ``llvm.log`` on any
9803 floating point or vector of floating point type. Not all targets support
9808 declare float @llvm.log.f32(float %Val)
9809 declare double @llvm.log.f64(double %Val)
9810 declare x86_fp80 @llvm.log.f80(x86_fp80 %Val)
9811 declare fp128 @llvm.log.f128(fp128 %Val)
9812 declare ppc_fp128 @llvm.log.ppcf128(ppc_fp128 %Val)
9817 The '``llvm.log.*``' intrinsics perform the log function.
9822 The argument and return value are floating point numbers of the same
9828 This function returns the same values as the libm ``log`` functions
9829 would, and handles error conditions in the same way.
9831 '``llvm.log10.*``' Intrinsic
9832 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9837 This is an overloaded intrinsic. You can use ``llvm.log10`` on any
9838 floating point or vector of floating point type. Not all targets support
9843 declare float @llvm.log10.f32(float %Val)
9844 declare double @llvm.log10.f64(double %Val)
9845 declare x86_fp80 @llvm.log10.f80(x86_fp80 %Val)
9846 declare fp128 @llvm.log10.f128(fp128 %Val)
9847 declare ppc_fp128 @llvm.log10.ppcf128(ppc_fp128 %Val)
9852 The '``llvm.log10.*``' intrinsics perform the log10 function.
9857 The argument and return value are floating point numbers of the same
9863 This function returns the same values as the libm ``log10`` functions
9864 would, and handles error conditions in the same way.
9866 '``llvm.log2.*``' Intrinsic
9867 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
9872 This is an overloaded intrinsic. You can use ``llvm.log2`` on any
9873 floating point or vector of floating point type. Not all targets support
9878 declare float @llvm.log2.f32(float %Val)
9879 declare double @llvm.log2.f64(double %Val)
9880 declare x86_fp80 @llvm.log2.f80(x86_fp80 %Val)
9881 declare fp128 @llvm.log2.f128(fp128 %Val)
9882 declare ppc_fp128 @llvm.log2.ppcf128(ppc_fp128 %Val)
9887 The '``llvm.log2.*``' intrinsics perform the log2 function.
9892 The argument and return value are floating point numbers of the same
9898 This function returns the same values as the libm ``log2`` functions
9899 would, and handles error conditions in the same way.
9901 '``llvm.fma.*``' Intrinsic
9902 ^^^^^^^^^^^^^^^^^^^^^^^^^^
9907 This is an overloaded intrinsic. You can use ``llvm.fma`` on any
9908 floating point or vector of floating point type. Not all targets support
9913 declare float @llvm.fma.f32(float %a, float %b, float %c)
9914 declare double @llvm.fma.f64(double %a, double %b, double %c)
9915 declare x86_fp80 @llvm.fma.f80(x86_fp80 %a, x86_fp80 %b, x86_fp80 %c)
9916 declare fp128 @llvm.fma.f128(fp128 %a, fp128 %b, fp128 %c)
9917 declare ppc_fp128 @llvm.fma.ppcf128(ppc_fp128 %a, ppc_fp128 %b, ppc_fp128 %c)
9922 The '``llvm.fma.*``' intrinsics perform the fused multiply-add
9928 The argument and return value are floating point numbers of the same
9934 This function returns the same values as the libm ``fma`` functions
9935 would, and does not set errno.
9937 '``llvm.fabs.*``' Intrinsic
9938 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
9943 This is an overloaded intrinsic. You can use ``llvm.fabs`` on any
9944 floating point or vector of floating point type. Not all targets support
9949 declare float @llvm.fabs.f32(float %Val)
9950 declare double @llvm.fabs.f64(double %Val)
9951 declare x86_fp80 @llvm.fabs.f80(x86_fp80 %Val)
9952 declare fp128 @llvm.fabs.f128(fp128 %Val)
9953 declare ppc_fp128 @llvm.fabs.ppcf128(ppc_fp128 %Val)
9958 The '``llvm.fabs.*``' intrinsics return the absolute value of the
9964 The argument and return value are floating point numbers of the same
9970 This function returns the same values as the libm ``fabs`` functions
9971 would, and handles error conditions in the same way.
9973 '``llvm.minnum.*``' Intrinsic
9974 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
9979 This is an overloaded intrinsic. You can use ``llvm.minnum`` on any
9980 floating point or vector of floating point type. Not all targets support
9985 declare float @llvm.minnum.f32(float %Val0, float %Val1)
9986 declare double @llvm.minnum.f64(double %Val0, double %Val1)
9987 declare x86_fp80 @llvm.minnum.f80(x86_fp80 %Val0, x86_fp80 %Val1)
9988 declare fp128 @llvm.minnum.f128(fp128 %Val0, fp128 %Val1)
9989 declare ppc_fp128 @llvm.minnum.ppcf128(ppc_fp128 %Val0, ppc_fp128 %Val1)
9994 The '``llvm.minnum.*``' intrinsics return the minimum of the two
10001 The arguments and return value are floating point numbers of the same
10007 Follows the IEEE-754 semantics for minNum, which also match for libm's
10010 If either operand is a NaN, returns the other non-NaN operand. Returns
10011 NaN only if both operands are NaN. If the operands compare equal,
10012 returns a value that compares equal to both operands. This means that
10013 fmin(+/-0.0, +/-0.0) could return either -0.0 or 0.0.
10015 '``llvm.maxnum.*``' Intrinsic
10016 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
10021 This is an overloaded intrinsic. You can use ``llvm.maxnum`` on any
10022 floating point or vector of floating point type. Not all targets support
10027 declare float @llvm.maxnum.f32(float %Val0, float %Val1l)
10028 declare double @llvm.maxnum.f64(double %Val0, double %Val1)
10029 declare x86_fp80 @llvm.maxnum.f80(x86_fp80 %Val0, x86_fp80 %Val1)
10030 declare fp128 @llvm.maxnum.f128(fp128 %Val0, fp128 %Val1)
10031 declare ppc_fp128 @llvm.maxnum.ppcf128(ppc_fp128 %Val0, ppc_fp128 %Val1)
10036 The '``llvm.maxnum.*``' intrinsics return the maximum of the two
10043 The arguments and return value are floating point numbers of the same
10048 Follows the IEEE-754 semantics for maxNum, which also match for libm's
10051 If either operand is a NaN, returns the other non-NaN operand. Returns
10052 NaN only if both operands are NaN. If the operands compare equal,
10053 returns a value that compares equal to both operands. This means that
10054 fmax(+/-0.0, +/-0.0) could return either -0.0 or 0.0.
10056 '``llvm.copysign.*``' Intrinsic
10057 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
10062 This is an overloaded intrinsic. You can use ``llvm.copysign`` on any
10063 floating point or vector of floating point type. Not all targets support
10068 declare float @llvm.copysign.f32(float %Mag, float %Sgn)
10069 declare double @llvm.copysign.f64(double %Mag, double %Sgn)
10070 declare x86_fp80 @llvm.copysign.f80(x86_fp80 %Mag, x86_fp80 %Sgn)
10071 declare fp128 @llvm.copysign.f128(fp128 %Mag, fp128 %Sgn)
10072 declare ppc_fp128 @llvm.copysign.ppcf128(ppc_fp128 %Mag, ppc_fp128 %Sgn)
10077 The '``llvm.copysign.*``' intrinsics return a value with the magnitude of the
10078 first operand and the sign of the second operand.
10083 The arguments and return value are floating point numbers of the same
10089 This function returns the same values as the libm ``copysign``
10090 functions would, and handles error conditions in the same way.
10092 '``llvm.floor.*``' Intrinsic
10093 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
10098 This is an overloaded intrinsic. You can use ``llvm.floor`` on any
10099 floating point or vector of floating point type. Not all targets support
10104 declare float @llvm.floor.f32(float %Val)
10105 declare double @llvm.floor.f64(double %Val)
10106 declare x86_fp80 @llvm.floor.f80(x86_fp80 %Val)
10107 declare fp128 @llvm.floor.f128(fp128 %Val)
10108 declare ppc_fp128 @llvm.floor.ppcf128(ppc_fp128 %Val)
10113 The '``llvm.floor.*``' intrinsics return the floor of the operand.
10118 The argument and return value are floating point numbers of the same
10124 This function returns the same values as the libm ``floor`` functions
10125 would, and handles error conditions in the same way.
10127 '``llvm.ceil.*``' Intrinsic
10128 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
10133 This is an overloaded intrinsic. You can use ``llvm.ceil`` on any
10134 floating point or vector of floating point type. Not all targets support
10139 declare float @llvm.ceil.f32(float %Val)
10140 declare double @llvm.ceil.f64(double %Val)
10141 declare x86_fp80 @llvm.ceil.f80(x86_fp80 %Val)
10142 declare fp128 @llvm.ceil.f128(fp128 %Val)
10143 declare ppc_fp128 @llvm.ceil.ppcf128(ppc_fp128 %Val)
10148 The '``llvm.ceil.*``' intrinsics return the ceiling of the operand.
10153 The argument and return value are floating point numbers of the same
10159 This function returns the same values as the libm ``ceil`` functions
10160 would, and handles error conditions in the same way.
10162 '``llvm.trunc.*``' Intrinsic
10163 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
10168 This is an overloaded intrinsic. You can use ``llvm.trunc`` on any
10169 floating point or vector of floating point type. Not all targets support
10174 declare float @llvm.trunc.f32(float %Val)
10175 declare double @llvm.trunc.f64(double %Val)
10176 declare x86_fp80 @llvm.trunc.f80(x86_fp80 %Val)
10177 declare fp128 @llvm.trunc.f128(fp128 %Val)
10178 declare ppc_fp128 @llvm.trunc.ppcf128(ppc_fp128 %Val)
10183 The '``llvm.trunc.*``' intrinsics returns the operand rounded to the
10184 nearest integer not larger in magnitude than the operand.
10189 The argument and return value are floating point numbers of the same
10195 This function returns the same values as the libm ``trunc`` functions
10196 would, and handles error conditions in the same way.
10198 '``llvm.rint.*``' Intrinsic
10199 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
10204 This is an overloaded intrinsic. You can use ``llvm.rint`` on any
10205 floating point or vector of floating point type. Not all targets support
10210 declare float @llvm.rint.f32(float %Val)
10211 declare double @llvm.rint.f64(double %Val)
10212 declare x86_fp80 @llvm.rint.f80(x86_fp80 %Val)
10213 declare fp128 @llvm.rint.f128(fp128 %Val)
10214 declare ppc_fp128 @llvm.rint.ppcf128(ppc_fp128 %Val)
10219 The '``llvm.rint.*``' intrinsics returns the operand rounded to the
10220 nearest integer. It may raise an inexact floating-point exception if the
10221 operand isn't an integer.
10226 The argument and return value are floating point numbers of the same
10232 This function returns the same values as the libm ``rint`` functions
10233 would, and handles error conditions in the same way.
10235 '``llvm.nearbyint.*``' Intrinsic
10236 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
10241 This is an overloaded intrinsic. You can use ``llvm.nearbyint`` on any
10242 floating point or vector of floating point type. Not all targets support
10247 declare float @llvm.nearbyint.f32(float %Val)
10248 declare double @llvm.nearbyint.f64(double %Val)
10249 declare x86_fp80 @llvm.nearbyint.f80(x86_fp80 %Val)
10250 declare fp128 @llvm.nearbyint.f128(fp128 %Val)
10251 declare ppc_fp128 @llvm.nearbyint.ppcf128(ppc_fp128 %Val)
10256 The '``llvm.nearbyint.*``' intrinsics returns the operand rounded to the
10262 The argument and return value are floating point numbers of the same
10268 This function returns the same values as the libm ``nearbyint``
10269 functions would, and handles error conditions in the same way.
10271 '``llvm.round.*``' Intrinsic
10272 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
10277 This is an overloaded intrinsic. You can use ``llvm.round`` on any
10278 floating point or vector of floating point type. Not all targets support
10283 declare float @llvm.round.f32(float %Val)
10284 declare double @llvm.round.f64(double %Val)
10285 declare x86_fp80 @llvm.round.f80(x86_fp80 %Val)
10286 declare fp128 @llvm.round.f128(fp128 %Val)
10287 declare ppc_fp128 @llvm.round.ppcf128(ppc_fp128 %Val)
10292 The '``llvm.round.*``' intrinsics returns the operand rounded to the
10298 The argument and return value are floating point numbers of the same
10304 This function returns the same values as the libm ``round``
10305 functions would, and handles error conditions in the same way.
10307 Bit Manipulation Intrinsics
10308 ---------------------------
10310 LLVM provides intrinsics for a few important bit manipulation
10311 operations. These allow efficient code generation for some algorithms.
10313 '``llvm.bswap.*``' Intrinsics
10314 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
10319 This is an overloaded intrinsic function. You can use bswap on any
10320 integer type that is an even number of bytes (i.e. BitWidth % 16 == 0).
10324 declare i16 @llvm.bswap.i16(i16 <id>)
10325 declare i32 @llvm.bswap.i32(i32 <id>)
10326 declare i64 @llvm.bswap.i64(i64 <id>)
10331 The '``llvm.bswap``' family of intrinsics is used to byte swap integer
10332 values with an even number of bytes (positive multiple of 16 bits).
10333 These are useful for performing operations on data that is not in the
10334 target's native byte order.
10339 The ``llvm.bswap.i16`` intrinsic returns an i16 value that has the high
10340 and low byte of the input i16 swapped. Similarly, the ``llvm.bswap.i32``
10341 intrinsic returns an i32 value that has the four bytes of the input i32
10342 swapped, so that if the input bytes are numbered 0, 1, 2, 3 then the
10343 returned i32 will have its bytes in 3, 2, 1, 0 order. The
10344 ``llvm.bswap.i48``, ``llvm.bswap.i64`` and other intrinsics extend this
10345 concept to additional even-byte lengths (6 bytes, 8 bytes and more,
10348 '``llvm.ctpop.*``' Intrinsic
10349 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
10354 This is an overloaded intrinsic. You can use llvm.ctpop on any integer
10355 bit width, or on any vector with integer elements. Not all targets
10356 support all bit widths or vector types, however.
10360 declare i8 @llvm.ctpop.i8(i8 <src>)
10361 declare i16 @llvm.ctpop.i16(i16 <src>)
10362 declare i32 @llvm.ctpop.i32(i32 <src>)
10363 declare i64 @llvm.ctpop.i64(i64 <src>)
10364 declare i256 @llvm.ctpop.i256(i256 <src>)
10365 declare <2 x i32> @llvm.ctpop.v2i32(<2 x i32> <src>)
10370 The '``llvm.ctpop``' family of intrinsics counts the number of bits set
10376 The only argument is the value to be counted. The argument may be of any
10377 integer type, or a vector with integer elements. The return type must
10378 match the argument type.
10383 The '``llvm.ctpop``' intrinsic counts the 1's in a variable, or within
10384 each element of a vector.
10386 '``llvm.ctlz.*``' Intrinsic
10387 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
10392 This is an overloaded intrinsic. You can use ``llvm.ctlz`` on any
10393 integer bit width, or any vector whose elements are integers. Not all
10394 targets support all bit widths or vector types, however.
10398 declare i8 @llvm.ctlz.i8 (i8 <src>, i1 <is_zero_undef>)
10399 declare i16 @llvm.ctlz.i16 (i16 <src>, i1 <is_zero_undef>)
10400 declare i32 @llvm.ctlz.i32 (i32 <src>, i1 <is_zero_undef>)
10401 declare i64 @llvm.ctlz.i64 (i64 <src>, i1 <is_zero_undef>)
10402 declare i256 @llvm.ctlz.i256(i256 <src>, i1 <is_zero_undef>)
10403 declase <2 x i32> @llvm.ctlz.v2i32(<2 x i32> <src>, i1 <is_zero_undef>)
10408 The '``llvm.ctlz``' family of intrinsic functions counts the number of
10409 leading zeros in a variable.
10414 The first argument is the value to be counted. This argument may be of
10415 any integer type, or a vector with integer element type. The return
10416 type must match the first argument type.
10418 The second argument must be a constant and is a flag to indicate whether
10419 the intrinsic should ensure that a zero as the first argument produces a
10420 defined result. Historically some architectures did not provide a
10421 defined result for zero values as efficiently, and many algorithms are
10422 now predicated on avoiding zero-value inputs.
10427 The '``llvm.ctlz``' intrinsic counts the leading (most significant)
10428 zeros in a variable, or within each element of the vector. If
10429 ``src == 0`` then the result is the size in bits of the type of ``src``
10430 if ``is_zero_undef == 0`` and ``undef`` otherwise. For example,
10431 ``llvm.ctlz(i32 2) = 30``.
10433 '``llvm.cttz.*``' Intrinsic
10434 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
10439 This is an overloaded intrinsic. You can use ``llvm.cttz`` on any
10440 integer bit width, or any vector of integer elements. Not all targets
10441 support all bit widths or vector types, however.
10445 declare i8 @llvm.cttz.i8 (i8 <src>, i1 <is_zero_undef>)
10446 declare i16 @llvm.cttz.i16 (i16 <src>, i1 <is_zero_undef>)
10447 declare i32 @llvm.cttz.i32 (i32 <src>, i1 <is_zero_undef>)
10448 declare i64 @llvm.cttz.i64 (i64 <src>, i1 <is_zero_undef>)
10449 declare i256 @llvm.cttz.i256(i256 <src>, i1 <is_zero_undef>)
10450 declase <2 x i32> @llvm.cttz.v2i32(<2 x i32> <src>, i1 <is_zero_undef>)
10455 The '``llvm.cttz``' family of intrinsic functions counts the number of
10461 The first argument is the value to be counted. This argument may be of
10462 any integer type, or a vector with integer element type. The return
10463 type must match the first argument type.
10465 The second argument must be a constant and is a flag to indicate whether
10466 the intrinsic should ensure that a zero as the first argument produces a
10467 defined result. Historically some architectures did not provide a
10468 defined result for zero values as efficiently, and many algorithms are
10469 now predicated on avoiding zero-value inputs.
10474 The '``llvm.cttz``' intrinsic counts the trailing (least significant)
10475 zeros in a variable, or within each element of a vector. If ``src == 0``
10476 then the result is the size in bits of the type of ``src`` if
10477 ``is_zero_undef == 0`` and ``undef`` otherwise. For example,
10478 ``llvm.cttz(2) = 1``.
10482 Arithmetic with Overflow Intrinsics
10483 -----------------------------------
10485 LLVM provides intrinsics for some arithmetic with overflow operations.
10487 '``llvm.sadd.with.overflow.*``' Intrinsics
10488 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
10493 This is an overloaded intrinsic. You can use ``llvm.sadd.with.overflow``
10494 on any integer bit width.
10498 declare {i16, i1} @llvm.sadd.with.overflow.i16(i16 %a, i16 %b)
10499 declare {i32, i1} @llvm.sadd.with.overflow.i32(i32 %a, i32 %b)
10500 declare {i64, i1} @llvm.sadd.with.overflow.i64(i64 %a, i64 %b)
10505 The '``llvm.sadd.with.overflow``' family of intrinsic functions perform
10506 a signed addition of the two arguments, and indicate whether an overflow
10507 occurred during the signed summation.
10512 The arguments (%a and %b) and the first element of the result structure
10513 may be of integer types of any bit width, but they must have the same
10514 bit width. The second element of the result structure must be of type
10515 ``i1``. ``%a`` and ``%b`` are the two values that will undergo signed
10521 The '``llvm.sadd.with.overflow``' family of intrinsic functions perform
10522 a signed addition of the two variables. They return a structure --- the
10523 first element of which is the signed summation, and the second element
10524 of which is a bit specifying if the signed summation resulted in an
10530 .. code-block:: llvm
10532 %res = call {i32, i1} @llvm.sadd.with.overflow.i32(i32 %a, i32 %b)
10533 %sum = extractvalue {i32, i1} %res, 0
10534 %obit = extractvalue {i32, i1} %res, 1
10535 br i1 %obit, label %overflow, label %normal
10537 '``llvm.uadd.with.overflow.*``' Intrinsics
10538 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
10543 This is an overloaded intrinsic. You can use ``llvm.uadd.with.overflow``
10544 on any integer bit width.
10548 declare {i16, i1} @llvm.uadd.with.overflow.i16(i16 %a, i16 %b)
10549 declare {i32, i1} @llvm.uadd.with.overflow.i32(i32 %a, i32 %b)
10550 declare {i64, i1} @llvm.uadd.with.overflow.i64(i64 %a, i64 %b)
10555 The '``llvm.uadd.with.overflow``' family of intrinsic functions perform
10556 an unsigned addition of the two arguments, and indicate whether a carry
10557 occurred during the unsigned summation.
10562 The arguments (%a and %b) and the first element of the result structure
10563 may be of integer types of any bit width, but they must have the same
10564 bit width. The second element of the result structure must be of type
10565 ``i1``. ``%a`` and ``%b`` are the two values that will undergo unsigned
10571 The '``llvm.uadd.with.overflow``' family of intrinsic functions perform
10572 an unsigned addition of the two arguments. They return a structure --- the
10573 first element of which is the sum, and the second element of which is a
10574 bit specifying if the unsigned summation resulted in a carry.
10579 .. code-block:: llvm
10581 %res = call {i32, i1} @llvm.uadd.with.overflow.i32(i32 %a, i32 %b)
10582 %sum = extractvalue {i32, i1} %res, 0
10583 %obit = extractvalue {i32, i1} %res, 1
10584 br i1 %obit, label %carry, label %normal
10586 '``llvm.ssub.with.overflow.*``' Intrinsics
10587 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
10592 This is an overloaded intrinsic. You can use ``llvm.ssub.with.overflow``
10593 on any integer bit width.
10597 declare {i16, i1} @llvm.ssub.with.overflow.i16(i16 %a, i16 %b)
10598 declare {i32, i1} @llvm.ssub.with.overflow.i32(i32 %a, i32 %b)
10599 declare {i64, i1} @llvm.ssub.with.overflow.i64(i64 %a, i64 %b)
10604 The '``llvm.ssub.with.overflow``' family of intrinsic functions perform
10605 a signed subtraction of the two arguments, and indicate whether an
10606 overflow occurred during the signed subtraction.
10611 The arguments (%a and %b) and the first element of the result structure
10612 may be of integer types of any bit width, but they must have the same
10613 bit width. The second element of the result structure must be of type
10614 ``i1``. ``%a`` and ``%b`` are the two values that will undergo signed
10620 The '``llvm.ssub.with.overflow``' family of intrinsic functions perform
10621 a signed subtraction of the two arguments. They return a structure --- the
10622 first element of which is the subtraction, and the second element of
10623 which is a bit specifying if the signed subtraction resulted in an
10629 .. code-block:: llvm
10631 %res = call {i32, i1} @llvm.ssub.with.overflow.i32(i32 %a, i32 %b)
10632 %sum = extractvalue {i32, i1} %res, 0
10633 %obit = extractvalue {i32, i1} %res, 1
10634 br i1 %obit, label %overflow, label %normal
10636 '``llvm.usub.with.overflow.*``' Intrinsics
10637 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
10642 This is an overloaded intrinsic. You can use ``llvm.usub.with.overflow``
10643 on any integer bit width.
10647 declare {i16, i1} @llvm.usub.with.overflow.i16(i16 %a, i16 %b)
10648 declare {i32, i1} @llvm.usub.with.overflow.i32(i32 %a, i32 %b)
10649 declare {i64, i1} @llvm.usub.with.overflow.i64(i64 %a, i64 %b)
10654 The '``llvm.usub.with.overflow``' family of intrinsic functions perform
10655 an unsigned subtraction of the two arguments, and indicate whether an
10656 overflow occurred during the unsigned subtraction.
10661 The arguments (%a and %b) and the first element of the result structure
10662 may be of integer types of any bit width, but they must have the same
10663 bit width. The second element of the result structure must be of type
10664 ``i1``. ``%a`` and ``%b`` are the two values that will undergo unsigned
10670 The '``llvm.usub.with.overflow``' family of intrinsic functions perform
10671 an unsigned subtraction of the two arguments. They return a structure ---
10672 the first element of which is the subtraction, and the second element of
10673 which is a bit specifying if the unsigned subtraction resulted in an
10679 .. code-block:: llvm
10681 %res = call {i32, i1} @llvm.usub.with.overflow.i32(i32 %a, i32 %b)
10682 %sum = extractvalue {i32, i1} %res, 0
10683 %obit = extractvalue {i32, i1} %res, 1
10684 br i1 %obit, label %overflow, label %normal
10686 '``llvm.smul.with.overflow.*``' Intrinsics
10687 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
10692 This is an overloaded intrinsic. You can use ``llvm.smul.with.overflow``
10693 on any integer bit width.
10697 declare {i16, i1} @llvm.smul.with.overflow.i16(i16 %a, i16 %b)
10698 declare {i32, i1} @llvm.smul.with.overflow.i32(i32 %a, i32 %b)
10699 declare {i64, i1} @llvm.smul.with.overflow.i64(i64 %a, i64 %b)
10704 The '``llvm.smul.with.overflow``' family of intrinsic functions perform
10705 a signed multiplication of the two arguments, and indicate whether an
10706 overflow occurred during the signed multiplication.
10711 The arguments (%a and %b) and the first element of the result structure
10712 may be of integer types of any bit width, but they must have the same
10713 bit width. The second element of the result structure must be of type
10714 ``i1``. ``%a`` and ``%b`` are the two values that will undergo signed
10720 The '``llvm.smul.with.overflow``' family of intrinsic functions perform
10721 a signed multiplication of the two arguments. They return a structure ---
10722 the first element of which is the multiplication, and the second element
10723 of which is a bit specifying if the signed multiplication resulted in an
10729 .. code-block:: llvm
10731 %res = call {i32, i1} @llvm.smul.with.overflow.i32(i32 %a, i32 %b)
10732 %sum = extractvalue {i32, i1} %res, 0
10733 %obit = extractvalue {i32, i1} %res, 1
10734 br i1 %obit, label %overflow, label %normal
10736 '``llvm.umul.with.overflow.*``' Intrinsics
10737 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
10742 This is an overloaded intrinsic. You can use ``llvm.umul.with.overflow``
10743 on any integer bit width.
10747 declare {i16, i1} @llvm.umul.with.overflow.i16(i16 %a, i16 %b)
10748 declare {i32, i1} @llvm.umul.with.overflow.i32(i32 %a, i32 %b)
10749 declare {i64, i1} @llvm.umul.with.overflow.i64(i64 %a, i64 %b)
10754 The '``llvm.umul.with.overflow``' family of intrinsic functions perform
10755 a unsigned multiplication of the two arguments, and indicate whether an
10756 overflow occurred during the unsigned multiplication.
10761 The arguments (%a and %b) and the first element of the result structure
10762 may be of integer types of any bit width, but they must have the same
10763 bit width. The second element of the result structure must be of type
10764 ``i1``. ``%a`` and ``%b`` are the two values that will undergo unsigned
10770 The '``llvm.umul.with.overflow``' family of intrinsic functions perform
10771 an unsigned multiplication of the two arguments. They return a structure ---
10772 the first element of which is the multiplication, and the second
10773 element of which is a bit specifying if the unsigned multiplication
10774 resulted in an overflow.
10779 .. code-block:: llvm
10781 %res = call {i32, i1} @llvm.umul.with.overflow.i32(i32 %a, i32 %b)
10782 %sum = extractvalue {i32, i1} %res, 0
10783 %obit = extractvalue {i32, i1} %res, 1
10784 br i1 %obit, label %overflow, label %normal
10786 Specialised Arithmetic Intrinsics
10787 ---------------------------------
10789 '``llvm.canonicalize.*``' Intrinsic
10790 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
10797 declare float @llvm.canonicalize.f32(float %a)
10798 declare double @llvm.canonicalize.f64(double %b)
10803 The '``llvm.canonicalize.*``' intrinsic returns the platform specific canonical
10804 encoding of a floating point number. This canonicalization is useful for
10805 implementing certain numeric primitives such as frexp. The canonical encoding is
10806 defined by IEEE-754-2008 to be:
10810 2.1.8 canonical encoding: The preferred encoding of a floating-point
10811 representation in a format. Applied to declets, significands of finite
10812 numbers, infinities, and NaNs, especially in decimal formats.
10814 This operation can also be considered equivalent to the IEEE-754-2008
10815 conversion of a floating-point value to the same format. NaNs are handled
10816 according to section 6.2.
10818 Examples of non-canonical encodings:
10820 - x87 pseudo denormals, pseudo NaNs, pseudo Infinity, Unnormals. These are
10821 converted to a canonical representation per hardware-specific protocol.
10822 - Many normal decimal floating point numbers have non-canonical alternative
10824 - Some machines, like GPUs or ARMv7 NEON, do not support subnormal values.
10825 These are treated as non-canonical encodings of zero and with be flushed to
10826 a zero of the same sign by this operation.
10828 Note that per IEEE-754-2008 6.2, systems that support signaling NaNs with
10829 default exception handling must signal an invalid exception, and produce a
10832 This function should always be implementable as multiplication by 1.0, provided
10833 that the compiler does not constant fold the operation. Likewise, division by
10834 1.0 and ``llvm.minnum(x, x)`` are possible implementations. Addition with
10835 -0.0 is also sufficient provided that the rounding mode is not -Infinity.
10837 ``@llvm.canonicalize`` must preserve the equality relation. That is:
10839 - ``(@llvm.canonicalize(x) == x)`` is equivalent to ``(x == x)``
10840 - ``(@llvm.canonicalize(x) == @llvm.canonicalize(y))`` is equivalent to
10843 Additionally, the sign of zero must be conserved:
10844 ``@llvm.canonicalize(-0.0) = -0.0`` and ``@llvm.canonicalize(+0.0) = +0.0``
10846 The payload bits of a NaN must be conserved, with two exceptions.
10847 First, environments which use only a single canonical representation of NaN
10848 must perform said canonicalization. Second, SNaNs must be quieted per the
10851 The canonicalization operation may be optimized away if:
10853 - The input is known to be canonical. For example, it was produced by a
10854 floating-point operation that is required by the standard to be canonical.
10855 - The result is consumed only by (or fused with) other floating-point
10856 operations. That is, the bits of the floating point value are not examined.
10858 '``llvm.fmuladd.*``' Intrinsic
10859 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
10866 declare float @llvm.fmuladd.f32(float %a, float %b, float %c)
10867 declare double @llvm.fmuladd.f64(double %a, double %b, double %c)
10872 The '``llvm.fmuladd.*``' intrinsic functions represent multiply-add
10873 expressions that can be fused if the code generator determines that (a) the
10874 target instruction set has support for a fused operation, and (b) that the
10875 fused operation is more efficient than the equivalent, separate pair of mul
10876 and add instructions.
10881 The '``llvm.fmuladd.*``' intrinsics each take three arguments: two
10882 multiplicands, a and b, and an addend c.
10891 %0 = call float @llvm.fmuladd.f32(%a, %b, %c)
10893 is equivalent to the expression a \* b + c, except that rounding will
10894 not be performed between the multiplication and addition steps if the
10895 code generator fuses the operations. Fusion is not guaranteed, even if
10896 the target platform supports it. If a fused multiply-add is required the
10897 corresponding llvm.fma.\* intrinsic function should be used
10898 instead. This never sets errno, just as '``llvm.fma.*``'.
10903 .. code-block:: llvm
10905 %r2 = call float @llvm.fmuladd.f32(float %a, float %b, float %c) ; yields float:r2 = (a * b) + c
10908 '``llvm.uabsdiff.*``' and '``llvm.sabsdiff.*``' Intrinsics
10909 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
10913 This is an overloaded intrinsic. The loaded data is a vector of any integer bit width.
10915 .. code-block:: llvm
10917 declare <4 x integer> @llvm.uabsdiff.v4i32(<4 x integer> %a, <4 x integer> %b)
10923 The ``llvm.uabsdiff`` intrinsic returns a vector result of the absolute difference
10924 of the two operands, treating them both as unsigned integers. The intermediate
10925 calculations are computed using infinitely precise unsigned arithmetic. The final
10926 result will be truncated to the given type.
10928 The ``llvm.sabsdiff`` intrinsic returns a vector result of the absolute difference of
10929 the two operands, treating them both as signed integers. If the result overflows, the
10930 behavior is undefined.
10934 These intrinsics are primarily used during the code generation stage of compilation.
10935 They are generated by compiler passes such as the Loop and SLP vectorizers. It is not
10936 recommended for users to create them manually.
10941 Both intrinsics take two integer of the same bitwidth.
10948 call <4 x i32> @llvm.uabsdiff.v4i32(<4 x i32> %a, <4 x i32> %b)
10952 %1 = zext <4 x i32> %a to <4 x i64>
10953 %2 = zext <4 x i32> %b to <4 x i64>
10954 %sub = sub <4 x i64> %1, %2
10955 %trunc = trunc <4 x i64> to <4 x i32>
10957 and the expression::
10959 call <4 x i32> @llvm.sabsdiff.v4i32(<4 x i32> %a, <4 x i32> %b)
10963 %sub = sub nsw <4 x i32> %a, %b
10964 %ispos = icmp sge <4 x i32> %sub, zeroinitializer
10965 %neg = sub nsw <4 x i32> zeroinitializer, %sub
10966 %1 = select <4 x i1> %ispos, <4 x i32> %sub, <4 x i32> %neg
10969 Half Precision Floating Point Intrinsics
10970 ----------------------------------------
10972 For most target platforms, half precision floating point is a
10973 storage-only format. This means that it is a dense encoding (in memory)
10974 but does not support computation in the format.
10976 This means that code must first load the half-precision floating point
10977 value as an i16, then convert it to float with
10978 :ref:`llvm.convert.from.fp16 <int_convert_from_fp16>`. Computation can
10979 then be performed on the float value (including extending to double
10980 etc). To store the value back to memory, it is first converted to float
10981 if needed, then converted to i16 with
10982 :ref:`llvm.convert.to.fp16 <int_convert_to_fp16>`, then storing as an
10985 .. _int_convert_to_fp16:
10987 '``llvm.convert.to.fp16``' Intrinsic
10988 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
10995 declare i16 @llvm.convert.to.fp16.f32(float %a)
10996 declare i16 @llvm.convert.to.fp16.f64(double %a)
11001 The '``llvm.convert.to.fp16``' intrinsic function performs a conversion from a
11002 conventional floating point type to half precision floating point format.
11007 The intrinsic function contains single argument - the value to be
11013 The '``llvm.convert.to.fp16``' intrinsic function performs a conversion from a
11014 conventional floating point format to half precision floating point format. The
11015 return value is an ``i16`` which contains the converted number.
11020 .. code-block:: llvm
11022 %res = call i16 @llvm.convert.to.fp16.f32(float %a)
11023 store i16 %res, i16* @x, align 2
11025 .. _int_convert_from_fp16:
11027 '``llvm.convert.from.fp16``' Intrinsic
11028 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
11035 declare float @llvm.convert.from.fp16.f32(i16 %a)
11036 declare double @llvm.convert.from.fp16.f64(i16 %a)
11041 The '``llvm.convert.from.fp16``' intrinsic function performs a
11042 conversion from half precision floating point format to single precision
11043 floating point format.
11048 The intrinsic function contains single argument - the value to be
11054 The '``llvm.convert.from.fp16``' intrinsic function performs a
11055 conversion from half single precision floating point format to single
11056 precision floating point format. The input half-float value is
11057 represented by an ``i16`` value.
11062 .. code-block:: llvm
11064 %a = load i16, i16* @x, align 2
11065 %res = call float @llvm.convert.from.fp16(i16 %a)
11067 .. _dbg_intrinsics:
11069 Debugger Intrinsics
11070 -------------------
11072 The LLVM debugger intrinsics (which all start with ``llvm.dbg.``
11073 prefix), are described in the `LLVM Source Level
11074 Debugging <SourceLevelDebugging.html#format_common_intrinsics>`_
11077 Exception Handling Intrinsics
11078 -----------------------------
11080 The LLVM exception handling intrinsics (which all start with
11081 ``llvm.eh.`` prefix), are described in the `LLVM Exception
11082 Handling <ExceptionHandling.html#format_common_intrinsics>`_ document.
11084 .. _int_trampoline:
11086 Trampoline Intrinsics
11087 ---------------------
11089 These intrinsics make it possible to excise one parameter, marked with
11090 the :ref:`nest <nest>` attribute, from a function. The result is a
11091 callable function pointer lacking the nest parameter - the caller does
11092 not need to provide a value for it. Instead, the value to use is stored
11093 in advance in a "trampoline", a block of memory usually allocated on the
11094 stack, which also contains code to splice the nest value into the
11095 argument list. This is used to implement the GCC nested function address
11098 For example, if the function is ``i32 f(i8* nest %c, i32 %x, i32 %y)``
11099 then the resulting function pointer has signature ``i32 (i32, i32)*``.
11100 It can be created as follows:
11102 .. code-block:: llvm
11104 %tramp = alloca [10 x i8], align 4 ; size and alignment only correct for X86
11105 %tramp1 = getelementptr [10 x i8], [10 x i8]* %tramp, i32 0, i32 0
11106 call i8* @llvm.init.trampoline(i8* %tramp1, i8* bitcast (i32 (i8*, i32, i32)* @f to i8*), i8* %nval)
11107 %p = call i8* @llvm.adjust.trampoline(i8* %tramp1)
11108 %fp = bitcast i8* %p to i32 (i32, i32)*
11110 The call ``%val = call i32 %fp(i32 %x, i32 %y)`` is then equivalent to
11111 ``%val = call i32 %f(i8* %nval, i32 %x, i32 %y)``.
11115 '``llvm.init.trampoline``' Intrinsic
11116 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
11123 declare void @llvm.init.trampoline(i8* <tramp>, i8* <func>, i8* <nval>)
11128 This fills the memory pointed to by ``tramp`` with executable code,
11129 turning it into a trampoline.
11134 The ``llvm.init.trampoline`` intrinsic takes three arguments, all
11135 pointers. The ``tramp`` argument must point to a sufficiently large and
11136 sufficiently aligned block of memory; this memory is written to by the
11137 intrinsic. Note that the size and the alignment are target-specific -
11138 LLVM currently provides no portable way of determining them, so a
11139 front-end that generates this intrinsic needs to have some
11140 target-specific knowledge. The ``func`` argument must hold a function
11141 bitcast to an ``i8*``.
11146 The block of memory pointed to by ``tramp`` is filled with target
11147 dependent code, turning it into a function. Then ``tramp`` needs to be
11148 passed to :ref:`llvm.adjust.trampoline <int_at>` to get a pointer which can
11149 be :ref:`bitcast (to a new function) and called <int_trampoline>`. The new
11150 function's signature is the same as that of ``func`` with any arguments
11151 marked with the ``nest`` attribute removed. At most one such ``nest``
11152 argument is allowed, and it must be of pointer type. Calling the new
11153 function is equivalent to calling ``func`` with the same argument list,
11154 but with ``nval`` used for the missing ``nest`` argument. If, after
11155 calling ``llvm.init.trampoline``, the memory pointed to by ``tramp`` is
11156 modified, then the effect of any later call to the returned function
11157 pointer is undefined.
11161 '``llvm.adjust.trampoline``' Intrinsic
11162 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
11169 declare i8* @llvm.adjust.trampoline(i8* <tramp>)
11174 This performs any required machine-specific adjustment to the address of
11175 a trampoline (passed as ``tramp``).
11180 ``tramp`` must point to a block of memory which already has trampoline
11181 code filled in by a previous call to
11182 :ref:`llvm.init.trampoline <int_it>`.
11187 On some architectures the address of the code to be executed needs to be
11188 different than the address where the trampoline is actually stored. This
11189 intrinsic returns the executable address corresponding to ``tramp``
11190 after performing the required machine specific adjustments. The pointer
11191 returned can then be :ref:`bitcast and executed <int_trampoline>`.
11193 .. _int_mload_mstore:
11195 Masked Vector Load and Store Intrinsics
11196 ---------------------------------------
11198 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.
11202 '``llvm.masked.load.*``' Intrinsics
11203 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
11207 This is an overloaded intrinsic. The loaded data is a vector of any integer or floating point data type.
11211 declare <16 x float> @llvm.masked.load.v16f32 (<16 x float>* <ptr>, i32 <alignment>, <16 x i1> <mask>, <16 x float> <passthru>)
11212 declare <2 x double> @llvm.masked.load.v2f64 (<2 x double>* <ptr>, i32 <alignment>, <2 x i1> <mask>, <2 x double> <passthru>)
11217 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 of the '``passthru``' operand.
11223 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 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 the '``passthru``' operand are the same vector types.
11229 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.
11230 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.
11235 %res = call <16 x float> @llvm.masked.load.v16f32 (<16 x float>* %ptr, i32 4, <16 x i1>%mask, <16 x float> %passthru)
11237 ;; The result of the two following instructions is identical aside from potential memory access exception
11238 %loadlal = load <16 x float>, <16 x float>* %ptr, align 4
11239 %res = select <16 x i1> %mask, <16 x float> %loadlal, <16 x float> %passthru
11243 '``llvm.masked.store.*``' Intrinsics
11244 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
11248 This is an overloaded intrinsic. The data stored in memory is a vector of any integer or floating point data type.
11252 declare void @llvm.masked.store.v8i32 (<8 x i32> <value>, <8 x i32> * <ptr>, i32 <alignment>, <8 x i1> <mask>)
11253 declare void @llvm.masked.store.v16f32(<16 x i32> <value>, <16 x i32>* <ptr>, i32 <alignment>, <16 x i1> <mask>)
11258 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.
11263 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.
11269 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.
11270 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.
11274 call void @llvm.masked.store.v16f32(<16 x float> %value, <16 x float>* %ptr, i32 4, <16 x i1> %mask)
11276 ;; The result of the following instructions is identical aside from potential data races and memory access exceptions
11277 %oldval = load <16 x float>, <16 x float>* %ptr, align 4
11278 %res = select <16 x i1> %mask, <16 x float> %value, <16 x float> %oldval
11279 store <16 x float> %res, <16 x float>* %ptr, align 4
11282 Masked Vector Gather and Scatter Intrinsics
11283 -------------------------------------------
11285 LLVM provides intrinsics for vector gather and scatter operations. They are similar to :ref:`Masked Vector Load and Store <int_mload_mstore>`, except they are designed for arbitrary memory accesses, rather than sequential memory accesses. Gather and scatter also employ 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 are off, no memory is accessed.
11289 '``llvm.masked.gather.*``' Intrinsics
11290 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
11294 This is an overloaded intrinsic. The loaded data are multiple scalar values of any integer or floating point data type gathered together into one vector.
11298 declare <16 x float> @llvm.masked.gather.v16f32 (<16 x float*> <ptrs>, i32 <alignment>, <16 x i1> <mask>, <16 x float> <passthru>)
11299 declare <2 x double> @llvm.masked.gather.v2f64 (<2 x double*> <ptrs>, i32 <alignment>, <2 x i1> <mask>, <2 x double> <passthru>)
11304 Reads scalar values from arbitrary memory locations and gathers them into one vector. The memory locations are provided in the vector of pointers '``ptrs``'. The memory is accessed 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 of the '``passthru``' operand.
11310 The first operand is a vector of pointers which holds all memory addresses to read. The second operand is an alignment of the source addresses. It must be a constant integer value. The third operand, mask, is a vector of boolean 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 vector of pointers and the type of the '``passthru``' operand are the same vector types.
11316 The '``llvm.masked.gather``' intrinsic is designed for conditional reading of multiple scalar values from arbitrary memory locations in a single IR operation. It is useful for targets that support vector masked gathers and allows vectorizing basic blocks with data and control divergence. Other targets may support this intrinsic differently, for example by lowering it into a sequence of scalar load operations.
11317 The semantics of this operation are equivalent to a sequence of conditional scalar loads with subsequent gathering all loaded values into a single vector. The mask restricts memory access to certain lanes and facilitates vectorization of predicated basic blocks.
11322 %res = call <4 x double> @llvm.masked.gather.v4f64 (<4 x double*> %ptrs, i32 8, <4 x i1>%mask, <4 x double> <true, true, true, true>)
11324 ;; The gather with all-true mask is equivalent to the following instruction sequence
11325 %ptr0 = extractelement <4 x double*> %ptrs, i32 0
11326 %ptr1 = extractelement <4 x double*> %ptrs, i32 1
11327 %ptr2 = extractelement <4 x double*> %ptrs, i32 2
11328 %ptr3 = extractelement <4 x double*> %ptrs, i32 3
11330 %val0 = load double, double* %ptr0, align 8
11331 %val1 = load double, double* %ptr1, align 8
11332 %val2 = load double, double* %ptr2, align 8
11333 %val3 = load double, double* %ptr3, align 8
11335 %vec0 = insertelement <4 x double>undef, %val0, 0
11336 %vec01 = insertelement <4 x double>%vec0, %val1, 1
11337 %vec012 = insertelement <4 x double>%vec01, %val2, 2
11338 %vec0123 = insertelement <4 x double>%vec012, %val3, 3
11342 '``llvm.masked.scatter.*``' Intrinsics
11343 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
11347 This is an overloaded intrinsic. The data stored in memory is a vector of any integer or floating point data type. Each vector element is stored in an arbitrary memory addresses. Scatter with overlapping addresses is guaranteed to be ordered from least-significant to most-significant element.
11351 declare void @llvm.masked.scatter.v8i32 (<8 x i32> <value>, <8 x i32*> <ptrs>, i32 <alignment>, <8 x i1> <mask>)
11352 declare void @llvm.masked.scatter.v16f32(<16 x i32> <value>, <16 x i32*> <ptrs>, i32 <alignment>, <16 x i1> <mask>)
11357 Writes each element from the value vector to the corresponding memory address. The memory addresses are represented as a vector of pointers. Writing is done 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.
11362 The first operand is a vector value to be written to memory. The second operand is a vector of pointers, pointing to where the value elements should be stored. It has the same underlying type as the value operand. The third operand is an alignment of the destination addresses. 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.
11368 The '``llvm.masked.scatter``' intrinsics is designed for writing selected vector elements to arbitrary memory addresses in a single IR operation. The operation may be conditional, when not all bits in the mask are switched on. It is useful for targets that support vector masked scatter and allows vectorizing basic blocks with data and control divergence. Other targets may support this intrinsic differently, for example by lowering it into a sequence of branches that guard scalar store operations.
11372 ;; This instruction unconditionaly stores data vector in multiple addresses
11373 call @llvm.masked.scatter.v8i32 (<8 x i32> %value, <8 x i32*> %ptrs, i32 4, <8 x i1> <true, true, .. true>)
11375 ;; It is equivalent to a list of scalar stores
11376 %val0 = extractelement <8 x i32> %value, i32 0
11377 %val1 = extractelement <8 x i32> %value, i32 1
11379 %val7 = extractelement <8 x i32> %value, i32 7
11380 %ptr0 = extractelement <8 x i32*> %ptrs, i32 0
11381 %ptr1 = extractelement <8 x i32*> %ptrs, i32 1
11383 %ptr7 = extractelement <8 x i32*> %ptrs, i32 7
11384 ;; Note: the order of the following stores is important when they overlap:
11385 store i32 %val0, i32* %ptr0, align 4
11386 store i32 %val1, i32* %ptr1, align 4
11388 store i32 %val7, i32* %ptr7, align 4
11394 This class of intrinsics provides information about the lifetime of
11395 memory objects and ranges where variables are immutable.
11399 '``llvm.lifetime.start``' Intrinsic
11400 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
11407 declare void @llvm.lifetime.start(i64 <size>, i8* nocapture <ptr>)
11412 The '``llvm.lifetime.start``' intrinsic specifies the start of a memory
11418 The first argument is a constant integer representing the size of the
11419 object, or -1 if it is variable sized. The second argument is a pointer
11425 This intrinsic indicates that before this point in the code, the value
11426 of the memory pointed to by ``ptr`` is dead. This means that it is known
11427 to never be used and has an undefined value. A load from the pointer
11428 that precedes this intrinsic can be replaced with ``'undef'``.
11432 '``llvm.lifetime.end``' Intrinsic
11433 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
11440 declare void @llvm.lifetime.end(i64 <size>, i8* nocapture <ptr>)
11445 The '``llvm.lifetime.end``' intrinsic specifies the end of a memory
11451 The first argument is a constant integer representing the size of the
11452 object, or -1 if it is variable sized. The second argument is a pointer
11458 This intrinsic indicates that after this point in the code, the value of
11459 the memory pointed to by ``ptr`` is dead. This means that it is known to
11460 never be used and has an undefined value. Any stores into the memory
11461 object following this intrinsic may be removed as dead.
11463 '``llvm.invariant.start``' Intrinsic
11464 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
11471 declare {}* @llvm.invariant.start(i64 <size>, i8* nocapture <ptr>)
11476 The '``llvm.invariant.start``' intrinsic specifies that the contents of
11477 a memory object will not change.
11482 The first argument is a constant integer representing the size of the
11483 object, or -1 if it is variable sized. The second argument is a pointer
11489 This intrinsic indicates that until an ``llvm.invariant.end`` that uses
11490 the return value, the referenced memory location is constant and
11493 '``llvm.invariant.end``' Intrinsic
11494 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
11501 declare void @llvm.invariant.end({}* <start>, i64 <size>, i8* nocapture <ptr>)
11506 The '``llvm.invariant.end``' intrinsic specifies that the contents of a
11507 memory object are mutable.
11512 The first argument is the matching ``llvm.invariant.start`` intrinsic.
11513 The second argument is a constant integer representing the size of the
11514 object, or -1 if it is variable sized and the third argument is a
11515 pointer to the object.
11520 This intrinsic indicates that the memory is mutable again.
11522 '``llvm.invariant.group.barrier``' Intrinsic
11523 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
11530 declare i8* @llvm.invariant.group.barrier(i8* <ptr>)
11535 The '``llvm.invariant.group.barrier``' intrinsic can be used when an invariant
11536 established by invariant.group metadata no longer holds, to obtain a new pointer
11537 value that does not carry the invariant information.
11543 The ``llvm.invariant.group.barrier`` takes only one argument, which is
11544 the pointer to the memory for which the ``invariant.group`` no longer holds.
11549 Returns another pointer that aliases its argument but which is considered different
11550 for the purposes of ``load``/``store`` ``invariant.group`` metadata.
11555 This class of intrinsics is designed to be generic and has no specific
11558 '``llvm.var.annotation``' Intrinsic
11559 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
11566 declare void @llvm.var.annotation(i8* <val>, i8* <str>, i8* <str>, i32 <int>)
11571 The '``llvm.var.annotation``' intrinsic.
11576 The first argument is a pointer to a value, the second is a pointer to a
11577 global string, the third is a pointer to a global string which is the
11578 source file name, and the last argument is the line number.
11583 This intrinsic allows annotation of local variables with arbitrary
11584 strings. This can be useful for special purpose optimizations that want
11585 to look for these annotations. These have no other defined use; they are
11586 ignored by code generation and optimization.
11588 '``llvm.ptr.annotation.*``' Intrinsic
11589 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
11594 This is an overloaded intrinsic. You can use '``llvm.ptr.annotation``' on a
11595 pointer to an integer of any width. *NOTE* you must specify an address space for
11596 the pointer. The identifier for the default address space is the integer
11601 declare i8* @llvm.ptr.annotation.p<address space>i8(i8* <val>, i8* <str>, i8* <str>, i32 <int>)
11602 declare i16* @llvm.ptr.annotation.p<address space>i16(i16* <val>, i8* <str>, i8* <str>, i32 <int>)
11603 declare i32* @llvm.ptr.annotation.p<address space>i32(i32* <val>, i8* <str>, i8* <str>, i32 <int>)
11604 declare i64* @llvm.ptr.annotation.p<address space>i64(i64* <val>, i8* <str>, i8* <str>, i32 <int>)
11605 declare i256* @llvm.ptr.annotation.p<address space>i256(i256* <val>, i8* <str>, i8* <str>, i32 <int>)
11610 The '``llvm.ptr.annotation``' intrinsic.
11615 The first argument is a pointer to an integer value of arbitrary bitwidth
11616 (result of some expression), the second is a pointer to a global string, the
11617 third is a pointer to a global string which is the source file name, and the
11618 last argument is the line number. It returns the value of the first argument.
11623 This intrinsic allows annotation of a pointer to an integer with arbitrary
11624 strings. This can be useful for special purpose optimizations that want to look
11625 for these annotations. These have no other defined use; they are ignored by code
11626 generation and optimization.
11628 '``llvm.annotation.*``' Intrinsic
11629 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
11634 This is an overloaded intrinsic. You can use '``llvm.annotation``' on
11635 any integer bit width.
11639 declare i8 @llvm.annotation.i8(i8 <val>, i8* <str>, i8* <str>, i32 <int>)
11640 declare i16 @llvm.annotation.i16(i16 <val>, i8* <str>, i8* <str>, i32 <int>)
11641 declare i32 @llvm.annotation.i32(i32 <val>, i8* <str>, i8* <str>, i32 <int>)
11642 declare i64 @llvm.annotation.i64(i64 <val>, i8* <str>, i8* <str>, i32 <int>)
11643 declare i256 @llvm.annotation.i256(i256 <val>, i8* <str>, i8* <str>, i32 <int>)
11648 The '``llvm.annotation``' intrinsic.
11653 The first argument is an integer value (result of some expression), the
11654 second is a pointer to a global string, the third is a pointer to a
11655 global string which is the source file name, and the last argument is
11656 the line number. It returns the value of the first argument.
11661 This intrinsic allows annotations to be put on arbitrary expressions
11662 with arbitrary strings. This can be useful for special purpose
11663 optimizations that want to look for these annotations. These have no
11664 other defined use; they are ignored by code generation and optimization.
11666 '``llvm.trap``' Intrinsic
11667 ^^^^^^^^^^^^^^^^^^^^^^^^^
11674 declare void @llvm.trap() noreturn nounwind
11679 The '``llvm.trap``' intrinsic.
11689 This intrinsic is lowered to the target dependent trap instruction. If
11690 the target does not have a trap instruction, this intrinsic will be
11691 lowered to a call of the ``abort()`` function.
11693 '``llvm.debugtrap``' Intrinsic
11694 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
11701 declare void @llvm.debugtrap() nounwind
11706 The '``llvm.debugtrap``' intrinsic.
11716 This intrinsic is lowered to code which is intended to cause an
11717 execution trap with the intention of requesting the attention of a
11720 '``llvm.stackprotector``' Intrinsic
11721 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
11728 declare void @llvm.stackprotector(i8* <guard>, i8** <slot>)
11733 The ``llvm.stackprotector`` intrinsic takes the ``guard`` and stores it
11734 onto the stack at ``slot``. The stack slot is adjusted to ensure that it
11735 is placed on the stack before local variables.
11740 The ``llvm.stackprotector`` intrinsic requires two pointer arguments.
11741 The first argument is the value loaded from the stack guard
11742 ``@__stack_chk_guard``. The second variable is an ``alloca`` that has
11743 enough space to hold the value of the guard.
11748 This intrinsic causes the prologue/epilogue inserter to force the position of
11749 the ``AllocaInst`` stack slot to be before local variables on the stack. This is
11750 to ensure that if a local variable on the stack is overwritten, it will destroy
11751 the value of the guard. When the function exits, the guard on the stack is
11752 checked against the original guard by ``llvm.stackprotectorcheck``. If they are
11753 different, then ``llvm.stackprotectorcheck`` causes the program to abort by
11754 calling the ``__stack_chk_fail()`` function.
11756 '``llvm.stackprotectorcheck``' Intrinsic
11757 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
11764 declare void @llvm.stackprotectorcheck(i8** <guard>)
11769 The ``llvm.stackprotectorcheck`` intrinsic compares ``guard`` against an already
11770 created stack protector and if they are not equal calls the
11771 ``__stack_chk_fail()`` function.
11776 The ``llvm.stackprotectorcheck`` intrinsic requires one pointer argument, the
11777 the variable ``@__stack_chk_guard``.
11782 This intrinsic is provided to perform the stack protector check by comparing
11783 ``guard`` with the stack slot created by ``llvm.stackprotector`` and if the
11784 values do not match call the ``__stack_chk_fail()`` function.
11786 The reason to provide this as an IR level intrinsic instead of implementing it
11787 via other IR operations is that in order to perform this operation at the IR
11788 level without an intrinsic, one would need to create additional basic blocks to
11789 handle the success/failure cases. This makes it difficult to stop the stack
11790 protector check from disrupting sibling tail calls in Codegen. With this
11791 intrinsic, we are able to generate the stack protector basic blocks late in
11792 codegen after the tail call decision has occurred.
11794 '``llvm.objectsize``' Intrinsic
11795 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
11802 declare i32 @llvm.objectsize.i32(i8* <object>, i1 <min>)
11803 declare i64 @llvm.objectsize.i64(i8* <object>, i1 <min>)
11808 The ``llvm.objectsize`` intrinsic is designed to provide information to
11809 the optimizers to determine at compile time whether a) an operation
11810 (like memcpy) will overflow a buffer that corresponds to an object, or
11811 b) that a runtime check for overflow isn't necessary. An object in this
11812 context means an allocation of a specific class, structure, array, or
11818 The ``llvm.objectsize`` intrinsic takes two arguments. The first
11819 argument is a pointer to or into the ``object``. The second argument is
11820 a boolean and determines whether ``llvm.objectsize`` returns 0 (if true)
11821 or -1 (if false) when the object size is unknown. The second argument
11822 only accepts constants.
11827 The ``llvm.objectsize`` intrinsic is lowered to a constant representing
11828 the size of the object concerned. If the size cannot be determined at
11829 compile time, ``llvm.objectsize`` returns ``i32/i64 -1 or 0`` (depending
11830 on the ``min`` argument).
11832 '``llvm.expect``' Intrinsic
11833 ^^^^^^^^^^^^^^^^^^^^^^^^^^^
11838 This is an overloaded intrinsic. You can use ``llvm.expect`` on any
11843 declare i1 @llvm.expect.i1(i1 <val>, i1 <expected_val>)
11844 declare i32 @llvm.expect.i32(i32 <val>, i32 <expected_val>)
11845 declare i64 @llvm.expect.i64(i64 <val>, i64 <expected_val>)
11850 The ``llvm.expect`` intrinsic provides information about expected (the
11851 most probable) value of ``val``, which can be used by optimizers.
11856 The ``llvm.expect`` intrinsic takes two arguments. The first argument is
11857 a value. The second argument is an expected value, this needs to be a
11858 constant value, variables are not allowed.
11863 This intrinsic is lowered to the ``val``.
11867 '``llvm.assume``' Intrinsic
11868 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
11875 declare void @llvm.assume(i1 %cond)
11880 The ``llvm.assume`` allows the optimizer to assume that the provided
11881 condition is true. This information can then be used in simplifying other parts
11887 The condition which the optimizer may assume is always true.
11892 The intrinsic allows the optimizer to assume that the provided condition is
11893 always true whenever the control flow reaches the intrinsic call. No code is
11894 generated for this intrinsic, and instructions that contribute only to the
11895 provided condition are not used for code generation. If the condition is
11896 violated during execution, the behavior is undefined.
11898 Note that the optimizer might limit the transformations performed on values
11899 used by the ``llvm.assume`` intrinsic in order to preserve the instructions
11900 only used to form the intrinsic's input argument. This might prove undesirable
11901 if the extra information provided by the ``llvm.assume`` intrinsic does not cause
11902 sufficient overall improvement in code quality. For this reason,
11903 ``llvm.assume`` should not be used to document basic mathematical invariants
11904 that the optimizer can otherwise deduce or facts that are of little use to the
11909 '``llvm.bitset.test``' Intrinsic
11910 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
11917 declare i1 @llvm.bitset.test(i8* %ptr, metadata %bitset) nounwind readnone
11923 The first argument is a pointer to be tested. The second argument is a
11924 metadata object representing an identifier for a :doc:`bitset <BitSets>`.
11929 The ``llvm.bitset.test`` intrinsic tests whether the given pointer is a
11930 member of the given bitset.
11932 '``llvm.donothing``' Intrinsic
11933 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
11940 declare void @llvm.donothing() nounwind readnone
11945 The ``llvm.donothing`` intrinsic doesn't perform any operation. It's one of only
11946 two intrinsics (besides ``llvm.experimental.patchpoint``) that can be called
11947 with an invoke instruction.
11957 This intrinsic does nothing, and it's removed by optimizers and ignored
11960 Stack Map Intrinsics
11961 --------------------
11963 LLVM provides experimental intrinsics to support runtime patching
11964 mechanisms commonly desired in dynamic language JITs. These intrinsics
11965 are described in :doc:`StackMaps`.