2006-09-04 21:06:23 +00:00
|
|
|
#include "pathlocks.hh"
|
|
|
|
#include "util.hh"
|
2016-12-09 12:26:43 +00:00
|
|
|
#include "sync.hh"
|
2006-09-04 21:06:23 +00:00
|
|
|
|
2003-09-11 08:31:29 +00:00
|
|
|
#include <cerrno>
|
2008-05-21 11:17:31 +00:00
|
|
|
#include <cstdlib>
|
2003-09-11 08:31:29 +00:00
|
|
|
|
2019-08-07 12:34:11 +00:00
|
|
|
#include <fcntl.h>
|
2003-10-14 15:33:00 +00:00
|
|
|
#include <sys/types.h>
|
|
|
|
#include <sys/stat.h>
|
2018-10-04 13:03:03 +00:00
|
|
|
#include <sys/file.h>
|
2003-08-01 14:11:19 +00:00
|
|
|
|
|
|
|
|
2006-09-04 21:06:23 +00:00
|
|
|
namespace nix {
|
|
|
|
|
|
|
|
|
2017-01-25 11:51:35 +00:00
|
|
|
AutoCloseFD openLockFile(const Path & path, bool create)
|
2006-06-20 17:48:10 +00:00
|
|
|
{
|
|
|
|
AutoCloseFD fd;
|
|
|
|
|
2016-06-09 14:15:58 +00:00
|
|
|
fd = open(path.c_str(), O_CLOEXEC | O_RDWR | (create ? O_CREAT : 0), 0600);
|
2016-07-11 19:44:44 +00:00
|
|
|
if (!fd && (create || errno != ENOENT))
|
2020-04-21 23:07:07 +00:00
|
|
|
throw SysError("opening lock file '%1%'", path);
|
2006-06-20 17:48:10 +00:00
|
|
|
|
2017-01-25 11:51:35 +00:00
|
|
|
return fd;
|
2006-06-20 17:48:10 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-02-02 15:28:36 +00:00
|
|
|
void deleteLockFile(const Path & path, int fd)
|
2006-06-20 17:48:10 +00:00
|
|
|
{
|
|
|
|
/* Get rid of the lock file. Have to be careful not to introduce
|
2010-02-02 15:28:36 +00:00
|
|
|
races. Write a (meaningless) token to the file to indicate to
|
2006-06-20 17:48:10 +00:00
|
|
|
other processes waiting on this lock that the lock is stale
|
|
|
|
(deleted). */
|
|
|
|
unlink(path.c_str());
|
2014-12-12 13:35:44 +00:00
|
|
|
writeFull(fd, "d");
|
2006-06-20 17:48:10 +00:00
|
|
|
/* Note that the result of unlink() is ignored; removing the lock
|
|
|
|
file is an optimisation, not a necessity. */
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-02-03 21:38:41 +00:00
|
|
|
bool lockFile(int fd, LockType lockType, bool wait)
|
2003-10-14 15:33:00 +00:00
|
|
|
{
|
2018-10-04 13:03:03 +00:00
|
|
|
int type;
|
|
|
|
if (lockType == ltRead) type = LOCK_SH;
|
|
|
|
else if (lockType == ltWrite) type = LOCK_EX;
|
|
|
|
else if (lockType == ltNone) type = LOCK_UN;
|
2003-10-14 15:33:00 +00:00
|
|
|
else abort();
|
|
|
|
|
|
|
|
if (wait) {
|
2018-10-04 13:03:03 +00:00
|
|
|
while (flock(fd, type) != 0) {
|
2004-01-15 20:23:55 +00:00
|
|
|
checkInterrupt();
|
2003-10-14 15:33:00 +00:00
|
|
|
if (errno != EINTR)
|
2020-04-21 23:07:07 +00:00
|
|
|
throw SysError("acquiring/releasing lock");
|
2016-07-18 22:50:27 +00:00
|
|
|
else
|
|
|
|
return false;
|
2004-01-15 20:23:55 +00:00
|
|
|
}
|
2003-10-14 15:33:00 +00:00
|
|
|
} else {
|
2018-10-04 13:03:03 +00:00
|
|
|
while (flock(fd, type | LOCK_NB) != 0) {
|
2004-01-15 20:23:55 +00:00
|
|
|
checkInterrupt();
|
2018-10-04 13:03:03 +00:00
|
|
|
if (errno == EWOULDBLOCK) return false;
|
2015-07-17 17:24:28 +00:00
|
|
|
if (errno != EINTR)
|
2020-04-21 23:07:07 +00:00
|
|
|
throw SysError("acquiring/releasing lock");
|
2003-10-14 15:33:00 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2004-05-11 18:05:44 +00:00
|
|
|
PathLocks::PathLocks()
|
2003-11-21 16:05:19 +00:00
|
|
|
: deletePaths(false)
|
2003-08-01 14:11:19 +00:00
|
|
|
{
|
2004-05-11 18:05:44 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2022-02-25 15:00:00 +00:00
|
|
|
PathLocks::PathLocks(const PathSet & paths, const std::string & waitMsg)
|
2004-05-11 18:05:44 +00:00
|
|
|
: deletePaths(false)
|
|
|
|
{
|
2006-06-15 11:56:49 +00:00
|
|
|
lockPaths(paths, waitMsg);
|
2004-05-11 18:05:44 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2018-10-04 13:03:03 +00:00
|
|
|
bool PathLocks::lockPaths(const PathSet & paths,
|
2022-02-25 15:00:00 +00:00
|
|
|
const std::string & waitMsg, bool wait)
|
2004-05-11 18:05:44 +00:00
|
|
|
{
|
2005-01-27 12:19:25 +00:00
|
|
|
assert(fds.empty());
|
2015-07-17 17:24:28 +00:00
|
|
|
|
2003-08-01 14:11:19 +00:00
|
|
|
/* Note that `fds' is built incrementally so that the destructor
|
|
|
|
will only release those locks that we have already acquired. */
|
|
|
|
|
2018-10-04 13:03:03 +00:00
|
|
|
/* Acquire the lock for each path in sorted order. This ensures
|
|
|
|
that locks are always acquired in the same order, thus
|
|
|
|
preventing deadlocks. */
|
2015-07-17 17:24:28 +00:00
|
|
|
for (auto & path : paths) {
|
2004-01-15 20:23:55 +00:00
|
|
|
checkInterrupt();
|
2003-10-08 15:06:59 +00:00
|
|
|
Path lockPath = path + ".lock";
|
2003-08-01 14:11:19 +00:00
|
|
|
|
2023-03-02 14:44:19 +00:00
|
|
|
debug("locking path '%1%'", path);
|
2003-08-01 15:06:23 +00:00
|
|
|
|
2018-10-04 13:03:03 +00:00
|
|
|
AutoCloseFD fd;
|
2003-08-01 15:06:23 +00:00
|
|
|
|
2018-10-04 13:03:03 +00:00
|
|
|
while (1) {
|
2015-07-17 17:24:28 +00:00
|
|
|
|
2018-10-04 13:03:03 +00:00
|
|
|
/* Open/create the lock file. */
|
|
|
|
fd = openLockFile(lockPath, true);
|
2006-06-19 14:43:13 +00:00
|
|
|
|
2018-10-04 13:03:03 +00:00
|
|
|
/* Acquire an exclusive lock. */
|
|
|
|
if (!lockFile(fd.get(), ltWrite, false)) {
|
|
|
|
if (wait) {
|
|
|
|
if (waitMsg != "") printError(waitMsg);
|
|
|
|
lockFile(fd.get(), ltWrite, true);
|
|
|
|
} else {
|
|
|
|
/* Failed to lock this path; release all other
|
|
|
|
locks. */
|
|
|
|
unlock();
|
|
|
|
return false;
|
2009-03-23 01:05:54 +00:00
|
|
|
}
|
2006-06-15 11:56:49 +00:00
|
|
|
}
|
2005-01-27 12:19:25 +00:00
|
|
|
|
2023-03-02 14:44:19 +00:00
|
|
|
debug("lock acquired on '%1%'", lockPath);
|
2018-10-04 13:03:03 +00:00
|
|
|
|
|
|
|
/* Check that the lock file hasn't become stale (i.e.,
|
|
|
|
hasn't been unlinked). */
|
|
|
|
struct stat st;
|
|
|
|
if (fstat(fd.get(), &st) == -1)
|
2020-04-21 23:07:07 +00:00
|
|
|
throw SysError("statting lock file '%1%'", lockPath);
|
2018-10-04 13:03:03 +00:00
|
|
|
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. */
|
2023-03-02 14:44:19 +00:00
|
|
|
debug("open lock file '%1%' has become stale", lockPath);
|
2018-10-04 13:03:03 +00:00
|
|
|
else
|
|
|
|
break;
|
2005-01-27 12:19:25 +00:00
|
|
|
}
|
2004-05-11 18:05:44 +00:00
|
|
|
|
2018-10-04 13:03:03 +00:00
|
|
|
/* Use borrow so that the descriptor isn't closed. */
|
|
|
|
fds.push_back(FDPair(fd.release(), lockPath));
|
2003-08-01 14:11:19 +00:00
|
|
|
}
|
2009-03-23 01:05:54 +00:00
|
|
|
|
|
|
|
return true;
|
2003-08-01 14:11:19 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
PathLocks::~PathLocks()
|
2009-02-16 09:24:20 +00:00
|
|
|
{
|
2016-01-04 10:32:46 +00:00
|
|
|
try {
|
|
|
|
unlock();
|
|
|
|
} catch (...) {
|
|
|
|
ignoreException();
|
|
|
|
}
|
2009-02-16 09:24:20 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void PathLocks::unlock()
|
2003-08-01 14:11:19 +00:00
|
|
|
{
|
2015-07-17 17:24:28 +00:00
|
|
|
for (auto & i : fds) {
|
|
|
|
if (deletePaths) deleteLockFile(i.second, i.first);
|
2006-06-20 17:48:10 +00:00
|
|
|
|
2015-07-17 17:24:28 +00:00
|
|
|
if (close(i.first) == -1)
|
2016-09-21 14:11:01 +00:00
|
|
|
printError(
|
2020-05-03 14:01:25 +00:00
|
|
|
"error (ignored): cannot close lock file on '%1%'",
|
|
|
|
i.second);
|
2006-06-20 17:48:10 +00:00
|
|
|
|
2023-03-02 14:44:19 +00:00
|
|
|
debug("lock released on '%1%'", i.second);
|
2003-11-21 16:05:19 +00:00
|
|
|
}
|
2009-02-16 09:24:20 +00:00
|
|
|
|
|
|
|
fds.clear();
|
2003-11-21 16:05:19 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void PathLocks::setDeletion(bool deletePaths)
|
|
|
|
{
|
|
|
|
this->deletePaths = deletePaths;
|
2003-08-01 14:11:19 +00:00
|
|
|
}
|
2006-09-04 21:06:23 +00:00
|
|
|
|
2007-08-28 11:36:17 +00:00
|
|
|
|
2021-08-16 18:03:32 +00:00
|
|
|
FdLock::FdLock(int fd, LockType lockType, bool wait, std::string_view waitMsg)
|
|
|
|
: fd(fd)
|
|
|
|
{
|
|
|
|
if (wait) {
|
|
|
|
if (!lockFile(fd, lockType, false)) {
|
|
|
|
printInfo("%s", waitMsg);
|
|
|
|
acquired = lockFile(fd, lockType, true);
|
|
|
|
}
|
|
|
|
} else
|
|
|
|
acquired = lockFile(fd, lockType, false);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2006-09-04 21:06:23 +00:00
|
|
|
}
|