| /freebsd-12.1/sys/netpfil/ipfw/ |
| H A D | dn_sched_fifo.c | 66 fifo_enqueue(struct dn_sch_inst *si, struct dn_queue *q, struct mbuf *m) in fifo_enqueue()
73 return dn_enqueue((struct dn_queue *)(si+1), m, 0); in fifo_enqueue()
79 return dn_dequeue((struct dn_queue *)(si + 1)); in fifo_dequeue()
86 struct dn_queue *q = (struct dn_queue *)(si + 1); in fifo_new_sched()
97 struct dn_queue *q = (struct dn_queue *)(si + 1); in fifo_free_sched()
114 _SI( .si_datalen = ) sizeof(struct dn_queue),
|
| H A D | dn_aqm.h | 104 int (*enqueue)(struct dn_queue *, struct mbuf *);
105 struct mbuf * (*dequeue)(struct dn_queue *);
108 int (*init)(struct dn_queue *);
109 int (*cleanup)(struct dn_queue *);
124 update_stats(struct dn_queue *q, int len, int drop) in update_stats()
|
| H A D | dn_sched.h | 125 int (*enqueue)(struct dn_sch_inst *, struct dn_queue *,
135 int (*new_queue)(struct dn_queue *q);
136 int (*free_queue)(struct dn_queue *q);
160 int dn_enqueue(struct dn_queue *q, struct mbuf* m, int drop);
169 dn_dequeue(struct dn_queue *q) in dn_dequeue()
|
| H A D | dn_sched_prio.c | 79 struct dn_queue *q_array[MAXPRIO]; /* Array of queues pointers */
87 prio_enqueue(struct dn_sch_inst *_si, struct dn_queue *q, struct mbuf *m) in prio_enqueue()
120 struct dn_queue *q; in prio_dequeue()
163 prio_new_queue(struct dn_queue *q) in prio_new_queue()
167 struct dn_queue *oldq; in prio_new_queue()
198 prio_free_queue(struct dn_queue *q) in prio_free_queue()
|
| H A D | dn_sched_wf2q.c | 99 struct dn_queue _q;
122 struct dn_queue *q = HEAP_TOP(h)->object; in idle_check()
137 wf2qp_enqueue(struct dn_sch_inst *_si, struct dn_queue *q, struct mbuf *m) in wf2qp_enqueue()
198 struct dn_queue *q; in wf2qp_dequeue()
304 wf2qp_new_queue(struct dn_queue *_q) in wf2qp_new_queue()
325 wf2qp_free_queue(struct dn_queue *q) in wf2qp_free_queue()
363 sizeof(struct dn_queue),
|
| H A D | dn_sched_rr.c | 61 struct dn_queue q; /* Standard queue */
153 rr_enqueue(struct dn_sch_inst *_si, struct dn_queue *q, struct mbuf *m) in rr_enqueue()
258 rr_new_queue(struct dn_queue *_q) in rr_new_queue()
283 rr_free_queue(struct dn_queue *_q) in rr_free_queue()
307 _SI( .q_datalen = ) sizeof(struct rr_queue) - sizeof(struct dn_queue),
|
| H A D | dn_aqm_codel.c | 189 codel_extract_head(struct dn_queue *q, aqm_time_t *pkt_ts) in codel_extract_head()
221 aqm_codel_enqueue(struct dn_queue *q, struct mbuf *m) in aqm_codel_enqueue()
277 aqm_codel_dequeue(struct dn_queue *q) in aqm_codel_dequeue()
287 aqm_codel_init(struct dn_queue *q) in aqm_codel_init()
322 aqm_codel_cleanup(struct dn_queue *q) in aqm_codel_cleanup()
|
| H A D | dn_aqm_codel.h | 77 struct mbuf *codel_extract_head(struct dn_queue *, aqm_time_t *);
82 codel_dodequeue(struct dn_queue *q, aqm_time_t now, uint16_t *ok_to_drop) in codel_dodequeue()
135 codel_dequeue(struct dn_queue *q) in codel_dequeue()
|
| H A D | ip_dn_private.h | 83 SLIST_HEAD(dn_queue_head, dn_queue);
258 struct dn_queue { struct
262 SLIST_ENTRY(dn_queue) q_next; /* hash chain list for qht */ argument
399 struct dn_queue *ipdn_q_find(struct dn_fsk *, struct dn_sch_inst *,
|
| H A D | ip_dummynet.c | 304 &((struct dn_queue *)key)->ni.fid : in q_hash()
313 struct dn_queue *o = (struct dn_queue *)obj; in q_match()
331 struct dn_queue *q, *template = arg; in q_new()
431 struct dn_queue *
435 struct dn_queue template; in ipdn_q_find()
444 offsetof(struct dn_queue, q_next), in ipdn_q_find()
456 return (struct dn_queue *)fs->qht; in ipdn_q_find()
567 struct dn_queue *q = (struct dn_queue *)(si + 1); in si_destroy()
681 struct dn_queue *q = _q; in q_cleanup_q()
994 struct dn_queue *q = obj; in copy_q_cb()
[all …]
|
| H A D | dn_aqm_pie.c | 328 pie_extract_head(struct dn_queue *q, aqm_time_t *pkt_ts, int getts) in pie_extract_head()
404 aqm_pie_dequeue(struct dn_queue *q) in aqm_pie_dequeue()
478 aqm_pie_enqueue(struct dn_queue *q, struct mbuf* m) in aqm_pie_enqueue()
573 aqm_pie_init(struct dn_queue *q) in aqm_pie_init()
642 aqm_pie_cleanup(struct dn_queue *q) in aqm_pie_cleanup()
|
| H A D | dn_sched_fq_codel.c | 289 fq_codel_enqueue(struct dn_sch_inst *_si, struct dn_queue *_q, in fq_codel_enqueue()
295 struct dn_queue *mainq; in fq_codel_enqueue()
298 mainq = (struct dn_queue *)(_si + 1); in fq_codel_enqueue()
438 struct dn_queue *q; in fq_codel_new_sched()
|
| H A D | dn_sched_qfq.c | 208 struct dn_queue _q;
303 qfq_new_queue(struct dn_queue *_q) in qfq_new_queue()
334 qfq_free_queue(struct dn_queue *_q) in qfq_free_queue()
655 qfq_enqueue(struct dn_sch_inst *si, struct dn_queue *_q, struct mbuf *m) in qfq_enqueue()
835 _SI( .q_datalen = ) sizeof(struct qfq_class) - sizeof(struct dn_queue),
|
| H A D | dn_aqm_pie.h | 86 struct dn_queue *pq;
|
| H A D | dn_sched_fq_pie.c | 139 struct dn_queue main_q; /* main queue is after si directly */
860 fq_pie_enqueue(struct dn_sch_inst *_si, struct dn_queue *_q, in fq_pie_enqueue()
866 struct dn_queue *mainq; in fq_pie_enqueue()
870 mainq = (struct dn_queue *)(_si + 1); in fq_pie_enqueue()
1010 struct dn_queue *q; in fq_pie_new_sched()
|
| H A D | dn_sched_fq_codel.h | 78 struct dn_queue main_q; /* main queue is after si directly */
|
| H A D | ip_dn_io.c | 321 red_drops (struct dn_queue *q, int len) in red_drops()
491 dn_enqueue(struct dn_queue *q, struct mbuf* m, int drop) in dn_enqueue()
869 struct dn_queue *q = NULL; /* default */ in dummynet_io()
|
| H A D | dummynet.txt | 115 struct dn_queue
119 A dn_queue has a pointer to the dn_fsk (which in turn counts
163 | [dn_queue] | | | [dn_si] |
164 | [dn_queue] | | | [dn_si] |
167 | |dn_queue| | | | |dn_si | |
760 A struct dn_queue contains packets belonging to a queue and some statistical
764 struct dn_queue q;
833 - int (*create_queue_alg)(struct dn_queue *q, struct gen *f);
836 - int (*delete_queue_alg)(struct dn_queue *q);
|
| /freebsd-12.1/sys/netpfil/ipfw/test/ |
| H A D | main.c | 54 int (*enq)(struct dn_sch_inst *, struct dn_queue *,
99 #define FI2Q(c, i) ((struct dn_queue *)((c)->q + (c)->q_len * (i)))
115 struct dn_queue *q; in drop()
174 struct dn_queue *_q = FI2Q(c, mb->flow_id); in gnet_stats_enq()
186 struct dn_queue *_q = FI2Q(c, mb->flow_id); in gnet_stats_deq()
216 struct dn_queue *q = FI2Q(c, m->flow_id); in mainloop()
417 struct dn_queue *q = FI2Q(c, j); in parse_flowsets()
443 c->q_len = sizeof(struct dn_queue); in init()
589 struct dn_queue *q = FI2Q(c, i); in init()
673 struct dn_queue *q; in controller()
[all …]
|
| H A D | test_dn_sched.c | 37 struct dn_queue *q = _q; in dn_delete_queue()
55 dn_enqueue(struct dn_queue *q, struct mbuf* m, int drop) in dn_enqueue()
|