filename | src/sh4/xltcache.c |
changeset | 428:338966c8aed0 |
prev | 422:61a0598e07ff |
next | 488:d19a63e47cd9 |
author | nkeynes |
date | Wed Oct 31 09:10:23 2007 +0000 (16 years ago) |
permissions | -rw-r--r-- |
last change | Add save/restore of render buffers in save states Gzip memory blocks in save states Move front-buffer management back to pvr2 Add screenshot preview when loading save states Various minor fixes and cleanups |
file | annotate | diff | log | raw |
nkeynes@359 | 1 | /** |
nkeynes@428 | 2 | * $Id: xltcache.c,v 1.9 2007-10-07 06:27:12 nkeynes Exp $ |
nkeynes@359 | 3 | * |
nkeynes@359 | 4 | * Translation cache management. This part is architecture independent. |
nkeynes@359 | 5 | * |
nkeynes@359 | 6 | * Copyright (c) 2005 Nathan Keynes. |
nkeynes@359 | 7 | * |
nkeynes@359 | 8 | * This program is free software; you can redistribute it and/or modify |
nkeynes@359 | 9 | * it under the terms of the GNU General Public License as published by |
nkeynes@359 | 10 | * the Free Software Foundation; either version 2 of the License, or |
nkeynes@359 | 11 | * (at your option) any later version. |
nkeynes@359 | 12 | * |
nkeynes@359 | 13 | * This program is distributed in the hope that it will be useful, |
nkeynes@359 | 14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
nkeynes@359 | 15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
nkeynes@359 | 16 | * GNU General Public License for more details. |
nkeynes@359 | 17 | */ |
nkeynes@359 | 18 | |
nkeynes@359 | 19 | #include <sys/mman.h> |
nkeynes@359 | 20 | #include <assert.h> |
nkeynes@359 | 21 | |
nkeynes@428 | 22 | #include "dreamcast.h" |
nkeynes@428 | 23 | #include "sh4/xltcache.h" |
nkeynes@428 | 24 | #include "x86dasm/x86dasm.h" |
nkeynes@428 | 25 | |
nkeynes@359 | 26 | #define XLAT_LUT_PAGE_BITS 12 |
nkeynes@359 | 27 | #define XLAT_LUT_TOTAL_BITS 28 |
nkeynes@359 | 28 | #define XLAT_LUT_PAGE(addr) (((addr)>>13) & 0xFFFF) |
nkeynes@359 | 29 | #define XLAT_LUT_ENTRY(addr) (((addr)&0x1FFE) >> 1) |
nkeynes@359 | 30 | |
nkeynes@359 | 31 | #define XLAT_LUT_PAGES (1<<(XLAT_LUT_TOTAL_BITS-XLAT_LUT_PAGE_BITS)) |
nkeynes@359 | 32 | #define XLAT_LUT_PAGE_ENTRIES (1<<XLAT_LUT_PAGE_BITS) |
nkeynes@359 | 33 | #define XLAT_LUT_PAGE_SIZE (XLAT_LUT_PAGE_ENTRIES * sizeof(void *)) |
nkeynes@359 | 34 | |
nkeynes@359 | 35 | #define XLAT_LUT_ENTRY_EMPTY (void *)0 |
nkeynes@359 | 36 | #define XLAT_LUT_ENTRY_USED (void *)1 |
nkeynes@359 | 37 | |
nkeynes@359 | 38 | #define NEXT(block) ( (xlat_cache_block_t)&((block)->code[(block)->size])) |
nkeynes@359 | 39 | #define BLOCK_FOR_CODE(code) (((xlat_cache_block_t)code)-1) |
nkeynes@359 | 40 | #define IS_ENTRY_POINT(ent) (ent > XLAT_LUT_ENTRY_USED) |
nkeynes@359 | 41 | #define IS_ENTRY_USED(ent) (ent != XLAT_LUT_ENTRY_EMPTY) |
nkeynes@359 | 42 | |
nkeynes@359 | 43 | #define MIN_BLOCK_SIZE 32 |
nkeynes@359 | 44 | #define MIN_TOTAL_SIZE (sizeof(struct xlat_cache_block)+MIN_BLOCK_SIZE) |
nkeynes@359 | 45 | |
nkeynes@359 | 46 | #define BLOCK_INACTIVE 0 |
nkeynes@359 | 47 | #define BLOCK_ACTIVE 1 |
nkeynes@359 | 48 | #define BLOCK_USED 2 |
nkeynes@359 | 49 | |
nkeynes@359 | 50 | xlat_cache_block_t xlat_new_cache; |
nkeynes@359 | 51 | xlat_cache_block_t xlat_new_cache_ptr; |
nkeynes@359 | 52 | xlat_cache_block_t xlat_new_create_ptr; |
nkeynes@359 | 53 | xlat_cache_block_t xlat_temp_cache; |
nkeynes@359 | 54 | xlat_cache_block_t xlat_temp_cache_ptr; |
nkeynes@359 | 55 | xlat_cache_block_t xlat_old_cache; |
nkeynes@359 | 56 | xlat_cache_block_t xlat_old_cache_ptr; |
nkeynes@359 | 57 | static void ***xlat_lut; |
nkeynes@376 | 58 | static gboolean xlat_initialized = FALSE; |
nkeynes@359 | 59 | |
nkeynes@422 | 60 | void xlat_cache_init(void) |
nkeynes@359 | 61 | { |
nkeynes@376 | 62 | if( !xlat_initialized ) { |
nkeynes@376 | 63 | xlat_initialized = TRUE; |
nkeynes@376 | 64 | xlat_new_cache = mmap( NULL, XLAT_NEW_CACHE_SIZE, PROT_EXEC|PROT_READ|PROT_WRITE, |
nkeynes@376 | 65 | MAP_PRIVATE|MAP_ANONYMOUS, -1, 0 ); |
nkeynes@376 | 66 | xlat_temp_cache = mmap( NULL, XLAT_TEMP_CACHE_SIZE, PROT_EXEC|PROT_READ|PROT_WRITE, |
nkeynes@376 | 67 | MAP_PRIVATE|MAP_ANONYMOUS, -1, 0 ); |
nkeynes@376 | 68 | xlat_old_cache = mmap( NULL, XLAT_OLD_CACHE_SIZE, PROT_EXEC|PROT_READ|PROT_WRITE, |
nkeynes@376 | 69 | MAP_PRIVATE|MAP_ANONYMOUS, -1, 0 ); |
nkeynes@376 | 70 | xlat_new_cache_ptr = xlat_new_cache; |
nkeynes@376 | 71 | xlat_temp_cache_ptr = xlat_temp_cache; |
nkeynes@376 | 72 | xlat_old_cache_ptr = xlat_old_cache; |
nkeynes@376 | 73 | xlat_new_create_ptr = xlat_new_cache; |
nkeynes@376 | 74 | |
nkeynes@376 | 75 | xlat_lut = mmap( NULL, XLAT_LUT_PAGES*sizeof(void *), PROT_READ|PROT_WRITE, |
nkeynes@376 | 76 | MAP_PRIVATE|MAP_ANONYMOUS, -1, 0); |
nkeynes@376 | 77 | memset( xlat_lut, 0, XLAT_LUT_PAGES*sizeof(void *) ); |
nkeynes@376 | 78 | } |
nkeynes@359 | 79 | xlat_flush_cache(); |
nkeynes@359 | 80 | } |
nkeynes@359 | 81 | |
nkeynes@400 | 82 | void xlat_print_free( FILE *out ) |
nkeynes@400 | 83 | { |
nkeynes@400 | 84 | fprintf( out, "New space: %d\nTemp space: %d\nOld space: %d\n", |
nkeynes@400 | 85 | xlat_new_cache_ptr->size, xlat_temp_cache_ptr->size, xlat_old_cache_ptr->size ); |
nkeynes@400 | 86 | } |
nkeynes@400 | 87 | |
nkeynes@359 | 88 | /** |
nkeynes@359 | 89 | * Reset the cache structure to its default state |
nkeynes@359 | 90 | */ |
nkeynes@359 | 91 | void xlat_flush_cache() |
nkeynes@359 | 92 | { |
nkeynes@359 | 93 | xlat_cache_block_t tmp; |
nkeynes@359 | 94 | int i; |
nkeynes@359 | 95 | xlat_new_cache_ptr = xlat_new_cache; |
nkeynes@359 | 96 | xlat_new_cache_ptr->active = 0; |
nkeynes@359 | 97 | xlat_new_cache_ptr->size = XLAT_NEW_CACHE_SIZE - 2*sizeof(struct xlat_cache_block); |
nkeynes@359 | 98 | tmp = NEXT(xlat_new_cache_ptr); |
nkeynes@359 | 99 | tmp->active = 1; |
nkeynes@359 | 100 | tmp->size = 0; |
nkeynes@359 | 101 | xlat_temp_cache_ptr = xlat_temp_cache; |
nkeynes@359 | 102 | xlat_temp_cache_ptr->active = 0; |
nkeynes@359 | 103 | xlat_temp_cache_ptr->size = XLAT_TEMP_CACHE_SIZE - 2*sizeof(struct xlat_cache_block); |
nkeynes@359 | 104 | tmp = NEXT(xlat_temp_cache_ptr); |
nkeynes@359 | 105 | tmp->active = 1; |
nkeynes@359 | 106 | tmp->size = 0; |
nkeynes@359 | 107 | xlat_old_cache_ptr = xlat_old_cache; |
nkeynes@359 | 108 | xlat_old_cache_ptr->active = 0; |
nkeynes@359 | 109 | xlat_old_cache_ptr->size = XLAT_OLD_CACHE_SIZE - 2*sizeof(struct xlat_cache_block); |
nkeynes@359 | 110 | tmp = NEXT(xlat_old_cache_ptr); |
nkeynes@359 | 111 | tmp->active = 1; |
nkeynes@359 | 112 | tmp->size = 0; |
nkeynes@359 | 113 | for( i=0; i<XLAT_LUT_PAGES; i++ ) { |
nkeynes@359 | 114 | if( xlat_lut[i] != NULL ) { |
nkeynes@359 | 115 | memset( xlat_lut[i], 0, XLAT_LUT_PAGE_SIZE ); |
nkeynes@359 | 116 | } |
nkeynes@359 | 117 | } |
nkeynes@359 | 118 | } |
nkeynes@359 | 119 | |
nkeynes@400 | 120 | static void xlat_flush_page_by_lut( void **page ) |
nkeynes@359 | 121 | { |
nkeynes@359 | 122 | int i; |
nkeynes@359 | 123 | for( i=0; i<XLAT_LUT_PAGE_ENTRIES; i++ ) { |
nkeynes@359 | 124 | if( IS_ENTRY_POINT(page[i]) ) { |
nkeynes@359 | 125 | BLOCK_FOR_CODE(page[i])->active = 0; |
nkeynes@359 | 126 | } |
nkeynes@359 | 127 | page[i] = NULL; |
nkeynes@359 | 128 | } |
nkeynes@359 | 129 | } |
nkeynes@359 | 130 | |
nkeynes@400 | 131 | void xlat_invalidate_word( sh4addr_t addr ) |
nkeynes@400 | 132 | { |
nkeynes@400 | 133 | if( xlat_lut ) { |
nkeynes@400 | 134 | void **page = xlat_lut[XLAT_LUT_PAGE(addr)]; |
nkeynes@400 | 135 | if( page != NULL ) { |
nkeynes@400 | 136 | int entry = XLAT_LUT_ENTRY(addr); |
nkeynes@400 | 137 | if( page[entry] != NULL ) { |
nkeynes@400 | 138 | xlat_flush_page_by_lut(page); |
nkeynes@400 | 139 | } |
nkeynes@400 | 140 | } |
nkeynes@400 | 141 | } |
nkeynes@400 | 142 | } |
nkeynes@400 | 143 | |
nkeynes@400 | 144 | void xlat_invalidate_long( sh4addr_t addr ) |
nkeynes@400 | 145 | { |
nkeynes@400 | 146 | if( xlat_lut ) { |
nkeynes@400 | 147 | void **page = xlat_lut[XLAT_LUT_PAGE(addr)]; |
nkeynes@400 | 148 | if( page != NULL ) { |
nkeynes@400 | 149 | int entry = XLAT_LUT_ENTRY(addr); |
nkeynes@400 | 150 | if( page[entry] != NULL || page[entry+1] != NULL ) { |
nkeynes@400 | 151 | xlat_flush_page_by_lut(page); |
nkeynes@400 | 152 | } |
nkeynes@400 | 153 | } |
nkeynes@400 | 154 | } |
nkeynes@400 | 155 | } |
nkeynes@400 | 156 | |
nkeynes@400 | 157 | void xlat_invalidate_block( sh4addr_t address, size_t size ) |
nkeynes@400 | 158 | { |
nkeynes@400 | 159 | int i; |
nkeynes@400 | 160 | int entry_count = size >> 1; // words; |
nkeynes@400 | 161 | uint32_t page_no = XLAT_LUT_PAGE(address); |
nkeynes@400 | 162 | int entry = XLAT_LUT_ENTRY(address); |
nkeynes@400 | 163 | if( xlat_lut ) { |
nkeynes@400 | 164 | do { |
nkeynes@400 | 165 | void **page = xlat_lut[page_no]; |
nkeynes@400 | 166 | int page_entries = XLAT_LUT_PAGE_ENTRIES - entry; |
nkeynes@400 | 167 | if( entry_count < page_entries ) { |
nkeynes@400 | 168 | page_entries = entry_count; |
nkeynes@400 | 169 | } |
nkeynes@400 | 170 | if( page != NULL ) { |
nkeynes@400 | 171 | if( page_entries == XLAT_LUT_PAGE_ENTRIES ) { |
nkeynes@400 | 172 | /* Overwriting the entire page anyway */ |
nkeynes@400 | 173 | xlat_flush_page_by_lut(page); |
nkeynes@400 | 174 | } else { |
nkeynes@400 | 175 | for( i=entry; i<entry+page_entries; i++ ) { |
nkeynes@400 | 176 | if( page[i] != NULL ) { |
nkeynes@400 | 177 | xlat_flush_page_by_lut(page); |
nkeynes@400 | 178 | break; |
nkeynes@400 | 179 | } |
nkeynes@400 | 180 | } |
nkeynes@400 | 181 | } |
nkeynes@400 | 182 | entry_count -= page_entries; |
nkeynes@400 | 183 | } |
nkeynes@400 | 184 | page_no ++; |
nkeynes@400 | 185 | entry_count -= page_entries; |
nkeynes@400 | 186 | entry = 0; |
nkeynes@400 | 187 | } while( entry_count > 0 ); |
nkeynes@400 | 188 | } |
nkeynes@400 | 189 | } |
nkeynes@400 | 190 | |
nkeynes@400 | 191 | void xlat_flush_page( sh4addr_t address ) |
nkeynes@400 | 192 | { |
nkeynes@400 | 193 | void **page = xlat_lut[XLAT_LUT_PAGE(address)]; |
nkeynes@400 | 194 | if( page != NULL ) { |
nkeynes@400 | 195 | xlat_flush_page_by_lut(page); |
nkeynes@400 | 196 | } |
nkeynes@400 | 197 | } |
nkeynes@400 | 198 | |
nkeynes@359 | 199 | void *xlat_get_code( sh4addr_t address ) |
nkeynes@359 | 200 | { |
nkeynes@410 | 201 | void *result = NULL; |
nkeynes@359 | 202 | void **page = xlat_lut[XLAT_LUT_PAGE(address)]; |
nkeynes@407 | 203 | if( page != NULL ) { |
nkeynes@410 | 204 | result = (void *)(((uint32_t)(page[XLAT_LUT_ENTRY(address)])) & 0xFFFFFFFC); |
nkeynes@407 | 205 | } |
nkeynes@407 | 206 | return result; |
nkeynes@407 | 207 | } |
nkeynes@407 | 208 | |
nkeynes@407 | 209 | void **xlat_get_lut_entry( sh4addr_t address ) |
nkeynes@407 | 210 | { |
nkeynes@407 | 211 | void **page = xlat_lut[XLAT_LUT_PAGE(address)]; |
nkeynes@407 | 212 | |
nkeynes@407 | 213 | /* Add the LUT entry for the block */ |
nkeynes@359 | 214 | if( page == NULL ) { |
nkeynes@407 | 215 | xlat_lut[XLAT_LUT_PAGE(address)] = page = |
nkeynes@407 | 216 | mmap( NULL, XLAT_LUT_PAGE_SIZE, PROT_READ|PROT_WRITE, |
nkeynes@407 | 217 | MAP_PRIVATE|MAP_ANONYMOUS, -1, 0 ); |
nkeynes@407 | 218 | memset( page, 0, XLAT_LUT_PAGE_SIZE ); |
nkeynes@359 | 219 | } |
nkeynes@407 | 220 | |
nkeynes@407 | 221 | return &page[XLAT_LUT_ENTRY(address)]; |
nkeynes@359 | 222 | } |
nkeynes@359 | 223 | |
nkeynes@407 | 224 | |
nkeynes@407 | 225 | |
nkeynes@366 | 226 | uint32_t xlat_get_block_size( void *block ) |
nkeynes@366 | 227 | { |
nkeynes@366 | 228 | xlat_cache_block_t xlt = (xlat_cache_block_t)(((char *)block)-sizeof(struct xlat_cache_block)); |
nkeynes@366 | 229 | return xlt->size; |
nkeynes@366 | 230 | } |
nkeynes@366 | 231 | |
nkeynes@359 | 232 | /** |
nkeynes@359 | 233 | * Cut the specified block so that it has the given size, with the remaining data |
nkeynes@359 | 234 | * forming a new free block. If the free block would be less than the minimum size, |
nkeynes@359 | 235 | * the cut is not performed. |
nkeynes@359 | 236 | * @return the next block after the (possibly cut) block. |
nkeynes@359 | 237 | */ |
nkeynes@359 | 238 | static inline xlat_cache_block_t xlat_cut_block( xlat_cache_block_t block, int cutsize ) |
nkeynes@359 | 239 | { |
nkeynes@407 | 240 | cutsize = (cutsize + 3) & 0xFFFFFFFC; // force word alignment |
nkeynes@410 | 241 | assert( cutsize <= block->size ); |
nkeynes@359 | 242 | if( block->size > cutsize + MIN_TOTAL_SIZE ) { |
nkeynes@359 | 243 | int oldsize = block->size; |
nkeynes@359 | 244 | block->size = cutsize; |
nkeynes@359 | 245 | xlat_cache_block_t next = NEXT(block); |
nkeynes@359 | 246 | next->active = 0; |
nkeynes@359 | 247 | next->size = oldsize - cutsize - sizeof(struct xlat_cache_block); |
nkeynes@359 | 248 | return next; |
nkeynes@359 | 249 | } else { |
nkeynes@359 | 250 | return NEXT(block); |
nkeynes@359 | 251 | } |
nkeynes@359 | 252 | } |
nkeynes@359 | 253 | |
nkeynes@359 | 254 | /** |
nkeynes@359 | 255 | * Promote a block in temp space (or elsewhere for that matter) to old space. |
nkeynes@359 | 256 | * |
nkeynes@359 | 257 | * @param block to promote. |
nkeynes@359 | 258 | */ |
nkeynes@359 | 259 | static void xlat_promote_to_old_space( xlat_cache_block_t block ) |
nkeynes@359 | 260 | { |
nkeynes@359 | 261 | int allocation = -sizeof(struct xlat_cache_block); |
nkeynes@359 | 262 | int size = block->size; |
nkeynes@359 | 263 | xlat_cache_block_t curr = xlat_old_cache_ptr; |
nkeynes@359 | 264 | xlat_cache_block_t start_block = curr; |
nkeynes@359 | 265 | do { |
nkeynes@359 | 266 | allocation += curr->size + sizeof(struct xlat_cache_block); |
nkeynes@359 | 267 | curr = NEXT(curr); |
nkeynes@359 | 268 | if( allocation > size ) { |
nkeynes@359 | 269 | break; /* done */ |
nkeynes@359 | 270 | } |
nkeynes@359 | 271 | if( curr->size == 0 ) { /* End-of-cache Sentinel */ |
nkeynes@359 | 272 | /* Leave what we just released as free space and start again from the |
nkeynes@359 | 273 | * top of the cache |
nkeynes@359 | 274 | */ |
nkeynes@359 | 275 | start_block->active = 0; |
nkeynes@359 | 276 | start_block->size = allocation; |
nkeynes@359 | 277 | allocation = -sizeof(struct xlat_cache_block); |
nkeynes@359 | 278 | start_block = curr = xlat_old_cache; |
nkeynes@359 | 279 | } |
nkeynes@359 | 280 | } while(1); |
nkeynes@359 | 281 | start_block->active = 1; |
nkeynes@359 | 282 | start_block->size = allocation; |
nkeynes@359 | 283 | start_block->lut_entry = block->lut_entry; |
nkeynes@359 | 284 | *block->lut_entry = &start_block->code; |
nkeynes@359 | 285 | memcpy( start_block->code, block->code, block->size ); |
nkeynes@359 | 286 | xlat_old_cache_ptr = xlat_cut_block(start_block, size ); |
nkeynes@359 | 287 | if( xlat_old_cache_ptr->size == 0 ) { |
nkeynes@359 | 288 | xlat_old_cache_ptr = xlat_old_cache; |
nkeynes@359 | 289 | } |
nkeynes@359 | 290 | } |
nkeynes@359 | 291 | |
nkeynes@359 | 292 | /** |
nkeynes@359 | 293 | * Similarly to the above method, promotes a block to temp space. |
nkeynes@359 | 294 | * TODO: Try to combine these - they're nearly identical |
nkeynes@359 | 295 | */ |
nkeynes@359 | 296 | void xlat_promote_to_temp_space( xlat_cache_block_t block ) |
nkeynes@359 | 297 | { |
nkeynes@359 | 298 | int size = block->size; |
nkeynes@359 | 299 | int allocation = -sizeof(struct xlat_cache_block); |
nkeynes@359 | 300 | xlat_cache_block_t curr = xlat_temp_cache_ptr; |
nkeynes@359 | 301 | xlat_cache_block_t start_block = curr; |
nkeynes@359 | 302 | do { |
nkeynes@359 | 303 | if( curr->active == BLOCK_USED ) { |
nkeynes@359 | 304 | xlat_promote_to_old_space( curr ); |
nkeynes@359 | 305 | } |
nkeynes@359 | 306 | allocation += curr->size + sizeof(struct xlat_cache_block); |
nkeynes@359 | 307 | curr = NEXT(curr); |
nkeynes@359 | 308 | if( allocation > size ) { |
nkeynes@359 | 309 | break; /* done */ |
nkeynes@359 | 310 | } |
nkeynes@359 | 311 | if( curr->size == 0 ) { /* End-of-cache Sentinel */ |
nkeynes@359 | 312 | /* Leave what we just released as free space and start again from the |
nkeynes@359 | 313 | * top of the cache |
nkeynes@359 | 314 | */ |
nkeynes@359 | 315 | start_block->active = 0; |
nkeynes@359 | 316 | start_block->size = allocation; |
nkeynes@359 | 317 | allocation = -sizeof(struct xlat_cache_block); |
nkeynes@359 | 318 | start_block = curr = xlat_temp_cache; |
nkeynes@359 | 319 | } |
nkeynes@359 | 320 | } while(1); |
nkeynes@359 | 321 | start_block->active = 1; |
nkeynes@359 | 322 | start_block->size = allocation; |
nkeynes@359 | 323 | start_block->lut_entry = block->lut_entry; |
nkeynes@359 | 324 | *block->lut_entry = &start_block->code; |
nkeynes@359 | 325 | memcpy( start_block->code, block->code, block->size ); |
nkeynes@359 | 326 | xlat_temp_cache_ptr = xlat_cut_block(start_block, size ); |
nkeynes@359 | 327 | if( xlat_temp_cache_ptr->size == 0 ) { |
nkeynes@359 | 328 | xlat_temp_cache_ptr = xlat_temp_cache; |
nkeynes@359 | 329 | } |
nkeynes@359 | 330 | |
nkeynes@359 | 331 | } |
nkeynes@359 | 332 | |
nkeynes@359 | 333 | /** |
nkeynes@359 | 334 | * Returns the next block in the new cache list that can be written to by the |
nkeynes@359 | 335 | * translator. If the next block is active, it is evicted first. |
nkeynes@359 | 336 | */ |
nkeynes@359 | 337 | xlat_cache_block_t xlat_start_block( sh4addr_t address ) |
nkeynes@359 | 338 | { |
nkeynes@359 | 339 | if( xlat_new_cache_ptr->size == 0 ) { |
nkeynes@359 | 340 | xlat_new_cache_ptr = xlat_new_cache; |
nkeynes@359 | 341 | } |
nkeynes@359 | 342 | |
nkeynes@359 | 343 | if( xlat_new_cache_ptr->active ) { |
nkeynes@359 | 344 | xlat_promote_to_temp_space( xlat_new_cache_ptr ); |
nkeynes@359 | 345 | } |
nkeynes@359 | 346 | xlat_new_create_ptr = xlat_new_cache_ptr; |
nkeynes@359 | 347 | xlat_new_create_ptr->active = 1; |
nkeynes@359 | 348 | xlat_new_cache_ptr = NEXT(xlat_new_cache_ptr); |
nkeynes@359 | 349 | |
nkeynes@359 | 350 | /* Add the LUT entry for the block */ |
nkeynes@359 | 351 | if( xlat_lut[XLAT_LUT_PAGE(address)] == NULL ) { |
nkeynes@359 | 352 | xlat_lut[XLAT_LUT_PAGE(address)] = |
nkeynes@359 | 353 | mmap( NULL, XLAT_LUT_PAGE_SIZE, PROT_READ|PROT_WRITE, |
nkeynes@359 | 354 | MAP_PRIVATE|MAP_ANONYMOUS, -1, 0 ); |
nkeynes@359 | 355 | memset( xlat_lut[XLAT_LUT_PAGE(address)], 0, XLAT_LUT_PAGE_SIZE ); |
nkeynes@359 | 356 | } |
nkeynes@359 | 357 | |
nkeynes@359 | 358 | if( IS_ENTRY_POINT(xlat_lut[XLAT_LUT_PAGE(address)][XLAT_LUT_ENTRY(address)]) ) { |
nkeynes@359 | 359 | xlat_cache_block_t oldblock = BLOCK_FOR_CODE(xlat_lut[XLAT_LUT_PAGE(address)][XLAT_LUT_ENTRY(address)]); |
nkeynes@359 | 360 | oldblock->active = 0; |
nkeynes@359 | 361 | } |
nkeynes@359 | 362 | |
nkeynes@359 | 363 | xlat_lut[XLAT_LUT_PAGE(address)][XLAT_LUT_ENTRY(address)] = |
nkeynes@359 | 364 | &xlat_new_create_ptr->code; |
nkeynes@359 | 365 | xlat_new_create_ptr->lut_entry = xlat_lut[XLAT_LUT_PAGE(address)] + XLAT_LUT_ENTRY(address); |
nkeynes@359 | 366 | |
nkeynes@359 | 367 | return xlat_new_create_ptr; |
nkeynes@359 | 368 | } |
nkeynes@359 | 369 | |
nkeynes@410 | 370 | xlat_cache_block_t xlat_extend_block( uint32_t newSize ) |
nkeynes@359 | 371 | { |
nkeynes@410 | 372 | while( xlat_new_create_ptr->size < newSize ) { |
nkeynes@410 | 373 | if( xlat_new_cache_ptr->size == 0 ) { |
nkeynes@410 | 374 | /* Migrate to the front of the cache to keep it contiguous */ |
nkeynes@410 | 375 | xlat_new_create_ptr->active = 0; |
nkeynes@428 | 376 | unsigned char *olddata = xlat_new_create_ptr->code; |
nkeynes@410 | 377 | int oldsize = xlat_new_create_ptr->size; |
nkeynes@410 | 378 | int size = oldsize + MIN_BLOCK_SIZE; /* minimum expansion */ |
nkeynes@410 | 379 | void **lut_entry = xlat_new_create_ptr->lut_entry; |
nkeynes@410 | 380 | int allocation = -sizeof(struct xlat_cache_block); |
nkeynes@410 | 381 | xlat_new_cache_ptr = xlat_new_cache; |
nkeynes@410 | 382 | do { |
nkeynes@410 | 383 | if( xlat_new_cache_ptr->active ) { |
nkeynes@410 | 384 | xlat_promote_to_temp_space( xlat_new_cache_ptr ); |
nkeynes@410 | 385 | } |
nkeynes@410 | 386 | allocation += xlat_new_cache_ptr->size + sizeof(struct xlat_cache_block); |
nkeynes@410 | 387 | xlat_new_cache_ptr = NEXT(xlat_new_cache_ptr); |
nkeynes@410 | 388 | } while( allocation < size ); |
nkeynes@410 | 389 | xlat_new_create_ptr = xlat_new_cache; |
nkeynes@410 | 390 | xlat_new_create_ptr->active = 1; |
nkeynes@410 | 391 | xlat_new_create_ptr->size = allocation; |
nkeynes@410 | 392 | xlat_new_create_ptr->lut_entry = lut_entry; |
nkeynes@410 | 393 | *lut_entry = &xlat_new_create_ptr->code; |
nkeynes@410 | 394 | memmove( xlat_new_create_ptr->code, olddata, oldsize ); |
nkeynes@410 | 395 | } else { |
nkeynes@359 | 396 | if( xlat_new_cache_ptr->active ) { |
nkeynes@359 | 397 | xlat_promote_to_temp_space( xlat_new_cache_ptr ); |
nkeynes@359 | 398 | } |
nkeynes@410 | 399 | xlat_new_create_ptr->size += xlat_new_cache_ptr->size + sizeof(struct xlat_cache_block); |
nkeynes@359 | 400 | xlat_new_cache_ptr = NEXT(xlat_new_cache_ptr); |
nkeynes@359 | 401 | } |
nkeynes@359 | 402 | } |
nkeynes@359 | 403 | return xlat_new_create_ptr; |
nkeynes@359 | 404 | |
nkeynes@359 | 405 | } |
nkeynes@359 | 406 | |
nkeynes@359 | 407 | void xlat_commit_block( uint32_t destsize, uint32_t srcsize ) |
nkeynes@359 | 408 | { |
nkeynes@359 | 409 | void **ptr = xlat_new_create_ptr->lut_entry; |
nkeynes@359 | 410 | void **endptr = ptr + (srcsize>>2); |
nkeynes@359 | 411 | while( ptr < endptr ) { |
nkeynes@359 | 412 | if( *ptr == NULL ) { |
nkeynes@359 | 413 | *ptr = XLAT_LUT_ENTRY_USED; |
nkeynes@359 | 414 | } |
nkeynes@359 | 415 | ptr++; |
nkeynes@359 | 416 | } |
nkeynes@359 | 417 | |
nkeynes@359 | 418 | xlat_new_cache_ptr = xlat_cut_block( xlat_new_create_ptr, destsize ); |
nkeynes@359 | 419 | } |
nkeynes@359 | 420 | |
nkeynes@359 | 421 | void xlat_delete_block( xlat_cache_block_t block ) |
nkeynes@359 | 422 | { |
nkeynes@359 | 423 | block->active = 0; |
nkeynes@359 | 424 | *block->lut_entry = NULL; |
nkeynes@359 | 425 | } |
nkeynes@359 | 426 | |
nkeynes@359 | 427 | void xlat_check_cache_integrity( xlat_cache_block_t cache, xlat_cache_block_t ptr, int size ) |
nkeynes@359 | 428 | { |
nkeynes@359 | 429 | int foundptr = 0; |
nkeynes@359 | 430 | xlat_cache_block_t tail = |
nkeynes@359 | 431 | (xlat_cache_block_t)(((char *)cache) + size - sizeof(struct xlat_cache_block)); |
nkeynes@359 | 432 | |
nkeynes@359 | 433 | assert( tail->active == 1 ); |
nkeynes@359 | 434 | assert( tail->size == 0 ); |
nkeynes@359 | 435 | while( cache < tail ) { |
nkeynes@359 | 436 | assert( cache->active >= 0 && cache->active <= 2 ); |
nkeynes@359 | 437 | assert( cache->size >= 0 && cache->size < size ); |
nkeynes@359 | 438 | if( cache == ptr ) { |
nkeynes@359 | 439 | foundptr = 1; |
nkeynes@359 | 440 | } |
nkeynes@359 | 441 | cache = NEXT(cache); |
nkeynes@359 | 442 | } |
nkeynes@359 | 443 | assert( cache == tail ); |
nkeynes@359 | 444 | assert( foundptr == 1 ); |
nkeynes@359 | 445 | } |
nkeynes@359 | 446 | |
nkeynes@359 | 447 | void xlat_check_integrity( ) |
nkeynes@359 | 448 | { |
nkeynes@359 | 449 | xlat_check_cache_integrity( xlat_new_cache, xlat_new_cache_ptr, XLAT_NEW_CACHE_SIZE ); |
nkeynes@359 | 450 | xlat_check_cache_integrity( xlat_temp_cache, xlat_temp_cache_ptr, XLAT_TEMP_CACHE_SIZE ); |
nkeynes@359 | 451 | xlat_check_cache_integrity( xlat_old_cache, xlat_old_cache_ptr, XLAT_OLD_CACHE_SIZE ); |
nkeynes@359 | 452 | } |
nkeynes@376 | 453 | |
nkeynes@376 | 454 | |
nkeynes@376 | 455 | void xlat_disasm_block( FILE *out, void *block ) |
nkeynes@376 | 456 | { |
nkeynes@376 | 457 | uint32_t buflen = xlat_get_block_size(block); |
nkeynes@376 | 458 | x86_set_symtab( NULL, 0 ); |
nkeynes@376 | 459 | x86_disasm_block( out, block, buflen ); |
nkeynes@376 | 460 | } |
.