mikros/rust
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Document the precomputation algorithm's purpose

Browse Source
This commit is contained in:
Oliver Scherer 2019-03-12 15:00:12 +01:00
parent 1ae131211b
commit 2a1eb1cef1
1 changed files with 7 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
src/librustc_mir/interpret/memory.rs
View File

@ -791,6 +791,13 @@ impl<'a, 'mir, 'tcx, M: Machine<'a, 'mir, 'tcx>> Memory<'a, 'mir, 'tcx, M> {
let undef_mask = &self.get(src.alloc_id)?.undef_mask; let undef_mask = &self.get(src.alloc_id)?.undef_mask;
// Since we are copying `size` bytes from `src` to `dest + i * size` (`for i in 0..repeat`),
// a naive undef mask copying algorithm would repeatedly have to read the undef mask from
// the source and write it to the destination. Even if we optimized the memory accesses,
// we'd be doing all of this `repeat` times.
// Therefor we precompute a compressed version of the undef mask of the source value and
// then write it back `repeat` times without computing any more information from the source.
// a precomputed cache for ranges of defined/undefined bits // a precomputed cache for ranges of defined/undefined bits
// 0000010010001110 will become // 0000010010001110 will become
// [5, 1, 2, 1, 3, 3, 1] // [5, 1, 2, 1, 3, 3, 1]