blob: c9a4bfb5662a529c8d390021e78237001fdb922a [file] [log] [blame]
Owen Taylor3473f882001-02-23 17:55:21 +00001/*
Daniel Veillardd1640922001-12-17 15:30:10 +00002 * tree.c : implementation of access function for an XML tree.
Owen Taylor3473f882001-02-23 17:55:21 +00003 *
4 * See Copyright for the status of this software.
5 *
Daniel Veillardc5d64342001-06-24 12:13:24 +00006 * daniel@veillard.com
Owen Taylor3473f882001-02-23 17:55:21 +00007 *
8 * 14 Nov 2000 ht - Changed the name of function xmlBufferWriteChar under VMS
9 * as it was similar to xmlBufferWriteCHAR when compiling without case
10 * sensitivity.
11 *
12 */
13
Bjorn Reese70a9da52001-04-21 16:57:29 +000014#include "libxml.h"
Owen Taylor3473f882001-02-23 17:55:21 +000015
Owen Taylor3473f882001-02-23 17:55:21 +000016#include <string.h> /* for memset() only ! */
17
18#ifdef HAVE_CTYPE_H
19#include <ctype.h>
20#endif
21#ifdef HAVE_STDLIB_H
22#include <stdlib.h>
23#endif
24#ifdef HAVE_ZLIB_H
25#include <zlib.h>
26#endif
27
28#include <libxml/xmlmemory.h>
29#include <libxml/tree.h>
30#include <libxml/parser.h>
Daniel Veillardb8c9be92001-07-09 16:01:19 +000031#include <libxml/uri.h>
Owen Taylor3473f882001-02-23 17:55:21 +000032#include <libxml/entities.h>
33#include <libxml/valid.h>
34#include <libxml/xmlerror.h>
Daniel Veillardbdb9ba72001-04-11 11:28:06 +000035#include <libxml/parserInternals.h>
Daniel Veillard3c01b1d2001-10-17 15:58:35 +000036#include <libxml/globals.h>
Owen Taylor3473f882001-02-23 17:55:21 +000037
Daniel Veillard56a4cb82001-03-24 17:00:36 +000038xmlNsPtr xmlNewReconciliedNs(xmlDocPtr doc, xmlNodePtr tree, xmlNsPtr ns);
39
40/************************************************************************
41 * *
42 * A few static variables and macros *
43 * *
44 ************************************************************************/
Daniel Veillardd0463562001-10-13 09:15:48 +000045/* #undef xmlStringText */
Daniel Veillard22090732001-07-16 00:06:07 +000046const xmlChar xmlStringText[] = { 't', 'e', 'x', 't', 0 };
Daniel Veillardd0463562001-10-13 09:15:48 +000047/* #undef xmlStringTextNoenc */
Daniel Veillard22090732001-07-16 00:06:07 +000048const xmlChar xmlStringTextNoenc[] =
Owen Taylor3473f882001-02-23 17:55:21 +000049 { 't', 'e', 'x', 't', 'n', 'o', 'e', 'n', 'c', 0 };
Daniel Veillardd0463562001-10-13 09:15:48 +000050/* #undef xmlStringComment */
Daniel Veillard22090732001-07-16 00:06:07 +000051const xmlChar xmlStringComment[] = { 'c', 'o', 'm', 'm', 'e', 'n', 't', 0 };
52
Owen Taylor3473f882001-02-23 17:55:21 +000053static int xmlCompressMode = 0;
54static int xmlCheckDTD = 1;
Owen Taylor3473f882001-02-23 17:55:21 +000055
Owen Taylor3473f882001-02-23 17:55:21 +000056#define UPDATE_LAST_CHILD_AND_PARENT(n) if ((n) != NULL) { \
57 xmlNodePtr ulccur = (n)->children; \
58 if (ulccur == NULL) { \
59 (n)->last = NULL; \
60 } else { \
61 while (ulccur->next != NULL) { \
62 ulccur->parent = (n); \
63 ulccur = ulccur->next; \
64 } \
65 ulccur->parent = (n); \
66 (n)->last = ulccur; \
67}}
68
69/* #define DEBUG_BUFFER */
70/* #define DEBUG_TREE */
71
72/************************************************************************
73 * *
Daniel Veillard8ee9c8f2002-01-26 21:42:58 +000074 * Functions to move to entities.c once the *
75 * API freeze is smoothen and they can be made public. *
76 * *
77 ************************************************************************/
78#include <libxml/hash.h>
79
80/**
81 * xmlGetEntityFromDtd:
82 * @dtd: A pointer to the DTD to search
83 * @name: The entity name
84 *
85 * Do an entity lookup in the DTD entity hash table and
86 * return the corresponding entity, if found.
87 *
88 * Returns A pointer to the entity structure or NULL if not found.
89 */
90static xmlEntityPtr
91xmlGetEntityFromDtd(xmlDtdPtr dtd, const xmlChar *name) {
92 xmlEntitiesTablePtr table;
93
94 if((dtd != NULL) && (dtd->entities != NULL)) {
95 table = (xmlEntitiesTablePtr) dtd->entities;
96 return((xmlEntityPtr) xmlHashLookup(table, name));
97 /* return(xmlGetEntityFromTable(table, name)); */
98 }
99 return(NULL);
100}
101/**
102 * xmlGetParameterEntityFromDtd:
103 * @dtd: A pointer to the DTD to search
104 * @name: The entity name
105 *
106 * Do an entity lookup in the DTD pararmeter entity hash table and
107 * return the corresponding entity, if found.
108 *
109 * Returns A pointer to the entity structure or NULL if not found.
110 */
111static xmlEntityPtr
112xmlGetParameterEntityFromDtd(xmlDtdPtr dtd, const xmlChar *name) {
113 xmlEntitiesTablePtr table;
114
115 if ((dtd != NULL) && (dtd->pentities != NULL)) {
116 table = (xmlEntitiesTablePtr) dtd->pentities;
117 return((xmlEntityPtr) xmlHashLookup(table, name));
118 /* return(xmlGetEntityFromTable(table, name)); */
119 }
120 return(NULL);
121}
122
123/************************************************************************
124 * *
Owen Taylor3473f882001-02-23 17:55:21 +0000125 * Allocation and deallocation of basic structures *
126 * *
127 ************************************************************************/
128
129/**
130 * xmlSetBufferAllocationScheme:
131 * @scheme: allocation method to use
132 *
133 * Set the buffer allocation method. Types are
134 * XML_BUFFER_ALLOC_EXACT - use exact sizes, keeps memory usage down
135 * XML_BUFFER_ALLOC_DOUBLEIT - double buffer when extra needed,
136 * improves performance
137 */
138void
139xmlSetBufferAllocationScheme(xmlBufferAllocationScheme scheme) {
140 xmlBufferAllocScheme = scheme;
141}
142
143/**
144 * xmlGetBufferAllocationScheme:
145 *
146 * Types are
147 * XML_BUFFER_ALLOC_EXACT - use exact sizes, keeps memory usage down
148 * XML_BUFFER_ALLOC_DOUBLEIT - double buffer when extra needed,
149 * improves performance
150 *
151 * Returns the current allocation scheme
152 */
153xmlBufferAllocationScheme
Daniel Veillard56a4cb82001-03-24 17:00:36 +0000154xmlGetBufferAllocationScheme(void) {
Daniel Veillarde043ee12001-04-16 14:08:07 +0000155 return(xmlBufferAllocScheme);
Owen Taylor3473f882001-02-23 17:55:21 +0000156}
157
158/**
159 * xmlNewNs:
160 * @node: the element carrying the namespace
161 * @href: the URI associated
162 * @prefix: the prefix for the namespace
163 *
164 * Creation of a new Namespace. This function will refuse to create
165 * a namespace with a similar prefix than an existing one present on this
166 * node.
167 * We use href==NULL in the case of an element creation where the namespace
168 * was not defined.
Daniel Veillardd1640922001-12-17 15:30:10 +0000169 * Returns a new namespace pointer or NULL
Owen Taylor3473f882001-02-23 17:55:21 +0000170 */
171xmlNsPtr
172xmlNewNs(xmlNodePtr node, const xmlChar *href, const xmlChar *prefix) {
173 xmlNsPtr cur;
174
175 if ((node != NULL) && (node->type != XML_ELEMENT_NODE))
176 return(NULL);
177
Daniel Veillard20ee8c02001-10-05 09:18:14 +0000178 if ((prefix != NULL) && (xmlStrEqual(prefix, BAD_CAST "xml")))
179 return(NULL);
180
Owen Taylor3473f882001-02-23 17:55:21 +0000181 /*
182 * Allocate a new Namespace and fill the fields.
183 */
184 cur = (xmlNsPtr) xmlMalloc(sizeof(xmlNs));
185 if (cur == NULL) {
186 xmlGenericError(xmlGenericErrorContext,
187 "xmlNewNs : malloc failed\n");
188 return(NULL);
189 }
190 memset(cur, 0, sizeof(xmlNs));
191 cur->type = XML_LOCAL_NAMESPACE;
192
193 if (href != NULL)
194 cur->href = xmlStrdup(href);
195 if (prefix != NULL)
196 cur->prefix = xmlStrdup(prefix);
197
198 /*
199 * Add it at the end to preserve parsing order ...
200 * and checks for existing use of the prefix
201 */
202 if (node != NULL) {
203 if (node->nsDef == NULL) {
204 node->nsDef = cur;
205 } else {
206 xmlNsPtr prev = node->nsDef;
207
208 if (((prev->prefix == NULL) && (cur->prefix == NULL)) ||
209 (xmlStrEqual(prev->prefix, cur->prefix))) {
210 xmlFreeNs(cur);
211 return(NULL);
212 }
213 while (prev->next != NULL) {
214 prev = prev->next;
215 if (((prev->prefix == NULL) && (cur->prefix == NULL)) ||
216 (xmlStrEqual(prev->prefix, cur->prefix))) {
217 xmlFreeNs(cur);
218 return(NULL);
219 }
220 }
221 prev->next = cur;
222 }
223 }
224 return(cur);
225}
226
227/**
228 * xmlSetNs:
229 * @node: a node in the document
230 * @ns: a namespace pointer
231 *
232 * Associate a namespace to a node, a posteriori.
233 */
234void
235xmlSetNs(xmlNodePtr node, xmlNsPtr ns) {
236 if (node == NULL) {
237#ifdef DEBUG_TREE
238 xmlGenericError(xmlGenericErrorContext,
239 "xmlSetNs: node == NULL\n");
240#endif
241 return;
242 }
243 node->ns = ns;
244}
245
246/**
247 * xmlFreeNs:
248 * @cur: the namespace pointer
249 *
250 * Free up the structures associated to a namespace
251 */
252void
253xmlFreeNs(xmlNsPtr cur) {
254 if (cur == NULL) {
255#ifdef DEBUG_TREE
256 xmlGenericError(xmlGenericErrorContext,
257 "xmlFreeNs : ns == NULL\n");
258#endif
259 return;
260 }
261 if (cur->href != NULL) xmlFree((char *) cur->href);
262 if (cur->prefix != NULL) xmlFree((char *) cur->prefix);
Owen Taylor3473f882001-02-23 17:55:21 +0000263 xmlFree(cur);
264}
265
266/**
267 * xmlFreeNsList:
268 * @cur: the first namespace pointer
269 *
270 * Free up all the structures associated to the chained namespaces.
271 */
272void
273xmlFreeNsList(xmlNsPtr cur) {
274 xmlNsPtr next;
275 if (cur == NULL) {
276#ifdef DEBUG_TREE
277 xmlGenericError(xmlGenericErrorContext,
278 "xmlFreeNsList : ns == NULL\n");
279#endif
280 return;
281 }
282 while (cur != NULL) {
283 next = cur->next;
284 xmlFreeNs(cur);
285 cur = next;
286 }
287}
288
289/**
290 * xmlNewDtd:
291 * @doc: the document pointer
292 * @name: the DTD name
293 * @ExternalID: the external ID
294 * @SystemID: the system ID
295 *
296 * Creation of a new DTD for the external subset. To create an
297 * internal subset, use xmlCreateIntSubset().
298 *
299 * Returns a pointer to the new DTD structure
300 */
301xmlDtdPtr
302xmlNewDtd(xmlDocPtr doc, const xmlChar *name,
303 const xmlChar *ExternalID, const xmlChar *SystemID) {
304 xmlDtdPtr cur;
305
306 if ((doc != NULL) && (doc->extSubset != NULL)) {
307#ifdef DEBUG_TREE
308 xmlGenericError(xmlGenericErrorContext,
309 "xmlNewDtd(%s): document %s already have a DTD %s\n",
310 /* !!! */ (char *) name, doc->name,
311 /* !!! */ (char *)doc->extSubset->name);
312#endif
313 return(NULL);
314 }
315
316 /*
317 * Allocate a new DTD and fill the fields.
318 */
319 cur = (xmlDtdPtr) xmlMalloc(sizeof(xmlDtd));
320 if (cur == NULL) {
321 xmlGenericError(xmlGenericErrorContext,
322 "xmlNewDtd : malloc failed\n");
323 return(NULL);
324 }
325 memset(cur, 0 , sizeof(xmlDtd));
326 cur->type = XML_DTD_NODE;
327
328 if (name != NULL)
329 cur->name = xmlStrdup(name);
330 if (ExternalID != NULL)
331 cur->ExternalID = xmlStrdup(ExternalID);
332 if (SystemID != NULL)
333 cur->SystemID = xmlStrdup(SystemID);
334 if (doc != NULL)
335 doc->extSubset = cur;
336 cur->doc = doc;
337
338 return(cur);
339}
340
341/**
342 * xmlGetIntSubset:
343 * @doc: the document pointer
344 *
345 * Get the internal subset of a document
346 * Returns a pointer to the DTD structure or NULL if not found
347 */
348
349xmlDtdPtr
350xmlGetIntSubset(xmlDocPtr doc) {
351 xmlNodePtr cur;
352
353 if (doc == NULL)
354 return(NULL);
355 cur = doc->children;
356 while (cur != NULL) {
357 if (cur->type == XML_DTD_NODE)
358 return((xmlDtdPtr) cur);
359 cur = cur->next;
360 }
361 return((xmlDtdPtr) doc->intSubset);
362}
363
364/**
365 * xmlCreateIntSubset:
366 * @doc: the document pointer
367 * @name: the DTD name
Daniel Veillarde356c282001-03-10 12:32:04 +0000368 * @ExternalID: the external (PUBLIC) ID
Owen Taylor3473f882001-02-23 17:55:21 +0000369 * @SystemID: the system ID
370 *
371 * Create the internal subset of a document
372 * Returns a pointer to the new DTD structure
373 */
374xmlDtdPtr
375xmlCreateIntSubset(xmlDocPtr doc, const xmlChar *name,
376 const xmlChar *ExternalID, const xmlChar *SystemID) {
377 xmlDtdPtr cur;
378
379 if ((doc != NULL) && (xmlGetIntSubset(doc) != NULL)) {
380#ifdef DEBUG_TREE
381 xmlGenericError(xmlGenericErrorContext,
382
383 "xmlCreateIntSubset(): document %s already have an internal subset\n",
384 doc->name);
385#endif
386 return(NULL);
387 }
388
389 /*
390 * Allocate a new DTD and fill the fields.
391 */
392 cur = (xmlDtdPtr) xmlMalloc(sizeof(xmlDtd));
393 if (cur == NULL) {
394 xmlGenericError(xmlGenericErrorContext,
Daniel Veillardd1640922001-12-17 15:30:10 +0000395 "xmlCreateIntSubset : malloc failed\n");
Owen Taylor3473f882001-02-23 17:55:21 +0000396 return(NULL);
397 }
398 memset(cur, 0, sizeof(xmlDtd));
399 cur->type = XML_DTD_NODE;
400
401 if (name != NULL)
402 cur->name = xmlStrdup(name);
403 if (ExternalID != NULL)
404 cur->ExternalID = xmlStrdup(ExternalID);
405 if (SystemID != NULL)
406 cur->SystemID = xmlStrdup(SystemID);
407 if (doc != NULL) {
408 doc->intSubset = cur;
409 cur->parent = doc;
410 cur->doc = doc;
411 if (doc->children == NULL) {
412 doc->children = (xmlNodePtr) cur;
413 doc->last = (xmlNodePtr) cur;
414 } else {
Owen Taylor3473f882001-02-23 17:55:21 +0000415 if (doc->type == XML_HTML_DOCUMENT_NODE) {
Daniel Veillarde356c282001-03-10 12:32:04 +0000416 xmlNodePtr prev;
417
Owen Taylor3473f882001-02-23 17:55:21 +0000418 prev = doc->children;
419 prev->prev = (xmlNodePtr) cur;
420 cur->next = prev;
421 doc->children = (xmlNodePtr) cur;
422 } else {
Daniel Veillarde356c282001-03-10 12:32:04 +0000423 xmlNodePtr next;
424
425 next = doc->children;
426 while ((next != NULL) && (next->type != XML_ELEMENT_NODE))
427 next = next->next;
428 if (next == NULL) {
429 cur->prev = doc->last;
430 cur->prev->next = (xmlNodePtr) cur;
431 cur->next = NULL;
432 doc->last = (xmlNodePtr) cur;
433 } else {
434 cur->next = next;
435 cur->prev = next->prev;
436 if (cur->prev == NULL)
437 doc->children = (xmlNodePtr) cur;
438 else
439 cur->prev->next = (xmlNodePtr) cur;
440 next->prev = (xmlNodePtr) cur;
441 }
Owen Taylor3473f882001-02-23 17:55:21 +0000442 }
443 }
444 }
445 return(cur);
446}
447
448/**
449 * xmlFreeDtd:
450 * @cur: the DTD structure to free up
451 *
452 * Free a DTD structure.
453 */
454void
455xmlFreeDtd(xmlDtdPtr cur) {
456 if (cur == NULL) {
457#ifdef DEBUG_TREE
458 xmlGenericError(xmlGenericErrorContext,
459 "xmlFreeDtd : DTD == NULL\n");
460#endif
461 return;
462 }
463 if (cur->children != NULL) {
464 xmlNodePtr next, c = cur->children;
465
466 /*
Daniel Veillardcbaf3992001-12-31 16:16:02 +0000467 * Cleanup all the DTD comments they are not in the DTD
Owen Taylor3473f882001-02-23 17:55:21 +0000468 * indexes.
469 */
470 while (c != NULL) {
471 next = c->next;
472 if (c->type == XML_COMMENT_NODE) {
473 xmlUnlinkNode(c);
474 xmlFreeNode(c);
475 }
476 c = next;
477 }
478 }
479 if (cur->name != NULL) xmlFree((char *) cur->name);
480 if (cur->SystemID != NULL) xmlFree((char *) cur->SystemID);
481 if (cur->ExternalID != NULL) xmlFree((char *) cur->ExternalID);
482 /* TODO !!! */
483 if (cur->notations != NULL)
484 xmlFreeNotationTable((xmlNotationTablePtr) cur->notations);
485
486 if (cur->elements != NULL)
487 xmlFreeElementTable((xmlElementTablePtr) cur->elements);
488 if (cur->attributes != NULL)
489 xmlFreeAttributeTable((xmlAttributeTablePtr) cur->attributes);
490 if (cur->entities != NULL)
491 xmlFreeEntitiesTable((xmlEntitiesTablePtr) cur->entities);
492 if (cur->pentities != NULL)
493 xmlFreeEntitiesTable((xmlEntitiesTablePtr) cur->pentities);
494
Owen Taylor3473f882001-02-23 17:55:21 +0000495 xmlFree(cur);
496}
497
498/**
499 * xmlNewDoc:
500 * @version: xmlChar string giving the version of XML "1.0"
501 *
Daniel Veillard5e2dace2001-07-18 19:30:27 +0000502 * Creates a new XML document
503 *
Owen Taylor3473f882001-02-23 17:55:21 +0000504 * Returns a new document
505 */
506xmlDocPtr
507xmlNewDoc(const xmlChar *version) {
508 xmlDocPtr cur;
509
510 if (version == NULL)
511 version = (const xmlChar *) "1.0";
512
513 /*
514 * Allocate a new document and fill the fields.
515 */
516 cur = (xmlDocPtr) xmlMalloc(sizeof(xmlDoc));
517 if (cur == NULL) {
518 xmlGenericError(xmlGenericErrorContext,
519 "xmlNewDoc : malloc failed\n");
520 return(NULL);
521 }
522 memset(cur, 0, sizeof(xmlDoc));
523 cur->type = XML_DOCUMENT_NODE;
524
525 cur->version = xmlStrdup(version);
526 cur->standalone = -1;
527 cur->compression = -1; /* not initialized */
528 cur->doc = cur;
Daniel Veillardd2f3ec72001-04-11 07:50:02 +0000529 cur->charset = XML_CHAR_ENCODING_UTF8;
Owen Taylor3473f882001-02-23 17:55:21 +0000530 return(cur);
531}
532
533/**
534 * xmlFreeDoc:
535 * @cur: pointer to the document
Owen Taylor3473f882001-02-23 17:55:21 +0000536 *
537 * Free up all the structures used by a document, tree included.
538 */
539void
540xmlFreeDoc(xmlDocPtr cur) {
Daniel Veillarda9142e72001-06-19 11:07:54 +0000541 xmlDtdPtr extSubset, intSubset;
542
Owen Taylor3473f882001-02-23 17:55:21 +0000543 if (cur == NULL) {
544#ifdef DEBUG_TREE
545 xmlGenericError(xmlGenericErrorContext,
546 "xmlFreeDoc : document == NULL\n");
547#endif
548 return;
549 }
Daniel Veillard76d66f42001-05-16 21:05:17 +0000550 /*
551 * Do this before freeing the children list to avoid ID lookups
552 */
553 if (cur->ids != NULL) xmlFreeIDTable((xmlIDTablePtr) cur->ids);
554 cur->ids = NULL;
555 if (cur->refs != NULL) xmlFreeRefTable((xmlRefTablePtr) cur->refs);
556 cur->refs = NULL;
Daniel Veillarda9142e72001-06-19 11:07:54 +0000557 extSubset = cur->extSubset;
558 intSubset = cur->intSubset;
559 if (extSubset != NULL) {
Daniel Veillard76d66f42001-05-16 21:05:17 +0000560 xmlUnlinkNode((xmlNodePtr) cur->extSubset);
Daniel Veillard76d66f42001-05-16 21:05:17 +0000561 cur->extSubset = NULL;
Daniel Veillarda9142e72001-06-19 11:07:54 +0000562 xmlFreeDtd(extSubset);
Daniel Veillard76d66f42001-05-16 21:05:17 +0000563 }
Daniel Veillarda9142e72001-06-19 11:07:54 +0000564 if (intSubset != NULL) {
Daniel Veillard76d66f42001-05-16 21:05:17 +0000565 xmlUnlinkNode((xmlNodePtr) cur->intSubset);
Daniel Veillard76d66f42001-05-16 21:05:17 +0000566 cur->intSubset = NULL;
Daniel Veillarda9142e72001-06-19 11:07:54 +0000567 xmlFreeDtd(intSubset);
Daniel Veillard76d66f42001-05-16 21:05:17 +0000568 }
569
570 if (cur->children != NULL) xmlFreeNodeList(cur->children);
571
Owen Taylor3473f882001-02-23 17:55:21 +0000572 if (cur->version != NULL) xmlFree((char *) cur->version);
573 if (cur->name != NULL) xmlFree((char *) cur->name);
574 if (cur->encoding != NULL) xmlFree((char *) cur->encoding);
Owen Taylor3473f882001-02-23 17:55:21 +0000575 if (cur->oldNs != NULL) xmlFreeNsList(cur->oldNs);
Owen Taylor3473f882001-02-23 17:55:21 +0000576 if (cur->URL != NULL) xmlFree((char *) cur->URL);
Owen Taylor3473f882001-02-23 17:55:21 +0000577 xmlFree(cur);
578}
579
580/**
581 * xmlStringLenGetNodeList:
582 * @doc: the document
583 * @value: the value of the text
584 * @len: the length of the string value
585 *
586 * Parse the value string and build the node list associated. Should
587 * produce a flat tree with only TEXTs and ENTITY_REFs.
588 * Returns a pointer to the first child
589 */
590xmlNodePtr
591xmlStringLenGetNodeList(xmlDocPtr doc, const xmlChar *value, int len) {
592 xmlNodePtr ret = NULL, last = NULL;
593 xmlNodePtr node;
594 xmlChar *val;
595 const xmlChar *cur = value;
596 const xmlChar *q;
597 xmlEntityPtr ent;
598
599 if (value == NULL) return(NULL);
600
601 q = cur;
602 while ((*cur != 0) && (cur - value < len)) {
603 if (*cur == '&') {
604 /*
605 * Save the current text.
606 */
607 if (cur != q) {
608 if ((last != NULL) && (last->type == XML_TEXT_NODE)) {
609 xmlNodeAddContentLen(last, q, cur - q);
610 } else {
611 node = xmlNewDocTextLen(doc, q, cur - q);
612 if (node == NULL) return(ret);
613 if (last == NULL)
614 last = ret = node;
615 else {
616 last->next = node;
617 node->prev = last;
618 last = node;
619 }
620 }
621 }
622 /*
623 * Read the entity string
624 */
625 cur++;
626 q = cur;
627 while ((*cur != 0) && (cur - value < len) && (*cur != ';')) cur++;
628 if ((*cur == 0) || (cur - value >= len)) {
629#ifdef DEBUG_TREE
630 xmlGenericError(xmlGenericErrorContext,
631 "xmlStringLenGetNodeList: unterminated entity %30s\n", q);
632#endif
633 return(ret);
634 }
635 if (cur != q) {
636 /*
637 * Predefined entities don't generate nodes
638 */
639 val = xmlStrndup(q, cur - q);
640 ent = xmlGetDocEntity(doc, val);
641 if ((ent != NULL) &&
642 (ent->etype == XML_INTERNAL_PREDEFINED_ENTITY)) {
643 if (last == NULL) {
644 node = xmlNewDocText(doc, ent->content);
645 last = ret = node;
646 } else
647 xmlNodeAddContent(last, ent->content);
648
649 } else {
650 /*
651 * Create a new REFERENCE_REF node
652 */
653 node = xmlNewReference(doc, val);
654 if (node == NULL) {
655 if (val != NULL) xmlFree(val);
656 return(ret);
657 }
658 if (last == NULL)
659 last = ret = node;
660 else {
661 last->next = node;
662 node->prev = last;
663 last = node;
664 }
665 }
666 xmlFree(val);
667 }
668 cur++;
669 q = cur;
670 } else
671 cur++;
672 }
673 if (cur != q) {
674 /*
675 * Handle the last piece of text.
676 */
677 if ((last != NULL) && (last->type == XML_TEXT_NODE)) {
678 xmlNodeAddContentLen(last, q, cur - q);
679 } else {
680 node = xmlNewDocTextLen(doc, q, cur - q);
681 if (node == NULL) return(ret);
682 if (last == NULL)
683 last = ret = node;
684 else {
685 last->next = node;
686 node->prev = last;
687 last = node;
688 }
689 }
690 }
691 return(ret);
692}
693
694/**
695 * xmlStringGetNodeList:
696 * @doc: the document
697 * @value: the value of the attribute
698 *
699 * Parse the value string and build the node list associated. Should
700 * produce a flat tree with only TEXTs and ENTITY_REFs.
701 * Returns a pointer to the first child
702 */
703xmlNodePtr
704xmlStringGetNodeList(xmlDocPtr doc, const xmlChar *value) {
705 xmlNodePtr ret = NULL, last = NULL;
706 xmlNodePtr node;
707 xmlChar *val;
708 const xmlChar *cur = value;
709 const xmlChar *q;
710 xmlEntityPtr ent;
711
712 if (value == NULL) return(NULL);
713
714 q = cur;
715 while (*cur != 0) {
Daniel Veillardbdb9ba72001-04-11 11:28:06 +0000716 if (cur[0] == '&') {
717 int charval = 0;
718 xmlChar tmp;
719
Owen Taylor3473f882001-02-23 17:55:21 +0000720 /*
721 * Save the current text.
722 */
723 if (cur != q) {
724 if ((last != NULL) && (last->type == XML_TEXT_NODE)) {
725 xmlNodeAddContentLen(last, q, cur - q);
726 } else {
727 node = xmlNewDocTextLen(doc, q, cur - q);
728 if (node == NULL) return(ret);
729 if (last == NULL)
730 last = ret = node;
731 else {
732 last->next = node;
733 node->prev = last;
734 last = node;
735 }
736 }
737 }
Owen Taylor3473f882001-02-23 17:55:21 +0000738 q = cur;
Daniel Veillardbdb9ba72001-04-11 11:28:06 +0000739 if ((cur[1] == '#') && (cur[2] == 'x')) {
740 cur += 3;
741 tmp = *cur;
742 while (tmp != ';') { /* Non input consuming loop */
743 if ((tmp >= '0') && (tmp <= '9'))
744 charval = charval * 16 + (tmp - '0');
745 else if ((tmp >= 'a') && (tmp <= 'f'))
746 charval = charval * 16 + (tmp - 'a') + 10;
747 else if ((tmp >= 'A') && (tmp <= 'F'))
748 charval = charval * 16 + (tmp - 'A') + 10;
Owen Taylor3473f882001-02-23 17:55:21 +0000749 else {
Daniel Veillardbdb9ba72001-04-11 11:28:06 +0000750 xmlGenericError(xmlGenericErrorContext,
Daniel Veillardd1640922001-12-17 15:30:10 +0000751 "xmlStringGetNodeList: invalid hexadecimal charvalue\n");
Daniel Veillardbdb9ba72001-04-11 11:28:06 +0000752 charval = 0;
753 break;
754 }
755 cur++;
756 tmp = *cur;
757 }
758 if (tmp == ';')
759 cur++;
760 q = cur;
761 } else if (cur[1] == '#') {
762 cur += 2;
763 tmp = *cur;
764 while (tmp != ';') { /* Non input consuming loops */
765 if ((tmp >= '0') && (tmp <= '9'))
766 charval = charval * 10 + (tmp - '0');
767 else {
768 xmlGenericError(xmlGenericErrorContext,
Daniel Veillardd1640922001-12-17 15:30:10 +0000769 "xmlStringGetNodeList: invalid decimal charvalue\n");
Daniel Veillardbdb9ba72001-04-11 11:28:06 +0000770 charval = 0;
771 break;
772 }
773 cur++;
774 tmp = *cur;
775 }
776 if (tmp == ';')
777 cur++;
778 q = cur;
779 } else {
780 /*
781 * Read the entity string
782 */
783 cur++;
784 q = cur;
785 while ((*cur != 0) && (*cur != ';')) cur++;
786 if (*cur == 0) {
787#ifdef DEBUG_TREE
788 xmlGenericError(xmlGenericErrorContext,
789 "xmlStringGetNodeList: unterminated entity %30s\n", q);
790#endif
791 return(ret);
792 }
793 if (cur != q) {
794 /*
795 * Predefined entities don't generate nodes
796 */
797 val = xmlStrndup(q, cur - q);
798 ent = xmlGetDocEntity(doc, val);
799 if ((ent != NULL) &&
800 (ent->etype == XML_INTERNAL_PREDEFINED_ENTITY)) {
801 if (last == NULL) {
802 node = xmlNewDocText(doc, ent->content);
803 last = ret = node;
Daniel Veillard6f42c132002-01-06 23:05:13 +0000804 } else if (last->type != XML_TEXT_NODE) {
805 node = xmlNewDocText(doc, ent->content);
806 last = xmlAddNextSibling(last, node);
Daniel Veillardbdb9ba72001-04-11 11:28:06 +0000807 } else
808 xmlNodeAddContent(last, ent->content);
809
810 } else {
811 /*
812 * Create a new REFERENCE_REF node
813 */
814 node = xmlNewReference(doc, val);
815 if (node == NULL) {
816 if (val != NULL) xmlFree(val);
817 return(ret);
818 }
819 if (last == NULL) {
820 last = ret = node;
821 } else {
822 last = xmlAddNextSibling(last, node);
823 }
824 }
825 xmlFree(val);
826 }
827 cur++;
828 q = cur;
829 }
830 if (charval != 0) {
831 xmlChar buf[10];
832 int len;
833
834 len = xmlCopyCharMultiByte(buf, charval);
835 buf[len] = 0;
836 node = xmlNewDocText(doc, buf);
837 if (node != NULL) {
838 if (last == NULL) {
839 last = ret = node;
840 } else {
841 last = xmlAddNextSibling(last, node);
Owen Taylor3473f882001-02-23 17:55:21 +0000842 }
843 }
Daniel Veillardbdb9ba72001-04-11 11:28:06 +0000844
845 charval = 0;
Owen Taylor3473f882001-02-23 17:55:21 +0000846 }
Daniel Veillardbdb9ba72001-04-11 11:28:06 +0000847 } else
Owen Taylor3473f882001-02-23 17:55:21 +0000848 cur++;
849 }
Daniel Veillard75bea542001-05-11 17:41:21 +0000850 if ((cur != q) || (ret == NULL)) {
Owen Taylor3473f882001-02-23 17:55:21 +0000851 /*
852 * Handle the last piece of text.
853 */
854 if ((last != NULL) && (last->type == XML_TEXT_NODE)) {
855 xmlNodeAddContentLen(last, q, cur - q);
856 } else {
857 node = xmlNewDocTextLen(doc, q, cur - q);
858 if (node == NULL) return(ret);
Daniel Veillardbdb9ba72001-04-11 11:28:06 +0000859 if (last == NULL) {
Owen Taylor3473f882001-02-23 17:55:21 +0000860 last = ret = node;
Daniel Veillardbdb9ba72001-04-11 11:28:06 +0000861 } else {
862 last = xmlAddNextSibling(last, node);
Owen Taylor3473f882001-02-23 17:55:21 +0000863 }
864 }
865 }
866 return(ret);
867}
868
869/**
870 * xmlNodeListGetString:
871 * @doc: the document
872 * @list: a Node list
873 * @inLine: should we replace entity contents or show their external form
874 *
875 * Returns the string equivalent to the text contained in the Node list
876 * made of TEXTs and ENTITY_REFs
Daniel Veillardd1640922001-12-17 15:30:10 +0000877 * Returns a pointer to the string copy, the caller must free it.
Owen Taylor3473f882001-02-23 17:55:21 +0000878 */
879xmlChar *
880xmlNodeListGetString(xmlDocPtr doc, xmlNodePtr list, int inLine) {
881 xmlNodePtr node = list;
882 xmlChar *ret = NULL;
883 xmlEntityPtr ent;
884
885 if (list == NULL) return(NULL);
886
887 while (node != NULL) {
888 if ((node->type == XML_TEXT_NODE) ||
889 (node->type == XML_CDATA_SECTION_NODE)) {
890 if (inLine) {
891#ifndef XML_USE_BUFFER_CONTENT
892 ret = xmlStrcat(ret, node->content);
893#else
894 ret = xmlStrcat(ret, xmlBufferContent(node->content));
895#endif
896 } else {
897 xmlChar *buffer;
898
899#ifndef XML_USE_BUFFER_CONTENT
900 buffer = xmlEncodeEntitiesReentrant(doc, node->content);
901#else
902 buffer = xmlEncodeEntitiesReentrant(doc,
903 xmlBufferContent(node->content));
904#endif
905 if (buffer != NULL) {
906 ret = xmlStrcat(ret, buffer);
907 xmlFree(buffer);
908 }
909 }
910 } else if (node->type == XML_ENTITY_REF_NODE) {
911 if (inLine) {
912 ent = xmlGetDocEntity(doc, node->name);
913 if (ent != NULL)
914 ret = xmlStrcat(ret, ent->content);
915 else {
916#ifndef XML_USE_BUFFER_CONTENT
917 ret = xmlStrcat(ret, node->content);
918#else
919 ret = xmlStrcat(ret, xmlBufferContent(node->content));
920#endif
921 }
922 } else {
923 xmlChar buf[2];
924 buf[0] = '&'; buf[1] = 0;
925 ret = xmlStrncat(ret, buf, 1);
926 ret = xmlStrcat(ret, node->name);
927 buf[0] = ';'; buf[1] = 0;
928 ret = xmlStrncat(ret, buf, 1);
929 }
930 }
931#if 0
932 else {
933 xmlGenericError(xmlGenericErrorContext,
Daniel Veillardd1640922001-12-17 15:30:10 +0000934 "xmlGetNodeListString : invalid node type %d\n",
Owen Taylor3473f882001-02-23 17:55:21 +0000935 node->type);
936 }
937#endif
938 node = node->next;
939 }
940 return(ret);
941}
942
943/**
944 * xmlNodeListGetRawString:
945 * @doc: the document
946 * @list: a Node list
947 * @inLine: should we replace entity contents or show their external form
948 *
949 * Returns the string equivalent to the text contained in the Node list
950 * made of TEXTs and ENTITY_REFs, contrary to xmlNodeListGetString()
951 * this function doesn't do any character encoding handling.
952 *
Daniel Veillardd1640922001-12-17 15:30:10 +0000953 * Returns a pointer to the string copy, the caller must free it.
Owen Taylor3473f882001-02-23 17:55:21 +0000954 */
955xmlChar *
956xmlNodeListGetRawString(xmlDocPtr doc, xmlNodePtr list, int inLine) {
957 xmlNodePtr node = list;
958 xmlChar *ret = NULL;
959 xmlEntityPtr ent;
960
961 if (list == NULL) return(NULL);
962
963 while (node != NULL) {
Daniel Veillard7db37732001-07-12 01:20:08 +0000964 if ((node->type == XML_TEXT_NODE) ||
965 (node->type == XML_CDATA_SECTION_NODE)) {
Owen Taylor3473f882001-02-23 17:55:21 +0000966 if (inLine) {
967#ifndef XML_USE_BUFFER_CONTENT
968 ret = xmlStrcat(ret, node->content);
969#else
970 ret = xmlStrcat(ret, xmlBufferContent(node->content));
971#endif
972 } else {
973 xmlChar *buffer;
974
975#ifndef XML_USE_BUFFER_CONTENT
976 buffer = xmlEncodeSpecialChars(doc, node->content);
977#else
978 buffer = xmlEncodeSpecialChars(doc,
979 xmlBufferContent(node->content));
980#endif
981 if (buffer != NULL) {
982 ret = xmlStrcat(ret, buffer);
983 xmlFree(buffer);
984 }
985 }
986 } else if (node->type == XML_ENTITY_REF_NODE) {
987 if (inLine) {
988 ent = xmlGetDocEntity(doc, node->name);
989 if (ent != NULL)
990 ret = xmlStrcat(ret, ent->content);
991 else {
992#ifndef XML_USE_BUFFER_CONTENT
993 ret = xmlStrcat(ret, node->content);
994#else
995 ret = xmlStrcat(ret, xmlBufferContent(node->content));
996#endif
997 }
998 } else {
999 xmlChar buf[2];
1000 buf[0] = '&'; buf[1] = 0;
1001 ret = xmlStrncat(ret, buf, 1);
1002 ret = xmlStrcat(ret, node->name);
1003 buf[0] = ';'; buf[1] = 0;
1004 ret = xmlStrncat(ret, buf, 1);
1005 }
1006 }
1007#if 0
1008 else {
1009 xmlGenericError(xmlGenericErrorContext,
Daniel Veillardd1640922001-12-17 15:30:10 +00001010 "xmlGetNodeListString : invalid node type %d\n",
Owen Taylor3473f882001-02-23 17:55:21 +00001011 node->type);
1012 }
1013#endif
1014 node = node->next;
1015 }
1016 return(ret);
1017}
1018
1019/**
1020 * xmlNewProp:
1021 * @node: the holding node
1022 * @name: the name of the attribute
1023 * @value: the value of the attribute
1024 *
1025 * Create a new property carried by a node.
1026 * Returns a pointer to the attribute
1027 */
1028xmlAttrPtr
1029xmlNewProp(xmlNodePtr node, const xmlChar *name, const xmlChar *value) {
1030 xmlAttrPtr cur;
1031 xmlDocPtr doc = NULL;
1032
1033 if (name == NULL) {
1034#ifdef DEBUG_TREE
1035 xmlGenericError(xmlGenericErrorContext,
1036 "xmlNewProp : name == NULL\n");
1037#endif
1038 return(NULL);
1039 }
1040
1041 /*
1042 * Allocate a new property and fill the fields.
1043 */
1044 cur = (xmlAttrPtr) xmlMalloc(sizeof(xmlAttr));
1045 if (cur == NULL) {
1046 xmlGenericError(xmlGenericErrorContext,
1047 "xmlNewProp : malloc failed\n");
1048 return(NULL);
1049 }
1050 memset(cur, 0, sizeof(xmlAttr));
1051 cur->type = XML_ATTRIBUTE_NODE;
1052
1053 cur->parent = node;
1054 if (node != NULL) {
1055 doc = node->doc;
1056 cur->doc = doc;
1057 }
1058 cur->name = xmlStrdup(name);
1059 if (value != NULL) {
1060 xmlChar *buffer;
1061 xmlNodePtr tmp;
1062
1063 buffer = xmlEncodeEntitiesReentrant(doc, value);
1064 cur->children = xmlStringGetNodeList(doc, buffer);
1065 cur->last = NULL;
1066 tmp = cur->children;
1067 while (tmp != NULL) {
1068 tmp->parent = (xmlNodePtr) cur;
1069 tmp->doc = doc;
1070 if (tmp->next == NULL)
1071 cur->last = tmp;
1072 tmp = tmp->next;
1073 }
1074 xmlFree(buffer);
1075 }
1076
1077 /*
1078 * Add it at the end to preserve parsing order ...
1079 */
1080 if (node != NULL) {
1081 if (node->properties == NULL) {
1082 node->properties = cur;
1083 } else {
1084 xmlAttrPtr prev = node->properties;
1085
1086 while (prev->next != NULL) prev = prev->next;
1087 prev->next = cur;
1088 cur->prev = prev;
1089 }
1090 }
1091 return(cur);
1092}
1093
1094/**
1095 * xmlNewNsProp:
1096 * @node: the holding node
1097 * @ns: the namespace
1098 * @name: the name of the attribute
1099 * @value: the value of the attribute
1100 *
1101 * Create a new property tagged with a namespace and carried by a node.
1102 * Returns a pointer to the attribute
1103 */
1104xmlAttrPtr
1105xmlNewNsProp(xmlNodePtr node, xmlNsPtr ns, const xmlChar *name,
1106 const xmlChar *value) {
1107 xmlAttrPtr cur;
Daniel Veillarda682b212001-06-07 19:59:42 +00001108 xmlDocPtr doc = NULL;
Owen Taylor3473f882001-02-23 17:55:21 +00001109
1110 if (name == NULL) {
1111#ifdef DEBUG_TREE
1112 xmlGenericError(xmlGenericErrorContext,
Daniel Veillardd1640922001-12-17 15:30:10 +00001113 "xmlNewNsProp : name == NULL\n");
Owen Taylor3473f882001-02-23 17:55:21 +00001114#endif
1115 return(NULL);
1116 }
1117
1118 /*
1119 * Allocate a new property and fill the fields.
1120 */
1121 cur = (xmlAttrPtr) xmlMalloc(sizeof(xmlAttr));
1122 if (cur == NULL) {
1123 xmlGenericError(xmlGenericErrorContext,
Daniel Veillardd1640922001-12-17 15:30:10 +00001124 "xmlNewNsProp : malloc failed\n");
Owen Taylor3473f882001-02-23 17:55:21 +00001125 return(NULL);
1126 }
1127 memset(cur, 0, sizeof(xmlAttr));
1128 cur->type = XML_ATTRIBUTE_NODE;
1129
1130 cur->parent = node;
Daniel Veillarda682b212001-06-07 19:59:42 +00001131 if (node != NULL) {
1132 doc = node->doc;
1133 cur->doc = doc;
1134 }
Owen Taylor3473f882001-02-23 17:55:21 +00001135 cur->ns = ns;
1136 cur->name = xmlStrdup(name);
1137 if (value != NULL) {
1138 xmlChar *buffer;
1139 xmlNodePtr tmp;
1140
Daniel Veillarda682b212001-06-07 19:59:42 +00001141 buffer = xmlEncodeEntitiesReentrant(doc, value);
1142 cur->children = xmlStringGetNodeList(doc, buffer);
Owen Taylor3473f882001-02-23 17:55:21 +00001143 cur->last = NULL;
1144 tmp = cur->children;
1145 while (tmp != NULL) {
1146 tmp->parent = (xmlNodePtr) cur;
1147 if (tmp->next == NULL)
1148 cur->last = tmp;
1149 tmp = tmp->next;
1150 }
1151 xmlFree(buffer);
1152 }
1153
1154 /*
1155 * Add it at the end to preserve parsing order ...
1156 */
1157 if (node != NULL) {
1158 if (node->properties == NULL) {
1159 node->properties = cur;
1160 } else {
1161 xmlAttrPtr prev = node->properties;
1162
1163 while (prev->next != NULL) prev = prev->next;
1164 prev->next = cur;
1165 cur->prev = prev;
1166 }
1167 }
1168 return(cur);
1169}
1170
1171/**
1172 * xmlNewDocProp:
1173 * @doc: the document
1174 * @name: the name of the attribute
1175 * @value: the value of the attribute
1176 *
1177 * Create a new property carried by a document.
1178 * Returns a pointer to the attribute
1179 */
1180xmlAttrPtr
1181xmlNewDocProp(xmlDocPtr doc, const xmlChar *name, const xmlChar *value) {
1182 xmlAttrPtr cur;
1183
1184 if (name == NULL) {
1185#ifdef DEBUG_TREE
1186 xmlGenericError(xmlGenericErrorContext,
Daniel Veillardd1640922001-12-17 15:30:10 +00001187 "xmlNewDocProp : name == NULL\n");
Owen Taylor3473f882001-02-23 17:55:21 +00001188#endif
1189 return(NULL);
1190 }
1191
1192 /*
1193 * Allocate a new property and fill the fields.
1194 */
1195 cur = (xmlAttrPtr) xmlMalloc(sizeof(xmlAttr));
1196 if (cur == NULL) {
1197 xmlGenericError(xmlGenericErrorContext,
Daniel Veillardd1640922001-12-17 15:30:10 +00001198 "xmlNewDocProp : malloc failed\n");
Owen Taylor3473f882001-02-23 17:55:21 +00001199 return(NULL);
1200 }
1201 memset(cur, 0, sizeof(xmlAttr));
1202 cur->type = XML_ATTRIBUTE_NODE;
1203
1204 cur->name = xmlStrdup(name);
1205 cur->doc = doc;
1206 if (value != NULL) {
1207 xmlNodePtr tmp;
1208
1209 cur->children = xmlStringGetNodeList(doc, value);
1210 cur->last = NULL;
1211
1212 tmp = cur->children;
1213 while (tmp != NULL) {
1214 tmp->parent = (xmlNodePtr) cur;
1215 if (tmp->next == NULL)
1216 cur->last = tmp;
1217 tmp = tmp->next;
1218 }
1219 }
1220 return(cur);
1221}
1222
1223/**
1224 * xmlFreePropList:
1225 * @cur: the first property in the list
1226 *
1227 * Free a property and all its siblings, all the children are freed too.
1228 */
1229void
1230xmlFreePropList(xmlAttrPtr cur) {
1231 xmlAttrPtr next;
1232 if (cur == NULL) {
1233#ifdef DEBUG_TREE
1234 xmlGenericError(xmlGenericErrorContext,
1235 "xmlFreePropList : property == NULL\n");
1236#endif
1237 return;
1238 }
1239 while (cur != NULL) {
1240 next = cur->next;
1241 xmlFreeProp(cur);
1242 cur = next;
1243 }
1244}
1245
1246/**
1247 * xmlFreeProp:
1248 * @cur: an attribute
1249 *
1250 * Free one attribute, all the content is freed too
1251 */
1252void
1253xmlFreeProp(xmlAttrPtr cur) {
1254 if (cur == NULL) {
1255#ifdef DEBUG_TREE
1256 xmlGenericError(xmlGenericErrorContext,
1257 "xmlFreeProp : property == NULL\n");
1258#endif
1259 return;
1260 }
1261 /* Check for ID removal -> leading to invalid references ! */
Daniel Veillard76d66f42001-05-16 21:05:17 +00001262 if ((cur->parent != NULL) && (cur->parent->doc != NULL) &&
1263 ((cur->parent->doc->intSubset != NULL) ||
1264 (cur->parent->doc->extSubset != NULL))) {
1265 if (xmlIsID(cur->parent->doc, cur->parent, cur))
1266 xmlRemoveID(cur->parent->doc, cur);
1267 }
Owen Taylor3473f882001-02-23 17:55:21 +00001268 if (cur->name != NULL) xmlFree((char *) cur->name);
1269 if (cur->children != NULL) xmlFreeNodeList(cur->children);
Owen Taylor3473f882001-02-23 17:55:21 +00001270 xmlFree(cur);
1271}
1272
1273/**
1274 * xmlRemoveProp:
1275 * @cur: an attribute
1276 *
1277 * Unlink and free one attribute, all the content is freed too
1278 * Note this doesn't work for namespace definition attributes
1279 *
1280 * Returns 0 if success and -1 in case of error.
1281 */
1282int
1283xmlRemoveProp(xmlAttrPtr cur) {
1284 xmlAttrPtr tmp;
1285 if (cur == NULL) {
1286#ifdef DEBUG_TREE
1287 xmlGenericError(xmlGenericErrorContext,
1288 "xmlRemoveProp : cur == NULL\n");
1289#endif
1290 return(-1);
1291 }
1292 if (cur->parent == NULL) {
1293#ifdef DEBUG_TREE
1294 xmlGenericError(xmlGenericErrorContext,
1295 "xmlRemoveProp : cur->parent == NULL\n");
1296#endif
1297 return(-1);
1298 }
1299 tmp = cur->parent->properties;
1300 if (tmp == cur) {
1301 cur->parent->properties = cur->next;
1302 xmlFreeProp(cur);
1303 return(0);
1304 }
1305 while (tmp != NULL) {
1306 if (tmp->next == cur) {
1307 tmp->next = cur->next;
1308 if (tmp->next != NULL)
1309 tmp->next->prev = tmp;
1310 xmlFreeProp(cur);
1311 return(0);
1312 }
1313 tmp = tmp->next;
1314 }
1315#ifdef DEBUG_TREE
1316 xmlGenericError(xmlGenericErrorContext,
1317 "xmlRemoveProp : attribute not owned by its node\n");
1318#endif
1319 return(-1);
1320}
1321
1322/**
1323 * xmlNewPI:
1324 * @name: the processing instruction name
1325 * @content: the PI content
1326 *
1327 * Creation of a processing instruction element.
1328 * Returns a pointer to the new node object.
1329 */
1330xmlNodePtr
1331xmlNewPI(const xmlChar *name, const xmlChar *content) {
1332 xmlNodePtr cur;
1333
1334 if (name == NULL) {
1335#ifdef DEBUG_TREE
1336 xmlGenericError(xmlGenericErrorContext,
1337 "xmlNewPI : name == NULL\n");
1338#endif
1339 return(NULL);
1340 }
1341
1342 /*
1343 * Allocate a new node and fill the fields.
1344 */
1345 cur = (xmlNodePtr) xmlMalloc(sizeof(xmlNode));
1346 if (cur == NULL) {
1347 xmlGenericError(xmlGenericErrorContext,
1348 "xmlNewPI : malloc failed\n");
1349 return(NULL);
1350 }
1351 memset(cur, 0, sizeof(xmlNode));
1352 cur->type = XML_PI_NODE;
1353
1354 cur->name = xmlStrdup(name);
1355 if (content != NULL) {
1356#ifndef XML_USE_BUFFER_CONTENT
1357 cur->content = xmlStrdup(content);
1358#else
1359 cur->content = xmlBufferCreateSize(0);
1360 xmlBufferSetAllocationScheme(cur->content,
1361 xmlGetBufferAllocationScheme());
1362 xmlBufferAdd(cur->content, content, -1);
1363#endif
1364 }
1365 return(cur);
1366}
1367
1368/**
1369 * xmlNewNode:
1370 * @ns: namespace if any
1371 * @name: the node name
1372 *
Daniel Veillardd1640922001-12-17 15:30:10 +00001373 * Creation of a new node element. @ns is optional (NULL).
Owen Taylor3473f882001-02-23 17:55:21 +00001374 *
1375 * Returns a pointer to the new node object.
1376 */
1377xmlNodePtr
1378xmlNewNode(xmlNsPtr ns, const xmlChar *name) {
1379 xmlNodePtr cur;
1380
1381 if (name == NULL) {
1382#ifdef DEBUG_TREE
1383 xmlGenericError(xmlGenericErrorContext,
1384 "xmlNewNode : name == NULL\n");
1385#endif
1386 return(NULL);
1387 }
1388
1389 /*
1390 * Allocate a new node and fill the fields.
1391 */
1392 cur = (xmlNodePtr) xmlMalloc(sizeof(xmlNode));
1393 if (cur == NULL) {
1394 xmlGenericError(xmlGenericErrorContext,
1395 "xmlNewNode : malloc failed\n");
1396 return(NULL);
1397 }
1398 memset(cur, 0, sizeof(xmlNode));
1399 cur->type = XML_ELEMENT_NODE;
1400
1401 cur->name = xmlStrdup(name);
1402 cur->ns = ns;
1403 return(cur);
1404}
1405
1406/**
1407 * xmlNewDocNode:
1408 * @doc: the document
1409 * @ns: namespace if any
1410 * @name: the node name
1411 * @content: the XML text content if any
1412 *
1413 * Creation of a new node element within a document. @ns and @content
Daniel Veillardd1640922001-12-17 15:30:10 +00001414 * are optional (NULL).
Owen Taylor3473f882001-02-23 17:55:21 +00001415 * NOTE: @content is supposed to be a piece of XML CDATA, so it allow entities
1416 * references, but XML special chars need to be escaped first by using
1417 * xmlEncodeEntitiesReentrant(). Use xmlNewDocRawNode() if you don't
1418 * need entities support.
1419 *
1420 * Returns a pointer to the new node object.
1421 */
1422xmlNodePtr
1423xmlNewDocNode(xmlDocPtr doc, xmlNsPtr ns,
1424 const xmlChar *name, const xmlChar *content) {
1425 xmlNodePtr cur;
1426
1427 cur = xmlNewNode(ns, name);
1428 if (cur != NULL) {
1429 cur->doc = doc;
1430 if (content != NULL) {
1431 cur->children = xmlStringGetNodeList(doc, content);
1432 UPDATE_LAST_CHILD_AND_PARENT(cur)
1433 }
1434 }
1435 return(cur);
1436}
1437
1438
1439/**
1440 * xmlNewDocRawNode:
1441 * @doc: the document
1442 * @ns: namespace if any
1443 * @name: the node name
1444 * @content: the text content if any
1445 *
1446 * Creation of a new node element within a document. @ns and @content
Daniel Veillardd1640922001-12-17 15:30:10 +00001447 * are optional (NULL).
Owen Taylor3473f882001-02-23 17:55:21 +00001448 *
1449 * Returns a pointer to the new node object.
1450 */
1451xmlNodePtr
1452xmlNewDocRawNode(xmlDocPtr doc, xmlNsPtr ns,
1453 const xmlChar *name, const xmlChar *content) {
1454 xmlNodePtr cur;
1455
1456 cur = xmlNewNode(ns, name);
1457 if (cur != NULL) {
1458 cur->doc = doc;
1459 if (content != NULL) {
1460 cur->children = xmlNewDocText(doc, content);
1461 UPDATE_LAST_CHILD_AND_PARENT(cur)
1462 }
1463 }
1464 return(cur);
1465}
1466
1467/**
1468 * xmlNewDocFragment:
1469 * @doc: the document owning the fragment
1470 *
1471 * Creation of a new Fragment node.
1472 * Returns a pointer to the new node object.
1473 */
1474xmlNodePtr
1475xmlNewDocFragment(xmlDocPtr doc) {
1476 xmlNodePtr cur;
1477
1478 /*
1479 * Allocate a new DocumentFragment node and fill the fields.
1480 */
1481 cur = (xmlNodePtr) xmlMalloc(sizeof(xmlNode));
1482 if (cur == NULL) {
1483 xmlGenericError(xmlGenericErrorContext,
1484 "xmlNewDocFragment : malloc failed\n");
1485 return(NULL);
1486 }
1487 memset(cur, 0, sizeof(xmlNode));
1488 cur->type = XML_DOCUMENT_FRAG_NODE;
1489
1490 cur->doc = doc;
1491 return(cur);
1492}
1493
1494/**
1495 * xmlNewText:
1496 * @content: the text content
1497 *
1498 * Creation of a new text node.
1499 * Returns a pointer to the new node object.
1500 */
1501xmlNodePtr
1502xmlNewText(const xmlChar *content) {
1503 xmlNodePtr cur;
1504
1505 /*
1506 * Allocate a new node and fill the fields.
1507 */
1508 cur = (xmlNodePtr) xmlMalloc(sizeof(xmlNode));
1509 if (cur == NULL) {
1510 xmlGenericError(xmlGenericErrorContext,
1511 "xmlNewText : malloc failed\n");
1512 return(NULL);
1513 }
1514 memset(cur, 0, sizeof(xmlNode));
1515 cur->type = XML_TEXT_NODE;
1516
1517 cur->name = xmlStringText;
1518 if (content != NULL) {
1519#ifndef XML_USE_BUFFER_CONTENT
1520 cur->content = xmlStrdup(content);
1521#else
1522 cur->content = xmlBufferCreateSize(0);
1523 xmlBufferSetAllocationScheme(cur->content,
1524 xmlGetBufferAllocationScheme());
1525 xmlBufferAdd(cur->content, content, -1);
1526#endif
1527 }
1528 return(cur);
1529}
1530
1531/**
1532 * xmlNewTextChild:
1533 * @parent: the parent node
1534 * @ns: a namespace if any
1535 * @name: the name of the child
1536 * @content: the text content of the child if any.
1537 *
1538 * Creation of a new child element, added at the end of @parent children list.
Daniel Veillardd1640922001-12-17 15:30:10 +00001539 * @ns and @content parameters are optional (NULL). If content is non NULL,
Owen Taylor3473f882001-02-23 17:55:21 +00001540 * a child TEXT node will be created containing the string content.
1541 *
1542 * Returns a pointer to the new node object.
1543 */
1544xmlNodePtr
1545xmlNewTextChild(xmlNodePtr parent, xmlNsPtr ns,
1546 const xmlChar *name, const xmlChar *content) {
1547 xmlNodePtr cur, prev;
1548
1549 if (parent == NULL) {
1550#ifdef DEBUG_TREE
1551 xmlGenericError(xmlGenericErrorContext,
1552 "xmlNewTextChild : parent == NULL\n");
1553#endif
1554 return(NULL);
1555 }
1556
1557 if (name == NULL) {
1558#ifdef DEBUG_TREE
1559 xmlGenericError(xmlGenericErrorContext,
1560 "xmlNewTextChild : name == NULL\n");
1561#endif
1562 return(NULL);
1563 }
1564
1565 /*
1566 * Allocate a new node
1567 */
1568 if (ns == NULL)
1569 cur = xmlNewDocRawNode(parent->doc, parent->ns, name, content);
1570 else
1571 cur = xmlNewDocRawNode(parent->doc, ns, name, content);
1572 if (cur == NULL) return(NULL);
1573
1574 /*
1575 * add the new element at the end of the children list.
1576 */
1577 cur->type = XML_ELEMENT_NODE;
1578 cur->parent = parent;
1579 cur->doc = parent->doc;
1580 if (parent->children == NULL) {
1581 parent->children = cur;
1582 parent->last = cur;
1583 } else {
1584 prev = parent->last;
1585 prev->next = cur;
1586 cur->prev = prev;
1587 parent->last = cur;
1588 }
1589
1590 return(cur);
1591}
1592
1593/**
1594 * xmlNewCharRef:
1595 * @doc: the document
1596 * @name: the char ref string, starting with # or "&# ... ;"
1597 *
1598 * Creation of a new character reference node.
1599 * Returns a pointer to the new node object.
1600 */
1601xmlNodePtr
1602xmlNewCharRef(xmlDocPtr doc, const xmlChar *name) {
1603 xmlNodePtr cur;
1604
1605 /*
1606 * Allocate a new node and fill the fields.
1607 */
1608 cur = (xmlNodePtr) xmlMalloc(sizeof(xmlNode));
1609 if (cur == NULL) {
1610 xmlGenericError(xmlGenericErrorContext,
Daniel Veillardd1640922001-12-17 15:30:10 +00001611 "xmlNewCharRef : malloc failed\n");
Owen Taylor3473f882001-02-23 17:55:21 +00001612 return(NULL);
1613 }
1614 memset(cur, 0, sizeof(xmlNode));
1615 cur->type = XML_ENTITY_REF_NODE;
1616
1617 cur->doc = doc;
1618 if (name[0] == '&') {
1619 int len;
1620 name++;
1621 len = xmlStrlen(name);
1622 if (name[len - 1] == ';')
1623 cur->name = xmlStrndup(name, len - 1);
1624 else
1625 cur->name = xmlStrndup(name, len);
1626 } else
1627 cur->name = xmlStrdup(name);
1628 return(cur);
1629}
1630
1631/**
1632 * xmlNewReference:
1633 * @doc: the document
1634 * @name: the reference name, or the reference string with & and ;
1635 *
1636 * Creation of a new reference node.
1637 * Returns a pointer to the new node object.
1638 */
1639xmlNodePtr
1640xmlNewReference(xmlDocPtr doc, const xmlChar *name) {
1641 xmlNodePtr cur;
1642 xmlEntityPtr ent;
1643
1644 /*
1645 * Allocate a new node and fill the fields.
1646 */
1647 cur = (xmlNodePtr) xmlMalloc(sizeof(xmlNode));
1648 if (cur == NULL) {
1649 xmlGenericError(xmlGenericErrorContext,
Daniel Veillardd1640922001-12-17 15:30:10 +00001650 "xmlNewReference : malloc failed\n");
Owen Taylor3473f882001-02-23 17:55:21 +00001651 return(NULL);
1652 }
1653 memset(cur, 0, sizeof(xmlNode));
1654 cur->type = XML_ENTITY_REF_NODE;
1655
1656 cur->doc = doc;
1657 if (name[0] == '&') {
1658 int len;
1659 name++;
1660 len = xmlStrlen(name);
1661 if (name[len - 1] == ';')
1662 cur->name = xmlStrndup(name, len - 1);
1663 else
1664 cur->name = xmlStrndup(name, len);
1665 } else
1666 cur->name = xmlStrdup(name);
1667
1668 ent = xmlGetDocEntity(doc, cur->name);
1669 if (ent != NULL) {
1670#ifndef XML_USE_BUFFER_CONTENT
1671 cur->content = ent->content;
1672#else
1673 /*
1674 * CJN 11.18.99 this might be a problem, since the xmlBuffer gets
1675 * a copy of this pointer. Let's hope we don't manipulate it
1676 * later
1677 */
1678 cur->content = xmlBufferCreateSize(0);
1679 xmlBufferSetAllocationScheme(cur->content,
1680 xmlGetBufferAllocationScheme());
1681 if (ent->content != NULL)
1682 xmlBufferAdd(cur->content, ent->content, -1);
1683#endif
1684 /*
Daniel Veillardcbaf3992001-12-31 16:16:02 +00001685 * The parent pointer in entity is a DTD pointer and thus is NOT
Owen Taylor3473f882001-02-23 17:55:21 +00001686 * updated. Not sure if this is 100% correct.
1687 * -George
1688 */
1689 cur->children = (xmlNodePtr) ent;
1690 cur->last = (xmlNodePtr) ent;
1691 }
1692 return(cur);
1693}
1694
1695/**
1696 * xmlNewDocText:
1697 * @doc: the document
1698 * @content: the text content
1699 *
1700 * Creation of a new text node within a document.
1701 * Returns a pointer to the new node object.
1702 */
1703xmlNodePtr
1704xmlNewDocText(xmlDocPtr doc, const xmlChar *content) {
1705 xmlNodePtr cur;
1706
1707 cur = xmlNewText(content);
1708 if (cur != NULL) cur->doc = doc;
1709 return(cur);
1710}
1711
1712/**
1713 * xmlNewTextLen:
1714 * @content: the text content
1715 * @len: the text len.
1716 *
Daniel Veillard60087f32001-10-10 09:45:09 +00001717 * Creation of a new text node with an extra parameter for the content's length
Owen Taylor3473f882001-02-23 17:55:21 +00001718 * Returns a pointer to the new node object.
1719 */
1720xmlNodePtr
1721xmlNewTextLen(const xmlChar *content, int len) {
1722 xmlNodePtr cur;
1723
1724 /*
1725 * Allocate a new node and fill the fields.
1726 */
1727 cur = (xmlNodePtr) xmlMalloc(sizeof(xmlNode));
1728 if (cur == NULL) {
1729 xmlGenericError(xmlGenericErrorContext,
Daniel Veillardd1640922001-12-17 15:30:10 +00001730 "xmlNewTextLen : malloc failed\n");
Owen Taylor3473f882001-02-23 17:55:21 +00001731 return(NULL);
1732 }
1733 memset(cur, 0, sizeof(xmlNode));
1734 cur->type = XML_TEXT_NODE;
1735
1736 cur->name = xmlStringText;
1737 if (content != NULL) {
1738#ifndef XML_USE_BUFFER_CONTENT
1739 cur->content = xmlStrndup(content, len);
1740#else
1741 cur->content = xmlBufferCreateSize(len);
1742 xmlBufferSetAllocationScheme(cur->content,
1743 xmlGetBufferAllocationScheme());
1744 xmlBufferAdd(cur->content, content, len);
1745#endif
1746 }
1747 return(cur);
1748}
1749
1750/**
1751 * xmlNewDocTextLen:
1752 * @doc: the document
1753 * @content: the text content
1754 * @len: the text len.
1755 *
Daniel Veillard60087f32001-10-10 09:45:09 +00001756 * Creation of a new text node with an extra content length parameter. The
Owen Taylor3473f882001-02-23 17:55:21 +00001757 * text node pertain to a given document.
1758 * Returns a pointer to the new node object.
1759 */
1760xmlNodePtr
1761xmlNewDocTextLen(xmlDocPtr doc, const xmlChar *content, int len) {
1762 xmlNodePtr cur;
1763
1764 cur = xmlNewTextLen(content, len);
1765 if (cur != NULL) cur->doc = doc;
1766 return(cur);
1767}
1768
1769/**
1770 * xmlNewComment:
1771 * @content: the comment content
1772 *
1773 * Creation of a new node containing a comment.
1774 * Returns a pointer to the new node object.
1775 */
1776xmlNodePtr
1777xmlNewComment(const xmlChar *content) {
1778 xmlNodePtr cur;
1779
1780 /*
1781 * Allocate a new node and fill the fields.
1782 */
1783 cur = (xmlNodePtr) xmlMalloc(sizeof(xmlNode));
1784 if (cur == NULL) {
1785 xmlGenericError(xmlGenericErrorContext,
1786 "xmlNewComment : malloc failed\n");
1787 return(NULL);
1788 }
1789 memset(cur, 0, sizeof(xmlNode));
1790 cur->type = XML_COMMENT_NODE;
1791
1792 cur->name = xmlStringComment;
1793 if (content != NULL) {
1794#ifndef XML_USE_BUFFER_CONTENT
1795 cur->content = xmlStrdup(content);
1796#else
1797 cur->content = xmlBufferCreateSize(0);
1798 xmlBufferSetAllocationScheme(cur->content,
1799 xmlGetBufferAllocationScheme());
1800 xmlBufferAdd(cur->content, content, -1);
1801#endif
1802 }
1803 return(cur);
1804}
1805
1806/**
1807 * xmlNewCDataBlock:
1808 * @doc: the document
Daniel Veillardd1640922001-12-17 15:30:10 +00001809 * @content: the CDATA block content content
Owen Taylor3473f882001-02-23 17:55:21 +00001810 * @len: the length of the block
1811 *
Daniel Veillardd1640922001-12-17 15:30:10 +00001812 * Creation of a new node containing a CDATA block.
Owen Taylor3473f882001-02-23 17:55:21 +00001813 * Returns a pointer to the new node object.
1814 */
1815xmlNodePtr
1816xmlNewCDataBlock(xmlDocPtr doc, const xmlChar *content, int len) {
1817 xmlNodePtr cur;
1818
1819 /*
1820 * Allocate a new node and fill the fields.
1821 */
1822 cur = (xmlNodePtr) xmlMalloc(sizeof(xmlNode));
1823 if (cur == NULL) {
1824 xmlGenericError(xmlGenericErrorContext,
1825 "xmlNewCDataBlock : malloc failed\n");
1826 return(NULL);
1827 }
1828 memset(cur, 0, sizeof(xmlNode));
1829 cur->type = XML_CDATA_SECTION_NODE;
Daniel Veillard56a4cb82001-03-24 17:00:36 +00001830 cur->doc = doc;
Owen Taylor3473f882001-02-23 17:55:21 +00001831
1832 if (content != NULL) {
1833#ifndef XML_USE_BUFFER_CONTENT
1834 cur->content = xmlStrndup(content, len);
1835#else
1836 cur->content = xmlBufferCreateSize(len);
1837 xmlBufferSetAllocationScheme(cur->content,
1838 xmlGetBufferAllocationScheme());
1839 xmlBufferAdd(cur->content, content, len);
1840#endif
1841 }
1842 return(cur);
1843}
1844
1845/**
1846 * xmlNewDocComment:
1847 * @doc: the document
1848 * @content: the comment content
1849 *
Daniel Veillardd1640922001-12-17 15:30:10 +00001850 * Creation of a new node containing a comment within a document.
Owen Taylor3473f882001-02-23 17:55:21 +00001851 * Returns a pointer to the new node object.
1852 */
1853xmlNodePtr
1854xmlNewDocComment(xmlDocPtr doc, const xmlChar *content) {
1855 xmlNodePtr cur;
1856
1857 cur = xmlNewComment(content);
1858 if (cur != NULL) cur->doc = doc;
1859 return(cur);
1860}
1861
1862/**
1863 * xmlSetTreeDoc:
1864 * @tree: the top element
1865 * @doc: the document
1866 *
1867 * update all nodes under the tree to point to the right document
1868 */
1869void
1870xmlSetTreeDoc(xmlNodePtr tree, xmlDocPtr doc) {
Daniel Veillard19e96c32001-07-09 10:32:59 +00001871 xmlAttrPtr prop;
1872
Owen Taylor3473f882001-02-23 17:55:21 +00001873 if (tree == NULL)
1874 return;
Owen Taylor3473f882001-02-23 17:55:21 +00001875 if (tree->doc != doc) {
Daniel Veillard36065812002-01-24 15:02:46 +00001876 if(tree->type == XML_ELEMENT_NODE) {
1877 prop = tree->properties;
1878 while (prop != NULL) {
1879 prop->doc = doc;
1880 xmlSetListDoc(prop->children, doc);
1881 prop = prop->next;
1882 }
Daniel Veillard19e96c32001-07-09 10:32:59 +00001883 }
Owen Taylor3473f882001-02-23 17:55:21 +00001884 if (tree->children != NULL)
1885 xmlSetListDoc(tree->children, doc);
1886 tree->doc = doc;
1887 }
1888}
1889
1890/**
1891 * xmlSetListDoc:
Daniel Veillardd1640922001-12-17 15:30:10 +00001892 * @list: the first element
Owen Taylor3473f882001-02-23 17:55:21 +00001893 * @doc: the document
1894 *
1895 * update all nodes in the list to point to the right document
1896 */
1897void
1898xmlSetListDoc(xmlNodePtr list, xmlDocPtr doc) {
1899 xmlNodePtr cur;
1900
1901 if (list == NULL)
1902 return;
1903 cur = list;
1904 while (cur != NULL) {
1905 if (cur->doc != doc)
1906 xmlSetTreeDoc(cur, doc);
1907 cur = cur->next;
1908 }
1909}
1910
1911
1912/**
1913 * xmlNewChild:
1914 * @parent: the parent node
1915 * @ns: a namespace if any
1916 * @name: the name of the child
1917 * @content: the XML content of the child if any.
1918 *
1919 * Creation of a new child element, added at the end of @parent children list.
Daniel Veillardd1640922001-12-17 15:30:10 +00001920 * @ns and @content parameters are optional (NULL). If content is non NULL,
Owen Taylor3473f882001-02-23 17:55:21 +00001921 * a child list containing the TEXTs and ENTITY_REFs node will be created.
1922 * NOTE: @content is supposed to be a piece of XML CDATA, so it allow entities
1923 * references, but XML special chars need to be escaped first by using
1924 * xmlEncodeEntitiesReentrant(). Use xmlNewTextChild() if entities
1925 * support is not needed.
1926 *
1927 * Returns a pointer to the new node object.
1928 */
1929xmlNodePtr
1930xmlNewChild(xmlNodePtr parent, xmlNsPtr ns,
1931 const xmlChar *name, const xmlChar *content) {
1932 xmlNodePtr cur, prev;
1933
1934 if (parent == NULL) {
1935#ifdef DEBUG_TREE
1936 xmlGenericError(xmlGenericErrorContext,
1937 "xmlNewChild : parent == NULL\n");
1938#endif
1939 return(NULL);
1940 }
1941
1942 if (name == NULL) {
1943#ifdef DEBUG_TREE
1944 xmlGenericError(xmlGenericErrorContext,
1945 "xmlNewChild : name == NULL\n");
1946#endif
1947 return(NULL);
1948 }
1949
1950 /*
1951 * Allocate a new node
1952 */
Daniel Veillard36eea2d2002-02-04 00:17:01 +00001953 if (parent->type == XML_ELEMENT_NODE) {
1954 if (ns == NULL)
1955 cur = xmlNewDocNode(parent->doc, parent->ns, name, content);
1956 else
1957 cur = xmlNewDocNode(parent->doc, ns, name, content);
1958 } else if ((parent->type == XML_DOCUMENT_NODE) ||
1959 (parent->type == XML_HTML_DOCUMENT_NODE)) {
1960 if (ns == NULL)
1961 cur = xmlNewDocNode((xmlDocPtr) parent, NULL, name, content);
1962 else
1963 cur = xmlNewDocNode((xmlDocPtr) parent, ns, name, content);
1964 } else {
1965 return(NULL);
1966 }
Owen Taylor3473f882001-02-23 17:55:21 +00001967 if (cur == NULL) return(NULL);
1968
1969 /*
1970 * add the new element at the end of the children list.
1971 */
1972 cur->type = XML_ELEMENT_NODE;
1973 cur->parent = parent;
1974 cur->doc = parent->doc;
1975 if (parent->children == NULL) {
1976 parent->children = cur;
1977 parent->last = cur;
1978 } else {
1979 prev = parent->last;
1980 prev->next = cur;
1981 cur->prev = prev;
1982 parent->last = cur;
1983 }
1984
1985 return(cur);
1986}
1987
1988/**
1989 * xmlAddNextSibling:
1990 * @cur: the child node
1991 * @elem: the new node
1992 *
Daniel Veillardbd227ae2002-01-24 16:05:41 +00001993 * Add a new node @elem as the next sibling of @cur
1994 * If the new node was already inserted in a document it is
Owen Taylor3473f882001-02-23 17:55:21 +00001995 * first unlinked from its existing context.
1996 * As a result of text merging @elem may be freed.
Daniel Veillardbd227ae2002-01-24 16:05:41 +00001997 * If the new node is ATTRIBUTE, it is added into properties instead of children.
1998 * If there is an attribute with equal name, it is first destroyed.
Owen Taylor3473f882001-02-23 17:55:21 +00001999 *
Daniel Veillardbd227ae2002-01-24 16:05:41 +00002000 * Returns the new node or NULL in case of error.
Owen Taylor3473f882001-02-23 17:55:21 +00002001 */
2002xmlNodePtr
2003xmlAddNextSibling(xmlNodePtr cur, xmlNodePtr elem) {
2004 if (cur == NULL) {
2005#ifdef DEBUG_TREE
2006 xmlGenericError(xmlGenericErrorContext,
2007 "xmlAddNextSibling : cur == NULL\n");
2008#endif
2009 return(NULL);
2010 }
2011 if (elem == NULL) {
2012#ifdef DEBUG_TREE
2013 xmlGenericError(xmlGenericErrorContext,
2014 "xmlAddNextSibling : elem == NULL\n");
2015#endif
2016 return(NULL);
2017 }
2018
2019 xmlUnlinkNode(elem);
2020
2021 if (elem->type == XML_TEXT_NODE) {
2022 if (cur->type == XML_TEXT_NODE) {
2023#ifndef XML_USE_BUFFER_CONTENT
2024 xmlNodeAddContent(cur, elem->content);
2025#else
2026 xmlNodeAddContent(cur, xmlBufferContent(elem->content));
2027#endif
2028 xmlFreeNode(elem);
2029 return(cur);
2030 }
Daniel Veillard9e1c72d2001-08-31 20:03:19 +00002031 if ((cur->next != NULL) && (cur->next->type == XML_TEXT_NODE) &&
2032 (cur->name == cur->next->name)) {
Owen Taylor3473f882001-02-23 17:55:21 +00002033#ifndef XML_USE_BUFFER_CONTENT
2034 xmlChar *tmp;
2035
2036 tmp = xmlStrdup(elem->content);
2037 tmp = xmlStrcat(tmp, cur->next->content);
2038 xmlNodeSetContent(cur->next, tmp);
2039 xmlFree(tmp);
2040#else
2041 xmlBufferAddHead(cur->next->content,
2042 xmlBufferContent(elem->content),
2043 xmlBufferLength(elem->content));
2044#endif
2045 xmlFreeNode(elem);
2046 return(cur->next);
2047 }
Daniel Veillardbd227ae2002-01-24 16:05:41 +00002048 } else if (elem->type == XML_ATTRIBUTE_NODE) {
2049 /* check if an attribute with the same name exists */
2050 xmlAttrPtr attr;
2051
2052 if (elem->ns == NULL)
2053 attr = xmlHasProp(cur->parent, elem->name);
2054 else
2055 attr = xmlHasNsProp(cur->parent, elem->name, elem->ns->href);
2056 if ((attr != NULL) && (attr != (xmlAttrPtr) elem)) {
2057 /* different instance, destroy it (attributes must be unique) */
2058 xmlFreeProp(attr);
2059 }
Owen Taylor3473f882001-02-23 17:55:21 +00002060 }
2061
2062 if (elem->doc != cur->doc) {
2063 xmlSetTreeDoc(elem, cur->doc);
2064 }
2065 elem->parent = cur->parent;
2066 elem->prev = cur;
2067 elem->next = cur->next;
2068 cur->next = elem;
2069 if (elem->next != NULL)
2070 elem->next->prev = elem;
Daniel Veillardbd227ae2002-01-24 16:05:41 +00002071 if ((elem->parent != NULL) && (elem->parent->last == cur) && (elem->type != XML_ATTRIBUTE_NODE))
Owen Taylor3473f882001-02-23 17:55:21 +00002072 elem->parent->last = elem;
2073 return(elem);
2074}
2075
2076/**
2077 * xmlAddPrevSibling:
2078 * @cur: the child node
2079 * @elem: the new node
2080 *
Daniel Veillardbd227ae2002-01-24 16:05:41 +00002081 * Add a new node @elem as the previous sibling of @cur
Owen Taylor3473f882001-02-23 17:55:21 +00002082 * merging adjacent TEXT nodes (@elem may be freed)
Daniel Veillardbd227ae2002-01-24 16:05:41 +00002083 * If the new node was already inserted in a document it is
Owen Taylor3473f882001-02-23 17:55:21 +00002084 * first unlinked from its existing context.
Daniel Veillardbd227ae2002-01-24 16:05:41 +00002085 * If the new node is ATTRIBUTE, it is added into properties instead of children.
2086 * If there is an attribute with equal name, it is first destroyed.
Owen Taylor3473f882001-02-23 17:55:21 +00002087 *
Daniel Veillardbd227ae2002-01-24 16:05:41 +00002088 * Returns the new node or NULL in case of error.
Owen Taylor3473f882001-02-23 17:55:21 +00002089 */
2090xmlNodePtr
2091xmlAddPrevSibling(xmlNodePtr cur, xmlNodePtr elem) {
2092 if (cur == NULL) {
2093#ifdef DEBUG_TREE
2094 xmlGenericError(xmlGenericErrorContext,
2095 "xmlAddPrevSibling : cur == NULL\n");
2096#endif
2097 return(NULL);
2098 }
2099 if (elem == NULL) {
2100#ifdef DEBUG_TREE
2101 xmlGenericError(xmlGenericErrorContext,
2102 "xmlAddPrevSibling : elem == NULL\n");
2103#endif
2104 return(NULL);
2105 }
2106
2107 xmlUnlinkNode(elem);
2108
2109 if (elem->type == XML_TEXT_NODE) {
2110 if (cur->type == XML_TEXT_NODE) {
2111#ifndef XML_USE_BUFFER_CONTENT
2112 xmlChar *tmp;
2113
2114 tmp = xmlStrdup(elem->content);
2115 tmp = xmlStrcat(tmp, cur->content);
2116 xmlNodeSetContent(cur, tmp);
2117 xmlFree(tmp);
2118#else
2119 xmlBufferAddHead(cur->content, xmlBufferContent(elem->content),
2120 xmlBufferLength(elem->content));
2121#endif
2122 xmlFreeNode(elem);
2123 return(cur);
2124 }
Daniel Veillard9e1c72d2001-08-31 20:03:19 +00002125 if ((cur->prev != NULL) && (cur->prev->type == XML_TEXT_NODE) &&
2126 (cur->name == cur->prev->name)) {
Owen Taylor3473f882001-02-23 17:55:21 +00002127#ifndef XML_USE_BUFFER_CONTENT
2128 xmlNodeAddContent(cur->prev, elem->content);
2129#else
2130 xmlNodeAddContent(cur->prev, xmlBufferContent(elem->content));
2131#endif
2132 xmlFreeNode(elem);
2133 return(cur->prev);
2134 }
Daniel Veillardbd227ae2002-01-24 16:05:41 +00002135 } else if (elem->type == XML_ATTRIBUTE_NODE) {
2136 /* check if an attribute with the same name exists */
2137 xmlAttrPtr attr;
2138
2139 if (elem->ns == NULL)
2140 attr = xmlHasProp(cur->parent, elem->name);
2141 else
2142 attr = xmlHasNsProp(cur->parent, elem->name, elem->ns->href);
2143 if ((attr != NULL) && (attr != (xmlAttrPtr) elem)) {
2144 /* different instance, destroy it (attributes must be unique) */
2145 xmlFreeProp(attr);
2146 }
Owen Taylor3473f882001-02-23 17:55:21 +00002147 }
2148
2149 if (elem->doc != cur->doc) {
2150 xmlSetTreeDoc(elem, cur->doc);
2151 }
2152 elem->parent = cur->parent;
2153 elem->next = cur;
2154 elem->prev = cur->prev;
2155 cur->prev = elem;
2156 if (elem->prev != NULL)
2157 elem->prev->next = elem;
Daniel Veillardbd227ae2002-01-24 16:05:41 +00002158 if (elem->parent != NULL) {
2159 if (elem->type == XML_ATTRIBUTE_NODE) {
2160 if (elem->parent->properties == (xmlAttrPtr) cur) {
2161 elem->parent->properties = (xmlAttrPtr) elem;
2162 }
2163 } else {
2164 if (elem->parent->children == cur) {
2165 elem->parent->children = elem;
2166 }
2167 }
2168 }
Owen Taylor3473f882001-02-23 17:55:21 +00002169 return(elem);
2170}
2171
2172/**
2173 * xmlAddSibling:
2174 * @cur: the child node
2175 * @elem: the new node
2176 *
2177 * Add a new element @elem to the list of siblings of @cur
2178 * merging adjacent TEXT nodes (@elem may be freed)
2179 * If the new element was already inserted in a document it is
2180 * first unlinked from its existing context.
2181 *
2182 * Returns the new element or NULL in case of error.
2183 */
2184xmlNodePtr
2185xmlAddSibling(xmlNodePtr cur, xmlNodePtr elem) {
2186 xmlNodePtr parent;
2187
2188 if (cur == NULL) {
2189#ifdef DEBUG_TREE
2190 xmlGenericError(xmlGenericErrorContext,
2191 "xmlAddSibling : cur == NULL\n");
2192#endif
2193 return(NULL);
2194 }
2195
2196 if (elem == NULL) {
2197#ifdef DEBUG_TREE
2198 xmlGenericError(xmlGenericErrorContext,
2199 "xmlAddSibling : elem == NULL\n");
2200#endif
2201 return(NULL);
2202 }
2203
2204 /*
2205 * Constant time is we can rely on the ->parent->last to find
2206 * the last sibling.
2207 */
2208 if ((cur->parent != NULL) &&
2209 (cur->parent->children != NULL) &&
2210 (cur->parent->last != NULL) &&
2211 (cur->parent->last->next == NULL)) {
2212 cur = cur->parent->last;
2213 } else {
2214 while (cur->next != NULL) cur = cur->next;
2215 }
2216
2217 xmlUnlinkNode(elem);
2218
2219 if ((cur->type == XML_TEXT_NODE) && (elem->type == XML_TEXT_NODE)) {
2220#ifndef XML_USE_BUFFER_CONTENT
2221 xmlNodeAddContent(cur, elem->content);
2222#else
2223 xmlNodeAddContent(cur, xmlBufferContent(elem->content));
2224#endif
2225 xmlFreeNode(elem);
2226 return(cur);
2227 }
2228
2229 if (elem->doc != cur->doc) {
2230 xmlSetTreeDoc(elem, cur->doc);
2231 }
2232 parent = cur->parent;
2233 elem->prev = cur;
2234 elem->next = NULL;
2235 elem->parent = parent;
2236 cur->next = elem;
2237 if (parent != NULL)
2238 parent->last = elem;
2239
2240 return(elem);
2241}
2242
2243/**
2244 * xmlAddChildList:
2245 * @parent: the parent node
2246 * @cur: the first node in the list
2247 *
2248 * Add a list of node at the end of the child list of the parent
2249 * merging adjacent TEXT nodes (@cur may be freed)
2250 *
2251 * Returns the last child or NULL in case of error.
2252 */
2253xmlNodePtr
2254xmlAddChildList(xmlNodePtr parent, xmlNodePtr cur) {
2255 xmlNodePtr prev;
2256
2257 if (parent == NULL) {
2258#ifdef DEBUG_TREE
2259 xmlGenericError(xmlGenericErrorContext,
Daniel Veillardd1640922001-12-17 15:30:10 +00002260 "xmlAddChildList : parent == NULL\n");
Owen Taylor3473f882001-02-23 17:55:21 +00002261#endif
2262 return(NULL);
2263 }
2264
2265 if (cur == NULL) {
2266#ifdef DEBUG_TREE
2267 xmlGenericError(xmlGenericErrorContext,
Daniel Veillardd1640922001-12-17 15:30:10 +00002268 "xmlAddChildList : child == NULL\n");
Owen Taylor3473f882001-02-23 17:55:21 +00002269#endif
2270 return(NULL);
2271 }
2272
2273 if ((cur->doc != NULL) && (parent->doc != NULL) &&
2274 (cur->doc != parent->doc)) {
2275#ifdef DEBUG_TREE
2276 xmlGenericError(xmlGenericErrorContext,
2277 "Elements moved to a different document\n");
2278#endif
2279 }
2280
2281 /*
2282 * add the first element at the end of the children list.
2283 */
2284 if (parent->children == NULL) {
2285 parent->children = cur;
2286 } else {
2287 /*
2288 * If cur and parent->last both are TEXT nodes, then merge them.
2289 */
2290 if ((cur->type == XML_TEXT_NODE) &&
2291 (parent->last->type == XML_TEXT_NODE) &&
2292 (cur->name == parent->last->name)) {
2293#ifndef XML_USE_BUFFER_CONTENT
2294 xmlNodeAddContent(parent->last, cur->content);
2295#else
2296 xmlNodeAddContent(parent->last, xmlBufferContent(cur->content));
2297#endif
2298 /*
2299 * if it's the only child, nothing more to be done.
2300 */
2301 if (cur->next == NULL) {
2302 xmlFreeNode(cur);
2303 return(parent->last);
2304 }
2305 prev = cur;
2306 cur = cur->next;
2307 xmlFreeNode(prev);
2308 }
2309 prev = parent->last;
2310 prev->next = cur;
2311 cur->prev = prev;
2312 }
2313 while (cur->next != NULL) {
2314 cur->parent = parent;
2315 if (cur->doc != parent->doc) {
2316 xmlSetTreeDoc(cur, parent->doc);
2317 }
2318 cur = cur->next;
2319 }
2320 cur->parent = parent;
2321 cur->doc = parent->doc; /* the parent may not be linked to a doc ! */
2322 parent->last = cur;
2323
2324 return(cur);
2325}
2326
2327/**
2328 * xmlAddChild:
2329 * @parent: the parent node
2330 * @cur: the child node
2331 *
Daniel Veillardbd227ae2002-01-24 16:05:41 +00002332 * Add a new node to @parent, at the end of the child (or property) list
Owen Taylor3473f882001-02-23 17:55:21 +00002333 * merging adjacent TEXT nodes (in which case @cur is freed)
Daniel Veillardbd227ae2002-01-24 16:05:41 +00002334 * If the new node was already inserted in a document it is
2335 * first unlinked from its existing context.
2336 * If the new node is ATTRIBUTE, it is added into properties instead of children.
2337 * If there is an attribute with equal name, it is first destroyed.
2338 *
Owen Taylor3473f882001-02-23 17:55:21 +00002339 * Returns the child or NULL in case of error.
2340 */
2341xmlNodePtr
2342xmlAddChild(xmlNodePtr parent, xmlNodePtr cur) {
2343 xmlNodePtr prev;
2344
2345 if (parent == NULL) {
2346#ifdef DEBUG_TREE
2347 xmlGenericError(xmlGenericErrorContext,
2348 "xmlAddChild : parent == NULL\n");
2349#endif
2350 return(NULL);
2351 }
2352
2353 if (cur == NULL) {
2354#ifdef DEBUG_TREE
2355 xmlGenericError(xmlGenericErrorContext,
2356 "xmlAddChild : child == NULL\n");
2357#endif
2358 return(NULL);
2359 }
2360
Owen Taylor3473f882001-02-23 17:55:21 +00002361 /*
2362 * If cur is a TEXT node, merge its content with adjacent TEXT nodes
Owen Taylor3473f882001-02-23 17:55:21 +00002363 * cur is then freed.
2364 */
2365 if (cur->type == XML_TEXT_NODE) {
Daniel Veillard7db37732001-07-12 01:20:08 +00002366 if ((parent->type == XML_TEXT_NODE) &&
Owen Taylor3473f882001-02-23 17:55:21 +00002367 (parent->content != NULL)) {
2368#ifndef XML_USE_BUFFER_CONTENT
2369 xmlNodeAddContent(parent, cur->content);
2370#else
2371 xmlNodeAddContent(parent, xmlBufferContent(cur->content));
2372#endif
2373 xmlFreeNode(cur);
2374 return(parent);
2375 }
2376 if ((parent->last != NULL) && (parent->last->type == XML_TEXT_NODE) &&
2377 (parent->last->name == cur->name)) {
2378#ifndef XML_USE_BUFFER_CONTENT
2379 xmlNodeAddContent(parent->last, cur->content);
2380#else
2381 xmlNodeAddContent(parent->last, xmlBufferContent(cur->content));
2382#endif
2383 xmlFreeNode(cur);
2384 return(parent->last);
2385 }
2386 }
2387
2388 /*
2389 * add the new element at the end of the children list.
2390 */
2391 cur->parent = parent;
2392 if (cur->doc != parent->doc) {
2393 xmlSetTreeDoc(cur, parent->doc);
2394 }
2395
2396 /*
Daniel Veillard7db37732001-07-12 01:20:08 +00002397 * Coalescing
Owen Taylor3473f882001-02-23 17:55:21 +00002398 */
Daniel Veillard7db37732001-07-12 01:20:08 +00002399 if ((parent->type == XML_TEXT_NODE) &&
Owen Taylor3473f882001-02-23 17:55:21 +00002400 (parent->content != NULL)) {
Owen Taylor3473f882001-02-23 17:55:21 +00002401#ifndef XML_USE_BUFFER_CONTENT
Daniel Veillard7db37732001-07-12 01:20:08 +00002402 xmlNodeAddContent(parent, cur->content);
Owen Taylor3473f882001-02-23 17:55:21 +00002403#else
Daniel Veillard7db37732001-07-12 01:20:08 +00002404 xmlNodeAddContent(parent, xmlBufferContent(cur->content));
Owen Taylor3473f882001-02-23 17:55:21 +00002405#endif
Daniel Veillard7db37732001-07-12 01:20:08 +00002406 xmlFreeNode(cur);
2407 return(parent);
Owen Taylor3473f882001-02-23 17:55:21 +00002408 }
Daniel Veillardbd227ae2002-01-24 16:05:41 +00002409 if (cur->type == XML_ATTRIBUTE_NODE) {
2410 if (parent->properties == NULL) {
2411 parent->properties = (xmlAttrPtr) cur;
2412 } else {
2413 /* check if an attribute with the same name exists */
2414 xmlAttrPtr lastattr;
Owen Taylor3473f882001-02-23 17:55:21 +00002415
Daniel Veillardbd227ae2002-01-24 16:05:41 +00002416 if (cur->ns == NULL)
2417 lastattr = xmlHasProp(parent, cur->name);
2418 else
2419 lastattr = xmlHasNsProp(parent, cur->name, cur->ns->href);
2420 if ((lastattr != NULL) && (lastattr != (xmlAttrPtr) cur)) {
2421 /* different instance, destroy it (attributes must be unique) */
2422 xmlFreeProp(lastattr);
2423 }
2424 /* find the end */
2425 lastattr = parent->properties;
2426 while (lastattr->next != NULL) {
2427 lastattr = lastattr->next;
2428 }
2429 lastattr->next = (xmlAttrPtr) cur;
2430 ((xmlAttrPtr) cur)->prev = lastattr;
2431 }
2432 } else {
2433 if (parent->children == NULL) {
2434 parent->children = cur;
2435 parent->last = cur;
2436 } else {
2437 prev = parent->last;
2438 prev->next = cur;
2439 cur->prev = prev;
2440 parent->last = cur;
2441 }
2442 }
Owen Taylor3473f882001-02-23 17:55:21 +00002443 return(cur);
2444}
2445
2446/**
2447 * xmlGetLastChild:
2448 * @parent: the parent node
2449 *
2450 * Search the last child of a node.
2451 * Returns the last child or NULL if none.
2452 */
2453xmlNodePtr
2454xmlGetLastChild(xmlNodePtr parent) {
2455 if (parent == NULL) {
2456#ifdef DEBUG_TREE
2457 xmlGenericError(xmlGenericErrorContext,
2458 "xmlGetLastChild : parent == NULL\n");
2459#endif
2460 return(NULL);
2461 }
2462 return(parent->last);
2463}
2464
2465/**
2466 * xmlFreeNodeList:
2467 * @cur: the first node in the list
2468 *
2469 * Free a node and all its siblings, this is a recursive behaviour, all
2470 * the children are freed too.
2471 */
2472void
2473xmlFreeNodeList(xmlNodePtr cur) {
2474 xmlNodePtr next;
2475 if (cur == NULL) {
2476#ifdef DEBUG_TREE
2477 xmlGenericError(xmlGenericErrorContext,
2478 "xmlFreeNodeList : node == NULL\n");
2479#endif
2480 return;
2481 }
Daniel Veillarde6a55192002-01-14 17:11:53 +00002482 if (cur->type == XML_NAMESPACE_DECL) {
2483 xmlFreeNsList((xmlNsPtr) cur);
2484 return;
2485 }
Owen Taylor3473f882001-02-23 17:55:21 +00002486 while (cur != NULL) {
2487 next = cur->next;
Daniel Veillard02141ea2001-04-30 11:46:40 +00002488 /* unroll to speed up freeing the document */
2489 if (cur->type != XML_DTD_NODE) {
2490 if ((cur->children != NULL) &&
2491 (cur->type != XML_ENTITY_REF_NODE))
2492 xmlFreeNodeList(cur->children);
2493 if (cur->properties != NULL)
2494 xmlFreePropList(cur->properties);
Daniel Veillard7db37732001-07-12 01:20:08 +00002495 if ((cur->type != XML_ELEMENT_NODE) &&
2496 (cur->type != XML_XINCLUDE_START) &&
2497 (cur->type != XML_XINCLUDE_END) &&
2498 (cur->type != XML_ENTITY_REF_NODE)) {
Daniel Veillard02141ea2001-04-30 11:46:40 +00002499#ifndef XML_USE_BUFFER_CONTENT
2500 if (cur->content != NULL) xmlFree(cur->content);
2501#else
2502 if (cur->content != NULL) xmlBufferFree(cur->content);
2503#endif
Daniel Veillard7db37732001-07-12 01:20:08 +00002504 }
2505 if (((cur->type == XML_ELEMENT_NODE) ||
2506 (cur->type == XML_XINCLUDE_START) ||
2507 (cur->type == XML_XINCLUDE_END)) &&
2508 (cur->nsDef != NULL))
2509 xmlFreeNsList(cur->nsDef);
2510
Daniel Veillard9cc6dc62001-06-11 08:09:20 +00002511 /*
2512 * When a node is a text node or a comment, it uses a global static
2513 * variable for the name of the node.
2514 *
2515 * The xmlStrEqual comparisons need to be done when (happened with
2516 * XML::libXML and XML::libXSLT) the library is included twice
Daniel Veillardcbaf3992001-12-31 16:16:02 +00002517 * statically in the binary and a tree allocated by one occurrence
Daniel Veillardd1640922001-12-17 15:30:10 +00002518 * of the lib gets freed by the other occurrence, in this case
Daniel Veillard9cc6dc62001-06-11 08:09:20 +00002519 * the string addresses compare are not sufficient.
2520 */
Daniel Veillard02141ea2001-04-30 11:46:40 +00002521 if ((cur->name != NULL) &&
2522 (cur->name != xmlStringText) &&
2523 (cur->name != xmlStringTextNoenc) &&
Daniel Veillard9cc6dc62001-06-11 08:09:20 +00002524 (cur->name != xmlStringComment)) {
2525 if (cur->type == XML_TEXT_NODE) {
2526 if ((!xmlStrEqual(cur->name, xmlStringText)) &&
2527 (!xmlStrEqual(cur->name, xmlStringTextNoenc)))
2528 xmlFree((char *) cur->name);
2529 } else if (cur->type == XML_COMMENT_NODE) {
2530 if (!xmlStrEqual(cur->name, xmlStringComment))
2531 xmlFree((char *) cur->name);
2532 } else
2533 xmlFree((char *) cur->name);
2534 }
Daniel Veillard02141ea2001-04-30 11:46:40 +00002535 /* TODO : derecursivate this function */
Daniel Veillard02141ea2001-04-30 11:46:40 +00002536 xmlFree(cur);
2537 }
Owen Taylor3473f882001-02-23 17:55:21 +00002538 cur = next;
2539 }
2540}
2541
2542/**
2543 * xmlFreeNode:
2544 * @cur: the node
2545 *
2546 * Free a node, this is a recursive behaviour, all the children are freed too.
2547 * This doesn't unlink the child from the list, use xmlUnlinkNode() first.
2548 */
2549void
2550xmlFreeNode(xmlNodePtr cur) {
2551 if (cur == NULL) {
2552#ifdef DEBUG_TREE
2553 xmlGenericError(xmlGenericErrorContext,
2554 "xmlFreeNode : node == NULL\n");
2555#endif
2556 return;
2557 }
Daniel Veillard02141ea2001-04-30 11:46:40 +00002558 /* use xmlFreeDtd for DTD nodes */
Daniel Veillarde6a55192002-01-14 17:11:53 +00002559 if (cur->type == XML_DTD_NODE) {
2560 xmlFreeDtd((xmlDtdPtr) cur);
Owen Taylor3473f882001-02-23 17:55:21 +00002561 return;
Daniel Veillarde6a55192002-01-14 17:11:53 +00002562 }
2563 if (cur->type == XML_NAMESPACE_DECL) {
2564 xmlFreeNs((xmlNsPtr) cur);
2565 return;
2566 }
Owen Taylor3473f882001-02-23 17:55:21 +00002567 if ((cur->children != NULL) &&
2568 (cur->type != XML_ENTITY_REF_NODE))
2569 xmlFreeNodeList(cur->children);
Daniel Veillard02141ea2001-04-30 11:46:40 +00002570 if (cur->properties != NULL)
2571 xmlFreePropList(cur->properties);
Daniel Veillard7db37732001-07-12 01:20:08 +00002572 if ((cur->type != XML_ELEMENT_NODE) &&
2573 (cur->content != NULL) &&
2574 (cur->type != XML_ENTITY_REF_NODE) &&
2575 (cur->type != XML_XINCLUDE_END) &&
2576 (cur->type != XML_XINCLUDE_START)) {
Owen Taylor3473f882001-02-23 17:55:21 +00002577#ifndef XML_USE_BUFFER_CONTENT
Daniel Veillard7db37732001-07-12 01:20:08 +00002578 xmlFree(cur->content);
Owen Taylor3473f882001-02-23 17:55:21 +00002579#else
Daniel Veillard7db37732001-07-12 01:20:08 +00002580 xmlBufferFree(cur->content);
Owen Taylor3473f882001-02-23 17:55:21 +00002581#endif
Daniel Veillard7db37732001-07-12 01:20:08 +00002582 }
2583
Daniel Veillardacd370f2001-06-09 17:17:51 +00002584 /*
2585 * When a node is a text node or a comment, it uses a global static
2586 * variable for the name of the node.
2587 *
2588 * The xmlStrEqual comparisons need to be done when (happened with
2589 * XML::libXML and XML::libXSLT) the library is included twice statically
Daniel Veillardcbaf3992001-12-31 16:16:02 +00002590 * in the binary and a tree allocated by one occurence of the lib gets
Daniel Veillardd1640922001-12-17 15:30:10 +00002591 * freed by the other occurrence, in this case the string addresses compare
Daniel Veillardacd370f2001-06-09 17:17:51 +00002592 * are not sufficient.
2593 */
Owen Taylor3473f882001-02-23 17:55:21 +00002594 if ((cur->name != NULL) &&
2595 (cur->name != xmlStringText) &&
2596 (cur->name != xmlStringTextNoenc) &&
Daniel Veillardacd370f2001-06-09 17:17:51 +00002597 (cur->name != xmlStringComment)) {
2598 if (cur->type == XML_TEXT_NODE) {
2599 if ((!xmlStrEqual(cur->name, xmlStringText)) &&
2600 (!xmlStrEqual(cur->name, xmlStringTextNoenc)))
2601 xmlFree((char *) cur->name);
2602 } else if (cur->type == XML_COMMENT_NODE) {
2603 if (!xmlStrEqual(cur->name, xmlStringComment))
2604 xmlFree((char *) cur->name);
2605 } else
2606 xmlFree((char *) cur->name);
2607 }
2608
Owen Taylor3473f882001-02-23 17:55:21 +00002609 if (cur->nsDef != NULL) xmlFreeNsList(cur->nsDef);
Owen Taylor3473f882001-02-23 17:55:21 +00002610 xmlFree(cur);
2611}
2612
2613/**
2614 * xmlUnlinkNode:
2615 * @cur: the node
2616 *
2617 * Unlink a node from it's current context, the node is not freed
2618 */
2619void
2620xmlUnlinkNode(xmlNodePtr cur) {
2621 if (cur == NULL) {
2622#ifdef DEBUG_TREE
2623 xmlGenericError(xmlGenericErrorContext,
2624 "xmlUnlinkNode : node == NULL\n");
2625#endif
2626 return;
2627 }
Daniel Veillard29e43992001-12-13 22:21:58 +00002628 if (cur->type == XML_DTD_NODE) {
2629 xmlDocPtr doc;
2630 doc = cur->doc;
2631 if (doc->intSubset == (xmlDtdPtr) cur)
2632 doc->intSubset = NULL;
2633 if (doc->extSubset == (xmlDtdPtr) cur)
2634 doc->extSubset = NULL;
2635 }
Daniel Veillardc169f8b2002-01-22 21:40:13 +00002636 if (cur->parent != NULL) {
2637 xmlNodePtr parent;
2638 parent = cur->parent;
2639 if (cur->type == XML_ATTRIBUTE_NODE) {
2640 if (parent->properties == (xmlAttrPtr) cur)
2641 parent->properties = ((xmlAttrPtr) cur)->next;
2642 } else {
2643 if (parent->children == cur)
2644 parent->children = cur->next;
2645 if (parent->last == cur)
2646 parent->last = cur->prev;
2647 }
2648 cur->parent = NULL;
2649 }
Owen Taylor3473f882001-02-23 17:55:21 +00002650 if (cur->next != NULL)
2651 cur->next->prev = cur->prev;
2652 if (cur->prev != NULL)
2653 cur->prev->next = cur->next;
2654 cur->next = cur->prev = NULL;
Owen Taylor3473f882001-02-23 17:55:21 +00002655}
2656
2657/**
2658 * xmlReplaceNode:
2659 * @old: the old node
2660 * @cur: the node
2661 *
2662 * Unlink the old node from it's current context, prune the new one
Daniel Veillardd1640922001-12-17 15:30:10 +00002663 * at the same place. If @cur was already inserted in a document it is
Owen Taylor3473f882001-02-23 17:55:21 +00002664 * first unlinked from its existing context.
2665 *
Daniel Veillardd1640922001-12-17 15:30:10 +00002666 * Returns the @old node
Owen Taylor3473f882001-02-23 17:55:21 +00002667 */
2668xmlNodePtr
2669xmlReplaceNode(xmlNodePtr old, xmlNodePtr cur) {
2670 if (old == NULL) {
2671#ifdef DEBUG_TREE
2672 xmlGenericError(xmlGenericErrorContext,
2673 "xmlReplaceNode : old == NULL\n");
2674#endif
2675 return(NULL);
2676 }
2677 if (cur == NULL) {
2678 xmlUnlinkNode(old);
2679 return(old);
2680 }
2681 if (cur == old) {
2682 return(old);
2683 }
Daniel Veillardc169f8b2002-01-22 21:40:13 +00002684 if ((old->type==XML_ATTRIBUTE_NODE) && (cur->type!=XML_ATTRIBUTE_NODE)) {
2685#ifdef DEBUG_TREE
2686 xmlGenericError(xmlGenericErrorContext,
2687 "xmlReplaceNode : Trying to replace attribute node with other node type\n");
2688#endif
2689 return(old);
2690 }
2691 if ((cur->type==XML_ATTRIBUTE_NODE) && (old->type!=XML_ATTRIBUTE_NODE)) {
2692#ifdef DEBUG_TREE
2693 xmlGenericError(xmlGenericErrorContext,
2694 "xmlReplaceNode : Trying to replace a non-attribute node with attribute node\n");
2695#endif
2696 return(old);
2697 }
Daniel Veillardbd227ae2002-01-24 16:05:41 +00002698 if ((old->type==XML_ATTRIBUTE_NODE) && (cur->type!=XML_ATTRIBUTE_NODE)) {
2699#ifdef DEBUG_TREE
2700 xmlGenericError(xmlGenericErrorContext,
2701 "xmlReplaceNode : Trying to replace attribute node with other node type\n");
2702#endif
2703 return(old);
2704 }
2705 if ((cur->type==XML_ATTRIBUTE_NODE) && (old->type!=XML_ATTRIBUTE_NODE)) {
2706#ifdef DEBUG_TREE
2707 xmlGenericError(xmlGenericErrorContext,
2708 "xmlReplaceNode : Trying to replace a non-attribute node with attribute node\n");
2709#endif
2710 return(old);
2711 }
Owen Taylor3473f882001-02-23 17:55:21 +00002712 xmlUnlinkNode(cur);
2713 cur->doc = old->doc;
2714 cur->parent = old->parent;
2715 cur->next = old->next;
2716 if (cur->next != NULL)
2717 cur->next->prev = cur;
2718 cur->prev = old->prev;
2719 if (cur->prev != NULL)
2720 cur->prev->next = cur;
2721 if (cur->parent != NULL) {
Daniel Veillardc169f8b2002-01-22 21:40:13 +00002722 if (cur->type == XML_ATTRIBUTE_NODE) {
2723 if (cur->parent->properties == (xmlAttrPtr)old)
2724 cur->parent->properties = ((xmlAttrPtr) cur);
2725 } else {
2726 if (cur->parent->children == old)
2727 cur->parent->children = cur;
2728 if (cur->parent->last == old)
2729 cur->parent->last = cur;
2730 }
Owen Taylor3473f882001-02-23 17:55:21 +00002731 }
2732 old->next = old->prev = NULL;
2733 old->parent = NULL;
2734 return(old);
2735}
2736
2737/************************************************************************
2738 * *
2739 * Copy operations *
2740 * *
2741 ************************************************************************/
2742
2743/**
2744 * xmlCopyNamespace:
2745 * @cur: the namespace
2746 *
2747 * Do a copy of the namespace.
2748 *
Daniel Veillardd1640922001-12-17 15:30:10 +00002749 * Returns: a new #xmlNsPtr, or NULL in case of error.
Owen Taylor3473f882001-02-23 17:55:21 +00002750 */
2751xmlNsPtr
2752xmlCopyNamespace(xmlNsPtr cur) {
2753 xmlNsPtr ret;
2754
2755 if (cur == NULL) return(NULL);
2756 switch (cur->type) {
2757 case XML_LOCAL_NAMESPACE:
2758 ret = xmlNewNs(NULL, cur->href, cur->prefix);
2759 break;
2760 default:
2761#ifdef DEBUG_TREE
2762 xmlGenericError(xmlGenericErrorContext,
2763 "xmlCopyNamespace: invalid type %d\n", cur->type);
2764#endif
2765 return(NULL);
2766 }
2767 return(ret);
2768}
2769
2770/**
2771 * xmlCopyNamespaceList:
2772 * @cur: the first namespace
2773 *
2774 * Do a copy of an namespace list.
2775 *
Daniel Veillardd1640922001-12-17 15:30:10 +00002776 * Returns: a new #xmlNsPtr, or NULL in case of error.
Owen Taylor3473f882001-02-23 17:55:21 +00002777 */
2778xmlNsPtr
2779xmlCopyNamespaceList(xmlNsPtr cur) {
2780 xmlNsPtr ret = NULL;
2781 xmlNsPtr p = NULL,q;
2782
2783 while (cur != NULL) {
2784 q = xmlCopyNamespace(cur);
2785 if (p == NULL) {
2786 ret = p = q;
2787 } else {
2788 p->next = q;
2789 p = q;
2790 }
2791 cur = cur->next;
2792 }
2793 return(ret);
2794}
2795
2796static xmlNodePtr
2797xmlStaticCopyNodeList(xmlNodePtr node, xmlDocPtr doc, xmlNodePtr parent);
2798/**
2799 * xmlCopyProp:
2800 * @target: the element where the attribute will be grafted
2801 * @cur: the attribute
2802 *
2803 * Do a copy of the attribute.
2804 *
Daniel Veillardd1640922001-12-17 15:30:10 +00002805 * Returns: a new #xmlAttrPtr, or NULL in case of error.
Owen Taylor3473f882001-02-23 17:55:21 +00002806 */
2807xmlAttrPtr
2808xmlCopyProp(xmlNodePtr target, xmlAttrPtr cur) {
2809 xmlAttrPtr ret;
2810
2811 if (cur == NULL) return(NULL);
2812 if (target != NULL)
2813 ret = xmlNewDocProp(target->doc, cur->name, NULL);
2814 else if (cur->parent != NULL)
2815 ret = xmlNewDocProp(cur->parent->doc, cur->name, NULL);
2816 else if (cur->children != NULL)
2817 ret = xmlNewDocProp(cur->children->doc, cur->name, NULL);
2818 else
2819 ret = xmlNewDocProp(NULL, cur->name, NULL);
2820 if (ret == NULL) return(NULL);
2821 ret->parent = target;
Daniel Veillardd4f41aa2002-03-03 14:13:46 +00002822
Owen Taylor3473f882001-02-23 17:55:21 +00002823 if ((cur->ns != NULL) && (target != NULL)) {
Daniel Veillard8107a222002-01-13 14:10:10 +00002824 xmlNsPtr ns;
Daniel Veillardd4f41aa2002-03-03 14:13:46 +00002825/*
2826 * if (target->doc)
2827 * ns = xmlSearchNs(target->doc, target, cur->ns->prefix);
2828 * else if (cur->doc) / * target may not yet have a doc : KPI * /
2829 * ns = xmlSearchNs(cur->doc, target, cur->ns->prefix);
2830 * else
2831 * ns = NULL;
2832 * ret->ns = ns;
2833 */
2834 ns = xmlSearchNs(target->doc, target, cur->ns->prefix);
2835 if (ns == NULL) {
2836 /*
2837 * Humm, we are copying an element whose namespace is defined
2838 * out of the new tree scope. Search it in the original tree
2839 * and add it at the top of the new tree
2840 */
2841 ns = xmlSearchNs(cur->doc, cur->parent, cur->ns->prefix);
2842 if (ns != NULL) {
2843 xmlNodePtr root = target;
2844 xmlNodePtr pred = NULL;
2845
2846 while (root->parent != NULL) {
2847 pred = root;
2848 root = root->parent;
2849 }
2850 if (root == (xmlNodePtr) target->doc) {
2851 /* correct possibly cycling above the document elt */
2852 root = pred;
2853 }
2854 ret->ns = xmlNewNs(root, ns->href, ns->prefix);
2855 }
2856 } else {
2857 /*
2858 * we have to find something appropriate here since
2859 * we cant be sure, that the namespce we found is identified
2860 * by the prefix
2861 */
Daniel Veillard044fc6b2002-03-04 17:09:44 +00002862 if (xmlStrEqual(ns->href, cur->ns->href)) {
Daniel Veillardd4f41aa2002-03-03 14:13:46 +00002863 /* this is the nice case */
2864 ret->ns = ns;
2865 } else {
2866 /*
2867 * we are in trouble: we need a new reconcilied namespace.
2868 * This is expensive
2869 */
2870 ret->ns = xmlNewReconciliedNs(target->doc, target, cur->ns);
2871 }
2872 }
2873
Owen Taylor3473f882001-02-23 17:55:21 +00002874 } else
2875 ret->ns = NULL;
2876
2877 if (cur->children != NULL) {
2878 xmlNodePtr tmp;
2879
2880 ret->children = xmlStaticCopyNodeList(cur->children, ret->doc, (xmlNodePtr) ret);
2881 ret->last = NULL;
2882 tmp = ret->children;
2883 while (tmp != NULL) {
2884 /* tmp->parent = (xmlNodePtr)ret; */
2885 if (tmp->next == NULL)
2886 ret->last = tmp;
2887 tmp = tmp->next;
2888 }
2889 }
Daniel Veillardc5f05ad2002-02-10 11:57:22 +00002890 /*
2891 * Try to handle IDs
2892 */
2893 if ((target->doc != NULL) && (cur->doc != NULL) &&
2894 (cur->doc->ids != NULL) && (cur->parent != NULL)) {
2895 if (xmlIsID(cur->doc, cur->parent, cur)) {
2896 xmlChar *id;
2897
2898 id = xmlNodeListGetString(cur->doc, cur->children, 1);
2899 if (id != NULL) {
2900 xmlAddID(NULL, target->doc, id, ret);
2901 xmlFree(id);
2902 }
2903 }
2904 }
Owen Taylor3473f882001-02-23 17:55:21 +00002905 return(ret);
2906}
2907
2908/**
2909 * xmlCopyPropList:
2910 * @target: the element where the attributes will be grafted
2911 * @cur: the first attribute
2912 *
2913 * Do a copy of an attribute list.
2914 *
Daniel Veillardd1640922001-12-17 15:30:10 +00002915 * Returns: a new #xmlAttrPtr, or NULL in case of error.
Owen Taylor3473f882001-02-23 17:55:21 +00002916 */
2917xmlAttrPtr
2918xmlCopyPropList(xmlNodePtr target, xmlAttrPtr cur) {
2919 xmlAttrPtr ret = NULL;
2920 xmlAttrPtr p = NULL,q;
2921
2922 while (cur != NULL) {
2923 q = xmlCopyProp(target, cur);
2924 if (p == NULL) {
2925 ret = p = q;
2926 } else {
2927 p->next = q;
2928 q->prev = p;
2929 p = q;
2930 }
2931 cur = cur->next;
2932 }
2933 return(ret);
2934}
2935
2936/*
Daniel Veillardd1640922001-12-17 15:30:10 +00002937 * NOTE about the CopyNode operations !
Owen Taylor3473f882001-02-23 17:55:21 +00002938 *
Daniel Veillardd1640922001-12-17 15:30:10 +00002939 * They are split into external and internal parts for one
Owen Taylor3473f882001-02-23 17:55:21 +00002940 * tricky reason: namespaces. Doing a direct copy of a node
2941 * say RPM:Copyright without changing the namespace pointer to
2942 * something else can produce stale links. One way to do it is
2943 * to keep a reference counter but this doesn't work as soon
2944 * as one move the element or the subtree out of the scope of
2945 * the existing namespace. The actual solution seems to add
2946 * a copy of the namespace at the top of the copied tree if
2947 * not available in the subtree.
2948 * Hence two functions, the public front-end call the inner ones
2949 */
2950
2951static xmlNodePtr
Daniel Veillard3ec4c612001-08-28 20:39:49 +00002952xmlStaticCopyNode(const xmlNodePtr node, xmlDocPtr doc, xmlNodePtr parent,
Owen Taylor3473f882001-02-23 17:55:21 +00002953 int recursive) {
2954 xmlNodePtr ret;
2955
2956 if (node == NULL) return(NULL);
Daniel Veillard39196eb2001-06-19 18:09:42 +00002957 switch (node->type) {
2958 case XML_TEXT_NODE:
2959 case XML_CDATA_SECTION_NODE:
2960 case XML_ELEMENT_NODE:
2961 case XML_ENTITY_REF_NODE:
2962 case XML_ENTITY_NODE:
2963 case XML_PI_NODE:
2964 case XML_COMMENT_NODE:
Daniel Veillard1d0bfab2001-07-26 11:49:41 +00002965 case XML_XINCLUDE_START:
2966 case XML_XINCLUDE_END:
2967 break;
2968 case XML_ATTRIBUTE_NODE:
2969 return((xmlNodePtr) xmlCopyProp(parent, (xmlAttrPtr) node));
2970 case XML_NAMESPACE_DECL:
2971 return((xmlNodePtr) xmlCopyNamespaceList((xmlNsPtr) node));
2972
Daniel Veillard39196eb2001-06-19 18:09:42 +00002973 case XML_DOCUMENT_NODE:
2974 case XML_HTML_DOCUMENT_NODE:
2975#ifdef LIBXML_DOCB_ENABLED
2976 case XML_DOCB_DOCUMENT_NODE:
2977#endif
Daniel Veillard1d0bfab2001-07-26 11:49:41 +00002978 return((xmlNodePtr) xmlCopyDoc((xmlDocPtr) node, recursive));
Daniel Veillard39196eb2001-06-19 18:09:42 +00002979 case XML_DOCUMENT_TYPE_NODE:
2980 case XML_DOCUMENT_FRAG_NODE:
2981 case XML_NOTATION_NODE:
2982 case XML_DTD_NODE:
2983 case XML_ELEMENT_DECL:
2984 case XML_ATTRIBUTE_DECL:
2985 case XML_ENTITY_DECL:
2986 return(NULL);
2987 }
Daniel Veillardb33c2012001-04-25 12:59:04 +00002988
Owen Taylor3473f882001-02-23 17:55:21 +00002989 /*
2990 * Allocate a new node and fill the fields.
2991 */
2992 ret = (xmlNodePtr) xmlMalloc(sizeof(xmlNode));
2993 if (ret == NULL) {
2994 xmlGenericError(xmlGenericErrorContext,
2995 "xmlStaticCopyNode : malloc failed\n");
2996 return(NULL);
2997 }
2998 memset(ret, 0, sizeof(xmlNode));
2999 ret->type = node->type;
3000
3001 ret->doc = doc;
3002 ret->parent = parent;
3003 if (node->name == xmlStringText)
3004 ret->name = xmlStringText;
3005 else if (node->name == xmlStringTextNoenc)
3006 ret->name = xmlStringTextNoenc;
3007 else if (node->name == xmlStringComment)
3008 ret->name = xmlStringComment;
3009 else if (node->name != NULL)
3010 ret->name = xmlStrdup(node->name);
Daniel Veillard7db37732001-07-12 01:20:08 +00003011 if ((node->type != XML_ELEMENT_NODE) &&
3012 (node->content != NULL) &&
3013 (node->type != XML_ENTITY_REF_NODE) &&
3014 (node->type != XML_XINCLUDE_END) &&
3015 (node->type != XML_XINCLUDE_START)) {
Owen Taylor3473f882001-02-23 17:55:21 +00003016#ifndef XML_USE_BUFFER_CONTENT
3017 ret->content = xmlStrdup(node->content);
3018#else
3019 ret->content = xmlBufferCreateSize(xmlBufferLength(node->content));
3020 xmlBufferSetAllocationScheme(ret->content,
3021 xmlGetBufferAllocationScheme());
3022 xmlBufferAdd(ret->content,
3023 xmlBufferContent(node->content),
3024 xmlBufferLength(node->content));
3025#endif
Daniel Veillard8107a222002-01-13 14:10:10 +00003026 }else{
3027 if (node->type == XML_ELEMENT_NODE)
3028 ret->content = (void*)(long) node->content;
Owen Taylor3473f882001-02-23 17:55:21 +00003029 }
Daniel Veillardacb2bda2002-01-13 16:15:43 +00003030 if (parent != NULL) {
3031 xmlNodePtr tmp;
3032
3033 tmp = xmlAddChild(parent, ret);
3034 /* node could have coalesced */
3035 if (tmp != ret)
3036 return(tmp);
3037 }
Owen Taylor3473f882001-02-23 17:55:21 +00003038
3039 if (!recursive) return(ret);
3040 if (node->nsDef != NULL)
3041 ret->nsDef = xmlCopyNamespaceList(node->nsDef);
3042
3043 if (node->ns != NULL) {
3044 xmlNsPtr ns;
3045
3046 ns = xmlSearchNs(doc, ret, node->ns->prefix);
3047 if (ns == NULL) {
3048 /*
3049 * Humm, we are copying an element whose namespace is defined
3050 * out of the new tree scope. Search it in the original tree
3051 * and add it at the top of the new tree
3052 */
3053 ns = xmlSearchNs(node->doc, node, node->ns->prefix);
3054 if (ns != NULL) {
3055 xmlNodePtr root = ret;
3056
3057 while (root->parent != NULL) root = root->parent;
Daniel Veillarde82a9922001-04-22 12:12:58 +00003058 ret->ns = xmlNewNs(root, ns->href, ns->prefix);
Owen Taylor3473f882001-02-23 17:55:21 +00003059 }
3060 } else {
3061 /*
3062 * reference the existing namespace definition in our own tree.
3063 */
3064 ret->ns = ns;
3065 }
3066 }
3067 if (node->properties != NULL)
3068 ret->properties = xmlCopyPropList(ret, node->properties);
Daniel Veillardb33c2012001-04-25 12:59:04 +00003069 if (node->type == XML_ENTITY_REF_NODE) {
3070 if ((doc == NULL) || (node->doc != doc)) {
3071 /*
3072 * The copied node will go into a separate document, so
Daniel Veillardd1640922001-12-17 15:30:10 +00003073 * to avoid dangling references to the ENTITY_DECL node
Daniel Veillardb33c2012001-04-25 12:59:04 +00003074 * we cannot keep the reference. Try to find it in the
3075 * target document.
3076 */
3077 ret->children = (xmlNodePtr) xmlGetDocEntity(doc, ret->name);
3078 } else {
3079 ret->children = node->children;
3080 }
Daniel Veillard0ec98632001-11-14 15:04:32 +00003081 ret->last = ret->children;
3082 } else if (node->children != NULL) {
Owen Taylor3473f882001-02-23 17:55:21 +00003083 ret->children = xmlStaticCopyNodeList(node->children, doc, ret);
Daniel Veillard0ec98632001-11-14 15:04:32 +00003084 UPDATE_LAST_CHILD_AND_PARENT(ret)
3085 }
Owen Taylor3473f882001-02-23 17:55:21 +00003086 return(ret);
3087}
3088
3089static xmlNodePtr
3090xmlStaticCopyNodeList(xmlNodePtr node, xmlDocPtr doc, xmlNodePtr parent) {
3091 xmlNodePtr ret = NULL;
3092 xmlNodePtr p = NULL,q;
3093
3094 while (node != NULL) {
Daniel Veillard1d0bfab2001-07-26 11:49:41 +00003095 if (node->type == XML_DTD_NODE ) {
Daniel Veillard4497e692001-06-09 14:19:02 +00003096 if (doc == NULL) {
3097 node = node->next;
3098 continue;
3099 }
Daniel Veillardb33c2012001-04-25 12:59:04 +00003100 if (doc->intSubset == NULL) {
3101 q = (xmlNodePtr) xmlCopyDtd( (xmlDtdPtr) node );
3102 q->doc = doc;
3103 q->parent = parent;
3104 doc->intSubset = (xmlDtdPtr) q;
Daniel Veillard8ee9c8f2002-01-26 21:42:58 +00003105 xmlAddChild(parent, q);
Daniel Veillardb33c2012001-04-25 12:59:04 +00003106 } else {
3107 q = (xmlNodePtr) doc->intSubset;
Daniel Veillard8ee9c8f2002-01-26 21:42:58 +00003108 xmlAddChild(parent, q);
Daniel Veillardb33c2012001-04-25 12:59:04 +00003109 }
3110 } else
3111 q = xmlStaticCopyNode(node, doc, parent, 1);
Owen Taylor3473f882001-02-23 17:55:21 +00003112 if (ret == NULL) {
3113 q->prev = NULL;
3114 ret = p = q;
Daniel Veillardacb2bda2002-01-13 16:15:43 +00003115 } else if (p != q) {
3116 /* the test is required if xmlStaticCopyNode coalesced 2 text nodes */
Owen Taylor3473f882001-02-23 17:55:21 +00003117 p->next = q;
3118 q->prev = p;
3119 p = q;
3120 }
3121 node = node->next;
3122 }
3123 return(ret);
3124}
3125
3126/**
3127 * xmlCopyNode:
3128 * @node: the node
3129 * @recursive: if 1 do a recursive copy.
3130 *
3131 * Do a copy of the node.
3132 *
Daniel Veillardd1640922001-12-17 15:30:10 +00003133 * Returns: a new #xmlNodePtr, or NULL in case of error.
Owen Taylor3473f882001-02-23 17:55:21 +00003134 */
3135xmlNodePtr
Daniel Veillard3ec4c612001-08-28 20:39:49 +00003136xmlCopyNode(const xmlNodePtr node, int recursive) {
Owen Taylor3473f882001-02-23 17:55:21 +00003137 xmlNodePtr ret;
3138
3139 ret = xmlStaticCopyNode(node, NULL, NULL, recursive);
3140 return(ret);
3141}
3142
3143/**
Daniel Veillard82daa812001-04-12 08:55:36 +00003144 * xmlDocCopyNode:
3145 * @node: the node
Daniel Veillardd1640922001-12-17 15:30:10 +00003146 * @doc: the document
Daniel Veillard82daa812001-04-12 08:55:36 +00003147 * @recursive: if 1 do a recursive copy.
3148 *
3149 * Do a copy of the node to a given document.
3150 *
Daniel Veillardd1640922001-12-17 15:30:10 +00003151 * Returns: a new #xmlNodePtr, or NULL in case of error.
Daniel Veillard82daa812001-04-12 08:55:36 +00003152 */
3153xmlNodePtr
Daniel Veillard3ec4c612001-08-28 20:39:49 +00003154xmlDocCopyNode(const xmlNodePtr node, xmlDocPtr doc, int recursive) {
Daniel Veillard82daa812001-04-12 08:55:36 +00003155 xmlNodePtr ret;
3156
3157 ret = xmlStaticCopyNode(node, doc, NULL, recursive);
3158 return(ret);
3159}
3160
3161/**
Owen Taylor3473f882001-02-23 17:55:21 +00003162 * xmlCopyNodeList:
3163 * @node: the first node in the list.
3164 *
3165 * Do a recursive copy of the node list.
3166 *
Daniel Veillardd1640922001-12-17 15:30:10 +00003167 * Returns: a new #xmlNodePtr, or NULL in case of error.
Owen Taylor3473f882001-02-23 17:55:21 +00003168 */
Daniel Veillard3ec4c612001-08-28 20:39:49 +00003169xmlNodePtr xmlCopyNodeList(const xmlNodePtr node) {
Owen Taylor3473f882001-02-23 17:55:21 +00003170 xmlNodePtr ret = xmlStaticCopyNodeList(node, NULL, NULL);
3171 return(ret);
3172}
3173
3174/**
Owen Taylor3473f882001-02-23 17:55:21 +00003175 * xmlCopyDtd:
3176 * @dtd: the dtd
3177 *
3178 * Do a copy of the dtd.
3179 *
Daniel Veillardd1640922001-12-17 15:30:10 +00003180 * Returns: a new #xmlDtdPtr, or NULL in case of error.
Owen Taylor3473f882001-02-23 17:55:21 +00003181 */
3182xmlDtdPtr
3183xmlCopyDtd(xmlDtdPtr dtd) {
3184 xmlDtdPtr ret;
Daniel Veillard8ee9c8f2002-01-26 21:42:58 +00003185 xmlNodePtr cur, p = NULL, q;
Owen Taylor3473f882001-02-23 17:55:21 +00003186
3187 if (dtd == NULL) return(NULL);
3188 ret = xmlNewDtd(NULL, dtd->name, dtd->ExternalID, dtd->SystemID);
3189 if (ret == NULL) return(NULL);
3190 if (dtd->entities != NULL)
3191 ret->entities = (void *) xmlCopyEntitiesTable(
3192 (xmlEntitiesTablePtr) dtd->entities);
3193 if (dtd->notations != NULL)
3194 ret->notations = (void *) xmlCopyNotationTable(
3195 (xmlNotationTablePtr) dtd->notations);
3196 if (dtd->elements != NULL)
3197 ret->elements = (void *) xmlCopyElementTable(
3198 (xmlElementTablePtr) dtd->elements);
3199 if (dtd->attributes != NULL)
3200 ret->attributes = (void *) xmlCopyAttributeTable(
3201 (xmlAttributeTablePtr) dtd->attributes);
Daniel Veillard8ee9c8f2002-01-26 21:42:58 +00003202 if (dtd->pentities != NULL)
3203 ret->pentities = (void *) xmlCopyEntitiesTable(
3204 (xmlEntitiesTablePtr) dtd->pentities);
3205
3206 cur = dtd->children;
3207 while (cur != NULL) {
3208 q = NULL;
3209
3210 if (cur->type == XML_ENTITY_DECL) {
3211 xmlEntityPtr tmp = (xmlEntityPtr) cur;
3212 switch (tmp->etype) {
3213 case XML_INTERNAL_GENERAL_ENTITY:
3214 case XML_EXTERNAL_GENERAL_PARSED_ENTITY:
3215 case XML_EXTERNAL_GENERAL_UNPARSED_ENTITY:
3216 q = (xmlNodePtr) xmlGetEntityFromDtd(ret, tmp->name);
3217 break;
3218 case XML_INTERNAL_PARAMETER_ENTITY:
3219 case XML_EXTERNAL_PARAMETER_ENTITY:
3220 q = (xmlNodePtr)
3221 xmlGetParameterEntityFromDtd(ret, tmp->name);
3222 break;
3223 case XML_INTERNAL_PREDEFINED_ENTITY:
3224 break;
3225 }
3226 } else if (cur->type == XML_ELEMENT_DECL) {
3227 xmlElementPtr tmp = (xmlElementPtr) cur;
3228 q = (xmlNodePtr)
3229 xmlGetDtdQElementDesc(ret, tmp->name, tmp->prefix);
3230 } else if (cur->type == XML_ATTRIBUTE_DECL) {
3231 xmlAttributePtr tmp = (xmlAttributePtr) cur;
3232 q = (xmlNodePtr)
3233 xmlGetDtdQAttrDesc(ret, tmp->elem, tmp->name, tmp->prefix);
3234 } else if (cur->type == XML_COMMENT_NODE) {
3235 q = xmlCopyNode(cur, 0);
3236 }
3237
3238 if (q == NULL) {
3239 cur = cur->next;
3240 continue;
3241 }
3242
3243 if (p == NULL)
3244 ret->children = q;
3245 else
3246 p->next = q;
3247
3248 q->prev = p;
3249 q->parent = (xmlNodePtr) ret;
3250 q->next = NULL;
3251 ret->last = q;
3252 p = q;
3253 cur = cur->next;
3254 }
3255
Owen Taylor3473f882001-02-23 17:55:21 +00003256 return(ret);
3257}
3258
3259/**
3260 * xmlCopyDoc:
3261 * @doc: the document
3262 * @recursive: if 1 do a recursive copy.
3263 *
3264 * Do a copy of the document info. If recursive, the content tree will
Daniel Veillardcbaf3992001-12-31 16:16:02 +00003265 * be copied too as well as DTD, namespaces and entities.
Owen Taylor3473f882001-02-23 17:55:21 +00003266 *
Daniel Veillardd1640922001-12-17 15:30:10 +00003267 * Returns: a new #xmlDocPtr, or NULL in case of error.
Owen Taylor3473f882001-02-23 17:55:21 +00003268 */
3269xmlDocPtr
3270xmlCopyDoc(xmlDocPtr doc, int recursive) {
3271 xmlDocPtr ret;
3272
3273 if (doc == NULL) return(NULL);
3274 ret = xmlNewDoc(doc->version);
3275 if (ret == NULL) return(NULL);
3276 if (doc->name != NULL)
3277 ret->name = xmlMemStrdup(doc->name);
3278 if (doc->encoding != NULL)
3279 ret->encoding = xmlStrdup(doc->encoding);
3280 ret->charset = doc->charset;
3281 ret->compression = doc->compression;
3282 ret->standalone = doc->standalone;
3283 if (!recursive) return(ret);
3284
Daniel Veillardb33c2012001-04-25 12:59:04 +00003285 ret->last = NULL;
3286 ret->children = NULL;
3287 if (doc->intSubset != NULL) {
Owen Taylor3473f882001-02-23 17:55:21 +00003288 ret->intSubset = xmlCopyDtd(doc->intSubset);
Daniel Veillard8ee9c8f2002-01-26 21:42:58 +00003289 xmlSetTreeDoc((xmlNodePtr)ret->intSubset, ret);
Daniel Veillardb33c2012001-04-25 12:59:04 +00003290 ret->intSubset->parent = ret;
3291 }
Owen Taylor3473f882001-02-23 17:55:21 +00003292 if (doc->oldNs != NULL)
3293 ret->oldNs = xmlCopyNamespaceList(doc->oldNs);
3294 if (doc->children != NULL) {
3295 xmlNodePtr tmp;
Daniel Veillardb33c2012001-04-25 12:59:04 +00003296
3297 ret->children = xmlStaticCopyNodeList(doc->children, ret,
3298 (xmlNodePtr)ret);
Owen Taylor3473f882001-02-23 17:55:21 +00003299 ret->last = NULL;
3300 tmp = ret->children;
3301 while (tmp != NULL) {
3302 if (tmp->next == NULL)
3303 ret->last = tmp;
3304 tmp = tmp->next;
3305 }
3306 }
3307 return(ret);
3308}
3309
3310/************************************************************************
3311 * *
3312 * Content access functions *
3313 * *
3314 ************************************************************************/
3315
3316/**
Daniel Veillard8faa7832001-11-26 15:58:08 +00003317 * xmlGetLineNo:
3318 * @node : valid node
3319 *
3320 * Get line number of node. this requires activation of this option
Daniel Veillardd1640922001-12-17 15:30:10 +00003321 * before invoking the parser by calling xmlLineNumbersDefault(1)
Daniel Veillard8faa7832001-11-26 15:58:08 +00003322 *
Daniel Veillardd1640922001-12-17 15:30:10 +00003323 * Returns the line number if successful, -1 otherwise
Daniel Veillard8faa7832001-11-26 15:58:08 +00003324 */
3325long
3326xmlGetLineNo(xmlNodePtr node)
3327{
3328 long result = -1;
3329
3330 if (!node)
3331 return result;
3332 if (node->type == XML_ELEMENT_NODE)
3333 result = (long) node->content;
3334 else if ((node->prev != NULL) &&
3335 ((node->prev->type == XML_ELEMENT_NODE) ||
3336 (node->prev->type == XML_TEXT_NODE)))
3337 result = xmlGetLineNo(node->prev);
3338 else if ((node->parent != NULL) &&
3339 ((node->parent->type == XML_ELEMENT_NODE) ||
3340 (node->parent->type == XML_TEXT_NODE)))
3341 result = xmlGetLineNo(node->parent);
3342
3343 return result;
3344}
3345
3346/**
3347 * xmlGetNodePath:
3348 * @node: a node
3349 *
3350 * Build a structure based Path for the given node
3351 *
3352 * Returns the new path or NULL in case of error. The caller must free
3353 * the returned string
3354 */
3355xmlChar *
3356xmlGetNodePath(xmlNodePtr node)
3357{
3358 xmlNodePtr cur, tmp, next;
3359 xmlChar *buffer = NULL, *temp;
3360 size_t buf_len;
3361 xmlChar *buf;
3362 char sep;
3363 const char *name;
3364 char nametemp[100];
3365 int occur = 0;
3366
3367 if (node == NULL)
3368 return (NULL);
3369
3370 buf_len = 500;
3371 buffer = (xmlChar *) xmlMalloc(buf_len * sizeof(xmlChar));
3372 if (buffer == NULL)
3373 return (NULL);
3374 buf = (xmlChar *) xmlMalloc(buf_len * sizeof(xmlChar));
3375 if (buf == NULL) {
3376 xmlFree(buffer);
3377 return (NULL);
3378 }
3379
3380 buffer[0] = 0;
3381 cur = node;
3382 do {
3383 name = "";
3384 sep = '?';
3385 occur = 0;
3386 if ((cur->type == XML_DOCUMENT_NODE) ||
3387 (cur->type == XML_HTML_DOCUMENT_NODE)) {
3388 if (buffer[0] == '/')
3389 break;
3390 sep = '/';
3391 next = NULL;
3392 } else if (cur->type == XML_ELEMENT_NODE) {
3393 sep = '/';
3394 name = (const char *) cur->name;
3395 if (cur->ns) {
3396 snprintf(nametemp, sizeof(nametemp) - 1,
3397 "%s:%s", cur->ns->prefix, cur->name);
3398 nametemp[sizeof(nametemp) - 1] = 0;
3399 name = nametemp;
3400 }
3401 next = cur->parent;
3402
3403 /*
3404 * Thumbler index computation
3405 */
3406 tmp = cur->prev;
3407 while (tmp != NULL) {
3408 if (xmlStrEqual(cur->name, tmp->name))
3409 occur++;
3410 tmp = tmp->prev;
3411 }
3412 if (occur == 0) {
3413 tmp = cur->next;
3414 while (tmp != NULL) {
3415 if (xmlStrEqual(cur->name, tmp->name))
3416 occur++;
3417 tmp = tmp->next;
3418 }
3419 if (occur != 0)
3420 occur = 1;
3421 } else
3422 occur++;
3423 } else if (cur->type == XML_ATTRIBUTE_NODE) {
3424 sep = '@';
3425 name = (const char *) (((xmlAttrPtr) cur)->name);
3426 next = ((xmlAttrPtr) cur)->parent;
3427 } else {
3428 next = cur->parent;
3429 }
3430
3431 /*
3432 * Make sure there is enough room
3433 */
3434 if (xmlStrlen(buffer) + sizeof(nametemp) + 20 > buf_len) {
3435 buf_len =
3436 2 * buf_len + xmlStrlen(buffer) + sizeof(nametemp) + 20;
3437 temp = (xmlChar *) xmlRealloc(buffer, buf_len);
3438 if (temp == NULL) {
3439 xmlFree(buf);
3440 xmlFree(buffer);
3441 return (NULL);
3442 }
3443 buffer = temp;
3444 temp = (xmlChar *) xmlRealloc(buf, buf_len);
3445 if (temp == NULL) {
3446 xmlFree(buf);
3447 xmlFree(buffer);
3448 return (NULL);
3449 }
3450 buf = temp;
3451 }
3452 if (occur == 0)
3453 snprintf((char *) buf, buf_len, "%c%s%s",
3454 sep, name, (char *) buffer);
3455 else
3456 snprintf((char *) buf, buf_len, "%c%s[%d]%s",
3457 sep, name, occur, (char *) buffer);
3458 snprintf((char *) buffer, buf_len, "%s", buf);
3459 cur = next;
3460 } while (cur != NULL);
3461 xmlFree(buf);
3462 return (buffer);
3463}
3464
3465/**
Owen Taylor3473f882001-02-23 17:55:21 +00003466 * xmlDocGetRootElement:
3467 * @doc: the document
3468 *
3469 * Get the root element of the document (doc->children is a list
3470 * containing possibly comments, PIs, etc ...).
3471 *
Daniel Veillardd1640922001-12-17 15:30:10 +00003472 * Returns the #xmlNodePtr for the root or NULL
Owen Taylor3473f882001-02-23 17:55:21 +00003473 */
3474xmlNodePtr
3475xmlDocGetRootElement(xmlDocPtr doc) {
3476 xmlNodePtr ret;
3477
3478 if (doc == NULL) return(NULL);
3479 ret = doc->children;
3480 while (ret != NULL) {
3481 if (ret->type == XML_ELEMENT_NODE)
3482 return(ret);
3483 ret = ret->next;
3484 }
3485 return(ret);
3486}
3487
3488/**
3489 * xmlDocSetRootElement:
3490 * @doc: the document
3491 * @root: the new document root element
3492 *
3493 * Set the root element of the document (doc->children is a list
3494 * containing possibly comments, PIs, etc ...).
3495 *
3496 * Returns the old root element if any was found
3497 */
3498xmlNodePtr
3499xmlDocSetRootElement(xmlDocPtr doc, xmlNodePtr root) {
3500 xmlNodePtr old = NULL;
3501
3502 if (doc == NULL) return(NULL);
Daniel Veillardc575b992002-02-08 13:28:40 +00003503 if (root == NULL)
3504 return(NULL);
3505 xmlUnlinkNode(root);
3506 root->doc = doc;
3507 root->parent = (xmlNodePtr) doc;
Owen Taylor3473f882001-02-23 17:55:21 +00003508 old = doc->children;
3509 while (old != NULL) {
3510 if (old->type == XML_ELEMENT_NODE)
3511 break;
3512 old = old->next;
3513 }
3514 if (old == NULL) {
3515 if (doc->children == NULL) {
3516 doc->children = root;
3517 doc->last = root;
3518 } else {
3519 xmlAddSibling(doc->children, root);
3520 }
3521 } else {
3522 xmlReplaceNode(old, root);
3523 }
3524 return(old);
3525}
3526
3527/**
3528 * xmlNodeSetLang:
3529 * @cur: the node being changed
Daniel Veillardd1640922001-12-17 15:30:10 +00003530 * @lang: the language description
Owen Taylor3473f882001-02-23 17:55:21 +00003531 *
3532 * Set the language of a node, i.e. the values of the xml:lang
3533 * attribute.
3534 */
3535void
3536xmlNodeSetLang(xmlNodePtr cur, const xmlChar *lang) {
Daniel Veillardcfa0d812002-01-17 08:46:58 +00003537 xmlNsPtr ns;
3538
Owen Taylor3473f882001-02-23 17:55:21 +00003539 if (cur == NULL) return;
3540 switch(cur->type) {
3541 case XML_TEXT_NODE:
3542 case XML_CDATA_SECTION_NODE:
3543 case XML_COMMENT_NODE:
3544 case XML_DOCUMENT_NODE:
3545 case XML_DOCUMENT_TYPE_NODE:
3546 case XML_DOCUMENT_FRAG_NODE:
3547 case XML_NOTATION_NODE:
3548 case XML_HTML_DOCUMENT_NODE:
3549 case XML_DTD_NODE:
3550 case XML_ELEMENT_DECL:
3551 case XML_ATTRIBUTE_DECL:
3552 case XML_ENTITY_DECL:
3553 case XML_PI_NODE:
3554 case XML_ENTITY_REF_NODE:
3555 case XML_ENTITY_NODE:
3556 case XML_NAMESPACE_DECL:
Daniel Veillardeae522a2001-04-23 13:41:34 +00003557#ifdef LIBXML_DOCB_ENABLED
3558 case XML_DOCB_DOCUMENT_NODE:
Owen Taylor3473f882001-02-23 17:55:21 +00003559#endif
3560 case XML_XINCLUDE_START:
3561 case XML_XINCLUDE_END:
3562 return;
3563 case XML_ELEMENT_NODE:
3564 case XML_ATTRIBUTE_NODE:
3565 break;
3566 }
Daniel Veillardcfa0d812002-01-17 08:46:58 +00003567 ns = xmlSearchNsByHref(cur->doc, cur, XML_XML_NAMESPACE);
3568 if (ns == NULL)
3569 return;
3570 xmlSetNsProp(cur, ns, BAD_CAST "lang", lang);
Owen Taylor3473f882001-02-23 17:55:21 +00003571}
3572
3573/**
3574 * xmlNodeGetLang:
3575 * @cur: the node being checked
3576 *
3577 * Searches the language of a node, i.e. the values of the xml:lang
3578 * attribute or the one carried by the nearest ancestor.
3579 *
3580 * Returns a pointer to the lang value, or NULL if not found
3581 * It's up to the caller to free the memory.
3582 */
3583xmlChar *
3584xmlNodeGetLang(xmlNodePtr cur) {
3585 xmlChar *lang;
3586
3587 while (cur != NULL) {
Daniel Veillardc17337c2001-05-09 10:51:31 +00003588 lang = xmlGetNsProp(cur, BAD_CAST "lang", XML_XML_NAMESPACE);
Owen Taylor3473f882001-02-23 17:55:21 +00003589 if (lang != NULL)
3590 return(lang);
3591 cur = cur->parent;
3592 }
3593 return(NULL);
3594}
3595
3596
3597/**
3598 * xmlNodeSetSpacePreserve:
3599 * @cur: the node being changed
3600 * @val: the xml:space value ("0": default, 1: "preserve")
3601 *
3602 * Set (or reset) the space preserving behaviour of a node, i.e. the
3603 * value of the xml:space attribute.
3604 */
3605void
3606xmlNodeSetSpacePreserve(xmlNodePtr cur, int val) {
Daniel Veillardcfa0d812002-01-17 08:46:58 +00003607 xmlNsPtr ns;
3608
Owen Taylor3473f882001-02-23 17:55:21 +00003609 if (cur == NULL) return;
3610 switch(cur->type) {
3611 case XML_TEXT_NODE:
3612 case XML_CDATA_SECTION_NODE:
3613 case XML_COMMENT_NODE:
3614 case XML_DOCUMENT_NODE:
3615 case XML_DOCUMENT_TYPE_NODE:
3616 case XML_DOCUMENT_FRAG_NODE:
3617 case XML_NOTATION_NODE:
3618 case XML_HTML_DOCUMENT_NODE:
3619 case XML_DTD_NODE:
3620 case XML_ELEMENT_DECL:
3621 case XML_ATTRIBUTE_DECL:
3622 case XML_ENTITY_DECL:
3623 case XML_PI_NODE:
3624 case XML_ENTITY_REF_NODE:
3625 case XML_ENTITY_NODE:
3626 case XML_NAMESPACE_DECL:
3627 case XML_XINCLUDE_START:
3628 case XML_XINCLUDE_END:
Daniel Veillardeae522a2001-04-23 13:41:34 +00003629#ifdef LIBXML_DOCB_ENABLED
3630 case XML_DOCB_DOCUMENT_NODE:
Owen Taylor3473f882001-02-23 17:55:21 +00003631#endif
3632 return;
3633 case XML_ELEMENT_NODE:
3634 case XML_ATTRIBUTE_NODE:
3635 break;
3636 }
Daniel Veillardcfa0d812002-01-17 08:46:58 +00003637 ns = xmlSearchNsByHref(cur->doc, cur, XML_XML_NAMESPACE);
3638 if (ns == NULL)
3639 return;
Owen Taylor3473f882001-02-23 17:55:21 +00003640 switch (val) {
3641 case 0:
Daniel Veillardcfa0d812002-01-17 08:46:58 +00003642 xmlSetNsProp(cur, ns, BAD_CAST "space", BAD_CAST "default");
Owen Taylor3473f882001-02-23 17:55:21 +00003643 break;
3644 case 1:
Daniel Veillardcfa0d812002-01-17 08:46:58 +00003645 xmlSetNsProp(cur, ns, BAD_CAST "space", BAD_CAST "preserve");
Owen Taylor3473f882001-02-23 17:55:21 +00003646 break;
3647 }
3648}
3649
3650/**
3651 * xmlNodeGetSpacePreserve:
3652 * @cur: the node being checked
3653 *
3654 * Searches the space preserving behaviour of a node, i.e. the values
3655 * of the xml:space attribute or the one carried by the nearest
3656 * ancestor.
3657 *
Daniel Veillardd1640922001-12-17 15:30:10 +00003658 * Returns -1 if xml:space is not inherited, 0 if "default", 1 if "preserve"
Owen Taylor3473f882001-02-23 17:55:21 +00003659 */
3660int
3661xmlNodeGetSpacePreserve(xmlNodePtr cur) {
3662 xmlChar *space;
3663
3664 while (cur != NULL) {
Daniel Veillardcfa0d812002-01-17 08:46:58 +00003665 space = xmlGetNsProp(cur, BAD_CAST "space", XML_XML_NAMESPACE);
Owen Taylor3473f882001-02-23 17:55:21 +00003666 if (space != NULL) {
3667 if (xmlStrEqual(space, BAD_CAST "preserve")) {
3668 xmlFree(space);
3669 return(1);
3670 }
3671 if (xmlStrEqual(space, BAD_CAST "default")) {
3672 xmlFree(space);
3673 return(0);
3674 }
3675 xmlFree(space);
3676 }
3677 cur = cur->parent;
3678 }
3679 return(-1);
3680}
3681
3682/**
3683 * xmlNodeSetName:
3684 * @cur: the node being changed
3685 * @name: the new tag name
3686 *
3687 * Set (or reset) the name of a node.
3688 */
3689void
3690xmlNodeSetName(xmlNodePtr cur, const xmlChar *name) {
3691 if (cur == NULL) return;
3692 if (name == NULL) return;
3693 switch(cur->type) {
3694 case XML_TEXT_NODE:
3695 case XML_CDATA_SECTION_NODE:
3696 case XML_COMMENT_NODE:
3697 case XML_DOCUMENT_TYPE_NODE:
3698 case XML_DOCUMENT_FRAG_NODE:
3699 case XML_NOTATION_NODE:
3700 case XML_HTML_DOCUMENT_NODE:
3701 case XML_NAMESPACE_DECL:
3702 case XML_XINCLUDE_START:
3703 case XML_XINCLUDE_END:
Daniel Veillardeae522a2001-04-23 13:41:34 +00003704#ifdef LIBXML_DOCB_ENABLED
3705 case XML_DOCB_DOCUMENT_NODE:
Owen Taylor3473f882001-02-23 17:55:21 +00003706#endif
3707 return;
3708 case XML_ELEMENT_NODE:
3709 case XML_ATTRIBUTE_NODE:
3710 case XML_PI_NODE:
3711 case XML_ENTITY_REF_NODE:
3712 case XML_ENTITY_NODE:
3713 case XML_DTD_NODE:
3714 case XML_DOCUMENT_NODE:
3715 case XML_ELEMENT_DECL:
3716 case XML_ATTRIBUTE_DECL:
3717 case XML_ENTITY_DECL:
3718 break;
3719 }
3720 if (cur->name != NULL) xmlFree((xmlChar *) cur->name);
3721 cur->name = xmlStrdup(name);
3722}
3723
3724/**
3725 * xmlNodeSetBase:
3726 * @cur: the node being changed
3727 * @uri: the new base URI
3728 *
3729 * Set (or reset) the base URI of a node, i.e. the value of the
3730 * xml:base attribute.
3731 */
3732void
3733xmlNodeSetBase(xmlNodePtr cur, xmlChar* uri) {
Daniel Veillardcfa0d812002-01-17 08:46:58 +00003734 xmlNsPtr ns;
3735
Owen Taylor3473f882001-02-23 17:55:21 +00003736 if (cur == NULL) return;
3737 switch(cur->type) {
3738 case XML_TEXT_NODE:
3739 case XML_CDATA_SECTION_NODE:
3740 case XML_COMMENT_NODE:
3741 case XML_DOCUMENT_NODE:
3742 case XML_DOCUMENT_TYPE_NODE:
3743 case XML_DOCUMENT_FRAG_NODE:
3744 case XML_NOTATION_NODE:
3745 case XML_HTML_DOCUMENT_NODE:
3746 case XML_DTD_NODE:
3747 case XML_ELEMENT_DECL:
3748 case XML_ATTRIBUTE_DECL:
3749 case XML_ENTITY_DECL:
3750 case XML_PI_NODE:
3751 case XML_ENTITY_REF_NODE:
3752 case XML_ENTITY_NODE:
3753 case XML_NAMESPACE_DECL:
3754 case XML_XINCLUDE_START:
3755 case XML_XINCLUDE_END:
Daniel Veillardeae522a2001-04-23 13:41:34 +00003756#ifdef LIBXML_DOCB_ENABLED
3757 case XML_DOCB_DOCUMENT_NODE:
Owen Taylor3473f882001-02-23 17:55:21 +00003758#endif
3759 return;
3760 case XML_ELEMENT_NODE:
3761 case XML_ATTRIBUTE_NODE:
3762 break;
3763 }
Daniel Veillardcfa0d812002-01-17 08:46:58 +00003764
3765 ns = xmlSearchNsByHref(cur->doc, cur, XML_XML_NAMESPACE);
3766 if (ns == NULL)
3767 return;
3768 xmlSetNsProp(cur, ns, BAD_CAST "base", uri);
Owen Taylor3473f882001-02-23 17:55:21 +00003769}
3770
3771/**
Owen Taylor3473f882001-02-23 17:55:21 +00003772 * xmlNodeGetBase:
3773 * @doc: the document the node pertains to
3774 * @cur: the node being checked
3775 *
3776 * Searches for the BASE URL. The code should work on both XML
3777 * and HTML document even if base mechanisms are completely different.
3778 * It returns the base as defined in RFC 2396 sections
3779 * 5.1.1. Base URI within Document Content
3780 * and
3781 * 5.1.2. Base URI from the Encapsulating Entity
3782 * However it does not return the document base (5.1.3), use
3783 * xmlDocumentGetBase() for this
3784 *
3785 * Returns a pointer to the base URL, or NULL if not found
3786 * It's up to the caller to free the memory.
3787 */
3788xmlChar *
3789xmlNodeGetBase(xmlDocPtr doc, xmlNodePtr cur) {
Daniel Veillardb8c9be92001-07-09 16:01:19 +00003790 xmlChar *oldbase = NULL;
3791 xmlChar *base, *newbase;
Owen Taylor3473f882001-02-23 17:55:21 +00003792
3793 if ((cur == NULL) && (doc == NULL))
3794 return(NULL);
3795 if (doc == NULL) doc = cur->doc;
3796 if ((doc != NULL) && (doc->type == XML_HTML_DOCUMENT_NODE)) {
3797 cur = doc->children;
3798 while ((cur != NULL) && (cur->name != NULL)) {
3799 if (cur->type != XML_ELEMENT_NODE) {
3800 cur = cur->next;
3801 continue;
3802 }
3803 if (!xmlStrcasecmp(cur->name, BAD_CAST "html")) {
3804 cur = cur->children;
3805 continue;
3806 }
3807 if (!xmlStrcasecmp(cur->name, BAD_CAST "head")) {
3808 cur = cur->children;
3809 continue;
3810 }
3811 if (!xmlStrcasecmp(cur->name, BAD_CAST "base")) {
3812 return(xmlGetProp(cur, BAD_CAST "href"));
3813 }
3814 cur = cur->next;
3815 }
3816 return(NULL);
3817 }
3818 while (cur != NULL) {
3819 if (cur->type == XML_ENTITY_DECL) {
3820 xmlEntityPtr ent = (xmlEntityPtr) cur;
3821 return(xmlStrdup(ent->URI));
3822 }
Daniel Veillard42596ad2001-05-22 16:57:14 +00003823 if (cur->type == XML_ELEMENT_NODE) {
Daniel Veillardb8c9be92001-07-09 16:01:19 +00003824 base = xmlGetNsProp(cur, BAD_CAST "base", XML_XML_NAMESPACE);
Daniel Veillard42596ad2001-05-22 16:57:14 +00003825 if (base != NULL) {
Daniel Veillardb8c9be92001-07-09 16:01:19 +00003826 if (oldbase != NULL) {
3827 newbase = xmlBuildURI(oldbase, base);
3828 if (newbase != NULL) {
3829 xmlFree(oldbase);
3830 xmlFree(base);
3831 oldbase = newbase;
3832 } else {
3833 xmlFree(oldbase);
3834 xmlFree(base);
3835 return(NULL);
3836 }
3837 } else {
3838 oldbase = base;
3839 }
3840 if ((!xmlStrncmp(oldbase, BAD_CAST "http://", 7)) ||
3841 (!xmlStrncmp(oldbase, BAD_CAST "ftp://", 6)) ||
3842 (!xmlStrncmp(oldbase, BAD_CAST "urn:", 4)))
3843 return(oldbase);
Daniel Veillard42596ad2001-05-22 16:57:14 +00003844 }
3845 }
Owen Taylor3473f882001-02-23 17:55:21 +00003846 cur = cur->parent;
3847 }
Daniel Veillardb8c9be92001-07-09 16:01:19 +00003848 if ((doc != NULL) && (doc->URL != NULL)) {
3849 if (oldbase == NULL)
3850 return(xmlStrdup(doc->URL));
3851 newbase = xmlBuildURI(oldbase, doc->URL);
3852 xmlFree(oldbase);
3853 return(newbase);
3854 }
3855 return(oldbase);
Owen Taylor3473f882001-02-23 17:55:21 +00003856}
3857
3858/**
3859 * xmlNodeGetContent:
3860 * @cur: the node being read
3861 *
3862 * Read the value of a node, this can be either the text carried
3863 * directly by this node if it's a TEXT node or the aggregate string
3864 * of the values carried by this node child's (TEXT and ENTITY_REF).
Daniel Veillardd1640922001-12-17 15:30:10 +00003865 * Entity references are substituted.
3866 * Returns a new #xmlChar * or NULL if no content is available.
Owen Taylor3473f882001-02-23 17:55:21 +00003867 * It's up to the caller to free the memory.
3868 */
3869xmlChar *
3870xmlNodeGetContent(xmlNodePtr cur) {
3871 if (cur == NULL) return(NULL);
3872 switch (cur->type) {
3873 case XML_DOCUMENT_FRAG_NODE:
3874 case XML_ELEMENT_NODE: {
3875 xmlNodePtr tmp = cur;
3876 xmlBufferPtr buffer;
3877 xmlChar *ret;
3878
3879 buffer = xmlBufferCreate();
3880 if (buffer == NULL)
3881 return(NULL);
3882 while (tmp != NULL) {
3883 switch (tmp->type) {
Daniel Veillard2d703722001-05-30 18:32:34 +00003884 case XML_CDATA_SECTION_NODE:
Owen Taylor3473f882001-02-23 17:55:21 +00003885 case XML_TEXT_NODE:
3886 if (tmp->content != NULL)
3887#ifndef XML_USE_BUFFER_CONTENT
3888 xmlBufferCat(buffer, tmp->content);
3889#else
3890 xmlBufferCat(buffer,
3891 xmlBufferContent(tmp->content));
3892#endif
3893 break;
3894 case XML_ENTITY_REF_NODE: {
3895 xmlEntityPtr ent;
3896
3897 ent = xmlGetDocEntity(cur->doc, tmp->name);
3898 if (ent != NULL)
3899 xmlBufferCat(buffer, ent->content);
3900 }
3901 default:
3902 break;
3903 }
3904 /*
3905 * Skip to next node
3906 */
3907 if (tmp->children != NULL) {
3908 if (tmp->children->type != XML_ENTITY_DECL) {
3909 tmp = tmp->children;
3910 continue;
3911 }
3912 }
Daniel Veillard6c831202001-03-07 15:57:53 +00003913 if (tmp == cur)
3914 break;
3915
Owen Taylor3473f882001-02-23 17:55:21 +00003916 if (tmp->next != NULL) {
3917 tmp = tmp->next;
3918 continue;
3919 }
3920
3921 do {
3922 tmp = tmp->parent;
3923 if (tmp == NULL)
3924 break;
Daniel Veillard6c831202001-03-07 15:57:53 +00003925 if (tmp == cur) {
Owen Taylor3473f882001-02-23 17:55:21 +00003926 tmp = NULL;
3927 break;
3928 }
3929 if (tmp->next != NULL) {
3930 tmp = tmp->next;
3931 break;
3932 }
3933 } while (tmp != NULL);
3934 }
3935 ret = buffer->content;
3936 buffer->content = NULL;
3937 xmlBufferFree(buffer);
3938 return(ret);
3939 }
3940 case XML_ATTRIBUTE_NODE: {
3941 xmlAttrPtr attr = (xmlAttrPtr) cur;
3942 if (attr->parent != NULL)
3943 return(xmlNodeListGetString(attr->parent->doc, attr->children, 1));
3944 else
3945 return(xmlNodeListGetString(NULL, attr->children, 1));
3946 break;
3947 }
3948 case XML_COMMENT_NODE:
3949 case XML_PI_NODE:
3950 if (cur->content != NULL)
3951#ifndef XML_USE_BUFFER_CONTENT
3952 return(xmlStrdup(cur->content));
3953#else
3954 return(xmlStrdup(xmlBufferContent(cur->content)));
3955#endif
3956 return(NULL);
3957 case XML_ENTITY_REF_NODE:
3958 /*
3959 * Locate the entity, and get it's content
3960 * @@@
3961 */
3962 return(NULL);
3963 case XML_ENTITY_NODE:
3964 case XML_DOCUMENT_NODE:
3965 case XML_HTML_DOCUMENT_NODE:
3966 case XML_DOCUMENT_TYPE_NODE:
3967 case XML_NOTATION_NODE:
3968 case XML_DTD_NODE:
3969 case XML_XINCLUDE_START:
3970 case XML_XINCLUDE_END:
Daniel Veillardeae522a2001-04-23 13:41:34 +00003971#ifdef LIBXML_DOCB_ENABLED
3972 case XML_DOCB_DOCUMENT_NODE:
Owen Taylor3473f882001-02-23 17:55:21 +00003973#endif
3974 return(NULL);
3975 case XML_NAMESPACE_DECL:
3976 return(xmlStrdup(((xmlNsPtr)cur)->href));
3977 case XML_ELEMENT_DECL:
3978 /* TODO !!! */
3979 return(NULL);
3980 case XML_ATTRIBUTE_DECL:
3981 /* TODO !!! */
3982 return(NULL);
3983 case XML_ENTITY_DECL:
3984 /* TODO !!! */
3985 return(NULL);
3986 case XML_CDATA_SECTION_NODE:
3987 case XML_TEXT_NODE:
3988 if (cur->content != NULL)
3989#ifndef XML_USE_BUFFER_CONTENT
3990 return(xmlStrdup(cur->content));
3991#else
3992 return(xmlStrdup(xmlBufferContent(cur->content)));
3993#endif
3994 return(NULL);
3995 }
3996 return(NULL);
3997}
3998
3999/**
4000 * xmlNodeSetContent:
4001 * @cur: the node being modified
4002 * @content: the new value of the content
4003 *
4004 * Replace the content of a node.
4005 */
4006void
4007xmlNodeSetContent(xmlNodePtr cur, const xmlChar *content) {
4008 if (cur == NULL) {
4009#ifdef DEBUG_TREE
4010 xmlGenericError(xmlGenericErrorContext,
4011 "xmlNodeSetContent : node == NULL\n");
4012#endif
4013 return;
4014 }
4015 switch (cur->type) {
4016 case XML_DOCUMENT_FRAG_NODE:
4017 case XML_ELEMENT_NODE:
Daniel Veillard2c748c62002-01-16 15:37:50 +00004018 case XML_ATTRIBUTE_NODE:
Owen Taylor3473f882001-02-23 17:55:21 +00004019 if (cur->children != NULL) xmlFreeNodeList(cur->children);
4020 cur->children = xmlStringGetNodeList(cur->doc, content);
4021 UPDATE_LAST_CHILD_AND_PARENT(cur)
4022 break;
Owen Taylor3473f882001-02-23 17:55:21 +00004023 case XML_TEXT_NODE:
4024 case XML_CDATA_SECTION_NODE:
4025 case XML_ENTITY_REF_NODE:
4026 case XML_ENTITY_NODE:
4027 case XML_PI_NODE:
4028 case XML_COMMENT_NODE:
4029 if (cur->content != NULL) {
4030#ifndef XML_USE_BUFFER_CONTENT
4031 xmlFree(cur->content);
4032#else
4033 xmlBufferFree(cur->content);
4034#endif
4035 }
4036 if (cur->children != NULL) xmlFreeNodeList(cur->children);
4037 cur->last = cur->children = NULL;
4038 if (content != NULL) {
4039#ifndef XML_USE_BUFFER_CONTENT
4040 cur->content = xmlStrdup(content);
4041#else
4042 cur->content = xmlBufferCreateSize(0);
4043 xmlBufferSetAllocationScheme(cur->content,
4044 xmlGetBufferAllocationScheme());
4045 xmlBufferAdd(cur->content, content, -1);
4046#endif
4047 } else
4048 cur->content = NULL;
4049 break;
4050 case XML_DOCUMENT_NODE:
4051 case XML_HTML_DOCUMENT_NODE:
4052 case XML_DOCUMENT_TYPE_NODE:
4053 case XML_XINCLUDE_START:
4054 case XML_XINCLUDE_END:
Daniel Veillardeae522a2001-04-23 13:41:34 +00004055#ifdef LIBXML_DOCB_ENABLED
4056 case XML_DOCB_DOCUMENT_NODE:
Owen Taylor3473f882001-02-23 17:55:21 +00004057#endif
4058 break;
4059 case XML_NOTATION_NODE:
4060 break;
4061 case XML_DTD_NODE:
4062 break;
4063 case XML_NAMESPACE_DECL:
4064 break;
4065 case XML_ELEMENT_DECL:
4066 /* TODO !!! */
4067 break;
4068 case XML_ATTRIBUTE_DECL:
4069 /* TODO !!! */
4070 break;
4071 case XML_ENTITY_DECL:
4072 /* TODO !!! */
4073 break;
4074 }
4075}
4076
4077/**
4078 * xmlNodeSetContentLen:
4079 * @cur: the node being modified
4080 * @content: the new value of the content
4081 * @len: the size of @content
4082 *
4083 * Replace the content of a node.
4084 */
4085void
4086xmlNodeSetContentLen(xmlNodePtr cur, const xmlChar *content, int len) {
4087 if (cur == NULL) {
4088#ifdef DEBUG_TREE
4089 xmlGenericError(xmlGenericErrorContext,
4090 "xmlNodeSetContentLen : node == NULL\n");
4091#endif
4092 return;
4093 }
4094 switch (cur->type) {
4095 case XML_DOCUMENT_FRAG_NODE:
4096 case XML_ELEMENT_NODE:
Daniel Veillard2c748c62002-01-16 15:37:50 +00004097 case XML_ATTRIBUTE_NODE:
Owen Taylor3473f882001-02-23 17:55:21 +00004098 if (cur->children != NULL) xmlFreeNodeList(cur->children);
4099 cur->children = xmlStringLenGetNodeList(cur->doc, content, len);
4100 UPDATE_LAST_CHILD_AND_PARENT(cur)
4101 break;
Owen Taylor3473f882001-02-23 17:55:21 +00004102 case XML_TEXT_NODE:
4103 case XML_CDATA_SECTION_NODE:
4104 case XML_ENTITY_REF_NODE:
4105 case XML_ENTITY_NODE:
4106 case XML_PI_NODE:
4107 case XML_COMMENT_NODE:
4108 case XML_NOTATION_NODE:
4109 if (cur->content != NULL) {
4110#ifndef XML_USE_BUFFER_CONTENT
4111 xmlFree(cur->content);
4112#else
4113 xmlBufferFree(cur->content);
4114#endif
4115 }
4116 if (cur->children != NULL) xmlFreeNodeList(cur->children);
4117 cur->children = cur->last = NULL;
4118 if (content != NULL) {
4119#ifndef XML_USE_BUFFER_CONTENT
4120 cur->content = xmlStrndup(content, len);
4121#else
4122 cur->content = xmlBufferCreateSize(len);
4123 xmlBufferSetAllocationScheme(cur->content,
4124 xmlGetBufferAllocationScheme());
4125 xmlBufferAdd(cur->content, content, len);
4126#endif
4127 } else
4128 cur->content = NULL;
4129 break;
4130 case XML_DOCUMENT_NODE:
4131 case XML_DTD_NODE:
4132 case XML_HTML_DOCUMENT_NODE:
4133 case XML_DOCUMENT_TYPE_NODE:
4134 case XML_NAMESPACE_DECL:
4135 case XML_XINCLUDE_START:
4136 case XML_XINCLUDE_END:
Daniel Veillardeae522a2001-04-23 13:41:34 +00004137#ifdef LIBXML_DOCB_ENABLED
4138 case XML_DOCB_DOCUMENT_NODE:
Owen Taylor3473f882001-02-23 17:55:21 +00004139#endif
4140 break;
4141 case XML_ELEMENT_DECL:
4142 /* TODO !!! */
4143 break;
4144 case XML_ATTRIBUTE_DECL:
4145 /* TODO !!! */
4146 break;
4147 case XML_ENTITY_DECL:
4148 /* TODO !!! */
4149 break;
4150 }
4151}
4152
4153/**
4154 * xmlNodeAddContentLen:
4155 * @cur: the node being modified
4156 * @content: extra content
4157 * @len: the size of @content
4158 *
4159 * Append the extra substring to the node content.
4160 */
4161void
4162xmlNodeAddContentLen(xmlNodePtr cur, const xmlChar *content, int len) {
4163 if (cur == NULL) {
4164#ifdef DEBUG_TREE
4165 xmlGenericError(xmlGenericErrorContext,
4166 "xmlNodeAddContentLen : node == NULL\n");
4167#endif
4168 return;
4169 }
4170 if (len <= 0) return;
4171 switch (cur->type) {
4172 case XML_DOCUMENT_FRAG_NODE:
4173 case XML_ELEMENT_NODE: {
Daniel Veillardacb2bda2002-01-13 16:15:43 +00004174 xmlNodePtr last, newNode, tmp;
Owen Taylor3473f882001-02-23 17:55:21 +00004175
Daniel Veillard7db37732001-07-12 01:20:08 +00004176 last = cur->last;
Owen Taylor3473f882001-02-23 17:55:21 +00004177 newNode = xmlNewTextLen(content, len);
4178 if (newNode != NULL) {
Daniel Veillardacb2bda2002-01-13 16:15:43 +00004179 tmp = xmlAddChild(cur, newNode);
4180 if (tmp != newNode)
4181 return;
Owen Taylor3473f882001-02-23 17:55:21 +00004182 if ((last != NULL) && (last->next == newNode)) {
4183 xmlTextMerge(last, newNode);
4184 }
4185 }
4186 break;
4187 }
4188 case XML_ATTRIBUTE_NODE:
4189 break;
4190 case XML_TEXT_NODE:
4191 case XML_CDATA_SECTION_NODE:
4192 case XML_ENTITY_REF_NODE:
4193 case XML_ENTITY_NODE:
4194 case XML_PI_NODE:
4195 case XML_COMMENT_NODE:
4196 case XML_NOTATION_NODE:
4197 if (content != NULL) {
4198#ifndef XML_USE_BUFFER_CONTENT
4199 cur->content = xmlStrncat(cur->content, content, len);
4200#else
4201 xmlBufferAdd(cur->content, content, len);
4202#endif
4203 }
4204 case XML_DOCUMENT_NODE:
4205 case XML_DTD_NODE:
4206 case XML_HTML_DOCUMENT_NODE:
4207 case XML_DOCUMENT_TYPE_NODE:
4208 case XML_NAMESPACE_DECL:
4209 case XML_XINCLUDE_START:
4210 case XML_XINCLUDE_END:
Daniel Veillardeae522a2001-04-23 13:41:34 +00004211#ifdef LIBXML_DOCB_ENABLED
4212 case XML_DOCB_DOCUMENT_NODE:
Owen Taylor3473f882001-02-23 17:55:21 +00004213#endif
4214 break;
4215 case XML_ELEMENT_DECL:
4216 case XML_ATTRIBUTE_DECL:
4217 case XML_ENTITY_DECL:
4218 break;
4219 }
4220}
4221
4222/**
4223 * xmlNodeAddContent:
4224 * @cur: the node being modified
4225 * @content: extra content
4226 *
4227 * Append the extra substring to the node content.
4228 */
4229void
4230xmlNodeAddContent(xmlNodePtr cur, const xmlChar *content) {
4231 int len;
4232
4233 if (cur == NULL) {
4234#ifdef DEBUG_TREE
4235 xmlGenericError(xmlGenericErrorContext,
4236 "xmlNodeAddContent : node == NULL\n");
4237#endif
4238 return;
4239 }
4240 if (content == NULL) return;
4241 len = xmlStrlen(content);
4242 xmlNodeAddContentLen(cur, content, len);
4243}
4244
4245/**
4246 * xmlTextMerge:
4247 * @first: the first text node
4248 * @second: the second text node being merged
4249 *
4250 * Merge two text nodes into one
4251 * Returns the first text node augmented
4252 */
4253xmlNodePtr
4254xmlTextMerge(xmlNodePtr first, xmlNodePtr second) {
4255 if (first == NULL) return(second);
4256 if (second == NULL) return(first);
4257 if (first->type != XML_TEXT_NODE) return(first);
4258 if (second->type != XML_TEXT_NODE) return(first);
4259 if (second->name != first->name)
4260 return(first);
4261#ifndef XML_USE_BUFFER_CONTENT
4262 xmlNodeAddContent(first, second->content);
4263#else
4264 xmlNodeAddContent(first, xmlBufferContent(second->content));
4265#endif
4266 xmlUnlinkNode(second);
4267 xmlFreeNode(second);
4268 return(first);
4269}
4270
4271/**
4272 * xmlGetNsList:
4273 * @doc: the document
4274 * @node: the current node
4275 *
4276 * Search all the namespace applying to a given element.
Daniel Veillardd1640922001-12-17 15:30:10 +00004277 * Returns an NULL terminated array of all the #xmlNsPtr found
Owen Taylor3473f882001-02-23 17:55:21 +00004278 * that need to be freed by the caller or NULL if no
4279 * namespace if defined
4280 */
4281xmlNsPtr *
Daniel Veillard77044732001-06-29 21:31:07 +00004282xmlGetNsList(xmlDocPtr doc ATTRIBUTE_UNUSED, xmlNodePtr node)
4283{
Owen Taylor3473f882001-02-23 17:55:21 +00004284 xmlNsPtr cur;
4285 xmlNsPtr *ret = NULL;
4286 int nbns = 0;
4287 int maxns = 10;
4288 int i;
4289
4290 while (node != NULL) {
Daniel Veillard77044732001-06-29 21:31:07 +00004291 if (node->type == XML_ELEMENT_NODE) {
4292 cur = node->nsDef;
4293 while (cur != NULL) {
4294 if (ret == NULL) {
4295 ret =
4296 (xmlNsPtr *) xmlMalloc((maxns + 1) *
4297 sizeof(xmlNsPtr));
4298 if (ret == NULL) {
4299 xmlGenericError(xmlGenericErrorContext,
4300 "xmlGetNsList : out of memory!\n");
4301 return (NULL);
4302 }
4303 ret[nbns] = NULL;
4304 }
4305 for (i = 0; i < nbns; i++) {
4306 if ((cur->prefix == ret[i]->prefix) ||
4307 (xmlStrEqual(cur->prefix, ret[i]->prefix)))
4308 break;
4309 }
4310 if (i >= nbns) {
4311 if (nbns >= maxns) {
4312 maxns *= 2;
4313 ret = (xmlNsPtr *) xmlRealloc(ret,
4314 (maxns +
4315 1) *
4316 sizeof(xmlNsPtr));
4317 if (ret == NULL) {
4318 xmlGenericError(xmlGenericErrorContext,
4319 "xmlGetNsList : realloc failed!\n");
4320 return (NULL);
4321 }
4322 }
4323 ret[nbns++] = cur;
4324 ret[nbns] = NULL;
4325 }
Owen Taylor3473f882001-02-23 17:55:21 +00004326
Daniel Veillard77044732001-06-29 21:31:07 +00004327 cur = cur->next;
4328 }
4329 }
4330 node = node->parent;
Owen Taylor3473f882001-02-23 17:55:21 +00004331 }
Daniel Veillard77044732001-06-29 21:31:07 +00004332 return (ret);
Owen Taylor3473f882001-02-23 17:55:21 +00004333}
4334
4335/**
4336 * xmlSearchNs:
4337 * @doc: the document
4338 * @node: the current node
Daniel Veillard77851712001-02-27 21:54:07 +00004339 * @nameSpace: the namespace prefix
Owen Taylor3473f882001-02-23 17:55:21 +00004340 *
4341 * Search a Ns registered under a given name space for a document.
4342 * recurse on the parents until it finds the defined namespace
4343 * or return NULL otherwise.
4344 * @nameSpace can be NULL, this is a search for the default namespace.
4345 * We don't allow to cross entities boundaries. If you don't declare
4346 * the namespace within those you will be in troubles !!! A warning
4347 * is generated to cover this case.
4348 *
4349 * Returns the namespace pointer or NULL.
4350 */
4351xmlNsPtr
4352xmlSearchNs(xmlDocPtr doc, xmlNodePtr node, const xmlChar *nameSpace) {
4353 xmlNsPtr cur;
4354
4355 if (node == NULL) return(NULL);
4356 if ((nameSpace != NULL) &&
4357 (xmlStrEqual(nameSpace, (const xmlChar *)"xml"))) {
Daniel Veillardd2f23002002-01-21 13:36:00 +00004358 if (doc == NULL)
4359 return(NULL);
Owen Taylor3473f882001-02-23 17:55:21 +00004360 if (doc->oldNs == NULL) {
4361 /*
4362 * Allocate a new Namespace and fill the fields.
4363 */
4364 doc->oldNs = (xmlNsPtr) xmlMalloc(sizeof(xmlNs));
4365 if (doc->oldNs == NULL) {
4366 xmlGenericError(xmlGenericErrorContext,
Daniel Veillardd1640922001-12-17 15:30:10 +00004367 "xmlSearchNs : malloc failed\n");
Owen Taylor3473f882001-02-23 17:55:21 +00004368 return(NULL);
4369 }
4370 memset(doc->oldNs, 0, sizeof(xmlNs));
4371 doc->oldNs->type = XML_LOCAL_NAMESPACE;
4372
4373 doc->oldNs->href = xmlStrdup(XML_XML_NAMESPACE);
4374 doc->oldNs->prefix = xmlStrdup((const xmlChar *)"xml");
4375 }
4376 return(doc->oldNs);
4377 }
4378 while (node != NULL) {
4379 if ((node->type == XML_ENTITY_REF_NODE) ||
4380 (node->type == XML_ENTITY_NODE) ||
4381 (node->type == XML_ENTITY_DECL))
4382 return(NULL);
4383 if (node->type == XML_ELEMENT_NODE) {
4384 cur = node->nsDef;
4385 while (cur != NULL) {
4386 if ((cur->prefix == NULL) && (nameSpace == NULL) &&
4387 (cur->href != NULL))
4388 return(cur);
4389 if ((cur->prefix != NULL) && (nameSpace != NULL) &&
4390 (cur->href != NULL) &&
4391 (xmlStrEqual(cur->prefix, nameSpace)))
4392 return(cur);
4393 cur = cur->next;
4394 }
4395 }
4396 node = node->parent;
4397 }
4398 return(NULL);
4399}
4400
4401/**
4402 * xmlSearchNsByHref:
4403 * @doc: the document
4404 * @node: the current node
4405 * @href: the namespace value
4406 *
4407 * Search a Ns aliasing a given URI. Recurse on the parents until it finds
4408 * the defined namespace or return NULL otherwise.
4409 * Returns the namespace pointer or NULL.
4410 */
4411xmlNsPtr
4412xmlSearchNsByHref(xmlDocPtr doc, xmlNodePtr node, const xmlChar *href) {
4413 xmlNsPtr cur;
4414 xmlNodePtr orig = node;
4415
4416 if ((node == NULL) || (href == NULL)) return(NULL);
4417 if (xmlStrEqual(href, XML_XML_NAMESPACE)) {
Daniel Veillardcfa0d812002-01-17 08:46:58 +00004418 /*
4419 * Only the document can hold the XML spec namespace.
4420 */
4421 if (doc == NULL)
4422 return(NULL);
Owen Taylor3473f882001-02-23 17:55:21 +00004423 if (doc->oldNs == NULL) {
4424 /*
4425 * Allocate a new Namespace and fill the fields.
4426 */
4427 doc->oldNs = (xmlNsPtr) xmlMalloc(sizeof(xmlNs));
4428 if (doc->oldNs == NULL) {
4429 xmlGenericError(xmlGenericErrorContext,
4430 "xmlSearchNsByHref : malloc failed\n");
4431 return(NULL);
4432 }
4433 memset(doc->oldNs, 0, sizeof(xmlNs));
4434 doc->oldNs->type = XML_LOCAL_NAMESPACE;
4435
4436 doc->oldNs->href = xmlStrdup(XML_XML_NAMESPACE);
4437 doc->oldNs->prefix = xmlStrdup((const xmlChar *)"xml");
4438 }
4439 return(doc->oldNs);
4440 }
4441 while (node != NULL) {
4442 cur = node->nsDef;
4443 while (cur != NULL) {
4444 if ((cur->href != NULL) && (href != NULL) &&
4445 (xmlStrEqual(cur->href, href))) {
4446 /*
4447 * Check that the prefix is not shadowed between orig and node
4448 */
4449 xmlNodePtr check = orig;
4450 xmlNsPtr tst;
4451
4452 while (check != node) {
4453 tst = check->nsDef;
4454 while (tst != NULL) {
4455 if ((tst->prefix == NULL) && (cur->prefix == NULL))
4456 goto shadowed;
4457 if ((tst->prefix != NULL) && (cur->prefix != NULL) &&
4458 (xmlStrEqual(tst->prefix, cur->prefix)))
4459 goto shadowed;
4460 tst = tst->next;
4461 }
4462 check = check->parent;
4463 }
4464 return(cur);
4465 }
4466shadowed:
4467 cur = cur->next;
4468 }
4469 node = node->parent;
4470 }
4471 return(NULL);
4472}
4473
4474/**
4475 * xmlNewReconciliedNs
4476 * @doc: the document
4477 * @tree: a node expected to hold the new namespace
4478 * @ns: the original namespace
4479 *
4480 * This function tries to locate a namespace definition in a tree
4481 * ancestors, or create a new namespace definition node similar to
4482 * @ns trying to reuse the same prefix. However if the given prefix is
4483 * null (default namespace) or reused within the subtree defined by
4484 * @tree or on one of its ancestors then a new prefix is generated.
4485 * Returns the (new) namespace definition or NULL in case of error
4486 */
4487xmlNsPtr
4488xmlNewReconciliedNs(xmlDocPtr doc, xmlNodePtr tree, xmlNsPtr ns) {
4489 xmlNsPtr def;
4490 xmlChar prefix[50];
4491 int counter = 1;
4492
4493 if (tree == NULL) {
4494#ifdef DEBUG_TREE
4495 xmlGenericError(xmlGenericErrorContext,
4496 "xmlNewReconciliedNs : tree == NULL\n");
4497#endif
4498 return(NULL);
4499 }
4500 if (ns == NULL) {
4501#ifdef DEBUG_TREE
4502 xmlGenericError(xmlGenericErrorContext,
4503 "xmlNewReconciliedNs : ns == NULL\n");
4504#endif
4505 return(NULL);
4506 }
4507 /*
4508 * Search an existing namespace definition inherited.
4509 */
4510 def = xmlSearchNsByHref(doc, tree, ns->href);
4511 if (def != NULL)
4512 return(def);
4513
4514 /*
4515 * Find a close prefix which is not already in use.
4516 * Let's strip namespace prefixes longer than 20 chars !
4517 */
4518 sprintf((char *) prefix, "%.20s", ns->prefix);
4519 def = xmlSearchNs(doc, tree, prefix);
4520 while (def != NULL) {
4521 if (counter > 1000) return(NULL);
4522 sprintf((char *) prefix, "%.20s%d", ns->prefix, counter++);
4523 def = xmlSearchNs(doc, tree, prefix);
4524 }
4525
4526 /*
Daniel Veillardd1640922001-12-17 15:30:10 +00004527 * OK, now we are ready to create a new one.
Owen Taylor3473f882001-02-23 17:55:21 +00004528 */
4529 def = xmlNewNs(tree, ns->href, prefix);
4530 return(def);
4531}
4532
4533/**
4534 * xmlReconciliateNs
4535 * @doc: the document
4536 * @tree: a node defining the subtree to reconciliate
4537 *
4538 * This function checks that all the namespaces declared within the given
4539 * tree are properly declared. This is needed for example after Copy or Cut
4540 * and then paste operations. The subtree may still hold pointers to
4541 * namespace declarations outside the subtree or invalid/masked. As much
Daniel Veillardd1640922001-12-17 15:30:10 +00004542 * as possible the function try to reuse the existing namespaces found in
Owen Taylor3473f882001-02-23 17:55:21 +00004543 * the new environment. If not possible the new namespaces are redeclared
4544 * on @tree at the top of the given subtree.
4545 * Returns the number of namespace declarations created or -1 in case of error.
4546 */
4547int
4548xmlReconciliateNs(xmlDocPtr doc, xmlNodePtr tree) {
4549 xmlNsPtr *oldNs = NULL;
4550 xmlNsPtr *newNs = NULL;
4551 int sizeCache = 0;
4552 int nbCache = 0;
4553
4554 xmlNsPtr n;
4555 xmlNodePtr node = tree;
4556 xmlAttrPtr attr;
4557 int ret = 0, i;
4558
4559 while (node != NULL) {
4560 /*
4561 * Reconciliate the node namespace
4562 */
4563 if (node->ns != NULL) {
4564 /*
4565 * initialize the cache if needed
4566 */
4567 if (sizeCache == 0) {
4568 sizeCache = 10;
4569 oldNs = (xmlNsPtr *) xmlMalloc(sizeCache *
4570 sizeof(xmlNsPtr));
4571 if (oldNs == NULL) {
4572 xmlGenericError(xmlGenericErrorContext,
4573 "xmlReconciliateNs : memory pbm\n");
4574 return(-1);
4575 }
4576 newNs = (xmlNsPtr *) xmlMalloc(sizeCache *
4577 sizeof(xmlNsPtr));
4578 if (newNs == NULL) {
4579 xmlGenericError(xmlGenericErrorContext,
4580 "xmlReconciliateNs : memory pbm\n");
4581 xmlFree(oldNs);
4582 return(-1);
4583 }
4584 }
4585 for (i = 0;i < nbCache;i++) {
4586 if (oldNs[i] == node->ns) {
4587 node->ns = newNs[i];
4588 break;
4589 }
4590 }
4591 if (i == nbCache) {
4592 /*
Daniel Veillardd1640922001-12-17 15:30:10 +00004593 * OK we need to recreate a new namespace definition
Owen Taylor3473f882001-02-23 17:55:21 +00004594 */
4595 n = xmlNewReconciliedNs(doc, tree, node->ns);
4596 if (n != NULL) { /* :-( what if else ??? */
4597 /*
4598 * check if we need to grow the cache buffers.
4599 */
4600 if (sizeCache <= nbCache) {
4601 sizeCache *= 2;
4602 oldNs = (xmlNsPtr *) xmlRealloc(oldNs, sizeCache *
4603 sizeof(xmlNsPtr));
4604 if (oldNs == NULL) {
4605 xmlGenericError(xmlGenericErrorContext,
4606 "xmlReconciliateNs : memory pbm\n");
4607 xmlFree(newNs);
4608 return(-1);
4609 }
4610 newNs = (xmlNsPtr *) xmlRealloc(newNs, sizeCache *
4611 sizeof(xmlNsPtr));
4612 if (newNs == NULL) {
4613 xmlGenericError(xmlGenericErrorContext,
4614 "xmlReconciliateNs : memory pbm\n");
4615 xmlFree(oldNs);
4616 return(-1);
4617 }
4618 }
4619 newNs[nbCache] = n;
4620 oldNs[nbCache++] = node->ns;
4621 node->ns = n;
4622 }
4623 }
4624 }
4625 /*
4626 * now check for namespace hold by attributes on the node.
4627 */
4628 attr = node->properties;
4629 while (attr != NULL) {
4630 if (attr->ns != NULL) {
4631 /*
4632 * initialize the cache if needed
4633 */
4634 if (sizeCache == 0) {
4635 sizeCache = 10;
4636 oldNs = (xmlNsPtr *) xmlMalloc(sizeCache *
4637 sizeof(xmlNsPtr));
4638 if (oldNs == NULL) {
4639 xmlGenericError(xmlGenericErrorContext,
4640 "xmlReconciliateNs : memory pbm\n");
4641 return(-1);
4642 }
4643 newNs = (xmlNsPtr *) xmlMalloc(sizeCache *
4644 sizeof(xmlNsPtr));
4645 if (newNs == NULL) {
4646 xmlGenericError(xmlGenericErrorContext,
4647 "xmlReconciliateNs : memory pbm\n");
4648 xmlFree(oldNs);
4649 return(-1);
4650 }
4651 }
4652 for (i = 0;i < nbCache;i++) {
4653 if (oldNs[i] == attr->ns) {
4654 node->ns = newNs[i];
4655 break;
4656 }
4657 }
4658 if (i == nbCache) {
4659 /*
Daniel Veillardd1640922001-12-17 15:30:10 +00004660 * OK we need to recreate a new namespace definition
Owen Taylor3473f882001-02-23 17:55:21 +00004661 */
4662 n = xmlNewReconciliedNs(doc, tree, attr->ns);
4663 if (n != NULL) { /* :-( what if else ??? */
4664 /*
4665 * check if we need to grow the cache buffers.
4666 */
4667 if (sizeCache <= nbCache) {
4668 sizeCache *= 2;
4669 oldNs = (xmlNsPtr *) xmlRealloc(oldNs, sizeCache *
4670 sizeof(xmlNsPtr));
4671 if (oldNs == NULL) {
4672 xmlGenericError(xmlGenericErrorContext,
4673 "xmlReconciliateNs : memory pbm\n");
4674 xmlFree(newNs);
4675 return(-1);
4676 }
4677 newNs = (xmlNsPtr *) xmlRealloc(newNs, sizeCache *
4678 sizeof(xmlNsPtr));
4679 if (newNs == NULL) {
4680 xmlGenericError(xmlGenericErrorContext,
4681 "xmlReconciliateNs : memory pbm\n");
4682 xmlFree(oldNs);
4683 return(-1);
4684 }
4685 }
4686 newNs[nbCache] = n;
4687 oldNs[nbCache++] = attr->ns;
4688 attr->ns = n;
4689 }
4690 }
4691 }
4692 attr = attr->next;
4693 }
4694
4695 /*
4696 * Browse the full subtree, deep first
4697 */
4698 if (node->children != NULL) {
4699 /* deep first */
4700 node = node->children;
4701 } else if ((node != tree) && (node->next != NULL)) {
4702 /* then siblings */
4703 node = node->next;
4704 } else if (node != tree) {
4705 /* go up to parents->next if needed */
4706 while (node != tree) {
4707 if (node->parent != NULL)
4708 node = node->parent;
4709 if ((node != tree) && (node->next != NULL)) {
4710 node = node->next;
4711 break;
4712 }
4713 if (node->parent == NULL) {
4714 node = NULL;
4715 break;
4716 }
4717 }
4718 /* exit condition */
4719 if (node == tree)
4720 node = NULL;
4721 }
4722 }
4723 return(ret);
4724}
4725
4726/**
4727 * xmlHasProp:
4728 * @node: the node
4729 * @name: the attribute name
4730 *
4731 * Search an attribute associated to a node
4732 * This function also looks in DTD attribute declaration for #FIXED or
4733 * default declaration values unless DTD use has been turned off.
4734 *
4735 * Returns the attribute or the attribute declaration or NULL if
4736 * neither was found.
4737 */
4738xmlAttrPtr
4739xmlHasProp(xmlNodePtr node, const xmlChar *name) {
4740 xmlAttrPtr prop;
4741 xmlDocPtr doc;
4742
4743 if ((node == NULL) || (name == NULL)) return(NULL);
4744 /*
4745 * Check on the properties attached to the node
4746 */
4747 prop = node->properties;
4748 while (prop != NULL) {
4749 if (xmlStrEqual(prop->name, name)) {
4750 return(prop);
4751 }
4752 prop = prop->next;
4753 }
4754 if (!xmlCheckDTD) return(NULL);
4755
4756 /*
4757 * Check if there is a default declaration in the internal
4758 * or external subsets
4759 */
4760 doc = node->doc;
4761 if (doc != NULL) {
4762 xmlAttributePtr attrDecl;
4763 if (doc->intSubset != NULL) {
4764 attrDecl = xmlGetDtdAttrDesc(doc->intSubset, node->name, name);
4765 if ((attrDecl == NULL) && (doc->extSubset != NULL))
4766 attrDecl = xmlGetDtdAttrDesc(doc->extSubset, node->name, name);
4767 if (attrDecl != NULL)
4768 return((xmlAttrPtr) attrDecl);
4769 }
4770 }
4771 return(NULL);
4772}
4773
4774/**
Daniel Veillarde95e2392001-06-06 10:46:28 +00004775 * xmlHasNsProp:
4776 * @node: the node
4777 * @name: the attribute name
Daniel Veillardca2366a2001-06-11 12:09:01 +00004778 * @nameSpace: the URI of the namespace
Daniel Veillarde95e2392001-06-06 10:46:28 +00004779 *
4780 * Search for an attribute associated to a node
4781 * This attribute has to be anchored in the namespace specified.
4782 * This does the entity substitution.
4783 * This function looks in DTD attribute declaration for #FIXED or
4784 * default declaration values unless DTD use has been turned off.
4785 *
4786 * Returns the attribute or the attribute declaration or NULL
4787 * if neither was found.
4788 */
4789xmlAttrPtr
Daniel Veillardca2366a2001-06-11 12:09:01 +00004790xmlHasNsProp(xmlNodePtr node, const xmlChar *name, const xmlChar *nameSpace) {
Daniel Veillarde95e2392001-06-06 10:46:28 +00004791 xmlAttrPtr prop;
4792 xmlDocPtr doc;
4793 xmlNsPtr ns;
4794
4795 if (node == NULL)
4796 return(NULL);
4797
4798 prop = node->properties;
Daniel Veillardca2366a2001-06-11 12:09:01 +00004799 if (nameSpace == NULL)
Daniel Veillarde95e2392001-06-06 10:46:28 +00004800 return(xmlHasProp(node, name));
4801 while (prop != NULL) {
4802 /*
4803 * One need to have
4804 * - same attribute names
4805 * - and the attribute carrying that namespace
4806 * or
4807 * no namespace on the attribute and the element carrying it
4808 */
4809 if ((xmlStrEqual(prop->name, name)) &&
Daniel Veillarde3c81b52001-06-17 14:50:34 +00004810 ((prop->ns != NULL) && (xmlStrEqual(prop->ns->href, nameSpace)))) {
4811 return(prop);
Daniel Veillarde95e2392001-06-06 10:46:28 +00004812 }
4813 prop = prop->next;
4814 }
4815 if (!xmlCheckDTD) return(NULL);
4816
4817 /*
4818 * Check if there is a default declaration in the internal
4819 * or external subsets
4820 */
4821 doc = node->doc;
4822 if (doc != NULL) {
4823 if (doc->intSubset != NULL) {
4824 xmlAttributePtr attrDecl;
4825
4826 attrDecl = xmlGetDtdAttrDesc(doc->intSubset, node->name, name);
4827 if ((attrDecl == NULL) && (doc->extSubset != NULL))
4828 attrDecl = xmlGetDtdAttrDesc(doc->extSubset, node->name, name);
4829
4830 if ((attrDecl != NULL) && (attrDecl->prefix != NULL)) {
4831 /*
4832 * The DTD declaration only allows a prefix search
4833 */
4834 ns = xmlSearchNs(doc, node, attrDecl->prefix);
Daniel Veillardca2366a2001-06-11 12:09:01 +00004835 if ((ns != NULL) && (xmlStrEqual(ns->href, nameSpace)))
Daniel Veillarde95e2392001-06-06 10:46:28 +00004836 return((xmlAttrPtr) attrDecl);
4837 }
4838 }
4839 }
4840 return(NULL);
4841}
4842
4843/**
Owen Taylor3473f882001-02-23 17:55:21 +00004844 * xmlGetProp:
4845 * @node: the node
4846 * @name: the attribute name
4847 *
4848 * Search and get the value of an attribute associated to a node
4849 * This does the entity substitution.
4850 * This function looks in DTD attribute declaration for #FIXED or
4851 * default declaration values unless DTD use has been turned off.
4852 *
4853 * Returns the attribute value or NULL if not found.
4854 * It's up to the caller to free the memory.
4855 */
4856xmlChar *
4857xmlGetProp(xmlNodePtr node, const xmlChar *name) {
4858 xmlAttrPtr prop;
4859 xmlDocPtr doc;
4860
4861 if ((node == NULL) || (name == NULL)) return(NULL);
4862 /*
4863 * Check on the properties attached to the node
4864 */
4865 prop = node->properties;
4866 while (prop != NULL) {
4867 if (xmlStrEqual(prop->name, name)) {
4868 xmlChar *ret;
4869
4870 ret = xmlNodeListGetString(node->doc, prop->children, 1);
4871 if (ret == NULL) return(xmlStrdup((xmlChar *)""));
4872 return(ret);
4873 }
4874 prop = prop->next;
4875 }
4876 if (!xmlCheckDTD) return(NULL);
4877
4878 /*
4879 * Check if there is a default declaration in the internal
4880 * or external subsets
4881 */
4882 doc = node->doc;
4883 if (doc != NULL) {
4884 xmlAttributePtr attrDecl;
4885 if (doc->intSubset != NULL) {
4886 attrDecl = xmlGetDtdAttrDesc(doc->intSubset, node->name, name);
4887 if ((attrDecl == NULL) && (doc->extSubset != NULL))
4888 attrDecl = xmlGetDtdAttrDesc(doc->extSubset, node->name, name);
4889 if (attrDecl != NULL)
4890 return(xmlStrdup(attrDecl->defaultValue));
4891 }
4892 }
4893 return(NULL);
4894}
4895
4896/**
4897 * xmlGetNsProp:
4898 * @node: the node
4899 * @name: the attribute name
Daniel Veillardca2366a2001-06-11 12:09:01 +00004900 * @nameSpace: the URI of the namespace
Owen Taylor3473f882001-02-23 17:55:21 +00004901 *
4902 * Search and get the value of an attribute associated to a node
4903 * This attribute has to be anchored in the namespace specified.
4904 * This does the entity substitution.
4905 * This function looks in DTD attribute declaration for #FIXED or
4906 * default declaration values unless DTD use has been turned off.
4907 *
4908 * Returns the attribute value or NULL if not found.
4909 * It's up to the caller to free the memory.
4910 */
4911xmlChar *
Daniel Veillardca2366a2001-06-11 12:09:01 +00004912xmlGetNsProp(xmlNodePtr node, const xmlChar *name, const xmlChar *nameSpace) {
Owen Taylor3473f882001-02-23 17:55:21 +00004913 xmlAttrPtr prop;
4914 xmlDocPtr doc;
4915 xmlNsPtr ns;
4916
4917 if (node == NULL)
4918 return(NULL);
4919
4920 prop = node->properties;
Daniel Veillardca2366a2001-06-11 12:09:01 +00004921 if (nameSpace == NULL)
Owen Taylor3473f882001-02-23 17:55:21 +00004922 return(xmlGetProp(node, name));
4923 while (prop != NULL) {
4924 /*
4925 * One need to have
4926 * - same attribute names
4927 * - and the attribute carrying that namespace
Owen Taylor3473f882001-02-23 17:55:21 +00004928 */
4929 if ((xmlStrEqual(prop->name, name)) &&
Daniel Veillarde8fc08e2001-06-07 19:35:47 +00004930 ((prop->ns != NULL) &&
Daniel Veillardca2366a2001-06-11 12:09:01 +00004931 (xmlStrEqual(prop->ns->href, nameSpace)))) {
Owen Taylor3473f882001-02-23 17:55:21 +00004932 xmlChar *ret;
4933
4934 ret = xmlNodeListGetString(node->doc, prop->children, 1);
4935 if (ret == NULL) return(xmlStrdup((xmlChar *)""));
4936 return(ret);
4937 }
4938 prop = prop->next;
4939 }
4940 if (!xmlCheckDTD) return(NULL);
4941
4942 /*
4943 * Check if there is a default declaration in the internal
4944 * or external subsets
4945 */
4946 doc = node->doc;
4947 if (doc != NULL) {
Owen Taylor3473f882001-02-23 17:55:21 +00004948 if (doc->intSubset != NULL) {
Daniel Veillard5792e162001-04-30 17:44:45 +00004949 xmlAttributePtr attrDecl;
4950
Owen Taylor3473f882001-02-23 17:55:21 +00004951 attrDecl = xmlGetDtdAttrDesc(doc->intSubset, node->name, name);
4952 if ((attrDecl == NULL) && (doc->extSubset != NULL))
4953 attrDecl = xmlGetDtdAttrDesc(doc->extSubset, node->name, name);
4954
4955 if ((attrDecl != NULL) && (attrDecl->prefix != NULL)) {
4956 /*
4957 * The DTD declaration only allows a prefix search
4958 */
4959 ns = xmlSearchNs(doc, node, attrDecl->prefix);
Daniel Veillardca2366a2001-06-11 12:09:01 +00004960 if ((ns != NULL) && (xmlStrEqual(ns->href, nameSpace)))
Owen Taylor3473f882001-02-23 17:55:21 +00004961 return(xmlStrdup(attrDecl->defaultValue));
4962 }
4963 }
4964 }
4965 return(NULL);
4966}
4967
4968/**
4969 * xmlSetProp:
4970 * @node: the node
4971 * @name: the attribute name
4972 * @value: the attribute value
4973 *
4974 * Set (or reset) an attribute carried by a node.
4975 * Returns the attribute pointer.
4976 */
4977xmlAttrPtr
4978xmlSetProp(xmlNodePtr node, const xmlChar *name, const xmlChar *value) {
Daniel Veillard4855c8c2001-11-25 10:35:25 +00004979 xmlAttrPtr prop;
4980 xmlDocPtr doc;
Owen Taylor3473f882001-02-23 17:55:21 +00004981
4982 if ((node == NULL) || (name == NULL))
4983 return(NULL);
4984 doc = node->doc;
Daniel Veillard4855c8c2001-11-25 10:35:25 +00004985 prop = node->properties;
Owen Taylor3473f882001-02-23 17:55:21 +00004986 while (prop != NULL) {
Daniel Veillard75bea542001-05-11 17:41:21 +00004987 if ((xmlStrEqual(prop->name, name)) &&
4988 (prop->ns == NULL)){
Daniel Veillard4855c8c2001-11-25 10:35:25 +00004989 xmlNodePtr oldprop = prop->children;
4990
Owen Taylor3473f882001-02-23 17:55:21 +00004991 prop->children = NULL;
4992 prop->last = NULL;
4993 if (value != NULL) {
4994 xmlChar *buffer;
4995 xmlNodePtr tmp;
4996
4997 buffer = xmlEncodeEntitiesReentrant(node->doc, value);
4998 prop->children = xmlStringGetNodeList(node->doc, buffer);
4999 prop->last = NULL;
5000 prop->doc = doc;
5001 tmp = prop->children;
5002 while (tmp != NULL) {
5003 tmp->parent = (xmlNodePtr) prop;
5004 tmp->doc = doc;
5005 if (tmp->next == NULL)
5006 prop->last = tmp;
5007 tmp = tmp->next;
5008 }
5009 xmlFree(buffer);
Daniel Veillard75bea542001-05-11 17:41:21 +00005010 }
Daniel Veillard4855c8c2001-11-25 10:35:25 +00005011 if (oldprop != NULL)
5012 xmlFreeNodeList(oldprop);
Owen Taylor3473f882001-02-23 17:55:21 +00005013 return(prop);
5014 }
5015 prop = prop->next;
5016 }
5017 prop = xmlNewProp(node, name, value);
5018 return(prop);
5019}
5020
5021/**
Daniel Veillard75bea542001-05-11 17:41:21 +00005022 * xmlUnsetProp:
5023 * @node: the node
5024 * @name: the attribute name
5025 *
5026 * Remove an attribute carried by a node.
5027 * Returns 0 if successful, -1 if not found
5028 */
5029int
5030xmlUnsetProp(xmlNodePtr node, const xmlChar *name) {
5031 xmlAttrPtr prop = node->properties, prev = NULL;;
5032
5033 if ((node == NULL) || (name == NULL))
5034 return(-1);
5035 while (prop != NULL) {
5036 if ((xmlStrEqual(prop->name, name)) &&
5037 (prop->ns == NULL)) {
5038 if (prev == NULL)
5039 node->properties = prop->next;
5040 else
5041 prev->next = prop->next;
5042 xmlFreeProp(prop);
5043 return(0);
5044 }
5045 prev = prop;
5046 prop = prop->next;
5047 }
5048 return(-1);
5049}
5050
5051/**
Owen Taylor3473f882001-02-23 17:55:21 +00005052 * xmlSetNsProp:
5053 * @node: the node
5054 * @ns: the namespace definition
5055 * @name: the attribute name
5056 * @value: the attribute value
5057 *
5058 * Set (or reset) an attribute carried by a node.
5059 * The ns structure must be in scope, this is not checked.
5060 *
5061 * Returns the attribute pointer.
5062 */
5063xmlAttrPtr
5064xmlSetNsProp(xmlNodePtr node, xmlNsPtr ns, const xmlChar *name,
5065 const xmlChar *value) {
5066 xmlAttrPtr prop;
5067
5068 if ((node == NULL) || (name == NULL))
5069 return(NULL);
5070
5071 if (ns == NULL)
5072 return(xmlSetProp(node, name, value));
5073 if (ns->href == NULL)
5074 return(NULL);
5075 prop = node->properties;
5076
5077 while (prop != NULL) {
5078 /*
5079 * One need to have
5080 * - same attribute names
5081 * - and the attribute carrying that namespace
5082 * or
5083 * no namespace on the attribute and the element carrying it
5084 */
5085 if ((xmlStrEqual(prop->name, name)) &&
5086 (((prop->ns == NULL) && (node->ns != NULL) &&
5087 (xmlStrEqual(node->ns->href, ns->href))) ||
5088 ((prop->ns != NULL) && (xmlStrEqual(prop->ns->href, ns->href))))) {
5089 if (prop->children != NULL)
5090 xmlFreeNodeList(prop->children);
5091 prop->children = NULL;
5092 prop->last = NULL;
5093 prop->ns = ns;
5094 if (value != NULL) {
5095 xmlChar *buffer;
5096 xmlNodePtr tmp;
5097
5098 buffer = xmlEncodeEntitiesReentrant(node->doc, value);
5099 prop->children = xmlStringGetNodeList(node->doc, buffer);
5100 prop->last = NULL;
5101 tmp = prop->children;
5102 while (tmp != NULL) {
5103 tmp->parent = (xmlNodePtr) prop;
5104 if (tmp->next == NULL)
5105 prop->last = tmp;
5106 tmp = tmp->next;
5107 }
5108 xmlFree(buffer);
5109 }
5110 return(prop);
5111 }
5112 prop = prop->next;
5113 }
5114 prop = xmlNewNsProp(node, ns, name, value);
5115 return(prop);
5116}
5117
5118/**
Daniel Veillard75bea542001-05-11 17:41:21 +00005119 * xmlUnsetNsProp:
5120 * @node: the node
5121 * @ns: the namespace definition
5122 * @name: the attribute name
5123 *
5124 * Remove an attribute carried by a node.
5125 * Returns 0 if successful, -1 if not found
5126 */
5127int
5128xmlUnsetNsProp(xmlNodePtr node, xmlNsPtr ns, const xmlChar *name) {
5129 xmlAttrPtr prop = node->properties, prev = NULL;;
5130
5131 if ((node == NULL) || (name == NULL))
5132 return(-1);
5133 if (ns == NULL)
5134 return(xmlUnsetProp(node, name));
5135 if (ns->href == NULL)
5136 return(-1);
5137 while (prop != NULL) {
5138 if ((xmlStrEqual(prop->name, name)) &&
5139 (((prop->ns == NULL) && (node->ns != NULL) &&
5140 (xmlStrEqual(node->ns->href, ns->href))) ||
5141 ((prop->ns != NULL) && (xmlStrEqual(prop->ns->href, ns->href))))) {
5142 if (prev == NULL)
5143 node->properties = prop->next;
5144 else
5145 prev->next = prop->next;
5146 xmlFreeProp(prop);
5147 return(0);
5148 }
5149 prev = prop;
5150 prop = prop->next;
5151 }
5152 return(-1);
5153}
5154
5155/**
Owen Taylor3473f882001-02-23 17:55:21 +00005156 * xmlNodeIsText:
5157 * @node: the node
5158 *
5159 * Is this node a Text node ?
5160 * Returns 1 yes, 0 no
5161 */
5162int
5163xmlNodeIsText(xmlNodePtr node) {
5164 if (node == NULL) return(0);
5165
5166 if (node->type == XML_TEXT_NODE) return(1);
5167 return(0);
5168}
5169
5170/**
5171 * xmlIsBlankNode:
5172 * @node: the node
5173 *
5174 * Checks whether this node is an empty or whitespace only
5175 * (and possibly ignorable) text-node.
5176 *
5177 * Returns 1 yes, 0 no
5178 */
5179int
5180xmlIsBlankNode(xmlNodePtr node) {
5181 const xmlChar *cur;
5182 if (node == NULL) return(0);
5183
Daniel Veillard7db37732001-07-12 01:20:08 +00005184 if ((node->type != XML_TEXT_NODE) &&
5185 (node->type != XML_CDATA_SECTION_NODE))
5186 return(0);
Owen Taylor3473f882001-02-23 17:55:21 +00005187 if (node->content == NULL) return(1);
5188#ifndef XML_USE_BUFFER_CONTENT
5189 cur = node->content;
5190#else
5191 cur = xmlBufferContent(node->content);
5192#endif
5193 while (*cur != 0) {
5194 if (!IS_BLANK(*cur)) return(0);
5195 cur++;
5196 }
5197
5198 return(1);
5199}
5200
5201/**
5202 * xmlTextConcat:
5203 * @node: the node
5204 * @content: the content
Daniel Veillard60087f32001-10-10 09:45:09 +00005205 * @len: @content length
Owen Taylor3473f882001-02-23 17:55:21 +00005206 *
5207 * Concat the given string at the end of the existing node content
5208 */
5209
5210void
5211xmlTextConcat(xmlNodePtr node, const xmlChar *content, int len) {
5212 if (node == NULL) return;
5213
5214 if ((node->type != XML_TEXT_NODE) &&
5215 (node->type != XML_CDATA_SECTION_NODE)) {
5216#ifdef DEBUG_TREE
5217 xmlGenericError(xmlGenericErrorContext,
Daniel Veillardd1640922001-12-17 15:30:10 +00005218 "xmlTextConcat: node is not text nor CDATA\n");
Owen Taylor3473f882001-02-23 17:55:21 +00005219#endif
5220 return;
5221 }
5222#ifndef XML_USE_BUFFER_CONTENT
5223 node->content = xmlStrncat(node->content, content, len);
5224#else
5225 xmlBufferAdd(node->content, content, len);
5226#endif
5227}
5228
5229/************************************************************************
5230 * *
5231 * Output : to a FILE or in memory *
5232 * *
5233 ************************************************************************/
5234
Owen Taylor3473f882001-02-23 17:55:21 +00005235/**
5236 * xmlBufferCreate:
5237 *
5238 * routine to create an XML buffer.
5239 * returns the new structure.
5240 */
5241xmlBufferPtr
5242xmlBufferCreate(void) {
5243 xmlBufferPtr ret;
5244
5245 ret = (xmlBufferPtr) xmlMalloc(sizeof(xmlBuffer));
5246 if (ret == NULL) {
5247 xmlGenericError(xmlGenericErrorContext,
5248 "xmlBufferCreate : out of memory!\n");
5249 return(NULL);
5250 }
5251 ret->use = 0;
Daniel Veillarde356c282001-03-10 12:32:04 +00005252 ret->size = xmlDefaultBufferSize;
Owen Taylor3473f882001-02-23 17:55:21 +00005253 ret->alloc = xmlBufferAllocScheme;
5254 ret->content = (xmlChar *) xmlMalloc(ret->size * sizeof(xmlChar));
5255 if (ret->content == NULL) {
5256 xmlGenericError(xmlGenericErrorContext,
5257 "xmlBufferCreate : out of memory!\n");
5258 xmlFree(ret);
5259 return(NULL);
5260 }
5261 ret->content[0] = 0;
5262 return(ret);
5263}
5264
5265/**
5266 * xmlBufferCreateSize:
5267 * @size: initial size of buffer
5268 *
5269 * routine to create an XML buffer.
5270 * returns the new structure.
5271 */
5272xmlBufferPtr
5273xmlBufferCreateSize(size_t size) {
5274 xmlBufferPtr ret;
5275
5276 ret = (xmlBufferPtr) xmlMalloc(sizeof(xmlBuffer));
5277 if (ret == NULL) {
5278 xmlGenericError(xmlGenericErrorContext,
5279 "xmlBufferCreate : out of memory!\n");
5280 return(NULL);
5281 }
5282 ret->use = 0;
5283 ret->alloc = xmlBufferAllocScheme;
5284 ret->size = (size ? size+2 : 0); /* +1 for ending null */
5285 if (ret->size){
5286 ret->content = (xmlChar *) xmlMalloc(ret->size * sizeof(xmlChar));
5287 if (ret->content == NULL) {
5288 xmlGenericError(xmlGenericErrorContext,
5289 "xmlBufferCreate : out of memory!\n");
5290 xmlFree(ret);
5291 return(NULL);
5292 }
5293 ret->content[0] = 0;
5294 } else
5295 ret->content = NULL;
5296 return(ret);
5297}
5298
5299/**
5300 * xmlBufferSetAllocationScheme:
5301 * @buf: the buffer to free
5302 * @scheme: allocation scheme to use
5303 *
5304 * Sets the allocation scheme for this buffer
5305 */
5306void
5307xmlBufferSetAllocationScheme(xmlBufferPtr buf,
5308 xmlBufferAllocationScheme scheme) {
5309 if (buf == NULL) {
5310#ifdef DEBUG_BUFFER
5311 xmlGenericError(xmlGenericErrorContext,
5312 "xmlBufferSetAllocationScheme: buf == NULL\n");
5313#endif
5314 return;
5315 }
5316
5317 buf->alloc = scheme;
5318}
5319
5320/**
5321 * xmlBufferFree:
5322 * @buf: the buffer to free
5323 *
Daniel Veillard9d06d302002-01-22 18:15:52 +00005324 * Frees an XML buffer. It frees both the content and the structure which
5325 * encapsulate it.
Owen Taylor3473f882001-02-23 17:55:21 +00005326 */
5327void
5328xmlBufferFree(xmlBufferPtr buf) {
5329 if (buf == NULL) {
5330#ifdef DEBUG_BUFFER
5331 xmlGenericError(xmlGenericErrorContext,
5332 "xmlBufferFree: buf == NULL\n");
5333#endif
5334 return;
5335 }
5336 if (buf->content != NULL) {
Owen Taylor3473f882001-02-23 17:55:21 +00005337 xmlFree(buf->content);
5338 }
Owen Taylor3473f882001-02-23 17:55:21 +00005339 xmlFree(buf);
5340}
5341
5342/**
5343 * xmlBufferEmpty:
5344 * @buf: the buffer
5345 *
5346 * empty a buffer.
5347 */
5348void
5349xmlBufferEmpty(xmlBufferPtr buf) {
5350 if (buf->content == NULL) return;
5351 buf->use = 0;
Daniel Veillard92ad2102001-03-27 12:47:33 +00005352 memset(buf->content, 0, buf->size);
Owen Taylor3473f882001-02-23 17:55:21 +00005353}
5354
5355/**
5356 * xmlBufferShrink:
5357 * @buf: the buffer to dump
5358 * @len: the number of xmlChar to remove
5359 *
5360 * Remove the beginning of an XML buffer.
5361 *
Daniel Veillardd1640922001-12-17 15:30:10 +00005362 * Returns the number of #xmlChar removed, or -1 in case of failure.
Owen Taylor3473f882001-02-23 17:55:21 +00005363 */
5364int
5365xmlBufferShrink(xmlBufferPtr buf, unsigned int len) {
5366 if (len == 0) return(0);
5367 if (len > buf->use) return(-1);
5368
5369 buf->use -= len;
5370 memmove(buf->content, &buf->content[len], buf->use * sizeof(xmlChar));
5371
5372 buf->content[buf->use] = 0;
5373 return(len);
5374}
5375
5376/**
5377 * xmlBufferGrow:
5378 * @buf: the buffer
5379 * @len: the minimum free size to allocate
5380 *
5381 * Grow the available space of an XML buffer.
5382 *
5383 * Returns the new available space or -1 in case of error
5384 */
5385int
5386xmlBufferGrow(xmlBufferPtr buf, unsigned int len) {
5387 int size;
5388 xmlChar *newbuf;
5389
5390 if (len + buf->use < buf->size) return(0);
5391
5392 size = buf->use + len + 100;
5393
5394 newbuf = (xmlChar *) xmlRealloc(buf->content, size);
5395 if (newbuf == NULL) return(-1);
5396 buf->content = newbuf;
5397 buf->size = size;
5398 return(buf->size - buf->use);
5399}
5400
5401/**
5402 * xmlBufferDump:
5403 * @file: the file output
5404 * @buf: the buffer to dump
5405 *
5406 * Dumps an XML buffer to a FILE *.
Daniel Veillardd1640922001-12-17 15:30:10 +00005407 * Returns the number of #xmlChar written
Owen Taylor3473f882001-02-23 17:55:21 +00005408 */
5409int
5410xmlBufferDump(FILE *file, xmlBufferPtr buf) {
5411 int ret;
5412
5413 if (buf == NULL) {
5414#ifdef DEBUG_BUFFER
5415 xmlGenericError(xmlGenericErrorContext,
5416 "xmlBufferDump: buf == NULL\n");
5417#endif
5418 return(0);
5419 }
5420 if (buf->content == NULL) {
5421#ifdef DEBUG_BUFFER
5422 xmlGenericError(xmlGenericErrorContext,
5423 "xmlBufferDump: buf->content == NULL\n");
5424#endif
5425 return(0);
5426 }
Daniel Veillardcd337f02001-11-22 18:20:37 +00005427 if (file == NULL)
5428 file = stdout;
Owen Taylor3473f882001-02-23 17:55:21 +00005429 ret = fwrite(buf->content, sizeof(xmlChar), buf->use, file);
5430 return(ret);
5431}
5432
5433/**
5434 * xmlBufferContent:
5435 * @buf: the buffer
5436 *
Daniel Veillard5e2dace2001-07-18 19:30:27 +00005437 * Function to extract the content of a buffer
5438 *
Owen Taylor3473f882001-02-23 17:55:21 +00005439 * Returns the internal content
5440 */
5441
Daniel Veillard5e2dace2001-07-18 19:30:27 +00005442const xmlChar *
Owen Taylor3473f882001-02-23 17:55:21 +00005443xmlBufferContent(const xmlBufferPtr buf)
5444{
5445 if(!buf)
5446 return NULL;
5447
5448 return buf->content;
5449}
5450
5451/**
5452 * xmlBufferLength:
5453 * @buf: the buffer
5454 *
Daniel Veillard5e2dace2001-07-18 19:30:27 +00005455 * Function to get the length of a buffer
5456 *
Owen Taylor3473f882001-02-23 17:55:21 +00005457 * Returns the length of data in the internal content
5458 */
5459
5460int
5461xmlBufferLength(const xmlBufferPtr buf)
5462{
5463 if(!buf)
5464 return 0;
5465
5466 return buf->use;
5467}
5468
5469/**
5470 * xmlBufferResize:
5471 * @buf: the buffer to resize
5472 * @size: the desired size
5473 *
Daniel Veillardd1640922001-12-17 15:30:10 +00005474 * Resize a buffer to accommodate minimum size of @size.
Owen Taylor3473f882001-02-23 17:55:21 +00005475 *
5476 * Returns 0 in case of problems, 1 otherwise
5477 */
5478int
5479xmlBufferResize(xmlBufferPtr buf, unsigned int size)
5480{
5481 unsigned int newSize;
5482 xmlChar* rebuf = NULL;
5483
5484 /*take care of empty case*/
5485 newSize = (buf->size ? buf->size*2 : size);
5486
5487 /* Don't resize if we don't have to */
5488 if (size < buf->size)
5489 return 1;
5490
5491 /* figure out new size */
5492 switch (buf->alloc){
5493 case XML_BUFFER_ALLOC_DOUBLEIT:
5494 while (size > newSize) newSize *= 2;
5495 break;
5496 case XML_BUFFER_ALLOC_EXACT:
5497 newSize = size+10;
5498 break;
5499 default:
5500 newSize = size+10;
5501 break;
5502 }
5503
5504 if (buf->content == NULL)
5505 rebuf = (xmlChar *) xmlMalloc(newSize * sizeof(xmlChar));
5506 else
5507 rebuf = (xmlChar *) xmlRealloc(buf->content,
5508 newSize * sizeof(xmlChar));
5509 if (rebuf == NULL) {
5510 xmlGenericError(xmlGenericErrorContext,
Daniel Veillardd1640922001-12-17 15:30:10 +00005511 "xmlBufferResize : out of memory!\n");
Owen Taylor3473f882001-02-23 17:55:21 +00005512 return 0;
5513 }
5514 buf->content = rebuf;
5515 buf->size = newSize;
5516
5517 return 1;
5518}
5519
5520/**
5521 * xmlBufferAdd:
5522 * @buf: the buffer to dump
Daniel Veillardd1640922001-12-17 15:30:10 +00005523 * @str: the #xmlChar string
5524 * @len: the number of #xmlChar to add
Owen Taylor3473f882001-02-23 17:55:21 +00005525 *
Daniel Veillard60087f32001-10-10 09:45:09 +00005526 * Add a string range to an XML buffer. if len == -1, the length of
Owen Taylor3473f882001-02-23 17:55:21 +00005527 * str is recomputed.
5528 */
5529void
5530xmlBufferAdd(xmlBufferPtr buf, const xmlChar *str, int len) {
5531 unsigned int needSize;
5532
5533 if (str == NULL) {
5534#ifdef DEBUG_BUFFER
5535 xmlGenericError(xmlGenericErrorContext,
5536 "xmlBufferAdd: str == NULL\n");
5537#endif
5538 return;
5539 }
5540 if (len < -1) {
5541#ifdef DEBUG_BUFFER
5542 xmlGenericError(xmlGenericErrorContext,
5543 "xmlBufferAdd: len < 0\n");
5544#endif
5545 return;
5546 }
5547 if (len == 0) return;
5548
5549 if (len < 0)
5550 len = xmlStrlen(str);
5551
5552 if (len <= 0) return;
5553
5554 needSize = buf->use + len + 2;
5555 if (needSize > buf->size){
5556 if (!xmlBufferResize(buf, needSize)){
5557 xmlGenericError(xmlGenericErrorContext,
5558 "xmlBufferAdd : out of memory!\n");
5559 return;
5560 }
5561 }
5562
5563 memmove(&buf->content[buf->use], str, len*sizeof(xmlChar));
5564 buf->use += len;
5565 buf->content[buf->use] = 0;
5566}
5567
5568/**
5569 * xmlBufferAddHead:
5570 * @buf: the buffer
Daniel Veillardd1640922001-12-17 15:30:10 +00005571 * @str: the #xmlChar string
5572 * @len: the number of #xmlChar to add
Owen Taylor3473f882001-02-23 17:55:21 +00005573 *
5574 * Add a string range to the beginning of an XML buffer.
Daniel Veillard60087f32001-10-10 09:45:09 +00005575 * if len == -1, the length of @str is recomputed.
Owen Taylor3473f882001-02-23 17:55:21 +00005576 */
5577void
5578xmlBufferAddHead(xmlBufferPtr buf, const xmlChar *str, int len) {
5579 unsigned int needSize;
5580
5581 if (str == NULL) {
5582#ifdef DEBUG_BUFFER
5583 xmlGenericError(xmlGenericErrorContext,
Daniel Veillardd1640922001-12-17 15:30:10 +00005584 "xmlBufferAddHead: str == NULL\n");
Owen Taylor3473f882001-02-23 17:55:21 +00005585#endif
5586 return;
5587 }
5588 if (len < -1) {
5589#ifdef DEBUG_BUFFER
5590 xmlGenericError(xmlGenericErrorContext,
Daniel Veillardd1640922001-12-17 15:30:10 +00005591 "xmlBufferAddHead: len < 0\n");
Owen Taylor3473f882001-02-23 17:55:21 +00005592#endif
5593 return;
5594 }
5595 if (len == 0) return;
5596
5597 if (len < 0)
5598 len = xmlStrlen(str);
5599
5600 if (len <= 0) return;
5601
5602 needSize = buf->use + len + 2;
5603 if (needSize > buf->size){
5604 if (!xmlBufferResize(buf, needSize)){
5605 xmlGenericError(xmlGenericErrorContext,
5606 "xmlBufferAddHead : out of memory!\n");
5607 return;
5608 }
5609 }
5610
5611 memmove(&buf->content[len], &buf->content[0], buf->use * sizeof(xmlChar));
5612 memmove(&buf->content[0], str, len * sizeof(xmlChar));
5613 buf->use += len;
5614 buf->content[buf->use] = 0;
5615}
5616
5617/**
5618 * xmlBufferCat:
5619 * @buf: the buffer to dump
Daniel Veillardd1640922001-12-17 15:30:10 +00005620 * @str: the #xmlChar string
Owen Taylor3473f882001-02-23 17:55:21 +00005621 *
5622 * Append a zero terminated string to an XML buffer.
5623 */
5624void
5625xmlBufferCat(xmlBufferPtr buf, const xmlChar *str) {
5626 if (str != NULL)
5627 xmlBufferAdd(buf, str, -1);
5628}
5629
5630/**
5631 * xmlBufferCCat:
5632 * @buf: the buffer to dump
5633 * @str: the C char string
5634 *
5635 * Append a zero terminated C string to an XML buffer.
5636 */
5637void
5638xmlBufferCCat(xmlBufferPtr buf, const char *str) {
5639 const char *cur;
5640
5641 if (str == NULL) {
5642#ifdef DEBUG_BUFFER
5643 xmlGenericError(xmlGenericErrorContext,
Daniel Veillardd1640922001-12-17 15:30:10 +00005644 "xmlBufferCCat: str == NULL\n");
Owen Taylor3473f882001-02-23 17:55:21 +00005645#endif
5646 return;
5647 }
5648 for (cur = str;*cur != 0;cur++) {
5649 if (buf->use + 10 >= buf->size) {
5650 if (!xmlBufferResize(buf, buf->use+10)){
5651 xmlGenericError(xmlGenericErrorContext,
5652 "xmlBufferCCat : out of memory!\n");
5653 return;
5654 }
5655 }
5656 buf->content[buf->use++] = *cur;
5657 }
5658 buf->content[buf->use] = 0;
5659}
5660
5661/**
Daniel Veillard5e2dace2001-07-18 19:30:27 +00005662 * xmlBufferWriteXmlCHAR:
5663 * @buf: the XML buffer
5664 * @string: the string to add
5665 *
5666 * For VMS only.
5667 * routine which manages and grows an output buffer. This one adds
5668 * xmlChars at the end of the buffer.
5669 */
5670/**
Owen Taylor3473f882001-02-23 17:55:21 +00005671 * xmlBufferWriteCHAR:
5672 * @buf: the XML buffer
5673 * @string: the string to add
5674 *
5675 * routine which manages and grows an output buffer. This one adds
5676 * xmlChars at the end of the buffer.
5677 */
5678void
5679#ifdef VMS
5680xmlBufferWriteXmlCHAR
5681#else
5682xmlBufferWriteCHAR
5683#endif
5684(xmlBufferPtr buf, const xmlChar *string) {
5685 xmlBufferCat(buf, string);
5686}
5687
5688/**
5689 * xmlBufferWriteChar:
5690 * @buf: the XML buffer output
5691 * @string: the string to add
5692 *
5693 * routine which manage and grows an output buffer. This one add
5694 * C chars at the end of the array.
5695 */
5696void
5697xmlBufferWriteChar(xmlBufferPtr buf, const char *string) {
5698 xmlBufferCCat(buf, string);
5699}
5700
5701
5702/**
5703 * xmlBufferWriteQuotedString:
5704 * @buf: the XML buffer output
5705 * @string: the string to add
5706 *
5707 * routine which manage and grows an output buffer. This one writes
Daniel Veillardd1640922001-12-17 15:30:10 +00005708 * a quoted or double quoted #xmlChar string, checking first if it holds
Owen Taylor3473f882001-02-23 17:55:21 +00005709 * quote or double-quotes internally
5710 */
5711void
5712xmlBufferWriteQuotedString(xmlBufferPtr buf, const xmlChar *string) {
5713 if (xmlStrchr(string, '"')) {
5714 if (xmlStrchr(string, '\'')) {
5715#ifdef DEBUG_BUFFER
5716 xmlGenericError(xmlGenericErrorContext,
5717 "xmlBufferWriteQuotedString: string contains quote and double-quotes !\n");
5718#endif
5719 }
5720 xmlBufferCCat(buf, "'");
5721 xmlBufferCat(buf, string);
5722 xmlBufferCCat(buf, "'");
5723 } else {
5724 xmlBufferCCat(buf, "\"");
5725 xmlBufferCat(buf, string);
5726 xmlBufferCCat(buf, "\"");
5727 }
5728}
5729
5730
5731/************************************************************************
5732 * *
5733 * Dumping XML tree content to a simple buffer *
5734 * *
5735 ************************************************************************/
5736
Owen Taylor3473f882001-02-23 17:55:21 +00005737static void
5738xmlNodeListDump(xmlBufferPtr buf, xmlDocPtr doc, xmlNodePtr cur, int level,
5739 int format);
5740void
5741htmlNodeDump(xmlBufferPtr buf, xmlDocPtr doc, xmlNodePtr cur);
5742
5743/**
5744 * xmlNsDump:
5745 * @buf: the XML buffer output
5746 * @cur: a namespace
5747 *
5748 * Dump a local Namespace definition.
5749 * Should be called in the context of attributes dumps.
5750 */
5751static void
5752xmlNsDump(xmlBufferPtr buf, xmlNsPtr cur) {
5753 if (cur == NULL) {
5754#ifdef DEBUG_TREE
5755 xmlGenericError(xmlGenericErrorContext,
5756 "xmlNsDump : Ns == NULL\n");
5757#endif
5758 return;
5759 }
5760 if (cur->type == XML_LOCAL_NAMESPACE) {
5761 /* Within the context of an element attributes */
5762 if (cur->prefix != NULL) {
5763 xmlBufferWriteChar(buf, " xmlns:");
5764 xmlBufferWriteCHAR(buf, cur->prefix);
5765 } else
5766 xmlBufferWriteChar(buf, " xmlns");
5767 xmlBufferWriteChar(buf, "=");
5768 xmlBufferWriteQuotedString(buf, cur->href);
5769 }
5770}
5771
5772/**
5773 * xmlNsListDump:
5774 * @buf: the XML buffer output
5775 * @cur: the first namespace
5776 *
5777 * Dump a list of local Namespace definitions.
5778 * Should be called in the context of attributes dumps.
5779 */
5780static void
5781xmlNsListDump(xmlBufferPtr buf, xmlNsPtr cur) {
5782 while (cur != NULL) {
5783 xmlNsDump(buf, cur);
5784 cur = cur->next;
5785 }
5786}
5787
5788/**
5789 * xmlDtdDump:
5790 * @buf: the XML buffer output
Daniel Veillardd1640922001-12-17 15:30:10 +00005791 * @dtd: the DTD
Owen Taylor3473f882001-02-23 17:55:21 +00005792 *
5793 * Dump the XML document DTD, if any.
5794 */
5795static void
5796xmlDtdDump(xmlBufferPtr buf, xmlDtdPtr dtd) {
5797 if (dtd == NULL) {
5798#ifdef DEBUG_TREE
5799 xmlGenericError(xmlGenericErrorContext,
5800 "xmlDtdDump : no internal subset\n");
5801#endif
5802 return;
5803 }
5804 xmlBufferWriteChar(buf, "<!DOCTYPE ");
5805 xmlBufferWriteCHAR(buf, dtd->name);
5806 if (dtd->ExternalID != NULL) {
5807 xmlBufferWriteChar(buf, " PUBLIC ");
5808 xmlBufferWriteQuotedString(buf, dtd->ExternalID);
5809 xmlBufferWriteChar(buf, " ");
5810 xmlBufferWriteQuotedString(buf, dtd->SystemID);
5811 } else if (dtd->SystemID != NULL) {
5812 xmlBufferWriteChar(buf, " SYSTEM ");
5813 xmlBufferWriteQuotedString(buf, dtd->SystemID);
5814 }
5815 if ((dtd->entities == NULL) && (dtd->elements == NULL) &&
5816 (dtd->attributes == NULL) && (dtd->notations == NULL)) {
5817 xmlBufferWriteChar(buf, ">");
5818 return;
5819 }
5820 xmlBufferWriteChar(buf, " [\n");
5821 xmlNodeListDump(buf, dtd->doc, dtd->children, -1, 0);
5822#if 0
5823 if (dtd->entities != NULL)
5824 xmlDumpEntitiesTable(buf, (xmlEntitiesTablePtr) dtd->entities);
5825 if (dtd->notations != NULL)
5826 xmlDumpNotationTable(buf, (xmlNotationTablePtr) dtd->notations);
5827 if (dtd->elements != NULL)
5828 xmlDumpElementTable(buf, (xmlElementTablePtr) dtd->elements);
5829 if (dtd->attributes != NULL)
5830 xmlDumpAttributeTable(buf, (xmlAttributeTablePtr) dtd->attributes);
5831#endif
5832 xmlBufferWriteChar(buf, "]>");
5833}
5834
5835/**
Daniel Veillarda6d05382002-02-13 13:07:41 +00005836 * xmlAttrSerializeContent:
5837 * @buf: the XML buffer output
5838 * @doc: the document
5839 * @attr: the attribute pointer
5840 *
5841 * Serialize the attribute in the buffer
5842 */
5843static void
5844xmlAttrSerializeContent(xmlBufferPtr buf, xmlDocPtr doc, xmlAttrPtr attr) {
5845 const xmlChar *cur, *base;
5846 xmlNodePtr children;
5847
5848 children = attr->children;
5849 while (children != NULL) {
5850 switch (children->type) {
5851 case XML_TEXT_NODE:
5852 base = cur = children->content;
5853 while (*cur != 0) {
5854 if (*cur == '\n') {
5855 if (base != cur)
5856 xmlBufferAdd(buf, base, cur - base);
5857 xmlBufferAdd(buf, BAD_CAST "&#10;", 5);
5858 cur++;
5859 base = cur;
5860#if 0
5861 } else if (*cur == '\'') {
5862 if (base != cur)
5863 xmlBufferAdd(buf, base, cur - base);
5864 xmlBufferAdd(buf, BAD_CAST "&apos;", 6);
5865 cur++;
5866 base = cur;
5867#endif
5868 } else if (*cur == '"') {
5869 if (base != cur)
5870 xmlBufferAdd(buf, base, cur - base);
5871 xmlBufferAdd(buf, BAD_CAST "&quot;", 6);
5872 cur++;
5873 base = cur;
5874 } else if (*cur == '<') {
5875 if (base != cur)
5876 xmlBufferAdd(buf, base, cur - base);
5877 xmlBufferAdd(buf, BAD_CAST "&lt;", 4);
5878 cur++;
5879 base = cur;
5880 } else if (*cur == '>') {
5881 if (base != cur)
5882 xmlBufferAdd(buf, base, cur - base);
5883 xmlBufferAdd(buf, BAD_CAST "&gt;", 4);
5884 cur++;
5885 base = cur;
5886 } else if (*cur == '&') {
5887 if (base != cur)
5888 xmlBufferAdd(buf, base, cur - base);
5889 xmlBufferAdd(buf, BAD_CAST "&amp;", 5);
5890 cur++;
5891 base = cur;
5892 } else if ((*cur >= 0x80) && ((doc == NULL) ||
5893 (doc->encoding == NULL))) {
5894 /*
5895 * We assume we have UTF-8 content.
5896 */
5897 char tmp[10];
5898 int val = 0, l = 1;
5899
5900 if (base != cur)
5901 xmlBufferAdd(buf, base, cur - base);
5902 if (*cur < 0xC0) {
5903 xmlGenericError(xmlGenericErrorContext,
5904 "xmlAttrSerializeContent : input not UTF-8\n");
5905 if (doc != NULL)
5906 doc->encoding = xmlStrdup(BAD_CAST "ISO-8859-1");
5907 snprintf(tmp, sizeof(tmp), "&#%d;", *cur);
5908 tmp[sizeof(tmp) - 1] = 0;
5909 xmlBufferAdd(buf, (xmlChar *) tmp, -1);
5910 cur++;
5911 base = cur;
5912 continue;
5913 } else if (*cur < 0xE0) {
5914 val = (cur[0]) & 0x1F;
5915 val <<= 6;
5916 val |= (cur[1]) & 0x3F;
5917 l = 2;
5918 } else if (*cur < 0xF0) {
5919 val = (cur[0]) & 0x0F;
5920 val <<= 6;
5921 val |= (cur[1]) & 0x3F;
5922 val <<= 6;
5923 val |= (cur[2]) & 0x3F;
5924 l = 3;
5925 } else if (*cur < 0xF8) {
5926 val = (cur[0]) & 0x07;
5927 val <<= 6;
5928 val |= (cur[1]) & 0x3F;
5929 val <<= 6;
5930 val |= (cur[2]) & 0x3F;
5931 val <<= 6;
5932 val |= (cur[3]) & 0x3F;
5933 l = 4;
5934 }
5935 if ((l == 1) || (!IS_CHAR(val))) {
5936 xmlGenericError(xmlGenericErrorContext,
5937 "xmlAttrSerializeContent : char out of range\n");
5938 if (doc != NULL)
5939 doc->encoding = xmlStrdup(BAD_CAST "ISO-8859-1");
5940 snprintf(tmp, sizeof(tmp), "&#%d;", *cur);
5941 tmp[sizeof(tmp) - 1] = 0;
5942 xmlBufferAdd(buf, (xmlChar *) tmp, -1);
5943 cur++;
5944 base = cur;
5945 continue;
5946 }
5947 /*
5948 * We could do multiple things here. Just save
5949 * as a char ref
5950 */
5951 snprintf(tmp, sizeof(tmp), "&#x%X;", val);
5952 tmp[sizeof(tmp) - 1] = 0;
5953 xmlBufferAdd(buf, (xmlChar *) tmp, -1);
5954 cur += l;
5955 base = cur;
5956 } else {
5957 cur++;
5958 }
5959 }
5960 if (base != cur)
5961 xmlBufferAdd(buf, base, cur - base);
5962 break;
5963 case XML_ENTITY_REF_NODE:
5964 xmlBufferAdd(buf, BAD_CAST "&", 1);
5965 xmlBufferAdd(buf, children->name, xmlStrlen(children->name));
5966 xmlBufferAdd(buf, BAD_CAST ";", 1);
5967 break;
5968 default:
5969 /* should not happen unless we have a badly built tree */
5970 break;
5971 }
5972 children = children->next;
5973 }
5974}
5975
5976/**
Owen Taylor3473f882001-02-23 17:55:21 +00005977 * xmlAttrDump:
5978 * @buf: the XML buffer output
5979 * @doc: the document
5980 * @cur: the attribute pointer
5981 *
5982 * Dump an XML attribute
5983 */
5984static void
5985xmlAttrDump(xmlBufferPtr buf, xmlDocPtr doc, xmlAttrPtr cur) {
Owen Taylor3473f882001-02-23 17:55:21 +00005986 if (cur == NULL) {
5987#ifdef DEBUG_TREE
5988 xmlGenericError(xmlGenericErrorContext,
5989 "xmlAttrDump : property == NULL\n");
5990#endif
5991 return;
5992 }
5993 xmlBufferWriteChar(buf, " ");
5994 if ((cur->ns != NULL) && (cur->ns->prefix != NULL)) {
5995 xmlBufferWriteCHAR(buf, cur->ns->prefix);
5996 xmlBufferWriteChar(buf, ":");
5997 }
5998 xmlBufferWriteCHAR(buf, cur->name);
Daniel Veillarda6d05382002-02-13 13:07:41 +00005999 xmlBufferWriteChar(buf, "=\"");
6000 xmlAttrSerializeContent(buf, doc, cur);
6001 xmlBufferWriteChar(buf, "\"");
Owen Taylor3473f882001-02-23 17:55:21 +00006002}
6003
6004/**
6005 * xmlAttrListDump:
6006 * @buf: the XML buffer output
6007 * @doc: the document
6008 * @cur: the first attribute pointer
6009 *
6010 * Dump a list of XML attributes
6011 */
6012static void
6013xmlAttrListDump(xmlBufferPtr buf, xmlDocPtr doc, xmlAttrPtr cur) {
6014 if (cur == NULL) {
6015#ifdef DEBUG_TREE
6016 xmlGenericError(xmlGenericErrorContext,
6017 "xmlAttrListDump : property == NULL\n");
6018#endif
6019 return;
6020 }
6021 while (cur != NULL) {
6022 xmlAttrDump(buf, doc, cur);
6023 cur = cur->next;
6024 }
6025}
6026
6027
6028
6029/**
6030 * xmlNodeListDump:
6031 * @buf: the XML buffer output
6032 * @doc: the document
6033 * @cur: the first node
6034 * @level: the imbrication level for indenting
6035 * @format: is formatting allowed
6036 *
6037 * Dump an XML node list, recursive behaviour,children are printed too.
6038 */
6039static void
6040xmlNodeListDump(xmlBufferPtr buf, xmlDocPtr doc, xmlNodePtr cur, int level,
6041 int format) {
6042 int i;
6043
6044 if (cur == NULL) {
6045#ifdef DEBUG_TREE
6046 xmlGenericError(xmlGenericErrorContext,
6047 "xmlNodeListDump : node == NULL\n");
6048#endif
6049 return;
6050 }
6051 while (cur != NULL) {
6052 if ((format) && (xmlIndentTreeOutput) &&
6053 (cur->type == XML_ELEMENT_NODE))
6054 for (i = 0;i < level;i++)
6055 xmlBufferWriteChar(buf, " ");
6056 xmlNodeDump(buf, doc, cur, level, format);
6057 if (format) {
6058 xmlBufferWriteChar(buf, "\n");
6059 }
6060 cur = cur->next;
6061 }
6062}
6063
6064/**
6065 * xmlNodeDump:
6066 * @buf: the XML buffer output
6067 * @doc: the document
6068 * @cur: the current node
6069 * @level: the imbrication level for indenting
6070 * @format: is formatting allowed
6071 *
6072 * Dump an XML node, recursive behaviour,children are printed too.
6073 */
6074void
6075xmlNodeDump(xmlBufferPtr buf, xmlDocPtr doc, xmlNodePtr cur, int level,
6076 int format) {
6077 int i;
6078 xmlNodePtr tmp;
6079
6080 if (cur == NULL) {
6081#ifdef DEBUG_TREE
6082 xmlGenericError(xmlGenericErrorContext,
6083 "xmlNodeDump : node == NULL\n");
6084#endif
6085 return;
6086 }
6087 if (cur->type == XML_XINCLUDE_START)
6088 return;
6089 if (cur->type == XML_XINCLUDE_END)
6090 return;
6091 if (cur->type == XML_DTD_NODE) {
6092 xmlDtdDump(buf, (xmlDtdPtr) cur);
6093 return;
6094 }
6095 if (cur->type == XML_ELEMENT_DECL) {
6096 xmlDumpElementDecl(buf, (xmlElementPtr) cur);
6097 return;
6098 }
Daniel Veillard78d12092001-10-11 09:12:24 +00006099 if (cur->type == XML_ATTRIBUTE_NODE){
6100 xmlAttrDump(buf, doc, (xmlAttrPtr)cur);
6101 return;
6102 }
Owen Taylor3473f882001-02-23 17:55:21 +00006103 if (cur->type == XML_ATTRIBUTE_DECL) {
6104 xmlDumpAttributeDecl(buf, (xmlAttributePtr) cur);
6105 return;
6106 }
6107 if (cur->type == XML_ENTITY_DECL) {
6108 xmlDumpEntityDecl(buf, (xmlEntityPtr) cur);
6109 return;
6110 }
6111 if (cur->type == XML_TEXT_NODE) {
6112 if (cur->content != NULL) {
6113 if ((cur->name == xmlStringText) ||
6114 (cur->name != xmlStringTextNoenc)) {
6115 xmlChar *buffer;
6116
6117#ifndef XML_USE_BUFFER_CONTENT
6118 buffer = xmlEncodeEntitiesReentrant(doc, cur->content);
6119#else
6120 buffer = xmlEncodeEntitiesReentrant(doc,
6121 xmlBufferContent(cur->content));
6122#endif
6123 if (buffer != NULL) {
6124 xmlBufferWriteCHAR(buf, buffer);
6125 xmlFree(buffer);
6126 }
6127 } else {
6128 /*
6129 * Disable escaping, needed for XSLT
6130 */
6131#ifndef XML_USE_BUFFER_CONTENT
6132 xmlBufferWriteCHAR(buf, cur->content);
6133#else
6134 xmlBufferWriteCHAR(buf, xmlBufferContent(cur->content));
6135#endif
6136 }
6137 }
6138 return;
6139 }
6140 if (cur->type == XML_PI_NODE) {
Daniel Veillard2c748c62002-01-16 15:37:50 +00006141 xmlBufferWriteChar(buf, "<?");
6142 xmlBufferWriteCHAR(buf, cur->name);
Owen Taylor3473f882001-02-23 17:55:21 +00006143 if (cur->content != NULL) {
Daniel Veillard2c748c62002-01-16 15:37:50 +00006144 xmlBufferWriteChar(buf, " ");
Owen Taylor3473f882001-02-23 17:55:21 +00006145#ifndef XML_USE_BUFFER_CONTENT
Daniel Veillard2c748c62002-01-16 15:37:50 +00006146 xmlBufferWriteCHAR(buf, cur->content);
Owen Taylor3473f882001-02-23 17:55:21 +00006147#else
Daniel Veillard2c748c62002-01-16 15:37:50 +00006148 xmlBufferWriteCHAR(buf, xmlBufferContent(cur->content));
Owen Taylor3473f882001-02-23 17:55:21 +00006149#endif
Owen Taylor3473f882001-02-23 17:55:21 +00006150 }
Daniel Veillard2c748c62002-01-16 15:37:50 +00006151 xmlBufferWriteChar(buf, "?>");
Owen Taylor3473f882001-02-23 17:55:21 +00006152 return;
6153 }
6154 if (cur->type == XML_COMMENT_NODE) {
6155 if (cur->content != NULL) {
6156 xmlBufferWriteChar(buf, "<!--");
6157#ifndef XML_USE_BUFFER_CONTENT
6158 xmlBufferWriteCHAR(buf, cur->content);
6159#else
6160 xmlBufferWriteCHAR(buf, xmlBufferContent(cur->content));
6161#endif
6162 xmlBufferWriteChar(buf, "-->");
6163 }
6164 return;
6165 }
6166 if (cur->type == XML_ENTITY_REF_NODE) {
6167 xmlBufferWriteChar(buf, "&");
6168 xmlBufferWriteCHAR(buf, cur->name);
6169 xmlBufferWriteChar(buf, ";");
6170 return;
6171 }
6172 if (cur->type == XML_CDATA_SECTION_NODE) {
6173 xmlBufferWriteChar(buf, "<![CDATA[");
6174 if (cur->content != NULL)
6175#ifndef XML_USE_BUFFER_CONTENT
6176 xmlBufferWriteCHAR(buf, cur->content);
6177#else
6178 xmlBufferWriteCHAR(buf, xmlBufferContent(cur->content));
6179#endif
6180 xmlBufferWriteChar(buf, "]]>");
6181 return;
6182 }
6183
6184 if (format == 1) {
6185 tmp = cur->children;
6186 while (tmp != NULL) {
6187 if ((tmp->type == XML_TEXT_NODE) ||
6188 (tmp->type == XML_ENTITY_REF_NODE)) {
6189 format = 0;
6190 break;
6191 }
6192 tmp = tmp->next;
6193 }
6194 }
6195 xmlBufferWriteChar(buf, "<");
6196 if ((cur->ns != NULL) && (cur->ns->prefix != NULL)) {
6197 xmlBufferWriteCHAR(buf, cur->ns->prefix);
6198 xmlBufferWriteChar(buf, ":");
6199 }
6200
6201 xmlBufferWriteCHAR(buf, cur->name);
6202 if (cur->nsDef)
6203 xmlNsListDump(buf, cur->nsDef);
6204 if (cur->properties != NULL)
6205 xmlAttrListDump(buf, doc, cur->properties);
6206
Daniel Veillard7db37732001-07-12 01:20:08 +00006207 if (((cur->type == XML_ELEMENT_NODE) || (cur->content == NULL)) &&
6208 (cur->children == NULL) &&
Owen Taylor3473f882001-02-23 17:55:21 +00006209 (!xmlSaveNoEmptyTags)) {
6210 xmlBufferWriteChar(buf, "/>");
6211 return;
6212 }
6213 xmlBufferWriteChar(buf, ">");
Daniel Veillard7db37732001-07-12 01:20:08 +00006214 if ((cur->type != XML_ELEMENT_NODE) && (cur->content != NULL)) {
Owen Taylor3473f882001-02-23 17:55:21 +00006215 xmlChar *buffer;
6216
6217#ifndef XML_USE_BUFFER_CONTENT
6218 buffer = xmlEncodeEntitiesReentrant(doc, cur->content);
6219#else
6220 buffer = xmlEncodeEntitiesReentrant(doc,
6221 xmlBufferContent(cur->content));
6222#endif
6223 if (buffer != NULL) {
6224 xmlBufferWriteCHAR(buf, buffer);
6225 xmlFree(buffer);
6226 }
6227 }
6228 if (cur->children != NULL) {
6229 if (format) xmlBufferWriteChar(buf, "\n");
6230 xmlNodeListDump(buf, doc, cur->children,
6231 (level >= 0?level+1:-1), format);
6232 if ((xmlIndentTreeOutput) && (format))
6233 for (i = 0;i < level;i++)
6234 xmlBufferWriteChar(buf, " ");
6235 }
6236 xmlBufferWriteChar(buf, "</");
6237 if ((cur->ns != NULL) && (cur->ns->prefix != NULL)) {
6238 xmlBufferWriteCHAR(buf, cur->ns->prefix);
6239 xmlBufferWriteChar(buf, ":");
6240 }
6241
6242 xmlBufferWriteCHAR(buf, cur->name);
6243 xmlBufferWriteChar(buf, ">");
6244}
6245
6246/**
6247 * xmlElemDump:
6248 * @f: the FILE * for the output
6249 * @doc: the document
6250 * @cur: the current node
6251 *
Daniel Veillardd1640922001-12-17 15:30:10 +00006252 * Dump an XML/HTML node, recursive behaviour, children are printed too.
Owen Taylor3473f882001-02-23 17:55:21 +00006253 */
6254void
6255xmlElemDump(FILE *f, xmlDocPtr doc, xmlNodePtr cur) {
6256 xmlBufferPtr buf;
6257
6258 if (cur == NULL) {
6259#ifdef DEBUG_TREE
6260 xmlGenericError(xmlGenericErrorContext,
6261 "xmlElemDump : cur == NULL\n");
6262#endif
6263 return;
6264 }
Owen Taylor3473f882001-02-23 17:55:21 +00006265#ifdef DEBUG_TREE
Daniel Veillardd79bcd12001-06-21 22:07:42 +00006266 if (doc == NULL) {
Owen Taylor3473f882001-02-23 17:55:21 +00006267 xmlGenericError(xmlGenericErrorContext,
6268 "xmlElemDump : doc == NULL\n");
Owen Taylor3473f882001-02-23 17:55:21 +00006269 }
Daniel Veillardd79bcd12001-06-21 22:07:42 +00006270#endif
Daniel Veillard78d12092001-10-11 09:12:24 +00006271
Owen Taylor3473f882001-02-23 17:55:21 +00006272 buf = xmlBufferCreate();
6273 if (buf == NULL) return;
6274 if ((doc != NULL) &&
6275 (doc->type == XML_HTML_DOCUMENT_NODE)) {
6276#ifdef LIBXML_HTML_ENABLED
6277 htmlNodeDump(buf, doc, cur);
6278#else
6279 xmlGenericError(xmlGenericErrorContext,
6280 "HTML support not compiled in\n");
6281#endif /* LIBXML_HTML_ENABLED */
6282 } else
6283 xmlNodeDump(buf, doc, cur, 0, 1);
6284 xmlBufferDump(f, buf);
6285 xmlBufferFree(buf);
6286}
6287
6288/************************************************************************
6289 * *
6290 * Dumping XML tree content to an I/O output buffer *
6291 * *
6292 ************************************************************************/
6293
Owen Taylor3473f882001-02-23 17:55:21 +00006294static void
6295xmlNodeListDumpOutput(xmlOutputBufferPtr buf, xmlDocPtr doc, xmlNodePtr cur,
6296 int level, int format, const char *encoding);
6297/**
6298 * xmlNsDumpOutput:
6299 * @buf: the XML buffer output
6300 * @cur: a namespace
6301 *
6302 * Dump a local Namespace definition.
6303 * Should be called in the context of attributes dumps.
6304 */
6305static void
6306xmlNsDumpOutput(xmlOutputBufferPtr buf, xmlNsPtr cur) {
6307 if (cur == NULL) {
6308#ifdef DEBUG_TREE
6309 xmlGenericError(xmlGenericErrorContext,
Daniel Veillardd1640922001-12-17 15:30:10 +00006310 "xmlNsDumpOutput : Ns == NULL\n");
Owen Taylor3473f882001-02-23 17:55:21 +00006311#endif
6312 return;
6313 }
6314 if ((cur->type == XML_LOCAL_NAMESPACE) && (cur->href != NULL)) {
6315 /* Within the context of an element attributes */
6316 if (cur->prefix != NULL) {
6317 xmlOutputBufferWriteString(buf, " xmlns:");
6318 xmlOutputBufferWriteString(buf, (const char *)cur->prefix);
6319 } else
6320 xmlOutputBufferWriteString(buf, " xmlns");
6321 xmlOutputBufferWriteString(buf, "=");
6322 xmlBufferWriteQuotedString(buf->buffer, cur->href);
6323 }
6324}
6325
6326/**
6327 * xmlNsListDumpOutput:
6328 * @buf: the XML buffer output
6329 * @cur: the first namespace
6330 *
6331 * Dump a list of local Namespace definitions.
6332 * Should be called in the context of attributes dumps.
6333 */
6334static void
6335xmlNsListDumpOutput(xmlOutputBufferPtr buf, xmlNsPtr cur) {
6336 while (cur != NULL) {
6337 xmlNsDumpOutput(buf, cur);
6338 cur = cur->next;
6339 }
6340}
6341
6342/**
6343 * xmlDtdDumpOutput:
6344 * @buf: the XML buffer output
6345 * @doc: the document
6346 * @encoding: an optional encoding string
6347 *
6348 * Dump the XML document DTD, if any.
6349 */
6350static void
6351xmlDtdDumpOutput(xmlOutputBufferPtr buf, xmlDtdPtr dtd, const char *encoding) {
6352 if (dtd == NULL) {
6353#ifdef DEBUG_TREE
6354 xmlGenericError(xmlGenericErrorContext,
Daniel Veillardd1640922001-12-17 15:30:10 +00006355 "xmlDtdDumpOutput : no internal subset\n");
Owen Taylor3473f882001-02-23 17:55:21 +00006356#endif
6357 return;
6358 }
6359 xmlOutputBufferWriteString(buf, "<!DOCTYPE ");
6360 xmlOutputBufferWriteString(buf, (const char *)dtd->name);
6361 if (dtd->ExternalID != NULL) {
6362 xmlOutputBufferWriteString(buf, " PUBLIC ");
6363 xmlBufferWriteQuotedString(buf->buffer, dtd->ExternalID);
6364 xmlOutputBufferWriteString(buf, " ");
6365 xmlBufferWriteQuotedString(buf->buffer, dtd->SystemID);
6366 } else if (dtd->SystemID != NULL) {
6367 xmlOutputBufferWriteString(buf, " SYSTEM ");
6368 xmlBufferWriteQuotedString(buf->buffer, dtd->SystemID);
6369 }
6370 if ((dtd->entities == NULL) && (dtd->elements == NULL) &&
6371 (dtd->attributes == NULL) && (dtd->notations == NULL)) {
6372 xmlOutputBufferWriteString(buf, ">");
6373 return;
6374 }
6375 xmlOutputBufferWriteString(buf, " [\n");
6376 xmlNodeListDumpOutput(buf, dtd->doc, dtd->children, -1, 0, encoding);
6377 xmlOutputBufferWriteString(buf, "]>");
6378}
6379
6380/**
6381 * xmlAttrDumpOutput:
6382 * @buf: the XML buffer output
6383 * @doc: the document
6384 * @cur: the attribute pointer
6385 * @encoding: an optional encoding string
6386 *
6387 * Dump an XML attribute
6388 */
6389static void
6390xmlAttrDumpOutput(xmlOutputBufferPtr buf, xmlDocPtr doc, xmlAttrPtr cur,
Daniel Veillardc86a4fa2001-03-26 16:28:29 +00006391 const char *encoding ATTRIBUTE_UNUSED) {
Owen Taylor3473f882001-02-23 17:55:21 +00006392 if (cur == NULL) {
6393#ifdef DEBUG_TREE
6394 xmlGenericError(xmlGenericErrorContext,
Daniel Veillardd1640922001-12-17 15:30:10 +00006395 "xmlAttrDumpOutput : property == NULL\n");
Owen Taylor3473f882001-02-23 17:55:21 +00006396#endif
6397 return;
6398 }
6399 xmlOutputBufferWriteString(buf, " ");
6400 if ((cur->ns != NULL) && (cur->ns->prefix != NULL)) {
6401 xmlOutputBufferWriteString(buf, (const char *)cur->ns->prefix);
6402 xmlOutputBufferWriteString(buf, ":");
6403 }
6404 xmlOutputBufferWriteString(buf, (const char *)cur->name);
Daniel Veillarda6d05382002-02-13 13:07:41 +00006405 xmlOutputBufferWriteString(buf, "=\"");
6406 xmlAttrSerializeContent(buf->buffer, doc, cur);
6407 xmlOutputBufferWriteString(buf, "\"");
Owen Taylor3473f882001-02-23 17:55:21 +00006408}
6409
6410/**
6411 * xmlAttrListDumpOutput:
6412 * @buf: the XML buffer output
6413 * @doc: the document
6414 * @cur: the first attribute pointer
6415 * @encoding: an optional encoding string
6416 *
6417 * Dump a list of XML attributes
6418 */
6419static void
6420xmlAttrListDumpOutput(xmlOutputBufferPtr buf, xmlDocPtr doc,
6421 xmlAttrPtr cur, const char *encoding) {
6422 if (cur == NULL) {
6423#ifdef DEBUG_TREE
6424 xmlGenericError(xmlGenericErrorContext,
Daniel Veillardd1640922001-12-17 15:30:10 +00006425 "xmlAttrListDumpOutput : property == NULL\n");
Owen Taylor3473f882001-02-23 17:55:21 +00006426#endif
6427 return;
6428 }
6429 while (cur != NULL) {
6430 xmlAttrDumpOutput(buf, doc, cur, encoding);
6431 cur = cur->next;
6432 }
6433}
6434
6435
6436
6437/**
6438 * xmlNodeListDumpOutput:
6439 * @buf: the XML buffer output
6440 * @doc: the document
6441 * @cur: the first node
6442 * @level: the imbrication level for indenting
6443 * @format: is formatting allowed
6444 * @encoding: an optional encoding string
6445 *
Daniel Veillardd1640922001-12-17 15:30:10 +00006446 * Dump an XML node list, recursive behaviour, children are printed too.
Owen Taylor3473f882001-02-23 17:55:21 +00006447 */
6448static void
6449xmlNodeListDumpOutput(xmlOutputBufferPtr buf, xmlDocPtr doc,
6450 xmlNodePtr cur, int level, int format, const char *encoding) {
6451 int i;
6452
6453 if (cur == NULL) {
6454#ifdef DEBUG_TREE
6455 xmlGenericError(xmlGenericErrorContext,
Daniel Veillardd1640922001-12-17 15:30:10 +00006456 "xmlNodeListDumpOutput : node == NULL\n");
Owen Taylor3473f882001-02-23 17:55:21 +00006457#endif
6458 return;
6459 }
6460 while (cur != NULL) {
6461 if ((format) && (xmlIndentTreeOutput) &&
6462 (cur->type == XML_ELEMENT_NODE))
6463 for (i = 0;i < level;i++)
6464 xmlOutputBufferWriteString(buf, " ");
6465 xmlNodeDumpOutput(buf, doc, cur, level, format, encoding);
6466 if (format) {
6467 xmlOutputBufferWriteString(buf, "\n");
6468 }
6469 cur = cur->next;
6470 }
6471}
6472
6473/**
6474 * xmlNodeDumpOutput:
6475 * @buf: the XML buffer output
6476 * @doc: the document
6477 * @cur: the current node
6478 * @level: the imbrication level for indenting
6479 * @format: is formatting allowed
6480 * @encoding: an optional encoding string
6481 *
Daniel Veillardd1640922001-12-17 15:30:10 +00006482 * Dump an XML node, recursive behaviour, children are printed too.
Owen Taylor3473f882001-02-23 17:55:21 +00006483 */
6484void
6485xmlNodeDumpOutput(xmlOutputBufferPtr buf, xmlDocPtr doc, xmlNodePtr cur,
6486 int level, int format, const char *encoding) {
6487 int i;
6488 xmlNodePtr tmp;
6489
6490 if (cur == NULL) {
6491#ifdef DEBUG_TREE
6492 xmlGenericError(xmlGenericErrorContext,
Daniel Veillardd1640922001-12-17 15:30:10 +00006493 "xmlNodeDumpOutput : node == NULL\n");
Owen Taylor3473f882001-02-23 17:55:21 +00006494#endif
6495 return;
6496 }
6497 if (cur->type == XML_XINCLUDE_START)
6498 return;
6499 if (cur->type == XML_XINCLUDE_END)
6500 return;
6501 if (cur->type == XML_DTD_NODE) {
6502 xmlDtdDumpOutput(buf, (xmlDtdPtr) cur, encoding);
6503 return;
6504 }
6505 if (cur->type == XML_ELEMENT_DECL) {
6506 xmlDumpElementDecl(buf->buffer, (xmlElementPtr) cur);
6507 return;
6508 }
6509 if (cur->type == XML_ATTRIBUTE_DECL) {
6510 xmlDumpAttributeDecl(buf->buffer, (xmlAttributePtr) cur);
6511 return;
6512 }
6513 if (cur->type == XML_ENTITY_DECL) {
6514 xmlDumpEntityDecl(buf->buffer, (xmlEntityPtr) cur);
6515 return;
6516 }
6517 if (cur->type == XML_TEXT_NODE) {
6518 if (cur->content != NULL) {
6519 if ((cur->name == xmlStringText) ||
6520 (cur->name != xmlStringTextNoenc)) {
6521 xmlChar *buffer;
6522
6523#ifndef XML_USE_BUFFER_CONTENT
6524 if (encoding == NULL)
6525 buffer = xmlEncodeEntitiesReentrant(doc, cur->content);
6526 else
6527 buffer = xmlEncodeSpecialChars(doc, cur->content);
6528#else
6529 if (encoding == NULL)
6530 buffer = xmlEncodeEntitiesReentrant(doc,
6531 xmlBufferContent(cur->content));
6532 else
6533 buffer = xmlEncodeSpecialChars(doc,
6534 xmlBufferContent(cur->content));
6535#endif
6536 if (buffer != NULL) {
6537 xmlOutputBufferWriteString(buf, (const char *)buffer);
6538 xmlFree(buffer);
6539 }
6540 } else {
6541 /*
6542 * Disable escaping, needed for XSLT
6543 */
6544#ifndef XML_USE_BUFFER_CONTENT
6545 xmlOutputBufferWriteString(buf, (const char *) cur->content);
6546#else
6547 xmlOutputBufferWriteString(buf, xmlBufferContent(cur->content));
6548#endif
6549 }
6550 }
6551
6552 return;
6553 }
6554 if (cur->type == XML_PI_NODE) {
6555 if (cur->content != NULL) {
6556 xmlOutputBufferWriteString(buf, "<?");
6557 xmlOutputBufferWriteString(buf, (const char *)cur->name);
6558 if (cur->content != NULL) {
6559 xmlOutputBufferWriteString(buf, " ");
6560#ifndef XML_USE_BUFFER_CONTENT
6561 xmlOutputBufferWriteString(buf, (const char *)cur->content);
6562#else
6563 xmlOutputBufferWriteString(buf, (const char *)xmlBufferContent(cur->content));
6564#endif
6565 }
6566 xmlOutputBufferWriteString(buf, "?>");
6567 } else {
6568 xmlOutputBufferWriteString(buf, "<?");
6569 xmlOutputBufferWriteString(buf, (const char *)cur->name);
6570 xmlOutputBufferWriteString(buf, "?>");
6571 }
6572 return;
6573 }
6574 if (cur->type == XML_COMMENT_NODE) {
6575 if (cur->content != NULL) {
6576 xmlOutputBufferWriteString(buf, "<!--");
6577#ifndef XML_USE_BUFFER_CONTENT
6578 xmlOutputBufferWriteString(buf, (const char *)cur->content);
6579#else
6580 xmlOutputBufferWriteString(buf, (const char *)xmlBufferContent(cur->content));
6581#endif
6582 xmlOutputBufferWriteString(buf, "-->");
6583 }
6584 return;
6585 }
6586 if (cur->type == XML_ENTITY_REF_NODE) {
6587 xmlOutputBufferWriteString(buf, "&");
6588 xmlOutputBufferWriteString(buf, (const char *)cur->name);
6589 xmlOutputBufferWriteString(buf, ";");
6590 return;
6591 }
6592 if (cur->type == XML_CDATA_SECTION_NODE) {
6593 xmlOutputBufferWriteString(buf, "<![CDATA[");
6594 if (cur->content != NULL)
6595#ifndef XML_USE_BUFFER_CONTENT
6596 xmlOutputBufferWriteString(buf, (const char *)cur->content);
6597#else
6598 xmlOutputBufferWriteString(buf, (const char *)xmlBufferContent(cur->content));
6599#endif
6600 xmlOutputBufferWriteString(buf, "]]>");
6601 return;
6602 }
6603
6604 if (format == 1) {
6605 tmp = cur->children;
6606 while (tmp != NULL) {
6607 if ((tmp->type == XML_TEXT_NODE) ||
6608 (tmp->type == XML_ENTITY_REF_NODE)) {
6609 format = 0;
6610 break;
6611 }
6612 tmp = tmp->next;
6613 }
6614 }
6615 xmlOutputBufferWriteString(buf, "<");
6616 if ((cur->ns != NULL) && (cur->ns->prefix != NULL)) {
6617 xmlOutputBufferWriteString(buf, (const char *)cur->ns->prefix);
6618 xmlOutputBufferWriteString(buf, ":");
6619 }
6620
6621 xmlOutputBufferWriteString(buf, (const char *)cur->name);
6622 if (cur->nsDef)
6623 xmlNsListDumpOutput(buf, cur->nsDef);
6624 if (cur->properties != NULL)
6625 xmlAttrListDumpOutput(buf, doc, cur->properties, encoding);
6626
Daniel Veillard7db37732001-07-12 01:20:08 +00006627 if (((cur->type == XML_ELEMENT_NODE) || (cur->content == NULL)) &&
6628 (cur->children == NULL) && (!xmlSaveNoEmptyTags)) {
Owen Taylor3473f882001-02-23 17:55:21 +00006629 xmlOutputBufferWriteString(buf, "/>");
6630 return;
6631 }
6632 xmlOutputBufferWriteString(buf, ">");
Daniel Veillard7db37732001-07-12 01:20:08 +00006633 if ((cur->type != XML_ELEMENT_NODE) && (cur->content != NULL)) {
Owen Taylor3473f882001-02-23 17:55:21 +00006634 xmlChar *buffer;
6635
6636#ifndef XML_USE_BUFFER_CONTENT
6637 if (encoding == NULL)
6638 buffer = xmlEncodeEntitiesReentrant(doc, cur->content);
6639 else
6640 buffer = xmlEncodeSpecialChars(doc, cur->content);
6641#else
6642 if (encoding == NULL)
6643 buffer = xmlEncodeEntitiesReentrant(doc,
6644 xmlBufferContent(cur->content));
6645 else
6646 buffer = xmlEncodeSpecialChars(doc,
6647 xmlBufferContent(cur->content));
6648#endif
6649 if (buffer != NULL) {
6650 xmlOutputBufferWriteString(buf, (const char *)buffer);
6651 xmlFree(buffer);
6652 }
6653 }
6654 if (cur->children != NULL) {
6655 if (format) xmlOutputBufferWriteString(buf, "\n");
6656 xmlNodeListDumpOutput(buf, doc, cur->children,
6657 (level >= 0?level+1:-1), format, encoding);
6658 if ((xmlIndentTreeOutput) && (format))
6659 for (i = 0;i < level;i++)
6660 xmlOutputBufferWriteString(buf, " ");
6661 }
6662 xmlOutputBufferWriteString(buf, "</");
6663 if ((cur->ns != NULL) && (cur->ns->prefix != NULL)) {
6664 xmlOutputBufferWriteString(buf, (const char *)cur->ns->prefix);
6665 xmlOutputBufferWriteString(buf, ":");
6666 }
6667
6668 xmlOutputBufferWriteString(buf, (const char *)cur->name);
6669 xmlOutputBufferWriteString(buf, ">");
6670}
6671
6672/**
6673 * xmlDocContentDumpOutput:
6674 * @buf: the XML buffer output
6675 * @cur: the document
6676 * @encoding: an optional encoding string
6677 * @format: should formatting spaces been added
6678 *
6679 * Dump an XML document.
6680 */
6681static void
6682xmlDocContentDumpOutput(xmlOutputBufferPtr buf, xmlDocPtr cur,
6683 const char *encoding, int format) {
6684 xmlOutputBufferWriteString(buf, "<?xml version=");
6685 if (cur->version != NULL)
6686 xmlBufferWriteQuotedString(buf->buffer, cur->version);
6687 else
6688 xmlOutputBufferWriteString(buf, "\"1.0\"");
6689 if (encoding == NULL) {
6690 if (cur->encoding != NULL)
6691 encoding = (const char *) cur->encoding;
6692 else if (cur->charset != XML_CHAR_ENCODING_UTF8)
6693 encoding = xmlGetCharEncodingName((xmlCharEncoding) cur->charset);
6694 }
6695 if (encoding != NULL) {
6696 xmlOutputBufferWriteString(buf, " encoding=");
6697 xmlBufferWriteQuotedString(buf->buffer, (xmlChar *) encoding);
6698 }
6699 switch (cur->standalone) {
6700 case 0:
6701 xmlOutputBufferWriteString(buf, " standalone=\"no\"");
6702 break;
6703 case 1:
6704 xmlOutputBufferWriteString(buf, " standalone=\"yes\"");
6705 break;
6706 }
6707 xmlOutputBufferWriteString(buf, "?>\n");
6708 if (cur->children != NULL) {
6709 xmlNodePtr child = cur->children;
6710
6711 while (child != NULL) {
6712 xmlNodeDumpOutput(buf, cur, child, 0, format, encoding);
6713 xmlOutputBufferWriteString(buf, "\n");
6714 child = child->next;
6715 }
6716 }
6717}
6718
6719/************************************************************************
6720 * *
6721 * Saving functions front-ends *
6722 * *
6723 ************************************************************************/
6724
6725/**
Daniel Veillard5e2dace2001-07-18 19:30:27 +00006726 * xmlDocDumpFormatMemoryEnc:
Owen Taylor3473f882001-02-23 17:55:21 +00006727 * @out_doc: Document to generate XML text from
6728 * @doc_txt_ptr: Memory pointer for allocated XML text
6729 * @doc_txt_len: Length of the generated XML text
6730 * @txt_encoding: Character encoding to use when generating XML text
6731 * @format: should formatting spaces been added
6732 *
6733 * Dump the current DOM tree into memory using the character encoding specified
6734 * by the caller. Note it is up to the caller of this function to free the
6735 * allocated memory.
6736 */
6737
6738void
6739xmlDocDumpFormatMemoryEnc(xmlDocPtr out_doc, xmlChar **doc_txt_ptr,
Daniel Veillard56a4cb82001-03-24 17:00:36 +00006740 int * doc_txt_len, const char * txt_encoding,
Daniel Veillard1731d6a2001-04-10 16:38:06 +00006741 int format) {
Owen Taylor3473f882001-02-23 17:55:21 +00006742 int dummy = 0;
6743
6744 xmlCharEncoding doc_charset;
6745 xmlOutputBufferPtr out_buff = NULL;
6746 xmlCharEncodingHandlerPtr conv_hdlr = NULL;
6747
6748 if (doc_txt_len == NULL) {
6749 doc_txt_len = &dummy; /* Continue, caller just won't get length */
6750 }
6751
6752 if (doc_txt_ptr == NULL) {
6753 *doc_txt_len = 0;
6754 xmlGenericError(xmlGenericErrorContext,
6755 "xmlDocDumpFormatMemoryEnc: Null return buffer pointer.");
6756 return;
6757 }
6758
6759 *doc_txt_ptr = NULL;
6760 *doc_txt_len = 0;
6761
6762 if (out_doc == NULL) {
6763 /* No document, no output */
6764 xmlGenericError(xmlGenericErrorContext,
6765 "xmlDocDumpFormatMemoryEnc: Null DOM tree document pointer.\n");
6766 return;
6767 }
6768
6769 /*
6770 * Validate the encoding value, if provided.
6771 * This logic is copied from xmlSaveFileEnc.
6772 */
6773
6774 if (txt_encoding == NULL)
6775 txt_encoding = (const char *) out_doc->encoding;
6776 if (txt_encoding != NULL) {
6777 doc_charset = xmlParseCharEncoding(txt_encoding);
6778
6779 if (out_doc->charset != XML_CHAR_ENCODING_UTF8) {
6780 xmlGenericError(xmlGenericErrorContext,
6781 "xmlDocDumpFormatMemoryEnc: Source document not in UTF8\n");
6782 return;
6783
6784 } else if (doc_charset != XML_CHAR_ENCODING_UTF8) {
6785 conv_hdlr = xmlFindCharEncodingHandler(txt_encoding);
6786 if ( conv_hdlr == NULL ) {
6787 xmlGenericError(xmlGenericErrorContext,
6788 "%s: %s %s '%s'\n",
6789 "xmlDocDumpFormatMemoryEnc",
6790 "Failed to identify encoding handler for",
6791 "character set",
6792 txt_encoding);
6793 return;
6794 }
6795 }
6796 }
6797
6798 if ((out_buff = xmlAllocOutputBuffer(conv_hdlr)) == NULL ) {
6799 xmlGenericError(xmlGenericErrorContext,
6800 "xmlDocDumpFormatMemoryEnc: Failed to allocate output buffer.\n");
6801 return;
6802 }
6803
Daniel Veillard1731d6a2001-04-10 16:38:06 +00006804 xmlDocContentDumpOutput(out_buff, out_doc, txt_encoding, format);
Owen Taylor3473f882001-02-23 17:55:21 +00006805 xmlOutputBufferFlush(out_buff);
6806 if (out_buff->conv != NULL) {
6807 *doc_txt_len = out_buff->conv->use;
6808 *doc_txt_ptr = xmlStrndup(out_buff->conv->content, *doc_txt_len);
6809 } else {
6810 *doc_txt_len = out_buff->buffer->use;
6811 *doc_txt_ptr = xmlStrndup(out_buff->buffer->content, *doc_txt_len);
6812 }
6813 (void)xmlOutputBufferClose(out_buff);
6814
6815 if ((*doc_txt_ptr == NULL) && (*doc_txt_len > 0)) {
6816 *doc_txt_len = 0;
6817 xmlGenericError(xmlGenericErrorContext,
6818 "xmlDocDumpFormatMemoryEnc: %s\n",
6819 "Failed to allocate memory for document text representation.");
6820 }
6821
6822 return;
6823}
6824
6825/**
6826 * xmlDocDumpMemory:
6827 * @cur: the document
6828 * @mem: OUT: the memory pointer
Daniel Veillard60087f32001-10-10 09:45:09 +00006829 * @size: OUT: the memory length
Owen Taylor3473f882001-02-23 17:55:21 +00006830 *
Daniel Veillardd1640922001-12-17 15:30:10 +00006831 * Dump an XML document in memory and return the #xmlChar * and it's size.
Owen Taylor3473f882001-02-23 17:55:21 +00006832 * It's up to the caller to free the memory.
6833 */
6834void
6835xmlDocDumpMemory(xmlDocPtr cur, xmlChar**mem, int *size) {
6836 xmlDocDumpFormatMemoryEnc(cur, mem, size, NULL, 0);
6837}
6838
6839/**
6840 * xmlDocDumpFormatMemory:
6841 * @cur: the document
6842 * @mem: OUT: the memory pointer
Daniel Veillard60087f32001-10-10 09:45:09 +00006843 * @size: OUT: the memory length
Owen Taylor3473f882001-02-23 17:55:21 +00006844 * @format: should formatting spaces been added
6845 *
6846 *
Daniel Veillardd1640922001-12-17 15:30:10 +00006847 * Dump an XML document in memory and return the #xmlChar * and it's size.
Owen Taylor3473f882001-02-23 17:55:21 +00006848 * It's up to the caller to free the memory.
6849 */
6850void
6851xmlDocDumpFormatMemory(xmlDocPtr cur, xmlChar**mem, int *size, int format) {
6852 xmlDocDumpFormatMemoryEnc(cur, mem, size, NULL, format);
6853}
6854
6855/**
6856 * xmlDocDumpMemoryEnc:
6857 * @out_doc: Document to generate XML text from
6858 * @doc_txt_ptr: Memory pointer for allocated XML text
6859 * @doc_txt_len: Length of the generated XML text
6860 * @txt_encoding: Character encoding to use when generating XML text
6861 *
6862 * Dump the current DOM tree into memory using the character encoding specified
6863 * by the caller. Note it is up to the caller of this function to free the
6864 * allocated memory.
6865 */
6866
6867void
6868xmlDocDumpMemoryEnc(xmlDocPtr out_doc, xmlChar **doc_txt_ptr,
6869 int * doc_txt_len, const char * txt_encoding) {
6870 xmlDocDumpFormatMemoryEnc(out_doc, doc_txt_ptr, doc_txt_len,
Daniel Veillard1731d6a2001-04-10 16:38:06 +00006871 txt_encoding, 0);
Owen Taylor3473f882001-02-23 17:55:21 +00006872}
6873
6874/**
6875 * xmlGetDocCompressMode:
6876 * @doc: the document
6877 *
6878 * get the compression ratio for a document, ZLIB based
6879 * Returns 0 (uncompressed) to 9 (max compression)
6880 */
6881int
6882xmlGetDocCompressMode (xmlDocPtr doc) {
6883 if (doc == NULL) return(-1);
6884 return(doc->compression);
6885}
6886
6887/**
6888 * xmlSetDocCompressMode:
6889 * @doc: the document
6890 * @mode: the compression ratio
6891 *
6892 * set the compression ratio for a document, ZLIB based
6893 * Correct values: 0 (uncompressed) to 9 (max compression)
6894 */
6895void
6896xmlSetDocCompressMode (xmlDocPtr doc, int mode) {
6897 if (doc == NULL) return;
6898 if (mode < 0) doc->compression = 0;
6899 else if (mode > 9) doc->compression = 9;
6900 else doc->compression = mode;
6901}
6902
6903/**
6904 * xmlGetCompressMode:
6905 *
6906 * get the default compression mode used, ZLIB based.
6907 * Returns 0 (uncompressed) to 9 (max compression)
6908 */
6909int
Daniel Veillard044fc6b2002-03-04 17:09:44 +00006910xmlGetCompressMode(void)
6911{
6912 return (xmlCompressMode);
Owen Taylor3473f882001-02-23 17:55:21 +00006913}
6914
6915/**
6916 * xmlSetCompressMode:
6917 * @mode: the compression ratio
6918 *
6919 * set the default compression mode used, ZLIB based
6920 * Correct values: 0 (uncompressed) to 9 (max compression)
6921 */
6922void
6923xmlSetCompressMode(int mode) {
6924 if (mode < 0) xmlCompressMode = 0;
6925 else if (mode > 9) xmlCompressMode = 9;
6926 else xmlCompressMode = mode;
6927}
6928
6929/**
6930 * xmlDocDump:
6931 * @f: the FILE*
6932 * @cur: the document
6933 *
6934 * Dump an XML document to an open FILE.
6935 *
Daniel Veillardd1640922001-12-17 15:30:10 +00006936 * returns: the number of bytes written or -1 in case of failure.
Owen Taylor3473f882001-02-23 17:55:21 +00006937 */
6938int
6939xmlDocDump(FILE *f, xmlDocPtr cur) {
6940 xmlOutputBufferPtr buf;
6941 const char * encoding;
6942 xmlCharEncodingHandlerPtr handler = NULL;
6943 int ret;
6944
6945 if (cur == NULL) {
6946#ifdef DEBUG_TREE
6947 xmlGenericError(xmlGenericErrorContext,
6948 "xmlDocDump : document == NULL\n");
6949#endif
6950 return(-1);
6951 }
6952 encoding = (const char *) cur->encoding;
6953
6954 if (encoding != NULL) {
6955 xmlCharEncoding enc;
6956
6957 enc = xmlParseCharEncoding(encoding);
6958
6959 if (cur->charset != XML_CHAR_ENCODING_UTF8) {
6960 xmlGenericError(xmlGenericErrorContext,
6961 "xmlDocDump: document not in UTF8\n");
6962 return(-1);
6963 }
6964 if (enc != XML_CHAR_ENCODING_UTF8) {
6965 handler = xmlFindCharEncodingHandler(encoding);
6966 if (handler == NULL) {
6967 xmlFree((char *) cur->encoding);
6968 cur->encoding = NULL;
6969 }
6970 }
6971 }
6972 buf = xmlOutputBufferCreateFile(f, handler);
6973 if (buf == NULL) return(-1);
Daniel Veillard1731d6a2001-04-10 16:38:06 +00006974 xmlDocContentDumpOutput(buf, cur, NULL, 0);
Owen Taylor3473f882001-02-23 17:55:21 +00006975
6976 ret = xmlOutputBufferClose(buf);
6977 return(ret);
6978}
6979
6980/**
6981 * xmlSaveFileTo:
6982 * @buf: an output I/O buffer
6983 * @cur: the document
Daniel Veillardd1640922001-12-17 15:30:10 +00006984 * @encoding: the encoding if any assuming the I/O layer handles the trancoding
Owen Taylor3473f882001-02-23 17:55:21 +00006985 *
6986 * Dump an XML document to an I/O buffer.
6987 *
Daniel Veillardd1640922001-12-17 15:30:10 +00006988 * returns: the number of bytes written or -1 in case of failure.
Owen Taylor3473f882001-02-23 17:55:21 +00006989 */
6990int
CET 2001 Daniel Veillard5a37bde2001-11-01 14:31:22 +00006991xmlSaveFileTo(xmlOutputBufferPtr buf, xmlDocPtr cur, const char *encoding) {
Owen Taylor3473f882001-02-23 17:55:21 +00006992 int ret;
6993
6994 if (buf == NULL) return(0);
Daniel Veillard1731d6a2001-04-10 16:38:06 +00006995 xmlDocContentDumpOutput(buf, cur, encoding, 0);
Owen Taylor3473f882001-02-23 17:55:21 +00006996 ret = xmlOutputBufferClose(buf);
6997 return(ret);
6998}
6999
7000/**
Daniel Veillardeefd4492001-04-28 16:55:50 +00007001 * xmlSaveFormatFileTo:
7002 * @buf: an output I/O buffer
7003 * @cur: the document
Daniel Veillardd1640922001-12-17 15:30:10 +00007004 * @encoding: the encoding if any assuming the I/O layer handles the trancoding
Daniel Veillardeefd4492001-04-28 16:55:50 +00007005 * @format: should formatting spaces been added
7006 *
7007 * Dump an XML document to an I/O buffer.
7008 *
Daniel Veillardd1640922001-12-17 15:30:10 +00007009 * returns: the number of bytes written or -1 in case of failure.
Daniel Veillardeefd4492001-04-28 16:55:50 +00007010 */
7011int
CET 2001 Daniel Veillard5a37bde2001-11-01 14:31:22 +00007012xmlSaveFormatFileTo(xmlOutputBufferPtr buf, xmlDocPtr cur, const char *encoding, int format) {
Daniel Veillardeefd4492001-04-28 16:55:50 +00007013 int ret;
7014
7015 if (buf == NULL) return(0);
7016 xmlDocContentDumpOutput(buf, cur, encoding, format);
7017 ret = xmlOutputBufferClose(buf);
7018 return(ret);
7019}
7020
7021/**
Daniel Veillardf012a642001-07-23 19:10:52 +00007022 * xmlSaveFormatFileEnc
7023 * @filename: the filename or URL to output
7024 * @cur: the document being saved
7025 * @encoding: the name of the encoding to use or NULL.
7026 * @format: should formatting spaces be added.
Daniel Veillardd1640922001-12-17 15:30:10 +00007027 *
7028 * Returns the number of bytes written or -1 in case of error.
Owen Taylor3473f882001-02-23 17:55:21 +00007029 */
7030int
Daniel Veillardf012a642001-07-23 19:10:52 +00007031xmlSaveFormatFileEnc( const char * filename, xmlDocPtr cur,
7032 const char * encoding, int format ) {
Owen Taylor3473f882001-02-23 17:55:21 +00007033 xmlOutputBufferPtr buf;
7034 xmlCharEncodingHandlerPtr handler = NULL;
Daniel Veillard81418e32001-05-22 15:08:55 +00007035 xmlCharEncoding enc;
Owen Taylor3473f882001-02-23 17:55:21 +00007036 int ret;
7037
Daniel Veillardfb25a512002-01-13 20:32:08 +00007038 if (encoding == NULL)
7039 encoding = (const char *) cur->encoding;
7040
Owen Taylor3473f882001-02-23 17:55:21 +00007041 if (encoding != NULL) {
Owen Taylor3473f882001-02-23 17:55:21 +00007042
7043 enc = xmlParseCharEncoding(encoding);
7044 if (cur->charset != XML_CHAR_ENCODING_UTF8) {
7045 xmlGenericError(xmlGenericErrorContext,
Daniel Veillardd1640922001-12-17 15:30:10 +00007046 "xmlSaveFormatFileEnc: document not in UTF8\n");
Owen Taylor3473f882001-02-23 17:55:21 +00007047 return(-1);
7048 }
7049 if (enc != XML_CHAR_ENCODING_UTF8) {
7050 handler = xmlFindCharEncodingHandler(encoding);
Daniel Veillard81418e32001-05-22 15:08:55 +00007051 if (handler == NULL)
Owen Taylor3473f882001-02-23 17:55:21 +00007052 return(-1);
Owen Taylor3473f882001-02-23 17:55:21 +00007053 }
7054 }
7055
Daniel Veillardf012a642001-07-23 19:10:52 +00007056#ifdef HAVE_ZLIB_H
7057 if (cur->compression < 0) cur->compression = xmlCompressMode;
7058#endif
Owen Taylor3473f882001-02-23 17:55:21 +00007059 /*
7060 * save the content to a temp buffer.
7061 */
Daniel Veillardf012a642001-07-23 19:10:52 +00007062 buf = xmlOutputBufferCreateFilename(filename, handler, cur->compression);
Owen Taylor3473f882001-02-23 17:55:21 +00007063 if (buf == NULL) return(-1);
7064
Daniel Veillardf012a642001-07-23 19:10:52 +00007065 xmlDocContentDumpOutput(buf, cur, encoding, format);
Owen Taylor3473f882001-02-23 17:55:21 +00007066
7067 ret = xmlOutputBufferClose(buf);
7068 return(ret);
7069}
7070
Daniel Veillardf012a642001-07-23 19:10:52 +00007071
7072/**
7073 * xmlSaveFileEnc:
7074 * @filename: the filename (or URL)
7075 * @cur: the document
7076 * @encoding: the name of an encoding (or NULL)
7077 *
7078 * Dump an XML document, converting it to the given encoding
7079 *
Daniel Veillardd1640922001-12-17 15:30:10 +00007080 * returns: the number of bytes written or -1 in case of failure.
Daniel Veillardf012a642001-07-23 19:10:52 +00007081 */
7082int
7083xmlSaveFileEnc(const char *filename, xmlDocPtr cur, const char *encoding) {
7084 return ( xmlSaveFormatFileEnc( filename, cur, encoding, 0 ) );
7085}
7086
Owen Taylor3473f882001-02-23 17:55:21 +00007087/**
Daniel Veillard67fee942001-04-26 18:59:03 +00007088 * xmlSaveFormatFile:
Owen Taylor3473f882001-02-23 17:55:21 +00007089 * @filename: the filename (or URL)
7090 * @cur: the document
Daniel Veillard67fee942001-04-26 18:59:03 +00007091 * @format: should formatting spaces been added
Owen Taylor3473f882001-02-23 17:55:21 +00007092 *
7093 * Dump an XML document to a file. Will use compression if
7094 * compiled in and enabled. If @filename is "-" the stdout file is
Daniel Veillardd1640922001-12-17 15:30:10 +00007095 * used. If @format is set then the document will be indented on output.
Daniel Veillard67fee942001-04-26 18:59:03 +00007096 *
Daniel Veillardd1640922001-12-17 15:30:10 +00007097 * returns: the number of bytes written or -1 in case of failure.
Owen Taylor3473f882001-02-23 17:55:21 +00007098 */
7099int
Daniel Veillard67fee942001-04-26 18:59:03 +00007100xmlSaveFormatFile(const char *filename, xmlDocPtr cur, int format) {
Daniel Veillardf012a642001-07-23 19:10:52 +00007101 return ( xmlSaveFormatFileEnc( filename, cur, NULL, format ) );
Owen Taylor3473f882001-02-23 17:55:21 +00007102}
7103
Daniel Veillard67fee942001-04-26 18:59:03 +00007104/**
7105 * xmlSaveFile:
7106 * @filename: the filename (or URL)
7107 * @cur: the document
7108 *
7109 * Dump an XML document to a file. Will use compression if
7110 * compiled in and enabled. If @filename is "-" the stdout file is
7111 * used.
Daniel Veillardd1640922001-12-17 15:30:10 +00007112 * returns: the number of bytes written or -1 in case of failure.
Daniel Veillard67fee942001-04-26 18:59:03 +00007113 */
7114int
7115xmlSaveFile(const char *filename, xmlDocPtr cur) {
Daniel Veillardf012a642001-07-23 19:10:52 +00007116 return(xmlSaveFormatFileEnc(filename, cur, NULL, 0));
Daniel Veillard67fee942001-04-26 18:59:03 +00007117}
7118