dotlock.c revision 1.10 1 1.10 christos /* $NetBSD: dotlock.c,v 1.10 2009/04/10 13:08:24 christos Exp $ */
2 1.1 christos
3 1.1 christos /*
4 1.1 christos * Copyright (c) 1996 Christos Zoulas. All rights reserved.
5 1.1 christos *
6 1.1 christos * Redistribution and use in source and binary forms, with or without
7 1.1 christos * modification, are permitted provided that the following conditions
8 1.1 christos * are met:
9 1.1 christos * 1. Redistributions of source code must retain the above copyright
10 1.1 christos * notice, this list of conditions and the following disclaimer.
11 1.1 christos * 2. Redistributions in binary form must reproduce the above copyright
12 1.1 christos * notice, this list of conditions and the following disclaimer in the
13 1.1 christos * documentation and/or other materials provided with the distribution.
14 1.1 christos * 3. All advertising materials mentioning features or use of this software
15 1.1 christos * must display the following acknowledgement:
16 1.1 christos * This product includes software developed by Christos Zoulas.
17 1.1 christos * 4. The name of the author may not be used to endorse or promote products
18 1.1 christos * derived from this software without specific prior written permission.
19 1.1 christos *
20 1.1 christos * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
21 1.1 christos * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
22 1.1 christos * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
23 1.1 christos * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
24 1.1 christos * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
25 1.1 christos * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
26 1.1 christos * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
27 1.1 christos * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
28 1.1 christos * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
29 1.1 christos * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30 1.1 christos */
31 1.1 christos
32 1.2 lukem #include <sys/cdefs.h>
33 1.1 christos #ifndef lint
34 1.10 christos __RCSID("$NetBSD: dotlock.c,v 1.10 2009/04/10 13:08:24 christos Exp $");
35 1.1 christos #endif
36 1.1 christos
37 1.2 lukem #include "rcv.h"
38 1.1 christos #include "extern.h"
39 1.10 christos #include "sig.h"
40 1.1 christos
41 1.1 christos #ifndef O_SYNC
42 1.1 christos #define O_SYNC 0
43 1.1 christos #endif
44 1.1 christos
45 1.5 wiz static int create_exclusive(const char *);
46 1.1 christos /*
47 1.1 christos * Create a unique file. O_EXCL does not really work over NFS so we follow
48 1.1 christos * the following trick: [Inspired by S.R. van den Berg]
49 1.1 christos *
50 1.1 christos * - make a mostly unique filename and try to create it.
51 1.1 christos * - link the unique filename to our target
52 1.1 christos * - get the link count of the target
53 1.1 christos * - unlink the mostly unique filename
54 1.1 christos * - if the link count was 2, then we are ok; else we've failed.
55 1.1 christos */
56 1.1 christos static int
57 1.5 wiz create_exclusive(const char *fname)
58 1.1 christos {
59 1.4 mrg char path[MAXPATHLEN], hostname[MAXHOSTNAMELEN + 1];
60 1.1 christos const char *ptr;
61 1.1 christos struct timeval tv;
62 1.1 christos pid_t pid;
63 1.1 christos size_t ntries, cookie;
64 1.1 christos int fd, serrno;
65 1.1 christos struct stat st;
66 1.1 christos
67 1.4 mrg (void)gettimeofday(&tv, NULL);
68 1.9 christos (void)gethostname(hostname, sizeof(hostname));
69 1.4 mrg hostname[sizeof(hostname) - 1] = '\0';
70 1.1 christos pid = getpid();
71 1.1 christos
72 1.1 christos cookie = pid ^ tv.tv_usec;
73 1.1 christos
74 1.1 christos /*
75 1.1 christos * We generate a semi-unique filename, from hostname.(pid ^ usec)
76 1.1 christos */
77 1.1 christos if ((ptr = strrchr(fname, '/')) == NULL)
78 1.1 christos ptr = fname;
79 1.1 christos else
80 1.1 christos ptr++;
81 1.1 christos
82 1.9 christos (void)snprintf(path, sizeof(path), "%.*s.%s.%lx",
83 1.3 mrg (int)(ptr - fname), fname, hostname, (u_long)cookie);
84 1.1 christos
85 1.1 christos /*
86 1.1 christos * We try to create the unique filename.
87 1.1 christos */
88 1.1 christos for (ntries = 0; ntries < 5; ntries++) {
89 1.1 christos fd = open(path, O_WRONLY|O_CREAT|O_TRUNC|O_EXCL|O_SYNC, 0);
90 1.1 christos if (fd != -1) {
91 1.6 wiz (void)close(fd);
92 1.1 christos break;
93 1.1 christos }
94 1.1 christos else if (errno == EEXIST)
95 1.1 christos continue;
96 1.1 christos else
97 1.1 christos return -1;
98 1.1 christos }
99 1.1 christos
100 1.1 christos /*
101 1.1 christos * We link the path to the name
102 1.1 christos */
103 1.1 christos if (link(path, fname) == -1)
104 1.1 christos goto bad;
105 1.1 christos
106 1.1 christos /*
107 1.1 christos * Note that we stat our own exclusively created name, not the
108 1.1 christos * destination, since the destination can be affected by others.
109 1.1 christos */
110 1.1 christos if (stat(path, &st) == -1)
111 1.1 christos goto bad;
112 1.1 christos
113 1.6 wiz (void)unlink(path);
114 1.1 christos
115 1.1 christos /*
116 1.1 christos * If the number of links was two (one for the unique file and one
117 1.1 christos * for the lock), we've won the race
118 1.1 christos */
119 1.1 christos if (st.st_nlink != 2) {
120 1.1 christos errno = EEXIST;
121 1.1 christos return -1;
122 1.1 christos }
123 1.1 christos return 0;
124 1.1 christos
125 1.1 christos bad:
126 1.1 christos serrno = errno;
127 1.6 wiz (void)unlink(path);
128 1.1 christos errno = serrno;
129 1.1 christos return -1;
130 1.1 christos }
131 1.1 christos
132 1.5 wiz /*
133 1.5 wiz * fname -- Pathname to lock
134 1.5 wiz * pollinterval -- Interval to check for lock, -1 return
135 1.5 wiz * fp -- File to print message
136 1.5 wiz * msg -- Message to print
137 1.5 wiz */
138 1.8 christos PUBLIC int
139 1.5 wiz dot_lock(const char *fname, int pollinterval, FILE *fp, const char *msg)
140 1.1 christos {
141 1.1 christos char path[MAXPATHLEN];
142 1.1 christos sigset_t nset, oset;
143 1.10 christos int retval;
144 1.1 christos
145 1.7 christos (void)sigemptyset(&nset);
146 1.7 christos (void)sigaddset(&nset, SIGHUP);
147 1.7 christos (void)sigaddset(&nset, SIGINT);
148 1.7 christos (void)sigaddset(&nset, SIGQUIT);
149 1.7 christos (void)sigaddset(&nset, SIGTERM);
150 1.7 christos (void)sigaddset(&nset, SIGTTIN);
151 1.7 christos (void)sigaddset(&nset, SIGTTOU);
152 1.7 christos (void)sigaddset(&nset, SIGTSTP);
153 1.7 christos (void)sigaddset(&nset, SIGCHLD);
154 1.1 christos
155 1.6 wiz (void)snprintf(path, sizeof(path), "%s.lock", fname);
156 1.1 christos
157 1.10 christos retval = -1;
158 1.1 christos for (;;) {
159 1.10 christos sig_check();
160 1.6 wiz (void)sigprocmask(SIG_BLOCK, &nset, &oset);
161 1.1 christos if (create_exclusive(path) != -1) {
162 1.6 wiz (void)sigprocmask(SIG_SETMASK, &oset, NULL);
163 1.10 christos retval = 0;
164 1.10 christos break;
165 1.1 christos }
166 1.1 christos else
167 1.6 wiz (void)sigprocmask(SIG_SETMASK, &oset, NULL);
168 1.1 christos
169 1.1 christos if (errno != EEXIST)
170 1.10 christos break;
171 1.1 christos
172 1.1 christos if (fp && msg)
173 1.6 wiz (void)fputs(msg, fp);
174 1.1 christos
175 1.1 christos if (pollinterval) {
176 1.1 christos if (pollinterval == -1) {
177 1.1 christos errno = EEXIST;
178 1.10 christos break;
179 1.1 christos }
180 1.7 christos (void)sleep((unsigned int)pollinterval);
181 1.1 christos }
182 1.1 christos }
183 1.10 christos sig_check();
184 1.10 christos return retval;
185 1.1 christos }
186 1.1 christos
187 1.8 christos PUBLIC void
188 1.5 wiz dot_unlock(const char *fname)
189 1.1 christos {
190 1.1 christos char path[MAXPATHLEN];
191 1.1 christos
192 1.6 wiz (void)snprintf(path, sizeof(path), "%s.lock", fname);
193 1.6 wiz (void)unlink(path);
194 1.1 christos }
195