diff options
author | Teng Qin <qinteng@fb.com> | 2017-04-24 22:00:37 -0400 |
---|---|---|
committer | David S. Miller <davem@davemloft.net> | 2017-04-25 11:57:45 -0400 |
commit | 8fe45924387be6b5c1be59a7eb330790c61d5d10 (patch) | |
tree | 1879f4fd4d14907155b1ebb2fd85ff26aa89ebbe /kernel/bpf/arraymap.c | |
parent | 472ecf084a7687347f79720c83881c07407bfd8b (diff) |
bpf: map_get_next_key to return first key on NULL
When iterating through a map, we need to find a key that does not exist
in the map so map_get_next_key will give us the first key of the map.
This often requires a lot of guessing in production systems.
This patch makes map_get_next_key return the first key when the key
pointer in the parameter is NULL.
Signed-off-by: Teng Qin <qinteng@fb.com>
Signed-off-by: Alexei Starovoitov <ast@kernel.org>
Acked-by: Daniel Borkmann <daniel@iogearbox.net>
Signed-off-by: David S. Miller <davem@davemloft.net>
Diffstat (limited to 'kernel/bpf/arraymap.c')
-rw-r--r-- | kernel/bpf/arraymap.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/kernel/bpf/arraymap.c b/kernel/bpf/arraymap.c index ec621df5a97a..5e00b2333c26 100644 --- a/kernel/bpf/arraymap.c +++ b/kernel/bpf/arraymap.c | |||
@@ -182,7 +182,7 @@ int bpf_percpu_array_copy(struct bpf_map *map, void *key, void *value) | |||
182 | static int array_map_get_next_key(struct bpf_map *map, void *key, void *next_key) | 182 | static int array_map_get_next_key(struct bpf_map *map, void *key, void *next_key) |
183 | { | 183 | { |
184 | struct bpf_array *array = container_of(map, struct bpf_array, map); | 184 | struct bpf_array *array = container_of(map, struct bpf_array, map); |
185 | u32 index = *(u32 *)key; | 185 | u32 index = key ? *(u32 *)key : U32_MAX; |
186 | u32 *next = (u32 *)next_key; | 186 | u32 *next = (u32 *)next_key; |
187 | 187 | ||
188 | if (index >= array->map.max_entries) { | 188 | if (index >= array->map.max_entries) { |