remove duplicate linked list adjustment

src/pathops/SkOpSegment.cpp

 /*
  * Copyright 2012 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 #include "SkOpCoincidence.h"
 #include "SkOpContour.h"
 #include "SkOpSegment.h"
 #include "SkPathWriter.h"
@@ skipping 1419 matching lines @@
                         if (test == &this->fTail) {
                             if (spanS == &fHead) {
                                 debugValidate();
                                 return;  // if this span has collapsed, remove it from parent
                             }
                             this->fTail.merge(spanS->upCast());
                             debugValidate();
                             return;
                         }
                         spanS->merge(test->upCast());
-                        spanS->upCast()->setNext(next);
                         goto checkNextSpan;
                     }
                 } while ((testBase = testBase->next()) != test->ptT());
             } while ((startBase = startBase->next()) != spanS->ptT());
     checkNextSpan:
             ;
         } while ((test = next));
         spanS = spanS->upCast()->next();
     } while (!spanS->final());
     debugValidate();
@@ skipping 326 matching lines @@
     int absOut = SkTAbs(outerWinding);
     int absIn = SkTAbs(innerWinding);
     bool result = absOut == absIn ? outerWinding < 0 : absOut < absIn;
     return result;
 }
 
 int SkOpSegment::windSum(const SkOpAngle* angle) const {
     const SkOpSpan* minSpan = angle->start()->starter(angle->end());
     return minSpan->windSum();
 }