Lines Matching 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;
996 int depth;
2059 (vctxt->depth >= 0) &&
2224 vctxt->elemInfos[vctxt->depth];
4281 * @depth: the depth used for intentation
4286 xmlSchemaContentModelDump(xmlSchemaParticlePtr particle, FILE * output, int depth)
4295 for (i = 0;((i < depth) && (i < 25));i++)
4344 output, depth +1);
4348 output, depth);
14956 * memberTypes [attribute] at any depth which resolve to the component
18946 * of a group there must not be at any depth a particle whose {term}
19104 * it must not be the case that a `QName` is encountered at any depth
19814 * the full depth over and over.
21819 for (i = vctxt->depth; i >= 0; i--) {
22189 ielem = vctxt->elemInfos[matcher->depth];
22437 sto->depth = vctxt->depth;
22464 int res, resolved = 0, depth = vctxt->depth;
22470 depth++;
22475 "IDC: EVAL on %s, depth %d, type %d\n",
22477 vctxt->inode->localName), depth, nodeType);
22537 sto->history[sto->nbHistory++] = depth;
22541 vctxt->depth);
22668 int depth)
22683 "IDC: BACK on %s, depth %d\n",
22685 vctxt->inode->localName), vctxt->depth);
22709 * Only matches at the current depth are of interest.
22711 if (matchDepth != depth) {
22776 * by the target node's depth relative to the matcher's
22777 * depth of creation (i.e. the depth of the scope element).
22779 * Element Depth Pos List-entries
22786 * The size of the list is only dependant on the depth of
22791 pos = sto->depth - matcher->depth;
22935 pos = depth - matcher->depth;
23131 * Deregister state objects if they reach the depth of creation.
23133 if ((sto->nbHistory == 0) && (sto->depth == depth)) {
23186 "IDC: REGISTER on %s, depth %d\n",
23188 vctxt->inode->localName), vctxt->depth);
23201 * depth at which the bubbles should stop; this will be
23202 * the depth of the top-most keyref IDC. If no keyref
23228 (vctxt->depth < aidc->keyrefDepth))
23229 aidc->keyrefDepth = vctxt->depth;
23273 matcher->depth = vctxt->depth;
23318 (matcher->aidc->keyrefDepth > vctxt->depth)))
23478 * @depth: the current tree depth
23480 * Merges IDC bindings of an element at @depth into the corresponding IDC
23502 parTable = &(vctxt->elemInfos[vctxt->depth -1]->idcTable);
23519 (aidc->keyrefDepth >= vctxt->depth)) {
24079 * the currect tree depth.
24088 if (vctxt->depth > vctxt->sizeElemInfos) {
24090 "inconsistent depth encountered");
24103 } else if (vctxt->sizeElemInfos <= vctxt->depth) {
24122 info = vctxt->elemInfos[vctxt->depth];
24132 vctxt->elemInfos[vctxt->depth] = info;
24142 info->depth = vctxt->depth;
24148 #define ACTIVATE_ELEM vctxt->inode = vctxt->elemInfos[vctxt->depth];
24149 #define ACTIVATE_PARENT_ELEM vctxt->inode = vctxt->elemInfos[vctxt->depth -1];
25453 xmlSchemaNodeInfoPtr ielem = vctxt->elemInfos[vctxt->depth];
25723 vctxt->depth +1) == -1) {
26022 vctxt->skipDepth = vctxt->depth -1;
26371 if (vctxt->depth < 0) {
26375 if (vctxt->depth == vctxt->skipDepth)
26381 (xmlSchemaXPathProcessHistory(vctxt, vctxt->depth) == -1))
26421 if ((vctxt->depth > 0) &&
26440 if (vctxt->depth == 0) {
26441 vctxt->depth--;
26451 if (aidc->keyrefDepth == vctxt->depth) {
26454 * depth, this means that we are leaving the scope of the
26462 vctxt->depth--;
26463 vctxt->inode = vctxt->elemInfos[vctxt->depth];
26486 if (vctxt->depth <= 0) {
26491 pielem = vctxt->elemInfos[vctxt->depth -1];
26695 vctxt->skipDepth = vctxt->depth;
26839 (vctxt->depth >= vctxt->skipDepth)) {
26868 if (vctxt->depth > 0) {
26882 if (vctxt->depth == vctxt->skipDepth)
26925 vctxt->skipDepth = vctxt->depth;
27015 vctxt->skipDepth = vctxt->depth;
27026 int depth, nodeType, ret = 0, consumed;
27029 vctxt->depth = -1;
27045 depth = xmlTextReaderDepth(vctxt->reader);
27050 vctxt->depth++;
27126 if (vctxt->depth == vctxt->skipDepth) {
27134 while ((ret == 1) && (curDepth != depth)) {
27168 if (vctxt->depth >= 0)
27230 if (vctxt->depth < 0)
27232 if ((vctxt->skipDepth != -1) && (vctxt->depth >= vctxt->skipDepth))
27255 if (vctxt->depth < 0)
27257 if ((vctxt->skipDepth != -1) && (vctxt->depth >= vctxt->skipDepth))
27276 if (vctxt->depth < 0)
27278 if ((vctxt->skipDepth != -1) && (vctxt->depth >= vctxt->skipDepth))
27306 vctxt->depth++;
27307 if ((vctxt->skipDepth != -1) && (vctxt->depth >= vctxt->skipDepth))
27436 if (vctxt->depth > vctxt->skipDepth) {
27437 vctxt->depth--;
27877 vctxt->depth = -1;
27881 if ((vctxt->skipDepth != -1) && (vctxt->depth >= vctxt->skipDepth))
27888 vctxt->depth++;
27945 (vctxt->depth >= vctxt->skipDepth))
28032 vctxt->depth = -1;
