OLD | NEW |
1 // Copyright 2013 The Chromium Authors. All rights reserved. | 1 // Copyright 2013 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 "components/user_prefs/user_prefs.h" | 5 #include "components/user_prefs/user_prefs.h" |
6 | 6 |
7 #include "base/logging.h" | 7 #include "base/logging.h" |
8 #include "base/memory/singleton.h" | 8 #include "base/memory/singleton.h" |
9 #include "base/prefs/pref_service.h" | 9 #include "base/prefs/pref_service.h" |
10 #include "content/public/browser/browser_context.h" | 10 #include "content/public/browser/browser_context.h" |
11 | 11 |
12 namespace components { | 12 namespace user_prefs { |
13 | 13 |
14 namespace { | 14 namespace { |
15 | 15 |
16 void* UserDataKey() { | 16 void* UserDataKey() { |
17 // We just need a unique constant. Use the address of a static that | 17 // We just need a unique constant. Use the address of a static that |
18 // COMDAT folding won't touch in an optimizing linker. | 18 // COMDAT folding won't touch in an optimizing linker. |
19 static int data_key = 0; | 19 static int data_key = 0; |
20 return reinterpret_cast<void*>(&data_key); | 20 return reinterpret_cast<void*>(&data_key); |
21 } | 21 } |
22 | 22 |
(...skipping 14 matching lines...) Expand all Loading... |
37 DCHECK(!context->GetUserData(UserDataKey())); | 37 DCHECK(!context->GetUserData(UserDataKey())); |
38 context->SetUserData(UserDataKey(), new UserPrefs(prefs)); | 38 context->SetUserData(UserDataKey(), new UserPrefs(prefs)); |
39 } | 39 } |
40 | 40 |
41 UserPrefs::UserPrefs(PrefService* prefs) : prefs_(prefs) { | 41 UserPrefs::UserPrefs(PrefService* prefs) : prefs_(prefs) { |
42 } | 42 } |
43 | 43 |
44 UserPrefs::~UserPrefs() { | 44 UserPrefs::~UserPrefs() { |
45 } | 45 } |
46 | 46 |
47 } // namespace components | 47 } // namespace user_prefs |
OLD | NEW |