net/sched/sch_sfb.c

   1 /*
   2  * net/sched/sch_sfb.c    Stochastic Fair Blue
   3  *
   4  * Copyright (c) 2008-2011 Juliusz Chroboczek <jch@pps.jussieu.fr>
   5  * Copyright (c) 2011 Eric Dumazet <eric.dumazet@gmail.com>
   6  *
   7  * This program is free software; you can redistribute it and/or
   8  * modify it under the terms of the GNU General Public License
   9  * version 2 as published by the Free Software Foundation.
  10  *
  11  * W. Feng, D. Kandlur, D. Saha, K. Shin. Blue:
  12  * A New Class of Active Queue Management Algorithms.
  13  * U. Michigan CSE-TR-387-99, April 1999.
  14  *
  15  * http://www.thefengs.com/wuchang/blue/CSE-TR-387-99.pdf
  16  *
  17  */
  18
  19 #include <linux/module.h>
  20 #include <linux/types.h>
  21 #include <linux/kernel.h>
  22 #include <linux/errno.h>
  23 #include <linux/skbuff.h>
  24 #include <linux/random.h>
  25 #include <linux/siphash.h>
  26 #include <net/ip.h>
  27 #include <net/pkt_sched.h>
  28 #include <net/pkt_cls.h>
  29 #include <net/inet_ecn.h>
  30
  31 /*
  32  * SFB uses two B[l][n] : L x N arrays of bins (L levels, N bins per level)
  33  * This implementation uses L = 8 and N = 16
  34  * This permits us to split one 32bit hash (provided per packet by rxhash or
  35  * external classifier) into 8 subhashes of 4 bits.
  36  */
  37 #define SFB_BUCKET_SHIFT 4
  38 #define SFB_NUMBUCKETS  (1 << SFB_BUCKET_SHIFT) /* N bins per Level */
  39 #define SFB_BUCKET_MASK (SFB_NUMBUCKETS - 1)
  40 #define SFB_LEVELS      (32 / SFB_BUCKET_SHIFT) /* L */
  41
  42 /* SFB algo uses a virtual queue, named "bin" */
  43 struct sfb_bucket {
  44         u16             qlen; /* length of virtual queue */
  45         u16             p_mark; /* marking probability */
  46 };
  47
  48 /* We use a double buffering right before hash change
  49  * (Section 4.4 of SFB reference : moving hash functions)
  50  */
  51 struct sfb_bins {
  52         siphash_key_t     perturbation; /* siphash key */
  53         struct sfb_bucket bins[SFB_LEVELS][SFB_NUMBUCKETS];
  54 };
  55
  56 struct sfb_sched_data {
  57         struct Qdisc    *qdisc;
  58         struct tcf_proto __rcu *filter_list;
  59         struct tcf_block *block;
  60         unsigned long   rehash_interval;
  61         unsigned long   warmup_time;    /* double buffering warmup time in jiffies */
  62         u32             max;
  63         u32             bin_size;       /* maximum queue length per bin */
  64         u32             increment;      /* d1 */
  65         u32             decrement;      /* d2 */
  66         u32             limit;          /* HARD maximal queue length */
  67         u32             penalty_rate;
  68         u32             penalty_burst;
  69         u32             tokens_avail;
  70         unsigned long   rehash_time;
  71         unsigned long   token_time;
  72
  73         u8              slot;           /* current active bins (0 or 1) */
  74         bool            double_buffering;
  75         struct sfb_bins bins[2];
  76
  77         struct {
  78                 u32     earlydrop;
  79                 u32     penaltydrop;
  80                 u32     bucketdrop;
  81                 u32     queuedrop;
  82                 u32     childdrop;      /* drops in child qdisc */
  83                 u32     marked;         /* ECN mark */
  84         } stats;
  85 };
  86
  87 /*
  88  * Each queued skb might be hashed on one or two bins
  89  * We store in skb_cb the two hash values.
  90  * (A zero value means double buffering was not used)
  91  */
  92 struct sfb_skb_cb {
  93         u32 hashes[2];
  94 };
  95
  96 static inline struct sfb_skb_cb *sfb_skb_cb(const struct sk_buff *skb)
  97 {
  98         qdisc_cb_private_validate(skb, sizeof(struct sfb_skb_cb));
  99         return (struct sfb_skb_cb *)qdisc_skb_cb(skb)->data;
 100 }
 101
 102 /*
 103  * If using 'internal' SFB flow classifier, hash comes from skb rxhash
 104  * If using external classifier, hash comes from the classid.
 105  */
 106 static u32 sfb_hash(const struct sk_buff *skb, u32 slot)
 107 {
 108         return sfb_skb_cb(skb)->hashes[slot];
 109 }
 110
 111 /* Probabilities are coded as Q0.16 fixed-point values,
 112  * with 0xFFFF representing 65535/65536 (almost 1.0)
 113  * Addition and subtraction are saturating in [0, 65535]
 114  */
 115 static u32 prob_plus(u32 p1, u32 p2)
 116 {
 117         u32 res = p1 + p2;
 118
 119         return min_t(u32, res, SFB_MAX_PROB);
 120 }
 121
 122 static u32 prob_minus(u32 p1, u32 p2)
 123 {
 124         return p1 > p2 ? p1 - p2 : 0;
 125 }
 126
 127 static void increment_one_qlen(u32 sfbhash, u32 slot, struct sfb_sched_data *q)
 128 {
 129         int i;
 130         struct sfb_bucket *b = &q->bins[slot].bins[0][0];
 131
 132         for (i = 0; i < SFB_LEVELS; i++) {
 133                 u32 hash = sfbhash & SFB_BUCKET_MASK;
 134
 135                 sfbhash >>= SFB_BUCKET_SHIFT;
 136                 if (b[hash].qlen < 0xFFFF)
 137                         b[hash].qlen++;
 138                 b += SFB_NUMBUCKETS; /* next level */
 139         }
 140 }
 141
 142 static void increment_qlen(const struct sk_buff *skb, struct sfb_sched_data *q)
 143 {
 144         u32 sfbhash;
 145
 146         sfbhash = sfb_hash(skb, 0);
 147         if (sfbhash)
 148                 increment_one_qlen(sfbhash, 0, q);
 149
 150         sfbhash = sfb_hash(skb, 1);
 151         if (sfbhash)
 152                 increment_one_qlen(sfbhash, 1, q);
 153 }
 154
 155 static void decrement_one_qlen(u32 sfbhash, u32 slot,
 156                                struct sfb_sched_data *q)
 157 {
 158         int i;
 159         struct sfb_bucket *b = &q->bins[slot].bins[0][0];
 160
 161         for (i = 0; i < SFB_LEVELS; i++) {
 162                 u32 hash = sfbhash & SFB_BUCKET_MASK;
 163
 164                 sfbhash >>= SFB_BUCKET_SHIFT;
 165                 if (b[hash].qlen > 0)
 166                         b[hash].qlen--;
 167                 b += SFB_NUMBUCKETS; /* next level */
 168         }
 169 }
 170
 171 static void decrement_qlen(const struct sk_buff *skb, struct sfb_sched_data *q)
 172 {
 173         u32 sfbhash;
 174
 175         sfbhash = sfb_hash(skb, 0);
 176         if (sfbhash)
 177                 decrement_one_qlen(sfbhash, 0, q);
 178
 179         sfbhash = sfb_hash(skb, 1);
 180         if (sfbhash)
 181                 decrement_one_qlen(sfbhash, 1, q);
 182 }
 183
 184 static void decrement_prob(struct sfb_bucket *b, struct sfb_sched_data *q)
 185 {
 186         b->p_mark = prob_minus(b->p_mark, q->decrement);
 187 }
 188
 189 static void increment_prob(struct sfb_bucket *b, struct sfb_sched_data *q)
 190 {
 191         b->p_mark = prob_plus(b->p_mark, q->increment);
 192 }
 193
 194 static void sfb_zero_all_buckets(struct sfb_sched_data *q)
 195 {
 196         memset(&q->bins, 0, sizeof(q->bins));
 197 }
 198
 199 /*
 200  * compute max qlen, max p_mark, and avg p_mark
 201  */
 202 static u32 sfb_compute_qlen(u32 *prob_r, u32 *avgpm_r, const struct sfb_sched_data *q)
 203 {
 204         int i;
 205         u32 qlen = 0, prob = 0, totalpm = 0;
 206         const struct sfb_bucket *b = &q->bins[q->slot].bins[0][0];
 207
 208         for (i = 0; i < SFB_LEVELS * SFB_NUMBUCKETS; i++) {
 209                 if (qlen < b->qlen)
 210                         qlen = b->qlen;
 211                 totalpm += b->p_mark;
 212                 if (prob < b->p_mark)
 213                         prob = b->p_mark;
 214                 b++;
 215         }
 216         *prob_r = prob;
 217         *avgpm_r = totalpm / (SFB_LEVELS * SFB_NUMBUCKETS);
 218         return qlen;
 219 }
 220
 221
 222 static void sfb_init_perturbation(u32 slot, struct sfb_sched_data *q)
 223 {
 224         get_random_bytes(&q->bins[slot].perturbation,
 225                          sizeof(q->bins[slot].perturbation));
 226 }
 227
 228 static void sfb_swap_slot(struct sfb_sched_data *q)
 229 {
 230         sfb_init_perturbation(q->slot, q);
 231         q->slot ^= 1;
 232         q->double_buffering = false;
 233 }
 234
 235 /* Non elastic flows are allowed to use part of the bandwidth, expressed
 236  * in "penalty_rate" packets per second, with "penalty_burst" burst
 237  */
 238 static bool sfb_rate_limit(struct sk_buff *skb, struct sfb_sched_data *q)
 239 {
 240         if (q->penalty_rate == 0 || q->penalty_burst == 0)
 241                 return true;
 242
 243         if (q->tokens_avail < 1) {
 244                 unsigned long age = min(10UL * HZ, jiffies - q->token_time);
 245
 246                 q->tokens_avail = (age * q->penalty_rate) / HZ;
 247                 if (q->tokens_avail > q->penalty_burst)
 248                         q->tokens_avail = q->penalty_burst;
 249                 q->token_time = jiffies;
 250                 if (q->tokens_avail < 1)
 251                         return true;
 252         }
 253
 254         q->tokens_avail--;
 255         return false;
 256 }
 257
 258 static bool sfb_classify(struct sk_buff *skb, struct tcf_proto *fl,
 259                          int *qerr, u32 *salt)
 260 {
 261         struct tcf_result res;
 262         int result;
 263
 264         result = tcf_classify(skb, fl, &res, false);
 265         if (result >= 0) {
 266 #ifdef CONFIG_NET_CLS_ACT
 267                 switch (result) {
 268                 case TC_ACT_STOLEN:
 269                 case TC_ACT_QUEUED:
 270                 case TC_ACT_TRAP:
 271                         *qerr = NET_XMIT_SUCCESS | __NET_XMIT_STOLEN;
 272                         /* fall through */
 273                 case TC_ACT_SHOT:
 274                         return false;
 275                 }
 276 #endif
 277                 *salt = TC_H_MIN(res.classid);
 278                 return true;
 279         }
 280         return false;
 281 }
 282
 283 static int sfb_enqueue(struct sk_buff *skb, struct Qdisc *sch,
 284                        struct sk_buff **to_free)
 285 {
 286
 287         struct sfb_sched_data *q = qdisc_priv(sch);
 288         struct Qdisc *child = q->qdisc;
 289         struct tcf_proto *fl;
 290         int i;
 291         u32 p_min = ~0;
 292         u32 minqlen = ~0;
 293         u32 r, sfbhash;
 294         u32 slot = q->slot;
 295         int ret = NET_XMIT_SUCCESS | __NET_XMIT_BYPASS;
 296
 297         if (unlikely(sch->q.qlen >= q->limit)) {
 298                 qdisc_qstats_overlimit(sch);
 299                 q->stats.queuedrop++;
 300                 goto drop;
 301         }
 302
 303         if (q->rehash_interval > 0) {
 304                 unsigned long limit = q->rehash_time + q->rehash_interval;
 305
 306                 if (unlikely(time_after(jiffies, limit))) {
 307                         sfb_swap_slot(q);
 308                         q->rehash_time = jiffies;
 309                 } else if (unlikely(!q->double_buffering && q->warmup_time > 0 &&
 310                                     time_after(jiffies, limit - q->warmup_time))) {
 311                         q->double_buffering = true;
 312                 }
 313         }
 314
 315         fl = rcu_dereference_bh(q->filter_list);
 316         if (fl) {
 317                 u32 salt;
 318
 319                 /* If using external classifiers, get result and record it. */
 320                 if (!sfb_classify(skb, fl, &ret, &salt))
 321                         goto other_drop;
 322                 sfbhash = siphash_1u32(salt, &q->bins[slot].perturbation);
 323         } else {
 324                 sfbhash = skb_get_hash_perturb(skb, &q->bins[slot].perturbation);
 325         }
 326
 327
 328         if (!sfbhash)
 329                 sfbhash = 1;
 330         sfb_skb_cb(skb)->hashes[slot] = sfbhash;
 331
 332         for (i = 0; i < SFB_LEVELS; i++) {
 333                 u32 hash = sfbhash & SFB_BUCKET_MASK;
 334                 struct sfb_bucket *b = &q->bins[slot].bins[i][hash];
 335
 336                 sfbhash >>= SFB_BUCKET_SHIFT;
 337                 if (b->qlen == 0)
 338                         decrement_prob(b, q);
 339                 else if (b->qlen >= q->bin_size)
 340                         increment_prob(b, q);
 341                 if (minqlen > b->qlen)
 342                         minqlen = b->qlen;
 343                 if (p_min > b->p_mark)
 344                         p_min = b->p_mark;
 345         }
 346
 347         slot ^= 1;
 348         sfb_skb_cb(skb)->hashes[slot] = 0;
 349
 350         if (unlikely(minqlen >= q->max)) {
 351                 qdisc_qstats_overlimit(sch);
 352                 q->stats.bucketdrop++;
 353                 goto drop;
 354         }
 355
 356         if (unlikely(p_min >= SFB_MAX_PROB)) {
 357                 /* Inelastic flow */
 358                 if (q->double_buffering) {
 359                         sfbhash = skb_get_hash_perturb(skb,
 360                             &q->bins[slot].perturbation);
 361                         if (!sfbhash)
 362                                 sfbhash = 1;
 363                         sfb_skb_cb(skb)->hashes[slot] = sfbhash;
 364
 365                         for (i = 0; i < SFB_LEVELS; i++) {
 366                                 u32 hash = sfbhash & SFB_BUCKET_MASK;
 367                                 struct sfb_bucket *b = &q->bins[slot].bins[i][hash];
 368
 369                                 sfbhash >>= SFB_BUCKET_SHIFT;
 370                                 if (b->qlen == 0)
 371                                         decrement_prob(b, q);
 372                                 else if (b->qlen >= q->bin_size)
 373                                         increment_prob(b, q);
 374                         }
 375                 }
 376                 if (sfb_rate_limit(skb, q)) {
 377                         qdisc_qstats_overlimit(sch);
 378                         q->stats.penaltydrop++;
 379                         goto drop;
 380                 }
 381                 goto enqueue;
 382         }
 383
 384         r = prandom_u32() & SFB_MAX_PROB;
 385
 386         if (unlikely(r < p_min)) {
 387                 if (unlikely(p_min > SFB_MAX_PROB / 2)) {
 388                         /* If we're marking that many packets, then either
 389                          * this flow is unresponsive, or we're badly congested.
 390                          * In either case, we want to start dropping packets.
 391                          */
 392                         if (r < (p_min - SFB_MAX_PROB / 2) * 2) {
 393                                 q->stats.earlydrop++;
 394                                 goto drop;
 395                         }
 396                 }
 397                 if (INET_ECN_set_ce(skb)) {
 398                         q->stats.marked++;
 399                 } else {
 400                         q->stats.earlydrop++;
 401                         goto drop;
 402                 }
 403         }
 404
 405 enqueue:
 406         ret = qdisc_enqueue(skb, child, to_free);
 407         if (likely(ret == NET_XMIT_SUCCESS)) {
 408                 qdisc_qstats_backlog_inc(sch, skb);
 409                 sch->q.qlen++;
 410                 increment_qlen(skb, q);
 411         } else if (net_xmit_drop_count(ret)) {
 412                 q->stats.childdrop++;
 413                 qdisc_qstats_drop(sch);
 414         }
 415         return ret;
 416
 417 drop:
 418         qdisc_drop(skb, sch, to_free);
 419         return NET_XMIT_CN;
 420 other_drop:
 421         if (ret & __NET_XMIT_BYPASS)
 422                 qdisc_qstats_drop(sch);
 423         kfree_skb(skb);
 424         return ret;
 425 }
 426
 427 static struct sk_buff *sfb_dequeue(struct Qdisc *sch)
 428 {
 429         struct sfb_sched_data *q = qdisc_priv(sch);
 430         struct Qdisc *child = q->qdisc;
 431         struct sk_buff *skb;
 432
 433         skb = child->dequeue(q->qdisc);
 434
 435         if (skb) {
 436                 qdisc_bstats_update(sch, skb);
 437                 qdisc_qstats_backlog_dec(sch, skb);
 438                 sch->q.qlen--;
 439                 decrement_qlen(skb, q);
 440         }
 441
 442         return skb;
 443 }
 444
 445 static struct sk_buff *sfb_peek(struct Qdisc *sch)
 446 {
 447         struct sfb_sched_data *q = qdisc_priv(sch);
 448         struct Qdisc *child = q->qdisc;
 449
 450         return child->ops->peek(child);
 451 }
 452
 453 /* No sfb_drop -- impossible since the child doesn't return the dropped skb. */
 454
 455 static void sfb_reset(struct Qdisc *sch)
 456 {
 457         struct sfb_sched_data *q = qdisc_priv(sch);
 458
 459         qdisc_reset(q->qdisc);
 460         sch->qstats.backlog = 0;
 461         sch->q.qlen = 0;
 462         q->slot = 0;
 463         q->double_buffering = false;
 464         sfb_zero_all_buckets(q);
 465         sfb_init_perturbation(0, q);
 466 }
 467
 468 static void sfb_destroy(struct Qdisc *sch)
 469 {
 470         struct sfb_sched_data *q = qdisc_priv(sch);
 471
 472         tcf_block_put(q->block);
 473         qdisc_destroy(q->qdisc);
 474 }
 475
 476 static const struct nla_policy sfb_policy[TCA_SFB_MAX + 1] = {
 477         [TCA_SFB_PARMS] = { .len = sizeof(struct tc_sfb_qopt) },
 478 };
 479
 480 static const struct tc_sfb_qopt sfb_default_ops = {
 481         .rehash_interval = 600 * MSEC_PER_SEC,
 482         .warmup_time = 60 * MSEC_PER_SEC,
 483         .limit = 0,
 484         .max = 25,
 485         .bin_size = 20,
 486         .increment = (SFB_MAX_PROB + 500) / 1000, /* 0.1 % */
 487         .decrement = (SFB_MAX_PROB + 3000) / 6000,
 488         .penalty_rate = 10,
 489         .penalty_burst = 20,
 490 };
 491
 492 static int sfb_change(struct Qdisc *sch, struct nlattr *opt)
 493 {
 494         struct sfb_sched_data *q = qdisc_priv(sch);
 495         struct Qdisc *child;
 496         struct nlattr *tb[TCA_SFB_MAX + 1];
 497         const struct tc_sfb_qopt *ctl = &sfb_default_ops;
 498         u32 limit;
 499         int err;
 500
 501         if (opt) {
 502                 err = nla_parse_nested(tb, TCA_SFB_MAX, opt, sfb_policy, NULL);
 503                 if (err < 0)
 504                         return -EINVAL;
 505
 506                 if (tb[TCA_SFB_PARMS] == NULL)
 507                         return -EINVAL;
 508
 509                 ctl = nla_data(tb[TCA_SFB_PARMS]);
 510         }
 511
 512         limit = ctl->limit;
 513         if (limit == 0)
 514                 limit = qdisc_dev(sch)->tx_queue_len;
 515
 516         child = fifo_create_dflt(sch, &pfifo_qdisc_ops, limit);
 517         if (IS_ERR(child))
 518                 return PTR_ERR(child);
 519
 520         if (child != &noop_qdisc)
 521                 qdisc_hash_add(child, true);
 522         sch_tree_lock(sch);
 523
 524         qdisc_tree_reduce_backlog(q->qdisc, q->qdisc->q.qlen,
 525                                   q->qdisc->qstats.backlog);
 526         qdisc_destroy(q->qdisc);
 527         q->qdisc = child;
 528
 529         q->rehash_interval = msecs_to_jiffies(ctl->rehash_interval);
 530         q->warmup_time = msecs_to_jiffies(ctl->warmup_time);
 531         q->rehash_time = jiffies;
 532         q->limit = limit;
 533         q->increment = ctl->increment;
 534         q->decrement = ctl->decrement;
 535         q->max = ctl->max;
 536         q->bin_size = ctl->bin_size;
 537         q->penalty_rate = ctl->penalty_rate;
 538         q->penalty_burst = ctl->penalty_burst;
 539         q->tokens_avail = ctl->penalty_burst;
 540         q->token_time = jiffies;
 541
 542         q->slot = 0;
 543         q->double_buffering = false;
 544         sfb_zero_all_buckets(q);
 545         sfb_init_perturbation(0, q);
 546         sfb_init_perturbation(1, q);
 547
 548         sch_tree_unlock(sch);
 549
 550         return 0;
 551 }
 552
 553 static int sfb_init(struct Qdisc *sch, struct nlattr *opt)
 554 {
 555         struct sfb_sched_data *q = qdisc_priv(sch);
 556         int err;
 557
 558         err = tcf_block_get(&q->block, &q->filter_list, sch);
 559         if (err)
 560                 return err;
 561
 562         q->qdisc = &noop_qdisc;
 563         return sfb_change(sch, opt);
 564 }
 565
 566 static int sfb_dump(struct Qdisc *sch, struct sk_buff *skb)
 567 {
 568         struct sfb_sched_data *q = qdisc_priv(sch);
 569         struct nlattr *opts;
 570         struct tc_sfb_qopt opt = {
 571                 .rehash_interval = jiffies_to_msecs(q->rehash_interval),
 572                 .warmup_time = jiffies_to_msecs(q->warmup_time),
 573                 .limit = q->limit,
 574                 .max = q->max,
 575                 .bin_size = q->bin_size,
 576                 .increment = q->increment,
 577                 .decrement = q->decrement,
 578                 .penalty_rate = q->penalty_rate,
 579                 .penalty_burst = q->penalty_burst,
 580         };
 581
 582         sch->qstats.backlog = q->qdisc->qstats.backlog;
 583         opts = nla_nest_start(skb, TCA_OPTIONS);
 584         if (opts == NULL)
 585                 goto nla_put_failure;
 586         if (nla_put(skb, TCA_SFB_PARMS, sizeof(opt), &opt))
 587                 goto nla_put_failure;
 588         return nla_nest_end(skb, opts);
 589
 590 nla_put_failure:
 591         nla_nest_cancel(skb, opts);
 592         return -EMSGSIZE;
 593 }
 594
 595 static int sfb_dump_stats(struct Qdisc *sch, struct gnet_dump *d)
 596 {
 597         struct sfb_sched_data *q = qdisc_priv(sch);
 598         struct tc_sfb_xstats st = {
 599                 .earlydrop = q->stats.earlydrop,
 600                 .penaltydrop = q->stats.penaltydrop,
 601                 .bucketdrop = q->stats.bucketdrop,
 602                 .queuedrop = q->stats.queuedrop,
 603                 .childdrop = q->stats.childdrop,
 604                 .marked = q->stats.marked,
 605         };
 606
 607         st.maxqlen = sfb_compute_qlen(&st.maxprob, &st.avgprob, q);
 608
 609         return gnet_stats_copy_app(d, &st, sizeof(st));
 610 }
 611
 612 static int sfb_dump_class(struct Qdisc *sch, unsigned long cl,
 613                           struct sk_buff *skb, struct tcmsg *tcm)
 614 {
 615         return -ENOSYS;
 616 }
 617
 618 static int sfb_graft(struct Qdisc *sch, unsigned long arg, struct Qdisc *new,
 619                      struct Qdisc **old)
 620 {
 621         struct sfb_sched_data *q = qdisc_priv(sch);
 622
 623         if (new == NULL)
 624                 new = &noop_qdisc;
 625
 626         *old = qdisc_replace(sch, new, &q->qdisc);
 627         return 0;
 628 }
 629
 630 static struct Qdisc *sfb_leaf(struct Qdisc *sch, unsigned long arg)
 631 {
 632         struct sfb_sched_data *q = qdisc_priv(sch);
 633
 634         return q->qdisc;
 635 }
 636
 637 static unsigned long sfb_find(struct Qdisc *sch, u32 classid)
 638 {
 639         return 1;
 640 }
 641
 642 static void sfb_unbind(struct Qdisc *sch, unsigned long arg)
 643 {
 644 }
 645
 646 static int sfb_change_class(struct Qdisc *sch, u32 classid, u32 parentid,
 647                             struct nlattr **tca, unsigned long *arg)
 648 {
 649         return -ENOSYS;
 650 }
 651
 652 static int sfb_delete(struct Qdisc *sch, unsigned long cl)
 653 {
 654         return -ENOSYS;
 655 }
 656
 657 static void sfb_walk(struct Qdisc *sch, struct qdisc_walker *walker)
 658 {
 659         if (!walker->stop) {
 660                 if (walker->count >= walker->skip)
 661                         if (walker->fn(sch, 1, walker) < 0) {
 662                                 walker->stop = 1;
 663                                 return;
 664                         }
 665                 walker->count++;
 666         }
 667 }
 668
 669 static struct tcf_block *sfb_tcf_block(struct Qdisc *sch, unsigned long cl)
 670 {
 671         struct sfb_sched_data *q = qdisc_priv(sch);
 672
 673         if (cl)
 674                 return NULL;
 675         return q->block;
 676 }
 677
 678 static unsigned long sfb_bind(struct Qdisc *sch, unsigned long parent,
 679                               u32 classid)
 680 {
 681         return 0;
 682 }
 683
 684
 685 static const struct Qdisc_class_ops sfb_class_ops = {
 686         .graft          =       sfb_graft,
 687         .leaf           =       sfb_leaf,
 688         .find           =       sfb_find,
 689         .change         =       sfb_change_class,
 690         .delete         =       sfb_delete,
 691         .walk           =       sfb_walk,
 692         .tcf_block      =       sfb_tcf_block,
 693         .bind_tcf       =       sfb_bind,
 694         .unbind_tcf     =       sfb_unbind,
 695         .dump           =       sfb_dump_class,
 696 };
 697
 698 static struct Qdisc_ops sfb_qdisc_ops __read_mostly = {
 699         .id             =       "sfb",
 700         .priv_size      =       sizeof(struct sfb_sched_data),
 701         .cl_ops         =       &sfb_class_ops,
 702         .enqueue        =       sfb_enqueue,
 703         .dequeue        =       sfb_dequeue,
 704         .peek           =       sfb_peek,
 705         .init           =       sfb_init,
 706         .reset          =       sfb_reset,
 707         .destroy        =       sfb_destroy,
 708         .change         =       sfb_change,
 709         .dump           =       sfb_dump,
 710         .dump_stats     =       sfb_dump_stats,
 711         .owner          =       THIS_MODULE,
 712 };
 713
 714 static int __init sfb_module_init(void)
 715 {
 716         return register_qdisc(&sfb_qdisc_ops);
 717 }
 718
 719 static void __exit sfb_module_exit(void)
 720 {
 721         unregister_qdisc(&sfb_qdisc_ops);
 722 }
 723
 724 module_init(sfb_module_init)
 725 module_exit(sfb_module_exit)
 726
 727 MODULE_DESCRIPTION("Stochastic Fair Blue queue discipline");
 728 MODULE_AUTHOR("Juliusz Chroboczek");
 729 MODULE_AUTHOR("Eric Dumazet");
 730 MODULE_LICENSE("GPL");