Home
last modified time | relevance | path

Searched refs:bmap (Results 1 – 4 of 4) sorted by relevance

/xnu-8020.140.41/bsd/skywalk/nexus/
H A Dnexus.c2481 bitmap_t *bmap; in nx_port_find() local
2500 bmap = &nx->nx_ports_bmap[i]; in nx_port_find()
2503 j = ffsll((*bmap) & mask); in nx_port_find()
2542 bitmap_t *bmap; in nx_port_grow() local
2546 _CASSERT((sizeof(*bmap) * 8) == NX_PORT_CHUNK); in nx_port_grow()
2559 if ((bmap = sk_realloc_data(nx->nx_ports_bmap, in nx_port_grow()
2560 (old_num_ports / NX_PORT_CHUNK) * sizeof(*bmap), in nx_port_grow()
2561 (num_ports / NX_PORT_CHUNK) * sizeof(*bmap), in nx_port_grow()
2566 nx->nx_ports_bmap = bmap; in nx_port_grow()
2582 bmap[i] = NX_PORT_CHUNK_FREE; in nx_port_grow()
[all …]
/xnu-8020.140.41/bsd/skywalk/nexus/flowswitch/flow/
H A Dflow_owner.c457 bitmap_t *bmap = fo->fo_flowadv_bmap; in flow_owner_flowadv_index_alloc() local
467 j = ffsll(bmap[i]); in flow_owner_flowadv_index_alloc()
474 bit_clear(bmap[i], j); in flow_owner_flowadv_index_alloc()
499 bitmap_t *bmap = fo->fo_flowadv_bmap; in flow_owner_flowadv_index_free() local
507 ASSERT(!bit_test(bmap[chunk_idx], bit_pos)); in flow_owner_flowadv_index_free()
509 bit_set(bmap[chunk_idx], bit_pos); in flow_owner_flowadv_index_free()
/xnu-8020.140.41/bsd/skywalk/mem/
H A Dskmem_region.c1505 bitmap_t *bmap; in sksegment_create() local
1514 bmap = &skr->skr_seg_bmap[i / BMAPSZ]; in sksegment_create()
1515 ASSERT(bit_test(*bmap, i % BMAPSZ)); in sksegment_create()
1525 bit_clear(*bmap, i % BMAPSZ); in sksegment_create()
1544 bitmap_t *bmap; in sksegment_destroy() local
1554 bmap = &skr->skr_seg_bmap[i / BMAPSZ]; in sksegment_destroy()
1555 ASSERT(!bit_test(*bmap, i % BMAPSZ)); in sksegment_destroy()
1570 bit_set(*bmap, i % BMAPSZ); in sksegment_destroy()
1796 bitmap_t *bmap, mask; in sksegment_freelist_grow() local
1803 bmap = &skr->skr_seg_bmap[i]; in sksegment_freelist_grow()
[all …]
/xnu-8020.140.41/bsd/kern/
H A Duipc_mbuf.c3571 int m, bmap = 0; local
3636 bmap |= (1 << m);
3643 if (bmap != 0) {
3649 if ((bmap & (1 << m)) &&