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


79ff93bed314a40cc0a0f1a8258c5bc57f6f6c7b
[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 int idx = HIDdemodFSK(BitStream,&BitLen,&hi2,&hi,&lo);
663 if (idx<0){
664 if (g_debugMode){
665 if (idx==-1){
666 PrintAndLog("DEBUG: Just Noise Detected");
667 } else if (idx == -2) {
668 PrintAndLog("DEBUG: Error demoding fsk");
669 } else if (idx == -3) {
670 PrintAndLog("DEBUG: Preamble not found");
671 } else if (idx == -4) {
672 PrintAndLog("DEBUG: Error in Manchester data, SIZE: %d", BitLen);
673 } else {
674 PrintAndLog("DEBUG: Error demoding fsk %d", idx);
675 }
676 }
677 return 0;
678 }
679 if (hi2==0 && hi==0 && lo==0) {
680 if (g_debugMode) PrintAndLog("DEBUG: Error - no values found");
681 return 0;
682 }
683 if (hi2 != 0){ //extra large HID tags
684 PrintAndLog("HID Prox TAG ID: %x%08x%08x (%d)",
685 (unsigned int) hi2, (unsigned int) hi, (unsigned int) lo, (unsigned int) (lo>>1) & 0xFFFF);
686 }
687 else { //standard HID tags <38 bits
688 uint8_t fmtLen = 0;
689 uint32_t fc = 0;
690 uint32_t cardnum = 0;
691 if (((hi>>5)&1)==1){//if bit 38 is set then < 37 bit format is used
692 uint32_t lo2=0;
693 lo2=(((hi & 31) << 12) | (lo>>20)); //get bits 21-37 to check for format len bit
694 uint8_t idx3 = 1;
695 while(lo2>1){ //find last bit set to 1 (format len bit)
696 lo2=lo2>>1;
697 idx3++;
698 }
699 fmtLen =idx3+19;
700 fc =0;
701 cardnum=0;
702 if(fmtLen==26){
703 cardnum = (lo>>1)&0xFFFF;
704 fc = (lo>>17)&0xFF;
705 }
706 if(fmtLen==34){
707 cardnum = (lo>>1)&0xFFFF;
708 fc= ((hi&1)<<15)|(lo>>17);
709 }
710 if(fmtLen==35){
711 cardnum = (lo>>1)&0xFFFFF;
712 fc = ((hi&1)<<11)|(lo>>21);
713 }
714 }
715 else { //if bit 38 is not set then 37 bit format is used
716 fmtLen = 37;
717 fc = 0;
718 cardnum = 0;
719 if(fmtLen == 37){
720 cardnum = (lo>>1)&0x7FFFF;
721 fc = ((hi&0xF)<<12)|(lo>>20);
722 }
723 }
724 PrintAndLog("HID Prox TAG ID: %x%08x (%d) - Format Len: %dbit - FC: %d - Card: %d",
725 (unsigned int) hi, (unsigned int) lo, (unsigned int) (lo>>1) & 0xFFFF,
726 (unsigned int) fmtLen, (unsigned int) fc, (unsigned int) cardnum);
727 }
728 setDemodBuf(BitStream,BitLen,idx);
729 if (g_debugMode){
730 PrintAndLog("DEBUG: idx: %d, Len: %d, Printing Demod Buffer:", idx, BitLen);
731 printDemodBuff();
732 }
733 return 1;
734 }
735
736 //by marshmellow
737 //Paradox Prox demod - FSK RF/50 with preamble of 00001111 (then manchester encoded)
738 //print full Paradox Prox ID and some bit format details if found
739 int CmdFSKdemodParadox(const char *Cmd)
740 {
741 //raw fsk demod no manchester decoding no start bit finding just get binary from wave
742 uint32_t hi2=0, hi=0, lo=0;
743
744 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
745 size_t BitLen = getFromGraphBuf(BitStream);
746 //get binary from fsk wave
747 int idx = ParadoxdemodFSK(BitStream,&BitLen,&hi2,&hi,&lo);
748 if (idx<0){
749 if (g_debugMode){
750 if (idx==-1){
751 PrintAndLog("DEBUG: Just Noise Detected");
752 } else if (idx == -2) {
753 PrintAndLog("DEBUG: Error demoding fsk");
754 } else if (idx == -3) {
755 PrintAndLog("DEBUG: Preamble not found");
756 } else if (idx == -4) {
757 PrintAndLog("DEBUG: Error in Manchester data");
758 } else {
759 PrintAndLog("DEBUG: Error demoding fsk %d", idx);
760 }
761 }
762 return 0;
763 }
764 if (hi2==0 && hi==0 && lo==0){
765 if (g_debugMode) PrintAndLog("DEBUG: Error - no value found");
766 return 0;
767 }
768 uint32_t fc = ((hi & 0x3)<<6) | (lo>>26);
769 uint32_t cardnum = (lo>>10)&0xFFFF;
770
771 PrintAndLog("Paradox TAG ID: %x%08x - FC: %d - Card: %d - Checksum: %02x",
772 hi>>10, (hi & 0x3)<<26 | (lo>>10), fc, cardnum, (lo>>2) & 0xFF );
773 setDemodBuf(BitStream,BitLen,idx);
774 if (g_debugMode){
775 PrintAndLog("DEBUG: idx: %d, len: %d, Printing Demod Buffer:", idx, BitLen);
776 printDemodBuff();
777 }
778 return 1;
779 }
780
781
782 //by marshmellow
783 //IO-Prox demod - FSK RF/64 with preamble of 000000001
784 //print ioprox ID and some format details
785 int CmdFSKdemodIO(const char *Cmd)
786 {
787 //raw fsk demod no manchester decoding no start bit finding just get binary from wave
788 //set defaults
789 int idx=0;
790 //something in graphbuffer?
791 if (GraphTraceLen < 65) {
792 if (g_debugMode)PrintAndLog("DEBUG: not enough samples in GraphBuffer");
793 return 0;
794 }
795 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
796 size_t BitLen = getFromGraphBuf(BitStream);
797
798 //get binary from fsk wave
799 idx = IOdemodFSK(BitStream,BitLen);
800 if (idx<0){
801 if (g_debugMode){
802 if (idx==-1){
803 PrintAndLog("DEBUG: Just Noise Detected");
804 } else if (idx == -2) {
805 PrintAndLog("DEBUG: not enough samples");
806 } else if (idx == -3) {
807 PrintAndLog("DEBUG: error during fskdemod");
808 } else if (idx == -4) {
809 PrintAndLog("DEBUG: Preamble not found");
810 } else if (idx == -5) {
811 PrintAndLog("DEBUG: Separator bits not found");
812 } else {
813 PrintAndLog("DEBUG: Error demoding fsk %d", idx);
814 }
815 }
816 return 0;
817 }
818 if (idx==0){
819 if (g_debugMode==1){
820 PrintAndLog("DEBUG: IO Prox Data not found - FSK Bits: %d",BitLen);
821 if (BitLen > 92) printBitStream(BitStream,92);
822 }
823 return 0;
824 }
825 //Index map
826 //0 10 20 30 40 50 60
827 //| | | | | | |
828 //01234567 8 90123456 7 89012345 6 78901234 5 67890123 4 56789012 3 45678901 23
829 //-----------------------------------------------------------------------------
830 //00000000 0 11110000 1 facility 1 version* 1 code*one 1 code*two 1 ???????? 11
831 //
832 //XSF(version)facility:codeone+codetwo (raw)
833 //Handle the data
834 if (idx+64>BitLen) {
835 if (g_debugMode==1) PrintAndLog("not enough bits found - bitlen: %d",BitLen);
836 return 0;
837 }
838 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]);
839 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]);
840 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]);
841 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]);
842 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]);
843 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]);
844 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]);
845
846 uint32_t code = bytebits_to_byte(BitStream+idx,32);
847 uint32_t code2 = bytebits_to_byte(BitStream+idx+32,32);
848 uint8_t version = bytebits_to_byte(BitStream+idx+27,8); //14,4
849 uint8_t facilitycode = bytebits_to_byte(BitStream+idx+18,8) ;
850 uint16_t number = (bytebits_to_byte(BitStream+idx+36,8)<<8)|(bytebits_to_byte(BitStream+idx+45,8)); //36,9
851 PrintAndLog("IO Prox XSF(%02d)%02x:%05d (%08x%08x)",version,facilitycode,number,code,code2);
852 setDemodBuf(BitStream,64,idx);
853 if (g_debugMode){
854 PrintAndLog("DEBUG: idx: %d, Len: %d, Printing demod buffer:",idx,64);
855 printDemodBuff();
856 }
857 return 1;
858 }
859
860
861 //by marshmellow
862 //AWID Prox demod - FSK RF/50 with preamble of 00000001 (always a 96 bit data stream)
863 //print full AWID Prox ID and some bit format details if found
864 int CmdFSKdemodAWID(const char *Cmd)
865 {
866
867 //int verbose=1;
868 //sscanf(Cmd, "%i", &verbose);
869
870 //raw fsk demod no manchester decoding no start bit finding just get binary from wave
871 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
872 size_t size = getFromGraphBuf(BitStream);
873
874 //get binary from fsk wave
875 int idx = AWIDdemodFSK(BitStream, &size);
876 if (idx<=0){
877 if (g_debugMode==1){
878 if (idx == -1)
879 PrintAndLog("DEBUG: Error - not enough samples");
880 else if (idx == -2)
881 PrintAndLog("DEBUG: Error - only noise found");
882 else if (idx == -3)
883 PrintAndLog("DEBUG: Error - problem during FSK demod");
884 // else if (idx == -3)
885 // PrintAndLog("Error: thought we had a tag but the parity failed");
886 else if (idx == -4)
887 PrintAndLog("DEBUG: Error - AWID preamble not found");
888 else if (idx == -5)
889 PrintAndLog("DEBUG: Error - Size not correct: %d", size);
890 else
891 PrintAndLog("DEBUG: Error %d",idx);
892 }
893 return 0;
894 }
895
896 // Index map
897 // 0 10 20 30 40 50 60
898 // | | | | | | |
899 // 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
900 // -----------------------------------------------------------------------------
901 // 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
902 // 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
903 // |---26 bit---| |-----117----||-------------142-------------|
904 // b = format bit len, o = odd parity of last 3 bits
905 // f = facility code, c = card number
906 // w = wiegand parity
907 // (26 bit format shown)
908
909 //get raw ID before removing parities
910 uint32_t rawLo = bytebits_to_byte(BitStream+idx+64,32);
911 uint32_t rawHi = bytebits_to_byte(BitStream+idx+32,32);
912 uint32_t rawHi2 = bytebits_to_byte(BitStream+idx,32);
913 setDemodBuf(BitStream,96,idx);
914
915 size = removeParity(BitStream, idx+8, 4, 1, 88);
916 if (size != 66){
917 if (g_debugMode==1) PrintAndLog("DEBUG: Error - at parity check-tag size does not match AWID format");
918 return 0;
919 }
920 // ok valid card found!
921
922 // Index map
923 // 0 10 20 30 40 50 60
924 // | | | | | | |
925 // 01234567 8 90123456 7890123456789012 3 456789012345678901234567890123456
926 // -----------------------------------------------------------------------------
927 // 00011010 1 01110101 0000000010001110 1 000000000000000000000000000000000
928 // bbbbbbbb w ffffffff cccccccccccccccc w xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
929 // |26 bit| |-117--| |-----142------|
930 // b = format bit len, o = odd parity of last 3 bits
931 // f = facility code, c = card number
932 // w = wiegand parity
933 // (26 bit format shown)
934
935 uint32_t fc = 0;
936 uint32_t cardnum = 0;
937 uint32_t code1 = 0;
938 uint32_t code2 = 0;
939 uint8_t fmtLen = bytebits_to_byte(BitStream,8);
940 if (fmtLen==26){
941 fc = bytebits_to_byte(BitStream+9, 8);
942 cardnum = bytebits_to_byte(BitStream+17, 16);
943 code1 = bytebits_to_byte(BitStream+8,fmtLen);
944 PrintAndLog("AWID Found - BitLength: %d, FC: %d, Card: %d - Wiegand: %x, Raw: %x%08x%08x", fmtLen, fc, cardnum, code1, rawHi2, rawHi, rawLo);
945 } else {
946 cardnum = bytebits_to_byte(BitStream+8+(fmtLen-17), 16);
947 if (fmtLen>32){
948 code1 = bytebits_to_byte(BitStream+8,fmtLen-32);
949 code2 = bytebits_to_byte(BitStream+8+(fmtLen-32),32);
950 PrintAndLog("AWID Found - BitLength: %d -unknown BitLength- (%d) - Wiegand: %x%08x, Raw: %x%08x%08x", fmtLen, cardnum, code1, code2, rawHi2, rawHi, rawLo);
951 } else{
952 code1 = bytebits_to_byte(BitStream+8,fmtLen);
953 PrintAndLog("AWID Found - BitLength: %d -unknown BitLength- (%d) - Wiegand: %x, Raw: %x%08x%08x", fmtLen, cardnum, code1, rawHi2, rawHi, rawLo);
954 }
955 }
956 if (g_debugMode){
957 PrintAndLog("DEBUG: idx: %d, Len: %d Printing Demod Buffer:", idx, 96);
958 printDemodBuff();
959 }
960 //todo - convert hi2, hi, lo to demodbuffer for future sim/clone commands
961 return 1;
962 }
963
964 //by marshmellow
965 //Pyramid Prox demod - FSK RF/50 with preamble of 0000000000000001 (always a 128 bit data stream)
966 //print full Farpointe Data/Pyramid Prox ID and some bit format details if found
967 int CmdFSKdemodPyramid(const char *Cmd)
968 {
969 //raw fsk demod no manchester decoding no start bit finding just get binary from wave
970 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
971 size_t size = getFromGraphBuf(BitStream);
972
973 //get binary from fsk wave
974 int idx = PyramiddemodFSK(BitStream, &size);
975 if (idx < 0){
976 if (g_debugMode==1){
977 if (idx == -5)
978 PrintAndLog("DEBUG: Error - not enough samples");
979 else if (idx == -1)
980 PrintAndLog("DEBUG: Error - only noise found");
981 else if (idx == -2)
982 PrintAndLog("DEBUG: Error - problem during FSK demod");
983 else if (idx == -3)
984 PrintAndLog("DEBUG: Error - Size not correct: %d", size);
985 else if (idx == -4)
986 PrintAndLog("DEBUG: Error - Pyramid preamble not found");
987 else
988 PrintAndLog("DEBUG: Error - idx: %d",idx);
989 }
990 return 0;
991 }
992 // Index map
993 // 0 10 20 30 40 50 60
994 // | | | | | | |
995 // 0123456 7 8901234 5 6789012 3 4567890 1 2345678 9 0123456 7 8901234 5 6789012 3
996 // -----------------------------------------------------------------------------
997 // 0000000 0 0000000 1 0000000 1 0000000 1 0000000 1 0000000 1 0000000 1 0000000 1
998 // premable xxxxxxx o xxxxxxx o xxxxxxx o xxxxxxx o xxxxxxx o xxxxxxx o xxxxxxx o
999
1000 // 64 70 80 90 100 110 120
1001 // | | | | | | |
1002 // 4567890 1 2345678 9 0123456 7 8901234 5 6789012 3 4567890 1 2345678 9 0123456 7
1003 // -----------------------------------------------------------------------------
1004 // 0000000 1 0000000 1 0000000 1 0110111 0 0011000 1 0000001 0 0001100 1 1001010 0
1005 // xxxxxxx o xxxxxxx o xxxxxxx o xswffff o ffffccc o ccccccc o ccccccw o ppppppp o
1006 // |---115---||---------71---------|
1007 // s = format start bit, o = odd parity of last 7 bits
1008 // f = facility code, c = card number
1009 // w = wiegand parity, x = extra space for other formats
1010 // p = unknown checksum
1011 // (26 bit format shown)
1012
1013 //get raw ID before removing parities
1014 uint32_t rawLo = bytebits_to_byte(BitStream+idx+96,32);
1015 uint32_t rawHi = bytebits_to_byte(BitStream+idx+64,32);
1016 uint32_t rawHi2 = bytebits_to_byte(BitStream+idx+32,32);
1017 uint32_t rawHi3 = bytebits_to_byte(BitStream+idx,32);
1018 setDemodBuf(BitStream,128,idx);
1019
1020 size = removeParity(BitStream, idx+8, 8, 1, 120);
1021 if (size != 105){
1022 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);
1023 return 0;
1024 }
1025
1026 // ok valid card found!
1027
1028 // Index map
1029 // 0 10 20 30 40 50 60 70
1030 // | | | | | | | |
1031 // 01234567890123456789012345678901234567890123456789012345678901234567890
1032 // -----------------------------------------------------------------------
1033 // 00000000000000000000000000000000000000000000000000000000000000000000000
1034 // xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
1035
1036 // 71 80 90 100
1037 // | | | |
1038 // 1 2 34567890 1234567890123456 7 8901234
1039 // ---------------------------------------
1040 // 1 1 01110011 0000000001000110 0 1001010
1041 // s w ffffffff cccccccccccccccc w ppppppp
1042 // |--115-| |------71------|
1043 // s = format start bit, o = odd parity of last 7 bits
1044 // f = facility code, c = card number
1045 // w = wiegand parity, x = extra space for other formats
1046 // p = unknown checksum
1047 // (26 bit format shown)
1048
1049 //find start bit to get fmtLen
1050 int j;
1051 for (j=0; j<size; j++){
1052 if(BitStream[j]) break;
1053 }
1054 uint8_t fmtLen = size-j-8;
1055 uint32_t fc = 0;
1056 uint32_t cardnum = 0;
1057 uint32_t code1 = 0;
1058 //uint32_t code2 = 0;
1059 if (fmtLen==26){
1060 fc = bytebits_to_byte(BitStream+73, 8);
1061 cardnum = bytebits_to_byte(BitStream+81, 16);
1062 code1 = bytebits_to_byte(BitStream+72,fmtLen);
1063 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);
1064 } else if (fmtLen==45){
1065 fmtLen=42; //end = 10 bits not 7 like 26 bit fmt
1066 fc = bytebits_to_byte(BitStream+53, 10);
1067 cardnum = bytebits_to_byte(BitStream+63, 32);
1068 PrintAndLog("Pyramid ID Found - BitLength: %d, FC: %d, Card: %d - Raw: %x%08x%08x%08x", fmtLen, fc, cardnum, rawHi3, rawHi2, rawHi, rawLo);
1069 } else {
1070 cardnum = bytebits_to_byte(BitStream+81, 16);
1071 if (fmtLen>32){
1072 //code1 = bytebits_to_byte(BitStream+(size-fmtLen),fmtLen-32);
1073 //code2 = bytebits_to_byte(BitStream+(size-32),32);
1074 PrintAndLog("Pyramid ID Found - BitLength: %d -unknown BitLength- (%d), Raw: %x%08x%08x%08x", fmtLen, cardnum, rawHi3, rawHi2, rawHi, rawLo);
1075 } else{
1076 //code1 = bytebits_to_byte(BitStream+(size-fmtLen),fmtLen);
1077 PrintAndLog("Pyramid ID Found - BitLength: %d -unknown BitLength- (%d), Raw: %x%08x%08x%08x", fmtLen, cardnum, rawHi3, rawHi2, rawHi, rawLo);
1078 }
1079 }
1080 if (g_debugMode){
1081 PrintAndLog("DEBUG: idx: %d, Len: %d, Printing Demod Buffer:", idx, 128);
1082 printDemodBuff();
1083 }
1084 return 1;
1085 }
1086
1087 int CmdFSKdemod(const char *Cmd) //old CmdFSKdemod needs updating
1088 {
1089 static const int LowTone[] = {
1090 1, 1, 1, 1, 1, -1, -1, -1, -1, -1,
1091 1, 1, 1, 1, 1, -1, -1, -1, -1, -1,
1092 1, 1, 1, 1, 1, -1, -1, -1, -1, -1,
1093 1, 1, 1, 1, 1, -1, -1, -1, -1, -1,
1094 1, 1, 1, 1, 1, -1, -1, -1, -1, -1
1095 };
1096 static const int HighTone[] = {
1097 1, 1, 1, 1, 1, -1, -1, -1, -1,
1098 1, 1, 1, 1, -1, -1, -1, -1,
1099 1, 1, 1, 1, -1, -1, -1, -1,
1100 1, 1, 1, 1, -1, -1, -1, -1,
1101 1, 1, 1, 1, -1, -1, -1, -1,
1102 1, 1, 1, 1, -1, -1, -1, -1, -1,
1103 };
1104
1105 int lowLen = sizeof (LowTone) / sizeof (int);
1106 int highLen = sizeof (HighTone) / sizeof (int);
1107 int convLen = (highLen > lowLen) ? highLen : lowLen;
1108 uint32_t hi = 0, lo = 0;
1109
1110 int i, j;
1111 int minMark = 0, maxMark = 0;
1112
1113 for (i = 0; i < GraphTraceLen - convLen; ++i) {
1114 int lowSum = 0, highSum = 0;
1115
1116 for (j = 0; j < lowLen; ++j) {
1117 lowSum += LowTone[j]*GraphBuffer[i+j];
1118 }
1119 for (j = 0; j < highLen; ++j) {
1120 highSum += HighTone[j] * GraphBuffer[i + j];
1121 }
1122 lowSum = abs(100 * lowSum / lowLen);
1123 highSum = abs(100 * highSum / highLen);
1124 GraphBuffer[i] = (highSum << 16) | lowSum;
1125 }
1126
1127 for(i = 0; i < GraphTraceLen - convLen - 16; ++i) {
1128 int lowTot = 0, highTot = 0;
1129 // 10 and 8 are f_s divided by f_l and f_h, rounded
1130 for (j = 0; j < 10; ++j) {
1131 lowTot += (GraphBuffer[i+j] & 0xffff);
1132 }
1133 for (j = 0; j < 8; j++) {
1134 highTot += (GraphBuffer[i + j] >> 16);
1135 }
1136 GraphBuffer[i] = lowTot - highTot;
1137 if (GraphBuffer[i] > maxMark) maxMark = GraphBuffer[i];
1138 if (GraphBuffer[i] < minMark) minMark = GraphBuffer[i];
1139 }
1140
1141 GraphTraceLen -= (convLen + 16);
1142 RepaintGraphWindow();
1143
1144 // Find bit-sync (3 lo followed by 3 high) (HID ONLY)
1145 int max = 0, maxPos = 0;
1146 for (i = 0; i < 6000; ++i) {
1147 int dec = 0;
1148 for (j = 0; j < 3 * lowLen; ++j) {
1149 dec -= GraphBuffer[i + j];
1150 }
1151 for (; j < 3 * (lowLen + highLen ); ++j) {
1152 dec += GraphBuffer[i + j];
1153 }
1154 if (dec > max) {
1155 max = dec;
1156 maxPos = i;
1157 }
1158 }
1159
1160 // place start of bit sync marker in graph
1161 GraphBuffer[maxPos] = maxMark;
1162 GraphBuffer[maxPos + 1] = minMark;
1163
1164 maxPos += j;
1165
1166 // place end of bit sync marker in graph
1167 GraphBuffer[maxPos] = maxMark;
1168 GraphBuffer[maxPos+1] = minMark;
1169
1170 PrintAndLog("actual data bits start at sample %d", maxPos);
1171 PrintAndLog("length %d/%d", highLen, lowLen);
1172
1173 uint8_t bits[46] = {0x00};
1174
1175 // find bit pairs and manchester decode them
1176 for (i = 0; i < arraylen(bits) - 1; ++i) {
1177 int dec = 0;
1178 for (j = 0; j < lowLen; ++j) {
1179 dec -= GraphBuffer[maxPos + j];
1180 }
1181 for (; j < lowLen + highLen; ++j) {
1182 dec += GraphBuffer[maxPos + j];
1183 }
1184 maxPos += j;
1185 // place inter bit marker in graph
1186 GraphBuffer[maxPos] = maxMark;
1187 GraphBuffer[maxPos + 1] = minMark;
1188
1189 // hi and lo form a 64 bit pair
1190 hi = (hi << 1) | (lo >> 31);
1191 lo = (lo << 1);
1192 // store decoded bit as binary (in hi/lo) and text (in bits[])
1193 if(dec < 0) {
1194 bits[i] = '1';
1195 lo |= 1;
1196 } else {
1197 bits[i] = '0';
1198 }
1199 }
1200 PrintAndLog("bits: '%s'", bits);
1201 PrintAndLog("hex: %08x %08x", hi, lo);
1202 return 0;
1203 }
1204
1205 //by marshmellow
1206 //attempt to detect the field clock and bit clock for FSK
1207 int CmdFSKfcDetect(const char *Cmd)
1208 {
1209 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
1210 size_t size = getFromGraphBuf(BitStream);
1211
1212 uint16_t ans = countFC(BitStream, size);
1213 if (ans==0) {
1214 if (g_debugMode) PrintAndLog("DEBUG: No data found");
1215 return 0;
1216 }
1217 uint8_t fc1, fc2;
1218 fc1 = (ans >> 8) & 0xFF;
1219 fc2 = ans & 0xFF;
1220
1221 uint8_t rf1 = detectFSKClk(BitStream, size, fc1, fc2);
1222 if (rf1==0) {
1223 if (g_debugMode) PrintAndLog("DEBUG: Clock detect error");
1224 return 0;
1225 }
1226 PrintAndLog("Detected Field Clocks: FC/%d, FC/%d - Bit Clock: RF/%d", fc1, fc2, rf1);
1227 return 1;
1228 }
1229
1230 //by marshmellow
1231 //attempt to detect the bit clock for PSK or NRZ modulations
1232 int CmdDetectNRZpskClockRate(const char *Cmd)
1233 {
1234 GetNRZpskClock("",0,0);
1235 return 0;
1236 }
1237
1238 //by marshmellow
1239 //attempt to psk1 or nrz demod graph buffer
1240 //NOTE CURRENTLY RELIES ON PEAKS :(
1241 int PSKnrzDemod(const char *Cmd, uint8_t verbose)
1242 {
1243 int invert=0;
1244 int clk=0;
1245 sscanf(Cmd, "%i %i", &clk, &invert);
1246 if (invert != 0 && invert != 1) {
1247 PrintAndLog("Invalid argument: %s", Cmd);
1248 return -1;
1249 }
1250 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
1251 size_t BitLen = getFromGraphBuf(BitStream);
1252 int errCnt=0;
1253 errCnt = pskNRZrawDemod(BitStream, &BitLen,&clk,&invert);
1254 if (errCnt<0|| BitLen<16){ //throw away static - allow 1 and -1 (in case of threshold command first)
1255 if (g_debugMode==1) PrintAndLog("no data found, clk: %d, invert: %d, numbits: %d, errCnt: %d",clk,invert,BitLen,errCnt);
1256 return -1;
1257 }
1258 if (verbose) PrintAndLog("Tried PSK/NRZ Demod using Clock: %d - invert: %d - Bits Found: %d",clk,invert,BitLen);
1259
1260 //prime demod buffer for output
1261 setDemodBuf(BitStream,BitLen,0);
1262 return errCnt;
1263 }
1264 // Indala 26 bit decode
1265 // by marshmellow
1266 // optional arguments - same as CmdpskNRZrawDemod (clock & invert)
1267 int CmdIndalaDecode(const char *Cmd)
1268 {
1269 int ans;
1270 if (strlen(Cmd)>0){
1271 ans = PSKnrzDemod(Cmd, 0);
1272 } else{ //default to RF/32
1273 ans = PSKnrzDemod("32", 0);
1274 }
1275
1276 if (ans < 0){
1277 if (g_debugMode==1)
1278 PrintAndLog("Error1: %d",ans);
1279 return 0;
1280 }
1281 uint8_t invert=0;
1282 ans = indala26decode(DemodBuffer,(size_t *) &DemodBufferLen, &invert);
1283 if (ans < 1) {
1284 if (g_debugMode==1)
1285 PrintAndLog("Error2: %d",ans);
1286 return -1;
1287 }
1288 char showbits[251]={0x00};
1289 if (invert)
1290 if (g_debugMode==1)
1291 PrintAndLog("Had to invert bits");
1292
1293 //convert UID to HEX
1294 uint32_t uid1, uid2, uid3, uid4, uid5, uid6, uid7;
1295 int idx;
1296 uid1=0;
1297 uid2=0;
1298 PrintAndLog("BitLen: %d",DemodBufferLen);
1299 if (DemodBufferLen==64){
1300 for( idx=0; idx<64; idx++) {
1301 uid1=(uid1<<1)|(uid2>>31);
1302 if (DemodBuffer[idx] == 0) {
1303 uid2=(uid2<<1)|0;
1304 showbits[idx]='0';
1305 } else {
1306 uid2=(uid2<<1)|1;
1307 showbits[idx]='1';
1308 }
1309 }
1310 showbits[idx]='\0';
1311 PrintAndLog("Indala UID=%s (%x%08x)", showbits, uid1, uid2);
1312 }
1313 else {
1314 uid3=0;
1315 uid4=0;
1316 uid5=0;
1317 uid6=0;
1318 uid7=0;
1319 for( idx=0; idx<DemodBufferLen; idx++) {
1320 uid1=(uid1<<1)|(uid2>>31);
1321 uid2=(uid2<<1)|(uid3>>31);
1322 uid3=(uid3<<1)|(uid4>>31);
1323 uid4=(uid4<<1)|(uid5>>31);
1324 uid5=(uid5<<1)|(uid6>>31);
1325 uid6=(uid6<<1)|(uid7>>31);
1326 if (DemodBuffer[idx] == 0) {
1327 uid7=(uid7<<1)|0;
1328 showbits[idx]='0';
1329 }
1330 else {
1331 uid7=(uid7<<1)|1;
1332 showbits[idx]='1';
1333 }
1334 }
1335 showbits[idx]='\0';
1336 PrintAndLog("Indala UID=%s (%x%08x%08x%08x%08x%08x%08x)", showbits, uid1, uid2, uid3, uid4, uid5, uid6, uid7);
1337 }
1338 if (g_debugMode){
1339 PrintAndLog("DEBUG: printing demodbuffer:");
1340 printDemodBuff();
1341 }
1342 return 1;
1343 }
1344
1345 //by marshmellow
1346 //attempt to clean psk wave noise after a peak
1347 //NOTE RELIES ON PEAKS :(
1348 int CmdPskClean(const char *Cmd)
1349 {
1350 uint8_t bitStream[MAX_GRAPH_TRACE_LEN]={0};
1351 size_t bitLen = getFromGraphBuf(bitStream);
1352 pskCleanWave(bitStream, bitLen);
1353 setGraphBuf(bitStream, bitLen);
1354 return 0;
1355 }
1356
1357 // by marshmellow
1358 // takes 2 arguments - clock and invert both as integers
1359 // attempts to demodulate psk only
1360 // prints binary found and saves in demodbuffer for further commands
1361 int CmdpskNRZrawDemod(const char *Cmd)
1362 {
1363 int errCnt;
1364
1365 errCnt = PSKnrzDemod(Cmd, 1);
1366 //output
1367 if (errCnt<0){
1368 if (g_debugMode) PrintAndLog("Error demoding: %d",errCnt);
1369 return 0;
1370 }
1371 if (errCnt>0){
1372 if (g_debugMode){
1373 PrintAndLog("# Errors during Demoding (shown as 77 in bit stream): %d",errCnt);
1374 PrintAndLog("PSK or NRZ demoded bitstream:");
1375 // Now output the bitstream to the scrollback by line of 16 bits
1376 printDemodBuff();
1377 }
1378 }else{
1379 PrintAndLog("PSK or NRZ demoded bitstream:");
1380 // Now output the bitstream to the scrollback by line of 16 bits
1381 printDemodBuff();
1382 return 1;
1383 }
1384 return 0;
1385 }
1386
1387 // by marshmellow
1388 // takes same args as cmdpsknrzrawdemod
1389 int CmdPSK2rawDemod(const char *Cmd)
1390 {
1391 int errCnt=0;
1392 errCnt=PSKnrzDemod(Cmd, 1);
1393 if (errCnt<0){
1394 if (g_debugMode) PrintAndLog("Error demoding: %d",errCnt);
1395 return 0;
1396 }
1397 psk1TOpsk2(DemodBuffer, DemodBufferLen);
1398 if (errCnt>0){
1399 if (g_debugMode){
1400 PrintAndLog("# Errors during Demoding (shown as 77 in bit stream): %d",errCnt);
1401 PrintAndLog("PSK2 demoded bitstream:");
1402 // Now output the bitstream to the scrollback by line of 16 bits
1403 printDemodBuff();
1404 }
1405 }else{
1406 PrintAndLog("PSK2 demoded bitstream:");
1407 // Now output the bitstream to the scrollback by line of 16 bits
1408 printDemodBuff();
1409 }
1410 return 1;
1411 }
1412
1413 int CmdGrid(const char *Cmd)
1414 {
1415 sscanf(Cmd, "%i %i", &PlotGridX, &PlotGridY);
1416 PlotGridXdefault= PlotGridX;
1417 PlotGridYdefault= PlotGridY;
1418 RepaintGraphWindow();
1419 return 0;
1420 }
1421
1422 int CmdHexsamples(const char *Cmd)
1423 {
1424 int i, j;
1425 int requested = 0;
1426 int offset = 0;
1427 char string_buf[25];
1428 char* string_ptr = string_buf;
1429 uint8_t got[40000];
1430
1431 sscanf(Cmd, "%i %i", &requested, &offset);
1432
1433 /* if no args send something */
1434 if (requested == 0) {
1435 requested = 8;
1436 }
1437 if (offset + requested > sizeof(got)) {
1438 PrintAndLog("Tried to read past end of buffer, <bytes> + <offset> > 40000");
1439 return 0;
1440 }
1441
1442 GetFromBigBuf(got,requested,offset);
1443 WaitForResponse(CMD_ACK,NULL);
1444
1445 i = 0;
1446 for (j = 0; j < requested; j++) {
1447 i++;
1448 string_ptr += sprintf(string_ptr, "%02x ", got[j]);
1449 if (i == 8) {
1450 *(string_ptr - 1) = '\0'; // remove the trailing space
1451 PrintAndLog("%s", string_buf);
1452 string_buf[0] = '\0';
1453 string_ptr = string_buf;
1454 i = 0;
1455 }
1456 if (j == requested - 1 && string_buf[0] != '\0') { // print any remaining bytes
1457 *(string_ptr - 1) = '\0';
1458 PrintAndLog("%s", string_buf);
1459 string_buf[0] = '\0';
1460 }
1461 }
1462 return 0;
1463 }
1464
1465 int CmdHide(const char *Cmd)
1466 {
1467 HideGraphWindow();
1468 return 0;
1469 }
1470
1471 int CmdHpf(const char *Cmd)
1472 {
1473 int i;
1474 int accum = 0;
1475
1476 for (i = 10; i < GraphTraceLen; ++i)
1477 accum += GraphBuffer[i];
1478 accum /= (GraphTraceLen - 10);
1479 for (i = 0; i < GraphTraceLen; ++i)
1480 GraphBuffer[i] -= accum;
1481
1482 RepaintGraphWindow();
1483 return 0;
1484 }
1485
1486 int CmdSamples(const char *Cmd)
1487 {
1488 uint8_t got[40000] = {0x00};
1489
1490 int n = strtol(Cmd, NULL, 0);
1491 if (n == 0)
1492 n = 20000;
1493
1494 if (n > sizeof(got))
1495 n = sizeof(got);
1496
1497 PrintAndLog("Reading %d samples from device memory\n", n);
1498 GetFromBigBuf(got,n,0);
1499 WaitForResponse(CMD_ACK,NULL);
1500 for (int j = 0; j < n; j++) {
1501 GraphBuffer[j] = ((int)got[j]) - 128;
1502 }
1503 GraphTraceLen = n;
1504 RepaintGraphWindow();
1505 return 0;
1506 }
1507
1508 int CmdTuneSamples(const char *Cmd)
1509 {
1510 int timeout = 0;
1511 printf("\nMeasuring antenna characteristics, please wait...");
1512
1513 UsbCommand c = {CMD_MEASURE_ANTENNA_TUNING};
1514 SendCommand(&c);
1515
1516 UsbCommand resp;
1517 while(!WaitForResponseTimeout(CMD_MEASURED_ANTENNA_TUNING,&resp,1000)) {
1518 timeout++;
1519 printf(".");
1520 if (timeout > 7) {
1521 PrintAndLog("\nNo response from Proxmark. Aborting...");
1522 return 1;
1523 }
1524 }
1525
1526 int peakv, peakf;
1527 int vLf125, vLf134, vHf;
1528 vLf125 = resp.arg[0] & 0xffff;
1529 vLf134 = resp.arg[0] >> 16;
1530 vHf = resp.arg[1] & 0xffff;;
1531 peakf = resp.arg[2] & 0xffff;
1532 peakv = resp.arg[2] >> 16;
1533 PrintAndLog("");
1534 PrintAndLog("# LF antenna: %5.2f V @ 125.00 kHz", vLf125/1000.0);
1535 PrintAndLog("# LF antenna: %5.2f V @ 134.00 kHz", vLf134/1000.0);
1536 PrintAndLog("# LF optimal: %5.2f V @%9.2f kHz", peakv/1000.0, 12000.0/(peakf+1));
1537 PrintAndLog("# HF antenna: %5.2f V @ 13.56 MHz", vHf/1000.0);
1538 if (peakv<2000)
1539 PrintAndLog("# Your LF antenna is unusable.");
1540 else if (peakv<10000)
1541 PrintAndLog("# Your LF antenna is marginal.");
1542 if (vHf<2000)
1543 PrintAndLog("# Your HF antenna is unusable.");
1544 else if (vHf<5000)
1545 PrintAndLog("# Your HF antenna is marginal.");
1546
1547 for (int i = 0; i < 256; i++) {
1548 GraphBuffer[i] = resp.d.asBytes[i] - 128;
1549 }
1550
1551 PrintAndLog("Done! Divisor 89 is 134khz, 95 is 125khz.\n");
1552 PrintAndLog("\n");
1553 GraphTraceLen = 256;
1554 ShowGraphWindow();
1555
1556 return 0;
1557 }
1558
1559
1560 int CmdLoad(const char *Cmd)
1561 {
1562 char filename[FILE_PATH_SIZE] = {0x00};
1563 int len = 0;
1564
1565 len = strlen(Cmd);
1566 if (len > FILE_PATH_SIZE) len = FILE_PATH_SIZE;
1567 memcpy(filename, Cmd, len);
1568
1569 FILE *f = fopen(filename, "r");
1570 if (!f) {
1571 PrintAndLog("couldn't open '%s'", filename);
1572 return 0;
1573 }
1574
1575 GraphTraceLen = 0;
1576 char line[80];
1577 while (fgets(line, sizeof (line), f)) {
1578 GraphBuffer[GraphTraceLen] = atoi(line);
1579 GraphTraceLen++;
1580 }
1581 fclose(f);
1582 PrintAndLog("loaded %d samples", GraphTraceLen);
1583 RepaintGraphWindow();
1584 return 0;
1585 }
1586
1587 int CmdLtrim(const char *Cmd)
1588 {
1589 int ds = atoi(Cmd);
1590
1591 for (int i = ds; i < GraphTraceLen; ++i)
1592 GraphBuffer[i-ds] = GraphBuffer[i];
1593 GraphTraceLen -= ds;
1594
1595 RepaintGraphWindow();
1596 return 0;
1597 }
1598
1599 // trim graph to input argument length
1600 int CmdRtrim(const char *Cmd)
1601 {
1602 int ds = atoi(Cmd);
1603
1604 GraphTraceLen = ds;
1605
1606 RepaintGraphWindow();
1607 return 0;
1608 }
1609
1610 /*
1611 * Manchester demodulate a bitstream. The bitstream needs to be already in
1612 * the GraphBuffer as 0 and 1 values
1613 *
1614 * Give the clock rate as argument in order to help the sync - the algorithm
1615 * resyncs at each pulse anyway.
1616 *
1617 * Not optimized by any means, this is the 1st time I'm writing this type of
1618 * routine, feel free to improve...
1619 *
1620 * 1st argument: clock rate (as number of samples per clock rate)
1621 * Typical values can be 64, 32, 128...
1622 */
1623 int CmdManchesterDemod(const char *Cmd)
1624 {
1625 int i, j, invert= 0;
1626 int bit;
1627 int clock;
1628 int lastval = 0;
1629 int low = 0;
1630 int high = 0;
1631 int hithigh, hitlow, first;
1632 int lc = 0;
1633 int bitidx = 0;
1634 int bit2idx = 0;
1635 int warnings = 0;
1636
1637 /* check if we're inverting output */
1638 if (*Cmd == 'i')
1639 {
1640 PrintAndLog("Inverting output");
1641 invert = 1;
1642 ++Cmd;
1643 do
1644 ++Cmd;
1645 while(*Cmd == ' '); // in case a 2nd argument was given
1646 }
1647
1648 /* Holds the decoded bitstream: each clock period contains 2 bits */
1649 /* later simplified to 1 bit after manchester decoding. */
1650 /* Add 10 bits to allow for noisy / uncertain traces without aborting */
1651 /* int BitStream[GraphTraceLen*2/clock+10]; */
1652
1653 /* But it does not work if compiling on WIndows: therefore we just allocate a */
1654 /* large array */
1655 uint8_t BitStream[MAX_GRAPH_TRACE_LEN] = {0};
1656
1657 /* Detect high and lows */
1658 for (i = 0; i < GraphTraceLen; i++)
1659 {
1660 if (GraphBuffer[i] > high)
1661 high = GraphBuffer[i];
1662 else if (GraphBuffer[i] < low)
1663 low = GraphBuffer[i];
1664 }
1665
1666 /* Get our clock */
1667 clock = GetClock(Cmd, high, 1);
1668
1669 int tolerance = clock/4;
1670
1671 /* Detect first transition */
1672 /* Lo-Hi (arbitrary) */
1673 /* skip to the first high */
1674 for (i= 0; i < GraphTraceLen; i++)
1675 if (GraphBuffer[i] == high)
1676 break;
1677 /* now look for the first low */
1678 for (; i < GraphTraceLen; i++)
1679 {
1680 if (GraphBuffer[i] == low)
1681 {
1682 lastval = i;
1683 break;
1684 }
1685 }
1686
1687 /* If we're not working with 1/0s, demod based off clock */
1688 if (high != 1)
1689 {
1690 bit = 0; /* We assume the 1st bit is zero, it may not be
1691 * the case: this routine (I think) has an init problem.
1692 * Ed.
1693 */
1694 for (; i < (int)(GraphTraceLen / clock); i++)
1695 {
1696 hithigh = 0;
1697 hitlow = 0;
1698 first = 1;
1699
1700 /* Find out if we hit both high and low peaks */
1701 for (j = 0; j < clock; j++)
1702 {
1703 if (GraphBuffer[(i * clock) + j] == high)
1704 hithigh = 1;
1705 else if (GraphBuffer[(i * clock) + j] == low)
1706 hitlow = 1;
1707
1708 /* it doesn't count if it's the first part of our read
1709 because it's really just trailing from the last sequence */
1710 if (first && (hithigh || hitlow))
1711 hithigh = hitlow = 0;
1712 else
1713 first = 0;
1714
1715 if (hithigh && hitlow)
1716 break;
1717 }
1718
1719 /* If we didn't hit both high and low peaks, we had a bit transition */
1720 if (!hithigh || !hitlow)
1721 bit ^= 1;
1722
1723 BitStream[bit2idx++] = bit ^ invert;
1724 }
1725 }
1726
1727 /* standard 1/0 bitstream */
1728 else
1729 {
1730
1731 /* Then detect duration between 2 successive transitions */
1732 for (bitidx = 1; i < GraphTraceLen; i++)
1733 {
1734 if (GraphBuffer[i-1] != GraphBuffer[i])
1735 {
1736 lc = i-lastval;
1737 lastval = i;
1738
1739 // Error check: if bitidx becomes too large, we do not
1740 // have a Manchester encoded bitstream or the clock is really
1741 // wrong!
1742 if (bitidx > (GraphTraceLen*2/clock+8) ) {
1743 PrintAndLog("Error: the clock you gave is probably wrong, aborting.");
1744 return 0;
1745 }
1746 // Then switch depending on lc length:
1747 // Tolerance is 1/4 of clock rate (arbitrary)
1748 if (abs(lc-clock/2) < tolerance) {
1749 // Short pulse : either "1" or "0"
1750 BitStream[bitidx++]=GraphBuffer[i-1];
1751 } else if (abs(lc-clock) < tolerance) {
1752 // Long pulse: either "11" or "00"
1753 BitStream[bitidx++]=GraphBuffer[i-1];
1754 BitStream[bitidx++]=GraphBuffer[i-1];
1755 } else {
1756 // Error
1757 warnings++;
1758 PrintAndLog("Warning: Manchester decode error for pulse width detection.");
1759 PrintAndLog("(too many of those messages mean either the stream is not Manchester encoded, or clock is wrong)");
1760
1761 if (warnings > 10)
1762 {
1763 PrintAndLog("Error: too many detection errors, aborting.");
1764 return 0;
1765 }
1766 }
1767 }
1768 }
1769
1770 // At this stage, we now have a bitstream of "01" ("1") or "10" ("0"), parse it into final decoded bitstream
1771 // Actually, we overwrite BitStream with the new decoded bitstream, we just need to be careful
1772 // to stop output at the final bitidx2 value, not bitidx
1773 for (i = 0; i < bitidx; i += 2) {
1774 if ((BitStream[i] == 0) && (BitStream[i+1] == 1)) {
1775 BitStream[bit2idx++] = 1 ^ invert;
1776 } else if ((BitStream[i] == 1) && (BitStream[i+1] == 0)) {
1777 BitStream[bit2idx++] = 0 ^ invert;
1778 } else {
1779 // We cannot end up in this state, this means we are unsynchronized,
1780 // move up 1 bit:
1781 i++;
1782 warnings++;
1783 PrintAndLog("Unsynchronized, resync...");
1784 PrintAndLog("(too many of those messages mean the stream is not Manchester encoded)");
1785
1786 if (warnings > 10)
1787 {
1788 PrintAndLog("Error: too many decode errors, aborting.");
1789 return 0;
1790 }
1791 }
1792 }
1793 }
1794
1795 PrintAndLog("Manchester decoded bitstream");
1796 // Now output the bitstream to the scrollback by line of 16 bits
1797 for (i = 0; i < (bit2idx-16); i+=16) {
1798 PrintAndLog("%i %i %i %i %i %i %i %i %i %i %i %i %i %i %i %i",
1799 BitStream[i],
1800 BitStream[i+1],
1801 BitStream[i+2],
1802 BitStream[i+3],
1803 BitStream[i+4],
1804 BitStream[i+5],
1805 BitStream[i+6],
1806 BitStream[i+7],
1807 BitStream[i+8],
1808 BitStream[i+9],
1809 BitStream[i+10],
1810 BitStream[i+11],
1811 BitStream[i+12],
1812 BitStream[i+13],
1813 BitStream[i+14],
1814 BitStream[i+15]);
1815 }
1816 return 0;
1817 }
1818
1819 /* Modulate our data into manchester */
1820 int CmdManchesterMod(const char *Cmd)
1821 {
1822 int i, j;
1823 int clock;
1824 int bit, lastbit, wave;
1825
1826 /* Get our clock */
1827 clock = GetClock(Cmd, 0, 1);
1828
1829 wave = 0;
1830 lastbit = 1;
1831 for (i = 0; i < (int)(GraphTraceLen / clock); i++)
1832 {
1833 bit = GraphBuffer[i * clock] ^ 1;
1834
1835 for (j = 0; j < (int)(clock/2); j++)
1836 GraphBuffer[(i * clock) + j] = bit ^ lastbit ^ wave;
1837 for (j = (int)(clock/2); j < clock; j++)
1838 GraphBuffer[(i * clock) + j] = bit ^ lastbit ^ wave ^ 1;
1839
1840 /* Keep track of how we start our wave and if we changed or not this time */
1841 wave ^= bit ^ lastbit;
1842 lastbit = bit;
1843 }
1844
1845 RepaintGraphWindow();
1846 return 0;
1847 }
1848
1849 int CmdNorm(const char *Cmd)
1850 {
1851 int i;
1852 int max = INT_MIN, min = INT_MAX;
1853
1854 for (i = 10; i < GraphTraceLen; ++i) {
1855 if (GraphBuffer[i] > max)
1856 max = GraphBuffer[i];
1857 if (GraphBuffer[i] < min)
1858 min = GraphBuffer[i];
1859 }
1860
1861 if (max != min) {
1862 for (i = 0; i < GraphTraceLen; ++i) {
1863 GraphBuffer[i] = (GraphBuffer[i] - ((max + min) / 2)) * 256 /
1864 (max - min);
1865 //marshmelow: adjusted *1000 to *256 to make +/- 128 so demod commands still work
1866 }
1867 }
1868 RepaintGraphWindow();
1869 return 0;
1870 }
1871
1872 int CmdPlot(const char *Cmd)
1873 {
1874 ShowGraphWindow();
1875 return 0;
1876 }
1877
1878 int CmdSave(const char *Cmd)
1879 {
1880 char filename[FILE_PATH_SIZE] = {0x00};
1881 int len = 0;
1882
1883 len = strlen(Cmd);
1884 if (len > FILE_PATH_SIZE) len = FILE_PATH_SIZE;
1885 memcpy(filename, Cmd, len);
1886
1887
1888 FILE *f = fopen(filename, "w");
1889 if(!f) {
1890 PrintAndLog("couldn't open '%s'", filename);
1891 return 0;
1892 }
1893 int i;
1894 for (i = 0; i < GraphTraceLen; i++) {
1895 fprintf(f, "%d\n", GraphBuffer[i]);
1896 }
1897 fclose(f);
1898 PrintAndLog("saved to '%s'", Cmd);
1899 return 0;
1900 }
1901
1902 int CmdScale(const char *Cmd)
1903 {
1904 CursorScaleFactor = atoi(Cmd);
1905 if (CursorScaleFactor == 0) {
1906 PrintAndLog("bad, can't have zero scale");
1907 CursorScaleFactor = 1;
1908 }
1909 RepaintGraphWindow();
1910 return 0;
1911 }
1912
1913 int CmdThreshold(const char *Cmd)
1914 {
1915 int threshold = atoi(Cmd);
1916
1917 for (int i = 0; i < GraphTraceLen; ++i) {
1918 if (GraphBuffer[i] >= threshold)
1919 GraphBuffer[i] = 1;
1920 else
1921 GraphBuffer[i] = -1;
1922 }
1923 RepaintGraphWindow();
1924 return 0;
1925 }
1926
1927 int CmdDirectionalThreshold(const char *Cmd)
1928 {
1929 int8_t upThres = param_get8(Cmd, 0);
1930 int8_t downThres = param_get8(Cmd, 1);
1931
1932 printf("Applying Up Threshold: %d, Down Threshold: %d\n", upThres, downThres);
1933
1934 int lastValue = GraphBuffer[0];
1935 GraphBuffer[0] = 0; // Will be changed at the end, but init 0 as we adjust to last samples value if no threshold kicks in.
1936
1937 for (int i = 1; i < GraphTraceLen; ++i) {
1938 // Apply first threshold to samples heading up
1939 if (GraphBuffer[i] >= upThres && GraphBuffer[i] > lastValue)
1940 {
1941 lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it.
1942 GraphBuffer[i] = 1;
1943 }
1944 // Apply second threshold to samples heading down
1945 else if (GraphBuffer[i] <= downThres && GraphBuffer[i] < lastValue)
1946 {
1947 lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it.
1948 GraphBuffer[i] = -1;
1949 }
1950 else
1951 {
1952 lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it.
1953 GraphBuffer[i] = GraphBuffer[i-1];
1954
1955 }
1956 }
1957 GraphBuffer[0] = GraphBuffer[1]; // Aline with first edited sample.
1958 RepaintGraphWindow();
1959 return 0;
1960 }
1961
1962 int CmdZerocrossings(const char *Cmd)
1963 {
1964 // Zero-crossings aren't meaningful unless the signal is zero-mean.
1965 CmdHpf("");
1966
1967 int sign = 1;
1968 int zc = 0;
1969 int lastZc = 0;
1970
1971 for (int i = 0; i < GraphTraceLen; ++i) {
1972 if (GraphBuffer[i] * sign >= 0) {
1973 // No change in sign, reproduce the previous sample count.
1974 zc++;
1975 GraphBuffer[i] = lastZc;
1976 } else {
1977 // Change in sign, reset the sample count.
1978 sign = -sign;
1979 GraphBuffer[i] = lastZc;
1980 if (sign > 0) {
1981 lastZc = zc;
1982 zc = 0;
1983 }
1984 }
1985 }
1986
1987 RepaintGraphWindow();
1988 return 0;
1989 }
1990
1991 static command_t CommandTable[] =
1992 {
1993 {"help", CmdHelp, 1, "This help"},
1994 {"amp", CmdAmp, 1, "Amplify peaks"},
1995 {"askdemod", Cmdaskdemod, 1, "<0 or 1> -- Attempt to demodulate simple ASK tags"},
1996 {"askmandemod", Cmdaskmandemod, 1, "[clock] [invert<0|1>] -- Attempt to demodulate ASK/Manchester tags and output binary (args optional)"},
1997 {"askrawdemod", Cmdaskrawdemod, 1, "[clock] [invert<0|1>] -- Attempt to demodulate ASK tags and output bin (args optional)"},
1998 {"autocorr", CmdAutoCorr, 1, "<window length> -- Autocorrelation over window"},
1999 {"biphaserawdecode",CmdBiphaseDecodeRaw,1,"[offset] [invert<0|1>] Biphase decode bin stream in demod buffer (offset = 0|1 bits to shift the decode start)"},
2000 {"bitsamples", CmdBitsamples, 0, "Get raw samples as bitstring"},
2001 {"bitstream", CmdBitstream, 1, "[clock rate] -- Convert waveform into a bitstream"},
2002 {"buffclear", CmdBuffClear, 1, "Clear sample buffer and graph window"},
2003 {"dec", CmdDec, 1, "Decimate samples"},
2004 {"detectclock", CmdDetectClockRate, 1, "Detect ASK clock rate"},
2005 {"fskdemod", CmdFSKdemod, 1, "Demodulate graph window as a HID FSK"},
2006 {"fskawiddemod", CmdFSKdemodAWID, 1, "Demodulate graph window as an AWID FSK tag using raw"},
2007 {"fskfcdetect", CmdFSKfcDetect, 1, "Try to detect the Field Clock of an FSK wave"},
2008 {"fskhiddemod", CmdFSKdemodHID, 1, "Demodulate graph window as a HID FSK tag using raw"},
2009 {"fskiodemod", CmdFSKdemodIO, 1, "Demodulate graph window as an IO Prox tag FSK using raw"},
2010 {"fskpyramiddemod",CmdFSKdemodPyramid,1, "Demodulate graph window as a Pyramid FSK tag using raw"},
2011 {"fskparadoxdemod",CmdFSKdemodParadox,1, "Demodulate graph window as a Paradox FSK tag using raw"},
2012 {"fskrawdemod", CmdFSKrawdemod, 1, "[clock rate] [invert] [rchigh] [rclow] Demodulate graph window from FSK to bin (clock = 50)(invert = 1|0)(rchigh = 10)(rclow=8)"},
2013 {"grid", CmdGrid, 1, "<x> <y> -- overlay grid on graph window, use zero value to turn off either"},
2014 {"hexsamples", CmdHexsamples, 0, "<bytes> [<offset>] -- Dump big buffer as hex bytes"},
2015 {"hide", CmdHide, 1, "Hide graph window"},
2016 {"hpf", CmdHpf, 1, "Remove DC offset from trace"},
2017 {"load", CmdLoad, 1, "<filename> -- Load trace (to graph window"},
2018 {"ltrim", CmdLtrim, 1, "<samples> -- Trim samples from left of trace"},
2019 {"rtrim", CmdRtrim, 1, "<location to end trace> -- Trim samples from right of trace"},
2020 {"mandemod", CmdManchesterDemod, 1, "[i] [clock rate] -- Manchester demodulate binary stream (option 'i' to invert output)"},
2021 {"manrawdecode", Cmdmandecoderaw, 1, "Manchester decode binary stream already in graph buffer"},
2022 {"manmod", CmdManchesterMod, 1, "[clock rate] -- Manchester modulate a binary stream"},
2023 {"norm", CmdNorm, 1, "Normalize max/min to +/-128"},
2024 {"plot", CmdPlot, 1, "Show graph window (hit 'h' in window for keystroke help)"},
2025 {"pskclean", CmdPskClean, 1, "Attempt to clean psk wave"},
2026 {"pskdetectclock",CmdDetectNRZpskClockRate, 1, "Detect ASK, PSK, or NRZ clock rate"},
2027 {"pskindalademod",CmdIndalaDecode, 1, "[clock] [invert<0|1>] -- Attempt to demodulate psk1 indala tags and output ID binary & hex (args optional)"},
2028 {"psk1nrzrawdemod",CmdpskNRZrawDemod, 1, "[clock] [invert<0|1>] -- Attempt to demodulate psk1 or nrz tags and output binary (args optional)"},
2029 {"psk2rawdemod", CmdPSK2rawDemod, 1, "[clock] [invert<0|1>] -- Attempt to demodulate psk2 tags and output binary (args optional)"},
2030 {"samples", CmdSamples, 0, "[512 - 40000] -- Get raw samples for graph window"},
2031 {"save", CmdSave, 1, "<filename> -- Save trace (from graph window)"},
2032 {"scale", CmdScale, 1, "<int> -- Set cursor display scale"},
2033 {"setdebugmode", CmdSetDebugMode, 1, "<0|1> -- Turn on or off Debugging Mode for demods"},
2034 {"shiftgraphzero",CmdGraphShiftZero, 1, "<shift> -- Shift 0 for Graphed wave + or - shift value"},
2035 {"threshold", CmdThreshold, 1, "<threshold> -- Maximize/minimize every value in the graph window depending on threshold"},
2036 {"dirthreshold", CmdDirectionalThreshold, 1, "<thres up> <thres down> -- Max rising higher up-thres/ Min falling lower down-thres, keep rest as prev."},
2037 {"tune", CmdTuneSamples, 0, "Get hw tune samples for graph window"},
2038 {"zerocrossings", CmdZerocrossings, 1, "Count time between zero-crossings"},
2039 {NULL, NULL, 0, NULL}
2040 };
2041
2042 int CmdData(const char *Cmd)
2043 {
2044 CmdsParse(CommandTable, Cmd);
2045 return 0;
2046 }
2047
2048 int CmdHelp(const char *Cmd)
2049 {
2050 CmdsHelp(CommandTable);
2051 return 0;
2052 }
Proxmark3 GIT tracking
Impressum, Datenschutz