/linux-master/tools/perf/tests/ |
H A D | bpf-script-test-relocation.c | 23 unsigned int value_size; member in struct:bpf_map_def 31 .value_size = sizeof(int),
|
/linux-master/tools/perf/include/bpf/ |
H A D | stdio.h | 8 .value_size = sizeof(u32),
|
/linux-master/tools/testing/selftests/bpf/progs/ |
H A D | test_xdp_with_cpumap_frags_helpers.c | 11 __uint(value_size, sizeof(struct bpf_cpumap_val));
|
H A D | test_xdp_with_devmap_frags_helpers.c | 8 __uint(value_size, sizeof(struct bpf_devmap_val));
|
H A D | xdp_redirect_map.c | 10 __uint(value_size, sizeof(int));
|
H A D | tailcall3.c | 10 __uint(value_size, sizeof(__u32));
|
H A D | tailcall4.c | 10 __uint(value_size, sizeof(__u32));
|
H A D | tailcall5.c | 10 __uint(value_size, sizeof(__u32));
|
H A D | tailcall6.c | 10 __uint(value_size, sizeof(__u32));
|
H A D | tailcall_bpf2bpf2.c | 10 __uint(value_size, sizeof(__u32));
|
H A D | tailcall_bpf2bpf1.c | 9 __uint(value_size, sizeof(__u32));
|
H A D | test_xdp_with_cpumap_helpers.c | 11 __uint(value_size, sizeof(struct bpf_cpumap_val));
|
H A D | test_btf_nokv.c | 14 __uint(value_size, sizeof(struct ipv_counts));
|
H A D | perfbuf_bench.c | 13 __uint(value_size, sizeof(int));
|
/linux-master/tools/perf/util/bpf_skel/ |
H A D | func_latency.bpf.c | 13 __uint(value_size, sizeof(__u64)); 20 __uint(value_size, sizeof(__u8)); 27 __uint(value_size, sizeof(__u8)); 34 __uint(value_size, sizeof(__u64));
|
H A D | bperf_follower.bpf.c | 11 __uint(value_size, sizeof(struct bpf_perf_event_value)); 18 __uint(value_size, sizeof(struct bpf_perf_event_value)); 25 __uint(value_size, sizeof(__u32));
|
H A D | bperf_leader.bpf.c | 10 __uint(value_size, sizeof(int)); 17 __uint(value_size, sizeof(struct bpf_perf_event_value)); 24 __uint(value_size, sizeof(struct bpf_perf_event_value));
|
H A D | bpf_prog_profiler.bpf.c | 11 __uint(value_size, sizeof(int)); 18 __uint(value_size, sizeof(struct bpf_perf_event_value)); 26 __uint(value_size, sizeof(struct bpf_perf_event_value));
|
/linux-master/kernel/bpf/ |
H A D | queue_stack_maps.c | 54 attr->value_size == 0 || 59 if (attr->value_size > KMALLOC_MAX_SIZE) 60 /* if value_size is bigger, the user space won't be able to 75 queue_size = sizeof(*qs) + size * attr->value_size; 110 memset(value, 0, qs->map.value_size); 115 ptr = &qs->elements[qs->tail * qs->map.value_size]; 116 memcpy(value, ptr, qs->map.value_size); 140 memset(value, 0, qs->map.value_size); 149 ptr = &qs->elements[index * qs->map.value_size]; 150 memcpy(value, ptr, qs->map.value_size); [all...] |
H A D | bloom_filter.c | 31 u32 value_size, u32 index) 39 h = jhash(value, value_size, bloom->hash_seed + index); 51 h = hash(bloom, value, map->value_size, i); 69 h = hash(bloom, value, map->value_size, i); 100 if (attr->key_size != 0 || attr->value_size == 0 || 156 if ((attr->value_size & (sizeof(u32) - 1)) == 0) 158 attr->value_size / sizeof(u32); 30 hash(struct bpf_bloom_filter *bloom, void *value, u32 value_size, u32 index) argument
|
H A D | map_iter.c | 105 u32 key_acc_size, value_acc_size, key_size, value_size; local 130 value_size = map->value_size; 132 value_size = round_up(map->value_size, 8) * num_possible_cpus(); 134 if (key_acc_size > key_size || value_acc_size > value_size) {
|
/linux-master/tools/testing/selftests/bpf/map_tests/ |
H A D | array_map_batch_ops.c | 75 int err, step, value_size; local 87 value_size = sizeof(__s64); 89 value_size *= nr_cpus; 92 values = calloc(max_entries, value_size); 103 memset(values, 0, max_entries * value_size); 114 values + total * value_size,
|
/linux-master/samples/bpf/ |
H A D | trace_output_kern.c | 10 __uint(value_size, sizeof(u32));
|
/linux-master/tools/bpf/bpftool/skeleton/ |
H A D | profiler.bpf.c | 11 __uint(value_size, sizeof(int)); 18 __uint(value_size, sizeof(struct bpf_perf_event_value)); 25 __uint(value_size, sizeof(struct bpf_perf_event_value)); 32 __uint(value_size, sizeof(u64));
|
/linux-master/drivers/md/persistent-data/ |
H A D | dm-btree-internal.h | 35 __le32 value_size; member in struct:node_header 120 uint32_t value_size = le32_to_cpu(n->header.value_size); local 121 return value_base(n) + (value_size * index);
|