-
Notifications
You must be signed in to change notification settings - Fork 12.6k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Auto merge of #51896 - nikomatsakis:nll-liveness-dirty-list, r=Zoxc
introduce dirty list to liveness, eliminate `ins` vector At least in my measurements, this seems to knock much of the liveness computation off the profile. r? @Zoxc cc @nnethercote
- Loading branch information
Showing
10 changed files
with
120 additions
and
39 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,72 @@ | ||
// Copyright 2016 The Rust Project Developers. See the COPYRIGHT | ||
// file at the top-level directory of this distribution and at | ||
// http://rust-lang.org/COPYRIGHT. | ||
// | ||
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or | ||
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license | ||
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your | ||
// option. This file may not be copied, modified, or distributed | ||
// except according to those terms. | ||
|
||
use indexed_set::IdxSetBuf; | ||
use indexed_vec::Idx; | ||
use std::collections::VecDeque; | ||
|
||
/// A work queue is a handy data structure for tracking work left to | ||
/// do. (For example, basic blocks left to process.) It is basically a | ||
/// de-duplicating queue; so attempting to insert X if X is already | ||
/// enqueued has no effect. This implementation assumes that the | ||
/// elements are dense indices, so it can allocate the queue to size | ||
/// and also use a bit set to track occupancy. | ||
pub struct WorkQueue<T: Idx> { | ||
deque: VecDeque<T>, | ||
set: IdxSetBuf<T>, | ||
} | ||
|
||
impl<T: Idx> WorkQueue<T> { | ||
/// Create a new work queue with all the elements from (0..len). | ||
#[inline] | ||
pub fn with_all(len: usize) -> Self { | ||
WorkQueue { | ||
deque: (0..len).map(T::new).collect(), | ||
set: IdxSetBuf::new_filled(len), | ||
} | ||
} | ||
|
||
/// Create a new work queue that starts empty, where elements range from (0..len). | ||
#[inline] | ||
pub fn with_none(len: usize) -> Self { | ||
WorkQueue { | ||
deque: VecDeque::with_capacity(len), | ||
set: IdxSetBuf::new_empty(len), | ||
} | ||
} | ||
|
||
/// Attempt to enqueue `element` in the work queue. Returns false if it was already present. | ||
#[inline] | ||
pub fn insert(&mut self, element: T) -> bool { | ||
if self.set.add(&element) { | ||
self.deque.push_back(element); | ||
true | ||
} else { | ||
false | ||
} | ||
} | ||
|
||
/// Attempt to enqueue `element` in the work queue. Returns false if it was already present. | ||
#[inline] | ||
pub fn pop(&mut self) -> Option<T> { | ||
if let Some(element) = self.deque.pop_front() { | ||
self.set.remove(&element); | ||
Some(element) | ||
} else { | ||
None | ||
} | ||
} | ||
|
||
/// True if nothing is enqueued. | ||
#[inline] | ||
pub fn is_empty(&self) -> bool { | ||
self.deque.is_empty() | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters