Coverage Report

Created: 2026-02-14 06:05

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/lighttpd1.4/src/burl.c
Line
Count
Source
1
/*
2
 * burl - buffer URL normalization
3
 *
4
 * Copyright(c) 2018 Glenn Strauss gstrauss()gluelogic.com  All rights reserved
5
 * License: BSD 3-clause (same as lighttpd)
6
 */
7
#include "first.h"
8
#include "burl.h"
9
10
#include <string.h>
11
12
#include "buffer.h"
13
#include "base64.h"
14
15
static const char hex_chars_uc[] = "0123456789ABCDEF";
16
17
/* everything except: ! $ & ' ( ) * + , - . / 0-9 : ; = ? @ A-Z _ a-z ~ */
18
static const char encoded_chars_http_uri_reqd[] = {
19
  /*
20
  0  1  2  3  4  5  6  7  8  9  A  B  C  D  E  F
21
  */
22
  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,  /*  00 -  0F control chars */
23
  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,  /*  10 -  1F */
24
  1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,  /*  20 -  2F space " # % */
25
  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0,  /*  30 -  3F < > */
26
  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,  /*  40 -  4F */
27
  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0,  /*  50 -  5F [ \ ] ^ */
28
  1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,  /*  60 -  6F ` */
29
  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1,  /*  70 -  7F { | } DEL */
30
  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,  /*  80 -  8F */
31
  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,  /*  90 -  9F */
32
  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,  /*  A0 -  AF */
33
  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,  /*  B0 -  BF */
34
  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,  /*  C0 -  CF */
35
  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,  /*  D0 -  DF */
36
  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,  /*  E0 -  EF */
37
  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,  /*  F0 -  FF */
38
};
39
40
41
/* c (char) and n (nibble) MUST be unsigned integer types */
42
#define li_cton(c,n) \
43
51.1M
  (((n) = (c) - '0') <= 9 || (((n) = ((c)&0xdf) - 'A') <= 5 ? ((n) += 10) : 0))
44
45
/* b (byte) MUST be unsigned integer type
46
 * https://en.wikipedia.org/wiki/UTF-8
47
 * detect invalid UTF-8 byte and byte in overlong encoding of 7-bit ASCII
48
 * (but does not detect other invalid/overlong multibyte encoding sequences) */
49
51.0M
#define li_utf8_invalid_byte(b) light_utf8_invalid_byte(b)
50
51
52
static int burl_is_unreserved (const int c)
53
11.6k
{
54
11.6k
    return (light_isalnum(c) || c == '-' || c == '.' || c == '_' || c == '~');
55
11.6k
}
56
57
58
static int burl_normalize_basic_unreserved_fix (buffer *b, buffer *t, int i, int qs)
59
576
{
60
576
    int j = i;
61
576
    const int used = (int)buffer_clen(b);
62
576
    const unsigned char * const s = (unsigned char *)b->ptr;
63
576
    unsigned char * const p =
64
576
      (unsigned char *)buffer_string_prepare_copy(t,i+(used-i)*3+1);
65
576
    unsigned int n1, n2;
66
576
    memcpy(p, s, (size_t)i);
67
24.0M
    for (; i < used; ++i, ++j) {
68
24.0M
        if (!encoded_chars_http_uri_reqd[s[i]]) {
69
2.01M
            p[j] = s[i];
70
2.01M
            if (__builtin_expect( (s[i] == '?'), 0) && -1 == qs) qs = j;
71
2.01M
        }
72
22.0M
        else if (s[i]=='%' && li_cton(s[i+1], n1) && li_cton(s[i+2], n2)) {
73
8.48k
            const unsigned int x = (n1 << 4) | n2;
74
8.48k
            if (burl_is_unreserved(x)) {
75
1.68k
                p[j] = x;
76
1.68k
            }
77
6.80k
            else {
78
6.80k
                p[j]   = '%';
79
6.80k
                p[++j] = hex_chars_uc[n1]; /*(s[i+1] & 0xdf)*/
80
6.80k
                p[++j] = hex_chars_uc[n2]; /*(s[i+2] & 0xdf)*/
81
6.80k
                if (li_utf8_invalid_byte(x)) qs = -2;
82
6.80k
            }
83
8.48k
            i+=2;
84
8.48k
        }
85
21.9M
        else if (s[i] == '#') break; /* ignore fragment */
86
21.9M
        else {
87
21.9M
            p[j]   = '%';
88
21.9M
            p[++j] = hex_chars_uc[(s[i] >> 4) & 0xF];
89
21.9M
            p[++j] = hex_chars_uc[s[i] & 0xF];
90
21.9M
            if (li_utf8_invalid_byte(s[i])) qs = -2;
91
21.9M
        }
92
24.0M
    }
93
576
    buffer_copy_string_len(b, (char *)p, (size_t)j);
94
576
    return qs;
95
576
}
96
97
98
static int burl_normalize_basic_unreserved (buffer *b, buffer *t)
99
748
{
100
748
    const unsigned char * const s = (unsigned char *)b->ptr;
101
748
    const int used = (int)buffer_clen(b);
102
748
    unsigned int n1, n2, x;
103
748
    int qs = -1;
104
105
760k
    for (int i = 0; i < used; ++i) {
106
760k
        if (!encoded_chars_http_uri_reqd[s[i]]) {
107
756k
            if (__builtin_expect( (s[i] == '?'), 0) && -1 == qs) qs = i;
108
756k
        }
109
3.72k
        else if (s[i]=='%' && li_cton(s[i+1], n1) && li_cton(s[i+2], n2)
110
3.19k
                 && !burl_is_unreserved((x = (n1 << 4) | n2))) {
111
3.14k
            if (li_utf8_invalid_byte(x)) qs = -2;
112
3.14k
            if (s[i+1] >= 'a') b->ptr[i+1] &= 0xdf; /* uppercase hex */
113
3.14k
            if (s[i+2] >= 'a') b->ptr[i+2] &= 0xdf; /* uppercase hex */
114
3.14k
            i+=2;
115
3.14k
        }
116
578
        else if (s[i] == '#') { /* ignore fragment */
117
2
            buffer_truncate(b, (size_t)i);
118
2
            break;
119
2
        }
120
576
        else {
121
576
            qs = burl_normalize_basic_unreserved_fix(b, t, i, qs);
122
576
            break;
123
576
        }
124
760k
    }
125
126
748
    return qs;
127
748
}
128
129
130
static int burl_normalize_basic_required_fix (buffer *b, buffer *t, int i, int qs)
131
665
{
132
665
    int j = i;
133
665
    const int used = (int)buffer_clen(b);
134
665
    const unsigned char * const s = (unsigned char *)b->ptr;
135
665
    unsigned char * const p =
136
665
      (unsigned char *)buffer_string_prepare_copy(t,i+(used-i)*3+1);
137
665
    unsigned int n1, n2;
138
665
    int invalid_utf8 = 0;
139
665
    memcpy(p, s, (size_t)i);
140
29.4M
    for (; i < used; ++i, ++j) {
141
29.4M
        if (!encoded_chars_http_uri_reqd[s[i]]) {
142
482k
            p[j] = s[i];
143
482k
            if (__builtin_expect( (s[i] == '?'), 0)) qs = j;
144
482k
        }
145
29.0M
        else if (s[i]=='%' && li_cton(s[i+1], n1) && li_cton(s[i+2], n2)) {
146
19.9k
            const unsigned int x = (n1 << 4) | n2;
147
19.9k
            if (!encoded_chars_http_uri_reqd[x]
148
13.9k
                && (qs < 0
149
13.9k
                    ? (x != '/' && x != '?')
150
13.9k
                    : (x != '&' && x != '=' && x != ';' && x != '+'))) {
151
2.18k
                p[j] = x;
152
2.18k
            }
153
17.8k
            else {
154
17.8k
                p[j]   = '%';
155
17.8k
                p[++j] = hex_chars_uc[n1]; /*(s[i+1] & 0xdf)*/
156
17.8k
                p[++j] = hex_chars_uc[n2]; /*(s[i+2] & 0xdf)*/
157
17.8k
                invalid_utf8 |= li_utf8_invalid_byte(x);
158
17.8k
            }
159
19.9k
            i+=2;
160
19.9k
        }
161
28.9M
        else if (s[i] == '#') break; /* ignore fragment */
162
28.9M
        else {
163
28.9M
            p[j]   = '%';
164
28.9M
            p[++j] = hex_chars_uc[(s[i] >> 4) & 0xF];
165
28.9M
            p[++j] = hex_chars_uc[s[i] & 0xF];
166
28.9M
            invalid_utf8 |= li_utf8_invalid_byte(s[i]);
167
28.9M
        }
168
29.4M
    }
169
665
    buffer_copy_string_len(b, (char *)p, (size_t)j);
170
665
    return !invalid_utf8 ? qs : -2;
171
665
}
172
173
174
static int burl_normalize_basic_required (buffer *b, buffer *t)
175
857
{
176
857
    const unsigned char * const s = (unsigned char *)b->ptr;
177
857
    const int used = (int)buffer_clen(b);
178
857
    unsigned int n1, n2, x;
179
857
    int qs = -1;
180
857
    int invalid_utf8 = 0;
181
182
855k
    for (int i = 0; i < used; ++i) {
183
855k
        if (!encoded_chars_http_uri_reqd[s[i]]) {
184
832k
            if (s[i] == '?') qs = i;
185
832k
        }
186
22.3k
        else if (s[i]=='%' && li_cton(s[i+1], n1) && li_cton(s[i+2], n2)
187
21.7k
                 && (encoded_chars_http_uri_reqd[(x = (n1 << 4) | n2)]
188
15.9k
                     || (qs < 0
189
15.9k
                         ? (x == '/' || x == '?')
190
21.7k
                         : (x == '&' || x == '=' || x == ';' || x == '+')))) {
191
21.7k
            invalid_utf8 |= li_utf8_invalid_byte(x);
192
21.7k
            if (s[i+1] >= 'a') b->ptr[i+1] &= 0xdf; /* uppercase hex */
193
21.7k
            if (s[i+2] >= 'a') b->ptr[i+2] &= 0xdf; /* uppercase hex */
194
21.7k
            i+=2;
195
21.7k
        }
196
667
        else if (s[i] == '#') { /* ignore fragment */
197
2
            buffer_truncate(b, (size_t)i);
198
2
            break;
199
2
        }
200
665
        else {
201
665
            qs = burl_normalize_basic_required_fix(b, t, i, qs);
202
665
            break;
203
665
        }
204
855k
    }
205
206
857
    return !invalid_utf8 ? qs : -2;
207
857
}
208
209
210
static int burl_contains_ctrls (const buffer *b)
211
321
{
212
321
    const char * const s = b->ptr;
213
321
    const int used = (int)buffer_clen(b);
214
4.95M
    for (int i = 0; i < used; ++i) {
215
4.95M
        if (s[i] == '%' && (s[i+1] < '2' || (s[i+1] == '7' && s[i+2] == 'F')))
216
82
            return 1;
217
4.95M
    }
218
239
    return 0;
219
321
}
220
221
222
static void burl_normalize_qs20_to_plus_fix (buffer *b, int i)
223
107
{
224
107
    char * const s = b->ptr;
225
107
    const int used = (int)buffer_clen(b);
226
107
    int j = i;
227
15.3M
    for (; i < used; ++i, ++j) {
228
15.3M
        s[j] = s[i];
229
15.3M
        if (s[i] == '%' && s[i+1] == '2' && s[i+2] == '0') {
230
1.46k
            s[j] = '+';
231
1.46k
            i+=2;
232
1.46k
        }
233
15.3M
    }
234
107
    buffer_truncate(b, j);
235
107
}
236
237
238
static void burl_normalize_qs20_to_plus (buffer *b, int qs)
239
394
{
240
394
    const char * const s = b->ptr;
241
394
    const int used = qs < 0 ? 0 : (int)buffer_clen(b);
242
394
    int i;
243
394
    if (qs < 0) return;
244
6.35M
    for (i = qs+1; i < used; ++i) {
245
6.35M
        if (s[i] == '%' && s[i+1] == '2' && s[i+2] == '0') break;
246
6.35M
    }
247
394
    if (i != used) burl_normalize_qs20_to_plus_fix(b, i);
248
394
}
249
250
251
static int burl_normalize_2F_to_slash_fix (buffer *b, int qs, int i)
252
185
{
253
185
    char * const s = b->ptr;
254
185
    const int blen = (int)buffer_clen(b);
255
185
    const int used = qs < 0 ? blen : qs;
256
185
    int j = i;
257
18.0M
    for (; i < used; ++i, ++j) {
258
18.0M
        s[j] = s[i];
259
18.0M
        if (s[i] == '%' && s[i+1] == '2' && s[i+2] == 'F') {
260
3.27k
            s[j] = '/';
261
3.27k
            i+=2;
262
3.27k
        }
263
18.0M
    }
264
185
    if (qs >= 0) {
265
65
        const int qslen = blen - qs;
266
65
        memmove(s+j, s+qs, (size_t)qslen);
267
65
        qs = j;
268
65
        j += qslen;
269
65
    }
270
185
    buffer_truncate(b, j);
271
185
    return qs;
272
185
}
273
274
275
static int burl_normalize_2F_to_slash (buffer *b, int qs, int flags)
276
1.15k
{
277
    /*("%2F" must already have been uppercased during normalization)*/
278
1.15k
    const char * const s = b->ptr;
279
1.15k
    const int used = qs < 0 ? (int)buffer_clen(b) : qs;
280
64.2M
    for (int i = 0; i < used; ++i) {
281
64.2M
        if (s[i] == '%' && s[i+1] == '2' && s[i+2] == 'F') {
282
190
            return (flags & HTTP_PARSEOPT_URL_NORMALIZE_PATH_2F_DECODE)
283
190
              ? burl_normalize_2F_to_slash_fix(b, qs, i)
284
190
              : -2; /*(flags & HTTP_PARSEOPT_URL_NORMALIZE_PATH_2F_REJECT)*/
285
190
        }
286
64.2M
    }
287
969
    return qs;
288
1.15k
}
289
290
291
static int burl_normalize_path (buffer *b, buffer *t, int qs, int flags)
292
1.17k
{
293
1.17k
    const unsigned char * const s = (unsigned char *)b->ptr;
294
1.17k
    const int used = (int)buffer_clen(b);
295
1.17k
    int path_simplify = 0;
296
7.71k
    for (int i = 0, len = qs < 0 ? used : qs; i < len; ++i) {
297
6.94k
        if (s[i] == '.' && (s[i+1] != '.' || ++i)
298
3.25k
            && (s[i+1] == '/' || s[i+1] == '?' || s[i+1] == '\0')) {
299
238
            path_simplify = 1;
300
238
            break;
301
238
        }
302
53.7M
        while (i < len && s[i] != '/') ++i;
303
6.70k
        if (s[i] == '/' && s[i+1] == '/') { /*(s[len] != '/')*/
304
167
            path_simplify = 1;
305
167
            break;
306
167
        }
307
6.70k
    }
308
309
1.17k
    if (path_simplify) {
310
405
        if (flags & HTTP_PARSEOPT_URL_NORMALIZE_PATH_DOTSEG_REJECT) return -2;
311
392
        if (qs >= 0) {
312
142
            buffer_copy_string_len(t, b->ptr+qs, used - qs);
313
142
            buffer_truncate(b, qs);
314
142
        }
315
316
392
        buffer_path_simplify(b);
317
318
392
        if (qs >= 0) {
319
142
            qs = (int)buffer_clen(b);
320
142
            buffer_append_string_len(b, BUF_PTR_LEN(t));
321
142
        }
322
392
    }
323
324
1.15k
    return qs;
325
1.17k
}
326
327
328
__attribute_cold__
329
__attribute_noinline__
330
__attribute_pure__
331
402
static int burl_scan_qmark (const buffer * const b) {
332
402
    const char * const qmark = strchr(b->ptr, '?');
333
402
    return qmark ? (int)(qmark - b->ptr) : -1;
334
402
}
335
336
337
int burl_normalize (buffer *b, buffer *t, int flags)
338
1.60k
{
339
1.60k
    int qs;
340
341
  #if defined(_WIN32) || defined(__CYGWIN__)
342
    /* Windows and Cygwin treat '\\' as '/' if '\\' is present in path;
343
     * convert to '/' for consistency before percent-encoding
344
     * normalization which will convert '\\' to "%5C" in the URL.
345
     * (Clients still should not be sending '\\' unencoded in requests.) */
346
    if (flags & HTTP_PARSEOPT_URL_NORMALIZE_PATH_BACKSLASH_TRANS) {
347
        for (char *p = b->ptr; *p != '?' && *p != '\0'; ++p) {
348
            if (*p == '\\') *p = '/';
349
        }
350
    }
351
  #endif
352
353
1.60k
    qs = (flags & HTTP_PARSEOPT_URL_NORMALIZE_REQUIRED)
354
1.60k
      ? burl_normalize_basic_required(b, t)
355
1.60k
      : burl_normalize_basic_unreserved(b, t);
356
1.60k
    if (-2 == qs) {
357
514
        if (flags & HTTP_PARSEOPT_URL_NORMALIZE_INVALID_UTF8_REJECT) return -2;
358
402
        qs = burl_scan_qmark(b);
359
402
    }
360
361
1.49k
    if (flags & HTTP_PARSEOPT_URL_NORMALIZE_CTRLS_REJECT) {
362
321
        if (burl_contains_ctrls(b)) return -2;
363
321
    }
364
365
1.41k
    if (flags & (HTTP_PARSEOPT_URL_NORMALIZE_PATH_2F_DECODE
366
1.41k
                |HTTP_PARSEOPT_URL_NORMALIZE_PATH_2F_REJECT)) {
367
1.15k
        qs = burl_normalize_2F_to_slash(b, qs, flags);
368
1.15k
        if (-2 == qs) return -2;
369
1.15k
    }
370
371
1.40k
    if (flags & (HTTP_PARSEOPT_URL_NORMALIZE_PATH_DOTSEG_REMOVE
372
1.40k
                |HTTP_PARSEOPT_URL_NORMALIZE_PATH_DOTSEG_REJECT)) {
373
1.17k
        qs = burl_normalize_path(b, t, qs, flags);
374
1.17k
        if (-2 == qs) return -2;
375
1.17k
    }
376
377
1.39k
    if (flags & HTTP_PARSEOPT_URL_NORMALIZE_QUERY_20_PLUS) {
378
846
        if (qs >= 0) burl_normalize_qs20_to_plus(b, qs);
379
846
    }
380
381
1.39k
    return qs;
382
1.40k
}
383
384
385
static void burl_append_encode_nde (buffer * const b, const char * const str, const size_t len)
386
0
{
387
    /* percent-encodes everything except unreserved  - . 0-9 A-Z _ a-z ~
388
     * unless already percent-encoded (does not double-encode) */
389
    /* Note: not checking for invalid UTF-8 */
390
0
    char * const p = buffer_string_prepare_append(b, len*3);
391
0
    unsigned int n1, n2;
392
0
    int j = 0;
393
0
    for (unsigned int i = 0; i < len; ++i, ++j) {
394
0
        if (str[i]=='%' && li_cton(str[i+1], n1) && li_cton(str[i+2], n2)) {
395
0
            const unsigned int x = (n1 << 4) | n2;
396
0
            if (burl_is_unreserved((int)x)) {
397
0
                p[j] = (char)x;
398
0
            }
399
0
            else { /* leave UTF-8, control chars, and required chars encoded */
400
0
                p[j]   = '%';
401
0
                p[++j] = str[i+1];
402
0
                p[++j] = str[i+2];
403
0
            }
404
0
            i+=2;
405
0
        }
406
0
        else if (burl_is_unreserved(str[i])) {
407
0
            p[j] = str[i];
408
0
        }
409
0
        else {
410
0
            p[j]   = '%';
411
0
            p[++j] = hex_chars_uc[(str[i] >> 4) & 0xF];
412
0
            p[++j] = hex_chars_uc[str[i] & 0xF];
413
0
        }
414
0
    }
415
0
    buffer_commit(b, j);
416
0
}
417
418
419
static void burl_append_encode_psnde (buffer * const b, const char * const str, const size_t len)
420
0
{
421
    /* percent-encodes everything except unreserved  - . 0-9 A-Z _ a-z ~ plus /
422
     * unless already percent-encoded (does not double-encode) */
423
    /* Note: not checking for invalid UTF-8 */
424
0
    char * const p = buffer_string_prepare_append(b, len*3);
425
0
    unsigned int n1, n2;
426
0
    int j = 0;
427
0
    for (unsigned int i = 0; i < len; ++i, ++j) {
428
0
        if (str[i]=='%' && li_cton(str[i+1], n1) && li_cton(str[i+2], n2)) {
429
0
            const unsigned int x = (n1 << 4) | n2;
430
0
            if (burl_is_unreserved((int)x)) {
431
0
                p[j] = (char)x;
432
0
            }
433
0
            else { /* leave UTF-8, control chars, and required chars encoded */
434
0
                p[j]   = '%';
435
0
                p[++j] = str[i+1];
436
0
                p[++j] = str[i+2];
437
0
            }
438
0
            i+=2;
439
0
        }
440
0
        else if (burl_is_unreserved(str[i]) || str[i] == '/') {
441
0
            p[j] = str[i];
442
0
        }
443
0
        else {
444
0
            p[j]   = '%';
445
0
            p[++j] = hex_chars_uc[(str[i] >> 4) & 0xF];
446
0
            p[++j] = hex_chars_uc[str[i] & 0xF];
447
0
        }
448
0
    }
449
0
    buffer_commit(b, j);
450
0
}
451
452
453
static void burl_append_encode_all (buffer * const b, const char * const str, const size_t len)
454
0
{
455
    /* percent-encodes everything except unreserved  - . 0-9 A-Z _ a-z ~
456
     * Note: double-encodes any existing '%') */
457
    /* Note: not checking for invalid UTF-8 */
458
0
    char * const p = buffer_string_prepare_append(b, len*3);
459
0
    int j = 0;
460
0
    for (unsigned int i = 0; i < len; ++i, ++j) {
461
0
        if (burl_is_unreserved(str[i])) {
462
0
            p[j] = str[i];
463
0
        }
464
0
        else {
465
0
            p[j]   = '%';
466
0
            p[++j] = hex_chars_uc[(str[i] >> 4) & 0xF];
467
0
            p[++j] = hex_chars_uc[str[i] & 0xF];
468
0
        }
469
0
    }
470
0
    buffer_commit(b, j);
471
0
}
472
473
474
static void burl_offset_tolower (buffer * const b, const size_t off)
475
0
{
476
    /*(skips over all percent-encodings, including encoding of alpha chars)*/
477
0
    for (char *p = b->ptr+off; p[0]; ++p) {
478
0
        if (light_isupper(p[0])) p[0] |= 0x20;
479
0
        else if (p[0]=='%' && light_isxdigit(p[1]) && light_isxdigit(p[2]))
480
0
            p+=2;
481
0
    }
482
0
}
483
484
485
static void burl_offset_toupper (buffer * const b, const size_t off)
486
0
{
487
    /*(skips over all percent-encodings, including encoding of alpha chars)*/
488
0
    for (char *p = b->ptr+off; p[0]; ++p) {
489
0
        if (light_islower(p[0])) p[0] &= 0xdf;
490
0
        else if (p[0]=='%' && light_isxdigit(p[1]) && light_isxdigit(p[2]))
491
0
            p+=2;
492
0
    }
493
0
}
494
495
496
void burl_append (buffer * const b, const char * const str, const size_t len, const int flags)
497
0
{
498
0
    size_t off = 0;
499
500
0
    if (0 == len) return;
501
502
0
    if (0 == flags) {
503
0
        buffer_append_string_len(b, str, len);
504
0
        return;
505
0
    }
506
507
0
    if (flags & (BURL_TOUPPER|BURL_TOLOWER)) off = buffer_clen(b);
508
509
0
    if (flags & BURL_ENCODE_NONE) {
510
0
        buffer_append_string_len(b, str, len);
511
0
    }
512
0
    else if (flags & BURL_ENCODE_ALL) {
513
0
        burl_append_encode_all(b, str, len);
514
0
    }
515
0
    else if (flags & BURL_ENCODE_NDE) {
516
0
        burl_append_encode_nde(b, str, len);
517
0
    }
518
0
    else if (flags & BURL_ENCODE_PSNDE) {
519
0
        burl_append_encode_psnde(b, str, len);
520
0
    }
521
0
    else if (flags & BURL_ENCODE_B64U) {
522
0
        const unsigned char *s = (const unsigned char *)str;
523
0
        buffer_append_base64_encode_no_padding(b, s, len, BASE64_URL);
524
0
    }
525
0
    else if (flags & BURL_DECODE_B64U) {
526
0
        buffer_append_base64_decode(b, str, len, BASE64_URL);
527
0
    }
528
529
    /* note: not normalizing str, which could come from arbitrary header,
530
     * so it is possible that alpha chars are percent-encoded upper/lowercase */
531
0
    if (flags & (BURL_TOLOWER|BURL_TOUPPER)) {
532
0
        (flags & BURL_TOLOWER)
533
0
          ? burl_offset_tolower(b, off)  /*(flags & BURL_TOLOWER)*/
534
0
          : burl_offset_toupper(b, off); /*(flags & BURL_TOUPPER)*/
535
0
    }
536
0
}