OLD | NEW |
(Empty) | |
| 1 // Copyright 2016 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 "storage/browser/blob/blob_slice.h" |
| 6 |
| 7 #include <memory> |
| 8 |
| 9 #include "storage/browser/blob/blob_data_item.h" |
| 10 #include "storage/browser/blob/internal_blob_data.h" |
| 11 #include "storage/browser/blob/shareable_blob_data_item.h" |
| 12 #include "storage/common/data_element.h" |
| 13 #include "testing/gtest/include/gtest/gtest.h" |
| 14 |
| 15 namespace storage { |
| 16 namespace { |
| 17 |
| 18 void ExpectFirstSlice(const BlobSlice& slice, |
| 19 scoped_refptr<ShareableBlobDataItem> source_item, |
| 20 size_t first_item_slice_offset, |
| 21 size_t size) { |
| 22 EXPECT_TRUE(slice.has_sliced_first_memory_item); |
| 23 EXPECT_EQ(first_item_slice_offset, slice.first_item_slice_offset); |
| 24 |
| 25 ASSERT_LE(1u, slice.dest_items.size()); |
| 26 const DataElement& dest_element = slice.dest_items[0]->item()->data_element(); |
| 27 |
| 28 EXPECT_EQ(DataElement::TYPE_BYTES_DESCRIPTION, dest_element.type()); |
| 29 EXPECT_EQ(static_cast<uint64_t>(size), dest_element.length()); |
| 30 |
| 31 EXPECT_EQ(*source_item, *slice.first_source_item); |
| 32 } |
| 33 |
| 34 void ExpectLastSlice(const BlobSlice& slice, |
| 35 scoped_refptr<ShareableBlobDataItem> source_item, |
| 36 size_t size) { |
| 37 EXPECT_TRUE(slice.has_sliced_last_memory_item); |
| 38 |
| 39 ASSERT_LE(2u, slice.dest_items.size()); |
| 40 const DataElement& dest_element = |
| 41 slice.dest_items.back()->item()->data_element(); |
| 42 |
| 43 EXPECT_EQ(DataElement::TYPE_BYTES_DESCRIPTION, dest_element.type()); |
| 44 EXPECT_EQ(static_cast<uint64_t>(size), dest_element.length()); |
| 45 |
| 46 EXPECT_EQ(*source_item, *slice.last_source_item); |
| 47 } |
| 48 |
| 49 scoped_refptr<ShareableBlobDataItem> CreateDataItem(size_t size) { |
| 50 std::unique_ptr<DataElement> element(new DataElement()); |
| 51 element->SetToAllocatedBytes(size); |
| 52 for (size_t i = 0; i < size; i++) { |
| 53 *(element->mutable_bytes() + i) = i; |
| 54 } |
| 55 return scoped_refptr<ShareableBlobDataItem>( |
| 56 new ShareableBlobDataItem(new BlobDataItem(std::move(element)))); |
| 57 }; |
| 58 |
| 59 scoped_refptr<ShareableBlobDataItem> CreateFileItem(size_t offset, |
| 60 size_t size) { |
| 61 std::unique_ptr<DataElement> element(new DataElement()); |
| 62 element->SetToFilePathRange(base::FilePath("kFakePath"), offset, size, |
| 63 base::Time::Max()); |
| 64 return scoped_refptr<ShareableBlobDataItem>( |
| 65 new ShareableBlobDataItem(new BlobDataItem(std::move(element)))); |
| 66 }; |
| 67 |
| 68 TEST(BlobSlice, FullItem) { |
| 69 const std::string kBlobUUID = "kId"; |
| 70 const size_t kSize = 5u; |
| 71 |
| 72 InternalBlobData data; |
| 73 scoped_refptr<ShareableBlobDataItem> item = CreateDataItem(kSize); |
| 74 data.AppendSharedBlobItem(kBlobUUID, item); |
| 75 |
| 76 BlobSlice slice(data, 0, 5); |
| 77 EXPECT_EQ(0u, slice.copying_memory_size); |
| 78 EXPECT_FALSE(slice.has_sliced_first_memory_item); |
| 79 EXPECT_FALSE(slice.has_sliced_last_memory_item); |
| 80 EXPECT_FALSE(slice.first_source_item); |
| 81 EXPECT_FALSE(slice.last_source_item); |
| 82 ASSERT_EQ(1u, slice.dest_items.size()); |
| 83 EXPECT_EQ(item, slice.dest_items[0]); |
| 84 } |
| 85 |
| 86 TEST(BlobSlice, SliceSingleItem) { |
| 87 const std::string kBlobUUID = "kId"; |
| 88 const size_t kSize = 5u; |
| 89 |
| 90 InternalBlobData data; |
| 91 scoped_refptr<ShareableBlobDataItem> item = CreateDataItem(kSize); |
| 92 data.AppendSharedBlobItem(kBlobUUID, item); |
| 93 |
| 94 BlobSlice slice(data, 1, 3); |
| 95 EXPECT_EQ(3u, slice.copying_memory_size); |
| 96 EXPECT_FALSE(slice.has_sliced_last_memory_item); |
| 97 ExpectFirstSlice(slice, item, 1, 3); |
| 98 ASSERT_EQ(1u, slice.dest_items.size()); |
| 99 } |
| 100 |
| 101 TEST(BlobSlice, SliceSingleLastItem) { |
| 102 const std::string kBlobUUID = "kId"; |
| 103 const size_t kSize1 = 5u; |
| 104 const size_t kSize2 = 10u; |
| 105 |
| 106 InternalBlobData data; |
| 107 scoped_refptr<ShareableBlobDataItem> item1 = CreateDataItem(kSize1); |
| 108 scoped_refptr<ShareableBlobDataItem> item2 = CreateDataItem(kSize2); |
| 109 data.AppendSharedBlobItem(kBlobUUID, item1); |
| 110 data.AppendSharedBlobItem(kBlobUUID, item2); |
| 111 |
| 112 BlobSlice slice(data, 6, 2); |
| 113 EXPECT_EQ(2u, slice.copying_memory_size); |
| 114 ExpectFirstSlice(slice, item2, 1, 2); |
| 115 ASSERT_EQ(1u, slice.dest_items.size()); |
| 116 } |
| 117 |
| 118 TEST(BlobSlice, SliceAcrossTwoItems) { |
| 119 const std::string kBlobUUID = "kId"; |
| 120 const size_t kSize1 = 5u; |
| 121 const size_t kSize2 = 10u; |
| 122 |
| 123 InternalBlobData data; |
| 124 scoped_refptr<ShareableBlobDataItem> item1 = CreateDataItem(kSize1); |
| 125 scoped_refptr<ShareableBlobDataItem> item2 = CreateDataItem(kSize2); |
| 126 data.AppendSharedBlobItem(kBlobUUID, item1); |
| 127 data.AppendSharedBlobItem(kBlobUUID, item2); |
| 128 |
| 129 BlobSlice slice(data, 4, 10); |
| 130 EXPECT_EQ(10u, slice.copying_memory_size); |
| 131 ExpectFirstSlice(slice, item1, 4, 1); |
| 132 ExpectLastSlice(slice, item2, 9); |
| 133 ASSERT_EQ(2u, slice.dest_items.size()); |
| 134 } |
| 135 |
| 136 TEST(BlobSlice, SliceFileAndLastItem) { |
| 137 const std::string kBlobUUID = "kId"; |
| 138 const size_t kSize1 = 5u; |
| 139 const size_t kSize2 = 10u; |
| 140 |
| 141 InternalBlobData data; |
| 142 scoped_refptr<ShareableBlobDataItem> item1 = CreateFileItem(0u, kSize1); |
| 143 scoped_refptr<ShareableBlobDataItem> item2 = CreateDataItem(kSize2); |
| 144 data.AppendSharedBlobItem(kBlobUUID, item1); |
| 145 data.AppendSharedBlobItem(kBlobUUID, item2); |
| 146 |
| 147 BlobSlice slice(data, 4, 2); |
| 148 EXPECT_EQ(1u, slice.copying_memory_size); |
| 149 EXPECT_FALSE(slice.has_sliced_first_memory_item); |
| 150 ExpectLastSlice(slice, item2, 1); |
| 151 ASSERT_EQ(2u, slice.dest_items.size()); |
| 152 |
| 153 EXPECT_EQ(*CreateFileItem(4u, 1u)->item(), *slice.dest_items[0]->item()); |
| 154 } |
| 155 |
| 156 TEST(BlobSlice, SliceAcrossLargeItem) { |
| 157 const std::string kBlobUUID = "kId"; |
| 158 const size_t kSize1 = 5u; |
| 159 const size_t kSize2 = 10u; |
| 160 const size_t kSize3 = 10u; |
| 161 |
| 162 InternalBlobData data; |
| 163 scoped_refptr<ShareableBlobDataItem> item1 = CreateDataItem(kSize1); |
| 164 scoped_refptr<ShareableBlobDataItem> item2 = CreateFileItem(0u, kSize2); |
| 165 scoped_refptr<ShareableBlobDataItem> item3 = CreateDataItem(kSize3); |
| 166 data.AppendSharedBlobItem(kBlobUUID, item1); |
| 167 data.AppendSharedBlobItem(kBlobUUID, item2); |
| 168 data.AppendSharedBlobItem(kBlobUUID, item3); |
| 169 |
| 170 BlobSlice slice(data, 2, 20); |
| 171 EXPECT_EQ(3u + 7u, slice.copying_memory_size); |
| 172 ExpectFirstSlice(slice, item1, 2, 3); |
| 173 ExpectLastSlice(slice, item3, 7); |
| 174 ASSERT_EQ(3u, slice.dest_items.size()); |
| 175 |
| 176 EXPECT_EQ(*item2, *slice.dest_items[1]); |
| 177 } |
| 178 |
| 179 } // namespace |
| 180 } // namespace storage |
OLD | NEW |