66 void min_heap_elem_init_(struct event* e) { e->ev_timeout_pos.min_heap_idx = -1; }  in min_heap_elem_init_()
85 		e->ev_timeout_pos.min_heap_idx = -1;  in min_heap_pop_()
93 	return e->ev_timeout_pos.min_heap_idx == 0;  in min_heap_elt_is_top_()
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_()
119 	if (-1 == e->ev_timeout_pos.min_heap_idx) {  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_()
154 	(s->p[hole_index] = s->p[parent])->ev_timeout_pos.min_heap_idx = hole_index;  in min_heap_shift_up_unconditional_()
158     (s->p[hole_index] = e)->ev_timeout_pos.min_heap_idx = hole_index;  in min_heap_shift_up_unconditional_()
166 	(s->p[hole_index] = s->p[parent])->ev_timeout_pos.min_heap_idx = hole_index;  in min_heap_shift_up_()
170     (s->p[hole_index] = e)->ev_timeout_pos.min_heap_idx = hole_index;  in min_heap_shift_up_()
181 	(s->p[hole_index] = s->p[min_child])->ev_timeout_pos.min_heap_idx = hole_index;  in min_heap_shift_down_()
185     (s->p[hole_index] = e)->ev_timeout_pos.min_heap_idx = hole_index;  in min_heap_shift_down_()