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
// This file is part of cc-queue. It is subject to the license terms in the COPYRIGHT file found in the top-level directory of this distribution and at https://raw.githubusercontent.com/lemonrock/cc-queue/master/COPYRIGHT. No part of cc-queue, including this file, may be copied, modified, propagated, or distributed except according to the terms contained in the COPYRIGHT file.
// Copyright © 2018 The developers of cc-queue. See the COPYRIGHT file in the top-level directory of this distribution and at https://raw.githubusercontent.com/lemonrock/cc-queue/master/COPYRIGHT.
//! # cc-queue
//! A CC Queue, which is:-
//! * Non-blocking
//! * Thread-safe
//! * Concurrent
//! * Unbounded
//! * Faster than the MSQueue (Michael-Scott Queue, as used in Java)
//!
//! And suitable for use with multiple memory allocators, including ones that use persistent memory.
//!
//! ## To use it
//! 1. Create a new instance of `CCQueue`.
//! 2. Create a handle per-thread using `CCQueue.new_per_thread_handle()`.
//! 3. Enqueue and dequeue
//!
//! ## Notes on the API
//! The API may need to change to make it easier to manage the per-thread handle objects.
//!
use *;
use UnsafeCell;
use transmute;
use transmute_copy;
use drop_in_place;
use NonNull;
use null_mut;
use write;
use AtomicPtr;
use AtomicU32;
use AcqRel;
use Acquire;
use Release;
use spin_loop_hint as PAUSE;
/// Allocators allow customization of the backing memory used by this queue.
/// One use case is to be able to use persistent memory.
include!;
include!;
include!;
include!;
include!;
include!;
include!;
include!;
include!;
include!;