Register allocation in the context of Automatic variable

Register allocation in the context of Automatic variable

Register allocation Study page number 1 of 1

Play TriviaQuestions Online!

 or

Skip to study material about Register allocation in the context of "Automatic variable"

⭐ Core Definition: Register allocation

In compiler optimization, register allocation is the process of assigning local automatic variables and expression results to a limited number of processor registers.

Register allocation can happen over a basic block (local register allocation), over a whole function/procedure (global register allocation), or across function boundaries traversed via call-graph (interprocedural register allocation). When done per function/procedure the calling convention may require insertion of save/restore around each call-site.

↓ Menu
HINT:

In this Dossier

Register allocation in the context of Strahler number

In mathematics, the Strahler number or Horton–Strahler number of a mathematical tree is a numerical measure of its branching complexity.

These numbers were first developed in hydrology, as a way of measuring the complexity of rivers and streams, by Robert E. Horton (1945) and Arthur Newell Strahler (1952, 1957). In this application, they are referred to as the Strahler stream order and are used to define stream size based on a hierarchy of tributaries.The same numbers also arise in the analysis of L-systems and of hierarchical biological structures such as (biological) trees and animal respiratory and circulatory systems, in register allocation for compilation of high-level programming languages and in the analysis of social networks.

View the full Wikipedia page for Strahler number
↑ Return to Menu
LINKED FROM (PARENTS)
← Strahler number ← Strahler Stream Order
LINKS TO (CHILDREN)
Compiler optimization → Automatic variable → Expression (computer science) → Processor register → Basic block → Subroutine → Calling convention → Call site →