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