Lines Matching full:max
131 int snd_interval_refine_max(snd_interval_t *i, unsigned int max, int openmax) in snd_interval_refine_max() argument
136 if (i->max > max) { in snd_interval_refine_max()
137 i->max = max; in snd_interval_refine_max()
140 } else if (i->max == max && !i->openmax && openmax) { in snd_interval_refine_max()
146 i->max--; in snd_interval_refine_max()
171 if (i->max > v->max) { in snd_interval_refine()
172 i->max = v->max; in snd_interval_refine()
175 } else if (i->max == v->max && !i->openmax && v->openmax) { in snd_interval_refine()
189 i->max--; in snd_interval_refine()
192 } else if (!i->openmin && !i->openmax && i->min == i->max) in snd_interval_refine()
203 const unsigned int last_max = i->max; in snd_interval_refine_first()
209 i->max = i->min; in snd_interval_refine_first()
211 i->max++; in snd_interval_refine_first()
212 /* only exclude max value if also excluded before refine */ in snd_interval_refine_first()
213 i->openmax = (i->openmax && i->max >= last_max); in snd_interval_refine_first()
225 i->min = i->max; in snd_interval_refine_last()
237 t.min = t.max = val; in snd_interval_refine_set()
252 c->max = add(a->max, b->max); in snd_interval_add()
264 c->min = sub(a->min, b->max); in snd_interval_sub()
266 c->max = add(a->max, b->min); in snd_interval_sub()
280 c->max = mul(a->max, b->max); in snd_interval_mul()
293 c->min = div32(a->min, b->max, &r); in snd_interval_div()
296 c->max = div32(a->max, b->min, &r); in snd_interval_div()
298 c->max++; in snd_interval_div()
303 c->max = UINT_MAX; in snd_interval_div()
319 d->min = muldiv32(a->min, b->min, c->max, &r); in snd_interval_muldiv()
321 d->max = muldiv32(a->max, b->max, c->min, &r); in snd_interval_muldiv()
323 d->max++; in snd_interval_muldiv()
342 c->max = muldiv32(a->max, b->max, k, &r); in snd_interval_muldivk()
344 c->max++; in snd_interval_muldivk()
361 c->min = muldiv32(a->min, k, b->max, &r); in snd_interval_mulkdiv()
364 c->max = muldiv32(a->max, k, b->min, &r); in snd_interval_mulkdiv()
366 c->max++; in snd_interval_mulkdiv()
371 c->max = UINT_MAX; in snd_interval_mulkdiv()
382 i->max == UINT_MAX && i->openmax == 0) in snd_interval_print()
389 i->min, i->max, in snd_interval_print()
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) in boundary_nearer() argument
444 boundary_sub(max, maxdir, best, bestdir, &dmax, &dmaxdir); in boundary_nearer()