Lines Matching defs:intervals
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;
415 int* intervals) const {
416 SkASSERT(tmpStorage && intervals);
421 *intervals = 0;
424 *intervals = 1;
427 *intervals = fRunHead->getIntervalCount();
827 0, // zero intervals
846 // Now a_runs and b_runs to their intervals (or sentinel)
933 logical intervals that represents (i.e. number of rects that would be
947 /* Given a number of intervals, what is the worst case representation of that
948 many intervals?
951 intervals: TOP + N * (BOTTOM INTERVALCOUNT LEFT RIGHT SENTINEL) + SENTINEL
953 static int intervals_to_count(int intervals) {
954 return 1 + intervals * 5 + 1;
962 int intervals = 2 * a_intervals * b_intervals + a_intervals + b_intervals;
964 return intervals_to_count(intervals);
1209 int intervals = SkToInt((runs - prev) >> 1);
1210 SkASSERT(prev[-1] == intervals);
1211 intervalCount += intervals;
1217 SkASSERT(0 == runs[-1]); // no intervals
1327 int intervals = runs[1];
1328 if (0 == intervals) { // empty line