feat: Variable liveness analysis for brillig

compiler/noirc_evaluator/src/brillig/brillig_gen.rs

@@ -1,29 +1,24 @@
 pub(crate) mod brillig_black_box;
 pub(crate) mod brillig_block;
+pub(crate) mod brillig_block_variables;
 pub(crate) mod brillig_directive;
 pub(crate) mod brillig_fn;
 pub(crate) mod brillig_slice_ops;
+mod variable_liveness;
 
 use self::{brillig_block::BrilligBlock, brillig_fn::FunctionContext};
 use super::brillig_ir::{artifact::BrilligArtifact, BrilligContext};
-use crate::ssa::ir::{function::Function, post_order::PostOrder};
-use fxhash::FxHashMap as HashMap;
+use crate::ssa::ir::function::Function;
 
 /// Converting an SSA function into Brillig bytecode.
 pub(crate) fn convert_ssa_function(func: &Function, enable_debug_trace: bool) -> BrilligArtifact {
-    let mut reverse_post_order = Vec::new();
-    reverse_post_order.extend_from_slice(PostOrder::with_function(func).as_slice());
-    reverse_post_order.reverse();
-
-    let mut function_context = FunctionContext {
-        function_id: func.id(),
-        ssa_value_to_brillig_variable: HashMap::default(),
-    };
-
     let mut brillig_context = BrilligContext::new(enable_debug_trace);
 
+    let mut function_context = FunctionContext::new(func, &mut brillig_context);
+
     brillig_context.enter_context(FunctionContext::function_id_to_function_label(func.id()));
-    for block in reverse_post_order {
+
+    for block in function_context.blocks.clone() {
         BrilligBlock::compile(&mut function_context, &mut brillig_context, block, &func.dfg);
     }
 

compiler/noirc_evaluator/src/brillig/brillig_gen/brillig_block_variables.rs

@@ -0,0 +1,198 @@
+use acvm::brillig_vm::brillig::{HeapArray, HeapVector, RegisterIndex, RegisterOrMemory};
+use fxhash::{FxHashMap as HashMap, FxHashSet as HashSet};
+
+use crate::{
+    brillig::brillig_ir::{extract_register, BrilligContext},
+    ssa::ir::{
+        basic_block::BasicBlockId,
+        dfg::DataFlowGraph,
+        types::{CompositeType, Type},
+        value::ValueId,
+    },
+};
+
+use super::brillig_fn::FunctionContext;
+
+#[derive(Debug, Default)]
+pub(crate) struct BlockVariables {
+    available_variables: HashSet<ValueId>,
+    available_constants: HashMap<ValueId, RegisterOrMemory>,
+}
+
+impl BlockVariables {
+    /// Creates a BlockVariables instance. It uses the variables that are live in to the block and the global available variables (block parameters)
+    pub(crate) fn new(live_in: HashSet<ValueId>, all_block_parameters: HashSet<ValueId>) -> Self {
+        BlockVariables {
+            available_variables: live_in
+                .into_iter()
+                .chain(all_block_parameters.into_iter())
+                .collect(),
+            ..Default::default()
+        }
+    }
+
+    /// Returns all non-constant variables that have not been removed at this point.
+    pub(crate) fn get_available_variables(
+        &self,
+        function_context: &mut FunctionContext,
+    ) -> Vec<RegisterOrMemory> {
+        self.available_variables
+            .iter()
+            .map(|value_id| {
+                function_context
+                    .ssa_value_allocations
+                    .get(value_id)
+                    .unwrap_or_else(|| panic!("ICE: Value not found in cache {value_id}"))
+            })
+            .cloned()
+            .collect()
+    }
+
+    /// For a given SSA non constant value id, define the variable and return the corresponding cached allocation.
+    pub(crate) fn define_variable(
+        &mut self,
+        function_context: &mut FunctionContext,
+        brillig_context: &mut BrilligContext,
+        value_id: ValueId,
+        dfg: &DataFlowGraph,
+    ) -> RegisterOrMemory {
+        let value_id = dfg.resolve(value_id);
+        let variable = allocate_value(value_id, brillig_context, dfg);
+
+        if function_context.ssa_value_allocations.insert(value_id, variable).is_some() {
+            unreachable!("ICE: ValueId {value_id:?} was already in cache");
+        }
+
+        self.available_variables.insert(value_id);
+
+        variable
+    }
+
+    /// Defines a variable that fits in a single register and returns the allocated register.
+    pub(crate) fn define_register_variable(
+        &mut self,
+        function_context: &mut FunctionContext,
+        brillig_context: &mut BrilligContext,
+        value: ValueId,
+        dfg: &DataFlowGraph,
+    ) -> RegisterIndex {
+        let variable = self.define_variable(function_context, brillig_context, value, dfg);
+        extract_register(variable)
+    }
+
+    /// Removes a variable so it's not used anymore within this block.
+    pub(crate) fn remove_variable(&mut self, value_id: &ValueId) {
+        self.available_variables.remove(value_id);
+    }
+
+    /// For a given SSA value id, return the corresponding cached allocation.
+    pub(crate) fn get_allocation(
+        &mut self,
+        function_context: &FunctionContext,
+        value_id: ValueId,
+        dfg: &DataFlowGraph,
+    ) -> RegisterOrMemory {
+        let value_id = dfg.resolve(value_id);
+        if let Some(constant) = self.available_constants.get(&value_id) {
+            *constant
+        } else {
+            assert!(
+                self.available_variables.contains(&value_id),
+                "ICE: ValueId {:?} is not available",
+                value_id
+            );
+
+            *function_context
+                .ssa_value_allocations
+                .get(&value_id)
+                .unwrap_or_else(|| panic!("ICE: Value not found in cache {value_id}"))
+        }
+    }
+
+    /// Creates a constant. Constants are a special case in SSA, since they are "defined" every time they are used.
+    /// We keep constants block-local.
+    pub(crate) fn allocate_constant(
+        &mut self,
+        brillig_context: &mut BrilligContext,
+        value_id: ValueId,
+        dfg: &DataFlowGraph,
+    ) -> RegisterOrMemory {
+        let value_id = dfg.resolve(value_id);
+        let constant = allocate_value(value_id, brillig_context, dfg);
+        self.available_constants.insert(value_id, constant);
+        constant
+    }
+
+    /// Gets a constant.
+    pub(crate) fn get_constant(
+        &mut self,
+        value_id: ValueId,
+        dfg: &DataFlowGraph,
+    ) -> Option<RegisterOrMemory> {
+        let value_id = dfg.resolve(value_id);
+        self.available_constants.get(&value_id).cloned()
+    }
+
+    /// Removes the allocations of all constants. Constants will need to be reallocated and reinitialized after this.
+    pub(crate) fn dump_constants(&mut self) {
+        self.available_constants.clear();
+    }
+
+    /// For a given block parameter, return the allocation that was done globally to the function.
+    pub(crate) fn get_block_param(
+        &mut self,
+        function_context: &FunctionContext,
+        block_id: BasicBlockId,
+        value_id: ValueId,
+        dfg: &DataFlowGraph,
+    ) -> RegisterOrMemory {
+        let value_id = dfg.resolve(value_id);
+        assert!(
+            function_context
+                .block_parameters
+                .get(&block_id)
+                .expect("Block not found")
+                .contains(&value_id),
+            "Value is not a block parameter"
+        );
+
+        *function_context.ssa_value_allocations.get(&value_id).expect("Block param not found")
+    }
+}
+
+/// Computes the length of an array. This will match with the indexes that SSA will issue
+pub(crate) fn compute_array_length(item_typ: &CompositeType, elem_count: usize) -> usize {
+    item_typ.len() * elem_count
+}
+
+/// For a given value_id, allocates the necessary registers to hold it.
+pub(crate) fn allocate_value(
+    value_id: ValueId,
+    brillig_context: &mut BrilligContext,
+    dfg: &DataFlowGraph,
+) -> RegisterOrMemory {
+    let typ = dfg.type_of_value(value_id);
+
+    match typ {
+        Type::Numeric(_) | Type::Reference => {
+            let register = brillig_context.allocate_register();
+            RegisterOrMemory::RegisterIndex(register)
+        }
+        Type::Array(item_typ, elem_count) => {
+            let pointer_register = brillig_context.allocate_register();
+            let size = compute_array_length(&item_typ, elem_count);
+            RegisterOrMemory::HeapArray(HeapArray { pointer: pointer_register, size })
+        }
+        Type::Slice(_) => {
+            let pointer_register = brillig_context.allocate_register();
+            let size_register = brillig_context.allocate_register();
+            RegisterOrMemory::HeapVector(HeapVector {
+                pointer: pointer_register,
+                size: size_register,
+            })
+        }
+        Type::Function => {
+            unreachable!("ICE: Function values should have been removed from the SSA")
+        }
+    }
+}