Lines Matching refs:val
30 const struct minmax_sample *val) in minmax_subwin_update() argument
32 u32 dt = val->t - m->s[0].t; in minmax_subwin_update()
44 m->s[2] = *val; in minmax_subwin_update()
45 if (unlikely(val->t - m->s[0].t > win)) { in minmax_subwin_update()
48 m->s[2] = *val; in minmax_subwin_update()
55 m->s[2] = m->s[1] = *val; in minmax_subwin_update()
61 m->s[2] = *val; in minmax_subwin_update()
69 struct minmax_sample val = { .t = t, .v = meas }; in minmax_running_max() local
71 if (unlikely(val.v >= m->s[0].v) || /* found new max? */ in minmax_running_max()
72 unlikely(val.t - m->s[2].t > win)) /* nothing left in window? */ in minmax_running_max()
75 if (unlikely(val.v >= m->s[1].v)) in minmax_running_max()
76 m->s[2] = m->s[1] = val; in minmax_running_max()
77 else if (unlikely(val.v >= m->s[2].v)) in minmax_running_max()
78 m->s[2] = val; in minmax_running_max()
80 return minmax_subwin_update(m, win, &val); in minmax_running_max()
87 struct minmax_sample val = { .t = t, .v = meas }; in minmax_running_min() local
89 if (unlikely(val.v <= m->s[0].v) || /* found new min? */ in minmax_running_min()
90 unlikely(val.t - m->s[2].t > win)) /* nothing left in window? */ in minmax_running_min()
93 if (unlikely(val.v <= m->s[1].v)) in minmax_running_min()
94 m->s[2] = m->s[1] = val; in minmax_running_min()
95 else if (unlikely(val.v <= m->s[2].v)) in minmax_running_min()
96 m->s[2] = val; in minmax_running_min()
98 return minmax_subwin_update(m, win, &val); in minmax_running_min()