Lines Matching defs:sch
883 struct dn_heap *sch = &(p->scheduler_heap);
904 while ( p_numbytes >=0 && (sch->elements>0 || neh->elements >0) ) {
905 if (sch->elements > 0) { /* have some eligible pkts to send out */
906 struct dn_flow_queue *q = sch->p[0].object ;
912 heap_extract(sch, NULL); /* remove queue from heap */
931 heap_insert(sch, q->F, q);
935 * now compute V = max(V, min(S_i)). Remember that all elements in sch
936 * have by definition S_i <= V so if sch is not empty, V is surely
937 * the max and we must not update it. Conversely, if sch is empty
940 if (sch->elements == 0 && neh->elements > 0)
942 /* move from neh to sch any packets that have become eligible */
946 heap_insert(sch, q->F, q);
954 if (sch->elements == 0 && neh->elements == 0 && p_numbytes >= 0