]> git.zerfleddert.de Git - proxmark3-svn/blob - client/util.c
chg: @piwi's code cleanup and some more.
[proxmark3-svn] / client / util.c
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" PRIx64 "", 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 rowlen;
148 if (breaks==0)
149 rowlen = ( len > MAX_BIN_BREAK_LENGTH ) ? MAX_BIN_BREAK_LENGTH : len;
150 else
151 rowlen = ( 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 < rowlen-1; out_index++) {
160 // set character
161 sprintf(tmp++, "%u", 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 != rowlen) ) {
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", 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 char *sprint_ascii(const uint8_t *data, const size_t len) {
200 static char buf[1024];
201 char *tmp = buf;
202 memset(buf, 0x00, 1024);
203 size_t max_len = (len > 1010) ? 1010 : len;
204 size_t i = 0;
205 while(i < max_len){
206 char c = data[i];
207 tmp[i] = ((c < 32) || (c == 127)) ? '.' : c;
208 ++i;
209 }
210 return buf;
211 }
212
213 void num_to_bytes(uint64_t n, size_t len, uint8_t* dest) {
214 while (len--) {
215 dest[len] = n & 0xFF;
216 n >>= 8;
217 }
218 }
219
220 uint64_t bytes_to_num(uint8_t* src, size_t len) {
221 uint64_t num = 0;
222 while (len--) {
223 num = (num << 8) | (*src);
224 src++;
225 }
226 return num;
227 }
228
229 // takes a number (uint64_t) and creates a binarray in dest.
230 void num_to_bytebits(uint64_t n, size_t len, uint8_t *dest) {
231 while (len--) {
232 dest[len] = n & 1;
233 n >>= 1;
234 }
235 }
236
237 //least significant bit first
238 void num_to_bytebitsLSBF(uint64_t n, size_t len, uint8_t *dest) {
239 for(int i = 0 ; i < len ; ++i) {
240 dest[i] = n & 1;
241 n >>= 1;
242 }
243 }
244
245 // aa,bb,cc,dd,ee,ff,gg,hh, ii,jj,kk,ll,mm,nn,oo,pp
246 // to
247 // hh,gg,ff,ee,dd,cc,bb,aa, pp,oo,nn,mm,ll,kk,jj,ii
248 // up to 64 bytes or 512 bits
249 uint8_t *SwapEndian64(const uint8_t *src, const size_t len, const uint8_t blockSize){
250 static uint8_t buf[64];
251 memset(buf, 0x00, 64);
252 uint8_t *tmp = buf;
253 for (uint8_t block=0; block < (uint8_t)(len/blockSize); block++){
254 for (size_t i = 0; i < blockSize; i++){
255 tmp[i+(blockSize*block)] = src[(blockSize-1-i)+(blockSize*block)];
256 }
257 }
258 return buf;
259 }
260
261 // takes a uint8_t src array, for len items and reverses the byte order in blocksizes (8,16,32,64),
262 // returns: the dest array contains the reordered src array.
263 void SwapEndian64ex(const uint8_t *src, const size_t len, const uint8_t blockSize, uint8_t *dest){
264 for (uint8_t block=0; block < (uint8_t)(len/blockSize); block++){
265 for (size_t i = 0; i < blockSize; i++){
266 dest[i+(blockSize*block)] = src[(blockSize-1-i)+(blockSize*block)];
267 }
268 }
269 }
270
271 // -------------------------------------------------------------------------
272 // string parameters lib
273 // -------------------------------------------------------------------------
274
275 // -------------------------------------------------------------------------
276 // line - param line
277 // bg, en - symbol numbers in param line of beginning an ending parameter
278 // paramnum - param number (from 0)
279 // -------------------------------------------------------------------------
280 int param_getptr(const char *line, int *bg, int *en, int paramnum)
281 {
282 int i;
283 int len = strlen(line);
284
285 *bg = 0;
286 *en = 0;
287
288 // skip spaces
289 while (line[*bg] ==' ' || line[*bg]=='\t') (*bg)++;
290 if (*bg >= len) {
291 return 1;
292 }
293
294 for (i = 0; i < paramnum; i++) {
295 while (line[*bg]!=' ' && line[*bg]!='\t' && line[*bg] != '\0') (*bg)++;
296 while (line[*bg]==' ' || line[*bg]=='\t') (*bg)++;
297
298 if (line[*bg] == '\0') return 1;
299 }
300
301 *en = *bg;
302 while (line[*en] != ' ' && line[*en] != '\t' && line[*en] != '\0') (*en)++;
303
304 (*en)--;
305
306 return 0;
307 }
308
309 char param_getchar(const char *line, int paramnum)
310 {
311 int bg, en;
312 if (param_getptr(line, &bg, &en, paramnum)) return 0x00;
313 return line[bg];
314 }
315
316 uint8_t param_get8(const char *line, int paramnum)
317 {
318 return param_get8ex(line, paramnum, 0, 10);
319 }
320
321 /**
322 * @brief Reads a decimal integer (actually, 0-254, not 255)
323 * @param line
324 * @param paramnum
325 * @return -1 if error
326 */
327 uint8_t param_getdec(const char *line, int paramnum, uint8_t *destination)
328 {
329 uint8_t val = param_get8ex(line, paramnum, 255, 10);
330 if( (int8_t) val == -1) return 1;
331 (*destination) = val;
332 return 0;
333 }
334 /**
335 * @brief Checks if param is decimal
336 * @param line
337 * @param paramnum
338 * @return
339 */
340 uint8_t param_isdec(const char *line, int paramnum)
341 {
342 int bg, en;
343 //TODO, check more thorougly
344 if (!param_getptr(line, &bg, &en, paramnum)) return 1;
345 // return strtoul(&line[bg], NULL, 10) & 0xff;
346
347 return 0;
348 }
349
350 uint8_t param_get8ex(const char *line, int paramnum, int deflt, int base)
351 {
352 int bg, en;
353 if (!param_getptr(line, &bg, &en, paramnum))
354 return strtoul(&line[bg], NULL, base) & 0xff;
355 else
356 return deflt;
357 }
358
359 uint32_t param_get32ex(const char *line, int paramnum, int deflt, int base)
360 {
361 int bg, en;
362 if (!param_getptr(line, &bg, &en, paramnum))
363 return strtoul(&line[bg], NULL, base);
364 else
365 return deflt;
366 }
367
368 uint64_t param_get64ex(const char *line, int paramnum, int deflt, int base)
369 {
370 int bg, en;
371 if (!param_getptr(line, &bg, &en, paramnum))
372 return strtoull(&line[bg], NULL, base);
373 else
374 return deflt;
375 }
376
377 int param_gethex(const char *line, int paramnum, uint8_t * data, int hexcnt)
378 {
379 int bg, en, i;
380 uint32_t temp;
381
382 if (hexcnt & 1) return 1;
383
384 if (param_getptr(line, &bg, &en, paramnum)) return 1;
385
386 if (en - bg + 1 != hexcnt) return 1;
387
388 for(i = 0; i < hexcnt; i += 2) {
389 if (!(isxdigit(line[bg + i]) && isxdigit(line[bg + i + 1])) ) return 1;
390
391 sscanf((char[]){line[bg + i], line[bg + i + 1], 0}, "%X", &temp);
392 data[i / 2] = temp & 0xff;
393 }
394
395 return 0;
396 }
397 int param_gethex_ex(const char *line, int paramnum, uint8_t * data, int *hexcnt)
398 {
399 int bg, en, i;
400 uint32_t temp;
401
402 //if (hexcnt % 2)
403 // return 1;
404
405 if (param_getptr(line, &bg, &en, paramnum)) return 1;
406
407 *hexcnt = en - bg + 1;
408 if (*hexcnt % 2) //error if not complete hex bytes
409 return 1;
410
411 for(i = 0; i < *hexcnt; i += 2) {
412 if (!(isxdigit(line[bg + i]) && isxdigit(line[bg + i + 1])) ) return 1;
413
414 sscanf((char[]){line[bg + i], line[bg + i + 1], 0}, "%X", &temp);
415 data[i / 2] = temp & 0xff;
416 }
417
418 return 0;
419 }
420 int param_getstr(const char *line, int paramnum, char * str)
421 {
422 int bg, en;
423 if (param_getptr(line, &bg, &en, paramnum)) return 0;
424
425 memcpy(str, line + bg, en - bg + 1);
426 str[en - bg + 1] = 0;
427
428 return en - bg + 1;
429 }
430
431 /*
432 The following methods comes from Rfidler sourcecode.
433 https://github.com/ApertureLabsLtd/RFIDler/blob/master/firmware/Pic32/RFIDler.X/src/
434 */
435
436 // convert hex to sequence of 0/1 bit values
437 // returns number of bits converted
438 int hextobinarray(char *target, char *source)
439 {
440 int length, i, count= 0;
441 char x;
442
443 length = strlen(source);
444 // process 4 bits (1 hex digit) at a time
445 while(length--)
446 {
447 x= *(source++);
448 // capitalize
449 if (x >= 'a' && x <= 'f')
450 x -= 32;
451 // convert to numeric value
452 if (x >= '0' && x <= '9')
453 x -= '0';
454 else if (x >= 'A' && x <= 'F')
455 x -= 'A' - 10;
456 else
457 return 0;
458 // output
459 for(i= 0 ; i < 4 ; ++i, ++count)
460 *(target++)= (x >> (3 - i)) & 1;
461 }
462
463 return count;
464 }
465
466 // convert hex to human readable binary string
467 int hextobinstring(char *target, char *source)
468 {
469 int length;
470
471 if(!(length= hextobinarray(target, source)))
472 return 0;
473 binarraytobinstring(target, target, length);
474 return length;
475 }
476
477 // convert binary array of 0x00/0x01 values to hex (safe to do in place as target will always be shorter than source)
478 // return number of bits converted
479 int binarraytohex(char *target, char *source, int length)
480 {
481 unsigned char i, x;
482 int j = length;
483
484 if(j % 4)
485 return 0;
486
487 while(j)
488 {
489 for(i= x= 0 ; i < 4 ; ++i)
490 x += ( source[i] << (3 - i));
491 sprintf(target,"%X", x);
492 ++target;
493 source += 4;
494 j -= 4;
495 }
496 return length;
497 }
498
499 // convert binary array to human readable binary
500 void binarraytobinstring(char *target, char *source, int length)
501 {
502 int i;
503
504 for(i= 0 ; i < length ; ++i)
505 *(target++)= *(source++) + '0';
506 *target= '\0';
507 }
508
509 // return parity bit required to match type
510 uint8_t GetParity( uint8_t *bits, uint8_t type, int length)
511 {
512 int x;
513 for( x = 0 ; length > 0 ; --length)
514 x += bits[length - 1];
515 x %= 2;
516 return x ^ type;
517 }
518
519 // add HID parity to binary array: EVEN prefix for 1st half of ID, ODD suffix for 2nd half
520 void wiegand_add_parity(uint8_t *target, uint8_t *source, uint8_t length)
521 {
522 *(target++)= GetParity(source, EVEN, length / 2);
523 memcpy(target, source, length);
524 target += length;
525 *(target)= GetParity(source + length / 2, ODD, length / 2);
526 }
527
528 // xor two arrays together for len items. The dst array contains the new xored values.
529 void xor(unsigned char * dst, unsigned char * src, size_t len) {
530 for( ; len > 0; len--,dst++,src++)
531 *dst ^= *src;
532 }
533
534 int32_t le24toh (uint8_t data[3]) {
535 return (data[2] << 16) | (data[1] << 8) | data[0];
536 }
537 uint32_t le32toh (uint8_t *data) {
538 return (uint32_t)( (data[3]<<24) | (data[2]<<16) | (data[1]<<8) | data[0]);
539 }
540 // Pack a bitarray into a uint32_t.
541 uint32_t PackBits(uint8_t start, uint8_t len, uint8_t* bits) {
542
543 if (len > 32) return 0;
544
545 int i = start;
546 int j = len-1;
547 uint32_t tmp = 0;
548
549 for (; j >= 0; --j, ++i)
550 tmp |= bits[i] << j;
551
552 return tmp;
553 }
554
555 // RotateLeft - Ultralight, Desfire, works on byte level
556 // 00-01-02 >> 01-02-00
557 void rol(uint8_t *data, const size_t len){
558 uint8_t first = data[0];
559 for (size_t i = 0; i < len-1; i++) {
560 data[i] = data[i+1];
561 }
562 data[len-1] = first;
563 }
564
565 // Swap bit order on a uint32_t value. Can be limited by nrbits just use say 8bits reversal
566 // And clears the rest of the bits.
567 uint32_t SwapBits(uint32_t value, int nrbits) {
568 uint32_t newvalue = 0;
569 for(int i = 0; i < nrbits; i++) {
570 newvalue ^= ((value >> i) & 1) << (nrbits - 1 - i);
571 }
572 return newvalue;
573 }
574 /*
575 ref http://www.csm.ornl.gov/~dunigan/crc.html
576 Returns the value v with the bottom b [0,32] bits reflected.
577 Example: reflect(0x3e23L,3) == 0x3e26
578 */
579 uint32_t reflect(uint32_t v, int b) {
580 uint32_t t = v;
581 for ( int i = 0; i < b; ++i) {
582 if (t & 1)
583 v |= BITMASK((b-1)-i);
584 else
585 v &= ~BITMASK((b-1)-i);
586 t>>=1;
587 }
588 return v;
589 }
590
591 uint64_t HornerScheme(uint64_t num, uint64_t divider, uint64_t factor) {
592 uint64_t remainder=0, quotient=0, result=0;
593 remainder = num % divider;
594 quotient = num / divider;
595 if(!(quotient == 0 && remainder == 0))
596 result += HornerScheme(quotient, divider, factor) * factor + remainder;
597 return result;
598 }
Impressum, Datenschutz