Home
last modified time | relevance | path

Searched refs:fEntries (Results 1 – 10 of 10) sorted by relevance

/external/libusb/libusb/os/
Dhaiku_pollfs.cpp33 WatchedEntry* fEntries; member in WatchedEntry
58 fEntries(NULL), in WatchedEntry()
81 child->fLink = fEntries; in WatchedEntry()
82 fEntries = child; in WatchedEntry()
160 WatchedEntry *child = fEntries; in ~WatchedEntry()
197 WatchedEntry *child = fEntries; in EntryCreated()
209 child->fLink = fEntries; in EntryCreated()
210 fEntries = child; in EntryCreated()
221 WatchedEntry *child = fEntries; in EntryRemoved()
228 fEntries = child->fLink; in EntryRemoved()
/external/skia/src/pdf/
DSkPDFGraphicStackState.cpp174 SkASSERT(fEntries[fStackDepth].fClipStackGenID == in updateMatrix()
175 fEntries[fStackDepth -1].fClipStackGenID); in updateMatrix()
227 fEntries[fStackDepth] = fEntries[fStackDepth - 1]; in push()
233 fEntries[fStackDepth] = SkPDFGraphicStackState::Entry(); in pop()
DSkPDFGraphicStackState.h26 Entry fEntries[kMaxStackDepth + 1]; member
37 Entry* currentEntry() { return &fEntries[fStackDepth]; } in currentEntry()
/external/skqp/src/utils/
DSkShadowUtils.cpp215 if (fEntries[i].fFactory.isCompatible(factory, translate)) { in find()
216 const SkMatrix& m = fEntries[i].fMatrix; in find()
218 if (matrix != fEntries[i].fMatrix) { in find()
227 return fEntries[i].fVertices; in find()
244 fSize -= fEntries[i].fVertices->approximateSize(); in add()
246 fEntries[i].fFactory = factory; in add()
247 fEntries[i].fVertices = vertices; in add()
248 fEntries[i].fMatrix = matrix; in add()
259 Entry fEntries[MAX_ENTRIES]; member in __anonafcf09e30111::CachedTessellations::Set
/external/skia/src/utils/
DSkShadowUtils.cpp249 if (fEntries[i].fFactory.isCompatible(factory, translate)) { in find()
250 const SkMatrix& m = fEntries[i].fMatrix; in find()
252 if (matrix != fEntries[i].fMatrix) { in find()
261 return fEntries[i].fVertices; in find()
278 fSize -= fEntries[i].fVertices->approximateSize(); in add()
280 fEntries[i].fFactory = factory; in add()
281 fEntries[i].fVertices = vertices; in add()
282 fEntries[i].fMatrix = matrix; in add()
293 Entry fEntries[MAX_ENTRIES]; member in __anon5761604c0111::CachedTessellations::Set
/external/skqp/src/pdf/
DSkPDFDevice.h184 SkPDFDevice::GraphicStateEntry* currentEntry() { return &fEntries[fStackDepth]; } in currentEntry()
187 SkPDFDevice::GraphicStateEntry fEntries[kMaxStackDepth + 1]; member
DSkPDFDevice.cpp194 fEntries[fStackDepth] = fEntries[fStackDepth - 1]; in push()
200 fEntries[fStackDepth] = SkPDFDevice::GraphicStateEntry(); in pop()
329 SkASSERT(fEntries[fStackDepth].fClipStackGenID == in updateMatrix()
330 fEntries[fStackDepth -1].fClipStackGenID); in updateMatrix()
/external/skia/modules/skshaper/src/
DSkShaper_harfbuzz.cpp440 fEntries.insert({runIterator, priority}); in insert()
444 const SkShaper::RunIterator* leastRun = fEntries.peek().runIterator; in advanceRuns()
452 while ((currentRun = fEntries.peek().runIterator)->endOfCurrentRun() <= leastEnd) { in advanceRuns()
453 int priority = fEntries.peek().priority; in advanceRuns()
454 fEntries.pop(); in advanceRuns()
458 fEntries.insert({currentRun, priority}); in advanceRuns()
464 return fEntries.peek().runIterator->endOfCurrentRun(); in endOfCurrentRun()
469 for (int i = 0; i < fEntries.count(); ++i) { in allRunsAreAtEnd()
470 if (!fEntries.at(i).runIterator->atEnd()) { in allRunsAreAtEnd()
486 SkTDPQueue<Entry, CompareEntry> fEntries; member in __anonea9152db0111::RunIteratorQueue
/external/dng_sdk/source/
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 * 12 + 6; in Put()
[all …]
Ddng_image_writer.h618 uint32 fEntries; variable
628 : fEntries (0) in dng_tiff_directory()