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