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