Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
RishiRecon
GitHub Repository: RishiRecon/exploits
Path: blob/main/misc/emulator/xnes/snes9x/apu/hermite_resampler.h
28798 views
1
/* Simple resampler based on bsnes's ruby audio library */
2
3
#ifndef __HERMITE_RESAMPLER_H
4
#define __HERMITE_RESAMPLER_H
5
6
#include "resampler.h"
7
8
#undef CLAMP
9
#undef SHORT_CLAMP
10
#define CLAMP(x, low, high) (((x) > (high)) ? (high) : (((x) < (low)) ? (low) : (x)))
11
#define SHORT_CLAMP(n) ((short) CLAMP((n), -32768, 32767))
12
13
class HermiteResampler : public Resampler
14
{
15
protected:
16
17
double r_step;
18
double r_frac;
19
int r_left[4], r_right[4];
20
21
double
22
hermite (double mu1, double a, double b, double c, double d)
23
{
24
const double tension = 0.0; //-1 = low, 0 = normal, 1 = high
25
const double bias = 0.0; //-1 = left, 0 = even, 1 = right
26
27
double mu2, mu3, m0, m1, a0, a1, a2, a3;
28
29
mu2 = mu1 * mu1;
30
mu3 = mu2 * mu1;
31
32
m0 = (b - a) * (1 + bias) * (1 - tension) / 2;
33
m0 += (c - b) * (1 - bias) * (1 - tension) / 2;
34
m1 = (c - b) * (1 + bias) * (1 - tension) / 2;
35
m1 += (d - c) * (1 - bias) * (1 - tension) / 2;
36
37
a0 = +2 * mu3 - 3 * mu2 + 1;
38
a1 = mu3 - 2 * mu2 + mu1;
39
a2 = mu3 - mu2;
40
a3 = -2 * mu3 + 3 * mu2;
41
42
return (a0 * b) + (a1 * m0) + (a2 * m1) + (a3 * c);
43
}
44
45
public:
46
HermiteResampler (int num_samples) : Resampler (num_samples)
47
{
48
clear ();
49
}
50
51
~HermiteResampler ()
52
{
53
}
54
55
void
56
time_ratio (double ratio)
57
{
58
r_step = ratio;
59
clear ();
60
}
61
62
void
63
clear (void)
64
{
65
ring_buffer::clear ();
66
r_frac = 1.0;
67
r_left [0] = r_left [1] = r_left [2] = r_left [3] = 0;
68
r_right[0] = r_right[1] = r_right[2] = r_right[3] = 0;
69
}
70
71
void
72
read (short *data, int num_samples)
73
{
74
int i_position = start >> 1;
75
short *internal_buffer = (short *) buffer;
76
int o_position = 0;
77
int consumed = 0;
78
79
while (o_position < num_samples && consumed < buffer_size)
80
{
81
int s_left = internal_buffer[i_position];
82
int s_right = internal_buffer[i_position + 1];
83
int max_samples = buffer_size >> 1;
84
const double margin_of_error = 1.0e-10;
85
86
if (fabs(r_step - 1.0) < margin_of_error)
87
{
88
data[o_position] = (short) s_left;
89
data[o_position + 1] = (short) s_right;
90
91
o_position += 2;
92
i_position += 2;
93
if (i_position >= max_samples)
94
i_position -= max_samples;
95
consumed += 2;
96
97
continue;
98
}
99
100
while (r_frac <= 1.0 && o_position < num_samples)
101
{
102
data[o_position] = SHORT_CLAMP (hermite (r_frac, r_left [0], r_left [1], r_left [2], r_left [3]));
103
data[o_position + 1] = SHORT_CLAMP (hermite (r_frac, r_right[0], r_right[1], r_right[2], r_right[3]));
104
105
o_position += 2;
106
107
r_frac += r_step;
108
}
109
110
if (r_frac > 1.0)
111
{
112
r_left [0] = r_left [1];
113
r_left [1] = r_left [2];
114
r_left [2] = r_left [3];
115
r_left [3] = s_left;
116
117
r_right[0] = r_right[1];
118
r_right[1] = r_right[2];
119
r_right[2] = r_right[3];
120
r_right[3] = s_right;
121
122
r_frac -= 1.0;
123
124
i_position += 2;
125
if (i_position >= max_samples)
126
i_position -= max_samples;
127
consumed += 2;
128
}
129
}
130
131
size -= consumed << 1;
132
start += consumed << 1;
133
if (start >= buffer_size)
134
start -= buffer_size;
135
}
136
137
inline int
138
avail (void)
139
{
140
return (int) floor (((size >> 2) - r_frac) / r_step) * 2;
141
}
142
};
143
144
#endif /* __HERMITE_RESAMPLER_H */
145
146