Lines Matching defs:newStart
1033 int32_t start, newStart, movedStart;
1038 newStart=UTRIE2_DATA_START_OFFSET;
1039 for(start=0, i=0; start<newStart; start+=UTRIE2_DATA_BLOCK_LENGTH, ++i) {
1049 for(start=newStart; start<trie->dataLength;) {
1052 * newStart: index where the current block is to be moved
1065 /* leave newStart with the previous block! */
1070 if( (movedStart=findSameDataBlock(trie->data, newStart, start, blockLength))
1085 /* leave newStart with the previous block! */
1092 overlap>0 && !equal_uint32(trie->data+(newStart-overlap), trie->data+start, overlap);
1098 if(overlap>0 || newStart<start) {
1100 movedStart=newStart-overlap;
1109 trie->data[newStart++]=trie->data[start++];
1111 } else /* no overlap && newStart==start */ {
1116 newStart=start;
1131 while((newStart&(UTRIE2_DATA_GRANULARITY-1))!=0) {
1132 trie->data[newStart++]=trie->initialValue;
1138 (long)trie->dataLength, (long)newStart, (long)countSame, (long)sumOverlaps);
1141 trie->dataLength=newStart;
1146 int32_t i, start, newStart, movedStart, overlap;
1149 newStart=UTRIE2_INDEX_2_BMP_LENGTH;
1150 for(start=0, i=0; start<newStart; start+=UTRIE2_INDEX_2_BLOCK_LENGTH, ++i) {
1155 newStart+=UTRIE2_UTF8_2B_INDEX_2_LENGTH+((trie->highStart-0x10000)>>UTRIE2_SHIFT_1);
1160 * newStart: index where the current block is to be moved
1165 if( (movedStart=findSameIndex2Block(trie->index2, newStart, start))
1174 /* leave newStart with the previous block! */
1181 overlap>0 && !equal_int32(trie->index2+(newStart-overlap), trie->index2+start, overlap);
1184 if(overlap>0 || newStart<start) {
1186 trie->map[start>>UTRIE2_SHIFT_1_2]=newStart-overlap;
1191 trie->index2[newStart++]=trie->index2[start++];
1193 } else /* no overlap && newStart==start */ {
1196 newStart=start;
1212 while((newStart&((UTRIE2_DATA_GRANULARITY-1)|1))!=0) {
1214 trie->index2[newStart++]=(int32_t)0xffff<<UTRIE2_INDEX_SHIFT;
1220 (long)trie->index2Length, (long)newStart);
1223 trie->index2Length=newStart;
