Cross Reference: /external/icu/icu4c/source/common/ubidiln.c

Lines Matching defs:visualStart
310     int32_t runCount, visualStart, logicalLimit, logicalFirst, i;
323     visualStart=logicalLimit=0;
329         logicalLimit=logicalFirst+iRun.visualLimit-visualStart;
334         visualStart = iRun.visualLimit;
410  * All the visualStart fields=logical start before reordering.
524     int32_t runCount=pBiDi->runCount, visualStart=0, i, length, logicalStart;
527         length=runs[i].visualLimit-visualStart;
532         visualStart+=length;
544  * Odd-level runs have visualStart on their visual right edge and
899             int32_t i, visualStart=0, offset, length;
903                 length=runs[i].visualLimit-visualStart;
908                         visualIndex=visualStart+offset;
911                         visualIndex=visualStart+length-offset-1;
915                 visualStart+=length;
927         int32_t visualStart=0, markFound=0;
928         for(i=0; ; i++, visualStart+=length) {
929             length=runs[i].visualLimit-visualStart;
947         int32_t visualStart=0, controlFound=0;
954         for(i=0; ; i++, visualStart+=length) {
955             length=runs[i].visualLimit-visualStart;
1014         int32_t visualStart=0, length;
1017         for(i=0; ; i++, visualStart+=length) {
1018             length=runs[i].visualLimit-visualStart;
1021                 if(visualIndex<=(visualStart+markFound)) {
1032                 if(visualIndex==(visualStart+length+markFound)) {
1042         int32_t logicalStart, logicalEnd, visualStart=0, j, k;
1046         for(i=0; ; i++, visualStart+=length) {
1047             length=runs[i].visualLimit-visualStart;
1070                 if((visualIndex+controlFound)==(visualStart+j)) {
1124         int32_t visualStart, visualLimit, i, j, k;
1134         visualStart=0;
1140                     indexMap[logicalStart++]=visualStart++;
1141                 } while(visualStart<visualLimit);
1143                 logicalStart+=visualLimit-visualStart;  /* logicalLimit */
1145                     indexMap[--logicalStart]=visualStart++;
1146                 } while(visualStart<visualLimit);
1148             /* visualStart==visualLimit; */
1154             visualStart=0;
1156             for(i=0; i<runCount; i++, visualStart+=length) {
1157                 length=runs[i].visualLimit-visualStart;
1179             visualStart=0;
1181             for(i=0; i<runCount; i++, visualStart+=length) {
1182                 length=runs[i].visualLimit-visualStart;
1226         int32_t logicalStart, visualStart, visualLimit, *pi=indexMap;
1231         visualStart=0;
1238                 } while(++visualStart<visualLimit);
1241                 logicalStart+=visualLimit-visualStart;  /* logicalLimit */
1244                 } while(++visualStart<visualLimit);
1246             /* visualStart==visualLimit; */
1271                 visualStart= i>0 ? runs[i-1].visualLimit : 0;
1272                 for(j=runs[i].visualLimit-1; j>=visualStart && markFound>0; j--) {
1287             visualStart=0;
1290             for(i=0; i<runCount; i++, visualStart+=length) {
1291                 length=runs[i].visualLimit-visualStart;
1294                 if((insertRemove==0)&&(k==visualStart)) {
1301                     for(j=visualStart; j<visualLimit; j++) {