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