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