1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
|
/* horst - Highly Optimized Radio Scanning Tool
*
* Copyright (C) 2005-2016 Bruno Randolf (br1@einfach.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.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software Foundation,
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#include <stdlib.h>
#include <string.h>
#include "main.h"
#include "util.h"
#include "wlan80211.h"
#include "essid.h"
static void update_essid_split_status(struct essid_info* e)
{
struct node_info* n;
unsigned char* last_bssid = NULL;
e->split = 0;
/* essid can't be split if it only contains 1 node */
if (e->num_nodes <= 1 && essids.split_essid == e) {
essids.split_active = 0;
essids.split_essid = NULL;
return;
}
/* check for split */
list_for_each(&e->nodes, n, essid_nodes) {
DEBUG("SPLIT node %p src %s",
n, ether_sprintf(n->last_pkt.wlan_src));
DEBUG(" bssid %s\n", ether_sprintf(n->wlan_bssid));
if (n->wlan_mode & WLAN_MODE_AP)
continue;
if (last_bssid && memcmp(last_bssid, n->wlan_bssid, MAC_LEN) != 0) {
e->split = 1;
DEBUG("SPLIT *** DETECTED!!!\n");
}
last_bssid = n->wlan_bssid;
}
/* if a split occurred on this essid, record it */
if (e->split > 0) {
DEBUG("SPLIT *** active\n");
essids.split_active = 1;
essids.split_essid = e;
}
else if (e == essids.split_essid) {
DEBUG("SPLIT *** ok now\n");
essids.split_active = 0;
essids.split_essid = NULL;
}
}
void remove_node_from_essid(struct node_info* n)
{
DEBUG("SPLIT remove node from old essid\n");
list_del(&n->essid_nodes);
n->essid->num_nodes--;
update_essid_split_status(n->essid);
/* delete essid if it has no more nodes */
if (n->essid->num_nodes == 0) {
DEBUG("SPLIT essid empty, delete\n");
list_del(&n->essid->list);
free(n->essid);
}
n->essid = NULL;
}
void update_essids(struct packet_info* p, struct node_info* n)
{
struct essid_info* e;
if (n == NULL || (p->phy_flags & PHY_FLAG_BADFCS))
return; /* ignore */
/* only check beacons and probe response frames */
if ((p->wlan_type != WLAN_FRAME_BEACON) &&
(p->wlan_type != WLAN_FRAME_PROBE_RESP))
return;
DEBUG("SPLIT check ibss '%s' node %s ", p->wlan_essid,
ether_sprintf(p->wlan_src));
DEBUG("bssid %s\n", ether_sprintf(p->wlan_bssid));
/* find essid if already recorded */
list_for_each(&essids.list, e, list) {
if (strncmp(e->essid, p->wlan_essid, WLAN_MAX_SSID_LEN) == 0) {
DEBUG("SPLIT essid found\n");
break;
}
}
/* if not add new essid */
if (&e->list == &essids.list.n) {
DEBUG("SPLIT essid not found, adding new\n");
e = malloc(sizeof(struct essid_info));
strncpy(e->essid, p->wlan_essid, WLAN_MAX_SSID_LEN);
e->essid[WLAN_MAX_SSID_LEN-1] = '\0';
e->num_nodes = 0;
e->split = 0;
list_head_init(&e->nodes);
list_add_tail(&essids.list, &e->list);
}
/* if node had another essid before, remove it there */
if (n->essid != NULL && n->essid != e)
remove_node_from_essid(n);
/* new node */
if (n->essid == NULL) {
DEBUG("SPLIT node not found, adding new %s\n",
ether_sprintf(p->wlan_src));
list_add_tail(&e->nodes, &n->essid_nodes);
e->num_nodes++;
n->essid = e;
}
update_essid_split_status(e);
}
|
