60 struct fq_flow {  struct
71 	struct fq_flow *next;		/* next pointer in RR lists, or &detached */  argument
78 	struct fq_flow *first;  argument
79 	struct fq_flow *last;
90 	struct fq_flow	internal;	/* for non classified or high prio packets */
116 static struct fq_flow detached, throttled;
118 static void fq_flow_set_detached(struct fq_flow *f)  in fq_flow_set_detached()
124 static bool fq_flow_is_detached(const struct fq_flow *f)  in fq_flow_is_detached()
129 static void fq_flow_set_throttled(struct fq_sched_data *q, struct fq_flow *f)  in fq_flow_set_throttled()
134 		struct fq_flow *aux;  in fq_flow_set_throttled()
137 		aux = container_of(parent, struct fq_flow, rate_node);  in fq_flow_set_throttled()
156 static void fq_flow_add_tail(struct fq_flow_head *head, struct fq_flow *flow)  in fq_flow_add_tail()
170 static bool fq_gc_candidate(const struct fq_flow *f)  in fq_gc_candidate()
180 	struct fq_flow *f, *tofree[FQ_GC_MAX];  in fq_gc()
189 		f = container_of(parent, struct fq_flow, fq_node);  in fq_gc()
209 		struct fq_flow *f = tofree[--fcnt];  in fq_gc()
216 static struct fq_flow *fq_classify(struct sk_buff *skb, struct fq_sched_data *q)  in fq_classify()
221 	struct fq_flow *f;  in fq_classify()
257 		f = container_of(parent, struct fq_flow, fq_node);  in fq_classify()
299 static struct sk_buff *fq_dequeue_head(struct Qdisc *sch, struct fq_flow *flow)  in fq_dequeue_head()
333 static void flow_queue_add(struct fq_flow *flow, struct sk_buff *skb)  in flow_queue_add()
374 	struct fq_flow *f;  in fq_enqueue()
416 		struct fq_flow *f = container_of(p, struct fq_flow, rate_node);  in fq_check_throttled()
434 	struct fq_flow *f;  in fq_dequeue()
524 	struct fq_flow *f;  in fq_reset()
536 			f = container_of(p, struct fq_flow, fq_node);  in fq_reset()
559 	struct fq_flow *of, *nf;  in fq_rehash()
567 			of = container_of(op, struct fq_flow, fq_node);  in fq_rehash()
580 				nf = container_of(parent, struct fq_flow, fq_node);  in fq_rehash()
858 					   sizeof(struct fq_flow),  in fq_module_init()