]> cvs.zerfleddert.de Git - proxmark3-svn/blob - client/cmddata.c
projects / proxmark3-svn / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
blame | history | raw | HEAD
CHG: minor comments.
[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 uint8_t dummy=0;
1160 if (fchigh==0 || fclow == 0){
1161 fcs = countFC(BitStream, BitLen, &dummy);
1162 if (fcs==0){
1163 fchigh=10;
1164 fclow=8;
1165 }else{
1166 fchigh = (fcs >> 8) & 0xFF;
1167 fclow = fcs & 0xFF;
1168 }
1169 }
1170 //get bit clock length
1171 if (rfLen==0){
1172 rfLen = detectFSKClk(BitStream, BitLen, fchigh, fclow);
1173 if (rfLen == 0) rfLen = 50;
1174 }
1175 if (verbose) PrintAndLog("Args invert: %d - Clock:%d - fchigh:%d - fclow: %d",invert,rfLen,fchigh, fclow);
1176 int size = fskdemod(BitStream,BitLen,(uint8_t)rfLen,(uint8_t)invert,(uint8_t)fchigh,(uint8_t)fclow);
1177 if (size>0){
1178 setDemodBuf(BitStream,size,0);
1179
1180 // Now output the bitstream to the scrollback by line of 16 bits
1181 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
1182 if (verbose) {
1183 PrintAndLog("FSK decoded bitstream:");
1184 printBitStream(BitStream,size);
1185 }
1186
1187 return 1;
1188 } else{
1189 if (verbose) PrintAndLog("no FSK data found");
1190 }
1191 return 0;
1192 }
1193
1194 //by marshmellow
1195 //fsk raw demod and print binary
1196 //takes 4 arguments - Clock, invert, fchigh, fclow
1197 //defaults: clock = 50, invert=1, fchigh=10, fclow=8 (RF/10 RF/8 (fsk2a))
1198 int CmdFSKrawdemod(const char *Cmd)
1199 {
1200 char cmdp = param_getchar(Cmd, 0);
1201 if (strlen(Cmd) > 10 || cmdp == 'h' || cmdp == 'H') {
1202 PrintAndLog("Usage: data rawdemod fs [clock] <invert> [fchigh] [fclow]");
1203 PrintAndLog(" [set clock as integer] optional, omit for autodetect.");
1204 PrintAndLog(" <invert>, 1 for invert output, can be used even if the clock is omitted");
1205 PrintAndLog(" [fchigh], larger field clock length, omit for autodetect");
1206 PrintAndLog(" [fclow], small field clock length, omit for autodetect");
1207 PrintAndLog("");
1208 PrintAndLog(" sample: data rawdemod fs = demod an fsk tag from GraphBuffer using autodetect");
1209 PrintAndLog(" : data rawdemod fs 32 = demod an fsk tag from GraphBuffer using a clock of RF/32, autodetect fc");
1210 PrintAndLog(" : data rawdemod fs 1 = demod an fsk tag from GraphBuffer using autodetect, invert output");
1211 PrintAndLog(" : data rawdemod fs 32 1 = demod an fsk tag from GraphBuffer using a clock of RF/32, invert output, autodetect fc");
1212 PrintAndLog(" : data rawdemod fs 64 0 8 5 = demod an fsk1 RF/64 tag from GraphBuffer");
1213 PrintAndLog(" : data rawdemod fs 50 0 10 8 = demod an fsk2 RF/50 tag from GraphBuffer");
1214 PrintAndLog(" : data rawdemod fs 50 1 10 8 = demod an fsk2a RF/50 tag from GraphBuffer");
1215 return 0;
1216 }
1217 return FSKrawDemod(Cmd, TRUE);
1218 }
1219
1220 //by marshmellow (based on existing demod + holiman's refactor)
1221 //HID Prox demod - FSK RF/50 with preamble of 00011101 (then manchester encoded)
1222 //print full HID Prox ID and some bit format details if found
1223 int CmdFSKdemodHID(const char *Cmd)
1224 {
1225 //raw fsk demod no manchester decoding no start bit finding just get binary from wave
1226 uint32_t hi2=0, hi=0, lo=0;
1227
1228 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
1229 size_t BitLen = getFromGraphBuf(BitStream);
1230 if (BitLen==0) return 0;
1231 //get binary from fsk wave
1232 int idx = HIDdemodFSK(BitStream,&BitLen,&hi2,&hi,&lo);
1233 if (idx<0){
1234 if (g_debugMode){
1235 if (idx==-1){
1236 PrintAndLog("DEBUG: Just Noise Detected");
1237 } else if (idx == -2) {
1238 PrintAndLog("DEBUG: Error demoding fsk");
1239 } else if (idx == -3) {
1240 PrintAndLog("DEBUG: Preamble not found");
1241 } else if (idx == -4) {
1242 PrintAndLog("DEBUG: Error in Manchester data, SIZE: %d", BitLen);
1243 } else {
1244 PrintAndLog("DEBUG: Error demoding fsk %d", idx);
1245 }
1246 }
1247 return 0;
1248 }
1249 if (hi2==0 && hi==0 && lo==0) {
1250 if (g_debugMode) PrintAndLog("DEBUG: Error - no values found");
1251 return 0;
1252 }
1253 if (hi2 != 0){ //extra large HID tags
1254 PrintAndLog("HID Prox TAG ID: %x%08x%08x (%d)",
1255 (unsigned int) hi2, (unsigned int) hi, (unsigned int) lo, (unsigned int) (lo>>1) & 0xFFFF);
1256 }
1257 else { //standard HID tags <38 bits
1258 uint8_t fmtLen = 0;
1259 uint32_t fc = 0;
1260 uint32_t cardnum = 0;
1261 if (((hi>>5)&1)==1){//if bit 38 is set then < 37 bit format is used
1262 uint32_t lo2=0;
1263 lo2=(((hi & 31) << 12) | (lo>>20)); //get bits 21-37 to check for format len bit
1264 uint8_t idx3 = 1;
1265 while(lo2>1){ //find last bit set to 1 (format len bit)
1266 lo2=lo2>>1;
1267 idx3++;
1268 }
1269 fmtLen =idx3+19;
1270 fc =0;
1271 cardnum=0;
1272 if(fmtLen==26){
1273 cardnum = (lo>>1)&0xFFFF;
1274 fc = (lo>>17)&0xFF;
1275 }
1276 if(fmtLen==34){
1277 cardnum = (lo>>1)&0xFFFF;
1278 fc= ((hi&1)<<15)|(lo>>17);
1279 }
1280 if(fmtLen==35){
1281 cardnum = (lo>>1)&0xFFFFF;
1282 fc = ((hi&1)<<11)|(lo>>21);
1283 }
1284 }
1285 else { //if bit 38 is not set then 37 bit format is used
1286 fmtLen = 37;
1287 fc = 0;
1288 cardnum = 0;
1289 if(fmtLen == 37){
1290 cardnum = (lo>>1)&0x7FFFF;
1291 fc = ((hi&0xF)<<12)|(lo>>20);
1292 }
1293 }
1294 PrintAndLog("HID Prox TAG ID: %x%08x (%d) - Format Len: %dbit - FC: %d - Card: %d",
1295 (unsigned int) hi, (unsigned int) lo, (unsigned int) (lo>>1) & 0xFFFF,
1296 (unsigned int) fmtLen, (unsigned int) fc, (unsigned int) cardnum);
1297 }
1298 setDemodBuf(BitStream,BitLen,idx);
1299 if (g_debugMode){
1300 PrintAndLog("DEBUG: idx: %d, Len: %d, Printing Demod Buffer:", idx, BitLen);
1301 printDemodBuff();
1302 }
1303 return 1;
1304 }
1305
1306 //by marshmellow
1307 //Paradox Prox demod - FSK RF/50 with preamble of 00001111 (then manchester encoded)
1308 //print full Paradox Prox ID and some bit format details if found
1309 int CmdFSKdemodParadox(const char *Cmd)
1310 {
1311 //raw fsk demod no manchester decoding no start bit finding just get binary from wave
1312 uint32_t hi2=0, hi=0, lo=0;
1313
1314 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
1315 size_t BitLen = getFromGraphBuf(BitStream);
1316 if (BitLen==0) return 0;
1317 //get binary from fsk wave
1318 int idx = ParadoxdemodFSK(BitStream,&BitLen,&hi2,&hi,&lo);
1319 if (idx<0){
1320 if (g_debugMode){
1321 if (idx==-1){
1322 PrintAndLog("DEBUG: Just Noise Detected");
1323 } else if (idx == -2) {
1324 PrintAndLog("DEBUG: Error demoding fsk");
1325 } else if (idx == -3) {
1326 PrintAndLog("DEBUG: Preamble not found");
1327 } else if (idx == -4) {
1328 PrintAndLog("DEBUG: Error in Manchester data");
1329 } else {
1330 PrintAndLog("DEBUG: Error demoding fsk %d", idx);
1331 }
1332 }
1333 return 0;
1334 }
1335 if (hi2==0 && hi==0 && lo==0){
1336 if (g_debugMode) PrintAndLog("DEBUG: Error - no value found");
1337 return 0;
1338 }
1339 uint32_t fc = ((hi & 0x3)<<6) | (lo>>26);
1340 uint32_t cardnum = (lo>>10)&0xFFFF;
1341 uint32_t rawLo = bytebits_to_byte(BitStream+idx+64,32);
1342 uint32_t rawHi = bytebits_to_byte(BitStream+idx+32,32);
1343 uint32_t rawHi2 = bytebits_to_byte(BitStream+idx,32);
1344
1345 PrintAndLog("Paradox TAG ID: %x%08x - FC: %d - Card: %d - Checksum: %02x - RAW: %08x%08x%08x",
1346 hi>>10, (hi & 0x3)<<26 | (lo>>10), fc, cardnum, (lo>>2) & 0xFF, rawHi2, rawHi, rawLo);
1347 setDemodBuf(BitStream,BitLen,idx);
1348 if (g_debugMode){
1349 PrintAndLog("DEBUG: idx: %d, len: %d, Printing Demod Buffer:", idx, BitLen);
1350 printDemodBuff();
1351 }
1352 return 1;
1353 }
1354
1355 //by marshmellow
1356 //IO-Prox demod - FSK RF/64 with preamble of 000000001
1357 //print ioprox ID and some format details
1358 int CmdFSKdemodIO(const char *Cmd)
1359 {
1360 //raw fsk demod no manchester decoding no start bit finding just get binary from wave
1361 //set defaults
1362 int idx=0;
1363 //something in graphbuffer?
1364 if (GraphTraceLen < 65) {
1365 if (g_debugMode)PrintAndLog("DEBUG: not enough samples in GraphBuffer");
1366 return 0;
1367 }
1368 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
1369 size_t BitLen = getFromGraphBuf(BitStream);
1370 if (BitLen==0) return 0;
1371
1372 //get binary from fsk wave
1373 idx = IOdemodFSK(BitStream,BitLen);
1374 if (idx<0){
1375 if (g_debugMode){
1376 if (idx==-1){
1377 PrintAndLog("DEBUG: Just Noise Detected");
1378 } else if (idx == -2) {
1379 PrintAndLog("DEBUG: not enough samples");
1380 } else if (idx == -3) {
1381 PrintAndLog("DEBUG: error during fskdemod");
1382 } else if (idx == -4) {
1383 PrintAndLog("DEBUG: Preamble not found");
1384 } else if (idx == -5) {
1385 PrintAndLog("DEBUG: Separator bits not found");
1386 } else {
1387 PrintAndLog("DEBUG: Error demoding fsk %d", idx);
1388 }
1389 }
1390 return 0;
1391 }
1392 if (idx==0){
1393 if (g_debugMode==1){
1394 PrintAndLog("DEBUG: IO Prox Data not found - FSK Bits: %d",BitLen);
1395 if (BitLen > 92) printBitStream(BitStream,92);
1396 }
1397 return 0;
1398 }
1399 //Index map
1400 //0 10 20 30 40 50 60
1401 //| | | | | | |
1402 //01234567 8 90123456 7 89012345 6 78901234 5 67890123 4 56789012 3 45678901 23
1403 //-----------------------------------------------------------------------------
1404 //00000000 0 11110000 1 facility 1 version* 1 code*one 1 code*two 1 ???????? 11
1405 //
1406 //XSF(version)facility:codeone+codetwo (raw)
1407 //Handle the data
1408 if (idx+64>BitLen) {
1409 if (g_debugMode==1) PrintAndLog("not enough bits found - bitlen: %d",BitLen);
1410 return 0;
1411 }
1412 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]);
1413 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]);
1414 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]);
1415 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]);
1416 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]);
1417 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]);
1418 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]);
1419
1420 uint32_t code = bytebits_to_byte(BitStream+idx,32);
1421 uint32_t code2 = bytebits_to_byte(BitStream+idx+32,32);
1422 uint8_t version = bytebits_to_byte(BitStream+idx+27,8); //14,4
1423 uint8_t facilitycode = bytebits_to_byte(BitStream+idx+18,8) ;
1424 uint16_t number = (bytebits_to_byte(BitStream+idx+36,8)<<8)|(bytebits_to_byte(BitStream+idx+45,8)); //36,9
1425 uint8_t crc = bytebits_to_byte(BitStream+idx+54,8);
1426 uint16_t calccrc = 0;
1427
1428 for (uint8_t i=1; i<6; ++i){
1429 calccrc += bytebits_to_byte(BitStream+idx+9*i,8);
1430 //PrintAndLog("%d", calccrc);
1431 }
1432 calccrc &= 0xff;
1433 calccrc = 0xff - calccrc;
1434
1435 char *crcStr = (crc == calccrc) ? "crc ok": "!crc";
1436
1437 PrintAndLog("IO Prox XSF(%02d)%02x:%05d (%08x%08x) [%02x %s]",version,facilitycode,number,code,code2, crc, crcStr);
1438 setDemodBuf(BitStream,64,idx);
1439 if (g_debugMode){
1440 PrintAndLog("DEBUG: idx: %d, Len: %d, Printing demod buffer:",idx,64);
1441 printDemodBuff();
1442 }
1443 return 1;
1444 }
1445
1446 //by marshmellow
1447 //AWID Prox demod - FSK RF/50 with preamble of 00000001 (always a 96 bit data stream)
1448 //print full AWID Prox ID and some bit format details if found
1449 int CmdFSKdemodAWID(const char *Cmd)
1450 {
1451
1452 //int verbose=1;
1453 //sscanf(Cmd, "%i", &verbose);
1454
1455 //raw fsk demod no manchester decoding no start bit finding just get binary from wave
1456 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
1457 size_t size = getFromGraphBuf(BitStream);
1458 if (size==0) return 0;
1459
1460 //get binary from fsk wave
1461 int idx = AWIDdemodFSK(BitStream, &size);
1462 if (idx<=0){
1463 if (g_debugMode==1){
1464 if (idx == -1)
1465 PrintAndLog("DEBUG: Error - not enough samples");
1466 else if (idx == -2)
1467 PrintAndLog("DEBUG: Error - only noise found");
1468 else if (idx == -3)
1469 PrintAndLog("DEBUG: Error - problem during FSK demod");
1470 else if (idx == -4)
1471 PrintAndLog("DEBUG: Error - AWID preamble not found");
1472 else if (idx == -5)
1473 PrintAndLog("DEBUG: Error - Size not correct: %d", size);
1474 else
1475 PrintAndLog("DEBUG: Error %d",idx);
1476 }
1477 return 0;
1478 }
1479
1480 // Index map
1481 // 0 10 20 30 40 50 60
1482 // | | | | | | |
1483 // 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
1484 // -----------------------------------------------------------------------------
1485 // 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
1486 // 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
1487 // |---26 bit---| |-----117----||-------------142-------------|
1488 // b = format bit len, o = odd parity of last 3 bits
1489 // f = facility code, c = card number
1490 // w = wiegand parity
1491 // (26 bit format shown)
1492
1493 //get raw ID before removing parities
1494 uint32_t rawLo = bytebits_to_byte(BitStream+idx+64,32);
1495 uint32_t rawHi = bytebits_to_byte(BitStream+idx+32,32);
1496 uint32_t rawHi2 = bytebits_to_byte(BitStream+idx,32);
1497 setDemodBuf(BitStream,96,idx);
1498
1499 size = removeParity(BitStream, idx+8, 4, 1, 88);
1500 if (size != 66){
1501 if (g_debugMode==1) PrintAndLog("DEBUG: Error - at parity check-tag size does not match AWID format");
1502 return 0;
1503 }
1504 // ok valid card found!
1505
1506 // Index map
1507 // 0 10 20 30 40 50 60
1508 // | | | | | | |
1509 // 01234567 8 90123456 7890123456789012 3 456789012345678901234567890123456
1510 // -----------------------------------------------------------------------------
1511 // 00011010 1 01110101 0000000010001110 1 000000000000000000000000000000000
1512 // bbbbbbbb w ffffffff cccccccccccccccc w xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
1513 // |26 bit| |-117--| |-----142------|
1514 // b = format bit len, o = odd parity of last 3 bits
1515 // f = facility code, c = card number
1516 // w = wiegand parity
1517 // (26 bit format shown)
1518
1519 uint32_t fc = 0;
1520 uint32_t cardnum = 0;
1521 uint32_t code1 = 0;
1522 uint32_t code2 = 0;
1523 uint8_t fmtLen = bytebits_to_byte(BitStream,8);
1524 if (fmtLen==26){
1525 fc = bytebits_to_byte(BitStream+9, 8);
1526 cardnum = bytebits_to_byte(BitStream+17, 16);
1527 code1 = bytebits_to_byte(BitStream+8,fmtLen);
1528 PrintAndLog("AWID Found - BitLength: %d, FC: %d, Card: %d - Wiegand: %x, Raw: %08x%08x%08x", fmtLen, fc, cardnum, code1, rawHi2, rawHi, rawLo);
1529 } else {
1530 cardnum = bytebits_to_byte(BitStream+8+(fmtLen-17), 16);
1531 if (fmtLen>32){
1532 code1 = bytebits_to_byte(BitStream+8,fmtLen-32);
1533 code2 = bytebits_to_byte(BitStream+8+(fmtLen-32),32);
1534 PrintAndLog("AWID Found - BitLength: %d -unknown BitLength- (%d) - Wiegand: %x%08x, Raw: %08x%08x%08x", fmtLen, cardnum, code1, code2, rawHi2, rawHi, rawLo);
1535 } else{
1536 code1 = bytebits_to_byte(BitStream+8,fmtLen);
1537 PrintAndLog("AWID Found - BitLength: %d -unknown BitLength- (%d) - Wiegand: %x, Raw: %08x%08x%08x", fmtLen, cardnum, code1, rawHi2, rawHi, rawLo);
1538 }
1539 }
1540 if (g_debugMode){
1541 PrintAndLog("DEBUG: idx: %d, Len: %d Printing Demod Buffer:", idx, 96);
1542 printDemodBuff();
1543 }
1544 //todo - convert hi2, hi, lo to demodbuffer for future sim/clone commands
1545 return 1;
1546 }
1547
1548 //by marshmellow
1549 //Pyramid Prox demod - FSK RF/50 with preamble of 0000000000000001 (always a 128 bit data stream)
1550 //print full Farpointe Data/Pyramid Prox ID and some bit format details if found
1551 int CmdFSKdemodPyramid(const char *Cmd)
1552 {
1553 //raw fsk demod no manchester decoding no start bit finding just get binary from wave
1554 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
1555 size_t size = getFromGraphBuf(BitStream);
1556 if (size==0) return 0;
1557
1558 //get binary from fsk wave
1559 int idx = PyramiddemodFSK(BitStream, &size);
1560 if (idx < 0){
1561 if (g_debugMode==1){
1562 if (idx == -5)
1563 PrintAndLog("DEBUG: Error - not enough samples");
1564 else if (idx == -1)
1565 PrintAndLog("DEBUG: Error - only noise found");
1566 else if (idx == -2)
1567 PrintAndLog("DEBUG: Error - problem during FSK demod");
1568 else if (idx == -3)
1569 PrintAndLog("DEBUG: Error - Size not correct: %d", size);
1570 else if (idx == -4)
1571 PrintAndLog("DEBUG: Error - Pyramid preamble not found");
1572 else
1573 PrintAndLog("DEBUG: Error - idx: %d",idx);
1574 }
1575 return 0;
1576 }
1577 // Index map
1578 // 0 10 20 30 40 50 60
1579 // | | | | | | |
1580 // 0123456 7 8901234 5 6789012 3 4567890 1 2345678 9 0123456 7 8901234 5 6789012 3
1581 // -----------------------------------------------------------------------------
1582 // 0000000 0 0000000 1 0000000 1 0000000 1 0000000 1 0000000 1 0000000 1 0000000 1
1583 // premable xxxxxxx o xxxxxxx o xxxxxxx o xxxxxxx o xxxxxxx o xxxxxxx o xxxxxxx o
1584
1585 // 64 70 80 90 100 110 120
1586 // | | | | | | |
1587 // 4567890 1 2345678 9 0123456 7 8901234 5 6789012 3 4567890 1 2345678 9 0123456 7
1588 // -----------------------------------------------------------------------------
1589 // 0000000 1 0000000 1 0000000 1 0110111 0 0011000 1 0000001 0 0001100 1 1001010 0
1590 // xxxxxxx o xxxxxxx o xxxxxxx o xswffff o ffffccc o ccccccc o ccccccw o ppppppp o
1591 // |---115---||---------71---------|
1592 // s = format start bit, o = odd parity of last 7 bits
1593 // f = facility code, c = card number
1594 // w = wiegand parity, x = extra space for other formats
1595 // p = unknown checksum
1596 // (26 bit format shown)
1597
1598 //get bytes for checksum calc
1599 uint8_t checksum = bytebits_to_byte(BitStream + idx + 120, 8);
1600 uint8_t csBuff[14] = {0x00};
1601 for (uint8_t i = 0; i < 13; i++){
1602 csBuff[i] = bytebits_to_byte(BitStream + idx + 16 + (i*8), 8);
1603 }
1604 //check checksum calc
1605 //checksum calc thanks to ICEMAN!!
1606 uint32_t checkCS = CRC8Maxim(csBuff,13);
1607
1608 //get raw ID before removing parities
1609 uint32_t rawLo = bytebits_to_byte(BitStream+idx+96,32);
1610 uint32_t rawHi = bytebits_to_byte(BitStream+idx+64,32);
1611 uint32_t rawHi2 = bytebits_to_byte(BitStream+idx+32,32);
1612 uint32_t rawHi3 = bytebits_to_byte(BitStream+idx,32);
1613 setDemodBuf(BitStream,128,idx);
1614
1615 size = removeParity(BitStream, idx+8, 8, 1, 120);
1616 if (size != 105){
1617 if (g_debugMode==1)
1618 PrintAndLog("DEBUG: Error at parity check - tag size does not match Pyramid format, SIZE: %d, IDX: %d, hi3: %x",size, idx, rawHi3);
1619 return 0;
1620 }
1621
1622 // ok valid card found!
1623
1624 // Index map
1625 // 0 10 20 30 40 50 60 70
1626 // | | | | | | | |
1627 // 01234567890123456789012345678901234567890123456789012345678901234567890
1628 // -----------------------------------------------------------------------
1629 // 00000000000000000000000000000000000000000000000000000000000000000000000
1630 // xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
1631
1632 // 71 80 90 100
1633 // | | | |
1634 // 1 2 34567890 1234567890123456 7 8901234
1635 // ---------------------------------------
1636 // 1 1 01110011 0000000001000110 0 1001010
1637 // s w ffffffff cccccccccccccccc w ppppppp
1638 // |--115-| |------71------|
1639 // s = format start bit, o = odd parity of last 7 bits
1640 // f = facility code, c = card number
1641 // w = wiegand parity, x = extra space for other formats
1642 // p = unknown checksum
1643 // (26 bit format shown)
1644
1645 //find start bit to get fmtLen
1646 int j;
1647 for (j=0; j<size; j++){
1648 if(BitStream[j]) break;
1649 }
1650 uint8_t fmtLen = size-j-8;
1651 uint32_t fc = 0;
1652 uint32_t cardnum = 0;
1653 uint32_t code1 = 0;
1654 //uint32_t code2 = 0;
1655 if (fmtLen==26){
1656 fc = bytebits_to_byte(BitStream+73, 8);
1657 cardnum = bytebits_to_byte(BitStream+81, 16);
1658 code1 = bytebits_to_byte(BitStream+72,fmtLen);
1659 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);
1660 } else if (fmtLen==45){
1661 fmtLen=42; //end = 10 bits not 7 like 26 bit fmt
1662 fc = bytebits_to_byte(BitStream+53, 10);
1663 cardnum = bytebits_to_byte(BitStream+63, 32);
1664 PrintAndLog("Pyramid ID Found - BitLength: %d, FC: %d, Card: %d - Raw: %08x%08x%08x%08x", fmtLen, fc, cardnum, rawHi3, rawHi2, rawHi, rawLo);
1665 } else {
1666 cardnum = bytebits_to_byte(BitStream+81, 16);
1667 if (fmtLen>32){
1668 //code1 = bytebits_to_byte(BitStream+(size-fmtLen),fmtLen-32);
1669 //code2 = bytebits_to_byte(BitStream+(size-32),32);
1670 PrintAndLog("Pyramid ID Found - BitLength: %d -unknown BitLength- (%d), Raw: %08x%08x%08x%08x", fmtLen, cardnum, rawHi3, rawHi2, rawHi, rawLo);
1671 } else{
1672 //code1 = bytebits_to_byte(BitStream+(size-fmtLen),fmtLen);
1673 PrintAndLog("Pyramid ID Found - BitLength: %d -unknown BitLength- (%d), Raw: %08x%08x%08x%08x", fmtLen, cardnum, rawHi3, rawHi2, rawHi, rawLo);
1674 }
1675 }
1676 if (checksum == checkCS)
1677 PrintAndLog("Checksum %02x passed", checksum);
1678 else
1679 PrintAndLog("Checksum %02x failed - should have been %02x", checksum, checkCS);
1680
1681 if (g_debugMode){
1682 PrintAndLog("DEBUG: idx: %d, Len: %d, Printing Demod Buffer:", idx, 128);
1683 printDemodBuff();
1684 }
1685 return 1;
1686 }
1687
1688 int CmdFSKdemod(const char *Cmd) //old CmdFSKdemod needs updating
1689 {
1690 static const int LowTone[] = {
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 1, 1, 1, 1, 1, -1, -1, -1, -1, -1
1696 };
1697 static const int HighTone[] = {
1698 1, 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,
1703 1, 1, 1, 1, -1, -1, -1, -1, -1,
1704 };
1705
1706 int lowLen = sizeof (LowTone) / sizeof (int);
1707 int highLen = sizeof (HighTone) / sizeof (int);
1708 int convLen = (highLen > lowLen) ? highLen : lowLen;
1709 uint32_t hi = 0, lo = 0;
1710
1711 int i, j;
1712 int minMark = 0, maxMark = 0;
1713
1714 for (i = 0; i < GraphTraceLen - convLen; ++i) {
1715 int lowSum = 0, highSum = 0;
1716
1717 for (j = 0; j < lowLen; ++j) {
1718 lowSum += LowTone[j]*GraphBuffer[i+j];
1719 }
1720 for (j = 0; j < highLen; ++j) {
1721 highSum += HighTone[j] * GraphBuffer[i + j];
1722 }
1723 lowSum = abs(100 * lowSum / lowLen);
1724 highSum = abs(100 * highSum / highLen);
1725 GraphBuffer[i] = (highSum << 16) | lowSum;
1726 }
1727
1728 for(i = 0; i < GraphTraceLen - convLen - 16; ++i) {
1729 int lowTot = 0, highTot = 0;
1730 // 10 and 8 are f_s divided by f_l and f_h, rounded
1731 for (j = 0; j < 10; ++j) {
1732 lowTot += (GraphBuffer[i+j] & 0xffff);
1733 }
1734 for (j = 0; j < 8; j++) {
1735 highTot += (GraphBuffer[i + j] >> 16);
1736 }
1737 GraphBuffer[i] = lowTot - highTot;
1738 if (GraphBuffer[i] > maxMark) maxMark = GraphBuffer[i];
1739 if (GraphBuffer[i] < minMark) minMark = GraphBuffer[i];
1740 }
1741
1742 GraphTraceLen -= (convLen + 16);
1743 RepaintGraphWindow();
1744
1745 // Find bit-sync (3 lo followed by 3 high) (HID ONLY)
1746 int max = 0, maxPos = 0;
1747 for (i = 0; i < 6000; ++i) {
1748 int dec = 0;
1749 for (j = 0; j < 3 * lowLen; ++j) {
1750 dec -= GraphBuffer[i + j];
1751 }
1752 for (; j < 3 * (lowLen + highLen ); ++j) {
1753 dec += GraphBuffer[i + j];
1754 }
1755 if (dec > max) {
1756 max = dec;
1757 maxPos = i;
1758 }
1759 }
1760
1761 // place start of bit sync marker in graph
1762 GraphBuffer[maxPos] = maxMark;
1763 GraphBuffer[maxPos + 1] = minMark;
1764
1765 maxPos += j;
1766
1767 // place end of bit sync marker in graph
1768 GraphBuffer[maxPos] = maxMark;
1769 GraphBuffer[maxPos+1] = minMark;
1770
1771 PrintAndLog("actual data bits start at sample %d", maxPos);
1772 PrintAndLog("length %d/%d", highLen, lowLen);
1773
1774 uint8_t bits[46] = {0x00};
1775
1776 // find bit pairs and manchester decode them
1777 for (i = 0; i < arraylen(bits) - 1; ++i) {
1778 int dec = 0;
1779 for (j = 0; j < lowLen; ++j) {
1780 dec -= GraphBuffer[maxPos + j];
1781 }
1782 for (; j < lowLen + highLen; ++j) {
1783 dec += GraphBuffer[maxPos + j];
1784 }
1785 maxPos += j;
1786 // place inter bit marker in graph
1787 GraphBuffer[maxPos] = maxMark;
1788 GraphBuffer[maxPos + 1] = minMark;
1789
1790 // hi and lo form a 64 bit pair
1791 hi = (hi << 1) | (lo >> 31);
1792 lo = (lo << 1);
1793 // store decoded bit as binary (in hi/lo) and text (in bits[])
1794 if(dec < 0) {
1795 bits[i] = '1';
1796 lo |= 1;
1797 } else {
1798 bits[i] = '0';
1799 }
1800 }
1801 PrintAndLog("bits: '%s'", bits);
1802 PrintAndLog("hex: %08x %08x", hi, lo);
1803 return 0;
1804 }
1805
1806 //by marshmellow
1807 //attempt to psk1 demod graph buffer
1808 int PSKDemod(const char *Cmd, bool verbose)
1809 {
1810 int invert=0;
1811 int clk=0;
1812 int maxErr=100;
1813 sscanf(Cmd, "%i %i %i", &clk, &invert, &maxErr);
1814 if (clk==1){
1815 invert=1;
1816 clk=0;
1817 }
1818 if (invert != 0 && invert != 1) {
1819 if (verbose) PrintAndLog("Invalid argument: %s", Cmd);
1820 return 0;
1821 }
1822 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
1823 size_t BitLen = getFromGraphBuf(BitStream);
1824 if (BitLen==0) return -1;
1825 uint8_t carrier=countPSK_FC(BitStream, BitLen);
1826 if (carrier!=2 && carrier!=4 && carrier!=8){
1827 //invalid carrier
1828 return 0;
1829 }
1830 int errCnt=0;
1831 errCnt = pskRawDemod(BitStream, &BitLen, &clk, &invert);
1832 if (errCnt > maxErr){
1833 if (g_debugMode==1 && verbose) PrintAndLog("Too many errors found, clk: %d, invert: %d, numbits: %d, errCnt: %d",clk,invert,BitLen,errCnt);
1834 return 0;
1835 }
1836 if (errCnt<0|| BitLen<16){ //throw away static - allow 1 and -1 (in case of threshold command first)
1837 if (g_debugMode==1 && verbose) PrintAndLog("no data found, clk: %d, invert: %d, numbits: %d, errCnt: %d",clk,invert,BitLen,errCnt);
1838 return 0;
1839 }
1840 if (verbose){
1841 PrintAndLog("Tried PSK Demod using Clock: %d - invert: %d - Bits Found: %d",clk,invert,BitLen);
1842 if (errCnt>0){
1843 PrintAndLog("# Errors during Demoding (shown as 77 in bit stream): %d",errCnt);
1844 }
1845 }
1846 //prime demod buffer for output
1847 setDemodBuf(BitStream,BitLen,0);
1848 return 1;
1849 }
1850
1851 // Indala 26 bit decode
1852 // by marshmellow
1853 // optional arguments - same as CmdpskNRZrawDemod (clock & invert)
1854 int CmdIndalaDecode(const char *Cmd)
1855 {
1856 int ans;
1857 if (strlen(Cmd)>0){
1858 ans = PSKDemod(Cmd, 0);
1859 } else{ //default to RF/32
1860 ans = PSKDemod("32", 0);
1861 }
1862
1863 if (!ans){
1864 if (g_debugMode==1)
1865 PrintAndLog("Error1: %d",ans);
1866 return 0;
1867 }
1868 uint8_t invert=0;
1869 ans = indala26decode(DemodBuffer,(size_t *) &DemodBufferLen, &invert);
1870 if (ans < 1) {
1871 if (g_debugMode==1)
1872 PrintAndLog("Error2: %d",ans);
1873 return -1;
1874 }
1875 char showbits[251]={0x00};
1876 if (invert)
1877 if (g_debugMode==1)
1878 PrintAndLog("Had to invert bits");
1879
1880 //convert UID to HEX
1881 uint32_t uid1, uid2, uid3, uid4, uid5, uid6, uid7;
1882 int idx;
1883 uid1=0;
1884 uid2=0;
1885 PrintAndLog("BitLen: %d",DemodBufferLen);
1886 if (DemodBufferLen==64){
1887 for( idx=0; idx<64; idx++) {
1888 uid1=(uid1<<1)|(uid2>>31);
1889 if (DemodBuffer[idx] == 0) {
1890 uid2=(uid2<<1)|0;
1891 showbits[idx]='0';
1892 } else {
1893 uid2=(uid2<<1)|1;
1894 showbits[idx]='1';
1895 }
1896 }
1897 showbits[idx]='\0';
1898 PrintAndLog("Indala UID=%s (%x%08x)", showbits, uid1, uid2);
1899 }
1900 else {
1901 uid3=0;
1902 uid4=0;
1903 uid5=0;
1904 uid6=0;
1905 uid7=0;
1906 for( idx=0; idx<DemodBufferLen; idx++) {
1907 uid1=(uid1<<1)|(uid2>>31);
1908 uid2=(uid2<<1)|(uid3>>31);
1909 uid3=(uid3<<1)|(uid4>>31);
1910 uid4=(uid4<<1)|(uid5>>31);
1911 uid5=(uid5<<1)|(uid6>>31);
1912 uid6=(uid6<<1)|(uid7>>31);
1913 if (DemodBuffer[idx] == 0) {
1914 uid7=(uid7<<1)|0;
1915 showbits[idx]='0';
1916 }
1917 else {
1918 uid7=(uid7<<1)|1;
1919 showbits[idx]='1';
1920 }
1921 }
1922 showbits[idx]='\0';
1923 PrintAndLog("Indala UID=%s (%x%08x%08x%08x%08x%08x%08x)", showbits, uid1, uid2, uid3, uid4, uid5, uid6, uid7);
1924 }
1925 if (g_debugMode){
1926 PrintAndLog("DEBUG: printing demodbuffer:");
1927 printDemodBuff();
1928 }
1929 return 1;
1930 }
1931
1932 // by marshmellow
1933 // takes 3 arguments - clock, invert, maxErr as integers
1934 // attempts to demodulate nrz only
1935 // prints binary found and saves in demodbuffer for further commands
1936
1937 int NRZrawDemod(const char *Cmd, bool verbose)
1938 {
1939 int invert=0;
1940 int clk=0;
1941 int maxErr=100;
1942 sscanf(Cmd, "%i %i %i", &clk, &invert, &maxErr);
1943 if (clk==1){
1944 invert=1;
1945 clk=0;
1946 }
1947 if (invert != 0 && invert != 1) {
1948 PrintAndLog("Invalid argument: %s", Cmd);
1949 return 0;
1950 }
1951 uint8_t BitStream[MAX_GRAPH_TRACE_LEN]={0};
1952 size_t BitLen = getFromGraphBuf(BitStream);
1953 if (BitLen==0) return 0;
1954 int errCnt=0;
1955 errCnt = nrzRawDemod(BitStream, &BitLen, &clk, &invert, maxErr);
1956 if (errCnt > maxErr){
1957 if (g_debugMode) PrintAndLog("Too many errors found, clk: %d, invert: %d, numbits: %d, errCnt: %d",clk,invert,BitLen,errCnt);
1958 return 0;
1959 }
1960 if (errCnt<0|| BitLen<16){ //throw away static - allow 1 and -1 (in case of threshold command first)
1961 if (g_debugMode) PrintAndLog("no data found, clk: %d, invert: %d, numbits: %d, errCnt: %d",clk,invert,BitLen,errCnt);
1962 return 0;
1963 }
1964 if (verbose || g_debugMode) PrintAndLog("Tried NRZ Demod using Clock: %d - invert: %d - Bits Found: %d",clk,invert,BitLen);
1965 //prime demod buffer for output
1966 setDemodBuf(BitStream,BitLen,0);
1967
1968 if (errCnt>0 && (verbose || g_debugMode)) PrintAndLog("# Errors during Demoding (shown as 77 in bit stream): %d",errCnt);
1969 if (verbose || g_debugMode) {
1970 PrintAndLog("NRZ demoded bitstream:");
1971 // Now output the bitstream to the scrollback by line of 16 bits
1972 printDemodBuff();
1973 }
1974 return 1;
1975 }
1976
1977 int CmdNRZrawDemod(const char *Cmd)
1978 {
1979 char cmdp = param_getchar(Cmd, 0);
1980 if (strlen(Cmd) > 10 || cmdp == 'h' || cmdp == 'H') {
1981 PrintAndLog("Usage: data rawdemod nr [clock] <0|1> [maxError]");
1982 PrintAndLog(" [set clock as integer] optional, if not set, autodetect.");
1983 PrintAndLog(" <invert>, 1 for invert output");
1984 PrintAndLog(" [set maximum allowed errors], default = 100.");
1985 PrintAndLog("");
1986 PrintAndLog(" sample: data rawdemod nr = demod a nrz/direct tag from GraphBuffer");
1987 PrintAndLog(" : data rawdemod nr 32 = demod a nrz/direct tag from GraphBuffer using a clock of RF/32");
1988 PrintAndLog(" : data rawdemod nr 32 1 = demod a nrz/direct tag from GraphBuffer using a clock of RF/32 and inverting data");
1989 PrintAndLog(" : data rawdemod nr 1 = demod a nrz/direct tag from GraphBuffer while inverting data");
1990 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");
1991 return 0;
1992 }
1993 return NRZrawDemod(Cmd, TRUE);
1994 }
1995
1996 // by marshmellow
1997 // takes 3 arguments - clock, invert, maxErr as integers
1998 // attempts to demodulate psk only
1999 // prints binary found and saves in demodbuffer for further commands
2000 int CmdPSK1rawDemod(const char *Cmd)
2001 {
2002 int ans;
2003 char cmdp = param_getchar(Cmd, 0);
2004 if (strlen(Cmd) > 10 || cmdp == 'h' || cmdp == 'H') {
2005 PrintAndLog("Usage: data rawdemod p1 [clock] <0|1> [maxError]");
2006 PrintAndLog(" [set clock as integer] optional, if not set, autodetect.");
2007 PrintAndLog(" <invert>, 1 for invert output");
2008 PrintAndLog(" [set maximum allowed errors], default = 100.");
2009 PrintAndLog("");
2010 PrintAndLog(" sample: data rawdemod p1 = demod a psk1 tag from GraphBuffer");
2011 PrintAndLog(" : data rawdemod p1 32 = demod a psk1 tag from GraphBuffer using a clock of RF/32");
2012 PrintAndLog(" : data rawdemod p1 32 1 = demod a psk1 tag from GraphBuffer using a clock of RF/32 and inverting data");
2013 PrintAndLog(" : data rawdemod p1 1 = demod a psk1 tag from GraphBuffer while inverting data");
2014 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");
2015 return 0;
2016 }
2017 ans = PSKDemod(Cmd, TRUE);
2018 //output
2019 if (!ans){
2020 if (g_debugMode) PrintAndLog("Error demoding: %d",ans);
2021 return 0;
2022 }
2023
2024 PrintAndLog("PSK demoded bitstream:");
2025 // Now output the bitstream to the scrollback by line of 16 bits
2026 printDemodBuff();
2027 return 1;
2028 }
2029
2030 // by marshmellow
2031 // takes same args as cmdpsk1rawdemod
2032 int CmdPSK2rawDemod(const char *Cmd)
2033 {
2034 int ans=0;
2035 char cmdp = param_getchar(Cmd, 0);
2036 if (strlen(Cmd) > 10 || cmdp == 'h' || cmdp == 'H') {
2037 PrintAndLog("Usage: data rawdemod p2 [clock] <0|1> [maxError]");
2038 PrintAndLog(" [set clock as integer] optional, if not set, autodetect.");
2039 PrintAndLog(" <invert>, 1 for invert output");
2040 PrintAndLog(" [set maximum allowed errors], default = 100.");
2041 PrintAndLog("");
2042 PrintAndLog(" sample: data rawdemod p2 = demod a psk2 tag from GraphBuffer, autodetect clock");
2043 PrintAndLog(" : data rawdemod p2 32 = demod a psk2 tag from GraphBuffer using a clock of RF/32");
2044 PrintAndLog(" : data rawdemod p2 32 1 = demod a psk2 tag from GraphBuffer using a clock of RF/32 and inverting output");
2045 PrintAndLog(" : data rawdemod p2 1 = demod a psk2 tag from GraphBuffer, autodetect clock and invert output");
2046 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");
2047 return 0;
2048 }
2049 ans=PSKDemod(Cmd, TRUE);
2050 if (!ans){
2051 if (g_debugMode) PrintAndLog("Error demoding: %d",ans);
2052 return 0;
2053 }
2054 psk1TOpsk2(DemodBuffer, DemodBufferLen);
2055 PrintAndLog("PSK2 demoded bitstream:");
2056 // Now output the bitstream to the scrollback by line of 16 bits
2057 printDemodBuff();
2058 return 1;
2059 }
2060
2061 // by marshmellow - combines all raw demod functions into one menu command
2062 int CmdRawDemod(const char *Cmd)
2063 {
2064 char cmdp = Cmd[0]; //param_getchar(Cmd, 0);
2065
2066 if (strlen(Cmd) > 14 || cmdp == 'h' || cmdp == 'H' || strlen(Cmd)<2) {
2067 PrintAndLog("Usage: data rawdemod [modulation] <help>|<options>");
2068 PrintAndLog(" [modulation] as 2 char, 'ab' for ask/biphase, 'am' for ask/manchester, 'ar' for ask/raw, 'fs' for fsk, ...");
2069 PrintAndLog(" 'nr' for nrz/direct, 'p1' for psk1, 'p2' for psk2");
2070 PrintAndLog(" <help> as 'h', prints the help for the specific modulation");
2071 PrintAndLog(" <options> see specific modulation help for optional parameters");
2072 PrintAndLog("");
2073 PrintAndLog(" sample: data rawdemod fs h = print help specific to fsk demod");
2074 PrintAndLog(" : data rawdemod fs = demod GraphBuffer using: fsk - autodetect");
2075 PrintAndLog(" : data rawdemod ab = demod GraphBuffer using: ask/biphase - autodetect");
2076 PrintAndLog(" : data rawdemod am = demod GraphBuffer using: ask/manchester - autodetect");
2077 PrintAndLog(" : data rawdemod ar = demod GraphBuffer using: ask/raw - autodetect");
2078 PrintAndLog(" : data rawdemod nr = demod GraphBuffer using: nrz/direct - autodetect");
2079 PrintAndLog(" : data rawdemod p1 = demod GraphBuffer using: psk1 - autodetect");
2080 PrintAndLog(" : data rawdemod p2 = demod GraphBuffer using: psk2 - autodetect");
2081 return 0;
2082 }
2083 char cmdp2 = Cmd[1];
2084 int ans = 0;
2085 if (cmdp == 'f' && cmdp2 == 's'){
2086 ans = CmdFSKrawdemod(Cmd+3);
2087 } else if(cmdp == 'a' && cmdp2 == 'b'){
2088 ans = Cmdaskbiphdemod(Cmd+3);
2089 } else if(cmdp == 'a' && cmdp2 == 'm'){
2090 ans = Cmdaskmandemod(Cmd+3);
2091 } else if(cmdp == 'a' && cmdp2 == 'r'){
2092 ans = Cmdaskrawdemod(Cmd+3);
2093 } else if(cmdp == 'n' && cmdp2 == 'r'){
2094 ans = CmdNRZrawDemod(Cmd+3);
2095 } else if(cmdp == 'p' && cmdp2 == '1'){
2096 ans = CmdPSK1rawDemod(Cmd+3);
2097 } else if(cmdp == 'p' && cmdp2 == '2'){
2098 ans = CmdPSK2rawDemod(Cmd+3);
2099 } else {
2100 PrintAndLog("unknown modulation entered - see help ('h') for parameter structure");
2101 }
2102 return ans;
2103 }
2104
2105 int CmdGrid(const char *Cmd)
2106 {
2107 sscanf(Cmd, "%i %i", &PlotGridX, &PlotGridY);
2108 PlotGridXdefault= PlotGridX;
2109 PlotGridYdefault= PlotGridY;
2110 RepaintGraphWindow();
2111 return 0;
2112 }
2113
2114 int CmdHexsamples(const char *Cmd)
2115 {
2116 int i, j;
2117 int requested = 0;
2118 int offset = 0;
2119 char string_buf[25];
2120 char* string_ptr = string_buf;
2121 uint8_t got[BIGBUF_SIZE];
2122
2123 sscanf(Cmd, "%i %i", &requested, &offset);
2124
2125 /* if no args send something */
2126 if (requested == 0) {
2127 requested = 8;
2128 }
2129 if (offset + requested > sizeof(got)) {
2130 PrintAndLog("Tried to read past end of buffer, <bytes> + <offset> > %d", BIGBUF_SIZE);
2131 return 0;
2132 }
2133
2134 GetFromBigBuf(got,requested,offset);
2135 WaitForResponse(CMD_ACK,NULL);
2136
2137 i = 0;
2138 for (j = 0; j < requested; j++) {
2139 i++;
2140 string_ptr += sprintf(string_ptr, "%02x ", got[j]);
2141 if (i == 8) {
2142 *(string_ptr - 1) = '\0'; // remove the trailing space
2143 PrintAndLog("%s", string_buf);
2144 string_buf[0] = '\0';
2145 string_ptr = string_buf;
2146 i = 0;
2147 }
2148 if (j == requested - 1 && string_buf[0] != '\0') { // print any remaining bytes
2149 *(string_ptr - 1) = '\0';
2150 PrintAndLog("%s", string_buf);
2151 string_buf[0] = '\0';
2152 }
2153 }
2154 return 0;
2155 }
2156
2157 int CmdHide(const char *Cmd)
2158 {
2159 HideGraphWindow();
2160 return 0;
2161 }
2162
2163 //zero mean GraphBuffer
2164 int CmdHpf(const char *Cmd)
2165 {
2166 int i;
2167 int accum = 0;
2168
2169 for (i = 10; i < GraphTraceLen; ++i)
2170 accum += GraphBuffer[i];
2171 accum /= (GraphTraceLen - 10);
2172 for (i = 0; i < GraphTraceLen; ++i)
2173 GraphBuffer[i] -= accum;
2174
2175 RepaintGraphWindow();
2176 return 0;
2177 }
2178 typedef struct {
2179 uint8_t * buffer;
2180 uint32_t numbits;
2181 uint32_t position;
2182 }BitstreamOut;
2183
2184 bool _headBit( BitstreamOut *stream)
2185 {
2186 int bytepos = stream->position >> 3; // divide by 8
2187 int bitpos = (stream->position++) & 7; // mask out 00000111
2188 return (*(stream->buffer + bytepos) >> (7-bitpos)) & 1;
2189 }
2190
2191 uint8_t getByte(uint8_t bits_per_sample, BitstreamOut* b)
2192 {
2193 int i;
2194 uint8_t val = 0;
2195 for(i =0 ; i < bits_per_sample; i++)
2196 {
2197 val |= (_headBit(b) << (7-i));
2198 }
2199 return val;
2200 }
2201
2202 int getSamples(const char *Cmd, bool silent)
2203 {
2204 //If we get all but the last byte in bigbuf,
2205 // we don't have to worry about remaining trash
2206 // in the last byte in case the bits-per-sample
2207 // does not line up on byte boundaries
2208
2209 uint8_t got[BIGBUF_SIZE-1] = { 0 };
2210
2211 int n = strtol(Cmd, NULL, 0);
2212
2213 if (n == 0)
2214 n = sizeof(got);
2215
2216 if (n > sizeof(got))
2217 n = sizeof(got);
2218
2219 PrintAndLog("Reading %d bytes from device memory\n", n);
2220 GetFromBigBuf(got,n,0);
2221 PrintAndLog("Data fetched");
2222 UsbCommand response;
2223 WaitForResponse(CMD_ACK, &response);
2224 uint8_t bits_per_sample = 8;
2225
2226 //Old devices without this feature would send 0 at arg[0]
2227 if(response.arg[0] > 0)
2228 {
2229 sample_config *sc = (sample_config *) response.d.asBytes;
2230 PrintAndLog("Samples @ %d bits/smpl, decimation 1:%d ", sc->bits_per_sample
2231 , sc->decimation);
2232 bits_per_sample = sc->bits_per_sample;
2233 }
2234 if(bits_per_sample < 8)
2235 {
2236 PrintAndLog("Unpacking...");
2237 BitstreamOut bout = { got, bits_per_sample * n, 0};
2238 int j =0;
2239 for (j = 0; j * bits_per_sample < n * 8 && j < sizeof(GraphBuffer); j++) {
2240 uint8_t sample = getByte(bits_per_sample, &bout);
2241 GraphBuffer[j] = ((int) sample )- 128;
2242 }
2243 GraphTraceLen = j;
2244 PrintAndLog("Unpacked %d samples" , j );
2245 }else
2246 {
2247 for (int j = 0; j < n; j++) {
2248 GraphBuffer[j] = ((int)got[j]) - 128;
2249 }
2250 GraphTraceLen = n;
2251 }
2252
2253 RepaintGraphWindow();
2254 return 0;
2255 }
2256
2257 int CmdSamples(const char *Cmd)
2258 {
2259 return getSamples(Cmd, false);
2260 }
2261
2262 int CmdTuneSamples(const char *Cmd)
2263 {
2264 int timeout = 0;
2265 printf("\nMeasuring antenna characteristics, please wait...");
2266
2267 UsbCommand c = {CMD_MEASURE_ANTENNA_TUNING};
2268 SendCommand(&c);
2269
2270 UsbCommand resp;
2271 while(!WaitForResponseTimeout(CMD_MEASURED_ANTENNA_TUNING,&resp,1000)) {
2272 timeout++;
2273 printf(".");
2274 if (timeout > 7) {
2275 PrintAndLog("\nNo response from Proxmark. Aborting...");
2276 return 1;
2277 }
2278 }
2279
2280 int peakv, peakf;
2281 int vLf125, vLf134, vHf;
2282 vLf125 = resp.arg[0] & 0xffff;
2283 vLf134 = resp.arg[0] >> 16;
2284 vHf = resp.arg[1] & 0xffff;;
2285 peakf = resp.arg[2] & 0xffff;
2286 peakv = resp.arg[2] >> 16;
2287 PrintAndLog("");
2288 PrintAndLog("# LF antenna: %5.2f V @ 125.00 kHz", vLf125/1000.0);
2289 PrintAndLog("# LF antenna: %5.2f V @ 134.00 kHz", vLf134/1000.0);
2290 PrintAndLog("# LF optimal: %5.2f V @%9.2f kHz", peakv/1000.0, 12000.0/(peakf+1));
2291 PrintAndLog("# HF antenna: %5.2f V @ 13.56 MHz", vHf/1000.0);
2292
2293 #define LF_UNUSABLE_V 2948 // was 2000. Changed due to bugfix in voltage measurements. LF results are now 47% higher.
2294 #define LF_MARGINAL_V 14739 // was 10000. Changed due to bugfix bug in voltage measurements. LF results are now 47% higher.
2295 #define HF_UNUSABLE_V 3167 // was 2000. Changed due to bugfix in voltage measurements. HF results are now 58% higher.
2296 #define HF_MARGINAL_V 7917 // was 5000. Changed due to bugfix in voltage measurements. HF results are now 58% higher.
2297
2298 if (peakv < LF_UNUSABLE_V)
2299 PrintAndLog("# Your LF antenna is unusable.");
2300 else if (peakv < LF_MARGINAL_V)
2301 PrintAndLog("# Your LF antenna is marginal.");
2302 if (vHf < HF_UNUSABLE_V)
2303 PrintAndLog("# Your HF antenna is unusable.");
2304 else if (vHf < HF_MARGINAL_V)
2305 PrintAndLog("# Your HF antenna is marginal.");
2306
2307 if (peakv >= LF_UNUSABLE_V) {
2308 for (int i = 0; i < 256; i++) {
2309 GraphBuffer[i] = resp.d.asBytes[i] - 128;
2310 }
2311 PrintAndLog("Displaying LF tuning graph. Divisor 89 is 134khz, 95 is 125khz.\n");
2312 PrintAndLog("\n");
2313 GraphTraceLen = 256;
2314 ShowGraphWindow();
2315 RepaintGraphWindow();
2316 }
2317
2318 return 0;
2319 }
2320
2321
2322 int CmdLoad(const char *Cmd)
2323 {
2324 char filename[FILE_PATH_SIZE] = {0x00};
2325 int len = 0;
2326
2327 len = strlen(Cmd);
2328 if (len > FILE_PATH_SIZE) len = FILE_PATH_SIZE;
2329 memcpy(filename, Cmd, len);
2330
2331 FILE *f = fopen(filename, "r");
2332 if (!f) {
2333 PrintAndLog("couldn't open '%s'", filename);
2334 return 0;
2335 }
2336
2337 GraphTraceLen = 0;
2338 char line[80];
2339 while (fgets(line, sizeof (line), f)) {
2340 GraphBuffer[GraphTraceLen] = atoi(line);
2341 GraphTraceLen++;
2342 }
2343 fclose(f);
2344 PrintAndLog("loaded %d samples", GraphTraceLen);
2345 RepaintGraphWindow();
2346 return 0;
2347 }
2348
2349 int CmdLtrim(const char *Cmd)
2350 {
2351 int ds = atoi(Cmd);
2352
2353 for (int i = ds; i < GraphTraceLen; ++i)
2354 GraphBuffer[i-ds] = GraphBuffer[i];
2355 GraphTraceLen -= ds;
2356
2357 RepaintGraphWindow();
2358 return 0;
2359 }
2360
2361 // trim graph to input argument length
2362 int CmdRtrim(const char *Cmd)
2363 {
2364 int ds = atoi(Cmd);
2365
2366 GraphTraceLen = ds;
2367
2368 RepaintGraphWindow();
2369 return 0;
2370 }
2371
2372 /*
2373 * Manchester demodulate a bitstream. The bitstream needs to be already in
2374 * the GraphBuffer as 0 and 1 values
2375 *
2376 * Give the clock rate as argument in order to help the sync - the algorithm
2377 * resyncs at each pulse anyway.
2378 *
2379 * Not optimized by any means, this is the 1st time I'm writing this type of
2380 * routine, feel free to improve...
2381 *
2382 * 1st argument: clock rate (as number of samples per clock rate)
2383 * Typical values can be 64, 32, 128...
2384 */
2385 int CmdManchesterDemod(const char *Cmd)
2386 {
2387 int i, j, invert= 0;
2388 int bit;
2389 int clock;
2390 int lastval = 0;
2391 int low = 0;
2392 int high = 0;
2393 int hithigh, hitlow, first;
2394 int lc = 0;
2395 int bitidx = 0;
2396 int bit2idx = 0;
2397 int warnings = 0;
2398
2399 /* check if we're inverting output */
2400 if (*Cmd == 'i')
2401 {
2402 PrintAndLog("Inverting output");
2403 invert = 1;
2404 ++Cmd;
2405 do
2406 ++Cmd;
2407 while(*Cmd == ' '); // in case a 2nd argument was given
2408 }
2409
2410 /* Holds the decoded bitstream: each clock period contains 2 bits */
2411 /* later simplified to 1 bit after manchester decoding. */
2412 /* Add 10 bits to allow for noisy / uncertain traces without aborting */
2413 /* int BitStream[GraphTraceLen*2/clock+10]; */
2414
2415 /* But it does not work if compiling on WIndows: therefore we just allocate a */
2416 /* large array */
2417 uint8_t BitStream[MAX_GRAPH_TRACE_LEN] = {0};
2418
2419 /* Detect high and lows */
2420 for (i = 0; i < GraphTraceLen; i++)
2421 {
2422 if (GraphBuffer[i] > high)
2423 high = GraphBuffer[i];
2424 else if (GraphBuffer[i] < low)
2425 low = GraphBuffer[i];
2426 }
2427
2428 /* Get our clock */
2429 clock = GetAskClock(Cmd, high, 1);
2430
2431 int tolerance = clock/4;
2432
2433 /* Detect first transition */
2434 /* Lo-Hi (arbitrary) */
2435 /* skip to the first high */
2436 for (i= 0; i < GraphTraceLen; i++)
2437 if (GraphBuffer[i] == high)
2438 break;
2439 /* now look for the first low */
2440 for (; i < GraphTraceLen; i++)
2441 {
2442 if (GraphBuffer[i] == low)
2443 {
2444 lastval = i;
2445 break;
2446 }
2447 }
2448
2449 /* If we're not working with 1/0s, demod based off clock */
2450 if (high != 1)
2451 {
2452 bit = 0; /* We assume the 1st bit is zero, it may not be
2453 * the case: this routine (I think) has an init problem.
2454 * Ed.
2455 */
2456 for (; i < (int)(GraphTraceLen / clock); i++)
2457 {
2458 hithigh = 0;
2459 hitlow = 0;
2460 first = 1;
2461
2462 /* Find out if we hit both high and low peaks */
2463 for (j = 0; j < clock; j++)
2464 {
2465 if (GraphBuffer[(i * clock) + j] == high)
2466 hithigh = 1;
2467 else if (GraphBuffer[(i * clock) + j] == low)
2468 hitlow = 1;
2469
2470 /* it doesn't count if it's the first part of our read
2471 because it's really just trailing from the last sequence */
2472 if (first && (hithigh || hitlow))
2473 hithigh = hitlow = 0;
2474 else
2475 first = 0;
2476
2477 if (hithigh && hitlow)
2478 break;
2479 }
2480
2481 /* If we didn't hit both high and low peaks, we had a bit transition */
2482 if (!hithigh || !hitlow)
2483 bit ^= 1;
2484
2485 BitStream[bit2idx++] = bit ^ invert;
2486 }
2487 }
2488
2489 /* standard 1/0 bitstream */
2490 else
2491 {
2492
2493 /* Then detect duration between 2 successive transitions */
2494 for (bitidx = 1; i < GraphTraceLen; i++)
2495 {
2496 if (GraphBuffer[i-1] != GraphBuffer[i])
2497 {
2498 lc = i-lastval;
2499 lastval = i;
2500
2501 // Error check: if bitidx becomes too large, we do not
2502 // have a Manchester encoded bitstream or the clock is really
2503 // wrong!
2504 if (bitidx > (GraphTraceLen*2/clock+8) ) {
2505 PrintAndLog("Error: the clock you gave is probably wrong, aborting.");
2506 return 0;
2507 }
2508 // Then switch depending on lc length:
2509 // Tolerance is 1/4 of clock rate (arbitrary)
2510 if (abs(lc-clock/2) < tolerance) {
2511 // Short pulse : either "1" or "0"
2512 BitStream[bitidx++]=GraphBuffer[i-1];
2513 } else if (abs(lc-clock) < tolerance) {
2514 // Long pulse: either "11" or "00"
2515 BitStream[bitidx++]=GraphBuffer[i-1];
2516 BitStream[bitidx++]=GraphBuffer[i-1];
2517 } else {
2518 // Error
2519 warnings++;
2520 PrintAndLog("Warning: Manchester decode error for pulse width detection.");
2521 PrintAndLog("(too many of those messages mean either the stream is not Manchester encoded, or clock is wrong)");
2522
2523 if (warnings > 10)
2524 {
2525 PrintAndLog("Error: too many detection errors, aborting.");
2526 return 0;
2527 }
2528 }
2529 }
2530 }
2531
2532 // At this stage, we now have a bitstream of "01" ("1") or "10" ("0"), parse it into final decoded bitstream
2533 // Actually, we overwrite BitStream with the new decoded bitstream, we just need to be careful
2534 // to stop output at the final bitidx2 value, not bitidx
2535 for (i = 0; i < bitidx; i += 2) {
2536 if ((BitStream[i] == 0) && (BitStream[i+1] == 1)) {
2537 BitStream[bit2idx++] = 1 ^ invert;
2538 } else if ((BitStream[i] == 1) && (BitStream[i+1] == 0)) {
2539 BitStream[bit2idx++] = 0 ^ invert;
2540 } else {
2541 // We cannot end up in this state, this means we are unsynchronized,
2542 // move up 1 bit:
2543 i++;
2544 warnings++;
2545 PrintAndLog("Unsynchronized, resync...");
2546 PrintAndLog("(too many of those messages mean the stream is not Manchester encoded)");
2547
2548 if (warnings > 10)
2549 {
2550 PrintAndLog("Error: too many decode errors, aborting.");
2551 return 0;
2552 }
2553 }
2554 }
2555 }
2556
2557 PrintAndLog("Manchester decoded bitstream");
2558 // Now output the bitstream to the scrollback by line of 16 bits
2559 for (i = 0; i < (bit2idx-16); i+=16) {
2560 PrintAndLog("%i %i %i %i %i %i %i %i %i %i %i %i %i %i %i %i",
2561 BitStream[i],
2562 BitStream[i+1],
2563 BitStream[i+2],
2564 BitStream[i+3],
2565 BitStream[i+4],
2566 BitStream[i+5],
2567 BitStream[i+6],
2568 BitStream[i+7],
2569 BitStream[i+8],
2570 BitStream[i+9],
2571 BitStream[i+10],
2572 BitStream[i+11],
2573 BitStream[i+12],
2574 BitStream[i+13],
2575 BitStream[i+14],
2576 BitStream[i+15]);
2577 }
2578 return 0;
2579 }
2580
2581 /* Modulate our data into manchester */
2582 int CmdManchesterMod(const char *Cmd)
2583 {
2584 int i, j;
2585 int clock;
2586 int bit, lastbit, wave;
2587
2588 /* Get our clock */
2589 clock = GetAskClock(Cmd, 0, 1);
2590
2591 wave = 0;
2592 lastbit = 1;
2593 for (i = 0; i < (int)(GraphTraceLen / clock); i++)
2594 {
2595 bit = GraphBuffer[i * clock] ^ 1;
2596
2597 for (j = 0; j < (int)(clock/2); j++)
2598 GraphBuffer[(i * clock) + j] = bit ^ lastbit ^ wave;
2599 for (j = (int)(clock/2); j < clock; j++)
2600 GraphBuffer[(i * clock) + j] = bit ^ lastbit ^ wave ^ 1;
2601
2602 /* Keep track of how we start our wave and if we changed or not this time */
2603 wave ^= bit ^ lastbit;
2604 lastbit = bit;
2605 }
2606
2607 RepaintGraphWindow();
2608 return 0;
2609 }
2610
2611 int CmdNorm(const char *Cmd)
2612 {
2613 int i;
2614 int max = INT_MIN, min = INT_MAX;
2615
2616 for (i = 10; i < GraphTraceLen; ++i) {
2617 if (GraphBuffer[i] > max)
2618 max = GraphBuffer[i];
2619 if (GraphBuffer[i] < min)
2620 min = GraphBuffer[i];
2621 }
2622
2623 if (max != min) {
2624 for (i = 0; i < GraphTraceLen; ++i) {
2625 GraphBuffer[i] = (GraphBuffer[i] - ((max + min) / 2)) * 256 /
2626 (max - min);
2627 //marshmelow: adjusted *1000 to *256 to make +/- 128 so demod commands still work
2628 }
2629 }
2630 RepaintGraphWindow();
2631 return 0;
2632 }
2633
2634 int CmdPlot(const char *Cmd)
2635 {
2636 ShowGraphWindow();
2637 return 0;
2638 }
2639
2640 int CmdSave(const char *Cmd)
2641 {
2642 char filename[FILE_PATH_SIZE] = {0x00};
2643 int len = 0;
2644
2645 len = strlen(Cmd);
2646 if (len > FILE_PATH_SIZE) len = FILE_PATH_SIZE;
2647 memcpy(filename, Cmd, len);
2648
2649
2650 FILE *f = fopen(filename, "w");
2651 if(!f) {
2652 PrintAndLog("couldn't open '%s'", filename);
2653 return 0;
2654 }
2655 int i;
2656 for (i = 0; i < GraphTraceLen; i++) {
2657 fprintf(f, "%d\n", GraphBuffer[i]);
2658 }
2659 fclose(f);
2660 PrintAndLog("saved to '%s'", Cmd);
2661 return 0;
2662 }
2663
2664 int CmdScale(const char *Cmd)
2665 {
2666 CursorScaleFactor = atoi(Cmd);
2667 if (CursorScaleFactor == 0) {
2668 PrintAndLog("bad, can't have zero scale");
2669 CursorScaleFactor = 1;
2670 }
2671 RepaintGraphWindow();
2672 return 0;
2673 }
2674
2675 int CmdThreshold(const char *Cmd)
2676 {
2677 int threshold = atoi(Cmd);
2678
2679 for (int i = 0; i < GraphTraceLen; ++i) {
2680 if (GraphBuffer[i] >= threshold)
2681 GraphBuffer[i] = 1;
2682 else
2683 GraphBuffer[i] = -1;
2684 }
2685 RepaintGraphWindow();
2686 return 0;
2687 }
2688
2689 int CmdDirectionalThreshold(const char *Cmd)
2690 {
2691 int8_t upThres = param_get8(Cmd, 0);
2692 int8_t downThres = param_get8(Cmd, 1);
2693
2694 printf("Applying Up Threshold: %d, Down Threshold: %d\n", upThres, downThres);
2695
2696 int lastValue = GraphBuffer[0];
2697 GraphBuffer[0] = 0; // Will be changed at the end, but init 0 as we adjust to last samples value if no threshold kicks in.
2698
2699 for (int i = 1; i < GraphTraceLen; ++i) {
2700 // Apply first threshold to samples heading up
2701 if (GraphBuffer[i] >= upThres && GraphBuffer[i] > lastValue)
2702 {
2703 lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it.
2704 GraphBuffer[i] = 1;
2705 }
2706 // Apply second threshold to samples heading down
2707 else if (GraphBuffer[i] <= downThres && GraphBuffer[i] < lastValue)
2708 {
2709 lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it.
2710 GraphBuffer[i] = -1;
2711 }
2712 else
2713 {
2714 lastValue = GraphBuffer[i]; // Buffer last value as we overwrite it.
2715 GraphBuffer[i] = GraphBuffer[i-1];
2716
2717 }
2718 }
2719 GraphBuffer[0] = GraphBuffer[1]; // Aline with first edited sample.
2720 RepaintGraphWindow();
2721 return 0;
2722 }
2723
2724 int CmdZerocrossings(const char *Cmd)
2725 {
2726 // Zero-crossings aren't meaningful unless the signal is zero-mean.
2727 CmdHpf("");
2728
2729 int sign = 1;
2730 int zc = 0;
2731 int lastZc = 0;
2732
2733 for (int i = 0; i < GraphTraceLen; ++i) {
2734 if (GraphBuffer[i] * sign >= 0) {
2735 // No change in sign, reproduce the previous sample count.
2736 zc++;
2737 GraphBuffer[i] = lastZc;
2738 } else {
2739 // Change in sign, reset the sample count.
2740 sign = -sign;
2741 GraphBuffer[i] = lastZc;
2742 if (sign > 0) {
2743 lastZc = zc;
2744 zc = 0;
2745 }
2746 }
2747 }
2748
2749 RepaintGraphWindow();
2750 return 0;
2751 }
2752
2753 static command_t CommandTable[] =
2754 {
2755 {"help", CmdHelp, 1, "This help"},
2756 {"amp", CmdAmp, 1, "Amplify peaks"},
2757 //{"askdemod", Cmdaskdemod, 1, "<0 or 1> -- Attempt to demodulate simple ASK tags"},
2758 {"askedgedetect", CmdAskEdgeDetect, 1, "[threshold] Adjust Graph for manual ask demod using length of sample differences to detect the edge of a wave (default = 25)"},
2759 {"askem410xdemod", CmdAskEM410xDemod, 1, "[clock] [invert<0|1>] [maxErr] -- Demodulate an EM410x tag from GraphBuffer (args optional)"},
2760 {"askgproxiidemod", CmdG_Prox_II_Demod, 1, "Demodulate a G Prox II tag from GraphBuffer"},
2761 {"autocorr", CmdAutoCorr, 1, "[window length] [g] -- Autocorrelation over window - g to save back to GraphBuffer (overwrite)"},
2762 {"biphaserawdecode",CmdBiphaseDecodeRaw,1,"[offset] [invert<0|1>] Biphase decode bin stream in DemodBuffer (offset = 0|1 bits to shift the decode start)"},
2763 {"bitsamples", CmdBitsamples, 0, "Get raw samples as bitstring"},
2764 //{"bitstream", CmdBitstream, 1, "[clock rate] -- Convert waveform into a bitstream"},
2765 {"buffclear", CmdBuffClear, 1, "Clear sample buffer and graph window"},
2766 {"dec", CmdDec, 1, "Decimate samples"},
2767 {"detectclock", CmdDetectClockRate, 1, "[modulation] Detect clock rate of wave in GraphBuffer (options: 'a','f','n','p' for ask, fsk, nrz, psk respectively)"},
2768 //{"fskdemod", CmdFSKdemod, 1, "Demodulate graph window as a HID FSK"},
2769 {"fskawiddemod", CmdFSKdemodAWID, 1, "Demodulate an AWID FSK tag from GraphBuffer"},
2770 //{"fskfcdetect", CmdFSKfcDetect, 1, "Try to detect the Field Clock of an FSK wave"},
2771 {"fskhiddemod", CmdFSKdemodHID, 1, "Demodulate a HID FSK tag from GraphBuffer"},
2772 {"fskiodemod", CmdFSKdemodIO, 1, "Demodulate an IO Prox FSK tag from GraphBuffer"},
2773 {"fskpyramiddemod", CmdFSKdemodPyramid, 1, "Demodulate a Pyramid FSK tag from GraphBuffer"},
2774 {"fskparadoxdemod", CmdFSKdemodParadox, 1, "Demodulate a Paradox FSK tag from GraphBuffer"},
2775 {"getbitstream", CmdGetBitStream, 1, "Convert GraphBuffer's >=1 values to 1 and <1 to 0"},
2776 {"grid", CmdGrid, 1, "<x> <y> -- overlay grid on graph window, use zero value to turn off either"},
2777 {"hexsamples", CmdHexsamples, 0, "<bytes> [<offset>] -- Dump big buffer as hex bytes"},
2778 {"hide", CmdHide, 1, "Hide graph window"},
2779 {"hpf", CmdHpf, 1, "Remove DC offset from trace"},
2780 {"load", CmdLoad, 1, "<filename> -- Load trace (to graph window"},
2781 {"ltrim", CmdLtrim, 1, "<samples> -- Trim samples from left of trace"},
2782 {"rtrim", CmdRtrim, 1, "<location to end trace> -- Trim samples from right of trace"},
2783 //{"mandemod", CmdManchesterDemod, 1, "[i] [clock rate] -- Manchester demodulate binary stream (option 'i' to invert output)"},
2784 {"manrawdecode", Cmdmandecoderaw, 1, "Manchester decode binary stream in DemodBuffer"},
2785 {"manmod", CmdManchesterMod, 1, "[clock rate] -- Manchester modulate a binary stream"},
2786 {"norm", CmdNorm, 1, "Normalize max/min to +/-128"},
2787 {"plot", CmdPlot, 1, "Show graph window (hit 'h' in window for keystroke help)"},
2788 {"printdemodbuffer",CmdPrintDemodBuff, 1, "[x] -- print the data in the DemodBuffer - 'x' for hex output"},
2789 {"pskindalademod", CmdIndalaDecode, 1, "[clock] [invert<0|1>] -- Demodulate an indala tag (PSK1) from GraphBuffer (args optional)"},
2790 {"rawdemod", CmdRawDemod, 1, "[modulation] ... <options> -see help (h option) -- Demodulate the data in the GraphBuffer and output binary"},
2791 {"samples", CmdSamples, 0, "[512 - 40000] -- Get raw samples for graph window (GraphBuffer)"},
2792 {"save", CmdSave, 1, "<filename> -- Save trace (from graph window)"},
2793 {"scale", CmdScale, 1, "<int> -- Set cursor display scale"},
2794 {"setdebugmode", CmdSetDebugMode, 1, "<0|1> -- Turn on or off Debugging Mode for demods"},
2795 {"shiftgraphzero", CmdGraphShiftZero, 1, "<shift> -- Shift 0 for Graphed wave + or - shift value"},
2796 //{"threshold", CmdThreshold, 1, "<threshold> -- Maximize/minimize every value in the graph window depending on threshold"},
2797 {"dirthreshold", CmdDirectionalThreshold, 1, "<thres up> <thres down> -- Max rising higher up-thres/ Min falling lower down-thres, keep rest as prev."},
2798 {"tune", CmdTuneSamples, 0, "Get hw tune samples for graph window"},
2799 {"undec", CmdUndec, 1, "Un-decimate samples by 2"},
2800 {"zerocrossings", CmdZerocrossings, 1, "Count time between zero-crossings"},
2801 {NULL, NULL, 0, NULL}
2802 };
2803
2804 int CmdData(const char *Cmd)
2805 {
2806 CmdsParse(CommandTable, Cmd);
2807 return 0;
2808 }
2809
2810 int CmdHelp(const char *Cmd)
2811 {
2812 CmdsHelp(CommandTable);
2813 return 0;
2814 }
Proxmark3 GIT tracking
Impressum, Datenschutz