QUIC - (no behavior change) s/NULL/nullptr/g in .../quic/...

net/quic/crypto/strike_register.cc

 // Copyright (c) 2013 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "net/quic/crypto/strike_register.h"
 
 #include <limits>
 
 #include "base/logging.h"
 
@@ skipping 382 matching lines @@
   // DropOldestNode should never be called on an empty tree.
   DCHECK(internal_node_head_ != kNil);
 
   // An internal node in a crit-bit tree always has exactly two children.
   // This means that, if we are removing an external node (which is one of
   // those children), then we also need to remove an internal node. In order
   // to do that we keep pointers to the parent (wherep) and grandparent
   // (whereq) when walking down the tree.
 
   uint32 p = internal_node_head_ >> 8, *wherep = &internal_node_head_,
-         *whereq = NULL;
+         *whereq = nullptr;
   while ((p & kExternalFlag) == 0) {
     whereq = wherep;
     InternalNode* inode = &internal_nodes_[p];
     // We always go left, towards the smallest element, exploiting the fact
     // that the timestamp is big-endian and at the start of the value.
     wherep = &inode->data_[0];
     p = (*wherep) >> 8;
   }
 
   const uint32 ext_index = p & ~kExternalFlag;
@@ skipping 97 matching lines @@
       CHECK_EQ(free_internal_nodes.count(inter), 0u);
       CHECK_EQ(used_internal_nodes->count(inter), 0u);
       used_internal_nodes->insert(inter);
       ValidateTree(inter, bit, bits, free_internal_nodes, free_external_nodes,
                    used_internal_nodes, used_external_nodes);
     }
   }
 }
 
 }  // namespace net