Lines Matching refs:idx
2651 bindex_t idx;
2652 compute_tree_index(tsize, idx);
2653 assert(tindex == idx);
2655 assert(tsize >= minsize_for_tree_index(idx));
2656 assert((idx == NTREEBINS-1) || (tsize < minsize_for_tree_index((idx+1))));
3673 bindex_t idx;
3674 compute_tree_index(nb, idx);
3676 if ((t = *treebin_at(m, idx)) != 0) {
3678 size_t sizebits = nb << leftshift_for_tree_index(idx);
3701 binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap;
4099 bindex_t idx;
4102 idx = small_index(nb);
4103 smallbits = gm->smallmap >> idx;
4107 idx += ~smallbits & 1; /* Uses next bin if idx empty */
4108 b = smallbin_at(gm, idx);
4110 assert(chunksize(p) == small_index2size(idx));
4111 unlink_first_small_chunk(gm, b, p, idx);
4112 set_inuse_and_pinuse(gm, p, small_index2size(idx));
4123 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx));
4506 bindex_t idx;
4509 idx = small_index(nb);
4510 smallbits = ms->smallmap >> idx;
4514 idx += ~smallbits & 1; /* Uses next bin if idx empty */
4515 b = smallbin_at(ms, idx);
4517 assert(chunksize(p) == small_index2size(idx));
4518 unlink_first_small_chunk(ms, b, p, idx);
4519 set_inuse_and_pinuse(ms, p, small_index2size(idx));
4530 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx));
