From cbfc77352d095d562860fa8695ada5ac73cf7f67 Mon Sep 17 00:00:00 2001
From: Matt Corallo <git@bluematt.me>
Date: Sun, 24 Feb 2013 20:36:59 -0500
Subject: Short-circuit bloom checking if we will always return true.

This allows full nodes to use bloom filters as an optimization.
---
 src/bloom.cpp | 4 ++++
 1 file changed, 4 insertions(+)

(limited to 'src/bloom.cpp')

diff --git a/src/bloom.cpp b/src/bloom.cpp
index 36f5e50134..d9ec2efa81 100644
--- a/src/bloom.cpp
+++ b/src/bloom.cpp
@@ -37,6 +37,8 @@ inline unsigned int CBloomFilter::Hash(unsigned int nHashNum, const std::vector<
 
 void CBloomFilter::insert(const vector<unsigned char>& vKey)
 {
+    if (vData.size() == 1 && vData[0] == 0xff)
+        return;
     for (unsigned int i = 0; i < nHashFuncs; i++)
     {
         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
 {
+    if (vData.size() == 1 && vData[0] == 0xff)
+        return true;
     for (unsigned int i = 0; i < nHashFuncs; i++)
     {
         unsigned int nIndex = Hash(i, vKey);
-- 
cgit v1.2.3