1 // -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*-
2 // vim: ts=8 sw=2 smarttab
4 #include "common/SloppyCRCMap.h"
8 void SloppyCRCMap::write(uint64_t offset, uint64_t len, const bufferlist& bl,
12 uint64_t pos = offset;
13 unsigned o = offset % block_size;
15 crc_map.erase(offset - o);
17 *out << "write invalidate " << (offset - o) << "\n";
18 pos += (block_size - o);
19 left -= (block_size - o);
21 while (left >= block_size) {
23 t.substr_of(bl, pos - offset, block_size);
24 crc_map[pos] = t.crc32c(crc_iv);
26 *out << "write set " << pos << " " << crc_map[pos] << "\n";
33 *out << "write invalidate " << pos << "\n";
37 int SloppyCRCMap::read(uint64_t offset, uint64_t len, const bufferlist& bl,
42 uint64_t pos = offset;
43 unsigned o = offset % block_size;
45 pos += (block_size - o);
46 left -= (block_size - o);
48 while (left >= block_size) {
49 // FIXME: this could be more efficient if we avoid doing a find()
51 std::map<uint64_t,uint32_t>::iterator p = crc_map.find(pos);
52 if (p != crc_map.end()) {
54 t.substr_of(bl, pos - offset, block_size);
55 uint32_t crc = t.crc32c(crc_iv);
56 if (p->second != crc) {
59 *err << "offset " << pos << " len " << block_size
60 << " has crc " << crc << " expected " << p->second << "\n";
69 void SloppyCRCMap::truncate(uint64_t offset)
71 offset -= offset % block_size;
72 std::map<uint64_t,uint32_t>::iterator p = crc_map.lower_bound(offset);
73 while (p != crc_map.end())
77 void SloppyCRCMap::zero(uint64_t offset, uint64_t len)
80 uint64_t pos = offset;
81 unsigned o = offset % block_size;
83 crc_map.erase(offset - o);
84 pos += (block_size - o);
85 left -= (block_size - o);
87 while (left >= block_size) {
88 crc_map[pos] = zero_crc;
96 void SloppyCRCMap::clone_range(uint64_t offset, uint64_t len,
97 uint64_t srcoff, const SloppyCRCMap& src,
101 uint64_t pos = offset;
102 uint64_t srcpos = srcoff;
103 unsigned o = offset % block_size;
105 crc_map.erase(offset - o);
106 pos += (block_size - o);
107 srcpos += (block_size - o);
108 left -= (block_size - o);
110 *out << "clone_range invalidate " << (offset - o) << "\n";
112 while (left >= block_size) {
113 // FIXME: this could be more efficient.
114 if (block_size == src.block_size) {
115 map<uint64_t,uint32_t>::const_iterator p = src.crc_map.find(srcpos);
116 if (p != src.crc_map.end()) {
117 crc_map[pos] = p->second;
119 *out << "clone_range copy " << pos << " " << p->second << "\n";
123 *out << "clone_range invalidate " << pos << "\n";
128 *out << "clone_range invalidate " << pos << "\n";
131 srcpos += block_size;
137 *out << "clone_range invalidate " << pos << "\n";
141 void SloppyCRCMap::encode(bufferlist& bl) const
143 ENCODE_START(1, 1, bl);
144 ::encode(block_size, bl);
145 ::encode(crc_map, bl);
149 void SloppyCRCMap::decode(bufferlist::iterator& bl)
155 ::decode(crc_map, bl);
159 void SloppyCRCMap::dump(Formatter *f) const
161 f->dump_unsigned("block_size", block_size);
162 f->open_array_section("crc_map");
163 for (map<uint64_t,uint32_t>::const_iterator p = crc_map.begin(); p != crc_map.end(); ++p) {
164 f->open_object_section("crc");
165 f->dump_unsigned("offset", p->first);
166 f->dump_unsigned("crc", p->second);
172 void SloppyCRCMap::generate_test_instances(list<SloppyCRCMap*>& ls)
174 ls.push_back(new SloppyCRCMap);
175 ls.push_back(new SloppyCRCMap(2));
177 bl.append("some data");
178 ls.back()->write(1, bl.length(), bl);
179 ls.back()->write(10, bl.length(), bl);
180 ls.back()->zero(4, 2);