Searched refs:dn_queue (Results 1 - 13 of 13) sorted by relevance

/freebsd-10.0-release/sys/netpfil/ipfw/
H A Ddn_sched_fifo.c58 fifo_enqueue(struct dn_sch_inst *si, struct dn_queue *q, struct mbuf *m)
64 return dn_enqueue((struct dn_queue *)(si+1), m, 0);
70 return dn_dequeue((struct dn_queue *)(si + 1));
77 struct dn_queue *q = (struct dn_queue *)(si + 1);
88 struct dn_queue *q = (struct dn_queue *)(si + 1);
105 _SI( .si_datalen = ) sizeof(struct dn_queue),
H A Ddn_sched.h123 int (*enqueue)(struct dn_sch_inst *, struct dn_queue *,
133 int (*new_queue)(struct dn_queue *q);
134 int (*free_queue)(struct dn_queue *q);
154 int dn_enqueue(struct dn_queue *q, struct mbuf* m, int drop);
163 dn_dequeue(struct dn_queue *q)
H A Ddn_sched_prio.c71 struct dn_queue *q_array[MAXPRIO]; /* Array of queues pointers */
79 prio_enqueue(struct dn_sch_inst *_si, struct dn_queue *q, struct mbuf *m)
112 struct dn_queue *q;
155 prio_new_queue(struct dn_queue *q)
159 struct dn_queue *oldq;
190 prio_free_queue(struct dn_queue *q)
H A Ddn_sched_wf2q.c91 struct dn_queue _q;
114 struct dn_queue *q = HEAP_TOP(h)->object;
129 wf2qp_enqueue(struct dn_sch_inst *_si, struct dn_queue *q, struct mbuf *m)
190 struct dn_queue *q;
296 wf2qp_new_queue(struct dn_queue *_q)
317 wf2qp_free_queue(struct dn_queue *q)
355 sizeof(struct dn_queue),
H A Ddn_sched_rr.c53 struct dn_queue q; /* Standard queue */
145 rr_enqueue(struct dn_sch_inst *_si, struct dn_queue *q, struct mbuf *m)
248 rr_new_queue(struct dn_queue *_q)
267 rr_free_queue(struct dn_queue *_q)
291 _SI( .q_datalen = ) sizeof(struct rr_queue) - sizeof(struct dn_queue),
H A Dip_dn_private.h81 SLIST_HEAD(dn_queue_head, dn_queue);
244 struct dn_queue { struct
248 SLIST_ENTRY(dn_queue) q_next; /* hash chain list for qht */
363 struct dn_queue *ipdn_q_find(struct dn_fsk *, struct dn_sch_inst *,
H A Ddummynet.txt115 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);
H A Dip_dummynet.c273 &((struct dn_queue *)key)->ni.fid :
282 struct dn_queue *o = (struct dn_queue *)obj;
287 id2 = &((struct dn_queue *)key)->ni.fid;
300 struct dn_queue *q, *template = arg;
329 dn_delete_queue(struct dn_queue *q, int flags)
375 dn_delete_queue((struct dn_queue *)(fs->qht), flags);
385 struct dn_queue *
389 struct dn_queue template;
398 offsetof(struct dn_queue, q_nex
[all...]
H A Ddn_sched_qfq.c194 * This is an overlay of the struct dn_queue
197 struct dn_queue _q;
291 qfq_new_queue(struct dn_queue *_q)
322 qfq_free_queue(struct dn_queue *_q)
634 qfq_enqueue(struct dn_sch_inst *si, struct dn_queue *_q, struct mbuf *m)
814 _SI( .q_datalen = ) sizeof(struct qfq_class) - sizeof(struct dn_queue),
H A Dip_dn_io.c285 red_drops (struct dn_queue *q, int len)
393 dn_enqueue(struct dn_queue *q, struct mbuf* m, int drop)
757 struct dn_queue *q = NULL; /* default */
/freebsd-10.0-release/sys/netpfil/ipfw/test/
H A Dtest_dn_sched.c34 struct dn_queue *q = _q;
50 dn_enqueue(struct dn_queue *q, struct mbuf* m, int drop)
H A Ddn_test.h130 struct dn_queue { struct
151 int (*new_queue)(struct dn_queue *q);
H A Dmain.c51 int (*enq)(struct dn_sch_inst *, struct dn_queue *,
80 /* FI2Q and Q2FI converts from flow_id to dn_queue and back.
83 #define FI2Q(c, i) ((struct dn_queue *)((c)->q + (c)->q_len * (i)))
98 struct dn_queue *q;
186 struct dn_queue *q;
341 struct dn_queue *q = FI2Q(c, j);
355 c->q_len = sizeof(struct dn_queue);
482 struct dn_queue *q = FI2Q(c, i);
559 struct dn_queue *q;
570 q = list_first_entry(h, struct dn_queue, n
[all...]

Completed in 201 milliseconds