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
|
////////////////////////////////////////////////////////////////////////////////////////
//
// 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 "NstBoardTxc.hpp"
namespace Nes
{
namespace Core
{
namespace Boards
{
namespace Txc
{
#ifdef NST_MSVC_OPTIMIZE
#pragma optimize("s", on)
#endif
void T22211A::SubReset(const bool hard)
{
Map( 0x4100U, &T22211A::Peek_4100 );
Map( 0x4100U, 0x4103U, &T22211A::Poke_4100 );
Map( 0x8000U, 0xFFFFU, &T22211A::Poke_8000 );
if (hard)
{
for (uint i=0; i < 4; ++i)
regs[i] = 0;
prg.SwapBank<SIZE_32K,0x0000>(0);
}
}
void T22211B::SubReset(const bool hard)
{
T22211A::SubReset( hard );
Map( 0x8000U, 0xFFFFU, &T22211B::Poke_8000 );
}
void T22211C::SubReset(const bool hard)
{
T22211A::SubReset( hard );
Map( 0x4100U, &T22211C::Peek_4100 );
}
void T22211A::SubLoad(State::Loader& state,const dword baseChunk)
{
NST_VERIFY( baseChunk == (AsciiId<'T','2','1'>::V) );
if (baseChunk == AsciiId<'T','2','1'>::V)
{
while (const dword chunk = state.Begin())
{
if (chunk == AsciiId<'R','E','G'>::V)
state.Read( regs );
state.End();
}
}
}
void T22211A::SubSave(State::Saver& state) const
{
state.Begin( AsciiId<'T','2','1'>::V ).Begin( AsciiId<'R','E','G'>::V ).Write( regs ).End().End();
}
#ifdef NST_MSVC_OPTIMIZE
#pragma optimize("", on)
#endif
NES_PEEK(T22211A,4100)
{
return (uint(regs[1]) ^ regs[2]) | 0x40;
}
NES_PEEK(T22211C,4100)
{
return (uint(regs[1]) ^ regs[2]) | 0x41;
}
NES_POKE_AD(T22211A,4100)
{
regs[address & 0x3] = data;
}
NES_POKE(T22211A,8000)
{
ppu.Update();
prg.SwapBank<SIZE_32K,0x0000>( regs[2] >> 2 );
chr.SwapBank<SIZE_8K,0x0000>( regs[2] );
}
NES_POKE_D(T22211B,8000)
{
ppu.Update();
prg.SwapBank<SIZE_32K,0x0000>( regs[2] >> 2 );
chr.SwapBank<SIZE_8K,0x0000>( ((data^regs[2]) >> 3 & 0x2) | ((data^regs[2]) >> 5 & 0x1) );
}
}
}
}
}
|
