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

Use a non-allocating sort algorithm.

Browse Source 
The sort_unstable* functions are available in stable Rust now. These
functions never allocate memory.
This commit is contained in:
Jakob Stoklund Olesen
2017-10-06 09:20:39 -07:00
parent b562fdcd5c
commit d0b4c76262
1 changed files with 2 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
lib/cretonne/src/regalloc/spilling.rs
View File

@@ -356,9 +356,8 @@ impl<'a> Context<'a> {
// Leave `self.reg_uses` empty. // Leave `self.reg_uses` empty.
fn process_reg_uses(&mut self, inst: Inst, tracker: &LiveValueTracker) { fn process_reg_uses(&mut self, inst: Inst, tracker: &LiveValueTracker) {
// We're looking for multiple uses of the same value, so start by sorting by value. The // We're looking for multiple uses of the same value, so start by sorting by value. The
// secondary `opidx` key makes it possible to use an unstable sort once that is available // secondary `opidx` key makes it possible to use an unstable (non-allocating) sort.
// outside nightly Rust. self.reg_uses.sort_unstable_by_key(|u| (u.value, u.opidx));
self.reg_uses.sort_by_key(|u| (u.value, u.opidx));
for i in 0..self.reg_uses.len() { for i in 0..self.reg_uses.len() {
let ru = self.reg_uses[i]; let ru = self.reg_uses[i];