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
|
/************************************************************************
FAUST Architecture File
Copyright (C) 2003-2020 GRAME, Centre National de Creation Musicale
---------------------------------------------------------------------
This Architecture section 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 3 of
the License, or (at your option) any later version.
This program 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 this program; If not, see <http://www.gnu.org/licenses/>.
EXCEPTION : As a special exception, you may create a larger work
that contains this FAUST architecture section and distribute
that work under terms of your choice, so long as this FAUST
architecture section is not modified.
************************************************************************/
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <math.h>
#include <errno.h>
#include <time.h>
#include <sndfile.h>
#include <iostream>
#include <fstream>
#include <sstream>
#include <string>
#ifndef _WIN32
#include <libgen.h>
#endif
#include "faust/misc.h"
using namespace std;
#define BUFFER_SIZE 1024
// g++ -O3 sound2faust.cpp -lsndfile -o sound2faust
static string RemoveEnding(const string& name)
{
int match = name.rfind(".");
return (match != string::npos) ? name.substr(0, match) : name;
}
int main(int argc, char *argv[])
{
SNDFILE* soundfile;
SF_INFO snd_info;
char* base_name;
const char* output = lopts(argv, "-o", "");
long is_interleaved = isopt(argv, "-i");
#ifndef _WIN32
base_name = basename(argv[1]);
#else
base_name = new char[_MAX_FNAME];
_splitpath(argv[1], NULL, NULL, base_name, NULL);
#endif
if (argc < 2) {
printf("sound2faust <sound> -i (for interleaved) -o <file>\n");
printf("Generates : 'sound_n = waveform {....}' interleaved waveform\n");
printf("Generates : 'sound_0 = waveform {....} .... sound_x = waveform {....}' mono waveforms\n");
printf("Generates : 'sound = (sound_0,...sound_x):((!,_),...(!,_))' processor\n");
exit(1);
}
if (isdigit(base_name[0])) {
printf("soundfile '%s' start with a digit, please rename it\n", base_name);
exit(0);
}
snd_info.format = 0;
soundfile = sf_open(argv[1], SFM_READ, &snd_info);
if (!soundfile) {
printf("soundfile '%s' cannot be opened\n", base_name);
exit(0);
}
std::ostream* dst;
if (strcmp(output, "") == 0) {
dst = &cout;
} else {
dst = new ofstream(output);
}
double buffer[BUFFER_SIZE * snd_info.channels];
char sep;
if (is_interleaved) {
// Generates one interleaved waveform
*dst << RemoveEnding(base_name) << "_n = waveform";
int nbf;
sep = '{';
do {
nbf = sf_readf_double(soundfile, buffer, BUFFER_SIZE);
for (int i = 0; i < nbf * snd_info.channels; i++) {
*dst << sep << buffer[i];
sep = ',';
}
} while (nbf == BUFFER_SIZE);
*dst << "};" << std::endl;
} else {
// Generates separated mono waveforms
for (int chan = 0; chan < snd_info.channels; chan++) {
sf_seek(soundfile, 0, SEEK_SET);
*dst << RemoveEnding(base_name) << "_" << chan << " = waveform";
int nbf;
sep = '{';
do {
nbf = sf_readf_double(soundfile, buffer, BUFFER_SIZE);
for (int i = 0; i < nbf * snd_info.channels; i++) {
if (i % snd_info.channels == chan) {
*dst << sep << buffer[i];
sep = ',';
}
}
} while (nbf == BUFFER_SIZE);
*dst << "};" << std::endl;
}
// Generates one multi-channels processor
*dst << RemoveEnding(base_name) << " = ";
sep = '(';
for (int chan = 0; chan < snd_info.channels; chan++) {
*dst << sep << RemoveEnding(base_name) << "_" << chan;
sep = ',';
}
*dst << "):";
sep = '(';
for (int chan = 0; chan < snd_info.channels; chan++) {
*dst << sep << "(!,_)";
sep = ',';
}
*dst << ");" << std::endl;
// And generate tables
for (int chan = 0; chan < snd_info.channels; chan++) {
*dst << RemoveEnding(base_name) << "_rtable_" << chan <<"(r) = (" << RemoveEnding(base_name) << "_" << chan << ",r):rdtable;" << endl;
}
}
dst->flush();
}
|
