Debian Codegraph @

doc/SystemTap_Beginners_Guide/testsuite/systemtap.bpf/bpf_tests/foreach.stp

raw
1 global a[10], b[10], c[10]
2
3 // PR24811: Be sure to test non-constant iteration limit -- set to 0 in begin.
4 global lim = 1
5
6 probe never {
7 c[0] = 0
8 }
9
10 probe begin {
11 printf("BEGIN\n")
12
13 a[-1] = -1
14 a[0] = 0
15 a[1] = 1
16
17 b[10] = 10
18 b[11] = 11
19 b[12] = 12
20
21 lim = 0
22 exit()
23 }
24
25 probe end {
26 flag = 1
27
28 foreach (k- in a limit -10)
29 flag = 0
30
31 foreach (k- in a limit lim)
32 flag = 0
33
34 foreach (k in c)
35 flag = 0
36
37 foreach (k1 in a)
38 foreach (k2 in c)
39 flag = 0
40
41 foreach (k1 in c)
42 foreach (k2 in a)
43 flag = 0
44
45 foreach (k1 in a limit lim)
46 foreach (k2 in a)
47 flag = 0
48
49 foreach (k1 in a)
50 foreach (k2 in a limit lim)
51 flag = 0
52
53 x = 0
54 foreach (k in a)
55 x += k
56 flag = flag && x == 0
57
58 x = -1
59 foreach (k+ in a)
60 flag = flag && x++ == k && k == a[k]
61 flag = flag && x == 2
62
63 x = 1
64 foreach (k- in a)
65 flag = flag && x-- == k && k == a[k]
66 flag = flag && x == -2
67
68 x = -1
69 y = 12
70 foreach (k1+ in a) {
71 foreach (k2- in b)
72 flag = flag && x == k1 && k1 == a[k1]
73 && y-- == k2 && k2 == b[k2]
74
75 x++
76 y = 12
77 }
78
79 x = -1
80 y = 1
81 foreach (k1+ in a) {
82 foreach (k2- in a)
83 flag = flag && x == k1 && k1 == a[k1]
84 && y-- == k2 && k2 == a[k2]
85 x++
86 y = 1
87 }
88
89 if (flag)
90 printf("END PASS\n")
91 else
92 printf("END FAIL\n")
93 }