mirror of
https://git.proxmox.com/git/mirror_zfs.git
synced 2026-05-25 11:47:43 +03:00
Avoid 64bit division in multilist index functions
The number of sublists in a multilist is relatively small. We dont need 64 bits to calculate an index. 32 bits is sufficient and makes the code more efficient. Reviewed-by: Matthew Ahrens <mahrens@delphix.com> Reviewed-by: Brian Behlendorf <behlendorf1@llnl.gov> Reviewed-by: Mark Maybee <mark.maybee@delphix.com> Signed-off-by: Alexander Motin <mav@FreeBSD.org> Sponsored-By: iXsystems, Inc. Closes #12288
This commit is contained in:
@@ -399,7 +399,15 @@ static unsigned int
|
||||
dnode_multilist_index_func(multilist_t *ml, void *obj)
|
||||
{
|
||||
dnode_t *dn = obj;
|
||||
return (dnode_hash(dn->dn_objset, dn->dn_object) %
|
||||
|
||||
/*
|
||||
* The low order bits of the hash value are thought to be
|
||||
* distributed evenly. Otherwise, in the case that the multilist
|
||||
* has a power of two number of sublists, each sublists' usage
|
||||
* would not be evenly distributed. In this context full 64bit
|
||||
* division would be a waste of time, so limit it to 32 bits.
|
||||
*/
|
||||
return ((unsigned int)dnode_hash(dn->dn_objset, dn->dn_object) %
|
||||
multilist_get_num_sublists(ml));
|
||||
}
|
||||
|
||||
|
||||
Reference in New Issue
Block a user