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
//! Validation of the store's contents.
use std::collections::BTreeSet;
use redb::ReadableTable;
use super::{
raw_outboard_size, tables::Tables, ActorResult, ActorState, DataLocation, EntryState, Hash,
OutboardLocation,
};
use crate::{
store::{fs::tables::BaoFilePart, ConsistencyCheckProgress, ReportLevel},
util::progress::BoxedProgressSender,
};
impl ActorState {
//! This performs a full consistency check. Eventually it will also validate
//! file content again, but that part is not yet implemented.
//!
//! Currently the following checks are performed for complete entries:
//!
//! Check that the data in the entries table is consistent with the data in
//! the inline_data and inline_outboard tables.
//!
//! For every entry where data_location is inline, the inline_data table
//! must contain the data. For every entry where
//! data_location is not inline, the inline_data table must not contain data.
//! Instead, the data must exist as a file in the data directory or be
//! referenced to one or many external files.
//!
//! For every entry where outboard_location is inline, the inline_outboard
//! table must contain the outboard. For every entry where outboard_location
//! is not inline, the inline_outboard table must not contain data, and the
//! outboard must exist as a file in the data directory. Outboards are never
//! external.
//!
//! In addition to these consistency checks, it is checked that the size of
//! the outboard is consistent with the size of the data.
//!
//! For partial entries, it is checked that the data and outboard files
//! exist.
//!
//! In addition to the consistency checks, it is checked that there are no
//! orphaned or unexpected files in the data directory. Also, all entries of
//! all tables are dumped at trace level. This is helpful for debugging and
//! also ensures that the data can be read.
//!
//! Note that during validation, a set of all hashes will be kept in memory.
//! So to validate exceedingly large stores, the validation process will
//! consume a lot of memory.
//!
//! In addition, validation is a blocking operation that will make the store
//! unresponsive for the duration of the validation.
pub(super) fn consistency_check(
&mut self,
db: &redb::Database,
repair: bool,
progress: BoxedProgressSender<ConsistencyCheckProgress>,
) -> ActorResult<()> {
use crate::util::progress::ProgressSender;
let mut invalid_entries = BTreeSet::new();
macro_rules! send {
($level:expr, $entry:expr, $($arg:tt)*) => {
if let Err(_) = progress.blocking_send(ConsistencyCheckProgress::Update { message: format!($($arg)*), level: $level, entry: $entry }) {
return Ok(());
}
};
}
macro_rules! trace {
($($arg:tt)*) => {
send!(ReportLevel::Trace, None, $($arg)*)
};
}
macro_rules! info {
($($arg:tt)*) => {
send!(ReportLevel::Info, None, $($arg)*)
};
}
macro_rules! warn {
($($arg:tt)*) => {
send!(ReportLevel::Warn, None, $($arg)*)
};
}
macro_rules! entry_warn {
($hash:expr, $($arg:tt)*) => {
send!(ReportLevel::Warn, Some($hash), $($arg)*)
};
}
macro_rules! entry_info {
($hash:expr, $($arg:tt)*) => {
send!(ReportLevel::Info, Some($hash), $($arg)*)
};
}
macro_rules! error {
($($arg:tt)*) => {
send!(ReportLevel::Error, None, $($arg)*)
};
}
macro_rules! entry_error {
($hash:expr, $($arg:tt)*) => {
invalid_entries.insert($hash);
send!(ReportLevel::Error, Some($hash), $($arg)*)
};
}
let mut delete_after_commit = Default::default();
let txn = db.begin_write()?;
{
let mut tables = Tables::new(&txn, &mut delete_after_commit)?;
let blobs = &mut tables.blobs;
let inline_data = &mut tables.inline_data;
let inline_outboard = &mut tables.inline_outboard;
let tags = &mut tables.tags;
let mut orphaned_inline_data = BTreeSet::new();
let mut orphaned_inline_outboard = BTreeSet::new();
let mut orphaned_data = BTreeSet::new();
let mut orphaned_outboardard = BTreeSet::new();
let mut orphaned_sizes = BTreeSet::new();
// first, dump the entire data content at trace level
trace!("dumping blobs");
match blobs.iter() {
Ok(iter) => {
for item in iter {
match item {
Ok((k, v)) => {
let hash = k.value();
let entry = v.value();
trace!("blob {} -> {:?}", hash.to_hex(), entry);
}
Err(cause) => {
error!("failed to access blob item: {}", cause);
}
}
}
}
Err(cause) => {
error!("failed to iterate blobs: {}", cause);
}
}
trace!("dumping inline_data");
match inline_data.iter() {
Ok(iter) => {
for item in iter {
match item {
Ok((k, v)) => {
let hash = k.value();
let data = v.value();
trace!("inline_data {} -> {:?}", hash.to_hex(), data.len());
}
Err(cause) => {
error!("failed to access inline data item: {}", cause);
}
}
}
}
Err(cause) => {
error!("failed to iterate inline_data: {}", cause);
}
}
trace!("dumping inline_outboard");
match inline_outboard.iter() {
Ok(iter) => {
for item in iter {
match item {
Ok((k, v)) => {
let hash = k.value();
let data = v.value();
trace!("inline_outboard {} -> {:?}", hash.to_hex(), data.len());
}
Err(cause) => {
error!("failed to access inline outboard item: {}", cause);
}
}
}
}
Err(cause) => {
error!("failed to iterate inline_outboard: {}", cause);
}
}
trace!("dumping tags");
match tags.iter() {
Ok(iter) => {
for item in iter {
match item {
Ok((k, v)) => {
let tag = k.value();
let value = v.value();
trace!("tags {} -> {:?}", tag, value);
}
Err(cause) => {
error!("failed to access tag item: {}", cause);
}
}
}
}
Err(cause) => {
error!("failed to iterate tags: {}", cause);
}
}
// perform consistency check for each entry
info!("validating blobs");
// set of a all hashes that are referenced by the blobs table
let mut entries = BTreeSet::new();
match blobs.iter() {
Ok(iter) => {
for item in iter {
let Ok((hash, entry)) = item else {
error!("failed to access blob item");
continue;
};
let hash = hash.value();
entries.insert(hash);
entry_info!(hash, "validating blob");
let entry = entry.value();
match entry {
EntryState::Complete {
data_location,
outboard_location,
} => {
let data_size = match data_location {
DataLocation::Inline(_) => {
let Ok(inline_data) = inline_data.get(hash) else {
entry_error!(hash, "inline data can not be accessed");
continue;
};
let Some(inline_data) = inline_data else {
entry_error!(hash, "inline data missing");
continue;
};
inline_data.value().len() as u64
}
DataLocation::Owned(size) => {
let path = self.options.path.owned_data_path(&hash);
let Ok(metadata) = path.metadata() else {
entry_error!(hash, "owned data file does not exist");
continue;
};
if metadata.len() != size {
entry_error!(
hash,
"owned data file size mismatch: {}",
path.display()
);
continue;
}
size
}
DataLocation::External(paths, size) => {
for path in paths {
let Ok(metadata) = path.metadata() else {
entry_error!(
hash,
"external data file does not exist: {}",
path.display()
);
invalid_entries.insert(hash);
continue;
};
if metadata.len() != size {
entry_error!(
hash,
"external data file size mismatch: {}",
path.display()
);
invalid_entries.insert(hash);
continue;
}
}
size
}
};
match outboard_location {
OutboardLocation::Inline(_) => {
let Ok(inline_outboard) = inline_outboard.get(hash) else {
entry_error!(
hash,
"inline outboard can not be accessed"
);
continue;
};
let Some(inline_outboard) = inline_outboard else {
entry_error!(hash, "inline outboard missing");
continue;
};
let outboard_size = inline_outboard.value().len() as u64;
if outboard_size != raw_outboard_size(data_size) {
entry_error!(hash, "inline outboard size mismatch");
}
}
OutboardLocation::Owned => {
let Ok(metadata) =
self.options.path.owned_outboard_path(&hash).metadata()
else {
entry_error!(
hash,
"owned outboard file does not exist"
);
continue;
};
let outboard_size = metadata.len();
if outboard_size != raw_outboard_size(data_size) {
entry_error!(hash, "owned outboard size mismatch");
}
}
OutboardLocation::NotNeeded => {
if raw_outboard_size(data_size) != 0 {
entry_error!(
hash,
"outboard not needed but data size is not zero"
);
}
}
}
}
EntryState::Partial { .. } => {
if !self.options.path.owned_data_path(&hash).exists() {
entry_error!(hash, "persistent partial entry has no data");
}
if !self.options.path.owned_outboard_path(&hash).exists() {
entry_error!(hash, "persistent partial entry has no outboard");
}
}
}
}
}
Err(cause) => {
error!("failed to iterate blobs: {}", cause);
}
};
if repair {
info!("repairing - removing invalid entries found so far");
for hash in &invalid_entries {
blobs.remove(hash)?;
}
}
info!("checking for orphaned inline data");
match inline_data.iter() {
Ok(iter) => {
for item in iter {
let Ok((hash, _)) = item else {
error!("failed to access inline data item");
continue;
};
let hash = hash.value();
if !entries.contains(&hash) {
orphaned_inline_data.insert(hash);
entry_error!(hash, "orphaned inline data");
}
}
}
Err(cause) => {
error!("failed to iterate inline_data: {}", cause);
}
};
info!("checking for orphaned inline outboard data");
match inline_outboard.iter() {
Ok(iter) => {
for item in iter {
let Ok((hash, _)) = item else {
error!("failed to access inline outboard item");
continue;
};
let hash = hash.value();
if !entries.contains(&hash) {
orphaned_inline_outboard.insert(hash);
entry_error!(hash, "orphaned inline outboard");
}
}
}
Err(cause) => {
error!("failed to iterate inline_outboard: {}", cause);
}
};
info!("checking for unexpected or orphaned files");
for entry in self.options.path.data_path.read_dir()? {
let entry = entry?;
let path = entry.path();
if !path.is_file() {
warn!("unexpected entry in data directory: {}", path.display());
continue;
}
match path.extension().and_then(|x| x.to_str()) {
Some("data") => match path.file_stem().and_then(|x| x.to_str()) {
Some(stem) => {
let mut hash = [0u8; 32];
let Ok(_) = hex::decode_to_slice(stem, &mut hash) else {
warn!("unexpected data file in data directory: {}", path.display());
continue;
};
let hash = Hash::from(hash);
if !entries.contains(&hash) {
orphaned_data.insert(hash);
entry_warn!(hash, "orphaned data file");
}
}
None => {
warn!("unexpected data file in data directory: {}", path.display());
}
},
Some("obao4") => match path.file_stem().and_then(|x| x.to_str()) {
Some(stem) => {
let mut hash = [0u8; 32];
let Ok(_) = hex::decode_to_slice(stem, &mut hash) else {
warn!(
"unexpected outboard file in data directory: {}",
path.display()
);
continue;
};
let hash = Hash::from(hash);
if !entries.contains(&hash) {
orphaned_outboardard.insert(hash);
entry_warn!(hash, "orphaned outboard file");
}
}
None => {
warn!(
"unexpected outboard file in data directory: {}",
path.display()
);
}
},
Some("sizes4") => match path.file_stem().and_then(|x| x.to_str()) {
Some(stem) => {
let mut hash = [0u8; 32];
let Ok(_) = hex::decode_to_slice(stem, &mut hash) else {
warn!(
"unexpected outboard file in data directory: {}",
path.display()
);
continue;
};
let hash = Hash::from(hash);
if !entries.contains(&hash) {
orphaned_sizes.insert(hash);
entry_warn!(hash, "orphaned outboard file");
}
}
None => {
warn!(
"unexpected outboard file in data directory: {}",
path.display()
);
}
},
_ => {
warn!("unexpected file in data directory: {}", path.display());
}
}
}
if repair {
info!("repairing - removing orphaned files and inline data");
for hash in orphaned_inline_data {
entry_info!(hash, "deleting orphaned inline data");
inline_data.remove(&hash)?;
}
for hash in orphaned_inline_outboard {
entry_info!(hash, "deleting orphaned inline outboard");
inline_outboard.remove(&hash)?;
}
for hash in orphaned_data {
tables.delete_after_commit.insert(hash, [BaoFilePart::Data]);
}
for hash in orphaned_outboardard {
tables
.delete_after_commit
.insert(hash, [BaoFilePart::Outboard]);
}
for hash in orphaned_sizes {
tables
.delete_after_commit
.insert(hash, [BaoFilePart::Sizes]);
}
}
}
txn.commit()?;
if repair {
info!("repairing - deleting orphaned files");
for (hash, part) in delete_after_commit.into_inner() {
let path = match part {
BaoFilePart::Data => self.options.path.owned_data_path(&hash),
BaoFilePart::Outboard => self.options.path.owned_outboard_path(&hash),
BaoFilePart::Sizes => self.options.path.owned_sizes_path(&hash),
};
entry_info!(hash, "deleting orphaned file: {}", path.display());
if let Err(cause) = std::fs::remove_file(&path) {
entry_error!(hash, "failed to delete orphaned file: {}", cause);
}
}
}
Ok(())
}
}