Searched refs:nidx (Results 1 – 8 of 8) sorted by relevance
| /Linux-v4.19/fs/hfs/ |
| D | btree.c | 227 u32 nidx, idx; in hfs_bmap_alloc() local
253 nidx = 0; in hfs_bmap_alloc()
254 node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
292 nidx = node->next; in hfs_bmap_alloc()
293 if (!nidx) { in hfs_bmap_alloc()
297 next_node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
317 u32 nidx; in hfs_bmap_free() local
322 nidx = node->this; in hfs_bmap_free()
327 while (nidx >= len * 8) { in hfs_bmap_free()
330 nidx -= len * 8; in hfs_bmap_free()
[all …]
|
| D | bfind.c | 99 u32 nidx, parent; in hfs_brec_find() local
107 nidx = tree->root; in hfs_brec_find()
108 if (!nidx) in hfs_brec_find()
114 bnode = hfs_bnode_find(tree, nidx); in hfs_brec_find()
132 parent = nidx; in hfs_brec_find()
134 nidx = be32_to_cpu(data); in hfs_brec_find()
142 height, bnode->height, bnode->type, nidx, parent); in hfs_brec_find()
|
| D | inode.c | 78 u32 nidx; in hfs_releasepage() local
97 nidx = page->index >> (tree->node_size_shift - PAGE_SHIFT); in hfs_releasepage()
99 node = hfs_bnode_findhash(tree, nidx); in hfs_releasepage()
110 nidx = page->index << (PAGE_SHIFT - tree->node_size_shift); in hfs_releasepage()
114 node = hfs_bnode_findhash(tree, nidx++); in hfs_releasepage()
123 } while (--i && nidx < tree->node_count); in hfs_releasepage()
|
| /Linux-v4.19/fs/hfsplus/ |
| D | btree.c | 349 u32 nidx, idx; in hfs_bmap_alloc() local
376 nidx = 0; in hfs_bmap_alloc()
377 node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
416 nidx = node->next; in hfs_bmap_alloc()
417 if (!nidx) { in hfs_bmap_alloc()
421 next_node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
441 u32 nidx; in hfs_bmap_free() local
447 nidx = node->this; in hfs_bmap_free()
452 while (nidx >= len * 8) { in hfs_bmap_free()
455 nidx -= len * 8; in hfs_bmap_free()
[all …]
|
| D | bfind.c | 168 u32 nidx, parent; in hfs_brec_find() local
176 nidx = tree->root; in hfs_brec_find()
177 if (!nidx) in hfs_brec_find()
183 bnode = hfs_bnode_find(tree, nidx); in hfs_brec_find()
201 parent = nidx; in hfs_brec_find()
203 nidx = be32_to_cpu(data); in hfs_brec_find()
211 height, bnode->height, bnode->type, nidx, parent); in hfs_brec_find()
|
| D | inode.c | 72 u32 nidx; in hfsplus_releasepage() local
92 nidx = page->index >> in hfsplus_releasepage()
95 node = hfs_bnode_findhash(tree, nidx); in hfsplus_releasepage()
106 nidx = page->index << in hfsplus_releasepage()
111 node = hfs_bnode_findhash(tree, nidx++); in hfsplus_releasepage()
120 } while (--i && nidx < tree->node_count); in hfsplus_releasepage()
|
| /Linux-v4.19/net/core/ |
| D | neighbour.c | 2167 int family, tidx, nidx = 0; in neightbl_dump_info() local
2189 nidx = 0; in neightbl_dump_info()
2195 if (nidx < neigh_skip) in neightbl_dump_info()
2205 nidx++; in neightbl_dump_info()
2212 cb->args[1] = nidx; in neightbl_dump_info()
|
| /Linux-v4.19/net/xfrm/ |
| D | xfrm_policy.c | 489 struct hlist_head *nidx = xfrm_hash_alloc(nsize); in xfrm_byidx_resize() local
492 if (!nidx) in xfrm_byidx_resize()
498 xfrm_idx_hash_transfer(oidx + i, nidx, nhashmask); in xfrm_byidx_resize()
500 net->xfrm.policy_byidx = nidx; in xfrm_byidx_resize()
|
