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
|
/*
* complete.c - functions for TAB completion
*
* Copyright (c) 2008 Sascha Hauer <s.hauer@pengutronix.de>, Pengutronix
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License version 2
* as published by the Free Software Foundation.
*
* This program 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, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#include <common.h>
#include <complete.h>
#include <xfuncs.h>
#include <linux/list.h>
#include <malloc.h>
#include <fs.h>
#include <linux/stat.h>
#include <libgen.h>
#include <command.h>
#include <stringlist.h>
#include <environment.h>
static int file_complete(struct string_list *sl, char *instr)
{
char *path = strdup(instr);
struct stat s;
DIR *dir;
struct dirent *d;
char tmp[PATH_MAX];
char *base, *dirn;
base = basename(instr);
dirn = dirname(path);
dir = opendir(dirn);
if (!dir)
goto out;
while ((d = readdir(dir))) {
if (!strcmp(d->d_name, ".") || !strcmp(d->d_name, ".."))
continue;
if (!strncmp(base, d->d_name, strlen(base))) {
strcpy(tmp, instr);
strcat(tmp, d->d_name + strlen(base));
if (!stat(tmp, &s) && S_ISDIR(s.st_mode))
strcat(tmp, "/");
else
strcat(tmp, " ");
string_list_add_sorted(sl, tmp);
}
}
closedir(dir);
out:
free(path);
return 0;
}
static int path_command_complete(struct string_list *sl, char *instr)
{
struct stat s;
DIR *dir;
struct dirent *d;
char tmp[PATH_MAX];
char *path, *p, *n;
p = path = strdup(getenv("PATH"));
if (!path)
return -1;
while (p) {
n = strchr(p, ':');
if (n)
*n++ = '\0';
if (*p == '\0') {
p = n;
continue;
}
dir = opendir(p);
/* We need to check all PATH dirs, so if one failed,
* try next */
if (!dir) {
p = n;
continue;
}
while ((d = readdir(dir))) {
if (!strcmp(d->d_name, ".") ||
!strcmp(d->d_name, ".."))
continue;
if (!strncmp(instr, d->d_name, strlen(instr))) {
strcpy(tmp, d->d_name);
if (!stat(tmp, &s) &&
S_ISDIR(s.st_mode))
continue;
else
strcat(tmp, " ");
/* This function is called
* after command_complete,
* so we check if a double
* entry exist */
if (string_list_contains
(sl, tmp) == 0) {
string_list_add_sorted(sl, tmp);
}
}
}
closedir(dir);
p = n;
}
free(path);
return 0;
}
static int command_complete(struct string_list *sl, char *instr)
{
struct command *cmdtp;
char cmd[128];
for_each_command(cmdtp) {
if (!strncmp(instr, cmdtp->name, strlen(instr))) {
strcpy(cmd, cmdtp->name);
cmd[strlen(cmdtp->name)] = ' ';
cmd[strlen(cmdtp->name) + 1] = 0;
string_list_add(sl, cmd);
}
}
return 0;
}
static int tab_pressed = 0;
void complete_reset(void)
{
tab_pressed = 0;
}
int complete(char *instr, char **outstr)
{
struct string_list sl, *entry, *first_entry;
int pos;
char ch;
int changed;
static char out[256];
int outpos = 0;
int reprint = 0;
char *t;
string_list_init(&sl);
/* advance to the last command */
t = strrchr(instr, ';');
if (!t)
t = instr;
else
t++;
while (*t == ' ')
t++;
instr = t;
/* get the completion possibilities */
if ((t = strrchr(t, ' '))) {
t++;
file_complete(&sl, t);
instr = t;
} else {
command_complete(&sl, instr);
path_command_complete(&sl, instr);
}
pos = strlen(instr);
*outstr = "";
if (list_empty(&sl.list))
return reprint;
out[0] = 0;
first_entry = list_first_entry(&sl.list, struct string_list, list);
while (1) {
entry = first_entry;
ch = entry->str[pos];
if (!ch)
break;
changed = 0;
list_for_each_entry(entry, &sl.list, list) {
if (!entry->str[pos])
break;
if (ch != entry->str[pos]) {
changed = 1;
break;
}
}
if (changed)
break;
out[outpos++] = ch;
pos++;
}
if (!list_is_last(&first_entry->list, &sl.list) && !outpos && tab_pressed) {
printf("\n");
string_list_print_by_column(&sl);
reprint = 1;
}
out[outpos++] = 0;
*outstr = out;
if (*out == 0)
tab_pressed = 1;
else
tab_pressed = 0;
string_list_free(&sl);
return reprint;
}
|
