Home
last modified time | relevance | path

Searched refs:drop_next (Results 1 – 6 of 6) sorted by relevance

/linux/include/net/
H A Dcodel_impl.h172 } else if (codel_time_after_eq(now, vars->drop_next)) { in codel_dequeue()
182 codel_time_after_eq(now, vars->drop_next)) { in codel_dequeue()
191 WRITE_ONCE(vars->drop_next, in codel_dequeue()
192 codel_control_law(vars->drop_next, in codel_dequeue()
210 WRITE_ONCE(vars->drop_next, in codel_dequeue()
211 codel_control_law(vars->drop_next, in codel_dequeue()
239 codel_time_before(now - vars->drop_next, in codel_dequeue()
252 WRITE_ONCE(vars->drop_next, in codel_dequeue()
H A Dcodel.h135 codel_time_t drop_next; member
/linux/net/sched/
H A Dsch_codel.c273 codel_tdiff_t delta = READ_ONCE(q->vars.drop_next) - codel_get_time();
276 st.drop_next = codel_time_to_us(delta); in codel_module_exit()
278 st.drop_next = -codel_time_to_us(-delta);
H A Dsch_cake.c103 * @drop_next: time to drop next packet, or when we dropped last
112 ktime_t drop_next; member
462 WRITE_ONCE(vars->drop_next, now); in cobalt_queue_full()
489 if (vars->count && ktime_to_ns(ktime_sub(now, vars->drop_next)) >= 0) { in cobalt_queue_empty()
492 WRITE_ONCE(vars->drop_next, in cobalt_queue_empty()
493 cobalt_control(vars->drop_next, p->interval, in cobalt_queue_empty()
516 * after 'drop_next'. This allows 'drop_next' to be updated before the next in cobalt_should_drop()
521 * As for 'drop_next', we take advantage of the fact that 'interval' is both in cobalt_should_drop()
531 schedule = ktime_sub(now, vars->drop_next); in cobalt_should_drop()
[all...]
H A Dsch_fq_codel.c705 codel_tdiff_t delta = READ_ONCE(flow->cvars.drop_next) - in fq_codel_walk()
708 xstats.class_stats.drop_next = (delta >= 0) ? in fq_codel_walk()
/linux/tools/include/uapi/linux/
H A Dpkt_sched.h692 __s32 drop_next; /* time to drop next packet */ member
748 __s32 drop_next; member