Lines Matching refs:subtree
65 fRoot.fChild.subtree = allocateNode(0);
66 fRoot.fChild.subtree->fNumChildren = 0;
70 Branch* newSibling = insert(fRoot.fChild.subtree, &newBranch);
71 fRoot.fBounds = this->computeBounds(fRoot.fChild.subtree);
74 Node* oldRoot = fRoot.fChild.subtree;
79 fRoot.fChild.subtree = newRoot;
80 fRoot.fBounds = this->computeBounds(fRoot.fChild.subtree);
92 fRoot.fChild.subtree = allocateNode(0);
93 fRoot.fChild.subtree->fNumChildren = 0;
94 this->insert(fRoot.fChild.subtree, &fDeferredInserts[0]);
113 this->search(fRoot.fChild.subtree, query, results);
137 toInsert = this->insert(root->child(childIndex)->fChild.subtree, branch, level);
139 root->child(childIndex)->fChild.subtree);
166 branch->fChild.subtree = newSibling;
188 // break ties in favor of subtree with smallest area
313 this->search(root->child(i)->fChild.subtree, query, results);
378 b.fChild.subtree = n;
400 SkASSERT(fCount == (size_t)this->validateSubtree(fRoot.fChild.subtree, fRoot.fBounds, true));
409 // If the root of this subtree is the overall root, we have looser standards:
429 SkASSERT(root->child(i)->fChild.subtree->fLevel == root->fLevel - 1);
430 childCount += this->validateSubtree(root->child(i)->fChild.subtree,
