Allow reorgs to shorten valid headers' chain
This commit is contained in:
parent
5895ad906d
commit
079c794789
@ -151,7 +151,7 @@ fn load_headers(daemon: &Daemon) -> Result<HeaderList> {
|
||||
let tip = daemon.getbestblockhash()?;
|
||||
let mut headers = HeaderList::empty();
|
||||
let new_headers = headers.order(daemon.get_new_headers(&headers, &tip)?);
|
||||
headers.apply(new_headers);
|
||||
headers.apply(new_headers, tip);
|
||||
Ok(headers)
|
||||
}
|
||||
|
||||
|
||||
@ -223,6 +223,7 @@ fn read_indexed_headers(store: &ReadStore) -> HeaderList {
|
||||
Some(row) => deserialize(&row).unwrap(),
|
||||
None => Sha256dHash::default(),
|
||||
};
|
||||
trace!("lastest indexed blockhash: {}", latest_blockhash);
|
||||
let mut map = HeaderMap::new();
|
||||
for row in store.scan(b"B") {
|
||||
let key: BlockKey = bincode::deserialize(&row.key).unwrap();
|
||||
@ -256,7 +257,7 @@ fn read_indexed_headers(store: &ReadStore) -> HeaderList {
|
||||
);
|
||||
let mut result = HeaderList::empty();
|
||||
let entries = result.order(headers);
|
||||
result.apply(entries);
|
||||
result.apply(entries, latest_blockhash);
|
||||
result
|
||||
}
|
||||
|
||||
@ -332,7 +333,7 @@ impl Index {
|
||||
|
||||
pub fn best_header(&self) -> Option<HeaderEntry> {
|
||||
let headers = self.headers.read().unwrap();
|
||||
headers.header_by_blockhash(headers.tip()).cloned()
|
||||
headers.header_by_blockhash(&headers.tip()).cloned()
|
||||
}
|
||||
|
||||
pub fn get_header(&self, height: usize) -> Option<HeaderEntry> {
|
||||
@ -406,8 +407,8 @@ impl Index {
|
||||
timer.observe_duration();
|
||||
|
||||
fetcher.join().expect("block fetcher failed");
|
||||
self.headers.write().unwrap().apply(new_headers);
|
||||
assert_eq!(tip, *self.headers.read().unwrap().tip());
|
||||
self.headers.write().unwrap().apply(new_headers, tip);
|
||||
assert_eq!(tip, self.headers.read().unwrap().tip());
|
||||
Ok(tip)
|
||||
}
|
||||
}
|
||||
|
||||
34
src/util.rs
34
src/util.rs
@ -66,7 +66,6 @@ impl fmt::Debug for HeaderEntry {
|
||||
pub struct HeaderList {
|
||||
headers: Vec<HeaderEntry>,
|
||||
heights: HashMap<Sha256dHash, usize>,
|
||||
tip: Sha256dHash,
|
||||
}
|
||||
|
||||
impl HeaderList {
|
||||
@ -74,7 +73,6 @@ impl HeaderList {
|
||||
HeaderList {
|
||||
headers: vec![],
|
||||
heights: HashMap::new(),
|
||||
tip: Sha256dHash::default(),
|
||||
}
|
||||
}
|
||||
|
||||
@ -117,7 +115,7 @@ impl HeaderList {
|
||||
}).collect()
|
||||
}
|
||||
|
||||
pub fn apply(&mut self, new_headers: Vec<HeaderEntry>) {
|
||||
pub fn apply(&mut self, new_headers: Vec<HeaderEntry>, tip: Sha256dHash) {
|
||||
// new_headers[i] -> new_headers[i - 1] (i.e. new_headers.last() is the tip)
|
||||
for i in 1..new_headers.len() {
|
||||
assert_eq!(new_headers[i - 1].height() + 1, new_headers[i].height());
|
||||
@ -135,9 +133,14 @@ impl HeaderList {
|
||||
Sha256dHash::default()
|
||||
};
|
||||
assert_eq!(entry.header().prev_blockhash, expected_prev_blockhash);
|
||||
let expected_tip = new_headers.last().unwrap().hash();
|
||||
assert_eq!(tip, *expected_tip);
|
||||
height
|
||||
}
|
||||
None => return,
|
||||
None => *self
|
||||
.heights
|
||||
.get(&tip)
|
||||
.expect(&format!("missing tip: {}", tip)),
|
||||
};
|
||||
debug!(
|
||||
"applying {} new headers from height {}",
|
||||
@ -146,12 +149,13 @@ impl HeaderList {
|
||||
);
|
||||
self.headers.split_off(new_height); // keep [0..new_height) entries
|
||||
for new_header in new_headers {
|
||||
let height = new_header.height();
|
||||
assert_eq!(height, self.headers.len());
|
||||
self.tip = *new_header.hash();
|
||||
assert_eq!(new_header.height(), self.headers.len());
|
||||
assert_eq!(new_header.header().prev_blockhash, self.tip());
|
||||
self.heights.insert(*new_header.hash(), new_header.height());
|
||||
self.headers.push(new_header);
|
||||
self.heights.insert(self.tip, height);
|
||||
}
|
||||
assert_eq!(tip, self.tip());
|
||||
assert!(self.heights.contains_key(&tip));
|
||||
}
|
||||
|
||||
pub fn header_by_blockhash(&self, blockhash: &Sha256dHash) -> Option<&HeaderEntry> {
|
||||
@ -175,15 +179,11 @@ impl HeaderList {
|
||||
self.headers.last() == other.headers.last()
|
||||
}
|
||||
|
||||
pub fn tip(&self) -> &Sha256dHash {
|
||||
assert_eq!(
|
||||
self.tip,
|
||||
self.headers
|
||||
.last()
|
||||
.map(|h| *h.hash())
|
||||
.unwrap_or(Sha256dHash::default())
|
||||
);
|
||||
&self.tip
|
||||
pub fn tip(&self) -> Sha256dHash {
|
||||
self.headers
|
||||
.last()
|
||||
.map(|h| *h.hash())
|
||||
.unwrap_or(Sha256dHash::default())
|
||||
}
|
||||
|
||||
pub fn len(&self) -> usize {
|
||||
|
||||
Loading…
Reference in New Issue
Block a user