Searched refs:heap (Results 1 – 3 of 3) sorted by relevance
2243 ANHE he = heap [k]; in downheap()2279 heap [k] = he; in downheap()2293 ANHE he = heap [k]; in downheap()2302 c += c + 1 < N + HEAP0 && ANHE_at (heap [c]) > ANHE_at (heap [c + 1]) in downheap()2308 heap [k] = heap [c]; in downheap()2314 heap [k] = he; in downheap()2323 ANHE he = heap [k]; in upheap()2332 heap [k] = heap [p]; in upheap()2337 heap [k] = he; in upheap()2345 if (k > HEAP0 && ANHE_at (heap [k]) <= ANHE_at (heap [HPARENT (k)])) in adjustheap()[all …]
425 - use 1-based 2-heap for EV_MINIMAL, simplifies code, reduces427 - use 3-based 4-heap for !EV_MINIMAL. this makes better use430 - cache timestamp within heap for !EV_MINIMAL, to avoid random
4751 Replaces the small 2-heap for timer management by a faster 4-heap, larger4851 timer and periodics heaps, libev uses a 4-heap when this symbol is defined4852 to C<1>. The 4-heap uses more complicated (longer) code but has noticeably4862 the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>),4864 but avoids random read accesses on heap changes. This improves performance5396 By virtue of using a binary or 4-heap, the next timer is always found at a