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
// Copyright (c) 2024-present, fjall-rs
// This source code is licensed under both the Apache 2.0 and MIT License
// (found in the LICENSE-* files in the repository)
use crate::keyspace::InternalKeyspaceId;
use core::ops::Bound;
use lsm_tree::Slice;
use std::{
collections::{BTreeMap, BTreeSet},
ops::RangeBounds,
sync::Mutex,
};
#[derive(Clone, Debug)]
enum Read {
Single(Slice),
Range {
start: Bound<Slice>,
end: Bound<Slice>,
},
All,
}
#[derive(Default, Debug)]
pub struct ConflictManager {
reads: Mutex<BTreeMap<InternalKeyspaceId, Vec<Read>>>,
conflict_keys: Mutex<BTreeMap<InternalKeyspaceId, BTreeSet<Slice>>>,
}
impl ConflictManager {
fn push_read(&self, keyspace_id: InternalKeyspaceId, read: Read) {
#[expect(clippy::expect_used)]
let mut lock = self.reads.lock().expect("lock is poisoned");
if let Some(tbl) = lock.get_mut(&keyspace_id) {
tbl.push(read);
} else {
lock.entry(keyspace_id).or_default().push(read);
}
}
pub fn mark_read(&self, keyspace_id: InternalKeyspaceId, key: Slice) {
self.push_read(keyspace_id, Read::Single(key));
}
pub fn mark_conflict(&self, keyspace_id: InternalKeyspaceId, key: Slice) {
#[expect(clippy::expect_used)]
let mut lock = self.conflict_keys.lock().expect("lock is poisoned");
if let Some(tbl) = lock.get_mut(&keyspace_id) {
tbl.insert(key);
} else {
lock.entry(keyspace_id).or_default().insert(key);
}
}
pub fn mark_range(&self, keyspace_id: InternalKeyspaceId, range: impl RangeBounds<Slice>) {
let start = match range.start_bound() {
Bound::Included(k) => Bound::Included(k.clone()),
Bound::Excluded(k) => Bound::Excluded(k.clone()),
Bound::Unbounded => Bound::Unbounded,
};
let end = match range.end_bound() {
Bound::Included(k) => Bound::Included(k.clone()),
Bound::Excluded(k) => Bound::Excluded(k.clone()),
Bound::Unbounded => Bound::Unbounded,
};
let read = if start == Bound::Unbounded && end == Bound::Unbounded {
Read::All
} else {
Read::Range { start, end }
};
self.push_read(keyspace_id, read);
}
#[expect(clippy::too_many_lines, clippy::significant_drop_tightening)]
pub fn has_conflict(&self, other: &Self) -> bool {
#[expect(clippy::expect_used)]
let reads_lock = self.reads.lock().expect("lock is poisoned");
#[expect(clippy::expect_used)]
let conflict_keys_lock = other.conflict_keys.lock().expect("lock is poisoned");
if reads_lock.is_empty() {
return false;
}
for (keyspace_name, keys) in &*reads_lock {
if let Some(other_conflict_keys) = conflict_keys_lock.get(keyspace_name) {
for ro in keys {
match ro {
Read::Single(k) => {
if other_conflict_keys.contains(k) {
return true;
}
}
Read::Range { start, end } => match (start, end) {
(Bound::Included(start), Bound::Included(end)) => {
if other_conflict_keys
.range::<Slice, _>((
Bound::Included(start),
Bound::Included(end),
))
.next()
.is_some()
{
return true;
}
}
(Bound::Included(start), Bound::Excluded(end)) => {
if other_conflict_keys
.range::<Slice, _>((
Bound::Included(start),
Bound::Excluded(end),
))
.next()
.is_some()
{
return true;
}
}
(Bound::Included(start), Bound::Unbounded) => {
if other_conflict_keys
.range::<Slice, _>((Bound::Included(start), Bound::Unbounded))
.next()
.is_some()
{
return true;
}
}
(Bound::Excluded(start), Bound::Included(end)) => {
if other_conflict_keys
.range::<Slice, _>((
Bound::Excluded(start),
Bound::Included(end),
))
.next()
.is_some()
{
return true;
}
}
(Bound::Excluded(start), Bound::Excluded(end)) => {
if other_conflict_keys
.range::<Slice, _>((
Bound::Excluded(start),
Bound::Excluded(end),
))
.next()
.is_some()
{
return true;
}
}
(Bound::Excluded(start), Bound::Unbounded) => {
if other_conflict_keys
.range::<Slice, _>((Bound::Excluded(start), Bound::Unbounded))
.next()
.is_some()
{
return true;
}
}
(Bound::Unbounded, Bound::Included(end)) => {
let range = ..=end;
for write in other_conflict_keys {
if range.contains(&write) {
return true;
}
}
}
(Bound::Unbounded, Bound::Excluded(end)) => {
let range = ..end;
for write in other_conflict_keys {
if range.contains(&write) {
return true;
}
}
}
(Bound::Unbounded, Bound::Unbounded) => unreachable!(),
},
Read::All => {
if !other_conflict_keys.is_empty() {
return true;
}
}
}
}
}
}
false
}
}