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