Searched refs:min_heap_elem_greater (Results 1 – 2 of 2) sorted by relevance
| /freebsd/contrib/ntp/sntp/libevent/ |
| H A D | minheap-internal.h | 61 #define min_heap_elem_greater(a, b) \ macro
107 if (e->ev_timeout_pos.min_heap_idx > 0 && min_heap_elem_greater(s->p[parent], last)) in min_heap_erase_()
125 if (e->ev_timeout_pos.min_heap_idx > 0 && min_heap_elem_greater(s->p[parent], e)) in min_heap_adjust_()
161 } while (hole_index && min_heap_elem_greater(s->p[parent], e)); in min_heap_shift_up_unconditional_()
168 while (hole_index && min_heap_elem_greater(s->p[parent], e)) in min_heap_shift_up_()
182 min_child -= min_child == s->n || min_heap_elem_greater(s->p[min_child], s->p[min_child - 1]); in min_heap_shift_down_()
183 if (!(min_heap_elem_greater(e, s->p[min_child]))) in min_heap_shift_down_()
|
| /freebsd/contrib/libevent/ |
| H A D | minheap-internal.h | 61 #define min_heap_elem_greater(a, b) \ macro
107 if (e->ev_timeout_pos.min_heap_idx > 0 && min_heap_elem_greater(s->p[parent], last)) in min_heap_erase_()
125 if (e->ev_timeout_pos.min_heap_idx > 0 && min_heap_elem_greater(s->p[parent], e)) in min_heap_adjust_()
161 } while (hole_index && min_heap_elem_greater(s->p[parent], e)); in min_heap_shift_up_unconditional_()
168 while (hole_index && min_heap_elem_greater(s->p[parent], e)) in min_heap_shift_up_()
182 min_child -= min_child == s->n || min_heap_elem_greater(s->p[min_child], s->p[min_child - 1]); in min_heap_shift_down_()
183 if (!(min_heap_elem_greater(e, s->p[min_child]))) in min_heap_shift_down_()
|