bk: 41c2a6b7Da4FeGSbCoXOLINwoncCsg
if (*(xcp->keyword) != '?')
list[words++] = xcp->keyword;
}
- for (xcp = opcmds; xcp->keyword != 0; xcp++)
- cmdsort[n++] = xcp->keyword;
+ for (xcp = opcmds; xcp->keyword != 0; xcp++)
+ list[words++] = xcp->keyword;
qsort(
#ifdef QSORT_USES_VOID_P
FILE *fp
)
{
- int i;
- int n;
struct xcmd *xcp;
char *cmd;
const char *list[100];
list[words++] = xcp->keyword;
}
for (xcp = opcmds; xcp->keyword != 0; xcp++)
- cmdsort[n++] = xcp->keyword;
+ list[words++] = xcp->keyword;
qsort(
#ifdef QSORT_USES_VOID_P
(void) fprintf(stderr,
"Command `%s' is unknown\n", cmd);
return;
- } else if (n >= 2) {
+ } else if (words >= 2) {
(void) fprintf(stderr,
"Command `%s' is ambiguous\n", cmd);
return;