]> cvs.zerfleddert.de Git - proxmark3-svn/blame - client/cmddata.c
FIX: hf mf eload - now supports specifying 0,1,2,4 in card memory for the file to...
[proxmark3-svn] / client / cmddata.c
CommitLineData
a553f267 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
7fe9b0b7 11#include <stdio.h>
12#include <stdlib.h>
13#include <string.h>
14#include <limits.h>
902cb3c0 15#include "proxmark3.h"
7fe9b0b7 16#include "data.h"
17#include "ui.h"
18#include "graph.h"
19#include "cmdparser.h"
d51b2eda 20#include "util.h"
7fe9b0b7 21#include "cmdmain.h"
22#include "cmddata.h"
23
c15d2bdc 24
7fe9b0b7 25static int CmdHelp(const char *Cmd);
26
27int 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 */
73int Cmdaskdemod(const char *Cmd)
74{
75 int i;
76 int c, high = 0, low = 0;
77
7fe9b0b7 78 sscanf(Cmd, "%i", &c);
79
f6c18637 80 if (c != 0 && c != 1) {
81 PrintAndLog("Invalid argument: %s", Cmd);
82 return 0;
83 }
84
85 /* Detect high and lows */
7fe9b0b7 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 }
f6c18637 93
7fe9b0b7 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
121int 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
153int CmdBitsamples(const char *Cmd)
154{
155 int cnt = 0;
90d74dc2 156 uint8_t got[12288];
157
158 GetFromBigBuf(got,sizeof(got),0);
159 WaitForResponse(CMD_ACK,NULL);
7fe9b0b7 160
90d74dc2 161 for (int j = 0; j < sizeof(got); j++) {
7fe9b0b7 162 for (int k = 0; k < 8; k++) {
90d74dc2 163 if(got[j] & (1 << (7 - k))) {
7fe9b0b7 164 GraphBuffer[cnt++] = 1;
165 } else {
166 GraphBuffer[cnt++] = 0;
167 }
168 }
7fe9b0b7 169 }
170 GraphTraceLen = cnt;
171 RepaintGraphWindow();
172 return 0;
173}
174
175/*
176 * Convert to a bitstream
177 */
178int 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
240int CmdBuffClear(const char *Cmd)
241{
242 UsbCommand c = {CMD_BUFF_CLEAR};
243 SendCommand(&c);
244 ClearGraph(true);
245 return 0;
246}
247
248int 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 */
259int CmdDetectClockRate(const char *Cmd)
260{
261 int clock = DetectClock(0);
262 PrintAndLog("Auto-detected clock rate: %d", clock);
263 return 0;
264}
265
266int 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
385int CmdGrid(const char *Cmd)
386{
387 sscanf(Cmd, "%i %i", &PlotGridX, &PlotGridY);
7ddb9900 388 PlotGridXdefault= PlotGridX;
389 PlotGridYdefault= PlotGridY;
7fe9b0b7 390 RepaintGraphWindow();
391 return 0;
392}
393
394int CmdHexsamples(const char *Cmd)
395{
4961e292 396 int i, j;
7fe9b0b7 397 int requested = 0;
398 int offset = 0;
4961e292 399 char string_buf[25];
400 char* string_ptr = string_buf;
90d74dc2 401 uint8_t got[40000];
4961e292 402
403 sscanf(Cmd, "%i %i", &requested, &offset);
90d74dc2 404
4961e292 405 /* if no args send something */
406 if (requested == 0) {
90d74dc2 407 requested = 8;
408 }
90d74dc2 409 if (offset + requested > sizeof(got)) {
410 PrintAndLog("Tried to read past end of buffer, <bytes> + <offset> > 40000");
4961e292 411 return 0;
412 }
90d74dc2 413
4961e292 414 GetFromBigBuf(got,requested,offset);
90d74dc2 415 WaitForResponse(CMD_ACK,NULL);
416
4961e292 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 }
7fe9b0b7 433 }
434 return 0;
435}
436
7fe9b0b7 437int CmdHide(const char *Cmd)
438{
439 HideGraphWindow();
440 return 0;
441}
442
443int 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
8d183c53 458int CmdSamples(const char *Cmd)
7fe9b0b7 459{
081151ea 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);
a2847518 467
081151ea 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;
7fe9b0b7 477}
478
479int CmdLoad(const char *Cmd)
480{
463ca973 481 char filename[FILE_PATH_SIZE] = {0x00};
482 int len = 0;
483
484 len = strlen(Cmd);
485 if (len > FILE_PATH_SIZE) len = FILE_PATH_SIZE;
486 memcpy(filename, Cmd, len);
487
488 FILE *f = fopen(filename, "r");
489 if (!f) {
490 PrintAndLog("couldn't open '%s'", filename);
491 return 0;
492 }
7fe9b0b7 493
494 GraphTraceLen = 0;
495 char line[80];
496 while (fgets(line, sizeof (line), f)) {
497 GraphBuffer[GraphTraceLen] = atoi(line);
498 GraphTraceLen++;
499 }
500 fclose(f);
501 PrintAndLog("loaded %d samples", GraphTraceLen);
502 RepaintGraphWindow();
503 return 0;
504}
505
506int CmdLtrim(const char *Cmd)
507{
508 int ds = atoi(Cmd);
509
510 for (int i = ds; i < GraphTraceLen; ++i)
511 GraphBuffer[i-ds] = GraphBuffer[i];
512 GraphTraceLen -= ds;
513
514 RepaintGraphWindow();
515 return 0;
516}
517
518/*
519 * Manchester demodulate a bitstream. The bitstream needs to be already in
520 * the GraphBuffer as 0 and 1 values
521 *
522 * Give the clock rate as argument in order to help the sync - the algorithm
523 * resyncs at each pulse anyway.
524 *
525 * Not optimized by any means, this is the 1st time I'm writing this type of
526 * routine, feel free to improve...
527 *
528 * 1st argument: clock rate (as number of samples per clock rate)
529 * Typical values can be 64, 32, 128...
530 */
531int CmdManchesterDemod(const char *Cmd)
532{
533 int i, j, invert= 0;
534 int bit;
535 int clock;
fddf220a 536 int lastval = 0;
7fe9b0b7 537 int low = 0;
538 int high = 0;
539 int hithigh, hitlow, first;
540 int lc = 0;
541 int bitidx = 0;
542 int bit2idx = 0;
543 int warnings = 0;
544
545 /* check if we're inverting output */
c6f1fb9d 546 if (*Cmd == 'i')
7fe9b0b7 547 {
548 PrintAndLog("Inverting output");
549 invert = 1;
fffad860 550 ++Cmd;
7fe9b0b7 551 do
552 ++Cmd;
553 while(*Cmd == ' '); // in case a 2nd argument was given
554 }
555
556 /* Holds the decoded bitstream: each clock period contains 2 bits */
557 /* later simplified to 1 bit after manchester decoding. */
558 /* Add 10 bits to allow for noisy / uncertain traces without aborting */
559 /* int BitStream[GraphTraceLen*2/clock+10]; */
560
561 /* But it does not work if compiling on WIndows: therefore we just allocate a */
562 /* large array */
a61b4976 563 uint8_t BitStream[MAX_GRAPH_TRACE_LEN] = {0x00};
7fe9b0b7 564
565 /* Detect high and lows */
566 for (i = 0; i < GraphTraceLen; i++)
567 {
568 if (GraphBuffer[i] > high)
569 high = GraphBuffer[i];
570 else if (GraphBuffer[i] < low)
571 low = GraphBuffer[i];
572 }
573
574 /* Get our clock */
a61b4976 575 clock = GetClock(Cmd, high, 1);
7fe9b0b7 576 int tolerance = clock/4;
577
578 /* Detect first transition */
579 /* Lo-Hi (arbitrary) */
580 /* skip to the first high */
581 for (i= 0; i < GraphTraceLen; i++)
582 if (GraphBuffer[i] == high)
583 break;
584 /* now look for the first low */
585 for (; i < GraphTraceLen; i++)
586 {
587 if (GraphBuffer[i] == low)
588 {
589 lastval = i;
590 break;
591 }
592 }
b44e5233 593
7fe9b0b7 594 /* If we're not working with 1/0s, demod based off clock */
595 if (high != 1)
596 {
b44e5233 597 PrintAndLog("Entering path A");
7fe9b0b7 598 bit = 0; /* We assume the 1st bit is zero, it may not be
599 * the case: this routine (I think) has an init problem.
600 * Ed.
b44e5233 601 */
7fe9b0b7 602 for (; i < (int)(GraphTraceLen / clock); i++)
603 {
604 hithigh = 0;
605 hitlow = 0;
606 first = 1;
607
608 /* Find out if we hit both high and low peaks */
609 for (j = 0; j < clock; j++)
610 {
611 if (GraphBuffer[(i * clock) + j] == high)
612 hithigh = 1;
613 else if (GraphBuffer[(i * clock) + j] == low)
614 hitlow = 1;
615
616 /* it doesn't count if it's the first part of our read
617 because it's really just trailing from the last sequence */
618 if (first && (hithigh || hitlow))
619 hithigh = hitlow = 0;
620 else
621 first = 0;
622
623 if (hithigh && hitlow)
624 break;
625 }
626
627 /* If we didn't hit both high and low peaks, we had a bit transition */
628 if (!hithigh || !hitlow)
629 bit ^= 1;
630
631 BitStream[bit2idx++] = bit ^ invert;
632 }
633 }
634
635 /* standard 1/0 bitstream */
636 else
637 {
638
639 /* Then detect duration between 2 successive transitions */
640 for (bitidx = 1; i < GraphTraceLen; i++)
641 {
642 if (GraphBuffer[i-1] != GraphBuffer[i])
643 {
644 lc = i-lastval;
645 lastval = i;
646
647 // Error check: if bitidx becomes too large, we do not
648 // have a Manchester encoded bitstream or the clock is really
649 // wrong!
650 if (bitidx > (GraphTraceLen*2/clock+8) ) {
651 PrintAndLog("Error: the clock you gave is probably wrong, aborting.");
652 return 0;
653 }
654 // Then switch depending on lc length:
655 // Tolerance is 1/4 of clock rate (arbitrary)
656 if (abs(lc-clock/2) < tolerance) {
657 // Short pulse : either "1" or "0"
658 BitStream[bitidx++]=GraphBuffer[i-1];
659 } else if (abs(lc-clock) < tolerance) {
660 // Long pulse: either "11" or "00"
661 BitStream[bitidx++]=GraphBuffer[i-1];
662 BitStream[bitidx++]=GraphBuffer[i-1];
663 } else {
664 // Error
665 warnings++;
666 PrintAndLog("Warning: Manchester decode error for pulse width detection.");
667 PrintAndLog("(too many of those messages mean either the stream is not Manchester encoded, or clock is wrong)");
668
669 if (warnings > 10)
670 {
671 PrintAndLog("Error: too many detection errors, aborting.");
672 return 0;
673 }
674 }
675 }
676 }
677
678 // At this stage, we now have a bitstream of "01" ("1") or "10" ("0"), parse it into final decoded bitstream
679 // Actually, we overwrite BitStream with the new decoded bitstream, we just need to be careful
680 // to stop output at the final bitidx2 value, not bitidx
c15d2bdc 681
682 //http://www.proxmark.org/forum/viewtopic.php?id=403
683 for (i = 1; i < bitidx; i += 2) {
7fe9b0b7 684 if ((BitStream[i] == 0) && (BitStream[i+1] == 1)) {
685 BitStream[bit2idx++] = 1 ^ invert;
686 } else if ((BitStream[i] == 1) && (BitStream[i+1] == 0)) {
687 BitStream[bit2idx++] = 0 ^ invert;
688 } else {
689 // We cannot end up in this state, this means we are unsynchronized,
690 // move up 1 bit:
691 i++;
081151ea 692 warnings++;
7fe9b0b7 693 PrintAndLog("Unsynchronized, resync...");
694 PrintAndLog("(too many of those messages mean the stream is not Manchester encoded)");
695
696 if (warnings > 10)
697 {
698 PrintAndLog("Error: too many decode errors, aborting.");
699 return 0;
700 }
701 }
702 }
703 }
704
705 PrintAndLog("Manchester decoded bitstream");
706 // Now output the bitstream to the scrollback by line of 16 bits
707 for (i = 0; i < (bit2idx-16); i+=16) {
708 PrintAndLog("%i %i %i %i %i %i %i %i %i %i %i %i %i %i %i %i",
709 BitStream[i],
710 BitStream[i+1],
711 BitStream[i+2],
712 BitStream[i+3],
713 BitStream[i+4],
714 BitStream[i+5],
715 BitStream[i+6],
716 BitStream[i+7],
717 BitStream[i+8],
718 BitStream[i+9],
719 BitStream[i+10],
720 BitStream[i+11],
721 BitStream[i+12],
722 BitStream[i+13],
723 BitStream[i+14],
724 BitStream[i+15]);
725 }
c15d2bdc 726 return bit2idx;
7fe9b0b7 727}
728
729/* Modulate our data into manchester */
730int CmdManchesterMod(const char *Cmd)
731{
732 int i, j;
7fe9b0b7 733 int bit, lastbit, wave;
a61b4976 734 int clock = GetClock(Cmd, 0, 1);
735 int clock1 = GetT55x7Clock( GraphBuffer, GraphTraceLen, 0 );
736 PrintAndLog("MAN MOD CLOCKS: %d ice %d", clock,clock1);
737
738 int half = (int)(clock/2);
739
7fe9b0b7 740 wave = 0;
741 lastbit = 1;
742 for (i = 0; i < (int)(GraphTraceLen / clock); i++)
743 {
744 bit = GraphBuffer[i * clock] ^ 1;
745
a61b4976 746 for (j = 0; j < half; ++j)
7fe9b0b7 747 GraphBuffer[(i * clock) + j] = bit ^ lastbit ^ wave;
a61b4976 748 for (j = half; j < clock; ++j)
7fe9b0b7 749 GraphBuffer[(i * clock) + j] = bit ^ lastbit ^ wave ^ 1;
750
751 /* Keep track of how we start our wave and if we changed or not this time */
752 wave ^= bit ^ lastbit;
753 lastbit = bit;
754 }
755
756 RepaintGraphWindow();
757 return 0;
758}
759
760int CmdNorm(const char *Cmd)
761{
762 int i;
763 int max = INT_MIN, min = INT_MAX;
764
765 for (i = 10; i < GraphTraceLen; ++i) {
766 if (GraphBuffer[i] > max)
767 max = GraphBuffer[i];
768 if (GraphBuffer[i] < min)
769 min = GraphBuffer[i];
770 }
771
772 if (max != min) {
773 for (i = 0; i < GraphTraceLen; ++i) {
774 GraphBuffer[i] = (GraphBuffer[i] - ((max + min) / 2)) * 1000 /
775 (max - min);
776 }
777 }
778 RepaintGraphWindow();
779 return 0;
780}
781
782int CmdPlot(const char *Cmd)
783{
784 ShowGraphWindow();
785 return 0;
786}
787
788int CmdSave(const char *Cmd)
789{
463ca973 790 char filename[FILE_PATH_SIZE] = {0x00};
791 int len = 0;
792
793 len = strlen(Cmd);
794 if (len > FILE_PATH_SIZE) len = FILE_PATH_SIZE;
795 memcpy(filename, Cmd, len);
796
797
798 FILE *f = fopen(filename, "w");
7fe9b0b7 799 if(!f) {
463ca973 800 PrintAndLog("couldn't open '%s'", filename);
7fe9b0b7 801 return 0;
802 }
803 int i;
804 for (i = 0; i < GraphTraceLen; i++) {
805 fprintf(f, "%d\n", GraphBuffer[i]);
806 }
807 fclose(f);
808 PrintAndLog("saved to '%s'", Cmd);
809 return 0;
810}
811
812int CmdScale(const char *Cmd)
813{
814 CursorScaleFactor = atoi(Cmd);
815 if (CursorScaleFactor == 0) {
816 PrintAndLog("bad, can't have zero scale");
817 CursorScaleFactor = 1;
818 }
819 RepaintGraphWindow();
820 return 0;
821}
822
823int CmdThreshold(const char *Cmd)
824{
825 int threshold = atoi(Cmd);
826
827 for (int i = 0; i < GraphTraceLen; ++i) {
828 if (GraphBuffer[i] >= threshold)
829 GraphBuffer[i] = 1;
830 else
7bb9d33e 831 GraphBuffer[i] = -1;
7fe9b0b7 832 }
833 RepaintGraphWindow();
834 return 0;
835}
836
d51b2eda
MHS
837int CmdDirectionalThreshold(const char *Cmd)
838{
839 int8_t upThres = param_get8(Cmd, 0);
840 int8_t downThres = param_get8(Cmd, 1);
841
842 printf("Applying Up Threshold: %d, Down Threshold: %d\n", upThres, downThres);
843
844 int lastValue = GraphBuffer[0];
845 GraphBuffer[0] = 0; // Will be changed at the end, but init 0 as we adjust to last samples value if no threshold kicks in.
846
847 for (int i = 1; i < GraphTraceLen; ++i) {
848 // Apply first threshold to samples heading up
849 if (GraphBuffer[i] >= upThres && GraphBuffer[i] > lastValue)
850 {
851 lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it.
852 GraphBuffer[i] = 1;
853 }
854 // Apply second threshold to samples heading down
855 else if (GraphBuffer[i] <= downThres && GraphBuffer[i] < lastValue)
856 {
857 lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it.
858 GraphBuffer[i] = -1;
859 }
860 else
861 {
862 lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it.
863 GraphBuffer[i] = GraphBuffer[i-1];
864
865 }
866 }
867 GraphBuffer[0] = GraphBuffer[1]; // Aline with first edited sample.
868 RepaintGraphWindow();
869 return 0;
870}
871
7fe9b0b7 872int CmdZerocrossings(const char *Cmd)
873{
874 // Zero-crossings aren't meaningful unless the signal is zero-mean.
875 CmdHpf("");
876
877 int sign = 1;
878 int zc = 0;
879 int lastZc = 0;
880
881 for (int i = 0; i < GraphTraceLen; ++i) {
882 if (GraphBuffer[i] * sign >= 0) {
883 // No change in sign, reproduce the previous sample count.
884 zc++;
885 GraphBuffer[i] = lastZc;
886 } else {
887 // Change in sign, reset the sample count.
888 sign = -sign;
889 GraphBuffer[i] = lastZc;
890 if (sign > 0) {
891 lastZc = zc;
892 zc = 0;
893 }
894 }
895 }
896
897 RepaintGraphWindow();
898 return 0;
899}
900
901static command_t CommandTable[] =
902{
903 {"help", CmdHelp, 1, "This help"},
904 {"amp", CmdAmp, 1, "Amplify peaks"},
c15d2bdc 905 {"askdemod", Cmdaskdemod, 1, "<0|1> -- Attempt to demodulate simple ASK tags"},
7fe9b0b7 906 {"autocorr", CmdAutoCorr, 1, "<window length> -- Autocorrelation over window"},
907 {"bitsamples", CmdBitsamples, 0, "Get raw samples as bitstring"},
908 {"bitstream", CmdBitstream, 1, "[clock rate] -- Convert waveform into a bitstream"},
909 {"buffclear", CmdBuffClear, 1, "Clear sample buffer and graph window"},
910 {"dec", CmdDec, 1, "Decimate samples"},
911 {"detectclock", CmdDetectClockRate, 1, "Detect clock rate"},
912 {"fskdemod", CmdFSKdemod, 1, "Demodulate graph window as a HID FSK"},
913 {"grid", CmdGrid, 1, "<x> <y> -- overlay grid on graph window, use zero value to turn off either"},
90d74dc2 914 {"hexsamples", CmdHexsamples, 0, "<bytes> [<offset>] -- Dump big buffer as hex bytes"},
7fe9b0b7 915 {"hide", CmdHide, 1, "Hide graph window"},
916 {"hpf", CmdHpf, 1, "Remove DC offset from trace"},
7fe9b0b7 917 {"load", CmdLoad, 1, "<filename> -- Load trace (to graph window"},
918 {"ltrim", CmdLtrim, 1, "<samples> -- Trim samples from left of trace"},
919 {"mandemod", CmdManchesterDemod, 1, "[i] [clock rate] -- Manchester demodulate binary stream (option 'i' to invert output)"},
920 {"manmod", CmdManchesterMod, 1, "[clock rate] -- Manchester modulate a binary stream"},
921 {"norm", CmdNorm, 1, "Normalize max/min to +/-500"},
7ddb9900 922 {"plot", CmdPlot, 1, "Show graph window (hit 'h' in window for keystroke help)"},
90d74dc2 923 {"samples", CmdSamples, 0, "[512 - 40000] -- Get raw samples for graph window"},
7fe9b0b7 924 {"save", CmdSave, 1, "<filename> -- Save trace (from graph window)"},
925 {"scale", CmdScale, 1, "<int> -- Set cursor display scale"},
dbf444a1 926 {"threshold", CmdThreshold, 1, "<threshold> -- Maximize/minimize every value in the graph window depending on threshold"},
7fe9b0b7 927 {"zerocrossings", CmdZerocrossings, 1, "Count time between zero-crossings"},
d51b2eda 928 {"dirthreshold", CmdDirectionalThreshold, 1, "<thres up> <thres down> -- Max rising higher up-thres/ Min falling lower down-thres, keep rest as prev."},
7fe9b0b7 929 {NULL, NULL, 0, NULL}
930};
931
932int CmdData(const char *Cmd)
933{
934 CmdsParse(CommandTable, Cmd);
935 return 0;
936}
937
938int CmdHelp(const char *Cmd)
939{
940 CmdsHelp(CommandTable);
941 return 0;
942}
Impressum, Datenschutz