]>
Commit | Line | Data |
---|---|---|
1 | //----------------------------------------------------------------------------- | |
2 | // Copyright (C) 2010 iZsh <izsh at fail0verflow.com> | |
3 | // | |
4 | // This code is licensed to you under the terms of the GNU GPL, version 2 or, | |
5 | // at your option, any later version. See the LICENSE.txt file for the text of | |
6 | // the license. | |
7 | //----------------------------------------------------------------------------- | |
8 | // utilities | |
9 | //----------------------------------------------------------------------------- | |
10 | ||
11 | #include "util.h" | |
12 | #define MAX_BIN_BREAK_LENGTH (3072+384+1) | |
13 | ||
14 | #ifndef _WIN32 | |
15 | #include <termios.h> | |
16 | #include <sys/ioctl.h> | |
17 | ||
18 | int ukbhit(void) | |
19 | { | |
20 | int cnt = 0; | |
21 | int error; | |
22 | static struct termios Otty, Ntty; | |
23 | ||
24 | if ( tcgetattr( 0, &Otty) == -1) return -1; | |
25 | Ntty = Otty; | |
26 | ||
27 | Ntty.c_iflag = 0; /* input mode */ | |
28 | Ntty.c_oflag = 0; /* output mode */ | |
29 | Ntty.c_lflag &= ~ICANON; /* raw mode */ | |
30 | Ntty.c_cc[VMIN] = CMIN; /* minimum time to wait */ | |
31 | Ntty.c_cc[VTIME] = CTIME; /* minimum characters to wait for */ | |
32 | ||
33 | if (0 == (error = tcsetattr(0, TCSANOW, &Ntty))) { | |
34 | error += ioctl(0, FIONREAD, &cnt); | |
35 | error += tcsetattr(0, TCSANOW, &Otty); | |
36 | } | |
37 | ||
38 | return ( error == 0 ? cnt : -1 ); | |
39 | } | |
40 | ||
41 | #else | |
42 | #include <conio.h> | |
43 | int ukbhit(void) { | |
44 | return kbhit(); | |
45 | } | |
46 | #endif | |
47 | ||
48 | // log files functions | |
49 | void AddLogLine(char *file, char *extData, char *c) { | |
50 | FILE *fLog = NULL; | |
51 | char filename[FILE_PATH_SIZE] = {0x00}; | |
52 | int len = 0; | |
53 | ||
54 | len = strlen(file); | |
55 | if (len > FILE_PATH_SIZE) len = FILE_PATH_SIZE; | |
56 | memcpy(filename, file, len); | |
57 | ||
58 | fLog = fopen(filename, "a"); | |
59 | if (!fLog) { | |
60 | printf("Could not append log file %s", filename); | |
61 | return; | |
62 | } | |
63 | ||
64 | fprintf(fLog, "%s", extData); | |
65 | fprintf(fLog, "%s\n", c); | |
66 | fclose(fLog); | |
67 | } | |
68 | ||
69 | void AddLogHex(char *fileName, char *extData, const uint8_t * data, const size_t len){ | |
70 | AddLogLine(fileName, extData, sprint_hex(data, len)); | |
71 | } | |
72 | ||
73 | void AddLogUint64(char *fileName, char *extData, const uint64_t data) { | |
74 | char buf[100] = {0}; | |
75 | sprintf(buf, "%x%x", (unsigned int)((data & 0xFFFFFFFF00000000) >> 32), (unsigned int)(data & 0xFFFFFFFF)); | |
76 | AddLogLine(fileName, extData, buf); | |
77 | } | |
78 | ||
79 | void AddLogCurrentDT(char *fileName) { | |
80 | char buff[20]; | |
81 | struct tm *curTime; | |
82 | ||
83 | time_t now = time(0); | |
84 | curTime = gmtime(&now); | |
85 | ||
86 | strftime (buff, sizeof(buff), "%Y-%m-%d %H:%M:%S", curTime); | |
87 | AddLogLine(fileName, "\nanticollision: ", buff); | |
88 | } | |
89 | ||
90 | void FillFileNameByUID(char *fileName, uint8_t * uid, char *ext, int byteCount) { | |
91 | char * fnameptr = fileName; | |
92 | memset(fileName, 0x00, 200); | |
93 | ||
94 | for (int j = 0; j < byteCount; j++, fnameptr += 2) | |
95 | sprintf(fnameptr, "%02x", uid[j]); | |
96 | sprintf(fnameptr, "%s", ext); | |
97 | } | |
98 | ||
99 | // printing and converting functions | |
100 | ||
101 | void print_hex(const uint8_t * data, const size_t len) | |
102 | { | |
103 | size_t i; | |
104 | ||
105 | for (i=0; i < len; i++) | |
106 | printf("%02x ", data[i]); | |
107 | ||
108 | printf("\n"); | |
109 | } | |
110 | ||
111 | char *sprint_hex(const uint8_t *data, const size_t len) { | |
112 | ||
113 | int maxLen = ( len > 1024/3) ? 1024/3 : len; | |
114 | static char buf[1024]; | |
115 | memset(buf, 0x00, 1024); | |
116 | char * tmp = buf; | |
117 | size_t i; | |
118 | ||
119 | for (i=0; i < maxLen; ++i, tmp += 3) | |
120 | sprintf(tmp, "%02X ", data[i]); | |
121 | ||
122 | return buf; | |
123 | } | |
124 | ||
125 | char *sprint_bin_break(const uint8_t *data, const size_t len, const uint8_t breaks) { | |
126 | // make sure we don't go beyond our char array memory | |
127 | int max_len; | |
128 | if (breaks==0) | |
129 | max_len = ( len > MAX_BIN_BREAK_LENGTH ) ? MAX_BIN_BREAK_LENGTH : len; | |
130 | else | |
131 | max_len = ( len+(len/breaks) > MAX_BIN_BREAK_LENGTH ) ? MAX_BIN_BREAK_LENGTH : len+(len/breaks); | |
132 | ||
133 | static char buf[MAX_BIN_BREAK_LENGTH]; // 3072 + end of line characters if broken at 8 bits | |
134 | //clear memory | |
135 | memset(buf, 0x00, sizeof(buf)); | |
136 | char *tmp = buf; | |
137 | ||
138 | size_t in_index = 0; | |
139 | // loop through the out_index to make sure we don't go too far | |
140 | for (size_t out_index=0; out_index < max_len-2; out_index++) { | |
141 | // set character | |
142 | sprintf(tmp++, "%u", data[in_index]); | |
143 | // check if a line break is needed and we have room to print it in our array | |
144 | if ( (breaks > 0) && !((in_index+1) % breaks) && (out_index+1 != max_len) ) { | |
145 | // increment and print line break | |
146 | out_index++; | |
147 | sprintf(tmp++, "%s","\n"); | |
148 | } | |
149 | in_index++; | |
150 | } | |
151 | ||
152 | return buf; | |
153 | } | |
154 | ||
155 | char *sprint_bin(const uint8_t *data, const size_t len) { | |
156 | return sprint_bin_break(data, len, 0); | |
157 | } | |
158 | ||
159 | char *sprint_hex_ascii(const uint8_t *data, const size_t len) { | |
160 | static char buf[1024]; | |
161 | memset(buf, 0x00, 1024); | |
162 | char *tmp = buf; | |
163 | sprintf(tmp, "%s| %s", sprint_hex(data, len) , data); | |
164 | return buf; | |
165 | } | |
166 | void num_to_bytes(uint64_t n, size_t len, uint8_t* dest) | |
167 | { | |
168 | while (len--) { | |
169 | dest[len] = (uint8_t) n; | |
170 | n >>= 8; | |
171 | } | |
172 | } | |
173 | ||
174 | uint64_t bytes_to_num(uint8_t* src, size_t len) | |
175 | { | |
176 | uint64_t num = 0; | |
177 | while (len--) | |
178 | { | |
179 | num = (num << 8) | (*src); | |
180 | src++; | |
181 | } | |
182 | return num; | |
183 | } | |
184 | ||
185 | void num_to_bytebits(uint64_t n, size_t len, uint8_t *dest) { | |
186 | while (len--) { | |
187 | dest[len] = n & 1; | |
188 | n >>= 1; | |
189 | } | |
190 | } | |
191 | ||
192 | // aa,bb,cc,dd,ee,ff,gg,hh, ii,jj,kk,ll,mm,nn,oo,pp | |
193 | // to | |
194 | // hh,gg,ff,ee,dd,cc,bb,aa, pp,oo,nn,mm,ll,kk,jj,ii | |
195 | // up to 64 bytes or 512 bits | |
196 | uint8_t *SwapEndian64(const uint8_t *src, const size_t len, const uint8_t blockSize){ | |
197 | uint8_t buf[64]; | |
198 | memset(buf, 0x00, 64); | |
199 | uint8_t *tmp = buf; | |
200 | for (uint8_t block=0; block < (uint8_t)(len/blockSize); block++){ | |
201 | for (size_t i = 0; i < blockSize; i++){ | |
202 | tmp[i+(blockSize*block)] = src[(blockSize-1-i)+(blockSize*block)]; | |
203 | } | |
204 | } | |
205 | return tmp; | |
206 | } | |
207 | ||
208 | void SwapEndian64ex(const uint8_t *src, const size_t len, const uint8_t blockSize, uint8_t *dest){ | |
209 | for (uint8_t block=0; block < (uint8_t)(len/blockSize); block++){ | |
210 | for (size_t i = 0; i < blockSize; i++){ | |
211 | dest[i+(blockSize*block)] = src[(blockSize-1-i)+(blockSize*block)]; | |
212 | } | |
213 | } | |
214 | } | |
215 | ||
216 | ||
217 | // ------------------------------------------------------------------------- | |
218 | // string parameters lib | |
219 | // ------------------------------------------------------------------------- | |
220 | ||
221 | // ------------------------------------------------------------------------- | |
222 | // line - param line | |
223 | // bg, en - symbol numbers in param line of beginning an ending parameter | |
224 | // paramnum - param number (from 0) | |
225 | // ------------------------------------------------------------------------- | |
226 | int param_getptr(const char *line, int *bg, int *en, int paramnum) | |
227 | { | |
228 | int i; | |
229 | int len = strlen(line); | |
230 | ||
231 | *bg = 0; | |
232 | *en = 0; | |
233 | ||
234 | // skip spaces | |
235 | while (line[*bg] ==' ' || line[*bg]=='\t') (*bg)++; | |
236 | if (*bg >= len) { | |
237 | return 1; | |
238 | } | |
239 | ||
240 | for (i = 0; i < paramnum; i++) { | |
241 | while (line[*bg]!=' ' && line[*bg]!='\t' && line[*bg] != '\0') (*bg)++; | |
242 | while (line[*bg]==' ' || line[*bg]=='\t') (*bg)++; | |
243 | ||
244 | if (line[*bg] == '\0') return 1; | |
245 | } | |
246 | ||
247 | *en = *bg; | |
248 | while (line[*en] != ' ' && line[*en] != '\t' && line[*en] != '\0') (*en)++; | |
249 | ||
250 | (*en)--; | |
251 | ||
252 | return 0; | |
253 | } | |
254 | ||
255 | ||
256 | char param_getchar(const char *line, int paramnum) | |
257 | { | |
258 | int bg, en; | |
259 | ||
260 | if (param_getptr(line, &bg, &en, paramnum)) return 0x00; | |
261 | ||
262 | return line[bg]; | |
263 | } | |
264 | ||
265 | uint8_t param_get8(const char *line, int paramnum) | |
266 | { | |
267 | return param_get8ex(line, paramnum, 0, 10); | |
268 | } | |
269 | ||
270 | /** | |
271 | * @brief Reads a decimal integer (actually, 0-254, not 255) | |
272 | * @param line | |
273 | * @param paramnum | |
274 | * @return -1 if error | |
275 | */ | |
276 | uint8_t param_getdec(const char *line, int paramnum, uint8_t *destination) | |
277 | { | |
278 | uint8_t val = param_get8ex(line, paramnum, 255, 10); | |
279 | if( (int8_t) val == -1) return 1; | |
280 | (*destination) = val; | |
281 | return 0; | |
282 | } | |
283 | /** | |
284 | * @brief Checks if param is decimal | |
285 | * @param line | |
286 | * @param paramnum | |
287 | * @return | |
288 | */ | |
289 | uint8_t param_isdec(const char *line, int paramnum) | |
290 | { | |
291 | int bg, en; | |
292 | //TODO, check more thorougly | |
293 | if (!param_getptr(line, &bg, &en, paramnum)) return 1; | |
294 | // return strtoul(&line[bg], NULL, 10) & 0xff; | |
295 | ||
296 | return 0; | |
297 | } | |
298 | ||
299 | uint8_t param_get8ex(const char *line, int paramnum, int deflt, int base) | |
300 | { | |
301 | int bg, en; | |
302 | ||
303 | if (!param_getptr(line, &bg, &en, paramnum)) | |
304 | return strtoul(&line[bg], NULL, base) & 0xff; | |
305 | else | |
306 | return deflt; | |
307 | } | |
308 | ||
309 | uint32_t param_get32ex(const char *line, int paramnum, int deflt, int base) | |
310 | { | |
311 | int bg, en; | |
312 | ||
313 | if (!param_getptr(line, &bg, &en, paramnum)) | |
314 | return strtoul(&line[bg], NULL, base); | |
315 | else | |
316 | return deflt; | |
317 | } | |
318 | ||
319 | uint64_t param_get64ex(const char *line, int paramnum, int deflt, int base) | |
320 | { | |
321 | int bg, en; | |
322 | ||
323 | if (!param_getptr(line, &bg, &en, paramnum)) | |
324 | return strtoull(&line[bg], NULL, base); | |
325 | else | |
326 | return deflt; | |
327 | ||
328 | return 0; | |
329 | } | |
330 | ||
331 | int param_gethex(const char *line, int paramnum, uint8_t * data, int hexcnt) | |
332 | { | |
333 | int bg, en, temp, i; | |
334 | ||
335 | if (hexcnt & 1) return 1; | |
336 | ||
337 | if (param_getptr(line, &bg, &en, paramnum)) return 1; | |
338 | ||
339 | if (en - bg + 1 != hexcnt) return 1; | |
340 | ||
341 | for(i = 0; i < hexcnt; i += 2) { | |
342 | if (!(isxdigit(line[bg + i]) && isxdigit(line[bg + i + 1])) ) return 1; | |
343 | ||
344 | sscanf((char[]){line[bg + i], line[bg + i + 1], 0}, "%X", &temp); | |
345 | data[i / 2] = temp & 0xff; | |
346 | } | |
347 | ||
348 | return 0; | |
349 | } | |
350 | int param_gethex_ex(const char *line, int paramnum, uint8_t * data, int *hexcnt) | |
351 | { | |
352 | int bg, en, temp, i; | |
353 | ||
354 | //if (hexcnt % 2) | |
355 | // return 1; | |
356 | ||
357 | if (param_getptr(line, &bg, &en, paramnum)) return 1; | |
358 | ||
359 | *hexcnt = en - bg + 1; | |
360 | if (*hexcnt % 2) //error if not complete hex bytes | |
361 | return 1; | |
362 | ||
363 | for(i = 0; i < *hexcnt; i += 2) { | |
364 | if (!(isxdigit(line[bg + i]) && isxdigit(line[bg + i + 1])) ) return 1; | |
365 | ||
366 | sscanf((char[]){line[bg + i], line[bg + i + 1], 0}, "%X", &temp); | |
367 | data[i / 2] = temp & 0xff; | |
368 | } | |
369 | ||
370 | return 0; | |
371 | } | |
372 | int param_getstr(const char *line, int paramnum, char * str) | |
373 | { | |
374 | int bg, en; | |
375 | ||
376 | if (param_getptr(line, &bg, &en, paramnum)) return 0; | |
377 | ||
378 | memcpy(str, line + bg, en - bg + 1); | |
379 | str[en - bg + 1] = 0; | |
380 | ||
381 | return en - bg + 1; | |
382 | } | |
383 | ||
384 | /* | |
385 | The following methods comes from Rfidler sourcecode. | |
386 | https://github.com/ApertureLabsLtd/RFIDler/blob/master/firmware/Pic32/RFIDler.X/src/ | |
387 | */ | |
388 | ||
389 | // convert hex to sequence of 0/1 bit values | |
390 | // returns number of bits converted | |
391 | int hextobinarray(char *target, char *source) | |
392 | { | |
393 | int length, i, count= 0; | |
394 | char x; | |
395 | ||
396 | length = strlen(source); | |
397 | // process 4 bits (1 hex digit) at a time | |
398 | while(length--) | |
399 | { | |
400 | x= *(source++); | |
401 | // capitalize | |
402 | if (x >= 'a' && x <= 'f') | |
403 | x -= 32; | |
404 | // convert to numeric value | |
405 | if (x >= '0' && x <= '9') | |
406 | x -= '0'; | |
407 | else if (x >= 'A' && x <= 'F') | |
408 | x -= 'A' - 10; | |
409 | else | |
410 | return 0; | |
411 | // output | |
412 | for(i= 0 ; i < 4 ; ++i, ++count) | |
413 | *(target++)= (x >> (3 - i)) & 1; | |
414 | } | |
415 | ||
416 | return count; | |
417 | } | |
418 | ||
419 | // convert hex to human readable binary string | |
420 | int hextobinstring(char *target, char *source) | |
421 | { | |
422 | int length; | |
423 | ||
424 | if(!(length= hextobinarray(target, source))) | |
425 | return 0; | |
426 | binarraytobinstring(target, target, length); | |
427 | return length; | |
428 | } | |
429 | ||
430 | // convert binary array of 0x00/0x01 values to hex (safe to do in place as target will always be shorter than source) | |
431 | // return number of bits converted | |
432 | int binarraytohex(char *target, char *source, int length) | |
433 | { | |
434 | unsigned char i, x; | |
435 | int j = length; | |
436 | ||
437 | if(j % 4) | |
438 | return 0; | |
439 | ||
440 | while(j) | |
441 | { | |
442 | for(i= x= 0 ; i < 4 ; ++i) | |
443 | x += ( source[i] << (3 - i)); | |
444 | sprintf(target,"%X", x); | |
445 | ++target; | |
446 | source += 4; | |
447 | j -= 4; | |
448 | } | |
449 | return length; | |
450 | } | |
451 | ||
452 | // convert binary array to human readable binary | |
453 | void binarraytobinstring(char *target, char *source, int length) | |
454 | { | |
455 | int i; | |
456 | ||
457 | for(i= 0 ; i < length ; ++i) | |
458 | *(target++)= *(source++) + '0'; | |
459 | *target= '\0'; | |
460 | } | |
461 | ||
462 | // return parity bit required to match type | |
463 | uint8_t GetParity( uint8_t *bits, uint8_t type, int length) | |
464 | { | |
465 | int x; | |
466 | for( x = 0 ; length > 0 ; --length) | |
467 | x += bits[length - 1]; | |
468 | x %= 2; | |
469 | return x ^ type; | |
470 | } | |
471 | ||
472 | // add HID parity to binary array: EVEN prefix for 1st half of ID, ODD suffix for 2nd half | |
473 | void wiegand_add_parity(uint8_t *target, uint8_t *source, uint8_t length) | |
474 | { | |
475 | *(target++)= GetParity(source, EVEN, length / 2); | |
476 | memcpy(target, source, length); | |
477 | target += length; | |
478 | *(target)= GetParity(source + length / 2, ODD, length / 2); | |
479 | } | |
480 | ||
481 | void xor(unsigned char * dst, unsigned char * src, size_t len) { | |
482 | for( ; len > 0; len--,dst++,src++) | |
483 | *dst ^= *src; | |
484 | } | |
485 | ||
486 | int32_t le24toh (uint8_t data[3]) { | |
487 | return (data[2] << 16) | (data[1] << 8) | data[0]; | |
488 | } | |
489 | ||
490 | uint32_t PackBits(uint8_t start, uint8_t len, uint8_t* bits) { | |
491 | ||
492 | if (len > 32) return 0; | |
493 | ||
494 | int i = start; | |
495 | int j = len-1; | |
496 | uint32_t tmp = 0; | |
497 | ||
498 | for (; j >= 0; --j, ++i) | |
499 | tmp |= bits[i] << j; | |
500 | ||
501 | return tmp; | |
502 | } | |
503 | ||
504 | // RotateLeft - Ultralight, Desfire, works on byte level | |
505 | // 00-01-02 >> 01-02-00 | |
506 | void rol(uint8_t *data, const size_t len){ | |
507 | uint8_t first = data[0]; | |
508 | for (size_t i = 0; i < len-1; i++) { | |
509 | data[i] = data[i+1]; | |
510 | } | |
511 | data[len-1] = first; | |
512 | } |