projects / dragonfly.git / blame
| Commit | Line | Data |
|---|---|---|
| 32176cfd RP |
1 | /*- |
| 2 | * Copyright (c) 2009 Sam Leffler, Errno Consulting | |
| 3 | * All rights reserved. | |
| 4 | * | |
| 5 | * Redistribution and use in source and binary forms, with or without | |
| 6 | * modification, are permitted provided that the following conditions | |
| 7 | * are met: | |
| 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 | * | |
| 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. | |
| 24 | * | |
| 25 | * $FreeBSD: head/sys/net80211/ieee80211_ageq.h 195379 2009-07-05 18:17:37Z sam $ | |
| 26 | * $DragonFly$ | |
| 27 | */ | |
| 28 | #ifndef _NET80211_IEEE80211_STAGEQ_H_ | |
| 29 | #define _NET80211_IEEE80211_STAGEQ_H_ | |
| 30 | ||
| 31 | struct ieee80211_node; | |
| 32 | struct mbuf; | |
| 33 | ||
| 34 | struct ieee80211_ageq { | |
| 32176cfd RP |
35 | int aq_len; /* # items on queue */ |
| 36 | int aq_maxlen; /* max queue length */ | |
| 37 | int aq_drops; /* frames dropped */ | |
| 38 | struct mbuf *aq_head; /* frames linked w/ m_nextpkt */ | |
| 39 | struct mbuf *aq_tail; /* last frame in queue */ | |
| 40 | }; | |
| 41 | ||
| 42 | void ieee80211_ageq_init(struct ieee80211_ageq *, int maxlen, | |
| 43 | const char *name); | |
| 44 | void ieee80211_ageq_cleanup(struct ieee80211_ageq *); | |
| 45 | void ieee80211_ageq_mfree(struct mbuf *); | |
| 46 | int ieee80211_ageq_append(struct ieee80211_ageq *, struct mbuf *, | |
| 47 | int age); | |
| 48 | void ieee80211_ageq_drain(struct ieee80211_ageq *); | |
| 49 | void ieee80211_ageq_drain_node(struct ieee80211_ageq *, | |
| 50 | struct ieee80211_node *); | |
| 51 | struct mbuf *ieee80211_ageq_age(struct ieee80211_ageq *, int quanta); | |
| 52 | struct mbuf *ieee80211_ageq_remove(struct ieee80211_ageq *, | |
| 53 | struct ieee80211_node *match); | |
| 54 | #endif /* _NET80211_IEEE80211_STAGEQ_H_ */ |