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