diff options
Diffstat (limited to 'source/base/base_stack.c')
| -rwxr-xr-x | source/base/base_stack.c | 187 |
1 files changed, 0 insertions, 187 deletions
diff --git a/source/base/base_stack.c b/source/base/base_stack.c deleted file mode 100755 index 7cf0570..0000000 --- a/source/base/base_stack.c +++ /dev/null | |||
| @@ -1,187 +0,0 @@ | |||
| 1 | internal mem_stack * | ||
| 2 | stack_create(u64 capacity) | ||
| 3 | { | ||
| 4 | mem_stack *stack = (mem_stack *)mmap( | ||
| 5 | 0, | ||
| 6 | capacity + sizeof(mem_stack), | ||
| 7 | PROT_READ | PROT_WRITE, | ||
| 8 | MAP_SHARED | MAP_ANONYMOUS, | ||
| 9 | -1, | ||
| 10 | 0); | ||
| 11 | |||
| 12 | if (stack == MAP_FAILED) | ||
| 13 | { | ||
| 14 | return NULL; | ||
| 15 | } | ||
| 16 | |||
| 17 | stack->capacity = capacity; | ||
| 18 | stack->base_position = (u8 *)stack + sizeof(mem_stack); | ||
| 19 | stack->current_offset = 0; | ||
| 20 | |||
| 21 | return stack; | ||
| 22 | } | ||
| 23 | |||
| 24 | internal umm | ||
| 25 | calculate_padding(umm pointer, umm alignment, umm header_size) | ||
| 26 | { | ||
| 27 | umm modulo, padding; | ||
| 28 | |||
| 29 | if (!is_pow(alignment)) | ||
| 30 | { | ||
| 31 | return 0; | ||
| 32 | } | ||
| 33 | |||
| 34 | modulo = pointer & (alignment - 1); | ||
| 35 | |||
| 36 | padding = 0; | ||
| 37 | |||
| 38 | if (0 == modulo) | ||
| 39 | { | ||
| 40 | padding = alignment - modulo; | ||
| 41 | } | ||
| 42 | |||
| 43 | if (padding < header_size) | ||
| 44 | { | ||
| 45 | header_size -= padding; | ||
| 46 | |||
| 47 | if ((header_size & (alignment - 1)) != 0) | ||
| 48 | { | ||
| 49 | padding += alignment * (1 + (header_size / alignment)); | ||
| 50 | } | ||
| 51 | else | ||
| 52 | { | ||
| 53 | padding += alignment * (header_size / alignment); | ||
| 54 | } | ||
| 55 | } | ||
| 56 | |||
| 57 | return padding; | ||
| 58 | } | ||
| 59 | |||
| 60 | internal mem_stack * | ||
| 61 | stack_push_align(mem_stack *stack, u64 size, umm alignment) | ||
| 62 | { | ||
| 63 | umm padding = 0; | ||
| 64 | |||
| 65 | if (!is_pow(alignment)) | ||
| 66 | { | ||
| 67 | return (0); | ||
| 68 | } | ||
| 69 | |||
| 70 | if (alignment > 128) | ||
| 71 | { | ||
| 72 | alignment = 128; | ||
| 73 | } | ||
| 74 | |||
| 75 | umm current_address = (umm)stack->base_position + stack->current_offset; | ||
| 76 | padding = calculate_padding(current_address, alignment, sizeof(mem_stack_header)); | ||
| 77 | |||
| 78 | if (stack->current_offset + padding + size > stack->capacity) | ||
| 79 | { | ||
| 80 | return 0; | ||
| 81 | } | ||
| 82 | |||
| 83 | stack->current_offset += padding; | ||
| 84 | |||
| 85 | umm next_address = current_address + (umm)padding; | ||
| 86 | mem_stack_header *header = (mem_stack_header *)(next_address - sizeof(mem_stack_header)); | ||
| 87 | header->padding = padding; | ||
| 88 | |||
| 89 | stack->current_offset += size; | ||
| 90 | |||
| 91 | return MemSet((void *)next_address, size); | ||
| 92 | } | ||
| 93 | internal void * | ||
| 94 | stack_push(mem_stack *stack, umm size) | ||
| 95 | { | ||
| 96 | return stack_push_align(stack, size, ARENA_ALIGN); | ||
| 97 | } | ||
| 98 | |||
| 99 | internal void | ||
| 100 | stack_pop(mem_stack *stack, void *pointer) | ||
| 101 | { | ||
| 102 | if (pointer != NULL) | ||
| 103 | { | ||
| 104 | umm start, end, current_address; | ||
| 105 | mem_stack_header *header; | ||
| 106 | umm prev_offset; | ||
| 107 | |||
| 108 | start = (umm)stack->base_position; | ||
| 109 | end = start + (umm)stack->capacity; | ||
| 110 | current_address = (umm)pointer; | ||
| 111 | |||
| 112 | if (!(start <= current_address && current_address < end)) | ||
| 113 | { | ||
| 114 | if (0 && "Out of bounds memory address passed to stack allocator (free)") | ||
| 115 | { | ||
| 116 | return; | ||
| 117 | } | ||
| 118 | return; | ||
| 119 | } | ||
| 120 | |||
| 121 | if (current_address >= start + (umm)stack->base_position) | ||
| 122 | { | ||
| 123 | return; | ||
| 124 | } | ||
| 125 | |||
| 126 | header = (mem_stack_header *)(current_address - sizeof(mem_stack_header)); | ||
| 127 | prev_offset = (size_t)(current_address - (umm)header->padding - start); | ||
| 128 | stack->current_offset = prev_offset; | ||
| 129 | } | ||
| 130 | } | ||
| 131 | |||
| 132 | internal mem_stack * | ||
| 133 | stack_resize_align(mem_stack *stack, void *pointer, u64 old_size, u64 new_size, u64 alignment) | ||
| 134 | { | ||
| 135 | if (pointer == NULL) | ||
| 136 | { | ||
| 137 | return stack_push_align(stack, new_size, alignment); | ||
| 138 | } | ||
| 139 | else if (new_size == 0) | ||
| 140 | { | ||
| 141 | stack_pop(stack, pointer); | ||
| 142 | return NULL; | ||
| 143 | } | ||
| 144 | |||
| 145 | umm start, end, current_address; | ||
| 146 | umm min_size = old_size < new_size ? old_size : new_size; | ||
| 147 | void *new_pointer; | ||
| 148 | |||
| 149 | start = (umm)stack->base_position; | ||
| 150 | end = start + (umm)stack->capacity; | ||
| 151 | current_address = (umm)pointer; | ||
| 152 | if (!(start <= current_address && current_address < end)) | ||
| 153 | { | ||
| 154 | return NULL; | ||
| 155 | } | ||
| 156 | |||
| 157 | if (current_address >= start + (umm)stack->current_offset) | ||
| 158 | { | ||
| 159 | return NULL; | ||
| 160 | } | ||
| 161 | |||
| 162 | if (old_size == new_size) | ||
| 163 | { | ||
| 164 | return pointer; | ||
| 165 | } | ||
| 166 | |||
| 167 | new_pointer = stack_push_align(stack, new_size, alignment); | ||
| 168 | memmove(new_pointer, pointer, min_size); | ||
| 169 | return new_pointer; | ||
| 170 | } | ||
| 171 | |||
| 172 | internal void | ||
| 173 | stack_pop_all(mem_stack *stack) | ||
| 174 | { | ||
| 175 | stack->current_offset = 0; | ||
| 176 | } | ||
| 177 | |||
| 178 | internal void | ||
| 179 | stack_destroy(mem_stack *stack) | ||
| 180 | { | ||
| 181 | if (!stack) | ||
| 182 | { | ||
| 183 | return; | ||
| 184 | } | ||
| 185 | |||
| 186 | munmap(stack, stack->capacity + sizeof(mem_stack)); | ||
| 187 | } | ||
