fix valgrind uninitialized var error

src/pathops/SkPathOpsTSect.h

 /*
  * Copyright 2014 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 #include "SkChunkAlloc.h"
 #include "SkPathOpsBounds.h"
 #include "SkPathOpsRect.h"
 #include "SkIntersections.h"
 #include "SkTSort.h"
 
 /* TCurve and OppCurve are one of { SkDQuadratic, SkDConic, SkDCubic } */
 template<typename TCurve, typename OppCurve>
 class SkTCoincident {
 public:
     SkTCoincident() {
-        this->clear();
-    }
-
-    void clear() {
-        fPerpT = -1;
-        fCoincident = false;
-    }
-
-    void debugInit() {
-        this->clear();
-        fPerpPt.fX = fPerpPt.fY = SK_ScalarNaN;
+        this->init();
     }
 
     void dump() const;
 
     bool isCoincident() const {
         return fCoincident;
     }
 
     void init() {
-        this->clear();
-        SkDEBUGCODE(fPerpPt.fX = fPerpPt.fY = SK_ScalarNaN);
+        fPerpT = -1;
+        fCoincident = false;
+        fPerpPt.fX = fPerpPt.fY = SK_ScalarNaN;
     }
 
     void markCoincident() {
         if (!fCoincident) {
             fPerpT = -1;
         }
         fCoincident = true;
     }
 
     const SkDPoint& perpPt() const {
@@ skipping 27 matching lines @@
 public:
     void addBounded(SkTSpan<OppCurve, TCurve>* , SkChunkAlloc* );
     double closestBoundedT(const SkDPoint& pt) const;
     bool contains(double t) const;
 
     void debugInit() {
         TCurve dummy;
         dummy.debugInit();
         init(dummy);
         initBounds(dummy);
-        fCoinStart.debugInit();
-        fCoinEnd.debugInit();
+        fCoinStart.init();
+        fCoinEnd.init();
     }
 
     const SkTSect<OppCurve, TCurve>* debugOpp() const;
     const SkTSpan* debugSpan(int ) const;
     const SkTSpan* debugT(double t) const;
 #ifdef SK_DEBUG
     bool debugIsBefore(const SkTSpan* span) const;
 #endif
     void dump() const;
     void dumpBounded(int id) const;
@@ skipping 222 matching lines @@
 
 template<typename TCurve, typename OppCurve>
 void SkTCoincident<TCurve, OppCurve>::setPerp(const TCurve& c1, double t,
         const SkDPoint& cPt, const OppCurve& c2) {
     SkDVector dxdy = c1.dxdyAtT(t);
     SkDLine perp = {{ cPt, {cPt.fX + dxdy.fY, cPt.fY - dxdy.fX} }};
     SkIntersections i;
     int used = i.intersectRay(c2, perp);
     // only keep closest
     if (used == 0 || used == 3) {
-        this->clear();
+        this->init();
         return;
     } 
     fPerpT = i[0][0];
     fPerpPt = i.pt(0);
     SkASSERT(used <= 2);
     if (used == 2) {
         double distSq = (fPerpPt - cPt).lengthSquared();
         double dist2Sq = (i.pt(1) - cPt).lengthSquared();
         if (dist2Sq < distSq) {
             fPerpT = i[0][1];
@@ skipping 643 matching lines @@
     do {
         if (!work->fHasPerp && !work->fCollapsed) {
             if (prior) {
                 work->fCoinStart = prior->fCoinEnd;
             } else {
                 work->fCoinStart.setPerp(fCurve, work->fStartT, work->fPart[0], opp);
             }
             if (work->fCoinStart.isCoincident()) {
                 double perpT = work->fCoinStart.perpT();
                 if (sect2->coincidentHasT(perpT)) {
-                    work->fCoinStart.clear();
+                    work->fCoinStart.init();
                 } else {
                     sect2->addForPerp(work, perpT);
                 }
             }
             work->fCoinEnd.setPerp(fCurve, work->fEndT, work->fPart[TCurve::kPointLast], opp);
             if (work->fCoinEnd.isCoincident()) {
                 double perpT = work->fCoinEnd.perpT();
                 if (sect2->coincidentHasT(perpT)) {
-                    work->fCoinEnd.clear();
+                    work->fCoinEnd.init();
                 } else {
                     sect2->addForPerp(work, perpT);
                 }
             }
             work->fHasPerp = true;
         }
         if (work == last) {
             break;
         }
         prior = work;
@@ skipping 1079 matching lines @@
         } else if (intersections->isCoincident(index + 1)) {
             intersections->removeOne(index + 1);
             --last;
         } else {
             intersections->setCoincident(index++);
         }
         intersections->setCoincident(index);
     }
     SkASSERT(intersections->used() <= TCurve::kMaxIntersections);
 }