diff options
author | mtklein@google.com <mtklein@google.com@2bbb7eff-a529-9590-31e7-b0007b416f81> | 2013-09-13 19:52:27 +0000 |
---|---|---|
committer | mtklein@google.com <mtklein@google.com@2bbb7eff-a529-9590-31e7-b0007b416f81> | 2013-09-13 19:52:27 +0000 |
commit | 410e6e80f00a6c660675c80904807a041c7b7d2a (patch) | |
tree | e6b7287001f032ae9a9e09de19db5d0867bea9e3 /bench/RTreeBench.cpp | |
parent | af54a513a5b7723b53f61730afe0ad6256881749 (diff) |
Refactoring: get rid of the SkBenchmark void* parameter.
While I was doing massive sed-ing, I also converted every bench to use DEF_BENCH instead of registering the ugly manual way.
BUG=
R=scroggo@google.com
Review URL: https://codereview.chromium.org/23876006
git-svn-id: http://skia.googlecode.com/svn/trunk@11263 2bbb7eff-a529-9590-31e7-b0007b416f81
Diffstat (limited to 'bench/RTreeBench.cpp')
-rw-r--r-- | bench/RTreeBench.cpp | 144 |
1 files changed, 61 insertions, 83 deletions
diff --git a/bench/RTreeBench.cpp b/bench/RTreeBench.cpp index 99f8ca8f12..5b69b57ca2 100644 --- a/bench/RTreeBench.cpp +++ b/bench/RTreeBench.cpp @@ -23,10 +23,9 @@ typedef SkIRect (*MakeRectProc)(SkRandom&, int, int); // Time how long it takes to build an R-Tree either bulk-loaded or not class BBoxBuildBench : public SkBenchmark { public: - BBoxBuildBench(void* param, const char* name, MakeRectProc proc, bool bulkLoad, + BBoxBuildBench(const char* name, MakeRectProc proc, bool bulkLoad, SkBBoxHierarchy* tree) - : INHERITED(param) - , fTree(tree) + : fTree(tree) , fProc(proc) , fBulkLoad(bulkLoad) { fName.append("rtree_"); @@ -73,10 +72,9 @@ public: kFull_QueryType // queries that cover everything }; - BBoxQueryBench(void* param, const char* name, MakeRectProc proc, bool bulkLoad, + BBoxQueryBench(const char* name, MakeRectProc proc, bool bulkLoad, QueryType q, SkBBoxHierarchy* tree) - : INHERITED(param) - , fTree(tree) + : fTree(tree) , fProc(proc) , fBulkLoad(bulkLoad) , fQuery(q) { @@ -210,102 +208,82 @@ static inline SkIRect make_large_rects(SkRandom& rand, int index, int numRects) /////////////////////////////////////////////////////////////////////////////// -static inline SkBenchmark* Fact0(void* p) { - return SkNEW_ARGS(BBoxBuildBench, (p, "XYordered", &make_XYordered_rects, false, +DEF_BENCH( + return SkNEW_ARGS(BBoxBuildBench, ("XYordered", &make_XYordered_rects, false, SkRTree::Create(5, 16))); -} -static inline SkBenchmark* Fact1(void* p) { - return SkNEW_ARGS(BBoxBuildBench, (p, "XYordered", &make_XYordered_rects, true, +) +DEF_BENCH( + return SkNEW_ARGS(BBoxBuildBench, ("XYordered", &make_XYordered_rects, true, SkRTree::Create(5, 16))); -} -static inline SkBenchmark* Fact2(void* p) { - return SkNEW_ARGS(BBoxBuildBench, (p, "(unsorted)XYordered", &make_XYordered_rects, true, +) +DEF_BENCH( + return SkNEW_ARGS(BBoxBuildBench, ("(unsorted)XYordered", &make_XYordered_rects, true, SkRTree::Create(5, 16, 1, false))); -} -static inline SkBenchmark* Fact3(void* p) { - return SkNEW_ARGS(BBoxQueryBench, (p, "XYordered", &make_XYordered_rects, true, +) +DEF_BENCH( + return SkNEW_ARGS(BBoxQueryBench, ("XYordered", &make_XYordered_rects, true, BBoxQueryBench::kRandom_QueryType, SkRTree::Create(5, 16))); -} -static inline SkBenchmark* Fact4(void* p) { - return SkNEW_ARGS(BBoxQueryBench, (p, "(unsorted)XYordered", &make_XYordered_rects, true, +) +DEF_BENCH( + return SkNEW_ARGS(BBoxQueryBench, ("(unsorted)XYordered", &make_XYordered_rects, true, BBoxQueryBench::kRandom_QueryType, SkRTree::Create(5, 16, 1, false))); -} +) -static inline SkBenchmark* Fact5(void* p) { - return SkNEW_ARGS(BBoxBuildBench, (p, "YXordered", &make_YXordered_rects, false, +DEF_BENCH( + return SkNEW_ARGS(BBoxBuildBench, ("YXordered", &make_YXordered_rects, false, SkRTree::Create(5, 16))); -} -static inline SkBenchmark* Fact6(void* p) { - return SkNEW_ARGS(BBoxBuildBench, (p, "YXordered", &make_YXordered_rects, true, +) +DEF_BENCH( + return SkNEW_ARGS(BBoxBuildBench, ("YXordered", &make_YXordered_rects, true, SkRTree::Create(5, 16))); -} -static inline SkBenchmark* Fact7(void* p) { - return SkNEW_ARGS(BBoxBuildBench, (p, "(unsorted)YXordered", &make_YXordered_rects, true, +) +DEF_BENCH( + return SkNEW_ARGS(BBoxBuildBench, ("(unsorted)YXordered", &make_YXordered_rects, true, SkRTree::Create(5, 16, 1, false))); -} -static inline SkBenchmark* Fact8(void* p) { - return SkNEW_ARGS(BBoxQueryBench, (p, "YXordered", &make_YXordered_rects, true, +) +DEF_BENCH( + return SkNEW_ARGS(BBoxQueryBench, ("YXordered", &make_YXordered_rects, true, BBoxQueryBench::kRandom_QueryType, SkRTree::Create(5, 16))); -} -static inline SkBenchmark* Fact9(void* p) { - return SkNEW_ARGS(BBoxQueryBench, (p, "(unsorted)YXordered", &make_YXordered_rects, true, +) +DEF_BENCH( + return SkNEW_ARGS(BBoxQueryBench, ("(unsorted)YXordered", &make_YXordered_rects, true, BBoxQueryBench::kRandom_QueryType, SkRTree::Create(5, 16, 1, false))); -} +) -static inline SkBenchmark* Fact10(void* p) { - return SkNEW_ARGS(BBoxBuildBench, (p, "random", &make_random_rects, false, +DEF_BENCH( + return SkNEW_ARGS(BBoxBuildBench, ("random", &make_random_rects, false, SkRTree::Create(5, 16))); -} -static inline SkBenchmark* Fact11(void* p) { - return SkNEW_ARGS(BBoxBuildBench, (p, "random", &make_random_rects, true, +) +DEF_BENCH( + return SkNEW_ARGS(BBoxBuildBench, ("random", &make_random_rects, true, SkRTree::Create(5, 16))); -} -static inline SkBenchmark* Fact12(void* p) { - return SkNEW_ARGS(BBoxBuildBench, (p, "(unsorted)random", &make_random_rects, true, +) +DEF_BENCH( + return SkNEW_ARGS(BBoxBuildBench, ("(unsorted)random", &make_random_rects, true, SkRTree::Create(5, 16, 1, false))); -} -static inline SkBenchmark* Fact13(void* p) { - return SkNEW_ARGS(BBoxQueryBench, (p, "random", &make_random_rects, true, +) +DEF_BENCH( + return SkNEW_ARGS(BBoxQueryBench, ("random", &make_random_rects, true, BBoxQueryBench::kRandom_QueryType, SkRTree::Create(5, 16))); -} -static inline SkBenchmark* Fact14(void* p) { - return SkNEW_ARGS(BBoxQueryBench, (p, "(unsorted)random", &make_random_rects, true, +) +DEF_BENCH( + return SkNEW_ARGS(BBoxQueryBench, ("(unsorted)random", &make_random_rects, true, BBoxQueryBench::kRandom_QueryType, SkRTree::Create(5, 16, 1, false))); -} +) -static inline SkBenchmark* Fact15(void* p) { - return SkNEW_ARGS(BBoxBuildBench, (p, "concentric", +DEF_BENCH( + return SkNEW_ARGS(BBoxBuildBench, ("concentric", &make_concentric_rects_increasing, true, SkRTree::Create(5, 16))); -} -static inline SkBenchmark* Fact16(void* p) { - return SkNEW_ARGS(BBoxBuildBench, (p, "(unsorted)concentric", +) +DEF_BENCH( + return SkNEW_ARGS(BBoxBuildBench, ("(unsorted)concentric", &make_concentric_rects_increasing, true, SkRTree::Create(5, 16, 1, false))); -} -static inline SkBenchmark* Fact17(void* p) { - return SkNEW_ARGS(BBoxQueryBench, (p, "concentric", &make_concentric_rects_increasing, true, +) +DEF_BENCH( + return SkNEW_ARGS(BBoxQueryBench, ("concentric", &make_concentric_rects_increasing, true, BBoxQueryBench::kRandom_QueryType, SkRTree::Create(5, 16))); -} -static inline SkBenchmark* Fact18(void* p) { - return SkNEW_ARGS(BBoxQueryBench, (p, "(unsorted)concentric", &make_concentric_rects_increasing, true, +) +DEF_BENCH( + return SkNEW_ARGS(BBoxQueryBench, ("(unsorted)concentric", &make_concentric_rects_increasing, true, BBoxQueryBench::kRandom_QueryType, SkRTree::Create(5, 16, 1, false))); -} - -static BenchRegistry gReg18(Fact18); -static BenchRegistry gReg17(Fact17); -static BenchRegistry gReg16(Fact16); -static BenchRegistry gReg15(Fact15); -static BenchRegistry gReg14(Fact14); -static BenchRegistry gReg13(Fact13); -static BenchRegistry gReg12(Fact12); -static BenchRegistry gReg11(Fact11); -static BenchRegistry gReg10(Fact10); -static BenchRegistry gReg9(Fact9); -static BenchRegistry gReg8(Fact8); -static BenchRegistry gReg7(Fact7); -static BenchRegistry gReg6(Fact6); -static BenchRegistry gReg5(Fact5); -static BenchRegistry gReg4(Fact4); -static BenchRegistry gReg3(Fact3); -static BenchRegistry gReg2(Fact2); -static BenchRegistry gReg1(Fact1); -static BenchRegistry gReg0(Fact0); +) |