In the current implementation of altq_hfsc.c, whne new queues are being added (by pfctl), each queue is added to the tail of the siblings linked list under the parent queue. On a system with many queues (50,000+) this leads to very long load times at the insertion process must scan the entire list for every new queue, Since this list is unordered, this changes merely adds the new queue to the head of the list rather than the tail. Reviewed by: kp MFC after: 3 weeks Sponsored by: RG Nets Differential Revision: https://reviews.freebsd.org/D35964 |
||
---|---|---|
.. | ||
altq_cbq.c | ||
altq_cbq.h | ||
altq_cdnr.h | ||
altq_classq.h | ||
altq_codel.c | ||
altq_codel.h | ||
altq_fairq.c | ||
altq_fairq.h | ||
altq_hfsc.c | ||
altq_hfsc.h | ||
altq_priq.c | ||
altq_priq.h | ||
altq_red.c | ||
altq_red.h | ||
altq_rio.c | ||
altq_rio.h | ||
altq_rmclass_debug.h | ||
altq_rmclass.c | ||
altq_rmclass.h | ||
altq_subr.c | ||
altq_var.h | ||
altq.h | ||
if_altq.h |