add SkNx::abs(), for now only implemented for Sk4f

src/core/SkNx.h

 /*
  * Copyright 2015 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 #ifndef SkNx_DEFINED
 #define SkNx_DEFINED
 
@@ skipping 56 matching lines @@
     SkNx operator <= (const SkNx& o) const { return SkNx(fLo <= o.fLo, fHi <= o.fHi); }
     SkNx operator >= (const SkNx& o) const { return SkNx(fLo >= o.fLo, fHi >= o.fHi); }
 
     static SkNx Min(const SkNx& a, const SkNx& b) {
         return SkNx(SkNx<N/2, T>::Min(a.fLo, b.fLo), SkNx<N/2, T>::Min(a.fHi, b.fHi));
     }
     static SkNx Max(const SkNx& a, const SkNx& b) {
         return SkNx(SkNx<N/2, T>::Max(a.fLo, b.fLo), SkNx<N/2, T>::Max(a.fHi, b.fHi));
     }
 
+    SkNx abs() const { return SkNx(fLo.abs(), fHi.abs()); }
+
     SkNx sqrt() const { return SkNx(fLo.sqrt(), fHi.sqrt()); }
     // Generally, increasing precision, increasing cost.
     SkNx rsqrt0() const { return SkNx(fLo.rsqrt0(), fHi.rsqrt0()); }
     SkNx rsqrt1() const { return SkNx(fLo.rsqrt1(), fHi.rsqrt1()); }
     SkNx rsqrt2() const { return SkNx(fLo.rsqrt2(), fHi.rsqrt2()); }
 
     SkNx       invert() const { return SkNx(fLo.      invert(), fHi.      invert()); }
     SkNx approxInvert() const { return SkNx(fLo.approxInvert(), fHi.approxInvert()); }
 
     template <int k> T kth() const {
@@ skipping 40 matching lines @@
     SkNx operator == (const SkNx& o) const { return SkNx(fVal == o.fVal); }
     SkNx operator != (const SkNx& o) const { return SkNx(fVal != o.fVal); }
     SkNx operator  < (const SkNx& o) const { return SkNx(fVal  < o.fVal); }
     SkNx operator  > (const SkNx& o) const { return SkNx(fVal  > o.fVal); }
     SkNx operator <= (const SkNx& o) const { return SkNx(fVal <= o.fVal); }
     SkNx operator >= (const SkNx& o) const { return SkNx(fVal >= o.fVal); }
 
     static SkNx Min(const SkNx& a, const SkNx& b) { return SkNx(SkTMin(a.fVal, b.fVal)); }
     static SkNx Max(const SkNx& a, const SkNx& b) { return SkNx(SkTMax(a.fVal, b.fVal)); }
 
+    SkNx abs() const { return SkTAbs(fVal); }
+
     SkNx  sqrt () const { return SkNx(Sqrt(fVal)); }
     SkNx rsqrt0() const { return this->sqrt().invert();  }
     SkNx rsqrt1() const { return this->rsqrt0(); }
     SkNx rsqrt2() const { return this->rsqrt1(); }
 
     SkNx       invert() const { return SkNx(1) / SkNx(fVal); }
     SkNx approxInvert() const { return this->invert();    }
 
     template <int k> T kth() const {
         SkASSERT(0 == k);
@@ skipping 91 matching lines @@
         SkNx_cast<uint8_t>(b).store(p+ 4);
         SkNx_cast<uint8_t>(c).store(p+ 8);
         SkNx_cast<uint8_t>(d).store(p+12);
     }
 #endif
 
 #undef REQUIRE
 
 
 #endif//SkNx_DEFINED