Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 // Copyright (c) 2010 The Chromium Authors. All rights reserved. | 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 | 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 #include "chrome/installer/util/delete_reg_key_work_item.h" | 5 #include "chrome/installer/util/registry_key_backup.h" |
| 6 | 6 |
| 7 #include <shlwapi.h> | |
| 8 #include <algorithm> | 7 #include <algorithm> |
| 9 #include <limits> | 8 #include <limits> |
| 10 #include <vector> | 9 #include <vector> |
| 11 | 10 |
| 12 #include "base/logging.h" | 11 #include "base/logging.h" |
| 13 #include "base/rand_util.h" | |
| 14 #include "base/stringprintf.h" | |
| 15 #include "base/win/registry.h" | 12 #include "base/win/registry.h" |
| 16 #include "chrome/installer/util/logging_installer.h" | |
| 17 | 13 |
| 18 using base::win::RegKey; | 14 using base::win::RegKey; |
| 19 | 15 |
| 20 namespace { | 16 namespace { |
| 21 const REGSAM kKeyReadNoNotify = (KEY_READ) & ~(KEY_NOTIFY); | 17 const REGSAM kKeyReadNoNotify = (KEY_READ) & ~(KEY_NOTIFY); |
| 22 } | 18 } |
|
erikwright (departed)
2011/09/15 18:38:57
} // namespace
grt (UTC plus 2)
2011/09/16 17:45:45
Done.
| |
| 23 | 19 |
| 24 // A container for a registry key, its values, and its subkeys. We don't use | 20 // A container for a registry value. |
| 25 // more obvious methods for various reasons: | 21 class RegistryKeyBackup::RegistryValueBackup { |
| 26 // - RegCopyTree isn't supported pre-Vista, so we'd have to do something | |
| 27 // different for XP anyway. | |
| 28 // - SHCopyKey can't copy subkeys into a volatile destination, so we'd have to | |
| 29 // worry about polluting the registry. | |
| 30 // We don't persist security attributes since we only delete keys that we own, | |
| 31 // and we don't set custom attributes on them anyway. | |
| 32 class DeleteRegKeyWorkItem::RegKeyBackup { | |
| 33 public: | 22 public: |
| 34 RegKeyBackup(); | 23 RegistryValueBackup(); |
| 35 bool Initialize(const RegKey& key); | 24 ~RegistryValueBackup(); |
| 36 bool WriteTo(RegKey* key) const; | 25 void Initialize(const wchar_t* name_buffer, DWORD name_size, |
| 26 DWORD type, const uint8* data, DWORD data_size); | |
| 27 const std::wstring& name_str() const { return name_; } | |
| 28 const wchar_t* name() const { return name_.empty() ? NULL : name_.c_str(); } | |
| 29 DWORD type() const { return type_; } | |
| 30 const uint8* data() const { return data_.empty() ? NULL : &data_[0]; } | |
| 31 DWORD data_len() const { return static_cast<DWORD>(data_.size()); } | |
| 37 | 32 |
| 38 private: | 33 private: |
| 39 // A container for a registry value. | 34 std::wstring name_; |
| 40 class RegValueBackup { | 35 std::vector<uint8> data_; |
| 41 public: | 36 DWORD type_; |
| 42 RegValueBackup(); | |
| 43 void Initialize(const wchar_t* name_buffer, DWORD name_size, | |
| 44 DWORD type, const uint8* data, DWORD data_size); | |
| 45 const std::wstring& name_str() const { return name_; } | |
| 46 const wchar_t* name() const { return name_.empty() ? NULL : name_.c_str(); } | |
| 47 DWORD type() const { return type_; } | |
| 48 const uint8* data() const { return data_.empty() ? NULL : &data_[0]; } | |
| 49 DWORD data_len() const { return static_cast<DWORD>(data_.size()); } | |
| 50 | 37 |
| 51 private: | 38 DISALLOW_COPY_AND_ASSIGN(RegistryValueBackup); |
| 52 std::wstring name_; | |
| 53 std::vector<uint8> data_; | |
| 54 DWORD type_; | |
| 55 | |
| 56 DISALLOW_COPY_AND_ASSIGN(RegValueBackup); | |
| 57 }; | |
| 58 | |
| 59 scoped_array<RegValueBackup> values_; | |
| 60 scoped_array<std::wstring> subkey_names_; | |
| 61 scoped_array<RegKeyBackup> subkeys_; | |
| 62 ptrdiff_t num_values_; | |
| 63 ptrdiff_t num_subkeys_; | |
| 64 | |
| 65 DISALLOW_COPY_AND_ASSIGN(RegKeyBackup); | |
| 66 }; | 39 }; |
| 67 | 40 |
| 68 DeleteRegKeyWorkItem::RegKeyBackup::RegValueBackup::RegValueBackup() | 41 RegistryKeyBackup::RegistryValueBackup::RegistryValueBackup() |
| 69 : type_(REG_NONE) { | 42 : type_(REG_NONE) { |
| 70 } | 43 } |
| 71 | 44 |
| 72 void DeleteRegKeyWorkItem::RegKeyBackup::RegValueBackup::Initialize( | 45 RegistryKeyBackup::RegistryValueBackup::~RegistryValueBackup() |
|
erikwright (departed)
2011/09/15 18:38:57
Why are you required to explicitly define a destru
grt (UTC plus 2)
2011/09/16 17:45:45
Since the class has non-POD data members, the dtor
| |
| 46 { | |
| 47 } | |
| 48 | |
| 49 void RegistryKeyBackup::RegistryValueBackup::Initialize( | |
| 73 const wchar_t* name_buffer, | 50 const wchar_t* name_buffer, |
| 74 DWORD name_size, | 51 DWORD name_size, |
| 75 DWORD type, const uint8* data, | 52 DWORD type, |
| 53 const uint8* data, | |
| 76 DWORD data_size) { | 54 DWORD data_size) { |
| 77 name_.assign(name_buffer, name_size); | 55 name_.assign(name_buffer, name_size); |
| 78 type_ = type; | 56 type_ = type; |
| 79 data_.assign(data, data + data_size); | 57 data_.assign(data, data + data_size); |
| 80 } | 58 } |
| 81 | 59 |
| 82 DeleteRegKeyWorkItem::RegKeyBackup::RegKeyBackup() | 60 RegistryKeyBackup::RegistryKeyBackup() |
| 83 : num_values_(0), | 61 : num_values_(0), |
| 84 num_subkeys_(0) { | 62 num_subkeys_(0) { |
| 85 } | 63 } |
| 86 | 64 |
| 65 RegistryKeyBackup::~RegistryKeyBackup() | |
| 66 { | |
| 67 } | |
| 68 | |
| 87 // Initializes this object by reading the values and subkeys of |key|. | 69 // Initializes this object by reading the values and subkeys of |key|. |
| 88 // Security descriptors are not backed up. | 70 // Security descriptors are not backed up. |
| 89 bool DeleteRegKeyWorkItem::RegKeyBackup::Initialize(const RegKey& key) { | 71 bool RegistryKeyBackup::Initialize(const RegKey& key) { |
| 90 DCHECK(key.Valid()); | 72 scoped_array<RegistryValueBackup> values; |
| 91 | |
| 92 scoped_array<RegValueBackup> values; | |
| 93 scoped_array<std::wstring> subkey_names; | 73 scoped_array<std::wstring> subkey_names; |
| 94 scoped_array<RegKeyBackup> subkeys; | 74 scoped_array<RegistryKeyBackup> subkeys; |
| 95 | 75 |
| 96 DWORD num_subkeys = 0; | 76 DWORD num_subkeys = 0; |
| 97 DWORD max_subkey_name_len = 0; | 77 DWORD max_subkey_name_len = 0; |
| 98 DWORD num_values = 0; | 78 DWORD num_values = 0; |
| 99 DWORD max_value_name_len = 0; | 79 DWORD max_value_name_len = 0; |
| 100 DWORD max_value_len = 0; | 80 DWORD max_value_len = 0; |
| 101 LONG result = RegQueryInfoKey(key.Handle(), NULL, NULL, NULL, | 81 LONG result = RegQueryInfoKey(key.Handle(), NULL, NULL, NULL, |
| 102 &num_subkeys, &max_subkey_name_len, NULL, | 82 &num_subkeys, &max_subkey_name_len, NULL, |
| 103 &num_values, &max_value_name_len, | 83 &num_values, &max_value_name_len, |
| 104 &max_value_len, NULL, NULL); | 84 &max_value_len, NULL, NULL); |
| 105 if (result != ERROR_SUCCESS) { | 85 if (result != ERROR_SUCCESS) { |
| 106 LOG(ERROR) << "Failed getting info of key to backup, result: " << result; | 86 LOG(ERROR) << "Failed getting info of key to backup, result: " << result; |
| 107 return false; | 87 return false; |
| 108 } | 88 } |
| 109 if (max_subkey_name_len >= std::numeric_limits<DWORD>::max() - 1 || | 89 if (max_subkey_name_len >= std::numeric_limits<DWORD>::max() - 1 || |
| 110 max_value_name_len >= std::numeric_limits<DWORD>::max() - 1) { | 90 max_value_name_len >= std::numeric_limits<DWORD>::max() - 1) { |
| 111 LOG(ERROR) | 91 LOG(ERROR) |
| 112 << "Failed backing up key; subkeys and/or names are out of range."; | 92 << "Failed backing up key; subkeys and/or names are out of range."; |
| 113 return false; | 93 return false; |
| 114 } | 94 } |
| 115 DWORD max_name_len = std::max(max_subkey_name_len, max_value_name_len) + 1; | 95 DWORD max_name_len = std::max(max_subkey_name_len, max_value_name_len) + 1; |
| 116 scoped_array<wchar_t> name_buffer(new wchar_t[max_name_len]); | 96 scoped_array<wchar_t> name_buffer(new wchar_t[max_name_len]); |
| 117 | 97 |
| 118 // Backup the values. | 98 // Backup the values. |
| 119 if (num_values != 0) { | 99 if (num_values != 0) { |
| 120 values.reset(new RegValueBackup[num_values]); | 100 values.reset(new RegistryValueBackup[num_values]); |
| 121 scoped_array<uint8> value_buffer(new uint8[max_value_len]); | 101 scoped_array<uint8> value_buffer(new uint8[max_value_len]); |
| 122 DWORD name_size = 0; | 102 DWORD name_size = 0; |
| 123 DWORD value_type = REG_NONE; | 103 DWORD value_type = REG_NONE; |
| 124 DWORD value_size = 0; | 104 DWORD value_size = 0; |
| 125 | 105 |
| 126 for (DWORD i = 0; i < num_values; ) { | 106 for (DWORD i = 0; i < num_values; ) { |
| 127 name_size = max_name_len; | 107 name_size = max_name_len; |
| 128 value_size = max_value_len; | 108 value_size = max_value_len; |
| 129 result = RegEnumValue(key.Handle(), i, name_buffer.get(), &name_size, | 109 result = RegEnumValue(key.Handle(), i, name_buffer.get(), &name_size, |
| 130 NULL, &value_type, value_buffer.get(), &value_size); | 110 NULL, &value_type, value_buffer.get(), &value_size); |
| 131 switch (result) { | 111 switch (result) { |
| 132 case ERROR_NO_MORE_ITEMS: | 112 case ERROR_NO_MORE_ITEMS: |
| 133 num_values = i; | 113 num_values = i; |
| 134 break; | 114 break; |
| 135 case ERROR_SUCCESS: | 115 case ERROR_SUCCESS: |
| 136 values[i].Initialize(name_buffer.get(), name_size, value_type, | 116 values[i].Initialize(name_buffer.get(), name_size, value_type, |
| 137 value_buffer.get(), value_size); | 117 value_buffer.get(), value_size); |
| 138 ++i; | 118 ++i; |
| 139 break; | 119 break; |
| 140 case ERROR_MORE_DATA: | 120 case ERROR_MORE_DATA: |
| 141 if (value_size > max_value_len) { | 121 if (value_size > max_value_len) { |
| 142 max_value_len = value_size; | 122 max_value_len = value_size; |
| 123 value_buffer.reset(); // Release to heap before new allocation. | |
| 143 value_buffer.reset(new uint8[max_value_len]); | 124 value_buffer.reset(new uint8[max_value_len]); |
| 144 } else { | 125 } else { |
| 145 DCHECK(max_name_len - 1 < name_size); | 126 DCHECK_LT(max_name_len - 1, name_size); |
| 146 if (name_size >= std::numeric_limits<DWORD>::max() - 1) { | 127 if (name_size >= std::numeric_limits<DWORD>::max() - 1) { |
| 147 LOG(ERROR) << "Failed backing up key; value name out of range."; | 128 LOG(ERROR) << "Failed backing up key; value name out of range."; |
| 148 return false; | 129 return false; |
| 149 } | 130 } |
| 150 max_name_len = name_size + 1; | 131 max_name_len = name_size + 1; |
| 132 name_buffer.reset(); // Release to heap before new allocation. | |
| 151 name_buffer.reset(new wchar_t[max_name_len]); | 133 name_buffer.reset(new wchar_t[max_name_len]); |
| 152 } | 134 } |
| 153 break; | 135 break; |
| 154 default: | 136 default: |
| 155 LOG(ERROR) << "Failed backing up value " << i << ", result: " | 137 LOG(ERROR) << "Failed backing up value " << i << ", result: " |
| 156 << result; | 138 << result; |
| 157 return false; | 139 return false; |
| 158 } | 140 } |
| 159 } | 141 } |
| 160 DLOG_IF(WARNING, RegEnumValue(key.Handle(), num_values, name_buffer.get(), | 142 DLOG_IF(WARNING, RegEnumValue(key.Handle(), num_values, name_buffer.get(), |
| 161 &name_size, NULL, &value_type, NULL, | 143 &name_size, NULL, &value_type, NULL, |
| 162 NULL) != ERROR_NO_MORE_ITEMS) | 144 NULL) != ERROR_NO_MORE_ITEMS) |
| 163 << "Concurrent modifications to registry key during backup operation."; | 145 << "Concurrent modifications to registry key during backup operation."; |
| 164 } | 146 } |
| 165 | 147 |
| 166 // Backup the subkeys. | 148 // Backup the subkeys. |
| 167 if (num_subkeys != 0) { | 149 if (num_subkeys != 0) { |
| 168 subkey_names.reset(new std::wstring[num_subkeys]); | 150 subkey_names.reset(new std::wstring[num_subkeys]); |
| 169 subkeys.reset(new RegKeyBackup[num_subkeys]); | 151 subkeys.reset(new RegistryKeyBackup[num_subkeys]); |
| 170 DWORD name_size = 0; | 152 DWORD name_size = 0; |
| 171 | 153 |
| 172 // Get the names of them. | 154 // Get the names of them. |
| 173 for (DWORD i = 0; i < num_subkeys; ) { | 155 for (DWORD i = 0; i < num_subkeys; ) { |
| 174 name_size = max_name_len; | 156 name_size = max_name_len; |
| 175 result = RegEnumKeyEx(key.Handle(), i, name_buffer.get(), &name_size, | 157 result = RegEnumKeyEx(key.Handle(), i, name_buffer.get(), &name_size, |
| 176 NULL, NULL, NULL, NULL); | 158 NULL, NULL, NULL, NULL); |
| 177 switch (result) { | 159 switch (result) { |
| 178 case ERROR_NO_MORE_ITEMS: | 160 case ERROR_NO_MORE_ITEMS: |
| 179 num_subkeys = i; | 161 num_subkeys = i; |
| (...skipping 41 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 221 values_.swap(values); | 203 values_.swap(values); |
| 222 subkey_names_.swap(subkey_names); | 204 subkey_names_.swap(subkey_names); |
| 223 subkeys_.swap(subkeys); | 205 subkeys_.swap(subkeys); |
| 224 num_values_ = num_values; | 206 num_values_ = num_values; |
| 225 num_subkeys_ = num_subkeys; | 207 num_subkeys_ = num_subkeys; |
| 226 | 208 |
| 227 return true; | 209 return true; |
| 228 } | 210 } |
| 229 | 211 |
| 230 // Writes the values and subkeys of this object into |key|. | 212 // Writes the values and subkeys of this object into |key|. |
| 231 bool DeleteRegKeyWorkItem::RegKeyBackup::WriteTo(RegKey* key) const { | 213 bool RegistryKeyBackup::WriteTo(RegKey* key) const { |
| 214 DCHECK(key); | |
| 215 | |
| 232 LONG result = ERROR_SUCCESS; | 216 LONG result = ERROR_SUCCESS; |
| 233 | 217 |
| 234 // Write the values. | 218 // Write the values. |
| 235 for (int i = 0; i < num_values_; ++i) { | 219 for (DWORD i = 0; i < num_values_; ++i) { |
| 236 const RegValueBackup& value = values_[i]; | 220 const RegistryValueBackup& value = values_[i]; |
| 237 result = RegSetValueEx(key->Handle(), value.name(), 0, value.type(), | 221 result = RegSetValueEx(key->Handle(), value.name(), 0, value.type(), |
| 238 value.data(), value.data_len()); | 222 value.data(), value.data_len()); |
| 239 if (result != ERROR_SUCCESS) { | 223 if (result != ERROR_SUCCESS) { |
| 240 LOG(ERROR) << "Failed writing value \"" << value.name_str() | 224 LOG(ERROR) << "Failed writing value \"" << value.name_str() |
| 241 << "\", result: " << result; | 225 << "\", result: " << result; |
| 242 return false; | 226 return false; |
| 243 } | 227 } |
| 244 } | 228 } |
| 245 | 229 |
| 246 // Write the subkeys. | 230 // Write the subkeys. |
| 247 RegKey subkey; | 231 RegKey subkey; |
| 248 for (int i = 0; i < num_subkeys_; ++i) { | 232 for (DWORD i = 0; i < num_subkeys_; ++i) { |
| 249 const std::wstring& name = subkey_names_[i]; | 233 const std::wstring& name = subkey_names_[i]; |
| 250 | 234 |
| 251 result = subkey.Create(key->Handle(), name.c_str(), KEY_WRITE); | 235 result = subkey.Create(key->Handle(), name.c_str(), KEY_WRITE); |
| 252 if (result != ERROR_SUCCESS) { | 236 if (result != ERROR_SUCCESS) { |
| 253 LOG(ERROR) << "Failed creating subkey \"" << name << "\", result: " | 237 LOG(ERROR) << "Failed creating subkey \"" << name << "\", result: " |
| 254 << result; | 238 << result; |
| 255 return false; | 239 return false; |
| 256 } | 240 } |
| 257 if (!subkeys_[i].WriteTo(&subkey)) { | 241 if (!subkeys_[i].WriteTo(&subkey)) { |
| 258 LOG(ERROR) << "Failed writing subkey \"" << name << "\", result: " | 242 LOG(ERROR) << "Failed writing subkey \"" << name << "\", result: " |
| 259 << result; | 243 << result; |
| 260 return false; | 244 return false; |
| 261 } | 245 } |
| 262 } | 246 } |
| 263 | 247 |
| 264 return true; | 248 return true; |
| 265 } | 249 } |
| 266 | |
| 267 DeleteRegKeyWorkItem::~DeleteRegKeyWorkItem() { | |
| 268 } | |
| 269 | |
| 270 DeleteRegKeyWorkItem::DeleteRegKeyWorkItem(HKEY predefined_root, | |
| 271 const std::wstring& path) | |
| 272 : predefined_root_(predefined_root), | |
| 273 path_(path) { | |
| 274 // It's a safe bet that we don't want to delete one of the root trees. | |
| 275 DCHECK(!path.empty()); | |
| 276 } | |
| 277 | |
| 278 bool DeleteRegKeyWorkItem::Do() { | |
| 279 scoped_ptr<RegKeyBackup> backup; | |
| 280 | |
| 281 // Only try to make a backup if we're not configured to ignore failures. | |
| 282 if (!ignore_failure_) { | |
| 283 RegKey original_key; | |
| 284 | |
| 285 // Does the key exist? | |
| 286 LONG result = original_key.Open(predefined_root_, path_.c_str(), | |
| 287 kKeyReadNoNotify); | |
| 288 if (result == ERROR_SUCCESS) { | |
| 289 backup.reset(new RegKeyBackup()); | |
| 290 if (!backup->Initialize(original_key)) { | |
| 291 LOG(ERROR) << "Failed to backup key at " << path_; | |
| 292 return ignore_failure_; | |
| 293 } | |
| 294 } else if (result != ERROR_FILE_NOT_FOUND) { | |
| 295 LOG(ERROR) << "Failed to open key at " << path_ | |
| 296 << " to create backup, result: " << result; | |
| 297 return ignore_failure_; | |
| 298 } | |
| 299 } | |
| 300 | |
| 301 // Delete the key. | |
| 302 LONG result = SHDeleteKey(predefined_root_, path_.c_str()); | |
| 303 if (result != ERROR_SUCCESS && result != ERROR_FILE_NOT_FOUND) { | |
| 304 LOG(ERROR) << "Failed to delete key at " << path_ << ", result: " | |
| 305 << result; | |
| 306 return ignore_failure_; | |
| 307 } | |
| 308 | |
| 309 // We've succeeded, so remember any backup we may have made. | |
| 310 backup_.swap(backup); | |
| 311 | |
| 312 return true; | |
| 313 } | |
| 314 | |
| 315 void DeleteRegKeyWorkItem::Rollback() { | |
| 316 if (ignore_failure_ || backup_.get() == NULL) | |
| 317 return; | |
| 318 | |
| 319 // Delete anything in the key before restoring the backup in case someone else | |
| 320 // put new data in the key after Do(). | |
| 321 LONG result = SHDeleteKey(predefined_root_, path_.c_str()); | |
| 322 if (result != ERROR_SUCCESS && result != ERROR_FILE_NOT_FOUND) { | |
| 323 LOG(ERROR) << "Failed to delete key at " << path_ << " in rollback, " | |
| 324 "result: " << result; | |
| 325 } | |
| 326 | |
| 327 // Restore the old contents. The restoration takes on its default security | |
| 328 // attributes; any custom attributes are lost. | |
| 329 RegKey original_key; | |
| 330 result = original_key.Create(predefined_root_, path_.c_str(), KEY_WRITE); | |
| 331 if (result != ERROR_SUCCESS) { | |
| 332 LOG(ERROR) << "Failed to create original key at " << path_ | |
| 333 << " in rollback, result: " << result; | |
| 334 } else { | |
| 335 if (!backup_->WriteTo(&original_key)) | |
| 336 LOG(ERROR) << "Failed to restore key in rollback, result: " << result; | |
| 337 } | |
| 338 } | |
| OLD | NEW |