diff options
author | commit-bot@chromium.org <commit-bot@chromium.org@2bbb7eff-a529-9590-31e7-b0007b416f81> | 2014-04-23 21:03:45 +0000 |
---|---|---|
committer | commit-bot@chromium.org <commit-bot@chromium.org@2bbb7eff-a529-9590-31e7-b0007b416f81> | 2014-04-23 21:03:45 +0000 |
commit | b2db44376eedaba05f6eae4251016009cd3c607d (patch) | |
tree | 78cd89ebab5eff88ffd8ccb26657ff5abcff14b4 /bench/RTreeBench.cpp | |
parent | 034c66b57f4869c6a6e2f9208dddd8d4aec9d672 (diff) |
Rename benchmark classes, hopefully less confusing to valgrid?
I was able to reproduce the problem, but Valgrind was giving me a very odd
report, pointing to a particular line in QuadTreeBench.cpp from a stack that
was running RTreeBench.
Whenever Valgrind complains, it's always about switch(fQuery), line 109 in
QuadTreeBench or 119 in RTreeBench. I can't see any way that fQuery is not
initialized.
I believe we've just confused Valgrind by linking together classes with
identical names. This CL gives them all unique names.
BUG=skia:2455
R=bungeman@google.com, mtklein@google.com, bsalomon@google.com, borenet@google.com
Author: mtklein@chromium.org
Review URL: https://codereview.chromium.org/247913003
git-svn-id: http://skia.googlecode.com/svn/trunk@14338 2bbb7eff-a529-9590-31e7-b0007b416f81
Diffstat (limited to 'bench/RTreeBench.cpp')
-rw-r--r-- | bench/RTreeBench.cpp | 66 |
1 files changed, 33 insertions, 33 deletions
diff --git a/bench/RTreeBench.cpp b/bench/RTreeBench.cpp index b51cc4c6a9..d8e6347379 100644 --- a/bench/RTreeBench.cpp +++ b/bench/RTreeBench.cpp @@ -21,9 +21,9 @@ static const int GRID_WIDTH = 100; 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 { +class RTreeBuildBench : public SkBenchmark { public: - BBoxBuildBench(const char* name, MakeRectProc proc, bool bulkLoad, + RTreeBuildBench(const char* name, MakeRectProc proc, bool bulkLoad, SkBBoxHierarchy* tree) : fTree(tree) , fProc(proc) @@ -40,7 +40,7 @@ public: return backend == kNonRendering_Backend; } - virtual ~BBoxBuildBench() { + virtual ~RTreeBuildBench() { fTree->unref(); } protected: @@ -67,7 +67,7 @@ private: }; // Time how long it takes to perform queries on an R-Tree, bulk-loaded or not -class BBoxQueryBench : public SkBenchmark { +class RTreeQueryBench : public SkBenchmark { public: enum QueryType { kSmall_QueryType, // small queries @@ -76,7 +76,7 @@ public: kFull_QueryType // queries that cover everything }; - BBoxQueryBench(const char* name, MakeRectProc proc, bool bulkLoad, + RTreeQueryBench(const char* name, MakeRectProc proc, bool bulkLoad, QueryType q, SkBBoxHierarchy* tree) : fTree(tree) , fProc(proc) @@ -94,7 +94,7 @@ public: return backend == kNonRendering_Backend; } - virtual ~BBoxQueryBench() { + virtual ~RTreeQueryBench() { fTree->unref(); } protected: @@ -189,81 +189,81 @@ static inline SkIRect make_random_rects(SkRandom& rand, int index, int numRects) /////////////////////////////////////////////////////////////////////////////// DEF_BENCH( - return SkNEW_ARGS(BBoxBuildBench, ("XYordered", &make_XYordered_rects, false, + return SkNEW_ARGS(RTreeBuildBench, ("XYordered", &make_XYordered_rects, false, SkRTree::Create(5, 16))); ) DEF_BENCH( - return SkNEW_ARGS(BBoxBuildBench, ("XYordered", &make_XYordered_rects, true, + return SkNEW_ARGS(RTreeBuildBench, ("XYordered", &make_XYordered_rects, true, SkRTree::Create(5, 16))); ) DEF_BENCH( - return SkNEW_ARGS(BBoxBuildBench, ("(unsorted)XYordered", &make_XYordered_rects, true, + return SkNEW_ARGS(RTreeBuildBench, ("(unsorted)XYordered", &make_XYordered_rects, true, SkRTree::Create(5, 16, 1, false))); ) DEF_BENCH( - return SkNEW_ARGS(BBoxQueryBench, ("XYordered", &make_XYordered_rects, true, - BBoxQueryBench::kRandom_QueryType, SkRTree::Create(5, 16))); + return SkNEW_ARGS(RTreeQueryBench, ("XYordered", &make_XYordered_rects, true, + RTreeQueryBench::kRandom_QueryType, SkRTree::Create(5, 16))); ) DEF_BENCH( - return SkNEW_ARGS(BBoxQueryBench, ("(unsorted)XYordered", &make_XYordered_rects, true, - BBoxQueryBench::kRandom_QueryType, SkRTree::Create(5, 16, 1, false))); + return SkNEW_ARGS(RTreeQueryBench, ("(unsorted)XYordered", &make_XYordered_rects, true, + RTreeQueryBench::kRandom_QueryType, SkRTree::Create(5, 16, 1, false))); ) DEF_BENCH( - return SkNEW_ARGS(BBoxBuildBench, ("YXordered", &make_YXordered_rects, false, + return SkNEW_ARGS(RTreeBuildBench, ("YXordered", &make_YXordered_rects, false, SkRTree::Create(5, 16))); ) DEF_BENCH( - return SkNEW_ARGS(BBoxBuildBench, ("YXordered", &make_YXordered_rects, true, + return SkNEW_ARGS(RTreeBuildBench, ("YXordered", &make_YXordered_rects, true, SkRTree::Create(5, 16))); ) DEF_BENCH( - return SkNEW_ARGS(BBoxBuildBench, ("(unsorted)YXordered", &make_YXordered_rects, true, + return SkNEW_ARGS(RTreeBuildBench, ("(unsorted)YXordered", &make_YXordered_rects, true, SkRTree::Create(5, 16, 1, false))); ) DEF_BENCH( - return SkNEW_ARGS(BBoxQueryBench, ("YXordered", &make_YXordered_rects, true, - BBoxQueryBench::kRandom_QueryType, SkRTree::Create(5, 16))); + return SkNEW_ARGS(RTreeQueryBench, ("YXordered", &make_YXordered_rects, true, + RTreeQueryBench::kRandom_QueryType, SkRTree::Create(5, 16))); ) DEF_BENCH( - return SkNEW_ARGS(BBoxQueryBench, ("(unsorted)YXordered", &make_YXordered_rects, true, - BBoxQueryBench::kRandom_QueryType, SkRTree::Create(5, 16, 1, false))); + return SkNEW_ARGS(RTreeQueryBench, ("(unsorted)YXordered", &make_YXordered_rects, true, + RTreeQueryBench::kRandom_QueryType, SkRTree::Create(5, 16, 1, false))); ) DEF_BENCH( - return SkNEW_ARGS(BBoxBuildBench, ("random", &make_random_rects, false, + return SkNEW_ARGS(RTreeBuildBench, ("random", &make_random_rects, false, SkRTree::Create(5, 16))); ) DEF_BENCH( - return SkNEW_ARGS(BBoxBuildBench, ("random", &make_random_rects, true, + return SkNEW_ARGS(RTreeBuildBench, ("random", &make_random_rects, true, SkRTree::Create(5, 16))); ) DEF_BENCH( - return SkNEW_ARGS(BBoxBuildBench, ("(unsorted)random", &make_random_rects, true, + return SkNEW_ARGS(RTreeBuildBench, ("(unsorted)random", &make_random_rects, true, SkRTree::Create(5, 16, 1, false))); ) DEF_BENCH( - return SkNEW_ARGS(BBoxQueryBench, ("random", &make_random_rects, true, - BBoxQueryBench::kRandom_QueryType, SkRTree::Create(5, 16))); + return SkNEW_ARGS(RTreeQueryBench, ("random", &make_random_rects, true, + RTreeQueryBench::kRandom_QueryType, SkRTree::Create(5, 16))); ) DEF_BENCH( - return SkNEW_ARGS(BBoxQueryBench, ("(unsorted)random", &make_random_rects, true, - BBoxQueryBench::kRandom_QueryType, SkRTree::Create(5, 16, 1, false))); + return SkNEW_ARGS(RTreeQueryBench, ("(unsorted)random", &make_random_rects, true, + RTreeQueryBench::kRandom_QueryType, SkRTree::Create(5, 16, 1, false))); ) DEF_BENCH( - return SkNEW_ARGS(BBoxBuildBench, ("concentric", + return SkNEW_ARGS(RTreeBuildBench, ("concentric", &make_concentric_rects_increasing, true, SkRTree::Create(5, 16))); ) DEF_BENCH( - return SkNEW_ARGS(BBoxBuildBench, ("(unsorted)concentric", + return SkNEW_ARGS(RTreeBuildBench, ("(unsorted)concentric", &make_concentric_rects_increasing, true, SkRTree::Create(5, 16, 1, false))); ) DEF_BENCH( - return SkNEW_ARGS(BBoxQueryBench, ("concentric", &make_concentric_rects_increasing, true, - BBoxQueryBench::kRandom_QueryType, SkRTree::Create(5, 16))); + return SkNEW_ARGS(RTreeQueryBench, ("concentric", &make_concentric_rects_increasing, true, + RTreeQueryBench::kRandom_QueryType, SkRTree::Create(5, 16))); ) DEF_BENCH( - return SkNEW_ARGS(BBoxQueryBench, ("(unsorted)concentric", &make_concentric_rects_increasing, true, - BBoxQueryBench::kRandom_QueryType, SkRTree::Create(5, 16, 1, false))); + return SkNEW_ARGS(RTreeQueryBench, ("(unsorted)concentric", &make_concentric_rects_increasing, true, + RTreeQueryBench::kRandom_QueryType, SkRTree::Create(5, 16, 1, false))); ) |