2 * tree.c : implementation of access function for an XML tree.
5 * XHTML 1.0 W3C REC: http://www.w3.org/TR/2002/REC-xhtml1-20020801/
7 * See Copyright for the status of this software.
13 /* To avoid EBCDIC trouble when parsing on zOS */
15 #pragma convert("ISO8859-1")
21 #include <string.h> /* for memset() only ! */
34 #include <libxml/xmlmemory.h>
35 #include <libxml/tree.h>
36 #include <libxml/parser.h>
37 #include <libxml/uri.h>
38 #include <libxml/entities.h>
39 #include <libxml/valid.h>
40 #include <libxml/xmlerror.h>
41 #include <libxml/parserInternals.h>
42 #include <libxml/globals.h>
43 #ifdef LIBXML_HTML_ENABLED
44 #include <libxml/HTMLtree.h>
46 #ifdef LIBXML_DEBUG_ENABLED
47 #include <libxml/debugXML.h>
53 int __xmlRegisterCallbacks = 0;
55 /************************************************************************
57 * Forward declarations *
59 ************************************************************************/
62 xmlNewReconciliedNs(xmlDocPtr doc, xmlNodePtr tree, xmlNsPtr ns);
64 static xmlChar* xmlGetPropNodeValueInternal(const xmlAttr *prop);
66 /************************************************************************
68 * Tree memory error handler *
70 ************************************************************************/
73 * @extra: extra informations
75 * Handle an out of memory condition
78 xmlTreeErrMemory(const char *extra)
80 __xmlSimpleError(XML_FROM_TREE, XML_ERR_NO_MEMORY, NULL, NULL, extra);
85 * @code: the error number
86 * @extra: extra informations
88 * Handle an out of memory condition
91 xmlTreeErr(int code, xmlNodePtr node, const char *extra)
93 const char *msg = NULL;
96 case XML_TREE_INVALID_HEX:
97 msg = "invalid hexadecimal character value\n";
99 case XML_TREE_INVALID_DEC:
100 msg = "invalid decimal character value\n";
102 case XML_TREE_UNTERMINATED_ENTITY:
103 msg = "unterminated entity reference %15s\n";
105 case XML_TREE_NOT_UTF8:
106 msg = "string is not in UTF-8\n";
109 msg = "unexpected error number\n";
111 __xmlSimpleError(XML_FROM_TREE, code, node, msg, extra);
114 /************************************************************************
116 * A few static variables and macros *
118 ************************************************************************/
119 /* #undef xmlStringText */
120 const xmlChar xmlStringText[] = { 't', 'e', 'x', 't', 0 };
121 /* #undef xmlStringTextNoenc */
122 const xmlChar xmlStringTextNoenc[] =
123 { 't', 'e', 'x', 't', 'n', 'o', 'e', 'n', 'c', 0 };
124 /* #undef xmlStringComment */
125 const xmlChar xmlStringComment[] = { 'c', 'o', 'm', 'm', 'e', 'n', 't', 0 };
127 static int xmlCompressMode = 0;
128 static int xmlCheckDTD = 1;
130 #define UPDATE_LAST_CHILD_AND_PARENT(n) if ((n) != NULL) { \
131 xmlNodePtr ulccur = (n)->children; \
132 if (ulccur == NULL) { \
135 while (ulccur->next != NULL) { \
136 ulccur->parent = (n); \
137 ulccur = ulccur->next; \
139 ulccur->parent = (n); \
140 (n)->last = ulccur; \
143 #define IS_STR_XML(str) ((str != NULL) && (str[0] == 'x') && \
144 (str[1] == 'm') && (str[2] == 'l') && (str[3] == 0))
146 /* #define DEBUG_BUFFER */
147 /* #define DEBUG_TREE */
149 /************************************************************************
151 * Functions to move to entities.c once the *
152 * API freeze is smoothen and they can be made public. *
154 ************************************************************************/
155 #include <libxml/hash.h>
157 #ifdef LIBXML_TREE_ENABLED
159 * xmlGetEntityFromDtd:
160 * @dtd: A pointer to the DTD to search
161 * @name: The entity name
163 * Do an entity lookup in the DTD entity hash table and
164 * return the corresponding entity, if found.
166 * Returns A pointer to the entity structure or NULL if not found.
169 xmlGetEntityFromDtd(const xmlDtd *dtd, const xmlChar *name) {
170 xmlEntitiesTablePtr table;
172 if((dtd != NULL) && (dtd->entities != NULL)) {
173 table = (xmlEntitiesTablePtr) dtd->entities;
174 return((xmlEntityPtr) xmlHashLookup(table, name));
175 /* return(xmlGetEntityFromTable(table, name)); */
180 * xmlGetParameterEntityFromDtd:
181 * @dtd: A pointer to the DTD to search
182 * @name: The entity name
184 * Do an entity lookup in the DTD pararmeter entity hash table and
185 * return the corresponding entity, if found.
187 * Returns A pointer to the entity structure or NULL if not found.
190 xmlGetParameterEntityFromDtd(const xmlDtd *dtd, const xmlChar *name) {
191 xmlEntitiesTablePtr table;
193 if ((dtd != NULL) && (dtd->pentities != NULL)) {
194 table = (xmlEntitiesTablePtr) dtd->pentities;
195 return((xmlEntityPtr) xmlHashLookup(table, name));
196 /* return(xmlGetEntityFromTable(table, name)); */
200 #endif /* LIBXML_TREE_ENABLED */
202 /************************************************************************
204 * QName handling helper *
206 ************************************************************************/
211 * @prefix: the prefix
212 * @memory: preallocated memory
213 * @len: preallocated memory length
215 * Builds the QName @prefix:@ncname in @memory if there is enough space
216 * and prefix is not NULL nor empty, otherwise allocate a new string.
217 * If prefix is NULL or empty it returns ncname.
219 * Returns the new string which must be freed by the caller if different from
220 * @memory and @ncname or NULL in case of error
223 xmlBuildQName(const xmlChar *ncname, const xmlChar *prefix,
224 xmlChar *memory, int len) {
228 if (ncname == NULL) return(NULL);
229 if (prefix == NULL) return((xmlChar *) ncname);
231 lenn = strlen((char *) ncname);
232 lenp = strlen((char *) prefix);
234 if ((memory == NULL) || (len < lenn + lenp + 2)) {
235 ret = (xmlChar *) xmlMallocAtomic(lenn + lenp + 2);
237 xmlTreeErrMemory("building QName");
243 memcpy(&ret[0], prefix, lenp);
245 memcpy(&ret[lenp + 1], ncname, lenn);
246 ret[lenn + lenp + 1] = 0;
252 * @name: the full QName
253 * @prefix: a xmlChar **
255 * parse an XML qualified name string
257 * [NS 5] QName ::= (Prefix ':')? LocalPart
259 * [NS 6] Prefix ::= NCName
261 * [NS 7] LocalPart ::= NCName
263 * Returns NULL if the name doesn't have a prefix. Otherwise, returns the
264 * local part, and prefix is updated to get the Prefix. Both the return value
265 * and the prefix must be freed by the caller.
268 xmlSplitQName2(const xmlChar *name, xmlChar **prefix) {
272 if (prefix == NULL) return(NULL);
274 if (name == NULL) return(NULL);
276 #ifndef XML_XML_NAMESPACE
277 /* xml: prefix is not really a namespace */
278 if ((name[0] == 'x') && (name[1] == 'm') &&
279 (name[2] == 'l') && (name[3] == ':'))
283 /* nasty but valid */
288 * we are not trying to validate but just to cut, and yes it will
289 * work even if this is as set of UTF-8 encoded chars
291 while ((name[len] != 0) && (name[len] != ':'))
297 *prefix = xmlStrndup(name, len);
298 if (*prefix == NULL) {
299 xmlTreeErrMemory("QName split");
302 ret = xmlStrdup(&name[len + 1]);
304 xmlTreeErrMemory("QName split");
305 if (*prefix != NULL) {
317 * @name: the full QName
320 * parse an XML qualified name string,i
322 * returns NULL if it is not a Qualified Name, otherwise, update len
323 * with the length in byte of the prefix and return a pointer
324 * to the start of the name without the prefix
328 xmlSplitQName3(const xmlChar *name, int *len) {
331 if (name == NULL) return(NULL);
332 if (len == NULL) return(NULL);
334 /* nasty but valid */
339 * we are not trying to validate but just to cut, and yes it will
340 * work even if this is as set of UTF-8 encoded chars
342 while ((name[l] != 0) && (name[l] != ':'))
353 /************************************************************************
355 * Check Name, NCName and QName strings *
357 ************************************************************************/
359 #define CUR_SCHAR(s, l) xmlStringCurrentChar(NULL, s, &l)
361 #if defined(LIBXML_TREE_ENABLED) || defined(LIBXML_XPATH_ENABLED) || defined(LIBXML_SCHEMAS_ENABLED) || defined(LIBXML_DEBUG_ENABLED) || defined (LIBXML_HTML_ENABLED) || defined(LIBXML_SAX1_ENABLED) || defined(LIBXML_HTML_ENABLED) || defined(LIBXML_WRITER_ENABLED) || defined(LIBXML_DOCB_ENABLED) || defined(LIBXML_LEGACY_ENABLED)
364 * @value: the value to check
365 * @space: allow spaces in front and end of the string
367 * Check that a value conforms to the lexical space of NCName
369 * Returns 0 if this validates, a positive error code number otherwise
370 * and -1 in case of internal or API error.
373 xmlValidateNCName(const xmlChar *value, int space) {
374 const xmlChar *cur = value;
381 * First quick algorithm for ASCII range
384 while (IS_BLANK_CH(*cur)) cur++;
385 if (((*cur >= 'a') && (*cur <= 'z')) || ((*cur >= 'A') && (*cur <= 'Z')) ||
390 while (((*cur >= 'a') && (*cur <= 'z')) ||
391 ((*cur >= 'A') && (*cur <= 'Z')) ||
392 ((*cur >= '0') && (*cur <= '9')) ||
393 (*cur == '_') || (*cur == '-') || (*cur == '.'))
396 while (IS_BLANK_CH(*cur)) cur++;
402 * Second check for chars outside the ASCII range
405 c = CUR_SCHAR(cur, l);
407 while (IS_BLANK(c)) {
409 c = CUR_SCHAR(cur, l);
412 if ((!IS_LETTER(c)) && (c != '_'))
415 c = CUR_SCHAR(cur, l);
416 while (IS_LETTER(c) || IS_DIGIT(c) || (c == '.') ||
417 (c == '-') || (c == '_') || IS_COMBINING(c) ||
420 c = CUR_SCHAR(cur, l);
423 while (IS_BLANK(c)) {
425 c = CUR_SCHAR(cur, l);
435 #if defined(LIBXML_TREE_ENABLED) || defined(LIBXML_SCHEMAS_ENABLED)
438 * @value: the value to check
439 * @space: allow spaces in front and end of the string
441 * Check that a value conforms to the lexical space of QName
443 * Returns 0 if this validates, a positive error code number otherwise
444 * and -1 in case of internal or API error.
447 xmlValidateQName(const xmlChar *value, int space) {
448 const xmlChar *cur = value;
454 * First quick algorithm for ASCII range
457 while (IS_BLANK_CH(*cur)) cur++;
458 if (((*cur >= 'a') && (*cur <= 'z')) || ((*cur >= 'A') && (*cur <= 'Z')) ||
463 while (((*cur >= 'a') && (*cur <= 'z')) ||
464 ((*cur >= 'A') && (*cur <= 'Z')) ||
465 ((*cur >= '0') && (*cur <= '9')) ||
466 (*cur == '_') || (*cur == '-') || (*cur == '.'))
470 if (((*cur >= 'a') && (*cur <= 'z')) ||
471 ((*cur >= 'A') && (*cur <= 'Z')) ||
476 while (((*cur >= 'a') && (*cur <= 'z')) ||
477 ((*cur >= 'A') && (*cur <= 'Z')) ||
478 ((*cur >= '0') && (*cur <= '9')) ||
479 (*cur == '_') || (*cur == '-') || (*cur == '.'))
483 while (IS_BLANK_CH(*cur)) cur++;
489 * Second check for chars outside the ASCII range
492 c = CUR_SCHAR(cur, l);
494 while (IS_BLANK(c)) {
496 c = CUR_SCHAR(cur, l);
499 if ((!IS_LETTER(c)) && (c != '_'))
502 c = CUR_SCHAR(cur, l);
503 while (IS_LETTER(c) || IS_DIGIT(c) || (c == '.') ||
504 (c == '-') || (c == '_') || IS_COMBINING(c) ||
507 c = CUR_SCHAR(cur, l);
511 c = CUR_SCHAR(cur, l);
512 if ((!IS_LETTER(c)) && (c != '_'))
515 c = CUR_SCHAR(cur, l);
516 while (IS_LETTER(c) || IS_DIGIT(c) || (c == '.') ||
517 (c == '-') || (c == '_') || IS_COMBINING(c) ||
520 c = CUR_SCHAR(cur, l);
524 while (IS_BLANK(c)) {
526 c = CUR_SCHAR(cur, l);
536 * @value: the value to check
537 * @space: allow spaces in front and end of the string
539 * Check that a value conforms to the lexical space of Name
541 * Returns 0 if this validates, a positive error code number otherwise
542 * and -1 in case of internal or API error.
545 xmlValidateName(const xmlChar *value, int space) {
546 const xmlChar *cur = value;
552 * First quick algorithm for ASCII range
555 while (IS_BLANK_CH(*cur)) cur++;
556 if (((*cur >= 'a') && (*cur <= 'z')) || ((*cur >= 'A') && (*cur <= 'Z')) ||
557 (*cur == '_') || (*cur == ':'))
561 while (((*cur >= 'a') && (*cur <= 'z')) ||
562 ((*cur >= 'A') && (*cur <= 'Z')) ||
563 ((*cur >= '0') && (*cur <= '9')) ||
564 (*cur == '_') || (*cur == '-') || (*cur == '.') || (*cur == ':'))
567 while (IS_BLANK_CH(*cur)) cur++;
573 * Second check for chars outside the ASCII range
576 c = CUR_SCHAR(cur, l);
578 while (IS_BLANK(c)) {
580 c = CUR_SCHAR(cur, l);
583 if ((!IS_LETTER(c)) && (c != '_') && (c != ':'))
586 c = CUR_SCHAR(cur, l);
587 while (IS_LETTER(c) || IS_DIGIT(c) || (c == '.') || (c == ':') ||
588 (c == '-') || (c == '_') || IS_COMBINING(c) || IS_EXTENDER(c)) {
590 c = CUR_SCHAR(cur, l);
593 while (IS_BLANK(c)) {
595 c = CUR_SCHAR(cur, l);
604 * xmlValidateNMToken:
605 * @value: the value to check
606 * @space: allow spaces in front and end of the string
608 * Check that a value conforms to the lexical space of NMToken
610 * Returns 0 if this validates, a positive error code number otherwise
611 * and -1 in case of internal or API error.
614 xmlValidateNMToken(const xmlChar *value, int space) {
615 const xmlChar *cur = value;
621 * First quick algorithm for ASCII range
624 while (IS_BLANK_CH(*cur)) cur++;
625 if (((*cur >= 'a') && (*cur <= 'z')) ||
626 ((*cur >= 'A') && (*cur <= 'Z')) ||
627 ((*cur >= '0') && (*cur <= '9')) ||
628 (*cur == '_') || (*cur == '-') || (*cur == '.') || (*cur == ':'))
632 while (((*cur >= 'a') && (*cur <= 'z')) ||
633 ((*cur >= 'A') && (*cur <= 'Z')) ||
634 ((*cur >= '0') && (*cur <= '9')) ||
635 (*cur == '_') || (*cur == '-') || (*cur == '.') || (*cur == ':'))
638 while (IS_BLANK_CH(*cur)) cur++;
644 * Second check for chars outside the ASCII range
647 c = CUR_SCHAR(cur, l);
649 while (IS_BLANK(c)) {
651 c = CUR_SCHAR(cur, l);
654 if (!(IS_LETTER(c) || IS_DIGIT(c) || (c == '.') || (c == ':') ||
655 (c == '-') || (c == '_') || IS_COMBINING(c) || IS_EXTENDER(c)))
658 c = CUR_SCHAR(cur, l);
659 while (IS_LETTER(c) || IS_DIGIT(c) || (c == '.') || (c == ':') ||
660 (c == '-') || (c == '_') || IS_COMBINING(c) || IS_EXTENDER(c)) {
662 c = CUR_SCHAR(cur, l);
665 while (IS_BLANK(c)) {
667 c = CUR_SCHAR(cur, l);
674 #endif /* LIBXML_TREE_ENABLED */
676 /************************************************************************
678 * Allocation and deallocation of basic structures *
680 ************************************************************************/
683 * xmlSetBufferAllocationScheme:
684 * @scheme: allocation method to use
686 * Set the buffer allocation method. Types are
687 * XML_BUFFER_ALLOC_EXACT - use exact sizes, keeps memory usage down
688 * XML_BUFFER_ALLOC_DOUBLEIT - double buffer when extra needed,
689 * improves performance
692 xmlSetBufferAllocationScheme(xmlBufferAllocationScheme scheme) {
693 if ((scheme == XML_BUFFER_ALLOC_EXACT) ||
694 (scheme == XML_BUFFER_ALLOC_DOUBLEIT) ||
695 (scheme == XML_BUFFER_ALLOC_HYBRID))
696 xmlBufferAllocScheme = scheme;
700 * xmlGetBufferAllocationScheme:
703 * XML_BUFFER_ALLOC_EXACT - use exact sizes, keeps memory usage down
704 * XML_BUFFER_ALLOC_DOUBLEIT - double buffer when extra needed,
705 * improves performance
706 * XML_BUFFER_ALLOC_HYBRID - use exact sizes on small strings to keep memory usage tight
707 * in normal usage, and doubleit on large strings to avoid
708 * pathological performance.
710 * Returns the current allocation scheme
712 xmlBufferAllocationScheme
713 xmlGetBufferAllocationScheme(void) {
714 return(xmlBufferAllocScheme);
719 * @node: the element carrying the namespace
720 * @href: the URI associated
721 * @prefix: the prefix for the namespace
723 * Creation of a new Namespace. This function will refuse to create
724 * a namespace with a similar prefix than an existing one present on this
726 * Note that for a default namespace, @prefix should be NULL.
728 * We use href==NULL in the case of an element creation where the namespace
731 * Returns a new namespace pointer or NULL
734 xmlNewNs(xmlNodePtr node, const xmlChar *href, const xmlChar *prefix) {
737 if ((node != NULL) && (node->type != XML_ELEMENT_NODE))
740 if ((prefix != NULL) && (xmlStrEqual(prefix, BAD_CAST "xml"))) {
741 /* xml namespace is predefined, no need to add it */
742 if (xmlStrEqual(href, XML_XML_NAMESPACE))
746 * Problem, this is an attempt to bind xml prefix to a wrong
747 * namespace, which breaks
748 * Namespace constraint: Reserved Prefixes and Namespace Names
749 * from XML namespace. But documents authors may not care in
750 * their context so let's proceed.
755 * Allocate a new Namespace and fill the fields.
757 cur = (xmlNsPtr) xmlMalloc(sizeof(xmlNs));
759 xmlTreeErrMemory("building namespace");
762 memset(cur, 0, sizeof(xmlNs));
763 cur->type = XML_LOCAL_NAMESPACE;
766 cur->href = xmlStrdup(href);
768 cur->prefix = xmlStrdup(prefix);
771 * Add it at the end to preserve parsing order ...
772 * and checks for existing use of the prefix
775 if (node->nsDef == NULL) {
778 xmlNsPtr prev = node->nsDef;
780 if (((prev->prefix == NULL) && (cur->prefix == NULL)) ||
781 (xmlStrEqual(prev->prefix, cur->prefix))) {
785 while (prev->next != NULL) {
787 if (((prev->prefix == NULL) && (cur->prefix == NULL)) ||
788 (xmlStrEqual(prev->prefix, cur->prefix))) {
801 * @node: a node in the document
802 * @ns: a namespace pointer
804 * Associate a namespace to a node, a posteriori.
807 xmlSetNs(xmlNodePtr node, xmlNsPtr ns) {
810 xmlGenericError(xmlGenericErrorContext,
811 "xmlSetNs: node == NULL\n");
815 if ((node->type == XML_ELEMENT_NODE) ||
816 (node->type == XML_ATTRIBUTE_NODE))
822 * @cur: the namespace pointer
824 * Free up the structures associated to a namespace
827 xmlFreeNs(xmlNsPtr cur) {
830 xmlGenericError(xmlGenericErrorContext,
831 "xmlFreeNs : ns == NULL\n");
835 if (cur->href != NULL) xmlFree((char *) cur->href);
836 if (cur->prefix != NULL) xmlFree((char *) cur->prefix);
842 * @cur: the first namespace pointer
844 * Free up all the structures associated to the chained namespaces.
847 xmlFreeNsList(xmlNsPtr cur) {
851 xmlGenericError(xmlGenericErrorContext,
852 "xmlFreeNsList : ns == NULL\n");
856 while (cur != NULL) {
865 * @doc: the document pointer
866 * @name: the DTD name
867 * @ExternalID: the external ID
868 * @SystemID: the system ID
870 * Creation of a new DTD for the external subset. To create an
871 * internal subset, use xmlCreateIntSubset().
873 * Returns a pointer to the new DTD structure
876 xmlNewDtd(xmlDocPtr doc, const xmlChar *name,
877 const xmlChar *ExternalID, const xmlChar *SystemID) {
880 if ((doc != NULL) && (doc->extSubset != NULL)) {
882 xmlGenericError(xmlGenericErrorContext,
883 "xmlNewDtd(%s): document %s already have a DTD %s\n",
884 /* !!! */ (char *) name, doc->name,
885 /* !!! */ (char *)doc->extSubset->name);
891 * Allocate a new DTD and fill the fields.
893 cur = (xmlDtdPtr) xmlMalloc(sizeof(xmlDtd));
895 xmlTreeErrMemory("building DTD");
898 memset(cur, 0 , sizeof(xmlDtd));
899 cur->type = XML_DTD_NODE;
902 cur->name = xmlStrdup(name);
903 if (ExternalID != NULL)
904 cur->ExternalID = xmlStrdup(ExternalID);
905 if (SystemID != NULL)
906 cur->SystemID = xmlStrdup(SystemID);
908 doc->extSubset = cur;
911 if ((__xmlRegisterCallbacks) && (xmlRegisterNodeDefaultValue))
912 xmlRegisterNodeDefaultValue((xmlNodePtr)cur);
918 * @doc: the document pointer
920 * Get the internal subset of a document
921 * Returns a pointer to the DTD structure or NULL if not found
925 xmlGetIntSubset(const xmlDoc *doc) {
931 while (cur != NULL) {
932 if (cur->type == XML_DTD_NODE)
933 return((xmlDtdPtr) cur);
936 return((xmlDtdPtr) doc->intSubset);
940 * xmlCreateIntSubset:
941 * @doc: the document pointer
942 * @name: the DTD name
943 * @ExternalID: the external (PUBLIC) ID
944 * @SystemID: the system ID
946 * Create the internal subset of a document
947 * Returns a pointer to the new DTD structure
950 xmlCreateIntSubset(xmlDocPtr doc, const xmlChar *name,
951 const xmlChar *ExternalID, const xmlChar *SystemID) {
954 if ((doc != NULL) && (xmlGetIntSubset(doc) != NULL)) {
956 xmlGenericError(xmlGenericErrorContext,
958 "xmlCreateIntSubset(): document %s already have an internal subset\n",
965 * Allocate a new DTD and fill the fields.
967 cur = (xmlDtdPtr) xmlMalloc(sizeof(xmlDtd));
969 xmlTreeErrMemory("building internal subset");
972 memset(cur, 0, sizeof(xmlDtd));
973 cur->type = XML_DTD_NODE;
976 cur->name = xmlStrdup(name);
977 if (cur->name == NULL) {
978 xmlTreeErrMemory("building internal subset");
983 if (ExternalID != NULL) {
984 cur->ExternalID = xmlStrdup(ExternalID);
985 if (cur->ExternalID == NULL) {
986 xmlTreeErrMemory("building internal subset");
987 if (cur->name != NULL)
988 xmlFree((char *)cur->name);
993 if (SystemID != NULL) {
994 cur->SystemID = xmlStrdup(SystemID);
995 if (cur->SystemID == NULL) {
996 xmlTreeErrMemory("building internal subset");
997 if (cur->name != NULL)
998 xmlFree((char *)cur->name);
999 if (cur->ExternalID != NULL)
1000 xmlFree((char *)cur->ExternalID);
1006 doc->intSubset = cur;
1009 if (doc->children == NULL) {
1010 doc->children = (xmlNodePtr) cur;
1011 doc->last = (xmlNodePtr) cur;
1013 if (doc->type == XML_HTML_DOCUMENT_NODE) {
1016 prev = doc->children;
1017 prev->prev = (xmlNodePtr) cur;
1019 doc->children = (xmlNodePtr) cur;
1023 next = doc->children;
1024 while ((next != NULL) && (next->type != XML_ELEMENT_NODE))
1027 cur->prev = doc->last;
1028 cur->prev->next = (xmlNodePtr) cur;
1030 doc->last = (xmlNodePtr) cur;
1033 cur->prev = next->prev;
1034 if (cur->prev == NULL)
1035 doc->children = (xmlNodePtr) cur;
1037 cur->prev->next = (xmlNodePtr) cur;
1038 next->prev = (xmlNodePtr) cur;
1044 if ((__xmlRegisterCallbacks) && (xmlRegisterNodeDefaultValue))
1045 xmlRegisterNodeDefaultValue((xmlNodePtr)cur);
1053 * Free a string if it is not owned by the "dict" dictionary in the
1056 #define DICT_FREE(str) \
1057 if ((str) && ((!dict) || \
1058 (xmlDictOwns(dict, (const xmlChar *)(str)) == 0))) \
1059 xmlFree((char *)(str));
1066 * Copy a string using a "dict" dictionary in the current scope,
1069 #define DICT_COPY(str, cpy) \
1072 if (xmlDictOwns(dict, (const xmlChar *)(str))) \
1073 cpy = (xmlChar *) (str); \
1075 cpy = (xmlChar *) xmlDictLookup((dict), (const xmlChar *)(str), -1); \
1077 cpy = xmlStrdup((const xmlChar *)(str)); }
1083 * Copy a string using a "dict" dictionary in the current scope,
1086 #define DICT_CONST_COPY(str, cpy) \
1089 if (xmlDictOwns(dict, (const xmlChar *)(str))) \
1090 cpy = (const xmlChar *) (str); \
1092 cpy = xmlDictLookup((dict), (const xmlChar *)(str), -1); \
1094 cpy = (const xmlChar *) xmlStrdup((const xmlChar *)(str)); }
1099 * @cur: the DTD structure to free up
1101 * Free a DTD structure.
1104 xmlFreeDtd(xmlDtdPtr cur) {
1105 xmlDictPtr dict = NULL;
1110 if (cur->doc != NULL) dict = cur->doc->dict;
1112 if ((__xmlRegisterCallbacks) && (xmlDeregisterNodeDefaultValue))
1113 xmlDeregisterNodeDefaultValue((xmlNodePtr)cur);
1115 if (cur->children != NULL) {
1116 xmlNodePtr next, c = cur->children;
1119 * Cleanup all nodes which are not part of the specific lists
1120 * of notations, elements, attributes and entities.
1124 if ((c->type != XML_NOTATION_NODE) &&
1125 (c->type != XML_ELEMENT_DECL) &&
1126 (c->type != XML_ATTRIBUTE_DECL) &&
1127 (c->type != XML_ENTITY_DECL)) {
1134 DICT_FREE(cur->name)
1135 DICT_FREE(cur->SystemID)
1136 DICT_FREE(cur->ExternalID)
1138 if (cur->notations != NULL)
1139 xmlFreeNotationTable((xmlNotationTablePtr) cur->notations);
1141 if (cur->elements != NULL)
1142 xmlFreeElementTable((xmlElementTablePtr) cur->elements);
1143 if (cur->attributes != NULL)
1144 xmlFreeAttributeTable((xmlAttributeTablePtr) cur->attributes);
1145 if (cur->entities != NULL)
1146 xmlFreeEntitiesTable((xmlEntitiesTablePtr) cur->entities);
1147 if (cur->pentities != NULL)
1148 xmlFreeEntitiesTable((xmlEntitiesTablePtr) cur->pentities);
1155 * @version: xmlChar string giving the version of XML "1.0"
1157 * Creates a new XML document
1159 * Returns a new document
1162 xmlNewDoc(const xmlChar *version) {
1165 if (version == NULL)
1166 version = (const xmlChar *) "1.0";
1169 * Allocate a new document and fill the fields.
1171 cur = (xmlDocPtr) xmlMalloc(sizeof(xmlDoc));
1173 xmlTreeErrMemory("building doc");
1176 memset(cur, 0, sizeof(xmlDoc));
1177 cur->type = XML_DOCUMENT_NODE;
1179 cur->version = xmlStrdup(version);
1180 if (cur->version == NULL) {
1181 xmlTreeErrMemory("building doc");
1185 cur->standalone = -1;
1186 cur->compression = -1; /* not initialized */
1188 cur->parseFlags = 0;
1189 cur->properties = XML_DOC_USERBUILT;
1191 * The in memory encoding is always UTF8
1192 * This field will never change and would
1193 * be obsolete if not for binary compatibility.
1195 cur->charset = XML_CHAR_ENCODING_UTF8;
1197 if ((__xmlRegisterCallbacks) && (xmlRegisterNodeDefaultValue))
1198 xmlRegisterNodeDefaultValue((xmlNodePtr)cur);
1204 * @cur: pointer to the document
1206 * Free up all the structures used by a document, tree included.
1209 xmlFreeDoc(xmlDocPtr cur) {
1210 xmlDtdPtr extSubset, intSubset;
1211 xmlDictPtr dict = NULL;
1215 xmlGenericError(xmlGenericErrorContext,
1216 "xmlFreeDoc : document == NULL\n");
1220 #ifdef LIBXML_DEBUG_RUNTIME
1221 #ifdef LIBXML_DEBUG_ENABLED
1222 xmlDebugCheckDocument(stderr, cur);
1226 if (cur != NULL) dict = cur->dict;
1228 if ((__xmlRegisterCallbacks) && (xmlDeregisterNodeDefaultValue))
1229 xmlDeregisterNodeDefaultValue((xmlNodePtr)cur);
1232 * Do this before freeing the children list to avoid ID lookups
1234 if (cur->ids != NULL) xmlFreeIDTable((xmlIDTablePtr) cur->ids);
1236 if (cur->refs != NULL) xmlFreeRefTable((xmlRefTablePtr) cur->refs);
1238 extSubset = cur->extSubset;
1239 intSubset = cur->intSubset;
1240 if (intSubset == extSubset)
1242 if (extSubset != NULL) {
1243 xmlUnlinkNode((xmlNodePtr) cur->extSubset);
1244 cur->extSubset = NULL;
1245 xmlFreeDtd(extSubset);
1247 if (intSubset != NULL) {
1248 xmlUnlinkNode((xmlNodePtr) cur->intSubset);
1249 cur->intSubset = NULL;
1250 xmlFreeDtd(intSubset);
1253 if (cur->children != NULL) xmlFreeNodeList(cur->children);
1254 if (cur->oldNs != NULL) xmlFreeNsList(cur->oldNs);
1256 DICT_FREE(cur->version)
1257 DICT_FREE(cur->name)
1258 DICT_FREE(cur->encoding)
1261 if (dict) xmlDictFree(dict);
1265 * xmlStringLenGetNodeList:
1266 * @doc: the document
1267 * @value: the value of the text
1268 * @len: the length of the string value
1270 * Parse the value string and build the node list associated. Should
1271 * produce a flat tree with only TEXTs and ENTITY_REFs.
1272 * Returns a pointer to the first child
1275 xmlStringLenGetNodeList(const xmlDoc *doc, const xmlChar *value, int len) {
1276 xmlNodePtr ret = NULL, last = NULL;
1279 const xmlChar *cur = value, *end = cur + len;
1284 if (value == NULL) return(NULL);
1286 buf = xmlBufCreateSize(0);
1287 if (buf == NULL) return(NULL);
1288 xmlBufSetAllocationScheme(buf, XML_BUFFER_ALLOC_HYBRID);
1291 while ((cur < end) && (*cur != 0)) {
1292 if (cur[0] == '&') {
1297 * Save the current text.
1300 if (xmlBufAdd(buf, q, cur - q))
1304 if ((cur + 2 < end) && (cur[1] == '#') && (cur[2] == 'x')) {
1310 while (tmp != ';') { /* Non input consuming loop */
1311 if ((tmp >= '0') && (tmp <= '9'))
1312 charval = charval * 16 + (tmp - '0');
1313 else if ((tmp >= 'a') && (tmp <= 'f'))
1314 charval = charval * 16 + (tmp - 'a') + 10;
1315 else if ((tmp >= 'A') && (tmp <= 'F'))
1316 charval = charval * 16 + (tmp - 'A') + 10;
1318 xmlTreeErr(XML_TREE_INVALID_HEX, (xmlNodePtr) doc,
1332 } else if ((cur + 1 < end) && (cur[1] == '#')) {
1338 while (tmp != ';') { /* Non input consuming loops */
1339 if ((tmp >= '0') && (tmp <= '9'))
1340 charval = charval * 10 + (tmp - '0');
1342 xmlTreeErr(XML_TREE_INVALID_DEC, (xmlNodePtr) doc,
1358 * Read the entity string
1362 while ((cur < end) && (*cur != 0) && (*cur != ';')) cur++;
1363 if ((cur >= end) || (*cur == 0)) {
1364 xmlTreeErr(XML_TREE_UNTERMINATED_ENTITY, (xmlNodePtr) doc,
1370 * Predefined entities don't generate nodes
1372 val = xmlStrndup(q, cur - q);
1373 ent = xmlGetDocEntity(doc, val);
1374 if ((ent != NULL) &&
1375 (ent->etype == XML_INTERNAL_PREDEFINED_ENTITY)) {
1377 if (xmlBufCat(buf, ent->content))
1382 * Flush buffer so far
1384 if (!xmlBufIsEmpty(buf)) {
1385 node = xmlNewDocText(doc, NULL);
1387 if (val != NULL) xmlFree(val);
1390 node->content = xmlBufDetach(buf);
1395 last = xmlAddNextSibling(last, node);
1400 * Create a new REFERENCE_REF node
1402 node = xmlNewReference(doc, val);
1404 if (val != NULL) xmlFree(val);
1407 else if ((ent != NULL) && (ent->children == NULL)) {
1410 /* Set to non-NULL value to avoid recursion. */
1411 ent->children = (xmlNodePtr) -1;
1412 ent->children = xmlStringGetNodeList(doc,
1413 (const xmlChar*)node->content);
1415 temp = ent->children;
1417 temp->parent = (xmlNodePtr)ent;
1425 last = xmlAddNextSibling(last, node);
1437 l = xmlCopyCharMultiByte(buffer, charval);
1440 if (xmlBufCat(buf, buffer))
1450 * Handle the last piece of text.
1452 if (xmlBufAdd(buf, q, cur - q))
1456 if (!xmlBufIsEmpty(buf)) {
1457 node = xmlNewDocText(doc, NULL);
1458 if (node == NULL) goto out;
1459 node->content = xmlBufDetach(buf);
1464 xmlAddNextSibling(last, node);
1466 } else if (ret == NULL) {
1467 ret = xmlNewDocText(doc, BAD_CAST "");
1476 * xmlStringGetNodeList:
1477 * @doc: the document
1478 * @value: the value of the attribute
1480 * Parse the value string and build the node list associated. Should
1481 * produce a flat tree with only TEXTs and ENTITY_REFs.
1482 * Returns a pointer to the first child
1485 xmlStringGetNodeList(const xmlDoc *doc, const xmlChar *value) {
1486 xmlNodePtr ret = NULL, last = NULL;
1489 const xmlChar *cur = value;
1494 if (value == NULL) return(NULL);
1496 buf = xmlBufCreateSize(0);
1497 if (buf == NULL) return(NULL);
1498 xmlBufSetAllocationScheme(buf, XML_BUFFER_ALLOC_HYBRID);
1502 if (cur[0] == '&') {
1507 * Save the current text.
1510 if (xmlBufAdd(buf, q, cur - q))
1514 if ((cur[1] == '#') && (cur[2] == 'x')) {
1517 while (tmp != ';') { /* Non input consuming loop */
1518 if ((tmp >= '0') && (tmp <= '9'))
1519 charval = charval * 16 + (tmp - '0');
1520 else if ((tmp >= 'a') && (tmp <= 'f'))
1521 charval = charval * 16 + (tmp - 'a') + 10;
1522 else if ((tmp >= 'A') && (tmp <= 'F'))
1523 charval = charval * 16 + (tmp - 'A') + 10;
1525 xmlTreeErr(XML_TREE_INVALID_HEX, (xmlNodePtr) doc,
1536 } else if (cur[1] == '#') {
1539 while (tmp != ';') { /* Non input consuming loops */
1540 if ((tmp >= '0') && (tmp <= '9'))
1541 charval = charval * 10 + (tmp - '0');
1543 xmlTreeErr(XML_TREE_INVALID_DEC, (xmlNodePtr) doc,
1556 * Read the entity string
1560 while ((*cur != 0) && (*cur != ';')) cur++;
1562 xmlTreeErr(XML_TREE_UNTERMINATED_ENTITY,
1563 (xmlNodePtr) doc, (const char *) q);
1568 * Predefined entities don't generate nodes
1570 val = xmlStrndup(q, cur - q);
1571 ent = xmlGetDocEntity(doc, val);
1572 if ((ent != NULL) &&
1573 (ent->etype == XML_INTERNAL_PREDEFINED_ENTITY)) {
1575 if (xmlBufCat(buf, ent->content))
1580 * Flush buffer so far
1582 if (!xmlBufIsEmpty(buf)) {
1583 node = xmlNewDocText(doc, NULL);
1584 node->content = xmlBufDetach(buf);
1589 last = xmlAddNextSibling(last, node);
1594 * Create a new REFERENCE_REF node
1596 node = xmlNewReference(doc, val);
1598 if (val != NULL) xmlFree(val);
1601 else if ((ent != NULL) && (ent->children == NULL)) {
1604 /* Set to non-NULL value to avoid recursion. */
1605 ent->children = (xmlNodePtr) -1;
1606 ent->children = xmlStringGetNodeList(doc,
1607 (const xmlChar*)node->content);
1609 temp = ent->children;
1611 temp->parent = (xmlNodePtr)ent;
1619 last = xmlAddNextSibling(last, node);
1631 len = xmlCopyCharMultiByte(buffer, charval);
1634 if (xmlBufCat(buf, buffer))
1641 if ((cur != q) || (ret == NULL)) {
1643 * Handle the last piece of text.
1645 xmlBufAdd(buf, q, cur - q);
1648 if (!xmlBufIsEmpty(buf)) {
1649 node = xmlNewDocText(doc, NULL);
1650 node->content = xmlBufDetach(buf);
1655 xmlAddNextSibling(last, node);
1665 * xmlNodeListGetString:
1666 * @doc: the document
1667 * @list: a Node list
1668 * @inLine: should we replace entity contents or show their external form
1670 * Build the string equivalent to the text contained in the Node list
1671 * made of TEXTs and ENTITY_REFs
1673 * Returns a pointer to the string copy, the caller must free it with xmlFree().
1676 xmlNodeListGetString(xmlDocPtr doc, const xmlNode *list, int inLine)
1678 const xmlNode *node = list;
1679 xmlChar *ret = NULL;
1685 if ((list->parent != NULL) && (list->parent->type == XML_ATTRIBUTE_NODE))
1690 while (node != NULL) {
1691 if ((node->type == XML_TEXT_NODE) ||
1692 (node->type == XML_CDATA_SECTION_NODE)) {
1694 ret = xmlStrcat(ret, node->content);
1699 buffer = xmlEncodeAttributeEntities(doc, node->content);
1701 buffer = xmlEncodeEntitiesReentrant(doc, node->content);
1702 if (buffer != NULL) {
1703 ret = xmlStrcat(ret, buffer);
1707 } else if (node->type == XML_ENTITY_REF_NODE) {
1709 ent = xmlGetDocEntity(doc, node->name);
1713 /* an entity content can be any "well balanced chunk",
1714 * i.e. the result of the content [43] production:
1715 * http://www.w3.org/TR/REC-xml#NT-content.
1716 * So it can contain text, CDATA section or nested
1717 * entity reference nodes (among others).
1718 * -> we recursive call xmlNodeListGetString()
1719 * which handles these types */
1720 buffer = xmlNodeListGetString(doc, ent->children, 1);
1721 if (buffer != NULL) {
1722 ret = xmlStrcat(ret, buffer);
1726 ret = xmlStrcat(ret, node->content);
1733 ret = xmlStrncat(ret, buf, 1);
1734 ret = xmlStrcat(ret, node->name);
1737 ret = xmlStrncat(ret, buf, 1);
1742 xmlGenericError(xmlGenericErrorContext,
1743 "xmlGetNodeListString : invalid node type %d\n",
1752 #ifdef LIBXML_TREE_ENABLED
1754 * xmlNodeListGetRawString:
1755 * @doc: the document
1756 * @list: a Node list
1757 * @inLine: should we replace entity contents or show their external form
1759 * Builds the string equivalent to the text contained in the Node list
1760 * made of TEXTs and ENTITY_REFs, contrary to xmlNodeListGetString()
1761 * this function doesn't do any character encoding handling.
1763 * Returns a pointer to the string copy, the caller must free it with xmlFree().
1766 xmlNodeListGetRawString(const xmlDoc *doc, const xmlNode *list, int inLine)
1768 const xmlNode *node = list;
1769 xmlChar *ret = NULL;
1775 while (node != NULL) {
1776 if ((node->type == XML_TEXT_NODE) ||
1777 (node->type == XML_CDATA_SECTION_NODE)) {
1779 ret = xmlStrcat(ret, node->content);
1783 buffer = xmlEncodeSpecialChars(doc, node->content);
1784 if (buffer != NULL) {
1785 ret = xmlStrcat(ret, buffer);
1789 } else if (node->type == XML_ENTITY_REF_NODE) {
1791 ent = xmlGetDocEntity(doc, node->name);
1795 /* an entity content can be any "well balanced chunk",
1796 * i.e. the result of the content [43] production:
1797 * http://www.w3.org/TR/REC-xml#NT-content.
1798 * So it can contain text, CDATA section or nested
1799 * entity reference nodes (among others).
1800 * -> we recursive call xmlNodeListGetRawString()
1801 * which handles these types */
1803 xmlNodeListGetRawString(doc, ent->children, 1);
1804 if (buffer != NULL) {
1805 ret = xmlStrcat(ret, buffer);
1809 ret = xmlStrcat(ret, node->content);
1816 ret = xmlStrncat(ret, buf, 1);
1817 ret = xmlStrcat(ret, node->name);
1820 ret = xmlStrncat(ret, buf, 1);
1825 xmlGenericError(xmlGenericErrorContext,
1826 "xmlGetNodeListString : invalid node type %d\n",
1834 #endif /* LIBXML_TREE_ENABLED */
1837 xmlNewPropInternal(xmlNodePtr node, xmlNsPtr ns,
1838 const xmlChar * name, const xmlChar * value,
1842 xmlDocPtr doc = NULL;
1844 if ((node != NULL) && (node->type != XML_ELEMENT_NODE)) {
1845 if ((eatname == 1) &&
1846 ((node->doc == NULL) ||
1847 (!(xmlDictOwns(node->doc->dict, name)))))
1848 xmlFree((xmlChar *) name);
1853 * Allocate a new property and fill the fields.
1855 cur = (xmlAttrPtr) xmlMalloc(sizeof(xmlAttr));
1857 if ((eatname == 1) &&
1858 ((node == NULL) || (node->doc == NULL) ||
1859 (!(xmlDictOwns(node->doc->dict, name)))))
1860 xmlFree((xmlChar *) name);
1861 xmlTreeErrMemory("building attribute");
1864 memset(cur, 0, sizeof(xmlAttr));
1865 cur->type = XML_ATTRIBUTE_NODE;
1875 if ((doc != NULL) && (doc->dict != NULL))
1876 cur->name = (xmlChar *) xmlDictLookup(doc->dict, name, -1);
1878 cur->name = xmlStrdup(name);
1882 if (value != NULL) {
1885 if(!xmlCheckUTF8(value)) {
1886 xmlTreeErr(XML_TREE_NOT_UTF8, (xmlNodePtr) doc,
1889 doc->encoding = xmlStrdup(BAD_CAST "ISO-8859-1");
1891 cur->children = xmlNewDocText(doc, value);
1893 tmp = cur->children;
1894 while (tmp != NULL) {
1895 tmp->parent = (xmlNodePtr) cur;
1896 if (tmp->next == NULL)
1903 * Add it at the end to preserve parsing order ...
1906 if (node->properties == NULL) {
1907 node->properties = cur;
1909 xmlAttrPtr prev = node->properties;
1911 while (prev->next != NULL)
1918 if ((value != NULL) && (node != NULL) &&
1919 (xmlIsID(node->doc, node, cur) == 1))
1920 xmlAddID(NULL, node->doc, value, cur);
1922 if ((__xmlRegisterCallbacks) && (xmlRegisterNodeDefaultValue))
1923 xmlRegisterNodeDefaultValue((xmlNodePtr) cur);
1927 #if defined(LIBXML_TREE_ENABLED) || defined(LIBXML_HTML_ENABLED) || \
1928 defined(LIBXML_SCHEMAS_ENABLED)
1931 * @node: the holding node
1932 * @name: the name of the attribute
1933 * @value: the value of the attribute
1935 * Create a new property carried by a node.
1936 * Returns a pointer to the attribute
1939 xmlNewProp(xmlNodePtr node, const xmlChar *name, const xmlChar *value) {
1943 xmlGenericError(xmlGenericErrorContext,
1944 "xmlNewProp : name == NULL\n");
1949 return xmlNewPropInternal(node, NULL, name, value, 0);
1951 #endif /* LIBXML_TREE_ENABLED */
1955 * @node: the holding node
1956 * @ns: the namespace
1957 * @name: the name of the attribute
1958 * @value: the value of the attribute
1960 * Create a new property tagged with a namespace and carried by a node.
1961 * Returns a pointer to the attribute
1964 xmlNewNsProp(xmlNodePtr node, xmlNsPtr ns, const xmlChar *name,
1965 const xmlChar *value) {
1969 xmlGenericError(xmlGenericErrorContext,
1970 "xmlNewNsProp : name == NULL\n");
1975 return xmlNewPropInternal(node, ns, name, value, 0);
1979 * xmlNewNsPropEatName:
1980 * @node: the holding node
1981 * @ns: the namespace
1982 * @name: the name of the attribute
1983 * @value: the value of the attribute
1985 * Create a new property tagged with a namespace and carried by a node.
1986 * Returns a pointer to the attribute
1989 xmlNewNsPropEatName(xmlNodePtr node, xmlNsPtr ns, xmlChar *name,
1990 const xmlChar *value) {
1994 xmlGenericError(xmlGenericErrorContext,
1995 "xmlNewNsPropEatName : name == NULL\n");
2000 return xmlNewPropInternal(node, ns, name, value, 1);
2005 * @doc: the document
2006 * @name: the name of the attribute
2007 * @value: the value of the attribute
2009 * Create a new property carried by a document.
2010 * Returns a pointer to the attribute
2013 xmlNewDocProp(xmlDocPtr doc, const xmlChar *name, const xmlChar *value) {
2018 xmlGenericError(xmlGenericErrorContext,
2019 "xmlNewDocProp : name == NULL\n");
2025 * Allocate a new property and fill the fields.
2027 cur = (xmlAttrPtr) xmlMalloc(sizeof(xmlAttr));
2029 xmlTreeErrMemory("building attribute");
2032 memset(cur, 0, sizeof(xmlAttr));
2033 cur->type = XML_ATTRIBUTE_NODE;
2035 if ((doc != NULL) && (doc->dict != NULL))
2036 cur->name = xmlDictLookup(doc->dict, name, -1);
2038 cur->name = xmlStrdup(name);
2040 if (value != NULL) {
2043 cur->children = xmlStringGetNodeList(doc, value);
2046 tmp = cur->children;
2047 while (tmp != NULL) {
2048 tmp->parent = (xmlNodePtr) cur;
2049 if (tmp->next == NULL)
2055 if ((__xmlRegisterCallbacks) && (xmlRegisterNodeDefaultValue))
2056 xmlRegisterNodeDefaultValue((xmlNodePtr)cur);
2062 * @cur: the first property in the list
2064 * Free a property and all its siblings, all the children are freed too.
2067 xmlFreePropList(xmlAttrPtr cur) {
2069 if (cur == NULL) return;
2070 while (cur != NULL) {
2079 * @cur: an attribute
2081 * Free one attribute, all the content is freed too
2084 xmlFreeProp(xmlAttrPtr cur) {
2085 xmlDictPtr dict = NULL;
2086 if (cur == NULL) return;
2088 if (cur->doc != NULL) dict = cur->doc->dict;
2090 if ((__xmlRegisterCallbacks) && (xmlDeregisterNodeDefaultValue))
2091 xmlDeregisterNodeDefaultValue((xmlNodePtr)cur);
2093 /* Check for ID removal -> leading to invalid references ! */
2094 if ((cur->doc != NULL) && (cur->atype == XML_ATTRIBUTE_ID)) {
2095 xmlRemoveID(cur->doc, cur);
2097 if (cur->children != NULL) xmlFreeNodeList(cur->children);
2098 DICT_FREE(cur->name)
2104 * @cur: an attribute
2106 * Unlink and free one attribute, all the content is freed too
2107 * Note this doesn't work for namespace definition attributes
2109 * Returns 0 if success and -1 in case of error.
2112 xmlRemoveProp(xmlAttrPtr cur) {
2116 xmlGenericError(xmlGenericErrorContext,
2117 "xmlRemoveProp : cur == NULL\n");
2121 if (cur->parent == NULL) {
2123 xmlGenericError(xmlGenericErrorContext,
2124 "xmlRemoveProp : cur->parent == NULL\n");
2128 tmp = cur->parent->properties;
2130 cur->parent->properties = cur->next;
2131 if (cur->next != NULL)
2132 cur->next->prev = NULL;
2136 while (tmp != NULL) {
2137 if (tmp->next == cur) {
2138 tmp->next = cur->next;
2139 if (tmp->next != NULL)
2140 tmp->next->prev = tmp;
2147 xmlGenericError(xmlGenericErrorContext,
2148 "xmlRemoveProp : attribute not owned by its node\n");
2155 * @doc: the target document
2156 * @name: the processing instruction name
2157 * @content: the PI content
2159 * Creation of a processing instruction element.
2160 * Returns a pointer to the new node object.
2163 xmlNewDocPI(xmlDocPtr doc, const xmlChar *name, const xmlChar *content) {
2168 xmlGenericError(xmlGenericErrorContext,
2169 "xmlNewPI : name == NULL\n");
2175 * Allocate a new node and fill the fields.
2177 cur = (xmlNodePtr) xmlMalloc(sizeof(xmlNode));
2179 xmlTreeErrMemory("building PI");
2182 memset(cur, 0, sizeof(xmlNode));
2183 cur->type = XML_PI_NODE;
2185 if ((doc != NULL) && (doc->dict != NULL))
2186 cur->name = xmlDictLookup(doc->dict, name, -1);
2188 cur->name = xmlStrdup(name);
2189 if (content != NULL) {
2190 cur->content = xmlStrdup(content);
2194 if ((__xmlRegisterCallbacks) && (xmlRegisterNodeDefaultValue))
2195 xmlRegisterNodeDefaultValue((xmlNodePtr)cur);
2201 * @name: the processing instruction name
2202 * @content: the PI content
2204 * Creation of a processing instruction element.
2205 * Use xmlDocNewPI preferably to get string interning
2207 * Returns a pointer to the new node object.
2210 xmlNewPI(const xmlChar *name, const xmlChar *content) {
2211 return(xmlNewDocPI(NULL, name, content));
2216 * @ns: namespace if any
2217 * @name: the node name
2219 * Creation of a new node element. @ns is optional (NULL).
2221 * Returns a pointer to the new node object. Uses xmlStrdup() to make
2225 xmlNewNode(xmlNsPtr ns, const xmlChar *name) {
2230 xmlGenericError(xmlGenericErrorContext,
2231 "xmlNewNode : name == NULL\n");
2237 * Allocate a new node and fill the fields.
2239 cur = (xmlNodePtr) xmlMalloc(sizeof(xmlNode));
2241 xmlTreeErrMemory("building node");
2244 memset(cur, 0, sizeof(xmlNode));
2245 cur->type = XML_ELEMENT_NODE;
2247 cur->name = xmlStrdup(name);
2250 if ((__xmlRegisterCallbacks) && (xmlRegisterNodeDefaultValue))
2251 xmlRegisterNodeDefaultValue(cur);
2256 * xmlNewNodeEatName:
2257 * @ns: namespace if any
2258 * @name: the node name
2260 * Creation of a new node element. @ns is optional (NULL).
2262 * Returns a pointer to the new node object, with pointer @name as
2263 * new node's name. Use xmlNewNode() if a copy of @name string is
2264 * is needed as new node's name.
2267 xmlNewNodeEatName(xmlNsPtr ns, xmlChar *name) {
2272 xmlGenericError(xmlGenericErrorContext,
2273 "xmlNewNode : name == NULL\n");
2279 * Allocate a new node and fill the fields.
2281 cur = (xmlNodePtr) xmlMalloc(sizeof(xmlNode));
2283 xmlTreeErrMemory("building node");
2284 /* we can't check here that name comes from the doc dictionary */
2287 memset(cur, 0, sizeof(xmlNode));
2288 cur->type = XML_ELEMENT_NODE;
2293 if ((__xmlRegisterCallbacks) && (xmlRegisterNodeDefaultValue))
2294 xmlRegisterNodeDefaultValue((xmlNodePtr)cur);
2300 * @doc: the document
2301 * @ns: namespace if any
2302 * @name: the node name
2303 * @content: the XML text content if any
2305 * Creation of a new node element within a document. @ns and @content
2306 * are optional (NULL).
2307 * NOTE: @content is supposed to be a piece of XML CDATA, so it allow entities
2308 * references, but XML special chars need to be escaped first by using
2309 * xmlEncodeEntitiesReentrant(). Use xmlNewDocRawNode() if you don't
2310 * need entities support.
2312 * Returns a pointer to the new node object.
2315 xmlNewDocNode(xmlDocPtr doc, xmlNsPtr ns,
2316 const xmlChar *name, const xmlChar *content) {
2319 if ((doc != NULL) && (doc->dict != NULL))
2320 cur = xmlNewNodeEatName(ns, (xmlChar *)
2321 xmlDictLookup(doc->dict, name, -1));
2323 cur = xmlNewNode(ns, name);
2326 if (content != NULL) {
2327 cur->children = xmlStringGetNodeList(doc, content);
2328 UPDATE_LAST_CHILD_AND_PARENT(cur)
2336 * xmlNewDocNodeEatName:
2337 * @doc: the document
2338 * @ns: namespace if any
2339 * @name: the node name
2340 * @content: the XML text content if any
2342 * Creation of a new node element within a document. @ns and @content
2343 * are optional (NULL).
2344 * NOTE: @content is supposed to be a piece of XML CDATA, so it allow entities
2345 * references, but XML special chars need to be escaped first by using
2346 * xmlEncodeEntitiesReentrant(). Use xmlNewDocRawNode() if you don't
2347 * need entities support.
2349 * Returns a pointer to the new node object.
2352 xmlNewDocNodeEatName(xmlDocPtr doc, xmlNsPtr ns,
2353 xmlChar *name, const xmlChar *content) {
2356 cur = xmlNewNodeEatName(ns, name);
2359 if (content != NULL) {
2360 cur->children = xmlStringGetNodeList(doc, content);
2361 UPDATE_LAST_CHILD_AND_PARENT(cur)
2364 /* if name don't come from the doc dictionary free it here */
2365 if ((name != NULL) && (doc != NULL) &&
2366 (!(xmlDictOwns(doc->dict, name))))
2372 #ifdef LIBXML_TREE_ENABLED
2375 * @doc: the document
2376 * @ns: namespace if any
2377 * @name: the node name
2378 * @content: the text content if any
2380 * Creation of a new node element within a document. @ns and @content
2381 * are optional (NULL).
2383 * Returns a pointer to the new node object.
2386 xmlNewDocRawNode(xmlDocPtr doc, xmlNsPtr ns,
2387 const xmlChar *name, const xmlChar *content) {
2390 cur = xmlNewDocNode(doc, ns, name, NULL);
2393 if (content != NULL) {
2394 cur->children = xmlNewDocText(doc, content);
2395 UPDATE_LAST_CHILD_AND_PARENT(cur)
2402 * xmlNewDocFragment:
2403 * @doc: the document owning the fragment
2405 * Creation of a new Fragment node.
2406 * Returns a pointer to the new node object.
2409 xmlNewDocFragment(xmlDocPtr doc) {
2413 * Allocate a new DocumentFragment node and fill the fields.
2415 cur = (xmlNodePtr) xmlMalloc(sizeof(xmlNode));
2417 xmlTreeErrMemory("building fragment");
2420 memset(cur, 0, sizeof(xmlNode));
2421 cur->type = XML_DOCUMENT_FRAG_NODE;
2425 if ((__xmlRegisterCallbacks) && (xmlRegisterNodeDefaultValue))
2426 xmlRegisterNodeDefaultValue(cur);
2429 #endif /* LIBXML_TREE_ENABLED */
2433 * @content: the text content
2435 * Creation of a new text node.
2436 * Returns a pointer to the new node object.
2439 xmlNewText(const xmlChar *content) {
2443 * Allocate a new node and fill the fields.
2445 cur = (xmlNodePtr) xmlMalloc(sizeof(xmlNode));
2447 xmlTreeErrMemory("building text");
2450 memset(cur, 0, sizeof(xmlNode));
2451 cur->type = XML_TEXT_NODE;
2453 cur->name = xmlStringText;
2454 if (content != NULL) {
2455 cur->content = xmlStrdup(content);
2458 if ((__xmlRegisterCallbacks) && (xmlRegisterNodeDefaultValue))
2459 xmlRegisterNodeDefaultValue(cur);
2463 #ifdef LIBXML_TREE_ENABLED
2466 * @parent: the parent node
2467 * @ns: a namespace if any
2468 * @name: the name of the child
2469 * @content: the text content of the child if any.
2471 * Creation of a new child element, added at the end of @parent children list.
2472 * @ns and @content parameters are optional (NULL). If @ns is NULL, the newly
2473 * created element inherits the namespace of @parent. If @content is non NULL,
2474 * a child TEXT node will be created containing the string @content.
2475 * NOTE: Use xmlNewChild() if @content will contain entities that need to be
2476 * preserved. Use this function, xmlNewTextChild(), if you need to ensure that
2477 * reserved XML chars that might appear in @content, such as the ampersand,
2478 * greater-than or less-than signs, are automatically replaced by their XML
2479 * escaped entity representations.
2481 * Returns a pointer to the new node object.
2484 xmlNewTextChild(xmlNodePtr parent, xmlNsPtr ns,
2485 const xmlChar *name, const xmlChar *content) {
2486 xmlNodePtr cur, prev;
2488 if (parent == NULL) {
2490 xmlGenericError(xmlGenericErrorContext,
2491 "xmlNewTextChild : parent == NULL\n");
2498 xmlGenericError(xmlGenericErrorContext,
2499 "xmlNewTextChild : name == NULL\n");
2505 * Allocate a new node
2507 if (parent->type == XML_ELEMENT_NODE) {
2509 cur = xmlNewDocRawNode(parent->doc, parent->ns, name, content);
2511 cur = xmlNewDocRawNode(parent->doc, ns, name, content);
2512 } else if ((parent->type == XML_DOCUMENT_NODE) ||
2513 (parent->type == XML_HTML_DOCUMENT_NODE)) {
2515 cur = xmlNewDocRawNode((xmlDocPtr) parent, NULL, name, content);
2517 cur = xmlNewDocRawNode((xmlDocPtr) parent, ns, name, content);
2518 } else if (parent->type == XML_DOCUMENT_FRAG_NODE) {
2519 cur = xmlNewDocRawNode( parent->doc, ns, name, content);
2523 if (cur == NULL) return(NULL);
2526 * add the new element at the end of the children list.
2528 cur->type = XML_ELEMENT_NODE;
2529 cur->parent = parent;
2530 cur->doc = parent->doc;
2531 if (parent->children == NULL) {
2532 parent->children = cur;
2535 prev = parent->last;
2543 #endif /* LIBXML_TREE_ENABLED */
2547 * @doc: the document
2548 * @name: the char ref string, starting with # or "&# ... ;"
2550 * Creation of a new character reference node.
2551 * Returns a pointer to the new node object.
2554 xmlNewCharRef(xmlDocPtr doc, const xmlChar *name) {
2561 * Allocate a new node and fill the fields.
2563 cur = (xmlNodePtr) xmlMalloc(sizeof(xmlNode));
2565 xmlTreeErrMemory("building character reference");
2568 memset(cur, 0, sizeof(xmlNode));
2569 cur->type = XML_ENTITY_REF_NODE;
2572 if (name[0] == '&') {
2575 len = xmlStrlen(name);
2576 if (name[len - 1] == ';')
2577 cur->name = xmlStrndup(name, len - 1);
2579 cur->name = xmlStrndup(name, len);
2581 cur->name = xmlStrdup(name);
2583 if ((__xmlRegisterCallbacks) && (xmlRegisterNodeDefaultValue))
2584 xmlRegisterNodeDefaultValue(cur);
2590 * @doc: the document
2591 * @name: the reference name, or the reference string with & and ;
2593 * Creation of a new reference node.
2594 * Returns a pointer to the new node object.
2597 xmlNewReference(const xmlDoc *doc, const xmlChar *name) {
2605 * Allocate a new node and fill the fields.
2607 cur = (xmlNodePtr) xmlMalloc(sizeof(xmlNode));
2609 xmlTreeErrMemory("building reference");
2612 memset(cur, 0, sizeof(xmlNode));
2613 cur->type = XML_ENTITY_REF_NODE;
2615 cur->doc = (xmlDoc *)doc;
2616 if (name[0] == '&') {
2619 len = xmlStrlen(name);
2620 if (name[len - 1] == ';')
2621 cur->name = xmlStrndup(name, len - 1);
2623 cur->name = xmlStrndup(name, len);
2625 cur->name = xmlStrdup(name);
2627 ent = xmlGetDocEntity(doc, cur->name);
2629 cur->content = ent->content;
2631 * The parent pointer in entity is a DTD pointer and thus is NOT
2632 * updated. Not sure if this is 100% correct.
2635 cur->children = (xmlNodePtr) ent;
2636 cur->last = (xmlNodePtr) ent;
2639 if ((__xmlRegisterCallbacks) && (xmlRegisterNodeDefaultValue))
2640 xmlRegisterNodeDefaultValue(cur);
2646 * @doc: the document
2647 * @content: the text content
2649 * Creation of a new text node within a document.
2650 * Returns a pointer to the new node object.
2653 xmlNewDocText(const xmlDoc *doc, const xmlChar *content) {
2656 cur = xmlNewText(content);
2657 if (cur != NULL) cur->doc = (xmlDoc *)doc;
2663 * @content: the text content
2664 * @len: the text len.
2666 * Creation of a new text node with an extra parameter for the content's length
2667 * Returns a pointer to the new node object.
2670 xmlNewTextLen(const xmlChar *content, int len) {
2674 * Allocate a new node and fill the fields.
2676 cur = (xmlNodePtr) xmlMalloc(sizeof(xmlNode));
2678 xmlTreeErrMemory("building text");
2681 memset(cur, 0, sizeof(xmlNode));
2682 cur->type = XML_TEXT_NODE;
2684 cur->name = xmlStringText;
2685 if (content != NULL) {
2686 cur->content = xmlStrndup(content, len);
2689 if ((__xmlRegisterCallbacks) && (xmlRegisterNodeDefaultValue))
2690 xmlRegisterNodeDefaultValue(cur);
2696 * @doc: the document
2697 * @content: the text content
2698 * @len: the text len.
2700 * Creation of a new text node with an extra content length parameter. The
2701 * text node pertain to a given document.
2702 * Returns a pointer to the new node object.
2705 xmlNewDocTextLen(xmlDocPtr doc, const xmlChar *content, int len) {
2708 cur = xmlNewTextLen(content, len);
2709 if (cur != NULL) cur->doc = doc;
2715 * @content: the comment content
2717 * Creation of a new node containing a comment.
2718 * Returns a pointer to the new node object.
2721 xmlNewComment(const xmlChar *content) {
2725 * Allocate a new node and fill the fields.
2727 cur = (xmlNodePtr) xmlMalloc(sizeof(xmlNode));
2729 xmlTreeErrMemory("building comment");
2732 memset(cur, 0, sizeof(xmlNode));
2733 cur->type = XML_COMMENT_NODE;
2735 cur->name = xmlStringComment;
2736 if (content != NULL) {
2737 cur->content = xmlStrdup(content);
2740 if ((__xmlRegisterCallbacks) && (xmlRegisterNodeDefaultValue))
2741 xmlRegisterNodeDefaultValue(cur);
2747 * @doc: the document
2748 * @content: the CDATA block content content
2749 * @len: the length of the block
2751 * Creation of a new node containing a CDATA block.
2752 * Returns a pointer to the new node object.
2755 xmlNewCDataBlock(xmlDocPtr doc, const xmlChar *content, int len) {
2759 * Allocate a new node and fill the fields.
2761 cur = (xmlNodePtr) xmlMalloc(sizeof(xmlNode));
2763 xmlTreeErrMemory("building CDATA");
2766 memset(cur, 0, sizeof(xmlNode));
2767 cur->type = XML_CDATA_SECTION_NODE;
2770 if (content != NULL) {
2771 cur->content = xmlStrndup(content, len);
2774 if ((__xmlRegisterCallbacks) && (xmlRegisterNodeDefaultValue))
2775 xmlRegisterNodeDefaultValue(cur);
2781 * @doc: the document
2782 * @content: the comment content
2784 * Creation of a new node containing a comment within a document.
2785 * Returns a pointer to the new node object.
2788 xmlNewDocComment(xmlDocPtr doc, const xmlChar *content) {
2791 cur = xmlNewComment(content);
2792 if (cur != NULL) cur->doc = doc;
2798 * @tree: the top element
2799 * @doc: the document
2801 * update all nodes under the tree to point to the right document
2804 xmlSetTreeDoc(xmlNodePtr tree, xmlDocPtr doc) {
2807 if ((tree == NULL) || (tree->type == XML_NAMESPACE_DECL))
2809 if (tree->doc != doc) {
2810 if(tree->type == XML_ELEMENT_NODE) {
2811 prop = tree->properties;
2812 while (prop != NULL) {
2813 if (prop->atype == XML_ATTRIBUTE_ID) {
2814 xmlRemoveID(tree->doc, prop);
2818 xmlSetListDoc(prop->children, doc);
2821 * TODO: ID attributes should be also added to the new
2822 * document, but this breaks things like xmlReplaceNode.
2823 * The underlying problem is that xmlRemoveID is only called
2824 * if a node is destroyed, not if it's unlinked.
2827 if (xmlIsID(doc, tree, prop)) {
2828 xmlChar *idVal = xmlNodeListGetString(doc, prop->children,
2830 xmlAddID(NULL, doc, idVal, prop);
2837 if (tree->children != NULL)
2838 xmlSetListDoc(tree->children, doc);
2845 * @list: the first element
2846 * @doc: the document
2848 * update all nodes in the list to point to the right document
2851 xmlSetListDoc(xmlNodePtr list, xmlDocPtr doc) {
2854 if ((list == NULL) || (list->type == XML_NAMESPACE_DECL))
2857 while (cur != NULL) {
2858 if (cur->doc != doc)
2859 xmlSetTreeDoc(cur, doc);
2864 #if defined(LIBXML_TREE_ENABLED) || defined(LIBXML_SCHEMAS_ENABLED)
2867 * @parent: the parent node
2868 * @ns: a namespace if any
2869 * @name: the name of the child
2870 * @content: the XML content of the child if any.
2872 * Creation of a new child element, added at the end of @parent children list.
2873 * @ns and @content parameters are optional (NULL). If @ns is NULL, the newly
2874 * created element inherits the namespace of @parent. If @content is non NULL,
2875 * a child list containing the TEXTs and ENTITY_REFs node will be created.
2876 * NOTE: @content is supposed to be a piece of XML CDATA, so it allows entity
2877 * references. XML special chars must be escaped first by using
2878 * xmlEncodeEntitiesReentrant(), or xmlNewTextChild() should be used.
2880 * Returns a pointer to the new node object.
2883 xmlNewChild(xmlNodePtr parent, xmlNsPtr ns,
2884 const xmlChar *name, const xmlChar *content) {
2885 xmlNodePtr cur, prev;
2887 if (parent == NULL) {
2889 xmlGenericError(xmlGenericErrorContext,
2890 "xmlNewChild : parent == NULL\n");
2897 xmlGenericError(xmlGenericErrorContext,
2898 "xmlNewChild : name == NULL\n");
2904 * Allocate a new node
2906 if (parent->type == XML_ELEMENT_NODE) {
2908 cur = xmlNewDocNode(parent->doc, parent->ns, name, content);
2910 cur = xmlNewDocNode(parent->doc, ns, name, content);
2911 } else if ((parent->type == XML_DOCUMENT_NODE) ||
2912 (parent->type == XML_HTML_DOCUMENT_NODE)) {
2914 cur = xmlNewDocNode((xmlDocPtr) parent, NULL, name, content);
2916 cur = xmlNewDocNode((xmlDocPtr) parent, ns, name, content);
2917 } else if (parent->type == XML_DOCUMENT_FRAG_NODE) {
2918 cur = xmlNewDocNode( parent->doc, ns, name, content);
2922 if (cur == NULL) return(NULL);
2925 * add the new element at the end of the children list.
2927 cur->type = XML_ELEMENT_NODE;
2928 cur->parent = parent;
2929 cur->doc = parent->doc;
2930 if (parent->children == NULL) {
2931 parent->children = cur;
2934 prev = parent->last;
2942 #endif /* LIBXML_TREE_ENABLED */
2945 * xmlAddPropSibling:
2946 * @prev: the attribute to which @prop is added after
2947 * @cur: the base attribute passed to calling function
2948 * @prop: the new attribute
2950 * Add a new attribute after @prev using @cur as base attribute.
2951 * When inserting before @cur, @prev is passed as @cur->prev.
2952 * When inserting after @cur, @prev is passed as @cur.
2953 * If an existing attribute is found it is detroyed prior to adding @prop.
2955 * Returns the attribute being inserted or NULL in case of error.
2958 xmlAddPropSibling(xmlNodePtr prev, xmlNodePtr cur, xmlNodePtr prop) {
2961 if ((cur == NULL) || (cur->type != XML_ATTRIBUTE_NODE) ||
2962 (prop == NULL) || (prop->type != XML_ATTRIBUTE_NODE) ||
2963 ((prev != NULL) && (prev->type != XML_ATTRIBUTE_NODE)))
2966 /* check if an attribute with the same name exists */
2967 if (prop->ns == NULL)
2968 attr = xmlHasNsProp(cur->parent, prop->name, NULL);
2970 attr = xmlHasNsProp(cur->parent, prop->name, prop->ns->href);
2972 if (prop->doc != cur->doc) {
2973 xmlSetTreeDoc(prop, cur->doc);
2975 prop->parent = cur->parent;
2978 prop->next = prev->next;
2981 prop->next->prev = prop;
2986 if (prop->prev == NULL && prop->parent != NULL)
2987 prop->parent->properties = (xmlAttrPtr) prop;
2988 if ((attr != NULL) && (attr->type != XML_ATTRIBUTE_DECL)) {
2989 /* different instance, destroy it (attributes must be unique) */
2990 xmlRemoveProp((xmlAttrPtr) attr);
2996 * xmlAddNextSibling:
2997 * @cur: the child node
2998 * @elem: the new node
3000 * Add a new node @elem as the next sibling of @cur
3001 * If the new node was already inserted in a document it is
3002 * first unlinked from its existing context.
3003 * As a result of text merging @elem may be freed.
3004 * If the new node is ATTRIBUTE, it is added into properties instead of children.
3005 * If there is an attribute with equal name, it is first destroyed.
3007 * Returns the new node or NULL in case of error.
3010 xmlAddNextSibling(xmlNodePtr cur, xmlNodePtr elem) {
3011 if ((cur == NULL) || (cur->type == XML_NAMESPACE_DECL)) {
3013 xmlGenericError(xmlGenericErrorContext,
3014 "xmlAddNextSibling : cur == NULL\n");
3018 if ((elem == NULL) || (elem->type == XML_NAMESPACE_DECL)) {
3020 xmlGenericError(xmlGenericErrorContext,
3021 "xmlAddNextSibling : elem == NULL\n");
3028 xmlGenericError(xmlGenericErrorContext,
3029 "xmlAddNextSibling : cur == elem\n");
3034 xmlUnlinkNode(elem);
3036 if (elem->type == XML_TEXT_NODE) {
3037 if (cur->type == XML_TEXT_NODE) {
3038 xmlNodeAddContent(cur, elem->content);
3042 if ((cur->next != NULL) && (cur->next->type == XML_TEXT_NODE) &&
3043 (cur->name == cur->next->name)) {
3046 tmp = xmlStrdup(elem->content);
3047 tmp = xmlStrcat(tmp, cur->next->content);
3048 xmlNodeSetContent(cur->next, tmp);
3053 } else if (elem->type == XML_ATTRIBUTE_NODE) {
3054 return xmlAddPropSibling(cur, cur, elem);
3057 if (elem->doc != cur->doc) {
3058 xmlSetTreeDoc(elem, cur->doc);
3060 elem->parent = cur->parent;
3062 elem->next = cur->next;
3064 if (elem->next != NULL)
3065 elem->next->prev = elem;
3066 if ((elem->parent != NULL) && (elem->parent->last == cur))
3067 elem->parent->last = elem;
3071 #if defined(LIBXML_TREE_ENABLED) || defined(LIBXML_HTML_ENABLED) || \
3072 defined(LIBXML_SCHEMAS_ENABLED) || defined(LIBXML_XINCLUDE_ENABLED)
3074 * xmlAddPrevSibling:
3075 * @cur: the child node
3076 * @elem: the new node
3078 * Add a new node @elem as the previous sibling of @cur
3079 * merging adjacent TEXT nodes (@elem may be freed)
3080 * If the new node was already inserted in a document it is
3081 * first unlinked from its existing context.
3082 * If the new node is ATTRIBUTE, it is added into properties instead of children.
3083 * If there is an attribute with equal name, it is first destroyed.
3085 * Returns the new node or NULL in case of error.
3088 xmlAddPrevSibling(xmlNodePtr cur, xmlNodePtr elem) {
3089 if ((cur == NULL) || (cur->type == XML_NAMESPACE_DECL)) {
3091 xmlGenericError(xmlGenericErrorContext,
3092 "xmlAddPrevSibling : cur == NULL\n");
3096 if ((elem == NULL) || (elem->type == XML_NAMESPACE_DECL)) {
3098 xmlGenericError(xmlGenericErrorContext,
3099 "xmlAddPrevSibling : elem == NULL\n");
3106 xmlGenericError(xmlGenericErrorContext,
3107 "xmlAddPrevSibling : cur == elem\n");
3112 xmlUnlinkNode(elem);
3114 if (elem->type == XML_TEXT_NODE) {
3115 if (cur->type == XML_TEXT_NODE) {
3118 tmp = xmlStrdup(elem->content);
3119 tmp = xmlStrcat(tmp, cur->content);
3120 xmlNodeSetContent(cur, tmp);
3125 if ((cur->prev != NULL) && (cur->prev->type == XML_TEXT_NODE) &&
3126 (cur->name == cur->prev->name)) {
3127 xmlNodeAddContent(cur->prev, elem->content);
3131 } else if (elem->type == XML_ATTRIBUTE_NODE) {
3132 return xmlAddPropSibling(cur->prev, cur, elem);
3135 if (elem->doc != cur->doc) {
3136 xmlSetTreeDoc(elem, cur->doc);
3138 elem->parent = cur->parent;
3140 elem->prev = cur->prev;
3142 if (elem->prev != NULL)
3143 elem->prev->next = elem;
3144 if ((elem->parent != NULL) && (elem->parent->children == cur)) {
3145 elem->parent->children = elem;
3149 #endif /* LIBXML_TREE_ENABLED */
3153 * @cur: the child node
3154 * @elem: the new node
3156 * Add a new element @elem to the list of siblings of @cur
3157 * merging adjacent TEXT nodes (@elem may be freed)
3158 * If the new element was already inserted in a document it is
3159 * first unlinked from its existing context.
3161 * Returns the new element or NULL in case of error.
3164 xmlAddSibling(xmlNodePtr cur, xmlNodePtr elem) {
3167 if ((cur == NULL) || (cur->type == XML_NAMESPACE_DECL)) {
3169 xmlGenericError(xmlGenericErrorContext,
3170 "xmlAddSibling : cur == NULL\n");
3175 if ((elem == NULL) || (elem->type == XML_NAMESPACE_DECL)) {
3177 xmlGenericError(xmlGenericErrorContext,
3178 "xmlAddSibling : elem == NULL\n");
3185 xmlGenericError(xmlGenericErrorContext,
3186 "xmlAddSibling : cur == elem\n");
3192 * Constant time is we can rely on the ->parent->last to find
3195 if ((cur->type != XML_ATTRIBUTE_NODE) && (cur->parent != NULL) &&
3196 (cur->parent->children != NULL) &&
3197 (cur->parent->last != NULL) &&
3198 (cur->parent->last->next == NULL)) {
3199 cur = cur->parent->last;
3201 while (cur->next != NULL) cur = cur->next;
3204 xmlUnlinkNode(elem);
3206 if ((cur->type == XML_TEXT_NODE) && (elem->type == XML_TEXT_NODE) &&
3207 (cur->name == elem->name)) {
3208 xmlNodeAddContent(cur, elem->content);
3211 } else if (elem->type == XML_ATTRIBUTE_NODE) {
3212 return xmlAddPropSibling(cur, cur, elem);
3215 if (elem->doc != cur->doc) {
3216 xmlSetTreeDoc(elem, cur->doc);
3218 parent = cur->parent;
3221 elem->parent = parent;
3224 parent->last = elem;
3231 * @parent: the parent node
3232 * @cur: the first node in the list
3234 * Add a list of node at the end of the child list of the parent
3235 * merging adjacent TEXT nodes (@cur may be freed)
3237 * Returns the last child or NULL in case of error.
3240 xmlAddChildList(xmlNodePtr parent, xmlNodePtr cur) {
3243 if ((parent == NULL) || (parent->type == XML_NAMESPACE_DECL)) {
3245 xmlGenericError(xmlGenericErrorContext,
3246 "xmlAddChildList : parent == NULL\n");
3251 if ((cur == NULL) || (cur->type == XML_NAMESPACE_DECL)) {
3253 xmlGenericError(xmlGenericErrorContext,
3254 "xmlAddChildList : child == NULL\n");
3259 if ((cur->doc != NULL) && (parent->doc != NULL) &&
3260 (cur->doc != parent->doc)) {
3262 xmlGenericError(xmlGenericErrorContext,
3263 "Elements moved to a different document\n");
3268 * add the first element at the end of the children list.
3271 if (parent->children == NULL) {
3272 parent->children = cur;
3275 * If cur and parent->last both are TEXT nodes, then merge them.
3277 if ((cur->type == XML_TEXT_NODE) &&
3278 (parent->last->type == XML_TEXT_NODE) &&
3279 (cur->name == parent->last->name)) {
3280 xmlNodeAddContent(parent->last, cur->content);
3282 * if it's the only child, nothing more to be done.
3284 if (cur->next == NULL) {
3286 return(parent->last);
3292 prev = parent->last;
3296 while (cur->next != NULL) {
3297 cur->parent = parent;
3298 if (cur->doc != parent->doc) {
3299 xmlSetTreeDoc(cur, parent->doc);
3303 cur->parent = parent;
3304 /* the parent may not be linked to a doc ! */
3305 if (cur->doc != parent->doc) {
3306 xmlSetTreeDoc(cur, parent->doc);
3315 * @parent: the parent node
3316 * @cur: the child node
3318 * Add a new node to @parent, at the end of the child (or property) list
3319 * merging adjacent TEXT nodes (in which case @cur is freed)
3320 * If the new node is ATTRIBUTE, it is added into properties instead of children.
3321 * If there is an attribute with equal name, it is first destroyed.
3323 * Returns the child or NULL in case of error.
3326 xmlAddChild(xmlNodePtr parent, xmlNodePtr cur) {
3329 if ((parent == NULL) || (parent->type == XML_NAMESPACE_DECL)) {
3331 xmlGenericError(xmlGenericErrorContext,
3332 "xmlAddChild : parent == NULL\n");
3337 if ((cur == NULL) || (cur->type == XML_NAMESPACE_DECL)) {
3339 xmlGenericError(xmlGenericErrorContext,
3340 "xmlAddChild : child == NULL\n");
3345 if (parent == cur) {
3347 xmlGenericError(xmlGenericErrorContext,
3348 "xmlAddChild : parent == cur\n");
3353 * If cur is a TEXT node, merge its content with adjacent TEXT nodes
3354 * cur is then freed.
3356 if (cur->type == XML_TEXT_NODE) {
3357 if ((parent->type == XML_TEXT_NODE) &&
3358 (parent->content != NULL) &&
3359 (parent->name == cur->name)) {
3360 xmlNodeAddContent(parent, cur->content);
3364 if ((parent->last != NULL) && (parent->last->type == XML_TEXT_NODE) &&
3365 (parent->last->name == cur->name) &&
3366 (parent->last != cur)) {
3367 xmlNodeAddContent(parent->last, cur->content);
3369 return(parent->last);
3374 * add the new element at the end of the children list.
3377 cur->parent = parent;
3378 if (cur->doc != parent->doc) {
3379 xmlSetTreeDoc(cur, parent->doc);
3381 /* this check prevents a loop on tree-traversions if a developer
3382 * tries to add a node to its parent multiple times
3390 if ((parent->type == XML_TEXT_NODE) &&
3391 (parent->content != NULL) &&
3393 xmlNodeAddContent(parent, cur->content);
3397 if (cur->type == XML_ATTRIBUTE_NODE) {
3398 if (parent->type != XML_ELEMENT_NODE)
3400 if (parent->properties != NULL) {
3401 /* check if an attribute with the same name exists */
3402 xmlAttrPtr lastattr;
3404 if (cur->ns == NULL)
3405 lastattr = xmlHasNsProp(parent, cur->name, NULL);
3407 lastattr = xmlHasNsProp(parent, cur->name, cur->ns->href);
3408 if ((lastattr != NULL) && (lastattr != (xmlAttrPtr) cur) && (lastattr->type != XML_ATTRIBUTE_DECL)) {
3409 /* different instance, destroy it (attributes must be unique) */
3410 xmlUnlinkNode((xmlNodePtr) lastattr);
3411 xmlFreeProp(lastattr);
3413 if (lastattr == (xmlAttrPtr) cur)
3417 if (parent->properties == NULL) {
3418 parent->properties = (xmlAttrPtr) cur;
3421 xmlAttrPtr lastattr = parent->properties;
3422 while (lastattr->next != NULL) {
3423 lastattr = lastattr->next;
3425 lastattr->next = (xmlAttrPtr) cur;
3426 ((xmlAttrPtr) cur)->prev = lastattr;
3429 if (parent->children == NULL) {
3430 parent->children = cur;
3433 prev = parent->last;
3444 * @parent: the parent node
3446 * Search the last child of a node.
3447 * Returns the last child or NULL if none.
3450 xmlGetLastChild(const xmlNode *parent) {
3451 if ((parent == NULL) || (parent->type == XML_NAMESPACE_DECL)) {
3453 xmlGenericError(xmlGenericErrorContext,
3454 "xmlGetLastChild : parent == NULL\n");
3458 return(parent->last);
3461 #ifdef LIBXML_TREE_ENABLED
3463 * 5 interfaces from DOM ElementTraversal
3467 * xmlChildElementCount:
3468 * @parent: the parent node
3470 * Finds the current number of child nodes of that element which are
3472 * Note the handling of entities references is different than in
3473 * the W3C DOM element traversal spec since we don't have back reference
3474 * from entities content to entities references.
3476 * Returns the count of element child or 0 if not available
3479 xmlChildElementCount(xmlNodePtr parent) {
3480 unsigned long ret = 0;
3481 xmlNodePtr cur = NULL;
3485 switch (parent->type) {
3486 case XML_ELEMENT_NODE:
3487 case XML_ENTITY_NODE:
3488 case XML_DOCUMENT_NODE:
3489 case XML_DOCUMENT_FRAG_NODE:
3490 case XML_HTML_DOCUMENT_NODE:
3491 cur = parent->children;
3496 while (cur != NULL) {
3497 if (cur->type == XML_ELEMENT_NODE)
3505 * xmlFirstElementChild:
3506 * @parent: the parent node
3508 * Finds the first child node of that element which is a Element node
3509 * Note the handling of entities references is different than in
3510 * the W3C DOM element traversal spec since we don't have back reference
3511 * from entities content to entities references.
3513 * Returns the first element child or NULL if not available
3516 xmlFirstElementChild(xmlNodePtr parent) {
3517 xmlNodePtr cur = NULL;
3521 switch (parent->type) {
3522 case XML_ELEMENT_NODE:
3523 case XML_ENTITY_NODE:
3524 case XML_DOCUMENT_NODE:
3525 case XML_DOCUMENT_FRAG_NODE:
3526 case XML_HTML_DOCUMENT_NODE:
3527 cur = parent->children;
3532 while (cur != NULL) {
3533 if (cur->type == XML_ELEMENT_NODE)
3541 * xmlLastElementChild:
3542 * @parent: the parent node
3544 * Finds the last child node of that element which is a Element node
3545 * Note the handling of entities references is different than in
3546 * the W3C DOM element traversal spec since we don't have back reference
3547 * from entities content to entities references.
3549 * Returns the last element child or NULL if not available
3552 xmlLastElementChild(xmlNodePtr parent) {
3553 xmlNodePtr cur = NULL;
3557 switch (parent->type) {
3558 case XML_ELEMENT_NODE:
3559 case XML_ENTITY_NODE:
3560 case XML_DOCUMENT_NODE:
3561 case XML_DOCUMENT_FRAG_NODE:
3562 case XML_HTML_DOCUMENT_NODE:
3568 while (cur != NULL) {
3569 if (cur->type == XML_ELEMENT_NODE)
3577 * xmlPreviousElementSibling:
3578 * @node: the current node
3580 * Finds the first closest previous sibling of the node which is an
3582 * Note the handling of entities references is different than in
3583 * the W3C DOM element traversal spec since we don't have back reference
3584 * from entities content to entities references.
3586 * Returns the previous element sibling or NULL if not available
3589 xmlPreviousElementSibling(xmlNodePtr node) {
3592 switch (node->type) {
3593 case XML_ELEMENT_NODE:
3595 case XML_CDATA_SECTION_NODE:
3596 case XML_ENTITY_REF_NODE:
3597 case XML_ENTITY_NODE:
3599 case XML_COMMENT_NODE:
3600 case XML_XINCLUDE_START:
3601 case XML_XINCLUDE_END:
3607 while (node != NULL) {
3608 if (node->type == XML_ELEMENT_NODE)
3616 * xmlNextElementSibling:
3617 * @node: the current node
3619 * Finds the first closest next sibling of the node which is an
3621 * Note the handling of entities references is different than in
3622 * the W3C DOM element traversal spec since we don't have back reference
3623 * from entities content to entities references.
3625 * Returns the next element sibling or NULL if not available
3628 xmlNextElementSibling(xmlNodePtr node) {
3631 switch (node->type) {
3632 case XML_ELEMENT_NODE:
3634 case XML_CDATA_SECTION_NODE:
3635 case XML_ENTITY_REF_NODE:
3636 case XML_ENTITY_NODE:
3638 case XML_COMMENT_NODE:
3640 case XML_XINCLUDE_START:
3641 case XML_XINCLUDE_END:
3647 while (node != NULL) {
3648 if (node->type == XML_ELEMENT_NODE)
3655 #endif /* LIBXML_TREE_ENABLED */
3659 * @cur: the first node in the list
3661 * Free a node and all its siblings, this is a recursive behaviour, all
3662 * the children are freed too.
3665 xmlFreeNodeList(xmlNodePtr cur) {
3667 xmlDictPtr dict = NULL;
3669 if (cur == NULL) return;
3670 if (cur->type == XML_NAMESPACE_DECL) {
3671 xmlFreeNsList((xmlNsPtr) cur);
3674 if ((cur->type == XML_DOCUMENT_NODE) ||
3675 #ifdef LIBXML_DOCB_ENABLED
3676 (cur->type == XML_DOCB_DOCUMENT_NODE) ||
3678 (cur->type == XML_HTML_DOCUMENT_NODE)) {
3679 xmlFreeDoc((xmlDocPtr) cur);
3682 if (cur->doc != NULL) dict = cur->doc->dict;
3683 while (cur != NULL) {
3685 if (cur->type != XML_DTD_NODE) {
3687 if ((__xmlRegisterCallbacks) && (xmlDeregisterNodeDefaultValue))
3688 xmlDeregisterNodeDefaultValue(cur);
3690 if ((cur->children != NULL) &&
3691 (cur->type != XML_ENTITY_REF_NODE))
3692 xmlFreeNodeList(cur->children);
3693 if (((cur->type == XML_ELEMENT_NODE) ||
3694 (cur->type == XML_XINCLUDE_START) ||
3695 (cur->type == XML_XINCLUDE_END)) &&
3696 (cur->properties != NULL))
3697 xmlFreePropList(cur->properties);
3698 if ((cur->type != XML_ELEMENT_NODE) &&
3699 (cur->type != XML_XINCLUDE_START) &&
3700 (cur->type != XML_XINCLUDE_END) &&
3701 (cur->type != XML_ENTITY_REF_NODE) &&
3702 (cur->content != (xmlChar *) &(cur->properties))) {
3703 DICT_FREE(cur->content)
3705 if (((cur->type == XML_ELEMENT_NODE) ||
3706 (cur->type == XML_XINCLUDE_START) ||
3707 (cur->type == XML_XINCLUDE_END)) &&
3708 (cur->nsDef != NULL))
3709 xmlFreeNsList(cur->nsDef);
3712 * When a node is a text node or a comment, it uses a global static
3713 * variable for the name of the node.
3714 * Otherwise the node name might come from the document's
3717 if ((cur->name != NULL) &&
3718 (cur->type != XML_TEXT_NODE) &&
3719 (cur->type != XML_COMMENT_NODE))
3720 DICT_FREE(cur->name)
3731 * Free a node, this is a recursive behaviour, all the children are freed too.
3732 * This doesn't unlink the child from the list, use xmlUnlinkNode() first.
3735 xmlFreeNode(xmlNodePtr cur) {
3736 xmlDictPtr dict = NULL;
3738 if (cur == NULL) return;
3740 /* use xmlFreeDtd for DTD nodes */
3741 if (cur->type == XML_DTD_NODE) {
3742 xmlFreeDtd((xmlDtdPtr) cur);
3745 if (cur->type == XML_NAMESPACE_DECL) {
3746 xmlFreeNs((xmlNsPtr) cur);
3749 if (cur->type == XML_ATTRIBUTE_NODE) {
3750 xmlFreeProp((xmlAttrPtr) cur);
3754 if ((__xmlRegisterCallbacks) && (xmlDeregisterNodeDefaultValue))
3755 xmlDeregisterNodeDefaultValue(cur);
3757 if (cur->doc != NULL) dict = cur->doc->dict;
3759 if (cur->type == XML_ENTITY_DECL) {
3760 xmlEntityPtr ent = (xmlEntityPtr) cur;
3761 DICT_FREE(ent->SystemID);
3762 DICT_FREE(ent->ExternalID);
3764 if ((cur->children != NULL) &&
3765 (cur->type != XML_ENTITY_REF_NODE))
3766 xmlFreeNodeList(cur->children);
3767 if (((cur->type == XML_ELEMENT_NODE) ||
3768 (cur->type == XML_XINCLUDE_START) ||
3769 (cur->type == XML_XINCLUDE_END)) &&
3770 (cur->properties != NULL))
3771 xmlFreePropList(cur->properties);
3772 if ((cur->type != XML_ELEMENT_NODE) &&
3773 (cur->content != NULL) &&
3774 (cur->type != XML_ENTITY_REF_NODE) &&
3775 (cur->type != XML_XINCLUDE_END) &&
3776 (cur->type != XML_XINCLUDE_START) &&
3777 (cur->content != (xmlChar *) &(cur->properties))) {
3778 DICT_FREE(cur->content)
3782 * When a node is a text node or a comment, it uses a global static
3783 * variable for the name of the node.
3784 * Otherwise the node name might come from the document's dictionary
3786 if ((cur->name != NULL) &&
3787 (cur->type != XML_TEXT_NODE) &&
3788 (cur->type != XML_COMMENT_NODE))
3789 DICT_FREE(cur->name)
3791 if (((cur->type == XML_ELEMENT_NODE) ||
3792 (cur->type == XML_XINCLUDE_START) ||
3793 (cur->type == XML_XINCLUDE_END)) &&
3794 (cur->nsDef != NULL))
3795 xmlFreeNsList(cur->nsDef);
3803 * Unlink a node from it's current context, the node is not freed
3804 * If one need to free the node, use xmlFreeNode() routine after the
3805 * unlink to discard it.
3806 * Note that namespace nodes can't be unlinked as they do not have
3807 * pointer to their parent.
3810 xmlUnlinkNode(xmlNodePtr cur) {
3813 xmlGenericError(xmlGenericErrorContext,
3814 "xmlUnlinkNode : node == NULL\n");
3818 if (cur->type == XML_NAMESPACE_DECL)
3820 if (cur->type == XML_DTD_NODE) {
3824 if (doc->intSubset == (xmlDtdPtr) cur)
3825 doc->intSubset = NULL;
3826 if (doc->extSubset == (xmlDtdPtr) cur)
3827 doc->extSubset = NULL;
3830 if (cur->type == XML_ENTITY_DECL) {
3834 if (doc->intSubset != NULL) {
3835 if (xmlHashLookup(doc->intSubset->entities, cur->name) == cur)
3836 xmlHashRemoveEntry(doc->intSubset->entities, cur->name,
3838 if (xmlHashLookup(doc->intSubset->pentities, cur->name) == cur)
3839 xmlHashRemoveEntry(doc->intSubset->pentities, cur->name,
3842 if (doc->extSubset != NULL) {
3843 if (xmlHashLookup(doc->extSubset->entities, cur->name) == cur)
3844 xmlHashRemoveEntry(doc->extSubset->entities, cur->name,
3846 if (xmlHashLookup(doc->extSubset->pentities, cur->name) == cur)
3847 xmlHashRemoveEntry(doc->extSubset->pentities, cur->name,
3852 if (cur->parent != NULL) {
3854 parent = cur->parent;
3855 if (cur->type == XML_ATTRIBUTE_NODE) {
3856 if (parent->properties == (xmlAttrPtr) cur)
3857 parent->properties = ((xmlAttrPtr) cur)->next;
3859 if (parent->children == cur)
3860 parent->children = cur->next;
3861 if (parent->last == cur)
3862 parent->last = cur->prev;
3866 if (cur->next != NULL)
3867 cur->next->prev = cur->prev;
3868 if (cur->prev != NULL)
3869 cur->prev->next = cur->next;
3870 cur->next = cur->prev = NULL;
3873 #if defined(LIBXML_TREE_ENABLED) || defined(LIBXML_WRITER_ENABLED)
3876 * @old: the old node
3879 * Unlink the old node from its current context, prune the new one
3880 * at the same place. If @cur was already inserted in a document it is
3881 * first unlinked from its existing context.
3883 * Returns the @old node
3886 xmlReplaceNode(xmlNodePtr old, xmlNodePtr cur) {
3887 if (old == cur) return(NULL);
3888 if ((old == NULL) || (old->type == XML_NAMESPACE_DECL) ||
3889 (old->parent == NULL)) {
3891 xmlGenericError(xmlGenericErrorContext,
3892 "xmlReplaceNode : old == NULL or without parent\n");
3896 if ((cur == NULL) || (cur->type == XML_NAMESPACE_DECL)) {
3903 if ((old->type==XML_ATTRIBUTE_NODE) && (cur->type!=XML_ATTRIBUTE_NODE)) {
3905 xmlGenericError(xmlGenericErrorContext,
3906 "xmlReplaceNode : Trying to replace attribute node with other node type\n");
3910 if ((cur->type==XML_ATTRIBUTE_NODE) && (old->type!=XML_ATTRIBUTE_NODE)) {
3912 xmlGenericError(xmlGenericErrorContext,
3913 "xmlReplaceNode : Trying to replace a non-attribute node with attribute node\n");
3918 xmlSetTreeDoc(cur, old->doc);
3919 cur->parent = old->parent;
3920 cur->next = old->next;
3921 if (cur->next != NULL)
3922 cur->next->prev = cur;
3923 cur->prev = old->prev;
3924 if (cur->prev != NULL)
3925 cur->prev->next = cur;
3926 if (cur->parent != NULL) {
3927 if (cur->type == XML_ATTRIBUTE_NODE) {
3928 if (cur->parent->properties == (xmlAttrPtr)old)
3929 cur->parent->properties = ((xmlAttrPtr) cur);
3931 if (cur->parent->children == old)
3932 cur->parent->children = cur;
3933 if (cur->parent->last == old)
3934 cur->parent->last = cur;
3937 old->next = old->prev = NULL;
3941 #endif /* LIBXML_TREE_ENABLED */
3943 /************************************************************************
3947 ************************************************************************/
3951 * @cur: the namespace
3953 * Do a copy of the namespace.
3955 * Returns: a new #xmlNsPtr, or NULL in case of error.
3958 xmlCopyNamespace(xmlNsPtr cur) {
3961 if (cur == NULL) return(NULL);
3962 switch (cur->type) {
3963 case XML_LOCAL_NAMESPACE:
3964 ret = xmlNewNs(NULL, cur->href, cur->prefix);
3968 xmlGenericError(xmlGenericErrorContext,
3969 "xmlCopyNamespace: invalid type %d\n", cur->type);
3977 * xmlCopyNamespaceList:
3978 * @cur: the first namespace
3980 * Do a copy of an namespace list.
3982 * Returns: a new #xmlNsPtr, or NULL in case of error.
3985 xmlCopyNamespaceList(xmlNsPtr cur) {
3986 xmlNsPtr ret = NULL;
3987 xmlNsPtr p = NULL,q;
3989 while (cur != NULL) {
3990 q = xmlCopyNamespace(cur);
4003 xmlStaticCopyNodeList(xmlNodePtr node, xmlDocPtr doc, xmlNodePtr parent);
4006 xmlCopyPropInternal(xmlDocPtr doc, xmlNodePtr target, xmlAttrPtr cur) {
4009 if (cur == NULL) return(NULL);
4010 if ((target != NULL) && (target->type != XML_ELEMENT_NODE))
4013 ret = xmlNewDocProp(target->doc, cur->name, NULL);
4014 else if (doc != NULL)
4015 ret = xmlNewDocProp(doc, cur->name, NULL);
4016 else if (cur->parent != NULL)
4017 ret = xmlNewDocProp(cur->parent->doc, cur->name, NULL);
4018 else if (cur->children != NULL)
4019 ret = xmlNewDocProp(cur->children->doc, cur->name, NULL);
4021 ret = xmlNewDocProp(NULL, cur->name, NULL);
4022 if (ret == NULL) return(NULL);
4023 ret->parent = target;
4025 if ((cur->ns != NULL) && (target != NULL)) {
4028 ns = xmlSearchNs(target->doc, target, cur->ns->prefix);
4031 * Humm, we are copying an element whose namespace is defined
4032 * out of the new tree scope. Search it in the original tree
4033 * and add it at the top of the new tree
4035 ns = xmlSearchNs(cur->doc, cur->parent, cur->ns->prefix);
4037 xmlNodePtr root = target;
4038 xmlNodePtr pred = NULL;
4040 while (root->parent != NULL) {
4042 root = root->parent;
4044 if (root == (xmlNodePtr) target->doc) {
4045 /* correct possibly cycling above the document elt */
4048 ret->ns = xmlNewNs(root, ns->href, ns->prefix);
4052 * we have to find something appropriate here since
4053 * we cant be sure, that the namespce we found is identified
4056 if (xmlStrEqual(ns->href, cur->ns->href)) {
4057 /* this is the nice case */
4061 * we are in trouble: we need a new reconcilied namespace.
4064 ret->ns = xmlNewReconciliedNs(target->doc, target, cur->ns);
4071 if (cur->children != NULL) {
4074 ret->children = xmlStaticCopyNodeList(cur->children, ret->doc, (xmlNodePtr) ret);
4076 tmp = ret->children;
4077 while (tmp != NULL) {
4078 /* tmp->parent = (xmlNodePtr)ret; */
4079 if (tmp->next == NULL)
4087 if ((target!= NULL) && (cur!= NULL) &&
4088 (target->doc != NULL) && (cur->doc != NULL) &&
4089 (cur->doc->ids != NULL) && (cur->parent != NULL)) {
4090 if (xmlIsID(cur->doc, cur->parent, cur)) {
4093 id = xmlNodeListGetString(cur->doc, cur->children, 1);
4095 xmlAddID(NULL, target->doc, id, ret);
4105 * @target: the element where the attribute will be grafted
4106 * @cur: the attribute
4108 * Do a copy of the attribute.
4110 * Returns: a new #xmlAttrPtr, or NULL in case of error.
4113 xmlCopyProp(xmlNodePtr target, xmlAttrPtr cur) {
4114 return xmlCopyPropInternal(NULL, target, cur);
4119 * @target: the element where the attributes will be grafted
4120 * @cur: the first attribute
4122 * Do a copy of an attribute list.
4124 * Returns: a new #xmlAttrPtr, or NULL in case of error.
4127 xmlCopyPropList(xmlNodePtr target, xmlAttrPtr cur) {
4128 xmlAttrPtr ret = NULL;
4129 xmlAttrPtr p = NULL,q;
4131 if ((target != NULL) && (target->type != XML_ELEMENT_NODE))
4133 while (cur != NULL) {
4134 q = xmlCopyProp(target, cur);
4150 * NOTE about the CopyNode operations !
4152 * They are split into external and internal parts for one
4153 * tricky reason: namespaces. Doing a direct copy of a node
4154 * say RPM:Copyright without changing the namespace pointer to
4155 * something else can produce stale links. One way to do it is
4156 * to keep a reference counter but this doesn't work as soon
4157 * as one move the element or the subtree out of the scope of
4158 * the existing namespace. The actual solution seems to add
4159 * a copy of the namespace at the top of the copied tree if
4160 * not available in the subtree.
4161 * Hence two functions, the public front-end call the inner ones
4162 * The argument "recursive" normally indicates a recursive copy
4163 * of the node with values 0 (no) and 1 (yes). For XInclude,
4164 * however, we allow a value of 2 to indicate copy properties and
4165 * namespace info, but don't recurse on children.
4169 xmlStaticCopyNode(xmlNodePtr node, xmlDocPtr doc, xmlNodePtr parent,
4173 if (node == NULL) return(NULL);
4174 switch (node->type) {
4176 case XML_CDATA_SECTION_NODE:
4177 case XML_ELEMENT_NODE:
4178 case XML_DOCUMENT_FRAG_NODE:
4179 case XML_ENTITY_REF_NODE:
4180 case XML_ENTITY_NODE:
4182 case XML_COMMENT_NODE:
4183 case XML_XINCLUDE_START:
4184 case XML_XINCLUDE_END:
4186 case XML_ATTRIBUTE_NODE:
4187 return((xmlNodePtr) xmlCopyPropInternal(doc, parent, (xmlAttrPtr) node));
4188 case XML_NAMESPACE_DECL:
4189 return((xmlNodePtr) xmlCopyNamespaceList((xmlNsPtr) node));
4191 case XML_DOCUMENT_NODE:
4192 case XML_HTML_DOCUMENT_NODE:
4193 #ifdef LIBXML_DOCB_ENABLED
4194 case XML_DOCB_DOCUMENT_NODE:
4196 #ifdef LIBXML_TREE_ENABLED
4197 return((xmlNodePtr) xmlCopyDoc((xmlDocPtr) node, extended));
4198 #endif /* LIBXML_TREE_ENABLED */
4199 case XML_DOCUMENT_TYPE_NODE:
4200 case XML_NOTATION_NODE:
4202 case XML_ELEMENT_DECL:
4203 case XML_ATTRIBUTE_DECL:
4204 case XML_ENTITY_DECL:
4209 * Allocate a new node and fill the fields.
4211 ret = (xmlNodePtr) xmlMalloc(sizeof(xmlNode));
4213 xmlTreeErrMemory("copying node");
4216 memset(ret, 0, sizeof(xmlNode));
4217 ret->type = node->type;
4220 ret->parent = parent;
4221 if (node->name == xmlStringText)
4222 ret->name = xmlStringText;
4223 else if (node->name == xmlStringTextNoenc)
4224 ret->name = xmlStringTextNoenc;
4225 else if (node->name == xmlStringComment)
4226 ret->name = xmlStringComment;
4227 else if (node->name != NULL) {
4228 if ((doc != NULL) && (doc->dict != NULL))
4229 ret->name = xmlDictLookup(doc->dict, node->name, -1);
4231 ret->name = xmlStrdup(node->name);
4233 if ((node->type != XML_ELEMENT_NODE) &&
4234 (node->content != NULL) &&
4235 (node->type != XML_ENTITY_REF_NODE) &&
4236 (node->type != XML_XINCLUDE_END) &&
4237 (node->type != XML_XINCLUDE_START)) {
4238 ret->content = xmlStrdup(node->content);
4240 if (node->type == XML_ELEMENT_NODE)
4241 ret->line = node->line;
4243 if (parent != NULL) {
4247 * this is a tricky part for the node register thing:
4248 * in case ret does get coalesced in xmlAddChild
4249 * the deregister-node callback is called; so we register ret now already
4251 if ((__xmlRegisterCallbacks) && (xmlRegisterNodeDefaultValue))
4252 xmlRegisterNodeDefaultValue((xmlNodePtr)ret);
4254 tmp = xmlAddChild(parent, ret);
4255 /* node could have coalesced */
4262 if (((node->type == XML_ELEMENT_NODE) ||
4263 (node->type == XML_XINCLUDE_START)) && (node->nsDef != NULL))
4264 ret->nsDef = xmlCopyNamespaceList(node->nsDef);
4266 if (node->ns != NULL) {
4269 ns = xmlSearchNs(doc, ret, node->ns->prefix);
4272 * Humm, we are copying an element whose namespace is defined
4273 * out of the new tree scope. Search it in the original tree
4274 * and add it at the top of the new tree
4276 ns = xmlSearchNs(node->doc, node, node->ns->prefix);
4278 xmlNodePtr root = ret;
4280 while (root->parent != NULL) root = root->parent;
4281 ret->ns = xmlNewNs(root, ns->href, ns->prefix);
4283 ret->ns = xmlNewReconciliedNs(doc, ret, node->ns);
4287 * reference the existing namespace definition in our own tree.
4292 if (((node->type == XML_ELEMENT_NODE) ||
4293 (node->type == XML_XINCLUDE_START)) && (node->properties != NULL))
4294 ret->properties = xmlCopyPropList(ret, node->properties);
4295 if (node->type == XML_ENTITY_REF_NODE) {
4296 if ((doc == NULL) || (node->doc != doc)) {
4298 * The copied node will go into a separate document, so
4299 * to avoid dangling references to the ENTITY_DECL node
4300 * we cannot keep the reference. Try to find it in the
4303 ret->children = (xmlNodePtr) xmlGetDocEntity(doc, ret->name);
4305 ret->children = node->children;
4307 ret->last = ret->children;
4308 } else if ((node->children != NULL) && (extended != 2)) {
4309 ret->children = xmlStaticCopyNodeList(node->children, doc, ret);
4310 UPDATE_LAST_CHILD_AND_PARENT(ret)
4314 /* if parent != NULL we already registered the node above */
4315 if ((parent == NULL) &&
4316 ((__xmlRegisterCallbacks) && (xmlRegisterNodeDefaultValue)))
4317 xmlRegisterNodeDefaultValue((xmlNodePtr)ret);
4322 xmlStaticCopyNodeList(xmlNodePtr node, xmlDocPtr doc, xmlNodePtr parent) {
4323 xmlNodePtr ret = NULL;
4324 xmlNodePtr p = NULL,q;
4326 while (node != NULL) {
4327 #ifdef LIBXML_TREE_ENABLED
4328 if (node->type == XML_DTD_NODE ) {
4333 if (doc->intSubset == NULL) {
4334 q = (xmlNodePtr) xmlCopyDtd( (xmlDtdPtr) node );
4335 if (q == NULL) return(NULL);
4338 doc->intSubset = (xmlDtdPtr) q;
4339 xmlAddChild(parent, q);
4341 q = (xmlNodePtr) doc->intSubset;
4342 xmlAddChild(parent, q);
4345 #endif /* LIBXML_TREE_ENABLED */
4346 q = xmlStaticCopyNode(node, doc, parent, 1);
4347 if (q == NULL) return(NULL);
4351 } else if (p != q) {
4352 /* the test is required if xmlStaticCopyNode coalesced 2 text nodes */
4365 * @extended: if 1 do a recursive copy (properties, namespaces and children
4367 * if 2 copy properties and namespaces (when applicable)
4369 * Do a copy of the node.
4371 * Returns: a new #xmlNodePtr, or NULL in case of error.
4374 xmlCopyNode(xmlNodePtr node, int extended) {
4377 ret = xmlStaticCopyNode(node, NULL, NULL, extended);
4384 * @doc: the document
4385 * @extended: if 1 do a recursive copy (properties, namespaces and children
4387 * if 2 copy properties and namespaces (when applicable)
4389 * Do a copy of the node to a given document.
4391 * Returns: a new #xmlNodePtr, or NULL in case of error.
4394 xmlDocCopyNode(xmlNodePtr node, xmlDocPtr doc, int extended) {
4397 ret = xmlStaticCopyNode(node, doc, NULL, extended);
4402 * xmlDocCopyNodeList:
4403 * @doc: the target document
4404 * @node: the first node in the list.
4406 * Do a recursive copy of the node list.
4408 * Returns: a new #xmlNodePtr, or NULL in case of error.
4410 xmlNodePtr xmlDocCopyNodeList(xmlDocPtr doc, xmlNodePtr node) {
4411 xmlNodePtr ret = xmlStaticCopyNodeList(node, doc, NULL);
4417 * @node: the first node in the list.
4419 * Do a recursive copy of the node list.
4420 * Use xmlDocCopyNodeList() if possible to ensure string interning.
4422 * Returns: a new #xmlNodePtr, or NULL in case of error.
4424 xmlNodePtr xmlCopyNodeList(xmlNodePtr node) {
4425 xmlNodePtr ret = xmlStaticCopyNodeList(node, NULL, NULL);
4429 #if defined(LIBXML_TREE_ENABLED)
4434 * Do a copy of the dtd.
4436 * Returns: a new #xmlDtdPtr, or NULL in case of error.
4439 xmlCopyDtd(xmlDtdPtr dtd) {
4441 xmlNodePtr cur, p = NULL, q;
4443 if (dtd == NULL) return(NULL);
4444 ret = xmlNewDtd(NULL, dtd->name, dtd->ExternalID, dtd->SystemID);
4445 if (ret == NULL) return(NULL);
4446 if (dtd->entities != NULL)
4447 ret->entities = (void *) xmlCopyEntitiesTable(
4448 (xmlEntitiesTablePtr) dtd->entities);
4449 if (dtd->notations != NULL)
4450 ret->notations = (void *) xmlCopyNotationTable(
4451 (xmlNotationTablePtr) dtd->notations);
4452 if (dtd->elements != NULL)
4453 ret->elements = (void *) xmlCopyElementTable(
4454 (xmlElementTablePtr) dtd->elements);
4455 if (dtd->attributes != NULL)
4456 ret->attributes = (void *) xmlCopyAttributeTable(
4457 (xmlAttributeTablePtr) dtd->attributes);
4458 if (dtd->pentities != NULL)
4459 ret->pentities = (void *) xmlCopyEntitiesTable(
4460 (xmlEntitiesTablePtr) dtd->pentities);
4462 cur = dtd->children;
4463 while (cur != NULL) {
4466 if (cur->type == XML_ENTITY_DECL) {
4467 xmlEntityPtr tmp = (xmlEntityPtr) cur;
4468 switch (tmp->etype) {
4469 case XML_INTERNAL_GENERAL_ENTITY:
4470 case XML_EXTERNAL_GENERAL_PARSED_ENTITY:
4471 case XML_EXTERNAL_GENERAL_UNPARSED_ENTITY:
4472 q = (xmlNodePtr) xmlGetEntityFromDtd(ret, tmp->name);
4474 case XML_INTERNAL_PARAMETER_ENTITY:
4475 case XML_EXTERNAL_PARAMETER_ENTITY:
4477 xmlGetParameterEntityFromDtd(ret, tmp->name);
4479 case XML_INTERNAL_PREDEFINED_ENTITY:
4482 } else if (cur->type == XML_ELEMENT_DECL) {
4483 xmlElementPtr tmp = (xmlElementPtr) cur;
4485 xmlGetDtdQElementDesc(ret, tmp->name, tmp->prefix);
4486 } else if (cur->type == XML_ATTRIBUTE_DECL) {
4487 xmlAttributePtr tmp = (xmlAttributePtr) cur;
4489 xmlGetDtdQAttrDesc(ret, tmp->elem, tmp->name, tmp->prefix);
4490 } else if (cur->type == XML_COMMENT_NODE) {
4491 q = xmlCopyNode(cur, 0);
4505 q->parent = (xmlNodePtr) ret;
4516 #if defined(LIBXML_TREE_ENABLED) || defined(LIBXML_SCHEMAS_ENABLED)
4519 * @doc: the document
4520 * @recursive: if not zero do a recursive copy.
4522 * Do a copy of the document info. If recursive, the content tree will
4523 * be copied too as well as DTD, namespaces and entities.
4525 * Returns: a new #xmlDocPtr, or NULL in case of error.
4528 xmlCopyDoc(xmlDocPtr doc, int recursive) {
4531 if (doc == NULL) return(NULL);
4532 ret = xmlNewDoc(doc->version);
4533 if (ret == NULL) return(NULL);
4534 if (doc->name != NULL)
4535 ret->name = xmlMemStrdup(doc->name);
4536 if (doc->encoding != NULL)
4537 ret->encoding = xmlStrdup(doc->encoding);
4538 if (doc->URL != NULL)
4539 ret->URL = xmlStrdup(doc->URL);
4540 ret->charset = doc->charset;
4541 ret->compression = doc->compression;
4542 ret->standalone = doc->standalone;
4543 if (!recursive) return(ret);
4546 ret->children = NULL;
4547 #ifdef LIBXML_TREE_ENABLED
4548 if (doc->intSubset != NULL) {
4549 ret->intSubset = xmlCopyDtd(doc->intSubset);
4550 if (ret->intSubset == NULL) {
4554 xmlSetTreeDoc((xmlNodePtr)ret->intSubset, ret);
4555 ret->intSubset->parent = ret;
4558 if (doc->oldNs != NULL)
4559 ret->oldNs = xmlCopyNamespaceList(doc->oldNs);
4560 if (doc->children != NULL) {
4563 ret->children = xmlStaticCopyNodeList(doc->children, ret,
4566 tmp = ret->children;
4567 while (tmp != NULL) {
4568 if (tmp->next == NULL)
4575 #endif /* LIBXML_TREE_ENABLED */
4577 /************************************************************************
4579 * Content access functions *
4581 ************************************************************************/
4584 * xmlGetLineNoInternal:
4586 * @depth: used to limit any risk of recursion
4588 * Get line number of @node.
4589 * Try to override the limitation of lines being store in 16 bits ints
4591 * Returns the line number if successful, -1 otherwise
4594 xmlGetLineNoInternal(const xmlNode *node, int depth)
4603 if ((node->type == XML_ELEMENT_NODE) ||
4604 (node->type == XML_TEXT_NODE) ||
4605 (node->type == XML_COMMENT_NODE) ||
4606 (node->type == XML_PI_NODE)) {
4607 if (node->line == 65535) {
4608 if ((node->type == XML_TEXT_NODE) && (node->psvi != NULL))
4609 result = (long) (ptrdiff_t) node->psvi;
4610 else if ((node->type == XML_ELEMENT_NODE) &&
4611 (node->children != NULL))
4612 result = xmlGetLineNoInternal(node->children, depth + 1);
4613 else if (node->next != NULL)
4614 result = xmlGetLineNoInternal(node->next, depth + 1);
4615 else if (node->prev != NULL)
4616 result = xmlGetLineNoInternal(node->prev, depth + 1);
4618 if ((result == -1) || (result == 65535))
4619 result = (long) node->line;
4620 } else if ((node->prev != NULL) &&
4621 ((node->prev->type == XML_ELEMENT_NODE) ||
4622 (node->prev->type == XML_TEXT_NODE) ||
4623 (node->prev->type == XML_COMMENT_NODE) ||
4624 (node->prev->type == XML_PI_NODE)))
4625 result = xmlGetLineNoInternal(node->prev, depth + 1);
4626 else if ((node->parent != NULL) &&
4627 (node->parent->type == XML_ELEMENT_NODE))
4628 result = xmlGetLineNoInternal(node->parent, depth + 1);
4637 * Get line number of @node.
4638 * Try to override the limitation of lines being store in 16 bits ints
4639 * if XML_PARSE_BIG_LINES parser option was used
4641 * Returns the line number if successful, -1 otherwise
4644 xmlGetLineNo(const xmlNode *node)
4646 return(xmlGetLineNoInternal(node, 0));
4649 #if defined(LIBXML_TREE_ENABLED) || defined(LIBXML_DEBUG_ENABLED)
4654 * Build a structure based Path for the given node
4656 * Returns the new path or NULL in case of error. The caller must free
4657 * the returned string
4660 xmlGetNodePath(const xmlNode *node)
4662 const xmlNode *cur, *tmp, *next;
4663 xmlChar *buffer = NULL, *temp;
4669 int occur = 0, generic;
4671 if ((node == NULL) || (node->type == XML_NAMESPACE_DECL))
4675 buffer = (xmlChar *) xmlMallocAtomic(buf_len * sizeof(xmlChar));
4676 if (buffer == NULL) {
4677 xmlTreeErrMemory("getting node path");
4680 buf = (xmlChar *) xmlMallocAtomic(buf_len * sizeof(xmlChar));
4682 xmlTreeErrMemory("getting node path");
4693 if ((cur->type == XML_DOCUMENT_NODE) ||
4694 (cur->type == XML_HTML_DOCUMENT_NODE)) {
4695 if (buffer[0] == '/')
4699 } else if (cur->type == XML_ELEMENT_NODE) {
4702 name = (const char *) cur->name;
4704 if (cur->ns->prefix != NULL) {
4705 snprintf(nametemp, sizeof(nametemp) - 1, "%s:%s",
4706 (char *)cur->ns->prefix, (char *)cur->name);
4707 nametemp[sizeof(nametemp) - 1] = 0;
4711 * We cannot express named elements in the default
4712 * namespace, so use "*".
4721 * Thumbler index computation
4722 * TODO: the ocurence test seems bogus for namespaced names
4725 while (tmp != NULL) {
4726 if ((tmp->type == XML_ELEMENT_NODE) &&
4728 (xmlStrEqual(cur->name, tmp->name) &&
4729 ((tmp->ns == cur->ns) ||
4730 ((tmp->ns != NULL) && (cur->ns != NULL) &&
4731 (xmlStrEqual(cur->ns->prefix, tmp->ns->prefix)))))))
4737 while (tmp != NULL && occur == 0) {
4738 if ((tmp->type == XML_ELEMENT_NODE) &&
4740 (xmlStrEqual(cur->name, tmp->name) &&
4741 ((tmp->ns == cur->ns) ||
4742 ((tmp->ns != NULL) && (cur->ns != NULL) &&
4743 (xmlStrEqual(cur->ns->prefix, tmp->ns->prefix)))))))
4751 } else if (cur->type == XML_COMMENT_NODE) {
4757 * Thumbler index computation
4760 while (tmp != NULL) {
4761 if (tmp->type == XML_COMMENT_NODE)
4767 while (tmp != NULL && occur == 0) {
4768 if (tmp->type == XML_COMMENT_NODE)
4776 } else if ((cur->type == XML_TEXT_NODE) ||
4777 (cur->type == XML_CDATA_SECTION_NODE)) {
4783 * Thumbler index computation
4786 while (tmp != NULL) {
4787 if ((tmp->type == XML_TEXT_NODE) ||
4788 (tmp->type == XML_CDATA_SECTION_NODE))
4793 * Evaluate if this is the only text- or CDATA-section-node;
4794 * if yes, then we'll get "text()", otherwise "text()[1]".
4798 while (tmp != NULL) {
4799 if ((tmp->type == XML_TEXT_NODE) ||
4800 (tmp->type == XML_CDATA_SECTION_NODE))
4809 } else if (cur->type == XML_PI_NODE) {
4811 snprintf(nametemp, sizeof(nametemp) - 1,
4812 "processing-instruction('%s')", (char *)cur->name);
4813 nametemp[sizeof(nametemp) - 1] = 0;
4819 * Thumbler index computation
4822 while (tmp != NULL) {
4823 if ((tmp->type == XML_PI_NODE) &&
4824 (xmlStrEqual(cur->name, tmp->name)))
4830 while (tmp != NULL && occur == 0) {
4831 if ((tmp->type == XML_PI_NODE) &&
4832 (xmlStrEqual(cur->name, tmp->name)))
4841 } else if (cur->type == XML_ATTRIBUTE_NODE) {
4843 name = (const char *) (((xmlAttrPtr) cur)->name);
4845 if (cur->ns->prefix != NULL)
4846 snprintf(nametemp, sizeof(nametemp) - 1, "%s:%s",
4847 (char *)cur->ns->prefix, (char *)cur->name);
4849 snprintf(nametemp, sizeof(nametemp) - 1, "%s",
4851 nametemp[sizeof(nametemp) - 1] = 0;
4854 next = ((xmlAttrPtr) cur)->parent;
4860 * Make sure there is enough room
4862 if (xmlStrlen(buffer) + sizeof(nametemp) + 20 > buf_len) {
4864 2 * buf_len + xmlStrlen(buffer) + sizeof(nametemp) + 20;
4865 temp = (xmlChar *) xmlRealloc(buffer, buf_len);
4867 xmlTreeErrMemory("getting node path");
4873 temp = (xmlChar *) xmlRealloc(buf, buf_len);
4875 xmlTreeErrMemory("getting node path");
4883 snprintf((char *) buf, buf_len, "%s%s%s",
4884 sep, name, (char *) buffer);
4886 snprintf((char *) buf, buf_len, "%s%s[%d]%s",
4887 sep, name, occur, (char *) buffer);
4888 snprintf((char *) buffer, buf_len, "%s", (char *)buf);
4890 } while (cur != NULL);
4894 #endif /* LIBXML_TREE_ENABLED */
4897 * xmlDocGetRootElement:
4898 * @doc: the document
4900 * Get the root element of the document (doc->children is a list
4901 * containing possibly comments, PIs, etc ...).
4903 * Returns the #xmlNodePtr for the root or NULL
4906 xmlDocGetRootElement(const xmlDoc *doc) {
4909 if (doc == NULL) return(NULL);
4910 ret = doc->children;
4911 while (ret != NULL) {
4912 if (ret->type == XML_ELEMENT_NODE)
4919 #if defined(LIBXML_TREE_ENABLED) || defined(LIBXML_WRITER_ENABLED)
4921 * xmlDocSetRootElement:
4922 * @doc: the document
4923 * @root: the new document root element, if root is NULL no action is taken,
4924 * to remove a node from a document use xmlUnlinkNode(root) instead.
4926 * Set the root element of the document (doc->children is a list
4927 * containing possibly comments, PIs, etc ...).
4929 * Returns the old root element if any was found, NULL if root was NULL
4932 xmlDocSetRootElement(xmlDocPtr doc, xmlNodePtr root) {
4933 xmlNodePtr old = NULL;
4935 if (doc == NULL) return(NULL);
4936 if ((root == NULL) || (root->type == XML_NAMESPACE_DECL))
4938 xmlUnlinkNode(root);
4939 xmlSetTreeDoc(root, doc);
4940 root->parent = (xmlNodePtr) doc;
4941 old = doc->children;
4942 while (old != NULL) {
4943 if (old->type == XML_ELEMENT_NODE)
4948 if (doc->children == NULL) {
4949 doc->children = root;
4952 xmlAddSibling(doc->children, root);
4955 xmlReplaceNode(old, root);
4961 #if defined(LIBXML_TREE_ENABLED)
4964 * @cur: the node being changed
4965 * @lang: the language description
4967 * Set the language of a node, i.e. the values of the xml:lang
4971 xmlNodeSetLang(xmlNodePtr cur, const xmlChar *lang) {
4974 if (cur == NULL) return;
4977 case XML_CDATA_SECTION_NODE:
4978 case XML_COMMENT_NODE:
4979 case XML_DOCUMENT_NODE:
4980 case XML_DOCUMENT_TYPE_NODE:
4981 case XML_DOCUMENT_FRAG_NODE:
4982 case XML_NOTATION_NODE:
4983 case XML_HTML_DOCUMENT_NODE:
4985 case XML_ELEMENT_DECL:
4986 case XML_ATTRIBUTE_DECL:
4987 case XML_ENTITY_DECL:
4989 case XML_ENTITY_REF_NODE:
4990 case XML_ENTITY_NODE:
4991 case XML_NAMESPACE_DECL:
4992 #ifdef LIBXML_DOCB_ENABLED
4993 case XML_DOCB_DOCUMENT_NODE:
4995 case XML_XINCLUDE_START:
4996 case XML_XINCLUDE_END:
4998 case XML_ELEMENT_NODE:
4999 case XML_ATTRIBUTE_NODE:
5002 ns = xmlSearchNsByHref(cur->doc, cur, XML_XML_NAMESPACE);
5005 xmlSetNsProp(cur, ns, BAD_CAST "lang", lang);
5007 #endif /* LIBXML_TREE_ENABLED */
5011 * @cur: the node being checked
5013 * Searches the language of a node, i.e. the values of the xml:lang
5014 * attribute or the one carried by the nearest ancestor.
5016 * Returns a pointer to the lang value, or NULL if not found
5017 * It's up to the caller to free the memory with xmlFree().
5020 xmlNodeGetLang(const xmlNode *cur) {
5023 if ((cur == NULL) || (cur->type == XML_NAMESPACE_DECL))
5025 while (cur != NULL) {
5026 lang = xmlGetNsProp(cur, BAD_CAST "lang", XML_XML_NAMESPACE);
5035 #ifdef LIBXML_TREE_ENABLED
5037 * xmlNodeSetSpacePreserve:
5038 * @cur: the node being changed
5039 * @val: the xml:space value ("0": default, 1: "preserve")
5041 * Set (or reset) the space preserving behaviour of a node, i.e. the
5042 * value of the xml:space attribute.
5045 xmlNodeSetSpacePreserve(xmlNodePtr cur, int val) {
5048 if (cur == NULL) return;
5051 case XML_CDATA_SECTION_NODE:
5052 case XML_COMMENT_NODE:
5053 case XML_DOCUMENT_NODE:
5054 case XML_DOCUMENT_TYPE_NODE:
5055 case XML_DOCUMENT_FRAG_NODE:
5056 case XML_NOTATION_NODE:
5057 case XML_HTML_DOCUMENT_NODE:
5059 case XML_ELEMENT_DECL:
5060 case XML_ATTRIBUTE_DECL:
5061 case XML_ENTITY_DECL:
5063 case XML_ENTITY_REF_NODE:
5064 case XML_ENTITY_NODE:
5065 case XML_NAMESPACE_DECL:
5066 case XML_XINCLUDE_START:
5067 case XML_XINCLUDE_END:
5068 #ifdef LIBXML_DOCB_ENABLED
5069 case XML_DOCB_DOCUMENT_NODE:
5072 case XML_ELEMENT_NODE:
5073 case XML_ATTRIBUTE_NODE:
5076 ns = xmlSearchNsByHref(cur->doc, cur, XML_XML_NAMESPACE);
5081 xmlSetNsProp(cur, ns, BAD_CAST "space", BAD_CAST "default");
5084 xmlSetNsProp(cur, ns, BAD_CAST "space", BAD_CAST "preserve");
5088 #endif /* LIBXML_TREE_ENABLED */
5091 * xmlNodeGetSpacePreserve:
5092 * @cur: the node being checked
5094 * Searches the space preserving behaviour of a node, i.e. the values
5095 * of the xml:space attribute or the one carried by the nearest
5098 * Returns -1 if xml:space is not inherited, 0 if "default", 1 if "preserve"
5101 xmlNodeGetSpacePreserve(const xmlNode *cur) {
5104 if ((cur == NULL) || (cur->type != XML_ELEMENT_NODE))
5106 while (cur != NULL) {
5107 space = xmlGetNsProp(cur, BAD_CAST "space", XML_XML_NAMESPACE);
5108 if (space != NULL) {
5109 if (xmlStrEqual(space, BAD_CAST "preserve")) {
5113 if (xmlStrEqual(space, BAD_CAST "default")) {
5124 #ifdef LIBXML_TREE_ENABLED
5127 * @cur: the node being changed
5128 * @name: the new tag name
5130 * Set (or reset) the name of a node.
5133 xmlNodeSetName(xmlNodePtr cur, const xmlChar *name) {
5136 const xmlChar *freeme = NULL;
5138 if (cur == NULL) return;
5139 if (name == NULL) return;
5142 case XML_CDATA_SECTION_NODE:
5143 case XML_COMMENT_NODE:
5144 case XML_DOCUMENT_TYPE_NODE:
5145 case XML_DOCUMENT_FRAG_NODE:
5146 case XML_NOTATION_NODE:
5147 case XML_HTML_DOCUMENT_NODE:
5148 case XML_NAMESPACE_DECL:
5149 case XML_XINCLUDE_START:
5150 case XML_XINCLUDE_END:
5151 #ifdef LIBXML_DOCB_ENABLED
5152 case XML_DOCB_DOCUMENT_NODE:
5155 case XML_ELEMENT_NODE:
5156 case XML_ATTRIBUTE_NODE:
5158 case XML_ENTITY_REF_NODE:
5159 case XML_ENTITY_NODE:
5161 case XML_DOCUMENT_NODE:
5162 case XML_ELEMENT_DECL:
5163 case XML_ATTRIBUTE_DECL:
5164 case XML_ENTITY_DECL:
5173 if ((cur->name != NULL) && (!xmlDictOwns(dict, cur->name)))
5175 cur->name = xmlDictLookup(dict, name, -1);
5177 if (cur->name != NULL)
5179 cur->name = xmlStrdup(name);
5183 xmlFree((xmlChar *) freeme);
5187 #if defined(LIBXML_TREE_ENABLED) || defined(LIBXML_XINCLUDE_ENABLED)
5190 * @cur: the node being changed
5191 * @uri: the new base URI
5193 * Set (or reset) the base URI of a node, i.e. the value of the
5194 * xml:base attribute.
5197 xmlNodeSetBase(xmlNodePtr cur, const xmlChar* uri) {
5201 if (cur == NULL) return;
5204 case XML_CDATA_SECTION_NODE:
5205 case XML_COMMENT_NODE:
5206 case XML_DOCUMENT_TYPE_NODE:
5207 case XML_DOCUMENT_FRAG_NODE:
5208 case XML_NOTATION_NODE:
5210 case XML_ELEMENT_DECL:
5211 case XML_ATTRIBUTE_DECL:
5212 case XML_ENTITY_DECL:
5214 case XML_ENTITY_REF_NODE:
5215 case XML_ENTITY_NODE:
5216 case XML_NAMESPACE_DECL:
5217 case XML_XINCLUDE_START:
5218 case XML_XINCLUDE_END:
5220 case XML_ELEMENT_NODE:
5221 case XML_ATTRIBUTE_NODE:
5223 case XML_DOCUMENT_NODE:
5224 #ifdef LIBXML_DOCB_ENABLED
5225 case XML_DOCB_DOCUMENT_NODE:
5227 case XML_HTML_DOCUMENT_NODE: {
5228 xmlDocPtr doc = (xmlDocPtr) cur;
5230 if (doc->URL != NULL)
5231 xmlFree((xmlChar *) doc->URL);
5235 doc->URL = xmlPathToURI(uri);
5240 ns = xmlSearchNsByHref(cur->doc, cur, XML_XML_NAMESPACE);
5243 fixed = xmlPathToURI(uri);
5244 if (fixed != NULL) {
5245 xmlSetNsProp(cur, ns, BAD_CAST "base", fixed);
5248 xmlSetNsProp(cur, ns, BAD_CAST "base", uri);
5251 #endif /* LIBXML_TREE_ENABLED */
5255 * @doc: the document the node pertains to
5256 * @cur: the node being checked
5258 * Searches for the BASE URL. The code should work on both XML
5259 * and HTML document even if base mechanisms are completely different.
5260 * It returns the base as defined in RFC 2396 sections
5261 * 5.1.1. Base URI within Document Content
5263 * 5.1.2. Base URI from the Encapsulating Entity
5264 * However it does not return the document base (5.1.3), use
5265 * doc->URL in this case
5267 * Returns a pointer to the base URL, or NULL if not found
5268 * It's up to the caller to free the memory with xmlFree().
5271 xmlNodeGetBase(const xmlDoc *doc, const xmlNode *cur) {
5272 xmlChar *oldbase = NULL;
5273 xmlChar *base, *newbase;
5275 if ((cur == NULL) && (doc == NULL))
5277 if ((cur != NULL) && (cur->type == XML_NAMESPACE_DECL))
5279 if (doc == NULL) doc = cur->doc;
5280 if ((doc != NULL) && (doc->type == XML_HTML_DOCUMENT_NODE)) {
5281 cur = doc->children;
5282 while ((cur != NULL) && (cur->name != NULL)) {
5283 if (cur->type != XML_ELEMENT_NODE) {
5287 if (!xmlStrcasecmp(cur->name, BAD_CAST "html")) {
5288 cur = cur->children;
5291 if (!xmlStrcasecmp(cur->name, BAD_CAST "head")) {
5292 cur = cur->children;
5295 if (!xmlStrcasecmp(cur->name, BAD_CAST "base")) {
5296 return(xmlGetProp(cur, BAD_CAST "href"));
5302 while (cur != NULL) {
5303 if (cur->type == XML_ENTITY_DECL) {
5304 xmlEntityPtr ent = (xmlEntityPtr) cur;
5305 return(xmlStrdup(ent->URI));
5307 if (cur->type == XML_ELEMENT_NODE) {
5308 base = xmlGetNsProp(cur, BAD_CAST "base", XML_XML_NAMESPACE);
5310 if (oldbase != NULL) {
5311 newbase = xmlBuildURI(oldbase, base);
5312 if (newbase != NULL) {
5324 if ((!xmlStrncmp(oldbase, BAD_CAST "http://", 7)) ||
5325 (!xmlStrncmp(oldbase, BAD_CAST "ftp://", 6)) ||
5326 (!xmlStrncmp(oldbase, BAD_CAST "urn:", 4)))
5332 if ((doc != NULL) && (doc->URL != NULL)) {
5333 if (oldbase == NULL)
5334 return(xmlStrdup(doc->URL));
5335 newbase = xmlBuildURI(oldbase, doc->URL);
5343 * xmlNodeBufGetContent:
5345 * @cur: the node being read
5347 * Read the value of a node @cur, this can be either the text carried
5348 * directly by this node if it's a TEXT node or the aggregate string
5349 * of the values carried by this node child's (TEXT and ENTITY_REF).
5350 * Entity references are substituted.
5351 * Fills up the buffer @buffer with this value
5353 * Returns 0 in case of success and -1 in case of error.
5356 xmlNodeBufGetContent(xmlBufferPtr buffer, const xmlNode *cur)
5361 if ((cur == NULL) || (buffer == NULL)) return(-1);
5362 buf = xmlBufFromBuffer(buffer);
5363 ret = xmlBufGetNodeContent(buf, cur);
5364 buffer = xmlBufBackToBuffer(buf);
5365 if ((ret < 0) || (buffer == NULL))
5371 * xmlBufGetNodeContent:
5372 * @buf: a buffer xmlBufPtr
5373 * @cur: the node being read
5375 * Read the value of a node @cur, this can be either the text carried
5376 * directly by this node if it's a TEXT node or the aggregate string
5377 * of the values carried by this node child's (TEXT and ENTITY_REF).
5378 * Entity references are substituted.
5379 * Fills up the buffer @buf with this value
5381 * Returns 0 in case of success and -1 in case of error.
5384 xmlBufGetNodeContent(xmlBufPtr buf, const xmlNode *cur)
5386 if ((cur == NULL) || (buf == NULL)) return(-1);
5387 switch (cur->type) {
5388 case XML_CDATA_SECTION_NODE:
5390 xmlBufCat(buf, cur->content);
5392 case XML_DOCUMENT_FRAG_NODE:
5393 case XML_ELEMENT_NODE:{
5394 const xmlNode *tmp = cur;
5396 while (tmp != NULL) {
5397 switch (tmp->type) {
5398 case XML_CDATA_SECTION_NODE:
5400 if (tmp->content != NULL)
5401 xmlBufCat(buf, tmp->content);
5403 case XML_ENTITY_REF_NODE:
5404 xmlBufGetNodeContent(buf, tmp);
5412 if (tmp->children != NULL) {
5413 if (tmp->children->type != XML_ENTITY_DECL) {
5414 tmp = tmp->children;
5421 if (tmp->next != NULL) {
5434 if (tmp->next != NULL) {
5438 } while (tmp != NULL);
5442 case XML_ATTRIBUTE_NODE:{
5443 xmlAttrPtr attr = (xmlAttrPtr) cur;
5444 xmlNodePtr tmp = attr->children;
5446 while (tmp != NULL) {
5447 if (tmp->type == XML_TEXT_NODE)
5448 xmlBufCat(buf, tmp->content);
5450 xmlBufGetNodeContent(buf, tmp);
5455 case XML_COMMENT_NODE:
5457 xmlBufCat(buf, cur->content);
5459 case XML_ENTITY_REF_NODE:{
5463 /* lookup entity declaration */
5464 ent = xmlGetDocEntity(cur->doc, cur->name);
5468 /* an entity content can be any "well balanced chunk",
5469 * i.e. the result of the content [43] production:
5470 * http://www.w3.org/TR/REC-xml#NT-content
5471 * -> we iterate through child nodes and recursive call
5472 * xmlNodeGetContent() which handles all possible node types */
5473 tmp = ent->children;
5475 xmlBufGetNodeContent(buf, tmp);
5480 case XML_ENTITY_NODE:
5481 case XML_DOCUMENT_TYPE_NODE:
5482 case XML_NOTATION_NODE:
5484 case XML_XINCLUDE_START:
5485 case XML_XINCLUDE_END:
5487 case XML_DOCUMENT_NODE:
5488 #ifdef LIBXML_DOCB_ENABLED
5489 case XML_DOCB_DOCUMENT_NODE:
5491 case XML_HTML_DOCUMENT_NODE:
5492 cur = cur->children;
5493 while (cur!= NULL) {
5494 if ((cur->type == XML_ELEMENT_NODE) ||
5495 (cur->type == XML_TEXT_NODE) ||
5496 (cur->type == XML_CDATA_SECTION_NODE)) {
5497 xmlBufGetNodeContent(buf, cur);
5502 case XML_NAMESPACE_DECL:
5503 xmlBufCat(buf, ((xmlNsPtr) cur)->href);
5505 case XML_ELEMENT_DECL:
5506 case XML_ATTRIBUTE_DECL:
5507 case XML_ENTITY_DECL:
5514 * xmlNodeGetContent:
5515 * @cur: the node being read
5517 * Read the value of a node, this can be either the text carried
5518 * directly by this node if it's a TEXT node or the aggregate string
5519 * of the values carried by this node child's (TEXT and ENTITY_REF).
5520 * Entity references are substituted.
5521 * Returns a new #xmlChar * or NULL if no content is available.
5522 * It's up to the caller to free the memory with xmlFree().
5525 xmlNodeGetContent(const xmlNode *cur)
5529 switch (cur->type) {
5530 case XML_DOCUMENT_FRAG_NODE:
5531 case XML_ELEMENT_NODE:{
5535 buf = xmlBufCreateSize(64);
5538 xmlBufGetNodeContent(buf, cur);
5539 ret = xmlBufDetach(buf);
5543 case XML_ATTRIBUTE_NODE:
5544 return(xmlGetPropNodeValueInternal((xmlAttrPtr) cur));
5545 case XML_COMMENT_NODE:
5547 if (cur->content != NULL)
5548 return (xmlStrdup(cur->content));
5550 case XML_ENTITY_REF_NODE:{
5555 /* lookup entity declaration */
5556 ent = xmlGetDocEntity(cur->doc, cur->name);
5560 buf = xmlBufCreate();
5564 xmlBufGetNodeContent(buf, cur);
5566 ret = xmlBufDetach(buf);
5570 case XML_ENTITY_NODE:
5571 case XML_DOCUMENT_TYPE_NODE:
5572 case XML_NOTATION_NODE:
5574 case XML_XINCLUDE_START:
5575 case XML_XINCLUDE_END:
5577 case XML_DOCUMENT_NODE:
5578 #ifdef LIBXML_DOCB_ENABLED
5579 case XML_DOCB_DOCUMENT_NODE:
5581 case XML_HTML_DOCUMENT_NODE: {
5585 buf = xmlBufCreate();
5589 xmlBufGetNodeContent(buf, (xmlNodePtr) cur);
5591 ret = xmlBufDetach(buf);
5595 case XML_NAMESPACE_DECL: {
5598 tmp = xmlStrdup(((xmlNsPtr) cur)->href);
5601 case XML_ELEMENT_DECL:
5604 case XML_ATTRIBUTE_DECL:
5607 case XML_ENTITY_DECL:
5610 case XML_CDATA_SECTION_NODE:
5612 if (cur->content != NULL)
5613 return (xmlStrdup(cur->content));
5620 * xmlNodeSetContent:
5621 * @cur: the node being modified
5622 * @content: the new value of the content
5624 * Replace the content of a node.
5625 * NOTE: @content is supposed to be a piece of XML CDATA, so it allows entity
5626 * references, but XML special chars need to be escaped first by using
5627 * xmlEncodeEntitiesReentrant() resp. xmlEncodeSpecialChars().
5630 xmlNodeSetContent(xmlNodePtr cur, const xmlChar *content) {
5633 xmlGenericError(xmlGenericErrorContext,
5634 "xmlNodeSetContent : node == NULL\n");
5638 switch (cur->type) {
5639 case XML_DOCUMENT_FRAG_NODE:
5640 case XML_ELEMENT_NODE:
5641 case XML_ATTRIBUTE_NODE:
5642 if (cur->children != NULL) xmlFreeNodeList(cur->children);
5643 cur->children = xmlStringGetNodeList(cur->doc, content);
5644 UPDATE_LAST_CHILD_AND_PARENT(cur)
5647 case XML_CDATA_SECTION_NODE:
5648 case XML_ENTITY_REF_NODE:
5649 case XML_ENTITY_NODE:
5651 case XML_COMMENT_NODE:
5652 if ((cur->content != NULL) &&
5653 (cur->content != (xmlChar *) &(cur->properties))) {
5654 if (!((cur->doc != NULL) && (cur->doc->dict != NULL) &&
5655 (xmlDictOwns(cur->doc->dict, cur->content))))
5656 xmlFree(cur->content);
5658 if (cur->children != NULL) xmlFreeNodeList(cur->children);
5659 cur->last = cur->children = NULL;
5660 if (content != NULL) {
5661 cur->content = xmlStrdup(content);
5663 cur->content = NULL;
5664 cur->properties = NULL;
5667 case XML_DOCUMENT_NODE:
5668 case XML_HTML_DOCUMENT_NODE:
5669 case XML_DOCUMENT_TYPE_NODE:
5670 case XML_XINCLUDE_START:
5671 case XML_XINCLUDE_END:
5672 #ifdef LIBXML_DOCB_ENABLED
5673 case XML_DOCB_DOCUMENT_NODE:
5676 case XML_NOTATION_NODE:
5680 case XML_NAMESPACE_DECL:
5682 case XML_ELEMENT_DECL:
5685 case XML_ATTRIBUTE_DECL:
5688 case XML_ENTITY_DECL:
5694 #ifdef LIBXML_TREE_ENABLED
5696 * xmlNodeSetContentLen:
5697 * @cur: the node being modified
5698 * @content: the new value of the content
5699 * @len: the size of @content
5701 * Replace the content of a node.
5702 * NOTE: @content is supposed to be a piece of XML CDATA, so it allows entity
5703 * references, but XML special chars need to be escaped first by using
5704 * xmlEncodeEntitiesReentrant() resp. xmlEncodeSpecialChars().
5707 xmlNodeSetContentLen(xmlNodePtr cur, const xmlChar *content, int len) {
5710 xmlGenericError(xmlGenericErrorContext,
5711 "xmlNodeSetContentLen : node == NULL\n");
5715 switch (cur->type) {
5716 case XML_DOCUMENT_FRAG_NODE:
5717 case XML_ELEMENT_NODE:
5718 case XML_ATTRIBUTE_NODE:
5719 if (cur->children != NULL) xmlFreeNodeList(cur->children);
5720 cur->children = xmlStringLenGetNodeList(cur->doc, content, len);
5721 UPDATE_LAST_CHILD_AND_PARENT(cur)
5724 case XML_CDATA_SECTION_NODE:
5725 case XML_ENTITY_REF_NODE:
5726 case XML_ENTITY_NODE:
5728 case XML_COMMENT_NODE:
5729 case XML_NOTATION_NODE:
5730 if ((cur->content != NULL) &&
5731 (cur->content != (xmlChar *) &(cur->properties))) {
5732 if (!((cur->doc != NULL) && (cur->doc->dict != NULL) &&
5733 (xmlDictOwns(cur->doc->dict, cur->content))))
5734 xmlFree(cur->content);
5736 if (cur->children != NULL) xmlFreeNodeList(cur->children);
5737 cur->children = cur->last = NULL;
5738 if (content != NULL) {
5739 cur->content = xmlStrndup(content, len);
5741 cur->content = NULL;
5742 cur->properties = NULL;
5745 case XML_DOCUMENT_NODE:
5747 case XML_HTML_DOCUMENT_NODE:
5748 case XML_DOCUMENT_TYPE_NODE:
5749 case XML_NAMESPACE_DECL:
5750 case XML_XINCLUDE_START:
5751 case XML_XINCLUDE_END:
5752 #ifdef LIBXML_DOCB_ENABLED
5753 case XML_DOCB_DOCUMENT_NODE:
5756 case XML_ELEMENT_DECL:
5759 case XML_ATTRIBUTE_DECL:
5762 case XML_ENTITY_DECL:
5767 #endif /* LIBXML_TREE_ENABLED */
5770 * xmlNodeAddContentLen:
5771 * @cur: the node being modified
5772 * @content: extra content
5773 * @len: the size of @content
5775 * Append the extra substring to the node content.
5776 * NOTE: In contrast to xmlNodeSetContentLen(), @content is supposed to be
5777 * raw text, so unescaped XML special chars are allowed, entity
5778 * references are not supported.
5781 xmlNodeAddContentLen(xmlNodePtr cur, const xmlChar *content, int len) {
5784 xmlGenericError(xmlGenericErrorContext,
5785 "xmlNodeAddContentLen : node == NULL\n");
5789 if (len <= 0) return;
5790 switch (cur->type) {
5791 case XML_DOCUMENT_FRAG_NODE:
5792 case XML_ELEMENT_NODE: {
5793 xmlNodePtr last, newNode, tmp;
5796 newNode = xmlNewTextLen(content, len);
5797 if (newNode != NULL) {
5798 tmp = xmlAddChild(cur, newNode);
5801 if ((last != NULL) && (last->next == newNode)) {
5802 xmlTextMerge(last, newNode);
5807 case XML_ATTRIBUTE_NODE:
5810 case XML_CDATA_SECTION_NODE:
5811 case XML_ENTITY_REF_NODE:
5812 case XML_ENTITY_NODE:
5814 case XML_COMMENT_NODE:
5815 case XML_NOTATION_NODE:
5816 if (content != NULL) {
5817 if ((cur->content == (xmlChar *) &(cur->properties)) ||
5818 ((cur->doc != NULL) && (cur->doc->dict != NULL) &&
5819 xmlDictOwns(cur->doc->dict, cur->content))) {
5820 cur->content = xmlStrncatNew(cur->content, content, len);
5821 cur->properties = NULL;
5825 cur->content = xmlStrncat(cur->content, content, len);
5827 case XML_DOCUMENT_NODE:
5829 case XML_HTML_DOCUMENT_NODE:
5830 case XML_DOCUMENT_TYPE_NODE:
5831 case XML_NAMESPACE_DECL:
5832 case XML_XINCLUDE_START:
5833 case XML_XINCLUDE_END:
5834 #ifdef LIBXML_DOCB_ENABLED
5835 case XML_DOCB_DOCUMENT_NODE:
5838 case XML_ELEMENT_DECL:
5839 case XML_ATTRIBUTE_DECL:
5840 case XML_ENTITY_DECL:
5846 * xmlNodeAddContent:
5847 * @cur: the node being modified
5848 * @content: extra content
5850 * Append the extra substring to the node content.
5851 * NOTE: In contrast to xmlNodeSetContent(), @content is supposed to be
5852 * raw text, so unescaped XML special chars are allowed, entity
5853 * references are not supported.
5856 xmlNodeAddContent(xmlNodePtr cur, const xmlChar *content) {
5861 xmlGenericError(xmlGenericErrorContext,
5862 "xmlNodeAddContent : node == NULL\n");
5866 if (content == NULL) return;
5867 len = xmlStrlen(content);
5868 xmlNodeAddContentLen(cur, content, len);
5873 * @first: the first text node
5874 * @second: the second text node being merged
5876 * Merge two text nodes into one
5877 * Returns the first text node augmented
5880 xmlTextMerge(xmlNodePtr first, xmlNodePtr second) {
5881 if (first == NULL) return(second);
5882 if (second == NULL) return(first);
5883 if (first->type != XML_TEXT_NODE) return(first);
5884 if (second->type != XML_TEXT_NODE) return(first);
5885 if (second->name != first->name)
5887 xmlNodeAddContent(first, second->content);
5888 xmlUnlinkNode(second);
5889 xmlFreeNode(second);
5893 #if defined(LIBXML_TREE_ENABLED) || defined(LIBXML_XPATH_ENABLED) || defined(LIBXML_SCHEMAS_ENABLED)
5896 * @doc: the document
5897 * @node: the current node
5899 * Search all the namespace applying to a given element.
5900 * Returns an NULL terminated array of all the #xmlNsPtr found
5901 * that need to be freed by the caller or NULL if no
5902 * namespace if defined
5905 xmlGetNsList(const xmlDoc *doc ATTRIBUTE_UNUSED, const xmlNode *node)
5908 xmlNsPtr *ret = NULL;
5913 if ((node == NULL) || (node->type == XML_NAMESPACE_DECL))
5916 while (node != NULL) {
5917 if (node->type == XML_ELEMENT_NODE) {
5919 while (cur != NULL) {
5922 (xmlNsPtr *) xmlMalloc((maxns + 1) *
5925 xmlTreeErrMemory("getting namespace list");
5930 for (i = 0; i < nbns; i++) {
5931 if ((cur->prefix == ret[i]->prefix) ||
5932 (xmlStrEqual(cur->prefix, ret[i]->prefix)))
5936 if (nbns >= maxns) {
5938 ret = (xmlNsPtr *) xmlRealloc(ret,
5943 xmlTreeErrMemory("getting namespace list");
5954 node = node->parent;
5958 #endif /* LIBXML_TREE_ENABLED */
5961 * xmlTreeEnsureXMLDecl:
5964 * Ensures that there is an XML namespace declaration on the doc.
5966 * Returns the XML ns-struct or NULL on API and internal errors.
5969 xmlTreeEnsureXMLDecl(xmlDocPtr doc)
5973 if (doc->oldNs != NULL)
5974 return (doc->oldNs);
5977 ns = (xmlNsPtr) xmlMalloc(sizeof(xmlNs));
5980 "allocating the XML namespace");
5983 memset(ns, 0, sizeof(xmlNs));
5984 ns->type = XML_LOCAL_NAMESPACE;
5985 ns->href = xmlStrdup(XML_XML_NAMESPACE);
5986 ns->prefix = xmlStrdup((const xmlChar *)"xml");
5994 * @doc: the document
5995 * @node: the current node
5996 * @nameSpace: the namespace prefix
5998 * Search a Ns registered under a given name space for a document.
5999 * recurse on the parents until it finds the defined namespace
6000 * or return NULL otherwise.
6001 * @nameSpace can be NULL, this is a search for the default namespace.
6002 * We don't allow to cross entities boundaries. If you don't declare
6003 * the namespace within those you will be in troubles !!! A warning
6004 * is generated to cover this case.
6006 * Returns the namespace pointer or NULL.
6009 xmlSearchNs(xmlDocPtr doc, xmlNodePtr node, const xmlChar *nameSpace) {
6012 const xmlNode *orig = node;
6014 if ((node == NULL) || (node->type == XML_NAMESPACE_DECL)) return(NULL);
6015 if ((nameSpace != NULL) &&
6016 (xmlStrEqual(nameSpace, (const xmlChar *)"xml"))) {
6017 if ((doc == NULL) && (node->type == XML_ELEMENT_NODE)) {
6019 * The XML-1.0 namespace is normally held on the root
6020 * element. In this case exceptionally create it on the
6023 cur = (xmlNsPtr) xmlMalloc(sizeof(xmlNs));
6025 xmlTreeErrMemory("searching namespace");
6028 memset(cur, 0, sizeof(xmlNs));
6029 cur->type = XML_LOCAL_NAMESPACE;
6030 cur->href = xmlStrdup(XML_XML_NAMESPACE);
6031 cur->prefix = xmlStrdup((const xmlChar *)"xml");
6032 cur->next = node->nsDef;
6042 * Return the XML namespace declaration held by the doc.
6044 if (doc->oldNs == NULL)
6045 return(xmlTreeEnsureXMLDecl(doc));
6049 while (node != NULL) {
6050 if ((node->type == XML_ENTITY_REF_NODE) ||
6051 (node->type == XML_ENTITY_NODE) ||
6052 (node->type == XML_ENTITY_DECL))
6054 if (node->type == XML_ELEMENT_NODE) {
6056 while (cur != NULL) {
6057 if ((cur->prefix == NULL) && (nameSpace == NULL) &&
6058 (cur->href != NULL))
6060 if ((cur->prefix != NULL) && (nameSpace != NULL) &&
6061 (cur->href != NULL) &&
6062 (xmlStrEqual(cur->prefix, nameSpace)))
6069 if ((cur->prefix == NULL) && (nameSpace == NULL) &&
6070 (cur->href != NULL))
6072 if ((cur->prefix != NULL) && (nameSpace != NULL) &&
6073 (cur->href != NULL) &&
6074 (xmlStrEqual(cur->prefix, nameSpace)))
6079 node = node->parent;
6086 * @doc: the document
6087 * @node: the current node
6088 * @ancestor: the ancestor carrying the namespace
6089 * @prefix: the namespace prefix
6091 * Verify that the given namespace held on @ancestor is still in scope
6094 * Returns 1 if true, 0 if false and -1 in case of error.
6097 xmlNsInScope(xmlDocPtr doc ATTRIBUTE_UNUSED, xmlNodePtr node,
6098 xmlNodePtr ancestor, const xmlChar * prefix)
6102 while ((node != NULL) && (node != ancestor)) {
6103 if ((node->type == XML_ENTITY_REF_NODE) ||
6104 (node->type == XML_ENTITY_NODE) ||
6105 (node->type == XML_ENTITY_DECL))
6107 if (node->type == XML_ELEMENT_NODE) {
6109 while (tst != NULL) {
6110 if ((tst->prefix == NULL)
6111 && (prefix == NULL))
6113 if ((tst->prefix != NULL)
6115 && (xmlStrEqual(tst->prefix, prefix)))
6120 node = node->parent;
6122 if (node != ancestor)
6128 * xmlSearchNsByHref:
6129 * @doc: the document
6130 * @node: the current node
6131 * @href: the namespace value
6133 * Search a Ns aliasing a given URI. Recurse on the parents until it finds
6134 * the defined namespace or return NULL otherwise.
6135 * Returns the namespace pointer or NULL.
6138 xmlSearchNsByHref(xmlDocPtr doc, xmlNodePtr node, const xmlChar * href)
6141 xmlNodePtr orig = node;
6144 if ((node == NULL) || (node->type == XML_NAMESPACE_DECL) || (href == NULL))
6146 if (xmlStrEqual(href, XML_XML_NAMESPACE)) {
6148 * Only the document can hold the XML spec namespace.
6150 if ((doc == NULL) && (node->type == XML_ELEMENT_NODE)) {
6152 * The XML-1.0 namespace is normally held on the root
6153 * element. In this case exceptionally create it on the
6156 cur = (xmlNsPtr) xmlMalloc(sizeof(xmlNs));
6158 xmlTreeErrMemory("searching namespace");
6161 memset(cur, 0, sizeof(xmlNs));
6162 cur->type = XML_LOCAL_NAMESPACE;
6163 cur->href = xmlStrdup(XML_XML_NAMESPACE);
6164 cur->prefix = xmlStrdup((const xmlChar *) "xml");
6165 cur->next = node->nsDef;
6175 * Return the XML namespace declaration held by the doc.
6177 if (doc->oldNs == NULL)
6178 return(xmlTreeEnsureXMLDecl(doc));
6182 is_attr = (node->type == XML_ATTRIBUTE_NODE);
6183 while (node != NULL) {
6184 if ((node->type == XML_ENTITY_REF_NODE) ||
6185 (node->type == XML_ENTITY_NODE) ||
6186 (node->type == XML_ENTITY_DECL))
6188 if (node->type == XML_ELEMENT_NODE) {
6190 while (cur != NULL) {
6191 if ((cur->href != NULL) && (href != NULL) &&
6192 (xmlStrEqual(cur->href, href))) {
6193 if (((!is_attr) || (cur->prefix != NULL)) &&
6194 (xmlNsInScope(doc, orig, node, cur->prefix) == 1))
6202 if ((cur->href != NULL) && (href != NULL) &&
6203 (xmlStrEqual(cur->href, href))) {
6204 if (((!is_attr) || (cur->prefix != NULL)) &&
6205 (xmlNsInScope(doc, orig, node, cur->prefix) == 1))
6211 node = node->parent;
6217 * xmlNewReconciliedNs:
6218 * @doc: the document
6219 * @tree: a node expected to hold the new namespace
6220 * @ns: the original namespace
6222 * This function tries to locate a namespace definition in a tree
6223 * ancestors, or create a new namespace definition node similar to
6224 * @ns trying to reuse the same prefix. However if the given prefix is
6225 * null (default namespace) or reused within the subtree defined by
6226 * @tree or on one of its ancestors then a new prefix is generated.
6227 * Returns the (new) namespace definition or NULL in case of error
6230 xmlNewReconciliedNs(xmlDocPtr doc, xmlNodePtr tree, xmlNsPtr ns) {
6235 if ((tree == NULL) || (tree->type != XML_ELEMENT_NODE)) {
6237 xmlGenericError(xmlGenericErrorContext,
6238 "xmlNewReconciliedNs : tree == NULL\n");
6242 if ((ns == NULL) || (ns->type != XML_NAMESPACE_DECL)) {
6244 xmlGenericError(xmlGenericErrorContext,
6245 "xmlNewReconciliedNs : ns == NULL\n");
6250 * Search an existing namespace definition inherited.
6252 def = xmlSearchNsByHref(doc, tree, ns->href);
6257 * Find a close prefix which is not already in use.
6258 * Let's strip namespace prefixes longer than 20 chars !
6260 if (ns->prefix == NULL)
6261 snprintf((char *) prefix, sizeof(prefix), "default");
6263 snprintf((char *) prefix, sizeof(prefix), "%.20s", (char *)ns->prefix);
6265 def = xmlSearchNs(doc, tree, prefix);
6266 while (def != NULL) {
6267 if (counter > 1000) return(NULL);
6268 if (ns->prefix == NULL)
6269 snprintf((char *) prefix, sizeof(prefix), "default%d", counter++);
6271 snprintf((char *) prefix, sizeof(prefix), "%.20s%d",
6272 (char *)ns->prefix, counter++);
6273 def = xmlSearchNs(doc, tree, prefix);
6277 * OK, now we are ready to create a new one.
6279 def = xmlNewNs(tree, ns->href, prefix);
6283 #ifdef LIBXML_TREE_ENABLED
6285 * xmlReconciliateNs:
6286 * @doc: the document
6287 * @tree: a node defining the subtree to reconciliate
6289 * This function checks that all the namespaces declared within the given
6290 * tree are properly declared. This is needed for example after Copy or Cut
6291 * and then paste operations. The subtree may still hold pointers to
6292 * namespace declarations outside the subtree or invalid/masked. As much
6293 * as possible the function try to reuse the existing namespaces found in
6294 * the new environment. If not possible the new namespaces are redeclared
6295 * on @tree at the top of the given subtree.
6296 * Returns the number of namespace declarations created or -1 in case of error.
6299 xmlReconciliateNs(xmlDocPtr doc, xmlNodePtr tree) {
6300 xmlNsPtr *oldNs = NULL;
6301 xmlNsPtr *newNs = NULL;
6306 xmlNodePtr node = tree;
6310 if ((node == NULL) || (node->type != XML_ELEMENT_NODE)) return(-1);
6311 if ((doc == NULL) || (doc->type != XML_DOCUMENT_NODE)) return(-1);
6312 if (node->doc != doc) return(-1);
6313 while (node != NULL) {
6315 * Reconciliate the node namespace
6317 if (node->ns != NULL) {
6319 * initialize the cache if needed
6321 if (sizeCache == 0) {
6323 oldNs = (xmlNsPtr *) xmlMalloc(sizeCache *
6325 if (oldNs == NULL) {
6326 xmlTreeErrMemory("fixing namespaces");
6329 newNs = (xmlNsPtr *) xmlMalloc(sizeCache *
6331 if (newNs == NULL) {
6332 xmlTreeErrMemory("fixing namespaces");
6337 for (i = 0;i < nbCache;i++) {
6338 if (oldNs[i] == node->ns) {
6339 node->ns = newNs[i];
6345 * OK we need to recreate a new namespace definition
6347 n = xmlNewReconciliedNs(doc, tree, node->ns);
6348 if (n != NULL) { /* :-( what if else ??? */
6350 * check if we need to grow the cache buffers.
6352 if (sizeCache <= nbCache) {
6354 oldNs = (xmlNsPtr *) xmlRealloc(oldNs, sizeCache *
6356 if (oldNs == NULL) {
6357 xmlTreeErrMemory("fixing namespaces");
6361 newNs = (xmlNsPtr *) xmlRealloc(newNs, sizeCache *
6363 if (newNs == NULL) {
6364 xmlTreeErrMemory("fixing namespaces");
6370 oldNs[nbCache++] = node->ns;
6376 * now check for namespace hold by attributes on the node.
6378 if (node->type == XML_ELEMENT_NODE) {
6379 attr = node->properties;
6380 while (attr != NULL) {
6381 if (attr->ns != NULL) {
6383 * initialize the cache if needed
6385 if (sizeCache == 0) {
6387 oldNs = (xmlNsPtr *) xmlMalloc(sizeCache *
6389 if (oldNs == NULL) {
6390 xmlTreeErrMemory("fixing namespaces");
6393 newNs = (xmlNsPtr *) xmlMalloc(sizeCache *
6395 if (newNs == NULL) {
6396 xmlTreeErrMemory("fixing namespaces");
6401 for (i = 0;i < nbCache;i++) {
6402 if (oldNs[i] == attr->ns) {
6403 attr->ns = newNs[i];
6409 * OK we need to recreate a new namespace definition
6411 n = xmlNewReconciliedNs(doc, tree, attr->ns);
6412 if (n != NULL) { /* :-( what if else ??? */
6414 * check if we need to grow the cache buffers.
6416 if (sizeCache <= nbCache) {
6418 oldNs = (xmlNsPtr *) xmlRealloc(oldNs,
6419 sizeCache * sizeof(xmlNsPtr));
6420 if (oldNs == NULL) {
6421 xmlTreeErrMemory("fixing namespaces");
6425 newNs = (xmlNsPtr *) xmlRealloc(newNs,
6426 sizeCache * sizeof(xmlNsPtr));
6427 if (newNs == NULL) {
6428 xmlTreeErrMemory("fixing namespaces");
6434 oldNs[nbCache++] = attr->ns;
6444 * Browse the full subtree, deep first
6446 if ((node->children != NULL) && (node->type != XML_ENTITY_REF_NODE)) {
6448 node = node->children;
6449 } else if ((node != tree) && (node->next != NULL)) {
6452 } else if (node != tree) {
6453 /* go up to parents->next if needed */
6454 while (node != tree) {
6455 if (node->parent != NULL)
6456 node = node->parent;
6457 if ((node != tree) && (node->next != NULL)) {
6461 if (node->parent == NULL) {
6466 /* exit condition */
6478 #endif /* LIBXML_TREE_ENABLED */
6481 xmlGetPropNodeInternal(const xmlNode *node, const xmlChar *name,
6482 const xmlChar *nsName, int useDTD)
6486 if ((node == NULL) || (node->type != XML_ELEMENT_NODE) || (name == NULL))
6489 if (node->properties != NULL) {
6490 prop = node->properties;
6491 if (nsName == NULL) {
6493 * We want the attr to be in no namespace.
6496 if ((prop->ns == NULL) && xmlStrEqual(prop->name, name)) {
6500 } while (prop != NULL);
6503 * We want the attr to be in the specified namespace.
6506 if ((prop->ns != NULL) && xmlStrEqual(prop->name, name) &&
6507 ((prop->ns->href == nsName) ||
6508 xmlStrEqual(prop->ns->href, nsName)))
6513 } while (prop != NULL);
6517 #ifdef LIBXML_TREE_ENABLED
6521 * Check if there is a default/fixed attribute declaration in
6522 * the internal or external subset.
6524 if ((node->doc != NULL) && (node->doc->intSubset != NULL)) {
6525 xmlDocPtr doc = node->doc;
6526 xmlAttributePtr attrDecl = NULL;
6527 xmlChar *elemQName, *tmpstr = NULL;
6530 * We need the QName of the element for the DTD-lookup.
6532 if ((node->ns != NULL) && (node->ns->prefix != NULL)) {
6533 tmpstr = xmlStrdup(node->ns->prefix);
6534 tmpstr = xmlStrcat(tmpstr, BAD_CAST ":");
6535 tmpstr = xmlStrcat(tmpstr, node->name);
6540 elemQName = (xmlChar *) node->name;
6541 if (nsName == NULL) {
6543 * The common and nice case: Attr in no namespace.
6545 attrDecl = xmlGetDtdQAttrDesc(doc->intSubset,
6546 elemQName, name, NULL);
6547 if ((attrDecl == NULL) && (doc->extSubset != NULL)) {
6548 attrDecl = xmlGetDtdQAttrDesc(doc->extSubset,
6549 elemQName, name, NULL);
6552 xmlNsPtr *nsList, *cur;
6555 * The ugly case: Search using the prefixes of in-scope
6556 * ns-decls corresponding to @nsName.
6558 nsList = xmlGetNsList(node->doc, node);
6559 if (nsList == NULL) {
6565 while (*cur != NULL) {
6566 if (xmlStrEqual((*cur)->href, nsName)) {
6567 attrDecl = xmlGetDtdQAttrDesc(doc->intSubset, elemQName,
6568 name, (*cur)->prefix);
6571 if (doc->extSubset != NULL) {
6572 attrDecl = xmlGetDtdQAttrDesc(doc->extSubset, elemQName,
6573 name, (*cur)->prefix);
6585 * Only default/fixed attrs are relevant.
6587 if ((attrDecl != NULL) && (attrDecl->defaultValue != NULL))
6588 return((xmlAttrPtr) attrDecl);
6590 #endif /* LIBXML_TREE_ENABLED */
6595 xmlGetPropNodeValueInternal(const xmlAttr *prop)
6599 if (prop->type == XML_ATTRIBUTE_NODE) {
6601 * Note that we return at least the empty string.
6602 * TODO: Do we really always want that?
6604 if (prop->children != NULL) {
6605 if ((prop->children->next == NULL) &&
6606 ((prop->children->type == XML_TEXT_NODE) ||
6607 (prop->children->type == XML_CDATA_SECTION_NODE)))
6610 * Optimization for the common case: only 1 text node.
6612 return(xmlStrdup(prop->children->content));
6616 ret = xmlNodeListGetString(prop->doc, prop->children, 1);
6621 return(xmlStrdup((xmlChar *)""));
6622 } else if (prop->type == XML_ATTRIBUTE_DECL) {
6623 return(xmlStrdup(((xmlAttributePtr)prop)->defaultValue));
6631 * @name: the attribute name
6633 * Search an attribute associated to a node
6634 * This function also looks in DTD attribute declaration for #FIXED or
6635 * default declaration values unless DTD use has been turned off.
6637 * Returns the attribute or the attribute declaration or NULL if
6638 * neither was found.
6641 xmlHasProp(const xmlNode *node, const xmlChar *name) {
6645 if ((node == NULL) || (node->type != XML_ELEMENT_NODE) || (name == NULL))
6648 * Check on the properties attached to the node
6650 prop = node->properties;
6651 while (prop != NULL) {
6652 if (xmlStrEqual(prop->name, name)) {
6657 if (!xmlCheckDTD) return(NULL);
6660 * Check if there is a default declaration in the internal
6661 * or external subsets
6665 xmlAttributePtr attrDecl;
6666 if (doc->intSubset != NULL) {
6667 attrDecl = xmlGetDtdAttrDesc(doc->intSubset, node->name, name);
6668 if ((attrDecl == NULL) && (doc->extSubset != NULL))
6669 attrDecl = xmlGetDtdAttrDesc(doc->extSubset, node->name, name);
6670 if ((attrDecl != NULL) && (attrDecl->defaultValue != NULL))
6671 /* return attribute declaration only if a default value is given
6672 (that includes #FIXED declarations) */
6673 return((xmlAttrPtr) attrDecl);
6682 * @name: the attribute name
6683 * @nameSpace: the URI of the namespace
6685 * Search for an attribute associated to a node
6686 * This attribute has to be anchored in the namespace specified.
6687 * This does the entity substitution.
6688 * This function looks in DTD attribute declaration for #FIXED or
6689 * default declaration values unless DTD use has been turned off.
6690 * Note that a namespace of NULL indicates to use the default namespace.
6692 * Returns the attribute or the attribute declaration or NULL
6693 * if neither was found.
6696 xmlHasNsProp(const xmlNode *node, const xmlChar *name, const xmlChar *nameSpace) {
6698 return(xmlGetPropNodeInternal(node, name, nameSpace, xmlCheckDTD));
6704 * @name: the attribute name
6706 * Search and get the value of an attribute associated to a node
6707 * This does the entity substitution.
6708 * This function looks in DTD attribute declaration for #FIXED or
6709 * default declaration values unless DTD use has been turned off.
6710 * NOTE: this function acts independently of namespaces associated
6711 * to the attribute. Use xmlGetNsProp() or xmlGetNoNsProp()
6712 * for namespace aware processing.
6714 * Returns the attribute value or NULL if not found.
6715 * It's up to the caller to free the memory with xmlFree().
6718 xmlGetProp(const xmlNode *node, const xmlChar *name) {
6721 prop = xmlHasProp(node, name);
6724 return(xmlGetPropNodeValueInternal(prop));
6730 * @name: the attribute name
6732 * Search and get the value of an attribute associated to a node
6733 * This does the entity substitution.
6734 * This function looks in DTD attribute declaration for #FIXED or
6735 * default declaration values unless DTD use has been turned off.
6736 * This function is similar to xmlGetProp except it will accept only
6737 * an attribute in no namespace.
6739 * Returns the attribute value or NULL if not found.
6740 * It's up to the caller to free the memory with xmlFree().
6743 xmlGetNoNsProp(const xmlNode *node, const xmlChar *name) {
6746 prop = xmlGetPropNodeInternal(node, name, NULL, xmlCheckDTD);
6749 return(xmlGetPropNodeValueInternal(prop));
6755 * @name: the attribute name
6756 * @nameSpace: the URI of the namespace
6758 * Search and get the value of an attribute associated to a node
6759 * This attribute has to be anchored in the namespace specified.
6760 * This does the entity substitution.
6761 * This function looks in DTD attribute declaration for #FIXED or
6762 * default declaration values unless DTD use has been turned off.
6764 * Returns the attribute value or NULL if not found.
6765 * It's up to the caller to free the memory with xmlFree().
6768 xmlGetNsProp(const xmlNode *node, const xmlChar *name, const xmlChar *nameSpace) {
6771 prop = xmlGetPropNodeInternal(node, name, nameSpace, xmlCheckDTD);
6774 return(xmlGetPropNodeValueInternal(prop));
6777 #if defined(LIBXML_TREE_ENABLED) || defined(LIBXML_SCHEMAS_ENABLED)
6781 * @name: the attribute name
6783 * Remove an attribute carried by a node.
6784 * This handles only attributes in no namespace.
6785 * Returns 0 if successful, -1 if not found
6788 xmlUnsetProp(xmlNodePtr node, const xmlChar *name) {
6791 prop = xmlGetPropNodeInternal(node, name, NULL, 0);
6794 xmlUnlinkNode((xmlNodePtr) prop);
6802 * @ns: the namespace definition
6803 * @name: the attribute name
6805 * Remove an attribute carried by a node.
6806 * Returns 0 if successful, -1 if not found
6809 xmlUnsetNsProp(xmlNodePtr node, xmlNsPtr ns, const xmlChar *name) {
6812 prop = xmlGetPropNodeInternal(node, name, (ns != NULL) ? ns->href : NULL, 0);
6815 xmlUnlinkNode((xmlNodePtr) prop);
6821 #if defined(LIBXML_TREE_ENABLED) || defined(LIBXML_XINCLUDE_ENABLED) || defined(LIBXML_SCHEMAS_ENABLED) || defined(LIBXML_HTML_ENABLED)
6825 * @name: the attribute name (a QName)
6826 * @value: the attribute value
6828 * Set (or reset) an attribute carried by a node.
6829 * If @name has a prefix, then the corresponding
6830 * namespace-binding will be used, if in scope; it is an
6831 * error it there's no such ns-binding for the prefix in
6833 * Returns the attribute pointer.
6837 xmlSetProp(xmlNodePtr node, const xmlChar *name, const xmlChar *value) {
6839 const xmlChar *nqname;
6841 if ((node == NULL) || (name == NULL) || (node->type != XML_ELEMENT_NODE))
6847 nqname = xmlSplitQName3(name, &len);
6848 if (nqname != NULL) {
6850 xmlChar *prefix = xmlStrndup(name, len);
6851 ns = xmlSearchNs(node->doc, node, prefix);
6855 return(xmlSetNsProp(node, ns, nqname, value));
6857 return(xmlSetNsProp(node, NULL, name, value));
6863 * @ns: the namespace definition
6864 * @name: the attribute name
6865 * @value: the attribute value
6867 * Set (or reset) an attribute carried by a node.
6868 * The ns structure must be in scope, this is not checked
6870 * Returns the attribute pointer.
6873 xmlSetNsProp(xmlNodePtr node, xmlNsPtr ns, const xmlChar *name,
6874 const xmlChar *value)
6878 if (ns && (ns->href == NULL))
6880 prop = xmlGetPropNodeInternal(node, name, (ns != NULL) ? ns->href : NULL, 0);
6883 * Modify the attribute's value.
6885 if (prop->atype == XML_ATTRIBUTE_ID) {
6886 xmlRemoveID(node->doc, prop);
6887 prop->atype = XML_ATTRIBUTE_ID;
6889 if (prop->children != NULL)
6890 xmlFreeNodeList(prop->children);
6891 prop->children = NULL;
6894 if (value != NULL) {
6897 if(!xmlCheckUTF8(value)) {
6898 xmlTreeErr(XML_TREE_NOT_UTF8, (xmlNodePtr) node->doc,
6900 if (node->doc != NULL)
6901 node->doc->encoding = xmlStrdup(BAD_CAST "ISO-8859-1");
6903 prop->children = xmlNewDocText(node->doc, value);
6905 tmp = prop->children;
6906 while (tmp != NULL) {
6907 tmp->parent = (xmlNodePtr) prop;
6908 if (tmp->next == NULL)
6913 if (prop->atype == XML_ATTRIBUTE_ID)
6914 xmlAddID(NULL, node->doc, value, prop);
6918 * No equal attr found; create a new one.
6920 return(xmlNewPropInternal(node, ns, name, value, 0));
6923 #endif /* LIBXML_TREE_ENABLED */
6929 * Is this node a Text node ?
6930 * Returns 1 yes, 0 no
6933 xmlNodeIsText(const xmlNode *node) {
6934 if (node == NULL) return(0);
6936 if (node->type == XML_TEXT_NODE) return(1);
6944 * Checks whether this node is an empty or whitespace only
6945 * (and possibly ignorable) text-node.
6947 * Returns 1 yes, 0 no
6950 xmlIsBlankNode(const xmlNode *node) {
6952 if (node == NULL) return(0);
6954 if ((node->type != XML_TEXT_NODE) &&
6955 (node->type != XML_CDATA_SECTION_NODE))
6957 if (node->content == NULL) return(1);
6958 cur = node->content;
6960 if (!IS_BLANK_CH(*cur)) return(0);
6970 * @content: the content
6971 * @len: @content length
6973 * Concat the given string at the end of the existing node content
6975 * Returns -1 in case of error, 0 otherwise
6979 xmlTextConcat(xmlNodePtr node, const xmlChar *content, int len) {
6980 if (node == NULL) return(-1);
6982 if ((node->type != XML_TEXT_NODE) &&
6983 (node->type != XML_CDATA_SECTION_NODE) &&
6984 (node->type != XML_COMMENT_NODE) &&
6985 (node->type != XML_PI_NODE)) {
6987 xmlGenericError(xmlGenericErrorContext,
6988 "xmlTextConcat: node is not text nor CDATA\n");
6992 /* need to check if content is currently in the dictionary */
6993 if ((node->content == (xmlChar *) &(node->properties)) ||
6994 ((node->doc != NULL) && (node->doc->dict != NULL) &&
6995 xmlDictOwns(node->doc->dict, node->content))) {
6996 node->content = xmlStrncatNew(node->content, content, len);
6998 node->content = xmlStrncat(node->content, content, len);
7000 node->properties = NULL;
7001 if (node->content == NULL)
7006 /************************************************************************
7008 * Output : to a FILE or in memory *
7010 ************************************************************************/
7015 * routine to create an XML buffer.
7016 * returns the new structure.
7019 xmlBufferCreate(void) {
7022 ret = (xmlBufferPtr) xmlMalloc(sizeof(xmlBuffer));
7024 xmlTreeErrMemory("creating buffer");
7028 ret->size = xmlDefaultBufferSize;
7029 ret->alloc = xmlBufferAllocScheme;
7030 ret->content = (xmlChar *) xmlMallocAtomic(ret->size * sizeof(xmlChar));
7031 if (ret->content == NULL) {
7032 xmlTreeErrMemory("creating buffer");
7036 ret->content[0] = 0;
7037 ret->contentIO = NULL;
7042 * xmlBufferCreateSize:
7043 * @size: initial size of buffer
7045 * routine to create an XML buffer.
7046 * returns the new structure.
7049 xmlBufferCreateSize(size_t size) {
7052 ret = (xmlBufferPtr) xmlMalloc(sizeof(xmlBuffer));
7054 xmlTreeErrMemory("creating buffer");
7058 ret->alloc = xmlBufferAllocScheme;
7059 ret->size = (size ? size+2 : 0); /* +1 for ending null */
7061 ret->content = (xmlChar *) xmlMallocAtomic(ret->size * sizeof(xmlChar));
7062 if (ret->content == NULL) {
7063 xmlTreeErrMemory("creating buffer");
7067 ret->content[0] = 0;
7069 ret->content = NULL;
7070 ret->contentIO = NULL;
7078 * Remove the string contained in a buffer and gie it back to the
7079 * caller. The buffer is reset to an empty content.
7080 * This doesn't work with immutable buffers as they can't be reset.
7082 * Returns the previous string contained by the buffer.
7085 xmlBufferDetach(xmlBufferPtr buf) {
7090 if (buf->alloc == XML_BUFFER_ALLOC_IMMUTABLE)
7094 buf->content = NULL;
7103 * xmlBufferCreateStatic:
7104 * @mem: the memory area
7105 * @size: the size in byte
7107 * routine to create an XML buffer from an immutable memory area.
7108 * The area won't be modified nor copied, and is expected to be
7109 * present until the end of the buffer lifetime.
7111 * returns the new structure.
7114 xmlBufferCreateStatic(void *mem, size_t size) {
7117 if ((mem == NULL) || (size == 0))
7120 ret = (xmlBufferPtr) xmlMalloc(sizeof(xmlBuffer));
7122 xmlTreeErrMemory("creating buffer");
7127 ret->alloc = XML_BUFFER_ALLOC_IMMUTABLE;
7128 ret->content = (xmlChar *) mem;
7133 * xmlBufferSetAllocationScheme:
7134 * @buf: the buffer to tune
7135 * @scheme: allocation scheme to use
7137 * Sets the allocation scheme for this buffer
7140 xmlBufferSetAllocationScheme(xmlBufferPtr buf,
7141 xmlBufferAllocationScheme scheme) {
7144 xmlGenericError(xmlGenericErrorContext,
7145 "xmlBufferSetAllocationScheme: buf == NULL\n");
7149 if ((buf->alloc == XML_BUFFER_ALLOC_IMMUTABLE) ||
7150 (buf->alloc == XML_BUFFER_ALLOC_IO)) return;
7151 if ((scheme == XML_BUFFER_ALLOC_DOUBLEIT) ||
7152 (scheme == XML_BUFFER_ALLOC_EXACT) ||
7153 (scheme == XML_BUFFER_ALLOC_HYBRID) ||
7154 (scheme == XML_BUFFER_ALLOC_IMMUTABLE))
7155 buf->alloc = scheme;
7160 * @buf: the buffer to free
7162 * Frees an XML buffer. It frees both the content and the structure which
7166 xmlBufferFree(xmlBufferPtr buf) {
7169 xmlGenericError(xmlGenericErrorContext,
7170 "xmlBufferFree: buf == NULL\n");
7175 if ((buf->alloc == XML_BUFFER_ALLOC_IO) &&
7176 (buf->contentIO != NULL)) {
7177 xmlFree(buf->contentIO);
7178 } else if ((buf->content != NULL) &&
7179 (buf->alloc != XML_BUFFER_ALLOC_IMMUTABLE)) {
7180 xmlFree(buf->content);
7192 xmlBufferEmpty(xmlBufferPtr buf) {
7193 if (buf == NULL) return;
7194 if (buf->content == NULL) return;
7196 if (buf->alloc == XML_BUFFER_ALLOC_IMMUTABLE) {
7197 buf->content = BAD_CAST "";
7198 } else if ((buf->alloc == XML_BUFFER_ALLOC_IO) &&
7199 (buf->contentIO != NULL)) {
7200 size_t start_buf = buf->content - buf->contentIO;
7202 buf->size += start_buf;
7203 buf->content = buf->contentIO;
7204 buf->content[0] = 0;
7206 buf->content[0] = 0;
7212 * @buf: the buffer to dump
7213 * @len: the number of xmlChar to remove
7215 * Remove the beginning of an XML buffer.
7217 * Returns the number of #xmlChar removed, or -1 in case of failure.
7220 xmlBufferShrink(xmlBufferPtr buf, unsigned int len) {
7221 if (buf == NULL) return(-1);
7222 if (len == 0) return(0);
7223 if (len > buf->use) return(-1);
7226 if ((buf->alloc == XML_BUFFER_ALLOC_IMMUTABLE) ||
7227 ((buf->alloc == XML_BUFFER_ALLOC_IO) && (buf->contentIO != NULL))) {
7229 * we just move the content pointer, but also make sure
7230 * the perceived buffer size has shrinked accordingly
7232 buf->content += len;
7236 * sometimes though it maybe be better to really shrink
7239 if ((buf->alloc == XML_BUFFER_ALLOC_IO) && (buf->contentIO != NULL)) {
7240 size_t start_buf = buf->content - buf->contentIO;
7241 if (start_buf >= buf->size) {
7242 memmove(buf->contentIO, &buf->content[0], buf->use);
7243 buf->content = buf->contentIO;
7244 buf->content[buf->use] = 0;
7245 buf->size += start_buf;
7249 memmove(buf->content, &buf->content[len], buf->use);
7250 buf->content[buf->use] = 0;
7258 * @len: the minimum free size to allocate
7260 * Grow the available space of an XML buffer.
7262 * Returns the new available space or -1 in case of error
7265 xmlBufferGrow(xmlBufferPtr buf, unsigned int len) {
7269 if (buf == NULL) return(-1);
7271 if (buf->alloc == XML_BUFFER_ALLOC_IMMUTABLE) return(0);
7272 if (len + buf->use < buf->size) return(0);
7275 * Windows has a BIG problem on realloc timing, so we try to double
7276 * the buffer size (if that's enough) (bug 146697)
7277 * Apparently BSD too, and it's probably best for linux too
7278 * On an embedded system this may be something to change
7281 if (buf->size > len)
7282 size = buf->size * 2;
7284 size = buf->use + len + 100;
7286 size = buf->use + len + 100;
7289 if ((buf->alloc == XML_BUFFER_ALLOC_IO) && (buf->contentIO != NULL)) {
7290 size_t start_buf = buf->content - buf->contentIO;
7292 newbuf = (xmlChar *) xmlRealloc(buf->contentIO, start_buf + size);
7293 if (newbuf == NULL) {
7294 xmlTreeErrMemory("growing buffer");
7297 buf->contentIO = newbuf;
7298 buf->content = newbuf + start_buf;
7300 newbuf = (xmlChar *) xmlRealloc(buf->content, size);
7301 if (newbuf == NULL) {
7302 xmlTreeErrMemory("growing buffer");
7305 buf->content = newbuf;
7308 return(buf->size - buf->use);
7313 * @file: the file output
7314 * @buf: the buffer to dump
7316 * Dumps an XML buffer to a FILE *.
7317 * Returns the number of #xmlChar written
7320 xmlBufferDump(FILE *file, xmlBufferPtr buf) {
7325 xmlGenericError(xmlGenericErrorContext,
7326 "xmlBufferDump: buf == NULL\n");
7330 if (buf->content == NULL) {
7332 xmlGenericError(xmlGenericErrorContext,
7333 "xmlBufferDump: buf->content == NULL\n");
7339 ret = fwrite(buf->content, sizeof(xmlChar), buf->use, file);
7347 * Function to extract the content of a buffer
7349 * Returns the internal content
7353 xmlBufferContent(const xmlBuffer *buf)
7358 return buf->content;
7365 * Function to get the length of a buffer
7367 * Returns the length of data in the internal content
7371 xmlBufferLength(const xmlBuffer *buf)
7381 * @buf: the buffer to resize
7382 * @size: the desired size
7384 * Resize a buffer to accommodate minimum size of @size.
7386 * Returns 0 in case of problems, 1 otherwise
7389 xmlBufferResize(xmlBufferPtr buf, unsigned int size)
7391 unsigned int newSize;
7392 xmlChar* rebuf = NULL;
7398 if (buf->alloc == XML_BUFFER_ALLOC_IMMUTABLE) return(0);
7400 /* Don't resize if we don't have to */
7401 if (size < buf->size)
7404 /* figure out new size */
7405 switch (buf->alloc){
7406 case XML_BUFFER_ALLOC_IO:
7407 case XML_BUFFER_ALLOC_DOUBLEIT:
7408 /*take care of empty case*/
7409 newSize = (buf->size ? buf->size*2 : size + 10);
7410 while (size > newSize) {
7411 if (newSize > UINT_MAX / 2) {
7412 xmlTreeErrMemory("growing buffer");
7418 case XML_BUFFER_ALLOC_EXACT:
7421 case XML_BUFFER_ALLOC_HYBRID:
7422 if (buf->use < BASE_BUFFER_SIZE)
7425 newSize = buf->size * 2;
7426 while (size > newSize) {
7427 if (newSize > UINT_MAX / 2) {
7428 xmlTreeErrMemory("growing buffer");
7441 if ((buf->alloc == XML_BUFFER_ALLOC_IO) && (buf->contentIO != NULL)) {
7442 start_buf = buf->content - buf->contentIO;
7444 if (start_buf > newSize) {
7445 /* move data back to start */
7446 memmove(buf->contentIO, buf->content, buf->use);
7447 buf->content = buf->contentIO;
7448 buf->content[buf->use] = 0;
7449 buf->size += start_buf;
7451 rebuf = (xmlChar *) xmlRealloc(buf->contentIO, start_buf + newSize);
7452 if (rebuf == NULL) {
7453 xmlTreeErrMemory("growing buffer");
7456 buf->contentIO = rebuf;
7457 buf->content = rebuf + start_buf;
7460 if (buf->content == NULL) {
7461 rebuf = (xmlChar *) xmlMallocAtomic(newSize);
7462 } else if (buf->size - buf->use < 100) {
7463 rebuf = (xmlChar *) xmlRealloc(buf->content, newSize);
7466 * if we are reallocating a buffer far from being full, it's
7467 * better to make a new allocation and copy only the used range
7468 * and free the old one.
7470 rebuf = (xmlChar *) xmlMallocAtomic(newSize);
7471 if (rebuf != NULL) {
7472 memcpy(rebuf, buf->content, buf->use);
7473 xmlFree(buf->content);
7474 rebuf[buf->use] = 0;
7477 if (rebuf == NULL) {
7478 xmlTreeErrMemory("growing buffer");
7481 buf->content = rebuf;
7483 buf->size = newSize;
7490 * @buf: the buffer to dump
7491 * @str: the #xmlChar string
7492 * @len: the number of #xmlChar to add
7494 * Add a string range to an XML buffer. if len == -1, the length of
7495 * str is recomputed.
7497 * Returns 0 successful, a positive error code number otherwise
7498 * and -1 in case of internal or API error.
7501 xmlBufferAdd(xmlBufferPtr buf, const xmlChar *str, int len) {
7502 unsigned int needSize;
7504 if ((str == NULL) || (buf == NULL)) {
7507 if (buf->alloc == XML_BUFFER_ALLOC_IMMUTABLE) return -1;
7510 xmlGenericError(xmlGenericErrorContext,
7511 "xmlBufferAdd: len < 0\n");
7515 if (len == 0) return 0;
7518 len = xmlStrlen(str);
7520 if (len < 0) return -1;
7521 if (len == 0) return 0;
7523 needSize = buf->use + len + 2;
7524 if (needSize > buf->size){
7525 if (!xmlBufferResize(buf, needSize)){
7526 xmlTreeErrMemory("growing buffer");
7527 return XML_ERR_NO_MEMORY;
7531 memmove(&buf->content[buf->use], str, len*sizeof(xmlChar));
7533 buf->content[buf->use] = 0;
7540 * @str: the #xmlChar string
7541 * @len: the number of #xmlChar to add
7543 * Add a string range to the beginning of an XML buffer.
7544 * if len == -1, the length of @str is recomputed.
7546 * Returns 0 successful, a positive error code number otherwise
7547 * and -1 in case of internal or API error.
7550 xmlBufferAddHead(xmlBufferPtr buf, const xmlChar *str, int len) {
7551 unsigned int needSize;
7555 if (buf->alloc == XML_BUFFER_ALLOC_IMMUTABLE) return -1;
7558 xmlGenericError(xmlGenericErrorContext,
7559 "xmlBufferAddHead: str == NULL\n");
7565 xmlGenericError(xmlGenericErrorContext,
7566 "xmlBufferAddHead: len < 0\n");
7570 if (len == 0) return 0;
7573 len = xmlStrlen(str);
7575 if (len <= 0) return -1;
7577 if ((buf->alloc == XML_BUFFER_ALLOC_IO) && (buf->contentIO != NULL)) {
7578 size_t start_buf = buf->content - buf->contentIO;
7580 if (start_buf > (unsigned int) len) {
7582 * We can add it in the space previously shrinked
7584 buf->content -= len;
7585 memmove(&buf->content[0], str, len);
7591 needSize = buf->use + len + 2;
7592 if (needSize > buf->size){
7593 if (!xmlBufferResize(buf, needSize)){
7594 xmlTreeErrMemory("growing buffer");
7595 return XML_ERR_NO_MEMORY;
7599 memmove(&buf->content[len], &buf->content[0], buf->use);
7600 memmove(&buf->content[0], str, len);
7602 buf->content[buf->use] = 0;
7608 * @buf: the buffer to add to
7609 * @str: the #xmlChar string
7611 * Append a zero terminated string to an XML buffer.
7613 * Returns 0 successful, a positive error code number otherwise
7614 * and -1 in case of internal or API error.
7617 xmlBufferCat(xmlBufferPtr buf, const xmlChar *str) {
7620 if (buf->alloc == XML_BUFFER_ALLOC_IMMUTABLE) return -1;
7621 if (str == NULL) return -1;
7622 return xmlBufferAdd(buf, str, -1);
7627 * @buf: the buffer to dump
7628 * @str: the C char string
7630 * Append a zero terminated C string to an XML buffer.
7632 * Returns 0 successful, a positive error code number otherwise
7633 * and -1 in case of internal or API error.
7636 xmlBufferCCat(xmlBufferPtr buf, const char *str) {
7641 if (buf->alloc == XML_BUFFER_ALLOC_IMMUTABLE) return -1;
7644 xmlGenericError(xmlGenericErrorContext,
7645 "xmlBufferCCat: str == NULL\n");
7649 for (cur = str;*cur != 0;cur++) {
7650 if (buf->use + 10 >= buf->size) {
7651 if (!xmlBufferResize(buf, buf->use+10)){
7652 xmlTreeErrMemory("growing buffer");
7653 return XML_ERR_NO_MEMORY;
7656 buf->content[buf->use++] = *cur;
7658 buf->content[buf->use] = 0;
7663 * xmlBufferWriteCHAR:
7664 * @buf: the XML buffer
7665 * @string: the string to add
7667 * routine which manages and grows an output buffer. This one adds
7668 * xmlChars at the end of the buffer.
7671 xmlBufferWriteCHAR(xmlBufferPtr buf, const xmlChar *string) {
7674 if (buf->alloc == XML_BUFFER_ALLOC_IMMUTABLE) return;
7675 xmlBufferCat(buf, string);
7679 * xmlBufferWriteChar:
7680 * @buf: the XML buffer output
7681 * @string: the string to add
7683 * routine which manage and grows an output buffer. This one add
7684 * C chars at the end of the array.
7687 xmlBufferWriteChar(xmlBufferPtr buf, const char *string) {
7690 if (buf->alloc == XML_BUFFER_ALLOC_IMMUTABLE) return;
7691 xmlBufferCCat(buf, string);
7696 * xmlBufferWriteQuotedString:
7697 * @buf: the XML buffer output
7698 * @string: the string to add
7700 * routine which manage and grows an output buffer. This one writes
7701 * a quoted or double quoted #xmlChar string, checking first if it holds
7702 * quote or double-quotes internally
7705 xmlBufferWriteQuotedString(xmlBufferPtr buf, const xmlChar *string) {
7706 const xmlChar *cur, *base;
7709 if (buf->alloc == XML_BUFFER_ALLOC_IMMUTABLE) return;
7710 if (xmlStrchr(string, '\"')) {
7711 if (xmlStrchr(string, '\'')) {
7713 xmlGenericError(xmlGenericErrorContext,
7714 "xmlBufferWriteQuotedString: string contains quote and double-quotes !\n");
7716 xmlBufferCCat(buf, "\"");
7717 base = cur = string;
7721 xmlBufferAdd(buf, base, cur - base);
7722 xmlBufferAdd(buf, BAD_CAST """, 6);
7731 xmlBufferAdd(buf, base, cur - base);
7732 xmlBufferCCat(buf, "\"");
7735 xmlBufferCCat(buf, "\'");
7736 xmlBufferCat(buf, string);
7737 xmlBufferCCat(buf, "\'");
7740 xmlBufferCCat(buf, "\"");
7741 xmlBufferCat(buf, string);
7742 xmlBufferCCat(buf, "\"");
7748 * xmlGetDocCompressMode:
7749 * @doc: the document
7751 * get the compression ratio for a document, ZLIB based
7752 * Returns 0 (uncompressed) to 9 (max compression)
7755 xmlGetDocCompressMode (const xmlDoc *doc) {
7756 if (doc == NULL) return(-1);
7757 return(doc->compression);
7761 * xmlSetDocCompressMode:
7762 * @doc: the document
7763 * @mode: the compression ratio
7765 * set the compression ratio for a document, ZLIB based
7766 * Correct values: 0 (uncompressed) to 9 (max compression)
7769 xmlSetDocCompressMode (xmlDocPtr doc, int mode) {
7770 if (doc == NULL) return;
7771 if (mode < 0) doc->compression = 0;
7772 else if (mode > 9) doc->compression = 9;
7773 else doc->compression = mode;
7777 * xmlGetCompressMode:
7779 * get the default compression mode used, ZLIB based.
7780 * Returns 0 (uncompressed) to 9 (max compression)
7783 xmlGetCompressMode(void)
7785 return (xmlCompressMode);
7789 * xmlSetCompressMode:
7790 * @mode: the compression ratio
7792 * set the default compression mode used, ZLIB based
7793 * Correct values: 0 (uncompressed) to 9 (max compression)
7796 xmlSetCompressMode(int mode) {
7797 if (mode < 0) xmlCompressMode = 0;
7798 else if (mode > 9) xmlCompressMode = 9;
7799 else xmlCompressMode = mode;
7802 #define XML_TREE_NSMAP_PARENT -1
7803 #define XML_TREE_NSMAP_XML -2
7804 #define XML_TREE_NSMAP_DOC -3
7805 #define XML_TREE_NSMAP_CUSTOM -4
7807 typedef struct xmlNsMapItem *xmlNsMapItemPtr;
7808 struct xmlNsMapItem {
7809 xmlNsMapItemPtr next;
7810 xmlNsMapItemPtr prev;
7811 xmlNsPtr oldNs; /* old ns decl reference */
7812 xmlNsPtr newNs; /* new ns decl reference */
7813 int shadowDepth; /* Shadowed at this depth */
7816 * >= 0 == @node's ns-decls
7817 * -1 == @parent's ns-decls
7818 * -2 == the doc->oldNs XML ns-decl
7819 * -3 == the doc->oldNs storage ns-decls
7820 * -4 == ns-decls provided via custom ns-handling
7825 typedef struct xmlNsMap *xmlNsMapPtr;
7827 xmlNsMapItemPtr first;
7828 xmlNsMapItemPtr last;
7829 xmlNsMapItemPtr pool;
7832 #define XML_NSMAP_NOTEMPTY(m) (((m) != NULL) && ((m)->first != NULL))
7833 #define XML_NSMAP_FOREACH(m, i) for (i = (m)->first; i != NULL; i = (i)->next)
7834 #define XML_NSMAP_POP(m, i) \
7836 (m)->last = (i)->prev; \
7837 if ((m)->last == NULL) \
7838 (m)->first = NULL; \
7840 (m)->last->next = NULL; \
7841 (i)->next = (m)->pool; \
7845 * xmlDOMWrapNsMapFree:
7851 xmlDOMWrapNsMapFree(xmlNsMapPtr nsmap)
7853 xmlNsMapItemPtr cur, tmp;
7858 while (cur != NULL) {
7864 while (cur != NULL) {
7873 * xmlDOMWrapNsMapAddItem:
7875 * @oldNs: the old ns-struct
7876 * @newNs: the new ns-struct
7877 * @depth: depth and ns-kind information
7879 * Adds an ns-mapping item.
7881 static xmlNsMapItemPtr
7882 xmlDOMWrapNsMapAddItem(xmlNsMapPtr *nsmap, int position,
7883 xmlNsPtr oldNs, xmlNsPtr newNs, int depth)
7885 xmlNsMapItemPtr ret;
7890 if ((position != -1) && (position != 0))
7896 * Create the ns-map.
7898 map = (xmlNsMapPtr) xmlMalloc(sizeof(struct xmlNsMap));
7900 xmlTreeErrMemory("allocating namespace map");
7903 memset(map, 0, sizeof(struct xmlNsMap));
7907 if (map->pool != NULL) {
7909 * Reuse an item from the pool.
7912 map->pool = ret->next;
7913 memset(ret, 0, sizeof(struct xmlNsMapItem));
7916 * Create a new item.
7918 ret = (xmlNsMapItemPtr) xmlMalloc(sizeof(struct xmlNsMapItem));
7920 xmlTreeErrMemory("allocating namespace map item");
7923 memset(ret, 0, sizeof(struct xmlNsMapItem));
7926 if (map->first == NULL) {
7932 } else if (position == -1) {
7936 ret->prev = map->last;
7937 map->last->next = ret;
7939 } else if (position == 0) {
7941 * Set on first position.
7943 map->first->prev = ret;
7944 ret->next = map->first;
7950 ret->shadowDepth = -1;
7956 * xmlDOMWrapStoreNs:
7958 * @nsName: the namespace name
7959 * @prefix: the prefix
7961 * Creates or reuses an xmlNs struct on doc->oldNs with
7962 * the given prefix and namespace name.
7964 * Returns the aquired ns struct or NULL in case of an API
7965 * or internal error.
7968 xmlDOMWrapStoreNs(xmlDocPtr doc,
7969 const xmlChar *nsName,
7970 const xmlChar *prefix)
7976 ns = xmlTreeEnsureXMLDecl(doc);
7979 if (ns->next != NULL) {
7982 while (ns != NULL) {
7983 if (((ns->prefix == prefix) ||
7984 xmlStrEqual(ns->prefix, prefix)) &&
7985 xmlStrEqual(ns->href, nsName)) {
7988 if (ns->next == NULL)
7995 ns->next = xmlNewNs(NULL, nsName, prefix);
8002 * xmlDOMWrapNewCtxt:
8004 * Allocates and initializes a new DOM-wrapper context.
8006 * Returns the xmlDOMWrapCtxtPtr or NULL in case of an internal error.
8009 xmlDOMWrapNewCtxt(void)
8011 xmlDOMWrapCtxtPtr ret;
8013 ret = xmlMalloc(sizeof(xmlDOMWrapCtxt));
8015 xmlTreeErrMemory("allocating DOM-wrapper context");
8018 memset(ret, 0, sizeof(xmlDOMWrapCtxt));
8023 * xmlDOMWrapFreeCtxt:
8024 * @ctxt: the DOM-wrapper context
8026 * Frees the DOM-wrapper context.
8029 xmlDOMWrapFreeCtxt(xmlDOMWrapCtxtPtr ctxt)
8033 if (ctxt->namespaceMap != NULL)
8034 xmlDOMWrapNsMapFree((xmlNsMapPtr) ctxt->namespaceMap);
8036 * TODO: Store the namespace map in the context.
8042 * xmlTreeLookupNsListByPrefix:
8043 * @nsList: a list of ns-structs
8044 * @prefix: the searched prefix
8046 * Searches for a ns-decl with the given prefix in @nsList.
8048 * Returns the ns-decl if found, NULL if not found and on
8052 xmlTreeNSListLookupByPrefix(xmlNsPtr nsList, const xmlChar *prefix)
8060 if ((prefix == ns->prefix) ||
8061 xmlStrEqual(prefix, ns->prefix)) {
8065 } while (ns != NULL);
8072 * xmlDOMWrapNSNormGatherInScopeNs:
8073 * @map: the namespace map
8074 * @node: the node to start with
8076 * Puts in-scope namespaces into the ns-map.
8078 * Returns 0 on success, -1 on API or internal errors.
8081 xmlDOMWrapNSNormGatherInScopeNs(xmlNsMapPtr *map,
8089 if ((map == NULL) || (*map != NULL))
8091 if ((node == NULL) || (node->type == XML_NAMESPACE_DECL))
8094 * Get in-scope ns-decls of @parent.
8097 while ((cur != NULL) && (cur != (xmlNodePtr) cur->doc)) {
8098 if (cur->type == XML_ELEMENT_NODE) {
8099 if (cur->nsDef != NULL) {
8103 if (XML_NSMAP_NOTEMPTY(*map)) {
8105 * Skip shadowed prefixes.
8107 XML_NSMAP_FOREACH(*map, mi) {
8108 if ((ns->prefix == mi->newNs->prefix) ||
8109 xmlStrEqual(ns->prefix, mi->newNs->prefix)) {
8118 mi = xmlDOMWrapNsMapAddItem(map, 0, NULL,
8119 ns, XML_TREE_NSMAP_PARENT);
8123 mi->shadowDepth = 0;
8125 } while (ns != NULL);
8134 * XML_TREE_ADOPT_STR: If we have a dest-dict, put @str in the dict;
8135 * otherwise copy it, when it was in the source-dict.
8137 #define XML_TREE_ADOPT_STR(str) \
8138 if (adoptStr && (str != NULL)) { \
8139 if (destDoc->dict) { \
8140 const xmlChar *old = str; \
8141 str = xmlDictLookup(destDoc->dict, str, -1); \
8142 if ((sourceDoc == NULL) || (sourceDoc->dict == NULL) || \
8143 (!xmlDictOwns(sourceDoc->dict, old))) \
8144 xmlFree((char *)old); \
8145 } else if ((sourceDoc) && (sourceDoc->dict) && \
8146 xmlDictOwns(sourceDoc->dict, str)) { \
8147 str = BAD_CAST xmlStrdup(str); \
8152 * XML_TREE_ADOPT_STR_2: If @str was in the source-dict, then
8153 * put it in dest-dict or copy it.
8155 #define XML_TREE_ADOPT_STR_2(str) \
8156 if (adoptStr && (str != NULL) && (sourceDoc != NULL) && \
8157 (sourceDoc->dict != NULL) && \
8158 xmlDictOwns(sourceDoc->dict, cur->content)) { \
8159 if (destDoc->dict) \
8160 cur->content = (xmlChar *) \
8161 xmlDictLookup(destDoc->dict, cur->content, -1); \
8163 cur->content = xmlStrdup(BAD_CAST cur->content); \
8167 * xmlDOMWrapNSNormAddNsMapItem2:
8169 * For internal use. Adds a ns-decl mapping.
8171 * Returns 0 on success, -1 on internal errors.
8174 xmlDOMWrapNSNormAddNsMapItem2(xmlNsPtr **list, int *size, int *number,
8175 xmlNsPtr oldNs, xmlNsPtr newNs)
8177 if (*list == NULL) {
8178 *list = (xmlNsPtr *) xmlMalloc(6 * sizeof(xmlNsPtr));
8179 if (*list == NULL) {
8180 xmlTreeErrMemory("alloc ns map item");
8185 } else if ((*number) >= (*size)) {
8187 *list = (xmlNsPtr *) xmlRealloc(*list,
8188 (*size) * 2 * sizeof(xmlNsPtr));
8189 if (*list == NULL) {
8190 xmlTreeErrMemory("realloc ns map item");
8194 (*list)[2 * (*number)] = oldNs;
8195 (*list)[2 * (*number) +1] = newNs;
8201 * xmlDOMWrapRemoveNode:
8202 * @ctxt: a DOM wrapper context
8204 * @node: the node to be removed.
8205 * @options: set of options, unused at the moment
8207 * Unlinks the given node from its owner.
8208 * This will substitute ns-references to node->nsDef for
8209 * ns-references to doc->oldNs, thus ensuring the removed
8210 * branch to be autark wrt ns-references.
8212 * NOTE: This function was not intensively tested.
8214 * Returns 0 on success, 1 if the node is not supported,
8215 * -1 on API and internal errors.
8218 xmlDOMWrapRemoveNode(xmlDOMWrapCtxtPtr ctxt, xmlDocPtr doc,
8219 xmlNodePtr node, int options ATTRIBUTE_UNUSED)
8221 xmlNsPtr *list = NULL;
8222 int sizeList, nbList, i, j;
8225 if ((node == NULL) || (doc == NULL) || (node->doc != doc))
8228 /* TODO: 0 or -1 ? */
8229 if (node->parent == NULL)
8232 switch (node->type) {
8234 case XML_CDATA_SECTION_NODE:
8235 case XML_ENTITY_REF_NODE:
8237 case XML_COMMENT_NODE:
8238 xmlUnlinkNode(node);
8240 case XML_ELEMENT_NODE:
8241 case XML_ATTRIBUTE_NODE:
8246 xmlUnlinkNode(node);
8248 * Save out-of-scope ns-references in doc->oldNs.
8251 switch (node->type) {
8252 case XML_ELEMENT_NODE:
8253 if ((ctxt == NULL) && (node->nsDef != NULL)) {
8256 if (xmlDOMWrapNSNormAddNsMapItem2(&list, &sizeList,
8257 &nbList, ns, ns) == -1)
8258 goto internal_error;
8260 } while (ns != NULL);
8262 /* Falls through. */
8263 case XML_ATTRIBUTE_NODE:
8264 if (node->ns != NULL) {
8269 for (i = 0, j = 0; i < nbList; i++, j += 2) {
8270 if (node->ns == list[j]) {
8271 node->ns = list[++j];
8283 * Add to doc's oldNs.
8285 ns = xmlDOMWrapStoreNs(doc, node->ns->href,
8288 goto internal_error;
8294 if (xmlDOMWrapNSNormAddNsMapItem2(&list, &sizeList,
8295 &nbList, node->ns, ns) == -1)
8296 goto internal_error;
8300 if ((node->type == XML_ELEMENT_NODE) &&
8301 (node->properties != NULL)) {
8302 node = (xmlNodePtr) node->properties;
8310 if ((node->type == XML_ELEMENT_NODE) &&
8311 (node->children != NULL)) {
8312 node = node->children;
8318 if (node->next != NULL)
8321 node = node->parent;
8324 } while (node != NULL);
8337 * xmlSearchNsByNamespaceStrict:
8338 * @doc: the document
8339 * @node: the start node
8340 * @nsName: the searched namespace name
8341 * @retNs: the resulting ns-decl
8342 * @prefixed: if the found ns-decl must have a prefix (for attributes)
8344 * Dynamically searches for a ns-declaration which matches
8345 * the given @nsName in the ancestor-or-self axis of @node.
8347 * Returns 1 if a ns-decl was found, 0 if not and -1 on API
8348 * and internal errors.
8351 xmlSearchNsByNamespaceStrict(xmlDocPtr doc, xmlNodePtr node,
8352 const xmlChar* nsName,
8353 xmlNsPtr *retNs, int prefixed)
8355 xmlNodePtr cur, prev = NULL, out = NULL;
8356 xmlNsPtr ns, prevns;
8358 if ((doc == NULL) || (nsName == NULL) || (retNs == NULL))
8360 if ((node == NULL) || (node->type == XML_NAMESPACE_DECL))
8364 if (xmlStrEqual(nsName, XML_XML_NAMESPACE)) {
8365 *retNs = xmlTreeEnsureXMLDecl(doc);
8372 if (cur->type == XML_ELEMENT_NODE) {
8373 if (cur->nsDef != NULL) {
8374 for (ns = cur->nsDef; ns != NULL; ns = ns->next) {
8375 if (prefixed && (ns->prefix == NULL))
8379 * Check the last level of ns-decls for a
8382 prevns = prev->nsDef;
8384 if ((prevns->prefix == ns->prefix) ||
8385 ((prevns->prefix != NULL) &&
8386 (ns->prefix != NULL) &&
8387 xmlStrEqual(prevns->prefix, ns->prefix))) {
8393 prevns = prevns->next;
8394 } while (prevns != NULL);
8399 * Ns-name comparison.
8401 if ((nsName == ns->href) ||
8402 xmlStrEqual(nsName, ns->href)) {
8404 * At this point the prefix can only be shadowed,
8405 * if we are the the (at least) 3rd level of
8411 ret = xmlNsInScope(doc, node, prev, ns->prefix);
8415 * TODO: Should we try to find a matching ns-name
8416 * only once? This here keeps on searching.
8417 * I think we should try further since, there might
8418 * be an other matching ns-decl with an unshadowed
8431 } else if ((cur->type == XML_ENTITY_NODE) ||
8432 (cur->type == XML_ENTITY_DECL))
8435 } while ((cur != NULL) && (cur->doc != (xmlDocPtr) cur));
8440 * xmlSearchNsByPrefixStrict:
8441 * @doc: the document
8442 * @node: the start node
8443 * @prefix: the searched namespace prefix
8444 * @retNs: the resulting ns-decl
8446 * Dynamically searches for a ns-declaration which matches
8447 * the given @nsName in the ancestor-or-self axis of @node.
8449 * Returns 1 if a ns-decl was found, 0 if not and -1 on API
8450 * and internal errors.
8453 xmlSearchNsByPrefixStrict(xmlDocPtr doc, xmlNodePtr node,
8454 const xmlChar* prefix,
8460 if ((doc == NULL) || (node == NULL) || (node->type == XML_NAMESPACE_DECL))
8465 if (IS_STR_XML(prefix)) {
8467 *retNs = xmlTreeEnsureXMLDecl(doc);
8475 if (cur->type == XML_ELEMENT_NODE) {
8476 if (cur->nsDef != NULL) {
8479 if ((prefix == ns->prefix) ||
8480 xmlStrEqual(prefix, ns->prefix))
8483 * Disabled namespaces, e.g. xmlns:abc="".
8485 if (ns->href == NULL)
8492 } while (ns != NULL);
8494 } else if ((cur->type == XML_ENTITY_NODE) ||
8495 (cur->type == XML_ENTITY_DECL))
8498 } while ((cur != NULL) && (cur->doc != (xmlDocPtr) cur));
8503 * xmlDOMWrapNSNormDeclareNsForced:
8505 * @elem: the element-node to declare on
8506 * @nsName: the namespace-name of the ns-decl
8507 * @prefix: the preferred prefix of the ns-decl
8508 * @checkShadow: ensure that the new ns-decl doesn't shadow ancestor ns-decls
8510 * Declares a new namespace on @elem. It tries to use the
8511 * given @prefix; if a ns-decl with the given prefix is already existent
8512 * on @elem, it will generate an other prefix.
8514 * Returns 1 if a ns-decl was found, 0 if not and -1 on API
8515 * and internal errors.
8518 xmlDOMWrapNSNormDeclareNsForced(xmlDocPtr doc,
8520 const xmlChar *nsName,
8521 const xmlChar *prefix,
8527 const xmlChar *pref;
8530 if ((doc == NULL) || (elem == NULL) || (elem->type != XML_ELEMENT_NODE))
8533 * Create a ns-decl on @anchor.
8538 * Lookup whether the prefix is unused in elem's ns-decls.
8540 if ((elem->nsDef != NULL) &&
8541 (xmlTreeNSListLookupByPrefix(elem->nsDef, pref) != NULL))
8542 goto ns_next_prefix;
8543 if (checkShadow && elem->parent &&
8544 ((xmlNodePtr) elem->parent->doc != elem->parent)) {
8546 * Does it shadow ancestor ns-decls?
8548 if (xmlSearchNsByPrefixStrict(doc, elem->parent, pref, NULL) == 1)
8549 goto ns_next_prefix;
8551 ret = xmlNewNs(NULL, nsName, pref);
8554 if (elem->nsDef == NULL)
8557 xmlNsPtr ns2 = elem->nsDef;
8558 while (ns2->next != NULL)
8567 if (prefix == NULL) {
8568 snprintf((char *) buf, sizeof(buf),
8571 snprintf((char *) buf, sizeof(buf),
8572 "%.30s_%d", (char *)prefix, counter);
8573 pref = BAD_CAST buf;
8578 * xmlDOMWrapNSNormAquireNormalizedNs:
8580 * @elem: the element-node to declare namespaces on
8581 * @ns: the ns-struct to use for the search
8582 * @retNs: the found/created ns-struct
8583 * @nsMap: the ns-map
8584 * @depth: the current tree depth
8585 * @ancestorsOnly: search in ancestor ns-decls only
8586 * @prefixed: if the searched ns-decl must have a prefix (for attributes)
8588 * Searches for a matching ns-name in the ns-decls of @nsMap, if not
8589 * found it will either declare it on @elem, or store it in doc->oldNs.
8590 * If a new ns-decl needs to be declared on @elem, it tries to use the
8591 * @ns->prefix for it, if this prefix is already in use on @elem, it will
8592 * change the prefix or the new ns-decl.
8594 * Returns 0 if succeeded, -1 otherwise and on API/internal errors.
8597 xmlDOMWrapNSNormAquireNormalizedNs(xmlDocPtr doc,
8609 if ((doc == NULL) || (ns == NULL) || (retNs == NULL) ||
8615 * Handle XML namespace.
8617 if (IS_STR_XML(ns->prefix)) {
8619 * Insert XML namespace mapping.
8621 *retNs = xmlTreeEnsureXMLDecl(doc);
8627 * If the search should be done in ancestors only and no
8628 * @elem (the first ancestor) was specified, then skip the search.
8630 if ((XML_NSMAP_NOTEMPTY(*nsMap)) &&
8631 (! (ancestorsOnly && (elem == NULL))))
8634 * Try to find an equal ns-name in in-scope ns-decls.
8636 XML_NSMAP_FOREACH(*nsMap, mi) {
8637 if ((mi->depth >= XML_TREE_NSMAP_PARENT) &&
8639 * ancestorsOnly: This should be turned on to gain speed,
8640 * if one knows that the branch itself was already
8641 * ns-wellformed and no stale references existed.
8642 * I.e. it searches in the ancestor axis only.
8644 ((! ancestorsOnly) || (mi->depth == XML_TREE_NSMAP_PARENT)) &&
8645 /* Skip shadowed prefixes. */
8646 (mi->shadowDepth == -1) &&
8647 /* Skip xmlns="" or xmlns:foo="". */
8648 ((mi->newNs->href != NULL) &&
8649 (mi->newNs->href[0] != 0)) &&
8650 /* Ensure a prefix if wanted. */
8651 ((! prefixed) || (mi->newNs->prefix != NULL)) &&
8653 ((mi->newNs->href == ns->href) ||
8654 xmlStrEqual(mi->newNs->href, ns->href))) {
8655 /* Set the mapping. */
8663 * No luck, the namespace is out of scope or shadowed.
8669 * Store ns-decls in "oldNs" of the document-node.
8671 tmpns = xmlDOMWrapStoreNs(doc, ns->href, ns->prefix);
8677 if (xmlDOMWrapNsMapAddItem(nsMap, -1, ns,
8678 tmpns, XML_TREE_NSMAP_DOC) == NULL) {
8686 tmpns = xmlDOMWrapNSNormDeclareNsForced(doc, elem, ns->href,
8691 if (*nsMap != NULL) {
8693 * Does it shadow ancestor ns-decls?
8695 XML_NSMAP_FOREACH(*nsMap, mi) {
8696 if ((mi->depth < depth) &&
8697 (mi->shadowDepth == -1) &&
8698 ((ns->prefix == mi->newNs->prefix) ||
8699 xmlStrEqual(ns->prefix, mi->newNs->prefix))) {
8703 mi->shadowDepth = depth;
8708 if (xmlDOMWrapNsMapAddItem(nsMap, -1, ns, tmpns, depth) == NULL) {
8718 XML_DOM_RECONNS_REMOVEREDUND = 1<<0
8719 } xmlDOMReconcileNSOptions;
8722 * xmlDOMWrapReconcileNamespaces:
8723 * @ctxt: DOM wrapper context, unused at the moment
8724 * @elem: the element-node
8725 * @options: option flags
8727 * Ensures that ns-references point to ns-decls hold on element-nodes.
8728 * Ensures that the tree is namespace wellformed by creating additional
8729 * ns-decls where needed. Note that, since prefixes of already existent
8730 * ns-decls can be shadowed by this process, it could break QNames in
8731 * attribute values or element content.
8733 * NOTE: This function was not intensively tested.
8735 * Returns 0 if succeeded, -1 otherwise and on API/internal errors.
8739 xmlDOMWrapReconcileNamespaces(xmlDOMWrapCtxtPtr ctxt ATTRIBUTE_UNUSED,
8743 int depth = -1, adoptns = 0, parnsdone = 0;
8744 xmlNsPtr ns, prevns;
8746 xmlNodePtr cur, curElem = NULL;
8747 xmlNsMapPtr nsMap = NULL;
8748 xmlNsMapItemPtr /* topmi = NULL, */ mi;
8749 /* @ancestorsOnly should be set by an option flag. */
8750 int ancestorsOnly = 0;
8751 int optRemoveRedundantNS =
8752 ((xmlDOMReconcileNSOptions) options & XML_DOM_RECONNS_REMOVEREDUND) ? 1 : 0;
8753 xmlNsPtr *listRedund = NULL;
8754 int sizeRedund = 0, nbRedund = 0, ret, i, j;
8756 if ((elem == NULL) || (elem->doc == NULL) ||
8757 (elem->type != XML_ELEMENT_NODE))
8763 switch (cur->type) {
8764 case XML_ELEMENT_NODE:
8769 * Namespace declarations.
8771 if (cur->nsDef != NULL) {
8774 while (ns != NULL) {
8776 if ((elem->parent) &&
8777 ((xmlNodePtr) elem->parent->doc != elem->parent)) {
8779 * Gather ancestor in-scope ns-decls.
8781 if (xmlDOMWrapNSNormGatherInScopeNs(&nsMap,
8782 elem->parent) == -1)
8783 goto internal_error;
8789 * Lookup the ns ancestor-axis for equal ns-decls in scope.
8791 if (optRemoveRedundantNS && XML_NSMAP_NOTEMPTY(nsMap)) {
8792 XML_NSMAP_FOREACH(nsMap, mi) {
8793 if ((mi->depth >= XML_TREE_NSMAP_PARENT) &&
8794 (mi->shadowDepth == -1) &&
8795 ((ns->prefix == mi->newNs->prefix) ||
8796 xmlStrEqual(ns->prefix, mi->newNs->prefix)) &&
8797 ((ns->href == mi->newNs->href) ||
8798 xmlStrEqual(ns->href, mi->newNs->href)))
8801 * A redundant ns-decl was found.
8802 * Add it to the list of redundant ns-decls.
8804 if (xmlDOMWrapNSNormAddNsMapItem2(&listRedund,
8805 &sizeRedund, &nbRedund, ns, mi->newNs) == -1)
8806 goto internal_error;
8808 * Remove the ns-decl from the element-node.
8811 prevns->next = ns->next;
8813 cur->nsDef = ns->next;
8820 * Skip ns-references handling if the referenced
8821 * ns-decl is declared on the same element.
8823 if ((cur->ns != NULL) && adoptns && (cur->ns == ns))
8826 * Does it shadow any ns-decl?
8828 if (XML_NSMAP_NOTEMPTY(nsMap)) {
8829 XML_NSMAP_FOREACH(nsMap, mi) {
8830 if ((mi->depth >= XML_TREE_NSMAP_PARENT) &&
8831 (mi->shadowDepth == -1) &&
8832 ((ns->prefix == mi->newNs->prefix) ||
8833 xmlStrEqual(ns->prefix, mi->newNs->prefix))) {
8835 mi->shadowDepth = depth;
8842 if (xmlDOMWrapNsMapAddItem(&nsMap, -1, ns, ns,
8844 goto internal_error;
8853 /* Falls through. */
8854 case XML_ATTRIBUTE_NODE:
8855 /* No ns, no fun. */
8856 if (cur->ns == NULL)
8860 if ((elem->parent) &&
8861 ((xmlNodePtr) elem->parent->doc != elem->parent)) {
8862 if (xmlDOMWrapNSNormGatherInScopeNs(&nsMap,
8863 elem->parent) == -1)
8864 goto internal_error;
8869 * Adjust the reference if this was a redundant ns-decl.
8872 for (i = 0, j = 0; i < nbRedund; i++, j += 2) {
8873 if (cur->ns == listRedund[j]) {
8874 cur->ns = listRedund[++j];
8880 * Adopt ns-references.
8882 if (XML_NSMAP_NOTEMPTY(nsMap)) {
8884 * Search for a mapping.
8886 XML_NSMAP_FOREACH(nsMap, mi) {
8887 if ((mi->shadowDepth == -1) &&
8888 (cur->ns == mi->oldNs)) {
8890 cur->ns = mi->newNs;
8896 * Aquire a normalized ns-decl and add it to the map.
8898 if (xmlDOMWrapNSNormAquireNormalizedNs(doc, curElem,
8902 (cur->type == XML_ATTRIBUTE_NODE) ? 1 : 0) == -1)
8903 goto internal_error;
8907 if ((cur->type == XML_ELEMENT_NODE) &&
8908 (cur->properties != NULL)) {
8910 * Process attributes.
8912 cur = (xmlNodePtr) cur->properties;
8920 if ((cur->type == XML_ELEMENT_NODE) &&
8921 (cur->children != NULL)) {
8923 * Process content of element-nodes only.
8925 cur = cur->children;
8931 if (cur->type == XML_ELEMENT_NODE) {
8932 if (XML_NSMAP_NOTEMPTY(nsMap)) {
8936 while ((nsMap->last != NULL) &&
8937 (nsMap->last->depth >= depth))
8939 XML_NSMAP_POP(nsMap, mi)
8944 XML_NSMAP_FOREACH(nsMap, mi) {
8945 if (mi->shadowDepth >= depth)
8946 mi->shadowDepth = -1;
8951 if (cur->next != NULL)
8954 if (cur->type == XML_ATTRIBUTE_NODE) {
8961 } while (cur != NULL);
8969 for (i = 0, j = 0; i < nbRedund; i++, j += 2) {
8970 xmlFreeNs(listRedund[j]);
8972 xmlFree(listRedund);
8975 xmlDOMWrapNsMapFree(nsMap);
8980 * xmlDOMWrapAdoptBranch:
8981 * @ctxt: the optional context for custom processing
8982 * @sourceDoc: the optional sourceDoc
8983 * @node: the element-node to start with
8984 * @destDoc: the destination doc for adoption
8985 * @destParent: the optional new parent of @node in @destDoc
8986 * @options: option flags
8988 * Ensures that ns-references point to @destDoc: either to
8989 * elements->nsDef entries if @destParent is given, or to
8990 * @destDoc->oldNs otherwise.
8991 * If @destParent is given, it ensures that the tree is namespace
8992 * wellformed by creating additional ns-decls where needed.
8993 * Note that, since prefixes of already existent ns-decls can be
8994 * shadowed by this process, it could break QNames in attribute
8995 * values or element content.
8997 * NOTE: This function was not intensively tested.
8999 * Returns 0 if succeeded, -1 otherwise and on API/internal errors.
9002 xmlDOMWrapAdoptBranch(xmlDOMWrapCtxtPtr ctxt,
9003 xmlDocPtr sourceDoc,
9006 xmlNodePtr destParent,
9007 int options ATTRIBUTE_UNUSED)
9010 xmlNodePtr cur, curElem = NULL;
9011 xmlNsMapPtr nsMap = NULL;
9014 int depth = -1, adoptStr = 1;
9015 /* gather @parent's ns-decls. */
9017 /* @ancestorsOnly should be set per option. */
9018 int ancestorsOnly = 0;
9021 * Optimize string adoption for equal or none dicts.
9023 if ((sourceDoc != NULL) &&
9024 (sourceDoc->dict == destDoc->dict))
9030 * Get the ns-map from the context if available.
9033 nsMap = (xmlNsMapPtr) ctxt->namespaceMap;
9035 * Disable search for ns-decls in the parent-axis of the
9036 * desination element, if:
9037 * 1) there's no destination parent
9038 * 2) custom ns-reference handling is used
9040 if ((destParent == NULL) ||
9041 (ctxt && ctxt->getNsForNodeFunc))
9048 if ((cur != NULL) && (cur->type == XML_NAMESPACE_DECL))
9049 goto internal_error;
9051 while (cur != NULL) {
9053 * Paranoid source-doc sanity check.
9055 if (cur->doc != sourceDoc) {
9057 * We'll assume XIncluded nodes if the doc differs.
9058 * TODO: Do we need to reconciliate XIncluded nodes?
9059 * This here skips XIncluded nodes and tries to handle
9062 if (cur->next == NULL)
9066 if ((cur->type == XML_XINCLUDE_END) ||
9067 (cur->doc == node->doc))
9069 } while (cur->next != NULL);
9071 if (cur->doc != node->doc)
9075 switch (cur->type) {
9076 case XML_XINCLUDE_START:
9077 case XML_XINCLUDE_END:
9082 case XML_ELEMENT_NODE:
9086 * Namespace declarations.
9087 * - ns->href and ns->prefix are never in the dict, so
9088 * we need not move the values over to the destination dict.
9089 * - Note that for custom handling of ns-references,
9090 * the ns-decls need not be stored in the ns-map,
9091 * since they won't be referenced by node->ns.
9094 ((ctxt == NULL) || (ctxt->getNsForNodeFunc == NULL)))
9098 * Gather @parent's in-scope ns-decls.
9100 if (xmlDOMWrapNSNormGatherInScopeNs(&nsMap,
9102 goto internal_error;
9105 for (ns = cur->nsDef; ns != NULL; ns = ns->next) {
9107 * NOTE: ns->prefix and ns->href are never in the dict.
9108 * XML_TREE_ADOPT_STR(ns->prefix)
9109 * XML_TREE_ADOPT_STR(ns->href)
9112 * Does it shadow any ns-decl?
9114 if (XML_NSMAP_NOTEMPTY(nsMap)) {
9115 XML_NSMAP_FOREACH(nsMap, mi) {
9116 if ((mi->depth >= XML_TREE_NSMAP_PARENT) &&
9117 (mi->shadowDepth == -1) &&
9118 ((ns->prefix == mi->newNs->prefix) ||
9119 xmlStrEqual(ns->prefix,
9120 mi->newNs->prefix))) {
9122 mi->shadowDepth = depth;
9129 if (xmlDOMWrapNsMapAddItem(&nsMap, -1,
9130 ns, ns, depth) == NULL)
9131 goto internal_error;
9134 /* Falls through. */
9135 case XML_ATTRIBUTE_NODE:
9136 /* No namespace, no fun. */
9137 if (cur->ns == NULL)
9141 if (xmlDOMWrapNSNormGatherInScopeNs(&nsMap,
9143 goto internal_error;
9147 * Adopt ns-references.
9149 if (XML_NSMAP_NOTEMPTY(nsMap)) {
9151 * Search for a mapping.
9153 XML_NSMAP_FOREACH(nsMap, mi) {
9154 if ((mi->shadowDepth == -1) &&
9155 (cur->ns == mi->oldNs)) {
9157 cur->ns = mi->newNs;
9163 * No matching namespace in scope. We need a new one.
9165 if ((ctxt) && (ctxt->getNsForNodeFunc)) {
9167 * User-defined behaviour.
9169 ns = ctxt->getNsForNodeFunc(ctxt, cur,
9170 cur->ns->href, cur->ns->prefix);
9172 * Insert mapping if ns is available; it's the users fault
9175 if (xmlDOMWrapNsMapAddItem(&nsMap, -1,
9176 cur->ns, ns, XML_TREE_NSMAP_CUSTOM) == NULL)
9177 goto internal_error;
9181 * Aquire a normalized ns-decl and add it to the map.
9183 if (xmlDOMWrapNSNormAquireNormalizedNs(destDoc,
9184 /* ns-decls on curElem or on destDoc->oldNs */
9185 destParent ? curElem : NULL,
9189 /* ns-decls must be prefixed for attributes. */
9190 (cur->type == XML_ATTRIBUTE_NODE) ? 1 : 0) == -1)
9191 goto internal_error;
9196 * Further node properties.
9197 * TODO: Is this all?
9199 XML_TREE_ADOPT_STR(cur->name)
9200 if (cur->type == XML_ELEMENT_NODE) {
9207 if (cur->properties != NULL) {
9209 * Process first attribute node.
9211 cur = (xmlNodePtr) cur->properties;
9218 if ((sourceDoc != NULL) &&
9219 (((xmlAttrPtr) cur)->atype == XML_ATTRIBUTE_ID))
9221 xmlRemoveID(sourceDoc, (xmlAttrPtr) cur);
9223 ((xmlAttrPtr) cur)->atype = 0;
9224 ((xmlAttrPtr) cur)->psvi = NULL;
9228 case XML_CDATA_SECTION_NODE:
9230 * This puts the content in the dest dict, only if
9231 * it was previously in the source dict.
9233 XML_TREE_ADOPT_STR_2(cur->content)
9235 case XML_ENTITY_REF_NODE:
9237 * Remove reference to the entitity-node.
9239 cur->content = NULL;
9240 cur->children = NULL;
9242 if ((destDoc->intSubset) || (destDoc->extSubset)) {
9245 * Assign new entity-node if available.
9247 ent = xmlGetDocEntity(destDoc, cur->name);
9249 cur->content = ent->content;
9250 cur->children = (xmlNodePtr) ent;
9251 cur->last = (xmlNodePtr) ent;
9256 XML_TREE_ADOPT_STR(cur->name)
9257 XML_TREE_ADOPT_STR_2(cur->content)
9259 case XML_COMMENT_NODE:
9262 goto internal_error;
9267 if (cur->children != NULL) {
9268 cur = cur->children;
9275 if ((cur->type == XML_ELEMENT_NODE) ||
9276 (cur->type == XML_XINCLUDE_START) ||
9277 (cur->type == XML_XINCLUDE_END))
9280 * TODO: Do we expect nsDefs on XML_XINCLUDE_START?
9282 if (XML_NSMAP_NOTEMPTY(nsMap)) {
9286 while ((nsMap->last != NULL) &&
9287 (nsMap->last->depth >= depth))
9289 XML_NSMAP_POP(nsMap, mi)
9294 XML_NSMAP_FOREACH(nsMap, mi) {
9295 if (mi->shadowDepth >= depth)
9296 mi->shadowDepth = -1;
9301 if (cur->next != NULL)
9303 else if ((cur->type == XML_ATTRIBUTE_NODE) &&
9304 (cur->parent->children != NULL))
9306 cur = cur->parent->children;
9322 if (nsMap != NULL) {
9323 if ((ctxt) && (ctxt->namespaceMap == nsMap)) {
9325 * Just cleanup the map but don't free.
9329 nsMap->last->next = nsMap->pool;
9330 nsMap->pool = nsMap->first;
9331 nsMap->first = NULL;
9334 xmlDOMWrapNsMapFree(nsMap);
9340 * xmlDOMWrapCloneNode:
9341 * @ctxt: the optional context for custom processing
9342 * @sourceDoc: the optional sourceDoc
9343 * @node: the node to start with
9344 * @resNode: the clone of the given @node
9345 * @destDoc: the destination doc
9346 * @destParent: the optional new parent of @node in @destDoc
9347 * @deep: descend into child if set
9348 * @options: option flags
9350 * References of out-of scope ns-decls are remapped to point to @destDoc:
9351 * 1) If @destParent is given, then nsDef entries on element-nodes are used
9352 * 2) If *no* @destParent is given, then @destDoc->oldNs entries are used.
9353 * This is the case when you don't know already where the cloned branch
9356 * If @destParent is given, it ensures that the tree is namespace
9357 * wellformed by creating additional ns-decls where needed.
9358 * Note that, since prefixes of already existent ns-decls can be
9359 * shadowed by this process, it could break QNames in attribute
9360 * values or element content.
9362 * 1) What to do with XInclude? Currently this returns an error for XInclude.
9364 * Returns 0 if the operation succeeded,
9365 * 1 if a node of unsupported (or not yet supported) type was given,
9366 * -1 on API/internal errors.
9370 xmlDOMWrapCloneNode(xmlDOMWrapCtxtPtr ctxt,
9371 xmlDocPtr sourceDoc,
9373 xmlNodePtr *resNode,
9375 xmlNodePtr destParent,
9377 int options ATTRIBUTE_UNUSED)
9380 xmlNodePtr cur, curElem = NULL;
9381 xmlNsMapPtr nsMap = NULL;
9385 /* int adoptStr = 1; */
9386 /* gather @parent's ns-decls. */
9390 * TODO: @ancestorsOnly should be set per option.
9393 int ancestorsOnly = 0;
9394 xmlNodePtr resultClone = NULL, clone = NULL, parentClone = NULL, prevClone = NULL;
9395 xmlNsPtr cloneNs = NULL, *cloneNsDefSlot = NULL;
9396 xmlDictPtr dict; /* The destination dict */
9398 if ((node == NULL) || (resNode == NULL) || (destDoc == NULL))
9401 * TODO: Initially we support only element-nodes.
9403 if (node->type != XML_ELEMENT_NODE)
9406 * Check node->doc sanity.
9408 if ((node->doc != NULL) && (sourceDoc != NULL) &&
9409 (node->doc != sourceDoc)) {
9411 * Might be an XIncluded node.
9415 if (sourceDoc == NULL)
9416 sourceDoc = node->doc;
9417 if (sourceDoc == NULL)
9420 dict = destDoc->dict;
9422 * Reuse the namespace map of the context.
9425 nsMap = (xmlNsMapPtr) ctxt->namespaceMap;
9430 if ((cur != NULL) && (cur->type == XML_NAMESPACE_DECL))
9433 while (cur != NULL) {
9434 if (cur->doc != sourceDoc) {
9436 * We'll assume XIncluded nodes if the doc differs.
9437 * TODO: Do we need to reconciliate XIncluded nodes?
9438 * TODO: This here returns -1 in this case.
9440 goto internal_error;
9443 * Create a new node.
9445 switch (cur->type) {
9446 case XML_XINCLUDE_START:
9447 case XML_XINCLUDE_END:
9449 * TODO: What to do with XInclude?
9451 goto internal_error;
9453 case XML_ELEMENT_NODE:
9455 case XML_CDATA_SECTION_NODE:
9456 case XML_COMMENT_NODE:
9458 case XML_DOCUMENT_FRAG_NODE:
9459 case XML_ENTITY_REF_NODE:
9460 case XML_ENTITY_NODE:
9462 * Nodes of xmlNode structure.
9464 clone = (xmlNodePtr) xmlMalloc(sizeof(xmlNode));
9465 if (clone == NULL) {
9466 xmlTreeErrMemory("xmlDOMWrapCloneNode(): allocating a node");
9467 goto internal_error;
9469 memset(clone, 0, sizeof(xmlNode));
9471 * Set hierachical links.
9473 if (resultClone != NULL) {
9474 clone->parent = parentClone;
9476 prevClone->next = clone;
9477 clone->prev = prevClone;
9479 parentClone->children = clone;
9481 resultClone = clone;
9484 case XML_ATTRIBUTE_NODE:
9486 * Attributes (xmlAttr).
9488 clone = (xmlNodePtr) xmlMalloc(sizeof(xmlAttr));
9489 if (clone == NULL) {
9490 xmlTreeErrMemory("xmlDOMWrapCloneNode(): allocating an attr-node");
9491 goto internal_error;
9493 memset(clone, 0, sizeof(xmlAttr));
9495 * Set hierachical links.
9496 * TODO: Change this to add to the end of attributes.
9498 if (resultClone != NULL) {
9499 clone->parent = parentClone;
9501 prevClone->next = clone;
9502 clone->prev = prevClone;
9504 parentClone->properties = (xmlAttrPtr) clone;
9506 resultClone = clone;
9510 * TODO QUESTION: Any other nodes expected?
9512 goto internal_error;
9515 clone->type = cur->type;
9516 clone->doc = destDoc;
9519 * Clone the name of the node if any.
9521 if (cur->name == xmlStringText)
9522 clone->name = xmlStringText;
9523 else if (cur->name == xmlStringTextNoenc)
9525 * NOTE: Although xmlStringTextNoenc is never assigned to a node
9526 * in tree.c, it might be set in Libxslt via
9527 * "xsl:disable-output-escaping".
9529 clone->name = xmlStringTextNoenc;
9530 else if (cur->name == xmlStringComment)
9531 clone->name = xmlStringComment;
9532 else if (cur->name != NULL) {
9533 DICT_CONST_COPY(cur->name, clone->name);
9536 switch (cur->type) {
9537 case XML_XINCLUDE_START:
9538 case XML_XINCLUDE_END:
9543 case XML_ELEMENT_NODE:
9547 * Namespace declarations.
9549 if (cur->nsDef != NULL) {
9551 if (destParent && (ctxt == NULL)) {
9553 * Gather @parent's in-scope ns-decls.
9555 if (xmlDOMWrapNSNormGatherInScopeNs(&nsMap,
9557 goto internal_error;
9562 * Clone namespace declarations.
9564 cloneNsDefSlot = &(clone->nsDef);
9565 for (ns = cur->nsDef; ns != NULL; ns = ns->next) {
9567 * Create a new xmlNs.
9569 cloneNs = (xmlNsPtr) xmlMalloc(sizeof(xmlNs));
9570 if (cloneNs == NULL) {
9571 xmlTreeErrMemory("xmlDOMWrapCloneNode(): "
9572 "allocating namespace");
9575 memset(cloneNs, 0, sizeof(xmlNs));
9576 cloneNs->type = XML_LOCAL_NAMESPACE;
9578 if (ns->href != NULL)
9579 cloneNs->href = xmlStrdup(ns->href);
9580 if (ns->prefix != NULL)
9581 cloneNs->prefix = xmlStrdup(ns->prefix);
9583 *cloneNsDefSlot = cloneNs;
9584 cloneNsDefSlot = &(cloneNs->next);
9587 * Note that for custom handling of ns-references,
9588 * the ns-decls need not be stored in the ns-map,
9589 * since they won't be referenced by node->ns.
9591 if ((ctxt == NULL) ||
9592 (ctxt->getNsForNodeFunc == NULL))
9595 * Does it shadow any ns-decl?
9597 if (XML_NSMAP_NOTEMPTY(nsMap)) {
9598 XML_NSMAP_FOREACH(nsMap, mi) {
9599 if ((mi->depth >= XML_TREE_NSMAP_PARENT) &&
9600 (mi->shadowDepth == -1) &&
9601 ((ns->prefix == mi->newNs->prefix) ||
9602 xmlStrEqual(ns->prefix,
9603 mi->newNs->prefix))) {
9605 * Mark as shadowed at the current
9608 mi->shadowDepth = depth;
9615 if (xmlDOMWrapNsMapAddItem(&nsMap, -1,
9616 ns, cloneNs, depth) == NULL)
9617 goto internal_error;
9621 /* cur->ns will be processed further down. */
9623 case XML_ATTRIBUTE_NODE:
9624 /* IDs will be processed further down. */
9625 /* cur->ns will be processed further down. */
9628 case XML_CDATA_SECTION_NODE:
9630 * Note that this will also cover the values of attributes.
9632 DICT_COPY(cur->content, clone->content);
9634 case XML_ENTITY_NODE:
9635 /* TODO: What to do here? */
9637 case XML_ENTITY_REF_NODE:
9638 if (sourceDoc != destDoc) {
9639 if ((destDoc->intSubset) || (destDoc->extSubset)) {
9642 * Different doc: Assign new entity-node if available.
9644 ent = xmlGetDocEntity(destDoc, cur->name);
9646 clone->content = ent->content;
9647 clone->children = (xmlNodePtr) ent;
9648 clone->last = (xmlNodePtr) ent;
9653 * Same doc: Use the current node's entity declaration
9656 clone->content = cur->content;
9657 clone->children = cur->children;
9658 clone->last = cur->last;
9662 DICT_COPY(cur->content, clone->content);
9664 case XML_COMMENT_NODE:
9665 DICT_COPY(cur->content, clone->content);
9668 goto internal_error;
9671 if (cur->ns == NULL)
9672 goto end_ns_reference;
9674 /* handle_ns_reference: */
9676 ** The following will take care of references to ns-decls ********
9677 ** and is intended only for element- and attribute-nodes.
9681 if (destParent && (ctxt == NULL)) {
9682 if (xmlDOMWrapNSNormGatherInScopeNs(&nsMap, destParent) == -1)
9683 goto internal_error;
9688 * Adopt ns-references.
9690 if (XML_NSMAP_NOTEMPTY(nsMap)) {
9692 * Search for a mapping.
9694 XML_NSMAP_FOREACH(nsMap, mi) {
9695 if ((mi->shadowDepth == -1) &&
9696 (cur->ns == mi->oldNs)) {
9698 * This is the nice case: a mapping was found.
9700 clone->ns = mi->newNs;
9701 goto end_ns_reference;
9706 * No matching namespace in scope. We need a new one.
9708 if ((ctxt != NULL) && (ctxt->getNsForNodeFunc != NULL)) {
9710 * User-defined behaviour.
9712 ns = ctxt->getNsForNodeFunc(ctxt, cur,
9713 cur->ns->href, cur->ns->prefix);
9715 * Add user's mapping.
9717 if (xmlDOMWrapNsMapAddItem(&nsMap, -1,
9718 cur->ns, ns, XML_TREE_NSMAP_CUSTOM) == NULL)
9719 goto internal_error;
9723 * Aquire a normalized ns-decl and add it to the map.
9725 if (xmlDOMWrapNSNormAquireNormalizedNs(destDoc,
9726 /* ns-decls on curElem or on destDoc->oldNs */
9727 destParent ? curElem : NULL,
9730 /* if we need to search only in the ancestor-axis */
9732 /* ns-decls must be prefixed for attributes. */
9733 (cur->type == XML_ATTRIBUTE_NODE) ? 1 : 0) == -1)
9734 goto internal_error;
9741 * Some post-processing.
9743 * Handle ID attributes.
9745 if ((clone->type == XML_ATTRIBUTE_NODE) &&
9746 (clone->parent != NULL))
9748 if (xmlIsID(destDoc, clone->parent, (xmlAttrPtr) clone)) {
9752 idVal = xmlNodeListGetString(cur->doc, cur->children, 1);
9753 if (idVal != NULL) {
9754 if (xmlAddID(NULL, destDoc, idVal, (xmlAttrPtr) cur) == NULL) {
9755 /* TODO: error message. */
9757 goto internal_error;
9765 ** The following will traverse the tree **************************
9768 * Walk the element's attributes before descending into child-nodes.
9770 if ((cur->type == XML_ELEMENT_NODE) && (cur->properties != NULL)) {
9772 parentClone = clone;
9773 cur = (xmlNodePtr) cur->properties;
9778 * Descend into child-nodes.
9780 if (cur->children != NULL) {
9781 if (deep || (cur->type == XML_ATTRIBUTE_NODE)) {
9783 parentClone = clone;
9784 cur = cur->children;
9791 * At this point we are done with the node, its content
9792 * and an element-nodes's attribute-nodes.
9796 if ((cur->type == XML_ELEMENT_NODE) ||
9797 (cur->type == XML_XINCLUDE_START) ||
9798 (cur->type == XML_XINCLUDE_END)) {
9800 * TODO: Do we expect nsDefs on XML_XINCLUDE_START?
9802 if (XML_NSMAP_NOTEMPTY(nsMap)) {
9806 while ((nsMap->last != NULL) &&
9807 (nsMap->last->depth >= depth))
9809 XML_NSMAP_POP(nsMap, mi)
9814 XML_NSMAP_FOREACH(nsMap, mi) {
9815 if (mi->shadowDepth >= depth)
9816 mi->shadowDepth = -1;
9821 if (cur->next != NULL) {
9824 } else if (cur->type != XML_ATTRIBUTE_NODE) {
9828 if (clone->parent != NULL)
9829 clone->parent->last = clone;
9830 clone = clone->parent;
9832 parentClone = clone->parent;
9834 * Process parent --> next;
9839 /* This is for attributes only. */
9840 clone = clone->parent;
9841 parentClone = clone->parent;
9843 * Process parent-element --> children.
9858 if (nsMap != NULL) {
9859 if ((ctxt) && (ctxt->namespaceMap == nsMap)) {
9861 * Just cleanup the map but don't free.
9865 nsMap->last->next = nsMap->pool;
9866 nsMap->pool = nsMap->first;
9867 nsMap->first = NULL;
9870 xmlDOMWrapNsMapFree(nsMap);
9873 * TODO: Should we try a cleanup of the cloned node in case of a
9876 *resNode = resultClone;
9881 * xmlDOMWrapAdoptAttr:
9882 * @ctxt: the optional context for custom processing
9883 * @sourceDoc: the optional source document of attr
9884 * @attr: the attribute-node to be adopted
9885 * @destDoc: the destination doc for adoption
9886 * @destParent: the optional new parent of @attr in @destDoc
9887 * @options: option flags
9889 * @attr is adopted by @destDoc.
9890 * Ensures that ns-references point to @destDoc: either to
9891 * elements->nsDef entries if @destParent is given, or to
9892 * @destDoc->oldNs otherwise.
9894 * Returns 0 if succeeded, -1 otherwise and on API/internal errors.
9897 xmlDOMWrapAdoptAttr(xmlDOMWrapCtxtPtr ctxt,
9898 xmlDocPtr sourceDoc,
9901 xmlNodePtr destParent,
9902 int options ATTRIBUTE_UNUSED)
9907 if ((attr == NULL) || (destDoc == NULL))
9910 attr->doc = destDoc;
9911 if (attr->ns != NULL) {
9915 /* TODO: User defined. */
9917 /* XML Namespace. */
9918 if (IS_STR_XML(attr->ns->prefix)) {
9919 ns = xmlTreeEnsureXMLDecl(destDoc);
9920 } else if (destParent == NULL) {
9922 * Store in @destDoc->oldNs.
9924 ns = xmlDOMWrapStoreNs(destDoc, attr->ns->href, attr->ns->prefix);
9927 * Declare on @destParent.
9929 if (xmlSearchNsByNamespaceStrict(destDoc, destParent, attr->ns->href,
9931 goto internal_error;
9933 ns = xmlDOMWrapNSNormDeclareNsForced(destDoc, destParent,
9934 attr->ns->href, attr->ns->prefix, 1);
9938 goto internal_error;
9942 XML_TREE_ADOPT_STR(attr->name);
9948 if (attr->children == NULL)
9950 cur = attr->children;
9951 if ((cur != NULL) && (cur->type == XML_NAMESPACE_DECL))
9952 goto internal_error;
9953 while (cur != NULL) {
9955 switch (cur->type) {
9957 case XML_CDATA_SECTION_NODE:
9958 XML_TREE_ADOPT_STR_2(cur->content)
9960 case XML_ENTITY_REF_NODE:
9962 * Remove reference to the entitity-node.
9964 cur->content = NULL;
9965 cur->children = NULL;
9967 if ((destDoc->intSubset) || (destDoc->extSubset)) {
9970 * Assign new entity-node if available.
9972 ent = xmlGetDocEntity(destDoc, cur->name);
9974 cur->content = ent->content;
9975 cur->children = (xmlNodePtr) ent;
9976 cur->last = (xmlNodePtr) ent;
9983 if (cur->children != NULL) {
9984 cur = cur->children;
9988 if (cur == (xmlNodePtr) attr)
9990 if (cur->next != NULL)
10003 * xmlDOMWrapAdoptNode:
10004 * @ctxt: the optional context for custom processing
10005 * @sourceDoc: the optional sourceDoc
10006 * @node: the node to start with
10007 * @destDoc: the destination doc
10008 * @destParent: the optional new parent of @node in @destDoc
10009 * @options: option flags
10011 * References of out-of scope ns-decls are remapped to point to @destDoc:
10012 * 1) If @destParent is given, then nsDef entries on element-nodes are used
10013 * 2) If *no* @destParent is given, then @destDoc->oldNs entries are used
10014 * This is the case when you have an unlinked node and just want to move it
10015 * to the context of
10017 * If @destParent is given, it ensures that the tree is namespace
10018 * wellformed by creating additional ns-decls where needed.
10019 * Note that, since prefixes of already existent ns-decls can be
10020 * shadowed by this process, it could break QNames in attribute
10021 * values or element content.
10022 * NOTE: This function was not intensively tested.
10024 * Returns 0 if the operation succeeded,
10025 * 1 if a node of unsupported type was given,
10026 * 2 if a node of not yet supported type was given and
10027 * -1 on API/internal errors.
10030 xmlDOMWrapAdoptNode(xmlDOMWrapCtxtPtr ctxt,
10031 xmlDocPtr sourceDoc,
10034 xmlNodePtr destParent,
10037 if ((node == NULL) || (node->type == XML_NAMESPACE_DECL) ||
10038 (destDoc == NULL) ||
10039 ((destParent != NULL) && (destParent->doc != destDoc)))
10042 * Check node->doc sanity.
10044 if ((node->doc != NULL) && (sourceDoc != NULL) &&
10045 (node->doc != sourceDoc)) {
10047 * Might be an XIncluded node.
10051 if (sourceDoc == NULL)
10052 sourceDoc = node->doc;
10053 if (sourceDoc == destDoc)
10055 switch (node->type) {
10056 case XML_ELEMENT_NODE:
10057 case XML_ATTRIBUTE_NODE:
10058 case XML_TEXT_NODE:
10059 case XML_CDATA_SECTION_NODE:
10060 case XML_ENTITY_REF_NODE:
10062 case XML_COMMENT_NODE:
10064 case XML_DOCUMENT_FRAG_NODE:
10065 /* TODO: Support document-fragment-nodes. */
10071 * Unlink only if @node was not already added to @destParent.
10073 if ((node->parent != NULL) && (destParent != node->parent))
10074 xmlUnlinkNode(node);
10076 if (node->type == XML_ELEMENT_NODE) {
10077 return (xmlDOMWrapAdoptBranch(ctxt, sourceDoc, node,
10078 destDoc, destParent, options));
10079 } else if (node->type == XML_ATTRIBUTE_NODE) {
10080 return (xmlDOMWrapAdoptAttr(ctxt, sourceDoc,
10081 (xmlAttrPtr) node, destDoc, destParent, options));
10083 xmlNodePtr cur = node;
10086 cur->doc = destDoc;
10088 * Optimize string adoption.
10090 if ((sourceDoc != NULL) &&
10091 (sourceDoc->dict == destDoc->dict))
10093 switch (node->type) {
10094 case XML_TEXT_NODE:
10095 case XML_CDATA_SECTION_NODE:
10096 XML_TREE_ADOPT_STR_2(node->content)
10098 case XML_ENTITY_REF_NODE:
10100 * Remove reference to the entitity-node.
10102 node->content = NULL;
10103 node->children = NULL;
10105 if ((destDoc->intSubset) || (destDoc->extSubset)) {
10108 * Assign new entity-node if available.
10110 ent = xmlGetDocEntity(destDoc, node->name);
10112 node->content = ent->content;
10113 node->children = (xmlNodePtr) ent;
10114 node->last = (xmlNodePtr) ent;
10117 XML_TREE_ADOPT_STR(node->name)
10119 case XML_PI_NODE: {
10120 XML_TREE_ADOPT_STR(node->name)
10121 XML_TREE_ADOPT_STR_2(node->content)
10131 #define bottom_tree
10132 #include "elfgcchack.h"