]>
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 | // Low frequency 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 "graph.h" | |
18 | #include "ui.h" | |
19 | #include "cmdparser.h" | |
20 | #include "cmdmain.h" | |
21 | #include "cmddata.h" | |
22 | #include "util.h" | |
23 | #include "cmdlf.h" | |
24 | #include "cmdlfhid.h" | |
25 | #include "cmdlfti.h" | |
26 | #include "cmdlfem4x.h" | |
27 | #include "cmdlfhitag.h" | |
28 | #include "cmdlft55xx.h" | |
29 | #include "cmdlfpcf7931.h" | |
30 | #include "cmdlfio.h" | |
31 | #include "lfdemod.h" | |
32 | ||
33 | static int CmdHelp(const char *Cmd); | |
34 | ||
35 | /* send a command before reading */ | |
36 | int CmdLFCommandRead(const char *Cmd) | |
37 | { | |
38 | static char dummy[3]; | |
39 | ||
40 | dummy[0]= ' '; | |
41 | ||
42 | UsbCommand c = {CMD_MOD_THEN_ACQUIRE_RAW_ADC_SAMPLES_125K}; | |
43 | sscanf(Cmd, "%"lli" %"lli" %"lli" %s %s", &c.arg[0], &c.arg[1], &c.arg[2],(char*)(&c.d.asBytes),(char*)(&dummy+1)); | |
44 | // in case they specified 'h' | |
45 | strcpy((char *)&c.d.asBytes + strlen((char *)c.d.asBytes), dummy); | |
46 | SendCommand(&c); | |
47 | return 0; | |
48 | } | |
49 | ||
50 | int CmdFlexdemod(const char *Cmd) | |
51 | { | |
52 | int i; | |
53 | for (i = 0; i < GraphTraceLen; ++i) { | |
54 | if (GraphBuffer[i] < 0) { | |
55 | GraphBuffer[i] = -1; | |
56 | } else { | |
57 | GraphBuffer[i] = 1; | |
58 | } | |
59 | } | |
60 | ||
61 | #define LONG_WAIT 100 | |
62 | int start; | |
63 | for (start = 0; start < GraphTraceLen - LONG_WAIT; start++) { | |
64 | int first = GraphBuffer[start]; | |
65 | for (i = start; i < start + LONG_WAIT; i++) { | |
66 | if (GraphBuffer[i] != first) { | |
67 | break; | |
68 | } | |
69 | } | |
70 | if (i == (start + LONG_WAIT)) { | |
71 | break; | |
72 | } | |
73 | } | |
74 | if (start == GraphTraceLen - LONG_WAIT) { | |
75 | PrintAndLog("nothing to wait for"); | |
76 | return 0; | |
77 | } | |
78 | ||
79 | GraphBuffer[start] = 2; | |
80 | GraphBuffer[start+1] = -2; | |
81 | uint8_t bits[64] = {0x00}; | |
82 | ||
83 | int bit, sum; | |
84 | i = start; | |
85 | for (bit = 0; bit < 64; bit++) { | |
86 | sum = 0; | |
87 | for (int j = 0; j < 16; j++) { | |
88 | sum += GraphBuffer[i++]; | |
89 | } | |
90 | ||
91 | bits[bit] = (sum > 0) ? 1 : 0; | |
92 | ||
93 | PrintAndLog("bit %d sum %d", bit, sum); | |
94 | } | |
95 | ||
96 | for (bit = 0; bit < 64; bit++) { | |
97 | int j; | |
98 | int sum = 0; | |
99 | for (j = 0; j < 16; j++) { | |
100 | sum += GraphBuffer[i++]; | |
101 | } | |
102 | if (sum > 0 && bits[bit] != 1) { | |
103 | PrintAndLog("oops1 at %d", bit); | |
104 | } | |
105 | if (sum < 0 && bits[bit] != 0) { | |
106 | PrintAndLog("oops2 at %d", bit); | |
107 | } | |
108 | } | |
109 | ||
110 | // HACK writing back to graphbuffer. | |
111 | GraphTraceLen = 32*64; | |
112 | i = 0; | |
113 | int phase = 0; | |
114 | for (bit = 0; bit < 64; bit++) { | |
115 | ||
116 | phase = (bits[bit] == 0) ? 0 : 1; | |
117 | ||
118 | int j; | |
119 | for (j = 0; j < 32; j++) { | |
120 | GraphBuffer[i++] = phase; | |
121 | phase = !phase; | |
122 | } | |
123 | } | |
124 | ||
125 | RepaintGraphWindow(); | |
126 | return 0; | |
127 | } | |
128 | ||
129 | int CmdIndalaDemod(const char *Cmd) | |
130 | { | |
131 | // Usage: recover 64bit UID by default, specify "224" as arg to recover a 224bit UID | |
132 | ||
133 | int state = -1; | |
134 | int count = 0; | |
135 | int i, j; | |
136 | ||
137 | // worst case with GraphTraceLen=64000 is < 4096 | |
138 | // under normal conditions it's < 2048 | |
139 | ||
140 | uint8_t rawbits[4096]; | |
141 | int rawbit = 0; | |
142 | int worst = 0, worstPos = 0; | |
143 | // PrintAndLog("Expecting a bit less than %d raw bits", GraphTraceLen / 32); | |
144 | for (i = 0; i < GraphTraceLen-1; i += 2) { | |
145 | count += 1; | |
146 | if ((GraphBuffer[i] > GraphBuffer[i + 1]) && (state != 1)) { | |
147 | if (state == 0) { | |
148 | for (j = 0; j < count - 8; j += 16) { | |
149 | rawbits[rawbit++] = 0; | |
150 | } | |
151 | if ((abs(count - j)) > worst) { | |
152 | worst = abs(count - j); | |
153 | worstPos = i; | |
154 | } | |
155 | } | |
156 | state = 1; | |
157 | count = 0; | |
158 | } else if ((GraphBuffer[i] < GraphBuffer[i + 1]) && (state != 0)) { | |
159 | if (state == 1) { | |
160 | for (j = 0; j < count - 8; j += 16) { | |
161 | rawbits[rawbit++] = 1; | |
162 | } | |
163 | if ((abs(count - j)) > worst) { | |
164 | worst = abs(count - j); | |
165 | worstPos = i; | |
166 | } | |
167 | } | |
168 | state = 0; | |
169 | count = 0; | |
170 | } | |
171 | } | |
172 | ||
173 | if (rawbit>0){ | |
174 | PrintAndLog("Recovered %d raw bits, expected: %d", rawbit, GraphTraceLen/32); | |
175 | PrintAndLog("worst metric (0=best..7=worst): %d at pos %d", worst, worstPos); | |
176 | } else { | |
177 | return 0; | |
178 | } | |
179 | ||
180 | // Finding the start of a UID | |
181 | int uidlen, long_wait; | |
182 | if (strcmp(Cmd, "224") == 0) { | |
183 | uidlen = 224; | |
184 | long_wait = 30; | |
185 | } else { | |
186 | uidlen = 64; | |
187 | long_wait = 29; | |
188 | } | |
189 | ||
190 | int start; | |
191 | int first = 0; | |
192 | for (start = 0; start <= rawbit - uidlen; start++) { | |
193 | first = rawbits[start]; | |
194 | for (i = start; i < start + long_wait; i++) { | |
195 | if (rawbits[i] != first) { | |
196 | break; | |
197 | } | |
198 | } | |
199 | if (i == (start + long_wait)) { | |
200 | break; | |
201 | } | |
202 | } | |
203 | ||
204 | if (start == rawbit - uidlen + 1) { | |
205 | PrintAndLog("nothing to wait for"); | |
206 | return 0; | |
207 | } | |
208 | ||
209 | // Inverting signal if needed | |
210 | if (first == 1) { | |
211 | for (i = start; i < rawbit; i++) { | |
212 | rawbits[i] = !rawbits[i]; | |
213 | } | |
214 | } | |
215 | ||
216 | // Dumping UID | |
217 | uint8_t bits[224] = {0x00}; | |
218 | char showbits[225] = {0x00}; | |
219 | int bit; | |
220 | i = start; | |
221 | int times = 0; | |
222 | ||
223 | if (uidlen > rawbit) { | |
224 | PrintAndLog("Warning: not enough raw bits to get a full UID"); | |
225 | for (bit = 0; bit < rawbit; bit++) { | |
226 | bits[bit] = rawbits[i++]; | |
227 | // As we cannot know the parity, let's use "." and "/" | |
228 | showbits[bit] = '.' + bits[bit]; | |
229 | } | |
230 | showbits[bit+1]='\0'; | |
231 | PrintAndLog("Partial UID=%s", showbits); | |
232 | return 0; | |
233 | } else { | |
234 | for (bit = 0; bit < uidlen; bit++) { | |
235 | bits[bit] = rawbits[i++]; | |
236 | showbits[bit] = '0' + bits[bit]; | |
237 | } | |
238 | times = 1; | |
239 | } | |
240 | ||
241 | //convert UID to HEX | |
242 | uint32_t uid1, uid2, uid3, uid4, uid5, uid6, uid7; | |
243 | int idx; | |
244 | uid1 = uid2 = 0; | |
245 | ||
246 | if (uidlen==64){ | |
247 | for( idx=0; idx<64; idx++) { | |
248 | if (showbits[idx] == '0') { | |
249 | uid1=(uid1<<1)|(uid2>>31); | |
250 | uid2=(uid2<<1)|0; | |
251 | } else { | |
252 | uid1=(uid1<<1)|(uid2>>31); | |
253 | uid2=(uid2<<1)|1; | |
254 | } | |
255 | } | |
256 | PrintAndLog("UID=%s (%x%08x)", showbits, uid1, uid2); | |
257 | } | |
258 | else { | |
259 | uid3 = uid4 = uid5 = uid6 = uid7 = 0; | |
260 | ||
261 | for( idx=0; idx<224; idx++) { | |
262 | uid1=(uid1<<1)|(uid2>>31); | |
263 | uid2=(uid2<<1)|(uid3>>31); | |
264 | uid3=(uid3<<1)|(uid4>>31); | |
265 | uid4=(uid4<<1)|(uid5>>31); | |
266 | uid5=(uid5<<1)|(uid6>>31); | |
267 | uid6=(uid6<<1)|(uid7>>31); | |
268 | ||
269 | if (showbits[idx] == '0') | |
270 | uid7 = (uid7<<1) | 0; | |
271 | else | |
272 | uid7 = (uid7<<1) | 1; | |
273 | } | |
274 | PrintAndLog("UID=%s (%x%08x%08x%08x%08x%08x%08x)", showbits, uid1, uid2, uid3, uid4, uid5, uid6, uid7); | |
275 | } | |
276 | ||
277 | // Checking UID against next occurrences | |
278 | int failed = 0; | |
279 | for (; i + uidlen <= rawbit;) { | |
280 | failed = 0; | |
281 | for (bit = 0; bit < uidlen; bit++) { | |
282 | if (bits[bit] != rawbits[i++]) { | |
283 | failed = 1; | |
284 | break; | |
285 | } | |
286 | } | |
287 | if (failed == 1) { | |
288 | break; | |
289 | } | |
290 | times += 1; | |
291 | } | |
292 | ||
293 | PrintAndLog("Occurrences: %d (expected %d)", times, (rawbit - start) / uidlen); | |
294 | ||
295 | // Remodulating for tag cloning | |
296 | // HACK: 2015-01-04 this will have an impact on our new way of seening lf commands (demod) | |
297 | // since this changes graphbuffer data. | |
298 | GraphTraceLen = 32*uidlen; | |
299 | i = 0; | |
300 | int phase = 0; | |
301 | for (bit = 0; bit < uidlen; bit++) { | |
302 | if (bits[bit] == 0) { | |
303 | phase = 0; | |
304 | } else { | |
305 | phase = 1; | |
306 | } | |
307 | int j; | |
308 | for (j = 0; j < 32; j++) { | |
309 | GraphBuffer[i++] = phase; | |
310 | phase = !phase; | |
311 | } | |
312 | } | |
313 | ||
314 | RepaintGraphWindow(); | |
315 | return 1; | |
316 | } | |
317 | ||
318 | int CmdIndalaClone(const char *Cmd) | |
319 | { | |
320 | UsbCommand c; | |
321 | unsigned int uid1, uid2, uid3, uid4, uid5, uid6, uid7; | |
322 | ||
323 | uid1 = uid2 = uid3 = uid4 = uid5 = uid6 = uid7 = 0; | |
324 | int n = 0, i = 0; | |
325 | ||
326 | if (strchr(Cmd,'l') != 0) { | |
327 | while (sscanf(&Cmd[i++], "%1x", &n ) == 1) { | |
328 | uid1 = (uid1 << 4) | (uid2 >> 28); | |
329 | uid2 = (uid2 << 4) | (uid3 >> 28); | |
330 | uid3 = (uid3 << 4) | (uid4 >> 28); | |
331 | uid4 = (uid4 << 4) | (uid5 >> 28); | |
332 | uid5 = (uid5 << 4) | (uid6 >> 28); | |
333 | uid6 = (uid6 << 4) | (uid7 >> 28); | |
334 | uid7 = (uid7 << 4) | (n & 0xf); | |
335 | } | |
336 | PrintAndLog("Cloning 224bit tag with UID %x%08x%08x%08x%08x%08x%08x", uid1, uid2, uid3, uid4, uid5, uid6, uid7); | |
337 | c.cmd = CMD_INDALA_CLONE_TAG_L; | |
338 | c.d.asDwords[0] = uid1; | |
339 | c.d.asDwords[1] = uid2; | |
340 | c.d.asDwords[2] = uid3; | |
341 | c.d.asDwords[3] = uid4; | |
342 | c.d.asDwords[4] = uid5; | |
343 | c.d.asDwords[5] = uid6; | |
344 | c.d.asDwords[6] = uid7; | |
345 | } else { | |
346 | while (sscanf(&Cmd[i++], "%1x", &n ) == 1) { | |
347 | uid1 = (uid1 << 4) | (uid2 >> 28); | |
348 | uid2 = (uid2 << 4) | (n & 0xf); | |
349 | } | |
350 | PrintAndLog("Cloning 64bit tag with UID %x%08x", uid1, uid2); | |
351 | c.cmd = CMD_INDALA_CLONE_TAG; | |
352 | c.arg[0] = uid1; | |
353 | c.arg[1] = uid2; | |
354 | } | |
355 | ||
356 | SendCommand(&c); | |
357 | return 0; | |
358 | } | |
359 | ||
360 | int usage_lf_read() | |
361 | { | |
362 | PrintAndLog("Usage: lf read"); | |
363 | PrintAndLog("Options: "); | |
364 | PrintAndLog(" h This help"); | |
365 | PrintAndLog(" s silent run no printout"); | |
366 | PrintAndLog("This function takes no arguments. "); | |
367 | PrintAndLog("Use 'lf config' to set parameters."); | |
368 | return 0; | |
369 | } | |
370 | int usage_lf_snoop() | |
371 | { | |
372 | PrintAndLog("Usage: lf snoop"); | |
373 | PrintAndLog("Options: "); | |
374 | PrintAndLog(" h This help"); | |
375 | PrintAndLog("This function takes no arguments. "); | |
376 | PrintAndLog("Use 'lf config' to set parameters."); | |
377 | return 0; | |
378 | } | |
379 | ||
380 | int usage_lf_config() | |
381 | { | |
382 | PrintAndLog("Usage: lf config [H|<divisor>] [b <bps>] [d <decim>] [a 0|1]"); | |
383 | PrintAndLog("Options: "); | |
384 | PrintAndLog(" h This help"); | |
385 | PrintAndLog(" L Low frequency (125 KHz)"); | |
386 | PrintAndLog(" H High frequency (134 KHz)"); | |
387 | PrintAndLog(" q <divisor> Manually set divisor. 88-> 134KHz, 95-> 125 Hz"); | |
388 | PrintAndLog(" b <bps> Sets resolution of bits per sample. Default (max): 8"); | |
389 | PrintAndLog(" d <decim> Sets decimation. A value of N saves only 1 in N samples. Default: 1"); | |
390 | PrintAndLog(" a [0|1] Averaging - if set, will average the stored sample value when decimating. Default: 1"); | |
391 | PrintAndLog(" t <threshold> Sets trigger threshold. 0 means no threshold"); | |
392 | PrintAndLog("Examples:"); | |
393 | PrintAndLog(" lf config b 8 L"); | |
394 | PrintAndLog(" Samples at 125KHz, 8bps."); | |
395 | PrintAndLog(" lf config H b 4 d 3"); | |
396 | PrintAndLog(" Samples at 134KHz, averages three samples into one, stored with "); | |
397 | PrintAndLog(" a resolution of 4 bits per sample."); | |
398 | PrintAndLog(" lf read"); | |
399 | PrintAndLog(" Performs a read (active field)"); | |
400 | PrintAndLog(" lf snoop"); | |
401 | PrintAndLog(" Performs a snoop (no active field)"); | |
402 | return 0; | |
403 | } | |
404 | ||
405 | int CmdLFSetConfig(const char *Cmd) | |
406 | { | |
407 | ||
408 | uint8_t divisor = 0;//Frequency divisor | |
409 | uint8_t bps = 0; // Bits per sample | |
410 | uint8_t decimation = 0; //How many to keep | |
411 | bool averaging = 1; // Defaults to true | |
412 | bool errors = FALSE; | |
413 | int trigger_threshold =-1;//Means no change | |
414 | uint8_t unsigned_trigg = 0; | |
415 | ||
416 | uint8_t cmdp =0; | |
417 | while(param_getchar(Cmd, cmdp) != 0x00) | |
418 | { | |
419 | switch(param_getchar(Cmd, cmdp)) | |
420 | { | |
421 | case 'h': | |
422 | return usage_lf_config(); | |
423 | case 'H': | |
424 | divisor = 88; | |
425 | cmdp++; | |
426 | break; | |
427 | case 'L': | |
428 | divisor = 95; | |
429 | cmdp++; | |
430 | break; | |
431 | case 'q': | |
432 | errors |= param_getdec(Cmd,cmdp+1,&divisor); | |
433 | cmdp+=2; | |
434 | break; | |
435 | case 't': | |
436 | errors |= param_getdec(Cmd,cmdp+1,&unsigned_trigg); | |
437 | cmdp+=2; | |
438 | if(!errors) trigger_threshold = unsigned_trigg; | |
439 | break; | |
440 | case 'b': | |
441 | errors |= param_getdec(Cmd,cmdp+1,&bps); | |
442 | cmdp+=2; | |
443 | break; | |
444 | case 'd': | |
445 | errors |= param_getdec(Cmd,cmdp+1,&decimation); | |
446 | cmdp+=2; | |
447 | break; | |
448 | case 'a': | |
449 | averaging = param_getchar(Cmd,cmdp+1) == '1'; | |
450 | cmdp+=2; | |
451 | break; | |
452 | default: | |
453 | PrintAndLog("Unknown parameter '%c'", param_getchar(Cmd, cmdp)); | |
454 | errors = 1; | |
455 | break; | |
456 | } | |
457 | if(errors) break; | |
458 | } | |
459 | if(cmdp == 0) | |
460 | { | |
461 | errors = 1;// No args | |
462 | } | |
463 | ||
464 | //Validations | |
465 | if(errors) | |
466 | { | |
467 | return usage_lf_config(); | |
468 | } | |
469 | //Bps is limited to 8, so fits in lower half of arg1 | |
470 | if(bps >> 8) bps = 8; | |
471 | ||
472 | sample_config config = { | |
473 | decimation,bps,averaging,divisor,trigger_threshold | |
474 | }; | |
475 | //Averaging is a flag on high-bit of arg[1] | |
476 | UsbCommand c = {CMD_SET_LF_SAMPLING_CONFIG}; | |
477 | memcpy(c.d.asBytes,&config,sizeof(sample_config)); | |
478 | SendCommand(&c); | |
479 | return 0; | |
480 | } | |
481 | ||
482 | int CmdLFRead(const char *Cmd) | |
483 | { | |
484 | ||
485 | uint8_t cmdp = 0; | |
486 | bool arg1 = false; | |
487 | if (param_getchar(Cmd, cmdp) == 'h') | |
488 | { | |
489 | return usage_lf_read(); | |
490 | } | |
491 | if (param_getchar(Cmd, cmdp) == 's') arg1 = true; //suppress print | |
492 | //And ship it to device | |
493 | UsbCommand c = {CMD_ACQUIRE_RAW_ADC_SAMPLES_125K, {arg1,0,0}}; | |
494 | SendCommand(&c); | |
495 | WaitForResponse(CMD_ACK,NULL); | |
496 | return 0; | |
497 | } | |
498 | ||
499 | int CmdLFSnoop(const char *Cmd) | |
500 | { | |
501 | uint8_t cmdp =0; | |
502 | if(param_getchar(Cmd, cmdp) == 'h') | |
503 | { | |
504 | return usage_lf_snoop(); | |
505 | } | |
506 | ||
507 | UsbCommand c = {CMD_LF_SNOOP_RAW_ADC_SAMPLES}; | |
508 | SendCommand(&c); | |
509 | WaitForResponse(CMD_ACK,NULL); | |
510 | return 0; | |
511 | } | |
512 | ||
513 | static void ChkBitstream(const char *str) | |
514 | { | |
515 | int i; | |
516 | ||
517 | /* convert to bitstream if necessary */ | |
518 | for (i = 0; i < (int)(GraphTraceLen / 2); i++){ | |
519 | if (GraphBuffer[i] > 1 || GraphBuffer[i] < 0) { | |
520 | CmdGetBitStream(""); | |
521 | break; | |
522 | } | |
523 | } | |
524 | } | |
525 | //appears to attempt to simulate manchester | |
526 | int CmdLFSim(const char *Cmd) | |
527 | { | |
528 | int i,j; | |
529 | static int gap; | |
530 | ||
531 | sscanf(Cmd, "%i", &gap); | |
532 | ||
533 | /* convert to bitstream if necessary */ | |
534 | ||
535 | ChkBitstream(Cmd); | |
536 | ||
537 | //can send 512 bits at a time (1 byte sent per bit...) | |
538 | printf("Sending [%d bytes]", GraphTraceLen); | |
539 | for (i = 0; i < GraphTraceLen; i += USB_CMD_DATA_SIZE) { | |
540 | UsbCommand c={CMD_DOWNLOADED_SIM_SAMPLES_125K, {i, 0, 0}}; | |
541 | ||
542 | for (j = 0; j < USB_CMD_DATA_SIZE; j++) { | |
543 | c.d.asBytes[j] = GraphBuffer[i+j]; | |
544 | } | |
545 | SendCommand(&c); | |
546 | WaitForResponse(CMD_ACK,NULL); | |
547 | printf("."); | |
548 | } | |
549 | ||
550 | printf("\n"); | |
551 | PrintAndLog("Starting to simulate"); | |
552 | UsbCommand c = {CMD_SIMULATE_TAG_125K, {GraphTraceLen, gap, 0}}; | |
553 | SendCommand(&c); | |
554 | return 0; | |
555 | } | |
556 | ||
557 | int usage_lf_simfsk(void) | |
558 | { | |
559 | //print help | |
560 | PrintAndLog("Usage: lf simfsk [c <clock>] [i] [H <fcHigh>] [L <fcLow>] [d <hexdata>]"); | |
561 | PrintAndLog("Options: "); | |
562 | PrintAndLog(" h This help"); | |
563 | PrintAndLog(" c <clock> Manually set clock - can autodetect if using DemodBuffer"); | |
564 | PrintAndLog(" i invert data"); | |
565 | PrintAndLog(" H <fcHigh> Manually set the larger Field Clock"); | |
566 | PrintAndLog(" L <fcLow> Manually set the smaller Field Clock"); | |
567 | //PrintAndLog(" s TBD- -to enable a gap between playback repetitions - default: no gap"); | |
568 | PrintAndLog(" d <hexdata> Data to sim as hex - omit to sim from DemodBuffer"); | |
569 | PrintAndLog("\n NOTE: if you set one clock manually set them all manually"); | |
570 | return 0; | |
571 | } | |
572 | ||
573 | int usage_lf_simask(void) | |
574 | { | |
575 | //print help | |
576 | PrintAndLog("Usage: lf simask [c <clock>] [i] [b|m|r] [s] [d <raw hex to sim>]"); | |
577 | PrintAndLog("Options: "); | |
578 | PrintAndLog(" h This help"); | |
579 | PrintAndLog(" c <clock> Manually set clock - can autodetect if using DemodBuffer"); | |
580 | PrintAndLog(" i invert data"); | |
581 | PrintAndLog(" b sim ask/biphase"); | |
582 | PrintAndLog(" m sim ask/manchester - Default"); | |
583 | PrintAndLog(" r sim ask/raw"); | |
584 | PrintAndLog(" s TBD- -to enable a gap between playback repetitions - default: no gap"); | |
585 | PrintAndLog(" d <hexdata> Data to sim as hex - omit to sim from DemodBuffer"); | |
586 | return 0; | |
587 | } | |
588 | ||
589 | int usage_lf_simpsk(void) | |
590 | { | |
591 | //print help | |
592 | PrintAndLog("Usage: lf simpsk [1|2|3] [c <clock>] [i] [r <carrier>] [d <raw hex to sim>]"); | |
593 | PrintAndLog("Options: "); | |
594 | PrintAndLog(" h This help"); | |
595 | PrintAndLog(" c <clock> Manually set clock - can autodetect if using DemodBuffer"); | |
596 | PrintAndLog(" i invert data"); | |
597 | PrintAndLog(" 1 set PSK1 (default)"); | |
598 | PrintAndLog(" 2 set PSK2"); | |
599 | PrintAndLog(" 3 set PSK3"); | |
600 | PrintAndLog(" r <carrier> 2|4|8 are valid carriers: default = 2"); | |
601 | PrintAndLog(" d <hexdata> Data to sim as hex - omit to sim from DemodBuffer"); | |
602 | return 0; | |
603 | } | |
604 | ||
605 | // by marshmellow - sim ask data given clock, fcHigh, fcLow, invert | |
606 | // - allow pull data from DemodBuffer | |
607 | int CmdLFfskSim(const char *Cmd) | |
608 | { | |
609 | //might be able to autodetect FC and clock from Graphbuffer if using demod buffer | |
610 | //will need FChigh, FClow, Clock, and bitstream | |
611 | uint8_t fcHigh=0, fcLow=0, clk=0; | |
612 | uint8_t invert=0; | |
613 | bool errors = FALSE; | |
614 | char hexData[32] = {0x00}; // store entered hex data | |
615 | uint8_t data[255] = {0x00}; | |
616 | int dataLen = 0; | |
617 | uint8_t cmdp = 0; | |
618 | while(param_getchar(Cmd, cmdp) != 0x00) | |
619 | { | |
620 | switch(param_getchar(Cmd, cmdp)) | |
621 | { | |
622 | case 'h': | |
623 | return usage_lf_simfsk(); | |
624 | case 'i': | |
625 | invert = 1; | |
626 | cmdp++; | |
627 | break; | |
628 | case 'c': | |
629 | errors |= param_getdec(Cmd,cmdp+1,&clk); | |
630 | cmdp+=2; | |
631 | break; | |
632 | case 'H': | |
633 | errors |= param_getdec(Cmd,cmdp+1,&fcHigh); | |
634 | cmdp+=2; | |
635 | break; | |
636 | case 'L': | |
637 | errors |= param_getdec(Cmd,cmdp+1,&fcLow); | |
638 | cmdp+=2; | |
639 | break; | |
640 | //case 's': | |
641 | // separator=1; | |
642 | // cmdp++; | |
643 | // break; | |
644 | case 'd': | |
645 | dataLen = param_getstr(Cmd, cmdp+1, hexData); | |
646 | if (dataLen==0) { | |
647 | errors=TRUE; | |
648 | } else { | |
649 | dataLen = hextobinarray((char *)data, hexData); | |
650 | } | |
651 | if (dataLen==0) errors=TRUE; | |
652 | if (errors) PrintAndLog ("Error getting hex data"); | |
653 | cmdp+=2; | |
654 | break; | |
655 | default: | |
656 | PrintAndLog("Unknown parameter '%c'", param_getchar(Cmd, cmdp)); | |
657 | errors = TRUE; | |
658 | break; | |
659 | } | |
660 | if(errors) break; | |
661 | } | |
662 | if(cmdp == 0 && DemodBufferLen == 0) | |
663 | { | |
664 | errors = TRUE;// No args | |
665 | } | |
666 | ||
667 | //Validations | |
668 | if(errors) | |
669 | { | |
670 | return usage_lf_simfsk(); | |
671 | } | |
672 | ||
673 | if (dataLen == 0){ //using DemodBuffer | |
674 | if (clk==0 || fcHigh==0 || fcLow==0){ //manual settings must set them all | |
675 | uint8_t ans = fskClocks(&fcHigh, &fcLow, &clk, 0); | |
676 | if (ans==0){ | |
677 | if (!fcHigh) fcHigh=10; | |
678 | if (!fcLow) fcLow=8; | |
679 | if (!clk) clk=50; | |
680 | } | |
681 | } | |
682 | } else { | |
683 | setDemodBuf(data, dataLen, 0); | |
684 | } | |
685 | if (clk == 0) clk = 50; | |
686 | if (fcHigh == 0) fcHigh = 10; | |
687 | if (fcLow == 0) fcLow = 8; | |
688 | ||
689 | uint16_t arg1, arg2; | |
690 | arg1 = fcHigh << 8 | fcLow; | |
691 | arg2 = invert << 8 | clk; | |
692 | size_t size = DemodBufferLen; | |
693 | if (size > USB_CMD_DATA_SIZE) { | |
694 | PrintAndLog("DemodBuffer too long for current implementation - length: %d - max: %d", size, USB_CMD_DATA_SIZE); | |
695 | size = USB_CMD_DATA_SIZE; | |
696 | } | |
697 | UsbCommand c = {CMD_FSK_SIM_TAG, {arg1, arg2, size}}; | |
698 | ||
699 | memcpy(c.d.asBytes, DemodBuffer, size); | |
700 | SendCommand(&c); | |
701 | return 0; | |
702 | } | |
703 | ||
704 | // by marshmellow - sim ask data given clock, invert, manchester or raw, separator | |
705 | // - allow pull data from DemodBuffer | |
706 | int CmdLFaskSim(const char *Cmd) | |
707 | { | |
708 | //autodetect clock from Graphbuffer if using demod buffer | |
709 | //will need clock, invert, manchester/raw as m or r, separator as s, and bitstream | |
710 | uint8_t encoding = 1, separator = 0; | |
711 | //char cmdp = Cmd[0], par3='m', par4=0; | |
712 | uint8_t clk=0, invert=0; | |
713 | bool errors = FALSE; | |
714 | char hexData[32] = {0x00}; | |
715 | uint8_t data[255]= {0x00}; // store entered hex data | |
716 | int dataLen = 0; | |
717 | uint8_t cmdp = 0; | |
718 | while(param_getchar(Cmd, cmdp) != 0x00) | |
719 | { | |
720 | switch(param_getchar(Cmd, cmdp)) | |
721 | { | |
722 | case 'h': | |
723 | return usage_lf_simask(); | |
724 | case 'i': | |
725 | invert = 1; | |
726 | cmdp++; | |
727 | break; | |
728 | case 'c': | |
729 | errors |= param_getdec(Cmd,cmdp+1,&clk); | |
730 | cmdp+=2; | |
731 | break; | |
732 | case 'b': | |
733 | encoding=2; //biphase | |
734 | cmdp++; | |
735 | break; | |
736 | case 'm': | |
737 | encoding=1; | |
738 | cmdp++; | |
739 | break; | |
740 | case 'r': | |
741 | encoding=0; | |
742 | cmdp++; | |
743 | break; | |
744 | case 's': | |
745 | separator=1; | |
746 | cmdp++; | |
747 | break; | |
748 | case 'd': | |
749 | dataLen = param_getstr(Cmd, cmdp+1, hexData); | |
750 | if (dataLen==0) { | |
751 | errors=TRUE; | |
752 | } else { | |
753 | dataLen = hextobinarray((char *)data, hexData); | |
754 | } | |
755 | if (dataLen==0) errors=TRUE; | |
756 | if (errors) PrintAndLog ("Error getting hex data, datalen: %d",dataLen); | |
757 | cmdp+=2; | |
758 | break; | |
759 | default: | |
760 | PrintAndLog("Unknown parameter '%c'", param_getchar(Cmd, cmdp)); | |
761 | errors = TRUE; | |
762 | break; | |
763 | } | |
764 | if(errors) break; | |
765 | } | |
766 | if(cmdp == 0 && DemodBufferLen == 0) | |
767 | { | |
768 | errors = TRUE;// No args | |
769 | } | |
770 | ||
771 | //Validations | |
772 | if(errors) | |
773 | { | |
774 | return usage_lf_simask(); | |
775 | } | |
776 | if (dataLen == 0){ //using DemodBuffer | |
777 | if (clk == 0) clk = GetAskClock("0", false, false); | |
778 | } else { | |
779 | setDemodBuf(data, dataLen, 0); | |
780 | } | |
781 | if (clk == 0) clk = 64; | |
782 | if (encoding == 0) clk = clk/2; //askraw needs to double the clock speed | |
783 | uint16_t arg1, arg2; | |
784 | size_t size=DemodBufferLen; | |
785 | arg1 = clk << 8 | encoding; | |
786 | arg2 = invert << 8 | separator; | |
787 | if (size > USB_CMD_DATA_SIZE) { | |
788 | PrintAndLog("DemodBuffer too long for current implementation - length: %d - max: %d", size, USB_CMD_DATA_SIZE); | |
789 | size = USB_CMD_DATA_SIZE; | |
790 | } | |
791 | UsbCommand c = {CMD_ASK_SIM_TAG, {arg1, arg2, size}}; | |
792 | PrintAndLog("preparing to sim ask data: %d bits", size); | |
793 | memcpy(c.d.asBytes, DemodBuffer, size); | |
794 | SendCommand(&c); | |
795 | return 0; | |
796 | } | |
797 | ||
798 | // by marshmellow - sim psk data given carrier, clock, invert | |
799 | // - allow pull data from DemodBuffer or parameters | |
800 | int CmdLFpskSim(const char *Cmd) | |
801 | { | |
802 | //might be able to autodetect FC and clock from Graphbuffer if using demod buffer | |
803 | //will need carrier, Clock, and bitstream | |
804 | uint8_t carrier=0, clk=0; | |
805 | uint8_t invert=0; | |
806 | bool errors = FALSE; | |
807 | char hexData[32] = {0x00}; // store entered hex data | |
808 | uint8_t data[255] = {0x00}; | |
809 | int dataLen = 0; | |
810 | uint8_t cmdp = 0; | |
811 | uint8_t pskType = 1; | |
812 | while(param_getchar(Cmd, cmdp) != 0x00) | |
813 | { | |
814 | switch(param_getchar(Cmd, cmdp)) | |
815 | { | |
816 | case 'h': | |
817 | return usage_lf_simpsk(); | |
818 | case 'i': | |
819 | invert = 1; | |
820 | cmdp++; | |
821 | break; | |
822 | case 'c': | |
823 | errors |= param_getdec(Cmd,cmdp+1,&clk); | |
824 | cmdp+=2; | |
825 | break; | |
826 | case 'r': | |
827 | errors |= param_getdec(Cmd,cmdp+1,&carrier); | |
828 | cmdp+=2; | |
829 | break; | |
830 | case '1': | |
831 | pskType=1; | |
832 | cmdp++; | |
833 | break; | |
834 | case '2': | |
835 | pskType=2; | |
836 | cmdp++; | |
837 | break; | |
838 | case '3': | |
839 | pskType=3; | |
840 | cmdp++; | |
841 | break; | |
842 | case 'd': | |
843 | dataLen = param_getstr(Cmd, cmdp+1, hexData); | |
844 | if (dataLen==0) { | |
845 | errors=TRUE; | |
846 | } else { | |
847 | dataLen = hextobinarray((char *)data, hexData); | |
848 | } | |
849 | if (dataLen==0) errors=TRUE; | |
850 | if (errors) PrintAndLog ("Error getting hex data"); | |
851 | cmdp+=2; | |
852 | break; | |
853 | default: | |
854 | PrintAndLog("Unknown parameter '%c'", param_getchar(Cmd, cmdp)); | |
855 | errors = TRUE; | |
856 | break; | |
857 | } | |
858 | if (errors) break; | |
859 | } | |
860 | if (cmdp == 0 && DemodBufferLen == 0) | |
861 | { | |
862 | errors = TRUE;// No args | |
863 | } | |
864 | ||
865 | //Validations | |
866 | if (errors) | |
867 | { | |
868 | return usage_lf_simpsk(); | |
869 | } | |
870 | if (dataLen == 0){ //using DemodBuffer | |
871 | PrintAndLog("Getting Clocks"); | |
872 | if (clk==0) clk = GetPskClock("", FALSE, FALSE); | |
873 | PrintAndLog("clk: %d",clk); | |
874 | if (!carrier) carrier = GetPskCarrier("", FALSE, FALSE); | |
875 | PrintAndLog("carrier: %d", carrier); | |
876 | } else { | |
877 | setDemodBuf(data, dataLen, 0); | |
878 | } | |
879 | ||
880 | if (clk <= 0) clk = 32; | |
881 | if (carrier == 0) carrier = 2; | |
882 | if (pskType != 1){ | |
883 | if (pskType == 2){ | |
884 | //need to convert psk2 to psk1 data before sim | |
885 | psk2TOpsk1(DemodBuffer, DemodBufferLen); | |
886 | } else { | |
887 | PrintAndLog("Sorry, PSK3 not yet available"); | |
888 | } | |
889 | } | |
890 | uint16_t arg1, arg2; | |
891 | arg1 = clk << 8 | carrier; | |
892 | arg2 = invert; | |
893 | size_t size=DemodBufferLen; | |
894 | if (size > USB_CMD_DATA_SIZE) { | |
895 | PrintAndLog("DemodBuffer too long for current implementation - length: %d - max: %d", size, USB_CMD_DATA_SIZE); | |
896 | size=USB_CMD_DATA_SIZE; | |
897 | } | |
898 | UsbCommand c = {CMD_PSK_SIM_TAG, {arg1, arg2, size}}; | |
899 | PrintAndLog("DEBUG: Sending DemodBuffer Length: %d", size); | |
900 | memcpy(c.d.asBytes, DemodBuffer, size); | |
901 | SendCommand(&c); | |
902 | ||
903 | return 0; | |
904 | } | |
905 | ||
906 | int CmdLFSimBidir(const char *Cmd) | |
907 | { | |
908 | // Set ADC to twice the carrier for a slight supersampling | |
909 | // HACK: not implemented in ARMSRC. | |
910 | PrintAndLog("Not implemented yet."); | |
911 | UsbCommand c = {CMD_LF_SIMULATE_BIDIR, {47, 384, 0}}; | |
912 | SendCommand(&c); | |
913 | return 0; | |
914 | } | |
915 | ||
916 | /* simulate an LF Manchester encoded tag with specified bitstream, clock rate and inter-id gap */ | |
917 | /* | |
918 | int CmdLFSimManchester(const char *Cmd) | |
919 | { | |
920 | static int clock, gap; | |
921 | static char data[1024], gapstring[8]; | |
922 | ||
923 | sscanf(Cmd, "%i %s %i", &clock, &data[0], &gap); | |
924 | ||
925 | ClearGraph(0); | |
926 | ||
927 | for (int i = 0; i < strlen(data) ; ++i) | |
928 | AppendGraph(0, clock, data[i]- '0'); | |
929 | ||
930 | CmdManchesterMod(""); | |
931 | ||
932 | RepaintGraphWindow(); | |
933 | ||
934 | sprintf(&gapstring[0], "%i", gap); | |
935 | CmdLFSim(gapstring); | |
936 | return 0; | |
937 | } | |
938 | */ | |
939 | ||
940 | int CmdVchDemod(const char *Cmd) | |
941 | { | |
942 | // Is this the entire sync pattern, or does this also include some | |
943 | // data bits that happen to be the same everywhere? That would be | |
944 | // lovely to know. | |
945 | static const int SyncPattern[] = { | |
946 | 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, | |
947 | 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, | |
948 | 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, | |
949 | 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, | |
950 | 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, | |
951 | 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, | |
952 | 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, | |
953 | 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, | |
954 | 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, | |
955 | 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, | |
956 | }; | |
957 | ||
958 | // So first, we correlate for the sync pattern, and mark that. | |
959 | int bestCorrel = 0, bestPos = 0; | |
960 | int i; | |
961 | // It does us no good to find the sync pattern, with fewer than | |
962 | // 2048 samples after it... | |
963 | for (i = 0; i < (GraphTraceLen-2048); i++) { | |
964 | int sum = 0; | |
965 | int j; | |
966 | for (j = 0; j < arraylen(SyncPattern); j++) { | |
967 | sum += GraphBuffer[i+j]*SyncPattern[j]; | |
968 | } | |
969 | if (sum > bestCorrel) { | |
970 | bestCorrel = sum; | |
971 | bestPos = i; | |
972 | } | |
973 | } | |
974 | PrintAndLog("best sync at %d [metric %d]", bestPos, bestCorrel); | |
975 | ||
976 | char bits[257]; | |
977 | bits[256] = '\0'; | |
978 | ||
979 | int worst = INT_MAX; | |
980 | int worstPos = 0; | |
981 | ||
982 | for (i = 0; i < 2048; i += 8) { | |
983 | int sum = 0; | |
984 | int j; | |
985 | for (j = 0; j < 8; j++) { | |
986 | sum += GraphBuffer[bestPos+i+j]; | |
987 | } | |
988 | if (sum < 0) { | |
989 | bits[i/8] = '.'; | |
990 | } else { | |
991 | bits[i/8] = '1'; | |
992 | } | |
993 | if(abs(sum) < worst) { | |
994 | worst = abs(sum); | |
995 | worstPos = i; | |
996 | } | |
997 | } | |
998 | PrintAndLog("bits:"); | |
999 | PrintAndLog("%s", bits); | |
1000 | PrintAndLog("worst metric: %d at pos %d", worst, worstPos); | |
1001 | ||
1002 | if (strcmp(Cmd, "clone")==0) { | |
1003 | GraphTraceLen = 0; | |
1004 | char *s; | |
1005 | for(s = bits; *s; s++) { | |
1006 | int j; | |
1007 | for(j = 0; j < 16; j++) { | |
1008 | GraphBuffer[GraphTraceLen++] = (*s == '1') ? 1 : 0; | |
1009 | } | |
1010 | } | |
1011 | RepaintGraphWindow(); | |
1012 | } | |
1013 | return 0; | |
1014 | } | |
1015 | ||
1016 | //by marshmellow | |
1017 | int CmdLFfind(const char *Cmd) | |
1018 | { | |
1019 | int ans=0; | |
1020 | char cmdp = param_getchar(Cmd, 0); | |
1021 | char testRaw = param_getchar(Cmd, 1); | |
1022 | if (strlen(Cmd) > 3 || cmdp == 'h' || cmdp == 'H') { | |
1023 | PrintAndLog("Usage: lf search <0|1> [u]"); | |
1024 | PrintAndLog(" <use data from Graphbuffer> , if not set, try reading data from tag."); | |
1025 | PrintAndLog(" [Search for Unknown tags] , if not set, reads only known tags."); | |
1026 | PrintAndLog(""); | |
1027 | PrintAndLog(" sample: lf search = try reading data from tag & search for known tags"); | |
1028 | PrintAndLog(" : lf search 1 = use data from GraphBuffer & search for known tags"); | |
1029 | PrintAndLog(" : lf search u = try reading data from tag & search for known and unknown tags"); | |
1030 | PrintAndLog(" : lf search 1 u = use data from GraphBuffer & search for known and unknown tags"); | |
1031 | ||
1032 | return 0; | |
1033 | } | |
1034 | ||
1035 | if (!offline && (cmdp != '1')){ | |
1036 | ans=CmdLFRead(""); | |
1037 | ans=CmdSamples("20000"); | |
1038 | } else if (GraphTraceLen < 1000) { | |
1039 | PrintAndLog("Data in Graphbuffer was too small."); | |
1040 | return 0; | |
1041 | } | |
1042 | if (cmdp == 'u' || cmdp == 'U') testRaw = 'u'; | |
1043 | ||
1044 | PrintAndLog("NOTE: some demods output possible binary\n if it finds something that looks like a tag"); | |
1045 | PrintAndLog("False Positives ARE possible\n"); | |
1046 | PrintAndLog("\nChecking for known tags:\n"); | |
1047 | ||
1048 | ans=CmdFSKdemodIO(""); | |
1049 | if (ans>0) { | |
1050 | PrintAndLog("\nValid IO Prox ID Found!"); | |
1051 | return 1; | |
1052 | } | |
1053 | ||
1054 | ans=CmdFSKdemodPyramid(""); | |
1055 | if (ans>0) { | |
1056 | PrintAndLog("\nValid Pyramid ID Found!"); | |
1057 | return 1; | |
1058 | } | |
1059 | ||
1060 | ans=CmdFSKdemodParadox(""); | |
1061 | if (ans>0) { | |
1062 | PrintAndLog("\nValid Paradox ID Found!"); | |
1063 | return 1; | |
1064 | } | |
1065 | ||
1066 | ans=CmdFSKdemodAWID(""); | |
1067 | if (ans>0) { | |
1068 | PrintAndLog("\nValid AWID ID Found!"); | |
1069 | return 1; | |
1070 | } | |
1071 | ||
1072 | ans=CmdFSKdemodHID(""); | |
1073 | if (ans>0) { | |
1074 | PrintAndLog("\nValid HID Prox ID Found!"); | |
1075 | return 1; | |
1076 | } | |
1077 | ||
1078 | //add psk and indala | |
1079 | ans=CmdIndalaDecode(""); | |
1080 | if (ans>0) { | |
1081 | PrintAndLog("\nValid Indala ID Found!"); | |
1082 | return 1; | |
1083 | } | |
1084 | ||
1085 | ans=CmdAskEM410xDemod(""); | |
1086 | if (ans>0) { | |
1087 | PrintAndLog("\nValid EM410x ID Found!"); | |
1088 | return 1; | |
1089 | } | |
1090 | ||
1091 | ans=CmdG_Prox_II_Demod(""); | |
1092 | if (ans>0) { | |
1093 | PrintAndLog("\nValid G Prox II ID Found!"); | |
1094 | return 1; | |
1095 | } | |
1096 | ||
1097 | ans=EM4x50Read("", false); | |
1098 | if (ans>0) { | |
1099 | PrintAndLog("\nValid EM4x50 ID Found!"); | |
1100 | return 1; | |
1101 | } | |
1102 | PrintAndLog("\nNo Known Tags Found!\n"); | |
1103 | if (testRaw=='u' || testRaw=='U'){ | |
1104 | //test unknown tag formats (raw mode) | |
1105 | PrintAndLog("\nChecking for Unknown tags:\n"); | |
1106 | ans=AutoCorrelate(4000, FALSE, FALSE); | |
1107 | if (ans > 0) PrintAndLog("Possible Auto Correlation of %d repeating samples",ans); | |
1108 | ans=GetFskClock("",FALSE,FALSE); //CmdDetectClockRate("F"); // | |
1109 | if (ans != 0){ //fsk | |
1110 | ans=FSKrawDemod("",FALSE); | |
1111 | if (ans>0) { | |
1112 | PrintAndLog("\nUnknown FSK Modulated Tag Found!"); | |
1113 | printDemodBuff(); | |
1114 | return 1; | |
1115 | } | |
1116 | } | |
1117 | ans=ASKmanDemod("",FALSE,FALSE); | |
1118 | if (ans>0) { | |
1119 | PrintAndLog("\nUnknown ASK Modulated and Manchester encoded Tag Found!"); | |
1120 | PrintAndLog("\nif it does not look right it could instead be ASK/Biphase - try 'data rawdemod ab'"); | |
1121 | printDemodBuff(); | |
1122 | return 1; | |
1123 | } | |
1124 | ans=CmdPSK1rawDemod(""); | |
1125 | if (ans>0) { | |
1126 | PrintAndLog("Possible unknown PSK1 Modulated Tag Found above!\n\nCould also be PSK2 - try 'data rawdemod p2'"); | |
1127 | PrintAndLog("\nCould also be PSK3 - [currently not supported]"); | |
1128 | PrintAndLog("\nCould also be NRZ - try 'data nrzrawdemod"); | |
1129 | printDemodBuff(); | |
1130 | return 1; | |
1131 | } | |
1132 | PrintAndLog("\nNo Data Found!\n"); | |
1133 | } | |
1134 | return 0; | |
1135 | } | |
1136 | ||
1137 | static command_t CommandTable[] = | |
1138 | { | |
1139 | {"help", CmdHelp, 1, "This help"}, | |
1140 | {"cmdread", CmdLFCommandRead, 0, "<off period> <'0' period> <'1' period> <command> ['h'] -- Modulate LF reader field to send command before read (all periods in microseconds) (option 'h' for 134)"}, | |
1141 | {"em4x", CmdLFEM4X, 1, "{ EM4X RFIDs... }"}, | |
1142 | {"config", CmdLFSetConfig, 0, "Set config for LF sampling, bit/sample, decimation, frequency"}, | |
1143 | {"flexdemod", CmdFlexdemod, 1, "Demodulate samples for FlexPass"}, | |
1144 | {"hid", CmdLFHID, 1, "{ HID RFIDs... }"}, | |
1145 | {"io", CmdLFIO, 1, "{ ioProx tags... }"}, | |
1146 | {"indalademod", CmdIndalaDemod, 1, "['224'] -- Demodulate samples for Indala 64 bit UID (option '224' for 224 bit)"}, | |
1147 | {"indalaclone", CmdIndalaClone, 0, "<UID> ['l']-- Clone Indala to T55x7 (tag must be in antenna)(UID in HEX)(option 'l' for 224 UID"}, | |
1148 | {"read", CmdLFRead, 0, "['s' silent] Read 125/134 kHz LF ID-only tag. Do 'lf read h' for help"}, | |
1149 | {"search", CmdLFfind, 1, "[offline] ['u'] Read and Search for valid known tag (in offline mode it you can load first then search) - 'u' to search for unknown tags"}, | |
1150 | {"sim", CmdLFSim, 0, "[GAP] -- Simulate LF tag from buffer with optional GAP (in microseconds)"}, | |
1151 | {"simask", CmdLFaskSim, 0, "[clock] [invert <1|0>] [manchester/raw <'m'|'r'>] [msg separator 's'] [d <hexdata>] -- Simulate LF ASK tag from demodbuffer or input"}, | |
1152 | {"simfsk", CmdLFfskSim, 0, "[c <clock>] [i] [H <fcHigh>] [L <fcLow>] [d <hexdata>] -- Simulate LF FSK tag from demodbuffer or input"}, | |
1153 | {"simpsk", CmdLFpskSim, 0, "[1|2|3] [c <clock>] [i] [r <carrier>] [d <raw hex to sim>] -- Simulate LF PSK tag from demodbuffer or input"}, | |
1154 | {"simbidir", CmdLFSimBidir, 0, "Simulate LF tag (with bidirectional data transmission between reader and tag)"}, | |
1155 | //{"simman", CmdLFSimManchester, 0, "<Clock> <Bitstream> [GAP] Simulate arbitrary Manchester LF tag"}, | |
1156 | {"snoop", CmdLFSnoop, 0, "['l'|'h'|<divisor>] [trigger threshold]-- Snoop LF (l:125khz, h:134khz)"}, | |
1157 | {"ti", CmdLFTI, 1, "{ TI RFIDs... }"}, | |
1158 | {"hitag", CmdLFHitag, 1, "{ Hitag tags and transponders... }"}, | |
1159 | {"vchdemod", CmdVchDemod, 1, "['clone'] -- Demodulate samples for VeriChip"}, | |
1160 | {"t55xx", CmdLFT55XX, 1, "{ T55xx RFIDs... }"}, | |
1161 | {"pcf7931", CmdLFPCF7931, 1, "{PCF7931 RFIDs...}"}, | |
1162 | {NULL, NULL, 0, NULL} | |
1163 | }; | |
1164 | ||
1165 | int CmdLF(const char *Cmd) | |
1166 | { | |
1167 | CmdsParse(CommandTable, Cmd); | |
1168 | return 0; | |
1169 | } | |
1170 | ||
1171 | int CmdHelp(const char *Cmd) | |
1172 | { | |
1173 | CmdsHelp(CommandTable); | |
1174 | return 0; | |
1175 | } |