| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | #include <stdlib.h> | ||
| 2 | #include "block.h" | ||
| 3 | #include "util/bit.h" | ||
| 4 | #include "util/xmalloc.h" | ||
| 5 | |||
| 6 | enum { | ||
| 7 | BLOCK_ALLOC_MULTIPLE = 64 | ||
| 8 | }; | ||
| 9 | |||
| 10 | 117 | Block *block_new(size_t alloc) | |
| 11 | { | ||
| 12 | 117 | Block *blk = xcalloc1(sizeof(*blk)); | |
| 13 | 117 | alloc = next_multiple(alloc, BLOCK_ALLOC_MULTIPLE); | |
| 14 | 117 | blk->data = xmalloc(alloc); | |
| 15 | 117 | blk->alloc = alloc; | |
| 16 | 117 | return blk; | |
| 17 | } | ||
| 18 | |||
| 19 | 367 | void block_grow(Block *blk, size_t alloc) | |
| 20 | { | ||
| 21 |
2/2✓ Branch 2 → 3 taken 9 times.
✓ Branch 2 → 5 taken 358 times.
|
367 | if (alloc > blk->alloc) { |
| 22 | 9 | blk->alloc = next_multiple(alloc, BLOCK_ALLOC_MULTIPLE); | |
| 23 | 9 | blk->data = xrealloc(blk->data, blk->alloc); | |
| 24 | } | ||
| 25 | 367 | } | |
| 26 | |||
| 27 | 3 | void block_free(Block *blk) | |
| 28 | { | ||
| 29 | 3 | list_remove(&blk->node); | |
| 30 | 3 | free(blk->data); | |
| 31 | 3 | free(blk); | |
| 32 | 3 | } | |
| 33 |