| 139,8 → 139,7 |
|---|
| if (tmp == right) { |
| right = left; |
| left = tmp; |
| } |
| ASSERT(tmp == left); |
| } |
| b->op->mark_busy(b, left); |
| buddy_system_free(b, right); |
| b->op->mark_available(b, left); |
| 291,15 → 290,8 |
|---|
| cnt++; |
| } |
| |
| printf("#%d\t%d\t%dK\t\t%dK\t\t%d\t", i, cnt, (cnt * (1 << i) * elem_size) >> 10, ((1 << i) * elem_size) >> 10, 1 << i); |
| if (!list_empty(&b->order[i])) { |
| for (cur = b->order[i].next; cur != &b->order[i]; cur = cur->next) { |
| b->op->print_id(b, cur); |
| printf(" "); |
| } |
| } |
| printf("\n"); |
| |
| printf("#%d\t%d\t%dK\t\t%dK\t\t%d\n", i, cnt, (cnt * (1 << i) * elem_size) >> 10, ((1 << i) * elem_size) >> 10, 1 << i); |
| |
| block_count += cnt; |
| elem_count += (1 << i) * cnt; |
| } |