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