MAX_ENTRIES
entries = min(parm_entries, MAX_ENTRIES);
__uint(max_entries, MAX_CPU * MAX_ENTRIES);
if (delta > MAX_ENTRIES - 1)
delta = MAX_ENTRIES - 1;
key = cpu * MAX_ENTRIES + delta;
long data[MAX_ENTRIES];
for (i = 1; i <= MAX_ENTRIES; i++) {
for (i = 0; i < MAX_ENTRIES; i++) {
key = c * MAX_ENTRIES + i;
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
static unsigned long bpf_map_entries = MAX_ENTRIES;
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
max_entries = MAX_ENTRIES;
static __u8 values[(8 << 10) * MAX_ENTRIES];
keys = calloc(MAX_MAP_KEY_SIZE, MAX_ENTRIES);
for (key = 1; key < MAX_ENTRIES + 1; key++) {
for (key = 1; key < MAX_ENTRIES + 1; key++) {
err = bpf_map__set_max_entries(skel->maps.hash_map, MAX_ENTRIES);
int foo[MAX_ENTRIES];
__uint(max_entries, MAX_ENTRIES);
u32 key = cpu + MAX_ENTRIES;
__uint(max_entries, MAX_ENTRIES);
bpf_loop(MAX_ENTRIES, start_cb, NULL, 0);
bpf_loop(MAX_ENTRIES, overwrite_cb, NULL, 0);
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
_Static_assert(MAX_ENTRIES < LOOP_BOUND, "MAX_ENTRIES must be < LOOP_BOUND");
VERIFY(hash->n_buckets == MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
VERIFY(n_lookups == MAX_ENTRIES);
VERIFY(n_keys == MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
MAX_ENTRIES));
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
MAX_ENTRIES));
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
__uint(max_entries, MAX_ENTRIES);
VERIFY(check(&queue->map, map, 0, sizeof(__u32), MAX_ENTRIES));
__uint(max_entries, MAX_ENTRIES);
VERIFY(check(&stack->map, map, 0, sizeof(__u32), MAX_ENTRIES));
__uint(max_entries, MAX_ENTRIES);
MAX_ENTRIES));
MAX_ENTRIES));
#define HALF_ENTRIES (MAX_ENTRIES >> 1)
int foo[MAX_ENTRIES];
int foo[MAX_ENTRIES];
__imm_const(max_entries, MAX_ENTRIES),
__imm_const(max_entries, MAX_ENTRIES),
__imm_const(__imm_0, (MAX_ENTRIES + 1) << 2),
__imm_const(__imm_0, MAX_ENTRIES + 1),
__imm_const(max_entries, MAX_ENTRIES),
__imm_const(__imm_0, MAX_ENTRIES + 1),
int foo[MAX_ENTRIES];
int foo[MAX_ENTRIES];
int foo[MAX_ENTRIES];
int foo[MAX_ENTRIES];
int foo[MAX_ENTRIES];
int foo[MAX_ENTRIES];
int foo[MAX_ENTRIES];
__imm_const(max_entries, MAX_ENTRIES),
int foo[MAX_ENTRIES];
int foo[MAX_ENTRIES];
int foo[MAX_ENTRIES];
__imm_const(max_entries, MAX_ENTRIES)
int foo[MAX_ENTRIES];
int foo[MAX_ENTRIES];
int foo[MAX_ENTRIES];
__imm_const(__imm_0, MAX_ENTRIES-1),
int foo[MAX_ENTRIES];
int foo[MAX_ENTRIES];