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