1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
|
/*
* Copyright (c) 1995, 1996, 1997, 1998 Kungliga Tekniska Högskolan
* (Royal Institute of Technology, Stockholm, Sweden).
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* 3. Neither the name of the Institute nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
RCSID("$Id: sl.c,v 1.25 1999/12/02 16:58:55 joda Exp $");
#endif
#include "sl_locl.h"
static SL_cmd *
sl_match (SL_cmd *cmds, char *cmd, int exactp)
{
SL_cmd *c, *current = NULL, *partial_cmd = NULL;
int partial_match = 0;
for (c = cmds; c->name; ++c) {
if (c->func)
current = c;
if (strcmp (cmd, c->name) == 0)
return current;
else if (strncmp (cmd, c->name, strlen(cmd)) == 0 &&
partial_cmd != current) {
++partial_match;
partial_cmd = current;
}
}
if (partial_match == 1 && !exactp)
return partial_cmd;
else
return NULL;
}
void
sl_help (SL_cmd *cmds, int argc, char **argv)
{
SL_cmd *c, *prev_c;
if (argc == 1) {
prev_c = NULL;
for (c = cmds; c->name; ++c) {
if (c->func) {
if(prev_c)
printf ("\n\t%s%s", prev_c->usage ? prev_c->usage : "",
prev_c->usage ? "\n" : "");
prev_c = c;
printf ("%s", c->name);
} else
printf (", %s", c->name);
}
if(prev_c)
printf ("\n\t%s%s", prev_c->usage ? prev_c->usage : "",
prev_c->usage ? "\n" : "");
} else {
c = sl_match (cmds, argv[1], 0);
if (c == NULL)
printf ("No such command: %s. "
"Try \"help\" for a list of all commands\n",
argv[1]);
else {
printf ("%s\t%s\n", c->name, c->usage);
if(c->help && *c->help)
printf ("%s\n", c->help);
if((++c)->name && c->func == NULL) {
printf ("Synonyms:");
while (c->name && c->func == NULL)
printf ("\t%s", (c++)->name);
printf ("\n");
}
}
}
}
#ifdef HAVE_READLINE
char *readline(char *prompt);
void add_history(char *p);
#else
static char *
readline(char *prompt)
{
char buf[BUFSIZ];
printf ("%s", prompt);
fflush (stdout);
if(fgets(buf, sizeof(buf), stdin) == NULL)
return NULL;
if (buf[strlen(buf) - 1] == '\n')
buf[strlen(buf) - 1] = '\0';
return strdup(buf);
}
static void
add_history(char *p)
{
}
#endif
int
sl_command(SL_cmd *cmds, int argc, char **argv)
{
SL_cmd *c;
c = sl_match (cmds, argv[0], 0);
if (c == NULL)
return -1;
return (*c->func)(argc, argv);
}
struct sl_data {
int max_count;
char **ptr;
};
int
sl_make_argv(char *line, int *ret_argc, char ***ret_argv)
{
char *foo = NULL;
char *p;
int argc, nargv;
char **argv;
nargv = 10;
argv = malloc(nargv * sizeof(*argv));
if(argv == NULL)
return ENOMEM;
argc = 0;
for(p = strtok_r (line, " \t", &foo);
p;
p = strtok_r (NULL, " \t", &foo)) {
if(argc == nargv - 1) {
char **tmp;
nargv *= 2;
tmp = realloc (argv, nargv * sizeof(*argv));
if (tmp == NULL) {
free(argv);
return ENOMEM;
}
argv = tmp;
}
argv[argc++] = p;
}
argv[argc] = NULL;
*ret_argc = argc;
*ret_argv = argv;
return 0;
}
/* return values: 0 on success, -1 on fatal error, or return value of command */
int
sl_command_loop(SL_cmd *cmds, char *prompt, void **data)
{
int ret = 0;
char *buf;
int argc;
char **argv;
ret = 0;
buf = readline(prompt);
if(buf == NULL)
return 1;
if(*buf)
add_history(buf);
ret = sl_make_argv(buf, &argc, &argv);
if(ret) {
fprintf(stderr, "sl_loop: out of memory\n");
free(buf);
return -1;
}
if (argc >= 1) {
ret = sl_command(cmds, argc, argv);
if(ret == -1) {
printf ("Unrecognized command: %s\n", argv[0]);
ret = 0;
}
}
free(buf);
free(argv);
return ret;
}
int
sl_loop(SL_cmd *cmds, char *prompt)
{
void *data = NULL;
int ret;
while((ret = sl_command_loop(cmds, prompt, &data)) == 0)
;
return ret;
}
|
