2 * Copyright (c) 2010-2011 Monthadar Al Jaberi, TerraNet AB
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer,
10 * without modification.
11 * 2. Redistributions in binary form must reproduce at minimum a disclaimer
12 * similar to the "NO WARRANTY" disclaimer below ("Disclaimer") and any
13 * redistribution must be conditioned upon including a substantially
14 * similar Disclaimer requirement for further binary redistribution.
17 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
18 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
19 * LIMITED TO, THE IMPLIED WARRANTIES OF NONINFRINGEMENT, MERCHANTIBILITY
20 * AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
21 * THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR SPECIAL, EXEMPLARY,
22 * OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
23 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
24 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
25 * IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
26 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
27 * THE POSSIBILITY OF SUCH DAMAGES.
31 #include <sys/param.h>
32 #include <sys/module.h>
33 #include <sys/kernel.h>
34 #include <sys/systm.h>
35 #include <sys/sysctl.h>
37 #include <sys/malloc.h>
39 #include <sys/mutex.h>
41 #include <sys/ucred.h>
44 #include <sys/sockio.h>
45 #include <sys/socket.h>
46 #include <sys/socketvar.h>
47 #include <sys/errno.h>
48 #include <sys/callout.h>
49 #include <sys/endian.h>
50 #include <sys/kthread.h>
51 #include <sys/taskqueue.h>
53 #include <sys/sysctl.h>
55 #include <machine/bus.h>
58 #include <net/if_dl.h>
59 #include <net/if_media.h>
60 #include <net/if_types.h>
61 #include <net/if_arp.h>
62 #include <net/ethernet.h>
63 #include <net/if_llc.h>
66 #include <net80211/ieee80211_var.h>
67 #include <net80211/ieee80211_regdomain.h>
72 #include <sys/errno.h>
73 #include <sys/conf.h> /* cdevsw struct */
74 #include <sys/uio.h> /* uio struct */
76 #include <netinet/in.h>
77 #include <netinet/if_ether.h>
79 #include "visibility.h"
81 /* Function prototypes */
82 static d_ioctl_t vis_ioctl;
84 static struct cdevsw vis_cdevsw = {
85 .d_version = D_VERSION,
92 visibility_init(struct wtap_plugin *plugin)
94 struct visibility_plugin *vis_plugin;
96 vis_plugin = (struct visibility_plugin *) plugin;
97 plugin->wp_sdev = make_dev(&vis_cdevsw,0,UID_ROOT,GID_WHEEL,0600,
98 (const char *)"visctl");
99 plugin->wp_sdev->si_drv1 = vis_plugin;
100 mtx_init(&vis_plugin->pl_mtx, "visibility_plugin mtx",
101 NULL, MTX_DEF | MTX_RECURSE);
102 printf("Using visibility wtap plugin...\n");
106 visibility_deinit(struct wtap_plugin *plugin)
108 struct visibility_plugin *vis_plugin;
110 vis_plugin = (struct visibility_plugin *) plugin;
111 destroy_dev(plugin->wp_sdev);
112 mtx_destroy(&vis_plugin->pl_mtx);
113 free(vis_plugin, M_WTAP_PLUGIN);
114 printf("Removing visibility wtap plugin...\n");
117 /* We need to use a mutex lock when we read out a visibility map
118 * and when we change visibility map from user space through IOCTL
121 visibility_work(struct wtap_plugin *plugin, struct packet *p)
123 struct visibility_plugin *vis_plugin =
124 (struct visibility_plugin *) plugin;
125 struct wtap_hal *hal = (struct wtap_hal *)vis_plugin->base.wp_hal;
128 KASSERT(mtod(p->m, const char *) != (const char *) 0xdeadc0de ||
129 mtod(p->m, const char *) != NULL,
130 ("[%s] got a corrupt packet from master queue, p->m=%p, p->id=%d\n",
131 __func__, p->m, p->id));
132 DWTAP_PRINTF("[%d] BROADCASTING m=%p\n", p->id, p->m);
133 mtx_lock(&vis_plugin->pl_mtx);
134 map = &vis_plugin->pl_node[p->id];
135 mtx_unlock(&vis_plugin->pl_mtx);
137 /* This is O(n*n) which is not optimal for large
138 * number of nodes. Another way of doing it is
139 * creating groups of nodes that hear each other.
140 * Atleast for this simple static node plugin.
142 for(int i=0; i<ARRAY_SIZE; ++i){
143 uint32_t index = map->map[i];
144 for(int j=0; j<32; ++j){
145 int vis = index & 0x01;
147 int k = i*ARRAY_SIZE + j;
148 if(hal->hal_devs[k] != NULL
149 && hal->hal_devs[k]->up == 1){
150 struct wtap_softc *sc =
153 m_dup(p->m, M_NOWAIT);
154 DWTAP_PRINTF("[%d] duplicated old_m=%p"
155 "to new_m=%p\n", p->id, p->m, m);
157 printf("[%d] sending to %d\n",
169 add_link(struct visibility_plugin *vis_plugin, struct link *l)
172 mtx_lock(&vis_plugin->pl_mtx);
173 struct vis_map *map = &vis_plugin->pl_node[l->id1];
174 int index = l->id2/ARRAY_SIZE;
175 int bit = l->id2 % ARRAY_SIZE;
176 uint32_t value = 1 << bit;
177 map->map[index] = map->map[index] | value;
178 mtx_unlock(&vis_plugin->pl_mtx);
180 printf("l->id1=%d, l->id2=%d, map->map[%d] = %u, bit=%d\n",
181 l->id1, l->id2, index, map->map[index], bit);
186 del_link(struct visibility_plugin *vis_plugin, struct link *l)
189 mtx_lock(&vis_plugin->pl_mtx);
190 struct vis_map *map = &vis_plugin->pl_node[l->id1];
191 int index = l->id2/ARRAY_SIZE;
192 int bit = l->id2 % ARRAY_SIZE;
193 uint32_t value = 1 << bit;
194 map->map[index] = map->map[index] & ~value;
195 mtx_unlock(&vis_plugin->pl_mtx);
197 printf("map->map[index] = %u\n", map->map[index]);
203 vis_ioctl(struct cdev *sdev, u_long cmd, caddr_t data,
204 int fflag, struct thread *td)
206 struct visibility_plugin *vis_plugin =
207 (struct visibility_plugin *) sdev->si_drv1;
208 struct wtap_hal *hal = vis_plugin->base.wp_hal;
213 CURVNET_SET(CRED_TO_VNET(curthread->td_ucred));
218 medium_close(hal->hal_md);
220 medium_open(hal->hal_md);
223 l = *(struct link *)data;
225 del_link(vis_plugin, &l);
227 add_link(vis_plugin, &l);
229 printf("op=%d, id1=%d, id2=%d\n", l.op, l.id1, l.id2);
233 DWTAP_PRINTF("Unknown WTAP IOCTL\n");