nidx               99 fs/hfs/bfind.c 	u32 nidx, parent;
nidx              107 fs/hfs/bfind.c 	nidx = tree->root;
nidx              108 fs/hfs/bfind.c 	if (!nidx)
nidx              114 fs/hfs/bfind.c 		bnode = hfs_bnode_find(tree, nidx);
nidx              132 fs/hfs/bfind.c 		parent = nidx;
nidx              134 fs/hfs/bfind.c 		nidx = be32_to_cpu(data);
nidx              142 fs/hfs/bfind.c 	       height, bnode->height, bnode->type, nidx, parent);
nidx              251 fs/hfs/btree.c 	u32 nidx, idx;
nidx              262 fs/hfs/btree.c 	nidx = 0;
nidx              263 fs/hfs/btree.c 	node = hfs_bnode_find(tree, nidx);
nidx              301 fs/hfs/btree.c 		nidx = node->next;
nidx              302 fs/hfs/btree.c 		if (!nidx) {
nidx              306 fs/hfs/btree.c 			next_node = hfs_bnode_find(tree, nidx);
nidx              326 fs/hfs/btree.c 	u32 nidx;
nidx              331 fs/hfs/btree.c 	nidx = node->this;
nidx              336 fs/hfs/btree.c 	while (nidx >= len * 8) {
nidx              339 fs/hfs/btree.c 		nidx -= len * 8;
nidx              361 fs/hfs/btree.c 	off += node->page_offset + nidx / 8;
nidx              365 fs/hfs/btree.c 	m = 1 << (~nidx & 7);
nidx               78 fs/hfs/inode.c 	u32 nidx;
nidx               97 fs/hfs/inode.c 		nidx = page->index >> (tree->node_size_shift - PAGE_SHIFT);
nidx               99 fs/hfs/inode.c 		node = hfs_bnode_findhash(tree, nidx);
nidx              110 fs/hfs/inode.c 		nidx = page->index << (PAGE_SHIFT - tree->node_size_shift);
nidx              114 fs/hfs/inode.c 			node = hfs_bnode_findhash(tree, nidx++);
nidx              123 fs/hfs/inode.c 		} while (--i && nidx < tree->node_count);
nidx              168 fs/hfsplus/bfind.c 	u32 nidx, parent;
nidx              176 fs/hfsplus/bfind.c 	nidx = tree->root;
nidx              177 fs/hfsplus/bfind.c 	if (!nidx)
nidx              183 fs/hfsplus/bfind.c 		bnode = hfs_bnode_find(tree, nidx);
nidx              201 fs/hfsplus/bfind.c 		parent = nidx;
nidx              203 fs/hfsplus/bfind.c 		nidx = be32_to_cpu(data);
nidx              211 fs/hfsplus/bfind.c 		height, bnode->height, bnode->type, nidx, parent);
nidx              377 fs/hfsplus/btree.c 	u32 nidx, idx;
nidx              388 fs/hfsplus/btree.c 	nidx = 0;
nidx              389 fs/hfsplus/btree.c 	node = hfs_bnode_find(tree, nidx);
nidx              428 fs/hfsplus/btree.c 		nidx = node->next;
nidx              429 fs/hfsplus/btree.c 		if (!nidx) {
nidx              433 fs/hfsplus/btree.c 			next_node = hfs_bnode_find(tree, nidx);
nidx              453 fs/hfsplus/btree.c 	u32 nidx;
nidx              459 fs/hfsplus/btree.c 	nidx = node->this;
nidx              464 fs/hfsplus/btree.c 	while (nidx >= len * 8) {
nidx              467 fs/hfsplus/btree.c 		nidx -= len * 8;
nidx              491 fs/hfsplus/btree.c 	off += node->page_offset + nidx / 8;
nidx              495 fs/hfsplus/btree.c 	m = 1 << (~nidx & 7);
nidx               72 fs/hfsplus/inode.c 	u32 nidx;
nidx               92 fs/hfsplus/inode.c 		nidx = page->index >>
nidx               95 fs/hfsplus/inode.c 		node = hfs_bnode_findhash(tree, nidx);
nidx              106 fs/hfsplus/inode.c 		nidx = page->index <<
nidx              111 fs/hfsplus/inode.c 			node = hfs_bnode_findhash(tree, nidx++);
nidx              120 fs/hfsplus/inode.c 		} while (--i && nidx < tree->node_count);
nidx             2365 net/core/neighbour.c 	int family, tidx, nidx = 0;
nidx             2394 net/core/neighbour.c 		nidx = 0;
nidx             2400 net/core/neighbour.c 			if (nidx < neigh_skip)
nidx             2410 net/core/neighbour.c 			nidx++;
nidx             2417 net/core/neighbour.c 	cb->args[1] = nidx;
nidx              610 net/xfrm/xfrm_policy.c 	struct hlist_head *nidx = xfrm_hash_alloc(nsize);
nidx              613 net/xfrm/xfrm_policy.c 	if (!nidx)
nidx              619 net/xfrm/xfrm_policy.c 		xfrm_idx_hash_transfer(oidx + i, nidx, nhashmask);
nidx              621 net/xfrm/xfrm_policy.c 	net->xfrm.policy_byidx = nidx;