123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177 |
- /*
- * Copyright 2012 Google Inc.
- *
- * Use of this source code is governed by a BSD-style license that can be
- * found in the LICENSE file.
- */
- #include "include/core/SkTypes.h"
- #include "bench/Benchmark.h"
- #include "include/private/SkTDArray.h"
- #include "include/private/SkTemplates.h"
- #include "include/utils/SkRandom.h"
- #include "src/gpu/GrMemoryPool.h"
- #include <new>
- // change this to 0 to compare GrMemoryPool to default new / delete
- #define OVERRIDE_NEW 1
- struct A {
- 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 A::gBenchPool(10 * (1 << 10), 10 * (1 << 10));
- /**
- * This benchmark creates and deletes objects in stack order
- */
- class GrMemoryPoolBenchStack : public Benchmark {
- public:
- bool isSuitableFor(Backend backend) override {
- return backend == kNonRendering_Backend;
- }
- protected:
- const char* onGetName() override {
- return "grmemorypool_stack";
- }
- void onDraw(int loops, SkCanvas*) override {
- SkRandom r;
- enum {
- kMaxObjects = 4 * (1 << 10),
- };
- A* objects[kMaxObjects];
- // We delete if a random number [-1, 1] is < the thresh. Otherwise,
- // we allocate. We start allocate-biased and ping-pong to delete-biased
- SkScalar delThresh = -SK_ScalarHalf;
- const int kSwitchThreshPeriod = loops / (2 * kMaxObjects);
- int s = 0;
- int count = 0;
- for (int i = 0; i < loops; i++, ++s) {
- if (kSwitchThreshPeriod == s) {
- delThresh = -delThresh;
- s = 0;
- }
- SkScalar del = r.nextSScalar1();
- if (count &&
- (kMaxObjects == count || del < delThresh)) {
- delete objects[count-1];
- --count;
- } else {
- objects[count] = new A;
- ++count;
- }
- }
- for (int i = 0; i < count; ++i) {
- delete objects[i];
- }
- }
- private:
- typedef Benchmark 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
- */
- class GrMemoryPoolBenchRandom : public Benchmark {
- public:
- bool isSuitableFor(Backend backend) override {
- return backend == kNonRendering_Backend;
- }
- protected:
- const char* onGetName() override {
- return "grmemorypool_random";
- }
- void onDraw(int loops, SkCanvas*) override {
- SkRandom r;
- enum {
- kMaxObjects = 4 * (1 << 10),
- };
- std::unique_ptr<B> objects[kMaxObjects];
- for (int i = 0; i < loops; i++) {
- uint32_t idx = r.nextRangeU(0, kMaxObjects-1);
- if (nullptr == objects[idx].get()) {
- objects[idx].reset(new B);
- } else {
- objects[idx].reset();
- }
- }
- }
- private:
- typedef Benchmark 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
- */
- class GrMemoryPoolBenchQueue : public Benchmark {
- enum {
- M = 4 * (1 << 10),
- };
- public:
- bool isSuitableFor(Backend backend) override {
- return backend == kNonRendering_Backend;
- }
- protected:
- const char* onGetName() override {
- return "grmemorypool_queue";
- }
- void onDraw(int loops, SkCanvas*) override {
- SkRandom r;
- 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 C;
- }
- for (uint32_t i = 0; i < count; i++) {
- delete objects[i];
- }
- }
- }
- private:
- typedef Benchmark INHERITED;
- };
- ///////////////////////////////////////////////////////////////////////////////
- DEF_BENCH( return new GrMemoryPoolBenchStack(); )
- DEF_BENCH( return new GrMemoryPoolBenchRandom(); )
- DEF_BENCH( return new GrMemoryPoolBenchQueue(); )
|