/external/chromium_org/third_party/icu/source/i18n/ |
H A D | fmtable.cpp | 200 fValue.fArrayAndCount.fCount = count; 231 fValue.fArrayAndCount.fCount = source.fValue.fArrayAndCount.fCount; 233 source.fValue.fArrayAndCount.fCount); 301 if (fValue.fArrayAndCount.fCount != that.fValue.fArrayAndCount.fCount) { 306 for (i=0; i<fValue.fArrayAndCount.fCount; ++i) { 590 fValue.fArrayAndCount.fCount = count; 613 fValue.fArrayAndCount.fCount = count; 679 count = fValue.fArrayAndCount.fCount; [all...] |
H A D | nfrlist.h | 36 uint32_t fCount; member in class:NFRuleList 41 , fCount(0) 45 for(uint32_t i = 0; i < fCount; ++i) { 57 fCount -= 1; 58 for (uint32_t i = index; i < fCount; ++i) { // assumes small arrays 64 if (fCount == fCapacity) { 69 fStuff[fCount++] = thing; 72 fCount = 0; 75 uint32_t size() const { return fCount; } 76 NFRule* last() const { return (fCount > [all...] |
H A D | sortkey.cpp | 226 uint8_t *result = (uint8_t*) uprv_malloc( sizeof(uint8_t) * fCount ); 234 count = fCount; 236 uprv_memcpy(result, fBytes, fCount);
|
/external/chromium_org/third_party/icu/source/i18n/unicode/ |
H A D | fmtable.h | 446 { count=fValue.fArrayAndCount.fCount; return fValue.fArrayAndCount.fArray; } 703 int32_t fCount; member in struct:Formattable::__anon12143::__anon12144
|
/external/chromium_org/third_party/icu/source/tools/genrb/ |
H A D | reslist.c | 242 if (res->u.fArray.fCount == 0 && gFormatVersion > 1) { 251 if (U_SUCCESS(*status) && res->u.fArray.fCount <= 0xffff && res16 >= 0 && gFormatVersion > 1) { 252 uint16_t *p16 = reserve16BitUnits(bundle, 1 + res->u.fArray.fCount, status); 255 *p16++ = (uint16_t)res->u.fArray.fCount; 259 bundle->f16BitUnitsLength += 1 + res->u.fArray.fCount; 276 if (res->u.fTable.fCount == 0 && gFormatVersion > 1) { 306 if(res->u.fTable.fCount > (uint32_t)bundle->fMaxTableLength) { 307 bundle->fMaxTableLength = res->u.fTable.fCount; 310 if (res->u.fTable.fCount <= 0xffff && 315 uint16_t *p16 = reserve16BitUnits(bundle, 1 + res->u.fTable.fCount * [all...] |
H A D | reslist.h | 107 uint32_t fCount; member in struct:SResTable 117 uint32_t fCount; member in struct:SResArray 145 uint32_t fCount; member in struct:SResIntVector
|
H A D | wrtjava.c | 334 if (res->u.fArray.fCount > 0) { 398 for(i = 0; i<res->u.fIntVector.fCount; i++) { 409 for(i = 0; i<res->u.fIntVector.fCount; i++) { 516 if (res->u.fTable.fCount > 0) { 531 assert(i < res->u.fTable.fCount);
|
H A D | wrtxml.cpp | 720 for(i = 0; i < res->u.fIntVector.fCount; i += 1) {
|
/external/chromium_org/third_party/skia/bench/ |
H A D | GradientBench.cpp | 18 int fCount; member in struct:GradData 51 return SkGradientShader::CreateLinear(pts, data.fColors, data.fPos, data.fCount, tm); 61 data.fPos, data.fCount, tm); 71 data.fPos, data.fCount); 85 data.fColors, data.fPos, data.fCount, tm); 98 data.fColors, data.fPos, data.fCount, tm); 111 data.fColors, data.fPos, data.fCount, tm); 125 data.fCount, tm); 139 data.fCount, tm);
|
H A D | MemcpyBench.cpp | 17 : fCount(count) 30 fDst.reset(fCount); 31 fSrc.reset(fCount); 34 for (int i = 0; i < fCount; i++) { 41 fMemcpy32(fDst, fSrc, fCount); 48 int fCount; member in class:Memcpy32Bench
|
/external/chromium_org/third_party/skia/experimental/PdfViewer/src/ |
H A D | SkTDStackNester.h | 34 : fCount(0) 119 SkASSERT(fCount <= kSlotCount); 120 if (fCount == kSlotCount) { 124 fCount = 0; 128 return &fRec->fSlots[fCount++]; 140 SkASSERT(fRec && fCount > 0); 141 return fRec->fSlots[fCount - 1]; 148 SkASSERT(fRec && fCount > 0); 149 return fRec->fSlots[fCount - 1]; 157 *elem = fRec->fSlots[fCount 200 int fCount; member in class:SkTDStackNester [all...] |
/external/chromium_org/third_party/skia/gm/ |
H A D | gradientDirtyLaundry.cpp | 14 int fCount; member in struct:GradData 39 return SkGradientShader::CreateLinear(pts, data.fColors, data.fPos, data.fCount, tm); 47 data.fPos, data.fCount, tm); 54 return SkGradientShader::CreateSweep(center.fX, center.fY, data.fColors, data.fPos, data.fCount);
|
H A D | gradients.cpp | 14 int fCount; member in struct:skiagm::GradData 45 data.fCount, tm, 0, &localMatrix); 54 data.fPos, data.fCount, tm, 0, &localMatrix); 63 data.fPos, data.fCount, 0, &localMatrix); 76 data.fColors, data.fPos, data.fCount, tm, 90 data.fCount, tm, 0, &localMatrix);
|
H A D | gradients_2pt_conical.cpp | 14 int fCount; member in struct:skiagm::GradData 50 data.fCount, tm, 0, &localMatrix); 63 data.fCount, tm, 0, &localMatrix); 75 data.fColors, data.fPos, data.fCount, tm, 88 data.fColors, data.fPos, data.fCount, tm, 101 data.fColors, data.fPos, data.fCount, tm, 114 data.fColors, data.fPos, data.fCount, tm, 127 data.fColors, data.fPos, data.fCount, tm, 140 data.fColors, data.fPos, data.fCount, tm, 154 data.fCount, t 290 const int fCount; member in struct:skiagm::__anon15042 [all...] |
H A D | gradients_no_texture.cpp | 13 int fCount; member in struct:GradData 30 return SkGradientShader::CreateLinear(pts, data.fColors, data.fPos, data.fCount, tm); 38 data.fPos, data.fCount, tm); 45 return SkGradientShader::CreateSweep(center.fX, center.fY, data.fColors, data.fPos, data.fCount); 57 data.fColors, data.fPos, data.fCount, tm); 69 data.fCount, tm); 130 int fCount; member in struct:ColorPos 132 ColorPos() : fColors(NULL), fPos(NULL), fCount(0) {} 147 fCount = count; 243 SkShader* s = SkGradientShader::CreateLinear(pts, rec.fColors, rec.fPos, rec.fCount, [all...] |
H A D | shadertext.cpp | 34 int fCount; member in struct:skiagm::GradData 49 return SkGradientShader::CreateLinear(pts, data.fColors, data.fPos, data.fCount, tm); 57 data.fPos, data.fCount, tm); 64 return SkGradientShader::CreateSweep(center.fX, center.fY, data.fColors, data.fPos, data.fCount); 76 data.fColors, data.fPos, data.fCount, tm);
|
/external/chromium_org/third_party/skia/include/core/ |
H A D | SkColorTable.h | 41 int count() const { return fCount; } 47 SkASSERT(fColors != NULL && (unsigned)index < fCount); 84 uint16_t fCount; member in class:SkColorTable
|
H A D | SkDataTable.h | 28 bool isEmpty() const { return 0 == fCount; } 33 int count() const { return fCount; } 102 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
|
H A D | SkPathEffect.h | 110 * in if the PathEffect can be a dash pattern. If passed in info has an fCount equal or 113 * and fCount. If effect can be represented as a dash pattern, allocate space for the intervals 123 DashInfo() : fIntervals(NULL), fCount(0), fPhase(0) {} 127 int32_t fCount; //!< Number of intervals in the dash. Should be even number member in struct:SkPathEffect::DashInfo
|
H A D | SkTArray.h | 25 memcpy(self->fMemArray, array, self->fCount * sizeof(T)); 29 memcpy(newMemArray, self->fMemArray, self->fCount * sizeof(T)); 38 for (int i = 0; i < self->fCount; ++i) { 44 for (int i = 0; i < self->fCount; ++i) { 65 fCount = 0; 84 this->init(array.fItemArray, array.fCount, NULL, 0); 100 for (int i = 0; i < fCount; ++i) { 103 fCount = 0; 105 fCount = array.count(); 111 for (int i = 0; i < fCount; 456 int fCount; member in class:SkTArray [all...] |
H A D | SkTDArray.h | 18 fReserve = fCount = 0; 27 fReserve = fCount = 0; 38 fReserve = fCount = count; 42 fReserve = fCount = 0; 47 SkTDArray<T> tmp(src.fArray, src.fCount); 56 if (src.fCount > fReserve) { 57 SkTDArray<T> tmp(src.fArray, src.fCount); 60 memcpy(fArray, src.fArray, sizeof(T) * src.fCount); 61 fCount = src.fCount; 360 int fCount; member in class:SkTDArray [all...] |
H A D | SkTDStack.h | 17 SkTDStack() : fCount(0), fTotalCount(0) { 21 // fCount = kSlotCount; 38 SkASSERT(fCount <= kSlotCount); 39 if (fCount == kSlotCount) { 43 fCount = 0; 46 return &fRec->fSlots[fCount++]; 52 SkASSERT(fRec && fCount > idx); 53 return fRec->fSlots[fCount - idx - 1]; 57 SkASSERT(fRec && fCount > idx); 58 return fRec->fSlots[fCount 107 int fCount, fTotalCount; member in class:SkTDStack [all...] |
H A D | SkTemplates.h | 212 SkDEBUGCODE(fCount = 0;) 222 SkDEBUGCODE(fCount = count;) 234 SkDEBUGCODE(fCount = count;) 248 SkASSERT((unsigned)index < (unsigned)fCount); 254 SkDEBUGCODE(int fCount;) 264 fCount = 0; 271 fCount = 0; 282 T* iter = start + fCount; 287 if (fCount != count) { 288 if (fCount > [all...] |
/external/chromium_org/third_party/skia/include/effects/ |
H A D | SkDashPathEffect.h | 65 int32_t fCount; member in class:SkDashPathEffect
|