Searched refs:min_heap_elem_greater (Results 1 - 2 of 2) sorted by relevance

/freebsd-13-stable/contrib/libevent/
H A Dminheap-internal.h61 #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))
125 if (e->ev_timeout_pos.min_heap_idx > 0 && min_heap_elem_greater(s->p[parent], e))
157 } while (hole_index && min_heap_elem_greater(s->p[parent], e));
164 while (hole_index && min_heap_elem_greater(s->p[parent], e))
178 min_child -= min_child == s->n || min_heap_elem_greater(s->p[min_child], s->p[min_child - 1]);
179 if (!(min_heap_elem_greater(e, s->p[min_child])))
/freebsd-13-stable/contrib/ntp/sntp/libevent/
H A Dminheap-internal.h61 #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))
125 if (e->ev_timeout_pos.min_heap_idx > 0 && min_heap_elem_greater(s->p[parent], e))
157 } while (hole_index && min_heap_elem_greater(s->p[parent], e));
164 while (hole_index && min_heap_elem_greater(s->p[parent], e))
178 min_child -= min_child == s->n || min_heap_elem_greater(s->p[min_child], s->p[min_child - 1]);
179 if (!(min_heap_elem_greater(e, s->p[min_child])))

Completed in 56 milliseconds