156 static void     ready_event(struct dn_flow_queue *q, struct mbuf **head,
273 static void cp_queue_to_64_user( struct dn_flow_queue *q, struct dn_flow_queue_64 *qp);
279 static void cp_queue_to_32_user( struct dn_flow_queue *q, struct dn_flow_queue_32 *qp);
482 cp_queue_to_32_user( struct dn_flow_queue *q, struct dn_flow_queue_32 *qp)  in cp_queue_to_32_user()
504 cp_queue_to_64_user( struct dn_flow_queue *q, struct dn_flow_queue_64 *qp)  in cp_queue_to_64_user()
929 move_pkt(struct mbuf *pkt, struct dn_flow_queue *q,  in move_pkt()
957 ready_event(struct dn_flow_queue *q, struct mbuf **head, struct mbuf **tail)  in ready_event()
999 		heap_insert(&ready_heap, curr_time + t, q, sizeof(struct dn_flow_queue));  in ready_event()
1051 			struct dn_flow_queue *q = sch->p[0].object;  in ready_event_wfq()
1065 				heap_insert(&(p->idle_heap), q->F, q, sizeof(struct dn_flow_queue));  in ready_event_wfq()
1074 					heap_insert(neh, q->S, q, sizeof(struct dn_flow_queue));  in ready_event_wfq()
1076 					heap_insert(sch, q->F, q, sizeof(struct dn_flow_queue));  in ready_event_wfq()
1091 			struct dn_flow_queue *q = neh->p[0].object;  in ready_event_wfq()
1093 			heap_insert(sch, q->F, q, sizeof(struct dn_flow_queue));  in ready_event_wfq()
1109 			struct dn_flow_queue *q = p->idle_heap.p[i].object;  in ready_event_wfq()
1213 				struct dn_flow_queue *q = pe->idle_heap.p[0].object;  in dummynet()
1315 	struct dn_flow_queue *q, *prev;  in expire_queues()
1332 				struct dn_flow_queue *old_q = q;  in expire_queues()
1340 				kfree_type(struct dn_flow_queue, old_q);  in expire_queues()
1351 static struct dn_flow_queue *
1354 	struct dn_flow_queue *q;  in create_queue()
1366 	q = kalloc_type(struct dn_flow_queue, Z_NOWAIT | Z_ZERO);  in create_queue()
1385 static struct dn_flow_queue *
1389 	struct dn_flow_queue *q, *prev;  in find_queue()
1465 				struct dn_flow_queue *old_q = q;  in find_queue()
1473 				kfree_type(struct dn_flow_queue, old_q);  in find_queue()
1495 red_drops(struct dn_flow_set *fs, struct dn_flow_queue *q, int len)  in red_drops()
1652 	struct dn_flow_queue *q = NULL;  in dummynet_io()
1824 			heap_insert(&ready_heap, curr_time + t, q, sizeof(struct dn_flow_queue));  in dummynet_io()
1840 			heap_extract(&(pipe->idle_heap), q, sizeof(struct dn_flow_queue));  in dummynet_io()
1867 			heap_insert(&(pipe->not_eligible_heap), q->S, q, sizeof(struct dn_flow_queue));  in dummynet_io()
1869 			heap_insert(&(pipe->scheduler_heap), q->F, q, sizeof(struct dn_flow_queue));  in dummynet_io()
1932 	struct dn_flow_queue *q, *qn;  in purge_flow_set()
1947 			kfree_type(struct dn_flow_queue, q);  in purge_flow_set()
1961 		struct dn_flow_queue ** rq = fs->rq;  in purge_flow_set()
1962 		kfree_type(struct dn_flow_queue *, fs->rq_size + 1, rq);  in purge_flow_set()
2102 		x->rq = kalloc_type(struct dn_flow_queue *, l + 1,  in alloc_hash()
2106 		x->rq = kalloc_type(struct dn_flow_queue *, 1 + 1,  in alloc_hash()
2153 	struct dn_flow_queue *q;  in config_pipe()
2192 			x->idle_heap.offset = offsetof(struct dn_flow_queue, heap_pos);  in config_pipe()
2307 		if (((struct dn_flow_queue *)h->p[i].object)->fs == fs) {  in fs_remove_from_heap()
2463 	struct dn_flow_queue *q;  in dn_copy_set_32()
2528 	struct dn_flow_queue *q;  in dn_copy_set_64()
2638 			    p->fs.rq_elements * sizeof(struct dn_flow_queue);  in dn_calc_size()
2646 			    set->rq_elements * sizeof(struct dn_flow_queue);  in dn_calc_size()