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