Searched refs:min_heap_idx (Results 1 - 4 of 4) sorted by relevance
/external/chromium/third_party/libevent/ |
H A D | min_heap.h | 60 void min_heap_elem_init(struct event* e) { e->min_heap_idx = -1; } 79 e->min_heap_idx = -1; 87 if(((unsigned int)-1) != e->min_heap_idx) 90 unsigned parent = (e->min_heap_idx - 1) / 2; 96 if (e->min_heap_idx > 0 && min_heap_elem_greater(s->p[parent], last)) 97 min_heap_shift_up_(s, e->min_heap_idx, last); 99 min_heap_shift_down_(s, e->min_heap_idx, last); 100 e->min_heap_idx = -1; 127 (s->p[hole_index] = s->p[parent])->min_heap_idx = hole_index; 131 (s->p[hole_index] = e)->min_heap_idx [all...] |
H A D | event.h | 217 unsigned int min_heap_idx; /* for managing timeouts */ member in struct:event
|
/external/chromium_org/third_party/libevent/ |
H A D | min_heap.h | 60 void min_heap_elem_init(struct event* e) { e->min_heap_idx = -1; } 79 e->min_heap_idx = -1; 87 if(((unsigned int)-1) != e->min_heap_idx) 90 unsigned parent = (e->min_heap_idx - 1) / 2; 96 if (e->min_heap_idx > 0 && min_heap_elem_greater(s->p[parent], last)) 97 min_heap_shift_up_(s, e->min_heap_idx, last); 99 min_heap_shift_down_(s, e->min_heap_idx, last); 100 e->min_heap_idx = -1; 127 (s->p[hole_index] = s->p[parent])->min_heap_idx = hole_index; 131 (s->p[hole_index] = e)->min_heap_idx [all...] |
H A D | event.h | 217 unsigned int min_heap_idx; /* for managing timeouts */ member in struct:event
|
Completed in 149 milliseconds