OLD | NEW |
1 /* | 1 /* |
2 * This file is part of Adblock Plus <http://adblockplus.org/>, | 2 * This file is part of Adblock Plus <http://adblockplus.org/>, |
3 * Copyright (C) 2006-2014 Eyeo GmbH | 3 * Copyright (C) 2006-2014 Eyeo GmbH |
4 * | 4 * |
5 * Adblock Plus is free software: you can redistribute it and/or modify | 5 * Adblock Plus is free software: you can redistribute it and/or modify |
6 * it under the terms of the GNU General Public License version 3 as | 6 * it under the terms of the GNU General Public License version 3 as |
7 * published by the Free Software Foundation. | 7 * published by the Free Software Foundation. |
8 * | 8 * |
9 * Adblock Plus is distributed in the hope that it will be useful, | 9 * Adblock Plus is distributed in the hope that it will be useful, |
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of | 10 * but WITHOUT ANY WARRANTY; without even the implied warranty of |
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | 11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
12 * GNU General Public License for more details. | 12 * GNU General Public License for more details. |
13 * | 13 * |
14 * You should have received a copy of the GNU General Public License | 14 * You should have received a copy of the GNU General Public License |
15 * along with Adblock Plus. If not, see <http://www.gnu.org/licenses/>. | 15 * along with Adblock Plus. If not, see <http://www.gnu.org/licenses/>. |
16 */ | 16 */ |
17 | 17 |
18 #ifndef ADBLOCK_PLUS_REFERRER_MAPPING_H | 18 #ifndef ADBLOCK_PLUS_REFERRER_MAPPING_H |
19 #define ADBLOCK_PLUS_REFERRER_MAPPING_H | 19 #define ADBLOCK_PLUS_REFERRER_MAPPING_H |
20 | 20 |
21 #include <list> | 21 #include <list> |
22 #include <map> | 22 #include <map> |
23 #include <string> | 23 #include <string> |
24 #include <vector> | 24 #include <vector> |
25 | 25 |
26 namespace AdblockPlus | 26 namespace AdblockPlus |
27 { | 27 { |
| 28 /** |
| 29 * Stores a mapping between URLs and their referrers. |
| 30 * This can be used to build a chain of referrers for any URL |
| 31 * (see `BuildReferrerChain()`), which approximates the frame structure, see |
| 32 * FilterEngine::Matches(). |
| 33 */ |
28 class ReferrerMapping | 34 class ReferrerMapping |
29 { | 35 { |
30 public: | 36 public: |
| 37 /** |
| 38 * Constructor. |
| 39 * @param maxCachedUrls Number of URL mappings to store. The higher the |
| 40 * better - clients typically cache requests, and a single cached |
| 41 * request will break the referrer chain. |
| 42 */ |
31 ReferrerMapping(const int maxCachedUrls = 5000); | 43 ReferrerMapping(const int maxCachedUrls = 5000); |
| 44 |
| 45 /** |
| 46 * Records the refferer for a URL. |
| 47 * @param url Request URL. |
| 48 * @param referrer Request referrer. |
| 49 */ |
32 void Add(const std::string& url, const std::string& referrer); | 50 void Add(const std::string& url, const std::string& referrer); |
| 51 |
| 52 /** |
| 53 * Builds a chain of referrers for the supplied URL. |
| 54 * This should reconstruct a document's parent frame URLs. |
| 55 * @param url URL to build the chain for. |
| 56 * @return List of URLs, starting with `url`. |
| 57 */ |
33 std::vector<std::string> BuildReferrerChain(const std::string& url) const; | 58 std::vector<std::string> BuildReferrerChain(const std::string& url) const; |
34 | 59 |
35 private: | 60 private: |
36 const int maxCachedUrls; | 61 const int maxCachedUrls; |
37 std::map<std::string, std::string> mapping; | 62 std::map<std::string, std::string> mapping; |
38 std::list<std::string> cachedUrls; | 63 std::list<std::string> cachedUrls; |
39 }; | 64 }; |
40 } | 65 } |
41 | 66 |
42 #endif | 67 #endif |
OLD | NEW |