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