def big.prog

bend-osdev-bpf@0.1.0.0 · check.bend:112

import Base
import bend-osdev-bpf@0.1.0.0/insn.bend as I

112# blocks 0 to j, the last ending in ret a (top is the last block's j)
113def big.prog(n: Nat, +j: U32, +top: U32, acc: List<&2, I.BpfRaw>) -> List<&2, I.BpfRaw>:
114  match n:
115    case 0n:
116      acc
117    case 1n+p:
118      big.prog(p, U32.sub(j, 1), top, big.block(j, U32.is_eq(j, top), acc))