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