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;
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);
14926 * memberTypes [attribute] at any depth which resolve to the component
18916 * of a group there must not be at any depth a particle whose {term}
19074 * it must not be the case that a ?QName? is encountered at any depth
19784 * the full depth over and over.
21789 for (i = vctxt->depth; i >= 0; i--) {
22159 ielem = vctxt->elemInfos[matcher->depth];
22407 sto->depth = vctxt->depth;
22434 int res, resolved = 0, depth = vctxt->depth;
22440 depth++;
22445 "IDC: EVAL on %s, depth %d, type %d\n",
22447 vctxt->inode->localName), depth, nodeType);
22507 sto->history[sto->nbHistory++] = depth;
22511 vctxt->depth);
22638 int depth)
22653 "IDC: BACK on %s, depth %d\n",
22655 vctxt->inode->localName), vctxt->depth);
22679 * Only matches at the current depth are of interest.
22681 if (matchDepth != depth) {
22746 * by the target node's depth relative to the matcher's
22747 * depth of creation (i.e. the depth of the scope element).
22749 * Element Depth Pos List-entries
22756 * The size of the list is only dependant on the depth of
22761 pos = sto->depth - matcher->depth;
22905 pos = depth - matcher->depth;
23101 * Deregister state objects if they reach the depth of creation.
23103 if ((sto->nbHistory == 0) && (sto->depth == depth)) {
23156 "IDC: REGISTER on %s, depth %d\n",
23158 vctxt->inode->localName), vctxt->depth);
23171 * depth at which the bubbles should stop; this will be
23172 * the depth of the top-most keyref IDC. If no keyref
23198 (vctxt->depth < aidc->keyrefDepth))
23199 aidc->keyrefDepth = vctxt->depth;
23243 matcher->depth = vctxt->depth;
23288 (matcher->aidc->keyrefDepth > vctxt->depth)))
23448 * @depth: the current tree depth
23450 * Merges IDC bindings of an element at @depth into the corresponding IDC
23472 parTable = &(vctxt->elemInfos[vctxt->depth -1]->idcTable);
23489 (aidc->keyrefDepth >= vctxt->depth)) {
24049 * the currect tree depth.
24058 if (vctxt->depth > vctxt->sizeElemInfos) {
24060 "inconsistent depth encountered");
24073 } else if (vctxt->sizeElemInfos <= vctxt->depth) {
24092 info = vctxt->elemInfos[vctxt->depth];
24102 vctxt->elemInfos[vctxt->depth] = info;
24112 info->depth = vctxt->depth;
24118 #define ACTIVATE_ELEM vctxt->inode = vctxt->elemInfos[vctxt->depth];
24119 #define ACTIVATE_PARENT_ELEM vctxt->inode = vctxt->elemInfos[vctxt->depth -1];
25423 xmlSchemaNodeInfoPtr ielem = vctxt->elemInfos[vctxt->depth];
25693 vctxt->depth +1) == -1) {
25992 vctxt->skipDepth = vctxt->depth -1;
26324 if (vctxt->depth < 0) {
26328 if (vctxt->depth == vctxt->skipDepth)
26334 (xmlSchemaXPathProcessHistory(vctxt, vctxt->depth) == -1))
26374 if ((vctxt->depth > 0) &&
26393 if (vctxt->depth == 0) {
26394 vctxt->depth--;
26404 if (aidc->keyrefDepth == vctxt->depth) {
26407 * depth, this means that we are leaving the scope of the
26415 vctxt->depth--;
26416 vctxt->inode = vctxt->elemInfos[vctxt->depth];
26439 if (vctxt->depth <= 0) {
26444 pielem = vctxt->elemInfos[vctxt->depth -1];
26648 vctxt->skipDepth = vctxt->depth;
26792 (vctxt->depth >= vctxt->skipDepth)) {
26821 if (vctxt->depth > 0) {
26835 if (vctxt->depth == vctxt->skipDepth)
26878 vctxt->skipDepth = vctxt->depth;
26968 vctxt->skipDepth = vctxt->depth;
26979 int depth, nodeType, ret = 0, consumed;
26982 vctxt->depth = -1;
26998 depth = xmlTextReaderDepth(vctxt->reader);
27003 vctxt->depth++;
27079 if (vctxt->depth == vctxt->skipDepth) {
27087 while ((ret == 1) && (curDepth != depth)) {
27121 if (vctxt->depth >= 0)
27183 if (vctxt->depth < 0)
27185 if ((vctxt->skipDepth != -1) && (vctxt->depth >= vctxt->skipDepth))
27208 if (vctxt->depth < 0)
27210 if ((vctxt->skipDepth != -1) && (vctxt->depth >= vctxt->skipDepth))
27229 if (vctxt->depth < 0)
27231 if ((vctxt->skipDepth != -1) && (vctxt->depth >= vctxt->skipDepth))
27259 vctxt->depth++;
27260 if ((vctxt->skipDepth != -1) && (vctxt->depth >= vctxt->skipDepth))
27389 if (vctxt->depth > vctxt->skipDepth) {
27390 vctxt->depth--;
27800 vctxt->depth = -1;
27804 if ((vctxt->skipDepth != -1) && (vctxt->depth >= vctxt->skipDepth))
27811 vctxt->depth++;
27868 (vctxt->depth >= vctxt->skipDepth))
27955 vctxt->depth = -1;
