|
1 | 1 | #include "block.h" |
2 | 2 |
|
3 | 3 |
|
4 | | -struct blocks *generate_blocks(size_t nb_blks) { |
5 | | - struct blocks *blks = malloc(sizeof(struct blocks)); |
6 | | - blks->blks = malloc(nb_blks * sizeof(struct block*)); |
| 4 | +struct block_register *generate_blocks(size_t nb_blks) { |
| 5 | + struct block_register *blks = malloc(sizeof(struct block_register)); |
| 6 | + blks->blks = malloc(nb_blks * sizeof(struct block *)); |
7 | 7 | blks->nb_blocks = nb_blks; |
8 | 8 | return blks; |
9 | 9 | } |
10 | 10 |
|
11 | | -struct block *generate_block(unsigned short id, size_t size, size_t address) { |
| 11 | +struct block *generate_block(unsigned short id, size_t size, size_t node_address, |
| 12 | + size_t virtual_address, char free) { |
12 | 13 | struct block *blk = malloc(sizeof(struct block)); |
13 | 14 | blk->id = id; |
14 | 15 | blk->size = size; |
15 | | - blk->address = address; |
| 16 | + blk->node_address = node_address; |
| 17 | + blk->virtual_address = virtual_address; |
| 18 | + blk->free = free; |
16 | 19 | blk->next = NULL; |
17 | 20 | return blk; |
18 | 21 | } |
19 | 22 |
|
20 | | -void add_block(struct block blk, unsigned short id, size_t size, size_t address) { |
21 | | - struct block *n_blk = generate_block(id, size, address); |
22 | | - blk.next = n_blk; |
| 23 | +void add_block(struct block *blk, unsigned short id, size_t size, size_t node_address, |
| 24 | + size_t virtual_address, char free) { |
| 25 | + struct block *n_blk = generate_block(id, size, node_address, virtual_address, free); |
| 26 | + blk->next = n_blk; |
23 | 27 | (void) blk; |
24 | 28 | } |
| 29 | + |
| 30 | +void merge_free_block(struct block_register *blks); |
| 31 | + |
| 32 | +struct block_register *init_nodes_same_size(unsigned short nb_nodes, size_t size) { |
| 33 | + struct block_register *blks = generate_blocks(nb_nodes); |
| 34 | + size_t v_address = 0; |
| 35 | + for (size_t i = 0; i < blks->nb_blocks; i++) { |
| 36 | + // Skip 0 (user), so from 1 to nb_nodes + 1 |
| 37 | + blks->blks[i] = generate_block(i + 1, size, 0, v_address, 0); |
| 38 | + v_address += size; |
| 39 | + } |
| 40 | + printf("Global init has memory size of %zu bytes", v_address); |
| 41 | + return blks; |
| 42 | +} |
| 43 | + |
| 44 | +struct block *split_block_u(struct block *b, size_t size) { |
| 45 | + if (!b) { |
| 46 | + printf("FATAL ALLOCATION ERROR\n"); |
| 47 | + } |
| 48 | + if (b->size < size) { |
| 49 | + b->size = size; |
| 50 | + size_t su = size - b->size; |
| 51 | + struct block *b_next = b->next; |
| 52 | + add_block(b, b->id, su, b->node_address + size, b->virtual_address + size, 0); |
| 53 | + b->next->next = b_next; |
| 54 | + return b; |
| 55 | + } |
| 56 | + return NULL; |
| 57 | +} |
| 58 | + |
| 59 | +struct allocation_register *generate_allocs(size_t size_alloc) { |
| 60 | + struct allocation_register *a = malloc(sizeof(struct allocation_register)); |
| 61 | + a->size_alloc = size_alloc; |
| 62 | + a->count_alloc = 0; |
| 63 | + a->allocs = malloc(sizeof(struct allocation) * size_alloc); |
| 64 | + return a; |
| 65 | +} |
| 66 | + |
| 67 | +void add_allocation(struct allocation_register *a_r, struct allocation *a) { |
| 68 | + if (a_r->count_alloc >= a_r->size_alloc) { |
| 69 | + a_r->allocs[a_r->count_alloc] = a; |
| 70 | + } else { |
| 71 | + // x2 size |
| 72 | + a_r->size_alloc = a_r->size_alloc * 2; |
| 73 | + a_r->allocs = realloc(a_r->allocs, a_r->size_alloc * sizeof(struct allocation)); |
| 74 | + |
| 75 | + } |
| 76 | + a_r->allocs[a_r->count_alloc] = a; |
| 77 | + a_r->count_alloc++; |
| 78 | +} |
0 commit comments