//-----------------------------------------------------------------------------
#include "util.h"
-#include "proxmark3.h"
#define MAX_BIN_BREAK_LENGTH (3072+384+1)
#ifndef _WIN32
-#include <termios.h>
-#include <sys/ioctl.h>
+#include <sys/ttydefaults.h>
-int ukbhit(void)
-{
+int ukbhit(void) {
int cnt = 0;
int error;
static struct termios Otty, Ntty;
}
#else
-#include <conio.h>
int ukbhit(void) {
return kbhit();
}
fprintf(f, "%s", extData);
fprintf(f, "%s\n", c);
fflush(f);
- fclose(f);
+ if (f) {
+ fclose(f);
+ f = NULL;
+ }
}
void AddLogHex(char *fileName, char *extData, const uint8_t * data, const size_t len){
char buf[20] = {0};
memset(buf, 0x00, sizeof(buf));
//sprintf(buf, "%X%X", (unsigned int)((data & 0xFFFFFFFF00000000) >> 32), (unsigned int)(data & 0xFFFFFFFF));
- sprintf(buf, "%012"llx"", data);
+ sprintf(buf, "%012" PRIx64 "", data);
AddLogLine(fileName, extData, buf);
}
// make sure we don't go beyond our char array memory
size_t in_index = 0, out_index = 0;
- int max_len;
+ int rowlen;
if (breaks==0)
- max_len = ( len > MAX_BIN_BREAK_LENGTH ) ? MAX_BIN_BREAK_LENGTH : len;
+ rowlen = ( len > MAX_BIN_BREAK_LENGTH ) ? MAX_BIN_BREAK_LENGTH : len;
else
- max_len = ( len+(len/breaks) > MAX_BIN_BREAK_LENGTH ) ? MAX_BIN_BREAK_LENGTH : len+(len/breaks);
+ rowlen = ( len+(len/breaks) > MAX_BIN_BREAK_LENGTH ) ? MAX_BIN_BREAK_LENGTH : len+(len/breaks);
static char buf[MAX_BIN_BREAK_LENGTH]; // 3072 + end of line characters if broken at 8 bits
//clear memory
char *tmp = buf;
// loop through the out_index to make sure we don't go too far
- for (out_index=0; out_index < max_len-2; out_index++) {
+ for (out_index=0; out_index < rowlen-1; out_index++) {
// set character
- sprintf(tmp++, "%u", (unsigned int) data[in_index]);
+ sprintf(tmp++, "%u", data[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 != max_len) ) {
+ if ( (breaks > 0) && !((in_index+1) % breaks) && (out_index+1 != rowlen) ) {
// increment and print line break
out_index++;
sprintf(tmp++, "%s","\n");
in_index++;
}
// last char.
- sprintf(tmp++, "%u", (unsigned int) data[in_index]);
+ sprintf(tmp++, "%u", data[in_index]);
return buf;
}
char *tmp = buf;
memset(buf, 0x00, 1024);
size_t max_len = (len > 1010) ? 1010 : len;
- sprintf(tmp, "%s| %s", sprint_hex(data, max_len) , data);
+
+ sprintf(tmp, "%s| ", sprint_hex(data, max_len) );
+
+ size_t i = 0;
+ size_t pos = (max_len * 3)+2;
+ while(i < max_len){
+ char c = data[i];
+ if ( (c < 32) || (c == 127))
+ c = '.';
+ sprintf(tmp+pos+i, "%c", c);
+ ++i;
+ }
return buf;
}
-void num_to_bytes(uint64_t n, size_t len, uint8_t* dest)
-{
+char *sprint_ascii(const uint8_t *data, const size_t len) {
+ static char buf[1024];
+ char *tmp = buf;
+ memset(buf, 0x00, 1024);
+ size_t max_len = (len > 1010) ? 1010 : len;
+ size_t i = 0;
+ while(i < max_len){
+ char c = data[i];
+ tmp[i] = ((c < 32) || (c == 127)) ? '.' : c;
+ ++i;
+ }
+ return buf;
+}
+
+void num_to_bytes(uint64_t n, size_t len, uint8_t* dest) {
while (len--) {
- dest[len] = (uint8_t) n;
+ dest[len] = n & 0xFF;
n >>= 8;
}
}
-uint64_t bytes_to_num(uint8_t* src, size_t len)
-{
+uint64_t bytes_to_num(uint8_t* src, size_t len) {
uint64_t num = 0;
- while (len--)
- {
+ while (len--) {
num = (num << 8) | (*src);
src++;
}
n >>= 1;
}
}
+
//least significant bit first
void num_to_bytebitsLSBF(uint64_t n, size_t len, uint8_t *dest) {
for(int i = 0 ; i < len ; ++i) {
}
}
-
// 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){
- uint8_t buf[64];
+ static uint8_t buf[64];
memset(buf, 0x00, 64);
uint8_t *tmp = buf;
for (uint8_t block=0; block < (uint8_t)(len/blockSize); block++){
tmp[i+(blockSize*block)] = src[(blockSize-1-i)+(blockSize*block)];
}
}
- return tmp;
+ return buf;
}
// takes a uint8_t src array, for len items and reverses the byte order in blocksizes (8,16,32,64),
return 0;
}
-
char param_getchar(const char *line, int paramnum)
{
int bg, en;
-
if (param_getptr(line, &bg, &en, paramnum)) return 0x00;
-
return line[bg];
}
uint8_t param_get8ex(const char *line, int paramnum, int deflt, int base)
{
int bg, en;
-
if (!param_getptr(line, &bg, &en, paramnum))
return strtoul(&line[bg], NULL, base) & 0xff;
else
uint32_t param_get32ex(const char *line, int paramnum, int deflt, int base)
{
int bg, en;
-
if (!param_getptr(line, &bg, &en, paramnum))
return strtoul(&line[bg], NULL, base);
else
uint64_t param_get64ex(const char *line, int paramnum, int deflt, int base)
{
int bg, en;
-
if (!param_getptr(line, &bg, &en, paramnum))
return strtoull(&line[bg], NULL, base);
else
return deflt;
-
- return 0;
}
int param_gethex(const char *line, int paramnum, uint8_t * data, int hexcnt)
{
- int bg, en, temp, i;
+ int bg, en, i;
+ uint32_t temp;
if (hexcnt & 1) return 1;
}
int param_gethex_ex(const char *line, int paramnum, uint8_t * data, int *hexcnt)
{
- int bg, en, temp, i;
+ int bg, en, i;
+ uint32_t temp;
//if (hexcnt % 2)
// return 1;
int param_getstr(const char *line, int paramnum, char * str)
{
int bg, en;
-
if (param_getptr(line, &bg, &en, paramnum)) return 0;
memcpy(str, line + bg, en - bg + 1);
}
// Swap bit order on a uint32_t value. Can be limited by nrbits just use say 8bits reversal
+// And clears the rest of the bits.
uint32_t SwapBits(uint32_t value, int nrbits) {
uint32_t newvalue = 0;
for(int i = 0; i < nrbits; i++) {
newvalue ^= ((value >> i) & 1) << (nrbits - 1 - i);
}
return newvalue;
+}
+/*
+ ref http://www.csm.ornl.gov/~dunigan/crc.html
+ Returns the value v with the bottom b [0,32] bits reflected.
+ Example: reflect(0x3e23L,3) == 0x3e26
+*/
+uint32_t reflect(uint32_t v, int b) {
+ uint32_t t = v;
+ for ( int i = 0; i < b; ++i) {
+ if (t & 1)
+ v |= BITMASK((b-1)-i);
+ else
+ v &= ~BITMASK((b-1)-i);
+ t>>=1;
+ }
+ return v;
+}
+
+uint64_t HornerScheme(uint64_t num, uint64_t divider, uint64_t factor) {
+ uint64_t remainder=0, quotient=0, result=0;
+ remainder = num % divider;
+ quotient = num / divider;
+ if(!(quotient == 0 && remainder == 0))
+ result += HornerScheme(quotient, divider, factor) * factor + remainder;
+ return result;
}
\ No newline at end of file
projects / proxmark3-svn / blobdiff