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