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
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
|
/*
Copyright (c) 2010 Gluster, Inc. <http://www.gluster.com>
This file is part of GlusterFS.
GlusterFS is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published
by the Free Software Foundation; either version 3 of the License,
or (at your option) any later version.
GlusterFS is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see
<http://www.gnu.org/licenses/>.
*/
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <stdint.h>
#include <pthread.h>
#ifndef _CONFIG_H
#define _CONFIG_H
#include "config.h"
#endif
#include "cli.h"
#include "cli-cmd.h"
#include "cli-mem-types.h"
#include "event.h"
#include <fnmatch.h>
#ifdef HAVE_READLINE
#include <stdio.h>
#include <readline/readline.h>
#include <readline/history.h>
int
cli_rl_out (struct cli_state *state, const char *fmt, va_list ap)
{
int tmp_rl_point = rl_point;
int n = rl_end;
int i = 0;
int ret = 0;
if (rl_end >= 0 ) {
rl_kill_text (0, rl_end);
rl_redisplay ();
}
printf ("\r");
for (i = 0; i <= strlen (state->prompt); i++)
printf (" ");
printf ("\r");
ret = vprintf (fmt, ap);
printf ("\n");
fflush(stdout);
if (n) {
rl_do_undo ();
rl_point = tmp_rl_point;
rl_reset_line_state ();
}
return ret;
}
void
cli_rl_process_line (char *line)
{
struct cli_state *state = NULL;
int ret = 0;
state = global_state;
state->rl_processing = 1;
{
ret = cli_cmd_process_line (state, line);
add_history (line);
}
state->rl_processing = 0;
}
int
cli_rl_stdin (int fd, int idx, void *data,
int poll_out, int poll_in, int poll_err)
{
rl_callback_read_char ();
return 0;
}
char *
cli_rl_autocomplete_entry (const char *text, int times)
{
struct cli_state *state = NULL;
char *retp = NULL;
state = global_state;
if (!state->matchesp)
return NULL;
retp = *state->matchesp;
state->matchesp++;
return retp ? strdup (retp) : NULL;
}
int
cli_rl_token_count (const char *text)
{
int count = 0;
const char *trav = NULL;
int is_spc = 1;
for (trav = text; *trav; trav++) {
if (*trav == ' ') {
is_spc = 1;
} else {
if (is_spc) {
count++;
is_spc = 0;
}
}
}
if (is_spc)
/* what needs to be autocompleted is a full
new word, and not extend the last word
*/
count++;
return count;
}
char **
cli_rl_tokenize (const char *text)
{
int count = 0;
char **tokens = NULL;
char **tokenp = NULL;
char *token = NULL;
char *copy = NULL;
char *saveptr = NULL;
int i = 0;
count = cli_rl_token_count (text);
tokens = calloc (count + 1, sizeof (*tokens));
if (!tokens)
return NULL;
copy = strdup (text);
if (!copy)
goto out;
tokenp = tokens;
for (token = strtok_r (copy, " \t\r\n", &saveptr); token;
token = strtok_r (NULL, " \t\r\n", &saveptr)) {
*tokenp = strdup (token);
if (!*tokenp)
goto out;
tokenp++;
i++;
}
if (i < count) {
/* symoblize that what needs to be autocompleted is
the full set of possible nextwords, and not extend
the last word
*/
*tokenp = strdup ("");
if (!*tokenp)
goto out;
tokenp++;
i++;
}
out:
if (copy)
free (copy);
if (i < count) {
cli_cmd_tokens_destroy (tokens);
tokens = NULL;
}
return tokens;
}
char **
cli_rl_get_matches (struct cli_state *state, struct cli_cmd_word *word,
const char *text)
{
char **matches = NULL;
char **matchesp = NULL;
struct cli_cmd_word **next = NULL;
int count = 0;
int len = 0;
len = strlen (text);
if (!word->nextwords)
return NULL;
for (next = word->nextwords; *next; next++)
count++;
matches = calloc (count + 1, sizeof (*matches));
matchesp = matches;
for (next = word->nextwords; *next; next++) {
if ((*next)->match) {
continue;
}
if (strncmp ((*next)->word, text, len) == 0) {
*matchesp = strdup ((*next)->word);
matchesp++;
}
}
return matches;
}
int
cli_rl_autocomplete_prepare (struct cli_state *state, const char *text)
{
struct cli_cmd_word *word = NULL;
struct cli_cmd_word *next = NULL;
char **tokens = NULL;
char **tokenp = NULL;
char *token = NULL;
char **matches = NULL;
tokens = cli_rl_tokenize (text);
if (!tokens)
return 0;
word = &state->tree.root;
for (tokenp = tokens; (token = *tokenp); tokenp++) {
if (!*(tokenp+1)) {
/* last word */
break;
}
next = cli_cmd_nextword (word, token);
word = next;
if (!word)
break;
}
if (!word)
goto out;
matches = cli_rl_get_matches (state, word, token);
state->matches = matches;
state->matchesp = matches;
out:
cli_cmd_tokens_destroy (tokens);
return 0;
}
int
cli_rl_autocomplete_cleanup (struct cli_state *state)
{
if (state->matches)
cli_cmd_tokens_destroy (state->matches);
state->matches = NULL;
state->matchesp = NULL;
return 0;
}
char **
cli_rl_autocomplete (const char *text, int start, int end)
{
struct cli_state *state = NULL;
char **matches = NULL;
char save = 0;
state = global_state;
/* hack to make the autocompletion code neater */
/* fake it as though the cursor is at the end of line */
save = rl_line_buffer[rl_point];
rl_line_buffer[rl_point] = 0;
cli_rl_autocomplete_prepare (state, rl_line_buffer);
matches = rl_completion_matches (text, cli_rl_autocomplete_entry);
cli_rl_autocomplete_cleanup (state);
rl_line_buffer[rl_point] = save;
return matches;
}
static char *
complete_none (const char *txt, int times)
{
return NULL;
}
int
cli_rl_enable (struct cli_state *state)
{
int ret = 0;
rl_pre_input_hook = NULL;
rl_attempted_completion_function = cli_rl_autocomplete;
rl_completion_entry_function = complete_none;
ret = event_register (state->ctx->event_pool, 0, cli_rl_stdin, state,
1, 0);
if (ret == -1)
goto out;
state->rl_enabled = 1;
rl_callback_handler_install (state->prompt, cli_rl_process_line);
out:
return state->rl_enabled;
}
#else /* HAVE_READLINE */
int
cli_rl_enable (struct cli_state *state)
{
return 0;
}
#endif /* HAVE_READLINE */
|