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