Lines Matching refs:newStart
986 int32_t start, newStart, movedStart;
991 newStart=UTRIE2_DATA_START_OFFSET;
992 for(start=0, i=0; start<newStart; start+=UTRIE2_DATA_BLOCK_LENGTH, ++i) {
1002 for(start=newStart; start<trie->dataLength;) {
1005 * newStart: index where the current block is to be moved
1018 /* leave newStart with the previous block! */
1023 if( (movedStart=findSameDataBlock(trie->data, newStart, start, blockLength))
1035 /* leave newStart with the previous block! */
1042 overlap>0 && !equal_uint32(trie->data+(newStart-overlap), trie->data+start, overlap);
1045 if(overlap>0 || newStart<start) {
1047 movedStart=newStart-overlap;
1056 trie->data[newStart++]=trie->data[start++];
1058 } else /* no overlap && newStart==start */ {
1063 newStart=start;
1078 while((newStart&(UTRIE2_DATA_GRANULARITY-1))!=0) {
1079 trie->data[newStart++]=trie->initialValue;
1085 (long)trie->dataLength, (long)newStart);
1088 trie->dataLength=newStart;
1093 int32_t i, start, newStart, movedStart, overlap;
1096 newStart=UTRIE2_INDEX_2_BMP_LENGTH;
1097 for(start=0, i=0; start<newStart; start+=UTRIE2_INDEX_2_BLOCK_LENGTH, ++i) {
1102 newStart+=UTRIE2_UTF8_2B_INDEX_2_LENGTH+((trie->highStart-0x10000)>>UTRIE2_SHIFT_1);
1107 * newStart: index where the current block is to be moved
1112 if( (movedStart=findSameIndex2Block(trie->index2, newStart, start))
1121 /* leave newStart with the previous block! */
1128 overlap>0 && !equal_int32(trie->index2+(newStart-overlap), trie->index2+start, overlap);
1131 if(overlap>0 || newStart<start) {
1133 trie->map[start>>UTRIE2_SHIFT_1_2]=newStart-overlap;
1138 trie->index2[newStart++]=trie->index2[start++];
1140 } else /* no overlap && newStart==start */ {
1143 newStart=start;
1159 while((newStart&((UTRIE2_DATA_GRANULARITY-1)|1))!=0) {
1161 trie->index2[newStart++]=(int32_t)0xffff<<UTRIE2_INDEX_SHIFT;
1167 (long)trie->index2Length, (long)newStart);
1170 trie->index2Length=newStart;
