Home
last modified time | relevance | path

Searched refs:nidx (Results 1 – 6 of 6) sorted by relevance

/fs/hfsplus/
Dbtree.c186 u32 nidx, idx; in hfs_bmap_alloc() local
212 nidx = 0; in hfs_bmap_alloc()
213 node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
251 nidx = node->next; in hfs_bmap_alloc()
252 if (!nidx) { in hfs_bmap_alloc()
256 next_node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
276 u32 nidx; in hfs_bmap_free() local
282 nidx = node->this; in hfs_bmap_free()
287 while (nidx >= len * 8) { in hfs_bmap_free()
290 nidx -= len * 8; in hfs_bmap_free()
[all …]
Dbfind.c87 u32 nidx, parent; in hfs_brec_find() local
95 nidx = tree->root; in hfs_brec_find()
96 if (!nidx) in hfs_brec_find()
102 bnode = hfs_bnode_find(tree, nidx); in hfs_brec_find()
120 parent = nidx; in hfs_brec_find()
122 nidx = be32_to_cpu(data); in hfs_brec_find()
130 height, bnode->height, bnode->type, nidx, parent); in hfs_brec_find()
Dinode.c51 u32 nidx; in hfsplus_releasepage() local
71 nidx = page->index >> (tree->node_size_shift - PAGE_CACHE_SHIFT); in hfsplus_releasepage()
73 node = hfs_bnode_findhash(tree, nidx); in hfsplus_releasepage()
84 nidx = page->index << (PAGE_CACHE_SHIFT - tree->node_size_shift); in hfsplus_releasepage()
88 node = hfs_bnode_findhash(tree, nidx++); in hfsplus_releasepage()
97 } while (--i && nidx < tree->node_count); in hfsplus_releasepage()
/fs/hfs/
Dbtree.c210 u32 nidx, idx; in hfs_bmap_alloc() local
236 nidx = 0; in hfs_bmap_alloc()
237 node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
275 nidx = node->next; in hfs_bmap_alloc()
276 if (!nidx) { in hfs_bmap_alloc()
280 next_node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
300 u32 nidx; in hfs_bmap_free() local
305 nidx = node->this; in hfs_bmap_free()
310 while (nidx >= len * 8) { in hfs_bmap_free()
313 nidx -= len * 8; in hfs_bmap_free()
[all …]
Dbfind.c96 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()
Dinode.c59 u32 nidx; in hfs_releasepage() local
74 nidx = page->index >> (tree->node_size_shift - PAGE_CACHE_SHIFT); in hfs_releasepage()
76 node = hfs_bnode_findhash(tree, nidx); in hfs_releasepage()
87 nidx = page->index << (PAGE_CACHE_SHIFT - tree->node_size_shift); in hfs_releasepage()
91 node = hfs_bnode_findhash(tree, nidx++); in hfs_releasepage()
100 } while (--i && nidx < tree->node_count); in hfs_releasepage()