1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
|
////////////////////////////////////////////////////////////////////////////////////////
//
// Nestopia - NES/Famicom emulator written in C++
//
// Copyright (C) 2003-2008 Martin Freij
//
// This file is part of Nestopia.
//
// Nestopia is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// Nestopia is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with Nestopia; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
//
////////////////////////////////////////////////////////////////////////////////////////
#include "NstBoard.hpp"
#include "NstBoardMmc3.hpp"
#include "NstBoardUnlA9746.hpp"
namespace Nes
{
namespace Core
{
namespace Boards
{
namespace Unlicensed
{
#ifdef NST_MSVC_OPTIMIZE
#pragma optimize("s", on)
#endif
void A9746::SubReset(const bool hard)
{
exRegs[0] = 0;
exRegs[1] = 0;
exRegs[2] = 0;
Mmc3::SubReset( hard );
for (uint i=0x8000; i < 0xA000; i += 0x4)
{
Map( i + 0x0, &A9746::Poke_8000 );
Map( i + 0x1, &A9746::Poke_8001 );
Map( i + 0x2, &A9746::Poke_8002 );
Map( i + 0x3, NOP_POKE );
}
}
void A9746::SubLoad(State::Loader& state,const dword baseChunk)
{
if (baseChunk == AsciiId<'A','9','7'>::V)
{
while (const dword chunk = state.Begin())
{
if (chunk == AsciiId<'R','E','G'>::V)
{
State::Loader::Data<3> data( state );
exRegs[0] = data[0];
exRegs[1] = data[1];
exRegs[2] = data[2] << 4;
}
state.End();
}
}
else
{
Mmc3::SubLoad( state, baseChunk );
}
}
void A9746::SubSave(State::Saver& state) const
{
Mmc3::SubSave( state );
const byte data[] =
{
exRegs[0], exRegs[1], exRegs[2] >> 4
};
state.Begin( AsciiId<'A','9','7'>::V ).Begin( AsciiId<'R','E','G'>::V ).Write( data ).End().End();
}
#ifdef NST_MSVC_OPTIMIZE
#pragma optimize("", on)
#endif
NES_POKE_AD(A9746,8000)
{
exRegs[0] = 0;
exRegs[1] = data;
}
NES_POKE_D(A9746,8001)
{
ppu.Update();
if (exRegs[0] - 0x23 < 4)
{
prg.SwapBank<SIZE_8K>
(
(exRegs[0] - 0x23) << 13 ^ 0x6000,
(data >> 5 & 0x1) |
(data >> 3 & 0x2) |
(data >> 1 & 0x4) |
(data << 1 & 0x8)
);
}
switch (exRegs[1])
{
case 0x08:
case 0x0A:
case 0x0E:
case 0x12:
case 0x16:
case 0x1A:
case 0x1E: exRegs[2] = data << 4; break;
case 0x09: chr.SwapBank<SIZE_1K,0x0000>( exRegs[2] | (data >> 1 & 0xE) ); break;
case 0x0B: chr.SwapBank<SIZE_1K,0x0400>( exRegs[2] | (data >> 1 | 0x1) ); break;
case 0x0C:
case 0x0D: chr.SwapBank<SIZE_1K,0x0800>( exRegs[2] | (data >> 1 & 0xE) ); break;
case 0x0F: chr.SwapBank<SIZE_1K,0x0C00>( exRegs[2] | (data >> 1 | 0x1) ); break;
case 0x10:
case 0x11: chr.SwapBank<SIZE_1K,0x1000>( exRegs[2] | (data >> 1 & 0xF) ); break;
case 0x14:
case 0x15: chr.SwapBank<SIZE_1K,0x1400>( exRegs[2] | (data >> 1 & 0xF) ); break;
case 0x18:
case 0x19: chr.SwapBank<SIZE_1K,0x1800>( exRegs[2] | (data >> 1 & 0xF) ); break;
case 0x1C:
case 0x1D: chr.SwapBank<SIZE_1K,0x1C00>( exRegs[2] | (data >> 1 & 0xF) ); break;
}
}
NES_POKE_AD(A9746,8002)
{
exRegs[0] = data;
exRegs[1] = 0;
}
}
}
}
}
|
