| OLD | NEW |
| 1 // Copyright (c) 2006-2008 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2006-2008 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 #ifndef CHROME_BROWSER_SAFE_BROWSING_SAFE_BROWSING_DATABASE_H_ | 5 #ifndef CHROME_BROWSER_SAFE_BROWSING_SAFE_BROWSING_DATABASE_H_ |
| 6 #define CHROME_BROWSER_SAFE_BROWSING_SAFE_BROWSING_DATABASE_H_ | 6 #define CHROME_BROWSER_SAFE_BROWSING_SAFE_BROWSING_DATABASE_H_ |
| 7 | 7 |
| 8 #include <deque> | 8 #include <deque> |
| 9 #include <string> | 9 #include <string> |
| 10 #include <vector> | 10 #include <vector> |
| (...skipping 33 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 44 // called. This function can only be called after Init succeeded. | 44 // called. This function can only be called after Init succeeded. |
| 45 virtual bool NeedToCheckUrl(const GURL& url); | 45 virtual bool NeedToCheckUrl(const GURL& url); |
| 46 | 46 |
| 47 // Returns false if the given url is not in the database. If it returns | 47 // Returns false if the given url is not in the database. If it returns |
| 48 // true, then either "list" is the name of the matching list, or prefix_hits | 48 // true, then either "list" is the name of the matching list, or prefix_hits |
| 49 // contains the matching hash prefixes. | 49 // contains the matching hash prefixes. |
| 50 virtual bool ContainsUrl(const GURL& url, | 50 virtual bool ContainsUrl(const GURL& url, |
| 51 std::string* matching_list, | 51 std::string* matching_list, |
| 52 std::vector<SBPrefix>* prefix_hits, | 52 std::vector<SBPrefix>* prefix_hits, |
| 53 std::vector<SBFullHashResult>* full_hits, | 53 std::vector<SBFullHashResult>* full_hits, |
| 54 Time last_update) = 0; | 54 base::Time last_update) = 0; |
| 55 | 55 |
| 56 // Processes add/sub commands. Database will free the chunks when it's done. | 56 // Processes add/sub commands. Database will free the chunks when it's done. |
| 57 virtual void InsertChunks(const std::string& list_name, | 57 virtual void InsertChunks(const std::string& list_name, |
| 58 std::deque<SBChunk>* chunks) = 0; | 58 std::deque<SBChunk>* chunks) = 0; |
| 59 | 59 |
| 60 // Processs adddel/subdel commands. Database will free chunk_deletes when | 60 // Processs adddel/subdel commands. Database will free chunk_deletes when |
| 61 // it's done. | 61 // it's done. |
| 62 virtual void DeleteChunks(std::vector<SBChunkDelete>* chunk_deletes) = 0; | 62 virtual void DeleteChunks(std::vector<SBChunkDelete>* chunk_deletes) = 0; |
| 63 | 63 |
| 64 // Returns the lists and their add/sub chunks. | 64 // Returns the lists and their add/sub chunks. |
| (...skipping 32 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 97 virtual void BuildBloomFilter() = 0; | 97 virtual void BuildBloomFilter() = 0; |
| 98 | 98 |
| 99 // Measuring false positive rate. Call this each time we look in the filter. | 99 // Measuring false positive rate. Call this each time we look in the filter. |
| 100 virtual void IncrementBloomFilterReadCount() {}; | 100 virtual void IncrementBloomFilterReadCount() {}; |
| 101 | 101 |
| 102 std::wstring bloom_filter_filename_; | 102 std::wstring bloom_filter_filename_; |
| 103 scoped_ptr<BloomFilter> bloom_filter_; | 103 scoped_ptr<BloomFilter> bloom_filter_; |
| 104 }; | 104 }; |
| 105 | 105 |
| 106 #endif // CHROME_BROWSER_SAFE_BROWSING_SAFE_BROWSING_DATABASE_H_ | 106 #endif // CHROME_BROWSER_SAFE_BROWSING_SAFE_BROWSING_DATABASE_H_ |
| OLD | NEW |