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;
420 int* intervals) const {
421 SkASSERT(tmpStorage && intervals);
426 *intervals = 0;
429 *intervals = 1;
432 *intervals = fRunHead->getIntervalCount();
832 0, // zero intervals
851 // Now a_runs and b_runs to their intervals (or sentinel)
938 logical intervals that represents (i.e. number of rects that would be
952 /* Given a number of intervals, what is the worst case representation of that
953 many intervals?
956 intervals: TOP + N * (BOTTOM INTERVALCOUNT LEFT RIGHT SENTINEL) + SENTINEL
958 static int intervals_to_count(int intervals) {
959 return 1 + intervals * 5 + 1;
967 int intervals = 2 * a_intervals * b_intervals + a_intervals + b_intervals;
969 return intervals_to_count(intervals);
1211 int intervals = (runs - prev) >> 1;
1212 SkASSERT(prev[-1] == intervals);
1213 intervalCount += intervals;
1219 SkASSERT(0 == runs[-1]); // no intervals
1329 int intervals = runs[1];
1330 if (0 == intervals) { // empty line