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