30   static double StandardFpRate(double bits_per_key, int num_probes) {  in StandardFpRate()  argument
33     return std::pow(1.0 - std::exp(-num_probes / bits_per_key), num_probes);  in StandardFpRate()
40   static double CacheLocalFpRate(double bits_per_key, int num_probes,  in CacheLocalFpRate()  argument
48         cache_line_bits / (keys_per_cache_line + keys_stddev), num_probes);  in CacheLocalFpRate()
50         cache_line_bits / (keys_per_cache_line - keys_stddev), num_probes);  in CacheLocalFpRate()
142   static double EstimatedFpRate(size_t keys, size_t bytes, int num_probes,  in EstimatedFpRate()  argument
145         BloomMath::CacheLocalFpRate(8.0 * bytes / keys, num_probes,  in EstimatedFpRate()
195                              int num_probes, char *data) {  in AddHash()  argument
197     AddHashPrepared(h2, num_probes, data + bytes_to_cache_line);  in AddHash()
200   static inline void AddHashPrepared(uint32_t h2, int num_probes,  in AddHashPrepared()  argument
203     for (int i = 0; i < num_probes; ++i, h *= uint32_t{0x9e3779b9}) {  in AddHashPrepared()
220                                   int num_probes, const char *data) {  in HashMayMatch()  argument
222     return HashMayMatchPrepared(h2, num_probes, data + bytes_to_cache_line);  in HashMayMatch()
225   static inline bool HashMayMatchPrepared(uint32_t h2, int num_probes,  in HashMayMatchPrepared()  argument
229     int rem_probes = num_probes;  in HashMayMatchPrepared()
329     for (int i = 0; i < num_probes; ++i, h *= uint32_t{0x9e3779b9}) {  in HashMayMatchPrepared()
352     int num_probes = static_cast<int>(bits_per_key * 0.69);  // 0.69 =~ ln(2)  in ChooseNumProbes()  local
353     if (num_probes < 1) num_probes = 1;  in ChooseNumProbes()
354     if (num_probes > 30) num_probes = 30;  in ChooseNumProbes()
355     return num_probes;  in ChooseNumProbes()
358   static inline void AddHash(uint32_t h, uint32_t total_bits, int num_probes,  in AddHash()  argument
361     for (int i = 0; i < num_probes; i++) {  in AddHash()
369                                   int num_probes, const char *data) {  in HashMayMatch()  argument
371     for (int i = 0; i < num_probes; i++) {  in HashMayMatch()
408   static double EstimatedFpRate(size_t keys, size_t bytes, int num_probes) {  in EstimatedFpRate()  argument
410     double filter_rate = BloomMath::CacheLocalFpRate(bits_per_key, num_probes,  in EstimatedFpRate()
426   static inline void AddHash(uint32_t h, uint32_t num_lines, int num_probes,  in AddHash()  argument
433     for (int i = 0; i < num_probes; ++i) {  in AddHash()
456                                   int num_probes, const char *data,  in HashMayMatch()  argument
459     return HashMayMatchPrepared(h, num_probes, data + b, log2_cache_line_bytes);  in HashMayMatch()
462   static inline bool HashMayMatchPrepared(uint32_t h, int num_probes,  in HashMayMatchPrepared()  argument
468     for (int i = 0; i < num_probes; ++i) {  in HashMayMatchPrepared()