Searched refs:fMinChildren (Results 1 - 5 of 5) sorted by relevance

/external/chromium_org/third_party/skia/src/core/
H A DSkRTree.cpp30 : fMinChildren(minChildren)
272 for (int32_t k = 1; k <= fMaxChildren - 2 * fMinChildren + 2; ++k) {
274 SkIRect r2 = children[fMinChildren + k - 1].fBounds;
275 for (int32_t l = 1; l < fMinChildren - 1 + k; ++l) {
278 for (int32_t l = fMinChildren + k; l < fMaxChildren + 1; ++l) {
309 return fMinChildren - 1 + k;
348 if (remainder >= fMinChildren) {
351 remainder = fMinChildren - remainder;
366 (fMaxChildren - fMinChildren) * numTiles);
379 if (remainder <= fMaxChildren - fMinChildren) {
[all...]
H A DSkRTree.h115 * A node in the tree, has between fMinChildren and fMaxChildren (the root is a special case)
183 const int fMinChildren; member in class:SkRTree
/external/skia/src/core/
H A DSkRTree.cpp30 : fMinChildren(minChildren)
265 for (int32_t k = 1; k <= fMaxChildren - 2 * fMinChildren + 2; ++k) {
267 SkIRect r2 = children[fMinChildren + k - 1].fBounds;
268 for (int32_t l = 1; l < fMinChildren - 1 + k; ++l) {
271 for (int32_t l = fMinChildren + k; l < fMaxChildren + 1; ++l) {
302 return fMinChildren - 1 + k;
341 if (remainder >= fMinChildren) {
344 remainder = fMinChildren - remainder;
359 (fMaxChildren - fMinChildren) * numTiles);
372 if (remainder <= fMaxChildren - fMinChildren) {
[all...]
H A DSkRTree.h115 * A node in the tree, has between fMinChildren and fMaxChildren (the root is a special case)
183 const int fMinChildren; member in class:SkRTree
H A DSkImageFilter.cpp382 explicit CacheImpl(int minChildren) : fMinChildren(minChildren) {}
403 int fMinChildren; member in class:CacheImpl
425 if (key->getRefCnt() >= fMinChildren) {

Completed in 99 milliseconds