,
/// Database path
path: PathBuf,
}
impl Database {
/// Opens blooms database.
pub fn open(path: P) -> io::Result
where
P: AsRef,
{
let path: PathBuf = path.as_ref().to_path_buf();
let database = Database {
db_files: Some(DatabaseFiles::open(&path)?),
path: path,
};
Ok(database)
}
/// Close the inner-files
pub fn close(&mut self) -> io::Result<()> {
self.db_files = None;
Ok(())
}
/// Reopens the database at the same location.
pub fn reopen(&mut self) -> io::Result<()> {
self.db_files = Some(DatabaseFiles::open(&self.path)?);
Ok(())
}
/// Insert consecutive blooms into database starting at the given positon.
pub fn insert_blooms<'a, I, B>(&mut self, from: u64, blooms: I) -> io::Result<()>
where
ethbloom::BloomRef<'a>: From,
I: Iterator- ,
{
match self.db_files {
Some(ref mut db_files) => {
for (index, bloom) in (from..).into_iter().zip(blooms.map(Into::into)) {
let pos = Positions::from_index(index);
// Constant forks may lead to increased ratio of false positives in bloom filters
// since we do not rebuild top or mid level, but we should not be worried about that
// because most of the time events at block n(a) occur also on block n(b) or n+1(b)
db_files.accrue_bloom(pos, bloom)?;
}
db_files.flush()?;
Ok(())
}
None => Err(other_io_err("Database is closed")),
}
}
/// Returns an iterator yielding all indexes containing given bloom.
pub fn iterate_matching<'a, 'b, B, I, II>(
&'a mut self,
from: u64,
to: u64,
blooms: II,
) -> io::Result>
where
ethbloom::BloomRef<'b>: From,
'b: 'a,
II: IntoIterator
- + Copy,
I: Iterator
- ,
{
match self.db_files {
Some(ref mut db_files) => {
let index = from / 256 * 256;
let pos = Positions::from_index(index);
let files_iter = db_files.iterator_from(pos)?;
let iter = DatabaseIterator {
top: files_iter.top,
mid: files_iter.mid,
bot: files_iter.bot,
state: IteratorState::Top,
from,
to,
index,
blooms,
};
Ok(iter)
}
None => Err(other_io_err("Database is closed")),
}
}
}
fn contains_any<'a, I, B>(bloom: ethbloom::Bloom, mut iterator: I) -> bool
where
ethbloom::BloomRef<'a>: From,
I: Iterator
- ,
{
iterator.any(|item| bloom.contains_bloom(item))
}
/// Blooms database iterator
pub struct DatabaseIterator<'a, I> {
top: FileIterator<'a>,
mid: FileIterator<'a>,
bot: FileIterator<'a>,
state: IteratorState,
from: u64,
to: u64,
index: u64,
blooms: I,
}
impl<'a, I> fmt::Debug for DatabaseIterator<'a, I> {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
f.debug_struct("DatabaseIterator")
.field("state", &self.state)
.field("from", &self.from)
.field("to", &self.to)
.field("index", &self.index)
.field("blooms", &"...")
.field("top", &"...")
.field("mid", &"...")
.field("bot", &"...")
.finish()
}
}
/// Database iterator state.
#[derive(Debug)]
enum IteratorState {
/// Iterator should read top level bloom
Top,
/// Iterator should read mid level bloom `x` more times
Mid(usize),
/// Iterator should read mid level bloom `mid` more times
/// and bot level `mix * 16 + bot` times
Bot { mid: usize, bot: usize },
}
impl<'a, 'b, B, I, II> Iterator for DatabaseIterator<'a, II>
where
ethbloom::BloomRef<'b>: From,
'b: 'a,
II: IntoIterator
- + Copy,
I: Iterator
- ,
{
type Item = io::Result;
fn next(&mut self) -> Option {
macro_rules! try_o {
($expr: expr) => {
match $expr {
Err(err) => return Some(Err(err)),
Ok(ok) => ok,
}
};
}
macro_rules! next_bloom {
($iter: expr) => {
try_o!($iter.next()?)
};
}
loop {
if self.index > self.to {
return None;
}
self.state = match self.state {
IteratorState::Top => {
if contains_any(next_bloom!(self.top), self.blooms.into_iter()) {
IteratorState::Mid(16)
} else {
self.index += 256;
try_o!(self.mid.advance(16));
try_o!(self.bot.advance(256));
IteratorState::Top
}
}
IteratorState::Mid(left) => {
if left == 0 {
IteratorState::Top
} else if contains_any(next_bloom!(self.mid), self.blooms.into_iter())
&& self.index + 16 >= self.from
{
IteratorState::Bot {
mid: left - 1,
bot: 16,
}
} else {
self.index += 16;
try_o!(self.bot.advance(16));
IteratorState::Mid(left - 1)
}
}
IteratorState::Bot { mid, bot } => {
if bot == 0 {
IteratorState::Mid(mid)
} else if contains_any(next_bloom!(self.bot), self.blooms.into_iter())
&& self.index >= self.from
{
let result = self.index;
self.index += 1;
self.state = IteratorState::Bot { mid, bot: bot - 1 };
return Some(Ok(result));
} else {
self.index += 1;
IteratorState::Bot { mid, bot: bot - 1 }
}
}
}
}
}
}
#[cfg(test)]
mod tests {
use super::Database;
use ethbloom::Bloom;
use tempdir::TempDir;
#[test]
fn test_database() {
let tempdir = TempDir::new("").unwrap();
let mut database = Database::open(tempdir.path()).unwrap();
database
.insert_blooms(
0,
vec![
Bloom::zero(),
Bloom::from_low_u64_be(0x01),
Bloom::from_low_u64_be(0x10),
Bloom::from_low_u64_be(0x11),
]
.iter(),
)
.unwrap();
let matches = database
.iterate_matching(0, 3, Some(&Bloom::zero()))
.unwrap()
.collect::, _>>()
.unwrap();
assert_eq!(matches, vec![0, 1, 2, 3]);
let matches = database
.iterate_matching(0, 4, Some(&Bloom::zero()))
.unwrap()
.collect::, _>>()
.unwrap();
assert_eq!(matches, vec![0, 1, 2, 3]);
let matches = database
.iterate_matching(1, 3, Some(&Bloom::zero()))
.unwrap()
.collect::, _>>()
.unwrap();
assert_eq!(matches, vec![1, 2, 3]);
let matches = database
.iterate_matching(1, 2, Some(&Bloom::zero()))
.unwrap()
.collect::, _>>()
.unwrap();
assert_eq!(matches, vec![1, 2]);
let matches = database
.iterate_matching(0, 3, Some(&Bloom::from_low_u64_be(0x01)))
.unwrap()
.collect::, _>>()
.unwrap();
assert_eq!(matches, vec![1, 3]);
let matches = database
.iterate_matching(0, 3, Some(&Bloom::from_low_u64_be(0x10)))
.unwrap()
.collect::, _>>()
.unwrap();
assert_eq!(matches, vec![2, 3]);
let matches = database
.iterate_matching(2, 2, Some(&Bloom::from_low_u64_be(0x10)))
.unwrap()
.collect::, _>>()
.unwrap();
assert_eq!(matches, vec![2]);
}
#[test]
fn test_database2() {
let tempdir = TempDir::new("").unwrap();
let mut database = Database::open(tempdir.path()).unwrap();
database
.insert_blooms(
254,
vec![
Bloom::from_low_u64_be(0x100),
Bloom::from_low_u64_be(0x01),
Bloom::from_low_u64_be(0x10),
Bloom::from_low_u64_be(0x11),
]
.iter(),
)
.unwrap();
let matches = database
.iterate_matching(0, 257, Some(&Bloom::from_low_u64_be(0x01)))
.unwrap()
.collect::, _>>()
.unwrap();
assert_eq!(matches, vec![255, 257]);
let matches = database
.iterate_matching(0, 258, Some(&Bloom::from_low_u64_be(0x100)))
.unwrap()
.collect::, _>>()
.unwrap();
assert_eq!(matches, vec![254]);
let matches = database
.iterate_matching(0, 256, Some(&Bloom::from_low_u64_be(0x01)))
.unwrap()
.collect::, _>>()
.unwrap();
assert_eq!(matches, vec![255]);
let matches = database
.iterate_matching(255, 255, Some(&Bloom::from_low_u64_be(0x01)))
.unwrap()
.collect::, _>>()
.unwrap();
assert_eq!(matches, vec![255]);
let matches = database
.iterate_matching(256, 256, Some(&Bloom::from_low_u64_be(0x10)))
.unwrap()
.collect::, _>>()
.unwrap();
assert_eq!(matches, vec![256]);
let matches = database
.iterate_matching(256, 257, Some(&Bloom::from_low_u64_be(0x10)))
.unwrap()
.collect::, _>>()
.unwrap();
assert_eq!(matches, vec![256, 257]);
}
#[test]
fn test_db_close() {
let tempdir = TempDir::new("").unwrap();
let blooms = vec![
Bloom::from_low_u64_be(0x100),
Bloom::from_low_u64_be(0x01),
Bloom::from_low_u64_be(0x10),
Bloom::from_low_u64_be(0x11),
];
let mut database = Database::open(tempdir.path()).unwrap();
// Close the DB and ensure inserting blooms errors
database.close().unwrap();
assert!(database.insert_blooms(254, blooms.iter()).is_err());
// Reopen it and ensure inserting blooms is OK
database.reopen().unwrap();
assert!(database.insert_blooms(254, blooms.iter()).is_ok());
}
}