Debian Codegraph @

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

raw
1 global a[10], b[10]
2
3 // used so the foreach limit expression is NOT a constant, else it's optimized
4 global lim = 1
5
6 probe begin {
7 printf("BEGIN\n")
8
9 a[2] = -2
10 a[1] = -1
11 a[0] = 0
12 a[-1] = 1
13 a[-2] = 2
14
15 b[1] = 1
16 b[0] = 0
17 b[-1] = -1
18
19 lim = 0
20 exit()
21 }
22
23 probe end {
24 flag = 1
25
26 foreach (k1- in a) { // push sorted data for a
27 printf("got %d, should be negative %d\n", k1, a[k1])
28 flag = flag && k1 == (0-a[k1]) // check data for a
29 foreach (k2- in b) { // push sorted data for b
30 printf("got %d, should be exactly %d\n", k2, b[k2])
31 flag = flag && k2 == b[k2] // check data for b
32 foreach (k3- in a limit lim) { // bug -- don't push, pop sorted data for b
33 flag = 0 // should not be invoked
34 } // bug -- after popping, will read sorted data for a on next iteration
35 } // pop sorted data for b, but with bug pops a
36 } // pop sorted data for a, but with bug pops <nada> -- segfault?
37
38 if (flag)
39 printf("END PASS\n")
40 else
41 printf("END FAIL\n")
42 }