Lines Matching +defs:last +defs:depth
826 int depth; /* depth of creation */
827 int *history; /* list of (depth, state-id) tuples */
845 int depth; /* the tree depth at creation time */
895 int depth;
995 int depth;
2053 (vctxt->depth >= 0) &&
2203 vctxt->elemInfos[vctxt->depth];
4260 * @depth: the depth used for intentation
4265 xmlSchemaContentModelDump(xmlSchemaParticlePtr particle, FILE * output, int depth)
4274 for (i = 0;((i < depth) && (i < 25));i++)
4323 output, depth +1);
4327 output, depth);
4856 * Return the last redefinition. *
8947 xmlSchemaTypePtr subtype, last = NULL;
8957 if (last == NULL) {
8959 last = subtype;
8961 last->next = subtype;
8962 last = subtype;
8964 last->next = NULL;
11279 xmlSchemaParticlePtr part, last = NULL;
11310 if (last == NULL)
11313 last->next = (xmlSchemaTreeItemPtr) part;
11314 last = part;
11326 xmlSchemaTreeItemPtr part = NULL, last = NULL;
11417 if (last == NULL)
11420 last->next = part;
11421 last = part;
13454 xmlSchemaWildcardNsPtr cur, tmp, last;
13460 last = NULL;
13466 if (last == NULL)
13469 last->next = tmp;
13470 last = tmp;
14926 * memberTypes [attribute] at any depth which resolve to the component
17193 xmlSchemaFacetLinkPtr link, cur, last = NULL;
17232 last = type->facetSet;
17233 if (last != NULL)
17234 while (last->next != NULL)
17235 last = last->next;
17711 if (last == NULL)
17714 last->next = link;
17715 last = link;
18915 * of a group there must not be at any depth a particle whose {term}
19073 * it must not be the case that a ���QName��� is encountered at any depth
19783 * the full depth over and over.
21788 for (i = vctxt->depth; i >= 0; i--) {
22158 ielem = vctxt->elemInfos[matcher->depth];
22406 sto->depth = vctxt->depth;
22433 int res, resolved = 0, depth = vctxt->depth;
22439 depth++;
22444 "IDC: EVAL on %s, depth %d, type %d\n",
22446 vctxt->inode->localName), depth, nodeType);
22506 sto->history[sto->nbHistory++] = depth;
22510 vctxt->depth);
22637 int depth)
22652 "IDC: BACK on %s, depth %d\n",
22654 vctxt->inode->localName), vctxt->depth);
22678 * Only matches at the current depth are of interest.
22680 if (matchDepth != depth) {
22745 * by the target node's depth relative to the matcher's
22746 * depth of creation (i.e. the depth of the scope element).
22755 * The size of the list is only dependant on the depth of
22760 pos = sto->depth - matcher->depth;
22904 pos = depth - matcher->depth;
23100 * Deregister state objects if they reach the depth of creation.
23102 if ((sto->nbHistory == 0) && (sto->depth == depth)) {
23143 xmlSchemaIDCMatcherPtr matcher, last = NULL;
23155 "IDC: REGISTER on %s, depth %d\n",
23157 vctxt->inode->localName), vctxt->depth);
23170 * depth at which the bubbles should stop; this will be
23171 * the depth of the top-most keyref IDC. If no keyref
23197 (vctxt->depth < aidc->keyrefDepth))
23198 aidc->keyrefDepth = vctxt->depth;
23235 if (last == NULL)
23238 last->next = matcher;
23239 last = matcher;
23242 matcher->depth = vctxt->depth;
23287 (matcher->aidc->keyrefDepth > vctxt->depth)))
23447 * @depth: the current tree depth
23449 * Merges IDC bindings of an element at @depth into the corresponding IDC
23471 parTable = &(vctxt->elemInfos[vctxt->depth -1]->idcTable);
23488 (aidc->keyrefDepth >= vctxt->depth)) {
23612 * Move last old item to pos of duplicate.
23618 * If new items exist, move last new item to
23619 * last of old items.
24048 * the currect tree depth.
24057 if (vctxt->depth > vctxt->sizeElemInfos) {
24059 "inconsistent depth encountered");
24072 } else if (vctxt->sizeElemInfos <= vctxt->depth) {
24091 info = vctxt->elemInfos[vctxt->depth];
24101 vctxt->elemInfos[vctxt->depth] = info;
24111 info->depth = vctxt->depth;
24117 #define ACTIVATE_ELEM vctxt->inode = vctxt->elemInfos[vctxt->depth];
24118 #define ACTIVATE_PARENT_ELEM vctxt->inode = vctxt->elemInfos[vctxt->depth -1];
24332 * Save the last non-validating facet.
25422 xmlSchemaNodeInfoPtr ielem = vctxt->elemInfos[vctxt->depth];
25574 * Free last computed value; just for safety reasons.
25692 vctxt->depth +1) == -1) {
25991 vctxt->skipDepth = vctxt->depth -1;
26323 if (vctxt->depth < 0) {
26327 if (vctxt->depth == vctxt->skipDepth)
26333 (xmlSchemaXPathProcessHistory(vctxt, vctxt->depth) == -1))
26373 if ((vctxt->depth > 0) &&
26392 if (vctxt->depth == 0) {
26393 vctxt->depth--;
26403 if (aidc->keyrefDepth == vctxt->depth) {
26406 * depth, this means that we are leaving the scope of the
26414 vctxt->depth--;
26415 vctxt->inode = vctxt->elemInfos[vctxt->depth];
26438 if (vctxt->depth <= 0) {
26443 pielem = vctxt->elemInfos[vctxt->depth -1];
26647 vctxt->skipDepth = vctxt->depth;
26791 (vctxt->depth >= vctxt->skipDepth)) {
26815 if (vctxt->depth > 0) {
26829 if (vctxt->depth == vctxt->skipDepth)
26872 vctxt->skipDepth = vctxt->depth;
26962 vctxt->skipDepth = vctxt->depth;
26973 int depth, nodeType, ret = 0, consumed;
26976 vctxt->depth = -1;
26992 depth = xmlTextReaderDepth(vctxt->reader);
26997 vctxt->depth++;
27073 if (vctxt->depth == vctxt->skipDepth) {
27081 while ((ret == 1) && (curDepth != depth)) {
27115 if (vctxt->depth >= 0)
27177 if (vctxt->depth < 0)
27179 if ((vctxt->skipDepth != -1) && (vctxt->depth >= vctxt->skipDepth))
27202 if (vctxt->depth < 0)
27204 if ((vctxt->skipDepth != -1) && (vctxt->depth >= vctxt->skipDepth))
27223 if (vctxt->depth < 0)
27225 if ((vctxt->skipDepth != -1) && (vctxt->depth >= vctxt->skipDepth))
27253 vctxt->depth++;
27254 if ((vctxt->skipDepth != -1) && (vctxt->depth >= vctxt->skipDepth))
27383 if (vctxt->depth > vctxt->skipDepth) {
27384 vctxt->depth--;
27794 vctxt->depth = -1;
27798 if ((vctxt->skipDepth != -1) && (vctxt->depth >= vctxt->skipDepth))
27805 vctxt->depth++;
27862 (vctxt->depth >= vctxt->skipDepth))
27949 vctxt->depth = -1;