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