mxml-node.c 19.5 KB
Newer Older
Michael R Sweet's avatar
Michael R Sweet committed
1
/*
Michael Sweet's avatar
Michael Sweet committed
2
 * Node support code for Mini-XML, a small XML file parsing library.
Michael R Sweet's avatar
Michael R Sweet committed
3
 *
4
 * Copyright 2003-2018 by Michael R Sweet.
Michael R Sweet's avatar
Michael R Sweet committed
5
 *
6 7 8 9 10
 * These coded instructions, statements, and computer programs are the
 * property of Michael R Sweet and are protected by Federal copyright
 * law.  Distribution and use rights are outlined in the file "COPYING"
 * which should have been included with this file.  If this file is
 * missing or damaged, see the license at:
Michael R Sweet's avatar
Michael R Sweet committed
11
 *
Michael Sweet's avatar
Michael Sweet committed
12
 *     https://michaelrsweet.github.io/mxml
Michael R Sweet's avatar
Michael R Sweet committed
13 14 15 16 17 18
 */

/*
 * Include necessary headers...
 */

19
#include "config.h"
20
#include "mxml.h"
Michael R Sweet's avatar
Michael R Sweet committed
21 22 23 24 25 26


/*
 * Local functions...
 */

27
static void		mxml_free(mxml_node_t *node);
Michael R Sweet's avatar
Michael R Sweet committed
28 29 30
static mxml_node_t	*mxml_new(mxml_node_t *parent, mxml_type_t type);


31 32
/*
 * 'mxmlAdd()' - Add a node to a tree.
33
 *
34 35 36 37 38 39
 * Adds the specified node to the parent.  If the child argument is not
 * @code NULL@, puts the new node before or after the specified child depending
 * on the value of the where argument.  If the child argument is @code NULL@,
 * puts the new node at the beginning of the child list (@code MXML_ADD_BEFORE@)
 * or at the end of the child list (@code MXML_ADD_AFTER@).  The constant
 * @code MXML_ADD_TO_PARENT@ can be used to specify a @code NULL@ child pointer.
40 41 42 43
 */

void
mxmlAdd(mxml_node_t *parent,		/* I - Parent node */
44 45
        int         where,		/* I - Where to add, @code MXML_ADD_BEFORE@ or @code MXML_ADD_AFTER@ */
        mxml_node_t *child,		/* I - Child node for where or @code MXML_ADD_TO_PARENT@ */
46 47
	mxml_node_t *node)		/* I - Node to add */
{
Michael R Sweet's avatar
Michael R Sweet committed
48 49 50 51
#ifdef DEBUG
  fprintf(stderr, "mxmlAdd(parent=%p, where=%d, child=%p, node=%p)\n", parent,
          where, child, node);
#endif /* DEBUG */
Michael R Sweet's avatar
Michael R Sweet committed
52

53 54 55 56 57
 /*
  * Range check input...
  */

  if (!parent || !node)
58 59
    return;

Michael R Sweet's avatar
Michael R Sweet committed
60 61
#if DEBUG > 1
  fprintf(stderr, "    BEFORE: node->parent=%p\n", node->parent);
Michael R Sweet's avatar
Michael R Sweet committed
62 63 64 65 66 67 68
  if (parent)
  {
    fprintf(stderr, "    BEFORE: parent->child=%p\n", parent->child);
    fprintf(stderr, "    BEFORE: parent->last_child=%p\n", parent->last_child);
    fprintf(stderr, "    BEFORE: parent->prev=%p\n", parent->prev);
    fprintf(stderr, "    BEFORE: parent->next=%p\n", parent->next);
  }
Michael R Sweet's avatar
Michael R Sweet committed
69 70
#endif /* DEBUG > 1 */

71 72 73 74
 /*
  * Remove the node from any existing parent...
  */

75 76 77
  if (node->parent)
    mxmlRemove(node);

78 79 80 81
 /*
  * Reset pointers...
  */

82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154
  node->parent = parent;

  switch (where)
  {
    case MXML_ADD_BEFORE :
        if (!child || child == parent->child || child->parent != parent)
	{
	 /*
	  * Insert as first node under parent...
	  */

	  node->next = parent->child;

	  if (parent->child)
	    parent->child->prev = node;
	  else
	    parent->last_child = node;

	  parent->child = node;
	}
	else
	{
	 /*
	  * Insert node before this child...
	  */

	  node->next = child;
	  node->prev = child->prev;

	  if (child->prev)
	    child->prev->next = node;
	  else
	    parent->child = node;

	  child->prev = node;
	}
        break;

    case MXML_ADD_AFTER :
        if (!child || child == parent->last_child || child->parent != parent)
	{
	 /*
	  * Insert as last node under parent...
	  */

	  node->parent = parent;
	  node->prev   = parent->last_child;

	  if (parent->last_child)
	    parent->last_child->next = node;
	  else
	    parent->child = node;

	  parent->last_child = node;
        }
	else
	{
	 /*
	  * Insert node after this child...
	  */

	  node->prev = child;
	  node->next = child->next;

	  if (child->next)
	    child->next->prev = node;
	  else
	    parent->last_child = node;

	  child->next = node;
	}
        break;
  }
Michael R Sweet's avatar
Michael R Sweet committed
155 156 157

#if DEBUG > 1
  fprintf(stderr, "    AFTER: node->parent=%p\n", node->parent);
Michael R Sweet's avatar
Michael R Sweet committed
158 159 160 161 162 163 164
  if (parent)
  {
    fprintf(stderr, "    AFTER: parent->child=%p\n", parent->child);
    fprintf(stderr, "    AFTER: parent->last_child=%p\n", parent->last_child);
    fprintf(stderr, "    AFTER: parent->prev=%p\n", parent->prev);
    fprintf(stderr, "    AFTER: parent->next=%p\n", parent->next);
  }
Michael R Sweet's avatar
Michael R Sweet committed
165
#endif /* DEBUG > 1 */
166 167 168
}


Michael R Sweet's avatar
Michael R Sweet committed
169 170
/*
 * 'mxmlDelete()' - Delete a node and all of its children.
171 172
 *
 * If the specified node has a parent, this function first removes the
173
 * node from its parent using the @link mxmlRemove@ function.
Michael R Sweet's avatar
Michael R Sweet committed
174 175 176
 */

void
177
mxmlDelete(mxml_node_t *node)		/* I - Node to delete */
Michael R Sweet's avatar
Michael R Sweet committed
178
{
179 180
  mxml_node_t	*current,		/* Current node */
		*next;			/* Next node */
Michael R Sweet's avatar
Michael R Sweet committed
181 182


Michael R Sweet's avatar
Michael R Sweet committed
183 184 185
#ifdef DEBUG
  fprintf(stderr, "mxmlDelete(node=%p)\n", node);
#endif /* DEBUG */
Michael R Sweet's avatar
Michael R Sweet committed
186

Michael R Sweet's avatar
Michael R Sweet committed
187 188 189 190 191 192 193 194
 /*
  * Range check input...
  */

  if (!node)
    return;

 /*
195 196 197 198 199 200 201
  * Remove the node from its parent, if any...
  */

  mxmlRemove(node);

 /*
  * Delete children...
Michael R Sweet's avatar
Michael R Sweet committed
202 203
  */

204 205 206 207 208
  for (current = node->child; current; current = next)
  {
   /*
    * Get the next node...
    */
Michael R Sweet's avatar
Michael R Sweet committed
209

210 211 212 213 214
    if ((next = current->child) != NULL)
    {
     /*
      * Free parent nodes after child nodes have been freed...
      */
Michael R Sweet's avatar
Michael R Sweet committed
215

216 217 218
      current->child = NULL;
      continue;
    }
Michael R Sweet's avatar
Michael R Sweet committed
219

220 221
    if ((next = current->next) == NULL)
    {
222 223 224
     /*
      * Next node is the parent, which we'll free as needed...
      */
225

226
      if ((next = current->parent) == node)
227 228
        next = NULL;
    }
Michael R Sweet's avatar
Michael R Sweet committed
229

230 231 232 233
   /*
    * Free child...
    */

234
    mxml_free(current);
Michael R Sweet's avatar
Michael R Sweet committed
235 236 237
  }

 /*
238
  * Then free the memory used by the parent node...
Michael R Sweet's avatar
Michael R Sweet committed
239 240
  */

241
  mxml_free(node);
Michael R Sweet's avatar
Michael R Sweet committed
242 243 244
}


245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272
/*
 * 'mxmlGetRefCount()' - Get the current reference (use) count for a node.
 *
 * The initial reference count of new nodes is 1. Use the @link mxmlRetain@
 * and @link mxmlRelease@ functions to increment and decrement a node's
 * reference count.
 *
 * @since Mini-XML 2.7@.
 */

int					/* O - Reference count */
mxmlGetRefCount(mxml_node_t *node)	/* I - Node */
{
 /*
  * Range check input...
  */

  if (!node)
    return (0);

 /*
  * Return the reference count...
  */

  return (node->ref_count);
}


273 274 275 276
/*
 * 'mxmlNewCDATA()' - Create a new CDATA node.
 *
 * The new CDATA node is added to the end of the specified parent's child
277 278 279 280
 * list.  The constant @code MXML_NO_PARENT@ can be used to specify that the new
 * CDATA node has no parent.  The data string must be nul-terminated and
 * is copied into the new node.  CDATA nodes currently use the
 * @code MXML_ELEMENT@ type.
Michael R Sweet's avatar
Michael R Sweet committed
281 282
 *
 * @since Mini-XML 2.3@
283 284 285
 */

mxml_node_t *				/* O - New node */
286
mxmlNewCDATA(mxml_node_t *parent,	/* I - Parent node or @code MXML_NO_PARENT@ */
287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308
	     const char  *data)		/* I - Data string */
{
  mxml_node_t	*node;			/* New node */


#ifdef DEBUG
  fprintf(stderr, "mxmlNewCDATA(parent=%p, data=\"%s\")\n",
          parent, data ? data : "(null)");
#endif /* DEBUG */

 /*
  * Range check input...
  */

  if (!data)
    return (NULL);

 /*
  * Create the node and set the name value...
  */

  if ((node = mxml_new(parent, MXML_ELEMENT)) != NULL)
309
    node->value.element.name = _mxml_strdupf("![CDATA[%s", data);
310 311 312 313 314

  return (node);
}


315 316 317 318
/*
 * 'mxmlNewCustom()' - Create a new custom data node.
 *
 * The new custom node is added to the end of the specified parent's child
319 320
 * list. The constant @code MXML_NO_PARENT@ can be used to specify that the new
 * element node has no parent. @code NULL@ can be passed when the data in the
321
 * node is not dynamically allocated or is separately managed.
Michael R Sweet's avatar
Michael R Sweet committed
322 323
 *
 * @since Mini-XML 2.1@
324 325 326
 */

mxml_node_t *				/* O - New node */
327
mxmlNewCustom(
328
    mxml_node_t              *parent,	/* I - Parent node or @code MXML_NO_PARENT@ */
329 330
    void                     *data,	/* I - Pointer to data */
    mxml_custom_destroy_cb_t destroy)	/* I - Function to destroy data */
331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353
{
  mxml_node_t	*node;			/* New node */


#ifdef DEBUG
  fprintf(stderr, "mxmlNewCustom(parent=%p, data=%p, destroy=%p)\n", parent,
          data, destroy);
#endif /* DEBUG */

 /*
  * Create the node and set the value...
  */

  if ((node = mxml_new(parent, MXML_CUSTOM)) != NULL)
  {
    node->value.custom.data    = data;
    node->value.custom.destroy = destroy;
  }

  return (node);
}


Michael R Sweet's avatar
Michael R Sweet committed
354 355
/*
 * 'mxmlNewElement()' - Create a new element node.
356 357
 *
 * The new element node is added to the end of the specified parent's child
358
 * list. The constant @code MXML_NO_PARENT@ can be used to specify that the new
359
 * element node has no parent.
Michael R Sweet's avatar
Michael R Sweet committed
360 361 362
 */

mxml_node_t *				/* O - New node */
363
mxmlNewElement(mxml_node_t *parent,	/* I - Parent node or @code MXML_NO_PARENT@ */
Michael R Sweet's avatar
Michael R Sweet committed
364 365 366 367 368
               const char  *name)	/* I - Name of element */
{
  mxml_node_t	*node;			/* New node */


Michael R Sweet's avatar
Michael R Sweet committed
369 370 371 372 373
#ifdef DEBUG
  fprintf(stderr, "mxmlNewElement(parent=%p, name=\"%s\")\n", parent,
          name ? name : "(null)");
#endif /* DEBUG */

Michael R Sweet's avatar
Michael R Sweet committed
374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393
 /*
  * Range check input...
  */

  if (!name)
    return (NULL);

 /*
  * Create the node and set the element name...
  */

  if ((node = mxml_new(parent, MXML_ELEMENT)) != NULL)
    node->value.element.name = strdup(name);

  return (node);
}


/*
 * 'mxmlNewInteger()' - Create a new integer node.
394 395
 *
 * The new integer node is added to the end of the specified parent's child
396
 * list. The constant @code MXML_NO_PARENT@ can be used to specify that the new
397
 * integer node has no parent.
Michael R Sweet's avatar
Michael R Sweet committed
398 399 400
 */

mxml_node_t *				/* O - New node */
401
mxmlNewInteger(mxml_node_t *parent,	/* I - Parent node or @code MXML_NO_PARENT@ */
Michael R Sweet's avatar
Michael R Sweet committed
402 403 404 405 406
               int         integer)	/* I - Integer value */
{
  mxml_node_t	*node;			/* New node */


Michael R Sweet's avatar
Michael R Sweet committed
407 408 409 410
#ifdef DEBUG
  fprintf(stderr, "mxmlNewInteger(parent=%p, integer=%d)\n", parent, integer);
#endif /* DEBUG */

Michael R Sweet's avatar
Michael R Sweet committed
411 412 413 414 415 416 417 418 419 420 421 422 423
 /*
  * Create the node and set the element name...
  */

  if ((node = mxml_new(parent, MXML_INTEGER)) != NULL)
    node->value.integer = integer;

  return (node);
}


/*
 * 'mxmlNewOpaque()' - Create a new opaque string.
424
 *
425 426 427 428
 * The new opaque string node is added to the end of the specified parent's
 * child list.  The constant @code MXML_NO_PARENT@ can be used to specify that
 * the new opaque string node has no parent.  The opaque string must be nul-
 * terminated and is copied into the new node.
Michael R Sweet's avatar
Michael R Sweet committed
429 430 431
 */

mxml_node_t *				/* O - New node */
432
mxmlNewOpaque(mxml_node_t *parent,	/* I - Parent node or @code MXML_NO_PARENT@ */
Michael R Sweet's avatar
Michael R Sweet committed
433 434 435 436 437
              const char  *opaque)	/* I - Opaque string */
{
  mxml_node_t	*node;			/* New node */


Michael R Sweet's avatar
Michael R Sweet committed
438 439 440 441 442
#ifdef DEBUG
  fprintf(stderr, "mxmlNewOpaque(parent=%p, opaque=\"%s\")\n", parent,
          opaque ? opaque : "(null)");
#endif /* DEBUG */

Michael R Sweet's avatar
Michael R Sweet committed
443 444 445 446
 /*
  * Range check input...
  */

447
  if (!opaque)
Michael R Sweet's avatar
Michael R Sweet committed
448 449 450 451 452 453 454 455 456 457 458 459 460
    return (NULL);

 /*
  * Create the node and set the element name...
  */

  if ((node = mxml_new(parent, MXML_OPAQUE)) != NULL)
    node->value.opaque = strdup(opaque);

  return (node);
}


461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506
/*
 * 'mxmlNewOpaquef()' - Create a new formatted opaque string node.
 *
 * The new opaque string node is added to the end of the specified parent's
 * child list.  The constant @code MXML_NO_PARENT@ can be used to specify that
 * the new opaque string node has no parent.  The format string must be
 * nul-terminated and is formatted into the new node.
 */

mxml_node_t *				/* O - New node */
mxmlNewOpaquef(mxml_node_t *parent,	/* I - Parent node or @code MXML_NO_PARENT@ */
               const char  *format,	/* I - Printf-style format string */
	       ...)			/* I - Additional args as needed */
{
  mxml_node_t	*node;			/* New node */
  va_list	ap;			/* Pointer to arguments */


#ifdef DEBUG
  fprintf(stderr, "mxmlNewOpaquef(parent=%p, format=\"%s\", ...)\n", parent, format ? format : "(null)");
#endif /* DEBUG */

 /*
  * Range check input...
  */

  if (!format)
    return (NULL);

 /*
  * Create the node and set the text value...
  */

  if ((node = mxml_new(parent, MXML_OPAQUE)) != NULL)
  {
    va_start(ap, format);

    node->value.opaque = _mxml_vstrdupf(format, ap);

    va_end(ap);
  }

  return (node);
}


Michael R Sweet's avatar
Michael R Sweet committed
507 508
/*
 * 'mxmlNewReal()' - Create a new real number node.
509 510
 *
 * The new real number node is added to the end of the specified parent's
511
 * child list.  The constant @code MXML_NO_PARENT@ can be used to specify that
512
 * the new real number node has no parent.
Michael R Sweet's avatar
Michael R Sweet committed
513 514 515
 */

mxml_node_t *				/* O - New node */
516
mxmlNewReal(mxml_node_t *parent,	/* I - Parent node or @code MXML_NO_PARENT@ */
Michael R Sweet's avatar
Michael R Sweet committed
517 518 519 520 521
            double      real)		/* I - Real number value */
{
  mxml_node_t	*node;			/* New node */


Michael R Sweet's avatar
Michael R Sweet committed
522 523 524 525
#ifdef DEBUG
  fprintf(stderr, "mxmlNewReal(parent=%p, real=%g)\n", parent, real);
#endif /* DEBUG */

Michael R Sweet's avatar
Michael R Sweet committed
526 527 528 529 530 531 532 533 534 535 536 537 538
 /*
  * Create the node and set the element name...
  */

  if ((node = mxml_new(parent, MXML_REAL)) != NULL)
    node->value.real = real;

  return (node);
}


/*
 * 'mxmlNewText()' - Create a new text fragment node.
539 540
 *
 * The new text node is added to the end of the specified parent's child
541 542 543
 * list.  The constant @code MXML_NO_PARENT@ can be used to specify that the new
 * text node has no parent.  The whitespace parameter is used to specify
 * whether leading whitespace is present before the node.  The text
544
 * string must be nul-terminated and is copied into the new node.
Michael R Sweet's avatar
Michael R Sweet committed
545 546 547
 */

mxml_node_t *				/* O - New node */
548
mxmlNewText(mxml_node_t *parent,	/* I - Parent node or @code MXML_NO_PARENT@ */
549
            int         whitespace,	/* I - 1 = leading whitespace, 0 = no whitespace */
Michael R Sweet's avatar
Michael R Sweet committed
550 551 552 553 554
	    const char  *string)	/* I - String */
{
  mxml_node_t	*node;			/* New node */


Michael R Sweet's avatar
Michael R Sweet committed
555 556 557 558 559
#ifdef DEBUG
  fprintf(stderr, "mxmlNewText(parent=%p, whitespace=%d, string=\"%s\")\n",
          parent, whitespace, string ? string : "(null)");
#endif /* DEBUG */

Michael R Sweet's avatar
Michael R Sweet committed
560 561 562 563
 /*
  * Range check input...
  */

564
  if (!string)
Michael R Sweet's avatar
Michael R Sweet committed
565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580
    return (NULL);

 /*
  * Create the node and set the text value...
  */

  if ((node = mxml_new(parent, MXML_TEXT)) != NULL)
  {
    node->value.text.whitespace = whitespace;
    node->value.text.string     = strdup(string);
  }

  return (node);
}


581 582 583 584
/*
 * 'mxmlNewTextf()' - Create a new formatted text fragment node.
 *
 * The new text node is added to the end of the specified parent's child
585 586 587
 * list.  The constant @code MXML_NO_PARENT@ can be used to specify that the new
 * text node has no parent.  The whitespace parameter is used to specify
 * whether leading whitespace is present before the node.  The format
588
 * string must be nul-terminated and is formatted into the new node.
589 590 591
 */

mxml_node_t *				/* O - New node */
592
mxmlNewTextf(mxml_node_t *parent,	/* I - Parent node or @code MXML_NO_PARENT@ */
593
             int         whitespace,	/* I - 1 = leading whitespace, 0 = no whitespace */
594
	     const char  *format,	/* I - Printf-style format string */
595 596 597 598 599 600
	     ...)			/* I - Additional args as needed */
{
  mxml_node_t	*node;			/* New node */
  va_list	ap;			/* Pointer to arguments */


Michael R Sweet's avatar
Michael R Sweet committed
601 602 603 604 605
#ifdef DEBUG
  fprintf(stderr, "mxmlNewTextf(parent=%p, whitespace=%d, format=\"%s\", ...)\n",
          parent, whitespace, format ? format : "(null)");
#endif /* DEBUG */

606 607 608 609
 /*
  * Range check input...
  */

610
  if (!format)
611 612 613 614 615 616 617 618 619 620 621
    return (NULL);

 /*
  * Create the node and set the text value...
  */

  if ((node = mxml_new(parent, MXML_TEXT)) != NULL)
  {
    va_start(ap, format);

    node->value.text.whitespace = whitespace;
Michael R Sweet's avatar
Michael R Sweet committed
622
    node->value.text.string     = _mxml_vstrdupf(format, ap);
623 624 625 626 627 628 629 630

    va_end(ap);
  }

  return (node);
}


631 632
/*
 * 'mxmlRemove()' - Remove a node from its parent.
633
 *
634 635
 * This function does not free memory used by the node - use @link mxmlDelete@
 * for that.  This function does nothing if the node has no parent.
636 637 638 639 640
 */

void
mxmlRemove(mxml_node_t *node)		/* I - Node to remove */
{
Michael R Sweet's avatar
Michael R Sweet committed
641 642 643 644
#ifdef DEBUG
  fprintf(stderr, "mxmlRemove(node=%p)\n", node);
#endif /* DEBUG */

645 646 647 648 649 650 651 652 653 654 655
 /*
  * Range check input...
  */

  if (!node || !node->parent)
    return;

 /*
  * Remove from parent...
  */

Michael R Sweet's avatar
Michael R Sweet committed
656 657 658 659 660 661 662 663 664 665 666 667 668
#if DEBUG > 1
  fprintf(stderr, "    BEFORE: node->parent=%p\n", node->parent);
  if (node->parent)
  {
    fprintf(stderr, "    BEFORE: node->parent->child=%p\n", node->parent->child);
    fprintf(stderr, "    BEFORE: node->parent->last_child=%p\n", node->parent->last_child);
  }
  fprintf(stderr, "    BEFORE: node->child=%p\n", node->child);
  fprintf(stderr, "    BEFORE: node->last_child=%p\n", node->last_child);
  fprintf(stderr, "    BEFORE: node->prev=%p\n", node->prev);
  fprintf(stderr, "    BEFORE: node->next=%p\n", node->next);
#endif /* DEBUG > 1 */

669 670 671 672 673 674 675 676 677
  if (node->prev)
    node->prev->next = node->next;
  else
    node->parent->child = node->next;

  if (node->next)
    node->next->prev = node->prev;
  else
    node->parent->last_child = node->prev;
Michael R Sweet's avatar
Michael R Sweet committed
678 679 680 681

  node->parent = NULL;
  node->prev   = NULL;
  node->next   = NULL;
Michael R Sweet's avatar
Michael R Sweet committed
682 683 684 685 686 687 688 689 690 691 692 693 694

#if DEBUG > 1
  fprintf(stderr, "    AFTER: node->parent=%p\n", node->parent);
  if (node->parent)
  {
    fprintf(stderr, "    AFTER: node->parent->child=%p\n", node->parent->child);
    fprintf(stderr, "    AFTER: node->parent->last_child=%p\n", node->parent->last_child);
  }
  fprintf(stderr, "    AFTER: node->child=%p\n", node->child);
  fprintf(stderr, "    AFTER: node->last_child=%p\n", node->last_child);
  fprintf(stderr, "    AFTER: node->prev=%p\n", node->prev);
  fprintf(stderr, "    AFTER: node->next=%p\n", node->next);
#endif /* DEBUG > 1 */
695 696 697
}


698 699 700 701
/*
 * 'mxmlNewXML()' - Create a new XML document tree.
 *
 * The "version" argument specifies the version number to put in the
702
 * ?xml element node. If @code NULL@, version "1.0" is assumed.
703 704 705 706 707 708 709 710 711 712
 *
 * @since Mini-XML 2.3@
 */

mxml_node_t *				/* O - New ?xml node */
mxmlNewXML(const char *version)		/* I - Version number to use */
{
  char	element[1024];			/* Element text */


713
  snprintf(element, sizeof(element), "?xml version=\"%s\" encoding=\"utf-8\"?",
714 715 716 717 718 719
           version ? version : "1.0");

  return (mxmlNewElement(NULL, element));
}


720 721 722 723
/*
 * 'mxmlRelease()' - Release a node.
 *
 * When the reference count reaches zero, the node (and any children)
724
 * is deleted via @link mxmlDelete@.
725 726
 *
 * @since Mini-XML 2.3@
727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748
 */

int					/* O - New reference count */
mxmlRelease(mxml_node_t *node)		/* I - Node */
{
  if (node)
  {
    if ((-- node->ref_count) <= 0)
    {
      mxmlDelete(node);
      return (0);
    }
    else
      return (node->ref_count);
  }
  else
    return (-1);
}


/*
 * 'mxmlRetain()' - Retain a node.
749 750
 *
 * @since Mini-XML 2.3@
751 752 753 754 755 756 757 758 759 760 761 762
 */

int					/* O - New reference count */
mxmlRetain(mxml_node_t *node)		/* I - Node */
{
  if (node)
    return (++ node->ref_count);
  else
    return (-1);
}


763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824
/*
 * 'mxml_free()' - Free the memory used by a node.
 *
 * Note: Does not free child nodes, does not remove from parent.
 */

static void
mxml_free(mxml_node_t *node)		/* I - Node */
{
  int	i;				/* Looping var */


  switch (node->type)
  {
    case MXML_ELEMENT :
        if (node->value.element.name)
	  free(node->value.element.name);

	if (node->value.element.num_attrs)
	{
	  for (i = 0; i < node->value.element.num_attrs; i ++)
	  {
	    if (node->value.element.attrs[i].name)
	      free(node->value.element.attrs[i].name);
	    if (node->value.element.attrs[i].value)
	      free(node->value.element.attrs[i].value);
	  }

          free(node->value.element.attrs);
	}
        break;
    case MXML_INTEGER :
       /* Nothing to do */
        break;
    case MXML_OPAQUE :
        if (node->value.opaque)
	  free(node->value.opaque);
        break;
    case MXML_REAL :
       /* Nothing to do */
        break;
    case MXML_TEXT :
        if (node->value.text.string)
	  free(node->value.text.string);
        break;
    case MXML_CUSTOM :
        if (node->value.custom.data &&
	    node->value.custom.destroy)
	  (*(node->value.custom.destroy))(node->value.custom.data);
	break;
    default :
        break;
  }

 /*
  * Free this node...
  */

  free(node);
}


Michael R Sweet's avatar
Michael R Sweet committed
825 826 827 828 829 830 831 832 833 834 835
/*
 * 'mxml_new()' - Create a new node.
 */

static mxml_node_t *			/* O - New node */
mxml_new(mxml_node_t *parent,		/* I - Parent node */
         mxml_type_t type)		/* I - Node type */
{
  mxml_node_t	*node;			/* New node */


Michael R Sweet's avatar
Michael R Sweet committed
836 837 838 839
#if DEBUG > 1
  fprintf(stderr, "mxml_new(parent=%p, type=%d)\n", parent, type);
#endif /* DEBUG > 1 */

Michael R Sweet's avatar
Michael R Sweet committed
840 841 842 843 844
 /*
  * Allocate memory for the node...
  */

  if ((node = calloc(1, sizeof(mxml_node_t))) == NULL)
Michael R Sweet's avatar
Michael R Sweet committed
845 846 847 848 849
  {
#if DEBUG > 1
    fputs("    returning NULL\n", stderr);
#endif /* DEBUG > 1 */

Michael R Sweet's avatar
Michael R Sweet committed
850
    return (NULL);
Michael R Sweet's avatar
Michael R Sweet committed
851 852 853 854 855
  }

#if DEBUG > 1
  fprintf(stderr, "    returning %p\n", node);
#endif /* DEBUG > 1 */
Michael R Sweet's avatar
Michael R Sweet committed
856 857 858 859 860

 /*
  * Set the node type...
  */

861 862
  node->type      = type;
  node->ref_count = 1;
Michael R Sweet's avatar
Michael R Sweet committed
863 864 865 866 867 868

 /*
  * Add to the parent if present...
  */

  if (parent)
869
    mxmlAdd(parent, MXML_ADD_AFTER, MXML_ADD_TO_PARENT, node);
Michael R Sweet's avatar
Michael R Sweet committed
870 871 872 873 874 875 876

 /*
  * Return the new node...
  */

  return (node);
}