Searched refs:fCopies (Results 1 – 3 of 3) sorted by relevance
38 int max = fCopies.count() << 5; in ~SkGroup()81 return (fCopies[index >> 5] & 1 << (index & 0x1f)) != 0; in copySet()231 fCopies[index >> 5] &= ~(1 << (index & 0x1f)); in markCopyClear()237 fCopies[index >> 5] |= 1 << (index & 0x1f); in markCopySet()243 int oldLongs = fCopies.count(); in markCopySize()246 fCopies.setCount(newLongs); in markCopySize()247 memset(&fCopies[oldLongs], 0, (newLongs - oldLongs) << 2); in markCopySize()255 int max = fCopies.count() << 5; in reset()
45 … bool markedForDelete(int index) const { return (fCopies[index >> 5] & 1 << (index & 0x1f)) == 0; } in markedForDelete()59 SkTDIntArray fCopies; variable
360 fCopies.reset(kPathCnt); in onDelayedSetup()369 fCopies[idx] = fPaths[idx]; in onDraw()379 SkAutoTArray<SkPath> fCopies; member in PathCopyBench445 fCopies.reset(kPathCnt); in onDelayedSetup()448 fCopies[i] = fPaths[i]; in onDelayedSetup()456 fParity ^= (fPaths[idx] == fCopies[idx & ~0x1]); in onDraw()467 SkAutoTArray<SkPath> fCopies; member in PathEqualityBench