OLD | NEW |
---|---|
(Empty) | |
1 // Copyright (c) 2011 The Chromium Authors. All rights reserved. | |
2 // Use of this source code is governed by a BSD-style license that can be | |
3 // found in the LICENSE file. | |
4 | |
5 #include "chrome/browser/policy/cloud_policy_provider.h" | |
6 | |
7 #include <set> | |
8 | |
9 #include "base/values.h" | |
10 #include "chrome/browser/policy/configuration_policy_pref_store.h" | |
11 #include "chrome/browser/policy/policy_notifier.h" | |
12 | |
13 namespace policy { | |
14 | |
15 CloudPolicyProvider::CloudPolicyProvider( | |
16 const ConfigurationPolicyProvider::PolicyDefinitionList* policy_list, | |
17 CloudPolicyCacheBase::PolicyLevel level) | |
18 : ConfigurationPolicyProvider(policy_list), | |
19 level_(level) {} | |
20 | |
21 CloudPolicyProvider::~CloudPolicyProvider() { | |
22 for (ListType::iterator i = caches_.begin(); i != caches_.end(); ++i) | |
23 (*i)->RemoveObserver(this); | |
24 | |
25 FOR_EACH_OBSERVER(ConfigurationPolicyProvider::Observer, | |
26 observer_list_, OnProviderGoingAway()); | |
27 } | |
28 | |
29 bool is_proxy_policy(ConfigurationPolicyType policy) { | |
Joao da Silva
2011/06/03 12:23:51
Place this in an unnamed namespace, so that the sy
sfeuz
2011/06/03 16:19:29
Done.
| |
30 return policy == kPolicyProxyMode || | |
31 policy == kPolicyProxyServerMode || | |
32 policy == kPolicyProxyServer || | |
33 policy == kPolicyProxyPacUrl || | |
34 policy == kPolicyProxyBypassList; | |
35 } | |
36 | |
37 void CloudPolicyProvider::CombineTwoPolicyMaps(const PolicyMap& base, | |
38 const PolicyMap& overlay, | |
39 PolicyMap* out_map) { | |
40 bool added_proxy_policy = false; | |
41 out_map->Clear(); | |
42 | |
43 for (PolicyMap::const_iterator i = base.begin(); i != base.end(); ++i) { | |
44 out_map->Set(i->first, i->second->DeepCopy()); | |
45 added_proxy_policy = added_proxy_policy || (is_proxy_policy(i->first)); | |
46 } | |
47 | |
48 // Add every entry of |overlay| which has not been added by |base|. Only add | |
49 // proxy policies if none of them was added by |base|. | |
50 for (PolicyMap::const_iterator i = overlay.begin(); i != overlay.end(); ++i) { | |
51 if (is_proxy_policy(i->first)) { | |
52 if (!added_proxy_policy) { | |
53 out_map->Set(i->first, i->second->DeepCopy()); | |
54 } | |
55 } else if (!out_map->Get(i->first)) { | |
56 out_map->Set(i->first, i->second->DeepCopy()); | |
57 } | |
58 } | |
59 } | |
60 | |
61 void CloudPolicyProvider::RecombineCachesAndMaybeTriggerUpdate() { | |
62 PolicyMap newly_combined; | |
63 for (ListType::iterator i = caches_.begin(); i != caches_.end(); ++i) { | |
64 if (!(*i)->initialization_complete()) | |
65 continue; | |
66 PolicyMap tmp_map; | |
67 CombineTwoPolicyMaps(newly_combined, *(*i)->policy(level_), &tmp_map); | |
68 newly_combined.Swap(&tmp_map); | |
69 } | |
70 if (newly_combined.Equals(combined)) | |
71 return; | |
72 | |
73 // Trigger a notification if there was a change. | |
74 combined.Swap(&newly_combined); | |
75 FOR_EACH_OBSERVER(ConfigurationPolicyProvider::Observer, | |
76 observer_list_, OnUpdatePolicy()); | |
77 } | |
78 | |
79 bool CloudPolicyProvider::Provide(ConfigurationPolicyStoreInterface* store) { | |
80 ApplyPolicyMap(&combined, store); | |
81 return true; | |
82 } | |
83 | |
84 bool CloudPolicyProvider::IsInitializationComplete() const { | |
85 return true; | |
86 } | |
87 | |
88 void CloudPolicyProvider::AppendCache(CloudPolicyCacheBase* cache) { | |
89 cache->AddObserver(this); | |
90 caches_.push_back(cache); | |
91 RecombineCachesAndMaybeTriggerUpdate(); | |
92 } | |
93 | |
94 void CloudPolicyProvider::PrependCache(CloudPolicyCacheBase* cache) { | |
95 cache->AddObserver(this); | |
96 caches_.insert(caches_.begin(), cache); | |
Joao da Silva
2011/06/03 12:23:51
std::list has push_front(), so maybe caches_ shoul
sfeuz
2011/06/03 16:19:29
I went with vector for consistency with other list
| |
97 RecombineCachesAndMaybeTriggerUpdate(); | |
98 } | |
99 | |
100 void CloudPolicyProvider::AddObserver( | |
101 ConfigurationPolicyProvider::Observer* observer) { | |
102 observer_list_.AddObserver(observer); | |
103 } | |
104 void CloudPolicyProvider::RemoveObserver( | |
105 ConfigurationPolicyProvider::Observer* observer) { | |
106 observer_list_.RemoveObserver(observer); | |
107 } | |
108 | |
109 void CloudPolicyProvider::OnCacheUpdate(CloudPolicyCacheBase* cache) { | |
110 RecombineCachesAndMaybeTriggerUpdate(); | |
111 } | |
112 | |
113 void CloudPolicyProvider::OnCacheGoingAway(CloudPolicyCacheBase* cache) { | |
114 cache->RemoveObserver(this); | |
115 for (ListType::iterator i = caches_.begin(); i != caches_.end(); ++i) { | |
116 if (*i == cache) { | |
117 caches_.erase(i); | |
Joao da Silva
2011/06/03 12:23:51
erase() is also cheaper on a std::list :-)
| |
118 break; | |
119 } | |
120 } | |
121 | |
122 RecombineCachesAndMaybeTriggerUpdate(); | |
123 } | |
124 | |
125 } // namespace policy | |
OLD | NEW |