matrix
Eurydice_dst_ref_shared_44 matrix,
Eurydice_arr_a3 product = matrix.ptr[i1 * columns_in_a + j];
Eurydice_dst_ref_shared_44 matrix,
libcrux_ml_dsa_ntt_ntt_multiply_montgomery_37(&product, &matrix.ptr[i1 * columns_in_a + j]);
Eurydice_dst_ref_mut_44 matrix,
&matrix.ptr[start_index + k]);
Eurydice_dst_ref_mut_44 matrix
for (size_t i = (size_t)0U; i < matrix.meta / (size_t)4U + (size_t)1U; i++)
if (start_index0 >= matrix.meta)
if (start_index0 + (size_t)4U <= matrix.meta)
elements_requested = matrix.meta - start_index0;
matrix,
Eurydice_dst_ref_mut_44 matrix
libcrux_ml_dsa_samplex4_matrix_flat_63(columns, seed, matrix);
Eurydice_arr_2f matrix;
memcpy(matrix.data, repeat_expression3, (size_t)16U * sizeof (Eurydice_arr_a3));
Eurydice_array_to_slice_mut_200(&matrix));
Eurydice_array_to_slice_shared_201(&matrix),
Eurydice_arr_2f matrix;
memcpy(matrix.data, repeat_expression, (size_t)16U * sizeof (Eurydice_arr_a3));
Eurydice_array_to_slice_mut_200(&matrix));
Eurydice_array_to_slice_shared_201(&matrix),
Eurydice_arr_5a matrix;
memcpy(matrix.data, repeat_expression3, (size_t)30U * sizeof (Eurydice_arr_a3));
Eurydice_array_to_slice_mut_203(&matrix));
Eurydice_array_to_slice_shared_205(&matrix),
Eurydice_arr_5a matrix;
memcpy(matrix.data, repeat_expression, (size_t)30U * sizeof (Eurydice_arr_a3));
Eurydice_array_to_slice_mut_203(&matrix));
Eurydice_array_to_slice_shared_205(&matrix),
Eurydice_arr_0f matrix;
memcpy(matrix.data, repeat_expression3, (size_t)56U * sizeof (Eurydice_arr_a3));
Eurydice_array_to_slice_mut_207(&matrix));
Eurydice_array_to_slice_shared_208(&matrix),
Eurydice_arr_0f matrix;
memcpy(matrix.data, repeat_expression, (size_t)56U * sizeof (Eurydice_arr_a3));
Eurydice_array_to_slice_mut_207(&matrix));
Eurydice_array_to_slice_shared_208(&matrix),
const Eurydice_arr_c10 *matrix,
Eurydice_arr_bb0 u = libcrux_ml_kem_matrix_compute_vector_u_68(matrix, &r_as_ntt, &error_1);
size += sizeof(mt->matrix[0]) * (slots + 6) * slots;
mt->matrix = (int *)(mt->match_slots + slots);
evdev_mt_matching(int *matrix, int m, int n, int *buffer)
for (i = 0, p = matrix + col; i < m; i++, p += n) {
for (i = 0, p = matrix; i < m; i++, p += n)
MPASS(mt->matrix != NULL);
p = mt->matrix;
evdev_mt_matching(mt->matrix, m, n, p);
int *matrix;
c->matrix = *feeder_matrix_id_map(SND_CHN_MATRIX_1_0);
c->matrix.id = SND_CHN_MATRIX_PCMCHANNEL;
return (&c->matrix);
c->matrix = *m;
c->matrix.id = SND_CHN_MATRIX_PCMCHANNEL;
return (feeder_matrix_oss_get_channel_order(&c->matrix, map));
m = c->matrix;
struct pcmchan_matrix matrix;
cdesc->current.matrix->channels, cdesc->current.matrix->ext);
cdesc->target.matrix->channels, cdesc->target.matrix->ext);
ret = feeder_matrix_setup(f, cdesc->current.matrix,
cdesc->target.matrix);
cdesc->current.matrix = cdesc->target.matrix;
ret = feeder_volume_apply_matrix(f, cdesc->current.matrix);
struct pcmchan_matrix *matrix; /* matrix map */
#define FEEDER_BW(c, t) ((c)->t.matrix->channels * (c)->t.rate)
#define FEEDMATRIX_UP(c) ((c)->target.matrix->channels > \
(c)->current.matrix->channels)
#define FEEDMATRIX_DOWN(c) ((c)->target.matrix->channels < \
(c)->current.matrix->channels)
softmatrix = &c->matrix;
softmatrix = &c->matrix;
c->matrix = *softmatrix;
c->matrix.id = SND_CHN_MATRIX_PCMCHANNEL;
cdesc.origin.matrix = softmatrix;
cdesc.target.matrix = hwmatrix;
cdesc.origin.matrix = hwmatrix;
cdesc.target.matrix = softmatrix;
if (feeder_matrix_compare(cdesc.origin.matrix,
cdesc.target.matrix) != 0)
FEEDER_BUILD(matrix);
FEEDER_BUILD(matrix);
FEEDER_BUILD(matrix);
for (i = 0; info->matrix[i].chn[0] != SND_CHN_T_EOF; i++) {
if (info->matrix[i].chn[0] == SND_CHN_T_NULL) {
} else if (info->matrix[i].chn[1] == SND_CHN_T_EOF) {
info->matrix[i].chn[0], fmt);
for (j = 0; info->matrix[i].chn[j] != SND_CHN_T_EOF;
info->matrix[i].chn[j], fmt);
accum = (accum * info->matrix[i].mul) >>
info->matrix[i].shift;
for (i = 0; i < nitems(info->matrix); i++) {
j < (sizeof(info->matrix[i].chn) /
sizeof(info->matrix[i].chn[0])); j++) {
info->matrix[i].chn[j] = SND_CHN_T_EOF;
info->matrix[i].mul = 1;
info->matrix[i].shift = 0;
info->matrix[ch].chn[0] = SND_CHN_T_NULL;
info->matrix[ch].chn[j++] =
info->matrix[ch].chn[j++] =
info->matrix[ch].mul = mul;
info->matrix[ch].shift = shift;
for (i = 0; info->matrix[i].chn[0] != SND_CHN_T_EOF; i++) {
for (j = 0; info->matrix[i].chn[j] != SND_CHN_T_EOF; j++) {
(info->matrix[i].chn[j] == SND_CHN_T_NULL) ?
0xffffffff : info->matrix[i].chn[j] / info->bps);
info->matrix[i].mul, info->matrix[i].shift);
if (info->matrix[0].chn[0] == SND_CHN_T_EOF)
} matrix[SND_CHN_T_MAX + 1];
int i, *matrix;
matrix = info->matrix;
if (vol[matrix[i]] != SND_VOL_FLAT ||
muted[matrix[i]] != 0) {
info->apply(temp_vol, matrix, info->channels, dst, j);
for (i = 0; i < nitems(info->matrix); i++) {
info->matrix[i] = m->map[i].type;
info->matrix[i] = SND_CHN_T_FL;
feed_volume_##SIGN##BIT##ENDIAN(int *vol, int *matrix, \
v = FEEDVOLUME_CALC##BIT(x, vol[matrix[i]]); \
int matrix[SND_CHN_MAX];