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