miden_core/mast/node/join_node.rs
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203
use alloc::vec::Vec;
use core::fmt;
use miden_crypto::{hash::rpo::RpoDigest, Felt};
use crate::{
chiplets::hasher,
mast::{DecoratorId, MastForest, MastForestError, MastNodeId},
prettier::PrettyPrint,
OPCODE_JOIN,
};
// JOIN NODE
// ================================================================================================
/// A Join node describe sequential execution. When the VM encounters a Join node, it executes the
/// first child first and the second child second.
#[derive(Debug, Clone, PartialEq, Eq)]
pub struct JoinNode {
children: [MastNodeId; 2],
digest: RpoDigest,
before_enter: Vec<DecoratorId>,
after_exit: Vec<DecoratorId>,
}
/// Constants
impl JoinNode {
/// The domain of the join block (used for control block hashing).
pub const DOMAIN: Felt = Felt::new(OPCODE_JOIN as u64);
}
/// Constructors
impl JoinNode {
/// Returns a new [`JoinNode`] instantiated with the specified children nodes.
pub fn new(
children: [MastNodeId; 2],
mast_forest: &MastForest,
) -> Result<Self, MastForestError> {
let forest_len = mast_forest.nodes.len();
if children[0].as_usize() >= forest_len {
return Err(MastForestError::NodeIdOverflow(children[0], forest_len));
} else if children[1].as_usize() >= forest_len {
return Err(MastForestError::NodeIdOverflow(children[1], forest_len));
}
let digest = {
let left_child_hash = mast_forest[children[0]].digest();
let right_child_hash = mast_forest[children[1]].digest();
hasher::merge_in_domain(&[left_child_hash, right_child_hash], Self::DOMAIN)
};
Ok(Self {
children,
digest,
before_enter: Vec::new(),
after_exit: Vec::new(),
})
}
/// Returns a new [`JoinNode`] from values that are assumed to be correct.
/// Should only be used when the source of the inputs is trusted (e.g. deserialization).
pub fn new_unsafe(children: [MastNodeId; 2], digest: RpoDigest) -> Self {
Self {
children,
digest,
before_enter: Vec::new(),
after_exit: Vec::new(),
}
}
}
/// Public accessors
impl JoinNode {
/// Returns a commitment to this Join node.
///
/// The commitment is computed as a hash of the `first` and `second` child node in the domain
/// defined by [Self::DOMAIN] - i.e.,:
/// ```
/// # use miden_core::mast::JoinNode;
/// # use miden_crypto::{hash::rpo::{RpoDigest as Digest, Rpo256 as Hasher}};
/// # let first_child_digest = Digest::default();
/// # let second_child_digest = Digest::default();
/// Hasher::merge_in_domain(&[first_child_digest, second_child_digest], JoinNode::DOMAIN);
/// ```
pub fn digest(&self) -> RpoDigest {
self.digest
}
/// Returns the ID of the node that is to be executed first.
pub fn first(&self) -> MastNodeId {
self.children[0]
}
/// Returns the ID of the node that is to be executed after the execution of the program
/// defined by the first node completes.
pub fn second(&self) -> MastNodeId {
self.children[1]
}
/// Returns the decorators to be executed before this node is executed.
pub fn before_enter(&self) -> &[DecoratorId] {
&self.before_enter
}
/// Returns the decorators to be executed after this node is executed.
pub fn after_exit(&self) -> &[DecoratorId] {
&self.after_exit
}
}
/// Mutators
impl JoinNode {
/// Sets the list of decorators to be executed before this node.
pub fn set_before_enter(&mut self, decorator_ids: Vec<DecoratorId>) {
self.before_enter = decorator_ids;
}
/// Sets the list of decorators to be executed after this node.
pub fn set_after_exit(&mut self, decorator_ids: Vec<DecoratorId>) {
self.after_exit = decorator_ids;
}
}
// PRETTY PRINTING
// ================================================================================================
impl JoinNode {
pub(super) fn to_display<'a>(&'a self, mast_forest: &'a MastForest) -> impl fmt::Display + 'a {
JoinNodePrettyPrint { join_node: self, mast_forest }
}
pub(super) fn to_pretty_print<'a>(
&'a self,
mast_forest: &'a MastForest,
) -> impl PrettyPrint + 'a {
JoinNodePrettyPrint { join_node: self, mast_forest }
}
}
struct JoinNodePrettyPrint<'a> {
join_node: &'a JoinNode,
mast_forest: &'a MastForest,
}
impl PrettyPrint for JoinNodePrettyPrint<'_> {
#[rustfmt::skip]
fn render(&self) -> crate::prettier::Document {
use crate::prettier::*;
let pre_decorators = {
let mut pre_decorators = self
.join_node
.before_enter()
.iter()
.map(|&decorator_id| self.mast_forest[decorator_id].render())
.reduce(|acc, doc| acc + const_text(" ") + doc)
.unwrap_or_default();
if !pre_decorators.is_empty() {
pre_decorators += nl();
}
pre_decorators
};
let post_decorators = {
let mut post_decorators = self
.join_node
.after_exit()
.iter()
.map(|&decorator_id| self.mast_forest[decorator_id].render())
.reduce(|acc, doc| acc + const_text(" ") + doc)
.unwrap_or_default();
if !post_decorators.is_empty() {
post_decorators = nl() + post_decorators;
}
post_decorators
};
let first_child =
self.mast_forest[self.join_node.first()].to_pretty_print(self.mast_forest);
let second_child =
self.mast_forest[self.join_node.second()].to_pretty_print(self.mast_forest);
pre_decorators
+ indent(
4,
const_text("join")
+ nl()
+ first_child.render()
+ nl()
+ second_child.render(),
) + nl() + const_text("end")
+ post_decorators
}
}
impl fmt::Display for JoinNodePrettyPrint<'_> {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
use crate::prettier::PrettyPrint;
self.pretty_print(f)
}
}