Debian Codegraph @

doc/SystemTap_Beginners_Guide/testsuite/systemtap.maps/foreach_limit.stp

raw
1 global array, agg
2
3 probe begin
4 {
5 #
6 # Array section
7 #
8 printf("\nArrays:\n");
9
10 # Add elements to the array, but in an unsorted order
11 array[9] = 18;
12 array[1] = 40
13 array[8] = 16
14 array[2] = 4
15 array[7] = 14
16 array[3] = 36
17 array[6] = 12;
18 array[5] = 10;
19 array[4] = 8;
20 array[10] = 20;
21
22 # Print the unsorted array
23 printf("unsorted:\n");
24 foreach (key in array)
25 printf("key %d, value %d\n", key, array[key]);
26
27 # Print the first 5 unsorted array items
28 printf("\nunsorted limit 5:\n");
29 i = 0
30 foreach (key in array limit 5)
31 {
32 printf("key %d, value %d\n", key, array[key]);
33 i++;
34 }
35 printf("loop had %d iterations\n", i);
36
37 # Print the first 5 sorted array items (by value)
38 printf("\nsorted (by values) limit 5:\n");
39 i = 0
40 foreach (key in array+ limit 5)
41 {
42 printf("key %d, value %d\n", key, array[key]);
43 i++;
44 }
45 printf("loop had %d iterations\n", i);
46
47 # Print the first 5 sorted array items (by key)
48 printf("\nsorted (by keys) limit 5:\n");
49 i = 0
50 foreach (key+ in array limit 5)
51 {
52 printf("key %d, value %d\n", key, array[key]);
53 i++;
54 }
55 printf("loop had %d iterations\n", i);
56
57 # Use a variable reference to limit the loop iteration
58 x = 3
59 printf("\nsorted (by values) limit x (%d):\n", x);
60 i = 0
61 foreach (key in array+ limit x)
62 {
63 printf("key %d, value %d\n", key, array[key])
64 i++;
65 }
66 printf("loop had %d iterations\n", i);
67
68 # Use a expression containing a variable reference to limit the
69 # loop iteration
70 printf("\nsorted (by values) limit x * 2 (%d):\n", (x * 2));
71 i = 0
72 foreach (key in array+ limit x * 2)
73 {
74 printf("key %d, value %d\n", key, array[key])
75 i++;
76 }
77 printf("loop had %d iterations\n", i);
78
79 # Ensure the expression is only evaluated once
80 printf("\nsorted (by values) limit ++x:\n");
81 i = 0
82 foreach (key in array+ limit ++x)
83 {
84 printf("key %d, value %d\n", key, array[key])
85 i++;
86 }
87 printf("loop had %d iterations\n", i);
88 printf("x ended up as %d\n", x);
89
90 # Ensure the expression is only evaluated once
91 printf("\nsorted (by values) limit x++:\n");
92 i = 0
93 foreach (key in array+ limit x++)
94 {
95 printf("key %d, value %d\n", key, array[key])
96 i++;
97 }
98 printf("loop had %d iterations\n", i);
99 printf("x ended up as %d\n", x);
100
101 # Use array index (PR17860)
102 printf("\nsorted (by values) with key specified limit x++:\n");
103 i = 0
104 foreach (key in array[++x]+ limit x)
105 {
106 printf("key %d, value %d\n", key, array[key])
107 i++;
108 }
109 printf("loop had %d iterations\n", i);
110 printf("x ended up as %d\n", x);
111
112 #
113 # Aggregate section
114 #
115 printf("\nAggregates:\n");
116
117 # Add items to the aggregate
118 # 10 keys, 15 entries each = 150 entries.
119 # min = 4, max = 15 * 40 = 600
120 foreach (key in array)
121 {
122 agg <<< array[key]
123 agg <<< array[key] * 2
124 agg <<< array[key] * 3
125 agg <<< array[key] * 4
126 agg <<< array[key] * 5
127 agg <<< array[key] * 6
128 agg <<< array[key] * 7
129 agg <<< array[key] * 8
130 agg <<< array[key] * 9
131 agg <<< array[key] * 10
132 agg <<< array[key] * 11
133 agg <<< array[key] * 12
134 agg <<< array[key] * 13
135 agg <<< array[key] * 14
136 agg <<< array[key] * 15
137 }
138
139 printf("count=%d sum=%d\n", @count(agg), @sum(agg))
140 printf("min=%d max=%d\n", @min(agg), @max(agg))
141 print(@hist_log(agg))
142
143 # This is useless, but test anyway. Maybe it will
144 # trigger some obscure edge condition.
145 # log buckets run from 0 to 127.
146 i = 0
147 foreach (bucket in @hist_log(agg) limit 71)
148 {
149 if (@hist_log(agg)[bucket])
150 printf("bucket %d: %d\n", bucket, @hist_log(agg)[bucket]);
151 i++;
152 }
153 printf("loop had %d iterations\n", i);
154
155 printf("\nDone.\n");
156 exit()
157 }