-
Notifications
You must be signed in to change notification settings - Fork 220
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
495: Make it possible to disable parallel feature r=torkleyy a=omni-viral This makes it possible to user specs in wasm environment <!-- Reviewable:start --> --- This change is [<img src="https://reviewable.io/review_button.svg" height="34" align="absmiddle" alt="Reviewable"/>](https://reviewable.io/reviews/slide-rs/specs/495) <!-- Reviewable:end --> Co-authored-by: Zakarum <scareaangel@gmail.com>
- Loading branch information
Showing
9 changed files
with
164 additions
and
126 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
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,118 @@ | ||
|
|
||
| use std::cell::UnsafeCell; | ||
|
|
||
| use hibitset::{BitProducer, BitSetLike}; | ||
|
|
||
| use rayon::iter::plumbing::{bridge_unindexed, Folder, UnindexedConsumer, UnindexedProducer}; | ||
| use rayon::iter::ParallelIterator; | ||
| use join::Join; | ||
|
|
||
|
|
||
| /// The purpose of the `ParJoin` trait is to provide a way | ||
| /// to access multiple storages in parallel at the same time with | ||
| /// the merged bit set. | ||
| pub unsafe trait ParJoin: Join { | ||
| /// Create a joined parallel iterator over the contents. | ||
| fn par_join(self) -> JoinParIter<Self> | ||
| where | ||
| Self: Sized, | ||
| { | ||
| if <Self as Join>::is_unconstrained() { | ||
| println!("WARNING: `ParJoin` possibly iterating through all indices, you might've made a join with all `MaybeJoin`s, which is unbounded in length."); | ||
| } | ||
|
|
||
| JoinParIter(self) | ||
| } | ||
| } | ||
|
|
||
| /// `JoinParIter` is a `ParallelIterator` over a group of `Storages`. | ||
| #[must_use] | ||
| pub struct JoinParIter<J>(J); | ||
|
|
||
| impl<J> ParallelIterator for JoinParIter<J> | ||
| where | ||
| J: Join + Send, | ||
| J::Mask: Send + Sync, | ||
| J::Type: Send, | ||
| J::Value: Send, | ||
| { | ||
| type Item = J::Type; | ||
|
|
||
| fn drive_unindexed<C>(self, consumer: C) -> C::Result | ||
| where | ||
| C: UnindexedConsumer<Self::Item>, | ||
| { | ||
| let (keys, values) = unsafe { self.0.open() }; | ||
| // Create a bit producer which splits on up to three levels | ||
| let producer = BitProducer((&keys).iter(), 3); | ||
| let values = UnsafeCell::new(values); | ||
|
|
||
| bridge_unindexed(JoinProducer::<J>::new(producer, &values), consumer) | ||
| } | ||
| } | ||
|
|
||
| struct JoinProducer<'a, J> | ||
| where | ||
| J: Join + Send, | ||
| J::Mask: Send + Sync + 'a, | ||
| J::Type: Send, | ||
| J::Value: Send + 'a, | ||
| { | ||
| keys: BitProducer<'a, J::Mask>, | ||
| values: &'a UnsafeCell<J::Value>, | ||
| } | ||
|
|
||
| impl<'a, J> JoinProducer<'a, J> | ||
| where | ||
| J: Join + Send, | ||
| J::Type: Send, | ||
| J::Value: 'a + Send, | ||
| J::Mask: 'a + Send + Sync, | ||
| { | ||
| fn new(keys: BitProducer<'a, J::Mask>, values: &'a UnsafeCell<J::Value>) -> Self { | ||
| JoinProducer { keys, values } | ||
| } | ||
| } | ||
|
|
||
| unsafe impl<'a, J> Send for JoinProducer<'a, J> | ||
| where | ||
| J: Join + Send, | ||
| J::Type: Send, | ||
| J::Value: 'a + Send, | ||
| J::Mask: 'a + Send + Sync, | ||
| {} | ||
|
|
||
| impl<'a, J> UnindexedProducer for JoinProducer<'a, J> | ||
| where | ||
| J: Join + Send, | ||
| J::Type: Send, | ||
| J::Value: 'a + Send, | ||
| J::Mask: 'a + Send + Sync, | ||
| { | ||
| type Item = J::Type; | ||
| fn split(self) -> (Self, Option<Self>) { | ||
| let (cur, other) = self.keys.split(); | ||
| let values = self.values; | ||
| let first = JoinProducer::new(cur, values); | ||
| let second = other.map(|o| JoinProducer::new(o, values)); | ||
|
|
||
| (first, second) | ||
| } | ||
|
|
||
| fn fold_with<F>(self, folder: F) -> F | ||
| where | ||
| F: Folder<Self::Item>, | ||
| { | ||
| let JoinProducer { values, keys, .. } = self; | ||
| let iter = keys.0.map(|idx| unsafe { | ||
| // This unsafe block should be safe if the `J::get` | ||
| // can be safely called from different threads with distinct indices. | ||
|
|
||
| // The indices here are guaranteed to be distinct because of the fact | ||
| // that the bit set is split. | ||
| J::get(&mut *values.get(), idx) | ||
| }); | ||
|
|
||
| folder.consume_iter(iter) | ||
| } | ||
| } |
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
Oops, something went wrong.