2 * Copyright (c) 2009 Sam Leffler, Errno Consulting
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.
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
15 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
16 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
17 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
18 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
19 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
20 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
21 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
23 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
26 #include <sys/cdefs.h>
27 __FBSDID("$FreeBSD$");
30 * IEEE 802.11 age queue support.
34 #include <sys/param.h>
35 #include <sys/systm.h>
36 #include <sys/kernel.h>
38 #include <sys/socket.h>
41 #include <net/if_media.h>
42 #include <net/ethernet.h>
44 #include <net80211/ieee80211_var.h>
50 ieee80211_ageq_init(struct ieee80211_ageq *aq, int maxlen, const char *name)
52 memset(aq, 0, sizeof(*aq));
53 aq->aq_maxlen = maxlen;
54 IEEE80211_AGEQ_INIT(aq, name); /* OS-dependent setup */
58 * Cleanup an ageq initialized with ieee80211_ageq_init. Note
59 * the queue is assumed empty; this can be done with ieee80211_ageq_drain.
62 ieee80211_ageq_cleanup(struct ieee80211_ageq *aq)
64 KASSERT(aq->aq_len == 0, ("%d frames on ageq", aq->aq_len));
65 IEEE80211_AGEQ_DESTROY(aq); /* OS-dependent cleanup */
69 * Free an mbuf according to ageq rules: if marked as holding
70 * and 802.11 frame then also reclaim a node reference from
71 * the packet header; this handles packets q'd in the tx path.
74 ageq_mfree(struct mbuf *m)
76 if (m->m_flags & M_ENCAP) {
77 struct ieee80211_node *ni = (void *) m->m_pkthdr.rcvif;
78 ieee80211_free_node(ni);
85 * Free a list of mbufs using ageq rules (see above).
88 ieee80211_ageq_mfree(struct mbuf *m)
92 for (; m != NULL; m = next) {
99 * Append an mbuf to the ageq and mark it with the specified max age
100 * If the frame is not removed before the age (in seconds) expires
101 * then it is reclaimed (along with any node reference).
104 ieee80211_ageq_append(struct ieee80211_ageq *aq, struct mbuf *m, int age)
106 IEEE80211_AGEQ_LOCK(aq);
107 if (__predict_true(aq->aq_len < aq->aq_maxlen)) {
108 if (aq->aq_tail == NULL) {
111 aq->aq_tail->m_nextpkt = m;
112 age -= M_AGE_GET(aq->aq_head);
114 KASSERT(age >= 0, ("age %d", age));
119 IEEE80211_AGEQ_UNLOCK(aq);
123 * No space, drop and cleanup references.
126 IEEE80211_AGEQ_UNLOCK(aq);
134 * Drain/reclaim all frames from an ageq.
137 ieee80211_ageq_drain(struct ieee80211_ageq *aq)
139 ieee80211_ageq_mfree(ieee80211_ageq_remove(aq, NULL));
143 * Drain/reclaim frames associated with a specific node from an ageq.
146 ieee80211_ageq_drain_node(struct ieee80211_ageq *aq,
147 struct ieee80211_node *ni)
149 ieee80211_ageq_mfree(ieee80211_ageq_remove(aq, ni));
153 * Age frames on the age queue. Ages are stored as time
154 * deltas (in seconds) relative to the head so we can check
155 * and/or adjust only the head of the list. If a frame's age
156 * exceeds the time quanta then remove it. The list of removed
157 * frames is returned to the caller joined by m_nextpkt.
160 ieee80211_ageq_age(struct ieee80211_ageq *aq, int quanta)
162 struct mbuf *head, **phead;
166 if (aq->aq_len != 0) {
167 IEEE80211_AGEQ_LOCK(aq);
168 while ((m = aq->aq_head) != NULL && M_AGE_GET(m) < quanta) {
169 if ((aq->aq_head = m->m_nextpkt) == NULL)
171 KASSERT(aq->aq_len > 0, ("aq len %d", aq->aq_len));
173 /* add to private list for return */
175 phead = &m->m_nextpkt;
178 M_AGE_SUB(m, quanta);
179 IEEE80211_AGEQ_UNLOCK(aq);
186 * Remove all frames matching the specified node identifier
187 * (NULL matches all). Frames are returned as a list joined
191 ieee80211_ageq_remove(struct ieee80211_ageq *aq,
192 struct ieee80211_node *match)
194 struct mbuf *m, **prev, *ohead;
195 struct mbuf *head, **phead;
197 IEEE80211_AGEQ_LOCK(aq);
201 while ((m = *prev) != NULL) {
202 if (match != NULL && m->m_pkthdr.rcvif != (void *) match) {
203 prev = &m->m_nextpkt;
209 KASSERT(aq->aq_len > 0, ("aq len %d", aq->aq_len));
212 * Remove from forward list; tail pointer is harder.
214 if (aq->aq_tail == m) {
215 KASSERT(m->m_nextpkt == NULL, ("not last"));
216 if (aq->aq_head == m) { /* list empty */
217 KASSERT(aq->aq_len == 0,
218 ("not empty, len %d", aq->aq_len));
220 } else { /* must be one before */
221 aq->aq_tail = (struct mbuf *)((uintptr_t)prev -
222 offsetof(struct mbuf, m_nextpkt));
225 *prev = m->m_nextpkt;
227 /* add to private list for return */
229 phead = &m->m_nextpkt;
231 if (head == ohead && aq->aq_head != NULL) /* correct age */
232 M_AGE_SET(aq->aq_head, M_AGE_GET(head));
233 IEEE80211_AGEQ_UNLOCK(aq);