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
|
/* $Header: /src/pub/tcsh/tw.spell.c,v 3.15 2002/03/08 17:36:47 christos Exp $ */
/*
* tw.spell.c: Spell check words
*/
/*-
* Copyright (c) 1980, 1991 The Regents of the University of California.
* 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 University 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 REGENTS 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 REGENTS 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.
*/
#include "sh.h"
RCSID("$Id: tw.spell.c,v 3.15 2002/03/08 17:36:47 christos Exp $")
#include "tw.h"
/* spell_me : return corrrectly spelled filename. From K&P spname */
int
spell_me(oldname, oldsize, looking, pat, suf)
Char *oldname;
int oldsize, looking;
Char *pat;
int suf;
{
/* The +1 is to fool hp's optimizer */
Char guess[FILSIZ + 1], newname[FILSIZ + 1];
register Char *new = newname, *old = oldname;
register Char *p, *cp, *ws;
bool foundslash = 0;
int retval;
for (;;) {
while (*old == '/') { /* skip '/' */
*new++ = *old++;
foundslash = 1;
}
/* do not try to correct spelling of single letter words */
if (*old != '\0' && old[1] == '\0')
*new++ = *old++;
*new = '\0';
if (*old == '\0') {
retval = (StrQcmp(oldname, newname) != 0);
copyn(oldname, newname, oldsize); /* shove it back. */
return retval;
}
p = guess; /* start at beginning of buf */
if (newname[0]) /* add current dir if any */
for (cp = newname; *cp; cp++)
if (p < guess + FILSIZ)
*p++ = *cp;
ws = p;
for (; *old != '/' && *old != '\0'; old++)/* add current file name */
if (p < guess + FILSIZ)
*p++ = *old;
*p = '\0'; /* terminate it */
/*
* Don't tell t_search we're looking for cmd if no '/' in the name so
* far but there are later - or it will look for *all* commands
*/
/* (*should* say "looking for directory" whenever '/' is next...) */
retval = t_search(guess, p, SPELL, FILSIZ,
looking == TW_COMMAND && (foundslash || *old != '/') ?
TW_COMMAND : looking, 1, pat, suf);
if (retval >= 4 || retval < 0)
return -1; /* hopeless */
for (p = ws; (*new = *p++) != '\0'; new++)
continue;
}
/*NOTREACHED*/
#ifdef notdef
return (0); /* lint on the vax under mtXinu complains! */
#endif
}
#define EQ(s,t) (StrQcmp(s,t) == 0)
/*
* spdist() is taken from Kernighan & Pike,
* _The_UNIX_Programming_Environment_
* and adapted somewhat to correspond better to psychological reality.
* (Note the changes to the return values)
*
* According to Pollock and Zamora, CACM April 1984 (V. 27, No. 4),
* page 363, the correct order for this is:
* OMISSION = TRANSPOSITION > INSERTION > SUBSTITUTION
* thus, it was exactly backwards in the old version. -- PWP
*/
int
spdist(s, t)
register Char *s, *t;
{
for (; (*s & TRIM) == (*t & TRIM); t++, s++)
if (*t == '\0')
return 0; /* exact match */
if (*s) {
if (*t) {
if (s[1] && t[1] && (*s & TRIM) == (t[1] & TRIM) &&
(*t & TRIM) == (s[1] & TRIM) && EQ(s + 2, t + 2))
return 1; /* transposition */
if (EQ(s + 1, t + 1))
return 3; /* 1 char mismatch */
}
if (EQ(s + 1, t))
return 2; /* extra character */
}
if (*t && EQ(s, t + 1))
return 1; /* missing character */
return 4;
}
int
spdir(extended_name, tilded_dir, item, name)
Char *extended_name;
Char *tilded_dir;
Char *item;
Char *name;
{
Char path[MAXPATHLEN + 1];
Char *s;
Char oldch;
if (ISDOT(item) || ISDOTDOT(item))
return 0;
for (s = name; *s != 0 && (*s & TRIM) == (*item & TRIM); s++, item++)
continue;
if (*s == 0 || s[1] == 0 || *item != 0)
return 0;
(void) Strcpy(path, tilded_dir);
oldch = *s;
*s = '/';
catn(path, name, (int) (sizeof(path) / sizeof(Char)));
if (access(short2str(path), F_OK) == 0) {
(void) Strcpy(extended_name, name);
return 1;
}
*s = oldch;
return 0;
}
|
