Searched refs:nidx (Results 1 – 9 of 9) sorted by relevance
/linux-4.1.27/fs/hfsplus/ |
D | btree.c | 348 u32 nidx, idx; in hfs_bmap_alloc() local 375 nidx = 0; in hfs_bmap_alloc() 376 node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc() 415 nidx = node->next; in hfs_bmap_alloc() 416 if (!nidx) { in hfs_bmap_alloc() 420 next_node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc() 440 u32 nidx; in hfs_bmap_free() local 446 nidx = node->this; in hfs_bmap_free() 451 while (nidx >= len * 8) { in hfs_bmap_free() 454 nidx -= len * 8; in hfs_bmap_free() [all …]
|
D | bfind.c | 167 u32 nidx, parent; in hfs_brec_find() local 175 nidx = tree->root; in hfs_brec_find() 176 if (!nidx) in hfs_brec_find() 182 bnode = hfs_bnode_find(tree, nidx); in hfs_brec_find() 200 parent = nidx; in hfs_brec_find() 202 nidx = be32_to_cpu(data); in hfs_brec_find() 210 height, bnode->height, bnode->type, nidx, parent); in hfs_brec_find()
|
D | inode.c | 71 u32 nidx; in hfsplus_releasepage() local 91 nidx = page->index >> in hfsplus_releasepage() 94 node = hfs_bnode_findhash(tree, nidx); in hfsplus_releasepage() 105 nidx = page->index << in hfsplus_releasepage() 110 node = hfs_bnode_findhash(tree, nidx++); in hfsplus_releasepage() 119 } while (--i && nidx < tree->node_count); in hfsplus_releasepage()
|
/linux-4.1.27/fs/hfs/ |
D | btree.c | 226 u32 nidx, idx; in hfs_bmap_alloc() local 252 nidx = 0; in hfs_bmap_alloc() 253 node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc() 291 nidx = node->next; in hfs_bmap_alloc() 292 if (!nidx) { in hfs_bmap_alloc() 296 next_node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc() 316 u32 nidx; in hfs_bmap_free() local 321 nidx = node->this; in hfs_bmap_free() 326 while (nidx >= len * 8) { in hfs_bmap_free() 329 nidx -= len * 8; in hfs_bmap_free() [all …]
|
D | bfind.c | 98 u32 nidx, parent; in hfs_brec_find() local 106 nidx = tree->root; in hfs_brec_find() 107 if (!nidx) in hfs_brec_find() 113 bnode = hfs_bnode_find(tree, nidx); in hfs_brec_find() 131 parent = nidx; in hfs_brec_find() 133 nidx = be32_to_cpu(data); in hfs_brec_find() 141 height, bnode->height, bnode->type, nidx, parent); in hfs_brec_find()
|
D | inode.c | 76 u32 nidx; in hfs_releasepage() local 95 nidx = page->index >> (tree->node_size_shift - PAGE_CACHE_SHIFT); in hfs_releasepage() 97 node = hfs_bnode_findhash(tree, nidx); in hfs_releasepage() 108 nidx = page->index << (PAGE_CACHE_SHIFT - tree->node_size_shift); in hfs_releasepage() 112 node = hfs_bnode_findhash(tree, nidx++); in hfs_releasepage() 121 } while (--i && nidx < tree->node_count); in hfs_releasepage()
|
/linux-4.1.27/net/core/ |
D | neighbour.c | 2090 int family, tidx, nidx = 0; in neightbl_dump_info() local 2112 nidx = 0; in neightbl_dump_info() 2118 if (nidx < neigh_skip) in neightbl_dump_info() 2128 nidx++; in neightbl_dump_info() 2135 cb->args[1] = nidx; in neightbl_dump_info()
|
/linux-4.1.27/net/xfrm/ |
D | xfrm_policy.c | 496 struct hlist_head *nidx = xfrm_hash_alloc(nsize); in xfrm_byidx_resize() local 499 if (!nidx) in xfrm_byidx_resize() 505 xfrm_idx_hash_transfer(oidx + i, nidx, nhashmask); in xfrm_byidx_resize() 507 net->xfrm.policy_byidx = nidx; in xfrm_byidx_resize()
|
/linux-4.1.27/drivers/net/ethernet/chelsio/cxgb4/ |
D | cxgb4_main.c | 552 unsigned int nidx = idx - adap->tids.ftid_base; in filter_rpl() local 556 if (idx >= adap->tids.ftid_base && nidx < in filter_rpl() 558 idx = nidx; in filter_rpl()
|