| line |
true |
false |
branch |
|
12
|
4 |
0 |
if (length > 0) { |
|
16
|
1 |
3 |
if (bn->number[length-1] & 0x80) { |
|
18
|
11 |
1 |
for (i = 0; i < bn->length; i++) { |
|
41
|
1 |
4 |
if (string[pos] == '-') { |
|
44
|
0 |
4 |
} else if (string[pos] == '+') { |
|
48
|
219 |
5 |
for (; pos < length; pos++) { |
|
56
|
170 |
0 |
if (bn->number) |
|
88
|
2951 |
152 |
while (i > 0) { |
|
110
|
2357 |
219 |
while (i < n->length) { |
|
116
|
86 |
133 |
if (temp) { |
|
117
|
0 |
86 |
assert(temp < 256); |
|
129
|
195 |
26 |
if (!carry) |
|
131
|
32 |
0 |
for (i = 0; i < n->length; i++) { |
|
132
|
26 |
6 |
if (n->number[i] < 256-carry) { |
|
148
|
0 |
160 |
if (n->length == 1 && n->number[0] == 0) |
|
|
0 |
0 |
if (n->length == 1 && n->number[0] == 0) |
|
150
|
545 |
4 |
for (i = 0; i < n->length; i++) { |
|
151
|
156 |
389 |
if (n->number[i] != 0) |
|
175
|
0 |
4 |
if (cc_bignum_is_zero(bn)) { |
|
178
|
0 |
0 |
assert(outlen >= 2); |
|
188
|
152 |
4 |
while (!cc_bignum_is_zero(&cur)) { |
|
194
|
0 |
152 |
assert(i < tmp_buf_len); |
|
197
|
1 |
3 |
if (bn->is_negative) |
|
200
|
0 |
4 |
assert(i < outlen); |
|
202
|
153 |
4 |
for (j = 0; j < i; j++) { |
|
217
|
0 |
5 |
assert(copy.length < outlen); |
|
219
|
1 |
4 |
if (copy.is_negative) { |
|
221
|
10 |
1 |
for (i = 0; i < copy.length; i++) { |
|
233
|
8 |
0 |
while (needed_bytes > 1) { |
|
234
|
5 |
3 |
if (out[needed_bytes-1] == out[copy.length]) { |
|
235
|
3 |
2 |
if ((out[needed_bytes-1]&0x80) == (out[needed_bytes-2]&0x80)) { |