Short-circuit bloom checking if we will always return true.

This allows full nodes to use bloom filters as an optimization.
This commit is contained in:
Matt Corallo 2013-02-24 20:36:59 -05:00
parent 0bd573d666
commit cbfc77352d

View file

@ -37,6 +37,8 @@ inline unsigned int CBloomFilter::Hash(unsigned int nHashNum, const std::vector<
void CBloomFilter::insert(const vector<unsigned char>& vKey) void CBloomFilter::insert(const vector<unsigned char>& vKey)
{ {
if (vData.size() == 1 && vData[0] == 0xff)
return;
for (unsigned int i = 0; i < nHashFuncs; i++) for (unsigned int i = 0; i < nHashFuncs; i++)
{ {
unsigned int nIndex = Hash(i, vKey); unsigned int nIndex = Hash(i, vKey);
@ -61,6 +63,8 @@ void CBloomFilter::insert(const uint256& hash)
bool CBloomFilter::contains(const vector<unsigned char>& vKey) const bool CBloomFilter::contains(const vector<unsigned char>& vKey) const
{ {
if (vData.size() == 1 && vData[0] == 0xff)
return true;
for (unsigned int i = 0; i < nHashFuncs; i++) for (unsigned int i = 0; i < nHashFuncs; i++)
{ {
unsigned int nIndex = Hash(i, vKey); unsigned int nIndex = Hash(i, vKey);