| line |
true |
false |
branch |
|
10
|
0 |
7 |
if (n < 2) return; |
|
12
|
14 |
7 |
while (top < n - top) top += top; |
|
14
|
21 |
7 |
for (p = top;p >= 1;p >>= 1) { |
|
16
|
21 |
21 |
while (i + 2 * p <= n) { |
|
17
|
28 |
21 |
for (j = i;j < i + p;++j) |
|
21
|
7 |
21 |
for (j = i;j < n - p;++j) |
|
26
|
21 |
21 |
for (q = top;q > p;q >>= 1) { |
|
27
|
0 |
21 |
if (j != i) for (;;) { |
|
28
|
0 |
0 |
if (j == n - q) goto done; |
|
30
|
0 |
0 |
for (r = q;r > p;r >>= 1) |
|
34
|
0 |
0 |
if (j == i + p) { |
|
39
|
14 |
21 |
while (i + p <= n - q) { |
|
40
|
14 |
14 |
for (j = i;j < i + p;++j) { |
|
42
|
21 |
14 |
for (r = q;r > p;r >>= 1) |
|
50
|
7 |
21 |
while (j < n - q) { |
|
52
|
7 |
7 |
for (r = q;r > p;r >>= 1) |