Left: | ||
Right: |
OLD | NEW |
---|---|
(Empty) | |
1 /* | |
2 * This file is part of Adblock Plus <https://adblockplus.org/>, | |
3 * Copyright (C) 2006-2016 Eyeo GmbH | |
4 * | |
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 | |
7 * published by the Free Software Foundation. | |
8 * | |
9 * Adblock Plus is distributed in the hope that it will be useful, | |
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
12 * GNU General Public License for more details. | |
13 * | |
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/>. | |
16 */ | |
17 | |
18 #ifndef _INSTANCES_H_ | |
19 #define _INSTANCES_H_ | |
20 | |
21 #include <mutex> | |
22 #include <map> | |
23 | |
24 /** | |
25 * A base class for a synchronized map from threads to BHO instances. | |
26 * | |
27 * This is a base class for 'CurrentThreadMap', defined in PluginClass.cpp. | |
28 * It's separated out here for testability. | |
29 * This class should not be used as polymorphic base class, as it has no virtual base class. | |
30 * | |
31 * The member functions here not simply forwarded versions of the container func tions. | |
32 * Rather, they are specialized for tracking BHO calls to SetSite(). | |
33 * Their semantics allow for verification that the call pattern is as expected. | |
34 * | |
35 * The key to the map (in the subclass) is the thread ID, thus operations are se rialized on a per-key basis. | |
36 * Calls to SetSite() bracket all other calls, so on a per-key basis | |
37 * the order of operations is always either (insert / find-success / erase) or (find-failure). | |
38 * The library guarantees for std::map seem to indicate that operations on diffe rent keys | |
39 * do not interfer with each other, but there's some ambiguity there. | |
40 * This class is synchronized as a matter of defensive programming. | |
41 */ | |
42 template<class Key, class T, T nullValue> | |
43 class SyncMap | |
44 { | |
45 typedef std::lock_guard<std::mutex> SentryType; | |
46 | |
47 /** | |
48 * Underlying map container | |
49 */ | |
50 std::map<Key, T> idMap; | |
51 | |
52 /** | |
53 * Synchronization primitive | |
54 */ | |
55 mutable std::mutex mutex; | |
56 | |
57 public: | |
58 /** | |
59 * Returns true if (as expected) no key of value 'id' was present. | |
60 * Returns false otherwise. | |
61 */ | |
62 bool AddIfAbsent(Key id, T p) | |
63 { | |
64 SentryType sentry(mutex); | |
65 auto it = idMap.insert(std::make_pair(id,p)); | |
sergei
2016/07/19 07:56:09
missing space after comma
Eric
2016/07/27 20:14:22
Fixed.
| |
66 return it.second; | |
67 // Assert it.second==true implies the insertion took place, | |
68 // which means there was no key of value 'id' already present. | |
sergei
2016/07/19 07:56:10
I think we don't need this comment.
| |
69 } | |
70 | |
71 /** | |
72 * Returns true if (as expected) a key of value 'id' was already present. | |
73 * Returns false otherwise. | |
74 */ | |
75 bool RemoveIfPresent(Key id) | |
76 { | |
77 SentryType sentry(mutex); | |
78 auto it = idMap.find(id); | |
79 if (it == idMap.end()) | |
80 { | |
81 return false; | |
82 } | |
83 idMap.erase(it); | |
84 return true; | |
85 } | |
86 | |
87 /** | |
88 * Returns a non-nullValue if a key of value 'id' is present. | |
89 * Returns nullValue otherwise. | |
90 */ | |
91 T Locate(Key id) const | |
92 { | |
93 SentryType sentry(mutex); | |
94 auto it = idMap.find(id); | |
95 return (it != idMap.end()) ? it->second : nullValue; | |
96 } | |
97 }; | |
98 | |
99 #endif | |
OLD | NEW |