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