Lines Matching refs:comp
80 if ((c)->comp->dict) \
81 r = (xmlChar *) xmlDictLookup((c)->comp->dict, BAD_CAST nsname, -1); \
84 #define XML_PAT_FREE_STRING(c, r) if ((c)->comp->dict == NULL) xmlFree(r);
107 xmlStreamCompPtr comp; /* the compiled stream */
116 static void xmlFreeStreamComp(xmlStreamCompPtr comp);
180 xmlPatternPtr comp; /* the result */
223 * @comp: an XSLT comp
225 * Free up the memory allocated by @comp
228 xmlFreePattern(xmlPatternPtr comp) {
232 if (comp == NULL)
234 if (comp->next != NULL)
235 xmlFreePattern(comp->next);
236 if (comp->stream != NULL)
237 xmlFreeStreamComp(comp->stream);
238 if (comp->pattern != NULL)
239 xmlFree((xmlChar *)comp->pattern);
240 if (comp->steps != NULL) {
241 if (comp->dict == NULL) {
242 for (i = 0;i < comp->nbStep;i++) {
243 op = &comp->steps[i];
250 xmlFree(comp->steps);
252 if (comp->dict != NULL)
253 xmlDictFree(comp->dict);
255 memset(comp, -1, sizeof(xmlPattern));
256 xmlFree(comp);
261 * @comp: an XSLT comp list
263 * Free up the memory allocated by all the elements of @comp
266 xmlFreePatternList(xmlPatternPtr comp) {
269 while (comp != NULL) {
270 cur = comp;
271 comp = comp->next;
333 * @comp: the compiled match expression
344 xmlPatternPtr comp,
347 if (comp->nbStep >= comp->maxStep) {
349 temp = (xmlStepOpPtr) xmlRealloc(comp->steps, comp->maxStep * 2 *
356 comp->steps = temp;
357 comp->maxStep *= 2;
359 comp->steps[comp->nbStep].op = op;
360 comp->steps[comp->nbStep].value = value;
361 comp->steps[comp->nbStep].value2 = value2;
362 comp->nbStep++;
369 * @comp: the compiled match expression
374 xsltSwapTopPattern(xmlPatternPtr comp) {
376 int j = comp->nbStep - 1;
382 tmp = comp->steps[i].value;
383 comp->steps[i].value = comp->steps[j].value;
384 comp->steps[j].value = tmp;
385 tmp = comp->steps[i].value2;
386 comp->steps[i].value2 = comp->steps[j].value2;
387 comp->steps[j].value2 = tmp;
388 op = comp->steps[i].op;
389 comp->steps[i].op = comp->steps[j].op;
390 comp->steps[j].op = op;
397 * @comp: the compiled match expression
404 xmlReversePattern(xmlPatternPtr comp) {
410 if ((comp->nbStep > 0) && (comp->steps[0].op == XML_OP_ANCESTOR)) {
411 for (i = 0, j = 1;j < comp->nbStep;i++,j++) {
412 comp->steps[i].value = comp->steps[j].value;
413 comp->steps[i].value2 = comp->steps[j].value2;
414 comp->steps[i].op = comp->steps[j].op;
416 comp->nbStep--;
418 if (comp->nbStep >= comp->maxStep) {
420 temp = (xmlStepOpPtr) xmlRealloc(comp->steps, comp->maxStep * 2 *
427 comp->steps = temp;
428 comp->maxStep *= 2;
431 j = comp->nbStep - 1;
435 tmp = comp->steps[i].value;
436 comp->steps[i].value = comp->steps[j].value;
437 comp->steps[j].value = tmp;
438 tmp = comp->steps[i].value2;
439 comp->steps[i].value2 = comp->steps[j].value2;
440 comp->steps[j].value2 = tmp;
441 op = comp->steps[i].op;
442 comp->steps[i].op = comp->steps[j].op;
443 comp->steps[j].op = op;
447 comp->steps[comp->nbStep].value = NULL;
448 comp->steps[comp->nbStep].value2 = NULL;
449 comp->steps[comp->nbStep++].op = XML_OP_END;
486 * @comp: the precompiled pattern
494 xmlPatMatch(xmlPatternPtr comp, xmlNodePtr node) {
499 if ((comp == NULL) || (node == NULL)) return(-1);
502 for (;i < comp->nbStep;i++) {
503 step = &comp->steps[i];
615 step = &comp->steps[i];
726 if (xmlPatternAdd(ctxt, ctxt->comp, (op), (val), (val2))) goto error;
1028 if (XML_STREAM_XS_IDC_SEL(ctxt->comp)) {
1179 if (XML_STREAM_XS_IDC_SEL(ctxt->comp)) {
1229 ctxt->comp->flags |= PAT_FROM_ROOT;
1230 } else if ((CUR == '.') || (ctxt->comp->flags & XML_PATTERN_NOTPATTERN)) {
1231 ctxt->comp->flags |= PAT_FROM_CUR;
1331 ctxt->comp->flags |= PAT_FROM_CUR;
1467 if (ctxt->comp->steps[ctxt->states[2 * i]].flags &
1512 * @comp: the compiled pattern for streaming
1517 xmlFreeStreamComp(xmlStreamCompPtr comp) {
1518 if (comp != NULL) {
1519 if (comp->steps != NULL)
1520 xmlFree(comp->steps);
1521 if (comp->dict != NULL)
1522 xmlDictFree(comp->dict);
1523 xmlFree(comp);
1529 * @comp: the compiled pattern for streaming
1539 xmlStreamCompAddStep(xmlStreamCompPtr comp, const xmlChar *name,
1543 if (comp->nbStep >= comp->maxStep) {
1544 cur = (xmlStreamStepPtr) xmlRealloc(comp->steps,
1545 comp->maxStep * 2 * sizeof(xmlStreamStep));
1551 comp->steps = cur;
1552 comp->maxStep *= 2;
1554 cur = &comp->steps[comp->nbStep++];
1559 return(comp->nbStep - 1);
1564 * @comp: the precompiled pattern
1571 xmlStreamCompile(xmlPatternPtr comp) {
1576 if ((comp == NULL) || (comp->steps == NULL))
1581 if ((comp->nbStep == 1) &&
1582 (comp->steps[0].op == XML_OP_ELEM) &&
1583 (comp->steps[0].value == NULL) &&
1584 (comp->steps[0].value2 == NULL)) {
1590 comp->stream = stream;
1594 stream = xmlNewStreamComp((comp->nbStep / 2) + 1);
1597 if (comp->dict != NULL) {
1598 stream->dict = comp->dict;
1603 if (comp->flags & PAT_FROM_ROOT)
1606 for (;i < comp->nbStep;i++) {
1607 step = comp->steps[i];
1643 if ((comp->nbStep == i + 1) &&
1649 if (comp->nbStep == i + 1) {
1715 if ((! root) && (comp->flags & XML_PATTERN_NOTPATTERN) == 0) {
1737 comp->stream = stream;
1773 cur->comp = stream;
1799 * @comp: the stream context
1807 xmlStreamCtxtAddState(xmlStreamCtxtPtr comp, int idx, int level) {
1809 for (i = 0;i < comp->nbState;i++) {
1810 if (comp->states[2 * i] < 0) {
1811 comp->states[2 * i] = idx;
1812 comp->states[2 * i + 1] = level;
1816 if (comp->nbState >= comp->maxState) {
1819 cur = (int *) xmlRealloc(comp->states,
1820 comp->maxState * 4 * sizeof(int));
1826 comp->states = cur;
1827 comp->maxState *= 2;
1829 comp->states[2 * comp->nbState] = idx;
1830 comp->states[2 * comp->nbState++ + 1] = level;
1831 return(comp->nbState - 1);
1855 xmlStreamCompPtr comp;
1865 comp = stream->comp;
1873 if (comp->flags & XML_STREAM_FROM_ROOT) {
1874 if (comp->nbStep == 0) {
1878 if ((comp->nbStep == 1) &&
1879 (comp->steps[0].nodeType == XML_STREAM_ANY_NODE) &&
1880 (comp->steps[0].flags & XML_STREAM_STEP_DESC))
1887 } else if (comp->steps[0].flags & XML_STREAM_STEP_ROOT) {
1902 if (comp->nbStep == 0) {
1934 ((comp->flags & XML_STREAM_FINAL_IS_ANY_NODE) == 0)) {
1950 if ((comp->flags & XML_STREAM_DESC) == 0) {
1985 desc = comp->steps[stepNr].flags & XML_STREAM_STEP_DESC;
1992 step = comp->steps[stepNr];
1998 if ((comp->flags & XML_STREAM_DESC) == 0)
2032 } else if (comp->dict) {
2068 if (((comp->flags & XML_STREAM_DESC) == 0) &&
2088 step = comp->steps[0];
2172 if (((comp->flags & XML_STREAM_DESC) == 0) &&
2323 if (streamCtxt->comp->flags & XML_STREAM_FINAL_IS_ANY_NODE)
2391 ctxt->comp = cur;
2445 * @comp: the precompiled pattern
2453 xmlPatternMatch(xmlPatternPtr comp, xmlNodePtr node)
2457 if ((comp == NULL) || (node == NULL))
2460 while (comp != NULL) {
2461 ret = xmlPatMatch(comp, node);
2464 comp = comp->next;
2471 * @comp: the precompiled pattern
2479 xmlPatternGetStreamCtxt(xmlPatternPtr comp)
2483 if ((comp == NULL) || (comp->stream == NULL))
2486 while (comp != NULL) {
2487 if (comp->stream == NULL)
2489 cur = xmlNewStreamCtxt(comp->stream);
2498 cur->flags = comp->flags;
2499 comp = comp->next;
2509 * @comp: the precompiled pattern
2517 xmlPatternStreamable(xmlPatternPtr comp) {
2518 if (comp == NULL)
2520 while (comp != NULL) {
2521 if (comp->stream == NULL)
2523 comp = comp->next;
2530 * @comp: the precompiled pattern
2538 xmlPatternMaxDepth(xmlPatternPtr comp) {
2540 if (comp == NULL)
2542 while (comp != NULL) {
2543 if (comp->stream == NULL)
2545 for (i = 0;i < comp->stream->nbStep;i++)
2546 if (comp->stream->steps[i].flags & XML_STREAM_STEP_DESC)
2548 if (comp->stream->nbStep > ret)
2549 ret = comp->stream->nbStep;
2550 comp = comp->next;
2557 * @comp: the precompiled pattern
2566 xmlPatternMinDepth(xmlPatternPtr comp) {
2568 if (comp == NULL)
2570 while (comp != NULL) {
2571 if (comp->stream == NULL)
2573 if (comp->stream->nbStep < ret)
2574 ret = comp->stream->nbStep;
2577 comp = comp->next;
2584 * @comp: the precompiled pattern
2591 xmlPatternFromRoot(xmlPatternPtr comp) {
2592 if (comp == NULL)
2594 while (comp != NULL) {
2595 if (comp->stream == NULL)
2597 if (comp->flags & PAT_FROM_ROOT)
2599 comp = comp->next;