1d88c1a5aSDimitry Andric //===- MappedBlockStream.cpp - Reads stream data from an MSF file ---------===//
2d88c1a5aSDimitry Andric //
3d88c1a5aSDimitry Andric // The LLVM Compiler Infrastructure
4d88c1a5aSDimitry Andric //
5d88c1a5aSDimitry Andric // This file is distributed under the University of Illinois Open Source
6d88c1a5aSDimitry Andric // License. See LICENSE.TXT for details.
7d88c1a5aSDimitry Andric //
8d88c1a5aSDimitry Andric //===----------------------------------------------------------------------===//
9d88c1a5aSDimitry Andric
10d88c1a5aSDimitry Andric #include "llvm/DebugInfo/MSF/MappedBlockStream.h"
11edd7eaddSDimitry Andric #include "llvm/ADT/ArrayRef.h"
12edd7eaddSDimitry Andric #include "llvm/ADT/STLExtras.h"
13d88c1a5aSDimitry Andric #include "llvm/DebugInfo/MSF/MSFCommon.h"
14*2cab237bSDimitry Andric #include "llvm/Support/BinaryStreamWriter.h"
15edd7eaddSDimitry Andric #include "llvm/Support/Endian.h"
16edd7eaddSDimitry Andric #include "llvm/Support/Error.h"
17edd7eaddSDimitry Andric #include "llvm/Support/MathExtras.h"
18edd7eaddSDimitry Andric #include <algorithm>
19edd7eaddSDimitry Andric #include <cassert>
20edd7eaddSDimitry Andric #include <cstdint>
21edd7eaddSDimitry Andric #include <cstring>
22edd7eaddSDimitry Andric #include <utility>
23edd7eaddSDimitry Andric #include <vector>
24d88c1a5aSDimitry Andric
25d88c1a5aSDimitry Andric using namespace llvm;
26d88c1a5aSDimitry Andric using namespace llvm::msf;
27d88c1a5aSDimitry Andric
28d88c1a5aSDimitry Andric namespace {
29edd7eaddSDimitry Andric
30d88c1a5aSDimitry Andric template <typename Base> class MappedBlockStreamImpl : public Base {
31d88c1a5aSDimitry Andric public:
32d88c1a5aSDimitry Andric template <typename... Args>
MappedBlockStreamImpl(Args &&...Params)33d88c1a5aSDimitry Andric MappedBlockStreamImpl(Args &&... Params)
34d88c1a5aSDimitry Andric : Base(std::forward<Args>(Params)...) {}
35d88c1a5aSDimitry Andric };
36edd7eaddSDimitry Andric
37edd7eaddSDimitry Andric } // end anonymous namespace
38d88c1a5aSDimitry Andric
39edd7eaddSDimitry Andric using Interval = std::pair<uint32_t, uint32_t>;
40edd7eaddSDimitry Andric
intersect(const Interval & I1,const Interval & I2)41d88c1a5aSDimitry Andric static Interval intersect(const Interval &I1, const Interval &I2) {
42d88c1a5aSDimitry Andric return std::make_pair(std::max(I1.first, I2.first),
43d88c1a5aSDimitry Andric std::min(I1.second, I2.second));
44d88c1a5aSDimitry Andric }
45d88c1a5aSDimitry Andric
MappedBlockStream(uint32_t BlockSize,const MSFStreamLayout & Layout,BinaryStreamRef MsfData,BumpPtrAllocator & Allocator)46302affcbSDimitry Andric MappedBlockStream::MappedBlockStream(uint32_t BlockSize,
47d88c1a5aSDimitry Andric const MSFStreamLayout &Layout,
486d97bb29SDimitry Andric BinaryStreamRef MsfData,
496d97bb29SDimitry Andric BumpPtrAllocator &Allocator)
506d97bb29SDimitry Andric : BlockSize(BlockSize), StreamLayout(Layout), MsfData(MsfData),
516d97bb29SDimitry Andric Allocator(Allocator) {}
52d88c1a5aSDimitry Andric
createStream(uint32_t BlockSize,const MSFStreamLayout & Layout,BinaryStreamRef MsfData,BumpPtrAllocator & Allocator)536d97bb29SDimitry Andric std::unique_ptr<MappedBlockStream> MappedBlockStream::createStream(
546d97bb29SDimitry Andric uint32_t BlockSize, const MSFStreamLayout &Layout, BinaryStreamRef MsfData,
556d97bb29SDimitry Andric BumpPtrAllocator &Allocator) {
56d88c1a5aSDimitry Andric return llvm::make_unique<MappedBlockStreamImpl<MappedBlockStream>>(
576d97bb29SDimitry Andric BlockSize, Layout, MsfData, Allocator);
58d88c1a5aSDimitry Andric }
59d88c1a5aSDimitry Andric
createIndexedStream(const MSFLayout & Layout,BinaryStreamRef MsfData,uint32_t StreamIndex,BumpPtrAllocator & Allocator)607a7e6055SDimitry Andric std::unique_ptr<MappedBlockStream> MappedBlockStream::createIndexedStream(
616d97bb29SDimitry Andric const MSFLayout &Layout, BinaryStreamRef MsfData, uint32_t StreamIndex,
626d97bb29SDimitry Andric BumpPtrAllocator &Allocator) {
63d88c1a5aSDimitry Andric assert(StreamIndex < Layout.StreamMap.size() && "Invalid stream index");
64d88c1a5aSDimitry Andric MSFStreamLayout SL;
65d88c1a5aSDimitry Andric SL.Blocks = Layout.StreamMap[StreamIndex];
66d88c1a5aSDimitry Andric SL.Length = Layout.StreamSizes[StreamIndex];
67d88c1a5aSDimitry Andric return llvm::make_unique<MappedBlockStreamImpl<MappedBlockStream>>(
686d97bb29SDimitry Andric Layout.SB->BlockSize, SL, MsfData, Allocator);
69d88c1a5aSDimitry Andric }
70d88c1a5aSDimitry Andric
71d88c1a5aSDimitry Andric std::unique_ptr<MappedBlockStream>
createDirectoryStream(const MSFLayout & Layout,BinaryStreamRef MsfData,BumpPtrAllocator & Allocator)72d88c1a5aSDimitry Andric MappedBlockStream::createDirectoryStream(const MSFLayout &Layout,
736d97bb29SDimitry Andric BinaryStreamRef MsfData,
746d97bb29SDimitry Andric BumpPtrAllocator &Allocator) {
75d88c1a5aSDimitry Andric MSFStreamLayout SL;
76d88c1a5aSDimitry Andric SL.Blocks = Layout.DirectoryBlocks;
77d88c1a5aSDimitry Andric SL.Length = Layout.SB->NumDirectoryBytes;
786d97bb29SDimitry Andric return createStream(Layout.SB->BlockSize, SL, MsfData, Allocator);
79d88c1a5aSDimitry Andric }
80d88c1a5aSDimitry Andric
81d88c1a5aSDimitry Andric std::unique_ptr<MappedBlockStream>
createFpmStream(const MSFLayout & Layout,BinaryStreamRef MsfData,BumpPtrAllocator & Allocator)82d88c1a5aSDimitry Andric MappedBlockStream::createFpmStream(const MSFLayout &Layout,
836d97bb29SDimitry Andric BinaryStreamRef MsfData,
846d97bb29SDimitry Andric BumpPtrAllocator &Allocator) {
85*2cab237bSDimitry Andric MSFStreamLayout SL(getFpmStreamLayout(Layout));
866d97bb29SDimitry Andric return createStream(Layout.SB->BlockSize, SL, MsfData, Allocator);
87d88c1a5aSDimitry Andric }
88d88c1a5aSDimitry Andric
readBytes(uint32_t Offset,uint32_t Size,ArrayRef<uint8_t> & Buffer)89d88c1a5aSDimitry Andric Error MappedBlockStream::readBytes(uint32_t Offset, uint32_t Size,
907a7e6055SDimitry Andric ArrayRef<uint8_t> &Buffer) {
91d88c1a5aSDimitry Andric // Make sure we aren't trying to read beyond the end of the stream.
92*2cab237bSDimitry Andric if (auto EC = checkOffsetForRead(Offset, Size))
937a7e6055SDimitry Andric return EC;
94d88c1a5aSDimitry Andric
95d88c1a5aSDimitry Andric if (tryReadContiguously(Offset, Size, Buffer))
96d88c1a5aSDimitry Andric return Error::success();
97d88c1a5aSDimitry Andric
98d88c1a5aSDimitry Andric auto CacheIter = CacheMap.find(Offset);
99d88c1a5aSDimitry Andric if (CacheIter != CacheMap.end()) {
100d88c1a5aSDimitry Andric // Try to find an alloc that was large enough for this request.
101d88c1a5aSDimitry Andric for (auto &Entry : CacheIter->second) {
102d88c1a5aSDimitry Andric if (Entry.size() >= Size) {
103d88c1a5aSDimitry Andric Buffer = Entry.slice(0, Size);
104d88c1a5aSDimitry Andric return Error::success();
105d88c1a5aSDimitry Andric }
106d88c1a5aSDimitry Andric }
107d88c1a5aSDimitry Andric }
108d88c1a5aSDimitry Andric
109d88c1a5aSDimitry Andric // We couldn't find a buffer that started at the correct offset (the most
110d88c1a5aSDimitry Andric // common scenario). Try to see if there is a buffer that starts at some
111d88c1a5aSDimitry Andric // other offset but overlaps the desired range.
112d88c1a5aSDimitry Andric for (auto &CacheItem : CacheMap) {
113d88c1a5aSDimitry Andric Interval RequestExtent = std::make_pair(Offset, Offset + Size);
114d88c1a5aSDimitry Andric
115d88c1a5aSDimitry Andric // We already checked this one on the fast path above.
116d88c1a5aSDimitry Andric if (CacheItem.first == Offset)
117d88c1a5aSDimitry Andric continue;
118d88c1a5aSDimitry Andric // If the initial extent of the cached item is beyond the ending extent
119d88c1a5aSDimitry Andric // of the request, there is no overlap.
120d88c1a5aSDimitry Andric if (CacheItem.first >= Offset + Size)
121d88c1a5aSDimitry Andric continue;
122d88c1a5aSDimitry Andric
123d88c1a5aSDimitry Andric // We really only have to check the last item in the list, since we append
124d88c1a5aSDimitry Andric // in order of increasing length.
125d88c1a5aSDimitry Andric if (CacheItem.second.empty())
126d88c1a5aSDimitry Andric continue;
127d88c1a5aSDimitry Andric
128d88c1a5aSDimitry Andric auto CachedAlloc = CacheItem.second.back();
129d88c1a5aSDimitry Andric // If the initial extent of the request is beyond the ending extent of
130d88c1a5aSDimitry Andric // the cached item, there is no overlap.
131d88c1a5aSDimitry Andric Interval CachedExtent =
132d88c1a5aSDimitry Andric std::make_pair(CacheItem.first, CacheItem.first + CachedAlloc.size());
133d88c1a5aSDimitry Andric if (RequestExtent.first >= CachedExtent.first + CachedExtent.second)
134d88c1a5aSDimitry Andric continue;
135d88c1a5aSDimitry Andric
136d88c1a5aSDimitry Andric Interval Intersection = intersect(CachedExtent, RequestExtent);
137d88c1a5aSDimitry Andric // Only use this if the entire request extent is contained in the cached
138d88c1a5aSDimitry Andric // extent.
139d88c1a5aSDimitry Andric if (Intersection != RequestExtent)
140d88c1a5aSDimitry Andric continue;
141d88c1a5aSDimitry Andric
142d88c1a5aSDimitry Andric uint32_t CacheRangeOffset =
143d88c1a5aSDimitry Andric AbsoluteDifference(CachedExtent.first, Intersection.first);
144d88c1a5aSDimitry Andric Buffer = CachedAlloc.slice(CacheRangeOffset, Size);
145d88c1a5aSDimitry Andric return Error::success();
146d88c1a5aSDimitry Andric }
147d88c1a5aSDimitry Andric
148d88c1a5aSDimitry Andric // Otherwise allocate a large enough buffer in the pool, memcpy the data
149d88c1a5aSDimitry Andric // into it, and return an ArrayRef to that. Do not touch existing pool
150d88c1a5aSDimitry Andric // allocations, as existing clients may be holding a pointer which must
151d88c1a5aSDimitry Andric // not be invalidated.
1526d97bb29SDimitry Andric uint8_t *WriteBuffer = static_cast<uint8_t *>(Allocator.Allocate(Size, 8));
153d88c1a5aSDimitry Andric if (auto EC = readBytes(Offset, MutableArrayRef<uint8_t>(WriteBuffer, Size)))
154d88c1a5aSDimitry Andric return EC;
155d88c1a5aSDimitry Andric
156d88c1a5aSDimitry Andric if (CacheIter != CacheMap.end()) {
157d88c1a5aSDimitry Andric CacheIter->second.emplace_back(WriteBuffer, Size);
158d88c1a5aSDimitry Andric } else {
159d88c1a5aSDimitry Andric std::vector<CacheEntry> List;
160d88c1a5aSDimitry Andric List.emplace_back(WriteBuffer, Size);
161d88c1a5aSDimitry Andric CacheMap.insert(std::make_pair(Offset, List));
162d88c1a5aSDimitry Andric }
163d88c1a5aSDimitry Andric Buffer = ArrayRef<uint8_t>(WriteBuffer, Size);
164d88c1a5aSDimitry Andric return Error::success();
165d88c1a5aSDimitry Andric }
166d88c1a5aSDimitry Andric
readLongestContiguousChunk(uint32_t Offset,ArrayRef<uint8_t> & Buffer)1677a7e6055SDimitry Andric Error MappedBlockStream::readLongestContiguousChunk(uint32_t Offset,
1687a7e6055SDimitry Andric ArrayRef<uint8_t> &Buffer) {
169d88c1a5aSDimitry Andric // Make sure we aren't trying to read beyond the end of the stream.
170*2cab237bSDimitry Andric if (auto EC = checkOffsetForRead(Offset, 1))
1717a7e6055SDimitry Andric return EC;
1727a7e6055SDimitry Andric
173d88c1a5aSDimitry Andric uint32_t First = Offset / BlockSize;
174d88c1a5aSDimitry Andric uint32_t Last = First;
175d88c1a5aSDimitry Andric
176302affcbSDimitry Andric while (Last < getNumBlocks() - 1) {
177d88c1a5aSDimitry Andric if (StreamLayout.Blocks[Last] != StreamLayout.Blocks[Last + 1] - 1)
178d88c1a5aSDimitry Andric break;
179d88c1a5aSDimitry Andric ++Last;
180d88c1a5aSDimitry Andric }
181d88c1a5aSDimitry Andric
182d88c1a5aSDimitry Andric uint32_t OffsetInFirstBlock = Offset % BlockSize;
183d88c1a5aSDimitry Andric uint32_t BytesFromFirstBlock = BlockSize - OffsetInFirstBlock;
184d88c1a5aSDimitry Andric uint32_t BlockSpan = Last - First + 1;
185d88c1a5aSDimitry Andric uint32_t ByteSpan = BytesFromFirstBlock + (BlockSpan - 1) * BlockSize;
186d88c1a5aSDimitry Andric
187d88c1a5aSDimitry Andric ArrayRef<uint8_t> BlockData;
188d88c1a5aSDimitry Andric uint32_t MsfOffset = blockToOffset(StreamLayout.Blocks[First], BlockSize);
189d88c1a5aSDimitry Andric if (auto EC = MsfData.readBytes(MsfOffset, BlockSize, BlockData))
190d88c1a5aSDimitry Andric return EC;
191d88c1a5aSDimitry Andric
192d88c1a5aSDimitry Andric BlockData = BlockData.drop_front(OffsetInFirstBlock);
193d88c1a5aSDimitry Andric Buffer = ArrayRef<uint8_t>(BlockData.data(), ByteSpan);
194d88c1a5aSDimitry Andric return Error::success();
195d88c1a5aSDimitry Andric }
196d88c1a5aSDimitry Andric
getLength()1977a7e6055SDimitry Andric uint32_t MappedBlockStream::getLength() { return StreamLayout.Length; }
198d88c1a5aSDimitry Andric
tryReadContiguously(uint32_t Offset,uint32_t Size,ArrayRef<uint8_t> & Buffer)199d88c1a5aSDimitry Andric bool MappedBlockStream::tryReadContiguously(uint32_t Offset, uint32_t Size,
2007a7e6055SDimitry Andric ArrayRef<uint8_t> &Buffer) {
201d88c1a5aSDimitry Andric if (Size == 0) {
202d88c1a5aSDimitry Andric Buffer = ArrayRef<uint8_t>();
203d88c1a5aSDimitry Andric return true;
204d88c1a5aSDimitry Andric }
205d88c1a5aSDimitry Andric // Attempt to fulfill the request with a reference directly into the stream.
206d88c1a5aSDimitry Andric // This can work even if the request crosses a block boundary, provided that
207d88c1a5aSDimitry Andric // all subsequent blocks are contiguous. For example, a 10k read with a 4k
208d88c1a5aSDimitry Andric // block size can be filled with a reference if, from the starting offset,
209d88c1a5aSDimitry Andric // 3 blocks in a row are contiguous.
210d88c1a5aSDimitry Andric uint32_t BlockNum = Offset / BlockSize;
211d88c1a5aSDimitry Andric uint32_t OffsetInBlock = Offset % BlockSize;
212d88c1a5aSDimitry Andric uint32_t BytesFromFirstBlock = std::min(Size, BlockSize - OffsetInBlock);
213d88c1a5aSDimitry Andric uint32_t NumAdditionalBlocks =
214edd7eaddSDimitry Andric alignTo(Size - BytesFromFirstBlock, BlockSize) / BlockSize;
215d88c1a5aSDimitry Andric
216d88c1a5aSDimitry Andric uint32_t RequiredContiguousBlocks = NumAdditionalBlocks + 1;
217d88c1a5aSDimitry Andric uint32_t E = StreamLayout.Blocks[BlockNum];
218d88c1a5aSDimitry Andric for (uint32_t I = 0; I < RequiredContiguousBlocks; ++I, ++E) {
219d88c1a5aSDimitry Andric if (StreamLayout.Blocks[I + BlockNum] != E)
220d88c1a5aSDimitry Andric return false;
221d88c1a5aSDimitry Andric }
222d88c1a5aSDimitry Andric
223d88c1a5aSDimitry Andric // Read out the entire block where the requested offset starts. Then drop
224d88c1a5aSDimitry Andric // bytes from the beginning so that the actual starting byte lines up with
225d88c1a5aSDimitry Andric // the requested starting byte. Then, since we know this is a contiguous
226d88c1a5aSDimitry Andric // cross-block span, explicitly resize the ArrayRef to cover the entire
227d88c1a5aSDimitry Andric // request length.
228d88c1a5aSDimitry Andric ArrayRef<uint8_t> BlockData;
229d88c1a5aSDimitry Andric uint32_t FirstBlockAddr = StreamLayout.Blocks[BlockNum];
230d88c1a5aSDimitry Andric uint32_t MsfOffset = blockToOffset(FirstBlockAddr, BlockSize);
231d88c1a5aSDimitry Andric if (auto EC = MsfData.readBytes(MsfOffset, BlockSize, BlockData)) {
232d88c1a5aSDimitry Andric consumeError(std::move(EC));
233d88c1a5aSDimitry Andric return false;
234d88c1a5aSDimitry Andric }
235d88c1a5aSDimitry Andric BlockData = BlockData.drop_front(OffsetInBlock);
236d88c1a5aSDimitry Andric Buffer = ArrayRef<uint8_t>(BlockData.data(), Size);
237d88c1a5aSDimitry Andric return true;
238d88c1a5aSDimitry Andric }
239d88c1a5aSDimitry Andric
readBytes(uint32_t Offset,MutableArrayRef<uint8_t> Buffer)240d88c1a5aSDimitry Andric Error MappedBlockStream::readBytes(uint32_t Offset,
2417a7e6055SDimitry Andric MutableArrayRef<uint8_t> Buffer) {
242d88c1a5aSDimitry Andric uint32_t BlockNum = Offset / BlockSize;
243d88c1a5aSDimitry Andric uint32_t OffsetInBlock = Offset % BlockSize;
244d88c1a5aSDimitry Andric
245d88c1a5aSDimitry Andric // Make sure we aren't trying to read beyond the end of the stream.
246*2cab237bSDimitry Andric if (auto EC = checkOffsetForRead(Offset, Buffer.size()))
2477a7e6055SDimitry Andric return EC;
248d88c1a5aSDimitry Andric
249d88c1a5aSDimitry Andric uint32_t BytesLeft = Buffer.size();
250d88c1a5aSDimitry Andric uint32_t BytesWritten = 0;
251d88c1a5aSDimitry Andric uint8_t *WriteBuffer = Buffer.data();
252d88c1a5aSDimitry Andric while (BytesLeft > 0) {
253d88c1a5aSDimitry Andric uint32_t StreamBlockAddr = StreamLayout.Blocks[BlockNum];
254d88c1a5aSDimitry Andric
255d88c1a5aSDimitry Andric ArrayRef<uint8_t> BlockData;
256d88c1a5aSDimitry Andric uint32_t Offset = blockToOffset(StreamBlockAddr, BlockSize);
257d88c1a5aSDimitry Andric if (auto EC = MsfData.readBytes(Offset, BlockSize, BlockData))
258d88c1a5aSDimitry Andric return EC;
259d88c1a5aSDimitry Andric
260d88c1a5aSDimitry Andric const uint8_t *ChunkStart = BlockData.data() + OffsetInBlock;
261d88c1a5aSDimitry Andric uint32_t BytesInChunk = std::min(BytesLeft, BlockSize - OffsetInBlock);
262d88c1a5aSDimitry Andric ::memcpy(WriteBuffer + BytesWritten, ChunkStart, BytesInChunk);
263d88c1a5aSDimitry Andric
264d88c1a5aSDimitry Andric BytesWritten += BytesInChunk;
265d88c1a5aSDimitry Andric BytesLeft -= BytesInChunk;
266d88c1a5aSDimitry Andric ++BlockNum;
267d88c1a5aSDimitry Andric OffsetInBlock = 0;
268d88c1a5aSDimitry Andric }
269d88c1a5aSDimitry Andric
270d88c1a5aSDimitry Andric return Error::success();
271d88c1a5aSDimitry Andric }
272d88c1a5aSDimitry Andric
invalidateCache()273d88c1a5aSDimitry Andric void MappedBlockStream::invalidateCache() { CacheMap.shrink_and_clear(); }
274d88c1a5aSDimitry Andric
fixCacheAfterWrite(uint32_t Offset,ArrayRef<uint8_t> Data) const275d88c1a5aSDimitry Andric void MappedBlockStream::fixCacheAfterWrite(uint32_t Offset,
276d88c1a5aSDimitry Andric ArrayRef<uint8_t> Data) const {
277d88c1a5aSDimitry Andric // If this write overlapped a read which previously came from the pool,
278d88c1a5aSDimitry Andric // someone may still be holding a pointer to that alloc which is now invalid.
279d88c1a5aSDimitry Andric // Compute the overlapping range and update the cache entry, so any
280d88c1a5aSDimitry Andric // outstanding buffers are automatically updated.
281d88c1a5aSDimitry Andric for (const auto &MapEntry : CacheMap) {
282d88c1a5aSDimitry Andric // If the end of the written extent precedes the beginning of the cached
283d88c1a5aSDimitry Andric // extent, ignore this map entry.
284d88c1a5aSDimitry Andric if (Offset + Data.size() < MapEntry.first)
285d88c1a5aSDimitry Andric continue;
286d88c1a5aSDimitry Andric for (const auto &Alloc : MapEntry.second) {
287d88c1a5aSDimitry Andric // If the end of the cached extent precedes the beginning of the written
288d88c1a5aSDimitry Andric // extent, ignore this alloc.
289d88c1a5aSDimitry Andric if (MapEntry.first + Alloc.size() < Offset)
290d88c1a5aSDimitry Andric continue;
291d88c1a5aSDimitry Andric
292d88c1a5aSDimitry Andric // If we get here, they are guaranteed to overlap.
293d88c1a5aSDimitry Andric Interval WriteInterval = std::make_pair(Offset, Offset + Data.size());
294d88c1a5aSDimitry Andric Interval CachedInterval =
295d88c1a5aSDimitry Andric std::make_pair(MapEntry.first, MapEntry.first + Alloc.size());
296d88c1a5aSDimitry Andric // If they overlap, we need to write the new data into the overlapping
297d88c1a5aSDimitry Andric // range.
298d88c1a5aSDimitry Andric auto Intersection = intersect(WriteInterval, CachedInterval);
299d88c1a5aSDimitry Andric assert(Intersection.first <= Intersection.second);
300d88c1a5aSDimitry Andric
301d88c1a5aSDimitry Andric uint32_t Length = Intersection.second - Intersection.first;
302d88c1a5aSDimitry Andric uint32_t SrcOffset =
303d88c1a5aSDimitry Andric AbsoluteDifference(WriteInterval.first, Intersection.first);
304d88c1a5aSDimitry Andric uint32_t DestOffset =
305d88c1a5aSDimitry Andric AbsoluteDifference(CachedInterval.first, Intersection.first);
306d88c1a5aSDimitry Andric ::memcpy(Alloc.data() + DestOffset, Data.data() + SrcOffset, Length);
307d88c1a5aSDimitry Andric }
308d88c1a5aSDimitry Andric }
309d88c1a5aSDimitry Andric }
310d88c1a5aSDimitry Andric
WritableMappedBlockStream(uint32_t BlockSize,const MSFStreamLayout & Layout,WritableBinaryStreamRef MsfData,BumpPtrAllocator & Allocator)311d88c1a5aSDimitry Andric WritableMappedBlockStream::WritableMappedBlockStream(
312302affcbSDimitry Andric uint32_t BlockSize, const MSFStreamLayout &Layout,
3136d97bb29SDimitry Andric WritableBinaryStreamRef MsfData, BumpPtrAllocator &Allocator)
3146d97bb29SDimitry Andric : ReadInterface(BlockSize, Layout, MsfData, Allocator),
3156d97bb29SDimitry Andric WriteInterface(MsfData) {}
316d88c1a5aSDimitry Andric
317d88c1a5aSDimitry Andric std::unique_ptr<WritableMappedBlockStream>
createStream(uint32_t BlockSize,const MSFStreamLayout & Layout,WritableBinaryStreamRef MsfData,BumpPtrAllocator & Allocator)318302affcbSDimitry Andric WritableMappedBlockStream::createStream(uint32_t BlockSize,
319d88c1a5aSDimitry Andric const MSFStreamLayout &Layout,
3206d97bb29SDimitry Andric WritableBinaryStreamRef MsfData,
3216d97bb29SDimitry Andric BumpPtrAllocator &Allocator) {
322d88c1a5aSDimitry Andric return llvm::make_unique<MappedBlockStreamImpl<WritableMappedBlockStream>>(
3236d97bb29SDimitry Andric BlockSize, Layout, MsfData, Allocator);
324d88c1a5aSDimitry Andric }
325d88c1a5aSDimitry Andric
326d88c1a5aSDimitry Andric std::unique_ptr<WritableMappedBlockStream>
createIndexedStream(const MSFLayout & Layout,WritableBinaryStreamRef MsfData,uint32_t StreamIndex,BumpPtrAllocator & Allocator)327d88c1a5aSDimitry Andric WritableMappedBlockStream::createIndexedStream(const MSFLayout &Layout,
3287a7e6055SDimitry Andric WritableBinaryStreamRef MsfData,
3296d97bb29SDimitry Andric uint32_t StreamIndex,
3306d97bb29SDimitry Andric BumpPtrAllocator &Allocator) {
331d88c1a5aSDimitry Andric assert(StreamIndex < Layout.StreamMap.size() && "Invalid stream index");
332d88c1a5aSDimitry Andric MSFStreamLayout SL;
333d88c1a5aSDimitry Andric SL.Blocks = Layout.StreamMap[StreamIndex];
334d88c1a5aSDimitry Andric SL.Length = Layout.StreamSizes[StreamIndex];
3356d97bb29SDimitry Andric return createStream(Layout.SB->BlockSize, SL, MsfData, Allocator);
336d88c1a5aSDimitry Andric }
337d88c1a5aSDimitry Andric
338d88c1a5aSDimitry Andric std::unique_ptr<WritableMappedBlockStream>
createDirectoryStream(const MSFLayout & Layout,WritableBinaryStreamRef MsfData,BumpPtrAllocator & Allocator)339d88c1a5aSDimitry Andric WritableMappedBlockStream::createDirectoryStream(
3406d97bb29SDimitry Andric const MSFLayout &Layout, WritableBinaryStreamRef MsfData,
3416d97bb29SDimitry Andric BumpPtrAllocator &Allocator) {
342d88c1a5aSDimitry Andric MSFStreamLayout SL;
343d88c1a5aSDimitry Andric SL.Blocks = Layout.DirectoryBlocks;
344d88c1a5aSDimitry Andric SL.Length = Layout.SB->NumDirectoryBytes;
3456d97bb29SDimitry Andric return createStream(Layout.SB->BlockSize, SL, MsfData, Allocator);
346d88c1a5aSDimitry Andric }
347d88c1a5aSDimitry Andric
348d88c1a5aSDimitry Andric std::unique_ptr<WritableMappedBlockStream>
createFpmStream(const MSFLayout & Layout,WritableBinaryStreamRef MsfData,BumpPtrAllocator & Allocator,bool AltFpm)349d88c1a5aSDimitry Andric WritableMappedBlockStream::createFpmStream(const MSFLayout &Layout,
3506d97bb29SDimitry Andric WritableBinaryStreamRef MsfData,
351*2cab237bSDimitry Andric BumpPtrAllocator &Allocator,
352*2cab237bSDimitry Andric bool AltFpm) {
353*2cab237bSDimitry Andric // We only want to give the user a stream containing the bytes of the FPM that
354*2cab237bSDimitry Andric // are actually valid, but we want to initialize all of the bytes, even those
355*2cab237bSDimitry Andric // that come from reserved FPM blocks where the entire block is unused. To do
356*2cab237bSDimitry Andric // this, we first create the full layout, which gives us a stream with all
357*2cab237bSDimitry Andric // bytes and all blocks, and initialize everything to 0xFF (all blocks in the
358*2cab237bSDimitry Andric // file are unused). Then we create the minimal layout (which contains only a
359*2cab237bSDimitry Andric // subset of the bytes previously initialized), and return that to the user.
360*2cab237bSDimitry Andric MSFStreamLayout MinLayout(getFpmStreamLayout(Layout, false, AltFpm));
361*2cab237bSDimitry Andric
362*2cab237bSDimitry Andric MSFStreamLayout FullLayout(getFpmStreamLayout(Layout, true, AltFpm));
363*2cab237bSDimitry Andric auto Result =
364*2cab237bSDimitry Andric createStream(Layout.SB->BlockSize, FullLayout, MsfData, Allocator);
365*2cab237bSDimitry Andric if (!Result)
366*2cab237bSDimitry Andric return Result;
367*2cab237bSDimitry Andric std::vector<uint8_t> InitData(Layout.SB->BlockSize, 0xFF);
368*2cab237bSDimitry Andric BinaryStreamWriter Initializer(*Result);
369*2cab237bSDimitry Andric while (Initializer.bytesRemaining() > 0)
370*2cab237bSDimitry Andric cantFail(Initializer.writeBytes(InitData));
371*2cab237bSDimitry Andric return createStream(Layout.SB->BlockSize, MinLayout, MsfData, Allocator);
372d88c1a5aSDimitry Andric }
373d88c1a5aSDimitry Andric
readBytes(uint32_t Offset,uint32_t Size,ArrayRef<uint8_t> & Buffer)374d88c1a5aSDimitry Andric Error WritableMappedBlockStream::readBytes(uint32_t Offset, uint32_t Size,
3757a7e6055SDimitry Andric ArrayRef<uint8_t> &Buffer) {
376d88c1a5aSDimitry Andric return ReadInterface.readBytes(Offset, Size, Buffer);
377d88c1a5aSDimitry Andric }
378d88c1a5aSDimitry Andric
readLongestContiguousChunk(uint32_t Offset,ArrayRef<uint8_t> & Buffer)379d88c1a5aSDimitry Andric Error WritableMappedBlockStream::readLongestContiguousChunk(
3807a7e6055SDimitry Andric uint32_t Offset, ArrayRef<uint8_t> &Buffer) {
381d88c1a5aSDimitry Andric return ReadInterface.readLongestContiguousChunk(Offset, Buffer);
382d88c1a5aSDimitry Andric }
383d88c1a5aSDimitry Andric
getLength()3847a7e6055SDimitry Andric uint32_t WritableMappedBlockStream::getLength() {
385d88c1a5aSDimitry Andric return ReadInterface.getLength();
386d88c1a5aSDimitry Andric }
387d88c1a5aSDimitry Andric
writeBytes(uint32_t Offset,ArrayRef<uint8_t> Buffer)388d88c1a5aSDimitry Andric Error WritableMappedBlockStream::writeBytes(uint32_t Offset,
3897a7e6055SDimitry Andric ArrayRef<uint8_t> Buffer) {
390d88c1a5aSDimitry Andric // Make sure we aren't trying to write beyond the end of the stream.
391*2cab237bSDimitry Andric if (auto EC = checkOffsetForWrite(Offset, Buffer.size()))
3927a7e6055SDimitry Andric return EC;
393d88c1a5aSDimitry Andric
394d88c1a5aSDimitry Andric uint32_t BlockNum = Offset / getBlockSize();
395d88c1a5aSDimitry Andric uint32_t OffsetInBlock = Offset % getBlockSize();
396d88c1a5aSDimitry Andric
397d88c1a5aSDimitry Andric uint32_t BytesLeft = Buffer.size();
398d88c1a5aSDimitry Andric uint32_t BytesWritten = 0;
399d88c1a5aSDimitry Andric while (BytesLeft > 0) {
400d88c1a5aSDimitry Andric uint32_t StreamBlockAddr = getStreamLayout().Blocks[BlockNum];
401d88c1a5aSDimitry Andric uint32_t BytesToWriteInChunk =
402d88c1a5aSDimitry Andric std::min(BytesLeft, getBlockSize() - OffsetInBlock);
403d88c1a5aSDimitry Andric
404d88c1a5aSDimitry Andric const uint8_t *Chunk = Buffer.data() + BytesWritten;
405d88c1a5aSDimitry Andric ArrayRef<uint8_t> ChunkData(Chunk, BytesToWriteInChunk);
406d88c1a5aSDimitry Andric uint32_t MsfOffset = blockToOffset(StreamBlockAddr, getBlockSize());
407d88c1a5aSDimitry Andric MsfOffset += OffsetInBlock;
408d88c1a5aSDimitry Andric if (auto EC = WriteInterface.writeBytes(MsfOffset, ChunkData))
409d88c1a5aSDimitry Andric return EC;
410d88c1a5aSDimitry Andric
411d88c1a5aSDimitry Andric BytesLeft -= BytesToWriteInChunk;
412d88c1a5aSDimitry Andric BytesWritten += BytesToWriteInChunk;
413d88c1a5aSDimitry Andric ++BlockNum;
414d88c1a5aSDimitry Andric OffsetInBlock = 0;
415d88c1a5aSDimitry Andric }
416d88c1a5aSDimitry Andric
417d88c1a5aSDimitry Andric ReadInterface.fixCacheAfterWrite(Offset, Buffer);
418d88c1a5aSDimitry Andric
419d88c1a5aSDimitry Andric return Error::success();
420d88c1a5aSDimitry Andric }
421d88c1a5aSDimitry Andric
commit()4227a7e6055SDimitry Andric Error WritableMappedBlockStream::commit() { return WriteInterface.commit(); }
423