]>
Commit | Line | Data |
---|---|---|
1 | //----------------------------------------------------------------------------- | |
2 | // Copyright (C) 2010 iZsh <izsh at fail0verflow.com> | |
3 | // | |
4 | // This code is licensed to you under the terms of the GNU GPL, version 2 or, | |
5 | // at your option, any later version. See the LICENSE.txt file for the text of | |
6 | // the license. | |
7 | //----------------------------------------------------------------------------- | |
8 | // Data and Graph commands | |
9 | //----------------------------------------------------------------------------- | |
10 | ||
11 | #include <stdio.h> | |
12 | #include <stdlib.h> | |
13 | #include <string.h> | |
14 | #include <limits.h> | |
15 | #include "proxmark3.h" | |
16 | #include "data.h" | |
17 | #include "ui.h" | |
18 | #include "graph.h" | |
19 | #include "cmdparser.h" | |
20 | #include "util.h" | |
21 | #include "cmdmain.h" | |
22 | #include "cmddata.h" | |
23 | #include "lfdemod.h" | |
24 | #include "usb_cmd.h" | |
25 | ||
26 | uint8_t DemodBuffer[MAX_DEMOD_BUF_LEN]; | |
27 | uint8_t g_debugMode; | |
28 | int DemodBufferLen; | |
29 | static int CmdHelp(const char *Cmd); | |
30 | ||
31 | //set the demod buffer with given array of binary (one bit per byte) | |
32 | //by marshmellow | |
33 | void setDemodBuf(uint8_t *buff, size_t size, size_t startIdx) | |
34 | { | |
35 | size_t i = 0; | |
36 | for (; i < size; i++){ | |
37 | DemodBuffer[i]=buff[startIdx++]; | |
38 | } | |
39 | DemodBufferLen=size; | |
40 | return; | |
41 | } | |
42 | ||
43 | int CmdSetDebugMode(const char *Cmd) | |
44 | { | |
45 | int demod=0; | |
46 | sscanf(Cmd, "%i", &demod); | |
47 | g_debugMode=(uint8_t)demod; | |
48 | return 1; | |
49 | } | |
50 | ||
51 | //by marshmellow | |
52 | void printDemodBuff(void) | |
53 | { | |
54 | uint32_t i = 0; | |
55 | int bitLen = DemodBufferLen; | |
56 | if (bitLen<16) { | |
57 | PrintAndLog("no bits found in demod buffer"); | |
58 | return; | |
59 | } | |
60 | if (bitLen>512) bitLen=512; //max output to 512 bits if we have more - should be plenty | |
61 | ||
62 | // ensure equally divided by 16 | |
63 | bitLen &= 0xfff0; | |
64 | ||
65 | for (i = 0; i <= (bitLen-16); i+=16) { | |
66 | PrintAndLog("%i%i%i%i%i%i%i%i%i%i%i%i%i%i%i%i", | |
67 | DemodBuffer[i], | |
68 | DemodBuffer[i+1], | |
69 | DemodBuffer[i+2], | |
70 | DemodBuffer[i+3], | |
71 | DemodBuffer[i+4], | |
72 | DemodBuffer[i+5], | |
73 | DemodBuffer[i+6], | |
74 | DemodBuffer[i+7], | |
75 | DemodBuffer[i+8], | |
76 | DemodBuffer[i+9], | |
77 | DemodBuffer[i+10], | |
78 | DemodBuffer[i+11], | |
79 | DemodBuffer[i+12], | |
80 | DemodBuffer[i+13], | |
81 | DemodBuffer[i+14], | |
82 | DemodBuffer[i+15]); | |
83 | } | |
84 | return; | |
85 | } | |
86 | ||
87 | int CmdPrintDemodBuff(const char *Cmd) | |
88 | { | |
89 | char hex; | |
90 | char printBuff[512]={0x00}; | |
91 | uint8_t numBits = DemodBufferLen & 0xFFF0; | |
92 | sscanf(Cmd, "%c", &hex); | |
93 | if (hex == 'h'){ | |
94 | PrintAndLog("Usage: data printdemodbuffer [x]"); | |
95 | PrintAndLog("Options: "); | |
96 | PrintAndLog(" h This help"); | |
97 | PrintAndLog(" x output in hex (omit for binary output)"); | |
98 | return 0; | |
99 | } | |
100 | if (hex == 'x'){ | |
101 | numBits = binarraytohex(printBuff, (char *)DemodBuffer, numBits); | |
102 | if (numBits==0) return 0; | |
103 | PrintAndLog("DemodBuffer: %s",printBuff); | |
104 | } else { | |
105 | printDemodBuff(); | |
106 | } | |
107 | return 1; | |
108 | } | |
109 | int CmdAmp(const char *Cmd) | |
110 | { | |
111 | int i, rising, falling; | |
112 | int max = INT_MIN, min = INT_MAX; | |
113 | ||
114 | for (i = 10; i < GraphTraceLen; ++i) { | |
115 | if (GraphBuffer[i] > max) | |
116 | max = GraphBuffer[i]; | |
117 | if (GraphBuffer[i] < min) | |
118 | min = GraphBuffer[i]; | |
119 | } | |
120 | ||
121 | if (max != min) { | |
122 | rising = falling= 0; | |
123 | for (i = 0; i < GraphTraceLen; ++i) { | |
124 | if (GraphBuffer[i + 1] < GraphBuffer[i]) { | |
125 | if (rising) { | |
126 | GraphBuffer[i] = max; | |
127 | rising = 0; | |
128 | } | |
129 | falling = 1; | |
130 | } | |
131 | if (GraphBuffer[i + 1] > GraphBuffer[i]) { | |
132 | if (falling) { | |
133 | GraphBuffer[i] = min; | |
134 | falling = 0; | |
135 | } | |
136 | rising= 1; | |
137 | } | |
138 | } | |
139 | } | |
140 | RepaintGraphWindow(); | |
141 | return 0; | |
142 | } | |
143 | ||
144 | /* | |
145 | * Generic command to demodulate ASK. | |
146 | * | |
147 | * Argument is convention: positive or negative (High mod means zero | |
148 | * or high mod means one) | |
149 | * | |
150 | * Updates the Graph trace with 0/1 values | |
151 | * | |
152 | * Arguments: | |
153 | * c : 0 or 1 (or invert) | |
154 | */ | |
155 | //this method ignores the clock | |
156 | ||
157 | //this function strictly converts highs and lows to 1s and 0s for each sample in the graphbuffer | |
158 | int Cmdaskdemod(const char *Cmd) | |
159 | { | |
160 | int i; | |
161 | int c, high = 0, low = 0; | |
162 | ||
163 | sscanf(Cmd, "%i", &c); | |
164 | ||
165 | /* Detect high and lows */ | |
166 | for (i = 0; i < GraphTraceLen; ++i) | |
167 | { | |
168 | if (GraphBuffer[i] > high) | |
169 | high = GraphBuffer[i]; | |
170 | else if (GraphBuffer[i] < low) | |
171 | low = GraphBuffer[i]; | |
172 | } | |
173 | high=abs(high*.75); | |
174 | low=abs(low*.75); | |
175 | if (c != 0 && c != 1) { | |
176 | PrintAndLog("Invalid argument: %s", Cmd); | |
177 | return 0; | |
178 | } | |
179 | //prime loop | |
180 | if (GraphBuffer[0] > 0) { | |
181 | GraphBuffer[0] = 1-c; | |
182 | } else { | |
183 | GraphBuffer[0] = c; | |
184 | } | |
185 | for (i = 1; i < GraphTraceLen; ++i) { | |
186 | /* Transitions are detected at each peak | |
187 | * Transitions are either: | |
188 | * - we're low: transition if we hit a high | |
189 | * - we're high: transition if we hit a low | |
190 | * (we need to do it this way because some tags keep high or | |
191 | * low for long periods, others just reach the peak and go | |
192 | * down) | |
193 | */ | |
194 | //[marhsmellow] change == to >= for high and <= for low for fuzz | |
195 | if ((GraphBuffer[i] >= high) && (GraphBuffer[i - 1] == c)) { | |
196 | GraphBuffer[i] = 1 - c; | |
197 | } else if ((GraphBuffer[i] <= low) && (GraphBuffer[i - 1] == (1 - c))){ | |
198 | GraphBuffer[i] = c; | |
199 | } else { | |
200 | /* No transition */ | |
201 | GraphBuffer[i] = GraphBuffer[i - 1]; | |
202 | } | |
203 | } | |
204 | RepaintGraphWindow(); | |
205 | return 0; | |
206 | } | |
207 | ||
208 | //this function strictly converts >1 to 1 and <1 to 0 for each sample in the graphbuffer | |
209 | int CmdGetBitStream(const char *Cmd) | |
210 | { | |
211 | int i; | |
212 | CmdHpf(Cmd); | |
213 | for (i = 0; i < GraphTraceLen; i++) { | |
214 | if (GraphBuffer[i] >= 1) { | |
215 | GraphBuffer[i] = 1; | |
216 | } else { | |
217 | GraphBuffer[i] = 0; | |
218 | } | |
219 | } | |
220 | RepaintGraphWindow(); | |
221 | return 0; | |
222 | } | |
223 | ||
224 | ||
225 | //by marshmellow | |
226 | void printBitStream(uint8_t BitStream[], uint32_t bitLen) | |
227 | { | |
228 | uint32_t i = 0; | |
229 | if (bitLen<16) { | |
230 | PrintAndLog("Too few bits found: %d",bitLen); | |
231 | return; | |
232 | } | |
233 | if (bitLen>512) bitLen=512; | |
234 | ||
235 | // ensure equally divided by 16 | |
236 | bitLen &= 0xfff0; | |
237 | ||
238 | ||
239 | for (i = 0; i <= (bitLen-16); i+=16) { | |
240 | PrintAndLog("%i%i%i%i%i%i%i%i%i%i%i%i%i%i%i%i", | |
241 | BitStream[i], | |
242 | BitStream[i+1], | |
243 | BitStream[i+2], | |
244 | BitStream[i+3], | |
245 | BitStream[i+4], | |
246 | BitStream[i+5], | |
247 | BitStream[i+6], | |
248 | BitStream[i+7], | |
249 | BitStream[i+8], | |
250 | BitStream[i+9], | |
251 | BitStream[i+10], | |
252 | BitStream[i+11], | |
253 | BitStream[i+12], | |
254 | BitStream[i+13], | |
255 | BitStream[i+14], | |
256 | BitStream[i+15]); | |
257 | } | |
258 | return; | |
259 | } | |
260 | //by marshmellow | |
261 | //print 64 bit EM410x ID in multiple formats | |
262 | void printEM410x(uint64_t id) | |
263 | { | |
264 | if (id !=0){ | |
265 | uint64_t iii=1; | |
266 | uint64_t id2lo=0; | |
267 | uint32_t ii=0; | |
268 | uint32_t i=0; | |
269 | for (ii=5; ii>0;ii--){ | |
270 | for (i=0;i<8;i++){ | |
271 | id2lo=(id2lo<<1LL) | ((id & (iii << (i+((ii-1)*8)))) >> (i+((ii-1)*8))); | |
272 | } | |
273 | } | |
274 | //output em id | |
275 | PrintAndLog("EM TAG ID : %010llx", id); | |
276 | PrintAndLog("Unique TAG ID: %010llx", id2lo); | |
277 | PrintAndLog("DEZ 8 : %08lld",id & 0xFFFFFF); | |
278 | PrintAndLog("DEZ 10 : %010lld",id & 0xFFFFFF); | |
279 | PrintAndLog("DEZ 5.5 : %05lld.%05lld",(id>>16LL) & 0xFFFF,(id & 0xFFFF)); | |
280 | PrintAndLog("DEZ 3.5A : %03lld.%05lld",(id>>32ll),(id & 0xFFFF)); | |
281 | PrintAndLog("DEZ 14/IK2 : %014lld",id); | |
282 | PrintAndLog("DEZ 15/IK3 : %015lld",id2lo); | |
283 | PrintAndLog("Other : %05lld_%03lld_%08lld",(id&0xFFFF),((id>>16LL) & 0xFF),(id & 0xFFFFFF)); | |
284 | } | |
285 | return; | |
286 | } | |
287 | ||
288 | //by marshmellow | |
289 | //takes 3 arguments - clock, invert and maxErr as integers | |
290 | //attempts to demodulate ask while decoding manchester | |
291 | //prints binary found and saves in graphbuffer for further commands | |
292 | int CmdAskEM410xDemod(const char *Cmd) | |
293 | { | |
294 | int invert=0; | |
295 | int clk=0; | |
296 | int maxErr=100; | |
297 | char cmdp = param_getchar(Cmd, 0); | |
298 | if (strlen(Cmd) > 10 || cmdp == 'h' || cmdp == 'H') { | |
299 | PrintAndLog("Usage: data askem410xdemod [clock] <0|1> [maxError]"); | |
300 | PrintAndLog(" [set clock as integer] optional, if not set, autodetect."); | |
301 | PrintAndLog(" <invert>, 1 for invert output"); | |
302 | PrintAndLog(" [set maximum allowed errors], default = 100."); | |
303 | PrintAndLog(""); | |
304 | PrintAndLog(" sample: data askem410xdemod = demod an EM410x Tag ID from GraphBuffer"); | |
305 | PrintAndLog(" : data askem410xdemod 32 = demod an EM410x Tag ID from GraphBuffer using a clock of RF/32"); | |
306 | PrintAndLog(" : data askem410xdemod 32 1 = demod an EM410x Tag ID from GraphBuffer using a clock of RF/32 and inverting data"); | |
307 | PrintAndLog(" : data askem410xdemod 1 = demod an EM410x Tag ID from GraphBuffer while inverting data"); | |
308 | PrintAndLog(" : data askem410xdemod 64 1 0 = demod an EM410x Tag ID from GraphBuffer using a clock of RF/64 and inverting data and allowing 0 demod errors"); | |
309 | ||
310 | return 0; | |
311 | } | |
312 | ||
313 | ||
314 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0}; | |
315 | sscanf(Cmd, "%i %i %i", &clk, &invert, &maxErr); | |
316 | if (invert != 0 && invert != 1) { | |
317 | PrintAndLog("Invalid argument: %s", Cmd); | |
318 | return 0; | |
319 | } | |
320 | size_t BitLen = getFromGraphBuf(BitStream); | |
321 | ||
322 | if (g_debugMode==1) PrintAndLog("DEBUG: Bitlen from grphbuff: %d",BitLen); | |
323 | if (BitLen==0) return 0; | |
324 | int errCnt=0; | |
325 | errCnt = askmandemod(BitStream, &BitLen, &clk, &invert, maxErr); | |
326 | if (errCnt<0||BitLen<16){ //if fatal error (or -1) | |
327 | if (g_debugMode==1) PrintAndLog("no data found %d, errors:%d, bitlen:%d, clock:%d",errCnt,invert,BitLen,clk); | |
328 | return 0; | |
329 | } | |
330 | PrintAndLog("\nUsing Clock: %d - Invert: %d - Bits Found: %d",clk,invert,BitLen); | |
331 | ||
332 | //output | |
333 | if (errCnt>0){ | |
334 | PrintAndLog("# Errors during Demoding (shown as 77 in bit stream): %d",errCnt); | |
335 | } | |
336 | //PrintAndLog("ASK/Manchester decoded bitstream:"); | |
337 | // Now output the bitstream to the scrollback by line of 16 bits | |
338 | setDemodBuf(BitStream,BitLen,0); | |
339 | //printDemodBuff(); | |
340 | uint64_t lo =0; | |
341 | size_t idx=0; | |
342 | lo = Em410xDecode(BitStream, &BitLen, &idx); | |
343 | if (lo>0){ | |
344 | //set GraphBuffer for clone or sim command | |
345 | setDemodBuf(BitStream, BitLen, idx); | |
346 | if (g_debugMode){ | |
347 | PrintAndLog("DEBUG: idx: %d, Len: %d, Printing Demod Buffer:", idx, BitLen); | |
348 | printDemodBuff(); | |
349 | } | |
350 | PrintAndLog("EM410x pattern found: "); | |
351 | if (BitLen > 64) PrintAndLog("\nWarning! Length not what is expected - Length: %d bits\n",BitLen); | |
352 | printEM410x(lo); | |
353 | return 1; | |
354 | } | |
355 | return 0; | |
356 | } | |
357 | ||
358 | int ASKmanDemod(const char *Cmd, bool verbose, bool emSearch) | |
359 | { | |
360 | int invert=0; | |
361 | int clk=0; | |
362 | int maxErr=100; | |
363 | ||
364 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0}; | |
365 | sscanf(Cmd, "%i %i %i", &clk, &invert, &maxErr); | |
366 | if (invert != 0 && invert != 1) { | |
367 | PrintAndLog("Invalid argument: %s", Cmd); | |
368 | return 0; | |
369 | } | |
370 | if (clk==1){ | |
371 | invert=1; | |
372 | clk=0; | |
373 | } | |
374 | size_t BitLen = getFromGraphBuf(BitStream); | |
375 | if (g_debugMode==1) PrintAndLog("DEBUG: Bitlen from grphbuff: %d",BitLen); | |
376 | if (BitLen==0) return 0; | |
377 | int errCnt=0; | |
378 | errCnt = askmandemod(BitStream, &BitLen, &clk, &invert, maxErr); | |
379 | if (errCnt<0||BitLen<16){ //if fatal error (or -1) | |
380 | if (g_debugMode==1) PrintAndLog("no data found %d, errors:%d, bitlen:%d, clock:%d",errCnt,invert,BitLen,clk); | |
381 | return 0; | |
382 | } | |
383 | if (verbose) PrintAndLog("\nUsing Clock: %d - Invert: %d - Bits Found: %d",clk,invert,BitLen); | |
384 | ||
385 | //output | |
386 | if (errCnt>0){ | |
387 | if (verbose) PrintAndLog("# Errors during Demoding (shown as 77 in bit stream): %d",errCnt); | |
388 | } | |
389 | if (verbose) PrintAndLog("ASK/Manchester decoded bitstream:"); | |
390 | // Now output the bitstream to the scrollback by line of 16 bits | |
391 | setDemodBuf(BitStream,BitLen,0); | |
392 | if (verbose) printDemodBuff(); | |
393 | uint64_t lo =0; | |
394 | size_t idx=0; | |
395 | if (emSearch){ | |
396 | lo = Em410xDecode(BitStream, &BitLen, &idx); | |
397 | if (lo>0){ | |
398 | //set GraphBuffer for clone or sim command | |
399 | setDemodBuf(BitStream, BitLen, idx); | |
400 | if (g_debugMode){ | |
401 | PrintAndLog("DEBUG: idx: %d, Len: %d, Printing Demod Buffer:", idx, BitLen); | |
402 | printDemodBuff(); | |
403 | } | |
404 | if (verbose) PrintAndLog("EM410x pattern found: "); | |
405 | if (verbose) printEM410x(lo); | |
406 | return 1; | |
407 | } | |
408 | } | |
409 | return 1; | |
410 | } | |
411 | ||
412 | //by marshmellow | |
413 | //takes 3 arguments - clock, invert, maxErr as integers | |
414 | //attempts to demodulate ask while decoding manchester | |
415 | //prints binary found and saves in graphbuffer for further commands | |
416 | int Cmdaskmandemod(const char *Cmd) | |
417 | { | |
418 | char cmdp = param_getchar(Cmd, 0); | |
419 | if (strlen(Cmd) > 10 || cmdp == 'h' || cmdp == 'H') { | |
420 | PrintAndLog("Usage: data rawdemod am [clock] <0|1> [maxError]"); | |
421 | PrintAndLog(" [set clock as integer] optional, if not set, autodetect."); | |
422 | PrintAndLog(" <invert>, 1 for invert output"); | |
423 | PrintAndLog(" [set maximum allowed errors], default = 100."); | |
424 | PrintAndLog(""); | |
425 | PrintAndLog(" sample: data rawdemod am = demod an ask/manchester tag from GraphBuffer"); | |
426 | PrintAndLog(" : data rawdemod am 32 = demod an ask/manchester tag from GraphBuffer using a clock of RF/32"); | |
427 | PrintAndLog(" : data rawdemod am 32 1 = demod an ask/manchester tag from GraphBuffer using a clock of RF/32 and inverting data"); | |
428 | PrintAndLog(" : data rawdemod am 1 = demod an ask/manchester tag from GraphBuffer while inverting data"); | |
429 | PrintAndLog(" : data rawdemod am 64 1 0 = demod an ask/manchester tag from GraphBuffer using a clock of RF/64, inverting data and allowing 0 demod errors"); | |
430 | return 0; | |
431 | } | |
432 | return ASKmanDemod(Cmd, TRUE, TRUE); | |
433 | } | |
434 | ||
435 | //by marshmellow | |
436 | //manchester decode | |
437 | //stricktly take 10 and 01 and convert to 0 and 1 | |
438 | int Cmdmandecoderaw(const char *Cmd) | |
439 | { | |
440 | int i =0; | |
441 | int errCnt=0; | |
442 | size_t size=0; | |
443 | size_t maxErr = 20; | |
444 | char cmdp = param_getchar(Cmd, 0); | |
445 | if (strlen(Cmd) > 1 || cmdp == 'h' || cmdp == 'H') { | |
446 | PrintAndLog("Usage: data manrawdecode"); | |
447 | PrintAndLog(" Takes 10 and 01 and converts to 0 and 1 respectively"); | |
448 | PrintAndLog(" --must have binary sequence in demodbuffer (run data askrawdemod first)"); | |
449 | PrintAndLog(""); | |
450 | PrintAndLog(" sample: data manrawdecode = decode manchester bitstream from the demodbuffer"); | |
451 | return 0; | |
452 | } | |
453 | if (DemodBufferLen==0) return 0; | |
454 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0}; | |
455 | int high=0,low=0; | |
456 | for (;i<DemodBufferLen;++i){ | |
457 | if (DemodBuffer[i]>high) high=DemodBuffer[i]; | |
458 | else if(DemodBuffer[i]<low) low=DemodBuffer[i]; | |
459 | BitStream[i]=DemodBuffer[i]; | |
460 | } | |
461 | if (high>1 || low <0 ){ | |
462 | PrintAndLog("Error: please raw demod the wave first then mancheseter raw decode"); | |
463 | return 0; | |
464 | } | |
465 | size=i; | |
466 | errCnt=manrawdecode(BitStream, &size); | |
467 | if (errCnt>=maxErr){ | |
468 | PrintAndLog("Too many errors: %d",errCnt); | |
469 | return 0; | |
470 | } | |
471 | PrintAndLog("Manchester Decoded - # errors:%d - data:",errCnt); | |
472 | printBitStream(BitStream, size); | |
473 | if (errCnt==0){ | |
474 | uint64_t id = 0; | |
475 | size_t idx=0; | |
476 | id = Em410xDecode(BitStream, &size, &idx); | |
477 | if (id>0){ | |
478 | //need to adjust to set bitstream back to manchester encoded data | |
479 | //setDemodBuf(BitStream, size, idx); | |
480 | ||
481 | printEM410x(id); | |
482 | } | |
483 | } | |
484 | return 1; | |
485 | } | |
486 | ||
487 | //by marshmellow | |
488 | //biphase decode | |
489 | //take 01 or 10 = 0 and 11 or 00 = 1 | |
490 | //takes 2 arguments "offset" default = 0 if 1 it will shift the decode by one bit | |
491 | // and "invert" default = 0 if 1 it will invert output | |
492 | // since it is not like manchester and doesn't have an incorrect bit pattern we | |
493 | // cannot determine if our decode is correct or if it should be shifted by one bit | |
494 | // the argument offset allows us to manually shift if the output is incorrect | |
495 | // (better would be to demod and decode at the same time so we can distinguish large | |
496 | // width waves vs small width waves to help the decode positioning) or askbiphdemod | |
497 | int CmdBiphaseDecodeRaw(const char *Cmd) | |
498 | { | |
499 | int i = 0; | |
500 | int errCnt=0; | |
501 | size_t size=0; | |
502 | int offset=0; | |
503 | int invert=0; | |
504 | int high=0, low=0; | |
505 | char cmdp = param_getchar(Cmd, 0); | |
506 | if (strlen(Cmd) > 3 || cmdp == 'h' || cmdp == 'H') { | |
507 | PrintAndLog("Usage: data biphaserawdecode [offset] <invert>"); | |
508 | PrintAndLog(" Converts 10 or 01 to 0 and 11 or 00 to 1"); | |
509 | PrintAndLog(" --must have binary sequence in demodbuffer (run data askrawdemod first)"); | |
510 | PrintAndLog(""); | |
511 | PrintAndLog(" [offset <0|1>], set to 0 not to adjust start position or to 1 to adjust decode start position"); | |
512 | PrintAndLog(" [invert <0|1>], set to 1 to invert output"); | |
513 | PrintAndLog(""); | |
514 | PrintAndLog(" sample: data biphaserawdecode = decode biphase bitstream from the demodbuffer"); | |
515 | PrintAndLog(" sample: data biphaserawdecode 1 1 = decode biphase bitstream from the demodbuffer, set offset, and invert output"); | |
516 | return 0; | |
517 | } | |
518 | sscanf(Cmd, "%i %i", &offset, &invert); | |
519 | if (DemodBufferLen==0) return 0; | |
520 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0}; | |
521 | //get graphbuffer & high and low | |
522 | for (;i<DemodBufferLen;++i){ | |
523 | if(DemodBuffer[i]>high)high=DemodBuffer[i]; | |
524 | else if(DemodBuffer[i]<low)low=DemodBuffer[i]; | |
525 | BitStream[i]=DemodBuffer[i]; | |
526 | } | |
527 | if (high>1 || low <0){ | |
528 | PrintAndLog("Error: please raw demod the wave first then decode"); | |
529 | return 0; | |
530 | } | |
531 | size=i; | |
532 | errCnt=BiphaseRawDecode(BitStream, &size, offset, invert); | |
533 | if (errCnt>=20){ | |
534 | PrintAndLog("Too many errors attempting to decode: %d",errCnt); | |
535 | return 0; | |
536 | } | |
537 | PrintAndLog("Biphase Decoded using offset: %d - # errors:%d - data:",offset,errCnt); | |
538 | printBitStream(BitStream, size); | |
539 | PrintAndLog("\nif bitstream does not look right try offset=1"); | |
540 | if (offset == 1) setDemodBuf(DemodBuffer,DemodBufferLen-1,1); //remove first bit from raw demod | |
541 | return 1; | |
542 | } | |
543 | ||
544 | // set demod buffer back to raw after biphase demod | |
545 | void setBiphaseDemodBuf(uint8_t *BitStream, size_t size) | |
546 | { | |
547 | uint8_t rawStream[512]={0x00}; | |
548 | size_t i=0; | |
549 | uint8_t curPhase=0; | |
550 | if (size > 256) { | |
551 | PrintAndLog("ERROR - Biphase Demod Buffer overrun"); | |
552 | return; | |
553 | } | |
554 | for (size_t idx=0; idx<size; idx++){ | |
555 | if(!BitStream[idx]){ | |
556 | rawStream[i++] = curPhase; | |
557 | rawStream[i++] = curPhase; | |
558 | curPhase ^= 1; | |
559 | } else { | |
560 | rawStream[i++] = curPhase; | |
561 | rawStream[i++] = curPhase ^ 1; | |
562 | } | |
563 | } | |
564 | setDemodBuf(rawStream,i,0); | |
565 | return; | |
566 | } | |
567 | //by marshmellow | |
568 | //takes 4 arguments - clock, invert, maxErr as integers and amplify as char | |
569 | //attempts to demodulate ask only | |
570 | //prints binary found and saves in graphbuffer for further commands | |
571 | int ASKrawDemod(const char *Cmd, bool verbose) | |
572 | { | |
573 | int invert=0; | |
574 | int clk=0; | |
575 | int maxErr=100; | |
576 | uint8_t askAmp = 0; | |
577 | char amp = param_getchar(Cmd, 0); | |
578 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0}; | |
579 | sscanf(Cmd, "%i %i %i %c", &clk, &invert, &maxErr, &); | |
580 | if (invert != 0 && invert != 1) { | |
581 | if (verbose) PrintAndLog("Invalid argument: %s", Cmd); | |
582 | return 0; | |
583 | } | |
584 | if (clk==1){ | |
585 | invert=1; | |
586 | clk=0; | |
587 | } | |
588 | if (amp == 'a' || amp == 'A') askAmp=1; | |
589 | size_t BitLen = getFromGraphBuf(BitStream); | |
590 | if (BitLen==0) return 0; | |
591 | int errCnt=0; | |
592 | errCnt = askrawdemod(BitStream, &BitLen, &clk, &invert, maxErr, askAmp); | |
593 | if (errCnt==-1||BitLen<16){ //throw away static - allow 1 and -1 (in case of threshold command first) | |
594 | if (verbose) PrintAndLog("no data found"); | |
595 | if (g_debugMode==1 && verbose) PrintAndLog("errCnt: %d, BitLen: %d, clk: %d, invert: %d", errCnt, BitLen, clk, invert); | |
596 | return 0; | |
597 | } | |
598 | if (verbose) PrintAndLog("Using Clock: %d - invert: %d - Bits Found: %d", clk, invert, BitLen); | |
599 | ||
600 | //move BitStream back to DemodBuffer | |
601 | setDemodBuf(BitStream,BitLen,0); | |
602 | ||
603 | //output | |
604 | if (errCnt>0 && verbose){ | |
605 | PrintAndLog("# Errors during Demoding (shown as 77 in bit stream): %d", errCnt); | |
606 | } | |
607 | if (verbose){ | |
608 | PrintAndLog("ASK demoded bitstream:"); | |
609 | // Now output the bitstream to the scrollback by line of 16 bits | |
610 | printBitStream(BitStream,BitLen); | |
611 | } | |
612 | return 1; | |
613 | } | |
614 | ||
615 | //by marshmellow | |
616 | //attempts to demodulate and identify a G_Prox_II verex/chubb card | |
617 | //WARNING: if it fails during some points it will destroy the DemodBuffer data | |
618 | // but will leave the GraphBuffer intact. | |
619 | //if successful it will push askraw data back to demod buffer ready for emulation | |
620 | int CmdG_Prox_II_Demod(const char *Cmd) | |
621 | { | |
622 | int ans = ASKrawDemod(Cmd, FALSE); | |
623 | if (ans <= 0) { | |
624 | if (g_debugMode) PrintAndLog("Error AskrawDemod: %d",ans); | |
625 | return ans; | |
626 | } | |
627 | size_t size = DemodBufferLen; | |
628 | ans = BiphaseRawDecode(DemodBuffer, &size, 0, 0); | |
629 | if (ans !=0) { | |
630 | if (g_debugMode) PrintAndLog("Error BiphaseRawDecode: %d",ans); | |
631 | return ans; | |
632 | } | |
633 | //call lfdemod.c demod for gProxII | |
634 | ans = gProxII_Demod(DemodBuffer, &size); | |
635 | if (ans < 0){ | |
636 | if (g_debugMode) PrintAndLog("Error gProxII_Demod 1st Try: %d",ans); | |
637 | //try biphase again | |
638 | ans = BiphaseRawDecode(DemodBuffer, &size, 1, 0); | |
639 | if (ans != 0) { | |
640 | if (g_debugMode) PrintAndLog("Error BiphaseRawDecode: %d",ans); | |
641 | return ans; | |
642 | } | |
643 | ans = gProxII_Demod(DemodBuffer, &size); | |
644 | if (ans < 0) { | |
645 | if (g_debugMode) PrintAndLog("Error gProxII_Demod 1st Try: %d",ans); | |
646 | return ans; | |
647 | } | |
648 | } | |
649 | //got a good demod | |
650 | uint32_t ByteStream[65] = {0x00}; | |
651 | uint8_t xorKey=0; | |
652 | uint8_t keyCnt=0; | |
653 | uint8_t bitCnt=0; | |
654 | uint8_t ByteCnt=0; | |
655 | size_t startIdx = ans + 6; //start after preamble | |
656 | for (size_t idx = 0; idx<size-6; idx++){ | |
657 | if ((idx+1) % 5 == 0){ | |
658 | //spacer bit - should be 0 | |
659 | if (DemodBuffer[startIdx+idx] != 0) { | |
660 | if (g_debugMode) PrintAndLog("Error spacer not 0: %d, pos: %d",DemodBuffer[startIdx+idx],startIdx+idx); | |
661 | return -1; | |
662 | } | |
663 | continue; | |
664 | } | |
665 | if (keyCnt<8){ //lsb first | |
666 | xorKey = xorKey | (DemodBuffer[startIdx+idx]<<keyCnt); | |
667 | keyCnt++; | |
668 | if (keyCnt==8 && g_debugMode) PrintAndLog("xorKey Found: %02x", xorKey); | |
669 | continue; | |
670 | } | |
671 | //lsb first | |
672 | ByteStream[ByteCnt] = ByteStream[ByteCnt] | (DemodBuffer[startIdx+idx]<<bitCnt); | |
673 | bitCnt++; | |
674 | if (bitCnt % 8 == 0){ | |
675 | if (g_debugMode) PrintAndLog("byte %d: %02x",ByteCnt,ByteStream[ByteCnt]); | |
676 | bitCnt=0; | |
677 | ByteCnt++; | |
678 | } | |
679 | } | |
680 | for (uint8_t i = 0; i < ByteCnt; i++){ | |
681 | ByteStream[i] ^= xorKey; //xor | |
682 | if (g_debugMode) PrintAndLog("byte %d after xor: %02x", i, ByteStream[i]); | |
683 | } | |
684 | //now ByteStream contains 64 bytes of decrypted raw tag data | |
685 | // | |
686 | uint8_t fmtLen = ByteStream[0]>>2; | |
687 | uint32_t FC = 0; | |
688 | uint32_t Card = 0; | |
689 | uint32_t raw1 = bytebits_to_byte(DemodBuffer+ans,32); | |
690 | uint32_t raw2 = bytebits_to_byte(DemodBuffer+ans+32, 32); | |
691 | uint32_t raw3 = bytebits_to_byte(DemodBuffer+ans+64, 32); | |
692 | ||
693 | if (fmtLen==36){ | |
694 | FC = ((ByteStream[3] & 0x7F)<<7) | (ByteStream[4]>>1); | |
695 | Card = ((ByteStream[4]&1)<<19) | (ByteStream[5]<<11) | (ByteStream[6]<<3) | (ByteStream[7]>>5); | |
696 | PrintAndLog("G-Prox-II Found: FmtLen %d, FC %d, Card %d",fmtLen,FC,Card); | |
697 | } else if(fmtLen==26){ | |
698 | FC = ((ByteStream[3] & 0x7F)<<1) | (ByteStream[4]>>7); | |
699 | Card = ((ByteStream[4]&0x7F)<<9) | (ByteStream[5]<<1) | (ByteStream[6]>>7); | |
700 | PrintAndLog("G-Prox-II Found: FmtLen %d, FC %d, Card %d",fmtLen,FC,Card); | |
701 | } else { | |
702 | PrintAndLog("Unknown G-Prox-II Fmt Found: FmtLen %d",fmtLen); | |
703 | } | |
704 | PrintAndLog("Raw: %08x%08x%08x", raw1,raw2,raw3); | |
705 | setBiphaseDemodBuf(DemodBuffer+ans, 96); | |
706 | return 1; | |
707 | } | |
708 | ||
709 | //by marshmellow - see ASKrawDemod | |
710 | int Cmdaskrawdemod(const char *Cmd) | |
711 | { | |
712 | char cmdp = param_getchar(Cmd, 0); | |
713 | if (strlen(Cmd) > 12 || cmdp == 'h' || cmdp == 'H') { | |
714 | PrintAndLog("Usage: data rawdemod ar [clock] <invert> [maxError] [amplify]"); | |
715 | PrintAndLog(" [set clock as integer] optional, if not set, autodetect"); | |
716 | PrintAndLog(" <invert>, 1 to invert output"); | |
717 | PrintAndLog(" [set maximum allowed errors], default = 100"); | |
718 | PrintAndLog(" <amplify>, 'a' to attempt demod with ask amplification, default = no amp"); | |
719 | PrintAndLog(""); | |
720 | PrintAndLog(" sample: data rawdemod ar = demod an ask tag from GraphBuffer"); | |
721 | PrintAndLog(" : data rawdemod ar a = demod an ask tag from GraphBuffer, amplified"); | |
722 | PrintAndLog(" : data rawdemod ar 32 = demod an ask tag from GraphBuffer using a clock of RF/32"); | |
723 | PrintAndLog(" : data rawdemod ar 32 1 = demod an ask tag from GraphBuffer using a clock of RF/32 and inverting data"); | |
724 | PrintAndLog(" : data rawdemod ar 1 = demod an ask tag from GraphBuffer while inverting data"); | |
725 | PrintAndLog(" : data rawdemod ar 64 1 0 = demod an ask tag from GraphBuffer using a clock of RF/64, inverting data and allowing 0 demod errors"); | |
726 | PrintAndLog(" : data rawdemod ar 64 1 0 a = demod an ask tag from GraphBuffer using a clock of RF/64, inverting data and allowing 0 demod errors, and amp"); | |
727 | return 0; | |
728 | } | |
729 | return ASKrawDemod(Cmd, TRUE); | |
730 | } | |
731 | ||
732 | int CmdAutoCorr(const char *Cmd) | |
733 | { | |
734 | static int CorrelBuffer[MAX_GRAPH_TRACE_LEN]; | |
735 | ||
736 | int window = atoi(Cmd); | |
737 | ||
738 | if (window == 0) { | |
739 | PrintAndLog("needs a window"); | |
740 | return 0; | |
741 | } | |
742 | if (window >= GraphTraceLen) { | |
743 | PrintAndLog("window must be smaller than trace (%d samples)", | |
744 | GraphTraceLen); | |
745 | return 0; | |
746 | } | |
747 | ||
748 | PrintAndLog("performing %d correlations", GraphTraceLen - window); | |
749 | ||
750 | for (int i = 0; i < GraphTraceLen - window; ++i) { | |
751 | int sum = 0; | |
752 | for (int j = 0; j < window; ++j) { | |
753 | sum += (GraphBuffer[j]*GraphBuffer[i + j]) / 256; | |
754 | } | |
755 | CorrelBuffer[i] = sum; | |
756 | } | |
757 | GraphTraceLen = GraphTraceLen - window; | |
758 | memcpy(GraphBuffer, CorrelBuffer, GraphTraceLen * sizeof (int)); | |
759 | ||
760 | RepaintGraphWindow(); | |
761 | return 0; | |
762 | } | |
763 | ||
764 | int CmdBitsamples(const char *Cmd) | |
765 | { | |
766 | int cnt = 0; | |
767 | uint8_t got[12288]; | |
768 | ||
769 | GetFromBigBuf(got,sizeof(got),0); | |
770 | WaitForResponse(CMD_ACK,NULL); | |
771 | ||
772 | for (int j = 0; j < sizeof(got); j++) { | |
773 | for (int k = 0; k < 8; k++) { | |
774 | if(got[j] & (1 << (7 - k))) { | |
775 | GraphBuffer[cnt++] = 1; | |
776 | } else { | |
777 | GraphBuffer[cnt++] = 0; | |
778 | } | |
779 | } | |
780 | } | |
781 | GraphTraceLen = cnt; | |
782 | RepaintGraphWindow(); | |
783 | return 0; | |
784 | } | |
785 | ||
786 | /* | |
787 | * Convert to a bitstream | |
788 | */ | |
789 | int CmdBitstream(const char *Cmd) | |
790 | { | |
791 | int i, j; | |
792 | int bit; | |
793 | int gtl; | |
794 | int clock; | |
795 | int low = 0; | |
796 | int high = 0; | |
797 | int hithigh, hitlow, first; | |
798 | ||
799 | /* Detect high and lows and clock */ | |
800 | for (i = 0; i < GraphTraceLen; ++i) | |
801 | { | |
802 | if (GraphBuffer[i] > high) | |
803 | high = GraphBuffer[i]; | |
804 | else if (GraphBuffer[i] < low) | |
805 | low = GraphBuffer[i]; | |
806 | } | |
807 | ||
808 | /* Get our clock */ | |
809 | clock = GetAskClock(Cmd, high, 1); | |
810 | gtl = ClearGraph(0); | |
811 | ||
812 | bit = 0; | |
813 | for (i = 0; i < (int)(gtl / clock); ++i) | |
814 | { | |
815 | hithigh = 0; | |
816 | hitlow = 0; | |
817 | first = 1; | |
818 | /* Find out if we hit both high and low peaks */ | |
819 | for (j = 0; j < clock; ++j) | |
820 | { | |
821 | if (GraphBuffer[(i * clock) + j] == high) | |
822 | hithigh = 1; | |
823 | else if (GraphBuffer[(i * clock) + j] == low) | |
824 | hitlow = 1; | |
825 | /* it doesn't count if it's the first part of our read | |
826 | because it's really just trailing from the last sequence */ | |
827 | if (first && (hithigh || hitlow)) | |
828 | hithigh = hitlow = 0; | |
829 | else | |
830 | first = 0; | |
831 | ||
832 | if (hithigh && hitlow) | |
833 | break; | |
834 | } | |
835 | ||
836 | /* If we didn't hit both high and low peaks, we had a bit transition */ | |
837 | if (!hithigh || !hitlow) | |
838 | bit ^= 1; | |
839 | ||
840 | AppendGraph(0, clock, bit); | |
841 | } | |
842 | ||
843 | RepaintGraphWindow(); | |
844 | return 0; | |
845 | } | |
846 | ||
847 | int CmdBuffClear(const char *Cmd) | |
848 | { | |
849 | UsbCommand c = {CMD_BUFF_CLEAR}; | |
850 | SendCommand(&c); | |
851 | ClearGraph(true); | |
852 | return 0; | |
853 | } | |
854 | ||
855 | int CmdDec(const char *Cmd) | |
856 | { | |
857 | for (int i = 0; i < (GraphTraceLen / 2); ++i) | |
858 | GraphBuffer[i] = GraphBuffer[i * 2]; | |
859 | GraphTraceLen /= 2; | |
860 | PrintAndLog("decimated by 2"); | |
861 | RepaintGraphWindow(); | |
862 | return 0; | |
863 | } | |
864 | /** | |
865 | * Undecimate - I'd call it 'interpolate', but we'll save that | |
866 | * name until someone does an actual interpolation command, not just | |
867 | * blindly repeating samples | |
868 | * @param Cmd | |
869 | * @return | |
870 | */ | |
871 | int CmdUndec(const char *Cmd) | |
872 | { | |
873 | if(param_getchar(Cmd, 0) == 'h') | |
874 | { | |
875 | PrintAndLog("Usage: data undec [factor]"); | |
876 | PrintAndLog("This function performs un-decimation, by repeating each sample N times"); | |
877 | PrintAndLog("Options: "); | |
878 | PrintAndLog(" h This help"); | |
879 | PrintAndLog(" factor The number of times to repeat each sample.[default:2]"); | |
880 | PrintAndLog("Example: 'data undec 3'"); | |
881 | return 0; | |
882 | } | |
883 | ||
884 | uint8_t factor = param_get8ex(Cmd, 0,2, 10); | |
885 | //We have memory, don't we? | |
886 | int swap[MAX_GRAPH_TRACE_LEN] = { 0 }; | |
887 | uint32_t g_index = 0 ,s_index = 0; | |
888 | while(g_index < GraphTraceLen && s_index < MAX_GRAPH_TRACE_LEN) | |
889 | { | |
890 | int count = 0; | |
891 | for(count = 0; count < factor && s_index+count < MAX_GRAPH_TRACE_LEN; count ++) | |
892 | swap[s_index+count] = GraphBuffer[g_index]; | |
893 | s_index+=count; | |
894 | } | |
895 | ||
896 | memcpy(GraphBuffer,swap, s_index * sizeof(int)); | |
897 | GraphTraceLen = s_index; | |
898 | RepaintGraphWindow(); | |
899 | return 0; | |
900 | } | |
901 | ||
902 | //by marshmellow | |
903 | //shift graph zero up or down based on input + or - | |
904 | int CmdGraphShiftZero(const char *Cmd) | |
905 | { | |
906 | ||
907 | int shift=0; | |
908 | //set options from parameters entered with the command | |
909 | sscanf(Cmd, "%i", &shift); | |
910 | int shiftedVal=0; | |
911 | for(int i = 0; i<GraphTraceLen; i++){ | |
912 | shiftedVal=GraphBuffer[i]+shift; | |
913 | if (shiftedVal>127) | |
914 | shiftedVal=127; | |
915 | else if (shiftedVal<-127) | |
916 | shiftedVal=-127; | |
917 | GraphBuffer[i]= shiftedVal; | |
918 | } | |
919 | CmdNorm(""); | |
920 | return 0; | |
921 | } | |
922 | ||
923 | //by marshmellow | |
924 | //use large jumps in read samples to identify edges of waves and then amplify that wave to max | |
925 | //similar to dirtheshold, threshold, and askdemod commands | |
926 | //takes a threshold length which is the measured length between two samples then determines an edge | |
927 | int CmdAskEdgeDetect(const char *Cmd) | |
928 | { | |
929 | int thresLen = 25; | |
930 | sscanf(Cmd, "%i", &thresLen); | |
931 | int shift = 127; | |
932 | int shiftedVal=0; | |
933 | for(int i = 1; i<GraphTraceLen; i++){ | |
934 | if (GraphBuffer[i]-GraphBuffer[i-1]>=thresLen) //large jump up | |
935 | shift=127; | |
936 | else if(GraphBuffer[i]-GraphBuffer[i-1]<=-1*thresLen) //large jump down | |
937 | shift=-127; | |
938 | ||
939 | shiftedVal=GraphBuffer[i]+shift; | |
940 | ||
941 | if (shiftedVal>127) | |
942 | shiftedVal=127; | |
943 | else if (shiftedVal<-127) | |
944 | shiftedVal=-127; | |
945 | GraphBuffer[i-1] = shiftedVal; | |
946 | } | |
947 | RepaintGraphWindow(); | |
948 | //CmdNorm(""); | |
949 | return 0; | |
950 | } | |
951 | ||
952 | /* Print our clock rate */ | |
953 | // uses data from graphbuffer | |
954 | // adjusted to take char parameter for type of modulation to find the clock - by marshmellow. | |
955 | int CmdDetectClockRate(const char *Cmd) | |
956 | { | |
957 | char cmdp = param_getchar(Cmd, 0); | |
958 | if (strlen(Cmd) > 3 || strlen(Cmd) == 0 || cmdp == 'h' || cmdp == 'H') { | |
959 | PrintAndLog("Usage: data detectclock [modulation]"); | |
960 | PrintAndLog(" [modulation as char], specify the modulation type you want to detect the clock of"); | |
961 | PrintAndLog(" 'a' = ask, 'f' = fsk, 'n' = nrz/direct, 'p' = psk"); | |
962 | PrintAndLog(""); | |
963 | PrintAndLog(" sample: data detectclock a = detect the clock of an ask modulated wave in the GraphBuffer"); | |
964 | PrintAndLog(" data detectclock f = detect the clock of an fsk modulated wave in the GraphBuffer"); | |
965 | PrintAndLog(" data detectclock p = detect the clock of an psk modulated wave in the GraphBuffer"); | |
966 | PrintAndLog(" data detectclock n = detect the clock of an nrz/direct modulated wave in the GraphBuffer"); | |
967 | } | |
968 | int ans=0; | |
969 | if (cmdp == 'a'){ | |
970 | ans = GetAskClock("", true, false); | |
971 | } else if (cmdp == 'f'){ | |
972 | ans = GetFskClock("", true, false); | |
973 | } else if (cmdp == 'n'){ | |
974 | ans = GetNrzClock("", true, false); | |
975 | } else if (cmdp == 'p'){ | |
976 | ans = GetPskClock("", true, false); | |
977 | } else { | |
978 | PrintAndLog ("Please specify a valid modulation to detect the clock of - see option h for help"); | |
979 | } | |
980 | return ans; | |
981 | } | |
982 | ||
983 | //by marshmellow | |
984 | //fsk raw demod and print binary | |
985 | //takes 4 arguments - Clock, invert, fchigh, fclow | |
986 | //defaults: clock = 50, invert=1, fchigh=10, fclow=8 (RF/10 RF/8 (fsk2a)) | |
987 | int FSKrawDemod(const char *Cmd, bool verbose) | |
988 | { | |
989 | //raw fsk demod no manchester decoding no start bit finding just get binary from wave | |
990 | //set defaults | |
991 | int rfLen = 0; | |
992 | int invert = 0; | |
993 | int fchigh = 0; | |
994 | int fclow = 0; | |
995 | ||
996 | //set options from parameters entered with the command | |
997 | sscanf(Cmd, "%i %i %i %i", &rfLen, &invert, &fchigh, &fclow); | |
998 | ||
999 | if (strlen(Cmd)>0 && strlen(Cmd)<=2) { | |
1000 | if (rfLen==1){ | |
1001 | invert=1; //if invert option only is used | |
1002 | rfLen = 0; | |
1003 | } | |
1004 | } | |
1005 | ||
1006 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0}; | |
1007 | size_t BitLen = getFromGraphBuf(BitStream); | |
1008 | if (BitLen==0) return 0; | |
1009 | //get field clock lengths | |
1010 | uint16_t fcs=0; | |
1011 | uint8_t dummy=0; | |
1012 | if (fchigh==0 || fclow == 0){ | |
1013 | fcs = countFC(BitStream, BitLen, &dummy); | |
1014 | if (fcs==0){ | |
1015 | fchigh=10; | |
1016 | fclow=8; | |
1017 | }else{ | |
1018 | fchigh = (fcs >> 8) & 0xFF; | |
1019 | fclow = fcs & 0xFF; | |
1020 | } | |
1021 | } | |
1022 | //get bit clock length | |
1023 | if (rfLen==0){ | |
1024 | rfLen = detectFSKClk(BitStream, BitLen, fchigh, fclow); | |
1025 | if (rfLen == 0) rfLen = 50; | |
1026 | } | |
1027 | if (verbose) PrintAndLog("Args invert: %d - Clock:%d - fchigh:%d - fclow: %d",invert,rfLen,fchigh, fclow); | |
1028 | int size = fskdemod(BitStream,BitLen,(uint8_t)rfLen,(uint8_t)invert,(uint8_t)fchigh,(uint8_t)fclow); | |
1029 | if (size>0){ | |
1030 | setDemodBuf(BitStream,size,0); | |
1031 | ||
1032 | // Now output the bitstream to the scrollback by line of 16 bits | |
1033 | if(size > (8*32)+2) size = (8*32)+2; //only output a max of 8 blocks of 32 bits most tags will have full bit stream inside that sample size | |
1034 | if (verbose) { | |
1035 | PrintAndLog("FSK decoded bitstream:"); | |
1036 | printBitStream(BitStream,size); | |
1037 | } | |
1038 | ||
1039 | return 1; | |
1040 | } else{ | |
1041 | if (verbose) PrintAndLog("no FSK data found"); | |
1042 | } | |
1043 | return 0; | |
1044 | } | |
1045 | ||
1046 | //by marshmellow | |
1047 | //fsk raw demod and print binary | |
1048 | //takes 4 arguments - Clock, invert, fchigh, fclow | |
1049 | //defaults: clock = 50, invert=1, fchigh=10, fclow=8 (RF/10 RF/8 (fsk2a)) | |
1050 | int CmdFSKrawdemod(const char *Cmd) | |
1051 | { | |
1052 | char cmdp = param_getchar(Cmd, 0); | |
1053 | if (strlen(Cmd) > 10 || cmdp == 'h' || cmdp == 'H') { | |
1054 | PrintAndLog("Usage: data rawdemod fs [clock] <invert> [fchigh] [fclow]"); | |
1055 | PrintAndLog(" [set clock as integer] optional, omit for autodetect."); | |
1056 | PrintAndLog(" <invert>, 1 for invert output, can be used even if the clock is omitted"); | |
1057 | PrintAndLog(" [fchigh], larger field clock length, omit for autodetect"); | |
1058 | PrintAndLog(" [fclow], small field clock length, omit for autodetect"); | |
1059 | PrintAndLog(""); | |
1060 | PrintAndLog(" sample: data rawdemod fs = demod an fsk tag from GraphBuffer using autodetect"); | |
1061 | PrintAndLog(" : data rawdemod fs 32 = demod an fsk tag from GraphBuffer using a clock of RF/32, autodetect fc"); | |
1062 | PrintAndLog(" : data rawdemod fs 1 = demod an fsk tag from GraphBuffer using autodetect, invert output"); | |
1063 | PrintAndLog(" : data rawdemod fs 32 1 = demod an fsk tag from GraphBuffer using a clock of RF/32, invert output, autodetect fc"); | |
1064 | PrintAndLog(" : data rawdemod fs 64 0 8 5 = demod an fsk1 RF/64 tag from GraphBuffer"); | |
1065 | PrintAndLog(" : data rawdemod fs 50 0 10 8 = demod an fsk2 RF/50 tag from GraphBuffer"); | |
1066 | PrintAndLog(" : data rawdemod fs 50 1 10 8 = demod an fsk2a RF/50 tag from GraphBuffer"); | |
1067 | return 0; | |
1068 | } | |
1069 | return FSKrawDemod(Cmd, TRUE); | |
1070 | } | |
1071 | ||
1072 | //by marshmellow (based on existing demod + holiman's refactor) | |
1073 | //HID Prox demod - FSK RF/50 with preamble of 00011101 (then manchester encoded) | |
1074 | //print full HID Prox ID and some bit format details if found | |
1075 | int CmdFSKdemodHID(const char *Cmd) | |
1076 | { | |
1077 | //raw fsk demod no manchester decoding no start bit finding just get binary from wave | |
1078 | uint32_t hi2=0, hi=0, lo=0; | |
1079 | ||
1080 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0}; | |
1081 | size_t BitLen = getFromGraphBuf(BitStream); | |
1082 | if (BitLen==0) return 0; | |
1083 | //get binary from fsk wave | |
1084 | int idx = HIDdemodFSK(BitStream,&BitLen,&hi2,&hi,&lo); | |
1085 | if (idx<0){ | |
1086 | if (g_debugMode){ | |
1087 | if (idx==-1){ | |
1088 | PrintAndLog("DEBUG: Just Noise Detected"); | |
1089 | } else if (idx == -2) { | |
1090 | PrintAndLog("DEBUG: Error demoding fsk"); | |
1091 | } else if (idx == -3) { | |
1092 | PrintAndLog("DEBUG: Preamble not found"); | |
1093 | } else if (idx == -4) { | |
1094 | PrintAndLog("DEBUG: Error in Manchester data, SIZE: %d", BitLen); | |
1095 | } else { | |
1096 | PrintAndLog("DEBUG: Error demoding fsk %d", idx); | |
1097 | } | |
1098 | } | |
1099 | return 0; | |
1100 | } | |
1101 | if (hi2==0 && hi==0 && lo==0) { | |
1102 | if (g_debugMode) PrintAndLog("DEBUG: Error - no values found"); | |
1103 | return 0; | |
1104 | } | |
1105 | if (hi2 != 0){ //extra large HID tags | |
1106 | PrintAndLog("HID Prox TAG ID: %x%08x%08x (%d)", | |
1107 | (unsigned int) hi2, (unsigned int) hi, (unsigned int) lo, (unsigned int) (lo>>1) & 0xFFFF); | |
1108 | } | |
1109 | else { //standard HID tags <38 bits | |
1110 | uint8_t fmtLen = 0; | |
1111 | uint32_t fc = 0; | |
1112 | uint32_t cardnum = 0; | |
1113 | if (((hi>>5)&1)==1){//if bit 38 is set then < 37 bit format is used | |
1114 | uint32_t lo2=0; | |
1115 | lo2=(((hi & 31) << 12) | (lo>>20)); //get bits 21-37 to check for format len bit | |
1116 | uint8_t idx3 = 1; | |
1117 | while(lo2>1){ //find last bit set to 1 (format len bit) | |
1118 | lo2=lo2>>1; | |
1119 | idx3++; | |
1120 | } | |
1121 | fmtLen =idx3+19; | |
1122 | fc =0; | |
1123 | cardnum=0; | |
1124 | if(fmtLen==26){ | |
1125 | cardnum = (lo>>1)&0xFFFF; | |
1126 | fc = (lo>>17)&0xFF; | |
1127 | } | |
1128 | if(fmtLen==34){ | |
1129 | cardnum = (lo>>1)&0xFFFF; | |
1130 | fc= ((hi&1)<<15)|(lo>>17); | |
1131 | } | |
1132 | if(fmtLen==35){ | |
1133 | cardnum = (lo>>1)&0xFFFFF; | |
1134 | fc = ((hi&1)<<11)|(lo>>21); | |
1135 | } | |
1136 | } | |
1137 | else { //if bit 38 is not set then 37 bit format is used | |
1138 | fmtLen = 37; | |
1139 | fc = 0; | |
1140 | cardnum = 0; | |
1141 | if(fmtLen == 37){ | |
1142 | cardnum = (lo>>1)&0x7FFFF; | |
1143 | fc = ((hi&0xF)<<12)|(lo>>20); | |
1144 | } | |
1145 | } | |
1146 | PrintAndLog("HID Prox TAG ID: %x%08x (%d) - Format Len: %dbit - FC: %d - Card: %d", | |
1147 | (unsigned int) hi, (unsigned int) lo, (unsigned int) (lo>>1) & 0xFFFF, | |
1148 | (unsigned int) fmtLen, (unsigned int) fc, (unsigned int) cardnum); | |
1149 | } | |
1150 | setDemodBuf(BitStream,BitLen,idx); | |
1151 | if (g_debugMode){ | |
1152 | PrintAndLog("DEBUG: idx: %d, Len: %d, Printing Demod Buffer:", idx, BitLen); | |
1153 | printDemodBuff(); | |
1154 | } | |
1155 | return 1; | |
1156 | } | |
1157 | ||
1158 | //by marshmellow | |
1159 | //Paradox Prox demod - FSK RF/50 with preamble of 00001111 (then manchester encoded) | |
1160 | //print full Paradox Prox ID and some bit format details if found | |
1161 | int CmdFSKdemodParadox(const char *Cmd) | |
1162 | { | |
1163 | //raw fsk demod no manchester decoding no start bit finding just get binary from wave | |
1164 | uint32_t hi2=0, hi=0, lo=0; | |
1165 | ||
1166 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0}; | |
1167 | size_t BitLen = getFromGraphBuf(BitStream); | |
1168 | if (BitLen==0) return 0; | |
1169 | //get binary from fsk wave | |
1170 | int idx = ParadoxdemodFSK(BitStream,&BitLen,&hi2,&hi,&lo); | |
1171 | if (idx<0){ | |
1172 | if (g_debugMode){ | |
1173 | if (idx==-1){ | |
1174 | PrintAndLog("DEBUG: Just Noise Detected"); | |
1175 | } else if (idx == -2) { | |
1176 | PrintAndLog("DEBUG: Error demoding fsk"); | |
1177 | } else if (idx == -3) { | |
1178 | PrintAndLog("DEBUG: Preamble not found"); | |
1179 | } else if (idx == -4) { | |
1180 | PrintAndLog("DEBUG: Error in Manchester data"); | |
1181 | } else { | |
1182 | PrintAndLog("DEBUG: Error demoding fsk %d", idx); | |
1183 | } | |
1184 | } | |
1185 | return 0; | |
1186 | } | |
1187 | if (hi2==0 && hi==0 && lo==0){ | |
1188 | if (g_debugMode) PrintAndLog("DEBUG: Error - no value found"); | |
1189 | return 0; | |
1190 | } | |
1191 | uint32_t fc = ((hi & 0x3)<<6) | (lo>>26); | |
1192 | uint32_t cardnum = (lo>>10)&0xFFFF; | |
1193 | uint32_t rawLo = bytebits_to_byte(BitStream+idx+64,32); | |
1194 | uint32_t rawHi = bytebits_to_byte(BitStream+idx+32,32); | |
1195 | uint32_t rawHi2 = bytebits_to_byte(BitStream+idx,32); | |
1196 | ||
1197 | PrintAndLog("Paradox TAG ID: %x%08x - FC: %d - Card: %d - Checksum: %02x - RAW: %08x%08x%08x", | |
1198 | hi>>10, (hi & 0x3)<<26 | (lo>>10), fc, cardnum, (lo>>2) & 0xFF, rawHi2, rawHi, rawLo); | |
1199 | setDemodBuf(BitStream,BitLen,idx); | |
1200 | if (g_debugMode){ | |
1201 | PrintAndLog("DEBUG: idx: %d, len: %d, Printing Demod Buffer:", idx, BitLen); | |
1202 | printDemodBuff(); | |
1203 | } | |
1204 | return 1; | |
1205 | } | |
1206 | ||
1207 | //by marshmellow | |
1208 | //IO-Prox demod - FSK RF/64 with preamble of 000000001 | |
1209 | //print ioprox ID and some format details | |
1210 | int CmdFSKdemodIO(const char *Cmd) | |
1211 | { | |
1212 | //raw fsk demod no manchester decoding no start bit finding just get binary from wave | |
1213 | //set defaults | |
1214 | int idx=0; | |
1215 | //something in graphbuffer? | |
1216 | if (GraphTraceLen < 65) { | |
1217 | if (g_debugMode)PrintAndLog("DEBUG: not enough samples in GraphBuffer"); | |
1218 | return 0; | |
1219 | } | |
1220 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0}; | |
1221 | size_t BitLen = getFromGraphBuf(BitStream); | |
1222 | if (BitLen==0) return 0; | |
1223 | ||
1224 | //get binary from fsk wave | |
1225 | idx = IOdemodFSK(BitStream,BitLen); | |
1226 | if (idx<0){ | |
1227 | if (g_debugMode){ | |
1228 | if (idx==-1){ | |
1229 | PrintAndLog("DEBUG: Just Noise Detected"); | |
1230 | } else if (idx == -2) { | |
1231 | PrintAndLog("DEBUG: not enough samples"); | |
1232 | } else if (idx == -3) { | |
1233 | PrintAndLog("DEBUG: error during fskdemod"); | |
1234 | } else if (idx == -4) { | |
1235 | PrintAndLog("DEBUG: Preamble not found"); | |
1236 | } else if (idx == -5) { | |
1237 | PrintAndLog("DEBUG: Separator bits not found"); | |
1238 | } else { | |
1239 | PrintAndLog("DEBUG: Error demoding fsk %d", idx); | |
1240 | } | |
1241 | } | |
1242 | return 0; | |
1243 | } | |
1244 | if (idx==0){ | |
1245 | if (g_debugMode==1){ | |
1246 | PrintAndLog("DEBUG: IO Prox Data not found - FSK Bits: %d",BitLen); | |
1247 | if (BitLen > 92) printBitStream(BitStream,92); | |
1248 | } | |
1249 | return 0; | |
1250 | } | |
1251 | //Index map | |
1252 | //0 10 20 30 40 50 60 | |
1253 | //| | | | | | | | |
1254 | //01234567 8 90123456 7 89012345 6 78901234 5 67890123 4 56789012 3 45678901 23 | |
1255 | //----------------------------------------------------------------------------- | |
1256 | //00000000 0 11110000 1 facility 1 version* 1 code*one 1 code*two 1 ???????? 11 | |
1257 | // | |
1258 | //XSF(version)facility:codeone+codetwo (raw) | |
1259 | //Handle the data | |
1260 | if (idx+64>BitLen) { | |
1261 | if (g_debugMode==1) PrintAndLog("not enough bits found - bitlen: %d",BitLen); | |
1262 | return 0; | |
1263 | } | |
1264 | PrintAndLog("%d%d%d%d%d%d%d%d %d",BitStream[idx], BitStream[idx+1], BitStream[idx+2], BitStream[idx+3], BitStream[idx+4], BitStream[idx+5], BitStream[idx+6], BitStream[idx+7], BitStream[idx+8]); | |
1265 | PrintAndLog("%d%d%d%d%d%d%d%d %d",BitStream[idx+9], BitStream[idx+10], BitStream[idx+11],BitStream[idx+12],BitStream[idx+13],BitStream[idx+14],BitStream[idx+15],BitStream[idx+16],BitStream[idx+17]); | |
1266 | PrintAndLog("%d%d%d%d%d%d%d%d %d facility",BitStream[idx+18], BitStream[idx+19], BitStream[idx+20],BitStream[idx+21],BitStream[idx+22],BitStream[idx+23],BitStream[idx+24],BitStream[idx+25],BitStream[idx+26]); | |
1267 | PrintAndLog("%d%d%d%d%d%d%d%d %d version",BitStream[idx+27], BitStream[idx+28], BitStream[idx+29],BitStream[idx+30],BitStream[idx+31],BitStream[idx+32],BitStream[idx+33],BitStream[idx+34],BitStream[idx+35]); | |
1268 | PrintAndLog("%d%d%d%d%d%d%d%d %d code1",BitStream[idx+36], BitStream[idx+37], BitStream[idx+38],BitStream[idx+39],BitStream[idx+40],BitStream[idx+41],BitStream[idx+42],BitStream[idx+43],BitStream[idx+44]); | |
1269 | PrintAndLog("%d%d%d%d%d%d%d%d %d code2",BitStream[idx+45], BitStream[idx+46], BitStream[idx+47],BitStream[idx+48],BitStream[idx+49],BitStream[idx+50],BitStream[idx+51],BitStream[idx+52],BitStream[idx+53]); | |
1270 | PrintAndLog("%d%d%d%d%d%d%d%d %d%d checksum",BitStream[idx+54],BitStream[idx+55],BitStream[idx+56],BitStream[idx+57],BitStream[idx+58],BitStream[idx+59],BitStream[idx+60],BitStream[idx+61],BitStream[idx+62],BitStream[idx+63]); | |
1271 | ||
1272 | uint32_t code = bytebits_to_byte(BitStream+idx,32); | |
1273 | uint32_t code2 = bytebits_to_byte(BitStream+idx+32,32); | |
1274 | uint8_t version = bytebits_to_byte(BitStream+idx+27,8); //14,4 | |
1275 | uint8_t facilitycode = bytebits_to_byte(BitStream+idx+18,8) ; | |
1276 | uint16_t number = (bytebits_to_byte(BitStream+idx+36,8)<<8)|(bytebits_to_byte(BitStream+idx+45,8)); //36,9 | |
1277 | PrintAndLog("IO Prox XSF(%02d)%02x:%05d (%08x%08x)",version,facilitycode,number,code,code2); | |
1278 | setDemodBuf(BitStream,64,idx); | |
1279 | if (g_debugMode){ | |
1280 | PrintAndLog("DEBUG: idx: %d, Len: %d, Printing demod buffer:",idx,64); | |
1281 | printDemodBuff(); | |
1282 | } | |
1283 | return 1; | |
1284 | } | |
1285 | ||
1286 | //by marshmellow | |
1287 | //AWID Prox demod - FSK RF/50 with preamble of 00000001 (always a 96 bit data stream) | |
1288 | //print full AWID Prox ID and some bit format details if found | |
1289 | int CmdFSKdemodAWID(const char *Cmd) | |
1290 | { | |
1291 | ||
1292 | //int verbose=1; | |
1293 | //sscanf(Cmd, "%i", &verbose); | |
1294 | ||
1295 | //raw fsk demod no manchester decoding no start bit finding just get binary from wave | |
1296 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0}; | |
1297 | size_t size = getFromGraphBuf(BitStream); | |
1298 | if (size==0) return 0; | |
1299 | ||
1300 | //get binary from fsk wave | |
1301 | int idx = AWIDdemodFSK(BitStream, &size); | |
1302 | if (idx<=0){ | |
1303 | if (g_debugMode==1){ | |
1304 | if (idx == -1) | |
1305 | PrintAndLog("DEBUG: Error - not enough samples"); | |
1306 | else if (idx == -2) | |
1307 | PrintAndLog("DEBUG: Error - only noise found"); | |
1308 | else if (idx == -3) | |
1309 | PrintAndLog("DEBUG: Error - problem during FSK demod"); | |
1310 | else if (idx == -4) | |
1311 | PrintAndLog("DEBUG: Error - AWID preamble not found"); | |
1312 | else if (idx == -5) | |
1313 | PrintAndLog("DEBUG: Error - Size not correct: %d", size); | |
1314 | else | |
1315 | PrintAndLog("DEBUG: Error %d",idx); | |
1316 | } | |
1317 | return 0; | |
1318 | } | |
1319 | ||
1320 | // Index map | |
1321 | // 0 10 20 30 40 50 60 | |
1322 | // | | | | | | | | |
1323 | // 01234567 890 1 234 5 678 9 012 3 456 7 890 1 234 5 678 9 012 3 456 7 890 1 234 5 678 9 012 3 - to 96 | |
1324 | // ----------------------------------------------------------------------------- | |
1325 | // 00000001 000 1 110 1 101 1 011 1 101 1 010 0 000 1 000 1 010 0 001 0 110 1 100 0 000 1 000 1 | |
1326 | // premable bbb o bbb o bbw o fff o fff o ffc o ccc o ccc o ccc o ccc o ccc o wxx o xxx o xxx o - to 96 | |
1327 | // |---26 bit---| |-----117----||-------------142-------------| | |
1328 | // b = format bit len, o = odd parity of last 3 bits | |
1329 | // f = facility code, c = card number | |
1330 | // w = wiegand parity | |
1331 | // (26 bit format shown) | |
1332 | ||
1333 | //get raw ID before removing parities | |
1334 | uint32_t rawLo = bytebits_to_byte(BitStream+idx+64,32); | |
1335 | uint32_t rawHi = bytebits_to_byte(BitStream+idx+32,32); | |
1336 | uint32_t rawHi2 = bytebits_to_byte(BitStream+idx,32); | |
1337 | setDemodBuf(BitStream,96,idx); | |
1338 | ||
1339 | size = removeParity(BitStream, idx+8, 4, 1, 88); | |
1340 | if (size != 66){ | |
1341 | if (g_debugMode==1) PrintAndLog("DEBUG: Error - at parity check-tag size does not match AWID format"); | |
1342 | return 0; | |
1343 | } | |
1344 | // ok valid card found! | |
1345 | ||
1346 | // Index map | |
1347 | // 0 10 20 30 40 50 60 | |
1348 | // | | | | | | | | |
1349 | // 01234567 8 90123456 7890123456789012 3 456789012345678901234567890123456 | |
1350 | // ----------------------------------------------------------------------------- | |
1351 | // 00011010 1 01110101 0000000010001110 1 000000000000000000000000000000000 | |
1352 | // bbbbbbbb w ffffffff cccccccccccccccc w xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx | |
1353 | // |26 bit| |-117--| |-----142------| | |
1354 | // b = format bit len, o = odd parity of last 3 bits | |
1355 | // f = facility code, c = card number | |
1356 | // w = wiegand parity | |
1357 | // (26 bit format shown) | |
1358 | ||
1359 | uint32_t fc = 0; | |
1360 | uint32_t cardnum = 0; | |
1361 | uint32_t code1 = 0; | |
1362 | uint32_t code2 = 0; | |
1363 | uint8_t fmtLen = bytebits_to_byte(BitStream,8); | |
1364 | if (fmtLen==26){ | |
1365 | fc = bytebits_to_byte(BitStream+9, 8); | |
1366 | cardnum = bytebits_to_byte(BitStream+17, 16); | |
1367 | code1 = bytebits_to_byte(BitStream+8,fmtLen); | |
1368 | PrintAndLog("AWID Found - BitLength: %d, FC: %d, Card: %d - Wiegand: %x, Raw: %08x%08x%08x", fmtLen, fc, cardnum, code1, rawHi2, rawHi, rawLo); | |
1369 | } else { | |
1370 | cardnum = bytebits_to_byte(BitStream+8+(fmtLen-17), 16); | |
1371 | if (fmtLen>32){ | |
1372 | code1 = bytebits_to_byte(BitStream+8,fmtLen-32); | |
1373 | code2 = bytebits_to_byte(BitStream+8+(fmtLen-32),32); | |
1374 | PrintAndLog("AWID Found - BitLength: %d -unknown BitLength- (%d) - Wiegand: %x%08x, Raw: %08x%08x%08x", fmtLen, cardnum, code1, code2, rawHi2, rawHi, rawLo); | |
1375 | } else{ | |
1376 | code1 = bytebits_to_byte(BitStream+8,fmtLen); | |
1377 | PrintAndLog("AWID Found - BitLength: %d -unknown BitLength- (%d) - Wiegand: %x, Raw: %08x%08x%08x", fmtLen, cardnum, code1, rawHi2, rawHi, rawLo); | |
1378 | } | |
1379 | } | |
1380 | if (g_debugMode){ | |
1381 | PrintAndLog("DEBUG: idx: %d, Len: %d Printing Demod Buffer:", idx, 96); | |
1382 | printDemodBuff(); | |
1383 | } | |
1384 | //todo - convert hi2, hi, lo to demodbuffer for future sim/clone commands | |
1385 | return 1; | |
1386 | } | |
1387 | ||
1388 | //by marshmellow | |
1389 | //Pyramid Prox demod - FSK RF/50 with preamble of 0000000000000001 (always a 128 bit data stream) | |
1390 | //print full Farpointe Data/Pyramid Prox ID and some bit format details if found | |
1391 | int CmdFSKdemodPyramid(const char *Cmd) | |
1392 | { | |
1393 | //raw fsk demod no manchester decoding no start bit finding just get binary from wave | |
1394 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0}; | |
1395 | size_t size = getFromGraphBuf(BitStream); | |
1396 | if (size==0) return 0; | |
1397 | ||
1398 | //get binary from fsk wave | |
1399 | int idx = PyramiddemodFSK(BitStream, &size); | |
1400 | if (idx < 0){ | |
1401 | if (g_debugMode==1){ | |
1402 | if (idx == -5) | |
1403 | PrintAndLog("DEBUG: Error - not enough samples"); | |
1404 | else if (idx == -1) | |
1405 | PrintAndLog("DEBUG: Error - only noise found"); | |
1406 | else if (idx == -2) | |
1407 | PrintAndLog("DEBUG: Error - problem during FSK demod"); | |
1408 | else if (idx == -3) | |
1409 | PrintAndLog("DEBUG: Error - Size not correct: %d", size); | |
1410 | else if (idx == -4) | |
1411 | PrintAndLog("DEBUG: Error - Pyramid preamble not found"); | |
1412 | else | |
1413 | PrintAndLog("DEBUG: Error - idx: %d",idx); | |
1414 | } | |
1415 | return 0; | |
1416 | } | |
1417 | // Index map | |
1418 | // 0 10 20 30 40 50 60 | |
1419 | // | | | | | | | | |
1420 | // 0123456 7 8901234 5 6789012 3 4567890 1 2345678 9 0123456 7 8901234 5 6789012 3 | |
1421 | // ----------------------------------------------------------------------------- | |
1422 | // 0000000 0 0000000 1 0000000 1 0000000 1 0000000 1 0000000 1 0000000 1 0000000 1 | |
1423 | // premable xxxxxxx o xxxxxxx o xxxxxxx o xxxxxxx o xxxxxxx o xxxxxxx o xxxxxxx o | |
1424 | ||
1425 | // 64 70 80 90 100 110 120 | |
1426 | // | | | | | | | | |
1427 | // 4567890 1 2345678 9 0123456 7 8901234 5 6789012 3 4567890 1 2345678 9 0123456 7 | |
1428 | // ----------------------------------------------------------------------------- | |
1429 | // 0000000 1 0000000 1 0000000 1 0110111 0 0011000 1 0000001 0 0001100 1 1001010 0 | |
1430 | // xxxxxxx o xxxxxxx o xxxxxxx o xswffff o ffffccc o ccccccc o ccccccw o ppppppp o | |
1431 | // |---115---||---------71---------| | |
1432 | // s = format start bit, o = odd parity of last 7 bits | |
1433 | // f = facility code, c = card number | |
1434 | // w = wiegand parity, x = extra space for other formats | |
1435 | // p = unknown checksum | |
1436 | // (26 bit format shown) | |
1437 | ||
1438 | //get raw ID before removing parities | |
1439 | uint32_t rawLo = bytebits_to_byte(BitStream+idx+96,32); | |
1440 | uint32_t rawHi = bytebits_to_byte(BitStream+idx+64,32); | |
1441 | uint32_t rawHi2 = bytebits_to_byte(BitStream+idx+32,32); | |
1442 | uint32_t rawHi3 = bytebits_to_byte(BitStream+idx,32); | |
1443 | setDemodBuf(BitStream,128,idx); | |
1444 | ||
1445 | size = removeParity(BitStream, idx+8, 8, 1, 120); | |
1446 | if (size != 105){ | |
1447 | if (g_debugMode==1) PrintAndLog("DEBUG: Error at parity check-tag size does not match Pyramid format, SIZE: %d, IDX: %d, hi3: %x",size, idx, rawHi3); | |
1448 | return 0; | |
1449 | } | |
1450 | ||
1451 | // ok valid card found! | |
1452 | ||
1453 | // Index map | |
1454 | // 0 10 20 30 40 50 60 70 | |
1455 | // | | | | | | | | | |
1456 | // 01234567890123456789012345678901234567890123456789012345678901234567890 | |
1457 | // ----------------------------------------------------------------------- | |
1458 | // 00000000000000000000000000000000000000000000000000000000000000000000000 | |
1459 | // xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx | |
1460 | ||
1461 | // 71 80 90 100 | |
1462 | // | | | | | |
1463 | // 1 2 34567890 1234567890123456 7 8901234 | |
1464 | // --------------------------------------- | |
1465 | // 1 1 01110011 0000000001000110 0 1001010 | |
1466 | // s w ffffffff cccccccccccccccc w ppppppp | |
1467 | // |--115-| |------71------| | |
1468 | // s = format start bit, o = odd parity of last 7 bits | |
1469 | // f = facility code, c = card number | |
1470 | // w = wiegand parity, x = extra space for other formats | |
1471 | // p = unknown checksum | |
1472 | // (26 bit format shown) | |
1473 | ||
1474 | //find start bit to get fmtLen | |
1475 | int j; | |
1476 | for (j=0; j<size; j++){ | |
1477 | if(BitStream[j]) break; | |
1478 | } | |
1479 | uint8_t fmtLen = size-j-8; | |
1480 | uint32_t fc = 0; | |
1481 | uint32_t cardnum = 0; | |
1482 | uint32_t code1 = 0; | |
1483 | //uint32_t code2 = 0; | |
1484 | if (fmtLen==26){ | |
1485 | fc = bytebits_to_byte(BitStream+73, 8); | |
1486 | cardnum = bytebits_to_byte(BitStream+81, 16); | |
1487 | code1 = bytebits_to_byte(BitStream+72,fmtLen); | |
1488 | PrintAndLog("Pyramid ID Found - BitLength: %d, FC: %d, Card: %d - Wiegand: %x, Raw: %08x%08x%08x%08x", fmtLen, fc, cardnum, code1, rawHi3, rawHi2, rawHi, rawLo); | |
1489 | } else if (fmtLen==45){ | |
1490 | fmtLen=42; //end = 10 bits not 7 like 26 bit fmt | |
1491 | fc = bytebits_to_byte(BitStream+53, 10); | |
1492 | cardnum = bytebits_to_byte(BitStream+63, 32); | |
1493 | PrintAndLog("Pyramid ID Found - BitLength: %d, FC: %d, Card: %d - Raw: %08x%08x%08x%08x", fmtLen, fc, cardnum, rawHi3, rawHi2, rawHi, rawLo); | |
1494 | } else { | |
1495 | cardnum = bytebits_to_byte(BitStream+81, 16); | |
1496 | if (fmtLen>32){ | |
1497 | //code1 = bytebits_to_byte(BitStream+(size-fmtLen),fmtLen-32); | |
1498 | //code2 = bytebits_to_byte(BitStream+(size-32),32); | |
1499 | PrintAndLog("Pyramid ID Found - BitLength: %d -unknown BitLength- (%d), Raw: %08x%08x%08x%08x", fmtLen, cardnum, rawHi3, rawHi2, rawHi, rawLo); | |
1500 | } else{ | |
1501 | //code1 = bytebits_to_byte(BitStream+(size-fmtLen),fmtLen); | |
1502 | PrintAndLog("Pyramid ID Found - BitLength: %d -unknown BitLength- (%d), Raw: %08x%08x%08x%08x", fmtLen, cardnum, rawHi3, rawHi2, rawHi, rawLo); | |
1503 | } | |
1504 | } | |
1505 | if (g_debugMode){ | |
1506 | PrintAndLog("DEBUG: idx: %d, Len: %d, Printing Demod Buffer:", idx, 128); | |
1507 | printDemodBuff(); | |
1508 | } | |
1509 | return 1; | |
1510 | } | |
1511 | ||
1512 | int CmdFSKdemod(const char *Cmd) //old CmdFSKdemod needs updating | |
1513 | { | |
1514 | static const int LowTone[] = { | |
1515 | 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, | |
1516 | 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, | |
1517 | 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, | |
1518 | 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, | |
1519 | 1, 1, 1, 1, 1, -1, -1, -1, -1, -1 | |
1520 | }; | |
1521 | static const int HighTone[] = { | |
1522 | 1, 1, 1, 1, 1, -1, -1, -1, -1, | |
1523 | 1, 1, 1, 1, -1, -1, -1, -1, | |
1524 | 1, 1, 1, 1, -1, -1, -1, -1, | |
1525 | 1, 1, 1, 1, -1, -1, -1, -1, | |
1526 | 1, 1, 1, 1, -1, -1, -1, -1, | |
1527 | 1, 1, 1, 1, -1, -1, -1, -1, -1, | |
1528 | }; | |
1529 | ||
1530 | int lowLen = sizeof (LowTone) / sizeof (int); | |
1531 | int highLen = sizeof (HighTone) / sizeof (int); | |
1532 | int convLen = (highLen > lowLen) ? highLen : lowLen; | |
1533 | uint32_t hi = 0, lo = 0; | |
1534 | ||
1535 | int i, j; | |
1536 | int minMark = 0, maxMark = 0; | |
1537 | ||
1538 | for (i = 0; i < GraphTraceLen - convLen; ++i) { | |
1539 | int lowSum = 0, highSum = 0; | |
1540 | ||
1541 | for (j = 0; j < lowLen; ++j) { | |
1542 | lowSum += LowTone[j]*GraphBuffer[i+j]; | |
1543 | } | |
1544 | for (j = 0; j < highLen; ++j) { | |
1545 | highSum += HighTone[j] * GraphBuffer[i + j]; | |
1546 | } | |
1547 | lowSum = abs(100 * lowSum / lowLen); | |
1548 | highSum = abs(100 * highSum / highLen); | |
1549 | GraphBuffer[i] = (highSum << 16) | lowSum; | |
1550 | } | |
1551 | ||
1552 | for(i = 0; i < GraphTraceLen - convLen - 16; ++i) { | |
1553 | int lowTot = 0, highTot = 0; | |
1554 | // 10 and 8 are f_s divided by f_l and f_h, rounded | |
1555 | for (j = 0; j < 10; ++j) { | |
1556 | lowTot += (GraphBuffer[i+j] & 0xffff); | |
1557 | } | |
1558 | for (j = 0; j < 8; j++) { | |
1559 | highTot += (GraphBuffer[i + j] >> 16); | |
1560 | } | |
1561 | GraphBuffer[i] = lowTot - highTot; | |
1562 | if (GraphBuffer[i] > maxMark) maxMark = GraphBuffer[i]; | |
1563 | if (GraphBuffer[i] < minMark) minMark = GraphBuffer[i]; | |
1564 | } | |
1565 | ||
1566 | GraphTraceLen -= (convLen + 16); | |
1567 | RepaintGraphWindow(); | |
1568 | ||
1569 | // Find bit-sync (3 lo followed by 3 high) (HID ONLY) | |
1570 | int max = 0, maxPos = 0; | |
1571 | for (i = 0; i < 6000; ++i) { | |
1572 | int dec = 0; | |
1573 | for (j = 0; j < 3 * lowLen; ++j) { | |
1574 | dec -= GraphBuffer[i + j]; | |
1575 | } | |
1576 | for (; j < 3 * (lowLen + highLen ); ++j) { | |
1577 | dec += GraphBuffer[i + j]; | |
1578 | } | |
1579 | if (dec > max) { | |
1580 | max = dec; | |
1581 | maxPos = i; | |
1582 | } | |
1583 | } | |
1584 | ||
1585 | // place start of bit sync marker in graph | |
1586 | GraphBuffer[maxPos] = maxMark; | |
1587 | GraphBuffer[maxPos + 1] = minMark; | |
1588 | ||
1589 | maxPos += j; | |
1590 | ||
1591 | // place end of bit sync marker in graph | |
1592 | GraphBuffer[maxPos] = maxMark; | |
1593 | GraphBuffer[maxPos+1] = minMark; | |
1594 | ||
1595 | PrintAndLog("actual data bits start at sample %d", maxPos); | |
1596 | PrintAndLog("length %d/%d", highLen, lowLen); | |
1597 | ||
1598 | uint8_t bits[46] = {0x00}; | |
1599 | ||
1600 | // find bit pairs and manchester decode them | |
1601 | for (i = 0; i < arraylen(bits) - 1; ++i) { | |
1602 | int dec = 0; | |
1603 | for (j = 0; j < lowLen; ++j) { | |
1604 | dec -= GraphBuffer[maxPos + j]; | |
1605 | } | |
1606 | for (; j < lowLen + highLen; ++j) { | |
1607 | dec += GraphBuffer[maxPos + j]; | |
1608 | } | |
1609 | maxPos += j; | |
1610 | // place inter bit marker in graph | |
1611 | GraphBuffer[maxPos] = maxMark; | |
1612 | GraphBuffer[maxPos + 1] = minMark; | |
1613 | ||
1614 | // hi and lo form a 64 bit pair | |
1615 | hi = (hi << 1) | (lo >> 31); | |
1616 | lo = (lo << 1); | |
1617 | // store decoded bit as binary (in hi/lo) and text (in bits[]) | |
1618 | if(dec < 0) { | |
1619 | bits[i] = '1'; | |
1620 | lo |= 1; | |
1621 | } else { | |
1622 | bits[i] = '0'; | |
1623 | } | |
1624 | } | |
1625 | PrintAndLog("bits: '%s'", bits); | |
1626 | PrintAndLog("hex: %08x %08x", hi, lo); | |
1627 | return 0; | |
1628 | } | |
1629 | ||
1630 | //by marshmellow | |
1631 | //attempt to psk1 demod graph buffer | |
1632 | int PSKDemod(const char *Cmd, bool verbose) | |
1633 | { | |
1634 | int invert=0; | |
1635 | int clk=0; | |
1636 | int maxErr=100; | |
1637 | sscanf(Cmd, "%i %i %i", &clk, &invert, &maxErr); | |
1638 | if (clk==1){ | |
1639 | invert=1; | |
1640 | clk=0; | |
1641 | } | |
1642 | if (invert != 0 && invert != 1) { | |
1643 | if (verbose) PrintAndLog("Invalid argument: %s", Cmd); | |
1644 | return -1; | |
1645 | } | |
1646 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0}; | |
1647 | size_t BitLen = getFromGraphBuf(BitStream); | |
1648 | if (BitLen==0) return -1; | |
1649 | uint8_t carrier=countPSK_FC(BitStream, BitLen); | |
1650 | if (carrier!=2 && carrier!=4 && carrier!=8){ | |
1651 | //invalid carrier | |
1652 | return -1; | |
1653 | } | |
1654 | int errCnt=0; | |
1655 | errCnt = pskRawDemod(BitStream, &BitLen, &clk, &invert); | |
1656 | if (errCnt > maxErr){ | |
1657 | if (g_debugMode==1 && verbose) PrintAndLog("Too many errors found, clk: %d, invert: %d, numbits: %d, errCnt: %d",clk,invert,BitLen,errCnt); | |
1658 | return -1; | |
1659 | } | |
1660 | if (errCnt<0|| BitLen<16){ //throw away static - allow 1 and -1 (in case of threshold command first) | |
1661 | if (g_debugMode==1 && verbose) PrintAndLog("no data found, clk: %d, invert: %d, numbits: %d, errCnt: %d",clk,invert,BitLen,errCnt); | |
1662 | return -1; | |
1663 | } | |
1664 | if (verbose) PrintAndLog("Tried PSK Demod using Clock: %d - invert: %d - Bits Found: %d",clk,invert,BitLen); | |
1665 | //prime demod buffer for output | |
1666 | setDemodBuf(BitStream,BitLen,0); | |
1667 | return errCnt; | |
1668 | } | |
1669 | ||
1670 | // Indala 26 bit decode | |
1671 | // by marshmellow | |
1672 | // optional arguments - same as CmdpskNRZrawDemod (clock & invert) | |
1673 | int CmdIndalaDecode(const char *Cmd) | |
1674 | { | |
1675 | int ans; | |
1676 | if (strlen(Cmd)>0){ | |
1677 | ans = PSKDemod(Cmd, 0); | |
1678 | } else{ //default to RF/32 | |
1679 | ans = PSKDemod("32", 0); | |
1680 | } | |
1681 | ||
1682 | if (ans < 0){ | |
1683 | if (g_debugMode==1) | |
1684 | PrintAndLog("Error1: %d",ans); | |
1685 | return 0; | |
1686 | } | |
1687 | uint8_t invert=0; | |
1688 | ans = indala26decode(DemodBuffer,(size_t *) &DemodBufferLen, &invert); | |
1689 | if (ans < 1) { | |
1690 | if (g_debugMode==1) | |
1691 | PrintAndLog("Error2: %d",ans); | |
1692 | return -1; | |
1693 | } | |
1694 | char showbits[251]={0x00}; | |
1695 | if (invert) | |
1696 | if (g_debugMode==1) | |
1697 | PrintAndLog("Had to invert bits"); | |
1698 | ||
1699 | //convert UID to HEX | |
1700 | uint32_t uid1, uid2, uid3, uid4, uid5, uid6, uid7; | |
1701 | int idx; | |
1702 | uid1=0; | |
1703 | uid2=0; | |
1704 | PrintAndLog("BitLen: %d",DemodBufferLen); | |
1705 | if (DemodBufferLen==64){ | |
1706 | for( idx=0; idx<64; idx++) { | |
1707 | uid1=(uid1<<1)|(uid2>>31); | |
1708 | if (DemodBuffer[idx] == 0) { | |
1709 | uid2=(uid2<<1)|0; | |
1710 | showbits[idx]='0'; | |
1711 | } else { | |
1712 | uid2=(uid2<<1)|1; | |
1713 | showbits[idx]='1'; | |
1714 | } | |
1715 | } | |
1716 | showbits[idx]='\0'; | |
1717 | PrintAndLog("Indala UID=%s (%x%08x)", showbits, uid1, uid2); | |
1718 | } | |
1719 | else { | |
1720 | uid3=0; | |
1721 | uid4=0; | |
1722 | uid5=0; | |
1723 | uid6=0; | |
1724 | uid7=0; | |
1725 | for( idx=0; idx<DemodBufferLen; idx++) { | |
1726 | uid1=(uid1<<1)|(uid2>>31); | |
1727 | uid2=(uid2<<1)|(uid3>>31); | |
1728 | uid3=(uid3<<1)|(uid4>>31); | |
1729 | uid4=(uid4<<1)|(uid5>>31); | |
1730 | uid5=(uid5<<1)|(uid6>>31); | |
1731 | uid6=(uid6<<1)|(uid7>>31); | |
1732 | if (DemodBuffer[idx] == 0) { | |
1733 | uid7=(uid7<<1)|0; | |
1734 | showbits[idx]='0'; | |
1735 | } | |
1736 | else { | |
1737 | uid7=(uid7<<1)|1; | |
1738 | showbits[idx]='1'; | |
1739 | } | |
1740 | } | |
1741 | showbits[idx]='\0'; | |
1742 | PrintAndLog("Indala UID=%s (%x%08x%08x%08x%08x%08x%08x)", showbits, uid1, uid2, uid3, uid4, uid5, uid6, uid7); | |
1743 | } | |
1744 | if (g_debugMode){ | |
1745 | PrintAndLog("DEBUG: printing demodbuffer:"); | |
1746 | printDemodBuff(); | |
1747 | } | |
1748 | return 1; | |
1749 | } | |
1750 | ||
1751 | // by marshmellow | |
1752 | // takes 3 arguments - clock, invert, maxErr as integers | |
1753 | // attempts to demodulate nrz only | |
1754 | // prints binary found and saves in demodbuffer for further commands | |
1755 | ||
1756 | int NRZrawDemod(const char *Cmd, bool verbose) | |
1757 | { | |
1758 | int invert=0; | |
1759 | int clk=0; | |
1760 | int maxErr=100; | |
1761 | sscanf(Cmd, "%i %i %i", &clk, &invert, &maxErr); | |
1762 | if (clk==1){ | |
1763 | invert=1; | |
1764 | clk=0; | |
1765 | } | |
1766 | if (invert != 0 && invert != 1) { | |
1767 | PrintAndLog("Invalid argument: %s", Cmd); | |
1768 | return 0; | |
1769 | } | |
1770 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0}; | |
1771 | size_t BitLen = getFromGraphBuf(BitStream); | |
1772 | if (BitLen==0) return 0; | |
1773 | int errCnt=0; | |
1774 | errCnt = nrzRawDemod(BitStream, &BitLen, &clk, &invert, maxErr); | |
1775 | if (errCnt > maxErr){ | |
1776 | if (g_debugMode==1 && verbose) PrintAndLog("Too many errors found, clk: %d, invert: %d, numbits: %d, errCnt: %d",clk,invert,BitLen,errCnt); | |
1777 | return 0; | |
1778 | } | |
1779 | if (errCnt<0|| BitLen<16){ //throw away static - allow 1 and -1 (in case of threshold command first) | |
1780 | if (g_debugMode==1 && verbose) PrintAndLog("no data found, clk: %d, invert: %d, numbits: %d, errCnt: %d",clk,invert,BitLen,errCnt); | |
1781 | return 0; | |
1782 | } | |
1783 | PrintAndLog("Tried NRZ Demod using Clock: %d - invert: %d - Bits Found: %d",clk,invert,BitLen); | |
1784 | //prime demod buffer for output | |
1785 | setDemodBuf(BitStream,BitLen,0); | |
1786 | ||
1787 | if (errCnt>0 && verbose){ | |
1788 | PrintAndLog("# Errors during Demoding (shown as 77 in bit stream): %d",errCnt); | |
1789 | } | |
1790 | if (verbose) { | |
1791 | PrintAndLog("NRZ demoded bitstream:"); | |
1792 | // Now output the bitstream to the scrollback by line of 16 bits | |
1793 | printDemodBuff(); | |
1794 | } | |
1795 | return 1; | |
1796 | } | |
1797 | ||
1798 | int CmdNRZrawDemod(const char *Cmd) | |
1799 | { | |
1800 | char cmdp = param_getchar(Cmd, 0); | |
1801 | if (strlen(Cmd) > 10 || cmdp == 'h' || cmdp == 'H') { | |
1802 | PrintAndLog("Usage: data rawdemod nr [clock] <0|1> [maxError]"); | |
1803 | PrintAndLog(" [set clock as integer] optional, if not set, autodetect."); | |
1804 | PrintAndLog(" <invert>, 1 for invert output"); | |
1805 | PrintAndLog(" [set maximum allowed errors], default = 100."); | |
1806 | PrintAndLog(""); | |
1807 | PrintAndLog(" sample: data rawdemod nr = demod a nrz/direct tag from GraphBuffer"); | |
1808 | PrintAndLog(" : data rawdemod nr 32 = demod a nrz/direct tag from GraphBuffer using a clock of RF/32"); | |
1809 | PrintAndLog(" : data rawdemod nr 32 1 = demod a nrz/direct tag from GraphBuffer using a clock of RF/32 and inverting data"); | |
1810 | PrintAndLog(" : data rawdemod nr 1 = demod a nrz/direct tag from GraphBuffer while inverting data"); | |
1811 | PrintAndLog(" : data rawdemod nr 64 1 0 = demod a nrz/direct tag from GraphBuffer using a clock of RF/64, inverting data and allowing 0 demod errors"); | |
1812 | return 0; | |
1813 | } | |
1814 | return NRZrawDemod(Cmd, TRUE); | |
1815 | } | |
1816 | ||
1817 | // by marshmellow | |
1818 | // takes 3 arguments - clock, invert, maxErr as integers | |
1819 | // attempts to demodulate psk only | |
1820 | // prints binary found and saves in demodbuffer for further commands | |
1821 | int CmdPSK1rawDemod(const char *Cmd) | |
1822 | { | |
1823 | int errCnt; | |
1824 | char cmdp = param_getchar(Cmd, 0); | |
1825 | if (strlen(Cmd) > 10 || cmdp == 'h' || cmdp == 'H') { | |
1826 | PrintAndLog("Usage: data rawdemod p1 [clock] <0|1> [maxError]"); | |
1827 | PrintAndLog(" [set clock as integer] optional, if not set, autodetect."); | |
1828 | PrintAndLog(" <invert>, 1 for invert output"); | |
1829 | PrintAndLog(" [set maximum allowed errors], default = 100."); | |
1830 | PrintAndLog(""); | |
1831 | PrintAndLog(" sample: data rawdemod p1 = demod a psk1 tag from GraphBuffer"); | |
1832 | PrintAndLog(" : data rawdemod p1 32 = demod a psk1 tag from GraphBuffer using a clock of RF/32"); | |
1833 | PrintAndLog(" : data rawdemod p1 32 1 = demod a psk1 tag from GraphBuffer using a clock of RF/32 and inverting data"); | |
1834 | PrintAndLog(" : data rawdemod p1 1 = demod a psk1 tag from GraphBuffer while inverting data"); | |
1835 | PrintAndLog(" : data rawdemod p1 64 1 0 = demod a psk1 tag from GraphBuffer using a clock of RF/64, inverting data and allowing 0 demod errors"); | |
1836 | return 0; | |
1837 | } | |
1838 | errCnt = PSKDemod(Cmd, TRUE); | |
1839 | //output | |
1840 | if (errCnt<0){ | |
1841 | if (g_debugMode) PrintAndLog("Error demoding: %d",errCnt); | |
1842 | return 0; | |
1843 | } | |
1844 | if (errCnt>0){ | |
1845 | PrintAndLog("# Errors during Demoding (shown as 77 in bit stream): %d",errCnt); | |
1846 | } | |
1847 | PrintAndLog("PSK demoded bitstream:"); | |
1848 | // Now output the bitstream to the scrollback by line of 16 bits | |
1849 | printDemodBuff(); | |
1850 | return 1; | |
1851 | } | |
1852 | ||
1853 | // by marshmellow | |
1854 | // takes same args as cmdpsk1rawdemod | |
1855 | int CmdPSK2rawDemod(const char *Cmd) | |
1856 | { | |
1857 | int errCnt=0; | |
1858 | char cmdp = param_getchar(Cmd, 0); | |
1859 | if (strlen(Cmd) > 10 || cmdp == 'h' || cmdp == 'H') { | |
1860 | PrintAndLog("Usage: data rawdemod p2 [clock] <0|1> [maxError]"); | |
1861 | PrintAndLog(" [set clock as integer] optional, if not set, autodetect."); | |
1862 | PrintAndLog(" <invert>, 1 for invert output"); | |
1863 | PrintAndLog(" [set maximum allowed errors], default = 100."); | |
1864 | PrintAndLog(""); | |
1865 | PrintAndLog(" sample: data rawdemod p2 = demod a psk2 tag from GraphBuffer, autodetect clock"); | |
1866 | PrintAndLog(" : data rawdemod p2 32 = demod a psk2 tag from GraphBuffer using a clock of RF/32"); | |
1867 | PrintAndLog(" : data rawdemod p2 32 1 = demod a psk2 tag from GraphBuffer using a clock of RF/32 and inverting output"); | |
1868 | PrintAndLog(" : data rawdemod p2 1 = demod a psk2 tag from GraphBuffer, autodetect clock and invert output"); | |
1869 | PrintAndLog(" : data rawdemod p2 64 1 0 = demod a psk2 tag from GraphBuffer using a clock of RF/64, inverting output and allowing 0 demod errors"); | |
1870 | return 0; | |
1871 | } | |
1872 | errCnt=PSKDemod(Cmd, TRUE); | |
1873 | if (errCnt<0){ | |
1874 | if (g_debugMode) PrintAndLog("Error demoding: %d",errCnt); | |
1875 | return 0; | |
1876 | } | |
1877 | psk1TOpsk2(DemodBuffer, DemodBufferLen); | |
1878 | if (errCnt>0){ | |
1879 | if (g_debugMode){ | |
1880 | PrintAndLog("# Errors during Demoding (shown as 77 in bit stream): %d",errCnt); | |
1881 | PrintAndLog("PSK2 demoded bitstream:"); | |
1882 | // Now output the bitstream to the scrollback by line of 16 bits | |
1883 | printDemodBuff(); | |
1884 | } | |
1885 | }else{ | |
1886 | PrintAndLog("PSK2 demoded bitstream:"); | |
1887 | // Now output the bitstream to the scrollback by line of 16 bits | |
1888 | printDemodBuff(); | |
1889 | } | |
1890 | return 1; | |
1891 | } | |
1892 | ||
1893 | // by marshmellow - combines all raw demod functions into one menu command | |
1894 | int CmdRawDemod(const char *Cmd) | |
1895 | { | |
1896 | char cmdp = Cmd[0]; //param_getchar(Cmd, 0); | |
1897 | ||
1898 | if (strlen(Cmd) > 14 || cmdp == 'h' || cmdp == 'H' || strlen(Cmd)<2) { | |
1899 | PrintAndLog("Usage: data rawdemod [modulation] <help>|<options>"); | |
1900 | PrintAndLog(" [modulation] as 2 char, 'am' for ask/manchester, 'ar' for ask/raw, 'fs' for fsk, 'nr' for nrz/direct, 'p1' for psk1, 'p2' for psk2"); | |
1901 | PrintAndLog(" <help> as 'h', prints the help for the specific modulation"); | |
1902 | PrintAndLog(" <options> see specific modulation help for optional parameters"); | |
1903 | PrintAndLog(""); | |
1904 | PrintAndLog(" sample: data rawdemod fs h = print help for ask/raw demod"); | |
1905 | PrintAndLog(" : data rawdemod fs = demod GraphBuffer using: fsk - autodetect"); | |
1906 | PrintAndLog(" : data rawdemod am = demod GraphBuffer using: ask/manchester - autodetect"); | |
1907 | PrintAndLog(" : data rawdemod ar = demod GraphBuffer using: ask/raw - autodetect"); | |
1908 | PrintAndLog(" : data rawdemod nr = demod GraphBuffer using: nrz/direct - autodetect"); | |
1909 | PrintAndLog(" : data rawdemod p1 = demod GraphBuffer using: psk1 - autodetect"); | |
1910 | PrintAndLog(" : data rawdemod p2 = demod GraphBuffer using: psk2 - autodetect"); | |
1911 | return 0; | |
1912 | } | |
1913 | char cmdp2 = Cmd[1]; | |
1914 | int ans = 0; | |
1915 | if (cmdp == 'f' && cmdp2 == 's'){ | |
1916 | ans = CmdFSKrawdemod(Cmd+3); | |
1917 | } else if(cmdp == 'a' && cmdp2 == 'm'){ | |
1918 | ans = Cmdaskmandemod(Cmd+3); | |
1919 | } else if(cmdp == 'a' && cmdp2 == 'r'){ | |
1920 | ans = Cmdaskrawdemod(Cmd+3); | |
1921 | } else if(cmdp == 'n' && cmdp2 == 'r'){ | |
1922 | ans = CmdNRZrawDemod(Cmd+3); | |
1923 | } else if(cmdp == 'p' && cmdp2 == '1'){ | |
1924 | ans = CmdPSK1rawDemod(Cmd+3); | |
1925 | } else if(cmdp == 'p' && cmdp2 == '2'){ | |
1926 | ans = CmdPSK2rawDemod(Cmd+3); | |
1927 | } else { | |
1928 | PrintAndLog("unknown modulation entered - see help ('h') for parameter structure"); | |
1929 | } | |
1930 | return ans; | |
1931 | } | |
1932 | ||
1933 | int CmdGrid(const char *Cmd) | |
1934 | { | |
1935 | sscanf(Cmd, "%i %i", &PlotGridX, &PlotGridY); | |
1936 | PlotGridXdefault= PlotGridX; | |
1937 | PlotGridYdefault= PlotGridY; | |
1938 | RepaintGraphWindow(); | |
1939 | return 0; | |
1940 | } | |
1941 | ||
1942 | int CmdHexsamples(const char *Cmd) | |
1943 | { | |
1944 | int i, j; | |
1945 | int requested = 0; | |
1946 | int offset = 0; | |
1947 | char string_buf[25]; | |
1948 | char* string_ptr = string_buf; | |
1949 | uint8_t got[BIGBUF_SIZE]; | |
1950 | ||
1951 | sscanf(Cmd, "%i %i", &requested, &offset); | |
1952 | ||
1953 | /* if no args send something */ | |
1954 | if (requested == 0) { | |
1955 | requested = 8; | |
1956 | } | |
1957 | if (offset + requested > sizeof(got)) { | |
1958 | PrintAndLog("Tried to read past end of buffer, <bytes> + <offset> > %d", BIGBUF_SIZE); | |
1959 | return 0; | |
1960 | } | |
1961 | ||
1962 | GetFromBigBuf(got,requested,offset); | |
1963 | WaitForResponse(CMD_ACK,NULL); | |
1964 | ||
1965 | i = 0; | |
1966 | for (j = 0; j < requested; j++) { | |
1967 | i++; | |
1968 | string_ptr += sprintf(string_ptr, "%02x ", got[j]); | |
1969 | if (i == 8) { | |
1970 | *(string_ptr - 1) = '\0'; // remove the trailing space | |
1971 | PrintAndLog("%s", string_buf); | |
1972 | string_buf[0] = '\0'; | |
1973 | string_ptr = string_buf; | |
1974 | i = 0; | |
1975 | } | |
1976 | if (j == requested - 1 && string_buf[0] != '\0') { // print any remaining bytes | |
1977 | *(string_ptr - 1) = '\0'; | |
1978 | PrintAndLog("%s", string_buf); | |
1979 | string_buf[0] = '\0'; | |
1980 | } | |
1981 | } | |
1982 | return 0; | |
1983 | } | |
1984 | ||
1985 | int CmdHide(const char *Cmd) | |
1986 | { | |
1987 | HideGraphWindow(); | |
1988 | return 0; | |
1989 | } | |
1990 | ||
1991 | //zero mean GraphBuffer | |
1992 | int CmdHpf(const char *Cmd) | |
1993 | { | |
1994 | int i; | |
1995 | int accum = 0; | |
1996 | ||
1997 | for (i = 10; i < GraphTraceLen; ++i) | |
1998 | accum += GraphBuffer[i]; | |
1999 | accum /= (GraphTraceLen - 10); | |
2000 | for (i = 0; i < GraphTraceLen; ++i) | |
2001 | GraphBuffer[i] -= accum; | |
2002 | ||
2003 | RepaintGraphWindow(); | |
2004 | return 0; | |
2005 | } | |
2006 | typedef struct { | |
2007 | uint8_t * buffer; | |
2008 | uint32_t numbits; | |
2009 | uint32_t position; | |
2010 | }BitstreamOut; | |
2011 | ||
2012 | bool _headBit( BitstreamOut *stream) | |
2013 | { | |
2014 | int bytepos = stream->position >> 3; // divide by 8 | |
2015 | int bitpos = (stream->position++) & 7; // mask out 00000111 | |
2016 | return (*(stream->buffer + bytepos) >> (7-bitpos)) & 1; | |
2017 | } | |
2018 | ||
2019 | uint8_t getByte(uint8_t bits_per_sample, BitstreamOut* b) | |
2020 | { | |
2021 | int i; | |
2022 | uint8_t val = 0; | |
2023 | for(i =0 ; i < bits_per_sample; i++) | |
2024 | { | |
2025 | val |= (_headBit(b) << (7-i)); | |
2026 | } | |
2027 | return val; | |
2028 | } | |
2029 | ||
2030 | int CmdSamples(const char *Cmd) | |
2031 | { | |
2032 | //If we get all but the last byte in bigbuf, | |
2033 | // we don't have to worry about remaining trash | |
2034 | // in the last byte in case the bits-per-sample | |
2035 | // does not line up on byte boundaries | |
2036 | uint8_t got[BIGBUF_SIZE-1] = { 0 }; | |
2037 | ||
2038 | int n = strtol(Cmd, NULL, 0); | |
2039 | if (n == 0) | |
2040 | n = sizeof(got); | |
2041 | ||
2042 | if (n > sizeof(got)) | |
2043 | n = sizeof(got); | |
2044 | ||
2045 | PrintAndLog("Reading %d bytes from device memory\n", n); | |
2046 | GetFromBigBuf(got,n,0); | |
2047 | PrintAndLog("Data fetched"); | |
2048 | UsbCommand response; | |
2049 | WaitForResponse(CMD_ACK, &response); | |
2050 | uint8_t bits_per_sample = 8; | |
2051 | ||
2052 | //Old devices without this feature would send 0 at arg[0] | |
2053 | if(response.arg[0] > 0) | |
2054 | { | |
2055 | sample_config *sc = (sample_config *) response.d.asBytes; | |
2056 | PrintAndLog("Samples @ %d bits/smpl, decimation 1:%d ", sc->bits_per_sample | |
2057 | , sc->decimation); | |
2058 | bits_per_sample = sc->bits_per_sample; | |
2059 | } | |
2060 | if(bits_per_sample < 8) | |
2061 | { | |
2062 | PrintAndLog("Unpacking..."); | |
2063 | BitstreamOut bout = { got, bits_per_sample * n, 0}; | |
2064 | int j =0; | |
2065 | for (j = 0; j * bits_per_sample < n * 8 && j < sizeof(GraphBuffer); j++) { | |
2066 | uint8_t sample = getByte(bits_per_sample, &bout); | |
2067 | GraphBuffer[j] = ((int) sample )- 128; | |
2068 | } | |
2069 | GraphTraceLen = j; | |
2070 | PrintAndLog("Unpacked %d samples" , j ); | |
2071 | }else | |
2072 | { | |
2073 | for (int j = 0; j < n; j++) { | |
2074 | GraphBuffer[j] = ((int)got[j]) - 128; | |
2075 | } | |
2076 | GraphTraceLen = n; | |
2077 | } | |
2078 | ||
2079 | RepaintGraphWindow(); | |
2080 | return 0; | |
2081 | } | |
2082 | ||
2083 | int CmdTuneSamples(const char *Cmd) | |
2084 | { | |
2085 | int timeout = 0; | |
2086 | printf("\nMeasuring antenna characteristics, please wait..."); | |
2087 | ||
2088 | UsbCommand c = {CMD_MEASURE_ANTENNA_TUNING}; | |
2089 | SendCommand(&c); | |
2090 | ||
2091 | UsbCommand resp; | |
2092 | while(!WaitForResponseTimeout(CMD_MEASURED_ANTENNA_TUNING,&resp,1000)) { | |
2093 | timeout++; | |
2094 | printf("."); | |
2095 | if (timeout > 7) { | |
2096 | PrintAndLog("\nNo response from Proxmark. Aborting..."); | |
2097 | return 1; | |
2098 | } | |
2099 | } | |
2100 | ||
2101 | int peakv, peakf; | |
2102 | int vLf125, vLf134, vHf; | |
2103 | vLf125 = resp.arg[0] & 0xffff; | |
2104 | vLf134 = resp.arg[0] >> 16; | |
2105 | vHf = resp.arg[1] & 0xffff;; | |
2106 | peakf = resp.arg[2] & 0xffff; | |
2107 | peakv = resp.arg[2] >> 16; | |
2108 | PrintAndLog(""); | |
2109 | PrintAndLog("# LF antenna: %5.2f V @ 125.00 kHz", vLf125/1000.0); | |
2110 | PrintAndLog("# LF antenna: %5.2f V @ 134.00 kHz", vLf134/1000.0); | |
2111 | PrintAndLog("# LF optimal: %5.2f V @%9.2f kHz", peakv/1000.0, 12000.0/(peakf+1)); | |
2112 | PrintAndLog("# HF antenna: %5.2f V @ 13.56 MHz", vHf/1000.0); | |
2113 | ||
2114 | #define LF_UNUSABLE_V 2948 // was 2000. Changed due to bugfix in voltage measurements. LF results are now 47% higher. | |
2115 | #define LF_MARGINAL_V 14739 // was 10000. Changed due to bugfix bug in voltage measurements. LF results are now 47% higher. | |
2116 | #define HF_UNUSABLE_V 3167 // was 2000. Changed due to bugfix in voltage measurements. HF results are now 58% higher. | |
2117 | #define HF_MARGINAL_V 7917 // was 5000. Changed due to bugfix in voltage measurements. HF results are now 58% higher. | |
2118 | ||
2119 | if (peakv < LF_UNUSABLE_V) | |
2120 | PrintAndLog("# Your LF antenna is unusable."); | |
2121 | else if (peakv < LF_MARGINAL_V) | |
2122 | PrintAndLog("# Your LF antenna is marginal."); | |
2123 | if (vHf < HF_UNUSABLE_V) | |
2124 | PrintAndLog("# Your HF antenna is unusable."); | |
2125 | else if (vHf < HF_MARGINAL_V) | |
2126 | PrintAndLog("# Your HF antenna is marginal."); | |
2127 | ||
2128 | if (peakv >= LF_UNUSABLE_V) { | |
2129 | for (int i = 0; i < 256; i++) { | |
2130 | GraphBuffer[i] = resp.d.asBytes[i] - 128; | |
2131 | } | |
2132 | PrintAndLog("Displaying LF tuning graph. Divisor 89 is 134khz, 95 is 125khz.\n"); | |
2133 | PrintAndLog("\n"); | |
2134 | GraphTraceLen = 256; | |
2135 | ShowGraphWindow(); | |
2136 | RepaintGraphWindow(); | |
2137 | } | |
2138 | ||
2139 | return 0; | |
2140 | } | |
2141 | ||
2142 | ||
2143 | int CmdLoad(const char *Cmd) | |
2144 | { | |
2145 | char filename[FILE_PATH_SIZE] = {0x00}; | |
2146 | int len = 0; | |
2147 | ||
2148 | len = strlen(Cmd); | |
2149 | if (len > FILE_PATH_SIZE) len = FILE_PATH_SIZE; | |
2150 | memcpy(filename, Cmd, len); | |
2151 | ||
2152 | FILE *f = fopen(filename, "r"); | |
2153 | if (!f) { | |
2154 | PrintAndLog("couldn't open '%s'", filename); | |
2155 | return 0; | |
2156 | } | |
2157 | ||
2158 | GraphTraceLen = 0; | |
2159 | char line[80]; | |
2160 | while (fgets(line, sizeof (line), f)) { | |
2161 | GraphBuffer[GraphTraceLen] = atoi(line); | |
2162 | GraphTraceLen++; | |
2163 | } | |
2164 | fclose(f); | |
2165 | PrintAndLog("loaded %d samples", GraphTraceLen); | |
2166 | RepaintGraphWindow(); | |
2167 | return 0; | |
2168 | } | |
2169 | ||
2170 | int CmdLtrim(const char *Cmd) | |
2171 | { | |
2172 | int ds = atoi(Cmd); | |
2173 | ||
2174 | for (int i = ds; i < GraphTraceLen; ++i) | |
2175 | GraphBuffer[i-ds] = GraphBuffer[i]; | |
2176 | GraphTraceLen -= ds; | |
2177 | ||
2178 | RepaintGraphWindow(); | |
2179 | return 0; | |
2180 | } | |
2181 | ||
2182 | // trim graph to input argument length | |
2183 | int CmdRtrim(const char *Cmd) | |
2184 | { | |
2185 | int ds = atoi(Cmd); | |
2186 | ||
2187 | GraphTraceLen = ds; | |
2188 | ||
2189 | RepaintGraphWindow(); | |
2190 | return 0; | |
2191 | } | |
2192 | ||
2193 | /* | |
2194 | * Manchester demodulate a bitstream. The bitstream needs to be already in | |
2195 | * the GraphBuffer as 0 and 1 values | |
2196 | * | |
2197 | * Give the clock rate as argument in order to help the sync - the algorithm | |
2198 | * resyncs at each pulse anyway. | |
2199 | * | |
2200 | * Not optimized by any means, this is the 1st time I'm writing this type of | |
2201 | * routine, feel free to improve... | |
2202 | * | |
2203 | * 1st argument: clock rate (as number of samples per clock rate) | |
2204 | * Typical values can be 64, 32, 128... | |
2205 | */ | |
2206 | int CmdManchesterDemod(const char *Cmd) | |
2207 | { | |
2208 | int i, j, invert= 0; | |
2209 | int bit; | |
2210 | int clock; | |
2211 | int lastval = 0; | |
2212 | int low = 0; | |
2213 | int high = 0; | |
2214 | int hithigh, hitlow, first; | |
2215 | int lc = 0; | |
2216 | int bitidx = 0; | |
2217 | int bit2idx = 0; | |
2218 | int warnings = 0; | |
2219 | ||
2220 | /* check if we're inverting output */ | |
2221 | if (*Cmd == 'i') | |
2222 | { | |
2223 | PrintAndLog("Inverting output"); | |
2224 | invert = 1; | |
2225 | ++Cmd; | |
2226 | do | |
2227 | ++Cmd; | |
2228 | while(*Cmd == ' '); // in case a 2nd argument was given | |
2229 | } | |
2230 | ||
2231 | /* Holds the decoded bitstream: each clock period contains 2 bits */ | |
2232 | /* later simplified to 1 bit after manchester decoding. */ | |
2233 | /* Add 10 bits to allow for noisy / uncertain traces without aborting */ | |
2234 | /* int BitStream[GraphTraceLen*2/clock+10]; */ | |
2235 | ||
2236 | /* But it does not work if compiling on WIndows: therefore we just allocate a */ | |
2237 | /* large array */ | |
2238 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN] = {0}; | |
2239 | ||
2240 | /* Detect high and lows */ | |
2241 | for (i = 0; i < GraphTraceLen; i++) | |
2242 | { | |
2243 | if (GraphBuffer[i] > high) | |
2244 | high = GraphBuffer[i]; | |
2245 | else if (GraphBuffer[i] < low) | |
2246 | low = GraphBuffer[i]; | |
2247 | } | |
2248 | ||
2249 | /* Get our clock */ | |
2250 | clock = GetAskClock(Cmd, high, 1); | |
2251 | ||
2252 | int tolerance = clock/4; | |
2253 | ||
2254 | /* Detect first transition */ | |
2255 | /* Lo-Hi (arbitrary) */ | |
2256 | /* skip to the first high */ | |
2257 | for (i= 0; i < GraphTraceLen; i++) | |
2258 | if (GraphBuffer[i] == high) | |
2259 | break; | |
2260 | /* now look for the first low */ | |
2261 | for (; i < GraphTraceLen; i++) | |
2262 | { | |
2263 | if (GraphBuffer[i] == low) | |
2264 | { | |
2265 | lastval = i; | |
2266 | break; | |
2267 | } | |
2268 | } | |
2269 | ||
2270 | /* If we're not working with 1/0s, demod based off clock */ | |
2271 | if (high != 1) | |
2272 | { | |
2273 | bit = 0; /* We assume the 1st bit is zero, it may not be | |
2274 | * the case: this routine (I think) has an init problem. | |
2275 | * Ed. | |
2276 | */ | |
2277 | for (; i < (int)(GraphTraceLen / clock); i++) | |
2278 | { | |
2279 | hithigh = 0; | |
2280 | hitlow = 0; | |
2281 | first = 1; | |
2282 | ||
2283 | /* Find out if we hit both high and low peaks */ | |
2284 | for (j = 0; j < clock; j++) | |
2285 | { | |
2286 | if (GraphBuffer[(i * clock) + j] == high) | |
2287 | hithigh = 1; | |
2288 | else if (GraphBuffer[(i * clock) + j] == low) | |
2289 | hitlow = 1; | |
2290 | ||
2291 | /* it doesn't count if it's the first part of our read | |
2292 | because it's really just trailing from the last sequence */ | |
2293 | if (first && (hithigh || hitlow)) | |
2294 | hithigh = hitlow = 0; | |
2295 | else | |
2296 | first = 0; | |
2297 | ||
2298 | if (hithigh && hitlow) | |
2299 | break; | |
2300 | } | |
2301 | ||
2302 | /* If we didn't hit both high and low peaks, we had a bit transition */ | |
2303 | if (!hithigh || !hitlow) | |
2304 | bit ^= 1; | |
2305 | ||
2306 | BitStream[bit2idx++] = bit ^ invert; | |
2307 | } | |
2308 | } | |
2309 | ||
2310 | /* standard 1/0 bitstream */ | |
2311 | else | |
2312 | { | |
2313 | ||
2314 | /* Then detect duration between 2 successive transitions */ | |
2315 | for (bitidx = 1; i < GraphTraceLen; i++) | |
2316 | { | |
2317 | if (GraphBuffer[i-1] != GraphBuffer[i]) | |
2318 | { | |
2319 | lc = i-lastval; | |
2320 | lastval = i; | |
2321 | ||
2322 | // Error check: if bitidx becomes too large, we do not | |
2323 | // have a Manchester encoded bitstream or the clock is really | |
2324 | // wrong! | |
2325 | if (bitidx > (GraphTraceLen*2/clock+8) ) { | |
2326 | PrintAndLog("Error: the clock you gave is probably wrong, aborting."); | |
2327 | return 0; | |
2328 | } | |
2329 | // Then switch depending on lc length: | |
2330 | // Tolerance is 1/4 of clock rate (arbitrary) | |
2331 | if (abs(lc-clock/2) < tolerance) { | |
2332 | // Short pulse : either "1" or "0" | |
2333 | BitStream[bitidx++]=GraphBuffer[i-1]; | |
2334 | } else if (abs(lc-clock) < tolerance) { | |
2335 | // Long pulse: either "11" or "00" | |
2336 | BitStream[bitidx++]=GraphBuffer[i-1]; | |
2337 | BitStream[bitidx++]=GraphBuffer[i-1]; | |
2338 | } else { | |
2339 | // Error | |
2340 | warnings++; | |
2341 | PrintAndLog("Warning: Manchester decode error for pulse width detection."); | |
2342 | PrintAndLog("(too many of those messages mean either the stream is not Manchester encoded, or clock is wrong)"); | |
2343 | ||
2344 | if (warnings > 10) | |
2345 | { | |
2346 | PrintAndLog("Error: too many detection errors, aborting."); | |
2347 | return 0; | |
2348 | } | |
2349 | } | |
2350 | } | |
2351 | } | |
2352 | ||
2353 | // At this stage, we now have a bitstream of "01" ("1") or "10" ("0"), parse it into final decoded bitstream | |
2354 | // Actually, we overwrite BitStream with the new decoded bitstream, we just need to be careful | |
2355 | // to stop output at the final bitidx2 value, not bitidx | |
2356 | for (i = 0; i < bitidx; i += 2) { | |
2357 | if ((BitStream[i] == 0) && (BitStream[i+1] == 1)) { | |
2358 | BitStream[bit2idx++] = 1 ^ invert; | |
2359 | } else if ((BitStream[i] == 1) && (BitStream[i+1] == 0)) { | |
2360 | BitStream[bit2idx++] = 0 ^ invert; | |
2361 | } else { | |
2362 | // We cannot end up in this state, this means we are unsynchronized, | |
2363 | // move up 1 bit: | |
2364 | i++; | |
2365 | warnings++; | |
2366 | PrintAndLog("Unsynchronized, resync..."); | |
2367 | PrintAndLog("(too many of those messages mean the stream is not Manchester encoded)"); | |
2368 | ||
2369 | if (warnings > 10) | |
2370 | { | |
2371 | PrintAndLog("Error: too many decode errors, aborting."); | |
2372 | return 0; | |
2373 | } | |
2374 | } | |
2375 | } | |
2376 | } | |
2377 | ||
2378 | PrintAndLog("Manchester decoded bitstream"); | |
2379 | // Now output the bitstream to the scrollback by line of 16 bits | |
2380 | for (i = 0; i < (bit2idx-16); i+=16) { | |
2381 | PrintAndLog("%i %i %i %i %i %i %i %i %i %i %i %i %i %i %i %i", | |
2382 | BitStream[i], | |
2383 | BitStream[i+1], | |
2384 | BitStream[i+2], | |
2385 | BitStream[i+3], | |
2386 | BitStream[i+4], | |
2387 | BitStream[i+5], | |
2388 | BitStream[i+6], | |
2389 | BitStream[i+7], | |
2390 | BitStream[i+8], | |
2391 | BitStream[i+9], | |
2392 | BitStream[i+10], | |
2393 | BitStream[i+11], | |
2394 | BitStream[i+12], | |
2395 | BitStream[i+13], | |
2396 | BitStream[i+14], | |
2397 | BitStream[i+15]); | |
2398 | } | |
2399 | return 0; | |
2400 | } | |
2401 | ||
2402 | /* Modulate our data into manchester */ | |
2403 | int CmdManchesterMod(const char *Cmd) | |
2404 | { | |
2405 | int i, j; | |
2406 | int clock; | |
2407 | int bit, lastbit, wave; | |
2408 | ||
2409 | /* Get our clock */ | |
2410 | clock = GetAskClock(Cmd, 0, 1); | |
2411 | ||
2412 | wave = 0; | |
2413 | lastbit = 1; | |
2414 | for (i = 0; i < (int)(GraphTraceLen / clock); i++) | |
2415 | { | |
2416 | bit = GraphBuffer[i * clock] ^ 1; | |
2417 | ||
2418 | for (j = 0; j < (int)(clock/2); j++) | |
2419 | GraphBuffer[(i * clock) + j] = bit ^ lastbit ^ wave; | |
2420 | for (j = (int)(clock/2); j < clock; j++) | |
2421 | GraphBuffer[(i * clock) + j] = bit ^ lastbit ^ wave ^ 1; | |
2422 | ||
2423 | /* Keep track of how we start our wave and if we changed or not this time */ | |
2424 | wave ^= bit ^ lastbit; | |
2425 | lastbit = bit; | |
2426 | } | |
2427 | ||
2428 | RepaintGraphWindow(); | |
2429 | return 0; | |
2430 | } | |
2431 | ||
2432 | int CmdNorm(const char *Cmd) | |
2433 | { | |
2434 | int i; | |
2435 | int max = INT_MIN, min = INT_MAX; | |
2436 | ||
2437 | for (i = 10; i < GraphTraceLen; ++i) { | |
2438 | if (GraphBuffer[i] > max) | |
2439 | max = GraphBuffer[i]; | |
2440 | if (GraphBuffer[i] < min) | |
2441 | min = GraphBuffer[i]; | |
2442 | } | |
2443 | ||
2444 | if (max != min) { | |
2445 | for (i = 0; i < GraphTraceLen; ++i) { | |
2446 | GraphBuffer[i] = (GraphBuffer[i] - ((max + min) / 2)) * 256 / | |
2447 | (max - min); | |
2448 | //marshmelow: adjusted *1000 to *256 to make +/- 128 so demod commands still work | |
2449 | } | |
2450 | } | |
2451 | RepaintGraphWindow(); | |
2452 | return 0; | |
2453 | } | |
2454 | ||
2455 | int CmdPlot(const char *Cmd) | |
2456 | { | |
2457 | ShowGraphWindow(); | |
2458 | return 0; | |
2459 | } | |
2460 | ||
2461 | int CmdSave(const char *Cmd) | |
2462 | { | |
2463 | char filename[FILE_PATH_SIZE] = {0x00}; | |
2464 | int len = 0; | |
2465 | ||
2466 | len = strlen(Cmd); | |
2467 | if (len > FILE_PATH_SIZE) len = FILE_PATH_SIZE; | |
2468 | memcpy(filename, Cmd, len); | |
2469 | ||
2470 | ||
2471 | FILE *f = fopen(filename, "w"); | |
2472 | if(!f) { | |
2473 | PrintAndLog("couldn't open '%s'", filename); | |
2474 | return 0; | |
2475 | } | |
2476 | int i; | |
2477 | for (i = 0; i < GraphTraceLen; i++) { | |
2478 | fprintf(f, "%d\n", GraphBuffer[i]); | |
2479 | } | |
2480 | fclose(f); | |
2481 | PrintAndLog("saved to '%s'", Cmd); | |
2482 | return 0; | |
2483 | } | |
2484 | ||
2485 | int CmdScale(const char *Cmd) | |
2486 | { | |
2487 | CursorScaleFactor = atoi(Cmd); | |
2488 | if (CursorScaleFactor == 0) { | |
2489 | PrintAndLog("bad, can't have zero scale"); | |
2490 | CursorScaleFactor = 1; | |
2491 | } | |
2492 | RepaintGraphWindow(); | |
2493 | return 0; | |
2494 | } | |
2495 | ||
2496 | int CmdThreshold(const char *Cmd) | |
2497 | { | |
2498 | int threshold = atoi(Cmd); | |
2499 | ||
2500 | for (int i = 0; i < GraphTraceLen; ++i) { | |
2501 | if (GraphBuffer[i] >= threshold) | |
2502 | GraphBuffer[i] = 1; | |
2503 | else | |
2504 | GraphBuffer[i] = -1; | |
2505 | } | |
2506 | RepaintGraphWindow(); | |
2507 | return 0; | |
2508 | } | |
2509 | ||
2510 | int CmdDirectionalThreshold(const char *Cmd) | |
2511 | { | |
2512 | int8_t upThres = param_get8(Cmd, 0); | |
2513 | int8_t downThres = param_get8(Cmd, 1); | |
2514 | ||
2515 | printf("Applying Up Threshold: %d, Down Threshold: %d\n", upThres, downThres); | |
2516 | ||
2517 | int lastValue = GraphBuffer[0]; | |
2518 | GraphBuffer[0] = 0; // Will be changed at the end, but init 0 as we adjust to last samples value if no threshold kicks in. | |
2519 | ||
2520 | for (int i = 1; i < GraphTraceLen; ++i) { | |
2521 | // Apply first threshold to samples heading up | |
2522 | if (GraphBuffer[i] >= upThres && GraphBuffer[i] > lastValue) | |
2523 | { | |
2524 | lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it. | |
2525 | GraphBuffer[i] = 1; | |
2526 | } | |
2527 | // Apply second threshold to samples heading down | |
2528 | else if (GraphBuffer[i] <= downThres && GraphBuffer[i] < lastValue) | |
2529 | { | |
2530 | lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it. | |
2531 | GraphBuffer[i] = -1; | |
2532 | } | |
2533 | else | |
2534 | { | |
2535 | lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it. | |
2536 | GraphBuffer[i] = GraphBuffer[i-1]; | |
2537 | ||
2538 | } | |
2539 | } | |
2540 | GraphBuffer[0] = GraphBuffer[1]; // Aline with first edited sample. | |
2541 | RepaintGraphWindow(); | |
2542 | return 0; | |
2543 | } | |
2544 | ||
2545 | int CmdZerocrossings(const char *Cmd) | |
2546 | { | |
2547 | // Zero-crossings aren't meaningful unless the signal is zero-mean. | |
2548 | CmdHpf(""); | |
2549 | ||
2550 | int sign = 1; | |
2551 | int zc = 0; | |
2552 | int lastZc = 0; | |
2553 | ||
2554 | for (int i = 0; i < GraphTraceLen; ++i) { | |
2555 | if (GraphBuffer[i] * sign >= 0) { | |
2556 | // No change in sign, reproduce the previous sample count. | |
2557 | zc++; | |
2558 | GraphBuffer[i] = lastZc; | |
2559 | } else { | |
2560 | // Change in sign, reset the sample count. | |
2561 | sign = -sign; | |
2562 | GraphBuffer[i] = lastZc; | |
2563 | if (sign > 0) { | |
2564 | lastZc = zc; | |
2565 | zc = 0; | |
2566 | } | |
2567 | } | |
2568 | } | |
2569 | ||
2570 | RepaintGraphWindow(); | |
2571 | return 0; | |
2572 | } | |
2573 | ||
2574 | static command_t CommandTable[] = | |
2575 | { | |
2576 | {"help", CmdHelp, 1, "This help"}, | |
2577 | {"amp", CmdAmp, 1, "Amplify peaks"}, | |
2578 | //{"askdemod", Cmdaskdemod, 1, "<0 or 1> -- Attempt to demodulate simple ASK tags"}, | |
2579 | {"askedgedetect", CmdAskEdgeDetect, 1, "[threshold] Adjust Graph for manual ask demod using length of sample differences to detect the edge of a wave (default = 25)"}, | |
2580 | {"askem410xdemod",CmdAskEM410xDemod, 1, "[clock] [invert<0|1>] [maxErr] -- Demodulate an EM410x tag from GraphBuffer (args optional)"}, | |
2581 | {"askgproxiidemod",CmdG_Prox_II_Demod,1, "Demodulate a G Prox II tag from GraphBuffer"}, | |
2582 | //{"askmandemod", Cmdaskmandemod, 1, "[clock] [invert<0|1>] [maxErr] -- Attempt to demodulate ASK/Manchester tags and output binary (args optional)"}, | |
2583 | //{"askrawdemod", Cmdaskrawdemod, 1, "[clock] [invert<0|1>] -- Attempt to demodulate ASK tags and output bin (args optional)"}, | |
2584 | {"autocorr", CmdAutoCorr, 1, "<window length> -- Autocorrelation over window"}, | |
2585 | {"biphaserawdecode",CmdBiphaseDecodeRaw,1,"[offset] [invert<0|1>] Biphase decode bin stream in DemodBuffer (offset = 0|1 bits to shift the decode start)"}, | |
2586 | {"bitsamples", CmdBitsamples, 0, "Get raw samples as bitstring"}, | |
2587 | //{"bitstream", CmdBitstream, 1, "[clock rate] -- Convert waveform into a bitstream"}, | |
2588 | {"buffclear", CmdBuffClear, 1, "Clear sample buffer and graph window"}, | |
2589 | {"dec", CmdDec, 1, "Decimate samples"}, | |
2590 | {"detectclock", CmdDetectClockRate, 1, "[modulation] Detect clock rate of wave in GraphBuffer (options: 'a','f','n','p' for ask, fsk, nrz, psk respectively)"}, | |
2591 | //{"fskdemod", CmdFSKdemod, 1, "Demodulate graph window as a HID FSK"}, | |
2592 | {"fskawiddemod", CmdFSKdemodAWID, 1, "Demodulate an AWID FSK tag from GraphBuffer"}, | |
2593 | //{"fskfcdetect", CmdFSKfcDetect, 1, "Try to detect the Field Clock of an FSK wave"}, | |
2594 | {"fskhiddemod", CmdFSKdemodHID, 1, "Demodulate a HID FSK tag from GraphBuffer"}, | |
2595 | {"fskiodemod", CmdFSKdemodIO, 1, "Demodulate an IO Prox FSK tag from GraphBuffer"}, | |
2596 | {"fskpyramiddemod",CmdFSKdemodPyramid,1, "Demodulate a Pyramid FSK tag from GraphBuffer"}, | |
2597 | {"fskparadoxdemod",CmdFSKdemodParadox,1, "Demodulate a Paradox FSK tag from GraphBuffer"}, | |
2598 | //{"fskrawdemod", CmdFSKrawdemod, 1, "[clock rate] [invert] [rchigh] [rclow] Demodulate graph window from FSK to bin (clock = 50)(invert = 1|0)(rchigh = 10)(rclow=8)"}, | |
2599 | {"getbitstream", CmdGetBitStream, 1, "Convert GraphBuffer's >=1 values to 1 and <1 to 0"}, | |
2600 | {"grid", CmdGrid, 1, "<x> <y> -- overlay grid on graph window, use zero value to turn off either"}, | |
2601 | {"hexsamples", CmdHexsamples, 0, "<bytes> [<offset>] -- Dump big buffer as hex bytes"}, | |
2602 | {"hide", CmdHide, 1, "Hide graph window"}, | |
2603 | {"hpf", CmdHpf, 1, "Remove DC offset from trace"}, | |
2604 | {"load", CmdLoad, 1, "<filename> -- Load trace (to graph window"}, | |
2605 | {"ltrim", CmdLtrim, 1, "<samples> -- Trim samples from left of trace"}, | |
2606 | {"rtrim", CmdRtrim, 1, "<location to end trace> -- Trim samples from right of trace"}, | |
2607 | //{"mandemod", CmdManchesterDemod, 1, "[i] [clock rate] -- Manchester demodulate binary stream (option 'i' to invert output)"}, | |
2608 | {"manrawdecode", Cmdmandecoderaw, 1, "Manchester decode binary stream in DemodBuffer"}, | |
2609 | {"manmod", CmdManchesterMod, 1, "[clock rate] -- Manchester modulate a binary stream"}, | |
2610 | {"norm", CmdNorm, 1, "Normalize max/min to +/-128"}, | |
2611 | //{"nrzdetectclock",CmdDetectNRZClockRate, 1, "Detect ASK, PSK, or NRZ clock rate"}, | |
2612 | //{"nrzrawdemod", CmdNRZrawDemod, 1, "[clock] [invert<0|1>] [maxErr] -- Attempt to demodulate nrz tags and output binary (args optional)"}, | |
2613 | {"plot", CmdPlot, 1, "Show graph window (hit 'h' in window for keystroke help)"}, | |
2614 | //{"pskdetectclock",CmdDetectPSKClockRate, 1, "Detect ASK, PSK, or NRZ clock rate"}, | |
2615 | {"printdemodbuffer",CmdPrintDemodBuff,1, "[x] -- print the data in the DemodBuffer - 'x' for hex output"}, | |
2616 | {"pskindalademod",CmdIndalaDecode, 1, "[clock] [invert<0|1>] -- Demodulate an indala tag (PSK1) from GraphBuffer (args optional)"}, | |
2617 | //{"psk1rawdemod", CmdPSK1rawDemod, 1, "[clock] [invert<0|1>] [maxErr] -- Attempt to demodulate psk1 tags and output binary (args optional)"}, | |
2618 | //{"psk2rawdemod", CmdPSK2rawDemod, 1, "[clock] [invert<0|1>] [maxErr] -- Attempt to demodulate psk2 tags and output binary (args optional)"}, | |
2619 | {"rawdemod", CmdRawDemod, 1, "[modulation] ... <options> -see help (h option) -- Demodulate the data in the GraphBuffer and output binary"}, | |
2620 | {"samples", CmdSamples, 0, "[512 - 40000] -- Get raw samples for graph window (GraphBuffer)"}, | |
2621 | {"save", CmdSave, 1, "<filename> -- Save trace (from graph window)"}, | |
2622 | {"scale", CmdScale, 1, "<int> -- Set cursor display scale"}, | |
2623 | {"setdebugmode", CmdSetDebugMode, 1, "<0|1> -- Turn on or off Debugging Mode for demods"}, | |
2624 | {"shiftgraphzero",CmdGraphShiftZero, 1, "<shift> -- Shift 0 for Graphed wave + or - shift value"}, | |
2625 | //{"threshold", CmdThreshold, 1, "<threshold> -- Maximize/minimize every value in the graph window depending on threshold"}, | |
2626 | {"dirthreshold", CmdDirectionalThreshold, 1, "<thres up> <thres down> -- Max rising higher up-thres/ Min falling lower down-thres, keep rest as prev."}, | |
2627 | {"tune", CmdTuneSamples, 0, "Get hw tune samples for graph window"}, | |
2628 | {"undec", CmdUndec, 1, "Un-decimate samples by 2"}, | |
2629 | {"zerocrossings", CmdZerocrossings, 1, "Count time between zero-crossings"}, | |
2630 | {NULL, NULL, 0, NULL} | |
2631 | }; | |
2632 | ||
2633 | int CmdData(const char *Cmd) | |
2634 | { | |
2635 | CmdsParse(CommandTable, Cmd); | |
2636 | return 0; | |
2637 | } | |
2638 | ||
2639 | int CmdHelp(const char *Cmd) | |
2640 | { | |
2641 | CmdsHelp(CommandTable); | |
2642 | return 0; | |
2643 | } |