Searched refs:nidx (Results 1 – 10 of 10) sorted by relevance
/linux/fs/hfs/ |
H 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() 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 -= len * 8; in hfs_bmap_free() [all …]
|
H 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()
|
H 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()
|
/linux/fs/hfsplus/ |
H 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() 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 -= len * 8; in hfs_bmap_free() [all …]
|
H 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()
|
H A D | inode.c | 66 u32 nidx; in hfsplus_release_folio() local 87 nidx = folio->index >> in hfsplus_release_folio() 90 node = hfs_bnode_findhash(tree, nidx); in hfsplus_release_folio() 101 nidx = folio->index << in hfsplus_release_folio() 106 node = hfs_bnode_findhash(tree, nidx++); in hfsplus_release_folio() 115 } while (--i && nidx < tree->node_count); in hfsplus_release_folio()
|
/linux/lib/ |
H A D | bootconfig.c | 713 unsigned short nidx = child->next; in xbc_parse_kv() local 716 child->next = nidx; /* keep subkeys */ in xbc_parse_kv()
|
/linux/drivers/net/ethernet/microchip/vcap/ |
H 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() 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()
|
/linux/net/core/ |
H A D | neighbour.c | 2462 int family, tidx, nidx = 0; in neightbl_dump_info() local 2491 nidx = 0; in neightbl_dump_info() 2497 if (nidx < neigh_skip) in neightbl_dump_info() 2507 nidx++; in neightbl_dump_info() 2514 cb->args[1] = nidx; in neightbl_dump_info()
|
/linux/net/xfrm/ |
H A D | xfrm_policy.c | 667 struct hlist_head *nidx = xfrm_hash_alloc(nsize); in xfrm_byidx_resize() local 670 if (!nidx) in xfrm_byidx_resize() 676 xfrm_idx_hash_transfer(oidx + i, nidx, nhashmask); in xfrm_byidx_resize() 678 net->xfrm.policy_byidx = nidx; in xfrm_byidx_resize()
|