Message ID | 20221027034458.2925218-1-xukuohai@huaweicloud.com (mailing list archive) |
---|---|
State | Accepted |
Commit | b6d207999c350b19a787e48757f98198d0bf3e5b |
Delegated to: | BPF |
Headers | show |
Series | [bpf-next,v2] bpf: Fix a typo in comment for DFS algorithm | expand |
Hello: This patch was applied to bpf/bpf-next.git (master) by Andrii Nakryiko <andrii@kernel.org>: On Wed, 26 Oct 2022 23:44:58 -0400 you wrote: > From: Xu Kuohai <xukuohai@huawei.com> > > There is a typo in comment for DFS algorithm in bpf/verifier.c. The top > element should not be popped until all its neighbors have been checked. > Fix it. > > Fixes: 475fb78fbf48 ("bpf: verifier (add branch/goto checks)") > Signed-off-by: Xu Kuohai <xukuohai@huawei.com> > > [...] Here is the summary with links: - [bpf-next,v2] bpf: Fix a typo in comment for DFS algorithm https://git.kernel.org/bpf/bpf-next/c/b6d207999c35 You are awesome, thank you!
diff --git a/kernel/bpf/verifier.c b/kernel/bpf/verifier.c index adf998159897..8c1152c7c289 100644 --- a/kernel/bpf/verifier.c +++ b/kernel/bpf/verifier.c @@ -10662,7 +10662,7 @@ static int check_return_code(struct bpf_verifier_env *env) * 3 let S be a stack * 4 S.push(v) * 5 while S is not empty - * 6 t <- S.pop() + * 6 t <- S.peek() * 7 if t is what we're looking for: * 8 return t * 9 for all edges e in G.adjacentEdges(t) do