blob: dec28eb3069729e8459eecad6214f00f17586db4 [file] [log] [blame]
Zachary Turnerbac69d32016-07-22 19:56:05 +00001//===- MappedBlockStream.cpp - Reads stream data from an MSF file ---------===//
Zachary Turner6ba65de2016-04-29 17:22:58 +00002//
3// The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9
Zachary Turnera3225b02016-07-29 20:56:36 +000010#include "llvm/DebugInfo/MSF/MappedBlockStream.h"
Eugene Zelenko2db0cfa2017-06-23 21:57:40 +000011#include "llvm/ADT/ArrayRef.h"
12#include "llvm/ADT/STLExtras.h"
Zachary Turnera3225b02016-07-29 20:56:36 +000013#include "llvm/DebugInfo/MSF/MSFCommon.h"
Zachary Turner9fb9d712017-08-02 22:31:39 +000014#include "llvm/Support/BinaryStreamWriter.h"
Eugene Zelenko2db0cfa2017-06-23 21:57:40 +000015#include "llvm/Support/Endian.h"
16#include "llvm/Support/Error.h"
17#include "llvm/Support/MathExtras.h"
18#include <algorithm>
19#include <cassert>
20#include <cstdint>
21#include <cstring>
22#include <utility>
23#include <vector>
Zachary Turner6ba65de2016-04-29 17:22:58 +000024
25using namespace llvm;
Zachary Turnerbac69d32016-07-22 19:56:05 +000026using namespace llvm::msf;
Zachary Turner6ba65de2016-04-29 17:22:58 +000027
Zachary Turnera1657a92016-06-08 17:26:39 +000028namespace {
Eugene Zelenko2db0cfa2017-06-23 21:57:40 +000029
Zachary Turnerd66889c2016-07-28 19:12:28 +000030template <typename Base> class MappedBlockStreamImpl : public Base {
Zachary Turnera1657a92016-06-08 17:26:39 +000031public:
Zachary Turnerd66889c2016-07-28 19:12:28 +000032 template <typename... Args>
33 MappedBlockStreamImpl(Args &&... Params)
34 : Base(std::forward<Args>(Params)...) {}
Zachary Turnera1657a92016-06-08 17:26:39 +000035};
Eugene Zelenko2db0cfa2017-06-23 21:57:40 +000036
37} // end anonymous namespace
Zachary Turnera1657a92016-06-08 17:26:39 +000038
Eugene Zelenko2db0cfa2017-06-23 21:57:40 +000039using Interval = std::pair<uint32_t, uint32_t>;
40
Zachary Turner5acb4ac2016-06-10 05:09:12 +000041static Interval intersect(const Interval &I1, const Interval &I2) {
42 return std::make_pair(std::max(I1.first, I2.first),
43 std::min(I1.second, I2.second));
44}
45
Zachary Turnerc4e4b7e2017-05-25 21:12:00 +000046MappedBlockStream::MappedBlockStream(uint32_t BlockSize,
Zachary Turnera3225b02016-07-29 20:56:36 +000047 const MSFStreamLayout &Layout,
Zachary Turner5b74ff32017-06-03 00:33:35 +000048 BinaryStreamRef MsfData,
49 BumpPtrAllocator &Allocator)
50 : BlockSize(BlockSize), StreamLayout(Layout), MsfData(MsfData),
51 Allocator(Allocator) {}
Zachary Turnerd66889c2016-07-28 19:12:28 +000052
Zachary Turner5b74ff32017-06-03 00:33:35 +000053std::unique_ptr<MappedBlockStream> MappedBlockStream::createStream(
54 uint32_t BlockSize, const MSFStreamLayout &Layout, BinaryStreamRef MsfData,
55 BumpPtrAllocator &Allocator) {
Zachary Turnerd66889c2016-07-28 19:12:28 +000056 return llvm::make_unique<MappedBlockStreamImpl<MappedBlockStream>>(
Zachary Turner5b74ff32017-06-03 00:33:35 +000057 BlockSize, Layout, MsfData, Allocator);
Zachary Turnerd66889c2016-07-28 19:12:28 +000058}
59
Zachary Turner120faca2017-02-27 22:11:43 +000060std::unique_ptr<MappedBlockStream> MappedBlockStream::createIndexedStream(
Zachary Turner5b74ff32017-06-03 00:33:35 +000061 const MSFLayout &Layout, BinaryStreamRef MsfData, uint32_t StreamIndex,
62 BumpPtrAllocator &Allocator) {
Bob Haarmana5b43582016-12-05 22:44:00 +000063 assert(StreamIndex < Layout.StreamMap.size() && "Invalid stream index");
Zachary Turnera3225b02016-07-29 20:56:36 +000064 MSFStreamLayout SL;
Zachary Turnerd66889c2016-07-28 19:12:28 +000065 SL.Blocks = Layout.StreamMap[StreamIndex];
66 SL.Length = Layout.StreamSizes[StreamIndex];
67 return llvm::make_unique<MappedBlockStreamImpl<MappedBlockStream>>(
Zachary Turner5b74ff32017-06-03 00:33:35 +000068 Layout.SB->BlockSize, SL, MsfData, Allocator);
Zachary Turnerd66889c2016-07-28 19:12:28 +000069}
70
71std::unique_ptr<MappedBlockStream>
Zachary Turnera3225b02016-07-29 20:56:36 +000072MappedBlockStream::createDirectoryStream(const MSFLayout &Layout,
Zachary Turner5b74ff32017-06-03 00:33:35 +000073 BinaryStreamRef MsfData,
74 BumpPtrAllocator &Allocator) {
Zachary Turnera3225b02016-07-29 20:56:36 +000075 MSFStreamLayout SL;
Zachary Turnerd66889c2016-07-28 19:12:28 +000076 SL.Blocks = Layout.DirectoryBlocks;
77 SL.Length = Layout.SB->NumDirectoryBytes;
Zachary Turner5b74ff32017-06-03 00:33:35 +000078 return createStream(Layout.SB->BlockSize, SL, MsfData, Allocator);
Zachary Turnerd66889c2016-07-28 19:12:28 +000079}
Zachary Turner6ba65de2016-04-29 17:22:58 +000080
Zachary Turner8cf51c32016-08-03 16:53:21 +000081std::unique_ptr<MappedBlockStream>
82MappedBlockStream::createFpmStream(const MSFLayout &Layout,
Zachary Turner5b74ff32017-06-03 00:33:35 +000083 BinaryStreamRef MsfData,
84 BumpPtrAllocator &Allocator) {
Zachary Turnerc3d8eec2017-08-02 22:25:52 +000085 MSFStreamLayout SL(getFpmStreamLayout(Layout));
Zachary Turner5b74ff32017-06-03 00:33:35 +000086 return createStream(Layout.SB->BlockSize, SL, MsfData, Allocator);
Zachary Turner8cf51c32016-08-03 16:53:21 +000087}
88
Zachary Turner8dbe3622016-05-27 01:54:44 +000089Error MappedBlockStream::readBytes(uint32_t Offset, uint32_t Size,
Zachary Turner120faca2017-02-27 22:11:43 +000090 ArrayRef<uint8_t> &Buffer) {
Zachary Turner8dbe3622016-05-27 01:54:44 +000091 // Make sure we aren't trying to read beyond the end of the stream.
Zachary Turner96c69852017-11-27 18:48:37 +000092 if (auto EC = checkOffsetForRead(Offset, Size))
Zachary Turnerd0b44fa2017-02-28 17:49:34 +000093 return EC;
Zachary Turner8dbe3622016-05-27 01:54:44 +000094
95 if (tryReadContiguously(Offset, Size, Buffer))
96 return Error::success();
97
98 auto CacheIter = CacheMap.find(Offset);
99 if (CacheIter != CacheMap.end()) {
Zachary Turner5acb4ac2016-06-10 05:09:12 +0000100 // Try to find an alloc that was large enough for this request.
101 for (auto &Entry : CacheIter->second) {
102 if (Entry.size() >= Size) {
103 Buffer = Entry.slice(0, Size);
104 return Error::success();
105 }
106 }
107 }
108
109 // We couldn't find a buffer that started at the correct offset (the most
110 // common scenario). Try to see if there is a buffer that starts at some
111 // other offset but overlaps the desired range.
112 for (auto &CacheItem : CacheMap) {
113 Interval RequestExtent = std::make_pair(Offset, Offset + Size);
114
115 // We already checked this one on the fast path above.
116 if (CacheItem.first == Offset)
117 continue;
118 // If the initial extent of the cached item is beyond the ending extent
119 // of the request, there is no overlap.
120 if (CacheItem.first >= Offset + Size)
121 continue;
122
123 // We really only have to check the last item in the list, since we append
124 // in order of increasing length.
125 if (CacheItem.second.empty())
126 continue;
127
128 auto CachedAlloc = CacheItem.second.back();
129 // If the initial extent of the request is beyond the ending extent of
130 // the cached item, there is no overlap.
131 Interval CachedExtent =
132 std::make_pair(CacheItem.first, CacheItem.first + CachedAlloc.size());
133 if (RequestExtent.first >= CachedExtent.first + CachedExtent.second)
134 continue;
135
136 Interval Intersection = intersect(CachedExtent, RequestExtent);
137 // Only use this if the entire request extent is contained in the cached
138 // extent.
139 if (Intersection != RequestExtent)
140 continue;
141
142 uint32_t CacheRangeOffset =
143 AbsoluteDifference(CachedExtent.first, Intersection.first);
144 Buffer = CachedAlloc.slice(CacheRangeOffset, Size);
Zachary Turner8dbe3622016-05-27 01:54:44 +0000145 return Error::success();
146 }
147
148 // Otherwise allocate a large enough buffer in the pool, memcpy the data
Zachary Turner5acb4ac2016-06-10 05:09:12 +0000149 // into it, and return an ArrayRef to that. Do not touch existing pool
150 // allocations, as existing clients may be holding a pointer which must
151 // not be invalidated.
Zachary Turner5b74ff32017-06-03 00:33:35 +0000152 uint8_t *WriteBuffer = static_cast<uint8_t *>(Allocator.Allocate(Size, 8));
Zachary Turner8dbe3622016-05-27 01:54:44 +0000153 if (auto EC = readBytes(Offset, MutableArrayRef<uint8_t>(WriteBuffer, Size)))
154 return EC;
Zachary Turner5acb4ac2016-06-10 05:09:12 +0000155
156 if (CacheIter != CacheMap.end()) {
157 CacheIter->second.emplace_back(WriteBuffer, Size);
158 } else {
159 std::vector<CacheEntry> List;
160 List.emplace_back(WriteBuffer, Size);
161 CacheMap.insert(std::make_pair(Offset, List));
162 }
Zachary Turner8dbe3622016-05-27 01:54:44 +0000163 Buffer = ArrayRef<uint8_t>(WriteBuffer, Size);
164 return Error::success();
165}
166
Zachary Turner120faca2017-02-27 22:11:43 +0000167Error MappedBlockStream::readLongestContiguousChunk(uint32_t Offset,
168 ArrayRef<uint8_t> &Buffer) {
Zachary Turner5acb4ac2016-06-10 05:09:12 +0000169 // Make sure we aren't trying to read beyond the end of the stream.
Zachary Turner96c69852017-11-27 18:48:37 +0000170 if (auto EC = checkOffsetForRead(Offset, 1))
Zachary Turnerd0b44fa2017-02-28 17:49:34 +0000171 return EC;
172
Zachary Turnerd66889c2016-07-28 19:12:28 +0000173 uint32_t First = Offset / BlockSize;
Zachary Turner5acb4ac2016-06-10 05:09:12 +0000174 uint32_t Last = First;
175
Zachary Turnerc4e4b7e2017-05-25 21:12:00 +0000176 while (Last < getNumBlocks() - 1) {
Zachary Turnerd66889c2016-07-28 19:12:28 +0000177 if (StreamLayout.Blocks[Last] != StreamLayout.Blocks[Last + 1] - 1)
Zachary Turner5acb4ac2016-06-10 05:09:12 +0000178 break;
179 ++Last;
180 }
181
Zachary Turnerd66889c2016-07-28 19:12:28 +0000182 uint32_t OffsetInFirstBlock = Offset % BlockSize;
183 uint32_t BytesFromFirstBlock = BlockSize - OffsetInFirstBlock;
Zachary Turner5acb4ac2016-06-10 05:09:12 +0000184 uint32_t BlockSpan = Last - First + 1;
Zachary Turnerd66889c2016-07-28 19:12:28 +0000185 uint32_t ByteSpan = BytesFromFirstBlock + (BlockSpan - 1) * BlockSize;
186
187 ArrayRef<uint8_t> BlockData;
188 uint32_t MsfOffset = blockToOffset(StreamLayout.Blocks[First], BlockSize);
189 if (auto EC = MsfData.readBytes(MsfOffset, BlockSize, BlockData))
190 return EC;
191
192 BlockData = BlockData.drop_front(OffsetInFirstBlock);
193 Buffer = ArrayRef<uint8_t>(BlockData.data(), ByteSpan);
Zachary Turner5acb4ac2016-06-10 05:09:12 +0000194 return Error::success();
195}
196
Zachary Turner120faca2017-02-27 22:11:43 +0000197uint32_t MappedBlockStream::getLength() { return StreamLayout.Length; }
Zachary Turnerab58ae82016-06-30 17:43:00 +0000198
Zachary Turner8dbe3622016-05-27 01:54:44 +0000199bool MappedBlockStream::tryReadContiguously(uint32_t Offset, uint32_t Size,
Zachary Turner120faca2017-02-27 22:11:43 +0000200 ArrayRef<uint8_t> &Buffer) {
Zachary Turner36efbfa2016-09-09 19:00:49 +0000201 if (Size == 0) {
202 Buffer = ArrayRef<uint8_t>();
203 return true;
204 }
Zachary Turner8dbe3622016-05-27 01:54:44 +0000205 // Attempt to fulfill the request with a reference directly into the stream.
206 // This can work even if the request crosses a block boundary, provided that
207 // all subsequent blocks are contiguous. For example, a 10k read with a 4k
208 // block size can be filled with a reference if, from the starting offset,
209 // 3 blocks in a row are contiguous.
Zachary Turnerd66889c2016-07-28 19:12:28 +0000210 uint32_t BlockNum = Offset / BlockSize;
211 uint32_t OffsetInBlock = Offset % BlockSize;
212 uint32_t BytesFromFirstBlock = std::min(Size, BlockSize - OffsetInBlock);
Zachary Turner8dbe3622016-05-27 01:54:44 +0000213 uint32_t NumAdditionalBlocks =
Eugene Zelenko2db0cfa2017-06-23 21:57:40 +0000214 alignTo(Size - BytesFromFirstBlock, BlockSize) / BlockSize;
Zachary Turner8dbe3622016-05-27 01:54:44 +0000215
216 uint32_t RequiredContiguousBlocks = NumAdditionalBlocks + 1;
Zachary Turnerd66889c2016-07-28 19:12:28 +0000217 uint32_t E = StreamLayout.Blocks[BlockNum];
Zachary Turner8dbe3622016-05-27 01:54:44 +0000218 for (uint32_t I = 0; I < RequiredContiguousBlocks; ++I, ++E) {
Zachary Turnerd66889c2016-07-28 19:12:28 +0000219 if (StreamLayout.Blocks[I + BlockNum] != E)
Zachary Turner8dbe3622016-05-27 01:54:44 +0000220 return false;
221 }
222
Zachary Turnerd66889c2016-07-28 19:12:28 +0000223 // Read out the entire block where the requested offset starts. Then drop
224 // bytes from the beginning so that the actual starting byte lines up with
225 // the requested starting byte. Then, since we know this is a contiguous
226 // cross-block span, explicitly resize the ArrayRef to cover the entire
227 // request length.
228 ArrayRef<uint8_t> BlockData;
229 uint32_t FirstBlockAddr = StreamLayout.Blocks[BlockNum];
230 uint32_t MsfOffset = blockToOffset(FirstBlockAddr, BlockSize);
231 if (auto EC = MsfData.readBytes(MsfOffset, BlockSize, BlockData)) {
232 consumeError(std::move(EC));
David Majnemer6211b1f2016-07-10 03:34:47 +0000233 return false;
234 }
Zachary Turnerd66889c2016-07-28 19:12:28 +0000235 BlockData = BlockData.drop_front(OffsetInBlock);
236 Buffer = ArrayRef<uint8_t>(BlockData.data(), Size);
Zachary Turner8dbe3622016-05-27 01:54:44 +0000237 return true;
238}
239
Zachary Turner819e77d2016-05-06 20:51:57 +0000240Error MappedBlockStream::readBytes(uint32_t Offset,
Zachary Turner120faca2017-02-27 22:11:43 +0000241 MutableArrayRef<uint8_t> Buffer) {
Zachary Turnerd66889c2016-07-28 19:12:28 +0000242 uint32_t BlockNum = Offset / BlockSize;
243 uint32_t OffsetInBlock = Offset % BlockSize;
Zachary Turner6ba65de2016-04-29 17:22:58 +0000244
245 // Make sure we aren't trying to read beyond the end of the stream.
Zachary Turner96c69852017-11-27 18:48:37 +0000246 if (auto EC = checkOffsetForRead(Offset, Buffer.size()))
Zachary Turnerd0b44fa2017-02-28 17:49:34 +0000247 return EC;
Zachary Turner6ba65de2016-04-29 17:22:58 +0000248
249 uint32_t BytesLeft = Buffer.size();
250 uint32_t BytesWritten = 0;
251 uint8_t *WriteBuffer = Buffer.data();
252 while (BytesLeft > 0) {
Zachary Turnerd66889c2016-07-28 19:12:28 +0000253 uint32_t StreamBlockAddr = StreamLayout.Blocks[BlockNum];
Zachary Turner6ba65de2016-04-29 17:22:58 +0000254
Zachary Turnerd66889c2016-07-28 19:12:28 +0000255 ArrayRef<uint8_t> BlockData;
256 uint32_t Offset = blockToOffset(StreamBlockAddr, BlockSize);
257 if (auto EC = MsfData.readBytes(Offset, BlockSize, BlockData))
258 return EC;
Zachary Turner6ba65de2016-04-29 17:22:58 +0000259
Zachary Turnerd66889c2016-07-28 19:12:28 +0000260 const uint8_t *ChunkStart = BlockData.data() + OffsetInBlock;
261 uint32_t BytesInChunk = std::min(BytesLeft, BlockSize - OffsetInBlock);
Zachary Turner6ba65de2016-04-29 17:22:58 +0000262 ::memcpy(WriteBuffer + BytesWritten, ChunkStart, BytesInChunk);
263
264 BytesWritten += BytesInChunk;
265 BytesLeft -= BytesInChunk;
266 ++BlockNum;
267 OffsetInBlock = 0;
268 }
269
Zachary Turner819e77d2016-05-06 20:51:57 +0000270 return Error::success();
Zachary Turner5acb4ac2016-06-10 05:09:12 +0000271}
Zachary Turnerf5c59652016-05-03 00:28:21 +0000272
Zachary Turnerd66889c2016-07-28 19:12:28 +0000273void MappedBlockStream::invalidateCache() { CacheMap.shrink_and_clear(); }
Zachary Turner5acb4ac2016-06-10 05:09:12 +0000274
Zachary Turnerd66889c2016-07-28 19:12:28 +0000275void MappedBlockStream::fixCacheAfterWrite(uint32_t Offset,
276 ArrayRef<uint8_t> Data) const {
Zachary Turner5acb4ac2016-06-10 05:09:12 +0000277 // If this write overlapped a read which previously came from the pool,
278 // someone may still be holding a pointer to that alloc which is now invalid.
279 // Compute the overlapping range and update the cache entry, so any
280 // outstanding buffers are automatically updated.
281 for (const auto &MapEntry : CacheMap) {
282 // If the end of the written extent precedes the beginning of the cached
283 // extent, ignore this map entry.
Zachary Turnerd66889c2016-07-28 19:12:28 +0000284 if (Offset + Data.size() < MapEntry.first)
Zachary Turner5acb4ac2016-06-10 05:09:12 +0000285 continue;
286 for (const auto &Alloc : MapEntry.second) {
287 // If the end of the cached extent precedes the beginning of the written
288 // extent, ignore this alloc.
289 if (MapEntry.first + Alloc.size() < Offset)
290 continue;
291
292 // If we get here, they are guaranteed to overlap.
Zachary Turnerd66889c2016-07-28 19:12:28 +0000293 Interval WriteInterval = std::make_pair(Offset, Offset + Data.size());
Zachary Turner5acb4ac2016-06-10 05:09:12 +0000294 Interval CachedInterval =
295 std::make_pair(MapEntry.first, MapEntry.first + Alloc.size());
296 // If they overlap, we need to write the new data into the overlapping
297 // range.
298 auto Intersection = intersect(WriteInterval, CachedInterval);
299 assert(Intersection.first <= Intersection.second);
300
301 uint32_t Length = Intersection.second - Intersection.first;
302 uint32_t SrcOffset =
303 AbsoluteDifference(WriteInterval.first, Intersection.first);
304 uint32_t DestOffset =
305 AbsoluteDifference(CachedInterval.first, Intersection.first);
Zachary Turnerd66889c2016-07-28 19:12:28 +0000306 ::memcpy(Alloc.data() + DestOffset, Data.data() + SrcOffset, Length);
Zachary Turner5acb4ac2016-06-10 05:09:12 +0000307 }
308 }
Zachary Turnerd66889c2016-07-28 19:12:28 +0000309}
310
311WritableMappedBlockStream::WritableMappedBlockStream(
Zachary Turnerc4e4b7e2017-05-25 21:12:00 +0000312 uint32_t BlockSize, const MSFStreamLayout &Layout,
Zachary Turner5b74ff32017-06-03 00:33:35 +0000313 WritableBinaryStreamRef MsfData, BumpPtrAllocator &Allocator)
314 : ReadInterface(BlockSize, Layout, MsfData, Allocator),
315 WriteInterface(MsfData) {}
Zachary Turnerd66889c2016-07-28 19:12:28 +0000316
317std::unique_ptr<WritableMappedBlockStream>
Zachary Turnerc4e4b7e2017-05-25 21:12:00 +0000318WritableMappedBlockStream::createStream(uint32_t BlockSize,
Zachary Turnera3225b02016-07-29 20:56:36 +0000319 const MSFStreamLayout &Layout,
Zachary Turner5b74ff32017-06-03 00:33:35 +0000320 WritableBinaryStreamRef MsfData,
321 BumpPtrAllocator &Allocator) {
Zachary Turnerd66889c2016-07-28 19:12:28 +0000322 return llvm::make_unique<MappedBlockStreamImpl<WritableMappedBlockStream>>(
Zachary Turner5b74ff32017-06-03 00:33:35 +0000323 BlockSize, Layout, MsfData, Allocator);
Zachary Turnerd66889c2016-07-28 19:12:28 +0000324}
325
326std::unique_ptr<WritableMappedBlockStream>
Zachary Turnera3225b02016-07-29 20:56:36 +0000327WritableMappedBlockStream::createIndexedStream(const MSFLayout &Layout,
Zachary Turner120faca2017-02-27 22:11:43 +0000328 WritableBinaryStreamRef MsfData,
Zachary Turner5b74ff32017-06-03 00:33:35 +0000329 uint32_t StreamIndex,
330 BumpPtrAllocator &Allocator) {
Bob Haarmana5b43582016-12-05 22:44:00 +0000331 assert(StreamIndex < Layout.StreamMap.size() && "Invalid stream index");
Zachary Turnera3225b02016-07-29 20:56:36 +0000332 MSFStreamLayout SL;
Zachary Turnerd66889c2016-07-28 19:12:28 +0000333 SL.Blocks = Layout.StreamMap[StreamIndex];
334 SL.Length = Layout.StreamSizes[StreamIndex];
Zachary Turner5b74ff32017-06-03 00:33:35 +0000335 return createStream(Layout.SB->BlockSize, SL, MsfData, Allocator);
Zachary Turnerd66889c2016-07-28 19:12:28 +0000336}
337
338std::unique_ptr<WritableMappedBlockStream>
339WritableMappedBlockStream::createDirectoryStream(
Zachary Turner5b74ff32017-06-03 00:33:35 +0000340 const MSFLayout &Layout, WritableBinaryStreamRef MsfData,
341 BumpPtrAllocator &Allocator) {
Zachary Turnera3225b02016-07-29 20:56:36 +0000342 MSFStreamLayout SL;
Zachary Turnerd66889c2016-07-28 19:12:28 +0000343 SL.Blocks = Layout.DirectoryBlocks;
344 SL.Length = Layout.SB->NumDirectoryBytes;
Zachary Turner5b74ff32017-06-03 00:33:35 +0000345 return createStream(Layout.SB->BlockSize, SL, MsfData, Allocator);
Zachary Turnerd66889c2016-07-28 19:12:28 +0000346}
347
Zachary Turner8cf51c32016-08-03 16:53:21 +0000348std::unique_ptr<WritableMappedBlockStream>
349WritableMappedBlockStream::createFpmStream(const MSFLayout &Layout,
Zachary Turner5b74ff32017-06-03 00:33:35 +0000350 WritableBinaryStreamRef MsfData,
Zachary Turner9fb9d712017-08-02 22:31:39 +0000351 BumpPtrAllocator &Allocator,
352 bool AltFpm) {
353 // We only want to give the user a stream containing the bytes of the FPM that
354 // are actually valid, but we want to initialize all of the bytes, even those
355 // that come from reserved FPM blocks where the entire block is unused. To do
356 // this, we first create the full layout, which gives us a stream with all
357 // bytes and all blocks, and initialize everything to 0xFF (all blocks in the
358 // file are unused). Then we create the minimal layout (which contains only a
359 // subset of the bytes previously initialized), and return that to the user.
360 MSFStreamLayout MinLayout(getFpmStreamLayout(Layout, false, AltFpm));
361
362 MSFStreamLayout FullLayout(getFpmStreamLayout(Layout, true, AltFpm));
363 auto Result =
364 createStream(Layout.SB->BlockSize, FullLayout, MsfData, Allocator);
365 if (!Result)
366 return Result;
367 std::vector<uint8_t> InitData(Layout.SB->BlockSize, 0xFF);
368 BinaryStreamWriter Initializer(*Result);
369 while (Initializer.bytesRemaining() > 0)
370 cantFail(Initializer.writeBytes(InitData));
371 return createStream(Layout.SB->BlockSize, MinLayout, MsfData, Allocator);
Zachary Turner8cf51c32016-08-03 16:53:21 +0000372}
373
Zachary Turnerd66889c2016-07-28 19:12:28 +0000374Error WritableMappedBlockStream::readBytes(uint32_t Offset, uint32_t Size,
Zachary Turner120faca2017-02-27 22:11:43 +0000375 ArrayRef<uint8_t> &Buffer) {
Zachary Turnerd66889c2016-07-28 19:12:28 +0000376 return ReadInterface.readBytes(Offset, Size, Buffer);
377}
378
379Error WritableMappedBlockStream::readLongestContiguousChunk(
Zachary Turner120faca2017-02-27 22:11:43 +0000380 uint32_t Offset, ArrayRef<uint8_t> &Buffer) {
Zachary Turnerd66889c2016-07-28 19:12:28 +0000381 return ReadInterface.readLongestContiguousChunk(Offset, Buffer);
382}
383
Zachary Turner120faca2017-02-27 22:11:43 +0000384uint32_t WritableMappedBlockStream::getLength() {
Zachary Turnerd66889c2016-07-28 19:12:28 +0000385 return ReadInterface.getLength();
386}
387
388Error WritableMappedBlockStream::writeBytes(uint32_t Offset,
Zachary Turner120faca2017-02-27 22:11:43 +0000389 ArrayRef<uint8_t> Buffer) {
Zachary Turnerd66889c2016-07-28 19:12:28 +0000390 // Make sure we aren't trying to write beyond the end of the stream.
Zachary Turner96c69852017-11-27 18:48:37 +0000391 if (auto EC = checkOffsetForWrite(Offset, Buffer.size()))
Zachary Turnerd0b44fa2017-02-28 17:49:34 +0000392 return EC;
Zachary Turnerd66889c2016-07-28 19:12:28 +0000393
394 uint32_t BlockNum = Offset / getBlockSize();
395 uint32_t OffsetInBlock = Offset % getBlockSize();
396
397 uint32_t BytesLeft = Buffer.size();
398 uint32_t BytesWritten = 0;
399 while (BytesLeft > 0) {
400 uint32_t StreamBlockAddr = getStreamLayout().Blocks[BlockNum];
401 uint32_t BytesToWriteInChunk =
402 std::min(BytesLeft, getBlockSize() - OffsetInBlock);
403
404 const uint8_t *Chunk = Buffer.data() + BytesWritten;
405 ArrayRef<uint8_t> ChunkData(Chunk, BytesToWriteInChunk);
406 uint32_t MsfOffset = blockToOffset(StreamBlockAddr, getBlockSize());
407 MsfOffset += OffsetInBlock;
408 if (auto EC = WriteInterface.writeBytes(MsfOffset, ChunkData))
409 return EC;
410
411 BytesLeft -= BytesToWriteInChunk;
412 BytesWritten += BytesToWriteInChunk;
413 ++BlockNum;
414 OffsetInBlock = 0;
415 }
416
417 ReadInterface.fixCacheAfterWrite(Offset, Buffer);
Zachary Turner5acb4ac2016-06-10 05:09:12 +0000418
419 return Error::success();
Zachary Turnerf5c59652016-05-03 00:28:21 +0000420}
Zachary Turner90b8b8d2016-05-31 22:41:52 +0000421
Zachary Turner120faca2017-02-27 22:11:43 +0000422Error WritableMappedBlockStream::commit() { return WriteInterface.commit(); }