speed up maprect for scale+trans case

bench/MatrixBench.cpp

 /*
  * 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 "Benchmark.h"
 #include "SkMatrix.h"
 #include "SkMatrixUtils.h"
 #include "SkRandom.h"
@@ skipping 279 matching lines @@
     void performTest() override {
         for (int i = 0; i < 1000000; ++i) {
             fM.mapPoints(fDst, fSrc, N);
         }
     }
 };
 DEF_BENCH( return new MapPointsMatrixBench("mappoints_identity", SkMatrix::I()); )
 DEF_BENCH( return new MapPointsMatrixBench("mappoints_trans", make_trans()); )
 DEF_BENCH( return new MapPointsMatrixBench("mappoints_scale", make_scale()); )
 DEF_BENCH( return new MapPointsMatrixBench("mappoints_affine", make_afine()); )
+
+///////////////////////////////////////////////////////////////////////////////
+
+class MapRectMatrixBench : public MatrixBench {
+    SkMatrix fM;
+    SkRect   fR;
+    bool     fScaleTrans;
+
+    enum { MEGA_LOOP = 1000 * 1000 };
+public:
+    MapRectMatrixBench(const char name[], bool scale_trans)
+        : MatrixBench(name), fScaleTrans(scale_trans)
+    {
+        fM.setScale(2, 3);
+        fM.postTranslate(1, 2);
+
+        fR.set(10, 10, 100, 200);
+    }
+
+    void performTest() override {
+        SkRect dst;
+        if (fScaleTrans) {
+            for (int i = 0; i < MEGA_LOOP; ++i) {
+                fM.mapRectScaleTranslate(&dst, fR);
+            }
+        } else {
+            for (int i = 0; i < MEGA_LOOP; ++i) {
+                fM.mapRect(&dst, fR);
+            }
+        }
+    }
+};
+DEF_BENCH( return new MapRectMatrixBench("maprect", false); )
+DEF_BENCH( return new MapRectMatrixBench("maprectscaletrans", true); )