proxmark3/client/util.c

881 lines
24 KiB
C
Raw Normal View History

//-----------------------------------------------------------------------------
// Copyright (C) 2010 iZsh <izsh at fail0verflow.com>
//
// This code is licensed to you under the terms of the GNU GPL, version 2 or,
// at your option, any later version. See the LICENSE.txt file for the text of
// the license.
//-----------------------------------------------------------------------------
// utilities
//-----------------------------------------------------------------------------
2019-04-13 09:01:31 +08:00
// ensure gmtime_r is available even with -std=c99; must be included before
#if !defined(_WIN32) && !defined(__APPLE__)
2019-04-13 09:01:31 +08:00
#define _POSIX_C_SOURCE 200112L
#endif
#include "util.h"
2017-07-28 05:00:49 +08:00
#include <stdarg.h>
#include <inttypes.h>
#include <string.h>
#include <ctype.h>
#include <stdlib.h>
#include <stdio.h>
#include <time.h> // Mingw
#include "ui.h" // PrintAndLog
#define UTIL_BUFFER_SIZE_SPRINT 4097
// global client debug variable
uint8_t g_debugMode = 0;
2019-09-10 03:01:43 +08:00
// global client disable logging variable
2019-09-10 03:30:25 +08:00
uint8_t g_printAndLog = PRINTANDLOG_PRINT | PRINTANDLOG_LOG;
2017-07-28 05:00:49 +08:00
#ifdef _WIN32
#include <windows.h>
#endif
#define MAX_BIN_BREAK_LENGTH (3072+384+1)
2010-07-13 21:39:30 +08:00
2013-03-01 05:36:09 +08:00
#ifndef _WIN32
2017-07-28 05:00:49 +08:00
#include <unistd.h>
#include <fcntl.h>
int kbd_enter_pressed(void) {
int flags;
if ((flags = fcntl(STDIN_FILENO, F_GETFL, 0)) < 0) {
PrintAndLogEx(ERR, "fcntl failed in kbd_enter_pressed");
return -1;
2019-03-10 06:35:06 +08:00
}
//non-blocking
flags |= O_NONBLOCK;
if (fcntl(STDIN_FILENO, F_SETFL, flags) < 0) {
PrintAndLogEx(ERR, "fcntl failed in kbd_enter_pressed");
return -1;
}
int c;
int ret = 0;
do { //get all available chars
c = getchar();
ret |= c == '\n';
} while (c != EOF);
//blocking
flags &= ~O_NONBLOCK;
if (fcntl(STDIN_FILENO, F_SETFL, flags) < 0) {
PrintAndLogEx(ERR, "fcntl failed in kbd_enter_pressed");
return -1;
}
return ret;
}
#else
2017-07-28 05:00:49 +08:00
#include <conio.h>
int kbd_enter_pressed(void) {
int ret = 0;
2019-07-13 06:38:30 +08:00
while (kbhit()) {
ret |= getch() == '\r';
}
return ret;
}
#endif
// log files functions
2018-01-17 07:30:43 +08:00
// open, appped and close logfile
void AddLogLine(const char *fn, const char *data, const char *c) {
2019-03-10 06:35:06 +08:00
FILE *f = NULL;
char filename[FILE_PATH_SIZE] = {0x00};
int len = 0;
2018-01-17 07:30:43 +08:00
len = strlen(fn);
if (len > FILE_PATH_SIZE)
2019-03-10 06:35:06 +08:00
len = FILE_PATH_SIZE;
2018-01-17 07:30:43 +08:00
memcpy(filename, fn, len);
2019-03-10 06:35:06 +08:00
f = fopen(filename, "a");
if (!f) {
2019-05-18 23:56:03 +08:00
PrintAndLogEx(ERR, "Could not append log file" _YELLOW_("%s"), filename);
2019-03-10 06:35:06 +08:00
return;
}
2019-03-10 06:35:06 +08:00
fprintf(f, "%s", data);
fprintf(f, "%s\n", c);
fflush(f);
fclose(f);
}
void AddLogHex(const char *fn, const char *extData, const uint8_t *data, const size_t len) {
2019-03-10 06:35:06 +08:00
AddLogLine(fn, extData, sprint_hex(data, len));
}
void AddLogUint64(const char *fn, const char *data, const uint64_t value) {
2019-03-10 06:35:06 +08:00
char buf[20] = {0};
memset(buf, 0x00, sizeof(buf));
sprintf(buf, "%016" PRIx64 "", value);
AddLogLine(fn, data, buf);
}
void AddLogCurrentDT(const char *fn) {
2019-04-13 09:01:31 +08:00
char buf[20] = {0};
struct tm *ct, tm_buf;
time_t now = time(NULL);
#if defined(_WIN32)
ct = gmtime_s(&tm_buf, &now) == 0 ? &tm_buf : NULL;
#else
ct = gmtime_r(&now, &tm_buf);
#endif
strftime(buf, sizeof(buf), "%Y-%m-%d %H:%M:%S", ct);
2019-03-10 06:35:06 +08:00
AddLogLine(fn, "\nanticollision: ", buf);
}
2018-01-17 07:30:43 +08:00
// create filename on hex uid.
// param *fn - pointer to filename char array
// param *uid - pointer to uid byte array
// param *ext - ".log"
// param uidlen - length of uid array.
void FillFileNameByUID(char *filenamePrefix, const uint8_t *uid, const char *ext, const int uidlen) {
2019-03-10 07:00:59 +08:00
if (filenamePrefix == NULL || uid == NULL || ext == NULL) {
2019-03-10 06:35:06 +08:00
return;
}
2019-05-18 23:56:03 +08:00
int len = strlen(filenamePrefix);
2019-03-10 06:35:06 +08:00
for (int j = 0; j < uidlen; j++)
sprintf(filenamePrefix + len + j * 2, "%02X", uid[j]);
strcat(filenamePrefix, ext);
}
// fill buffer from structure [{uint8_t data, size_t length},...]
int FillBuffer(uint8_t *data, size_t maxDataLength, size_t *dataLength, ...) {
2019-03-10 06:35:06 +08:00
*dataLength = 0;
va_list valist;
va_start(valist, dataLength);
uint8_t *vdata = NULL;
2019-04-08 00:12:58 +08:00
2019-03-10 07:00:59 +08:00
do {
2019-03-10 06:35:06 +08:00
vdata = va_arg(valist, uint8_t *);
if (!vdata)
break;
2019-04-08 00:12:58 +08:00
size_t vlength = va_arg(valist, size_t);
2019-03-10 06:35:06 +08:00
if (*dataLength + vlength > maxDataLength) {
va_end(valist);
return 1;
}
2019-03-10 06:35:06 +08:00
memcpy(&data[*dataLength], vdata, vlength);
*dataLength += vlength;
2019-03-10 06:35:06 +08:00
} while (vdata);
2019-03-10 06:35:06 +08:00
va_end(valist);
2019-03-10 06:35:06 +08:00
return 0;
}
bool CheckStringIsHEXValue(const char *value) {
for (size_t i = 0; i < strlen(value); i++)
2019-03-10 06:35:06 +08:00
if (!isxdigit(value[i]))
return false;
2018-11-22 01:44:31 +08:00
2019-03-10 06:35:06 +08:00
if (strlen(value) % 2)
return false;
2019-03-10 06:35:06 +08:00
return true;
2018-11-22 01:44:31 +08:00
}
void hex_to_buffer(const uint8_t *buf, const uint8_t *hex_data, const size_t hex_len, const size_t hex_max_len,
const size_t min_str_len, const size_t spaces_between, bool uppercase) {
2019-07-13 06:38:30 +08:00
if (buf == NULL) return;
2019-03-10 06:35:06 +08:00
char *tmp = (char *)buf;
size_t i;
memset(tmp, 0x00, hex_max_len);
size_t maxLen = (hex_len > hex_max_len) ? hex_max_len : hex_len;
2019-03-10 06:35:06 +08:00
for (i = 0; i < maxLen; ++i, tmp += 2 + spaces_between) {
sprintf(tmp, (uppercase) ? "%02X" : "%02x", (unsigned int) hex_data[i]);
for (size_t j = 0; j < spaces_between; j++)
2019-03-10 06:35:06 +08:00
sprintf(tmp + 2 + j, " ");
}
2019-03-10 06:35:06 +08:00
i *= (2 + spaces_between);
size_t minStrLen = min_str_len > i ? min_str_len : 0;
2019-03-10 06:35:06 +08:00
if (minStrLen > hex_max_len)
minStrLen = hex_max_len;
2019-03-10 07:00:59 +08:00
for (; i < minStrLen; i++, tmp += 1)
2019-03-10 06:35:06 +08:00
sprintf(tmp, " ");
2019-03-10 06:35:06 +08:00
return;
}
// printing and converting functions
void print_hex(const uint8_t *data, const size_t len) {
2019-07-13 06:38:30 +08:00
if (data == NULL || len == 0) return;
for (size_t i = 0; i < len; i++)
2019-03-10 06:35:06 +08:00
printf("%02x ", data[i]);
printf("\n");
}
void print_hex_break(const uint8_t *data, const size_t len, uint8_t breaks) {
2019-07-13 06:38:30 +08:00
if (data == NULL || len == 0) return;
2019-03-10 06:35:06 +08:00
int rownum = 0;
printf("[%02d] | ", rownum);
for (size_t i = 0; i < len; ++i) {
2010-07-13 21:39:30 +08:00
2019-03-10 06:35:06 +08:00
printf("%02X ", data[i]);
2019-03-10 06:35:06 +08:00
// check if a line break is needed
2019-03-10 07:00:59 +08:00
if (breaks > 0 && !((i + 1) % breaks) && (i + 1 < len)) {
2019-03-10 06:35:06 +08:00
++rownum;
printf("\n[%02d] | ", rownum);
}
}
printf("\n");
2010-07-13 21:39:30 +08:00
}
char *sprint_hex(const uint8_t *data, const size_t len) {
2019-03-10 06:35:06 +08:00
static char buf[UTIL_BUFFER_SIZE_SPRINT - 3] = {0};
hex_to_buffer((uint8_t *)buf, data, len, sizeof(buf) - 1, 0, 1, true);
return buf;
2010-07-13 21:39:30 +08:00
}
char *sprint_hex_inrow_ex(const uint8_t *data, const size_t len, const size_t min_str_len) {
2019-03-10 06:35:06 +08:00
static char buf[UTIL_BUFFER_SIZE_SPRINT] = {0};
hex_to_buffer((uint8_t *)buf, data, len, sizeof(buf) - 1, min_str_len, 0, true);
return buf;
}
char *sprint_hex_inrow(const uint8_t *data, const size_t len) {
2019-03-10 06:35:06 +08:00
return sprint_hex_inrow_ex(data, len, 0);
}
char *sprint_hex_inrow_spaces(const uint8_t *data, const size_t len, size_t spaces_between) {
2019-03-10 06:35:06 +08:00
static char buf[UTIL_BUFFER_SIZE_SPRINT] = {0};
hex_to_buffer((uint8_t *)buf, data, len, sizeof(buf) - 1, 0, spaces_between, true);
return buf;
}
char *sprint_bin_break(const uint8_t *data, const size_t len, const uint8_t breaks) {
2019-03-10 06:35:06 +08:00
// make sure we don't go beyond our char array memory
size_t in_index = 0, out_index = 0;
size_t rowlen = (len > MAX_BIN_BREAK_LENGTH) ? MAX_BIN_BREAK_LENGTH : len;
2019-03-10 07:00:59 +08:00
if (breaks > 0 && len % breaks != 0)
rowlen = (len + (len / breaks) > MAX_BIN_BREAK_LENGTH) ? MAX_BIN_BREAK_LENGTH : len + (len / breaks);
2019-03-10 06:35:06 +08:00
//printf("(sprint_bin_break) rowlen %d\n", rowlen);
2019-03-10 06:35:06 +08:00
static char buf[MAX_BIN_BREAK_LENGTH]; // 3072 + end of line characters if broken at 8 bits
//clear memory
memset(buf, 0x00, sizeof(buf));
char *tmp = buf;
2019-03-10 06:35:06 +08:00
// loop through the out_index to make sure we don't go too far
2019-03-10 07:00:59 +08:00
for (out_index = 0; out_index < rowlen; out_index++) {
2019-03-10 06:35:06 +08:00
// set character
if (data[in_index] == 7) // Manchester wrong bit marker
sprintf(tmp++, ".");
else
sprintf(tmp++, "%u", data[in_index]);
2019-03-28 21:19:41 +08:00
2019-03-10 06:35:06 +08:00
// check if a line break is needed and we have room to print it in our array
2019-03-10 07:00:59 +08:00
if ((breaks > 0) && !((in_index + 1) % breaks) && (out_index + 1 != rowlen)) {
sprintf(tmp++, "%s", "\n");
2019-03-10 06:35:06 +08:00
}
2019-03-28 21:19:41 +08:00
2019-03-10 06:35:06 +08:00
in_index++;
}
2019-03-10 06:35:06 +08:00
return buf;
}
/*
void sprint_bin_break_ex(uint8_t *src, size_t srclen, char *dest , uint8_t breaks) {
2019-03-10 06:35:06 +08:00
if ( src == NULL ) return;
if ( srclen < 1 ) return;
// make sure we don't go beyond our char array memory
size_t in_index = 0, out_index = 0;
int rowlen;
if (breaks==0)
rowlen = ( len > MAX_BIN_BREAK_LENGTH ) ? MAX_BIN_BREAK_LENGTH : len;
else
rowlen = ( len+(len/breaks) > MAX_BIN_BREAK_LENGTH ) ? MAX_BIN_BREAK_LENGTH : len+(len/breaks);
printf("(sprint_bin_break) rowlen %d\n", rowlen);
// 3072 + end of line characters if broken at 8 bits
dest = (char *)calloc(MAX_BIN_BREAK_LENGTH, sizeof(uint8_t));
if (dest == NULL) return;
//clear memory
memset(dest, 0x00, sizeof(dest));
// loop through the out_index to make sure we don't go too far
for (out_index=0; out_index < rowlen-1; out_index++) {
// set character
sprintf(dest++, "%u", src[in_index]);
// check if a line break is needed and we have room to print it in our array
if ( (breaks > 0) && !((in_index+1) % breaks) && (out_index+1 != rowlen) ) {
// increment and print line break
out_index++;
sprintf(dest++, "%s","\n");
}
in_index++;
}
// last char.
sprintf(dest++, "%u", src[in_index]);
}
*/
char *sprint_bin(const uint8_t *data, const size_t len) {
2019-03-10 06:35:06 +08:00
return sprint_bin_break(data, len, 0);
}
char *sprint_hex_ascii(const uint8_t *data, const size_t len) {
2019-03-10 06:35:06 +08:00
static char buf[UTIL_BUFFER_SIZE_SPRINT];
char *tmp = buf;
memset(buf, 0x00, UTIL_BUFFER_SIZE_SPRINT);
size_t max_len = (len > 1010) ? 1010 : len;
2019-03-10 07:00:59 +08:00
snprintf(tmp, UTIL_BUFFER_SIZE_SPRINT, "%s| ", sprint_hex(data, max_len));
2019-03-10 06:35:06 +08:00
size_t i = 0;
size_t pos = (max_len * 3) + 2;
2019-03-10 07:00:59 +08:00
while (i < max_len) {
2019-03-10 06:35:06 +08:00
char c = data[i];
2019-03-10 07:00:59 +08:00
if ((c < 32) || (c == 127))
2019-03-10 06:35:06 +08:00
c = '.';
2019-03-10 07:00:59 +08:00
sprintf(tmp + pos + i, "%c", c);
2019-03-10 06:35:06 +08:00
++i;
}
return buf;
}
char *sprint_ascii_ex(const uint8_t *data, const size_t len, const size_t min_str_len) {
2019-03-10 06:35:06 +08:00
static char buf[UTIL_BUFFER_SIZE_SPRINT];
char *tmp = buf;
memset(buf, 0x00, UTIL_BUFFER_SIZE_SPRINT);
size_t max_len = (len > 1010) ? 1010 : len;
size_t i = 0;
2019-03-10 07:00:59 +08:00
while (i < max_len) {
2019-03-10 06:35:06 +08:00
char c = data[i];
tmp[i] = ((c < 32) || (c == 127)) ? '.' : c;
++i;
}
size_t m = min_str_len > i ? min_str_len : 0;
2019-03-10 07:00:59 +08:00
for (; i < m; ++i)
2019-03-10 06:35:06 +08:00
tmp[i] = ' ';
return buf;
2017-01-16 21:47:24 +08:00
}
char *sprint_ascii(const uint8_t *data, const size_t len) {
2019-03-10 06:35:06 +08:00
return sprint_ascii_ex(data, len, 0);
}
2017-01-16 21:47:24 +08:00
void print_blocks(uint32_t *data, size_t len) {
2019-03-10 06:35:06 +08:00
PrintAndLogEx(NORMAL, "Blk | Data ");
PrintAndLogEx(NORMAL, "----+------------");
2019-03-10 07:00:59 +08:00
if (!data) {
2019-03-10 06:35:06 +08:00
PrintAndLogEx(ERR, "..empty data");
} else {
2019-03-10 07:00:59 +08:00
for (uint8_t i = 0; i < len; i++)
2019-03-10 06:35:06 +08:00
PrintAndLogEx(NORMAL, "%02d | 0x%08X", i, data[i]);
}
}
// takes a number (uint64_t) and creates a binarray in dest.
void num_to_bytebits(uint64_t n, size_t len, uint8_t *dest) {
2019-03-10 06:35:06 +08:00
while (len--) {
dest[len] = n & 1;
n >>= 1;
}
}
2016-07-24 00:33:30 +08:00
//least significant bit first
void num_to_bytebitsLSBF(uint64_t n, size_t len, uint8_t *dest) {
for (size_t i = 0 ; i < len ; ++i) {
2019-03-10 06:35:06 +08:00
dest[i] = n & 1;
n >>= 1;
}
}
2015-05-05 06:26:17 +08:00
// aa,bb,cc,dd,ee,ff,gg,hh, ii,jj,kk,ll,mm,nn,oo,pp
// to
// hh,gg,ff,ee,dd,cc,bb,aa, pp,oo,nn,mm,ll,kk,jj,ii
// up to 64 bytes or 512 bits
uint8_t *SwapEndian64(const uint8_t *src, const size_t len, const uint8_t blockSize) {
2019-03-10 06:35:06 +08:00
static uint8_t buf[64];
memset(buf, 0x00, 64);
uint8_t *tmp = buf;
2019-03-10 07:00:59 +08:00
for (uint8_t block = 0; block < (uint8_t)(len / blockSize); block++) {
for (size_t i = 0; i < blockSize; i++) {
tmp[i + (blockSize * block)] = src[(blockSize - 1 - i) + (blockSize * block)];
2019-03-10 06:35:06 +08:00
}
}
return buf;
2015-05-05 06:26:17 +08:00
}
// takes a uint8_t src array, for len items and reverses the byte order in blocksizes (8,16,32,64),
// returns: the dest array contains the reordered src array.
void SwapEndian64ex(const uint8_t *src, const size_t len, const uint8_t blockSize, uint8_t *dest) {
2019-03-10 07:00:59 +08:00
for (uint8_t block = 0; block < (uint8_t)(len / blockSize); block++) {
for (size_t i = 0; i < blockSize; i++) {
dest[i + (blockSize * block)] = src[(blockSize - 1 - i) + (blockSize * block)];
2019-03-10 06:35:06 +08:00
}
}
}
// -------------------------------------------------------------------------
// string parameters lib
// -------------------------------------------------------------------------
// -------------------------------------------------------------------------
// line - param line
// bg, en - symbol numbers in param line of beginning and ending parameter
// paramnum - param number (from 0)
// -------------------------------------------------------------------------
int param_getptr(const char *line, int *bg, int *en, int paramnum) {
2019-03-10 06:35:06 +08:00
int i;
int len = strlen(line);
2019-03-10 06:35:06 +08:00
*bg = 0;
*en = 0;
2019-03-10 07:00:59 +08:00
// skip spaces
while (line[*bg] == ' ' || line[*bg] == '\t')(*bg)++;
2019-03-10 06:35:06 +08:00
if (*bg >= len) {
return 1;
}
2019-03-10 06:35:06 +08:00
for (i = 0; i < paramnum; i++) {
2019-03-10 07:00:59 +08:00
while (line[*bg] != ' ' && line[*bg] != '\t' && line[*bg] != '\0')(*bg)++;
while (line[*bg] == ' ' || line[*bg] == '\t')(*bg)++;
2019-03-10 06:35:06 +08:00
if (line[*bg] == '\0') return 1;
}
2019-03-10 06:35:06 +08:00
*en = *bg;
2019-03-10 07:00:59 +08:00
while (line[*en] != ' ' && line[*en] != '\t' && line[*en] != '\0')(*en)++;
2019-03-10 06:35:06 +08:00
(*en)--;
2019-03-10 06:35:06 +08:00
return 0;
}
int param_getlength(const char *line, int paramnum) {
2019-03-10 06:35:06 +08:00
int bg, en;
2019-03-10 06:35:06 +08:00
if (param_getptr(line, &bg, &en, paramnum)) return 0;
2019-03-10 06:35:06 +08:00
return en - bg + 1;
}
char param_getchar(const char *line, int paramnum) {
2019-03-10 06:35:06 +08:00
return param_getchar_indx(line, 0, paramnum);
2017-11-11 03:47:31 +08:00
}
char param_getchar_indx(const char *line, int indx, int paramnum) {
2019-03-10 06:35:06 +08:00
int bg, en;
2019-03-10 06:35:06 +08:00
if (param_getptr(line, &bg, &en, paramnum)) return 0x00;
2017-11-11 03:47:31 +08:00
2019-03-10 06:35:06 +08:00
if (bg + indx > en)
return '\0';
2019-03-10 06:35:06 +08:00
return line[bg + indx];
}
uint8_t param_get8(const char *line, int paramnum) {
2019-03-10 06:35:06 +08:00
return param_get8ex(line, paramnum, 0, 10);
}
/**
* @brief Reads a decimal integer (actually, 0-254, not 255)
* @param line
* @param paramnum
* @return -1 if error
*/
uint8_t param_getdec(const char *line, int paramnum, uint8_t *destination) {
2019-03-10 06:35:06 +08:00
uint8_t val = param_get8ex(line, paramnum, 255, 10);
2019-03-10 07:00:59 +08:00
if ((int8_t) val == -1) return 1;
2019-03-10 06:35:06 +08:00
(*destination) = val;
return 0;
}
/**
* @brief Checks if param is decimal
* @param line
* @param paramnum
* @return
*/
uint8_t param_isdec(const char *line, int paramnum) {
2019-03-10 06:35:06 +08:00
int bg, en;
//TODO, check more thorougly
if (!param_getptr(line, &bg, &en, paramnum)) return 1;
2019-03-10 07:00:59 +08:00
// return strtoul(&line[bg], NULL, 10) & 0xff;
2019-03-10 06:35:06 +08:00
return 0;
}
uint8_t param_get8ex(const char *line, int paramnum, int deflt, int base) {
2019-03-10 06:35:06 +08:00
int bg, en;
if (!param_getptr(line, &bg, &en, paramnum))
return strtoul(&line[bg], NULL, base) & 0xff;
else
return deflt;
}
uint32_t param_get32ex(const char *line, int paramnum, int deflt, int base) {
2019-03-10 06:35:06 +08:00
int bg, en;
if (!param_getptr(line, &bg, &en, paramnum))
return strtoul(&line[bg], NULL, base);
else
return deflt;
}
uint64_t param_get64ex(const char *line, int paramnum, int deflt, int base) {
2019-03-10 06:35:06 +08:00
int bg, en;
if (!param_getptr(line, &bg, &en, paramnum))
return strtoull(&line[bg], NULL, base);
else
return deflt;
}
int param_gethex(const char *line, int paramnum, uint8_t *data, int hexcnt) {
2019-03-10 06:35:06 +08:00
int bg, en, i;
uint32_t temp;
2019-03-10 06:35:06 +08:00
if (hexcnt & 1) return 1;
2019-03-10 06:35:06 +08:00
if (param_getptr(line, &bg, &en, paramnum)) return 1;
2019-03-10 06:35:06 +08:00
if (en - bg + 1 != hexcnt) return 1;
2019-03-10 07:00:59 +08:00
for (i = 0; i < hexcnt; i += 2) {
if (!(isxdigit(line[bg + i]) && isxdigit(line[bg + i + 1]))) return 1;
2019-03-10 07:00:59 +08:00
sscanf((char[]) {line[bg + i], line[bg + i + 1], 0}, "%X", &temp);
2019-03-10 06:35:06 +08:00
data[i / 2] = temp & 0xff;
}
2019-03-10 06:35:06 +08:00
return 0;
}
int param_gethex_ex(const char *line, int paramnum, uint8_t *data, int *hexcnt) {
2019-03-10 06:35:06 +08:00
int bg, en, i;
uint32_t temp;
2019-03-10 06:35:06 +08:00
if (param_getptr(line, &bg, &en, paramnum)) return 1;
2019-03-10 06:35:06 +08:00
*hexcnt = en - bg + 1;
if (*hexcnt % 2) //error if not complete hex bytes
return 1;
2019-03-10 07:00:59 +08:00
for (i = 0; i < *hexcnt; i += 2) {
if (!(isxdigit(line[bg + i]) && isxdigit(line[bg + i + 1]))) return 1;
2019-03-10 07:00:59 +08:00
sscanf((char[]) {line[bg + i], line[bg + i + 1], 0}, "%X", &temp);
2019-03-10 06:35:06 +08:00
data[i / 2] = temp & 0xff;
}
2019-03-10 06:35:06 +08:00
return 0;
}
2017-11-11 03:47:31 +08:00
int param_gethex_to_eol(const char *line, int paramnum, uint8_t *data, int maxdatalen, int *datalen) {
2019-03-10 06:35:06 +08:00
int bg, en;
uint32_t temp;
char buf[5] = {0};
2017-11-11 03:47:31 +08:00
2019-03-10 06:35:06 +08:00
if (param_getptr(line, &bg, &en, paramnum)) return 1;
2017-11-11 03:47:31 +08:00
2019-03-10 06:35:06 +08:00
*datalen = 0;
2019-03-10 06:35:06 +08:00
int indx = bg;
while (line[indx]) {
if (line[indx] == '\t' || line[indx] == ' ') {
indx++;
continue;
}
2019-03-10 06:35:06 +08:00
if (isxdigit(line[indx])) {
buf[strlen(buf) + 1] = 0x00;
buf[strlen(buf)] = line[indx];
} else {
// if we have symbols other than spaces and hex
return 1;
}
2017-11-11 03:47:31 +08:00
2019-03-10 06:35:06 +08:00
if (*datalen >= maxdatalen) {
// if we dont have space in buffer and have symbols to translate
return 2;
}
2017-11-11 03:47:31 +08:00
2019-03-10 06:35:06 +08:00
if (strlen(buf) >= 2) {
sscanf(buf, "%x", &temp);
data[*datalen] = (uint8_t)(temp & 0xff);
*buf = 0;
(*datalen)++;
}
2019-03-10 06:35:06 +08:00
indx++;
}
2017-11-11 03:47:31 +08:00
2019-03-10 06:35:06 +08:00
if (strlen(buf) > 0)
//error when not completed hex bytes
return 3;
2019-03-10 06:35:06 +08:00
return 0;
2017-11-11 03:47:31 +08:00
}
int param_getstr(const char *line, int paramnum, char *str, size_t buffersize) {
2019-03-10 06:35:06 +08:00
int bg, en;
2019-03-10 06:35:06 +08:00
if (param_getptr(line, &bg, &en, paramnum)) {
return 0;
}
2019-03-10 06:35:06 +08:00
// Prevent out of bounds errors
if (en - bg + 1 >= buffersize) {
2019-05-18 23:56:03 +08:00
PrintAndLogEx(ERR, "out of bounds error: want %d bytes have %zu bytes\n", en - bg + 1 + 1, buffersize);
2019-03-10 06:35:06 +08:00
return 0;
}
2019-03-10 06:35:06 +08:00
memcpy(str, line + bg, en - bg + 1);
str[en - bg + 1] = 0;
2019-03-10 06:35:06 +08:00
return en - bg + 1;
}
/*
The following methods comes from Rfidler sourcecode.
https://github.com/ApertureLabsLtd/RFIDler/blob/master/firmware/Pic32/RFIDler.X/src/
*/
// convert hex to sequence of 0/1 bit values
// returns number of bits converted
int hextobinarray(char *target, char *source) {
2019-03-10 07:00:59 +08:00
int length, i, count = 0;
char *start = source;
length = strlen(source);
// process 4 bits (1 hex digit) at a time
2019-03-10 07:00:59 +08:00
while (length--) {
2019-04-08 00:12:58 +08:00
char x = *(source++);
// capitalize
if (x >= 'a' && x <= 'f')
x -= 32;
// convert to numeric value
if (x >= '0' && x <= '9')
x -= '0';
else if (x >= 'A' && x <= 'F')
x -= 'A' - 10;
else {
2019-03-10 06:35:06 +08:00
printf("Discovered unknown character %c %d at idx %d of %s\n", x, x, (int16_t)(source - start), start);
return 0;
}
// output
2019-03-10 07:00:59 +08:00
for (i = 0 ; i < 4 ; ++i, ++count)
*(target++) = (x >> (3 - i)) & 1;
}
return count;
}
// convert hex to human readable binary string
int hextobinstring(char *target, char *source) {
int length;
2019-03-10 07:00:59 +08:00
if (!(length = hextobinarray(target, source)))
return 0;
binarraytobinstring(target, target, length);
return length;
}
// convert binary array of 0x00/0x01 values to hex
// return number of bits converted
int binarraytohex(char *target, const size_t targetlen, char *source, size_t srclen) {
uint8_t i = 0, x = 0;
uint32_t t = 0; // written target chars
uint32_t r = 0; // consumed bits
uint8_t w = 0; // wrong bits separator printed
for (size_t s = 0 ; s < srclen; s++) {
2019-03-15 07:20:42 +08:00
if ((source[s] == 0) || (source[s] == 1)) {
w = 0;
x += (source[s] << (3 - i));
i++;
if (i == 4) {
if (t >= targetlen - 2) return r;
sprintf(target + t, "%X", x);
t++;
2019-03-15 07:20:42 +08:00
r += 4;
x = 0;
i = 0;
}
} else {
if (i > 0) {
if (t >= targetlen - 5) return r;
w = 0;
sprintf(target + t, "%X[%i]", x, i);
2019-03-15 07:20:42 +08:00
t += 4;
r += i;
x = 0;
i = 0;
}
if (w == 0) {
if (t >= targetlen - 2) return r;
sprintf(target + t, " ");
t++;
}
r++;
}
}
return r;
}
// convert binary array to human readable binary
void binarraytobinstring(char *target, char *source, int length) {
int i;
2019-03-10 07:00:59 +08:00
for (i = 0 ; i < length ; ++i)
*(target++) = *(source++) + '0';
*target = '\0';
}
// return parity bit required to match type
uint8_t GetParity(uint8_t *bits, uint8_t type, int length) {
int x;
2019-03-10 07:00:59 +08:00
for (x = 0 ; length > 0 ; --length)
x += bits[length - 1];
x %= 2;
return x ^ type;
}
// add HID parity to binary array: EVEN prefix for 1st half of ID, ODD suffix for 2nd half
void wiegand_add_parity(uint8_t *target, uint8_t *source, uint8_t length) {
2019-03-10 07:00:59 +08:00
*(target++) = GetParity(source, EVEN, length / 2);
memcpy(target, source, length);
target += length;
2019-03-10 07:00:59 +08:00
*(target) = GetParity(source + length / 2, ODD, length / 2);
}
// add HID parity to binary array: ODD prefix for 1st half of ID, EVEN suffix for 2nd half
2019-04-11 13:40:50 +08:00
void wiegand_add_parity_swapped(uint8_t *target, uint8_t *source, uint8_t length) {
*(target++) = GetParity(source, ODD, length / 2);
memcpy(target, source, length);
target += length;
2019-04-11 13:40:50 +08:00
*(target) = GetParity(source + length / 2, EVEN, length / 2);
}
// xor two arrays together for len items. The dst array contains the new xored values.
void xor(unsigned char *dst, unsigned char *src, size_t len) {
2019-03-10 07:00:59 +08:00
for (; len > 0; len--, dst++, src++)
*dst ^= *src;
}
// Pack a bitarray into a uint32_t.
uint32_t PackBits(uint8_t start, uint8_t len, uint8_t *bits) {
2019-03-10 06:35:06 +08:00
if (len > 32) return 0;
2019-03-10 06:35:06 +08:00
int i = start;
2019-03-10 07:00:59 +08:00
int j = len - 1;
2019-03-10 06:35:06 +08:00
uint32_t tmp = 0;
2019-03-10 06:35:06 +08:00
for (; j >= 0; --j, ++i)
tmp |= bits[i] << j;
2019-03-10 06:35:06 +08:00
return tmp;
}
/*
uint8_t pw_rev_A(uint8_t b) {
2019-03-10 06:35:06 +08:00
b = (b & 0xF0) >> 4 | (b & 0x0F) << 4;
b = (b & 0xCC) >> 2 | (b & 0x33) << 2;
b = (b & 0xAA) >> 1 | (b & 0x55) << 1;
return b;
}
*/
uint64_t HornerScheme(uint64_t num, uint64_t divider, uint64_t factor) {
2019-04-08 14:34:40 +08:00
uint64_t remaind = 0, quotient = 0, result = 0;
remaind = num % divider;
2019-03-10 07:00:59 +08:00
quotient = num / divider;
2019-04-08 14:34:40 +08:00
if (!(quotient == 0 && remaind == 0))
result += HornerScheme(quotient, divider, factor) * factor + remaind;
2019-03-10 07:00:59 +08:00
return result;
}
// determine number of logical CPU cores (use for multithreaded functions)
int num_CPUs(void) {
#if defined(_WIN32)
2019-03-10 07:00:59 +08:00
#include <sysinfoapi.h>
2019-03-10 06:35:06 +08:00
SYSTEM_INFO sysinfo;
GetSystemInfo(&sysinfo);
return sysinfo.dwNumberOfProcessors;
#else
2019-03-10 07:00:59 +08:00
#include <unistd.h>
int count = sysconf(_SC_NPROCESSORS_ONLN);
2019-04-28 17:09:46 +08:00
if (count <= 0)
count = 1;
2019-04-28 17:09:46 +08:00
return count;
#endif
}
void str_lower(char *s) {
for (size_t i = 0; i < strlen(s); i++)
2019-03-10 07:00:59 +08:00
s[i] = tolower(s[i]);
2017-10-20 20:39:42 +08:00
}
// check for prefix in string
bool str_startswith(const char *s, const char *pre) {
2018-09-05 02:39:15 +08:00
return strncmp(pre, s, strlen(pre)) == 0;
}
2017-10-20 20:39:42 +08:00
// check for suffix in string
bool str_endswith(const char *s, const char *suffix) {
size_t ls = strlen(s);
size_t lsuffix = strlen(suffix);
2019-04-29 04:54:00 +08:00
if (ls >= lsuffix) {
return strncmp(suffix, s + (ls - lsuffix), lsuffix) == 0;
}
return false;
}
2017-10-20 20:39:42 +08:00
// Replace unprintable characters with a dot in char buffer
void clean_ascii(unsigned char *buf, size_t len) {
2019-03-10 07:00:59 +08:00
for (size_t i = 0; i < len; i++) {
if (!isprint(buf[i]))
buf[i] = '.';
}
2017-10-20 20:39:42 +08:00
}
// replace \r \n to \0
void strcleanrn(char *buf, size_t len) {
2019-03-10 06:35:06 +08:00
strcreplace(buf, len, '\n', '\0');
strcreplace(buf, len, '\r', '\0');
2017-10-20 20:39:42 +08:00
}
// replace char in buffer
void strcreplace(char *buf, size_t len, char from, char to) {
2019-03-10 07:00:59 +08:00
for (size_t i = 0; i < len; i++) {
if (buf[i] == from)
buf[i] = to;
}
2017-10-20 20:39:42 +08:00
}
char *strmcopy(const char *buf) {
2019-03-10 07:00:59 +08:00
char *str = (char *) calloc(strlen(buf) + 1, sizeof(uint8_t));
2019-03-10 06:35:06 +08:00
if (str != NULL) {
memset(str, 0, strlen(buf) + 1);
strcpy(str, buf);
}
return str;
2019-03-12 07:12:26 +08:00
}