Coverage Report

Created: 2022-11-15 06:15

/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
2.76k
#define MAX_URI_LENGTH 1024 * 1024
37
38
static void
39
xmlURIErrMemory(const char *extra)
40
163
{
41
163
    if (extra)
42
163
        __xmlRaiseError(NULL, NULL, NULL,
43
163
                        NULL, NULL, XML_FROM_URI,
44
163
                        XML_ERR_NO_MEMORY, XML_ERR_FATAL, NULL, 0,
45
163
                        extra, NULL, NULL, 0, 0,
46
163
                        "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
163
}
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
166M
#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
166M
#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
83.0M
#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
78.1M
#define IS_DIGIT(x) (((x) >= '0') && ((x) <= '9'))
86
87
/*
88
 * alphanum = alpha | digit
89
 */
90
91
166M
#define IS_ALPHANUM(x) (IS_ALPHA(x) || IS_DIGIT(x))
92
93
/*
94
 * mark = "-" | "_" | "." | "!" | "~" | "*" | "'" | "(" | ")"
95
 */
96
97
78.1M
#define IS_MARK(x) (((x) == '-') || ((x) == '_') || ((x) == '.') ||     \
98
78.1M
    ((x) == '!') || ((x) == '~') || ((x) == '*') || ((x) == '\'') ||    \
99
78.1M
    ((x) == '(') || ((x) == ')'))
100
101
/*
102
 * unwise = "{" | "}" | "|" | "\" | "^" | "`"
103
 */
104
105
#define IS_UNWISE(p)                                                    \
106
0
      (((*(p) == '{')) || ((*(p) == '}')) || ((*(p) == '|')) ||         \
107
0
       ((*(p) == '\\')) || ((*(p) == '^')) || ((*(p) == '[')) ||        \
108
0
       ((*(p) == ']')) || ((*(p) == '`')))
109
/*
110
 * reserved = ";" | "/" | "?" | ":" | "@" | "&" | "=" | "+" | "$" | "," |
111
 *            "[" | "]"
112
 */
113
114
1.90M
#define IS_RESERVED(x) (((x) == ';') || ((x) == '/') || ((x) == '?') || \
115
1.90M
        ((x) == ':') || ((x) == '@') || ((x) == '&') || ((x) == '=') || \
116
1.90M
        ((x) == '+') || ((x) == '$') || ((x) == ',') || ((x) == '[') || \
117
1.90M
        ((x) == ']'))
118
119
/*
120
 * unreserved = alphanum | mark
121
 */
122
123
83.3M
#define IS_UNRESERVED(x) (IS_ALPHANUM(x) || IS_MARK(x))
124
125
/*
126
 * Skip to next pointer char, handle escaped sequences
127
 */
128
129
62.5M
#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
236
#define STRNDUP(s, n) (char *) xmlStrndup((const xmlChar *)(s), (n))
142
143
/************************************************************************
144
 *                  *
145
 *                         RFC 3986 parser        *
146
 *                  *
147
 ************************************************************************/
148
149
95.5M
#define ISA_DIGIT(p) ((*(p) >= '0') && (*(p) <= '9'))
150
74.0M
#define ISA_ALPHA(p) (((*(p) >= 'a') && (*(p) <= 'z')) ||   \
151
74.0M
                      ((*(p) >= 'A') && (*(p) <= 'Z')))
152
#define ISA_HEXDIG(p)             \
153
11.1M
       (ISA_DIGIT(p) || ((*(p) >= 'a') && (*(p) <= 'f')) ||   \
154
11.1M
        ((*(p) >= 'A') && (*(p) <= 'F')))
155
156
/*
157
 *    sub-delims    = "!" / "$" / "&" / "'" / "(" / ")"
158
 *                     / "*" / "+" / "," / ";" / "="
159
 */
160
#define ISA_SUB_DELIM(p)            \
161
141M
      (((*(p) == '!')) || ((*(p) == '$')) || ((*(p) == '&')) ||   \
162
67.5M
       ((*(p) == '(')) || ((*(p) == ')')) || ((*(p) == '*')) ||   \
163
67.5M
       ((*(p) == '+')) || ((*(p) == ',')) || ((*(p) == ';')) ||   \
164
67.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
148M
      ((ISA_ALPHA(p)) || (ISA_DIGIT(p)) || ((*(p) == '-')) ||   \
184
74.0M
       ((*(p) == '.')) || ((*(p) == '_')) || ((*(p) == '~')))
185
186
/*
187
 *    pct-encoded   = "%" HEXDIG HEXDIG
188
 */
189
#define ISA_PCT_ENCODED(p)            \
190
147M
     ((*(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
68.2M
     (ISA_UNRESERVED(p) || ISA_PCT_ENCODED(p) || ISA_SUB_DELIM(p) ||  \
197
68.2M
      ((*(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
541
xmlParse3986Scheme(xmlURIPtr uri, const char **str) {
212
541
    const char *cur;
213
214
541
    if (str == NULL)
215
0
  return(-1);
216
217
541
    cur = *str;
218
541
    if (!ISA_ALPHA(cur))
219
517
  return(2);
220
24
    cur++;
221
24
    while (ISA_ALPHA(cur) || ISA_DIGIT(cur) ||
222
24
           (*cur == '+') || (*cur == '-') || (*cur == '.')) cur++;
223
24
    if (uri != NULL) {
224
24
  if (uri->scheme != NULL) xmlFree(uri->scheme);
225
24
  uri->scheme = STRNDUP(*str, cur - *str);
226
24
    }
227
24
    *str = cur;
228
24
    return(0);
229
541
}
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
92
{
249
92
    const char *cur;
250
251
92
    if (str == NULL)
252
0
        return (-1);
253
254
92
    cur = *str;
255
256
3.45M
    while ((ISA_PCHAR(cur)) || (*cur == '/') || (*cur == '?') ||
257
3.45M
           (*cur == '[') || (*cur == ']') ||
258
3.45M
           ((uri != NULL) && (uri->cleanup & 1) && (IS_UNWISE(cur))))
259
3.45M
        NEXT(cur);
260
92
    if (uri != NULL) {
261
92
        if (uri->fragment != NULL)
262
0
            xmlFree(uri->fragment);
263
92
  if (uri->cleanup & 2)
264
0
      uri->fragment = STRNDUP(*str, cur - *str);
265
92
  else
266
92
      uri->fragment = xmlURIUnescapeString(*str, cur - *str, NULL);
267
92
    }
268
92
    *str = cur;
269
92
    return (0);
270
92
}
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
212
{
286
212
    const char *cur;
287
288
212
    if (str == NULL)
289
0
        return (-1);
290
291
212
    cur = *str;
292
293
53.2M
    while ((ISA_PCHAR(cur)) || (*cur == '/') || (*cur == '?') ||
294
53.2M
           ((uri != NULL) && (uri->cleanup & 1) && (IS_UNWISE(cur))))
295
53.2M
        NEXT(cur);
296
212
    if (uri != NULL) {
297
212
        if (uri->query != NULL)
298
0
            xmlFree(uri->query);
299
212
  if (uri->cleanup & 2)
300
0
      uri->query = STRNDUP(*str, cur - *str);
301
212
  else
302
212
      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
212
  if (uri->query_raw != NULL)
308
0
      xmlFree (uri->query_raw);
309
212
  uri->query_raw = STRNDUP (*str, cur - *str);
310
212
    }
311
212
    *str = cur;
312
212
    return (0);
313
212
}
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
54
{
330
54
    const char *cur = *str;
331
54
    int port = 0;
332
333
54
    if (ISA_DIGIT(cur)) {
334
108
  while (ISA_DIGIT(cur)) {
335
54
            int digit = *cur - '0';
336
337
54
            if (port > INT_MAX / 10)
338
0
                return(1);
339
54
            port *= 10;
340
54
            if (port > INT_MAX - digit)
341
0
                return(1);
342
54
      port += digit;
343
344
54
      cur++;
345
54
  }
346
54
  if (uri != NULL)
347
54
      uri->port = port;
348
54
  *str = cur;
349
54
  return(0);
350
54
    }
351
0
    return(1);
352
54
}
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
230
{
369
230
    const char *cur;
370
371
230
    cur = *str;
372
5.75M
    while (ISA_UNRESERVED(cur) || ISA_PCT_ENCODED(cur) ||
373
5.75M
           ISA_SUB_DELIM(cur) || (*cur == ':'))
374
5.75M
  NEXT(cur);
375
230
    if (*cur == '@') {
376
212
  if (uri != NULL) {
377
212
      if (uri->user != NULL) xmlFree(uri->user);
378
212
      if (uri->cleanup & 2)
379
0
    uri->user = STRNDUP(*str, cur - *str);
380
212
      else
381
212
    uri->user = xmlURIUnescapeString(*str, cur - *str, NULL);
382
212
  }
383
212
  *str = cur;
384
212
  return(0);
385
212
    }
386
18
    return(1);
387
230
}
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
60
xmlParse3986DecOctet(const char **str) {
405
60
    const char *cur = *str;
406
407
60
    if (!(ISA_DIGIT(cur)))
408
0
        return(1);
409
60
    if (!ISA_DIGIT(cur+1))
410
60
  cur++;
411
0
    else if ((*cur != '0') && (ISA_DIGIT(cur + 1)) && (!ISA_DIGIT(cur+2)))
412
0
  cur += 2;
413
0
    else if ((*cur == '1') && (ISA_DIGIT(cur + 1)) && (ISA_DIGIT(cur + 2)))
414
0
  cur += 3;
415
0
    else if ((*cur == '2') && (*(cur + 1) >= '0') &&
416
0
       (*(cur + 1) <= '4') && (ISA_DIGIT(cur + 2)))
417
0
  cur += 3;
418
0
    else if ((*cur == '2') && (*(cur + 1) == '5') &&
419
0
       (*(cur + 2) >= '0') && (*(cur + 1) <= '5'))
420
0
  cur += 3;
421
0
    else
422
0
        return(1);
423
60
    *str = cur;
424
60
    return(0);
425
60
}
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
230
{
444
230
    const char *cur = *str;
445
230
    const char *host;
446
447
230
    host = cur;
448
    /*
449
     * IPv6 and future addressing scheme are enclosed between brackets
450
     */
451
230
    if (*cur == '[') {
452
14
        cur++;
453
6.70M
  while ((*cur != ']') && (*cur != 0))
454
6.70M
      cur++;
455
14
  if (*cur != ']')
456
0
      return(1);
457
14
  cur++;
458
14
  goto found;
459
14
    }
460
    /*
461
     * try to parse an IPv4
462
     */
463
216
    if (ISA_DIGIT(cur)) {
464
60
        if (xmlParse3986DecOctet(&cur) != 0)
465
0
      goto not_ipv4;
466
60
  if (*cur != '.')
467
60
      goto not_ipv4;
468
0
  cur++;
469
0
        if (xmlParse3986DecOctet(&cur) != 0)
470
0
      goto not_ipv4;
471
0
  if (*cur != '.')
472
0
      goto not_ipv4;
473
0
        if (xmlParse3986DecOctet(&cur) != 0)
474
0
      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
60
not_ipv4:
481
60
        cur = *str;
482
60
    }
483
    /*
484
     * then this should be a hostname which can be empty
485
     */
486
4.02k
    while (ISA_UNRESERVED(cur) || ISA_PCT_ENCODED(cur) || ISA_SUB_DELIM(cur))
487
3.81k
        NEXT(cur);
488
230
found:
489
230
    if (uri != NULL) {
490
230
  if (uri->authority != NULL) xmlFree(uri->authority);
491
230
  uri->authority = NULL;
492
230
  if (uri->server != NULL) xmlFree(uri->server);
493
230
  if (cur != host) {
494
230
      if (uri->cleanup & 2)
495
0
    uri->server = STRNDUP(host, cur - host);
496
230
      else
497
230
    uri->server = xmlURIUnescapeString(host, cur - host, NULL);
498
230
  } else
499
0
      uri->server = NULL;
500
230
    }
501
230
    *str = cur;
502
230
    return(0);
503
216
}
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
230
{
520
230
    const char *cur;
521
230
    int ret;
522
523
230
    cur = *str;
524
    /*
525
     * try to parse an userinfo and check for the trailing @
526
     */
527
230
    ret = xmlParse3986Userinfo(uri, &cur);
528
230
    if ((ret != 0) || (*cur != '@'))
529
18
        cur = *str;
530
212
    else
531
212
        cur++;
532
230
    ret = xmlParse3986Host(uri, &cur);
533
230
    if (ret != 0) return(ret);
534
230
    if (*cur == ':') {
535
54
        cur++;
536
54
        ret = xmlParse3986Port(uri, &cur);
537
54
  if (ret != 0) return(ret);
538
54
    }
539
230
    *str = cur;
540
230
    return(0);
541
230
}
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
11.4M
{
562
11.4M
    const char *cur;
563
564
11.4M
    cur = *str;
565
11.4M
    if (!ISA_PCHAR(cur)) {
566
11.4M
        if (empty)
567
11.4M
      return(0);
568
0
  return(1);
569
11.4M
    }
570
23.6k
    while (ISA_PCHAR(cur) && (*cur != forbid))
571
18.7k
        NEXT(cur);
572
4.83k
    *str = cur;
573
4.83k
    return (0);
574
11.4M
}
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
230
{
591
230
    const char *cur;
592
230
    int ret;
593
594
230
    cur = *str;
595
596
11.4M
    while (*cur == '/') {
597
11.4M
        cur++;
598
11.4M
  ret = xmlParse3986Segment(&cur, 0, 1);
599
11.4M
  if (ret != 0) return(ret);
600
11.4M
    }
601
230
    if (uri != NULL) {
602
230
  if (uri->path != NULL) xmlFree(uri->path);
603
230
        if (*str != cur) {
604
138
            if (uri->cleanup & 2)
605
0
                uri->path = STRNDUP(*str, cur - *str);
606
138
            else
607
138
                uri->path = xmlURIUnescapeString(*str, cur - *str, NULL);
608
138
        } else {
609
92
            uri->path = NULL;
610
92
        }
611
230
    }
612
230
    *str = cur;
613
230
    return (0);
614
230
}
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
211
{
631
211
    const char *cur;
632
211
    int ret;
633
634
211
    cur = *str;
635
636
211
    if (*cur != '/')
637
0
        return(1);
638
211
    cur++;
639
211
    ret = xmlParse3986Segment(&cur, 0, 0);
640
211
    if (ret == 0) {
641
844
  while (*cur == '/') {
642
633
      cur++;
643
633
      ret = xmlParse3986Segment(&cur, 0, 1);
644
633
      if (ret != 0) return(ret);
645
633
  }
646
211
    }
647
211
    if (uri != NULL) {
648
211
  if (uri->path != NULL) xmlFree(uri->path);
649
211
        if (cur != *str) {
650
211
            if (uri->cleanup & 2)
651
0
                uri->path = STRNDUP(*str, cur - *str);
652
211
            else
653
211
                uri->path = xmlURIUnescapeString(*str, cur - *str, NULL);
654
211
        } else {
655
0
            uri->path = NULL;
656
0
        }
657
211
    }
658
211
    *str = cur;
659
211
    return (0);
660
211
}
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
0
{
677
0
    const char *cur;
678
0
    int ret;
679
680
0
    cur = *str;
681
682
0
    ret = xmlParse3986Segment(&cur, 0, 0);
683
0
    if (ret != 0) return(ret);
684
0
    while (*cur == '/') {
685
0
        cur++;
686
0
  ret = xmlParse3986Segment(&cur, 0, 1);
687
0
  if (ret != 0) return(ret);
688
0
    }
689
0
    if (uri != NULL) {
690
0
  if (uri->path != NULL) xmlFree(uri->path);
691
0
        if (cur != *str) {
692
0
            if (uri->cleanup & 2)
693
0
                uri->path = STRNDUP(*str, cur - *str);
694
0
            else
695
0
                uri->path = xmlURIUnescapeString(*str, cur - *str, NULL);
696
0
        } else {
697
0
            uri->path = NULL;
698
0
        }
699
0
    }
700
0
    *str = cur;
701
0
    return (0);
702
0
}
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
30
{
719
30
    const char *cur;
720
30
    int ret;
721
722
30
    cur = *str;
723
724
30
    ret = xmlParse3986Segment(&cur, ':', 0);
725
30
    if (ret != 0) return(ret);
726
36
    while (*cur == '/') {
727
6
        cur++;
728
6
  ret = xmlParse3986Segment(&cur, 0, 1);
729
6
  if (ret != 0) return(ret);
730
6
    }
731
30
    if (uri != NULL) {
732
30
  if (uri->path != NULL) xmlFree(uri->path);
733
30
        if (cur != *str) {
734
30
            if (uri->cleanup & 2)
735
0
                uri->path = STRNDUP(*str, cur - *str);
736
30
            else
737
30
                uri->path = xmlURIUnescapeString(*str, cur - *str, NULL);
738
30
        } else {
739
0
            uri->path = NULL;
740
0
        }
741
30
    }
742
30
    *str = cur;
743
30
    return (0);
744
30
}
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
0
{
764
0
    const char *cur;
765
0
    int ret;
766
767
0
    cur = *str;
768
769
0
    if ((*cur == '/') && (*(cur + 1) == '/')) {
770
0
        cur += 2;
771
0
  ret = xmlParse3986Authority(uri, &cur);
772
0
  if (ret != 0) return(ret);
773
0
  if (uri->server == NULL)
774
0
      uri->port = -1;
775
0
  ret = xmlParse3986PathAbEmpty(uri, &cur);
776
0
  if (ret != 0) return(ret);
777
0
  *str = cur;
778
0
  return(0);
779
0
    } else if (*cur == '/') {
780
0
        ret = xmlParse3986PathAbsolute(uri, &cur);
781
0
  if (ret != 0) return(ret);
782
0
    } else if (ISA_PCHAR(cur)) {
783
0
        ret = xmlParse3986PathRootless(uri, &cur);
784
0
  if (ret != 0) return(ret);
785
0
    } else {
786
  /* path-empty is effectively empty */
787
0
  if (uri != NULL) {
788
0
      if (uri->path != NULL) xmlFree(uri->path);
789
0
      uri->path = NULL;
790
0
  }
791
0
    }
792
0
    *str = cur;
793
0
    return (0);
794
0
}
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
541
xmlParse3986RelativeRef(xmlURIPtr uri, const char *str) {
814
541
    int ret;
815
816
541
    if ((*str == '/') && (*(str + 1) == '/')) {
817
230
        str += 2;
818
230
  ret = xmlParse3986Authority(uri, &str);
819
230
  if (ret != 0) return(ret);
820
230
  ret = xmlParse3986PathAbEmpty(uri, &str);
821
230
  if (ret != 0) return(ret);
822
311
    } else if (*str == '/') {
823
211
  ret = xmlParse3986PathAbsolute(uri, &str);
824
211
  if (ret != 0) return(ret);
825
211
    } else if (ISA_PCHAR(str)) {
826
30
        ret = xmlParse3986PathNoScheme(uri, &str);
827
30
  if (ret != 0) return(ret);
828
70
    } else {
829
  /* path-empty is effectively empty */
830
70
  if (uri != NULL) {
831
70
      if (uri->path != NULL) xmlFree(uri->path);
832
70
      uri->path = NULL;
833
70
  }
834
70
    }
835
836
541
    if (*str == '?') {
837
212
  str++;
838
212
  ret = xmlParse3986Query(uri, &str);
839
212
  if (ret != 0) return(ret);
840
212
    }
841
541
    if (*str == '#') {
842
92
  str++;
843
92
  ret = xmlParse3986Fragment(uri, &str);
844
92
  if (ret != 0) return(ret);
845
92
    }
846
541
    if (*str != 0) {
847
25
  xmlCleanURI(uri);
848
25
  return(1);
849
25
    }
850
516
    return(0);
851
541
}
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
541
xmlParse3986URI(xmlURIPtr uri, const char *str) {
868
541
    int ret;
869
870
541
    ret = xmlParse3986Scheme(uri, &str);
871
541
    if (ret != 0) return(ret);
872
24
    if (*str != ':') {
873
24
  return(1);
874
24
    }
875
0
    str++;
876
0
    ret = xmlParse3986HierPart(uri, &str);
877
0
    if (ret != 0) return(ret);
878
0
    if (*str == '?') {
879
0
  str++;
880
0
  ret = xmlParse3986Query(uri, &str);
881
0
  if (ret != 0) return(ret);
882
0
    }
883
0
    if (*str == '#') {
884
0
  str++;
885
0
  ret = xmlParse3986Fragment(uri, &str);
886
0
  if (ret != 0) return(ret);
887
0
    }
888
0
    if (*str != 0) {
889
0
  xmlCleanURI(uri);
890
0
  return(1);
891
0
    }
892
0
    return(0);
893
0
}
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
541
xmlParse3986URIReference(xmlURIPtr uri, const char *str) {
909
541
    int ret;
910
911
541
    if (str == NULL)
912
0
  return(-1);
913
541
    xmlCleanURI(uri);
914
915
    /*
916
     * Try first to parse absolute refs, then fallback to relative if
917
     * it fails.
918
     */
919
541
    ret = xmlParse3986URI(uri, str);
920
541
    if (ret != 0) {
921
541
  xmlCleanURI(uri);
922
541
        ret = xmlParse3986RelativeRef(uri, str);
923
541
  if (ret != 0) {
924
25
      xmlCleanURI(uri);
925
25
      return(ret);
926
25
  }
927
541
    }
928
516
    return(0);
929
541
}
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
122
xmlParseURI(const char *str) {
943
122
    xmlURIPtr uri;
944
122
    int ret;
945
946
122
    if (str == NULL)
947
0
  return(NULL);
948
122
    uri = xmlCreateURI();
949
122
    if (uri != NULL) {
950
122
  ret = xmlParse3986URIReference(uri, str);
951
122
        if (ret) {
952
0
      xmlFreeURI(uri);
953
0
      return(NULL);
954
0
  }
955
122
    }
956
122
    return(uri);
957
122
}
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
419
xmlParseURIReference(xmlURIPtr uri, const char *str) {
973
419
    return(xmlParse3986URIReference(uri, str));
974
419
}
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
718
xmlCreateURI(void) {
1023
718
    xmlURIPtr ret;
1024
1025
718
    ret = (xmlURIPtr) xmlMalloc(sizeof(xmlURI));
1026
718
    if (ret == NULL) {
1027
0
        xmlURIErrMemory("creating URI structure\n");
1028
0
  return(NULL);
1029
0
    }
1030
718
    memset(ret, 0, sizeof(xmlURI));
1031
718
    return(ret);
1032
718
}
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
2.76k
xmlSaveUriRealloc(xmlChar *ret, int *max) {
1042
2.76k
    xmlChar *temp;
1043
2.76k
    int tmp;
1044
1045
2.76k
    if (*max > MAX_URI_LENGTH) {
1046
162
        xmlURIErrMemory("reaching arbitrary MAX_URI_LENGTH limit\n");
1047
162
        return(NULL);
1048
162
    }
1049
2.60k
    tmp = *max * 2;
1050
2.60k
    temp = (xmlChar *) xmlRealloc(ret, (tmp + 1));
1051
2.60k
    if (temp == NULL) {
1052
0
        xmlURIErrMemory("saving URI\n");
1053
0
        return(NULL);
1054
0
    }
1055
2.60k
    *max = tmp;
1056
2.60k
    return(temp);
1057
2.60k
}
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
245
xmlSaveUri(xmlURIPtr uri) {
1069
245
    xmlChar *ret = NULL;
1070
245
    xmlChar *temp;
1071
245
    const char *p;
1072
245
    int len;
1073
245
    int max;
1074
1075
245
    if (uri == NULL) return(NULL);
1076
1077
1078
245
    max = 80;
1079
245
    ret = (xmlChar *) xmlMallocAtomic(max + 1);
1080
245
    if (ret == NULL) {
1081
0
        xmlURIErrMemory("saving URI\n");
1082
0
  return(NULL);
1083
0
    }
1084
245
    len = 0;
1085
1086
245
    if (uri->scheme != NULL) {
1087
0
  p = uri->scheme;
1088
0
  while (*p != 0) {
1089
0
      if (len >= max) {
1090
0
                temp = xmlSaveUriRealloc(ret, &max);
1091
0
                if (temp == NULL) goto mem_error;
1092
0
    ret = temp;
1093
0
      }
1094
0
      ret[len++] = *p++;
1095
0
  }
1096
0
  if (len >= max) {
1097
0
            temp = xmlSaveUriRealloc(ret, &max);
1098
0
            if (temp == NULL) goto mem_error;
1099
0
            ret = temp;
1100
0
  }
1101
0
  ret[len++] = ':';
1102
0
    }
1103
245
    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
245
    } else {
1122
245
  if ((uri->server != NULL) || (uri->port == -1)) {
1123
195
      if (len + 3 >= max) {
1124
0
                temp = xmlSaveUriRealloc(ret, &max);
1125
0
                if (temp == NULL) goto mem_error;
1126
0
                ret = temp;
1127
0
      }
1128
195
      ret[len++] = '/';
1129
195
      ret[len++] = '/';
1130
195
      if (uri->user != NULL) {
1131
183
    p = uri->user;
1132
68.0M
    while (*p != 0) {
1133
68.0M
        if (len + 3 >= max) {
1134
2.58k
                        temp = xmlSaveUriRealloc(ret, &max);
1135
2.58k
                        if (temp == NULL) goto mem_error;
1136
2.54k
                        ret = temp;
1137
2.54k
        }
1138
68.0M
        if ((IS_UNRESERVED(*(p))) ||
1139
68.0M
      ((*(p) == ';')) || ((*(p) == ':')) ||
1140
68.0M
      ((*(p) == '&')) || ((*(p) == '=')) ||
1141
68.0M
      ((*(p) == '+')) || ((*(p) == '$')) ||
1142
68.0M
      ((*(p) == ',')))
1143
3.19M
      ret[len++] = *p++;
1144
64.9M
        else {
1145
64.9M
      int val = *(unsigned char *)p++;
1146
64.9M
      int hi = val / 0x10, lo = val % 0x10;
1147
64.9M
      ret[len++] = '%';
1148
64.9M
      ret[len++] = hi + (hi > 9? 'A'-10 : '0');
1149
64.9M
      ret[len++] = lo + (lo > 9? 'A'-10 : '0');
1150
64.9M
        }
1151
68.0M
    }
1152
134
    if (len + 3 >= max) {
1153
0
                    temp = xmlSaveUriRealloc(ret, &max);
1154
0
                    if (temp == NULL) goto mem_error;
1155
0
                    ret = temp;
1156
0
    }
1157
134
    ret[len++] = '@';
1158
134
      }
1159
146
      if (uri->server != NULL) {
1160
146
    p = uri->server;
1161
4.29M
    while (*p != 0) {
1162
4.29M
        if (len >= max) {
1163
13
      temp = xmlSaveUriRealloc(ret, &max);
1164
13
      if (temp == NULL) goto mem_error;
1165
0
      ret = temp;
1166
0
        }
1167
4.29M
        ret[len++] = *p++;
1168
4.29M
    }
1169
133
    if (uri->port > 0) {
1170
26
        if (len + 10 >= max) {
1171
0
      temp = xmlSaveUriRealloc(ret, &max);
1172
0
      if (temp == NULL) goto mem_error;
1173
0
      ret = temp;
1174
0
        }
1175
26
        len += snprintf((char *) &ret[len], max - len, ":%d", uri->port);
1176
26
    }
1177
133
      }
1178
146
  } 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
50
  } else if (uri->scheme != NULL) {
1207
0
      if (len + 3 >= max) {
1208
0
                temp = xmlSaveUriRealloc(ret, &max);
1209
0
                if (temp == NULL) goto mem_error;
1210
0
                ret = temp;
1211
0
      }
1212
0
  }
1213
183
  if (uri->path != NULL) {
1214
110
      p = uri->path;
1215
      /*
1216
       * the colon in file:///d: should not be escaped or
1217
       * Windows accesses fail later.
1218
       */
1219
110
      if ((uri->scheme != NULL) &&
1220
110
    (p[0] == '/') &&
1221
110
    (((p[1] >= 'a') && (p[1] <= 'z')) ||
1222
0
     ((p[1] >= 'A') && (p[1] <= 'Z'))) &&
1223
110
    (p[2] == ':') &&
1224
110
          (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
8.92M
      while (*p != 0) {
1235
8.92M
    if (len + 3 >= max) {
1236
46
                    temp = xmlSaveUriRealloc(ret, &max);
1237
46
                    if (temp == NULL) goto mem_error;
1238
0
                    ret = temp;
1239
0
    }
1240
8.92M
    if ((IS_UNRESERVED(*(p))) || ((*(p) == '/')) ||
1241
8.92M
                    ((*(p) == ';')) || ((*(p) == '@')) || ((*(p) == '&')) ||
1242
8.92M
              ((*(p) == '=')) || ((*(p) == '+')) || ((*(p) == '$')) ||
1243
8.92M
              ((*(p) == ',')))
1244
8.92M
        ret[len++] = *p++;
1245
736
    else {
1246
736
        int val = *(unsigned char *)p++;
1247
736
        int hi = val / 0x10, lo = val % 0x10;
1248
736
        ret[len++] = '%';
1249
736
        ret[len++] = hi + (hi > 9? 'A'-10 : '0');
1250
736
        ret[len++] = lo + (lo > 9? 'A'-10 : '0');
1251
736
    }
1252
8.92M
      }
1253
110
  }
1254
137
  if (uri->query_raw != NULL) {
1255
75
      if (len + 1 >= max) {
1256
0
                temp = xmlSaveUriRealloc(ret, &max);
1257
0
                if (temp == NULL) goto mem_error;
1258
0
                ret = temp;
1259
0
      }
1260
75
      ret[len++] = '?';
1261
75
      p = uri->query_raw;
1262
13.2M
      while (*p != 0) {
1263
13.2M
    if (len + 1 >= max) {
1264
58
                    temp = xmlSaveUriRealloc(ret, &max);
1265
58
                    if (temp == NULL) goto mem_error;
1266
10
                    ret = temp;
1267
10
    }
1268
13.2M
    ret[len++] = *p++;
1269
13.2M
      }
1270
75
  } 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
137
    }
1296
89
    if (uri->fragment != NULL) {
1297
33
  if (len + 3 >= max) {
1298
0
            temp = xmlSaveUriRealloc(ret, &max);
1299
0
            if (temp == NULL) goto mem_error;
1300
0
            ret = temp;
1301
0
  }
1302
33
  ret[len++] = '#';
1303
33
  p = uri->fragment;
1304
2.14M
  while (*p != 0) {
1305
2.14M
      if (len + 3 >= max) {
1306
35
                temp = xmlSaveUriRealloc(ret, &max);
1307
35
                if (temp == NULL) goto mem_error;
1308
30
                ret = temp;
1309
30
      }
1310
2.14M
      if ((IS_UNRESERVED(*(p))) || (IS_RESERVED(*(p))))
1311
2.14M
    ret[len++] = *p++;
1312
0
      else {
1313
0
    int val = *(unsigned char *)p++;
1314
0
    int hi = val / 0x10, lo = val % 0x10;
1315
0
    ret[len++] = '%';
1316
0
    ret[len++] = hi + (hi > 9? 'A'-10 : '0');
1317
0
    ret[len++] = lo + (lo > 9? 'A'-10 : '0');
1318
0
      }
1319
2.14M
  }
1320
33
    }
1321
84
    if (len >= max) {
1322
0
        temp = xmlSaveUriRealloc(ret, &max);
1323
0
        if (temp == NULL) goto mem_error;
1324
0
        ret = temp;
1325
0
    }
1326
84
    ret[len] = 0;
1327
84
    return(ret);
1328
1329
161
mem_error:
1330
161
    xmlFree(ret);
1331
161
    return(NULL);
1332
84
}
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
1.13k
xmlCleanURI(xmlURIPtr uri) {
1360
1.13k
    if (uri == NULL) return;
1361
1362
1.13k
    if (uri->scheme != NULL) xmlFree(uri->scheme);
1363
1.13k
    uri->scheme = NULL;
1364
1.13k
    if (uri->server != NULL) xmlFree(uri->server);
1365
1.13k
    uri->server = NULL;
1366
1.13k
    if (uri->user != NULL) xmlFree(uri->user);
1367
1.13k
    uri->user = NULL;
1368
1.13k
    if (uri->path != NULL) xmlFree(uri->path);
1369
1.13k
    uri->path = NULL;
1370
1.13k
    if (uri->fragment != NULL) xmlFree(uri->fragment);
1371
1.13k
    uri->fragment = NULL;
1372
1.13k
    if (uri->opaque != NULL) xmlFree(uri->opaque);
1373
1.13k
    uri->opaque = NULL;
1374
1.13k
    if (uri->authority != NULL) xmlFree(uri->authority);
1375
1.13k
    uri->authority = NULL;
1376
1.13k
    if (uri->query != NULL) xmlFree(uri->query);
1377
1.13k
    uri->query = NULL;
1378
1.13k
    if (uri->query_raw != NULL) xmlFree(uri->query_raw);
1379
1.13k
    uri->query_raw = NULL;
1380
1.13k
}
1381
1382
/**
1383
 * xmlFreeURI:
1384
 * @uri:  pointer to an xmlURI
1385
 *
1386
 * Free up the xmlURI struct
1387
 */
1388
void
1389
718
xmlFreeURI(xmlURIPtr uri) {
1390
718
    if (uri == NULL) return;
1391
1392
718
    if (uri->scheme != NULL) xmlFree(uri->scheme);
1393
718
    if (uri->server != NULL) xmlFree(uri->server);
1394
718
    if (uri->user != NULL) xmlFree(uri->user);
1395
718
    if (uri->path != NULL) xmlFree(uri->path);
1396
718
    if (uri->fragment != NULL) xmlFree(uri->fragment);
1397
718
    if (uri->opaque != NULL) xmlFree(uri->opaque);
1398
718
    if (uri->authority != NULL) xmlFree(uri->authority);
1399
718
    if (uri->query != NULL) xmlFree(uri->query);
1400
718
    if (uri->query_raw != NULL) xmlFree(uri->query_raw);
1401
718
    xmlFree(uri);
1402
718
}
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
0
xmlNormalizeURIPath(char *path) {
1423
0
    char *cur, *out;
1424
1425
0
    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
0
    cur = path;
1432
0
    while (cur[0] == '/')
1433
0
      ++cur;
1434
0
    if (cur[0] == '\0')
1435
0
      return(0);
1436
1437
    /* Keep everything we've seen so far.  */
1438
0
    out = cur;
1439
1440
    /*
1441
     * Analyze each segment in sequence for cases (c) and (d).
1442
     */
1443
0
    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
0
  if ((cur[0] == '.') && (cur[1] == '/')) {
1449
0
      cur += 2;
1450
      /* '//' normalization should be done at this point too */
1451
0
      while (cur[0] == '/')
1452
0
    cur++;
1453
0
      continue;
1454
0
  }
1455
1456
  /*
1457
   * d) If the buffer string ends with "." as a complete path segment,
1458
   *    that "." is removed.
1459
   */
1460
0
  if ((cur[0] == '.') && (cur[1] == '\0'))
1461
0
      break;
1462
1463
  /* Otherwise keep the segment.  */
1464
0
  while (cur[0] != '/') {
1465
0
            if (cur[0] == '\0')
1466
0
              goto done_cd;
1467
0
      (out++)[0] = (cur++)[0];
1468
0
  }
1469
  /* normalize // */
1470
0
  while ((cur[0] == '/') && (cur[1] == '/'))
1471
0
      cur++;
1472
1473
0
        (out++)[0] = (cur++)[0];
1474
0
    }
1475
0
 done_cd:
1476
0
    out[0] = '\0';
1477
1478
    /* Reset to the beginning of the first segment for the next sequence.  */
1479
0
    cur = path;
1480
0
    while (cur[0] == '/')
1481
0
      ++cur;
1482
0
    if (cur[0] == '\0')
1483
0
  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
0
    while (1) {
1504
0
        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
0
        segp = cur;
1512
0
        while ((segp[0] != '/') && (segp[0] != '\0'))
1513
0
          ++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
0
        if (segp[0] == '\0')
1519
0
          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
0
        ++segp;
1525
0
        if (((cur[0] == '.') && (cur[1] == '.') && (segp == cur+3))
1526
0
            || ((segp[0] != '.') || (segp[1] != '.')
1527
0
                || ((segp[2] != '/') && (segp[2] != '\0')))) {
1528
0
          cur = segp;
1529
0
          continue;
1530
0
        }
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
0
        if (segp[2] == '\0') {
1541
0
          cur[0] = '\0';
1542
0
          break;
1543
0
        }
1544
        /* Valgrind complained, strcpy(cur, segp + 3); */
1545
        /* string will overlap, do not use strcpy */
1546
0
        tmp = cur;
1547
0
        segp += 3;
1548
0
        while ((*tmp++ = *segp++) != 0)
1549
0
          ;
1550
1551
        /* If there are no previous segments, then keep going from here.  */
1552
0
        segp = cur;
1553
0
        while ((segp > path) && ((--segp)[0] == '/'))
1554
0
          ;
1555
0
        if (segp == path)
1556
0
          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
0
        cur = segp;
1566
0
        while ((cur > path) && (cur[-1] != '/'))
1567
0
          --cur;
1568
0
    }
1569
0
    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
0
    if (path[0] == '/') {
1583
0
      cur = path;
1584
0
      while ((cur[0] == '/') && (cur[1] == '.') && (cur[2] == '.')
1585
0
             && ((cur[3] == '/') || (cur[3] == '\0')))
1586
0
  cur += 3;
1587
1588
0
      if (cur != path) {
1589
0
  out = path;
1590
0
  while (cur[0] != '\0')
1591
0
          (out++)[0] = (cur++)[0];
1592
0
  out[0] = 0;
1593
0
      }
1594
0
    }
1595
1596
0
    return(0);
1597
0
}
1598
1599
11.1M
static int is_hex(char c) {
1600
11.1M
    if (((c >= '0') && (c <= '9')) ||
1601
11.1M
        ((c >= 'a') && (c <= 'f')) ||
1602
11.1M
        ((c >= 'A') && (c <= 'F')))
1603
11.1M
  return(1);
1604
7
    return(0);
1605
11.1M
}
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
1.12k
xmlURIUnescapeString(const char *str, int len, char *target) {
1623
1.12k
    char *ret, *out;
1624
1.12k
    const char *in;
1625
1626
1.12k
    if (str == NULL)
1627
0
  return(NULL);
1628
1.12k
    if (len <= 0) len = strlen(str);
1629
1.12k
    if (len < 0) return(NULL);
1630
1631
1.12k
    if (target == NULL) {
1632
1.12k
  ret = (char *) xmlMallocAtomic(len + 1);
1633
1.12k
  if (ret == NULL) {
1634
0
            xmlURIErrMemory("unescaping URI value\n");
1635
0
      return(NULL);
1636
0
  }
1637
1.12k
    } else
1638
0
  ret = target;
1639
1.12k
    in = str;
1640
1.12k
    out = ret;
1641
150M
    while(len > 0) {
1642
150M
  if ((len > 2) && (*in == '%') && (is_hex(in[1])) && (is_hex(in[2]))) {
1643
5.59M
            int c = 0;
1644
5.59M
      in++;
1645
5.59M
      if ((*in >= '0') && (*in <= '9'))
1646
5.59M
          c = (*in - '0');
1647
12
      else if ((*in >= 'a') && (*in <= 'f'))
1648
12
          c = (*in - 'a') + 10;
1649
0
      else if ((*in >= 'A') && (*in <= 'F'))
1650
0
          c = (*in - 'A') + 10;
1651
5.59M
      in++;
1652
5.59M
      if ((*in >= '0') && (*in <= '9'))
1653
104
          c = c * 16 + (*in - '0');
1654
5.59M
      else if ((*in >= 'a') && (*in <= 'f'))
1655
12
          c = c * 16 + (*in - 'a') + 10;
1656
5.59M
      else if ((*in >= 'A') && (*in <= 'F'))
1657
5.59M
          c = c * 16 + (*in - 'A') + 10;
1658
5.59M
      in++;
1659
5.59M
      len -= 3;
1660
            /* Explicit sign change */
1661
5.59M
      *out++ = (char) c;
1662
145M
  } else {
1663
145M
      *out++ = *in++;
1664
145M
      len--;
1665
145M
  }
1666
150M
    }
1667
1.12k
    *out = 0;
1668
1.12k
    return(ret);
1669
1.12k
}
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
11
xmlURIEscapeStr(const xmlChar *str, const xmlChar *list) {
1683
11
    xmlChar *ret, ch;
1684
11
    xmlChar *temp;
1685
11
    const xmlChar *in;
1686
11
    int len, out;
1687
1688
11
    if (str == NULL)
1689
0
  return(NULL);
1690
11
    if (str[0] == 0)
1691
0
  return(xmlStrdup(str));
1692
11
    len = xmlStrlen(str);
1693
11
    if (!(len > 0)) return(NULL);
1694
1695
11
    len += 20;
1696
11
    ret = (xmlChar *) xmlMallocAtomic(len);
1697
11
    if (ret == NULL) {
1698
0
        xmlURIErrMemory("escaping URI value\n");
1699
0
  return(NULL);
1700
0
    }
1701
11
    in = (const xmlChar *) str;
1702
11
    out = 0;
1703
4.15M
    while(*in != 0) {
1704
4.15M
  if (len - out <= 3) {
1705
22
            temp = xmlSaveUriRealloc(ret, &len);
1706
22
      if (temp == NULL) {
1707
1
                xmlURIErrMemory("escaping URI value\n");
1708
1
    xmlFree(ret);
1709
1
    return(NULL);
1710
1
      }
1711
21
      ret = temp;
1712
21
  }
1713
1714
4.15M
  ch = *in;
1715
1716
4.15M
  if ((ch != '@') && (!IS_UNRESERVED(ch)) && (!xmlStrchr(list, ch))) {
1717
2.32M
      unsigned char val;
1718
2.32M
      ret[out++] = '%';
1719
2.32M
      val = ch >> 4;
1720
2.32M
      if (val <= 9)
1721
2.32M
    ret[out++] = '0' + val;
1722
135
      else
1723
135
    ret[out++] = 'A' + val - 0xA;
1724
2.32M
      val = ch & 0xF;
1725
2.32M
      if (val <= 9)
1726
630
    ret[out++] = '0' + val;
1727
2.32M
      else
1728
2.32M
    ret[out++] = 'A' + val - 0xA;
1729
2.32M
      in++;
1730
2.32M
  } else {
1731
1.82M
      ret[out++] = *in++;
1732
1.82M
  }
1733
1734
4.15M
    }
1735
10
    ret[out] = 0;
1736
10
    return(ret);
1737
11
}
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
0
{
1757
0
    xmlChar *ret, *segment = NULL;
1758
0
    xmlURIPtr uri;
1759
0
    int ret2;
1760
1761
0
    if (str == NULL)
1762
0
        return (NULL);
1763
1764
0
    uri = xmlCreateURI();
1765
0
    if (uri != NULL) {
1766
  /*
1767
   * Allow escaping errors in the unescaped form
1768
   */
1769
0
        uri->cleanup = 1;
1770
0
        ret2 = xmlParseURIReference(uri, (const char *)str);
1771
0
        if (ret2) {
1772
0
            xmlFreeURI(uri);
1773
0
            return (NULL);
1774
0
        }
1775
0
    }
1776
1777
0
    if (!uri)
1778
0
        return NULL;
1779
1780
0
    ret = NULL;
1781
1782
0
#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
0
1788
0
    if (uri->scheme) {
1789
0
        segment = xmlURIEscapeStr(BAD_CAST uri->scheme, BAD_CAST "+-.");
1790
0
        NULLCHK(segment)
1791
0
        ret = xmlStrcat(ret, segment);
1792
0
        ret = xmlStrcat(ret, BAD_CAST ":");
1793
0
        xmlFree(segment);
1794
0
    }
1795
1796
0
    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
0
    if (uri->user) {
1806
0
        segment = xmlURIEscapeStr(BAD_CAST uri->user, BAD_CAST ";:&=+$,");
1807
0
        NULLCHK(segment)
1808
0
        ret = xmlStrcat(ret,BAD_CAST "//");
1809
0
        ret = xmlStrcat(ret, segment);
1810
0
        ret = xmlStrcat(ret, BAD_CAST "@");
1811
0
        xmlFree(segment);
1812
0
    }
1813
1814
0
    if (uri->server) {
1815
0
        segment = xmlURIEscapeStr(BAD_CAST uri->server, BAD_CAST "/?;:@");
1816
0
        NULLCHK(segment)
1817
0
        if (uri->user == NULL)
1818
0
            ret = xmlStrcat(ret, BAD_CAST "//");
1819
0
        ret = xmlStrcat(ret, segment);
1820
0
        xmlFree(segment);
1821
0
    }
1822
1823
0
    if (uri->port) {
1824
0
        xmlChar port[10];
1825
1826
0
        snprintf((char *) port, 10, "%d", uri->port);
1827
0
        ret = xmlStrcat(ret, BAD_CAST ":");
1828
0
        ret = xmlStrcat(ret, port);
1829
0
    }
1830
1831
0
    if (uri->path) {
1832
0
        segment =
1833
0
            xmlURIEscapeStr(BAD_CAST uri->path, BAD_CAST ":@&=+$,/?;");
1834
0
        NULLCHK(segment)
1835
0
        ret = xmlStrcat(ret, segment);
1836
0
        xmlFree(segment);
1837
0
    }
1838
1839
0
    if (uri->query_raw) {
1840
0
        ret = xmlStrcat(ret, BAD_CAST "?");
1841
0
        ret = xmlStrcat(ret, BAD_CAST uri->query_raw);
1842
0
    }
1843
0
    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
0
    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
0
    if (uri->fragment) {
1860
0
        segment = xmlURIEscapeStr(BAD_CAST uri->fragment, BAD_CAST "#");
1861
0
        NULLCHK(segment)
1862
0
        ret = xmlStrcat(ret, BAD_CAST "#");
1863
0
        ret = xmlStrcat(ret, segment);
1864
0
        xmlFree(segment);
1865
0
    }
1866
1867
0
    xmlFreeURI(uri);
1868
0
#undef NULLCHK
1869
1870
0
    return (ret);
1871
0
}
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
242
xmlBuildURI(const xmlChar *URI, const xmlChar *base) {
1896
242
    xmlChar *val = NULL;
1897
242
    int ret, len, indx, cur, out;
1898
242
    xmlURIPtr ref = NULL;
1899
242
    xmlURIPtr bas = NULL;
1900
242
    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
242
    if (URI == NULL)
1911
0
  ret = -1;
1912
242
    else {
1913
242
  if (*URI) {
1914
232
      ref = xmlCreateURI();
1915
232
      if (ref == NULL)
1916
0
    goto done;
1917
232
      ret = xmlParseURIReference(ref, (const char *) URI);
1918
232
  }
1919
10
  else
1920
10
      ret = 0;
1921
242
    }
1922
242
    if (ret != 0)
1923
25
  goto done;
1924
217
    if ((ref != NULL) && (ref->scheme != NULL)) {
1925
  /*
1926
   * The URI is absolute don't modify.
1927
   */
1928
0
  val = xmlStrdup(URI);
1929
0
  goto done;
1930
0
    }
1931
217
    if (base == NULL)
1932
30
  ret = -1;
1933
187
    else {
1934
187
  bas = xmlCreateURI();
1935
187
  if (bas == NULL)
1936
0
      goto done;
1937
187
  ret = xmlParseURIReference(bas, (const char *) base);
1938
187
    }
1939
217
    if (ret != 0) {
1940
30
  if (ref)
1941
30
      val = xmlSaveUri(ref);
1942
30
  goto done;
1943
30
    }
1944
187
    if (ref == NULL) {
1945
  /*
1946
   * the base fragment must be ignored
1947
   */
1948
10
  if (bas->fragment != NULL) {
1949
0
      xmlFree(bas->fragment);
1950
0
      bas->fragment = NULL;
1951
0
  }
1952
10
  val = xmlSaveUri(bas);
1953
10
  goto done;
1954
10
    }
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
177
    res = xmlCreateURI();
1969
177
    if (res == NULL)
1970
0
  goto done;
1971
177
    if ((ref->scheme == NULL) && (ref->path == NULL) &&
1972
177
  ((ref->authority == NULL) && (ref->server == NULL))) {
1973
0
  if (bas->scheme != NULL)
1974
0
      res->scheme = xmlMemStrdup(bas->scheme);
1975
0
  if (bas->authority != NULL)
1976
0
      res->authority = xmlMemStrdup(bas->authority);
1977
0
  else if ((bas->server != NULL) || (bas->port == -1)) {
1978
0
      if (bas->server != NULL)
1979
0
    res->server = xmlMemStrdup(bas->server);
1980
0
      if (bas->user != NULL)
1981
0
    res->user = xmlMemStrdup(bas->user);
1982
0
      res->port = bas->port;
1983
0
  }
1984
0
  if (bas->path != NULL)
1985
0
      res->path = xmlMemStrdup(bas->path);
1986
0
  if (ref->query_raw != NULL)
1987
0
      res->query_raw = xmlMemStrdup (ref->query_raw);
1988
0
  else if (ref->query != NULL)
1989
0
      res->query = xmlMemStrdup(ref->query);
1990
0
  else if (bas->query_raw != NULL)
1991
0
      res->query_raw = xmlMemStrdup(bas->query_raw);
1992
0
  else if (bas->query != NULL)
1993
0
      res->query = xmlMemStrdup(bas->query);
1994
0
  if (ref->fragment != NULL)
1995
0
      res->fragment = xmlMemStrdup(ref->fragment);
1996
0
  goto step_7;
1997
0
    }
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
177
    if (ref->scheme != NULL) {
2006
0
  val = xmlSaveUri(ref);
2007
0
  goto done;
2008
0
    }
2009
177
    if (bas->scheme != NULL)
2010
0
  res->scheme = xmlMemStrdup(bas->scheme);
2011
2012
177
    if (ref->query_raw != NULL)
2013
175
  res->query_raw = xmlMemStrdup(ref->query_raw);
2014
2
    else if (ref->query != NULL)
2015
0
  res->query = xmlMemStrdup(ref->query);
2016
177
    if (ref->fragment != NULL)
2017
25
  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
177
    if ((ref->authority != NULL) || (ref->server != NULL)) {
2027
177
  if (ref->authority != NULL)
2028
0
      res->authority = xmlMemStrdup(ref->authority);
2029
177
  else {
2030
177
      res->server = xmlMemStrdup(ref->server);
2031
177
      if (ref->user != NULL)
2032
177
    res->user = xmlMemStrdup(ref->user);
2033
177
            res->port = ref->port;
2034
177
  }
2035
177
  if (ref->path != NULL)
2036
138
      res->path = xmlMemStrdup(ref->path);
2037
177
  goto step_7;
2038
177
    }
2039
0
    if (bas->authority != NULL)
2040
0
  res->authority = xmlMemStrdup(bas->authority);
2041
0
    else if ((bas->server != NULL) || (bas->port == -1)) {
2042
0
  if (bas->server != NULL)
2043
0
      res->server = xmlMemStrdup(bas->server);
2044
0
  if (bas->user != NULL)
2045
0
      res->user = xmlMemStrdup(bas->user);
2046
0
  res->port = bas->port;
2047
0
    }
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
0
    if ((ref->path != NULL) && (ref->path[0] == '/')) {
2054
0
  res->path = xmlMemStrdup(ref->path);
2055
0
  goto step_7;
2056
0
    }
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
0
    len = 2; /* extra / and 0 */
2068
0
    if (ref->path != NULL)
2069
0
  len += strlen(ref->path);
2070
0
    if (bas->path != NULL)
2071
0
  len += strlen(bas->path);
2072
0
    res->path = (char *) xmlMallocAtomic(len);
2073
0
    if (res->path == NULL) {
2074
0
        xmlURIErrMemory("resolving URI against base\n");
2075
0
  goto done;
2076
0
    }
2077
0
    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
0
    cur = 0;
2085
0
    out = 0;
2086
0
    if (bas->path != NULL) {
2087
0
  while (bas->path[cur] != 0) {
2088
0
      while ((bas->path[cur] != 0) && (bas->path[cur] != '/'))
2089
0
    cur++;
2090
0
      if (bas->path[cur] == 0)
2091
0
    break;
2092
2093
0
      cur++;
2094
0
      while (out < cur) {
2095
0
    res->path[out] = bas->path[out];
2096
0
    out++;
2097
0
      }
2098
0
  }
2099
0
    }
2100
0
    res->path[out] = 0;
2101
2102
    /*
2103
     * b) The reference's path component is appended to the buffer
2104
     *    string.
2105
     */
2106
0
    if (ref->path != NULL && ref->path[0] != 0) {
2107
0
  indx = 0;
2108
  /*
2109
   * Ensure the path includes a '/'
2110
   */
2111
0
  if ((out == 0) && (bas->server != NULL))
2112
0
      res->path[out++] = '/';
2113
0
  while (ref->path[indx] != 0) {
2114
0
      res->path[out++] = ref->path[indx++];
2115
0
  }
2116
0
    }
2117
0
    res->path[out] = 0;
2118
2119
    /*
2120
     * Steps c) to h) are really path normalization steps
2121
     */
2122
0
    xmlNormalizeURIPath(res->path);
2123
2124
177
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
177
    val = xmlSaveUri(res);
2132
2133
242
done:
2134
242
    if (ref != NULL)
2135
232
  xmlFreeURI(ref);
2136
242
    if (bas != NULL)
2137
187
  xmlFreeURI(bas);
2138
242
    if (res != NULL)
2139
177
  xmlFreeURI(res);
2140
242
    return(val);
2141
177
}
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
2
{
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
2
    xmlURIPtr uri;
2394
2
    xmlChar *ret;
2395
2
    const xmlChar *absuri;
2396
2397
2
    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
2
    if ((path[0] == '/') && (path[1] == '/') && (path[2] != '/'))
2415
0
        path++;
2416
2417
2
    if ((uri = xmlParseURI((const char *) path)) != NULL) {
2418
2
  xmlFreeURI(uri);
2419
2
  return xmlStrdup(path);
2420
2
    }
2421
2422
    /* Check if this is an "absolute uri" */
2423
0
    absuri = xmlStrstr(path, BAD_CAST "://");
2424
0
    if (absuri != NULL) {
2425
0
        int l, j;
2426
0
  unsigned char c;
2427
0
  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
0
  l = absuri - path;
2435
  /* Bypass if first part (part before the '://') is > 20 chars */
2436
0
  if ((l <= 0) || (l > 20))
2437
0
      goto path_processing;
2438
  /* Bypass if any non-alpha characters are present in first part */
2439
0
  for (j = 0;j < l;j++) {
2440
0
      c = path[j];
2441
0
      if (!(((c >= 'a') && (c <= 'z')) || ((c >= 'A') && (c <= 'Z'))))
2442
0
          goto path_processing;
2443
0
  }
2444
2445
  /* Escape all except the characters specified in the supplied path */
2446
0
        escURI = xmlURIEscapeStr(path, BAD_CAST ":/?_.#&;=");
2447
0
  if (escURI != NULL) {
2448
      /* Try parsing the escaped path */
2449
0
      uri = xmlParseURI((const char *) escURI);
2450
      /* If successful, return the escaped string */
2451
0
      if (uri != NULL) {
2452
0
          xmlFreeURI(uri);
2453
0
    return escURI;
2454
0
      }
2455
0
            xmlFree(escURI);
2456
0
  }
2457
0
    }
2458
2459
0
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
0
    ret = xmlStrdup((const xmlChar *) path);
2508
0
#endif
2509
0
    return(ret);
2510
0
}
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
2
{
2526
2
    xmlURIPtr uri;
2527
2
    xmlURI temp;
2528
2
    xmlChar *ret, *cal;
2529
2530
2
    if (path == NULL)
2531
0
        return(NULL);
2532
2533
2
    if ((uri = xmlParseURI((const char *) path)) != NULL) {
2534
2
  xmlFreeURI(uri);
2535
2
  return xmlStrdup(path);
2536
2
    }
2537
0
    cal = xmlCanonicPath(path);
2538
0
    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
0
    memset(&temp, 0, sizeof(temp));
2559
0
    temp.path = (char *) cal;
2560
0
    ret = xmlSaveUri(&temp);
2561
0
    xmlFree(cal);
2562
0
    return(ret);
2563
0
}