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