Searched refs:fEntries (Results 1 – 6 of 6) sorted by relevance
170 SkASSERT(fEntries[fStackDepth].fClipStackGenID == in updateMatrix()171 fEntries[fStackDepth -1].fClipStackGenID); in updateMatrix()223 fEntries[fStackDepth] = fEntries[fStackDepth - 1]; in push()229 fEntries[fStackDepth] = SkPDFGraphicStackState::Entry(); in pop()
26 Entry fEntries[kMaxStackDepth + 1]; member37 Entry* currentEntry() { return &fEntries[fStackDepth]; } in currentEntry()
259 if (fEntries[i].fFactory.isCompatible(factory, translate)) { in find()260 const SkMatrix& m = fEntries[i].fMatrix; in find()262 if (matrix != fEntries[i].fMatrix) { in find()271 return fEntries[i].fVertices; in find()288 fSize -= fEntries[i].fVertices->approximateSize(); in add()290 fEntries[i].fFactory = factory; in add()291 fEntries[i].fVertices = vertices; in add()292 fEntries[i].fMatrix = matrix; in add()303 Entry fEntries[MAX_ENTRIES]; member in __anon14c421030111::CachedTessellations::Set
579 fEntries.insert({runIterator, priority});583 const SkShaper::RunIterator* leastRun = fEntries.peek().runIterator;591 while ((currentRun = fEntries.peek().runIterator)->endOfCurrentRun() <= leastEnd) {592 int priority = fEntries.peek().priority;593 fEntries.pop();597 fEntries.insert({currentRun, priority});603 return fEntries.peek().runIterator->endOfCurrentRun();608 for (int i = 0; i < fEntries.count(); ++i) {609 if (!fEntries.at(i).runIterator->atEnd()) {625 SkTDPQueue<Entry, CompareEntry> fEntries; member in __anon1e1a26b20111::RunIteratorQueue
575 if (fEntries >= kMaxEntries) in Add()582 uint32 index = fEntries; in Add()584 for (uint32 j = 0; j < fEntries; j++) in Add()595 for (uint32 k = fEntries; k > index; k--) in Add()604 fEntries++; in Add()613 if (!fEntries) return 0; in Size()615 uint32 size = fEntries * 12 + 6; in Size()617 for (uint32 index = 0; index < fEntries; index++) in Size()642 if (!fEntries) return; in Put()646 uint32 bigData = fEntries * 12 + 6; in Put()[all …]
618 uint32 fEntries; variable628 : fEntries (0) in dng_tiff_directory()