/external/chromium_org/third_party/angle_dx11/src/compiler/preprocessor/ |
Input.cpp | 35 while ((nRead < maxSize) && (mReadLoc.sIndex < mCount)) 37 size_t size = mLength[mReadLoc.sIndex] - mReadLoc.cIndex; 39 std::memcpy(buf + nRead, mString[mReadLoc.sIndex] + mReadLoc.cIndex, size); 44 if (mReadLoc.cIndex == mLength[mReadLoc.sIndex]) 46 ++mReadLoc.sIndex;
|
Input.h | 31 size_t sIndex; // String index; 34 Location() : sIndex(0), cIndex(0) { }
|
Tokenizer.l | 55 while ((scanLoc->sIndex < input->count()) && \ 56 (scanLoc->cIndex >= input->length(scanLoc->sIndex))) \ 58 scanLoc->cIndex -= input->length(scanLoc->sIndex++); \ 245 if (scanLoc->sIndex != sIndexMax) 249 scanLoc->sIndex = sIndexMax; scanLoc->cIndex = 0;
|
Tokenizer.cpp | 551 while ((scanLoc->sIndex < input->count()) && \ 552 (scanLoc->cIndex >= input->length(scanLoc->sIndex))) \ 554 scanLoc->cIndex -= input->length(scanLoc->sIndex++); \ 1132 if (scanLoc->sIndex != sIndexMax) 1136 scanLoc->sIndex = sIndexMax; scanLoc->cIndex = 0; [all...] |
/external/chromium_org/third_party/skia/src/pathops/ |
SkOpContour.h | 98 for (int sIndex = 0; sIndex < segmentCount; ++sIndex) { 99 SkOpSegment* segment = &fSegments[sIndex]; 103 fSegments[sIndex].checkEnds(); 136 for (int sIndex = 0; sIndex < segmentCount; ++sIndex) { 137 fSegments[sIndex].findTooCloseToCall(); 143 for (int sIndex = 0; sIndex < segmentCount; ++sIndex) [all...] |
SkPathOpsCommon.cpp | 514 int sIndex = sLink[rIndex]; 515 SkASSERT(sIndex != SK_MaxS32); 518 if (sIndex < 0) { 519 eIndex = sLink[~sIndex]; 520 sLink[~sIndex] = SK_MaxS32; 522 eIndex = eLink[sIndex]; 523 eLink[sIndex] = SK_MaxS32; 527 SkDebugf("%s sIndex=%c%d eIndex=%c%d\n", __FUNCTION__, sIndex < 0 ? 's' : 'e', 528 sIndex < 0 ? ~sIndex : sIndex, eIndex < 0 ? 's' : 'e' [all...] |
/external/skia/src/pathops/ |
SkOpContour.h | 98 for (int sIndex = 0; sIndex < segmentCount; ++sIndex) { 99 SkOpSegment* segment = &fSegments[sIndex]; 103 fSegments[sIndex].checkEnds(); 136 for (int sIndex = 0; sIndex < segmentCount; ++sIndex) { 137 fSegments[sIndex].findTooCloseToCall(); 143 for (int sIndex = 0; sIndex < segmentCount; ++sIndex) [all...] |
SkPathOpsCommon.cpp | 514 int sIndex = sLink[rIndex]; 515 SkASSERT(sIndex != SK_MaxS32); 518 if (sIndex < 0) { 519 eIndex = sLink[~sIndex]; 520 sLink[~sIndex] = SK_MaxS32; 522 eIndex = eLink[sIndex]; 523 eLink[sIndex] = SK_MaxS32; 527 SkDebugf("%s sIndex=%c%d eIndex=%c%d\n", __FUNCTION__, sIndex < 0 ? 's' : 'e', 528 sIndex < 0 ? ~sIndex : sIndex, eIndex < 0 ? 's' : 'e' [all...] |
/external/icu4c/layout/ |
HangulLayoutEngine.cpp | 134 le_int32 sIndex = syllable - HSYL_FIRST; 136 if (sIndex < 0 || sIndex >= HSYL_COUNT) { 140 lead = LJMO_FIRST + (sIndex / HSYL_LVCNT); 141 vowel = VJMO_FIRST + (sIndex % HSYL_LVCNT) / TJMO_COUNT; 142 trail = TJMO_FIRST + (sIndex % TJMO_COUNT);
|
/frameworks/base/tests/Camera2Tests/SmartCamera/SimpleCamera/jni/ |
histogram.cpp | 117 int sIndex = s * saturationBins / 256; 122 index = sIndex * hueBins + hIndex;
|
/external/icu4c/i18n/ |
ucol.cpp | [all...] |
/external/chromium_org/third_party/icu/source/test/cintltst/ |
trie2test.c | 279 int32_t i, length, sIndex, countValues; 304 sIndex=(int32_t)(p-s); 305 U16_NEXT(s, sIndex, length, c2); 329 sIndex=(int32_t)(p-s); 330 U16_PREV(s, 0, sIndex, c2); [all...] |
/external/icu4c/test/cintltst/ |
trie2test.c | 279 int32_t i, length, sIndex, countValues; 304 sIndex=(int32_t)(p-s); 305 U16_NEXT(s, sIndex, length, c2); 329 sIndex=(int32_t)(p-s); 330 U16_PREV(s, 0, sIndex, c2); [all...] |
/external/chromium_org/third_party/icu/source/i18n/ |
ucol.cpp | [all...] |
/external/chromium_org/third_party/icu/source/common/ |
uresbund.c | [all...] |
/external/icu4c/common/ |
uresbund.cpp | [all...] |
/prebuilts/misc/common/icu4j/ |
icu4j.jar | |
/prebuilts/tools/common/m2/internal/com/ibm/icu/icu4j/2.6.1/ |
icu4j-2.6.1.jar | |
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
com.ibm.icu_4.2.1.v20100412.jar | |
org.eclipse.swt.gtk.linux.x86_3.6.1.v3657a.jar | |