Searched refs:nidx (Results 1 – 10 of 10) sorted by relevance
| /linux-6.3-rc2/fs/hfs/ |
| A D | btree.c | 254 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()
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 -= len * 8; in hfs_bmap_free()
364 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 | 78 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()
|
| /linux-6.3-rc2/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 | 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 | 72 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()
|
| /linux-6.3-rc2/lib/ |
| A D | bootconfig.c | 712 unsigned short nidx = child->next; in xbc_parse_kv() local
715 child->next = nidx; /* keep subkeys */ in xbc_parse_kv()
|
| /linux-6.3-rc2/drivers/net/ethernet/microchip/vcap/ |
| A D | vcap_api.c | 521 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()
1039 int idx, ridx, wstart, nidx; in vcap_copy_from_w32be() local
1044 nidx = wstart + 3 - (idx & 0x3); in vcap_copy_from_w32be()
1045 if (nidx >= size) in vcap_copy_from_w32be()
1046 nidx -= tail_bytes; in vcap_copy_from_w32be()
1047 dst[nidx] = src[ridx]; in vcap_copy_from_w32be()
|
| /linux-6.3-rc2/net/core/ |
| A D | neighbour.c | 2524 int family, tidx, nidx = 0; in neightbl_dump_info() local
2553 nidx = 0; in neightbl_dump_info()
2559 if (nidx < neigh_skip) in neightbl_dump_info()
2569 nidx++; in neightbl_dump_info()
2576 cb->args[1] = nidx; in neightbl_dump_info()
|
| /linux-6.3-rc2/net/xfrm/ |
| A D | xfrm_policy.c | 615 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 57 milliseconds