1 1.1 alnsn /* 2 1.1 alnsn * Stack-less Just-In-Time compiler 3 1.1 alnsn * 4 1.1 alnsn * Copyright Zoltan Herczeg (hzmester (at) freemail.hu). All rights reserved. 5 1.1 alnsn * 6 1.1 alnsn * Redistribution and use in source and binary forms, with or without modification, are 7 1.1 alnsn * permitted provided that the following conditions are met: 8 1.1 alnsn * 9 1.1 alnsn * 1. Redistributions of source code must retain the above copyright notice, this list of 10 1.1 alnsn * conditions and the following disclaimer. 11 1.1 alnsn * 12 1.1 alnsn * 2. Redistributions in binary form must reproduce the above copyright notice, this list 13 1.1 alnsn * of conditions and the following disclaimer in the documentation and/or other materials 14 1.1 alnsn * provided with the distribution. 15 1.1 alnsn * 16 1.1 alnsn * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER(S) AND CONTRIBUTORS ``AS IS'' AND ANY 17 1.1 alnsn * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 18 1.1 alnsn * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT 19 1.1 alnsn * SHALL THE COPYRIGHT HOLDER(S) OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, 20 1.1 alnsn * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED 21 1.1 alnsn * TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR 22 1.1 alnsn * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 23 1.1 alnsn * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN 24 1.1 alnsn * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 25 1.1 alnsn */ 26 1.1 alnsn 27 1.1 alnsn /* 28 1.1 alnsn This file contains a simple executable memory allocator 29 1.1 alnsn 30 1.1 alnsn It is assumed, that executable code blocks are usually medium (or sometimes 31 1.1 alnsn large) memory blocks, and the allocator is not too frequently called (less 32 1.1 alnsn optimized than other allocators). Thus, using it as a generic allocator is 33 1.1 alnsn not suggested. 34 1.1 alnsn 35 1.1 alnsn How does it work: 36 1.1 alnsn Memory is allocated in continuous memory areas called chunks by alloc_chunk() 37 1.1 alnsn Chunk format: 38 1.1 alnsn [ block ][ block ] ... [ block ][ block terminator ] 39 1.1 alnsn 40 1.1 alnsn All blocks and the block terminator is started with block_header. The block 41 1.1 alnsn header contains the size of the previous and the next block. These sizes 42 1.1 alnsn can also contain special values. 43 1.1 alnsn Block size: 44 1.1 alnsn 0 - The block is a free_block, with a different size member. 45 1.1 alnsn 1 - The block is a block terminator. 46 1.1 alnsn n - The block is used at the moment, and the value contains its size. 47 1.1 alnsn Previous block size: 48 1.1 alnsn 0 - This is the first block of the memory chunk. 49 1.1 alnsn n - The size of the previous block. 50 1.1 alnsn 51 1.1 alnsn Using these size values we can go forward or backward on the block chain. 52 1.1 alnsn The unused blocks are stored in a chain list pointed by free_blocks. This 53 1.1 alnsn list is useful if we need to find a suitable memory area when the allocator 54 1.1 alnsn is called. 55 1.1 alnsn 56 1.1 alnsn When a block is freed, the new free block is connected to its adjacent free 57 1.1 alnsn blocks if possible. 58 1.1 alnsn 59 1.1 alnsn [ free block ][ used block ][ free block ] 60 1.1 alnsn and "used block" is freed, the three blocks are connected together: 61 1.1 alnsn [ one big free block ] 62 1.1 alnsn */ 63 1.1 alnsn 64 1.1 alnsn /* --------------------------------------------------------------------- */ 65 1.1 alnsn /* System (OS) functions */ 66 1.1 alnsn /* --------------------------------------------------------------------- */ 67 1.1 alnsn 68 1.1 alnsn /* 64 KByte. */ 69 1.1 alnsn #define CHUNK_SIZE 0x10000 70 1.1 alnsn 71 1.1 alnsn struct chunk_header { 72 1.1 alnsn void *executable; 73 1.1 alnsn int fd; 74 1.1 alnsn }; 75 1.1 alnsn 76 1.1 alnsn /* 77 1.1 alnsn alloc_chunk / free_chunk : 78 1.1 alnsn * allocate executable system memory chunks 79 1.1 alnsn * the size is always divisible by CHUNK_SIZE 80 1.1 alnsn allocator_grab_lock / allocator_release_lock : 81 1.1 alnsn * make the allocator thread safe 82 1.1 alnsn * can be empty if the OS (or the application) does not support threading 83 1.1 alnsn * only the allocator requires this lock, sljit is fully thread safe 84 1.1 alnsn as it only uses local variables 85 1.1 alnsn */ 86 1.1 alnsn 87 1.1 alnsn #include <fcntl.h> 88 1.1 alnsn 89 1.1 alnsn #ifndef O_NOATIME 90 1.1 alnsn #define O_NOATIME 0 91 1.1 alnsn #endif 92 1.1 alnsn 93 1.1 alnsn #ifdef __O_TMPFILE 94 1.1 alnsn #ifndef O_TMPFILE 95 1.1 alnsn #define O_TMPFILE (__O_TMPFILE | O_DIRECTORY) 96 1.1 alnsn #endif 97 1.1 alnsn #endif 98 1.1 alnsn 99 1.1 alnsn int mkostemp(char *template, int flags); 100 1.1 alnsn char *secure_getenv(const char *name); 101 1.1 alnsn 102 1.1 alnsn static SLJIT_INLINE int create_tempfile(void) 103 1.1 alnsn { 104 1.1 alnsn int fd; 105 1.1 alnsn 106 1.1 alnsn char tmp_name[256]; 107 1.1 alnsn size_t tmp_name_len; 108 1.1 alnsn char *dir; 109 1.1 alnsn size_t len; 110 1.1 alnsn 111 1.1 alnsn #ifdef P_tmpdir 112 1.1 alnsn len = (P_tmpdir != NULL) ? strlen(P_tmpdir) : 0; 113 1.1 alnsn 114 1.1 alnsn if (len > 0 && len < sizeof(tmp_name)) { 115 1.1 alnsn strcpy(tmp_name, P_tmpdir); 116 1.1 alnsn tmp_name_len = len; 117 1.1 alnsn } 118 1.1 alnsn else { 119 1.1 alnsn strcpy(tmp_name, "/tmp"); 120 1.1 alnsn tmp_name_len = 4; 121 1.1 alnsn } 122 1.1 alnsn #else 123 1.1 alnsn strcpy(tmp_name, "/tmp"); 124 1.1 alnsn tmp_name_len = 4; 125 1.1 alnsn #endif 126 1.1 alnsn 127 1.1 alnsn dir = secure_getenv("TMPDIR"); 128 1.1 alnsn if (dir) { 129 1.1 alnsn len = strlen(dir); 130 1.1 alnsn if (len > 0 && len < sizeof(tmp_name)) { 131 1.1 alnsn strcpy(tmp_name, dir); 132 1.1 alnsn tmp_name_len = len; 133 1.1 alnsn } 134 1.1 alnsn } 135 1.1 alnsn 136 1.1 alnsn SLJIT_ASSERT(tmp_name_len > 0 && tmp_name_len < sizeof(tmp_name)); 137 1.1 alnsn 138 1.1 alnsn while (tmp_name_len > 0 && tmp_name[tmp_name_len - 1] == '/') { 139 1.1 alnsn tmp_name_len--; 140 1.1 alnsn tmp_name[tmp_name_len] = '\0'; 141 1.1 alnsn } 142 1.1 alnsn 143 1.1 alnsn #ifdef O_TMPFILE 144 1.1 alnsn fd = open(tmp_name, O_TMPFILE | O_EXCL | O_RDWR | O_NOATIME | O_CLOEXEC, S_IRUSR | S_IWUSR); 145 1.1 alnsn if (fd != -1) 146 1.1 alnsn return fd; 147 1.1 alnsn #endif 148 1.1 alnsn 149 1.1 alnsn if (tmp_name_len + 7 >= sizeof(tmp_name)) 150 1.1 alnsn { 151 1.1 alnsn return -1; 152 1.1 alnsn } 153 1.1 alnsn 154 1.1 alnsn strcpy(tmp_name + tmp_name_len, "/XXXXXX"); 155 1.1 alnsn fd = mkostemp(tmp_name, O_CLOEXEC | O_NOATIME); 156 1.1 alnsn 157 1.1 alnsn if (fd == -1) 158 1.1 alnsn return fd; 159 1.1 alnsn 160 1.1 alnsn if (unlink(tmp_name)) { 161 1.1 alnsn close(fd); 162 1.1 alnsn return -1; 163 1.1 alnsn } 164 1.1 alnsn 165 1.1 alnsn return fd; 166 1.1 alnsn } 167 1.1 alnsn 168 1.1 alnsn static SLJIT_INLINE struct chunk_header* alloc_chunk(sljit_uw size) 169 1.1 alnsn { 170 1.1 alnsn struct chunk_header *retval; 171 1.1 alnsn int fd; 172 1.1 alnsn 173 1.1 alnsn fd = create_tempfile(); 174 1.1 alnsn if (fd == -1) 175 1.1 alnsn return NULL; 176 1.1 alnsn 177 1.1 alnsn if (ftruncate(fd, size)) { 178 1.1 alnsn close(fd); 179 1.1 alnsn return NULL; 180 1.1 alnsn } 181 1.1 alnsn 182 1.1 alnsn retval = (struct chunk_header *)mmap(NULL, size, PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0); 183 1.1 alnsn 184 1.1 alnsn if (retval == MAP_FAILED) { 185 1.1 alnsn close(fd); 186 1.1 alnsn return NULL; 187 1.1 alnsn } 188 1.1 alnsn 189 1.1 alnsn retval->executable = mmap(NULL, size, PROT_READ | PROT_EXEC, MAP_SHARED, fd, 0); 190 1.1 alnsn 191 1.1 alnsn if (retval->executable == MAP_FAILED) { 192 1.1 alnsn munmap(retval, size); 193 1.1 alnsn close(fd); 194 1.1 alnsn return NULL; 195 1.1 alnsn } 196 1.1 alnsn 197 1.1 alnsn retval->fd = fd; 198 1.1 alnsn return retval; 199 1.1 alnsn } 200 1.1 alnsn 201 1.1 alnsn static SLJIT_INLINE void free_chunk(void *chunk, sljit_uw size) 202 1.1 alnsn { 203 1.1 alnsn struct chunk_header *header = ((struct chunk_header *)chunk) - 1; 204 1.1 alnsn 205 1.1 alnsn int fd = header->fd; 206 1.1 alnsn munmap(header->executable, size); 207 1.1 alnsn munmap(header, size); 208 1.1 alnsn close(fd); 209 1.1 alnsn } 210 1.1 alnsn 211 1.1 alnsn /* --------------------------------------------------------------------- */ 212 1.1 alnsn /* Common functions */ 213 1.1 alnsn /* --------------------------------------------------------------------- */ 214 1.1 alnsn 215 1.1 alnsn #define CHUNK_MASK (~(CHUNK_SIZE - 1)) 216 1.1 alnsn 217 1.1 alnsn struct block_header { 218 1.1 alnsn sljit_uw size; 219 1.1 alnsn sljit_uw prev_size; 220 1.1 alnsn sljit_sw executable_offset; 221 1.1 alnsn }; 222 1.1 alnsn 223 1.1 alnsn struct free_block { 224 1.1 alnsn struct block_header header; 225 1.1 alnsn struct free_block *next; 226 1.1 alnsn struct free_block *prev; 227 1.1 alnsn sljit_uw size; 228 1.1 alnsn }; 229 1.1 alnsn 230 1.1 alnsn #define AS_BLOCK_HEADER(base, offset) \ 231 1.1 alnsn ((struct block_header*)(((sljit_u8*)base) + offset)) 232 1.1 alnsn #define AS_FREE_BLOCK(base, offset) \ 233 1.1 alnsn ((struct free_block*)(((sljit_u8*)base) + offset)) 234 1.1 alnsn #define MEM_START(base) ((void*)((base) + 1)) 235 1.1 alnsn #define ALIGN_SIZE(size) (((size) + sizeof(struct block_header) + 7) & ~7) 236 1.1 alnsn 237 1.1 alnsn static struct free_block* free_blocks; 238 1.1 alnsn static sljit_uw allocated_size; 239 1.1 alnsn static sljit_uw total_size; 240 1.1 alnsn 241 1.1 alnsn static SLJIT_INLINE void sljit_insert_free_block(struct free_block *free_block, sljit_uw size) 242 1.1 alnsn { 243 1.1 alnsn free_block->header.size = 0; 244 1.1 alnsn free_block->size = size; 245 1.1 alnsn 246 1.1 alnsn free_block->next = free_blocks; 247 1.1 alnsn free_block->prev = NULL; 248 1.1 alnsn if (free_blocks) 249 1.1 alnsn free_blocks->prev = free_block; 250 1.1 alnsn free_blocks = free_block; 251 1.1 alnsn } 252 1.1 alnsn 253 1.1 alnsn static SLJIT_INLINE void sljit_remove_free_block(struct free_block *free_block) 254 1.1 alnsn { 255 1.1 alnsn if (free_block->next) 256 1.1 alnsn free_block->next->prev = free_block->prev; 257 1.1 alnsn 258 1.1 alnsn if (free_block->prev) 259 1.1 alnsn free_block->prev->next = free_block->next; 260 1.1 alnsn else { 261 1.1 alnsn SLJIT_ASSERT(free_blocks == free_block); 262 1.1 alnsn free_blocks = free_block->next; 263 1.1 alnsn } 264 1.1 alnsn } 265 1.1 alnsn 266 1.1 alnsn SLJIT_API_FUNC_ATTRIBUTE void* sljit_malloc_exec(sljit_uw size) 267 1.1 alnsn { 268 1.1 alnsn struct chunk_header *chunk_header; 269 1.1 alnsn struct block_header *header; 270 1.1 alnsn struct block_header *next_header; 271 1.1 alnsn struct free_block *free_block; 272 1.1 alnsn sljit_uw chunk_size; 273 1.1 alnsn sljit_sw executable_offset; 274 1.1 alnsn 275 1.1 alnsn allocator_grab_lock(); 276 1.1 alnsn if (size < (64 - sizeof(struct block_header))) 277 1.1 alnsn size = (64 - sizeof(struct block_header)); 278 1.1 alnsn size = ALIGN_SIZE(size); 279 1.1 alnsn 280 1.1 alnsn free_block = free_blocks; 281 1.1 alnsn while (free_block) { 282 1.1 alnsn if (free_block->size >= size) { 283 1.1 alnsn chunk_size = free_block->size; 284 1.1 alnsn if (chunk_size > size + 64) { 285 1.1 alnsn /* We just cut a block from the end of the free block. */ 286 1.1 alnsn chunk_size -= size; 287 1.1 alnsn free_block->size = chunk_size; 288 1.1 alnsn header = AS_BLOCK_HEADER(free_block, chunk_size); 289 1.1 alnsn header->prev_size = chunk_size; 290 1.1 alnsn header->executable_offset = free_block->header.executable_offset; 291 1.1 alnsn AS_BLOCK_HEADER(header, size)->prev_size = size; 292 1.1 alnsn } 293 1.1 alnsn else { 294 1.1 alnsn sljit_remove_free_block(free_block); 295 1.1 alnsn header = (struct block_header*)free_block; 296 1.1 alnsn size = chunk_size; 297 1.1 alnsn } 298 1.1 alnsn allocated_size += size; 299 1.1 alnsn header->size = size; 300 1.1 alnsn allocator_release_lock(); 301 1.1 alnsn return MEM_START(header); 302 1.1 alnsn } 303 1.1 alnsn free_block = free_block->next; 304 1.1 alnsn } 305 1.1 alnsn 306 1.1 alnsn chunk_size = sizeof(struct chunk_header) + sizeof(struct block_header); 307 1.1 alnsn chunk_size = (chunk_size + size + CHUNK_SIZE - 1) & CHUNK_MASK; 308 1.1 alnsn 309 1.1 alnsn chunk_header = alloc_chunk(chunk_size); 310 1.1 alnsn if (!chunk_header) { 311 1.1 alnsn allocator_release_lock(); 312 1.1 alnsn return NULL; 313 1.1 alnsn } 314 1.1 alnsn 315 1.1 alnsn executable_offset = (sljit_sw)((sljit_u8*)chunk_header->executable - (sljit_u8*)chunk_header); 316 1.1 alnsn 317 1.1 alnsn chunk_size -= sizeof(struct chunk_header) + sizeof(struct block_header); 318 1.1 alnsn total_size += chunk_size; 319 1.1 alnsn 320 1.1 alnsn header = (struct block_header *)(chunk_header + 1); 321 1.1 alnsn 322 1.1 alnsn header->prev_size = 0; 323 1.1 alnsn header->executable_offset = executable_offset; 324 1.1 alnsn if (chunk_size > size + 64) { 325 1.1 alnsn /* Cut the allocated space into a free and a used block. */ 326 1.1 alnsn allocated_size += size; 327 1.1 alnsn header->size = size; 328 1.1 alnsn chunk_size -= size; 329 1.1 alnsn 330 1.1 alnsn free_block = AS_FREE_BLOCK(header, size); 331 1.1 alnsn free_block->header.prev_size = size; 332 1.1 alnsn free_block->header.executable_offset = executable_offset; 333 1.1 alnsn sljit_insert_free_block(free_block, chunk_size); 334 1.1 alnsn next_header = AS_BLOCK_HEADER(free_block, chunk_size); 335 1.1 alnsn } 336 1.1 alnsn else { 337 1.1 alnsn /* All space belongs to this allocation. */ 338 1.1 alnsn allocated_size += chunk_size; 339 1.1 alnsn header->size = chunk_size; 340 1.1 alnsn next_header = AS_BLOCK_HEADER(header, chunk_size); 341 1.1 alnsn } 342 1.1 alnsn next_header->size = 1; 343 1.1 alnsn next_header->prev_size = chunk_size; 344 1.1 alnsn next_header->executable_offset = executable_offset; 345 1.1 alnsn allocator_release_lock(); 346 1.1 alnsn return MEM_START(header); 347 1.1 alnsn } 348 1.1 alnsn 349 1.1 alnsn SLJIT_API_FUNC_ATTRIBUTE void sljit_free_exec(void* ptr) 350 1.1 alnsn { 351 1.1 alnsn struct block_header *header; 352 1.1 alnsn struct free_block* free_block; 353 1.1 alnsn 354 1.1 alnsn allocator_grab_lock(); 355 1.1 alnsn header = AS_BLOCK_HEADER(ptr, -(sljit_sw)sizeof(struct block_header)); 356 1.1 alnsn header = AS_BLOCK_HEADER(header, -header->executable_offset); 357 1.1 alnsn allocated_size -= header->size; 358 1.1 alnsn 359 1.1 alnsn /* Connecting free blocks together if possible. */ 360 1.1 alnsn 361 1.1 alnsn /* If header->prev_size == 0, free_block will equal to header. 362 1.1 alnsn In this case, free_block->header.size will be > 0. */ 363 1.1 alnsn free_block = AS_FREE_BLOCK(header, -(sljit_sw)header->prev_size); 364 1.1 alnsn if (SLJIT_UNLIKELY(!free_block->header.size)) { 365 1.1 alnsn free_block->size += header->size; 366 1.1 alnsn header = AS_BLOCK_HEADER(free_block, free_block->size); 367 1.1 alnsn header->prev_size = free_block->size; 368 1.1 alnsn } 369 1.1 alnsn else { 370 1.1 alnsn free_block = (struct free_block*)header; 371 1.1 alnsn sljit_insert_free_block(free_block, header->size); 372 1.1 alnsn } 373 1.1 alnsn 374 1.1 alnsn header = AS_BLOCK_HEADER(free_block, free_block->size); 375 1.1 alnsn if (SLJIT_UNLIKELY(!header->size)) { 376 1.1 alnsn free_block->size += ((struct free_block*)header)->size; 377 1.1 alnsn sljit_remove_free_block((struct free_block*)header); 378 1.1 alnsn header = AS_BLOCK_HEADER(free_block, free_block->size); 379 1.1 alnsn header->prev_size = free_block->size; 380 1.1 alnsn } 381 1.1 alnsn 382 1.1 alnsn /* The whole chunk is free. */ 383 1.1 alnsn if (SLJIT_UNLIKELY(!free_block->header.prev_size && header->size == 1)) { 384 1.1 alnsn /* If this block is freed, we still have (allocated_size / 2) free space. */ 385 1.1 alnsn if (total_size - free_block->size > (allocated_size * 3 / 2)) { 386 1.1 alnsn total_size -= free_block->size; 387 1.1 alnsn sljit_remove_free_block(free_block); 388 1.1 alnsn free_chunk(free_block, free_block->size + sizeof(struct block_header)); 389 1.1 alnsn } 390 1.1 alnsn } 391 1.1 alnsn 392 1.1 alnsn allocator_release_lock(); 393 1.1 alnsn } 394 1.1 alnsn 395 1.1 alnsn SLJIT_API_FUNC_ATTRIBUTE void sljit_free_unused_memory_exec(void) 396 1.1 alnsn { 397 1.1 alnsn struct free_block* free_block; 398 1.1 alnsn struct free_block* next_free_block; 399 1.1 alnsn 400 1.1 alnsn allocator_grab_lock(); 401 1.1 alnsn 402 1.1 alnsn free_block = free_blocks; 403 1.1 alnsn while (free_block) { 404 1.1 alnsn next_free_block = free_block->next; 405 1.1 alnsn if (!free_block->header.prev_size && 406 1.1 alnsn AS_BLOCK_HEADER(free_block, free_block->size)->size == 1) { 407 1.1 alnsn total_size -= free_block->size; 408 1.1 alnsn sljit_remove_free_block(free_block); 409 1.1 alnsn free_chunk(free_block, free_block->size + sizeof(struct block_header)); 410 1.1 alnsn } 411 1.1 alnsn free_block = next_free_block; 412 1.1 alnsn } 413 1.1 alnsn 414 1.1 alnsn SLJIT_ASSERT((total_size && free_blocks) || (!total_size && !free_blocks)); 415 1.1 alnsn allocator_release_lock(); 416 1.1 alnsn } 417 1.1 alnsn 418 1.1 alnsn SLJIT_API_FUNC_ATTRIBUTE sljit_sw sljit_exec_offset(void* ptr) 419 1.1 alnsn { 420 1.1 alnsn return ((struct block_header *)(ptr))[-1].executable_offset; 421 1.1 alnsn } 422