47 static inline void	     min_heap_elem_init_(struct event* e);
48 static inline int	     min_heap_elt_is_top_(const struct event *e);
53 static inline int	     min_heap_push_(min_heap_t* s, struct event* e);
55 static inline int	     min_heap_adjust_(min_heap_t *s, struct event* e);
56 static inline int	     min_heap_erase_(min_heap_t* s, struct event* e);
57 static inline void	     min_heap_shift_up_(min_heap_t* s, unsigned hole_index, struct event* e);
58 …ne void	     min_heap_shift_up_unconditional_(min_heap_t* s, unsigned hole_index, struct event* e);
59 static inline void	     min_heap_shift_down_(min_heap_t* s, unsigned hole_index, struct event* e);
66 void min_heap_elem_init_(struct event* e) { e->ev_timeout_pos.min_heap_idx = -1; }  in min_heap_elem_init_()  argument
71 int min_heap_push_(min_heap_t* s, struct event* e)  in min_heap_push_()  argument
75 	min_heap_shift_up_(s, s->n++, e);  in min_heap_push_()
83 		struct event* e = *s->p;  in min_heap_pop_()  local
85 		e->ev_timeout_pos.min_heap_idx = -1;  in min_heap_pop_()
86 		return e;  in min_heap_pop_()
91 int min_heap_elt_is_top_(const struct event *e)  in min_heap_elt_is_top_()  argument
93 	return e->ev_timeout_pos.min_heap_idx == 0;  in min_heap_elt_is_top_()
96 int min_heap_erase_(min_heap_t* s, struct event* e)  in min_heap_erase_()  argument
98 	if (-1 != e->ev_timeout_pos.min_heap_idx)  in min_heap_erase_()
101 		unsigned parent = (e->ev_timeout_pos.min_heap_idx - 1) / 2;  in min_heap_erase_()
107 		if (e->ev_timeout_pos.min_heap_idx > 0 && min_heap_elem_greater(s->p[parent], last))  in min_heap_erase_()
108 			min_heap_shift_up_unconditional_(s, e->ev_timeout_pos.min_heap_idx, last);  in min_heap_erase_()
110 			min_heap_shift_down_(s, e->ev_timeout_pos.min_heap_idx, last);  in min_heap_erase_()
111 		e->ev_timeout_pos.min_heap_idx = -1;  in min_heap_erase_()
117 int min_heap_adjust_(min_heap_t *s, struct event *e)  in min_heap_adjust_()  argument
119 	if (-1 == e->ev_timeout_pos.min_heap_idx) {  in min_heap_adjust_()
120 		return min_heap_push_(s, e);  in min_heap_adjust_()
122 		unsigned parent = (e->ev_timeout_pos.min_heap_idx - 1) / 2;  in min_heap_adjust_()
125 		if (e->ev_timeout_pos.min_heap_idx > 0 && min_heap_elem_greater(s->p[parent], e))  in min_heap_adjust_()
126 			min_heap_shift_up_unconditional_(s, e->ev_timeout_pos.min_heap_idx, e);  in min_heap_adjust_()
128 			min_heap_shift_down_(s, e->ev_timeout_pos.min_heap_idx, e);  in min_heap_adjust_()
153 void min_heap_shift_up_unconditional_(min_heap_t* s, unsigned hole_index, struct event* e)  in min_heap_shift_up_unconditional_()  argument
161     } while (hole_index && min_heap_elem_greater(s->p[parent], e));  in min_heap_shift_up_unconditional_()
162     (s->p[hole_index] = e)->ev_timeout_pos.min_heap_idx = hole_index;  in min_heap_shift_up_unconditional_()
165 void min_heap_shift_up_(min_heap_t* s, unsigned hole_index, struct event* e)  in min_heap_shift_up_()  argument
168     while (hole_index && min_heap_elem_greater(s->p[parent], e))  in min_heap_shift_up_()
174     (s->p[hole_index] = e)->ev_timeout_pos.min_heap_idx = hole_index;  in min_heap_shift_up_()
177 void min_heap_shift_down_(min_heap_t* s, unsigned hole_index, struct event* e)  in min_heap_shift_down_()  argument
183 	if (!(min_heap_elem_greater(e, s->p[min_child])))  in min_heap_shift_down_()
189     (s->p[hole_index] = e)->ev_timeout_pos.min_heap_idx = hole_index;  in min_heap_shift_down_()