e0e7cfe44b
The goal here is to get people to start using the new random number generator, while leaving the old one in place so we don't have to rebaseline GMs. R=reed@google.com, bsalomon@google.com Author: jvanverth@google.com Review URL: https://chromiumcodereview.appspot.com/23576015 git-svn-id: http://skia.googlecode.com/svn/trunk@11169 2bbb7eff-a529-9590-31e7-b0007b416f81
99 lines
2.5 KiB
C++
99 lines
2.5 KiB
C++
|
|
/*
|
|
* Copyright 2011 Google Inc.
|
|
*
|
|
* Use of this source code is governed by a BSD-style license that can be
|
|
* found in the LICENSE file.
|
|
*/
|
|
#include "SkBenchmark.h"
|
|
#include "SkBitmap.h"
|
|
#include "SkCanvas.h"
|
|
#include "SkColorPriv.h"
|
|
#include "SkPaint.h"
|
|
#include "SkRandom.h"
|
|
#include "SkShader.h"
|
|
#include "SkString.h"
|
|
|
|
static int rand_pts(SkRandom& rand, SkPoint pts[4]) {
|
|
int n = rand.nextU() & 3;
|
|
n += 1;
|
|
|
|
for (int i = 0; i < n; ++i) {
|
|
pts[i].fX = rand.nextSScalar1();
|
|
pts[i].fY = rand.nextSScalar1();
|
|
}
|
|
return n;
|
|
}
|
|
|
|
class PathIterBench : public SkBenchmark {
|
|
SkString fName;
|
|
SkPath fPath;
|
|
bool fRaw;
|
|
|
|
enum { N = SkBENCHLOOP(500) };
|
|
|
|
public:
|
|
PathIterBench(void* param, bool raw) : INHERITED(param) {
|
|
fName.printf("pathiter_%s", raw ? "raw" : "consume");
|
|
fRaw = raw;
|
|
|
|
SkRandom rand;
|
|
for (int i = 0; i < 1000; ++i) {
|
|
SkPoint pts[4];
|
|
int n = rand_pts(rand, pts);
|
|
switch (n) {
|
|
case 1:
|
|
fPath.moveTo(pts[0]);
|
|
break;
|
|
case 2:
|
|
fPath.lineTo(pts[1]);
|
|
break;
|
|
case 3:
|
|
fPath.quadTo(pts[1], pts[2]);
|
|
break;
|
|
case 4:
|
|
fPath.cubicTo(pts[1], pts[2], pts[3]);
|
|
break;
|
|
}
|
|
}
|
|
|
|
fIsRendering = false;
|
|
}
|
|
|
|
protected:
|
|
virtual const char* onGetName() SK_OVERRIDE {
|
|
return fName.c_str();
|
|
}
|
|
|
|
virtual void onDraw(SkCanvas*) SK_OVERRIDE {
|
|
if (fRaw) {
|
|
for (int i = 0; i < N; ++i) {
|
|
SkPath::RawIter iter(fPath);
|
|
SkPath::Verb verb;
|
|
SkPoint pts[4];
|
|
|
|
while ((verb = iter.next(pts)) != SkPath::kDone_Verb) { }
|
|
}
|
|
} else {
|
|
for (int i = 0; i < N; ++i) {
|
|
SkPath::Iter iter(fPath, false);
|
|
SkPath::Verb verb;
|
|
SkPoint pts[4];
|
|
|
|
while ((verb = iter.next(pts)) != SkPath::kDone_Verb) { }
|
|
}
|
|
}
|
|
}
|
|
|
|
private:
|
|
typedef SkBenchmark INHERITED;
|
|
};
|
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
|
|
static SkBenchmark* F0(void* p) { return new PathIterBench(p, false); }
|
|
static SkBenchmark* F1(void* p) { return new PathIterBench(p, true); }
|
|
|
|
static BenchRegistry gR0(F0);
|
|
static BenchRegistry gR1(F1);
|