Lines Matching full:runs
65 int16_t* runs = fRuns + offsetX; in add() local
71 SkAlphaRuns::Break(runs, alpha, x, 1); in add()
81 runs += x + 1; in add()
88 SkAlphaRuns::Break(runs, alpha, x, middleCount); in add()
90 runs += x; in add()
94 int n = runs[0]; in add()
97 runs += n; in add()
105 SkAlphaRuns::Break(runs, alpha, x, 1); in add()
119 * Break the runs in the buffer at offsets x and x+count, properly
120 * updating the runs to the right and left.
123 * Allows add() to sum another run to some of the new sub-runs.
126 static void Break(int16_t runs[], uint8_t alpha[], int x, int count) {
129 // SkAlphaRuns::BreakAt(runs, alpha, x);
130 // SkAlphaRuns::BreakAt(&runs[x], &alpha[x], count);
132 int16_t* next_runs = runs + x;
136 int n = runs[0];
141 runs[0] = SkToS16(x);
142 runs[x] = SkToS16(n - x);
145 runs += n;
150 runs = next_runs;
155 int n = runs[0];
160 runs[0] = SkToS16(x);
161 runs[x] = SkToS16(n - x);
168 runs += n;
174 * Cut (at offset x in the buffer) a run into two shorter runs with
179 static void BreakAt(int16_t runs[], uint8_t alpha[], int x) { in BreakAt() argument
181 int n = runs[0]; in BreakAt()
186 runs[0] = SkToS16(x); in BreakAt()
187 runs[x] = SkToS16(n - x); in BreakAt()
190 runs += n; in BreakAt()