tools/testing/selftests/bpf/progs/linked_list_peek.c

43

for (i = zero; i < NR_NODES && can_loop; i++) {

tools/testing/selftests/bpf/progs/linked_list_peek.c

74

if (n->key != NR_NODES - 1) {

tools/testing/selftests/bpf/progs/rbtree_search.c

55

struct bpf_rb_node *rb_n, *rb_m, *gc_ns[NR_NODES];

tools/testing/selftests/bpf/progs/rbtree_search.c

56

long lookup_key = NR_NODES / 2;

tools/testing/selftests/bpf/progs/rbtree_search.c

60

for (i = zero; i < NR_NODES && can_loop; i++) {

tools/testing/selftests/bpf/progs/rbtree_search.c

91

if (nr_gc < NR_NODES)

tools/testing/selftests/bpf/progs/rbtree_search_kptr.c

160

int lookup_key = NR_NODES / 2;

tools/testing/selftests/bpf/progs/rbtree_search_kptr.c

161

int lookup_data = NR_NODES / 2;

tools/testing/selftests/bpf/progs/rbtree_search_kptr.c

164

for (i = 0; i < NR_NODES && can_loop; i++) {

tools/testing/selftests/bpf/progs/rbtree_search_kptr.c

53

int lookup_key = NR_NODES / 2;

tools/testing/selftests/bpf/progs/rbtree_search_kptr.c

54

int lookup_data = NR_NODES / 2;

tools/testing/selftests/bpf/progs/rbtree_search_kptr.c

57

for (i = 0; i < NR_NODES && can_loop; i++) {