centralize VECTORCALL as SK_VECTORCALL

tests/SkLinearBitmapPipelineTest.cpp

 /*
  * Copyright 2016 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 #include <algorithm>
 #include <array>
 #include <tuple>
@@ skipping 97 matching lines @@
 
 }
 
 template <typename XTiler, typename YTiler>
 static bool compare_tiler_case(
     XTiler& xTiler, YTiler& yTiler, Span span, skiatest::Reporter* reporter) {
     Span originalSpan = span;
     std::vector<SkPoint> listPoints;
     std::vector<SkPoint> spanPoints;
     struct Sink {
-        void VECTORCALL pointListFew(int n, Sk4s xs, Sk4s ys) {
+        void SK_VECTORCALL pointListFew(int n, Sk4s xs, Sk4s ys) {
             SkASSERT(0 < n && n < 4);
             if (n >= 1) storePoint({xs[0], ys[0]});
             if (n >= 2) storePoint({xs[1], ys[1]});
             if (n >= 3) storePoint({xs[2], ys[2]});
         }
 
-        void VECTORCALL pointList4(Sk4s xs, Sk4s ys) {
+        void SK_VECTORCALL pointList4(Sk4s xs, Sk4s ys) {
             storePoint({xs[0], ys[0]});
             storePoint({xs[1], ys[1]});
             storePoint({xs[2], ys[2]});
             storePoint({xs[3], ys[3]});
         }
 
         void pointSpan(Span span) {
             span_fallback(span, this);
         }
 
@@ skipping 112 matching lines @@
 DEF_TEST(LBPStrategyRepeatTile, reporter) {
 #if 0
     RepeatStrategy tiler{SkSize::Make(3, 1)};
     Span span{SkPoint::Make(-5, -5), 20 * 2.1f, 100};
     compare_tiler_case<RepeatStrategy>(tiler, span, reporter);
 #else
     test_tiler<XRepeatStrategy, YRepeatStrategy>(reporter);
 #endif
 }
 */