| line |
true |
false |
branch |
|
31
|
0 |
1084 |
const char add = (upper_case ? 'A' - 10 : 'a' - 10); |
|
33
|
411 |
673 |
*dest++ = (c > 9 ? c + add : c + '0'); |
|
35
|
402 |
682 |
*dest++ = (c > 9 ? c + add : c + '0'); |
|
49
|
1084 |
41 |
while (len-- > 0) { |
|
65
|
0 |
8 |
const char a = (upper_case ? 'A' : 'a'); |
|
69
|
252 |
8 |
while (src < e) { |
|
70
|
128 |
124 |
if (shift > 3) { |
|
74
|
123 |
5 |
if (src + 1 < e) |
|
80
|
28 |
96 |
if (shift == 0) src++; |
|
82
|
181 |
71 |
*dest++ = ( word < 26 ? word + a : word + '2' - 26 ); |
|
101
|
11 |
1 |
while (src < e) { |
|
102
|
6 |
5 |
if (shift > 2) { |
|
106
|
5 |
1 |
if (src + 1 < e) |
|
112
|
2 |
3 |
if (shift == 0) src++; |
|
114
|
10 |
1 |
*dest++ = ( word < 52 ? (word < 26 ? word + 'A' : word - 26 + 'a') : tail[word - 52]); |
|
|
4 |
6 |
*dest++ = ( word < 52 ? (word < 26 ? word + 'A' : word - 26 + 'a') : tail[word - 52]); |
|
116
|
1 |
0 |
if (shift > 0) { |
|
118
|
0 |
1 |
if (shift == 4) *dest++ = '='; |
|
137
|
1 |
1 |
if (!dst) { |
|
139
|
1 |
7 |
for (len = 0; *name; name++) len += (IS_GOOD_URL_CHAR(*name) ? 1 : 3); |
|
|
1 |
0 |
for (len = 0; *name; name++) len += (IS_GOOD_URL_CHAR(*name) ? 1 : 3); |
|
|
8 |
1 |
for (len = 0; *name; name++) len += (IS_GOOD_URL_CHAR(*name) ? 1 : 3); |
|
143
|
8 |
1 |
for (start = dst; *name; name++) { |
|
144
|
1 |
7 |
if ( IS_GOOD_URL_CHAR(*name) ) { |
|
|
1 |
0 |
if ( IS_GOOD_URL_CHAR(*name) ) { |
|
169
|
0 |
9 |
if (dst == NULL) { |
|
171
|
0 |
0 |
if (number == 0) return 1; |
|
172
|
0 |
0 |
for (length = 0; number != 0; number /= 10) length++; |
|
178
|
0 |
9 |
if (number == 0) { |
|
181
|
46 |
0 |
for (; p >= buf && number != 0; number /= 10) { |
|
|
37 |
9 |
for (; p >= buf && number != 0; number /= 10) { |