Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(160)

Unified Diff: bench/GrMemoryPoolBench.cpp

Issue 178473006: DM: also run benches once. (Closed) Base URL: https://skia.googlesource.com/skia.git@dm
Patch Set: add note Created 6 years, 10 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View side-by-side diff with in-line comments
Download patch
« no previous file with comments | « no previous file | bench/SkBenchmark.h » ('j') | no next file with comments »
Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
Index: bench/GrMemoryPoolBench.cpp
diff --git a/bench/GrMemoryPoolBench.cpp b/bench/GrMemoryPoolBench.cpp
index 21f686d89d289cba8bcc29e737a7f8bd442cd083..96526e5fc2abc73aff8def97ae87b68d15534172 100644
--- a/bench/GrMemoryPoolBench.cpp
+++ b/bench/GrMemoryPoolBench.cpp
@@ -20,12 +20,12 @@
struct A {
int gStuff[10];
#if OVERRIDE_NEW
- void* operator new (size_t size) { return gPool.allocate(size); }
- void operator delete (void* mem) { if (mem) { return gPool.release(mem); } }
+ void* operator new (size_t size) { return gBenchPool.allocate(size); }
+ void operator delete (void* mem) { if (mem) { return gBenchPool.release(mem); } }
#endif
- static GrMemoryPool gPool;
+ static GrMemoryPool gBenchPool;
};
-GrMemoryPool A::gPool(10 * (1 << 10), 10 * (1 << 10));
+GrMemoryPool A::gBenchPool(10 * (1 << 10), 10 * (1 << 10));
/**
* This benchmark creates and deletes objects in stack order
@@ -79,6 +79,16 @@ private:
typedef SkBenchmark INHERITED;
};
+struct B {
+ int gStuff[10];
+#if OVERRIDE_NEW
+ void* operator new (size_t size) { return gBenchPool.allocate(size); }
+ void operator delete (void* mem) { if (mem) { return gBenchPool.release(mem); } }
+#endif
+ static GrMemoryPool gBenchPool;
+};
+GrMemoryPool B::gBenchPool(10 * (1 << 10), 10 * (1 << 10));
+
/**
* This benchmark creates objects and deletes them in random order
*/
@@ -98,12 +108,12 @@ protected:
enum {
kMaxObjects = 4 * (1 << 10),
};
- SkAutoTDelete<A> objects[kMaxObjects];
+ SkAutoTDelete<B> objects[kMaxObjects];
for (int i = 0; i < loops; i++) {
uint32_t idx = r.nextRangeU(0, kMaxObjects-1);
if (NULL == objects[idx].get()) {
- objects[idx].reset(new A);
+ objects[idx].reset(new B);
} else {
objects[idx].free();
}
@@ -114,6 +124,16 @@ private:
typedef SkBenchmark INHERITED;
};
+struct C {
+ int gStuff[10];
+#if OVERRIDE_NEW
+ void* operator new (size_t size) { return gBenchPool.allocate(size); }
+ void operator delete (void* mem) { if (mem) { return gBenchPool.release(mem); } }
+#endif
+ static GrMemoryPool gBenchPool;
+};
+GrMemoryPool C::gBenchPool(10 * (1 << 10), 10 * (1 << 10));
+
/**
* This benchmark creates objects and deletes them in queue order
*/
@@ -133,11 +153,11 @@ protected:
virtual void onDraw(const int loops, SkCanvas*) {
SkRandom r;
- A* objects[M];
+ C* objects[M];
for (int i = 0; i < loops; i++) {
uint32_t count = r.nextRangeU(0, M-1);
for (uint32_t i = 0; i < count; i++) {
- objects[i] = new A;
+ objects[i] = new C;
}
for (uint32_t i = 0; i < count; i++) {
delete objects[i];
« no previous file with comments | « no previous file | bench/SkBenchmark.h » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698