Lines Matching defs:visualStart

306     int32_t runCount, visualStart, logicalLimit, logicalFirst, i;
319 visualStart=logicalLimit=0;
325 logicalLimit=logicalFirst+iRun.visualLimit-visualStart;
330 visualStart = iRun.visualLimit;
406 * All the visualStart fields=logical start before reordering.
520 int32_t runCount=pBiDi->runCount, visualStart=0, i, length, logicalStart;
523 length=runs[i].visualLimit-visualStart;
528 visualStart+=length;
540 * Odd-level runs have visualStart on their visual right edge and
895 int32_t i, visualStart=0, offset, length;
899 length=runs[i].visualLimit-visualStart;
904 visualIndex=visualStart+offset;
907 visualIndex=visualStart+length-offset-1;
911 visualStart+=length;
923 int32_t visualStart=0, markFound=0;
924 for(i=0; ; i++, visualStart+=length) {
925 length=runs[i].visualLimit-visualStart;
943 int32_t visualStart=0, controlFound=0;
950 for(i=0; ; i++, visualStart+=length) {
951 length=runs[i].visualLimit-visualStart;
1010 int32_t visualStart=0, length;
1013 for(i=0; ; i++, visualStart+=length) {
1014 length=runs[i].visualLimit-visualStart;
1017 if(visualIndex<=(visualStart+markFound)) {
1028 if(visualIndex==(visualStart+length+markFound)) {
1038 int32_t logicalStart, logicalEnd, visualStart=0, j, k;
1042 for(i=0; ; i++, visualStart+=length) {
1043 length=runs[i].visualLimit-visualStart;
1066 if((visualIndex+controlFound)==(visualStart+j)) {
1120 int32_t visualStart, visualLimit, i, j, k;
1130 visualStart=0;
1136 indexMap[logicalStart++]=visualStart++;
1137 } while(visualStart<visualLimit);
1139 logicalStart+=visualLimit-visualStart; /* logicalLimit */
1141 indexMap[--logicalStart]=visualStart++;
1142 } while(visualStart<visualLimit);
1144 /* visualStart==visualLimit; */
1150 visualStart=0;
1152 for(i=0; i<runCount; i++, visualStart+=length) {
1153 length=runs[i].visualLimit-visualStart;
1175 visualStart=0;
1177 for(i=0; i<runCount; i++, visualStart+=length) {
1178 length=runs[i].visualLimit-visualStart;
1222 int32_t logicalStart, visualStart, visualLimit, *pi=indexMap;
1227 visualStart=0;
1234 } while(++visualStart<visualLimit);
1237 logicalStart+=visualLimit-visualStart; /* logicalLimit */
1240 } while(++visualStart<visualLimit);
1242 /* visualStart==visualLimit; */
1267 visualStart= i>0 ? runs[i-1].visualLimit : 0;
1268 for(j=runs[i].visualLimit-1; j>=visualStart && markFound>0; j--) {
1283 visualStart=0;
1286 for(i=0; i<runCount; i++, visualStart+=length) {
1287 length=runs[i].visualLimit-visualStart;
1290 if((insertRemove==0)&&(k==visualStart)) {
1297 for(j=visualStart; j<visualLimit; j++) {