/external/dng_sdk/source/ |
H A D | dng_mosaic_info.cpp | 48 uint32 fCount; member in class:dng_bilinear_kernel 60 : fCount (0) 91 for (uint32 j = 0; j < fCount; j++) 107 DNG_ASSERT (fCount < kMaxCount, "Too many kernel entries") 109 fDelta [fCount] = delta; 110 fWeight32 [fCount] = weight; 112 fCount++; 129 for (j = 0; j < fCount; j++) 157 for (j = 1; j < fCount; j++) 193 for (j = 0; j < fCount; [all...] |
H A D | dng_string_list.h | 31 uint32 fCount; member in class:dng_string_list 45 return fCount;
|
H A D | dng_matrix.h | 163 uint32 fCount; member in class:dng_vector 185 return fCount; 207 return fCount == 0;
|
H A D | dng_preview.h | 217 uint32 fCount; member in class:dng_preview_list 229 return fCount;
|
H A D | dng_misc_opcodes.h | 164 uint32 fCount; member in class:dng_opcode_MapTable
|
/external/skia/src/effects/ |
H A D | SkDashImpl.h | 37 int32_t fCount; member in class:SkDashImpl
|
/external/skia/src/gpu/vk/ |
H A D | GrVkDescriptorPool.h | 45 uint32_t fCount; member in class:GrVkDescriptorPool
|
/external/skia/include/core/ |
H A D | SkColorTable.h | 36 int count() const { return fCount; } 42 SkASSERT(fColors != NULL && (unsigned)index < (unsigned)fCount); 69 int fCount; member in class:SkColorTable
|
H A D | SkICC.h | 75 int fCount; member in struct:SkICC::Channel
|
H A D | SkDataTable.h | 25 bool isEmpty() const { return 0 == fCount; } 30 int count() const { return fCount; } 98 int fCount; member in class:SkDataTable
|
H A D | SkDeque.h | 36 bool empty() const { return 0 == fCount; } 37 int count() const { return fCount; } 125 int fCount; // number of elements in the deque member in class:SkDeque
|
/external/skia/include/ports/ |
H A D | SkRemotableFontMgr.h | 40 int count() const { return fCount; } 46 SkRemotableFontIdentitySet() : fCount(0), fData() { } 50 int fCount; member in class:SkRemotableFontIdentitySet
|
/external/skia/include/private/ |
H A D | SkSemaphore.h | 18 : fCount(count), fOSSemaphore(nullptr) {} 49 std::atomic<int> fCount; member in class:SkBaseSemaphore 61 int prev = fCount.fetch_add(n, std::memory_order_release); 81 if (fCount.fetch_sub(1, std::memory_order_acquire) <= 0) {
|
/external/skia/src/core/ |
H A D | SkMipMap.h | 75 int fCount; member in class:SkMipMap
|
H A D | SkVertState.h | 31 fCount = indexCount; 33 fCount = vCount; 46 int fCount; member in struct:VertState
|
H A D | SkBigPicture.h | 26 SnapshotArray(const SkPicture* pics[], int count) : fPics(pics), fCount(count) {} 27 ~SnapshotArray() { for (int i = 0; i < fCount; i++) { fPics[i]->unref(); } } 30 int count() const { return fCount; } 33 int fCount; member in class:final::SnapshotArray
|
H A D | SkRTree.h | 50 int getDepth() const { return fCount ? fRoot.fSubtree->fLevel + 1 : 0; } 52 int getCount() const { return fCount; } 89 int fCount; member in class:SkRTree
|
/external/icu/icu4c/source/i18n/ |
H A D | nfrlist.h | 38 uint32_t fCount; member in class:NFRuleList 43 , fCount(0) 47 for(uint32_t i = 0; i < fCount; ++i) { 59 fCount -= 1; 60 for (uint32_t i = index; i < fCount; ++i) { // assumes small arrays 66 if (fCount == fCapacity) { 71 fStuff[fCount++] = thing; 74 fCount = 0; 77 uint32_t size() const { return fCount; } 78 NFRule* last() const { return (fCount > [all...] |
/external/skia/gm/ |
H A D | gradientDirtyLaundry.cpp | 14 int fCount; member in struct:GradData 39 return SkGradientShader::MakeLinear(pts, data.fColors, data.fPos, data.fCount, tm); 44 return SkGradientShader::MakeRadial(pt, pt.fX, data.fColors, data.fPos, data.fCount, tm); 49 return SkGradientShader::MakeSweep(pt.fX, pt.fY, data.fColors, data.fPos, data.fCount);
|
/external/skia/tests/ |
H A D | MetaDataTest.cpp | 74 int fCount; member in struct:__anon18483 96 REPORTER_ASSERT(reporter, gElems[i].fCount == count);
|
H A D | PackBitsTest.cpp | 27 int fCount; member in struct:__anon18492 38 size_t maxSize = SkPackBits::ComputeMaxSize8(gTests[i].fCount); 40 gTests[i].fCount, dst, maxSize - 1); 43 gTests[i].fCount, dst, sizeof(dst)); 46 int srcCount = SkPackBits::Unpack8(dst, dstSize, src, gTests[i].fCount - 1); 49 bool match = gTests[i].fCount == srcCount && 51 gTests[i].fCount * sizeof(uint8_t)) == 0;
|
H A D | SkPEGTest.cpp | 218 int fCount; member in struct:__anon18518::__anon18524 230 REPORTER_ASSERT(r, matchAny->fValues.count() == gTests[i].fCount); 233 REPORTER_ASSERT(r, matchSome == (gTests[i].fCount > 0)); 235 matchSome->get<1>().fValues.count() == gTests[i].fCount - 1);
|
/external/icu/icu4c/source/layoutex/layout/ |
H A D | RunArrays.h | 220 le_int32 fCount; member in class:RunArray 225 : UObject(), fClientArrays(FALSE), fLimits(NULL), fCount(0), fCapacity(0) 231 : UObject(), fClientArrays(FALSE), fLimits(NULL), fCount(0), fCapacity(0) 237 : UObject(), fClientArrays(TRUE), fLimits(limits), fCount(count), fCapacity(count) 244 return fCount; 249 fCount = 0; 254 if (run < 0 || run >= fCount) { 263 return getLimit(fCount - 1);
|
/external/skia/src/gpu/ |
H A D | GrWindowRectangles.h | 18 GrWindowRectangles() : fCount(0) {} 19 GrWindowRectangles(const GrWindowRectangles& that) : fCount(0) { *this = that; } 24 bool empty() const { return !fCount; } 25 int count() const { return fCount; } 41 const Rec* rec() const { return fCount <= kNumLocalWindows ? nullptr : fRec; } 43 int fCount; member in class:GrWindowRectangles 45 SkIRect fLocalWindows[kNumLocalWindows]; // If fCount <= kNumLocalWindows. 46 Rec* fRec; // If fCount > kNumLocalWindows. 61 return fCount <= kNumLocalWindows ? fLocalWindows : fRec->fData; 66 fCount [all...] |
/external/skia/bench/ |
H A D | SkBlend_optsBench.cpp | 154 fCount = fPixmap.rowBytesAsPixels(); 155 fDst.reset(fCount); 177 for (int i = 0; i < fCount; i++) { 183 int fCount; member in class:LinearSrcOverBench
|