Home
last modified time | relevance | path

Searched refs:neh (Results 1 – 2 of 2) sorted by relevance

/dragonfly/sys/net/dummynet/
HDip_dummynet.c535 struct dn_heap *neh = &p->not_eligible_heap; in ready_event_wfq() local
543 while (p->numbytes >= 0 && (sch->elements > 0 || neh->elements > 0)) { in ready_event_wfq()
569 heap_insert(neh, q->S, q); in ready_event_wfq()
581 if (sch->elements == 0 && neh->elements > 0) in ready_event_wfq()
582 p->V = MAX64(p->V, neh->p[0].key); in ready_event_wfq()
587 while (neh->elements > 0 && DN_KEY_LEQ(neh->p[0].key, p->V)) { in ready_event_wfq()
588 struct dn_flow_queue *q = neh->p[0].object; in ready_event_wfq()
590 heap_extract(neh, NULL); in ready_event_wfq()
595 if (sch->elements == 0 && neh->elements == 0 && p->numbytes >= 0 && in ready_event_wfq()
/dragonfly/sys/net/dummynet3/
HDip_dummynet3.c554 struct dn_heap *neh = &p->not_eligible_heap; in ready_event_wfq() local
562 while (p->numbytes >= 0 && (sch->elements > 0 || neh->elements > 0)) { in ready_event_wfq()
588 heap_insert(neh, q->S, q); in ready_event_wfq()
600 if (sch->elements == 0 && neh->elements > 0) in ready_event_wfq()
601 p->V = MAX64(p->V, neh->p[0].key); in ready_event_wfq()
606 while (neh->elements > 0 && DN_KEY_LEQ(neh->p[0].key, p->V)) { in ready_event_wfq()
607 struct dn_flow_queue *q = neh->p[0].object; in ready_event_wfq()
609 heap_extract(neh, NULL); in ready_event_wfq()
614 if (sch->elements == 0 && neh->elements == 0 && p->numbytes >= 0 && in ready_event_wfq()