Home | History | Annotate | Download | only in common

Lines Matching defs:visualLimit

325         logicalLimit=logicalFirst+iRun.visualLimit-visualStart;
330 visualStart = iRun.visualLimit;
379 *pLength=pBiDi->runs[runIndex].visualLimit-
380 pBiDi->runs[runIndex-1].visualLimit;
382 *pLength=pBiDi->runs[0].visualLimit;
397 pBiDi->runs[0].visualLimit=pBiDi->length;
523 length=runs[i].visualLimit-visualStart;
622 /* search for the run limits and initialize visualLimit values with the run lengths */
640 runs[runIndex].visualLimit=i-start;
648 runs[runIndex].visualLimit=length-limit;
662 /* now add the direction flags and adjust the visualLimit's to be just that */
667 limit+=runs[i].visualLimit;
668 runs[i].visualLimit=limit;
899 length=runs[i].visualLimit-visualStart;
925 length=runs[i].visualLimit-visualStart;
931 if(visualIndex<runs[i].visualLimit) {
951 length=runs[i].visualLimit-visualStart;
954 if(visualIndex>=runs[i].visualLimit) {
1014 length=runs[i].visualLimit-visualStart;
1023 if(visualIndex<(runs[i].visualLimit+markFound)) {
1043 length=runs[i].visualLimit-visualStart;
1046 if(visualIndex>=(runs[i].visualLimit-controlFound+insertRemove)) {
1077 for(i=0; visualIndex>=runs[i].visualLimit; ++i) {}
1085 if(visualIndex>=runs[i].visualLimit) {
1087 } else if(i==0 || visualIndex>=runs[i-1].visualLimit) {
1098 /* the offset in runs[i] is visualIndex-runs[i-1].visualLimit */
1100 visualIndex-=runs[i-1].visualLimit;
1105 return GET_INDEX(start)+runs[i].visualLimit-visualIndex-1;
1120 int32_t visualStart, visualLimit, i, j, k;
1133 visualLimit=runs[j].visualLimit;
1137 } while(visualStart<visualLimit);
1139 logicalStart+=visualLimit-visualStart; /* logicalLimit */
1142 } while(visualStart<visualLimit);
1144 /* visualStart==visualLimit; */
1153 length=runs[i].visualLimit-visualStart;
1178 length=runs[i].visualLimit-visualStart;
1222 int32_t logicalStart, visualStart, visualLimit, *pi=indexMap;
1230 visualLimit=runs->visualLimit;
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--) {
1287 length=runs[i].visualLimit-visualStart;
1296 visualLimit=runs[i].visualLimit;
1297 for(j=visualStart; j<visualLimit; j++) {