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