Run clang-modernize -use-nullptr over src/extensions/.

extensions/browser/quota_service.cc

 // Copyright 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 "extensions/browser/quota_service.h"
 
 #include "base/message_loop/message_loop.h"
 #include "base/stl_util.h"
 #include "extensions/browser/extension_function.h"
 #include "extensions/common/error_utils.h"
 
 namespace {
 
 // If the browser stays open long enough, we reset state once a day.
 // Whatever this value is, it should be an order of magnitude longer than
 // the longest interval in any of the QuotaLimitHeuristics in use.
 const int kPurgeIntervalInDays = 1;
 
 const char kOverQuotaError[] = "This request exceeds the * quota.";
 
 }  // namespace
 
 namespace extensions {
 
 QuotaService::QuotaService() {
-  if (base::MessageLoop::current() != NULL) {  // Null in unit tests.
+  if (base::MessageLoop::current() != nullptr) {  // Null in unit tests.
     purge_timer_.Start(FROM_HERE,
                        base::TimeDelta::FromDays(kPurgeIntervalInDays),
                        this,
                        &QuotaService::Purge);
   }
 }
 
 QuotaService::~QuotaService() {
   DCHECK(CalledOnValidThread());
   purge_timer_.Stop();
@@ skipping 18 matching lines @@
     function->GetQuotaLimitHeuristics(&heuristics);
 
   if (heuristics.empty())
     return std::string();  // No heuristic implies no limit.
 
   ViolationErrorMap::iterator violation_error =
       violation_errors_.find(extension_id);
   if (violation_error != violation_errors_.end())
     return violation_error->second;  // Repeat offender.
 
-  QuotaLimitHeuristic* failed_heuristic = NULL;
+  QuotaLimitHeuristic* failed_heuristic = nullptr;
   for (QuotaLimitHeuristics::iterator heuristic = heuristics.begin();
        heuristic != heuristics.end();
        ++heuristic) {
     // Apply heuristic to each item (bucket).
     if (!(*heuristic)->ApplyToArgs(args, event_time)) {
       failed_heuristic = *heuristic;
       break;
     }
   }
 
@@ skipping 107 matching lines @@
   }
 
   // We can go negative since we check has_tokens when we get to *next* bucket,
   // and for the small interval all that matters is whether we used up all the
   // tokens (which is true if num_tokens_ <= 0).
   bucket->DeductToken();
   return true;
 }
 
 }  // namespace extensions