]>
Commit | Line | Data |
---|---|---|
3f2457aa A |
1 | /* |
2 | * Copyright (c) 1988, 1993 | |
3 | * The Regents of the University of California. All rights reserved. | |
4 | * | |
5 | * Redistribution and use in source and binary forms, with or without | |
6 | * modification, are permitted provided that the following conditions | |
7 | * are met: | |
8 | * 1. Redistributions of source code must retain the above copyright | |
9 | * notice, this list of conditions and the following disclaimer. | |
10 | * 2. Redistributions in binary form must reproduce the above copyright | |
11 | * notice, this list of conditions and the following disclaimer in the | |
12 | * documentation and/or other materials provided with the distribution. | |
13 | * 3. All advertising materials mentioning features or use of this software | |
14 | * must display the following acknowledgement: | |
15 | * This product includes software developed by the University of | |
16 | * California, Berkeley and its contributors. | |
17 | * 4. Neither the name of the University nor the names of its contributors | |
18 | * may be used to endorse or promote products derived from this software | |
19 | * without specific prior written permission. | |
20 | * | |
21 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND | |
22 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
23 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
24 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE | |
25 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
26 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
27 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
28 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
29 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
30 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
31 | * SUCH DAMAGE. | |
32 | */ | |
33 | ||
34 | #include <sys/cdefs.h> | |
35 | ||
36 | #ifndef lint | |
37 | static const char sccsid[] = "@(#)uucplock.c 8.1 (Berkeley) 6/6/93"; | |
38 | #endif /* not lint */ | |
39 | ||
40 | #include <sys/types.h> | |
41 | #include <sys/file.h> | |
42 | #include <dirent.h> | |
43 | #include <errno.h> | |
44 | #include <paths.h> | |
45 | #include <signal.h> | |
46 | #include <stdio.h> | |
47 | #include <stdlib.h> | |
48 | #include <string.h> | |
49 | #include <unistd.h> | |
50 | #include "libutil.h" | |
51 | ||
52 | #define MAXTRIES 5 | |
53 | ||
54 | #define LOCKTMP "LCKTMP..%d" | |
55 | #define LOCKFMT "LCK..%s" | |
56 | ||
57 | #define GORET(level, val) { err = errno; uuerr = (val); \ | |
58 | goto __CONCAT(ret, level); } | |
59 | ||
60 | /* Forward declarations */ | |
61 | static int put_pid (int fd, pid_t pid); | |
62 | static pid_t get_pid (int fd,int *err); | |
63 | ||
64 | /* | |
65 | * uucp style locking routines | |
66 | */ | |
67 | ||
68 | int | |
69 | uu_lock(const char *tty_name) | |
70 | { | |
71 | int fd, tmpfd, i; | |
72 | pid_t pid, pid_old; | |
73 | char lckname[sizeof(_PATH_UUCPLOCK) + MAXNAMLEN], | |
74 | lcktmpname[sizeof(_PATH_UUCPLOCK) + MAXNAMLEN]; | |
75 | int err, uuerr; | |
76 | ||
77 | pid = getpid(); | |
78 | (void)snprintf(lcktmpname, sizeof(lcktmpname), _PATH_UUCPLOCK LOCKTMP, | |
79 | pid); | |
80 | (void)snprintf(lckname, sizeof(lckname), _PATH_UUCPLOCK LOCKFMT, | |
81 | tty_name); | |
82 | if ((tmpfd = creat(lcktmpname, 0664)) < 0) | |
83 | GORET(0, UU_LOCK_CREAT_ERR); | |
84 | ||
85 | for (i = 0; i < MAXTRIES; i++) { | |
86 | if (link (lcktmpname, lckname) < 0) { | |
87 | if (errno != EEXIST) | |
88 | GORET(1, UU_LOCK_LINK_ERR); | |
89 | /* | |
90 | * file is already locked | |
91 | * check to see if the process holding the lock | |
92 | * still exists | |
93 | */ | |
94 | if ((fd = open(lckname, O_RDONLY)) < 0) | |
95 | GORET(1, UU_LOCK_OPEN_ERR); | |
96 | ||
97 | if ((pid_old = get_pid (fd, &err)) == -1) | |
98 | GORET(2, UU_LOCK_READ_ERR); | |
99 | ||
100 | close(fd); | |
101 | ||
102 | if (kill(pid_old, 0) == 0 || errno != ESRCH) | |
103 | GORET(1, UU_LOCK_INUSE); | |
104 | /* | |
105 | * The process that locked the file isn't running, so | |
106 | * we'll lock it ourselves | |
107 | */ | |
108 | (void)unlink(lckname); | |
109 | } else { | |
110 | if (!put_pid (tmpfd, pid)) | |
111 | GORET(3, UU_LOCK_WRITE_ERR); | |
112 | break; | |
113 | } | |
114 | } | |
115 | GORET(1, (i >= MAXTRIES) ? UU_LOCK_TRY_ERR : UU_LOCK_OK); | |
116 | ||
117 | ret3: | |
118 | (void)unlink(lckname); | |
119 | goto ret1; | |
120 | ret2: | |
121 | (void)close(fd); | |
122 | ret1: | |
123 | (void)close(tmpfd); | |
124 | (void)unlink(lcktmpname); | |
125 | ret0: | |
126 | errno = err; | |
127 | return uuerr; | |
128 | } | |
129 | ||
130 | int | |
131 | uu_lock_txfr(const char *tty_name, pid_t pid) | |
132 | { | |
133 | int fd, err; | |
134 | char lckname[sizeof(_PATH_UUCPLOCK) + MAXNAMLEN]; | |
135 | ||
136 | snprintf(lckname, sizeof(lckname), _PATH_UUCPLOCK LOCKFMT, tty_name); | |
137 | ||
138 | if ((fd = open(lckname, O_RDWR)) < 0) | |
139 | return UU_LOCK_OWNER_ERR; | |
140 | if (get_pid(fd, &err) != getpid()) | |
141 | err = UU_LOCK_OWNER_ERR; | |
142 | else { | |
143 | lseek(fd, (off_t)0, SEEK_SET); | |
144 | err = put_pid(fd, pid) ? 0 : UU_LOCK_WRITE_ERR; | |
145 | } | |
146 | close(fd); | |
147 | ||
148 | return err; | |
149 | } | |
150 | ||
151 | int | |
152 | uu_unlock(const char *tty_name) | |
153 | { | |
154 | char tbuf[sizeof(_PATH_UUCPLOCK) + MAXNAMLEN]; | |
155 | ||
156 | (void)snprintf(tbuf, sizeof(tbuf), _PATH_UUCPLOCK LOCKFMT, tty_name); | |
157 | return unlink(tbuf); | |
158 | } | |
159 | ||
160 | const char * | |
161 | uu_lockerr(int uu_lockresult) | |
162 | { | |
163 | static char errbuf[128]; | |
164 | const char *fmt; | |
165 | ||
166 | switch (uu_lockresult) { | |
167 | case UU_LOCK_INUSE: | |
168 | return "device in use"; | |
169 | case UU_LOCK_OK: | |
170 | return ""; | |
171 | case UU_LOCK_OPEN_ERR: | |
172 | fmt = "open error: %s"; | |
173 | break; | |
174 | case UU_LOCK_READ_ERR: | |
175 | fmt = "read error: %s"; | |
176 | break; | |
177 | case UU_LOCK_CREAT_ERR: | |
178 | fmt = "creat error: %s"; | |
179 | break; | |
180 | case UU_LOCK_WRITE_ERR: | |
181 | fmt = "write error: %s"; | |
182 | break; | |
183 | case UU_LOCK_LINK_ERR: | |
184 | fmt = "link error: %s"; | |
185 | break; | |
186 | case UU_LOCK_TRY_ERR: | |
187 | fmt = "too many tries: %s"; | |
188 | break; | |
189 | case UU_LOCK_OWNER_ERR: | |
190 | fmt = "not locking process: %s"; | |
191 | break; | |
192 | default: | |
193 | fmt = "undefined error: %s"; | |
194 | break; | |
195 | } | |
196 | ||
197 | (void)snprintf(errbuf, sizeof(errbuf), fmt, strerror(errno)); | |
198 | return errbuf; | |
199 | } | |
200 | ||
201 | static int | |
202 | put_pid(int fd, pid_t pid) | |
203 | { | |
204 | char buf[32]; | |
205 | int len; | |
206 | ||
207 | len = sprintf (buf, "%10d\n", (int)pid); | |
208 | return write (fd, buf, (size_t)len) == len; | |
209 | } | |
210 | ||
211 | static pid_t | |
212 | get_pid(int fd, int *err) | |
213 | { | |
214 | int bytes_read; | |
215 | char buf[32]; | |
216 | pid_t pid; | |
217 | ||
218 | bytes_read = read (fd, buf, sizeof (buf) - 1); | |
219 | if (bytes_read > 0) { | |
220 | buf[bytes_read] = '\0'; | |
221 | pid = (pid_t)strtol (buf, (char **) NULL, 10); | |
222 | } else { | |
223 | pid = -1; | |
224 | *err = bytes_read ? errno : EINVAL; | |
225 | } | |
226 | return pid; | |
227 | } | |
228 | ||
229 | /* end of uucplock.c */ |