257 	struct ilist qs[MAX_LEVELS];  member
278 		l_init(q->qs + i);  in q_init()
302 	l_add_tail(q->es, q->qs + e->level, e);  in q_push()
312 	l_add_head(q->es, q->qs + e->level, e);  in q_push_front()
322 	l_add_before(q->es, q->qs + e->level, old, e);  in q_push_before()
327 	l_del(q->es, q->qs + e->level, e);  in q_del()
343 		for (e = l_head(q->es, q->qs + level); e; e = l_next(q->es, e)) {  in q_peek()
377 		for (e = l_head(q->es, q->qs + level); e; e = l_next(q->es, e))  in __redist_pop_from()
379 				l_del(q->es, q->qs + e->level, e);  in __redist_pop_from()
436 		l = q->qs + level;  in q_redistribute()
456 		l_above = q->qs + level + 1u;  in q_redistribute()
479 		for (de = l_head(q->es, q->qs + new_level); de && de->sentinel; de = l_next(q->es, de))  in q_requeue()