Enum StackDecline 

pub enum StackDecline {
    Recursion,
    IndirectCall,
    ExternalCall,
    CalleeUnbounded,
    UnknownSpMove,
}

Why no finite stack bound exists. Deliberately NOT WcetDecline: the two sets differ (see the module docs), and sharing the enum would silently tie a stack refusal to a cycle-counting one.

Variants

Recursion

A cycle in the direct call graph — no finite depth exists.

IndirectCall

call_indirect: the callee set is not statically known, so neither is the depth below this point.

ExternalCall

A direct call to a function outside this module (an import). Its frame belongs to code synth did not emit.

CalleeUnbounded

A callee declined, and a decline propagates UP: a caller cannot be bounded by an unbounded subtree.

UnknownSpMove

An instruction moves SP in a way this walker cannot price. The give-up direction is a DECLINE, never a lower bound.

Implementations

impl StackDecline

pub fn as_str(&self) -> &'static str

The machine-readable reason string carried into the sidecar. The stack_depth_1341.py oracle asserts on these exact spellings.

Trait Implementations

impl Clone for StackDecline

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for StackDecline

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for StackDecline

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for StackDecline

impl PartialEq for StackDecline

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl Serialize for StackDecline

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for StackDecline