Home | History | Annotate | Download | only in mjsunit

Lines Matching refs:bk

5126 "  struct malloc_chunk* bk;\n" +
5388 " only the fd/bk pointers of bins, and then use repositioning tricks\n" +
5402 "#define last(b) ((b)->bk)\n" +
5405 "#define unlink(P, BK, FD) { \\n" +
5407 " BK = P->bk; \\n" +
5408 " FD->bk = BK; \\n" +
5409 " BK->fd = FD; \\n" +
5757 " bin->fd = bin->bk = bin;\n" +
5907 " assert(p->fd->bk == p);\n" +
5908 " assert(p->bk->fd == p);\n" +
6089 " for (p = last(b); p != b; p = p->bk) {\n" +
6100 " assert(p->bk == b ||\n" +
6101 " (CHUNK_SIZE_T)chunksize(p->bk) >=\n" +
6722 " bck = victim->bk;\n" +
6724 " bin->bk = bck;\n" +
6757 " while ( (victim = unsorted_chunks(av)->bk) != unsorted_chunks(av)) {\n" +
6758 " bck = victim->bk;\n" +
6777 " unsorted_chunks(av)->bk = unsorted_chunks(av)->fd = remainder;\n" +
6779 " remainder->bk = remainder->fd = unsorted_chunks(av);\n" +
6790 " unsorted_chunks(av)->bk = bck;\n" +
6815 " if ((CHUNK_SIZE_T)(size) < (CHUNK_SIZE_T)(bck->bk->size)) {\n" +
6817 " bck = bck->bk;\n" +
6826 " bck = fwd->bk;\n" +
6832 " victim->bk = bck;\n" +
6834 " fwd->bk = victim;\n" +
6851 " for (victim = last(bin); victim != bin; victim = victim->bk) {\n" +
6867 " unsorted_chunks(av)->bk = unsorted_chunks(av)->fd = remainder;\n" +
6868 " remainder->bk = remainder->fd = unsorted_chunks(av);\n" +
6933 " bck = victim->bk;\n" +
6934 " bin->bk = bck;\n" +
6948 " unsorted_chunks(av)->bk = unsorted_chunks(av)->fd = remainder;\n" +
6949 " remainder->bk = remainder->fd = unsorted_chunks(av);\n" +
7088 " p->bk = bck;\n" +
7091 " fwd->bk = p;\n" +
7246 " first_unsorted->bk = p;\n" +
7249 " p->bk = unsorted_bin;\n" +
7971 " for (p = last(b); p != b; p = p->bk) {\n" +