]> cvs.zerfleddert.de Git - proxmark3-svn/blob - client/cmdlf.c
9a9984d18117275cadff6f8a2bbfebf30edfd328
[proxmark3-svn] / client / cmdlf.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 // Low frequency 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 "graph.h"
18 #include "ui.h"
19 #include "cmdparser.h"
20 #include "cmdmain.h"
21 #include "cmddata.h"
22 #include "cmdlf.h"
23 #include "cmdlfawid26.h"
24 #include "cmdlfhid.h"
25 #include "cmdlfti.h"
26 #include "cmdlfem4x.h"
27 #include "cmdlfhitag.h"
28 #include "cmdlft55xx.h"
29 #include "cmdlfpcf7931.h"
30 #include "cmdlfio.h"
31
32 static int CmdHelp(const char *Cmd);
33
34 /* send a command before reading */
35 int CmdLFCommandRead(const char *Cmd)
36 {
37 static char dummy[3];
38
39 dummy[0]= ' ';
40
41 UsbCommand c = {CMD_MOD_THEN_ACQUIRE_RAW_ADC_SAMPLES_125K};
42 sscanf(Cmd, "%"lli" %"lli" %"lli" %s %s", &c.arg[0], &c.arg[1], &c.arg[2],(char*)(&c.d.asBytes),(char*)(&dummy+1));
43 // in case they specified 'h'
44 strcpy((char *)&c.d.asBytes + strlen((char *)c.d.asBytes), dummy);
45 SendCommand(&c);
46 return 0;
47 }
48
49 int CmdFlexdemod(const char *Cmd)
50 {
51 int i;
52 for (i = 0; i < GraphTraceLen; ++i) {
53 if (GraphBuffer[i] < 0) {
54 GraphBuffer[i] = -1;
55 } else {
56 GraphBuffer[i] = 1;
57 }
58 }
59
60 #define LONG_WAIT 100
61 int start;
62 for (start = 0; start < GraphTraceLen - LONG_WAIT; start++) {
63 int first = GraphBuffer[start];
64 for (i = start; i < start + LONG_WAIT; i++) {
65 if (GraphBuffer[i] != first) {
66 break;
67 }
68 }
69 if (i == (start + LONG_WAIT)) {
70 break;
71 }
72 }
73 if (start == GraphTraceLen - LONG_WAIT) {
74 //PrintAndLog("nothing to wait for");
75 return 0;
76 }
77
78 GraphBuffer[start] = 2;
79 GraphBuffer[start+1] = -2;
80 uint8_t bits[64] = {0x00};
81
82 int bit, sum;
83 i = start;
84 for (bit = 0; bit < 64; bit++) {
85 sum = 0;
86 for (int j = 0; j < 16; j++) {
87 sum += GraphBuffer[i++];
88 }
89
90 bits[bit] = (sum > 0) ? 1 : 0;
91
92 PrintAndLog("bit %d sum %d", bit, sum);
93 }
94
95 for (bit = 0; bit < 64; bit++) {
96 int j;
97 int sum = 0;
98 for (j = 0; j < 16; j++) {
99 sum += GraphBuffer[i++];
100 }
101 if (sum > 0 && bits[bit] != 1) {
102 PrintAndLog("oops1 at %d", bit);
103 }
104 if (sum < 0 && bits[bit] != 0) {
105 PrintAndLog("oops2 at %d", bit);
106 }
107 }
108
109 // HACK writing back to graphbuffer.
110 GraphTraceLen = 32*64;
111 i = 0;
112 int phase = 0;
113 for (bit = 0; bit < 64; bit++) {
114
115 phase = (bits[bit] == 0) ? 0 : 1;
116
117 int j;
118 for (j = 0; j < 32; j++) {
119 GraphBuffer[i++] = phase;
120 phase = !phase;
121 }
122 }
123
124 RepaintGraphWindow();
125 return 0;
126 }
127
128 int CmdIndalaDemod(const char *Cmd)
129 {
130 // Usage: recover 64bit UID by default, specify "224" as arg to recover a 224bit UID
131
132 int state = -1;
133 int count = 0;
134 int i, j;
135
136 // worst case with GraphTraceLen=64000 is < 4096
137 // under normal conditions it's < 2048
138
139 uint8_t rawbits[4096];
140 int rawbit = 0;
141 int worst = 0, worstPos = 0;
142
143 PrintAndLog("Expecting a bit less than %d raw bits", GraphTraceLen / 32);
144
145 for (i = 0; i < GraphTraceLen-1; i += 2) {
146 count += 1;
147 if ((GraphBuffer[i] > GraphBuffer[i + 1]) && (state != 1)) {
148 if (state == 0) {
149 for (j = 0; j < count - 8; j += 16) {
150 rawbits[rawbit++] = 0;
151 }
152 if ((abs(count - j)) > worst) {
153 worst = abs(count - j);
154 worstPos = i;
155 }
156 }
157 state = 1;
158 count = 0;
159 } else if ((GraphBuffer[i] < GraphBuffer[i + 1]) && (state != 0)) {
160 if (state == 1) {
161 for (j = 0; j < count - 8; j += 16) {
162 rawbits[rawbit++] = 1;
163 }
164 if ((abs(count - j)) > worst) {
165 worst = abs(count - j);
166 worstPos = i;
167 }
168 }
169 state = 0;
170 count = 0;
171 }
172 }
173
174 if (rawbit>0){
175 PrintAndLog("Recovered %d raw bits, expected: %d", rawbit, GraphTraceLen/32);
176 PrintAndLog("worst metric (0=best..7=worst): %d at pos %d", worst, worstPos);
177 } else {
178 return 0;
179 }
180
181 // Finding the start of a UID
182 int uidlen, long_wait;
183 if (strcmp(Cmd, "224") == 0) {
184 uidlen = 224;
185 long_wait = 30;
186 } else {
187 uidlen = 64;
188 long_wait = 29;
189 }
190
191 int start;
192 int first = 0;
193 for (start = 0; start <= rawbit - uidlen; start++) {
194 first = rawbits[start];
195 for (i = start; i < start + long_wait; i++) {
196 if (rawbits[i] != first) {
197 break;
198 }
199 }
200 if (i == (start + long_wait)) {
201 break;
202 }
203 }
204
205 if (start == rawbit - uidlen + 1) {
206 //PrintAndLog("nothing to wait for");
207 return 0;
208 }
209
210 // Inverting signal if needed
211 if (first == 1) {
212 for (i = start; i < rawbit; i++) {
213 rawbits[i] = !rawbits[i];
214 }
215 }
216
217 // Dumping UID
218 uint8_t bits[224] = {0x00};
219 char showbits[225] = {0x00};
220 int bit;
221 i = start;
222 int times = 0;
223
224 if (uidlen > rawbit) {
225 PrintAndLog("Warning: not enough raw bits to get a full UID");
226 for (bit = 0; bit < rawbit; bit++) {
227 bits[bit] = rawbits[i++];
228 // As we cannot know the parity, let's use "." and "/"
229 showbits[bit] = '.' + bits[bit];
230 }
231 showbits[bit+1]='\0';
232 PrintAndLog("Partial UID=%s", showbits);
233 return 0;
234 } else {
235 for (bit = 0; bit < uidlen; bit++) {
236 bits[bit] = rawbits[i++];
237 showbits[bit] = '0' + bits[bit];
238 }
239 times = 1;
240 }
241
242 //convert UID to HEX
243 uint32_t uid1, uid2, uid3, uid4, uid5, uid6, uid7;
244 int idx;
245 uid1 = uid2 = 0;
246
247 if (uidlen == 64){
248 for( idx=0; idx<64; idx++) {
249 if (showbits[idx] == '0') {
250 uid1 = (uid1<<1) | (uid2>>31);
251 uid2 = (uid2<<1) | 0;
252 } else {
253 uid1 = (uid1<<1) | (uid2>>31);
254 uid2 = (uid2<<1) | 1;
255 }
256 }
257 PrintAndLog("UID=%s (%x%08x)", showbits, uid1, uid2);
258 }
259 else {
260 uid3 = uid4 = uid5 = uid6 = uid7 = 0;
261
262 for( idx=0; idx<224; idx++) {
263 uid1 = (uid1<<1) | (uid2>>31);
264 uid2 = (uid2<<1) | (uid3>>31);
265 uid3 = (uid3<<1) | (uid4>>31);
266 uid4 = (uid4<<1) | (uid5>>31);
267 uid5 = (uid5<<1) | (uid6>>31);
268 uid6 = (uid6<<1) | (uid7>>31);
269
270 if (showbits[idx] == '0')
271 uid7 = (uid7<<1) | 0;
272 else
273 uid7 = (uid7<<1) | 1;
274 }
275 PrintAndLog("UID=%s (%x%08x%08x%08x%08x%08x%08x)", showbits, uid1, uid2, uid3, uid4, uid5, uid6, uid7);
276 }
277
278 // Checking UID against next occurrences
279 int failed = 0;
280 for (; i + uidlen <= rawbit;) {
281 failed = 0;
282 for (bit = 0; bit < uidlen; bit++) {
283 if (bits[bit] != rawbits[i++]) {
284 failed = 1;
285 break;
286 }
287 }
288 if (failed == 1) {
289 break;
290 }
291 times += 1;
292 }
293
294 PrintAndLog("Occurrences: %d (expected %d)", times, (rawbit - start) / uidlen);
295
296 // Remodulating for tag cloning
297 // HACK: 2015-01-04 this will have an impact on our new way of seening lf commands (demod)
298 // since this changes graphbuffer data.
299 GraphTraceLen = 32 * uidlen;
300 i = 0;
301 int phase = 0;
302 for (bit = 0; bit < uidlen; bit++) {
303 if (bits[bit] == 0) {
304 phase = 0;
305 } else {
306 phase = 1;
307 }
308 int j;
309 for (j = 0; j < 32; j++) {
310 GraphBuffer[i++] = phase;
311 phase = !phase;
312 }
313 }
314
315 RepaintGraphWindow();
316 return 1;
317 }
318
319 int CmdIndalaClone(const char *Cmd)
320 {
321 UsbCommand c;
322 unsigned int uid1, uid2, uid3, uid4, uid5, uid6, uid7;
323
324 uid1 = uid2 = uid3 = uid4 = uid5 = uid6 = uid7 = 0;
325 int n = 0, i = 0;
326
327 if (strchr(Cmd,'l') != 0) {
328 while (sscanf(&Cmd[i++], "%1x", &n ) == 1) {
329 uid1 = (uid1 << 4) | (uid2 >> 28);
330 uid2 = (uid2 << 4) | (uid3 >> 28);
331 uid3 = (uid3 << 4) | (uid4 >> 28);
332 uid4 = (uid4 << 4) | (uid5 >> 28);
333 uid5 = (uid5 << 4) | (uid6 >> 28);
334 uid6 = (uid6 << 4) | (uid7 >> 28);
335 uid7 = (uid7 << 4) | (n & 0xf);
336 }
337 PrintAndLog("Cloning 224bit tag with UID %x%08x%08x%08x%08x%08x%08x", uid1, uid2, uid3, uid4, uid5, uid6, uid7);
338 c.cmd = CMD_INDALA_CLONE_TAG_L;
339 c.d.asDwords[0] = uid1;
340 c.d.asDwords[1] = uid2;
341 c.d.asDwords[2] = uid3;
342 c.d.asDwords[3] = uid4;
343 c.d.asDwords[4] = uid5;
344 c.d.asDwords[5] = uid6;
345 c.d.asDwords[6] = uid7;
346 } else {
347 while (sscanf(&Cmd[i++], "%1x", &n ) == 1) {
348 uid1 = (uid1 << 4) | (uid2 >> 28);
349 uid2 = (uid2 << 4) | (n & 0xf);
350 }
351 PrintAndLog("Cloning 64bit tag with UID %x%08x", uid1, uid2);
352 c.cmd = CMD_INDALA_CLONE_TAG;
353 c.arg[0] = uid1;
354 c.arg[1] = uid2;
355 }
356
357 SendCommand(&c);
358 return 0;
359 }
360
361 int CmdLFRead(const char *Cmd)
362 {
363 UsbCommand c = {CMD_ACQUIRE_RAW_ADC_SAMPLES_125K};
364
365 // 'h' means higher-low-frequency, 134 kHz
366 if(*Cmd == 'h') {
367 c.arg[0] = 1;
368 } else if (*Cmd == '\0') {
369 c.arg[0] = 0;
370 } else if (sscanf(Cmd, "%"lli, &c.arg[0]) != 1) {
371 PrintAndLog("Samples 1: 'lf read'");
372 PrintAndLog(" 2: 'lf read h'");
373 PrintAndLog(" 3: 'lf read <divisor>'");
374 return 0;
375 }
376 SendCommand(&c);
377 WaitForResponse(CMD_ACK,NULL);
378
379 CmdSamples("");
380 ShowGraphWindow();
381 return 0;
382 }
383
384 static void ChkBitstream(const char *str)
385 {
386 int i;
387
388 /* convert to bitstream if necessary */
389 for (i = 0; i < (int)(GraphTraceLen / 2); i++){
390 if (GraphBuffer[i] > 1 || GraphBuffer[i] < 0) {
391 CmdBitstream(str);
392 break;
393 }
394 }
395 }
396
397 int CmdLFSim(const char *Cmd)
398 {
399 int i,j;
400 static int gap;
401
402 sscanf(Cmd, "%i", &gap);
403
404 /* convert to bitstream if necessary */
405 ChkBitstream(Cmd);
406
407 printf("Sending [%d bytes]", GraphTraceLen);
408 for (i = 0; i < GraphTraceLen; i += USB_CMD_DATA_SIZE) {
409 UsbCommand c={CMD_DOWNLOADED_SIM_SAMPLES_125K, {i, 0, 0}};
410
411 for (j = 0; j < USB_CMD_DATA_SIZE; j++) {
412 c.d.asBytes[j] = GraphBuffer[i+j];
413 }
414 SendCommand(&c);
415 WaitForResponse(CMD_ACK,NULL);
416 printf(".");
417 }
418
419 printf("\n");
420 PrintAndLog("Starting to simulate");
421 UsbCommand c = {CMD_SIMULATE_TAG_125K, {GraphTraceLen, gap, 0}};
422 SendCommand(&c);
423 return 0;
424 }
425
426 int CmdLFSimBidir(const char *Cmd)
427 {
428 // Set ADC to twice the carrier for a slight supersampling
429 // HACK: not implemented in ARMSRC.
430 PrintAndLog("Not implemented yet.");
431 UsbCommand c = {CMD_LF_SIMULATE_BIDIR, {47, 384, 0}};
432 SendCommand(&c);
433 return 0;
434 }
435
436 /* simulate an LF Manchester encoded tag with specified bitstream, clock rate and inter-id gap */
437 int CmdLFSimManchester(const char *Cmd)
438 {
439 static int clock, gap;
440 static char data[1024], gapstring[8];
441
442 sscanf(Cmd, "%i %s %i", &clock, &data[0], &gap);
443
444 ClearGraph(0);
445
446 for (int i = 0; i < strlen(data) ; ++i)
447 AppendGraph(0, clock, data[i]- '0');
448
449 CmdManchesterMod("");
450
451 RepaintGraphWindow();
452
453 sprintf(&gapstring[0], "%i", gap);
454 CmdLFSim(gapstring);
455 return 0;
456 }
457
458 int CmdLFSnoop(const char *Cmd)
459 {
460 UsbCommand c = {CMD_LF_SNOOP_RAW_ADC_SAMPLES};
461
462 // 'h' means higher-low-frequency, 134 kHz
463 c.arg[0] = 0;
464 c.arg[1] = -1;
465
466 if (*Cmd == 'l') {
467 sscanf(Cmd, "l %"lli, &c.arg[1]);
468 } else if (*Cmd == 'h') {
469 c.arg[0] = 1;
470 sscanf(Cmd, "h %"lli, &c.arg[1]);
471 } else if (sscanf(Cmd, "%"lli" %"lli, &c.arg[0], &c.arg[1]) < 1) {
472 PrintAndLog("usage 1: snoop");
473 PrintAndLog(" 2: snoop {l,h} [trigger threshold]");
474 PrintAndLog(" 3: snoop <divisor> [trigger threshold]");
475 return 0;
476 }
477
478 SendCommand(&c);
479 WaitForResponse(CMD_ACK,NULL);
480
481 #define BUFF_SIZE 8000
482 uint8_t data[BUFF_SIZE] = {0x00};
483
484 GetFromBigBuf(data,BUFF_SIZE,0);
485 WaitForResponseTimeout(CMD_ACK,NULL, 1500);
486
487 SetGraphBuf(data, BUFF_SIZE);
488
489 return 0;
490 }
491
492 int CmdVchDemod(const char *Cmd)
493 {
494 // Is this the entire sync pattern, or does this also include some
495 // data bits that happen to be the same everywhere? That would be
496 // lovely to know.
497 static const int SyncPattern[] = {
498 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
499 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
500 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
501 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
502 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
503 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
504 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
505 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
506 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
507 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
508 };
509
510 // So first, we correlate for the sync pattern, and mark that.
511 int bestCorrel = 0, bestPos = 0;
512 int i;
513 // It does us no good to find the sync pattern, with fewer than
514 // 2048 samples after it...
515 for (i = 0; i < (GraphTraceLen-2048); i++) {
516 int sum = 0;
517 int j;
518 for (j = 0; j < arraylen(SyncPattern); j++) {
519 sum += GraphBuffer[i+j]*SyncPattern[j];
520 }
521 if (sum > bestCorrel) {
522 bestCorrel = sum;
523 bestPos = i;
524 }
525 }
526 PrintAndLog("best sync at %d [metric %d]", bestPos, bestCorrel);
527
528 char bits[257];
529 bits[256] = '\0';
530
531 int worst = INT_MAX;
532 int worstPos = 0;
533
534 for (i = 0; i < 2048; i += 8) {
535 int sum = 0;
536 int j;
537 for (j = 0; j < 8; j++) {
538 sum += GraphBuffer[bestPos+i+j];
539 }
540 if (sum < 0) {
541 bits[i/8] = '.';
542 } else {
543 bits[i/8] = '1';
544 }
545 if(abs(sum) < worst) {
546 worst = abs(sum);
547 worstPos = i;
548 }
549 }
550 PrintAndLog("bits:");
551 PrintAndLog("%s", bits);
552 PrintAndLog("worst metric: %d at pos %d", worst, worstPos);
553
554 if (strcmp(Cmd, "clone")==0) {
555 GraphTraceLen = 0;
556 char *s;
557 for(s = bits; *s; s++) {
558 int j;
559 for(j = 0; j < 16; j++) {
560 GraphBuffer[GraphTraceLen++] = (*s == '1') ? 1 : 0;
561 }
562 }
563 RepaintGraphWindow();
564 }
565 return 0;
566 }
567
568 //by marshmellow
569 int CmdLFfind(const char *Cmd)
570 {
571 int ans = 0;
572 char cmdp = param_getchar(Cmd, 0);
573
574 if (strlen(Cmd) > 1 || cmdp == 'h' || cmdp == 'H') {
575 PrintAndLog("Usage: lf search <0|1>");
576 PrintAndLog(" <use data from Graphbuffer>, if not set, try reading data from tag.");
577 PrintAndLog("");
578 PrintAndLog(" sample: lf search");
579 PrintAndLog(" : lf search 1");
580 return 0;
581 }
582
583 if (!offline || (cmdp != '1') ){
584 ans = CmdLFRead("");
585 } else if (GraphTraceLen < 1000) {
586 PrintAndLog("Data in Graphbuffer was too small.");
587 return 0;
588 }
589
590 PrintAndLog("Checking for known tags:");
591
592 ans = Cmdaskmandemod("");
593 PrintAndLog("ASK_MAN: %s", (ans) ? "YES":"NO" );
594
595 ans = CmdFSKdemodHID("");
596 PrintAndLog("HID: %s", (ans) ? "YES":"NO" );
597
598 ans = CmdFSKdemodIO("");
599 PrintAndLog("IO prox: %s", (ans) ? "YES":"NO" );
600
601 ans = CmdIndalaDemod("");
602 PrintAndLog("Indala (64): %s", (ans) ? "YES":"NO" );
603
604 ans = CmdIndalaDemod("224");
605 PrintAndLog("Indala (224): %s", (ans) ? "YES":"NO" );
606
607 // ans = CmdVchDemod("");
608 // PrintAndLog("VeriChip: %s", (ans) ? "YES":"NO" );
609
610 // ans = CmdFlexdemod("");
611 // PrintAndLog("FlexPass: %s", (ans) ? "YES":"NO" );
612
613 if (!ans)
614 PrintAndLog("No Known Tags Found!\n");
615
616 return 0;
617 }
618
619 static command_t CommandTable[] =
620 {
621 {"help", CmdHelp, 1, "This help"},
622 {"cmdread", CmdLFCommandRead, 0, "<off period> <'0' period> <'1' period> <command> ['h'] -- Modulate LF reader field to send command before read (all periods in microseconds) (option 'h' for 134)"},
623
624 {"flexdemod", CmdFlexdemod, 1, "Demodulate samples for FlexPass"},
625 {"indalademod", CmdIndalaDemod, 1, "['224'] -- Demodulate samples for Indala 64 bit UID (option '224' for 224 bit)"},
626 {"indalaclone", CmdIndalaClone, 0, "<UID> ['l']-- Clone Indala to T55x7 (UID in HEX)(option 'l' for 224 UID"},
627 {"vchdemod", CmdVchDemod, 1, "['clone'] -- Demodulate samples for VeriChip"},
628
629
630 {"read", CmdLFRead, 0, "['h' or <divisor>] -- Read 125/134 kHz LF ID-only tag (option 'h' for 134, alternatively: f=12MHz/(divisor+1))"},
631 {"search", CmdLFfind, 1, "Read and Search for valid known tag (in offline mode it you can load first then search)"},
632 {"sim", CmdLFSim, 0, "[GAP] -- Simulate LF tag from buffer with optional GAP (in microseconds)"},
633 {"simbidir", CmdLFSimBidir, 0, "Simulate LF tag (with bidirectional data transmission between reader and tag)"},
634 {"simman", CmdLFSimManchester, 0, "<Clock> <Bitstream> [GAP] Simulate arbitrary Manchester LF tag"},
635 {"snoop", CmdLFSnoop, 0, "['l'|'h'|<divisor>] [trigger threshold]-- Snoop LF (l:125khz, h:134khz)"},
636
637 {"awid26", CmdLFAWID26, 1, "{ AWID26 tags }"},
638 {"em4x", CmdLFEM4X, 1, "{ EM4X tags }"},
639 {"hid", CmdLFHID, 1, "{ HID tags }"},
640 {"hitag", CmdLFHitag, 1, "{ Hitag tags and transponders }"},
641 {"io", CmdLFIO, 1, "{ ioProx tags }"},
642 {"pcf7931", CmdLFPCF7931, 1, "{ PCF7931 tags }"},
643 {"ti", CmdLFTI, 1, "{ TI tags }"},
644 {"t55xx", CmdLFT55XX, 1, "{ T55xx tags }"},
645
646 {NULL, NULL, 0, NULL}
647 };
648
649 int CmdLF(const char *Cmd)
650 {
651 CmdsParse(CommandTable, Cmd);
652 return 0;
653 }
654
655 int CmdHelp(const char *Cmd)
656 {
657 CmdsHelp(CommandTable);
658 return 0;
659 }
Impressum, Datenschutz