Home
last modified time | relevance | path

Searched refs:MAX_NUM (Results 1 – 25 of 64) sorted by relevance

123

/dports/net/bird2/bird-2.0.8/lib/
H A Dlists_test.c12 #define MAX_NUM 1000 macro
14 static node nodes[MAX_NUM];
26 for (i = 0; i < MAX_NUM; i++) in show_list()
43 for (i = 0; i < MAX_NUM; i++) in is_filled_list_well_linked()
45 if (i < (MAX_NUM-1)) in is_filled_list_well_linked()
64 for (i = 0; i < MAX_NUM; i++) in is_empty_list_well_unlinked()
129 if (i < MAX_NUM-1) in t_add_head()
204 int tail_node_index = (MAX_NUM % 2) ? MAX_NUM - 2 : MAX_NUM - 1; in t_remove_node()
239 inside = nodes[MAX_NUM/2]; in t_update_node()
246 tail = nodes[MAX_NUM-1]; in t_update_node()
[all …]
H A Dbuffer_test.c15 #define MAX_NUM 33 macro
18 static int expected[MAX_NUM];
37 for (i = 0; i < MAX_NUM; i++) in fill_expected_array()
55 for (i = 0; i < MAX_NUM; i++) in is_buffer_as_expected()
68 for (i = 0; i < MAX_NUM; i++) in t_buffer_push()
84 for (i = 0; i < MAX_NUM; i++) in t_buffer_pop()
86 for (i = MAX_NUM-1; i >= MAX_NUM/2; i--) in t_buffer_pop()
88 for (i = MAX_NUM/2; i < MAX_NUM; i++) in t_buffer_pop()
96 for (i = 0; i < MAX_NUM; i++) in t_buffer_pop()
112 for (i = 0; i < MAX_NUM; i++) in t_buffer_resize()
[all …]
H A Dslist_test.c13 #define MAX_NUM 1000 macro
15 static snode nodes[MAX_NUM];
28 for (i = 0; i < MAX_NUM; i++) in show_list()
42 for (i = 0; i < MAX_NUM; i++) in is_filled_list_well_linked()
44 if (i < (MAX_NUM-1)) in is_filled_list_well_linked()
71 for (i = 0; i < MAX_NUM; i++) in init_list__()
90 for (i = 0; i < MAX_NUM; i++) in t_add_tail()
121 if (i < MAX_NUM-1) in t_add_head()
168 for (i = 0; i < MAX_NUM; i++) in fill_list2()
197 int tail_node_index = (MAX_NUM % 2) ? MAX_NUM - 2 : MAX_NUM - 1; in t_remove_node()
[all …]
H A Dchecksum_test.c15 #define MAX_NUM 10000 macro
23 for(i = 0; i < MAX_NUM; i++) in ipsum_calculate_expected()
46 u32 a[MAX_NUM]; in t_calculate()
49 for (i = 0; i < MAX_NUM; i++) in t_calculate()
53 …culated_2 = ipsum_calculate(&a[0], sizeof(u32)*(MAX_NUM/2), &a[MAX_NUM/2], sizeof(u32)*(MAX_NUM - … in t_calculate()
69 u32 a[MAX_NUM+1]; in t_verify()
72 for (i = 0; i < MAX_NUM; i++) in t_verify()
77 a[MAX_NUM] = sum; in t_verify()
H A Dhash_test.c35 struct test_node nodes[MAX_NUM];
43 for (i = 0; i < MAX_NUM; i++) in print_rate_of_fulfilment()
56 for (i = 0; i < MAX_NUM; i++) in dump_nodes()
70 for (i = 0; i < MAX_NUM; i++) in init_hash_()
90 for (i = 0; i < MAX_NUM; i++) in validate_filled_hash()
104 for (i = 0; i < MAX_NUM; i++) in validate_empty_hash()
117 for (i = 0; i < MAX_NUM; i++) in fill_hash()
142 for (i = 0; i < MAX_NUM; i++) in t_insert_find_random()
161 for (i = 0; i < MAX_NUM; i++) in t_insert2_find()
181 uint check[MAX_NUM]; in t_walk()
[all …]
H A Dbitmap_test.c14 #define MAX_NUM (1 << 20) macro
30 char expected[MAX_NUM] = {}; in t_bmap_set_clear_random()
35 do n = bt_random() % MAX_NUM; in t_bmap_set_clear_random()
44 do n = bt_random() % MAX_NUM; in t_bmap_set_clear_random()
51 for (i = 0; i < MAX_NUM; i++) in t_bmap_set_clear_random()
66 char expected[MAX_NUM] = {}; in t_hmap_set_clear_random()
91 for (i = 0; i < MAX_NUM; i++) in t_hmap_set_clear_random()
99 bt_assert(n <= MAX_NUM); in t_hmap_set_clear_random()
104 if (n == MAX_NUM) in t_hmap_set_clear_random()
125 char expected[MAX_NUM] = {}; in t_hmap_set_clear_fill()
[all …]
H A Dheap_test.c13 #define MAX_NUM 1000 macro
24 static int heap[MAX_NUM+1];
37 if (num > MAX_NUM) in is_heap_valid()
65 for (i = 1; i <= MAX_NUM; i++) in init_heap()
76 for (i = MAX_NUM; i >= 1; i--) in t_heap_insert()
79 heap[MAX_NUM - i + 1] = i; in t_heap_insert()
95 for (i = 1; i <= MAX_NUM; i++) in t_heap_increase_decrease()
149 int expected[MAX_NUM+1]; in t_heap_insert_random()
153 for (i = 1; i <= MAX_NUM; i++) in t_heap_insert_random()
161 for (i = 1; i <= MAX_NUM; i++) in t_heap_insert_random()
[all …]
/dports/lang/gcc8/gcc-8.5.0/gcc/testsuite/gcc.dg/tree-ssa/
H A Divopts-lower_base.c6 #define MAX_NUM (256) macro
12 unsigned int count[MAX_NUM]; in sort_pointers()
22 j *= MAX_NUM; in sort_pointers()
40 memset (count, 0, MAX_NUM * sizeof (unsigned int)); in sort_pointers()
48 for (countp = count + 1; countp < count + MAX_NUM; ++countp) in sort_pointers()
/dports/devel/riscv64-gcc/gcc-8.3.0/gcc/testsuite/gcc.dg/tree-ssa/
H A Divopts-lower_base.c6 #define MAX_NUM (256) macro
12 unsigned int count[MAX_NUM]; in sort_pointers()
22 j *= MAX_NUM; in sort_pointers()
40 memset (count, 0, MAX_NUM * sizeof (unsigned int)); in sort_pointers()
48 for (countp = count + 1; countp < count + MAX_NUM; ++countp) in sort_pointers()
/dports/lang/gcc11-devel/gcc-11-20211009/gcc/testsuite/gcc.dg/tree-ssa/
H A Divopts-lower_base.c6 #define MAX_NUM (256) macro
12 unsigned int count[MAX_NUM]; in sort_pointers()
22 j *= MAX_NUM; in sort_pointers()
40 memset (count, 0, MAX_NUM * sizeof (unsigned int)); in sort_pointers()
48 for (countp = count + 1; countp < count + MAX_NUM; ++countp) in sort_pointers()
/dports/lang/gcc10/gcc-10.3.0/gcc/testsuite/gcc.dg/tree-ssa/
H A Divopts-lower_base.c6 #define MAX_NUM (256) macro
12 unsigned int count[MAX_NUM]; in sort_pointers()
22 j *= MAX_NUM; in sort_pointers()
40 memset (count, 0, MAX_NUM * sizeof (unsigned int)); in sort_pointers()
48 for (countp = count + 1; countp < count + MAX_NUM; ++countp) in sort_pointers()
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/testsuite/gcc.dg/tree-ssa/
H A Divopts-lower_base.c6 #define MAX_NUM (256) macro
12 unsigned int count[MAX_NUM]; in sort_pointers()
22 j *= MAX_NUM; in sort_pointers()
40 memset (count, 0, MAX_NUM * sizeof (unsigned int)); in sort_pointers()
48 for (countp = count + 1; countp < count + MAX_NUM; ++countp) in sort_pointers()
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/testsuite/gcc.dg/tree-ssa/
H A Divopts-lower_base.c6 #define MAX_NUM (256) macro
12 unsigned int count[MAX_NUM]; in sort_pointers()
22 j *= MAX_NUM; in sort_pointers()
40 memset (count, 0, MAX_NUM * sizeof (unsigned int)); in sort_pointers()
48 for (countp = count + 1; countp < count + MAX_NUM; ++countp) in sort_pointers()
/dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/testsuite/gcc.dg/tree-ssa/
H A Divopts-lower_base.c6 #define MAX_NUM (256) macro
12 unsigned int count[MAX_NUM]; in sort_pointers()
22 j *= MAX_NUM; in sort_pointers()
40 memset (count, 0, MAX_NUM * sizeof (unsigned int)); in sort_pointers()
48 for (countp = count + 1; countp < count + MAX_NUM; ++countp) in sort_pointers()
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/testsuite/gcc.dg/tree-ssa/
H A Divopts-lower_base.c6 #define MAX_NUM (256) macro
12 unsigned int count[MAX_NUM]; in sort_pointers()
22 j *= MAX_NUM; in sort_pointers()
40 memset (count, 0, MAX_NUM * sizeof (unsigned int)); in sort_pointers()
48 for (countp = count + 1; countp < count + MAX_NUM; ++countp) in sort_pointers()
/dports/lang/gcc9-aux/gcc-9.1.0/gcc/testsuite/gcc.dg/tree-ssa/
H A Divopts-lower_base.c6 #define MAX_NUM (256) macro
12 unsigned int count[MAX_NUM]; in sort_pointers()
22 j *= MAX_NUM; in sort_pointers()
40 memset (count, 0, MAX_NUM * sizeof (unsigned int)); in sort_pointers()
48 for (countp = count + 1; countp < count + MAX_NUM; ++countp) in sort_pointers()
/dports/lang/gcc9-devel/gcc-9-20211007/gcc/testsuite/gcc.dg/tree-ssa/
H A Divopts-lower_base.c6 #define MAX_NUM (256) macro
12 unsigned int count[MAX_NUM]; in sort_pointers()
22 j *= MAX_NUM; in sort_pointers()
40 memset (count, 0, MAX_NUM * sizeof (unsigned int)); in sort_pointers()
48 for (countp = count + 1; countp < count + MAX_NUM; ++countp) in sort_pointers()
/dports/devel/avr-gcc/gcc-10.2.0/gcc/testsuite/gcc.dg/tree-ssa/
H A Divopts-lower_base.c6 #define MAX_NUM (256) macro
12 unsigned int count[MAX_NUM]; in sort_pointers()
22 j *= MAX_NUM; in sort_pointers()
40 memset (count, 0, MAX_NUM * sizeof (unsigned int)); in sort_pointers()
48 for (countp = count + 1; countp < count + MAX_NUM; ++countp) in sort_pointers()
/dports/lang/gnat_util/gcc-6-20180516/gcc/testsuite/gcc.dg/tree-ssa/
H A Divopts-lower_base.c6 #define MAX_NUM (256) macro
12 unsigned int count[MAX_NUM]; in sort_pointers()
22 j *= MAX_NUM; in sort_pointers()
40 memset (count, 0, MAX_NUM * sizeof (unsigned int)); in sort_pointers()
48 for (countp = count + 1; countp < count + MAX_NUM; ++countp) in sort_pointers()
/dports/lang/gcc11/gcc-11.2.0/gcc/testsuite/gcc.dg/tree-ssa/
H A Divopts-lower_base.c6 #define MAX_NUM (256) macro
12 unsigned int count[MAX_NUM]; in sort_pointers()
22 j *= MAX_NUM; in sort_pointers()
40 memset (count, 0, MAX_NUM * sizeof (unsigned int)); in sort_pointers()
48 for (countp = count + 1; countp < count + MAX_NUM; ++countp) in sort_pointers()
/dports/lang/gcc9/gcc-9.4.0/gcc/testsuite/gcc.dg/tree-ssa/
H A Divopts-lower_base.c6 #define MAX_NUM (256) macro
12 unsigned int count[MAX_NUM]; in sort_pointers()
22 j *= MAX_NUM; in sort_pointers()
40 memset (count, 0, MAX_NUM * sizeof (unsigned int)); in sort_pointers()
48 for (countp = count + 1; countp < count + MAX_NUM; ++countp) in sort_pointers()
/dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/testsuite/gcc.dg/tree-ssa/
H A Divopts-lower_base.c6 #define MAX_NUM (256) macro
12 unsigned int count[MAX_NUM]; in sort_pointers()
22 j *= MAX_NUM; in sort_pointers()
40 memset (count, 0, MAX_NUM * sizeof (unsigned int)); in sort_pointers()
48 for (countp = count + 1; countp < count + MAX_NUM; ++countp) in sort_pointers()
/dports/lang/gcc10-devel/gcc-10-20211008/gcc/testsuite/gcc.dg/tree-ssa/
H A Divopts-lower_base.c6 #define MAX_NUM (256) macro
12 unsigned int count[MAX_NUM]; in sort_pointers()
22 j *= MAX_NUM; in sort_pointers()
40 memset (count, 0, MAX_NUM * sizeof (unsigned int)); in sort_pointers()
48 for (countp = count + 1; countp < count + MAX_NUM; ++countp) in sort_pointers()
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/testsuite/gcc.dg/tree-ssa/
H A Divopts-lower_base.c6 #define MAX_NUM (256) macro
12 unsigned int count[MAX_NUM]; in sort_pointers()
22 j *= MAX_NUM; in sort_pointers()
40 memset (count, 0, MAX_NUM * sizeof (unsigned int)); in sort_pointers()
48 for (countp = count + 1; countp < count + MAX_NUM; ++countp) in sort_pointers()
/dports/lang/gcc6-aux/gcc-6-20180516/gcc/testsuite/gcc.dg/tree-ssa/
H A Divopts-lower_base.c6 #define MAX_NUM (256) macro
12 unsigned int count[MAX_NUM]; in sort_pointers()
22 j *= MAX_NUM; in sort_pointers()
40 memset (count, 0, MAX_NUM * sizeof (unsigned int)); in sort_pointers()
48 for (countp = count + 1; countp < count + MAX_NUM; ++countp) in sort_pointers()

123