Lines Matching +defs:last +defs:depth
127 (n)->last = NULL; \
134 (n)->last = ulccur; \
1000 doc->last = (xmlNodePtr) cur;
1016 cur->prev = doc->last;
1019 doc->last = (xmlNodePtr) cur;
1265 xmlNodePtr ret = NULL, last = NULL;
1381 if (last == NULL) {
1382 last = ret = node;
1384 last = xmlAddNextSibling(last, node);
1405 ent->last = temp;
1409 if (last == NULL) {
1410 last = ret = node;
1412 last = xmlAddNextSibling(last, node);
1437 * Handle the last piece of text.
1448 if (last == NULL) {
1449 last = ret = node;
1451 last = xmlAddNextSibling(last, node);
1473 xmlNodePtr ret = NULL, last = NULL;
1573 if (last == NULL) {
1574 last = ret = node;
1576 last = xmlAddNextSibling(last, node);
1600 if (last == NULL) {
1601 last = ret = node;
1603 last = xmlAddNextSibling(last, node);
1627 * Handle the last piece of text.
1636 if (last == NULL) {
1637 last = ret = node;
1639 last = xmlAddNextSibling(last, node);
1876 cur->last = NULL;
1881 cur->last = tmp;
2028 cur->last = NULL;
2034 cur->last = tmp;
2517 parent->last = cur;
2519 prev = parent->last;
2522 parent->last = cur;
2620 cur->last = (xmlNodePtr) ent;
2897 parent->last = cur;
2899 prev = parent->last;
2902 parent->last = cur;
3031 if ((elem->parent != NULL) && (elem->parent->last == cur))
3032 elem->parent->last = elem;
3157 * Constant time is we can rely on the ->parent->last to find
3158 * the last sibling.
3162 (cur->parent->last != NULL) &&
3163 (cur->parent->last->next == NULL)) {
3164 cur = cur->parent->last;
3189 parent->last = elem;
3202 * Returns the last child or NULL in case of error.
3240 * If cur and parent->last both are TEXT nodes, then merge them.
3243 (parent->last->type == XML_TEXT_NODE) &&
3244 (cur->name == parent->last->name)) {
3245 xmlNodeAddContent(parent->last, cur->content);
3251 return(parent->last);
3257 prev = parent->last;
3273 parent->last = cur;
3329 if ((parent->last != NULL) && (parent->last->type == XML_TEXT_NODE) &&
3330 (parent->last->name == cur->name) &&
3331 (parent->last != cur)) {
3332 xmlNodeAddContent(parent->last, cur->content);
3334 return(parent->last);
3396 parent->last = cur;
3398 prev = parent->last;
3401 parent->last = cur;
3411 * Search the last child of a node.
3412 * Returns the last child or NULL if none.
3423 return(parent->last);
3507 * Finds the last child node of that element which is a Element node
3512 * Returns the last element child or NULL if not available
3525 cur = parent->last;
3823 if (parent->last == cur)
3824 parent->last = cur->prev;
3895 if (cur->parent->last == old)
3896 cur->parent->last = cur;
4037 ret->last = NULL;
4042 ret->last = tmp;
4269 ret->last = ret->children;
4467 ret->last = q;
4505 ret->last = NULL;
4521 ret->last = NULL;
4525 ret->last = tmp;
4542 * @depth: used to limit any risk of recursion
4550 xmlGetLineNoInternal(xmlNodePtr node, int depth)
4554 if (depth >= 5)
4568 result = xmlGetLineNoInternal(node->children, depth + 1);
4570 result = xmlGetLineNoInternal(node->next, depth + 1);
4572 result = xmlGetLineNoInternal(node->prev, depth + 1);
4581 result = xmlGetLineNoInternal(node->prev, depth + 1);
4584 result = xmlGetLineNoInternal(node->parent, depth + 1);
4906 doc->last = root;
5610 cur->last = cur->children = NULL;
5688 cur->children = cur->last = NULL;
5744 xmlNodePtr last, newNode, tmp;
5746 last = cur->last;
5752 if ((last != NULL) && (last->next == newNode)) {
5753 xmlTextMerge(last, newNode);
6843 prop->last = NULL;
6855 prop->last = NULL;
6860 prop->last = tmp;
7764 int shadowDepth; /* Shadowed at this depth */
7766 * depth:
7773 int depth;
7779 xmlNsMapItemPtr last;
7786 i = (m)->last; \
7787 (m)->last = (i)->prev; \
7788 if ((m)->last == NULL) \
7791 (m)->last->next = NULL; \
7828 * @depth: depth and ns-kind information
7834 xmlNsPtr oldNs, xmlNsPtr newNs, int depth)
7882 map->last = ret;
7887 ret->prev = map->last;
7888 map->last->next = ret;
7889 map->last = ret;
7903 ret->depth = depth;
8331 * Check the last level of ns-decls for a
8536 * @depth: the current tree depth
8555 int depth,
8589 if ((mi->depth >= XML_TREE_NSMAP_PARENT) &&
8596 ((! ancestorsOnly) || (mi->depth == XML_TREE_NSMAP_PARENT)) &&
8648 if ((mi->depth < depth) &&
8655 mi->shadowDepth = depth;
8660 if (xmlDOMWrapNsMapAddItem(nsMap, -1, ns, tmpns, depth) == NULL) {
8695 int depth = -1, adoptns = 0, parnsdone = 0;
8719 depth++;
8745 if ((mi->depth >= XML_TREE_NSMAP_PARENT) &&
8782 if ((mi->depth >= XML_TREE_NSMAP_PARENT) &&
8787 mi->shadowDepth = depth;
8795 depth) == NULL)
8852 &nsMap, depth,
8888 while ((nsMap->last != NULL) &&
8889 (nsMap->last->depth >= depth))
8897 if (mi->shadowDepth >= depth)
8901 depth--;
8966 int depth = -1, adoptStr = 1;
9036 depth++;
9068 if ((mi->depth >= XML_TREE_NSMAP_PARENT) &&
9074 mi->shadowDepth = depth;
9082 ns, ns, depth) == NULL)
9139 &nsMap, depth,
9193 cur->last = NULL;
9203 cur->last = (xmlNodePtr) ent;
9238 while ((nsMap->last != NULL) &&
9239 (nsMap->last->depth >= depth))
9247 if (mi->shadowDepth >= depth)
9251 depth--;
9281 nsMap->last->next = nsMap->pool;
9336 int depth = -1;
9497 depth++;
9551 if ((mi->depth >= XML_TREE_NSMAP_PARENT) &&
9558 * depth.
9560 mi->shadowDepth = depth;
9568 ns, cloneNs, depth) == NULL)
9600 clone->last = (xmlNodePtr) ent;
9610 clone->last = cur->last;
9681 &nsMap, depth,
9758 while ((nsMap->last != NULL) &&
9759 (nsMap->last->depth >= depth))
9767 if (mi->shadowDepth >= depth)
9771 depth--;
9778 * Set clone->last.
9781 clone->parent->last = clone;
9816 nsMap->last->next = nsMap->pool;
9917 cur->last = NULL;
9927 cur->last = (xmlNodePtr) ent;
10055 node->last = NULL;
10065 node->last = (xmlNodePtr) ent;