| OLD | NEW |
| 1 /* |
| 2 * Copyright 2014 Google Inc. |
| 3 * |
| 4 * Use of this source code is governed by a BSD-style license that can be |
| 5 * found in the LICENSE file. |
| 6 */ |
| 7 |
| 1 #include "SkRecordCulling.h" | 8 #include "SkRecordCulling.h" |
| 2 | 9 |
| 3 #include "SkRecords.h" | 10 #include "SkRecords.h" |
| 4 #include "SkTDArray.h" | 11 #include "SkTDArray.h" |
| 5 | 12 |
| 6 namespace { | 13 namespace { |
| 7 | 14 |
| 8 struct Annotator { | 15 struct Annotator { |
| 9 unsigned index; | 16 unsigned index; |
| 10 SkTDArray<SkRecords::PushCull*> pushStack; | 17 SkTDArray<SkRecords::PushCull*> pushStack; |
| (...skipping 18 matching lines...) Expand all Loading... |
| 29 | 36 |
| 30 } // namespace | 37 } // namespace |
| 31 | 38 |
| 32 void SkRecordAnnotateCullingPairs(SkRecord* record) { | 39 void SkRecordAnnotateCullingPairs(SkRecord* record) { |
| 33 Annotator annotator; | 40 Annotator annotator; |
| 34 | 41 |
| 35 for (annotator.index = 0; annotator.index < record->count(); annotator.index
++) { | 42 for (annotator.index = 0; annotator.index < record->count(); annotator.index
++) { |
| 36 record->mutate(annotator.index, annotator); | 43 record->mutate(annotator.index, annotator); |
| 37 } | 44 } |
| 38 } | 45 } |
| OLD | NEW |