T0b1/wasmtime
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Clarify wording in a comment.

Browse Source
This commit is contained in:
Dan Gohman
2018-07-02 22:37:40 -07:00
parent 4930ef8ba8
commit ff5660624d
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
lib/codegen/src/regalloc/liveness.rs
View File

@@ -42,9 +42,9 @@
//! This algorithm has some disadvantages that makes us look elsewhere: //! This algorithm has some disadvantages that makes us look elsewhere:
//! //!
//! - Quadratic memory use. We need a bit per variable per basic block in the function. //! - Quadratic memory use. We need a bit per variable per basic block in the function.
//! - Sparse representation. In practice, the majority of SSA values never leave their basic block, //! - Dense representation of sparse data. In practice, the majority of SSA values never leave
//! and those that do span basic blocks rarely span a large number of basic blocks. This makes //! their basic block, and those that do span basic blocks rarely span a large number of basic
//! the bit-vectors quite sparse. //! blocks. This makes the data stored in the bitvectors quite sparse.
//! - Traditionally, the data-flow equations were solved for real program *variables* which does //! - Traditionally, the data-flow equations were solved for real program *variables* which does
//! not include temporaries used in evaluating expressions. We have an SSA form program which //! not include temporaries used in evaluating expressions. We have an SSA form program which
//! blurs the distinction between temporaries and variables. This makes the quadratic memory //! blurs the distinction between temporaries and variables. This makes the quadratic memory