Coverage Report

Created: 2023-03-09 18:04

/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.31M
#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
980M
#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
980M
#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
320M
#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
278M
#define IS_DIGIT(x) (((x) >= '0') && ((x) <= '9'))
86
87
/*
88
 * alphanum = alpha | digit
89
 */
90
91
980M
#define IS_ALPHANUM(x) (IS_ALPHA(x) || IS_DIGIT(x))
92
93
/*
94
 * mark = "-" | "_" | "." | "!" | "~" | "*" | "'" | "(" | ")"
95
 */
96
97
228M
#define IS_MARK(x) (((x) == '-') || ((x) == '_') || ((x) == '.') ||     \
98
228M
    ((x) == '!') || ((x) == '~') || ((x) == '*') || ((x) == '\'') ||    \
99
228M
    ((x) == '(') || ((x) == ')'))
100
101
/*
102
 * unwise = "{" | "}" | "|" | "\" | "^" | "`"
103
 */
104
105
#define IS_UNWISE(p)                                                    \
106
46.5k
      (((*(p) == '{')) || ((*(p) == '}')) || ((*(p) == '|')) ||         \
107
46.5k
       ((*(p) == '\\')) || ((*(p) == '^')) || ((*(p) == '[')) ||        \
108
46.5k
       ((*(p) == ']')) || ((*(p) == '`')))
109
/*
110
 * reserved = ";" | "/" | "?" | ":" | "@" | "&" | "=" | "+" | "$" | "," |
111
 *            "[" | "]"
112
 */
113
114
367k
#define IS_RESERVED(x) (((x) == ';') || ((x) == '/') || ((x) == '?') || \
115
367k
        ((x) == ':') || ((x) == '@') || ((x) == '&') || ((x) == '=') || \
116
367k
        ((x) == '+') || ((x) == '$') || ((x) == ',') || ((x) == '[') || \
117
367k
        ((x) == ']'))
118
119
/*
120
 * unreserved = alphanum | mark
121
 */
122
123
490M
#define IS_UNRESERVED(x) (IS_ALPHANUM(x) || IS_MARK(x))
124
125
/*
126
 * Skip to next pointer char, handle escaped sequences
127
 */
128
129
566M
#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
3.72M
#define STRNDUP(s, n) (char *) xmlStrndup((const xmlChar *)(s), (n))
142
143
/************************************************************************
144
 *                  *
145
 *                         RFC 3986 parser        *
146
 *                  *
147
 ************************************************************************/
148
149
1.14G
#define ISA_DIGIT(p) ((*(p) >= '0') && (*(p) <= '9'))
150
634M
#define ISA_ALPHA(p) (((*(p) >= 'a') && (*(p) <= 'z')) ||   \
151
634M
                      ((*(p) >= 'A') && (*(p) <= 'Z')))
152
#define ISA_HEXDIG(p)             \
153
397M
       (ISA_DIGIT(p) || ((*(p) >= 'a') && (*(p) <= 'f')) ||   \
154
397M
        ((*(p) >= 'A') && (*(p) <= 'F')))
155
156
/*
157
 *    sub-delims    = "!" / "$" / "&" / "'" / "(" / ")"
158
 *                     / "*" / "+" / "," / ";" / "="
159
 */
160
#define ISA_SUB_DELIM(p)            \
161
614M
      (((*(p) == '!')) || ((*(p) == '$')) || ((*(p) == '&')) ||   \
162
43.5M
       ((*(p) == '(')) || ((*(p) == ')')) || ((*(p) == '*')) ||   \
163
43.5M
       ((*(p) == '+')) || ((*(p) == ',')) || ((*(p) == ';')) ||   \
164
43.5M
       ((*(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
1.17G
      ((ISA_ALPHA(p)) || (ISA_DIGIT(p)) || ((*(p) == '-')) ||   \
184
588M
       ((*(p) == '.')) || ((*(p) == '_')) || ((*(p) == '~')))
185
186
/*
187
 *    pct-encoded   = "%" HEXDIG HEXDIG
188
 */
189
#define ISA_PCT_ENCODED(p)            \
190
831M
     ((*(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
1.00G
     (ISA_UNRESERVED(p) || ISA_PCT_ENCODED(p) || ISA_SUB_DELIM(p) ||  \
197
530M
      ((*(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
4.75M
xmlParse3986Scheme(xmlURIPtr uri, const char **str) {
212
4.75M
    const char *cur;
213
214
4.75M
    if (str == NULL)
215
0
  return(-1);
216
217
4.75M
    cur = *str;
218
4.75M
    if (!ISA_ALPHA(cur))
219
1.17M
  return(2);
220
3.57M
    cur++;
221
20.3M
    while (ISA_ALPHA(cur) || ISA_DIGIT(cur) ||
222
20.3M
           (*cur == '+') || (*cur == '-') || (*cur == '.')) cur++;
223
3.57M
    if (uri != NULL) {
224
3.57M
  if (uri->scheme != NULL) xmlFree(uri->scheme);
225
3.57M
  uri->scheme = STRNDUP(*str, cur - *str);
226
3.57M
    }
227
3.57M
    *str = cur;
228
3.57M
    return(0);
229
4.75M
}
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
282k
{
249
282k
    const char *cur;
250
251
282k
    if (str == NULL)
252
0
        return (-1);
253
254
282k
    cur = *str;
255
256
15.6M
    while ((ISA_PCHAR(cur)) || (*cur == '/') || (*cur == '?') ||
257
15.6M
           (*cur == '[') || (*cur == ']') ||
258
15.6M
           ((uri != NULL) && (uri->cleanup & 1) && (IS_UNWISE(cur))))
259
15.3M
        NEXT(cur);
260
282k
    if (uri != NULL) {
261
282k
        if (uri->fragment != NULL)
262
0
            xmlFree(uri->fragment);
263
282k
  if (uri->cleanup & 2)
264
0
      uri->fragment = STRNDUP(*str, cur - *str);
265
282k
  else
266
282k
      uri->fragment = xmlURIUnescapeString(*str, cur - *str, NULL);
267
282k
    }
268
282k
    *str = cur;
269
282k
    return (0);
270
282k
}
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
155k
{
286
155k
    const char *cur;
287
288
155k
    if (str == NULL)
289
0
        return (-1);
290
291
155k
    cur = *str;
292
293
18.8M
    while ((ISA_PCHAR(cur)) || (*cur == '/') || (*cur == '?') ||
294
18.8M
           ((uri != NULL) && (uri->cleanup & 1) && (IS_UNWISE(cur))))
295
18.7M
        NEXT(cur);
296
155k
    if (uri != NULL) {
297
155k
        if (uri->query != NULL)
298
0
            xmlFree(uri->query);
299
155k
  if (uri->cleanup & 2)
300
0
      uri->query = STRNDUP(*str, cur - *str);
301
155k
  else
302
155k
      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
155k
  if (uri->query_raw != NULL)
308
0
      xmlFree (uri->query_raw);
309
155k
  uri->query_raw = STRNDUP (*str, cur - *str);
310
155k
    }
311
155k
    *str = cur;
312
155k
    return (0);
313
155k
}
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
36.5k
{
330
36.5k
    const char *cur = *str;
331
36.5k
    int port = 0;
332
333
36.5k
    if (ISA_DIGIT(cur)) {
334
63.9k
  while (ISA_DIGIT(cur)) {
335
61.2k
            int digit = *cur - '0';
336
337
61.2k
            if (port > INT_MAX / 10)
338
1.46k
                return(1);
339
59.8k
            port *= 10;
340
59.8k
            if (port > INT_MAX - digit)
341
0
                return(1);
342
59.8k
      port += digit;
343
344
59.8k
      cur++;
345
59.8k
  }
346
2.62k
  if (uri != NULL)
347
2.62k
      uri->port = port;
348
2.62k
  *str = cur;
349
2.62k
  return(0);
350
4.08k
    }
351
32.4k
    return(1);
352
36.5k
}
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
936k
{
369
936k
    const char *cur;
370
371
936k
    cur = *str;
372
40.4M
    while (ISA_UNRESERVED(cur) || ISA_PCT_ENCODED(cur) ||
373
40.4M
           ISA_SUB_DELIM(cur) || (*cur == ':'))
374
39.5M
  NEXT(cur);
375
936k
    if (*cur == '@') {
376
39.3k
  if (uri != NULL) {
377
39.3k
      if (uri->user != NULL) xmlFree(uri->user);
378
39.3k
      if (uri->cleanup & 2)
379
0
    uri->user = STRNDUP(*str, cur - *str);
380
39.3k
      else
381
39.3k
    uri->user = xmlURIUnescapeString(*str, cur - *str, NULL);
382
39.3k
  }
383
39.3k
  *str = cur;
384
39.3k
  return(0);
385
39.3k
    }
386
897k
    return(1);
387
936k
}
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
45.9k
xmlParse3986DecOctet(const char **str) {
405
45.9k
    const char *cur = *str;
406
407
45.9k
    if (!(ISA_DIGIT(cur)))
408
1.96k
        return(1);
409
44.0k
    if (!ISA_DIGIT(cur+1))
410
11.3k
  cur++;
411
32.6k
    else if ((*cur != '0') && (ISA_DIGIT(cur + 1)) && (!ISA_DIGIT(cur+2)))
412
6.20k
  cur += 2;
413
26.4k
    else if ((*cur == '1') && (ISA_DIGIT(cur + 1)) && (ISA_DIGIT(cur + 2)))
414
3.66k
  cur += 3;
415
22.7k
    else if ((*cur == '2') && (*(cur + 1) >= '0') &&
416
22.7k
       (*(cur + 1) <= '4') && (ISA_DIGIT(cur + 2)))
417
1.06k
  cur += 3;
418
21.6k
    else if ((*cur == '2') && (*(cur + 1) == '5') &&
419
21.6k
       (*(cur + 2) >= '0') && (*(cur + 1) <= '5'))
420
141
  cur += 3;
421
21.5k
    else
422
21.5k
        return(1);
423
22.4k
    *str = cur;
424
22.4k
    return(0);
425
44.0k
}
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
936k
{
444
936k
    const char *cur = *str;
445
936k
    const char *host;
446
447
936k
    host = cur;
448
    /*
449
     * IPv6 and future addressing scheme are enclosed between brackets
450
     */
451
936k
    if (*cur == '[') {
452
2.53k
        cur++;
453
1.35M
  while ((*cur != ']') && (*cur != 0))
454
1.35M
      cur++;
455
2.53k
  if (*cur != ']')
456
1.80k
      return(1);
457
725
  cur++;
458
725
  goto found;
459
2.53k
    }
460
    /*
461
     * try to parse an IPv4
462
     */
463
934k
    if (ISA_DIGIT(cur)) {
464
42.6k
        if (xmlParse3986DecOctet(&cur) != 0)
465
21.3k
      goto not_ipv4;
466
21.3k
  if (*cur != '.')
467
18.2k
      goto not_ipv4;
468
3.08k
  cur++;
469
3.08k
        if (xmlParse3986DecOctet(&cur) != 0)
470
1.92k
      goto not_ipv4;
471
1.15k
  if (*cur != '.')
472
939
      goto not_ipv4;
473
219
        if (xmlParse3986DecOctet(&cur) != 0)
474
219
      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
42.6k
not_ipv4:
481
42.6k
        cur = *str;
482
42.6k
    }
483
    /*
484
     * then this should be a hostname which can be empty
485
     */
486
18.0M
    while (ISA_UNRESERVED(cur) || ISA_PCT_ENCODED(cur) || ISA_SUB_DELIM(cur))
487
17.1M
        NEXT(cur);
488
934k
found:
489
934k
    if (uri != NULL) {
490
934k
  if (uri->authority != NULL) xmlFree(uri->authority);
491
934k
  uri->authority = NULL;
492
934k
  if (uri->server != NULL) xmlFree(uri->server);
493
934k
  if (cur != host) {
494
886k
      if (uri->cleanup & 2)
495
0
    uri->server = STRNDUP(host, cur - host);
496
886k
      else
497
886k
    uri->server = xmlURIUnescapeString(host, cur - host, NULL);
498
886k
  } else
499
48.1k
      uri->server = NULL;
500
934k
    }
501
934k
    *str = cur;
502
934k
    return(0);
503
934k
}
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
936k
{
520
936k
    const char *cur;
521
936k
    int ret;
522
523
936k
    cur = *str;
524
    /*
525
     * try to parse an userinfo and check for the trailing @
526
     */
527
936k
    ret = xmlParse3986Userinfo(uri, &cur);
528
936k
    if ((ret != 0) || (*cur != '@'))
529
897k
        cur = *str;
530
39.3k
    else
531
39.3k
        cur++;
532
936k
    ret = xmlParse3986Host(uri, &cur);
533
936k
    if (ret != 0) return(ret);
534
934k
    if (*cur == ':') {
535
36.5k
        cur++;
536
36.5k
        ret = xmlParse3986Port(uri, &cur);
537
36.5k
  if (ret != 0) return(ret);
538
36.5k
    }
539
900k
    *str = cur;
540
900k
    return(0);
541
934k
}
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
16.8M
{
562
16.8M
    const char *cur;
563
564
16.8M
    cur = *str;
565
16.8M
    if (!ISA_PCHAR(cur)) {
566
2.21M
        if (empty)
567
2.18M
      return(0);
568
24.1k
  return(1);
569
2.21M
    }
570
474M
    while (ISA_PCHAR(cur) && (*cur != forbid))
571
459M
        NEXT(cur);
572
14.6M
    *str = cur;
573
14.6M
    return (0);
574
16.8M
}
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
900k
{
591
900k
    const char *cur;
592
900k
    int ret;
593
594
900k
    cur = *str;
595
596
3.87M
    while (*cur == '/') {
597
2.97M
        cur++;
598
2.97M
  ret = xmlParse3986Segment(&cur, 0, 1);
599
2.97M
  if (ret != 0) return(ret);
600
2.97M
    }
601
900k
    if (uri != NULL) {
602
900k
  if (uri->path != NULL) xmlFree(uri->path);
603
900k
        if (*str != cur) {
604
621k
            if (uri->cleanup & 2)
605
0
                uri->path = STRNDUP(*str, cur - *str);
606
621k
            else
607
621k
                uri->path = xmlURIUnescapeString(*str, cur - *str, NULL);
608
621k
        } else {
609
279k
            uri->path = NULL;
610
279k
        }
611
900k
    }
612
900k
    *str = cur;
613
900k
    return (0);
614
900k
}
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
68.5k
{
631
68.5k
    const char *cur;
632
68.5k
    int ret;
633
634
68.5k
    cur = *str;
635
636
68.5k
    if (*cur != '/')
637
0
        return(1);
638
68.5k
    cur++;
639
68.5k
    ret = xmlParse3986Segment(&cur, 0, 0);
640
68.5k
    if (ret == 0) {
641
257k
  while (*cur == '/') {
642
212k
      cur++;
643
212k
      ret = xmlParse3986Segment(&cur, 0, 1);
644
212k
      if (ret != 0) return(ret);
645
212k
  }
646
44.4k
    }
647
68.5k
    if (uri != NULL) {
648
68.5k
  if (uri->path != NULL) xmlFree(uri->path);
649
68.5k
        if (cur != *str) {
650
68.5k
            if (uri->cleanup & 2)
651
0
                uri->path = STRNDUP(*str, cur - *str);
652
68.5k
            else
653
68.5k
                uri->path = xmlURIUnescapeString(*str, cur - *str, NULL);
654
68.5k
        } else {
655
0
            uri->path = NULL;
656
0
        }
657
68.5k
    }
658
68.5k
    *str = cur;
659
68.5k
    return (0);
660
68.5k
}
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
308k
{
677
308k
    const char *cur;
678
308k
    int ret;
679
680
308k
    cur = *str;
681
682
308k
    ret = xmlParse3986Segment(&cur, 0, 0);
683
308k
    if (ret != 0) return(ret);
684
443k
    while (*cur == '/') {
685
135k
        cur++;
686
135k
  ret = xmlParse3986Segment(&cur, 0, 1);
687
135k
  if (ret != 0) return(ret);
688
135k
    }
689
308k
    if (uri != NULL) {
690
308k
  if (uri->path != NULL) xmlFree(uri->path);
691
308k
        if (cur != *str) {
692
308k
            if (uri->cleanup & 2)
693
0
                uri->path = STRNDUP(*str, cur - *str);
694
308k
            else
695
308k
                uri->path = xmlURIUnescapeString(*str, cur - *str, NULL);
696
308k
        } else {
697
0
            uri->path = NULL;
698
0
        }
699
308k
    }
700
308k
    *str = cur;
701
308k
    return (0);
702
308k
}
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
3.31M
{
719
3.31M
    const char *cur;
720
3.31M
    int ret;
721
722
3.31M
    cur = *str;
723
724
3.31M
    ret = xmlParse3986Segment(&cur, ':', 0);
725
3.31M
    if (ret != 0) return(ret);
726
13.1M
    while (*cur == '/') {
727
9.86M
        cur++;
728
9.86M
  ret = xmlParse3986Segment(&cur, 0, 1);
729
9.86M
  if (ret != 0) return(ret);
730
9.86M
    }
731
3.31M
    if (uri != NULL) {
732
3.31M
  if (uri->path != NULL) xmlFree(uri->path);
733
3.31M
        if (cur != *str) {
734
3.30M
            if (uri->cleanup & 2)
735
0
                uri->path = STRNDUP(*str, cur - *str);
736
3.30M
            else
737
3.30M
                uri->path = xmlURIUnescapeString(*str, cur - *str, NULL);
738
3.30M
        } else {
739
3.95k
            uri->path = NULL;
740
3.95k
        }
741
3.31M
    }
742
3.31M
    *str = cur;
743
3.31M
    return (0);
744
3.31M
}
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.27M
{
764
1.27M
    const char *cur;
765
1.27M
    int ret;
766
767
1.27M
    cur = *str;
768
769
1.27M
    if ((*cur == '/') && (*(cur + 1) == '/')) {
770
904k
        cur += 2;
771
904k
  ret = xmlParse3986Authority(uri, &cur);
772
904k
  if (ret != 0) return(ret);
773
870k
  if (uri->server == NULL)
774
21.7k
      uri->port = -1;
775
870k
  ret = xmlParse3986PathAbEmpty(uri, &cur);
776
870k
  if (ret != 0) return(ret);
777
870k
  *str = cur;
778
870k
  return(0);
779
870k
    } else if (*cur == '/') {
780
42.1k
        ret = xmlParse3986PathAbsolute(uri, &cur);
781
42.1k
  if (ret != 0) return(ret);
782
331k
    } else if (ISA_PCHAR(cur)) {
783
308k
        ret = xmlParse3986PathRootless(uri, &cur);
784
308k
  if (ret != 0) return(ret);
785
308k
    } else {
786
  /* path-empty is effectively empty */
787
23.6k
  if (uri != NULL) {
788
23.6k
      if (uri->path != NULL) xmlFree(uri->path);
789
23.6k
      uri->path = NULL;
790
23.6k
  }
791
23.6k
    }
792
373k
    *str = cur;
793
373k
    return (0);
794
1.27M
}
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
3.94M
xmlParse3986RelativeRef(xmlURIPtr uri, const char *str) {
814
3.94M
    int ret;
815
816
3.94M
    if ((*str == '/') && (*(str + 1) == '/')) {
817
32.4k
        str += 2;
818
32.4k
  ret = xmlParse3986Authority(uri, &str);
819
32.4k
  if (ret != 0) return(ret);
820
30.2k
  ret = xmlParse3986PathAbEmpty(uri, &str);
821
30.2k
  if (ret != 0) return(ret);
822
3.90M
    } else if (*str == '/') {
823
26.3k
  ret = xmlParse3986PathAbsolute(uri, &str);
824
26.3k
  if (ret != 0) return(ret);
825
3.88M
    } else if (ISA_PCHAR(str)) {
826
3.31M
        ret = xmlParse3986PathNoScheme(uri, &str);
827
3.31M
  if (ret != 0) return(ret);
828
3.31M
    } else {
829
  /* path-empty is effectively empty */
830
570k
  if (uri != NULL) {
831
570k
      if (uri->path != NULL) xmlFree(uri->path);
832
570k
      uri->path = NULL;
833
570k
  }
834
570k
    }
835
836
3.94M
    if (*str == '?') {
837
104k
  str++;
838
104k
  ret = xmlParse3986Query(uri, &str);
839
104k
  if (ret != 0) return(ret);
840
104k
    }
841
3.94M
    if (*str == '#') {
842
172k
  str++;
843
172k
  ret = xmlParse3986Fragment(uri, &str);
844
172k
  if (ret != 0) return(ret);
845
172k
    }
846
3.94M
    if (*str != 0) {
847
1.08M
  xmlCleanURI(uri);
848
1.08M
  return(1);
849
1.08M
    }
850
2.85M
    return(0);
851
3.94M
}
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
4.75M
xmlParse3986URI(xmlURIPtr uri, const char *str) {
868
4.75M
    int ret;
869
870
4.75M
    ret = xmlParse3986Scheme(uri, &str);
871
4.75M
    if (ret != 0) return(ret);
872
3.57M
    if (*str != ':') {
873
2.29M
  return(1);
874
2.29M
    }
875
1.27M
    str++;
876
1.27M
    ret = xmlParse3986HierPart(uri, &str);
877
1.27M
    if (ret != 0) return(ret);
878
1.24M
    if (*str == '?') {
879
51.0k
  str++;
880
51.0k
  ret = xmlParse3986Query(uri, &str);
881
51.0k
  if (ret != 0) return(ret);
882
51.0k
    }
883
1.24M
    if (*str == '#') {
884
110k
  str++;
885
110k
  ret = xmlParse3986Fragment(uri, &str);
886
110k
  if (ret != 0) return(ret);
887
110k
    }
888
1.24M
    if (*str != 0) {
889
435k
  xmlCleanURI(uri);
890
435k
  return(1);
891
435k
    }
892
809k
    return(0);
893
1.24M
}
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
4.75M
xmlParse3986URIReference(xmlURIPtr uri, const char *str) {
909
4.75M
    int ret;
910
911
4.75M
    if (str == NULL)
912
0
  return(-1);
913
4.75M
    xmlCleanURI(uri);
914
915
    /*
916
     * Try first to parse absolute refs, then fallback to relative if
917
     * it fails.
918
     */
919
4.75M
    ret = xmlParse3986URI(uri, str);
920
4.75M
    if (ret != 0) {
921
3.94M
  xmlCleanURI(uri);
922
3.94M
        ret = xmlParse3986RelativeRef(uri, str);
923
3.94M
  if (ret != 0) {
924
1.09M
      xmlCleanURI(uri);
925
1.09M
      return(ret);
926
1.09M
  }
927
3.94M
    }
928
3.66M
    return(0);
929
4.75M
}
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
3.31M
xmlParseURI(const char *str) {
943
3.31M
    xmlURIPtr uri;
944
3.31M
    int ret;
945
946
3.31M
    if (str == NULL)
947
0
  return(NULL);
948
3.31M
    uri = xmlCreateURI();
949
3.31M
    if (uri != NULL) {
950
3.31M
  ret = xmlParse3986URIReference(uri, str);
951
3.31M
        if (ret) {
952
999k
      xmlFreeURI(uri);
953
999k
      return(NULL);
954
999k
  }
955
3.31M
    }
956
2.31M
    return(uri);
957
3.31M
}
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
1.43M
xmlParseURIReference(xmlURIPtr uri, const char *str) {
973
1.43M
    return(xmlParse3986URIReference(uri, str));
974
1.43M
}
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
5.23M
xmlCreateURI(void) {
1023
5.23M
    xmlURIPtr ret;
1024
1025
5.23M
    ret = (xmlURIPtr) xmlMalloc(sizeof(xmlURI));
1026
5.23M
    if (ret == NULL) {
1027
0
        xmlURIErrMemory("creating URI structure\n");
1028
0
  return(NULL);
1029
0
    }
1030
5.23M
    memset(ret, 0, sizeof(xmlURI));
1031
5.23M
    return(ret);
1032
5.23M
}
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.31M
xmlSaveUriRealloc(xmlChar *ret, int *max) {
1042
1.31M
    xmlChar *temp;
1043
1.31M
    int tmp;
1044
1045
1.31M
    if (*max > MAX_URI_LENGTH) {
1046
0
        xmlURIErrMemory("reaching arbitrary MAX_URI_LENGTH limit\n");
1047
0
        return(NULL);
1048
0
    }
1049
1.31M
    tmp = *max * 2;
1050
1.31M
    temp = (xmlChar *) xmlRealloc(ret, (tmp + 1));
1051
1.31M
    if (temp == NULL) {
1052
0
        xmlURIErrMemory("saving URI\n");
1053
0
        return(NULL);
1054
0
    }
1055
1.31M
    *max = tmp;
1056
1.31M
    return(temp);
1057
1.31M
}
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
1.54M
xmlSaveUri(xmlURIPtr uri) {
1069
1.54M
    xmlChar *ret = NULL;
1070
1.54M
    xmlChar *temp;
1071
1.54M
    const char *p;
1072
1.54M
    int len;
1073
1.54M
    int max;
1074
1075
1.54M
    if (uri == NULL) return(NULL);
1076
1077
1078
1.54M
    max = 80;
1079
1.54M
    ret = (xmlChar *) xmlMallocAtomic(max + 1);
1080
1.54M
    if (ret == NULL) {
1081
0
        xmlURIErrMemory("saving URI\n");
1082
0
  return(NULL);
1083
0
    }
1084
1.54M
    len = 0;
1085
1086
1.54M
    if (uri->scheme != NULL) {
1087
81.5k
  p = uri->scheme;
1088
637k
  while (*p != 0) {
1089
556k
      if (len >= max) {
1090
793
                temp = xmlSaveUriRealloc(ret, &max);
1091
793
                if (temp == NULL) goto mem_error;
1092
793
    ret = temp;
1093
793
      }
1094
556k
      ret[len++] = *p++;
1095
556k
  }
1096
81.5k
  if (len >= max) {
1097
35
            temp = xmlSaveUriRealloc(ret, &max);
1098
35
            if (temp == NULL) goto mem_error;
1099
35
            ret = temp;
1100
35
  }
1101
81.5k
  ret[len++] = ':';
1102
81.5k
    }
1103
1.54M
    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
1.54M
    } else {
1122
1.54M
  if ((uri->server != NULL) || (uri->port == -1)) {
1123
61.0k
      if (len + 3 >= max) {
1124
78
                temp = xmlSaveUriRealloc(ret, &max);
1125
78
                if (temp == NULL) goto mem_error;
1126
78
                ret = temp;
1127
78
      }
1128
61.0k
      ret[len++] = '/';
1129
61.0k
      ret[len++] = '/';
1130
61.0k
      if (uri->user != NULL) {
1131
13.6k
    p = uri->user;
1132
6.16M
    while (*p != 0) {
1133
6.15M
        if (len + 3 >= max) {
1134
31.2k
                        temp = xmlSaveUriRealloc(ret, &max);
1135
31.2k
                        if (temp == NULL) goto mem_error;
1136
31.2k
                        ret = temp;
1137
31.2k
        }
1138
6.15M
        if ((IS_UNRESERVED(*(p))) ||
1139
6.15M
      ((*(p) == ';')) || ((*(p) == ':')) ||
1140
6.15M
      ((*(p) == '&')) || ((*(p) == '=')) ||
1141
6.15M
      ((*(p) == '+')) || ((*(p) == '$')) ||
1142
6.15M
      ((*(p) == ',')))
1143
4.13M
      ret[len++] = *p++;
1144
2.01M
        else {
1145
2.01M
      int val = *(unsigned char *)p++;
1146
2.01M
      int hi = val / 0x10, lo = val % 0x10;
1147
2.01M
      ret[len++] = '%';
1148
2.01M
      ret[len++] = hi + (hi > 9? 'A'-10 : '0');
1149
2.01M
      ret[len++] = lo + (lo > 9? 'A'-10 : '0');
1150
2.01M
        }
1151
6.15M
    }
1152
13.6k
    if (len + 3 >= max) {
1153
364
                    temp = xmlSaveUriRealloc(ret, &max);
1154
364
                    if (temp == NULL) goto mem_error;
1155
364
                    ret = temp;
1156
364
    }
1157
13.6k
    ret[len++] = '@';
1158
13.6k
      }
1159
61.0k
      if (uri->server != NULL) {
1160
54.2k
    p = uri->server;
1161
2.10M
    while (*p != 0) {
1162
2.05M
        if (len >= max) {
1163
9.48k
      temp = xmlSaveUriRealloc(ret, &max);
1164
9.48k
      if (temp == NULL) goto mem_error;
1165
9.48k
      ret = temp;
1166
9.48k
        }
1167
2.05M
        ret[len++] = *p++;
1168
2.05M
    }
1169
54.2k
    if (uri->port > 0) {
1170
198
        if (len + 10 >= max) {
1171
30
      temp = xmlSaveUriRealloc(ret, &max);
1172
30
      if (temp == NULL) goto mem_error;
1173
30
      ret = temp;
1174
30
        }
1175
198
        len += snprintf((char *) &ret[len], max - len, ":%d", uri->port);
1176
198
    }
1177
54.2k
      }
1178
1.48M
  } 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
1.48M
  } else if (uri->scheme != NULL) {
1207
24.0k
      if (len + 3 >= max) {
1208
51
                temp = xmlSaveUriRealloc(ret, &max);
1209
51
                if (temp == NULL) goto mem_error;
1210
51
                ret = temp;
1211
51
      }
1212
24.0k
  }
1213
1.54M
  if (uri->path != NULL) {
1214
1.44M
      p = uri->path;
1215
      /*
1216
       * the colon in file:///d: should not be escaped or
1217
       * Windows accesses fail later.
1218
       */
1219
1.44M
      if ((uri->scheme != NULL) &&
1220
1.44M
    (p[0] == '/') &&
1221
1.44M
    (((p[1] >= 'a') && (p[1] <= 'z')) ||
1222
41.1k
     ((p[1] >= 'A') && (p[1] <= 'Z'))) &&
1223
1.44M
    (p[2] == ':') &&
1224
1.44M
          (xmlStrEqual(BAD_CAST uri->scheme, BAD_CAST "file"))) {
1225
0
    if (len + 3 >= max) {
1226
0
                    temp = xmlSaveUriRealloc(ret, &max);
1227
0
                    if (temp == NULL) goto mem_error;
1228
0
                    ret = temp;
1229
0
    }
1230
0
    ret[len++] = *p++;
1231
0
    ret[len++] = *p++;
1232
0
    ret[len++] = *p++;
1233
0
      }
1234
416M
      while (*p != 0) {
1235
415M
    if (len + 3 >= max) {
1236
1.17M
                    temp = xmlSaveUriRealloc(ret, &max);
1237
1.17M
                    if (temp == NULL) goto mem_error;
1238
1.17M
                    ret = temp;
1239
1.17M
    }
1240
415M
    if ((IS_UNRESERVED(*(p))) || ((*(p) == '/')) ||
1241
415M
                    ((*(p) == ';')) || ((*(p) == '@')) || ((*(p) == '&')) ||
1242
415M
              ((*(p) == '=')) || ((*(p) == '+')) || ((*(p) == '$')) ||
1243
415M
              ((*(p) == ',')))
1244
253M
        ret[len++] = *p++;
1245
162M
    else {
1246
162M
        int val = *(unsigned char *)p++;
1247
162M
        int hi = val / 0x10, lo = val % 0x10;
1248
162M
        ret[len++] = '%';
1249
162M
        ret[len++] = hi + (hi > 9? 'A'-10 : '0');
1250
162M
        ret[len++] = lo + (lo > 9? 'A'-10 : '0');
1251
162M
    }
1252
415M
      }
1253
1.44M
  }
1254
1.54M
  if (uri->query_raw != NULL) {
1255
25.9k
      if (len + 1 >= max) {
1256
309
                temp = xmlSaveUriRealloc(ret, &max);
1257
309
                if (temp == NULL) goto mem_error;
1258
309
                ret = temp;
1259
309
      }
1260
25.9k
      ret[len++] = '?';
1261
25.9k
      p = uri->query_raw;
1262
3.80M
      while (*p != 0) {
1263
3.77M
    if (len + 1 >= max) {
1264
16.4k
                    temp = xmlSaveUriRealloc(ret, &max);
1265
16.4k
                    if (temp == NULL) goto mem_error;
1266
16.4k
                    ret = temp;
1267
16.4k
    }
1268
3.77M
    ret[len++] = *p++;
1269
3.77M
      }
1270
1.51M
  } 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
1.54M
    }
1296
1.54M
    if (uri->fragment != NULL) {
1297
44.4k
  if (len + 3 >= max) {
1298
1.34k
            temp = xmlSaveUriRealloc(ret, &max);
1299
1.34k
            if (temp == NULL) goto mem_error;
1300
1.34k
            ret = temp;
1301
1.34k
  }
1302
44.4k
  ret[len++] = '#';
1303
44.4k
  p = uri->fragment;
1304
1.62M
  while (*p != 0) {
1305
1.57M
      if (len + 3 >= max) {
1306
9.82k
                temp = xmlSaveUriRealloc(ret, &max);
1307
9.82k
                if (temp == NULL) goto mem_error;
1308
9.82k
                ret = temp;
1309
9.82k
      }
1310
1.57M
      if ((IS_UNRESERVED(*(p))) || (IS_RESERVED(*(p))))
1311
1.55M
    ret[len++] = *p++;
1312
23.8k
      else {
1313
23.8k
    int val = *(unsigned char *)p++;
1314
23.8k
    int hi = val / 0x10, lo = val % 0x10;
1315
23.8k
    ret[len++] = '%';
1316
23.8k
    ret[len++] = hi + (hi > 9? 'A'-10 : '0');
1317
23.8k
    ret[len++] = lo + (lo > 9? 'A'-10 : '0');
1318
23.8k
      }
1319
1.57M
  }
1320
44.4k
    }
1321
1.54M
    if (len >= max) {
1322
161
        temp = xmlSaveUriRealloc(ret, &max);
1323
161
        if (temp == NULL) goto mem_error;
1324
161
        ret = temp;
1325
161
    }
1326
1.54M
    ret[len] = 0;
1327
1.54M
    return(ret);
1328
1329
0
mem_error:
1330
0
    xmlFree(ret);
1331
0
    return(NULL);
1332
1.54M
}
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
11.3M
xmlCleanURI(xmlURIPtr uri) {
1360
11.3M
    if (uri == NULL) return;
1361
1362
11.3M
    if (uri->scheme != NULL) xmlFree(uri->scheme);
1363
11.3M
    uri->scheme = NULL;
1364
11.3M
    if (uri->server != NULL) xmlFree(uri->server);
1365
11.3M
    uri->server = NULL;
1366
11.3M
    if (uri->user != NULL) xmlFree(uri->user);
1367
11.3M
    uri->user = NULL;
1368
11.3M
    if (uri->path != NULL) xmlFree(uri->path);
1369
11.3M
    uri->path = NULL;
1370
11.3M
    if (uri->fragment != NULL) xmlFree(uri->fragment);
1371
11.3M
    uri->fragment = NULL;
1372
11.3M
    if (uri->opaque != NULL) xmlFree(uri->opaque);
1373
11.3M
    uri->opaque = NULL;
1374
11.3M
    if (uri->authority != NULL) xmlFree(uri->authority);
1375
11.3M
    uri->authority = NULL;
1376
11.3M
    if (uri->query != NULL) xmlFree(uri->query);
1377
11.3M
    uri->query = NULL;
1378
11.3M
    if (uri->query_raw != NULL) xmlFree(uri->query_raw);
1379
11.3M
    uri->query_raw = NULL;
1380
11.3M
}
1381
1382
/**
1383
 * xmlFreeURI:
1384
 * @uri:  pointer to an xmlURI
1385
 *
1386
 * Free up the xmlURI struct
1387
 */
1388
void
1389
5.23M
xmlFreeURI(xmlURIPtr uri) {
1390
5.23M
    if (uri == NULL) return;
1391
1392
5.23M
    if (uri->scheme != NULL) xmlFree(uri->scheme);
1393
5.23M
    if (uri->server != NULL) xmlFree(uri->server);
1394
5.23M
    if (uri->user != NULL) xmlFree(uri->user);
1395
5.23M
    if (uri->path != NULL) xmlFree(uri->path);
1396
5.23M
    if (uri->fragment != NULL) xmlFree(uri->fragment);
1397
5.23M
    if (uri->opaque != NULL) xmlFree(uri->opaque);
1398
5.23M
    if (uri->authority != NULL) xmlFree(uri->authority);
1399
5.23M
    if (uri->query != NULL) xmlFree(uri->query);
1400
5.23M
    if (uri->query_raw != NULL) xmlFree(uri->query_raw);
1401
5.23M
    xmlFree(uri);
1402
5.23M
}
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
448k
xmlNormalizeURIPath(char *path) {
1423
448k
    char *cur, *out;
1424
1425
448k
    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
448k
    cur = path;
1432
536k
    while (cur[0] == '/')
1433
88.5k
      ++cur;
1434
448k
    if (cur[0] == '\0')
1435
0
      return(0);
1436
1437
    /* Keep everything we've seen so far.  */
1438
448k
    out = cur;
1439
1440
    /*
1441
     * Analyze each segment in sequence for cases (c) and (d).
1442
     */
1443
3.72M
    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.72M
  if ((cur[0] == '.') && (cur[1] == '/')) {
1449
6.69k
      cur += 2;
1450
      /* '//' normalization should be done at this point too */
1451
26.5k
      while (cur[0] == '/')
1452
19.8k
    cur++;
1453
6.69k
      continue;
1454
6.69k
  }
1455
1456
  /*
1457
   * d) If the buffer string ends with "." as a complete path segment,
1458
   *    that "." is removed.
1459
   */
1460
3.71M
  if ((cur[0] == '.') && (cur[1] == '\0'))
1461
7.95k
      break;
1462
1463
  /* Otherwise keep the segment.  */
1464
139M
  while (cur[0] != '/') {
1465
136M
            if (cur[0] == '\0')
1466
439k
              goto done_cd;
1467
135M
      (out++)[0] = (cur++)[0];
1468
135M
  }
1469
  /* normalize // */
1470
3.98M
  while ((cur[0] == '/') && (cur[1] == '/'))
1471
710k
      cur++;
1472
1473
3.27M
        (out++)[0] = (cur++)[0];
1474
3.27M
    }
1475
448k
 done_cd:
1476
448k
    out[0] = '\0';
1477
1478
    /* Reset to the beginning of the first segment for the next sequence.  */
1479
448k
    cur = path;
1480
536k
    while (cur[0] == '/')
1481
88.5k
      ++cur;
1482
448k
    if (cur[0] == '\0')
1483
7.68k
  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.70M
    while (1) {
1504
3.70M
        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.70M
        segp = cur;
1512
142M
        while ((segp[0] != '/') && (segp[0] != '\0'))
1513
138M
          ++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.70M
        if (segp[0] == '\0')
1519
439k
          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
3.26M
        ++segp;
1525
3.26M
        if (((cur[0] == '.') && (cur[1] == '.') && (segp == cur+3))
1526
3.26M
            || ((segp[0] != '.') || (segp[1] != '.')
1527
3.23M
                || ((segp[2] != '/') && (segp[2] != '\0')))) {
1528
3.18M
          cur = segp;
1529
3.18M
          continue;
1530
3.18M
        }
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
78.2k
        if (segp[2] == '\0') {
1541
661
          cur[0] = '\0';
1542
661
          break;
1543
661
        }
1544
        /* Valgrind complained, strcpy(cur, segp + 3); */
1545
        /* string will overlap, do not use strcpy */
1546
77.6k
        tmp = cur;
1547
77.6k
        segp += 3;
1548
284M
        while ((*tmp++ = *segp++) != 0)
1549
284M
          ;
1550
1551
        /* If there are no previous segments, then keep going from here.  */
1552
77.6k
        segp = cur;
1553
152k
        while ((segp > path) && ((--segp)[0] == '/'))
1554
74.9k
          ;
1555
77.6k
        if (segp == path)
1556
3.50k
          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
74.1k
        cur = segp;
1566
2.79M
        while ((cur > path) && (cur[-1] != '/'))
1567
2.72M
          --cur;
1568
74.1k
    }
1569
440k
    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
440k
    if (path[0] == '/') {
1583
31.8k
      cur = path;
1584
32.9k
      while ((cur[0] == '/') && (cur[1] == '.') && (cur[2] == '.')
1585
32.9k
             && ((cur[3] == '/') || (cur[3] == '\0')))
1586
1.09k
  cur += 3;
1587
1588
31.8k
      if (cur != path) {
1589
923
  out = path;
1590
58.9k
  while (cur[0] != '\0')
1591
58.0k
          (out++)[0] = (cur++)[0];
1592
923
  out[0] = 0;
1593
923
      }
1594
31.8k
    }
1595
1596
440k
    return(0);
1597
448k
}
1598
1599
392M
static int is_hex(char c) {
1600
392M
    if (((c >= '0') && (c <= '9')) ||
1601
392M
        ((c >= 'a') && (c <= 'f')) ||
1602
392M
        ((c >= 'A') && (c <= 'F')))
1603
392M
  return(1);
1604
132k
    return(0);
1605
392M
}
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
5.67M
xmlURIUnescapeString(const char *str, int len, char *target) {
1623
5.67M
    char *ret, *out;
1624
5.67M
    const char *in;
1625
1626
5.67M
    if (str == NULL)
1627
0
  return(NULL);
1628
5.67M
    if (len <= 0) len = strlen(str);
1629
5.67M
    if (len < 0) return(NULL);
1630
1631
5.67M
    if (target == NULL) {
1632
5.67M
  ret = (char *) xmlMallocAtomic(len + 1);
1633
5.67M
  if (ret == NULL) {
1634
0
            xmlURIErrMemory("unescaping URI value\n");
1635
0
      return(NULL);
1636
0
  }
1637
5.67M
    } else
1638
0
  ret = target;
1639
5.67M
    in = str;
1640
5.67M
    out = ret;
1641
579M
    while(len > 0) {
1642
573M
  if ((len > 2) && (*in == '%') && (is_hex(in[1])) && (is_hex(in[2]))) {
1643
196M
            int c = 0;
1644
196M
      in++;
1645
196M
      if ((*in >= '0') && (*in <= '9'))
1646
148M
          c = (*in - '0');
1647
47.8M
      else if ((*in >= 'a') && (*in <= 'f'))
1648
9.12k
          c = (*in - 'a') + 10;
1649
47.8M
      else if ((*in >= 'A') && (*in <= 'F'))
1650
47.8M
          c = (*in - 'A') + 10;
1651
196M
      in++;
1652
196M
      if ((*in >= '0') && (*in <= '9'))
1653
114M
          c = c * 16 + (*in - '0');
1654
81.6M
      else if ((*in >= 'a') && (*in <= 'f'))
1655
8.88k
          c = c * 16 + (*in - 'a') + 10;
1656
81.6M
      else if ((*in >= 'A') && (*in <= 'F'))
1657
81.6M
          c = c * 16 + (*in - 'A') + 10;
1658
196M
      in++;
1659
196M
      len -= 3;
1660
            /* Explicit sign change */
1661
196M
      *out++ = (char) c;
1662
377M
  } else {
1663
377M
      *out++ = *in++;
1664
377M
      len--;
1665
377M
  }
1666
573M
    }
1667
5.67M
    *out = 0;
1668
5.67M
    return(ret);
1669
5.67M
}
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
94.6k
xmlURIEscapeStr(const xmlChar *str, const xmlChar *list) {
1683
94.6k
    xmlChar *ret, ch;
1684
94.6k
    xmlChar *temp;
1685
94.6k
    const xmlChar *in;
1686
94.6k
    int len, out;
1687
1688
94.6k
    if (str == NULL)
1689
0
  return(NULL);
1690
94.6k
    if (str[0] == 0)
1691
475
  return(xmlStrdup(str));
1692
94.2k
    len = xmlStrlen(str);
1693
94.2k
    if (!(len > 0)) return(NULL);
1694
1695
94.2k
    len += 20;
1696
94.2k
    ret = (xmlChar *) xmlMallocAtomic(len);
1697
94.2k
    if (ret == NULL) {
1698
0
        xmlURIErrMemory("escaping URI value\n");
1699
0
  return(NULL);
1700
0
    }
1701
94.2k
    in = (const xmlChar *) str;
1702
94.2k
    out = 0;
1703
67.1M
    while(*in != 0) {
1704
67.0M
  if (len - out <= 3) {
1705
71.8k
            temp = xmlSaveUriRealloc(ret, &len);
1706
71.8k
      if (temp == NULL) {
1707
0
                xmlURIErrMemory("escaping URI value\n");
1708
0
    xmlFree(ret);
1709
0
    return(NULL);
1710
0
      }
1711
71.8k
      ret = temp;
1712
71.8k
  }
1713
1714
67.0M
  ch = *in;
1715
1716
67.0M
  if ((ch != '@') && (!IS_UNRESERVED(ch)) && (!xmlStrchr(list, ch))) {
1717
21.2M
      unsigned char val;
1718
21.2M
      ret[out++] = '%';
1719
21.2M
      val = ch >> 4;
1720
21.2M
      if (val <= 9)
1721
14.9M
    ret[out++] = '0' + val;
1722
6.24M
      else
1723
6.24M
    ret[out++] = 'A' + val - 0xA;
1724
21.2M
      val = ch & 0xF;
1725
21.2M
      if (val <= 9)
1726
12.0M
    ret[out++] = '0' + val;
1727
9.20M
      else
1728
9.20M
    ret[out++] = 'A' + val - 0xA;
1729
21.2M
      in++;
1730
45.8M
  } else {
1731
45.8M
      ret[out++] = *in++;
1732
45.8M
  }
1733
1734
67.0M
    }
1735
94.2k
    ret[out] = 0;
1736
94.2k
    return(ret);
1737
94.2k
}
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
69.0k
{
1757
69.0k
    xmlChar *ret, *segment = NULL;
1758
69.0k
    xmlURIPtr uri;
1759
69.0k
    int ret2;
1760
1761
69.0k
    if (str == NULL)
1762
42
        return (NULL);
1763
1764
69.0k
    uri = xmlCreateURI();
1765
69.0k
    if (uri != NULL) {
1766
  /*
1767
   * Allow escaping errors in the unescaped form
1768
   */
1769
69.0k
        uri->cleanup = 1;
1770
69.0k
        ret2 = xmlParseURIReference(uri, (const char *)str);
1771
69.0k
        if (ret2) {
1772
30.8k
            xmlFreeURI(uri);
1773
30.8k
            return (NULL);
1774
30.8k
        }
1775
69.0k
    }
1776
1777
38.1k
    if (!uri)
1778
0
        return NULL;
1779
1780
38.1k
    ret = NULL;
1781
1782
38.5k
#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
38.1k
1788
38.1k
    if (uri->scheme) {
1789
2.89k
        segment = xmlURIEscapeStr(BAD_CAST uri->scheme, BAD_CAST "+-.");
1790
2.89k
        NULLCHK(segment)
1791
2.89k
        ret = xmlStrcat(ret, segment);
1792
2.89k
        ret = xmlStrcat(ret, BAD_CAST ":");
1793
2.89k
        xmlFree(segment);
1794
2.89k
    }
1795
1796
38.1k
    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
38.1k
    if (uri->user) {
1806
278
        segment = xmlURIEscapeStr(BAD_CAST uri->user, BAD_CAST ";:&=+$,");
1807
278
        NULLCHK(segment)
1808
278
        ret = xmlStrcat(ret,BAD_CAST "//");
1809
278
        ret = xmlStrcat(ret, segment);
1810
278
        ret = xmlStrcat(ret, BAD_CAST "@");
1811
278
        xmlFree(segment);
1812
278
    }
1813
1814
38.1k
    if (uri->server) {
1815
1.60k
        segment = xmlURIEscapeStr(BAD_CAST uri->server, BAD_CAST "/?;:@");
1816
1.60k
        NULLCHK(segment)
1817
1.60k
        if (uri->user == NULL)
1818
1.39k
            ret = xmlStrcat(ret, BAD_CAST "//");
1819
1.60k
        ret = xmlStrcat(ret, segment);
1820
1.60k
        xmlFree(segment);
1821
1.60k
    }
1822
1823
38.1k
    if (uri->port) {
1824
391
        xmlChar port[10];
1825
1826
391
        snprintf((char *) port, 10, "%d", uri->port);
1827
391
        ret = xmlStrcat(ret, BAD_CAST ":");
1828
391
        ret = xmlStrcat(ret, port);
1829
391
    }
1830
1831
38.1k
    if (uri->path) {
1832
27.6k
        segment =
1833
27.6k
            xmlURIEscapeStr(BAD_CAST uri->path, BAD_CAST ":@&=+$,/?;");
1834
27.6k
        NULLCHK(segment)
1835
27.6k
        ret = xmlStrcat(ret, segment);
1836
27.6k
        xmlFree(segment);
1837
27.6k
    }
1838
1839
38.1k
    if (uri->query_raw) {
1840
1.94k
        ret = xmlStrcat(ret, BAD_CAST "?");
1841
1.94k
        ret = xmlStrcat(ret, BAD_CAST uri->query_raw);
1842
1.94k
    }
1843
36.1k
    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
38.1k
    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
38.1k
    if (uri->fragment) {
1860
6.12k
        segment = xmlURIEscapeStr(BAD_CAST uri->fragment, BAD_CAST "#");
1861
6.12k
        NULLCHK(segment)
1862
6.12k
        ret = xmlStrcat(ret, BAD_CAST "#");
1863
6.12k
        ret = xmlStrcat(ret, segment);
1864
6.12k
        xmlFree(segment);
1865
6.12k
    }
1866
1867
38.1k
    xmlFreeURI(uri);
1868
38.1k
#undef NULLCHK
1869
1870
38.1k
    return (ret);
1871
38.1k
}
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
896k
xmlBuildURI(const xmlChar *URI, const xmlChar *base) {
1896
896k
    xmlChar *val = NULL;
1897
896k
    int ret, len, indx, cur, out;
1898
896k
    xmlURIPtr ref = NULL;
1899
896k
    xmlURIPtr bas = NULL;
1900
896k
    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
896k
    if (URI == NULL)
1911
30.9k
  ret = -1;
1912
865k
    else {
1913
865k
  if (*URI) {
1914
776k
      ref = xmlCreateURI();
1915
776k
      if (ref == NULL)
1916
0
    goto done;
1917
776k
      ret = xmlParseURIReference(ref, (const char *) URI);
1918
776k
  }
1919
88.7k
  else
1920
88.7k
      ret = 0;
1921
865k
    }
1922
896k
    if (ret != 0)
1923
71.3k
  goto done;
1924
825k
    if ((ref != NULL) && (ref->scheme != NULL)) {
1925
  /*
1926
   * The URI is absolute don't modify.
1927
   */
1928
20.7k
  val = xmlStrdup(URI);
1929
20.7k
  goto done;
1930
20.7k
    }
1931
804k
    if (base == NULL)
1932
214k
  ret = -1;
1933
590k
    else {
1934
590k
  bas = xmlCreateURI();
1935
590k
  if (bas == NULL)
1936
0
      goto done;
1937
590k
  ret = xmlParseURIReference(bas, (const char *) base);
1938
590k
    }
1939
804k
    if (ret != 0) {
1940
233k
  if (ref)
1941
233k
      val = xmlSaveUri(ref);
1942
233k
  goto done;
1943
233k
    }
1944
570k
    if (ref == NULL) {
1945
  /*
1946
   * the base fragment must be ignored
1947
   */
1948
88.5k
  if (bas->fragment != NULL) {
1949
17.3k
      xmlFree(bas->fragment);
1950
17.3k
      bas->fragment = NULL;
1951
17.3k
  }
1952
88.5k
  val = xmlSaveUri(bas);
1953
88.5k
  goto done;
1954
88.5k
    }
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
481k
    res = xmlCreateURI();
1969
481k
    if (res == NULL)
1970
0
  goto done;
1971
481k
    if ((ref->scheme == NULL) && (ref->path == NULL) &&
1972
481k
  ((ref->authority == NULL) && (ref->server == NULL))) {
1973
33.1k
  if (bas->scheme != NULL)
1974
4.31k
      res->scheme = xmlMemStrdup(bas->scheme);
1975
33.1k
  if (bas->authority != NULL)
1976
0
      res->authority = xmlMemStrdup(bas->authority);
1977
33.1k
  else if ((bas->server != NULL) || (bas->port == -1)) {
1978
2.92k
      if (bas->server != NULL)
1979
2.32k
    res->server = xmlMemStrdup(bas->server);
1980
2.92k
      if (bas->user != NULL)
1981
913
    res->user = xmlMemStrdup(bas->user);
1982
2.92k
      res->port = bas->port;
1983
2.92k
  }
1984
33.1k
  if (bas->path != NULL)
1985
25.2k
      res->path = xmlMemStrdup(bas->path);
1986
33.1k
  if (ref->query_raw != NULL)
1987
1.13k
      res->query_raw = xmlMemStrdup (ref->query_raw);
1988
32.0k
  else if (ref->query != NULL)
1989
0
      res->query = xmlMemStrdup(ref->query);
1990
32.0k
  else if (bas->query_raw != NULL)
1991
1.35k
      res->query_raw = xmlMemStrdup(bas->query_raw);
1992
30.6k
  else if (bas->query != NULL)
1993
0
      res->query = xmlMemStrdup(bas->query);
1994
33.1k
  if (ref->fragment != NULL)
1995
32.0k
      res->fragment = xmlMemStrdup(ref->fragment);
1996
33.1k
  goto step_7;
1997
33.1k
    }
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
448k
    if (ref->scheme != NULL) {
2006
0
  val = xmlSaveUri(ref);
2007
0
  goto done;
2008
0
    }
2009
448k
    if (bas->scheme != NULL)
2010
31.2k
  res->scheme = xmlMemStrdup(bas->scheme);
2011
2012
448k
    if (ref->query_raw != NULL)
2013
6.65k
  res->query_raw = xmlMemStrdup(ref->query_raw);
2014
441k
    else if (ref->query != NULL)
2015
0
  res->query = xmlMemStrdup(ref->query);
2016
448k
    if (ref->fragment != NULL)
2017
8.70k
  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
448k
    if ((ref->authority != NULL) || (ref->server != NULL)) {
2027
99
  if (ref->authority != NULL)
2028
0
      res->authority = xmlMemStrdup(ref->authority);
2029
99
  else {
2030
99
      res->server = xmlMemStrdup(ref->server);
2031
99
      if (ref->user != NULL)
2032
0
    res->user = xmlMemStrdup(ref->user);
2033
99
            res->port = ref->port;
2034
99
  }
2035
99
  if (ref->path != NULL)
2036
85
      res->path = xmlMemStrdup(ref->path);
2037
99
  goto step_7;
2038
99
    }
2039
448k
    if (bas->authority != NULL)
2040
0
  res->authority = xmlMemStrdup(bas->authority);
2041
448k
    else if ((bas->server != NULL) || (bas->port == -1)) {
2042
24.6k
  if (bas->server != NULL)
2043
20.1k
      res->server = xmlMemStrdup(bas->server);
2044
24.6k
  if (bas->user != NULL)
2045
5.25k
      res->user = xmlMemStrdup(bas->user);
2046
24.6k
  res->port = bas->port;
2047
24.6k
    }
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
448k
    if ((ref->path != NULL) && (ref->path[0] == '/')) {
2054
415
  res->path = xmlMemStrdup(ref->path);
2055
415
  goto step_7;
2056
415
    }
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
448k
    len = 2; /* extra / and 0 */
2068
448k
    if (ref->path != NULL)
2069
448k
  len += strlen(ref->path);
2070
448k
    if (bas->path != NULL)
2071
342k
  len += strlen(bas->path);
2072
448k
    res->path = (char *) xmlMallocAtomic(len);
2073
448k
    if (res->path == NULL) {
2074
0
        xmlURIErrMemory("resolving URI against base\n");
2075
0
  goto done;
2076
0
    }
2077
448k
    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
448k
    cur = 0;
2085
448k
    out = 0;
2086
448k
    if (bas->path != NULL) {
2087
4.31M
  while (bas->path[cur] != 0) {
2088
154M
      while ((bas->path[cur] != 0) && (bas->path[cur] != '/'))
2089
150M
    cur++;
2090
4.31M
      if (bas->path[cur] == 0)
2091
336k
    break;
2092
2093
3.97M
      cur++;
2094
139M
      while (out < cur) {
2095
135M
    res->path[out] = bas->path[out];
2096
135M
    out++;
2097
135M
      }
2098
3.97M
  }
2099
342k
    }
2100
448k
    res->path[out] = 0;
2101
2102
    /*
2103
     * b) The reference's path component is appended to the buffer
2104
     *    string.
2105
     */
2106
448k
    if (ref->path != NULL && ref->path[0] != 0) {
2107
448k
  indx = 0;
2108
  /*
2109
   * Ensure the path includes a '/'
2110
   */
2111
448k
  if ((out == 0) && (bas->server != NULL))
2112
10.2k
      res->path[out++] = '/';
2113
4.43M
  while (ref->path[indx] != 0) {
2114
3.99M
      res->path[out++] = ref->path[indx++];
2115
3.99M
  }
2116
448k
    }
2117
448k
    res->path[out] = 0;
2118
2119
    /*
2120
     * Steps c) to h) are really path normalization steps
2121
     */
2122
448k
    xmlNormalizeURIPath(res->path);
2123
2124
481k
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
481k
    val = xmlSaveUri(res);
2132
2133
896k
done:
2134
896k
    if (ref != NULL)
2135
776k
  xmlFreeURI(ref);
2136
896k
    if (bas != NULL)
2137
590k
  xmlFreeURI(bas);
2138
896k
    if (res != NULL)
2139
481k
  xmlFreeURI(res);
2140
896k
    return(val);
2141
481k
}
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
0
{
2178
0
    xmlChar *val = NULL;
2179
0
    int ret;
2180
0
    int ix;
2181
0
    int nbslash = 0;
2182
0
    int len;
2183
0
    xmlURIPtr ref = NULL;
2184
0
    xmlURIPtr bas = NULL;
2185
0
    xmlChar *bptr, *uptr, *vptr;
2186
0
    int remove_path = 0;
2187
2188
0
    if ((URI == NULL) || (*URI == 0))
2189
0
  return NULL;
2190
2191
    /*
2192
     * First parse URI into a standard form
2193
     */
2194
0
    ref = xmlCreateURI ();
2195
0
    if (ref == NULL)
2196
0
  return NULL;
2197
    /* If URI not already in "relative" form */
2198
0
    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
0
  ref->path = (char *)xmlStrdup(URI);
2204
2205
    /*
2206
     * Next parse base into the same standard form
2207
     */
2208
0
    if ((base == NULL) || (*base == 0)) {
2209
0
  val = xmlStrdup (URI);
2210
0
  goto done;
2211
0
    }
2212
0
    bas = xmlCreateURI ();
2213
0
    if (bas == NULL)
2214
0
  goto done;
2215
0
    if (base[0] != '.') {
2216
0
  ret = xmlParseURIReference (bas, (const char *) base);
2217
0
  if (ret != 0)
2218
0
      goto done;   /* Error in base, return NULL */
2219
0
    } 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
0
    if ((ref->scheme != NULL) &&
2227
0
  ((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
0
    if (xmlStrEqual((xmlChar *)bas->path, (xmlChar *)ref->path)) {
2234
0
  val = xmlStrdup(BAD_CAST "");
2235
0
  goto done;
2236
0
    }
2237
0
    if (bas->path == NULL) {
2238
0
  val = xmlStrdup((xmlChar *)ref->path);
2239
0
  goto done;
2240
0
    }
2241
0
    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
0
    bptr = (xmlChar *)bas->path;
2253
0
    {
2254
0
        xmlChar *rptr = (xmlChar *) ref->path;
2255
0
        int pos = 0;
2256
2257
        /*
2258
         * Next we compare the two strings and find where they first differ
2259
         */
2260
0
  if ((*rptr == '.') && (rptr[1] == '/'))
2261
0
            rptr += 2;
2262
0
  if ((*bptr == '.') && (bptr[1] == '/'))
2263
0
            bptr += 2;
2264
0
  else if ((*bptr == '/') && (*rptr != '/'))
2265
0
      bptr++;
2266
0
  while ((bptr[pos] == rptr[pos]) && (bptr[pos] != 0))
2267
0
      pos++;
2268
2269
0
  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
0
  ix = pos;
2279
0
  for (; ix > 0; ix--) {
2280
0
      if (rptr[ix - 1] == '/')
2281
0
    break;
2282
0
  }
2283
0
  uptr = (xmlChar *)&rptr[ix];
2284
2285
  /*
2286
   * In base, count the number of '/' from the differing point
2287
   */
2288
0
  for (; bptr[ix] != 0; ix++) {
2289
0
      if (bptr[ix] == '/')
2290
0
    nbslash++;
2291
0
  }
2292
2293
  /*
2294
   * e.g: URI="foo/" base="foo/bar" -> "./"
2295
   */
2296
0
  if (nbslash == 0 && !uptr[0]) {
2297
0
      val = xmlStrdup(BAD_CAST "./");
2298
0
      goto done;
2299
0
  }
2300
2301
0
  len = xmlStrlen (uptr) + 1;
2302
0
    }
2303
2304
0
    if (nbslash == 0) {
2305
0
  if (uptr != NULL)
2306
      /* exception characters from xmlSaveUri */
2307
0
      val = xmlURIEscapeStr(uptr, BAD_CAST "/;&=+$,");
2308
0
  goto done;
2309
0
    }
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
0
done:
2353
    /*
2354
     * Free the working variables
2355
     */
2356
0
    if (remove_path != 0)
2357
0
        ref->path = NULL;
2358
0
    if (ref != NULL)
2359
0
  xmlFreeURI (ref);
2360
0
    if (bas != NULL)
2361
0
  xmlFreeURI (bas);
2362
2363
0
    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
926k
{
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
926k
    xmlURIPtr uri;
2394
926k
    xmlChar *ret;
2395
926k
    const xmlChar *absuri;
2396
2397
926k
    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
926k
    if ((path[0] == '/') && (path[1] == '/') && (path[2] != '/'))
2415
2.37k
        path++;
2416
2417
926k
    if ((uri = xmlParseURI((const char *) path)) != NULL) {
2418
608k
  xmlFreeURI(uri);
2419
608k
  return xmlStrdup(path);
2420
608k
    }
2421
2422
    /* Check if this is an "absolute uri" */
2423
318k
    absuri = xmlStrstr(path, BAD_CAST "://");
2424
318k
    if (absuri != NULL) {
2425
91.1k
        int l, j;
2426
91.1k
  unsigned char c;
2427
91.1k
  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
91.1k
  l = absuri - path;
2435
  /* Bypass if first part (part before the '://') is > 20 chars */
2436
91.1k
  if ((l <= 0) || (l > 20))
2437
27.8k
      goto path_processing;
2438
  /* Bypass if any non-alpha characters are present in first part */
2439
345k
  for (j = 0;j < l;j++) {
2440
289k
      c = path[j];
2441
289k
      if (!(((c >= 'a') && (c <= 'z')) || ((c >= 'A') && (c <= 'Z'))))
2442
7.15k
          goto path_processing;
2443
289k
  }
2444
2445
  /* Escape all except the characters specified in the supplied path */
2446
56.1k
        escURI = xmlURIEscapeStr(path, BAD_CAST ":/?_.#&;=");
2447
56.1k
  if (escURI != NULL) {
2448
      /* Try parsing the escaped path */
2449
56.1k
      uri = xmlParseURI((const char *) escURI);
2450
      /* If successful, return the escaped string */
2451
56.1k
      if (uri != NULL) {
2452
37.1k
          xmlFreeURI(uri);
2453
37.1k
    return escURI;
2454
37.1k
      }
2455
19.0k
            xmlFree(escURI);
2456
19.0k
  }
2457
56.1k
    }
2458
2459
281k
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
281k
    ret = xmlStrdup((const xmlChar *) path);
2508
281k
#endif
2509
281k
    return(ret);
2510
318k
}
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
425k
{
2526
425k
    xmlURIPtr uri;
2527
425k
    xmlURI temp;
2528
425k
    xmlChar *ret, *cal;
2529
2530
425k
    if (path == NULL)
2531
0
        return(NULL);
2532
2533
425k
    if ((uri = xmlParseURI((const char *) path)) != NULL) {
2534
226k
  xmlFreeURI(uri);
2535
226k
  return xmlStrdup(path);
2536
226k
    }
2537
198k
    cal = xmlCanonicPath(path);
2538
198k
    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
198k
    memset(&temp, 0, sizeof(temp));
2559
198k
    temp.path = (char *) cal;
2560
198k
    ret = xmlSaveUri(&temp);
2561
198k
    xmlFree(cal);
2562
198k
    return(ret);
2563
198k
}