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