| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright 2014 Google Inc. | 2 * Copyright 2014 Google Inc. |
| 3 * | 3 * |
| 4 * Use of this source code is governed by a BSD-style license that can be | 4 * Use of this source code is governed by a BSD-style license that can be |
| 5 * found in the LICENSE file. | 5 * found in the LICENSE file. |
| 6 */ | 6 */ |
| 7 | 7 |
| 8 #include "SkRecordDraw.h" | 8 #include "SkRecordDraw.h" |
| 9 #include "SkTSort.h" | 9 #include "SkTSort.h" |
| 10 | 10 |
| (...skipping 65 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 76 | 76 |
| 77 DRAW(DrawBitmap, drawBitmap(shallow_copy(r.bitmap), r.left, r.top, r.paint)); | 77 DRAW(DrawBitmap, drawBitmap(shallow_copy(r.bitmap), r.left, r.top, r.paint)); |
| 78 DRAW(DrawBitmapMatrix, drawBitmapMatrix(shallow_copy(r.bitmap), r.matrix, r.pain
t)); | 78 DRAW(DrawBitmapMatrix, drawBitmapMatrix(shallow_copy(r.bitmap), r.matrix, r.pain
t)); |
| 79 DRAW(DrawBitmapNine, drawBitmapNine(shallow_copy(r.bitmap), r.center, r.dst, r.p
aint)); | 79 DRAW(DrawBitmapNine, drawBitmapNine(shallow_copy(r.bitmap), r.center, r.dst, r.p
aint)); |
| 80 DRAW(DrawBitmapRectToRect, | 80 DRAW(DrawBitmapRectToRect, |
| 81 drawBitmapRectToRect(shallow_copy(r.bitmap), r.src, r.dst, r.paint, r.fl
ags)); | 81 drawBitmapRectToRect(shallow_copy(r.bitmap), r.src, r.dst, r.paint, r.fl
ags)); |
| 82 DRAW(DrawDRRect, drawDRRect(r.outer, r.inner, r.paint)); | 82 DRAW(DrawDRRect, drawDRRect(r.outer, r.inner, r.paint)); |
| 83 DRAW(DrawOval, drawOval(r.oval, r.paint)); | 83 DRAW(DrawOval, drawOval(r.oval, r.paint)); |
| 84 DRAW(DrawPaint, drawPaint(r.paint)); | 84 DRAW(DrawPaint, drawPaint(r.paint)); |
| 85 DRAW(DrawPath, drawPath(r.path, r.paint)); | 85 DRAW(DrawPath, drawPath(r.path, r.paint)); |
| 86 DRAW(DrawPatch, drawPatch(r.patch, r.paint)); | 86 DRAW(DrawPatch, drawPatch(r.cubics, r.colors, r.texCoords, r.xmode.get(), r.pain
t)); |
| 87 DRAW(DrawPicture, drawPicture(r.picture, r.matrix, r.paint)); | 87 DRAW(DrawPicture, drawPicture(r.picture, r.matrix, r.paint)); |
| 88 DRAW(DrawPoints, drawPoints(r.mode, r.count, r.pts, r.paint)); | 88 DRAW(DrawPoints, drawPoints(r.mode, r.count, r.pts, r.paint)); |
| 89 DRAW(DrawPosText, drawPosText(r.text, r.byteLength, r.pos, r.paint)); | 89 DRAW(DrawPosText, drawPosText(r.text, r.byteLength, r.pos, r.paint)); |
| 90 DRAW(DrawPosTextH, drawPosTextH(r.text, r.byteLength, r.xpos, r.y, r.paint)); | 90 DRAW(DrawPosTextH, drawPosTextH(r.text, r.byteLength, r.xpos, r.y, r.paint)); |
| 91 DRAW(DrawRRect, drawRRect(r.rrect, r.paint)); | 91 DRAW(DrawRRect, drawRRect(r.rrect, r.paint)); |
| 92 DRAW(DrawRect, drawRect(r.rect, r.paint)); | 92 DRAW(DrawRect, drawRect(r.rect, r.paint)); |
| 93 DRAW(DrawSprite, drawSprite(shallow_copy(r.bitmap), r.left, r.top, r.paint)); | 93 DRAW(DrawSprite, drawSprite(shallow_copy(r.bitmap), r.left, r.top, r.paint)); |
| 94 DRAW(DrawText, drawText(r.text, r.byteLength, r.x, r.y, r.paint)); | 94 DRAW(DrawText, drawText(r.text, r.byteLength, r.x, r.y, r.paint)); |
| 95 DRAW(DrawTextOnPath, drawTextOnPath(r.text, r.byteLength, r.path, r.matrix, r.pa
int)); | 95 DRAW(DrawTextOnPath, drawTextOnPath(r.text, r.byteLength, r.path, r.matrix, r.pa
int)); |
| 96 DRAW(DrawVertices, drawVertices(r.vmode, r.vertexCount, r.vertices, r.texs, r.co
lors, | 96 DRAW(DrawVertices, drawVertices(r.vmode, r.vertexCount, r.vertices, r.texs, r.co
lors, |
| (...skipping 25 matching lines...) Expand all Loading... |
| 122 }; | 122 }; |
| 123 | 123 |
| 124 } // namespace SkRecords | 124 } // namespace SkRecords |
| 125 | 125 |
| 126 void SkRecordFillBounds(const SkRecord& record, SkBBoxHierarchy* bbh) { | 126 void SkRecordFillBounds(const SkRecord& record, SkBBoxHierarchy* bbh) { |
| 127 SkASSERT(NULL != bbh); | 127 SkASSERT(NULL != bbh); |
| 128 for(SkRecords::FillBounds fb(bbh); fb.index() < record.count(); fb.next()) { | 128 for(SkRecords::FillBounds fb(bbh); fb.index() < record.count(); fb.next()) { |
| 129 record.visit<void>(fb.index(), fb); | 129 record.visit<void>(fb.index(), fb); |
| 130 } | 130 } |
| 131 } | 131 } |
| OLD | NEW |