1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779
#![cfg_attr(not(feature = "std"), no_std)]
#![cfg_attr(docsrs, feature(doc_cfg, doc_auto_cfg))]
#![doc = include_str!("../README.md")]
#![warn(missing_docs)]
use core::{cmp, fmt, mem::MaybeUninit, ops, ptr};
#[macro_use]
mod macros;
mod loom;
pub mod mpsc;
pub mod recycling;
mod util;
mod wait;
pub use self::recycling::Recycle;
// TODO(eliza): finish writing this
// #[doc = include_str!("../mpsc_perf_comparison.md")]
// pub mod mpsc_perf_comparison {
// // Empty module, used only for documentation.
// }
feature! {
#![all(feature = "static", not(all(loom, test)))]
mod static_thingbuf;
pub use self::static_thingbuf::StaticThingBuf;
}
feature! {
#![feature = "alloc"]
extern crate alloc;
mod thingbuf;
pub use self::thingbuf::ThingBuf;
}
use crate::{
loom::{
atomic::{AtomicUsize, Ordering::*},
cell::{MutPtr, UnsafeCell},
},
mpsc::errors::{TryRecvError, TrySendError},
util::{Backoff, CachePadded},
};
const HAS_READER: usize = 1 << (usize::BITS - 1);
/// Maximum capacity of a `ThingBuf`. This is the largest number of elements that
/// can be stored in a `ThingBuf`. This is the highest power of two that can be expressed by a
/// `usize`, excluding the most significant bit reserved for the "has reader" flag.
pub const MAX_CAPACITY: usize = usize::MAX & !HAS_READER;
/// A reference to an entry in a [`ThingBuf`].
///
/// A `Ref` represents the exclusive permission to mutate a given element in a
/// queue. A `Ref<T>` [implements `DerefMut<T>`] to allow writing to that
/// element.
///
/// `Ref`s are returned by the [`ThingBuf::push_ref`] and [`ThingBuf::pop_ref`]
/// methods. When the `Ref` is dropped, the exclusive write access to that
/// element is released, and the push or pop operation is completed —
/// calling `push_ref` or `pop_ref` *begins* a push or pop operation, which ends
/// when the returned `Ref` is complete. When the `Ref` is dropped, the pushed
/// element will become available to a subsequent `pop_ref`, or the popped
/// element will be able to be written to by a `push_ref`, respectively.
///
/// [implements `DerefMut<T>`]: #impl-DerefMut
pub struct Ref<'slot, T> {
ptr: MutPtr<MaybeUninit<T>>,
slot: &'slot Slot<T>,
new_state: usize,
is_pop: bool,
}
/// Error indicating that a `push` operation failed because a queue was at
/// capacity.
///
/// This is returned by the [`ThingBuf::push`] and [`ThingBuf::push_ref`] (and
/// [`StaticThingBuf::push`]/[`StaticThingBuf::push_ref`]) methods.
#[derive(PartialEq, Eq)]
pub struct Full<T = ()>(T);
/// State variables for the atomic ring buffer algorithm.
///
/// This is separated from the actual storage array used to implement the ring
/// buffer, so that it can be used by both the dynamically-sized implementation
/// (`Box<[Slot<T>>]`) and the statically-sized (`[T; const usize]`)
/// implementation.
///
/// A `Core`, when provided with a reference to the storage array, knows how to
/// actually perform the ring buffer operations on that array.
///
/// The atomic ring buffer is based on the [MPMC bounded queue from 1024cores][1].
///
/// [1]: https://www.1024cores.net/home/lock-free-algorithms/queues/bounded-mpmc-queue
#[derive(Debug)]
struct Core {
head: CachePadded<AtomicUsize>,
tail: CachePadded<AtomicUsize>,
gen: usize,
gen_mask: usize,
idx_mask: usize,
closed: usize,
capacity: usize,
/// Set when dropping the slots in the ring buffer, to avoid potential double-frees.
has_dropped_slots: bool,
}
struct Slot<T> {
value: UnsafeCell<MaybeUninit<T>>,
/// Each slot's state has two components: a flag indicated by the most significant bit (MSB), and the rest of the state.
/// The MSB is set when a reader is reading from this slot.
/// The rest of the state helps determine the availability of the slot for reading or writing:
/// - A slot is available for reading when the state (excluding the MSB) equals head + 1.
/// - A slot is available for writing when the state (excluding the MSB) equals tail.
/// At initialization, each slot's state is set to its ordinal index.
state: AtomicUsize,
}
impl Core {
#[cfg(not(all(loom, test)))]
const fn new(capacity: usize) -> Self {
assert!(capacity <= MAX_CAPACITY);
let closed = (capacity + 1).next_power_of_two();
let idx_mask = closed - 1;
let gen = closed << 1;
let gen_mask = !(closed | idx_mask);
Self {
head: CachePadded(AtomicUsize::new(0)),
tail: CachePadded(AtomicUsize::new(0)),
gen,
gen_mask,
closed,
idx_mask,
capacity,
has_dropped_slots: false,
}
}
#[cfg(all(loom, test))]
fn new(capacity: usize) -> Self {
let closed = (capacity + 1).next_power_of_two();
let idx_mask = closed - 1;
let gen = closed << 1;
let gen_mask = !(closed | idx_mask);
Self {
head: CachePadded(AtomicUsize::new(0)),
tail: CachePadded(AtomicUsize::new(0)),
gen,
closed,
gen_mask,
idx_mask,
capacity,
#[cfg(debug_assertions)]
has_dropped_slots: false,
}
}
#[inline(always)]
fn idx_gen(&self, val: usize) -> (usize, usize) {
(val & self.idx_mask, val & self.gen_mask)
}
#[inline]
fn next(&self, idx: usize, gen: usize) -> usize {
// Are we still in the same generation?
if idx + 1 < self.capacity() {
// If we're still within the current generation, increment the index
// by 1.
(idx | gen) + 1
} else {
// We've reached the end of the current lap, wrap the index around
// to 0.
wrapping_add(gen, self.gen)
}
}
#[inline]
fn capacity(&self) -> usize {
self.capacity
}
fn close(&self) -> bool {
test_println!("Core::close");
if crate::util::panic::panicking() {
return false;
}
test_dbg!(self.tail.fetch_or(self.closed, SeqCst) & self.closed == 0)
}
#[inline(always)]
fn push_ref<'slots, T, R>(
&self,
slots: &'slots [Slot<T>],
recycle: &R,
) -> Result<Ref<'slots, T>, TrySendError<()>>
where
R: Recycle<T>,
{
test_println!("push_ref");
let mut backoff = Backoff::new();
let mut tail = test_dbg!(self.tail.load(Relaxed));
loop {
if test_dbg!(tail & self.closed != 0) {
return Err(TrySendError::Closed(()));
}
let (idx, gen) = self.idx_gen(tail);
test_dbg!(idx);
test_dbg!(gen);
let slot = unsafe {
// Safety: `get_unchecked` does not check that the accessed
// index was within bounds. However, `idx` is produced by
// masking the current tail index to extract only the part
// that's within the array's bounds.
debug_assert!(
idx < slots.len(),
"index out of bounds (index was {} but the length was {})\n\n\
/!\\ EXTREMELY SERIOUS WARNING /!\\: in release mode, this \
access would not have been bounds checked, resulting in \
undefined behavior!\nthis is a bug in `thingbuf`! please \
report an issue immediately!",
idx,
slots.len()
);
slots.get_unchecked(idx)
};
let raw_state = test_dbg!(slot.state.load(SeqCst));
let state = test_dbg!(clear_has_reader(raw_state));
// slot is writable
if test_dbg!(state == tail) {
let next_tail = self.next(idx, gen);
// try to advance the tail
match test_dbg!(self
.tail
.compare_exchange_weak(tail, next_tail, SeqCst, Acquire))
{
Ok(_) if test_dbg!(check_has_reader(raw_state)) => {
test_println!(
"advanced tail {} to {}; has an active reader, skipping slot [{}]",
tail,
next_tail,
idx
);
let next_state = wrapping_add(tail, self.gen);
test_dbg!(slot
.state
.fetch_update(SeqCst, SeqCst, |state| {
Some(state & HAS_READER | next_state)
})
.unwrap_or_else(|_| unreachable!()));
tail = next_tail;
backoff.spin();
continue;
}
Ok(_) => {
// We got the slot! It's now okay to write to it
test_println!(
"advanced tail {} to {}; claimed slot [{}]",
tail,
next_tail,
idx
);
// Claim exclusive ownership over the slot
let ptr = slot.value.get_mut();
// Initialize or recycle the element.
unsafe {
// Safety: we have just claimed exclusive ownership over
// this slot.
let ptr = ptr.deref();
if gen == 0 {
ptr.write(recycle.new_element());
test_println!("-> initialized");
} else {
// Safety: if the generation is > 0, then the
// slot has already been initialized.
recycle.recycle(ptr.assume_init_mut());
test_println!("-> recycled");
}
}
return Ok(Ref {
ptr,
new_state: tail + 1,
slot,
is_pop: false,
});
}
Err(actual) => {
// Someone else took this slot and advanced the tail
// index. Try to claim the new tail.
test_println!("failed to advance tail {} to {}", tail, next_tail);
tail = actual;
backoff.spin();
continue;
}
}
}
// check if we have any available slots
// fake RMW op to placate loom. this should be equivalent to
// doing a relaxed load after a SeqCst fence (per Godbolt
// https://godbolt.org/z/zb15qfEa9), however, loom understands
// this correctly, while it does not understand an explicit
// SeqCst fence and a load.
// XXX(eliza): this makes me DEEPLY UNCOMFORTABLE but if it's a
// load it gets reordered differently in the model checker lmao...
let head = test_dbg!(self.head.fetch_or(0, SeqCst));
if test_dbg!(wrapping_add(head, self.gen) == tail) {
test_println!("channel full");
return Err(TrySendError::Full(()));
}
// if the current state is marked as data written by the current (or even future)
// generation, we can spin, as our tail is probably behind the actual tail.
// however, if the state is marked as data written by the previous generation and nobody
// is reading it, then we don't have any available slots.
let (tail_idx, tail_gen) = self.idx_gen(tail);
let (state_idx, state_gen) = self.idx_gen(state);
if test_dbg!(state_idx == tail_idx + 1) && test_dbg!(state_gen < tail_gen) {
test_println!("channel full");
return Err(TrySendError::Full(()));
}
backoff.spin_yield();
tail = test_dbg!(self.tail.load(Acquire));
}
}
#[inline(always)]
fn pop_ref<'slots, T>(&self, slots: &'slots [Slot<T>]) -> Result<Ref<'slots, T>, TryRecvError> {
test_println!("pop_ref");
let mut backoff = Backoff::new();
let mut head = self.head.load(Relaxed);
loop {
test_dbg!(head);
let (idx, gen) = self.idx_gen(head);
test_dbg!(idx);
test_dbg!(gen);
let slot = unsafe {
// Safety: `get_unchecked` does not check that the accessed
// index was within bounds. However, `idx` is produced by
// masking the current head index to extract only the part
// that's within the array's bounds.
debug_assert!(
idx < slots.len(),
"index out of bounds (index was {} but the length was {})\n\n\
/!\\ EXTREMELY SERIOUS WARNING /!\\: in release mode, this \
access would not have been bounds checked, resulting in \
undefined behavior!\nthis is a bug in `thingbuf`! please \
report an issue immediately!",
idx,
slots.len()
);
slots.get_unchecked(idx)
};
let raw_state = test_dbg!(slot.state.load(Acquire));
let next_head = self.next(idx, gen);
// If the slot's state is ahead of the head index by one, we can pop it.
if test_dbg!(raw_state == head + 1) {
// try to advance the head index
match test_dbg!(self
.head
.compare_exchange_weak(head, next_head, SeqCst, Acquire))
{
Ok(_) => {
test_println!("advanced head {} to {}", head, next_head);
test_println!("claimed slot [{}]", idx);
let mut new_state = wrapping_add(head, self.gen);
new_state = set_has_reader(new_state);
test_dbg!(slot.state.store(test_dbg!(new_state), SeqCst));
return Ok(Ref {
new_state,
ptr: slot.value.get_mut(),
slot,
is_pop: true,
});
}
Err(actual) => {
test_println!("failed to advance head, head={}, actual={}", head, actual);
head = actual;
backoff.spin();
continue;
}
}
} else {
// Maybe we reached the tail index? If so, the buffer is empty.
// fake RMW op to placate loom. this should be equivalent to
// doing a relaxed load after a SeqCst fence (per Godbolt
// https://godbolt.org/z/zb15qfEa9), however, loom understands
// this correctly, while it does not understand an explicit
// SeqCst fence and a load.
// XXX(eliza): this makes me DEEPLY UNCOMFORTABLE but if it's a
// load it gets reordered differently in the model checker lmao...
let tail = test_dbg!(self.tail.fetch_or(0, SeqCst));
if test_dbg!(tail & !self.closed == head) {
return if test_dbg!(tail & self.closed != 0) {
Err(TryRecvError::Closed)
} else {
test_println!("--> channel empty!");
Err(TryRecvError::Empty)
};
}
// Is anyone writing to the slot from this generation?
if test_dbg!(raw_state == head) {
if test_dbg!(backoff.done_spinning()) {
return Err(TryRecvError::Empty);
}
backoff.spin();
continue;
}
// The slot is in an invalid state (was skipped). Try to advance the head index.
match test_dbg!(self.head.compare_exchange(head, next_head, SeqCst, Acquire)) {
Ok(_) => {
test_println!("skipped head slot [{}], new head={}", idx, next_head);
head = next_head;
}
Err(actual) => {
test_println!(
"failed to skip head slot [{}], head={}, actual={}",
idx,
head,
actual
);
head = actual;
backoff.spin();
}
}
}
}
}
fn len(&self) -> usize {
loop {
let tail = self.tail.load(SeqCst);
let head = self.head.load(SeqCst);
if self.tail.load(SeqCst) == tail {
let (head_idx, _) = self.idx_gen(head);
let (tail_idx, _) = self.idx_gen(tail);
return match head_idx.cmp(&tail_idx) {
cmp::Ordering::Less => tail_idx - head_idx,
cmp::Ordering::Greater => self.capacity - head_idx + tail_idx,
// Ignore the closed bit when comparing head and tail here,
// since it's not relevant to the length of the channel. If
// both indices point at the same slot and lap, the length
// is zero, even if the channel has been closed.
_ if (tail & !self.closed) == (head & !self.closed) => 0,
_ => self.capacity,
};
}
}
}
fn drop_slots<T>(&mut self, slots: &mut [Slot<T>]) {
debug_assert!(
!self.has_dropped_slots,
"tried to drop slots twice! core={:#?}",
self
);
if self.has_dropped_slots {
return;
}
let tail = self.tail.load(SeqCst);
let (idx, gen) = self.idx_gen(tail);
let num_initialized = if gen > 0 { self.capacity() } else { idx };
for slot in &mut slots[..num_initialized] {
unsafe {
slot.value
.with_mut(|value| ptr::drop_in_place((*value).as_mut_ptr()));
}
}
self.has_dropped_slots = true;
}
}
#[inline]
fn check_has_reader(state: usize) -> bool {
state & HAS_READER == HAS_READER
}
#[inline]
fn set_has_reader(state: usize) -> usize {
state | HAS_READER
}
#[inline]
fn clear_has_reader(state: usize) -> usize {
state & !HAS_READER
}
#[inline]
fn wrapping_add(a: usize, b: usize) -> usize {
(a + b) & MAX_CAPACITY
}
impl Drop for Core {
fn drop(&mut self) {
debug_assert!(
self.has_dropped_slots,
"tried to drop Core without dropping slots! core={:#?}",
self
);
}
}
// === impl Ref ===
impl<T> Ref<'_, T> {
#[inline]
fn with<U>(&self, f: impl FnOnce(&T) -> U) -> U {
self.ptr.with(|value| unsafe {
// Safety: if a `Ref` exists, we have exclusive ownership of the
// slot. A `Ref` is only created if the slot has already been
// initialized.
// TODO(eliza): use `MaybeUninit::assume_init_ref` here once it's
// supported by `tracing-appender`'s MSRV.
f(&*(*value).as_ptr())
})
}
#[inline]
fn with_mut<U>(&mut self, f: impl FnOnce(&mut T) -> U) -> U {
self.ptr.with(|value| unsafe {
// Safety: if a `Ref` exists, we have exclusive ownership of the
// slot.
// TODO(eliza): use `MaybeUninit::assume_init_mut` here once it's
// supported by `tracing-appender`'s MSRV.
f(&mut *(*value).as_mut_ptr())
})
}
}
impl<T> ops::Deref for Ref<'_, T> {
type Target = T;
#[inline]
fn deref(&self) -> &Self::Target {
unsafe {
// Safety: if a `Ref` exists, we have exclusive ownership of the
// slot. A `Ref` is only created if the slot has already been
// initialized.
&*self.ptr.deref().as_ptr()
}
}
}
impl<T> ops::DerefMut for Ref<'_, T> {
#[inline]
fn deref_mut(&mut self) -> &mut Self::Target {
unsafe {
// Safety: if a `Ref` exists, we have exclusive ownership of the
// slot. A `Ref` is only created if the slot has already been
// initialized.
&mut *self.ptr.deref().as_mut_ptr()
}
}
}
impl<T> Drop for Ref<'_, T> {
#[inline]
fn drop(&mut self) {
if self.is_pop {
test_println!("drop Ref<{}> (pop)", core::any::type_name::<T>());
test_dbg!(self.slot.state.fetch_and(!HAS_READER, SeqCst));
} else {
test_println!(
"drop Ref<{}> (push), new_state = {}",
core::any::type_name::<T>(),
self.new_state
);
test_dbg!(self.slot.state.store(test_dbg!(self.new_state), Release));
}
}
}
impl<T: fmt::Debug> fmt::Debug for Ref<'_, T> {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
self.with(|val| fmt::Debug::fmt(val, f))
}
}
impl<T: fmt::Display> fmt::Display for Ref<'_, T> {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
self.with(|val| fmt::Display::fmt(val, f))
}
}
impl<T: fmt::Write> fmt::Write for Ref<'_, T> {
#[inline]
fn write_str(&mut self, s: &str) -> fmt::Result {
self.with_mut(|val| val.write_str(s))
}
#[inline]
fn write_char(&mut self, c: char) -> fmt::Result {
self.with_mut(|val| val.write_char(c))
}
#[inline]
fn write_fmt(&mut self, f: fmt::Arguments<'_>) -> fmt::Result {
self.with_mut(|val| val.write_fmt(f))
}
}
unsafe impl<T: Send> Send for Ref<'_, T> {}
unsafe impl<T: Send> Sync for Ref<'_, T> {}
// === impl Slot ===
impl<T> Slot<T> {
#[cfg(feature = "alloc")]
pub(crate) fn make_boxed_array(capacity: usize) -> alloc::boxed::Box<[Self]> {
(0..capacity).map(|i| Slot::new(i)).collect()
}
feature! {
#![all(feature = "static", not(all(loom, test)))]
const EMPTY: Self = Self::new(usize::MAX);
pub(crate) const fn make_static_array<const CAPACITY: usize>() -> [Self; CAPACITY] {
let mut array = [Self::EMPTY; CAPACITY];
let mut i = 0;
while i < CAPACITY {
array[i] = Self::new(i);
i += 1;
}
array
}
}
#[cfg(not(all(loom, test)))]
const fn new(idx: usize) -> Self {
Self {
value: UnsafeCell::new(MaybeUninit::uninit()),
state: AtomicUsize::new(idx),
}
}
#[cfg(all(loom, test))]
fn new(idx: usize) -> Self {
Self {
value: UnsafeCell::new(MaybeUninit::uninit()),
state: AtomicUsize::new(idx),
}
}
}
unsafe impl<T: Sync> Sync for Slot<T> {}
// === impl Full ===
impl<T> Full<T> {
/// Unwraps the inner `T` value held by this error.
///
/// This method allows recovering the original message when sending to a
/// channel has failed.
pub fn into_inner(self) -> T {
self.0
}
}
impl<T> fmt::Debug for Full<T> {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
f.write_str("Full(..)")
}
}
impl<T> fmt::Display for Full<T> {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
f.write_str("queue at capacity")
}
}
#[cfg(feature = "std")]
impl<T> std::error::Error for Full<T> {}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn zero_len() {
const CAP: usize = 16;
let mut core = Core::new(CAP);
assert_eq!(core.len(), 0);
assert_eq!(core.capacity(), CAP);
// don't panic in drop impl.
core.has_dropped_slots = true;
}
#[test]
fn closed_channel_len() {
const CAP: usize = 16;
let mut core = Core::new(CAP);
core.close();
assert_eq!(core.len(), 0);
assert_eq!(core.capacity(), CAP);
// don't panic in drop impl.
core.has_dropped_slots = true;
}
#[test]
fn full_simple() {
const CAP: usize = 3;
let mut core = Core::new(CAP);
let slots: Box<[Slot<usize>]> = Slot::<usize>::make_boxed_array(CAP);
let recycle = recycling::DefaultRecycle::new();
core.push_ref(&slots, &recycle).unwrap();
core.push_ref(&slots, &recycle).unwrap();
core.push_ref(&slots, &recycle).unwrap();
assert!(matches!(
core.push_ref(&slots, &recycle),
Err(TrySendError::Full(()))
));
// don't panic in drop impl.
core.has_dropped_slots = true;
}
#[test]
fn full_read_and_write() {
const CAP: usize = 3;
let mut core = Core::new(CAP);
let slots: Box<[Slot<usize>]> = Slot::<usize>::make_boxed_array(CAP);
let recycle = recycling::DefaultRecycle::new();
core.push_ref(&slots, &recycle).unwrap();
core.push_ref(&slots, &recycle).unwrap();
core.push_ref(&slots, &recycle).unwrap();
core.pop_ref(&slots).unwrap();
core.pop_ref(&slots).unwrap();
core.push_ref(&slots, &recycle).unwrap();
core.push_ref(&slots, &recycle).unwrap();
assert!(matches!(
core.push_ref(&slots, &recycle),
Err(TrySendError::Full(()))
));
// don't panic in drop impl.
core.has_dropped_slots = true;
}
#[test]
fn full_with_skip() {
const CAP: usize = 3;
let mut core = Core::new(CAP);
let slots: Box<[Slot<usize>]> = Slot::<usize>::make_boxed_array(CAP);
let recycle = recycling::DefaultRecycle::new();
core.push_ref(&slots, &recycle).unwrap();
core.push_ref(&slots, &recycle).unwrap();
core.push_ref(&slots, &recycle).unwrap();
core.pop_ref(&slots).unwrap();
let _hold = core.pop_ref(&slots).unwrap();
core.pop_ref(&slots).unwrap();
core.push_ref(&slots, &recycle).unwrap();
core.push_ref(&slots, &recycle).unwrap();
core.pop_ref(&slots).unwrap();
core.push_ref(&slots, &recycle).unwrap();
assert!(matches!(
core.push_ref(&slots, &recycle),
Err(TrySendError::Full(()))
));
// don't panic in drop impl.
core.has_dropped_slots = true;
}
}