Lines Matching refs:alg_fq
115 struct wf2qp_queue *alg_fq = (struct wf2qp_queue *)q;
121 alg_fq->S = alg_fq->F + 1; /* Mark timestamp as invalid. */
133 struct wf2qp_queue *alg_fq;
144 alg_fq = (struct wf2qp_queue *)q;
146 if (DN_KEY_LT(alg_fq->F, alg_fq->S)) {
148 alg_fq->S = si->V; /* init start time */
153 alg_fq->S = MAX64(alg_fq->F, si->V); /* compute new S */
155 alg_fq->F = alg_fq->S + len * alg_fq->inv_w;
159 si->V = MAX64(alg_fq->S, si->V);
172 if (DN_KEY_LT(si->V, alg_fq->S)) {
176 heap_insert(&si->ne_heap, alg_fq->S, q);
178 heap_insert(&si->sch_heap, alg_fq->F, q);
193 struct wf2qp_queue *alg_fq;
228 alg_fq = (struct wf2qp_queue *)q;
230 heap_insert(sch, alg_fq->F, q);
236 alg_fq = (struct wf2qp_queue *)q;
240 alg_fq->S = alg_fq->F; /* Update start time. */
242 heap_insert(&si->idle_heap, alg_fq->F, q);
246 alg_fq->F += len * alg_fq->inv_w;
247 if (DN_KEY_LEQ(alg_fq->S, si->V)) {
248 heap_insert(sch, alg_fq->F, q);
250 heap_insert(neh, alg_fq->S, q);
319 struct wf2qp_queue *alg_fq = (struct wf2qp_queue *)q;
322 if (alg_fq->S >= alg_fq->F + 1)
333 } else if (DN_KEY_LT(si->V, alg_fq->S)) {