685 	if (i->max > v->max) {  in snd_interval_refine()
686 		i->max = v->max;  in snd_interval_refine()
689 	} else if (i->max == v->max && !i->openmax && v->openmax) {  in snd_interval_refine()
703 			i->max--;  in snd_interval_refine()
706 	} else if (!i->openmin && !i->openmax && i->min == i->max)  in snd_interval_refine()
723 	i->max = i->min;  in snd_interval_refine_first()
726 		i->max++;  in snd_interval_refine_first()
736 	i->min = i->max;  in snd_interval_refine_last()
752 	c->max = mul(a->max,  b->max);  in snd_interval_mul()
775 	c->min = div32(a->min, b->max, &r);  in snd_interval_div()
778 		c->max = div32(a->max, b->min, &r);  in snd_interval_div()
780 			c->max++;  in snd_interval_div()
785 		c->max = UINT_MAX;  in snd_interval_div()
813 	c->max = muldiv32(a->max, b->max, k, &r);  in snd_interval_muldivk()
815 		c->max++;  in snd_interval_muldivk()
842 	c->min = muldiv32(a->min, k, b->max, &r);  in snd_interval_mulkdiv()
845 		c->max = muldiv32(a->max, k, b->min, &r);  in snd_interval_mulkdiv()
847 			c->max++;  in snd_interval_mulkdiv()
852 		c->max = UINT_MAX;  in snd_interval_mulkdiv()
927 		unsigned int q = i->max;  in snd_interval_ratnum()
958 	t.max = div_up(best_num, best_den);  in snd_interval_ratnum()
1036 		unsigned int q = i->max;  in snd_interval_ratden()
1061 	t.max = div_up(best_num, best_den);  in snd_interval_ratden()
1103 	list_range.max = 0;  in snd_interval_list()
1110 		list_range.max = max(list_range.max, list[k]);  in snd_interval_list()
1126 	n = (i->max - min) % step;  in snd_interval_step()
1128 		i->max -= n;  in snd_interval_step()
1276 				 unsigned int min, unsigned int max)  in snd_pcm_hw_constraint_minmax()  argument
1281 	t.max = max;  in snd_pcm_hw_constraint_minmax()
1891 			wait_time = max(t, wait_time);  in wait_for_avail()
2446 	uinfo->value.integer.max = SNDRV_CHMAP_LAST;  in pcm_chmap_ctl_info()