git.zerfleddert.de Git - proxmark3-svn/blob - client/cmdlf.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 // Low frequency commands
   9 //-----------------------------------------------------------------------------
  10
  11 #include <stdio.h>
  12 #include <stdlib.h>
  13 #include <string.h>
  14 #include <limits.h>
  15 //#include "proxusb.h"
  16 #include "proxmark3.h"
  17 #include "data.h"
  18 #include "graph.h"
  19 #include "ui.h"
  20 #include "cmdparser.h"
  21 #include "cmdmain.h"
  22 #include "cmddata.h"
  23 #include "cmdlf.h"
  24 #include "cmdlfhid.h"
  25 #include "cmdlfti.h"
  26 #include "cmdlfem4x.h"
  27 #include "cmdlfhitag.h"
  28 #include "cmdlft55xx.h"
  29 #include "cmdlfpcf7931.h"
  30 #include "cmdlfio.h"
  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};
  42         sscanf(Cmd, "%"lli" %"lli" %"lli" %s %s", &c.arg[0], &c.arg[1], &c.arg[2],(char*)(&c.d.asBytes),(char*)(&dummy+1));
  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 }
 132
 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;
 145  // PrintAndLog("Expecting a bit less than %d raw bits", GraphTraceLen / 32);
 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         }
 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;
 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         }
 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         }
 272
 273         // Checking UID against next occurrences
 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         }
 287         PrintAndLog("Occurrences: %d (expected %d)", times, (rawbit - start) / uidlen);
 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();
 307         return 1;
 308 }
 309
 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
 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;
 367         } else if (sscanf(Cmd, "%"lli, &c.arg[0]) != 1) {
 368                 PrintAndLog("use 'read' or 'read h', or 'read <divisor>'");
 369                 return 0;
 370         }
 371         SendCommand(&c);
 372         WaitForResponse(CMD_ACK,NULL);
 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);
 409                 WaitForResponse(CMD_ACK,NULL);
 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
 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
 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;
 516         int worstPos = 0;
 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
 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("NOTE: some demods output possible binary\n  if it finds something that looks like a tag");
 562         PrintAndLog("Checking for known tags:");
 563
 564         ans=Cmdaskmandemod("");
 565         if (ans>0) {
 566                 PrintAndLog("Valid EM410x ID Found!");
 567                 return 1;
 568         }
 569         ans=CmdFSKdemodHID("");
 570         if (ans>0) {
 571                 PrintAndLog("Valid HID Prox ID Found!");
 572                 return 1;
 573         }
 574         ans=CmdFSKdemodIO("");
 575         if (ans>0) {
 576                 PrintAndLog("Valid IO Prox ID Found!");
 577                 return 1;
 578         }
 579         //add psk and indala
 580         ans=CmdIndalaDecode("");
 581         if (ans>0) {
 582                 PrintAndLog("Valid Indala ID Found!");
 583                 return 1;
 584         }
 585  // ans=CmdIndalaDemod("224");
 586  // if (ans>0) return 1;
 587         PrintAndLog("No Known Tags Found!\n");
 588         return 0;
 589 }
 590
 591 static command_t CommandTable[] =
 592 {
 593         {"help",        CmdHelp,            1, "This help"},
 594         {"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)"},
 595         {"em4x",        CmdLFEM4X,          1, "{ EM4X RFIDs... }"},
 596         {"flexdemod",   CmdFlexdemod,       1, "Demodulate samples for FlexPass"},
 597         {"hid",         CmdLFHID,           1, "{ HID RFIDs... }"},
 598         {"io",            CmdLFIO,                1, "{ ioProx tags... }"},
 599         {"indalademod", CmdIndalaDemod,     1, "['224'] -- Demodulate samples for Indala 64 bit UID (option '224' for 224 bit)"},
 600         {"indalaclone", CmdIndalaClone,     0, "<UID> ['l']-- Clone Indala to T55x7 (tag must be in antenna)(UID in HEX)(option 'l' for 224 UID"},
 601         {"read",        CmdLFRead,          0, "['h' or <divisor>] -- Read 125/134 kHz LF ID-only tag (option 'h' for 134, alternatively: f=12MHz/(divisor+1))"},
 602         {"search",      CmdLFfind,          1, "Read and Search for valid known tag (in offline mode it you can load first then search)"},
 603         {"sim",         CmdLFSim,           0, "[GAP] -- Simulate LF tag from buffer with optional GAP (in microseconds)"},
 604         {"simbidir",    CmdLFSimBidir,      0, "Simulate LF tag (with bidirectional data transmission between reader and tag)"},
 605         {"simman",      CmdLFSimManchester, 0, "<Clock> <Bitstream> [GAP] Simulate arbitrary Manchester LF tag"},
 606         {"snoop",       CmdLFSnoop,         0, "['l'|'h'|<divisor>] [trigger threshold]-- Snoop LF (l:125khz, h:134khz)"},
 607         {"ti",          CmdLFTI,            1, "{ TI RFIDs... }"},
 608         {"hitag",       CmdLFHitag,         1, "{ Hitag tags and transponders... }"},
 609         {"vchdemod",    CmdVchDemod,        1, "['clone'] -- Demodulate samples for VeriChip"},
 610         {"t55xx",       CmdLFT55XX,         1, "{ T55xx RFIDs... }"},
 611         {"pcf7931",     CmdLFPCF7931,       1, "{PCF7931 RFIDs...}"},
 612         {NULL, NULL, 0, NULL}
 613 };
 614
 615 int CmdLF(const char *Cmd)
 616 {
 617         CmdsParse(CommandTable, Cmd);
 618         return 0;
 619 }
 620
 621 int CmdHelp(const char *Cmd)
 622 {
 623         CmdsHelp(CommandTable);
 624         return 0;
 625 }