Major bench refactoring.

bench/SortBench.cpp

 /*
  * Copyright 2013 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 "SkRandom.h"
 #include "SkTSort.h"
@@ skipping 103 matching lines @@
         fSortProc = gSorts[s].fProc;
         fIsRendering = false;
     }
 
 protected:
     virtual const char* onGetName() SK_OVERRIDE {
         return fName.c_str();
     }
 
     virtual void onDraw(SkCanvas*) {
-        int n = SkBENCHLOOP(200);
-        for (int i = 0; i < n; i++) {
+        for (int i = 0; i < this->getLoops(); i++) {
             memcpy(fSorted, fUnsorted, fCount * sizeof(int));
             fSortProc(fSorted, fCount);
 #ifdef SK_DEBUG
             for (int j = 1; j < fCount; ++j) {
                 SkASSERT(fSorted[j - 1] <= fSorted[j]);
             }
 #endif
         }
     }
 
@@ skipping 25 matching lines @@
 DEF_BENCH( return NewSkHeap(p, kFore); )
 DEF_BENCH( return NewQSort(p, kFore); )
 
 DEF_BENCH( return NewSkQSort(p, kBack); )
 DEF_BENCH( return NewSkHeap(p, kBack); )
 DEF_BENCH( return NewQSort(p, kBack); )
 
 DEF_BENCH( return NewSkQSort(p, kSame); )
 DEF_BENCH( return NewSkHeap(p, kSame); )
 DEF_BENCH( return NewQSort(p, kSame); )