]> git.zerfleddert.de Git - proxmark3-svn/blob - client/cmddata.c
Minor typo
[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 "cmdmain.h"
21 #include "cmddata.h"
22
23 static int CmdHelp(const char *Cmd);
24
25 int CmdAmp(const char *Cmd)
26 {
27 int i, rising, falling;
28 int max = INT_MIN, min = INT_MAX;
29
30 for (i = 10; i < GraphTraceLen; ++i) {
31 if (GraphBuffer[i] > max)
32 max = GraphBuffer[i];
33 if (GraphBuffer[i] < min)
34 min = GraphBuffer[i];
35 }
36
37 if (max != min) {
38 rising = falling= 0;
39 for (i = 0; i < GraphTraceLen; ++i) {
40 if (GraphBuffer[i + 1] < GraphBuffer[i]) {
41 if (rising) {
42 GraphBuffer[i] = max;
43 rising = 0;
44 }
45 falling = 1;
46 }
47 if (GraphBuffer[i + 1] > GraphBuffer[i]) {
48 if (falling) {
49 GraphBuffer[i] = min;
50 falling = 0;
51 }
52 rising= 1;
53 }
54 }
55 }
56 RepaintGraphWindow();
57 return 0;
58 }
59
60 /*
61 * Generic command to demodulate ASK.
62 *
63 * Argument is convention: positive or negative (High mod means zero
64 * or high mod means one)
65 *
66 * Updates the Graph trace with 0/1 values
67 *
68 * Arguments:
69 * c : 0 or 1
70 */
71 int Cmdaskdemod(const char *Cmd)
72 {
73 int i;
74 int c, high = 0, low = 0;
75
76 // TODO: complain if we do not give 2 arguments here !
77 // (AL - this doesn't make sense! we're only using one argument!!!)
78 sscanf(Cmd, "%i", &c);
79
80 /* Detect high and lows and clock */
81 // (AL - clock???)
82 for (i = 0; i < GraphTraceLen; ++i)
83 {
84 if (GraphBuffer[i] > high)
85 high = GraphBuffer[i];
86 else if (GraphBuffer[i] < low)
87 low = GraphBuffer[i];
88 }
89 if (c != 0 && c != 1) {
90 PrintAndLog("Invalid argument: %s", Cmd);
91 return 0;
92 }
93
94 if (GraphBuffer[0] > 0) {
95 GraphBuffer[0] = 1-c;
96 } else {
97 GraphBuffer[0] = c;
98 }
99 for (i = 1; i < GraphTraceLen; ++i) {
100 /* Transitions are detected at each peak
101 * Transitions are either:
102 * - we're low: transition if we hit a high
103 * - we're high: transition if we hit a low
104 * (we need to do it this way because some tags keep high or
105 * low for long periods, others just reach the peak and go
106 * down)
107 */
108 if ((GraphBuffer[i] == high) && (GraphBuffer[i - 1] == c)) {
109 GraphBuffer[i] = 1 - c;
110 } else if ((GraphBuffer[i] == low) && (GraphBuffer[i - 1] == (1 - c))){
111 GraphBuffer[i] = c;
112 } else {
113 /* No transition */
114 GraphBuffer[i] = GraphBuffer[i - 1];
115 }
116 }
117 RepaintGraphWindow();
118 return 0;
119 }
120
121 int CmdAutoCorr(const char *Cmd)
122 {
123 static int CorrelBuffer[MAX_GRAPH_TRACE_LEN];
124
125 int window = atoi(Cmd);
126
127 if (window == 0) {
128 PrintAndLog("needs a window");
129 return 0;
130 }
131 if (window >= GraphTraceLen) {
132 PrintAndLog("window must be smaller than trace (%d samples)",
133 GraphTraceLen);
134 return 0;
135 }
136
137 PrintAndLog("performing %d correlations", GraphTraceLen - window);
138
139 for (int i = 0; i < GraphTraceLen - window; ++i) {
140 int sum = 0;
141 for (int j = 0; j < window; ++j) {
142 sum += (GraphBuffer[j]*GraphBuffer[i + j]) / 256;
143 }
144 CorrelBuffer[i] = sum;
145 }
146 GraphTraceLen = GraphTraceLen - window;
147 memcpy(GraphBuffer, CorrelBuffer, GraphTraceLen * sizeof (int));
148
149 RepaintGraphWindow();
150 return 0;
151 }
152
153 int CmdBitsamples(const char *Cmd)
154 {
155 int cnt = 0;
156 uint8_t got[12288];
157
158 GetFromBigBuf(got,sizeof(got),0);
159 WaitForResponse(CMD_ACK,NULL);
160
161 for (int j = 0; j < sizeof(got); j++) {
162 for (int k = 0; k < 8; k++) {
163 if(got[j] & (1 << (7 - k))) {
164 GraphBuffer[cnt++] = 1;
165 } else {
166 GraphBuffer[cnt++] = 0;
167 }
168 }
169 }
170 GraphTraceLen = cnt;
171 RepaintGraphWindow();
172 return 0;
173 }
174
175 /*
176 * Convert to a bitstream
177 */
178 int CmdBitstream(const char *Cmd)
179 {
180 int i, j;
181 int bit;
182 int gtl;
183 int clock;
184 int low = 0;
185 int high = 0;
186 int hithigh, hitlow, first;
187
188 /* Detect high and lows and clock */
189 for (i = 0; i < GraphTraceLen; ++i)
190 {
191 if (GraphBuffer[i] > high)
192 high = GraphBuffer[i];
193 else if (GraphBuffer[i] < low)
194 low = GraphBuffer[i];
195 }
196
197 /* Get our clock */
198 clock = GetClock(Cmd, high, 1);
199 gtl = ClearGraph(0);
200
201 bit = 0;
202 for (i = 0; i < (int)(gtl / clock); ++i)
203 {
204 hithigh = 0;
205 hitlow = 0;
206 first = 1;
207 /* Find out if we hit both high and low peaks */
208 for (j = 0; j < clock; ++j)
209 {
210 if (GraphBuffer[(i * clock) + j] == high)
211 hithigh = 1;
212 else if (GraphBuffer[(i * clock) + j] == low)
213 hitlow = 1;
214 /* it doesn't count if it's the first part of our read
215 because it's really just trailing from the last sequence */
216 if (first && (hithigh || hitlow))
217 hithigh = hitlow = 0;
218 else
219 first = 0;
220
221 if (hithigh && hitlow)
222 break;
223 }
224
225 /* If we didn't hit both high and low peaks, we had a bit transition */
226 if (!hithigh || !hitlow)
227 bit ^= 1;
228
229 AppendGraph(0, clock, bit);
230 // for (j = 0; j < (int)(clock/2); j++)
231 // GraphBuffer[(i * clock) + j] = bit ^ 1;
232 // for (j = (int)(clock/2); j < clock; j++)
233 // GraphBuffer[(i * clock) + j] = bit;
234 }
235
236 RepaintGraphWindow();
237 return 0;
238 }
239
240 int CmdBuffClear(const char *Cmd)
241 {
242 UsbCommand c = {CMD_BUFF_CLEAR};
243 SendCommand(&c);
244 ClearGraph(true);
245 return 0;
246 }
247
248 int CmdDec(const char *Cmd)
249 {
250 for (int i = 0; i < (GraphTraceLen / 2); ++i)
251 GraphBuffer[i] = GraphBuffer[i * 2];
252 GraphTraceLen /= 2;
253 PrintAndLog("decimated by 2");
254 RepaintGraphWindow();
255 return 0;
256 }
257
258 /* Print our clock rate */
259 int CmdDetectClockRate(const char *Cmd)
260 {
261 int clock = DetectClock(0);
262 PrintAndLog("Auto-detected clock rate: %d", clock);
263 return 0;
264 }
265
266 int CmdFSKdemod(const char *Cmd)
267 {
268 static const int LowTone[] = {
269 1, 1, 1, 1, 1, -1, -1, -1, -1, -1,
270 1, 1, 1, 1, 1, -1, -1, -1, -1, -1,
271 1, 1, 1, 1, 1, -1, -1, -1, -1, -1,
272 1, 1, 1, 1, 1, -1, -1, -1, -1, -1,
273 1, 1, 1, 1, 1, -1, -1, -1, -1, -1
274 };
275 static const int HighTone[] = {
276 1, 1, 1, 1, 1, -1, -1, -1, -1,
277 1, 1, 1, 1, -1, -1, -1, -1,
278 1, 1, 1, 1, -1, -1, -1, -1,
279 1, 1, 1, 1, -1, -1, -1, -1,
280 1, 1, 1, 1, -1, -1, -1, -1,
281 1, 1, 1, 1, -1, -1, -1, -1, -1,
282 };
283
284 int lowLen = sizeof (LowTone) / sizeof (int);
285 int highLen = sizeof (HighTone) / sizeof (int);
286 int convLen = (highLen > lowLen) ? highLen : lowLen;
287 uint32_t hi = 0, lo = 0;
288
289 int i, j;
290 int minMark = 0, maxMark = 0;
291
292 for (i = 0; i < GraphTraceLen - convLen; ++i) {
293 int lowSum = 0, highSum = 0;
294
295 for (j = 0; j < lowLen; ++j) {
296 lowSum += LowTone[j]*GraphBuffer[i+j];
297 }
298 for (j = 0; j < highLen; ++j) {
299 highSum += HighTone[j] * GraphBuffer[i + j];
300 }
301 lowSum = abs(100 * lowSum / lowLen);
302 highSum = abs(100 * highSum / highLen);
303 GraphBuffer[i] = (highSum << 16) | lowSum;
304 }
305
306 for(i = 0; i < GraphTraceLen - convLen - 16; ++i) {
307 int lowTot = 0, highTot = 0;
308 // 10 and 8 are f_s divided by f_l and f_h, rounded
309 for (j = 0; j < 10; ++j) {
310 lowTot += (GraphBuffer[i+j] & 0xffff);
311 }
312 for (j = 0; j < 8; j++) {
313 highTot += (GraphBuffer[i + j] >> 16);
314 }
315 GraphBuffer[i] = lowTot - highTot;
316 if (GraphBuffer[i] > maxMark) maxMark = GraphBuffer[i];
317 if (GraphBuffer[i] < minMark) minMark = GraphBuffer[i];
318 }
319
320 GraphTraceLen -= (convLen + 16);
321 RepaintGraphWindow();
322
323 // Find bit-sync (3 lo followed by 3 high)
324 int max = 0, maxPos = 0;
325 for (i = 0; i < 6000; ++i) {
326 int dec = 0;
327 for (j = 0; j < 3 * lowLen; ++j) {
328 dec -= GraphBuffer[i + j];
329 }
330 for (; j < 3 * (lowLen + highLen ); ++j) {
331 dec += GraphBuffer[i + j];
332 }
333 if (dec > max) {
334 max = dec;
335 maxPos = i;
336 }
337 }
338
339 // place start of bit sync marker in graph
340 GraphBuffer[maxPos] = maxMark;
341 GraphBuffer[maxPos + 1] = minMark;
342
343 maxPos += j;
344
345 // place end of bit sync marker in graph
346 GraphBuffer[maxPos] = maxMark;
347 GraphBuffer[maxPos+1] = minMark;
348
349 PrintAndLog("actual data bits start at sample %d", maxPos);
350 PrintAndLog("length %d/%d", highLen, lowLen);
351
352 uint8_t bits[46];
353 bits[sizeof(bits)-1] = '\0';
354
355 // find bit pairs and manchester decode them
356 for (i = 0; i < arraylen(bits) - 1; ++i) {
357 int dec = 0;
358 for (j = 0; j < lowLen; ++j) {
359 dec -= GraphBuffer[maxPos + j];
360 }
361 for (; j < lowLen + highLen; ++j) {
362 dec += GraphBuffer[maxPos + j];
363 }
364 maxPos += j;
365 // place inter bit marker in graph
366 GraphBuffer[maxPos] = maxMark;
367 GraphBuffer[maxPos + 1] = minMark;
368
369 // hi and lo form a 64 bit pair
370 hi = (hi << 1) | (lo >> 31);
371 lo = (lo << 1);
372 // store decoded bit as binary (in hi/lo) and text (in bits[])
373 if(dec < 0) {
374 bits[i] = '1';
375 lo |= 1;
376 } else {
377 bits[i] = '0';
378 }
379 }
380 PrintAndLog("bits: '%s'", bits);
381 PrintAndLog("hex: %08x %08x", hi, lo);
382 return 0;
383 }
384
385 int CmdGrid(const char *Cmd)
386 {
387 sscanf(Cmd, "%i %i", &PlotGridX, &PlotGridY);
388 PlotGridXdefault= PlotGridX;
389 PlotGridYdefault= PlotGridY;
390 RepaintGraphWindow();
391 return 0;
392 }
393
394 int CmdHexsamples(const char *Cmd)
395 {
396 int i, j;
397 int requested = 0;
398 int offset = 0;
399 char string_buf[25];
400 char* string_ptr = string_buf;
401 uint8_t got[40000];
402
403 sscanf(Cmd, "%i %i", &requested, &offset);
404
405 /* if no args send something */
406 if (requested == 0) {
407 requested = 8;
408 }
409 if (offset + requested > sizeof(got)) {
410 PrintAndLog("Tried to read past end of buffer, <bytes> + <offset> > 40000");
411 return 0;
412 }
413
414 GetFromBigBuf(got,requested,offset);
415 WaitForResponse(CMD_ACK,NULL);
416
417 i = 0;
418 for (j = 0; j < requested; j++) {
419 i++;
420 string_ptr += sprintf(string_ptr, "%02x ", got[j]);
421 if (i == 8) {
422 *(string_ptr - 1) = '\0'; // remove the trailing space
423 PrintAndLog("%s", string_buf);
424 string_buf[0] = '\0';
425 string_ptr = string_buf;
426 i = 0;
427 }
428 if (j == requested - 1 && string_buf[0] != '\0') { // print any remaining bytes
429 *(string_ptr - 1) = '\0';
430 PrintAndLog("%s", string_buf);
431 string_buf[0] = '\0';
432 }
433 }
434 return 0;
435 }
436
437 int CmdHide(const char *Cmd)
438 {
439 HideGraphWindow();
440 return 0;
441 }
442
443 int CmdHpf(const char *Cmd)
444 {
445 int i;
446 int accum = 0;
447
448 for (i = 10; i < GraphTraceLen; ++i)
449 accum += GraphBuffer[i];
450 accum /= (GraphTraceLen - 10);
451 for (i = 0; i < GraphTraceLen; ++i)
452 GraphBuffer[i] -= accum;
453
454 RepaintGraphWindow();
455 return 0;
456 }
457
458 int CmdSamples(const char *Cmd)
459 {
460 int cnt = 0;
461 int n;
462 uint8_t got[40000];
463
464 n = strtol(Cmd, NULL, 0);
465 if (n == 0) n = 512;
466 if (n > sizeof(got)) n = sizeof(got);
467
468 PrintAndLog("Reading %d samples\n", n);
469 GetFromBigBuf(got,n,0);
470 WaitForResponse(CMD_ACK,NULL);
471 for (int j = 0; j < n; j++) {
472 GraphBuffer[cnt++] = ((int)got[j]) - 128;
473 }
474
475 PrintAndLog("Done!\n");
476 GraphTraceLen = n;
477 RepaintGraphWindow();
478 return 0;
479 }
480
481 int CmdLoad(const char *Cmd)
482 {
483 FILE *f = fopen(Cmd, "r");
484 if (!f) {
485 PrintAndLog("couldn't open '%s'", Cmd);
486 return 0;
487 }
488
489 GraphTraceLen = 0;
490 char line[80];
491 while (fgets(line, sizeof (line), f)) {
492 GraphBuffer[GraphTraceLen] = atoi(line);
493 GraphTraceLen++;
494 }
495 fclose(f);
496 PrintAndLog("loaded %d samples", GraphTraceLen);
497 RepaintGraphWindow();
498 return 0;
499 }
500
501 int CmdLtrim(const char *Cmd)
502 {
503 int ds = atoi(Cmd);
504
505 for (int i = ds; i < GraphTraceLen; ++i)
506 GraphBuffer[i-ds] = GraphBuffer[i];
507 GraphTraceLen -= ds;
508
509 RepaintGraphWindow();
510 return 0;
511 }
512
513 /*
514 * Manchester demodulate a bitstream. The bitstream needs to be already in
515 * the GraphBuffer as 0 and 1 values
516 *
517 * Give the clock rate as argument in order to help the sync - the algorithm
518 * resyncs at each pulse anyway.
519 *
520 * Not optimized by any means, this is the 1st time I'm writing this type of
521 * routine, feel free to improve...
522 *
523 * 1st argument: clock rate (as number of samples per clock rate)
524 * Typical values can be 64, 32, 128...
525 */
526 int CmdManchesterDemod(const char *Cmd)
527 {
528 int i, j, invert= 0;
529 int bit;
530 int clock;
531 int lastval = 0;
532 int low = 0;
533 int high = 0;
534 int hithigh, hitlow, first;
535 int lc = 0;
536 int bitidx = 0;
537 int bit2idx = 0;
538 int warnings = 0;
539
540 /* check if we're inverting output */
541 if (*Cmd == 'i')
542 {
543 PrintAndLog("Inverting output");
544 invert = 1;
545 ++Cmd;
546 do
547 ++Cmd;
548 while(*Cmd == ' '); // in case a 2nd argument was given
549 }
550
551 /* Holds the decoded bitstream: each clock period contains 2 bits */
552 /* later simplified to 1 bit after manchester decoding. */
553 /* Add 10 bits to allow for noisy / uncertain traces without aborting */
554 /* int BitStream[GraphTraceLen*2/clock+10]; */
555
556 /* But it does not work if compiling on WIndows: therefore we just allocate a */
557 /* large array */
558 uint8_t BitStream[MAX_GRAPH_TRACE_LEN];
559
560 /* Detect high and lows */
561 for (i = 0; i < GraphTraceLen; i++)
562 {
563 if (GraphBuffer[i] > high)
564 high = GraphBuffer[i];
565 else if (GraphBuffer[i] < low)
566 low = GraphBuffer[i];
567 }
568
569 /* Get our clock */
570 clock = GetClock(Cmd, high, 1);
571
572 int tolerance = clock/4;
573
574 /* Detect first transition */
575 /* Lo-Hi (arbitrary) */
576 /* skip to the first high */
577 for (i= 0; i < GraphTraceLen; i++)
578 if (GraphBuffer[i] == high)
579 break;
580 /* now look for the first low */
581 for (; i < GraphTraceLen; i++)
582 {
583 if (GraphBuffer[i] == low)
584 {
585 lastval = i;
586 break;
587 }
588 }
589
590 /* If we're not working with 1/0s, demod based off clock */
591 if (high != 1)
592 {
593 bit = 0; /* We assume the 1st bit is zero, it may not be
594 * the case: this routine (I think) has an init problem.
595 * Ed.
596 */
597 for (; i < (int)(GraphTraceLen / clock); i++)
598 {
599 hithigh = 0;
600 hitlow = 0;
601 first = 1;
602
603 /* Find out if we hit both high and low peaks */
604 for (j = 0; j < clock; j++)
605 {
606 if (GraphBuffer[(i * clock) + j] == high)
607 hithigh = 1;
608 else if (GraphBuffer[(i * clock) + j] == low)
609 hitlow = 1;
610
611 /* it doesn't count if it's the first part of our read
612 because it's really just trailing from the last sequence */
613 if (first && (hithigh || hitlow))
614 hithigh = hitlow = 0;
615 else
616 first = 0;
617
618 if (hithigh && hitlow)
619 break;
620 }
621
622 /* If we didn't hit both high and low peaks, we had a bit transition */
623 if (!hithigh || !hitlow)
624 bit ^= 1;
625
626 BitStream[bit2idx++] = bit ^ invert;
627 }
628 }
629
630 /* standard 1/0 bitstream */
631 else
632 {
633
634 /* Then detect duration between 2 successive transitions */
635 for (bitidx = 1; i < GraphTraceLen; i++)
636 {
637 if (GraphBuffer[i-1] != GraphBuffer[i])
638 {
639 lc = i-lastval;
640 lastval = i;
641
642 // Error check: if bitidx becomes too large, we do not
643 // have a Manchester encoded bitstream or the clock is really
644 // wrong!
645 if (bitidx > (GraphTraceLen*2/clock+8) ) {
646 PrintAndLog("Error: the clock you gave is probably wrong, aborting.");
647 return 0;
648 }
649 // Then switch depending on lc length:
650 // Tolerance is 1/4 of clock rate (arbitrary)
651 if (abs(lc-clock/2) < tolerance) {
652 // Short pulse : either "1" or "0"
653 BitStream[bitidx++]=GraphBuffer[i-1];
654 } else if (abs(lc-clock) < tolerance) {
655 // Long pulse: either "11" or "00"
656 BitStream[bitidx++]=GraphBuffer[i-1];
657 BitStream[bitidx++]=GraphBuffer[i-1];
658 } else {
659 // Error
660 warnings++;
661 PrintAndLog("Warning: Manchester decode error for pulse width detection.");
662 PrintAndLog("(too many of those messages mean either the stream is not Manchester encoded, or clock is wrong)");
663
664 if (warnings > 10)
665 {
666 PrintAndLog("Error: too many detection errors, aborting.");
667 return 0;
668 }
669 }
670 }
671 }
672
673 // At this stage, we now have a bitstream of "01" ("1") or "10" ("0"), parse it into final decoded bitstream
674 // Actually, we overwrite BitStream with the new decoded bitstream, we just need to be careful
675 // to stop output at the final bitidx2 value, not bitidx
676 for (i = 0; i < bitidx; i += 2) {
677 if ((BitStream[i] == 0) && (BitStream[i+1] == 1)) {
678 BitStream[bit2idx++] = 1 ^ invert;
679 } else if ((BitStream[i] == 1) && (BitStream[i+1] == 0)) {
680 BitStream[bit2idx++] = 0 ^ invert;
681 } else {
682 // We cannot end up in this state, this means we are unsynchronized,
683 // move up 1 bit:
684 i++;
685 warnings++;
686 PrintAndLog("Unsynchronized, resync...");
687 PrintAndLog("(too many of those messages mean the stream is not Manchester encoded)");
688
689 if (warnings > 10)
690 {
691 PrintAndLog("Error: too many decode errors, aborting.");
692 return 0;
693 }
694 }
695 }
696 }
697
698 PrintAndLog("Manchester decoded bitstream");
699 // Now output the bitstream to the scrollback by line of 16 bits
700 for (i = 0; i < (bit2idx-16); i+=16) {
701 PrintAndLog("%i %i %i %i %i %i %i %i %i %i %i %i %i %i %i %i",
702 BitStream[i],
703 BitStream[i+1],
704 BitStream[i+2],
705 BitStream[i+3],
706 BitStream[i+4],
707 BitStream[i+5],
708 BitStream[i+6],
709 BitStream[i+7],
710 BitStream[i+8],
711 BitStream[i+9],
712 BitStream[i+10],
713 BitStream[i+11],
714 BitStream[i+12],
715 BitStream[i+13],
716 BitStream[i+14],
717 BitStream[i+15]);
718 }
719 return 0;
720 }
721
722 /* Modulate our data into manchester */
723 int CmdManchesterMod(const char *Cmd)
724 {
725 int i, j;
726 int clock;
727 int bit, lastbit, wave;
728
729 /* Get our clock */
730 clock = GetClock(Cmd, 0, 1);
731
732 wave = 0;
733 lastbit = 1;
734 for (i = 0; i < (int)(GraphTraceLen / clock); i++)
735 {
736 bit = GraphBuffer[i * clock] ^ 1;
737
738 for (j = 0; j < (int)(clock/2); j++)
739 GraphBuffer[(i * clock) + j] = bit ^ lastbit ^ wave;
740 for (j = (int)(clock/2); j < clock; j++)
741 GraphBuffer[(i * clock) + j] = bit ^ lastbit ^ wave ^ 1;
742
743 /* Keep track of how we start our wave and if we changed or not this time */
744 wave ^= bit ^ lastbit;
745 lastbit = bit;
746 }
747
748 RepaintGraphWindow();
749 return 0;
750 }
751
752 int CmdNorm(const char *Cmd)
753 {
754 int i;
755 int max = INT_MIN, min = INT_MAX;
756
757 for (i = 10; i < GraphTraceLen; ++i) {
758 if (GraphBuffer[i] > max)
759 max = GraphBuffer[i];
760 if (GraphBuffer[i] < min)
761 min = GraphBuffer[i];
762 }
763
764 if (max != min) {
765 for (i = 0; i < GraphTraceLen; ++i) {
766 GraphBuffer[i] = (GraphBuffer[i] - ((max + min) / 2)) * 1000 /
767 (max - min);
768 }
769 }
770 RepaintGraphWindow();
771 return 0;
772 }
773
774 int CmdPlot(const char *Cmd)
775 {
776 ShowGraphWindow();
777 return 0;
778 }
779
780 int CmdSave(const char *Cmd)
781 {
782 FILE *f = fopen(Cmd, "w");
783 if(!f) {
784 PrintAndLog("couldn't open '%s'", Cmd);
785 return 0;
786 }
787 int i;
788 for (i = 0; i < GraphTraceLen; i++) {
789 fprintf(f, "%d\n", GraphBuffer[i]);
790 }
791 fclose(f);
792 PrintAndLog("saved to '%s'", Cmd);
793 return 0;
794 }
795
796 int CmdScale(const char *Cmd)
797 {
798 CursorScaleFactor = atoi(Cmd);
799 if (CursorScaleFactor == 0) {
800 PrintAndLog("bad, can't have zero scale");
801 CursorScaleFactor = 1;
802 }
803 RepaintGraphWindow();
804 return 0;
805 }
806
807 int CmdThreshold(const char *Cmd)
808 {
809 int threshold = atoi(Cmd);
810
811 for (int i = 0; i < GraphTraceLen; ++i) {
812 if (GraphBuffer[i] >= threshold)
813 GraphBuffer[i] = 1;
814 else
815 GraphBuffer[i] = -1;
816 }
817 RepaintGraphWindow();
818 return 0;
819 }
820
821 int CmdZerocrossings(const char *Cmd)
822 {
823 // Zero-crossings aren't meaningful unless the signal is zero-mean.
824 CmdHpf("");
825
826 int sign = 1;
827 int zc = 0;
828 int lastZc = 0;
829
830 for (int i = 0; i < GraphTraceLen; ++i) {
831 if (GraphBuffer[i] * sign >= 0) {
832 // No change in sign, reproduce the previous sample count.
833 zc++;
834 GraphBuffer[i] = lastZc;
835 } else {
836 // Change in sign, reset the sample count.
837 sign = -sign;
838 GraphBuffer[i] = lastZc;
839 if (sign > 0) {
840 lastZc = zc;
841 zc = 0;
842 }
843 }
844 }
845
846 RepaintGraphWindow();
847 return 0;
848 }
849
850 static command_t CommandTable[] =
851 {
852 {"help", CmdHelp, 1, "This help"},
853 {"amp", CmdAmp, 1, "Amplify peaks"},
854 {"askdemod", Cmdaskdemod, 1, "<0|1> -- Attempt to demodulate simple ASK tags"},
855 {"autocorr", CmdAutoCorr, 1, "<window length> -- Autocorrelation over window"},
856 {"bitsamples", CmdBitsamples, 0, "Get raw samples as bitstring"},
857 {"bitstream", CmdBitstream, 1, "[clock rate] -- Convert waveform into a bitstream"},
858 {"buffclear", CmdBuffClear, 1, "Clear sample buffer and graph window"},
859 {"dec", CmdDec, 1, "Decimate samples"},
860 {"detectclock", CmdDetectClockRate, 1, "Detect clock rate"},
861 {"fskdemod", CmdFSKdemod, 1, "Demodulate graph window as a HID FSK"},
862 {"grid", CmdGrid, 1, "<x> <y> -- overlay grid on graph window, use zero value to turn off either"},
863 {"hexsamples", CmdHexsamples, 0, "<bytes> [<offset>] -- Dump big buffer as hex bytes"},
864 {"hide", CmdHide, 1, "Hide graph window"},
865 {"hpf", CmdHpf, 1, "Remove DC offset from trace"},
866 {"load", CmdLoad, 1, "<filename> -- Load trace (to graph window"},
867 {"ltrim", CmdLtrim, 1, "<samples> -- Trim samples from left of trace"},
868 {"mandemod", CmdManchesterDemod, 1, "[i] [clock rate] -- Manchester demodulate binary stream (option 'i' to invert output)"},
869 {"manmod", CmdManchesterMod, 1, "[clock rate] -- Manchester modulate a binary stream"},
870 {"norm", CmdNorm, 1, "Normalize max/min to +/-500"},
871 {"plot", CmdPlot, 1, "Show graph window (hit 'h' in window for keystroke help)"},
872 {"samples", CmdSamples, 0, "[512 - 40000] -- Get raw samples for graph window"},
873 {"save", CmdSave, 1, "<filename> -- Save trace (from graph window)"},
874 {"scale", CmdScale, 1, "<int> -- Set cursor display scale"},
875 {"threshold", CmdThreshold, 1, "<threshold> -- Maximize/minimize every value in the graph window depending on threshold"},
876 {"zerocrossings", CmdZerocrossings, 1, "Count time between zero-crossings"},
877 {NULL, NULL, 0, NULL}
878 };
879
880 int CmdData(const char *Cmd)
881 {
882 CmdsParse(CommandTable, Cmd);
883 return 0;
884 }
885
886 int CmdHelp(const char *Cmd)
887 {
888 CmdsHelp(CommandTable);
889 return 0;
890 }
Impressum, Datenschutz