Search
lxdream.org :: lxdream/src/sh4/intc.c
lxdream 0.9.1
released Jun 29
Download Now
filename src/sh4/intc.c
changeset 157:fbe03268ad8a
prev114:1cc849575bc7
next265:5daf59b7f31b
author nkeynes
date Thu Jun 15 10:27:10 2006 +0000 (14 years ago)
permissions -rw-r--r--
last change Add preliminary call-stack tracing ability
Fix INTC state save/load/reset
file annotate diff log raw
nkeynes@31
     1
/**
nkeynes@157
     2
 * $Id: intc.c,v 1.6 2006-06-15 10:27:10 nkeynes Exp $
nkeynes@31
     3
 *
nkeynes@31
     4
 * SH4 onboard interrupt controller (INTC) implementation
nkeynes@31
     5
 *
nkeynes@31
     6
 * Copyright (c) 2005 Nathan Keynes.
nkeynes@31
     7
 *
nkeynes@31
     8
 * This program is free software; you can redistribute it and/or modify
nkeynes@31
     9
 * it under the terms of the GNU General Public License as published by
nkeynes@31
    10
 * the Free Software Foundation; either version 2 of the License, or
nkeynes@31
    11
 * (at your option) any later version.
nkeynes@31
    12
 *
nkeynes@31
    13
 * This program is distributed in the hope that it will be useful,
nkeynes@31
    14
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
nkeynes@31
    15
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
nkeynes@31
    16
 * GNU General Public License for more details.
nkeynes@31
    17
 */
nkeynes@31
    18
nkeynes@1
    19
#include <assert.h>
nkeynes@1
    20
#include "sh4mmio.h"
nkeynes@1
    21
#include "sh4core.h"
nkeynes@1
    22
#include "intc.h"
nkeynes@1
    23
nkeynes@1
    24
struct intc_sources_t {
nkeynes@1
    25
    char *name;
nkeynes@1
    26
    uint32_t code;
nkeynes@157
    27
} intc_sources[INT_NUM_SOURCES] = {
nkeynes@157
    28
    { "IRQ0", 0x200 },  { "IRQ1", 0x220 },  { "IRQ2", 0x240 },
nkeynes@157
    29
    { "IRQ3", 0x260 },  { "IRQ4", 0x280 },  { "IRQ5", 0x2A0 },
nkeynes@157
    30
    { "IRQ6", 0x2C0 },  { "IRQ7", 0x2E0 },  { "IRQ8", 0x300 },
nkeynes@157
    31
    { "IRQ9", 0x320 },  { "IRQ10",0x340 },  { "IRQ11",0x360 },
nkeynes@157
    32
    { "IRQ12",0x380 },  { "IRQ13",0x3A0 },  { "IRQ14",0x3C0 },
nkeynes@157
    33
    { "NMI", 0x1C0 },   { "H-UDI",0x600 },  { "GPIOI",0x620 },
nkeynes@157
    34
    { "DMTE0",0x640 },  { "DMTE1",0x660 },  { "DMTE2",0x680 },
nkeynes@157
    35
    { "DMTE3",0x6A0 },  { "DMTAE",0x6C0 },  { "TUNI0",0x400 },
nkeynes@157
    36
    { "TUNI1",0x420 },  { "TUNI2",0x440 },  { "TICPI2",0x460 },
nkeynes@157
    37
    { "RTC_ATI",0x480 },{ "RTC_PRI",0x4A0 },{ "RTC_CUI",0x4C0 },
nkeynes@157
    38
    { "SCI_ERI",0x4E0 },{ "SCI_RXI",0x500 },{ "SCI_TXI",0x520 },
nkeynes@157
    39
    { "SCI_TEI",0x540 },
nkeynes@157
    40
    { "SCIF_ERI",0x700 },{ "SCIF_RXI",0x720, 0 },{ "SCIF_BRI",0x740 },
nkeynes@157
    41
    { "SCIF_TXI",0x760 },
nkeynes@157
    42
    { "WDT_ITI",0x560 },{ "RCMI",0x580 },   { "ROVI",0x5A0 } };
nkeynes@1
    43
nkeynes@157
    44
static int intc_default_priority[INT_NUM_SOURCES] = { 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 16 };
nkeynes@157
    45
nkeynes@157
    46
#define PRIORITY(which) intc_state.priority[which]
nkeynes@1
    47
#define INTCODE(which) intc_sources[which].code
nkeynes@1
    48
nkeynes@157
    49
static struct intc_state {
nkeynes@157
    50
    int num_pending;
nkeynes@157
    51
    int pending[INT_NUM_SOURCES];
nkeynes@157
    52
    int priority[INT_NUM_SOURCES];
nkeynes@157
    53
} intc_state;
nkeynes@1
    54
nkeynes@1
    55
void mmio_region_INTC_write( uint32_t reg, uint32_t val )
nkeynes@1
    56
{
nkeynes@1
    57
    /* Well it saves having to use an intermediate table... */
nkeynes@1
    58
    switch( reg ) {
nkeynes@1
    59
        case ICR: /* care about this later */
nkeynes@1
    60
            break;
nkeynes@1
    61
        case IPRA:
nkeynes@1
    62
            PRIORITY(INT_TMU_TUNI0) = (val>>12)&0x000F;
nkeynes@1
    63
            PRIORITY(INT_TMU_TUNI1) = (val>>8)&0x000F;
nkeynes@1
    64
            PRIORITY(INT_TMU_TUNI2) =
nkeynes@1
    65
                PRIORITY(INT_TMU_TICPI2) = (val>>4)&0x000F;
nkeynes@1
    66
            PRIORITY(INT_RTC_ATI) =
nkeynes@1
    67
                PRIORITY(INT_RTC_PRI) =
nkeynes@1
    68
                PRIORITY(INT_RTC_CUI) = val&0x000F;
nkeynes@1
    69
            break;
nkeynes@1
    70
        case IPRB:
nkeynes@1
    71
            PRIORITY(INT_WDT_ITI) = (val>>12)&0x000F;
nkeynes@1
    72
            PRIORITY(INT_REF_RCMI) =
nkeynes@1
    73
                PRIORITY(INT_REF_ROVI) = (val>>8)&0x000F;
nkeynes@1
    74
            PRIORITY(INT_SCI_ERI) =
nkeynes@1
    75
                PRIORITY(INT_SCI_RXI) =
nkeynes@1
    76
                PRIORITY(INT_SCI_TXI) =
nkeynes@1
    77
                PRIORITY(INT_SCI_TEI) = (val>>4)&0x000F;
nkeynes@1
    78
            /* Bits 0-3 reserved */
nkeynes@1
    79
            break;
nkeynes@1
    80
        case IPRC:
nkeynes@1
    81
            PRIORITY(INT_GPIO) = (val>>12)&0x000F;
nkeynes@1
    82
            PRIORITY(INT_DMA_DMTE0) =
nkeynes@1
    83
                PRIORITY(INT_DMA_DMTE1) =
nkeynes@1
    84
                PRIORITY(INT_DMA_DMTE2) =
nkeynes@1
    85
                PRIORITY(INT_DMA_DMTE3) =
nkeynes@1
    86
                PRIORITY(INT_DMA_DMAE) = (val>>8)&0x000F;
nkeynes@1
    87
            PRIORITY(INT_SCIF_ERI) =
nkeynes@1
    88
                PRIORITY(INT_SCIF_RXI) =
nkeynes@1
    89
                PRIORITY(INT_SCIF_BRI) =
nkeynes@1
    90
                PRIORITY(INT_SCIF_TXI) = (val>>4)&0x000F;
nkeynes@1
    91
            PRIORITY(INT_HUDI) = val&0x000F;
nkeynes@1
    92
            break;
nkeynes@1
    93
    }
nkeynes@1
    94
    MMIO_WRITE( INTC, reg, val );
nkeynes@1
    95
}
nkeynes@1
    96
nkeynes@1
    97
int32_t mmio_region_INTC_read( uint32_t reg )
nkeynes@1
    98
{
nkeynes@1
    99
    return MMIO_READ( INTC, reg );
nkeynes@1
   100
}
nkeynes@157
   101
nkeynes@157
   102
void INTC_reset()
nkeynes@157
   103
{
nkeynes@157
   104
    int i;
nkeynes@157
   105
nkeynes@157
   106
    intc_state.num_pending = 0;
nkeynes@157
   107
    for( i=0; i<INT_NUM_SOURCES; i++ )
nkeynes@157
   108
	intc_state.priority[i] = intc_default_priority[i];
nkeynes@157
   109
    sh4r.int_pending = 0;
nkeynes@157
   110
}
nkeynes@157
   111
nkeynes@157
   112
nkeynes@157
   113
void INTC_save_state( FILE *f )
nkeynes@157
   114
{
nkeynes@157
   115
    fwrite( &intc_state, sizeof(intc_state), 1, f );
nkeynes@157
   116
}
nkeynes@157
   117
nkeynes@157
   118
int INTC_load_state( FILE *f )
nkeynes@157
   119
{
nkeynes@157
   120
    if( fread(&intc_state, sizeof(intc_state), 1, f) != 1 )
nkeynes@157
   121
	return -1;
nkeynes@157
   122
    return 0;
nkeynes@157
   123
}
nkeynes@157
   124
nkeynes@1
   125
/* We basically maintain a priority queue here, raise_interrupt adds an entry,
nkeynes@1
   126
 * accept_interrupt takes it off. At the moment this is does as a simple
nkeynes@1
   127
 * ordered array, on the basis that in practice there's unlikely to be more
nkeynes@1
   128
 * than one at a time. There are lots of ways to optimize this if it turns out
nkeynes@1
   129
 * to be necessary, but I'd doubt it will be...
nkeynes@1
   130
 */
nkeynes@1
   131
nkeynes@1
   132
void intc_raise_interrupt( int which )
nkeynes@1
   133
{
nkeynes@1
   134
    int i, j, pri;
nkeynes@1
   135
    
nkeynes@1
   136
    pri = PRIORITY(which);
nkeynes@1
   137
    if( pri == 0 ) return; /* masked off */
nkeynes@1
   138
    
nkeynes@157
   139
    for( i=0; i<intc_state.num_pending; i++ ) {
nkeynes@157
   140
        if( intc_state.pending[i] == which ) return; /* Don't queue more than once */
nkeynes@157
   141
        if( PRIORITY(intc_state.pending[i]) > pri ||
nkeynes@157
   142
            (PRIORITY(intc_state.pending[i]) == pri &&
nkeynes@157
   143
             intc_state.pending[i] < which))
nkeynes@1
   144
            break;
nkeynes@1
   145
    }
nkeynes@1
   146
    /* i == insertion point */
nkeynes@157
   147
    for( j=intc_state.num_pending; j > i; j-- )
nkeynes@157
   148
        intc_state.pending[j] = intc_state.pending[j-1];
nkeynes@157
   149
    intc_state.pending[i] = which;
nkeynes@1
   150
nkeynes@157
   151
    if( i == intc_state.num_pending && (sh4r.sr&SR_BL)==0 && SH4_INTMASK() < pri )
nkeynes@1
   152
        sh4r.int_pending = 1;
nkeynes@1
   153
nkeynes@157
   154
    intc_state.num_pending++;
nkeynes@1
   155
}
nkeynes@1
   156
nkeynes@19
   157
void intc_clear_interrupt( int which )
nkeynes@19
   158
{
nkeynes@20
   159
    int i;
nkeynes@157
   160
    for( i=intc_state.num_pending-1; i>=0; i-- ) {
nkeynes@157
   161
	if( intc_state.pending[i] == which ) {
nkeynes@20
   162
	    /* Shift array contents down */
nkeynes@157
   163
	    while( i < intc_state.num_pending-1 ) {
nkeynes@157
   164
		intc_state.pending[i] = intc_state.pending[++i];
nkeynes@20
   165
	    }
nkeynes@157
   166
	    intc_state.num_pending--;
nkeynes@114
   167
	    intc_mask_changed();
nkeynes@20
   168
	    break;
nkeynes@20
   169
	}
nkeynes@20
   170
    }
nkeynes@20
   171
    
nkeynes@19
   172
}
nkeynes@19
   173
nkeynes@1
   174
uint32_t intc_accept_interrupt( void )
nkeynes@1
   175
{
nkeynes@157
   176
    assert(intc_state.num_pending > 0);
nkeynes@157
   177
    return INTCODE(intc_state.pending[intc_state.num_pending-1]);
nkeynes@1
   178
}
nkeynes@1
   179
nkeynes@1
   180
void intc_mask_changed( void )
nkeynes@1
   181
{   
nkeynes@157
   182
    if( intc_state.num_pending > 0 && (sh4r.sr&SR_BL)==0 &&
nkeynes@157
   183
        SH4_INTMASK() < PRIORITY(intc_state.pending[intc_state.num_pending-1]) )
nkeynes@1
   184
        sh4r.int_pending = 1;
nkeynes@1
   185
    else sh4r.int_pending = 0;
nkeynes@1
   186
}
nkeynes@1
   187
    
nkeynes@1
   188
nkeynes@1
   189
char *intc_get_interrupt_name( int code )
nkeynes@1
   190
{
nkeynes@1
   191
    return intc_sources[code].name;
nkeynes@1
   192
}
.