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