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