aeron 0.2.0

Aeron client library - fast messaging over UDP on Rust
Documentation 
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

/*
 * Copyright 2020 UT OVERSEAS INC
 *
 * 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
 *
 * https://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.
 */

use std::mem;
use std::sync::atomic::{fence, AtomicI64, Ordering};

use crate::utils::types::Index;

/// AtomicVec stores elements of type T and provides thread safe operations on Vec.
/// Atomic behavior provided on AtomicVec as a whole.
#[derive(Default)]
pub struct AtomicVec<T> {
    buf: Vec<T>,
    begin_change: AtomicI64,
    end_change: AtomicI64,
}

impl<T> AtomicVec<T> {
    pub fn new() -> Self {
        Self {
            buf: vec![],
            begin_change: AtomicI64::from(-1),
            end_change: AtomicI64::from(-1),
        }
    }

    pub fn load(&self) -> &Vec<T> {
        loop {
            let change_number = self.end_change.load(Ordering::Acquire);

            fence(Ordering::Acquire);

            // Only return Vec when begin and end sequence numbers are the same meaning that
            // parallel store() operation is fully completed.
            if change_number == self.begin_change.load(Ordering::Acquire) {
                return &self.buf;
            }
        }
    }

    pub fn load_mut(&mut self) -> &mut Vec<T> {
        loop {
            let change_number = self.end_change.load(Ordering::Acquire);

            fence(Ordering::Acquire);

            if change_number == self.begin_change.load(Ordering::Acquire) {
                return &mut self.buf;
            }
        }
    }

    pub fn store(&mut self, new_value: Vec<T>) {
        // Compute next change seq number
        let seq_no = self.begin_change.load(Ordering::Acquire).wrapping_add(1);
        self.begin_change.store(seq_no, Ordering::Release);

        self.buf = new_value;

        self.end_change.store(seq_no, Ordering::Release);
    }

    pub fn take(&mut self) -> Vec<T> {
        loop {
            let change_number = self.end_change.load(Ordering::Acquire);

            fence(Ordering::Acquire);

            if change_number == self.begin_change.load(Ordering::Acquire) {
                let seq_no = self.begin_change.load(Ordering::Acquire).wrapping_add(1);
                self.begin_change.store(seq_no, Ordering::Release);

                let buf = mem::take(&mut self.buf);
                *self = Self::new();

                self.end_change.store(seq_no, Ordering::Release);

                return buf;
            }
        }
    }
}

impl<T: Clone> AtomicVec<T> {
    pub fn load_val(&mut self) -> Vec<T> {
        loop {
            let change_number = self.end_change.load(Ordering::Acquire);

            fence(Ordering::Acquire);

            if change_number == self.begin_change.load(Ordering::Acquire) {
                let tmp_vec = self.buf.clone();
                return tmp_vec;
            }
        }
    }

    pub fn add(&mut self, item: T) -> Vec<T> {
        let old_vec = self.load().clone();
        let mut new_vec = old_vec.clone();

        new_vec.push(item);

        self.store(new_vec);

        old_vec
    }

    /// Removes first element for which matching_fn returns true.
    /// Returns tuple (OldVector, position_of_deleted_item)
    pub fn remove(&mut self, matching_fn: impl Fn(&mut T) -> bool) -> Option<(Vec<T>, Index)> {
        let mut old_vec = self.load().clone();
        let mut new_vec = old_vec.clone();

        for (index, item) in old_vec.iter_mut().enumerate() {
            if matching_fn(item) {
                new_vec.remove(index);
                self.store(new_vec);
                return Some((old_vec, index as Index));
            }
        }

        None
    }
}