| 1 |
// the current register allocation algorithm cannot find an allocation |
| 2 |
// for this sequence operations. |
| 3 |
global res |
| 4 |
probe begin { |
| 5 |
printf("BEGIN\n") |
| 6 |
a = 1 |
| 7 |
b = a |
| 8 |
c = a + b |
| 9 |
d = a + b + c |
| 10 |
e = a + b + c + d |
| 11 |
f = a + b + c + d + e |
| 12 |
g = a + b + c + d + e + f |
| 13 |
h = a + b + c + d + e + f + g |
| 14 |
i = a + b + c + d + e + f + g + h |
| 15 |
|
| 16 |
res = a == 1 && b == 1 && c == 2 && d == 4 && e == 8 && f == 16 && g == 32 && h == 64 && i == 128 |
| 17 |
} |
| 18 |
|
| 19 |
probe kernel.function("vfs_read") { |
| 20 |
a = 1 |
| 21 |
b = a |
| 22 |
c = a + b |
| 23 |
d = a + b + c |
| 24 |
e = a + b + c + d |
| 25 |
f = a + b + c + d + e |
| 26 |
g = a + b + c + d + e + f |
| 27 |
h = a + b + c + d + e + f + g |
| 28 |
i = a + b + c + d + e + f + g + h |
| 29 |
|
| 30 |
res = res && a == 1 && b == 1 && c == 2 && d == 4 && e == 8 && f == 16 && g == 32 && h == 64 && i == 128 |
| 31 |
exit() |
| 32 |
} |
| 33 |
|
| 34 |
probe end { |
| 35 |
a = 1 |
| 36 |
b = a |
| 37 |
c = a + b |
| 38 |
d = a + b + c |
| 39 |
e = a + b + c + d |
| 40 |
f = a + b + c + d + e |
| 41 |
g = a + b + c + d + e + f |
| 42 |
h = a + b + c + d + e + f + g |
| 43 |
i = a + b + c + d + e + f + g + h |
| 44 |
|
| 45 |
if (res && a == 1 && b == 1 && c == 2 && d == 4 && e == 8 && f == 16 && g == 32 && h == 64 && i == 128) |
| 46 |
printf("END PASS\n") |
| 47 |
else |
| 48 |
printf("END FAIL\n") |
| 49 |
} |