Lines Matching refs:chans
74 extern void *lsx_ms_adpcm_alloc(unsigned chans) in lsx_ms_adpcm_alloc() argument
76 return lsx_malloc(chans * sizeof(MsState_t)); in lsx_ms_adpcm_alloc()
111 unsigned chans, /* total channels */ in lsx_ms_adpcm_block_expand_i() argument
126 for (ch = 0; ch < chans; ch++) { in lsx_ms_adpcm_block_expand_i()
136 for (ch = 0; ch < chans; ch++) in lsx_ms_adpcm_block_expand_i()
140 for (ch = 0; ch < chans; ch++) in lsx_ms_adpcm_block_expand_i()
141 lsbshortldi(obuff[chans+ch], ip); in lsx_ms_adpcm_block_expand_i()
144 for (ch = 0; ch < chans; ch++) in lsx_ms_adpcm_block_expand_i()
153 op = obuff + 2*chans; in lsx_ms_adpcm_block_expand_i()
154 top = obuff + n*chans; in lsx_ms_adpcm_block_expand_i()
160 *op++ = AdpcmDecode(b >> 4, state+ch2, tmp[-(int)chans], tmp[-(int)(2*chans)]); in lsx_ms_adpcm_block_expand_i()
161 if (++ch2 == chans) ch2 = 0; in lsx_ms_adpcm_block_expand_i()
163 *op++ = AdpcmDecode(b&0x0f, state+ch2, tmp[-(int)chans], tmp[-(int)(2*chans)]); in lsx_ms_adpcm_block_expand_i()
164 if (++ch2 == chans) ch2 = 0; in lsx_ms_adpcm_block_expand_i()
172 unsigned chans, /* total channels */ in AdpcmMashS() argument
188 itop = ibuff + n*chans; in AdpcmMashS()
191 d = *ip - v1; ip += chans; /* 1st input sample for this channel */ in AdpcmMashS()
193 d = *ip - v0; ip += chans; /* 2nd input sample for this channel */ in AdpcmMashS()
200 op += chans; /* skip bpred indices */ in AdpcmMashS()
203 op += 2*chans; /* skip to v0 */ in AdpcmMashS()
205 op += 2*chans; /* skip to v1 */ in AdpcmMashS()
207 op = obuff+7*chans; /* point to base of output nibbles */ in AdpcmMashS()
210 for (; ip < itop; ip+=chans) { in AdpcmMashS()
236 ox += 4*chans; in AdpcmMashS()
255 unsigned chans, /* total channels */ in AdpcmMashChannel() argument
269 v[0] = ip[ch+chans]; in AdpcmMashChannel()
279 … d0=AdpcmMashS(ch, chans, v, lsx_ms_adpcm_i_coef[k], ip, n, &ss, NULL); /* with step s0 */ in AdpcmMashChannel()
282 AdpcmMashS(ch, chans, v, lsx_ms_adpcm_i_coef[k], ip, n0, &s1, NULL); in AdpcmMashChannel()
285 … d1=AdpcmMashS(ch, chans, v, lsx_ms_adpcm_i_coef[k], ip, n, &ss, NULL); /* with step s1 */ in AdpcmMashChannel()
299 AdpcmMashS(ch, chans, v, lsx_ms_adpcm_i_coef[kmin], ip, n, st, obuff); in AdpcmMashChannel()
304 unsigned chans, /* total channels */ in lsx_ms_adpcm_block_mash_i() argument
316 chans, (void *)ip, n, (void *)st, obuff, blockAlign); in lsx_ms_adpcm_block_mash_i()
318 for (p=obuff+7*chans; p<obuff+blockAlign; p++) *p=0; in lsx_ms_adpcm_block_mash_i()
320 for (ch=0; ch<chans; ch++) in lsx_ms_adpcm_block_mash_i()
321 AdpcmMashChannel(ch, chans, ip, n, st+ch, obuff); in lsx_ms_adpcm_block_mash_i()
334 size_t chans, in lsx_ms_adpcm_samples_in() argument
347 if (m >= (size_t)(7*chans)) { in lsx_ms_adpcm_samples_in()
348 m -= 7*chans; /* bytes beyond block-header */ in lsx_ms_adpcm_samples_in()
349 m = (2*m)/chans + 2; /* nibbles/chans + 2 in header */ in lsx_ms_adpcm_samples_in()
357 size_t chans, in lsx_ms_adpcm_bytes_per_block() argument
362 n = 7*chans; /* header */ in lsx_ms_adpcm_bytes_per_block()
364 n += (((size_t)samplesPerBlock-2)*chans + 1)/2; in lsx_ms_adpcm_bytes_per_block()