Home | History | Annotate | Download | only in common

Lines Matching defs:runs

223              * realloc, but it is needed when adding runs using getRunsMemory()
1038 * perform that resolution on same-level-runs.
1044 * On one hand, the paragraph has to be scanned for same-level-runs, but
1149 /* The following stack remembers the embedding level and the ISOLATE flag of level runs.
2351 Run *runs;
2422 /* check if some runs must be split, count how many splits */
2425 runs=pBiDi->runs;
2428 runLength=runs[i].visualLimit-visualStart;
2432 logicalStart=GET_INDEX(runs[i].logicalStart);
2444 /* because we switch from UBiDi.simpleRuns to UBiDi.runs */
2445 pBiDi->runsMemory[0]=runs[0];
2447 runs=pBiDi->runs=pBiDi->runsMemory;
2453 /* split runs which are not consecutive in source text */
2455 runLength= i==0 ? runs[0].visualLimit :
2456 runs[i].visualLimit-runs[i-1].visualLimit;
2457 logicalStart=runs[i].logicalStart;
2462 runs[i+addedRuns]=runs[i];
2465 runs[i+addedRuns].logicalStart=MAKE_INDEX_ODD_PAIR(logicalPos,
2483 runs[i+addedRuns].logicalStart=MAKE_INDEX_ODD_PAIR(logicalPos,
2485 runs[i+addedRuns].visualLimit=runs[i].visualLimit;
2486 runs[i].visualLimit-=BIDI_ABS(j-start)+1;
2487 insertRemove=runs[i].insertRemove&(LRM_AFTER|RLM_AFTER);
2488 runs[i+addedRuns].insertRemove=insertRemove;
2489 runs[i].insertRemove&=~insertRemove;
2495 runs[i+addedRuns]=runs[i];
2498 runs[i+addedRuns].logicalStart=MAKE_INDEX_ODD_PAIR(logicalPos,
2564 pBiDi->runs=NULL;
2710 * Otherwise, we need to perform the following rules on runs of