Home | History | Annotate | Download | only in text

Lines Matching defs:runCount

157         lineBidi.runCount = -1;
286 int runCount = bidi.runCount;
290 for (int i = 0; i < runCount; i++) {
325 bidi.runCount = 1;
335 * Here, runCount>1 and maxLevel>=minLevel>=paraLevel.
361 * this run and can --runCount. If it is later part of the all-runs
362 * reordering, then runCount is adjusted accordingly.
374 int firstRun, endRun, limitRun, runCount;
385 runCount = bidi.runCount;
389 --runCount;
399 while (firstRun < runCount && levels[runs[firstRun].start] < maxLevel) {
402 if (firstRun >= runCount) {
407 runCount &&
420 if (limitRun == runCount) {
434 --runCount;
437 /* Swap the entire sequence of all runs. (endRun==runCount) */
438 while (firstRun < runCount) {
440 runs[firstRun] = runs[runCount];
441 runs[runCount] = tempRun;
443 --runCount;
452 int runCount = bidi.runCount, visualStart = 0, i, length, logicalStart;
454 for (i = 0; i < runCount; i++) {
470 * After getRuns() returns true, runCount is guaranteed to be >0
484 if (bidi.runCount >= 0) {
495 int i, runCount;
510 runCount = 0;
512 /* increment runCount at the start of each run */
514 ++runCount;
523 if (runCount == 1 && limit == length) {
526 } else /* runCount>1 || limit<length */ {
535 ++runCount;
538 /* runCount > 1 */
539 bidi.getRunsMemory(runCount);
583 bidi.runCount = runCount;
590 for (i = 0; i < runCount; ++i) {
599 if (runIndex < runCount) {
826 for (i = 0; i < bidi.runCount; ++i) {
841 if (i >= bidi.runCount) {
914 int i, runCount, start;
917 runCount = bidi.runCount;
984 if (runCount <= 10) {
989 int begin = 0, limit = runCount;
1029 for (int j = 0; j < bidi.runCount; ++j) {
1046 int markFound = 0, runCount = bidi.runCount;
1051 for (i = 0; i < runCount; i++, visualStart += length) {
1070 int controlFound = 0, runCount = bidi.runCount;
1077 for (i = 0; i < runCount; i++, visualStart += length) {
1120 for (int j = 0; j < bidi.runCount; ++j) {
1137 int markFound = 0, runCount = bidi.runCount;
1141 for (i = 0; i < runCount; i++) {
1152 for (i = runCount - 1; i >= 0 && markFound > 0; i--) {
1169 int runCount = bidi.runCount, logicalEnd;
1177 for (i = 0; i < runCount; i++, visualStart += length) {