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