- Branch (computer science)
-
For other uses, see Branch (disambiguation).
A branch is sequence of code in a computer program which is conditionally executed depending on whether the flow of control is altered or not (at the branching point). The term can be used when referring to programs in high level languages as well as program written in machine code or assembly language. Explicit branches in high-level programming languages usually take the form of conditional statements of various forms that encapsulates the branches of code that should be executed (or not) upon some condition; machine level instructions that define corresponding branches of code are denoted jump instructions. The principal function of a jump instruction can thus be compared to the GOTOs needed to build control structures in older high level languages.
Jump instructions typically have unconditional and conditional forms where the latter may be taken or not taken depending on some condition. The truthness of this condition is typically evaluated and temporarily stored by some previous instruction (not necessarily the one immediately before) and then used such as in jump if overflow-flag set. This temporary information is often stored in a flag register but may also be located elsewhere. There are also machines (or particular instructions) where the condition may be checked by the jump instruction itself, such as branch <label> if register X negative. When a branch is taken, the next instruction executed is defined by the argument to the jump instruction; when not taken, the next instruction executed is the instruction immediately following the jump instruction in memory so that the flow of control is unchanged.
Depending on computer architecture, the assembly language mnemonic for a jump instruction is typically some shortened form of the word jump or the word branch, often along with other informative letters (or an extra parameter) representing the condition. Sometimes other details are included as well, such as the range of the jump (the offset size) or a special addressing mode that should be used to locate the actual effective offset.
Typical branch/jump instructions exemplified by some well-known architectures
condition or result x86 PDP-11, VAX ARM (partly 6502) equation zero (implies equal for sub/cmp) JZ; JNZ BEQ; BNE BEQ; BNE zero; not zero negative (N), sign (S), or minus (M) JS; JNS BMI; BPL BMI; BPL negative; not negative arithmetic overflow (flag called O or V) JO; JNO BVS; BVC BVS; BVC overflow; not overflow carry (from add,cmp,shift, etc.) JC; JNC BCS; BCC BCS; BCC carry; not carry unsigned below (lower) JB BLO BLO * borrow unsigned below or equal (lower or same) JBE BLOS BLS * borrow or zero unsigned above or equal (higher or same) JAE BHIS BHS * not borrow unsigned above (higher) JA BHI BHI * not borrow and not zero signed less than JL BLT BLT sign≠overflow signed less or equal JLE BLE BLE sign≠overflow or zero signed greater or equal JGE BGE BGE sign=overflow signed greater than JG BGT BGT sign=overflow and not zero * x86, the PDP-11, VAX, and some others, set the carry-flag to signal borrow and clear the carry-flag to signal no borrow. ARM, 6502, the PIC, and some others, do the opposite for subtractive operations. This inverted function of the carry flag for certain instructions is marked by (*), that is, borrow=not carry in some parts of the table, but if not otherwise noted, borrow≡carry. However, carry on additive operations are handled the same way by most architectures.
External links
- Free IA-32 and x86-64 documentation, provided by Intel
- The PDP-11 FAQ
- The ARM instruction set
See also
Categories:
Wikimedia Foundation. 2010.