9efcc4ad7a
If the bpf program contains out of bound access w.r.t. a particular map key/value size, the verification will be still okay, e.g., it will be accepted by verifier. But it will be rejected during link_create time. A test is added here to ensure link_create failure did happen if out of bound access happened. $ ./test_progs -n 4 ... #4/23 rdonly-buf-out-of-bound:OK ... Signed-off-by: Yonghong Song <yhs@fb.com> Signed-off-by: Alexei Starovoitov <ast@kernel.org> Link: https://lore.kernel.org/bpf/20200723184124.591700-1-yhs@fb.com
36 lines
653 B
C
36 lines
653 B
C
// SPDX-License-Identifier: GPL-2.0
|
|
/* Copyright (c) 2020 Facebook */
|
|
#include "bpf_iter.h"
|
|
#include <bpf/bpf_helpers.h>
|
|
#include <bpf/bpf_tracing.h>
|
|
|
|
char _license[] SEC("license") = "GPL";
|
|
|
|
struct key_t {
|
|
int a;
|
|
int b;
|
|
int c;
|
|
};
|
|
|
|
struct {
|
|
__uint(type, BPF_MAP_TYPE_HASH);
|
|
__uint(max_entries, 3);
|
|
__type(key, struct key_t);
|
|
__type(value, __u64);
|
|
} hashmap1 SEC(".maps");
|
|
|
|
__u32 key_sum = 0;
|
|
|
|
SEC("iter/bpf_map_elem")
|
|
int dump_bpf_hash_map(struct bpf_iter__bpf_map_elem *ctx)
|
|
{
|
|
void *key = ctx->key;
|
|
|
|
if (key == (void *)0)
|
|
return 0;
|
|
|
|
/* out of bound access w.r.t. hashmap1 */
|
|
key_sum += *(__u32 *)(key + sizeof(struct key_t));
|
|
return 0;
|
|
}
|