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