/external/chromium/third_party/icu/source/common/ |
H A D | utrie.c | 106 trie->indexLength=UTRIE_MAX_INDEX_LENGTH; 375 _findSameIndexBlock(const int32_t *idx, int32_t indexLength, argument 379 for(block=UTRIE_BMP_INDEX_LENGTH; block<indexLength; block+=UTRIE_SURROGATE_BLOCK_COUNT) { 389 return indexLength; 408 int32_t indexLength, block; local 452 indexLength=UTRIE_BMP_INDEX_LENGTH; 466 block=_findSameIndexBlock(idx, indexLength, c>>UTRIE_SHIFT); 482 if(block==indexLength) { 484 uprv_memmove(idx+indexLength, 487 indexLength [all...] |
H A D | utrie2.c | 87 trie->data32==NULL ? trie->indexLength : 0, 165 tempTrie.indexLength=header->indexLength; 173 tempTrie.highValueIndex+=tempTrie.indexLength; 177 actualLength=(int32_t)sizeof(UTrie2Header)+tempTrie.indexLength*2; 202 p16+=trie->indexLength; 237 int32_t indexLength, dataLength, length, i; local 250 indexLength=UTRIE2_INDEX_1_OFFSET; 252 length=(int32_t)sizeof(UTrie2Header)+indexLength*2; 277 dataMove=indexLength; [all...] |
H A D | utrie2_impl.h | 62 uint16_t indexLength; member in struct:UTrie2Header
|
H A D | ucol_swp.c | 58 trie.indexLength=udata_readInt32(ds, inTrie->indexLength); 64 trie.indexLength<UTRIE_BMP_INDEX_LENGTH || 65 (trie.indexLength&(UTRIE_SURROGATE_BLOCK_COUNT-1))!=0 || 75 size=sizeof(UTrieHeader)+trie.indexLength*2+trie.dataLength*(dataIs32?4:2); 92 ds->swapArray16(ds, inTrie+1, trie.indexLength*2, outTrie+1, pErrorCode); 93 ds->swapArray32(ds, (const uint16_t *)(inTrie+1)+trie.indexLength, trie.dataLength*4, 94 (uint16_t *)(outTrie+1)+trie.indexLength, pErrorCode); 96 ds->swapArray16(ds, inTrie+1, (trie.indexLength+trie.dataLength)*2, outTrie+1, pErrorCode);
|
H A D | utrie.h | 145 * pointer, with each index item increased by indexLength; 166 int32_t indexLength, dataLength; member in struct:UTrie 271 #define UTRIE_GET16_LATIN1(trie) ((trie)->index+(trie)->indexLength+UTRIE_DATA_BLOCK_LENGTH) 560 int32_t indexLength, dataCapacity, dataLength; member in struct:UNewTrie 747 * uint16_t index[header.indexLength]; 764 /** indexLength is a multiple of UTRIE_SURROGATE_BLOCK_COUNT */ 765 int32_t indexLength; member in struct:UTrieHeader
|
H A D | utrie2_builder.c | 348 long indexLength=trie->indexLength; local 350 long totalLength=(long)sizeof(UTrieHeader)+indexLength*2+dataLength*(trie->data32!=NULL ? 4 : 2); 352 indexLength, dataLength, totalLength); 357 long indexLength=trie->indexLength; local 359 long totalLength=(long)sizeof(UTrie2Header)+indexLength*2+dataLength*(trie->data32!=NULL ? 4 : 2); 361 which, indexLength, dataLength, totalLength); 1236 * Limited by its own 16-bit index values, and by uint16_t UTrie2Header.indexLength. 1302 /* are indexLength an [all...] |
H A D | utrie2.h | 380 #define UTRIE2_GET16(trie, c) _UTRIE2_GET((trie), index, (trie)->indexLength, (c)) 618 * pointer, with each index item increased by indexLength; 629 int32_t indexLength, dataLength; member in struct:UTrie2
|
/external/icu4c/common/ |
H A D | utrie.c | 106 trie->indexLength=UTRIE_MAX_INDEX_LENGTH; 375 _findSameIndexBlock(const int32_t *idx, int32_t indexLength, argument 379 for(block=UTRIE_BMP_INDEX_LENGTH; block<indexLength; block+=UTRIE_SURROGATE_BLOCK_COUNT) { 389 return indexLength; 408 int32_t indexLength, block; local 452 indexLength=UTRIE_BMP_INDEX_LENGTH; 466 block=_findSameIndexBlock(idx, indexLength, c>>UTRIE_SHIFT); 482 if(block==indexLength) { 484 uprv_memmove(idx+indexLength, 487 indexLength [all...] |
H A D | utrie2.cpp | 87 trie->data32==NULL ? trie->indexLength : 0, 165 tempTrie.indexLength=header->indexLength; 173 tempTrie.highValueIndex+=tempTrie.indexLength; 177 actualLength=(int32_t)sizeof(UTrie2Header)+tempTrie.indexLength*2; 202 p16+=trie->indexLength; 237 int32_t indexLength, dataLength, length, i; local 250 indexLength=UTRIE2_INDEX_1_OFFSET; 252 length=(int32_t)sizeof(UTrie2Header)+indexLength*2; 277 dataMove=indexLength; [all...] |
H A D | utrie2_impl.h | 62 uint16_t indexLength; member in struct:UTrie2Header
|
H A D | ucol_swp.cpp | 58 trie.indexLength=udata_readInt32(ds, inTrie->indexLength); 64 trie.indexLength<UTRIE_BMP_INDEX_LENGTH || 65 (trie.indexLength&(UTRIE_SURROGATE_BLOCK_COUNT-1))!=0 || 75 size=sizeof(UTrieHeader)+trie.indexLength*2+trie.dataLength*(dataIs32?4:2); 92 ds->swapArray16(ds, inTrie+1, trie.indexLength*2, outTrie+1, pErrorCode); 93 ds->swapArray32(ds, (const uint16_t *)(inTrie+1)+trie.indexLength, trie.dataLength*4, 94 (uint16_t *)(outTrie+1)+trie.indexLength, pErrorCode); 96 ds->swapArray16(ds, inTrie+1, (trie.indexLength+trie.dataLength)*2, outTrie+1, pErrorCode);
|
H A D | uresdata.c | 181 int32_t indexLength=indexes[URES_INDEX_LENGTH]&0xff; local 182 if(indexLength<=URES_INDEX_MAX_TABLE_LENGTH) { 188 (length<((1+indexLength)<<2) || 195 if(indexes[URES_INDEX_KEYS_TOP]>(1+indexLength)) { 198 if(indexLength>URES_INDEX_ATTRIBUTES) { 204 if((pResData->isPoolBundle || pResData->usesPoolBundle) && indexLength<=URES_INDEX_POOL_CHECKSUM) { 209 if( indexLength>URES_INDEX_16BIT_TOP && 963 int32_t bundleLength, indexLength, keysBottom, keysTop, resBottom, top; local 1011 indexLength=udata_readInt32(ds, inIndexes[URES_INDEX_LENGTH])&0xff; 1012 if(indexLength< [all...] |
H A D | utrie.h | 145 * pointer, with each index item increased by indexLength; 166 int32_t indexLength, dataLength; member in struct:UTrie 271 #define UTRIE_GET16_LATIN1(trie) ((trie)->index+(trie)->indexLength+UTRIE_DATA_BLOCK_LENGTH) 560 int32_t indexLength, dataCapacity, dataLength; member in struct:UNewTrie 747 * uint16_t index[header.indexLength]; 764 /** indexLength is a multiple of UTRIE_SURROGATE_BLOCK_COUNT */ 765 int32_t indexLength; member in struct:UTrieHeader
|
H A D | utrie2_builder.c | 348 long indexLength=trie->indexLength; local 350 long totalLength=(long)sizeof(UTrieHeader)+indexLength*2+dataLength*(trie->data32!=NULL ? 4 : 2); 352 indexLength, dataLength, totalLength); 357 long indexLength=trie->indexLength; local 359 long totalLength=(long)sizeof(UTrie2Header)+indexLength*2+dataLength*(trie->data32!=NULL ? 4 : 2); 361 which, indexLength, dataLength, totalLength); 1236 * Limited by its own 16-bit index values, and by uint16_t UTrie2Header.indexLength. 1302 /* are indexLength an [all...] |
H A D | utrie2.h | 380 #define UTRIE2_GET16(trie, c) _UTRIE2_GET((trie), index, (trie)->indexLength, (c)) 680 * pointer, with each index item increased by indexLength; 691 int32_t indexLength, dataLength; member in struct:UTrie2
|
/external/chromium/third_party/icu/source/tools/toolutil/ |
H A D | writesrc.c | 148 usrc_writeArray(f, indexPrefix, pTrie->index, 16, pTrie->indexLength+pTrie->dataLength, postfix); 151 usrc_writeArray(f, indexPrefix, pTrie->index, 16, pTrie->indexLength, postfix); 174 (long)pTrie->indexLength); 187 " %ld,\n" /* indexLength */ 196 (long)pTrie->indexLength, (long)pTrie->dataLength,
|
/external/icu4c/tools/toolutil/ |
H A D | writesrc.c | 163 usrc_writeArray(f, indexPrefix, pTrie->index, 16, pTrie->indexLength+pTrie->dataLength, postfix); 166 usrc_writeArray(f, indexPrefix, pTrie->index, 16, pTrie->indexLength, postfix); 189 (long)pTrie->indexLength); 202 " %ld,\n" /* indexLength */ 211 (long)pTrie->indexLength, (long)pTrie->dataLength,
|
/external/srec/srec/cfront/ |
H A D | sp_fft.c | 483 unsigned *indexTbl, indexLength; local 491 indexLength = 0; 515 indexLength = *indexTbl++; 528 for (k = 0; k < indexLength; k++) 537 indexTbl += indexLength; 541 indexLength = *indexTbl++; 542 for (k = 0; k < indexLength; k++) 548 indexTbl += indexLength; 551 indexLength = *indexTbl++; 552 for (k = 0; k < indexLength; [all...] |
/external/icu4c/tools/genrb/ |
H A D | genrb.c | 314 int32_t indexLength; local 382 indexLength = poolBundle.fIndexes[URES_INDEX_LENGTH] & 0xff; 383 if (indexLength <= URES_INDEX_POOL_CHECKSUM) { 387 keysBottom = (1 + indexLength) * 4;
|