blob: 1d8575735f76ab64264b76bf4645f73883eb59d8 [file] [log] [blame]
reed1119c872014-10-09 14:29:01 -07001/*
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
8#include "Benchmark.h"
9#include "SkGeometry.h"
10#include "SkRandom.h"
11#include "SkRect.h"
12
13class GeometryBench : public Benchmark {
14public:
15 GeometryBench(const char suffix[]) : fVolatileInt(0) {
16 fName.printf("geo_%s", suffix);
17 }
18
mtklein72c9faa2015-01-09 10:06:39 -080019 const char* onGetName() SK_OVERRIDE {
reed1119c872014-10-09 14:29:01 -070020 return fName.c_str();
21 }
22
mtklein72c9faa2015-01-09 10:06:39 -080023 bool isSuitableFor(Backend backend) SK_OVERRIDE {
reed1119c872014-10-09 14:29:01 -070024 return kNonRendering_Backend == backend;
25 }
26
27protected:
28 volatile int fVolatileInt;
29
30 /**
31 * Subclasses can call this to try to defeat the optimizer (with some result of their
32 * inner loop), since it will fool the compiler into assuming that "n" is actually
33 * needed somewhere, and since this method is not const, the member fields cannot
34 * be assumed to be const before and after the call.
35 */
36 virtual void virtualCallToFoilOptimizers(int n) { fVolatileInt += n; }
37
38private:
39 SkString fName;
40};
41
42class GeoRectBench : public GeometryBench {
43public:
44 GeoRectBench(const char suffix[]) : GeometryBench(suffix) {}
45
46protected:
47 SkRect fRects[2048];
48
49 virtual void onPreDraw() {
50 const SkScalar min = -100;
51 const SkScalar max = 100;
52 SkRandom rand;
53 for (size_t i = 0; i < SK_ARRAY_COUNT(fRects); ++i) {
54 SkScalar x = rand.nextRangeScalar(min, max);
55 SkScalar y = rand.nextRangeScalar(min, max);
56 SkScalar w = rand.nextRangeScalar(min, max);
57 SkScalar h = rand.nextRangeScalar(min, max);
58 fRects[i].setXYWH(x, y, w, h);
59 }
60 }
61};
62
63class GeoRectBench_intersect : public GeoRectBench {
64public:
65 GeoRectBench_intersect() : GeoRectBench("rect_intersect") {}
66
67protected:
mtklein72c9faa2015-01-09 10:06:39 -080068 void onDraw(const int loops, SkCanvas* canvas) SK_OVERRIDE {
reed1119c872014-10-09 14:29:01 -070069 for (int outer = 0; outer < loops; ++outer) {
70 int count = 0;
71 for (size_t i = 0; i < SK_ARRAY_COUNT(fRects); ++i) {
72 SkRect r = fRects[0];
73 count += r.intersect(fRects[i]);
74 }
75 this->virtualCallToFoilOptimizers(count);
76 }
77 }
78};
79
80class GeoRectBench_intersect_rect : public GeoRectBench {
81public:
82 GeoRectBench_intersect_rect() : GeoRectBench("rect_intersect_rect") {}
83
84protected:
mtklein72c9faa2015-01-09 10:06:39 -080085 void onDraw(const int loops, SkCanvas* canvas) SK_OVERRIDE {
reed1119c872014-10-09 14:29:01 -070086 for (int outer = 0; outer < loops; ++outer) {
87 int count = 0;
88 SkRect r;
89 for (size_t i = 0; i < SK_ARRAY_COUNT(fRects); ++i) {
90 count += r.intersect(fRects[0], fRects[i]);
91 }
92 this->virtualCallToFoilOptimizers(count);
93 }
94 }
95};
96
97class GeoRectBench_Intersects : public GeoRectBench {
98public:
99 GeoRectBench_Intersects() : GeoRectBench("rect_Intersects") {}
mtkleindba3e642014-10-20 10:43:55 -0700100
reed1119c872014-10-09 14:29:01 -0700101protected:
mtklein72c9faa2015-01-09 10:06:39 -0800102 void onDraw(const int loops, SkCanvas* canvas) SK_OVERRIDE {
reed1119c872014-10-09 14:29:01 -0700103 for (int outer = 0; outer < loops; ++outer) {
104 int count = 0;
105 for (size_t i = 0; i < SK_ARRAY_COUNT(fRects); ++i) {
106 count += SkRect::Intersects(fRects[0], fRects[i]);
107 }
108 this->virtualCallToFoilOptimizers(count);
109 }
110 }
111};
112
reed40636a52014-10-10 05:50:15 -0700113class GeoRectBench_sort : public GeoRectBench {
114public:
115 GeoRectBench_sort() : GeoRectBench("rect_sort") {}
mtkleindba3e642014-10-20 10:43:55 -0700116
reed40636a52014-10-10 05:50:15 -0700117protected:
mtklein72c9faa2015-01-09 10:06:39 -0800118 void onDraw(const int loops, SkCanvas* canvas) SK_OVERRIDE {
reed40636a52014-10-10 05:50:15 -0700119 for (int outer = 0; outer < loops; ++outer) {
120 for (size_t i = 0; i < SK_ARRAY_COUNT(fRects); ++i) {
121 fRects[i].sort();
122 }
123 }
124 }
125};
126
reed1119c872014-10-09 14:29:01 -0700127DEF_BENCH( return new GeoRectBench_intersect; )
128DEF_BENCH( return new GeoRectBench_intersect_rect; )
129DEF_BENCH( return new GeoRectBench_Intersects; )
reed40636a52014-10-10 05:50:15 -0700130
131DEF_BENCH( return new GeoRectBench_sort; )
reed65cb2cd2015-03-19 10:18:47 -0700132
133///////////////////////////////////////////////////////////////////////////////////////////////////
134
135class EvalQuadAt0 : public GeometryBench {
136 SkPoint fPts[3];
137public:
138 EvalQuadAt0() : GeometryBench("evalquadat0") {
139 SkRandom rand;
140 for (int i = 0; i < 3; ++i) {
141 fPts[i].set(rand.nextUScalar1(), rand.nextUScalar1());
142 }
143 }
144
145protected:
146 void onDraw(const int loops, SkCanvas* canvas) SK_OVERRIDE {
147 SkPoint result;
148 for (int outer = 0; outer < loops; ++outer) {
149 for (int i = 0; i < 10000; ++i) {
150 SkEvalQuadAt(fPts, 0.5f, &result);
151 }
152 }
153 }
154};
155DEF_BENCH( return new EvalQuadAt0; )
156
157class EvalQuadAt1 : public GeometryBench {
158 SkPoint fPts[3];
159public:
160 EvalQuadAt1() : GeometryBench("evalquadat1") {
161 SkRandom rand;
162 for (int i = 0; i < 3; ++i) {
163 fPts[i].set(rand.nextUScalar1(), rand.nextUScalar1());
164 }
165 }
166
167protected:
168 void onDraw(const int loops, SkCanvas* canvas) SK_OVERRIDE {
169 for (int outer = 0; outer < loops; ++outer) {
170 for (int i = 0; i < 10000; ++i) {
171 SkEvalQuadAt(fPts, 0.5f);
172 }
173 }
174 }
175};
176DEF_BENCH( return new EvalQuadAt1; )
177