robert/another-boids-in-rust
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Vendor dependencies for 0.3.0 release

Browse Source
This commit is contained in:
Robert Garrett
2025-09-27 10:29:08 -05:00
parent 0c8d39d483
commit 82ab7f317b
26803 changed files with 16134934 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
vendor/parking/.cargo-checksum.json vendored Normal file
View File

@@ -0,0 +1 @@
{"files":{"CHANGELOG.md":"cde9fe20ea7d438e13aa08a82be3b47f851cf59ca526c4d3bc755e2e5acba95e","Cargo.toml":"06994b8edc975b1af488f385bafc91f3c6c4c79394fc2d2e662cc8f05dd786dd","LICENSE-APACHE":"a60eea817514531668d7e00765731449fe14d059d3249e0bc93b36de45f759f2","LICENSE-MIT":"23f18e03dc49df91622fe2a76176497404e46ced8a715d9d2b67a7446571cca3","LICENSE-THIRD-PARTY":"9a6d7a3c1b8edcc706c4b6c37f8dae9a77f02c7f9051df603f975db136b55419","README.md":"c2d29c2e898bc73cfece19b7ce7fe1763f6e1f1471f89376ae28043ad4c0bd3f","src/lib.rs":"775370db46257b33510128938c6693dac2ccf9f27a472e503967b1d1ae18461d","tests/loom.rs":"e13cbefd9e838a0010c555f1c4c5a9917b75c6c9518f45f0ebe138f5e7d5f968","tests/parking.rs":"63fafaf40f613bdcadf3fd5238ae72ce00cd7540f05d77888c7ae0d362eadc52"},"package":"f38d5652c16fde515bb1ecef450ab0f6a219d619a7274976324d5e377f7dceba"}

47
vendor/parking/CHANGELOG.md vendored Normal file
View File

@@ -0,0 +1,47 @@
# Version 2.2.1
- Specify the reason for using `parking` in the docs. (#25)
# Version 2.2.0
- Implement `From<Unparker>` for `Waker`. This enables `Waker`s to be constructed from `Unparker`s without allocating. (#18)
# Version 2.1.1
- Update docs with new logo. (#14)
# Version 2.1.0
- Add will_unpark and same_parker methods to Unparker. (#10)
# Version 2.0.0
- Return `bool` from `unpark()` methods.
# Version 1.0.6
- Add more details on licensing.
# Version 1.0.5
- Implement `Default` for `Parker`.
# Version 1.0.4
- Forbid unsafe code.
# Version 1.0.3
- Improved documentation.
# Version 1.0.2
- Remove all unsafe code.
# Version 1.0.1
- Explain `Parker::park()` better.
# Version 1.0.0
- Initial version.

59
vendor/parking/Cargo.toml vendored Normal file
View File

@@ -0,0 +1,59 @@
# THIS FILE IS AUTOMATICALLY GENERATED BY CARGO
#
# When uploading crates to the registry Cargo will automatically
# "normalize" Cargo.toml files for maximal compatibility
# with all versions of Cargo and also rewrite `path` dependencies
# to registry (e.g., crates.io) dependencies.
#
# If you are reading this file be aware that the original Cargo.toml
# will likely look very different (and much more reasonable).
# See Cargo.toml.orig for the original contents.
[package]
edition = "2018"
rust-version = "1.51"
name = "parking"
version = "2.2.1"
authors = [
"Stjepan Glavina <stjepang@gmail.com>",
"The Rust Project Developers",
]
build = false
exclude = ["/.*"]
autobins = false
autoexamples = false
autotests = false
autobenches = false
description = "Thread parking and unparking"
homepage = "https://github.com/smol-rs/parking"
documentation = "https://docs.rs/parking"
readme = "README.md"
keywords = [
"park",
"notify",
"thread",
"wake",
"condition",
]
categories = ["concurrency"]
license = "Apache-2.0 OR MIT"
repository = "https://github.com/smol-rs/parking"
[lib]
name = "parking"
path = "src/lib.rs"
[[test]]
name = "loom"
path = "tests/loom.rs"
[[test]]
name = "parking"
path = "tests/parking.rs"
[dev-dependencies.easy-parallel]
version = "3.0.0"
[target."cfg(loom)".dependencies.loom]
version = "0.7"
optional = true

201
vendor/parking/LICENSE-APACHE vendored Normal file
View File

@@ -0,0 +1,201 @@
Apache License
Version 2.0, January 2004
http://www.apache.org/licenses/
TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
1. Definitions.
"License" shall mean the terms and conditions for use, reproduction,
and distribution as defined by Sections 1 through 9 of this document.
"Licensor" shall mean the copyright owner or entity authorized by
the copyright owner that is granting the License.
"Legal Entity" shall mean the union of the acting entity and all
other entities that control, are controlled by, or are under common
control with that entity. For the purposes of this definition,
"control" means (i) the power, direct or indirect, to cause the
direction or management of such entity, whether by contract or
otherwise, or (ii) ownership of fifty percent (50%) or more of the
outstanding shares, or (iii) beneficial ownership of such entity.
"You" (or "Your") shall mean an individual or Legal Entity
exercising permissions granted by this License.
"Source" form shall mean the preferred form for making modifications,
including but not limited to software source code, documentation
source, and configuration files.
"Object" form shall mean any form resulting from mechanical
transformation or translation of a Source form, including but
not limited to compiled object code, generated documentation,
and conversions to other media types.
"Work" shall mean the work of authorship, whether in Source or
Object form, made available under the License, as indicated by a
copyright notice that is included in or attached to the work
(an example is provided in the Appendix below).
"Derivative Works" shall mean any work, whether in Source or Object
form, that is based on (or derived from) the Work and for which the
editorial revisions, annotations, elaborations, or other modifications
represent, as a whole, an original work of authorship. For the purposes
of this License, Derivative Works shall not include works that remain
separable from, or merely link (or bind by name) to the interfaces of,
the Work and Derivative Works thereof.
"Contribution" shall mean any work of authorship, including
the original version of the Work and any modifications or additions
to that Work or Derivative Works thereof, that is intentionally
submitted to Licensor for inclusion in the Work by the copyright owner
or by an individual or Legal Entity authorized to submit on behalf of
the copyright owner. For the purposes of this definition, "submitted"
means any form of electronic, verbal, or written communication sent
to the Licensor or its representatives, including but not limited to
communication on electronic mailing lists, source code control systems,
and issue tracking systems that are managed by, or on behalf of, the
Licensor for the purpose of discussing and improving the Work, but
excluding communication that is conspicuously marked or otherwise
designated in writing by the copyright owner as "Not a Contribution."
"Contributor" shall mean Licensor and any individual or Legal Entity
on behalf of whom a Contribution has been received by Licensor and
subsequently incorporated within the Work.
2. Grant of Copyright License. Subject to the terms and conditions of
this License, each Contributor hereby grants to You a perpetual,
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
copyright license to reproduce, prepare Derivative Works of,
publicly display, publicly perform, sublicense, and distribute the
Work and such Derivative Works in Source or Object form.
3. Grant of Patent License. Subject to the terms and conditions of
this License, each Contributor hereby grants to You a perpetual,
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
(except as stated in this section) patent license to make, have made,
use, offer to sell, sell, import, and otherwise transfer the Work,
where such license applies only to those patent claims licensable
by such Contributor that are necessarily infringed by their
Contribution(s) alone or by combination of their Contribution(s)
with the Work to which such Contribution(s) was submitted. If You
institute patent litigation against any entity (including a
cross-claim or counterclaim in a lawsuit) alleging that the Work
or a Contribution incorporated within the Work constitutes direct
or contributory patent infringement, then any patent licenses
granted to You under this License for that Work shall terminate
as of the date such litigation is filed.
4. Redistribution. You may reproduce and distribute copies of the
Work or Derivative Works thereof in any medium, with or without
modifications, and in Source or Object form, provided that You
meet the following conditions:
(a) You must give any other recipients of the Work or
Derivative Works a copy of this License; and
(b) You must cause any modified files to carry prominent notices
stating that You changed the files; and
(c) You must retain, in the Source form of any Derivative Works
that You distribute, all copyright, patent, trademark, and
attribution notices from the Source form of the Work,
excluding those notices that do not pertain to any part of
the Derivative Works; and
(d) If the Work includes a "NOTICE" text file as part of its
distribution, then any Derivative Works that You distribute must
include a readable copy of the attribution notices contained
within such NOTICE file, excluding those notices that do not
pertain to any part of the Derivative Works, in at least one
of the following places: within a NOTICE text file distributed
as part of the Derivative Works; within the Source form or
documentation, if provided along with the Derivative Works; or,
within a display generated by the Derivative Works, if and
wherever such third-party notices normally appear. The contents
of the NOTICE file are for informational purposes only and
do not modify the License. You may add Your own attribution
notices within Derivative Works that You distribute, alongside
or as an addendum to the NOTICE text from the Work, provided
that such additional attribution notices cannot be construed
as modifying the License.
You may add Your own copyright statement to Your modifications and
may provide additional or different license terms and conditions
for use, reproduction, or distribution of Your modifications, or
for any such Derivative Works as a whole, provided Your use,
reproduction, and distribution of the Work otherwise complies with
the conditions stated in this License.
5. Submission of Contributions. Unless You explicitly state otherwise,
any Contribution intentionally submitted for inclusion in the Work
by You to the Licensor shall be under the terms and conditions of
this License, without any additional terms or conditions.
Notwithstanding the above, nothing herein shall supersede or modify
the terms of any separate license agreement you may have executed
with Licensor regarding such Contributions.
6. Trademarks. This License does not grant permission to use the trade
names, trademarks, service marks, or product names of the Licensor,
except as required for reasonable and customary use in describing the
origin of the Work and reproducing the content of the NOTICE file.
7. Disclaimer of Warranty. Unless required by applicable law or
agreed to in writing, Licensor provides the Work (and each
Contributor provides its Contributions) on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
implied, including, without limitation, any warranties or conditions
of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
PARTICULAR PURPOSE. You are solely responsible for determining the
appropriateness of using or redistributing the Work and assume any
risks associated with Your exercise of permissions under this License.
8. Limitation of Liability. In no event and under no legal theory,
whether in tort (including negligence), contract, or otherwise,
unless required by applicable law (such as deliberate and grossly
negligent acts) or agreed to in writing, shall any Contributor be
liable to You for damages, including any direct, indirect, special,
incidental, or consequential damages of any character arising as a
result of this License or out of the use or inability to use the
Work (including but not limited to damages for loss of goodwill,
work stoppage, computer failure or malfunction, or any and all
other commercial damages or losses), even if such Contributor
has been advised of the possibility of such damages.
9. Accepting Warranty or Additional Liability. While redistributing
the Work or Derivative Works thereof, You may choose to offer,
and charge a fee for, acceptance of support, warranty, indemnity,
or other liability obligations and/or rights consistent with this
License. However, in accepting such obligations, You may act only
on Your own behalf and on Your sole responsibility, not on behalf
of any other Contributor, and only if You agree to indemnify,
defend, and hold each Contributor harmless for any liability
incurred by, or claims asserted against, such Contributor by reason
of your accepting any such warranty or additional liability.
END OF TERMS AND CONDITIONS
APPENDIX: How to apply the Apache License to your work.
To apply the Apache License to your work, attach the following
boilerplate notice, with the fields enclosed by brackets "[]"
replaced with your own identifying information. (Don't include
the brackets!) The text should be enclosed in the appropriate
comment syntax for the file format. We also recommend that a
file or class name and description of purpose be included on the
same "printed page" as the copyright notice for easier
identification within third-party archives.
Copyright [yyyy] [name of copyright owner]
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.

23
vendor/parking/LICENSE-MIT vendored Normal file
View File

@@ -0,0 +1,23 @@
Permission is hereby granted, free of charge, to any
person obtaining a copy of this software and associated
documentation files (the "Software"), to deal in the
Software without restriction, including without
limitation the rights to use, copy, modify, merge,
publish, distribute, sublicense, and/or sell copies of
the Software, and to permit persons to whom the Software
is furnished to do so, subject to the following
conditions:
The above copyright notice and this permission notice
shall be included in all copies or substantial portions
of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF
ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT
SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
DEALINGS IN THE SOFTWARE.

9
vendor/parking/LICENSE-THIRD-PARTY vendored Normal file
View File

@@ -0,0 +1,9 @@
===============================================================================
Copyright 2014-2020 The Rust Project Developers
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. All files in the project carrying such notice may not be
copied, modified, or distributed except according to those terms.

67
vendor/parking/README.md vendored Normal file
View File

@@ -0,0 +1,67 @@
# parking
[![Build](https://github.com/smol-rs/parking/workflows/Build%20and%20test/badge.svg)](
https://github.com/smol-rs/parking/actions)
[![License](https://img.shields.io/badge/license-Apache--2.0_OR_MIT-blue.svg)](
https://github.com/smol-rs/parking)
[![Cargo](https://img.shields.io/crates/v/parking.svg)](
https://crates.io/crates/parking)
[![Documentation](https://docs.rs/parking/badge.svg)](
https://docs.rs/parking)
Thread parking and unparking.
A `Parker` is in either the notified or unnotified state. The `park()` method blocks
the current thread until the `Parker` becomes notified and then puts it back into the unnotified
state. The `unpark()` method puts it into the notified state.
This API is similar to [`thread::park()`] and [`Thread::unpark()`] from the standard library.
The difference is that the state "token" managed by those functions is shared across an entire
thread, and anyone can call [`thread::current()`] to access it. If you use `park` and `unpark`,
but you also call a function that uses `park` and `unpark` internally, that function could
cause a deadlock by consuming a wakeup that was intended for you. The `Parker` object in this
crate avoids that problem by managing its own state, which isn't shared with unrelated callers.
[`thread::park()`]: https://doc.rust-lang.org/std/thread/fn.park.html
[`Thread::unpark()`]: https://doc.rust-lang.org/std/thread/struct.Thread.html#method.unpark
[`thread::current()`]: https://doc.rust-lang.org/std/thread/fn.current.html
## Examples
```rust
use std::thread;
use std::time::Duration;
use parking::Parker;
let p = Parker::new();
let u = p.unparker();
// Notify the parker.
u.unpark();
// Wakes up immediately because the parker is notified.
p.park();
thread::spawn(move || {
thread::sleep(Duration::from_millis(500));
u.unpark();
});
// Wakes up when `u.unpark()` notifies and then goes back into unnotified state.
p.park();
```
## License
Licensed under either of
* Apache License, Version 2.0 ([LICENSE-APACHE](LICENSE-APACHE) or http://www.apache.org/licenses/LICENSE-2.0)
* MIT license ([LICENSE-MIT](LICENSE-MIT) or http://opensource.org/licenses/MIT)
at your option.
#### Contribution
Unless you explicitly state otherwise, any contribution intentionally submitted
for inclusion in the work by you, as defined in the Apache-2.0 license, shall be
dual licensed as above, without any additional terms or conditions.

449
vendor/parking/src/lib.rs vendored Normal file
View File

@@ -0,0 +1,449 @@
//! Thread parking and unparking.
//!
//! A [`Parker`] is in either the notified or unnotified state. The [`park()`][`Parker::park()`] method blocks
//! the current thread until the [`Parker`] becomes notified and then puts it back into the unnotified
//! state. The [`unpark()`][`Unparker::unpark()`] method puts it into the notified state.
//!
//! This API is similar to [`thread::park()`] and [`Thread::unpark()`] from the standard library.
//! The difference is that the state "token" managed by those functions is shared across an entire
//! thread, and anyone can call [`thread::current()`] to access it. If you use `park` and `unpark`,
//! but you also call a function that uses `park` and `unpark` internally, that function could
//! cause a deadlock by consuming a wakeup that was intended for you. The [`Parker`] object in this
//! crate avoids that problem by managing its own state, which isn't shared with unrelated callers.
//!
//! [`thread::park()`]: https://doc.rust-lang.org/std/thread/fn.park.html
//! [`Thread::unpark()`]: https://doc.rust-lang.org/std/thread/struct.Thread.html#method.unpark
//! [`thread::current()`]: https://doc.rust-lang.org/std/thread/fn.current.html
//!
//! # Examples
//!
//! ```
//! use std::thread;
//! use std::time::Duration;
//! use parking::Parker;
//!
//! let p = Parker::new();
//! let u = p.unparker();
//!
//! // Notify the parker.
//! u.unpark();
//!
//! // Wakes up immediately because the parker is notified.
//! p.park();
//!
//! thread::spawn(move || {
//! thread::sleep(Duration::from_millis(500));
//! u.unpark();
//! });
//!
//! // Wakes up when `u.unpark()` notifies and then goes back into unnotified state.
//! p.park();
//! ```
#![forbid(unsafe_code)]
#![warn(missing_docs, missing_debug_implementations, rust_2018_idioms)]
#![doc(
html_favicon_url = "https://raw.githubusercontent.com/smol-rs/smol/master/assets/images/logo_fullsize_transparent.png"
)]
#![doc(
html_logo_url = "https://raw.githubusercontent.com/smol-rs/smol/master/assets/images/logo_fullsize_transparent.png"
)]
#[cfg(not(all(loom, feature = "loom")))]
use std::sync;
#[cfg(all(loom, feature = "loom"))]
use loom::sync;
use std::cell::Cell;
use std::fmt;
use std::marker::PhantomData;
use std::sync::Arc;
use std::task::{Wake, Waker};
use std::time::Duration;
#[cfg(not(all(loom, feature = "loom")))]
use std::time::Instant;
use sync::atomic::AtomicUsize;
use sync::atomic::Ordering::SeqCst;
use sync::{Condvar, Mutex};
/// Creates a parker and an associated unparker.
///
/// # Examples
///
/// ```
/// let (p, u) = parking::pair();
/// ```
pub fn pair() -> (Parker, Unparker) {
let p = Parker::new();
let u = p.unparker();
(p, u)
}
/// Waits for a notification.
pub struct Parker {
unparker: Unparker,
_marker: PhantomData<Cell<()>>,
}
impl Parker {
/// Creates a new parker.
///
/// # Examples
///
/// ```
/// use parking::Parker;
///
/// let p = Parker::new();
/// ```
///
pub fn new() -> Parker {
Parker {
unparker: Unparker {
inner: Arc::new(Inner {
state: AtomicUsize::new(EMPTY),
lock: Mutex::new(()),
cvar: Condvar::new(),
}),
},
_marker: PhantomData,
}
}
/// Blocks until notified and then goes back into unnotified state.
///
/// # Examples
///
/// ```
/// use parking::Parker;
///
/// let p = Parker::new();
/// let u = p.unparker();
///
/// // Notify the parker.
/// u.unpark();
///
/// // Wakes up immediately because the parker is notified.
/// p.park();
/// ```
pub fn park(&self) {
self.unparker.inner.park(None);
}
/// Blocks until notified and then goes back into unnotified state, or times out after
/// `duration`.
///
/// Returns `true` if notified before the timeout.
///
/// # Examples
///
/// ```
/// use std::time::Duration;
/// use parking::Parker;
///
/// let p = Parker::new();
///
/// // Wait for a notification, or time out after 500 ms.
/// p.park_timeout(Duration::from_millis(500));
/// ```
#[cfg(not(loom))]
pub fn park_timeout(&self, duration: Duration) -> bool {
self.unparker.inner.park(Some(duration))
}
/// Blocks until notified and then goes back into unnotified state, or times out at `instant`.
///
/// Returns `true` if notified before the deadline.
///
/// # Examples
///
/// ```
/// use std::time::{Duration, Instant};
/// use parking::Parker;
///
/// let p = Parker::new();
///
/// // Wait for a notification, or time out after 500 ms.
/// p.park_deadline(Instant::now() + Duration::from_millis(500));
/// ```
#[cfg(not(loom))]
pub fn park_deadline(&self, instant: Instant) -> bool {
self.unparker
.inner
.park(Some(instant.saturating_duration_since(Instant::now())))
}
/// Notifies the parker.
///
/// Returns `true` if this call is the first to notify the parker, or `false` if the parker
/// was already notified.
///
/// # Examples
///
/// ```
/// use std::thread;
/// use std::time::Duration;
/// use parking::Parker;
///
/// let p = Parker::new();
///
/// assert_eq!(p.unpark(), true);
/// assert_eq!(p.unpark(), false);
///
/// // Wakes up immediately.
/// p.park();
/// ```
pub fn unpark(&self) -> bool {
self.unparker.unpark()
}
/// Returns a handle for unparking.
///
/// The returned [`Unparker`] can be cloned and shared among threads.
///
/// # Examples
///
/// ```
/// use parking::Parker;
///
/// let p = Parker::new();
/// let u = p.unparker();
///
/// // Notify the parker.
/// u.unpark();
///
/// // Wakes up immediately because the parker is notified.
/// p.park();
/// ```
pub fn unparker(&self) -> Unparker {
self.unparker.clone()
}
}
impl Default for Parker {
fn default() -> Parker {
Parker::new()
}
}
impl fmt::Debug for Parker {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
f.pad("Parker { .. }")
}
}
/// Notifies a parker.
pub struct Unparker {
inner: Arc<Inner>,
}
impl Unparker {
/// Notifies the associated parker.
///
/// Returns `true` if this call is the first to notify the parker, or `false` if the parker
/// was already notified.
///
/// # Examples
///
/// ```
/// use std::thread;
/// use std::time::Duration;
/// use parking::Parker;
///
/// let p = Parker::new();
/// let u = p.unparker();
///
/// thread::spawn(move || {
/// thread::sleep(Duration::from_millis(500));
/// u.unpark();
/// });
///
/// // Wakes up when `u.unpark()` notifies and then goes back into unnotified state.
/// p.park();
/// ```
pub fn unpark(&self) -> bool {
self.inner.unpark()
}
/// Indicates whether this unparker will unpark the associated parker.
///
/// This can be used to avoid unnecessary work before calling `unpark()`.
///
/// # Examples
///
/// ```
/// use parking::Parker;
///
/// let p = Parker::new();
/// let u = p.unparker();
///
/// assert!(u.will_unpark(&p));
/// ```
pub fn will_unpark(&self, parker: &Parker) -> bool {
Arc::ptr_eq(&self.inner, &parker.unparker.inner)
}
/// Indicates whether two unparkers will unpark the same parker.
///
/// # Examples
///
/// ```
/// use parking::Parker;
///
/// let p = Parker::new();
/// let u1 = p.unparker();
/// let u2 = p.unparker();
///
/// assert!(u1.same_parker(&u2));
/// ```
pub fn same_parker(&self, other: &Unparker) -> bool {
Arc::ptr_eq(&self.inner, &other.inner)
}
}
impl fmt::Debug for Unparker {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
f.pad("Unparker { .. }")
}
}
impl Clone for Unparker {
fn clone(&self) -> Unparker {
Unparker {
inner: self.inner.clone(),
}
}
}
impl From<Unparker> for Waker {
fn from(up: Unparker) -> Self {
Waker::from(up.inner)
}
}
const EMPTY: usize = 0;
const PARKED: usize = 1;
const NOTIFIED: usize = 2;
struct Inner {
state: AtomicUsize,
lock: Mutex<()>,
cvar: Condvar,
}
impl Inner {
fn park(&self, timeout: Option<Duration>) -> bool {
// If we were previously notified then we consume this notification and return quickly.
if self
.state
.compare_exchange(NOTIFIED, EMPTY, SeqCst, SeqCst)
.is_ok()
{
return true;
}
// If the timeout is zero, then there is no need to actually block.
if let Some(dur) = timeout {
if dur == Duration::from_millis(0) {
return false;
}
}
// Otherwise we need to coordinate going to sleep.
let mut m = self.lock.lock().unwrap();
match self.state.compare_exchange(EMPTY, PARKED, SeqCst, SeqCst) {
Ok(_) => {}
// Consume this notification to avoid spurious wakeups in the next park.
Err(NOTIFIED) => {
// We must read `state` here, even though we know it will be `NOTIFIED`. This is
// because `unpark` may have been called again since we read `NOTIFIED` in the
// `compare_exchange` above. We must perform an acquire operation that synchronizes
// with that `unpark` to observe any writes it made before the call to `unpark`. To
// do that we must read from the write it made to `state`.
let old = self.state.swap(EMPTY, SeqCst);
assert_eq!(old, NOTIFIED, "park state changed unexpectedly");
return true;
}
Err(n) => panic!("inconsistent park_timeout state: {}", n),
}
match timeout {
None => {
loop {
// Block the current thread on the conditional variable.
m = self.cvar.wait(m).unwrap();
if self
.state
.compare_exchange(NOTIFIED, EMPTY, SeqCst, SeqCst)
.is_ok()
{
// got a notification
return true;
}
}
}
Some(timeout) => {
#[cfg(not(loom))]
{
// Wait with a timeout, and if we spuriously wake up or otherwise wake up from a
// notification we just want to unconditionally set `state` back to `EMPTY`, either
// consuming a notification or un-flagging ourselves as parked.
let (_m, _result) = self.cvar.wait_timeout(m, timeout).unwrap();
match self.state.swap(EMPTY, SeqCst) {
NOTIFIED => true, // got a notification
PARKED => false, // no notification
n => panic!("inconsistent park_timeout state: {}", n),
}
}
#[cfg(loom)]
{
let _ = timeout;
panic!("park_timeout is not supported under loom");
}
}
}
}
pub fn unpark(&self) -> bool {
// To ensure the unparked thread will observe any writes we made before this call, we must
// perform a release operation that `park` can synchronize with. To do that we must write
// `NOTIFIED` even if `state` is already `NOTIFIED`. That is why this must be a swap rather
// than a compare-and-swap that returns if it reads `NOTIFIED` on failure.
match self.state.swap(NOTIFIED, SeqCst) {
EMPTY => return true, // no one was waiting
NOTIFIED => return false, // already unparked
PARKED => {} // gotta go wake someone up
_ => panic!("inconsistent state in unpark"),
}
// There is a period between when the parked thread sets `state` to `PARKED` (or last
// checked `state` in the case of a spurious wakeup) and when it actually waits on `cvar`.
// If we were to notify during this period it would be ignored and then when the parked
// thread went to sleep it would never wake up. Fortunately, it has `lock` locked at this
// stage so we can acquire `lock` to wait until it is ready to receive the notification.
//
// Releasing `lock` before the call to `notify_one` means that when the parked thread wakes
// it doesn't get woken only to have to wait for us to release `lock`.
drop(self.lock.lock().unwrap());
self.cvar.notify_one();
true
}
}
impl Wake for Inner {
#[inline]
fn wake(self: Arc<Self>) {
self.unpark();
}
#[inline]
fn wake_by_ref(self: &Arc<Self>) {
self.unpark();
}
}

28
vendor/parking/tests/loom.rs vendored Normal file
View File

@@ -0,0 +1,28 @@
#![cfg(loom)]
#[test]
fn smoke() {
loom::model(|| {
let (p, u) = parking::pair();
loom::thread::spawn(move || {
p.park();
});
u.unpark();
});
}
#[test]
fn yield_then_unpark() {
loom::model(|| {
let (p, u) = parking::pair();
loom::thread::spawn(move || {
loom::thread::yield_now();
u.unpark();
});
p.park();
});
}

145
vendor/parking/tests/parking.rs vendored Normal file
View File

@@ -0,0 +1,145 @@
use std::future::Future;
use std::task::{Context, Poll, Waker};
use std::thread::sleep;
use std::time::{Duration, Instant};
use easy_parallel::Parallel;
use parking::Parker;
#[test]
fn park_timeout_unpark_before() {
let (p, u) = parking::pair();
for _ in 0..10 {
u.unpark();
p.park_timeout(Duration::from_millis(u32::MAX as u64));
}
}
#[test]
fn park_timeout_unpark_not_called() {
let p = Parker::new();
for _ in 0..10 {
p.park_timeout(Duration::from_millis(10));
}
}
#[test]
fn park_timeout_unpark_called_other_thread() {
for _ in 0..10 {
let p = Parker::new();
let u = p.unparker();
Parallel::new()
.add(move || {
sleep(Duration::from_millis(50));
u.unpark();
})
.add(move || {
p.park_timeout(Duration::from_millis(u32::MAX as u64));
})
.run();
}
}
#[test]
fn park_deadline_unpark_called_other_thread() {
for _ in 0..10 {
let p = Parker::new();
let u = p.unparker();
Parallel::new()
.add(move || {
sleep(Duration::from_millis(50));
u.unpark();
})
.add(move || {
let deadline = Instant::now() + Duration::from_micros(u32::MAX as u64);
p.park_deadline(deadline);
})
.run();
}
}
#[test]
fn park_then_wake_from_other_thread() {
for _ in 0..10 {
let (p, u) = parking::pair();
Parallel::new()
.add(move || {
sleep(Duration::from_millis(50));
u.unpark();
})
.add(move || {
let start = Instant::now();
p.park();
assert!(Instant::now().duration_since(start) >= Duration::from_millis(50));
})
.run();
}
}
#[test]
fn unpark() {
let p = Parker::default();
assert!(p.unpark());
assert!(!p.unpark());
}
#[test]
fn same_parker() {
let (p1, u1) = parking::pair();
let (p2, u2) = parking::pair();
assert!(u1.will_unpark(&p1));
assert!(!u1.will_unpark(&p2));
assert!(u1.same_parker(&u1.clone()));
assert!(!u1.same_parker(&u2));
}
#[test]
fn waker() {
let (p, u) = parking::pair();
let waker: Waker = u.into();
waker.wake();
assert!(p.park_timeout(Duration::from_secs(2)));
}
#[test]
fn future() {
struct Yield(bool);
impl Future for Yield {
type Output = ();
fn poll(mut self: std::pin::Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Self::Output> {
if self.0 {
Poll::Ready(())
} else {
self.0 = true;
cx.waker().wake_by_ref();
Poll::Pending
}
}
}
let (p, u) = parking::pair();
let waker = u.into();
let mut context = Context::from_waker(&waker);
let mut future = Box::pin(Yield(false));
assert!(!p.park_timeout(Duration::from_millis(0)));
assert_eq!(future.as_mut().poll(&mut context), Poll::Pending);
assert!(p.park_timeout(Duration::from_millis(0)));
assert_eq!(future.as_mut().poll(&mut context), Poll::Ready(()));
assert!(!p.park_timeout(Duration::from_millis(0)));
}
#[test]
fn debug_for_coverage() {
let (p, u) = parking::pair();
let _ = format!("{:?} {:?}", &p, &u);
}