4 * Copyright (c) 2004-2005 Vassili Karpov (malc)
5 * Copyright (c) 1998 Fabrice Bellard
7 * Permission is hereby granted, free of charge, to any person obtaining a copy
8 * of this software and associated documentation files (the "Software"), to deal
9 * in the Software without restriction, including without limitation the rights
10 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
11 * copies of the Software, and to permit persons to whom the Software is
12 * furnished to do so, subject to the following conditions:
14 * The above copyright notice and this permission notice shall be included in
15 * all copies or substantial portions of the Software.
17 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
18 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
19 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
20 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
21 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
22 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
27 * Processed signed long samples from ibuf to obuf.
28 * Return number of samples processed.
30 void NAME (void *opaque
, struct st_sample
*ibuf
, struct st_sample
*obuf
,
31 size_t *isamp
, size_t *osamp
)
33 struct rate
*rate
= opaque
;
34 struct st_sample
*istart
, *iend
;
35 struct st_sample
*ostart
, *oend
;
36 struct st_sample ilast
, icur
, out
;
49 if (rate
->opos_inc
== (1ULL + UINT_MAX
)) {
50 int i
, n
= *isamp
> *osamp
? *osamp
: *isamp
;
51 for (i
= 0; i
< n
; i
++) {
52 OP (obuf
[i
].l
, ibuf
[i
].l
);
53 OP (obuf
[i
].r
, ibuf
[i
].r
);
60 /* without input samples, there's nothing to do */
70 /* read as many input samples so that ipos > opos */
71 while (rate
->ipos
<= (rate
->opos
>> 32)) {
75 /* See if we finished the input buffer yet */
81 /* make sure that the next output sample can be written */
88 /* wrap ipos and opos around long before they overflow */
89 if (rate
->ipos
>= 0x10001) {
91 rate
->opos
&= 0xffffffff;
97 t
= (rate
->opos
& UINT_MAX
) * (1.f
/ UINT_MAX
);
99 t
= (rate
->opos
& UINT_MAX
) / (mixeng_real
) UINT_MAX
;
101 out
.l
= (ilast
.l
* (1.0 - t
)) + icur
.l
* t
;
102 out
.r
= (ilast
.r
* (1.0 - t
)) + icur
.r
* t
;
104 t
= rate
->opos
& 0xffffffff;
105 out
.l
= (ilast
.l
* ((int64_t) UINT_MAX
- t
) + icur
.l
* t
) >> 32;
106 out
.r
= (ilast
.r
* ((int64_t) UINT_MAX
- t
) + icur
.r
* t
) >> 32;
109 /* output sample & increment position */
113 rate
->opos
+= rate
->opos_inc
;
117 *isamp
= ibuf
- istart
;
118 *osamp
= obuf
- ostart
;