Search
lxdream.org :: lxdream/src/sh4/xltcache.c
lxdream 0.9.1
released Jun 29
Download Now
filename src/sh4/xltcache.c
changeset 383:f597b73474cb
prev376:8c7587af5a5d
next400:049d72a7a229
author nkeynes
date Tue Sep 18 09:11:53 2007 +0000 (15 years ago)
permissions -rw-r--r--
last change Up the max instruction size to 256 (TODO: work out what this should actually
be)
view annotate diff log raw
     1 /**
     2  * $Id: xltcache.c,v 1.4 2007-09-16 06:59:47 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 /**
    82  * Reset the cache structure to its default state
    83  */
    84 void xlat_flush_cache() 
    85 {
    86     xlat_cache_block_t tmp;
    87     int i;
    88     xlat_new_cache_ptr = xlat_new_cache;
    89     xlat_new_cache_ptr->active = 0;
    90     xlat_new_cache_ptr->size = XLAT_NEW_CACHE_SIZE - 2*sizeof(struct xlat_cache_block);
    91     tmp = NEXT(xlat_new_cache_ptr);
    92     tmp->active = 1;
    93     tmp->size = 0;
    94     xlat_temp_cache_ptr = xlat_temp_cache;
    95     xlat_temp_cache_ptr->active = 0;
    96     xlat_temp_cache_ptr->size = XLAT_TEMP_CACHE_SIZE - 2*sizeof(struct xlat_cache_block);
    97     tmp = NEXT(xlat_temp_cache_ptr);
    98     tmp->active = 1;
    99     tmp->size = 0;
   100     xlat_old_cache_ptr = xlat_old_cache;
   101     xlat_old_cache_ptr->active = 0;
   102     xlat_old_cache_ptr->size = XLAT_OLD_CACHE_SIZE - 2*sizeof(struct xlat_cache_block);
   103     tmp = NEXT(xlat_old_cache_ptr);
   104     tmp->active = 1;
   105     tmp->size = 0;
   106     for( i=0; i<XLAT_LUT_PAGES; i++ ) {
   107 	if( xlat_lut[i] != NULL ) {
   108 	    memset( xlat_lut[i], 0, XLAT_LUT_PAGE_SIZE );
   109 	}
   110     }
   111 }
   113 void xlat_flush_page( sh4addr_t address )
   114 {
   115     int i;
   116     void **page = xlat_lut[XLAT_LUT_PAGE(address)];
   117     for( i=0; i<XLAT_LUT_PAGE_ENTRIES; i++ ) {
   118 	if( IS_ENTRY_POINT(page[i]) ) {
   119 	    BLOCK_FOR_CODE(page[i])->active = 0;
   120 	}
   121 	page[i] = NULL;
   122     }
   123 }
   125 void *xlat_get_code( sh4addr_t address )
   126 {
   127     void **page = xlat_lut[XLAT_LUT_PAGE(address)];
   128     if( page == NULL ) {
   129 	return NULL;
   130     }
   131     void *result = page[XLAT_LUT_ENTRY(address)];
   132     if( result == ((void *)(1)) ) {
   133 	return NULL;
   134     } else {
   135 	return result;
   136     }
   137 }
   139 uint32_t xlat_get_block_size( void *block )
   140 {
   141     xlat_cache_block_t xlt = (xlat_cache_block_t)(((char *)block)-sizeof(struct xlat_cache_block));
   142     return xlt->size;
   143 }
   145 /**
   146  * Cut the specified block so that it has the given size, with the remaining data
   147  * forming a new free block. If the free block would be less than the minimum size,
   148  * the cut is not performed.
   149  * @return the next block after the (possibly cut) block.
   150  */
   151 static inline xlat_cache_block_t xlat_cut_block( xlat_cache_block_t block, int cutsize )
   152 {
   153     if( block->size > cutsize + MIN_TOTAL_SIZE ) {
   154 	int oldsize = block->size;
   155 	block->size = cutsize;
   156 	xlat_cache_block_t next = NEXT(block);
   157 	next->active = 0;
   158 	next->size = oldsize - cutsize - sizeof(struct xlat_cache_block);
   159 	return next;
   160     } else {
   161 	return NEXT(block);
   162     }
   163 }
   165 /**
   166  * Promote a block in temp space (or elsewhere for that matter) to old space.
   167  *
   168  * @param block to promote.
   169  */
   170 static void xlat_promote_to_old_space( xlat_cache_block_t block )
   171 {
   172     int allocation = -sizeof(struct xlat_cache_block);
   173     int size = block->size;
   174     xlat_cache_block_t curr = xlat_old_cache_ptr;
   175     xlat_cache_block_t start_block = curr;
   176     do {
   177 	allocation += curr->size + sizeof(struct xlat_cache_block);
   178 	curr = NEXT(curr);
   179 	if( allocation > size ) {
   180 	    break; /* done */
   181 	}
   182 	if( curr->size == 0 ) { /* End-of-cache Sentinel */
   183 	    /* Leave what we just released as free space and start again from the
   184 	     * top of the cache
   185 	     */
   186 	    start_block->active = 0;
   187 	    start_block->size = allocation;
   188 	    allocation = -sizeof(struct xlat_cache_block);
   189 	    start_block = curr = xlat_old_cache;
   190 	}
   191     } while(1);
   192     start_block->active = 1;
   193     start_block->size = allocation;
   194     start_block->lut_entry = block->lut_entry;
   195     *block->lut_entry = &start_block->code;
   196     memcpy( start_block->code, block->code, block->size );
   197     xlat_old_cache_ptr = xlat_cut_block(start_block, size );
   198     if( xlat_old_cache_ptr->size == 0 ) {
   199 	xlat_old_cache_ptr = xlat_old_cache;
   200     }
   201 }
   203 /**
   204  * Similarly to the above method, promotes a block to temp space.
   205  * TODO: Try to combine these - they're nearly identical
   206  */
   207 void xlat_promote_to_temp_space( xlat_cache_block_t block )
   208 {
   209     int size = block->size;
   210     int allocation = -sizeof(struct xlat_cache_block);
   211     xlat_cache_block_t curr = xlat_temp_cache_ptr;
   212     xlat_cache_block_t start_block = curr;
   213     do {
   214 	if( curr->active == BLOCK_USED ) {
   215 	    xlat_promote_to_old_space( curr );
   216 	}
   217 	allocation += curr->size + sizeof(struct xlat_cache_block);
   218 	curr = NEXT(curr);
   219 	if( allocation > size ) {
   220 	    break; /* done */
   221 	}
   222 	if( curr->size == 0 ) { /* End-of-cache Sentinel */
   223 	    /* Leave what we just released as free space and start again from the
   224 	     * top of the cache
   225 	     */
   226 	    start_block->active = 0;
   227 	    start_block->size = allocation;
   228 	    allocation = -sizeof(struct xlat_cache_block);
   229 	    start_block = curr = xlat_temp_cache;
   230 	}
   231     } while(1);
   232     start_block->active = 1;
   233     start_block->size = allocation;
   234     start_block->lut_entry = block->lut_entry;
   235     *block->lut_entry = &start_block->code;
   236     memcpy( start_block->code, block->code, block->size );
   237     xlat_temp_cache_ptr = xlat_cut_block(start_block, size );
   238     if( xlat_temp_cache_ptr->size == 0 ) {
   239 	xlat_temp_cache_ptr = xlat_temp_cache;
   240     }
   242 }
   244 /**
   245  * Returns the next block in the new cache list that can be written to by the
   246  * translator. If the next block is active, it is evicted first.
   247  */
   248 xlat_cache_block_t xlat_start_block( sh4addr_t address )
   249 {
   250     if( xlat_new_cache_ptr->size == 0 ) {
   251 	xlat_new_cache_ptr = xlat_new_cache;
   252     }
   254     if( xlat_new_cache_ptr->active ) {
   255 	xlat_promote_to_temp_space( xlat_new_cache_ptr );
   256     }
   257     xlat_new_create_ptr = xlat_new_cache_ptr;
   258     xlat_new_create_ptr->active = 1;
   259     xlat_new_cache_ptr = NEXT(xlat_new_cache_ptr);
   261     /* Add the LUT entry for the block */
   262     if( xlat_lut[XLAT_LUT_PAGE(address)] == NULL ) {
   263 	xlat_lut[XLAT_LUT_PAGE(address)] =
   264 	    mmap( NULL, XLAT_LUT_PAGE_SIZE, PROT_READ|PROT_WRITE,
   265 		  MAP_PRIVATE|MAP_ANONYMOUS, -1, 0 );
   266 	memset( xlat_lut[XLAT_LUT_PAGE(address)], 0, XLAT_LUT_PAGE_SIZE );
   267     }
   269     if( IS_ENTRY_POINT(xlat_lut[XLAT_LUT_PAGE(address)][XLAT_LUT_ENTRY(address)]) ) {
   270 	xlat_cache_block_t oldblock = BLOCK_FOR_CODE(xlat_lut[XLAT_LUT_PAGE(address)][XLAT_LUT_ENTRY(address)]);
   271 	oldblock->active = 0;
   272     }
   274     xlat_lut[XLAT_LUT_PAGE(address)][XLAT_LUT_ENTRY(address)] = 
   275 	&xlat_new_create_ptr->code;
   276     xlat_new_create_ptr->lut_entry = xlat_lut[XLAT_LUT_PAGE(address)] + XLAT_LUT_ENTRY(address);
   278     return xlat_new_create_ptr;
   279 }
   281 xlat_cache_block_t xlat_extend_block()
   282 {
   283     if( xlat_new_cache_ptr->size == 0 ) {
   284 	/* Migrate to the front of the cache to keep it contiguous */
   285 	xlat_new_create_ptr->active = 0;
   286 	char *olddata = xlat_new_create_ptr->code;
   287 	int oldsize = xlat_new_create_ptr->size;
   288 	int size = oldsize + MIN_BLOCK_SIZE; /* minimum expansion */
   289 	void **lut_entry = xlat_new_create_ptr->lut_entry;
   290 	int allocation = -sizeof(struct xlat_cache_block);
   291 	xlat_new_cache_ptr = xlat_new_cache;
   292 	do {
   293 	    if( xlat_new_cache_ptr->active ) {
   294 		xlat_promote_to_temp_space( xlat_new_cache_ptr );
   295 	    }
   296 	    allocation += xlat_new_cache_ptr->size + sizeof(struct xlat_cache_block);
   297 	    xlat_new_cache_ptr = NEXT(xlat_new_cache_ptr);
   298 	} while( allocation < size );
   299 	xlat_new_create_ptr = xlat_new_cache;
   300 	xlat_new_create_ptr->active = 1;
   301 	xlat_new_create_ptr->size = allocation;
   302 	xlat_new_create_ptr->lut_entry = lut_entry;
   303 	*lut_entry = &xlat_new_create_ptr->code;
   304 	memmove( xlat_new_create_ptr->code, olddata, oldsize );
   305     } else {
   306 	if( xlat_new_cache_ptr->active ) {
   307 	    xlat_promote_to_temp_space( xlat_new_cache_ptr );
   308 	}
   309 	xlat_new_create_ptr->size += xlat_new_cache_ptr->size + sizeof(struct xlat_cache_block);
   310 	xlat_new_cache_ptr = NEXT(xlat_new_cache_ptr);
   311     }
   312     return xlat_new_create_ptr;
   314 }
   316 void xlat_commit_block( uint32_t destsize, uint32_t srcsize )
   317 {
   318     void **ptr = xlat_new_create_ptr->lut_entry;
   319     void **endptr = ptr + (srcsize>>2);
   320     while( ptr < endptr ) {
   321 	if( *ptr == NULL ) {
   322 	    *ptr = XLAT_LUT_ENTRY_USED;
   323 	}
   324 	ptr++;
   325     }
   327     xlat_new_cache_ptr = xlat_cut_block( xlat_new_create_ptr, destsize );
   328 }
   330 void xlat_delete_block( xlat_cache_block_t block ) 
   331 {
   332     block->active = 0;
   333     *block->lut_entry = NULL;
   334 }
   336 void xlat_check_cache_integrity( xlat_cache_block_t cache, xlat_cache_block_t ptr, int size )
   337 {
   338     int foundptr = 0;
   339     xlat_cache_block_t tail = 
   340 	(xlat_cache_block_t)(((char *)cache) + size - sizeof(struct xlat_cache_block));
   342     assert( tail->active == 1 );
   343     assert( tail->size == 0 ); 
   344     while( cache < tail ) {
   345 	assert( cache->active >= 0 && cache->active <= 2 );
   346 	assert( cache->size >= 0 && cache->size < size );
   347 	if( cache == ptr ) {
   348 	    foundptr = 1;
   349 	}
   350 	cache = NEXT(cache);
   351     }
   352     assert( cache == tail );
   353     assert( foundptr == 1 );
   354 }
   356 void xlat_check_integrity( )
   357 {
   358     xlat_check_cache_integrity( xlat_new_cache, xlat_new_cache_ptr, XLAT_NEW_CACHE_SIZE );
   359     xlat_check_cache_integrity( xlat_temp_cache, xlat_temp_cache_ptr, XLAT_TEMP_CACHE_SIZE );
   360     xlat_check_cache_integrity( xlat_old_cache, xlat_old_cache_ptr, XLAT_OLD_CACHE_SIZE );
   361 }
   364 void xlat_disasm_block( FILE *out, void *block )
   365 {
   366     uint32_t buflen = xlat_get_block_size(block);
   367     x86_set_symtab( NULL, 0 );
   368     x86_disasm_block( out, block, buflen );
   369 }
.