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