apropos.c revision 1.22 1 1.22 agc /* $NetBSD: apropos.c,v 1.22 2003/08/07 11:13:08 agc Exp $ */
2 1.3 glass
3 1.1 cgd /*
4 1.2 glass * Copyright (c) 1987, 1993, 1994
5 1.1 cgd * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.22 agc * 3. Neither the name of the University nor the names of its contributors
16 1.1 cgd * may be used to endorse or promote products derived from this software
17 1.1 cgd * without specific prior written permission.
18 1.1 cgd *
19 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 1.1 cgd * SUCH DAMAGE.
30 1.1 cgd */
31 1.1 cgd
32 1.8 mikel #include <sys/cdefs.h>
33 1.8 mikel
34 1.1 cgd #ifndef lint
35 1.8 mikel __COPYRIGHT("@(#) Copyright (c) 1987, 1993, 1994\n\
36 1.8 mikel The Regents of the University of California. All rights reserved.\n");
37 1.1 cgd #endif /* not lint */
38 1.1 cgd
39 1.1 cgd #ifndef lint
40 1.3 glass #if 0
41 1.5 tls static char sccsid[] = "@(#)apropos.c 8.8 (Berkeley) 5/4/95";
42 1.3 glass #else
43 1.22 agc __RCSID("$NetBSD: apropos.c,v 1.22 2003/08/07 11:13:08 agc Exp $");
44 1.3 glass #endif
45 1.1 cgd #endif /* not lint */
46 1.1 cgd
47 1.1 cgd #include <sys/param.h>
48 1.1 cgd #include <sys/queue.h>
49 1.1 cgd
50 1.1 cgd #include <ctype.h>
51 1.1 cgd #include <err.h>
52 1.7 mikel #include <glob.h>
53 1.2 glass #include <limits.h>
54 1.1 cgd #include <stdio.h>
55 1.1 cgd #include <stdlib.h>
56 1.1 cgd #include <string.h>
57 1.5 tls #include <unistd.h>
58 1.1 cgd
59 1.21 lukem #include "manconf.h" /* from ../man/ */
60 1.21 lukem #include "pathnames.h" /* from ../man/ */
61 1.1 cgd
62 1.2 glass static int *found, foundman;
63 1.1 cgd
64 1.11 mrg #define MAXLINELEN 8192 /* max line handled */
65 1.11 mrg
66 1.8 mikel int main __P((int, char **));
67 1.2 glass void apropos __P((char **, char *, int));
68 1.2 glass void lowstr __P((char *, char *));
69 1.2 glass int match __P((char *, char *));
70 1.2 glass void usage __P((void));
71 1.1 cgd
72 1.1 cgd int
73 1.1 cgd main(argc, argv)
74 1.1 cgd int argc;
75 1.1 cgd char *argv[];
76 1.1 cgd {
77 1.1 cgd ENTRY *ep;
78 1.1 cgd TAG *tp;
79 1.1 cgd int ch, rv;
80 1.1 cgd char *conffile, **p, *p_augment, *p_path;
81 1.7 mikel glob_t pg;
82 1.1 cgd
83 1.1 cgd conffile = NULL;
84 1.1 cgd p_augment = p_path = NULL;
85 1.8 mikel while ((ch = getopt(argc, argv, "C:M:m:P:")) != -1)
86 1.1 cgd switch (ch) {
87 1.1 cgd case 'C':
88 1.1 cgd conffile = optarg;
89 1.1 cgd break;
90 1.1 cgd case 'M':
91 1.1 cgd case 'P': /* backward compatible */
92 1.1 cgd p_path = optarg;
93 1.1 cgd break;
94 1.1 cgd case 'm':
95 1.1 cgd p_augment = optarg;
96 1.1 cgd break;
97 1.1 cgd case '?':
98 1.1 cgd default:
99 1.1 cgd usage();
100 1.1 cgd }
101 1.1 cgd argv += optind;
102 1.1 cgd argc -= optind;
103 1.1 cgd
104 1.1 cgd if (argc < 1)
105 1.1 cgd usage();
106 1.1 cgd
107 1.1 cgd if ((found = malloc((u_int)argc * sizeof(int))) == NULL)
108 1.8 mikel err(1, "malloc");
109 1.1 cgd memset(found, 0, argc * sizeof(int));
110 1.1 cgd
111 1.1 cgd for (p = argv; *p; ++p) /* convert to lower-case */
112 1.1 cgd lowstr(*p, *p);
113 1.1 cgd
114 1.1 cgd if (p_augment)
115 1.1 cgd apropos(argv, p_augment, 1);
116 1.1 cgd if (p_path || (p_path = getenv("MANPATH")))
117 1.1 cgd apropos(argv, p_path, 1);
118 1.1 cgd else {
119 1.1 cgd config(conffile);
120 1.19 lukem tp = getlist("_whatdb", 1);
121 1.19 lukem TAILQ_FOREACH(ep, &tp->list, q) {
122 1.13 kleink if ((rv = glob(ep->s, GLOB_BRACE | GLOB_NOSORT, NULL,
123 1.13 kleink &pg)) != 0) {
124 1.13 kleink if (rv == GLOB_NOMATCH)
125 1.13 kleink continue;
126 1.13 kleink else
127 1.17 jdolecek err(EXIT_FAILURE, "glob");
128 1.13 kleink }
129 1.10 mikel if (pg.gl_pathc)
130 1.10 mikel for (p = pg.gl_pathv; *p; p++)
131 1.10 mikel apropos(argv, *p, 0);
132 1.7 mikel globfree(&pg);
133 1.7 mikel }
134 1.1 cgd }
135 1.1 cgd
136 1.2 glass if (!foundman)
137 1.2 glass errx(1, "no %s file found", _PATH_WHATIS);
138 1.2 glass
139 1.1 cgd rv = 1;
140 1.1 cgd for (p = argv; *p; ++p)
141 1.1 cgd if (found[p - argv])
142 1.1 cgd rv = 0;
143 1.1 cgd else
144 1.1 cgd (void)printf("%s: nothing appropriate\n", *p);
145 1.1 cgd exit(rv);
146 1.1 cgd }
147 1.1 cgd
148 1.2 glass void
149 1.1 cgd apropos(argv, path, buildpath)
150 1.1 cgd char **argv, *path;
151 1.1 cgd int buildpath;
152 1.1 cgd {
153 1.2 glass char *end, *name, **p;
154 1.11 mrg char buf[MAXLINELEN + 1], wbuf[MAXLINELEN + 1];
155 1.8 mikel char hold[MAXPATHLEN + 1];
156 1.1 cgd
157 1.1 cgd for (name = path; name; name = end) { /* through name list */
158 1.8 mikel if ((end = strchr(name, ':')))
159 1.1 cgd *end++ = '\0';
160 1.1 cgd
161 1.1 cgd if (buildpath) {
162 1.1 cgd (void)sprintf(hold, "%s/%s", name, _PATH_WHATIS);
163 1.1 cgd name = hold;
164 1.1 cgd }
165 1.1 cgd
166 1.1 cgd if (!freopen(name, "r", stdin))
167 1.1 cgd continue;
168 1.1 cgd
169 1.1 cgd foundman = 1;
170 1.1 cgd
171 1.1 cgd /* for each file found */
172 1.1 cgd while (fgets(buf, sizeof(buf), stdin)) {
173 1.2 glass if (!strchr(buf, '\n')) {
174 1.2 glass warnx("%s: line too long", name);
175 1.1 cgd continue;
176 1.1 cgd }
177 1.1 cgd lowstr(buf, wbuf);
178 1.1 cgd for (p = argv; *p; ++p)
179 1.1 cgd if (match(wbuf, *p)) {
180 1.1 cgd (void)printf("%s", buf);
181 1.1 cgd found[p - argv] = 1;
182 1.1 cgd
183 1.1 cgd /* only print line once */
184 1.1 cgd while (*++p)
185 1.1 cgd if (match(wbuf, *p))
186 1.1 cgd found[p - argv] = 1;
187 1.1 cgd break;
188 1.1 cgd }
189 1.1 cgd }
190 1.1 cgd }
191 1.1 cgd }
192 1.1 cgd
193 1.1 cgd /*
194 1.1 cgd * match --
195 1.1 cgd * match anywhere the string appears
196 1.1 cgd */
197 1.2 glass int
198 1.1 cgd match(bp, str)
199 1.2 glass char *bp, *str;
200 1.1 cgd {
201 1.2 glass int len;
202 1.2 glass char test;
203 1.1 cgd
204 1.1 cgd if (!*bp)
205 1.2 glass return (0);
206 1.1 cgd /* backward compatible: everything matches empty string */
207 1.1 cgd if (!*str)
208 1.2 glass return (1);
209 1.1 cgd for (test = *str++, len = strlen(str); *bp;)
210 1.1 cgd if (test == *bp++ && !strncmp(bp, str, len))
211 1.2 glass return (1);
212 1.2 glass return (0);
213 1.1 cgd }
214 1.1 cgd
215 1.1 cgd /*
216 1.1 cgd * lowstr --
217 1.1 cgd * convert a string to lower case
218 1.1 cgd */
219 1.2 glass void
220 1.1 cgd lowstr(from, to)
221 1.2 glass char *from, *to;
222 1.1 cgd {
223 1.2 glass char ch;
224 1.1 cgd
225 1.1 cgd while ((ch = *from++) && ch != '\n')
226 1.14 christos *to++ = isupper((unsigned char)ch) ? tolower(ch) : ch;
227 1.1 cgd *to = '\0';
228 1.1 cgd }
229 1.1 cgd
230 1.1 cgd /*
231 1.1 cgd * usage --
232 1.1 cgd * print usage message and die
233 1.1 cgd */
234 1.2 glass void
235 1.1 cgd usage()
236 1.1 cgd {
237 1.16 cgd
238 1.1 cgd (void)fprintf(stderr,
239 1.14 christos "Usage: %s [-C file] [-M path] [-m path] keyword ...\n",
240 1.16 cgd getprogname());
241 1.1 cgd exit(1);
242 1.1 cgd }
243