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