Searched refs:sch (Results 1 - 1 of 1) sorted by relevance

/darwin-on-arm/xnu/bsd/netinet/
H A Dip_dummynet.c881 struct dn_heap *sch = &(p->scheduler_heap); local
902 while ( p_numbytes >=0 && (sch->elements>0 || neh->elements >0) ) {
903 if (sch->elements > 0) { /* have some eligible pkts to send out */
904 struct dn_flow_queue *q = sch->p[0].object ;
910 heap_extract(sch, NULL); /* remove queue from heap */
929 heap_insert(sch, q->F, q);
933 * now compute V = max(V, min(S_i)). Remember that all elements in sch
934 * have by definition S_i <= V so if sch is not empty, V is surely
935 * the max and we must not update it. Conversely, if sch is empty
938 if (sch
[all...]

Completed in 70 milliseconds