4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 only,
8 * as published by the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License version 2 for more details (a copy is included
14 * in the LICENSE file that accompanied this code).
16 * You should have received a copy of the GNU General Public License
17 * version 2 along with this program; If not, see
18 * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf
20 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
21 * CA 95054 USA or visit www.sun.com if you need additional information or
27 * Copyright (c) 2008, 2010, Oracle and/or its affiliates. All rights reserved.
28 * Use is subject to license terms.
30 * Copyright (c) 2012, 2015 Intel Corporation.
33 * This file is part of Lustre, http://www.lustre.org/
34 * Lustre is a trademark of Sun Microsystems, Inc.
36 * libcfs/include/libcfs/libcfs_hash.h
42 #ifndef __LIBCFS_HASH_H__
43 #define __LIBCFS_HASH_H__
45 #include <linux/hash.h>
48 * Knuth recommends primes in approximately golden ratio to the maximum
49 * integer representable by a machine word for multiplicative hashing.
50 * Chuck Lever verified the effectiveness of this technique:
51 * http://www.citi.umich.edu/techreports/reports/citi-tr-00-1.pdf
53 * These primes are chosen to be bit-sparse, that is operations on
54 * them can use shifts and additions instead of multiplications for
55 * machines where multiplications are slow.
57 /* 2^31 + 2^29 - 2^25 + 2^22 - 2^19 - 2^16 + 1 */
58 #define CFS_GOLDEN_RATIO_PRIME_32 0x9e370001UL
59 /* 2^63 + 2^61 - 2^57 + 2^54 - 2^51 - 2^18 + 1 */
60 #define CFS_GOLDEN_RATIO_PRIME_64 0x9e37fffffffc0001ULL
63 #define CFS_HASH_DEBUG_NONE 0
64 /** record hash depth and output to console when it's too deep,
65 * computing overhead is low but consume more memory */
66 #define CFS_HASH_DEBUG_1 1
67 /** expensive, check key validation */
68 #define CFS_HASH_DEBUG_2 2
70 #define CFS_HASH_DEBUG_LEVEL CFS_HASH_DEBUG_NONE
73 struct cfs_hash_lock_ops;
74 struct cfs_hash_hlist_ops;
77 rwlock_t rw; /**< rwlock */
78 spinlock_t spin; /**< spinlock */
82 * cfs_hash_bucket is a container of:
84 * - array of hash-head starting from hsb_head[0], hash-head can be one of
85 * . struct cfs_hash_head
86 * . struct cfs_hash_head_dep
87 * . struct cfs_hash_dhead
88 * . struct cfs_hash_dhead_dep
89 * which depends on requirement of user
90 * - some extra bytes (caller can require it while creating hash)
92 struct cfs_hash_bucket {
93 union cfs_hash_lock hsb_lock; /**< bucket lock */
94 __u32 hsb_count; /**< current entries */
95 __u32 hsb_version; /**< change version */
96 unsigned int hsb_index; /**< index of bucket */
97 int hsb_depmax; /**< max depth on bucket */
98 long hsb_head[0]; /**< hash-head array */
102 * cfs_hash bucket descriptor, it's normally in stack of caller
105 /* address of bucket */
106 struct cfs_hash_bucket *bd_bucket;
107 /* offset in bucket */
108 unsigned int bd_offset;
111 #define CFS_HASH_NAME_LEN 16 /**< default name length */
112 #define CFS_HASH_BIGNAME_LEN 64 /**< bigname for param tree */
114 #define CFS_HASH_BKT_BITS 3 /**< default bits of bucket */
115 #define CFS_HASH_BITS_MAX 30 /**< max bits of bucket */
116 #define CFS_HASH_BITS_MIN CFS_HASH_BKT_BITS
119 * common hash attributes.
123 * don't need any lock, caller will protect operations with it's
124 * own lock. With this flag:
125 * . CFS_HASH_NO_BKTLOCK, CFS_HASH_RW_BKTLOCK, CFS_HASH_SPIN_BKTLOCK
127 * . Some functions will be disabled with this flag, i.e:
128 * cfs_hash_for_each_empty, cfs_hash_rehash
130 CFS_HASH_NO_LOCK = 1 << 0,
131 /** no bucket lock, use one spinlock to protect the whole hash */
132 CFS_HASH_NO_BKTLOCK = 1 << 1,
133 /** rwlock to protect bucket */
134 CFS_HASH_RW_BKTLOCK = 1 << 2,
135 /** spinlock to protect bucket */
136 CFS_HASH_SPIN_BKTLOCK = 1 << 3,
137 /** always add new item to tail */
138 CFS_HASH_ADD_TAIL = 1 << 4,
139 /** hash-table doesn't have refcount on item */
140 CFS_HASH_NO_ITEMREF = 1 << 5,
141 /** big name for param-tree */
142 CFS_HASH_BIGNAME = 1 << 6,
143 /** track global count */
144 CFS_HASH_COUNTER = 1 << 7,
145 /** rehash item by new key */
146 CFS_HASH_REHASH_KEY = 1 << 8,
147 /** Enable dynamic hash resizing */
148 CFS_HASH_REHASH = 1 << 9,
149 /** can shrink hash-size */
150 CFS_HASH_SHRINK = 1 << 10,
151 /** assert hash is empty on exit */
152 CFS_HASH_ASSERT_EMPTY = 1 << 11,
153 /** record hlist depth */
154 CFS_HASH_DEPTH = 1 << 12,
156 * rehash is always scheduled in a different thread, so current
157 * change on hash table is non-blocking
159 CFS_HASH_NBLK_CHANGE = 1 << 13,
160 /** NB, we typed hs_flags as __u16, please change it
161 * if you need to extend >=16 flags */
164 /** most used attributes */
165 #define CFS_HASH_DEFAULT (CFS_HASH_RW_BKTLOCK | \
166 CFS_HASH_COUNTER | CFS_HASH_REHASH)
169 * cfs_hash is a hash-table implementation for general purpose, it can support:
170 * . two refcount modes
171 * hash-table with & without refcount
173 * nolock, one-spinlock, rw-bucket-lock, spin-bucket-lock
174 * . general operations
175 * lookup, add(add_tail or add_head), delete
179 * locked iteration and unlocked iteration
181 * support long name hash
183 * trace max searching depth
186 * When the htable grows or shrinks, a separate task (cfs_hash_rehash_worker)
187 * is spawned to handle the rehash in the background, it's possible that other
188 * processes can concurrently perform additions, deletions, and lookups
189 * without being blocked on rehash completion, because rehash will release
190 * the global wrlock for each bucket.
192 * rehash and iteration can't run at the same time because it's too tricky
193 * to keep both of them safe and correct.
194 * As they are relatively rare operations, so:
195 * . if iteration is in progress while we try to launch rehash, then
196 * it just giveup, iterator will launch rehash at the end.
197 * . if rehash is in progress while we try to iterate the hash table,
198 * then we just wait (shouldn't be very long time), anyway, nobody
199 * should expect iteration of whole hash-table to be non-blocking.
201 * During rehashing, a (key,object) pair may be in one of two buckets,
202 * depending on whether the worker task has yet to transfer the object
203 * to its new location in the table. Lookups and deletions need to search both
204 * locations; additions must take care to only insert into the new bucket.
208 /** serialize with rehash, or serialize all operations if
209 * the hash-table has CFS_HASH_NO_BKTLOCK */
210 union cfs_hash_lock hs_lock;
211 /** hash operations */
212 struct cfs_hash_ops *hs_ops;
213 /** hash lock operations */
214 struct cfs_hash_lock_ops *hs_lops;
215 /** hash list operations */
216 struct cfs_hash_hlist_ops *hs_hops;
217 /** hash buckets-table */
218 struct cfs_hash_bucket **hs_buckets;
219 /** total number of items on this hash-table */
221 /** hash flags, see cfs_hash_tag for detail */
223 /** # of extra-bytes for bucket, for user saving extended attributes */
224 __u16 hs_extra_bytes;
225 /** wants to iterate */
227 /** hash-table is dying */
229 /** current hash bits */
235 /** bits for rehash */
237 /** bits for each bucket */
239 /** resize min threshold */
241 /** resize max threshold */
244 __u32 hs_rehash_count;
245 /** # of iterators (caller of cfs_hash_for_each_*) */
247 /** rehash workitem */
248 struct cfs_workitem hs_rehash_wi;
249 /** refcount on this hash table */
250 atomic_t hs_refcount;
251 /** rehash buckets-table */
252 struct cfs_hash_bucket **hs_rehash_buckets;
253 #if CFS_HASH_DEBUG_LEVEL >= CFS_HASH_DEBUG_1
254 /** serialize debug members */
255 spinlock_t hs_dep_lock;
257 unsigned int hs_dep_max;
258 /** id of the deepest bucket */
259 unsigned int hs_dep_bkt;
260 /** offset in the deepest bucket */
261 unsigned int hs_dep_off;
262 /** bits when we found the max depth */
263 unsigned int hs_dep_bits;
264 /** workitem to output max depth */
265 struct cfs_workitem hs_dep_wi;
267 /** name of htable */
271 struct cfs_hash_lock_ops {
272 /** lock the hash table */
273 void (*hs_lock)(union cfs_hash_lock *lock, int exclusive);
274 /** unlock the hash table */
275 void (*hs_unlock)(union cfs_hash_lock *lock, int exclusive);
276 /** lock the hash bucket */
277 void (*hs_bkt_lock)(union cfs_hash_lock *lock, int exclusive);
278 /** unlock the hash bucket */
279 void (*hs_bkt_unlock)(union cfs_hash_lock *lock, int exclusive);
282 struct cfs_hash_hlist_ops {
283 /** return hlist_head of hash-head of @bd */
284 struct hlist_head *(*hop_hhead)(struct cfs_hash *hs,
285 struct cfs_hash_bd *bd);
286 /** return hash-head size */
287 int (*hop_hhead_size)(struct cfs_hash *hs);
288 /** add @hnode to hash-head of @bd */
289 int (*hop_hnode_add)(struct cfs_hash *hs, struct cfs_hash_bd *bd,
290 struct hlist_node *hnode);
291 /** remove @hnode from hash-head of @bd */
292 int (*hop_hnode_del)(struct cfs_hash *hs, struct cfs_hash_bd *bd,
293 struct hlist_node *hnode);
296 struct cfs_hash_ops {
297 /** return hashed value from @key */
298 unsigned (*hs_hash)(struct cfs_hash *hs, const void *key,
300 /** return key address of @hnode */
301 void * (*hs_key)(struct hlist_node *hnode);
302 /** copy key from @hnode to @key */
303 void (*hs_keycpy)(struct hlist_node *hnode, void *key);
305 * compare @key with key of @hnode
306 * returns 1 on a match
308 int (*hs_keycmp)(const void *key, struct hlist_node *hnode);
309 /** return object address of @hnode, i.e: container_of(...hnode) */
310 void * (*hs_object)(struct hlist_node *hnode);
311 /** get refcount of item, always called with holding bucket-lock */
312 void (*hs_get)(struct cfs_hash *hs, struct hlist_node *hnode);
313 /** release refcount of item */
314 void (*hs_put)(struct cfs_hash *hs, struct hlist_node *hnode);
315 /** release refcount of item, always called with holding bucket-lock */
316 void (*hs_put_locked)(struct cfs_hash *hs,
317 struct hlist_node *hnode);
318 /** it's called before removing of @hnode */
319 void (*hs_exit)(struct cfs_hash *hs, struct hlist_node *hnode);
322 /** total number of buckets in @hs */
323 #define CFS_HASH_NBKT(hs) \
324 (1U << ((hs)->hs_cur_bits - (hs)->hs_bkt_bits))
326 /** total number of buckets in @hs while rehashing */
327 #define CFS_HASH_RH_NBKT(hs) \
328 (1U << ((hs)->hs_rehash_bits - (hs)->hs_bkt_bits))
330 /** number of hlist for in bucket */
331 #define CFS_HASH_BKT_NHLIST(hs) (1U << (hs)->hs_bkt_bits)
333 /** total number of hlist in @hs */
334 #define CFS_HASH_NHLIST(hs) (1U << (hs)->hs_cur_bits)
336 /** total number of hlist in @hs while rehashing */
337 #define CFS_HASH_RH_NHLIST(hs) (1U << (hs)->hs_rehash_bits)
340 cfs_hash_with_no_lock(struct cfs_hash *hs)
342 /* caller will serialize all operations for this hash-table */
343 return (hs->hs_flags & CFS_HASH_NO_LOCK) != 0;
347 cfs_hash_with_no_bktlock(struct cfs_hash *hs)
349 /* no bucket lock, one single lock to protect the hash-table */
350 return (hs->hs_flags & CFS_HASH_NO_BKTLOCK) != 0;
354 cfs_hash_with_rw_bktlock(struct cfs_hash *hs)
356 /* rwlock to protect hash bucket */
357 return (hs->hs_flags & CFS_HASH_RW_BKTLOCK) != 0;
361 cfs_hash_with_spin_bktlock(struct cfs_hash *hs)
363 /* spinlock to protect hash bucket */
364 return (hs->hs_flags & CFS_HASH_SPIN_BKTLOCK) != 0;
368 cfs_hash_with_add_tail(struct cfs_hash *hs)
370 return (hs->hs_flags & CFS_HASH_ADD_TAIL) != 0;
374 cfs_hash_with_no_itemref(struct cfs_hash *hs)
376 /* hash-table doesn't keep refcount on item,
377 * item can't be removed from hash unless it's
379 return (hs->hs_flags & CFS_HASH_NO_ITEMREF) != 0;
383 cfs_hash_with_bigname(struct cfs_hash *hs)
385 return (hs->hs_flags & CFS_HASH_BIGNAME) != 0;
389 cfs_hash_with_counter(struct cfs_hash *hs)
391 return (hs->hs_flags & CFS_HASH_COUNTER) != 0;
395 cfs_hash_with_rehash(struct cfs_hash *hs)
397 return (hs->hs_flags & CFS_HASH_REHASH) != 0;
401 cfs_hash_with_rehash_key(struct cfs_hash *hs)
403 return (hs->hs_flags & CFS_HASH_REHASH_KEY) != 0;
407 cfs_hash_with_shrink(struct cfs_hash *hs)
409 return (hs->hs_flags & CFS_HASH_SHRINK) != 0;
413 cfs_hash_with_assert_empty(struct cfs_hash *hs)
415 return (hs->hs_flags & CFS_HASH_ASSERT_EMPTY) != 0;
419 cfs_hash_with_depth(struct cfs_hash *hs)
421 return (hs->hs_flags & CFS_HASH_DEPTH) != 0;
425 cfs_hash_with_nblk_change(struct cfs_hash *hs)
427 return (hs->hs_flags & CFS_HASH_NBLK_CHANGE) != 0;
431 cfs_hash_is_exiting(struct cfs_hash *hs)
433 /* cfs_hash_destroy is called */
434 return hs->hs_exiting;
438 cfs_hash_is_rehashing(struct cfs_hash *hs)
440 /* rehash is launched */
441 return hs->hs_rehash_bits != 0;
445 cfs_hash_is_iterating(struct cfs_hash *hs)
447 /* someone is calling cfs_hash_for_each_* */
448 return hs->hs_iterating || hs->hs_iterators != 0;
452 cfs_hash_bkt_size(struct cfs_hash *hs)
454 return offsetof(struct cfs_hash_bucket, hsb_head[0]) +
455 hs->hs_hops->hop_hhead_size(hs) * CFS_HASH_BKT_NHLIST(hs) +
459 static inline unsigned
460 cfs_hash_id(struct cfs_hash *hs, const void *key, unsigned mask)
462 return hs->hs_ops->hs_hash(hs, key, mask);
466 cfs_hash_key(struct cfs_hash *hs, struct hlist_node *hnode)
468 return hs->hs_ops->hs_key(hnode);
472 cfs_hash_keycpy(struct cfs_hash *hs, struct hlist_node *hnode, void *key)
474 if (hs->hs_ops->hs_keycpy)
475 hs->hs_ops->hs_keycpy(hnode, key);
479 * Returns 1 on a match,
482 cfs_hash_keycmp(struct cfs_hash *hs, const void *key, struct hlist_node *hnode)
484 return hs->hs_ops->hs_keycmp(key, hnode);
488 cfs_hash_object(struct cfs_hash *hs, struct hlist_node *hnode)
490 return hs->hs_ops->hs_object(hnode);
494 cfs_hash_get(struct cfs_hash *hs, struct hlist_node *hnode)
496 return hs->hs_ops->hs_get(hs, hnode);
500 cfs_hash_put_locked(struct cfs_hash *hs, struct hlist_node *hnode)
502 return hs->hs_ops->hs_put_locked(hs, hnode);
506 cfs_hash_put(struct cfs_hash *hs, struct hlist_node *hnode)
508 return hs->hs_ops->hs_put(hs, hnode);
512 cfs_hash_exit(struct cfs_hash *hs, struct hlist_node *hnode)
514 if (hs->hs_ops->hs_exit)
515 hs->hs_ops->hs_exit(hs, hnode);
518 static inline void cfs_hash_lock(struct cfs_hash *hs, int excl)
520 hs->hs_lops->hs_lock(&hs->hs_lock, excl);
523 static inline void cfs_hash_unlock(struct cfs_hash *hs, int excl)
525 hs->hs_lops->hs_unlock(&hs->hs_lock, excl);
528 static inline int cfs_hash_dec_and_lock(struct cfs_hash *hs,
531 LASSERT(cfs_hash_with_no_bktlock(hs));
532 return atomic_dec_and_lock(condition, &hs->hs_lock.spin);
535 static inline void cfs_hash_bd_lock(struct cfs_hash *hs,
536 struct cfs_hash_bd *bd, int excl)
538 hs->hs_lops->hs_bkt_lock(&bd->bd_bucket->hsb_lock, excl);
541 static inline void cfs_hash_bd_unlock(struct cfs_hash *hs,
542 struct cfs_hash_bd *bd, int excl)
544 hs->hs_lops->hs_bkt_unlock(&bd->bd_bucket->hsb_lock, excl);
548 * operations on cfs_hash bucket (bd: bucket descriptor),
549 * they are normally for hash-table without rehash
551 void cfs_hash_bd_get(struct cfs_hash *hs, const void *key,
552 struct cfs_hash_bd *bd);
555 cfs_hash_bd_get_and_lock(struct cfs_hash *hs, const void *key,
556 struct cfs_hash_bd *bd, int excl)
558 cfs_hash_bd_get(hs, key, bd);
559 cfs_hash_bd_lock(hs, bd, excl);
562 static inline unsigned
563 cfs_hash_bd_index_get(struct cfs_hash *hs, struct cfs_hash_bd *bd)
565 return bd->bd_offset | (bd->bd_bucket->hsb_index << hs->hs_bkt_bits);
569 cfs_hash_bd_index_set(struct cfs_hash *hs, unsigned index,
570 struct cfs_hash_bd *bd)
572 bd->bd_bucket = hs->hs_buckets[index >> hs->hs_bkt_bits];
573 bd->bd_offset = index & (CFS_HASH_BKT_NHLIST(hs) - 1U);
577 cfs_hash_bd_extra_get(struct cfs_hash *hs, struct cfs_hash_bd *bd)
579 return (void *)bd->bd_bucket +
580 cfs_hash_bkt_size(hs) - hs->hs_extra_bytes;
584 cfs_hash_bd_version_get(struct cfs_hash_bd *bd)
586 /* need hold cfs_hash_bd_lock */
587 return bd->bd_bucket->hsb_version;
591 cfs_hash_bd_count_get(struct cfs_hash_bd *bd)
593 /* need hold cfs_hash_bd_lock */
594 return bd->bd_bucket->hsb_count;
598 cfs_hash_bd_depmax_get(struct cfs_hash_bd *bd)
600 return bd->bd_bucket->hsb_depmax;
604 cfs_hash_bd_compare(struct cfs_hash_bd *bd1, struct cfs_hash_bd *bd2)
606 if (bd1->bd_bucket->hsb_index != bd2->bd_bucket->hsb_index)
607 return bd1->bd_bucket->hsb_index - bd2->bd_bucket->hsb_index;
609 if (bd1->bd_offset != bd2->bd_offset)
610 return bd1->bd_offset - bd2->bd_offset;
615 void cfs_hash_bd_add_locked(struct cfs_hash *hs, struct cfs_hash_bd *bd,
616 struct hlist_node *hnode);
617 void cfs_hash_bd_del_locked(struct cfs_hash *hs, struct cfs_hash_bd *bd,
618 struct hlist_node *hnode);
619 void cfs_hash_bd_move_locked(struct cfs_hash *hs, struct cfs_hash_bd *bd_old,
620 struct cfs_hash_bd *bd_new,
621 struct hlist_node *hnode);
624 cfs_hash_bd_dec_and_lock(struct cfs_hash *hs, struct cfs_hash_bd *bd,
627 LASSERT(cfs_hash_with_spin_bktlock(hs));
628 return atomic_dec_and_lock(condition, &bd->bd_bucket->hsb_lock.spin);
631 static inline struct hlist_head *
632 cfs_hash_bd_hhead(struct cfs_hash *hs, struct cfs_hash_bd *bd)
634 return hs->hs_hops->hop_hhead(hs, bd);
638 cfs_hash_bd_lookup_locked(struct cfs_hash *hs, struct cfs_hash_bd *bd,
641 cfs_hash_bd_peek_locked(struct cfs_hash *hs, struct cfs_hash_bd *bd,
645 * operations on cfs_hash bucket (bd: bucket descriptor),
646 * they are safe for hash-table with rehash
648 void cfs_hash_dual_bd_get(struct cfs_hash *hs, const void *key,
649 struct cfs_hash_bd *bds);
650 void cfs_hash_dual_bd_lock(struct cfs_hash *hs, struct cfs_hash_bd *bds,
652 void cfs_hash_dual_bd_unlock(struct cfs_hash *hs, struct cfs_hash_bd *bds,
656 cfs_hash_dual_bd_get_and_lock(struct cfs_hash *hs, const void *key,
657 struct cfs_hash_bd *bds, int excl)
659 cfs_hash_dual_bd_get(hs, key, bds);
660 cfs_hash_dual_bd_lock(hs, bds, excl);
664 cfs_hash_dual_bd_lookup_locked(struct cfs_hash *hs, struct cfs_hash_bd *bds,
667 cfs_hash_dual_bd_findadd_locked(struct cfs_hash *hs, struct cfs_hash_bd *bds,
668 const void *key, struct hlist_node *hnode,
671 cfs_hash_dual_bd_finddel_locked(struct cfs_hash *hs, struct cfs_hash_bd *bds,
672 const void *key, struct hlist_node *hnode);
674 /* Hash init/cleanup functions */
676 cfs_hash_create(char *name, unsigned cur_bits, unsigned max_bits,
677 unsigned bkt_bits, unsigned extra_bytes,
678 unsigned min_theta, unsigned max_theta,
679 struct cfs_hash_ops *ops, unsigned flags);
681 struct cfs_hash *cfs_hash_getref(struct cfs_hash *hs);
682 void cfs_hash_putref(struct cfs_hash *hs);
684 /* Hash addition functions */
685 void cfs_hash_add(struct cfs_hash *hs, const void *key,
686 struct hlist_node *hnode);
687 int cfs_hash_add_unique(struct cfs_hash *hs, const void *key,
688 struct hlist_node *hnode);
689 void *cfs_hash_findadd_unique(struct cfs_hash *hs, const void *key,
690 struct hlist_node *hnode);
692 /* Hash deletion functions */
693 void *cfs_hash_del(struct cfs_hash *hs, const void *key,
694 struct hlist_node *hnode);
695 void *cfs_hash_del_key(struct cfs_hash *hs, const void *key);
697 /* Hash lookup/for_each functions */
698 #define CFS_HASH_LOOP_HOG 1024
700 typedef int (*cfs_hash_for_each_cb_t)(struct cfs_hash *hs,
701 struct cfs_hash_bd *bd,
702 struct hlist_node *node,
705 cfs_hash_lookup(struct cfs_hash *hs, const void *key);
707 cfs_hash_for_each(struct cfs_hash *hs, cfs_hash_for_each_cb_t, void *data);
709 cfs_hash_for_each_safe(struct cfs_hash *hs, cfs_hash_for_each_cb_t, void *data);
711 cfs_hash_for_each_nolock(struct cfs_hash *hs, cfs_hash_for_each_cb_t,
714 cfs_hash_for_each_empty(struct cfs_hash *hs, cfs_hash_for_each_cb_t,
717 cfs_hash_for_each_key(struct cfs_hash *hs, const void *key,
718 cfs_hash_for_each_cb_t, void *data);
719 typedef int (*cfs_hash_cond_opt_cb_t)(void *obj, void *data);
721 cfs_hash_cond_del(struct cfs_hash *hs, cfs_hash_cond_opt_cb_t, void *data);
724 cfs_hash_hlist_for_each(struct cfs_hash *hs, unsigned hindex,
725 cfs_hash_for_each_cb_t, void *data);
726 int cfs_hash_is_empty(struct cfs_hash *hs);
727 __u64 cfs_hash_size_get(struct cfs_hash *hs);
730 * Rehash - Theta is calculated to be the average chained
731 * hash depth assuming a perfectly uniform hash function.
733 void cfs_hash_rehash_cancel_locked(struct cfs_hash *hs);
734 void cfs_hash_rehash_cancel(struct cfs_hash *hs);
735 int cfs_hash_rehash(struct cfs_hash *hs, int do_rehash);
736 void cfs_hash_rehash_key(struct cfs_hash *hs, const void *old_key,
737 void *new_key, struct hlist_node *hnode);
739 #if CFS_HASH_DEBUG_LEVEL > CFS_HASH_DEBUG_1
740 /* Validate hnode references the correct key */
742 cfs_hash_key_validate(struct cfs_hash *hs, const void *key,
743 struct hlist_node *hnode)
745 LASSERT(cfs_hash_keycmp(hs, key, hnode));
748 /* Validate hnode is in the correct bucket */
750 cfs_hash_bucket_validate(struct cfs_hash *hs, struct cfs_hash_bd *bd,
751 struct hlist_node *hnode)
753 struct cfs_hash_bd bds[2];
755 cfs_hash_dual_bd_get(hs, cfs_hash_key(hs, hnode), bds);
756 LASSERT(bds[0].bd_bucket == bd->bd_bucket ||
757 bds[1].bd_bucket == bd->bd_bucket);
760 #else /* CFS_HASH_DEBUG_LEVEL > CFS_HASH_DEBUG_1 */
763 cfs_hash_key_validate(struct cfs_hash *hs, const void *key,
764 struct hlist_node *hnode) {}
767 cfs_hash_bucket_validate(struct cfs_hash *hs, struct cfs_hash_bd *bd,
768 struct hlist_node *hnode) {}
770 #endif /* CFS_HASH_DEBUG_LEVEL */
772 #define CFS_HASH_THETA_BITS 10
773 #define CFS_HASH_MIN_THETA (1U << (CFS_HASH_THETA_BITS - 1))
774 #define CFS_HASH_MAX_THETA (1U << (CFS_HASH_THETA_BITS + 1))
776 /* Return integer component of theta */
777 static inline int __cfs_hash_theta_int(int theta)
779 return (theta >> CFS_HASH_THETA_BITS);
782 /* Return a fractional value between 0 and 999 */
783 static inline int __cfs_hash_theta_frac(int theta)
785 return ((theta * 1000) >> CFS_HASH_THETA_BITS) -
786 (__cfs_hash_theta_int(theta) * 1000);
789 static inline int __cfs_hash_theta(struct cfs_hash *hs)
791 return (atomic_read(&hs->hs_count) <<
792 CFS_HASH_THETA_BITS) >> hs->hs_cur_bits;
796 __cfs_hash_set_theta(struct cfs_hash *hs, int min, int max)
799 hs->hs_min_theta = (__u16)min;
800 hs->hs_max_theta = (__u16)max;
803 /* Generic debug formatting routines mainly for proc handler */
805 void cfs_hash_debug_header(struct seq_file *m);
806 void cfs_hash_debug_str(struct cfs_hash *hs, struct seq_file *m);
809 * Generic djb2 hash algorithm for character arrays.
811 static inline unsigned
812 cfs_hash_djb2_hash(const void *key, size_t size, unsigned mask)
814 unsigned i, hash = 5381;
816 LASSERT(key != NULL);
818 for (i = 0; i < size; i++)
819 hash = hash * 33 + ((char *)key)[i];
821 return (hash & mask);
825 * Generic u32 hash algorithm.
827 static inline unsigned
828 cfs_hash_u32_hash(const __u32 key, unsigned mask)
830 return ((key * CFS_GOLDEN_RATIO_PRIME_32) & mask);
834 * Generic u64 hash algorithm.
836 static inline unsigned
837 cfs_hash_u64_hash(const __u64 key, unsigned mask)
839 return ((unsigned)(key * CFS_GOLDEN_RATIO_PRIME_64) & mask);
842 /** iterate over all buckets in @bds (array of struct cfs_hash_bd) */
843 #define cfs_hash_for_each_bd(bds, n, i) \
844 for (i = 0; i < n && (bds)[i].bd_bucket != NULL; i++)
846 /** iterate over all buckets of @hs */
847 #define cfs_hash_for_each_bucket(hs, bd, pos) \
849 pos < CFS_HASH_NBKT(hs) && \
850 ((bd)->bd_bucket = (hs)->hs_buckets[pos]) != NULL; pos++)
852 /** iterate over all hlist of bucket @bd */
853 #define cfs_hash_bd_for_each_hlist(hs, bd, hlist) \
854 for ((bd)->bd_offset = 0; \
855 (bd)->bd_offset < CFS_HASH_BKT_NHLIST(hs) && \
856 (hlist = cfs_hash_bd_hhead(hs, bd)) != NULL; \
859 /* !__LIBCFS__HASH_H__ */