1 /* $KAME: altq_classq.h,v 1.6 2003/01/07 07:33:38 kjc Exp $ */
4 * Copyright (c) 1991-1997 Regents of the University of California.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. All advertising materials mentioning features or use of this software
16 * must display the following acknowledgement:
17 * This product includes software developed by the Network Research
18 * Group at Lawrence Berkeley Laboratory.
19 * 4. Neither the name of the University nor of the Laboratory may be used
20 * to endorse or promote products derived from this software without
21 * specific prior written permission.
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * class queue definitions extracted from rm_class.h.
38 #ifndef _ALTQ_ALTQ_CLASSQ_H_
39 #define _ALTQ_ALTQ_CLASSQ_H_
46 * Packet Queue types: RED or DROPHEAD.
48 #define Q_DROPHEAD 0x00
51 #define Q_DROPTAIL 0x03
56 * Packet Queue structures and macros to manipulate them.
58 struct _class_queue_ {
59 struct mbuf *tail_; /* Tail of packet queue */
60 int qlen_; /* Queue length (in number of packets) */
61 int qlim_; /* Queue limit (in number of packets*) */
62 int qtype_; /* Queue type */
65 typedef struct _class_queue_ class_queue_t;
67 #define qtype(q) (q)->qtype_ /* Get queue type */
68 #define qlimit(q) (q)->qlim_ /* Max packets to be queued */
69 #define qlen(q) (q)->qlen_ /* Current queue length. */
70 #define qtail(q) (q)->tail_ /* Tail of the queue */
71 #define qhead(q) ((q)->tail_ ? (q)->tail_->m_nextpkt : NULL)
73 #define qempty(q) ((q)->qlen_ == 0) /* Is the queue empty?? */
74 #define q_is_red(q) ((q)->qtype_ == Q_RED) /* Is the queue a red queue */
75 #define q_is_rio(q) ((q)->qtype_ == Q_RIO) /* Is the queue a rio queue */
76 #define q_is_red_or_rio(q) ((q)->qtype_ == Q_RED || (q)->qtype_ == Q_RIO)
78 #if !defined(__GNUC__) || defined(ALTQ_DEBUG)
80 extern void _addq(class_queue_t *, struct mbuf *);
81 extern struct mbuf *_getq(class_queue_t *);
82 extern struct mbuf *_getq_tail(class_queue_t *);
83 extern struct mbuf *_getq_random(class_queue_t *);
84 extern void _removeq(class_queue_t *, struct mbuf *);
85 extern void _flushq(class_queue_t *);
87 #else /* __GNUC__ && !ALTQ_DEBUG */
92 _addq(class_queue_t *q, struct mbuf *m)
96 if ((m0 = qtail(q)) != NULL)
97 m->m_nextpkt = m0->m_nextpkt;
105 static __inline struct mbuf *
106 _getq(class_queue_t *q)
110 if ((m = qtail(q)) == NULL)
112 if ((m0 = m->m_nextpkt) != m)
113 m->m_nextpkt = m0->m_nextpkt;
117 m0->m_nextpkt = NULL;
121 /* drop a packet at the tail of the queue */
122 static __inline struct mbuf *
123 _getq_tail(class_queue_t *q)
125 struct mbuf *m, *m0, *prev;
127 if ((m = m0 = qtail(q)) == NULL)
133 prev->m_nextpkt = m->m_nextpkt;
143 /* randomly select a packet in the queue */
144 static __inline struct mbuf *
145 _getq_random(class_queue_t *q)
150 if ((m = qtail(q)) == NULL)
152 if (m->m_nextpkt == m)
155 struct mbuf *prev = NULL;
157 n = random() % qlen(q) + 1;
158 for (i = 0; i < n; i++) {
162 prev->m_nextpkt = m->m_nextpkt;
172 _removeq(class_queue_t *q, struct mbuf *m)
174 struct mbuf *m0, *prev;
181 prev->m_nextpkt = m->m_nextpkt;
184 else if (qtail(q) == m)
190 _flushq(class_queue_t *q)
194 while ((m = _getq(q)) != NULL)
198 #endif /* __GNUC__ && !ALTQ_DEBUG */
206 #endif /* _ALTQ_ALTQ_CLASSQ_H_ */