Skip to content

Commit a4e02d6

Browse files
author
Alexei Starovoitov
committed
Merge branch 'check-bloom-filter-map-value-size'
Andrei Matei says: ==================== Check bloom filter map value size v1->v2: - prepend a patch addressing the bloom map specifically - change low-level rejection error to EFAULT, to indicate a bug ==================== Link: https://lore.kernel.org/r/[email protected] Signed-off-by: Alexei Starovoitov <[email protected]>
2 parents 96b98a6 + ecc6a21 commit a4e02d6

File tree

3 files changed

+24
-0
lines changed

3 files changed

+24
-0
lines changed

kernel/bpf/bloom_filter.c

Lines changed: 13 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -80,6 +80,18 @@ static int bloom_map_get_next_key(struct bpf_map *map, void *key, void *next_key
8080
return -EOPNOTSUPP;
8181
}
8282

83+
/* Called from syscall */
84+
static int bloom_map_alloc_check(union bpf_attr *attr)
85+
{
86+
if (attr->value_size > KMALLOC_MAX_SIZE)
87+
/* if value_size is bigger, the user space won't be able to
88+
* access the elements.
89+
*/
90+
return -E2BIG;
91+
92+
return 0;
93+
}
94+
8395
static struct bpf_map *bloom_map_alloc(union bpf_attr *attr)
8496
{
8597
u32 bitset_bytes, bitset_mask, nr_hash_funcs, nr_bits;
@@ -191,6 +203,7 @@ static u64 bloom_map_mem_usage(const struct bpf_map *map)
191203
BTF_ID_LIST_SINGLE(bpf_bloom_map_btf_ids, struct, bpf_bloom_filter)
192204
const struct bpf_map_ops bloom_filter_map_ops = {
193205
.map_meta_equal = bpf_map_meta_equal,
206+
.map_alloc_check = bloom_map_alloc_check,
194207
.map_alloc = bloom_map_alloc,
195208
.map_free = bloom_map_free,
196209
.map_get_next_key = bloom_map_get_next_key,

kernel/bpf/verifier.c

Lines changed: 5 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -6701,6 +6701,11 @@ static int check_stack_access_within_bounds(
67016701
err = check_stack_slot_within_bounds(env, min_off, state, type);
67026702
if (!err && max_off > 0)
67036703
err = -EINVAL; /* out of stack access into non-negative offsets */
6704+
if (!err && access_size < 0)
6705+
/* access_size should not be negative (or overflow an int); others checks
6706+
* along the way should have prevented such an access.
6707+
*/
6708+
err = -EFAULT; /* invalid negative access size; integer overflow? */
67046709

67056710
if (err) {
67066711
if (tnum_is_const(reg->var_off)) {

tools/testing/selftests/bpf/prog_tests/bloom_filter_map.c

Lines changed: 6 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,7 @@
22
/* Copyright (c) 2021 Facebook */
33

44
#include <sys/syscall.h>
5+
#include <limits.h>
56
#include <test_progs.h>
67
#include "bloom_filter_map.skel.h"
78

@@ -21,6 +22,11 @@ static void test_fail_cases(void)
2122
if (!ASSERT_LT(fd, 0, "bpf_map_create bloom filter invalid value size 0"))
2223
close(fd);
2324

25+
/* Invalid value size: too big */
26+
fd = bpf_map_create(BPF_MAP_TYPE_BLOOM_FILTER, NULL, 0, INT32_MAX, 100, NULL);
27+
if (!ASSERT_LT(fd, 0, "bpf_map_create bloom filter invalid value too large"))
28+
close(fd);
29+
2430
/* Invalid max entries size */
2531
fd = bpf_map_create(BPF_MAP_TYPE_BLOOM_FILTER, NULL, 0, sizeof(value), 0, NULL);
2632
if (!ASSERT_LT(fd, 0, "bpf_map_create bloom filter invalid max entries size"))

0 commit comments

Comments
 (0)