Searched refs:node_hash (Results 1 – 7 of 7) sorted by relevance
| /fs/dlm/ |
| A D | midcomms.c | 215 static struct hlist_head node_hash[CONN_HASH_SIZE]; variable
278 hlist_for_each_entry_rcu(node, &node_hash[r], hlist) { in __find_node()
368 hlist_add_head_rcu(&node->hlist, &node_hash[r]); in dlm_midcomms_addr()
1147 INIT_HLIST_HEAD(&node_hash[i]); in dlm_midcomms_init()
1168 hlist_for_each_entry_rcu(node, &node_hash[i], hlist) { in dlm_midcomms_exit()
1328 hlist_for_each_entry_rcu(node, &node_hash[i], hlist) { in dlm_midcomms_version_wait()
1399 hlist_for_each_entry_rcu(node, &node_hash[i], hlist) { in dlm_midcomms_shutdown()
1407 hlist_for_each_entry_rcu(node, &node_hash[i], hlist) { in dlm_midcomms_shutdown()
|
| /fs/hfs/ |
| A D | bnode.c | 333 for (node = tree->node_hash[hfs_bnode_hash(cnid)]; in hfs_bnode_findhash()
371 node->next_hash = tree->node_hash[hash]; in __hfs_bnode_create()
372 tree->node_hash[hash] = node; in __hfs_bnode_create()
406 for (p = &node->tree->node_hash[hfs_bnode_hash(node->this)]; in hfs_bnode_unhash()
|
| A D | btree.c | 183 while ((node = tree->node_hash[i])) { in hfs_btree_close()
184 tree->node_hash[i] = node->next_hash; in hfs_btree_close()
|
| A D | btree.h | 48 struct hfs_bnode *node_hash[NODE_HASH_SIZE]; member
|
| /fs/hfsplus/ |
| A D | bnode.c | 484 for (node = tree->node_hash[hfs_bnode_hash(cnid)]; in hfs_bnode_findhash()
521 node->next_hash = tree->node_hash[hash]; in __hfs_bnode_create()
522 tree->node_hash[hash] = node; in __hfs_bnode_create()
556 for (p = &node->tree->node_hash[hfs_bnode_hash(node->this)]; in hfs_bnode_unhash()
|
| A D | btree.c | 268 while ((node = tree->node_hash[i])) { in hfs_btree_close()
269 tree->node_hash[i] = node->next_hash; in hfs_btree_close()
|
| A D | hfsplus_fs.h | 97 struct hfs_bnode *node_hash[NODE_HASH_SIZE]; member
|
Completed in 13 milliseconds