Lines Matching defs:runs
217 * realloc, but it is needed when adding runs using getRunsMemory()
549 * perform that resolution on same-level-runs.
554 * On one hand, the paragraph has to be scanned for same-level-runs, but
719 * explicit codes because we will later look at same-level runs (X10).
1582 Run *runs;
1653 /* check if some runs must be split, count how many splits */
1656 runs=pBiDi->runs;
1659 runLength=runs[i].visualLimit-visualStart;
1663 logicalStart=GET_INDEX(runs[i].logicalStart);
1675 /* because we switch from UBiDi.simpleRuns to UBiDi.runs */
1676 pBiDi->runsMemory[0]=runs[0];
1678 runs=pBiDi->runs=pBiDi->runsMemory;
1684 /* split runs which are not consecutive in source text */
1686 runLength= i==0 ? runs[0].visualLimit :
1687 runs[i].visualLimit-runs[i-1].visualLimit;
1688 logicalStart=runs[i].logicalStart;
1693 runs[i+addedRuns]=runs[i];
1696 runs[i+addedRuns].logicalStart=MAKE_INDEX_ODD_PAIR(logicalPos,
1714 runs[i+addedRuns].logicalStart=MAKE_INDEX_ODD_PAIR(logicalPos,
1716 runs[i+addedRuns].visualLimit=runs[i].visualLimit;
1717 runs[i].visualLimit-=BIDI_ABS(j-start)+1;
1718 insertRemove=runs[i].insertRemove&(LRM_AFTER|RLM_AFTER);
1719 runs[i+addedRuns].insertRemove=insertRemove;
1720 runs[i].insertRemove&=~insertRemove;
1726 runs[i+addedRuns]=runs[i];
1729 runs[i+addedRuns].logicalStart=MAKE_INDEX_ODD_PAIR(logicalPos,
1793 pBiDi->runs=NULL;
1941 * Otherwise, we need to perform the following rules on runs of
