aboutsummaryrefslogtreecommitdiff
path: root/src/blockchain_db/berkeleydb/db_bdb.h
diff options
context:
space:
mode:
authormoneromooo-monero <moneromooo-monero@users.noreply.github.com>2016-08-30 16:39:33 +0100
committermoneromooo-monero <moneromooo-monero@users.noreply.github.com>2016-08-31 10:03:32 +0100
commit6cf8ca2a7f3e11ca5559018dfc9b20869c07cdce (patch)
tree5634718d7626d234510d1f9e4c714627ff4b8590 /src/blockchain_db/berkeleydb/db_bdb.h
parentMerge pull request #1014 (diff)
downloadmonero-6cf8ca2a7f3e11ca5559018dfc9b20869c07cdce.tar.xz
core: faster find_blockchain_supplement
Since this queries block heights for blocks that may or may not exist, queries for non existing blocks would throw an exception, and that would slow down the loop a lot. 7 seconds to go through a 30 hash list. Fix this by adding an optional return block height to block_exists and using this instead. Actual errors will still throw an exception. This also cuts down on log exception spam.
Diffstat (limited to '')
-rw-r--r--src/blockchain_db/berkeleydb/db_bdb.h2
1 files changed, 1 insertions, 1 deletions
diff --git a/src/blockchain_db/berkeleydb/db_bdb.h b/src/blockchain_db/berkeleydb/db_bdb.h
index f8e9440bd..f320ab0e3 100644
--- a/src/blockchain_db/berkeleydb/db_bdb.h
+++ b/src/blockchain_db/berkeleydb/db_bdb.h
@@ -250,7 +250,7 @@ public:
virtual void unlock();
- virtual bool block_exists(const crypto::hash& h) const;
+ virtual bool block_exists(const crypto::hash& h, uint64_t *height = NULL) const;
virtual block get_block(const crypto::hash& h) const;