Lines Matching refs:URI
2 * uri.c: set of generic URI related routines
24 * The definition of the URI regexp in the above RFC has no size limit
26 * data URI scheme as defined in RFC 2397. Even for data URI the usual
198 * @uri: pointer to an URI structure
201 * Parse an URI scheme
230 * @uri: pointer to an URI structure
233 * Parse the query part of an URI
271 * @uri: pointer to an URI structure
274 * Parse the query part of an URI
314 * @uri: pointer to an URI structure
345 * @uri: pointer to an URI structure
417 * @uri: pointer to an URI structure
496 * @uri: pointer to an URI structure
567 * @uri: pointer to an URI structure
607 * @uri: pointer to an URI structure
653 * @uri: pointer to an URI structure
695 * @uri: pointer to an URI structure
737 * @uri: pointer to an URI structure
785 * @uri: pointer to an URI structure
788 * Parse an URI string and fills in the appropriate fields
843 * @uri: pointer to an URI structure
846 * Parse an URI string and fills in the appropriate fields
884 * @uri: pointer to an URI structure
887 * Parse an URI reference string and fills in the appropriate fields
890 * URI-reference = URI / relative-ref
920 * @str: the URI string to analyze
922 * Parse an URI based on RFC 3986
924 * URI-reference = [ absoluteURI | relativeURI ] [ "#" fragment ]
948 * @uri: pointer to an URI structure
951 * Parse an URI reference string based on RFC 3986 and fills in the
954 * URI-reference = URI / relative-ref
965 * @str: the URI string to analyze
966 * @raw: if 1 unescaping of URI pieces are disabled
968 * Parse an URI but allows to keep intact the original fragments.
970 * URI-reference = URI / relative-ref
997 * Generic URI structure functions *
1014 xmlURIErrMemory("creating URI structure\n");
1024 * Function to handle properly a reallocation when saving an URI
1025 * Also imposes some limit on the length of an URI string output
1039 xmlURIErrMemory("saving URI\n");
1050 * Save the URI as an escaped string
1068 xmlURIErrMemory("saving URI\n");
1326 * Prints the URI in the stream @stream.
1563 * treating them as part of the final URI), by removing them from
1600 * Unescaping routine, but does not check that the string is an URI. The
1621 xmlURIErrMemory("unescaping URI value\n");
1683 xmlURIErrMemory("escaping URI value\n");
1692 xmlURIErrMemory("escaping URI value\n");
1726 * @str: the string of the URI to escape
1747 xmlURIErrMemory("escaping URI value\n"); \
1865 * @URI: the URI instance found in the document
1868 * Computes he final URI of the reference done by checking that
1869 * the given URI is valid, and building the final URI using the
1870 * base URI. This is processed according to section 5.2 of the
1875 * Returns a new URI string (to be freed by the caller) or NULL in case
1879 xmlBuildURI(const xmlChar *URI, const xmlChar *base) {
1887 * 1) The URI reference is parsed into the potential four components and
1890 * NOTE that a completely empty URI is treated by modern browsers
1892 * URI. Should we do that here?
1894 if (URI == NULL)
1897 if (*URI) {
1901 ret = xmlParseURIReference(ref, (const char *) URI);
1910 * The URI is absolute don't modify.
1912 val = xmlStrdup(URI);
1943 * current document and we are done. Otherwise, the reference URI's
1945 * within the URI reference and not inherited from the base URI.
1985 * absolute URI and we are done. Otherwise, the reference URI's
1986 * scheme is inherited from the base URI's scheme component.
2005 * URI's authority is inherited from the base URI's authority
2006 * component, which will also be undefined if the URI scheme does not
2044 * URI's path. Although there are many ways to do this, we will
2056 xmlURIErrMemory("resolving URI against base\n");
2062 * a) All but the last segment of the base URI's path component is
2109 * 7) The resulting URI components, including any inherited from the
2110 * base URI, are recombined to give the absolute form of the URI
2127 * @URI: the URI reference under consideration
2130 * Expresses the URI of the reference in terms relative to the
2133 * URI input URI returned
2141 * URI input URI returned
2148 * Note: if the URI reference is really wierd or complicated, it may be
2151 * since this routine (for reasonable efficiency) assumes URI has
2154 * Returns a new URI string (to be freed by the caller) or NULL in case
2158 xmlBuildRelativeURI (const xmlChar * URI, const xmlChar * base)
2171 if ((URI == NULL) || (*URI == 0))
2175 * First parse URI into a standard form
2180 /* If URI not already in "relative" form */
2181 if (URI[0] != '.') {
2182 ret = xmlParseURIReference (ref, (const char *) URI);
2184 goto done; /* Error in URI, return NULL */
2186 ref->path = (char *)xmlStrdup(URI);
2192 val = xmlStrdup (URI);
2206 * If the scheme / server on the URI differs from the base,
2207 * just return the URI
2213 val = xmlStrdup (URI);
2272 * In URI, "back up" to the last '/' encountered. This will be the
2273 * beginning of the "unique" suffix of URI
2294 if (bptr[pos] != ref->path[pos]) {/* check for trivial URI == base */
2312 * length of the remainder of the URI, plus enough space
2317 xmlURIErrMemory("building relative URI\n");
2330 * Finish up with the end of the URI
2413 /* sanitize filename starting with // so it can be used as URI */
2430 * this looks like an URI where some parts have not been
2462 * Create a URI structure
2515 * Constructs an URI expressing the existing path
2517 * Returns a new URI, or a duplicate of the path parameter if the
2540 /* xmlCanonicPath can return an URI on Windows (is that the intended behaviour?)
2541 If 'cal' is a valid URI allready then we are done here, as continuing would make