Deleted Added
full compact
ieee80211_node.h (148863) ieee80211_node.h (148936)
1/*-
2 * Copyright (c) 2001 Atsushi Onoe
3 * Copyright (c) 2002-2005 Sam Leffler, Errno Consulting
4 * All rights reserved.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
8 * are met:

--- 15 unchanged lines hidden (view full) ---

24 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
25 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
26 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
27 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
28 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
29 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
30 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31 *
1/*-
2 * Copyright (c) 2001 Atsushi Onoe
3 * Copyright (c) 2002-2005 Sam Leffler, Errno Consulting
4 * All rights reserved.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
8 * are met:

--- 15 unchanged lines hidden (view full) ---

24 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
25 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
26 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
27 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
28 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
29 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
30 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31 *
32 * $FreeBSD: head/sys/net80211/ieee80211_node.h 148863 2005-08-08 18:46:36Z sam $
32 * $FreeBSD: head/sys/net80211/ieee80211_node.h 148936 2005-08-10 16:22:30Z sam $
33 */
34#ifndef _NET80211_IEEE80211_NODE_H_
35#define _NET80211_IEEE80211_NODE_H_
36
37#include <net80211/ieee80211_ioctl.h> /* for ieee80211_nodestats */
38
39/*
40 * Each ieee80211com instance has a single timer that fires once a

--- 86 unchanged lines hidden (view full) ---

127 u_int8_t data[8];
128 u_int64_t tsf;
129 } ni_tstamp; /* from last rcv'd beacon */
130 u_int16_t ni_intval; /* beacon interval */
131 u_int16_t ni_capinfo; /* capabilities */
132 u_int8_t ni_esslen;
133 u_int8_t ni_essid[IEEE80211_NWID_LEN];
134 struct ieee80211_rateset ni_rates; /* negotiated rate set */
33 */
34#ifndef _NET80211_IEEE80211_NODE_H_
35#define _NET80211_IEEE80211_NODE_H_
36
37#include <net80211/ieee80211_ioctl.h> /* for ieee80211_nodestats */
38
39/*
40 * Each ieee80211com instance has a single timer that fires once a

--- 86 unchanged lines hidden (view full) ---

127 u_int8_t data[8];
128 u_int64_t tsf;
129 } ni_tstamp; /* from last rcv'd beacon */
130 u_int16_t ni_intval; /* beacon interval */
131 u_int16_t ni_capinfo; /* capabilities */
132 u_int8_t ni_esslen;
133 u_int8_t ni_essid[IEEE80211_NWID_LEN];
134 struct ieee80211_rateset ni_rates; /* negotiated rate set */
135 struct ieee80211_channel *ni_chan;
135 struct ieee80211_channel *ni_chan; /* XXX multiple uses */
136 u_int16_t ni_fhdwell; /* FH only */
137 u_int8_t ni_fhindex; /* FH only */
138 u_int8_t ni_erp; /* ERP from beacon/probe resp */
139 u_int16_t ni_timoff; /* byte offset to TIM ie */
140 u_int8_t ni_dtim_period; /* DTIM period */
141 u_int8_t ni_dtim_count; /* DTIM count for last bcn */
142
143 /* others */

--- 144 unchanged lines hidden (view full) ---

288 struct ieee80211_node *);
289void ieee80211_dump_nodes(struct ieee80211_node_table *);
290
291struct ieee80211_node *ieee80211_fakeup_adhoc_node(
292 struct ieee80211_node_table *, const u_int8_t macaddr[]);
293void ieee80211_node_join(struct ieee80211com *, struct ieee80211_node *,int);
294void ieee80211_node_leave(struct ieee80211com *, struct ieee80211_node *);
295u_int8_t ieee80211_getrssi(struct ieee80211com *ic);
136 u_int16_t ni_fhdwell; /* FH only */
137 u_int8_t ni_fhindex; /* FH only */
138 u_int8_t ni_erp; /* ERP from beacon/probe resp */
139 u_int16_t ni_timoff; /* byte offset to TIM ie */
140 u_int8_t ni_dtim_period; /* DTIM period */
141 u_int8_t ni_dtim_count; /* DTIM count for last bcn */
142
143 /* others */

--- 144 unchanged lines hidden (view full) ---

288 struct ieee80211_node *);
289void ieee80211_dump_nodes(struct ieee80211_node_table *);
290
291struct ieee80211_node *ieee80211_fakeup_adhoc_node(
292 struct ieee80211_node_table *, const u_int8_t macaddr[]);
293void ieee80211_node_join(struct ieee80211com *, struct ieee80211_node *,int);
294void ieee80211_node_leave(struct ieee80211com *, struct ieee80211_node *);
295u_int8_t ieee80211_getrssi(struct ieee80211com *ic);
296
297/*
298 * Parameters supplied when adding/updating an entry in a
299 * scan cache. Pointer variables should be set to NULL
300 * if no data is available. Pointer references can be to
301 * local data; any information that is saved will be copied.
302 * All multi-byte values must be in host byte order.
303 */
304struct ieee80211_scanparams {
305 u_int16_t capinfo; /* 802.11 capabilities */
306 u_int16_t fhdwell; /* FHSS dwell interval */
307 u_int8_t chan; /* */
308 u_int8_t bchan;
309 u_int8_t fhindex;
310 u_int8_t erp;
311 u_int16_t bintval;
312 u_int8_t timoff;
313 u_int8_t *tim;
314 u_int8_t *tstamp;
315 u_int8_t *country;
316 u_int8_t *ssid;
317 u_int8_t *rates;
318 u_int8_t *xrates;
319 u_int8_t *wpa;
320 u_int8_t *wme;
321};
322
323void ieee80211_add_scan(struct ieee80211com *,
324 const struct ieee80211_scanparams *,
325 const struct ieee80211_frame *,
326 int subtype, int rssi, int rstamp);
327struct ieee80211_node *ieee80211_add_neighbor(struct ieee80211com *,
328 const struct ieee80211_frame *,
329 const struct ieee80211_scanparams *);
296#endif /* _NET80211_IEEE80211_NODE_H_ */
330#endif /* _NET80211_IEEE80211_NODE_H_ */