Lines Matching refs:pri
262 int pri; in fairq_clear_interface() local
265 for (pri = 0; pri <= pif->pif_maxpri; pri++) { in fairq_clear_interface()
266 if ((cl = pif->pif_classes[pri]) != NULL) in fairq_clear_interface()
293 int pri; in fairq_purge() local
295 for (pri = 0; pri <= pif->pif_maxpri; pri++) { in fairq_purge()
296 if ((cl = pif->pif_classes[pri]) != NULL && cl->cl_head) in fairq_purge()
304 fairq_class_create(struct fairq_if *pif, int pri, int qlimit, in fairq_class_create() argument
336 if ((cl = pif->pif_classes[pri]) != NULL) { in fairq_class_create()
366 pif->pif_classes[pri] = cl; in fairq_class_create()
378 cl->cl_pri = pri; in fairq_class_create()
379 if (pri > pif->pif_maxpri) in fairq_class_create()
380 pif->pif_maxpri = pri; in fairq_class_create()
435 int pri; in fairq_class_destroy() local
447 for (pri = cl->cl_pri; pri >= 0; pri--) in fairq_class_destroy()
448 if (pif->pif_classes[pri] != NULL) { in fairq_class_destroy()
449 pif->pif_maxpri = pri; in fairq_class_destroy()
452 if (pri < 0) in fairq_class_destroy()
543 int pri; in fairq_dequeue() local
565 for (pri = pif->pif_maxpri; pri >= 0; pri--) { in fairq_dequeue()
566 if ((cl = pif->pif_classes[pri]) == NULL) in fairq_dequeue()