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)
209 i->max = i->min;
219 const unsigned int last_min = i->min;
225 i->min = i->max;
227 i->min--;
228 /* only exclude min value if also excluded before refine */
229 i->openmin = (i->openmin && i->min <= last_min);
237 t.min = t.max = val;
250 c->min = add(a->min, b->min);
264 c->min = sub(a->min, b->max);
266 c->max = add(a->max, b->min);
278 c->min = mul(a->min, b->min);
293 c->min = div32(a->min, b->max, &r);
295 if (b->min > 0) {
296 c->max = div32(a->max, b->min, &r);
319 d->min = muldiv32(a->min, b->min, c->max, &r);
321 d->max = muldiv32(a->max, b->max, c->min, &r);
340 c->min = muldiv32(a->min, b->min, k, &r);
361 c->min = muldiv32(a->min, k, b->max, &r);
363 if (b->min > 0) {
364 c->max = muldiv32(a->max, k, b->min, &r);
381 else if (i->min == 0 && i->openmin == 0 &&
389 i->min, i->max,
438 /* Return 1 if min is nearer to best than max */
439 int boundary_nearer(int min, int mindir, int best, int bestdir, int max, int maxdir)
443 boundary_sub(best, bestdir, min, mindir, &dmin, &dmindir);