]> git.zerfleddert.de Git - proxmark3-svn/blob - client/cmddata.c
projects / proxmark3-svn / blob
? search:


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