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