Search
lxdream.org :: lxdream/src/sh4/sh4trans.c
lxdream 0.9.1
released Jun 29
Download Now
filename src/sh4/sh4trans.c
changeset 368:36fac4c42322
prev359:c588dce7ebde
next390:d066209999f1
author nkeynes
date Wed Sep 12 09:20:38 2007 +0000 (16 years ago)
permissions -rw-r--r--
last change Start splitting the common SH4 parts into sh4.c, with sh4core.c to become
just the emulation core.
view annotate diff log raw
     1 /**
     2  * $Id: sh4trans.c,v 1.2 2007-09-04 08:40:23 nkeynes Exp $
     3  * 
     4  * SH4 translation core module. This part handles the non-target-specific
     5  * section of the translation.
     6  *
     7  * Copyright (c) 2005 Nathan Keynes.
     8  *
     9  * This program is free software; you can redistribute it and/or modify
    10  * it under the terms of the GNU General Public License as published by
    11  * the Free Software Foundation; either version 2 of the License, or
    12  * (at your option) any later version.
    13  *
    14  * This program is distributed in the hope that it will be useful,
    15  * but WITHOUT ANY WARRANTY; without even the implied warranty of
    16  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    17  * GNU General Public License for more details.
    18  */
    20 #include "sh4core.h"
    21 #include "sh4trans.h"
    22 #include "xltcache.h"
    24 /**
    25  * Execute a timeslice using translated code only (ie translate/execute loop)
    26  * Note this version does not support breakpoints
    27  */
    28 uint32_t sh4_xlat_run_slice( uint32_t nanosecs ) 
    29 {
    30     int i;
    31     sh4r.slice_cycle = 0;
    33     if( sh4r.sh4_state != SH4_STATE_RUNNING ) {
    34 	if( sh4r.event_pending < nanosecs ) {
    35 	    sh4r.sh4_state = SH4_STATE_RUNNING;
    36 	    sh4r.slice_cycle = sh4r.event_pending;
    37 	}
    38     }
    40     while( sh4r.slice_cycle < nanosecs ) {
    41 	if( SH4_EVENT_PENDING() ) {
    42 	    if( sh4r.event_types & PENDING_EVENT ) {
    43 		event_execute();
    44 	    }
    45 	    /* Eventq execute may (quite likely) deliver an immediate IRQ */
    46 	    if( sh4r.event_types & PENDING_IRQ ) {
    47 		sh4_accept_interrupt();
    48 	    }
    49 	}
    51 	gboolean (*code)() = xlat_get_code(sh4r.pc);
    52 	if( code == NULL ) {
    53 	    code = sh4_translate_basic_block( sh4r.pc );
    54 	}
    55 	if( !code() )
    56 	    break;
    57     }
    59     /* If we aborted early, but the cpu is still technically running,
    60      * we're doing a hard abort - cut the timeslice back to what we
    61      * actually executed
    62      */
    63     if( sh4r.slice_cycle < nanosecs && sh4r.sh4_state == SH4_STATE_RUNNING ) {
    64 	nanosecs = sh4r.slice_cycle;
    65     }
    66     if( sh4r.sh4_state != SH4_STATE_STANDBY ) {
    67 	TMU_run_slice( nanosecs );
    68 	SCIF_run_slice( nanosecs );
    69     }
    70     return nanosecs;
    71 }
    73 uint8_t *xlat_output;
    75 /**
    76  * Translate a linear basic block, ie all instructions from the start address
    77  * (inclusive) until the next branch/jump instruction or the end of the page
    78  * is reached.
    79  * @return the address of the translated block
    80  * eg due to lack of buffer space.
    81  */
    82 void * sh4_translate_basic_block( sh4addr_t start )
    83 {
    84     uint32_t pc = start;
    85     int done;
    86     xlat_cache_block_t block = xlat_start_block( start );
    87     xlat_output = (uint8_t *)block->code;
    88     uint8_t *eob = xlat_output + block->size;
    89     sh4_translate_begin_block();
    91     while( (done = sh4_x86_translate_instruction( pc )) == 0 ) {
    92 	if( eob - xlat_output < MAX_INSTRUCTION_SIZE ) {
    93 	    uint8_t *oldstart = block->code;
    94 	    block = xlat_extend_block();
    95 	    xlat_output = block->code + (xlat_output - oldstart);
    96 	    eob = block->code + block->size;
    97 	}
    98 	pc += 2;
    99     }
   100     sh4_translate_end_block(pc);
   101     xlat_commit_block( xlat_output - block->code, pc-start );
   102     return block->code;
   103 }
.