"NULL !=" = NULL

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"
 
@@ skipping 47 matching lines @@
 
     const SkIRect* bounds = &queryBounds;
 
     SkRect scalarQueryBounds = SkRect::Make(queryBounds);
 
     if (iior) {
         SkASSERT(SkClipStack::kNormal_BoundsType == stackBoundsType);
         SkRect isectRect;
         if (stackBounds.contains(scalarQueryBounds)) {
             *initialState = kAllIn_InitialState;
-            if (NULL != tighterBounds) {
+            if (tighterBounds) {
                 *tighterBounds = queryBounds;
             }
-            if (NULL != requiresAA) {
+            if (requiresAA) {
                *requiresAA = false;
             }
         } else if (isectRect.intersect(stackBounds, scalarQueryBounds)) {
             // If the caller asked for tighter integer bounds we may be able to
             // return kAllIn and give the bounds with no elements
-            if (NULL != tighterBounds) {
+            if (tighterBounds) {
                 isectRect.roundOut(tighterBounds);
                 SkRect scalarTighterBounds = SkRect::Make(*tighterBounds);
                 if (scalarTighterBounds == isectRect) {
                     // the round-out didn't add any area outside the clip rect.
-                    if (NULL != requiresAA) {
+                    if (requiresAA) {
                         *requiresAA = false;
                     }
                     *initialState = 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));
-            if (NULL != requiresAA) {
+            if (requiresAA) {
                 *requiresAA = doAA;
             }
         } else {
             *initialState = kAllOut_InitialState;
-             if (NULL != requiresAA) {
+             if (requiresAA) {
                 *requiresAA = false;
              }
         }
         return;
     } else {
         if (SkClipStack::kNormal_BoundsType == stackBoundsType) {
             if (!SkRect::Intersects(stackBounds, scalarQueryBounds)) {
                 *initialState = kAllOut_InitialState;
-                if (NULL != requiresAA) {
+                if (requiresAA) {
                    *requiresAA = false;
                 }
                 return;
             }
-            if (NULL != tighterBounds) {
+            if (tighterBounds) {
                 SkIRect stackIBounds;
                 stackBounds.roundOut(&stackIBounds);
                 tighterBounds->intersect(queryBounds, stackIBounds);
                 bounds = tighterBounds;
             }
         } else {
             if (stackBounds.contains(scalarQueryBounds)) {
                 *initialState = kAllOut_InitialState;
-                if (NULL != requiresAA) {
+                if (requiresAA) {
                    *requiresAA = false;
                 }
                 return;
             }
-            if (NULL != tighterBounds) {
+            if (tighterBounds) {
                 *tighterBounds = queryBounds;
             }
         }
     }
 
     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);
@@ skipping 222 matching lines @@
                 }
             }
         }
     }
 
     if ((kAllOut_InitialState == *initialState && !embiggens) ||
         (kAllIn_InitialState == *initialState && !emsmallens)) {
         result->reset();
     } else {
         Element* element = result->headIter().get();
-        while (NULL != element) {
+        while (element) {
             bool skippable = false;
             switch (element->getOp()) {
                 case SkRegion::kDifference_Op:
                     // subtracting from the empty set yields the empty set.
                     skippable = kAllOut_InitialState == *initialState;
                     break;
                 case SkRegion::kIntersect_Op:
                     // intersecting with the empty set yields the empty set
                     if (kAllOut_InitialState == *initialState) {
                         skippable = true;
@@ skipping 47 matching lines @@
                 break;
             } else {
                 if (element->isAA()) {
                     --numAAElements;
                 }
                 result->popHead();
                 element = result->headIter().get();
             }
         }
     }
-    if (NULL != requiresAA) {
+    if (requiresAA) {
         *requiresAA = numAAElements > 0;
     }
 
     if (0 == result->count()) {
         if (*initialState == kAllIn_InitialState) {
             *resultGenID = SkClipStack::kWideOpenGenID;
         } else {
             *resultGenID = SkClipStack::kEmptyGenID;
         }
     }
 }
 } // namespace GrReducedClip