client/cmddata.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 // Data and Graph commands
   9 //-----------------------------------------------------------------------------
  10
  11 #include <stdio.h>
  12 #include <stdlib.h>
  13 #include <string.h>
  14 #include <limits.h>
  15 #include "proxmark3.h"
  16 #include "data.h"
  17 #include "ui.h"
  18 #include "graph.h"
  19 #include "cmdparser.h"
  20 #include "util.h"
  21 #include "cmdmain.h"
  22 #include "cmddata.h"
  23 #include "lfdemod.h"
  24 uint8_t DemodBuffer[MAX_DEMOD_BUF_LEN];
  25 int DemodBufferLen;
  26 static int CmdHelp(const char *Cmd);
  27
  28 //set the demod buffer with given array of binary (one bit per byte)
  29 //by marshmellow
  30 void setDemodBuf(uint8_t *buff,int size)
  31 {
  32         int i=0;
  33         for (; i < size; ++i){
  34                 DemodBuffer[i]=buff[i];
  35         }
  36         DemodBufferLen=size;
  37         return;
  38 }
  39
  40 //by marshmellow
  41 void printDemodBuff()
  42 {
  43         uint32_t i = 0;
  44         int bitLen = DemodBufferLen;
  45         if (bitLen<16) {
  46                 PrintAndLog("no bits found in demod buffer");
  47                 return;
  48         }
  49         if (bitLen>512) bitLen=512; //max output to 512 bits if we have more - should be plenty
  50         for (i = 0; i <= (bitLen-16); i+=16) {
  51                 PrintAndLog("%i%i%i%i%i%i%i%i%i%i%i%i%i%i%i%i",
  52                         DemodBuffer[i],
  53                         DemodBuffer[i+1],
  54                         DemodBuffer[i+2],
  55                         DemodBuffer[i+3],
  56                         DemodBuffer[i+4],
  57                         DemodBuffer[i+5],
  58                         DemodBuffer[i+6],
  59                         DemodBuffer[i+7],
  60                         DemodBuffer[i+8],
  61                         DemodBuffer[i+9],
  62                         DemodBuffer[i+10],
  63                         DemodBuffer[i+11],
  64                         DemodBuffer[i+12],
  65                         DemodBuffer[i+13],
  66                         DemodBuffer[i+14],
  67                         DemodBuffer[i+15]);
  68         }
  69         return;
  70 }
  71
  72
  73 int CmdAmp(const char *Cmd)
  74 {
  75   int i, rising, falling;
  76   int max = INT_MIN, min = INT_MAX;
  77
  78   for (i = 10; i < GraphTraceLen; ++i) {
  79     if (GraphBuffer[i] > max)
  80       max = GraphBuffer[i];
  81     if (GraphBuffer[i] < min)
  82       min = GraphBuffer[i];
  83   }
  84
  85   if (max != min) {
  86     rising = falling= 0;
  87     for (i = 0; i < GraphTraceLen; ++i) {
  88       if (GraphBuffer[i + 1] < GraphBuffer[i]) {
  89         if (rising) {
  90           GraphBuffer[i] = max;
  91           rising = 0;
  92         }
  93         falling = 1;
  94       }
  95       if (GraphBuffer[i + 1] > GraphBuffer[i]) {
  96         if (falling) {
  97           GraphBuffer[i] = min;
  98           falling = 0;
  99         }
 100         rising= 1;
 101       }
 102     }
 103   }
 104   RepaintGraphWindow();
 105   return 0;
 106 }
 107
 108 /*
 109  * Generic command to demodulate ASK.
 110  *
 111  * Argument is convention: positive or negative (High mod means zero
 112  * or high mod means one)
 113  *
 114  * Updates the Graph trace with 0/1 values
 115  *
 116  * Arguments:
 117  * c : 0 or 1
 118  */
 119  //this method is dependant on all highs and lows to be the same(or clipped)  this creates issues[marshmellow] it also ignores the clock
 120 int Cmdaskdemod(const char *Cmd)
 121 {
 122   int i;
 123   int c, high = 0, low = 0;
 124
 125   // TODO: complain if we do not give 2 arguments here !
 126   // (AL - this doesn't make sense! we're only using one argument!!!)
 127   sscanf(Cmd, "%i", &c);
 128
 129   /* Detect high and lows and clock */
 130         // (AL - clock???)
 131   for (i = 0; i < GraphTraceLen; ++i)
 132   {
 133     if (GraphBuffer[i] > high)
 134       high = GraphBuffer[i];
 135     else if (GraphBuffer[i] < low)
 136       low = GraphBuffer[i];
 137   }
 138   high=abs(high*.75);
 139   low=abs(low*.75);
 140   if (c != 0 && c != 1) {
 141     PrintAndLog("Invalid argument: %s", Cmd);
 142     return 0;
 143   }
 144   //prime loop
 145   if (GraphBuffer[0] > 0) {
 146     GraphBuffer[0] = 1-c;
 147   } else {
 148     GraphBuffer[0] = c;
 149   }
 150   for (i = 1; i < GraphTraceLen; ++i) {
 151     /* Transitions are detected at each peak
 152      * Transitions are either:
 153      * - we're low: transition if we hit a high
 154      * - we're high: transition if we hit a low
 155      * (we need to do it this way because some tags keep high or
 156      * low for long periods, others just reach the peak and go
 157      * down)
 158      */
 159     //[marhsmellow] change == to >= for high and <= for low for fuzz
 160     if ((GraphBuffer[i] == high) && (GraphBuffer[i - 1] == c)) {
 161       GraphBuffer[i] = 1 - c;
 162     } else if ((GraphBuffer[i] == low) && (GraphBuffer[i - 1] == (1 - c))){
 163       GraphBuffer[i] = c;
 164     } else {
 165       /* No transition */
 166       GraphBuffer[i] = GraphBuffer[i - 1];
 167     }
 168   }
 169   RepaintGraphWindow();
 170   return 0;
 171 }
 172
 173 //by marshmellow
 174 void printBitStream(uint8_t BitStream[], uint32_t bitLen)
 175 {
 176   uint32_t i = 0;
 177   if (bitLen<16) {
 178     PrintAndLog("Too few bits found: %d",bitLen);
 179     return;
 180   }
 181   if (bitLen>512) bitLen=512;
 182    for (i = 0; i <= (bitLen-16); i+=16) {
 183     PrintAndLog("%i%i%i%i%i%i%i%i%i%i%i%i%i%i%i%i",
 184       BitStream[i],
 185       BitStream[i+1],
 186       BitStream[i+2],
 187       BitStream[i+3],
 188       BitStream[i+4],
 189       BitStream[i+5],
 190       BitStream[i+6],
 191       BitStream[i+7],
 192       BitStream[i+8],
 193       BitStream[i+9],
 194       BitStream[i+10],
 195       BitStream[i+11],
 196       BitStream[i+12],
 197       BitStream[i+13],
 198       BitStream[i+14],
 199       BitStream[i+15]);
 200   }
 201         return;
 202 }
 203 //by marshmellow
 204 //print EM410x ID in multiple formats
 205 void printEM410x(uint64_t id)
 206 {
 207   if (id !=0){
 208       uint64_t iii=1;
 209       uint64_t id2lo=0; //id2hi=0,
 210       uint32_t ii=0;
 211       uint32_t i=0;
 212       for (ii=5; ii>0;ii--){
 213         for (i=0;i<8;i++){
 214                                         id2lo=(id2lo<<1LL) | ((id & (iii << (i+((ii-1)*8)))) >> (i+((ii-1)*8)));
 215         }
 216       }
 217       //output em id
 218       PrintAndLog("EM TAG ID    : %010llx", id);
 219       PrintAndLog("Unique TAG ID: %010llx",  id2lo); //id2hi,
 220       PrintAndLog("DEZ 8        : %08lld",id & 0xFFFFFF);
 221       PrintAndLog("DEZ 10       : %010lld",id & 0xFFFFFF);
 222       PrintAndLog("DEZ 5.5      : %05lld.%05lld",(id>>16LL) & 0xFFFF,(id & 0xFFFF));
 223       PrintAndLog("DEZ 3.5A     : %03lld.%05lld",(id>>32ll),(id & 0xFFFF));
 224       PrintAndLog("DEZ 14/IK2   : %014lld",id);
 225       PrintAndLog("DEZ 15/IK3   : %015lld",id2lo);
 226       PrintAndLog("Other        : %05lld_%03lld_%08lld",(id&0xFFFF),((id>>16LL) & 0xFF),(id & 0xFFFFFF));
 227                 }
 228     return;
 229 }
 230
 231 //by marshmellow
 232 //take binary from demod buffer and see if we can find an EM410x ID
 233 int CmdEm410xDecode(const char *Cmd)
 234 {
 235   uint64_t id=0;
 236  // uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
 237  // uint32_t i=0;
 238  // i=getFromGraphBuf(BitStream);
 239         id = Em410xDecode(DemodBuffer,DemodBufferLen);
 240   printEM410x(id);
 241   if (id>0) return 1;
 242   return 0;
 243 }
 244
 245
 246 //by marshmellow
 247 //takes 2 arguments - clock and invert both as integers
 248 //attempts to demodulate ask while decoding manchester
 249 //prints binary found and saves in graphbuffer for further commands
 250 int Cmdaskmandemod(const char *Cmd)
 251 {
 252         int invert=0;
 253         int clk=0;
 254   uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
 255         sscanf(Cmd, "%i %i", &clk, &invert);
 256   if (invert != 0 && invert != 1) {
 257     PrintAndLog("Invalid argument: %s", Cmd);
 258     return 0;
 259   }
 260
 261         size_t BitLen = getFromGraphBuf(BitStream);
 262   //  PrintAndLog("DEBUG: Bitlen from grphbuff: %d",BitLen);
 263   int errCnt=0;
 264    errCnt = askmandemod(BitStream, &BitLen,&clk,&invert);
 265         if (errCnt<0||BitLen<16){  //if fatal error (or -1)
 266                 // PrintAndLog("no data found %d, errors:%d, bitlen:%d, clock:%d",errCnt,invert,BitLen,clk);
 267     return 0;
 268         }
 269   PrintAndLog("\nUsing Clock: %d - Invert: %d - Bits Found: %d",clk,invert,BitLen);
 270
 271   //output
 272   if (errCnt>0){
 273     PrintAndLog("# Errors during Demoding (shown as 77 in bit stream): %d",errCnt);
 274   }
 275   PrintAndLog("ASK/Manchester decoded bitstream:");
 276   // Now output the bitstream to the scrollback by line of 16 bits
 277         setDemodBuf(BitStream,BitLen);
 278         printDemodBuff();
 279   uint64_t lo =0;
 280   lo = Em410xDecode(BitStream,BitLen);
 281   if (lo>0){
 282     //set GraphBuffer for clone or sim command
 283     PrintAndLog("EM410x pattern found: ");
 284     printEM410x(lo);
 285     return 1;
 286   }
 287   //if (BitLen>16) return 1;
 288   return 0;
 289 }
 290
 291 //by marshmellow
 292 //manchester decode
 293 //stricktly take 10 and 01 and convert to 0 and 1
 294 int Cmdmandecoderaw(const char *Cmd)
 295 {
 296   int i =0;
 297   int errCnt=0;
 298         size_t size=0;
 299   uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
 300   int high=0,low=0;
 301         for (;i<DemodBufferLen;++i){
 302                 if (DemodBuffer[i]>high) high=DemodBuffer[i];
 303                 else if(DemodBuffer[i]<low) low=DemodBuffer[i];
 304                 BitStream[i]=DemodBuffer[i];
 305   }
 306   if (high>1 || low <0 ){
 307     PrintAndLog("Error: please raw demod the wave first then mancheseter raw decode");
 308     return 0;
 309   }
 310         size=i;
 311         errCnt=manrawdecode(BitStream, &size);
 312   if (errCnt>=20){
 313     PrintAndLog("Too many errors: %d",errCnt);
 314     return 0;
 315   }
 316   PrintAndLog("Manchester Decoded - # errors:%d - data:",errCnt);
 317         printBitStream(BitStream, size);
 318   if (errCnt==0){
 319                 uint64_t id = 0;
 320                 id = Em410xDecode(BitStream, size);
 321                 if (id>0) setDemodBuf(BitStream, size);
 322                 printEM410x(id);
 323   }
 324   return 1;
 325 }
 326
 327 //by marshmellow
 328 //biphase decode
 329 //take 01 or 10 = 0 and 11 or 00 = 1
 330 //takes 1 argument "offset" default = 0 if 1 it will shift the decode by one bit
 331 //  since it is not like manchester and doesn't have an incorrect bit pattern we
 332 //  cannot determine if our decode is correct or if it should be shifted by one bit
 333 //  the argument offset allows us to manually shift if the output is incorrect
 334 //  (better would be to demod and decode at the same time so we can distinguish large
 335 //    width waves vs small width waves to help the decode positioning) or askbiphdemod
 336 int CmdBiphaseDecodeRaw(const char *Cmd)
 337 {
 338   int i = 0;
 339   int errCnt=0;
 340         size_t size=0;
 341   int offset=0;
 342   int high=0, low=0;
 343         sscanf(Cmd, "%i", &offset);
 344   uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
 345   //get graphbuffer & high and low
 346         for (;i<DemodBufferLen;++i){
 347                 if(DemodBuffer[i]>high)high=DemodBuffer[i];
 348                 else if(DemodBuffer[i]<low)low=DemodBuffer[i];
 349                 BitStream[i]=DemodBuffer[i];
 350   }
 351   if (high>1 || low <0){
 352     PrintAndLog("Error: please raw demod the wave first then decode");
 353     return 0;
 354   }
 355         size=i;
 356         errCnt=BiphaseRawDecode(BitStream, &size, offset);
 357   if (errCnt>=20){
 358     PrintAndLog("Too many errors attempting to decode: %d",errCnt);
 359     return 0;
 360   }
 361   PrintAndLog("Biphase Decoded using offset: %d - # errors:%d - data:",offset,errCnt);
 362         printBitStream(BitStream, size);
 363   PrintAndLog("\nif bitstream does not look right try offset=1");
 364   return 1;
 365 }
 366
 367
 368 //by marshmellow
 369 //takes 2 arguments - clock and invert both as integers
 370 //attempts to demodulate ask only
 371 //prints binary found and saves in graphbuffer for further commands
 372 int Cmdaskrawdemod(const char *Cmd)
 373 {
 374         int invert=0;
 375         int clk=0;
 376   uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
 377         sscanf(Cmd, "%i %i", &clk, &invert);
 378   if (invert != 0 && invert != 1) {
 379     PrintAndLog("Invalid argument: %s", Cmd);
 380     return 0;
 381   }
 382         size_t BitLen = getFromGraphBuf(BitStream);
 383   int errCnt=0;
 384         errCnt = askrawdemod(BitStream, &BitLen,&clk,&invert);
 385         if (errCnt==-1||BitLen<16){  //throw away static - allow 1 and -1 (in case of threshold command first)
 386                 PrintAndLog("no data found");
 387     return 0;
 388         }
 389   PrintAndLog("Using Clock: %d - invert: %d - Bits Found: %d",clk,invert,BitLen);
 390     //PrintAndLog("Data start pos:%d, lastBit:%d, stop pos:%d, numBits:%d",iii,lastBit,i,bitnum);
 391                 //move BitStream back to DemodBuffer
 392         setDemodBuf(BitStream,BitLen);
 393
 394                 //output
 395   if (errCnt>0){
 396     PrintAndLog("# Errors during Demoding (shown as 77 in bit stream): %d",errCnt);
 397   }
 398   PrintAndLog("ASK demoded bitstream:");
 399   // Now output the bitstream to the scrollback by line of 16 bits
 400   printBitStream(BitStream,BitLen);
 401
 402   return 1;
 403 }
 404
 405 int CmdAutoCorr(const char *Cmd)
 406 {
 407   static int CorrelBuffer[MAX_GRAPH_TRACE_LEN];
 408
 409   int window = atoi(Cmd);
 410
 411   if (window == 0) {
 412     PrintAndLog("needs a window");
 413     return 0;
 414   }
 415   if (window >= GraphTraceLen) {
 416     PrintAndLog("window must be smaller than trace (%d samples)",
 417       GraphTraceLen);
 418     return 0;
 419   }
 420
 421   PrintAndLog("performing %d correlations", GraphTraceLen - window);
 422
 423   for (int i = 0; i < GraphTraceLen - window; ++i) {
 424     int sum = 0;
 425     for (int j = 0; j < window; ++j) {
 426       sum += (GraphBuffer[j]*GraphBuffer[i + j]) / 256;
 427     }
 428     CorrelBuffer[i] = sum;
 429   }
 430   GraphTraceLen = GraphTraceLen - window;
 431   memcpy(GraphBuffer, CorrelBuffer, GraphTraceLen * sizeof (int));
 432
 433   RepaintGraphWindow();
 434   return 0;
 435 }
 436
 437 int CmdBitsamples(const char *Cmd)
 438 {
 439   int cnt = 0;
 440   uint8_t got[12288];
 441
 442   GetFromBigBuf(got,sizeof(got),0);
 443   WaitForResponse(CMD_ACK,NULL);
 444
 445     for (int j = 0; j < sizeof(got); j++) {
 446       for (int k = 0; k < 8; k++) {
 447         if(got[j] & (1 << (7 - k))) {
 448           GraphBuffer[cnt++] = 1;
 449         } else {
 450           GraphBuffer[cnt++] = 0;
 451         }
 452       }
 453   }
 454   GraphTraceLen = cnt;
 455   RepaintGraphWindow();
 456   return 0;
 457 }
 458
 459 /*
 460  * Convert to a bitstream
 461  */
 462 int CmdBitstream(const char *Cmd)
 463 {
 464   int i, j;
 465   int bit;
 466   int gtl;
 467   int clock;
 468   int low = 0;
 469   int high = 0;
 470   int hithigh, hitlow, first;
 471
 472   /* Detect high and lows and clock */
 473   for (i = 0; i < GraphTraceLen; ++i)
 474   {
 475     if (GraphBuffer[i] > high)
 476       high = GraphBuffer[i];
 477     else if (GraphBuffer[i] < low)
 478       low = GraphBuffer[i];
 479   }
 480
 481   /* Get our clock */
 482   clock = GetClock(Cmd, high, 1);
 483   gtl = ClearGraph(0);
 484
 485   bit = 0;
 486   for (i = 0; i < (int)(gtl / clock); ++i)
 487   {
 488     hithigh = 0;
 489     hitlow = 0;
 490     first = 1;
 491     /* Find out if we hit both high and low peaks */
 492     for (j = 0; j < clock; ++j)
 493     {
 494       if (GraphBuffer[(i * clock) + j] == high)
 495         hithigh = 1;
 496       else if (GraphBuffer[(i * clock) + j] == low)
 497         hitlow = 1;
 498       /* it doesn't count if it's the first part of our read
 499          because it's really just trailing from the last sequence */
 500       if (first && (hithigh || hitlow))
 501         hithigh = hitlow = 0;
 502       else
 503         first = 0;
 504
 505       if (hithigh && hitlow)
 506         break;
 507     }
 508
 509     /* If we didn't hit both high and low peaks, we had a bit transition */
 510     if (!hithigh || !hitlow)
 511       bit ^= 1;
 512
 513     AppendGraph(0, clock, bit);
 514         //    for (j = 0; j < (int)(clock/2); j++)
 515         //      GraphBuffer[(i * clock) + j] = bit ^ 1;
 516         //    for (j = (int)(clock/2); j < clock; j++)
 517         //      GraphBuffer[(i * clock) + j] = bit;
 518   }
 519
 520   RepaintGraphWindow();
 521   return 0;
 522 }
 523
 524 int CmdBuffClear(const char *Cmd)
 525 {
 526   UsbCommand c = {CMD_BUFF_CLEAR};
 527   SendCommand(&c);
 528   ClearGraph(true);
 529   return 0;
 530 }
 531
 532 int CmdDec(const char *Cmd)
 533 {
 534   for (int i = 0; i < (GraphTraceLen / 2); ++i)
 535     GraphBuffer[i] = GraphBuffer[i * 2];
 536   GraphTraceLen /= 2;
 537   PrintAndLog("decimated by 2");
 538   RepaintGraphWindow();
 539   return 0;
 540 }
 541
 542 /* Print our clock rate */
 543 // uses data from graphbuffer
 544 int CmdDetectClockRate(const char *Cmd)
 545 {
 546   GetClock("",0,0);
 547         //int clock = DetectASKClock(0);
 548         //PrintAndLog("Auto-detected clock rate: %d", clock);
 549   return 0;
 550 }
 551
 552 //by marshmellow
 553 //fsk raw demod and print binary
 554 //takes 4 arguments - Clock, invert, rchigh, rclow
 555 //defaults: clock = 50, invert=0, rchigh=10, rclow=8 (RF/10 RF/8 (fsk2a))
 556 int CmdFSKrawdemod(const char *Cmd)
 557 {
 558   //raw fsk demod  no manchester decoding no start bit finding just get binary from wave
 559   //set defaults
 560   int rfLen = 50;
 561   int invert=0;
 562   int fchigh=10;
 563   int fclow=8;
 564   //set options from parameters entered with the command
 565         sscanf(Cmd, "%i %i %i %i", &rfLen, &invert, &fchigh, &fclow);
 566
 567   if (strlen(Cmd)>0 && strlen(Cmd)<=2) {
 568      //rfLen=param_get8(Cmd, 0); //if rfLen option only is used
 569      if (rfLen==1){
 570       invert=1;   //if invert option only is used
 571       rfLen = 50;
 572      } else if(rfLen==0) rfLen=50;
 573         }
 574   PrintAndLog("Args invert: %d - Clock:%d - fchigh:%d - fclow: %d",invert,rfLen,fchigh, fclow);
 575   uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
 576         size_t BitLen = getFromGraphBuf(BitStream);
 577         int size  = fskdemod(BitStream,BitLen,(uint8_t)rfLen,(uint8_t)invert,(uint8_t)fchigh,(uint8_t)fclow);
 578   if (size>0){
 579     PrintAndLog("FSK decoded bitstream:");
 580                 setDemodBuf(BitStream,size);
 581
 582     // Now output the bitstream to the scrollback by line of 16 bits
 583     if(size > (8*32)+2) size = (8*32)+2; //only output a max of 8 blocks of 32 bits  most tags will have full bit stream inside that sample size
 584     printBitStream(BitStream,size);
 585   } else{
 586     PrintAndLog("no FSK data found");
 587   }
 588   return 0;
 589 }
 590
 591 //by marshmellow (based on existing demod + holiman's refactor)
 592 //HID Prox demod - FSK RF/50 with preamble of 00011101 (then manchester encoded)
 593 //print full HID Prox ID and some bit format details if found
 594 int CmdFSKdemodHID(const char *Cmd)
 595 {
 596   //raw fsk demod no manchester decoding no start bit finding just get binary from wave
 597   uint32_t hi2=0, hi=0, lo=0;
 598
 599   uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
 600         size_t BitLen = getFromGraphBuf(BitStream);
 601   //get binary from fsk wave
 602         size_t size  = HIDdemodFSK(BitStream,BitLen,&hi2,&hi,&lo);
 603   if (size<0){
 604     PrintAndLog("Error demoding fsk");
 605     return 0;
 606   }
 607   if (hi2==0 && hi==0 && lo==0) return 0;
 608   if (hi2 != 0){ //extra large HID tags
 609                 PrintAndLog("HID Prox TAG ID: %x%08x%08x (%d)",
 610        (unsigned int) hi2, (unsigned int) hi, (unsigned int) lo, (unsigned int) (lo>>1) & 0xFFFF);
 611                 setDemodBuf(BitStream,BitLen);
 612     return 1;
 613   }
 614   else {  //standard HID tags <38 bits
 615     //Dbprintf("TAG ID: %x%08x (%d)",(unsigned int) hi, (unsigned int) lo, (unsigned int) (lo>>1) & 0xFFFF); //old print cmd
 616     uint8_t fmtLen = 0;
 617     uint32_t fc = 0;
 618     uint32_t cardnum = 0;
 619     if (((hi>>5)&1)==1){//if bit 38 is set then < 37 bit format is used
 620       uint32_t lo2=0;
 621       lo2=(((hi & 31) << 12) | (lo>>20)); //get bits 21-37 to check for format len bit
 622       uint8_t idx3 = 1;
 623       while(lo2>1){ //find last bit set to 1 (format len bit)
 624         lo2=lo2>>1;
 625         idx3++;
 626       }
 627                         fmtLen =idx3+19;
 628       fc =0;
 629       cardnum=0;
 630       if(fmtLen==26){
 631         cardnum = (lo>>1)&0xFFFF;
 632         fc = (lo>>17)&0xFF;
 633       }
 634       if(fmtLen==34){
 635         cardnum = (lo>>1)&0xFFFF;
 636         fc= ((hi&1)<<15)|(lo>>17);
 637       }
 638       if(fmtLen==35){
 639         cardnum = (lo>>1)&0xFFFFF;
 640         fc = ((hi&1)<<11)|(lo>>21);
 641       }
 642     }
 643     else { //if bit 38 is not set then 37 bit format is used
 644       fmtLen = 37;
 645       fc = 0;
 646       cardnum = 0;
 647       if(fmtLen == 37){
 648         cardnum = (lo>>1)&0x7FFFF;
 649         fc = ((hi&0xF)<<12)|(lo>>20);
 650       }
 651                 }
 652                 PrintAndLog("HID Prox TAG ID: %x%08x (%d) - Format Len: %dbit - FC: %d - Card: %d",
 653       (unsigned int) hi, (unsigned int) lo, (unsigned int) (lo>>1) & 0xFFFF,
 654       (unsigned int) fmtLen, (unsigned int) fc, (unsigned int) cardnum);
 655                 setDemodBuf(BitStream,BitLen);
 656     return 1;
 657   }
 658   return 0;
 659 }
 660
 661 //by marshmellow
 662 //IO-Prox demod - FSK RF/64 with preamble of 000000001
 663 //print ioprox ID and some format details
 664 int CmdFSKdemodIO(const char *Cmd)
 665 {
 666   //raw fsk demod no manchester decoding no start bit finding just get binary from wave
 667   //set defaults
 668         int idx=0;
 669   //something in graphbuffer
 670   if (GraphTraceLen < 65) return 0;
 671   uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
 672         size_t BitLen = getFromGraphBuf(BitStream);
 673   //get binary from fsk wave
 674  // PrintAndLog("DEBUG: got buff");
 675         idx = IOdemodFSK(BitStream,BitLen);
 676   if (idx<0){
 677     //PrintAndLog("Error demoding fsk");
 678     return 0;
 679   }
 680  // PrintAndLog("DEBUG: Got IOdemodFSK");
 681   if (idx==0){
 682     //PrintAndLog("IO Prox Data not found - FSK Data:");
 683     //if (BitLen > 92) printBitStream(BitStream,92);
 684     return 0;
 685   }
 686     //Index map
 687     //0           10          20          30          40          50          60
 688     //|           |           |           |           |           |           |
 689     //01234567 8 90123456 7 89012345 6 78901234 5 67890123 4 56789012 3 45678901 23
 690     //-----------------------------------------------------------------------------
 691     //00000000 0 11110000 1 facility 1 version* 1 code*one 1 code*two 1 ???????? 11
 692     //
 693     //XSF(version)facility:codeone+codetwo (raw)
 694     //Handle the data
 695   if (idx+64>BitLen) return 0;
 696   PrintAndLog("%d%d%d%d%d%d%d%d %d",BitStream[idx],    BitStream[idx+1],  BitStream[idx+2], BitStream[idx+3], BitStream[idx+4], BitStream[idx+5], BitStream[idx+6], BitStream[idx+7], BitStream[idx+8]);
 697         PrintAndLog("%d%d%d%d%d%d%d%d %d",BitStream[idx+9],  BitStream[idx+10], BitStream[idx+11],BitStream[idx+12],BitStream[idx+13],BitStream[idx+14],BitStream[idx+15],BitStream[idx+16],BitStream[idx+17]);
 698   PrintAndLog("%d%d%d%d%d%d%d%d %d facility",BitStream[idx+18], BitStream[idx+19], BitStream[idx+20],BitStream[idx+21],BitStream[idx+22],BitStream[idx+23],BitStream[idx+24],BitStream[idx+25],BitStream[idx+26]);
 699   PrintAndLog("%d%d%d%d%d%d%d%d %d version",BitStream[idx+27], BitStream[idx+28], BitStream[idx+29],BitStream[idx+30],BitStream[idx+31],BitStream[idx+32],BitStream[idx+33],BitStream[idx+34],BitStream[idx+35]);
 700   PrintAndLog("%d%d%d%d%d%d%d%d %d code1",BitStream[idx+36], BitStream[idx+37], BitStream[idx+38],BitStream[idx+39],BitStream[idx+40],BitStream[idx+41],BitStream[idx+42],BitStream[idx+43],BitStream[idx+44]);
 701   PrintAndLog("%d%d%d%d%d%d%d%d %d code2",BitStream[idx+45], BitStream[idx+46], BitStream[idx+47],BitStream[idx+48],BitStream[idx+49],BitStream[idx+50],BitStream[idx+51],BitStream[idx+52],BitStream[idx+53]);
 702   PrintAndLog("%d%d%d%d%d%d%d%d %d%d checksum",BitStream[idx+54],BitStream[idx+55],BitStream[idx+56],BitStream[idx+57],BitStream[idx+58],BitStream[idx+59],BitStream[idx+60],BitStream[idx+61],BitStream[idx+62],BitStream[idx+63]);
 703
 704   uint32_t code = bytebits_to_byte(BitStream+idx,32);
 705         uint32_t code2 = bytebits_to_byte(BitStream+idx+32,32);
 706   uint8_t version = bytebits_to_byte(BitStream+idx+27,8); //14,4
 707   uint8_t facilitycode = bytebits_to_byte(BitStream+idx+18,8) ;
 708   uint16_t number = (bytebits_to_byte(BitStream+idx+36,8)<<8)|(bytebits_to_byte(BitStream+idx+45,8)); //36,9
 709         PrintAndLog("IO Prox XSF(%02d)%02x:%05d (%08x%08x)",version,facilitycode,number,code,code2);
 710         int i;
 711         for (i=0;i<64;++i)
 712                 DemodBuffer[i]=BitStream[idx++];
 713
 714         DemodBufferLen=64;
 715   return 1;
 716 }
 717 int CmdFSKdemod(const char *Cmd) //old CmdFSKdemod needs updating
 718 {
 719   static const int LowTone[]  = {
 720     1,  1,  1,  1,  1, -1, -1, -1, -1, -1,
 721     1,  1,  1,  1,  1, -1, -1, -1, -1, -1,
 722     1,  1,  1,  1,  1, -1, -1, -1, -1, -1,
 723     1,  1,  1,  1,  1, -1, -1, -1, -1, -1,
 724     1,  1,  1,  1,  1, -1, -1, -1, -1, -1
 725   };
 726   static const int HighTone[] = {
 727     1,  1,  1,  1,  1,     -1, -1, -1, -1,
 728     1,  1,  1,  1,         -1, -1, -1, -1,
 729     1,  1,  1,  1,         -1, -1, -1, -1,
 730     1,  1,  1,  1,         -1, -1, -1, -1,
 731     1,  1,  1,  1,         -1, -1, -1, -1,
 732     1,  1,  1,  1,     -1, -1, -1, -1, -1,
 733   };
 734
 735   int lowLen = sizeof (LowTone) / sizeof (int);
 736   int highLen = sizeof (HighTone) / sizeof (int);
 737   int convLen = (highLen > lowLen) ? highLen : lowLen;
 738   uint32_t hi = 0, lo = 0;
 739
 740   int i, j;
 741   int minMark = 0, maxMark = 0;
 742
 743   for (i = 0; i < GraphTraceLen - convLen; ++i) {
 744     int lowSum = 0, highSum = 0;
 745
 746     for (j = 0; j < lowLen; ++j) {
 747       lowSum += LowTone[j]*GraphBuffer[i+j];
 748     }
 749     for (j = 0; j < highLen; ++j) {
 750       highSum += HighTone[j] * GraphBuffer[i + j];
 751     }
 752     lowSum = abs(100 * lowSum / lowLen);
 753     highSum = abs(100 * highSum / highLen);
 754     GraphBuffer[i] = (highSum << 16) | lowSum;
 755   }
 756
 757   for(i = 0; i < GraphTraceLen - convLen - 16; ++i) {
 758     int lowTot = 0, highTot = 0;
 759     // 10 and 8 are f_s divided by f_l and f_h, rounded
 760     for (j = 0; j < 10; ++j) {
 761       lowTot += (GraphBuffer[i+j] & 0xffff);
 762     }
 763     for (j = 0; j < 8; j++) {
 764       highTot += (GraphBuffer[i + j] >> 16);
 765     }
 766     GraphBuffer[i] = lowTot - highTot;
 767     if (GraphBuffer[i] > maxMark) maxMark = GraphBuffer[i];
 768     if (GraphBuffer[i] < minMark) minMark = GraphBuffer[i];
 769   }
 770
 771   GraphTraceLen -= (convLen + 16);
 772   RepaintGraphWindow();
 773
 774   // Find bit-sync (3 lo followed by 3 high) (HID ONLY)
 775   int max = 0, maxPos = 0;
 776   for (i = 0; i < 6000; ++i) {
 777     int dec = 0;
 778     for (j = 0; j < 3 * lowLen; ++j) {
 779       dec -= GraphBuffer[i + j];
 780     }
 781     for (; j < 3 * (lowLen + highLen ); ++j) {
 782       dec += GraphBuffer[i + j];
 783     }
 784     if (dec > max) {
 785       max = dec;
 786       maxPos = i;
 787     }
 788   }
 789
 790   // place start of bit sync marker in graph
 791   GraphBuffer[maxPos] = maxMark;
 792   GraphBuffer[maxPos + 1] = minMark;
 793
 794   maxPos += j;
 795
 796   // place end of bit sync marker in graph
 797   GraphBuffer[maxPos] = maxMark;
 798   GraphBuffer[maxPos+1] = minMark;
 799
 800   PrintAndLog("actual data bits start at sample %d", maxPos);
 801   PrintAndLog("length %d/%d", highLen, lowLen);
 802
 803         uint8_t bits[46];
 804         bits[sizeof(bits)-1] = '\0';
 805
 806   // find bit pairs and manchester decode them
 807   for (i = 0; i < arraylen(bits) - 1; ++i) {
 808     int dec = 0;
 809     for (j = 0; j < lowLen; ++j) {
 810       dec -= GraphBuffer[maxPos + j];
 811     }
 812     for (; j < lowLen + highLen; ++j) {
 813       dec += GraphBuffer[maxPos + j];
 814     }
 815     maxPos += j;
 816     // place inter bit marker in graph
 817     GraphBuffer[maxPos] = maxMark;
 818     GraphBuffer[maxPos + 1] = minMark;
 819
 820     // hi and lo form a 64 bit pair
 821     hi = (hi << 1) | (lo >> 31);
 822     lo = (lo << 1);
 823     // store decoded bit as binary (in hi/lo) and text (in bits[])
 824     if(dec < 0) {
 825       bits[i] = '1';
 826       lo |= 1;
 827     } else {
 828       bits[i] = '0';
 829     }
 830   }
 831   PrintAndLog("bits: '%s'", bits);
 832   PrintAndLog("hex: %08x %08x", hi, lo);
 833   return 0;
 834 }
 835
 836 int CmdDetectNRZpskClockRate(const char *Cmd)
 837 {
 838         GetNRZpskClock("",0,0);
 839         return 0;
 840 }
 841
 842 int PSKnrzDemod(const char *Cmd){
 843         int invert=0;
 844         int clk=0;
 845         sscanf(Cmd, "%i %i", &clk, &invert);
 846         if (invert != 0 && invert != 1) {
 847                 PrintAndLog("Invalid argument: %s", Cmd);
 848                 return -1;
 849         }
 850         uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
 851         size_t BitLen = getFromGraphBuf(BitStream);
 852         int errCnt=0;
 853         errCnt = pskNRZrawDemod(BitStream, &BitLen,&clk,&invert);
 854         if (errCnt<0|| BitLen<16){  //throw away static - allow 1 and -1 (in case of threshold command first)
 855                 //PrintAndLog("no data found, clk: %d, invert: %d, numbits: %d, errCnt: %d",clk,invert,BitLen,errCnt);
 856                 return -1;
 857         }
 858         PrintAndLog("Tried PSK/NRZ Demod using Clock: %d - invert: %d - Bits Found: %d",clk,invert,BitLen);
 859
 860         //prime demod buffer for output
 861         setDemodBuf(BitStream,BitLen);
 862         return errCnt;
 863 }
 864 // Indala 26 bit decode
 865 // by marshmellow
 866 // optional arguments - same as CmdpskNRZrawDemod (clock & invert)
 867 int CmdIndalaDecode(const char *Cmd)
 868 {
 869   uint8_t verbose = 1;
 870   int ans;
 871   if (strlen(Cmd)>0){
 872     if (Cmd[0]=='0'){
 873       verbose=0;
 874       ans = PSKnrzDemod("32");
 875     }else{
 876       ans = PSKnrzDemod(Cmd);
 877     }
 878   } else{ //default to RF/32
 879     ans = PSKnrzDemod("32");
 880   }
 881
 882         if (ans < 0){
 883                 if (verbose)
 884       PrintAndLog("Error1: %d",ans);
 885                 return 0;
 886         }
 887         uint8_t invert=0;
 888         ans = indala26decode(DemodBuffer,(size_t *) &DemodBufferLen, &invert);
 889         if (ans < 1) {
 890                 if (verbose)
 891       PrintAndLog("Error2: %d",ans);
 892                 return -1;
 893         }
 894         char showbits[251];
 895         if (invert)
 896     if (verbose)
 897       PrintAndLog("Had to invert bits");
 898         //convert UID to HEX
 899         uint32_t uid1, uid2, uid3, uid4, uid5, uid6, uid7;
 900         int idx;
 901         uid1=0;
 902         uid2=0;
 903         PrintAndLog("BitLen: %d",DemodBufferLen);
 904         if (DemodBufferLen==64){
 905                 for( idx=0; idx<64; idx++) {
 906                         uid1=(uid1<<1)|(uid2>>31);
 907                         if (DemodBuffer[idx] == 0) {
 908                                 uid2=(uid2<<1)|0;
 909                                 showbits[idx]='0';
 910                         } else {
 911                                 uid2=(uid2<<1)|1;
 912                                 showbits[idx]='1';
 913                         }
 914                 }
 915                 showbits[idx]='\0';
 916                 PrintAndLog("Indala UID=%s (%x%08x)", showbits, uid1, uid2);
 917         }
 918         else {
 919                 uid3=0;
 920                 uid4=0;
 921                 uid5=0;
 922                 uid6=0;
 923                 uid7=0;
 924                 for( idx=0; idx<DemodBufferLen; idx++) {
 925                         uid1=(uid1<<1)|(uid2>>31);
 926                         uid2=(uid2<<1)|(uid3>>31);
 927                         uid3=(uid3<<1)|(uid4>>31);
 928                         uid4=(uid4<<1)|(uid5>>31);
 929                         uid5=(uid5<<1)|(uid6>>31);
 930                         uid6=(uid6<<1)|(uid7>>31);
 931                         if (DemodBuffer[idx] == 0) {
 932                                 uid7=(uid7<<1)|0;
 933                                 showbits[idx]='0';
 934                         }
 935                         else {
 936                                 uid7=(uid7<<1)|1;
 937                                 showbits[idx]='1';
 938                         }
 939                 }
 940                 showbits[idx]='\0';
 941                 PrintAndLog("Indala UID=%s (%x%08x%08x%08x%08x%08x%08x)", showbits, uid1, uid2, uid3, uid4, uid5, uid6, uid7);
 942         }
 943         return 1;
 944 }
 945
 946 int CmdPskClean(const char *Cmd)
 947 {
 948         uint8_t bitStream[MAX_GRAPH_TRACE_LEN]={0};
 949         size_t bitLen = getFromGraphBuf(bitStream);
 950         pskCleanWave(bitStream, bitLen);
 951         setGraphBuf(bitStream, bitLen);
 952         return 0;
 953 }
 954
 955 //by marshmellow
 956 //takes 2 arguments - clock and invert both as integers
 957 //attempts to demodulate ask only
 958 //prints binary found and saves in graphbuffer for further commands
 959 int CmdpskNRZrawDemod(const char *Cmd)
 960 {
 961   uint8_t verbose = 1;
 962   int errCnt;
 963   if (strlen(Cmd)>0){
 964     if (Cmd[0]=='0')
 965       verbose=0;
 966   }
 967
 968   errCnt = PSKnrzDemod(Cmd);
 969         //output
 970         if (errCnt<0) return 0;
 971         if (errCnt>0){
 972                 if (verbose)
 973       PrintAndLog("# Errors during Demoding (shown as 77 in bit stream): %d",errCnt);
 974         }
 975         PrintAndLog("PSK or NRZ demoded bitstream:");
 976         // Now output the bitstream to the scrollback by line of 16 bits
 977         printDemodBuff();
 978
 979         return 1;
 980 }
 981
 982 int CmdGrid(const char *Cmd)
 983 {
 984   sscanf(Cmd, "%i %i", &PlotGridX, &PlotGridY);
 985   PlotGridXdefault= PlotGridX;
 986   PlotGridYdefault= PlotGridY;
 987   RepaintGraphWindow();
 988   return 0;
 989 }
 990
 991 int CmdHexsamples(const char *Cmd)
 992 {
 993   int i, j;
 994   int requested = 0;
 995   int offset = 0;
 996   char string_buf[25];
 997   char* string_ptr = string_buf;
 998   uint8_t got[40000];
 999
1000   sscanf(Cmd, "%i %i", &requested, &offset);
1001
1002   /* if no args send something */
1003   if (requested == 0) {
1004     requested = 8;
1005   }
1006   if (offset + requested > sizeof(got)) {
1007     PrintAndLog("Tried to read past end of buffer, <bytes> + <offset> > 40000");
1008     return 0;
1009         }
1010
1011   GetFromBigBuf(got,requested,offset);
1012   WaitForResponse(CMD_ACK,NULL);
1013
1014   i = 0;
1015   for (j = 0; j < requested; j++) {
1016     i++;
1017     string_ptr += sprintf(string_ptr, "%02x ", got[j]);
1018     if (i == 8) {
1019       *(string_ptr - 1) = '\0';    // remove the trailing space
1020       PrintAndLog("%s", string_buf);
1021       string_buf[0] = '\0';
1022       string_ptr = string_buf;
1023       i = 0;
1024     }
1025     if (j == requested - 1 && string_buf[0] != '\0') { // print any remaining bytes
1026       *(string_ptr - 1) = '\0';
1027       PrintAndLog("%s", string_buf);
1028       string_buf[0] = '\0';
1029   }
1030         }
1031   return 0;
1032 }
1033
1034 int CmdHide(const char *Cmd)
1035 {
1036   HideGraphWindow();
1037   return 0;
1038 }
1039
1040 int CmdHpf(const char *Cmd)
1041 {
1042   int i;
1043   int accum = 0;
1044
1045   for (i = 10; i < GraphTraceLen; ++i)
1046     accum += GraphBuffer[i];
1047   accum /= (GraphTraceLen - 10);
1048   for (i = 0; i < GraphTraceLen; ++i)
1049     GraphBuffer[i] -= accum;
1050
1051   RepaintGraphWindow();
1052   return 0;
1053 }
1054 typedef struct {
1055         uint8_t * buffer;
1056         uint32_t numbits;
1057         uint32_t position;
1058 }BitstreamOut;
1059
1060 bool _headBit( BitstreamOut *stream)
1061 {
1062         int bytepos = stream->position >> 3; // divide by 8
1063         int bitpos = (stream->position++) & 7; // mask out 00000111
1064         return (*(stream->buffer + bytepos) >> (7-bitpos)) & 1;
1065 }
1066
1067 uint8_t getByte(uint8_t bits_per_sample, BitstreamOut* b)
1068 {
1069         int i;
1070         uint8_t val = 0;
1071         for(i =0 ; i < bits_per_sample; i++)
1072         {
1073                 val |= (_headBit(b) << (7-i));
1074         }
1075         return val;
1076 }
1077
1078 int CmdSamples(const char *Cmd)
1079 {
1080         uint8_t got[40000];
1081
1082         int n = strtol(Cmd, NULL, 0);
1083         if (n == 0)
1084                 n = 20000;
1085
1086         if (n > sizeof(got))
1087                 n = sizeof(got);
1088
1089         PrintAndLog("Reading %d bytes from device memory\n", n);
1090         GetFromBigBuf(got,n,0);
1091         PrintAndLog("Data fetched");
1092         UsbCommand response;
1093         WaitForResponse(CMD_ACK, &response);
1094         uint8_t bits_per_sample = response.arg[0];
1095         PrintAndLog("Samples packed at %d bits per sample", bits_per_sample);
1096         if(bits_per_sample < 8)
1097         {
1098                 PrintAndLog("Unpacking...");
1099                 BitstreamOut bout = { got, bits_per_sample * n,  0};
1100                 int j =0;
1101                 for (j = 0; j * bits_per_sample < n * 8 && j < GraphTraceLen; j++) {
1102                         uint8_t sample = getByte(bits_per_sample, &bout);
1103                         GraphBuffer[j] = ((int) sample )- 128;
1104                 }
1105                 GraphTraceLen = j;
1106                 PrintAndLog("Unpacked %d samples" , j );
1107         }else
1108         {
1109                 for (int j = 0; j < n; j++) {
1110                         GraphBuffer[j] = ((int)got[j]) - 128;
1111                 }
1112                 GraphTraceLen = n;
1113
1114         }
1115
1116         RepaintGraphWindow();
1117         return 0;
1118 }
1119
1120 int CmdTuneSamples(const char *Cmd)
1121 {
1122         int timeout = 0;
1123         printf("\nMeasuring antenna characteristics, please wait...");
1124
1125         UsbCommand c = {CMD_MEASURE_ANTENNA_TUNING};
1126         SendCommand(&c);
1127
1128         UsbCommand resp;
1129         while(!WaitForResponseTimeout(CMD_MEASURED_ANTENNA_TUNING,&resp,1000)) {
1130                 timeout++;
1131                 printf(".");
1132                 if (timeout > 7) {
1133                         PrintAndLog("\nNo response from Proxmark. Aborting...");
1134                         return 1;
1135                 }
1136         }
1137
1138         int peakv, peakf;
1139         int vLf125, vLf134, vHf;
1140         vLf125 = resp.arg[0] & 0xffff;
1141         vLf134 = resp.arg[0] >> 16;
1142         vHf = resp.arg[1] & 0xffff;;
1143         peakf = resp.arg[2] & 0xffff;
1144         peakv = resp.arg[2] >> 16;
1145         PrintAndLog("");
1146         PrintAndLog("# LF antenna: %5.2f V @   125.00 kHz", vLf125/1000.0);
1147         PrintAndLog("# LF antenna: %5.2f V @   134.00 kHz", vLf134/1000.0);
1148         PrintAndLog("# LF optimal: %5.2f V @%9.2f kHz", peakv/1000.0, 12000.0/(peakf+1));
1149         PrintAndLog("# HF antenna: %5.2f V @    13.56 MHz", vHf/1000.0);
1150         if (peakv<2000)
1151                 PrintAndLog("# Your LF antenna is unusable.");
1152         else if (peakv<10000)
1153                 PrintAndLog("# Your LF antenna is marginal.");
1154         if (vHf<2000)
1155                 PrintAndLog("# Your HF antenna is unusable.");
1156         else if (vHf<5000)
1157                 PrintAndLog("# Your HF antenna is marginal.");
1158
1159         for (int i = 0; i < 256; i++) {
1160                 GraphBuffer[i] = resp.d.asBytes[i] - 128;
1161         }
1162
1163   PrintAndLog("Done! Divisor 89 is 134khz, 95 is 125khz.\n");
1164   PrintAndLog("\n");
1165         GraphTraceLen = 256;
1166         ShowGraphWindow();
1167
1168   return 0;
1169 }
1170
1171
1172 int CmdLoad(const char *Cmd)
1173 {
1174    char filename[FILE_PATH_SIZE] = {0x00};
1175    int len = 0;
1176
1177    len = strlen(Cmd);
1178    if (len > FILE_PATH_SIZE) len = FILE_PATH_SIZE;
1179    memcpy(filename, Cmd, len);
1180
1181    FILE *f = fopen(filename, "r");
1182   if (!f) {
1183      PrintAndLog("couldn't open '%s'", filename);
1184     return 0;
1185   }
1186
1187   GraphTraceLen = 0;
1188   char line[80];
1189   while (fgets(line, sizeof (line), f)) {
1190     GraphBuffer[GraphTraceLen] = atoi(line);
1191     GraphTraceLen++;
1192   }
1193   fclose(f);
1194   PrintAndLog("loaded %d samples", GraphTraceLen);
1195   RepaintGraphWindow();
1196   return 0;
1197 }
1198
1199 int CmdLtrim(const char *Cmd)
1200 {
1201   int ds = atoi(Cmd);
1202
1203   for (int i = ds; i < GraphTraceLen; ++i)
1204     GraphBuffer[i-ds] = GraphBuffer[i];
1205   GraphTraceLen -= ds;
1206
1207   RepaintGraphWindow();
1208   return 0;
1209 }
1210 int CmdRtrim(const char *Cmd)
1211 {
1212   int ds = atoi(Cmd);
1213
1214   GraphTraceLen = ds;
1215
1216   RepaintGraphWindow();
1217   return 0;
1218 }
1219
1220 /*
1221  * Manchester demodulate a bitstream. The bitstream needs to be already in
1222  * the GraphBuffer as 0 and 1 values
1223  *
1224  * Give the clock rate as argument in order to help the sync - the algorithm
1225  * resyncs at each pulse anyway.
1226  *
1227  * Not optimized by any means, this is the 1st time I'm writing this type of
1228  * routine, feel free to improve...
1229  *
1230  * 1st argument: clock rate (as number of samples per clock rate)
1231  *               Typical values can be 64, 32, 128...
1232  */
1233 int CmdManchesterDemod(const char *Cmd)
1234 {
1235   int i, j, invert= 0;
1236   int bit;
1237   int clock;
1238   int lastval = 0;
1239   int low = 0;
1240   int high = 0;
1241   int hithigh, hitlow, first;
1242   int lc = 0;
1243   int bitidx = 0;
1244   int bit2idx = 0;
1245   int warnings = 0;
1246
1247   /* check if we're inverting output */
1248   if (*Cmd == 'i')
1249   {
1250     PrintAndLog("Inverting output");
1251     invert = 1;
1252     ++Cmd;
1253     do
1254       ++Cmd;
1255     while(*Cmd == ' '); // in case a 2nd argument was given
1256   }
1257
1258   /* Holds the decoded bitstream: each clock period contains 2 bits       */
1259   /* later simplified to 1 bit after manchester decoding.                 */
1260   /* Add 10 bits to allow for noisy / uncertain traces without aborting   */
1261   /* int BitStream[GraphTraceLen*2/clock+10]; */
1262
1263   /* But it does not work if compiling on WIndows: therefore we just allocate a */
1264   /* large array */
1265   uint8_t BitStream[MAX_GRAPH_TRACE_LEN] = {0};
1266
1267   /* Detect high and lows */
1268   for (i = 0; i < GraphTraceLen; i++)
1269   {
1270     if (GraphBuffer[i] > high)
1271       high = GraphBuffer[i];
1272     else if (GraphBuffer[i] < low)
1273       low = GraphBuffer[i];
1274   }
1275
1276   /* Get our clock */
1277   clock = GetClock(Cmd, high, 1);
1278
1279   int tolerance = clock/4;
1280
1281   /* Detect first transition */
1282   /* Lo-Hi (arbitrary)       */
1283   /* skip to the first high */
1284   for (i= 0; i < GraphTraceLen; i++)
1285     if (GraphBuffer[i] == high)
1286       break;
1287   /* now look for the first low */
1288   for (; i < GraphTraceLen; i++)
1289   {
1290     if (GraphBuffer[i] == low)
1291     {
1292       lastval = i;
1293       break;
1294     }
1295   }
1296
1297   /* If we're not working with 1/0s, demod based off clock */
1298   if (high != 1)
1299   {
1300     bit = 0; /* We assume the 1st bit is zero, it may not be
1301               * the case: this routine (I think) has an init problem.
1302               * Ed.
1303               */
1304     for (; i < (int)(GraphTraceLen / clock); i++)
1305     {
1306       hithigh = 0;
1307       hitlow = 0;
1308       first = 1;
1309
1310       /* Find out if we hit both high and low peaks */
1311       for (j = 0; j < clock; j++)
1312       {
1313         if (GraphBuffer[(i * clock) + j] == high)
1314           hithigh = 1;
1315         else if (GraphBuffer[(i * clock) + j] == low)
1316           hitlow = 1;
1317
1318         /* it doesn't count if it's the first part of our read
1319            because it's really just trailing from the last sequence */
1320         if (first && (hithigh || hitlow))
1321           hithigh = hitlow = 0;
1322         else
1323           first = 0;
1324
1325         if (hithigh && hitlow)
1326           break;
1327       }
1328
1329       /* If we didn't hit both high and low peaks, we had a bit transition */
1330       if (!hithigh || !hitlow)
1331         bit ^= 1;
1332
1333       BitStream[bit2idx++] = bit ^ invert;
1334     }
1335   }
1336
1337   /* standard 1/0 bitstream */
1338   else
1339   {
1340
1341     /* Then detect duration between 2 successive transitions */
1342     for (bitidx = 1; i < GraphTraceLen; i++)
1343     {
1344       if (GraphBuffer[i-1] != GraphBuffer[i])
1345       {
1346         lc = i-lastval;
1347         lastval = i;
1348
1349         // Error check: if bitidx becomes too large, we do not
1350         // have a Manchester encoded bitstream or the clock is really
1351         // wrong!
1352         if (bitidx > (GraphTraceLen*2/clock+8) ) {
1353           PrintAndLog("Error: the clock you gave is probably wrong, aborting.");
1354           return 0;
1355         }
1356         // Then switch depending on lc length:
1357         // Tolerance is 1/4 of clock rate (arbitrary)
1358         if (abs(lc-clock/2) < tolerance) {
1359           // Short pulse : either "1" or "0"
1360           BitStream[bitidx++]=GraphBuffer[i-1];
1361         } else if (abs(lc-clock) < tolerance) {
1362           // Long pulse: either "11" or "00"
1363           BitStream[bitidx++]=GraphBuffer[i-1];
1364           BitStream[bitidx++]=GraphBuffer[i-1];
1365         } else {
1366         // Error
1367           warnings++;
1368           PrintAndLog("Warning: Manchester decode error for pulse width detection.");
1369           PrintAndLog("(too many of those messages mean either the stream is not Manchester encoded, or clock is wrong)");
1370
1371           if (warnings > 10)
1372           {
1373             PrintAndLog("Error: too many detection errors, aborting.");
1374             return 0;
1375           }
1376         }
1377       }
1378     }
1379
1380     // At this stage, we now have a bitstream of "01" ("1") or "10" ("0"), parse it into final decoded bitstream
1381     // Actually, we overwrite BitStream with the new decoded bitstream, we just need to be careful
1382     // to stop output at the final bitidx2 value, not bitidx
1383     for (i = 0; i < bitidx; i += 2) {
1384       if ((BitStream[i] == 0) && (BitStream[i+1] == 1)) {
1385         BitStream[bit2idx++] = 1 ^ invert;
1386       } else if ((BitStream[i] == 1) && (BitStream[i+1] == 0)) {
1387         BitStream[bit2idx++] = 0 ^ invert;
1388       } else {
1389         // We cannot end up in this state, this means we are unsynchronized,
1390         // move up 1 bit:
1391         i++;
1392         warnings++;
1393         PrintAndLog("Unsynchronized, resync...");
1394         PrintAndLog("(too many of those messages mean the stream is not Manchester encoded)");
1395
1396         if (warnings > 10)
1397         {
1398           PrintAndLog("Error: too many decode errors, aborting.");
1399           return 0;
1400         }
1401       }
1402     }
1403   }
1404
1405   PrintAndLog("Manchester decoded bitstream");
1406   // Now output the bitstream to the scrollback by line of 16 bits
1407   for (i = 0; i < (bit2idx-16); i+=16) {
1408     PrintAndLog("%i %i %i %i %i %i %i %i %i %i %i %i %i %i %i %i",
1409       BitStream[i],
1410       BitStream[i+1],
1411       BitStream[i+2],
1412       BitStream[i+3],
1413       BitStream[i+4],
1414       BitStream[i+5],
1415       BitStream[i+6],
1416       BitStream[i+7],
1417       BitStream[i+8],
1418       BitStream[i+9],
1419       BitStream[i+10],
1420       BitStream[i+11],
1421       BitStream[i+12],
1422       BitStream[i+13],
1423       BitStream[i+14],
1424       BitStream[i+15]);
1425   }
1426   return 0;
1427 }
1428
1429 /* Modulate our data into manchester */
1430 int CmdManchesterMod(const char *Cmd)
1431 {
1432   int i, j;
1433   int clock;
1434   int bit, lastbit, wave;
1435
1436   /* Get our clock */
1437   clock = GetClock(Cmd, 0, 1);
1438
1439   wave = 0;
1440   lastbit = 1;
1441   for (i = 0; i < (int)(GraphTraceLen / clock); i++)
1442   {
1443     bit = GraphBuffer[i * clock] ^ 1;
1444
1445     for (j = 0; j < (int)(clock/2); j++)
1446       GraphBuffer[(i * clock) + j] = bit ^ lastbit ^ wave;
1447     for (j = (int)(clock/2); j < clock; j++)
1448       GraphBuffer[(i * clock) + j] = bit ^ lastbit ^ wave ^ 1;
1449
1450     /* Keep track of how we start our wave and if we changed or not this time */
1451     wave ^= bit ^ lastbit;
1452     lastbit = bit;
1453   }
1454
1455   RepaintGraphWindow();
1456   return 0;
1457 }
1458
1459 int CmdNorm(const char *Cmd)
1460 {
1461   int i;
1462   int max = INT_MIN, min = INT_MAX;
1463
1464   for (i = 10; i < GraphTraceLen; ++i) {
1465     if (GraphBuffer[i] > max)
1466       max = GraphBuffer[i];
1467     if (GraphBuffer[i] < min)
1468       min = GraphBuffer[i];
1469   }
1470
1471   if (max != min) {
1472     for (i = 0; i < GraphTraceLen; ++i) {
1473                         GraphBuffer[i] = (GraphBuffer[i] - ((max + min) / 2)) * 256 /
1474         (max - min);
1475                                 //marshmelow: adjusted *1000 to *256 to make +/- 128 so demod commands still work
1476     }
1477   }
1478   RepaintGraphWindow();
1479   return 0;
1480 }
1481
1482 int CmdPlot(const char *Cmd)
1483 {
1484   ShowGraphWindow();
1485   return 0;
1486 }
1487
1488 int CmdSave(const char *Cmd)
1489 {
1490    char filename[FILE_PATH_SIZE] = {0x00};
1491    int len = 0;
1492
1493    len = strlen(Cmd);
1494    if (len > FILE_PATH_SIZE) len = FILE_PATH_SIZE;
1495    memcpy(filename, Cmd, len);
1496
1497
1498   FILE *f = fopen(filename, "w");
1499   if(!f) {
1500     PrintAndLog("couldn't open '%s'", filename);
1501     return 0;
1502   }
1503   int i;
1504   for (i = 0; i < GraphTraceLen; i++) {
1505     fprintf(f, "%d\n", GraphBuffer[i]);
1506   }
1507   fclose(f);
1508   PrintAndLog("saved to '%s'", Cmd);
1509   return 0;
1510 }
1511
1512 int CmdScale(const char *Cmd)
1513 {
1514   CursorScaleFactor = atoi(Cmd);
1515   if (CursorScaleFactor == 0) {
1516     PrintAndLog("bad, can't have zero scale");
1517     CursorScaleFactor = 1;
1518   }
1519   RepaintGraphWindow();
1520   return 0;
1521 }
1522
1523 int CmdThreshold(const char *Cmd)
1524 {
1525   int threshold = atoi(Cmd);
1526
1527   for (int i = 0; i < GraphTraceLen; ++i) {
1528     if (GraphBuffer[i] >= threshold)
1529       GraphBuffer[i] = 1;
1530     else
1531       GraphBuffer[i] = -1;
1532   }
1533   RepaintGraphWindow();
1534   return 0;
1535 }
1536
1537 int CmdDirectionalThreshold(const char *Cmd)
1538 {
1539         int8_t upThres = param_get8(Cmd, 0);
1540         int8_t downThres = param_get8(Cmd, 1);
1541
1542   printf("Applying Up Threshold: %d, Down Threshold: %d\n", upThres, downThres);
1543
1544   int lastValue = GraphBuffer[0];
1545   GraphBuffer[0] = 0; // Will be changed at the end, but init 0 as we adjust to last samples value if no threshold kicks in.
1546
1547   for (int i = 1; i < GraphTraceLen; ++i) {
1548     // Apply first threshold to samples heading up
1549     if (GraphBuffer[i] >= upThres && GraphBuffer[i] > lastValue)
1550     {
1551       lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it.
1552       GraphBuffer[i] = 1;
1553     }
1554     // Apply second threshold to samples heading down
1555     else if (GraphBuffer[i] <= downThres && GraphBuffer[i] < lastValue)
1556     {
1557       lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it.
1558       GraphBuffer[i] = -1;
1559     }
1560     else
1561     {
1562       lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it.
1563       GraphBuffer[i] = GraphBuffer[i-1];
1564
1565     }
1566   }
1567   GraphBuffer[0] = GraphBuffer[1]; // Aline with first edited sample.
1568   RepaintGraphWindow();
1569   return 0;
1570 }
1571
1572 int CmdZerocrossings(const char *Cmd)
1573 {
1574   // Zero-crossings aren't meaningful unless the signal is zero-mean.
1575   CmdHpf("");
1576
1577   int sign = 1;
1578   int zc = 0;
1579   int lastZc = 0;
1580
1581   for (int i = 0; i < GraphTraceLen; ++i) {
1582     if (GraphBuffer[i] * sign >= 0) {
1583       // No change in sign, reproduce the previous sample count.
1584       zc++;
1585       GraphBuffer[i] = lastZc;
1586     } else {
1587       // Change in sign, reset the sample count.
1588       sign = -sign;
1589       GraphBuffer[i] = lastZc;
1590       if (sign > 0) {
1591         lastZc = zc;
1592         zc = 0;
1593       }
1594     }
1595   }
1596
1597   RepaintGraphWindow();
1598   return 0;
1599 }
1600
1601 static command_t CommandTable[] =
1602 {
1603   {"help",          CmdHelp,            1, "This help"},
1604   {"amp",           CmdAmp,             1, "Amplify peaks"},
1605   {"askdemod",      Cmdaskdemod,        1, "<0 or 1> -- Attempt to demodulate simple ASK tags"},
1606         {"askmandemod",   Cmdaskmandemod,     1, "[clock] [invert<0|1>] -- Attempt to demodulate ASK/Manchester tags and output binary (args optional[clock will try Auto-detect])"},
1607         {"askrawdemod",   Cmdaskrawdemod,     1, "[clock] [invert<0|1>] -- Attempt to demodulate ASK tags and output binary (args optional[clock will try Auto-detect])"},
1608   {"autocorr",      CmdAutoCorr,        1, "<window length> -- Autocorrelation over window"},
1609   {"biphaserawdecode",CmdBiphaseDecodeRaw,1,"[offset] Biphase decode binary stream already in graph buffer (offset = bit to start decode from)"},
1610   {"bitsamples",    CmdBitsamples,      0, "Get raw samples as bitstring"},
1611   {"bitstream",     CmdBitstream,       1, "[clock rate] -- Convert waveform into a bitstream"},
1612   {"buffclear",     CmdBuffClear,       1, "Clear sample buffer and graph window"},
1613   {"dec",           CmdDec,             1, "Decimate samples"},
1614         {"detectclock",   CmdDetectClockRate, 1, "Detect ASK clock rate"},
1615   {"fskdemod",      CmdFSKdemod,        1, "Demodulate graph window as a HID FSK"},
1616   {"fskhiddemod",   CmdFSKdemodHID,     1, "Demodulate graph window as a HID FSK using raw"},
1617   {"fskiodemod",    CmdFSKdemodIO,      1, "Demodulate graph window as an IO Prox FSK using raw"},
1618         {"fskrawdemod",   CmdFSKrawdemod,     1, "[clock rate] [invert] [rchigh] [rclow] Demodulate graph window from FSK to binary (clock = 50)(invert = 1|0)(rchigh = 10)(rclow=8)"},
1619   {"grid",          CmdGrid,            1, "<x> <y> -- overlay grid on graph window, use zero value to turn off either"},
1620         {"hexsamples",    CmdHexsamples,      0, "<bytes> [<offset>] -- Dump big buffer as hex bytes"},
1621   {"hide",          CmdHide,            1, "Hide graph window"},
1622   {"hpf",           CmdHpf,             1, "Remove DC offset from trace"},
1623   {"load",          CmdLoad,            1, "<filename> -- Load trace (to graph window"},
1624   {"ltrim",         CmdLtrim,           1, "<samples> -- Trim samples from left of trace"},
1625   {"rtrim",         CmdRtrim,           1, "<location to end trace> -- Trim samples from right of trace"},
1626   {"mandemod",      CmdManchesterDemod, 1, "[i] [clock rate] -- Manchester demodulate binary stream (option 'i' to invert output)"},
1627   {"manrawdecode",  Cmdmandecoderaw,    1, "Manchester decode binary stream already in graph buffer"},
1628   {"manmod",        CmdManchesterMod,   1, "[clock rate] -- Manchester modulate a binary stream"},
1629         {"norm",          CmdNorm,            1, "Normalize max/min to +/-128"},
1630   {"plot",          CmdPlot,            1, "Show graph window (hit 'h' in window for keystroke help)"},
1631         {"pskclean",      CmdPskClean,        1, "Attempt to clean psk wave"},
1632         {"pskdetectclock",CmdDetectNRZpskClockRate, 1, "Detect ASK, PSK, or NRZ clock rate"},
1633         {"pskindalademod",CmdIndalaDecode,    1, "[clock] [invert<0|1>] -- Attempt to demodulate psk indala tags and output ID binary & hex (args optional[clock will try Auto-detect])"},
1634         {"psknrzrawdemod",CmdpskNRZrawDemod,  1, "[clock] [invert<0|1>] -- Attempt to demodulate psk or nrz tags and output binary (args optional[clock will try Auto-detect])"},
1635   {"samples",       CmdSamples,         0, "[512 - 40000] -- Get raw samples for graph window"},
1636   {"save",          CmdSave,            1, "<filename> -- Save trace (from graph window)"},
1637   {"scale",         CmdScale,           1, "<int> -- Set cursor display scale"},
1638   {"threshold",     CmdThreshold,       1, "<threshold> -- Maximize/minimize every value in the graph window depending on threshold"},
1639         {"dirthreshold",  CmdDirectionalThreshold,   1, "<thres up> <thres down> -- Max rising higher up-thres/ Min falling lower down-thres, keep rest as prev."},
1640         {"tune",          CmdTuneSamples,     0, "Get hw tune samples for graph window"},
1641   {"zerocrossings", CmdZerocrossings,   1, "Count time between zero-crossings"},
1642   {NULL, NULL, 0, NULL}
1643 };
1644
1645 int CmdData(const char *Cmd)
1646 {
1647   CmdsParse(CommandTable, Cmd);
1648   return 0;
1649 }
1650
1651 int CmdHelp(const char *Cmd)
1652 {
1653   CmdsHelp(CommandTable);
1654   return 0;
1655 }