2 * SPDX-License-Identifier: BSD-3-Clause
4 * Copyright (c) 1982, 1986, 1989, 1993
5 * The Regents of the University of California. All rights reserved.
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. Neither the name of the University nor the names of its contributors
16 * may be used to endorse or promote products derived from this software
17 * without specific prior written permission.
19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * From: @(#)if.h 8.1 (Berkeley) 6/10/93
38 #include <sys/mbuf.h> /* ifqueue only? */
39 #include <sys/buf_ring.h>
42 #include <sys/lock.h> /* XXX */
43 #include <sys/mutex.h> /* struct ifqueue */
46 * Couple of ugly extra definitions that are required since ifq.h
47 * is splitted from if_var.h.
49 #define IF_DUNIT_NONE -1
51 #include <net/altq/if_altq.h>
54 * Structure defining a queue for a network interface.
57 struct mbuf *ifq_head;
58 struct mbuf *ifq_tail;
66 * Output queues (ifp->if_snd) and slow device input queues (*ifp->if_slowq)
67 * are queues of messages stored on ifqueue structures
68 * (defined above). Entries are added to and deleted from these structures
71 #define IF_LOCK(ifq) mtx_lock(&(ifq)->ifq_mtx)
72 #define IF_UNLOCK(ifq) mtx_unlock(&(ifq)->ifq_mtx)
73 #define IF_LOCK_ASSERT(ifq) mtx_assert(&(ifq)->ifq_mtx, MA_OWNED)
74 #define _IF_QFULL(ifq) ((ifq)->ifq_len >= (ifq)->ifq_maxlen)
75 #define _IF_QLEN(ifq) ((ifq)->ifq_len)
77 #define _IF_ENQUEUE(ifq, m) do { \
78 (m)->m_nextpkt = NULL; \
79 if ((ifq)->ifq_tail == NULL) \
80 (ifq)->ifq_head = m; \
82 (ifq)->ifq_tail->m_nextpkt = m; \
83 (ifq)->ifq_tail = m; \
87 #define IF_ENQUEUE(ifq, m) do { \
89 _IF_ENQUEUE(ifq, m); \
93 #define _IF_PREPEND(ifq, m) do { \
94 (m)->m_nextpkt = (ifq)->ifq_head; \
95 if ((ifq)->ifq_tail == NULL) \
96 (ifq)->ifq_tail = (m); \
97 (ifq)->ifq_head = (m); \
101 #define IF_PREPEND(ifq, m) do { \
103 _IF_PREPEND(ifq, m); \
107 #define _IF_DEQUEUE(ifq, m) do { \
108 (m) = (ifq)->ifq_head; \
110 if (((ifq)->ifq_head = (m)->m_nextpkt) == NULL) \
111 (ifq)->ifq_tail = NULL; \
112 (m)->m_nextpkt = NULL; \
117 #define IF_DEQUEUE(ifq, m) do { \
119 _IF_DEQUEUE(ifq, m); \
123 #define _IF_DEQUEUE_ALL(ifq, m) do { \
124 (m) = (ifq)->ifq_head; \
125 (ifq)->ifq_head = (ifq)->ifq_tail = NULL; \
126 (ifq)->ifq_len = 0; \
129 #define IF_DEQUEUE_ALL(ifq, m) do { \
131 _IF_DEQUEUE_ALL(ifq, m); \
135 #define _IF_POLL(ifq, m) ((m) = (ifq)->ifq_head)
136 #define IF_POLL(ifq, m) _IF_POLL(ifq, m)
138 #define _IF_DRAIN(ifq) do { \
141 _IF_DEQUEUE(ifq, m); \
148 #define IF_DRAIN(ifq) do { \
154 int if_handoff(struct ifqueue *ifq, struct mbuf *m, struct ifnet *ifp,
156 #define IF_HANDOFF(ifq, m, ifp) \
157 if_handoff((struct ifqueue *)ifq, m, ifp, 0)
158 #define IF_HANDOFF_ADJ(ifq, m, ifp, adj) \
159 if_handoff((struct ifqueue *)ifq, m, ifp, adj)
161 void if_start(struct ifnet *);
163 #define IFQ_ENQUEUE(ifq, m, err) \
166 if (ALTQ_IS_ENABLED(ifq)) \
167 ALTQ_ENQUEUE(ifq, m, NULL, err); \
169 if (_IF_QFULL(ifq)) { \
173 _IF_ENQUEUE(ifq, m); \
180 #define IFQ_DEQUEUE_NOLOCK(ifq, m) \
182 if (TBR_IS_ENABLED(ifq)) \
183 (m) = tbr_dequeue_ptr(ifq, ALTDQ_REMOVE); \
184 else if (ALTQ_IS_ENABLED(ifq)) \
185 ALTQ_DEQUEUE(ifq, m); \
187 _IF_DEQUEUE(ifq, m); \
190 #define IFQ_DEQUEUE(ifq, m) \
193 IFQ_DEQUEUE_NOLOCK(ifq, m); \
197 #define IFQ_POLL_NOLOCK(ifq, m) \
199 if (TBR_IS_ENABLED(ifq)) \
200 (m) = tbr_dequeue_ptr(ifq, ALTDQ_POLL); \
201 else if (ALTQ_IS_ENABLED(ifq)) \
207 #define IFQ_POLL(ifq, m) \
210 IFQ_POLL_NOLOCK(ifq, m); \
214 #define IFQ_PURGE_NOLOCK(ifq) \
216 if (ALTQ_IS_ENABLED(ifq)) { \
222 #define IFQ_PURGE(ifq) \
225 IFQ_PURGE_NOLOCK(ifq); \
229 #define IFQ_SET_READY(ifq) \
230 do { ((ifq)->altq_flags |= ALTQF_READY); } while (0)
232 #define IFQ_LOCK(ifq) IF_LOCK(ifq)
233 #define IFQ_UNLOCK(ifq) IF_UNLOCK(ifq)
234 #define IFQ_LOCK_ASSERT(ifq) IF_LOCK_ASSERT(ifq)
235 #define IFQ_IS_EMPTY(ifq) ((ifq)->ifq_len == 0)
236 #define IFQ_INC_LEN(ifq) ((ifq)->ifq_len++)
237 #define IFQ_DEC_LEN(ifq) (--(ifq)->ifq_len)
238 #define IFQ_SET_MAXLEN(ifq, len) ((ifq)->ifq_maxlen = (len))
241 * The IFF_DRV_OACTIVE test should really occur in the device driver, not in
242 * the handoff logic, as that flag is locked by the device driver.
244 #define IFQ_HANDOFF_ADJ(ifp, m, adj, err) \
249 len = (m)->m_pkthdr.len; \
250 mflags = (m)->m_flags; \
251 IFQ_ENQUEUE(&(ifp)->if_snd, m, err); \
253 if_inc_counter((ifp), IFCOUNTER_OBYTES, len + (adj)); \
254 if (mflags & M_MCAST) \
255 if_inc_counter((ifp), IFCOUNTER_OMCASTS, 1); \
256 if (((ifp)->if_drv_flags & IFF_DRV_OACTIVE) == 0) \
259 if_inc_counter((ifp), IFCOUNTER_OQDROPS, 1); \
262 #define IFQ_HANDOFF(ifp, m, err) \
263 IFQ_HANDOFF_ADJ(ifp, m, 0, err)
265 #define IFQ_DRV_DEQUEUE(ifq, m) \
267 (m) = (ifq)->ifq_drv_head; \
269 if (((ifq)->ifq_drv_head = (m)->m_nextpkt) == NULL) \
270 (ifq)->ifq_drv_tail = NULL; \
271 (m)->m_nextpkt = NULL; \
272 (ifq)->ifq_drv_len--; \
275 IFQ_DEQUEUE_NOLOCK(ifq, m); \
276 while ((ifq)->ifq_drv_len < (ifq)->ifq_drv_maxlen) { \
278 IFQ_DEQUEUE_NOLOCK(ifq, m0); \
281 m0->m_nextpkt = NULL; \
282 if ((ifq)->ifq_drv_tail == NULL) \
283 (ifq)->ifq_drv_head = m0; \
285 (ifq)->ifq_drv_tail->m_nextpkt = m0; \
286 (ifq)->ifq_drv_tail = m0; \
287 (ifq)->ifq_drv_len++; \
293 #define IFQ_DRV_PREPEND(ifq, m) \
295 (m)->m_nextpkt = (ifq)->ifq_drv_head; \
296 if ((ifq)->ifq_drv_tail == NULL) \
297 (ifq)->ifq_drv_tail = (m); \
298 (ifq)->ifq_drv_head = (m); \
299 (ifq)->ifq_drv_len++; \
302 #define IFQ_DRV_IS_EMPTY(ifq) \
303 (((ifq)->ifq_drv_len == 0) && ((ifq)->ifq_len == 0))
305 #define IFQ_DRV_PURGE(ifq) \
307 struct mbuf *m, *n = (ifq)->ifq_drv_head; \
308 while((m = n) != NULL) { \
312 (ifq)->ifq_drv_head = (ifq)->ifq_drv_tail = NULL; \
313 (ifq)->ifq_drv_len = 0; \
318 drbr_enqueue(struct ifnet *ifp, struct buf_ring *br, struct mbuf *m)
323 if (ALTQ_IS_ENABLED(&ifp->if_snd)) {
324 IFQ_ENQUEUE(&ifp->if_snd, m, error);
326 if_inc_counter((ifp), IFCOUNTER_OQDROPS, 1);
330 error = buf_ring_enqueue(br, m);
338 drbr_putback(struct ifnet *ifp, struct buf_ring *br, struct mbuf *m_new)
341 * The top of the list needs to be swapped
345 if (ifp != NULL && ALTQ_IS_ENABLED(&ifp->if_snd)) {
347 * Peek in altq case dequeued it
350 IFQ_DRV_PREPEND(&ifp->if_snd, m_new);
354 buf_ring_putback_sc(br, m_new);
357 static __inline struct mbuf *
358 drbr_peek(struct ifnet *ifp, struct buf_ring *br)
362 if (ifp != NULL && ALTQ_IS_ENABLED(&ifp->if_snd)) {
364 * Pull it off like a dequeue
365 * since drbr_advance() does nothing
366 * for altq and drbr_putback() will
367 * use the old prepend function.
369 IFQ_DEQUEUE(&ifp->if_snd, m);
373 return ((struct mbuf *)buf_ring_peek_clear_sc(br));
377 drbr_flush(struct ifnet *ifp, struct buf_ring *br)
382 if (ifp != NULL && ALTQ_IS_ENABLED(&ifp->if_snd))
383 IFQ_PURGE(&ifp->if_snd);
385 while ((m = (struct mbuf *)buf_ring_dequeue_sc(br)) != NULL)
390 drbr_free(struct buf_ring *br, struct malloc_type *type)
393 drbr_flush(NULL, br);
394 buf_ring_free(br, type);
397 static __inline struct mbuf *
398 drbr_dequeue(struct ifnet *ifp, struct buf_ring *br)
403 if (ifp != NULL && ALTQ_IS_ENABLED(&ifp->if_snd)) {
404 IFQ_DEQUEUE(&ifp->if_snd, m);
408 return ((struct mbuf *)buf_ring_dequeue_sc(br));
412 drbr_advance(struct ifnet *ifp, struct buf_ring *br)
415 /* Nothing to do here since peek dequeues in altq case */
416 if (ifp != NULL && ALTQ_IS_ENABLED(&ifp->if_snd))
419 return (buf_ring_advance_sc(br));
422 static __inline struct mbuf *
423 drbr_dequeue_cond(struct ifnet *ifp, struct buf_ring *br,
424 int (*func) (struct mbuf *, void *), void *arg)
428 if (ALTQ_IS_ENABLED(&ifp->if_snd)) {
429 IFQ_LOCK(&ifp->if_snd);
430 IFQ_POLL_NOLOCK(&ifp->if_snd, m);
431 if (m != NULL && func(m, arg) == 0) {
432 IFQ_UNLOCK(&ifp->if_snd);
435 IFQ_DEQUEUE_NOLOCK(&ifp->if_snd, m);
436 IFQ_UNLOCK(&ifp->if_snd);
440 m = (struct mbuf *)buf_ring_peek(br);
441 if (m == NULL || func(m, arg) == 0)
444 return ((struct mbuf *)buf_ring_dequeue_sc(br));
448 drbr_empty(struct ifnet *ifp, struct buf_ring *br)
451 if (ALTQ_IS_ENABLED(&ifp->if_snd))
452 return (IFQ_IS_EMPTY(&ifp->if_snd));
454 return (buf_ring_empty(br));
458 drbr_needs_enqueue(struct ifnet *ifp, struct buf_ring *br)
461 if (ALTQ_IS_ENABLED(&ifp->if_snd))
464 return (!buf_ring_empty(br));
468 drbr_inuse(struct ifnet *ifp, struct buf_ring *br)
471 if (ALTQ_IS_ENABLED(&ifp->if_snd))
472 return (ifp->if_snd.ifq_len);
474 return (buf_ring_count(br));
477 extern int ifqmaxlen;
479 void if_qflush(struct ifnet *);
480 void ifq_init(struct ifaltq *, struct ifnet *ifp);
481 void ifq_delete(struct ifaltq *);
484 #endif /* !_NET_IFQ_H_ */