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
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
|
////////////////////////////////////////////////////////////////////////////////////////
//
// 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
//
////////////////////////////////////////////////////////////////////////////////////////
namespace Nes
{
namespace Core
{
namespace Sound
{
void Buffer::operator >> (Block& block)
{
NST_ASSERT( block.length );
const uint delta = (dword(pos) + SIZE - start) & MASK;
block.data = output;
block.start = start;
if (block.length > delta)
block.length = delta;
start = (start + block.length) & MASK;
if (start == pos)
{
start = 0;
pos = 0;
}
}
inline Buffer::Block::Block(uint l)
: length(l) {}
template<typename T>
inline Buffer::BaseRenderer<T>::BaseRenderer(void* samples,uint length)
:
dst (static_cast<T*>(samples)),
end (static_cast<const T*>(samples) + length)
{}
template<typename T>
inline bool Buffer::BaseRenderer<T>::operator !() const
{
return dst == end;
}
template<typename T>
inline void Buffer::History::operator >> (T& sample) const
{
sample = buffer[pos & MASK];
}
inline void Buffer::History::operator << (Sample sample)
{
buffer[pos++ & MASK] = sample;
}
inline void Buffer::operator << (const Sample sample)
{
const uint p = pos;
pos = (pos + 1) & MASK;
output[p] = sample;
}
inline Buffer::Renderer<iword,0U>::Renderer(void* samples,uint length,const History&)
: BaseRenderer<iword>(samples,length) {}
inline void Buffer::Renderer<iword,0U>::operator << (Sample sample)
{
*dst++ = sample;
}
NST_FORCE_INLINE bool Buffer::Renderer<iword,0U>::operator << (const Block& block)
{
NST_ASSERT( end - dst >= block.length );
if (block.length)
{
if (block.start + block.length <= SIZE)
{
std::memcpy( dst, block.data + block.start, sizeof(iword) * block.length );
}
else
{
const uint chunk = SIZE - block.start;
std::memcpy( dst, block.data + block.start, sizeof(iword) * chunk );
std::memcpy( dst + chunk, block.data, sizeof(iword) * ((block.start + block.length) - SIZE) );
}
dst += block.length;
}
return dst != end;
}
inline Buffer::Renderer<iword,1U>::Renderer(void* samples,uint length,History& h)
: BaseRenderer<iword>(samples,length << 1), history(h) {}
inline void Buffer::Renderer<iword,1U>::operator << (Sample sample)
{
history >> dst[0];
history << sample;
dst[1] = sample;
dst += 2;
}
NST_FORCE_INLINE bool Buffer::Renderer<iword,1U>::operator << (Block& block)
{
NST_ASSERT( end - dst >= block.length );
block.length += block.start;
for (uint i=block.start; i < block.length; ++i)
(*this) << Sample( block.data[i & MASK] );
return dst != end;
}
inline Buffer::Renderer<byte,0U>::Renderer(void* samples,uint length,const History&)
: BaseRenderer<byte>(samples,length) {}
inline void Buffer::Renderer<byte,0U>::operator << (Sample sample)
{
*dst++ = dword(sample + 32768L) >> 8;
}
NST_FORCE_INLINE bool Buffer::Renderer<byte,0U>::operator << (Block& block)
{
NST_ASSERT( end - dst >= block.length );
block.length += block.start;
for (uint i=block.start; i < block.length; ++i)
(*this) << Sample( block.data[i & MASK] );
return dst != end;
}
inline Buffer::Renderer<byte,1U>::Renderer(void* samples,uint length,History& h)
: BaseRenderer<byte>(samples,length << 1), history(h) {}
inline void Buffer::Renderer<byte,1U>::operator << (Sample sample)
{
history >> dst[0];
sample = dword(sample + 32768L) >> 8;
history << sample;
dst[1] = sample;
dst += 2;
}
NST_FORCE_INLINE bool Buffer::Renderer<byte,1U>::operator << (Block& block)
{
NST_ASSERT( end - dst >= block.length );
block.length += block.start;
for (uint i=block.start; i < block.length; ++i)
(*this) << Sample( block.data[i & MASK] );
return dst != end;
}
}
}
}
|
