From 85b9191ee48761857ae4c97d52b38648c4ea3f32 Mon Sep 17 00:00:00 2001 From: John Criswell Date: Thu, 9 Dec 2004 04:26:53 +0000 Subject: Nobody expects the Spanish Inquisition! Fixed the number of terminator instructions from five to six. Other minor fixes. llvm-svn: 18683 --- llvm/docs/LangRef.html | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) diff --git a/llvm/docs/LangRef.html b/llvm/docs/LangRef.html index 41379db..f1f4c1b 100644 --- a/llvm/docs/LangRef.html +++ b/llvm/docs/LangRef.html @@ -724,7 +724,7 @@ indicates which block should be executed after the current block is finished. These terminator instructions typically yield a 'void' value: they produce control flow, not values (the one exception being the 'invoke' instruction).

-

There are five different terminator instructions: the 'There are six different terminator instructions: the 'ret' instruction, the 'br' instruction, the 'switch' instruction, the 'invoke' instruction, the '

Binary operators are used to do most of the computation in a program. They require two operands, execute an operation on them, and -produce a single value. Although, that single value might represent +produce a single value. The operands might represent multiple data, as is the case with the packed data type. The result value of a binary operator is not necessarily the same type as its operands.

@@ -1135,7 +1135,7 @@ Operations

Bitwise binary operators are used to do various forms of bit-twiddling in a program. They are generally very efficient -instructions, and can commonly be strength reduced from other +instructions and can commonly be strength reduced from other instructions. They require two operands, execute an operation on them, and produce a single value. The resulting value of the bitwise binary operators is always the same type as its first operand.

@@ -1360,7 +1360,7 @@ Operations

A key design point of an SSA-based representation is how it represents memory. In LLVM, no memory locations are in SSA form, which makes things very simple. This section describes how to read, write, -allocate and free memory in LLVM.

+allocate, and free memory in LLVM.

'malloc' @@ -1408,7 +1408,7 @@ memory heap, to be reallocated in the future.

that was allocated with the 'malloc' instruction.

Semantics:
-

Access to the memory pointed to by the pointer is not longer defined +

Access to the memory pointed to by the pointer is no longer defined after this instruction executes.

Example:
  %array  = malloc [4 x ubyte]                    ; yields {[4 x ubyte]*}:array
@@ -1428,7 +1428,7 @@ Instruction
stack frame of the procedure that is live until the current function returns to its caller.

Arguments:
-

The the 'alloca' instruction allocates sizeof(<type>)*NumElements +

The 'alloca' instruction allocates sizeof(<type>)*NumElements bytes of memory on the runtime stack, returning a pointer of the appropriate type to the program. The second form of the instruction is a shorter version of the first that defaults to allocating one element.

-- cgit v1.1