Searched refs:fDeleted (Results 1 - 7 of 7) sorted by relevance

/external/skia/src/gpu/gl/debug/
H A DGrFakeRefObj.h26 , fDeleted(false) {
56 bool getDeleted() const { return fDeleted; }
71 bool fDeleted; member in class:GrFakeRefObj
74 void setDeleted() { fDeleted = true; }
/external/skia/src/core/
H A DSkTDynamicHash.h25 SkTDynamicHash() : fCount(0), fDeleted(0), fCapacity(0), fArray(NULL) {
127 fDeleted = 0;
132 fDeleted = 0;
173 // Are fCount and fDeleted correct, and are all elements findable?
184 SKTDYNAMICHASH_CHECK(deleted == fDeleted);
215 fDeleted--;
233 fDeleted++;
244 if (100 * (fCount + fDeleted + 1) > fCapacity * kGrowPercent) {
254 fCount = fDeleted = 0;
284 int fDeleted; // Numbe member in class:SkTDynamicHash
[all...]
/external/skia/src/pathops/
H A DSkOpSpan.h67 return fDeleted;
103 SkASSERT(!fDeleted);
104 fDeleted = true;
120 bool fDeleted; // set if removed from span list member in class:SkOpPtT
H A DSkOpSpan.cpp30 fDeleted = false;
60 fDeleted = true;
H A DSkPathOpsTSect.h191 bool fDeleted; member in class:SkTSpan
299 SkTSpan<TCurve, OppCurve>* fDeleted; member in class:SkTSect
539 fDeleted = false;
782 SkASSERT(!overlap->fDeleted);
814 , fDeleted(NULL)
827 if (fDeleted) {
828 result = fDeleted;
830 fDeleted = result->fNext;
840 result->fDeleted = false;
942 } while (coinStart && !last->fDeleted);
[all...]
H A DSkPathOpsPostSect.cpp30 fDeleted = false;
49 fDeleted = true;
/external/skia/tests/
H A DPathOpsDebug.cpp897 this->fDuplicatePt ? " dup" : "", this->fDeleted ? " deleted" : "");

Completed in 132 milliseconds