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
|
// Copyright 2016 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "base/timer/lap_timer.h"
#include "cc/base/rtree.h"
#include "testing/gtest/include/gtest/gtest.h"
#include "testing/perf/perf_result_reporter.h"
namespace cc {
namespace {
static const int kTimeLimitMillis = 2000;
static const int kWarmupRuns = 5;
static const int kTimeCheckInterval = 10;
template <typename Container>
size_t Accumulate(const Container& container) {
size_t result = 0;
for (size_t index : container)
result += index;
return result;
}
class RTreePerfTest : public testing::Test {
public:
RTreePerfTest()
: timer_(kWarmupRuns,
base::TimeDelta::FromMilliseconds(kTimeLimitMillis),
kTimeCheckInterval) {}
void RunConstructTest(const std::string& test_name, int rect_count) {
std::vector<gfx::Rect> rects = BuildRects(rect_count);
timer_.Reset();
do {
RTree<size_t> rtree;
rtree.Build(rects);
timer_.NextLap();
} while (!timer_.HasTimeLimitExpired());
perf_test::PerfResultReporter reporter = SetUpReporter(test_name);
reporter.AddResult("_construct", timer_.LapsPerSecond());
}
void RunSearchTest(const std::string& test_name, int rect_count) {
int large_query = std::sqrt(rect_count);
std::vector<gfx::Rect> queries = {
gfx::Rect(0, 0, 1, 1), gfx::Rect(100, 100, 2, 2),
gfx::Rect(-10, -10, 1, 1), gfx::Rect(0, 0, 1000, 1000),
gfx::Rect(large_query - 2, large_query - 2, 1, 1)};
size_t query_index = 0;
std::vector<gfx::Rect> rects = BuildRects(rect_count);
RTree<size_t> rtree;
rtree.Build(rects);
timer_.Reset();
do {
std::vector<size_t> results;
rtree.Search(queries[query_index], &results);
Accumulate(results);
query_index = (query_index + 1) % queries.size();
timer_.NextLap();
} while (!timer_.HasTimeLimitExpired());
perf_test::PerfResultReporter reporter = SetUpReporter(test_name);
reporter.AddResult("_search", timer_.LapsPerSecond());
}
std::vector<gfx::Rect> BuildRects(int count) {
std::vector<gfx::Rect> result;
int width = std::sqrt(count);
int x = 0;
int y = 0;
for (int i = 0; i < count; ++i) {
result.push_back(gfx::Rect(x, y, 1, 1));
if (++x > width) {
x = 0;
++y;
}
}
return result;
}
protected:
perf_test::PerfResultReporter SetUpReporter(const std::string& story_name) {
perf_test::PerfResultReporter reporter("rtree", story_name);
reporter.RegisterImportantMetric("_construct", "runs/s");
reporter.RegisterImportantMetric("_search", "runs/s");
return reporter;
}
base::LapTimer timer_;
};
TEST_F(RTreePerfTest, Construct) {
RunConstructTest("100", 100);
RunConstructTest("1000", 1000);
RunConstructTest("10000", 10000);
RunConstructTest("100000", 100000);
}
TEST_F(RTreePerfTest, Search) {
RunSearchTest("100", 100);
RunSearchTest("1000", 1000);
RunSearchTest("10000", 10000);
RunSearchTest("100000", 100000);
}
} // namespace
} // namespace cc
|
