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