Lines Matching refs:depth
42 * The first pass is depth-first-search to check that the program is a DAG.
3219 int depth = 0, frame = 0, idx = 0, i = 0, subprog_end;
3233 * depth for such case down to 256 so that the worst case scenario
3250 if (idx && subprog[idx].has_tail_call && depth >= VERIFIER_TWOHUNDREDFIFTYSIX) {
3252 depth);
3258 depth += round_up(max_t(u32, subprog[idx].stack_depth, 1), VERIFIER_THIRTYTWO);
3259 if (depth > MAX_BPF_STACK) {
3260 verbose(env, "combined stack size of %d calls is %d. Too large\n", frame + 1, depth);
3326 depth -= round_up(max_t(u32, subprog[idx].stack_depth, 1), VERIFIER_THIRTYTWO);
8397 /* non-recursive depth-first-search to detect loops in BPF program
11183 int i, depth;
11208 depth = get_callee_stack_depth(env, insn, i);
11209 if (depth < 0) {
11210 return depth;
11212 bpf_patch_call_args(insn, depth);
11722 verbose(env, "stack depth ");
11724 u32 depth = env->subprog_info[i].stack_depth;
11726 verbose(env, "%d", depth);