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