]> git.zerfleddert.de Git - proxmark3-svn/blame - client/cmddata.c
wrong letter in variable name
[proxmark3-svn] / client / cmddata.c
CommitLineData
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// Data and Graph commands
9//-----------------------------------------------------------------------------
10
7fe9b0b7 11#include <stdio.h>
12#include <stdlib.h>
13#include <string.h>
14#include <limits.h>
902cb3c0 15#include "proxmark3.h"
7fe9b0b7 16#include "data.h"
17#include "ui.h"
18#include "graph.h"
19#include "cmdparser.h"
d51b2eda 20#include "util.h"
7fe9b0b7 21#include "cmdmain.h"
22#include "cmddata.h"
7db5f1ca 23#include "lfdemod.h"
4118b74d 24uint8_t DemodBuffer[MAX_DEMOD_BUF_LEN];
ec75f5c1 25uint8_t g_debugMode;
4118b74d 26int DemodBufferLen;
7fe9b0b7 27static int CmdHelp(const char *Cmd);
28
4118b74d 29//set the demod buffer with given array of binary (one bit per byte)
30//by marshmellow
ec75f5c1 31void setDemodBuf(uint8_t *buff, size_t size, size_t startIdx)
4118b74d 32{
ec75f5c1 33 size_t i = 0;
34 for (; i < size; i++){
35 DemodBuffer[i]=buff[startIdx++];
ba1a299c 36 }
37 DemodBufferLen=size;
38 return;
4118b74d 39}
40
ec75f5c1 41int CmdSetDebugMode(const char *Cmd)
42{
43 int demod=0;
44 sscanf(Cmd, "%i", &demod);
45 g_debugMode=(uint8_t)demod;
46 return 1;
47}
48
4118b74d 49//by marshmellow
50void printDemodBuff()
51{
ba1a299c 52 uint32_t i = 0;
53 int bitLen = DemodBufferLen;
54 if (bitLen<16) {
55 PrintAndLog("no bits found in demod buffer");
56 return;
57 }
58 if (bitLen>512) bitLen=512; //max output to 512 bits if we have more - should be plenty
33c7e2f3 59
60 // equally divided by 16
61 if ( bitLen % 16 > 0)
62 bitLen = (bitLen/16);
63
ba1a299c 64 for (i = 0; i <= (bitLen-16); i+=16) {
65 PrintAndLog("%i%i%i%i%i%i%i%i%i%i%i%i%i%i%i%i",
66 DemodBuffer[i],
67 DemodBuffer[i+1],
68 DemodBuffer[i+2],
69 DemodBuffer[i+3],
70 DemodBuffer[i+4],
71 DemodBuffer[i+5],
72 DemodBuffer[i+6],
73 DemodBuffer[i+7],
74 DemodBuffer[i+8],
75 DemodBuffer[i+9],
76 DemodBuffer[i+10],
77 DemodBuffer[i+11],
78 DemodBuffer[i+12],
79 DemodBuffer[i+13],
80 DemodBuffer[i+14],
81 DemodBuffer[i+15]);
82 }
83 return;
4118b74d 84}
85
86
7fe9b0b7 87int CmdAmp(const char *Cmd)
88{
89 int i, rising, falling;
90 int max = INT_MIN, min = INT_MAX;
91
92 for (i = 10; i < GraphTraceLen; ++i) {
93 if (GraphBuffer[i] > max)
94 max = GraphBuffer[i];
95 if (GraphBuffer[i] < min)
96 min = GraphBuffer[i];
97 }
98
99 if (max != min) {
100 rising = falling= 0;
101 for (i = 0; i < GraphTraceLen; ++i) {
102 if (GraphBuffer[i + 1] < GraphBuffer[i]) {
103 if (rising) {
104 GraphBuffer[i] = max;
105 rising = 0;
106 }
107 falling = 1;
108 }
109 if (GraphBuffer[i + 1] > GraphBuffer[i]) {
110 if (falling) {
111 GraphBuffer[i] = min;
112 falling = 0;
113 }
114 rising= 1;
115 }
116 }
117 }
118 RepaintGraphWindow();
119 return 0;
120}
121
122/*
123 * Generic command to demodulate ASK.
124 *
125 * Argument is convention: positive or negative (High mod means zero
126 * or high mod means one)
127 *
128 * Updates the Graph trace with 0/1 values
129 *
130 * Arguments:
131 * c : 0 or 1
132 */
2fc2150e 133 //this method is dependant on all highs and lows to be the same(or clipped) this creates issues[marshmellow] it also ignores the clock
7fe9b0b7 134int Cmdaskdemod(const char *Cmd)
135{
136 int i;
137 int c, high = 0, low = 0;
ba1a299c 138
7fe9b0b7 139 // TODO: complain if we do not give 2 arguments here !
140 // (AL - this doesn't make sense! we're only using one argument!!!)
141 sscanf(Cmd, "%i", &c);
ba1a299c 142
7fe9b0b7 143 /* Detect high and lows and clock */
ba1a299c 144 // (AL - clock???)
7fe9b0b7 145 for (i = 0; i < GraphTraceLen; ++i)
146 {
147 if (GraphBuffer[i] > high)
148 high = GraphBuffer[i];
149 else if (GraphBuffer[i] < low)
150 low = GraphBuffer[i];
151 }
eb191de6 152 high=abs(high*.75);
153 low=abs(low*.75);
7fe9b0b7 154 if (c != 0 && c != 1) {
155 PrintAndLog("Invalid argument: %s", Cmd);
156 return 0;
157 }
b3b70669 158 //prime loop
7fe9b0b7 159 if (GraphBuffer[0] > 0) {
160 GraphBuffer[0] = 1-c;
161 } else {
162 GraphBuffer[0] = c;
163 }
164 for (i = 1; i < GraphTraceLen; ++i) {
165 /* Transitions are detected at each peak
166 * Transitions are either:
167 * - we're low: transition if we hit a high
168 * - we're high: transition if we hit a low
169 * (we need to do it this way because some tags keep high or
170 * low for long periods, others just reach the peak and go
171 * down)
172 */
ae2f73c1 173 //[marhsmellow] change == to >= for high and <= for low for fuzz
174 if ((GraphBuffer[i] == high) && (GraphBuffer[i - 1] == c)) {
7fe9b0b7 175 GraphBuffer[i] = 1 - c;
ae2f73c1 176 } else if ((GraphBuffer[i] == low) && (GraphBuffer[i - 1] == (1 - c))){
7fe9b0b7 177 GraphBuffer[i] = c;
178 } else {
179 /* No transition */
180 GraphBuffer[i] = GraphBuffer[i - 1];
181 }
182 }
183 RepaintGraphWindow();
184 return 0;
185}
186
d5a72d2f 187//by marshmellow
188void printBitStream(uint8_t BitStream[], uint32_t bitLen)
189{
2fc2150e 190 uint32_t i = 0;
191 if (bitLen<16) {
192 PrintAndLog("Too few bits found: %d",bitLen);
193 return;
194 }
195 if (bitLen>512) bitLen=512;
2df8c079 196 for (i = 0; i <= (bitLen-16); i+=16) {
2fc2150e 197 PrintAndLog("%i%i%i%i%i%i%i%i%i%i%i%i%i%i%i%i",
198 BitStream[i],
199 BitStream[i+1],
200 BitStream[i+2],
201 BitStream[i+3],
202 BitStream[i+4],
203 BitStream[i+5],
204 BitStream[i+6],
205 BitStream[i+7],
206 BitStream[i+8],
207 BitStream[i+9],
208 BitStream[i+10],
209 BitStream[i+11],
210 BitStream[i+12],
211 BitStream[i+13],
212 BitStream[i+14],
213 BitStream[i+15]);
214 }
ba1a299c 215 return;
2fc2150e 216}
d5a72d2f 217//by marshmellow
ba1a299c 218//print EM410x ID in multiple formats
eb191de6 219void printEM410x(uint64_t id)
2fc2150e 220{
eb191de6 221 if (id !=0){
0e74c023 222 uint64_t iii=1;
ec75f5c1 223 uint64_t id2lo=0;
eb191de6 224 uint32_t ii=0;
225 uint32_t i=0;
0e74c023 226 for (ii=5; ii>0;ii--){
2fc2150e 227 for (i=0;i<8;i++){
ba1a299c 228 id2lo=(id2lo<<1LL) | ((id & (iii << (i+((ii-1)*8)))) >> (i+((ii-1)*8)));
2fc2150e 229 }
230 }
0e74c023 231 //output em id
eb191de6 232 PrintAndLog("EM TAG ID : %010llx", id);
ec75f5c1 233 PrintAndLog("Unique TAG ID: %010llx", id2lo);
eb191de6 234 PrintAndLog("DEZ 8 : %08lld",id & 0xFFFFFF);
235 PrintAndLog("DEZ 10 : %010lld",id & 0xFFFFFF);
236 PrintAndLog("DEZ 5.5 : %05lld.%05lld",(id>>16LL) & 0xFFFF,(id & 0xFFFF));
237 PrintAndLog("DEZ 3.5A : %03lld.%05lld",(id>>32ll),(id & 0xFFFF));
238 PrintAndLog("DEZ 14/IK2 : %014lld",id);
0e74c023 239 PrintAndLog("DEZ 15/IK3 : %015lld",id2lo);
eb191de6 240 PrintAndLog("Other : %05lld_%03lld_%08lld",(id&0xFFFF),((id>>16LL) & 0xFF),(id & 0xFFFFFF));
ba1a299c 241 }
eb191de6 242 return;
243}
244
d5a72d2f 245//by marshmellow
ba1a299c 246//take binary from demod buffer and see if we can find an EM410x ID
eb191de6 247int CmdEm410xDecode(const char *Cmd)
248{
249 uint64_t id=0;
ec75f5c1 250 size_t size = DemodBufferLen, idx=0;
251 id = Em410xDecode(DemodBuffer, &size, &idx);
252 if (id>0){
253 setDemodBuf(DemodBuffer, size, idx);
254 if (g_debugMode){
255 PrintAndLog("DEBUG: Printing demod buffer:");
256 printDemodBuff();
257 }
258 printEM410x(id);
259 return 1;
260 }
2fc2150e 261 return 0;
262}
263
f822a063 264
e888ed8e 265//by marshmellow
eb191de6 266//takes 2 arguments - clock and invert both as integers
ba1a299c 267//attempts to demodulate ask while decoding manchester
e888ed8e 268//prints binary found and saves in graphbuffer for further commands
9e6dd4eb 269int Cmdaskmandemod(const char *Cmd)
e888ed8e 270{
ec75f5c1 271 int invert=0;
ba1a299c 272 int clk=0;
eb191de6 273 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
ba1a299c 274 sscanf(Cmd, "%i %i", &clk, &invert);
e888ed8e 275 if (invert != 0 && invert != 1) {
276 PrintAndLog("Invalid argument: %s", Cmd);
277 return 0;
278 }
ba1a299c 279
280 size_t BitLen = getFromGraphBuf(BitStream);
ec75f5c1 281 if (g_debugMode==1) PrintAndLog("DEBUG: Bitlen from grphbuff: %d",BitLen);
eb191de6 282 int errCnt=0;
283 errCnt = askmandemod(BitStream, &BitLen,&clk,&invert);
ba1a299c 284 if (errCnt<0||BitLen<16){ //if fatal error (or -1)
ec75f5c1 285 if (g_debugMode==1) PrintAndLog("no data found %d, errors:%d, bitlen:%d, clock:%d",errCnt,invert,BitLen,clk);
e888ed8e 286 return 0;
ba1a299c 287 }
f822a063 288 PrintAndLog("\nUsing Clock: %d - Invert: %d - Bits Found: %d",clk,invert,BitLen);
ba1a299c 289
d5a72d2f 290 //output
eb191de6 291 if (errCnt>0){
292 PrintAndLog("# Errors during Demoding (shown as 77 in bit stream): %d",errCnt);
e888ed8e 293 }
eb191de6 294 PrintAndLog("ASK/Manchester decoded bitstream:");
295 // Now output the bitstream to the scrollback by line of 16 bits
ec75f5c1 296 setDemodBuf(BitStream,BitLen,0);
ba1a299c 297 printDemodBuff();
eb191de6 298 uint64_t lo =0;
ec75f5c1 299 size_t idx=0;
300 lo = Em410xDecode(BitStream, &BitLen, &idx);
d5a72d2f 301 if (lo>0){
302 //set GraphBuffer for clone or sim command
ec75f5c1 303 setDemodBuf(BitStream, BitLen, idx);
304 if (g_debugMode){
305 PrintAndLog("DEBUG: idx: %d, Len: %d, Printing Demod Buffer:", idx, BitLen);
306 printDemodBuff();
307 }
d5a72d2f 308 PrintAndLog("EM410x pattern found: ");
309 printEM410x(lo);
ac914e56 310 return 1;
d5a72d2f 311 }
eb191de6 312 return 0;
313}
314
315//by marshmellow
d5a72d2f 316//manchester decode
eb191de6 317//stricktly take 10 and 01 and convert to 0 and 1
318int Cmdmandecoderaw(const char *Cmd)
319{
320 int i =0;
321 int errCnt=0;
ba1a299c 322 size_t size=0;
eb191de6 323 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
324 int high=0,low=0;
ba1a299c 325 for (;i<DemodBufferLen;++i){
326 if (DemodBuffer[i]>high) high=DemodBuffer[i];
327 else if(DemodBuffer[i]<low) low=DemodBuffer[i];
328 BitStream[i]=DemodBuffer[i];
eb191de6 329 }
330 if (high>1 || low <0 ){
331 PrintAndLog("Error: please raw demod the wave first then mancheseter raw decode");
332 return 0;
333 }
ba1a299c 334 size=i;
335 errCnt=manrawdecode(BitStream, &size);
2df8c079 336 if (errCnt>=20){
337 PrintAndLog("Too many errors: %d",errCnt);
338 return 0;
339 }
eb191de6 340 PrintAndLog("Manchester Decoded - # errors:%d - data:",errCnt);
ba1a299c 341 printBitStream(BitStream, size);
eb191de6 342 if (errCnt==0){
ba1a299c 343 uint64_t id = 0;
ec75f5c1 344 size_t idx=0;
345 id = Em410xDecode(BitStream, &size, &idx);
346 if (id>0){
347 //need to adjust to set bitstream back to manchester encoded data
348 //setDemodBuf(BitStream, size, idx);
349
350 printEM410x(id);
351 }
eb191de6 352 }
d5a72d2f 353 return 1;
354}
355
356//by marshmellow
357//biphase decode
358//take 01 or 10 = 0 and 11 or 00 = 1
1e090a61 359//takes 2 arguments "offset" default = 0 if 1 it will shift the decode by one bit
360// and "invert" default = 0 if 1 it will invert output
ba1a299c 361// since it is not like manchester and doesn't have an incorrect bit pattern we
d5a72d2f 362// cannot determine if our decode is correct or if it should be shifted by one bit
363// the argument offset allows us to manually shift if the output is incorrect
364// (better would be to demod and decode at the same time so we can distinguish large
365// width waves vs small width waves to help the decode positioning) or askbiphdemod
366int CmdBiphaseDecodeRaw(const char *Cmd)
367{
368 int i = 0;
369 int errCnt=0;
ba1a299c 370 size_t size=0;
d5a72d2f 371 int offset=0;
1e090a61 372 int invert=0;
d5a72d2f 373 int high=0, low=0;
1e090a61 374 sscanf(Cmd, "%i %i", &offset, &invert);
d5a72d2f 375 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
376 //get graphbuffer & high and low
ba1a299c 377 for (;i<DemodBufferLen;++i){
378 if(DemodBuffer[i]>high)high=DemodBuffer[i];
379 else if(DemodBuffer[i]<low)low=DemodBuffer[i];
380 BitStream[i]=DemodBuffer[i];
d5a72d2f 381 }
382 if (high>1 || low <0){
383 PrintAndLog("Error: please raw demod the wave first then decode");
384 return 0;
385 }
ba1a299c 386 size=i;
1e090a61 387 errCnt=BiphaseRawDecode(BitStream, &size, offset, invert);
d5a72d2f 388 if (errCnt>=20){
389 PrintAndLog("Too many errors attempting to decode: %d",errCnt);
390 return 0;
391 }
392 PrintAndLog("Biphase Decoded using offset: %d - # errors:%d - data:",offset,errCnt);
ba1a299c 393 printBitStream(BitStream, size);
d5a72d2f 394 PrintAndLog("\nif bitstream does not look right try offset=1");
395 return 1;
eb191de6 396}
397
398//by marshmellow
399//takes 2 arguments - clock and invert both as integers
400//attempts to demodulate ask only
401//prints binary found and saves in graphbuffer for further commands
402int Cmdaskrawdemod(const char *Cmd)
403{
ba1a299c 404 int invert=0;
405 int clk=0;
eb191de6 406 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
ba1a299c 407 sscanf(Cmd, "%i %i", &clk, &invert);
eb191de6 408 if (invert != 0 && invert != 1) {
409 PrintAndLog("Invalid argument: %s", Cmd);
410 return 0;
411 }
ba1a299c 412 size_t BitLen = getFromGraphBuf(BitStream);
eb191de6 413 int errCnt=0;
ba1a299c 414 errCnt = askrawdemod(BitStream, &BitLen,&clk,&invert);
415 if (errCnt==-1||BitLen<16){ //throw away static - allow 1 and -1 (in case of threshold command first)
416 PrintAndLog("no data found");
ec75f5c1 417 if (g_debugMode==1) PrintAndLog("errCnt: %d, BitLen: %d, clk: %d, invert: %d", errCnt, BitLen, clk, invert);
eb191de6 418 return 0;
ba1a299c 419 }
f822a063 420 PrintAndLog("Using Clock: %d - invert: %d - Bits Found: %d",clk,invert,BitLen);
ec75f5c1 421
422 //move BitStream back to DemodBuffer
423 setDemodBuf(BitStream,BitLen,0);
ba1a299c 424
ec75f5c1 425 //output
eb191de6 426 if (errCnt>0){
427 PrintAndLog("# Errors during Demoding (shown as 77 in bit stream): %d",errCnt);
428 }
429 PrintAndLog("ASK demoded bitstream:");
430 // Now output the bitstream to the scrollback by line of 16 bits
431 printBitStream(BitStream,BitLen);
952a8bb5 432
f822a063 433 return 1;
e888ed8e 434}
435
7fe9b0b7 436int CmdAutoCorr(const char *Cmd)
437{
438 static int CorrelBuffer[MAX_GRAPH_TRACE_LEN];
439
440 int window = atoi(Cmd);
441
442 if (window == 0) {
443 PrintAndLog("needs a window");
444 return 0;
445 }
446 if (window >= GraphTraceLen) {
447 PrintAndLog("window must be smaller than trace (%d samples)",
448 GraphTraceLen);
449 return 0;
450 }
451
452 PrintAndLog("performing %d correlations", GraphTraceLen - window);
453
454 for (int i = 0; i < GraphTraceLen - window; ++i) {
455 int sum = 0;
456 for (int j = 0; j < window; ++j) {
457 sum += (GraphBuffer[j]*GraphBuffer[i + j]) / 256;
458 }
459 CorrelBuffer[i] = sum;
460 }
461 GraphTraceLen = GraphTraceLen - window;
462 memcpy(GraphBuffer, CorrelBuffer, GraphTraceLen * sizeof (int));
463
464 RepaintGraphWindow();
465 return 0;
466}
467
468int CmdBitsamples(const char *Cmd)
469{
470 int cnt = 0;
90d74dc2 471 uint8_t got[12288];
952a8bb5 472
90d74dc2 473 GetFromBigBuf(got,sizeof(got),0);
474 WaitForResponse(CMD_ACK,NULL);
7fe9b0b7 475
90d74dc2 476 for (int j = 0; j < sizeof(got); j++) {
7fe9b0b7 477 for (int k = 0; k < 8; k++) {
90d74dc2 478 if(got[j] & (1 << (7 - k))) {
7fe9b0b7 479 GraphBuffer[cnt++] = 1;
480 } else {
481 GraphBuffer[cnt++] = 0;
482 }
483 }
7fe9b0b7 484 }
485 GraphTraceLen = cnt;
486 RepaintGraphWindow();
487 return 0;
488}
489
490/*
491 * Convert to a bitstream
492 */
493int CmdBitstream(const char *Cmd)
494{
495 int i, j;
496 int bit;
497 int gtl;
498 int clock;
499 int low = 0;
500 int high = 0;
501 int hithigh, hitlow, first;
502
503 /* Detect high and lows and clock */
504 for (i = 0; i < GraphTraceLen; ++i)
505 {
506 if (GraphBuffer[i] > high)
507 high = GraphBuffer[i];
508 else if (GraphBuffer[i] < low)
509 low = GraphBuffer[i];
510 }
511
512 /* Get our clock */
513 clock = GetClock(Cmd, high, 1);
514 gtl = ClearGraph(0);
515
516 bit = 0;
517 for (i = 0; i < (int)(gtl / clock); ++i)
518 {
519 hithigh = 0;
520 hitlow = 0;
521 first = 1;
522 /* Find out if we hit both high and low peaks */
523 for (j = 0; j < clock; ++j)
524 {
525 if (GraphBuffer[(i * clock) + j] == high)
526 hithigh = 1;
527 else if (GraphBuffer[(i * clock) + j] == low)
528 hitlow = 1;
529 /* it doesn't count if it's the first part of our read
530 because it's really just trailing from the last sequence */
531 if (first && (hithigh || hitlow))
532 hithigh = hitlow = 0;
533 else
534 first = 0;
535
536 if (hithigh && hitlow)
537 break;
538 }
539
540 /* If we didn't hit both high and low peaks, we had a bit transition */
541 if (!hithigh || !hitlow)
542 bit ^= 1;
543
544 AppendGraph(0, clock, bit);
7fe9b0b7 545 }
ba1a299c 546
7fe9b0b7 547 RepaintGraphWindow();
548 return 0;
549}
550
551int CmdBuffClear(const char *Cmd)
552{
553 UsbCommand c = {CMD_BUFF_CLEAR};
554 SendCommand(&c);
555 ClearGraph(true);
556 return 0;
557}
558
559int CmdDec(const char *Cmd)
560{
561 for (int i = 0; i < (GraphTraceLen / 2); ++i)
562 GraphBuffer[i] = GraphBuffer[i * 2];
563 GraphTraceLen /= 2;
564 PrintAndLog("decimated by 2");
565 RepaintGraphWindow();
566 return 0;
567}
568
ec75f5c1 569//by marshmellow
570//shift graph zero up or down based on input + or -
571int CmdGraphShiftZero(const char *Cmd)
572{
573
574 int shift=0;
575 //set options from parameters entered with the command
576 sscanf(Cmd, "%i", &shift);
577 int shiftedVal=0;
578 for(int i = 0; i<GraphTraceLen; i++){
579 shiftedVal=GraphBuffer[i]+shift;
580 if (shiftedVal>127)
581 shiftedVal=127;
582 else if (shiftedVal<-127)
583 shiftedVal=-127;
584 GraphBuffer[i]= shiftedVal;
585 }
586 CmdNorm("");
587 return 0;
588}
589
7fe9b0b7 590/* Print our clock rate */
ba1a299c 591// uses data from graphbuffer
7fe9b0b7 592int CmdDetectClockRate(const char *Cmd)
593{
d5a72d2f 594 GetClock("",0,0);
ba1a299c 595 //int clock = DetectASKClock(0);
596 //PrintAndLog("Auto-detected clock rate: %d", clock);
7fe9b0b7 597 return 0;
598}
66707a3b 599
2fc2150e 600//by marshmellow
eb191de6 601//fsk raw demod and print binary
f822a063 602//takes 4 arguments - Clock, invert, rchigh, rclow
603//defaults: clock = 50, invert=0, rchigh=10, rclow=8 (RF/10 RF/8 (fsk2a))
e888ed8e 604int CmdFSKrawdemod(const char *Cmd)
b3b70669 605{
eb191de6 606 //raw fsk demod no manchester decoding no start bit finding just get binary from wave
b3b70669 607 //set defaults
03e6bb4a 608 int rfLen = 0;
f822a063 609 int invert=0;
03e6bb4a 610 int fchigh=0;
611 int fclow=0;
b3b70669 612 //set options from parameters entered with the command
ba1a299c 613 sscanf(Cmd, "%i %i %i %i", &rfLen, &invert, &fchigh, &fclow);
614
b3b70669 615 if (strlen(Cmd)>0 && strlen(Cmd)<=2) {
b3b70669 616 if (rfLen==1){
617 invert=1; //if invert option only is used
03e6bb4a 618 rfLen = 0;
619 }
ba1a299c 620 }
03e6bb4a 621
eb191de6 622 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
ba1a299c 623 size_t BitLen = getFromGraphBuf(BitStream);
03e6bb4a 624 //get field clock lengths
625 uint16_t fcs=0;
626 if (fchigh==0 || fclow == 0){
627 fcs=countFC(BitStream, BitLen);
628 if (fcs==0){
629 fchigh=10;
630 fclow=8;
631 }else{
632 fchigh = (fcs >> 8) & 0xFF;
633 fclow = fcs & 0xFF;
634 }
635 }
636 //get bit clock length
637 if (rfLen==0){
638 rfLen = detectFSKClk(BitStream, BitLen, fchigh, fclow);
639 if (rfLen == 0) rfLen = 50;
640 }
641 PrintAndLog("Args invert: %d - Clock:%d - fchigh:%d - fclow: %d",invert,rfLen,fchigh, fclow);
ba1a299c 642 int size = fskdemod(BitStream,BitLen,(uint8_t)rfLen,(uint8_t)invert,(uint8_t)fchigh,(uint8_t)fclow);
d5a72d2f 643 if (size>0){
644 PrintAndLog("FSK decoded bitstream:");
ec75f5c1 645 setDemodBuf(BitStream,size,0);
ba1a299c 646
d5a72d2f 647 // Now output the bitstream to the scrollback by line of 16 bits
648 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
649 printBitStream(BitStream,size);
650 } else{
651 PrintAndLog("no FSK data found");
eb191de6 652 }
b3b70669 653 return 0;
654}
655
eb191de6 656//by marshmellow (based on existing demod + holiman's refactor)
657//HID Prox demod - FSK RF/50 with preamble of 00011101 (then manchester encoded)
658//print full HID Prox ID and some bit format details if found
b3b70669 659int CmdFSKdemodHID(const char *Cmd)
660{
661 //raw fsk demod no manchester decoding no start bit finding just get binary from wave
b3b70669 662 uint32_t hi2=0, hi=0, lo=0;
ba1a299c 663
eb191de6 664 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
ba1a299c 665 size_t BitLen = getFromGraphBuf(BitStream);
b3b70669 666 //get binary from fsk wave
a1d17964 667 int idx = HIDdemodFSK(BitStream,&BitLen,&hi2,&hi,&lo);
ec75f5c1 668 if (idx<0){
a1d17964 669 if (g_debugMode){
670 if (idx==-1){
671 PrintAndLog("DEBUG: Just Noise Detected");
672 } else if (idx == -2) {
673 PrintAndLog("DEBUG: Error demoding fsk");
674 } else if (idx == -3) {
675 PrintAndLog("DEBUG: Preamble not found");
676 } else if (idx == -4) {
677 PrintAndLog("DEBUG: Error in Manchester data, SIZE: %d", BitLen);
678 } else {
679 PrintAndLog("DEBUG: Error demoding fsk %d", idx);
680 }
681 }
ec75f5c1 682 return 0;
683 }
684 if (hi2==0 && hi==0 && lo==0) {
685 if (g_debugMode) PrintAndLog("DEBUG: Error - no values found");
eb191de6 686 return 0;
687 }
688 if (hi2 != 0){ //extra large HID tags
ba1a299c 689 PrintAndLog("HID Prox TAG ID: %x%08x%08x (%d)",
eb191de6 690 (unsigned int) hi2, (unsigned int) hi, (unsigned int) lo, (unsigned int) (lo>>1) & 0xFFFF);
691 }
692 else { //standard HID tags <38 bits
d5a72d2f 693 uint8_t fmtLen = 0;
eb191de6 694 uint32_t fc = 0;
695 uint32_t cardnum = 0;
696 if (((hi>>5)&1)==1){//if bit 38 is set then < 37 bit format is used
697 uint32_t lo2=0;
84871873 698 lo2=(((hi & 31) << 12) | (lo>>20)); //get bits 21-37 to check for format len bit
eb191de6 699 uint8_t idx3 = 1;
700 while(lo2>1){ //find last bit set to 1 (format len bit)
701 lo2=lo2>>1;
702 idx3++;
b3b70669 703 }
ba1a299c 704 fmtLen =idx3+19;
eb191de6 705 fc =0;
706 cardnum=0;
d5a72d2f 707 if(fmtLen==26){
eb191de6 708 cardnum = (lo>>1)&0xFFFF;
709 fc = (lo>>17)&0xFF;
710 }
d5a72d2f 711 if(fmtLen==34){
eb191de6 712 cardnum = (lo>>1)&0xFFFF;
713 fc= ((hi&1)<<15)|(lo>>17);
714 }
d5a72d2f 715 if(fmtLen==35){
eb191de6 716 cardnum = (lo>>1)&0xFFFFF;
717 fc = ((hi&1)<<11)|(lo>>21);
b3b70669 718 }
b3b70669 719 }
eb191de6 720 else { //if bit 38 is not set then 37 bit format is used
84871873 721 fmtLen = 37;
722 fc = 0;
723 cardnum = 0;
724 if(fmtLen == 37){
eb191de6 725 cardnum = (lo>>1)&0x7FFFF;
726 fc = ((hi&0xF)<<12)|(lo>>20);
727 }
ba1a299c 728 }
729 PrintAndLog("HID Prox TAG ID: %x%08x (%d) - Format Len: %dbit - FC: %d - Card: %d",
eb191de6 730 (unsigned int) hi, (unsigned int) lo, (unsigned int) (lo>>1) & 0xFFFF,
d5a72d2f 731 (unsigned int) fmtLen, (unsigned int) fc, (unsigned int) cardnum);
b3b70669 732 }
ec75f5c1 733 setDemodBuf(BitStream,BitLen,idx);
734 if (g_debugMode){
735 PrintAndLog("DEBUG: idx: %d, Len: %d, Printing Demod Buffer:", idx, BitLen);
736 printDemodBuff();
737 }
738 return 1;
739}
740
04d2721b 741//by marshmellow
742//Paradox Prox demod - FSK RF/50 with preamble of 00001111 (then manchester encoded)
ec75f5c1 743//print full Paradox Prox ID and some bit format details if found
744int CmdFSKdemodParadox(const char *Cmd)
745{
746 //raw fsk demod no manchester decoding no start bit finding just get binary from wave
747 uint32_t hi2=0, hi=0, lo=0;
748
749 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
750 size_t BitLen = getFromGraphBuf(BitStream);
751 //get binary from fsk wave
a1d17964 752 int idx = ParadoxdemodFSK(BitStream,&BitLen,&hi2,&hi,&lo);
ec75f5c1 753 if (idx<0){
a1d17964 754 if (g_debugMode){
755 if (idx==-1){
756 PrintAndLog("DEBUG: Just Noise Detected");
757 } else if (idx == -2) {
758 PrintAndLog("DEBUG: Error demoding fsk");
759 } else if (idx == -3) {
760 PrintAndLog("DEBUG: Preamble not found");
761 } else if (idx == -4) {
762 PrintAndLog("DEBUG: Error in Manchester data");
763 } else {
764 PrintAndLog("DEBUG: Error demoding fsk %d", idx);
765 }
766 }
ec75f5c1 767 return 0;
768 }
769 if (hi2==0 && hi==0 && lo==0){
770 if (g_debugMode) PrintAndLog("DEBUG: Error - no value found");
771 return 0;
772 }
773 uint32_t fc = ((hi & 0x3)<<6) | (lo>>26);
774 uint32_t cardnum = (lo>>10)&0xFFFF;
775
776 PrintAndLog("Paradox TAG ID: %x%08x - FC: %d - Card: %d - Checksum: %02x",
777 hi>>10, (hi & 0x3)<<26 | (lo>>10), fc, cardnum, (lo>>2) & 0xFF );
778 setDemodBuf(BitStream,BitLen,idx);
779 if (g_debugMode){
780 PrintAndLog("DEBUG: idx: %d, len: %d, Printing Demod Buffer:", idx, BitLen);
781 printDemodBuff();
782 }
783 return 1;
b3b70669 784}
785
ec75f5c1 786
2fc2150e 787//by marshmellow
eb191de6 788//IO-Prox demod - FSK RF/64 with preamble of 000000001
789//print ioprox ID and some format details
b3b70669 790int CmdFSKdemodIO(const char *Cmd)
791{
792 //raw fsk demod no manchester decoding no start bit finding just get binary from wave
793 //set defaults
ba1a299c 794 int idx=0;
ec75f5c1 795 //something in graphbuffer?
796 if (GraphTraceLen < 65) {
797 if (g_debugMode)PrintAndLog("DEBUG: not enough samples in GraphBuffer");
798 return 0;
799 }
eb191de6 800 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
ba1a299c 801 size_t BitLen = getFromGraphBuf(BitStream);
ec75f5c1 802
eb191de6 803 //get binary from fsk wave
ba1a299c 804 idx = IOdemodFSK(BitStream,BitLen);
eb191de6 805 if (idx<0){
a1d17964 806 if (g_debugMode){
807 if (idx==-1){
808 PrintAndLog("DEBUG: Just Noise Detected");
809 } else if (idx == -2) {
810 PrintAndLog("DEBUG: not enough samples");
811 } else if (idx == -3) {
812 PrintAndLog("DEBUG: error during fskdemod");
813 } else if (idx == -4) {
814 PrintAndLog("DEBUG: Preamble not found");
815 } else if (idx == -5) {
816 PrintAndLog("DEBUG: Separator bits not found");
817 } else {
818 PrintAndLog("DEBUG: Error demoding fsk %d", idx);
819 }
820 }
eb191de6 821 return 0;
822 }
823 if (idx==0){
ec75f5c1 824 if (g_debugMode==1){
825 PrintAndLog("DEBUG: IO Prox Data not found - FSK Bits: %d",BitLen);
826 if (BitLen > 92) printBitStream(BitStream,92);
827 }
d5a72d2f 828 return 0;
b3b70669 829 }
b3b70669 830 //Index map
831 //0 10 20 30 40 50 60
832 //| | | | | | |
833 //01234567 8 90123456 7 89012345 6 78901234 5 67890123 4 56789012 3 45678901 23
834 //-----------------------------------------------------------------------------
835 //00000000 0 11110000 1 facility 1 version* 1 code*one 1 code*two 1 ???????? 11
836 //
837 //XSF(version)facility:codeone+codetwo (raw)
838 //Handle the data
ec75f5c1 839 if (idx+64>BitLen) {
840 if (g_debugMode==1) PrintAndLog("not enough bits found - bitlen: %d",BitLen);
841 return 0;
842 }
eb191de6 843 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]);
ba1a299c 844 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]);
f822a063 845 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]);
846 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]);
847 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]);
848 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]);
849 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]);
ba1a299c 850
eb191de6 851 uint32_t code = bytebits_to_byte(BitStream+idx,32);
ba1a299c 852 uint32_t code2 = bytebits_to_byte(BitStream+idx+32,32);
f822a063 853 uint8_t version = bytebits_to_byte(BitStream+idx+27,8); //14,4
854 uint8_t facilitycode = bytebits_to_byte(BitStream+idx+18,8) ;
eb191de6 855 uint16_t number = (bytebits_to_byte(BitStream+idx+36,8)<<8)|(bytebits_to_byte(BitStream+idx+45,8)); //36,9
ba1a299c 856 PrintAndLog("IO Prox XSF(%02d)%02x:%05d (%08x%08x)",version,facilitycode,number,code,code2);
ec75f5c1 857 setDemodBuf(BitStream,64,idx);
858 if (g_debugMode){
859 PrintAndLog("DEBUG: idx: %d, Len: %d, Printing demod buffer:",idx,64);
860 printDemodBuff();
861 }
862 return 1;
b3b70669 863}
1e090a61 864
865
866//by marshmellow
867//AWID Prox demod - FSK RF/50 with preamble of 00000001 (always a 96 bit data stream)
868//print full AWID Prox ID and some bit format details if found
869int CmdFSKdemodAWID(const char *Cmd)
870{
871
ec75f5c1 872 //int verbose=1;
873 //sscanf(Cmd, "%i", &verbose);
1e090a61 874
875 //raw fsk demod no manchester decoding no start bit finding just get binary from wave
876 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
877 size_t size = getFromGraphBuf(BitStream);
878
879 //get binary from fsk wave
a1d17964 880 int idx = AWIDdemodFSK(BitStream, &size);
1e090a61 881 if (idx<=0){
ec75f5c1 882 if (g_debugMode==1){
1e090a61 883 if (idx == -1)
ec75f5c1 884 PrintAndLog("DEBUG: Error - not enough samples");
1e090a61 885 else if (idx == -2)
a1d17964 886 PrintAndLog("DEBUG: Error - only noise found");
1e090a61 887 else if (idx == -3)
ec75f5c1 888 PrintAndLog("DEBUG: Error - problem during FSK demod");
1e090a61 889 // else if (idx == -3)
890 // PrintAndLog("Error: thought we had a tag but the parity failed");
891 else if (idx == -4)
ec75f5c1 892 PrintAndLog("DEBUG: Error - AWID preamble not found");
893 else if (idx == -5)
a1d17964 894 PrintAndLog("DEBUG: Error - Size not correct: %d", size);
ec75f5c1 895 else
896 PrintAndLog("DEBUG: Error %d",idx);
1e090a61 897 }
898 return 0;
899 }
900
901 // Index map
902 // 0 10 20 30 40 50 60
903 // | | | | | | |
904 // 01234567 890 1 234 5 678 9 012 3 456 7 890 1 234 5 678 9 012 3 456 7 890 1 234 5 678 9 012 3 - to 96
905 // -----------------------------------------------------------------------------
906 // 00000001 000 1 110 1 101 1 011 1 101 1 010 0 000 1 000 1 010 0 001 0 110 1 100 0 000 1 000 1
907 // premable bbb o bbb o bbw o fff o fff o ffc o ccc o ccc o ccc o ccc o ccc o wxx o xxx o xxx o - to 96
908 // |---26 bit---| |-----117----||-------------142-------------|
909 // b = format bit len, o = odd parity of last 3 bits
910 // f = facility code, c = card number
911 // w = wiegand parity
912 // (26 bit format shown)
913
914 //get raw ID before removing parities
915 uint32_t rawLo = bytebits_to_byte(BitStream+idx+64,32);
916 uint32_t rawHi = bytebits_to_byte(BitStream+idx+32,32);
917 uint32_t rawHi2 = bytebits_to_byte(BitStream+idx,32);
ec75f5c1 918 setDemodBuf(BitStream,96,idx);
919
1e090a61 920 size = removeParity(BitStream, idx+8, 4, 1, 88);
921 if (size != 66){
ec75f5c1 922 if (g_debugMode==1) PrintAndLog("DEBUG: Error - at parity check-tag size does not match AWID format");
1e090a61 923 return 0;
924 }
925 // ok valid card found!
926
927 // Index map
928 // 0 10 20 30 40 50 60
929 // | | | | | | |
930 // 01234567 8 90123456 7890123456789012 3 456789012345678901234567890123456
931 // -----------------------------------------------------------------------------
932 // 00011010 1 01110101 0000000010001110 1 000000000000000000000000000000000
933 // bbbbbbbb w ffffffff cccccccccccccccc w xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
934 // |26 bit| |-117--| |-----142------|
935 // b = format bit len, o = odd parity of last 3 bits
936 // f = facility code, c = card number
937 // w = wiegand parity
938 // (26 bit format shown)
939
940 uint32_t fc = 0;
941 uint32_t cardnum = 0;
942 uint32_t code1 = 0;
943 uint32_t code2 = 0;
944 uint8_t fmtLen = bytebits_to_byte(BitStream,8);
945 if (fmtLen==26){
946 fc = bytebits_to_byte(BitStream+9, 8);
947 cardnum = bytebits_to_byte(BitStream+17, 16);
948 code1 = bytebits_to_byte(BitStream+8,fmtLen);
949 PrintAndLog("AWID Found - BitLength: %d, FC: %d, Card: %d - Wiegand: %x, Raw: %x%08x%08x", fmtLen, fc, cardnum, code1, rawHi2, rawHi, rawLo);
950 } else {
951 cardnum = bytebits_to_byte(BitStream+8+(fmtLen-17), 16);
952 if (fmtLen>32){
953 code1 = bytebits_to_byte(BitStream+8,fmtLen-32);
954 code2 = bytebits_to_byte(BitStream+8+(fmtLen-32),32);
955 PrintAndLog("AWID Found - BitLength: %d -unknown BitLength- (%d) - Wiegand: %x%08x, Raw: %x%08x%08x", fmtLen, cardnum, code1, code2, rawHi2, rawHi, rawLo);
956 } else{
957 code1 = bytebits_to_byte(BitStream+8,fmtLen);
958 PrintAndLog("AWID Found - BitLength: %d -unknown BitLength- (%d) - Wiegand: %x, Raw: %x%08x%08x", fmtLen, cardnum, code1, rawHi2, rawHi, rawLo);
959 }
960 }
ec75f5c1 961 if (g_debugMode){
962 PrintAndLog("DEBUG: idx: %d, Len: %d Printing Demod Buffer:", idx, 96);
963 printDemodBuff();
964 }
1e090a61 965 //todo - convert hi2, hi, lo to demodbuffer for future sim/clone commands
1e090a61 966 return 1;
967}
968
969//by marshmellow
970//Pyramid Prox demod - FSK RF/50 with preamble of 0000000000000001 (always a 128 bit data stream)
971//print full Farpointe Data/Pyramid Prox ID and some bit format details if found
972int CmdFSKdemodPyramid(const char *Cmd)
973{
1e090a61 974 //raw fsk demod no manchester decoding no start bit finding just get binary from wave
975 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
976 size_t size = getFromGraphBuf(BitStream);
977
978 //get binary from fsk wave
a1d17964 979 int idx = PyramiddemodFSK(BitStream, &size);
1e090a61 980 if (idx < 0){
ec75f5c1 981 if (g_debugMode==1){
1e090a61 982 if (idx == -5)
ec75f5c1 983 PrintAndLog("DEBUG: Error - not enough samples");
1e090a61 984 else if (idx == -1)
a1d17964 985 PrintAndLog("DEBUG: Error - only noise found");
1e090a61 986 else if (idx == -2)
ec75f5c1 987 PrintAndLog("DEBUG: Error - problem during FSK demod");
988 else if (idx == -3)
a1d17964 989 PrintAndLog("DEBUG: Error - Size not correct: %d", size);
1e090a61 990 else if (idx == -4)
ec75f5c1 991 PrintAndLog("DEBUG: Error - Pyramid preamble not found");
992 else
993 PrintAndLog("DEBUG: Error - idx: %d",idx);
1e090a61 994 }
1e090a61 995 return 0;
996 }
1e090a61 997 // Index map
998 // 0 10 20 30 40 50 60
999 // | | | | | | |
1000 // 0123456 7 8901234 5 6789012 3 4567890 1 2345678 9 0123456 7 8901234 5 6789012 3
1001 // -----------------------------------------------------------------------------
1002 // 0000000 0 0000000 1 0000000 1 0000000 1 0000000 1 0000000 1 0000000 1 0000000 1
1003 // premable xxxxxxx o xxxxxxx o xxxxxxx o xxxxxxx o xxxxxxx o xxxxxxx o xxxxxxx o
1004
1005 // 64 70 80 90 100 110 120
1006 // | | | | | | |
1007 // 4567890 1 2345678 9 0123456 7 8901234 5 6789012 3 4567890 1 2345678 9 0123456 7
1008 // -----------------------------------------------------------------------------
1009 // 0000000 1 0000000 1 0000000 1 0110111 0 0011000 1 0000001 0 0001100 1 1001010 0
1010 // xxxxxxx o xxxxxxx o xxxxxxx o xswffff o ffffccc o ccccccc o ccccccw o ppppppp o
1011 // |---115---||---------71---------|
1012 // s = format start bit, o = odd parity of last 7 bits
1013 // f = facility code, c = card number
1014 // w = wiegand parity, x = extra space for other formats
1015 // p = unknown checksum
1016 // (26 bit format shown)
1017
1018 //get raw ID before removing parities
1019 uint32_t rawLo = bytebits_to_byte(BitStream+idx+96,32);
1020 uint32_t rawHi = bytebits_to_byte(BitStream+idx+64,32);
1021 uint32_t rawHi2 = bytebits_to_byte(BitStream+idx+32,32);
1022 uint32_t rawHi3 = bytebits_to_byte(BitStream+idx,32);
ec75f5c1 1023 setDemodBuf(BitStream,128,idx);
1024
1e090a61 1025 size = removeParity(BitStream, idx+8, 8, 1, 120);
1026 if (size != 105){
ec75f5c1 1027 if (g_debugMode==1) PrintAndLog("DEBUG: Error at parity check-tag size does not match Pyramid format, SIZE: %d, IDX: %d, hi3: %x",size, idx, rawHi3);
1e090a61 1028 return 0;
1029 }
1030
1031 // ok valid card found!
1032
1033 // Index map
1034 // 0 10 20 30 40 50 60 70
1035 // | | | | | | | |
1036 // 01234567890123456789012345678901234567890123456789012345678901234567890
1037 // -----------------------------------------------------------------------
1038 // 00000000000000000000000000000000000000000000000000000000000000000000000
1039 // xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
1040
1041 // 71 80 90 100
1042 // | | | |
1043 // 1 2 34567890 1234567890123456 7 8901234
1044 // ---------------------------------------
1045 // 1 1 01110011 0000000001000110 0 1001010
1046 // s w ffffffff cccccccccccccccc w ppppppp
1047 // |--115-| |------71------|
1048 // s = format start bit, o = odd parity of last 7 bits
1049 // f = facility code, c = card number
1050 // w = wiegand parity, x = extra space for other formats
1051 // p = unknown checksum
1052 // (26 bit format shown)
1053
1054 //find start bit to get fmtLen
1e090a61 1055 int j;
1056 for (j=0; j<size; j++){
ec75f5c1 1057 if(BitStream[j]) break;
1e090a61 1058 }
1059 uint8_t fmtLen = size-j-8;
1060 uint32_t fc = 0;
1061 uint32_t cardnum = 0;
1062 uint32_t code1 = 0;
1063 //uint32_t code2 = 0;
1064 if (fmtLen==26){
1065 fc = bytebits_to_byte(BitStream+73, 8);
1066 cardnum = bytebits_to_byte(BitStream+81, 16);
1067 code1 = bytebits_to_byte(BitStream+72,fmtLen);
ec75f5c1 1068 PrintAndLog("Pyramid ID Found - BitLength: %d, FC: %d, Card: %d - Wiegand: %x, Raw: %x%08x%08x%08x", fmtLen, fc, cardnum, code1, rawHi3, rawHi2, rawHi, rawLo);
1e090a61 1069 } else if (fmtLen==45){
1070 fmtLen=42; //end = 10 bits not 7 like 26 bit fmt
1071 fc = bytebits_to_byte(BitStream+53, 10);
1072 cardnum = bytebits_to_byte(BitStream+63, 32);
ec75f5c1 1073 PrintAndLog("Pyramid ID Found - BitLength: %d, FC: %d, Card: %d - Raw: %x%08x%08x%08x", fmtLen, fc, cardnum, rawHi3, rawHi2, rawHi, rawLo);
1e090a61 1074 } else {
1075 cardnum = bytebits_to_byte(BitStream+81, 16);
1076 if (fmtLen>32){
1077 //code1 = bytebits_to_byte(BitStream+(size-fmtLen),fmtLen-32);
1078 //code2 = bytebits_to_byte(BitStream+(size-32),32);
ec75f5c1 1079 PrintAndLog("Pyramid ID Found - BitLength: %d -unknown BitLength- (%d), Raw: %x%08x%08x%08x", fmtLen, cardnum, rawHi3, rawHi2, rawHi, rawLo);
1e090a61 1080 } else{
1081 //code1 = bytebits_to_byte(BitStream+(size-fmtLen),fmtLen);
ec75f5c1 1082 PrintAndLog("Pyramid ID Found - BitLength: %d -unknown BitLength- (%d), Raw: %x%08x%08x%08x", fmtLen, cardnum, rawHi3, rawHi2, rawHi, rawLo);
1e090a61 1083 }
1084 }
ec75f5c1 1085 if (g_debugMode){
1086 PrintAndLog("DEBUG: idx: %d, Len: %d, Printing Demod Buffer:", idx, 128);
1087 printDemodBuff();
1088 }
1e090a61 1089 return 1;
1090}
1091
e888ed8e 1092int CmdFSKdemod(const char *Cmd) //old CmdFSKdemod needs updating
7fe9b0b7 1093{
1094 static const int LowTone[] = {
1095 1, 1, 1, 1, 1, -1, -1, -1, -1, -1,
1096 1, 1, 1, 1, 1, -1, -1, -1, -1, -1,
1097 1, 1, 1, 1, 1, -1, -1, -1, -1, -1,
1098 1, 1, 1, 1, 1, -1, -1, -1, -1, -1,
1099 1, 1, 1, 1, 1, -1, -1, -1, -1, -1
1100 };
1101 static const int HighTone[] = {
1102 1, 1, 1, 1, 1, -1, -1, -1, -1,
1103 1, 1, 1, 1, -1, -1, -1, -1,
1104 1, 1, 1, 1, -1, -1, -1, -1,
1105 1, 1, 1, 1, -1, -1, -1, -1,
1106 1, 1, 1, 1, -1, -1, -1, -1,
1107 1, 1, 1, 1, -1, -1, -1, -1, -1,
1108 };
1109
1110 int lowLen = sizeof (LowTone) / sizeof (int);
1111 int highLen = sizeof (HighTone) / sizeof (int);
b915fda3 1112 int convLen = (highLen > lowLen) ? highLen : lowLen;
7fe9b0b7 1113 uint32_t hi = 0, lo = 0;
1114
1115 int i, j;
1116 int minMark = 0, maxMark = 0;
952a8bb5 1117
7fe9b0b7 1118 for (i = 0; i < GraphTraceLen - convLen; ++i) {
1119 int lowSum = 0, highSum = 0;
1120
1121 for (j = 0; j < lowLen; ++j) {
1122 lowSum += LowTone[j]*GraphBuffer[i+j];
1123 }
1124 for (j = 0; j < highLen; ++j) {
1125 highSum += HighTone[j] * GraphBuffer[i + j];
1126 }
1127 lowSum = abs(100 * lowSum / lowLen);
1128 highSum = abs(100 * highSum / highLen);
1129 GraphBuffer[i] = (highSum << 16) | lowSum;
1130 }
1131
1132 for(i = 0; i < GraphTraceLen - convLen - 16; ++i) {
1133 int lowTot = 0, highTot = 0;
1134 // 10 and 8 are f_s divided by f_l and f_h, rounded
1135 for (j = 0; j < 10; ++j) {
1136 lowTot += (GraphBuffer[i+j] & 0xffff);
1137 }
1138 for (j = 0; j < 8; j++) {
1139 highTot += (GraphBuffer[i + j] >> 16);
1140 }
1141 GraphBuffer[i] = lowTot - highTot;
1142 if (GraphBuffer[i] > maxMark) maxMark = GraphBuffer[i];
1143 if (GraphBuffer[i] < minMark) minMark = GraphBuffer[i];
1144 }
1145
1146 GraphTraceLen -= (convLen + 16);
1147 RepaintGraphWindow();
1148
b3b70669 1149 // Find bit-sync (3 lo followed by 3 high) (HID ONLY)
7fe9b0b7 1150 int max = 0, maxPos = 0;
1151 for (i = 0; i < 6000; ++i) {
1152 int dec = 0;
1153 for (j = 0; j < 3 * lowLen; ++j) {
1154 dec -= GraphBuffer[i + j];
1155 }
1156 for (; j < 3 * (lowLen + highLen ); ++j) {
1157 dec += GraphBuffer[i + j];
1158 }
1159 if (dec > max) {
1160 max = dec;
1161 maxPos = i;
1162 }
1163 }
1164
1165 // place start of bit sync marker in graph
1166 GraphBuffer[maxPos] = maxMark;
1167 GraphBuffer[maxPos + 1] = minMark;
1168
1169 maxPos += j;
1170
1171 // place end of bit sync marker in graph
1172 GraphBuffer[maxPos] = maxMark;
1173 GraphBuffer[maxPos+1] = minMark;
1174
1175 PrintAndLog("actual data bits start at sample %d", maxPos);
1176 PrintAndLog("length %d/%d", highLen, lowLen);
ba1a299c 1177
a1557c4c 1178 uint8_t bits[46] = {0x00};
ba1a299c 1179
7fe9b0b7 1180 // find bit pairs and manchester decode them
1181 for (i = 0; i < arraylen(bits) - 1; ++i) {
1182 int dec = 0;
1183 for (j = 0; j < lowLen; ++j) {
1184 dec -= GraphBuffer[maxPos + j];
1185 }
1186 for (; j < lowLen + highLen; ++j) {
1187 dec += GraphBuffer[maxPos + j];
1188 }
1189 maxPos += j;
1190 // place inter bit marker in graph
1191 GraphBuffer[maxPos] = maxMark;
1192 GraphBuffer[maxPos + 1] = minMark;
1193
1194 // hi and lo form a 64 bit pair
1195 hi = (hi << 1) | (lo >> 31);
1196 lo = (lo << 1);
1197 // store decoded bit as binary (in hi/lo) and text (in bits[])
1198 if(dec < 0) {
1199 bits[i] = '1';
1200 lo |= 1;
1201 } else {
1202 bits[i] = '0';
1203 }
1204 }
1205 PrintAndLog("bits: '%s'", bits);
1206 PrintAndLog("hex: %08x %08x", hi, lo);
1207 return 0;
1208}
e888ed8e 1209
ec75f5c1 1210//by marshmellow
1211//attempt to detect the field clock and bit clock for FSK
1e090a61 1212int CmdFSKfcDetect(const char *Cmd)
1213{
1214 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
1215 size_t size = getFromGraphBuf(BitStream);
1216
03e6bb4a 1217 uint16_t ans = countFC(BitStream, size);
1218 if (ans==0) {
1219 if (g_debugMode) PrintAndLog("DEBUG: No data found");
1220 return 0;
1221 }
1222 uint8_t fc1, fc2;
1e090a61 1223 fc1 = (ans >> 8) & 0xFF;
1224 fc2 = ans & 0xFF;
03e6bb4a 1225
1226 uint8_t rf1 = detectFSKClk(BitStream, size, fc1, fc2);
1227 if (rf1==0) {
1228 if (g_debugMode) PrintAndLog("DEBUG: Clock detect error");
1229 return 0;
1230 }
1e090a61 1231 PrintAndLog("Detected Field Clocks: FC/%d, FC/%d - Bit Clock: RF/%d", fc1, fc2, rf1);
1232 return 1;
1233}
1234
8c65b650 1235//by marshmellow
1236//attempt to detect the bit clock for PSK or NRZ modulations
4118b74d 1237int CmdDetectNRZpskClockRate(const char *Cmd)
1238{
ba1a299c 1239 GetNRZpskClock("",0,0);
1240 return 0;
4118b74d 1241}
1242
8c65b650 1243//by marshmellow
1244//attempt to psk1 or nrz demod graph buffer
1245//NOTE CURRENTLY RELIES ON PEAKS :(
04d2721b 1246int PSKnrzDemod(const char *Cmd, uint8_t verbose)
ec75f5c1 1247{
ba1a299c 1248 int invert=0;
1249 int clk=0;
1250 sscanf(Cmd, "%i %i", &clk, &invert);
1251 if (invert != 0 && invert != 1) {
1252 PrintAndLog("Invalid argument: %s", Cmd);
1253 return -1;
1254 }
1255 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
1256 size_t BitLen = getFromGraphBuf(BitStream);
1257 int errCnt=0;
1258 errCnt = pskNRZrawDemod(BitStream, &BitLen,&clk,&invert);
1259 if (errCnt<0|| BitLen<16){ //throw away static - allow 1 and -1 (in case of threshold command first)
ec75f5c1 1260 if (g_debugMode==1) PrintAndLog("no data found, clk: %d, invert: %d, numbits: %d, errCnt: %d",clk,invert,BitLen,errCnt);
ba1a299c 1261 return -1;
1262 }
04d2721b 1263 if (verbose) PrintAndLog("Tried PSK/NRZ Demod using Clock: %d - invert: %d - Bits Found: %d",clk,invert,BitLen);
ba1a299c 1264
1265 //prime demod buffer for output
ec75f5c1 1266 setDemodBuf(BitStream,BitLen,0);
ba1a299c 1267 return errCnt;
4118b74d 1268}
1269// Indala 26 bit decode
1270// by marshmellow
1271// optional arguments - same as CmdpskNRZrawDemod (clock & invert)
1272int CmdIndalaDecode(const char *Cmd)
1273{
84871873 1274 int ans;
1275 if (strlen(Cmd)>0){
04d2721b 1276 ans = PSKnrzDemod(Cmd, 0);
84871873 1277 } else{ //default to RF/32
04d2721b 1278 ans = PSKnrzDemod("32", 0);
84871873 1279 }
4118b74d 1280
ba1a299c 1281 if (ans < 0){
ec75f5c1 1282 if (g_debugMode==1)
84871873 1283 PrintAndLog("Error1: %d",ans);
ba1a299c 1284 return 0;
1285 }
1286 uint8_t invert=0;
1287 ans = indala26decode(DemodBuffer,(size_t *) &DemodBufferLen, &invert);
1288 if (ans < 1) {
ec75f5c1 1289 if (g_debugMode==1)
84871873 1290 PrintAndLog("Error2: %d",ans);
ba1a299c 1291 return -1;
1292 }
a1d17964 1293 char showbits[251]={0x00};
84871873 1294 if (invert)
ec75f5c1 1295 if (g_debugMode==1)
84871873 1296 PrintAndLog("Had to invert bits");
ec75f5c1 1297
ba1a299c 1298 //convert UID to HEX
1299 uint32_t uid1, uid2, uid3, uid4, uid5, uid6, uid7;
1300 int idx;
1301 uid1=0;
1302 uid2=0;
1303 PrintAndLog("BitLen: %d",DemodBufferLen);
1304 if (DemodBufferLen==64){
1305 for( idx=0; idx<64; idx++) {
1306 uid1=(uid1<<1)|(uid2>>31);
1307 if (DemodBuffer[idx] == 0) {
1308 uid2=(uid2<<1)|0;
1309 showbits[idx]='0';
1310 } else {
1311 uid2=(uid2<<1)|1;
1312 showbits[idx]='1';
1313 }
1314 }
1315 showbits[idx]='\0';
1316 PrintAndLog("Indala UID=%s (%x%08x)", showbits, uid1, uid2);
1317 }
1318 else {
1319 uid3=0;
1320 uid4=0;
1321 uid5=0;
1322 uid6=0;
1323 uid7=0;
1324 for( idx=0; idx<DemodBufferLen; idx++) {
1325 uid1=(uid1<<1)|(uid2>>31);
1326 uid2=(uid2<<1)|(uid3>>31);
1327 uid3=(uid3<<1)|(uid4>>31);
1328 uid4=(uid4<<1)|(uid5>>31);
1329 uid5=(uid5<<1)|(uid6>>31);
1330 uid6=(uid6<<1)|(uid7>>31);
1331 if (DemodBuffer[idx] == 0) {
1332 uid7=(uid7<<1)|0;
1333 showbits[idx]='0';
1334 }
1335 else {
1336 uid7=(uid7<<1)|1;
1337 showbits[idx]='1';
1338 }
1339 }
1340 showbits[idx]='\0';
1341 PrintAndLog("Indala UID=%s (%x%08x%08x%08x%08x%08x%08x)", showbits, uid1, uid2, uid3, uid4, uid5, uid6, uid7);
1342 }
a1d17964 1343 if (g_debugMode){
1344 PrintAndLog("DEBUG: printing demodbuffer:");
1345 printDemodBuff();
1346 }
ba1a299c 1347 return 1;
4118b74d 1348}
1349
8c65b650 1350//by marshmellow
1351//attempt to clean psk wave noise after a peak
1352//NOTE RELIES ON PEAKS :(
4118b74d 1353int CmdPskClean(const char *Cmd)
1354{
ba1a299c 1355 uint8_t bitStream[MAX_GRAPH_TRACE_LEN]={0};
1356 size_t bitLen = getFromGraphBuf(bitStream);
1357 pskCleanWave(bitStream, bitLen);
1358 setGraphBuf(bitStream, bitLen);
1359 return 0;
4118b74d 1360}
1361
04d2721b 1362// by marshmellow
1363// takes 2 arguments - clock and invert both as integers
1364// attempts to demodulate psk only
1365// prints binary found and saves in demodbuffer for further commands
4118b74d 1366int CmdpskNRZrawDemod(const char *Cmd)
1367{
84871873 1368 int errCnt;
ec75f5c1 1369
04d2721b 1370 errCnt = PSKnrzDemod(Cmd, 1);
ba1a299c 1371 //output
ec75f5c1 1372 if (errCnt<0){
1373 if (g_debugMode) PrintAndLog("Error demoding: %d",errCnt);
1374 return 0;
1375 }
ba1a299c 1376 if (errCnt>0){
ec75f5c1 1377 if (g_debugMode){
84871873 1378 PrintAndLog("# Errors during Demoding (shown as 77 in bit stream): %d",errCnt);
ec75f5c1 1379 PrintAndLog("PSK or NRZ demoded bitstream:");
1380 // Now output the bitstream to the scrollback by line of 16 bits
1381 printDemodBuff();
1382 }
1383 }else{
1384 PrintAndLog("PSK or NRZ demoded bitstream:");
1385 // Now output the bitstream to the scrollback by line of 16 bits
1386 printDemodBuff();
1387 return 1;
1388 }
1389 return 0;
4118b74d 1390}
1391
04d2721b 1392// by marshmellow
1393// takes same args as cmdpsknrzrawdemod
1394int CmdPSK2rawDemod(const char *Cmd)
1395{
1396 int errCnt=0;
1397 errCnt=PSKnrzDemod(Cmd, 1);
1398 if (errCnt<0){
1399 if (g_debugMode) PrintAndLog("Error demoding: %d",errCnt);
1400 return 0;
1401 }
1402 psk1TOpsk2(DemodBuffer, DemodBufferLen);
1403 if (errCnt>0){
1404 if (g_debugMode){
1405 PrintAndLog("# Errors during Demoding (shown as 77 in bit stream): %d",errCnt);
1406 PrintAndLog("PSK2 demoded bitstream:");
1407 // Now output the bitstream to the scrollback by line of 16 bits
1408 printDemodBuff();
1409 }
1410 }else{
1411 PrintAndLog("PSK2 demoded bitstream:");
1412 // Now output the bitstream to the scrollback by line of 16 bits
1413 printDemodBuff();
1414 }
1415 return 1;
1416}
1417
7fe9b0b7 1418int CmdGrid(const char *Cmd)
1419{
1420 sscanf(Cmd, "%i %i", &PlotGridX, &PlotGridY);
7ddb9900 1421 PlotGridXdefault= PlotGridX;
1422 PlotGridYdefault= PlotGridY;
7fe9b0b7 1423 RepaintGraphWindow();
1424 return 0;
1425}
1426
1427int CmdHexsamples(const char *Cmd)
1428{
4961e292 1429 int i, j;
7fe9b0b7 1430 int requested = 0;
1431 int offset = 0;
4961e292 1432 char string_buf[25];
1433 char* string_ptr = string_buf;
f71f4deb 1434 uint8_t got[BIGBUF_SIZE];
952a8bb5 1435
4961e292 1436 sscanf(Cmd, "%i %i", &requested, &offset);
90d74dc2 1437
4961e292 1438 /* if no args send something */
1439 if (requested == 0) {
90d74dc2 1440 requested = 8;
1441 }
90d74dc2 1442 if (offset + requested > sizeof(got)) {
f71f4deb 1443 PrintAndLog("Tried to read past end of buffer, <bytes> + <offset> > %d", BIGBUF_SIZE);
4961e292 1444 return 0;
952a8bb5 1445 }
90d74dc2 1446
4961e292 1447 GetFromBigBuf(got,requested,offset);
90d74dc2 1448 WaitForResponse(CMD_ACK,NULL);
1449
4961e292 1450 i = 0;
1451 for (j = 0; j < requested; j++) {
1452 i++;
1453 string_ptr += sprintf(string_ptr, "%02x ", got[j]);
1454 if (i == 8) {
1455 *(string_ptr - 1) = '\0'; // remove the trailing space
1456 PrintAndLog("%s", string_buf);
1457 string_buf[0] = '\0';
1458 string_ptr = string_buf;
1459 i = 0;
1460 }
1461 if (j == requested - 1 && string_buf[0] != '\0') { // print any remaining bytes
1462 *(string_ptr - 1) = '\0';
1463 PrintAndLog("%s", string_buf);
1464 string_buf[0] = '\0';
7fe9b0b7 1465 }
ba1a299c 1466 }
7fe9b0b7 1467 return 0;
1468}
1469
7fe9b0b7 1470int CmdHide(const char *Cmd)
1471{
1472 HideGraphWindow();
1473 return 0;
1474}
1475
1476int CmdHpf(const char *Cmd)
1477{
1478 int i;
1479 int accum = 0;
1480
1481 for (i = 10; i < GraphTraceLen; ++i)
1482 accum += GraphBuffer[i];
1483 accum /= (GraphTraceLen - 10);
1484 for (i = 0; i < GraphTraceLen; ++i)
1485 GraphBuffer[i] -= accum;
1486
1487 RepaintGraphWindow();
1488 return 0;
1489}
1490
8d183c53 1491int CmdSamples(const char *Cmd)
7fe9b0b7 1492{
f71f4deb 1493 uint8_t got[BIGBUF_SIZE] = {0x00};
ba1a299c 1494
d6d20c54 1495 int n = strtol(Cmd, NULL, 0);
1496 if (n == 0)
1497 n = 20000;
1498
1499 if (n > sizeof(got))
1500 n = sizeof(got);
ba1a299c 1501
d6d20c54 1502 PrintAndLog("Reading %d samples from device memory\n", n);
f71f4deb 1503 GetFromBigBuf(got,n,0);
1504 WaitForResponse(CMD_ACK,NULL);
ba1a299c 1505 for (int j = 0; j < n; j++) {
d6d20c54 1506 GraphBuffer[j] = ((int)got[j]) - 128;
f71f4deb 1507 }
1508 GraphTraceLen = n;
1509 RepaintGraphWindow();
1510 return 0;
7fe9b0b7 1511}
1512
d6a120a2
MHS
1513int CmdTuneSamples(const char *Cmd)
1514{
3aa4014b 1515 int timeout = 0;
1516 printf("\nMeasuring antenna characteristics, please wait...");
ba1a299c 1517
3aa4014b 1518 UsbCommand c = {CMD_MEASURE_ANTENNA_TUNING};
1519 SendCommand(&c);
1520
1521 UsbCommand resp;
1522 while(!WaitForResponseTimeout(CMD_MEASURED_ANTENNA_TUNING,&resp,1000)) {
1523 timeout++;
1524 printf(".");
1525 if (timeout > 7) {
1526 PrintAndLog("\nNo response from Proxmark. Aborting...");
1527 return 1;
1528 }
1529 }
1530
1531 int peakv, peakf;
1532 int vLf125, vLf134, vHf;
1533 vLf125 = resp.arg[0] & 0xffff;
1534 vLf134 = resp.arg[0] >> 16;
1535 vHf = resp.arg[1] & 0xffff;;
1536 peakf = resp.arg[2] & 0xffff;
1537 peakv = resp.arg[2] >> 16;
1538 PrintAndLog("");
1539 PrintAndLog("# LF antenna: %5.2f V @ 125.00 kHz", vLf125/1000.0);
1540 PrintAndLog("# LF antenna: %5.2f V @ 134.00 kHz", vLf134/1000.0);
1541 PrintAndLog("# LF optimal: %5.2f V @%9.2f kHz", peakv/1000.0, 12000.0/(peakf+1));
1542 PrintAndLog("# HF antenna: %5.2f V @ 13.56 MHz", vHf/1000.0);
1543 if (peakv<2000)
1544 PrintAndLog("# Your LF antenna is unusable.");
1545 else if (peakv<10000)
1546 PrintAndLog("# Your LF antenna is marginal.");
1547 if (vHf<2000)
1548 PrintAndLog("# Your HF antenna is unusable.");
1549 else if (vHf<5000)
1550 PrintAndLog("# Your HF antenna is marginal.");
1551
1552 for (int i = 0; i < 256; i++) {
1553 GraphBuffer[i] = resp.d.asBytes[i] - 128;
ba1a299c 1554 }
1555
d5a72d2f 1556 PrintAndLog("Done! Divisor 89 is 134khz, 95 is 125khz.\n");
1557 PrintAndLog("\n");
3aa4014b 1558 GraphTraceLen = 256;
1559 ShowGraphWindow();
1560
1561 return 0;
d6a120a2
MHS
1562}
1563
3aa4014b 1564
7fe9b0b7 1565int CmdLoad(const char *Cmd)
1566{
ec75f5c1 1567 char filename[FILE_PATH_SIZE] = {0x00};
1568 int len = 0;
b915fda3 1569
ec75f5c1 1570 len = strlen(Cmd);
1571 if (len > FILE_PATH_SIZE) len = FILE_PATH_SIZE;
1572 memcpy(filename, Cmd, len);
b915fda3 1573
ec75f5c1 1574 FILE *f = fopen(filename, "r");
7fe9b0b7 1575 if (!f) {
b915fda3 1576 PrintAndLog("couldn't open '%s'", filename);
7fe9b0b7 1577 return 0;
1578 }
1579
1580 GraphTraceLen = 0;
1581 char line[80];
1582 while (fgets(line, sizeof (line), f)) {
1583 GraphBuffer[GraphTraceLen] = atoi(line);
1584 GraphTraceLen++;
1585 }
1586 fclose(f);
1587 PrintAndLog("loaded %d samples", GraphTraceLen);
1588 RepaintGraphWindow();
1589 return 0;
1590}
1591
1592int CmdLtrim(const char *Cmd)
1593{
1594 int ds = atoi(Cmd);
1595
1596 for (int i = ds; i < GraphTraceLen; ++i)
1597 GraphBuffer[i-ds] = GraphBuffer[i];
1598 GraphTraceLen -= ds;
1599
1600 RepaintGraphWindow();
1601 return 0;
1602}
ec75f5c1 1603
1604// trim graph to input argument length
9ec1416a 1605int CmdRtrim(const char *Cmd)
1606{
1607 int ds = atoi(Cmd);
1608
1609 GraphTraceLen = ds;
1610
1611 RepaintGraphWindow();
1612 return 0;
1613}
7fe9b0b7 1614
1615/*
1616 * Manchester demodulate a bitstream. The bitstream needs to be already in
1617 * the GraphBuffer as 0 and 1 values
1618 *
1619 * Give the clock rate as argument in order to help the sync - the algorithm
1620 * resyncs at each pulse anyway.
1621 *
1622 * Not optimized by any means, this is the 1st time I'm writing this type of
1623 * routine, feel free to improve...
1624 *
1625 * 1st argument: clock rate (as number of samples per clock rate)
1626 * Typical values can be 64, 32, 128...
1627 */
1628int CmdManchesterDemod(const char *Cmd)
1629{
1630 int i, j, invert= 0;
1631 int bit;
1632 int clock;
fddf220a 1633 int lastval = 0;
7fe9b0b7 1634 int low = 0;
1635 int high = 0;
1636 int hithigh, hitlow, first;
1637 int lc = 0;
1638 int bitidx = 0;
1639 int bit2idx = 0;
1640 int warnings = 0;
1641
1642 /* check if we're inverting output */
c6f1fb9d 1643 if (*Cmd == 'i')
7fe9b0b7 1644 {
1645 PrintAndLog("Inverting output");
1646 invert = 1;
fffad860 1647 ++Cmd;
7fe9b0b7 1648 do
1649 ++Cmd;
1650 while(*Cmd == ' '); // in case a 2nd argument was given
1651 }
1652
1653 /* Holds the decoded bitstream: each clock period contains 2 bits */
1654 /* later simplified to 1 bit after manchester decoding. */
1655 /* Add 10 bits to allow for noisy / uncertain traces without aborting */
1656 /* int BitStream[GraphTraceLen*2/clock+10]; */
1657
1658 /* But it does not work if compiling on WIndows: therefore we just allocate a */
1659 /* large array */
90e278d3 1660 uint8_t BitStream[MAX_GRAPH_TRACE_LEN] = {0};
7fe9b0b7 1661
1662 /* Detect high and lows */
1663 for (i = 0; i < GraphTraceLen; i++)
1664 {
1665 if (GraphBuffer[i] > high)
1666 high = GraphBuffer[i];
1667 else if (GraphBuffer[i] < low)
1668 low = GraphBuffer[i];
1669 }
1670
1671 /* Get our clock */
1672 clock = GetClock(Cmd, high, 1);
1673
1674 int tolerance = clock/4;
1675
1676 /* Detect first transition */
1677 /* Lo-Hi (arbitrary) */
1678 /* skip to the first high */
1679 for (i= 0; i < GraphTraceLen; i++)
1680 if (GraphBuffer[i] == high)
1681 break;
1682 /* now look for the first low */
1683 for (; i < GraphTraceLen; i++)
1684 {
1685 if (GraphBuffer[i] == low)
1686 {
1687 lastval = i;
1688 break;
1689 }
1690 }
1691
1692 /* If we're not working with 1/0s, demod based off clock */
1693 if (high != 1)
1694 {
1695 bit = 0; /* We assume the 1st bit is zero, it may not be
1696 * the case: this routine (I think) has an init problem.
1697 * Ed.
1698 */
1699 for (; i < (int)(GraphTraceLen / clock); i++)
1700 {
1701 hithigh = 0;
1702 hitlow = 0;
1703 first = 1;
1704
1705 /* Find out if we hit both high and low peaks */
1706 for (j = 0; j < clock; j++)
1707 {
1708 if (GraphBuffer[(i * clock) + j] == high)
1709 hithigh = 1;
1710 else if (GraphBuffer[(i * clock) + j] == low)
1711 hitlow = 1;
1712
1713 /* it doesn't count if it's the first part of our read
1714 because it's really just trailing from the last sequence */
1715 if (first && (hithigh || hitlow))
1716 hithigh = hitlow = 0;
1717 else
1718 first = 0;
1719
1720 if (hithigh && hitlow)
1721 break;
1722 }
1723
1724 /* If we didn't hit both high and low peaks, we had a bit transition */
1725 if (!hithigh || !hitlow)
1726 bit ^= 1;
1727
1728 BitStream[bit2idx++] = bit ^ invert;
1729 }
1730 }
1731
1732 /* standard 1/0 bitstream */
1733 else
1734 {
1735
1736 /* Then detect duration between 2 successive transitions */
1737 for (bitidx = 1; i < GraphTraceLen; i++)
1738 {
1739 if (GraphBuffer[i-1] != GraphBuffer[i])
1740 {
b3b70669 1741 lc = i-lastval;
1742 lastval = i;
1743
1744 // Error check: if bitidx becomes too large, we do not
1745 // have a Manchester encoded bitstream or the clock is really
1746 // wrong!
1747 if (bitidx > (GraphTraceLen*2/clock+8) ) {
1748 PrintAndLog("Error: the clock you gave is probably wrong, aborting.");
1749 return 0;
1750 }
1751 // Then switch depending on lc length:
1752 // Tolerance is 1/4 of clock rate (arbitrary)
1753 if (abs(lc-clock/2) < tolerance) {
1754 // Short pulse : either "1" or "0"
1755 BitStream[bitidx++]=GraphBuffer[i-1];
1756 } else if (abs(lc-clock) < tolerance) {
1757 // Long pulse: either "11" or "00"
1758 BitStream[bitidx++]=GraphBuffer[i-1];
1759 BitStream[bitidx++]=GraphBuffer[i-1];
1760 } else {
7fe9b0b7 1761 // Error
1762 warnings++;
b3b70669 1763 PrintAndLog("Warning: Manchester decode error for pulse width detection.");
1764 PrintAndLog("(too many of those messages mean either the stream is not Manchester encoded, or clock is wrong)");
7fe9b0b7 1765
1766 if (warnings > 10)
1767 {
1768 PrintAndLog("Error: too many detection errors, aborting.");
1769 return 0;
1770 }
1771 }
1772 }
1773 }
1774
1775 // At this stage, we now have a bitstream of "01" ("1") or "10" ("0"), parse it into final decoded bitstream
1776 // Actually, we overwrite BitStream with the new decoded bitstream, we just need to be careful
1777 // to stop output at the final bitidx2 value, not bitidx
1778 for (i = 0; i < bitidx; i += 2) {
1779 if ((BitStream[i] == 0) && (BitStream[i+1] == 1)) {
1780 BitStream[bit2idx++] = 1 ^ invert;
b3b70669 1781 } else if ((BitStream[i] == 1) && (BitStream[i+1] == 0)) {
1782 BitStream[bit2idx++] = 0 ^ invert;
1783 } else {
1784 // We cannot end up in this state, this means we are unsynchronized,
1785 // move up 1 bit:
1786 i++;
7fe9b0b7 1787 warnings++;
b3b70669 1788 PrintAndLog("Unsynchronized, resync...");
1789 PrintAndLog("(too many of those messages mean the stream is not Manchester encoded)");
7fe9b0b7 1790
1791 if (warnings > 10)
1792 {
1793 PrintAndLog("Error: too many decode errors, aborting.");
1794 return 0;
1795 }
1796 }
1797 }
1798 }
1799
1800 PrintAndLog("Manchester decoded bitstream");
1801 // Now output the bitstream to the scrollback by line of 16 bits
1802 for (i = 0; i < (bit2idx-16); i+=16) {
1803 PrintAndLog("%i %i %i %i %i %i %i %i %i %i %i %i %i %i %i %i",
1804 BitStream[i],
1805 BitStream[i+1],
1806 BitStream[i+2],
1807 BitStream[i+3],
1808 BitStream[i+4],
1809 BitStream[i+5],
1810 BitStream[i+6],
1811 BitStream[i+7],
1812 BitStream[i+8],
1813 BitStream[i+9],
1814 BitStream[i+10],
1815 BitStream[i+11],
1816 BitStream[i+12],
1817 BitStream[i+13],
1818 BitStream[i+14],
1819 BitStream[i+15]);
1820 }
1821 return 0;
1822}
1823
1824/* Modulate our data into manchester */
1825int CmdManchesterMod(const char *Cmd)
1826{
1827 int i, j;
1828 int clock;
1829 int bit, lastbit, wave;
1830
1831 /* Get our clock */
1832 clock = GetClock(Cmd, 0, 1);
1833
1834 wave = 0;
1835 lastbit = 1;
1836 for (i = 0; i < (int)(GraphTraceLen / clock); i++)
1837 {
1838 bit = GraphBuffer[i * clock] ^ 1;
1839
1840 for (j = 0; j < (int)(clock/2); j++)
1841 GraphBuffer[(i * clock) + j] = bit ^ lastbit ^ wave;
1842 for (j = (int)(clock/2); j < clock; j++)
1843 GraphBuffer[(i * clock) + j] = bit ^ lastbit ^ wave ^ 1;
1844
1845 /* Keep track of how we start our wave and if we changed or not this time */
1846 wave ^= bit ^ lastbit;
1847 lastbit = bit;
1848 }
1849
1850 RepaintGraphWindow();
1851 return 0;
1852}
1853
1854int CmdNorm(const char *Cmd)
1855{
1856 int i;
1857 int max = INT_MIN, min = INT_MAX;
1858
1859 for (i = 10; i < GraphTraceLen; ++i) {
1860 if (GraphBuffer[i] > max)
1861 max = GraphBuffer[i];
1862 if (GraphBuffer[i] < min)
1863 min = GraphBuffer[i];
1864 }
1865
1866 if (max != min) {
1867 for (i = 0; i < GraphTraceLen; ++i) {
ba1a299c 1868 GraphBuffer[i] = (GraphBuffer[i] - ((max + min) / 2)) * 256 /
7fe9b0b7 1869 (max - min);
ba1a299c 1870 //marshmelow: adjusted *1000 to *256 to make +/- 128 so demod commands still work
7fe9b0b7 1871 }
1872 }
1873 RepaintGraphWindow();
1874 return 0;
1875}
1876
1877int CmdPlot(const char *Cmd)
1878{
1879 ShowGraphWindow();
1880 return 0;
1881}
1882
1883int CmdSave(const char *Cmd)
1884{
ec75f5c1 1885 char filename[FILE_PATH_SIZE] = {0x00};
1886 int len = 0;
b915fda3 1887
ec75f5c1 1888 len = strlen(Cmd);
1889 if (len > FILE_PATH_SIZE) len = FILE_PATH_SIZE;
1890 memcpy(filename, Cmd, len);
b915fda3 1891
1892
1893 FILE *f = fopen(filename, "w");
7fe9b0b7 1894 if(!f) {
b915fda3 1895 PrintAndLog("couldn't open '%s'", filename);
7fe9b0b7 1896 return 0;
1897 }
1898 int i;
1899 for (i = 0; i < GraphTraceLen; i++) {
1900 fprintf(f, "%d\n", GraphBuffer[i]);
1901 }
1902 fclose(f);
1903 PrintAndLog("saved to '%s'", Cmd);
1904 return 0;
1905}
1906
1907int CmdScale(const char *Cmd)
1908{
1909 CursorScaleFactor = atoi(Cmd);
1910 if (CursorScaleFactor == 0) {
1911 PrintAndLog("bad, can't have zero scale");
1912 CursorScaleFactor = 1;
1913 }
1914 RepaintGraphWindow();
1915 return 0;
1916}
1917
1918int CmdThreshold(const char *Cmd)
1919{
1920 int threshold = atoi(Cmd);
1921
1922 for (int i = 0; i < GraphTraceLen; ++i) {
1923 if (GraphBuffer[i] >= threshold)
1924 GraphBuffer[i] = 1;
1925 else
7bb9d33e 1926 GraphBuffer[i] = -1;
7fe9b0b7 1927 }
1928 RepaintGraphWindow();
1929 return 0;
1930}
1931
d51b2eda
MHS
1932int CmdDirectionalThreshold(const char *Cmd)
1933{
1934 int8_t upThres = param_get8(Cmd, 0);
1935 int8_t downThres = param_get8(Cmd, 1);
ba1a299c 1936
d51b2eda 1937 printf("Applying Up Threshold: %d, Down Threshold: %d\n", upThres, downThres);
952a8bb5 1938
d51b2eda
MHS
1939 int lastValue = GraphBuffer[0];
1940 GraphBuffer[0] = 0; // Will be changed at the end, but init 0 as we adjust to last samples value if no threshold kicks in.
952a8bb5 1941
d51b2eda
MHS
1942 for (int i = 1; i < GraphTraceLen; ++i) {
1943 // Apply first threshold to samples heading up
1944 if (GraphBuffer[i] >= upThres && GraphBuffer[i] > lastValue)
1945 {
1946 lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it.
1947 GraphBuffer[i] = 1;
1948 }
1949 // Apply second threshold to samples heading down
1950 else if (GraphBuffer[i] <= downThres && GraphBuffer[i] < lastValue)
1951 {
1952 lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it.
1953 GraphBuffer[i] = -1;
1954 }
1955 else
1956 {
1957 lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it.
1958 GraphBuffer[i] = GraphBuffer[i-1];
1959
1960 }
1961 }
1962 GraphBuffer[0] = GraphBuffer[1]; // Aline with first edited sample.
1963 RepaintGraphWindow();
1964 return 0;
1965}
1966
7fe9b0b7 1967int CmdZerocrossings(const char *Cmd)
1968{
1969 // Zero-crossings aren't meaningful unless the signal is zero-mean.
1970 CmdHpf("");
1971
1972 int sign = 1;
1973 int zc = 0;
1974 int lastZc = 0;
1975
1976 for (int i = 0; i < GraphTraceLen; ++i) {
1977 if (GraphBuffer[i] * sign >= 0) {
1978 // No change in sign, reproduce the previous sample count.
1979 zc++;
1980 GraphBuffer[i] = lastZc;
1981 } else {
1982 // Change in sign, reset the sample count.
1983 sign = -sign;
1984 GraphBuffer[i] = lastZc;
1985 if (sign > 0) {
1986 lastZc = zc;
1987 zc = 0;
1988 }
1989 }
1990 }
1991
1992 RepaintGraphWindow();
1993 return 0;
1994}
1995
ba1a299c 1996static command_t CommandTable[] =
7fe9b0b7 1997{
1998 {"help", CmdHelp, 1, "This help"},
1999 {"amp", CmdAmp, 1, "Amplify peaks"},
57c69556 2000 {"askdemod", Cmdaskdemod, 1, "<0 or 1> -- Attempt to demodulate simple ASK tags"},
1e090a61 2001 {"askmandemod", Cmdaskmandemod, 1, "[clock] [invert<0|1>] -- Attempt to demodulate ASK/Manchester tags and output binary (args optional)"},
2002 {"askrawdemod", Cmdaskrawdemod, 1, "[clock] [invert<0|1>] -- Attempt to demodulate ASK tags and output bin (args optional)"},
7fe9b0b7 2003 {"autocorr", CmdAutoCorr, 1, "<window length> -- Autocorrelation over window"},
1e090a61 2004 {"biphaserawdecode",CmdBiphaseDecodeRaw,1,"[offset] [invert<0|1>] Biphase decode bin stream in demod buffer (offset = 0|1 bits to shift the decode start)"},
7fe9b0b7 2005 {"bitsamples", CmdBitsamples, 0, "Get raw samples as bitstring"},
2006 {"bitstream", CmdBitstream, 1, "[clock rate] -- Convert waveform into a bitstream"},
2007 {"buffclear", CmdBuffClear, 1, "Clear sample buffer and graph window"},
2008 {"dec", CmdDec, 1, "Decimate samples"},
ba1a299c 2009 {"detectclock", CmdDetectClockRate, 1, "Detect ASK clock rate"},
e888ed8e 2010 {"fskdemod", CmdFSKdemod, 1, "Demodulate graph window as a HID FSK"},
1e090a61 2011 {"fskawiddemod", CmdFSKdemodAWID, 1, "Demodulate graph window as an AWID FSK tag using raw"},
2012 {"fskfcdetect", CmdFSKfcDetect, 1, "Try to detect the Field Clock of an FSK wave"},
2013 {"fskhiddemod", CmdFSKdemodHID, 1, "Demodulate graph window as a HID FSK tag using raw"},
2014 {"fskiodemod", CmdFSKdemodIO, 1, "Demodulate graph window as an IO Prox tag FSK using raw"},
2015 {"fskpyramiddemod",CmdFSKdemodPyramid,1, "Demodulate graph window as a Pyramid FSK tag using raw"},
ec75f5c1 2016 {"fskparadoxdemod",CmdFSKdemodParadox,1, "Demodulate graph window as a Paradox FSK tag using raw"},
1e090a61 2017 {"fskrawdemod", CmdFSKrawdemod, 1, "[clock rate] [invert] [rchigh] [rclow] Demodulate graph window from FSK to bin (clock = 50)(invert = 1|0)(rchigh = 10)(rclow=8)"},
7fe9b0b7 2018 {"grid", CmdGrid, 1, "<x> <y> -- overlay grid on graph window, use zero value to turn off either"},
ba1a299c 2019 {"hexsamples", CmdHexsamples, 0, "<bytes> [<offset>] -- Dump big buffer as hex bytes"},
7fe9b0b7 2020 {"hide", CmdHide, 1, "Hide graph window"},
2021 {"hpf", CmdHpf, 1, "Remove DC offset from trace"},
7fe9b0b7 2022 {"load", CmdLoad, 1, "<filename> -- Load trace (to graph window"},
2023 {"ltrim", CmdLtrim, 1, "<samples> -- Trim samples from left of trace"},
9ec1416a 2024 {"rtrim", CmdRtrim, 1, "<location to end trace> -- Trim samples from right of trace"},
7fe9b0b7 2025 {"mandemod", CmdManchesterDemod, 1, "[i] [clock rate] -- Manchester demodulate binary stream (option 'i' to invert output)"},
eb191de6 2026 {"manrawdecode", Cmdmandecoderaw, 1, "Manchester decode binary stream already in graph buffer"},
7fe9b0b7 2027 {"manmod", CmdManchesterMod, 1, "[clock rate] -- Manchester modulate a binary stream"},
ba1a299c 2028 {"norm", CmdNorm, 1, "Normalize max/min to +/-128"},
7ddb9900 2029 {"plot", CmdPlot, 1, "Show graph window (hit 'h' in window for keystroke help)"},
ba1a299c 2030 {"pskclean", CmdPskClean, 1, "Attempt to clean psk wave"},
2031 {"pskdetectclock",CmdDetectNRZpskClockRate, 1, "Detect ASK, PSK, or NRZ clock rate"},
04d2721b 2032 {"pskindalademod",CmdIndalaDecode, 1, "[clock] [invert<0|1>] -- Attempt to demodulate psk1 indala tags and output ID binary & hex (args optional)"},
2033 {"psk1nrzrawdemod",CmdpskNRZrawDemod, 1, "[clock] [invert<0|1>] -- Attempt to demodulate psk1 or nrz tags and output binary (args optional)"},
2034 {"psk2rawdemod", CmdPSK2rawDemod, 1, "[clock] [invert<0|1>] -- Attempt to demodulate psk2 tags and output binary (args optional)"},
90d74dc2 2035 {"samples", CmdSamples, 0, "[512 - 40000] -- Get raw samples for graph window"},
7fe9b0b7 2036 {"save", CmdSave, 1, "<filename> -- Save trace (from graph window)"},
2037 {"scale", CmdScale, 1, "<int> -- Set cursor display scale"},
ec75f5c1 2038 {"setdebugmode", CmdSetDebugMode, 1, "<0|1> -- Turn on or off Debugging Mode for demods"},
2039 {"shiftgraphzero",CmdGraphShiftZero, 1, "<shift> -- Shift 0 for Graphed wave + or - shift value"},
dbf444a1 2040 {"threshold", CmdThreshold, 1, "<threshold> -- Maximize/minimize every value in the graph window depending on threshold"},
ba1a299c 2041 {"dirthreshold", CmdDirectionalThreshold, 1, "<thres up> <thres down> -- Max rising higher up-thres/ Min falling lower down-thres, keep rest as prev."},
2042 {"tune", CmdTuneSamples, 0, "Get hw tune samples for graph window"},
7fe9b0b7 2043 {"zerocrossings", CmdZerocrossings, 1, "Count time between zero-crossings"},
2044 {NULL, NULL, 0, NULL}
2045};
2046
2047int CmdData(const char *Cmd)
2048{
2049 CmdsParse(CommandTable, Cmd);
2050 return 0;
2051}
2052
2053int CmdHelp(const char *Cmd)
2054{
2055 CmdsHelp(CommandTable);
2056 return 0;
2057}
Impressum, Datenschutz