]>
cvs.zerfleddert.de Git - proxmark3-svn/blob - client/cmddata.c
1 //-----------------------------------------------------------------------------
2 // Copyright (C) 2010 iZsh <izsh at fail0verflow.com>
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
7 //-----------------------------------------------------------------------------
8 // Data and Graph commands
9 //-----------------------------------------------------------------------------
15 #include "proxmark3.h"
19 #include "cmdparser.h"
23 static int CmdHelp(const char *Cmd
);
25 int CmdAmp(const char *Cmd
)
27 int i
, rising
, falling
;
28 int max
= INT_MIN
, min
= INT_MAX
;
30 for (i
= 10; i
< GraphTraceLen
; ++i
) {
31 if (GraphBuffer
[i
] > max
)
33 if (GraphBuffer
[i
] < min
)
39 for (i
= 0; i
< GraphTraceLen
; ++i
) {
40 if (GraphBuffer
[i
+ 1] < GraphBuffer
[i
]) {
47 if (GraphBuffer
[i
+ 1] > GraphBuffer
[i
]) {
61 * Generic command to demodulate ASK.
63 * Argument is convention: positive or negative (High mod means zero
64 * or high mod means one)
66 * Updates the Graph trace with 0/1 values
71 int Cmdaskdemod(const char *Cmd
)
74 int c
, high
= 0, low
= 0;
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
);
80 /* Detect high and lows and clock */
82 for (i
= 0; i
< GraphTraceLen
; ++i
)
84 if (GraphBuffer
[i
] > high
)
85 high
= GraphBuffer
[i
];
86 else if (GraphBuffer
[i
] < low
)
89 if (c
!= 0 && c
!= 1) {
90 PrintAndLog("Invalid argument: %s", Cmd
);
94 if (GraphBuffer
[0] > 0) {
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
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
))){
114 GraphBuffer
[i
] = GraphBuffer
[i
- 1];
117 RepaintGraphWindow();
121 int CmdAutoCorr(const char *Cmd
)
123 static int CorrelBuffer
[MAX_GRAPH_TRACE_LEN
];
125 int window
= atoi(Cmd
);
128 PrintAndLog("needs a window");
131 if (window
>= GraphTraceLen
) {
132 PrintAndLog("window must be smaller than trace (%d samples)",
137 PrintAndLog("performing %d correlations", GraphTraceLen
- window
);
139 for (int i
= 0; i
< GraphTraceLen
- window
; ++i
) {
141 for (int j
= 0; j
< window
; ++j
) {
142 sum
+= (GraphBuffer
[j
]*GraphBuffer
[i
+ j
]) / 256;
144 CorrelBuffer
[i
] = sum
;
146 GraphTraceLen
= GraphTraceLen
- window
;
147 memcpy(GraphBuffer
, CorrelBuffer
, GraphTraceLen
* sizeof (int));
149 RepaintGraphWindow();
153 int CmdBitsamples(const char *Cmd
)
158 GetFromBigBuf(got
,sizeof(got
),0);
159 WaitForResponse(CMD_ACK
,NULL
);
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;
166 GraphBuffer
[cnt
++] = 0;
171 RepaintGraphWindow();
176 * Convert to a bitstream
178 int CmdBitstream(const char *Cmd
)
186 int hithigh
, hitlow
, first
;
188 /* Detect high and lows and clock */
189 for (i
= 0; i
< GraphTraceLen
; ++i
)
191 if (GraphBuffer
[i
] > high
)
192 high
= GraphBuffer
[i
];
193 else if (GraphBuffer
[i
] < low
)
194 low
= GraphBuffer
[i
];
198 clock
= GetClock(Cmd
, high
, 1);
202 for (i
= 0; i
< (int)(gtl
/ clock
); ++i
)
207 /* Find out if we hit both high and low peaks */
208 for (j
= 0; j
< clock
; ++j
)
210 if (GraphBuffer
[(i
* clock
) + j
] == high
)
212 else if (GraphBuffer
[(i
* clock
) + j
] == low
)
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;
221 if (hithigh
&& hitlow
)
225 /* If we didn't hit both high and low peaks, we had a bit transition */
226 if (!hithigh
|| !hitlow
)
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;
236 RepaintGraphWindow();
240 int CmdBuffClear(const char *Cmd
)
242 UsbCommand c
= {CMD_BUFF_CLEAR
};
248 int CmdDec(const char *Cmd
)
250 for (int i
= 0; i
< (GraphTraceLen
/ 2); ++i
)
251 GraphBuffer
[i
] = GraphBuffer
[i
* 2];
253 PrintAndLog("decimated by 2");
254 RepaintGraphWindow();
258 /* Print our clock rate */
259 int CmdDetectClockRate(const char *Cmd
)
261 int clock
= DetectClock(0);
262 PrintAndLog("Auto-detected clock rate: %d", clock
);
266 int CmdFSKdemod(const char *Cmd
)
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
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,
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;
290 int minMark
= 0, maxMark
= 0;
292 for (i
= 0; i
< GraphTraceLen
- convLen
; ++i
) {
293 int lowSum
= 0, highSum
= 0;
295 for (j
= 0; j
< lowLen
; ++j
) {
296 lowSum
+= LowTone
[j
]*GraphBuffer
[i
+j
];
298 for (j
= 0; j
< highLen
; ++j
) {
299 highSum
+= HighTone
[j
] * GraphBuffer
[i
+ j
];
301 lowSum
= abs(100 * lowSum
/ lowLen
);
302 highSum
= abs(100 * highSum
/ highLen
);
303 GraphBuffer
[i
] = (highSum
<< 16) | lowSum
;
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);
312 for (j
= 0; j
< 8; j
++) {
313 highTot
+= (GraphBuffer
[i
+ j
] >> 16);
315 GraphBuffer
[i
] = lowTot
- highTot
;
316 if (GraphBuffer
[i
] > maxMark
) maxMark
= GraphBuffer
[i
];
317 if (GraphBuffer
[i
] < minMark
) minMark
= GraphBuffer
[i
];
320 GraphTraceLen
-= (convLen
+ 16);
321 RepaintGraphWindow();
323 // Find bit-sync (3 lo followed by 3 high)
324 int max
= 0, maxPos
= 0;
325 for (i
= 0; i
< 6000; ++i
) {
327 for (j
= 0; j
< 3 * lowLen
; ++j
) {
328 dec
-= GraphBuffer
[i
+ j
];
330 for (; j
< 3 * (lowLen
+ highLen
); ++j
) {
331 dec
+= GraphBuffer
[i
+ j
];
339 // place start of bit sync marker in graph
340 GraphBuffer
[maxPos
] = maxMark
;
341 GraphBuffer
[maxPos
+ 1] = minMark
;
345 // place end of bit sync marker in graph
346 GraphBuffer
[maxPos
] = maxMark
;
347 GraphBuffer
[maxPos
+1] = minMark
;
349 PrintAndLog("actual data bits start at sample %d", maxPos
);
350 PrintAndLog("length %d/%d", highLen
, lowLen
);
353 bits
[sizeof(bits
)-1] = '\0';
355 // find bit pairs and manchester decode them
356 for (i
= 0; i
< arraylen(bits
) - 1; ++i
) {
358 for (j
= 0; j
< lowLen
; ++j
) {
359 dec
-= GraphBuffer
[maxPos
+ j
];
361 for (; j
< lowLen
+ highLen
; ++j
) {
362 dec
+= GraphBuffer
[maxPos
+ j
];
365 // place inter bit marker in graph
366 GraphBuffer
[maxPos
] = maxMark
;
367 GraphBuffer
[maxPos
+ 1] = minMark
;
369 // hi and lo form a 64 bit pair
370 hi
= (hi
<< 1) | (lo
>> 31);
372 // store decoded bit as binary (in hi/lo) and text (in bits[])
380 PrintAndLog("bits: '%s'", bits
);
381 PrintAndLog("hex: %08x %08x", hi
, lo
);
385 int CmdGrid(const char *Cmd
)
387 sscanf(Cmd
, "%i %i", &PlotGridX
, &PlotGridY
);
388 PlotGridXdefault
= PlotGridX
;
389 PlotGridYdefault
= PlotGridY
;
390 RepaintGraphWindow();
394 int CmdHexsamples(const char *Cmd
)
399 sscanf(Cmd
, "%i %i", &requested
, &offset
);
404 /* round up to nearest 8 bytes so the printed data is all valid */
408 if (requested
% 8 != 0) {
409 int remainder
= requested
% 8;
410 requested
= requested
+ 8 - remainder
;
412 if (offset
+ requested
> sizeof(got
)) {
413 PrintAndLog("Tried to read past end of buffer, <bytes> + <offset> > 40000");
419 GetFromBigBuf(got
,n
,offset
);
420 WaitForResponse(CMD_ACK
,NULL
);
422 for (int j
= 0; j
< n
; j
+= 8) {
423 PrintAndLog("%02x %02x %02x %02x %02x %02x %02x %02x",
434 if (delivered
>= requested
)
440 int CmdHide(const char *Cmd
)
446 int CmdHpf(const char *Cmd
)
451 for (i
= 10; i
< GraphTraceLen
; ++i
)
452 accum
+= GraphBuffer
[i
];
453 accum
/= (GraphTraceLen
- 10);
454 for (i
= 0; i
< GraphTraceLen
; ++i
)
455 GraphBuffer
[i
] -= accum
;
457 RepaintGraphWindow();
461 int CmdSamples(const char *Cmd
)
467 n
= strtol(Cmd
, NULL
, 0);
469 if (n
> sizeof(got
)) n
= sizeof(got
);
471 PrintAndLog("Reading %d samples\n", n
);
472 GetFromBigBuf(got
,n
,0);
473 WaitForResponse(CMD_ACK
,NULL
);
474 for (int j
= 0; j
< n
; j
++) {
475 GraphBuffer
[cnt
++] = ((int)got
[j
]) - 128;
478 PrintAndLog("Done!\n");
480 RepaintGraphWindow();
484 int CmdLoad(const char *Cmd
)
486 FILE *f
= fopen(Cmd
, "r");
488 PrintAndLog("couldn't open '%s'", Cmd
);
494 while (fgets(line
, sizeof (line
), f
)) {
495 GraphBuffer
[GraphTraceLen
] = atoi(line
);
499 PrintAndLog("loaded %d samples", GraphTraceLen
);
500 RepaintGraphWindow();
504 int CmdLtrim(const char *Cmd
)
508 for (int i
= ds
; i
< GraphTraceLen
; ++i
)
509 GraphBuffer
[i
-ds
] = GraphBuffer
[i
];
512 RepaintGraphWindow();
517 * Manchester demodulate a bitstream. The bitstream needs to be already in
518 * the GraphBuffer as 0 and 1 values
520 * Give the clock rate as argument in order to help the sync - the algorithm
521 * resyncs at each pulse anyway.
523 * Not optimized by any means, this is the 1st time I'm writing this type of
524 * routine, feel free to improve...
526 * 1st argument: clock rate (as number of samples per clock rate)
527 * Typical values can be 64, 32, 128...
529 int CmdManchesterDemod(const char *Cmd
)
537 int hithigh
, hitlow
, first
;
543 /* check if we're inverting output */
546 PrintAndLog("Inverting output");
551 while(*Cmd
== ' '); // in case a 2nd argument was given
554 /* Holds the decoded bitstream: each clock period contains 2 bits */
555 /* later simplified to 1 bit after manchester decoding. */
556 /* Add 10 bits to allow for noisy / uncertain traces without aborting */
557 /* int BitStream[GraphTraceLen*2/clock+10]; */
559 /* But it does not work if compiling on WIndows: therefore we just allocate a */
561 uint8_t BitStream
[MAX_GRAPH_TRACE_LEN
];
563 /* Detect high and lows */
564 for (i
= 0; i
< GraphTraceLen
; i
++)
566 if (GraphBuffer
[i
] > high
)
567 high
= GraphBuffer
[i
];
568 else if (GraphBuffer
[i
] < low
)
569 low
= GraphBuffer
[i
];
573 clock
= GetClock(Cmd
, high
, 1);
575 int tolerance
= clock
/4;
577 /* Detect first transition */
578 /* Lo-Hi (arbitrary) */
579 /* skip to the first high */
580 for (i
= 0; i
< GraphTraceLen
; i
++)
581 if (GraphBuffer
[i
] == high
)
583 /* now look for the first low */
584 for (; i
< GraphTraceLen
; i
++)
586 if (GraphBuffer
[i
] == low
)
593 /* If we're not working with 1/0s, demod based off clock */
596 bit
= 0; /* We assume the 1st bit is zero, it may not be
597 * the case: this routine (I think) has an init problem.
600 for (; i
< (int)(GraphTraceLen
/ clock
); i
++)
606 /* Find out if we hit both high and low peaks */
607 for (j
= 0; j
< clock
; j
++)
609 if (GraphBuffer
[(i
* clock
) + j
] == high
)
611 else if (GraphBuffer
[(i
* clock
) + j
] == low
)
614 /* it doesn't count if it's the first part of our read
615 because it's really just trailing from the last sequence */
616 if (first
&& (hithigh
|| hitlow
))
617 hithigh
= hitlow
= 0;
621 if (hithigh
&& hitlow
)
625 /* If we didn't hit both high and low peaks, we had a bit transition */
626 if (!hithigh
|| !hitlow
)
629 BitStream
[bit2idx
++] = bit
^ invert
;
633 /* standard 1/0 bitstream */
637 /* Then detect duration between 2 successive transitions */
638 for (bitidx
= 1; i
< GraphTraceLen
; i
++)
640 if (GraphBuffer
[i
-1] != GraphBuffer
[i
])
645 // Error check: if bitidx becomes too large, we do not
646 // have a Manchester encoded bitstream or the clock is really
648 if (bitidx
> (GraphTraceLen
*2/clock
+8) ) {
649 PrintAndLog("Error: the clock you gave is probably wrong, aborting.");
652 // Then switch depending on lc length:
653 // Tolerance is 1/4 of clock rate (arbitrary)
654 if (abs(lc
-clock
/2) < tolerance
) {
655 // Short pulse : either "1" or "0"
656 BitStream
[bitidx
++]=GraphBuffer
[i
-1];
657 } else if (abs(lc
-clock
) < tolerance
) {
658 // Long pulse: either "11" or "00"
659 BitStream
[bitidx
++]=GraphBuffer
[i
-1];
660 BitStream
[bitidx
++]=GraphBuffer
[i
-1];
664 PrintAndLog("Warning: Manchester decode error for pulse width detection.");
665 PrintAndLog("(too many of those messages mean either the stream is not Manchester encoded, or clock is wrong)");
669 PrintAndLog("Error: too many detection errors, aborting.");
676 // At this stage, we now have a bitstream of "01" ("1") or "10" ("0"), parse it into final decoded bitstream
677 // Actually, we overwrite BitStream with the new decoded bitstream, we just need to be careful
678 // to stop output at the final bitidx2 value, not bitidx
679 for (i
= 0; i
< bitidx
; i
+= 2) {
680 if ((BitStream
[i
] == 0) && (BitStream
[i
+1] == 1)) {
681 BitStream
[bit2idx
++] = 1 ^ invert
;
682 } else if ((BitStream
[i
] == 1) && (BitStream
[i
+1] == 0)) {
683 BitStream
[bit2idx
++] = 0 ^ invert
;
685 // We cannot end up in this state, this means we are unsynchronized,
689 PrintAndLog("Unsynchronized, resync...");
690 PrintAndLog("(too many of those messages mean the stream is not Manchester encoded)");
694 PrintAndLog("Error: too many decode errors, aborting.");
701 PrintAndLog("Manchester decoded bitstream");
702 // Now output the bitstream to the scrollback by line of 16 bits
703 for (i
= 0; i
< (bit2idx
-16); i
+=16) {
704 PrintAndLog("%i %i %i %i %i %i %i %i %i %i %i %i %i %i %i %i",
725 /* Modulate our data into manchester */
726 int CmdManchesterMod(const char *Cmd
)
730 int bit
, lastbit
, wave
;
733 clock
= GetClock(Cmd
, 0, 1);
737 for (i
= 0; i
< (int)(GraphTraceLen
/ clock
); i
++)
739 bit
= GraphBuffer
[i
* clock
] ^ 1;
741 for (j
= 0; j
< (int)(clock
/2); j
++)
742 GraphBuffer
[(i
* clock
) + j
] = bit
^ lastbit
^ wave
;
743 for (j
= (int)(clock
/2); j
< clock
; j
++)
744 GraphBuffer
[(i
* clock
) + j
] = bit
^ lastbit
^ wave
^ 1;
746 /* Keep track of how we start our wave and if we changed or not this time */
747 wave
^= bit
^ lastbit
;
751 RepaintGraphWindow();
755 int CmdNorm(const char *Cmd
)
758 int max
= INT_MIN
, min
= INT_MAX
;
760 for (i
= 10; i
< GraphTraceLen
; ++i
) {
761 if (GraphBuffer
[i
] > max
)
762 max
= GraphBuffer
[i
];
763 if (GraphBuffer
[i
] < min
)
764 min
= GraphBuffer
[i
];
768 for (i
= 0; i
< GraphTraceLen
; ++i
) {
769 GraphBuffer
[i
] = (GraphBuffer
[i
] - ((max
+ min
) / 2)) * 1000 /
773 RepaintGraphWindow();
777 int CmdPlot(const char *Cmd
)
783 int CmdSave(const char *Cmd
)
785 FILE *f
= fopen(Cmd
, "w");
787 PrintAndLog("couldn't open '%s'", Cmd
);
791 for (i
= 0; i
< GraphTraceLen
; i
++) {
792 fprintf(f
, "%d\n", GraphBuffer
[i
]);
795 PrintAndLog("saved to '%s'", Cmd
);
799 int CmdScale(const char *Cmd
)
801 CursorScaleFactor
= atoi(Cmd
);
802 if (CursorScaleFactor
== 0) {
803 PrintAndLog("bad, can't have zero scale");
804 CursorScaleFactor
= 1;
806 RepaintGraphWindow();
810 int CmdThreshold(const char *Cmd
)
812 int threshold
= atoi(Cmd
);
814 for (int i
= 0; i
< GraphTraceLen
; ++i
) {
815 if (GraphBuffer
[i
] >= threshold
)
820 RepaintGraphWindow();
824 int CmdZerocrossings(const char *Cmd
)
826 // Zero-crossings aren't meaningful unless the signal is zero-mean.
833 for (int i
= 0; i
< GraphTraceLen
; ++i
) {
834 if (GraphBuffer
[i
] * sign
>= 0) {
835 // No change in sign, reproduce the previous sample count.
837 GraphBuffer
[i
] = lastZc
;
839 // Change in sign, reset the sample count.
841 GraphBuffer
[i
] = lastZc
;
849 RepaintGraphWindow();
853 static command_t CommandTable
[] =
855 {"help", CmdHelp
, 1, "This help"},
856 {"amp", CmdAmp
, 1, "Amplify peaks"},
857 {"askdemod", Cmdaskdemod
, 1, "<0|1> -- Attempt to demodulate simple ASK tags"},
858 {"autocorr", CmdAutoCorr
, 1, "<window length> -- Autocorrelation over window"},
859 {"bitsamples", CmdBitsamples
, 0, "Get raw samples as bitstring"},
860 {"bitstream", CmdBitstream
, 1, "[clock rate] -- Convert waveform into a bitstream"},
861 {"buffclear", CmdBuffClear
, 1, "Clear sample buffer and graph window"},
862 {"dec", CmdDec
, 1, "Decimate samples"},
863 {"detectclock", CmdDetectClockRate
, 1, "Detect clock rate"},
864 {"fskdemod", CmdFSKdemod
, 1, "Demodulate graph window as a HID FSK"},
865 {"grid", CmdGrid
, 1, "<x> <y> -- overlay grid on graph window, use zero value to turn off either"},
866 {"hexsamples", CmdHexsamples
, 0, "<bytes> [<offset>] -- Dump big buffer as hex bytes"},
867 {"hide", CmdHide
, 1, "Hide graph window"},
868 {"hpf", CmdHpf
, 1, "Remove DC offset from trace"},
869 {"load", CmdLoad
, 1, "<filename> -- Load trace (to graph window"},
870 {"ltrim", CmdLtrim
, 1, "<samples> -- Trim samples from left of trace"},
871 {"mandemod", CmdManchesterDemod
, 1, "[i] [clock rate] -- Manchester demodulate binary stream (option 'i' to invert output)"},
872 {"manmod", CmdManchesterMod
, 1, "[clock rate] -- Manchester modulate a binary stream"},
873 {"norm", CmdNorm
, 1, "Normalize max/min to +/-500"},
874 {"plot", CmdPlot
, 1, "Show graph window (hit 'h' in window for keystroke help)"},
875 {"samples", CmdSamples
, 0, "[512 - 40000] -- Get raw samples for graph window"},
876 {"save", CmdSave
, 1, "<filename> -- Save trace (from graph window)"},
877 {"scale", CmdScale
, 1, "<int> -- Set cursor display scale"},
878 {"threshold", CmdThreshold
, 1, "<threshold> -- Maximize/minimize every value in the graph window depending on threshold"},
879 {"zerocrossings", CmdZerocrossings
, 1, "Count time between zero-crossings"},
880 {NULL
, NULL
, 0, NULL
}
883 int CmdData(const char *Cmd
)
885 CmdsParse(CommandTable
, Cmd
);
889 int CmdHelp(const char *Cmd
)
891 CmdsHelp(CommandTable
);