Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(398)

Side by Side Diff: content/common/dom_storage/dom_storage_map.cc

Issue 22297005: Move webkit/{browser,common}/dom_storage into content/ (Closed) Base URL: svn://svn.chromium.org/chrome/trunk/src
Patch Set: Created 7 years, 4 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch | Annotate | Revision Log
OLDNEW
1 // Copyright (c) 2012 The Chromium Authors. All rights reserved. 1 // Copyright (c) 2012 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 "webkit/common/dom_storage/dom_storage_map.h" 5 #include "content/common/dom_storage/dom_storage_map.h"
6 6
7 #include "base/logging.h" 7 #include "base/logging.h"
8 8
9 namespace content {
10
9 namespace { 11 namespace {
10 12
11 size_t size_of_item(const base::string16& key, const base::string16& value) { 13 size_t size_of_item(const base::string16& key, const base::string16& value) {
12 return (key.length() + value.length()) * sizeof(char16); 14 return (key.length() + value.length()) * sizeof(char16);
13 } 15 }
14 16
15 size_t CountBytes(const dom_storage::ValuesMap& values) { 17 size_t CountBytes(const DOMStorageValuesMap& values) {
16 if (values.size() == 0) 18 if (values.size() == 0)
17 return 0; 19 return 0;
18 20
19 size_t count = 0; 21 size_t count = 0;
20 dom_storage::ValuesMap::const_iterator it = values.begin(); 22 DOMStorageValuesMap::const_iterator it = values.begin();
21 for (; it != values.end(); ++it) 23 for (; it != values.end(); ++it)
22 count += size_of_item(it->first, it->second.string()); 24 count += size_of_item(it->first, it->second.string());
23 return count; 25 return count;
24 } 26 }
25 27
26 } // namespace 28 } // namespace
27 29
28 namespace dom_storage { 30 DOMStorageMap::DOMStorageMap(size_t quota)
29
30 DomStorageMap::DomStorageMap(size_t quota)
31 : bytes_used_(0), 31 : bytes_used_(0),
32 quota_(quota) { 32 quota_(quota) {
33 ResetKeyIterator(); 33 ResetKeyIterator();
34 } 34 }
35 35
36 DomStorageMap::~DomStorageMap() {} 36 DOMStorageMap::~DOMStorageMap() {}
37 37
38 unsigned DomStorageMap::Length() const { 38 unsigned DOMStorageMap::Length() const {
39 return values_.size(); 39 return values_.size();
40 } 40 }
41 41
42 base::NullableString16 DomStorageMap::Key(unsigned index) { 42 base::NullableString16 DOMStorageMap::Key(unsigned index) {
43 if (index >= values_.size()) 43 if (index >= values_.size())
44 return base::NullableString16(); 44 return base::NullableString16();
45 while (last_key_index_ != index) { 45 while (last_key_index_ != index) {
46 if (last_key_index_ > index) { 46 if (last_key_index_ > index) {
47 --key_iterator_; 47 --key_iterator_;
48 --last_key_index_; 48 --last_key_index_;
49 } else { 49 } else {
50 ++key_iterator_; 50 ++key_iterator_;
51 ++last_key_index_; 51 ++last_key_index_;
52 } 52 }
53 } 53 }
54 return base::NullableString16(key_iterator_->first, false); 54 return base::NullableString16(key_iterator_->first, false);
55 } 55 }
56 56
57 base::NullableString16 DomStorageMap::GetItem(const base::string16& key) const { 57 base::NullableString16 DOMStorageMap::GetItem(const base::string16& key) const {
58 ValuesMap::const_iterator found = values_.find(key); 58 DOMStorageValuesMap::const_iterator found = values_.find(key);
59 if (found == values_.end()) 59 if (found == values_.end())
60 return base::NullableString16(); 60 return base::NullableString16();
61 return found->second; 61 return found->second;
62 } 62 }
63 63
64 bool DomStorageMap::SetItem( 64 bool DOMStorageMap::SetItem(
65 const base::string16& key, const base::string16& value, 65 const base::string16& key, const base::string16& value,
66 base::NullableString16* old_value) { 66 base::NullableString16* old_value) {
67 ValuesMap::const_iterator found = values_.find(key); 67 DOMStorageValuesMap::const_iterator found = values_.find(key);
68 if (found == values_.end()) 68 if (found == values_.end())
69 *old_value = base::NullableString16(); 69 *old_value = base::NullableString16();
70 else 70 else
71 *old_value = found->second; 71 *old_value = found->second;
72 72
73 size_t old_item_size = old_value->is_null() ? 73 size_t old_item_size = old_value->is_null() ?
74 0 : size_of_item(key, old_value->string()); 74 0 : size_of_item(key, old_value->string());
75 size_t new_item_size = size_of_item(key, value); 75 size_t new_item_size = size_of_item(key, value);
76 size_t new_bytes_used = bytes_used_ - old_item_size + new_item_size; 76 size_t new_bytes_used = bytes_used_ - old_item_size + new_item_size;
77 77
78 // Only check quota if the size is increasing, this allows 78 // Only check quota if the size is increasing, this allows
79 // shrinking changes to pre-existing files that are over budget. 79 // shrinking changes to pre-existing files that are over budget.
80 if (new_item_size > old_item_size && new_bytes_used > quota_) 80 if (new_item_size > old_item_size && new_bytes_used > quota_)
81 return false; 81 return false;
82 82
83 values_[key] = base::NullableString16(value, false); 83 values_[key] = base::NullableString16(value, false);
84 ResetKeyIterator(); 84 ResetKeyIterator();
85 bytes_used_ = new_bytes_used; 85 bytes_used_ = new_bytes_used;
86 return true; 86 return true;
87 } 87 }
88 88
89 bool DomStorageMap::RemoveItem( 89 bool DOMStorageMap::RemoveItem(
90 const base::string16& key, 90 const base::string16& key,
91 base::string16* old_value) { 91 base::string16* old_value) {
92 ValuesMap::iterator found = values_.find(key); 92 DOMStorageValuesMap::iterator found = values_.find(key);
93 if (found == values_.end()) 93 if (found == values_.end())
94 return false; 94 return false;
95 *old_value = found->second.string(); 95 *old_value = found->second.string();
96 values_.erase(found); 96 values_.erase(found);
97 ResetKeyIterator(); 97 ResetKeyIterator();
98 bytes_used_ -= size_of_item(key, *old_value); 98 bytes_used_ -= size_of_item(key, *old_value);
99 return true; 99 return true;
100 } 100 }
101 101
102 void DomStorageMap::SwapValues(ValuesMap* values) { 102 void DOMStorageMap::SwapValues(DOMStorageValuesMap* values) {
103 // Note: A pre-existing file may be over the quota budget. 103 // Note: A pre-existing file may be over the quota budget.
104 values_.swap(*values); 104 values_.swap(*values);
105 bytes_used_ = CountBytes(values_); 105 bytes_used_ = CountBytes(values_);
106 ResetKeyIterator(); 106 ResetKeyIterator();
107 } 107 }
108 108
109 DomStorageMap* DomStorageMap::DeepCopy() const { 109 DOMStorageMap* DOMStorageMap::DeepCopy() const {
110 DomStorageMap* copy = new DomStorageMap(quota_); 110 DOMStorageMap* copy = new DOMStorageMap(quota_);
111 copy->values_ = values_; 111 copy->values_ = values_;
112 copy->bytes_used_ = bytes_used_; 112 copy->bytes_used_ = bytes_used_;
113 copy->ResetKeyIterator(); 113 copy->ResetKeyIterator();
114 return copy; 114 return copy;
115 } 115 }
116 116
117 void DomStorageMap::ResetKeyIterator() { 117 void DOMStorageMap::ResetKeyIterator() {
118 key_iterator_ = values_.begin(); 118 key_iterator_ = values_.begin();
119 last_key_index_ = 0; 119 last_key_index_ = 0;
120 } 120 }
121 121
122 } // namespace dom_storage 122 } // namespace content
OLDNEW
« no previous file with comments | « content/common/dom_storage/dom_storage_map.h ('k') | content/common/dom_storage/dom_storage_map_unittest.cc » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698