608 	if (i->min < v->min) {  in snd_interval_refine()
609 		i->min = v->min;  in snd_interval_refine()
612 	} else if (i->min == v->min && !i->openmin && v->openmin) {  in snd_interval_refine()
630 			i->min++;  in snd_interval_refine()
637 	} else if (!i->openmin && !i->openmax && i->min == i->max)  in snd_interval_refine()
654 	i->max = i->min;  in snd_interval_refine_first()
667 	i->min = i->max;  in snd_interval_refine_last()
670 		i->min--;  in snd_interval_refine_last()
681 	c->min = mul(a->min, b->min);  in snd_interval_mul()
706 	c->min = div32(a->min, b->max, &r);  in snd_interval_div()
708 	if (b->min > 0) {  in snd_interval_div()
709 		c->max = div32(a->max, b->min, &r);  in snd_interval_div()
742 	c->min = muldiv32(a->min, b->min, k, &r);  in snd_interval_muldivk()
773 	c->min = muldiv32(a->min, k, b->max, &r);  in snd_interval_mulkdiv()
775 	if (b->min > 0) {  in snd_interval_mulkdiv()
776 		c->max = muldiv32(a->max, k, b->min, &r);  in snd_interval_mulkdiv()
819 		unsigned int q = i->min;  in snd_interval_ratnum()
848 	t.min = div_down(best_num, best_den);  in snd_interval_ratnum()
935 		unsigned int q = i->min;  in snd_interval_ratden()
960 	t.min = div_down(best_num, best_den);  in snd_interval_ratden()
1033 	list_range.min = UINT_MAX;  in snd_interval_list()
1040 		list_range.min = min(list_range.min, list[k]);  in snd_interval_list()
1074 	range_union.min = UINT_MAX;  in snd_interval_ranges()
1085 		if (range.min < range_union.min) {  in snd_interval_ranges()
1086 			range_union.min = range.min;  in snd_interval_ranges()
1089 		if (range.min == range_union.min && !range.openmin)  in snd_interval_ranges()
1106 	n = i->min % step;  in snd_interval_step()
1108 		i->min += step - n;  in snd_interval_step()
1264 				 unsigned int min, unsigned int max)  in snd_pcm_hw_constraint_minmax()  argument
1268 	t.min = min;  in snd_pcm_hw_constraint_minmax()
2480 	uinfo->value.integer.min = 0;  in pcm_chmap_ctl_info()