Move StringToUpperASCII and LowerCaseEqualsASCII to the base namespace

pdf/document_loader.cc

 // Copyright (c) 2010 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 "pdf/document_loader.h"
 
 #include "base/logging.h"
 #include "base/strings/string_util.h"
 #include "net/http/http_util.h"
 #include "ppapi/c/pp_errors.h"
@@ skipping 37 matching lines @@
 
   bool accept_ranges_bytes = false;
   bool content_encoded = false;
   uint32 content_length = 0;
   std::string type;
   std::string disposition;
   if (!response_headers.empty()) {
     net::HttpUtil::HeadersIterator it(response_headers.begin(),
                                       response_headers.end(), "\n");
     while (it.GetNext()) {
-      if (LowerCaseEqualsASCII(it.name(), "content-length")) {
+      if (base::LowerCaseEqualsASCII(it.name(), "content-length")) {
         content_length = atoi(it.values().c_str());
-      } else if (LowerCaseEqualsASCII(it.name(), "accept-ranges")) {
-        accept_ranges_bytes = LowerCaseEqualsASCII(it.values(), "bytes");
-      } else if (LowerCaseEqualsASCII(it.name(), "content-encoding")) {
+      } else if (base::LowerCaseEqualsASCII(it.name(), "accept-ranges")) {
+        accept_ranges_bytes = base::LowerCaseEqualsASCII(it.values(), "bytes");
+      } else if (base::LowerCaseEqualsASCII(it.name(), "content-encoding")) {
         content_encoded = true;
-      } else if (LowerCaseEqualsASCII(it.name(), "content-type")) {
+      } else if (base::LowerCaseEqualsASCII(it.name(), "content-type")) {
         type = it.values();
         size_t semi_colon_pos = type.find(';');
         if (semi_colon_pos != std::string::npos) {
           type = type.substr(0, semi_colon_pos);
         }
         TrimWhitespace(type, base::TRIM_ALL, &type);
-      } else if (LowerCaseEqualsASCII(it.name(), "content-disposition")) {
+      } else if (base::LowerCaseEqualsASCII(it.name(), "content-disposition")) {
         disposition = it.values();
       }
     }
   }
   if (!type.empty() &&
       !EndsWith(type, "/pdf", false) &&
       !EndsWith(type, ".pdf", false) &&
       !EndsWith(type, "/x-pdf", false) &&
       !EndsWith(type, "/*", false) &&
       !EndsWith(type, "/acrobat", false) &&
@@ skipping 245 matching lines @@
     }
   }
 
   ReadMore();
 }
 
 bool DocumentLoader::GetByteRange(const std::string& headers, uint32* start,
                                   uint32* end) {
   net::HttpUtil::HeadersIterator it(headers.begin(), headers.end(), "\n");
   while (it.GetNext()) {
-    if (LowerCaseEqualsASCII(it.name(), "content-range")) {
+    if (base::LowerCaseEqualsASCII(it.name(), "content-range")) {
       std::string range = it.values().c_str();
       if (StartsWithASCII(range, "bytes", false)) {
         range = range.substr(strlen("bytes"));
         std::string::size_type pos = range.find('-');
         std::string range_end;
         if (pos != std::string::npos)
           range_end = range.substr(pos + 1);
         TrimWhitespaceASCII(range, base::TRIM_LEADING, &range);
         TrimWhitespaceASCII(range_end, base::TRIM_LEADING, &range_end);
         *start = atoi(range.c_str());
         *end = atoi(range_end.c_str());
         return true;
       }
     }
   }
   return false;
 }
 
 std::string DocumentLoader::GetMultiPartBoundary(const std::string& headers) {
   net::HttpUtil::HeadersIterator it(headers.begin(), headers.end(), "\n");
   while (it.GetNext()) {
-    if (LowerCaseEqualsASCII(it.name(), "content-type")) {
+    if (base::LowerCaseEqualsASCII(it.name(), "content-type")) {
       std::string type = base::StringToLowerASCII(it.values());
       if (StartsWithASCII(type, "multipart/", true)) {
         const char* boundary = strstr(type.c_str(), "boundary=");
         if (!boundary) {
           NOTREACHED();
           break;
         }
 
         return std::string(boundary + 9);
       }
@@ skipping 125 matching lines @@
 uint32 DocumentLoader::GetRequestSize() const {
   // Document loading strategy:
   // For first 10 requests, we use 32k chunk sizes, for the next 10 requests we
   // double the size (64k), and so on, until we cap max request size at 2M for
   // 71 or more requests.
   uint32 limited_count = std::min(std::max(requests_count_, 10u), 70u);
   return 32*1024 * (1 << ((limited_count - 1) / 10u));
 }
 
 }  // namespace chrome_pdf