1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
|
// Copyright (c) 2012 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "base/memory/scoped_ptr.h"
#include "net/disk_cache/disk_cache_test_util.h"
#include "net/disk_cache/flash/segment.h"
#include "net/disk_cache/flash/storage.h"
#include "net/disk_cache/flash/flash_cache_test_base.h"
#include "net/disk_cache/flash/format.h"
#include "testing/gtest/include/gtest/gtest.h"
namespace {
template<int SIZE>
struct Entry {
enum { size = SIZE };
Entry() { CacheTestFillBuffer(data, size, false); }
bool operator==(const Entry& rhs) const {
return std::equal(data, data + size, rhs.data);
}
char data[size];
};
const int32 kSmallEntrySize = 100;
const int32 kLargeEntrySize = disk_cache::kFlashSegmentSize / 4;
typedef Entry<kSmallEntrySize> SmallEntry;
typedef Entry<kLargeEntrySize> LargeEntry;
const int32 kSegmentFreeSpace = disk_cache::kFlashSegmentSize -
disk_cache::kFlashSummarySize;
} // namespace
TEST_F(FlashCacheTest, SegmentUserTracking) {
disk_cache::Storage storage(path_, kStorageSize);
ASSERT_TRUE(storage.Init());
scoped_ptr<disk_cache::Segment> segment(
new disk_cache::Segment(0, false, &storage));
EXPECT_TRUE(segment->Init());
EXPECT_TRUE(segment->HasNoUsers());
segment->AddUser();
segment->AddUser();
EXPECT_FALSE(segment->HasNoUsers());
segment->ReleaseUser();
EXPECT_FALSE(segment->HasNoUsers());
segment->ReleaseUser();
EXPECT_TRUE(segment->HasNoUsers());
EXPECT_TRUE(segment->Close());
}
TEST_F(FlashCacheTest, SegmentCreateDestroy) {
disk_cache::Storage storage(path_, kStorageSize);
ASSERT_TRUE(storage.Init());
int32 index = 0;
scoped_ptr<disk_cache::Segment> segment(
new disk_cache::Segment(index, false, &storage));
EXPECT_TRUE(segment->Init());
EXPECT_TRUE(segment->Close());
index = kNumTestSegments - 1;
segment.reset(new disk_cache::Segment(index, false, &storage));
EXPECT_TRUE(segment->Init());
EXPECT_TRUE(segment->Close());
int32 invalid_index = kNumTestSegments;
segment.reset(new disk_cache::Segment(invalid_index, false, &storage));
EXPECT_FALSE(segment->Init());
invalid_index = -1;
segment.reset(new disk_cache::Segment(invalid_index, false, &storage));
EXPECT_FALSE(segment->Init());
}
TEST_F(FlashCacheTest, SegmentWriteDataReadData) {
disk_cache::Storage storage(path_, kStorageSize);
ASSERT_TRUE(storage.Init());
int32 index = rand() % kNumTestSegments;
scoped_ptr<disk_cache::Segment> segment(
new disk_cache::Segment(index, false, &storage));
EXPECT_TRUE(segment->Init());
SmallEntry entry1;
EXPECT_TRUE(segment->CanHold(entry1.size));
int32 offset = segment->write_offset();
EXPECT_TRUE(segment->WriteData(entry1.data, entry1.size));
segment->StoreOffset(offset);
EXPECT_TRUE(segment->Close());
segment.reset(new disk_cache::Segment(index, true, &storage));
EXPECT_TRUE(segment->Init());
SmallEntry entry2;
EXPECT_TRUE(segment->ReadData(entry2.data, entry2.size, offset));
EXPECT_EQ(entry1, entry2);
EXPECT_TRUE(segment->Close());
}
TEST_F(FlashCacheTest, SegmentFillWithSmallEntries) {
disk_cache::Storage storage(path_, kStorageSize);
ASSERT_TRUE(storage.Init());
int32 index = rand() % kNumTestSegments;
scoped_ptr<disk_cache::Segment> segment(
new disk_cache::Segment(index, false, &storage));
EXPECT_TRUE(segment->Init());
SmallEntry entry;
int32 num_bytes_written = 0;
while (segment->CanHold(entry.size)) {
int32 offset = segment->write_offset();
EXPECT_TRUE(segment->WriteData(entry.data, entry.size));
segment->StoreOffset(offset);
num_bytes_written += entry.size;
}
int32 space_left = kSegmentFreeSpace - num_bytes_written;
EXPECT_GE(space_left, entry.size);
EXPECT_EQ(segment->GetOffsets().size(), disk_cache::kFlashMaxEntryCount);
EXPECT_TRUE(segment->Close());
}
TEST_F(FlashCacheTest, SegmentFillWithLargeEntries) {
disk_cache::Storage storage(path_, kStorageSize);
ASSERT_TRUE(storage.Init());
int32 index = rand() % kNumTestSegments;
scoped_ptr<disk_cache::Segment> segment(
new disk_cache::Segment(index, false, &storage));
EXPECT_TRUE(segment->Init());
scoped_ptr<LargeEntry> entry(new LargeEntry);
int32 num_bytes_written = 0;
while (segment->CanHold(entry->size)) {
int32 offset = segment->write_offset();
EXPECT_TRUE(segment->WriteData(entry->data, entry->size));
segment->StoreOffset(offset);
num_bytes_written += entry->size;
}
int32 space_left = kSegmentFreeSpace - num_bytes_written;
EXPECT_LT(space_left, entry->size);
EXPECT_LT(segment->GetOffsets().size(), disk_cache::kFlashMaxEntryCount);
EXPECT_TRUE(segment->Close());
}
|
