Lines Matching full:have
190 of traffic, where lower classes are only able to send if higher ones have
195 A class may have multiple children. Some qdiscs allow for runtime addition
199 Qdiscs which allow dynamic addition of classes can have zero or more
207 contain classes, but each class can have only one leaf qdisc.
220 Some qdiscs have built in rules for classifying packets based on the TOS field.
226 Each node within the tree can have its own filters but higher level filters
233 All qdiscs, classes and filters have IDs, which can either be specified
240 A qdisc, which potentially can have children,
243 It is customary to explicitly assign a handle to qdiscs expected to have
248 Classes residing under a qdisc share their qdisc major number, but each have
255 Filters have a three part ID, which is only needed when using a hashed
