]> git.zerfleddert.de Git - proxmark3-svn/blob - client/cmddata.c
Added undec to un-decimate data on the client side, so we can use all those sweet...
[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 //We have memory, don't we?
553 int swap[MAX_GRAPH_TRACE_LEN] = { 0 };
554 uint32_t i = 0 ,j = 0;
555 while(j+1 < MAX_GRAPH_TRACE_LEN && i < GraphTraceLen)
556 {
557 swap[j] = GraphBuffer[i];
558 swap[j+1] = GraphBuffer[i];
559 i++;
560 j+=2;
561 }
562 memcpy(GraphBuffer,swap, j);
563 GraphTraceLen = j;
564 PrintAndLog("Undecimated by 2");
565 RepaintGraphWindow();
566
567 /*
568 * Something is not right here, need to look into it,
569 * the undec seems to only operate on half the values **/
570 return 0;
571 }
572
573 /* Print our clock rate */
574 // uses data from graphbuffer
575 int CmdDetectClockRate(const char *Cmd)
576 {
577 GetClock("",0,0);
578 //int clock = DetectASKClock(0);
579 //PrintAndLog("Auto-detected clock rate: %d", clock);
580 return 0;
581 }
582
583 //by marshmellow
584 //fsk raw demod and print binary
585 //takes 4 arguments - Clock, invert, rchigh, rclow
586 //defaults: clock = 50, invert=0, rchigh=10, rclow=8 (RF/10 RF/8 (fsk2a))
587 int CmdFSKrawdemod(const char *Cmd)
588 {
589 //raw fsk demod no manchester decoding no start bit finding just get binary from wave
590 //set defaults
591 int rfLen = 50;
592 int invert=0;
593 int fchigh=10;
594 int fclow=8;
595 //set options from parameters entered with the command
596 sscanf(Cmd, "%i %i %i %i", &rfLen, &invert, &fchigh, &fclow);
597
598 if (strlen(Cmd)>0 && strlen(Cmd)<=2) {
599 //rfLen=param_get8(Cmd, 0); //if rfLen option only is used
600 if (rfLen==1){
601 invert=1; //if invert option only is used
602 rfLen = 50;
603 } else if(rfLen==0) rfLen=50;
604 }
605 PrintAndLog("Args invert: %d - Clock:%d - fchigh:%d - fclow: %d",invert,rfLen,fchigh, fclow);
606 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
607 size_t BitLen = getFromGraphBuf(BitStream);
608 int size = fskdemod(BitStream,BitLen,(uint8_t)rfLen,(uint8_t)invert,(uint8_t)fchigh,(uint8_t)fclow);
609 if (size>0){
610 PrintAndLog("FSK decoded bitstream:");
611 setDemodBuf(BitStream,size);
612
613 // Now output the bitstream to the scrollback by line of 16 bits
614 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
615 printBitStream(BitStream,size);
616 } else{
617 PrintAndLog("no FSK data found");
618 }
619 return 0;
620 }
621
622 //by marshmellow (based on existing demod + holiman's refactor)
623 //HID Prox demod - FSK RF/50 with preamble of 00011101 (then manchester encoded)
624 //print full HID Prox ID and some bit format details if found
625 int CmdFSKdemodHID(const char *Cmd)
626 {
627 //raw fsk demod no manchester decoding no start bit finding just get binary from wave
628 uint32_t hi2=0, hi=0, lo=0;
629
630 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
631 size_t BitLen = getFromGraphBuf(BitStream);
632 //get binary from fsk wave
633 size_t size = HIDdemodFSK(BitStream,BitLen,&hi2,&hi,&lo);
634 if (size<0){
635 PrintAndLog("Error demoding fsk");
636 return 0;
637 }
638 if (hi2==0 && hi==0 && lo==0) return 0;
639 if (hi2 != 0){ //extra large HID tags
640 PrintAndLog("HID Prox TAG ID: %x%08x%08x (%d)",
641 (unsigned int) hi2, (unsigned int) hi, (unsigned int) lo, (unsigned int) (lo>>1) & 0xFFFF);
642 setDemodBuf(BitStream,BitLen);
643 return 1;
644 }
645 else { //standard HID tags <38 bits
646 //Dbprintf("TAG ID: %x%08x (%d)",(unsigned int) hi, (unsigned int) lo, (unsigned int) (lo>>1) & 0xFFFF); //old print cmd
647 uint8_t fmtLen = 0;
648 uint32_t fc = 0;
649 uint32_t cardnum = 0;
650 if (((hi>>5)&1)==1){//if bit 38 is set then < 37 bit format is used
651 uint32_t lo2=0;
652 lo2=(((hi & 31) << 12) | (lo>>20)); //get bits 21-37 to check for format len bit
653 uint8_t idx3 = 1;
654 while(lo2>1){ //find last bit set to 1 (format len bit)
655 lo2=lo2>>1;
656 idx3++;
657 }
658 fmtLen =idx3+19;
659 fc =0;
660 cardnum=0;
661 if(fmtLen==26){
662 cardnum = (lo>>1)&0xFFFF;
663 fc = (lo>>17)&0xFF;
664 }
665 if(fmtLen==34){
666 cardnum = (lo>>1)&0xFFFF;
667 fc= ((hi&1)<<15)|(lo>>17);
668 }
669 if(fmtLen==35){
670 cardnum = (lo>>1)&0xFFFFF;
671 fc = ((hi&1)<<11)|(lo>>21);
672 }
673 }
674 else { //if bit 38 is not set then 37 bit format is used
675 fmtLen = 37;
676 fc = 0;
677 cardnum = 0;
678 if(fmtLen == 37){
679 cardnum = (lo>>1)&0x7FFFF;
680 fc = ((hi&0xF)<<12)|(lo>>20);
681 }
682 }
683 PrintAndLog("HID Prox TAG ID: %x%08x (%d) - Format Len: %dbit - FC: %d - Card: %d",
684 (unsigned int) hi, (unsigned int) lo, (unsigned int) (lo>>1) & 0xFFFF,
685 (unsigned int) fmtLen, (unsigned int) fc, (unsigned int) cardnum);
686 setDemodBuf(BitStream,BitLen);
687 return 1;
688 }
689 return 0;
690 }
691
692 //by marshmellow
693 //IO-Prox demod - FSK RF/64 with preamble of 000000001
694 //print ioprox ID and some format details
695 int CmdFSKdemodIO(const char *Cmd)
696 {
697 //raw fsk demod no manchester decoding no start bit finding just get binary from wave
698 //set defaults
699 int idx=0;
700 //something in graphbuffer
701 if (GraphTraceLen < 65) return 0;
702 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
703 size_t BitLen = getFromGraphBuf(BitStream);
704 //get binary from fsk wave
705 // PrintAndLog("DEBUG: got buff");
706 idx = IOdemodFSK(BitStream,BitLen);
707 if (idx<0){
708 //PrintAndLog("Error demoding fsk");
709 return 0;
710 }
711 // PrintAndLog("DEBUG: Got IOdemodFSK");
712 if (idx==0){
713 //PrintAndLog("IO Prox Data not found - FSK Data:");
714 //if (BitLen > 92) printBitStream(BitStream,92);
715 return 0;
716 }
717 //Index map
718 //0 10 20 30 40 50 60
719 //| | | | | | |
720 //01234567 8 90123456 7 89012345 6 78901234 5 67890123 4 56789012 3 45678901 23
721 //-----------------------------------------------------------------------------
722 //00000000 0 11110000 1 facility 1 version* 1 code*one 1 code*two 1 ???????? 11
723 //
724 //XSF(version)facility:codeone+codetwo (raw)
725 //Handle the data
726 if (idx+64>BitLen) return 0;
727 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]);
728 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]);
729 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]);
730 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]);
731 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]);
732 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]);
733 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]);
734
735 uint32_t code = bytebits_to_byte(BitStream+idx,32);
736 uint32_t code2 = bytebits_to_byte(BitStream+idx+32,32);
737 uint8_t version = bytebits_to_byte(BitStream+idx+27,8); //14,4
738 uint8_t facilitycode = bytebits_to_byte(BitStream+idx+18,8) ;
739 uint16_t number = (bytebits_to_byte(BitStream+idx+36,8)<<8)|(bytebits_to_byte(BitStream+idx+45,8)); //36,9
740 PrintAndLog("IO Prox XSF(%02d)%02x:%05d (%08x%08x)",version,facilitycode,number,code,code2);
741 int i;
742 for (i=0;i<64;++i)
743 DemodBuffer[i]=BitStream[idx++];
744
745 DemodBufferLen=64;
746 return 1;
747 }
748 int CmdFSKdemod(const char *Cmd) //old CmdFSKdemod needs updating
749 {
750 static const int LowTone[] = {
751 1, 1, 1, 1, 1, -1, -1, -1, -1, -1,
752 1, 1, 1, 1, 1, -1, -1, -1, -1, -1,
753 1, 1, 1, 1, 1, -1, -1, -1, -1, -1,
754 1, 1, 1, 1, 1, -1, -1, -1, -1, -1,
755 1, 1, 1, 1, 1, -1, -1, -1, -1, -1
756 };
757 static const int HighTone[] = {
758 1, 1, 1, 1, 1, -1, -1, -1, -1,
759 1, 1, 1, 1, -1, -1, -1, -1,
760 1, 1, 1, 1, -1, -1, -1, -1,
761 1, 1, 1, 1, -1, -1, -1, -1,
762 1, 1, 1, 1, -1, -1, -1, -1,
763 1, 1, 1, 1, -1, -1, -1, -1, -1,
764 };
765
766 int lowLen = sizeof (LowTone) / sizeof (int);
767 int highLen = sizeof (HighTone) / sizeof (int);
768 int convLen = (highLen > lowLen) ? highLen : lowLen;
769 uint32_t hi = 0, lo = 0;
770
771 int i, j;
772 int minMark = 0, maxMark = 0;
773
774 for (i = 0; i < GraphTraceLen - convLen; ++i) {
775 int lowSum = 0, highSum = 0;
776
777 for (j = 0; j < lowLen; ++j) {
778 lowSum += LowTone[j]*GraphBuffer[i+j];
779 }
780 for (j = 0; j < highLen; ++j) {
781 highSum += HighTone[j] * GraphBuffer[i + j];
782 }
783 lowSum = abs(100 * lowSum / lowLen);
784 highSum = abs(100 * highSum / highLen);
785 GraphBuffer[i] = (highSum << 16) | lowSum;
786 }
787
788 for(i = 0; i < GraphTraceLen - convLen - 16; ++i) {
789 int lowTot = 0, highTot = 0;
790 // 10 and 8 are f_s divided by f_l and f_h, rounded
791 for (j = 0; j < 10; ++j) {
792 lowTot += (GraphBuffer[i+j] & 0xffff);
793 }
794 for (j = 0; j < 8; j++) {
795 highTot += (GraphBuffer[i + j] >> 16);
796 }
797 GraphBuffer[i] = lowTot - highTot;
798 if (GraphBuffer[i] > maxMark) maxMark = GraphBuffer[i];
799 if (GraphBuffer[i] < minMark) minMark = GraphBuffer[i];
800 }
801
802 GraphTraceLen -= (convLen + 16);
803 RepaintGraphWindow();
804
805 // Find bit-sync (3 lo followed by 3 high) (HID ONLY)
806 int max = 0, maxPos = 0;
807 for (i = 0; i < 6000; ++i) {
808 int dec = 0;
809 for (j = 0; j < 3 * lowLen; ++j) {
810 dec -= GraphBuffer[i + j];
811 }
812 for (; j < 3 * (lowLen + highLen ); ++j) {
813 dec += GraphBuffer[i + j];
814 }
815 if (dec > max) {
816 max = dec;
817 maxPos = i;
818 }
819 }
820
821 // place start of bit sync marker in graph
822 GraphBuffer[maxPos] = maxMark;
823 GraphBuffer[maxPos + 1] = minMark;
824
825 maxPos += j;
826
827 // place end of bit sync marker in graph
828 GraphBuffer[maxPos] = maxMark;
829 GraphBuffer[maxPos+1] = minMark;
830
831 PrintAndLog("actual data bits start at sample %d", maxPos);
832 PrintAndLog("length %d/%d", highLen, lowLen);
833
834 uint8_t bits[46];
835 bits[sizeof(bits)-1] = '\0';
836
837 // find bit pairs and manchester decode them
838 for (i = 0; i < arraylen(bits) - 1; ++i) {
839 int dec = 0;
840 for (j = 0; j < lowLen; ++j) {
841 dec -= GraphBuffer[maxPos + j];
842 }
843 for (; j < lowLen + highLen; ++j) {
844 dec += GraphBuffer[maxPos + j];
845 }
846 maxPos += j;
847 // place inter bit marker in graph
848 GraphBuffer[maxPos] = maxMark;
849 GraphBuffer[maxPos + 1] = minMark;
850
851 // hi and lo form a 64 bit pair
852 hi = (hi << 1) | (lo >> 31);
853 lo = (lo << 1);
854 // store decoded bit as binary (in hi/lo) and text (in bits[])
855 if(dec < 0) {
856 bits[i] = '1';
857 lo |= 1;
858 } else {
859 bits[i] = '0';
860 }
861 }
862 PrintAndLog("bits: '%s'", bits);
863 PrintAndLog("hex: %08x %08x", hi, lo);
864 return 0;
865 }
866
867 int CmdDetectNRZpskClockRate(const char *Cmd)
868 {
869 GetNRZpskClock("",0,0);
870 return 0;
871 }
872
873 int PSKnrzDemod(const char *Cmd){
874 int invert=0;
875 int clk=0;
876 sscanf(Cmd, "%i %i", &clk, &invert);
877 if (invert != 0 && invert != 1) {
878 PrintAndLog("Invalid argument: %s", Cmd);
879 return -1;
880 }
881 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
882 size_t BitLen = getFromGraphBuf(BitStream);
883 int errCnt=0;
884 errCnt = pskNRZrawDemod(BitStream, &BitLen,&clk,&invert);
885 if (errCnt<0|| BitLen<16){ //throw away static - allow 1 and -1 (in case of threshold command first)
886 //PrintAndLog("no data found, clk: %d, invert: %d, numbits: %d, errCnt: %d",clk,invert,BitLen,errCnt);
887 return -1;
888 }
889 PrintAndLog("Tried PSK/NRZ Demod using Clock: %d - invert: %d - Bits Found: %d",clk,invert,BitLen);
890
891 //prime demod buffer for output
892 setDemodBuf(BitStream,BitLen);
893 return errCnt;
894 }
895 // Indala 26 bit decode
896 // by marshmellow
897 // optional arguments - same as CmdpskNRZrawDemod (clock & invert)
898 int CmdIndalaDecode(const char *Cmd)
899 {
900 uint8_t verbose = 1;
901 int ans;
902 if (strlen(Cmd)>0){
903 if (Cmd[0]=='0'){
904 verbose=0;
905 ans = PSKnrzDemod("32");
906 }else{
907 ans = PSKnrzDemod(Cmd);
908 }
909 } else{ //default to RF/32
910 ans = PSKnrzDemod("32");
911 }
912
913 if (ans < 0){
914 if (verbose)
915 PrintAndLog("Error1: %d",ans);
916 return 0;
917 }
918 uint8_t invert=0;
919 ans = indala26decode(DemodBuffer,(size_t *) &DemodBufferLen, &invert);
920 if (ans < 1) {
921 if (verbose)
922 PrintAndLog("Error2: %d",ans);
923 return -1;
924 }
925 char showbits[251];
926 if (invert)
927 if (verbose)
928 PrintAndLog("Had to invert bits");
929 //convert UID to HEX
930 uint32_t uid1, uid2, uid3, uid4, uid5, uid6, uid7;
931 int idx;
932 uid1=0;
933 uid2=0;
934 PrintAndLog("BitLen: %d",DemodBufferLen);
935 if (DemodBufferLen==64){
936 for( idx=0; idx<64; idx++) {
937 uid1=(uid1<<1)|(uid2>>31);
938 if (DemodBuffer[idx] == 0) {
939 uid2=(uid2<<1)|0;
940 showbits[idx]='0';
941 } else {
942 uid2=(uid2<<1)|1;
943 showbits[idx]='1';
944 }
945 }
946 showbits[idx]='\0';
947 PrintAndLog("Indala UID=%s (%x%08x)", showbits, uid1, uid2);
948 }
949 else {
950 uid3=0;
951 uid4=0;
952 uid5=0;
953 uid6=0;
954 uid7=0;
955 for( idx=0; idx<DemodBufferLen; idx++) {
956 uid1=(uid1<<1)|(uid2>>31);
957 uid2=(uid2<<1)|(uid3>>31);
958 uid3=(uid3<<1)|(uid4>>31);
959 uid4=(uid4<<1)|(uid5>>31);
960 uid5=(uid5<<1)|(uid6>>31);
961 uid6=(uid6<<1)|(uid7>>31);
962 if (DemodBuffer[idx] == 0) {
963 uid7=(uid7<<1)|0;
964 showbits[idx]='0';
965 }
966 else {
967 uid7=(uid7<<1)|1;
968 showbits[idx]='1';
969 }
970 }
971 showbits[idx]='\0';
972 PrintAndLog("Indala UID=%s (%x%08x%08x%08x%08x%08x%08x)", showbits, uid1, uid2, uid3, uid4, uid5, uid6, uid7);
973 }
974 return 1;
975 }
976
977 int CmdPskClean(const char *Cmd)
978 {
979 uint8_t bitStream[MAX_GRAPH_TRACE_LEN]={0};
980 size_t bitLen = getFromGraphBuf(bitStream);
981 pskCleanWave(bitStream, bitLen);
982 setGraphBuf(bitStream, bitLen);
983 return 0;
984 }
985
986 //by marshmellow
987 //takes 2 arguments - clock and invert both as integers
988 //attempts to demodulate ask only
989 //prints binary found and saves in graphbuffer for further commands
990 int CmdpskNRZrawDemod(const char *Cmd)
991 {
992 uint8_t verbose = 1;
993 int errCnt;
994 if (strlen(Cmd)>0){
995 if (Cmd[0]=='0')
996 verbose=0;
997 }
998
999 errCnt = PSKnrzDemod(Cmd);
1000 //output
1001 if (errCnt<0) return 0;
1002 if (errCnt>0){
1003 if (verbose)
1004 PrintAndLog("# Errors during Demoding (shown as 77 in bit stream): %d",errCnt);
1005 }
1006 PrintAndLog("PSK or NRZ demoded bitstream:");
1007 // Now output the bitstream to the scrollback by line of 16 bits
1008 printDemodBuff();
1009
1010 return 1;
1011 }
1012
1013 int CmdGrid(const char *Cmd)
1014 {
1015 sscanf(Cmd, "%i %i", &PlotGridX, &PlotGridY);
1016 PlotGridXdefault= PlotGridX;
1017 PlotGridYdefault= PlotGridY;
1018 RepaintGraphWindow();
1019 return 0;
1020 }
1021
1022 int CmdHexsamples(const char *Cmd)
1023 {
1024 int i, j;
1025 int requested = 0;
1026 int offset = 0;
1027 char string_buf[25];
1028 char* string_ptr = string_buf;
1029 uint8_t got[40000];
1030
1031 sscanf(Cmd, "%i %i", &requested, &offset);
1032
1033 /* if no args send something */
1034 if (requested == 0) {
1035 requested = 8;
1036 }
1037 if (offset + requested > sizeof(got)) {
1038 PrintAndLog("Tried to read past end of buffer, <bytes> + <offset> > 40000");
1039 return 0;
1040 }
1041
1042 GetFromBigBuf(got,requested,offset);
1043 WaitForResponse(CMD_ACK,NULL);
1044
1045 i = 0;
1046 for (j = 0; j < requested; j++) {
1047 i++;
1048 string_ptr += sprintf(string_ptr, "%02x ", got[j]);
1049 if (i == 8) {
1050 *(string_ptr - 1) = '\0'; // remove the trailing space
1051 PrintAndLog("%s", string_buf);
1052 string_buf[0] = '\0';
1053 string_ptr = string_buf;
1054 i = 0;
1055 }
1056 if (j == requested - 1 && string_buf[0] != '\0') { // print any remaining bytes
1057 *(string_ptr - 1) = '\0';
1058 PrintAndLog("%s", string_buf);
1059 string_buf[0] = '\0';
1060 }
1061 }
1062 return 0;
1063 }
1064
1065 int CmdHide(const char *Cmd)
1066 {
1067 HideGraphWindow();
1068 return 0;
1069 }
1070
1071 int CmdHpf(const char *Cmd)
1072 {
1073 int i;
1074 int accum = 0;
1075
1076 for (i = 10; i < GraphTraceLen; ++i)
1077 accum += GraphBuffer[i];
1078 accum /= (GraphTraceLen - 10);
1079 for (i = 0; i < GraphTraceLen; ++i)
1080 GraphBuffer[i] -= accum;
1081
1082 RepaintGraphWindow();
1083 return 0;
1084 }
1085 typedef struct {
1086 uint8_t * buffer;
1087 uint32_t numbits;
1088 uint32_t position;
1089 }BitstreamOut;
1090
1091 bool _headBit( BitstreamOut *stream)
1092 {
1093 int bytepos = stream->position >> 3; // divide by 8
1094 int bitpos = (stream->position++) & 7; // mask out 00000111
1095 return (*(stream->buffer + bytepos) >> (7-bitpos)) & 1;
1096 }
1097
1098 uint8_t getByte(uint8_t bits_per_sample, BitstreamOut* b)
1099 {
1100 int i;
1101 uint8_t val = 0;
1102 for(i =0 ; i < bits_per_sample; i++)
1103 {
1104 val |= (_headBit(b) << (7-i));
1105 }
1106 return val;
1107 }
1108
1109 int CmdSamples(const char *Cmd)
1110 {
1111 //If we get all but the last byte in bigbuf,
1112 // we don't have to worry about remaining trash
1113 // in the last byte in case the bits-per-sample
1114 // does not line up on byte boundaries
1115 uint8_t got[40000-1];
1116
1117 int n = strtol(Cmd, NULL, 0);
1118 if (n == 0)
1119 n = sizeof(got);
1120
1121 if (n > sizeof(got))
1122 n = sizeof(got);
1123
1124 PrintAndLog("Reading %d bytes from device memory\n", n);
1125 GetFromBigBuf(got,n,0);
1126 PrintAndLog("Data fetched");
1127 UsbCommand response;
1128 WaitForResponse(CMD_ACK, &response);
1129 uint8_t bits_per_sample = 8;
1130
1131 //Old devices without this feature would send 0 at arg[0]
1132 if(response.arg[0] > 0)
1133 {
1134 sample_config *sc = (sample_config *) response.d.asBytes;
1135 PrintAndLog("Samples @ %d bits/smpl, decimation 1:%d ", sc->bits_per_sample
1136 , sc->decimation);
1137 bits_per_sample = sc->bits_per_sample;
1138 }
1139 if(bits_per_sample < 8)
1140 {
1141 PrintAndLog("Unpacking...");
1142 BitstreamOut bout = { got, bits_per_sample * n, 0};
1143 int j =0;
1144 for (j = 0; j * bits_per_sample < n * 8 && j < sizeof(GraphBuffer); j++) {
1145 uint8_t sample = getByte(bits_per_sample, &bout);
1146 GraphBuffer[j] = ((int) sample )- 128;
1147 }
1148 GraphTraceLen = j;
1149 PrintAndLog("Unpacked %d samples" , j );
1150 }else
1151 {
1152 for (int j = 0; j < n; j++) {
1153 GraphBuffer[j] = ((int)got[j]) - 128;
1154 }
1155 GraphTraceLen = n;
1156 }
1157
1158 RepaintGraphWindow();
1159 return 0;
1160 }
1161
1162 int CmdTuneSamples(const char *Cmd)
1163 {
1164 int timeout = 0;
1165 printf("\nMeasuring antenna characteristics, please wait...");
1166
1167 UsbCommand c = {CMD_MEASURE_ANTENNA_TUNING};
1168 SendCommand(&c);
1169
1170 UsbCommand resp;
1171 while(!WaitForResponseTimeout(CMD_MEASURED_ANTENNA_TUNING,&resp,1000)) {
1172 timeout++;
1173 printf(".");
1174 if (timeout > 7) {
1175 PrintAndLog("\nNo response from Proxmark. Aborting...");
1176 return 1;
1177 }
1178 }
1179
1180 int peakv, peakf;
1181 int vLf125, vLf134, vHf;
1182 vLf125 = resp.arg[0] & 0xffff;
1183 vLf134 = resp.arg[0] >> 16;
1184 vHf = resp.arg[1] & 0xffff;;
1185 peakf = resp.arg[2] & 0xffff;
1186 peakv = resp.arg[2] >> 16;
1187 PrintAndLog("");
1188 PrintAndLog("# LF antenna: %5.2f V @ 125.00 kHz", vLf125/1000.0);
1189 PrintAndLog("# LF antenna: %5.2f V @ 134.00 kHz", vLf134/1000.0);
1190 PrintAndLog("# LF optimal: %5.2f V @%9.2f kHz", peakv/1000.0, 12000.0/(peakf+1));
1191 PrintAndLog("# HF antenna: %5.2f V @ 13.56 MHz", vHf/1000.0);
1192 if (peakv<2000)
1193 PrintAndLog("# Your LF antenna is unusable.");
1194 else if (peakv<10000)
1195 PrintAndLog("# Your LF antenna is marginal.");
1196 if (vHf<2000)
1197 PrintAndLog("# Your HF antenna is unusable.");
1198 else if (vHf<5000)
1199 PrintAndLog("# Your HF antenna is marginal.");
1200
1201 for (int i = 0; i < 256; i++) {
1202 GraphBuffer[i] = resp.d.asBytes[i] - 128;
1203 }
1204
1205 PrintAndLog("Done! Divisor 89 is 134khz, 95 is 125khz.\n");
1206 PrintAndLog("\n");
1207 GraphTraceLen = 256;
1208 ShowGraphWindow();
1209
1210 return 0;
1211 }
1212
1213
1214 int CmdLoad(const char *Cmd)
1215 {
1216 char filename[FILE_PATH_SIZE] = {0x00};
1217 int len = 0;
1218
1219 len = strlen(Cmd);
1220 if (len > FILE_PATH_SIZE) len = FILE_PATH_SIZE;
1221 memcpy(filename, Cmd, len);
1222
1223 FILE *f = fopen(filename, "r");
1224 if (!f) {
1225 PrintAndLog("couldn't open '%s'", filename);
1226 return 0;
1227 }
1228
1229 GraphTraceLen = 0;
1230 char line[80];
1231 while (fgets(line, sizeof (line), f)) {
1232 GraphBuffer[GraphTraceLen] = atoi(line);
1233 GraphTraceLen++;
1234 }
1235 fclose(f);
1236 PrintAndLog("loaded %d samples", GraphTraceLen);
1237 RepaintGraphWindow();
1238 return 0;
1239 }
1240
1241 int CmdLtrim(const char *Cmd)
1242 {
1243 int ds = atoi(Cmd);
1244
1245 for (int i = ds; i < GraphTraceLen; ++i)
1246 GraphBuffer[i-ds] = GraphBuffer[i];
1247 GraphTraceLen -= ds;
1248
1249 RepaintGraphWindow();
1250 return 0;
1251 }
1252 int CmdRtrim(const char *Cmd)
1253 {
1254 int ds = atoi(Cmd);
1255
1256 GraphTraceLen = ds;
1257
1258 RepaintGraphWindow();
1259 return 0;
1260 }
1261
1262 /*
1263 * Manchester demodulate a bitstream. The bitstream needs to be already in
1264 * the GraphBuffer as 0 and 1 values
1265 *
1266 * Give the clock rate as argument in order to help the sync - the algorithm
1267 * resyncs at each pulse anyway.
1268 *
1269 * Not optimized by any means, this is the 1st time I'm writing this type of
1270 * routine, feel free to improve...
1271 *
1272 * 1st argument: clock rate (as number of samples per clock rate)
1273 * Typical values can be 64, 32, 128...
1274 */
1275 int CmdManchesterDemod(const char *Cmd)
1276 {
1277 int i, j, invert= 0;
1278 int bit;
1279 int clock;
1280 int lastval = 0;
1281 int low = 0;
1282 int high = 0;
1283 int hithigh, hitlow, first;
1284 int lc = 0;
1285 int bitidx = 0;
1286 int bit2idx = 0;
1287 int warnings = 0;
1288
1289 /* check if we're inverting output */
1290 if (*Cmd == 'i')
1291 {
1292 PrintAndLog("Inverting output");
1293 invert = 1;
1294 ++Cmd;
1295 do
1296 ++Cmd;
1297 while(*Cmd == ' '); // in case a 2nd argument was given
1298 }
1299
1300 /* Holds the decoded bitstream: each clock period contains 2 bits */
1301 /* later simplified to 1 bit after manchester decoding. */
1302 /* Add 10 bits to allow for noisy / uncertain traces without aborting */
1303 /* int BitStream[GraphTraceLen*2/clock+10]; */
1304
1305 /* But it does not work if compiling on WIndows: therefore we just allocate a */
1306 /* large array */
1307 uint8_t BitStream[MAX_GRAPH_TRACE_LEN] = {0};
1308
1309 /* Detect high and lows */
1310 for (i = 0; i < GraphTraceLen; i++)
1311 {
1312 if (GraphBuffer[i] > high)
1313 high = GraphBuffer[i];
1314 else if (GraphBuffer[i] < low)
1315 low = GraphBuffer[i];
1316 }
1317
1318 /* Get our clock */
1319 clock = GetClock(Cmd, high, 1);
1320
1321 int tolerance = clock/4;
1322
1323 /* Detect first transition */
1324 /* Lo-Hi (arbitrary) */
1325 /* skip to the first high */
1326 for (i= 0; i < GraphTraceLen; i++)
1327 if (GraphBuffer[i] == high)
1328 break;
1329 /* now look for the first low */
1330 for (; i < GraphTraceLen; i++)
1331 {
1332 if (GraphBuffer[i] == low)
1333 {
1334 lastval = i;
1335 break;
1336 }
1337 }
1338
1339 /* If we're not working with 1/0s, demod based off clock */
1340 if (high != 1)
1341 {
1342 bit = 0; /* We assume the 1st bit is zero, it may not be
1343 * the case: this routine (I think) has an init problem.
1344 * Ed.
1345 */
1346 for (; i < (int)(GraphTraceLen / clock); i++)
1347 {
1348 hithigh = 0;
1349 hitlow = 0;
1350 first = 1;
1351
1352 /* Find out if we hit both high and low peaks */
1353 for (j = 0; j < clock; j++)
1354 {
1355 if (GraphBuffer[(i * clock) + j] == high)
1356 hithigh = 1;
1357 else if (GraphBuffer[(i * clock) + j] == low)
1358 hitlow = 1;
1359
1360 /* it doesn't count if it's the first part of our read
1361 because it's really just trailing from the last sequence */
1362 if (first && (hithigh || hitlow))
1363 hithigh = hitlow = 0;
1364 else
1365 first = 0;
1366
1367 if (hithigh && hitlow)
1368 break;
1369 }
1370
1371 /* If we didn't hit both high and low peaks, we had a bit transition */
1372 if (!hithigh || !hitlow)
1373 bit ^= 1;
1374
1375 BitStream[bit2idx++] = bit ^ invert;
1376 }
1377 }
1378
1379 /* standard 1/0 bitstream */
1380 else
1381 {
1382
1383 /* Then detect duration between 2 successive transitions */
1384 for (bitidx = 1; i < GraphTraceLen; i++)
1385 {
1386 if (GraphBuffer[i-1] != GraphBuffer[i])
1387 {
1388 lc = i-lastval;
1389 lastval = i;
1390
1391 // Error check: if bitidx becomes too large, we do not
1392 // have a Manchester encoded bitstream or the clock is really
1393 // wrong!
1394 if (bitidx > (GraphTraceLen*2/clock+8) ) {
1395 PrintAndLog("Error: the clock you gave is probably wrong, aborting.");
1396 return 0;
1397 }
1398 // Then switch depending on lc length:
1399 // Tolerance is 1/4 of clock rate (arbitrary)
1400 if (abs(lc-clock/2) < tolerance) {
1401 // Short pulse : either "1" or "0"
1402 BitStream[bitidx++]=GraphBuffer[i-1];
1403 } else if (abs(lc-clock) < tolerance) {
1404 // Long pulse: either "11" or "00"
1405 BitStream[bitidx++]=GraphBuffer[i-1];
1406 BitStream[bitidx++]=GraphBuffer[i-1];
1407 } else {
1408 // Error
1409 warnings++;
1410 PrintAndLog("Warning: Manchester decode error for pulse width detection.");
1411 PrintAndLog("(too many of those messages mean either the stream is not Manchester encoded, or clock is wrong)");
1412
1413 if (warnings > 10)
1414 {
1415 PrintAndLog("Error: too many detection errors, aborting.");
1416 return 0;
1417 }
1418 }
1419 }
1420 }
1421
1422 // At this stage, we now have a bitstream of "01" ("1") or "10" ("0"), parse it into final decoded bitstream
1423 // Actually, we overwrite BitStream with the new decoded bitstream, we just need to be careful
1424 // to stop output at the final bitidx2 value, not bitidx
1425 for (i = 0; i < bitidx; i += 2) {
1426 if ((BitStream[i] == 0) && (BitStream[i+1] == 1)) {
1427 BitStream[bit2idx++] = 1 ^ invert;
1428 } else if ((BitStream[i] == 1) && (BitStream[i+1] == 0)) {
1429 BitStream[bit2idx++] = 0 ^ invert;
1430 } else {
1431 // We cannot end up in this state, this means we are unsynchronized,
1432 // move up 1 bit:
1433 i++;
1434 warnings++;
1435 PrintAndLog("Unsynchronized, resync...");
1436 PrintAndLog("(too many of those messages mean the stream is not Manchester encoded)");
1437
1438 if (warnings > 10)
1439 {
1440 PrintAndLog("Error: too many decode errors, aborting.");
1441 return 0;
1442 }
1443 }
1444 }
1445 }
1446
1447 PrintAndLog("Manchester decoded bitstream");
1448 // Now output the bitstream to the scrollback by line of 16 bits
1449 for (i = 0; i < (bit2idx-16); i+=16) {
1450 PrintAndLog("%i %i %i %i %i %i %i %i %i %i %i %i %i %i %i %i",
1451 BitStream[i],
1452 BitStream[i+1],
1453 BitStream[i+2],
1454 BitStream[i+3],
1455 BitStream[i+4],
1456 BitStream[i+5],
1457 BitStream[i+6],
1458 BitStream[i+7],
1459 BitStream[i+8],
1460 BitStream[i+9],
1461 BitStream[i+10],
1462 BitStream[i+11],
1463 BitStream[i+12],
1464 BitStream[i+13],
1465 BitStream[i+14],
1466 BitStream[i+15]);
1467 }
1468 return 0;
1469 }
1470
1471 /* Modulate our data into manchester */
1472 int CmdManchesterMod(const char *Cmd)
1473 {
1474 int i, j;
1475 int clock;
1476 int bit, lastbit, wave;
1477
1478 /* Get our clock */
1479 clock = GetClock(Cmd, 0, 1);
1480
1481 wave = 0;
1482 lastbit = 1;
1483 for (i = 0; i < (int)(GraphTraceLen / clock); i++)
1484 {
1485 bit = GraphBuffer[i * clock] ^ 1;
1486
1487 for (j = 0; j < (int)(clock/2); j++)
1488 GraphBuffer[(i * clock) + j] = bit ^ lastbit ^ wave;
1489 for (j = (int)(clock/2); j < clock; j++)
1490 GraphBuffer[(i * clock) + j] = bit ^ lastbit ^ wave ^ 1;
1491
1492 /* Keep track of how we start our wave and if we changed or not this time */
1493 wave ^= bit ^ lastbit;
1494 lastbit = bit;
1495 }
1496
1497 RepaintGraphWindow();
1498 return 0;
1499 }
1500
1501 int CmdNorm(const char *Cmd)
1502 {
1503 int i;
1504 int max = INT_MIN, min = INT_MAX;
1505
1506 for (i = 10; i < GraphTraceLen; ++i) {
1507 if (GraphBuffer[i] > max)
1508 max = GraphBuffer[i];
1509 if (GraphBuffer[i] < min)
1510 min = GraphBuffer[i];
1511 }
1512
1513 if (max != min) {
1514 for (i = 0; i < GraphTraceLen; ++i) {
1515 GraphBuffer[i] = (GraphBuffer[i] - ((max + min) / 2)) * 256 /
1516 (max - min);
1517 //marshmelow: adjusted *1000 to *256 to make +/- 128 so demod commands still work
1518 }
1519 }
1520 RepaintGraphWindow();
1521 return 0;
1522 }
1523
1524 int CmdPlot(const char *Cmd)
1525 {
1526 ShowGraphWindow();
1527 return 0;
1528 }
1529
1530 int CmdSave(const char *Cmd)
1531 {
1532 char filename[FILE_PATH_SIZE] = {0x00};
1533 int len = 0;
1534
1535 len = strlen(Cmd);
1536 if (len > FILE_PATH_SIZE) len = FILE_PATH_SIZE;
1537 memcpy(filename, Cmd, len);
1538
1539
1540 FILE *f = fopen(filename, "w");
1541 if(!f) {
1542 PrintAndLog("couldn't open '%s'", filename);
1543 return 0;
1544 }
1545 int i;
1546 for (i = 0; i < GraphTraceLen; i++) {
1547 fprintf(f, "%d\n", GraphBuffer[i]);
1548 }
1549 fclose(f);
1550 PrintAndLog("saved to '%s'", Cmd);
1551 return 0;
1552 }
1553
1554 int CmdScale(const char *Cmd)
1555 {
1556 CursorScaleFactor = atoi(Cmd);
1557 if (CursorScaleFactor == 0) {
1558 PrintAndLog("bad, can't have zero scale");
1559 CursorScaleFactor = 1;
1560 }
1561 RepaintGraphWindow();
1562 return 0;
1563 }
1564
1565 int CmdThreshold(const char *Cmd)
1566 {
1567 int threshold = atoi(Cmd);
1568
1569 for (int i = 0; i < GraphTraceLen; ++i) {
1570 if (GraphBuffer[i] >= threshold)
1571 GraphBuffer[i] = 1;
1572 else
1573 GraphBuffer[i] = -1;
1574 }
1575 RepaintGraphWindow();
1576 return 0;
1577 }
1578
1579 int CmdDirectionalThreshold(const char *Cmd)
1580 {
1581 int8_t upThres = param_get8(Cmd, 0);
1582 int8_t downThres = param_get8(Cmd, 1);
1583
1584 printf("Applying Up Threshold: %d, Down Threshold: %d\n", upThres, downThres);
1585
1586 int lastValue = GraphBuffer[0];
1587 GraphBuffer[0] = 0; // Will be changed at the end, but init 0 as we adjust to last samples value if no threshold kicks in.
1588
1589 for (int i = 1; i < GraphTraceLen; ++i) {
1590 // Apply first threshold to samples heading up
1591 if (GraphBuffer[i] >= upThres && GraphBuffer[i] > lastValue)
1592 {
1593 lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it.
1594 GraphBuffer[i] = 1;
1595 }
1596 // Apply second threshold to samples heading down
1597 else if (GraphBuffer[i] <= downThres && GraphBuffer[i] < lastValue)
1598 {
1599 lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it.
1600 GraphBuffer[i] = -1;
1601 }
1602 else
1603 {
1604 lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it.
1605 GraphBuffer[i] = GraphBuffer[i-1];
1606
1607 }
1608 }
1609 GraphBuffer[0] = GraphBuffer[1]; // Aline with first edited sample.
1610 RepaintGraphWindow();
1611 return 0;
1612 }
1613
1614 int CmdZerocrossings(const char *Cmd)
1615 {
1616 // Zero-crossings aren't meaningful unless the signal is zero-mean.
1617 CmdHpf("");
1618
1619 int sign = 1;
1620 int zc = 0;
1621 int lastZc = 0;
1622
1623 for (int i = 0; i < GraphTraceLen; ++i) {
1624 if (GraphBuffer[i] * sign >= 0) {
1625 // No change in sign, reproduce the previous sample count.
1626 zc++;
1627 GraphBuffer[i] = lastZc;
1628 } else {
1629 // Change in sign, reset the sample count.
1630 sign = -sign;
1631 GraphBuffer[i] = lastZc;
1632 if (sign > 0) {
1633 lastZc = zc;
1634 zc = 0;
1635 }
1636 }
1637 }
1638
1639 RepaintGraphWindow();
1640 return 0;
1641 }
1642
1643 static command_t CommandTable[] =
1644 {
1645 {"help", CmdHelp, 1, "This help"},
1646 {"amp", CmdAmp, 1, "Amplify peaks"},
1647 {"askdemod", Cmdaskdemod, 1, "<0 or 1> -- Attempt to demodulate simple ASK tags"},
1648 {"askmandemod", Cmdaskmandemod, 1, "[clock] [invert<0|1>] -- Attempt to demodulate ASK/Manchester tags and output binary (args optional[clock will try Auto-detect])"},
1649 {"askrawdemod", Cmdaskrawdemod, 1, "[clock] [invert<0|1>] -- Attempt to demodulate ASK tags and output binary (args optional[clock will try Auto-detect])"},
1650 {"autocorr", CmdAutoCorr, 1, "<window length> -- Autocorrelation over window"},
1651 {"biphaserawdecode",CmdBiphaseDecodeRaw,1,"[offset] Biphase decode binary stream already in graph buffer (offset = bit to start decode from)"},
1652 {"bitsamples", CmdBitsamples, 0, "Get raw samples as bitstring"},
1653 {"bitstream", CmdBitstream, 1, "[clock rate] -- Convert waveform into a bitstream"},
1654 {"buffclear", CmdBuffClear, 1, "Clear sample buffer and graph window"},
1655 {"dec", CmdDec, 1, "Decimate samples"},
1656 {"detectclock", CmdDetectClockRate, 1, "Detect ASK clock rate"},
1657 {"fskdemod", CmdFSKdemod, 1, "Demodulate graph window as a HID FSK"},
1658 {"fskhiddemod", CmdFSKdemodHID, 1, "Demodulate graph window as a HID FSK using raw"},
1659 {"fskiodemod", CmdFSKdemodIO, 1, "Demodulate graph window as an IO Prox FSK using raw"},
1660 {"fskrawdemod", CmdFSKrawdemod, 1, "[clock rate] [invert] [rchigh] [rclow] Demodulate graph window from FSK to binary (clock = 50)(invert = 1|0)(rchigh = 10)(rclow=8)"},
1661 {"grid", CmdGrid, 1, "<x> <y> -- overlay grid on graph window, use zero value to turn off either"},
1662 {"hexsamples", CmdHexsamples, 0, "<bytes> [<offset>] -- Dump big buffer as hex bytes"},
1663 {"hide", CmdHide, 1, "Hide graph window"},
1664 {"hpf", CmdHpf, 1, "Remove DC offset from trace"},
1665 {"load", CmdLoad, 1, "<filename> -- Load trace (to graph window"},
1666 {"ltrim", CmdLtrim, 1, "<samples> -- Trim samples from left of trace"},
1667 {"rtrim", CmdRtrim, 1, "<location to end trace> -- Trim samples from right of trace"},
1668 {"mandemod", CmdManchesterDemod, 1, "[i] [clock rate] -- Manchester demodulate binary stream (option 'i' to invert output)"},
1669 {"manrawdecode", Cmdmandecoderaw, 1, "Manchester decode binary stream already in graph buffer"},
1670 {"manmod", CmdManchesterMod, 1, "[clock rate] -- Manchester modulate a binary stream"},
1671 {"norm", CmdNorm, 1, "Normalize max/min to +/-128"},
1672 {"plot", CmdPlot, 1, "Show graph window (hit 'h' in window for keystroke help)"},
1673 {"pskclean", CmdPskClean, 1, "Attempt to clean psk wave"},
1674 {"pskdetectclock",CmdDetectNRZpskClockRate, 1, "Detect ASK, PSK, or NRZ clock rate"},
1675 {"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])"},
1676 {"psknrzrawdemod",CmdpskNRZrawDemod, 1, "[clock] [invert<0|1>] -- Attempt to demodulate psk or nrz tags and output binary (args optional[clock will try Auto-detect])"},
1677 {"samples", CmdSamples, 0, "[512 - 40000] -- Get raw samples for graph window"},
1678 {"save", CmdSave, 1, "<filename> -- Save trace (from graph window)"},
1679 {"scale", CmdScale, 1, "<int> -- Set cursor display scale"},
1680 {"threshold", CmdThreshold, 1, "<threshold> -- Maximize/minimize every value in the graph window depending on threshold"},
1681 {"dirthreshold", CmdDirectionalThreshold, 1, "<thres up> <thres down> -- Max rising higher up-thres/ Min falling lower down-thres, keep rest as prev."},
1682 {"tune", CmdTuneSamples, 0, "Get hw tune samples for graph window"},
1683 {"undec", CmdUndec, 1, "Un-decimate samples by 2"},
1684 {"zerocrossings", CmdZerocrossings, 1, "Count time between zero-crossings"},
1685 {NULL, NULL, 0, NULL}
1686 };
1687
1688 int CmdData(const char *Cmd)
1689 {
1690 CmdsParse(CommandTable, Cmd);
1691 return 0;
1692 }
1693
1694 int CmdHelp(const char *Cmd)
1695 {
1696 CmdsHelp(CommandTable);
1697 return 0;
1698 }
Impressum, Datenschutz