Lines Matching refs:DV
2368 Designated victim (dv)
2453 mchunkptr dv;
3118 if (p != m->dv && p != m->top) {
3287 assert(q == m->dv || bin_find(m, q));
3310 if (m->dvsize != 0) { /* check dv chunk */
3311 do_check_any_chunk(m, m->dv);
3312 assert(m->dvsize == chunksize(m->dv));
3314 assert(bin_find(m, m->dv) == 0);
3473 /* Replace dv node, binning the old one */
3478 mchunkptr DV = M->dv;\
3480 insert_small_chunk(M, DV, DVS);\
3483 M->dv = P;\
3766 m->top = m->dv = 0;
3794 else if (oldfirst == m->dv) {
3796 m->dv = q;
4091 if (p == m->dv) {
4092 m->dv = 0;
4237 /* If dv is a better fit, return 0 so malloc will use it */
4600 2. If it is big enough, use the dv chunk, which is normally the
4603 saving remainder in dv.
4608 if it is better fitting than dv chunk, splitting if necessary.
4609 2. If better fitting than any binned chunk, use the dv chunk.
4689 mchunkptr p = gm->dv;
4690 if (rsize >= MIN_CHUNK_SIZE) { /* split dv */
4691 mchunkptr r = gm->dv = chunk_plus_offset(p, nb);
4696 else { /* exhaust dv */
4699 gm->dv = 0;
4733 with special cases for top, dv, mmapped chunks, and usage errors.
4765 if (p != fm->dv) {
4785 if (p == fm->dv) {
4786 fm->dv = 0;
4793 else if (next == fm->dv) {
4795 fm->dv = p;
4804 if (p == fm->dv) {
5124 mchunkptr p = ms->dv;
5125 if (rsize >= MIN_CHUNK_SIZE) { /* split dv */
5126 mchunkptr r = ms->dv = chunk_plus_offset(p, nb);
5131 else { /* exhaust dv */
5134 ms->dv = 0;
5195 if (p != fm->dv) {
5215 if (p == fm->dv) {
5216 fm->dv = 0;
5223 else if (next == fm->dv) {
5225 fm->dv = p;
5234 if (p == fm->dv) {
