Debian Codegraph @

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

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