242 	struct ilist qs[MAX_LEVELS];  member
263 		l_init(q->qs + i);  in q_init()
285 	l_add_tail(q->es, q->qs + e->level, e);  in q_push()
293 	l_add_before(q->es, q->qs + e->level, old, e);  in q_push_before()
298 	l_del(q->es, q->qs + e->level, e);  in q_del()
314 		for (e = l_head(q->es, q->qs + level); e; e = l_next(q->es, e)) {  in q_peek()
361 		for (e = l_head(q->es, q->qs + level); e; e = l_next(q->es, e))  in __redist_pop_from()
363 				l_del(q->es, q->qs + e->level, e);  in __redist_pop_from()
420 		l = q->qs + level;  in q_redistribute()
440 		l_above = q->qs + level + 1u;  in q_redistribute()
463 		for (de = l_head(q->es, q->qs + new_level); de; de = l_next(q->es, de)) {  in q_requeue_before()
1386 		for (e = l_head(q->es, q->qs + level); e; e = l_next(q->es, e)) {  in smq_save_hints()