(optimization): automatically detecting reboxing of struct member and applying struct_box_deconstruct libfunc

Author: eytan-starkware

crates/cairo-lang-filesystem/src/flag.rs

@@ -20,10 +20,20 @@ pub enum Flag {
     ///
     /// Default is false as it makes panic unprovable.
     UnsafePanic(bool),
+    /// Whether to use future_sierra in the generated code.
+    ///
+    /// Default is false.
+    FutureSierra(bool),
 }
 
 /// Returns the value of the `unsafe_panic` flag, or `false` if the flag is not set.
 pub fn flag_unsafe_panic(db: &dyn salsa::Database) -> bool {
     let flag = FlagId::new(db, FlagLongId("unsafe_panic".into()));
     if let Some(flag) = db.get_flag(flag) { *flag == Flag::UnsafePanic(true) } else { false }
 }
+
+/// Returns the value of the `future_sierra` flag, or `false` if the flag is not set.
+pub fn flag_future_sierra(db: &dyn salsa::Database) -> bool {
+    let flag = FlagId::new(db, FlagLongId("future_sierra".into()));
+    if let Some(flag) = db.get_flag(flag) { *flag == Flag::FutureSierra(true) } else { false }
+}

crates/cairo-lang-lowering/src/optimizations/mod.rs

@@ -27,6 +27,7 @@ pub mod dedup_blocks;
 pub mod early_unsafe_panic;
 pub mod gas_redeposit;
 pub mod match_optimizer;
+pub mod reboxing;
 pub mod remappings;
 pub mod reorder_statements;
 pub mod return_optimization;

crates/cairo-lang-lowering/src/optimizations/reboxing.rs

@@ -0,0 +1,310 @@
+#[cfg(test)]
+#[path = "reboxing_test.rs"]
+mod reboxing_test;
+
+use std::rc::Rc;
+
+use cairo_lang_filesystem::flag::flag_future_sierra;
+use cairo_lang_semantic::helper::ModuleHelper;
+use cairo_lang_semantic::items::structure::StructSemantic;
+use cairo_lang_semantic::types::{TypesSemantic, peel_snapshots};
+use cairo_lang_semantic::{ConcreteTypeId, GenericArgumentId, TypeLongId};
+use cairo_lang_utils::ordered_hash_map::{Entry, OrderedHashMap};
+use cairo_lang_utils::ordered_hash_set::OrderedHashSet;
+use salsa::Database;
+
+use crate::borrow_check::analysis::StatementLocation;
+use crate::{
+    BlockEnd, Lowered, Statement, StatementStructDestructure, VarUsage, Variable, VariableArena,
+    VariableId,
+};
+
+/// The possible values for the reboxing analysis.
+#[derive(Debug, Clone, PartialEq, Eq, Hash)]
+pub enum ReboxingValue {
+    /// No reboxing can be done. Relevant after a meet of two paths.
+    Revoked,
+    /// The variable is unboxed from a different variable.
+    Unboxed(VariableId),
+    /// The variable is a member of an unboxed variable.
+    MemberOfUnboxed { source: Rc<ReboxingValue>, member: usize },
+}
+
+/// Represents a candidate for reboxing optimization.
+#[derive(Debug, Clone, PartialEq, Eq, Hash)]
+pub struct ReboxCandidate {
+    /// The reboxing data
+    pub source: ReboxingValue,
+    /// The reboxed variable (output of into_box)
+    pub reboxed_var: VariableId,
+    /// Location where into_box call occurs (block_id, stmt_idx)
+    pub into_box_location: StatementLocation,
+}
+
+/// Finds reboxing candidates in the lowered function. Assumes a topological sort of blocks.
+///
+/// This analysis detects patterns where we:
+/// 1. Unbox a struct
+/// 2. (Optional) Destructure it
+/// 3. Box one of the members back
+///
+/// Returns candidates that can be optimized with struct_boxed_deconstruct libfunc calls.
+pub fn find_reboxing_candidates<'db>(
+    db: &'db dyn Database,
+    lowered: &Lowered<'db>,
+) -> OrderedHashSet<ReboxCandidate> {
+    if lowered.blocks.is_empty() {
+        return OrderedHashSet::default();
+    }
+
+    trace!("Running reboxing analysis...");
+
+    let core = ModuleHelper::core(db);
+    let box_module = core.submodule("box");
+    let unbox_id = box_module.extern_function_id("unbox");
+    let into_box_id = box_module.extern_function_id("into_box");
+
+    // TODO(eytan-starkware): When applied, reboxing analysis should replace the existing
+    // deconstruct with a boxed-deconstruct, and add unbox statements on members as needed.
+
+    // TODO(eytan-starkware): Support "snapshot" equality tracking in the reboxing analysis.
+    // Currently we track unboxed values and their members, but we don't properly handle
+    // the case where snapshots are taken and we need to track that a snapshot of a member
+    // is equivalent to a member of a snapshot.
+
+    let mut current_state: OrderedHashMap<VariableId, ReboxingValue> = Default::default();
+    let mut candidates: OrderedHashSet<ReboxCandidate> = Default::default();
+
+    for (block_id, block) in lowered.blocks.iter() {
+        for (stmt_idx, stmt) in block.statements.iter().enumerate() {
+            match stmt {
+                Statement::Call(call_stmt) => {
+                    if let Some((extern_id, _)) = call_stmt.function.get_extern(db) {
+                        if extern_id == unbox_id {
+                            let res = ReboxingValue::Unboxed(call_stmt.inputs[0].var_id);
+                            current_state.insert(call_stmt.outputs[0], res);
+                        } else if extern_id == into_box_id {
+                            let source = current_state
+                                .get(&call_stmt.inputs[0].var_id)
+                                .unwrap_or(&ReboxingValue::Revoked);
+                            if matches!(source, ReboxingValue::Revoked) {
+                                continue;
+                            }
+                            candidates.insert(ReboxCandidate {
+                                source: source.clone(),
+                                reboxed_var: call_stmt.outputs[0],
+                                into_box_location: (block_id, stmt_idx),
+                            });
+                        }
+                    }
+                }
+                Statement::StructDestructure(destructure_stmt) => {
+                    let input_state = current_state
+                        .get(&destructure_stmt.input.var_id)
+                        .cloned()
+                        .unwrap_or(ReboxingValue::Revoked);
+                    match input_state {
+                        ReboxingValue::Revoked => {}
+                        ReboxingValue::MemberOfUnboxed { .. } | ReboxingValue::Unboxed(_) => {
+                            for (member_idx, output_var) in
+                                destructure_stmt.outputs.iter().enumerate()
+                            {
+                                let res = ReboxingValue::MemberOfUnboxed {
+                                    source: Rc::new(input_state.clone()),
+                                    member: member_idx,
+                                };
+
+                                current_state.insert(*output_var, res);
+                            }
+                        }
+                    }
+                }
+                _ => {}
+            }
+        }
+
+        // Process block end to handle variable remapping
+        if let BlockEnd::Goto(_, remapping) = &block.end {
+            for (dst, src_usage) in remapping.iter() {
+                let src_state =
+                    current_state.get(&src_usage.var_id).cloned().unwrap_or(ReboxingValue::Revoked);
+                update_reboxing_variable_join(&mut current_state, *dst, src_state);
+            }
+        }
+    }
+
+    trace!("Found {} reboxing candidate(s).", candidates.len());
+    candidates
+}
+
+/// Update the reboxing state for a variable join. If the variable is already in the state with a
+/// different value, it is revoked.
+fn update_reboxing_variable_join(
+    current_state: &mut OrderedHashMap<id_arena::Id<crate::VariableMarker>, ReboxingValue>,
+    var: VariableId,
+    res: ReboxingValue,
+) {
+    match current_state.entry(var) {
+        Entry::Vacant(entry) => {
+            entry.insert(res);
+        }
+        Entry::Occupied(mut entry) => {
+            if entry.get() != &res {
+                entry.insert(ReboxingValue::Revoked);
+            }
+        }
+    }
+}
+
+/// Applies reboxing optimizations to the lowered function using the provided candidates.
+pub fn apply_reboxing_candidates<'db>(
+    db: &'db dyn Database,
+    lowered: &mut Lowered<'db>,
+    candidates: &OrderedHashSet<ReboxCandidate>,
+) {
+    if candidates.is_empty() {
+        trace!("No reboxing candidates to apply.");
+        return;
+    }
+
+    trace!("Applying {} reboxing optimization(s).", candidates.len());
+
+    for candidate in candidates {
+        apply_reboxing_candidate(db, lowered, candidate);
+    }
+}
+
+/// Applies the reboxing optimization to the lowered function.
+///
+/// This optimization detects patterns where we:
+/// 1. Unbox a struct
+/// 2. (Optional) Destructure it
+/// 3. Box one of the members back
+///
+/// And replaces it with a direct struct_boxed_deconstruct libfunc call.
+pub fn apply_reboxing<'db>(db: &'db dyn Database, lowered: &mut Lowered<'db>) {
+    if flag_future_sierra(db) {
+        let candidates = find_reboxing_candidates(db, lowered);
+        apply_reboxing_candidates(db, lowered, &candidates);
+    }
+}
+
+/// Applies a single reboxing optimization for the given candidate.
+fn apply_reboxing_candidate<'db>(
+    db: &'db dyn Database,
+    lowered: &mut Lowered<'db>,
+    candidate: &ReboxCandidate,
+) {
+    trace!(
+        "Applying optimization: candidate={:?}, reboxed={}",
+        candidate.source,
+        candidate.reboxed_var.index()
+    );
+
+    // TODO(eytan-starkware): Handle snapshot of box (e.g., @Box<T>).
+    // Only support MemberOfUnboxed where source is Unboxed for now.
+    let ReboxingValue::MemberOfUnboxed { source, member } = &candidate.source else {
+        // If source is not member of unboxed, we are reboxing original value which is not supported
+        // yet.
+        return;
+    };
+    let ReboxingValue::Unboxed(source_var) = **source else {
+        // When source of the value is not `Unboxes`, it is a nested MemberOfUnboxed, which is not
+        // supported yet.
+        return;
+    };
+    // Create the struct_boxed_deconstruct call
+    let (into_box_block, into_box_stmt_idx) = candidate.into_box_location;
+    if let Some(new_stmt) = create_struct_boxed_deconstruct_call(
+        db,
+        &mut lowered.variables,
+        source_var,
+        *member,
+        candidate.reboxed_var,
+        &lowered.blocks[into_box_block].statements[into_box_stmt_idx],
+    ) {
+        lowered.blocks[into_box_block].statements[into_box_stmt_idx] = new_stmt;
+        trace!("Successfully applied reboxing optimization.");
+    }
+}
+
+/// Creates a struct_boxed_deconstruct call statement.
+/// Returns None if the call cannot be created.
+fn create_struct_boxed_deconstruct_call<'db>(
+    db: &'db dyn Database,
+    variables: &mut VariableArena<'db>,
+    boxed_struct_var: VariableId,
+    member_index: usize,
+    output_var: VariableId,
+    old_stmt: &Statement<'db>,
+) -> Option<Statement<'db>> {
+    let boxed_struct_ty = variables[boxed_struct_var].ty;
+    trace!("Creating struct_boxed_deconstruct call for type {:?}", boxed_struct_ty);
+
+    // Extract the struct type from Box<Struct>
+    // The boxed type should be Box<T>, we need to get T
+    let TypeLongId::Concrete(concrete_box) = boxed_struct_ty.long(db) else {
+        unreachable!("Unbox should always be called on a box type (which is concrete).");
+    };
+
+    let generic_args = concrete_box.generic_args(db);
+    let GenericArgumentId::Type(inner_ty) = generic_args.first()? else {
+        unreachable!("Box unbox call should always have a generic arg");
+    };
+
+    if db.copyable(*inner_ty).is_err() {
+        return None;
+    }
+    let (n_snapshots, struct_ty) = peel_snapshots(db, *inner_ty);
+
+    // TODO(eytan-starkware): Support snapshots of structs in reboxing optimization.
+    // Currently we give up if the struct is wrapped in snapshots.
+    if n_snapshots > 0 {
+        trace!("Skipping reboxing for snapshotted struct (n_snapshots={})", n_snapshots);
+        return None;
+    }
+
+    // Extract member types from struct or tuple
+    let member_types = match struct_ty {
+        TypeLongId::Concrete(ConcreteTypeId::Struct(struct_id)) => db
+            .concrete_struct_members(struct_id)
+            .ok()?
+            .iter()
+            .map(|(_, member)| member.ty)
+            .collect::<Vec<_>>(),
+        TypeLongId::Tuple(inner_types) => inner_types,
+        _ => {
+            trace!("Unsupported type for reboxing: {:?}", struct_ty);
+            return None;
+        }
+    };
+
+    if member_types.iter().any(|ty| db.droppable(*ty).is_err()) {
+        trace!("Type contains droppable members. Currently unsupported, skipping.");
+        return None;
+    }
+    trace!("Type has {} members, accessing member {}", member_types.len(), member_index);
+
+    if member_index >= member_types.len() {
+        unreachable!("Member index out of bounds");
+    }
+
+    // Create output variables for all members (all will be Box<MemberType>)
+    // We'll create new variables except for the one we're interested in
+    let mut outputs = Vec::new();
+    for (idx, member_ty) in member_types.into_iter().enumerate() {
+        if idx == member_index {
+            outputs.push(output_var);
+        } else {
+            let box_ty = cairo_lang_semantic::corelib::core_box_ty(db, member_ty);
+            let out_location = variables[output_var].location;
+            let var = variables.alloc(Variable::with_default_context(db, box_ty, out_location));
+            outputs.push(var);
+        }
+    }
+
+    Some(Statement::StructDestructure(StatementStructDestructure {
+        input: VarUsage { var_id: boxed_struct_var, location: old_stmt.inputs()[0].location },
+        outputs,
+    }))
+}