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