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
|
////////////////////////////////////////////////////////////////////////////////////////
//
// 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
//
////////////////////////////////////////////////////////////////////////////////////////
#ifndef NST_IO_MAP_H
#define NST_IO_MAP_H
#include "NstIoPort.hpp"
#ifdef NST_PRAGMA_ONCE
#pragma once
#endif
namespace Nes
{
namespace Core
{
namespace Io
{
template<dword N> class Map
{
public:
enum
{
SIZE = N,
OVERFLOW_SIZE = 0x100,
FULL_SIZE = SIZE + OVERFLOW_SIZE
};
protected:
Port ports[FULL_SIZE];
public:
class Section
{
Port* NST_RESTRICT port;
const Port* const end;
public:
Section(Port* b,const Port* e)
: port(b), end(e) {}
template<typename A,typename B,typename C>
void Set(A a,B b,C c)
{
do
{
port->Set( a, b, c );
}
while (++port != end);
}
template<typename A,typename B>
void Set(A a,B b)
{
do
{
port->Set( a, b );
}
while (++port != end);
}
template<typename A>
void Set(A a)
{
do
{
port->Set( a );
}
while (++port != end);
}
};
template<typename A,typename B,typename C>
Map(A a,B b,C c)
{
for (dword i=SIZE; i < FULL_SIZE; ++i)
ports[i].Set( a, b, c );
}
const Port& operator [] (Address address) const
{
NST_ASSERT( address < FULL_SIZE );
return ports[address];
}
Port& operator () (Address address)
{
NST_ASSERT( address < FULL_SIZE );
return ports[address];
}
Section operator () (Address first,Address last)
{
NST_ASSERT( first <= last && last < SIZE );
return Section( ports + first, ports + last + 1 );
}
};
}
}
}
#endif
|
