32 	u32 dt = val->t - m->s[0].t;  in minmax_subwin_update()
45 		if (unlikely(val->t - m->s[0].t > win)) {  in minmax_subwin_update()
50 	} else if (unlikely(m->s[1].t == m->s[0].t) && dt > win/4) {  in minmax_subwin_update()
56 	} else if (unlikely(m->s[2].t == m->s[1].t) && dt > win/2) {  in minmax_subwin_update()
67 u32 minmax_running_max(struct minmax *m, u32 win, u32 t, u32 meas)  in minmax_running_max()  argument
69 	struct minmax_sample val = { .t = t, .v = meas };  in minmax_running_max()
72 	    unlikely(val.t - m->s[2].t > win))	  /* nothing left in window? */  in minmax_running_max()
73 		return minmax_reset(m, t, meas);  /* forget earlier samples */  in minmax_running_max()
85 u32 minmax_running_min(struct minmax *m, u32 win, u32 t, u32 meas)  in minmax_running_min()  argument
87 	struct minmax_sample val = { .t = t, .v = meas };  in minmax_running_min()
90 	    unlikely(val.t - m->s[2].t > win))	  /* nothing left in window? */  in minmax_running_min()
91 		return minmax_reset(m, t, meas);  /* forget earlier samples */  in minmax_running_min()