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