| OLD | NEW |
| 1 // Copyright 2016 The Chromium Authors. All rights reserved. | 1 // Copyright 2016 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #include "net/cert/internal/trust_store_in_memory.h" | 5 #include "net/cert/internal/trust_store_in_memory.h" |
| 6 | 6 |
| 7 namespace net { | 7 namespace net { |
| 8 | 8 |
| 9 TrustStoreInMemory::TrustStoreInMemory() = default; | 9 TrustStoreInMemory::TrustStoreInMemory() = default; |
| 10 TrustStoreInMemory::~TrustStoreInMemory() = default; | 10 TrustStoreInMemory::~TrustStoreInMemory() = default; |
| 11 | 11 |
| 12 void TrustStoreInMemory::Clear() { | 12 void TrustStoreInMemory::Clear() { |
| 13 anchors_.clear(); | 13 anchors_.clear(); |
| 14 } | 14 } |
| 15 | 15 |
| 16 void TrustStoreInMemory::AddTrustAnchor(scoped_refptr<TrustAnchor> anchor) { | 16 void TrustStoreInMemory::AddTrustAnchor(scoped_refptr<TrustAnchor> anchor) { |
| 17 // TODO(mattm): should this check for duplicate anchors? | 17 // TODO(mattm): should this check for duplicate anchors? |
| 18 anchors_.insert(std::make_pair(anchor->normalized_subject().AsStringPiece(), | 18 anchors_.insert(std::make_pair(anchor->normalized_subject().AsStringPiece(), |
| 19 std::move(anchor))); | 19 std::move(anchor))); |
| 20 } | 20 } |
| 21 | 21 |
| 22 void TrustStoreInMemory::FindTrustAnchorsByNormalizedName( | 22 void TrustStoreInMemory::FindTrustAnchorsForCert( |
| 23 const der::Input& normalized_name, | 23 const ParsedCertificate* cert, |
| 24 TrustAnchors* matches) const { | 24 const TrustAnchorsCallback& callback, |
| 25 auto range = anchors_.equal_range(normalized_name.AsStringPiece()); | 25 TrustAnchors* synchronous_matches, |
| 26 std::unique_ptr<Request>* out_req) const { |
| 27 auto range = anchors_.equal_range(cert->normalized_issuer().AsStringPiece()); |
| 26 for (auto it = range.first; it != range.second; ++it) | 28 for (auto it = range.first; it != range.second; ++it) |
| 27 matches->push_back(it->second); | 29 synchronous_matches->push_back(it->second); |
| 28 } | 30 } |
| 29 | 31 |
| 30 } // namespace net | 32 } // namespace net |
| OLD | NEW |