Rev 822 | Rev 1224 | Go to most recent revision | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
| Rev 822 | Rev 1196 | ||
|---|---|---|---|
| Line 289... | Line 289... | ||
| 289 | if (!list_empty(&b->order[i])) { |
289 | if (!list_empty(&b->order[i])) { |
| 290 | for (cur = b->order[i].next; cur != &b->order[i]; cur = cur->next) |
290 | for (cur = b->order[i].next; cur != &b->order[i]; cur = cur->next) |
| 291 | cnt++; |
291 | cnt++; |
| 292 | } |
292 | } |
| 293 | 293 | ||
| 294 | 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); |
294 | printf("#%zd\t%zd\t%zdK\t\t%zdK\t\t%zd\t", i, cnt, (cnt * (1 << i) * elem_size) >> 10, ((1 << i) * elem_size) >> 10, 1 << i); |
| 295 | if (!list_empty(&b->order[i])) { |
295 | if (!list_empty(&b->order[i])) { |
| 296 | for (cur = b->order[i].next; cur != &b->order[i]; cur = cur->next) { |
296 | for (cur = b->order[i].next; cur != &b->order[i]; cur = cur->next) { |
| 297 | b->op->print_id(b, cur); |
297 | b->op->print_id(b, cur); |
| 298 | printf(" "); |
298 | printf(" "); |
| 299 | } |
299 | } |
| Line 302... | Line 302... | ||
| 302 | 302 | ||
| 303 | block_count += cnt; |
303 | block_count += cnt; |
| 304 | elem_count += (1 << i) * cnt; |
304 | elem_count += (1 << i) * cnt; |
| 305 | } |
305 | } |
| 306 | printf("-----\t------\t--------\t----------\t---------------\n"); |
306 | printf("-----\t------\t--------\t----------\t---------------\n"); |
| 307 | printf("Buddy system contains %d free elements (%d blocks)\n" , elem_count, block_count); |
307 | printf("Buddy system contains %zd free elements (%zd blocks)\n" , elem_count, block_count); |
| 308 | 308 | ||
| 309 | } |
309 | } |