Lines Matching refs:sch
191 /* XXX invariant: sch > 0 || V >= min(S in neh) */
199 struct dn_heap *sch = &si->sch_heap;
203 if (sch->elements == 0 && neh->elements == 0) {
224 * in sch have by definition S_i <= V so if sch is not empty,
226 * if sch is empty we only need to look at neh.
230 if (sch->elements == 0 && neh->elements > 0) {
238 heap_insert(sch, alg_fq->F, q);
243 q = HEAP_TOP(sch)->object;
246 heap_extract(sch, NULL); /* Remove queue from heap. */
252 /* Update F, store in neh or sch */
256 heap_insert(sch, alg_fq->F, q);