Assign an expression to an variable: * dest: Variable to assign to * source: Source expression

Memory fence operation

Always branch to the target label

Branch to label targetTrue if cond is true otherwise to label targetFalse * cond: condition that will be tested, must be of type i1 * targetTrue: label to branch to if cond is true * targetFalse: label to branch to if cond is false

Comment Plain comment.

Set a label on this position. * name: Identifier of this label, unique for this module

Store variable value in pointer ptr. If value is of type t then ptr must be of type t*. * value: Variable/Constant to store. * ptr: Location to store the value in

Mutliway branch * scrutinee: Variable or constant which must be of integer type that is determines which arm is chosen. * def: The default label if there is no match in target. * target: A list of (value,label) where the value is an integer constant and label the corresponding label to jump to if the scrutinee matches the value.

Return a result. * result: The variable or constant to return

An instruction for the optimizer that the code following is not reachable

Raise an expression to a statement (if don't want result or want to use Llvm unnamed values.

A nop LLVM statement. Useful as its often more efficient to use this then to wrap LLvmStatement in a Just or [].

A LLVM statement with metadata attached to it.

Allocate amount * sizeof(tp) bytes on the stack * tp: LlvmType to reserve room for * amount: The nr of tp's which must be allocated

Perform the machine operator op on the operands left and right * op: operator * left: left operand * right: right operand

Perform a compare operation on the operands left and right * op: operator * left: left operand * right: right operand

Extract a scalar element from a vector * val: The vector * idx: The index of the scalar within the vector

Extract a scalar element from a structure * val: The structure * idx: The index of the scalar within the structure Corresponds to "extractvalue" instruction.

Insert a scalar element into a vector * val: The source vector * elt: The scalar to insert * index: The index at which to insert the scalar

Allocate amount * sizeof(tp) bytes on the heap * tp: LlvmType to reserve room for * amount: The nr of tp's which must be allocated

Load the value at location ptr

Atomic load of the value at location ptr

Navigate in an structure, selecting elements * inbound: Is the pointer inbounds? (computed pointer doesn't overflow) * ptr: Location of the structure * indexes: A list of indexes to select the correct value.

Cast the variable from to the to type. This is an abstraction of three cast operators in Llvm, inttoptr, prttoint and bitcast. * cast: Cast type * from: Variable to cast * to: type to cast to

Atomic read-modify-write operation * op: Atomic operation * addr: Address to modify * operand: Operand to operation * ordering: Ordering requirement

Compare-and-exchange operation * addr: Address to modify * old: Expected value * new: New value * suc_ord: Ordering required in success case * fail_ord: Ordering required in failure case, can be no stronger than suc_ord

Result is an i1, true if store was successful.

Call a function. The result is the value of the expression. * tailJumps: CallType to signal if the function should be tail called * fnptrval: An LLVM value containing a pointer to a function to be invoked. Can be indirect. Should be LMFunction type. * args: Concrete arguments for the parameters * attrs: A list of function attributes for the call. Only NoReturn, NoUnwind, ReadOnly and ReadNone are valid here.

Call a function as above but potentially taking metadata as arguments. * tailJumps: CallType to signal if the function should be tail called * fnptrval: An LLVM value containing a pointer to a function to be invoked. Can be indirect. Should be LMFunction type. * args: Arguments that may include metadata. * attrs: A list of function attributes for the call. Only NoReturn, NoUnwind, ReadOnly and ReadNone are valid here.

Merge variables from different basic blocks which are predecessors of this basic block in a new variable of type tp. * tp: type of the merged variable, must match the types of the predecessor variables. * precessors: A list of variables and the basic block that they originate from.

Inline assembly expression. Syntax is very similar to the style used by GCC. * assembly: Actual inline assembly code. * constraints: Operand constraints. * return ty: Return type of function. * vars: Any variables involved in the assembly code. * sideeffect: Does the expression have side effects not visible from the constraints list. * alignstack: Should the stack be conservatively aligned before this expression is executed.

A LLVM expression with metadata attached to it.

This indicates to the code generator that the parameter or return value should be zero-extended to a 32-bit value by the caller (for a parameter) or the callee (for a return value).

This indicates to the code generator that the parameter or return value should be sign-extended to a 32-bit value by the caller (for a parameter) or the callee (for a return value).

This indicates that this parameter or return value should be treated in a special target-dependent fashion during while emitting code for a function call or return (usually, by putting it in a register as opposed to memory).

This indicates that the pointer parameter should really be passed by value to the function.

This indicates that the pointer parameter specifies the address of a structure that is the return value of the function in the source program.

This indicates that the pointer does not alias any global or any other parameter.

This indicates that the callee does not make any copies of the pointer that outlive the callee itself

This indicates that the pointer parameter can be excised using the trampoline intrinsics.

Some partial order of operations exists.

A single total order for operations at a single address exists.

Acquire synchronization operation.

Release synchronization operation.

Acquire + Release synchronization operation.

Full sequential Consistency operation.

The C calling convention. This calling convention (the default if no other calling convention is specified) matches the target C calling conventions. This calling convention supports varargs function calls and tolerates some mismatch in the declared prototype and implemented declaration of the function (as does normal C).

This calling convention attempts to make calls as fast as possible (e.g. by passing things in registers). This calling convention allows the target to use whatever tricks it wants to produce fast code for the target, without having to conform to an externally specified ABI (Application Binary Interface). Implementations of this convention should allow arbitrary tail call optimization to be supported. This calling convention does not support varargs and requires the prototype of al callees to exactly match the prototype of the function definition.

This calling convention attempts to make code in the caller as efficient as possible under the assumption that the call is not commonly executed. As such, these calls often preserve all registers so that the call does not break any live ranges in the caller side. This calling convention does not support varargs and requires the prototype of all callees to exactly match the prototype of the function definition.

The GHC-specific registerised calling convention.

Any calling convention may be specified by number, allowing target-specific calling conventions to be used. Target specific calling conventions start at 64.

X86 Specific StdCall convention. LLVM includes a specific alias for it rather than just using CC_Ncc.

Normal call, allocate a new stack frame.

Tail call, perform the call in the current stack frame.

Global values with internal linkage are only directly accessible by objects in the current module. In particular, linking code into a module with an internal global value may cause the internal to be renamed as necessary to avoid collisions. Because the symbol is internal to the module, all references can be updated. This corresponds to the notion of the static keyword in C.

Globals with linkonce linkage are merged with other globals of the same name when linkage occurs. This is typically used to implement inline functions, templates, or other code which must be generated in each translation unit that uses it. Unreferenced linkonce globals are allowed to be discarded.

weak linkage is exactly the same as linkonce linkage, except that unreferenced weak globals may not be discarded. This is used for globals that may be emitted in multiple translation units, but that are not guaranteed to be emitted into every translation unit that uses them. One example of this are common globals in C, such as int X; at global scope.

appending linkage may only be applied to global variables of pointer to array type. When two global variables with appending linkage are linked together, the two global arrays are appended together. This is the Llvm, typesafe, equivalent of having the system linker append together sections with identical names when .o files are linked.

The semantics of this linkage follow the ELF model: the symbol is weak until linked, if not linked, the symbol becomes null instead of being an undefined reference.

The symbol participates in linkage and can be used to resolve external symbol references.

Alias for ExternallyVisible but with explicit textual form in LLVM assembly.

Symbol is private to the module and should not appear in the symbol table

This attribute indicates that the inliner should attempt to inline this function into callers whenever possible, ignoring any active inlining size threshold for this caller.

This attribute indicates that the source code contained a hint that inlining this function is desirable (such as the "inline" keyword in C/C++). It is just a hint; it imposes no requirements on the inliner.

This attribute indicates that the inliner should never inline this function in any situation. This attribute may not be used together with the alwaysinline attribute.

This attribute suggests that optimization passes and code generator passes make choices that keep the code size of this function low, and otherwise do optimizations specifically to reduce code size.

This function attribute indicates that the function never returns normally. This produces undefined behavior at runtime if the function ever does dynamically return.

This function attribute indicates that the function never returns with an unwind or exceptional control flow. If the function does unwind, its runtime behavior is undefined.

This attribute indicates that the function computes its result (or decides to unwind an exception) based strictly on its arguments, without dereferencing any pointer arguments or otherwise accessing any mutable state (e.g. memory, control registers, etc) visible to caller functions. It does not write through any pointer arguments (including byval arguments) and never changes any state visible to callers. This means that it cannot unwind exceptions by calling the C++ exception throwing methods, but could use the unwind instruction.

This attribute indicates that the function does not write through any pointer arguments (including byval arguments) or otherwise modify any state (e.g. memory, control registers, etc) visible to caller functions. It may dereference pointer arguments and read state that may be set in the caller. A readonly function always returns the same value (or unwinds an exception identically) when called with the same set of arguments and global state. It cannot unwind an exception by calling the C++ exception throwing methods, but may use the unwind instruction.

This attribute indicates that the function should emit a stack smashing protector. It is in the form of a "canary"—a random value placed on the stack before the local variables that's checked upon return from the function to see if it has been overwritten. A heuristic is used to determine if a function needs stack protectors or not.

If a function that has an ssp attribute is inlined into a function that doesn't have an ssp attribute, then the resulting function will have an ssp attribute.

This attribute indicates that the function should always emit a stack smashing protector. This overrides the ssp function attribute.

If a function that has an sspreq attribute is inlined into a function that doesn't have an sspreq attribute or which has an ssp attribute, then the resulting function will have an sspreq attribute.

This attribute indicates that the code generator should not use a red zone, even if the target-specific ABI normally permits it.

This attributes disables implicit floating point instructions.

This attribute disables prologue / epilogue emission for the function. This can have very system-specific consequences.

Equal (Signed and Unsigned)

Not equal (Signed and Unsigned)

Unsigned greater than

Unsigned greater than or equal

Unsigned less than

Unsigned less than or equal

Signed greater than

Signed greater than or equal

Signed less than

Signed less than or equal

Float equal

Float not equal

Float greater than

Float greater than or equal

Float less than

Float less than or equal

add two integer, floating point or vector values.

subtract two ...

multiply ..

unsigned integer or vector division.

signed integer ..

unsigned integer or vector remainder (mod)

signed ...

add two floating point or vector values.

subtract two ...

multiply ...

divide ...

remainder ...

Left shift

Logical shift right Shift right, filling with zero

Arithmetic shift right The most significant bits of the result will be equal to the sign bit of the left operand.

AND bitwise logical operation.

OR bitwise logical operation.

XOR bitwise logical operation.

Integer truncate

Integer extend (zero fill)

Integer extend (sign fill)

Float truncate

Float extend

Float to unsigned Integer

Float to signed Integer

Unsigned Integer to Float

Signed Int to Float

Pointer to Integer

Integer to Pointer

Cast between types where no bit manipulation is needed

Variables with a global scope.

Variables local to a function or parameters.

Named local variables. Sometimes we need to be able to explicitly name variables (e.g for function arguments).

A constant variable

A comment in a static section

A static variant of a literal value

For uninitialised data

Defines a static LMString

A static array

A static structure type

A pointer to other data

Pointer to Pointer conversion

Pointer to Integer conversion

Constant addition operation

Constant subtraction operation

Refers to an integer constant (i64 42).

Floating point literal

Literal NULL, only applicable to pointer types

Vector literal

Undefined value, random bit pattern. Useful for optimisations.

An integer with a given width in bits.

32 bit floating point

64 bit floating point

80 bit (x86 only) floating point

128 bit floating point

A pointer to a LlvmType

An array of LlvmType

A vector of LlvmType

A LlvmVar can represent a label (address)

Void type

Packed structure type

Unpacked structure type

A type alias

LLVM Metadata

Function type, used to create pointers to functions

Mutable global variable

Constant global variable

Alias of another variable

Named metadata. Only used for communicating module information to LLVM. ('!name = !{ [!n] }' form).

Metadata node declaration. ('!0 = metadata !{ expression }' form).