2 /* $KAME: altq_classq.h,v 1.6 2003/01/07 07:33:38 kjc Exp $ */
5 * Copyright (c) 1991-1997 Regents of the University of California.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 4. Neither the name of the University nor of the Laboratory may be used
17 * to endorse or promote products derived from this software without
18 * specific prior written permission.
20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * class queue definitions extracted from rm_class.h.
35 #ifndef _ALTQ_ALTQ_CLASSQ_H_
36 #define _ALTQ_ALTQ_CLASSQ_H_
43 * Packet Queue types: RED or DROPHEAD.
45 #define Q_DROPHEAD 0x00
48 #define Q_DROPTAIL 0x03
53 * Packet Queue structures and macros to manipulate them.
55 struct _class_queue_ {
56 struct mbuf *tail_; /* Tail of packet queue */
57 int qlen_; /* Queue length (in number of packets) */
58 int qlim_; /* Queue limit (in number of packets*) */
59 int qtype_; /* Queue type */
62 typedef struct _class_queue_ class_queue_t;
64 #define qtype(q) (q)->qtype_ /* Get queue type */
65 #define qlimit(q) (q)->qlim_ /* Max packets to be queued */
66 #define qlen(q) (q)->qlen_ /* Current queue length. */
67 #define qtail(q) (q)->tail_ /* Tail of the queue */
68 #define qhead(q) ((q)->tail_ ? (q)->tail_->m_nextpkt : NULL)
70 #define qempty(q) ((q)->qlen_ == 0) /* Is the queue empty?? */
71 #define q_is_red(q) ((q)->qtype_ == Q_RED) /* Is the queue a red queue */
72 #define q_is_rio(q) ((q)->qtype_ == Q_RIO) /* Is the queue a rio queue */
73 #define q_is_red_or_rio(q) ((q)->qtype_ == Q_RED || (q)->qtype_ == Q_RIO)
75 #if !defined(__GNUC__) || defined(ALTQ_DEBUG)
77 extern void _addq(class_queue_t *, struct mbuf *);
78 extern struct mbuf *_getq(class_queue_t *);
79 extern struct mbuf *_getq_tail(class_queue_t *);
80 extern struct mbuf *_getq_random(class_queue_t *);
81 extern void _removeq(class_queue_t *, struct mbuf *);
82 extern void _flushq(class_queue_t *);
84 #else /* __GNUC__ && !ALTQ_DEBUG */
89 _addq(class_queue_t *q, struct mbuf *m)
93 if ((m0 = qtail(q)) != NULL)
94 m->m_nextpkt = m0->m_nextpkt;
102 static __inline struct mbuf *
103 _getq(class_queue_t *q)
107 if ((m = qtail(q)) == NULL)
109 if ((m0 = m->m_nextpkt) != m)
110 m->m_nextpkt = m0->m_nextpkt;
114 m0->m_nextpkt = NULL;
118 /* drop a packet at the tail of the queue */
119 static __inline struct mbuf *
120 _getq_tail(class_queue_t *q)
122 struct mbuf *m, *m0, *prev;
124 if ((m = m0 = qtail(q)) == NULL)
130 prev->m_nextpkt = m->m_nextpkt;
140 /* randomly select a packet in the queue */
141 static __inline struct mbuf *
142 _getq_random(class_queue_t *q)
147 if ((m = qtail(q)) == NULL)
149 if (m->m_nextpkt == m)
152 struct mbuf *prev = NULL;
154 n = random() % qlen(q) + 1;
155 for (i = 0; i < n; i++) {
159 prev->m_nextpkt = m->m_nextpkt;
169 _removeq(class_queue_t *q, struct mbuf *m)
171 struct mbuf *m0, *prev;
178 prev->m_nextpkt = m->m_nextpkt;
181 else if (qtail(q) == m)
187 _flushq(class_queue_t *q)
191 while ((m = _getq(q)) != NULL)
195 #endif /* __GNUC__ && !ALTQ_DEBUG */
203 #endif /* _ALTQ_ALTQ_CLASSQ_H_ */