garage/src/core/version_table.rs

132 lines
2.8 KiB
Rust
Raw Normal View History

2020-04-09 21:45:07 +00:00
use async_trait::async_trait;
use serde::{Deserialize, Serialize};
use std::sync::Arc;
2020-04-09 21:45:07 +00:00
2020-04-24 10:10:01 +00:00
use garage_util::background::BackgroundRunner;
use garage_util::data::*;
use garage_util::error::Error;
2020-04-23 17:05:46 +00:00
2020-04-24 10:10:01 +00:00
use garage_table::table_sharded::*;
use garage_table::*;
2020-04-09 21:45:07 +00:00
2020-04-24 10:10:01 +00:00
use crate::block_ref_table::*;
2020-04-09 21:45:07 +00:00
#[derive(PartialEq, Clone, Debug, Serialize, Deserialize)]
pub struct Version {
// Primary key
2020-04-10 21:11:52 +00:00
pub uuid: UUID,
2020-04-09 21:45:07 +00:00
// Actual data: the blocks for this version
pub deleted: bool,
blocks: Vec<VersionBlock>,
2020-04-09 21:45:07 +00:00
// Back link to bucket+key so that we can figure if
// this was deleted later on
pub bucket: String,
pub key: String,
}
impl Version {
pub fn new(
uuid: UUID,
bucket: String,
key: String,
deleted: bool,
blocks: Vec<VersionBlock>,
) -> Self {
let mut ret = Self {
uuid,
deleted,
blocks: vec![],
bucket,
key,
};
for b in blocks {
ret.add_block(b)
.expect("Twice the same VersionBlock in Version constructor");
}
ret
}
/// Adds a block if it wasn't already present
pub fn add_block(&mut self, new: VersionBlock) -> Result<(), ()> {
match self.blocks.binary_search_by(|b| b.offset.cmp(&new.offset)) {
Err(i) => {
self.blocks.insert(i, new);
Ok(())
}
Ok(_) => Err(()),
}
}
pub fn blocks(&self) -> &[VersionBlock] {
&self.blocks[..]
}
}
2020-04-09 21:45:07 +00:00
#[derive(PartialEq, Clone, Debug, Serialize, Deserialize)]
pub struct VersionBlock {
pub offset: u64,
pub hash: Hash,
}
impl Entry<Hash, EmptyKey> for Version {
2020-04-09 21:45:07 +00:00
fn partition_key(&self) -> &Hash {
2020-04-10 21:11:52 +00:00
&self.uuid
2020-04-09 21:45:07 +00:00
}
fn sort_key(&self) -> &EmptyKey {
&EmptyKey
2020-04-09 21:45:07 +00:00
}
fn merge(&mut self, other: &Self) {
if other.deleted {
self.deleted = true;
self.blocks.clear();
} else if !self.deleted {
for bi in other.blocks.iter() {
match self.blocks.binary_search_by(|x| x.offset.cmp(&bi.offset)) {
Ok(_) => (),
Err(pos) => {
self.blocks.insert(pos, bi.clone());
}
}
}
}
}
}
pub struct VersionTable {
2020-04-12 11:03:55 +00:00
pub background: Arc<BackgroundRunner>,
pub block_ref_table: Arc<Table<BlockRefTable, TableShardedReplication>>,
2020-04-09 21:45:07 +00:00
}
#[async_trait]
2020-04-12 20:24:53 +00:00
impl TableSchema for VersionTable {
2020-04-09 21:45:07 +00:00
type P = Hash;
type S = EmptyKey;
2020-04-09 21:45:07 +00:00
type E = Version;
type Filter = ();
2020-04-09 21:45:07 +00:00
async fn updated(&self, old: Option<Self::E>, new: Option<Self::E>) -> Result<(), Error> {
2020-04-12 11:03:55 +00:00
let block_ref_table = self.block_ref_table.clone();
2020-04-17 12:49:10 +00:00
if let (Some(old_v), Some(new_v)) = (old, new) {
// Propagate deletion of version blocks
if new_v.deleted && !old_v.deleted {
let deleted_block_refs = old_v
.blocks
.iter()
.map(|vb| BlockRef {
block: vb.hash,
version: old_v.uuid,
deleted: true,
})
.collect::<Vec<_>>();
block_ref_table.insert_many(&deleted_block_refs[..]).await?;
}
2020-04-17 12:49:10 +00:00
}
Ok(())
2020-04-09 21:45:07 +00:00
}
fn matches_filter(entry: &Self::E, _filter: &Self::Filter) -> bool {
!entry.deleted
}
2020-04-09 21:45:07 +00:00
}