2 * Copyright (c) 1991-1997 Regents of the University of California.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the Network Research
16 * Group at Lawrence Berkeley Laboratory.
17 * 4. Neither the name of the University nor of the Laboratory may be used
18 * to endorse or promote products derived from this software without
19 * specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * $KAME: altq_classq.h,v 1.6 2003/01/07 07:33:38 kjc Exp $
37 * class queue definitions extracted from rm_class.h.
39 #ifndef _ALTQ_ALTQ_CLASSQ_H_
40 #define _ALTQ_ALTQ_CLASSQ_H_
47 * Packet Queue types: RED or DROPHEAD.
49 #define Q_DROPHEAD 0x00
52 #define Q_DROPTAIL 0x03
57 * Packet Queue structures and macros to manipulate them.
59 struct _class_queue_ {
60 struct mbuf *tail_; /* Tail of packet queue */
61 int qlen_; /* Queue length (in number of packets) */
62 int qlim_; /* Queue limit (in number of packets*) */
63 int qtype_; /* Queue type */
66 typedef struct _class_queue_ class_queue_t;
68 #define qtype(q) (q)->qtype_ /* Get queue type */
69 #define qlimit(q) (q)->qlim_ /* Max packets to be queued */
70 #define qlen(q) (q)->qlen_ /* Current queue length. */
71 #define qtail(q) (q)->tail_ /* Tail of the queue */
72 #define qhead(q) ((q)->tail_ ? (q)->tail_->m_nextpkt : NULL)
74 #define qempty(q) ((q)->qlen_ == 0) /* Is the queue empty?? */
75 #define q_is_red(q) ((q)->qtype_ == Q_RED) /* Is the queue a red queue */
76 #define q_is_rio(q) ((q)->qtype_ == Q_RIO) /* Is the queue a rio queue */
77 #define q_is_red_or_rio(q) ((q)->qtype_ == Q_RED || (q)->qtype_ == Q_RIO)
79 #if !defined(__GNUC__) || defined(ALTQ_DEBUG)
81 extern void _addq(class_queue_t *, struct mbuf *);
82 extern struct mbuf *_getq(class_queue_t *);
83 extern struct mbuf *_getq_tail(class_queue_t *);
84 extern struct mbuf *_getq_random(class_queue_t *);
85 extern void _removeq(class_queue_t *, struct mbuf *);
86 extern void _flushq(class_queue_t *);
88 #else /* __GNUC__ && !ALTQ_DEBUG */
93 _addq(class_queue_t *q, struct mbuf *m)
97 if ((m0 = qtail(q)) != NULL)
98 m->m_nextpkt = m0->m_nextpkt;
106 static __inline struct mbuf *
107 _getq(class_queue_t *q)
111 if ((m = qtail(q)) == NULL)
113 if ((m0 = m->m_nextpkt) != m)
114 m->m_nextpkt = m0->m_nextpkt;
118 m0->m_nextpkt = NULL;
122 /* drop a packet at the tail of the queue */
123 static __inline struct mbuf *
124 _getq_tail(class_queue_t *q)
126 struct mbuf *m, *m0, *prev;
128 if ((m = m0 = qtail(q)) == NULL)
134 prev->m_nextpkt = m->m_nextpkt;
144 /* randomly select a packet in the queue */
145 static __inline struct mbuf *
146 _getq_random(class_queue_t *q)
151 if ((m = qtail(q)) == NULL)
153 if (m->m_nextpkt == m)
156 struct mbuf *prev = NULL;
158 n = random() % qlen(q) + 1;
159 for (i = 0; i < n; i++) {
163 prev->m_nextpkt = m->m_nextpkt;
173 _removeq(class_queue_t *q, struct mbuf *m)
175 struct mbuf *m0, *prev;
182 prev->m_nextpkt = m->m_nextpkt;
185 else if (qtail(q) == m)
191 _flushq(class_queue_t *q)
195 while ((m = _getq(q)) != NULL)
199 #endif /* __GNUC__ && !ALTQ_DEBUG */
207 #endif /* _ALTQ_ALTQ_CLASSQ_H_ */