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