[proxmark3-svn] / client / cmdlf.c

//-----------------------------------------------------------------------------
// 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.
//-----------------------------------------------------------------------------
// Low frequency commands
//-----------------------------------------------------------------------------

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <limits.h>
//#include "proxusb.h"
#include "proxmark3.h"
#include "data.h"
#include "graph.h"
#include "ui.h"
#include "cmdparser.h"
#include "cmdmain.h"
#include "cmddata.h"
#include "cmdlf.h"
#include "cmdlfhid.h"
#include "cmdlfti.h"
#include "cmdlfem4x.h"
#include "cmdlfhitag.h"
#include "cmdlft55xx.h"
#include "cmdlfpcf7931.h"
#include "cmdlfio.h"

static int CmdHelp(const char *Cmd);

/* send a command before reading */
int CmdLFCommandRead(const char *Cmd)
{
  static char dummy[3];

  dummy[0]= ' ';

  UsbCommand c = {CMD_MOD_THEN_ACQUIRE_RAW_ADC_SAMPLES_125K};
  sscanf(Cmd, "%"lli" %"lli" %"lli" %s %s", &c.arg[0], &c.arg[1], &c.arg[2],(char*)(&c.d.asBytes),(char*)(&dummy+1));
  // in case they specified 'h'
  strcpy((char *)&c.d.asBytes + strlen((char *)c.d.asBytes), dummy);
  SendCommand(&c);
  return 0;
}

int CmdFlexdemod(const char *Cmd)
{
  int i;
  for (i = 0; i < GraphTraceLen; ++i) {
    if (GraphBuffer[i] < 0) {
      GraphBuffer[i] = -1;
    } else {
      GraphBuffer[i] = 1;
    }
  }

#define LONG_WAIT 100
  int start;
  for (start = 0; start < GraphTraceLen - LONG_WAIT; start++) {
    int first = GraphBuffer[start];
    for (i = start; i < start + LONG_WAIT; i++) {
      if (GraphBuffer[i] != first) {
        break;
      }
    }
    if (i == (start + LONG_WAIT)) {
      break;
    }
  }
  if (start == GraphTraceLen - LONG_WAIT) {
    PrintAndLog("nothing to wait for");
    return 0;
  }

  GraphBuffer[start] = 2;
  GraphBuffer[start+1] = -2;

  uint8_t bits[64];

  int bit;
  i = start;
  for (bit = 0; bit < 64; bit++) {
    int j;
    int sum = 0;
    for (j = 0; j < 16; j++) {
      sum += GraphBuffer[i++];
    }
    if (sum > 0) {
      bits[bit] = 1;
    } else {
      bits[bit] = 0;
    }
    PrintAndLog("bit %d sum %d", bit, sum);
  }

  for (bit = 0; bit < 64; bit++) {
    int j;
    int sum = 0;
    for (j = 0; j < 16; j++) {
      sum += GraphBuffer[i++];
    }
    if (sum > 0 && bits[bit] != 1) {
      PrintAndLog("oops1 at %d", bit);
    }
    if (sum < 0 && bits[bit] != 0) {
      PrintAndLog("oops2 at %d", bit);
    }
  }

  GraphTraceLen = 32*64;
  i = 0;
  int phase = 0;
  for (bit = 0; bit < 64; bit++) {
    if (bits[bit] == 0) {
      phase = 0;
    } else {
      phase = 1;
    }
    int j;
    for (j = 0; j < 32; j++) {
      GraphBuffer[i++] = phase;
      phase = !phase;
    }
  }

  RepaintGraphWindow();
  return 0;
}
  
int CmdIndalaDemod(const char *Cmd)
{
  // Usage: recover 64bit UID by default, specify "224" as arg to recover a 224bit UID

  int state = -1;
  int count = 0;
  int i, j;
  // worst case with GraphTraceLen=64000 is < 4096
  // under normal conditions it's < 2048
  uint8_t rawbits[4096];
  int rawbit = 0;
  int worst = 0, worstPos = 0;
 // PrintAndLog("Expecting a bit less than %d raw bits", GraphTraceLen / 32);
  for (i = 0; i < GraphTraceLen-1; i += 2) {
    count += 1;
    if ((GraphBuffer[i] > GraphBuffer[i + 1]) && (state != 1)) {
      if (state == 0) {
        for (j = 0; j <  count - 8; j += 16) {
          rawbits[rawbit++] = 0;
        }
        if ((abs(count - j)) > worst) {
          worst = abs(count - j);
          worstPos = i;
        }
      }
      state = 1;
      count = 0;
    } else if ((GraphBuffer[i] < GraphBuffer[i + 1]) && (state != 0)) {
      if (state == 1) {
        for (j = 0; j <  count - 8; j += 16) {
          rawbits[rawbit++] = 1;
        }
        if ((abs(count - j)) > worst) {
          worst = abs(count - j);
          worstPos = i;
        }
      }
      state = 0;
      count = 0;
    }
  }
  if (rawbit>0){
    PrintAndLog("Recovered %d raw bits, expected: %d", rawbit, GraphTraceLen/32);
    PrintAndLog("worst metric (0=best..7=worst): %d at pos %d", worst, worstPos);
  } else return 0;
  // Finding the start of a UID
  int uidlen, long_wait;
  if (strcmp(Cmd, "224") == 0) {
    uidlen = 224;
    long_wait = 30;
  } else {
    uidlen = 64;
    long_wait = 29;
  }
  int start;
  int first = 0;
  for (start = 0; start <= rawbit - uidlen; start++) {
    first = rawbits[start];
    for (i = start; i < start + long_wait; i++) {
      if (rawbits[i] != first) {
        break;
      }
    }
    if (i == (start + long_wait)) {
      break;
    }
  }
  if (start == rawbit - uidlen + 1) {
    PrintAndLog("nothing to wait for");
    return 0;
  }

  // Inverting signal if needed
  if (first == 1) {
    for (i = start; i < rawbit; i++) {
      rawbits[i] = !rawbits[i];
    }
  }

  // Dumping UID
  uint8_t bits[224];
  char showbits[225];
  showbits[uidlen]='\0';
  int bit;
  i = start;
  int times = 0;
  if (uidlen > rawbit) {
    PrintAndLog("Warning: not enough raw bits to get a full UID");
    for (bit = 0; bit < rawbit; bit++) {
      bits[bit] = rawbits[i++];
      // As we cannot know the parity, let's use "." and "/"
      showbits[bit] = '.' + bits[bit];
    }
    showbits[bit+1]='\0';
    PrintAndLog("Partial UID=%s", showbits);
    return 0;
  } else {
    for (bit = 0; bit < uidlen; bit++) {
      bits[bit] = rawbits[i++];
      showbits[bit] = '0' + bits[bit];
    }
    times = 1;
  }
  
  //convert UID to HEX
  uint32_t uid1, uid2, uid3, uid4, uid5, uid6, uid7;
  int idx;
  uid1=0;
  uid2=0;
  if (uidlen==64){
    for( idx=0; idx<64; idx++) {
        if (showbits[idx] == '0') {
        uid1=(uid1<<1)|(uid2>>31);
        uid2=(uid2<<1)|0;
        } else {
        uid1=(uid1<<1)|(uid2>>31);
        uid2=(uid2<<1)|1;
        } 
      }
    PrintAndLog("UID=%s (%x%08x)", showbits, uid1, uid2);
  }
  else {
    uid3=0;
    uid4=0;
    uid5=0;
    uid6=0;
    uid7=0;
    for( idx=0; idx<224; idx++) {
        uid1=(uid1<<1)|(uid2>>31);
        uid2=(uid2<<1)|(uid3>>31);
        uid3=(uid3<<1)|(uid4>>31);
        uid4=(uid4<<1)|(uid5>>31);
        uid5=(uid5<<1)|(uid6>>31);
        uid6=(uid6<<1)|(uid7>>31);
        if (showbits[idx] == '0') uid7=(uid7<<1)|0;
        else uid7=(uid7<<1)|1;
      }
    PrintAndLog("UID=%s (%x%08x%08x%08x%08x%08x%08x)", showbits, uid1, uid2, uid3, uid4, uid5, uid6, uid7);
  }

  // Checking UID against next occurrences
  for (; i + uidlen <= rawbit;) {
    int failed = 0;
    for (bit = 0; bit < uidlen; bit++) {
      if (bits[bit] != rawbits[i++]) {
        failed = 1;
        break;
      }
    }
    if (failed == 1) {
      break;
    }
    times += 1;
  }
  PrintAndLog("Occurrences: %d (expected %d)", times, (rawbit - start) / uidlen);

  // Remodulating for tag cloning
  GraphTraceLen = 32*uidlen;
  i = 0;
  int phase = 0;
  for (bit = 0; bit < uidlen; bit++) {
    if (bits[bit] == 0) {
      phase = 0;
    } else {
      phase = 1;
    }
    int j;
    for (j = 0; j < 32; j++) {
      GraphBuffer[i++] = phase;
      phase = !phase;
    }
  }

  RepaintGraphWindow();
  return 1;
}

int CmdIndalaClone(const char *Cmd)
{
  unsigned int uid1, uid2, uid3, uid4, uid5, uid6, uid7;
  UsbCommand c;
  uid1=0;
  uid2=0;
  uid3=0;
  uid4=0;
  uid5=0;
  uid6=0;
  uid7=0;  
  int n = 0, i = 0;

  if (strchr(Cmd,'l') != 0) {
    while (sscanf(&Cmd[i++], "%1x", &n ) == 1) {
      uid1 = (uid1 << 4) | (uid2 >> 28);
      uid2 = (uid2 << 4) | (uid3 >> 28);
      uid3 = (uid3 << 4) | (uid4 >> 28);
      uid4 = (uid4 << 4) | (uid5 >> 28);
      uid5 = (uid5 << 4) | (uid6 >> 28);
      uid6 = (uid6 << 4) | (uid7 >> 28);
    	uid7 = (uid7 << 4) | (n & 0xf);
    }
    PrintAndLog("Cloning 224bit tag with UID %x%08x%08x%08x%08x%08x%08x", uid1, uid2, uid3, uid4, uid5, uid6, uid7);
    c.cmd = CMD_INDALA_CLONE_TAG_L;
    c.d.asDwords[0] = uid1;
    c.d.asDwords[1] = uid2;
    c.d.asDwords[2] = uid3;
    c.d.asDwords[3] = uid4;
    c.d.asDwords[4] = uid5;
    c.d.asDwords[5] = uid6;
    c.d.asDwords[6] = uid7;
  } 
  else 
  {
    while (sscanf(&Cmd[i++], "%1x", &n ) == 1) {
      uid1 = (uid1 << 4) | (uid2 >> 28);
      uid2 = (uid2 << 4) | (n & 0xf);
    }
    PrintAndLog("Cloning 64bit tag with UID %x%08x", uid1, uid2);
    c.cmd = CMD_INDALA_CLONE_TAG;
    c.arg[0] = uid1;
    c.arg[1] = uid2;
  }

  SendCommand(&c);
  return 0;
}

int CmdLFRead(const char *Cmd)
{
  UsbCommand c = {CMD_ACQUIRE_RAW_ADC_SAMPLES_125K};
  // 'h' means higher-low-frequency, 134 kHz
  if(*Cmd == 'h') {
    c.arg[0] = 1;
  } else if (*Cmd == '\0') {
    c.arg[0] = 0;
  } else if (sscanf(Cmd, "%"lli, &c.arg[0]) != 1) {
    PrintAndLog("use 'read' or 'read h', or 'read <divisor>'");
    return 0;
  }
  SendCommand(&c);
  WaitForResponse(CMD_ACK,NULL);
  return 0;
}

static void ChkBitstream(const char *str)
{
  int i;

  /* convert to bitstream if necessary */
  for (i = 0; i < (int)(GraphTraceLen / 2); i++)
  {
    if (GraphBuffer[i] > 1 || GraphBuffer[i] < 0)
    {
      CmdBitstream(str);
      break;
    }
  }
}

int CmdLFSim(const char *Cmd)
{
  int i;
  static int gap;

  sscanf(Cmd, "%i", &gap);

  /* convert to bitstream if necessary */
  ChkBitstream(Cmd);

  PrintAndLog("Sending data, please wait...");
  for (i = 0; i < GraphTraceLen; i += 48) {
    UsbCommand c={CMD_DOWNLOADED_SIM_SAMPLES_125K, {i, 0, 0}};
    int j;
    for (j = 0; j < 48; j++) {
      c.d.asBytes[j] = GraphBuffer[i+j];
    }
    SendCommand(&c);
    WaitForResponse(CMD_ACK,NULL);
  }

  PrintAndLog("Starting simulator...");
  UsbCommand c = {CMD_SIMULATE_TAG_125K, {GraphTraceLen, gap, 0}};
  SendCommand(&c);
  return 0;
}

int CmdLFSimBidir(const char *Cmd)
{
  /* Set ADC to twice the carrier for a slight supersampling */
  UsbCommand c = {CMD_LF_SIMULATE_BIDIR, {47, 384, 0}};
  SendCommand(&c);
  return 0;
}

/* simulate an LF Manchester encoded tag with specified bitstream, clock rate and inter-id gap */
int CmdLFSimManchester(const char *Cmd)
{
  static int clock, gap;
  static char data[1024], gapstring[8];

  /* get settings/bits */
  sscanf(Cmd, "%i %s %i", &clock, &data[0], &gap);

  /* clear our graph */
  ClearGraph(0);

  /* fill it with our bitstream */
  for (int i = 0; i < strlen(data) ; ++i)
    AppendGraph(0, clock, data[i]- '0');

  /* modulate */
  CmdManchesterMod("");

  /* show what we've done */
  RepaintGraphWindow();

  /* simulate */
  sprintf(&gapstring[0], "%i", gap);
  CmdLFSim(gapstring);
  return 0;
}

int CmdLFSnoop(const char *Cmd)
{
  UsbCommand c = {CMD_LF_SNOOP_RAW_ADC_SAMPLES};
  // 'h' means higher-low-frequency, 134 kHz
  c.arg[0] = 0;
  c.arg[1] = -1;
  if (*Cmd == 0) {
    // empty
  } else if (*Cmd == 'l') {
    sscanf(Cmd, "l %"lli, &c.arg[1]);
  } else if(*Cmd == 'h') {
    c.arg[0] = 1;
    sscanf(Cmd, "h %"lli, &c.arg[1]);
  } else if (sscanf(Cmd, "%"lli" %"lli, &c.arg[0], &c.arg[1]) < 1) {
    PrintAndLog("use 'snoop' or 'snoop {l,h} [trigger threshold]', or 'snoop <divisor> [trigger threshold]'");
    return 0;
  }
  SendCommand(&c);
  WaitForResponse(CMD_ACK,NULL);
  return 0;
}

int CmdVchDemod(const char *Cmd)
{
  // Is this the entire sync pattern, or does this also include some
  // data bits that happen to be the same everywhere? That would be
  // lovely to know.
  static const int SyncPattern[] = {
    1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,
    1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
    1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,
    1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
    1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,
    1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
    1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,
    1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
    1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,
    1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
  };

  // So first, we correlate for the sync pattern, and mark that.
  int bestCorrel = 0, bestPos = 0;
  int i;
  // It does us no good to find the sync pattern, with fewer than
  // 2048 samples after it...
  for (i = 0; i < (GraphTraceLen-2048); i++) {
    int sum = 0;
    int j;
    for (j = 0; j < arraylen(SyncPattern); j++) {
      sum += GraphBuffer[i+j]*SyncPattern[j];
    }
    if (sum > bestCorrel) {
      bestCorrel = sum;
      bestPos = i;
    }
  }
  PrintAndLog("best sync at %d [metric %d]", bestPos, bestCorrel);

  char bits[257];
  bits[256] = '\0';

  int worst = INT_MAX;
  int worstPos = 0;

  for (i = 0; i < 2048; i += 8) {
    int sum = 0;
    int j;
    for (j = 0; j < 8; j++) {
      sum += GraphBuffer[bestPos+i+j];
    }
    if (sum < 0) {
      bits[i/8] = '.';
    } else {
      bits[i/8] = '1';
    }
    if(abs(sum) < worst) {
      worst = abs(sum);
      worstPos = i;
    }
  }
  PrintAndLog("bits:");
  PrintAndLog("%s", bits);
  PrintAndLog("worst metric: %d at pos %d", worst, worstPos);

  if (strcmp(Cmd, "clone")==0) {
    GraphTraceLen = 0;
    char *s;
    for(s = bits; *s; s++) {
      int j;
      for(j = 0; j < 16; j++) {
        GraphBuffer[GraphTraceLen++] = (*s == '1') ? 1 : 0;
      }
    }
    RepaintGraphWindow();
  }
  return 0;
}

//by marshmellow
int CmdLFfind(const char *Cmd)
{
  int ans=0;
  if (!offline){
    ans=CmdLFRead("");
    ans=CmdSamples("20000");
  }
  if (GraphTraceLen<1000) return 0;
  PrintAndLog("Checking for known tags:");
  ans=Cmdaskmandemod("");
  if (ans>0) return 1;
  ans=CmdFSKdemodHID("");
  if (ans>0) return 1;
  ans=CmdFSKdemodIO("");
  if (ans>0) return 1;
  //add psk and indala
  ans=CmdIndalaDemod("");
  if (ans>0) return 1;
  ans=CmdIndalaDemod("224");
  if (ans>0) return 1;
  PrintAndLog("No Known Tags Found!\n");
  return 0;
}

static command_t CommandTable[] = 
{
  {"help",        CmdHelp,            1, "This help"},
  {"cmdread",     CmdLFCommandRead,   0, "<off period> <'0' period> <'1' period> <command> ['h'] -- Modulate LF reader field to send command before read (all periods in microseconds) (option 'h' for 134)"},
  {"em4x",        CmdLFEM4X,          1, "{ EM4X RFIDs... }"},
  {"flexdemod",   CmdFlexdemod,       1, "Demodulate samples for FlexPass"},
  {"hid",         CmdLFHID,           1, "{ HID RFIDs... }"},
  {"io",       	  CmdLFIO,	          1, "{ ioProx tags... }"},
  {"indalademod", CmdIndalaDemod,     1, "['224'] -- Demodulate samples for Indala 64 bit UID (option '224' for 224 bit)"},
  {"indalaclone", CmdIndalaClone,     0, "<UID> ['l']-- Clone Indala to T55x7 (tag must be in antenna)(UID in HEX)(option 'l' for 224 UID"},
  {"read",        CmdLFRead,          0, "['h' or <divisor>] -- Read 125/134 kHz LF ID-only tag (option 'h' for 134, alternatively: f=12MHz/(divisor+1))"},
  {"search",      CmdLFfind,          1, "Read and Search for valid known tag (in offline mode it you can load first then search)"},
  {"sim",         CmdLFSim,           0, "[GAP] -- Simulate LF tag from buffer with optional GAP (in microseconds)"},
  {"simbidir",    CmdLFSimBidir,      0, "Simulate LF tag (with bidirectional data transmission between reader and tag)"},
  {"simman",      CmdLFSimManchester, 0, "<Clock> <Bitstream> [GAP] Simulate arbitrary Manchester LF tag"},
  {"snoop",       CmdLFSnoop,         0, "['l'|'h'|<divisor>] [trigger threshold]-- Snoop LF (l:125khz, h:134khz)"},
  {"ti",          CmdLFTI,            1, "{ TI RFIDs... }"},
  {"hitag",       CmdLFHitag,         1, "{ Hitag tags and transponders... }"},
  {"vchdemod",    CmdVchDemod,        1, "['clone'] -- Demodulate samples for VeriChip"},
  {"t55xx",       CmdLFT55XX,         1, "{ T55xx RFIDs... }"},
  {"pcf7931",     CmdLFPCF7931,       1, "{PCF7931 RFIDs...}"},
  {NULL, NULL, 0, NULL}
};

int CmdLF(const char *Cmd)
{
  CmdsParse(CommandTable, Cmd);
  return 0; 
}

int CmdHelp(const char *Cmd)
{
  CmdsHelp(CommandTable);
  return 0;
}
Commit	Line	Data
a553f267	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	// Low frequency commands
	9	//-----------------------------------------------------------------------------
	10
7fe9b0b7	11	#include <stdio.h>
590f8ff9	12	#include <stdlib.h>
7fe9b0b7	13	#include <string.h>
393c3ef9	14	#include <limits.h>
28fdb04f	15	//#include "proxusb.h"
902cb3c0	16	#include "proxmark3.h"
7fe9b0b7	17	#include "data.h"
	18	#include "graph.h"
	19	#include "ui.h"
	20	#include "cmdparser.h"
040a7baa	21	#include "cmdmain.h"
7fe9b0b7	22	#include "cmddata.h"
	23	#include "cmdlf.h"
	24	#include "cmdlfhid.h"
	25	#include "cmdlfti.h"
	26	#include "cmdlfem4x.h"
db09cb3a	27	#include "cmdlfhitag.h"
54a942b0	28	#include "cmdlft55xx.h"
54a942b0	29	#include "cmdlfpcf7931.h"
a1f3bb12	30	#include "cmdlfio.h"
7fe9b0b7	31
	32	static int CmdHelp(const char *Cmd);
	33
	34	/* send a command before reading */
	35	int CmdLFCommandRead(const char *Cmd)
	36	{
	37	static char dummy[3];
	38
	39	dummy[0]= ' ';
	40
	41	UsbCommand c = {CMD_MOD_THEN_ACQUIRE_RAW_ADC_SAMPLES_125K};
1a07fd51	42	sscanf(Cmd, "%"lli" %"lli" %"lli" %s %s", &c.arg[0], &c.arg[1], &c.arg[2],(char)(&c.d.asBytes),(char)(&dummy+1));
7fe9b0b7	43	// in case they specified 'h'
	44	strcpy((char )&c.d.asBytes + strlen((char )c.d.asBytes), dummy);
	45	SendCommand(&c);
	46	return 0;
	47	}
	48
	49	int CmdFlexdemod(const char *Cmd)
	50	{
	51	int i;
	52	for (i = 0; i < GraphTraceLen; ++i) {
	53	if (GraphBuffer[i] < 0) {
	54	GraphBuffer[i] = -1;
	55	} else {
	56	GraphBuffer[i] = 1;
	57	}
	58	}
	59
	60	#define LONG_WAIT 100
	61	int start;
	62	for (start = 0; start < GraphTraceLen - LONG_WAIT; start++) {
	63	int first = GraphBuffer[start];
	64	for (i = start; i < start + LONG_WAIT; i++) {
	65	if (GraphBuffer[i] != first) {
	66	break;
	67	}
	68	}
	69	if (i == (start + LONG_WAIT)) {
	70	break;
	71	}
	72	}
	73	if (start == GraphTraceLen - LONG_WAIT) {
	74	PrintAndLog("nothing to wait for");
	75	return 0;
	76	}
	77
	78	GraphBuffer[start] = 2;
	79	GraphBuffer[start+1] = -2;
	80
	81	uint8_t bits[64];
	82
	83	int bit;
	84	i = start;
	85	for (bit = 0; bit < 64; bit++) {
	86	int j;
	87	int sum = 0;
	88	for (j = 0; j < 16; j++) {
	89	sum += GraphBuffer[i++];
	90	}
	91	if (sum > 0) {
	92	bits[bit] = 1;
	93	} else {
	94	bits[bit] = 0;
	95	}
	96	PrintAndLog("bit %d sum %d", bit, sum);
	97	}
	98
	99	for (bit = 0; bit < 64; bit++) {
	100	int j;
	101	int sum = 0;
	102	for (j = 0; j < 16; j++) {
	103	sum += GraphBuffer[i++];
	104	}
	105	if (sum > 0 && bits[bit] != 1) {
	106	PrintAndLog("oops1 at %d", bit);
107	}
108	if (sum < 0 && bits[bit] != 0) {
109	PrintAndLog("oops2 at %d", bit);
110	}
111	}
112
113	GraphTraceLen = 32*64;
114	i = 0;
115	int phase = 0;
116	for (bit = 0; bit < 64; bit++) {
117	if (bits[bit] == 0) {
118	phase = 0;
119	} else {
120	phase = 1;
121	}
122	int j;
123	for (j = 0; j < 32; j++) {
124	GraphBuffer[i++] = phase;
125	phase = !phase;
126	}
127	}
128
129	RepaintGraphWindow();
130	return 0;
131	}
a1f3bb12	132
7fe9b0b7	133	int CmdIndalaDemod(const char *Cmd)
	134	{
	135	// Usage: recover 64bit UID by default, specify "224" as arg to recover a 224bit UID
	136
	137	int state = -1;
	138	int count = 0;
	139	int i, j;
	140	// worst case with GraphTraceLen=64000 is < 4096
	141	// under normal conditions it's < 2048
	142	uint8_t rawbits[4096];
	143	int rawbit = 0;
	144	int worst = 0, worstPos = 0;
d5a72d2f	145	// PrintAndLog("Expecting a bit less than %d raw bits", GraphTraceLen / 32);
7fe9b0b7	146	for (i = 0; i < GraphTraceLen-1; i += 2) {
	147	count += 1;
	148	if ((GraphBuffer[i] > GraphBuffer[i + 1]) && (state != 1)) {
	149	if (state == 0) {
	150	for (j = 0; j < count - 8; j += 16) {
	151	rawbits[rawbit++] = 0;
	152	}
	153	if ((abs(count - j)) > worst) {
	154	worst = abs(count - j);
	155	worstPos = i;
	156	}
	157	}
	158	state = 1;
	159	count = 0;
	160	} else if ((GraphBuffer[i] < GraphBuffer[i + 1]) && (state != 0)) {
	161	if (state == 1) {
	162	for (j = 0; j < count - 8; j += 16) {
	163	rawbits[rawbit++] = 1;
	164	}
	165	if ((abs(count - j)) > worst) {
	166	worst = abs(count - j);
	167	worstPos = i;
	168	}
	169	}
	170	state = 0;
	171	count = 0;
	172	}
	173	}
d5a72d2f	174	if (rawbit>0){
	175	PrintAndLog("Recovered %d raw bits, expected: %d", rawbit, GraphTraceLen/32);
	176	PrintAndLog("worst metric (0=best..7=worst): %d at pos %d", worst, worstPos);
	177	} else return 0;
7fe9b0b7	178	// Finding the start of a UID
	179	int uidlen, long_wait;
	180	if (strcmp(Cmd, "224") == 0) {
	181	uidlen = 224;
	182	long_wait = 30;
	183	} else {
	184	uidlen = 64;
	185	long_wait = 29;
	186	}
	187	int start;
	188	int first = 0;
	189	for (start = 0; start <= rawbit - uidlen; start++) {
	190	first = rawbits[start];
	191	for (i = start; i < start + long_wait; i++) {
	192	if (rawbits[i] != first) {
	193	break;
	194	}
	195	}
	196	if (i == (start + long_wait)) {
	197	break;
	198	}
	199	}
	200	if (start == rawbit - uidlen + 1) {
	201	PrintAndLog("nothing to wait for");
	202	return 0;
	203	}
	204
	205	// Inverting signal if needed
	206	if (first == 1) {
	207	for (i = start; i < rawbit; i++) {
	208	rawbits[i] = !rawbits[i];
	209	}
	210	}
	211
	212	// Dumping UID
	213	uint8_t bits[224];
	214	char showbits[225];
	215	showbits[uidlen]='\0';
	216	int bit;
	217	i = start;
	218	int times = 0;
	219	if (uidlen > rawbit) {
	220	PrintAndLog("Warning: not enough raw bits to get a full UID");
	221	for (bit = 0; bit < rawbit; bit++) {
	222	bits[bit] = rawbits[i++];
	223	// As we cannot know the parity, let's use "." and "/"
	224	showbits[bit] = '.' + bits[bit];
	225	}
	226	showbits[bit+1]='\0';
	227	PrintAndLog("Partial UID=%s", showbits);
	228	return 0;
	229	} else {
	230	for (bit = 0; bit < uidlen; bit++) {
	231	bits[bit] = rawbits[i++];
	232	showbits[bit] = '0' + bits[bit];
	233	}
	234	times = 1;
	235	}
2414f978	236
	237	//convert UID to HEX
	238	uint32_t uid1, uid2, uid3, uid4, uid5, uid6, uid7;
	239	int idx;
	240	uid1=0;
	241	uid2=0;
	242	if (uidlen==64){
	243	for( idx=0; idx<64; idx++) {
	244	if (showbits[idx] == '0') {
	245	uid1=(uid1<<1)\|(uid2>>31);
	246	uid2=(uid2<<1)\|0;
	247	} else {
	248	uid1=(uid1<<1)\|(uid2>>31);
	249	uid2=(uid2<<1)\|1;
	250	}
	251	}
	252	PrintAndLog("UID=%s (%x%08x)", showbits, uid1, uid2);
	253	}
	254	else {
	255	uid3=0;
	256	uid4=0;
	257	uid5=0;
	258	uid6=0;
	259	uid7=0;
	260	for( idx=0; idx<224; idx++) {
	261	uid1=(uid1<<1)\|(uid2>>31);
	262	uid2=(uid2<<1)\|(uid3>>31);
	263	uid3=(uid3<<1)\|(uid4>>31);
	264	uid4=(uid4<<1)\|(uid5>>31);
	265	uid5=(uid5<<1)\|(uid6>>31);
	266	uid6=(uid6<<1)\|(uid7>>31);
	267	if (showbits[idx] == '0') uid7=(uid7<<1)\|0;
	268	else uid7=(uid7<<1)\|1;
	269	}
	270	PrintAndLog("UID=%s (%x%08x%08x%08x%08x%08x%08x)", showbits, uid1, uid2, uid3, uid4, uid5, uid6, uid7);
	271	}
7fe9b0b7	272
0ff9a939	273	// Checking UID against next occurrences
7fe9b0b7	274	for (; i + uidlen <= rawbit;) {
	275	int failed = 0;
	276	for (bit = 0; bit < uidlen; bit++) {
	277	if (bits[bit] != rawbits[i++]) {
	278	failed = 1;
	279	break;
	280	}
	281	}
	282	if (failed == 1) {
	283	break;
	284	}
	285	times += 1;
	286	}
0ff9a939	287	PrintAndLog("Occurrences: %d (expected %d)", times, (rawbit - start) / uidlen);
7fe9b0b7	288
	289	// Remodulating for tag cloning
	290	GraphTraceLen = 32*uidlen;
	291	i = 0;
	292	int phase = 0;
	293	for (bit = 0; bit < uidlen; bit++) {
	294	if (bits[bit] == 0) {
	295	phase = 0;
	296	} else {
	297	phase = 1;
	298	}
	299	int j;
	300	for (j = 0; j < 32; j++) {
	301	GraphBuffer[i++] = phase;
	302	phase = !phase;
	303	}
	304	}
	305
	306	RepaintGraphWindow();
d5a72d2f	307	return 1;
7fe9b0b7	308	}
7fe9b0b7	309
2414f978	310	int CmdIndalaClone(const char *Cmd)
	311	{
	312	unsigned int uid1, uid2, uid3, uid4, uid5, uid6, uid7;
	313	UsbCommand c;
	314	uid1=0;
	315	uid2=0;
	316	uid3=0;
	317	uid4=0;
	318	uid5=0;
	319	uid6=0;
	320	uid7=0;
	321	int n = 0, i = 0;
	322
	323	if (strchr(Cmd,'l') != 0) {
	324	while (sscanf(&Cmd[i++], "%1x", &n ) == 1) {
	325	uid1 = (uid1 << 4) \| (uid2 >> 28);
	326	uid2 = (uid2 << 4) \| (uid3 >> 28);
	327	uid3 = (uid3 << 4) \| (uid4 >> 28);
	328	uid4 = (uid4 << 4) \| (uid5 >> 28);
	329	uid5 = (uid5 << 4) \| (uid6 >> 28);
	330	uid6 = (uid6 << 4) \| (uid7 >> 28);
	331	uid7 = (uid7 << 4) \| (n & 0xf);
	332	}
	333	PrintAndLog("Cloning 224bit tag with UID %x%08x%08x%08x%08x%08x%08x", uid1, uid2, uid3, uid4, uid5, uid6, uid7);
	334	c.cmd = CMD_INDALA_CLONE_TAG_L;
	335	c.d.asDwords[0] = uid1;
	336	c.d.asDwords[1] = uid2;
	337	c.d.asDwords[2] = uid3;
	338	c.d.asDwords[3] = uid4;
	339	c.d.asDwords[4] = uid5;
	340	c.d.asDwords[5] = uid6;
	341	c.d.asDwords[6] = uid7;
	342	}
	343	else
	344	{
	345	while (sscanf(&Cmd[i++], "%1x", &n ) == 1) {
	346	uid1 = (uid1 << 4) \| (uid2 >> 28);
	347	uid2 = (uid2 << 4) \| (n & 0xf);
	348	}
	349	PrintAndLog("Cloning 64bit tag with UID %x%08x", uid1, uid2);
	350	c.cmd = CMD_INDALA_CLONE_TAG;
	351	c.arg[0] = uid1;
	352	c.arg[1] = uid2;
	353	}
	354
	355	SendCommand(&c);
	356	return 0;
	357	}
	358
7fe9b0b7	359	int CmdLFRead(const char *Cmd)
	360	{
	361	UsbCommand c = {CMD_ACQUIRE_RAW_ADC_SAMPLES_125K};
	362	// 'h' means higher-low-frequency, 134 kHz
	363	if(*Cmd == 'h') {
	364	c.arg[0] = 1;
	365	} else if (*Cmd == '\0') {
	366	c.arg[0] = 0;
f66021cf	367	} else if (sscanf(Cmd, "%"lli, &c.arg[0]) != 1) {
bf7163bd	368	PrintAndLog("use 'read' or 'read h', or 'read <divisor>'");
7fe9b0b7	369	return 0;
	370	}
	371	SendCommand(&c);
902cb3c0	372	WaitForResponse(CMD_ACK,NULL);
7fe9b0b7	373	return 0;
	374	}
	375
	376	static void ChkBitstream(const char *str)
	377	{
	378	int i;
	379
	380	/* convert to bitstream if necessary */
	381	for (i = 0; i < (int)(GraphTraceLen / 2); i++)
	382	{
	383	if (GraphBuffer[i] > 1 \|\| GraphBuffer[i] < 0)
	384	{
	385	CmdBitstream(str);
	386	break;
	387	}
	388	}
	389	}
	390
	391	int CmdLFSim(const char *Cmd)
	392	{
	393	int i;
	394	static int gap;
	395
	396	sscanf(Cmd, "%i", &gap);
	397
	398	/* convert to bitstream if necessary */
	399	ChkBitstream(Cmd);
	400
	401	PrintAndLog("Sending data, please wait...");
	402	for (i = 0; i < GraphTraceLen; i += 48) {
	403	UsbCommand c={CMD_DOWNLOADED_SIM_SAMPLES_125K, {i, 0, 0}};
	404	int j;
	405	for (j = 0; j < 48; j++) {
	406	c.d.asBytes[j] = GraphBuffer[i+j];
	407	}
	408	SendCommand(&c);
902cb3c0	409	WaitForResponse(CMD_ACK,NULL);
7fe9b0b7	410	}
	411
	412	PrintAndLog("Starting simulator...");
	413	UsbCommand c = {CMD_SIMULATE_TAG_125K, {GraphTraceLen, gap, 0}};
	414	SendCommand(&c);
	415	return 0;
	416	}
	417
	418	int CmdLFSimBidir(const char *Cmd)
	419	{
	420	/* Set ADC to twice the carrier for a slight supersampling */
	421	UsbCommand c = {CMD_LF_SIMULATE_BIDIR, {47, 384, 0}};
	422	SendCommand(&c);
	423	return 0;
	424	}
	425
	426	/* simulate an LF Manchester encoded tag with specified bitstream, clock rate and inter-id gap */
	427	int CmdLFSimManchester(const char *Cmd)
	428	{
	429	static int clock, gap;
	430	static char data[1024], gapstring[8];
	431
	432	/* get settings/bits */
	433	sscanf(Cmd, "%i %s %i", &clock, &data[0], &gap);
	434
	435	/* clear our graph */
	436	ClearGraph(0);
	437
	438	/* fill it with our bitstream */
	439	for (int i = 0; i < strlen(data) ; ++i)
	440	AppendGraph(0, clock, data[i]- '0');
	441
	442	/* modulate */
	443	CmdManchesterMod("");
	444
	445	/* show what we've done */
	446	RepaintGraphWindow();
	447
	448	/* simulate */
	449	sprintf(&gapstring[0], "%i", gap);
	450	CmdLFSim(gapstring);
	451	return 0;
	452	}
	453
b014c96d	454	int CmdLFSnoop(const char *Cmd)
	455	{
	456	UsbCommand c = {CMD_LF_SNOOP_RAW_ADC_SAMPLES};
	457	// 'h' means higher-low-frequency, 134 kHz
	458	c.arg[0] = 0;
	459	c.arg[1] = -1;
	460	if (*Cmd == 0) {
	461	// empty
	462	} else if (*Cmd == 'l') {
	463	sscanf(Cmd, "l %"lli, &c.arg[1]);
	464	} else if(*Cmd == 'h') {
	465	c.arg[0] = 1;
	466	sscanf(Cmd, "h %"lli, &c.arg[1]);
	467	} else if (sscanf(Cmd, "%"lli" %"lli, &c.arg[0], &c.arg[1]) < 1) {
	468	PrintAndLog("use 'snoop' or 'snoop {l,h} [trigger threshold]', or 'snoop <divisor> [trigger threshold]'");
	469	return 0;
	470	}
	471	SendCommand(&c);
	472	WaitForResponse(CMD_ACK,NULL);
	473	return 0;
	474	}
	475
7fe9b0b7	476	int CmdVchDemod(const char *Cmd)
	477	{
	478	// Is this the entire sync pattern, or does this also include some
	479	// data bits that happen to be the same everywhere? That would be
	480	// lovely to know.
	481	static const int SyncPattern[] = {
	482	1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
	483	1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
	484	1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
	485	1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
	486	1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
	487	1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
	488	1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
	489	1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
	490	1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
	491	1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
	492	};
	493
	494	// So first, we correlate for the sync pattern, and mark that.
	495	int bestCorrel = 0, bestPos = 0;
	496	int i;
	497	// It does us no good to find the sync pattern, with fewer than
	498	// 2048 samples after it...
	499	for (i = 0; i < (GraphTraceLen-2048); i++) {
	500	int sum = 0;
	501	int j;
	502	for (j = 0; j < arraylen(SyncPattern); j++) {
	503	sum += GraphBuffer[i+j]*SyncPattern[j];
	504	}
	505	if (sum > bestCorrel) {
	506	bestCorrel = sum;
	507	bestPos = i;
	508	}
	509	}
	510	PrintAndLog("best sync at %d [metric %d]", bestPos, bestCorrel);
	511
	512	char bits[257];
	513	bits[256] = '\0';
	514
	515	int worst = INT_MAX;
fddf220a	516	int worstPos = 0;
7fe9b0b7	517
	518	for (i = 0; i < 2048; i += 8) {
	519	int sum = 0;
	520	int j;
	521	for (j = 0; j < 8; j++) {
	522	sum += GraphBuffer[bestPos+i+j];
	523	}
	524	if (sum < 0) {
	525	bits[i/8] = '.';
	526	} else {
	527	bits[i/8] = '1';
	528	}
	529	if(abs(sum) < worst) {
	530	worst = abs(sum);
	531	worstPos = i;
	532	}
	533	}
	534	PrintAndLog("bits:");
	535	PrintAndLog("%s", bits);
	536	PrintAndLog("worst metric: %d at pos %d", worst, worstPos);
	537
	538	if (strcmp(Cmd, "clone")==0) {
	539	GraphTraceLen = 0;
	540	char *s;
	541	for(s = bits; *s; s++) {
	542	int j;
	543	for(j = 0; j < 16; j++) {
	544	GraphBuffer[GraphTraceLen++] = (*s == '1') ? 1 : 0;
	545	}
	546	}
	547	RepaintGraphWindow();
	548	}
	549	return 0;
	550	}
	551
d5a72d2f	552	//by marshmellow
	553	int CmdLFfind(const char *Cmd)
	554	{
	555	int ans=0;
	556	if (!offline){
	557	ans=CmdLFRead("");
	558	ans=CmdSamples("20000");
	559	}
	560	if (GraphTraceLen<1000) return 0;
	561	PrintAndLog("Checking for known tags:");
	562	ans=Cmdaskmandemod("");
	563	if (ans>0) return 1;
	564	ans=CmdFSKdemodHID("");
	565	if (ans>0) return 1;
	566	ans=CmdFSKdemodIO("");
	567	if (ans>0) return 1;
	568	//add psk and indala
	569	ans=CmdIndalaDemod("");
	570	if (ans>0) return 1;
	571	ans=CmdIndalaDemod("224");
	572	if (ans>0) return 1;
	573	PrintAndLog("No Known Tags Found!\n");
	574	return 0;
	575	}
	576
7fe9b0b7	577	static command_t CommandTable[] =
	578	{
	579	{"help", CmdHelp, 1, "This help"},
	580	{"cmdread", CmdLFCommandRead, 0, "<off period> <'0' period> <'1' period> <command> ['h'] -- Modulate LF reader field to send command before read (all periods in microseconds) (option 'h' for 134)"},
37239a7c	581	{"em4x", CmdLFEM4X, 1, "{ EM4X RFIDs... }"},
7fe9b0b7	582	{"flexdemod", CmdFlexdemod, 1, "Demodulate samples for FlexPass"},
37239a7c	583	{"hid", CmdLFHID, 1, "{ HID RFIDs... }"},
083ca3de	584	{"io", CmdLFIO, 1, "{ ioProx tags... }"},
7fe9b0b7	585	{"indalademod", CmdIndalaDemod, 1, "['224'] -- Demodulate samples for Indala 64 bit UID (option '224' for 224 bit)"},
083ca3de	586	{"indalaclone", CmdIndalaClone, 0, "<UID> ['l']-- Clone Indala to T55x7 (tag must be in antenna)(UID in HEX)(option 'l' for 224 UID"},
57c69556	587	{"read", CmdLFRead, 0, "['h' or <divisor>] -- Read 125/134 kHz LF ID-only tag (option 'h' for 134, alternatively: f=12MHz/(divisor+1))"},
d5a72d2f	588	{"search", CmdLFfind, 1, "Read and Search for valid known tag (in offline mode it you can load first then search)"},
7fe9b0b7	589	{"sim", CmdLFSim, 0, "[GAP] -- Simulate LF tag from buffer with optional GAP (in microseconds)"},
	590	{"simbidir", CmdLFSimBidir, 0, "Simulate LF tag (with bidirectional data transmission between reader and tag)"},
	591	{"simman", CmdLFSimManchester, 0, "<Clock> <Bitstream> [GAP] Simulate arbitrary Manchester LF tag"},
b014c96d	592	{"snoop", CmdLFSnoop, 0, "['l'\|'h'\|<divisor>] [trigger threshold]-- Snoop LF (l:125khz, h:134khz)"},
37239a7c	593	{"ti", CmdLFTI, 1, "{ TI RFIDs... }"},
db09cb3a	594	{"hitag", CmdLFHitag, 1, "{ Hitag tags and transponders... }"},
7fe9b0b7	595	{"vchdemod", CmdVchDemod, 1, "['clone'] -- Demodulate samples for VeriChip"},
54a942b0	596	{"t55xx", CmdLFT55XX, 1, "{ T55xx RFIDs... }"},
54a942b0	597	{"pcf7931", CmdLFPCF7931, 1, "{PCF7931 RFIDs...}"},
7fe9b0b7	598	{NULL, NULL, 0, NULL}
	599	};
	600
	601	int CmdLF(const char *Cmd)
	602	{
	603	CmdsParse(CommandTable, Cmd);
	604	return 0;
	605	}
	606
	607	int CmdHelp(const char *Cmd)
	608	{
	609	CmdsHelp(CommandTable);
	610	return 0;
	611	}