41 	struct event** p;
47 static inline void	     min_heap_elem_init_(struct event* e);
48 static inline int	     min_heap_elt_is_top_(const struct event *e);
51 static inline struct event*  min_heap_top_(min_heap_t* s);
53 static inline int	     min_heap_push_(min_heap_t* s, struct event* e);
54 static inline struct event*  min_heap_pop_(min_heap_t* s);
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_()
69 struct event* min_heap_top_(min_heap_t* s) { return s->n ? *s->p : 0; }  in min_heap_top_()
71 int min_heap_push_(min_heap_t* s, struct event* e)  in min_heap_push_()
79 struct event* min_heap_pop_(min_heap_t* s)  in min_heap_pop_()
83 		struct event* e = *s->p;  in min_heap_pop_()
91 int min_heap_elt_is_top_(const struct event *e)  in min_heap_elt_is_top_()
96 int min_heap_erase_(min_heap_t* s, struct event* e)  in min_heap_erase_()
100 		struct event *last = s->p[--s->n];  in min_heap_erase_()
117 int min_heap_adjust_(min_heap_t *s, struct event *e)  in min_heap_adjust_()
137 		struct event** p;  in min_heap_reserve_()
145 		if (!(p = (struct event**)mm_realloc(s->p, a * sizeof *p)))  in min_heap_reserve_()
153 void min_heap_shift_up_unconditional_(min_heap_t* s, unsigned hole_index, struct event* e)  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_()
177 void min_heap_shift_down_(min_heap_t* s, unsigned hole_index, struct event* e)  in min_heap_shift_down_()