]>
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> | |
eb191de6 | 14 | //#include <inttypes.h> |
7fe9b0b7 | 15 | #include <limits.h> |
902cb3c0 | 16 | #include "proxmark3.h" |
7fe9b0b7 | 17 | #include "data.h" |
18 | #include "ui.h" | |
19 | #include "graph.h" | |
20 | #include "cmdparser.h" | |
d51b2eda | 21 | #include "util.h" |
7fe9b0b7 | 22 | #include "cmdmain.h" |
23 | #include "cmddata.h" | |
7db5f1ca | 24 | #include "lfdemod.h" |
7fe9b0b7 | 25 | |
26 | static int CmdHelp(const char *Cmd); | |
27 | ||
28 | int CmdAmp(const char *Cmd) | |
29 | { | |
30 | int i, rising, falling; | |
31 | int max = INT_MIN, min = INT_MAX; | |
32 | ||
33 | for (i = 10; i < GraphTraceLen; ++i) { | |
34 | if (GraphBuffer[i] > max) | |
35 | max = GraphBuffer[i]; | |
36 | if (GraphBuffer[i] < min) | |
37 | min = GraphBuffer[i]; | |
38 | } | |
39 | ||
40 | if (max != min) { | |
41 | rising = falling= 0; | |
42 | for (i = 0; i < GraphTraceLen; ++i) { | |
43 | if (GraphBuffer[i + 1] < GraphBuffer[i]) { | |
44 | if (rising) { | |
45 | GraphBuffer[i] = max; | |
46 | rising = 0; | |
47 | } | |
48 | falling = 1; | |
49 | } | |
50 | if (GraphBuffer[i + 1] > GraphBuffer[i]) { | |
51 | if (falling) { | |
52 | GraphBuffer[i] = min; | |
53 | falling = 0; | |
54 | } | |
55 | rising= 1; | |
56 | } | |
57 | } | |
58 | } | |
59 | RepaintGraphWindow(); | |
60 | return 0; | |
61 | } | |
62 | ||
63 | /* | |
64 | * Generic command to demodulate ASK. | |
65 | * | |
66 | * Argument is convention: positive or negative (High mod means zero | |
67 | * or high mod means one) | |
68 | * | |
69 | * Updates the Graph trace with 0/1 values | |
70 | * | |
71 | * Arguments: | |
72 | * c : 0 or 1 | |
73 | */ | |
2fc2150e | 74 | //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 | 75 | int Cmdaskdemod(const char *Cmd) |
76 | { | |
77 | int i; | |
78 | int c, high = 0, low = 0; | |
79 | ||
80 | // TODO: complain if we do not give 2 arguments here ! | |
81 | // (AL - this doesn't make sense! we're only using one argument!!!) | |
82 | sscanf(Cmd, "%i", &c); | |
83 | ||
84 | /* Detect high and lows and clock */ | |
b3b70669 | 85 | // (AL - clock???) |
7fe9b0b7 | 86 | for (i = 0; i < GraphTraceLen; ++i) |
87 | { | |
88 | if (GraphBuffer[i] > high) | |
89 | high = GraphBuffer[i]; | |
90 | else if (GraphBuffer[i] < low) | |
91 | low = GraphBuffer[i]; | |
92 | } | |
eb191de6 | 93 | high=abs(high*.75); |
94 | low=abs(low*.75); | |
7fe9b0b7 | 95 | if (c != 0 && c != 1) { |
96 | PrintAndLog("Invalid argument: %s", Cmd); | |
97 | return 0; | |
98 | } | |
b3b70669 | 99 | //prime loop |
7fe9b0b7 | 100 | if (GraphBuffer[0] > 0) { |
101 | GraphBuffer[0] = 1-c; | |
102 | } else { | |
103 | GraphBuffer[0] = c; | |
104 | } | |
105 | for (i = 1; i < GraphTraceLen; ++i) { | |
106 | /* Transitions are detected at each peak | |
107 | * Transitions are either: | |
108 | * - we're low: transition if we hit a high | |
109 | * - we're high: transition if we hit a low | |
110 | * (we need to do it this way because some tags keep high or | |
111 | * low for long periods, others just reach the peak and go | |
112 | * down) | |
113 | */ | |
ae2f73c1 | 114 | //[marhsmellow] change == to >= for high and <= for low for fuzz |
115 | if ((GraphBuffer[i] == high) && (GraphBuffer[i - 1] == c)) { | |
7fe9b0b7 | 116 | GraphBuffer[i] = 1 - c; |
ae2f73c1 | 117 | } else if ((GraphBuffer[i] == low) && (GraphBuffer[i - 1] == (1 - c))){ |
7fe9b0b7 | 118 | GraphBuffer[i] = c; |
119 | } else { | |
120 | /* No transition */ | |
121 | GraphBuffer[i] = GraphBuffer[i - 1]; | |
122 | } | |
123 | } | |
124 | RepaintGraphWindow(); | |
125 | return 0; | |
126 | } | |
127 | ||
eb191de6 | 128 | void printBitStream(uint8_t BitStream[], uint32_t bitLen){ |
2fc2150e | 129 | uint32_t i = 0; |
130 | if (bitLen<16) { | |
131 | PrintAndLog("Too few bits found: %d",bitLen); | |
132 | return; | |
133 | } | |
134 | if (bitLen>512) bitLen=512; | |
135 | for (i = 0; i < (bitLen-16); i+=16) { | |
136 | PrintAndLog("%i%i%i%i%i%i%i%i%i%i%i%i%i%i%i%i", | |
137 | BitStream[i], | |
138 | BitStream[i+1], | |
139 | BitStream[i+2], | |
140 | BitStream[i+3], | |
141 | BitStream[i+4], | |
142 | BitStream[i+5], | |
143 | BitStream[i+6], | |
144 | BitStream[i+7], | |
145 | BitStream[i+8], | |
146 | BitStream[i+9], | |
147 | BitStream[i+10], | |
148 | BitStream[i+11], | |
149 | BitStream[i+12], | |
150 | BitStream[i+13], | |
151 | BitStream[i+14], | |
152 | BitStream[i+15]); | |
153 | } | |
154 | return; | |
155 | } | |
eb191de6 | 156 | void printEM410x(uint64_t id) |
2fc2150e | 157 | { |
eb191de6 | 158 | if (id !=0){ |
0e74c023 | 159 | uint64_t iii=1; |
160 | uint64_t id2lo=0; //id2hi=0, | |
eb191de6 | 161 | uint32_t ii=0; |
162 | uint32_t i=0; | |
0e74c023 | 163 | for (ii=5; ii>0;ii--){ |
2fc2150e | 164 | for (i=0;i<8;i++){ |
eb191de6 | 165 | id2lo=(id2lo<<1LL)|((id & (iii<<(i+((ii-1)*8))))>>(i+((ii-1)*8))); |
2fc2150e | 166 | } |
167 | } | |
0e74c023 | 168 | //output em id |
eb191de6 | 169 | PrintAndLog("EM TAG ID : %010llx", id); |
0e74c023 | 170 | PrintAndLog("Unique TAG ID: %010llx", id2lo); //id2hi, |
eb191de6 | 171 | PrintAndLog("DEZ 8 : %08lld",id & 0xFFFFFF); |
172 | PrintAndLog("DEZ 10 : %010lld",id & 0xFFFFFF); | |
173 | PrintAndLog("DEZ 5.5 : %05lld.%05lld",(id>>16LL) & 0xFFFF,(id & 0xFFFF)); | |
174 | PrintAndLog("DEZ 3.5A : %03lld.%05lld",(id>>32ll),(id & 0xFFFF)); | |
175 | PrintAndLog("DEZ 14/IK2 : %014lld",id); | |
0e74c023 | 176 | PrintAndLog("DEZ 15/IK3 : %015lld",id2lo); |
eb191de6 | 177 | PrintAndLog("Other : %05lld_%03lld_%08lld",(id&0xFFFF),((id>>16LL) & 0xFF),(id & 0xFFFFFF)); |
178 | } | |
179 | return; | |
180 | } | |
181 | ||
182 | int CmdEm410xDecode(const char *Cmd) | |
183 | { | |
184 | uint64_t id=0; | |
185 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0}; | |
186 | uint32_t i=0; | |
187 | for (i=0;i<GraphTraceLen;++i){ | |
188 | BitStream[i]=(uint8_t)(GraphBuffer[i]+128); | |
2fc2150e | 189 | } |
eb191de6 | 190 | id = Em410xDecode(BitStream,i); |
191 | printEM410x(id); | |
2fc2150e | 192 | return 0; |
193 | } | |
194 | ||
eb191de6 | 195 | int getFromGraphBuf(uint8_t *buff) |
196 | { | |
197 | uint32_t i; | |
198 | for (i=0;i<GraphTraceLen;++i) | |
199 | buff[i]=(uint8_t)(GraphBuffer[i]+128); | |
200 | return i; | |
201 | } | |
e888ed8e | 202 | |
203 | //by marshmellow | |
eb191de6 | 204 | //takes 2 arguments - clock and invert both as integers |
205 | //attempts to demodulate ask while decoding manchester | |
e888ed8e | 206 | //prints binary found and saves in graphbuffer for further commands |
9e6dd4eb | 207 | int Cmdaskmandemod(const char *Cmd) |
e888ed8e | 208 | { |
eb191de6 | 209 | int invert=0; |
210 | int clk=0; | |
211 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0}; | |
0e74c023 | 212 | sscanf(Cmd, "%i %i", &clk, &invert); |
e888ed8e | 213 | if (invert != 0 && invert != 1) { |
214 | PrintAndLog("Invalid argument: %s", Cmd); | |
215 | return 0; | |
216 | } | |
eb191de6 | 217 | uint32_t BitLen = getFromGraphBuf(BitStream); |
218 | ||
219 | int errCnt=0; | |
220 | errCnt = askmandemod(BitStream, &BitLen,&clk,&invert); | |
221 | if (errCnt==-1){ //if fatal error (or -1) | |
e888ed8e | 222 | PrintAndLog("no data found"); |
223 | return 0; | |
eb191de6 | 224 | } |
225 | PrintAndLog("Using Clock: %d and invert=%d",clk,invert); | |
226 | //PrintAndLog("Data start pos:%d, lastBit:%d, stop pos:%d, numBits:%d",iii,lastBit,i,bitnum); | |
227 | //move BitStream back to GraphBuffer | |
228 | /* | |
229 | ClearGraph(0); | |
230 | for (i=0; i < bitnum; ++i){ | |
231 | GraphBuffer[i]=BitStream[i]; | |
cd48c19c | 232 | } |
eb191de6 | 233 | GraphTraceLen=bitnum; |
234 | RepaintGraphWindow(); | |
235 | */ | |
236 | //output | |
237 | if (errCnt>0){ | |
238 | PrintAndLog("# Errors during Demoding (shown as 77 in bit stream): %d",errCnt); | |
e888ed8e | 239 | } |
eb191de6 | 240 | PrintAndLog("ASK/Manchester decoded bitstream:"); |
241 | // Now output the bitstream to the scrollback by line of 16 bits | |
242 | printBitStream(BitStream,BitLen); | |
243 | uint64_t lo =0; | |
244 | lo = Em410xDecode(BitStream,BitLen); | |
245 | printEM410x(lo); | |
246 | ||
247 | return 0; | |
248 | } | |
249 | ||
250 | //by marshmellow | |
251 | //biphase demod = 10 (or 01)=1 / 00 (or 11)=0 | |
252 | ||
253 | ||
254 | //by marshmellow | |
255 | //manchester demod | |
256 | //stricktly take 10 and 01 and convert to 0 and 1 | |
257 | int Cmdmandecoderaw(const char *Cmd) | |
258 | { | |
259 | int i =0; | |
260 | int errCnt=0; | |
261 | int bitnum=0; | |
262 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0}; | |
263 | int high=0,low=0; | |
264 | for (;i<GraphTraceLen;++i){ | |
265 | if (GraphBuffer[i]>high) high=GraphBuffer[i]; | |
266 | else if(GraphBuffer[i]<low) low=GraphBuffer[i]; | |
267 | BitStream[i]=GraphBuffer[i]; | |
268 | } | |
269 | if (high>1 || low <0 ){ | |
270 | PrintAndLog("Error: please raw demod the wave first then mancheseter raw decode"); | |
271 | return 0; | |
272 | } | |
273 | bitnum=i; | |
274 | errCnt=manrawdemod(BitStream,&bitnum); | |
275 | PrintAndLog("Manchester Decoded - # errors:%d - data:",errCnt); | |
276 | printBitStream(BitStream,bitnum); | |
277 | if (errCnt==0){ | |
278 | //put back in graphbuffer | |
2fc2150e | 279 | ClearGraph(0); |
eb191de6 | 280 | for (i=0; i<bitnum;++i){ |
2fc2150e | 281 | GraphBuffer[i]=BitStream[i]; |
eb191de6 | 282 | } |
2fc2150e | 283 | GraphTraceLen=bitnum; |
284 | RepaintGraphWindow(); | |
eb191de6 | 285 | uint64_t id = 0; |
286 | id = Em410xDecode(BitStream,i); | |
287 | printEM410x(id); | |
288 | } | |
289 | return 0; | |
290 | } | |
291 | ||
292 | //by marshmellow | |
293 | //takes 2 arguments - clock and invert both as integers | |
294 | //attempts to demodulate ask only | |
295 | //prints binary found and saves in graphbuffer for further commands | |
296 | int Cmdaskrawdemod(const char *Cmd) | |
297 | { | |
298 | uint32_t i; | |
299 | int invert=0; | |
300 | int clk=0; | |
301 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0}; | |
302 | sscanf(Cmd, "%i %i", &clk, &invert); | |
303 | if (invert != 0 && invert != 1) { | |
304 | PrintAndLog("Invalid argument: %s", Cmd); | |
305 | return 0; | |
306 | } | |
307 | int BitLen = getFromGraphBuf(BitStream); | |
308 | int errCnt=0; | |
309 | errCnt = askrawdemod(BitStream, &BitLen,&clk,&invert); | |
310 | if (errCnt==-1){ //throw away static - allow 1 and -1 (in case of threshold command first) | |
311 | PrintAndLog("no data found"); | |
312 | return 0; | |
313 | } | |
314 | PrintAndLog("Using Clock: %d and invert=%d",clk,invert); | |
315 | //PrintAndLog("Data start pos:%d, lastBit:%d, stop pos:%d, numBits:%d",iii,lastBit,i,bitnum); | |
316 | //move BitStream back to GraphBuffer | |
317 | ||
318 | ClearGraph(0); | |
319 | for (i=0; i < BitLen; ++i){ | |
320 | GraphBuffer[i]=BitStream[i]; | |
321 | } | |
322 | GraphTraceLen=BitLen; | |
323 | RepaintGraphWindow(); | |
324 | ||
2fc2150e | 325 | //output |
eb191de6 | 326 | if (errCnt>0){ |
327 | PrintAndLog("# Errors during Demoding (shown as 77 in bit stream): %d",errCnt); | |
328 | } | |
329 | PrintAndLog("ASK demoded bitstream:"); | |
330 | // Now output the bitstream to the scrollback by line of 16 bits | |
331 | printBitStream(BitStream,BitLen); | |
332 | ||
e888ed8e | 333 | return 0; |
334 | } | |
335 | ||
7fe9b0b7 | 336 | int CmdAutoCorr(const char *Cmd) |
337 | { | |
338 | static int CorrelBuffer[MAX_GRAPH_TRACE_LEN]; | |
339 | ||
340 | int window = atoi(Cmd); | |
341 | ||
342 | if (window == 0) { | |
343 | PrintAndLog("needs a window"); | |
344 | return 0; | |
345 | } | |
346 | if (window >= GraphTraceLen) { | |
347 | PrintAndLog("window must be smaller than trace (%d samples)", | |
348 | GraphTraceLen); | |
349 | return 0; | |
350 | } | |
351 | ||
352 | PrintAndLog("performing %d correlations", GraphTraceLen - window); | |
353 | ||
354 | for (int i = 0; i < GraphTraceLen - window; ++i) { | |
355 | int sum = 0; | |
356 | for (int j = 0; j < window; ++j) { | |
357 | sum += (GraphBuffer[j]*GraphBuffer[i + j]) / 256; | |
358 | } | |
359 | CorrelBuffer[i] = sum; | |
360 | } | |
361 | GraphTraceLen = GraphTraceLen - window; | |
362 | memcpy(GraphBuffer, CorrelBuffer, GraphTraceLen * sizeof (int)); | |
363 | ||
364 | RepaintGraphWindow(); | |
365 | return 0; | |
366 | } | |
367 | ||
368 | int CmdBitsamples(const char *Cmd) | |
369 | { | |
370 | int cnt = 0; | |
90d74dc2 | 371 | uint8_t got[12288]; |
372 | ||
373 | GetFromBigBuf(got,sizeof(got),0); | |
374 | WaitForResponse(CMD_ACK,NULL); | |
7fe9b0b7 | 375 | |
90d74dc2 | 376 | for (int j = 0; j < sizeof(got); j++) { |
7fe9b0b7 | 377 | for (int k = 0; k < 8; k++) { |
90d74dc2 | 378 | if(got[j] & (1 << (7 - k))) { |
7fe9b0b7 | 379 | GraphBuffer[cnt++] = 1; |
380 | } else { | |
381 | GraphBuffer[cnt++] = 0; | |
382 | } | |
383 | } | |
7fe9b0b7 | 384 | } |
385 | GraphTraceLen = cnt; | |
386 | RepaintGraphWindow(); | |
387 | return 0; | |
388 | } | |
389 | ||
390 | /* | |
391 | * Convert to a bitstream | |
392 | */ | |
393 | int CmdBitstream(const char *Cmd) | |
394 | { | |
395 | int i, j; | |
396 | int bit; | |
397 | int gtl; | |
398 | int clock; | |
399 | int low = 0; | |
400 | int high = 0; | |
401 | int hithigh, hitlow, first; | |
402 | ||
403 | /* Detect high and lows and clock */ | |
404 | for (i = 0; i < GraphTraceLen; ++i) | |
405 | { | |
406 | if (GraphBuffer[i] > high) | |
407 | high = GraphBuffer[i]; | |
408 | else if (GraphBuffer[i] < low) | |
409 | low = GraphBuffer[i]; | |
410 | } | |
411 | ||
412 | /* Get our clock */ | |
413 | clock = GetClock(Cmd, high, 1); | |
414 | gtl = ClearGraph(0); | |
415 | ||
416 | bit = 0; | |
417 | for (i = 0; i < (int)(gtl / clock); ++i) | |
418 | { | |
419 | hithigh = 0; | |
420 | hitlow = 0; | |
421 | first = 1; | |
422 | /* Find out if we hit both high and low peaks */ | |
423 | for (j = 0; j < clock; ++j) | |
424 | { | |
425 | if (GraphBuffer[(i * clock) + j] == high) | |
426 | hithigh = 1; | |
427 | else if (GraphBuffer[(i * clock) + j] == low) | |
428 | hitlow = 1; | |
429 | /* it doesn't count if it's the first part of our read | |
430 | because it's really just trailing from the last sequence */ | |
431 | if (first && (hithigh || hitlow)) | |
432 | hithigh = hitlow = 0; | |
433 | else | |
434 | first = 0; | |
435 | ||
436 | if (hithigh && hitlow) | |
437 | break; | |
438 | } | |
439 | ||
440 | /* If we didn't hit both high and low peaks, we had a bit transition */ | |
441 | if (!hithigh || !hitlow) | |
442 | bit ^= 1; | |
443 | ||
444 | AppendGraph(0, clock, bit); | |
66707a3b | 445 | // for (j = 0; j < (int)(clock/2); j++) |
446 | // GraphBuffer[(i * clock) + j] = bit ^ 1; | |
447 | // for (j = (int)(clock/2); j < clock; j++) | |
448 | // GraphBuffer[(i * clock) + j] = bit; | |
7fe9b0b7 | 449 | } |
450 | ||
451 | RepaintGraphWindow(); | |
452 | return 0; | |
453 | } | |
454 | ||
455 | int CmdBuffClear(const char *Cmd) | |
456 | { | |
457 | UsbCommand c = {CMD_BUFF_CLEAR}; | |
458 | SendCommand(&c); | |
459 | ClearGraph(true); | |
460 | return 0; | |
461 | } | |
462 | ||
463 | int CmdDec(const char *Cmd) | |
464 | { | |
465 | for (int i = 0; i < (GraphTraceLen / 2); ++i) | |
466 | GraphBuffer[i] = GraphBuffer[i * 2]; | |
467 | GraphTraceLen /= 2; | |
468 | PrintAndLog("decimated by 2"); | |
469 | RepaintGraphWindow(); | |
470 | return 0; | |
471 | } | |
472 | ||
473 | /* Print our clock rate */ | |
474 | int CmdDetectClockRate(const char *Cmd) | |
475 | { | |
476 | int clock = DetectClock(0); | |
477 | PrintAndLog("Auto-detected clock rate: %d", clock); | |
478 | return 0; | |
479 | } | |
66707a3b | 480 | |
2fc2150e | 481 | //by marshmellow |
eb191de6 | 482 | //fsk raw demod and print binary |
483 | //takes 2 arguments - Clock and invert | |
484 | //defaults: clock = 50, invert=0 | |
e888ed8e | 485 | int CmdFSKrawdemod(const char *Cmd) |
b3b70669 | 486 | { |
eb191de6 | 487 | //raw fsk demod no manchester decoding no start bit finding just get binary from wave |
b3b70669 | 488 | //set defaults |
489 | uint8_t rfLen = 50; | |
490 | uint8_t invert=0; | |
491 | //set options from parameters entered with the command | |
492 | if (strlen(Cmd)>0 && strlen(Cmd)<=2) { | |
493 | rfLen=param_get8(Cmd, 0); //if rfLen option only is used | |
494 | if (rfLen==1){ | |
495 | invert=1; //if invert option only is used | |
496 | rfLen = 50; | |
497 | } else if(rfLen==0) rfLen=50; | |
498 | } | |
499 | if (strlen(Cmd)>2) { | |
500 | rfLen=param_get8(Cmd, 0); //if both options are used | |
501 | invert=param_get8(Cmd,1); | |
502 | } | |
503 | PrintAndLog("Args invert: %d \nClock:%d",invert,rfLen); | |
eb191de6 | 504 | uint32_t i=0; |
505 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0}; | |
506 | uint32_t BitLen = getFromGraphBuf(BitStream); | |
507 | int size = fskdemod(BitStream,BitLen,rfLen,invert); | |
b3b70669 | 508 | |
509 | PrintAndLog("FSK decoded bitstream:"); | |
eb191de6 | 510 | ClearGraph(0); |
511 | for (i=0;i<size;++i){ | |
512 | GraphBuffer[i]=BitStream[i]; | |
513 | } | |
514 | GraphTraceLen=size; | |
515 | RepaintGraphWindow(); | |
516 | ||
b3b70669 | 517 | // Now output the bitstream to the scrollback by line of 16 bits |
518 | if(size > (7*32)+2) size = (7*32)+2; //only output a max of 7 blocks of 32 bits most tags will have full bit stream inside that sample size | |
eb191de6 | 519 | printBitStream(BitStream,size); |
b3b70669 | 520 | return 0; |
521 | } | |
522 | ||
eb191de6 | 523 | //by marshmellow (based on existing demod + holiman's refactor) |
524 | //HID Prox demod - FSK RF/50 with preamble of 00011101 (then manchester encoded) | |
525 | //print full HID Prox ID and some bit format details if found | |
b3b70669 | 526 | int CmdFSKdemodHID(const char *Cmd) |
527 | { | |
528 | //raw fsk demod no manchester decoding no start bit finding just get binary from wave | |
b3b70669 | 529 | uint32_t hi2=0, hi=0, lo=0; |
530 | ||
eb191de6 | 531 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0}; |
532 | uint32_t BitLen = getFromGraphBuf(BitStream); | |
b3b70669 | 533 | //get binary from fsk wave |
eb191de6 | 534 | size_t size = HIDdemodFSK(BitStream,BitLen,&hi2,&hi,&lo); |
535 | if (size<0){ | |
536 | PrintAndLog("Error demoding fsk"); | |
537 | return 0; | |
538 | } | |
539 | if (hi2 != 0){ //extra large HID tags | |
540 | PrintAndLog("TAG ID: %x%08x%08x (%d)", | |
541 | (unsigned int) hi2, (unsigned int) hi, (unsigned int) lo, (unsigned int) (lo>>1) & 0xFFFF); | |
542 | } | |
543 | else { //standard HID tags <38 bits | |
544 | //Dbprintf("TAG ID: %x%08x (%d)",(unsigned int) hi, (unsigned int) lo, (unsigned int) (lo>>1) & 0xFFFF); //old print cmd | |
545 | uint8_t bitlen = 0; | |
546 | uint32_t fc = 0; | |
547 | uint32_t cardnum = 0; | |
548 | if (((hi>>5)&1)==1){//if bit 38 is set then < 37 bit format is used | |
549 | uint32_t lo2=0; | |
550 | lo2=(((hi & 15) << 12) | (lo>>20)); //get bits 21-37 to check for format len bit | |
551 | uint8_t idx3 = 1; | |
552 | while(lo2>1){ //find last bit set to 1 (format len bit) | |
553 | lo2=lo2>>1; | |
554 | idx3++; | |
b3b70669 | 555 | } |
eb191de6 | 556 | bitlen =idx3+19; |
557 | fc =0; | |
558 | cardnum=0; | |
559 | if(bitlen==26){ | |
560 | cardnum = (lo>>1)&0xFFFF; | |
561 | fc = (lo>>17)&0xFF; | |
562 | } | |
563 | if(bitlen==37){ | |
564 | cardnum = (lo>>1)&0x7FFFF; | |
565 | fc = ((hi&0xF)<<12)|(lo>>20); | |
566 | } | |
567 | if(bitlen==34){ | |
568 | cardnum = (lo>>1)&0xFFFF; | |
569 | fc= ((hi&1)<<15)|(lo>>17); | |
570 | } | |
571 | if(bitlen==35){ | |
572 | cardnum = (lo>>1)&0xFFFFF; | |
573 | fc = ((hi&1)<<11)|(lo>>21); | |
b3b70669 | 574 | } |
b3b70669 | 575 | } |
eb191de6 | 576 | else { //if bit 38 is not set then 37 bit format is used |
577 | bitlen= 37; | |
578 | fc =0; | |
579 | cardnum=0; | |
580 | if(bitlen==37){ | |
581 | cardnum = (lo>>1)&0x7FFFF; | |
582 | fc = ((hi&0xF)<<12)|(lo>>20); | |
583 | } | |
584 | } | |
585 | PrintAndLog("TAG ID: %x%08x (%d) - Format Len: %dbit - FC: %d - Card: %d", | |
586 | (unsigned int) hi, (unsigned int) lo, (unsigned int) (lo>>1) & 0xFFFF, | |
587 | (unsigned int) bitlen, (unsigned int) fc, (unsigned int) cardnum); | |
588 | return 0; | |
b3b70669 | 589 | } |
b3b70669 | 590 | return 0; |
591 | } | |
592 | ||
2fc2150e | 593 | //by marshmellow |
eb191de6 | 594 | //IO-Prox demod - FSK RF/64 with preamble of 000000001 |
595 | //print ioprox ID and some format details | |
b3b70669 | 596 | int CmdFSKdemodIO(const char *Cmd) |
597 | { | |
598 | //raw fsk demod no manchester decoding no start bit finding just get binary from wave | |
599 | //set defaults | |
eb191de6 | 600 | int idx=0; |
b3b70669 | 601 | //test samples are not just noise |
602 | if (GraphTraceLen < 64) return 0; | |
eb191de6 | 603 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0}; |
604 | uint32_t BitLen = getFromGraphBuf(BitStream); | |
605 | //get binary from fsk wave | |
606 | idx = IOdemodFSK(BitStream,BitLen); | |
607 | if (idx<0){ | |
608 | PrintAndLog("Error demoding fsk"); | |
609 | return 0; | |
610 | } | |
611 | if (idx==0){ | |
612 | PrintAndLog("IO Prox Data not found - FSK Data:"); | |
613 | printBitStream(BitStream,92); | |
b3b70669 | 614 | } |
b3b70669 | 615 | //Index map |
616 | //0 10 20 30 40 50 60 | |
617 | //| | | | | | | | |
618 | //01234567 8 90123456 7 89012345 6 78901234 5 67890123 4 56789012 3 45678901 23 | |
619 | //----------------------------------------------------------------------------- | |
620 | //00000000 0 11110000 1 facility 1 version* 1 code*one 1 code*two 1 ???????? 11 | |
621 | // | |
622 | //XSF(version)facility:codeone+codetwo (raw) | |
623 | //Handle the data | |
eb191de6 | 624 | |
625 | 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]); | |
626 | 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]); | |
627 | PrintAndLog("%d%d%d%d%d%d%d%d %d",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]); | |
628 | PrintAndLog("%d%d%d%d%d%d%d%d %d",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]); | |
629 | PrintAndLog("%d%d%d%d%d%d%d%d %d",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]); | |
630 | PrintAndLog("%d%d%d%d%d%d%d%d %d",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]); | |
631 | PrintAndLog("%d%d%d%d%d%d%d%d %d%d",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]); | |
632 | ||
633 | uint32_t code = bytebits_to_byte(BitStream+idx,32); | |
634 | uint32_t code2 = bytebits_to_byte(BitStream+idx+32,32); | |
635 | short version = bytebits_to_byte(BitStream+idx+27,8); //14,4 | |
636 | uint8_t facilitycode = bytebits_to_byte(BitStream+idx+19,8) ; | |
637 | uint16_t number = (bytebits_to_byte(BitStream+idx+36,8)<<8)|(bytebits_to_byte(BitStream+idx+45,8)); //36,9 | |
638 | ||
639 | PrintAndLog("XSF(%02d)%02x:%d (%08x%08x)",version,facilitycode,number,code,code2); | |
b3b70669 | 640 | return 0; |
641 | } | |
e888ed8e | 642 | int CmdFSKdemod(const char *Cmd) //old CmdFSKdemod needs updating |
7fe9b0b7 | 643 | { |
644 | static const int LowTone[] = { | |
645 | 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, | |
646 | 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, | |
647 | 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, | |
648 | 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, | |
649 | 1, 1, 1, 1, 1, -1, -1, -1, -1, -1 | |
650 | }; | |
651 | static const int HighTone[] = { | |
652 | 1, 1, 1, 1, 1, -1, -1, -1, -1, | |
653 | 1, 1, 1, 1, -1, -1, -1, -1, | |
654 | 1, 1, 1, 1, -1, -1, -1, -1, | |
655 | 1, 1, 1, 1, -1, -1, -1, -1, | |
656 | 1, 1, 1, 1, -1, -1, -1, -1, | |
657 | 1, 1, 1, 1, -1, -1, -1, -1, -1, | |
658 | }; | |
659 | ||
660 | int lowLen = sizeof (LowTone) / sizeof (int); | |
661 | int highLen = sizeof (HighTone) / sizeof (int); | |
b3b70669 | 662 | int convLen = (highLen > lowLen) ? highLen : lowLen; //if highlen > lowLen then highlen else lowlen |
7fe9b0b7 | 663 | uint32_t hi = 0, lo = 0; |
664 | ||
665 | int i, j; | |
666 | int minMark = 0, maxMark = 0; | |
b3b70669 | 667 | |
7fe9b0b7 | 668 | for (i = 0; i < GraphTraceLen - convLen; ++i) { |
669 | int lowSum = 0, highSum = 0; | |
670 | ||
671 | for (j = 0; j < lowLen; ++j) { | |
672 | lowSum += LowTone[j]*GraphBuffer[i+j]; | |
673 | } | |
674 | for (j = 0; j < highLen; ++j) { | |
675 | highSum += HighTone[j] * GraphBuffer[i + j]; | |
676 | } | |
677 | lowSum = abs(100 * lowSum / lowLen); | |
678 | highSum = abs(100 * highSum / highLen); | |
679 | GraphBuffer[i] = (highSum << 16) | lowSum; | |
680 | } | |
681 | ||
682 | for(i = 0; i < GraphTraceLen - convLen - 16; ++i) { | |
683 | int lowTot = 0, highTot = 0; | |
684 | // 10 and 8 are f_s divided by f_l and f_h, rounded | |
685 | for (j = 0; j < 10; ++j) { | |
686 | lowTot += (GraphBuffer[i+j] & 0xffff); | |
687 | } | |
688 | for (j = 0; j < 8; j++) { | |
689 | highTot += (GraphBuffer[i + j] >> 16); | |
690 | } | |
691 | GraphBuffer[i] = lowTot - highTot; | |
692 | if (GraphBuffer[i] > maxMark) maxMark = GraphBuffer[i]; | |
693 | if (GraphBuffer[i] < minMark) minMark = GraphBuffer[i]; | |
694 | } | |
695 | ||
696 | GraphTraceLen -= (convLen + 16); | |
697 | RepaintGraphWindow(); | |
698 | ||
b3b70669 | 699 | // Find bit-sync (3 lo followed by 3 high) (HID ONLY) |
7fe9b0b7 | 700 | int max = 0, maxPos = 0; |
701 | for (i = 0; i < 6000; ++i) { | |
702 | int dec = 0; | |
703 | for (j = 0; j < 3 * lowLen; ++j) { | |
704 | dec -= GraphBuffer[i + j]; | |
705 | } | |
706 | for (; j < 3 * (lowLen + highLen ); ++j) { | |
707 | dec += GraphBuffer[i + j]; | |
708 | } | |
709 | if (dec > max) { | |
710 | max = dec; | |
711 | maxPos = i; | |
712 | } | |
713 | } | |
714 | ||
715 | // place start of bit sync marker in graph | |
716 | GraphBuffer[maxPos] = maxMark; | |
717 | GraphBuffer[maxPos + 1] = minMark; | |
718 | ||
719 | maxPos += j; | |
720 | ||
721 | // place end of bit sync marker in graph | |
722 | GraphBuffer[maxPos] = maxMark; | |
723 | GraphBuffer[maxPos+1] = minMark; | |
724 | ||
725 | PrintAndLog("actual data bits start at sample %d", maxPos); | |
726 | PrintAndLog("length %d/%d", highLen, lowLen); | |
727 | ||
728 | uint8_t bits[46]; | |
729 | bits[sizeof(bits)-1] = '\0'; | |
730 | ||
731 | // find bit pairs and manchester decode them | |
732 | for (i = 0; i < arraylen(bits) - 1; ++i) { | |
733 | int dec = 0; | |
734 | for (j = 0; j < lowLen; ++j) { | |
735 | dec -= GraphBuffer[maxPos + j]; | |
736 | } | |
737 | for (; j < lowLen + highLen; ++j) { | |
738 | dec += GraphBuffer[maxPos + j]; | |
739 | } | |
740 | maxPos += j; | |
741 | // place inter bit marker in graph | |
742 | GraphBuffer[maxPos] = maxMark; | |
743 | GraphBuffer[maxPos + 1] = minMark; | |
744 | ||
745 | // hi and lo form a 64 bit pair | |
746 | hi = (hi << 1) | (lo >> 31); | |
747 | lo = (lo << 1); | |
748 | // store decoded bit as binary (in hi/lo) and text (in bits[]) | |
749 | if(dec < 0) { | |
750 | bits[i] = '1'; | |
751 | lo |= 1; | |
752 | } else { | |
753 | bits[i] = '0'; | |
754 | } | |
755 | } | |
756 | PrintAndLog("bits: '%s'", bits); | |
757 | PrintAndLog("hex: %08x %08x", hi, lo); | |
758 | return 0; | |
759 | } | |
e888ed8e | 760 | |
7fe9b0b7 | 761 | int CmdGrid(const char *Cmd) |
762 | { | |
763 | sscanf(Cmd, "%i %i", &PlotGridX, &PlotGridY); | |
7ddb9900 | 764 | PlotGridXdefault= PlotGridX; |
765 | PlotGridYdefault= PlotGridY; | |
7fe9b0b7 | 766 | RepaintGraphWindow(); |
767 | return 0; | |
768 | } | |
769 | ||
770 | int CmdHexsamples(const char *Cmd) | |
771 | { | |
4961e292 | 772 | int i, j; |
7fe9b0b7 | 773 | int requested = 0; |
774 | int offset = 0; | |
4961e292 | 775 | char string_buf[25]; |
776 | char* string_ptr = string_buf; | |
90d74dc2 | 777 | uint8_t got[40000]; |
4961e292 | 778 | |
779 | sscanf(Cmd, "%i %i", &requested, &offset); | |
90d74dc2 | 780 | |
4961e292 | 781 | /* if no args send something */ |
782 | if (requested == 0) { | |
90d74dc2 | 783 | requested = 8; |
784 | } | |
90d74dc2 | 785 | if (offset + requested > sizeof(got)) { |
786 | PrintAndLog("Tried to read past end of buffer, <bytes> + <offset> > 40000"); | |
4961e292 | 787 | return 0; |
788 | } | |
90d74dc2 | 789 | |
4961e292 | 790 | GetFromBigBuf(got,requested,offset); |
90d74dc2 | 791 | WaitForResponse(CMD_ACK,NULL); |
792 | ||
4961e292 | 793 | i = 0; |
794 | for (j = 0; j < requested; j++) { | |
795 | i++; | |
796 | string_ptr += sprintf(string_ptr, "%02x ", got[j]); | |
797 | if (i == 8) { | |
798 | *(string_ptr - 1) = '\0'; // remove the trailing space | |
799 | PrintAndLog("%s", string_buf); | |
800 | string_buf[0] = '\0'; | |
801 | string_ptr = string_buf; | |
802 | i = 0; | |
803 | } | |
804 | if (j == requested - 1 && string_buf[0] != '\0') { // print any remaining bytes | |
805 | *(string_ptr - 1) = '\0'; | |
806 | PrintAndLog("%s", string_buf); | |
807 | string_buf[0] = '\0'; | |
808 | } | |
7fe9b0b7 | 809 | } |
810 | return 0; | |
811 | } | |
812 | ||
7fe9b0b7 | 813 | int CmdHide(const char *Cmd) |
814 | { | |
815 | HideGraphWindow(); | |
816 | return 0; | |
817 | } | |
818 | ||
819 | int CmdHpf(const char *Cmd) | |
820 | { | |
821 | int i; | |
822 | int accum = 0; | |
823 | ||
824 | for (i = 10; i < GraphTraceLen; ++i) | |
825 | accum += GraphBuffer[i]; | |
826 | accum /= (GraphTraceLen - 10); | |
827 | for (i = 0; i < GraphTraceLen; ++i) | |
828 | GraphBuffer[i] -= accum; | |
829 | ||
830 | RepaintGraphWindow(); | |
831 | return 0; | |
832 | } | |
833 | ||
8d183c53 | 834 | int CmdSamples(const char *Cmd) |
7fe9b0b7 | 835 | { |
836 | int cnt = 0; | |
837 | int n; | |
90d74dc2 | 838 | uint8_t got[40000]; |
839 | ||
7fe9b0b7 | 840 | n = strtol(Cmd, NULL, 0); |
b3b70669 | 841 | if (n == 0) n = 6000; |
90d74dc2 | 842 | if (n > sizeof(got)) n = sizeof(got); |
a2847518 | 843 | |
7fe9b0b7 | 844 | PrintAndLog("Reading %d samples\n", n); |
90d74dc2 | 845 | GetFromBigBuf(got,n,0); |
a2847518 | 846 | WaitForResponse(CMD_ACK,NULL); |
90d74dc2 | 847 | for (int j = 0; j < n; j++) { |
a2847518 | 848 | GraphBuffer[cnt++] = ((int)got[j]) - 128; |
7fe9b0b7 | 849 | } |
a2847518 | 850 | |
7fe9b0b7 | 851 | PrintAndLog("Done!\n"); |
90d74dc2 | 852 | GraphTraceLen = n; |
7fe9b0b7 | 853 | RepaintGraphWindow(); |
854 | return 0; | |
855 | } | |
856 | ||
d6a120a2 MHS |
857 | int CmdTuneSamples(const char *Cmd) |
858 | { | |
859 | int cnt = 0; | |
860 | int n = 255; | |
861 | uint8_t got[255]; | |
862 | ||
863 | PrintAndLog("Reading %d samples\n", n); | |
864 | GetFromBigBuf(got,n,7256); // armsrc/apps.h: #define FREE_BUFFER_OFFSET 7256 | |
865 | WaitForResponse(CMD_ACK,NULL); | |
866 | for (int j = 0; j < n; j++) { | |
867 | GraphBuffer[cnt++] = ((int)got[j]) - 128; | |
868 | } | |
869 | ||
870 | PrintAndLog("Done! Divisor 89 is 134khz, 95 is 125khz.\n"); | |
871 | PrintAndLog("\n"); | |
872 | GraphTraceLen = n; | |
873 | RepaintGraphWindow(); | |
874 | return 0; | |
875 | } | |
876 | ||
7fe9b0b7 | 877 | int CmdLoad(const char *Cmd) |
878 | { | |
c6f1fb9d | 879 | FILE *f = fopen(Cmd, "r"); |
7fe9b0b7 | 880 | if (!f) { |
c6f1fb9d | 881 | PrintAndLog("couldn't open '%s'", Cmd); |
7fe9b0b7 | 882 | return 0; |
883 | } | |
884 | ||
885 | GraphTraceLen = 0; | |
886 | char line[80]; | |
887 | while (fgets(line, sizeof (line), f)) { | |
888 | GraphBuffer[GraphTraceLen] = atoi(line); | |
889 | GraphTraceLen++; | |
890 | } | |
891 | fclose(f); | |
892 | PrintAndLog("loaded %d samples", GraphTraceLen); | |
893 | RepaintGraphWindow(); | |
894 | return 0; | |
895 | } | |
896 | ||
897 | int CmdLtrim(const char *Cmd) | |
898 | { | |
899 | int ds = atoi(Cmd); | |
900 | ||
901 | for (int i = ds; i < GraphTraceLen; ++i) | |
902 | GraphBuffer[i-ds] = GraphBuffer[i]; | |
903 | GraphTraceLen -= ds; | |
904 | ||
905 | RepaintGraphWindow(); | |
906 | return 0; | |
907 | } | |
908 | ||
909 | /* | |
910 | * Manchester demodulate a bitstream. The bitstream needs to be already in | |
911 | * the GraphBuffer as 0 and 1 values | |
912 | * | |
913 | * Give the clock rate as argument in order to help the sync - the algorithm | |
914 | * resyncs at each pulse anyway. | |
915 | * | |
916 | * Not optimized by any means, this is the 1st time I'm writing this type of | |
917 | * routine, feel free to improve... | |
918 | * | |
919 | * 1st argument: clock rate (as number of samples per clock rate) | |
920 | * Typical values can be 64, 32, 128... | |
921 | */ | |
922 | int CmdManchesterDemod(const char *Cmd) | |
923 | { | |
924 | int i, j, invert= 0; | |
925 | int bit; | |
926 | int clock; | |
fddf220a | 927 | int lastval = 0; |
7fe9b0b7 | 928 | int low = 0; |
929 | int high = 0; | |
930 | int hithigh, hitlow, first; | |
931 | int lc = 0; | |
932 | int bitidx = 0; | |
933 | int bit2idx = 0; | |
934 | int warnings = 0; | |
935 | ||
936 | /* check if we're inverting output */ | |
c6f1fb9d | 937 | if (*Cmd == 'i') |
7fe9b0b7 | 938 | { |
939 | PrintAndLog("Inverting output"); | |
940 | invert = 1; | |
fffad860 | 941 | ++Cmd; |
7fe9b0b7 | 942 | do |
943 | ++Cmd; | |
944 | while(*Cmd == ' '); // in case a 2nd argument was given | |
945 | } | |
946 | ||
947 | /* Holds the decoded bitstream: each clock period contains 2 bits */ | |
948 | /* later simplified to 1 bit after manchester decoding. */ | |
949 | /* Add 10 bits to allow for noisy / uncertain traces without aborting */ | |
950 | /* int BitStream[GraphTraceLen*2/clock+10]; */ | |
951 | ||
952 | /* But it does not work if compiling on WIndows: therefore we just allocate a */ | |
953 | /* large array */ | |
90e278d3 | 954 | uint8_t BitStream[MAX_GRAPH_TRACE_LEN] = {0}; |
7fe9b0b7 | 955 | |
956 | /* Detect high and lows */ | |
957 | for (i = 0; i < GraphTraceLen; i++) | |
958 | { | |
959 | if (GraphBuffer[i] > high) | |
960 | high = GraphBuffer[i]; | |
961 | else if (GraphBuffer[i] < low) | |
962 | low = GraphBuffer[i]; | |
963 | } | |
964 | ||
965 | /* Get our clock */ | |
966 | clock = GetClock(Cmd, high, 1); | |
967 | ||
968 | int tolerance = clock/4; | |
969 | ||
970 | /* Detect first transition */ | |
971 | /* Lo-Hi (arbitrary) */ | |
972 | /* skip to the first high */ | |
973 | for (i= 0; i < GraphTraceLen; i++) | |
974 | if (GraphBuffer[i] == high) | |
975 | break; | |
976 | /* now look for the first low */ | |
977 | for (; i < GraphTraceLen; i++) | |
978 | { | |
979 | if (GraphBuffer[i] == low) | |
980 | { | |
981 | lastval = i; | |
982 | break; | |
983 | } | |
984 | } | |
985 | ||
986 | /* If we're not working with 1/0s, demod based off clock */ | |
987 | if (high != 1) | |
988 | { | |
989 | bit = 0; /* We assume the 1st bit is zero, it may not be | |
990 | * the case: this routine (I think) has an init problem. | |
991 | * Ed. | |
992 | */ | |
993 | for (; i < (int)(GraphTraceLen / clock); i++) | |
994 | { | |
995 | hithigh = 0; | |
996 | hitlow = 0; | |
997 | first = 1; | |
998 | ||
999 | /* Find out if we hit both high and low peaks */ | |
1000 | for (j = 0; j < clock; j++) | |
1001 | { | |
1002 | if (GraphBuffer[(i * clock) + j] == high) | |
1003 | hithigh = 1; | |
1004 | else if (GraphBuffer[(i * clock) + j] == low) | |
1005 | hitlow = 1; | |
1006 | ||
1007 | /* it doesn't count if it's the first part of our read | |
1008 | because it's really just trailing from the last sequence */ | |
1009 | if (first && (hithigh || hitlow)) | |
1010 | hithigh = hitlow = 0; | |
1011 | else | |
1012 | first = 0; | |
1013 | ||
1014 | if (hithigh && hitlow) | |
1015 | break; | |
1016 | } | |
1017 | ||
1018 | /* If we didn't hit both high and low peaks, we had a bit transition */ | |
1019 | if (!hithigh || !hitlow) | |
1020 | bit ^= 1; | |
1021 | ||
1022 | BitStream[bit2idx++] = bit ^ invert; | |
1023 | } | |
1024 | } | |
1025 | ||
1026 | /* standard 1/0 bitstream */ | |
1027 | else | |
1028 | { | |
1029 | ||
1030 | /* Then detect duration between 2 successive transitions */ | |
1031 | for (bitidx = 1; i < GraphTraceLen; i++) | |
1032 | { | |
1033 | if (GraphBuffer[i-1] != GraphBuffer[i]) | |
1034 | { | |
b3b70669 | 1035 | lc = i-lastval; |
1036 | lastval = i; | |
1037 | ||
1038 | // Error check: if bitidx becomes too large, we do not | |
1039 | // have a Manchester encoded bitstream or the clock is really | |
1040 | // wrong! | |
1041 | if (bitidx > (GraphTraceLen*2/clock+8) ) { | |
1042 | PrintAndLog("Error: the clock you gave is probably wrong, aborting."); | |
1043 | return 0; | |
1044 | } | |
1045 | // Then switch depending on lc length: | |
1046 | // Tolerance is 1/4 of clock rate (arbitrary) | |
1047 | if (abs(lc-clock/2) < tolerance) { | |
1048 | // Short pulse : either "1" or "0" | |
1049 | BitStream[bitidx++]=GraphBuffer[i-1]; | |
1050 | } else if (abs(lc-clock) < tolerance) { | |
1051 | // Long pulse: either "11" or "00" | |
1052 | BitStream[bitidx++]=GraphBuffer[i-1]; | |
1053 | BitStream[bitidx++]=GraphBuffer[i-1]; | |
1054 | } else { | |
7fe9b0b7 | 1055 | // Error |
1056 | warnings++; | |
b3b70669 | 1057 | PrintAndLog("Warning: Manchester decode error for pulse width detection."); |
1058 | PrintAndLog("(too many of those messages mean either the stream is not Manchester encoded, or clock is wrong)"); | |
7fe9b0b7 | 1059 | |
1060 | if (warnings > 10) | |
1061 | { | |
1062 | PrintAndLog("Error: too many detection errors, aborting."); | |
1063 | return 0; | |
1064 | } | |
1065 | } | |
1066 | } | |
1067 | } | |
1068 | ||
1069 | // At this stage, we now have a bitstream of "01" ("1") or "10" ("0"), parse it into final decoded bitstream | |
1070 | // Actually, we overwrite BitStream with the new decoded bitstream, we just need to be careful | |
1071 | // to stop output at the final bitidx2 value, not bitidx | |
1072 | for (i = 0; i < bitidx; i += 2) { | |
1073 | if ((BitStream[i] == 0) && (BitStream[i+1] == 1)) { | |
1074 | BitStream[bit2idx++] = 1 ^ invert; | |
b3b70669 | 1075 | } else if ((BitStream[i] == 1) && (BitStream[i+1] == 0)) { |
1076 | BitStream[bit2idx++] = 0 ^ invert; | |
1077 | } else { | |
1078 | // We cannot end up in this state, this means we are unsynchronized, | |
1079 | // move up 1 bit: | |
1080 | i++; | |
7fe9b0b7 | 1081 | warnings++; |
b3b70669 | 1082 | PrintAndLog("Unsynchronized, resync..."); |
1083 | PrintAndLog("(too many of those messages mean the stream is not Manchester encoded)"); | |
7fe9b0b7 | 1084 | |
1085 | if (warnings > 10) | |
1086 | { | |
1087 | PrintAndLog("Error: too many decode errors, aborting."); | |
1088 | return 0; | |
1089 | } | |
1090 | } | |
1091 | } | |
1092 | } | |
1093 | ||
1094 | PrintAndLog("Manchester decoded bitstream"); | |
1095 | // Now output the bitstream to the scrollback by line of 16 bits | |
1096 | for (i = 0; i < (bit2idx-16); i+=16) { | |
1097 | PrintAndLog("%i %i %i %i %i %i %i %i %i %i %i %i %i %i %i %i", | |
1098 | BitStream[i], | |
1099 | BitStream[i+1], | |
1100 | BitStream[i+2], | |
1101 | BitStream[i+3], | |
1102 | BitStream[i+4], | |
1103 | BitStream[i+5], | |
1104 | BitStream[i+6], | |
1105 | BitStream[i+7], | |
1106 | BitStream[i+8], | |
1107 | BitStream[i+9], | |
1108 | BitStream[i+10], | |
1109 | BitStream[i+11], | |
1110 | BitStream[i+12], | |
1111 | BitStream[i+13], | |
1112 | BitStream[i+14], | |
1113 | BitStream[i+15]); | |
1114 | } | |
1115 | return 0; | |
1116 | } | |
1117 | ||
1118 | /* Modulate our data into manchester */ | |
1119 | int CmdManchesterMod(const char *Cmd) | |
1120 | { | |
1121 | int i, j; | |
1122 | int clock; | |
1123 | int bit, lastbit, wave; | |
1124 | ||
1125 | /* Get our clock */ | |
1126 | clock = GetClock(Cmd, 0, 1); | |
1127 | ||
1128 | wave = 0; | |
1129 | lastbit = 1; | |
1130 | for (i = 0; i < (int)(GraphTraceLen / clock); i++) | |
1131 | { | |
1132 | bit = GraphBuffer[i * clock] ^ 1; | |
1133 | ||
1134 | for (j = 0; j < (int)(clock/2); j++) | |
1135 | GraphBuffer[(i * clock) + j] = bit ^ lastbit ^ wave; | |
1136 | for (j = (int)(clock/2); j < clock; j++) | |
1137 | GraphBuffer[(i * clock) + j] = bit ^ lastbit ^ wave ^ 1; | |
1138 | ||
1139 | /* Keep track of how we start our wave and if we changed or not this time */ | |
1140 | wave ^= bit ^ lastbit; | |
1141 | lastbit = bit; | |
1142 | } | |
1143 | ||
1144 | RepaintGraphWindow(); | |
1145 | return 0; | |
1146 | } | |
1147 | ||
1148 | int CmdNorm(const char *Cmd) | |
1149 | { | |
1150 | int i; | |
1151 | int max = INT_MIN, min = INT_MAX; | |
1152 | ||
1153 | for (i = 10; i < GraphTraceLen; ++i) { | |
1154 | if (GraphBuffer[i] > max) | |
1155 | max = GraphBuffer[i]; | |
1156 | if (GraphBuffer[i] < min) | |
1157 | min = GraphBuffer[i]; | |
1158 | } | |
1159 | ||
1160 | if (max != min) { | |
1161 | for (i = 0; i < GraphTraceLen; ++i) { | |
1162 | GraphBuffer[i] = (GraphBuffer[i] - ((max + min) / 2)) * 1000 / | |
1163 | (max - min); | |
1164 | } | |
1165 | } | |
1166 | RepaintGraphWindow(); | |
1167 | return 0; | |
1168 | } | |
1169 | ||
1170 | int CmdPlot(const char *Cmd) | |
1171 | { | |
1172 | ShowGraphWindow(); | |
1173 | return 0; | |
1174 | } | |
1175 | ||
1176 | int CmdSave(const char *Cmd) | |
1177 | { | |
1178 | FILE *f = fopen(Cmd, "w"); | |
1179 | if(!f) { | |
1180 | PrintAndLog("couldn't open '%s'", Cmd); | |
1181 | return 0; | |
1182 | } | |
1183 | int i; | |
1184 | for (i = 0; i < GraphTraceLen; i++) { | |
1185 | fprintf(f, "%d\n", GraphBuffer[i]); | |
1186 | } | |
1187 | fclose(f); | |
1188 | PrintAndLog("saved to '%s'", Cmd); | |
1189 | return 0; | |
1190 | } | |
1191 | ||
1192 | int CmdScale(const char *Cmd) | |
1193 | { | |
1194 | CursorScaleFactor = atoi(Cmd); | |
1195 | if (CursorScaleFactor == 0) { | |
1196 | PrintAndLog("bad, can't have zero scale"); | |
1197 | CursorScaleFactor = 1; | |
1198 | } | |
1199 | RepaintGraphWindow(); | |
1200 | return 0; | |
1201 | } | |
1202 | ||
1203 | int CmdThreshold(const char *Cmd) | |
1204 | { | |
1205 | int threshold = atoi(Cmd); | |
1206 | ||
1207 | for (int i = 0; i < GraphTraceLen; ++i) { | |
1208 | if (GraphBuffer[i] >= threshold) | |
1209 | GraphBuffer[i] = 1; | |
1210 | else | |
7bb9d33e | 1211 | GraphBuffer[i] = -1; |
7fe9b0b7 | 1212 | } |
1213 | RepaintGraphWindow(); | |
1214 | return 0; | |
1215 | } | |
1216 | ||
d51b2eda MHS |
1217 | int CmdDirectionalThreshold(const char *Cmd) |
1218 | { | |
1219 | int8_t upThres = param_get8(Cmd, 0); | |
1220 | int8_t downThres = param_get8(Cmd, 1); | |
1221 | ||
1222 | printf("Applying Up Threshold: %d, Down Threshold: %d\n", upThres, downThres); | |
1223 | ||
1224 | int lastValue = GraphBuffer[0]; | |
1225 | GraphBuffer[0] = 0; // Will be changed at the end, but init 0 as we adjust to last samples value if no threshold kicks in. | |
1226 | ||
1227 | for (int i = 1; i < GraphTraceLen; ++i) { | |
1228 | // Apply first threshold to samples heading up | |
1229 | if (GraphBuffer[i] >= upThres && GraphBuffer[i] > lastValue) | |
1230 | { | |
1231 | lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it. | |
1232 | GraphBuffer[i] = 1; | |
1233 | } | |
1234 | // Apply second threshold to samples heading down | |
1235 | else if (GraphBuffer[i] <= downThres && GraphBuffer[i] < lastValue) | |
1236 | { | |
1237 | lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it. | |
1238 | GraphBuffer[i] = -1; | |
1239 | } | |
1240 | else | |
1241 | { | |
1242 | lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it. | |
1243 | GraphBuffer[i] = GraphBuffer[i-1]; | |
1244 | ||
1245 | } | |
1246 | } | |
1247 | GraphBuffer[0] = GraphBuffer[1]; // Aline with first edited sample. | |
1248 | RepaintGraphWindow(); | |
1249 | return 0; | |
1250 | } | |
1251 | ||
7fe9b0b7 | 1252 | int CmdZerocrossings(const char *Cmd) |
1253 | { | |
1254 | // Zero-crossings aren't meaningful unless the signal is zero-mean. | |
1255 | CmdHpf(""); | |
1256 | ||
1257 | int sign = 1; | |
1258 | int zc = 0; | |
1259 | int lastZc = 0; | |
1260 | ||
1261 | for (int i = 0; i < GraphTraceLen; ++i) { | |
1262 | if (GraphBuffer[i] * sign >= 0) { | |
1263 | // No change in sign, reproduce the previous sample count. | |
1264 | zc++; | |
1265 | GraphBuffer[i] = lastZc; | |
1266 | } else { | |
1267 | // Change in sign, reset the sample count. | |
1268 | sign = -sign; | |
1269 | GraphBuffer[i] = lastZc; | |
1270 | if (sign > 0) { | |
1271 | lastZc = zc; | |
1272 | zc = 0; | |
1273 | } | |
1274 | } | |
1275 | } | |
1276 | ||
1277 | RepaintGraphWindow(); | |
1278 | return 0; | |
1279 | } | |
1280 | ||
1281 | static command_t CommandTable[] = | |
1282 | { | |
1283 | {"help", CmdHelp, 1, "This help"}, | |
1284 | {"amp", CmdAmp, 1, "Amplify peaks"}, | |
57c69556 | 1285 | {"askdemod", Cmdaskdemod, 1, "<0 or 1> -- Attempt to demodulate simple ASK tags"}, |
9e6dd4eb | 1286 | {"askmandemod", Cmdaskmandemod, 1, "[clock] [invert<0 or 1>] -- Attempt to demodulate ASK/Manchester tags and output binary (args optional[clock will try Auto-detect])"}, |
eb191de6 | 1287 | {"askrawdemod", Cmdaskrawdemod, 1, "[clock] [invert<0 or 1>] -- Attempt to demodulate ASK tags and output binary (args optional[clock will try Auto-detect])"}, |
7fe9b0b7 | 1288 | {"autocorr", CmdAutoCorr, 1, "<window length> -- Autocorrelation over window"}, |
1289 | {"bitsamples", CmdBitsamples, 0, "Get raw samples as bitstring"}, | |
1290 | {"bitstream", CmdBitstream, 1, "[clock rate] -- Convert waveform into a bitstream"}, | |
1291 | {"buffclear", CmdBuffClear, 1, "Clear sample buffer and graph window"}, | |
1292 | {"dec", CmdDec, 1, "Decimate samples"}, | |
1293 | {"detectclock", CmdDetectClockRate, 1, "Detect clock rate"}, | |
e888ed8e | 1294 | {"fskdemod", CmdFSKdemod, 1, "Demodulate graph window as a HID FSK"}, |
1295 | {"fskhiddemod", CmdFSKdemodHID, 1, "Demodulate graph window as a HID FSK using raw"}, | |
1296 | {"fskiodemod", CmdFSKdemodIO, 1, "Demodulate graph window as an IO Prox FSK using raw"}, | |
1297 | {"fskrawdemod", CmdFSKrawdemod, 1, "[clock rate] [invert] Demodulate graph window from FSK to binary (clock = 64 or 50)(invert = 1 or 0)"}, | |
7fe9b0b7 | 1298 | {"grid", CmdGrid, 1, "<x> <y> -- overlay grid on graph window, use zero value to turn off either"}, |
90d74dc2 | 1299 | {"hexsamples", CmdHexsamples, 0, "<bytes> [<offset>] -- Dump big buffer as hex bytes"}, |
7fe9b0b7 | 1300 | {"hide", CmdHide, 1, "Hide graph window"}, |
1301 | {"hpf", CmdHpf, 1, "Remove DC offset from trace"}, | |
7fe9b0b7 | 1302 | {"load", CmdLoad, 1, "<filename> -- Load trace (to graph window"}, |
1303 | {"ltrim", CmdLtrim, 1, "<samples> -- Trim samples from left of trace"}, | |
1304 | {"mandemod", CmdManchesterDemod, 1, "[i] [clock rate] -- Manchester demodulate binary stream (option 'i' to invert output)"}, | |
eb191de6 | 1305 | {"manrawdecode", Cmdmandecoderaw, 1, "Manchester decode binary stream already in graph buffer"}, |
7fe9b0b7 | 1306 | {"manmod", CmdManchesterMod, 1, "[clock rate] -- Manchester modulate a binary stream"}, |
1307 | {"norm", CmdNorm, 1, "Normalize max/min to +/-500"}, | |
7ddb9900 | 1308 | {"plot", CmdPlot, 1, "Show graph window (hit 'h' in window for keystroke help)"}, |
90d74dc2 | 1309 | {"samples", CmdSamples, 0, "[512 - 40000] -- Get raw samples for graph window"}, |
d6a120a2 | 1310 | {"tune", CmdTuneSamples, 0, "Get hw tune samples for graph window"}, |
7fe9b0b7 | 1311 | {"save", CmdSave, 1, "<filename> -- Save trace (from graph window)"}, |
1312 | {"scale", CmdScale, 1, "<int> -- Set cursor display scale"}, | |
dbf444a1 | 1313 | {"threshold", CmdThreshold, 1, "<threshold> -- Maximize/minimize every value in the graph window depending on threshold"}, |
7fe9b0b7 | 1314 | {"zerocrossings", CmdZerocrossings, 1, "Count time between zero-crossings"}, |
d51b2eda | 1315 | {"dirthreshold", CmdDirectionalThreshold, 1, "<thres up> <thres down> -- Max rising higher up-thres/ Min falling lower down-thres, keep rest as prev."}, |
7fe9b0b7 | 1316 | {NULL, NULL, 0, NULL} |
1317 | }; | |
1318 | ||
1319 | int CmdData(const char *Cmd) | |
1320 | { | |
1321 | CmdsParse(CommandTable, Cmd); | |
1322 | return 0; | |
1323 | } | |
1324 | ||
1325 | int CmdHelp(const char *Cmd) | |
1326 | { | |
1327 | CmdsHelp(CommandTable); | |
1328 | return 0; | |
1329 | } |