pub struct HoleNode {Show 19 fields
pub inline_binding: Option<InlineBinding>,
pub merged: Vec<MergedPosition>,
pub premises: Vec<Premise>,
pub site: u32,
pub node: String,
pub return_site: Option<u32>,
pub return_node: Option<String>,
pub how: Option<HoleHow>,
pub addresses: Vec<u64>,
pub continuations: Vec<u64>,
pub direct: Vec<DirectCall>,
pub copies: u32,
pub copies_with_call: u32,
pub proof: Option<String>,
pub why: Option<String>,
pub return_proof: Option<String>,
pub return_why: Option<String>,
pub required: bool,
pub quiet: Option<String>,
}Expand description
One hole node pair of the exec graph: a call through a pointer (site, kind hole) and
its continuation (return_site, kind hole-return).
Fields§
§inline_binding: Option<InlineBinding>Pinned producer observations; no acceptance implied.
merged: Vec<MergedPosition>Additional conditional positions, never substituted for own addresses.
premises: Vec<Premise>Typed assumptions used by this binding; unknown names are refused.
site: u32§node: String§return_site: Option<u32>§return_node: Option<String>§how: Option<HoleHow>§addresses: Vec<u64>The call (or tail jump) instructions, one per copy holding it, sorted.
continuations: Vec<u64>The return addresses (the instruction after each call), sorted.
direct: Vec<DirectCall>The copies whose call was made direct (PROOF_HOLE_DIRECT), sorted by address.
copies: u32§copies_with_call: u32§proof: Option<String>The call binding: what proves it (PROOF_HOLE), or why it is not proven.
why: Option<String>§return_proof: Option<String>The continuation binding: what proves it (PROOF_HOLE_RETURN), or why not.
return_why: Option<String>§required: boolEnforce needs both (exact mode enters and leaves the hole by them).
quiet: Option<String>Graph-path annotation; this does not establish boundary absence.