]>
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 | uint8_t g_debugMode; | |
26 | int DemodBufferLen; | |
27 | static int CmdHelp(const char *Cmd); | |
28 | ||
29 | //set the demod buffer with given array of binary (one bit per byte) | |
30 | //by marshmellow | |
31 | void setDemodBuf(uint8_t *buff, size_t size, size_t startIdx) | |
32 | { | |
33 | size_t i = 0; | |
34 | for (; i < size; i++){ | |
35 | DemodBuffer[i]=buff[startIdx++]; | |
36 | } | |
37 | DemodBufferLen=size; | |
38 | return; | |
39 | } | |
40 | ||
41 | int CmdSetDebugMode(const char *Cmd) | |
42 | { | |
43 | int demod=0; | |
44 | sscanf(Cmd, "%i", &demod); | |
45 | g_debugMode=(uint8_t)demod; | |
46 | return 1; | |
47 | } | |
48 | ||
49 | //by marshmellow | |
50 | void printDemodBuff() | |
51 | { | |
52 | uint32_t i = 0; | |
53 | int bitLen = DemodBufferLen; | |
54 | if (bitLen<16) { | |
55 | PrintAndLog("no bits found in demod buffer"); | |
56 | return; | |
57 | } | |
58 | if (bitLen>512) bitLen=512; //max output to 512 bits if we have more - should be plenty | |
59 | ||
60 | // equally divided by 16 | |
61 | if ( bitLen % 16 > 0) | |
62 | bitLen = (bitLen/16); | |
63 | ||
64 | for (i = 0; i <= (bitLen-16); i+=16) { | |
65 | PrintAndLog("%i%i%i%i%i%i%i%i%i%i%i%i%i%i%i%i", | |
66 | DemodBuffer[i], | |
67 | DemodBuffer[i+1], | |
68 | DemodBuffer[i+2], | |
69 | DemodBuffer[i+3], | |
70 | DemodBuffer[i+4], | |
71 | DemodBuffer[i+5], | |
72 | DemodBuffer[i+6], | |
73 | DemodBuffer[i+7], | |
74 | DemodBuffer[i+8], | |
75 | DemodBuffer[i+9], | |
76 | DemodBuffer[i+10], | |
77 | DemodBuffer[i+11], | |
78 | DemodBuffer[i+12], | |
79 | DemodBuffer[i+13], | |
80 | DemodBuffer[i+14], | |
81 | DemodBuffer[i+15]); | |
82 | } | |
83 | return; | |
84 | } | |
85 | ||
86 | ||
87 | int CmdAmp(const char *Cmd) | |
88 | { | |
89 | int i, rising, falling; | |
90 | int max = INT_MIN, min = INT_MAX; | |
91 | ||
92 | for (i = 10; i < GraphTraceLen; ++i) { | |
93 | if (GraphBuffer[i] > max) | |
94 | max = GraphBuffer[i]; | |
95 | if (GraphBuffer[i] < min) | |
96 | min = GraphBuffer[i]; | |
97 | } | |
98 | ||
99 | if (max != min) { | |
100 | rising = falling= 0; | |
101 | for (i = 0; i < GraphTraceLen; ++i) { | |
102 | if (GraphBuffer[i + 1] < GraphBuffer[i]) { | |
103 | if (rising) { | |
104 | GraphBuffer[i] = max; | |
105 | rising = 0; | |
106 | } | |
107 | falling = 1; | |
108 | } | |
109 | if (GraphBuffer[i + 1] > GraphBuffer[i]) { | |
110 | if (falling) { | |
111 | GraphBuffer[i] = min; | |
112 | falling = 0; | |
113 | } | |
114 | rising= 1; | |
115 | } | |
116 | } | |
117 | } | |
118 | RepaintGraphWindow(); | |
119 | return 0; | |
120 | } | |
121 | ||
122 | /* | |
123 | * Generic command to demodulate ASK. | |
124 | * | |
125 | * Argument is convention: positive or negative (High mod means zero | |
126 | * or high mod means one) | |
127 | * | |
128 | * Updates the Graph trace with 0/1 values | |
129 | * | |
130 | * Arguments: | |
131 | * c : 0 or 1 | |
132 | */ | |
133 | //this method is dependant on all highs and lows to be the same(or clipped) this creates issues[marshmellow] it also ignores the clock | |
134 | int Cmdaskdemod(const char *Cmd) | |
135 | { | |
136 | int i; | |
137 | int c, high = 0, low = 0; | |
138 | ||
139 | // TODO: complain if we do not give 2 arguments here ! | |
140 | // (AL - this doesn't make sense! we're only using one argument!!!) | |
141 | sscanf(Cmd, "%i", &c); | |
142 | ||
143 | /* Detect high and lows and clock */ | |
144 | // (AL - clock???) | |
145 | for (i = 0; i < GraphTraceLen; ++i) | |
146 | { | |
147 | if (GraphBuffer[i] > high) | |
148 | high = GraphBuffer[i]; | |
149 | else if (GraphBuffer[i] < low) | |
150 | low = GraphBuffer[i]; | |
151 | } | |
152 | high=abs(high*.75); | |
153 | low=abs(low*.75); | |
154 | if (c != 0 && c != 1) { | |
155 | PrintAndLog("Invalid argument: %s", Cmd); | |
156 | return 0; | |
157 | } | |
158 | //prime loop | |
159 | if (GraphBuffer[0] > 0) { | |
160 | GraphBuffer[0] = 1-c; | |
161 | } else { | |
162 | GraphBuffer[0] = c; | |
163 | } | |
164 | for (i = 1; i < GraphTraceLen; ++i) { | |
165 | /* Transitions are detected at each peak | |
166 | * Transitions are either: | |
167 | * - we're low: transition if we hit a high | |
168 | * - we're high: transition if we hit a low | |
169 | * (we need to do it this way because some tags keep high or | |
170 | * low for long periods, others just reach the peak and go | |
171 | * down) | |
172 | */ | |
173 | //[marhsmellow] change == to >= for high and <= for low for fuzz | |
174 | if ((GraphBuffer[i] == high) && (GraphBuffer[i - 1] == c)) { | |
175 | GraphBuffer[i] = 1 - c; | |
176 | } else if ((GraphBuffer[i] == low) && (GraphBuffer[i - 1] == (1 - c))){ | |
177 | GraphBuffer[i] = c; | |
178 | } else { | |
179 | /* No transition */ | |
180 | GraphBuffer[i] = GraphBuffer[i - 1]; | |
181 | } | |
182 | } | |
183 | RepaintGraphWindow(); | |
184 | return 0; | |
185 | } | |
186 | ||
187 | //by marshmellow | |
188 | void printBitStream(uint8_t BitStream[], uint32_t bitLen) | |
189 | { | |
190 | uint32_t i = 0; | |
191 | if (bitLen<16) { | |
192 | PrintAndLog("Too few bits found: %d",bitLen); | |
193 | return; | |
194 | } | |
195 | if (bitLen>512) bitLen=512; | |
196 | for (i = 0; i <= (bitLen-16); i+=16) { | |
197 | PrintAndLog("%i%i%i%i%i%i%i%i%i%i%i%i%i%i%i%i", | |
198 | BitStream[i], | |
199 | BitStream[i+1], | |
200 | BitStream[i+2], | |
201 | BitStream[i+3], | |
202 | BitStream[i+4], | |
203 | BitStream[i+5], | |
204 | BitStream[i+6], | |
205 | BitStream[i+7], | |
206 | BitStream[i+8], | |
207 | BitStream[i+9], | |
208 | BitStream[i+10], | |
209 | BitStream[i+11], | |
210 | BitStream[i+12], | |
211 | BitStream[i+13], | |
212 | BitStream[i+14], | |
213 | BitStream[i+15]); | |
214 | } | |
215 | return; | |
216 | } | |
217 | //by marshmellow | |
218 | //print EM410x ID in multiple formats | |
219 | void printEM410x(uint64_t id) | |
220 | { | |
221 | if (id !=0){ | |
222 | uint64_t iii=1; | |
223 | uint64_t id2lo=0; | |
224 | uint32_t ii=0; | |
225 | uint32_t i=0; | |
226 | for (ii=5; ii>0;ii--){ | |
227 | for (i=0;i<8;i++){ | |
228 | id2lo=(id2lo<<1LL) | ((id & (iii << (i+((ii-1)*8)))) >> (i+((ii-1)*8))); | |
229 | } | |
230 | } | |
231 | //output em id | |
232 | PrintAndLog("EM TAG ID : %010llx", id); | |
233 | PrintAndLog("Unique TAG ID: %010llx", id2lo); | |
234 | PrintAndLog("DEZ 8 : %08lld",id & 0xFFFFFF); | |
235 | PrintAndLog("DEZ 10 : %010lld",id & 0xFFFFFF); | |
236 | PrintAndLog("DEZ 5.5 : %05lld.%05lld",(id>>16LL) & 0xFFFF,(id & 0xFFFF)); | |
237 | PrintAndLog("DEZ 3.5A : %03lld.%05lld",(id>>32ll),(id & 0xFFFF)); | |
238 | PrintAndLog("DEZ 14/IK2 : %014lld",id); | |
239 | PrintAndLog("DEZ 15/IK3 : %015lld",id2lo); | |
240 | PrintAndLog("Other : %05lld_%03lld_%08lld",(id&0xFFFF),((id>>16LL) & 0xFF),(id & 0xFFFFFF)); | |
241 | } | |
242 | return; | |
243 | } | |
244 | ||
245 | //by marshmellow | |
246 | //take binary from demod buffer and see if we can find an EM410x ID | |
247 | int CmdEm410xDecode(const char *Cmd) | |
248 | { | |
249 | uint64_t id=0; | |
250 | size_t size = DemodBufferLen, idx=0; | |
251 | id = Em410xDecode(DemodBuffer, &size, &idx); | |
252 | if (id>0){ | |
253 | setDemodBuf(DemodBuffer, size, idx); | |
254 | if (g_debugMode){ | |
255 | PrintAndLog("DEBUG: Printing demod buffer:"); | |
256 | printDemodBuff(); | |
257 | } | |
258 | printEM410x(id); | |
259 | return 1; | |
260 | } | |
261 | return 0; | |
262 | } | |
263 | ||
264 | ||
265 | //by marshmellow | |
266 | //takes 2 arguments - clock and invert both as integers | |
267 | //attempts to demodulate ask while decoding manchester | |
268 | //prints binary found and saves in graphbuffer for further commands | |
269 | int Cmdaskmandemod(const char *Cmd) | |
270 | { | |
271 | int invert=0; | |
272 | int clk=0; | |
273 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0}; | |
274 | sscanf(Cmd, "%i %i", &clk, &invert); | |
275 | if (invert != 0 && invert != 1) { | |
276 | PrintAndLog("Invalid argument: %s", Cmd); | |
277 | return 0; | |
278 | } | |
279 | ||
280 | size_t BitLen = getFromGraphBuf(BitStream); | |
281 | if (g_debugMode==1) PrintAndLog("DEBUG: Bitlen from grphbuff: %d",BitLen); | |
282 | int errCnt=0; | |
283 | errCnt = askmandemod(BitStream, &BitLen,&clk,&invert); | |
284 | if (errCnt<0||BitLen<16){ //if fatal error (or -1) | |
285 | if (g_debugMode==1) PrintAndLog("no data found %d, errors:%d, bitlen:%d, clock:%d",errCnt,invert,BitLen,clk); | |
286 | return 0; | |
287 | } | |
288 | PrintAndLog("\nUsing Clock: %d - Invert: %d - Bits Found: %d",clk,invert,BitLen); | |
289 | ||
290 | //output | |
291 | if (errCnt>0){ | |
292 | PrintAndLog("# Errors during Demoding (shown as 77 in bit stream): %d",errCnt); | |
293 | } | |
294 | PrintAndLog("ASK/Manchester decoded bitstream:"); | |
295 | // Now output the bitstream to the scrollback by line of 16 bits | |
296 | setDemodBuf(BitStream,BitLen,0); | |
297 | printDemodBuff(); | |
298 | uint64_t lo =0; | |
299 | size_t idx=0; | |
300 | lo = Em410xDecode(BitStream, &BitLen, &idx); | |
301 | if (lo>0){ | |
302 | //set GraphBuffer for clone or sim command | |
303 | setDemodBuf(BitStream, BitLen, idx); | |
304 | if (g_debugMode){ | |
305 | PrintAndLog("DEBUG: idx: %d, Len: %d, Printing Demod Buffer:", idx, BitLen); | |
306 | printDemodBuff(); | |
307 | } | |
308 | PrintAndLog("EM410x pattern found: "); | |
309 | printEM410x(lo); | |
310 | return 1; | |
311 | } | |
312 | return 0; | |
313 | } | |
314 | ||
315 | //by marshmellow | |
316 | //manchester decode | |
317 | //stricktly take 10 and 01 and convert to 0 and 1 | |
318 | int Cmdmandecoderaw(const char *Cmd) | |
319 | { | |
320 | int i =0; | |
321 | int errCnt=0; | |
322 | size_t size=0; | |
323 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0}; | |
324 | int high=0,low=0; | |
325 | for (;i<DemodBufferLen;++i){ | |
326 | if (DemodBuffer[i]>high) high=DemodBuffer[i]; | |
327 | else if(DemodBuffer[i]<low) low=DemodBuffer[i]; | |
328 | BitStream[i]=DemodBuffer[i]; | |
329 | } | |
330 | if (high>1 || low <0 ){ | |
331 | PrintAndLog("Error: please raw demod the wave first then mancheseter raw decode"); | |
332 | return 0; | |
333 | } | |
334 | size=i; | |
335 | errCnt=manrawdecode(BitStream, &size); | |
336 | if (errCnt>=20){ | |
337 | PrintAndLog("Too many errors: %d",errCnt); | |
338 | return 0; | |
339 | } | |
340 | PrintAndLog("Manchester Decoded - # errors:%d - data:",errCnt); | |
341 | printBitStream(BitStream, size); | |
342 | if (errCnt==0){ | |
343 | uint64_t id = 0; | |
344 | size_t idx=0; | |
345 | id = Em410xDecode(BitStream, &size, &idx); | |
346 | if (id>0){ | |
347 | //need to adjust to set bitstream back to manchester encoded data | |
348 | //setDemodBuf(BitStream, size, idx); | |
349 | ||
350 | printEM410x(id); | |
351 | } | |
352 | } | |
353 | return 1; | |
354 | } | |
355 | ||
356 | //by marshmellow | |
357 | //biphase decode | |
358 | //take 01 or 10 = 0 and 11 or 00 = 1 | |
359 | //takes 2 arguments "offset" default = 0 if 1 it will shift the decode by one bit | |
360 | // and "invert" default = 0 if 1 it will invert output | |
361 | // since it is not like manchester and doesn't have an incorrect bit pattern we | |
362 | // cannot determine if our decode is correct or if it should be shifted by one bit | |
363 | // the argument offset allows us to manually shift if the output is incorrect | |
364 | // (better would be to demod and decode at the same time so we can distinguish large | |
365 | // width waves vs small width waves to help the decode positioning) or askbiphdemod | |
366 | int CmdBiphaseDecodeRaw(const char *Cmd) | |
367 | { | |
368 | int i = 0; | |
369 | int errCnt=0; | |
370 | size_t size=0; | |
371 | int offset=0; | |
372 | int invert=0; | |
373 | int high=0, low=0; | |
374 | sscanf(Cmd, "%i %i", &offset, &invert); | |
375 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0}; | |
376 | //get graphbuffer & high and low | |
377 | for (;i<DemodBufferLen;++i){ | |
378 | if(DemodBuffer[i]>high)high=DemodBuffer[i]; | |
379 | else if(DemodBuffer[i]<low)low=DemodBuffer[i]; | |
380 | BitStream[i]=DemodBuffer[i]; | |
381 | } | |
382 | if (high>1 || low <0){ | |
383 | PrintAndLog("Error: please raw demod the wave first then decode"); | |
384 | return 0; | |
385 | } | |
386 | size=i; | |
387 | errCnt=BiphaseRawDecode(BitStream, &size, offset, invert); | |
388 | if (errCnt>=20){ | |
389 | PrintAndLog("Too many errors attempting to decode: %d",errCnt); | |
390 | return 0; | |
391 | } | |
392 | PrintAndLog("Biphase Decoded using offset: %d - # errors:%d - data:",offset,errCnt); | |
393 | printBitStream(BitStream, size); | |
394 | PrintAndLog("\nif bitstream does not look right try offset=1"); | |
395 | return 1; | |
396 | } | |
397 | ||
398 | //by marshmellow | |
399 | //takes 2 arguments - clock and invert both as integers | |
400 | //attempts to demodulate ask only | |
401 | //prints binary found and saves in graphbuffer for further commands | |
402 | int Cmdaskrawdemod(const char *Cmd) | |
403 | { | |
404 | int invert=0; | |
405 | int clk=0; | |
406 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0}; | |
407 | sscanf(Cmd, "%i %i", &clk, &invert); | |
408 | if (invert != 0 && invert != 1) { | |
409 | PrintAndLog("Invalid argument: %s", Cmd); | |
410 | return 0; | |
411 | } | |
412 | size_t BitLen = getFromGraphBuf(BitStream); | |
413 | int errCnt=0; | |
414 | errCnt = askrawdemod(BitStream, &BitLen,&clk,&invert); | |
415 | if (errCnt==-1||BitLen<16){ //throw away static - allow 1 and -1 (in case of threshold command first) | |
416 | PrintAndLog("no data found"); | |
417 | if (g_debugMode==1) PrintAndLog("errCnt: %d, BitLen: %d, clk: %d, invert: %d", errCnt, BitLen, clk, invert); | |
418 | return 0; | |
419 | } | |
420 | PrintAndLog("Using Clock: %d - invert: %d - Bits Found: %d",clk,invert,BitLen); | |
421 | ||
422 | //move BitStream back to DemodBuffer | |
423 | setDemodBuf(BitStream,BitLen,0); | |
424 | ||
425 | //output | |
426 | if (errCnt>0){ | |
427 | PrintAndLog("# Errors during Demoding (shown as 77 in bit stream): %d",errCnt); | |
428 | } | |
429 | PrintAndLog("ASK demoded bitstream:"); | |
430 | // Now output the bitstream to the scrollback by line of 16 bits | |
431 | printBitStream(BitStream,BitLen); | |
432 | ||
433 | return 1; | |
434 | } | |
435 | ||
436 | int CmdAutoCorr(const char *Cmd) | |
437 | { | |
438 | static int CorrelBuffer[MAX_GRAPH_TRACE_LEN]; | |
439 | ||
440 | int window = atoi(Cmd); | |
441 | ||
442 | if (window == 0) { | |
443 | PrintAndLog("needs a window"); | |
444 | return 0; | |
445 | } | |
446 | if (window >= GraphTraceLen) { | |
447 | PrintAndLog("window must be smaller than trace (%d samples)", | |
448 | GraphTraceLen); | |
449 | return 0; | |
450 | } | |
451 | ||
452 | PrintAndLog("performing %d correlations", GraphTraceLen - window); | |
453 | ||
454 | for (int i = 0; i < GraphTraceLen - window; ++i) { | |
455 | int sum = 0; | |
456 | for (int j = 0; j < window; ++j) { | |
457 | sum += (GraphBuffer[j]*GraphBuffer[i + j]) / 256; | |
458 | } | |
459 | CorrelBuffer[i] = sum; | |
460 | } | |
461 | GraphTraceLen = GraphTraceLen - window; | |
462 | memcpy(GraphBuffer, CorrelBuffer, GraphTraceLen * sizeof (int)); | |
463 | ||
464 | RepaintGraphWindow(); | |
465 | return 0; | |
466 | } | |
467 | ||
468 | int CmdBitsamples(const char *Cmd) | |
469 | { | |
470 | int cnt = 0; | |
471 | uint8_t got[12288]; | |
472 | ||
473 | GetFromBigBuf(got,sizeof(got),0); | |
474 | WaitForResponse(CMD_ACK,NULL); | |
475 | ||
476 | for (int j = 0; j < sizeof(got); j++) { | |
477 | for (int k = 0; k < 8; k++) { | |
478 | if(got[j] & (1 << (7 - k))) { | |
479 | GraphBuffer[cnt++] = 1; | |
480 | } else { | |
481 | GraphBuffer[cnt++] = 0; | |
482 | } | |
483 | } | |
484 | } | |
485 | GraphTraceLen = cnt; | |
486 | RepaintGraphWindow(); | |
487 | return 0; | |
488 | } | |
489 | ||
490 | /* | |
491 | * Convert to a bitstream | |
492 | */ | |
493 | int CmdBitstream(const char *Cmd) | |
494 | { | |
495 | int i, j; | |
496 | int bit; | |
497 | int gtl; | |
498 | int clock; | |
499 | int low = 0; | |
500 | int high = 0; | |
501 | int hithigh, hitlow, first; | |
502 | ||
503 | /* Detect high and lows and clock */ | |
504 | for (i = 0; i < GraphTraceLen; ++i) | |
505 | { | |
506 | if (GraphBuffer[i] > high) | |
507 | high = GraphBuffer[i]; | |
508 | else if (GraphBuffer[i] < low) | |
509 | low = GraphBuffer[i]; | |
510 | } | |
511 | ||
512 | /* Get our clock */ | |
513 | clock = GetClock(Cmd, high, 1); | |
514 | gtl = ClearGraph(0); | |
515 | ||
516 | bit = 0; | |
517 | for (i = 0; i < (int)(gtl / clock); ++i) | |
518 | { | |
519 | hithigh = 0; | |
520 | hitlow = 0; | |
521 | first = 1; | |
522 | /* Find out if we hit both high and low peaks */ | |
523 | for (j = 0; j < clock; ++j) | |
524 | { | |
525 | if (GraphBuffer[(i * clock) + j] == high) | |
526 | hithigh = 1; | |
527 | else if (GraphBuffer[(i * clock) + j] == low) | |
528 | hitlow = 1; | |
529 | /* it doesn't count if it's the first part of our read | |
530 | because it's really just trailing from the last sequence */ | |
531 | if (first && (hithigh || hitlow)) | |
532 | hithigh = hitlow = 0; | |
533 | else | |
534 | first = 0; | |
535 | ||
536 | if (hithigh && hitlow) | |
537 | break; | |
538 | } | |
539 | ||
540 | /* If we didn't hit both high and low peaks, we had a bit transition */ | |
541 | if (!hithigh || !hitlow) | |
542 | bit ^= 1; | |
543 | ||
544 | AppendGraph(0, clock, bit); | |
545 | } | |
546 | ||
547 | RepaintGraphWindow(); | |
548 | return 0; | |
549 | } | |
550 | ||
551 | int CmdBuffClear(const char *Cmd) | |
552 | { | |
553 | UsbCommand c = {CMD_BUFF_CLEAR}; | |
554 | SendCommand(&c); | |
555 | ClearGraph(true); | |
556 | return 0; | |
557 | } | |
558 | ||
559 | int CmdDec(const char *Cmd) | |
560 | { | |
561 | for (int i = 0; i < (GraphTraceLen / 2); ++i) | |
562 | GraphBuffer[i] = GraphBuffer[i * 2]; | |
563 | GraphTraceLen /= 2; | |
564 | PrintAndLog("decimated by 2"); | |
565 | RepaintGraphWindow(); | |
566 | return 0; | |
567 | } | |
568 | ||
569 | //by marshmellow | |
570 | //shift graph zero up or down based on input + or - | |
571 | int CmdGraphShiftZero(const char *Cmd) | |
572 | { | |
573 | ||
574 | int shift=0; | |
575 | //set options from parameters entered with the command | |
576 | sscanf(Cmd, "%i", &shift); | |
577 | int shiftedVal=0; | |
578 | for(int i = 0; i<GraphTraceLen; i++){ | |
579 | shiftedVal=GraphBuffer[i]+shift; | |
580 | if (shiftedVal>127) | |
581 | shiftedVal=127; | |
582 | else if (shiftedVal<-127) | |
583 | shiftedVal=-127; | |
584 | GraphBuffer[i]= shiftedVal; | |
585 | } | |
586 | CmdNorm(""); | |
587 | return 0; | |
588 | } | |
589 | ||
590 | /* Print our clock rate */ | |
591 | // uses data from graphbuffer | |
592 | int CmdDetectClockRate(const char *Cmd) | |
593 | { | |
594 | GetClock("",0,0); | |
595 | //int clock = DetectASKClock(0); | |
596 | //PrintAndLog("Auto-detected clock rate: %d", clock); | |
597 | return 0; | |
598 | } | |
599 | ||
600 | //by marshmellow | |
601 | //fsk raw demod and print binary | |
602 | //takes 4 arguments - Clock, invert, rchigh, rclow | |
603 | //defaults: clock = 50, invert=0, rchigh=10, rclow=8 (RF/10 RF/8 (fsk2a)) | |
604 | int CmdFSKrawdemod(const char *Cmd) | |
605 | { | |
606 | //raw fsk demod no manchester decoding no start bit finding just get binary from wave | |
607 | //set defaults | |
608 | int rfLen = 0; | |
609 | int invert=0; | |
610 | int fchigh=0; | |
611 | int fclow=0; | |
612 | //set options from parameters entered with the command | |
613 | sscanf(Cmd, "%i %i %i %i", &rfLen, &invert, &fchigh, &fclow); | |
614 | ||
615 | if (strlen(Cmd)>0 && strlen(Cmd)<=2) { | |
616 | if (rfLen==1){ | |
617 | invert=1; //if invert option only is used | |
618 | rfLen = 0; | |
619 | } | |
620 | } | |
621 | ||
622 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0}; | |
623 | size_t BitLen = getFromGraphBuf(BitStream); | |
624 | //get field clock lengths | |
625 | uint16_t fcs=0; | |
626 | if (fchigh==0 || fclow == 0){ | |
627 | fcs=countFC(BitStream, BitLen); | |
628 | if (fcs==0){ | |
629 | fchigh=10; | |
630 | fclow=8; | |
631 | }else{ | |
632 | fchigh = (fcs >> 8) & 0xFF; | |
633 | fclow = fcs & 0xFF; | |
634 | } | |
635 | } | |
636 | //get bit clock length | |
637 | if (rfLen==0){ | |
638 | rfLen = detectFSKClk(BitStream, BitLen, fchigh, fclow); | |
639 | if (rfLen == 0) rfLen = 50; | |
640 | } | |
641 | PrintAndLog("Args invert: %d - Clock:%d - fchigh:%d - fclow: %d",invert,rfLen,fchigh, fclow); | |
642 | int size = fskdemod(BitStream,BitLen,(uint8_t)rfLen,(uint8_t)invert,(uint8_t)fchigh,(uint8_t)fclow); | |
643 | if (size>0){ | |
644 | PrintAndLog("FSK decoded bitstream:"); | |
645 | setDemodBuf(BitStream,size,0); | |
646 | ||
647 | // Now output the bitstream to the scrollback by line of 16 bits | |
648 | 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 | |
649 | printBitStream(BitStream,size); | |
650 | } else{ | |
651 | PrintAndLog("no FSK data found"); | |
652 | } | |
653 | return 0; | |
654 | } | |
655 | ||
656 | //by marshmellow (based on existing demod + holiman's refactor) | |
657 | //HID Prox demod - FSK RF/50 with preamble of 00011101 (then manchester encoded) | |
658 | //print full HID Prox ID and some bit format details if found | |
659 | int CmdFSKdemodHID(const char *Cmd) | |
660 | { | |
661 | //raw fsk demod no manchester decoding no start bit finding just get binary from wave | |
662 | uint32_t hi2=0, hi=0, lo=0; | |
663 | ||
664 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0}; | |
665 | size_t BitLen = getFromGraphBuf(BitStream); | |
666 | //get binary from fsk wave | |
667 | int idx = HIDdemodFSK(BitStream,&BitLen,&hi2,&hi,&lo); | |
668 | if (idx<0){ | |
669 | if (g_debugMode){ | |
670 | if (idx==-1){ | |
671 | PrintAndLog("DEBUG: Just Noise Detected"); | |
672 | } else if (idx == -2) { | |
673 | PrintAndLog("DEBUG: Error demoding fsk"); | |
674 | } else if (idx == -3) { | |
675 | PrintAndLog("DEBUG: Preamble not found"); | |
676 | } else if (idx == -4) { | |
677 | PrintAndLog("DEBUG: Error in Manchester data, SIZE: %d", BitLen); | |
678 | } else { | |
679 | PrintAndLog("DEBUG: Error demoding fsk %d", idx); | |
680 | } | |
681 | } | |
682 | return 0; | |
683 | } | |
684 | if (hi2==0 && hi==0 && lo==0) { | |
685 | if (g_debugMode) PrintAndLog("DEBUG: Error - no values found"); | |
686 | return 0; | |
687 | } | |
688 | if (hi2 != 0){ //extra large HID tags | |
689 | PrintAndLog("HID Prox TAG ID: %x%08x%08x (%d)", | |
690 | (unsigned int) hi2, (unsigned int) hi, (unsigned int) lo, (unsigned int) (lo>>1) & 0xFFFF); | |
691 | } | |
692 | else { //standard HID tags <38 bits | |
693 | uint8_t fmtLen = 0; | |
694 | uint32_t fc = 0; | |
695 | uint32_t cardnum = 0; | |
696 | if (((hi>>5)&1)==1){//if bit 38 is set then < 37 bit format is used | |
697 | uint32_t lo2=0; | |
698 | lo2=(((hi & 31) << 12) | (lo>>20)); //get bits 21-37 to check for format len bit | |
699 | uint8_t idx3 = 1; | |
700 | while(lo2>1){ //find last bit set to 1 (format len bit) | |
701 | lo2=lo2>>1; | |
702 | idx3++; | |
703 | } | |
704 | fmtLen =idx3+19; | |
705 | fc =0; | |
706 | cardnum=0; | |
707 | if(fmtLen==26){ | |
708 | cardnum = (lo>>1)&0xFFFF; | |
709 | fc = (lo>>17)&0xFF; | |
710 | } | |
711 | if(fmtLen==34){ | |
712 | cardnum = (lo>>1)&0xFFFF; | |
713 | fc= ((hi&1)<<15)|(lo>>17); | |
714 | } | |
715 | if(fmtLen==35){ | |
716 | cardnum = (lo>>1)&0xFFFFF; | |
717 | fc = ((hi&1)<<11)|(lo>>21); | |
718 | } | |
719 | } | |
720 | else { //if bit 38 is not set then 37 bit format is used | |
721 | fmtLen = 37; | |
722 | fc = 0; | |
723 | cardnum = 0; | |
724 | if(fmtLen == 37){ | |
725 | cardnum = (lo>>1)&0x7FFFF; | |
726 | fc = ((hi&0xF)<<12)|(lo>>20); | |
727 | } | |
728 | } | |
729 | PrintAndLog("HID Prox TAG ID: %x%08x (%d) - Format Len: %dbit - FC: %d - Card: %d", | |
730 | (unsigned int) hi, (unsigned int) lo, (unsigned int) (lo>>1) & 0xFFFF, | |
731 | (unsigned int) fmtLen, (unsigned int) fc, (unsigned int) cardnum); | |
732 | } | |
733 | setDemodBuf(BitStream,BitLen,idx); | |
734 | if (g_debugMode){ | |
735 | PrintAndLog("DEBUG: idx: %d, Len: %d, Printing Demod Buffer:", idx, BitLen); | |
736 | printDemodBuff(); | |
737 | } | |
738 | return 1; | |
739 | } | |
740 | ||
741 | //by marshmellow | |
742 | //Paradox Prox demod - FSK RF/50 with preamble of 00001111 (then manchester encoded) | |
743 | //print full Paradox Prox ID and some bit format details if found | |
744 | int CmdFSKdemodParadox(const char *Cmd) | |
745 | { | |
746 | //raw fsk demod no manchester decoding no start bit finding just get binary from wave | |
747 | uint32_t hi2=0, hi=0, lo=0; | |
748 | ||
749 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0}; | |
750 | size_t BitLen = getFromGraphBuf(BitStream); | |
751 | //get binary from fsk wave | |
752 | int idx = ParadoxdemodFSK(BitStream,&BitLen,&hi2,&hi,&lo); | |
753 | if (idx<0){ | |
754 | if (g_debugMode){ | |
755 | if (idx==-1){ | |
756 | PrintAndLog("DEBUG: Just Noise Detected"); | |
757 | } else if (idx == -2) { | |
758 | PrintAndLog("DEBUG: Error demoding fsk"); | |
759 | } else if (idx == -3) { | |
760 | PrintAndLog("DEBUG: Preamble not found"); | |
761 | } else if (idx == -4) { | |
762 | PrintAndLog("DEBUG: Error in Manchester data"); | |
763 | } else { | |
764 | PrintAndLog("DEBUG: Error demoding fsk %d", idx); | |
765 | } | |
766 | } | |
767 | return 0; | |
768 | } | |
769 | if (hi2==0 && hi==0 && lo==0){ | |
770 | if (g_debugMode) PrintAndLog("DEBUG: Error - no value found"); | |
771 | return 0; | |
772 | } | |
773 | uint32_t fc = ((hi & 0x3)<<6) | (lo>>26); | |
774 | uint32_t cardnum = (lo>>10)&0xFFFF; | |
775 | ||
776 | PrintAndLog("Paradox TAG ID: %x%08x - FC: %d - Card: %d - Checksum: %02x", | |
777 | hi>>10, (hi & 0x3)<<26 | (lo>>10), fc, cardnum, (lo>>2) & 0xFF ); | |
778 | setDemodBuf(BitStream,BitLen,idx); | |
779 | if (g_debugMode){ | |
780 | PrintAndLog("DEBUG: idx: %d, len: %d, Printing Demod Buffer:", idx, BitLen); | |
781 | printDemodBuff(); | |
782 | } | |
783 | return 1; | |
784 | } | |
785 | ||
786 | ||
787 | //by marshmellow | |
788 | //IO-Prox demod - FSK RF/64 with preamble of 000000001 | |
789 | //print ioprox ID and some format details | |
790 | int CmdFSKdemodIO(const char *Cmd) | |
791 | { | |
792 | //raw fsk demod no manchester decoding no start bit finding just get binary from wave | |
793 | //set defaults | |
794 | int idx=0; | |
795 | //something in graphbuffer? | |
796 | if (GraphTraceLen < 65) { | |
797 | if (g_debugMode)PrintAndLog("DEBUG: not enough samples in GraphBuffer"); | |
798 | return 0; | |
799 | } | |
800 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0}; | |
801 | size_t BitLen = getFromGraphBuf(BitStream); | |
802 | ||
803 | //get binary from fsk wave | |
804 | idx = IOdemodFSK(BitStream,BitLen); | |
805 | if (idx<0){ | |
806 | if (g_debugMode){ | |
807 | if (idx==-1){ | |
808 | PrintAndLog("DEBUG: Just Noise Detected"); | |
809 | } else if (idx == -2) { | |
810 | PrintAndLog("DEBUG: not enough samples"); | |
811 | } else if (idx == -3) { | |
812 | PrintAndLog("DEBUG: error during fskdemod"); | |
813 | } else if (idx == -4) { | |
814 | PrintAndLog("DEBUG: Preamble not found"); | |
815 | } else if (idx == -5) { | |
816 | PrintAndLog("DEBUG: Separator bits not found"); | |
817 | } else { | |
818 | PrintAndLog("DEBUG: Error demoding fsk %d", idx); | |
819 | } | |
820 | } | |
821 | return 0; | |
822 | } | |
823 | if (idx==0){ | |
824 | if (g_debugMode==1){ | |
825 | PrintAndLog("DEBUG: IO Prox Data not found - FSK Bits: %d",BitLen); | |
826 | if (BitLen > 92) printBitStream(BitStream,92); | |
827 | } | |
828 | return 0; | |
829 | } | |
830 | //Index map | |
831 | //0 10 20 30 40 50 60 | |
832 | //| | | | | | | | |
833 | //01234567 8 90123456 7 89012345 6 78901234 5 67890123 4 56789012 3 45678901 23 | |
834 | //----------------------------------------------------------------------------- | |
835 | //00000000 0 11110000 1 facility 1 version* 1 code*one 1 code*two 1 ???????? 11 | |
836 | // | |
837 | //XSF(version)facility:codeone+codetwo (raw) | |
838 | //Handle the data | |
839 | if (idx+64>BitLen) { | |
840 | if (g_debugMode==1) PrintAndLog("not enough bits found - bitlen: %d",BitLen); | |
841 | return 0; | |
842 | } | |
843 | 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]); | |
844 | 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]); | |
845 | 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]); | |
846 | 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]); | |
847 | 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]); | |
848 | 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]); | |
849 | 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]); | |
850 | ||
851 | uint32_t code = bytebits_to_byte(BitStream+idx,32); | |
852 | uint32_t code2 = bytebits_to_byte(BitStream+idx+32,32); | |
853 | uint8_t version = bytebits_to_byte(BitStream+idx+27,8); //14,4 | |
854 | uint8_t facilitycode = bytebits_to_byte(BitStream+idx+18,8) ; | |
855 | uint16_t number = (bytebits_to_byte(BitStream+idx+36,8)<<8)|(bytebits_to_byte(BitStream+idx+45,8)); //36,9 | |
856 | PrintAndLog("IO Prox XSF(%02d)%02x:%05d (%08x%08x)",version,facilitycode,number,code,code2); | |
857 | setDemodBuf(BitStream,64,idx); | |
858 | if (g_debugMode){ | |
859 | PrintAndLog("DEBUG: idx: %d, Len: %d, Printing demod buffer:",idx,64); | |
860 | printDemodBuff(); | |
861 | } | |
862 | return 1; | |
863 | } | |
864 | ||
865 | ||
866 | //by marshmellow | |
867 | //AWID Prox demod - FSK RF/50 with preamble of 00000001 (always a 96 bit data stream) | |
868 | //print full AWID Prox ID and some bit format details if found | |
869 | int CmdFSKdemodAWID(const char *Cmd) | |
870 | { | |
871 | ||
872 | //int verbose=1; | |
873 | //sscanf(Cmd, "%i", &verbose); | |
874 | ||
875 | //raw fsk demod no manchester decoding no start bit finding just get binary from wave | |
876 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0}; | |
877 | size_t size = getFromGraphBuf(BitStream); | |
878 | ||
879 | //get binary from fsk wave | |
880 | int idx = AWIDdemodFSK(BitStream, &size); | |
881 | if (idx<=0){ | |
882 | if (g_debugMode==1){ | |
883 | if (idx == -1) | |
884 | PrintAndLog("DEBUG: Error - not enough samples"); | |
885 | else if (idx == -2) | |
886 | PrintAndLog("DEBUG: Error - only noise found"); | |
887 | else if (idx == -3) | |
888 | PrintAndLog("DEBUG: Error - problem during FSK demod"); | |
889 | // else if (idx == -3) | |
890 | // PrintAndLog("Error: thought we had a tag but the parity failed"); | |
891 | else if (idx == -4) | |
892 | PrintAndLog("DEBUG: Error - AWID preamble not found"); | |
893 | else if (idx == -5) | |
894 | PrintAndLog("DEBUG: Error - Size not correct: %d", size); | |
895 | else | |
896 | PrintAndLog("DEBUG: Error %d",idx); | |
897 | } | |
898 | return 0; | |
899 | } | |
900 | ||
901 | // Index map | |
902 | // 0 10 20 30 40 50 60 | |
903 | // | | | | | | | | |
904 | // 01234567 890 1 234 5 678 9 012 3 456 7 890 1 234 5 678 9 012 3 456 7 890 1 234 5 678 9 012 3 - to 96 | |
905 | // ----------------------------------------------------------------------------- | |
906 | // 00000001 000 1 110 1 101 1 011 1 101 1 010 0 000 1 000 1 010 0 001 0 110 1 100 0 000 1 000 1 | |
907 | // premable bbb o bbb o bbw o fff o fff o ffc o ccc o ccc o ccc o ccc o ccc o wxx o xxx o xxx o - to 96 | |
908 | // |---26 bit---| |-----117----||-------------142-------------| | |
909 | // b = format bit len, o = odd parity of last 3 bits | |
910 | // f = facility code, c = card number | |
911 | // w = wiegand parity | |
912 | // (26 bit format shown) | |
913 | ||
914 | //get raw ID before removing parities | |
915 | uint32_t rawLo = bytebits_to_byte(BitStream+idx+64,32); | |
916 | uint32_t rawHi = bytebits_to_byte(BitStream+idx+32,32); | |
917 | uint32_t rawHi2 = bytebits_to_byte(BitStream+idx,32); | |
918 | setDemodBuf(BitStream,96,idx); | |
919 | ||
920 | size = removeParity(BitStream, idx+8, 4, 1, 88); | |
921 | if (size != 66){ | |
922 | if (g_debugMode==1) PrintAndLog("DEBUG: Error - at parity check-tag size does not match AWID format"); | |
923 | return 0; | |
924 | } | |
925 | // ok valid card found! | |
926 | ||
927 | // Index map | |
928 | // 0 10 20 30 40 50 60 | |
929 | // | | | | | | | | |
930 | // 01234567 8 90123456 7890123456789012 3 456789012345678901234567890123456 | |
931 | // ----------------------------------------------------------------------------- | |
932 | // 00011010 1 01110101 0000000010001110 1 000000000000000000000000000000000 | |
933 | // bbbbbbbb w ffffffff cccccccccccccccc w xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx | |
934 | // |26 bit| |-117--| |-----142------| | |
935 | // b = format bit len, o = odd parity of last 3 bits | |
936 | // f = facility code, c = card number | |
937 | // w = wiegand parity | |
938 | // (26 bit format shown) | |
939 | ||
940 | uint32_t fc = 0; | |
941 | uint32_t cardnum = 0; | |
942 | uint32_t code1 = 0; | |
943 | uint32_t code2 = 0; | |
944 | uint8_t fmtLen = bytebits_to_byte(BitStream,8); | |
945 | if (fmtLen==26){ | |
946 | fc = bytebits_to_byte(BitStream+9, 8); | |
947 | cardnum = bytebits_to_byte(BitStream+17, 16); | |
948 | code1 = bytebits_to_byte(BitStream+8,fmtLen); | |
949 | PrintAndLog("AWID Found - BitLength: %d, FC: %d, Card: %d - Wiegand: %x, Raw: %x%08x%08x", fmtLen, fc, cardnum, code1, rawHi2, rawHi, rawLo); | |
950 | } else { | |
951 | cardnum = bytebits_to_byte(BitStream+8+(fmtLen-17), 16); | |
952 | if (fmtLen>32){ | |
953 | code1 = bytebits_to_byte(BitStream+8,fmtLen-32); | |
954 | code2 = bytebits_to_byte(BitStream+8+(fmtLen-32),32); | |
955 | PrintAndLog("AWID Found - BitLength: %d -unknown BitLength- (%d) - Wiegand: %x%08x, Raw: %x%08x%08x", fmtLen, cardnum, code1, code2, rawHi2, rawHi, rawLo); | |
956 | } else{ | |
957 | code1 = bytebits_to_byte(BitStream+8,fmtLen); | |
958 | PrintAndLog("AWID Found - BitLength: %d -unknown BitLength- (%d) - Wiegand: %x, Raw: %x%08x%08x", fmtLen, cardnum, code1, rawHi2, rawHi, rawLo); | |
959 | } | |
960 | } | |
961 | if (g_debugMode){ | |
962 | PrintAndLog("DEBUG: idx: %d, Len: %d Printing Demod Buffer:", idx, 96); | |
963 | printDemodBuff(); | |
964 | } | |
965 | //todo - convert hi2, hi, lo to demodbuffer for future sim/clone commands | |
966 | return 1; | |
967 | } | |
968 | ||
969 | //by marshmellow | |
970 | //Pyramid Prox demod - FSK RF/50 with preamble of 0000000000000001 (always a 128 bit data stream) | |
971 | //print full Farpointe Data/Pyramid Prox ID and some bit format details if found | |
972 | int CmdFSKdemodPyramid(const char *Cmd) | |
973 | { | |
974 | //raw fsk demod no manchester decoding no start bit finding just get binary from wave | |
975 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0}; | |
976 | size_t size = getFromGraphBuf(BitStream); | |
977 | ||
978 | //get binary from fsk wave | |
979 | int idx = PyramiddemodFSK(BitStream, &size); | |
980 | if (idx < 0){ | |
981 | if (g_debugMode==1){ | |
982 | if (idx == -5) | |
983 | PrintAndLog("DEBUG: Error - not enough samples"); | |
984 | else if (idx == -1) | |
985 | PrintAndLog("DEBUG: Error - only noise found"); | |
986 | else if (idx == -2) | |
987 | PrintAndLog("DEBUG: Error - problem during FSK demod"); | |
988 | else if (idx == -3) | |
989 | PrintAndLog("DEBUG: Error - Size not correct: %d", size); | |
990 | else if (idx == -4) | |
991 | PrintAndLog("DEBUG: Error - Pyramid preamble not found"); | |
992 | else | |
993 | PrintAndLog("DEBUG: Error - idx: %d",idx); | |
994 | } | |
995 | return 0; | |
996 | } | |
997 | // Index map | |
998 | // 0 10 20 30 40 50 60 | |
999 | // | | | | | | | | |
1000 | // 0123456 7 8901234 5 6789012 3 4567890 1 2345678 9 0123456 7 8901234 5 6789012 3 | |
1001 | // ----------------------------------------------------------------------------- | |
1002 | // 0000000 0 0000000 1 0000000 1 0000000 1 0000000 1 0000000 1 0000000 1 0000000 1 | |
1003 | // premable xxxxxxx o xxxxxxx o xxxxxxx o xxxxxxx o xxxxxxx o xxxxxxx o xxxxxxx o | |
1004 | ||
1005 | // 64 70 80 90 100 110 120 | |
1006 | // | | | | | | | | |
1007 | // 4567890 1 2345678 9 0123456 7 8901234 5 6789012 3 4567890 1 2345678 9 0123456 7 | |
1008 | // ----------------------------------------------------------------------------- | |
1009 | // 0000000 1 0000000 1 0000000 1 0110111 0 0011000 1 0000001 0 0001100 1 1001010 0 | |
1010 | // xxxxxxx o xxxxxxx o xxxxxxx o xswffff o ffffccc o ccccccc o ccccccw o ppppppp o | |
1011 | // |---115---||---------71---------| | |
1012 | // s = format start bit, o = odd parity of last 7 bits | |
1013 | // f = facility code, c = card number | |
1014 | // w = wiegand parity, x = extra space for other formats | |
1015 | // p = unknown checksum | |
1016 | // (26 bit format shown) | |
1017 | ||
1018 | //get raw ID before removing parities | |
1019 | uint32_t rawLo = bytebits_to_byte(BitStream+idx+96,32); | |
1020 | uint32_t rawHi = bytebits_to_byte(BitStream+idx+64,32); | |
1021 | uint32_t rawHi2 = bytebits_to_byte(BitStream+idx+32,32); | |
1022 | uint32_t rawHi3 = bytebits_to_byte(BitStream+idx,32); | |
1023 | setDemodBuf(BitStream,128,idx); | |
1024 | ||
1025 | size = removeParity(BitStream, idx+8, 8, 1, 120); | |
1026 | if (size != 105){ | |
1027 | if (g_debugMode==1) PrintAndLog("DEBUG: Error at parity check-tag size does not match Pyramid format, SIZE: %d, IDX: %d, hi3: %x",size, idx, rawHi3); | |
1028 | return 0; | |
1029 | } | |
1030 | ||
1031 | // ok valid card found! | |
1032 | ||
1033 | // Index map | |
1034 | // 0 10 20 30 40 50 60 70 | |
1035 | // | | | | | | | | | |
1036 | // 01234567890123456789012345678901234567890123456789012345678901234567890 | |
1037 | // ----------------------------------------------------------------------- | |
1038 | // 00000000000000000000000000000000000000000000000000000000000000000000000 | |
1039 | // xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx | |
1040 | ||
1041 | // 71 80 90 100 | |
1042 | // | | | | | |
1043 | // 1 2 34567890 1234567890123456 7 8901234 | |
1044 | // --------------------------------------- | |
1045 | // 1 1 01110011 0000000001000110 0 1001010 | |
1046 | // s w ffffffff cccccccccccccccc w ppppppp | |
1047 | // |--115-| |------71------| | |
1048 | // s = format start bit, o = odd parity of last 7 bits | |
1049 | // f = facility code, c = card number | |
1050 | // w = wiegand parity, x = extra space for other formats | |
1051 | // p = unknown checksum | |
1052 | // (26 bit format shown) | |
1053 | ||
1054 | //find start bit to get fmtLen | |
1055 | int j; | |
1056 | for (j=0; j<size; j++){ | |
1057 | if(BitStream[j]) break; | |
1058 | } | |
1059 | uint8_t fmtLen = size-j-8; | |
1060 | uint32_t fc = 0; | |
1061 | uint32_t cardnum = 0; | |
1062 | uint32_t code1 = 0; | |
1063 | //uint32_t code2 = 0; | |
1064 | if (fmtLen==26){ | |
1065 | fc = bytebits_to_byte(BitStream+73, 8); | |
1066 | cardnum = bytebits_to_byte(BitStream+81, 16); | |
1067 | code1 = bytebits_to_byte(BitStream+72,fmtLen); | |
1068 | PrintAndLog("Pyramid ID Found - BitLength: %d, FC: %d, Card: %d - Wiegand: %x, Raw: %x%08x%08x%08x", fmtLen, fc, cardnum, code1, rawHi3, rawHi2, rawHi, rawLo); | |
1069 | } else if (fmtLen==45){ | |
1070 | fmtLen=42; //end = 10 bits not 7 like 26 bit fmt | |
1071 | fc = bytebits_to_byte(BitStream+53, 10); | |
1072 | cardnum = bytebits_to_byte(BitStream+63, 32); | |
1073 | PrintAndLog("Pyramid ID Found - BitLength: %d, FC: %d, Card: %d - Raw: %x%08x%08x%08x", fmtLen, fc, cardnum, rawHi3, rawHi2, rawHi, rawLo); | |
1074 | } else { | |
1075 | cardnum = bytebits_to_byte(BitStream+81, 16); | |
1076 | if (fmtLen>32){ | |
1077 | //code1 = bytebits_to_byte(BitStream+(size-fmtLen),fmtLen-32); | |
1078 | //code2 = bytebits_to_byte(BitStream+(size-32),32); | |
1079 | PrintAndLog("Pyramid ID Found - BitLength: %d -unknown BitLength- (%d), Raw: %x%08x%08x%08x", fmtLen, cardnum, rawHi3, rawHi2, rawHi, rawLo); | |
1080 | } else{ | |
1081 | //code1 = bytebits_to_byte(BitStream+(size-fmtLen),fmtLen); | |
1082 | PrintAndLog("Pyramid ID Found - BitLength: %d -unknown BitLength- (%d), Raw: %x%08x%08x%08x", fmtLen, cardnum, rawHi3, rawHi2, rawHi, rawLo); | |
1083 | } | |
1084 | } | |
1085 | if (g_debugMode){ | |
1086 | PrintAndLog("DEBUG: idx: %d, Len: %d, Printing Demod Buffer:", idx, 128); | |
1087 | printDemodBuff(); | |
1088 | } | |
1089 | return 1; | |
1090 | } | |
1091 | ||
1092 | int CmdFSKdemod(const char *Cmd) //old CmdFSKdemod needs updating | |
1093 | { | |
1094 | static const int LowTone[] = { | |
1095 | 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, | |
1096 | 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, | |
1097 | 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, | |
1098 | 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, | |
1099 | 1, 1, 1, 1, 1, -1, -1, -1, -1, -1 | |
1100 | }; | |
1101 | static const int HighTone[] = { | |
1102 | 1, 1, 1, 1, 1, -1, -1, -1, -1, | |
1103 | 1, 1, 1, 1, -1, -1, -1, -1, | |
1104 | 1, 1, 1, 1, -1, -1, -1, -1, | |
1105 | 1, 1, 1, 1, -1, -1, -1, -1, | |
1106 | 1, 1, 1, 1, -1, -1, -1, -1, | |
1107 | 1, 1, 1, 1, -1, -1, -1, -1, -1, | |
1108 | }; | |
1109 | ||
1110 | int lowLen = sizeof (LowTone) / sizeof (int); | |
1111 | int highLen = sizeof (HighTone) / sizeof (int); | |
1112 | int convLen = (highLen > lowLen) ? highLen : lowLen; | |
1113 | uint32_t hi = 0, lo = 0; | |
1114 | ||
1115 | int i, j; | |
1116 | int minMark = 0, maxMark = 0; | |
1117 | ||
1118 | for (i = 0; i < GraphTraceLen - convLen; ++i) { | |
1119 | int lowSum = 0, highSum = 0; | |
1120 | ||
1121 | for (j = 0; j < lowLen; ++j) { | |
1122 | lowSum += LowTone[j]*GraphBuffer[i+j]; | |
1123 | } | |
1124 | for (j = 0; j < highLen; ++j) { | |
1125 | highSum += HighTone[j] * GraphBuffer[i + j]; | |
1126 | } | |
1127 | lowSum = abs(100 * lowSum / lowLen); | |
1128 | highSum = abs(100 * highSum / highLen); | |
1129 | GraphBuffer[i] = (highSum << 16) | lowSum; | |
1130 | } | |
1131 | ||
1132 | for(i = 0; i < GraphTraceLen - convLen - 16; ++i) { | |
1133 | int lowTot = 0, highTot = 0; | |
1134 | // 10 and 8 are f_s divided by f_l and f_h, rounded | |
1135 | for (j = 0; j < 10; ++j) { | |
1136 | lowTot += (GraphBuffer[i+j] & 0xffff); | |
1137 | } | |
1138 | for (j = 0; j < 8; j++) { | |
1139 | highTot += (GraphBuffer[i + j] >> 16); | |
1140 | } | |
1141 | GraphBuffer[i] = lowTot - highTot; | |
1142 | if (GraphBuffer[i] > maxMark) maxMark = GraphBuffer[i]; | |
1143 | if (GraphBuffer[i] < minMark) minMark = GraphBuffer[i]; | |
1144 | } | |
1145 | ||
1146 | GraphTraceLen -= (convLen + 16); | |
1147 | RepaintGraphWindow(); | |
1148 | ||
1149 | // Find bit-sync (3 lo followed by 3 high) (HID ONLY) | |
1150 | int max = 0, maxPos = 0; | |
1151 | for (i = 0; i < 6000; ++i) { | |
1152 | int dec = 0; | |
1153 | for (j = 0; j < 3 * lowLen; ++j) { | |
1154 | dec -= GraphBuffer[i + j]; | |
1155 | } | |
1156 | for (; j < 3 * (lowLen + highLen ); ++j) { | |
1157 | dec += GraphBuffer[i + j]; | |
1158 | } | |
1159 | if (dec > max) { | |
1160 | max = dec; | |
1161 | maxPos = i; | |
1162 | } | |
1163 | } | |
1164 | ||
1165 | // place start of bit sync marker in graph | |
1166 | GraphBuffer[maxPos] = maxMark; | |
1167 | GraphBuffer[maxPos + 1] = minMark; | |
1168 | ||
1169 | maxPos += j; | |
1170 | ||
1171 | // place end of bit sync marker in graph | |
1172 | GraphBuffer[maxPos] = maxMark; | |
1173 | GraphBuffer[maxPos+1] = minMark; | |
1174 | ||
1175 | PrintAndLog("actual data bits start at sample %d", maxPos); | |
1176 | PrintAndLog("length %d/%d", highLen, lowLen); | |
1177 | ||
1178 | uint8_t bits[46] = {0x00}; | |
1179 | ||
1180 | // find bit pairs and manchester decode them | |
1181 | for (i = 0; i < arraylen(bits) - 1; ++i) { | |
1182 | int dec = 0; | |
1183 | for (j = 0; j < lowLen; ++j) { | |
1184 | dec -= GraphBuffer[maxPos + j]; | |
1185 | } | |
1186 | for (; j < lowLen + highLen; ++j) { | |
1187 | dec += GraphBuffer[maxPos + j]; | |
1188 | } | |
1189 | maxPos += j; | |
1190 | // place inter bit marker in graph | |
1191 | GraphBuffer[maxPos] = maxMark; | |
1192 | GraphBuffer[maxPos + 1] = minMark; | |
1193 | ||
1194 | // hi and lo form a 64 bit pair | |
1195 | hi = (hi << 1) | (lo >> 31); | |
1196 | lo = (lo << 1); | |
1197 | // store decoded bit as binary (in hi/lo) and text (in bits[]) | |
1198 | if(dec < 0) { | |
1199 | bits[i] = '1'; | |
1200 | lo |= 1; | |
1201 | } else { | |
1202 | bits[i] = '0'; | |
1203 | } | |
1204 | } | |
1205 | PrintAndLog("bits: '%s'", bits); | |
1206 | PrintAndLog("hex: %08x %08x", hi, lo); | |
1207 | return 0; | |
1208 | } | |
1209 | ||
1210 | //by marshmellow | |
1211 | //attempt to detect the field clock and bit clock for FSK | |
1212 | int CmdFSKfcDetect(const char *Cmd) | |
1213 | { | |
1214 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0}; | |
1215 | size_t size = getFromGraphBuf(BitStream); | |
1216 | ||
1217 | uint16_t ans = countFC(BitStream, size); | |
1218 | if (ans==0) { | |
1219 | if (g_debugMode) PrintAndLog("DEBUG: No data found"); | |
1220 | return 0; | |
1221 | } | |
1222 | uint8_t fc1, fc2; | |
1223 | fc1 = (ans >> 8) & 0xFF; | |
1224 | fc2 = ans & 0xFF; | |
1225 | ||
1226 | uint8_t rf1 = detectFSKClk(BitStream, size, fc1, fc2); | |
1227 | if (rf1==0) { | |
1228 | if (g_debugMode) PrintAndLog("DEBUG: Clock detect error"); | |
1229 | return 0; | |
1230 | } | |
1231 | PrintAndLog("Detected Field Clocks: FC/%d, FC/%d - Bit Clock: RF/%d", fc1, fc2, rf1); | |
1232 | return 1; | |
1233 | } | |
1234 | ||
1235 | //by marshmellow | |
1236 | //attempt to detect the bit clock for PSK or NRZ modulations | |
1237 | int CmdDetectNRZpskClockRate(const char *Cmd) | |
1238 | { | |
1239 | GetNRZpskClock("",0,0); | |
1240 | return 0; | |
1241 | } | |
1242 | ||
1243 | //by marshmellow | |
1244 | //attempt to psk1 or nrz demod graph buffer | |
1245 | //NOTE CURRENTLY RELIES ON PEAKS :( | |
1246 | int PSKnrzDemod(const char *Cmd, uint8_t verbose) | |
1247 | { | |
1248 | int invert=0; | |
1249 | int clk=0; | |
1250 | sscanf(Cmd, "%i %i", &clk, &invert); | |
1251 | if (invert != 0 && invert != 1) { | |
1252 | PrintAndLog("Invalid argument: %s", Cmd); | |
1253 | return -1; | |
1254 | } | |
1255 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0}; | |
1256 | size_t BitLen = getFromGraphBuf(BitStream); | |
1257 | int errCnt=0; | |
1258 | errCnt = pskNRZrawDemod(BitStream, &BitLen,&clk,&invert); | |
1259 | if (errCnt<0|| BitLen<16){ //throw away static - allow 1 and -1 (in case of threshold command first) | |
1260 | if (g_debugMode==1) PrintAndLog("no data found, clk: %d, invert: %d, numbits: %d, errCnt: %d",clk,invert,BitLen,errCnt); | |
1261 | return -1; | |
1262 | } | |
1263 | if (verbose) PrintAndLog("Tried PSK/NRZ Demod using Clock: %d - invert: %d - Bits Found: %d",clk,invert,BitLen); | |
1264 | ||
1265 | //prime demod buffer for output | |
1266 | setDemodBuf(BitStream,BitLen,0); | |
1267 | return errCnt; | |
1268 | } | |
1269 | // Indala 26 bit decode | |
1270 | // by marshmellow | |
1271 | // optional arguments - same as CmdpskNRZrawDemod (clock & invert) | |
1272 | int CmdIndalaDecode(const char *Cmd) | |
1273 | { | |
1274 | int ans; | |
1275 | if (strlen(Cmd)>0){ | |
1276 | ans = PSKnrzDemod(Cmd, 0); | |
1277 | } else{ //default to RF/32 | |
1278 | ans = PSKnrzDemod("32", 0); | |
1279 | } | |
1280 | ||
1281 | if (ans < 0){ | |
1282 | if (g_debugMode==1) | |
1283 | PrintAndLog("Error1: %d",ans); | |
1284 | return 0; | |
1285 | } | |
1286 | uint8_t invert=0; | |
1287 | ans = indala26decode(DemodBuffer,(size_t *) &DemodBufferLen, &invert); | |
1288 | if (ans < 1) { | |
1289 | if (g_debugMode==1) | |
1290 | PrintAndLog("Error2: %d",ans); | |
1291 | return -1; | |
1292 | } | |
1293 | char showbits[251]={0x00}; | |
1294 | if (invert) | |
1295 | if (g_debugMode==1) | |
1296 | PrintAndLog("Had to invert bits"); | |
1297 | ||
1298 | //convert UID to HEX | |
1299 | uint32_t uid1, uid2, uid3, uid4, uid5, uid6, uid7; | |
1300 | int idx; | |
1301 | uid1=0; | |
1302 | uid2=0; | |
1303 | PrintAndLog("BitLen: %d",DemodBufferLen); | |
1304 | if (DemodBufferLen==64){ | |
1305 | for( idx=0; idx<64; idx++) { | |
1306 | uid1=(uid1<<1)|(uid2>>31); | |
1307 | if (DemodBuffer[idx] == 0) { | |
1308 | uid2=(uid2<<1)|0; | |
1309 | showbits[idx]='0'; | |
1310 | } else { | |
1311 | uid2=(uid2<<1)|1; | |
1312 | showbits[idx]='1'; | |
1313 | } | |
1314 | } | |
1315 | showbits[idx]='\0'; | |
1316 | PrintAndLog("Indala UID=%s (%x%08x)", showbits, uid1, uid2); | |
1317 | } | |
1318 | else { | |
1319 | uid3=0; | |
1320 | uid4=0; | |
1321 | uid5=0; | |
1322 | uid6=0; | |
1323 | uid7=0; | |
1324 | for( idx=0; idx<DemodBufferLen; idx++) { | |
1325 | uid1=(uid1<<1)|(uid2>>31); | |
1326 | uid2=(uid2<<1)|(uid3>>31); | |
1327 | uid3=(uid3<<1)|(uid4>>31); | |
1328 | uid4=(uid4<<1)|(uid5>>31); | |
1329 | uid5=(uid5<<1)|(uid6>>31); | |
1330 | uid6=(uid6<<1)|(uid7>>31); | |
1331 | if (DemodBuffer[idx] == 0) { | |
1332 | uid7=(uid7<<1)|0; | |
1333 | showbits[idx]='0'; | |
1334 | } | |
1335 | else { | |
1336 | uid7=(uid7<<1)|1; | |
1337 | showbits[idx]='1'; | |
1338 | } | |
1339 | } | |
1340 | showbits[idx]='\0'; | |
1341 | PrintAndLog("Indala UID=%s (%x%08x%08x%08x%08x%08x%08x)", showbits, uid1, uid2, uid3, uid4, uid5, uid6, uid7); | |
1342 | } | |
1343 | if (g_debugMode){ | |
1344 | PrintAndLog("DEBUG: printing demodbuffer:"); | |
1345 | printDemodBuff(); | |
1346 | } | |
1347 | return 1; | |
1348 | } | |
1349 | ||
1350 | //by marshmellow | |
1351 | //attempt to clean psk wave noise after a peak | |
1352 | //NOTE RELIES ON PEAKS :( | |
1353 | int CmdPskClean(const char *Cmd) | |
1354 | { | |
1355 | uint8_t bitStream[MAX_GRAPH_TRACE_LEN]={0}; | |
1356 | size_t bitLen = getFromGraphBuf(bitStream); | |
1357 | pskCleanWave(bitStream, bitLen); | |
1358 | setGraphBuf(bitStream, bitLen); | |
1359 | return 0; | |
1360 | } | |
1361 | ||
1362 | // by marshmellow | |
1363 | // takes 2 arguments - clock and invert both as integers | |
1364 | // attempts to demodulate psk only | |
1365 | // prints binary found and saves in demodbuffer for further commands | |
1366 | int CmdpskNRZrawDemod(const char *Cmd) | |
1367 | { | |
1368 | int errCnt; | |
1369 | ||
1370 | errCnt = PSKnrzDemod(Cmd, 1); | |
1371 | //output | |
1372 | if (errCnt<0){ | |
1373 | if (g_debugMode) PrintAndLog("Error demoding: %d",errCnt); | |
1374 | return 0; | |
1375 | } | |
1376 | if (errCnt>0){ | |
1377 | if (g_debugMode){ | |
1378 | PrintAndLog("# Errors during Demoding (shown as 77 in bit stream): %d",errCnt); | |
1379 | PrintAndLog("PSK or NRZ demoded bitstream:"); | |
1380 | // Now output the bitstream to the scrollback by line of 16 bits | |
1381 | printDemodBuff(); | |
1382 | } | |
1383 | }else{ | |
1384 | PrintAndLog("PSK or NRZ demoded bitstream:"); | |
1385 | // Now output the bitstream to the scrollback by line of 16 bits | |
1386 | printDemodBuff(); | |
1387 | return 1; | |
1388 | } | |
1389 | return 0; | |
1390 | } | |
1391 | ||
1392 | // by marshmellow | |
1393 | // takes same args as cmdpsknrzrawdemod | |
1394 | int CmdPSK2rawDemod(const char *Cmd) | |
1395 | { | |
1396 | int errCnt=0; | |
1397 | errCnt=PSKnrzDemod(Cmd, 1); | |
1398 | if (errCnt<0){ | |
1399 | if (g_debugMode) PrintAndLog("Error demoding: %d",errCnt); | |
1400 | return 0; | |
1401 | } | |
1402 | psk1TOpsk2(DemodBuffer, DemodBufferLen); | |
1403 | if (errCnt>0){ | |
1404 | if (g_debugMode){ | |
1405 | PrintAndLog("# Errors during Demoding (shown as 77 in bit stream): %d",errCnt); | |
1406 | PrintAndLog("PSK2 demoded bitstream:"); | |
1407 | // Now output the bitstream to the scrollback by line of 16 bits | |
1408 | printDemodBuff(); | |
1409 | } | |
1410 | }else{ | |
1411 | PrintAndLog("PSK2 demoded bitstream:"); | |
1412 | // Now output the bitstream to the scrollback by line of 16 bits | |
1413 | printDemodBuff(); | |
1414 | } | |
1415 | return 1; | |
1416 | } | |
1417 | ||
1418 | int CmdGrid(const char *Cmd) | |
1419 | { | |
1420 | sscanf(Cmd, "%i %i", &PlotGridX, &PlotGridY); | |
1421 | PlotGridXdefault= PlotGridX; | |
1422 | PlotGridYdefault= PlotGridY; | |
1423 | RepaintGraphWindow(); | |
1424 | return 0; | |
1425 | } | |
1426 | ||
1427 | int CmdHexsamples(const char *Cmd) | |
1428 | { | |
1429 | int i, j; | |
1430 | int requested = 0; | |
1431 | int offset = 0; | |
1432 | char string_buf[25]; | |
1433 | char* string_ptr = string_buf; | |
1434 | uint8_t got[BIGBUF_SIZE]; | |
1435 | ||
1436 | sscanf(Cmd, "%i %i", &requested, &offset); | |
1437 | ||
1438 | /* if no args send something */ | |
1439 | if (requested == 0) { | |
1440 | requested = 8; | |
1441 | } | |
1442 | if (offset + requested > sizeof(got)) { | |
1443 | PrintAndLog("Tried to read past end of buffer, <bytes> + <offset> > %d", BIGBUF_SIZE); | |
1444 | return 0; | |
1445 | } | |
1446 | ||
1447 | GetFromBigBuf(got,requested,offset); | |
1448 | WaitForResponse(CMD_ACK,NULL); | |
1449 | ||
1450 | i = 0; | |
1451 | for (j = 0; j < requested; j++) { | |
1452 | i++; | |
1453 | string_ptr += sprintf(string_ptr, "%02x ", got[j]); | |
1454 | if (i == 8) { | |
1455 | *(string_ptr - 1) = '\0'; // remove the trailing space | |
1456 | PrintAndLog("%s", string_buf); | |
1457 | string_buf[0] = '\0'; | |
1458 | string_ptr = string_buf; | |
1459 | i = 0; | |
1460 | } | |
1461 | if (j == requested - 1 && string_buf[0] != '\0') { // print any remaining bytes | |
1462 | *(string_ptr - 1) = '\0'; | |
1463 | PrintAndLog("%s", string_buf); | |
1464 | string_buf[0] = '\0'; | |
1465 | } | |
1466 | } | |
1467 | return 0; | |
1468 | } | |
1469 | ||
1470 | int CmdHide(const char *Cmd) | |
1471 | { | |
1472 | HideGraphWindow(); | |
1473 | return 0; | |
1474 | } | |
1475 | ||
1476 | int CmdHpf(const char *Cmd) | |
1477 | { | |
1478 | int i; | |
1479 | int accum = 0; | |
1480 | ||
1481 | for (i = 10; i < GraphTraceLen; ++i) | |
1482 | accum += GraphBuffer[i]; | |
1483 | accum /= (GraphTraceLen - 10); | |
1484 | for (i = 0; i < GraphTraceLen; ++i) | |
1485 | GraphBuffer[i] -= accum; | |
1486 | ||
1487 | RepaintGraphWindow(); | |
1488 | return 0; | |
1489 | } | |
1490 | ||
1491 | int CmdSamples(const char *Cmd) | |
1492 | { | |
1493 | uint8_t got[BIGBUF_SIZE] = {0x00}; | |
1494 | ||
1495 | int n = strtol(Cmd, NULL, 0); | |
1496 | if (n == 0) | |
1497 | n = 20000; | |
1498 | ||
1499 | if (n > sizeof(got)) | |
1500 | n = sizeof(got); | |
1501 | ||
1502 | PrintAndLog("Reading %d samples from device memory\n", n); | |
1503 | GetFromBigBuf(got,n,0); | |
1504 | WaitForResponse(CMD_ACK,NULL); | |
1505 | for (int j = 0; j < n; j++) { | |
1506 | GraphBuffer[j] = ((int)got[j]) - 128; | |
1507 | } | |
1508 | GraphTraceLen = n; | |
1509 | RepaintGraphWindow(); | |
1510 | return 0; | |
1511 | } | |
1512 | ||
1513 | int CmdTuneSamples(const char *Cmd) | |
1514 | { | |
1515 | int timeout = 0; | |
1516 | printf("\nMeasuring antenna characteristics, please wait..."); | |
1517 | ||
1518 | UsbCommand c = {CMD_MEASURE_ANTENNA_TUNING}; | |
1519 | SendCommand(&c); | |
1520 | ||
1521 | UsbCommand resp; | |
1522 | while(!WaitForResponseTimeout(CMD_MEASURED_ANTENNA_TUNING,&resp,1000)) { | |
1523 | timeout++; | |
1524 | printf("."); | |
1525 | if (timeout > 7) { | |
1526 | PrintAndLog("\nNo response from Proxmark. Aborting..."); | |
1527 | return 1; | |
1528 | } | |
1529 | } | |
1530 | ||
1531 | int peakv, peakf; | |
1532 | int vLf125, vLf134, vHf; | |
1533 | vLf125 = resp.arg[0] & 0xffff; | |
1534 | vLf134 = resp.arg[0] >> 16; | |
1535 | vHf = resp.arg[1] & 0xffff;; | |
1536 | peakf = resp.arg[2] & 0xffff; | |
1537 | peakv = resp.arg[2] >> 16; | |
1538 | PrintAndLog(""); | |
1539 | PrintAndLog("# LF antenna: %5.2f V @ 125.00 kHz", vLf125/1000.0); | |
1540 | PrintAndLog("# LF antenna: %5.2f V @ 134.00 kHz", vLf134/1000.0); | |
1541 | PrintAndLog("# LF optimal: %5.2f V @%9.2f kHz", peakv/1000.0, 12000.0/(peakf+1)); | |
1542 | PrintAndLog("# HF antenna: %5.2f V @ 13.56 MHz", vHf/1000.0); | |
1543 | if (peakv<2000) | |
1544 | PrintAndLog("# Your LF antenna is unusable."); | |
1545 | else if (peakv<10000) | |
1546 | PrintAndLog("# Your LF antenna is marginal."); | |
1547 | if (vHf<2000) | |
1548 | PrintAndLog("# Your HF antenna is unusable."); | |
1549 | else if (vHf<5000) | |
1550 | PrintAndLog("# Your HF antenna is marginal."); | |
1551 | ||
1552 | for (int i = 0; i < 256; i++) { | |
1553 | GraphBuffer[i] = resp.d.asBytes[i] - 128; | |
1554 | } | |
1555 | ||
1556 | PrintAndLog("Done! Divisor 89 is 134khz, 95 is 125khz.\n"); | |
1557 | PrintAndLog("\n"); | |
1558 | GraphTraceLen = 256; | |
1559 | ShowGraphWindow(); | |
1560 | ||
1561 | return 0; | |
1562 | } | |
1563 | ||
1564 | ||
1565 | int CmdLoad(const char *Cmd) | |
1566 | { | |
1567 | char filename[FILE_PATH_SIZE] = {0x00}; | |
1568 | int len = 0; | |
1569 | ||
1570 | len = strlen(Cmd); | |
1571 | if (len > FILE_PATH_SIZE) len = FILE_PATH_SIZE; | |
1572 | memcpy(filename, Cmd, len); | |
1573 | ||
1574 | FILE *f = fopen(filename, "r"); | |
1575 | if (!f) { | |
1576 | PrintAndLog("couldn't open '%s'", filename); | |
1577 | return 0; | |
1578 | } | |
1579 | ||
1580 | GraphTraceLen = 0; | |
1581 | char line[80]; | |
1582 | while (fgets(line, sizeof (line), f)) { | |
1583 | GraphBuffer[GraphTraceLen] = atoi(line); | |
1584 | GraphTraceLen++; | |
1585 | } | |
1586 | fclose(f); | |
1587 | PrintAndLog("loaded %d samples", GraphTraceLen); | |
1588 | RepaintGraphWindow(); | |
1589 | return 0; | |
1590 | } | |
1591 | ||
1592 | int CmdLtrim(const char *Cmd) | |
1593 | { | |
1594 | int ds = atoi(Cmd); | |
1595 | ||
1596 | for (int i = ds; i < GraphTraceLen; ++i) | |
1597 | GraphBuffer[i-ds] = GraphBuffer[i]; | |
1598 | GraphTraceLen -= ds; | |
1599 | ||
1600 | RepaintGraphWindow(); | |
1601 | return 0; | |
1602 | } | |
1603 | ||
1604 | // trim graph to input argument length | |
1605 | int CmdRtrim(const char *Cmd) | |
1606 | { | |
1607 | int ds = atoi(Cmd); | |
1608 | ||
1609 | GraphTraceLen = ds; | |
1610 | ||
1611 | RepaintGraphWindow(); | |
1612 | return 0; | |
1613 | } | |
1614 | ||
1615 | /* | |
1616 | * Manchester demodulate a bitstream. The bitstream needs to be already in | |
1617 | * the GraphBuffer as 0 and 1 values | |
1618 | * | |
1619 | * Give the clock rate as argument in order to help the sync - the algorithm | |
1620 | * resyncs at each pulse anyway. | |
1621 | * | |
1622 | * Not optimized by any means, this is the 1st time I'm writing this type of | |
1623 | * routine, feel free to improve... | |
1624 | * | |
1625 | * 1st argument: clock rate (as number of samples per clock rate) | |
1626 | * Typical values can be 64, 32, 128... | |
1627 | */ | |
1628 | int CmdManchesterDemod(const char *Cmd) | |
1629 | { | |
1630 | int i, j, invert= 0; | |
1631 | int bit; | |
1632 | int clock; | |
1633 | int lastval = 0; | |
1634 | int low = 0; | |
1635 | int high = 0; | |
1636 | int hithigh, hitlow, first; | |
1637 | int lc = 0; | |
1638 | int bitidx = 0; | |
1639 | int bit2idx = 0; | |
1640 | int warnings = 0; | |
1641 | ||
1642 | /* check if we're inverting output */ | |
1643 | if (*Cmd == 'i') | |
1644 | { | |
1645 | PrintAndLog("Inverting output"); | |
1646 | invert = 1; | |
1647 | ++Cmd; | |
1648 | do | |
1649 | ++Cmd; | |
1650 | while(*Cmd == ' '); // in case a 2nd argument was given | |
1651 | } | |
1652 | ||
1653 | /* Holds the decoded bitstream: each clock period contains 2 bits */ | |
1654 | /* later simplified to 1 bit after manchester decoding. */ | |
1655 | /* Add 10 bits to allow for noisy / uncertain traces without aborting */ | |
1656 | /* int BitStream[GraphTraceLen*2/clock+10]; */ | |
1657 | ||
1658 | /* But it does not work if compiling on WIndows: therefore we just allocate a */ | |
1659 | /* large array */ | |
1660 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN] = {0}; | |
1661 | ||
1662 | /* Detect high and lows */ | |
1663 | for (i = 0; i < GraphTraceLen; i++) | |
1664 | { | |
1665 | if (GraphBuffer[i] > high) | |
1666 | high = GraphBuffer[i]; | |
1667 | else if (GraphBuffer[i] < low) | |
1668 | low = GraphBuffer[i]; | |
1669 | } | |
1670 | ||
1671 | /* Get our clock */ | |
1672 | clock = GetClock(Cmd, high, 1); | |
1673 | ||
1674 | int tolerance = clock/4; | |
1675 | ||
1676 | /* Detect first transition */ | |
1677 | /* Lo-Hi (arbitrary) */ | |
1678 | /* skip to the first high */ | |
1679 | for (i= 0; i < GraphTraceLen; i++) | |
1680 | if (GraphBuffer[i] == high) | |
1681 | break; | |
1682 | /* now look for the first low */ | |
1683 | for (; i < GraphTraceLen; i++) | |
1684 | { | |
1685 | if (GraphBuffer[i] == low) | |
1686 | { | |
1687 | lastval = i; | |
1688 | break; | |
1689 | } | |
1690 | } | |
1691 | ||
1692 | /* If we're not working with 1/0s, demod based off clock */ | |
1693 | if (high != 1) | |
1694 | { | |
1695 | bit = 0; /* We assume the 1st bit is zero, it may not be | |
1696 | * the case: this routine (I think) has an init problem. | |
1697 | * Ed. | |
1698 | */ | |
1699 | for (; i < (int)(GraphTraceLen / clock); i++) | |
1700 | { | |
1701 | hithigh = 0; | |
1702 | hitlow = 0; | |
1703 | first = 1; | |
1704 | ||
1705 | /* Find out if we hit both high and low peaks */ | |
1706 | for (j = 0; j < clock; j++) | |
1707 | { | |
1708 | if (GraphBuffer[(i * clock) + j] == high) | |
1709 | hithigh = 1; | |
1710 | else if (GraphBuffer[(i * clock) + j] == low) | |
1711 | hitlow = 1; | |
1712 | ||
1713 | /* it doesn't count if it's the first part of our read | |
1714 | because it's really just trailing from the last sequence */ | |
1715 | if (first && (hithigh || hitlow)) | |
1716 | hithigh = hitlow = 0; | |
1717 | else | |
1718 | first = 0; | |
1719 | ||
1720 | if (hithigh && hitlow) | |
1721 | break; | |
1722 | } | |
1723 | ||
1724 | /* If we didn't hit both high and low peaks, we had a bit transition */ | |
1725 | if (!hithigh || !hitlow) | |
1726 | bit ^= 1; | |
1727 | ||
1728 | BitStream[bit2idx++] = bit ^ invert; | |
1729 | } | |
1730 | } | |
1731 | ||
1732 | /* standard 1/0 bitstream */ | |
1733 | else | |
1734 | { | |
1735 | ||
1736 | /* Then detect duration between 2 successive transitions */ | |
1737 | for (bitidx = 1; i < GraphTraceLen; i++) | |
1738 | { | |
1739 | if (GraphBuffer[i-1] != GraphBuffer[i]) | |
1740 | { | |
1741 | lc = i-lastval; | |
1742 | lastval = i; | |
1743 | ||
1744 | // Error check: if bitidx becomes too large, we do not | |
1745 | // have a Manchester encoded bitstream or the clock is really | |
1746 | // wrong! | |
1747 | if (bitidx > (GraphTraceLen*2/clock+8) ) { | |
1748 | PrintAndLog("Error: the clock you gave is probably wrong, aborting."); | |
1749 | return 0; | |
1750 | } | |
1751 | // Then switch depending on lc length: | |
1752 | // Tolerance is 1/4 of clock rate (arbitrary) | |
1753 | if (abs(lc-clock/2) < tolerance) { | |
1754 | // Short pulse : either "1" or "0" | |
1755 | BitStream[bitidx++]=GraphBuffer[i-1]; | |
1756 | } else if (abs(lc-clock) < tolerance) { | |
1757 | // Long pulse: either "11" or "00" | |
1758 | BitStream[bitidx++]=GraphBuffer[i-1]; | |
1759 | BitStream[bitidx++]=GraphBuffer[i-1]; | |
1760 | } else { | |
1761 | // Error | |
1762 | warnings++; | |
1763 | PrintAndLog("Warning: Manchester decode error for pulse width detection."); | |
1764 | PrintAndLog("(too many of those messages mean either the stream is not Manchester encoded, or clock is wrong)"); | |
1765 | ||
1766 | if (warnings > 10) | |
1767 | { | |
1768 | PrintAndLog("Error: too many detection errors, aborting."); | |
1769 | return 0; | |
1770 | } | |
1771 | } | |
1772 | } | |
1773 | } | |
1774 | ||
1775 | // At this stage, we now have a bitstream of "01" ("1") or "10" ("0"), parse it into final decoded bitstream | |
1776 | // Actually, we overwrite BitStream with the new decoded bitstream, we just need to be careful | |
1777 | // to stop output at the final bitidx2 value, not bitidx | |
1778 | for (i = 0; i < bitidx; i += 2) { | |
1779 | if ((BitStream[i] == 0) && (BitStream[i+1] == 1)) { | |
1780 | BitStream[bit2idx++] = 1 ^ invert; | |
1781 | } else if ((BitStream[i] == 1) && (BitStream[i+1] == 0)) { | |
1782 | BitStream[bit2idx++] = 0 ^ invert; | |
1783 | } else { | |
1784 | // We cannot end up in this state, this means we are unsynchronized, | |
1785 | // move up 1 bit: | |
1786 | i++; | |
1787 | warnings++; | |
1788 | PrintAndLog("Unsynchronized, resync..."); | |
1789 | PrintAndLog("(too many of those messages mean the stream is not Manchester encoded)"); | |
1790 | ||
1791 | if (warnings > 10) | |
1792 | { | |
1793 | PrintAndLog("Error: too many decode errors, aborting."); | |
1794 | return 0; | |
1795 | } | |
1796 | } | |
1797 | } | |
1798 | } | |
1799 | ||
1800 | PrintAndLog("Manchester decoded bitstream"); | |
1801 | // Now output the bitstream to the scrollback by line of 16 bits | |
1802 | for (i = 0; i < (bit2idx-16); i+=16) { | |
1803 | PrintAndLog("%i %i %i %i %i %i %i %i %i %i %i %i %i %i %i %i", | |
1804 | BitStream[i], | |
1805 | BitStream[i+1], | |
1806 | BitStream[i+2], | |
1807 | BitStream[i+3], | |
1808 | BitStream[i+4], | |
1809 | BitStream[i+5], | |
1810 | BitStream[i+6], | |
1811 | BitStream[i+7], | |
1812 | BitStream[i+8], | |
1813 | BitStream[i+9], | |
1814 | BitStream[i+10], | |
1815 | BitStream[i+11], | |
1816 | BitStream[i+12], | |
1817 | BitStream[i+13], | |
1818 | BitStream[i+14], | |
1819 | BitStream[i+15]); | |
1820 | } | |
1821 | return 0; | |
1822 | } | |
1823 | ||
1824 | /* Modulate our data into manchester */ | |
1825 | int CmdManchesterMod(const char *Cmd) | |
1826 | { | |
1827 | int i, j; | |
1828 | int clock; | |
1829 | int bit, lastbit, wave; | |
1830 | ||
1831 | /* Get our clock */ | |
1832 | clock = GetClock(Cmd, 0, 1); | |
1833 | ||
1834 | wave = 0; | |
1835 | lastbit = 1; | |
1836 | for (i = 0; i < (int)(GraphTraceLen / clock); i++) | |
1837 | { | |
1838 | bit = GraphBuffer[i * clock] ^ 1; | |
1839 | ||
1840 | for (j = 0; j < (int)(clock/2); j++) | |
1841 | GraphBuffer[(i * clock) + j] = bit ^ lastbit ^ wave; | |
1842 | for (j = (int)(clock/2); j < clock; j++) | |
1843 | GraphBuffer[(i * clock) + j] = bit ^ lastbit ^ wave ^ 1; | |
1844 | ||
1845 | /* Keep track of how we start our wave and if we changed or not this time */ | |
1846 | wave ^= bit ^ lastbit; | |
1847 | lastbit = bit; | |
1848 | } | |
1849 | ||
1850 | RepaintGraphWindow(); | |
1851 | return 0; | |
1852 | } | |
1853 | ||
1854 | int CmdNorm(const char *Cmd) | |
1855 | { | |
1856 | int i; | |
1857 | int max = INT_MIN, min = INT_MAX; | |
1858 | ||
1859 | for (i = 10; i < GraphTraceLen; ++i) { | |
1860 | if (GraphBuffer[i] > max) | |
1861 | max = GraphBuffer[i]; | |
1862 | if (GraphBuffer[i] < min) | |
1863 | min = GraphBuffer[i]; | |
1864 | } | |
1865 | ||
1866 | if (max != min) { | |
1867 | for (i = 0; i < GraphTraceLen; ++i) { | |
1868 | GraphBuffer[i] = (GraphBuffer[i] - ((max + min) / 2)) * 256 / | |
1869 | (max - min); | |
1870 | //marshmelow: adjusted *1000 to *256 to make +/- 128 so demod commands still work | |
1871 | } | |
1872 | } | |
1873 | RepaintGraphWindow(); | |
1874 | return 0; | |
1875 | } | |
1876 | ||
1877 | int CmdPlot(const char *Cmd) | |
1878 | { | |
1879 | ShowGraphWindow(); | |
1880 | return 0; | |
1881 | } | |
1882 | ||
1883 | int CmdSave(const char *Cmd) | |
1884 | { | |
1885 | char filename[FILE_PATH_SIZE] = {0x00}; | |
1886 | int len = 0; | |
1887 | ||
1888 | len = strlen(Cmd); | |
1889 | if (len > FILE_PATH_SIZE) len = FILE_PATH_SIZE; | |
1890 | memcpy(filename, Cmd, len); | |
1891 | ||
1892 | ||
1893 | FILE *f = fopen(filename, "w"); | |
1894 | if(!f) { | |
1895 | PrintAndLog("couldn't open '%s'", filename); | |
1896 | return 0; | |
1897 | } | |
1898 | int i; | |
1899 | for (i = 0; i < GraphTraceLen; i++) { | |
1900 | fprintf(f, "%d\n", GraphBuffer[i]); | |
1901 | } | |
1902 | fclose(f); | |
1903 | PrintAndLog("saved to '%s'", Cmd); | |
1904 | return 0; | |
1905 | } | |
1906 | ||
1907 | int CmdScale(const char *Cmd) | |
1908 | { | |
1909 | CursorScaleFactor = atoi(Cmd); | |
1910 | if (CursorScaleFactor == 0) { | |
1911 | PrintAndLog("bad, can't have zero scale"); | |
1912 | CursorScaleFactor = 1; | |
1913 | } | |
1914 | RepaintGraphWindow(); | |
1915 | return 0; | |
1916 | } | |
1917 | ||
1918 | int CmdThreshold(const char *Cmd) | |
1919 | { | |
1920 | int threshold = atoi(Cmd); | |
1921 | ||
1922 | for (int i = 0; i < GraphTraceLen; ++i) { | |
1923 | if (GraphBuffer[i] >= threshold) | |
1924 | GraphBuffer[i] = 1; | |
1925 | else | |
1926 | GraphBuffer[i] = -1; | |
1927 | } | |
1928 | RepaintGraphWindow(); | |
1929 | return 0; | |
1930 | } | |
1931 | ||
1932 | int CmdDirectionalThreshold(const char *Cmd) | |
1933 | { | |
1934 | int8_t upThres = param_get8(Cmd, 0); | |
1935 | int8_t downThres = param_get8(Cmd, 1); | |
1936 | ||
1937 | printf("Applying Up Threshold: %d, Down Threshold: %d\n", upThres, downThres); | |
1938 | ||
1939 | int lastValue = GraphBuffer[0]; | |
1940 | GraphBuffer[0] = 0; // Will be changed at the end, but init 0 as we adjust to last samples value if no threshold kicks in. | |
1941 | ||
1942 | for (int i = 1; i < GraphTraceLen; ++i) { | |
1943 | // Apply first threshold to samples heading up | |
1944 | if (GraphBuffer[i] >= upThres && GraphBuffer[i] > lastValue) | |
1945 | { | |
1946 | lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it. | |
1947 | GraphBuffer[i] = 1; | |
1948 | } | |
1949 | // Apply second threshold to samples heading down | |
1950 | else if (GraphBuffer[i] <= downThres && GraphBuffer[i] < lastValue) | |
1951 | { | |
1952 | lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it. | |
1953 | GraphBuffer[i] = -1; | |
1954 | } | |
1955 | else | |
1956 | { | |
1957 | lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it. | |
1958 | GraphBuffer[i] = GraphBuffer[i-1]; | |
1959 | ||
1960 | } | |
1961 | } | |
1962 | GraphBuffer[0] = GraphBuffer[1]; // Aline with first edited sample. | |
1963 | RepaintGraphWindow(); | |
1964 | return 0; | |
1965 | } | |
1966 | ||
1967 | int CmdZerocrossings(const char *Cmd) | |
1968 | { | |
1969 | // Zero-crossings aren't meaningful unless the signal is zero-mean. | |
1970 | CmdHpf(""); | |
1971 | ||
1972 | int sign = 1; | |
1973 | int zc = 0; | |
1974 | int lastZc = 0; | |
1975 | ||
1976 | for (int i = 0; i < GraphTraceLen; ++i) { | |
1977 | if (GraphBuffer[i] * sign >= 0) { | |
1978 | // No change in sign, reproduce the previous sample count. | |
1979 | zc++; | |
1980 | GraphBuffer[i] = lastZc; | |
1981 | } else { | |
1982 | // Change in sign, reset the sample count. | |
1983 | sign = -sign; | |
1984 | GraphBuffer[i] = lastZc; | |
1985 | if (sign > 0) { | |
1986 | lastZc = zc; | |
1987 | zc = 0; | |
1988 | } | |
1989 | } | |
1990 | } | |
1991 | ||
1992 | RepaintGraphWindow(); | |
1993 | return 0; | |
1994 | } | |
1995 | ||
1996 | static command_t CommandTable[] = | |
1997 | { | |
1998 | {"help", CmdHelp, 1, "This help"}, | |
1999 | {"amp", CmdAmp, 1, "Amplify peaks"}, | |
2000 | {"askdemod", Cmdaskdemod, 1, "<0 or 1> -- Attempt to demodulate simple ASK tags"}, | |
2001 | {"askmandemod", Cmdaskmandemod, 1, "[clock] [invert<0|1>] -- Attempt to demodulate ASK/Manchester tags and output binary (args optional)"}, | |
2002 | {"askrawdemod", Cmdaskrawdemod, 1, "[clock] [invert<0|1>] -- Attempt to demodulate ASK tags and output bin (args optional)"}, | |
2003 | {"autocorr", CmdAutoCorr, 1, "<window length> -- Autocorrelation over window"}, | |
2004 | {"biphaserawdecode",CmdBiphaseDecodeRaw,1,"[offset] [invert<0|1>] Biphase decode bin stream in demod buffer (offset = 0|1 bits to shift the decode start)"}, | |
2005 | {"bitsamples", CmdBitsamples, 0, "Get raw samples as bitstring"}, | |
2006 | {"bitstream", CmdBitstream, 1, "[clock rate] -- Convert waveform into a bitstream"}, | |
2007 | {"buffclear", CmdBuffClear, 1, "Clear sample buffer and graph window"}, | |
2008 | {"dec", CmdDec, 1, "Decimate samples"}, | |
2009 | {"detectclock", CmdDetectClockRate, 1, "Detect ASK clock rate"}, | |
2010 | {"fskdemod", CmdFSKdemod, 1, "Demodulate graph window as a HID FSK"}, | |
2011 | {"fskawiddemod", CmdFSKdemodAWID, 1, "Demodulate graph window as an AWID FSK tag using raw"}, | |
2012 | {"fskfcdetect", CmdFSKfcDetect, 1, "Try to detect the Field Clock of an FSK wave"}, | |
2013 | {"fskhiddemod", CmdFSKdemodHID, 1, "Demodulate graph window as a HID FSK tag using raw"}, | |
2014 | {"fskiodemod", CmdFSKdemodIO, 1, "Demodulate graph window as an IO Prox tag FSK using raw"}, | |
2015 | {"fskpyramiddemod",CmdFSKdemodPyramid,1, "Demodulate graph window as a Pyramid FSK tag using raw"}, | |
2016 | {"fskparadoxdemod",CmdFSKdemodParadox,1, "Demodulate graph window as a Paradox FSK tag using raw"}, | |
2017 | {"fskrawdemod", CmdFSKrawdemod, 1, "[clock rate] [invert] [rchigh] [rclow] Demodulate graph window from FSK to bin (clock = 50)(invert = 1|0)(rchigh = 10)(rclow=8)"}, | |
2018 | {"grid", CmdGrid, 1, "<x> <y> -- overlay grid on graph window, use zero value to turn off either"}, | |
2019 | {"hexsamples", CmdHexsamples, 0, "<bytes> [<offset>] -- Dump big buffer as hex bytes"}, | |
2020 | {"hide", CmdHide, 1, "Hide graph window"}, | |
2021 | {"hpf", CmdHpf, 1, "Remove DC offset from trace"}, | |
2022 | {"load", CmdLoad, 1, "<filename> -- Load trace (to graph window"}, | |
2023 | {"ltrim", CmdLtrim, 1, "<samples> -- Trim samples from left of trace"}, | |
2024 | {"rtrim", CmdRtrim, 1, "<location to end trace> -- Trim samples from right of trace"}, | |
2025 | {"mandemod", CmdManchesterDemod, 1, "[i] [clock rate] -- Manchester demodulate binary stream (option 'i' to invert output)"}, | |
2026 | {"manrawdecode", Cmdmandecoderaw, 1, "Manchester decode binary stream already in graph buffer"}, | |
2027 | {"manmod", CmdManchesterMod, 1, "[clock rate] -- Manchester modulate a binary stream"}, | |
2028 | {"norm", CmdNorm, 1, "Normalize max/min to +/-128"}, | |
2029 | {"plot", CmdPlot, 1, "Show graph window (hit 'h' in window for keystroke help)"}, | |
2030 | {"pskclean", CmdPskClean, 1, "Attempt to clean psk wave"}, | |
2031 | {"pskdetectclock",CmdDetectNRZpskClockRate, 1, "Detect ASK, PSK, or NRZ clock rate"}, | |
2032 | {"pskindalademod",CmdIndalaDecode, 1, "[clock] [invert<0|1>] -- Attempt to demodulate psk1 indala tags and output ID binary & hex (args optional)"}, | |
2033 | {"psk1nrzrawdemod",CmdpskNRZrawDemod, 1, "[clock] [invert<0|1>] -- Attempt to demodulate psk1 or nrz tags and output binary (args optional)"}, | |
2034 | {"psk2rawdemod", CmdPSK2rawDemod, 1, "[clock] [invert<0|1>] -- Attempt to demodulate psk2 tags and output binary (args optional)"}, | |
2035 | {"samples", CmdSamples, 0, "[512 - 40000] -- Get raw samples for graph window"}, | |
2036 | {"save", CmdSave, 1, "<filename> -- Save trace (from graph window)"}, | |
2037 | {"scale", CmdScale, 1, "<int> -- Set cursor display scale"}, | |
2038 | {"setdebugmode", CmdSetDebugMode, 1, "<0|1> -- Turn on or off Debugging Mode for demods"}, | |
2039 | {"shiftgraphzero",CmdGraphShiftZero, 1, "<shift> -- Shift 0 for Graphed wave + or - shift value"}, | |
2040 | {"threshold", CmdThreshold, 1, "<threshold> -- Maximize/minimize every value in the graph window depending on threshold"}, | |
2041 | {"dirthreshold", CmdDirectionalThreshold, 1, "<thres up> <thres down> -- Max rising higher up-thres/ Min falling lower down-thres, keep rest as prev."}, | |
2042 | {"tune", CmdTuneSamples, 0, "Get hw tune samples for graph window"}, | |
2043 | {"zerocrossings", CmdZerocrossings, 1, "Count time between zero-crossings"}, | |
2044 | {NULL, NULL, 0, NULL} | |
2045 | }; | |
2046 | ||
2047 | int CmdData(const char *Cmd) | |
2048 | { | |
2049 | CmdsParse(CommandTable, Cmd); | |
2050 | return 0; | |
2051 | } | |
2052 | ||
2053 | int CmdHelp(const char *Cmd) | |
2054 | { | |
2055 | CmdsHelp(CommandTable); | |
2056 | return 0; | |
2057 | } |