HomeSort by relevance Sort by last modified time
    Searched full:nodenr (Results 1 - 25 of 52) sorted by null

1 2 3

  /external/chromium_org/third_party/libxslt/libexslt/
dynamic.c 164 if (nodeset && nodeset->nodeNr > 0) {
166 ctxt->context->contextSize = nodeset->nodeNr;
168 for (i = 0; i < nodeset->nodeNr; i++) {
180 for (j = 0; j < subResult->nodesetval->nodeNr;
math.c 45 if ((ns == NULL) || (ns->nodeNr == 0))
50 for (i = 1; i < ns->nodeNr; i++) {
114 if ((ns == NULL) || (ns->nodeNr == 0))
119 for (i = 1; i < ns->nodeNr; i++) {
182 if ((ns == NULL) || (ns->nodeNr == 0))
191 for (i = 1; i < ns->nodeNr; i++) {
262 if ((ns == NULL) || (ns->nodeNr == 0))
271 for (i = 1; i < ns->nodeNr; i++) {
saxon.c 221 if ((nodelist == NULL) || (nodelist->nodeNr <= 0)) {
227 for (i = 1;i < nodelist->nodeNr;i++) {
strings.c 493 for (i = 0; i < obj->nodesetval->nodeNr; i++) {
594 for (i = 0; i < searchSet->nodeNr; i++) {
599 if (i < replaceSet->nodeNr) {
  /external/chromium_org/third_party/libxml/src/
xpath.c 937 fprintf(output, "Set contains %d nodes:\n", cur->nodeNr);
938 for (i = 0;i < cur->nodeNr;i++) {
955 if ((cur == NULL) || (cur->nodeNr == 0) || (cur->nodeTab[0] == NULL)) {
    [all...]
testC14N.c 335 for(i = 0; i < nodes->nodeNr; ++i) {
xpointer.c 558 if (end->nodesetval->nodeNr <= 0)
585 ret->user2 = end->nodesetval->nodeTab[end->nodesetval->nodeNr - 1];
838 for (i = 0;i < set->nodeNr;i++)
929 if ((indx <= 0) || (oldset == NULL) || (oldset->nodeNr != 1)) {
1172 if ((loc != NULL) && (loc->nodeNr > 0))
    [all...]
valid.c 450 if (ctxt->nodeNr >= ctxt->nodeMax) {
461 ctxt->nodeTab[ctxt->nodeNr] = value;
463 return (ctxt->nodeNr++);
470 if (ctxt->nodeNr <= 0)
472 ctxt->nodeNr--;
473 if (ctxt->nodeNr > 0)
474 ctxt->node = ctxt->nodeTab[ctxt->nodeNr - 1];
477 ret = ctxt->nodeTab[ctxt->nodeNr];
478 ctxt->nodeTab[ctxt->nodeNr] = NULL;
    [all...]
  /external/libxml2/
xpath.c 938 fprintf(output, "Set contains %d nodes:\n", cur->nodeNr);
939 for (i = 0;i < cur->nodeNr;i++) {
956 if ((cur == NULL) || (cur->nodeNr == 0) || (cur->nodeTab[0] == NULL)) {
    [all...]
xpointer.c 558 if (end->nodesetval->nodeNr <= 0)
585 ret->user2 = end->nodesetval->nodeTab[end->nodesetval->nodeNr - 1];
838 for (i = 0;i < set->nodeNr;i++)
929 if ((indx <= 0) || (oldset == NULL) || (oldset->nodeNr != 1)) {
1179 if ((loc != NULL) && (loc->nodeNr > 0))
    [all...]
valid.c 450 if (ctxt->nodeNr >= ctxt->nodeMax) {
461 ctxt->nodeTab[ctxt->nodeNr] = value;
463 return (ctxt->nodeNr++);
470 if (ctxt->nodeNr <= 0)
472 ctxt->nodeNr--;
473 if (ctxt->nodeNr > 0)
474 ctxt->node = ctxt->nodeTab[ctxt->nodeNr - 1];
477 ret = ctxt->nodeTab[ctxt->nodeNr];
478 ctxt->nodeTab[ctxt->nodeNr] = NULL;
    [all...]
  /external/chromium_org/third_party/libxml/src/include/libxml/
xpath.h 80 int nodeNr; /* number of nodes in the set */
408 #define xmlXPathNodeSetGetLength(ns) ((ns) ? (ns)->nodeNr : 0)
421 ((index) >= 0) && ((index) < (ns)->nodeNr)) ? \
433 (((ns) == NULL) || ((ns)->nodeNr == 0) || ((ns)->nodeTab == NULL))
xpathInternals.h 232 { while ((ns)->nodeNr > 0) (ns)->nodeTab[(ns)->nodeNr--] = NULL; }
valid.h 89 int nodeNr; /* Depth of the parsing stack */
  /external/libxml2/include/libxml/
xpath.h 81 int nodeNr; /* number of nodes in the set */
411 #define xmlXPathNodeSetGetLength(ns) ((ns) ? (ns)->nodeNr : 0)
424 ((index) >= 0) && ((index) < (ns)->nodeNr)) ? \
436 (((ns) == NULL) || ((ns)->nodeNr == 0) || ((ns)->nodeTab == NULL))
xpathInternals.h 232 { while ((ns)->nodeNr > 0) (ns)->nodeTab[(ns)->nodeNr--] = NULL; }
valid.h 89 int nodeNr; /* Depth of the parsing stack */
  /external/chromium_org/third_party/libxslt/libxslt/
functions.c 264 for (i = 0; i < obj->nodesetval->nodeNr; i++) {
306 (obj2->nodesetval->nodeNr > 0) &&
388 for (i = 0; i < obj2->nodesetval->nodeNr; i++) {
676 if ((nodelist == NULL) || (nodelist->nodeNr <= 0)) {
682 for (i = 1;i < nodelist->nodeNr;i++) {
keys.c 690 keyDef->match, matchList->nodeNr));
706 if ((matchList == NULL) || (matchList->nodeNr <= 0))
743 for (i = 0; i < matchList->nodeNr; i++) {
766 (useRes->nodesetval->nodeNr != 0))
768 len = useRes->nodesetval->nodeNr;
xsltutils.c 928 len = list->nodeNr;
983 if ((list == NULL) || (list->nodeNr <= 1))
986 len = list->nodeNr;
1111 if ((list == NULL) || (list->nodeNr <= 1))
1158 len = list->nodeNr;
    [all...]
  /external/libxslt/libxslt/
functions.c 264 for (i = 0; i < obj->nodesetval->nodeNr; i++) {
306 (obj2->nodesetval->nodeNr > 0) &&
388 for (i = 0; i < obj2->nodesetval->nodeNr; i++) {
675 if ((nodelist == NULL) || (nodelist->nodeNr <= 0)) {
681 for (i = 1;i < nodelist->nodeNr;i++) {
keys.c 690 keyDef->match, matchList->nodeNr));
706 if ((matchList == NULL) || (matchList->nodeNr <= 0))
743 for (i = 0; i < matchList->nodeNr; i++) {
766 (useRes->nodesetval->nodeNr != 0))
768 len = useRes->nodesetval->nodeNr;
xsltutils.c 928 len = list->nodeNr;
983 if ((list == NULL) || (list->nodeNr <= 1))
986 len = list->nodeNr;
1111 if ((list == NULL) || (list->nodeNr <= 1))
1158 len = list->nodeNr;
    [all...]
  /external/chromium_org/third_party/WebKit/Source/core/xml/
XSLTUnicodeSort.cpp 69 if ((list == NULL) || (list->nodeNr <= 1))
116 len = list->nodeNr;
  /external/qemu/
vl.c 1193 int nodenr; local
1198 nodenr = nb_numa_nodes;
1200 nodenr = strtoull(option, NULL, 10);
1204 node_mem[nodenr] = 0;
1215 node_mem[nodenr] = value;
1218 node_cpumask[nodenr] = 0;
1237 node_cpumask[nodenr] = value;
    [all...]

Completed in 623 milliseconds

1 2 3