Lines Matching refs:min
601 * The interval status (min, max, integer, etc.) are evaluated.
611 if (i->min < v->min) {
612 i->min = v->min;
615 } else if (i->min == v->min && !i->openmin && v->openmin) {
633 i->min++;
640 } else if (!i->openmin && !i->openmax && i->min == i->max)
658 i->max = i->min;
668 const unsigned int last_min = i->min;
674 i->min = i->max;
676 i->min--;
677 /* only exclude min value if also excluded before refine */
678 i->openmin = (i->openmin && i->min <= last_min);
689 c->min = mul(a->min, b->min);
714 c->min = div32(a->min, b->max, &r);
716 if (b->min > 0) {
717 c->max = div32(a->max, b->min, &r);
750 c->min = muldiv32(a->min, b->min, k, &r);
781 c->min = muldiv32(a->min, k, b->max, &r);
783 if (b->min > 0) {
784 c->max = muldiv32(a->max, k, b->min, &r);
827 unsigned int q = i->min;
856 t.min = div_down(best_num, best_den);
943 unsigned int q = i->min;
968 t.min = div_down(best_num, best_den);
1041 list_range.min = UINT_MAX;
1048 list_range.min = min(list_range.min, list[k]);
1081 range_union.min = UINT_MAX;
1092 if (range.min < range_union.min) {
1093 range_union.min = range.min;
1096 if (range.min == range_union.min && !range.openmin)
1113 n = i->min % step;
1115 i->min += step - n;
1253 * snd_pcm_hw_constraint_minmax - apply a min/max range constraint to an interval
1256 * @min: the minimal value
1259 * Apply the min/max range constraint to an interval parameter.
1265 unsigned int min, unsigned int max)
1269 t.min = min;
2447 uinfo->value.integer.min = 0;