Searched refs:nidx (Results 1 – 8 of 8) sorted by relevance
| /linux-3.3/fs/hfsplus/ |
| D | btree.c | 228 u32 nidx, idx; in hfs_bmap_alloc() local
255 nidx = 0; in hfs_bmap_alloc()
256 node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
295 nidx = node->next; in hfs_bmap_alloc()
296 if (!nidx) { in hfs_bmap_alloc()
300 next_node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
320 u32 nidx; in hfs_bmap_free() local
326 nidx = node->this; in hfs_bmap_free()
331 while (nidx >= len * 8) { in hfs_bmap_free()
334 nidx -= len * 8; in hfs_bmap_free()
[all …]
|
| D | bfind.c | 98 u32 nidx, parent; in hfs_brec_find() local
106 nidx = tree->root; in hfs_brec_find()
107 if (!nidx) in hfs_brec_find()
113 bnode = hfs_bnode_find(tree, nidx); in hfs_brec_find()
131 parent = nidx; in hfs_brec_find()
133 nidx = be32_to_cpu(data); in hfs_brec_find()
141 height, bnode->height, bnode->type, nidx, parent); in hfs_brec_find()
|
| D | inode.c | 61 u32 nidx; in hfsplus_releasepage() local
81 nidx = page->index >> in hfsplus_releasepage()
84 node = hfs_bnode_findhash(tree, nidx); in hfsplus_releasepage()
95 nidx = page->index << in hfsplus_releasepage()
100 node = hfs_bnode_findhash(tree, nidx++); in hfsplus_releasepage()
109 } while (--i && nidx < tree->node_count); in hfsplus_releasepage()
|
| /linux-3.3/fs/hfs/ |
| D | btree.c | 226 u32 nidx, idx; in hfs_bmap_alloc() local
252 nidx = 0; in hfs_bmap_alloc()
253 node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
291 nidx = node->next; in hfs_bmap_alloc()
292 if (!nidx) { in hfs_bmap_alloc()
296 next_node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
316 u32 nidx; in hfs_bmap_free() local
321 nidx = node->this; in hfs_bmap_free()
326 while (nidx >= len * 8) { in hfs_bmap_free()
329 nidx -= len * 8; in hfs_bmap_free()
[all …]
|
| D | bfind.c | 96 u32 nidx, parent; in hfs_brec_find() local
104 nidx = tree->root; in hfs_brec_find()
105 if (!nidx) in hfs_brec_find()
111 bnode = hfs_bnode_find(tree, nidx); in hfs_brec_find()
129 parent = nidx; in hfs_brec_find()
131 nidx = be32_to_cpu(data); in hfs_brec_find()
139 height, bnode->height, bnode->type, nidx, parent); in hfs_brec_find()
|
| D | inode.c | 68 u32 nidx; in hfs_releasepage() local
87 nidx = page->index >> (tree->node_size_shift - PAGE_CACHE_SHIFT); in hfs_releasepage()
89 node = hfs_bnode_findhash(tree, nidx); in hfs_releasepage()
100 nidx = page->index << (PAGE_CACHE_SHIFT - tree->node_size_shift); in hfs_releasepage()
104 node = hfs_bnode_findhash(tree, nidx++); in hfs_releasepage()
113 } while (--i && nidx < tree->node_count); in hfs_releasepage()
|
| /linux-3.3/net/core/ |
| D | neighbour.c | 2074 int family, tidx, nidx = 0; in neightbl_dump_info() local
2093 for (nidx = 0, p = tbl->parms.next; p; p = p->next) { in neightbl_dump_info()
2097 if (nidx < neigh_skip) in neightbl_dump_info()
2107 nidx++; in neightbl_dump_info()
2115 cb->args[1] = nidx; in neightbl_dump_info()
|
| /linux-3.3/net/xfrm/ |
| D | xfrm_policy.c | 423 struct hlist_head *nidx = xfrm_hash_alloc(nsize); in xfrm_byidx_resize() local
426 if (!nidx) in xfrm_byidx_resize()
432 xfrm_idx_hash_transfer(oidx + i, nidx, nhashmask); in xfrm_byidx_resize()
434 net->xfrm.policy_byidx = nidx; in xfrm_byidx_resize()
|