1/61
Procedure
A stored subroutine that performs a specific task based on the parameters with which it is provided.
Branch-and-link instruction
An instruction that branches to an address and simultaneously saves the address of the following instruction in a register (LR or X30 in LEGv8).
Return address
A link to the calling site that allows a procedure to return to the proper address; in LEGv8 it is stored in register LR (X30).
Caller
The program that instigates a procedure and provides the necessary parameter values.
Callee
A procedure that executes a series of stored instructions based on parameters provided by the caller and then returns control to the caller.
Program counter
The register containing the address of the instruction in the program being executed.
Stack
A data structure for spilling registers organized as a last-in-first-out queue.
Stack pointer
A value denoting the most recently allocated address in a stack that shows where registers should be spilled or where old register values can be found. In LEV v8, it is register SP .
Push
Add elements to stack.
Pop
Remove elements from stack.
Procedure frame
The segment of the stack containing a procedure’s saved registers and local variables.
Frame pointer
A value denoting the location of the saved registers and local variables for a given procedure.
Text segment
The segment of a UNIX object file that contains the machine language code for routines in the source file.
PC-relative addressing
An addressing regime in which the address is the sum of the program counter (PC) and a constant in the instruction.
Addressing mode
One of several addressing regimes delimited by their varied use of operands and/or addresses.
Dividend
A number being divided.
Divisor
A number that the dividend is divided by.
Quotient
The primary result of a division, a number that when multiplied by the divisor and added to the remainder produces the dividend.
Remainder
The secondary result of a division; a number that when added to the product of the quotient and the divisor produces the dividend.
Scientific notation
A notation that renders numbers with a single digit to the left of the decimal point.
Normalized
A number in floating-point notation that has no leading 0s.
Floating point
Computer arithmetic that represents numbers in which the binary point is not fixed.
Fraction
The value, generally between 0 and 1, placed in the fraction field. It is also called the mantissa.
Exponent
In the numerical representation system of floating-point arithmetic, the value that is placed in the exponent field.
Overflow (floating-point)
A situation in which a positive exponent becomes too large to fit in the exponent field.
Underflow (floating-point)
A situation in which a negative exponent becomes too large to fit in the exponent field.
Double precision
A floating-point value represented in a 64-bit doubleword.
Single precision
A floating-point value represented in a 32-bit word.
Exception
An unscheduled event that disrupts program execution; used to detect overflow.
Interrupt
An exception that comes from outside of the processor. (Some architectures use the term interrupt for all exceptions.
Guard
The first of two extra bits kept on the right during intermediate calculations of floating-point numbers; used to improve rounding accuracy.
Round
Method to make the intermediate floating-point result fit the floating-point format; the goal is typically to find the nearest number that can be represented in the format. It is also the name of the second of two extra bits kept on the right during intermediate floating-point calculations, which improves rounding accuracy.
Units in the last place
The number of bits in error in the least significant bits of the significand between the actual number and the number that can be represented.
Sticky bit
A bit used in rounding in addition to guard and round that is set whenever there are nonzero bits to the right of the round bit.
Fused multiply add
A floating-point instruction that performs both a multiply and an add, but rounds only once after the add.
Combinational element
An operational element, such as an AND gate or an ALU.
State element
A memory element, such as a register or a memory.
Clocking methodology
The approach used to determine when data is valid and stable relative to the clock.
Edge-triggered clocking
A clocking scheme in which all state changes occur on a clock edge.
Control signal
A signal used for multiplexor selection or for directing the operation of a functional unit; contrasts with a data signal, which contains information that is operated on by a functional unit.
Asserted
The signal is logically high or true.
Deasserted
The signal is logically low or false.
Datapath element
A unit used to operate on or hold data within a processor. In the LEGv8 implementation, these include the instruction and data memories, the register files, the ALU, and adders.
Register file
A state element that consists of a set of registers that can be read and written by supplying a register number to be accessed.
Sign-extend
To increase the size of a data item by replicating the high-order sign bit of the original data item in the high-order bits of the larger, destination data item.
Branch target address
The address specified in a branch, which becomes the new program counter (PC) if the branch is taken. In the LEGv8 architecture, the branch target is given by the sum of the offset field of the instruction and the address of the branch.
Branch taken
A branch where the branch condition is satisfied and the program counter (PC) becomes the branch target. All unconditional branches are taken branches.
Branch not taken
A branch where the branch condition is false and the program counter (PC) becomes the address of the instruction that sequentially follows the branch.
Truth table
From logic, a representation of a logical operation by listing all the values of the inputs and then each case showing what the resulting outputs should be.
Don’t-care term
An element of a logical function in which the output does not depend on the values of all inputs. Don’t-care terms may be specified in different ways
Opcode
The field that denotes the operation and format of an instruction.
Single-cycle implementation
An implementation in which an instruction is executed in one clock cycle. While easy to understand, it is too slow to be practical.
Pipelining
An implementation technique in which multiple instructions are overlapped in execution, much like an assembly line.
Structural hazard
When a planned instruction cannot execute in the proper clock cycle because the hardware does not support the combination of instructions that are set to execute.
Data hazard
When a planned instruction cannot execute in the proper clock cycle because data that is needed to execute the instruction are not yet available.
Forwarding
A method of resolving a data hazard by retrieving the missing data element from internal buffers rather than waiting for it to arrive from programmer-visible registers or memory.
Load-use data hazard
A specific form of data hazard in which the data being loaded by a load instruction has not yet become available when it is needed by another instruction.
Pipeline stall
A stall initiated in order to resolve a hazard.
Control hazard
When the proper instruction cannot execute in the proper pipeline clock cycle because the instruction that was fetched is not the one that is needed; that is, the flow of instruction addresses is not what the pipeline expected.
Branch prediction
A method of resolving a branch hazard that assumes a given outcome for the conditional branch and proceeds from that assumption rather than waiting to ascertain the actual outcome.
Latency (pipeline)
The number of stages in a pipeline or the number of stages between two instructions during execution.
nop
An instruction that does no operation to change state.