1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
|
#include <ccan/foreach/foreach.h>
#include <ccan/tap/tap.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <ccan/foreach/foreach.c>
static int test_int_recursion(unsigned int level)
{
int i, sum = 0;
foreach_int(i, 0, 1, 2, 3, 4) {
sum += i;
if (i > level)
sum += test_int_recursion(i);
}
return sum;
}
static int test_ptr_recursion(const char *level)
{
int sum = 0;
const char *i;
foreach_ptr(i, "0", "1", "2", "3", "4") {
sum += atoi(i);
if (atoi(i) > atoi(level))
sum += test_ptr_recursion(i);
}
return sum;
}
static int count_iters(void)
{
unsigned int count = 0;
#if !HAVE_COMPOUND_LITERALS || !HAVE_FOR_LOOP_DECLARATION
struct iter_info *i;
list_for_each(&iters, i, list)
count++;
#endif
return count;
}
int main(void)
{
int i, j, sum, max_iters;
const char *istr, *jstr;
plan_tests(13);
sum = 0;
foreach_int(i, 0, 1, 2, 3, 4)
foreach_int(j, 0, 1, 2, 3, 4)
sum += i*j;
diag("sum = %i\n", sum);
diag("iters = %i\n", count_iters());
ok1(sum == 100);
ok1(count_iters() <= 2);
/* Same again... reusing iterators. */
sum = 0;
foreach_int(i, 0, 1, 2, 3, 4)
foreach_int(j, 0, 1, 2, 3, 4)
sum += i*j;
diag("sum = %i\n", sum);
diag("iters = %i\n", count_iters());
ok1(sum == 100);
ok1(count_iters() <= 2);
sum = 0;
foreach_ptr(istr, "0", "1", "2", "3", "4")
foreach_ptr(jstr, "0", "1", "2", "3", "4")
sum += atoi(istr)*atoi(jstr);
diag("sum = %i\n", sum);
diag("iters = %i\n", count_iters());
ok1(sum == 100);
ok1(count_iters() <= 2 + 2);
/* Same again... reusing iterators. */
sum = 0;
foreach_ptr(istr, "0", "1", "2", "3", "4")
foreach_ptr(jstr, "0", "1", "2", "3", "4")
sum += atoi(istr)*atoi(jstr);
diag("sum = %i\n", sum);
diag("iters = %i\n", count_iters());
ok1(sum == 100);
ok1(count_iters() <= 2 + 2);
/* Do this twice, second time shouldn't increase iterators. */
for (i = 0; i < 2; i++) {
sum = test_int_recursion(0);
diag("sum = %i\n", sum);
diag("iters = %i\n", count_iters());
ok1(sum == 160);
sum = test_ptr_recursion("0");
diag("sum = %i\n", sum);
diag("iters = %i\n", count_iters());
ok1(sum == 160);
if (i == 0)
max_iters = count_iters();
else
ok1(count_iters() <= max_iters);
}
return exit_status();
}
|
