Lines Matching +full:everything +full:- +full:else

1 // SPDX-License-Identifier: GPL-2.0
14  * the n'th best >= n-1'th best. It also makes sure that the three
19  * Upon getting a new min, we can forget everything earlier because
20  * it has no value - the new min is <= everything else in the window
32 	u32 dt = val->t - m->s[0].t;  in minmax_subwin_update()
42 		m->s[0] = m->s[1];  in minmax_subwin_update()
43 		m->s[1] = m->s[2];  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()
46 			m->s[0] = m->s[1];  in minmax_subwin_update()
47 			m->s[1] = m->s[2];  in minmax_subwin_update()
48 			m->s[2] = *val;  in minmax_subwin_update()
50 	} else if (unlikely(m->s[1].t == m->s[0].t) && dt > win/4) {  in minmax_subwin_update()
55 		m->s[2] = m->s[1] = *val;  in minmax_subwin_update()
56 	} else if (unlikely(m->s[2].t == m->s[1].t) && dt > win/2) {  in minmax_subwin_update()
61 		m->s[2] = *val;  in minmax_subwin_update()
63 	return m->s[0].v;  in minmax_subwin_update()
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()
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()