]> git.zerfleddert.de Git - proxmark3-svn/blob - client/cmddata.c
projects / proxmark3-svn / blob
? search:


53a3ce5f410e1d17a5e3e2cbc51b06210e7e873d
[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 int CmdPskClean(const char *Cmd)
936 {
937 uint8_t bitStream[MAX_GRAPH_TRACE_LEN]={0};
938 size_t bitLen = getFromGraphBuf(bitStream);
939 pskCleanWave(bitStream, bitLen);
940 setGraphBuf(bitStream, bitLen);
941 return 0;
942 }
943
944 //by marshmellow
945 //takes 2 arguments - clock and invert both as integers
946 //attempts to demodulate ask only
947 //prints binary found and saves in graphbuffer for further commands
948 int CmdpskNRZrawDemod(const char *Cmd)
949 {
950 int errCnt= PSKnrzDemod(Cmd);
951 //output
952 if (errCnt<0) return 0;
953 if (errCnt>0){
954 PrintAndLog("# Errors during Demoding (shown as 77 in bit stream): %d",errCnt);
955 }
956 PrintAndLog("PSK or NRZ demoded bitstream:");
957 // Now output the bitstream to the scrollback by line of 16 bits
958 printDemodBuff();
959
960 return 1;
961 }
962
963 int CmdGrid(const char *Cmd)
964 {
965 sscanf(Cmd, "%i %i", &PlotGridX, &PlotGridY);
966 PlotGridXdefault= PlotGridX;
967 PlotGridYdefault= PlotGridY;
968 RepaintGraphWindow();
969 return 0;
970 }
971
972 int CmdHexsamples(const char *Cmd)
973 {
974 int i, j;
975 int requested = 0;
976 int offset = 0;
977 char string_buf[25];
978 char* string_ptr = string_buf;
979 uint8_t got[40000];
980
981 sscanf(Cmd, "%i %i", &requested, &offset);
982
983 /* if no args send something */
984 if (requested == 0) {
985 requested = 8;
986 }
987 if (offset + requested > sizeof(got)) {
988 PrintAndLog("Tried to read past end of buffer, <bytes> + <offset> > 40000");
989 return 0;
990 }
991
992 GetFromBigBuf(got,requested,offset);
993 WaitForResponse(CMD_ACK,NULL);
994
995 i = 0;
996 for (j = 0; j < requested; j++) {
997 i++;
998 string_ptr += sprintf(string_ptr, "%02x ", got[j]);
999 if (i == 8) {
1000 *(string_ptr - 1) = '\0'; // remove the trailing space
1001 PrintAndLog("%s", string_buf);
1002 string_buf[0] = '\0';
1003 string_ptr = string_buf;
1004 i = 0;
1005 }
1006 if (j == requested - 1 && string_buf[0] != '\0') { // print any remaining bytes
1007 *(string_ptr - 1) = '\0';
1008 PrintAndLog("%s", string_buf);
1009 string_buf[0] = '\0';
1010 }
1011 }
1012 return 0;
1013 }
1014
1015 int CmdHide(const char *Cmd)
1016 {
1017 HideGraphWindow();
1018 return 0;
1019 }
1020
1021 int CmdHpf(const char *Cmd)
1022 {
1023 int i;
1024 int accum = 0;
1025
1026 for (i = 10; i < GraphTraceLen; ++i)
1027 accum += GraphBuffer[i];
1028 accum /= (GraphTraceLen - 10);
1029 for (i = 0; i < GraphTraceLen; ++i)
1030 GraphBuffer[i] -= accum;
1031
1032 RepaintGraphWindow();
1033 return 0;
1034 }
1035
1036 int CmdSamples(const char *Cmd)
1037 {
1038 uint8_t got[40000];
1039
1040 int n = strtol(Cmd, NULL, 0);
1041 if (n == 0)
1042 n = 20000;
1043
1044 if (n > sizeof(got))
1045 n = sizeof(got);
1046
1047 PrintAndLog("Reading %d samples from device memory\n", n);
1048 GetFromBigBuf(got,n,0);
1049 WaitForResponse(CMD_ACK,NULL);
1050 for (int j = 0; j < n; j++) {
1051 GraphBuffer[j] = ((int)got[j]) - 128;
1052 }
1053 GraphTraceLen = n;
1054 RepaintGraphWindow();
1055 return 0;
1056 }
1057
1058 int CmdTuneSamples(const char *Cmd)
1059 {
1060 int timeout = 0;
1061 printf("\nMeasuring antenna characteristics, please wait...");
1062
1063 UsbCommand c = {CMD_MEASURE_ANTENNA_TUNING};
1064 SendCommand(&c);
1065
1066 UsbCommand resp;
1067 while(!WaitForResponseTimeout(CMD_MEASURED_ANTENNA_TUNING,&resp,1000)) {
1068 timeout++;
1069 printf(".");
1070 if (timeout > 7) {
1071 PrintAndLog("\nNo response from Proxmark. Aborting...");
1072 return 1;
1073 }
1074 }
1075
1076 int peakv, peakf;
1077 int vLf125, vLf134, vHf;
1078 vLf125 = resp.arg[0] & 0xffff;
1079 vLf134 = resp.arg[0] >> 16;
1080 vHf = resp.arg[1] & 0xffff;;
1081 peakf = resp.arg[2] & 0xffff;
1082 peakv = resp.arg[2] >> 16;
1083 PrintAndLog("");
1084 PrintAndLog("# LF antenna: %5.2f V @ 125.00 kHz", vLf125/1000.0);
1085 PrintAndLog("# LF antenna: %5.2f V @ 134.00 kHz", vLf134/1000.0);
1086 PrintAndLog("# LF optimal: %5.2f V @%9.2f kHz", peakv/1000.0, 12000.0/(peakf+1));
1087 PrintAndLog("# HF antenna: %5.2f V @ 13.56 MHz", vHf/1000.0);
1088 if (peakv<2000)
1089 PrintAndLog("# Your LF antenna is unusable.");
1090 else if (peakv<10000)
1091 PrintAndLog("# Your LF antenna is marginal.");
1092 if (vHf<2000)
1093 PrintAndLog("# Your HF antenna is unusable.");
1094 else if (vHf<5000)
1095 PrintAndLog("# Your HF antenna is marginal.");
1096
1097 for (int i = 0; i < 256; i++) {
1098 GraphBuffer[i] = resp.d.asBytes[i] - 128;
1099 }
1100
1101 PrintAndLog("Done! Divisor 89 is 134khz, 95 is 125khz.\n");
1102 PrintAndLog("\n");
1103 GraphTraceLen = 256;
1104 ShowGraphWindow();
1105
1106 return 0;
1107 }
1108
1109
1110 int CmdLoad(const char *Cmd)
1111 {
1112 FILE *f = fopen(Cmd, "r");
1113 if (!f) {
1114 PrintAndLog("couldn't open '%s'", Cmd);
1115 return 0;
1116 }
1117
1118 GraphTraceLen = 0;
1119 char line[80];
1120 while (fgets(line, sizeof (line), f)) {
1121 GraphBuffer[GraphTraceLen] = atoi(line);
1122 GraphTraceLen++;
1123 }
1124 fclose(f);
1125 PrintAndLog("loaded %d samples", GraphTraceLen);
1126 RepaintGraphWindow();
1127 return 0;
1128 }
1129
1130 int CmdLtrim(const char *Cmd)
1131 {
1132 int ds = atoi(Cmd);
1133
1134 for (int i = ds; i < GraphTraceLen; ++i)
1135 GraphBuffer[i-ds] = GraphBuffer[i];
1136 GraphTraceLen -= ds;
1137
1138 RepaintGraphWindow();
1139 return 0;
1140 }
1141 int CmdRtrim(const char *Cmd)
1142 {
1143 int ds = atoi(Cmd);
1144
1145 GraphTraceLen = ds;
1146
1147 RepaintGraphWindow();
1148 return 0;
1149 }
1150
1151 /*
1152 * Manchester demodulate a bitstream. The bitstream needs to be already in
1153 * the GraphBuffer as 0 and 1 values
1154 *
1155 * Give the clock rate as argument in order to help the sync - the algorithm
1156 * resyncs at each pulse anyway.
1157 *
1158 * Not optimized by any means, this is the 1st time I'm writing this type of
1159 * routine, feel free to improve...
1160 *
1161 * 1st argument: clock rate (as number of samples per clock rate)
1162 * Typical values can be 64, 32, 128...
1163 */
1164 int CmdManchesterDemod(const char *Cmd)
1165 {
1166 int i, j, invert= 0;
1167 int bit;
1168 int clock;
1169 int lastval = 0;
1170 int low = 0;
1171 int high = 0;
1172 int hithigh, hitlow, first;
1173 int lc = 0;
1174 int bitidx = 0;
1175 int bit2idx = 0;
1176 int warnings = 0;
1177
1178 /* check if we're inverting output */
1179 if (*Cmd == 'i')
1180 {
1181 PrintAndLog("Inverting output");
1182 invert = 1;
1183 ++Cmd;
1184 do
1185 ++Cmd;
1186 while(*Cmd == ' '); // in case a 2nd argument was given
1187 }
1188
1189 /* Holds the decoded bitstream: each clock period contains 2 bits */
1190 /* later simplified to 1 bit after manchester decoding. */
1191 /* Add 10 bits to allow for noisy / uncertain traces without aborting */
1192 /* int BitStream[GraphTraceLen*2/clock+10]; */
1193
1194 /* But it does not work if compiling on WIndows: therefore we just allocate a */
1195 /* large array */
1196 uint8_t BitStream[MAX_GRAPH_TRACE_LEN] = {0};
1197
1198 /* Detect high and lows */
1199 for (i = 0; i < GraphTraceLen; i++)
1200 {
1201 if (GraphBuffer[i] > high)
1202 high = GraphBuffer[i];
1203 else if (GraphBuffer[i] < low)
1204 low = GraphBuffer[i];
1205 }
1206
1207 /* Get our clock */
1208 clock = GetClock(Cmd, high, 1);
1209
1210 int tolerance = clock/4;
1211
1212 /* Detect first transition */
1213 /* Lo-Hi (arbitrary) */
1214 /* skip to the first high */
1215 for (i= 0; i < GraphTraceLen; i++)
1216 if (GraphBuffer[i] == high)
1217 break;
1218 /* now look for the first low */
1219 for (; i < GraphTraceLen; i++)
1220 {
1221 if (GraphBuffer[i] == low)
1222 {
1223 lastval = i;
1224 break;
1225 }
1226 }
1227
1228 /* If we're not working with 1/0s, demod based off clock */
1229 if (high != 1)
1230 {
1231 bit = 0; /* We assume the 1st bit is zero, it may not be
1232 * the case: this routine (I think) has an init problem.
1233 * Ed.
1234 */
1235 for (; i < (int)(GraphTraceLen / clock); i++)
1236 {
1237 hithigh = 0;
1238 hitlow = 0;
1239 first = 1;
1240
1241 /* Find out if we hit both high and low peaks */
1242 for (j = 0; j < clock; j++)
1243 {
1244 if (GraphBuffer[(i * clock) + j] == high)
1245 hithigh = 1;
1246 else if (GraphBuffer[(i * clock) + j] == low)
1247 hitlow = 1;
1248
1249 /* it doesn't count if it's the first part of our read
1250 because it's really just trailing from the last sequence */
1251 if (first && (hithigh || hitlow))
1252 hithigh = hitlow = 0;
1253 else
1254 first = 0;
1255
1256 if (hithigh && hitlow)
1257 break;
1258 }
1259
1260 /* If we didn't hit both high and low peaks, we had a bit transition */
1261 if (!hithigh || !hitlow)
1262 bit ^= 1;
1263
1264 BitStream[bit2idx++] = bit ^ invert;
1265 }
1266 }
1267
1268 /* standard 1/0 bitstream */
1269 else
1270 {
1271
1272 /* Then detect duration between 2 successive transitions */
1273 for (bitidx = 1; i < GraphTraceLen; i++)
1274 {
1275 if (GraphBuffer[i-1] != GraphBuffer[i])
1276 {
1277 lc = i-lastval;
1278 lastval = i;
1279
1280 // Error check: if bitidx becomes too large, we do not
1281 // have a Manchester encoded bitstream or the clock is really
1282 // wrong!
1283 if (bitidx > (GraphTraceLen*2/clock+8) ) {
1284 PrintAndLog("Error: the clock you gave is probably wrong, aborting.");
1285 return 0;
1286 }
1287 // Then switch depending on lc length:
1288 // Tolerance is 1/4 of clock rate (arbitrary)
1289 if (abs(lc-clock/2) < tolerance) {
1290 // Short pulse : either "1" or "0"
1291 BitStream[bitidx++]=GraphBuffer[i-1];
1292 } else if (abs(lc-clock) < tolerance) {
1293 // Long pulse: either "11" or "00"
1294 BitStream[bitidx++]=GraphBuffer[i-1];
1295 BitStream[bitidx++]=GraphBuffer[i-1];
1296 } else {
1297 // Error
1298 warnings++;
1299 PrintAndLog("Warning: Manchester decode error for pulse width detection.");
1300 PrintAndLog("(too many of those messages mean either the stream is not Manchester encoded, or clock is wrong)");
1301
1302 if (warnings > 10)
1303 {
1304 PrintAndLog("Error: too many detection errors, aborting.");
1305 return 0;
1306 }
1307 }
1308 }
1309 }
1310
1311 // At this stage, we now have a bitstream of "01" ("1") or "10" ("0"), parse it into final decoded bitstream
1312 // Actually, we overwrite BitStream with the new decoded bitstream, we just need to be careful
1313 // to stop output at the final bitidx2 value, not bitidx
1314 for (i = 0; i < bitidx; i += 2) {
1315 if ((BitStream[i] == 0) && (BitStream[i+1] == 1)) {
1316 BitStream[bit2idx++] = 1 ^ invert;
1317 } else if ((BitStream[i] == 1) && (BitStream[i+1] == 0)) {
1318 BitStream[bit2idx++] = 0 ^ invert;
1319 } else {
1320 // We cannot end up in this state, this means we are unsynchronized,
1321 // move up 1 bit:
1322 i++;
1323 warnings++;
1324 PrintAndLog("Unsynchronized, resync...");
1325 PrintAndLog("(too many of those messages mean the stream is not Manchester encoded)");
1326
1327 if (warnings > 10)
1328 {
1329 PrintAndLog("Error: too many decode errors, aborting.");
1330 return 0;
1331 }
1332 }
1333 }
1334 }
1335
1336 PrintAndLog("Manchester decoded bitstream");
1337 // Now output the bitstream to the scrollback by line of 16 bits
1338 for (i = 0; i < (bit2idx-16); i+=16) {
1339 PrintAndLog("%i %i %i %i %i %i %i %i %i %i %i %i %i %i %i %i",
1340 BitStream[i],
1341 BitStream[i+1],
1342 BitStream[i+2],
1343 BitStream[i+3],
1344 BitStream[i+4],
1345 BitStream[i+5],
1346 BitStream[i+6],
1347 BitStream[i+7],
1348 BitStream[i+8],
1349 BitStream[i+9],
1350 BitStream[i+10],
1351 BitStream[i+11],
1352 BitStream[i+12],
1353 BitStream[i+13],
1354 BitStream[i+14],
1355 BitStream[i+15]);
1356 }
1357 return 0;
1358 }
1359
1360 /* Modulate our data into manchester */
1361 int CmdManchesterMod(const char *Cmd)
1362 {
1363 int i, j;
1364 int clock;
1365 int bit, lastbit, wave;
1366
1367 /* Get our clock */
1368 clock = GetClock(Cmd, 0, 1);
1369
1370 wave = 0;
1371 lastbit = 1;
1372 for (i = 0; i < (int)(GraphTraceLen / clock); i++)
1373 {
1374 bit = GraphBuffer[i * clock] ^ 1;
1375
1376 for (j = 0; j < (int)(clock/2); j++)
1377 GraphBuffer[(i * clock) + j] = bit ^ lastbit ^ wave;
1378 for (j = (int)(clock/2); j < clock; j++)
1379 GraphBuffer[(i * clock) + j] = bit ^ lastbit ^ wave ^ 1;
1380
1381 /* Keep track of how we start our wave and if we changed or not this time */
1382 wave ^= bit ^ lastbit;
1383 lastbit = bit;
1384 }
1385
1386 RepaintGraphWindow();
1387 return 0;
1388 }
1389
1390 int CmdNorm(const char *Cmd)
1391 {
1392 int i;
1393 int max = INT_MIN, min = INT_MAX;
1394
1395 for (i = 10; i < GraphTraceLen; ++i) {
1396 if (GraphBuffer[i] > max)
1397 max = GraphBuffer[i];
1398 if (GraphBuffer[i] < min)
1399 min = GraphBuffer[i];
1400 }
1401
1402 if (max != min) {
1403 for (i = 0; i < GraphTraceLen; ++i) {
1404 GraphBuffer[i] = (GraphBuffer[i] - ((max + min) / 2)) * 256 /
1405 (max - min);
1406 //marshmelow: adjusted *1000 to *256 to make +/- 128 so demod commands still work
1407 }
1408 }
1409 RepaintGraphWindow();
1410 return 0;
1411 }
1412
1413 int CmdPlot(const char *Cmd)
1414 {
1415 ShowGraphWindow();
1416 return 0;
1417 }
1418
1419 int CmdSave(const char *Cmd)
1420 {
1421 FILE *f = fopen(Cmd, "w");
1422 if(!f) {
1423 PrintAndLog("couldn't open '%s'", Cmd);
1424 return 0;
1425 }
1426 int i;
1427 for (i = 0; i < GraphTraceLen; i++) {
1428 fprintf(f, "%d\n", GraphBuffer[i]);
1429 }
1430 fclose(f);
1431 PrintAndLog("saved to '%s'", Cmd);
1432 return 0;
1433 }
1434
1435 int CmdScale(const char *Cmd)
1436 {
1437 CursorScaleFactor = atoi(Cmd);
1438 if (CursorScaleFactor == 0) {
1439 PrintAndLog("bad, can't have zero scale");
1440 CursorScaleFactor = 1;
1441 }
1442 RepaintGraphWindow();
1443 return 0;
1444 }
1445
1446 int CmdThreshold(const char *Cmd)
1447 {
1448 int threshold = atoi(Cmd);
1449
1450 for (int i = 0; i < GraphTraceLen; ++i) {
1451 if (GraphBuffer[i] >= threshold)
1452 GraphBuffer[i] = 1;
1453 else
1454 GraphBuffer[i] = -1;
1455 }
1456 RepaintGraphWindow();
1457 return 0;
1458 }
1459
1460 int CmdDirectionalThreshold(const char *Cmd)
1461 {
1462 int8_t upThres = param_get8(Cmd, 0);
1463 int8_t downThres = param_get8(Cmd, 1);
1464
1465 printf("Applying Up Threshold: %d, Down Threshold: %d\n", upThres, downThres);
1466
1467 int lastValue = GraphBuffer[0];
1468 GraphBuffer[0] = 0; // Will be changed at the end, but init 0 as we adjust to last samples value if no threshold kicks in.
1469
1470 for (int i = 1; i < GraphTraceLen; ++i) {
1471 // Apply first threshold to samples heading up
1472 if (GraphBuffer[i] >= upThres && GraphBuffer[i] > lastValue)
1473 {
1474 lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it.
1475 GraphBuffer[i] = 1;
1476 }
1477 // Apply second threshold to samples heading down
1478 else if (GraphBuffer[i] <= downThres && GraphBuffer[i] < lastValue)
1479 {
1480 lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it.
1481 GraphBuffer[i] = -1;
1482 }
1483 else
1484 {
1485 lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it.
1486 GraphBuffer[i] = GraphBuffer[i-1];
1487
1488 }
1489 }
1490 GraphBuffer[0] = GraphBuffer[1]; // Aline with first edited sample.
1491 RepaintGraphWindow();
1492 return 0;
1493 }
1494
1495 int CmdZerocrossings(const char *Cmd)
1496 {
1497 // Zero-crossings aren't meaningful unless the signal is zero-mean.
1498 CmdHpf("");
1499
1500 int sign = 1;
1501 int zc = 0;
1502 int lastZc = 0;
1503
1504 for (int i = 0; i < GraphTraceLen; ++i) {
1505 if (GraphBuffer[i] * sign >= 0) {
1506 // No change in sign, reproduce the previous sample count.
1507 zc++;
1508 GraphBuffer[i] = lastZc;
1509 } else {
1510 // Change in sign, reset the sample count.
1511 sign = -sign;
1512 GraphBuffer[i] = lastZc;
1513 if (sign > 0) {
1514 lastZc = zc;
1515 zc = 0;
1516 }
1517 }
1518 }
1519
1520 RepaintGraphWindow();
1521 return 0;
1522 }
1523
1524 static command_t CommandTable[] =
1525 {
1526 {"help", CmdHelp, 1, "This help"},
1527 {"amp", CmdAmp, 1, "Amplify peaks"},
1528 {"askdemod", Cmdaskdemod, 1, "<0 or 1> -- Attempt to demodulate simple ASK tags"},
1529 {"askmandemod", Cmdaskmandemod, 1, "[clock] [invert<0|1>] -- Attempt to demodulate ASK/Manchester tags and output binary (args optional[clock will try Auto-detect])"},
1530 {"askrawdemod", Cmdaskrawdemod, 1, "[clock] [invert<0|1>] -- Attempt to demodulate ASK tags and output binary (args optional[clock will try Auto-detect])"},
1531 {"autocorr", CmdAutoCorr, 1, "<window length> -- Autocorrelation over window"},
1532 {"biphaserawdecode",CmdBiphaseDecodeRaw,1,"[offset] Biphase decode binary stream already in graph buffer (offset = bit to start decode from)"},
1533 {"bitsamples", CmdBitsamples, 0, "Get raw samples as bitstring"},
1534 {"bitstream", CmdBitstream, 1, "[clock rate] -- Convert waveform into a bitstream"},
1535 {"buffclear", CmdBuffClear, 1, "Clear sample buffer and graph window"},
1536 {"dec", CmdDec, 1, "Decimate samples"},
1537 {"detectclock", CmdDetectClockRate, 1, "Detect ASK clock rate"},
1538 {"fskdemod", CmdFSKdemod, 1, "Demodulate graph window as a HID FSK"},
1539 {"fskhiddemod", CmdFSKdemodHID, 1, "Demodulate graph window as a HID FSK using raw"},
1540 {"fskiodemod", CmdFSKdemodIO, 1, "Demodulate graph window as an IO Prox FSK using raw"},
1541 {"fskrawdemod", CmdFSKrawdemod, 1, "[clock rate] [invert] [rchigh] [rclow] Demodulate graph window from FSK to binary (clock = 50)(invert = 1|0)(rchigh = 10)(rclow=8)"},
1542 {"grid", CmdGrid, 1, "<x> <y> -- overlay grid on graph window, use zero value to turn off either"},
1543 {"hexsamples", CmdHexsamples, 0, "<bytes> [<offset>] -- Dump big buffer as hex bytes"},
1544 {"hide", CmdHide, 1, "Hide graph window"},
1545 {"hpf", CmdHpf, 1, "Remove DC offset from trace"},
1546 {"load", CmdLoad, 1, "<filename> -- Load trace (to graph window"},
1547 {"ltrim", CmdLtrim, 1, "<samples> -- Trim samples from left of trace"},
1548 {"rtrim", CmdRtrim, 1, "<location to end trace> -- Trim samples from right of trace"},
1549 {"mandemod", CmdManchesterDemod, 1, "[i] [clock rate] -- Manchester demodulate binary stream (option 'i' to invert output)"},
1550 {"manrawdecode", Cmdmandecoderaw, 1, "Manchester decode binary stream already in graph buffer"},
1551 {"manmod", CmdManchesterMod, 1, "[clock rate] -- Manchester modulate a binary stream"},
1552 {"norm", CmdNorm, 1, "Normalize max/min to +/-128"},
1553 {"plot", CmdPlot, 1, "Show graph window (hit 'h' in window for keystroke help)"},
1554 {"pskclean", CmdPskClean, 1, "Attempt to clean psk wave"},
1555 {"pskdetectclock",CmdDetectNRZpskClockRate, 1, "Detect ASK, PSK, or NRZ clock rate"},
1556 {"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])"},
1557 {"psknrzrawdemod",CmdpskNRZrawDemod, 1, "[clock] [invert<0|1>] -- Attempt to demodulate psk or nrz tags and output binary (args optional[clock will try Auto-detect])"},
1558 {"samples", CmdSamples, 0, "[512 - 40000] -- Get raw samples for graph window"},
1559 {"save", CmdSave, 1, "<filename> -- Save trace (from graph window)"},
1560 {"scale", CmdScale, 1, "<int> -- Set cursor display scale"},
1561 {"threshold", CmdThreshold, 1, "<threshold> -- Maximize/minimize every value in the graph window depending on threshold"},
1562 {"dirthreshold", CmdDirectionalThreshold, 1, "<thres up> <thres down> -- Max rising higher up-thres/ Min falling lower down-thres, keep rest as prev."},
1563 {"tune", CmdTuneSamples, 0, "Get hw tune samples for graph window"},
1564 {"zerocrossings", CmdZerocrossings, 1, "Count time between zero-crossings"},
1565 {NULL, NULL, 0, NULL}
1566 };
1567
1568 int CmdData(const char *Cmd)
1569 {
1570 CmdsParse(CommandTable, Cmd);
1571 return 0;
1572 }
1573
1574 int CmdHelp(const char *Cmd)
1575 {
1576 CmdsHelp(CommandTable);
1577 return 0;
1578 }
Proxmark3 GIT tracking
Impressum, Datenschutz