Lines Matching defs:in
12 * Flows are dynamically allocated and stored in a hash table of RB trees
17 * Transport (eg TCP) can set in sk->sk_pacing_rate a rate, enqueue a
27 * dequeue() : serves flows in Round Robin
38 #include <linux/in.h>
66 * If packets have monotically increasing time_to_send, they are placed in O(1)
67 * in linear list (head,tail), otherwise are placed in a rbtree (t_root).
70 /* First cache line : used in fq_gc(), fq_enqueue(), fq_dequeue() */
74 struct sk_buff *tail; /* last skb in the list */
78 struct rb_node fq_node; /* anchor in fq_root[] trees */
80 * because q->internal is not hashed in fq_root[]
86 int qlen; /* number of packets in flow queue */
91 struct fq_flow *next; /* next pointer in RR lists */
93 struct rb_node rate_node; /* anchor in q->delayed tree */
120 u64 horizon; /* horizon in ns */
128 u32 timer_slack; /* hrtimer slack in ns */
132 unsigned int band_nr; /* band being serviced in fq_dequeue() */
302 * 1) Packet tstamp is in the past.
321 /* Even if some packets are stored in this qdisc,
323 * scheduled in the future (ie no flows are eligible)
324 * or in the fast path queue.
376 * Sockets in TCP_CLOSE are non connected.
550 /* Check if packet timestamp is too far in the future. */
929 static void fq_prio2band_compress_crumb(const u8 *in, u8 *out)
937 tmp[i / 4] |= in[i] << (2 * (i & 0x3));
943 static void fq_prio2band_decompress_crumb(const u8 *in, u8 *out)
949 out[i] = fq_prio2band(in, i);