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 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368
|
/*
This file is part of Kismet
Kismet 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.
Kismet 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 Kismet; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#include "config.h"
#include "util.h"
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <string.h>
#include <cstring>
// We need this to make uclibc happy since they don't even have rintf...
#ifndef rintf
#define rintf(x) (float) rint((double) (x))
#endif
// Munge input to shell-safe
void MungeToShell(char *in_data, int max) {
int i, j;
for (i = 0, j = 0; i < max && j < max; i++) {
if (in_data[i] == '\0')
break;
if (isalnum(in_data[i]) || isspace(in_data[i]) ||
in_data[i] == '=' || in_data[i] == '-' || in_data[i] == '_' ||
in_data[i] == '.' || in_data[i] == ',') {
if (j == i) {
j++;
} else {
in_data[j++] = in_data[i];
}
}
}
in_data[j] = '\0';
}
// Quick wrapper to save us time in other code
string MungeToShell(string in_data) {
char *data = new char[in_data.length() + 1];
string ret;
snprintf(data, in_data.length() + 1, "%s", in_data.c_str());
MungeToShell(data, in_data.length() + 1);
ret = data;
delete[] data;
return ret;
}
string StrLower(string in_str) {
string thestr = in_str;
for (unsigned int i = 0; i < thestr.length(); i++)
thestr[i] = tolower(thestr[i]);
return thestr;
}
string StrStrip(string in_str) {
string temp;
unsigned int start, end;
start = 0;
end = in_str.length();
if (in_str[0] == '\n')
return "";
for (unsigned int x = 0; x < in_str.length(); x++) {
if (in_str[x] != ' ' && in_str[x] != '\t') {
start = x;
break;
}
}
for (unsigned int x = in_str.length() - 1; x > 0; x--) {
if (in_str[x] != ' ' && in_str[x] != '\t' && in_str[x] != '\n') {
end = x;
break;
}
}
return in_str.substr(start, end-start+1);
}
int XtoI(char x) {
if (isxdigit(x)) {
if (x <= '9')
return x - '0';
return toupper(x) - 'A' + 10;
}
return -1;
}
int Hex2UChar(unsigned char *in_hex, unsigned char *in_chr) {
memset(in_chr, 0, sizeof(unsigned char) * WEPKEY_MAX);
int chrpos = 0;
for (unsigned int strpos = 0; strpos < WEPKEYSTR_MAX && chrpos < WEPKEY_MAX; strpos++) {
if (in_hex[strpos] == 0)
break;
if (in_hex[strpos] == ':')
strpos++;
// Assume we're going to eat the pair here
if (isxdigit(in_hex[strpos])) {
if (strpos > (WEPKEYSTR_MAX - 2))
return 0;
int d1, d2;
if ((d1 = XtoI(in_hex[strpos++])) == -1)
return 0;
if ((d2 = XtoI(in_hex[strpos])) == -1)
return 0;
in_chr[chrpos++] = (d1 * 16) + d2;
}
}
return(chrpos);
}
vector<string> StrTokenize(string in_str, string in_split, int return_partial) {
size_t begin = 0;
size_t end = in_str.find(in_split);
vector<string> ret;
if (in_str.length() == 0)
return ret;
while (end != string::npos) {
string sub = in_str.substr(begin, end-begin);
begin = end+1;
end = in_str.find(in_split, begin);
ret.push_back(sub);
}
if (return_partial && begin != in_str.size())
ret.push_back(in_str.substr(begin, in_str.size() - begin));
return ret;
}
vector<smart_word_token> SmartStrTokenize(string in_str, string in_split, int return_partial) {
size_t begin = 0;
size_t end = in_str.find(in_split);
vector<smart_word_token> ret;
smart_word_token stok;
if (in_str.length() == 0)
return ret;
while (end != string::npos) {
stok.word = in_str.substr(begin, end-begin);
stok.begin = begin;
stok.end = end;
begin = end+1;
end = in_str.find(in_split, begin);
ret.push_back(stok);
}
if (return_partial && begin != in_str.size()) {
stok.word = in_str.substr(begin, in_str.size() - begin);
stok.begin = begin;
stok.end = in_str.size();
ret.push_back(stok);
}
return ret;
}
vector<string> LineWrap(string in_txt, unsigned int in_hdr_len, unsigned int in_maxlen) {
vector<string> ret;
size_t pos, prev_pos, start, hdroffset;
start = hdroffset = 0;
for (pos = prev_pos = in_txt.find(' ', in_hdr_len); pos != string::npos; pos = in_txt.find(' ', pos + 1)) {
if ((hdroffset + pos) - start > in_maxlen) {
if (pos - prev_pos > 8) {
prev_pos = start + (in_maxlen - hdroffset);
}
string str(hdroffset, ' ');
hdroffset = in_hdr_len;
str += in_txt.substr(start, prev_pos - start);
ret.push_back(str);
start = prev_pos;
}
prev_pos = pos + 1;
}
string str(hdroffset, ' ');
str += in_txt.substr(start, in_txt.length() - start);
ret.push_back(str);
return ret;
}
void Float2Pair(float in_float, int16_t *primary, int64_t *mantissa) {
*primary = (int) in_float;
*mantissa = (long) (1000000 * ((in_float) - *primary));
}
float Pair2Float(int16_t primary, int64_t mantissa) {
return (double) primary + ((double) mantissa / 1000000);
}
vector<int> Str2IntVec(string in_text) {
vector<string> optlist = StrTokenize(in_text, ",");
vector<int> ret;
int ch;
for (unsigned int x = 0; x < optlist.size(); x++) {
if (sscanf(optlist[x].c_str(), "%d", &ch) != 1) {
ret.clear();
break;
}
ret.push_back(ch);
}
return ret;
}
int RunSysCmd(char *in_cmd) {
return system(in_cmd);
}
pid_t ExecSysCmd(char *in_cmd) {
// Slice it into an array to pass to exec
vector<string> cmdvec = StrTokenize(in_cmd, " ");
char **cmdarg = new char *[cmdvec.size() + 1];
pid_t retpid;
unsigned int x;
// Convert it to a pointer array
for (x = 0; x < cmdvec.size(); x++)
cmdarg[x] = (char *) cmdvec[x].c_str();
cmdarg[x] = NULL;
if ((retpid = fork()) == 0) {
// Nuke the file descriptors so that they don't blat on
// input or output
for (unsigned int x = 0; x < 256; x++)
close(x);
execve(cmdarg[0], cmdarg, NULL);
exit(0);
}
delete[] cmdarg;
return retpid;
}
#ifdef SYS_LINUX
int FetchSysLoadAvg(uint8_t *in_avgmaj, uint8_t *in_avgmin) {
FILE *lf;
short unsigned int tmaj, tmin;
if ((lf = fopen("/proc/loadavg", "r")) == NULL) {
return -1;
}
if (fscanf(lf, "%hu.%hu", &tmaj, &tmin) != 2) {
fclose(lf);
return -1;
}
(*in_avgmaj) = tmaj;
(*in_avgmin) = tmin;
fclose(lf);
return 1;
}
#endif
#define CHAR_OFFSET 0
uint32_t Adler32Checksum(char *buf1, int len) {
int i;
uint32_t s1, s2;
char *buf = (char *)buf1;
s1 = s2 = 0;
for (i = 0; i < (len-4); i+=4) {
s2 += 4*(s1 + buf[i]) + 3*buf[i+1] + 2*buf[i+2] + buf[i+3] +
10*CHAR_OFFSET;
s1 += (buf[i+0] + buf[i+1] + buf[i+2] + buf[i+3] + 4*CHAR_OFFSET);
}
for (; i < len; i++) {
s1 += (buf[i]+CHAR_OFFSET); s2 += s1;
}
return (s1 & 0xffff) + (s2 << 16);
}
// Taken from the BBN USRP 802.11 encoding code
inline unsigned int update_crc32_80211(unsigned int crc, const unsigned char *data,
int len, unsigned int poly) {
int i, j;
unsigned short ch;
for ( i = 0; i < len; ++i) {
ch = data[i];
for (j = 0; j < 8; ++j) {
if ((crc ^ ch) & 0x0001) {
crc = (crc >> 1) ^ poly;
} else {
crc = (crc >> 1);
}
ch >>= 1;
}
}
return crc;
}
void crc32_init_table_80211(unsigned int *crc32_table) {
int i;
unsigned char c;
for (i = 0; i < 256; ++i) {
c = (unsigned char) i;
crc32_table[i] = update_crc32_80211(0, &c, 1, IEEE_802_3_CRC32_POLY);
}
}
unsigned int crc32_le_80211(unsigned int *crc32_table, const unsigned char *buf, int len) {
int i;
unsigned int crc = 0xFFFFFFFF;
for (i = 0; i < len; ++i) {
crc = (crc >> 8) ^ crc32_table[(crc ^ buf[i]) & 0xFF];
}
crc ^= 0xFFFFFFFF;
return crc;
}
|