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