Lines Matching refs:newStart
984 int32_t start, newStart, movedStart;
989 newStart=UTRIE2_DATA_START_OFFSET;
990 for(start=0, i=0; start<newStart; start+=UTRIE2_DATA_BLOCK_LENGTH, ++i) {
1000 for(start=newStart; start<trie->dataLength;) {
1003 * newStart: index where the current block is to be moved
1016 /* leave newStart with the previous block! */
1021 if( (movedStart=findSameDataBlock(trie->data, newStart, start, blockLength))
1033 /* leave newStart with the previous block! */
1040 overlap>0 && !equal_uint32(trie->data+(newStart-overlap), trie->data+start, overlap);
1043 if(overlap>0 || newStart<start) {
1045 movedStart=newStart-overlap;
1054 trie->data[newStart++]=trie->data[start++];
1056 } else /* no overlap && newStart==start */ {
1061 newStart=start;
1076 while((newStart&(UTRIE2_DATA_GRANULARITY-1))!=0) {
1077 trie->data[newStart++]=trie->initialValue;
1083 (long)trie->dataLength, (long)newStart);
1086 trie->dataLength=newStart;
1091 int32_t i, start, newStart, movedStart, overlap;
1094 newStart=UTRIE2_INDEX_2_BMP_LENGTH;
1095 for(start=0, i=0; start<newStart; start+=UTRIE2_INDEX_2_BLOCK_LENGTH, ++i) {
1100 newStart+=UTRIE2_UTF8_2B_INDEX_2_LENGTH+((trie->highStart-0x10000)>>UTRIE2_SHIFT_1);
1105 * newStart: index where the current block is to be moved
1110 if( (movedStart=findSameIndex2Block(trie->index2, newStart, start))
1119 /* leave newStart with the previous block! */
1126 overlap>0 && !equal_int32(trie->index2+(newStart-overlap), trie->index2+start, overlap);
1129 if(overlap>0 || newStart<start) {
1131 trie->map[start>>UTRIE2_SHIFT_1_2]=newStart-overlap;
1136 trie->index2[newStart++]=trie->index2[start++];
1138 } else /* no overlap && newStart==start */ {
1141 newStart=start;
1157 while((newStart&((UTRIE2_DATA_GRANULARITY-1)|1))!=0) {
1159 trie->index2[newStart++]=(int32_t)0xffff<<UTRIE2_INDEX_SHIFT;
1165 (long)trie->index2Length, (long)newStart);
1168 trie->index2Length=newStart;
