Home
last modified time | relevance | path

Searched refs:node_hash (Results 1 – 8 of 8) sorted by relevance

/linux/fs/hfs/
A Dbnode.c242 for (node = tree->node_hash[hfs_bnode_hash(cnid)]; in hfs_bnode_findhash()
280 node->next_hash = tree->node_hash[hash]; in __hfs_bnode_create()
281 tree->node_hash[hash] = node; in __hfs_bnode_create()
318 for (p = &node->tree->node_hash[hfs_bnode_hash(node->this)]; in hfs_bnode_unhash()
A Dbtree.c146 while ((node = tree->node_hash[i])) { in hfs_btree_close()
147 tree->node_hash[i] = node->next_hash; in hfs_btree_close()
A Dbtree.h48 struct hfs_bnode *node_hash[NODE_HASH_SIZE]; member
/linux/fs/dlm/
A Dmidcomms.c211 static struct hlist_head node_hash[CONN_HASH_SIZE]; variable
269 hlist_for_each_entry_rcu(node, &node_hash[r], hlist) { in __find_node()
355 hlist_add_head_rcu(&node->hlist, &node_hash[r]); in nodeid2node()
1155 INIT_HLIST_HEAD(&node_hash[i]); in dlm_midcomms_start()
1372 hlist_for_each_entry_rcu(node, &node_hash[i], hlist) { in dlm_midcomms_shutdown()
/linux/fs/hfsplus/
A Dbnode.c393 for (node = tree->node_hash[hfs_bnode_hash(cnid)]; in hfs_bnode_findhash()
430 node->next_hash = tree->node_hash[hash]; in __hfs_bnode_create()
431 tree->node_hash[hash] = node; in __hfs_bnode_create()
469 for (p = &node->tree->node_hash[hfs_bnode_hash(node->this)]; in hfs_bnode_unhash()
A Dbtree.c267 while ((node = tree->node_hash[i])) { in hfs_btree_close()
268 tree->node_hash[i] = node->next_hash; in hfs_btree_close()
A Dhfsplus_fs.h96 struct hfs_bnode *node_hash[NODE_HASH_SIZE]; member
/linux/drivers/of/
A Dunittest.c338 struct node_hash { struct
347 struct node_hash *nh; in of_unittest_check_phandles() argument

Completed in 18 milliseconds