Debian Codegraph @

doc/SystemTap_Beginners_Guide/testsuite/systemtap.base/optim_arridx.stp

raw
1 global arr1, arr2, arr3, elide_idx1, elide_global_a, elide_global_b
2
3 function fna(a:long) {return a}
4 function fnb(a:long, b:long) {return a+b}
5
6 probe begin {
7 // array indices
8 arr2[elide_idx1 = 1] = 10
9 arr2[idx2 = 2] = 20
10 arr2[elide_i=3] = 30
11 arr2[j=4] = 40
12 arr1[fna(k = 0), k] = 1
13 arr1[b = 1, b] = 2
14 arr1[elide_c = 2,2] = 3
15 fnb(arr3[0] = 4, arr3[0])
16 m = 1
17 for (elide_n=2; m <= 10; m++)
18 arr2[m] = m * 10
19 printf ("%d %d %d %d\n", arr1[0,0], arr2[0], idx2, j)
20
21 // function args
22 aa = fna(elide_aa = 1)
23 bb = fnb(cc = 1, elide_global_a = 2)
24
25 // loop
26 for (elide_bb = 1; bb < 10; bb++)
27 cc += bb
28 for (dd = 1; dd < 10; elide_ee = 1)
29 dd += 1
30
31 // conditional
32 if (elide_ff = 0)
33 elide_ff = 1
34 if (elide_global_b = 1)
35 ee = 1
36
37 // compound assignment
38 cc = elide_gg=dd=5
39
40 // binary expression
41 cc = ((elide_hh = 4) + (cc = 1))
42
43 printf("%d %d %d %d %d\n", aa, bb, cc, dd, ee)
44 exit ()
45 }