Clang format slam.

net/http/http_security_headers.cc

 // Copyright (c) 2012 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 "base/base64.h"
 #include "base/basictypes.h"
 #include "base/strings/string_number_conversions.h"
 #include "base/strings/string_tokenizer.h"
 #include "base/strings/string_util.h"
 #include "net/http/http_security_headers.h"
@@ skipping 30 matching lines @@
   if (i > kMaxHSTSAgeSecs)
     i = kMaxHSTSAgeSecs;
   *result = (uint32)i;
   return true;
 }
 
 // Returns true iff there is an item in |pins| which is not present in
 // |from_cert_chain|. Such an SPKI hash is called a "backup pin".
 bool IsBackupPinPresent(const HashValueVector& pins,
                         const HashValueVector& from_cert_chain) {
-  for (HashValueVector::const_iterator i = pins.begin(); i != pins.end();
-       ++i) {
-    HashValueVector::const_iterator j =
-        std::find_if(from_cert_chain.begin(), from_cert_chain.end(),
-                     HashValuesEqual(*i));
+  for (HashValueVector::const_iterator i = pins.begin(); i != pins.end(); ++i) {
+    HashValueVector::const_iterator j = std::find_if(
+        from_cert_chain.begin(), from_cert_chain.end(), HashValuesEqual(*i));
     if (j == from_cert_chain.end())
       return true;
   }
 
   return false;
 }
 
 // Returns true if the intersection of |a| and |b| is not empty. If either
 // |a| or |b| is empty, returns false.
-bool HashesIntersect(const HashValueVector& a,
-                     const HashValueVector& b) {
+bool HashesIntersect(const HashValueVector& a, const HashValueVector& b) {
   for (HashValueVector::const_iterator i = a.begin(); i != a.end(); ++i) {
     HashValueVector::const_iterator j =
         std::find_if(b.begin(), b.end(), HashValuesEqual(*i));
     if (j != b.end())
       return true;
   }
   return false;
 }
 
 // Returns true iff |pins| contains both a live and a backup pin. A live pin
@@ skipping 38 matching lines @@
   return pair;
 }
 
 bool ParseAndAppendPin(const std::string& value,
                        HashValueTag tag,
                        HashValueVector* hashes) {
   std::string unquoted = HttpUtil::Unquote(value);
   std::string decoded;
 
   if (unquoted.empty())
-      return false;
+    return false;
 
   if (!base::Base64Decode(unquoted, &decoded))
     return false;
 
   HashValue hash(tag);
   if (decoded.size() != hash.size())
     return false;
 
   memcpy(hash.data(), decoded.data(), hash.size());
   hashes->push_back(hash);
@@ skipping 152 matching lines @@
   while (!source.empty()) {
     StringPair semicolon = Split(source, ';');
     semicolon.first = Strip(semicolon.first);
     semicolon.second = Strip(semicolon.second);
     StringPair equals = Split(semicolon.first, '=');
     equals.first = Strip(equals.first);
     equals.second = Strip(equals.second);
 
     if (LowerCaseEqualsASCII(equals.first, "max-age")) {
       if (equals.second.empty() ||
-          !MaxAgeToInt(equals.second.begin(), equals.second.end(),
-                       &max_age_candidate)) {
+          !MaxAgeToInt(
+              equals.second.begin(), equals.second.end(), &max_age_candidate)) {
         return false;
       }
       parsed_max_age = true;
     } else if (LowerCaseEqualsASCII(equals.first, "pin-sha1")) {
       if (!ParseAndAppendPin(equals.second, HASH_VALUE_SHA1, &pins))
         return false;
     } else if (LowerCaseEqualsASCII(equals.first, "pin-sha256")) {
       if (!ParseAndAppendPin(equals.second, HASH_VALUE_SHA256, &pins))
         return false;
     } else if (LowerCaseEqualsASCII(equals.first, "includesubdomains")) {
       include_subdomains_candidate = true;
     } else {
       // Silently ignore unknown directives for forward compatibility.
     }
 
     source = semicolon.second;
   }
 
   if (!parsed_max_age)
     return false;
 
   if (!IsPinListValid(pins, chain_hashes))
     return false;
 
   *max_age = base::TimeDelta::FromSeconds(max_age_candidate);
   *include_subdomains = include_subdomains_candidate;
-  for (HashValueVector::const_iterator i = pins.begin();
-       i != pins.end(); ++i) {
+  for (HashValueVector::const_iterator i = pins.begin(); i != pins.end(); ++i) {
     bool found = false;
 
     for (HashValueVector::const_iterator j = hashes->begin();
-         j != hashes->end(); ++j) {
+         j != hashes->end();
+         ++j) {
       if (j->Equals(*i)) {
         found = true;
         break;
       }
     }
 
     if (!found)
       hashes->push_back(*i);
   }
 
   return true;
 }
 
 }  // namespace net