| 685 | } |
| 686 | |
| 687 | inline void insert_node_before(xml_node_struct* child, xml_node_struct* node) |
| 688 | { |
| 689 | xml_node_struct* parent = node->parent; |
| 690 | |
| 691 | child->parent = parent; |
| 692 | |
| 693 | if (node->prev_sibling_c->next_sibling) |
| 694 | node->prev_sibling_c->next_sibling = child; |
| 695 | else |
| 696 | parent->first_child = child; |
| 697 | |
| 698 | child->prev_sibling_c = node->prev_sibling_c; |
| 699 | child->next_sibling = node; |
| 700 | |
| 701 | node->prev_sibling_c = child; |
| 702 | } |
| 703 | |
| 704 | inline void remove_node(xml_node_struct* node) |
| 705 | { |
no outgoing calls
no test coverage detected