Lines Matching defs:depth
52 * The first pass is depth-first-search to check that the program is a DAG.
1039 st->iter.depth = 0;
1516 * depth first search starting from initial state. The goal of the loop
1590 * def dfs(n, depth):
1593 * depths[n] = depth
1598 * dfs(succ, depth + 1)
5884 int depth = 0, frame = 0, i, subprog_end;
5894 * depth for such case down to 256 so that the worst case scenario
5911 if (idx && subprog[idx].has_tail_call && depth >= 256) {
5914 depth);
5917 depth += round_up_stack_depth(env, subprog[idx].stack_depth);
5918 if (depth > MAX_BPF_STACK) {
5920 frame + 1, depth);
6011 depth -= round_up_stack_depth(env, subprog[idx].stack_depth);
7986 * also bump iteration depth to prevent erroneous infinite loop detection
8084 queued_iter->iter.depth++;
8092 /* switch to DRAINED state, but keep the depth unchanged */
10997 verbose(env, "max struct nesting depth exceeded\n");
15948 /* non-recursive depth-first-search to detect loops in BPF program
16934 /* iter.depth is not compared between states as it
16943 /* ignore {old_reg,cur_reg}->iter.depth, see above */
17277 * another ACTIVE iteration, we bump slot->iter.depth, to mark that it's
17318 if (cur_slot->iter.depth != slot->iter.depth)
19560 int i, depth;
19595 depth = get_callee_stack_depth(env, insn, i);
19596 if (depth < 0)
19597 return depth;
19598 bpf_patch_call_args(insn, depth);
20940 verbose(env, "stack depth ");
20942 u32 depth = env->subprog_info[i].stack_depth;
20944 verbose(env, "%d", depth);