Searched refs:dn_queue (Results 1 - 19 of 19) sorted by relevance
/freebsd-13-stable/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) 73 return dn_enqueue((struct dn_queue *)(si+1), m, 0); 79 return dn_dequeue((struct dn_queue *)(si + 1)); 86 struct dn_queue *q = (struct dn_queue *)(si + 1); 97 struct dn_queue *q = (struct dn_queue *)(si + 1); 114 _SI( .si_datalen = ) sizeof(struct dn_queue),
|
H A D | dn_aqm.h | 102 int (*enqueue)(struct dn_queue *, struct mbuf *); 103 struct mbuf * (*dequeue)(struct dn_queue *); 106 int (*init)(struct dn_queue *); 107 int (*cleanup)(struct dn_queue *); 122 update_stats(struct dn_queue *q, int len, int drop)
|
H A D | dn_sched.h | 127 int (*enqueue)(struct dn_sch_inst *, struct dn_queue *, 137 int (*new_queue)(struct dn_queue *q); 138 int (*free_queue)(struct dn_queue *q); 162 int dn_enqueue(struct dn_queue *q, struct mbuf* m, int drop); 171 dn_dequeue(struct dn_queue *q)
|
H A D | dn_aqm_codel.h | 76 struct mbuf *codel_extract_head(struct dn_queue *, aqm_time_t *); 81 codel_dodequeue(struct dn_queue *q, aqm_time_t now, uint16_t *ok_to_drop) 134 codel_dequeue(struct dn_queue *q)
|
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) 120 struct dn_queue *q; 163 prio_new_queue(struct dn_queue *q) 167 struct dn_queue *oldq; 198 prio_free_queue(struct dn_queue *q)
|
H A D | dn_sched_wf2q.c | 99 struct dn_queue _q; 122 struct dn_queue *q = HEAP_TOP(h)->object; 137 wf2qp_enqueue(struct dn_sch_inst *_si, struct dn_queue *q, struct mbuf *m) 198 struct dn_queue *q; 304 wf2qp_new_queue(struct dn_queue *_q) 325 wf2qp_free_queue(struct dn_queue *q) 363 sizeof(struct dn_queue),
|
H A D | dn_sched_rr.c | 61 struct dn_queue q; /* Standard queue */ 152 rr_enqueue(struct dn_sch_inst *_si, struct dn_queue *q, struct mbuf *m) 257 rr_new_queue(struct dn_queue *_q) 282 rr_free_queue(struct dn_queue *_q) 306 _SI( .q_datalen = ) sizeof(struct rr_queue) - sizeof(struct dn_queue),
|
H A D | dn_aqm_pie.h | 85 struct dn_queue *pq;
|
H A D | ip_dn_private.h | 83 SLIST_HEAD(dn_queue_head, dn_queue); 260 struct dn_queue { struct 264 SLIST_ENTRY(dn_queue) q_next; /* hash chain list for qht */ 414 struct dn_queue *ipdn_q_find(struct dn_fsk *, struct dn_sch_inst *,
|
H A D | dn_aqm_codel.c | 192 codel_extract_head(struct dn_queue *q, aqm_time_t *pkt_ts) 224 aqm_codel_enqueue(struct dn_queue *q, struct mbuf *m) 277 aqm_codel_dequeue(struct dn_queue *q) 287 aqm_codel_init(struct dn_queue *q) 322 aqm_codel_cleanup(struct dn_queue *q)
|
H A D | dn_sched_fq_codel.h | 81 struct dn_queue main_q; /* main queue is after si directly */
|
H A D | ip_dummynet.c | 318 &((struct dn_queue *)key)->ni.fid : 327 struct dn_queue *o = (struct dn_queue *)obj; 332 id2 = &((struct dn_queue *)key)->ni.fid; 345 struct dn_queue *q, *template = arg; 382 dn_delete_queue(struct dn_queue *q, int flags) 435 dn_delete_queue((struct dn_queue *)(fs->qht), flags); 445 struct dn_queue * 449 struct dn_queue template; 458 offsetof(struct dn_queue, q_nex [all...] |
H A D | dn_aqm_pie.c | 328 pie_extract_head(struct dn_queue *q, aqm_time_t *pkt_ts, int getts) 404 aqm_pie_dequeue(struct dn_queue *q) 478 aqm_pie_enqueue(struct dn_queue *q, struct mbuf* m) 572 aqm_pie_init(struct dn_queue *q) 641 aqm_pie_cleanup(struct dn_queue *q)
|
H A D | dn_sched_fq_codel.c | 76 * dn_queue includes many variables not needed by a flow (sub-queue 287 fq_codel_enqueue(struct dn_sch_inst *_si, struct dn_queue *_q, 293 struct dn_queue *mainq; 296 mainq = (struct dn_queue *)(_si + 1); 436 struct dn_queue *q;
|
H A D | dn_sched_fq_pie.c | 140 struct dn_queue main_q; /* main queue is after si directly */ 861 fq_pie_enqueue(struct dn_sch_inst *_si, struct dn_queue *_q, 867 struct dn_queue *mainq; 871 mainq = (struct dn_queue *)(_si + 1); 1011 struct dn_queue *q;
|
H A D | dn_sched_qfq.c | 205 * This is an overlay of the struct dn_queue 208 struct dn_queue _q; 303 qfq_new_queue(struct dn_queue *_q) 334 qfq_free_queue(struct dn_queue *_q) 654 qfq_enqueue(struct dn_sch_inst *si, struct dn_queue *_q, struct mbuf *m) 833 _SI( .q_datalen = ) sizeof(struct qfq_class) - sizeof(struct dn_queue),
|
H A D | ip_dn_io.c | 309 red_drops (struct dn_queue *q, int len) 479 dn_enqueue(struct dn_queue *q, struct mbuf* m, int drop) 864 struct dn_queue *q = NULL; /* default */
|
/freebsd-13-stable/sys/netpfil/ipfw/test/ |
H A D | test_dn_sched.c | 37 struct dn_queue *q = _q; 55 dn_enqueue(struct dn_queue *q, struct mbuf* m, int drop)
|
H A D | main.c | 54 int (*enq)(struct dn_sch_inst *, struct dn_queue *, 96 * to dn_queue and back. We cannot simply use pointer arithmetic 99 #define FI2Q(c, i) ((struct dn_queue *)((c)->q + (c)->q_len * (i))) 115 struct dn_queue *q; 140 default_enqueue(struct dn_sch_inst *si, struct dn_queue *q, struct mbuf *m) 172 struct dn_queue *_q = FI2Q(c, mb->flow_id); 184 struct dn_queue *_q = FI2Q(c, mb->flow_id); 214 struct dn_queue *q = FI2Q(c, m->flow_id); 254 //struct dn_queue *q = FI2Q(c, i); 415 struct dn_queue * [all...] |
Completed in 198 milliseconds