2006-09-05 00:06:23 +03:00
|
|
|
#include "pathlocks.hh"
|
|
|
|
#include "util.hh"
|
|
|
|
|
2003-09-11 11:31:29 +03:00
|
|
|
#include <cerrno>
|
2008-05-21 14:17:31 +03:00
|
|
|
#include <cstdlib>
|
2003-09-11 11:31:29 +03:00
|
|
|
|
2003-10-14 18:33:00 +03:00
|
|
|
#include <sys/types.h>
|
|
|
|
#include <sys/stat.h>
|
2003-08-01 17:11:19 +03:00
|
|
|
#include <fcntl.h>
|
|
|
|
|
|
|
|
|
2006-09-05 00:06:23 +03:00
|
|
|
namespace nix {
|
|
|
|
|
|
|
|
|
2006-06-20 20:48:10 +03:00
|
|
|
int openLockFile(const Path & path, bool create)
|
|
|
|
{
|
|
|
|
AutoCloseFD fd;
|
|
|
|
|
2011-12-21 21:17:45 +02:00
|
|
|
fd = open(path.c_str(), O_RDWR | (create ? O_CREAT : 0), 0600);
|
2006-06-20 20:48:10 +03:00
|
|
|
if (fd == -1 && (create || errno != ENOENT))
|
|
|
|
throw SysError(format("opening lock file `%1%'") % path);
|
|
|
|
|
|
|
|
return fd.borrow();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-02-02 17:28:36 +02:00
|
|
|
void deleteLockFile(const Path & path, int fd)
|
2006-06-20 20:48:10 +03:00
|
|
|
{
|
|
|
|
/* Get rid of the lock file. Have to be careful not to introduce
|
2010-02-02 17:28:36 +02:00
|
|
|
races. Write a (meaningless) token to the file to indicate to
|
2006-06-20 20:48:10 +03:00
|
|
|
other processes waiting on this lock that the lock is stale
|
|
|
|
(deleted). */
|
|
|
|
unlink(path.c_str());
|
|
|
|
writeFull(fd, (const unsigned char *) "d", 1);
|
|
|
|
/* Note that the result of unlink() is ignored; removing the lock
|
|
|
|
file is an optimisation, not a necessity. */
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-02-03 23:38:41 +02:00
|
|
|
bool lockFile(int fd, LockType lockType, bool wait)
|
2003-10-14 18:33:00 +03:00
|
|
|
{
|
|
|
|
struct flock lock;
|
|
|
|
if (lockType == ltRead) lock.l_type = F_RDLCK;
|
|
|
|
else if (lockType == ltWrite) lock.l_type = F_WRLCK;
|
|
|
|
else if (lockType == ltNone) lock.l_type = F_UNLCK;
|
|
|
|
else abort();
|
|
|
|
lock.l_whence = SEEK_SET;
|
|
|
|
lock.l_start = 0;
|
|
|
|
lock.l_len = 0; /* entire file */
|
|
|
|
|
|
|
|
if (wait) {
|
2010-02-03 23:38:41 +02:00
|
|
|
while (fcntl(fd, F_SETLKW, &lock) != 0) {
|
2004-01-15 22:23:55 +02:00
|
|
|
checkInterrupt();
|
2003-10-14 18:33:00 +03:00
|
|
|
if (errno != EINTR)
|
|
|
|
throw SysError(format("acquiring/releasing lock"));
|
2004-01-15 22:23:55 +02:00
|
|
|
}
|
2003-10-14 18:33:00 +03:00
|
|
|
} else {
|
|
|
|
while (fcntl(fd, F_SETLK, &lock) != 0) {
|
2004-01-15 22:23:55 +02:00
|
|
|
checkInterrupt();
|
2003-10-14 18:33:00 +03:00
|
|
|
if (errno == EACCES || errno == EAGAIN) return false;
|
|
|
|
if (errno != EINTR)
|
|
|
|
throw SysError(format("acquiring/releasing lock"));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2003-08-01 18:06:23 +03:00
|
|
|
/* This enables us to check whether are not already holding a lock on
|
|
|
|
a file ourselves. POSIX locks (fcntl) suck in this respect: if we
|
|
|
|
close a descriptor, the previous lock will be closed as well. And
|
|
|
|
there is no way to query whether we already have a lock (F_GETLK
|
|
|
|
only works on locks held by other processes). */
|
|
|
|
static StringSet lockedPaths; /* !!! not thread-safe */
|
|
|
|
|
|
|
|
|
2004-05-11 21:05:44 +03:00
|
|
|
PathLocks::PathLocks()
|
2003-11-21 18:05:19 +02:00
|
|
|
: deletePaths(false)
|
2003-08-01 17:11:19 +03:00
|
|
|
{
|
2004-05-11 21:05:44 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2006-06-15 14:56:49 +03:00
|
|
|
PathLocks::PathLocks(const PathSet & paths, const string & waitMsg)
|
2004-05-11 21:05:44 +03:00
|
|
|
: deletePaths(false)
|
|
|
|
{
|
2006-06-15 14:56:49 +03:00
|
|
|
lockPaths(paths, waitMsg);
|
2004-05-11 21:05:44 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-03-23 03:05:54 +02:00
|
|
|
bool PathLocks::lockPaths(const PathSet & _paths,
|
|
|
|
const string & waitMsg, bool wait)
|
2004-05-11 21:05:44 +03:00
|
|
|
{
|
2005-01-27 14:19:25 +02:00
|
|
|
assert(fds.empty());
|
2004-05-11 21:05:44 +03:00
|
|
|
|
2003-08-01 17:11:19 +03:00
|
|
|
/* Note that `fds' is built incrementally so that the destructor
|
|
|
|
will only release those locks that we have already acquired. */
|
|
|
|
|
|
|
|
/* Sort the paths. This assures that locks are always acquired in
|
|
|
|
the same order, thus preventing deadlocks. */
|
2003-10-08 18:06:59 +03:00
|
|
|
Paths paths(_paths.begin(), _paths.end());
|
2003-08-01 17:11:19 +03:00
|
|
|
paths.sort();
|
|
|
|
|
|
|
|
/* Acquire the lock for each path. */
|
2009-04-21 14:52:16 +03:00
|
|
|
foreach (Paths::iterator, i, paths) {
|
2004-01-15 22:23:55 +02:00
|
|
|
checkInterrupt();
|
2003-10-08 18:06:59 +03:00
|
|
|
Path path = *i;
|
|
|
|
Path lockPath = path + ".lock";
|
2003-08-01 17:11:19 +03:00
|
|
|
|
|
|
|
debug(format("locking path `%1%'") % path);
|
2003-08-01 18:06:23 +03:00
|
|
|
|
2007-08-28 12:39:03 +03:00
|
|
|
if (lockedPaths.find(lockPath) != lockedPaths.end())
|
|
|
|
throw Error("deadlock: trying to re-acquire self-held lock");
|
2003-08-01 18:06:23 +03:00
|
|
|
|
2005-01-27 14:19:25 +02:00
|
|
|
AutoCloseFD fd;
|
|
|
|
|
|
|
|
while (1) {
|
2006-06-19 17:43:13 +03:00
|
|
|
|
2005-01-27 14:19:25 +02:00
|
|
|
/* Open/create the lock file. */
|
2006-06-20 20:48:10 +03:00
|
|
|
fd = openLockFile(lockPath, true);
|
2005-01-27 14:19:25 +02:00
|
|
|
|
|
|
|
/* Acquire an exclusive lock. */
|
2006-06-15 14:56:49 +03:00
|
|
|
if (!lockFile(fd, ltWrite, false)) {
|
2009-03-23 03:05:54 +02:00
|
|
|
if (wait) {
|
|
|
|
if (waitMsg != "") printMsg(lvlError, waitMsg);
|
|
|
|
lockFile(fd, ltWrite, true);
|
|
|
|
} else {
|
|
|
|
/* Failed to lock this path; release all other
|
|
|
|
locks. */
|
|
|
|
unlock();
|
|
|
|
return false;
|
|
|
|
}
|
2006-06-15 14:56:49 +03:00
|
|
|
}
|
2005-01-27 14:19:25 +02:00
|
|
|
|
|
|
|
debug(format("lock acquired on `%1%'") % lockPath);
|
|
|
|
|
|
|
|
/* Check that the lock file hasn't become stale (i.e.,
|
|
|
|
hasn't been unlinked). */
|
|
|
|
struct stat st;
|
|
|
|
if (fstat(fd, &st) == -1)
|
|
|
|
throw SysError(format("statting lock file `%1%'") % lockPath);
|
|
|
|
if (st.st_size != 0)
|
|
|
|
/* This lock file has been unlinked, so we're holding
|
|
|
|
a lock on a deleted file. This means that other
|
|
|
|
processes may create and acquire a lock on
|
|
|
|
`lockPath', and proceed. So we must retry. */
|
|
|
|
debug(format("open lock file `%1%' has become stale") % lockPath);
|
|
|
|
else
|
|
|
|
break;
|
|
|
|
}
|
2004-05-11 21:05:44 +03:00
|
|
|
|
2005-01-27 14:19:25 +02:00
|
|
|
/* Use borrow so that the descriptor isn't closed. */
|
|
|
|
fds.push_back(FDPair(fd.borrow(), lockPath));
|
2003-08-01 18:06:23 +03:00
|
|
|
lockedPaths.insert(lockPath);
|
2003-08-01 17:11:19 +03:00
|
|
|
}
|
2009-03-23 03:05:54 +02:00
|
|
|
|
|
|
|
return true;
|
2003-08-01 17:11:19 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
PathLocks::~PathLocks()
|
2009-02-16 11:24:20 +02:00
|
|
|
{
|
|
|
|
unlock();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void PathLocks::unlock()
|
2003-08-01 17:11:19 +03:00
|
|
|
{
|
2009-04-21 14:52:16 +03:00
|
|
|
foreach (list<FDPair>::iterator, i, fds) {
|
2010-02-02 17:28:36 +02:00
|
|
|
if (deletePaths) deleteLockFile(i->second, i->first);
|
2006-06-20 20:48:10 +03:00
|
|
|
|
2005-01-27 14:19:25 +02:00
|
|
|
lockedPaths.erase(i->second);
|
|
|
|
if (close(i->first) == -1)
|
|
|
|
printMsg(lvlError,
|
|
|
|
format("error (ignored): cannot close lock file on `%1%'") % i->second);
|
2006-06-20 20:48:10 +03:00
|
|
|
|
2005-01-27 14:19:25 +02:00
|
|
|
debug(format("lock released on `%1%'") % i->second);
|
2003-11-21 18:05:19 +02:00
|
|
|
}
|
2009-02-16 11:24:20 +02:00
|
|
|
|
|
|
|
fds.clear();
|
2003-11-21 18:05:19 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void PathLocks::setDeletion(bool deletePaths)
|
|
|
|
{
|
|
|
|
this->deletePaths = deletePaths;
|
2003-08-01 17:11:19 +03:00
|
|
|
}
|
2006-09-05 00:06:23 +03:00
|
|
|
|
2007-08-28 14:36:17 +03:00
|
|
|
|
|
|
|
bool pathIsLockedByMe(const Path & path)
|
|
|
|
{
|
|
|
|
Path lockPath = path + ".lock";
|
|
|
|
return lockedPaths.find(lockPath) != lockedPaths.end();
|
|
|
|
}
|
|
|
|
|
2006-09-05 00:06:23 +03:00
|
|
|
|
|
|
|
}
|