376 static inline int hfs_bnode_hash(u32 num)  in hfs_bnode_hash()  argument
378 	num = (num >> 16) + num;  in hfs_bnode_hash()
379 	num += num >> 8;  in hfs_bnode_hash()
380 	return num & (NODE_HASH_SIZE - 1);  in hfs_bnode_hash()
478 struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num)  in hfs_bnode_find()  argument
486 	node = hfs_bnode_findhash(tree, num);  in hfs_bnode_find()
497 	node = __hfs_bnode_create(tree, num);  in hfs_bnode_find()
573 struct hfs_bnode *hfs_bnode_create(struct hfs_btree *tree, u32 num)  in hfs_bnode_create()  argument
580 	node = hfs_bnode_findhash(tree, num);  in hfs_bnode_create()
583 		pr_crit("new node %u already hashed?\n", num);  in hfs_bnode_create()
587 	node = __hfs_bnode_create(tree, num);  in hfs_bnode_create()