1 /* 2 * Copyright 2014 Google Inc. 3 * 4 * Use of this source code is governed by a BSD-style license that can be 5 * found in the LICENSE file. 6 */ 7 8 #include "SkCommandLineFlags.h" 9 #include "SkForceLinking.h" 10 #include "SkGraphics.h" 11 #include "SkOSFile.h" 12 #include "SkPicture.h" 13 #include "SkPictureRecorder.h" 14 #include "SkStream.h" 15 #include "SkString.h" 16 17 #include "BenchTimer.h" 18 #include "LazyDecodeBitmap.h" 19 #include "Stats.h" 20 21 typedef WallTimer Timer; 22 23 __SK_FORCE_IMAGE_DECODER_LINKING; 24 25 DEFINE_string2(skps, r, "skps", "Directory containing SKPs to read and re-record."); 26 DEFINE_int32(samples, 10, "Number of times to re-record each SKP."); 27 DEFINE_int32(tileGridSize, 512, "Set the tile grid size. Has no effect if bbh is not set to tilegrid."); 28 DEFINE_string(bbh, "", "Turn on the bbh and select the type, one of rtree, tilegrid, quadtree"); 29 DEFINE_bool(skr, false, "Record SKR instead of SKP."); 30 DEFINE_string(match, "", "The usual filters on file names of SKPs to bench."); 31 DEFINE_string(timescale, "us", "Print times in ms, us, or ns"); 32 DEFINE_double(overheadGoal, 0.0001, 33 "Try to make timer overhead at most this fraction of our sample measurements."); 34 DEFINE_int32(verbose, 0, "0: print min sample; " 35 "1: print min, mean, max and noise indication " 36 "2: print all samples"); 37 38 static double timescale() { 39 if (FLAGS_timescale.contains("us")) return 1000; 40 if (FLAGS_timescale.contains("ns")) return 1000000; 41 return 1; 42 } 43 44 static SkBBHFactory* parse_FLAGS_bbh() { 45 if (FLAGS_bbh.isEmpty()) { 46 return NULL; 47 } 48 49 if (FLAGS_bbh.contains("rtree")) { 50 return SkNEW(SkRTreeFactory); 51 } 52 if (FLAGS_bbh.contains("tilegrid")) { 53 SkTileGridFactory::TileGridInfo info; 54 info.fTileInterval.set(FLAGS_tileGridSize, FLAGS_tileGridSize); 55 info.fMargin.setEmpty(); 56 info.fOffset.setZero(); 57 return SkNEW_ARGS(SkTileGridFactory, (info)); 58 } 59 if (FLAGS_bbh.contains("quadtree")) { 60 return SkNEW(SkQuadTreeFactory); 61 } 62 SkDebugf("Invalid bbh type %s, must be one of rtree, tilegrid, quadtree.\n", FLAGS_bbh[0]); 63 return NULL; 64 } 65 66 static void rerecord(const SkPicture& src, SkBBHFactory* bbhFactory) { 67 SkPictureRecorder recorder; 68 if (FLAGS_skr) { 69 src.draw(recorder.EXPERIMENTAL_beginRecording(src.width(), src.height(), bbhFactory)); 70 } else { 71 src.draw(recorder.beginRecording(src.width(), src.height(), bbhFactory)); 72 } 73 SkAutoTUnref<SkPicture> pic(recorder.endRecording()); 74 } 75 76 static void bench_record(const SkPicture& src, 77 const double timerOverhead, 78 const char* name, 79 SkBBHFactory* bbhFactory) { 80 // Rerecord once to warm up any caches. Otherwise the first sample can be very noisy. 81 rerecord(src, bbhFactory); 82 83 // Rerecord once to see how many times we should loop to make timer overhead insignificant. 84 Timer timer; 85 do { 86 timer.start(timescale()); 87 rerecord(src, bbhFactory); 88 timer.end(); 89 } while (timer.fWall < timerOverhead); // Loop just in case something bizarre happens. 90 91 // We want (timer overhead / measurement) to be less than FLAGS_overheadGoal. 92 // So in each sample, we'll loop enough times to have made that true for our first measurement. 93 const int loops = (int)ceil(timerOverhead / timer.fWall / FLAGS_overheadGoal); 94 95 SkAutoTMalloc<double> samples(FLAGS_samples); 96 for (int i = 0; i < FLAGS_samples; i++) { 97 timer.start(timescale()); 98 for (int j = 0; j < loops; j++) { 99 rerecord(src, bbhFactory); 100 } 101 timer.end(); 102 samples[i] = timer.fWall / loops; 103 } 104 105 Stats stats(samples.get(), FLAGS_samples); 106 if (FLAGS_verbose == 0) { 107 printf("%g\t%s\n", stats.min, name); 108 } else if (FLAGS_verbose == 1) { 109 // Get a rough idea of how noisy the measurements were. 110 const double noisePercent = 100 * sqrt(stats.var) / stats.mean; 111 printf("%g\t%g\t%g\t%.0f%%\t%s\n", stats.min, stats.mean, stats.max, noisePercent, name); 112 } else if (FLAGS_verbose == 2) { 113 printf("%s", name); 114 for (int i = 0; i < FLAGS_samples; i++) { 115 printf("\t%g", samples[i]); 116 } 117 printf("\n"); 118 } 119 } 120 121 int tool_main(int argc, char** argv); 122 int tool_main(int argc, char** argv) { 123 SkCommandLineFlags::Parse(argc, argv); 124 SkAutoGraphics autoGraphics; 125 126 if (FLAGS_bbh.count() > 1) { 127 SkDebugf("Multiple bbh arguments supplied.\n"); 128 return 1; 129 } 130 131 SkAutoTDelete<SkBBHFactory> bbhFactory(parse_FLAGS_bbh()); 132 133 // Each run will use this timer overhead estimate to guess how many times it should run. 134 static const int kOverheadLoops = 10000000; 135 Timer timer; 136 double overheadEstimate = 0.0; 137 for (int i = 0; i < kOverheadLoops; i++) { 138 timer.start(timescale()); 139 timer.end(); 140 overheadEstimate += timer.fWall; 141 } 142 overheadEstimate /= kOverheadLoops; 143 144 SkOSFile::Iter it(FLAGS_skps[0], ".skp"); 145 SkString filename; 146 bool failed = false; 147 while (it.next(&filename)) { 148 if (SkCommandLineFlags::ShouldSkip(FLAGS_match, filename.c_str())) { 149 continue; 150 } 151 152 const SkString path = SkOSPath::SkPathJoin(FLAGS_skps[0], filename.c_str()); 153 154 SkAutoTUnref<SkStream> stream(SkStream::NewFromFile(path.c_str())); 155 if (!stream) { 156 SkDebugf("Could not read %s.\n", path.c_str()); 157 failed = true; 158 continue; 159 } 160 SkAutoTUnref<SkPicture> src( 161 SkPicture::CreateFromStream(stream, sk_tools::LazyDecodeBitmap)); 162 if (!src) { 163 SkDebugf("Could not read %s as an SkPicture.\n", path.c_str()); 164 failed = true; 165 continue; 166 } 167 bench_record(*src, overheadEstimate, filename.c_str(), bbhFactory.get()); 168 } 169 return failed ? 1 : 0; 170 } 171 172 #if !defined SK_BUILD_FOR_IOS 173 int main(int argc, char * const argv[]) { 174 return tool_main(argc, (char**) argv); 175 } 176 #endif 177
