Lines Matching refs:UTRIE2_DATA_BLOCK_LENGTH
53 * including the bad-UTF-8-data block is not a multiple of UTRIE2_DATA_BLOCK_LENGTH
82 * Length 64=0x40 even if UTRIE2_DATA_BLOCK_LENGTH is smaller,
93 * From here on, compaction uses UTRIE2_DATA_BLOCK_LENGTH.
163 for(i=0, j=0; j<0x80; ++i, j+=UTRIE2_DATA_BLOCK_LENGTH) {
168 for(; j<0xc0; ++i, j+=UTRIE2_DATA_BLOCK_LENGTH) {
182 j+=UTRIE2_DATA_BLOCK_LENGTH;
183 for(; j<UNEWTRIE2_DATA_START_OFFSET; ++i, j+=UTRIE2_DATA_BLOCK_LENGTH) {
226 * even if UTRIE2_DATA_BLOCK_LENGTH is smaller.
228 for(i=0x80; i<0x800; i+=UTRIE2_DATA_BLOCK_LENGTH) {
523 newTop=newBlock+UTRIE2_DATA_BLOCK_LENGTH;
552 uprv_memcpy(trie->data+newBlock, trie->data+copyBlock, UTRIE2_DATA_BLOCK_LENGTH*4);
663 uint32_t *limit=block+UTRIE2_DATA_BLOCK_LENGTH;
735 nextStart=(start+UTRIE2_DATA_BLOCK_LENGTH)&~UTRIE2_DATA_MASK;
737 fillBlock(newTrie->data+block, start&UTRIE2_DATA_MASK, UTRIE2_DATA_BLOCK_LENGTH,
765 start+=UTRIE2_DATA_BLOCK_LENGTH; /* nothing to do */
789 0, UTRIE2_DATA_BLOCK_LENGTH,
825 start+=UTRIE2_DATA_BLOCK_LENGTH;
945 c-=UTRIE2_DATA_BLOCK_LENGTH;
954 c-=UTRIE2_DATA_BLOCK_LENGTH;
956 for(j=UTRIE2_DATA_BLOCK_LENGTH; j>0;) {
992 for(start=0, i=0; start<newStart; start+=UTRIE2_DATA_BLOCK_LENGTH, ++i) {
998 * then switch to UTRIE2_DATA_BLOCK_LENGTH.
1009 blockLength=UTRIE2_DATA_BLOCK_LENGTH;
1029 movedStart+=UTRIE2_DATA_BLOCK_LENGTH;
1050 movedStart+=UTRIE2_DATA_BLOCK_LENGTH;
1061 start+=UTRIE2_DATA_BLOCK_LENGTH;
1222 * is a multiple of UTRIE2_DATA_BLOCK_LENGTH.
