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