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
use crate::{
cache::{BlockInfo, CacheTracker, WriteInfo},
cidbytes::CidBytes,
db::*,
Block, BlockStore, Result, StoreStats, TempPin,
};
use fnv::FnvHashSet;
use libipld::{cid, codec::References, store::StoreParams, Cid, Ipld};
use parking_lot::Mutex;
use std::{
collections::HashSet, convert::TryFrom, iter::FromIterator, marker::PhantomData, mem,
sync::Arc, time::Duration,
};
pub struct Transaction<'a, S> {
inner: &'a mut rusqlite::Connection,
info: TransactionInfo,
expired_temp_pins: Arc<Mutex<Vec<i64>>>,
_s: PhantomData<S>,
}
struct TransactionInfo {
written: Vec<WriteInfo>,
accessed: Vec<BlockInfo>,
committed: bool,
tracker: Arc<dyn CacheTracker>,
}
impl Drop for TransactionInfo {
fn drop(&mut self) {
if !self.accessed.is_empty() {
let blocks = mem::take(&mut self.accessed);
self.tracker.blocks_accessed(blocks);
}
if self.committed && !self.written.is_empty() {
let blocks = mem::take(&mut self.written);
self.tracker.blocks_written(blocks);
}
}
}
impl<'a, S> Transaction<'a, S>
where
S: StoreParams,
Ipld: References<S::Codecs>,
{
pub(crate) fn new(owner: &'a mut BlockStore<S>) -> Self {
Self {
inner: &mut owner.conn,
info: TransactionInfo {
written: Vec::new(),
accessed: Vec::new(),
committed: false,
tracker: owner.config.cache_tracker.clone(),
},
expired_temp_pins: owner.expired_temp_pins.clone(),
_s: PhantomData,
}
}
pub fn alias(&mut self, name: impl AsRef<[u8]>, link: Option<&Cid>) -> Result<()> {
let link: Option<CidBytes> = link.map(CidBytes::try_from).transpose()?;
in_txn(self.inner, None, move |txn| {
alias(txn, name.as_ref(), link.as_ref())
})?;
Ok(())
}
pub fn reverse_alias(&mut self, cid: &Cid) -> Result<Option<HashSet<Vec<u8>>>> {
let cid = CidBytes::try_from(cid)?;
in_txn(self.inner, None, move |txn| {
reverse_alias(txn, cid.as_ref())
})
}
pub fn resolve(&mut self, name: impl AsRef<[u8]>) -> Result<Option<Cid>> {
in_txn(self.inner, None, move |txn| {
resolve::<CidBytes>(txn, name.as_ref())?
.map(|c| Cid::try_from(&c))
.transpose()
.map_err(Into::into)
})
}
pub fn temp_pin(&mut self) -> TempPin {
TempPin::new(self.expired_temp_pins.clone())
}
pub fn extend_temp_pin(&mut self, pin: &mut TempPin, link: &Cid) -> Result<()> {
let link = CidBytes::try_from(link)?;
in_txn(self.inner, None, move |txn| {
extend_temp_pin(txn, pin, vec![link])
})?;
Ok(())
}
pub fn has_cid(&mut self, cid: &Cid) -> Result<bool> {
let cid = CidBytes::try_from(cid)?;
in_txn(self.inner, None, move |txn| has_cid(txn, cid))
}
pub fn has_block(&mut self, cid: &Cid) -> Result<bool> {
let cid = CidBytes::try_from(cid)?;
in_txn(self.inner, None, move |txn| has_block(txn, cid))
}
pub fn get_known_cids<C: FromIterator<Cid>>(&mut self) -> Result<C> {
let res = in_txn(self.inner, None, move |txn| get_known_cids::<CidBytes>(txn))?;
let res = res.iter().map(Cid::try_from).collect::<cid::Result<C>>()?;
Ok(res)
}
pub fn get_block_cids<C: FromIterator<Cid>>(&mut self) -> Result<C> {
let res = in_txn(self.inner, None, move |txn| get_block_cids::<CidBytes>(txn))?;
let res = res.iter().map(Cid::try_from).collect::<cid::Result<C>>()?;
Ok(res)
}
pub fn get_descendants<C: FromIterator<Cid>>(&mut self, cid: &Cid) -> Result<C> {
let cid = CidBytes::try_from(cid)?;
let res = in_txn(self.inner, None, move |txn| get_descendants(txn, cid))?;
let res = res.iter().map(Cid::try_from).collect::<cid::Result<C>>()?;
Ok(res)
}
pub fn get_missing_blocks<C: FromIterator<Cid>>(&mut self, cid: &Cid) -> Result<C> {
let cid = CidBytes::try_from(cid)?;
let result = in_txn(
self.inner,
Some(("get_missing_blocks", Duration::from_millis(10))),
|txn| get_missing_blocks(txn, cid),
)?;
let res = result
.iter()
.map(Cid::try_from)
.collect::<cid::Result<C>>()?;
Ok(res)
}
pub fn aliases<C: FromIterator<(Vec<u8>, Cid)>>(&mut self) -> Result<C> {
let result: Vec<(Vec<u8>, CidBytes)> = in_txn(self.inner, None, move |txn| aliases(txn))?;
let res = result
.into_iter()
.map(|(alias, cid)| {
let cid = Cid::try_from(&cid)?;
Ok((alias, cid))
})
.collect::<cid::Result<C>>()?;
Ok(res)
}
pub fn put_block(&mut self, block: &Block<S>, mut pin: Option<&mut TempPin>) -> Result<()> {
let cid_bytes = CidBytes::try_from(block.cid())?;
let mut links = Vec::new();
block.references(&mut links)?;
let links = links
.iter()
.map(CidBytes::try_from)
.collect::<std::result::Result<FnvHashSet<_>, cid::Error>>()?;
let res = in_txn(
self.inner,
Some(("put block", Duration::from_millis(100))),
move |txn| {
put_block(
txn,
&cid_bytes,
block.data(),
links.iter().copied(),
pin.as_deref_mut(),
)
},
)?;
let write_info = WriteInfo::new(
BlockInfo::new(res.id, block.cid(), block.data().len()),
res.block_exists,
);
self.info.written.push(write_info);
Ok(())
}
pub fn get_block(&mut self, cid: &Cid) -> Result<Option<Vec<u8>>> {
let response = in_txn(self.inner, None, move |txn| {
get_block(txn, &CidBytes::try_from(cid)?)
})?;
if let Some(info) = response
.as_ref()
.map(|(id, data)| BlockInfo::new(*id, cid, data.len()))
{
self.info.accessed.push(info);
}
Ok(response.map(|(_id, data)| data))
}
pub fn get_store_stats(&mut self) -> Result<StoreStats> {
in_txn(self.inner, None, move |txn| get_store_stats(txn))
}
pub fn commit(mut self) -> Result<()> {
self.info.committed = true;
Ok(())
}
}