Searched refs:childB (Results 1 – 1 of 1) sorted by relevance
427 Node* childB = containerB; in compareBoundaryPoints() local428 while (childB && childB->parentNode() != commonAncestor) in compareBoundaryPoints()429 childB = childB->parentNode(); in compareBoundaryPoints()430 if (!childB) in compareBoundaryPoints()431 childB = commonAncestor; in compareBoundaryPoints()433 if (childA == childB) in compareBoundaryPoints()440 if (n == childB) in compareBoundaryPoints()