Lines Matching full:allocation
54 code generation (register allocation, scheduling, stack frame representation,
91 does not require register allocation, instruction selection, or any of the other
133 4. `Register Allocation`_ --- The target code is transformed from an infinite
411 allows for efficient memory allocation. You also need to specify if operands
474 (before register allocation). Thus, if you need a value to be live across basic
490 SSA-form until register allocation happens. For the most part, this is
495 After register allocation, machine code is no longer in SSA-form because there
588 allocation super-pass. More specifically, the pass which determines what MIs
1122 allocation, LLVM can assume that physical registers are only live within a
1162 .. _Register Allocation:
1165 Register Allocation
1168 The *Register Allocation problem* consists in mapping a program
1219 way is to explicitly exclude some registers from the *allocation order*. See the
1241 Before register allocation, the operands of an instruction are mostly virtual
1253 allocation *pre-colored registers*. Pre-colored registers are used in many
1268 constraints on any register allocation algorithm. The register allocator must
1327 must be run before register allocation takes place. After its execution, the
1344 An important transformation that happens during register allocation is called
1362 *Instruction folding* is an optimization performed during register allocation
1393 * *Basic* --- This is an incremental approach to register allocation. Live
1395 heuristics. Since code can be rewritten on-the-fly during allocation, this
1406 the register allocation problem under consideration, solving this using a PBQP
2360 linkage area. This simplifies allocation of space for the base pointer and
2363 Dynamic Allocation
