| 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 "SkBenchmark.h" | 8 #include "SkBenchmark.h" |
| 9 #include "SkBitmap.h" | 9 #include "SkBitmap.h" |
| 10 #include "SkCanvas.h" | 10 #include "SkCanvas.h" |
| 11 #include "SkColorPriv.h" | 11 #include "SkColorPriv.h" |
| 12 #include "SkPaint.h" | 12 #include "SkPaint.h" |
| 13 #include "SkRandom.h" | 13 #include "SkRandom.h" |
| 14 #include "SkShader.h" | 14 #include "SkShader.h" |
| 15 #include "SkString.h" | 15 #include "SkString.h" |
| 16 | 16 |
| 17 static int rand_pts(SkMWCRandom& rand, SkPoint pts[4]) { | 17 static int rand_pts(SkRandom& rand, SkPoint pts[4]) { |
| 18 int n = rand.nextU() & 3; | 18 int n = rand.nextU() & 3; |
| 19 n += 1; | 19 n += 1; |
| 20 | 20 |
| 21 for (int i = 0; i < n; ++i) { | 21 for (int i = 0; i < n; ++i) { |
| 22 pts[i].fX = rand.nextSScalar1(); | 22 pts[i].fX = rand.nextSScalar1(); |
| 23 pts[i].fY = rand.nextSScalar1(); | 23 pts[i].fY = rand.nextSScalar1(); |
| 24 } | 24 } |
| 25 return n; | 25 return n; |
| 26 } | 26 } |
| 27 | 27 |
| 28 class PathIterBench : public SkBenchmark { | 28 class PathIterBench : public SkBenchmark { |
| 29 SkString fName; | 29 SkString fName; |
| 30 SkPath fPath; | 30 SkPath fPath; |
| 31 bool fRaw; | 31 bool fRaw; |
| 32 | 32 |
| 33 enum { N = SkBENCHLOOP(500) }; | 33 enum { N = SkBENCHLOOP(500) }; |
| 34 | 34 |
| 35 public: | 35 public: |
| 36 PathIterBench(void* param, bool raw) : INHERITED(param) { | 36 PathIterBench(void* param, bool raw) : INHERITED(param) { |
| 37 fName.printf("pathiter_%s", raw ? "raw" : "consume"); | 37 fName.printf("pathiter_%s", raw ? "raw" : "consume"); |
| 38 fRaw = raw; | 38 fRaw = raw; |
| 39 | 39 |
| 40 SkMWCRandom rand; | 40 SkRandom rand; |
| 41 for (int i = 0; i < 1000; ++i) { | 41 for (int i = 0; i < 1000; ++i) { |
| 42 SkPoint pts[4]; | 42 SkPoint pts[4]; |
| 43 int n = rand_pts(rand, pts); | 43 int n = rand_pts(rand, pts); |
| 44 switch (n) { | 44 switch (n) { |
| 45 case 1: | 45 case 1: |
| 46 fPath.moveTo(pts[0]); | 46 fPath.moveTo(pts[0]); |
| 47 break; | 47 break; |
| 48 case 2: | 48 case 2: |
| 49 fPath.lineTo(pts[1]); | 49 fPath.lineTo(pts[1]); |
| 50 break; | 50 break; |
| (...skipping 38 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 89 typedef SkBenchmark INHERITED; | 89 typedef SkBenchmark INHERITED; |
| 90 }; | 90 }; |
| 91 | 91 |
| 92 /////////////////////////////////////////////////////////////////////////////// | 92 /////////////////////////////////////////////////////////////////////////////// |
| 93 | 93 |
| 94 static SkBenchmark* F0(void* p) { return new PathIterBench(p, false); } | 94 static SkBenchmark* F0(void* p) { return new PathIterBench(p, false); } |
| 95 static SkBenchmark* F1(void* p) { return new PathIterBench(p, true); } | 95 static SkBenchmark* F1(void* p) { return new PathIterBench(p, true); } |
| 96 | 96 |
| 97 static BenchRegistry gR0(F0); | 97 static BenchRegistry gR0(F0); |
| 98 static BenchRegistry gR1(F1); | 98 static BenchRegistry gR1(F1); |
| OLD | NEW |