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

Side by Side Diff: storage/browser/blob/blob_async_transport_strategy.cc

Issue 1098853003: [BlobAsync] Patch 4: Browser Classes & Logic. (Closed) Base URL: https://chromium.googlesource.com/chromium/src.git@master
Patch Set: comments Created 5 years, 1 month 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
OLDNEW
(Empty)
1 // Copyright 2015 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 <algorithm>
6
7 #include "storage/browser/blob/blob_async_transport_strategy.h"
8 #include "storage/common/blob_storage/blob_storage_constants.h"
9
10 namespace storage {
11 namespace {
12 bool IsBytes(DataElement::Type type) {
13 return type == DataElement::TYPE_BYTES ||
14 type == DataElement::TYPE_BYTES_DESCRIPTION;
15 }
16 } // namespace
17
18 // This class handles the logic of how transported memory is going to be
19 // represented as storage in the browser. The main idea is that all the memory
20 // is now packed into file chunks, and the browser items will just reference
21 // the file with offsets and sizes.
22 class FileStorageStrategy
23 : public BlobAsyncTransportStrategy::BlobSegmentVisitor<uint64_t> {
24 public:
25 typedef uint64_t SizeType;
26
27 FileStorageStrategy(
28 std::vector<BlobAsyncTransportStrategy::RendererMemoryItemRequest>*
29 requests,
30 BlobDataBuilder* builder)
31 : requests(requests), builder(builder), current_storage_item(0) {}
32
33 ~FileStorageStrategy() override {}
34
35 void VisitBytesSegment(size_t element_index,
36 SizeType element_offset,
37 size_t segment_index,
38 SizeType segment_offset,
39 SizeType size) override {
40 BlobAsyncTransportStrategy::RendererMemoryItemRequest request;
41 request.browser_item_index = current_storage_item;
42 request.browser_item_offset = 0;
43 request.message.request_number = requests->size();
44 request.message.transport_strategy = IPCBlobItemRequestStrategy::FILE;
45 request.message.renderer_item_index = element_index;
46 request.message.renderer_item_offset = element_offset;
47 request.message.size = size;
48 request.message.handle_index = segment_index;
49 request.message.handle_offset = segment_offset;
50
51 requests->push_back(request);
52 builder->AppendFutureFile(segment_offset, size);
53 current_storage_item++;
54 }
55
56 void VisitNonBytesSegment(const DataElement& element,
57 size_t element_index) override {
58 builder->AppendIPCDataElement(element);
59 current_storage_item++;
60 }
61
62 void Done() override {}
63
64 std::vector<BlobAsyncTransportStrategy::RendererMemoryItemRequest>* requests;
65 BlobDataBuilder* builder;
66
67 size_t current_storage_item;
68 };
69
70 // This class handles the logic of storing memory that is transported as
71 // consolidated shared memory. The main hurdle is to re-separate memory blocks
72 // that cross file or blob boundaries.
73 class SharedMemoryStorageStrategy
74 : public BlobAsyncTransportStrategy::BlobSegmentVisitor<size_t> {
75 public:
76 typedef size_t SizeType;
77
78 SharedMemoryStorageStrategy(
79 SizeType max_segment_size,
80 std::vector<BlobAsyncTransportStrategy::RendererMemoryItemRequest>*
81 requests,
82 BlobDataBuilder* builder)
83 : requests(requests),
84 max_segment_size(max_segment_size),
85 storage_element_offset(0),
86 builder(builder),
87 current_item_size(0),
88 current_storage_item(0) {}
89 ~SharedMemoryStorageStrategy() override {}
90
91 void VisitBytesSegment(size_t element_index,
92 SizeType element_offset,
93 size_t segment_index,
94 SizeType segment_offset,
95 SizeType size) override {
96 if (storage_element_offset + size > max_segment_size) {
97 builder->AppendFutureData(current_item_size);
98 current_storage_item++;
99 current_item_size = 0;
100 storage_element_offset = 0;
101 }
102 BlobAsyncTransportStrategy::RendererMemoryItemRequest request;
103 request.browser_item_index = current_storage_item;
104 request.browser_item_offset = storage_element_offset;
105 request.message.request_number = requests->size();
106 request.message.transport_strategy =
107 IPCBlobItemRequestStrategy::SHARED_MEMORY;
108 request.message.renderer_item_index = element_index;
109 request.message.renderer_item_offset = element_offset;
110 request.message.size = size;
111 request.message.handle_index = segment_index;
112 request.message.handle_offset = segment_offset;
113
114 requests->push_back(request);
115 storage_element_offset += size;
116 current_item_size += size;
117 };
118
119 void VisitNonBytesSegment(const DataElement& element,
120 size_t element_index) override {
121 builder->AppendFutureData(current_item_size);
122 current_storage_item++;
123 builder->AppendIPCDataElement(element);
124 current_storage_item++;
125 storage_element_offset = 0;
126 current_item_size = 0;
127 }
128
129 void Done() override {
130 if (current_item_size != 0) {
131 builder->AppendFutureData(current_item_size);
132 }
133 }
134
135 std::vector<BlobAsyncTransportStrategy::RendererMemoryItemRequest>* requests;
136
137 SizeType max_segment_size;
138 SizeType storage_element_offset;
139 BlobDataBuilder* builder;
140 SizeType current_item_size;
141 size_t current_storage_item;
142 };
143
144 BlobAsyncTransportStrategy::RendererMemoryItemRequest::
145 RendererMemoryItemRequest()
146 : browser_item_index(0), browser_item_offset(0), received(false) {}
147
148 BlobAsyncTransportStrategy::BlobAsyncTransportStrategy()
149 : error_(BlobAsyncTransportStrategy::ERROR_NONE), total_bytes_size_(0) {}
150
151 BlobAsyncTransportStrategy::~BlobAsyncTransportStrategy() {}
152
153 // if total_blob_size > kMaxBlobSize (say 400MB)
154 // Request all data in files
155 // (Segment all of the existing data into
156 // file blocks, of <= kMaxFileSize)
157 // else if total_blob_size > kMaxIPCSize (this is 150KB)
158 // Request all data in shared memory
159 // (Segment all of the existing data into
160 // shared memory blocks, of <= kMaxSharedMemorySize)
161 // else
162 // Request all data to be sent over IPC
163 void BlobAsyncTransportStrategy::Initialize(
164 size_t max_ipc_memory_size,
165 size_t max_shared_memory_size,
166 uint64_t max_file_size,
167 uint64_t disk_space_left,
168 size_t memory_available,
169 const std::string& uuid,
170 const std::vector<DataElement>& blob_item_infos) {
171 DCHECK(file_handle_sizes_.empty());
172 DCHECK(shared_memory_handle_sizes_.empty());
173 DCHECK(requests_.empty());
174 DCHECK(!builder_.get());
175 builder_.reset(new BlobDataBuilder(uuid));
176 error_ = BlobAsyncTransportStrategy::ERROR_NONE;
177
178 size_t memory_items = 0;
179 total_bytes_size_ = 0;
180 for (const auto& info : blob_item_infos) {
181 if (!IsBytes(info.type())) {
182 continue;
183 }
184 total_bytes_size_ += info.length();
185 ++memory_items;
186 }
187
188 // See if we have enough memory
189 if (total_bytes_size_ >
190 disk_space_left + static_cast<uint64_t>(memory_available)) {
191 error_ = BlobAsyncTransportStrategy::ERROR_TOO_LARGE;
192 return;
193 }
194
195 // If we're more than the available memory, then we're going straight to disk.
196 if (total_bytes_size_ > memory_available) {
197 if (total_bytes_size_ > disk_space_left) {
198 error_ = BlobAsyncTransportStrategy::ERROR_TOO_LARGE;
199 return;
200 }
201 ComputeHandleSizes(total_bytes_size_, max_file_size, &file_handle_sizes_);
202 FileStorageStrategy strategy(&requests_, builder_.get());
203 ForEachWithSegment(blob_item_infos, max_file_size, &strategy);
204 return;
205 }
206
207 if (total_bytes_size_ > max_ipc_memory_size) {
208 CHECK_LE(total_bytes_size_, std::numeric_limits<size_t>::max());
209 ComputeHandleSizes(static_cast<size_t>(total_bytes_size_),
210 max_shared_memory_size, &shared_memory_handle_sizes_);
211 SharedMemoryStorageStrategy strategy(max_shared_memory_size, &requests_,
212 builder_.get());
213 ForEachWithSegment(blob_item_infos, max_shared_memory_size, &strategy);
214 return;
215 }
216
217 // Since they can all fit in IPC memory, we don't need to segment anything,
218 // and just request them straight in IPC.
219 size_t items_length = blob_item_infos.size();
220 for (size_t i = 0; i < items_length; i++) {
221 const auto& info = blob_item_infos.at(i);
222 if (!IsBytes(info.type())) {
223 builder_->AppendIPCDataElement(info);
224 continue;
225 }
226 BlobAsyncTransportStrategy::RendererMemoryItemRequest request;
227 request.browser_item_index = i;
228 request.browser_item_offset = 0;
229 request.message.request_number = requests_.size();
230 request.message.transport_strategy = IPCBlobItemRequestStrategy::IPC;
231 request.message.renderer_item_index = i;
232 request.message.renderer_item_offset = 0;
233 request.message.size = info.length();
234 requests_.push_back(request);
235 builder_->AppendFutureData(info.length());
236 }
237 }
238
239 // Splits each |element| into one or more |segments| of a max_size, invokes the
240 // strategy to determine the request to make for each |segment| produced. A
241 // |segment| can also span multiple |elements|.
242 /* static */
243 template <typename SizeType>
244 void BlobAsyncTransportStrategy::ForEachWithSegment(
245 const std::vector<DataElement>& elements,
246 SizeType max_segment_size,
247 BlobSegmentVisitor<SizeType>* visitor) {
248 DCHECK_GT(max_segment_size, 0ull);
249 size_t segment_index = 0;
250 SizeType segment_offset = 0;
251 size_t elements_length = elements.size();
252 for (size_t element_index = 0; element_index < elements_length;
253 ++element_index) {
254 const auto& element = elements.at(element_index);
255 DataElement::Type type = element.type();
256 if (!IsBytes(type)) {
257 visitor->VisitNonBytesSegment(element, element_index);
258 continue;
259 }
260 SizeType element_memory_left = element.length();
261 SizeType element_offset = 0;
262 while (element_memory_left > 0) {
263 if (segment_offset == max_segment_size) {
264 ++segment_index;
265 segment_offset = 0;
266 }
267 SizeType memory_writing =
268 std::min(max_segment_size - segment_offset, element_memory_left);
269 visitor->VisitBytesSegment(element_index, element_offset, segment_index,
270 segment_offset, memory_writing);
271 element_memory_left -= memory_writing;
272 segment_offset += memory_writing;
273 element_offset += memory_writing;
274 }
275 }
276 visitor->Done();
277 }
278
279 /* static */
280 bool BlobAsyncTransportStrategy::ShouldBeShortcut(
281 const std::vector<DataElement>& elements,
282 size_t memory_available) {
283 size_t shortcut_bytes = 0;
284 for (const auto& element : elements) {
285 DataElement::Type type = element.type();
286 if (type == DataElement::TYPE_BYTES_DESCRIPTION) {
287 return false;
288 }
289 if (type == DataElement::TYPE_BYTES) {
290 shortcut_bytes += element.length();
291 }
292 }
293 return shortcut_bytes <= memory_available;
294 }
295
296 /* static */
297 template <typename SizeType>
298 void BlobAsyncTransportStrategy::ComputeHandleSizes(
299 SizeType total_memory_size,
300 SizeType max_segment_size,
301 std::vector<SizeType>* segment_sizes) {
302 size_t total_max_segments =
303 static_cast<size_t>(total_memory_size / max_segment_size);
304 bool hasExtraSegment = (total_memory_size % max_segment_size) > 0;
305 segment_sizes->reserve(total_max_segments + (hasExtraSegment ? 1 : 0));
306 segment_sizes->insert(segment_sizes->begin(), total_max_segments,
307 max_segment_size);
308 if (hasExtraSegment) {
309 segment_sizes->push_back(total_memory_size % max_segment_size);
310 }
311 }
312
313 } // namespace storage
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698