Home
last modified time | relevance | path

Searched refs:can_loop (Results 1 – 11 of 11) sorted by relevance

/tools/testing/selftests/bpf/progs/
A Dverifier_may_goto_2.c16 for (i = 0; i < 3 && can_loop; i++) in may_goto_c_code()
19 for (i = 0; i < 3 && can_loop; i++) in may_goto_c_code()
22 for (i = 0; i < 3 && can_loop; i++) in may_goto_c_code()
A Darena_htab.c40 for (i = zero; i < 100000 && can_loop; i++) { in arena_htab_llvm()
46 for (i = zero; i < 1000 && can_loop; i++) { in arena_htab_llvm()
A Dverifier_iterating_callbacks.c463 for (i = zero; i < ARR_SZ && can_loop; i++) in cond_break1()
481 for (i = zero; i < 1000 && can_loop; i++) in cond_break2()
493 for (i = zero; i <= 1000000 && can_loop; i++) in loop()
618 for (i = 0; i < ARR_LONG_SZ && can_loop; i++) in test1()
629 for (i = zero; i < ARR_LONG_SZ && can_loop; i++) { in test2()
648 for (i = zero; i < ARR_LONG_SZ && can_loop; i++) { in test3()
662 for (i = zero + ARR_LONG_SZ - 1; i < ARR_LONG_SZ && i >= 0 && can_loop; i--) { in test4()
A Dstream.c43 while (can_loop) in stream_cond_break()
A Dmptcp_bpf.h29 !list_entry_is_head(pos, head, member) && can_loop; \
A Darena_list.c53 for (i = zero; i < cnt && can_loop; i++) { in arena_list_add()
A Dverifier_arena_large.c89 for (i = 0; i < len && can_loop; i++) in access_reserved()
92 for (i = 0; i < len && can_loop; i++) { in access_reserved()
A Drbtree_search.c60 for (i = zero; i < NR_NODES && can_loop; i++) { in rbtree_search()
82 while (can_loop) { in rbtree_search()
A Dlinked_list_peek.c43 for (i = zero; i < NR_NODES && can_loop; i++) { in list_peek()
/tools/testing/selftests/bpf/
A Dbpf_arena_list.h32 #define can_loop true macro
40 pos && ({ ___tmp = (void *)pos->member.next; 1; }) && can_loop; \
A Dbpf_experimental.h360 #define can_loop \ macro
381 #define can_loop \ macro
407 #define can_loop \ macro

Completed in 16 milliseconds