codel: generalize the implementation
This strips out qdisc specific bits from the code and makes it slightly more reusable. Codel will be used by wireless/mac80211 in the future. Signed-off-by: Michal Kazior <michal.kazior@tieto.com> Signed-off-by: David S. Miller <davem@davemloft.net>
Цей коміт міститься в:

зафіксовано
David S. Miller

джерело
e425974fea
коміт
79bdc4c862
@@ -176,12 +176,10 @@ struct codel_stats {
|
||||
|
||||
#define CODEL_DISABLED_THRESHOLD INT_MAX
|
||||
|
||||
static void codel_params_init(struct codel_params *params,
|
||||
const struct Qdisc *sch)
|
||||
static void codel_params_init(struct codel_params *params)
|
||||
{
|
||||
params->interval = MS2TIME(100);
|
||||
params->target = MS2TIME(5);
|
||||
params->mtu = psched_mtu(qdisc_dev(sch));
|
||||
params->ce_threshold = CODEL_DISABLED_THRESHOLD;
|
||||
params->ecn = false;
|
||||
}
|
||||
@@ -226,28 +224,38 @@ static codel_time_t codel_control_law(codel_time_t t,
|
||||
return t + reciprocal_scale(interval, rec_inv_sqrt << REC_INV_SQRT_SHIFT);
|
||||
}
|
||||
|
||||
typedef u32 (*codel_skb_len_t)(const struct sk_buff *skb);
|
||||
typedef codel_time_t (*codel_skb_time_t)(const struct sk_buff *skb);
|
||||
typedef void (*codel_skb_drop_t)(struct sk_buff *skb, void *ctx);
|
||||
typedef struct sk_buff * (*codel_skb_dequeue_t)(struct codel_vars *vars,
|
||||
void *ctx);
|
||||
|
||||
static bool codel_should_drop(const struct sk_buff *skb,
|
||||
struct Qdisc *sch,
|
||||
void *ctx,
|
||||
struct codel_vars *vars,
|
||||
struct codel_params *params,
|
||||
struct codel_stats *stats,
|
||||
codel_skb_len_t skb_len_func,
|
||||
codel_skb_time_t skb_time_func,
|
||||
u32 *backlog,
|
||||
codel_time_t now)
|
||||
{
|
||||
bool ok_to_drop;
|
||||
u32 skb_len;
|
||||
|
||||
if (!skb) {
|
||||
vars->first_above_time = 0;
|
||||
return false;
|
||||
}
|
||||
|
||||
vars->ldelay = now - codel_get_enqueue_time(skb);
|
||||
sch->qstats.backlog -= qdisc_pkt_len(skb);
|
||||
skb_len = skb_len_func(skb);
|
||||
vars->ldelay = now - skb_time_func(skb);
|
||||
|
||||
if (unlikely(qdisc_pkt_len(skb) > stats->maxpacket))
|
||||
stats->maxpacket = qdisc_pkt_len(skb);
|
||||
if (unlikely(skb_len > stats->maxpacket))
|
||||
stats->maxpacket = skb_len;
|
||||
|
||||
if (codel_time_before(vars->ldelay, params->target) ||
|
||||
sch->qstats.backlog <= params->mtu) {
|
||||
*backlog <= params->mtu) {
|
||||
/* went below - stay below for at least interval */
|
||||
vars->first_above_time = 0;
|
||||
return false;
|
||||
@@ -264,16 +272,17 @@ static bool codel_should_drop(const struct sk_buff *skb,
|
||||
return ok_to_drop;
|
||||
}
|
||||
|
||||
typedef struct sk_buff * (*codel_skb_dequeue_t)(struct codel_vars *vars,
|
||||
struct Qdisc *sch);
|
||||
|
||||
static struct sk_buff *codel_dequeue(struct Qdisc *sch,
|
||||
static struct sk_buff *codel_dequeue(void *ctx,
|
||||
u32 *backlog,
|
||||
struct codel_params *params,
|
||||
struct codel_vars *vars,
|
||||
struct codel_stats *stats,
|
||||
codel_skb_len_t skb_len_func,
|
||||
codel_skb_time_t skb_time_func,
|
||||
codel_skb_drop_t drop_func,
|
||||
codel_skb_dequeue_t dequeue_func)
|
||||
{
|
||||
struct sk_buff *skb = dequeue_func(vars, sch);
|
||||
struct sk_buff *skb = dequeue_func(vars, ctx);
|
||||
codel_time_t now;
|
||||
bool drop;
|
||||
|
||||
@@ -282,7 +291,8 @@ static struct sk_buff *codel_dequeue(struct Qdisc *sch,
|
||||
return skb;
|
||||
}
|
||||
now = codel_get_time();
|
||||
drop = codel_should_drop(skb, sch, vars, params, stats, now);
|
||||
drop = codel_should_drop(skb, ctx, vars, params, stats,
|
||||
skb_len_func, skb_time_func, backlog, now);
|
||||
if (vars->dropping) {
|
||||
if (!drop) {
|
||||
/* sojourn time below target - leave dropping state */
|
||||
@@ -310,12 +320,15 @@ static struct sk_buff *codel_dequeue(struct Qdisc *sch,
|
||||
vars->rec_inv_sqrt);
|
||||
goto end;
|
||||
}
|
||||
stats->drop_len += qdisc_pkt_len(skb);
|
||||
qdisc_drop(skb, sch);
|
||||
stats->drop_len += skb_len_func(skb);
|
||||
drop_func(skb, ctx);
|
||||
stats->drop_count++;
|
||||
skb = dequeue_func(vars, sch);
|
||||
if (!codel_should_drop(skb, sch,
|
||||
vars, params, stats, now)) {
|
||||
skb = dequeue_func(vars, ctx);
|
||||
if (!codel_should_drop(skb, ctx,
|
||||
vars, params, stats,
|
||||
skb_len_func,
|
||||
skb_time_func,
|
||||
backlog, now)) {
|
||||
/* leave dropping state */
|
||||
vars->dropping = false;
|
||||
} else {
|
||||
@@ -333,13 +346,14 @@ static struct sk_buff *codel_dequeue(struct Qdisc *sch,
|
||||
if (params->ecn && INET_ECN_set_ce(skb)) {
|
||||
stats->ecn_mark++;
|
||||
} else {
|
||||
stats->drop_len += qdisc_pkt_len(skb);
|
||||
qdisc_drop(skb, sch);
|
||||
stats->drop_len += skb_len_func(skb);
|
||||
drop_func(skb, ctx);
|
||||
stats->drop_count++;
|
||||
|
||||
skb = dequeue_func(vars, sch);
|
||||
drop = codel_should_drop(skb, sch, vars, params,
|
||||
stats, now);
|
||||
skb = dequeue_func(vars, ctx);
|
||||
drop = codel_should_drop(skb, ctx, vars, params,
|
||||
stats, skb_len_func,
|
||||
skb_time_func, backlog, now);
|
||||
}
|
||||
vars->dropping = true;
|
||||
/* if min went above target close to when we last went below it
|
||||
|
Посилання в новій задачі
Заблокувати користувача