Home
last modified time | relevance | path

Searched refs:fEntries (Results 1 - 6 of 6) sorted by relevance

/third_party/skia/src/pdf/
H A DSkPDFGraphicStackState.h26 Entry fEntries[kMaxStackDepth + 1]; member
37 Entry* currentEntry() { return &fEntries[fStackDepth]; } in currentEntry()
H A DSkPDFGraphicStackState.cpp170 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()
/third_party/skia/src/utils/
H A DSkShadowUtils.cpp261 if (fEntries[i].fFactory.isCompatible(factory, translate)) { in find()
262 const SkMatrix& m = fEntries[i].fMatrix; in find()
264 if (matrix != fEntries[i].fMatrix) { in find()
273 return fEntries[i].fVertices; in find()
290 fSize -= fEntries[i].fVertices->approximateSize(); in add()
292 fEntries[i].fFactory = factory; in add()
293 fEntries[i].fVertices = vertices; in add()
294 fEntries[i].fMatrix = matrix; in add()
305 Entry fEntries[MAX_ENTRIES]; member in __anon18979::CachedTessellations::Set
/third_party/skia/modules/skshaper/src/
H A DSkShaper_harfbuzz.cpp582 fEntries.insert({runIterator, priority});
586 const SkShaper::RunIterator* leastRun = fEntries.peek().runIterator;
594 while ((currentRun = fEntries.peek().runIterator)->endOfCurrentRun() <= leastEnd) {
595 int priority = fEntries.peek().priority;
596 fEntries.pop();
600 fEntries.insert({currentRun, priority});
606 return fEntries.peek().runIterator->endOfCurrentRun();
611 for (int i = 0; i < fEntries.count(); ++i) {
612 if (!fEntries.at(i).runIterator->atEnd()) {
628 SkTDPQueue<Entry, CompareEntry> fEntries; local
[all...]
/third_party/skia/third_party/externals/dng_sdk/source/
H A Ddng_image_writer.h618 uint32 fEntries; member in dng_tiff_directory
628 : fEntries (0) in dng_tiff_directory()
H A Ddng_image_writer.cpp575 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 * 1 in Put()
[all...]

Completed in 9 milliseconds