LEFT | RIGHT |
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 |
(...skipping 10 matching lines...) Expand all Loading... |
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 /** | 28 /** |
29 * Stores a mapping between URLs and their referrers. | 29 * Stores a mapping between URLs and their referrers. |
30 * This can be used to build a chain of referrers for any URL | 30 * This can be used to build a chain of referrers for any URL |
31 * (see `BuildReferrerChain()`), which approximates the frame structure. | 31 * (see `BuildReferrerChain()`), which approximates the frame structure, see |
| 32 * FilterEngine::Matches(). |
32 */ | 33 */ |
33 class ReferrerMapping | 34 class ReferrerMapping |
34 { | 35 { |
35 public: | 36 public: |
36 /** | 37 /** |
37 * Constructor. | 38 * Constructor. |
38 * @param maxCachedUrls Number of URL mappings to store. The higher the | 39 * @param maxCachedUrls Number of URL mappings to store. The higher the |
39 * better - clients typically cache requests, and a single cached | 40 * better - clients typically cache requests, and a single cached |
40 * request will break the referrer chain. | 41 * request will break the referrer chain. |
41 */ | 42 */ |
42 ReferrerMapping(const int maxCachedUrls = 5000); | 43 ReferrerMapping(const int maxCachedUrls = 5000); |
43 | 44 |
44 /** | 45 /** |
45 * Adds a new mapping from URL to referrer. | 46 * Records the refferer for a URL. |
46 * @param url Request URL. | 47 * @param url Request URL. |
47 * @param referrer Request referrer. | 48 * @param referrer Request referrer. |
48 */ | 49 */ |
49 void Add(const std::string& url, const std::string& referrer); | 50 void Add(const std::string& url, const std::string& referrer); |
50 | 51 |
51 /** | 52 /** |
52 * Builds the referrer chain for the supplied URL. | 53 * Builds a chain of referrers for the supplied URL. |
| 54 * This should reconstruct a document's parent frame URLs. |
53 * @param url URL to build the chain for. | 55 * @param url URL to build the chain for. |
54 * @return List of URLs, starting with `url`. | 56 * @return List of URLs, starting with `url`. |
55 */ | 57 */ |
56 std::vector<std::string> BuildReferrerChain(const std::string& url) const; | 58 std::vector<std::string> BuildReferrerChain(const std::string& url) const; |
57 | 59 |
58 private: | 60 private: |
59 const int maxCachedUrls; | 61 const int maxCachedUrls; |
60 std::map<std::string, std::string> mapping; | 62 std::map<std::string, std::string> mapping; |
61 std::list<std::string> cachedUrls; | 63 std::list<std::string> cachedUrls; |
62 }; | 64 }; |
63 } | 65 } |
64 | 66 |
65 #endif | 67 #endif |
LEFT | RIGHT |