sch_red.c (1da177e4c3f41524e886b7f1b8a0c1fc7321cac2) sch_red.c (b03efcfb2180289718991bb984044ce6c5b7d1b0)
1/*
2 * net/sched/sch_red.c Random Early Detection queue.
3 *
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public License
6 * as published by the Free Software Foundation; either version
7 * 2 of the License, or (at your option) any later version.
8 *

--- 371 unchanged lines hidden (view full) ---

380 q->Scell_log = ctl->Scell_log;
381 q->Scell_max = (255<<q->Scell_log);
382 q->qth_min = ctl->qth_min<<ctl->Wlog;
383 q->qth_max = ctl->qth_max<<ctl->Wlog;
384 q->limit = ctl->limit;
385 memcpy(q->Stab, RTA_DATA(tb[TCA_RED_STAB-1]), 256);
386
387 q->qcount = -1;
1/*
2 * net/sched/sch_red.c Random Early Detection queue.
3 *
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public License
6 * as published by the Free Software Foundation; either version
7 * 2 of the License, or (at your option) any later version.
8 *

--- 371 unchanged lines hidden (view full) ---

380 q->Scell_log = ctl->Scell_log;
381 q->Scell_max = (255<<q->Scell_log);
382 q->qth_min = ctl->qth_min<<ctl->Wlog;
383 q->qth_max = ctl->qth_max<<ctl->Wlog;
384 q->limit = ctl->limit;
385 memcpy(q->Stab, RTA_DATA(tb[TCA_RED_STAB-1]), 256);
386
387 q->qcount = -1;
388 if (skb_queue_len(&sch->q) == 0)
388 if (skb_queue_empty(&sch->q))
389 PSCHED_SET_PASTPERFECT(q->qidlestart);
390 sch_tree_unlock(sch);
391 return 0;
392}
393
394static int red_init(struct Qdisc* sch, struct rtattr *opt)
395{
396 return red_change(sch, opt);

--- 63 unchanged lines hidden --- 		389 PSCHED_SET_PASTPERFECT(q->qidlestart);
390 sch_tree_unlock(sch);
391 return 0;
392}
393
394static int red_init(struct Qdisc* sch, struct rtattr *opt)
395{
396 return red_change(sch, opt);

--- 63 unchanged lines hidden ---