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