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