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