drivers/of/unittest.c

365

struct node_hash *nh;

fs/dlm/midcomms.c

1148

INIT_HLIST_HEAD(&node_hash[i]);

fs/dlm/midcomms.c

1169

hlist_for_each_entry_srcu(node, &node_hash[i], hlist,

fs/dlm/midcomms.c

1330

hlist_for_each_entry_srcu(node, &node_hash[i], hlist,

fs/dlm/midcomms.c

1402

hlist_for_each_entry_srcu(node, &node_hash[i], hlist,

fs/dlm/midcomms.c

1411

hlist_for_each_entry_srcu(node, &node_hash[i], hlist,

fs/dlm/midcomms.c

215

static struct hlist_head node_hash[CONN_HASH_SIZE];

fs/dlm/midcomms.c

278

hlist_for_each_entry_srcu(node, &node_hash[r], hlist,

fs/dlm/midcomms.c

370

hlist_add_head_rcu(&node->hlist, &node_hash[r]);

fs/hfs/bnode.c

335

for (node = tree->node_hash[hfs_bnode_hash(cnid)];

fs/hfs/bnode.c

371

node->next_hash = tree->node_hash[hash];

fs/hfs/bnode.c

372

tree->node_hash[hash] = node;

fs/hfs/bnode.c

406

for (p = &node->tree->node_hash[hfs_bnode_hash(node->this)];

fs/hfs/btree.c

183

while ((node = tree->node_hash[i])) {

fs/hfs/btree.c

184

tree->node_hash[i] = node->next_hash;

fs/hfs/btree.h

48

struct hfs_bnode *node_hash[NODE_HASH_SIZE];

fs/hfsplus/bnode.c

448

for (node = tree->node_hash[hfs_bnode_hash(cnid)];

fs/hfsplus/bnode.c

483

node->next_hash = tree->node_hash[hash];

fs/hfsplus/bnode.c

484

tree->node_hash[hash] = node;

fs/hfsplus/bnode.c

519

for (p = &node->tree->node_hash[hfs_bnode_hash(node->this)];

fs/hfsplus/btree.c

420

while ((node = tree->node_hash[i])) {

fs/hfsplus/btree.c

421

tree->node_hash[i] = node->next_hash;

fs/hfsplus/hfsplus_fs.h

63

struct hfs_bnode *node_hash[NODE_HASH_SIZE];