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