simplify insertion methods for SkTLList

src/gpu/GrReducedClip.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 "GrReducedClip.h"
 
 typedef SkClipStack::Element Element;
@@ skipping 188 matching lines @@
         if (!skippable) {
             if (0 == result->count()) {
                 // This will be the last element. Record the stricter genID.
                 *resultGenID = element->getGenID();
             }
 
             // if it is a flip, change it to a bounds-filling rect
             if (isFlip) {
                 SkASSERT(SkRegion::kXOR_Op == element->getOp() ||
                          SkRegion::kReverseDifference_Op == element->getOp());
-                SkNEW_INSERT_AT_LLIST_HEAD(result,
-                                           Element,
-                                           (queryBounds, SkRegion::kReverseDifference_Op, false));
+                result->addToHead(queryBounds, SkRegion::kReverseDifference_Op, false);
             } else {
                 Element* newElement = result->addToHead(*element);
                 if (newElement->isAA()) {
                     ++numAAElements;
                 }
                 // Intersecting an inverse shape is the same as differencing the non-inverse shape.
                 // Replacing with an inverse shape is the same as setting initialState=kAllIn and
                 // differencing the non-inverse shape.
                 bool isReplace = SkRegion::kReplace_Op == newElement->getOp();
                 if (newElement->isInverseFilled() &&
@@ skipping 157 matching lines @@
                         *requiresAA = false;
                     }
                     *initialState = GrReducedClip::kAllIn_InitialState;
                     return;
                 }
             }
             *initialState = kAllOut_InitialState;
             // iior should only be true if aa/non-aa status matches among all elements.
             SkClipStack::Iter iter(stack, SkClipStack::Iter::kTop_IterStart);
             bool doAA = iter.prev()->isAA();
-            SkNEW_INSERT_AT_LLIST_HEAD(result, Element, (isectRect, SkRegion::kReplace_Op, doAA));
+            result->addToHead(isectRect, SkRegion::kReplace_Op, doAA);
             if (requiresAA) {
                 *requiresAA = doAA;
             }
         } else {
             *initialState = kAllOut_InitialState;
              if (requiresAA) {
                 *requiresAA = false;
              }
         }
         return;
@@ skipping 32 matching lines @@
     SkRect scalarBounds = SkRect::Make(*bounds);
 
     // Now that we have determined the bounds to use and filtered out the trivial cases, call the
     // helper that actually walks the stack.
     reduced_stack_walker(stack, scalarBounds, result, resultGenID, initialState, requiresAA);
 
     // The list that was computed in this function may be cached based on the gen id of the last
     // element.
     SkASSERT(SkClipStack::kInvalidGenID != *resultGenID);
 }