Searched refs:nidx (Results 1 – 9 of 9) sorted by relevance
| /linux/fs/hfsplus/ |
| A D | btree.c | 377 u32 nidx, idx; in hfs_bmap_alloc() local
388 nidx = 0; in hfs_bmap_alloc()
389 node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
428 nidx = node->next; in hfs_bmap_alloc()
429 if (!nidx) { in hfs_bmap_alloc()
453 u32 nidx; in hfs_bmap_free() local
459 nidx = node->this; in hfs_bmap_free()
464 while (nidx >= len * 8) { in hfs_bmap_free()
467 nidx -= len * 8; in hfs_bmap_free()
491 off += node->page_offset + nidx / 8; in hfs_bmap_free()
[all …]
|
| A 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()
|
| A D | inode.c | 73 u32 nidx; in hfsplus_releasepage() local
93 nidx = page->index >> in hfsplus_releasepage()
96 node = hfs_bnode_findhash(tree, nidx); in hfsplus_releasepage()
107 nidx = page->index << in hfsplus_releasepage()
112 node = hfs_bnode_findhash(tree, nidx++); in hfsplus_releasepage()
121 } while (--i && nidx < tree->node_count); in hfsplus_releasepage()
|
| /linux/fs/hfs/ |
| A D | btree.c | 251 u32 nidx, idx; in hfs_bmap_alloc() local
262 nidx = 0; in hfs_bmap_alloc()
263 node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
301 nidx = node->next; in hfs_bmap_alloc()
302 if (!nidx) { in hfs_bmap_alloc()
326 u32 nidx; in hfs_bmap_free() local
331 nidx = node->this; in hfs_bmap_free()
336 while (nidx >= len * 8) { in hfs_bmap_free()
339 nidx -= len * 8; in hfs_bmap_free()
361 off += node->page_offset + nidx / 8; in hfs_bmap_free()
[all …]
|
| A D | bfind.c | 111 u32 nidx, parent; in hfs_brec_find() local
119 nidx = tree->root; in hfs_brec_find()
120 if (!nidx) in hfs_brec_find()
126 bnode = hfs_bnode_find(tree, nidx); in hfs_brec_find()
144 parent = nidx; in hfs_brec_find()
146 nidx = be32_to_cpu(data); in hfs_brec_find()
154 height, bnode->height, bnode->type, nidx, parent); in hfs_brec_find()
|
| A D | inode.c | 79 u32 nidx; in hfs_releasepage() local
98 nidx = page->index >> (tree->node_size_shift - PAGE_SHIFT); in hfs_releasepage()
100 node = hfs_bnode_findhash(tree, nidx); in hfs_releasepage()
111 nidx = page->index << (PAGE_SHIFT - tree->node_size_shift); in hfs_releasepage()
115 node = hfs_bnode_findhash(tree, nidx++); in hfs_releasepage()
124 } while (--i && nidx < tree->node_count); in hfs_releasepage()
|
| /linux/lib/ |
| A D | bootconfig.c | 699 unsigned short nidx = child->next; in xbc_parse_kv() local
702 child->next = nidx; /* keep subkeys */ in xbc_parse_kv()
|
| /linux/net/core/ |
| A D | neighbour.c | 2444 int family, tidx, nidx = 0; in neightbl_dump_info() local
2473 nidx = 0; in neightbl_dump_info()
2479 if (nidx < neigh_skip) in neightbl_dump_info()
2489 nidx++; in neightbl_dump_info()
2496 cb->args[1] = nidx; in neightbl_dump_info()
|
| /linux/net/xfrm/ |
| A D | xfrm_policy.c | 612 struct hlist_head *nidx = xfrm_hash_alloc(nsize); in xfrm_byidx_resize() local
615 if (!nidx) in xfrm_byidx_resize()
621 xfrm_idx_hash_transfer(oidx + i, nidx, nhashmask); in xfrm_byidx_resize()
623 net->xfrm.policy_byidx = nidx; in xfrm_byidx_resize()
|
Completed in 29 milliseconds