File: NstBoardUnlFam250Schi24.cpp

package info (click to toggle)
nestopia 1.53.1%2Bdfsg-2
  • links: PTS, VCS
  • area: main
  • in suites: trixie
  • size: 12,416 kB
  • sloc: cpp: 130,178; xml: 27,245; ansic: 4,053; makefile: 964; sh: 19
file content (121 lines) | stat: -rw-r--r-- 3,530 bytes parent folder | download | duplicates (2)
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
////////////////////////////////////////////////////////////////////////////////////////
//
// Nestopia - NES/Famicom emulator written in C++
//
// Copyright (C) 2003-2008 Martin Freij
// Copyright (C) 2020-2024 Rupert Carmichael
//
// 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
//
////////////////////////////////////////////////////////////////////////////////////////

// Reference: https://github.com/TASEmulators/fceux/blob/master/src/boards/354.cpp

#include "NstBoard.hpp"
#include "NstBoardUnlFam250Schi24.hpp"

namespace Nes
{
	namespace Core
	{
		namespace Boards
		{
			namespace Unlicensed
			{
				#ifdef NST_MSVC_OPTIMIZE
				#pragma optimize("s", on)
				#endif

				void Fam250Schi24::SubReset(bool)
				{
					bankreg = 0;
					Map( 0x6000U, 0x7FFFU, &Fam250Schi24::Peek_6000 );
					Map( submapper == 1 ? 0xE000U : 0xF000U, 0xFFFFU, &Fam250Schi24::Poke_F000 );

					prg.SwapBank<SIZE_32K,0x0000>(0);
				}

				void Fam250Schi24::SubLoad(State::Loader& state,const dword baseChunk)
				{
					NST_VERIFY( (baseChunk == AsciiId<'F','S','C'>::V) );

					if (baseChunk == AsciiId<'F','S','C'>::V)
					{
						while (const dword chunk = state.Begin())
						{
							if (chunk == AsciiId<'R','E','G'>::V)
								bankreg = state.Read8();

							state.End();
						}
					}
				}

				void Fam250Schi24::SubSave(State::Saver& state) const
				{
					state.Begin( AsciiId<'F','S','C'>::V ).Begin( AsciiId<'R','E','G'>::V ).Write8( bankreg ).End().End();
				}

				#ifdef NST_MSVC_OPTIMIZE
				#pragma optimize("", on)
				#endif

				NES_PEEK_A(Fam250Schi24,6000)
				{
					return *(prg.Source().Mem(bankreg * SIZE_8K) + (address & 0x1FFF));
				}

				NES_POKE_AD(Fam250Schi24,F000)
				{
					const uint bank = (data & 0x3F) | ((address << 2) & 0x40) | ((address >> 5) & 0x80);

					ppu.SetMirroring( (data & 0x40) ? Ppu::NMT_H : Ppu::NMT_V );
					chr.Source().WriteEnable( !(address & 0x08) );

					switch (address & 0x07)
					{
						case 0: case 4:
							prg.SwapBank<SIZE_32K,0x0000>(bank >> 1);
							break;

						case 1:
							prg.SwapBank<SIZE_16K,0x0000>(bank);
							prg.SwapBank<SIZE_16K,0x4000>(bank | 0x07);
							break;

						case 2: case 6:
							prg.SwapBank<SIZE_8K,0x0000>(bank << 1 | data >> 7);
							prg.SwapBank<SIZE_8K,0x2000>(bank << 1 | data >> 7);
							prg.SwapBank<SIZE_8K,0x4000>(bank << 1 | data >> 7);
							prg.SwapBank<SIZE_8K,0x6000>(bank << 1 | data >> 7);
							break;

						case 3: case 7:
							prg.SwapBank<SIZE_16K,0x0000>(bank);
							prg.SwapBank<SIZE_16K,0x4000>(bank);
							break;

						case 5:
							bankreg = bank << 1 | data >> 7;
							prg.SwapBank<SIZE_32K,0x0000>(bank >> 1 | 0x03);
							break;
					}
				}
			}
		}
	}
}