forked from ordinals/ord
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Make retrieving inscriptions in block fast (ordinals#2333)
- Loading branch information
1 parent
40e4807
commit 621a747
Showing
4 changed files
with
249 additions
and
33 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,201 @@ | ||
| use super::*; | ||
|
|
||
| #[derive(Clone)] | ||
| pub struct BlockIndex { | ||
| first_inscription_height: u64, | ||
| lowest_blessed_by_block: Vec<i64>, | ||
| lowest_cursed_by_block: Vec<i64>, | ||
| highest_indexed_blessed: i64, | ||
| lowest_indexed_cursed: i64, | ||
| } | ||
|
|
||
| impl BlockIndex { | ||
| pub(crate) fn new(index: &Index) -> Result<BlockIndex> { | ||
| Ok(BlockIndex { | ||
| first_inscription_height: index.options.first_inscription_height(), | ||
| lowest_blessed_by_block: Vec::new(), | ||
| lowest_cursed_by_block: Vec::new(), | ||
| highest_indexed_blessed: i64::MIN, | ||
| lowest_indexed_cursed: i64::MAX, | ||
| }) | ||
| } | ||
|
|
||
| pub(crate) fn update(&mut self, index: &Index) -> Result { | ||
| let index_height = index.block_count()?; | ||
| let inscribed_block_count = index_height.saturating_sub(self.first_inscription_height); | ||
| let indexed_up_to: isize = self | ||
| .lowest_blessed_by_block | ||
| .len() | ||
| .try_into() | ||
| .unwrap_or(isize::MAX); | ||
|
|
||
| let gap = inscribed_block_count.try_into().unwrap_or(isize::MAX) - indexed_up_to; | ||
| if gap <= 0 { | ||
| return Ok(()); | ||
| } | ||
|
|
||
| log::debug!( | ||
| "Updating block index for {} new blocks ({} to {})", | ||
| gap, | ||
| indexed_up_to, | ||
| inscribed_block_count | ||
| ); | ||
|
|
||
| self | ||
| .lowest_blessed_by_block | ||
| .resize(usize::try_from(inscribed_block_count)?, i64::MAX); | ||
|
|
||
| self | ||
| .lowest_cursed_by_block | ||
| .resize(usize::try_from(inscribed_block_count)?, i64::MAX); | ||
|
|
||
| let rtx = index.database.begin_read()?; | ||
|
|
||
| // Use a more efficient approach for the initial indexing - since we have | ||
| // to traverse all inscriptions, it is most efficient to do so using one table. | ||
| if indexed_up_to == 0 { | ||
| for result in rtx | ||
| .open_table(INSCRIPTION_ID_TO_INSCRIPTION_ENTRY)? | ||
| .iter()? | ||
| { | ||
| let (_, entry) = result?; | ||
| let entry = InscriptionEntry::load(entry.value()); | ||
| let height_index: usize = entry | ||
| .height | ||
| .try_into() | ||
| .unwrap_or(usize::MAX) | ||
| .saturating_sub(self.first_inscription_height.try_into().unwrap()); | ||
|
|
||
| if entry.number < 0 { | ||
| self.lowest_cursed_by_block[height_index] = | ||
| cmp::min(self.lowest_cursed_by_block[height_index], entry.number); | ||
| self.lowest_indexed_cursed = cmp::min(self.lowest_indexed_cursed, entry.number); | ||
| } else { | ||
| self.lowest_blessed_by_block[height_index] = | ||
| cmp::min(self.lowest_blessed_by_block[height_index], entry.number); | ||
| self.highest_indexed_blessed = cmp::max(self.highest_indexed_blessed, entry.number); | ||
| } | ||
| } | ||
| } else { | ||
| // Use default approach where we iterate in order of inscription number | ||
| // so we can easily skip over already indexed inscriptions. | ||
| let mut prev_block_height = usize::MAX; | ||
|
|
||
| for result in rtx | ||
| .open_table(INSCRIPTION_NUMBER_TO_INSCRIPTION_ID)? | ||
| .iter()? | ||
| { | ||
| let (number, id) = result?; | ||
|
|
||
| if number.value() >= self.lowest_indexed_cursed | ||
| && number.value() <= self.highest_indexed_blessed | ||
| { | ||
| continue; | ||
| } | ||
|
|
||
| let inscription_id = InscriptionId::load(*id.value()); | ||
|
|
||
| if let Some(entry) = index.get_inscription_entry(inscription_id)? { | ||
| let current_height = entry.height.try_into().unwrap_or(usize::MAX); | ||
|
|
||
| if prev_block_height != current_height { | ||
| prev_block_height = current_height; | ||
|
|
||
| if number.value() < 0 { | ||
| self.lowest_cursed_by_block[prev_block_height | ||
| .saturating_sub(usize::try_from(self.first_inscription_height)?)] = number.value(); | ||
| self.lowest_indexed_cursed = cmp::min(self.lowest_indexed_cursed, number.value()); | ||
| } else { | ||
| self.lowest_blessed_by_block[prev_block_height | ||
| .saturating_sub(usize::try_from(self.first_inscription_height)?)] = number.value(); | ||
| self.highest_indexed_blessed = cmp::max(self.highest_indexed_blessed, number.value()); | ||
| } | ||
| } | ||
| } | ||
| } | ||
| } | ||
|
|
||
| log::debug!( | ||
| "Updated block index for {} new blocks ({} to {})", | ||
| gap, | ||
| indexed_up_to, | ||
| inscribed_block_count | ||
| ); | ||
|
|
||
| Ok(()) | ||
| } | ||
|
|
||
| // Return all consecutively numbered inscriptions in the block at the given height, starting from the given number | ||
| fn get_inscriptions_in_block_from( | ||
| &self, | ||
| index: &Index, | ||
| block_height: u64, | ||
| from_number: i64, | ||
| cursed: bool, | ||
| ) -> Result<Vec<InscriptionId>> { | ||
| let mut block_inscriptions = Vec::new(); | ||
|
|
||
| let rtx = index.database.begin_read()?; | ||
| let inscription_id_by_number = rtx.open_table(INSCRIPTION_NUMBER_TO_INSCRIPTION_ID)?; | ||
|
|
||
| let highest = if cursed { | ||
| -1 | ||
| } else { | ||
| match inscription_id_by_number.iter()?.next_back() { | ||
| Some(Ok((number, _id))) => number.value(), | ||
| Some(Err(err)) => return Err(err.into()), | ||
| None => i64::MIN, | ||
| } | ||
| }; | ||
|
|
||
| for number in from_number..=highest { | ||
| match inscription_id_by_number.get(number)? { | ||
| Some(inscription_id) => { | ||
| let inscription_id = InscriptionId::load(*inscription_id.value()); | ||
| if let Some(entry) = index.get_inscription_entry(inscription_id)? { | ||
| if entry.height != block_height { | ||
| break; | ||
| } | ||
| block_inscriptions.push(inscription_id); | ||
| } | ||
| } | ||
| None => break, | ||
| } | ||
| } | ||
|
|
||
| Ok(block_inscriptions) | ||
| } | ||
|
|
||
| pub(crate) fn get_inscriptions_in_block( | ||
| &self, | ||
| index: &Index, | ||
| block_height: u64, | ||
| ) -> Result<Vec<InscriptionId>> { | ||
| if block_height >= index.block_count()? || block_height < self.first_inscription_height { | ||
| return Ok(Vec::new()); | ||
| } | ||
| let lowest_cursed = self.lowest_cursed_by_block | ||
| [usize::try_from(block_height.saturating_sub(self.first_inscription_height))?]; | ||
| let lowest_blessed = self.lowest_blessed_by_block | ||
| [usize::try_from(block_height.saturating_sub(self.first_inscription_height))?]; | ||
|
|
||
| let mut inscriptions = | ||
| self.get_inscriptions_in_block_from(index, block_height, lowest_cursed, true)?; | ||
| inscriptions.extend(self.get_inscriptions_in_block_from( | ||
| index, | ||
| block_height, | ||
| lowest_blessed, | ||
| false, | ||
| )?); | ||
|
|
||
| log::debug!( | ||
| "Got {} inscriptions in block {} ({} - {})", | ||
| inscriptions.len(), | ||
| block_height, | ||
| lowest_cursed, | ||
| lowest_blessed | ||
| ); | ||
|
|
||
| Ok(inscriptions) | ||
| } | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters