Lines Matching refs:min
105 int snd_interval_refine_min(snd_interval_t *i, unsigned int min, int openmin)
110 if (i->min < min) {
111 i->min = min;
114 } else if (i->min == min && !i->openmin && openmin) {
120 i->min++;
163 if (i->min < v->min) {
164 i->min = v->min;
167 } else if (i->min == v->min && !i->openmin && v->openmin) {
185 i->min++;
192 } else if (!i->openmin && !i->openmax && i->min == i->max)
207 i->max = i->min;
220 i->min = i->max;
223 i->min--;
231 t.min = t.max = val;
244 c->min = add(a->min, b->min);
258 c->min = sub(a->min, b->max);
260 c->max = add(a->max, b->min);
272 c->min = mul(a->min, b->min);
287 c->min = div32(a->min, b->max, &r);
289 if (b->min > 0) {
290 c->max = div32(a->max, b->min, &r);
313 d->min = muldiv32(a->min, b->min, c->max, &r);
315 d->max = muldiv32(a->max, b->max, c->min, &r);
334 c->min = muldiv32(a->min, b->min, k, &r);
355 c->min = muldiv32(a->min, k, b->max, &r);
357 if (b->min > 0) {
358 c->max = muldiv32(a->max, k, b->min, &r);
375 else if (i->min == 0 && i->openmin == 0 &&
383 i->min, i->max,
432 /* Return 1 if min is nearer to best than max */
433 int boundary_nearer(int min, int mindir, int best, int bestdir, int max, int maxdir)
437 boundary_sub(best, bestdir, min, mindir, &dmin, &dmindir);