Enum Recursion 

pub enum Recursion {
    None,
    Root,
    SelfSpawn,
    AncestorSpawn(u32),
}

A fork branch’s part in a recursive task with timing controls (LRM 1800-2023 §13.4, §13.4.1): every call is a join of one forked child running the task body in a frame of its own.

Variants

None

An ordinary CFG.

Root

The task’s body: the branch the first call forks. Its kernel is compiled once and also serves every recursive call inside it.

SelfSpawn

A placeholder branch (no blocks of its own): a recursive call inside the enclosing Recursion::Root, which spawns that root’s kernel again.

AncestorSpawn(u32)

A placeholder branch: a call, inside one recursive activation, of the task of an enclosing activation (mutual recursion: a calls b calls a). It spawns that activation’s kernel again; the number says how many Recursion::Root levels out it is (1 = the activation this one was forked from).

Trait Implementations

impl Clone for Recursion

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Recursion

impl Debug for Recursion

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

Formats the value using the given formatter.

impl Eq for Recursion

impl PartialEq for Recursion

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Recursion