23     SkTDArray<Branch> branches;  in insert()  local
24     branches.setReserve(N);  in insert()
32         Branch* b = branches.push();  in insert()
37     fCount = branches.count();  in insert()
43             n->fChildren[0] = branches[0];  in insert()
45             fRoot.fBounds  = branches[0].fBounds;  in insert()
48             fRoot = this->bulkLoad(&branches);  in insert()
63 int SkRTree::CountNodes(int branches, SkScalar aspectRatio) {  in CountNodes()  argument
64     if (branches == 1) {  in CountNodes()
67     int numBranches = branches / kMaxChildren;  in CountNodes()
68     int remainder   = branches % kMaxChildren;  in CountNodes()
82         for (int j = 0; j < numTiles && currentBranch < branches; ++j) {  in CountNodes()
95             for (int k = 1; k < incrementBy && currentBranch < branches; ++k) {  in CountNodes()
103 SkRTree::Branch SkRTree::bulkLoad(SkTDArray<Branch>* branches, int level) {  in bulkLoad()  argument
104     if (branches->count() == 1) { // Only one branch.  It will be the root.  in bulkLoad()
105         return (*branches)[0];  in bulkLoad()
111     int numBranches = branches->count() / kMaxChildren;  in bulkLoad()
112     int remainder   = branches->count() % kMaxChildren;  in bulkLoad()
131         for (int j = 0; j < numTiles && currentBranch < branches->count(); ++j) {  in bulkLoad()
145             n->fChildren[0] = (*branches)[currentBranch];  in bulkLoad()
147             b.fBounds = (*branches)[currentBranch].fBounds;  in bulkLoad()
150             for (int k = 1; k < incrementBy && currentBranch < branches->count(); ++k) {  in bulkLoad()
151                 b.fBounds.join((*branches)[currentBranch].fBounds);  in bulkLoad()
152                 n->fChildren[k] = (*branches)[currentBranch];  in bulkLoad()
156             (*branches)[newBranches] = b;  in bulkLoad()
160     branches->setCount(newBranches);  in bulkLoad()
161     return this->bulkLoad(branches, level + 1);  in bulkLoad()