forked from Deuxfleurs/garage
Alex
e41ce4d815
Issue: RC increases also when the block ref entry is first put by the actual client. At that point the client is probably already sending us the block content, so we don't need to do a get... We should add a delay before the task is added or find something to do.
64 lines
1.4 KiB
Rust
64 lines
1.4 KiB
Rust
use async_trait::async_trait;
|
|
use serde::{Deserialize, Serialize};
|
|
use std::sync::Arc;
|
|
|
|
use crate::background::*;
|
|
use crate::block::*;
|
|
use crate::data::*;
|
|
use crate::table::*;
|
|
|
|
#[derive(PartialEq, Clone, Debug, Serialize, Deserialize)]
|
|
pub struct BlockRef {
|
|
// Primary key
|
|
pub block: Hash,
|
|
|
|
// Sort key
|
|
pub version: UUID,
|
|
|
|
// Keep track of deleted status
|
|
pub deleted: bool,
|
|
}
|
|
|
|
impl Entry<Hash, UUID> for BlockRef {
|
|
fn partition_key(&self) -> &Hash {
|
|
&self.block
|
|
}
|
|
fn sort_key(&self) -> &UUID {
|
|
&self.version
|
|
}
|
|
|
|
fn merge(&mut self, other: &Self) {
|
|
if other.deleted {
|
|
self.deleted = true;
|
|
}
|
|
}
|
|
}
|
|
|
|
pub struct BlockRefTable {
|
|
pub background: Arc<BackgroundRunner>,
|
|
pub block_manager: Arc<BlockManager>,
|
|
}
|
|
|
|
#[async_trait]
|
|
impl TableSchema for BlockRefTable {
|
|
type P = Hash;
|
|
type S = UUID;
|
|
type E = BlockRef;
|
|
|
|
async fn updated(&self, old: Option<Self::E>, new: Option<Self::E>) {
|
|
let block = &old.as_ref().or(new.as_ref()).unwrap().block;
|
|
let was_before = old.as_ref().map(|x| !x.deleted).unwrap_or(false);
|
|
let is_after = new.as_ref().map(|x| !x.deleted).unwrap_or(false);
|
|
if is_after && !was_before {
|
|
if let Err(e) = self.block_manager.block_incref(block) {
|
|
eprintln!("Failed to incref block {:?}: {}", block, e);
|
|
}
|
|
}
|
|
if was_before && !is_after {
|
|
if let Err(e) = self.block_manager.block_decref(block) {
|
|
eprintln!("Failed to decref block {:?}: {}", block, e);
|
|
}
|
|
}
|
|
}
|
|
}
|