diff --git a/docs/LangRef.html b/docs/LangRef.html index 1504a807625..be92ecc5d16 100644 --- a/docs/LangRef.html +++ b/docs/LangRef.html @@ -115,7 +115,7 @@
  • 'getelementptr' Instruction
  • -
  • Cast Operations +
  • Conversion Operations
    1. 'trunc .. to' Instruction
    2. 'zext .. to' Instruction
    3. @@ -2763,36 +2763,12 @@ FAQ.

      - -
      -

      The instructions in this category are the "miscellaneous" -instructions, which defy better classification.

      + - -
      -
      Syntax:
      -
        <result> = phi <ty> [ <val0>, <label0>], ...
      -
      Overview:
      -

      The 'phi' instruction is used to implement the φ node in -the SSA graph representing the function.

      -
      Arguments:
      -

      The type of the incoming values are specified with the first type -field. After this, the 'phi' instruction takes a list of pairs -as arguments, with one pair for each predecessor basic block of the -current block. Only values of first class -type may be used as the value arguments to the PHI node. Only labels -may be used as the label arguments.

      -

      There must be no non-phi instructions between the start of a basic -block and the PHI instructions: i.e. PHI instructions must be first in -a basic block.

      -
      Semantics:
      -

      At runtime, the 'phi' instruction logically takes on the -value specified by the parameter, depending on which basic block we -came from in the last terminator instruction.

      -
      Example:
      -
      Loop:       ; Infinite loop that counts from 0 on up...
      %indvar = phi uint [ 0, %LoopHeader ], [ %nextindvar, %Loop ]
      %nextindvar = add uint %indvar, 1
      br label %Loop
      +

      The instructions in this category are the conversion instructions (casting) +which all take a single operand and a type. They perform various bit conversions +on the operand.

      @@ -3169,6 +3145,39 @@ the zext, sext, and fpext instructions do not permit.

      + + +
      +

      The instructions in this category are the "miscellaneous" +instructions, which defy better classification.

      +
      + + +
      +
      Syntax:
      +
        <result> = phi <ty> [ <val0>, <label0>], ...
      +
      Overview:
      +

      The 'phi' instruction is used to implement the φ node in +the SSA graph representing the function.

      +
      Arguments:
      +

      The type of the incoming values are specified with the first type +field. After this, the 'phi' instruction takes a list of pairs +as arguments, with one pair for each predecessor basic block of the +current block. Only values of first class +type may be used as the value arguments to the PHI node. Only labels +may be used as the label arguments.

      +

      There must be no non-phi instructions between the start of a basic +block and the PHI instructions: i.e. PHI instructions must be first in +a basic block.

      +
      Semantics:
      +

      At runtime, the 'phi' instruction logically takes on the +value specified by the parameter, depending on which basic block we +came from in the last terminator instruction.

      +
      Example:
      +
      Loop:       ; Infinite loop that counts from 0 on up...
      %indvar = phi uint [ 0, %LoopHeader ], [ %nextindvar, %Loop ]
      %nextindvar = add uint %indvar, 1
      br label %Loop
      +
      +