GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/smallhash.h
Date: 2025-11-09 02:35:23
Exec Total Coverage
Lines: 259 263 98.5%
Branches: 85 110 77.3%
Line Branch Exec Source
1 /**
2 * This file is part of the CernVM File System.
3 */
4
5 #ifndef CVMFS_SMALLHASH_H_
6 #define CVMFS_SMALLHASH_H_
7
8 #ifndef __STDC_FORMAT_MACROS
9 // NOLINTNEXTLINE
10 #define __STDC_FORMAT_MACROS
11 #endif
12
13 #include "duplex_testing.h"
14 #include <inttypes.h>
15 #include <pthread.h>
16 #include <stdint.h>
17
18 #include <algorithm>
19 #include <cassert>
20 #include <cstdlib>
21 #include <new>
22
23 #include "util/atomic.h"
24 #include "util/murmur.hxx"
25 #include "util/prng.h"
26 #include "util/smalloc.h"
27
28 /**
29 * Hash table with linear probing as collision resolution. Works only for
30 * a fixed (maximum) number of elements, i.e. no resizing. Load factor fixed
31 * to 0.7.
32 */
33 template<class Key, class Value, class Derived>
34 class SmallHashBase {
35 FRIEND_TEST(T_Smallhash, InsertAndCopyMd5Slow);
36
37 public:
38 static const double kLoadFactor; // mainly useless for the dynamic version
39 static const double kThresholdGrow; // only used for resizable version
40 static const double kThresholdShrink; // only used for resizable version
41
42 142338 SmallHashBase() {
43 142338 keys_ = NULL;
44 142338 values_ = NULL;
45 142338 hasher_ = NULL;
46 142338 bytes_allocated_ = 0;
47 142338 num_collisions_ = 0;
48 142338 max_collisions_ = 0;
49
50 // Properly initialized by Init()
51 142338 capacity_ = 0;
52 142338 initial_capacity_ = 0;
53 142338 size_ = 0;
54 142338 }
55
56 142200 ~SmallHashBase() { DeallocMemory(keys_, values_, capacity_); }
57
58 142302 void Init(uint32_t expected_size, Key empty,
59 uint32_t (*hasher)(const Key &key)) {
60 142302 hasher_ = hasher;
61 142302 empty_key_ = empty;
62 142302 capacity_ = static_cast<uint32_t>(static_cast<double>(expected_size)
63 142302 / kLoadFactor);
64 142302 initial_capacity_ = capacity_;
65 142302 static_cast<Derived *>(this)->SetThresholds(); // No-op for fixed size
66 142302 AllocMemory();
67 142302 this->DoClear(false);
68 142302 }
69
70 69733055 bool Lookup(const Key &key, Value *value) const {
71 uint32_t bucket;
72 uint32_t collisions;
73
1/2
✓ Branch 1 taken 69818125 times.
✗ Branch 2 not taken.
 69733055 const bool found = DoLookup(key, &bucket, &collisions);
74
2/2
✓ Branch 0 taken 55263177 times.
✓ Branch 1 taken 14554948 times.
 69855348 if (found)
75
1/2
✓ Branch 1 taken 45151 times.
✗ Branch 2 not taken.
 55275215 *value = values_[bucket];
76 69855348 return found;
77 }
78
79 /**
80 * Returns both the key and the value. That is useful if Key's equality
81 * operator implements an equivalence relation on Key. In this case, LookupEx
82 * returns the key representing the equivalence class that has been used
83 * during Insert().
84 * Used to return a glue::InodeEx element when looking for an inode.
85 */
86 188 bool LookupEx(Key *key, Value *value) const {
87 188 uint32_t bucket = ScaleHash(*key);
88
2/2
✓ Branch 1 taken 62 times.
✓ Branch 2 taken 32 times.
 188 while (!(keys_[bucket] == empty_key_)) {
89
1/2
✓ Branch 1 taken 62 times.
✗ Branch 2 not taken.
 124 if (keys_[bucket] == *key) {
90 124 *key = keys_[bucket];
91 124 *value = values_[bucket];
92 124 return true;
93 }
94 ✗ bucket = (bucket + 1) % capacity_;
95 }
96 64 return false;
97 }
98
99 9024957 bool Contains(const Key &key) const {
100 uint32_t bucket;
101 uint32_t collisions;
102
1/2
✓ Branch 1 taken 9024669 times.
✗ Branch 2 not taken.
 9024957 const bool found = DoLookup(key, &bucket, &collisions);
103 9024957 return found;
104 }
105
106 1082772595 void Insert(const Key &key, const Value &value) {
107 1082772595 static_cast<Derived *>(this)->Grow(); // No-op if fixed-size
108 1080204588 const bool overwritten = DoInsert(key, value, true);
109 1080533691 size_ += !overwritten; // size + 1 if the key was not yet in the map
110 1080533691 }
111
112 69719519 bool Erase(const Key &key) {
113 uint32_t bucket;
114 uint32_t collisions;
115
1/2
✓ Branch 1 taken 67626505 times.
✗ Branch 2 not taken.
 69719519 const bool found = DoLookup(key, &bucket, &collisions);
116
1/2
✓ Branch 0 taken 67632382 times.
✗ Branch 1 not taken.
 67629445 if (found) {
117 67635242 keys_[bucket] = empty_key_;
118 67635242 size_--;
119 67635242 bucket = (bucket + 1) % capacity_;
120
3/3
✓ Branch 0 taken 104710454 times.
✓ Branch 1 taken 62480971 times.
✓ Branch 2 taken 5533173 times.
 172727494 while (!(keys_[bucket] == empty_key_)) {
121 105731522 Key rehash = keys_[bucket];
122 105731522 keys_[bucket] = empty_key_;
123
1/2
✓ Branch 1 taken 105092216 times.
✗ Branch 2 not taken.
 105731522 DoInsert(rehash, values_[bucket], false);
124 105092252 bucket = (bucket + 1) % capacity_;
125 }
126
1/2
✓ Branch 1 taken 67930285 times.
✗ Branch 2 not taken.
 66995972 static_cast<Derived *>(this)->Shrink(); // No-op if fixed-size
127 }
128 67953062 return found;
129 }
130
131 1208 void Clear() { DoClear(true); }
132
133 3469 uint64_t bytes_allocated() const { return bytes_allocated_; }
134 924 static double GetEntrySize() {
135 1848 const double unit = sizeof(Key) + sizeof(Value);
136 1848 return unit / kLoadFactor;
137 }
138
139 void GetCollisionStats(uint64_t *num_collisions,
140 uint32_t *max_collisions) const {
141 *num_collisions = num_collisions_;
142 *max_collisions = max_collisions_;
143 }
144
145 // Careful with the direct access TODO: iterator
146 uint32_t capacity() const { return capacity_; }
147 55792 Key empty_key() const { return empty_key_; }
148 147248 Key *keys() const { return keys_; }
149 262 Value *values() const { return values_; }
150
151 // Only needed by compat
152 ✗ void SetHasher(uint32_t (*hasher)(const Key &key)) { hasher_ = hasher; }
153
154 protected:
155 1502760124 uint32_t ScaleHash(const Key &key) const {
156 1502760124 const double bucket = (static_cast<double>(hasher_(key))
157 1496749357 * static_cast<double>(capacity_)
158 / static_cast<double>(static_cast<uint32_t>(-1)));
159 1496749357 return static_cast<uint32_t>(bucket) % capacity_;
160 }
161
162 223163 void AllocMemory() {
163 223163 keys_ = static_cast<Key *>(smmap(capacity_ * sizeof(Key)));
164 223163 values_ = static_cast<Value *>(smmap(capacity_ * sizeof(Value)));
165
2/2
✓ Branch 0 taken 910992310 times.
✓ Branch 1 taken 112671 times.
 1817617402 for (uint32_t i = 0; i < capacity_; ++i) {
166 1817394203 /*keys_[i] =*/new (keys_ + i) Key();
167 }
168
1/2
✓ Branch 0 taken 910868560 times.
✗ Branch 1 not taken.
 1816474402 for (uint32_t i = 0; i < capacity_; ++i) {
169 1817146703 /*values_[i] =*/new (values_ + i) Value();
170 }
171 129077 bytes_allocated_ = (sizeof(Key) + sizeof(Value)) * capacity_;
172 129077 }
173
174 223061 void DeallocMemory(Key *k, Value *v, uint32_t c) {
175
2/2
✓ Branch 0 taken 914063992 times.
✓ Branch 1 taken 112601 times.
 1823763358 for (uint32_t i = 0; i < c; ++i) {
176 1823540297 k[i].~Key();
177 }
178
2/2
✓ Branch 0 taken 913661872 times.
✓ Branch 1 taken 112601 times.
 1822959118 for (uint32_t i = 0; i < c; ++i) {
179 1822736057 v[i].~Value();
180 }
181
1/2
✓ Branch 0 taken 112601 times.
✗ Branch 1 not taken.
 223061 if (k)
182 223061 smunmap(k);
183
1/2
✓ Branch 0 taken 112601 times.
✗ Branch 1 not taken.
 223061 if (v)
184 223061 smunmap(v);
185 223061 k = NULL;
186 223061 v = NULL;
187 223061 }
188
189 // Returns true iff the key is overwritten
190 1271833048 bool DoInsert(const Key &key, const Value &value,
191 const bool count_collisions) {
192 uint32_t bucket;
193 uint32_t collisions;
194
1/2
✓ Branch 1 taken 657515531 times.
✗ Branch 2 not taken.
 1271833048 const bool overwritten = DoLookup(key, &bucket, &collisions);
195
2/2
✓ Branch 0 taken 552724582 times.
✓ Branch 1 taken 104790949 times.
 1266235587 if (count_collisions) {
196 1077640991 num_collisions_ += collisions;
197 1077640991 max_collisions_ = std::max(collisions, max_collisions_);
198 }
199 1269059784 keys_[bucket] = key;
200
1/2
✓ Branch 1 taken 20837548 times.
✗ Branch 2 not taken.
 1269059784 values_[bucket] = value;
201 1269059784 return overwritten;
202 }
203
204 1504422236 bool DoLookup(const Key &key, uint32_t *bucket, uint32_t *collisions) const {
205 1504422236 *bucket = ScaleHash(key);
206 1495771916 *collisions = 0;
207
3/3
✓ Branch 0 taken 11505397946 times.
✓ Branch 1 taken 620236483 times.
✓ Branch 2 taken 138814801 times.
 13637842838 while (!(keys_[*bucket] == empty_key_)) {
208
3/3
✓ Branch 0 taken 129656857 times.
✓ Branch 1 taken 11391186133 times.
✓ Branch 2 taken 92408639 times.
 12385370046 if (keys_[*bucket] == key)
209 243299124 return true;
210 12142070922 *bucket = (*bucket + 1) % capacity_;
211 12142070922 (*collisions)++;
212 }
213 1252472792 return false;
214 }
215
216 223241 void DoClear(const bool reset_capacity) {
217
2/2
✓ Branch 0 taken 1208 times.
✓ Branch 1 taken 111505 times.
 223241 if (reset_capacity)
218 2000 static_cast<Derived *>(this)->ResetCapacity(); // No-op if fixed-size
219
2/2
✓ Branch 0 taken 913473430 times.
✓ Branch 1 taken 112713 times.
 1822522354 for (uint32_t i = 0; i < capacity_; ++i)
220 1822299113 keys_[i] = empty_key_;
221 223241 size_ = 0;
222 223241 }
223
224 // Methods for resizable version
225 void SetThresholds() { }
226 void Grow() { }
227 void Shrink() { }
228 void ResetCapacity() { }
229
230 // Separate key and value arrays for better locality
231 Key *keys_;
232 Value *values_;
233 uint32_t capacity_;
234 uint32_t initial_capacity_;
235 uint32_t size_;
236 uint32_t (*hasher_)(const Key &key);
237 uint64_t bytes_allocated_;
238 uint64_t num_collisions_;
239 uint32_t max_collisions_; /**< maximum collisions for a single insert */
240 Key empty_key_;
241 };
242
243
244 template<class Key, class Value>
245 class SmallHashFixed
246 : public SmallHashBase<Key, Value, SmallHashFixed<Key, Value> > {
247 friend class SmallHashBase<Key, Value, SmallHashFixed<Key, Value> >;
248
249 protected:
250 // No-ops
251 3427 void SetThresholds() { }
252 380645 void Grow() { }
253 25714 void Shrink() { }
254 42 void ResetCapacity() { }
255 };
256
257
258 template<class Key, class Value>
259 class SmallHashDynamic
260 : public SmallHashBase<Key, Value, SmallHashDynamic<Key, Value> > {
261 friend class SmallHashBase<Key, Value, SmallHashDynamic<Key, Value> >;
262
263 public:
264 typedef SmallHashBase<Key, Value, SmallHashDynamic<Key, Value> > Base;
265 static const double kThresholdGrow;
266 static const double kThresholdShrink;
267
268 138911 SmallHashDynamic() : Base() {
269 138911 num_migrates_ = 0;
270
271 // Properly set by Init
272 138911 threshold_grow_ = 0;
273 138911 threshold_shrink_ = 0;
274 138911 }
275
276 SmallHashDynamic(const SmallHashDynamic<Key, Value> &other) : Base() {
277 num_migrates_ = 0;
278 CopyFrom(other);
279 }
280
281 98 SmallHashDynamic<Key, Value> &operator=(
282 const SmallHashDynamic<Key, Value> &other) {
283
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 58 times.
 98 if (&other == this)
284 ✗ return *this;
285
286 98 CopyFrom(other);
287 98 return *this;
288 }
289
290 40631204 uint32_t capacity() const { return Base::capacity_; }
291 627118440 uint32_t size() const { return Base::size_; }
292 uint32_t num_migrates() const { return num_migrates_; }
293
294 protected:
295 219736 void SetThresholds() {
296 219736 threshold_grow_ = static_cast<uint32_t>(static_cast<double>(capacity())
297 219736 * kThresholdGrow);
298 219736 threshold_shrink_ = static_cast<uint32_t>(static_cast<double>(capacity())
299 219736 * kThresholdShrink);
300 219736 }
301
302 1080820966 void Grow() {
303
2/2
✓ Branch 1 taken 27060 times.
✓ Branch 2 taken 553625975 times.
 1080820966 if (size() > threshold_grow_)
304 54120 Migrate(capacity() * 2);
305 1079912558 }
306
307 67808451 void Shrink() {
308
2/2
✓ Branch 1 taken 19937630 times.
✓ Branch 2 taken 47969812 times.
 67808451 if (size() < threshold_shrink_) {
309 19940490 const uint32_t target_capacity = capacity() / 2;
310
2/2
✓ Branch 0 taken 12384 times.
✓ Branch 1 taken 19921099 times.
 19936343 if (target_capacity >= Base::initial_capacity_)
311 12384 Migrate(target_capacity);
312 }
313 67906155 }
314
315 1958 void ResetCapacity() {
316 1958 Base::DeallocMemory(Base::keys_, Base::values_, Base::capacity_);
317 1958 Base::capacity_ = Base::initial_capacity_;
318 1958 Base::AllocMemory();
319 1958 SetThresholds();
320 1958 }
321
322 private:
323 // Returns a random permutation of indices [0..N-1] that is allocated
324 // by smmap (Knuth's shuffle algorithm)
325 24884 uint32_t *ShuffleIndices(const uint32_t N) {
326 24884 uint32_t *shuffled = static_cast<uint32_t *>(smmap(N * sizeof(uint32_t)));
327 // Init with identity
328
2/2
✓ Branch 0 taken 201897642 times.
✓ Branch 1 taken 12442 times.
 403820168 for (unsigned i = 0; i < N; ++i)
329 403795284 shuffled[i] = i;
330 // Shuffle (no shuffling for the last element)
331
1/2
✓ Branch 0 taken 191825828 times.
✗ Branch 1 not taken.
 383406108 for (unsigned i = 0; i < N - 1; ++i) {
332 383651656 const uint32_t swap_idx = i + g_prng.Next(N - i);
333 383381224 const uint32_t tmp = shuffled[i];
334 383381224 shuffled[i] = shuffled[swap_idx];
335 383381224 shuffled[swap_idx] = tmp;
336 }
337 98 return shuffled;
338 }
339
340 78888 void Migrate(const uint32_t new_capacity) {
341 78888 Key *old_keys = Base::keys_;
342 78888 Value *old_values = Base::values_;
343 78888 const uint32_t old_capacity = capacity();
344 78888 const uint32_t old_size = size();
345
346 78888 Base::capacity_ = new_capacity;
347 78888 SetThresholds();
348 78888 Base::AllocMemory();
349 78924 Base::DoClear(false);
350
2/2
✓ Branch 0 taken 12384 times.
✓ Branch 1 taken 27078 times.
 78924 if (new_capacity < old_capacity) {
351 24768 uint32_t *shuffled_indices = ShuffleIndices(old_capacity);
352
1/2
✓ Branch 0 taken 174587238 times.
✗ Branch 1 not taken.
 348606468 for (uint32_t i = 0; i < old_capacity; ++i) {
353
2/3
✓ Branch 0 taken 44023122 times.
✓ Branch 1 taken 130564116 times.
✗ Branch 2 not taken.
 349174476 if (old_keys[shuffled_indices[i]] != Base::empty_key_) {
354 88046244 Base::Insert(old_keys[shuffled_indices[i]],
355 88046244 old_values[shuffled_indices[i]]);
356 }
357 }
358 ✗ smunmap(shuffled_indices);
359 } else {
360
2/2
✓ Branch 0 taken 336489201 times.
✓ Branch 1 taken 19446 times.
 673017294 for (uint32_t i = 0; i < old_capacity; ++i) {
361
3/3
✓ Branch 0 taken 189148770 times.
✓ Branch 1 taken 126128958 times.
✓ Branch 2 taken 21211473 times.
 672978402 if (old_keys[i] != Base::empty_key_)
362 505576182 Base::Insert(old_keys[i], old_values[i]);
363 }
364 }
365
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 39444 times.
 63660 assert(size() == old_size);
366
367 78888 Base::DeallocMemory(old_keys, old_values, old_capacity);
368 78924 num_migrates_++;
369 78924 }
370
371 98 void CopyFrom(const SmallHashDynamic<Key, Value> &other) {
372 98 uint32_t *shuffled_indices = ShuffleIndices(other.capacity_);
373
2/2
✓ Branch 0 taken 24773448 times.
✓ Branch 1 taken 58 times.
 24774386 for (uint32_t i = 0; i < other.capacity_; ++i) {
374
2/3
✗ Branch 0 not taken.
✓ Branch 1 taken 18000420 times.
✓ Branch 2 taken 6773028 times.
 24774288 if (other.keys_[shuffled_indices[i]] != other.empty_key_) {
375 18000000 this->Insert(other.keys_[shuffled_indices[i]],
376 18000000 other.values_[shuffled_indices[i]]);
377 }
378 }
379 98 smunmap(shuffled_indices);
380 98 }
381
382 uint32_t num_migrates_;
383 uint32_t threshold_grow_;
384 uint32_t threshold_shrink_;
385 static Prng g_prng;
386 };
387
388
389 /**
390 * Distributes the key-value pairs over $n$ dynamic hash maps with individual
391 * mutexes. Hence low mutex contention, and benefits from multiple processors.
392 */
393 template<class Key, class Value>
394 class MultiHash {
395 public:
396 180 MultiHash() {
397 180 num_hashmaps_ = 0;
398 180 hashmaps_ = NULL;
399 180 locks_ = NULL;
400 180 }
401
402 180 void Init(const uint8_t num_hashmaps, const Key &empty_key,
403 uint32_t (*hasher)(const Key &key)) {
404
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 180 times.
 180 assert(num_hashmaps > 0);
405 180 const uint8_t N = num_hashmaps;
406 180 num_hashmaps_ = N;
407
3/4
✓ Branch 2 taken 7560 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 7560 times.
✓ Branch 5 taken 180 times.
 7740 hashmaps_ = new SmallHashDynamic<Key, Value>[N]();
408 180 locks_ = static_cast<pthread_mutex_t *>(
409 180 smalloc(N * sizeof(pthread_mutex_t)));
410
2/2
✓ Branch 0 taken 7560 times.
✓ Branch 1 taken 180 times.
 7740 for (uint8_t i = 0; i < N; ++i) {
411 7560 int retval = pthread_mutex_init(&locks_[i], NULL);
412
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 7560 times.
 7560 assert(retval == 0);
413 7560 hashmaps_[i].Init(128, empty_key, hasher);
414 }
415 180 }
416
417 180 ~MultiHash() {
418
2/2
✓ Branch 0 taken 7560 times.
✓ Branch 1 taken 180 times.
 7740 for (uint8_t i = 0; i < num_hashmaps_; ++i) {
419 7560 pthread_mutex_destroy(&locks_[i]);
420 }
421 180 free(locks_);
422
3/4
✓ Branch 0 taken 180 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 7560 times.
✓ Branch 3 taken 180 times.
 7740 delete[] hashmaps_;
423 180 }
424
425 18000000 bool Lookup(const Key &key, Value *value) {
426 18000000 uint8_t target = SelectHashmap(key);
427 18000000 Lock(target);
428 18000000 const bool result = hashmaps_[target].Lookup(key, value);
429 18000000 Unlock(target);
430 18000000 return result;
431 }
432
433 67736538 void Insert(const Key &key, const Value &value) {
434 67736538 uint8_t target = SelectHashmap(key);
435 66722544 Lock(target);
436 68029704 hashmaps_[target].Insert(key, value);
437 66054456 Unlock(target);
438 68951412 }
439
440 32811786 void Erase(const Key &key) {
441 32811786 uint8_t target = SelectHashmap(key);
442 31921506 Lock(target);
443 33134544 hashmaps_[target].Erase(key);
444 30027168 Unlock(target);
445 33714792 }
446
447 18 void Clear() {
448
2/2
✓ Branch 0 taken 756 times.
✓ Branch 1 taken 18 times.
 774 for (uint8_t i = 0; i < num_hashmaps_; ++i)
449 756 Lock(i);
450
2/2
✓ Branch 0 taken 756 times.
✓ Branch 1 taken 18 times.
 774 for (uint8_t i = 0; i < num_hashmaps_; ++i)
451 756 hashmaps_[i].Clear();
452
2/2
✓ Branch 0 taken 756 times.
✓ Branch 1 taken 18 times.
 774 for (uint8_t i = 0; i < num_hashmaps_; ++i)
453 756 Unlock(i);
454 18 }
455
456 180 uint8_t num_hashmaps() const { return num_hashmaps_; }
457
458 144 void GetSizes(uint32_t *sizes) {
459
2/2
✓ Branch 0 taken 6048 times.
✓ Branch 1 taken 144 times.
 6192 for (uint8_t i = 0; i < num_hashmaps_; ++i) {
460 6048 Lock(i);
461 6048 sizes[i] = hashmaps_[i].size();
462 6048 Unlock(i);
463 }
464 144 }
465
466 void GetCollisionStats(uint64_t *num_collisions, uint32_t *max_collisions) {
467 for (uint8_t i = 0; i < num_hashmaps_; ++i) {
468 Lock(i);
469 hashmaps_[i].GetCollisionStats(&num_collisions[i], &max_collisions[i]);
470 Unlock(i);
471 }
472 }
473
474 private:
475 121767480 inline uint8_t SelectHashmap(const Key &key) {
476 121767480 uint32_t hash = MurmurHash2(&key, sizeof(key), 0x37);
477 117769086 double bucket = static_cast<double>(hash)
478 117769086 * static_cast<double>(num_hashmaps_)
479 / static_cast<double>(static_cast<uint32_t>(-1));
480 117769086 return static_cast<uint32_t>(bucket) % num_hashmaps_;
481 }
482
483 116657388 inline void Lock(const uint8_t target) {
484 116657388 int retval = pthread_mutex_lock(&locks_[target]);
485
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 124039620 times.
 124039620 assert(retval == 0);
486 124039620 }
487
488 114085134 inline void Unlock(const uint8_t target) {
489 114085134 int retval = pthread_mutex_unlock(&locks_[target]);
490
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 124457598 times.
 124457598 assert(retval == 0);
491 124457598 }
492
493 uint8_t num_hashmaps_;
494 SmallHashDynamic<Key, Value> *hashmaps_;
495 pthread_mutex_t *locks_;
496 };
497
498
499 // initialize the static fields
500 template<class Key, class Value>
501 Prng SmallHashDynamic<Key, Value>::g_prng;
502
503 template<class Key, class Value, class Derived>
504 const double SmallHashBase<Key, Value, Derived>::kLoadFactor = 0.75;
505
506 template<class Key, class Value>
507 const double SmallHashDynamic<Key, Value>::kThresholdGrow = 0.75;
508
509 template<class Key, class Value>
510 const double SmallHashDynamic<Key, Value>::kThresholdShrink = 0.25;
511
512 #endif // CVMFS_SMALLHASH_H_
513