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