fq_flow
struct fq_flow default_flow;
struct fq_flow *flows;
struct fq_flow *,
struct fq_flow *,
flow = list_first_entry(head, struct fq_flow, flowchain);
static struct fq_flow *fq_flow_classify(struct fq *fq,
struct fq_flow *flow;
__fq_adjust_removal(struct fq *fq, struct fq_flow *flow, unsigned int packets,
static struct fq_flow *fq_find_fattest_flow(struct fq *fq)
struct fq_flow *flow = NULL;
struct fq_flow *cur = &fq->flows[i];
struct fq_flow *flow;
struct fq_flow *flow,
struct fq_flow *flow;
struct fq_flow *flow,
struct fq_flow *flow;
flow = list_first_entry(head, struct fq_flow, flowchain);
static void fq_flow_init(struct fq_flow *flow)
struct fq_flow *flow,
struct fq_flow *flow)
static int fq_flow_drop(struct fq *fq, struct fq_flow *flow,
struct fq_flow *flow;
struct fq_flow *flow;
struct fq_flow *flow)
struct fq_flow *flow,
struct fq_flow *flow, struct sk_buff *skb,
struct fq_flow *flow;
sizeof(struct fq_flow),
struct fq_flow internal; /* fastpath queue. */
static void fq_flow_set_detached(struct fq_flow *f)
static bool fq_flow_is_detached(const struct fq_flow *f)
static struct fq_flow throttled;
static bool fq_flow_is_throttled(const struct fq_flow *f)
static void fq_flow_add_tail(struct fq_sched_data *q, struct fq_flow *flow,
static void fq_flow_unset_throttled(struct fq_sched_data *q, struct fq_flow *f)
static void fq_flow_set_throttled(struct fq_sched_data *q, struct fq_flow *f)
struct fq_flow *aux;
aux = rb_entry(parent, struct fq_flow, rate_node);
static bool fq_gc_candidate(const struct fq_flow *f)
struct fq_flow *f, *tofree = NULL;
f = rb_entry(parent, struct fq_flow, fq_node);
static struct fq_flow *fq_classify(struct Qdisc *sch, struct sk_buff *skb,
struct fq_flow *f;
f = rb_entry(parent, struct fq_flow, fq_node);
static struct sk_buff *fq_peek(struct fq_flow *flow)
static void fq_erase_head(struct Qdisc *sch, struct fq_flow *flow,
static void fq_dequeue_skb(struct Qdisc *sch, struct fq_flow *flow,
static void flow_queue_add(struct fq_flow *flow, struct sk_buff *skb)
struct fq_flow *f;
struct fq_flow *f = rb_entry(p, struct fq_flow, rate_node);
struct fq_flow *f;
static void fq_flow_purge(struct fq_flow *flow)
struct fq_flow *f;
f = rb_entry(p, struct fq_flow, fq_node);
struct fq_flow *of, *nf;
of = rb_entry(op, struct fq_flow, fq_node);
nf = rb_entry(parent, struct fq_flow, fq_node);
struct fq_flow *next; /* next pointer in RR lists */
struct fq_flow *first;
struct fq_flow *last;