/
storage.rs
839 lines (800 loc) · 29.8 KB
/
storage.rs
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
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
#![cfg_attr(feature = "cargo-clippy", allow(needless_pass_by_value))]
use adler32;
use byteorder::{BigEndian, ByteOrder};
use cannyls::deadline::Deadline;
use cannyls::lump::LumpData;
use cannyls_rpc::Client as CannyLsClient;
use cannyls_rpc::DeviceId;
use ecpool::liberasurecode::LibErasureCoderBuilder;
use ecpool::ErasureCoderPool;
use fibers::time::timer;
use fibers_rpc::client::{ClientServiceHandle as RpcServiceHandle, Options as RpcOptions};
use frugalos_raft::NodeId;
use futures::future;
use futures::{self, Async, Future, Poll};
use libfrugalos::entity::object::ObjectVersion;
use rustracing::tag::{StdTag, Tag};
use rustracing_jaeger::span::{Span, SpanHandle};
use slog::Logger;
use std::mem;
use std::num::NonZeroUsize;
use std::sync::Arc;
use std::time::Duration;
use trackable::error::ErrorKindExt;
use config::{ClientConfig, ClusterConfig, ClusterMember, DispersedConfig, ReplicatedConfig};
use util::Phase;
use {Error, ErrorKind, ObjectValue, Result};
type BoxFuture<T> = Box<Future<Item = T, Error = Error> + Send + 'static>;
// TODO: パラメータ化
const CANNYLS_MAX_QUEUE_LEN: usize = 4096;
const RPC_MAX_QUEUE_LEN: u64 = 512;
#[derive(Clone)]
pub enum StorageClient {
Metadata,
Replicated(ReplicatedClient),
Dispersed(DispersedClient),
}
impl StorageClient {
pub fn new(
logger: Logger,
config: ClientConfig,
rpc_service: RpcServiceHandle,
ec: Option<ErasureCoder>,
) -> Self {
use config::Storage;
match config.storage {
Storage::Metadata => StorageClient::Metadata,
Storage::Replicated(c) => {
StorageClient::Replicated(ReplicatedClient::new(config.cluster, c, rpc_service))
}
Storage::Dispersed(c) => StorageClient::Dispersed(DispersedClient::new(
logger,
config.cluster,
c,
rpc_service,
ec,
)),
}
}
pub fn is_metadata(&self) -> bool {
if let StorageClient::Metadata = *self {
true
} else {
false
}
}
pub fn get_fragment(self, local_node: NodeId, version: ObjectVersion) -> GetFragment {
match self {
StorageClient::Metadata => GetFragment::Failed(futures::failed(
ErrorKind::Other.cause("unreachable").into(),
)),
StorageClient::Replicated(c) => {
GetFragment::Replicated(c.get_fragment(local_node, version))
}
StorageClient::Dispersed(c) => {
GetFragment::Dispersed(c.get_fragment(local_node, version))
}
}
}
pub fn get(
self,
object: ObjectValue,
deadline: Deadline,
parent: SpanHandle,
) -> BoxFuture<Vec<u8>> {
match self {
StorageClient::Metadata => Box::new(futures::finished(object.content)),
StorageClient::Replicated(c) => c.get(object.version, deadline),
StorageClient::Dispersed(c) => c.get(object.version, deadline, parent),
}
}
pub fn put(
self,
version: ObjectVersion,
content: Vec<u8>,
deadline: Deadline,
parent: SpanHandle,
) -> BoxFuture<()> {
match self {
StorageClient::Metadata => Box::new(futures::finished(())),
StorageClient::Replicated(c) => c.put(version, content, deadline),
StorageClient::Dispersed(c) => c.put(version, content, deadline, parent),
}
}
}
#[derive(Debug, Clone)]
pub struct ReplicatedClient {
cluster: Arc<ClusterConfig>,
config: ReplicatedConfig,
rpc_service: RpcServiceHandle,
}
impl ReplicatedClient {
pub fn new(
cluster: ClusterConfig,
config: ReplicatedConfig,
rpc_service: RpcServiceHandle,
) -> Self {
ReplicatedClient {
cluster: Arc::new(cluster),
config,
rpc_service,
}
}
pub fn get_fragment(
self,
_local_node: NodeId,
version: ObjectVersion,
) -> GetReplicatedFragment {
// TODO: `_local_node`は問い合わせ候補から外す(必ず失敗するので)
let future = self.get(version, Deadline::Infinity);
GetReplicatedFragment(future)
}
pub fn get(self, version: ObjectVersion, deadline: Deadline) -> BoxFuture<Vec<u8>> {
let replica = self.config.tolerable_faults as usize + 1;
let mut candidates = self
.cluster
.candidates(version)
.take(replica)
.cloned()
.collect::<Vec<_>>();
candidates.reverse();
let future = ReplicatedGet {
version,
deadline,
candidates,
rpc_service: self.rpc_service,
future: Box::new(futures::finished(None)),
};
Box::new(future)
}
pub fn put(
self,
version: ObjectVersion,
mut content: Vec<u8>,
deadline: Deadline,
) -> BoxFuture<()> {
let rpc_service = self.rpc_service;
let replica = self.config.tolerable_faults as usize + 1;
append_checksum(&mut content);
let data = match track!(LumpData::new(content)) {
Ok(data) => data,
Err(error) => return Box::new(futures::failed(Error::from(error))),
};
let futures = self
.cluster
.candidates(version)
.take(replica)
.map(move |m| {
let client = CannyLsClient::new(m.node.addr, rpc_service.clone());
let mut request = client.request();
request.rpc_options(RpcOptions {
max_queue_len: Some(RPC_MAX_QUEUE_LEN),
..Default::default()
});
let device_id = DeviceId::new(m.device.clone());
let lump_id = m.make_lump_id(version);
let future: BoxFuture<_> = Box::new(
request
.deadline(deadline)
.max_queue_len(CANNYLS_MAX_QUEUE_LEN)
.put_lump(device_id, lump_id, data.clone())
.map(|_is_new| ())
.map_err(|e| track!(Error::from(e))),
);
future
});
Box::new(PutAll::new(futures, 1))
}
}
pub struct ReplicatedGet {
version: ObjectVersion,
deadline: Deadline,
candidates: Vec<ClusterMember>,
future: BoxFuture<Option<Vec<u8>>>,
rpc_service: RpcServiceHandle,
}
impl Future for ReplicatedGet {
type Item = Vec<u8>;
type Error = Error;
fn poll(&mut self) -> Poll<Self::Item, Self::Error> {
loop {
match self.future.poll() {
Err(e) => {
if self.candidates.is_empty() {
return Err(track!(e));
}
self.future = Box::new(futures::finished(None))
}
Ok(Async::Ready(None)) => {
let m = track!(
self.candidates
.pop()
.ok_or_else(|| ErrorKind::Corrupted.error(),)
)?;
let client = CannyLsClient::new(m.node.addr, self.rpc_service.clone());
let mut request = client.request();
request.rpc_options(RpcOptions {
max_queue_len: Some(RPC_MAX_QUEUE_LEN),
..Default::default()
});
let lump_id = m.make_lump_id(self.version);
let future = request
.deadline(self.deadline)
.get_lump(DeviceId::new(m.device), lump_id);
self.future = Box::new(future.map_err(|e| track!(Error::from(e))));
}
Ok(Async::Ready(Some(mut content))) => {
if let Err(e) = track!(verify_and_remove_checksum(&mut content)) {
if self.candidates.is_empty() {
return Err(track!(e));
}
self.future = Box::new(futures::finished(None));
} else {
return Ok(Async::Ready(content));
}
}
Ok(Async::NotReady) => break,
}
}
Ok(Async::NotReady)
}
}
pub struct PutAll {
future: future::SelectAll<BoxFuture<()>>,
ok_count: usize,
required_ok_count: usize,
}
impl PutAll {
pub fn new<I>(futures: I, required_ok_count: usize) -> Self
where
I: Iterator<Item = BoxFuture<()>>,
{
let future = future::select_all(futures);
PutAll {
future,
ok_count: 0,
required_ok_count,
}
}
}
impl Future for PutAll {
type Item = ();
type Error = Error;
fn poll(&mut self) -> Poll<Self::Item, Self::Error> {
loop {
let remainings = match self.future.poll() {
Err((e, _, remainings)) => {
if remainings.is_empty() && self.ok_count < self.required_ok_count {
return Err(track!(e));
}
remainings
}
Ok(Async::Ready(((), _, remainings))) => {
self.ok_count += 1;
if self.ok_count >= self.required_ok_count {
// TODO: パラメータ化
return Ok(Async::Ready(()));
}
remainings
}
Ok(Async::NotReady) => break,
};
if remainings.is_empty() {
return Ok(Async::Ready(()));
}
self.future = future::select_all(remainings);
}
Ok(Async::NotReady)
}
}
/// ErasureCodingのエンコーダ・デコーダの型。
pub type ErasureCoder = ErasureCoderPool<LibErasureCoderBuilder>;
/// `ErasureCoder`を構築するための補助関数。
pub fn build_ec(data_fragments: usize, parity_fragments: usize) -> ErasureCoder {
let data_fragments = NonZeroUsize::new(data_fragments).expect("TODO: handle error");
let parity_fragments = NonZeroUsize::new(parity_fragments).expect("TODO: hanlde error");
let builder = LibErasureCoderBuilder::new(data_fragments, parity_fragments);
ErasureCoderPool::new(builder)
}
#[derive(Clone)]
pub struct DispersedClient {
logger: Logger,
cluster: Arc<ClusterConfig>,
config: DispersedConfig,
data_fragments: usize,
ec: ErasureCoder,
rpc_service: RpcServiceHandle,
}
impl DispersedClient {
pub fn new(
logger: Logger,
cluster: ClusterConfig,
config: DispersedConfig,
rpc_service: RpcServiceHandle,
ec: Option<ErasureCoder>,
) -> Self {
let parity_fragments = config.tolerable_faults as usize;
let data_fragments = config.fragments as usize - parity_fragments;
let ec = ec.unwrap_or_else(|| build_ec(data_fragments, parity_fragments));
DispersedClient {
logger,
cluster: Arc::new(cluster),
config,
ec,
data_fragments,
rpc_service,
}
}
pub fn get_fragment(self, local_node: NodeId, version: ObjectVersion) -> GetDispersedFragment {
let mut spares = self
.cluster
.candidates(version)
.filter(|m| m.node != local_node)
.cloned()
.collect::<Vec<_>>();
spares.reverse();
// let spares = self.cluster
// .members
// .iter()
// .filter(|m| m.node != local_node)
// .cloned()
// .collect::<Vec<_>>();
let missing_index = self
.cluster
.candidates(version)
.position(|m| m.node == local_node)
.expect("TOOD");
debug!(
self.logger,
"get_fragment: version={:?}, index={}, spares={:?}", version, missing_index, spares
);
// rand::thread_rng().shuffle(&mut spares);
let dummy: BoxFuture<_> = Box::new(futures::finished(None));
let future = CollectFragments {
logger: self.logger.clone(),
futures: vec![dummy],
fragments: Vec::new(),
data_fragments: self.data_fragments,
spares,
version,
deadline: Deadline::Infinity,
rpc_service: self.rpc_service,
parent: Span::inactive().handle(), // TODO
timeout: None,
};
GetDispersedFragment {
phase: Phase::A(future),
ec: self.ec.clone(),
missing_index,
}
}
pub fn get(
self,
version: ObjectVersion,
deadline: Deadline,
parent: SpanHandle,
) -> BoxFuture<Vec<u8>> {
let mut spares = self
.cluster
.candidates(version)
.cloned()
.collect::<Vec<_>>();
spares.reverse();
// rand::thread_rng().shuffle(&mut spares);
let dummy: BoxFuture<_> = Box::new(futures::finished(None));
let span = parent.child("get_content", |span| {
span.tag(StdTag::component(module_path!()))
.tag(Tag::new("object.version", version.0 as i64))
.tag(Tag::new("storage.type", "dispersed"))
.start()
});
let future = CollectFragments {
logger: self.logger.clone(),
futures: vec![dummy],
fragments: Vec::new(),
data_fragments: self.data_fragments,
spares,
version,
deadline,
rpc_service: self.rpc_service,
parent: span.handle(),
timeout: Some(timer::timeout(Duration::from_secs(2))), // TODO: ハードコーディングは止める
};
Box::new(DispersedGet {
phase: Phase::A(future),
ec: self.ec.clone(),
span,
})
}
pub fn put(
self,
version: ObjectVersion,
content: Vec<u8>,
deadline: Deadline,
parent: SpanHandle,
) -> BoxFuture<()> {
let span = parent.child("put_content", |span| {
span.tag(StdTag::component(module_path!()))
.tag(Tag::new("object.version", version.0 as i64))
.tag(Tag::new("storage.type", "dispersed"))
.start()
});
let mut child = span.child("ec_encode", |span| {
span.tag(StdTag::component(module_path!())).start()
});
let future = self
.ec
.encode(content)
.map_err(|e| track!(Error::from(e)))
.then(move |result| {
if let Err(ref e) = result {
child.set_tag(StdTag::error);
child.log(|log| {
log.error().message(e.to_string());
});
}
result
});
Box::new(DispersedPut {
cluster: self.cluster.clone(),
version,
deadline,
data_fragments: self.data_fragments,
rpc_service: self.rpc_service,
phase: Phase::A(Box::new(future)),
parent: span,
})
}
}
pub struct DispersedPut {
cluster: Arc<ClusterConfig>,
version: ObjectVersion,
deadline: Deadline,
data_fragments: usize,
rpc_service: RpcServiceHandle,
phase: Phase<BoxFuture<Vec<Vec<u8>>>, PutAll>,
parent: Span,
}
impl Future for DispersedPut {
type Item = ();
type Error = Error;
fn poll(&mut self) -> Poll<Self::Item, Self::Error> {
while let Async::Ready(phase) = track!(self.phase.poll().map_err(Error::from))? {
let next = match phase {
Phase::A(fragments) => {
let parent = self.parent.handle();
let version = self.version;
let deadline = self.deadline;
let rpc_service = self.rpc_service.clone();
let futures = self
.cluster
.candidates(self.version)
.zip(fragments.into_iter())
.map(move |(m, mut content)| {
append_checksum(&mut content);
let client = CannyLsClient::new(m.node.addr, rpc_service.clone());
let mut request = client.request();
request.rpc_options(RpcOptions {
max_queue_len: Some(RPC_MAX_QUEUE_LEN),
..Default::default()
});
let device_id = m.device.clone();
let lump_id = m.make_lump_id(version);
let data = match track!(LumpData::new(content)) {
Ok(data) => data,
Err(error) => {
let future: BoxFuture<_> =
Box::new(futures::failed(Error::from(error)));
return future;
}
};
let mut span = parent.child("put_fragment", |span| {
span.tag(StdTag::component(module_path!()))
.tag(StdTag::span_kind("client"))
.tag(StdTag::peer_ip(m.node.addr.ip()))
.tag(StdTag::peer_port(m.node.addr.port()))
.tag(Tag::new("node", m.node.local_id.to_string()))
.tag(Tag::new("device.id", device_id.clone()))
.tag(Tag::new("lump.id", lump_id.to_string()))
.tag(Tag::new("lump.bytes", data.as_bytes().len() as i64))
.start()
});
let future: BoxFuture<_> = Box::new(
request
.deadline(deadline)
.max_queue_len(CANNYLS_MAX_QUEUE_LEN)
.put_lump(DeviceId::new(device_id), lump_id, data)
.map(|_is_new| ())
.map_err(|e| track!(Error::from(e)))
.then(move |result| {
if let Err(ref e) = result {
span.set_tag(StdTag::error);
span.log(|log| {
log.error().message(e.to_string());
});
}
result
}),
);
future
});
Phase::B(PutAll::new(futures, self.data_fragments))
}
Phase::B(()) => {
return Ok(Async::Ready(()));
}
};
self.phase = next;
}
Ok(Async::NotReady)
}
}
pub struct DispersedGet {
phase: Phase<CollectFragments, BoxFuture<Vec<u8>>>,
ec: ErasureCoderPool<LibErasureCoderBuilder>,
span: Span,
}
impl Future for DispersedGet {
type Item = Vec<u8>;
type Error = Error;
fn poll(&mut self) -> Poll<Self::Item, Self::Error> {
while let Async::Ready(phase) = track!(self.phase.poll().map_err(Error::from))? {
let next = match phase {
Phase::A(fragments) => {
let mut child = self.span.child("ec_decode", |span| {
span.tag(StdTag::component(module_path!()))
.tag(Tag::new(
"fragments.bytes",
fragments.iter().map(|f| f.len()).sum::<usize>() as i64,
)).start()
});
let future: BoxFuture<_> = Box::new(
self.ec
.decode(fragments)
.map_err(|e| track!(Error::from(e)))
.then(move |result| {
if let Err(ref e) = result {
child.set_tag(StdTag::error);
child.log(|log| {
log.error().message(e.to_string());
});
}
result
}),
);
Phase::B(future)
}
Phase::B(content) => return Ok(Async::Ready(content)),
};
self.phase = next;
}
Ok(Async::NotReady)
}
}
pub struct CollectFragments {
logger: Logger,
futures: Vec<BoxFuture<Option<Vec<u8>>>>,
fragments: Vec<Vec<u8>>,
data_fragments: usize,
spares: Vec<ClusterMember>,
version: ObjectVersion,
deadline: Deadline,
rpc_service: RpcServiceHandle,
parent: SpanHandle,
// フラグメント群の取得のタイムアウト時間
//
// 基本的にはディスクI/O負荷を抑えるために、
// 必要最小限のフラグメントのみを取得しようと試みるが、
// タイムアウト時間に達した場合には、
// 極度に遅延しているディスクがあるものと判断して、
// 取得候補を増やすことになる。
//
// TODO: リクエスト数が多い場合にはRPCレベルでの遅延防止処理がある旨を記述する
//
// TODO: `deadline`を考慮した値を使うようにする
timeout: Option<timer::Timeout>,
}
impl CollectFragments {
fn fill_shortage_from_spare(&mut self, mut force: bool) -> Result<()> {
while force || self.futures.len() + self.fragments.len() < self.data_fragments {
force = false;
let m = track!(
self.spares
.pop()
.ok_or_else(|| ErrorKind::Corrupted.error(),)
)?;
let client = CannyLsClient::new(m.node.addr, self.rpc_service.clone());
let lump_id = m.make_lump_id(self.version);
debug!(
self.logger,
"[CollectFragments({},{},{}/{})] candidate={:?}, lump_id={:?}",
self.spares.len(),
self.futures.len(),
self.fragments.len(),
self.data_fragments,
m.node,
lump_id
);
let mut span = self.parent.child("collect_fragment", |span| {
span.tag(StdTag::component(module_path!()))
.tag(StdTag::span_kind("client"))
.tag(StdTag::peer_ip(m.node.addr.ip()))
.tag(StdTag::peer_port(m.node.addr.port()))
.tag(Tag::new("device", m.device.clone()))
.tag(Tag::new("lump", format!("{:?}", lump_id)))
.start()
});
let mut request = client.request();
request.rpc_options(RpcOptions {
max_queue_len: Some(RPC_MAX_QUEUE_LEN),
..Default::default()
});
let future = request
.deadline(self.deadline)
.get_lump(DeviceId::new(m.device), lump_id)
.then(move |result| {
if let Err(ref e) = result {
span.set_tag(StdTag::error);
span.log(|log| {
let kind = format!("{:?}", e.kind());
log.error().kind(kind).message(e.to_string());
});
}
result
});
let future: BoxFuture<_> = Box::new(future.map_err(|e| track!(Error::from(e))));
self.futures.push(future);
}
Ok(())
}
}
impl Future for CollectFragments {
type Item = Vec<Vec<u8>>;
type Error = Error;
fn poll(&mut self) -> Poll<Self::Item, Self::Error> {
loop {
let mut i = 0;
while i < self.futures.len() {
match track!(self.futures[i].poll()) {
Err(e) => {
self.futures.swap_remove(i);
debug!(self.logger, "[CollectFragments] Error: {}", e);
track!(self.fill_shortage_from_spare(false), "Last error: {}", e)?;
}
Ok(Async::NotReady) => {
i += 1;
}
Ok(Async::Ready(fragment)) => {
self.futures.swap_remove(i);
if let Some(mut fragment) = fragment {
if let Err(e) = track!(verify_and_remove_checksum(&mut fragment)) {
// TODO: Add protection for log overflow
warn!(self.logger, "[CollectFragments] Corrupted fragment: {}", e);
track!(self.fill_shortage_from_spare(false))?;
} else {
self.fragments.push(fragment);
}
} else {
debug!(self.logger, "[CollectFragments] NotFound");
track!(self.fill_shortage_from_spare(false))?;
}
}
}
}
if self.fragments.len() == self.data_fragments {
return Ok(Async::Ready(mem::replace(&mut self.fragments, Vec::new())));
}
if let Ok(Async::Ready(Some(()))) = self.timeout.poll() {
// TODO: ログは出さなくする(かわりにprometheusを使う)
info!(
self.logger,
"Collecting fragments timeout expired: add new candidate"
);
self.timeout = None;
if !self.spares.is_empty() {
if let Err(e) = track!(self.fill_shortage_from_spare(true)) {
warn!(self.logger, "{}", e);
} else {
self.timeout = Some(timer::timeout(Duration::from_secs(2)));
continue;
}
}
}
break;
}
Ok(Async::NotReady)
}
}
#[cfg_attr(feature = "cargo-clippy", allow(large_enum_variant))]
pub enum GetFragment {
Failed(future::Failed<Vec<u8>, Error>),
Replicated(GetReplicatedFragment),
Dispersed(GetDispersedFragment),
}
impl Future for GetFragment {
type Item = Vec<u8>;
type Error = Error;
fn poll(&mut self) -> Poll<Self::Item, Self::Error> {
match *self {
GetFragment::Failed(ref mut f) => track!(f.poll()),
GetFragment::Replicated(ref mut f) => track!(f.poll()),
GetFragment::Dispersed(ref mut f) => track!(f.poll()),
}
}
}
pub struct GetReplicatedFragment(BoxFuture<Vec<u8>>);
impl Future for GetReplicatedFragment {
type Item = Vec<u8>;
type Error = Error;
fn poll(&mut self) -> Poll<Self::Item, Self::Error> {
track!(self.0.poll())
}
}
pub struct GetDispersedFragment {
phase: Phase<CollectFragments, BoxFuture<Vec<u8>>>,
ec: ErasureCoderPool<LibErasureCoderBuilder>,
missing_index: usize,
}
impl Future for GetDispersedFragment {
type Item = Vec<u8>;
type Error = Error;
fn poll(&mut self) -> Poll<Self::Item, Self::Error> {
while let Async::Ready(phase) = track!(self.phase.poll().map_err(Error::from))? {
let next = match phase {
Phase::A(fragments) => {
let future = self.ec.reconstruct(self.missing_index, fragments);
let future: BoxFuture<_> = Box::new(future.map_err(|e| track!(Error::from(e))));
Phase::B(future)
}
Phase::B(fragment) => return Ok(Async::Ready(fragment)),
};
self.phase = next;
}
Ok(Async::NotReady)
}
}
pub(crate) fn append_checksum(bytes: &mut Vec<u8>) {
let checksum = adler32::adler32(&bytes[..]).expect("Never fails");
let mut trailer = [0; 5]; // TODO: フォーマットを文書化
BigEndian::write_u32(&mut trailer[..], checksum);
bytes.extend_from_slice(&trailer[..]);
}
fn verify_and_remove_checksum(bytes: &mut Vec<u8>) -> Result<()> {
track_assert!(bytes.len() >= 5, ErrorKind::Invalid);
let split_pos = bytes.len() - 5;
let checksum = adler32::adler32(&bytes[..split_pos]).expect("Never fails");
let expected = BigEndian::read_u32(&bytes[split_pos..]);
track_assert_eq!(checksum, expected, ErrorKind::Invalid);
bytes.truncate(split_pos);
Ok(())
}
#[cfg(test)]
mod tests {
use super::*;
use test_util::tests::{setup_system, wait, System};
use trackable::result::TestResult;
#[test]
fn it_puts_data_correctly() -> TestResult {
let data_fragments = 5;
let mut system = System::new(data_fragments)?;
let (_, _, storage_client) = setup_system(&mut system)?;
let version = ObjectVersion(1);
let expected = vec![0x03];
let _ = wait(storage_client.clone().put(
version.clone(),
expected.clone(),
Deadline::Infinity,
Span::inactive().handle(),
))?;
let actual = wait(storage_client.clone().get(
ObjectValue {
version,
content: expected.clone(),
},
Deadline::Infinity,
Span::inactive().handle(),
))?;
assert_eq!(expected, actual);
Ok(())
}
}