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
|
#include <u.h>
#include <libc.h>
#include "complete.h"
static int
longestprefixlength(char *a, char *b, int n)
{
int i, w;
Rune ra, rb;
for(i=0; i<n; i+=w){
w = chartorune(&ra, a);
chartorune(&rb, b);
if(ra != rb)
break;
a += w;
b += w;
}
return i;
}
void
freecompletion(Completion *c)
{
if(c){
free(c->filename);
free(c);
}
}
static int
strpcmp(const void *va, const void *vb)
{
char *a, *b;
a = *(char**)va;
b = *(char**)vb;
return strcmp(a, b);
}
Completion*
complete(char *dir, char *s)
{
long i, l, n, nfile, len, nbytes;
int fd, minlen;
Dir *dirp;
char **name, *p;
ulong* mode;
Completion *c;
if(strchr(s, '/') != nil){
werrstr("slash character in name argument to complete()");
return nil;
}
fd = open(dir, OREAD);
if(fd < 0)
return nil;
n = dirreadall(fd, &dirp);
if(n <= 0){
close(fd);
return nil;
}
/* find longest string, for allocation */
len = 0;
for(i=0; i<n; i++){
l = strlen(dirp[i].name) + 1 + 1; /* +1 for / +1 for \0 */
if(l > len)
len = l;
}
name = malloc(n*sizeof(char*));
mode = malloc(n*sizeof(ulong));
c = malloc(sizeof(Completion) + len);
if(name == nil || mode == nil || c == nil)
goto Return;
memset(c, 0, sizeof(Completion));
/* find the matches */
len = strlen(s);
nfile = 0;
minlen = 1000000;
for(i=0; i<n; i++)
if(strncmp(s, dirp[i].name, len) == 0){
name[nfile] = dirp[i].name;
mode[nfile] = dirp[i].mode;
if(minlen > strlen(dirp[i].name))
minlen = strlen(dirp[i].name);
nfile++;
}
if(nfile > 0) {
/* report interesting results */
/* trim length back to longest common initial string */
for(i=1; i<nfile; i++)
minlen = longestprefixlength(name[0], name[i], minlen);
/* build the answer */
c->complete = (nfile == 1);
c->advance = c->complete || (minlen > len);
c->string = (char*)(c+1);
memmove(c->string, name[0]+len, minlen-len);
if(c->complete)
c->string[minlen++ - len] = (mode[0]&DMDIR)? '/' : ' ';
c->string[minlen - len] = '\0';
c->nmatch = nfile;
} else {
/* no match, so return all possible strings */
for(i=0; i<n; i++){
name[i] = dirp[i].name;
mode[i] = dirp[i].mode;
}
nfile = n;
c->nmatch = 0;
}
/* attach list of names */
nbytes = nfile * sizeof(char*);
for(i=0; i<nfile; i++)
nbytes += strlen(name[i]) + 1 + 1;
c->filename = malloc(nbytes);
if(c->filename == nil)
goto Return;
p = (char*)(c->filename + nfile);
for(i=0; i<nfile; i++){
c->filename[i] = p;
strcpy(p, name[i]);
p += strlen(p);
if(mode[i] & DMDIR)
*p++ = '/';
*p++ = '\0';
}
c->nfile = nfile;
qsort(c->filename, c->nfile, sizeof(c->filename[0]), strpcmp);
Return:
free(name);
free(mode);
free(dirp);
close(fd);
return c;
}
|