]> git.zerfleddert.de Git - proxmark3-svn/blob - client/cmddata.c
FIX: I think the dumping of data is correct now in tnp3.lua. MD5 string vs bytearra...
[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
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 int Cmdaskdemod(const char *Cmd)
74 {
75 int i;
76 int c, high = 0, low = 0;
77
78 sscanf(Cmd, "%i", &c);
79
80 if (c != 0 && c != 1) {
81 PrintAndLog("Invalid argument: %s", Cmd);
82 return 0;
83 }
84
85 /* Detect high and lows */
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
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 uint8_t got[36440] = {0x00};
461
462 int n = strtol(Cmd, NULL, 0);
463 if (n == 0)
464 n = 512;
465 if (n > sizeof(got))
466 n = sizeof(got);
467
468 PrintAndLog("Reading %d samples from device memory\n", n);
469 GetFromBigBuf(got,n,3560);
470 WaitForResponse(CMD_ACK,NULL);
471 for (int j = 0; j < n; ++j) {
472 GraphBuffer[j] = ((int)got[j]) - 128;
473 }
474 GraphTraceLen = n;
475 RepaintGraphWindow();
476 return 0;
477 }
478
479 int CmdLoad(const char *Cmd)
480 {
481 FILE *f = fopen(Cmd, "r");
482 if (!f) {
483 PrintAndLog("couldn't open '%s'", Cmd);
484 return 0;
485 }
486
487 GraphTraceLen = 0;
488 char line[80];
489 while (fgets(line, sizeof (line), f)) {
490 GraphBuffer[GraphTraceLen] = atoi(line);
491 GraphTraceLen++;
492 }
493 fclose(f);
494 PrintAndLog("loaded %d samples", GraphTraceLen);
495 RepaintGraphWindow();
496 return 0;
497 }
498
499 int CmdLtrim(const char *Cmd)
500 {
501 int ds = atoi(Cmd);
502
503 for (int i = ds; i < GraphTraceLen; ++i)
504 GraphBuffer[i-ds] = GraphBuffer[i];
505 GraphTraceLen -= ds;
506
507 RepaintGraphWindow();
508 return 0;
509 }
510
511 /*
512 * Manchester demodulate a bitstream. The bitstream needs to be already in
513 * the GraphBuffer as 0 and 1 values
514 *
515 * Give the clock rate as argument in order to help the sync - the algorithm
516 * resyncs at each pulse anyway.
517 *
518 * Not optimized by any means, this is the 1st time I'm writing this type of
519 * routine, feel free to improve...
520 *
521 * 1st argument: clock rate (as number of samples per clock rate)
522 * Typical values can be 64, 32, 128...
523 */
524 int CmdManchesterDemod(const char *Cmd)
525 {
526 int i, j, invert= 0;
527 int bit;
528 int clock;
529 int lastval = 0;
530 int low = 0;
531 int high = 0;
532 int hithigh, hitlow, first;
533 int lc = 0;
534 int bitidx = 0;
535 int bit2idx = 0;
536 int warnings = 0;
537
538 /* check if we're inverting output */
539 if (*Cmd == 'i')
540 {
541 PrintAndLog("Inverting output");
542 invert = 1;
543 ++Cmd;
544 do
545 ++Cmd;
546 while(*Cmd == ' '); // in case a 2nd argument was given
547 }
548
549 /* Holds the decoded bitstream: each clock period contains 2 bits */
550 /* later simplified to 1 bit after manchester decoding. */
551 /* Add 10 bits to allow for noisy / uncertain traces without aborting */
552 /* int BitStream[GraphTraceLen*2/clock+10]; */
553
554 /* But it does not work if compiling on WIndows: therefore we just allocate a */
555 /* large array */
556 uint8_t BitStream[MAX_GRAPH_TRACE_LEN] = {0x00};
557
558 /* Detect high and lows */
559 for (i = 0; i < GraphTraceLen; i++)
560 {
561 if (GraphBuffer[i] > high)
562 high = GraphBuffer[i];
563 else if (GraphBuffer[i] < low)
564 low = GraphBuffer[i];
565 }
566
567 /* Get our clock */
568 clock = GetClock(Cmd, high, 1);
569 int tolerance = clock/4;
570
571 /* Detect first transition */
572 /* Lo-Hi (arbitrary) */
573 /* skip to the first high */
574 for (i= 0; i < GraphTraceLen; i++)
575 if (GraphBuffer[i] == high)
576 break;
577 /* now look for the first low */
578 for (; i < GraphTraceLen; i++)
579 {
580 if (GraphBuffer[i] == low)
581 {
582 lastval = i;
583 break;
584 }
585 }
586
587 /* If we're not working with 1/0s, demod based off clock */
588 if (high != 1)
589 {
590 PrintAndLog("Entering path A");
591 bit = 0; /* We assume the 1st bit is zero, it may not be
592 * the case: this routine (I think) has an init problem.
593 * Ed.
594 */
595 for (; i < (int)(GraphTraceLen / clock); i++)
596 {
597 hithigh = 0;
598 hitlow = 0;
599 first = 1;
600
601 /* Find out if we hit both high and low peaks */
602 for (j = 0; j < clock; j++)
603 {
604 if (GraphBuffer[(i * clock) + j] == high)
605 hithigh = 1;
606 else if (GraphBuffer[(i * clock) + j] == low)
607 hitlow = 1;
608
609 /* it doesn't count if it's the first part of our read
610 because it's really just trailing from the last sequence */
611 if (first && (hithigh || hitlow))
612 hithigh = hitlow = 0;
613 else
614 first = 0;
615
616 if (hithigh && hitlow)
617 break;
618 }
619
620 /* If we didn't hit both high and low peaks, we had a bit transition */
621 if (!hithigh || !hitlow)
622 bit ^= 1;
623
624 BitStream[bit2idx++] = bit ^ invert;
625 }
626 }
627
628 /* standard 1/0 bitstream */
629 else
630 {
631
632 /* Then detect duration between 2 successive transitions */
633 for (bitidx = 1; i < GraphTraceLen; i++)
634 {
635 if (GraphBuffer[i-1] != GraphBuffer[i])
636 {
637 lc = i-lastval;
638 lastval = i;
639
640 // Error check: if bitidx becomes too large, we do not
641 // have a Manchester encoded bitstream or the clock is really
642 // wrong!
643 if (bitidx > (GraphTraceLen*2/clock+8) ) {
644 PrintAndLog("Error: the clock you gave is probably wrong, aborting.");
645 return 0;
646 }
647 // Then switch depending on lc length:
648 // Tolerance is 1/4 of clock rate (arbitrary)
649 if (abs(lc-clock/2) < tolerance) {
650 // Short pulse : either "1" or "0"
651 BitStream[bitidx++]=GraphBuffer[i-1];
652 } else if (abs(lc-clock) < tolerance) {
653 // Long pulse: either "11" or "00"
654 BitStream[bitidx++]=GraphBuffer[i-1];
655 BitStream[bitidx++]=GraphBuffer[i-1];
656 } else {
657 // Error
658 warnings++;
659 PrintAndLog("Warning: Manchester decode error for pulse width detection.");
660 PrintAndLog("(too many of those messages mean either the stream is not Manchester encoded, or clock is wrong)");
661
662 if (warnings > 10)
663 {
664 PrintAndLog("Error: too many detection errors, aborting.");
665 return 0;
666 }
667 }
668 }
669 }
670
671 // At this stage, we now have a bitstream of "01" ("1") or "10" ("0"), parse it into final decoded bitstream
672 // Actually, we overwrite BitStream with the new decoded bitstream, we just need to be careful
673 // to stop output at the final bitidx2 value, not bitidx
674
675 //http://www.proxmark.org/forum/viewtopic.php?id=403
676 for (i = 1; 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 bit2idx;
720 }
721
722 /* Modulate our data into manchester */
723 int CmdManchesterMod(const char *Cmd)
724 {
725 int i, j;
726 int bit, lastbit, wave;
727 int clock = GetClock(Cmd, 0, 1);
728 int clock1 = GetT55x7Clock( GraphBuffer, GraphTraceLen, 0 );
729 PrintAndLog("MAN MOD CLOCKS: %d ice %d", clock,clock1);
730
731 int half = (int)(clock/2);
732
733 wave = 0;
734 lastbit = 1;
735 for (i = 0; i < (int)(GraphTraceLen / clock); i++)
736 {
737 bit = GraphBuffer[i * clock] ^ 1;
738
739 for (j = 0; j < half; ++j)
740 GraphBuffer[(i * clock) + j] = bit ^ lastbit ^ wave;
741 for (j = half; j < clock; ++j)
742 GraphBuffer[(i * clock) + j] = bit ^ lastbit ^ wave ^ 1;
743
744 /* Keep track of how we start our wave and if we changed or not this time */
745 wave ^= bit ^ lastbit;
746 lastbit = bit;
747 }
748
749 RepaintGraphWindow();
750 return 0;
751 }
752
753 int CmdNorm(const char *Cmd)
754 {
755 int i;
756 int max = INT_MIN, min = INT_MAX;
757
758 for (i = 10; i < GraphTraceLen; ++i) {
759 if (GraphBuffer[i] > max)
760 max = GraphBuffer[i];
761 if (GraphBuffer[i] < min)
762 min = GraphBuffer[i];
763 }
764
765 if (max != min) {
766 for (i = 0; i < GraphTraceLen; ++i) {
767 GraphBuffer[i] = (GraphBuffer[i] - ((max + min) / 2)) * 1000 /
768 (max - min);
769 }
770 }
771 RepaintGraphWindow();
772 return 0;
773 }
774
775 int CmdPlot(const char *Cmd)
776 {
777 ShowGraphWindow();
778 return 0;
779 }
780
781 int CmdSave(const char *Cmd)
782 {
783 FILE *f = fopen(Cmd, "w");
784 if(!f) {
785 PrintAndLog("couldn't open '%s'", Cmd);
786 return 0;
787 }
788 int i;
789 for (i = 0; i < GraphTraceLen; i++) {
790 fprintf(f, "%d\n", GraphBuffer[i]);
791 }
792 fclose(f);
793 PrintAndLog("saved to '%s'", Cmd);
794 return 0;
795 }
796
797 int CmdScale(const char *Cmd)
798 {
799 CursorScaleFactor = atoi(Cmd);
800 if (CursorScaleFactor == 0) {
801 PrintAndLog("bad, can't have zero scale");
802 CursorScaleFactor = 1;
803 }
804 RepaintGraphWindow();
805 return 0;
806 }
807
808 int CmdThreshold(const char *Cmd)
809 {
810 int threshold = atoi(Cmd);
811
812 for (int i = 0; i < GraphTraceLen; ++i) {
813 if (GraphBuffer[i] >= threshold)
814 GraphBuffer[i] = 1;
815 else
816 GraphBuffer[i] = -1;
817 }
818 RepaintGraphWindow();
819 return 0;
820 }
821
822 int CmdDirectionalThreshold(const char *Cmd)
823 {
824 int8_t upThres = param_get8(Cmd, 0);
825 int8_t downThres = param_get8(Cmd, 1);
826
827 printf("Applying Up Threshold: %d, Down Threshold: %d\n", upThres, downThres);
828
829 int lastValue = GraphBuffer[0];
830 GraphBuffer[0] = 0; // Will be changed at the end, but init 0 as we adjust to last samples value if no threshold kicks in.
831
832 for (int i = 1; i < GraphTraceLen; ++i) {
833 // Apply first threshold to samples heading up
834 if (GraphBuffer[i] >= upThres && GraphBuffer[i] > lastValue)
835 {
836 lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it.
837 GraphBuffer[i] = 1;
838 }
839 // Apply second threshold to samples heading down
840 else if (GraphBuffer[i] <= downThres && GraphBuffer[i] < lastValue)
841 {
842 lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it.
843 GraphBuffer[i] = -1;
844 }
845 else
846 {
847 lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it.
848 GraphBuffer[i] = GraphBuffer[i-1];
849
850 }
851 }
852 GraphBuffer[0] = GraphBuffer[1]; // Aline with first edited sample.
853 RepaintGraphWindow();
854 return 0;
855 }
856
857 int CmdZerocrossings(const char *Cmd)
858 {
859 // Zero-crossings aren't meaningful unless the signal is zero-mean.
860 CmdHpf("");
861
862 int sign = 1;
863 int zc = 0;
864 int lastZc = 0;
865
866 for (int i = 0; i < GraphTraceLen; ++i) {
867 if (GraphBuffer[i] * sign >= 0) {
868 // No change in sign, reproduce the previous sample count.
869 zc++;
870 GraphBuffer[i] = lastZc;
871 } else {
872 // Change in sign, reset the sample count.
873 sign = -sign;
874 GraphBuffer[i] = lastZc;
875 if (sign > 0) {
876 lastZc = zc;
877 zc = 0;
878 }
879 }
880 }
881
882 RepaintGraphWindow();
883 return 0;
884 }
885
886 static command_t CommandTable[] =
887 {
888 {"help", CmdHelp, 1, "This help"},
889 {"amp", CmdAmp, 1, "Amplify peaks"},
890 {"askdemod", Cmdaskdemod, 1, "<0|1> -- Attempt to demodulate simple ASK tags"},
891 {"autocorr", CmdAutoCorr, 1, "<window length> -- Autocorrelation over window"},
892 {"bitsamples", CmdBitsamples, 0, "Get raw samples as bitstring"},
893 {"bitstream", CmdBitstream, 1, "[clock rate] -- Convert waveform into a bitstream"},
894 {"buffclear", CmdBuffClear, 1, "Clear sample buffer and graph window"},
895 {"dec", CmdDec, 1, "Decimate samples"},
896 {"detectclock", CmdDetectClockRate, 1, "Detect clock rate"},
897 {"fskdemod", CmdFSKdemod, 1, "Demodulate graph window as a HID FSK"},
898 {"grid", CmdGrid, 1, "<x> <y> -- overlay grid on graph window, use zero value to turn off either"},
899 {"hexsamples", CmdHexsamples, 0, "<bytes> [<offset>] -- Dump big buffer as hex bytes"},
900 {"hide", CmdHide, 1, "Hide graph window"},
901 {"hpf", CmdHpf, 1, "Remove DC offset from trace"},
902 {"load", CmdLoad, 1, "<filename> -- Load trace (to graph window"},
903 {"ltrim", CmdLtrim, 1, "<samples> -- Trim samples from left of trace"},
904 {"mandemod", CmdManchesterDemod, 1, "[i] [clock rate] -- Manchester demodulate binary stream (option 'i' to invert output)"},
905 {"manmod", CmdManchesterMod, 1, "[clock rate] -- Manchester modulate a binary stream"},
906 {"norm", CmdNorm, 1, "Normalize max/min to +/-500"},
907 {"plot", CmdPlot, 1, "Show graph window (hit 'h' in window for keystroke help)"},
908 {"samples", CmdSamples, 0, "[512 - 40000] -- Get raw samples for graph window"},
909 {"save", CmdSave, 1, "<filename> -- Save trace (from graph window)"},
910 {"scale", CmdScale, 1, "<int> -- Set cursor display scale"},
911 {"threshold", CmdThreshold, 1, "<threshold> -- Maximize/minimize every value in the graph window depending on threshold"},
912 {"zerocrossings", CmdZerocrossings, 1, "Count time between zero-crossings"},
913 {"dirthreshold", CmdDirectionalThreshold, 1, "<thres up> <thres down> -- Max rising higher up-thres/ Min falling lower down-thres, keep rest as prev."},
914 {NULL, NULL, 0, NULL}
915 };
916
917 int CmdData(const char *Cmd)
918 {
919 CmdsParse(CommandTable, Cmd);
920 return 0;
921 }
922
923 int CmdHelp(const char *Cmd)
924 {
925 CmdsHelp(CommandTable);
926 return 0;
927 }
Impressum, Datenschutz