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
#![feature(alloc)]
use std::ptr::null_mut;
use std::sync::atomic::{AtomicPtr, Ordering};
use std::boxed;
use std::default::Default;
use std::iter::IntoIterator;
struct ListElement<T> {
next: AtomicPtr<ListElement<T>>,
it: T,
}
pub struct ListIter<'a, T: 'a> {
next: &'a AtomicPtr<ListElement<T>>,
}
pub struct List<T> {
head: AtomicPtr<ListElement<T>>,
}
unsafe impl<T> Sync for List<T> where T: Send {}
unsafe impl<T> Send for List<T> where T: Send {}
unsafe impl<T> Sync for ListElement<T> where T: Send {}
unsafe impl<T> Send for ListElement<T> where T: Send {}
impl<T> List<T> {
pub fn new() -> List<T> {
List { head: AtomicPtr::new(null_mut()) }
}
pub fn iter<'a>(&'a self) -> ListIter<'a, T> {
return ListIter { next: &self.head };
}
pub fn prepend(&self, it: T) {
unsafe {
let next = boxed::into_raw(Box::new(ListElement {
it: it,
next: AtomicPtr::new(null_mut()),
}));
loop {
let head_snapshot = self.head.load(Ordering::Acquire);
(*next).next.store(head_snapshot, Ordering::Release);
let old_val = self.head.compare_and_swap(
head_snapshot,
next,
Ordering::Release);
if old_val == head_snapshot {
return
}
}
}
}
}
impl<T: PartialEq> List<T> {
pub fn remove(&self, it: T) -> bool {
let mut ptr = &self.head;
loop {
let before = ptr.load(Ordering::Acquire);
if before == null_mut() {
return false
}
unsafe {
if (*before).it == it {
let after = (*before).next.load(Ordering::Acquire);
let old_val = ptr.compare_and_swap(
before,
after,
Ordering::Release);
if old_val == before {
Box::from_raw(before);
return true;
}
} else {
ptr = &(*before).next;
}
}
}
}
}
impl<T> Drop for List<T> {
fn drop(&mut self) {
let mut tail = self.head.swap(null_mut(), Ordering::Release);
while tail != null_mut() {
let recl = unsafe { Box::from_raw(tail) };
tail = recl.next.load(Ordering::Acquire);
}
}
}
impl<'a, T> IntoIterator for &'a List<T> {
type Item = &'a T;
type IntoIter = ListIter<'a, T>;
fn into_iter(self) -> Self::IntoIter {
self.iter()
}
}
impl<'a, T> Iterator for ListIter<'a, T> {
type Item = &'a T;
fn next(&mut self) -> Option<&'a T> {
let n = self.next.load(Ordering::Acquire);
if n == null_mut() {
return None;
} else {
unsafe {
self.next = &(*n).next;
return Some(&(*n).it);
}
}
}
}
impl<T> Default for List<T> {
fn default() -> List<T> {
List::new()
}
}