1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
|
/*
* Copyright © 2011 Intel Corporation
*
* Permission is hereby granted, free of charge, to any person
* obtaining a copy of this software and associated documentation
* files (the "Software"), to deal in the Software without
* restriction, including without limitation the rights to use, copy,
* modify, merge, publish, distribute, sublicense, and/or sell copies
* of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
* BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
* ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*
* Author: Chris Wilson <chris@chris-wilson.co.uk>
*/
/* This is a variant on many strokes where we precompute
* a simplified stroke-to-path.
* When we have a real stroke-to-path, it would useful to compare the cost
* of stroking vs filling the "identical" paths.
*/
#include "cairo-perf.h"
static uint32_t state;
static double
uniform_random (double minval, double maxval)
{
static uint32_t const poly = 0x9a795537U;
uint32_t n = 32;
while (n-->0)
state = 2*state < state ? (2*state ^ poly) : 2*state;
return minval + state * (maxval - minval) / 4294967296.0;
}
static cairo_time_t
do_many_fills_ha (cairo_t *cr, int width, int height, int loops)
{
int count;
state = 0xc0ffee;
for (count = 0; count < 1000; count++) {
double y = floor (uniform_random (0, height));
double x = floor (uniform_random (0, width));
cairo_rectangle (cr, x, y, ceil (uniform_random (0, width)) - x, 1);
}
cairo_perf_timer_start ();
while (loops--)
cairo_fill_preserve (cr);
cairo_perf_timer_stop ();
cairo_new_path (cr);
return cairo_perf_timer_elapsed ();
}
static cairo_time_t
do_many_fills_h (cairo_t *cr, int width, int height, int loops)
{
int count;
state = 0xc0ffee;
for (count = 0; count < 1000; count++) {
double y = uniform_random (0, height);
double x = uniform_random (0, width);
cairo_rectangle (cr, x, y, uniform_random (0, width) - x, 1);
}
cairo_perf_timer_start ();
while (loops--)
cairo_fill_preserve (cr);
cairo_perf_timer_stop ();
cairo_new_path (cr);
return cairo_perf_timer_elapsed ();
}
static cairo_time_t
do_many_fills_va (cairo_t *cr, int width, int height, int loops)
{
int count;
state = 0xc0ffee;
for (count = 0; count < 1000; count++) {
double x = floor (uniform_random (0, width));
double y = floor (uniform_random (0, height));
cairo_rectangle (cr, x, y, 1, ceil (uniform_random (0, height) - y));
}
cairo_perf_timer_start ();
while (loops--)
cairo_fill_preserve (cr);
cairo_perf_timer_stop ();
cairo_new_path (cr);
return cairo_perf_timer_elapsed ();
}
static cairo_time_t
do_many_fills_v (cairo_t *cr, int width, int height, int loops)
{
int count;
state = 0xc0ffee;
for (count = 0; count < 1000; count++) {
double x = uniform_random (0, width);
double y = uniform_random (0, height);
cairo_rectangle (cr, x, y, 1, uniform_random (0, height) - y);
}
cairo_perf_timer_start ();
while (loops--)
cairo_fill_preserve (cr);
cairo_perf_timer_stop ();
cairo_new_path (cr);
return cairo_perf_timer_elapsed ();
}
static cairo_time_t
do_many_fills (cairo_t *cr, int width, int height, int loops)
{
int count;
/* lots and lots of overlapping stroke-like fills */
state = 0xc0ffee;
for (count = 0; count < 1000; count++) {
cairo_save (cr);
cairo_translate (cr,
uniform_random (0, width),
uniform_random (0, height));
cairo_rotate (cr, uniform_random (-M_PI,M_PI));
cairo_rectangle (cr, 0, 0, uniform_random (0, width), 1);
cairo_restore (cr);
}
cairo_perf_timer_start ();
while (loops--)
cairo_fill_preserve (cr);
cairo_perf_timer_stop ();
cairo_new_path (cr);
return cairo_perf_timer_elapsed ();
}
cairo_bool_t
many_fills_enabled (cairo_perf_t *perf)
{
return cairo_perf_can_run (perf, "many-fills", NULL);
}
void
many_fills (cairo_perf_t *perf, cairo_t *cr, int width, int height)
{
cairo_perf_run (perf, "many-fills-halign", do_many_fills_ha, NULL);
cairo_perf_run (perf, "many-fills-valign", do_many_fills_va, NULL);
cairo_perf_run (perf, "many-fills-horizontal", do_many_fills_h, NULL);
cairo_perf_run (perf, "many-fills-vertical", do_many_fills_v, NULL);
cairo_perf_run (perf, "many-fills-random", do_many_fills, NULL);
}
|
