]> cvs.zerfleddert.de Git - proxmark3-svn/blame - client/cmddata.c
minor g-prox-ii demod fix
[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"
31abe49f 24#include "usb_cmd.h"
73d04bb4 25#include "crc.h"
31abe49f 26
4118b74d 27uint8_t DemodBuffer[MAX_DEMOD_BUF_LEN];
ec75f5c1 28uint8_t g_debugMode;
4118b74d 29int DemodBufferLen;
7fe9b0b7 30static int CmdHelp(const char *Cmd);
31
4118b74d 32//set the demod buffer with given array of binary (one bit per byte)
33//by marshmellow
ec75f5c1 34void setDemodBuf(uint8_t *buff, size_t size, size_t startIdx)
4118b74d 35{
ec75f5c1 36 size_t i = 0;
37 for (; i < size; i++){
38 DemodBuffer[i]=buff[startIdx++];
ba1a299c 39 }
40 DemodBufferLen=size;
41 return;
4118b74d 42}
43
ec75f5c1 44int CmdSetDebugMode(const char *Cmd)
45{
46 int demod=0;
47 sscanf(Cmd, "%i", &demod);
48 g_debugMode=(uint8_t)demod;
49 return 1;
50}
51
4118b74d 52//by marshmellow
abd6112f 53void printDemodBuff(void)
4118b74d 54{
ba1a299c 55 uint32_t i = 0;
56 int bitLen = DemodBufferLen;
57 if (bitLen<16) {
58 PrintAndLog("no bits found in demod buffer");
59 return;
60 }
61 if (bitLen>512) bitLen=512; //max output to 512 bits if we have more - should be plenty
33c7e2f3 62
0c5998c0 63 // ensure equally divided by 16
b4fb11ba 64 bitLen &= 0xfff0;
33c7e2f3 65
ba1a299c 66 for (i = 0; i <= (bitLen-16); i+=16) {
67 PrintAndLog("%i%i%i%i%i%i%i%i%i%i%i%i%i%i%i%i",
68 DemodBuffer[i],
69 DemodBuffer[i+1],
70 DemodBuffer[i+2],
71 DemodBuffer[i+3],
72 DemodBuffer[i+4],
73 DemodBuffer[i+5],
74 DemodBuffer[i+6],
75 DemodBuffer[i+7],
76 DemodBuffer[i+8],
77 DemodBuffer[i+9],
78 DemodBuffer[i+10],
79 DemodBuffer[i+11],
80 DemodBuffer[i+12],
81 DemodBuffer[i+13],
82 DemodBuffer[i+14],
83 DemodBuffer[i+15]);
84 }
85 return;
4118b74d 86}
87
8d960002 88int CmdPrintDemodBuff(const char *Cmd)
89{
13024283 90 char hex;
91 char printBuff[512]={0x00};
92 uint8_t numBits = DemodBufferLen & 0xFFF0;
93 sscanf(Cmd, "%c", &hex);
94 if (hex == 'h'){
95 PrintAndLog("Usage: data printdemodbuffer [x]");
96 PrintAndLog("Options: ");
97 PrintAndLog(" h This help");
98 PrintAndLog(" x output in hex (omit for binary output)");
99 return 0;
100 }
101 if (hex == 'x'){
102 numBits = binarraytohex(printBuff, (char *)DemodBuffer, numBits);
103 if (numBits==0) return 0;
104 PrintAndLog("DemodBuffer: %s",printBuff);
105 } else {
106 printDemodBuff();
107 }
8d960002 108 return 1;
109}
7fe9b0b7 110int CmdAmp(const char *Cmd)
111{
112 int i, rising, falling;
113 int max = INT_MIN, min = INT_MAX;
114
115 for (i = 10; i < GraphTraceLen; ++i) {
116 if (GraphBuffer[i] > max)
117 max = GraphBuffer[i];
118 if (GraphBuffer[i] < min)
119 min = GraphBuffer[i];
120 }
121
122 if (max != min) {
123 rising = falling= 0;
124 for (i = 0; i < GraphTraceLen; ++i) {
125 if (GraphBuffer[i + 1] < GraphBuffer[i]) {
126 if (rising) {
127 GraphBuffer[i] = max;
128 rising = 0;
129 }
130 falling = 1;
131 }
132 if (GraphBuffer[i + 1] > GraphBuffer[i]) {
133 if (falling) {
134 GraphBuffer[i] = min;
135 falling = 0;
136 }
137 rising= 1;
138 }
139 }
140 }
141 RepaintGraphWindow();
142 return 0;
143}
144
145/*
146 * Generic command to demodulate ASK.
147 *
148 * Argument is convention: positive or negative (High mod means zero
149 * or high mod means one)
150 *
151 * Updates the Graph trace with 0/1 values
152 *
153 * Arguments:
78f5b1a7 154 * c : 0 or 1 (or invert)
7fe9b0b7 155 */
78f5b1a7 156 //this method ignores the clock
157
158 //this function strictly converts highs and lows to 1s and 0s for each sample in the graphbuffer
7fe9b0b7 159int Cmdaskdemod(const char *Cmd)
160{
161 int i;
162 int c, high = 0, low = 0;
ba1a299c 163
7fe9b0b7 164 sscanf(Cmd, "%i", &c);
ba1a299c 165
78f5b1a7 166 /* Detect high and lows */
7fe9b0b7 167 for (i = 0; i < GraphTraceLen; ++i)
168 {
169 if (GraphBuffer[i] > high)
170 high = GraphBuffer[i];
171 else if (GraphBuffer[i] < low)
172 low = GraphBuffer[i];
173 }
eb191de6 174 high=abs(high*.75);
175 low=abs(low*.75);
7fe9b0b7 176 if (c != 0 && c != 1) {
177 PrintAndLog("Invalid argument: %s", Cmd);
178 return 0;
179 }
b3b70669 180 //prime loop
7fe9b0b7 181 if (GraphBuffer[0] > 0) {
182 GraphBuffer[0] = 1-c;
183 } else {
184 GraphBuffer[0] = c;
185 }
186 for (i = 1; i < GraphTraceLen; ++i) {
187 /* Transitions are detected at each peak
188 * Transitions are either:
189 * - we're low: transition if we hit a high
190 * - we're high: transition if we hit a low
191 * (we need to do it this way because some tags keep high or
192 * low for long periods, others just reach the peak and go
193 * down)
194 */
ae2f73c1 195 //[marhsmellow] change == to >= for high and <= for low for fuzz
78f5b1a7 196 if ((GraphBuffer[i] >= high) && (GraphBuffer[i - 1] == c)) {
7fe9b0b7 197 GraphBuffer[i] = 1 - c;
78f5b1a7 198 } else if ((GraphBuffer[i] <= low) && (GraphBuffer[i - 1] == (1 - c))){
7fe9b0b7 199 GraphBuffer[i] = c;
200 } else {
201 /* No transition */
202 GraphBuffer[i] = GraphBuffer[i - 1];
203 }
204 }
205 RepaintGraphWindow();
206 return 0;
207}
208
78f5b1a7 209//this function strictly converts >1 to 1 and <1 to 0 for each sample in the graphbuffer
210int CmdGetBitStream(const char *Cmd)
211{
212 int i;
213 CmdHpf(Cmd);
214 for (i = 0; i < GraphTraceLen; i++) {
215 if (GraphBuffer[i] >= 1) {
216 GraphBuffer[i] = 1;
217 } else {
218 GraphBuffer[i] = 0;
219 }
220 }
221 RepaintGraphWindow();
222 return 0;
223}
224
225
d5a72d2f 226//by marshmellow
227void printBitStream(uint8_t BitStream[], uint32_t bitLen)
228{
b4fb11ba 229 uint32_t i = 0;
230 if (bitLen<16) {
231 PrintAndLog("Too few bits found: %d",bitLen);
232 return;
233 }
234 if (bitLen>512) bitLen=512;
0c5998c0 235
b4fb11ba 236 // ensure equally divided by 16
237 bitLen &= 0xfff0;
0c5998c0 238
b4fb11ba 239
240 for (i = 0; i <= (bitLen-16); i+=16) {
241 PrintAndLog("%i%i%i%i%i%i%i%i%i%i%i%i%i%i%i%i",
242 BitStream[i],
243 BitStream[i+1],
244 BitStream[i+2],
245 BitStream[i+3],
246 BitStream[i+4],
247 BitStream[i+5],
248 BitStream[i+6],
249 BitStream[i+7],
250 BitStream[i+8],
251 BitStream[i+9],
252 BitStream[i+10],
253 BitStream[i+11],
254 BitStream[i+12],
255 BitStream[i+13],
256 BitStream[i+14],
257 BitStream[i+15]);
258 }
ba1a299c 259 return;
2fc2150e 260}
d5a72d2f 261//by marshmellow
abd6112f 262//print 64 bit EM410x ID in multiple formats
eb191de6 263void printEM410x(uint64_t id)
2fc2150e 264{
eb191de6 265 if (id !=0){
b4fb11ba 266 uint64_t iii=1;
267 uint64_t id2lo=0;
268 uint32_t ii=0;
269 uint32_t i=0;
270 for (ii=5; ii>0;ii--){
271 for (i=0;i<8;i++){
272 id2lo=(id2lo<<1LL) | ((id & (iii << (i+((ii-1)*8)))) >> (i+((ii-1)*8)));
2fc2150e 273 }
b4fb11ba 274 }
275 //output em id
276 PrintAndLog("EM TAG ID : %010llx", id);
277 PrintAndLog("Unique TAG ID: %010llx", id2lo);
278 PrintAndLog("DEZ 8 : %08lld",id & 0xFFFFFF);
279 PrintAndLog("DEZ 10 : %010lld",id & 0xFFFFFF);
280 PrintAndLog("DEZ 5.5 : %05lld.%05lld",(id>>16LL) & 0xFFFF,(id & 0xFFFF));
281 PrintAndLog("DEZ 3.5A : %03lld.%05lld",(id>>32ll),(id & 0xFFFF));
282 PrintAndLog("DEZ 14/IK2 : %014lld",id);
283 PrintAndLog("DEZ 15/IK3 : %015lld",id2lo);
284 PrintAndLog("Other : %05lld_%03lld_%08lld",(id&0xFFFF),((id>>16LL) & 0xFF),(id & 0xFFFFFF));
285 }
286 return;
eb191de6 287}
288
e888ed8e 289//by marshmellow
e770c648 290//takes 3 arguments - clock, invert and maxErr as integers
291//attempts to demodulate ask while decoding manchester
292//prints binary found and saves in graphbuffer for further commands
293int CmdAskEM410xDemod(const char *Cmd)
294{
295 int invert=0;
296 int clk=0;
297 int maxErr=100;
298 char cmdp = param_getchar(Cmd, 0);
6de43508 299 if (strlen(Cmd) > 10 || cmdp == 'h' || cmdp == 'H') {
e770c648 300 PrintAndLog("Usage: data askem410xdemod [clock] <0|1> [maxError]");
301 PrintAndLog(" [set clock as integer] optional, if not set, autodetect.");
302 PrintAndLog(" <invert>, 1 for invert output");
303 PrintAndLog(" [set maximum allowed errors], default = 100.");
304 PrintAndLog("");
305 PrintAndLog(" sample: data askem410xdemod = demod an EM410x Tag ID from GraphBuffer");
306 PrintAndLog(" : data askem410xdemod 32 = demod an EM410x Tag ID from GraphBuffer using a clock of RF/32");
307 PrintAndLog(" : data askem410xdemod 32 1 = demod an EM410x Tag ID from GraphBuffer using a clock of RF/32 and inverting data");
308 PrintAndLog(" : data askem410xdemod 1 = demod an EM410x Tag ID from GraphBuffer while inverting data");
309 PrintAndLog(" : data askem410xdemod 64 1 0 = demod an EM410x Tag ID from GraphBuffer using a clock of RF/64 and inverting data and allowing 0 demod errors");
310
311 return 0;
312 }
313
314
315 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
316 sscanf(Cmd, "%i %i %i", &clk, &invert, &maxErr);
317 if (invert != 0 && invert != 1) {
318 PrintAndLog("Invalid argument: %s", Cmd);
319 return 0;
320 }
321 size_t BitLen = getFromGraphBuf(BitStream);
322
323 if (g_debugMode==1) PrintAndLog("DEBUG: Bitlen from grphbuff: %d",BitLen);
324 if (BitLen==0) return 0;
325 int errCnt=0;
326 errCnt = askmandemod(BitStream, &BitLen, &clk, &invert, maxErr);
327 if (errCnt<0||BitLen<16){ //if fatal error (or -1)
328 if (g_debugMode==1) PrintAndLog("no data found %d, errors:%d, bitlen:%d, clock:%d",errCnt,invert,BitLen,clk);
329 return 0;
330 }
331 PrintAndLog("\nUsing Clock: %d - Invert: %d - Bits Found: %d",clk,invert,BitLen);
332
333 //output
334 if (errCnt>0){
335 PrintAndLog("# Errors during Demoding (shown as 77 in bit stream): %d",errCnt);
336 }
337 //PrintAndLog("ASK/Manchester decoded bitstream:");
338 // Now output the bitstream to the scrollback by line of 16 bits
339 setDemodBuf(BitStream,BitLen,0);
340 //printDemodBuff();
341 uint64_t lo =0;
342 size_t idx=0;
343 lo = Em410xDecode(BitStream, &BitLen, &idx);
344 if (lo>0){
345 //set GraphBuffer for clone or sim command
346 setDemodBuf(BitStream, BitLen, idx);
347 if (g_debugMode){
348 PrintAndLog("DEBUG: idx: %d, Len: %d, Printing Demod Buffer:", idx, BitLen);
349 printDemodBuff();
350 }
351 PrintAndLog("EM410x pattern found: ");
abd6112f 352 if (BitLen > 64) PrintAndLog("\nWarning! Length not what is expected - Length: %d bits\n",BitLen);
e770c648 353 printEM410x(lo);
354 return 1;
355 }
356 return 0;
357}
358
4ac906d1 359int ASKmanDemod(const char *Cmd, bool verbose, bool emSearch)
e888ed8e 360{
ec75f5c1 361 int invert=0;
b4fb11ba 362 int clk=0;
e770c648 363 int maxErr=100;
4ac906d1 364
eb191de6 365 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
b4fb11ba 366 sscanf(Cmd, "%i %i %i", &clk, &invert, &maxErr);
e888ed8e 367 if (invert != 0 && invert != 1) {
368 PrintAndLog("Invalid argument: %s", Cmd);
369 return 0;
6de43508 370 }
371 if (clk==1){
372 invert=1;
373 clk=0;
e888ed8e 374 }
b4fb11ba 375 size_t BitLen = getFromGraphBuf(BitStream);
ec75f5c1 376 if (g_debugMode==1) PrintAndLog("DEBUG: Bitlen from grphbuff: %d",BitLen);
e770c648 377 if (BitLen==0) return 0;
eb191de6 378 int errCnt=0;
e770c648 379 errCnt = askmandemod(BitStream, &BitLen, &clk, &invert, maxErr);
b4fb11ba 380 if (errCnt<0||BitLen<16){ //if fatal error (or -1)
381 if (g_debugMode==1) PrintAndLog("no data found %d, errors:%d, bitlen:%d, clock:%d",errCnt,invert,BitLen,clk);
e888ed8e 382 return 0;
b4fb11ba 383 }
4ac906d1 384 if (verbose) PrintAndLog("\nUsing Clock: %d - Invert: %d - Bits Found: %d",clk,invert,BitLen);
ba1a299c 385
d5a72d2f 386 //output
eb191de6 387 if (errCnt>0){
4ac906d1 388 if (verbose) PrintAndLog("# Errors during Demoding (shown as 77 in bit stream): %d",errCnt);
e888ed8e 389 }
4ac906d1 390 if (verbose) PrintAndLog("ASK/Manchester decoded bitstream:");
eb191de6 391 // Now output the bitstream to the scrollback by line of 16 bits
b4fb11ba 392 setDemodBuf(BitStream,BitLen,0);
4ac906d1 393 if (verbose) printDemodBuff();
eb191de6 394 uint64_t lo =0;
ec75f5c1 395 size_t idx=0;
4ac906d1 396 if (emSearch){
397 lo = Em410xDecode(BitStream, &BitLen, &idx);
398 if (lo>0){
399 //set GraphBuffer for clone or sim command
400 setDemodBuf(BitStream, BitLen, idx);
401 if (g_debugMode){
402 PrintAndLog("DEBUG: idx: %d, Len: %d, Printing Demod Buffer:", idx, BitLen);
403 printDemodBuff();
404 }
405 if (verbose) PrintAndLog("EM410x pattern found: ");
406 if (verbose) printEM410x(lo);
407 return 1;
ec75f5c1 408 }
d5a72d2f 409 }
e770c648 410 return 1;
eb191de6 411}
412
4ac906d1 413//by marshmellow
414//takes 3 arguments - clock, invert, maxErr as integers
415//attempts to demodulate ask while decoding manchester
416//prints binary found and saves in graphbuffer for further commands
417int Cmdaskmandemod(const char *Cmd)
418{
419 char cmdp = param_getchar(Cmd, 0);
420 if (strlen(Cmd) > 10 || cmdp == 'h' || cmdp == 'H') {
421 PrintAndLog("Usage: data rawdemod am [clock] <0|1> [maxError]");
422 PrintAndLog(" [set clock as integer] optional, if not set, autodetect.");
423 PrintAndLog(" <invert>, 1 for invert output");
424 PrintAndLog(" [set maximum allowed errors], default = 100.");
425 PrintAndLog("");
426 PrintAndLog(" sample: data rawdemod am = demod an ask/manchester tag from GraphBuffer");
427 PrintAndLog(" : data rawdemod am 32 = demod an ask/manchester tag from GraphBuffer using a clock of RF/32");
428 PrintAndLog(" : data rawdemod am 32 1 = demod an ask/manchester tag from GraphBuffer using a clock of RF/32 and inverting data");
429 PrintAndLog(" : data rawdemod am 1 = demod an ask/manchester tag from GraphBuffer while inverting data");
430 PrintAndLog(" : data rawdemod am 64 1 0 = demod an ask/manchester tag from GraphBuffer using a clock of RF/64, inverting data and allowing 0 demod errors");
431 return 0;
432 }
433 return ASKmanDemod(Cmd, TRUE, TRUE);
434}
435
eb191de6 436//by marshmellow
d5a72d2f 437//manchester decode
eb191de6 438//stricktly take 10 and 01 and convert to 0 and 1
439int Cmdmandecoderaw(const char *Cmd)
440{
441 int i =0;
442 int errCnt=0;
b4fb11ba 443 size_t size=0;
6de43508 444 size_t maxErr = 20;
e770c648 445 char cmdp = param_getchar(Cmd, 0);
446 if (strlen(Cmd) > 1 || cmdp == 'h' || cmdp == 'H') {
447 PrintAndLog("Usage: data manrawdecode");
448 PrintAndLog(" Takes 10 and 01 and converts to 0 and 1 respectively");
449 PrintAndLog(" --must have binary sequence in demodbuffer (run data askrawdemod first)");
450 PrintAndLog("");
451 PrintAndLog(" sample: data manrawdecode = decode manchester bitstream from the demodbuffer");
452 return 0;
453 }
454 if (DemodBufferLen==0) return 0;
eb191de6 455 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
456 int high=0,low=0;
b4fb11ba 457 for (;i<DemodBufferLen;++i){
458 if (DemodBuffer[i]>high) high=DemodBuffer[i];
459 else if(DemodBuffer[i]<low) low=DemodBuffer[i];
460 BitStream[i]=DemodBuffer[i];
eb191de6 461 }
462 if (high>1 || low <0 ){
463 PrintAndLog("Error: please raw demod the wave first then mancheseter raw decode");
464 return 0;
465 }
b4fb11ba 466 size=i;
467 errCnt=manrawdecode(BitStream, &size);
6de43508 468 if (errCnt>=maxErr){
2df8c079 469 PrintAndLog("Too many errors: %d",errCnt);
470 return 0;
471 }
eb191de6 472 PrintAndLog("Manchester Decoded - # errors:%d - data:",errCnt);
b4fb11ba 473 printBitStream(BitStream, size);
eb191de6 474 if (errCnt==0){
b4fb11ba 475 uint64_t id = 0;
ec75f5c1 476 size_t idx=0;
b4fb11ba 477 id = Em410xDecode(BitStream, &size, &idx);
478 if (id>0){
ec75f5c1 479 //need to adjust to set bitstream back to manchester encoded data
480 //setDemodBuf(BitStream, size, idx);
481
482 printEM410x(id);
483 }
eb191de6 484 }
d5a72d2f 485 return 1;
486}
487
488//by marshmellow
489//biphase decode
490//take 01 or 10 = 0 and 11 or 00 = 1
1e090a61 491//takes 2 arguments "offset" default = 0 if 1 it will shift the decode by one bit
492// and "invert" default = 0 if 1 it will invert output
ba1a299c 493// since it is not like manchester and doesn't have an incorrect bit pattern we
d5a72d2f 494// cannot determine if our decode is correct or if it should be shifted by one bit
495// the argument offset allows us to manually shift if the output is incorrect
496// (better would be to demod and decode at the same time so we can distinguish large
497// width waves vs small width waves to help the decode positioning) or askbiphdemod
498int CmdBiphaseDecodeRaw(const char *Cmd)
499{
b4fb11ba 500 int i = 0;
501 int errCnt=0;
ba1a299c 502 size_t size=0;
b4fb11ba 503 int offset=0;
504 int invert=0;
505 int high=0, low=0;
506 char cmdp = param_getchar(Cmd, 0);
507 if (strlen(Cmd) > 3 || cmdp == 'h' || cmdp == 'H') {
508 PrintAndLog("Usage: data biphaserawdecode [offset] <invert>");
509 PrintAndLog(" Converts 10 or 01 to 0 and 11 or 00 to 1");
510 PrintAndLog(" --must have binary sequence in demodbuffer (run data askrawdemod first)");
511 PrintAndLog("");
512 PrintAndLog(" [offset <0|1>], set to 0 not to adjust start position or to 1 to adjust decode start position");
513 PrintAndLog(" [invert <0|1>], set to 1 to invert output");
514 PrintAndLog("");
515 PrintAndLog(" sample: data biphaserawdecode = decode biphase bitstream from the demodbuffer");
516 PrintAndLog(" sample: data biphaserawdecode 1 1 = decode biphase bitstream from the demodbuffer, set offset, and invert output");
517 return 0;
518 }
1e090a61 519 sscanf(Cmd, "%i %i", &offset, &invert);
b4fb11ba 520 if (DemodBufferLen==0) return 0;
521 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
522 //get graphbuffer & high and low
ba1a299c 523 for (;i<DemodBufferLen;++i){
524 if(DemodBuffer[i]>high)high=DemodBuffer[i];
525 else if(DemodBuffer[i]<low)low=DemodBuffer[i];
526 BitStream[i]=DemodBuffer[i];
b4fb11ba 527 }
528 if (high>1 || low <0){
529 PrintAndLog("Error: please raw demod the wave first then decode");
530 return 0;
531 }
ba1a299c 532 size=i;
1e090a61 533 errCnt=BiphaseRawDecode(BitStream, &size, offset, invert);
b4fb11ba 534 if (errCnt>=20){
535 PrintAndLog("Too many errors attempting to decode: %d",errCnt);
536 return 0;
537 }
538 PrintAndLog("Biphase Decoded using offset: %d - # errors:%d - data:",offset,errCnt);
ba1a299c 539 printBitStream(BitStream, size);
b4fb11ba 540 PrintAndLog("\nif bitstream does not look right try offset=1");
ada339a1 541 if (offset == 1) setDemodBuf(DemodBuffer,DemodBufferLen-1,1); //remove first bit from raw demod
b4fb11ba 542 return 1;
eb191de6 543}
544
8d960002 545// set demod buffer back to raw after biphase demod
546void setBiphaseDemodBuf(uint8_t *BitStream, size_t size)
547{
548 uint8_t rawStream[512]={0x00};
549 size_t i=0;
550 uint8_t curPhase=0;
551 if (size > 256) {
552 PrintAndLog("ERROR - Biphase Demod Buffer overrun");
553 return;
554 }
555 for (size_t idx=0; idx<size; idx++){
ada339a1 556 if(!BitStream[idx]){
8d960002 557 rawStream[i++] = curPhase;
558 rawStream[i++] = curPhase;
559 curPhase ^= 1;
560 } else {
561 rawStream[i++] = curPhase;
562 rawStream[i++] = curPhase ^ 1;
563 }
564 }
565 setDemodBuf(rawStream,i,0);
566 return;
567}
eb191de6 568//by marshmellow
6de43508 569//takes 4 arguments - clock, invert, maxErr as integers and amplify as char
eb191de6 570//attempts to demodulate ask only
571//prints binary found and saves in graphbuffer for further commands
4ac906d1 572int ASKrawDemod(const char *Cmd, bool verbose)
eb191de6 573{
b4fb11ba 574 int invert=0;
575 int clk=0;
e770c648 576 int maxErr=100;
6de43508 577 uint8_t askAmp = 0;
578 char amp = param_getchar(Cmd, 0);
eb191de6 579 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
b4fb11ba 580 sscanf(Cmd, "%i %i %i %c", &clk, &invert, &maxErr, &amp);
eb191de6 581 if (invert != 0 && invert != 1) {
4ac906d1 582 if (verbose) PrintAndLog("Invalid argument: %s", Cmd);
eb191de6 583 return 0;
584 }
6de43508 585 if (clk==1){
586 invert=1;
587 clk=0;
588 }
589 if (amp == 'a' || amp == 'A') askAmp=1;
b4fb11ba 590 size_t BitLen = getFromGraphBuf(BitStream);
e770c648 591 if (BitLen==0) return 0;
eb191de6 592 int errCnt=0;
b4fb11ba 593 errCnt = askrawdemod(BitStream, &BitLen, &clk, &invert, maxErr, askAmp);
594 if (errCnt==-1||BitLen<16){ //throw away static - allow 1 and -1 (in case of threshold command first)
4ac906d1 595 if (verbose) PrintAndLog("no data found");
596 if (g_debugMode==1 && verbose) PrintAndLog("errCnt: %d, BitLen: %d, clk: %d, invert: %d", errCnt, BitLen, clk, invert);
eb191de6 597 return 0;
b4fb11ba 598 }
4ac906d1 599 if (verbose) PrintAndLog("Using Clock: %d - invert: %d - Bits Found: %d", clk, invert, BitLen);
ec75f5c1 600
601 //move BitStream back to DemodBuffer
b4fb11ba 602 setDemodBuf(BitStream,BitLen,0);
ba1a299c 603
b4fb11ba 604 //output
4ac906d1 605 if (errCnt>0 && verbose){
e770c648 606 PrintAndLog("# Errors during Demoding (shown as 77 in bit stream): %d", errCnt);
eb191de6 607 }
4ac906d1 608 if (verbose){
609 PrintAndLog("ASK demoded bitstream:");
610 // Now output the bitstream to the scrollback by line of 16 bits
611 printBitStream(BitStream,BitLen);
612 }
f822a063 613 return 1;
e888ed8e 614}
615
8d960002 616//by marshmellow
617//attempts to demodulate and identify a G_Prox_II verex/chubb card
618//WARNING: if it fails during some points it will destroy the DemodBuffer data
619// but will leave the GraphBuffer intact.
620//if successful it will push askraw data back to demod buffer ready for emulation
621int CmdG_Prox_II_Demod(const char *Cmd)
622{
623 int ans = ASKrawDemod(Cmd, FALSE);
624 if (ans <= 0) {
625 if (g_debugMode) PrintAndLog("Error AskrawDemod: %d",ans);
d9d41e0f 626 return 0; //ans;
8d960002 627 }
628 size_t size = DemodBufferLen;
629 ans = BiphaseRawDecode(DemodBuffer, &size, 0, 0);
630 if (ans !=0) {
631 if (g_debugMode) PrintAndLog("Error BiphaseRawDecode: %d",ans);
d9d41e0f 632 return 0; //ans;
8d960002 633 }
634 //call lfdemod.c demod for gProxII
635 ans = gProxII_Demod(DemodBuffer, &size);
636 if (ans < 0){
637 if (g_debugMode) PrintAndLog("Error gProxII_Demod 1st Try: %d",ans);
638 //try biphase again
639 ans = BiphaseRawDecode(DemodBuffer, &size, 1, 0);
640 if (ans != 0) {
641 if (g_debugMode) PrintAndLog("Error BiphaseRawDecode: %d",ans);
d9d41e0f 642 return 0;//ans;
8d960002 643 }
644 ans = gProxII_Demod(DemodBuffer, &size);
645 if (ans < 0) {
646 if (g_debugMode) PrintAndLog("Error gProxII_Demod 1st Try: %d",ans);
647 return ans;
648 }
649 }
650 //got a good demod
651 uint32_t ByteStream[65] = {0x00};
652 uint8_t xorKey=0;
653 uint8_t keyCnt=0;
654 uint8_t bitCnt=0;
655 uint8_t ByteCnt=0;
656 size_t startIdx = ans + 6; //start after preamble
657 for (size_t idx = 0; idx<size-6; idx++){
658 if ((idx+1) % 5 == 0){
659 //spacer bit - should be 0
660 if (DemodBuffer[startIdx+idx] != 0) {
661 if (g_debugMode) PrintAndLog("Error spacer not 0: %d, pos: %d",DemodBuffer[startIdx+idx],startIdx+idx);
662 return -1;
663 }
664 continue;
665 }
666 if (keyCnt<8){ //lsb first
667 xorKey = xorKey | (DemodBuffer[startIdx+idx]<<keyCnt);
668 keyCnt++;
669 if (keyCnt==8 && g_debugMode) PrintAndLog("xorKey Found: %02x", xorKey);
670 continue;
671 }
672 //lsb first
673 ByteStream[ByteCnt] = ByteStream[ByteCnt] | (DemodBuffer[startIdx+idx]<<bitCnt);
674 bitCnt++;
675 if (bitCnt % 8 == 0){
676 if (g_debugMode) PrintAndLog("byte %d: %02x",ByteCnt,ByteStream[ByteCnt]);
677 bitCnt=0;
678 ByteCnt++;
679 }
680 }
681 for (uint8_t i = 0; i < ByteCnt; i++){
682 ByteStream[i] ^= xorKey; //xor
683 if (g_debugMode) PrintAndLog("byte %d after xor: %02x", i, ByteStream[i]);
684 }
685 //now ByteStream contains 64 bytes of decrypted raw tag data
686 //
687 uint8_t fmtLen = ByteStream[0]>>2;
688 uint32_t FC = 0;
689 uint32_t Card = 0;
690 uint32_t raw1 = bytebits_to_byte(DemodBuffer+ans,32);
691 uint32_t raw2 = bytebits_to_byte(DemodBuffer+ans+32, 32);
692 uint32_t raw3 = bytebits_to_byte(DemodBuffer+ans+64, 32);
693
694 if (fmtLen==36){
695 FC = ((ByteStream[3] & 0x7F)<<7) | (ByteStream[4]>>1);
696 Card = ((ByteStream[4]&1)<<19) | (ByteStream[5]<<11) | (ByteStream[6]<<3) | (ByteStream[7]>>5);
697 PrintAndLog("G-Prox-II Found: FmtLen %d, FC %d, Card %d",fmtLen,FC,Card);
698 } else if(fmtLen==26){
699 FC = ((ByteStream[3] & 0x7F)<<1) | (ByteStream[4]>>7);
700 Card = ((ByteStream[4]&0x7F)<<9) | (ByteStream[5]<<1) | (ByteStream[6]>>7);
701 PrintAndLog("G-Prox-II Found: FmtLen %d, FC %d, Card %d",fmtLen,FC,Card);
702 } else {
703 PrintAndLog("Unknown G-Prox-II Fmt Found: FmtLen %d",fmtLen);
704 }
705 PrintAndLog("Raw: %08x%08x%08x", raw1,raw2,raw3);
706 setBiphaseDemodBuf(DemodBuffer+ans, 96);
707 return 1;
708}
709
4ac906d1 710//by marshmellow - see ASKrawDemod
711int Cmdaskrawdemod(const char *Cmd)
712{
713 char cmdp = param_getchar(Cmd, 0);
714 if (strlen(Cmd) > 12 || cmdp == 'h' || cmdp == 'H') {
715 PrintAndLog("Usage: data rawdemod ar [clock] <invert> [maxError] [amplify]");
716 PrintAndLog(" [set clock as integer] optional, if not set, autodetect");
717 PrintAndLog(" <invert>, 1 to invert output");
718 PrintAndLog(" [set maximum allowed errors], default = 100");
719 PrintAndLog(" <amplify>, 'a' to attempt demod with ask amplification, default = no amp");
720 PrintAndLog("");
721 PrintAndLog(" sample: data rawdemod ar = demod an ask tag from GraphBuffer");
722 PrintAndLog(" : data rawdemod ar a = demod an ask tag from GraphBuffer, amplified");
723 PrintAndLog(" : data rawdemod ar 32 = demod an ask tag from GraphBuffer using a clock of RF/32");
724 PrintAndLog(" : data rawdemod ar 32 1 = demod an ask tag from GraphBuffer using a clock of RF/32 and inverting data");
725 PrintAndLog(" : data rawdemod ar 1 = demod an ask tag from GraphBuffer while inverting data");
726 PrintAndLog(" : data rawdemod ar 64 1 0 = demod an ask tag from GraphBuffer using a clock of RF/64, inverting data and allowing 0 demod errors");
727 PrintAndLog(" : data rawdemod ar 64 1 0 a = demod an ask tag from GraphBuffer using a clock of RF/64, inverting data and allowing 0 demod errors, and amp");
728 return 0;
729 }
730 return ASKrawDemod(Cmd, TRUE);
731}
732
73d04bb4 733int AutoCorrelate(int window, bool SaveGrph, bool verbose)
7fe9b0b7 734{
735 static int CorrelBuffer[MAX_GRAPH_TRACE_LEN];
73d04bb4 736 size_t Correlation = 0;
737 int maxSum = 0;
738 int lastMax = 0;
739 if (verbose) PrintAndLog("performing %d correlations", GraphTraceLen - window);
740 for (int i = 0; i < GraphTraceLen - window; ++i) {
741 int sum = 0;
742 for (int j = 0; j < window; ++j) {
743 sum += (GraphBuffer[j]*GraphBuffer[i + j]) / 256;
744 }
745 CorrelBuffer[i] = sum;
746 if (sum >= maxSum-100 && sum <= maxSum+100){
747 //another max
748 Correlation = i-lastMax;
749 lastMax = i;
750 if (sum > maxSum) maxSum = sum;
751 } else if (sum > maxSum){
752 maxSum=sum;
753 lastMax = i;
754 }
755 }
756 if (Correlation==0){
757 //try again with wider margin
758 for (int i = 0; i < GraphTraceLen - window; i++){
759 if (CorrelBuffer[i] >= maxSum-(maxSum*0.05) && CorrelBuffer[i] <= maxSum+(maxSum*0.05)){
760 //another max
761 Correlation = i-lastMax;
762 lastMax = i;
763 //if (CorrelBuffer[i] > maxSum) maxSum = sum;
764 }
765 }
766 }
767 if (verbose && Correlation > 0) PrintAndLog("Possible Correlation: %d samples",Correlation);
768
769 if (SaveGrph){
770 GraphTraceLen = GraphTraceLen - window;
771 memcpy(GraphBuffer, CorrelBuffer, GraphTraceLen * sizeof (int));
772 RepaintGraphWindow();
773 }
774 return Correlation;
775}
7fe9b0b7 776
73d04bb4 777int CmdAutoCorr(const char *Cmd)
778{
7fe9b0b7 779 int window = atoi(Cmd);
780
781 if (window == 0) {
782 PrintAndLog("needs a window");
783 return 0;
784 }
785 if (window >= GraphTraceLen) {
786 PrintAndLog("window must be smaller than trace (%d samples)",
787 GraphTraceLen);
788 return 0;
789 }
73d04bb4 790 return AutoCorrelate(window, TRUE, TRUE);
7fe9b0b7 791}
792
793int CmdBitsamples(const char *Cmd)
794{
795 int cnt = 0;
90d74dc2 796 uint8_t got[12288];
952a8bb5 797
90d74dc2 798 GetFromBigBuf(got,sizeof(got),0);
799 WaitForResponse(CMD_ACK,NULL);
7fe9b0b7 800
90d74dc2 801 for (int j = 0; j < sizeof(got); j++) {
7fe9b0b7 802 for (int k = 0; k < 8; k++) {
90d74dc2 803 if(got[j] & (1 << (7 - k))) {
7fe9b0b7 804 GraphBuffer[cnt++] = 1;
805 } else {
806 GraphBuffer[cnt++] = 0;
807 }
808 }
7fe9b0b7 809 }
810 GraphTraceLen = cnt;
811 RepaintGraphWindow();
812 return 0;
813}
814
815/*
816 * Convert to a bitstream
817 */
818int CmdBitstream(const char *Cmd)
819{
820 int i, j;
821 int bit;
822 int gtl;
823 int clock;
824 int low = 0;
825 int high = 0;
826 int hithigh, hitlow, first;
827
828 /* Detect high and lows and clock */
829 for (i = 0; i < GraphTraceLen; ++i)
830 {
831 if (GraphBuffer[i] > high)
832 high = GraphBuffer[i];
833 else if (GraphBuffer[i] < low)
834 low = GraphBuffer[i];
835 }
836
837 /* Get our clock */
f3bf15e4 838 clock = GetAskClock(Cmd, high, 1);
7fe9b0b7 839 gtl = ClearGraph(0);
840
841 bit = 0;
842 for (i = 0; i < (int)(gtl / clock); ++i)
843 {
844 hithigh = 0;
845 hitlow = 0;
846 first = 1;
847 /* Find out if we hit both high and low peaks */
848 for (j = 0; j < clock; ++j)
849 {
850 if (GraphBuffer[(i * clock) + j] == high)
851 hithigh = 1;
852 else if (GraphBuffer[(i * clock) + j] == low)
853 hitlow = 1;
854 /* it doesn't count if it's the first part of our read
855 because it's really just trailing from the last sequence */
856 if (first && (hithigh || hitlow))
857 hithigh = hitlow = 0;
858 else
859 first = 0;
860
861 if (hithigh && hitlow)
862 break;
863 }
864
865 /* If we didn't hit both high and low peaks, we had a bit transition */
866 if (!hithigh || !hitlow)
867 bit ^= 1;
868
869 AppendGraph(0, clock, bit);
7fe9b0b7 870 }
ba1a299c 871
7fe9b0b7 872 RepaintGraphWindow();
873 return 0;
874}
875
876int CmdBuffClear(const char *Cmd)
877{
878 UsbCommand c = {CMD_BUFF_CLEAR};
879 SendCommand(&c);
880 ClearGraph(true);
881 return 0;
882}
883
884int CmdDec(const char *Cmd)
885{
886 for (int i = 0; i < (GraphTraceLen / 2); ++i)
887 GraphBuffer[i] = GraphBuffer[i * 2];
888 GraphTraceLen /= 2;
889 PrintAndLog("decimated by 2");
890 RepaintGraphWindow();
891 return 0;
892}
698b649e
MHS
893/**
894 * Undecimate - I'd call it 'interpolate', but we'll save that
895 * name until someone does an actual interpolation command, not just
896 * blindly repeating samples
897 * @param Cmd
898 * @return
899 */
900int CmdUndec(const char *Cmd)
901{
c856ceae
MHS
902 if(param_getchar(Cmd, 0) == 'h')
903 {
904 PrintAndLog("Usage: data undec [factor]");
905 PrintAndLog("This function performs un-decimation, by repeating each sample N times");
906 PrintAndLog("Options: ");
907 PrintAndLog(" h This help");
908 PrintAndLog(" factor The number of times to repeat each sample.[default:2]");
909 PrintAndLog("Example: 'data undec 3'");
910 return 0;
911 }
912
913 uint8_t factor = param_get8ex(Cmd, 0,2, 10);
698b649e
MHS
914 //We have memory, don't we?
915 int swap[MAX_GRAPH_TRACE_LEN] = { 0 };
c856ceae
MHS
916 uint32_t g_index = 0 ,s_index = 0;
917 while(g_index < GraphTraceLen && s_index < MAX_GRAPH_TRACE_LEN)
698b649e 918 {
c856ceae
MHS
919 int count = 0;
920 for(count = 0; count < factor && s_index+count < MAX_GRAPH_TRACE_LEN; count ++)
921 swap[s_index+count] = GraphBuffer[g_index];
922 s_index+=count;
698b649e 923 }
698b649e 924
c856ceae
MHS
925 memcpy(GraphBuffer,swap, s_index * sizeof(int));
926 GraphTraceLen = s_index;
927 RepaintGraphWindow();
698b649e
MHS
928 return 0;
929}
7fe9b0b7 930
ec75f5c1 931//by marshmellow
932//shift graph zero up or down based on input + or -
933int CmdGraphShiftZero(const char *Cmd)
934{
935
936 int shift=0;
937 //set options from parameters entered with the command
938 sscanf(Cmd, "%i", &shift);
939 int shiftedVal=0;
940 for(int i = 0; i<GraphTraceLen; i++){
941 shiftedVal=GraphBuffer[i]+shift;
942 if (shiftedVal>127)
943 shiftedVal=127;
944 else if (shiftedVal<-127)
945 shiftedVal=-127;
946 GraphBuffer[i]= shiftedVal;
947 }
948 CmdNorm("");
949 return 0;
950}
951
6de43508 952//by marshmellow
953//use large jumps in read samples to identify edges of waves and then amplify that wave to max
954//similar to dirtheshold, threshold, and askdemod commands
955//takes a threshold length which is the measured length between two samples then determines an edge
956int CmdAskEdgeDetect(const char *Cmd)
957{
958 int thresLen = 25;
959 sscanf(Cmd, "%i", &thresLen);
960 int shift = 127;
961 int shiftedVal=0;
962 for(int i = 1; i<GraphTraceLen; i++){
963 if (GraphBuffer[i]-GraphBuffer[i-1]>=thresLen) //large jump up
964 shift=127;
965 else if(GraphBuffer[i]-GraphBuffer[i-1]<=-1*thresLen) //large jump down
966 shift=-127;
967
968 shiftedVal=GraphBuffer[i]+shift;
969
970 if (shiftedVal>127)
971 shiftedVal=127;
972 else if (shiftedVal<-127)
973 shiftedVal=-127;
974 GraphBuffer[i-1] = shiftedVal;
975 }
976 RepaintGraphWindow();
977 //CmdNorm("");
978 return 0;
979}
980
7fe9b0b7 981/* Print our clock rate */
ba1a299c 982// uses data from graphbuffer
f3bf15e4 983// adjusted to take char parameter for type of modulation to find the clock - by marshmellow.
7fe9b0b7 984int CmdDetectClockRate(const char *Cmd)
985{
f3bf15e4 986 char cmdp = param_getchar(Cmd, 0);
987 if (strlen(Cmd) > 3 || strlen(Cmd) == 0 || cmdp == 'h' || cmdp == 'H') {
988 PrintAndLog("Usage: data detectclock [modulation]");
989 PrintAndLog(" [modulation as char], specify the modulation type you want to detect the clock of");
990 PrintAndLog(" 'a' = ask, 'f' = fsk, 'n' = nrz/direct, 'p' = psk");
991 PrintAndLog("");
992 PrintAndLog(" sample: data detectclock a = detect the clock of an ask modulated wave in the GraphBuffer");
993 PrintAndLog(" data detectclock f = detect the clock of an fsk modulated wave in the GraphBuffer");
994 PrintAndLog(" data detectclock p = detect the clock of an psk modulated wave in the GraphBuffer");
995 PrintAndLog(" data detectclock n = detect the clock of an nrz/direct modulated wave in the GraphBuffer");
996 }
997 int ans=0;
998 if (cmdp == 'a'){
999 ans = GetAskClock("", true, false);
1000 } else if (cmdp == 'f'){
1001 ans = GetFskClock("", true, false);
1002 } else if (cmdp == 'n'){
1003 ans = GetNrzClock("", true, false);
1004 } else if (cmdp == 'p'){
1005 ans = GetPskClock("", true, false);
1006 } else {
1007 PrintAndLog ("Please specify a valid modulation to detect the clock of - see option h for help");
1008 }
1009 return ans;
7fe9b0b7 1010}
66707a3b 1011
2fc2150e 1012//by marshmellow
eb191de6 1013//fsk raw demod and print binary
6de43508 1014//takes 4 arguments - Clock, invert, fchigh, fclow
1015//defaults: clock = 50, invert=1, fchigh=10, fclow=8 (RF/10 RF/8 (fsk2a))
4ac906d1 1016int FSKrawDemod(const char *Cmd, bool verbose)
b3b70669 1017{
eb191de6 1018 //raw fsk demod no manchester decoding no start bit finding just get binary from wave
b3b70669 1019 //set defaults
03e6bb4a 1020 int rfLen = 0;
4ac906d1 1021 int invert = 0;
1022 int fchigh = 0;
1023 int fclow = 0;
1024
b3b70669 1025 //set options from parameters entered with the command
b4fb11ba 1026 sscanf(Cmd, "%i %i %i %i", &rfLen, &invert, &fchigh, &fclow);
ba1a299c 1027
b3b70669 1028 if (strlen(Cmd)>0 && strlen(Cmd)<=2) {
b3b70669 1029 if (rfLen==1){
1030 invert=1; //if invert option only is used
03e6bb4a 1031 rfLen = 0;
1032 }
b4fb11ba 1033 }
03e6bb4a 1034
eb191de6 1035 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
b4fb11ba 1036 size_t BitLen = getFromGraphBuf(BitStream);
e770c648 1037 if (BitLen==0) return 0;
03e6bb4a 1038 //get field clock lengths
1039 uint16_t fcs=0;
e770c648 1040 uint8_t dummy=0;
03e6bb4a 1041 if (fchigh==0 || fclow == 0){
4ac906d1 1042 fcs = countFC(BitStream, BitLen, &dummy);
03e6bb4a 1043 if (fcs==0){
1044 fchigh=10;
1045 fclow=8;
1046 }else{
1047 fchigh = (fcs >> 8) & 0xFF;
1048 fclow = fcs & 0xFF;
1049 }
1050 }
1051 //get bit clock length
1052 if (rfLen==0){
1053 rfLen = detectFSKClk(BitStream, BitLen, fchigh, fclow);
1054 if (rfLen == 0) rfLen = 50;
1055 }
4ac906d1 1056 if (verbose) PrintAndLog("Args invert: %d - Clock:%d - fchigh:%d - fclow: %d",invert,rfLen,fchigh, fclow);
b4fb11ba 1057 int size = fskdemod(BitStream,BitLen,(uint8_t)rfLen,(uint8_t)invert,(uint8_t)fchigh,(uint8_t)fclow);
d5a72d2f 1058 if (size>0){
b4fb11ba 1059 setDemodBuf(BitStream,size,0);
ba1a299c 1060
d5a72d2f 1061 // Now output the bitstream to the scrollback by line of 16 bits
1062 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
4ac906d1 1063 if (verbose) {
1064 PrintAndLog("FSK decoded bitstream:");
1065 printBitStream(BitStream,size);
1066 }
3f41e73c 1067
e770c648 1068 return 1;
d5a72d2f 1069 } else{
4ac906d1 1070 if (verbose) PrintAndLog("no FSK data found");
eb191de6 1071 }
b3b70669 1072 return 0;
1073}
1074
4ac906d1 1075//by marshmellow
1076//fsk raw demod and print binary
1077//takes 4 arguments - Clock, invert, fchigh, fclow
1078//defaults: clock = 50, invert=1, fchigh=10, fclow=8 (RF/10 RF/8 (fsk2a))
1079int CmdFSKrawdemod(const char *Cmd)
1080{
1081 char cmdp = param_getchar(Cmd, 0);
1082 if (strlen(Cmd) > 10 || cmdp == 'h' || cmdp == 'H') {
1083 PrintAndLog("Usage: data rawdemod fs [clock] <invert> [fchigh] [fclow]");
1084 PrintAndLog(" [set clock as integer] optional, omit for autodetect.");
1085 PrintAndLog(" <invert>, 1 for invert output, can be used even if the clock is omitted");
1086 PrintAndLog(" [fchigh], larger field clock length, omit for autodetect");
1087 PrintAndLog(" [fclow], small field clock length, omit for autodetect");
1088 PrintAndLog("");
1089 PrintAndLog(" sample: data rawdemod fs = demod an fsk tag from GraphBuffer using autodetect");
1090 PrintAndLog(" : data rawdemod fs 32 = demod an fsk tag from GraphBuffer using a clock of RF/32, autodetect fc");
1091 PrintAndLog(" : data rawdemod fs 1 = demod an fsk tag from GraphBuffer using autodetect, invert output");
1092 PrintAndLog(" : data rawdemod fs 32 1 = demod an fsk tag from GraphBuffer using a clock of RF/32, invert output, autodetect fc");
1093 PrintAndLog(" : data rawdemod fs 64 0 8 5 = demod an fsk1 RF/64 tag from GraphBuffer");
1094 PrintAndLog(" : data rawdemod fs 50 0 10 8 = demod an fsk2 RF/50 tag from GraphBuffer");
1095 PrintAndLog(" : data rawdemod fs 50 1 10 8 = demod an fsk2a RF/50 tag from GraphBuffer");
1096 return 0;
1097 }
1098 return FSKrawDemod(Cmd, TRUE);
1099}
1100
eb191de6 1101//by marshmellow (based on existing demod + holiman's refactor)
1102//HID Prox demod - FSK RF/50 with preamble of 00011101 (then manchester encoded)
1103//print full HID Prox ID and some bit format details if found
b3b70669 1104int CmdFSKdemodHID(const char *Cmd)
1105{
1106 //raw fsk demod no manchester decoding no start bit finding just get binary from wave
b3b70669 1107 uint32_t hi2=0, hi=0, lo=0;
ba1a299c 1108
eb191de6 1109 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
b4fb11ba 1110 size_t BitLen = getFromGraphBuf(BitStream);
1111 if (BitLen==0) return 0;
b3b70669 1112 //get binary from fsk wave
b4fb11ba 1113 int idx = HIDdemodFSK(BitStream,&BitLen,&hi2,&hi,&lo);
ec75f5c1 1114 if (idx<0){
a1d17964 1115 if (g_debugMode){
1116 if (idx==-1){
b4fb11ba 1117 PrintAndLog("DEBUG: Just Noise Detected");
a1d17964 1118 } else if (idx == -2) {
1119 PrintAndLog("DEBUG: Error demoding fsk");
1120 } else if (idx == -3) {
1121 PrintAndLog("DEBUG: Preamble not found");
1122 } else if (idx == -4) {
1123 PrintAndLog("DEBUG: Error in Manchester data, SIZE: %d", BitLen);
1124 } else {
1125 PrintAndLog("DEBUG: Error demoding fsk %d", idx);
1126 }
1127 }
ec75f5c1 1128 return 0;
1129 }
1130 if (hi2==0 && hi==0 && lo==0) {
1131 if (g_debugMode) PrintAndLog("DEBUG: Error - no values found");
eb191de6 1132 return 0;
1133 }
1134 if (hi2 != 0){ //extra large HID tags
b4fb11ba 1135 PrintAndLog("HID Prox TAG ID: %x%08x%08x (%d)",
eb191de6 1136 (unsigned int) hi2, (unsigned int) hi, (unsigned int) lo, (unsigned int) (lo>>1) & 0xFFFF);
1137 }
1138 else { //standard HID tags <38 bits
d5a72d2f 1139 uint8_t fmtLen = 0;
eb191de6 1140 uint32_t fc = 0;
1141 uint32_t cardnum = 0;
1142 if (((hi>>5)&1)==1){//if bit 38 is set then < 37 bit format is used
1143 uint32_t lo2=0;
84871873 1144 lo2=(((hi & 31) << 12) | (lo>>20)); //get bits 21-37 to check for format len bit
eb191de6 1145 uint8_t idx3 = 1;
1146 while(lo2>1){ //find last bit set to 1 (format len bit)
1147 lo2=lo2>>1;
1148 idx3++;
b3b70669 1149 }
b4fb11ba 1150 fmtLen =idx3+19;
eb191de6 1151 fc =0;
1152 cardnum=0;
d5a72d2f 1153 if(fmtLen==26){
eb191de6 1154 cardnum = (lo>>1)&0xFFFF;
1155 fc = (lo>>17)&0xFF;
1156 }
d5a72d2f 1157 if(fmtLen==34){
eb191de6 1158 cardnum = (lo>>1)&0xFFFF;
1159 fc= ((hi&1)<<15)|(lo>>17);
1160 }
d5a72d2f 1161 if(fmtLen==35){
eb191de6 1162 cardnum = (lo>>1)&0xFFFFF;
1163 fc = ((hi&1)<<11)|(lo>>21);
b3b70669 1164 }
b3b70669 1165 }
eb191de6 1166 else { //if bit 38 is not set then 37 bit format is used
84871873 1167 fmtLen = 37;
1168 fc = 0;
1169 cardnum = 0;
1170 if(fmtLen == 37){
eb191de6 1171 cardnum = (lo>>1)&0x7FFFF;
1172 fc = ((hi&0xF)<<12)|(lo>>20);
1173 }
b4fb11ba 1174 }
1175 PrintAndLog("HID Prox TAG ID: %x%08x (%d) - Format Len: %dbit - FC: %d - Card: %d",
eb191de6 1176 (unsigned int) hi, (unsigned int) lo, (unsigned int) (lo>>1) & 0xFFFF,
d5a72d2f 1177 (unsigned int) fmtLen, (unsigned int) fc, (unsigned int) cardnum);
b3b70669 1178 }
ec75f5c1 1179 setDemodBuf(BitStream,BitLen,idx);
1180 if (g_debugMode){
1181 PrintAndLog("DEBUG: idx: %d, Len: %d, Printing Demod Buffer:", idx, BitLen);
1182 printDemodBuff();
1183 }
1184 return 1;
1185}
1186
04d2721b 1187//by marshmellow
1188//Paradox Prox demod - FSK RF/50 with preamble of 00001111 (then manchester encoded)
ec75f5c1 1189//print full Paradox Prox ID and some bit format details if found
1190int CmdFSKdemodParadox(const char *Cmd)
1191{
1192 //raw fsk demod no manchester decoding no start bit finding just get binary from wave
1193 uint32_t hi2=0, hi=0, lo=0;
1194
1195 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
1196 size_t BitLen = getFromGraphBuf(BitStream);
e770c648 1197 if (BitLen==0) return 0;
ec75f5c1 1198 //get binary from fsk wave
a1d17964 1199 int idx = ParadoxdemodFSK(BitStream,&BitLen,&hi2,&hi,&lo);
ec75f5c1 1200 if (idx<0){
a1d17964 1201 if (g_debugMode){
1202 if (idx==-1){
1203 PrintAndLog("DEBUG: Just Noise Detected");
1204 } else if (idx == -2) {
1205 PrintAndLog("DEBUG: Error demoding fsk");
1206 } else if (idx == -3) {
1207 PrintAndLog("DEBUG: Preamble not found");
1208 } else if (idx == -4) {
1209 PrintAndLog("DEBUG: Error in Manchester data");
1210 } else {
1211 PrintAndLog("DEBUG: Error demoding fsk %d", idx);
1212 }
1213 }
ec75f5c1 1214 return 0;
1215 }
1216 if (hi2==0 && hi==0 && lo==0){
1217 if (g_debugMode) PrintAndLog("DEBUG: Error - no value found");
1218 return 0;
1219 }
1220 uint32_t fc = ((hi & 0x3)<<6) | (lo>>26);
1221 uint32_t cardnum = (lo>>10)&0xFFFF;
abd6112f 1222 uint32_t rawLo = bytebits_to_byte(BitStream+idx+64,32);
1223 uint32_t rawHi = bytebits_to_byte(BitStream+idx+32,32);
1224 uint32_t rawHi2 = bytebits_to_byte(BitStream+idx,32);
1225
1226 PrintAndLog("Paradox TAG ID: %x%08x - FC: %d - Card: %d - Checksum: %02x - RAW: %08x%08x%08x",
1227 hi>>10, (hi & 0x3)<<26 | (lo>>10), fc, cardnum, (lo>>2) & 0xFF, rawHi2, rawHi, rawLo);
ec75f5c1 1228 setDemodBuf(BitStream,BitLen,idx);
1229 if (g_debugMode){
1230 PrintAndLog("DEBUG: idx: %d, len: %d, Printing Demod Buffer:", idx, BitLen);
1231 printDemodBuff();
1232 }
1233 return 1;
b3b70669 1234}
1235
2fc2150e 1236//by marshmellow
eb191de6 1237//IO-Prox demod - FSK RF/64 with preamble of 000000001
1238//print ioprox ID and some format details
b3b70669 1239int CmdFSKdemodIO(const char *Cmd)
1240{
1241 //raw fsk demod no manchester decoding no start bit finding just get binary from wave
1242 //set defaults
b4fb11ba 1243 int idx=0;
ec75f5c1 1244 //something in graphbuffer?
1245 if (GraphTraceLen < 65) {
1246 if (g_debugMode)PrintAndLog("DEBUG: not enough samples in GraphBuffer");
1247 return 0;
1248 }
eb191de6 1249 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
b4fb11ba 1250 size_t BitLen = getFromGraphBuf(BitStream);
e770c648 1251 if (BitLen==0) return 0;
ec75f5c1 1252
eb191de6 1253 //get binary from fsk wave
b4fb11ba 1254 idx = IOdemodFSK(BitStream,BitLen);
eb191de6 1255 if (idx<0){
a1d17964 1256 if (g_debugMode){
1257 if (idx==-1){
1258 PrintAndLog("DEBUG: Just Noise Detected");
1259 } else if (idx == -2) {
1260 PrintAndLog("DEBUG: not enough samples");
1261 } else if (idx == -3) {
1262 PrintAndLog("DEBUG: error during fskdemod");
1263 } else if (idx == -4) {
1264 PrintAndLog("DEBUG: Preamble not found");
1265 } else if (idx == -5) {
1266 PrintAndLog("DEBUG: Separator bits not found");
1267 } else {
1268 PrintAndLog("DEBUG: Error demoding fsk %d", idx);
1269 }
1270 }
eb191de6 1271 return 0;
1272 }
1273 if (idx==0){
ec75f5c1 1274 if (g_debugMode==1){
1275 PrintAndLog("DEBUG: IO Prox Data not found - FSK Bits: %d",BitLen);
1276 if (BitLen > 92) printBitStream(BitStream,92);
1277 }
d5a72d2f 1278 return 0;
b3b70669 1279 }
b3b70669 1280 //Index map
1281 //0 10 20 30 40 50 60
1282 //| | | | | | |
1283 //01234567 8 90123456 7 89012345 6 78901234 5 67890123 4 56789012 3 45678901 23
1284 //-----------------------------------------------------------------------------
1285 //00000000 0 11110000 1 facility 1 version* 1 code*one 1 code*two 1 ???????? 11
1286 //
1287 //XSF(version)facility:codeone+codetwo (raw)
1288 //Handle the data
ec75f5c1 1289 if (idx+64>BitLen) {
1290 if (g_debugMode==1) PrintAndLog("not enough bits found - bitlen: %d",BitLen);
1291 return 0;
1292 }
eb191de6 1293 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]);
b4fb11ba 1294 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 1295 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]);
1296 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]);
1297 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]);
1298 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]);
1299 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 1300
eb191de6 1301 uint32_t code = bytebits_to_byte(BitStream+idx,32);
b4fb11ba 1302 uint32_t code2 = bytebits_to_byte(BitStream+idx+32,32);
f822a063 1303 uint8_t version = bytebits_to_byte(BitStream+idx+27,8); //14,4
1304 uint8_t facilitycode = bytebits_to_byte(BitStream+idx+18,8) ;
eb191de6 1305 uint16_t number = (bytebits_to_byte(BitStream+idx+36,8)<<8)|(bytebits_to_byte(BitStream+idx+45,8)); //36,9
b4fb11ba 1306 PrintAndLog("IO Prox XSF(%02d)%02x:%05d (%08x%08x)",version,facilitycode,number,code,code2);
ec75f5c1 1307 setDemodBuf(BitStream,64,idx);
b4fb11ba 1308 if (g_debugMode){
ec75f5c1 1309 PrintAndLog("DEBUG: idx: %d, Len: %d, Printing demod buffer:",idx,64);
1310 printDemodBuff();
1311 }
b4fb11ba 1312 return 1;
b3b70669 1313}
1e090a61 1314
1e090a61 1315//by marshmellow
1316//AWID Prox demod - FSK RF/50 with preamble of 00000001 (always a 96 bit data stream)
1317//print full AWID Prox ID and some bit format details if found
1318int CmdFSKdemodAWID(const char *Cmd)
1319{
1320
ec75f5c1 1321 //int verbose=1;
1322 //sscanf(Cmd, "%i", &verbose);
1e090a61 1323
1324 //raw fsk demod no manchester decoding no start bit finding just get binary from wave
1325 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
1326 size_t size = getFromGraphBuf(BitStream);
e770c648 1327 if (size==0) return 0;
1e090a61 1328
1329 //get binary from fsk wave
a1d17964 1330 int idx = AWIDdemodFSK(BitStream, &size);
1e090a61 1331 if (idx<=0){
ec75f5c1 1332 if (g_debugMode==1){
1e090a61 1333 if (idx == -1)
ec75f5c1 1334 PrintAndLog("DEBUG: Error - not enough samples");
1e090a61 1335 else if (idx == -2)
a1d17964 1336 PrintAndLog("DEBUG: Error - only noise found");
1e090a61 1337 else if (idx == -3)
ec75f5c1 1338 PrintAndLog("DEBUG: Error - problem during FSK demod");
1e090a61 1339 else if (idx == -4)
ec75f5c1 1340 PrintAndLog("DEBUG: Error - AWID preamble not found");
1341 else if (idx == -5)
a1d17964 1342 PrintAndLog("DEBUG: Error - Size not correct: %d", size);
ec75f5c1 1343 else
1344 PrintAndLog("DEBUG: Error %d",idx);
1e090a61 1345 }
1346 return 0;
1347 }
1348
1349 // Index map
1350 // 0 10 20 30 40 50 60
1351 // | | | | | | |
1352 // 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
1353 // -----------------------------------------------------------------------------
1354 // 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
1355 // 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
1356 // |---26 bit---| |-----117----||-------------142-------------|
1357 // b = format bit len, o = odd parity of last 3 bits
1358 // f = facility code, c = card number
1359 // w = wiegand parity
1360 // (26 bit format shown)
1361
1362 //get raw ID before removing parities
1363 uint32_t rawLo = bytebits_to_byte(BitStream+idx+64,32);
1364 uint32_t rawHi = bytebits_to_byte(BitStream+idx+32,32);
1365 uint32_t rawHi2 = bytebits_to_byte(BitStream+idx,32);
ec75f5c1 1366 setDemodBuf(BitStream,96,idx);
1367
1e090a61 1368 size = removeParity(BitStream, idx+8, 4, 1, 88);
1369 if (size != 66){
ec75f5c1 1370 if (g_debugMode==1) PrintAndLog("DEBUG: Error - at parity check-tag size does not match AWID format");
1e090a61 1371 return 0;
1372 }
1373 // ok valid card found!
1374
1375 // Index map
1376 // 0 10 20 30 40 50 60
1377 // | | | | | | |
1378 // 01234567 8 90123456 7890123456789012 3 456789012345678901234567890123456
1379 // -----------------------------------------------------------------------------
1380 // 00011010 1 01110101 0000000010001110 1 000000000000000000000000000000000
1381 // bbbbbbbb w ffffffff cccccccccccccccc w xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
1382 // |26 bit| |-117--| |-----142------|
1383 // b = format bit len, o = odd parity of last 3 bits
1384 // f = facility code, c = card number
1385 // w = wiegand parity
1386 // (26 bit format shown)
1387
1388 uint32_t fc = 0;
1389 uint32_t cardnum = 0;
1390 uint32_t code1 = 0;
1391 uint32_t code2 = 0;
1392 uint8_t fmtLen = bytebits_to_byte(BitStream,8);
1393 if (fmtLen==26){
1394 fc = bytebits_to_byte(BitStream+9, 8);
1395 cardnum = bytebits_to_byte(BitStream+17, 16);
1396 code1 = bytebits_to_byte(BitStream+8,fmtLen);
abd6112f 1397 PrintAndLog("AWID Found - BitLength: %d, FC: %d, Card: %d - Wiegand: %x, Raw: %08x%08x%08x", fmtLen, fc, cardnum, code1, rawHi2, rawHi, rawLo);
1e090a61 1398 } else {
1399 cardnum = bytebits_to_byte(BitStream+8+(fmtLen-17), 16);
1400 if (fmtLen>32){
1401 code1 = bytebits_to_byte(BitStream+8,fmtLen-32);
1402 code2 = bytebits_to_byte(BitStream+8+(fmtLen-32),32);
abd6112f 1403 PrintAndLog("AWID Found - BitLength: %d -unknown BitLength- (%d) - Wiegand: %x%08x, Raw: %08x%08x%08x", fmtLen, cardnum, code1, code2, rawHi2, rawHi, rawLo);
1e090a61 1404 } else{
1405 code1 = bytebits_to_byte(BitStream+8,fmtLen);
abd6112f 1406 PrintAndLog("AWID Found - BitLength: %d -unknown BitLength- (%d) - Wiegand: %x, Raw: %08x%08x%08x", fmtLen, cardnum, code1, rawHi2, rawHi, rawLo);
1e090a61 1407 }
1408 }
ec75f5c1 1409 if (g_debugMode){
1410 PrintAndLog("DEBUG: idx: %d, Len: %d Printing Demod Buffer:", idx, 96);
1411 printDemodBuff();
1412 }
1e090a61 1413 //todo - convert hi2, hi, lo to demodbuffer for future sim/clone commands
1e090a61 1414 return 1;
1415}
1416
1417//by marshmellow
1418//Pyramid Prox demod - FSK RF/50 with preamble of 0000000000000001 (always a 128 bit data stream)
1419//print full Farpointe Data/Pyramid Prox ID and some bit format details if found
1420int CmdFSKdemodPyramid(const char *Cmd)
1421{
1e090a61 1422 //raw fsk demod no manchester decoding no start bit finding just get binary from wave
1423 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
1424 size_t size = getFromGraphBuf(BitStream);
e770c648 1425 if (size==0) return 0;
1e090a61 1426
1427 //get binary from fsk wave
a1d17964 1428 int idx = PyramiddemodFSK(BitStream, &size);
1e090a61 1429 if (idx < 0){
ec75f5c1 1430 if (g_debugMode==1){
1e090a61 1431 if (idx == -5)
ec75f5c1 1432 PrintAndLog("DEBUG: Error - not enough samples");
1e090a61 1433 else if (idx == -1)
a1d17964 1434 PrintAndLog("DEBUG: Error - only noise found");
1e090a61 1435 else if (idx == -2)
ec75f5c1 1436 PrintAndLog("DEBUG: Error - problem during FSK demod");
1437 else if (idx == -3)
a1d17964 1438 PrintAndLog("DEBUG: Error - Size not correct: %d", size);
1e090a61 1439 else if (idx == -4)
ec75f5c1 1440 PrintAndLog("DEBUG: Error - Pyramid preamble not found");
1441 else
1442 PrintAndLog("DEBUG: Error - idx: %d",idx);
1e090a61 1443 }
1e090a61 1444 return 0;
1445 }
1e090a61 1446 // Index map
1447 // 0 10 20 30 40 50 60
1448 // | | | | | | |
1449 // 0123456 7 8901234 5 6789012 3 4567890 1 2345678 9 0123456 7 8901234 5 6789012 3
1450 // -----------------------------------------------------------------------------
1451 // 0000000 0 0000000 1 0000000 1 0000000 1 0000000 1 0000000 1 0000000 1 0000000 1
1452 // premable xxxxxxx o xxxxxxx o xxxxxxx o xxxxxxx o xxxxxxx o xxxxxxx o xxxxxxx o
1453
1454 // 64 70 80 90 100 110 120
1455 // | | | | | | |
1456 // 4567890 1 2345678 9 0123456 7 8901234 5 6789012 3 4567890 1 2345678 9 0123456 7
1457 // -----------------------------------------------------------------------------
1458 // 0000000 1 0000000 1 0000000 1 0110111 0 0011000 1 0000001 0 0001100 1 1001010 0
1459 // xxxxxxx o xxxxxxx o xxxxxxx o xswffff o ffffccc o ccccccc o ccccccw o ppppppp o
1460 // |---115---||---------71---------|
1461 // s = format start bit, o = odd parity of last 7 bits
1462 // f = facility code, c = card number
1463 // w = wiegand parity, x = extra space for other formats
1464 // p = unknown checksum
1465 // (26 bit format shown)
73d04bb4 1466
1467 //get bytes for checksum calc
1468 uint8_t checksum = bytebits_to_byte(BitStream + idx + 120, 8);
1469 uint8_t csBuff[14] = {0x00};
1470 for (uint8_t i = 0; i < 13; i++){
1471 csBuff[i] = bytebits_to_byte(BitStream + idx + 16 + (i*8), 8);
1472 }
1473 //check checksum calc
1474 int checkCS = CRC8Maxim(csBuff,13);
1475
1e090a61 1476 //get raw ID before removing parities
1477 uint32_t rawLo = bytebits_to_byte(BitStream+idx+96,32);
1478 uint32_t rawHi = bytebits_to_byte(BitStream+idx+64,32);
1479 uint32_t rawHi2 = bytebits_to_byte(BitStream+idx+32,32);
1480 uint32_t rawHi3 = bytebits_to_byte(BitStream+idx,32);
ec75f5c1 1481 setDemodBuf(BitStream,128,idx);
1482
1e090a61 1483 size = removeParity(BitStream, idx+8, 8, 1, 120);
1484 if (size != 105){
73d04bb4 1485 if (g_debugMode==1)
1486 PrintAndLog("DEBUG: Error at parity check - tag size does not match Pyramid format, SIZE: %d, IDX: %d, hi3: %x",size, idx, rawHi3);
1e090a61 1487 return 0;
1488 }
1489
1490 // ok valid card found!
1491
1492 // Index map
1493 // 0 10 20 30 40 50 60 70
1494 // | | | | | | | |
1495 // 01234567890123456789012345678901234567890123456789012345678901234567890
1496 // -----------------------------------------------------------------------
1497 // 00000000000000000000000000000000000000000000000000000000000000000000000
1498 // xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
1499
1500 // 71 80 90 100
1501 // | | | |
1502 // 1 2 34567890 1234567890123456 7 8901234
1503 // ---------------------------------------
1504 // 1 1 01110011 0000000001000110 0 1001010
1505 // s w ffffffff cccccccccccccccc w ppppppp
1506 // |--115-| |------71------|
1507 // s = format start bit, o = odd parity of last 7 bits
1508 // f = facility code, c = card number
1509 // w = wiegand parity, x = extra space for other formats
1510 // p = unknown checksum
1511 // (26 bit format shown)
1512
1513 //find start bit to get fmtLen
1e090a61 1514 int j;
1515 for (j=0; j<size; j++){
ec75f5c1 1516 if(BitStream[j]) break;
1e090a61 1517 }
1518 uint8_t fmtLen = size-j-8;
1519 uint32_t fc = 0;
1520 uint32_t cardnum = 0;
1521 uint32_t code1 = 0;
1522 //uint32_t code2 = 0;
1523 if (fmtLen==26){
1524 fc = bytebits_to_byte(BitStream+73, 8);
1525 cardnum = bytebits_to_byte(BitStream+81, 16);
1526 code1 = bytebits_to_byte(BitStream+72,fmtLen);
abd6112f 1527 PrintAndLog("Pyramid ID Found - BitLength: %d, FC: %d, Card: %d - Wiegand: %x, Raw: %08x%08x%08x%08x", fmtLen, fc, cardnum, code1, rawHi3, rawHi2, rawHi, rawLo);
1e090a61 1528 } else if (fmtLen==45){
1529 fmtLen=42; //end = 10 bits not 7 like 26 bit fmt
1530 fc = bytebits_to_byte(BitStream+53, 10);
1531 cardnum = bytebits_to_byte(BitStream+63, 32);
abd6112f 1532 PrintAndLog("Pyramid ID Found - BitLength: %d, FC: %d, Card: %d - Raw: %08x%08x%08x%08x", fmtLen, fc, cardnum, rawHi3, rawHi2, rawHi, rawLo);
1e090a61 1533 } else {
1534 cardnum = bytebits_to_byte(BitStream+81, 16);
1535 if (fmtLen>32){
1536 //code1 = bytebits_to_byte(BitStream+(size-fmtLen),fmtLen-32);
1537 //code2 = bytebits_to_byte(BitStream+(size-32),32);
abd6112f 1538 PrintAndLog("Pyramid ID Found - BitLength: %d -unknown BitLength- (%d), Raw: %08x%08x%08x%08x", fmtLen, cardnum, rawHi3, rawHi2, rawHi, rawLo);
1e090a61 1539 } else{
1540 //code1 = bytebits_to_byte(BitStream+(size-fmtLen),fmtLen);
abd6112f 1541 PrintAndLog("Pyramid ID Found - BitLength: %d -unknown BitLength- (%d), Raw: %08x%08x%08x%08x", fmtLen, cardnum, rawHi3, rawHi2, rawHi, rawLo);
1e090a61 1542 }
1543 }
73d04bb4 1544 if (checksum == checkCS)
1545 PrintAndLog("Checksum %02x passed", checksum);
1546 else
1547 PrintAndLog("Checksum %02x failed - should have been %02x", checksum, checkCS);
1548
ec75f5c1 1549 if (g_debugMode){
1550 PrintAndLog("DEBUG: idx: %d, Len: %d, Printing Demod Buffer:", idx, 128);
1551 printDemodBuff();
1552 }
1e090a61 1553 return 1;
1554}
1555
e888ed8e 1556int CmdFSKdemod(const char *Cmd) //old CmdFSKdemod needs updating
7fe9b0b7 1557{
1558 static const int LowTone[] = {
1559 1, 1, 1, 1, 1, -1, -1, -1, -1, -1,
1560 1, 1, 1, 1, 1, -1, -1, -1, -1, -1,
1561 1, 1, 1, 1, 1, -1, -1, -1, -1, -1,
1562 1, 1, 1, 1, 1, -1, -1, -1, -1, -1,
1563 1, 1, 1, 1, 1, -1, -1, -1, -1, -1
1564 };
1565 static const int HighTone[] = {
1566 1, 1, 1, 1, 1, -1, -1, -1, -1,
1567 1, 1, 1, 1, -1, -1, -1, -1,
1568 1, 1, 1, 1, -1, -1, -1, -1,
1569 1, 1, 1, 1, -1, -1, -1, -1,
1570 1, 1, 1, 1, -1, -1, -1, -1,
1571 1, 1, 1, 1, -1, -1, -1, -1, -1,
1572 };
1573
1574 int lowLen = sizeof (LowTone) / sizeof (int);
1575 int highLen = sizeof (HighTone) / sizeof (int);
b915fda3 1576 int convLen = (highLen > lowLen) ? highLen : lowLen;
7fe9b0b7 1577 uint32_t hi = 0, lo = 0;
1578
1579 int i, j;
1580 int minMark = 0, maxMark = 0;
952a8bb5 1581
7fe9b0b7 1582 for (i = 0; i < GraphTraceLen - convLen; ++i) {
1583 int lowSum = 0, highSum = 0;
1584
1585 for (j = 0; j < lowLen; ++j) {
1586 lowSum += LowTone[j]*GraphBuffer[i+j];
1587 }
1588 for (j = 0; j < highLen; ++j) {
1589 highSum += HighTone[j] * GraphBuffer[i + j];
1590 }
1591 lowSum = abs(100 * lowSum / lowLen);
1592 highSum = abs(100 * highSum / highLen);
1593 GraphBuffer[i] = (highSum << 16) | lowSum;
1594 }
1595
1596 for(i = 0; i < GraphTraceLen - convLen - 16; ++i) {
1597 int lowTot = 0, highTot = 0;
1598 // 10 and 8 are f_s divided by f_l and f_h, rounded
1599 for (j = 0; j < 10; ++j) {
1600 lowTot += (GraphBuffer[i+j] & 0xffff);
1601 }
1602 for (j = 0; j < 8; j++) {
1603 highTot += (GraphBuffer[i + j] >> 16);
1604 }
1605 GraphBuffer[i] = lowTot - highTot;
1606 if (GraphBuffer[i] > maxMark) maxMark = GraphBuffer[i];
1607 if (GraphBuffer[i] < minMark) minMark = GraphBuffer[i];
1608 }
1609
1610 GraphTraceLen -= (convLen + 16);
1611 RepaintGraphWindow();
1612
b3b70669 1613 // Find bit-sync (3 lo followed by 3 high) (HID ONLY)
7fe9b0b7 1614 int max = 0, maxPos = 0;
1615 for (i = 0; i < 6000; ++i) {
1616 int dec = 0;
1617 for (j = 0; j < 3 * lowLen; ++j) {
1618 dec -= GraphBuffer[i + j];
1619 }
1620 for (; j < 3 * (lowLen + highLen ); ++j) {
1621 dec += GraphBuffer[i + j];
1622 }
1623 if (dec > max) {
1624 max = dec;
1625 maxPos = i;
1626 }
1627 }
1628
1629 // place start of bit sync marker in graph
1630 GraphBuffer[maxPos] = maxMark;
1631 GraphBuffer[maxPos + 1] = minMark;
1632
1633 maxPos += j;
1634
1635 // place end of bit sync marker in graph
1636 GraphBuffer[maxPos] = maxMark;
1637 GraphBuffer[maxPos+1] = minMark;
1638
1639 PrintAndLog("actual data bits start at sample %d", maxPos);
1640 PrintAndLog("length %d/%d", highLen, lowLen);
ba1a299c 1641
a1557c4c 1642 uint8_t bits[46] = {0x00};
ba1a299c 1643
7fe9b0b7 1644 // find bit pairs and manchester decode them
1645 for (i = 0; i < arraylen(bits) - 1; ++i) {
1646 int dec = 0;
1647 for (j = 0; j < lowLen; ++j) {
1648 dec -= GraphBuffer[maxPos + j];
1649 }
1650 for (; j < lowLen + highLen; ++j) {
1651 dec += GraphBuffer[maxPos + j];
1652 }
1653 maxPos += j;
1654 // place inter bit marker in graph
1655 GraphBuffer[maxPos] = maxMark;
1656 GraphBuffer[maxPos + 1] = minMark;
1657
1658 // hi and lo form a 64 bit pair
1659 hi = (hi << 1) | (lo >> 31);
1660 lo = (lo << 1);
1661 // store decoded bit as binary (in hi/lo) and text (in bits[])
1662 if(dec < 0) {
1663 bits[i] = '1';
1664 lo |= 1;
1665 } else {
1666 bits[i] = '0';
1667 }
1668 }
1669 PrintAndLog("bits: '%s'", bits);
1670 PrintAndLog("hex: %08x %08x", hi, lo);
1671 return 0;
1672}
e888ed8e 1673
e770c648 1674//by marshmellow
1675//attempt to psk1 demod graph buffer
4ac906d1 1676int PSKDemod(const char *Cmd, bool verbose)
e770c648 1677{
1678 int invert=0;
1679 int clk=0;
1680 int maxErr=100;
1681 sscanf(Cmd, "%i %i %i", &clk, &invert, &maxErr);
1682 if (clk==1){
1683 invert=1;
1684 clk=0;
1685 }
1686 if (invert != 0 && invert != 1) {
4ac906d1 1687 if (verbose) PrintAndLog("Invalid argument: %s", Cmd);
e770c648 1688 return -1;
1689 }
1690 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
1691 size_t BitLen = getFromGraphBuf(BitStream);
3f41e73c 1692 if (BitLen==0) return -1;
1693 uint8_t carrier=countPSK_FC(BitStream, BitLen);
ec9882b1 1694 if (carrier!=2 && carrier!=4 && carrier!=8){
3f41e73c 1695 //invalid carrier
ec9882b1 1696 return -1;
3f41e73c 1697 }
e770c648 1698 int errCnt=0;
3f41e73c 1699 errCnt = pskRawDemod(BitStream, &BitLen, &clk, &invert);
e770c648 1700 if (errCnt > maxErr){
4ac906d1 1701 if (g_debugMode==1 && verbose) PrintAndLog("Too many errors found, clk: %d, invert: %d, numbits: %d, errCnt: %d",clk,invert,BitLen,errCnt);
e770c648 1702 return -1;
1703 }
1704 if (errCnt<0|| BitLen<16){ //throw away static - allow 1 and -1 (in case of threshold command first)
4ac906d1 1705 if (g_debugMode==1 && verbose) PrintAndLog("no data found, clk: %d, invert: %d, numbits: %d, errCnt: %d",clk,invert,BitLen,errCnt);
e770c648 1706 return -1;
1707 }
1708 if (verbose) PrintAndLog("Tried PSK Demod using Clock: %d - invert: %d - Bits Found: %d",clk,invert,BitLen);
1709 //prime demod buffer for output
1710 setDemodBuf(BitStream,BitLen,0);
1711 return errCnt;
4118b74d 1712}
e770c648 1713
4118b74d 1714// Indala 26 bit decode
1715// by marshmellow
1716// optional arguments - same as CmdpskNRZrawDemod (clock & invert)
1717int CmdIndalaDecode(const char *Cmd)
1718{
b4fb11ba 1719 int ans;
1720 if (strlen(Cmd)>0){
1721 ans = PSKDemod(Cmd, 0);
1722 } else{ //default to RF/32
1723 ans = PSKDemod("32", 0);
1724 }
4118b74d 1725
ba1a299c 1726 if (ans < 0){
ec75f5c1 1727 if (g_debugMode==1)
b4fb11ba 1728 PrintAndLog("Error1: %d",ans);
ba1a299c 1729 return 0;
1730 }
1731 uint8_t invert=0;
1732 ans = indala26decode(DemodBuffer,(size_t *) &DemodBufferLen, &invert);
1733 if (ans < 1) {
ec75f5c1 1734 if (g_debugMode==1)
b4fb11ba 1735 PrintAndLog("Error2: %d",ans);
ba1a299c 1736 return -1;
1737 }
a1d17964 1738 char showbits[251]={0x00};
84871873 1739 if (invert)
b4fb11ba 1740 if (g_debugMode==1)
1741 PrintAndLog("Had to invert bits");
ec75f5c1 1742
ba1a299c 1743 //convert UID to HEX
1744 uint32_t uid1, uid2, uid3, uid4, uid5, uid6, uid7;
1745 int idx;
1746 uid1=0;
1747 uid2=0;
1748 PrintAndLog("BitLen: %d",DemodBufferLen);
1749 if (DemodBufferLen==64){
1750 for( idx=0; idx<64; idx++) {
1751 uid1=(uid1<<1)|(uid2>>31);
1752 if (DemodBuffer[idx] == 0) {
1753 uid2=(uid2<<1)|0;
1754 showbits[idx]='0';
1755 } else {
1756 uid2=(uid2<<1)|1;
1757 showbits[idx]='1';
1758 }
1759 }
1760 showbits[idx]='\0';
1761 PrintAndLog("Indala UID=%s (%x%08x)", showbits, uid1, uid2);
1762 }
1763 else {
1764 uid3=0;
1765 uid4=0;
1766 uid5=0;
1767 uid6=0;
1768 uid7=0;
1769 for( idx=0; idx<DemodBufferLen; idx++) {
1770 uid1=(uid1<<1)|(uid2>>31);
1771 uid2=(uid2<<1)|(uid3>>31);
1772 uid3=(uid3<<1)|(uid4>>31);
1773 uid4=(uid4<<1)|(uid5>>31);
1774 uid5=(uid5<<1)|(uid6>>31);
1775 uid6=(uid6<<1)|(uid7>>31);
1776 if (DemodBuffer[idx] == 0) {
1777 uid7=(uid7<<1)|0;
1778 showbits[idx]='0';
1779 }
1780 else {
1781 uid7=(uid7<<1)|1;
1782 showbits[idx]='1';
1783 }
1784 }
1785 showbits[idx]='\0';
1786 PrintAndLog("Indala UID=%s (%x%08x%08x%08x%08x%08x%08x)", showbits, uid1, uid2, uid3, uid4, uid5, uid6, uid7);
1787 }
b4fb11ba 1788 if (g_debugMode){
1789 PrintAndLog("DEBUG: printing demodbuffer:");
1790 printDemodBuff();
1791 }
ba1a299c 1792 return 1;
4118b74d 1793}
1794
04d2721b 1795// by marshmellow
e770c648 1796// takes 3 arguments - clock, invert, maxErr as integers
1797// attempts to demodulate nrz only
1798// prints binary found and saves in demodbuffer for further commands
b4a2fcf6 1799
1800int NRZrawDemod(const char *Cmd, bool verbose)
e770c648 1801{
1802 int invert=0;
1803 int clk=0;
1804 int maxErr=100;
e770c648 1805 sscanf(Cmd, "%i %i %i", &clk, &invert, &maxErr);
1806 if (clk==1){
1807 invert=1;
1808 clk=0;
1809 }
1810 if (invert != 0 && invert != 1) {
1811 PrintAndLog("Invalid argument: %s", Cmd);
1812 return 0;
1813 }
1814 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
1815 size_t BitLen = getFromGraphBuf(BitStream);
1816 if (BitLen==0) return 0;
1817 int errCnt=0;
1818 errCnt = nrzRawDemod(BitStream, &BitLen, &clk, &invert, maxErr);
1819 if (errCnt > maxErr){
b4a2fcf6 1820 if (g_debugMode==1 && verbose) PrintAndLog("Too many errors found, clk: %d, invert: %d, numbits: %d, errCnt: %d",clk,invert,BitLen,errCnt);
e770c648 1821 return 0;
1822 }
1823 if (errCnt<0|| BitLen<16){ //throw away static - allow 1 and -1 (in case of threshold command first)
b4a2fcf6 1824 if (g_debugMode==1 && verbose) PrintAndLog("no data found, clk: %d, invert: %d, numbits: %d, errCnt: %d",clk,invert,BitLen,errCnt);
e770c648 1825 return 0;
1826 }
1827 PrintAndLog("Tried NRZ Demod using Clock: %d - invert: %d - Bits Found: %d",clk,invert,BitLen);
1828 //prime demod buffer for output
1829 setDemodBuf(BitStream,BitLen,0);
1830
b4a2fcf6 1831 if (errCnt>0 && verbose){
e770c648 1832 PrintAndLog("# Errors during Demoding (shown as 77 in bit stream): %d",errCnt);
e770c648 1833 }
b4a2fcf6 1834 if (verbose) {
1835 PrintAndLog("NRZ demoded bitstream:");
1836 // Now output the bitstream to the scrollback by line of 16 bits
1837 printDemodBuff();
1838 }
1839 return 1;
1840}
1841
1842int CmdNRZrawDemod(const char *Cmd)
1843{
1844 char cmdp = param_getchar(Cmd, 0);
1845 if (strlen(Cmd) > 10 || cmdp == 'h' || cmdp == 'H') {
1846 PrintAndLog("Usage: data rawdemod nr [clock] <0|1> [maxError]");
1847 PrintAndLog(" [set clock as integer] optional, if not set, autodetect.");
1848 PrintAndLog(" <invert>, 1 for invert output");
1849 PrintAndLog(" [set maximum allowed errors], default = 100.");
1850 PrintAndLog("");
d66d4843 1851 PrintAndLog(" sample: data rawdemod nr = demod a nrz/direct tag from GraphBuffer");
1852 PrintAndLog(" : data rawdemod nr 32 = demod a nrz/direct tag from GraphBuffer using a clock of RF/32");
1853 PrintAndLog(" : data rawdemod nr 32 1 = demod a nrz/direct tag from GraphBuffer using a clock of RF/32 and inverting data");
1854 PrintAndLog(" : data rawdemod nr 1 = demod a nrz/direct tag from GraphBuffer while inverting data");
1855 PrintAndLog(" : data rawdemod nr 64 1 0 = demod a nrz/direct tag from GraphBuffer using a clock of RF/64, inverting data and allowing 0 demod errors");
b4a2fcf6 1856 return 0;
1857 }
1858 return NRZrawDemod(Cmd, TRUE);
e770c648 1859}
1860
1861// by marshmellow
1862// takes 3 arguments - clock, invert, maxErr as integers
04d2721b 1863// attempts to demodulate psk only
1864// prints binary found and saves in demodbuffer for further commands
e770c648 1865int CmdPSK1rawDemod(const char *Cmd)
4118b74d 1866{
84871873 1867 int errCnt;
e770c648 1868 char cmdp = param_getchar(Cmd, 0);
6de43508 1869 if (strlen(Cmd) > 10 || cmdp == 'h' || cmdp == 'H') {
19ff0210 1870 PrintAndLog("Usage: data rawdemod p1 [clock] <0|1> [maxError]");
e770c648 1871 PrintAndLog(" [set clock as integer] optional, if not set, autodetect.");
1872 PrintAndLog(" <invert>, 1 for invert output");
1873 PrintAndLog(" [set maximum allowed errors], default = 100.");
1874 PrintAndLog("");
d66d4843 1875 PrintAndLog(" sample: data rawdemod p1 = demod a psk1 tag from GraphBuffer");
1876 PrintAndLog(" : data rawdemod p1 32 = demod a psk1 tag from GraphBuffer using a clock of RF/32");
1877 PrintAndLog(" : data rawdemod p1 32 1 = demod a psk1 tag from GraphBuffer using a clock of RF/32 and inverting data");
1878 PrintAndLog(" : data rawdemod p1 1 = demod a psk1 tag from GraphBuffer while inverting data");
1879 PrintAndLog(" : data rawdemod p1 64 1 0 = demod a psk1 tag from GraphBuffer using a clock of RF/64, inverting data and allowing 0 demod errors");
e770c648 1880 return 0;
1881 }
4ac906d1 1882 errCnt = PSKDemod(Cmd, TRUE);
b4fb11ba 1883 //output
1884 if (errCnt<0){
e770c648 1885 if (g_debugMode) PrintAndLog("Error demoding: %d",errCnt);
ec75f5c1 1886 return 0;
e770c648 1887 }
b4fb11ba 1888 if (errCnt>0){
e770c648 1889 PrintAndLog("# Errors during Demoding (shown as 77 in bit stream): %d",errCnt);
ec75f5c1 1890 }
e770c648 1891 PrintAndLog("PSK demoded bitstream:");
1892 // Now output the bitstream to the scrollback by line of 16 bits
1893 printDemodBuff();
1894 return 1;
4118b74d 1895}
1896
04d2721b 1897// by marshmellow
19ff0210 1898// takes same args as cmdpsk1rawdemod
04d2721b 1899int CmdPSK2rawDemod(const char *Cmd)
1900{
1901 int errCnt=0;
e770c648 1902 char cmdp = param_getchar(Cmd, 0);
6de43508 1903 if (strlen(Cmd) > 10 || cmdp == 'h' || cmdp == 'H') {
19ff0210 1904 PrintAndLog("Usage: data rawdemod p2 [clock] <0|1> [maxError]");
e770c648 1905 PrintAndLog(" [set clock as integer] optional, if not set, autodetect.");
1906 PrintAndLog(" <invert>, 1 for invert output");
1907 PrintAndLog(" [set maximum allowed errors], default = 100.");
1908 PrintAndLog("");
d66d4843 1909 PrintAndLog(" sample: data rawdemod p2 = demod a psk2 tag from GraphBuffer, autodetect clock");
1910 PrintAndLog(" : data rawdemod p2 32 = demod a psk2 tag from GraphBuffer using a clock of RF/32");
1911 PrintAndLog(" : data rawdemod p2 32 1 = demod a psk2 tag from GraphBuffer using a clock of RF/32 and inverting output");
1912 PrintAndLog(" : data rawdemod p2 1 = demod a psk2 tag from GraphBuffer, autodetect clock and invert output");
1913 PrintAndLog(" : data rawdemod p2 64 1 0 = demod a psk2 tag from GraphBuffer using a clock of RF/64, inverting output and allowing 0 demod errors");
e770c648 1914 return 0;
1915 }
3f41e73c 1916 errCnt=PSKDemod(Cmd, TRUE);
04d2721b 1917 if (errCnt<0){
1918 if (g_debugMode) PrintAndLog("Error demoding: %d",errCnt);
1919 return 0;
1920 }
1921 psk1TOpsk2(DemodBuffer, DemodBufferLen);
1922 if (errCnt>0){
1923 if (g_debugMode){
1924 PrintAndLog("# Errors during Demoding (shown as 77 in bit stream): %d",errCnt);
1925 PrintAndLog("PSK2 demoded bitstream:");
1926 // Now output the bitstream to the scrollback by line of 16 bits
1927 printDemodBuff();
1928 }
1929 }else{
1930 PrintAndLog("PSK2 demoded bitstream:");
1931 // Now output the bitstream to the scrollback by line of 16 bits
1932 printDemodBuff();
1933 }
1934 return 1;
1935}
1936
19ff0210 1937// by marshmellow - combines all raw demod functions into one menu command
1938int CmdRawDemod(const char *Cmd)
1939{
1940 char cmdp = Cmd[0]; //param_getchar(Cmd, 0);
1941
1942 if (strlen(Cmd) > 14 || cmdp == 'h' || cmdp == 'H' || strlen(Cmd)<2) {
1943 PrintAndLog("Usage: data rawdemod [modulation] <help>|<options>");
1944 PrintAndLog(" [modulation] as 2 char, 'am' for ask/manchester, 'ar' for ask/raw, 'fs' for fsk, 'nr' for nrz/direct, 'p1' for psk1, 'p2' for psk2");
1945 PrintAndLog(" <help> as 'h', prints the help for the specific modulation");
1946 PrintAndLog(" <options> see specific modulation help for optional parameters");
1947 PrintAndLog("");
1948 PrintAndLog(" sample: data rawdemod fs h = print help for ask/raw demod");
1949 PrintAndLog(" : data rawdemod fs = demod GraphBuffer using: fsk - autodetect");
1950 PrintAndLog(" : data rawdemod am = demod GraphBuffer using: ask/manchester - autodetect");
1951 PrintAndLog(" : data rawdemod ar = demod GraphBuffer using: ask/raw - autodetect");
1952 PrintAndLog(" : data rawdemod nr = demod GraphBuffer using: nrz/direct - autodetect");
1953 PrintAndLog(" : data rawdemod p1 = demod GraphBuffer using: psk1 - autodetect");
1954 PrintAndLog(" : data rawdemod p2 = demod GraphBuffer using: psk2 - autodetect");
1955 return 0;
1956 }
1957 char cmdp2 = Cmd[1];
1958 int ans = 0;
1959 if (cmdp == 'f' && cmdp2 == 's'){
1960 ans = CmdFSKrawdemod(Cmd+3);
1961 } else if(cmdp == 'a' && cmdp2 == 'm'){
1962 ans = Cmdaskmandemod(Cmd+3);
1963 } else if(cmdp == 'a' && cmdp2 == 'r'){
1964 ans = Cmdaskrawdemod(Cmd+3);
1965 } else if(cmdp == 'n' && cmdp2 == 'r'){
1966 ans = CmdNRZrawDemod(Cmd+3);
1967 } else if(cmdp == 'p' && cmdp2 == '1'){
1968 ans = CmdPSK1rawDemod(Cmd+3);
1969 } else if(cmdp == 'p' && cmdp2 == '2'){
1970 ans = CmdPSK2rawDemod(Cmd+3);
1971 } else {
1972 PrintAndLog("unknown modulation entered - see help ('h') for parameter structure");
1973 }
1974 return ans;
1975}
1976
7fe9b0b7 1977int CmdGrid(const char *Cmd)
1978{
1979 sscanf(Cmd, "%i %i", &PlotGridX, &PlotGridY);
7ddb9900 1980 PlotGridXdefault= PlotGridX;
1981 PlotGridYdefault= PlotGridY;
7fe9b0b7 1982 RepaintGraphWindow();
1983 return 0;
1984}
1985
1986int CmdHexsamples(const char *Cmd)
1987{
4961e292 1988 int i, j;
7fe9b0b7 1989 int requested = 0;
1990 int offset = 0;
4961e292 1991 char string_buf[25];
1992 char* string_ptr = string_buf;
f71f4deb 1993 uint8_t got[BIGBUF_SIZE];
952a8bb5 1994
4961e292 1995 sscanf(Cmd, "%i %i", &requested, &offset);
90d74dc2 1996
4961e292 1997 /* if no args send something */
1998 if (requested == 0) {
90d74dc2 1999 requested = 8;
2000 }
90d74dc2 2001 if (offset + requested > sizeof(got)) {
f71f4deb 2002 PrintAndLog("Tried to read past end of buffer, <bytes> + <offset> > %d", BIGBUF_SIZE);
4961e292 2003 return 0;
952a8bb5 2004 }
90d74dc2 2005
4961e292 2006 GetFromBigBuf(got,requested,offset);
90d74dc2 2007 WaitForResponse(CMD_ACK,NULL);
2008
4961e292 2009 i = 0;
2010 for (j = 0; j < requested; j++) {
2011 i++;
2012 string_ptr += sprintf(string_ptr, "%02x ", got[j]);
2013 if (i == 8) {
2014 *(string_ptr - 1) = '\0'; // remove the trailing space
2015 PrintAndLog("%s", string_buf);
2016 string_buf[0] = '\0';
2017 string_ptr = string_buf;
2018 i = 0;
2019 }
2020 if (j == requested - 1 && string_buf[0] != '\0') { // print any remaining bytes
2021 *(string_ptr - 1) = '\0';
2022 PrintAndLog("%s", string_buf);
2023 string_buf[0] = '\0';
b4fb11ba 2024 }
7fe9b0b7 2025 }
2026 return 0;
2027}
2028
7fe9b0b7 2029int CmdHide(const char *Cmd)
2030{
2031 HideGraphWindow();
2032 return 0;
2033}
2034
78f5b1a7 2035//zero mean GraphBuffer
7fe9b0b7 2036int CmdHpf(const char *Cmd)
2037{
2038 int i;
2039 int accum = 0;
2040
2041 for (i = 10; i < GraphTraceLen; ++i)
2042 accum += GraphBuffer[i];
2043 accum /= (GraphTraceLen - 10);
2044 for (i = 0; i < GraphTraceLen; ++i)
2045 GraphBuffer[i] -= accum;
2046
2047 RepaintGraphWindow();
2048 return 0;
2049}
f6d9fb17
MHS
2050typedef struct {
2051 uint8_t * buffer;
2052 uint32_t numbits;
2053 uint32_t position;
2054}BitstreamOut;
2055
2056bool _headBit( BitstreamOut *stream)
2057{
2058 int bytepos = stream->position >> 3; // divide by 8
2059 int bitpos = (stream->position++) & 7; // mask out 00000111
2060 return (*(stream->buffer + bytepos) >> (7-bitpos)) & 1;
2061}
2062
2063uint8_t getByte(uint8_t bits_per_sample, BitstreamOut* b)
2064{
2065 int i;
2066 uint8_t val = 0;
2067 for(i =0 ; i < bits_per_sample; i++)
2068 {
2069 val |= (_headBit(b) << (7-i));
2070 }
2071 return val;
2072}
7fe9b0b7 2073
8d183c53 2074int CmdSamples(const char *Cmd)
7fe9b0b7 2075{
31abe49f
MHS
2076 //If we get all but the last byte in bigbuf,
2077 // we don't have to worry about remaining trash
2078 // in the last byte in case the bits-per-sample
2079 // does not line up on byte boundaries
0644d5e3 2080 uint8_t got[BIGBUF_SIZE-1] = { 0 };
ba1a299c 2081
d6d20c54 2082 int n = strtol(Cmd, NULL, 0);
2083 if (n == 0)
31abe49f 2084 n = sizeof(got);
d6d20c54 2085
2086 if (n > sizeof(got))
2087 n = sizeof(got);
ba1a299c 2088
f6d9fb17 2089 PrintAndLog("Reading %d bytes from device memory\n", n);
f71f4deb 2090 GetFromBigBuf(got,n,0);
f6d9fb17
MHS
2091 PrintAndLog("Data fetched");
2092 UsbCommand response;
2093 WaitForResponse(CMD_ACK, &response);
31abe49f
MHS
2094 uint8_t bits_per_sample = 8;
2095
2096 //Old devices without this feature would send 0 at arg[0]
2097 if(response.arg[0] > 0)
2098 {
2099 sample_config *sc = (sample_config *) response.d.asBytes;
2100 PrintAndLog("Samples @ %d bits/smpl, decimation 1:%d ", sc->bits_per_sample
2101 , sc->decimation);
2102 bits_per_sample = sc->bits_per_sample;
f71f4deb 2103 }
f6d9fb17
MHS
2104 if(bits_per_sample < 8)
2105 {
2106 PrintAndLog("Unpacking...");
2107 BitstreamOut bout = { got, bits_per_sample * n, 0};
2108 int j =0;
31abe49f 2109 for (j = 0; j * bits_per_sample < n * 8 && j < sizeof(GraphBuffer); j++) {
f6d9fb17
MHS
2110 uint8_t sample = getByte(bits_per_sample, &bout);
2111 GraphBuffer[j] = ((int) sample )- 128;
2112 }
2113 GraphTraceLen = j;
2114 PrintAndLog("Unpacked %d samples" , j );
2115 }else
2116 {
2117 for (int j = 0; j < n; j++) {
2118 GraphBuffer[j] = ((int)got[j]) - 128;
2119 }
2120 GraphTraceLen = n;
f6d9fb17
MHS
2121 }
2122
f71f4deb 2123 RepaintGraphWindow();
2124 return 0;
7fe9b0b7 2125}
2126
d6a120a2
MHS
2127int CmdTuneSamples(const char *Cmd)
2128{
3aa4014b 2129 int timeout = 0;
2130 printf("\nMeasuring antenna characteristics, please wait...");
ba1a299c 2131
3aa4014b 2132 UsbCommand c = {CMD_MEASURE_ANTENNA_TUNING};
2133 SendCommand(&c);
2134
2135 UsbCommand resp;
2136 while(!WaitForResponseTimeout(CMD_MEASURED_ANTENNA_TUNING,&resp,1000)) {
2137 timeout++;
2138 printf(".");
2139 if (timeout > 7) {
2140 PrintAndLog("\nNo response from Proxmark. Aborting...");
2141 return 1;
2142 }
2143 }
2144
2145 int peakv, peakf;
2146 int vLf125, vLf134, vHf;
2147 vLf125 = resp.arg[0] & 0xffff;
2148 vLf134 = resp.arg[0] >> 16;
2149 vHf = resp.arg[1] & 0xffff;;
2150 peakf = resp.arg[2] & 0xffff;
2151 peakv = resp.arg[2] >> 16;
2152 PrintAndLog("");
2153 PrintAndLog("# LF antenna: %5.2f V @ 125.00 kHz", vLf125/1000.0);
2154 PrintAndLog("# LF antenna: %5.2f V @ 134.00 kHz", vLf134/1000.0);
2155 PrintAndLog("# LF optimal: %5.2f V @%9.2f kHz", peakv/1000.0, 12000.0/(peakf+1));
2156 PrintAndLog("# HF antenna: %5.2f V @ 13.56 MHz", vHf/1000.0);
0d0d0499 2157
2158#define LF_UNUSABLE_V 2948 // was 2000. Changed due to bugfix in voltage measurements. LF results are now 47% higher.
2159#define LF_MARGINAL_V 14739 // was 10000. Changed due to bugfix bug in voltage measurements. LF results are now 47% higher.
2160#define HF_UNUSABLE_V 3167 // was 2000. Changed due to bugfix in voltage measurements. HF results are now 58% higher.
2161#define HF_MARGINAL_V 7917 // was 5000. Changed due to bugfix in voltage measurements. HF results are now 58% higher.
2162
2163 if (peakv < LF_UNUSABLE_V)
3aa4014b 2164 PrintAndLog("# Your LF antenna is unusable.");
0d0d0499 2165 else if (peakv < LF_MARGINAL_V)
3aa4014b 2166 PrintAndLog("# Your LF antenna is marginal.");
0d0d0499 2167 if (vHf < HF_UNUSABLE_V)
3aa4014b 2168 PrintAndLog("# Your HF antenna is unusable.");
0d0d0499 2169 else if (vHf < HF_MARGINAL_V)
3aa4014b 2170 PrintAndLog("# Your HF antenna is marginal.");
2171
0d0d0499 2172 if (peakv >= LF_UNUSABLE_V) {
2173 for (int i = 0; i < 256; i++) {
2174 GraphBuffer[i] = resp.d.asBytes[i] - 128;
2175 }
2176 PrintAndLog("Displaying LF tuning graph. Divisor 89 is 134khz, 95 is 125khz.\n");
2177 PrintAndLog("\n");
2178 GraphTraceLen = 256;
2179 ShowGraphWindow();
abd16c45 2180 RepaintGraphWindow();
ba1a299c 2181 }
2182
b4fb11ba 2183 return 0;
d6a120a2
MHS
2184}
2185
3aa4014b 2186
7fe9b0b7 2187int CmdLoad(const char *Cmd)
2188{
ec75f5c1 2189 char filename[FILE_PATH_SIZE] = {0x00};
2190 int len = 0;
b915fda3 2191
ec75f5c1 2192 len = strlen(Cmd);
2193 if (len > FILE_PATH_SIZE) len = FILE_PATH_SIZE;
2194 memcpy(filename, Cmd, len);
b915fda3 2195
ec75f5c1 2196 FILE *f = fopen(filename, "r");
7fe9b0b7 2197 if (!f) {
b915fda3 2198 PrintAndLog("couldn't open '%s'", filename);
7fe9b0b7 2199 return 0;
2200 }
2201
2202 GraphTraceLen = 0;
2203 char line[80];
2204 while (fgets(line, sizeof (line), f)) {
2205 GraphBuffer[GraphTraceLen] = atoi(line);
2206 GraphTraceLen++;
2207 }
2208 fclose(f);
2209 PrintAndLog("loaded %d samples", GraphTraceLen);
2210 RepaintGraphWindow();
2211 return 0;
2212}
2213
2214int CmdLtrim(const char *Cmd)
2215{
2216 int ds = atoi(Cmd);
2217
2218 for (int i = ds; i < GraphTraceLen; ++i)
2219 GraphBuffer[i-ds] = GraphBuffer[i];
2220 GraphTraceLen -= ds;
2221
2222 RepaintGraphWindow();
2223 return 0;
2224}
ec75f5c1 2225
2226// trim graph to input argument length
9ec1416a 2227int CmdRtrim(const char *Cmd)
2228{
2229 int ds = atoi(Cmd);
2230
2231 GraphTraceLen = ds;
2232
2233 RepaintGraphWindow();
2234 return 0;
2235}
7fe9b0b7 2236
2237/*
2238 * Manchester demodulate a bitstream. The bitstream needs to be already in
2239 * the GraphBuffer as 0 and 1 values
2240 *
2241 * Give the clock rate as argument in order to help the sync - the algorithm
2242 * resyncs at each pulse anyway.
2243 *
2244 * Not optimized by any means, this is the 1st time I'm writing this type of
2245 * routine, feel free to improve...
2246 *
2247 * 1st argument: clock rate (as number of samples per clock rate)
2248 * Typical values can be 64, 32, 128...
2249 */
2250int CmdManchesterDemod(const char *Cmd)
2251{
2252 int i, j, invert= 0;
2253 int bit;
2254 int clock;
fddf220a 2255 int lastval = 0;
7fe9b0b7 2256 int low = 0;
2257 int high = 0;
2258 int hithigh, hitlow, first;
2259 int lc = 0;
2260 int bitidx = 0;
2261 int bit2idx = 0;
2262 int warnings = 0;
2263
2264 /* check if we're inverting output */
c6f1fb9d 2265 if (*Cmd == 'i')
7fe9b0b7 2266 {
2267 PrintAndLog("Inverting output");
2268 invert = 1;
fffad860 2269 ++Cmd;
7fe9b0b7 2270 do
2271 ++Cmd;
2272 while(*Cmd == ' '); // in case a 2nd argument was given
2273 }
2274
2275 /* Holds the decoded bitstream: each clock period contains 2 bits */
2276 /* later simplified to 1 bit after manchester decoding. */
2277 /* Add 10 bits to allow for noisy / uncertain traces without aborting */
2278 /* int BitStream[GraphTraceLen*2/clock+10]; */
2279
2280 /* But it does not work if compiling on WIndows: therefore we just allocate a */
2281 /* large array */
90e278d3 2282 uint8_t BitStream[MAX_GRAPH_TRACE_LEN] = {0};
7fe9b0b7 2283
2284 /* Detect high and lows */
2285 for (i = 0; i < GraphTraceLen; i++)
2286 {
2287 if (GraphBuffer[i] > high)
2288 high = GraphBuffer[i];
2289 else if (GraphBuffer[i] < low)
2290 low = GraphBuffer[i];
2291 }
2292
2293 /* Get our clock */
f3bf15e4 2294 clock = GetAskClock(Cmd, high, 1);
7fe9b0b7 2295
2296 int tolerance = clock/4;
2297
2298 /* Detect first transition */
2299 /* Lo-Hi (arbitrary) */
2300 /* skip to the first high */
2301 for (i= 0; i < GraphTraceLen; i++)
2302 if (GraphBuffer[i] == high)
2303 break;
2304 /* now look for the first low */
2305 for (; i < GraphTraceLen; i++)
2306 {
2307 if (GraphBuffer[i] == low)
2308 {
2309 lastval = i;
2310 break;
2311 }
2312 }
2313
2314 /* If we're not working with 1/0s, demod based off clock */
2315 if (high != 1)
2316 {
2317 bit = 0; /* We assume the 1st bit is zero, it may not be
2318 * the case: this routine (I think) has an init problem.
2319 * Ed.
2320 */
2321 for (; i < (int)(GraphTraceLen / clock); i++)
2322 {
2323 hithigh = 0;
2324 hitlow = 0;
2325 first = 1;
2326
2327 /* Find out if we hit both high and low peaks */
2328 for (j = 0; j < clock; j++)
2329 {
2330 if (GraphBuffer[(i * clock) + j] == high)
2331 hithigh = 1;
2332 else if (GraphBuffer[(i * clock) + j] == low)
2333 hitlow = 1;
2334
2335 /* it doesn't count if it's the first part of our read
2336 because it's really just trailing from the last sequence */
2337 if (first && (hithigh || hitlow))
2338 hithigh = hitlow = 0;
2339 else
2340 first = 0;
2341
2342 if (hithigh && hitlow)
2343 break;
2344 }
2345
2346 /* If we didn't hit both high and low peaks, we had a bit transition */
2347 if (!hithigh || !hitlow)
2348 bit ^= 1;
2349
2350 BitStream[bit2idx++] = bit ^ invert;
2351 }
2352 }
2353
2354 /* standard 1/0 bitstream */
2355 else
2356 {
2357
2358 /* Then detect duration between 2 successive transitions */
2359 for (bitidx = 1; i < GraphTraceLen; i++)
2360 {
2361 if (GraphBuffer[i-1] != GraphBuffer[i])
2362 {
b3b70669 2363 lc = i-lastval;
2364 lastval = i;
2365
2366 // Error check: if bitidx becomes too large, we do not
2367 // have a Manchester encoded bitstream or the clock is really
2368 // wrong!
2369 if (bitidx > (GraphTraceLen*2/clock+8) ) {
2370 PrintAndLog("Error: the clock you gave is probably wrong, aborting.");
2371 return 0;
2372 }
2373 // Then switch depending on lc length:
2374 // Tolerance is 1/4 of clock rate (arbitrary)
2375 if (abs(lc-clock/2) < tolerance) {
2376 // Short pulse : either "1" or "0"
2377 BitStream[bitidx++]=GraphBuffer[i-1];
2378 } else if (abs(lc-clock) < tolerance) {
2379 // Long pulse: either "11" or "00"
2380 BitStream[bitidx++]=GraphBuffer[i-1];
2381 BitStream[bitidx++]=GraphBuffer[i-1];
2382 } else {
7fe9b0b7 2383 // Error
2384 warnings++;
b3b70669 2385 PrintAndLog("Warning: Manchester decode error for pulse width detection.");
2386 PrintAndLog("(too many of those messages mean either the stream is not Manchester encoded, or clock is wrong)");
7fe9b0b7 2387
2388 if (warnings > 10)
2389 {
2390 PrintAndLog("Error: too many detection errors, aborting.");
2391 return 0;
2392 }
2393 }
2394 }
2395 }
2396
2397 // At this stage, we now have a bitstream of "01" ("1") or "10" ("0"), parse it into final decoded bitstream
2398 // Actually, we overwrite BitStream with the new decoded bitstream, we just need to be careful
2399 // to stop output at the final bitidx2 value, not bitidx
2400 for (i = 0; i < bitidx; i += 2) {
2401 if ((BitStream[i] == 0) && (BitStream[i+1] == 1)) {
2402 BitStream[bit2idx++] = 1 ^ invert;
b3b70669 2403 } else if ((BitStream[i] == 1) && (BitStream[i+1] == 0)) {
2404 BitStream[bit2idx++] = 0 ^ invert;
2405 } else {
2406 // We cannot end up in this state, this means we are unsynchronized,
2407 // move up 1 bit:
2408 i++;
7fe9b0b7 2409 warnings++;
b3b70669 2410 PrintAndLog("Unsynchronized, resync...");
2411 PrintAndLog("(too many of those messages mean the stream is not Manchester encoded)");
7fe9b0b7 2412
2413 if (warnings > 10)
2414 {
2415 PrintAndLog("Error: too many decode errors, aborting.");
2416 return 0;
2417 }
2418 }
2419 }
2420 }
2421
2422 PrintAndLog("Manchester decoded bitstream");
2423 // Now output the bitstream to the scrollback by line of 16 bits
2424 for (i = 0; i < (bit2idx-16); i+=16) {
2425 PrintAndLog("%i %i %i %i %i %i %i %i %i %i %i %i %i %i %i %i",
2426 BitStream[i],
2427 BitStream[i+1],
2428 BitStream[i+2],
2429 BitStream[i+3],
2430 BitStream[i+4],
2431 BitStream[i+5],
2432 BitStream[i+6],
2433 BitStream[i+7],
2434 BitStream[i+8],
2435 BitStream[i+9],
2436 BitStream[i+10],
2437 BitStream[i+11],
2438 BitStream[i+12],
2439 BitStream[i+13],
2440 BitStream[i+14],
2441 BitStream[i+15]);
2442 }
2443 return 0;
2444}
2445
2446/* Modulate our data into manchester */
2447int CmdManchesterMod(const char *Cmd)
2448{
2449 int i, j;
2450 int clock;
2451 int bit, lastbit, wave;
2452
2453 /* Get our clock */
f3bf15e4 2454 clock = GetAskClock(Cmd, 0, 1);
7fe9b0b7 2455
2456 wave = 0;
2457 lastbit = 1;
2458 for (i = 0; i < (int)(GraphTraceLen / clock); i++)
2459 {
2460 bit = GraphBuffer[i * clock] ^ 1;
2461
2462 for (j = 0; j < (int)(clock/2); j++)
2463 GraphBuffer[(i * clock) + j] = bit ^ lastbit ^ wave;
2464 for (j = (int)(clock/2); j < clock; j++)
2465 GraphBuffer[(i * clock) + j] = bit ^ lastbit ^ wave ^ 1;
2466
2467 /* Keep track of how we start our wave and if we changed or not this time */
2468 wave ^= bit ^ lastbit;
2469 lastbit = bit;
2470 }
2471
2472 RepaintGraphWindow();
2473 return 0;
2474}
2475
2476int CmdNorm(const char *Cmd)
2477{
2478 int i;
2479 int max = INT_MIN, min = INT_MAX;
2480
2481 for (i = 10; i < GraphTraceLen; ++i) {
2482 if (GraphBuffer[i] > max)
2483 max = GraphBuffer[i];
2484 if (GraphBuffer[i] < min)
2485 min = GraphBuffer[i];
2486 }
2487
2488 if (max != min) {
2489 for (i = 0; i < GraphTraceLen; ++i) {
ba1a299c 2490 GraphBuffer[i] = (GraphBuffer[i] - ((max + min) / 2)) * 256 /
7fe9b0b7 2491 (max - min);
ba1a299c 2492 //marshmelow: adjusted *1000 to *256 to make +/- 128 so demod commands still work
7fe9b0b7 2493 }
2494 }
2495 RepaintGraphWindow();
2496 return 0;
2497}
2498
2499int CmdPlot(const char *Cmd)
2500{
2501 ShowGraphWindow();
2502 return 0;
2503}
2504
2505int CmdSave(const char *Cmd)
2506{
ec75f5c1 2507 char filename[FILE_PATH_SIZE] = {0x00};
2508 int len = 0;
b915fda3 2509
ec75f5c1 2510 len = strlen(Cmd);
2511 if (len > FILE_PATH_SIZE) len = FILE_PATH_SIZE;
2512 memcpy(filename, Cmd, len);
b915fda3 2513
2514
2515 FILE *f = fopen(filename, "w");
7fe9b0b7 2516 if(!f) {
b915fda3 2517 PrintAndLog("couldn't open '%s'", filename);
7fe9b0b7 2518 return 0;
2519 }
2520 int i;
2521 for (i = 0; i < GraphTraceLen; i++) {
2522 fprintf(f, "%d\n", GraphBuffer[i]);
2523 }
2524 fclose(f);
2525 PrintAndLog("saved to '%s'", Cmd);
2526 return 0;
2527}
2528
2529int CmdScale(const char *Cmd)
2530{
2531 CursorScaleFactor = atoi(Cmd);
2532 if (CursorScaleFactor == 0) {
2533 PrintAndLog("bad, can't have zero scale");
2534 CursorScaleFactor = 1;
2535 }
2536 RepaintGraphWindow();
2537 return 0;
2538}
2539
2540int CmdThreshold(const char *Cmd)
2541{
2542 int threshold = atoi(Cmd);
2543
2544 for (int i = 0; i < GraphTraceLen; ++i) {
2545 if (GraphBuffer[i] >= threshold)
2546 GraphBuffer[i] = 1;
2547 else
7bb9d33e 2548 GraphBuffer[i] = -1;
7fe9b0b7 2549 }
2550 RepaintGraphWindow();
2551 return 0;
2552}
2553
d51b2eda
MHS
2554int CmdDirectionalThreshold(const char *Cmd)
2555{
b4fb11ba 2556 int8_t upThres = param_get8(Cmd, 0);
2557 int8_t downThres = param_get8(Cmd, 1);
ba1a299c 2558
d51b2eda 2559 printf("Applying Up Threshold: %d, Down Threshold: %d\n", upThres, downThres);
952a8bb5 2560
d51b2eda
MHS
2561 int lastValue = GraphBuffer[0];
2562 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 2563
d51b2eda
MHS
2564 for (int i = 1; i < GraphTraceLen; ++i) {
2565 // Apply first threshold to samples heading up
2566 if (GraphBuffer[i] >= upThres && GraphBuffer[i] > lastValue)
2567 {
2568 lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it.
2569 GraphBuffer[i] = 1;
2570 }
2571 // Apply second threshold to samples heading down
2572 else if (GraphBuffer[i] <= downThres && GraphBuffer[i] < lastValue)
2573 {
2574 lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it.
2575 GraphBuffer[i] = -1;
2576 }
2577 else
2578 {
2579 lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it.
2580 GraphBuffer[i] = GraphBuffer[i-1];
2581
2582 }
2583 }
2584 GraphBuffer[0] = GraphBuffer[1]; // Aline with first edited sample.
2585 RepaintGraphWindow();
2586 return 0;
2587}
2588
7fe9b0b7 2589int CmdZerocrossings(const char *Cmd)
2590{
2591 // Zero-crossings aren't meaningful unless the signal is zero-mean.
2592 CmdHpf("");
2593
2594 int sign = 1;
2595 int zc = 0;
2596 int lastZc = 0;
2597
2598 for (int i = 0; i < GraphTraceLen; ++i) {
2599 if (GraphBuffer[i] * sign >= 0) {
2600 // No change in sign, reproduce the previous sample count.
2601 zc++;
2602 GraphBuffer[i] = lastZc;
2603 } else {
2604 // Change in sign, reset the sample count.
2605 sign = -sign;
2606 GraphBuffer[i] = lastZc;
2607 if (sign > 0) {
2608 lastZc = zc;
2609 zc = 0;
2610 }
2611 }
2612 }
2613
2614 RepaintGraphWindow();
2615 return 0;
2616}
2617
ba1a299c 2618static command_t CommandTable[] =
7fe9b0b7 2619{
2620 {"help", CmdHelp, 1, "This help"},
2621 {"amp", CmdAmp, 1, "Amplify peaks"},
19ff0210 2622 //{"askdemod", Cmdaskdemod, 1, "<0 or 1> -- Attempt to demodulate simple ASK tags"},
cc2ea5ed 2623 {"askedgedetect", CmdAskEdgeDetect, 1, "[threshold] Adjust Graph for manual ask demod using length of sample differences to detect the edge of a wave (default = 25)"},
2624 {"askem410xdemod",CmdAskEM410xDemod, 1, "[clock] [invert<0|1>] [maxErr] -- Demodulate an EM410x tag from GraphBuffer (args optional)"},
8d960002 2625 {"askgproxiidemod",CmdG_Prox_II_Demod,1, "Demodulate a G Prox II tag from GraphBuffer"},
19ff0210 2626 //{"askmandemod", Cmdaskmandemod, 1, "[clock] [invert<0|1>] [maxErr] -- Attempt to demodulate ASK/Manchester tags and output binary (args optional)"},
2627 //{"askrawdemod", Cmdaskrawdemod, 1, "[clock] [invert<0|1>] -- Attempt to demodulate ASK tags and output bin (args optional)"},
7fe9b0b7 2628 {"autocorr", CmdAutoCorr, 1, "<window length> -- Autocorrelation over window"},
cc2ea5ed 2629 {"biphaserawdecode",CmdBiphaseDecodeRaw,1,"[offset] [invert<0|1>] Biphase decode bin stream in DemodBuffer (offset = 0|1 bits to shift the decode start)"},
7fe9b0b7 2630 {"bitsamples", CmdBitsamples, 0, "Get raw samples as bitstring"},
19ff0210 2631 //{"bitstream", CmdBitstream, 1, "[clock rate] -- Convert waveform into a bitstream"},
7fe9b0b7 2632 {"buffclear", CmdBuffClear, 1, "Clear sample buffer and graph window"},
2633 {"dec", CmdDec, 1, "Decimate samples"},
cc2ea5ed 2634 {"detectclock", CmdDetectClockRate, 1, "[modulation] Detect clock rate of wave in GraphBuffer (options: 'a','f','n','p' for ask, fsk, nrz, psk respectively)"},
19ff0210 2635 //{"fskdemod", CmdFSKdemod, 1, "Demodulate graph window as a HID FSK"},
cc2ea5ed 2636 {"fskawiddemod", CmdFSKdemodAWID, 1, "Demodulate an AWID FSK tag from GraphBuffer"},
f3bf15e4 2637 //{"fskfcdetect", CmdFSKfcDetect, 1, "Try to detect the Field Clock of an FSK wave"},
cc2ea5ed 2638 {"fskhiddemod", CmdFSKdemodHID, 1, "Demodulate a HID FSK tag from GraphBuffer"},
2639 {"fskiodemod", CmdFSKdemodIO, 1, "Demodulate an IO Prox FSK tag from GraphBuffer"},
2640 {"fskpyramiddemod",CmdFSKdemodPyramid,1, "Demodulate a Pyramid FSK tag from GraphBuffer"},
2641 {"fskparadoxdemod",CmdFSKdemodParadox,1, "Demodulate a Paradox FSK tag from GraphBuffer"},
19ff0210 2642 //{"fskrawdemod", CmdFSKrawdemod, 1, "[clock rate] [invert] [rchigh] [rclow] Demodulate graph window from FSK to bin (clock = 50)(invert = 1|0)(rchigh = 10)(rclow=8)"},
78f5b1a7 2643 {"getbitstream", CmdGetBitStream, 1, "Convert GraphBuffer's >=1 values to 1 and <1 to 0"},
7fe9b0b7 2644 {"grid", CmdGrid, 1, "<x> <y> -- overlay grid on graph window, use zero value to turn off either"},
b4fb11ba 2645 {"hexsamples", CmdHexsamples, 0, "<bytes> [<offset>] -- Dump big buffer as hex bytes"},
7fe9b0b7 2646 {"hide", CmdHide, 1, "Hide graph window"},
2647 {"hpf", CmdHpf, 1, "Remove DC offset from trace"},
7fe9b0b7 2648 {"load", CmdLoad, 1, "<filename> -- Load trace (to graph window"},
2649 {"ltrim", CmdLtrim, 1, "<samples> -- Trim samples from left of trace"},
9ec1416a 2650 {"rtrim", CmdRtrim, 1, "<location to end trace> -- Trim samples from right of trace"},
19ff0210 2651 //{"mandemod", CmdManchesterDemod, 1, "[i] [clock rate] -- Manchester demodulate binary stream (option 'i' to invert output)"},
cc2ea5ed 2652 {"manrawdecode", Cmdmandecoderaw, 1, "Manchester decode binary stream in DemodBuffer"},
7fe9b0b7 2653 {"manmod", CmdManchesterMod, 1, "[clock rate] -- Manchester modulate a binary stream"},
b4fb11ba 2654 {"norm", CmdNorm, 1, "Normalize max/min to +/-128"},
f3bf15e4 2655 //{"nrzdetectclock",CmdDetectNRZClockRate, 1, "Detect ASK, PSK, or NRZ clock rate"},
19ff0210 2656 //{"nrzrawdemod", CmdNRZrawDemod, 1, "[clock] [invert<0|1>] [maxErr] -- Attempt to demodulate nrz tags and output binary (args optional)"},
7ddb9900 2657 {"plot", CmdPlot, 1, "Show graph window (hit 'h' in window for keystroke help)"},
f3bf15e4 2658 //{"pskdetectclock",CmdDetectPSKClockRate, 1, "Detect ASK, PSK, or NRZ clock rate"},
13024283 2659 {"printdemodbuffer",CmdPrintDemodBuff,1, "[x] -- print the data in the DemodBuffer - 'x' for hex output"},
cc2ea5ed 2660 {"pskindalademod",CmdIndalaDecode, 1, "[clock] [invert<0|1>] -- Demodulate an indala tag (PSK1) from GraphBuffer (args optional)"},
19ff0210 2661 //{"psk1rawdemod", CmdPSK1rawDemod, 1, "[clock] [invert<0|1>] [maxErr] -- Attempt to demodulate psk1 tags and output binary (args optional)"},
2662 //{"psk2rawdemod", CmdPSK2rawDemod, 1, "[clock] [invert<0|1>] [maxErr] -- Attempt to demodulate psk2 tags and output binary (args optional)"},
cc2ea5ed 2663 {"rawdemod", CmdRawDemod, 1, "[modulation] ... <options> -see help (h option) -- Demodulate the data in the GraphBuffer and output binary"},
2664 {"samples", CmdSamples, 0, "[512 - 40000] -- Get raw samples for graph window (GraphBuffer)"},
7fe9b0b7 2665 {"save", CmdSave, 1, "<filename> -- Save trace (from graph window)"},
2666 {"scale", CmdScale, 1, "<int> -- Set cursor display scale"},
ec75f5c1 2667 {"setdebugmode", CmdSetDebugMode, 1, "<0|1> -- Turn on or off Debugging Mode for demods"},
2668 {"shiftgraphzero",CmdGraphShiftZero, 1, "<shift> -- Shift 0 for Graphed wave + or - shift value"},
19ff0210 2669 //{"threshold", CmdThreshold, 1, "<threshold> -- Maximize/minimize every value in the graph window depending on threshold"},
b4fb11ba 2670 {"dirthreshold", CmdDirectionalThreshold, 1, "<thres up> <thres down> -- Max rising higher up-thres/ Min falling lower down-thres, keep rest as prev."},
2671 {"tune", CmdTuneSamples, 0, "Get hw tune samples for graph window"},
19ff0210 2672 {"undec", CmdUndec, 1, "Un-decimate samples by 2"},
b4fb11ba 2673 {"zerocrossings", CmdZerocrossings, 1, "Count time between zero-crossings"},
7fe9b0b7 2674 {NULL, NULL, 0, NULL}
2675};
2676
2677int CmdData(const char *Cmd)
2678{
2679 CmdsParse(CommandTable, Cmd);
2680 return 0;
2681}
2682
2683int CmdHelp(const char *Cmd)
2684{
2685 CmdsHelp(CommandTable);
2686 return 0;
2687}
Impressum, Datenschutz