ANHE_at
/* fast path */ (minpos = pos + 0), (minat = ANHE_at (*minpos));
if ( ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos));
if ( ANHE_at (pos [2]) < minat) (minpos = pos + 2), (minat = ANHE_at (*minpos));
if ( ANHE_at (pos [3]) < minat) (minpos = pos + 3), (minat = ANHE_at (*minpos));
/* slow path */ (minpos = pos + 0), (minat = ANHE_at (*minpos));
if (pos + 1 < E && ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos));
if (pos + 2 < E && ANHE_at (pos [2]) < minat) (minpos = pos + 2), (minat = ANHE_at (*minpos));
if (pos + 3 < E && ANHE_at (pos [3]) < minat) (minpos = pos + 3), (minat = ANHE_at (*minpos));
if (ANHE_at (he) <= minat)
c += c + 1 < N + HEAP0 && ANHE_at (heap [c]) > ANHE_at (heap [c + 1])
if (ANHE_at (he) <= ANHE_at (heap [c]))
if (UPHEAP_DONE (p, k) || ANHE_at (heap [p]) <= ANHE_at (he))
if (k > HEAP0 && ANHE_at (heap [k]) <= ANHE_at (heap [HPARENT (k)]))
assert (("libev: heap condition violated", i == HEAP0 || ANHE_at (heap [HPARENT (i)]) <= ANHE_at (heap [i])));
assert (("libev: heap at cache mismatch", ANHE_at (heap [i]) == ev_at (ANHE_w (heap [i]))));
if (timercnt && ANHE_at (timers [HEAP0]) < mn_now)
while (timercnt && ANHE_at (timers [HEAP0]) < mn_now);
while (periodiccnt && ANHE_at (periodics [HEAP0]) < ev_rt_now)
while (periodiccnt && ANHE_at (periodics [HEAP0]) < ev_rt_now);
ev_tstamp to = ANHE_at (timers [HEAP0]) - mn_now;
ev_tstamp to = ANHE_at (periodics [HEAP0]) - ev_rt_now;