Searched refs:nodeTab (Results 1 - 25 of 25) sorted by relevance

/haiku-fatelf/src/tools/docbook/libxslt/libexslt/
H A Dmath.c47 ret = xmlXPathCastNodeToNumber(ns->nodeTab[0]);
51 cur = xmlXPathCastNodeToNumber(ns->nodeTab[i]);
116 ret = xmlXPathCastNodeToNumber(ns->nodeTab[0]);
120 cur = xmlXPathCastNodeToNumber(ns->nodeTab[i]);
185 max = xmlXPathCastNodeToNumber(ns->nodeTab[0]);
189 xmlXPathNodeSetAddUnique(ret, ns->nodeTab[0]);
192 cur = xmlXPathCastNodeToNumber(ns->nodeTab[i]);
202 xmlXPathNodeSetAddUnique(ret, ns->nodeTab[i]);
205 xmlXPathNodeSetAddUnique(ret, ns->nodeTab[i]);
265 min = xmlXPathCastNodeToNumber(ns->nodeTab[
[all...]
H A Dsaxon.c226 cur = nodelist->nodeTab[0];
228 int ret = xmlXPathCmpNodes(cur, nodelist->nodeTab[i]);
230 cur = nodelist->nodeTab[i];
H A Ddynamic.c162 ctxt->context->node = nodeset->nodeTab[i];
163 ctxt->context->doc = nodeset->nodeTab[i]->doc;
174 nodeTab[j]);
H A Dstrings.c484 tmp = xmlXPathCastNodeToString(obj->nodesetval->nodeTab[i]);
H A Ddate.c2814 tmp = xmlXPathCastNodeToString (ns->nodeTab[i]);
/haiku-fatelf/src/tools/docbook/libxml2/
H A Dxpath.c943 xmlXPathDebugDumpNode(output, cur->nodeTab[i], depth + 1);
957 if ((cur == NULL) || (cur->nodeNr == 0) || (cur->nodeTab[0] == NULL)) {
966 xmlXPathDebugDumpNodeList(output, cur->nodeTab[0]->children, depth + 1);
1827 if (obj->nodesetval->nodeTab != NULL)
1828 xmlFree(obj->nodesetval->nodeTab);
2034 ret->nodesetval->nodeTab[0] = val;
3283 if (xmlXPathCmpNodesExt(set->nodeTab[j],
3284 set->nodeTab[j + incr]) == -1)
3286 if (xmlXPathCmpNodes(set->nodeTab[j],
3287 set->nodeTab[
[all...]
H A Dc14n.c48 xmlNodePtr *nodeTab; /* array of nodes in no particular order */ member in struct:_xmlC14NVisibleNsStack
297 if(cur->nodeTab != NULL) {
298 memset(cur->nodeTab, 0, cur->nsMax * sizeof(xmlNodePtr));
299 xmlFree(cur->nodeTab);
309 ((cur->nsTab == NULL) && (cur->nodeTab != NULL)) ||
310 ((cur->nsTab != NULL) && (cur->nodeTab == NULL))) {
315 if ((cur->nsTab == NULL) && (cur->nodeTab == NULL)) {
317 cur->nodeTab = (xmlNodePtr*) xmlMalloc(XML_NAMESPACES_DEFAULT * sizeof(xmlNodePtr));
318 if ((cur->nsTab == NULL) || (cur->nodeTab == NULL)) {
323 memset(cur->nodeTab,
[all...]
H A Dxinclude.c1109 if (set->nodeTab[i] == NULL)
1111 switch (set->nodeTab[i]->type) {
1127 xmlNodePtr tmp, cur = set->nodeTab[i];
1169 set->nodeTab[i]);
1173 set->nodeTab[i]));
1594 if (set->nodeTab[i] == NULL)
1596 switch (set->nodeTab[i]->type) {
1611 xmlNodePtr el = set->nodeTab[i];
1627 set->nodeTab[i] = NULL;
1634 set->nodeTab[
[all...]
H A Dxpointer.c585 ret->user2 = end->nodesetval->nodeTab[end->nodesetval->nodeNr - 1];
840 xmlXPtrNewCollapsedRange(set->nodeTab[i]));
934 cur = xmlXPtrGetNthChild(oldset->nodeTab[0], indx);
940 oldset->nodeTab[0] = cur;
1399 (set->nodeTab[0] != (xmlNodePtr) ctx->doc))
1614 if (set->nodeTab[i] == NULL)
1616 switch (set->nodeTab[i]->type) {
1644 list = last = xmlCopyNode(set->nodeTab[i], 1);
1646 xmlAddNextSibling(last, xmlCopyNode(set->nodeTab[i], 1));
2251 ctxt->context->node = oldset->nodeTab[
[all...]
H A DparserInternals.c1563 if (ctxt->nodeTab == NULL) {
1564 ctxt->nodeTab = (xmlNodePtr *) xmlMalloc(10 * sizeof(xmlNodePtr));
1567 if (ctxt->nodeTab == NULL) {
1683 if (ctxt->nodeTab != NULL) xmlFree(ctxt->nodeTab);
1697 if (ctxt->vctxt.nodeTab != NULL) xmlFree(ctxt->vctxt.nodeTab);
H A Dvalid.c426 ctxt->nodeTab =
428 sizeof(ctxt->nodeTab[0]));
429 if (ctxt->nodeTab == NULL) {
437 tmp = (xmlNodePtr *) xmlRealloc(ctxt->nodeTab,
438 ctxt->nodeMax * 2 * sizeof(ctxt->nodeTab[0]));
444 ctxt->nodeTab = tmp;
446 ctxt->nodeTab[ctxt->nodeNr] = value;
459 ctxt->node = ctxt->nodeTab[ctxt->nodeNr - 1];
462 ret = ctxt->nodeTab[ctxt->nodeNr];
463 ctxt->nodeTab[ctx
[all...]
H A Drunsuite.c271 (res->nodesetval->nodeTab != NULL))
272 ret = res->nodesetval->nodeTab[0];
H A DdebugXML.c1940 list->nodesetval->nodeTab[indx]);
3032 nodeTab[indx], NULL);
3036 nodeTab[indx], NULL);
3102 ctxt->node = list->nodesetval->nodeTab[0];
3194 nodeTab[indx], NULL);
H A Dparser.c1245 tmp = (xmlNodePtr *) xmlRealloc(ctxt->nodeTab,
1247 sizeof(ctxt->nodeTab[0]));
1252 ctxt->nodeTab = tmp;
1262 ctxt->nodeTab[ctxt->nodeNr] = value;
1284 ctxt->node = ctxt->nodeTab[ctxt->nodeNr - 1];
1287 ret = ctxt->nodeTab[ctxt->nodeNr];
1288 ctxt->nodeTab[ctxt->nodeNr] = NULL;
11131 ctxt->vctxt.nodeTab = NULL;
H A Dschematron.c1245 node = ret->nodesetval->nodeTab[0];
H A DHTMLparser.c4186 ctxt->nodeTab = (htmlNodePtr *) xmlMalloc(10 * sizeof(htmlNodePtr));
4187 if (ctxt->nodeTab == NULL) {
H A Dxmlreader.c1277 reader->node = reader->ctxt->nodeTab[0];
/haiku-fatelf/src/tools/docbook/libxml2/include/libxml/
H A Dxpath.h82 xmlNodePtr *nodeTab; /* array of nodes in no particular order */ member in struct:_xmlNodeSet
418 (ns)->nodeTab[(index)] \
429 (((ns) == NULL) || ((ns)->nodeNr == 0) || ((ns)->nodeTab == NULL))
H A Dvalid.h91 xmlNodePtr *nodeTab; /* array of nodes */ member in struct:_xmlValidCtxt
H A Dparser.h205 xmlNodePtr *nodeTab; /* array of nodes */ member in struct:_xmlParserCtxt
H A DxpathInternals.h232 { while ((ns)->nodeNr > 0) (ns)->nodeTab[(ns)->nodeNr--] = NULL; }
/haiku-fatelf/src/tools/docbook/libxslt/libxslt/
H A Dfunctions.c262 xmlXPathNewNodeSet(obj->nodesetval->nodeTab[i]));
269 nodeTab[i]));
303 IS_XSLT_REAL_NODE(obj2->nodesetval->nodeTab[0])) {
306 target = obj2->nodesetval->nodeTab[0];
387 xmlXPathNewNodeSet(obj2->nodesetval->nodeTab[i]));
624 cur = nodelist->nodeTab[0];
626 ret = xmlXPathCmpNodes(cur, nodelist->nodeTab[i]);
628 cur = nodelist->nodeTab[i];
H A Dtransform.c3899 cur = list->nodeTab[i];
3923 * TODO: Is list->nodeTab[0] is an xmlDocPtr?
3926 if ((list != NULL) && (list->nodeTab != NULL) &&
3927 (list->nodeTab[0] != NULL) &&
3928 (IS_XSLT_REAL_NODE(list->nodeTab[0])))
3930 xsltCopyTreeList(ctxt, list->nodeTab[0]->children,
4308 (list->nodeTab[0]->doc != NULL) &&
4310 XSLT_IS_RES_TREE_FRAG(list->nodeTab[0]->doc) &&
4312 (list->nodeTab[0]->doc->_private == NULL)) {
4313 list->nodeTab[
[all...]
H A Dxsltutils.c918 tst = xmlXPathCmpNodes(list->nodeTab[i], list->nodeTab[j]);
920 node = list->nodeTab[i];
921 list->nodeTab[i] = list->nodeTab[j];
922 list->nodeTab[j] = node;
993 ctxt->node = list->nodeTab[i];
1256 node = list->nodeTab[j];
1257 list->nodeTab[j] = list->nodeTab[
[all...]
H A Dpattern.c530 if (list->nodesetval->nodeTab[j] == node) {
779 if (list->nodeTab[indx] == node)

Completed in 229 milliseconds