Lines Matching full:node1
141 * @node1: the first node
151 xmlXPathCmpNodesExt(xmlNodePtr node1, xmlNodePtr node2) {
158 if ((node1 == NULL) || (node2 == NULL))
161 if (node1 == node2)
167 switch (node1->type) {
170 if ((0 > (long) node1->content) && /* TODO: Would a != 0 suffice here? */
172 (node1->doc == node2->doc))
174 l1 = -((long) node1->content);
186 miscNode1 = node1;
187 node1 = node1->parent;
194 miscNode1 = node1;
198 if (node1->prev != NULL) {
200 node1 = node1->prev;
201 if (node1->type == XML_ELEMENT_NODE) {
205 if (node1->prev == NULL) {
211 node1 = node1->parent;
217 node1 = node1->parent;
219 if ((node1 == NULL) || (node1->type != XML_ELEMENT_NODE) ||
220 (0 <= (long) node1->content)) {
224 node1 = miscNode1;
284 if (node1 == node2) {
315 * <node1>Text-1(precedence1 == 2)</node1>
321 cur = node1->parent;
331 if (cur == node1)
341 if ((node1->type == XML_ELEMENT_NODE) &&
343 (0 > (long) node1->content) &&
345 (node1->doc == node2->doc)) {
347 l1 = -((long) node1->content);
357 if (node1 == node2->prev)
359 if (node1 == node2->next)
365 if (cur->parent == node1)
370 for (depth1 = 0, cur = node1; cur->parent != NULL; cur = cur->parent) {
386 node1 = node1->parent;
392 while (node1->parent != node2->parent) {
393 node1 = node1->parent;
396 if ((node1 == NULL) || (node2 == NULL))
402 if (node1 == node2->prev)
404 if (node1 == node2->next)
409 if ((node1->type == XML_ELEMENT_NODE) &&
411 (0 > (long) node1->content) &&
413 (node1->doc == node2->doc)) {
415 l1 = -((long) node1->content);
423 for (cur = node1->next;cur != NULL;cur = cur->next)
3265 * @node1: the first node
3274 xmlXPathCmpNodes(xmlNodePtr node1, xmlNodePtr node2) {
3280 if ((node1 == NULL) || (node2 == NULL))
3285 if (node1 == node2) /* trivial case */
3287 if (node1->type == XML_ATTRIBUTE_NODE) {
3289 attrNode1 = node1;
3290 node1 = node1->parent;
3297 if (node1 == node2) {
3315 if ((node1->type == XML_NAMESPACE_DECL) ||
3318 if (node1 == node2->prev)
3320 if (node1 == node2->next)
3326 if ((node1->type == XML_ELEMENT_NODE) &&
3328 (0 > (long) node1->content) &&
3330 (node1->doc == node2->doc)) {
3333 l1 = -((long) node1->content);
3345 if (cur == node1)
3350 for (depth1 = 0, cur = node1;cur->parent != NULL;cur = cur->parent) {
3366 node1 = node1->parent;
3372 while (node1->parent != node2->parent) {
3373 node1 = node1->parent;
3376 if ((node1 == NULL) || (node2 == NULL))
3382 if (node1 == node2->prev)
3384 if (node1 == node2->next)
3389 if ((node1->type == XML_ELEMENT_NODE) &&
3391 (0 > (long) node1->content) &&
3393 (node1->doc == node2->doc)) {
3396 l1 = -((long) node1->content);
3404 for (cur = node1->next;cur != NULL;cur = cur->next)
