pkill.c revision 1.10 1 1.10 christos /* $NetBSD: pkill.c,v 1.10 2005/07/16 15:53:56 christos Exp $ */
2 1.1 ad
3 1.1 ad /*-
4 1.1 ad * Copyright (c) 2002 The NetBSD Foundation, Inc.
5 1.1 ad * All rights reserved.
6 1.1 ad *
7 1.1 ad * This code is derived from software contributed to The NetBSD Foundation
8 1.1 ad * by Andrew Doran.
9 1.1 ad *
10 1.1 ad * Redistribution and use in source and binary forms, with or without
11 1.1 ad * modification, are permitted provided that the following conditions
12 1.1 ad * are met:
13 1.1 ad * 1. Redistributions of source code must retain the above copyright
14 1.1 ad * notice, this list of conditions and the following disclaimer.
15 1.1 ad * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 ad * notice, this list of conditions and the following disclaimer in the
17 1.1 ad * documentation and/or other materials provided with the distribution.
18 1.1 ad * 3. All advertising materials mentioning features or use of this software
19 1.1 ad * must display the following acknowledgement:
20 1.1 ad * This product includes software developed by the NetBSD
21 1.1 ad * Foundation, Inc. and its contributors.
22 1.1 ad * 4. Neither the name of The NetBSD Foundation nor the names of its
23 1.1 ad * contributors may be used to endorse or promote products derived
24 1.1 ad * from this software without specific prior written permission.
25 1.1 ad *
26 1.1 ad * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
27 1.1 ad * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
28 1.1 ad * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
29 1.1 ad * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
30 1.1 ad * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
31 1.1 ad * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
32 1.1 ad * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
33 1.1 ad * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
34 1.1 ad * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
35 1.1 ad * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
36 1.1 ad * POSSIBILITY OF SUCH DAMAGE.
37 1.1 ad */
38 1.1 ad
39 1.1 ad #include <sys/cdefs.h>
40 1.2 ad #ifndef lint
41 1.10 christos __RCSID("$NetBSD: pkill.c,v 1.10 2005/07/16 15:53:56 christos Exp $");
42 1.2 ad #endif /* !lint */
43 1.1 ad
44 1.1 ad #include <sys/types.h>
45 1.1 ad #include <sys/param.h>
46 1.1 ad #include <sys/sysctl.h>
47 1.1 ad #include <sys/proc.h>
48 1.1 ad #include <sys/queue.h>
49 1.1 ad #include <sys/stat.h>
50 1.1 ad
51 1.1 ad #include <stdio.h>
52 1.1 ad #include <stdlib.h>
53 1.1 ad #include <limits.h>
54 1.1 ad #include <string.h>
55 1.1 ad #include <unistd.h>
56 1.1 ad #include <signal.h>
57 1.1 ad #include <regex.h>
58 1.1 ad #include <ctype.h>
59 1.1 ad #include <kvm.h>
60 1.1 ad #include <err.h>
61 1.1 ad #include <pwd.h>
62 1.1 ad #include <grp.h>
63 1.1 ad #include <errno.h>
64 1.1 ad
65 1.1 ad #define STATUS_MATCH 0
66 1.1 ad #define STATUS_NOMATCH 1
67 1.1 ad #define STATUS_BADUSAGE 2
68 1.1 ad #define STATUS_ERROR 3
69 1.1 ad
70 1.1 ad enum listtype {
71 1.1 ad LT_GENERIC,
72 1.1 ad LT_USER,
73 1.1 ad LT_GROUP,
74 1.1 ad LT_TTY,
75 1.1 ad LT_PGRP,
76 1.1 ad LT_SID
77 1.1 ad };
78 1.1 ad
79 1.1 ad struct list {
80 1.1 ad SLIST_ENTRY(list) li_chain;
81 1.1 ad long li_number;
82 1.1 ad };
83 1.1 ad
84 1.1 ad SLIST_HEAD(listhead, list);
85 1.1 ad
86 1.1 ad struct kinfo_proc2 *plist;
87 1.1 ad char *selected;
88 1.1 ad char *delim = "\n";
89 1.1 ad int nproc;
90 1.1 ad int pgrep;
91 1.1 ad int signum = SIGTERM;
92 1.1 ad int newest;
93 1.1 ad int inverse;
94 1.1 ad int longfmt;
95 1.1 ad int matchargs;
96 1.1 ad int fullmatch;
97 1.9 sketch int cflags = REG_EXTENDED;
98 1.1 ad kvm_t *kd;
99 1.1 ad pid_t mypid;
100 1.1 ad
101 1.1 ad struct listhead euidlist = SLIST_HEAD_INITIALIZER(list);
102 1.1 ad struct listhead ruidlist = SLIST_HEAD_INITIALIZER(list);
103 1.1 ad struct listhead rgidlist = SLIST_HEAD_INITIALIZER(list);
104 1.1 ad struct listhead pgrplist = SLIST_HEAD_INITIALIZER(list);
105 1.1 ad struct listhead ppidlist = SLIST_HEAD_INITIALIZER(list);
106 1.1 ad struct listhead tdevlist = SLIST_HEAD_INITIALIZER(list);
107 1.1 ad struct listhead sidlist = SLIST_HEAD_INITIALIZER(list);
108 1.1 ad
109 1.1 ad int main(int, char **);
110 1.1 ad void usage(void);
111 1.10 christos int killact(struct kinfo_proc2 *);
112 1.10 christos int grepact(struct kinfo_proc2 *);
113 1.1 ad void makelist(struct listhead *, enum listtype, char *);
114 1.1 ad
115 1.1 ad int
116 1.1 ad main(int argc, char **argv)
117 1.1 ad {
118 1.1 ad extern char *optarg;
119 1.1 ad extern int optind;
120 1.3 augustss char buf[_POSIX2_LINE_MAX], *mstr, **pargv, *p, *q;
121 1.1 ad int i, j, ch, bestidx, rv, criteria;
122 1.10 christos int (*action)(struct kinfo_proc2 *);
123 1.1 ad struct kinfo_proc2 *kp;
124 1.1 ad struct list *li;
125 1.1 ad u_int32_t bestsec, bestusec;
126 1.1 ad regex_t reg;
127 1.1 ad regmatch_t regmatch;
128 1.1 ad
129 1.1 ad if (strcmp(getprogname(), "pgrep") == 0) {
130 1.1 ad action = grepact;
131 1.1 ad pgrep = 1;
132 1.1 ad } else {
133 1.1 ad action = killact;
134 1.1 ad p = argv[1];
135 1.1 ad
136 1.3 augustss if (argc > 1 && p[0] == '-') {
137 1.1 ad p++;
138 1.3 augustss i = (int)strtol(p, &q, 10);
139 1.3 augustss if (*q == '\0') {
140 1.1 ad signum = i;
141 1.1 ad argv++;
142 1.3 augustss argc--;
143 1.1 ad } else {
144 1.1 ad if (strncasecmp(p, "sig", 3) == 0)
145 1.1 ad p += 3;
146 1.1 ad for (i = 1; i < NSIG; i++)
147 1.1 ad if (strcasecmp(sys_signame[i], p) == 0)
148 1.1 ad break;
149 1.1 ad if (i != NSIG) {
150 1.1 ad signum = i;
151 1.1 ad argv++;
152 1.3 augustss argc--;
153 1.1 ad }
154 1.1 ad }
155 1.1 ad }
156 1.1 ad }
157 1.1 ad
158 1.1 ad criteria = 0;
159 1.1 ad
160 1.9 sketch while ((ch = getopt(argc, argv, "G:P:U:d:fg:ilns:t:u:vx")) != -1)
161 1.1 ad switch (ch) {
162 1.1 ad case 'G':
163 1.1 ad makelist(&rgidlist, LT_GROUP, optarg);
164 1.1 ad criteria = 1;
165 1.1 ad break;
166 1.1 ad case 'P':
167 1.1 ad makelist(&ppidlist, LT_GENERIC, optarg);
168 1.1 ad criteria = 1;
169 1.1 ad break;
170 1.1 ad case 'U':
171 1.1 ad makelist(&ruidlist, LT_USER, optarg);
172 1.1 ad criteria = 1;
173 1.1 ad break;
174 1.1 ad case 'd':
175 1.1 ad if (!pgrep)
176 1.1 ad usage();
177 1.1 ad delim = optarg;
178 1.1 ad break;
179 1.1 ad case 'f':
180 1.1 ad matchargs = 1;
181 1.1 ad break;
182 1.1 ad case 'g':
183 1.1 ad makelist(&pgrplist, LT_PGRP, optarg);
184 1.1 ad criteria = 1;
185 1.1 ad break;
186 1.9 sketch case 'i':
187 1.9 sketch cflags |= REG_ICASE;
188 1.9 sketch break;
189 1.1 ad case 'l':
190 1.1 ad if (!pgrep)
191 1.1 ad usage();
192 1.1 ad longfmt = 1;
193 1.1 ad break;
194 1.1 ad case 'n':
195 1.1 ad newest = 1;
196 1.1 ad criteria = 1;
197 1.1 ad break;
198 1.1 ad case 's':
199 1.1 ad makelist(&sidlist, LT_SID, optarg);
200 1.1 ad criteria = 1;
201 1.1 ad break;
202 1.1 ad case 't':
203 1.1 ad makelist(&tdevlist, LT_TTY, optarg);
204 1.1 ad criteria = 1;
205 1.1 ad break;
206 1.1 ad case 'u':
207 1.1 ad makelist(&euidlist, LT_USER, optarg);
208 1.1 ad criteria = 1;
209 1.1 ad break;
210 1.1 ad case 'v':
211 1.1 ad inverse = 1;
212 1.1 ad break;
213 1.1 ad case 'x':
214 1.1 ad fullmatch = 1;
215 1.1 ad break;
216 1.1 ad default:
217 1.1 ad usage();
218 1.1 ad /* NOTREACHED */
219 1.1 ad }
220 1.1 ad
221 1.1 ad argc -= optind;
222 1.1 ad argv += optind;
223 1.1 ad if (argc != 0)
224 1.1 ad criteria = 1;
225 1.1 ad if (!criteria)
226 1.1 ad usage();
227 1.1 ad
228 1.1 ad mypid = getpid();
229 1.1 ad
230 1.1 ad /*
231 1.1 ad * Retrieve the list of running processes from the kernel.
232 1.1 ad */
233 1.1 ad kd = kvm_openfiles(NULL, NULL, NULL, KVM_NO_FILES, buf);
234 1.1 ad if (kd == NULL)
235 1.1 ad errx(STATUS_ERROR, "kvm_openfiles(): %s", buf);
236 1.1 ad
237 1.1 ad plist = kvm_getproc2(kd, KERN_PROC_ALL, 0, sizeof(*plist), &nproc);
238 1.1 ad if (plist == NULL)
239 1.6 itojun errx(STATUS_ERROR, "kvm_getproc2() failed");
240 1.1 ad
241 1.1 ad /*
242 1.1 ad * Allocate memory which will be used to keep track of the
243 1.1 ad * selection.
244 1.1 ad */
245 1.1 ad if ((selected = malloc(nproc)) == NULL)
246 1.1 ad errx(STATUS_ERROR, "memory allocation failure");
247 1.1 ad memset(selected, 0, nproc);
248 1.1 ad
249 1.1 ad /*
250 1.1 ad * Refine the selection.
251 1.1 ad */
252 1.1 ad for (; *argv != NULL; argv++) {
253 1.9 sketch if ((rv = regcomp(®, *argv, cflags)) != 0) {
254 1.1 ad regerror(rv, ®, buf, sizeof(buf));
255 1.1 ad errx(STATUS_BADUSAGE, "bad expression: %s", buf);
256 1.1 ad }
257 1.1 ad
258 1.1 ad for (i = 0, kp = plist; i < nproc; i++, kp++) {
259 1.6 itojun if ((kp->p_flag & P_SYSTEM) != 0 || kp->p_pid == mypid)
260 1.1 ad continue;
261 1.1 ad
262 1.1 ad if (matchargs) {
263 1.1 ad if ((pargv = kvm_getargv2(kd, kp, 0)) == NULL)
264 1.1 ad continue;
265 1.1 ad
266 1.1 ad j = 0;
267 1.1 ad while (j < sizeof(buf) && *pargv != NULL) {
268 1.1 ad j += snprintf(buf + j, sizeof(buf) - j,
269 1.1 ad pargv[1] != NULL ? "%s " : "%s",
270 1.1 ad pargv[0]);
271 1.1 ad pargv++;
272 1.1 ad }
273 1.1 ad
274 1.1 ad mstr = buf;
275 1.1 ad } else
276 1.1 ad mstr = kp->p_comm;
277 1.1 ad
278 1.1 ad rv = regexec(®, mstr, 1, ®match, 0);
279 1.1 ad if (rv == 0) {
280 1.1 ad if (fullmatch) {
281 1.1 ad if (regmatch.rm_so == 0 &&
282 1.1 ad regmatch.rm_eo == strlen(mstr))
283 1.1 ad selected[i] = 1;
284 1.1 ad } else
285 1.1 ad selected[i] = 1;
286 1.1 ad } else if (rv != REG_NOMATCH) {
287 1.1 ad regerror(rv, ®, buf, sizeof(buf));
288 1.1 ad errx(STATUS_ERROR, "regexec(): %s", buf);
289 1.1 ad }
290 1.1 ad }
291 1.1 ad
292 1.1 ad regfree(®);
293 1.1 ad }
294 1.1 ad
295 1.1 ad for (i = 0, kp = plist; i < nproc; i++, kp++) {
296 1.1 ad if ((kp->p_flag & P_SYSTEM) != 0)
297 1.1 ad continue;
298 1.1 ad
299 1.1 ad SLIST_FOREACH(li, &ruidlist, li_chain)
300 1.1 ad if (kp->p_ruid == (uid_t)li->li_number)
301 1.1 ad break;
302 1.1 ad if (SLIST_FIRST(&ruidlist) != NULL && li == NULL) {
303 1.1 ad selected[i] = 0;
304 1.1 ad continue;
305 1.1 ad }
306 1.1 ad
307 1.1 ad SLIST_FOREACH(li, &rgidlist, li_chain)
308 1.1 ad if (kp->p_rgid == (gid_t)li->li_number)
309 1.1 ad break;
310 1.1 ad if (SLIST_FIRST(&rgidlist) != NULL && li == NULL) {
311 1.1 ad selected[i] = 0;
312 1.1 ad continue;
313 1.1 ad }
314 1.1 ad
315 1.1 ad SLIST_FOREACH(li, &euidlist, li_chain)
316 1.1 ad if (kp->p_uid == (uid_t)li->li_number)
317 1.1 ad break;
318 1.1 ad if (SLIST_FIRST(&euidlist) != NULL && li == NULL) {
319 1.1 ad selected[i] = 0;
320 1.1 ad continue;
321 1.1 ad }
322 1.1 ad
323 1.1 ad SLIST_FOREACH(li, &ppidlist, li_chain)
324 1.1 ad if (kp->p_ppid == (uid_t)li->li_number)
325 1.1 ad break;
326 1.1 ad if (SLIST_FIRST(&ppidlist) != NULL && li == NULL) {
327 1.1 ad selected[i] = 0;
328 1.1 ad continue;
329 1.1 ad }
330 1.1 ad
331 1.1 ad SLIST_FOREACH(li, &pgrplist, li_chain)
332 1.1 ad if (kp->p__pgid == (uid_t)li->li_number)
333 1.1 ad break;
334 1.1 ad if (SLIST_FIRST(&pgrplist) != NULL && li == NULL) {
335 1.1 ad selected[i] = 0;
336 1.1 ad continue;
337 1.1 ad }
338 1.1 ad
339 1.1 ad SLIST_FOREACH(li, &tdevlist, li_chain) {
340 1.1 ad if (li->li_number == -1 &&
341 1.1 ad (kp->p_flag & P_CONTROLT) == 0)
342 1.1 ad break;
343 1.1 ad if (kp->p_tdev == (uid_t)li->li_number)
344 1.1 ad break;
345 1.1 ad }
346 1.1 ad if (SLIST_FIRST(&tdevlist) != NULL && li == NULL) {
347 1.1 ad selected[i] = 0;
348 1.1 ad continue;
349 1.1 ad }
350 1.1 ad
351 1.1 ad SLIST_FOREACH(li, &sidlist, li_chain)
352 1.1 ad if (kp->p_sid == (uid_t)li->li_number)
353 1.1 ad break;
354 1.1 ad if (SLIST_FIRST(&sidlist) != NULL && li == NULL) {
355 1.1 ad selected[i] = 0;
356 1.1 ad continue;
357 1.1 ad }
358 1.1 ad
359 1.1 ad if (argc == 0)
360 1.1 ad selected[i] = 1;
361 1.1 ad }
362 1.1 ad
363 1.1 ad if (newest) {
364 1.1 ad bestsec = 0;
365 1.1 ad bestusec = 0;
366 1.1 ad bestidx = -1;
367 1.1 ad
368 1.1 ad for (i = 0, kp = plist; i < nproc; i++, kp++) {
369 1.1 ad if (!selected[i])
370 1.1 ad continue;
371 1.1 ad
372 1.1 ad if (kp->p_ustart_sec > bestsec ||
373 1.1 ad (kp->p_ustart_sec == bestsec
374 1.1 ad && kp->p_ustart_usec > bestusec)) {
375 1.1 ad bestsec = kp->p_ustart_sec;
376 1.1 ad bestusec = kp->p_ustart_usec;
377 1.1 ad bestidx = i;
378 1.1 ad }
379 1.1 ad }
380 1.1 ad
381 1.1 ad memset(selected, 0, nproc);
382 1.1 ad if (bestidx != -1)
383 1.1 ad selected[bestidx] = 1;
384 1.1 ad }
385 1.1 ad
386 1.1 ad /*
387 1.1 ad * Take the appropriate action for each matched process, if any.
388 1.1 ad */
389 1.1 ad for (i = 0, rv = 0, kp = plist; i < nproc; i++, kp++) {
390 1.1 ad if (kp->p_pid == mypid)
391 1.1 ad continue;
392 1.1 ad if (selected[i]) {
393 1.1 ad if (inverse)
394 1.1 ad continue;
395 1.1 ad } else if (!inverse)
396 1.4 ad continue;
397 1.4 ad
398 1.4 ad if ((kp->p_flag & P_SYSTEM) != 0)
399 1.1 ad continue;
400 1.1 ad
401 1.10 christos rv |= (*action)(kp);
402 1.1 ad }
403 1.1 ad
404 1.1 ad exit(rv ? STATUS_MATCH : STATUS_NOMATCH);
405 1.1 ad }
406 1.1 ad
407 1.1 ad void
408 1.1 ad usage(void)
409 1.1 ad {
410 1.1 ad const char *ustr;
411 1.1 ad
412 1.1 ad if (pgrep)
413 1.9 sketch ustr = "[-filnvx] [-d delim]";
414 1.1 ad else
415 1.9 sketch ustr = "[-signal] [-finvx]";
416 1.1 ad
417 1.7 soren fprintf(stderr,
418 1.7 soren "usage: %s %s [-G gid] [-P ppid] [-U uid] [-g pgrp] [-s sid]\n"
419 1.7 soren " [-t tty] [-u euid] pattern ...\n", getprogname(),
420 1.7 soren ustr);
421 1.1 ad
422 1.1 ad exit(STATUS_ERROR);
423 1.1 ad }
424 1.1 ad
425 1.10 christos int
426 1.1 ad killact(struct kinfo_proc2 *kp)
427 1.1 ad {
428 1.10 christos if (kill(kp->p_pid, signum) == -1) {
429 1.10 christos if (errno == ESRCH)
430 1.10 christos /*
431 1.10 christos * The process disappeared between us matching
432 1.10 christos * it and us signalling it. Return 0 to
433 1.10 christos * indicate that the process should not be
434 1.10 christos * considered a match.
435 1.10 christos */
436 1.10 christos return 0;
437 1.1 ad
438 1.1 ad err(STATUS_ERROR, "signalling pid %d", (int)kp->p_pid);
439 1.10 christos }
440 1.10 christos
441 1.10 christos return 1;
442 1.1 ad }
443 1.1 ad
444 1.10 christos int
445 1.1 ad grepact(struct kinfo_proc2 *kp)
446 1.1 ad {
447 1.1 ad char **argv;
448 1.1 ad
449 1.1 ad if (longfmt && matchargs) {
450 1.1 ad if ((argv = kvm_getargv2(kd, kp, 0)) == NULL)
451 1.10 christos /*
452 1.10 christos * The process disappeared? Return 0 to
453 1.10 christos * indicate that the process should not be
454 1.10 christos * considered a match.
455 1.10 christos */
456 1.10 christos return 0;
457 1.1 ad
458 1.1 ad printf("%d ", (int)kp->p_pid);
459 1.1 ad for (; *argv != NULL; argv++) {
460 1.1 ad printf("%s", *argv);
461 1.1 ad if (argv[1] != NULL)
462 1.1 ad putchar(' ');
463 1.1 ad }
464 1.1 ad } else if (longfmt)
465 1.1 ad printf("%d %s", (int)kp->p_pid, kp->p_comm);
466 1.1 ad else
467 1.1 ad printf("%d", (int)kp->p_pid);
468 1.1 ad
469 1.1 ad printf("%s", delim);
470 1.10 christos
471 1.10 christos return 1;
472 1.1 ad }
473 1.1 ad
474 1.1 ad void
475 1.1 ad makelist(struct listhead *head, enum listtype type, char *src)
476 1.1 ad {
477 1.1 ad struct list *li;
478 1.1 ad struct passwd *pw;
479 1.1 ad struct group *gr;
480 1.1 ad struct stat st;
481 1.1 ad char *sp, *p, buf[MAXPATHLEN];
482 1.1 ad int empty;
483 1.1 ad
484 1.1 ad empty = 1;
485 1.1 ad
486 1.1 ad while ((sp = strsep(&src, ",")) != NULL) {
487 1.1 ad if (*sp == '\0')
488 1.1 ad usage();
489 1.1 ad
490 1.1 ad if ((li = malloc(sizeof(*li))) == NULL)
491 1.1 ad errx(STATUS_ERROR, "memory allocation failure");
492 1.1 ad SLIST_INSERT_HEAD(head, li, li_chain);
493 1.1 ad empty = 0;
494 1.1 ad
495 1.1 ad li->li_number = (uid_t)strtol(sp, &p, 0);
496 1.1 ad if (*p == '\0') {
497 1.1 ad switch (type) {
498 1.1 ad case LT_PGRP:
499 1.1 ad if (li->li_number == 0)
500 1.1 ad li->li_number = getpgrp();
501 1.1 ad break;
502 1.1 ad case LT_SID:
503 1.1 ad if (li->li_number == 0)
504 1.1 ad li->li_number = getsid(mypid);
505 1.1 ad break;
506 1.1 ad case LT_TTY:
507 1.1 ad usage();
508 1.1 ad default:
509 1.1 ad break;
510 1.1 ad }
511 1.1 ad continue;
512 1.1 ad }
513 1.1 ad
514 1.1 ad switch (type) {
515 1.1 ad case LT_USER:
516 1.1 ad if ((pw = getpwnam(sp)) == NULL)
517 1.1 ad errx(STATUS_BADUSAGE, "unknown user `%s'",
518 1.8 abs sp);
519 1.1 ad li->li_number = pw->pw_uid;
520 1.1 ad break;
521 1.1 ad case LT_GROUP:
522 1.1 ad if ((gr = getgrnam(sp)) == NULL)
523 1.1 ad errx(STATUS_BADUSAGE, "unknown group `%s'",
524 1.8 abs sp);
525 1.1 ad li->li_number = gr->gr_gid;
526 1.1 ad break;
527 1.1 ad case LT_TTY:
528 1.1 ad if (strcmp(sp, "-") == 0) {
529 1.1 ad li->li_number = -1;
530 1.1 ad break;
531 1.1 ad } else if (strcmp(sp, "co") == 0)
532 1.1 ad p = "console";
533 1.1 ad else if (strncmp(sp, "tty", 3) == 0)
534 1.1 ad p = sp;
535 1.1 ad else
536 1.1 ad p = NULL;
537 1.1 ad
538 1.1 ad if (p == NULL)
539 1.1 ad snprintf(buf, sizeof(buf), "/dev/tty%s", sp);
540 1.1 ad else
541 1.1 ad snprintf(buf, sizeof(buf), "/dev/%s", p);
542 1.1 ad
543 1.1 ad if (stat(buf, &st) < 0) {
544 1.1 ad if (errno == ENOENT)
545 1.1 ad errx(STATUS_BADUSAGE,
546 1.1 ad "no such tty: `%s'", sp);
547 1.1 ad err(STATUS_ERROR, "stat(%s)", sp);
548 1.1 ad }
549 1.1 ad
550 1.1 ad if ((st.st_mode & S_IFCHR) == 0)
551 1.1 ad errx(STATUS_BADUSAGE, "not a tty: `%s'", sp);
552 1.1 ad
553 1.1 ad li->li_number = st.st_rdev;
554 1.1 ad break;
555 1.1 ad default:
556 1.1 ad usage();
557 1.1 ad };
558 1.1 ad }
559 1.1 ad
560 1.1 ad if (empty)
561 1.1 ad usage();
562 1.1 ad }
563