Lines Matching refs:Span
31 // * maybeProcessSpan(span, next) - This represents a horizontal series of pixels
33 // span - encapsulation of span.
35 // maybeProcessSpan - returns false if it can not process the span and needs to fallback to
59 // The span you pass must not be empty.
60 void pointSpan(Span span) override {
61 SkASSERT(!span.isEmpty());
62 if (!fStrategy.maybeProcessSpan(span, fNext)) {
63 span_fallback(span, this);
113 // The span you pass must not be empty.
114 void pointSpan(Span span) override {
115 SkASSERT(!span.isEmpty());
117 std::tie(start, length, count) = span;
119 if (span.count() == 1) {
124 this->pointListFew(1, Sk4f{span.startX()}, Sk4f{span.startY()});
130 Span yAdjustedSpan{{x, y}, length, count};
133 span_fallback(span, this);
176 void pointSpan(Span span) override {
177 SkASSERT(fDest + span.count() <= fEnd);
178 if (span.length() != 0.0f) {
179 int32_t x = SkScalarTruncToInt(span.startX());
180 int32_t y = SkScalarTruncToInt(span.startY());
182 memmove(fDest, src, span.count() * sizeof(uint32_t));
183 fDest += span.count();
187 void repeatSpan(Span span, int32_t repeatCount) override {
188 SkASSERT(fDest + span.count() * repeatCount <= fEnd);
190 int32_t x = SkScalarTruncToInt(span.startX());
191 int32_t y = SkScalarTruncToInt(span.startY());
195 memmove(dest, src, span.count() * sizeof(uint32_t));
196 dest += span.count();
246 void pointSpan(Span span) override {
247 if (span.length() != 0.0f) {
248 this->repeatSpan(span, 1);
252 void repeatSpan(Span span, int32_t repeatCount) override {
253 SkASSERT(fDest + span.count() * repeatCount <= fEnd);
254 SkASSERT(span.count() > 0);
257 int32_t x = (int32_t)span.startX();
258 int32_t y = (int32_t)span.startY();
261 SkOpts::srcover_srgb_srgb(fDest, beginSpan, span.count() * repeatCount, span.count());
263 fDest += span.count() * repeatCount;
465 fFirstStage->pointSpan(Span{{x + 0.5f, y + 0.5f}, count - 1.0f, count});
