Searched refs:nidx (Results 1 – 6 of 6) sorted by relevance
| /fs/hfs/ |
| A D | btree.c | 289 u32 nidx, idx; in hfs_bmap_alloc() local
300 nidx = 0; in hfs_bmap_alloc()
301 node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
339 nidx = node->next; in hfs_bmap_alloc()
340 if (!nidx) { in hfs_bmap_alloc()
364 u32 nidx; in hfs_bmap_free() local
369 nidx = node->this; in hfs_bmap_free()
374 while (nidx >= len * 8) { in hfs_bmap_free()
377 nidx -= len * 8; in hfs_bmap_free()
399 off += node->page_offset + nidx / 8; in hfs_bmap_free()
[all …]
|
| A D | bfind.c | 114 u32 nidx, parent; in hfs_brec_find() local
122 nidx = tree->root; in hfs_brec_find()
123 if (!nidx) in hfs_brec_find()
129 bnode = hfs_bnode_find(tree, nidx); in hfs_brec_find()
147 parent = nidx; in hfs_brec_find()
149 nidx = be32_to_cpu(data); in hfs_brec_find()
157 height, bnode->height, bnode->type, nidx, parent); in hfs_brec_find()
|
| A D | inode.c | 72 u32 nidx; in hfs_release_folio() local
92 nidx = folio->index >> (tree->node_size_shift - PAGE_SHIFT); in hfs_release_folio()
94 node = hfs_bnode_findhash(tree, nidx); in hfs_release_folio()
105 nidx = folio->index << (PAGE_SHIFT - tree->node_size_shift); in hfs_release_folio()
109 node = hfs_bnode_findhash(tree, nidx++); in hfs_release_folio()
118 } while (--i && nidx < tree->node_count); in hfs_release_folio()
|
| /fs/hfsplus/ |
| A D | btree.c | 378 u32 nidx, idx; in hfs_bmap_alloc() local
389 nidx = 0; in hfs_bmap_alloc()
390 node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
429 nidx = node->next; in hfs_bmap_alloc()
430 if (!nidx) { in hfs_bmap_alloc()
454 u32 nidx; in hfs_bmap_free() local
460 nidx = node->this; in hfs_bmap_free()
465 while (nidx >= len * 8) { in hfs_bmap_free()
468 nidx -= len * 8; in hfs_bmap_free()
492 off += node->page_offset + nidx / 8; in hfs_bmap_free()
[all …]
|
| A D | bfind.c | 157 u32 nidx, parent; in hfs_brec_find() local
165 nidx = tree->root; in hfs_brec_find()
166 if (!nidx) in hfs_brec_find()
172 bnode = hfs_bnode_find(tree, nidx); in hfs_brec_find()
190 parent = nidx; in hfs_brec_find()
192 nidx = be32_to_cpu(data); in hfs_brec_find()
200 height, bnode->height, bnode->type, nidx, parent); in hfs_brec_find()
|
| A D | inode.c | 68 u32 nidx; in hfsplus_release_folio() local
89 nidx = folio->index >> in hfsplus_release_folio()
92 node = hfs_bnode_findhash(tree, nidx); in hfsplus_release_folio()
103 nidx = folio->index << in hfsplus_release_folio()
108 node = hfs_bnode_findhash(tree, nidx++); in hfsplus_release_folio()
117 } while (--i && nidx < tree->node_count); in hfsplus_release_folio()
|
Completed in 16 milliseconds