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