qi-hardware/openwrt-xburst
1
0
Fork 0
mirror of git://projects.qi-hardware.com/openwrt-xburst.git synced 2024-07-02 19:43:16 +03:00
Code

add wireless measurement probe infrastructure, developed at Fraunhofer FOKUS

Browse Source 
git-svn-id: svn://svn.openwrt.org/openwrt/trunk@15050 3c298f89-4303-0410-b956-a3cf2f4a3e73
This commit is contained in:
nbd 2009-03-26 20:56:47 +00:00
parent cb62f7dffd
commit 3e53e7a4b5
13 changed files with 2923 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

112
package/wprobe/Makefile Normal file
View File

@ -0,0 +1,112 @@
#
# Copyright (C) 2008 OpenWrt.org
#
# This is free software, licensed under the GNU General Public License v2.
# See /LICENSE for more information.
include $(TOPDIR)/rules.mk
include $(INCLUDE_DIR)/kernel.mk
PKG_NAME:=wprobe
PKG_VERSION:=1
PKG_BUILD_DEPENDS:=libnl libipfix
include $(INCLUDE_DIR)/package.mk
define KernelPackage/wprobe
SUBMENU:=Network Support
TITLE:=Wireless driver probe infrastructure
FILES:= \
$(PKG_BUILD_DIR)/kernel/wprobe.$(LINUX_KMOD_SUFFIX)
AUTOLOAD:=$(call AutoLoad,01,wprobe)
endef
define KernelPackage/wprobe/description
A module that exports measurement data from wireless driver to user space
endef
define Package/wprobe-info
SECTION:=net
CATEGORY:=Network
DEPENDS:=+kmod-wprobe
TITLE:=Wireless measurement utility
endef
define Package/wprobe-info/description
wprobe-info uses the wprobe kernel module to query
wireless driver measurement data from an interface
endef
define Package/wprobe-export
SECTION:=net
CATEGORY:=Network
DEPENDS:=+kmod-wprobe
TITLE:=Wireless measurement data exporter
endef
define Package/wprobe-export/description
wprobe-export uses the wprobe kernel module to export
wireless driver measurement data via the IPFIX protocol
endef
define Build/Prepare
mkdir -p $(PKG_BUILD_DIR)
$(CP) src/* $(PKG_BUILD_DIR)/
endef
TARGET_CFLAGS += -I$(STAGING_DIR)/usr/include
define Build/Compile/kmod
$(MAKE) -C $(LINUX_DIR) \
CROSS_COMPILE="$(TARGET_CROSS)" \
ARCH="$(LINUX_KARCH)" \
SUBDIRS="$(PKG_BUILD_DIR)/kernel" \
KERNELDIR=$(LINUX_DIR) \
CC="$(TARGET_CC)" \
EXTRA_CFLAGS="-I$(PKG_BUILD_DIR)/kernel" \
modules
endef
define Build/Compile/lib
$(MAKE) -C $(PKG_BUILD_DIR)/user \
$(TARGET_CONFIGURE_OPTS) \
CFLAGS="$(TARGET_CFLAGS)" \
CPPFLAGS="$(TARGET_CPPFLAGS) -I$(PKG_BUILD_DIR)/kernel" \
LDFLAGS="$(TARGET_LDFLAGS)" \
LIBNL="$(STAGING_DIR)/usr/lib/libnl.a"
endef
define Build/Compile/exporter
$(MAKE) -C $(PKG_BUILD_DIR)/exporter \
$(TARGET_CONFIGURE_OPTS) \
CFLAGS="$(TARGET_CFLAGS)" \
CPPFLAGS="$(TARGET_CPPFLAGS) -I$(PKG_BUILD_DIR)/kernel -I$(PKG_BUILD_DIR)/user" \
LDFLAGS="$(TARGET_LDFLAGS)" \
LIBS="$(PKG_BUILD_DIR)/user/libwprobe.a $(STAGING_DIR)/usr/lib/libipfix.a $(STAGING_DIR)/usr/lib/libmisc.a $(STAGING_DIR)/usr/lib/libnl.a -lm"
endef
define Build/Compile
$(Build/Compile/kmod)
$(Build/Compile/lib)
$(Build/Compile/exporter)
endef
define Build/InstallDev
$(INSTALL_DIR) $(1)/usr/include
$(CP) $(PKG_BUILD_DIR)/kernel/linux $(1)/usr/include
endef
define Package/wprobe-info/install
$(INSTALL_DIR) $(1)/sbin
$(INSTALL_BIN) $(PKG_BUILD_DIR)/user/wprobe-info $(1)/sbin/
endef
define Package/wprobe-export/install
$(INSTALL_DIR) $(1)/sbin
$(INSTALL_BIN) $(PKG_BUILD_DIR)/exporter/wprobe-export $(1)/sbin/
endef
$(eval $(call KernelPackage,wprobe))
$(eval $(call BuildPackage,wprobe-info))
$(eval $(call BuildPackage,wprobe-export))

2
package/wprobe/src/exporter/Makefile Normal file
View File

@ -0,0 +1,2 @@
wprobe-export: wprobe-export.c
$(CC) $(CPPFLAGS) $(CFLAGS) -o $@ $^ $(LDFLAGS) $(LIBS)

295
package/wprobe/src/exporter/wprobe-export.c Normal file
View File

@ -0,0 +1,295 @@
/*
** exporter.c - example exporter
**
** Copyright Fraunhofer FOKUS
**
*/
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <string.h>
#include <errno.h>
#include <ipfix_def.h>
#include <ipfix_def_fokus.h>
#include <ipfix_fields_fokus.h>
#include <ipfix.h>
#include <mlog.h>
#include <wprobe.h>
static ipfix_datarecord_t g_data = { NULL, NULL, 0 };
static int do_close = 0;
struct wprobe_mapping {
int id;
float scale;
const char *wprobe_id;
struct wprobe_value *val;
};
#ifndef ARRAY_SIZE
#define ARRAY_SIZE(_array) (sizeof(_array) / sizeof((_array)[0]))
#endif
#define WMAP(_id, _name, ...) \
{ \
.scale = 1.0f, \
.id = IPFIX_FT_WPROBE_##_id##_AVG, \
.wprobe_id = _name \
, ## __VA_ARGS__ \
}
#define WPROBE_OFFSET 2
static struct wprobe_mapping map_globals[] = {
WMAP(NOISE, "noise"),
WMAP(PHY_BUSY, "phy_busy"),
WMAP(PHY_RX, "phy_rx"),
WMAP(PHY_TX, "phy_tx"),
};
static struct wprobe_mapping map_perlink[] = {
WMAP(IEEE_TX_RATE, "tx_rate", .scale = 10.0f),
WMAP(IEEE_RX_RATE, "rx_rate", .scale = 10.0f),
WMAP(RSSI, "rssi"),
WMAP(SIGNAL, "signal"),
WMAP(RETRANSMIT_200, "retransmit_200"),
WMAP(RETRANSMIT_400, "retransmit_400"),
WMAP(RETRANSMIT_800, "retransmit_800"),
WMAP(RETRANSMIT_1600, "retransmit_1600"),
};
static unsigned char link_local[6];
static char link_default[6];
static LIST_HEAD(global_attr);
static LIST_HEAD(link_attr);
static LIST_HEAD(links);
static int nfields = 0;
#define FOKUS_USERID 12325
static void
match_template(struct wprobe_mapping *map, int n, struct list_head *list)
{
struct wprobe_attribute *attr;
int i, j, last = -1;
list_for_each_entry(attr, list, list) {
for (i = 0; i < n; i++) {
j = (last + 1 + i) % n;
if (!strcmp(attr->name, map[j].wprobe_id))
goto found;
}
continue;
found:
last = j;
map[j].val = &attr->val;
memset(&attr->val, 0, sizeof(attr->val));
nfields++;
}
}
/* name: export_ipfix_get_template()
*/
static ipfix_template_t *
prepare_template(ipfix_t *handle)
{
ipfix_template_t *t = NULL;
int size = 3 * nfields + WPROBE_OFFSET;
int i;
if (ipfix_new_data_template( handle, &t, size) < 0) {
mlogf( 0, "ipfix_new_template() failed: %s\n", strerror(errno) );
exit(1);
}
ipfix_add_field(handle, t, 0, IPFIX_FT_SOURCEMACADDRESS, 6);
ipfix_add_field(handle, t, 0, IPFIX_FT_DESTINATIONMACADDRESS, 6);
g_data.lens = calloc(size, sizeof(g_data.lens[0]));
g_data.lens[0] = 6;
g_data.lens[1] = 6;
for (i = WPROBE_OFFSET; i < size; i++)
g_data.lens[i] = 4;
g_data.addrs = calloc(size, sizeof(g_data.addrs[0]));
g_data.addrs[0] = link_local;
g_data.maxfields = WPROBE_OFFSET;
return t;
}
static void
add_template_fields(ipfix_t *handle, ipfix_template_t *t, struct wprobe_mapping *map, int n)
{
int f = g_data.maxfields;
int i;
for (i = 0; i < n; i++) {
if (!map[i].val)
continue;
g_data.addrs[f++] = &map[i].val->avg;
g_data.addrs[f++] = &map[i].val->stdev;
g_data.addrs[f++] = &map[i].val->n;
if (ipfix_add_field( handle, t, FOKUS_USERID, map[i].id + 0, 4) < 0)
exit(1);
if (ipfix_add_field( handle, t, FOKUS_USERID, map[i].id + 1, 4) < 0)
exit(1);
if (ipfix_add_field( handle, t, FOKUS_USERID, map[i].id + 2, 4) < 0)
exit(1);
}
g_data.maxfields = f;
}
static void
wprobe_dump_data(ipfix_t *ipfixh, ipfix_template_t *ipfixt, const char *ifname, struct list_head *gl, struct list_head *ll, struct list_head *ls)
{
struct wprobe_link *link;
wprobe_update_links(ifname, ls);
wprobe_request_data(ifname, gl, NULL, 2);
if (list_empty(ls)) {
g_data.addrs[1] = link_default;
ipfix_export_array(ipfixh, ipfixt, g_data.maxfields, g_data.addrs, g_data.lens);
ipfix_export_flush(ipfixh);
}
list_for_each_entry(link, ls, list) {
g_data.addrs[1] = link->addr;
wprobe_request_data(ifname, ll, link->addr, 2);
ipfix_export_array(ipfixh, ipfixt, g_data.maxfields, g_data.addrs, g_data.lens);
ipfix_export_flush(ipfixh);
}
}
int main ( int argc, char **argv )
{
ipfix_template_t *ipfixt = NULL;
ipfix_t *ipfixh = NULL;
int protocol = IPFIX_PROTO_TCP;
char *chost = NULL;
char *ifname = NULL;
int sourceid = 12345;
int port = IPFIX_PORTNO;
int verbose_level = 0;
int opt, i = 10;
while ((opt = getopt(argc, argv, "hi:c:p:vstu")) != EOF) {
switch (opt) {
case 'p':
if ((port=atoi(optarg)) <0) {
fprintf( stderr, "Invalid -p argument!\n" );
exit(1);
}
break;
case 'i':
ifname = optarg;
break;
case 'c':
chost = optarg;
break;
case 's':
protocol = IPFIX_PROTO_SCTP;
break;
case 't':
protocol = IPFIX_PROTO_TCP;
break;
case 'u':
protocol = IPFIX_PROTO_UDP;
break;
case 'v':
verbose_level ++;
break;
case 'h':
default:
fprintf(stderr, "usage: %s [-hstuv] -i <interface> -c <collector> [-p portno]\n"
" -h this help\n"
" -i <interface> wprobe interface\n"
" -c <collector> collector address\n"
" -p <portno> collector port number (default=%d)\n"
" -s send data via SCTP\n"
" -t send data via TCP (default)\n"
" -u send data via UDP\n"
" -v increase verbose level\n\n",
argv[0], IPFIX_PORTNO );
exit(1);
}
}
if (!ifname) {
fprintf(stderr, "No interface specified\n");
return -1;
}
if (!chost) {
fprintf(stderr, "No collector specified\n");
return -1;
}
if (wprobe_init() != 0) {
fprintf(stderr, "wprobe init failed\n");
return -1;
}
wprobe_dump_attributes(ifname, false, &global_attr, (char *) link_local);
wprobe_dump_attributes(ifname, true, &link_attr, NULL);
if (list_empty(&global_attr) && list_empty(&link_attr)) {
fprintf(stderr, "Cannot connect to wprobe on interface '%s'\n", ifname);
return -1;
}
match_template(map_globals, ARRAY_SIZE(map_globals), &global_attr);
match_template(map_perlink, ARRAY_SIZE(map_perlink), &link_attr);
if (nfields == 0) {
fprintf(stderr, "No usable attributes found\n");
return -1;
}
mlog_set_vlevel( verbose_level );
if (ipfix_init() < 0) {
fprintf( stderr, "cannot init ipfix module: %s\n", strerror(errno) );
exit(1);
}
ipfix_add_vendor_information_elements(ipfix_ft_fokus);
if (ipfix_open(&ipfixh, sourceid, IPFIX_VERSION) < 0) {
fprintf( stderr, "ipfix_open() failed: %s\n", strerror(errno) );
exit(1);
}
if (ipfix_add_collector( ipfixh, chost, port, protocol ) < 0) {
fprintf( stderr, "ipfix_add_collector(%s,%d) failed: %s\n",
chost, port, strerror(errno));
exit(1);
}
fprintf(stderr, "Local link address: %02x:%02x:%02x:%02x:%02x:%02x\n",
link_local[0], link_local[1], link_local[2],
link_local[3], link_local[4], link_local[5]);
ipfixt = prepare_template(ipfixh);
add_template_fields(ipfixh, ipfixt, map_globals, ARRAY_SIZE(map_globals));
add_template_fields(ipfixh, ipfixt, map_perlink, ARRAY_SIZE(map_perlink));
while (!do_close) {
usleep(100 * 1000);
wprobe_measure(ifname);
if (i-- > 0)
continue;
i = 10;
wprobe_dump_data(ipfixh, ipfixt, ifname, &global_attr, &link_attr, &links);
}
ipfix_delete_template( ipfixh, ipfixt );
ipfix_close( ipfixh );
ipfix_cleanup();
exit(0);
}

34
package/wprobe/src/exporter/wprobe-export.h Normal file
View File

@ -0,0 +1,34 @@
#include <inttypes.h>
#include <stdint.h>
#include <stdbool.h>
/**
* struct wprobe_value: data structure for attribute values
* see kernel api netlink attributes for more information
*/
struct wprobe_value {
/* attribute value */
union data {
const char *STRING;
uint8_t U8;
uint16_t U16;
uint32_t U32;
uint64_t U64;
int8_t S8;
int16_t S16;
int32_t S32;
int64_t S64;
} data;
/* statistics */
int64_t s, ss;
double avg, stdev;
unsigned int n;
void *usedata; /* Pointer to used data.something */
};
struct exporter_data {
int id; /* ipfix id */
int userid; /* focus or global */
int size; /* size in byte*/
struct wprobe_value val;
};

5
package/wprobe/src/kernel/Makefile Normal file
View File

@ -0,0 +1,5 @@
EXTRA_CFLAGS += -I.
obj-m := wprobe.o wprobe-dummy.o
wprobe-objs := wprobe-core.o

298
package/wprobe/src/kernel/linux/wprobe.h Normal file
View File

@ -0,0 +1,298 @@
/*
* wprobe.h: API for the wireless probe interface
* Copyright (C) 2008-2009 Felix Fietkau <nbd@openwrt.org>
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*/
#ifndef __WPROBE_H
#define __WPROBE_H
#ifdef __KERNEL__
#include <linux/types.h>
#include <linux/if_ether.h>
#include <linux/spinlock.h>
#include <linux/module.h>
#include <linux/list.h>
#include <net/genetlink.h>
#endif
/**
* enum wprobe_attr: netlink attribute list
*
* @WPROBE_ATTR_UNSPEC: unused
*
* @WPROBE_ATTR_INTERFACE: interface name to process query on (NLA_STRING)
* @WPROBE_ATTR_MAC: mac address (used for wireless links) (NLA_STRING)
* @WPROBE_ATTR_FLAGS: interface/link/attribute flags (see enum wprobe_flags) (NLA_U32)
* @WPROBE_ATTR_DURATION: sampling duration (in milliseconds) (NLA_MSECS)
*
* @WPROBE_ATTR_ID: attribute id (NLA_U32)
* @WPROBE_ATTR_NAME: attribute name (NLA_STRING)
* @WPROBE_ATTR_TYPE: attribute type (NLA_U8)
* @WPROBE_ATTR_SCALE: attribute scale factor (NLA_U32)
*
* attribute values:
*
* @WPROBE_VAL_STRING: string value (NLA_STRING)
* @WPROBE_VAL_S8: signed 8-bit integer (NLA_U8)
* @WPROBE_VAL_S16: signed 16-bit integer (NLA_U16)
* @WPROBE_VAL_S32: signed 32-bit integer (NLA_U32)
* @WPROBE_VAL_S64: signed 64-bit integer (NLA_U64)
* @WPROBE_VAL_U8: unsigned 8-bit integer (NLA_U8)
* @WPROBE_VAL_U16: unsigned 16-bit integer (NLA_U16)
* @WPROBE_VAL_U32: unsigned 32-bit integer (NLA_U32)
* @WPROBE_VAL_U64: unsigned 64-bit integer (NLA_U64)
*
* statistics:
* @WPROBE_VAL_SUM: sum of all samples
* @WPROBE_VAL_SUM_SQ: sum of all samples^2
* @WPROBE_VAL_SAMPLES: number of samples
*
* @WPROBE_ATTR_LAST: unused
*/
enum wprobe_attr {
WPROBE_ATTR_UNSPEC,
WPROBE_ATTR_INTERFACE,
WPROBE_ATTR_MAC,
WPROBE_ATTR_FLAGS,
WPROBE_ATTR_DURATION,
WPROBE_ATTR_SCALE,
/* end of query attributes */
/* response data */
WPROBE_ATTR_ID,
WPROBE_ATTR_NAME,
WPROBE_ATTR_TYPE,
/* value type attributes */
WPROBE_VAL_STRING,
WPROBE_VAL_S8,
WPROBE_VAL_S16,
WPROBE_VAL_S32,
WPROBE_VAL_S64,
WPROBE_VAL_U8,
WPROBE_VAL_U16,
WPROBE_VAL_U32,
WPROBE_VAL_U64,
/* aggregates for statistics */
WPROBE_VAL_SUM,
WPROBE_VAL_SUM_SQ,
WPROBE_VAL_SAMPLES,
WPROBE_ATTR_LAST
};
/**
* enum wprobe_cmd: netlink commands for interacting with wprobe
*
* @WPROBE_CMD_UNSPEC: unused
*
* @WPROBE_CMD_GET_LIST: get global/link property list
* @WPROBE_CMD_GET_INFO: get global/link properties
* @WPROBE_CMD_SET_FLAGS: set global/link flags
* @WPROBE_CMD_MEASURE: take a snapshot of the current data
* @WPROBE_CMD_GET_LINKS: get a list of links
*
* @WPROBE_CMD_LAST: unused
*
* options for GET_INFO and SET_FLAGS:
* - mac address set: per-link
* - mac address unset: globalsa
*/
enum wprobe_cmd {
WPROBE_CMD_UNSPEC,
WPROBE_CMD_GET_LIST,
WPROBE_CMD_GET_INFO,
WPROBE_CMD_SET_FLAGS,
WPROBE_CMD_MEASURE,
WPROBE_CMD_GET_LINKS,
WPROBE_CMD_LAST
};
/**
* enum wprobe_flags: flags for wprobe links and items
* @WPROBE_F_KEEPSTAT: keep statistics for this link/device
* @WPROBE_F_RESET: reset statistics now (used only in WPROBE_CMD_SET_LINK)
* @WPROBE_F_NEWDATA: used to indicate that a value has been updated
*/
enum wprobe_flags {
WPROBE_F_KEEPSTAT = (1 << 0),
WPROBE_F_RESET = (1 << 1),
WPROBE_F_NEWDATA = (1 << 2),
};
#ifdef __KERNEL__
struct wprobe_link;
struct wprobe_item;
struct wprobe_source;
/**
* struct wprobe_link - data structure describing a wireless link
* @iface: pointer to the wprobe_iface that this link belongs to
* @addr: BSSID of the remote link partner
* @flags: link flags (see wprobe_flags)
* @priv: user pointer
*
* @list: for internal use
* @val: for internal use
*/
struct wprobe_link {
struct list_head list;
struct wprobe_iface *iface;
char addr[ETH_ALEN];
u32 flags;
void *priv;
void *val;
};
/**
* struct wprobe_item - data structure describing the format of wprobe_link::data or wprobe_iface::data
* @name: name of the field
* @type: data type of this field
* @flags: measurement item flags (see wprobe_flags)
*/
struct wprobe_item {
const char *name;
enum wprobe_attr type;
u32 flags;
};
struct wprobe_value {
bool pending;
union {
/*
* the following are kept uppercase to allow
* for automated checking against WPROBE_VAL_*
* via BUG_ON()
*/
const char *STRING;
u8 U8;
u16 U16;
u32 U32;
u64 U64;
s8 S8;
s16 S16;
s32 S32;
s64 S64;
};
s64 s, ss;
unsigned int n;
/* timestamps */
u64 first, last;
};
/**
* struct wprobe_source - data structure describing a wireless interface
*
* @name: name of the interface
* @addr: local mac address of the interface
* @links: list of wireless links to poll
* @link_items: description of the per-link data structure
* @n_link_items: number of link description items
* @global_items: description of the per-interface data structure
* @n_global_items: number of per-interface description items
* @sync_data: callback allowing the driver to prepare data for the wprobe poll
*
* @list: head for the list of interfaces
* @priv: user pointer
* @lock: spinlock protecting value data access
* @val: internal use
* @query_val: internal use
*
* if sync_data is NULL, wprobe assumes that it can access the data structure
* at any time (in atomic context). if sync_data returns a negative error code,
* the poll request will not be handled for the given link
*/
struct wprobe_iface {
/* to be filled in by wprobe source drivers */
const char *name;
const char *addr;
const struct wprobe_item *link_items;
int n_link_items;
const struct wprobe_item *global_items;
int n_global_items;
int (*sync_data)(struct wprobe_iface *dev, struct wprobe_link *l, struct wprobe_value *val, bool measure);
void *priv;
/* handled by the wprobe core */
struct list_head list;
struct list_head links;
spinlock_t lock;
void *val;
void *query_val;
};
#define WPROBE_FILL_BEGIN(_ptr, _list) do { \
struct wprobe_value *__val = (_ptr); \
const struct wprobe_item *__item = _list; \
u64 __msecs = jiffies_to_msecs(jiffies)
#define WPROBE_SET(_idx, _type, _value) \
if (__item[_idx].type != WPROBE_VAL_##_type) { \
printk("ERROR: invalid data type at %s:%d\n", __FILE__, __LINE__); \
break; \
} \
__val[_idx].pending = true; \
__val[_idx]._type = _value; \
if (!__val[_idx].first) \
__val[_idx].first = __msecs; \
__val[_idx].first = __msecs
#define WPROBE_FILL_END() \
} while(0)
/**
* wprobe_add_iface: register an interface with the wireless probe subsystem
* @dev: wprobe_iface structure describing the interface
*/
extern int __weak wprobe_add_iface(struct wprobe_iface *dev);
/**
* wprobe_remove_iface: deregister an interface from the wireless probe subsystem
* @dev: wprobe_iface structure describing the interface
*/
extern void __weak wprobe_remove_iface(struct wprobe_iface *dev);
/**
* wprobe_add_link: register a new wireless link
* @dev: wprobe_iface structure describing the interface
* @l: storage space for the wprobe_link structure
* @addr: mac address of the new link
*
* the entire wprobe_link structure is overwritten by this function call
*/
extern int __weak wprobe_add_link(struct wprobe_iface *dev, struct wprobe_link *l, const char *addr);
/**
* wprobe_remove_link: deregister a previously registered wireless link
* @dev: wprobe_iface structure describing the interface
* @l: wprobe_link data structure
*/
extern void __weak wprobe_remove_link(struct wprobe_iface *dev, struct wprobe_link *l);
/**
* wprobe_update_stats: update statistics after sampling values
* @dev: wprobe_iface structure describing the interface
* @l: wprobe_link data structure
*
* if l == NULL, then the stats for globals are updated
*/
extern void __weak wprobe_update_stats(struct wprobe_iface *dev, struct wprobe_link *l);
#endif /* __KERNEL__ */
#endif

669
package/wprobe/src/kernel/wprobe-core.c Normal file
View File

@ -0,0 +1,669 @@
/*
* wprobe-core.c: Wireless probe interface core
* Copyright (C) 2008-2009 Felix Fietkau <nbd@openwrt.org>
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*/
#include <linux/kernel.h>
#include <linux/version.h>
#include <linux/module.h>
#include <linux/types.h>
#include <linux/spinlock.h>
#include <linux/rcupdate.h>
#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,26)
#include <linux/rculist.h>
#else
#include <linux/list.h>
#endif
#include <linux/skbuff.h>
#include <linux/wprobe.h>
#include <linux/math64.h>
#define static
#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,28)
#define list_for_each_rcu __list_for_each_rcu
#endif
static struct list_head wprobe_if;
static spinlock_t wprobe_lock;
static struct genl_family wprobe_fam = {
.id = GENL_ID_GENERATE,
.name = "wprobe",
.hdrsize = 0,
.version = 1,
/* only the first set of attributes is used for queries */
.maxattr = WPROBE_ATTR_ID,
};
static void wprobe_update_stats(struct wprobe_iface *dev, struct wprobe_link *l);
int
wprobe_add_link(struct wprobe_iface *s, struct wprobe_link *l, const char *addr)
{
unsigned long flags;
INIT_LIST_HEAD(&l->list);
l->val = kzalloc(sizeof(struct wprobe_value) * s->n_link_items, GFP_ATOMIC);
if (!l->val)
return -ENOMEM;
l->iface = s;
memcpy(&l->addr, addr, ETH_ALEN);
spin_lock_irqsave(&wprobe_lock, flags);
list_add_tail_rcu(&l->list, &s->links);
spin_unlock_irqrestore(&wprobe_lock, flags);
return 0;
}
EXPORT_SYMBOL(wprobe_add_link);
void
wprobe_remove_link(struct wprobe_iface *s, struct wprobe_link *l)
{
unsigned long flags;
spin_lock_irqsave(&wprobe_lock, flags);
list_del_rcu(&l->list);
spin_unlock_irqrestore(&wprobe_lock, flags);
synchronize_rcu();
kfree(l->val);
}
EXPORT_SYMBOL(wprobe_remove_link);
int
wprobe_add_iface(struct wprobe_iface *s)
{
unsigned long flags;
int vsize;
/* reset only wprobe private area */
memset(&s->list, 0, sizeof(struct wprobe_iface) - offsetof(struct wprobe_iface, list));
BUG_ON(!s->name);
INIT_LIST_HEAD(&s->list);
INIT_LIST_HEAD(&s->links);
vsize = max(s->n_link_items, s->n_global_items);
s->val = kzalloc(sizeof(struct wprobe_value) * vsize, GFP_ATOMIC);
if (!s->val)
goto error;
s->query_val = kzalloc(sizeof(struct wprobe_value) * vsize, GFP_ATOMIC);
if (!s->query_val)
goto error;
spin_lock_irqsave(&wprobe_lock, flags);
list_add_rcu(&s->list, &wprobe_if);
spin_unlock_irqrestore(&wprobe_lock, flags);
return 0;
error:
if (s->val)
kfree(s->val);
return -ENOMEM;
}
EXPORT_SYMBOL(wprobe_add_iface);
void
wprobe_remove_iface(struct wprobe_iface *s)
{
unsigned long flags;
BUG_ON(!list_empty(&s->links));
spin_lock_irqsave(&wprobe_lock, flags);
list_del_rcu(&s->list);
spin_unlock_irqrestore(&wprobe_lock, flags);
/* wait for all queries to finish before freeing the
* temporary value storage buffer */
synchronize_rcu();
kfree(s->val);
kfree(s->query_val);
}
EXPORT_SYMBOL(wprobe_remove_iface);
static struct wprobe_iface *
wprobe_get_dev(struct nlattr *attr)
{
struct wprobe_iface *dev = NULL;
struct wprobe_iface *p;
const char *name;
int i = 0;
if (!attr)
return NULL;
name = nla_data(attr);
list_for_each_entry_rcu(p, &wprobe_if, list) {
i++;
if (strcmp(name, p->name) != 0)
continue;
dev = p;
break;
}
return dev;
}
int
wprobe_sync_data(struct wprobe_iface *dev, struct wprobe_link *l, bool query)
{
struct wprobe_value *val;
unsigned long flags;
int n, err;
if (l) {
n = dev->n_link_items;
val = l->val;
} else {
n = dev->n_global_items;
val = dev->val;
}
spin_lock_irqsave(&dev->lock, flags);
err = dev->sync_data(dev, l, val, !query);
if (err)
goto done;
if (query)
memcpy(dev->query_val, val, sizeof(struct wprobe_value) * n);
wprobe_update_stats(dev, l);
done:
spin_unlock_irqrestore(&dev->lock, flags);
return 0;
}
EXPORT_SYMBOL(wprobe_sync_data);
void
wprobe_update_stats(struct wprobe_iface *dev, struct wprobe_link *l)
{
const struct wprobe_item *item;
struct wprobe_value *val;
int i, n;
if (l) {
n = dev->n_link_items;
item = dev->link_items;
val = l->val;
} else {
n = dev->n_global_items;
item = dev->global_items;
val = dev->val;
}
/* process statistics */
for (i = 0; i < n; i++) {
s64 v;
if (!val[i].pending)
continue;
val[i].n++;
switch(item[i].type) {
case WPROBE_VAL_S8:
v = val[i].S8;
break;
case WPROBE_VAL_S16:
v = val[i].S16;
break;
case WPROBE_VAL_S32:
v = val[i].S32;
break;
case WPROBE_VAL_S64:
v = val[i].S64;
break;
case WPROBE_VAL_U8:
v = val[i].U8;
break;
case WPROBE_VAL_U16:
v = val[i].U16;
break;
case WPROBE_VAL_U32:
v = val[i].U32;
break;
case WPROBE_VAL_U64:
v = val[i].U64;
break;
default:
continue;
}
val[i].s += v;
val[i].ss += v * v;
val[i].pending = false;
}
}
EXPORT_SYMBOL(wprobe_update_stats);
static const struct nla_policy wprobe_policy[WPROBE_ATTR_ID+1] = {
[WPROBE_ATTR_INTERFACE] = { .type = NLA_NUL_STRING },
[WPROBE_ATTR_MAC] = { .type = NLA_STRING },
[WPROBE_ATTR_DURATION] = { .type = NLA_MSECS },
[WPROBE_ATTR_FLAGS] = { .type = NLA_U32 },
[WPROBE_ATTR_SCALE] = { .type = NLA_U32 },
};
static bool
wprobe_check_ptr(struct list_head *list, struct list_head *ptr)
{
struct list_head *p;
list_for_each_rcu(p, list) {
if (ptr == p)
return true;
}
return false;
}
static bool
wprobe_send_item_value(struct sk_buff *msg, struct netlink_callback *cb,
struct wprobe_iface *dev, struct wprobe_link *l,
const struct wprobe_item *item,
int i, u32 flags)
{
struct genlmsghdr *hdr;
struct wprobe_value *val = dev->query_val;
u64 time = val[i].last - val[i].first;
hdr = genlmsg_put(msg, NETLINK_CB(cb->skb).pid, cb->nlh->nlmsg_seq,
&wprobe_fam, NLM_F_MULTI, WPROBE_CMD_GET_INFO);
NLA_PUT_U32(msg, WPROBE_ATTR_ID, i);
NLA_PUT_U32(msg, WPROBE_ATTR_FLAGS, flags);
NLA_PUT_U8(msg, WPROBE_ATTR_TYPE, item[i].type);
NLA_PUT_U64(msg, WPROBE_ATTR_DURATION, time);
switch(item[i].type) {
case WPROBE_VAL_S8:
case WPROBE_VAL_U8:
NLA_PUT_U8(msg, item[i].type, val[i].U8);
break;
case WPROBE_VAL_S16:
case WPROBE_VAL_U16:
NLA_PUT_U16(msg, item[i].type, val[i].U16);
break;
case WPROBE_VAL_S32:
case WPROBE_VAL_U32:
NLA_PUT_U32(msg, item[i].type, val[i].U32);
break;
case WPROBE_VAL_S64:
case WPROBE_VAL_U64:
NLA_PUT_U64(msg, item[i].type, val[i].U64);
break;
case WPROBE_VAL_STRING:
if (val[i].STRING)
NLA_PUT_STRING(msg, item[i].type, val[i].STRING);
else
NLA_PUT_STRING(msg, item[i].type, "");
/* bypass avg/stdev */
goto done;
default:
/* skip unknown values */
goto done;
}
if (item[i].flags & WPROBE_F_KEEPSTAT) {
NLA_PUT_U64(msg, WPROBE_VAL_SUM, val[i].s);
NLA_PUT_U64(msg, WPROBE_VAL_SUM_SQ, val[i].ss);
NLA_PUT_U32(msg, WPROBE_VAL_SAMPLES, (u32) val[i].n);
}
done:
genlmsg_end(msg, hdr);
return true;
nla_put_failure:
genlmsg_cancel(msg, hdr);
return false;
}
static bool
wprobe_send_item_info(struct sk_buff *msg, struct netlink_callback *cb,
struct wprobe_iface *dev,
const struct wprobe_item *item, int i)
{
struct genlmsghdr *hdr;
hdr = genlmsg_put(msg, NETLINK_CB(cb->skb).pid, cb->nlh->nlmsg_seq,
&wprobe_fam, NLM_F_MULTI, WPROBE_CMD_GET_LIST);
if ((i == 0) && (dev->addr != NULL))
NLA_PUT(msg, WPROBE_ATTR_MAC, 6, dev->addr);
NLA_PUT_U32(msg, WPROBE_ATTR_ID, (u32) i);
NLA_PUT_STRING(msg, WPROBE_ATTR_NAME, item[i].name);
NLA_PUT_U8(msg, WPROBE_ATTR_TYPE, item[i].type);
NLA_PUT_U32(msg, WPROBE_ATTR_FLAGS, item[i].flags);
genlmsg_end(msg, hdr);
return true;
nla_put_failure:
genlmsg_cancel(msg, hdr);
return false;
}
static struct wprobe_link *
wprobe_find_link(struct wprobe_iface *dev, const char *mac)
{
struct wprobe_link *l;
list_for_each_entry_rcu(l, &dev->links, list) {
if (!memcmp(l->addr, mac, 6))
return l;
}
return NULL;
}
static bool
wprobe_dump_link(struct sk_buff *msg, struct wprobe_link *l, struct netlink_callback *cb)
{
struct genlmsghdr *hdr;
hdr = genlmsg_put(msg, NETLINK_CB(cb->skb).pid, cb->nlh->nlmsg_seq,
&wprobe_fam, NLM_F_MULTI, WPROBE_CMD_GET_LINKS);
if (!hdr)
return false;
NLA_PUT(msg, WPROBE_ATTR_MAC, 6, l->addr);
genlmsg_end(msg, hdr);
return true;
nla_put_failure:
genlmsg_cancel(msg, hdr);
return false;
}
static int
wprobe_dump_links(struct sk_buff *skb, struct netlink_callback *cb)
{
struct wprobe_iface *dev = (struct wprobe_iface *)cb->args[0];
struct wprobe_link *l;
int err = 0;
int i = 0;
if (!dev) {
err = nlmsg_parse(cb->nlh, GENL_HDRLEN + wprobe_fam.hdrsize,
wprobe_fam.attrbuf, wprobe_fam.maxattr, wprobe_policy);
if (err)
goto done;
dev = wprobe_get_dev(wprobe_fam.attrbuf[WPROBE_ATTR_INTERFACE]);
if (!dev) {
err = -ENODEV;
goto done;
}
cb->args[0] = (long) dev;
} else {
if (!wprobe_check_ptr(&wprobe_if, &dev->list)) {
err = -ENODEV;
goto done;
}
}
rcu_read_lock();
list_for_each_entry_rcu(l, &dev->links, list) {
if (i < cb->args[1])
continue;
if (unlikely(!wprobe_dump_link(skb, l, cb)))
break;
i++;
}
cb->args[1] = i;
rcu_read_unlock();
err = skb->len;
done:
return err;
}
static void
wprobe_scale_stats(const struct wprobe_item *item, struct wprobe_value *val, int n, u32 flags)
{
u32 scale = 0;
int i;
for (i = 0; i < n; i++) {
if (!(item[i].flags & WPROBE_F_KEEPSTAT))
continue;
/* reset statistics, if requested */
if (flags & WPROBE_F_RESET)
scale = val[i].n;
else if (wprobe_fam.attrbuf[WPROBE_ATTR_SCALE])
scale = nla_get_u32(wprobe_fam.attrbuf[WPROBE_ATTR_SCALE]);
if ((scale > 0) && (val[i].n >= scale)) {
val[i].s = div_s64(val[i].s, scale);
val[i].ss = div_s64(val[i].ss, scale);
val[i].n /= scale;
}
}
}
#define WPROBE_F_LINK (1 << 31) /* for internal use */
static int
wprobe_dump_info(struct sk_buff *skb, struct netlink_callback *cb)
{
struct wprobe_iface *dev = (struct wprobe_iface *)cb->args[0];
struct wprobe_link *l = (struct wprobe_link *)cb->args[1];
struct wprobe_value *val;
const struct wprobe_item *item;
struct genlmsghdr *hdr;
unsigned long flags;
int cmd, n, i = cb->args[3];
u32 vflags = cb->args[2];
int err = 0;
hdr = (struct genlmsghdr *)nlmsg_data(cb->nlh);
cmd = hdr->cmd;
/* since the attribute value list might be too big for a single netlink
* message, the device, link and offset get stored in the netlink callback.
* if this is the first request, we need to do the full lookup for the device.
*
* access to the device and link structure is synchronized through rcu.
*/
rcu_read_lock();
if (!dev) {
err = nlmsg_parse(cb->nlh, GENL_HDRLEN + wprobe_fam.hdrsize,
wprobe_fam.attrbuf, wprobe_fam.maxattr, wprobe_policy);
if (err)
goto done;
err = -ENOENT;
dev = wprobe_get_dev(wprobe_fam.attrbuf[WPROBE_ATTR_INTERFACE]);
if (!dev)
goto done;
if (cmd == WPROBE_CMD_GET_INFO) {
if (wprobe_fam.attrbuf[WPROBE_ATTR_MAC]) {
l = wprobe_find_link(dev, nla_data(wprobe_fam.attrbuf[WPROBE_ATTR_MAC]));
if (!l)
goto done;
vflags = l->flags;
}
if (l) {
item = dev->link_items;
n = dev->n_link_items;
val = l->val;
} else {
item = dev->global_items;
n = dev->n_global_items;
val = dev->val;
}
/* sync data and move to temp storage for the query */
spin_lock_irqsave(&dev->lock, flags);
err = wprobe_sync_data(dev, l, true);
if (!err)
memcpy(dev->query_val, val, n * sizeof(struct wprobe_value));
wprobe_scale_stats(item, val, n, flags);
spin_unlock_irqrestore(&dev->lock, flags);
if (err)
goto done;
}
if (wprobe_fam.attrbuf[WPROBE_ATTR_FLAGS])
vflags |= nla_get_u32(wprobe_fam.attrbuf[WPROBE_ATTR_FLAGS]);
if (wprobe_fam.attrbuf[WPROBE_ATTR_MAC])
vflags |= WPROBE_F_LINK;
cb->args[0] = (long) dev;
cb->args[1] = (long) l;
cb->args[2] = vflags;
cb->args[3] = 0;
} else {
/* when pulling pointers from the callback, validate them
* against the list using rcu to make sure that we won't
* dereference pointers to free'd memory after the last
* grace period */
err = -ENOENT;
if (!wprobe_check_ptr(&wprobe_if, &dev->list))
goto done;
if (l && !wprobe_check_ptr(&dev->links, &l->list))
goto done;
}
if (vflags & WPROBE_F_LINK) {
item = dev->link_items;
n = dev->n_link_items;
} else {
item = dev->global_items;
n = dev->n_global_items;
}
err = 0;
switch(cmd) {
case WPROBE_CMD_GET_INFO:
while (i < n) {
if (!wprobe_send_item_value(skb, cb, dev, l, item, i, vflags))
break;
i++;
}
break;
case WPROBE_CMD_GET_LIST:
while (i < n) {
if (!wprobe_send_item_info(skb, cb, dev, item, i))
break;
i++;
}
break;
default:
err = -EINVAL;
goto done;
}
cb->args[3] = i;
err = skb->len;
done:
rcu_read_unlock();
return err;
}
#undef WPROBE_F_LINK
static int
wprobe_measure(struct sk_buff *skb, struct genl_info *info)
{
struct wprobe_iface *dev;
struct wprobe_link *l = NULL;
int err = -ENOENT;
rcu_read_lock();
dev = wprobe_get_dev(info->attrs[WPROBE_ATTR_INTERFACE]);
if (!dev)
goto done;
if (info->attrs[WPROBE_ATTR_MAC]) {
l = wprobe_find_link(dev, nla_data(wprobe_fam.attrbuf[WPROBE_ATTR_MAC]));
if (!l)
goto done;
}
err = wprobe_sync_data(dev, l, false);
done:
rcu_read_unlock();
return err;
}
static struct genl_ops wprobe_ops[] = {
{
.cmd = WPROBE_CMD_GET_INFO,
.dumpit = wprobe_dump_info,
.policy = wprobe_policy,
},
{
.cmd = WPROBE_CMD_GET_LIST,
.dumpit = wprobe_dump_info,
.policy = wprobe_policy,
},
{
.cmd = WPROBE_CMD_MEASURE,
.doit = wprobe_measure,
.policy = wprobe_policy,
},
{
.cmd = WPROBE_CMD_GET_LINKS,
.dumpit = wprobe_dump_links,
.policy = wprobe_policy,
}
};
static void __exit
wprobe_exit(void)
{
BUG_ON(!list_empty(&wprobe_if));
genl_unregister_family(&wprobe_fam);
}
static int __init
wprobe_init(void)
{
int i, err;
spin_lock_init(&wprobe_lock);
INIT_LIST_HEAD(&wprobe_if);
err = genl_register_family(&wprobe_fam);
if (err)
return err;
for (i = 0; i < ARRAY_SIZE(wprobe_ops); i++) {
err = genl_register_ops(&wprobe_fam, &wprobe_ops[i]);
if (err)
goto error;
}
return 0;
error:
genl_unregister_family(&wprobe_fam);
return err;
}
module_init(wprobe_init);
module_exit(wprobe_exit);
MODULE_LICENSE("GPL");

96
package/wprobe/src/kernel/wprobe-dummy.c Normal file
View File

@ -0,0 +1,96 @@
/*
* wprobe-core.c: Wireless probe interface dummy driver
* Copyright (C) 2008-2009 Felix Fietkau <nbd@openwrt.org>
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*/
#include <linux/kernel.h>
#include <linux/version.h>
#include <linux/module.h>
#include <linux/types.h>
#include <linux/spinlock.h>
#include <linux/random.h>
#include <linux/wprobe.h>
static const char local_addr[] = "\x00\x13\x37\xba\xbe\x00";
enum dummy_global_values {
DUMMY_GLOBAL_MEDIUM_BUSY
};
enum dummy_link_values {
DUMMY_LINK_SNR
};
struct wprobe_item dummy_perlink[] = {
[DUMMY_LINK_SNR] = {
.name = "snr",
.type = WPROBE_VAL_U8,
.flags = WPROBE_F_KEEPSTAT,
},
};
struct wprobe_item dummy_globals[] = {
[DUMMY_GLOBAL_MEDIUM_BUSY] = {
.name = "medium_busy",
.type = WPROBE_VAL_U8,
.flags = WPROBE_F_KEEPSTAT,
}
};
int dummy_sync(struct wprobe_iface *dev, struct wprobe_link *l, struct wprobe_value *val, bool measure)
{
u8 intval = 0;
get_random_bytes(&intval, 1);
if (l) {
WPROBE_FILL_BEGIN(val, dummy_perlink);
WPROBE_SET(DUMMY_LINK_SNR, U8, (intval % 40));
WPROBE_FILL_END();
} else {
WPROBE_FILL_BEGIN(val, dummy_globals);
WPROBE_SET(DUMMY_GLOBAL_MEDIUM_BUSY, U8, (intval % 100));
WPROBE_FILL_END();
}
return 0;
}
static struct wprobe_iface dummy_dev = {
.name = "dummy",
.addr = local_addr,
.link_items = dummy_perlink,
.n_link_items = ARRAY_SIZE(dummy_perlink),
.global_items = dummy_globals,
.n_global_items = ARRAY_SIZE(dummy_globals),
.sync_data = dummy_sync,
};
static struct wprobe_link dummy_link;
static int __init
wprobe_dummy_init(void)
{
wprobe_add_iface(&dummy_dev);
wprobe_add_link(&dummy_dev, &dummy_link, "\x00\x13\x37\xda\xda\x00");
return 0;
}
static void __exit
wprobe_dummy_exit(void)
{
wprobe_remove_link(&dummy_dev, &dummy_link);
wprobe_remove_iface(&dummy_dev);
}
module_init(wprobe_dummy_init);
module_exit(wprobe_dummy_exit);
MODULE_LICENSE("GPL");

21
package/wprobe/src/user/Makefile Normal file
View File

@ -0,0 +1,21 @@
CFLAGS = -O2
CPPFLAGS ?= -I../kernel
WFLAGS = -Wall -Werror
LDFLAGS =
LIBNL = -lnl
LIBM = -lm
LIBS = $(LIBNL) $(LIBM)
all: libwprobe.a wprobe-info
libwprobe.a: wprobe.o
rm -f $@
$(AR) rcu $@ $^
$(RANLIB) $@
%.o: %.c
$(CC) $(WFLAGS) -c -o $@ $(CPPFLAGS) $(CFLAGS) $<
wprobe-info: wprobe-info.o wprobe.o
$(CC) -o $@ $^ $(LDFLAGS) $(LIBS)

601
package/wprobe/src/user/list.h Normal file
View File

@ -0,0 +1,601 @@
#ifndef _LINUX_LIST_H
#define _LINUX_LIST_H
#include <stddef.h>
/**
* container_of - cast a member of a structure out to the containing structure
* @ptr: the pointer to the member.
* @type: the type of the container struct this is embedded in.
* @member: the name of the member within the struct.
*
*/
#ifndef container_of
#define container_of(ptr, type, member) ( \
(type *)( (char *)ptr - offsetof(type,member) ))
#endif
/*
* Simple doubly linked list implementation.
*
* Some of the internal functions ("__xxx") are useful when
* manipulating whole lists rather than single entries, as
* sometimes we already know the next/prev entries and we can
* generate better code by using them directly rather than
* using the generic single-entry routines.
*/
struct list_head {
struct list_head *next, *prev;
};
#define LIST_HEAD_INIT(name) { &(name), &(name) }
#define LIST_HEAD(name) \
struct list_head name = LIST_HEAD_INIT(name)
static inline void INIT_LIST_HEAD(struct list_head *list)
{
list->next = list;
list->prev = list;
}
/*
* Insert a new entry between two known consecutive entries.
*
* This is only for internal list manipulation where we know
* the prev/next entries already!
*/
static inline void __list_add(struct list_head *new,
struct list_head *prev,
struct list_head *next)
{
next->prev = new;
new->next = next;
new->prev = prev;
prev->next = new;
}
/**
* list_add - add a new entry
* @new: new entry to be added
* @head: list head to add it after
*
* Insert a new entry after the specified head.
* This is good for implementing stacks.
*/
static inline void list_add(struct list_head *new, struct list_head *head)
{
__list_add(new, head, head->next);
}
/**
* list_add_tail - add a new entry
* @new: new entry to be added
* @head: list head to add it before
*
* Insert a new entry before the specified head.
* This is useful for implementing queues.
*/
static inline void list_add_tail(struct list_head *new, struct list_head *head)
{
__list_add(new, head->prev, head);
}
/*
* Delete a list entry by making the prev/next entries
* point to each other.
*
* This is only for internal list manipulation where we know
* the prev/next entries already!
*/
static inline void __list_del(struct list_head * prev, struct list_head * next)
{
next->prev = prev;
prev->next = next;
}
/**
* list_del - deletes entry from list.
* @entry: the element to delete from the list.
* Note: list_empty() on entry does not return true after this, the entry is
* in an undefined state.
*/
static inline void list_del(struct list_head *entry)
{
__list_del(entry->prev, entry->next);
entry->next = NULL;
entry->prev = NULL;
}
/**
* list_replace - replace old entry by new one
* @old : the element to be replaced
* @new : the new element to insert
*
* If @old was empty, it will be overwritten.
*/
static inline void list_replace(struct list_head *old,
struct list_head *new)
{
new->next = old->next;
new->next->prev = new;
new->prev = old->prev;
new->prev->next = new;
}
static inline void list_replace_init(struct list_head *old,
struct list_head *new)
{
list_replace(old, new);
INIT_LIST_HEAD(old);
}
/**
* list_del_init - deletes entry from list and reinitialize it.
* @entry: the element to delete from the list.
*/
static inline void list_del_init(struct list_head *entry)
{
__list_del(entry->prev, entry->next);
INIT_LIST_HEAD(entry);
}
/**
* list_move - delete from one list and add as another's head
* @list: the entry to move
* @head: the head that will precede our entry
*/
static inline void list_move(struct list_head *list, struct list_head *head)
{
__list_del(list->prev, list->next);
list_add(list, head);
}
/**
* list_move_tail - delete from one list and add as another's tail
* @list: the entry to move
* @head: the head that will follow our entry
*/
static inline void list_move_tail(struct list_head *list,
struct list_head *head)
{
__list_del(list->prev, list->next);
list_add_tail(list, head);
}
/**
* list_is_last - tests whether @list is the last entry in list @head
* @list: the entry to test
* @head: the head of the list
*/
static inline int list_is_last(const struct list_head *list,
const struct list_head *head)
{
return list->next == head;
}
/**
* list_empty - tests whether a list is empty
* @head: the list to test.
*/
static inline int list_empty(const struct list_head *head)
{
return head->next == head;
}
/**
* list_empty_careful - tests whether a list is empty and not being modified
* @head: the list to test
*
* Description:
* tests whether a list is empty _and_ checks that no other CPU might be
* in the process of modifying either member (next or prev)
*
* NOTE: using list_empty_careful() without synchronization
* can only be safe if the only activity that can happen
* to the list entry is list_del_init(). Eg. it cannot be used
* if another CPU could re-list_add() it.
*/
static inline int list_empty_careful(const struct list_head *head)
{
struct list_head *next = head->next;
return (next == head) && (next == head->prev);
}
static inline void __list_splice(struct list_head *list,
struct list_head *head)
{
struct list_head *first = list->next;
struct list_head *last = list->prev;
struct list_head *at = head->next;
first->prev = head;
head->next = first;
last->next = at;
at->prev = last;
}
/**
* list_splice - join two lists
* @list: the new list to add.
* @head: the place to add it in the first list.
*/
static inline void list_splice(struct list_head *list, struct list_head *head)
{
if (!list_empty(list))
__list_splice(list, head);
}
/**
* list_splice_init - join two lists and reinitialise the emptied list.
* @list: the new list to add.
* @head: the place to add it in the first list.
*
* The list at @list is reinitialised
*/
static inline void list_splice_init(struct list_head *list,
struct list_head *head)
{
if (!list_empty(list)) {
__list_splice(list, head);
INIT_LIST_HEAD(list);
}
}
/**
* list_entry - get the struct for this entry
* @ptr: the &struct list_head pointer.
* @type: the type of the struct this is embedded in.
* @member: the name of the list_struct within the struct.
*/
#define list_entry(ptr, type, member) \
container_of(ptr, type, member)
/**
* list_first_entry - get the first element from a list
* @ptr: the list head to take the element from.
* @type: the type of the struct this is embedded in.
* @member: the name of the list_struct within the struct.
*
* Note, that list is expected to be not empty.
*/
#define list_first_entry(ptr, type, member) \
list_entry((ptr)->next, type, member)
/**
* list_for_each - iterate over a list
* @pos: the &struct list_head to use as a loop cursor.
* @head: the head for your list.
*/
#define list_for_each(pos, head) \
for (pos = (head)->next; pos != (head); \
pos = pos->next)
/**
* __list_for_each - iterate over a list
* @pos: the &struct list_head to use as a loop cursor.
* @head: the head for your list.
*
* This variant differs from list_for_each() in that it's the
* simplest possible list iteration code, no prefetching is done.
* Use this for code that knows the list to be very short (empty
* or 1 entry) most of the time.
*/
#define __list_for_each(pos, head) \
for (pos = (head)->next; pos != (head); pos = pos->next)
/**
* list_for_each_prev - iterate over a list backwards
* @pos: the &struct list_head to use as a loop cursor.
* @head: the head for your list.
*/
#define list_for_each_prev(pos, head) \
for (pos = (head)->prev; pos != (head); \
pos = pos->prev)
/**
* list_for_each_safe - iterate over a list safe against removal of list entry
* @pos: the &struct list_head to use as a loop cursor.
* @n: another &struct list_head to use as temporary storage
* @head: the head for your list.
*/
#define list_for_each_safe(pos, n, head) \
for (pos = (head)->next, n = pos->next; pos != (head); \
pos = n, n = pos->next)
/**
* list_for_each_prev_safe - iterate over a list backwards safe against removal of list entry
* @pos: the &struct list_head to use as a loop cursor.
* @n: another &struct list_head to use as temporary storage
* @head: the head for your list.
*/
#define list_for_each_prev_safe(pos, n, head) \
for (pos = (head)->prev, n = pos->prev; \
pos != (head); \
pos = n, n = pos->prev)
/**
* list_for_each_entry - iterate over list of given type
* @pos: the type * to use as a loop cursor.
* @head: the head for your list.
* @member: the name of the list_struct within the struct.
*/
#define list_for_each_entry(pos, head, member) \
for (pos = list_entry((head)->next, typeof(*pos), member); \
&pos->member != (head); \
pos = list_entry(pos->member.next, typeof(*pos), member))
/**
* list_for_each_entry_reverse - iterate backwards over list of given type.
* @pos: the type * to use as a loop cursor.
* @head: the head for your list.
* @member: the name of the list_struct within the struct.
*/
#define list_for_each_entry_reverse(pos, head, member) \
for (pos = list_entry((head)->prev, typeof(*pos), member); \
&pos->member != (head); \
pos = list_entry(pos->member.prev, typeof(*pos), member))
/**
* list_prepare_entry - prepare a pos entry for use in list_for_each_entry_continue()
* @pos: the type * to use as a start point
* @head: the head of the list
* @member: the name of the list_struct within the struct.
*
* Prepares a pos entry for use as a start point in list_for_each_entry_continue().
*/
#define list_prepare_entry(pos, head, member) \
((pos) ? : list_entry(head, typeof(*pos), member))
/**
* list_for_each_entry_continue - continue iteration over list of given type
* @pos: the type * to use as a loop cursor.
* @head: the head for your list.
* @member: the name of the list_struct within the struct.
*
* Continue to iterate over list of given type, continuing after
* the current position.
*/
#define list_for_each_entry_continue(pos, head, member) \
for (pos = list_entry(pos->member.next, typeof(*pos), member); \
&pos->member != (head); \
pos = list_entry(pos->member.next, typeof(*pos), member))
/**
* list_for_each_entry_continue_reverse - iterate backwards from the given point
* @pos: the type * to use as a loop cursor.
* @head: the head for your list.
* @member: the name of the list_struct within the struct.
*
* Start to iterate over list of given type backwards, continuing after
* the current position.
*/
#define list_for_each_entry_continue_reverse(pos, head, member) \
for (pos = list_entry(pos->member.prev, typeof(*pos), member); \
&pos->member != (head); \
pos = list_entry(pos->member.prev, typeof(*pos), member))
/**
* list_for_each_entry_from - iterate over list of given type from the current point
* @pos: the type * to use as a loop cursor.
* @head: the head for your list.
* @member: the name of the list_struct within the struct.
*
* Iterate over list of given type, continuing from current position.
*/
#define list_for_each_entry_from(pos, head, member) \
for (; &pos->member != (head); \
pos = list_entry(pos->member.next, typeof(*pos), member))
/**
* list_for_each_entry_safe - iterate over list of given type safe against removal of list entry
* @pos: the type * to use as a loop cursor.
* @n: another type * to use as temporary storage
* @head: the head for your list.
* @member: the name of the list_struct within the struct.
*/
#define list_for_each_entry_safe(pos, n, head, member) \
for (pos = list_entry((head)->next, typeof(*pos), member), \
n = list_entry(pos->member.next, typeof(*pos), member); \
&pos->member != (head); \
pos = n, n = list_entry(n->member.next, typeof(*n), member))
/**
* list_for_each_entry_safe_continue
* @pos: the type * to use as a loop cursor.
* @n: another type * to use as temporary storage
* @head: the head for your list.
* @member: the name of the list_struct within the struct.
*
* Iterate over list of given type, continuing after current point,
* safe against removal of list entry.
*/
#define list_for_each_entry_safe_continue(pos, n, head, member) \
for (pos = list_entry(pos->member.next, typeof(*pos), member), \
n = list_entry(pos->member.next, typeof(*pos), member); \
&pos->member != (head); \
pos = n, n = list_entry(n->member.next, typeof(*n), member))
/**
* list_for_each_entry_safe_from
* @pos: the type * to use as a loop cursor.
* @n: another type * to use as temporary storage
* @head: the head for your list.
* @member: the name of the list_struct within the struct.
*
* Iterate over list of given type from current point, safe against
* removal of list entry.
*/
#define list_for_each_entry_safe_from(pos, n, head, member) \
for (n = list_entry(pos->member.next, typeof(*pos), member); \
&pos->member != (head); \
pos = n, n = list_entry(n->member.next, typeof(*n), member))
/**
* list_for_each_entry_safe_reverse
* @pos: the type * to use as a loop cursor.
* @n: another type * to use as temporary storage
* @head: the head for your list.
* @member: the name of the list_struct within the struct.
*
* Iterate backwards over list of given type, safe against removal
* of list entry.
*/
#define list_for_each_entry_safe_reverse(pos, n, head, member) \
for (pos = list_entry((head)->prev, typeof(*pos), member), \
n = list_entry(pos->member.prev, typeof(*pos), member); \
&pos->member != (head); \
pos = n, n = list_entry(n->member.prev, typeof(*n), member))
/*
* Double linked lists with a single pointer list head.
* Mostly useful for hash tables where the two pointer list head is
* too wasteful.
* You lose the ability to access the tail in O(1).
*/
struct hlist_head {
struct hlist_node *first;
};
struct hlist_node {
struct hlist_node *next, **pprev;
};
#define HLIST_HEAD_INIT { .first = NULL }
#define HLIST_HEAD(name) struct hlist_head name = { .first = NULL }
#define INIT_HLIST_HEAD(ptr) ((ptr)->first = NULL)
static inline void INIT_HLIST_NODE(struct hlist_node *h)
{
h->next = NULL;
h->pprev = NULL;
}
static inline int hlist_unhashed(const struct hlist_node *h)
{
return !h->pprev;
}
static inline int hlist_empty(const struct hlist_head *h)
{
return !h->first;
}
static inline void __hlist_del(struct hlist_node *n)
{
struct hlist_node *next = n->next;
struct hlist_node **pprev = n->pprev;
*pprev = next;
if (next)
next->pprev = pprev;
}
static inline void hlist_del(struct hlist_node *n)
{
__hlist_del(n);
n->next = NULL;
n->pprev = NULL;
}
static inline void hlist_del_init(struct hlist_node *n)
{
if (!hlist_unhashed(n)) {
__hlist_del(n);
INIT_HLIST_NODE(n);
}
}
static inline void hlist_add_head(struct hlist_node *n, struct hlist_head *h)
{
struct hlist_node *first = h->first;
n->next = first;
if (first)
first->pprev = &n->next;
h->first = n;
n->pprev = &h->first;
}
/* next must be != NULL */
static inline void hlist_add_before(struct hlist_node *n,
struct hlist_node *next)
{
n->pprev = next->pprev;
n->next = next;
next->pprev = &n->next;
*(n->pprev) = n;
}
static inline void hlist_add_after(struct hlist_node *n,
struct hlist_node *next)
{
next->next = n->next;
n->next = next;
next->pprev = &n->next;
if(next->next)
next->next->pprev = &next->next;
}
#define hlist_entry(ptr, type, member) container_of(ptr,type,member)
#define hlist_for_each(pos, head) \
for (pos = (head)->first; pos; pos = pos->next)
#define hlist_for_each_safe(pos, n, head) \
for (pos = (head)->first; pos; pos = n)
/**
* hlist_for_each_entry - iterate over list of given type
* @tpos: the type * to use as a loop cursor.
* @pos: the &struct hlist_node to use as a loop cursor.
* @head: the head for your list.
* @member: the name of the hlist_node within the struct.
*/
#define hlist_for_each_entry(tpos, pos, head, member) \
for (pos = (head)->first; pos && \
({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); \
pos = pos->next)
/**
* hlist_for_each_entry_continue - iterate over a hlist continuing after current point
* @tpos: the type * to use as a loop cursor.
* @pos: the &struct hlist_node to use as a loop cursor.
* @member: the name of the hlist_node within the struct.
*/
#define hlist_for_each_entry_continue(tpos, pos, member) \
for (pos = (pos)->next; pos && \
({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); \
pos = pos->next)
/**
* hlist_for_each_entry_from - iterate over a hlist continuing from current point
* @tpos: the type * to use as a loop cursor.
* @pos: the &struct hlist_node to use as a loop cursor.
* @member: the name of the hlist_node within the struct.
*/
#define hlist_for_each_entry_from(tpos, pos, member) \
for (; pos && \
({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); \
pos = pos->next)
/**
* hlist_for_each_entry_safe - iterate over list of given type safe against removal of list entry
* @tpos: the type * to use as a loop cursor.
* @pos: the &struct hlist_node to use as a loop cursor.
* @n: another &struct hlist_node to use as temporary storage
* @head: the head for your list.
* @member: the name of the hlist_node within the struct.
*/
#define hlist_for_each_entry_safe(tpos, pos, n, head, member) \
for (pos = (head)->first; \
pos && ({ n = pos->next; 1; }) && \
({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); \
pos = n)
#endif

175
package/wprobe/src/user/wprobe-info.c Normal file
View File

@ -0,0 +1,175 @@
/*
* wprobe-test.c: Wireless probe user space test code
* Copyright (C) 2008-2009 Felix Fietkau <nbd@openwrt.org>
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*/
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <inttypes.h>
#include <errno.h>
#include <stdint.h>
#include <getopt.h>
#include <stdbool.h>
#include <unistd.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <linux/wprobe.h>
#include "wprobe.h"
static const char *
wprobe_dump_value(struct wprobe_attribute *attr)
{
static char buf[128];
#define HANDLE_TYPE(_type, _format) \
case WPROBE_VAL_##_type: \
snprintf(buf, sizeof(buf), _format, attr->val._type); \
break
switch(attr->type) {
HANDLE_TYPE(S8, "%d");
HANDLE_TYPE(S16, "%d");
HANDLE_TYPE(S32, "%d");
HANDLE_TYPE(S64, "%lld");
HANDLE_TYPE(U8, "%d");
HANDLE_TYPE(U16, "%d");
HANDLE_TYPE(U32, "%d");
HANDLE_TYPE(U64, "%lld");
case WPROBE_VAL_STRING:
/* FIXME: implement this */
default:
strncpy(buf, "<unknown>", sizeof(buf));
break;
}
if ((attr->flags & WPROBE_F_KEEPSTAT) &&
(attr->val.n > 0)) {
int len = strlen(buf);
snprintf(buf + len, sizeof(buf) - len, " (avg: %.02f; stdev: %.02f, n=%d)", attr->val.avg, attr->val.stdev, attr->val.n);
}
#undef HANDLE_TYPE
return buf;
}
static void
wprobe_dump_data(const char *ifname, struct list_head *gl, struct list_head *ll, struct list_head *ls)
{
struct wprobe_attribute *attr;
struct wprobe_link *link;
bool first = true;
fprintf(stderr, "\n");
wprobe_request_data(ifname, gl, NULL, 2);
list_for_each_entry(attr, gl, list) {
fprintf(stderr, (first ?
"Global: %s=%s\n" :
" %s=%s\n"),
attr->name,
wprobe_dump_value(attr)
);
first = false;
}
list_for_each_entry(link, ls, list) {
first = true;
wprobe_request_data(ifname, ll, link->addr, 2);
list_for_each_entry(attr, ll, list) {
if (first) {
fprintf(stderr,
"%02x:%02x:%02x:%02x:%02x:%02x: %s=%s\n",
link->addr[0], link->addr[1], link->addr[2],
link->addr[3], link->addr[4], link->addr[5],
attr->name,
wprobe_dump_value(attr));
first = false;
} else {
fprintf(stderr,
" %s=%s\n",
attr->name,
wprobe_dump_value(attr));
}
}
}
}
static const char *attr_typestr[] = {
[0] = "Unknown",
[WPROBE_VAL_STRING] = "String",
[WPROBE_VAL_U8] = "Unsigned 8 bit",
[WPROBE_VAL_U16] = "Unsigned 16 bit",
[WPROBE_VAL_U32] = "Unsigned 32 bit",
[WPROBE_VAL_U64] = "Unsigned 64 bit",
[WPROBE_VAL_S8] = "Signed 8 bit",
[WPROBE_VAL_S16] = "Signed 16 bit",
[WPROBE_VAL_S32] = "Signed 32 bit",
[WPROBE_VAL_S64] = "Signed 64 bit",
};
static int usage(const char *prog)
{
fprintf(stderr, "Usage: %s <interface>\n", prog);
return 1;
}
int main(int argc, char **argv)
{
struct wprobe_attribute *attr;
const char *ifname;
LIST_HEAD(global_attr);
LIST_HEAD(link_attr);
LIST_HEAD(links);
int i = 0;
if (argc < 2)
return usage(argv[0]);
ifname = argv[1];
if (wprobe_init() != 0)
return -1;
wprobe_dump_attributes(ifname, false, &global_attr, NULL);
wprobe_dump_attributes(ifname, true, &link_attr, NULL);
if (list_empty(&global_attr) &&
list_empty(&link_attr)) {
fprintf(stderr, "Interface '%s' not found\n", ifname);
return -1;
}
list_for_each_entry(attr, &global_attr, list) {
fprintf(stderr, "Global attribute: '%s' (%s)\n",
attr->name, attr_typestr[attr->type]);
}
list_for_each_entry(attr, &link_attr, list) {
fprintf(stderr, "Link attribute: '%s' (%s)\n",
attr->name, attr_typestr[attr->type]);
}
while (1) {
usleep(100 * 1000);
wprobe_measure(ifname);
if (i-- > 0)
continue;
i = 10;
wprobe_update_links(ifname, &links);
wprobe_dump_data(ifname, &global_attr, &link_attr, &links);
}
wprobe_free();
return 0;
}

472
package/wprobe/src/user/wprobe.c Normal file
View File

@ -0,0 +1,472 @@
/*
* wprobe.c: Wireless probe user space library
* Copyright (C) 2008-2009 Felix Fietkau <nbd@openwrt.org>
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*/
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <errno.h>
#include <getopt.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <math.h>
#include <linux/wprobe.h>
#include <netlink/netlink.h>
#include <netlink/genl/genl.h>
#include <netlink/genl/ctrl.h>
#include <netlink/genl/family.h>
#include "wprobe.h"
#define DEBUG 1
#ifdef DEBUG
#define DPRINTF(fmt, ...) fprintf(stderr, "%s(%d): " fmt, __func__, __LINE__, ##__VA_ARGS__)
#else
#define DPRINTF(fmt, ...) do {} while (0)
#endif
static struct nl_handle *handle = NULL;
static struct nl_cache *cache = NULL;
static struct genl_family *family = NULL;
static struct nlattr *tb[WPROBE_ATTR_LAST+1];
static struct nla_policy attribute_policy[WPROBE_ATTR_LAST+1] = {
[WPROBE_ATTR_ID] = { .type = NLA_U32 },
[WPROBE_ATTR_MAC] = { .type = NLA_UNSPEC, .minlen = 6, .maxlen = 6 },
[WPROBE_ATTR_NAME] = { .type = NLA_STRING },
[WPROBE_ATTR_FLAGS] = { .type = NLA_U32 },
[WPROBE_ATTR_TYPE] = { .type = NLA_U8 },
[WPROBE_VAL_S8] = { .type = NLA_U8 },
[WPROBE_VAL_S16] = { .type = NLA_U16 },
[WPROBE_VAL_S32] = { .type = NLA_U32 },
[WPROBE_VAL_S64] = { .type = NLA_U64 },
[WPROBE_VAL_U8] = { .type = NLA_U8 },
[WPROBE_VAL_U16] = { .type = NLA_U16 },
[WPROBE_VAL_U32] = { .type = NLA_U32 },
[WPROBE_VAL_U64] = { .type = NLA_U64 },
[WPROBE_VAL_SUM] = { .type = NLA_U64 },
[WPROBE_VAL_SUM_SQ] = { .type = NLA_U64 },
[WPROBE_VAL_SAMPLES] = { .type = NLA_U32 },
};
static int
error_handler(struct sockaddr_nl *nla, struct nlmsgerr *err, void *arg)
{
int *ret = arg;
*ret = err->error;
return NL_STOP;
}
static int
finish_handler(struct nl_msg *msg, void *arg)
{
int *ret = arg;
*ret = 0;
return NL_SKIP;
}
static int
ack_handler(struct nl_msg *msg, void *arg)
{
int *ret = arg;
*ret = 0;
return NL_STOP;
}
void
wprobe_free(void)
{
if (cache)
nl_cache_free(cache);
if (handle)
nl_handle_destroy(handle);
handle = NULL;
cache = NULL;
}
int
wprobe_init(void)
{
handle = nl_handle_alloc();
if (!handle) {
DPRINTF("Failed to create handle\n");
goto err;
}
if (genl_connect(handle)) {
DPRINTF("Failed to connect to generic netlink\n");
goto err;
}
cache = genl_ctrl_alloc_cache(handle);
if (!cache) {
DPRINTF("Failed to allocate netlink cache\n");
goto err;
}
family = genl_ctrl_search_by_name(cache, "wprobe");
if (!family) {
DPRINTF("wprobe API not present\n");
goto err;
}
return 0;
err:
wprobe_free();
return -EINVAL;
}
static struct nl_msg *
wprobe_new_msg(const char *ifname, int cmd, bool dump)
{
struct nl_msg *msg;
uint32_t flags = 0;
msg = nlmsg_alloc();
if (!msg)
return NULL;
if (dump)
flags |= NLM_F_DUMP;
genlmsg_put(msg, 0, 0, genl_family_get_id(family),
0, flags, cmd, 0);
NLA_PUT_STRING(msg, WPROBE_ATTR_INTERFACE, ifname);
nla_put_failure:
return msg;
}
static int
wprobe_send_msg(struct nl_msg *msg, void *callback, void *arg)
{
struct nl_cb *cb;
int err = 0;
cb = nl_cb_alloc(NL_CB_DEFAULT);
if (!cb)
goto out_no_cb;
if (callback)
nl_cb_set(cb, NL_CB_VALID, NL_CB_CUSTOM, callback, arg);
err = nl_send_auto_complete(handle, msg);
if (err < 0)
goto out;
err = 1;
nl_cb_err(cb, NL_CB_CUSTOM, error_handler, &err);
nl_cb_set(cb, NL_CB_FINISH, NL_CB_CUSTOM, finish_handler, &err);
nl_cb_set(cb, NL_CB_ACK, NL_CB_CUSTOM, ack_handler, &err);
while (err > 0)
nl_recvmsgs(handle, cb);
out:
nl_cb_put(cb);
out_no_cb:
nlmsg_free(msg);
return err;
}
struct wprobe_attr_cb {
struct list_head *list;
char *addr;
};
static int
save_attribute_handler(struct nl_msg *msg, void *arg)
{
struct genlmsghdr *gnlh = nlmsg_data(nlmsg_hdr(msg));
const char *name = "N/A";
struct wprobe_attribute *attr;
int type = 0;
struct wprobe_attr_cb *cb = arg;
nla_parse(tb, WPROBE_ATTR_LAST, genlmsg_attrdata(gnlh, 0),
genlmsg_attrlen(gnlh, 0), attribute_policy);
if (tb[WPROBE_ATTR_NAME])
name = nla_data(tb[WPROBE_ATTR_NAME]);
attr = malloc(sizeof(struct wprobe_attribute) + strlen(name) + 1);
if (!attr)
return -1;
memset(attr, 0, sizeof(struct wprobe_attribute));
if (tb[WPROBE_ATTR_ID])
attr->id = nla_get_u32(tb[WPROBE_ATTR_ID]);
if (tb[WPROBE_ATTR_MAC] && cb->addr)
memcpy(cb->addr, nla_data(tb[WPROBE_ATTR_MAC]), 6);
if (tb[WPROBE_ATTR_FLAGS])
attr->flags = nla_get_u32(tb[WPROBE_ATTR_FLAGS]);
if (tb[WPROBE_ATTR_TYPE])
type = nla_get_u8(tb[WPROBE_ATTR_TYPE]);
if ((type < WPROBE_VAL_STRING) ||
(type > WPROBE_VAL_U64))
type = 0;
attr->type = type;
strcpy(attr->name, name);
INIT_LIST_HEAD(&attr->list);
list_add(&attr->list, cb->list);
return 0;
}
int
wprobe_dump_attributes(const char *ifname, bool link, struct list_head *list, char *addr)
{
struct nl_msg *msg;
struct wprobe_attr_cb cb;
cb.list = list;
cb.addr = addr;
msg = wprobe_new_msg(ifname, WPROBE_CMD_GET_LIST, true);
if (!msg)
return -ENOMEM;
if (link)
NLA_PUT(msg, WPROBE_ATTR_MAC, 6, "\x00\x00\x00\x00\x00\x00");
return wprobe_send_msg(msg, save_attribute_handler, &cb);
nla_put_failure:
nlmsg_free(msg);
return -EINVAL;
}
static struct wprobe_link *
get_link(struct list_head *list, const char *addr)
{
struct wprobe_link *l;
list_for_each_entry(l, list, list) {
if (!memcmp(l->addr, addr, 6)) {
list_del_init(&l->list);
goto out;
}
}
/* no previous link found, allocate a new one */
l = malloc(sizeof(struct wprobe_link));
if (!l)
goto out;
memset(l, 0, sizeof(struct wprobe_link));
memcpy(l->addr, addr, sizeof(l->addr));
INIT_LIST_HEAD(&l->list);
out:
return l;
}
struct wprobe_save_cb {
struct list_head *list;
struct list_head old_list;
};
static int
save_link_handler(struct nl_msg *msg, void *arg)
{
struct genlmsghdr *gnlh = nlmsg_data(nlmsg_hdr(msg));
struct wprobe_link *link;
struct wprobe_save_cb *cb = arg;
const char *addr;
nla_parse(tb, WPROBE_ATTR_LAST, genlmsg_attrdata(gnlh, 0),
genlmsg_attrlen(gnlh, 0), attribute_policy);
if (!tb[WPROBE_ATTR_MAC] || (nla_len(tb[WPROBE_ATTR_MAC]) != 6))
return -1;
addr = nla_data(tb[WPROBE_ATTR_MAC]);
link = get_link(&cb->old_list, addr);
if (!link)
return -1;
if (tb[WPROBE_ATTR_FLAGS])
link->flags = nla_get_u32(tb[WPROBE_ATTR_FLAGS]);
list_add_tail(&link->list, cb->list);
return 0;
}
int
wprobe_update_links(const char *ifname, struct list_head *list)
{
struct wprobe_link *l, *tmp;
struct nl_msg *msg;
struct wprobe_save_cb cb;
int err;
INIT_LIST_HEAD(&cb.old_list);
list_splice_init(list, &cb.old_list);
cb.list = list;
msg = wprobe_new_msg(ifname, WPROBE_CMD_GET_LINKS, true);
if (!msg)
return -ENOMEM;
err = wprobe_send_msg(msg, save_link_handler, &cb);
if (err < 0)
return err;
list_for_each_entry_safe(l, tmp, &cb.old_list, list) {
list_del(&l->list);
free(l);
}
return 0;
}
void
wprobe_measure(const char *ifname)
{
struct nl_msg *msg;
msg = wprobe_new_msg(ifname, WPROBE_CMD_MEASURE, false);
if (!msg)
return;
wprobe_send_msg(msg, NULL, NULL);
}
struct wprobe_request_cb {
struct list_head *list;
struct list_head old_list;
char *addr;
};
static int
save_attrdata_handler(struct nl_msg *msg, void *arg)
{
struct genlmsghdr *gnlh = nlmsg_data(nlmsg_hdr(msg));
struct wprobe_request_cb *cb = arg;
struct wprobe_attribute *attr;
int type, id;
nla_parse(tb, WPROBE_ATTR_LAST, genlmsg_attrdata(gnlh, 0),
genlmsg_attrlen(gnlh, 0), attribute_policy);
if (!tb[WPROBE_ATTR_ID])
return -1;
if (!tb[WPROBE_ATTR_TYPE])
return -1;
id = nla_get_u32(tb[WPROBE_ATTR_ID]);
list_for_each_entry(attr, &cb->old_list, list) {
if (attr->id == id)
goto found;
}
/* not found */
return -1;
found:
list_del_init(&attr->list);
type = nla_get_u8(tb[WPROBE_ATTR_TYPE]);
if (type != attr->type) {
DPRINTF("WARNING: type mismatch for %s attribute '%s' (%d != %d)\n",
(cb->addr ? "link" : "global"),
attr->name,
type, attr->type);
goto out;
}
if ((type < WPROBE_VAL_STRING) ||
(type > WPROBE_VAL_U64))
goto out;
memset(&attr->val, 0, sizeof(attr->val));
#define HANDLE_INT_TYPE(_idx, _type) \
case WPROBE_VAL_S##_type: \
case WPROBE_VAL_U##_type: \
attr->val.U##_type = nla_get_u##_type(tb[_idx]); \
break
switch(type) {
HANDLE_INT_TYPE(type, 8);
HANDLE_INT_TYPE(type, 16);
HANDLE_INT_TYPE(type, 32);
HANDLE_INT_TYPE(type, 64);
case WPROBE_VAL_STRING:
/* unimplemented */
break;
}
#undef HANDLE_TYPE
if (attr->flags & WPROBE_F_KEEPSTAT) {
if (tb[WPROBE_VAL_SUM])
attr->val.s = nla_get_u64(tb[WPROBE_VAL_SUM]);
if (tb[WPROBE_VAL_SUM_SQ])
attr->val.ss = nla_get_u64(tb[WPROBE_VAL_SUM_SQ]);
if (tb[WPROBE_VAL_SAMPLES])
attr->val.n = nla_get_u32(tb[WPROBE_VAL_SAMPLES]);
if (attr->val.n > 0) {
float avg = ((float) attr->val.s) / attr->val.n;
float stdev = sqrt((((float) attr->val.ss) / attr->val.n) - (avg * avg));
attr->val.avg = avg;
attr->val.stdev = stdev;
}
}
out:
list_add_tail(&attr->list, cb->list);
return 0;
}
int
wprobe_request_data(const char *ifname, struct list_head *attrs, const unsigned char *addr, int scale)
{
struct wprobe_request_cb cb;
struct nl_msg *msg;
int err;
msg = wprobe_new_msg(ifname, WPROBE_CMD_GET_INFO, true);
if (!msg)
return -ENOMEM;
if (scale < 0)
NLA_PUT_U32(msg, WPROBE_ATTR_FLAGS, WPROBE_F_RESET);
else if (scale > 0)
NLA_PUT_U32(msg, WPROBE_ATTR_SCALE, scale);
if (addr)
NLA_PUT(msg, WPROBE_ATTR_MAC, 6, addr);
nla_put_failure:
INIT_LIST_HEAD(&cb.old_list);
list_splice_init(attrs, &cb.old_list);
cb.list = attrs;
err = wprobe_send_msg(msg, save_attrdata_handler, &cb);
list_splice(&cb.old_list, attrs->prev);
return err;
}

143
package/wprobe/src/user/wprobe.h Normal file
View File

@ -0,0 +1,143 @@
/*
* wprobe.h: Wireless probe user space library
* Copyright (C) 2008-2009 Felix Fietkau <nbd@openwrt.org>
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*/
#ifndef __WPROBE_USER_H
#define __WPROBE_USER_H
#include <inttypes.h>
#include <stdint.h>
#include <stdbool.h>
#include "list.h"
/**
* struct wprobe_value: data structure for attribute values
* @STRING: string value (currently unsupported)
* @U8: unsigned 8-bit integer value
* @U16: unsigned 16-bit integer value
* @U32: unsigned 32-bit integer value
* @U64: unsigned 64-bit integer value
* @S8: signed 8-bit integer value
* @S16: signed 16-bit integer value
* @S32: signed 32-bit integer value
* @S64: signed 64-bit integer value
*
* @n: number of sample values
* @avg: average value
* @stdev: standard deviation
* @s: sum of all sample values (internal use)
* @ss: sum of all sample values squared (internal use)
*/
struct wprobe_value {
/* attribute value */
union {
const char *STRING;
uint8_t U8;
uint16_t U16;
uint32_t U32;
uint64_t U64;
int8_t S8;
int16_t S16;
int32_t S32;
int64_t S64;
};
/* statistics */
int64_t s, ss;
float avg, stdev;
unsigned int n;
};
/**
* struct wprobe_attribute: data structures for attribute descriptions
* @list: linked list data structure for a list of attributes
* @id: attribute id
* @type: netlink type for the attribute (see kernel api documentation)
* @flags: attribute flags (see kernel api documentation)
* @val: cached version of the last netlink query, will be overwritten on each request
* @name: attribute name
*/
struct wprobe_attribute {
struct list_head list;
int id;
int type;
uint32_t flags;
struct wprobe_value val;
char name[];
};
/**
* struct wprobe_link: data structure for the link description
* @list: linked list data structure for a list of links
* @flags: link flags (see kernel api documentation)
* @addr: mac address of the remote link partner
*/
struct wprobe_link {
struct list_head list;
uint32_t flags;
unsigned char addr[6];
};
/**
* wprobe_init: initialize internal data structures and connect to the wprobe netlink api
*/
extern int wprobe_init(void);
/**
* wprobe_free: free all internally allocated data structures
*/
extern void wprobe_free(void);
/**
* wprobe_update_links: get a list of all link partners
* @ifname: name of the wprobe interface
* @list: linked list for storing link descriptions
*
* when wprobe_update_links is called multiple times, the linked list
* is updated with new link partners, old entries are automatically expired
*/
extern int wprobe_update_links(const char *ifname, struct list_head *list);
/**
* wprobe_measure: start a measurement request for all global attributes
* @ifname: name of the wprobe interface
*
* not all attributes are automatically filled with data, since for some
* it may be desirable to control the sampling interval from user space
* you can use this function to do that.
*/
extern void wprobe_measure(const char *ifname);
/**
* wprobe_dump_attributes: create a linked list of available attributes
* @ifname: name of the wprobe interface
* @link: false: get the list of global attributes; true: get the list of per-link attributes
* @list: linked list to store the attributes in
* @addr: buffer to store the interface's mac address in (optional)
*
* attributes must be freed by the caller
*/
extern int wprobe_dump_attributes(const char *ifname, bool link, struct list_head *list, char *addr);
/**
* wprobe_request_data: request new sampling values for the given list of attributes
* @ifname: name of the wprobe interface
* @attrs: attribute list
* @addr: (optional) mac address of the link partner
* @scale: scale down values by a factor (scale < 0: reset statistics entirely)
*
* if addr is unset, attrs must point to the list of global attributes,
* if addr is set, attrs must point to the list of per-link attributes
*/
extern int wprobe_request_data(const char *ifname, struct list_head *attrs, const unsigned char *addr, int scale);
#endif