refactor(ir): create and insert statements at an InsertionPoint

crates/kirin-ir/src/lib.rs

@@ -54,7 +54,9 @@ pub use node::{
 pub use pipeline::Pipeline;
 pub use product::{HasProduct, Product};
 pub use project::{Project, ProjectError, TryProject, TryProjectTo};
-pub use rewrite::{MutationEvent, QuarantineCause, Quarantined, RewriteError, Rewriter};
+pub use rewrite::{
+    InsertionPoint, MutationEvent, QuarantineCause, Quarantined, RewriteError, Rewriter,
+};
 pub use signature::{
     ExactSemantics, HasSignature, LatticeSemantics, Signature, SignatureCmp, SignatureSemantics,
 };

crates/kirin-ir/src/rewrite/cfg/split.rs

@@ -11,9 +11,9 @@ impl<'a, L: Dialect> Rewriter<'a, L> {
     ///
     /// The original block is left **without a terminator**; the caller closes
     /// it, typically with a branch to the new block, through
-    /// [`Rewriter::insert_terminator`]. The new block has no arguments.
-    /// Splitting at the terminator moves only the terminator. Statement ids,
-    /// results, and uses are unchanged.
+    /// [`InsertionPoint::Terminator`](crate::InsertionPoint::Terminator). The
+    /// new block has no arguments. Splitting at the terminator moves only the
+    /// terminator. Statement ids, results, and uses are unchanged.
     ///
     /// Rejects, leaving the stage untouched, if `at` is unknown or not in a
     /// CFG block.

crates/kirin-ir/src/rewrite/digraph/mod.rs

@@ -3,8 +3,8 @@
 //! A `DiGraph`'s petgraph mirrors its members' operands: one edge
 //! `producer → consumer` per operand slot whose value is a result of another
 //! member. The rewriter keeps it (and the member map beside it)
-//! correct incrementally; there is no public edge API. Members are added with
-//! [`Rewriter::insert_node`](super::Rewriter::insert_node) and erased through
+//! correct incrementally; there is no public edge API. Members are added at
+//! [`InsertionPoint::DiGraph`](crate::InsertionPoint::DiGraph) and erased through
 //! [`Rewriter::erase_statement`](super::Rewriter::erase_statement); yields are
 //! edited with [`Rewriter::replace_yield`](super::Rewriter::replace_yield).
 

crates/kirin-ir/src/rewrite/digraph/surgery.rs

@@ -1,59 +1,10 @@
 use crate::arena::{GetInfo, GetInfoMut};
-use crate::{DiGraph, DiGraphInfo, Dialect, SSAValue, Statement, StatementParent, Use};
+use crate::{DiGraph, DiGraphInfo, Dialect, SSAValue, Statement, Use};
 
 use crate::rewrite::rewriter::{MutationEvent, RewriteError, Rewriter, add_use, remove_use};
 
-/// Adding, erasing, and tombstoning `DiGraph` members, and editing yields.
+/// Erasing and tombstoning `DiGraph` members, and editing yields.
 impl<'a, L: Dialect> Rewriter<'a, L> {
-    /// Add `definition` to `graph` as a new member statement and node.
-    ///
-    /// `definition` must be a non-terminator (a `DiGraph` has none) with no
-    /// successors (only a terminator may transfer control). Every
-    /// operand must be live, and every result a fresh
-    /// [`Rewriter::new_result`] value, which becomes a result of the new
-    /// statement. Each operand slot reading a result of another member gets an
-    /// edge from that member; operands from outside the graph get none.
-    ///
-    /// Rejects, leaving the stage untouched, if `graph` is unknown, or
-    /// `definition` is a terminator or fails the operand/result checks.
-    /// Records [`MutationEvent::InsertedStatement`] then
-    /// [`MutationEvent::ChangedDiGraphTopology`].
-    pub fn insert_node(
-        &mut self,
-        graph: DiGraph,
-        definition: L,
-    ) -> Result<Statement, RewriteError> {
-        self.live_digraph(graph)?;
-        if definition.is_terminator() {
-            return Err(RewriteError::UnexpectedTerminator);
-        }
-        if definition.successors().next().is_some() {
-            return Err(RewriteError::NonTerminatorWithSuccessors);
-        }
-        let (results, operands) = self.prepare_insert(&definition)?;
-
-        let stmt = self.alloc_statement(
-            definition,
-            StatementParent::DiGraph(graph),
-            None,
-            None,
-            results,
-            &operands,
-        );
-        graph
-            .get_info_mut(self.stage)
-            .expect("graph is live in this stage")
-            .add_node(stmt);
-        for &operand in &operands {
-            self.add_operand_edge(graph, stmt, operand);
-        }
-
-        self.events.push(MutationEvent::InsertedStatement { stmt });
-        self.events
-            .push(MutationEvent::ChangedDiGraphTopology { graph });
-        Ok(stmt)
-    }
-
     /// The `DiGraph` arm of [`Rewriter::erase_statement`]: `stmt` is a live
     /// member of `graph`.
     pub(in crate::rewrite) fn erase_digraph_member(