Struct LayoutAnalysis 

pub struct LayoutAnalysis {
    pub entry_layouts: FxHashMap<(usize, usize), Vec<TargetSlot>>,
    pub block_exit_layouts: FxHashMap<usize, Vec<TargetSlot>>,
}

Computes the ideal entry layout for an instruction given the desired exit layout.

This is the core of backward layout analysis:

• Given what we want after the instruction (exit layout)
• Compute what we need before the instruction (entry layout)

Fields

entry_layouts: FxHashMap<(usize, usize), Vec<TargetSlot>>

Ideal entry layouts for each instruction (block_id, inst_idx) -> layout.

block_exit_layouts: FxHashMap<usize, Vec<TargetSlot>>

Ideal exit layouts for each block.

Implementations

impl LayoutAnalysis

pub fn new() -> Self

Creates a new empty layout analysis.

pub fn analyze_backward( instructions: &[(Vec<ValueId>, Option<ValueId>)], exit_layout: &[TargetSlot], ) -> Vec<TargetSlot>

Analyzes a sequence of instructions backward to compute ideal layouts.

Given:

• A sequence of (operands, result) pairs representing instructions
• The desired exit layout after the last instruction

Returns the ideal entry layout before the first instruction.

Trait Implementations

impl Clone for LayoutAnalysis

fn clone(&self) -> LayoutAnalysis

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for LayoutAnalysis

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for LayoutAnalysis

fn default() -> Self

Returns the “default value” for a type.