60         int16_t*    runs = fRuns + offsetX;  in add()  local
66             SkAlphaRuns::Break(runs, alpha, x, 1);  in add()
76             runs += x + 1;  in add()
83             SkAlphaRuns::Break(runs, alpha, x, middleCount);  in add()
85             runs += x;  in add()
89                 int n = runs[0];  in add()
92                 runs += n;  in add()
100             SkAlphaRuns::Break(runs, alpha, x, 1);  in add()
114      * Break the runs in the buffer at offsets x and x+count, properly
115      * updating the runs to the right and left.
118      * Allows add() to sum another run to some of the new sub-runs.
121     static void Break(int16_t runs[], uint8_t alpha[], int x, int count) {
124         //  SkAlphaRuns::BreakAt(runs, alpha, x);
125         //  SkAlphaRuns::BreakAt(&runs[x], &alpha[x], count);
127         int16_t* next_runs = runs + x;
131             int n = runs[0];
136                 runs[0] = SkToS16(x);
137                 runs[x] = SkToS16(n - x);
140             runs += n;
145         runs = next_runs;
150             int n = runs[0];
155                 runs[0] = SkToS16(x);
156                 runs[x] = SkToS16(n - x);
163             runs += n;
169      * Cut (at offset x in the buffer) a run into two shorter runs with
174     static void BreakAt(int16_t runs[], uint8_t alpha[], int x) {  in BreakAt()  argument
176             int n = runs[0];  in BreakAt()
181                 runs[0] = SkToS16(x);  in BreakAt()
182                 runs[x] = SkToS16(n - x);  in BreakAt()
185             runs += n;  in BreakAt()