make crap_eq work again
This commit is contained in:
parent
d227226200
commit
0f7a6e3ee1
3 changed files with 5 additions and 5 deletions
2
Makefile
2
Makefile
|
@ -4,7 +4,7 @@ VERSION = git
|
||||||
EXE = design
|
EXE = design
|
||||||
SHOBJ = crap_eq.so crap_eq_const.so
|
SHOBJ = crap_eq.so crap_eq_const.so
|
||||||
MID =
|
MID =
|
||||||
HEADERS = crap_util.h ladspa.h
|
HEADERS = crap_util.h crap_util_def.h ladspa.h
|
||||||
|
|
||||||
OBJ = ${SHOBJ:.so=.o} ${EXE:=.o} ${MID}
|
OBJ = ${SHOBJ:.so=.o} ${EXE:=.o} ${MID}
|
||||||
SRC = ${OBJ:.o=.c}
|
SRC = ${OBJ:.o=.c}
|
||||||
|
|
|
@ -146,14 +146,15 @@ run_eq(LADSPA_Handle instance, ulong sample_count) {
|
||||||
eq_t *eq = (eq_t *) instance;
|
eq_t *eq = (eq_t *) instance;
|
||||||
biquad *filters = eq->filters;
|
biquad *filters = eq->filters;
|
||||||
|
|
||||||
|
watch_parameters(eq);
|
||||||
|
|
||||||
const LADSPA_Data *input = eq->input;
|
const LADSPA_Data *input = eq->input;
|
||||||
LADSPA_Data *output = eq->output;
|
LADSPA_Data *output = eq->output;
|
||||||
|
|
||||||
for (ulong pos = 0; pos < sample_count; pos++) {
|
for (ulong pos = 0; pos < sample_count; pos++) {
|
||||||
LADSPA_Data samp = input[pos];
|
LADSPA_Data samp = input[pos];
|
||||||
for (int i = 0; i < BANDS; i++) {
|
for (int i = 0; i < BANDS; i++)
|
||||||
samp = biquad_run(&filters[i], samp);
|
samp = biquad_run(&filters[i], samp);
|
||||||
}
|
|
||||||
output[pos] = samp;
|
output[pos] = samp;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
|
@ -78,9 +78,8 @@ run_eq(LADSPA_Handle instance, ulong sample_count) {
|
||||||
|
|
||||||
for (ulong pos = 0; pos < sample_count; pos++) {
|
for (ulong pos = 0; pos < sample_count; pos++) {
|
||||||
LADSPA_Data samp = input[pos];
|
LADSPA_Data samp = input[pos];
|
||||||
for (int i = 0; i < REALBANDS; i++) {
|
for (int i = 0; i < REALBANDS; i++)
|
||||||
samp = biquad_run(&filters[i], samp);
|
samp = biquad_run(&filters[i], samp);
|
||||||
}
|
|
||||||
output[pos] = samp;
|
output[pos] = samp;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
Loading…
Reference in a new issue