Lines Matching full:intervals
19 * [ Bottom, X-Intervals, [Left, Right]..., X-Sentinel ]
29 /* Pass in the beginning with the intervals.
34 int intervals = runs[-1];
36 if (intervals > 0) {
40 SkASSERT(0 == intervals);
44 runs += intervals * 2 + 1;
421 int* intervals) const {
422 SkASSERT(tmpStorage && intervals);
427 *intervals = 0;
430 *intervals = 1;
433 *intervals = fRunHead->getIntervalCount();
833 0, // zero intervals
852 // Now a_runs and b_runs to their intervals (or sentinel)
939 logical intervals that represents (i.e. number of rects that would be
953 /* Given a number of intervals, what is the worst case representation of that
954 many intervals?
957 intervals: TOP + N * (BOTTOM INTERVALCOUNT LEFT RIGHT SENTINEL) + SENTINEL
959 static int intervals_to_count(int intervals) {
960 return 1 + intervals * 5 + 1;
968 int intervals = 2 * a_intervals * b_intervals + a_intervals + b_intervals;
970 return intervals_to_count(intervals);
1215 int intervals = (runs - prev) >> 1;
1216 SkASSERT(prev[-1] == intervals);
1217 intervalCount += intervals;
1223 SkASSERT(0 == runs[-1]); // no intervals
1333 int intervals = runs[1];
1334 if (0 == intervals) { // empty line
