2248 downheap (ANHE *heap, int N, int k)  in downheap()  argument
2250   ANHE he = heap [k];  in downheap()
2251   ANHE *E = heap + N + HEAP0;  in downheap()
2257       ANHE *pos = heap + DHEAP * (k - HEAP0) + HEAP0 + 1;  in downheap()
2280       heap [k] = *minpos;  in downheap()
2283       k = minpos - heap;  in downheap()
2286   heap [k] = he;  in downheap()
2298 downheap (ANHE *heap, int N, int k)  in downheap()  argument
2300   ANHE he = heap [k];  in downheap()
2309       c += c + 1 < N + HEAP0 && ANHE_at (heap [c]) > ANHE_at (heap [c + 1])  in downheap()
2312       if (ANHE_at (he) <= ANHE_at (heap [c]))  in downheap()
2315       heap [k] = heap [c];  in downheap()
2316       ev_active (ANHE_w (heap [k])) = k;  in downheap()
2321   heap [k] = he;  in downheap()
2328 upheap (ANHE *heap, int k)  in upheap()  argument
2330   ANHE he = heap [k];  in upheap()
2336       if (UPHEAP_DONE (p, k) || ANHE_at (heap [p]) <= ANHE_at (he))  in upheap()
2339       heap [k] = heap [p];  in upheap()
2340       ev_active (ANHE_w (heap [k])) = k;  in upheap()
2344   heap [k] = he;  in upheap()
2350 adjustheap (ANHE *heap, int N, int k)  in adjustheap()  argument
2352   if (k > HEAP0 && ANHE_at (heap [k]) <= ANHE_at (heap [HPARENT (k)]))  in adjustheap()
2353     upheap (heap, k);  in adjustheap()
2355     downheap (heap, N, k);  in adjustheap()
2360 reheap (ANHE *heap, int N)  in reheap()  argument
2367     upheap (heap, i + HEAP0);  in reheap()
3110 verify_heap (EV_P_ ANHE *heap, int N)  in verify_heap()  argument
3116       assert (("libev: active index mismatch in heap", ev_active (ANHE_w (heap [i])) == i));  in verify_heap()
3117 …("libev: heap condition violated", i == HEAP0 || ANHE_at (heap [HPARENT (i)]) <= ANHE_at (heap [i]…  in verify_heap()
3118       assert (("libev: heap at cache mismatch", ANHE_at (heap [i]) == ev_at (ANHE_w (heap [i]))));  in verify_heap()
3120       verify_watcher (EV_A_ (W)ANHE_w (heap [i]));  in verify_heap()