Coverage Report

Created: 2024-05-18 02:13

/src/libxml2/uri.c
Line
Count
Source (jump to first uncovered line)
1
/**
2
 * uri.c: set of generic URI related routines
3
 *
4
 * Reference: RFCs 3986, 2732 and 2373
5
 *
6
 * See Copyright for the status of this software.
7
 *
8
 * daniel@veillard.com
9
 */
10
11
#define IN_LIBXML
12
#include "libxml.h"
13
14
#include <limits.h>
15
#include <string.h>
16
17
#include <libxml/xmlmemory.h>
18
#include <libxml/uri.h>
19
#include <libxml/globals.h>
20
#include <libxml/xmlerror.h>
21
22
#include "private/error.h"
23
24
/**
25
 * MAX_URI_LENGTH:
26
 *
27
 * The definition of the URI regexp in the above RFC has no size limit
28
 * In practice they are usually relatively short except for the
29
 * data URI scheme as defined in RFC 2397. Even for data URI the usual
30
 * maximum size before hitting random practical limits is around 64 KB
31
 * and 4KB is usually a maximum admitted limit for proper operations.
32
 * The value below is more a security limit than anything else and
33
 * really should never be hit by 'normal' operations
34
 * Set to 1 MByte in 2012, this is only enforced on output
35
 */
36
1.29M
#define MAX_URI_LENGTH 1024 * 1024
37
38
static void
39
xmlURIErrMemory(const char *extra)
40
0
{
41
0
    if (extra)
42
0
        __xmlRaiseError(NULL, NULL, NULL,
43
0
                        NULL, NULL, XML_FROM_URI,
44
0
                        XML_ERR_NO_MEMORY, XML_ERR_FATAL, NULL, 0,
45
0
                        extra, NULL, NULL, 0, 0,
46
0
                        "Memory allocation failed : %s\n", extra);
47
0
    else
48
0
        __xmlRaiseError(NULL, NULL, NULL,
49
0
                        NULL, NULL, XML_FROM_URI,
50
0
                        XML_ERR_NO_MEMORY, XML_ERR_FATAL, NULL, 0,
51
0
                        NULL, NULL, NULL, 0, 0,
52
0
                        "Memory allocation failed\n");
53
0
}
54
55
static void xmlCleanURI(xmlURIPtr uri);
56
57
/*
58
 * Old rule from 2396 used in legacy handling code
59
 * alpha    = lowalpha | upalpha
60
 */
61
5.60G
#define IS_ALPHA(x) (IS_LOWALPHA(x) || IS_UPALPHA(x))
62
63
64
/*
65
 * lowalpha = "a" | "b" | "c" | "d" | "e" | "f" | "g" | "h" | "i" | "j" |
66
 *            "k" | "l" | "m" | "n" | "o" | "p" | "q" | "r" | "s" | "t" |
67
 *            "u" | "v" | "w" | "x" | "y" | "z"
68
 */
69
70
5.60G
#define IS_LOWALPHA(x) (((x) >= 'a') && ((x) <= 'z'))
71
72
/*
73
 * upalpha = "A" | "B" | "C" | "D" | "E" | "F" | "G" | "H" | "I" | "J" |
74
 *           "K" | "L" | "M" | "N" | "O" | "P" | "Q" | "R" | "S" | "T" |
75
 *           "U" | "V" | "W" | "X" | "Y" | "Z"
76
 */
77
2.61G
#define IS_UPALPHA(x) (((x) >= 'A') && ((x) <= 'Z'))
78
79
#ifdef IS_DIGIT
80
#undef IS_DIGIT
81
#endif
82
/*
83
 * digit = "0" | "1" | "2" | "3" | "4" | "5" | "6" | "7" | "8" | "9"
84
 */
85
2.18G
#define IS_DIGIT(x) (((x) >= '0') && ((x) <= '9'))
86
87
/*
88
 * alphanum = alpha | digit
89
 */
90
91
5.60G
#define IS_ALPHANUM(x) (IS_ALPHA(x) || IS_DIGIT(x))
92
93
/*
94
 * mark = "-" | "_" | "." | "!" | "~" | "*" | "'" | "(" | ")"
95
 */
96
97
1.84G
#define IS_MARK(x) (((x) == '-') || ((x) == '_') || ((x) == '.') ||     \
98
1.84G
    ((x) == '!') || ((x) == '~') || ((x) == '*') || ((x) == '\'') ||    \
99
1.84G
    ((x) == '(') || ((x) == ')'))
100
101
/*
102
 * unwise = "{" | "}" | "|" | "\" | "^" | "`"
103
 */
104
105
#define IS_UNWISE(p)                                                    \
106
1.90M
      (((*(p) == '{')) || ((*(p) == '}')) || ((*(p) == '|')) ||         \
107
1.90M
       ((*(p) == '\\')) || ((*(p) == '^')) || ((*(p) == '[')) ||        \
108
1.90M
       ((*(p) == ']')) || ((*(p) == '`')))
109
/*
110
 * reserved = ";" | "/" | "?" | ":" | "@" | "&" | "=" | "+" | "$" | "," |
111
 *            "[" | "]"
112
 */
113
114
3.80M
#define IS_RESERVED(x) (((x) == ';') || ((x) == '/') || ((x) == '?') || \
115
3.80M
        ((x) == ':') || ((x) == '@') || ((x) == '&') || ((x) == '=') || \
116
3.80M
        ((x) == '+') || ((x) == '$') || ((x) == ',') || ((x) == '[') || \
117
3.80M
        ((x) == ']'))
118
119
/*
120
 * unreserved = alphanum | mark
121
 */
122
123
2.80G
#define IS_UNRESERVED(x) (IS_ALPHANUM(x) || IS_MARK(x))
124
125
/*
126
 * Skip to next pointer char, handle escaped sequences
127
 */
128
129
3.64G
#define NEXT(p) ((*p == '%')? p += 3 : p++)
130
131
/*
132
 * Productions from the spec.
133
 *
134
 *    authority     = server | reg_name
135
 *    reg_name      = 1*( unreserved | escaped | "$" | "," |
136
 *                        ";" | ":" | "@" | "&" | "=" | "+" )
137
 *
138
 * path          = [ abs_path | opaque_part ]
139
 */
140
141
9.95M
#define STRNDUP(s, n) (char *) xmlStrndup((const xmlChar *)(s), (n))
142
143
/************************************************************************
144
 *                  *
145
 *                         RFC 3986 parser        *
146
 *                  *
147
 ************************************************************************/
148
149
11.6G
#define ISA_DIGIT(p) ((*(p) >= '0') && (*(p) <= '9'))
150
3.97G
#define ISA_ALPHA(p) (((*(p) >= 'a') && (*(p) <= 'z')) ||   \
151
3.97G
                      ((*(p) >= 'A') && (*(p) <= 'Z')))
152
#define ISA_HEXDIG(p)             \
153
4.34G
       (ISA_DIGIT(p) || ((*(p) >= 'a') && (*(p) <= 'f')) ||   \
154
4.34G
        ((*(p) >= 'A') && (*(p) <= 'F')))
155
156
/*
157
 *    sub-delims    = "!" / "$" / "&" / "'" / "(" / ")"
158
 *                     / "*" / "+" / "," / ";" / "="
159
 */
160
#define ISA_SUB_DELIM(p)            \
161
3.71G
      (((*(p) == '!')) || ((*(p) == '$')) || ((*(p) == '&')) ||   \
162
151M
       ((*(p) == '(')) || ((*(p) == ')')) || ((*(p) == '*')) ||   \
163
151M
       ((*(p) == '+')) || ((*(p) == ',')) || ((*(p) == ';')) ||   \
164
151M
       ((*(p) == '=')) || ((*(p) == '\'')))
165
166
/*
167
 *    gen-delims    = ":" / "/" / "?" / "#" / "[" / "]" / "@"
168
 */
169
#define ISA_GEN_DELIM(p)            \
170
      (((*(p) == ':')) || ((*(p) == '/')) || ((*(p) == '?')) ||         \
171
       ((*(p) == '#')) || ((*(p) == '[')) || ((*(p) == ']')) ||         \
172
       ((*(p) == '@')))
173
174
/*
175
 *    reserved      = gen-delims / sub-delims
176
 */
177
#define ISA_RESERVED(p) (ISA_GEN_DELIM(p) || (ISA_SUB_DELIM(p)))
178
179
/*
180
 *    unreserved    = ALPHA / DIGIT / "-" / "." / "_" / "~"
181
 */
182
#define ISA_UNRESERVED(p)           \
183
7.45G
      ((ISA_ALPHA(p)) || (ISA_DIGIT(p)) || ((*(p) == '-')) ||   \
184
3.72G
       ((*(p) == '.')) || ((*(p) == '_')) || ((*(p) == '~')))
185
186
/*
187
 *    pct-encoded   = "%" HEXDIG HEXDIG
188
 */
189
#define ISA_PCT_ENCODED(p)            \
190
6.05G
     ((*(p) == '%') && (ISA_HEXDIG(p + 1)) && (ISA_HEXDIG(p + 2)))
191
192
/*
193
 *    pchar         = unreserved / pct-encoded / sub-delims / ":" / "@"
194
 */
195
#define ISA_PCHAR(p)              \
196
6.25G
     (ISA_UNRESERVED(p) || ISA_PCT_ENCODED(p) || ISA_SUB_DELIM(p) ||  \
197
3.29G
      ((*(p) == ':')) || ((*(p) == '@')))
198
199
/**
200
 * xmlParse3986Scheme:
201
 * @uri:  pointer to an URI structure
202
 * @str:  pointer to the string to analyze
203
 *
204
 * Parse an URI scheme
205
 *
206
 * ALPHA *( ALPHA / DIGIT / "+" / "-" / "." )
207
 *
208
 * Returns 0 or the error code
209
 */
210
static int
211
15.0M
xmlParse3986Scheme(xmlURIPtr uri, const char **str) {
212
15.0M
    const char *cur;
213
214
15.0M
    if (str == NULL)
215
0
  return(-1);
216
217
15.0M
    cur = *str;
218
15.0M
    if (!ISA_ALPHA(cur))
219
5.28M
  return(2);
220
9.81M
    cur++;
221
114M
    while (ISA_ALPHA(cur) || ISA_DIGIT(cur) ||
222
114M
           (*cur == '+') || (*cur == '-') || (*cur == '.')) cur++;
223
9.81M
    if (uri != NULL) {
224
9.81M
  if (uri->scheme != NULL) xmlFree(uri->scheme);
225
9.81M
  uri->scheme = STRNDUP(*str, cur - *str);
226
9.81M
    }
227
9.81M
    *str = cur;
228
9.81M
    return(0);
229
15.0M
}
230
231
/**
232
 * xmlParse3986Fragment:
233
 * @uri:  pointer to an URI structure
234
 * @str:  pointer to the string to analyze
235
 *
236
 * Parse the query part of an URI
237
 *
238
 * fragment      = *( pchar / "/" / "?" )
239
 * NOTE: the strict syntax as defined by 3986 does not allow '[' and ']'
240
 *       in the fragment identifier but this is used very broadly for
241
 *       xpointer scheme selection, so we are allowing it here to not break
242
 *       for example all the DocBook processing chains.
243
 *
244
 * Returns 0 or the error code
245
 */
246
static int
247
xmlParse3986Fragment(xmlURIPtr uri, const char **str)
248
555k
{
249
555k
    const char *cur;
250
251
555k
    if (str == NULL)
252
0
        return (-1);
253
254
555k
    cur = *str;
255
256
104M
    while ((ISA_PCHAR(cur)) || (*cur == '/') || (*cur == '?') ||
257
104M
           (*cur == '[') || (*cur == ']') ||
258
104M
           ((uri != NULL) && (uri->cleanup & 1) && (IS_UNWISE(cur))))
259
104M
        NEXT(cur);
260
555k
    if (uri != NULL) {
261
555k
        if (uri->fragment != NULL)
262
0
            xmlFree(uri->fragment);
263
555k
  if (uri->cleanup & 2)
264
0
      uri->fragment = STRNDUP(*str, cur - *str);
265
555k
  else
266
555k
      uri->fragment = xmlURIUnescapeString(*str, cur - *str, NULL);
267
555k
    }
268
555k
    *str = cur;
269
555k
    return (0);
270
555k
}
271
272
/**
273
 * xmlParse3986Query:
274
 * @uri:  pointer to an URI structure
275
 * @str:  pointer to the string to analyze
276
 *
277
 * Parse the query part of an URI
278
 *
279
 * query = *uric
280
 *
281
 * Returns 0 or the error code
282
 */
283
static int
284
xmlParse3986Query(xmlURIPtr uri, const char **str)
285
135k
{
286
135k
    const char *cur;
287
288
135k
    if (str == NULL)
289
0
        return (-1);
290
291
135k
    cur = *str;
292
293
139M
    while ((ISA_PCHAR(cur)) || (*cur == '/') || (*cur == '?') ||
294
139M
           ((uri != NULL) && (uri->cleanup & 1) && (IS_UNWISE(cur))))
295
139M
        NEXT(cur);
296
135k
    if (uri != NULL) {
297
135k
        if (uri->query != NULL)
298
0
            xmlFree(uri->query);
299
135k
  if (uri->cleanup & 2)
300
0
      uri->query = STRNDUP(*str, cur - *str);
301
135k
  else
302
135k
      uri->query = xmlURIUnescapeString(*str, cur - *str, NULL);
303
304
  /* Save the raw bytes of the query as well.
305
   * See: http://mail.gnome.org/archives/xml/2007-April/thread.html#00114
306
   */
307
135k
  if (uri->query_raw != NULL)
308
0
      xmlFree (uri->query_raw);
309
135k
  uri->query_raw = STRNDUP (*str, cur - *str);
310
135k
    }
311
135k
    *str = cur;
312
135k
    return (0);
313
135k
}
314
315
/**
316
 * xmlParse3986Port:
317
 * @uri:  pointer to an URI structure
318
 * @str:  the string to analyze
319
 *
320
 * Parse a port part and fills in the appropriate fields
321
 * of the @uri structure
322
 *
323
 * port          = *DIGIT
324
 *
325
 * Returns 0 or the error code
326
 */
327
static int
328
xmlParse3986Port(xmlURIPtr uri, const char **str)
329
28.4k
{
330
28.4k
    const char *cur = *str;
331
28.4k
    int port = 0;
332
333
28.4k
    if (ISA_DIGIT(cur)) {
334
45.7k
  while (ISA_DIGIT(cur)) {
335
38.2k
            int digit = *cur - '0';
336
337
38.2k
            if (port > INT_MAX / 10)
338
1.41k
                return(1);
339
36.8k
            port *= 10;
340
36.8k
            if (port > INT_MAX - digit)
341
0
                return(1);
342
36.8k
      port += digit;
343
344
36.8k
      cur++;
345
36.8k
  }
346
7.47k
  if (uri != NULL)
347
7.47k
      uri->port = port;
348
7.47k
  *str = cur;
349
7.47k
  return(0);
350
8.88k
    }
351
19.5k
    return(1);
352
28.4k
}
353
354
/**
355
 * xmlParse3986Userinfo:
356
 * @uri:  pointer to an URI structure
357
 * @str:  the string to analyze
358
 *
359
 * Parse an user information part and fills in the appropriate fields
360
 * of the @uri structure
361
 *
362
 * userinfo      = *( unreserved / pct-encoded / sub-delims / ":" )
363
 *
364
 * Returns 0 or the error code
365
 */
366
static int
367
xmlParse3986Userinfo(xmlURIPtr uri, const char **str)
368
1.32M
{
369
1.32M
    const char *cur;
370
371
1.32M
    cur = *str;
372
269M
    while (ISA_UNRESERVED(cur) || ISA_PCT_ENCODED(cur) ||
373
269M
           ISA_SUB_DELIM(cur) || (*cur == ':'))
374
268M
  NEXT(cur);
375
1.32M
    if (*cur == '@') {
376
66.9k
  if (uri != NULL) {
377
66.9k
      if (uri->user != NULL) xmlFree(uri->user);
378
66.9k
      if (uri->cleanup & 2)
379
0
    uri->user = STRNDUP(*str, cur - *str);
380
66.9k
      else
381
66.9k
    uri->user = xmlURIUnescapeString(*str, cur - *str, NULL);
382
66.9k
  }
383
66.9k
  *str = cur;
384
66.9k
  return(0);
385
66.9k
    }
386
1.26M
    return(1);
387
1.32M
}
388
389
/**
390
 * xmlParse3986DecOctet:
391
 * @str:  the string to analyze
392
 *
393
 *    dec-octet     = DIGIT                 ; 0-9
394
 *                  / %x31-39 DIGIT         ; 10-99
395
 *                  / "1" 2DIGIT            ; 100-199
396
 *                  / "2" %x30-34 DIGIT     ; 200-249
397
 *                  / "25" %x30-35          ; 250-255
398
 *
399
 * Skip a dec-octet.
400
 *
401
 * Returns 0 if found and skipped, 1 otherwise
402
 */
403
static int
404
76.7k
xmlParse3986DecOctet(const char **str) {
405
76.7k
    const char *cur = *str;
406
407
76.7k
    if (!(ISA_DIGIT(cur)))
408
5.89k
        return(1);
409
70.8k
    if (!ISA_DIGIT(cur+1))
410
22.3k
  cur++;
411
48.4k
    else if ((*cur != '0') && (ISA_DIGIT(cur + 1)) && (!ISA_DIGIT(cur+2)))
412
15.9k
  cur += 2;
413
32.4k
    else if ((*cur == '1') && (ISA_DIGIT(cur + 1)) && (ISA_DIGIT(cur + 2)))
414
6.73k
  cur += 3;
415
25.7k
    else if ((*cur == '2') && (*(cur + 1) >= '0') &&
416
25.7k
       (*(cur + 1) <= '4') && (ISA_DIGIT(cur + 2)))
417
7.01k
  cur += 3;
418
18.7k
    else if ((*cur == '2') && (*(cur + 1) == '5') &&
419
18.7k
       (*(cur + 2) >= '0') && (*(cur + 1) <= '5'))
420
3.35k
  cur += 3;
421
15.3k
    else
422
15.3k
        return(1);
423
55.4k
    *str = cur;
424
55.4k
    return(0);
425
70.8k
}
426
/**
427
 * xmlParse3986Host:
428
 * @uri:  pointer to an URI structure
429
 * @str:  the string to analyze
430
 *
431
 * Parse an host part and fills in the appropriate fields
432
 * of the @uri structure
433
 *
434
 * host          = IP-literal / IPv4address / reg-name
435
 * IP-literal    = "[" ( IPv6address / IPvFuture  ) "]"
436
 * IPv4address   = dec-octet "." dec-octet "." dec-octet "." dec-octet
437
 * reg-name      = *( unreserved / pct-encoded / sub-delims )
438
 *
439
 * Returns 0 or the error code
440
 */
441
static int
442
xmlParse3986Host(xmlURIPtr uri, const char **str)
443
1.32M
{
444
1.32M
    const char *cur = *str;
445
1.32M
    const char *host;
446
447
1.32M
    host = cur;
448
    /*
449
     * IPv6 and future addressing scheme are enclosed between brackets
450
     */
451
1.32M
    if (*cur == '[') {
452
5.96k
        cur++;
453
710k
  while ((*cur != ']') && (*cur != 0))
454
704k
      cur++;
455
5.96k
  if (*cur != ']')
456
2.44k
      return(1);
457
3.51k
  cur++;
458
3.51k
  goto found;
459
5.96k
    }
460
    /*
461
     * try to parse an IPv4
462
     */
463
1.32M
    if (ISA_DIGIT(cur)) {
464
55.8k
        if (xmlParse3986DecOctet(&cur) != 0)
465
11.8k
      goto not_ipv4;
466
44.0k
  if (*cur != '.')
467
25.6k
      goto not_ipv4;
468
18.4k
  cur++;
469
18.4k
        if (xmlParse3986DecOctet(&cur) != 0)
470
7.08k
      goto not_ipv4;
471
11.3k
  if (*cur != '.')
472
9.02k
      goto not_ipv4;
473
2.35k
        if (xmlParse3986DecOctet(&cur) != 0)
474
2.35k
      goto not_ipv4;
475
0
  if (*cur != '.')
476
0
      goto not_ipv4;
477
0
        if (xmlParse3986DecOctet(&cur) != 0)
478
0
      goto not_ipv4;
479
0
  goto found;
480
55.8k
not_ipv4:
481
55.8k
        cur = *str;
482
55.8k
    }
483
    /*
484
     * then this should be a hostname which can be empty
485
     */
486
170M
    while (ISA_UNRESERVED(cur) || ISA_PCT_ENCODED(cur) || ISA_SUB_DELIM(cur))
487
168M
        NEXT(cur);
488
1.32M
found:
489
1.32M
    if (uri != NULL) {
490
1.32M
  if (uri->authority != NULL) xmlFree(uri->authority);
491
1.32M
  uri->authority = NULL;
492
1.32M
  if (uri->server != NULL) xmlFree(uri->server);
493
1.32M
  if (cur != host) {
494
1.06M
      if (uri->cleanup & 2)
495
0
    uri->server = STRNDUP(host, cur - host);
496
1.06M
      else
497
1.06M
    uri->server = xmlURIUnescapeString(host, cur - host, NULL);
498
1.06M
  } else
499
266k
      uri->server = NULL;
500
1.32M
    }
501
1.32M
    *str = cur;
502
1.32M
    return(0);
503
1.32M
}
504
505
/**
506
 * xmlParse3986Authority:
507
 * @uri:  pointer to an URI structure
508
 * @str:  the string to analyze
509
 *
510
 * Parse an authority part and fills in the appropriate fields
511
 * of the @uri structure
512
 *
513
 * authority     = [ userinfo "@" ] host [ ":" port ]
514
 *
515
 * Returns 0 or the error code
516
 */
517
static int
518
xmlParse3986Authority(xmlURIPtr uri, const char **str)
519
1.32M
{
520
1.32M
    const char *cur;
521
1.32M
    int ret;
522
523
1.32M
    cur = *str;
524
    /*
525
     * try to parse an userinfo and check for the trailing @
526
     */
527
1.32M
    ret = xmlParse3986Userinfo(uri, &cur);
528
1.32M
    if ((ret != 0) || (*cur != '@'))
529
1.26M
        cur = *str;
530
66.9k
    else
531
66.9k
        cur++;
532
1.32M
    ret = xmlParse3986Host(uri, &cur);
533
1.32M
    if (ret != 0) return(ret);
534
1.32M
    if (*cur == ':') {
535
28.4k
        cur++;
536
28.4k
        ret = xmlParse3986Port(uri, &cur);
537
28.4k
  if (ret != 0) return(ret);
538
28.4k
    }
539
1.30M
    *str = cur;
540
1.30M
    return(0);
541
1.32M
}
542
543
/**
544
 * xmlParse3986Segment:
545
 * @str:  the string to analyze
546
 * @forbid: an optional forbidden character
547
 * @empty: allow an empty segment
548
 *
549
 * Parse a segment and fills in the appropriate fields
550
 * of the @uri structure
551
 *
552
 * segment       = *pchar
553
 * segment-nz    = 1*pchar
554
 * segment-nz-nc = 1*( unreserved / pct-encoded / sub-delims / "@" )
555
 *               ; non-zero-length segment without any colon ":"
556
 *
557
 * Returns 0 or the error code
558
 */
559
static int
560
xmlParse3986Segment(const char **str, char forbid, int empty)
561
70.5M
{
562
70.5M
    const char *cur;
563
564
70.5M
    cur = *str;
565
70.5M
    if (!ISA_PCHAR(cur)) {
566
48.0M
        if (empty)
567
48.0M
      return(0);
568
42.8k
  return(1);
569
48.0M
    }
570
2.96G
    while (ISA_PCHAR(cur) && (*cur != forbid))
571
2.93G
        NEXT(cur);
572
22.5M
    *str = cur;
573
22.5M
    return (0);
574
70.5M
}
575
576
/**
577
 * xmlParse3986PathAbEmpty:
578
 * @uri:  pointer to an URI structure
579
 * @str:  the string to analyze
580
 *
581
 * Parse an path absolute or empty and fills in the appropriate fields
582
 * of the @uri structure
583
 *
584
 * path-abempty  = *( "/" segment )
585
 *
586
 * Returns 0 or the error code
587
 */
588
static int
589
xmlParse3986PathAbEmpty(xmlURIPtr uri, const char **str)
590
1.30M
{
591
1.30M
    const char *cur;
592
1.30M
    int ret;
593
594
1.30M
    cur = *str;
595
596
47.4M
    while (*cur == '/') {
597
46.1M
        cur++;
598
46.1M
  ret = xmlParse3986Segment(&cur, 0, 1);
599
46.1M
  if (ret != 0) return(ret);
600
46.1M
    }
601
1.30M
    if (uri != NULL) {
602
1.30M
  if (uri->path != NULL) xmlFree(uri->path);
603
1.30M
        if (*str != cur) {
604
894k
            if (uri->cleanup & 2)
605
0
                uri->path = STRNDUP(*str, cur - *str);
606
894k
            else
607
894k
                uri->path = xmlURIUnescapeString(*str, cur - *str, NULL);
608
894k
        } else {
609
411k
            uri->path = NULL;
610
411k
        }
611
1.30M
    }
612
1.30M
    *str = cur;
613
1.30M
    return (0);
614
1.30M
}
615
616
/**
617
 * xmlParse3986PathAbsolute:
618
 * @uri:  pointer to an URI structure
619
 * @str:  the string to analyze
620
 *
621
 * Parse an path absolute and fills in the appropriate fields
622
 * of the @uri structure
623
 *
624
 * path-absolute = "/" [ segment-nz *( "/" segment ) ]
625
 *
626
 * Returns 0 or the error code
627
 */
628
static int
629
xmlParse3986PathAbsolute(xmlURIPtr uri, const char **str)
630
136k
{
631
136k
    const char *cur;
632
136k
    int ret;
633
634
136k
    cur = *str;
635
636
136k
    if (*cur != '/')
637
0
        return(1);
638
136k
    cur++;
639
136k
    ret = xmlParse3986Segment(&cur, 0, 0);
640
136k
    if (ret == 0) {
641
424k
  while (*cur == '/') {
642
331k
      cur++;
643
331k
      ret = xmlParse3986Segment(&cur, 0, 1);
644
331k
      if (ret != 0) return(ret);
645
331k
  }
646
93.4k
    }
647
136k
    if (uri != NULL) {
648
136k
  if (uri->path != NULL) xmlFree(uri->path);
649
136k
        if (cur != *str) {
650
136k
            if (uri->cleanup & 2)
651
0
                uri->path = STRNDUP(*str, cur - *str);
652
136k
            else
653
136k
                uri->path = xmlURIUnescapeString(*str, cur - *str, NULL);
654
136k
        } else {
655
0
            uri->path = NULL;
656
0
        }
657
136k
    }
658
136k
    *str = cur;
659
136k
    return (0);
660
136k
}
661
662
/**
663
 * xmlParse3986PathRootless:
664
 * @uri:  pointer to an URI structure
665
 * @str:  the string to analyze
666
 *
667
 * Parse an path without root and fills in the appropriate fields
668
 * of the @uri structure
669
 *
670
 * path-rootless = segment-nz *( "/" segment )
671
 *
672
 * Returns 0 or the error code
673
 */
674
static int
675
xmlParse3986PathRootless(xmlURIPtr uri, const char **str)
676
405k
{
677
405k
    const char *cur;
678
405k
    int ret;
679
680
405k
    cur = *str;
681
682
405k
    ret = xmlParse3986Segment(&cur, 0, 0);
683
405k
    if (ret != 0) return(ret);
684
684k
    while (*cur == '/') {
685
278k
        cur++;
686
278k
  ret = xmlParse3986Segment(&cur, 0, 1);
687
278k
  if (ret != 0) return(ret);
688
278k
    }
689
405k
    if (uri != NULL) {
690
405k
  if (uri->path != NULL) xmlFree(uri->path);
691
405k
        if (cur != *str) {
692
405k
            if (uri->cleanup & 2)
693
0
                uri->path = STRNDUP(*str, cur - *str);
694
405k
            else
695
405k
                uri->path = xmlURIUnescapeString(*str, cur - *str, NULL);
696
405k
        } else {
697
0
            uri->path = NULL;
698
0
        }
699
405k
    }
700
405k
    *str = cur;
701
405k
    return (0);
702
405k
}
703
704
/**
705
 * xmlParse3986PathNoScheme:
706
 * @uri:  pointer to an URI structure
707
 * @str:  the string to analyze
708
 *
709
 * Parse an path which is not a scheme and fills in the appropriate fields
710
 * of the @uri structure
711
 *
712
 * path-noscheme = segment-nz-nc *( "/" segment )
713
 *
714
 * Returns 0 or the error code
715
 */
716
static int
717
xmlParse3986PathNoScheme(xmlURIPtr uri, const char **str)
718
12.1M
{
719
12.1M
    const char *cur;
720
12.1M
    int ret;
721
722
12.1M
    cur = *str;
723
724
12.1M
    ret = xmlParse3986Segment(&cur, ':', 0);
725
12.1M
    if (ret != 0) return(ret);
726
23.3M
    while (*cur == '/') {
727
11.1M
        cur++;
728
11.1M
  ret = xmlParse3986Segment(&cur, 0, 1);
729
11.1M
  if (ret != 0) return(ret);
730
11.1M
    }
731
12.1M
    if (uri != NULL) {
732
12.1M
  if (uri->path != NULL) xmlFree(uri->path);
733
12.1M
        if (cur != *str) {
734
12.1M
            if (uri->cleanup & 2)
735
0
                uri->path = STRNDUP(*str, cur - *str);
736
12.1M
            else
737
12.1M
                uri->path = xmlURIUnescapeString(*str, cur - *str, NULL);
738
12.1M
        } else {
739
6.55k
            uri->path = NULL;
740
6.55k
        }
741
12.1M
    }
742
12.1M
    *str = cur;
743
12.1M
    return (0);
744
12.1M
}
745
746
/**
747
 * xmlParse3986HierPart:
748
 * @uri:  pointer to an URI structure
749
 * @str:  the string to analyze
750
 *
751
 * Parse an hierarchical part and fills in the appropriate fields
752
 * of the @uri structure
753
 *
754
 * hier-part     = "//" authority path-abempty
755
 *                / path-absolute
756
 *                / path-rootless
757
 *                / path-empty
758
 *
759
 * Returns 0 or the error code
760
 */
761
static int
762
xmlParse3986HierPart(xmlURIPtr uri, const char **str)
763
1.57M
{
764
1.57M
    const char *cur;
765
1.57M
    int ret;
766
767
1.57M
    cur = *str;
768
769
1.57M
    if ((*cur == '/') && (*(cur + 1) == '/')) {
770
1.11M
        cur += 2;
771
1.11M
  ret = xmlParse3986Authority(uri, &cur);
772
1.11M
  if (ret != 0) return(ret);
773
1.09M
  if (uri->server == NULL)
774
83.2k
      uri->port = -1;
775
1.09M
  ret = xmlParse3986PathAbEmpty(uri, &cur);
776
1.09M
  if (ret != 0) return(ret);
777
1.09M
  *str = cur;
778
1.09M
  return(0);
779
1.09M
    } else if (*cur == '/') {
780
32.2k
        ret = xmlParse3986PathAbsolute(uri, &cur);
781
32.2k
  if (ret != 0) return(ret);
782
428k
    } else if (ISA_PCHAR(cur)) {
783
405k
        ret = xmlParse3986PathRootless(uri, &cur);
784
405k
  if (ret != 0) return(ret);
785
405k
    } else {
786
  /* path-empty is effectively empty */
787
23.1k
  if (uri != NULL) {
788
23.1k
      if (uri->path != NULL) xmlFree(uri->path);
789
23.1k
      uri->path = NULL;
790
23.1k
  }
791
23.1k
    }
792
460k
    *str = cur;
793
460k
    return (0);
794
1.57M
}
795
796
/**
797
 * xmlParse3986RelativeRef:
798
 * @uri:  pointer to an URI structure
799
 * @str:  the string to analyze
800
 *
801
 * Parse an URI string and fills in the appropriate fields
802
 * of the @uri structure
803
 *
804
 * relative-ref  = relative-part [ "?" query ] [ "#" fragment ]
805
 * relative-part = "//" authority path-abempty
806
 *               / path-absolute
807
 *               / path-noscheme
808
 *               / path-empty
809
 *
810
 * Returns 0 or the error code
811
 */
812
static int
813
13.7M
xmlParse3986RelativeRef(xmlURIPtr uri, const char *str) {
814
13.7M
    int ret;
815
816
13.7M
    if ((*str == '/') && (*(str + 1) == '/')) {
817
211k
        str += 2;
818
211k
  ret = xmlParse3986Authority(uri, &str);
819
211k
  if (ret != 0) return(ret);
820
209k
  ret = xmlParse3986PathAbEmpty(uri, &str);
821
209k
  if (ret != 0) return(ret);
822
13.5M
    } else if (*str == '/') {
823
104k
  ret = xmlParse3986PathAbsolute(uri, &str);
824
104k
  if (ret != 0) return(ret);
825
13.4M
    } else if (ISA_PCHAR(str)) {
826
12.1M
        ret = xmlParse3986PathNoScheme(uri, &str);
827
12.1M
  if (ret != 0) return(ret);
828
12.1M
    } else {
829
  /* path-empty is effectively empty */
830
1.29M
  if (uri != NULL) {
831
1.29M
      if (uri->path != NULL) xmlFree(uri->path);
832
1.29M
      uri->path = NULL;
833
1.29M
  }
834
1.29M
    }
835
836
13.7M
    if (*str == '?') {
837
78.7k
  str++;
838
78.7k
  ret = xmlParse3986Query(uri, &str);
839
78.7k
  if (ret != 0) return(ret);
840
78.7k
    }
841
13.7M
    if (*str == '#') {
842
486k
  str++;
843
486k
  ret = xmlParse3986Fragment(uri, &str);
844
486k
  if (ret != 0) return(ret);
845
486k
    }
846
13.7M
    if (*str != 0) {
847
1.41M
  xmlCleanURI(uri);
848
1.41M
  return(1);
849
1.41M
    }
850
12.3M
    return(0);
851
13.7M
}
852
853
854
/**
855
 * xmlParse3986URI:
856
 * @uri:  pointer to an URI structure
857
 * @str:  the string to analyze
858
 *
859
 * Parse an URI string and fills in the appropriate fields
860
 * of the @uri structure
861
 *
862
 * scheme ":" hier-part [ "?" query ] [ "#" fragment ]
863
 *
864
 * Returns 0 or the error code
865
 */
866
static int
867
15.0M
xmlParse3986URI(xmlURIPtr uri, const char *str) {
868
15.0M
    int ret;
869
870
15.0M
    ret = xmlParse3986Scheme(uri, &str);
871
15.0M
    if (ret != 0) return(ret);
872
9.81M
    if (*str != ':') {
873
8.23M
  return(1);
874
8.23M
    }
875
1.57M
    str++;
876
1.57M
    ret = xmlParse3986HierPart(uri, &str);
877
1.57M
    if (ret != 0) return(ret);
878
1.55M
    if (*str == '?') {
879
56.2k
  str++;
880
56.2k
  ret = xmlParse3986Query(uri, &str);
881
56.2k
  if (ret != 0) return(ret);
882
56.2k
    }
883
1.55M
    if (*str == '#') {
884
68.6k
  str++;
885
68.6k
  ret = xmlParse3986Fragment(uri, &str);
886
68.6k
  if (ret != 0) return(ret);
887
68.6k
    }
888
1.55M
    if (*str != 0) {
889
250k
  xmlCleanURI(uri);
890
250k
  return(1);
891
250k
    }
892
1.30M
    return(0);
893
1.55M
}
894
895
/**
896
 * xmlParse3986URIReference:
897
 * @uri:  pointer to an URI structure
898
 * @str:  the string to analyze
899
 *
900
 * Parse an URI reference string and fills in the appropriate fields
901
 * of the @uri structure
902
 *
903
 * URI-reference = URI / relative-ref
904
 *
905
 * Returns 0 or the error code
906
 */
907
static int
908
15.0M
xmlParse3986URIReference(xmlURIPtr uri, const char *str) {
909
15.0M
    int ret;
910
911
15.0M
    if (str == NULL)
912
0
  return(-1);
913
15.0M
    xmlCleanURI(uri);
914
915
    /*
916
     * Try first to parse absolute refs, then fallback to relative if
917
     * it fails.
918
     */
919
15.0M
    ret = xmlParse3986URI(uri, str);
920
15.0M
    if (ret != 0) {
921
13.7M
  xmlCleanURI(uri);
922
13.7M
        ret = xmlParse3986RelativeRef(uri, str);
923
13.7M
  if (ret != 0) {
924
1.42M
      xmlCleanURI(uri);
925
1.42M
      return(ret);
926
1.42M
  }
927
13.7M
    }
928
13.6M
    return(0);
929
15.0M
}
930
931
/**
932
 * xmlParseURI:
933
 * @str:  the URI string to analyze
934
 *
935
 * Parse an URI based on RFC 3986
936
 *
937
 * URI-reference = [ absoluteURI | relativeURI ] [ "#" fragment ]
938
 *
939
 * Returns a newly built xmlURIPtr or NULL in case of error
940
 */
941
xmlURIPtr
942
8.65M
xmlParseURI(const char *str) {
943
8.65M
    xmlURIPtr uri;
944
8.65M
    int ret;
945
946
8.65M
    if (str == NULL)
947
0
  return(NULL);
948
8.65M
    uri = xmlCreateURI();
949
8.65M
    if (uri != NULL) {
950
8.65M
  ret = xmlParse3986URIReference(uri, str);
951
8.65M
        if (ret) {
952
1.21M
      xmlFreeURI(uri);
953
1.21M
      return(NULL);
954
1.21M
  }
955
8.65M
    }
956
7.43M
    return(uri);
957
8.65M
}
958
959
/**
960
 * xmlParseURIReference:
961
 * @uri:  pointer to an URI structure
962
 * @str:  the string to analyze
963
 *
964
 * Parse an URI reference string based on RFC 3986 and fills in the
965
 * appropriate fields of the @uri structure
966
 *
967
 * URI-reference = URI / relative-ref
968
 *
969
 * Returns 0 or the error code
970
 */
971
int
972
6.44M
xmlParseURIReference(xmlURIPtr uri, const char *str) {
973
6.44M
    return(xmlParse3986URIReference(uri, str));
974
6.44M
}
975
976
/**
977
 * xmlParseURIRaw:
978
 * @str:  the URI string to analyze
979
 * @raw:  if 1 unescaping of URI pieces are disabled
980
 *
981
 * Parse an URI but allows to keep intact the original fragments.
982
 *
983
 * URI-reference = URI / relative-ref
984
 *
985
 * Returns a newly built xmlURIPtr or NULL in case of error
986
 */
987
xmlURIPtr
988
0
xmlParseURIRaw(const char *str, int raw) {
989
0
    xmlURIPtr uri;
990
0
    int ret;
991
992
0
    if (str == NULL)
993
0
  return(NULL);
994
0
    uri = xmlCreateURI();
995
0
    if (uri != NULL) {
996
0
        if (raw) {
997
0
      uri->cleanup |= 2;
998
0
  }
999
0
  ret = xmlParseURIReference(uri, str);
1000
0
        if (ret) {
1001
0
      xmlFreeURI(uri);
1002
0
      return(NULL);
1003
0
  }
1004
0
    }
1005
0
    return(uri);
1006
0
}
1007
1008
/************************************************************************
1009
 *                  *
1010
 *      Generic URI structure functions     *
1011
 *                  *
1012
 ************************************************************************/
1013
1014
/**
1015
 * xmlCreateURI:
1016
 *
1017
 * Simply creates an empty xmlURI
1018
 *
1019
 * Returns the new structure or NULL in case of error
1020
 */
1021
xmlURIPtr
1022
16.3M
xmlCreateURI(void) {
1023
16.3M
    xmlURIPtr ret;
1024
1025
16.3M
    ret = (xmlURIPtr) xmlMalloc(sizeof(xmlURI));
1026
16.3M
    if (ret == NULL) {
1027
0
        xmlURIErrMemory("creating URI structure\n");
1028
0
  return(NULL);
1029
0
    }
1030
16.3M
    memset(ret, 0, sizeof(xmlURI));
1031
16.3M
    return(ret);
1032
16.3M
}
1033
1034
/**
1035
 * xmlSaveUriRealloc:
1036
 *
1037
 * Function to handle properly a reallocation when saving an URI
1038
 * Also imposes some limit on the length of an URI string output
1039
 */
1040
static xmlChar *
1041
1.29M
xmlSaveUriRealloc(xmlChar *ret, int *max) {
1042
1.29M
    xmlChar *temp;
1043
1.29M
    int tmp;
1044
1045
1.29M
    if (*max > MAX_URI_LENGTH) {
1046
0
        xmlURIErrMemory("reaching arbitrary MAX_URI_LENGTH limit\n");
1047
0
        return(NULL);
1048
0
    }
1049
1.29M
    tmp = *max * 2;
1050
1.29M
    temp = (xmlChar *) xmlRealloc(ret, (tmp + 1));
1051
1.29M
    if (temp == NULL) {
1052
0
        xmlURIErrMemory("saving URI\n");
1053
0
        return(NULL);
1054
0
    }
1055
1.29M
    *max = tmp;
1056
1.29M
    return(temp);
1057
1.29M
}
1058
1059
/**
1060
 * xmlSaveUri:
1061
 * @uri:  pointer to an xmlURI
1062
 *
1063
 * Save the URI as an escaped string
1064
 *
1065
 * Returns a new string (to be deallocated by caller)
1066
 */
1067
xmlChar *
1068
6.69M
xmlSaveUri(xmlURIPtr uri) {
1069
6.69M
    xmlChar *ret = NULL;
1070
6.69M
    xmlChar *temp;
1071
6.69M
    const char *p;
1072
6.69M
    int len;
1073
6.69M
    int max;
1074
1075
6.69M
    if (uri == NULL) return(NULL);
1076
1077
1078
6.69M
    max = 80;
1079
6.69M
    ret = (xmlChar *) xmlMallocAtomic(max + 1);
1080
6.69M
    if (ret == NULL) {
1081
0
        xmlURIErrMemory("saving URI\n");
1082
0
  return(NULL);
1083
0
    }
1084
6.69M
    len = 0;
1085
1086
6.69M
    if (uri->scheme != NULL) {
1087
207k
  p = uri->scheme;
1088
23.0M
  while (*p != 0) {
1089
22.8M
      if (len >= max) {
1090
23.9k
                temp = xmlSaveUriRealloc(ret, &max);
1091
23.9k
                if (temp == NULL) goto mem_error;
1092
23.9k
    ret = temp;
1093
23.9k
      }
1094
22.8M
      ret[len++] = *p++;
1095
22.8M
  }
1096
207k
  if (len >= max) {
1097
2.09k
            temp = xmlSaveUriRealloc(ret, &max);
1098
2.09k
            if (temp == NULL) goto mem_error;
1099
2.09k
            ret = temp;
1100
2.09k
  }
1101
207k
  ret[len++] = ':';
1102
207k
    }
1103
6.69M
    if (uri->opaque != NULL) {
1104
0
  p = uri->opaque;
1105
0
  while (*p != 0) {
1106
0
      if (len + 3 >= max) {
1107
0
                temp = xmlSaveUriRealloc(ret, &max);
1108
0
                if (temp == NULL) goto mem_error;
1109
0
                ret = temp;
1110
0
      }
1111
0
      if (IS_RESERVED(*(p)) || IS_UNRESERVED(*(p)))
1112
0
    ret[len++] = *p++;
1113
0
      else {
1114
0
    int val = *(unsigned char *)p++;
1115
0
    int hi = val / 0x10, lo = val % 0x10;
1116
0
    ret[len++] = '%';
1117
0
    ret[len++] = hi + (hi > 9? 'A'-10 : '0');
1118
0
    ret[len++] = lo + (lo > 9? 'A'-10 : '0');
1119
0
      }
1120
0
  }
1121
6.69M
    } else {
1122
6.69M
  if ((uri->server != NULL) || (uri->port == -1)) {
1123
142k
      if (len + 3 >= max) {
1124
2.28k
                temp = xmlSaveUriRealloc(ret, &max);
1125
2.28k
                if (temp == NULL) goto mem_error;
1126
2.28k
                ret = temp;
1127
2.28k
      }
1128
142k
      ret[len++] = '/';
1129
142k
      ret[len++] = '/';
1130
142k
      if (uri->user != NULL) {
1131
31.4k
    p = uri->user;
1132
78.8M
    while (*p != 0) {
1133
78.7M
        if (len + 3 >= max) {
1134
49.1k
                        temp = xmlSaveUriRealloc(ret, &max);
1135
49.1k
                        if (temp == NULL) goto mem_error;
1136
49.1k
                        ret = temp;
1137
49.1k
        }
1138
78.7M
        if ((IS_UNRESERVED(*(p))) ||
1139
78.7M
      ((*(p) == ';')) || ((*(p) == ':')) ||
1140
78.7M
      ((*(p) == '&')) || ((*(p) == '=')) ||
1141
78.7M
      ((*(p) == '+')) || ((*(p) == '$')) ||
1142
78.7M
      ((*(p) == ',')))
1143
32.3M
      ret[len++] = *p++;
1144
46.4M
        else {
1145
46.4M
      int val = *(unsigned char *)p++;
1146
46.4M
      int hi = val / 0x10, lo = val % 0x10;
1147
46.4M
      ret[len++] = '%';
1148
46.4M
      ret[len++] = hi + (hi > 9? 'A'-10 : '0');
1149
46.4M
      ret[len++] = lo + (lo > 9? 'A'-10 : '0');
1150
46.4M
        }
1151
78.7M
    }
1152
31.4k
    if (len + 3 >= max) {
1153
1.51k
                    temp = xmlSaveUriRealloc(ret, &max);
1154
1.51k
                    if (temp == NULL) goto mem_error;
1155
1.51k
                    ret = temp;
1156
1.51k
    }
1157
31.4k
    ret[len++] = '@';
1158
31.4k
      }
1159
142k
      if (uri->server != NULL) {
1160
102k
    p = uri->server;
1161
87.0M
    while (*p != 0) {
1162
86.9M
        if (len >= max) {
1163
35.0k
      temp = xmlSaveUriRealloc(ret, &max);
1164
35.0k
      if (temp == NULL) goto mem_error;
1165
35.0k
      ret = temp;
1166
35.0k
        }
1167
86.9M
        ret[len++] = *p++;
1168
86.9M
    }
1169
102k
    if (uri->port > 0) {
1170
3.33k
        if (len + 10 >= max) {
1171
556
      temp = xmlSaveUriRealloc(ret, &max);
1172
556
      if (temp == NULL) goto mem_error;
1173
556
      ret = temp;
1174
556
        }
1175
3.33k
        len += snprintf((char *) &ret[len], max - len, ":%d", uri->port);
1176
3.33k
    }
1177
102k
      }
1178
6.55M
  } else if (uri->authority != NULL) {
1179
0
      if (len + 3 >= max) {
1180
0
                temp = xmlSaveUriRealloc(ret, &max);
1181
0
                if (temp == NULL) goto mem_error;
1182
0
                ret = temp;
1183
0
      }
1184
0
      ret[len++] = '/';
1185
0
      ret[len++] = '/';
1186
0
      p = uri->authority;
1187
0
      while (*p != 0) {
1188
0
    if (len + 3 >= max) {
1189
0
                    temp = xmlSaveUriRealloc(ret, &max);
1190
0
                    if (temp == NULL) goto mem_error;
1191
0
                    ret = temp;
1192
0
    }
1193
0
    if ((IS_UNRESERVED(*(p))) ||
1194
0
                    ((*(p) == '$')) || ((*(p) == ',')) || ((*(p) == ';')) ||
1195
0
                    ((*(p) == ':')) || ((*(p) == '@')) || ((*(p) == '&')) ||
1196
0
                    ((*(p) == '=')) || ((*(p) == '+')))
1197
0
        ret[len++] = *p++;
1198
0
    else {
1199
0
        int val = *(unsigned char *)p++;
1200
0
        int hi = val / 0x10, lo = val % 0x10;
1201
0
        ret[len++] = '%';
1202
0
        ret[len++] = hi + (hi > 9? 'A'-10 : '0');
1203
0
        ret[len++] = lo + (lo > 9? 'A'-10 : '0');
1204
0
    }
1205
0
      }
1206
6.55M
  } else if (uri->scheme != NULL) {
1207
90.3k
      if (len + 3 >= max) {
1208
2.02k
                temp = xmlSaveUriRealloc(ret, &max);
1209
2.02k
                if (temp == NULL) goto mem_error;
1210
2.02k
                ret = temp;
1211
2.02k
      }
1212
90.3k
  }
1213
6.69M
  if (uri->path != NULL) {
1214
6.42M
      p = uri->path;
1215
      /*
1216
       * the colon in file:///d: should not be escaped or
1217
       * Windows accesses fail later.
1218
       */
1219
6.42M
      if ((uri->scheme != NULL) &&
1220
6.42M
    (p[0] == '/') &&
1221
6.42M
    (((p[1] >= 'a') && (p[1] <= 'z')) ||
1222
87.8k
     ((p[1] >= 'A') && (p[1] <= 'Z'))) &&
1223
6.42M
    (p[2] == ':') &&
1224
6.42M
          (xmlStrEqual(BAD_CAST uri->scheme, BAD_CAST "file"))) {
1225
1.75k
    if (len + 3 >= max) {
1226
19
                    temp = xmlSaveUriRealloc(ret, &max);
1227
19
                    if (temp == NULL) goto mem_error;
1228
19
                    ret = temp;
1229
19
    }
1230
1.75k
    ret[len++] = *p++;
1231
1.75k
    ret[len++] = *p++;
1232
1.75k
    ret[len++] = *p++;
1233
1.75k
      }
1234
2.29G
      while (*p != 0) {
1235
2.28G
    if (len + 3 >= max) {
1236
1.00M
                    temp = xmlSaveUriRealloc(ret, &max);
1237
1.00M
                    if (temp == NULL) goto mem_error;
1238
1.00M
                    ret = temp;
1239
1.00M
    }
1240
2.28G
    if ((IS_UNRESERVED(*(p))) || ((*(p) == '/')) ||
1241
2.28G
                    ((*(p) == ';')) || ((*(p) == '@')) || ((*(p) == '&')) ||
1242
2.28G
              ((*(p) == '=')) || ((*(p) == '+')) || ((*(p) == '$')) ||
1243
2.28G
              ((*(p) == ',')))
1244
869M
        ret[len++] = *p++;
1245
1.41G
    else {
1246
1.41G
        int val = *(unsigned char *)p++;
1247
1.41G
        int hi = val / 0x10, lo = val % 0x10;
1248
1.41G
        ret[len++] = '%';
1249
1.41G
        ret[len++] = hi + (hi > 9? 'A'-10 : '0');
1250
1.41G
        ret[len++] = lo + (lo > 9? 'A'-10 : '0');
1251
1.41G
    }
1252
2.28G
      }
1253
6.42M
  }
1254
6.69M
  if (uri->query_raw != NULL) {
1255
55.6k
      if (len + 1 >= max) {
1256
1.69k
                temp = xmlSaveUriRealloc(ret, &max);
1257
1.69k
                if (temp == NULL) goto mem_error;
1258
1.69k
                ret = temp;
1259
1.69k
      }
1260
55.6k
      ret[len++] = '?';
1261
55.6k
      p = uri->query_raw;
1262
203M
      while (*p != 0) {
1263
203M
    if (len + 1 >= max) {
1264
28.7k
                    temp = xmlSaveUriRealloc(ret, &max);
1265
28.7k
                    if (temp == NULL) goto mem_error;
1266
28.7k
                    ret = temp;
1267
28.7k
    }
1268
203M
    ret[len++] = *p++;
1269
203M
      }
1270
6.63M
  } else if (uri->query != NULL) {
1271
0
      if (len + 3 >= max) {
1272
0
                temp = xmlSaveUriRealloc(ret, &max);
1273
0
                if (temp == NULL) goto mem_error;
1274
0
                ret = temp;
1275
0
      }
1276
0
      ret[len++] = '?';
1277
0
      p = uri->query;
1278
0
      while (*p != 0) {
1279
0
    if (len + 3 >= max) {
1280
0
                    temp = xmlSaveUriRealloc(ret, &max);
1281
0
                    if (temp == NULL) goto mem_error;
1282
0
                    ret = temp;
1283
0
    }
1284
0
    if ((IS_UNRESERVED(*(p))) || (IS_RESERVED(*(p))))
1285
0
        ret[len++] = *p++;
1286
0
    else {
1287
0
        int val = *(unsigned char *)p++;
1288
0
        int hi = val / 0x10, lo = val % 0x10;
1289
0
        ret[len++] = '%';
1290
0
        ret[len++] = hi + (hi > 9? 'A'-10 : '0');
1291
0
        ret[len++] = lo + (lo > 9? 'A'-10 : '0');
1292
0
    }
1293
0
      }
1294
0
  }
1295
6.69M
    }
1296
6.69M
    if (uri->fragment != NULL) {
1297
156k
  if (len + 3 >= max) {
1298
2.87k
            temp = xmlSaveUriRealloc(ret, &max);
1299
2.87k
            if (temp == NULL) goto mem_error;
1300
2.87k
            ret = temp;
1301
2.87k
  }
1302
156k
  ret[len++] = '#';
1303
156k
  p = uri->fragment;
1304
19.1M
  while (*p != 0) {
1305
18.9M
      if (len + 3 >= max) {
1306
52.4k
                temp = xmlSaveUriRealloc(ret, &max);
1307
52.4k
                if (temp == NULL) goto mem_error;
1308
52.4k
                ret = temp;
1309
52.4k
      }
1310
18.9M
      if ((IS_UNRESERVED(*(p))) || (IS_RESERVED(*(p))))
1311
18.2M
    ret[len++] = *p++;
1312
729k
      else {
1313
729k
    int val = *(unsigned char *)p++;
1314
729k
    int hi = val / 0x10, lo = val % 0x10;
1315
729k
    ret[len++] = '%';
1316
729k
    ret[len++] = hi + (hi > 9? 'A'-10 : '0');
1317
729k
    ret[len++] = lo + (lo > 9? 'A'-10 : '0');
1318
729k
      }
1319
18.9M
  }
1320
156k
    }
1321
6.69M
    if (len >= max) {
1322
920
        temp = xmlSaveUriRealloc(ret, &max);
1323
920
        if (temp == NULL) goto mem_error;
1324
920
        ret = temp;
1325
920
    }
1326
6.69M
    ret[len] = 0;
1327
6.69M
    return(ret);
1328
1329
0
mem_error:
1330
0
    xmlFree(ret);
1331
0
    return(NULL);
1332
6.69M
}
1333
1334
/**
1335
 * xmlPrintURI:
1336
 * @stream:  a FILE* for the output
1337
 * @uri:  pointer to an xmlURI
1338
 *
1339
 * Prints the URI in the stream @stream.
1340
 */
1341
void
1342
0
xmlPrintURI(FILE *stream, xmlURIPtr uri) {
1343
0
    xmlChar *out;
1344
1345
0
    out = xmlSaveUri(uri);
1346
0
    if (out != NULL) {
1347
0
  fprintf(stream, "%s", (char *) out);
1348
0
  xmlFree(out);
1349
0
    }
1350
0
}
1351
1352
/**
1353
 * xmlCleanURI:
1354
 * @uri:  pointer to an xmlURI
1355
 *
1356
 * Make sure the xmlURI struct is free of content
1357
 */
1358
static void
1359
31.9M
xmlCleanURI(xmlURIPtr uri) {
1360
31.9M
    if (uri == NULL) return;
1361
1362
31.9M
    if (uri->scheme != NULL) xmlFree(uri->scheme);
1363
31.9M
    uri->scheme = NULL;
1364
31.9M
    if (uri->server != NULL) xmlFree(uri->server);
1365
31.9M
    uri->server = NULL;
1366
31.9M
    if (uri->user != NULL) xmlFree(uri->user);
1367
31.9M
    uri->user = NULL;
1368
31.9M
    if (uri->path != NULL) xmlFree(uri->path);
1369
31.9M
    uri->path = NULL;
1370
31.9M
    if (uri->fragment != NULL) xmlFree(uri->fragment);
1371
31.9M
    uri->fragment = NULL;
1372
31.9M
    if (uri->opaque != NULL) xmlFree(uri->opaque);
1373
31.9M
    uri->opaque = NULL;
1374
31.9M
    if (uri->authority != NULL) xmlFree(uri->authority);
1375
31.9M
    uri->authority = NULL;
1376
31.9M
    if (uri->query != NULL) xmlFree(uri->query);
1377
31.9M
    uri->query = NULL;
1378
31.9M
    if (uri->query_raw != NULL) xmlFree(uri->query_raw);
1379
31.9M
    uri->query_raw = NULL;
1380
31.9M
}
1381
1382
/**
1383
 * xmlFreeURI:
1384
 * @uri:  pointer to an xmlURI
1385
 *
1386
 * Free up the xmlURI struct
1387
 */
1388
void
1389
16.3M
xmlFreeURI(xmlURIPtr uri) {
1390
16.3M
    if (uri == NULL) return;
1391
1392
16.3M
    if (uri->scheme != NULL) xmlFree(uri->scheme);
1393
16.3M
    if (uri->server != NULL) xmlFree(uri->server);
1394
16.3M
    if (uri->user != NULL) xmlFree(uri->user);
1395
16.3M
    if (uri->path != NULL) xmlFree(uri->path);
1396
16.3M
    if (uri->fragment != NULL) xmlFree(uri->fragment);
1397
16.3M
    if (uri->opaque != NULL) xmlFree(uri->opaque);
1398
16.3M
    if (uri->authority != NULL) xmlFree(uri->authority);
1399
16.3M
    if (uri->query != NULL) xmlFree(uri->query);
1400
16.3M
    if (uri->query_raw != NULL) xmlFree(uri->query_raw);
1401
16.3M
    xmlFree(uri);
1402
16.3M
}
1403
1404
/************************************************************************
1405
 *                  *
1406
 *      Helper functions        *
1407
 *                  *
1408
 ************************************************************************/
1409
1410
/**
1411
 * xmlNormalizeURIPath:
1412
 * @path:  pointer to the path string
1413
 *
1414
 * Applies the 5 normalization steps to a path string--that is, RFC 2396
1415
 * Section 5.2, steps 6.c through 6.g.
1416
 *
1417
 * Normalization occurs directly on the string, no new allocation is done
1418
 *
1419
 * Returns 0 or an error code
1420
 */
1421
int
1422
1.09M
xmlNormalizeURIPath(char *path) {
1423
1.09M
    char *cur, *out;
1424
1425
1.09M
    if (path == NULL)
1426
0
  return(-1);
1427
1428
    /* Skip all initial "/" chars.  We want to get to the beginning of the
1429
     * first non-empty segment.
1430
     */
1431
1.09M
    cur = path;
1432
7.35M
    while (cur[0] == '/')
1433
6.26M
      ++cur;
1434
1.09M
    if (cur[0] == '\0')
1435
0
      return(0);
1436
1437
    /* Keep everything we've seen so far.  */
1438
1.09M
    out = cur;
1439
1440
    /*
1441
     * Analyze each segment in sequence for cases (c) and (d).
1442
     */
1443
3.36M
    while (cur[0] != '\0') {
1444
  /*
1445
   * c) All occurrences of "./", where "." is a complete path segment,
1446
   *    are removed from the buffer string.
1447
   */
1448
3.36M
  if ((cur[0] == '.') && (cur[1] == '/')) {
1449
20.9k
      cur += 2;
1450
      /* '//' normalization should be done at this point too */
1451
1.20M
      while (cur[0] == '/')
1452
1.18M
    cur++;
1453
20.9k
      continue;
1454
20.9k
  }
1455
1456
  /*
1457
   * d) If the buffer string ends with "." as a complete path segment,
1458
   *    that "." is removed.
1459
   */
1460
3.34M
  if ((cur[0] == '.') && (cur[1] == '\0'))
1461
4.03k
      break;
1462
1463
  /* Otherwise keep the segment.  */
1464
544M
  while (cur[0] != '/') {
1465
541M
            if (cur[0] == '\0')
1466
1.08M
              goto done_cd;
1467
540M
      (out++)[0] = (cur++)[0];
1468
540M
  }
1469
  /* normalize // */
1470
7.21M
  while ((cur[0] == '/') && (cur[1] == '/'))
1471
4.97M
      cur++;
1472
1473
2.24M
        (out++)[0] = (cur++)[0];
1474
2.24M
    }
1475
1.09M
 done_cd:
1476
1.09M
    out[0] = '\0';
1477
1478
    /* Reset to the beginning of the first segment for the next sequence.  */
1479
1.09M
    cur = path;
1480
7.35M
    while (cur[0] == '/')
1481
6.26M
      ++cur;
1482
1.09M
    if (cur[0] == '\0')
1483
3.81k
  return(0);
1484
1485
    /*
1486
     * Analyze each segment in sequence for cases (e) and (f).
1487
     *
1488
     * e) All occurrences of "<segment>/../", where <segment> is a
1489
     *    complete path segment not equal to "..", are removed from the
1490
     *    buffer string.  Removal of these path segments is performed
1491
     *    iteratively, removing the leftmost matching pattern on each
1492
     *    iteration, until no matching pattern remains.
1493
     *
1494
     * f) If the buffer string ends with "<segment>/..", where <segment>
1495
     *    is a complete path segment not equal to "..", that
1496
     *    "<segment>/.." is removed.
1497
     *
1498
     * To satisfy the "iterative" clause in (e), we need to collapse the
1499
     * string every time we find something that needs to be removed.  Thus,
1500
     * we don't need to keep two pointers into the string: we only need a
1501
     * "current position" pointer.
1502
     */
1503
3.33M
    while (1) {
1504
3.33M
        char *segp, *tmp;
1505
1506
        /* At the beginning of each iteration of this loop, "cur" points to
1507
         * the first character of the segment we want to examine.
1508
         */
1509
1510
        /* Find the end of the current segment.  */
1511
3.33M
        segp = cur;
1512
549M
        while ((segp[0] != '/') && (segp[0] != '\0'))
1513
546M
          ++segp;
1514
1515
        /* If this is the last segment, we're done (we need at least two
1516
         * segments to meet the criteria for the (e) and (f) cases).
1517
         */
1518
3.33M
        if (segp[0] == '\0')
1519
1.09M
          break;
1520
1521
        /* If the first segment is "..", or if the next segment _isn't_ "..",
1522
         * keep this segment and try the next one.
1523
         */
1524
2.24M
        ++segp;
1525
2.24M
        if (((cur[0] == '.') && (cur[1] == '.') && (segp == cur+3))
1526
2.24M
            || ((segp[0] != '.') || (segp[1] != '.')
1527
2.21M
                || ((segp[2] != '/') && (segp[2] != '\0')))) {
1528
2.21M
          cur = segp;
1529
2.21M
          continue;
1530
2.21M
        }
1531
1532
        /* If we get here, remove this segment and the next one and back up
1533
         * to the previous segment (if there is one), to implement the
1534
         * "iteratively" clause.  It's pretty much impossible to back up
1535
         * while maintaining two pointers into the buffer, so just compact
1536
         * the whole buffer now.
1537
         */
1538
1539
        /* If this is the end of the buffer, we're done.  */
1540
27.4k
        if (segp[2] == '\0') {
1541
496
          cur[0] = '\0';
1542
496
          break;
1543
496
        }
1544
        /* Valgrind complained, strcpy(cur, segp + 3); */
1545
        /* string will overlap, do not use strcpy */
1546
26.9k
        tmp = cur;
1547
26.9k
        segp += 3;
1548
11.4M
        while ((*tmp++ = *segp++) != 0)
1549
11.4M
          ;
1550
1551
        /* If there are no previous segments, then keep going from here.  */
1552
26.9k
        segp = cur;
1553
62.4k
        while ((segp > path) && ((--segp)[0] == '/'))
1554
35.4k
          ;
1555
26.9k
        if (segp == path)
1556
6.43k
          continue;
1557
1558
        /* "segp" is pointing to the end of a previous segment; find it's
1559
         * start.  We need to back up to the previous segment and start
1560
         * over with that to handle things like "foo/bar/../..".  If we
1561
         * don't do this, then on the first pass we'll remove the "bar/..",
1562
         * but be pointing at the second ".." so we won't realize we can also
1563
         * remove the "foo/..".
1564
         */
1565
20.5k
        cur = segp;
1566
5.56M
        while ((cur > path) && (cur[-1] != '/'))
1567
5.54M
          --cur;
1568
20.5k
    }
1569
1.09M
    out[0] = '\0';
1570
1571
    /*
1572
     * g) If the resulting buffer string still begins with one or more
1573
     *    complete path segments of "..", then the reference is
1574
     *    considered to be in error. Implementations may handle this
1575
     *    error by retaining these components in the resolved path (i.e.,
1576
     *    treating them as part of the final URI), by removing them from
1577
     *    the resolved path (i.e., discarding relative levels above the
1578
     *    root), or by avoiding traversal of the reference.
1579
     *
1580
     * We discard them from the final path.
1581
     */
1582
1.09M
    if (path[0] == '/') {
1583
69.8k
      cur = path;
1584
74.8k
      while ((cur[0] == '/') && (cur[1] == '.') && (cur[2] == '.')
1585
74.8k
             && ((cur[3] == '/') || (cur[3] == '\0')))
1586
5.02k
  cur += 3;
1587
1588
69.8k
      if (cur != path) {
1589
4.03k
  out = path;
1590
125k
  while (cur[0] != '\0')
1591
121k
          (out++)[0] = (cur++)[0];
1592
4.03k
  out[0] = 0;
1593
4.03k
      }
1594
69.8k
    }
1595
1596
1.09M
    return(0);
1597
1.09M
}
1598
1599
4.20G
static int is_hex(char c) {
1600
4.20G
    if (((c >= '0') && (c <= '9')) ||
1601
4.20G
        ((c >= 'a') && (c <= 'f')) ||
1602
4.20G
        ((c >= 'A') && (c <= 'F')))
1603
4.20G
  return(1);
1604
199k
    return(0);
1605
4.20G
}
1606
1607
/**
1608
 * xmlURIUnescapeString:
1609
 * @str:  the string to unescape
1610
 * @len:   the length in bytes to unescape (or <= 0 to indicate full string)
1611
 * @target:  optional destination buffer
1612
 *
1613
 * Unescaping routine, but does not check that the string is an URI. The
1614
 * output is a direct unsigned char translation of %XX values (no encoding)
1615
 * Note that the length of the result can only be smaller or same size as
1616
 * the input string.
1617
 *
1618
 * Returns a copy of the string, but unescaped, will return NULL only in case
1619
 * of error
1620
 */
1621
char *
1622
15.4M
xmlURIUnescapeString(const char *str, int len, char *target) {
1623
15.4M
    char *ret, *out;
1624
15.4M
    const char *in;
1625
1626
15.4M
    if (str == NULL)
1627
0
  return(NULL);
1628
15.4M
    if (len <= 0) len = strlen(str);
1629
15.4M
    if (len < 0) return(NULL);
1630
1631
15.4M
    if (target == NULL) {
1632
15.4M
  ret = (char *) xmlMallocAtomic(len + 1);
1633
15.4M
  if (ret == NULL) {
1634
0
            xmlURIErrMemory("unescaping URI value\n");
1635
0
      return(NULL);
1636
0
  }
1637
15.4M
    } else
1638
0
  ret = target;
1639
15.4M
    in = str;
1640
15.4M
    out = ret;
1641
3.60G
    while(len > 0) {
1642
3.58G
  if ((len > 2) && (*in == '%') && (is_hex(in[1])) && (is_hex(in[2]))) {
1643
2.10G
            int c = 0;
1644
2.10G
      in++;
1645
2.10G
      if ((*in >= '0') && (*in <= '9'))
1646
1.16G
          c = (*in - '0');
1647
933M
      else if ((*in >= 'a') && (*in <= 'f'))
1648
135k
          c = (*in - 'a') + 10;
1649
932M
      else if ((*in >= 'A') && (*in <= 'F'))
1650
932M
          c = (*in - 'A') + 10;
1651
2.10G
      in++;
1652
2.10G
      if ((*in >= '0') && (*in <= '9'))
1653
1.38G
          c = c * 16 + (*in - '0');
1654
715M
      else if ((*in >= 'a') && (*in <= 'f'))
1655
132k
          c = c * 16 + (*in - 'a') + 10;
1656
715M
      else if ((*in >= 'A') && (*in <= 'F'))
1657
715M
          c = c * 16 + (*in - 'A') + 10;
1658
2.10G
      in++;
1659
2.10G
      len -= 3;
1660
            /* Explicit sign change */
1661
2.10G
      *out++ = (char) c;
1662
2.10G
  } else {
1663
1.48G
      *out++ = *in++;
1664
1.48G
      len--;
1665
1.48G
  }
1666
3.58G
    }
1667
15.4M
    *out = 0;
1668
15.4M
    return(ret);
1669
15.4M
}
1670
1671
/**
1672
 * xmlURIEscapeStr:
1673
 * @str:  string to escape
1674
 * @list: exception list string of chars not to escape
1675
 *
1676
 * This routine escapes a string to hex, ignoring reserved characters (a-z)
1677
 * and the characters in the exception list.
1678
 *
1679
 * Returns a new escaped string or NULL in case of error.
1680
 */
1681
xmlChar *
1682
217k
xmlURIEscapeStr(const xmlChar *str, const xmlChar *list) {
1683
217k
    xmlChar *ret, ch;
1684
217k
    xmlChar *temp;
1685
217k
    const xmlChar *in;
1686
217k
    int len, out;
1687
1688
217k
    if (str == NULL)
1689
0
  return(NULL);
1690
217k
    if (str[0] == 0)
1691
1.19k
  return(xmlStrdup(str));
1692
216k
    len = xmlStrlen(str);
1693
216k
    if (!(len > 0)) return(NULL);
1694
1695
216k
    len += 20;
1696
216k
    ret = (xmlChar *) xmlMallocAtomic(len);
1697
216k
    if (ret == NULL) {
1698
0
        xmlURIErrMemory("escaping URI value\n");
1699
0
  return(NULL);
1700
0
    }
1701
216k
    in = (const xmlChar *) str;
1702
216k
    out = 0;
1703
418M
    while(*in != 0) {
1704
417M
  if (len - out <= 3) {
1705
83.5k
            temp = xmlSaveUriRealloc(ret, &len);
1706
83.5k
      if (temp == NULL) {
1707
0
                xmlURIErrMemory("escaping URI value\n");
1708
0
    xmlFree(ret);
1709
0
    return(NULL);
1710
0
      }
1711
83.5k
      ret = temp;
1712
83.5k
  }
1713
1714
417M
  ch = *in;
1715
1716
417M
  if ((ch != '@') && (!IS_UNRESERVED(ch)) && (!xmlStrchr(list, ch))) {
1717
290M
      unsigned char val;
1718
290M
      ret[out++] = '%';
1719
290M
      val = ch >> 4;
1720
290M
      if (val <= 9)
1721
151M
    ret[out++] = '0' + val;
1722
138M
      else
1723
138M
    ret[out++] = 'A' + val - 0xA;
1724
290M
      val = ch & 0xF;
1725
290M
      if (val <= 9)
1726
183M
    ret[out++] = '0' + val;
1727
107M
      else
1728
107M
    ret[out++] = 'A' + val - 0xA;
1729
290M
      in++;
1730
290M
  } else {
1731
127M
      ret[out++] = *in++;
1732
127M
  }
1733
1734
417M
    }
1735
216k
    ret[out] = 0;
1736
216k
    return(ret);
1737
216k
}
1738
1739
/**
1740
 * xmlURIEscape:
1741
 * @str:  the string of the URI to escape
1742
 *
1743
 * Escaping routine, does not do validity checks !
1744
 * It will try to escape the chars needing this, but this is heuristic
1745
 * based it's impossible to be sure.
1746
 *
1747
 * Returns an copy of the string, but escaped
1748
 *
1749
 * 25 May 2001
1750
 * Uses xmlParseURI and xmlURIEscapeStr to try to escape correctly
1751
 * according to RFC2396.
1752
 *   - Carl Douglas
1753
 */
1754
xmlChar *
1755
xmlURIEscape(const xmlChar * str)
1756
213k
{
1757
213k
    xmlChar *ret, *segment = NULL;
1758
213k
    xmlURIPtr uri;
1759
213k
    int ret2;
1760
1761
213k
    if (str == NULL)
1762
2.50k
        return (NULL);
1763
1764
210k
    uri = xmlCreateURI();
1765
210k
    if (uri != NULL) {
1766
  /*
1767
   * Allow escaping errors in the unescaped form
1768
   */
1769
210k
        uri->cleanup = 1;
1770
210k
        ret2 = xmlParseURIReference(uri, (const char *)str);
1771
210k
        if (ret2) {
1772
37.8k
            xmlFreeURI(uri);
1773
37.8k
            return (NULL);
1774
37.8k
        }
1775
210k
    }
1776
1777
173k
    if (!uri)
1778
0
        return NULL;
1779
1780
173k
    ret = NULL;
1781
1782
180k
#define NULLCHK(p) if(!p) { \
1783
0
         xmlURIErrMemory("escaping URI value\n"); \
1784
0
         xmlFreeURI(uri); \
1785
0
         xmlFree(ret); \
1786
0
         return NULL; } \
1787
173k
1788
173k
    if (uri->scheme) {
1789
15.2k
        segment = xmlURIEscapeStr(BAD_CAST uri->scheme, BAD_CAST "+-.");
1790
15.2k
        NULLCHK(segment)
1791
15.2k
        ret = xmlStrcat(ret, segment);
1792
15.2k
        ret = xmlStrcat(ret, BAD_CAST ":");
1793
15.2k
        xmlFree(segment);
1794
15.2k
    }
1795
1796
173k
    if (uri->authority) {
1797
0
        segment =
1798
0
            xmlURIEscapeStr(BAD_CAST uri->authority, BAD_CAST "/?;:@");
1799
0
        NULLCHK(segment)
1800
0
        ret = xmlStrcat(ret, BAD_CAST "//");
1801
0
        ret = xmlStrcat(ret, segment);
1802
0
        xmlFree(segment);
1803
0
    }
1804
1805
173k
    if (uri->user) {
1806
2.50k
        segment = xmlURIEscapeStr(BAD_CAST uri->user, BAD_CAST ";:&=+$,");
1807
2.50k
        NULLCHK(segment)
1808
2.50k
        ret = xmlStrcat(ret,BAD_CAST "//");
1809
2.50k
        ret = xmlStrcat(ret, segment);
1810
2.50k
        ret = xmlStrcat(ret, BAD_CAST "@");
1811
2.50k
        xmlFree(segment);
1812
2.50k
    }
1813
1814
173k
    if (uri->server) {
1815
6.42k
        segment = xmlURIEscapeStr(BAD_CAST uri->server, BAD_CAST "/?;:@");
1816
6.42k
        NULLCHK(segment)
1817
6.42k
        if (uri->user == NULL)
1818
5.13k
            ret = xmlStrcat(ret, BAD_CAST "//");
1819
6.42k
        ret = xmlStrcat(ret, segment);
1820
6.42k
        xmlFree(segment);
1821
6.42k
    }
1822
1823
173k
    if (uri->port) {
1824
4.40k
        xmlChar port[10];
1825
1826
4.40k
        snprintf((char *) port, 10, "%d", uri->port);
1827
4.40k
        ret = xmlStrcat(ret, BAD_CAST ":");
1828
4.40k
        ret = xmlStrcat(ret, port);
1829
4.40k
    }
1830
1831
173k
    if (uri->path) {
1832
86.2k
        segment =
1833
86.2k
            xmlURIEscapeStr(BAD_CAST uri->path, BAD_CAST ":@&=+$,/?;");
1834
86.2k
        NULLCHK(segment)
1835
86.2k
        ret = xmlStrcat(ret, segment);
1836
86.2k
        xmlFree(segment);
1837
86.2k
    }
1838
1839
173k
    if (uri->query_raw) {
1840
4.84k
        ret = xmlStrcat(ret, BAD_CAST "?");
1841
4.84k
        ret = xmlStrcat(ret, BAD_CAST uri->query_raw);
1842
4.84k
    }
1843
168k
    else if (uri->query) {
1844
0
        segment =
1845
0
            xmlURIEscapeStr(BAD_CAST uri->query, BAD_CAST ";/?:@&=+,$");
1846
0
        NULLCHK(segment)
1847
0
        ret = xmlStrcat(ret, BAD_CAST "?");
1848
0
        ret = xmlStrcat(ret, segment);
1849
0
        xmlFree(segment);
1850
0
    }
1851
1852
173k
    if (uri->opaque) {
1853
0
        segment = xmlURIEscapeStr(BAD_CAST uri->opaque, BAD_CAST "");
1854
0
        NULLCHK(segment)
1855
0
        ret = xmlStrcat(ret, segment);
1856
0
        xmlFree(segment);
1857
0
    }
1858
1859
173k
    if (uri->fragment) {
1860
70.3k
        segment = xmlURIEscapeStr(BAD_CAST uri->fragment, BAD_CAST "#");
1861
70.3k
        NULLCHK(segment)
1862
70.3k
        ret = xmlStrcat(ret, BAD_CAST "#");
1863
70.3k
        ret = xmlStrcat(ret, segment);
1864
70.3k
        xmlFree(segment);
1865
70.3k
    }
1866
1867
173k
    xmlFreeURI(uri);
1868
173k
#undef NULLCHK
1869
1870
173k
    return (ret);
1871
173k
}
1872
1873
/************************************************************************
1874
 *                  *
1875
 *      Public functions        *
1876
 *                  *
1877
 ************************************************************************/
1878
1879
/**
1880
 * xmlBuildURI:
1881
 * @URI:  the URI instance found in the document
1882
 * @base:  the base value
1883
 *
1884
 * Computes he final URI of the reference done by checking that
1885
 * the given URI is valid, and building the final URI using the
1886
 * base URI. This is processed according to section 5.2 of the
1887
 * RFC 2396
1888
 *
1889
 * 5.2. Resolving Relative References to Absolute Form
1890
 *
1891
 * Returns a new URI string (to be freed by the caller) or NULL in case
1892
 *         of error.
1893
 */
1894
xmlChar *
1895
5.00M
xmlBuildURI(const xmlChar *URI, const xmlChar *base) {
1896
5.00M
    xmlChar *val = NULL;
1897
5.00M
    int ret, len, indx, cur, out;
1898
5.00M
    xmlURIPtr ref = NULL;
1899
5.00M
    xmlURIPtr bas = NULL;
1900
5.00M
    xmlURIPtr res = NULL;
1901
1902
    /*
1903
     * 1) The URI reference is parsed into the potential four components and
1904
     *    fragment identifier, as described in Section 4.3.
1905
     *
1906
     *    NOTE that a completely empty URI is treated by modern browsers
1907
     *    as a reference to "." rather than as a synonym for the current
1908
     *    URI.  Should we do that here?
1909
     */
1910
5.00M
    if (URI == NULL)
1911
38.9k
  ret = -1;
1912
4.96M
    else {
1913
4.96M
  if (*URI) {
1914
4.82M
      ref = xmlCreateURI();
1915
4.82M
      if (ref == NULL)
1916
0
    goto done;
1917
4.82M
      ret = xmlParseURIReference(ref, (const char *) URI);
1918
4.82M
  }
1919
135k
  else
1920
135k
      ret = 0;
1921
4.96M
    }
1922
5.00M
    if (ret != 0)
1923
165k
  goto done;
1924
4.83M
    if ((ref != NULL) && (ref->scheme != NULL)) {
1925
  /*
1926
   * The URI is absolute don't modify.
1927
   */
1928
41.7k
  val = xmlStrdup(URI);
1929
41.7k
  goto done;
1930
41.7k
    }
1931
4.79M
    if (base == NULL)
1932
3.38M
  ret = -1;
1933
1.40M
    else {
1934
1.40M
  bas = xmlCreateURI();
1935
1.40M
  if (bas == NULL)
1936
0
      goto done;
1937
1.40M
  ret = xmlParseURIReference(bas, (const char *) base);
1938
1.40M
    }
1939
4.79M
    if (ret != 0) {
1940
3.43M
  if (ref)
1941
3.43M
      val = xmlSaveUri(ref);
1942
3.43M
  goto done;
1943
3.43M
    }
1944
1.36M
    if (ref == NULL) {
1945
  /*
1946
   * the base fragment must be ignored
1947
   */
1948
134k
  if (bas->fragment != NULL) {
1949
29.7k
      xmlFree(bas->fragment);
1950
29.7k
      bas->fragment = NULL;
1951
29.7k
  }
1952
134k
  val = xmlSaveUri(bas);
1953
134k
  goto done;
1954
134k
    }
1955
1956
    /*
1957
     * 2) If the path component is empty and the scheme, authority, and
1958
     *    query components are undefined, then it is a reference to the
1959
     *    current document and we are done.  Otherwise, the reference URI's
1960
     *    query and fragment components are defined as found (or not found)
1961
     *    within the URI reference and not inherited from the base URI.
1962
     *
1963
     *    NOTE that in modern browsers, the parsing differs from the above
1964
     *    in the following aspect:  the query component is allowed to be
1965
     *    defined while still treating this as a reference to the current
1966
     *    document.
1967
     */
1968
1.22M
    res = xmlCreateURI();
1969
1.22M
    if (res == NULL)
1970
0
  goto done;
1971
1.22M
    if ((ref->scheme == NULL) && (ref->path == NULL) &&
1972
1.22M
  ((ref->authority == NULL) && (ref->server == NULL))) {
1973
133k
  if (bas->scheme != NULL)
1974
42.0k
      res->scheme = xmlMemStrdup(bas->scheme);
1975
133k
  if (bas->authority != NULL)
1976
0
      res->authority = xmlMemStrdup(bas->authority);
1977
133k
  else if ((bas->server != NULL) || (bas->port == -1)) {
1978
22.2k
      if (bas->server != NULL)
1979
13.6k
    res->server = xmlMemStrdup(bas->server);
1980
22.2k
      if (bas->user != NULL)
1981
5.06k
    res->user = xmlMemStrdup(bas->user);
1982
22.2k
      res->port = bas->port;
1983
22.2k
  }
1984
133k
  if (bas->path != NULL)
1985
103k
      res->path = xmlMemStrdup(bas->path);
1986
133k
  if (ref->query_raw != NULL)
1987
927
      res->query_raw = xmlMemStrdup (ref->query_raw);
1988
132k
  else if (ref->query != NULL)
1989
0
      res->query = xmlMemStrdup(ref->query);
1990
132k
  else if (bas->query_raw != NULL)
1991
18.5k
      res->query_raw = xmlMemStrdup(bas->query_raw);
1992
114k
  else if (bas->query != NULL)
1993
0
      res->query = xmlMemStrdup(bas->query);
1994
133k
  if (ref->fragment != NULL)
1995
132k
      res->fragment = xmlMemStrdup(ref->fragment);
1996
133k
  goto step_7;
1997
133k
    }
1998
1999
    /*
2000
     * 3) If the scheme component is defined, indicating that the reference
2001
     *    starts with a scheme name, then the reference is interpreted as an
2002
     *    absolute URI and we are done.  Otherwise, the reference URI's
2003
     *    scheme is inherited from the base URI's scheme component.
2004
     */
2005
1.09M
    if (ref->scheme != NULL) {
2006
0
  val = xmlSaveUri(ref);
2007
0
  goto done;
2008
0
    }
2009
1.09M
    if (bas->scheme != NULL)
2010
52.1k
  res->scheme = xmlMemStrdup(bas->scheme);
2011
2012
1.09M
    if (ref->query_raw != NULL)
2013
2.76k
  res->query_raw = xmlMemStrdup(ref->query_raw);
2014
1.09M
    else if (ref->query != NULL)
2015
0
  res->query = xmlMemStrdup(ref->query);
2016
1.09M
    if (ref->fragment != NULL)
2017
3.66k
  res->fragment = xmlMemStrdup(ref->fragment);
2018
2019
    /*
2020
     * 4) If the authority component is defined, then the reference is a
2021
     *    network-path and we skip to step 7.  Otherwise, the reference
2022
     *    URI's authority is inherited from the base URI's authority
2023
     *    component, which will also be undefined if the URI scheme does not
2024
     *    use an authority component.
2025
     */
2026
1.09M
    if ((ref->authority != NULL) || (ref->server != NULL)) {
2027
791
  if (ref->authority != NULL)
2028
0
      res->authority = xmlMemStrdup(ref->authority);
2029
791
  else {
2030
791
      res->server = xmlMemStrdup(ref->server);
2031
791
      if (ref->user != NULL)
2032
13
    res->user = xmlMemStrdup(ref->user);
2033
791
            res->port = ref->port;
2034
791
  }
2035
791
  if (ref->path != NULL)
2036
268
      res->path = xmlMemStrdup(ref->path);
2037
791
  goto step_7;
2038
791
    }
2039
1.09M
    if (bas->authority != NULL)
2040
0
  res->authority = xmlMemStrdup(bas->authority);
2041
1.09M
    else if ((bas->server != NULL) || (bas->port == -1)) {
2042
32.8k
  if (bas->server != NULL)
2043
18.9k
      res->server = xmlMemStrdup(bas->server);
2044
32.8k
  if (bas->user != NULL)
2045
8.61k
      res->user = xmlMemStrdup(bas->user);
2046
32.8k
  res->port = bas->port;
2047
32.8k
    }
2048
2049
    /*
2050
     * 5) If the path component begins with a slash character ("/"), then
2051
     *    the reference is an absolute-path and we skip to step 7.
2052
     */
2053
1.09M
    if ((ref->path != NULL) && (ref->path[0] == '/')) {
2054
1.00k
  res->path = xmlMemStrdup(ref->path);
2055
1.00k
  goto step_7;
2056
1.00k
    }
2057
2058
2059
    /*
2060
     * 6) If this step is reached, then we are resolving a relative-path
2061
     *    reference.  The relative path needs to be merged with the base
2062
     *    URI's path.  Although there are many ways to do this, we will
2063
     *    describe a simple method using a separate string buffer.
2064
     *
2065
     * Allocate a buffer large enough for the result string.
2066
     */
2067
1.09M
    len = 2; /* extra / and 0 */
2068
1.09M
    if (ref->path != NULL)
2069
1.09M
  len += strlen(ref->path);
2070
1.09M
    if (bas->path != NULL)
2071
848k
  len += strlen(bas->path);
2072
1.09M
    res->path = (char *) xmlMallocAtomic(len);
2073
1.09M
    if (res->path == NULL) {
2074
0
        xmlURIErrMemory("resolving URI against base\n");
2075
0
  goto done;
2076
0
    }
2077
1.09M
    res->path[0] = 0;
2078
2079
    /*
2080
     * a) All but the last segment of the base URI's path component is
2081
     *    copied to the buffer.  In other words, any characters after the
2082
     *    last (right-most) slash character, if any, are excluded.
2083
     */
2084
1.09M
    cur = 0;
2085
1.09M
    out = 0;
2086
1.09M
    if (bas->path != NULL) {
2087
13.5M
  while (bas->path[cur] != 0) {
2088
650M
      while ((bas->path[cur] != 0) && (bas->path[cur] != '/'))
2089
636M
    cur++;
2090
13.5M
      if (bas->path[cur] == 0)
2091
813k
    break;
2092
2093
12.7M
      cur++;
2094
519M
      while (out < cur) {
2095
506M
    res->path[out] = bas->path[out];
2096
506M
    out++;
2097
506M
      }
2098
12.7M
  }
2099
848k
    }
2100
1.09M
    res->path[out] = 0;
2101
2102
    /*
2103
     * b) The reference's path component is appended to the buffer
2104
     *    string.
2105
     */
2106
1.09M
    if (ref->path != NULL && ref->path[0] != 0) {
2107
1.09M
  indx = 0;
2108
  /*
2109
   * Ensure the path includes a '/'
2110
   */
2111
1.09M
  if ((out == 0) && (bas->server != NULL))
2112
11.7k
      res->path[out++] = '/';
2113
49.7M
  while (ref->path[indx] != 0) {
2114
48.6M
      res->path[out++] = ref->path[indx++];
2115
48.6M
  }
2116
1.09M
    }
2117
1.09M
    res->path[out] = 0;
2118
2119
    /*
2120
     * Steps c) to h) are really path normalization steps
2121
     */
2122
1.09M
    xmlNormalizeURIPath(res->path);
2123
2124
1.22M
step_7:
2125
2126
    /*
2127
     * 7) The resulting URI components, including any inherited from the
2128
     *    base URI, are recombined to give the absolute form of the URI
2129
     *    reference.
2130
     */
2131
1.22M
    val = xmlSaveUri(res);
2132
2133
5.00M
done:
2134
5.00M
    if (ref != NULL)
2135
4.82M
  xmlFreeURI(ref);
2136
5.00M
    if (bas != NULL)
2137
1.40M
  xmlFreeURI(bas);
2138
5.00M
    if (res != NULL)
2139
1.22M
  xmlFreeURI(res);
2140
5.00M
    return(val);
2141
1.22M
}
2142
2143
/**
2144
 * xmlBuildRelativeURI:
2145
 * @URI:  the URI reference under consideration
2146
 * @base:  the base value
2147
 *
2148
 * Expresses the URI of the reference in terms relative to the
2149
 * base.  Some examples of this operation include:
2150
 *     base = "http://site1.com/docs/book1.html"
2151
 *        URI input                        URI returned
2152
 *     docs/pic1.gif                    pic1.gif
2153
 *     docs/img/pic1.gif                img/pic1.gif
2154
 *     img/pic1.gif                     ../img/pic1.gif
2155
 *     http://site1.com/docs/pic1.gif   pic1.gif
2156
 *     http://site2.com/docs/pic1.gif   http://site2.com/docs/pic1.gif
2157
 *
2158
 *     base = "docs/book1.html"
2159
 *        URI input                        URI returned
2160
 *     docs/pic1.gif                    pic1.gif
2161
 *     docs/img/pic1.gif                img/pic1.gif
2162
 *     img/pic1.gif                     ../img/pic1.gif
2163
 *     http://site1.com/docs/pic1.gif   http://site1.com/docs/pic1.gif
2164
 *
2165
 *
2166
 * Note: if the URI reference is really weird or complicated, it may be
2167
 *       worthwhile to first convert it into a "nice" one by calling
2168
 *       xmlBuildURI (using 'base') before calling this routine,
2169
 *       since this routine (for reasonable efficiency) assumes URI has
2170
 *       already been through some validation.
2171
 *
2172
 * Returns a new URI string (to be freed by the caller) or NULL in case
2173
 * error.
2174
 */
2175
xmlChar *
2176
xmlBuildRelativeURI (const xmlChar * URI, const xmlChar * base)
2177
3.51k
{
2178
3.51k
    xmlChar *val = NULL;
2179
3.51k
    int ret;
2180
3.51k
    int ix;
2181
3.51k
    int nbslash = 0;
2182
3.51k
    int len;
2183
3.51k
    xmlURIPtr ref = NULL;
2184
3.51k
    xmlURIPtr bas = NULL;
2185
3.51k
    xmlChar *bptr, *uptr, *vptr;
2186
3.51k
    int remove_path = 0;
2187
2188
3.51k
    if ((URI == NULL) || (*URI == 0))
2189
0
  return NULL;
2190
2191
    /*
2192
     * First parse URI into a standard form
2193
     */
2194
3.51k
    ref = xmlCreateURI ();
2195
3.51k
    if (ref == NULL)
2196
0
  return NULL;
2197
    /* If URI not already in "relative" form */
2198
3.51k
    if (URI[0] != '.') {
2199
0
  ret = xmlParseURIReference (ref, (const char *) URI);
2200
0
  if (ret != 0)
2201
0
      goto done;   /* Error in URI, return NULL */
2202
0
    } else
2203
3.51k
  ref->path = (char *)xmlStrdup(URI);
2204
2205
    /*
2206
     * Next parse base into the same standard form
2207
     */
2208
3.51k
    if ((base == NULL) || (*base == 0)) {
2209
3.49k
  val = xmlStrdup (URI);
2210
3.49k
  goto done;
2211
3.49k
    }
2212
28
    bas = xmlCreateURI ();
2213
28
    if (bas == NULL)
2214
0
  goto done;
2215
28
    if (base[0] != '.') {
2216
28
  ret = xmlParseURIReference (bas, (const char *) base);
2217
28
  if (ret != 0)
2218
0
      goto done;   /* Error in base, return NULL */
2219
28
    } else
2220
0
  bas->path = (char *)xmlStrdup(base);
2221
2222
    /*
2223
     * If the scheme / server on the URI differs from the base,
2224
     * just return the URI
2225
     */
2226
28
    if ((ref->scheme != NULL) &&
2227
28
  ((bas->scheme == NULL) ||
2228
0
   (xmlStrcmp ((xmlChar *)bas->scheme, (xmlChar *)ref->scheme)) ||
2229
0
   (xmlStrcmp ((xmlChar *)bas->server, (xmlChar *)ref->server)))) {
2230
0
  val = xmlStrdup (URI);
2231
0
  goto done;
2232
0
    }
2233
28
    if (xmlStrEqual((xmlChar *)bas->path, (xmlChar *)ref->path)) {
2234
0
  val = xmlStrdup(BAD_CAST "");
2235
0
  goto done;
2236
0
    }
2237
28
    if (bas->path == NULL) {
2238
0
  val = xmlStrdup((xmlChar *)ref->path);
2239
0
  goto done;
2240
0
    }
2241
28
    if (ref->path == NULL) {
2242
0
        ref->path = (char *) "/";
2243
0
  remove_path = 1;
2244
0
    }
2245
2246
    /*
2247
     * At this point (at last!) we can compare the two paths
2248
     *
2249
     * First we take care of the special case where either of the
2250
     * two path components may be missing (bug 316224)
2251
     */
2252
28
    bptr = (xmlChar *)bas->path;
2253
28
    {
2254
28
        xmlChar *rptr = (xmlChar *) ref->path;
2255
28
        int pos = 0;
2256
2257
        /*
2258
         * Next we compare the two strings and find where they first differ
2259
         */
2260
28
  if ((*rptr == '.') && (rptr[1] == '/'))
2261
0
            rptr += 2;
2262
28
  if ((*bptr == '.') && (bptr[1] == '/'))
2263
0
            bptr += 2;
2264
28
  else if ((*bptr == '/') && (*rptr != '/'))
2265
0
      bptr++;
2266
28
  while ((bptr[pos] == rptr[pos]) && (bptr[pos] != 0))
2267
0
      pos++;
2268
2269
28
  if (bptr[pos] == rptr[pos]) {
2270
0
      val = xmlStrdup(BAD_CAST "");
2271
0
      goto done;    /* (I can't imagine why anyone would do this) */
2272
0
  }
2273
2274
  /*
2275
   * In URI, "back up" to the last '/' encountered.  This will be the
2276
   * beginning of the "unique" suffix of URI
2277
   */
2278
28
  ix = pos;
2279
28
  for (; ix > 0; ix--) {
2280
0
      if (rptr[ix - 1] == '/')
2281
0
    break;
2282
0
  }
2283
28
  uptr = (xmlChar *)&rptr[ix];
2284
2285
  /*
2286
   * In base, count the number of '/' from the differing point
2287
   */
2288
68
  for (; bptr[ix] != 0; ix++) {
2289
40
      if (bptr[ix] == '/')
2290
0
    nbslash++;
2291
40
  }
2292
2293
  /*
2294
   * e.g: URI="foo/" base="foo/bar" -> "./"
2295
   */
2296
28
  if (nbslash == 0 && !uptr[0]) {
2297
0
      val = xmlStrdup(BAD_CAST "./");
2298
0
      goto done;
2299
0
  }
2300
2301
28
  len = xmlStrlen (uptr) + 1;
2302
28
    }
2303
2304
28
    if (nbslash == 0) {
2305
28
  if (uptr != NULL)
2306
      /* exception characters from xmlSaveUri */
2307
28
      val = xmlURIEscapeStr(uptr, BAD_CAST "/;&=+$,");
2308
28
  goto done;
2309
28
    }
2310
2311
    /*
2312
     * Allocate just enough space for the returned string -
2313
     * length of the remainder of the URI, plus enough space
2314
     * for the "../" groups, plus one for the terminator
2315
     */
2316
0
    val = (xmlChar *) xmlMalloc (len + 3 * nbslash);
2317
0
    if (val == NULL) {
2318
0
        xmlURIErrMemory("building relative URI\n");
2319
0
  goto done;
2320
0
    }
2321
0
    vptr = val;
2322
    /*
2323
     * Put in as many "../" as needed
2324
     */
2325
0
    for (; nbslash>0; nbslash--) {
2326
0
  *vptr++ = '.';
2327
0
  *vptr++ = '.';
2328
0
  *vptr++ = '/';
2329
0
    }
2330
    /*
2331
     * Finish up with the end of the URI
2332
     */
2333
0
    if (uptr != NULL) {
2334
0
        if ((vptr > val) && (len > 0) &&
2335
0
      (uptr[0] == '/') && (vptr[-1] == '/')) {
2336
0
      memcpy (vptr, uptr + 1, len - 1);
2337
0
      vptr[len - 2] = 0;
2338
0
  } else {
2339
0
      memcpy (vptr, uptr, len);
2340
0
      vptr[len - 1] = 0;
2341
0
  }
2342
0
    } else {
2343
0
  vptr[len - 1] = 0;
2344
0
    }
2345
2346
    /* escape the freshly-built path */
2347
0
    vptr = val;
2348
  /* exception characters from xmlSaveUri */
2349
0
    val = xmlURIEscapeStr(vptr, BAD_CAST "/;&=+$,");
2350
0
    xmlFree(vptr);
2351
2352
3.51k
done:
2353
    /*
2354
     * Free the working variables
2355
     */
2356
3.51k
    if (remove_path != 0)
2357
0
        ref->path = NULL;
2358
3.51k
    if (ref != NULL)
2359
3.51k
  xmlFreeURI (ref);
2360
3.51k
    if (bas != NULL)
2361
28
  xmlFreeURI (bas);
2362
2363
3.51k
    return val;
2364
0
}
2365
2366
/**
2367
 * xmlCanonicPath:
2368
 * @path:  the resource locator in a filesystem notation
2369
 *
2370
 * Constructs a canonic path from the specified path.
2371
 *
2372
 * Returns a new canonic path, or a duplicate of the path parameter if the
2373
 * construction fails. The caller is responsible for freeing the memory occupied
2374
 * by the returned string. If there is insufficient memory available, or the
2375
 * argument is NULL, the function returns NULL.
2376
 */
2377
#define IS_WINDOWS_PATH(p)          \
2378
  ((p != NULL) &&           \
2379
   (((p[0] >= 'a') && (p[0] <= 'z')) ||     \
2380
    ((p[0] >= 'A') && (p[0] <= 'Z'))) &&      \
2381
   (p[1] == ':') && ((p[2] == '/') || (p[2] == '\\')))
2382
xmlChar *
2383
xmlCanonicPath(const xmlChar *path)
2384
4.56M
{
2385
/*
2386
 * For Windows implementations, additional work needs to be done to
2387
 * replace backslashes in pathnames with "forward slashes"
2388
 */
2389
#if defined(_WIN32)
2390
    int len = 0;
2391
    char *p = NULL;
2392
#endif
2393
4.56M
    xmlURIPtr uri;
2394
4.56M
    xmlChar *ret;
2395
4.56M
    const xmlChar *absuri;
2396
2397
4.56M
    if (path == NULL)
2398
0
  return(NULL);
2399
2400
#if defined(_WIN32)
2401
    /*
2402
     * We must not change the backslashes to slashes if the the path
2403
     * starts with \\?\
2404
     * Those paths can be up to 32k characters long.
2405
     * Was added specifically for OpenOffice, those paths can't be converted
2406
     * to URIs anyway.
2407
     */
2408
    if ((path[0] == '\\') && (path[1] == '\\') && (path[2] == '?') &&
2409
        (path[3] == '\\') )
2410
  return xmlStrdup((const xmlChar *) path);
2411
#endif
2412
2413
  /* sanitize filename starting with // so it can be used as URI */
2414
4.56M
    if ((path[0] == '/') && (path[1] == '/') && (path[2] != '/'))
2415
15.6k
        path++;
2416
2417
4.56M
    if ((uri = xmlParseURI((const char *) path)) != NULL) {
2418
4.10M
  xmlFreeURI(uri);
2419
4.10M
  return xmlStrdup(path);
2420
4.10M
    }
2421
2422
    /* Check if this is an "absolute uri" */
2423
454k
    absuri = xmlStrstr(path, BAD_CAST "://");
2424
454k
    if (absuri != NULL) {
2425
54.7k
        int l, j;
2426
54.7k
  unsigned char c;
2427
54.7k
  xmlChar *escURI;
2428
2429
        /*
2430
   * this looks like an URI where some parts have not been
2431
   * escaped leading to a parsing problem.  Check that the first
2432
   * part matches a protocol.
2433
   */
2434
54.7k
  l = absuri - path;
2435
  /* Bypass if first part (part before the '://') is > 20 chars */
2436
54.7k
  if ((l <= 0) || (l > 20))
2437
9.70k
      goto path_processing;
2438
  /* Bypass if any non-alpha characters are present in first part */
2439
170k
  for (j = 0;j < l;j++) {
2440
133k
      c = path[j];
2441
133k
      if (!(((c >= 'a') && (c <= 'z')) || ((c >= 'A') && (c <= 'Z'))))
2442
7.96k
          goto path_processing;
2443
133k
  }
2444
2445
  /* Escape all except the characters specified in the supplied path */
2446
37.0k
        escURI = xmlURIEscapeStr(path, BAD_CAST ":/?_.#&;=");
2447
37.0k
  if (escURI != NULL) {
2448
      /* Try parsing the escaped path */
2449
37.0k
      uri = xmlParseURI((const char *) escURI);
2450
      /* If successful, return the escaped string */
2451
37.0k
      if (uri != NULL) {
2452
30.0k
          xmlFreeURI(uri);
2453
30.0k
    return escURI;
2454
30.0k
      }
2455
6.93k
            xmlFree(escURI);
2456
6.93k
  }
2457
37.0k
    }
2458
2459
424k
path_processing:
2460
/* For Windows implementations, replace backslashes with 'forward slashes' */
2461
#if defined(_WIN32)
2462
    /*
2463
     * Create a URI structure
2464
     */
2465
    uri = xmlCreateURI();
2466
    if (uri == NULL) {    /* Guard against 'out of memory' */
2467
        return(NULL);
2468
    }
2469
2470
    len = xmlStrlen(path);
2471
    if ((len > 2) && IS_WINDOWS_PATH(path)) {
2472
        /* make the scheme 'file' */
2473
  uri->scheme = (char *) xmlStrdup(BAD_CAST "file");
2474
  /* allocate space for leading '/' + path + string terminator */
2475
  uri->path = xmlMallocAtomic(len + 2);
2476
  if (uri->path == NULL) {
2477
      xmlFreeURI(uri);  /* Guard against 'out of memory' */
2478
      return(NULL);
2479
  }
2480
  /* Put in leading '/' plus path */
2481
  uri->path[0] = '/';
2482
  p = uri->path + 1;
2483
  strncpy(p, (char *) path, len + 1);
2484
    } else {
2485
  uri->path = (char *) xmlStrdup(path);
2486
  if (uri->path == NULL) {
2487
      xmlFreeURI(uri);
2488
      return(NULL);
2489
  }
2490
  p = uri->path;
2491
    }
2492
    /* Now change all occurrences of '\' to '/' */
2493
    while (*p != '\0') {
2494
  if (*p == '\\')
2495
      *p = '/';
2496
  p++;
2497
    }
2498
2499
    if (uri->scheme == NULL) {
2500
  ret = xmlStrdup((const xmlChar *) uri->path);
2501
    } else {
2502
  ret = xmlSaveUri(uri);
2503
    }
2504
2505
    xmlFreeURI(uri);
2506
#else
2507
424k
    ret = xmlStrdup((const xmlChar *) path);
2508
424k
#endif
2509
424k
    return(ret);
2510
454k
}
2511
2512
/**
2513
 * xmlPathToURI:
2514
 * @path:  the resource locator in a filesystem notation
2515
 *
2516
 * Constructs an URI expressing the existing path
2517
 *
2518
 * Returns a new URI, or a duplicate of the path parameter if the
2519
 * construction fails. The caller is responsible for freeing the memory
2520
 * occupied by the returned string. If there is insufficient memory available,
2521
 * or the argument is NULL, the function returns NULL.
2522
 */
2523
xmlChar *
2524
xmlPathToURI(const xmlChar *path)
2525
576k
{
2526
576k
    xmlURIPtr uri;
2527
576k
    xmlURI temp;
2528
576k
    xmlChar *ret, *cal;
2529
2530
576k
    if (path == NULL)
2531
0
        return(NULL);
2532
2533
576k
    if ((uri = xmlParseURI((const char *) path)) != NULL) {
2534
288k
  xmlFreeURI(uri);
2535
288k
  return xmlStrdup(path);
2536
288k
    }
2537
288k
    cal = xmlCanonicPath(path);
2538
288k
    if (cal == NULL)
2539
0
        return(NULL);
2540
#if defined(_WIN32)
2541
    /* xmlCanonicPath can return an URI on Windows (is that the intended behaviour?)
2542
       If 'cal' is a valid URI already then we are done here, as continuing would make
2543
       it invalid. */
2544
    if ((uri = xmlParseURI((const char *) cal)) != NULL) {
2545
  xmlFreeURI(uri);
2546
  return cal;
2547
    }
2548
    /* 'cal' can contain a relative path with backslashes. If that is processed
2549
       by xmlSaveURI, they will be escaped and the external entity loader machinery
2550
       will fail. So convert them to slashes. Misuse 'ret' for walking. */
2551
    ret = cal;
2552
    while (*ret != '\0') {
2553
  if (*ret == '\\')
2554
      *ret = '/';
2555
  ret++;
2556
    }
2557
#endif
2558
288k
    memset(&temp, 0, sizeof(temp));
2559
288k
    temp.path = (char *) cal;
2560
288k
    ret = xmlSaveUri(&temp);
2561
288k
    xmlFree(cal);
2562
288k
    return(ret);
2563
288k
}