add wireless measurement probe infrastructure, developed at Fraunhofer FOKUS

SVN-Revision: 15050

5 files changed, 1412 insertions, 0 deletions

diff --git a/package/wprobe/src/user/Makefile b/package/wprobe/src/user/Makefile
new file mode 100644
index 0000000000..e10dfc0d24
--- /dev/null
+++ b/package/wprobe/src/user/Makefile
@@ -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)
diff --git a/package/wprobe/src/user/list.h b/package/wprobe/src/user/list.h
new file mode 100644
index 0000000000..2959a061d3
--- /dev/null
+++ b/package/wprobe/src/user/list.h
@@ -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
diff --git a/package/wprobe/src/user/wprobe-info.c b/package/wprobe/src/user/wprobe-info.c
new file mode 100644
index 0000000000..b8918711c6
--- /dev/null
+++ b/package/wprobe/src/user/wprobe-info.c
@@ -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;
+}
diff --git a/package/wprobe/src/user/wprobe.c b/package/wprobe/src/user/wprobe.c
new file mode 100644
index 0000000000..d591207daf
--- /dev/null
+++ b/package/wprobe/src/user/wprobe.c
@@ -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;
+}
+
+
diff --git a/package/wprobe/src/user/wprobe.h b/package/wprobe/src/user/wprobe.h
new file mode 100644
index 0000000000..e0c33faef2
--- /dev/null
+++ b/package/wprobe/src/user/wprobe.h
@@ -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