Home
last modified time | relevance | path

Searched refs:nidx (Results 1 - 17 of 17) sorted by relevance

/kernel/linux/linux-5.10/fs/hfs/
H A Dbfind.c113 u32 nidx, parent; in hfs_brec_find() local
121 nidx = tree->root; in hfs_brec_find()
122 if (!nidx) in hfs_brec_find()
128 bnode = hfs_bnode_find(tree, nidx); in hfs_brec_find()
146 parent = nidx; in hfs_brec_find()
148 nidx = be32_to_cpu(data); in hfs_brec_find()
156 height, bnode->height, bnode->type, nidx, parent); in hfs_brec_find()
H A Dbtree.c251 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()
306 next_node = hfs_bnode_find(tree, 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 in hfs_bmap_free()
[all...]
H A Dinode.c79 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()
/kernel/linux/linux-6.6/fs/hfs/
H A Dbfind.c111 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()
H A Dbtree.c254 u32 nidx, idx; in hfs_bmap_alloc() local
265 nidx = 0; in hfs_bmap_alloc()
266 node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
304 nidx = node->next; in hfs_bmap_alloc()
305 if (!nidx) { in hfs_bmap_alloc()
309 next_node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
329 u32 nidx; in hfs_bmap_free() local
334 nidx = node->this; in hfs_bmap_free()
339 while (nidx >= len * 8) { in hfs_bmap_free()
342 nidx in hfs_bmap_free()
[all...]
H A Dinode.c78 u32 nidx; in hfs_release_folio() local
98 nidx = folio->index >> (tree->node_size_shift - PAGE_SHIFT); in hfs_release_folio()
100 node = hfs_bnode_findhash(tree, nidx); in hfs_release_folio()
111 nidx = folio->index << (PAGE_SHIFT - tree->node_size_shift); in hfs_release_folio()
115 node = hfs_bnode_findhash(tree, nidx++); in hfs_release_folio()
124 } while (--i && nidx < tree->node_count); in hfs_release_folio()
/kernel/linux/linux-5.10/fs/hfsplus/
H A Dbtree.c377 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()
433 next_node = hfs_bnode_find(tree, 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 in hfs_bmap_free()
[all...]
H A Dbfind.c168 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()
H A Dinode.c72 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()
/kernel/linux/linux-6.6/fs/hfsplus/
H A Dbtree.c378 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()
434 next_node = hfs_bnode_find(tree, 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 in hfs_bmap_free()
[all...]
H A Dbfind.c168 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()
H A Dinode.c72 u32 nidx; in hfsplus_release_folio() local
93 nidx = folio->index >> in hfsplus_release_folio()
96 node = hfs_bnode_findhash(tree, nidx); in hfsplus_release_folio()
107 nidx = folio->index << in hfsplus_release_folio()
112 node = hfs_bnode_findhash(tree, nidx++); in hfsplus_release_folio()
121 } while (--i && nidx < tree->node_count); in hfsplus_release_folio()
/kernel/linux/linux-6.6/drivers/net/ethernet/microchip/vcap/
H A Dvcap_api.c521 int nidx; in vcap_copy_to_w32be() local
526 nidx = idx + first_byte_index - (idx & ~0x3); in vcap_copy_to_w32be()
527 dst[nidx] = src[idx]; in vcap_copy_to_w32be()
1072 int idx, ridx, wstart, nidx; in vcap_copy_from_w32be() local
1077 nidx = wstart + 3 - (idx & 0x3); in vcap_copy_from_w32be()
1078 if (nidx >= size) in vcap_copy_from_w32be()
1079 nidx -= tail_bytes; in vcap_copy_from_w32be()
1080 dst[nidx] = src[ridx]; in vcap_copy_from_w32be()
/kernel/linux/linux-5.10/net/core/
H A Dneighbour.c2393 int family, tidx, nidx = 0; in neightbl_dump_info() local
2422 nidx = 0; in neightbl_dump_info()
2428 if (nidx < neigh_skip) in neightbl_dump_info()
2438 nidx++; in neightbl_dump_info()
2445 cb->args[1] = nidx; in neightbl_dump_info()
/kernel/linux/linux-6.6/net/core/
H A Dneighbour.c2505 int family, tidx, nidx = 0; in neightbl_dump_info() local
2534 nidx = 0; in neightbl_dump_info()
2540 if (nidx < neigh_skip) in neightbl_dump_info()
2550 nidx++; in neightbl_dump_info()
2557 cb->args[1] = nidx; in neightbl_dump_info()
/kernel/linux/linux-5.10/net/xfrm/
H A Dxfrm_policy.c614 struct hlist_head *nidx = xfrm_hash_alloc(nsize); in xfrm_byidx_resize() local
617 if (!nidx) in xfrm_byidx_resize()
623 xfrm_idx_hash_transfer(oidx + i, nidx, nhashmask); in xfrm_byidx_resize()
625 net->xfrm.policy_byidx = nidx; in xfrm_byidx_resize()
/kernel/linux/linux-6.6/net/xfrm/
H A Dxfrm_policy.c615 struct hlist_head *nidx = xfrm_hash_alloc(nsize); in xfrm_byidx_resize() local
618 if (!nidx) in xfrm_byidx_resize()
624 xfrm_idx_hash_transfer(oidx + i, nidx, nhashmask); in xfrm_byidx_resize()
626 net->xfrm.policy_byidx = nidx; in xfrm_byidx_resize()

Completed in 35 milliseconds