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