1 /**

     2  * libxml2_uri.c: set of generic URI related routines

     3  *

     4  * Reference: RFC 2396

     5  *

     6  * See Copyright for the status of this software.

     7  *

     8  * daniel@veillard.com

     9  * Portion Copyright © 2009 Nokia Corporation and/or its subsidiary(-ies). All rights reserved. 

    10  */

    11 

    12 #define IN_LIBXML

    13 #include "xmlenglibxml.h"

    14 

    15 #include <string.h>

    16 

    17 #include <stdapis/libxml2/libxml2_uri.h>

    18 #include <stdapis/libxml2/libxml2_globals.h>

    19 

    20 /************************************************************************

    21  *                                                                      *

    22  *      Macros to differentiate various character type                  *

    23  *          directly extracted from RFC 2396                            *

    24  *                                                                      *

    25  ************************************************************************/

    26 

    27 /*

    28  * alpha    = lowalpha | upalpha

    29  */

    30 #define IS_ALPHA(x) (IS_LOWALPHA(x) || IS_UPALPHA(x))

    31 

    32 

    33 /*

    34  * lowalpha = "a" | "b" | "c" | "d" | "e" | "f" | "g" | "h" | "i" | "j" |

    35  *            "k" | "l" | "m" | "n" | "o" | "p" | "q" | "r" | "s" | "t" |

    36  *            "u" | "v" | "w" | "x" | "y" | "z"

    37  */

    38 

    39 #define IS_LOWALPHA(x) (((x) >= 'a') && ((x) <= 'z'))

    40 

    41 /*

    42  * upalpha = "A" | "B" | "C" | "D" | "E" | "F" | "G" | "H" | "I" | "J" |

    43  *           "K" | "L" | "M" | "N" | "O" | "P" | "Q" | "R" | "S" | "T" |

    44  *           "U" | "V" | "W" | "X" | "Y" | "Z"

    45  */

    46 #define IS_UPALPHA(x) (((x) >= 'A') && ((x) <= 'Z'))

    47 

    48 /*

    49  * digit = "0" | "1" | "2" | "3" | "4" | "5" | "6" | "7" | "8" | "9"

    50  */

    51 

    52 #define IS_DIGIT(x) (((x) >= '0') && ((x) <= '9'))

    53 

    54 /*

    55  * alphanum = alpha | digit

    56  */

    57 

    58 #define IS_ALPHANUM(x) (IS_ALPHA(x) || IS_DIGIT(x))

    59 

    60 /*

    61  * hex = digit | "A" | "B" | "C" | "D" | "E" | "F" |

    62  *               "a" | "b" | "c" | "d" | "e" | "f"

    63  */

    64 

    65 #define IS_HEX(x) ((IS_DIGIT(x)) || (((x) >= 'a') && ((x) <= 'f')) || \

    66         (((x) >= 'A') && ((x) <= 'F')))

    67 

    68 /*

    69  * mark = "-" | "_" | "." | "!" | "~" | "*" | "'" | "(" | ")"

    70  */

    71 

    72 #define IS_MARK(x) (((x) == '-') || ((x) == '_') || ((x) == '.') || \

    73     ((x) == '!') || ((x) == '~') || ((x) == '*') || ((x) == '\'') ||    \

    74     ((x) == '(') || ((x) == ')'))

    75 

    76 

    77 /*

    78  * reserved = ";" | "/" | "?" | ":" | "@" | "&" | "=" | "+" | "$" | ","

    79  */

    80 

    81 #define IS_RESERVED(x) (((x) == ';') || ((x) == '/') || ((x) == '?') || \

    82         ((x) == ':') || ((x) == '@') || ((x) == '&') || ((x) == '=') || \

    83     ((x) == '+') || ((x) == '$') || ((x) == ','))

    84 

    85 static int isReserved(char ch)

    86     {

    87     return IS_RESERVED(ch);

    88     }

    89 

    90 /*

    91  * unreserved = alphanum | mark

    92  */

    93 #define IS_UNRESERVED(x) (IS_ALPHANUM(x) || IS_MARK(x))

    94 

    95 static int isUnreserved(char ch)

    96     {

    97     return IS_UNRESERVED(ch);

    98     }

    99 /*

   100  * escaped = "%" hex hex

   101  */

   102 

   103 #define IS_ESCAPED(p) \

   104             ((*(p) == '%') && (IS_HEX((p)[1])) && (IS_HEX((p)[2])))

   105 

   106 static int isEscaped(const char* pch)

   107     {

   108     return IS_ESCAPED(pch);

   109     }

   110 /*

   111  * uric_no_slash = unreserved | escaped | ";" | "?" | ":" | "@" |

   112  *                        "&" | "=" | "+" | "$" | ","

   113  */

   114 /*

   115 #define IS_URIC_NO_SLASH(p) ((IS_UNRESERVED(*(p))) || (IS_ESCAPED(p)) ||\

   116             ((*(p) == ';')) || ((*(p) == '?')) || ((*(p) == ':')) ||\

   117             ((*(p) == '@')) || ((*(p) == '&')) || ((*(p) == '=')) ||\

   118             ((*(p) == '+')) || ((*(p) == '$')) || ((*(p) == ',')))

   119 

   120 Optimized into:

   121 

   122 #define IS_URIC_NO_SLASH(p) \

   123             ((IS_UNRESERVED(*(p))) || \

   124              (IS_ESCAPED(p))       || \

   125              ((*(p)) != '/' && IS_RESERVED(p)))

   126 */

   127 static int isUriCNoSlash(const char* pch)

   128     {

   129     char ch = *pch;

   130     return isUnreserved(ch) ||

   131            isEscaped(pch)     ||

   132            (ch != '/' && isReserved(ch));

   133     }

   134 

   135 

   136 /*

   137  * pchar = unreserved | escaped | ":" | "@" | "&" | "=" | "+" | "$" | ","

   138  */

   139 

   140 /*

   141 #define IS_PCHAR(p) ((IS_UNRESERVED(*(p))) || (IS_ESCAPED(p)) ||    \

   142             ((*(p) == ':')) || ((*(p) == '@')) || ((*(p) == '&')) ||\

   143             ((*(p) == '=')) || ((*(p) == '+')) || ((*(p) == '$')) ||\

   144             ((*(p) == ',')))

   145 */

   146 static int isPChar(const char* pch)

   147     {

   148     char ch = *pch;

   149     return isUnreserved(ch) ||

   150            isEscaped(pch)   ||

   151            ch == ':' || ch == '@' || ch == '&' ||

   152            ch == '=' || ch == '+' || ch == '$' ||

   153            ch == ',';

   154     }

   155 

   156 

   157 /*

   158  * rel_segment   = 1*( unreserved | escaped |

   159  *                 ";" | "@" | "&" | "=" | "+" | "$" | "," )

   160  */

   161 

   162 /*

   163 #define IS_SEGMENT(p) ((IS_UNRESERVED(*(p))) || (IS_ESCAPED(p)) ||  \

   164             ((*(p) == ';')) || ((*(p) == '@')) || ((*(p) == '&')) ||  \

   165             ((*(p) == '=')) || ((*(p) == '+')) || ((*(p) == '$')) ||  \

   166             ((*(p) == ',')))

   167 */

   168 static int isSegment(const char* pch)

   169     {

   170     char ch = *pch;

   171     return isUnreserved(ch)  || isEscaped(pch) ||

   172            ch == ';' || ch == '@' || ch == '&' ||

   173            ch == '=' || ch == '+' || ch == '$' ||

   174            ch == ',';

   175     }

   176 /*

   177  * scheme = alpha *( alpha | digit | "+" | "-" | "." )

   178  */

   179 

   180 #define IS_SCHEME(x) ((IS_ALPHA(x)) || (IS_DIGIT(x)) ||         \

   181                   ((x) == '+') || ((x) == '-') || ((x) == '.'))

   182 

   183 /* the macros is used only once

   184 static int isScheme(char x)

   185     {

   186     return ((IS_ALPHA(x)) || (IS_DIGIT(x)) ||

   187             (x) == '+') || ((x) == '-') || ((x) == '.'))

   188     }

   189 */

   190 

   191 /*

   192  * reg_name = 1*( unreserved | escaped | "$" | "," |

   193  *                ";" | ":" | "@" | "&" | "=" | "+" )

   194  */

   195 

   196 /*

   197 #define IS_REG_NAME(p) ((IS_UNRESERVED(*(p))) || (IS_ESCAPED(p)) || \

   198        ((*(p) == '$')) || ((*(p) == ',')) || ((*(p) == ';')) ||     \

   199        ((*(p) == ':')) || ((*(p) == '@')) || ((*(p) == '&')) ||     \

   200        ((*(p) == '=')) || ((*(p) == '+')))

   201 */

   202 

   203 static int isRegName(const char* pch)

   204     {

   205     char ch = *pch;

   206     return isUnreserved(ch) || isEscaped(pch) ||

   207            ch == '$' || ch == ',' || ch == ';' ||

   208            ch == ':' || ch == '@' || ch == '&' ||

   209            ch == '=' || ch == '+';

   210     }

   211 /*

   212  * userinfo = *( unreserved | escaped | ";" | ":" | "&" | "=" |

   213  *                      "+" | "$" | "," )

   214  */

   215 

   216 /*

   217 #define IS_USERINFO(p) ((IS_UNRESERVED(*(p))) || (IS_ESCAPED(p)) || \

   218        ((*(p) == ';')) || ((*(p) == ':')) || ((*(p) == '&')) ||     \

   219        ((*(p) == '=')) || ((*(p) == '+')) || ((*(p) == '$')) ||     \

   220        ((*(p) == ',')))

   221 */

   222 

   223 

   224 static int isUserInfo(const char* pch)

   225     {

   226     char ch = *pch;

   227     return

   228             isUnreserved(ch) ||

   229             isEscaped(pch)   ||

   230             ch == ';' || ch == ':' || ch == '&' ||

   231             ch == '=' || ch == '+' || ch == '$' ||

   232             ch == ',';

   233     }

   234 

   235 /*

   236  * uric = reserved | unreserved | escaped

   237  */

   238 

   239 //#define IS_URIC(p) ((IS_UNRESERVED(*(p))) || (IS_ESCAPED(p)) || (IS_RESERVED(*(p))))

   240 

   241 static int isUriC(const char* pch)

   242     {

   243     char ch = *pch;

   244     return isUnreserved(ch) || isEscaped(pch) || isReserved(ch);

   245     }

   246 

   247 /*

   248 * unwise = "{" | "}" | "|" | "\" | "^" | "[" | "]" | "`"

   249 */

   250 

   251 /*

   252 #define IS_UNWISE(p)                                                    \

   253       (((*(p) == '{')) || ((*(p) == '}')) || ((*(p) == '|')) ||         \

   254        ((*(p) == '\\'))|| ((*(p) == '^')) || ((*(p) == '[')) ||        \

   255        ((*(p) == ']')) || ((*(p) == '`')))

   256 */

   257 

   258 static int isUnwise(char ch)

   259     {

   260     return

   261        ch == '{'  || ch == '}' || ch == '|' ||

   262        ch == '\\' || ch == '^' || ch == '[' ||

   263        ch == ']'  || ch == '`';

   264     }

   265 /*

   266  * Skip to next pointer char, handle escaped sequences

   267  */

   268 

   269 #define NEXT(p) ((*p == '%')? p += 3 : p++)

   270 

   271 /*

   272  * Productions from the spec.

   273  *

   274  *    authority     = server | reg_name

   275  *    reg_name      = 1*( unreserved | escaped | "$" | "," |

   276  *                        ";" | ":" | "@" | "&" | "=" | "+" )

   277  *

   278  * path          = [ abs_path | opaque_part ]

   279  */

   280 

   281 /************************************************************************

   282  *                                                                      *

   283  *          Generic URI structure functions                             *

   284  *                                                                      *

   285  ************************************************************************/

   286 

   287 /**

   288  * xmlCreateURI:

   289  *

   290  * Simply creates an empty xmlURI

   291  *

   292  * Returns the new structure or NULL in case of error

   293  *

   294  * OOM: possible --> returns NULL , sets OOM flag

   295  */

   296 XMLPUBFUNEXPORT xmlURIPtr

   297 xmlCreateURI(void) {

   298     xmlURIPtr ret;

   299 

   300     ret = (xmlURIPtr) xmlMalloc(sizeof(xmlURI));

   301     if (ret == NULL) {

   302         xmlGenericError(xmlGenericErrorContext, EMBED_ERRTXT("xmlCreateURI: out of memory\n"));

   303         return(NULL);

   304     }

   305     memset(ret, 0, sizeof(xmlURI));

   306     return(ret);

   307 }

   308 

   309 /**

   310  * xmlSaveUri:

   311  * @param uri pointer to an xmlURI

   312  *

   313  * Save the URI as an escaped string

   314  *

   315  * Returns a new string (to be deallocated by caller)

   316  *

   317  * OOM:

   318  */

   319 XMLPUBFUNEXPORT xmlChar*

   320 xmlSaveUri(xmlURIPtr uri)

   321 {

   322     xmlChar* ret;// = NULL;

   323     const char* p;

   324     int len;

   325     int max;

   326     char ch;

   327 

   328     if (!uri)

   329         return(NULL);

   330 

   331     max = 80;

   332     ret = (xmlChar*) xmlMallocAtomic((max + 1) * sizeof(xmlChar));

   333     if (!ret)

   334         goto OOM;

   335 

   336     len = 0;

   337 

   338     if (uri->scheme != NULL) {

   339         p = uri->scheme;

   340         

   341         while (*p != 0) {

   342             if (len >= max) {

   343                 xmlChar* tmp;

   344                 max *= 2;

   345                 tmp = (xmlChar*) xmlRealloc(ret, (max + 1) * sizeof(xmlChar)); // DONE: Fix xmlRealloc

   346                 if (!tmp)

   347                     goto OOM;

   348                 ret = tmp;

   349             }

   350             ret[len++] = *p++;

   351         }

   352         if (len >= max) {

   353             xmlChar* tmp;

   354             max *= 2;

   355             tmp = (xmlChar*) xmlRealloc(ret, (max + 1) * sizeof(xmlChar)); // DONE: Fix xmlRealloc

   356             if (!tmp)

   357                 goto OOM;

   358             ret = tmp;

   359         }

   360         ret[len++] = ':';

   361     }

   362     if (uri->opaque != NULL) {

   363         p = uri->opaque;

   364         while (*p != 0) {

   365             if (len + 3 >= max) {

   366                 xmlChar* tmp;

   367                 max *= 2;

   368                 tmp = (xmlChar*) xmlRealloc(ret, (max + 1) * sizeof(xmlChar)); // DONE: Fix xmlRealloc

   369                 if (!tmp)

   370                     goto OOM;

   371                 ret = tmp;

   372             }

   373             if (isReserved(*p) || isUnreserved(*p))

   374             {

   375                 ret[len++] = *p++;

   376             }

   377             else

   378             {

   379                 int val = *(unsigned char*)p++;

   380                 int hi = val / 0x10;

   381                 int lo = val % 0x10;

   382                 ret[len++] = '%';

   383                 ret[len++] = hi + (hi > 9? 'A'-10 : '0');

   384                 ret[len++] = lo + (lo > 9? 'A'-10 : '0');

   385             }

   386         }

   387     }

   388     else

   389     {

   390         if (uri->server != NULL) {

   391             if (len + 3 >= max) {

   392                 xmlChar* tmp;

   393                 max *= 2;

   394                 tmp = (xmlChar*) xmlRealloc(ret, (max + 1) * sizeof(xmlChar)); // DONE: Fix xmlRealloc

   395                 if (!tmp)

   396                     goto OOM;

   397                 ret = tmp;

   398             }

   399             ret[len++] = '/';

   400             ret[len++] = '/';

   401             if (uri->user != NULL) {

   402                 p = uri->user;

   403                 

   404                 while (*p != 0) {

   405                     if (len + 3 >= max) {

   406                         xmlChar* tmp;

   407                         max *= 2;

   408                         tmp = (xmlChar*) xmlRealloc(ret, (max + 1) * sizeof(xmlChar)); // DONE: Fix xmlRealloc

   409                         if (!tmp)

   410                             goto OOM;

   411                         ret = tmp;

   412                     }

   413                     ch = *p;

   414                     if (isUnreserved(ch) ||

   415                         ch == ';' || ch == ':' ||

   416                         ch == '&' || ch == '=' ||

   417                         ch == '+' || ch == '$' ||

   418                         ch == ',')

   419                     {

   420                         ret[len++] = *p++;

   421                     }

   422                     else

   423                     {

   424                         int val = *(unsigned char *)p++;

   425                         int hi = val / 0x10, lo = val % 0x10;

   426                         ret[len++] = '%';

   427                         ret[len++] = hi + (hi > 9? 'A'-10 : '0');

   428                         ret[len++] = lo + (lo > 9? 'A'-10 : '0');

   429                     }

   430                 }

   431                 if (len + 3 >= max) {

   432                     xmlChar* tmp;

   433                     max *= 2;

   434                     tmp = (xmlChar*) xmlRealloc(ret, (max + 1) * sizeof(xmlChar)); // DONE: Fix xmlRealloc

   435                     if (!tmp)

   436                         goto OOM;

   437                     ret = tmp;

   438                 }

   439                 ret[len++] = '@';

   440             }

   441             p = uri->server;

   442             while (*p != 0) {

   443                 if (len >= max) {

   444                     xmlChar* tmp;

   445                     max *= 2;

   446                     tmp = (xmlChar*) xmlRealloc(ret, (max + 1) * sizeof(xmlChar)); // DONE: Fix xmlRealloc

   447                     if (!tmp)

   448                         goto OOM;

   449                     ret = tmp;

   450                 }

   451                 ret[len++] = *p++;

   452             }

   453             if (uri->port > 0) {

   454                 if (len + 10 >= max) {

   455                     xmlChar* tmp;

   456                     max *= 2;

   457                     tmp = (xmlChar*) xmlRealloc(ret, (max + 1) * sizeof(xmlChar)); // DONE: Fix xmlRealloc

   458                     if (!tmp)

   459                         goto OOM;

   460                     ret = tmp;

   461                 }

   462                 len += snprintf((char*) &ret[len], max - len, ":%d", uri->port);

   463             }

   464         }

   465         else if (uri->authority != NULL) {

   466             if (len + 3 >= max) {

   467                 xmlChar* tmp;

   468                 max *= 2;

   469                 tmp = (xmlChar*) xmlRealloc(ret, (max + 1) * sizeof(xmlChar)); // DONE: Fix xmlRealloc

   470                 if (!tmp)

   471                     goto OOM;

   472                 ret = tmp;

   473             }

   474             ret[len++] = '/';

   475             ret[len++] = '/';

   476             p = uri->authority;

   477             while (*p != 0) {

   478                 if (len + 3 >= max) {

   479                     xmlChar* tmp;

   480                     max *= 2;

   481                     tmp = (xmlChar*) xmlRealloc(ret, (max + 1) * sizeof(xmlChar)); // DONE: Fix xmlRealloc

   482                     if (!tmp)

   483                         goto OOM;

   484                     ret = tmp;

   485                 }

   486                 ch = *p;

   487                 if (isUnreserved(ch) ||

   488                             ch == '$' || ch == ',' || ch == ';' ||

   489                             ch == ':' || ch == '@' || ch == '&' ||

   490                             ch == '=' || ch == '+')

   491                 {

   492                     ret[len++] = *p++;

   493                 }

   494                 else

   495                 {

   496                     int val = *(unsigned char *)p++;

   497                     int hi = val / 0x10;

   498                     int lo = val % 0x10;

   499                     ret[len++] = '%';

   500                     ret[len++] = hi + (hi > 9? 'A'-10 : '0');

   501                     ret[len++] = lo + (lo > 9? 'A'-10 : '0');

   502                 }

   503             }

   504     }

   505     else if (uri->scheme != NULL) {

   506         if (len + 3 >= max) {

   507             xmlChar* tmp;

   508             max *= 2;

   509             tmp = (xmlChar*) xmlRealloc(ret, (max + 1) * sizeof(xmlChar)); // DONE: Fix xmlRealloc

   510             if (!tmp)

   511                 goto OOM;

   512             ret = tmp;

   513         }

   514         ret[len++] = '/';

   515         ret[len++] = '/';

   516     }

   517     if (uri->path != NULL) {

   518         p = uri->path;

   519         while (*p != 0) {

   520             if (len + 3 >= max) {

   521                 xmlChar* tmp;

   522                 max *= 2;

   523                 tmp = (xmlChar*) xmlRealloc(ret, (max + 1) * sizeof(xmlChar)); // DONE: Fix xmlRealloc

   524                 if (!tmp)

   525                     goto OOM;

   526                 ret = tmp;

   527             }

   528             ch = *p;

   529             if (isUnreserved(ch) || ch == '/' ||

   530                 ch == ';' || ch == '@' || ch == '&' ||

   531                 ch == '=' || ch == '+' || ch == '$' ||

   532                 ch == ',')

   533             {

   534                 ret[len++] = *p++;

   535             }

   536             else

   537             {

   538                 int val = *(unsigned char *)p++;

   539                 int hi = val / 0x10;

   540                 int lo = val % 0x10;

   541                 ret[len++] = '%';

   542                 ret[len++] = hi + (hi > 9? 'A'-10 : '0');

   543                 ret[len++] = lo + (lo > 9? 'A'-10 : '0');

   544             }

   545         }

   546     }

   547     if (uri->query != NULL) {

   548         

   549         if (len + 3 >= max) {

   550             xmlChar* tmp;

   551             max *= 2;

   552             tmp = (xmlChar*) xmlRealloc(ret, (max + 1) * sizeof(xmlChar)); // DONE: Fix xmlRealloc

   553             if (!tmp)

   554                 goto OOM;

   555             ret = tmp;

   556         }

   557         ret[len++] = '?';

   558         p = uri->query;

   559         while (*p != 0) {

   560             if (len + 3 >= max) {

   561                 xmlChar* tmp;

   562                 max *= 2;

   563                 tmp = (xmlChar*) xmlRealloc(ret, (max + 1) * sizeof(xmlChar)); // DONE: Fix xmlRealloc

   564                 if (!tmp)

   565                     goto OOM;

   566                 ret = tmp;

   567             }

   568             if (isUnreserved(*p) || isReserved(*p))

   569             {

   570                 ret[len++] = *p++;

   571             }

   572             else

   573             {

   574                 int val = *(unsigned char *)p++;

   575                 int hi = val / 0x10;

   576                 int lo = val % 0x10;

   577                 ret[len++] = '%';

   578                 ret[len++] = hi + (hi > 9? 'A'-10 : '0');

   579                 ret[len++] = lo + (lo > 9? 'A'-10 : '0');

   580             }

   581         }

   582     }

   583     }

   584     if (uri->fragment != NULL) {

   585         if (len + 3 >= max) {

   586             xmlChar* tmp;

   587             max *= 2;

   588             tmp = (xmlChar*) xmlRealloc(ret, (max + 1) * sizeof(xmlChar)); // DONE: Fix xmlRealloc

   589             if (!tmp)

   590                 goto OOM;

   591             ret = tmp;

   592         }

   593         ret[len++] = '#';

   594         p = uri->fragment;

   595         

   596         while (*p != 0) {

   597             if (len + 3 >= max) {

   598                 xmlChar* tmp;

   599                 max *= 2;

   600                 tmp = (xmlChar*) xmlRealloc(ret, (max + 1) * sizeof(xmlChar)); // DONE: Fix xmlRealloc

   601                 if (!tmp)

   602                     goto OOM;

   603                 ret = tmp;

   604             }

   605             if (isUnreserved(*p) || isReserved(*p))

   606             {

   607                 ret[len++] = *p++;

   608             }

   609             else

   610             {

   611                 int val = *(unsigned char *)p++;

   612                 int hi = val / 0x10;

   613                 int lo = val % 0x10;

   614                 ret[len++] = '%';

   615                 ret[len++] = hi + (hi > 9? 'A'-10 : '0');

   616                 ret[len++] = lo + (lo > 9? 'A'-10 : '0');

   617             }

   618         }

   619     }

   620     if (len >= max) {

   621         xmlChar* tmp;

   622         max *= 2;

   623         tmp = (xmlChar*) xmlRealloc(ret, (max + 1) * sizeof(xmlChar)); // DONE: Fix xmlRealloc

   624         if (!tmp)

   625             goto OOM;

   626         ret = tmp;

   627     }

   628     ret[len++] = 0;

   629     return(ret);

   630 //------------------------------

   631 OOM:

   632     if(ret)

   633         xmlFree(ret);

   634     xmlGenericError(xmlGenericErrorContext, EMBED_ERRTXT("xmlSaveUri: out of memory\n"));

   635     return(NULL);

   636 }

   637 

   638 #ifndef XMLENGINE_EXCLUDE_FILE_FUNC

   639 /**

   640  * xmlPrintURI:

   641  * @param stream a FILE* for the output

   642  * @param uri pointer to an xmlURI

   643  *

   644  * Prints the URI in the stream stream.

   645  */

   646 void

   647 xmlPrintURI(FILE *stream, xmlURIPtr uri) {

   648     xmlChar *out;

   649 

   650     out = xmlSaveUri(uri);

   651     if (out != NULL) {

   652         fprintf(stream, "%s", (char *) out);

   653         xmlFree(out);

   654     }

   655 }

   656 #endif

   657 

   658 /**

   659  * xmlCleanURI:

   660  * @param uri pointer to an xmlURI

   661  *

   662  * Make sure the xmlURI struct is free of content

   663  *

   664  * OOM: never

   665  */

   666 static void

   667 xmlCleanURI(xmlURIPtr uri) {

   668     if (uri == NULL) return;

   669     

   670     if (uri->scheme){

   671         xmlFree(uri->scheme);

   672         uri->scheme = NULL;

   673     }

   674     if (uri->server){

   675         xmlFree(uri->server);

   676         uri->server = NULL;

   677     }

   678     if (uri->user){

   679         xmlFree(uri->user);

   680         uri->user = NULL;

   681     }

   682     if (uri->path) {

   683         xmlFree(uri->path);

   684         uri->path = NULL;

   685     }

   686     if (uri->fragment) {

   687         xmlFree(uri->fragment);

   688         uri->fragment = NULL;

   689     }

   690     if (uri->opaque) {

   691         xmlFree(uri->opaque);

   692         uri->opaque = NULL;

   693     }

   694     if (uri->authority) {

   695         xmlFree(uri->authority);

   696         uri->authority = NULL;

   697     }

   698     if (uri->query) {

   699         xmlFree(uri->query);

   700         uri->query = NULL;

   701     }

   702 }

   703 

   704 /**

   705  * xmlFreeURI:

   706  * @param uri pointer to an xmlURI

   707  *

   708  * Free up the xmlURI struct

   709  */

   710 XMLPUBFUNEXPORT void

   711 xmlFreeURI(xmlURIPtr uri) {

   712     if (uri == NULL) return;

   713 

   714     if (uri->scheme) xmlFree(uri->scheme);

   715     if (uri->server) xmlFree(uri->server);

   716     if (uri->user  ) xmlFree(uri->user);

   717     if (uri->path  ) xmlFree(uri->path);

   718     if (uri->fragment) xmlFree(uri->fragment);

   719     if (uri->opaque) xmlFree(uri->opaque);

   720     if (uri->authority) xmlFree(uri->authority);

   721     if (uri->query) xmlFree(uri->query);

   722     xmlFree(uri);

   723 }

   724 

   725 /************************************************************************

   726  *                                                                      *

   727  *          Helper functions                                            *

   728  *                                                                      *

   729  ************************************************************************/

   730 

   731 /**

   732  * xmlNormalizeURIPath:

   733  * @param path pointer to the path string

   734  *

   735  * Applies the 5 normalization steps to a path string--that is, RFC 2396

   736  * Section 5.2, steps 6.c through 6.g.

   737  *

   738  * Normalization occurs directly on the string, no new allocation is done

   739  *

   740  * Returns 0 or an error code

   741  */

   742 XMLPUBFUNEXPORT int

   743 xmlNormalizeURIPath(char *path) {

   744     char *cur, *out;

   745 

   746     if (path == NULL)

   747         return(-1);

   748 

   749     /* Skip all initial "/" chars.  We want to get to the beginning of the

   750      * first non-empty segment.

   751      */

   752     cur = path;

   753     while (cur[0] == '/')

   754       ++cur;

   755     if (cur[0] == '\0')

   756       return(0);

   757 

   758     /* Keep everything we've seen so far.  */

   759     out = cur;

   760 

   761     /*

   762      * Analyze each segment in sequence for cases (c) and (d).

   763      */

   764     while (cur[0] != '\0') {

   765     /*

   766      * c) All occurrences of "./", where "." is a complete path segment,

   767      *    are removed from the buffer string.

   768      */

   769     if ((cur[0] == '.') && (cur[1] == '/')) {

   770         cur += 2;

   771         /* '//' normalization should be done at this point too */

   772         while (cur[0] == '/')

   773         cur++;

   774         continue;

   775     }

   776 

   777     /*

   778      * d) If the buffer string ends with "." as a complete path segment,

   779      *    that "." is removed.

   780      */

   781     if ((cur[0] == '.') && (cur[1] == '\0'))

   782         break;

   783 

   784     /* Otherwise keep the segment.  */

   785     while (cur[0] != '/') {

   786             if (cur[0] == '\0')

   787               goto done_cd;

   788         (out++)[0] = (cur++)[0];

   789     }

   790     /* nomalize // */

   791     while ((cur[0] == '/') && (cur[1] == '/'))

   792         cur++;

   793 

   794         (out++)[0] = (cur++)[0];

   795     }

   796  done_cd:

   797     out[0] = '\0';

   798 

   799     /* Reset to the beginning of the first segment for the next sequence.  */

   800     cur = path;

   801     while (cur[0] == '/')

   802       ++cur;

   803     if (cur[0] == '\0')

   804         return(0);

   805 

   806     /*

   807      * Analyze each segment in sequence for cases (e) and (f).

   808      *

   809      * e) All occurrences of "<segment>/../", where <segment> is a

   810      *    complete path segment not equal to "..", are removed from the

   811      *    buffer string.  Removal of these path segments is performed

   812      *    iteratively, removing the leftmost matching pattern on each

   813      *    iteration, until no matching pattern remains.

   814      *

   815      * f) If the buffer string ends with "<segment>/..", where <segment>

   816      *    is a complete path segment not equal to "..", that

   817      *    "<segment>/.." is removed.

   818      *

   819      * To satisfy the "iterative" clause in (e), we need to collapse the

   820      * string every time we find something that needs to be removed.  Thus,

   821      * we don't need to keep two pointers into the string: we only need a

   822      * "current position" pointer.

   823      */

   824     while (1) {

   825         char *segp, *tmp;

   826 

   827         /* At the beginning of each iteration of this loop, "cur" points to

   828          * the first character of the segment we want to examine.

   829          */

   830 

   831         /* Find the end of the current segment.  */

   832         segp = cur;

   833         while ((segp[0] != '/') && (segp[0] != '\0'))

   834           ++segp;

   835 

   836         /* If this is the last segment, we're done (we need at least two

   837          * segments to meet the criteria for the (e) and (f) cases).

   838          */

   839         if (segp[0] == '\0')

   840           break;

   841 

   842         /* If the first segment is "..", or if the next segment _isn't_ "..",

   843          * keep this segment and try the next one.

   844          */

   845         ++segp;

   846         if (((cur[0] == '.') && (cur[1] == '.') && (segp == cur+3))

   847             || ((segp[0] != '.') || (segp[1] != '.')

   848             || ((segp[2] != '/') && (segp[2] != '\0')))) {

   849           cur = segp;

   850           continue;

   851         }

   852 

   853         /* If we get here, remove this segment and the next one and back up

   854          * to the previous segment (if there is one), to implement the

   855          * "iteratively" clause.  It's pretty much impossible to back up

   856          * while maintaining two pointers into the buffer, so just compact

   857          * the whole buffer now.

   858          */

   859 

   860         /* If this is the end of the buffer, we're done.  */

   861         if (segp[2] == '\0') {

   862           cur[0] = '\0';

   863           break;

   864         }

   865         /* Valgrind complained, strcpy(cur, segp + 3); */

   866     /* string will overlap, do not use strcpy */

   867     tmp = cur;

   868     segp += 3;

   869     while ((*tmp++ = *segp++) != 0) {} // NOTE: no loop body here

   870 

   871         /* If there are no previous segments, then keep going from here.  */

   872         segp = cur;

   873         while ((segp > path) && ((--segp)[0] == '/'))

   874           ;

   875         if (segp == path)

   876           continue;

   877 

   878         /* "segp" is pointing to the end of a previous segment; find it's

   879          * start.  We need to back up to the previous segment and start

   880          * over with that to handle things like "foo/bar/../..".  If we

   881          * don't do this, then on the first pass we'll remove the "bar/..",

   882          * but be pointing at the second ".." so we won't realize we can also

   883          * remove the "foo/..".

   884          */

   885         cur = segp;

   886         while ((cur > path) && (cur[-1] != '/'))

   887           --cur;

   888     }

   889     out[0] = '\0';

   890 

   891     /*

   892      * g) If the resulting buffer string still begins with one or more

   893      *    complete path segments of "..", then the reference is

   894      *    considered to be in error. Implementations may handle this

   895      *    error by retaining these components in the resolved path (i.e.,

   896      *    treating them as part of the final URI), by removing them from

   897      *    the resolved path (i.e., discarding relative levels above the

   898      *    root), or by avoiding traversal of the reference.

   899      *

   900      * We discard them from the final path.

   901      */

   902     if (path[0] == '/') {

   903       cur = path;

   904       while ((cur[0] == '/') && (cur[1] == '.') && (cur[2] == '.')

   905              && ((cur[3] == '/') || (cur[3] == '\0')))

   906     cur += 3;

   907 

   908       if (cur != path) {

   909     out = path;

   910     while (cur[0] != '\0')

   911           (out++)[0] = (cur++)[0];

   912     out[0] = 0;

   913       }

   914     }

   915 

   916     return(0);

   917 }

   918 

   919 static int is_hex(char c) {

   920     if (((c >= '0') && (c <= '9')) ||

   921         ((c >= 'a') && (c <= 'f')) ||

   922         ((c >= 'A') && (c <= 'F')))

   923     return(1);

   924     return(0);

   925 }

   926 

   927 /**

   928  * xmlURIUnescapeString:

   929  * @param str the string to unescape

   930  * @param len the length in bytes to unescape (or <= 0 to indicate full string)

   931  * @param target optional destination buffer

   932  *

   933  * Unescaping routine, does not do validity checks !

   934  * Output is direct unsigned char translation of %XX values (no encoding)

   935  *

   936  * Returns an copy of the string, but unescaped

   937  *

   938  * OOM: possible --> sets OOM when returns NULL for target==NULL

   939  */

   940 XMLPUBFUNEXPORT char*

   941 xmlURIUnescapeString(const char* str, int len, char* target) {

   942     char* ret;

   943     char* out;

   944     const char *in;

   945 

   946     if (!str)

   947         return(NULL);

   948     if (len <= 0)

   949         len = strlen(str);

   950     if (len < 0)

   951         return(NULL);

   952 

   953     if (!target) {

   954         ret = (char*) xmlMallocAtomic(len + 1); // may set OOM

   955         if (!ret) {

   956             xmlGenericError(xmlGenericErrorContext, EMBED_ERRTXT("xmlURIUnescapeString: out of memory\n"));

   957             return(NULL);

   958         }

   959     } else

   960         ret = target;

   961 

   962     in = str;

   963     out = ret;

   964     while(len > 0) {

   965         if ((*in == '%') && (is_hex(in[1])) && (is_hex(in[2])))

   966         {

   967             in++;

   968             if ((*in >= '0') && (*in <= '9'))

   969                 *out = (*in - '0');

   970             else if ((*in >= 'a') && (*in <= 'f'))

   971                 *out = (*in - 'a') + 10;

   972             else if ((*in >= 'A') && (*in <= 'F'))

   973                 *out = (*in - 'A') + 10;

   974             in++;

   975             if ((*in >= '0') && (*in <= '9'))

   976                 *out = *out * 16 + (*in - '0');

   977             else if ((*in >= 'a') && (*in <= 'f'))

   978                 *out = *out * 16 + (*in - 'a') + 10;

   979             else if ((*in >= 'A') && (*in <= 'F'))

   980                 *out = *out * 16 + (*in - 'A') + 10;

   981             in++;

   982             len -= 3;

   983             out++;

   984         } else {

   985             *out++ = *in++;

   986             len--;

   987         }

   988     }

   989     *out = 0;

   990     return(ret);

   991 }

   992 

   993 /**

   994  * xmlURIEscapeStr:

   995  * @param str string to escape

   996  * @param list exception list string of chars not to escape

   997  *

   998  * This routine escapes a string to hex, ignoring reserved characters (a-z)

   999  * and the characters in the exception list.

  1000  *

  1001  * Returns a new escaped string or NULL in case of error.

  1002  */

  1003 XMLPUBFUNEXPORT xmlChar*

  1004 xmlURIEscapeStr(const xmlChar* str, const xmlChar* list)

  1005 {

  1006     xmlChar* ret;

  1007     xmlChar  ch;

  1008     const xmlChar *in;

  1009 

  1010     unsigned int len, out;

  1011 

  1012     if (!str)

  1013         return(NULL);

  1014     len = xmlStrlen(str);

  1015     if (!(len > 0)) return(NULL);

  1016 

  1017     len += 20;

  1018     ret = (xmlChar*) xmlMallocAtomic(len);

  1019     if (!ret)

  1020         goto OOM;

  1021 

  1022     in = (const xmlChar *) str;

  1023     out = 0;

  1024     while(*in != 0) {

  1025         if (len - out <= 3) {

  1026             xmlChar* tmp;

  1027             len += 20;

  1028             tmp = (xmlChar*) xmlRealloc(ret, len); // DONE: Fix xmlRealloc

  1029             if (!tmp)

  1030                 goto OOM;

  1031             ret = tmp;

  1032         }

  1033 

  1034         ch = *in;

  1035 

  1036         if ((ch != '@') && (!isUnreserved(ch)) && (!xmlStrchr(list, ch))) {

  1037             unsigned char val;

  1038             ret[out++] = '%';

  1039             val = ch >> 4;

  1040             if (val <= 9)

  1041                 ret[out++] = '0' + val;

  1042             else

  1043                 ret[out++] = 'A' + val - 0xA;

  1044             val = ch & 0xF;

  1045             if (val <= 9)

  1046                 ret[out++] = '0' + val;

  1047             else

  1048                 ret[out++] = 'A' + val - 0xA;

  1049             in++;

  1050         } else {

  1051             ret[out++] = *in++;

  1052         }

  1053     } // while(*in != 0)

  1054     ret[out] = 0;

  1055     return(ret);

  1056 //---------------------

  1057 OOM:

  1058     if(ret)

  1059         xmlFree(ret);

  1060     xmlGenericError(xmlGenericErrorContext, EMBED_ERRTXT("xmlURIEscapeStr: out of memory\n"));

  1061     return(NULL);

  1062 }

  1063 

  1064 /**

  1065  * xmlURIEscape:

  1066  * @param str the string of the URI to escape

  1067  *

  1068  * Escaping routine, does not do validity checks !

  1069  * It will try to escape the chars needing this, but this is heuristic

  1070  * based it's impossible to be sure.

  1071  *

  1072  * Returns an copy of the string, but escaped

  1073  *

  1074  * 25 May 2001

  1075  * Uses xmlParseURI and xmlURIEscapeStr to try to escape correctly

  1076  * according to RFC2396.

  1077  *   - Carl Douglas

  1078  */

  1079 XMLPUBFUNEXPORT xmlChar*

  1080 xmlURIEscape(const xmlChar * str)

  1081 {

  1082     xmlChar* ret;

  1083     xmlChar* segment;

  1084     xmlURIPtr uri;

  1085     int ret2;

  1086 

  1087 #define NULLCHK(p) if(!p) goto OOM

  1088 

  1089 

  1090     if (str == NULL)

  1091         return (NULL);

  1092 

  1093     uri = xmlCreateURI();

  1094     if (uri != NULL) {

  1095     /*

  1096      * Allow escaping errors in the unescaped form

  1097      */

  1098         uri->cleanup = 1;

  1099         ret2 = xmlParseURIReference(uri, (const char *)str);

  1100         if (ret2) {

  1101             xmlFreeURI(uri);

  1102             return (NULL);

  1103         }

  1104     }

  1105 

  1106     if (!uri)

  1107         return NULL;

  1108 

  1109     ret = NULL;

  1110 

  1111     if (uri->scheme) {

  1112         segment = xmlURIEscapeStr(BAD_CAST uri->scheme, BAD_CAST "+-.");

  1113         NULLCHK(segment);

  1114         ret = xmlStrcat(ret, segment);

  1115         ret = xmlStrcat(ret, BAD_CAST ":");

  1116         xmlFree(segment);

  1117     }

  1118 

  1119     if (uri->authority) {

  1120         segment = xmlURIEscapeStr(BAD_CAST uri->authority, BAD_CAST "/?;:@");

  1121         NULLCHK(segment);

  1122         ret = xmlStrcat(ret, BAD_CAST "//");

  1123         ret = xmlStrcat(ret, segment);

  1124         xmlFree(segment);

  1125     }

  1126 

  1127     if (uri->user) {

  1128         segment = xmlURIEscapeStr(BAD_CAST uri->user, BAD_CAST ";:&=+$,");

  1129         NULLCHK(segment);

  1130         ret = xmlStrcat(ret,BAD_CAST "//");

  1131         ret = xmlStrcat(ret, segment);

  1132         ret = xmlStrcat(ret, BAD_CAST "@");

  1133         xmlFree(segment);

  1134     }

  1135