OLD | NEW |
1 | 1 |
2 /* | 2 /* |
3 * Copyright 2011 Google Inc. | 3 * Copyright 2011 Google Inc. |
4 * | 4 * |
5 * Use of this source code is governed by a BSD-style license that can be | 5 * Use of this source code is governed by a BSD-style license that can be |
6 * found in the LICENSE file. | 6 * found in the LICENSE file. |
7 */ | 7 */ |
8 #include "SkNWayCanvas.h" | 8 #include "SkNWayCanvas.h" |
9 | 9 |
10 SkNWayCanvas::SkNWayCanvas(int width, int height) | 10 SkNWayCanvas::SkNWayCanvas(int width, int height) |
(...skipping 274 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
285 | 285 |
286 void SkNWayCanvas::onDrawPatch(const SkPoint cubics[12], const SkColor colors[4]
, | 286 void SkNWayCanvas::onDrawPatch(const SkPoint cubics[12], const SkColor colors[4]
, |
287 const SkPoint texCoords[4], SkXfermode* xmode, | 287 const SkPoint texCoords[4], SkXfermode* xmode, |
288 const SkPaint& paint) { | 288 const SkPaint& paint) { |
289 Iter iter(fList); | 289 Iter iter(fList); |
290 while (iter.next()) { | 290 while (iter.next()) { |
291 iter->drawPatch(cubics, colors, texCoords, xmode, paint); | 291 iter->drawPatch(cubics, colors, texCoords, xmode, paint); |
292 } | 292 } |
293 } | 293 } |
294 | 294 |
| 295 void SkNWayCanvas::onDrawAnnotation(const SkRect& rect, const char key[], SkData
* data) { |
| 296 Iter iter(fList); |
| 297 while (iter.next()) { |
| 298 iter->drawAnnotation(rect, key, data); |
| 299 } |
| 300 } |
| 301 |
295 #ifdef SK_SUPPORT_LEGACY_DRAWFILTER | 302 #ifdef SK_SUPPORT_LEGACY_DRAWFILTER |
296 SkDrawFilter* SkNWayCanvas::setDrawFilter(SkDrawFilter* filter) { | 303 SkDrawFilter* SkNWayCanvas::setDrawFilter(SkDrawFilter* filter) { |
297 Iter iter(fList); | 304 Iter iter(fList); |
298 while (iter.next()) { | 305 while (iter.next()) { |
299 iter->setDrawFilter(filter); | 306 iter->setDrawFilter(filter); |
300 } | 307 } |
301 return this->INHERITED::setDrawFilter(filter); | 308 return this->INHERITED::setDrawFilter(filter); |
302 } | 309 } |
303 #endif | 310 #endif |
OLD | NEW |