sch_htb.c (39fe5434cb9de5da40510028b17b96bc4eb312b3) sch_htb.c (e9bef55d3d062ee7a78fde2913ec87ca9305a1e0)
1/*
2 * net/sched/sch_htb.c Hierarchical token bucket, feed tree version
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 *

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

127 int prio; /* For parent to leaf return possible here */
128 int quantum; /* we do backup. Finally full replacement */
129 /* of un.leaf originals should be done. */
130};
131
132static inline long L2T(struct htb_class *cl, struct qdisc_rate_table *rate,
133 int size)
134{
1/*
2 * net/sched/sch_htb.c Hierarchical token bucket, feed tree version
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 *

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

127 int prio; /* For parent to leaf return possible here */
128 int quantum; /* we do backup. Finally full replacement */
129 /* of un.leaf originals should be done. */
130};
131
132static inline long L2T(struct htb_class *cl, struct qdisc_rate_table *rate,
133 int size)
134{
135 int slot = size >> rate->rate.cell_log;
136 if (slot > 255)
137 return (rate->data[255]*(slot >> 8) + rate->data[slot & 0xFF]);
138 return rate->data[slot];
135 long result = qdisc_l2t(rate, size);
136 return result;
139}
140
141struct htb_sched {
142 struct list_head root; /* root classes list */
143 struct hlist_head hash[HTB_HSIZE]; /* hashed by classid */
144 struct list_head drops[TC_HTB_NUMPRIO];/* active leaves (for drops) */
145
146 /* self list - roots of self generating tree */

--- 1432 unchanged lines hidden --- 		137}
138
139struct htb_sched {
140 struct list_head root; /* root classes list */
141 struct hlist_head hash[HTB_HSIZE]; /* hashed by classid */
142 struct list_head drops[TC_HTB_NUMPRIO];/* active leaves (for drops) */
143
144 /* self list - roots of self generating tree */

--- 1432 unchanged lines hidden ---