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