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