Searched refs:childB (Results 1 – 1 of 1) sorted by relevance
502 Node* childB = containerB; in compareBoundaryPoints() local503 while (childB && childB->parentNode() != commonAncestor) in compareBoundaryPoints()504 childB = childB->parentNode(); in compareBoundaryPoints()505 if (!childB) in compareBoundaryPoints()506 childB = commonAncestor; in compareBoundaryPoints()508 if (childA == childB) in compareBoundaryPoints()515 if (n == childB) in compareBoundaryPoints()