| line |
true |
false |
branch |
|
22
|
2 |
2442 |
if (hint == 0) return 64; |
|
24
|
2442 |
0 |
if (s) { |
|
25
|
71498 |
2442 |
for (i = 0; i < scan; i++) { |
|
32
|
2418 |
24 |
table_heavy = (newlines && pipes >= newlines); |
|
|
71 |
2347 |
table_heavy = (newlines && pipes >= newlines); |
|
35
|
71 |
2371 |
: hint + (hint >> 1) + 64; /* ~1.50\u00d7 */ |
|
47
|
0 |
1 |
SvUPGRADE(sv, SVt_PV); |
|
48
|
1 |
0 |
SvGROW(sv, cap); |
|
|
1 |
0 |
SvGROW(sv, cap); |
|
62
|
0 |
2443 |
SvUPGRADE(sv, SVt_PV); |
|
63
|
2443 |
0 |
SvGROW(sv, cap); |
|
|
2443 |
0 |
SvGROW(sv, cap); |
|
77
|
0 |
82 |
if (want <= cap) { |
|
82
|
82 |
0 |
newcap = cap ? cap : 64; |
|
83
|
82 |
82 |
while (newcap < want) newcap = newcap + (newcap >> 1) + 64; /* 1.5x */ |
|
86
|
82 |
0 |
SvGROW(b->sv, newcap); |
|
|
82 |
0 |
SvGROW(b->sv, newcap); |
|
95
|
2444 |
0 |
if (b->base) b->base[used] = '\0'; |