Lines Matching defs:bk
1595 struct malloc_chunk* bk;
1910 only the fd/bk pointers of bins, and then use repositioning tricks
1932 #define last(b) ((b)->bk)
1940 BK = P->bk; \
1941 FD->bk = BK; \
2222 bin->fd = bin->bk = bin;
2378 assert(p->fd->bk == p);
2379 assert(p->bk->fd == p);
2558 for (p = last(b); p != b; p = p->bk) {
2568 assert(p->bk == b || chunksize(p->bk) >= chunksize(p));
3144 bck = victim->bk;
3146 bin->bk = bck;
3188 while ( (victim = unsorted_chunks(av)->bk) != unsorted_chunks(av)) {
3189 bck = victim->bk;
3206 unsorted_chunks(av)->bk = unsorted_chunks(av)->fd = remainder;
3208 remainder->bk = remainder->fd = unsorted_chunks(av);
3219 unsorted_chunks(av)->bk = bck;
3246 (unsigned long)(chunksize(bck->bk))) {
3248 bck = bck->bk;
3255 bck = fwd->bk;
3261 victim->bk = bck;
3263 fwd->bk = victim;
3297 unsorted_chunks(av)->bk = unsorted_chunks(av)->fd = remainder;
3298 remainder->bk = remainder->fd = unsorted_chunks(av);
3306 } while ( (victim = victim->bk) != bin);
3371 bck = victim->bk;
3372 bin->bk = bck;
3387 unsorted_chunks(av)->bk = unsorted_chunks(av)->fd = remainder;
3388 remainder->bk = remainder->fd = unsorted_chunks(av);
3544 p->bk = bck;
3547 fwd->bk = p;
3704 first_unsorted->bk = p;
3707 p->bk = unsorted_bin;
4379 for (p = last(b); p != b; p = p->bk) {