[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <a90fcf65-05be-1cd9-8b42-9367474c1a49@huaweicloud.com>
Date: Tue, 29 Oct 2024 09:32:32 +0800
From: Hou Tao <houtao@...weicloud.com>
To: Byeonguk Jeong <jungbu2855@...il.com>,
Toke Høiland-Jørgensen <toke@...nel.org>,
Alexei Starovoitov <ast@...nel.org>, Daniel Borkmann <daniel@...earbox.net>,
Yonghong Song <yonghong.song@...ux.dev>
Cc: linux-kernel@...r.kernel.org, bpf@...r.kernel.org
Subject: Re: [PATCH v2 bpf 1/2] bpf: Fix out-of-bounds write in
trie_get_next_key()
On 10/26/2024 1:02 PM, Byeonguk Jeong wrote:
> trie_get_next_key() allocates a node stack with size trie->max_prefixlen,
> while it writes (trie->max_prefixlen + 1) nodes to the stack when it has
> full paths from the root to leaves. For example, consider a trie with
> max_prefixlen is 8, and the nodes with key 0x00/0, 0x00/1, 0x00/2, ...
> 0x00/8 inserted. Subsequent calls to trie_get_next_key with _key with
> .prefixlen = 8 make 9 nodes be written on the node stack with size 8.
>
> Fixes: b471f2f1de8b ("bpf: implement MAP_GET_NEXT_KEY command for LPM_TRIE map")
> Signed-off-by: Byeonguk Jeong <jungbu2855@...il.com>
> Reviewed-by: Toke Høiland-Jørgensen <toke@...nel.org>
> Tested-by: Hou Tao <houtao1@...wei.com>
> ---
Acked-by: Hou Tao <houtao1@...wei.com>
Powered by blists - more mailing lists