Lines Matching refs:eq2
9 struct eq2 { struct
14 struct eq2 *eq2_new() in eq2_new() argument
16 struct eq2 *eq2 = (struct eq2 *)calloc(1, sizeof(*eq2)); in eq2_new() local
23 biquad_set(&eq2->biquad[i][j], BQ_NONE, 0, 0, 0); in eq2_new()
25 return eq2; in eq2_new()
28 void eq2_free(struct eq2 *eq2) in eq2_free() argument
30 free(eq2); in eq2_free()
33 int eq2_append_biquad(struct eq2 *eq2, int channel, in eq2_append_biquad() argument
36 if (eq2->n[channel] >= MAX_BIQUADS_PER_EQ2) in eq2_append_biquad()
38 biquad_set(&eq2->biquad[eq2->n[channel]++][channel], type, freq, Q, in eq2_append_biquad()
43 int eq2_append_biquad_direct(struct eq2 *eq2, int channel, in eq2_append_biquad_direct() argument
46 if (eq2->n[channel] >= MAX_BIQUADS_PER_EQ2) in eq2_append_biquad_direct()
48 eq2->biquad[eq2->n[channel]++][channel] = *biquad; in eq2_append_biquad_direct()
317 void eq2_process(struct eq2 *eq2, float *data0, float *data1, int count) in eq2_process() argument
323 n = eq2->n[0]; in eq2_process()
324 if (eq2->n[1] > n) in eq2_process()
325 n = eq2->n[1]; in eq2_process()
328 eq2_process_one(&eq2->biquad[i], data0, data1, count); in eq2_process()
331 eq2_process_two_neon(&eq2->biquad[i], data0, data1, in eq2_process()
334 eq2_process_two_sse3(&eq2->biquad[i], data0, data1, in eq2_process()
337 eq2_process_one(&eq2->biquad[i], data0, data1, count); in eq2_process()
338 eq2_process_one(&eq2->biquad[i+1], data0, data1, count); in eq2_process()