2007-03-30 15:24:35 +02:00
|
|
|
|
#include "config.h"
|
2006-11-30 18:43:04 +01:00
|
|
|
|
#include "local-store.hh"
|
2006-09-04 23:06:23 +02:00
|
|
|
|
#include "globals.hh"
|
|
|
|
|
#include "archive.hh"
|
|
|
|
|
#include "pathlocks.hh"
|
2007-02-21 16:45:32 +01:00
|
|
|
|
#include "worker-protocol.hh"
|
2010-02-22 12:15:50 +01:00
|
|
|
|
#include "derivations.hh"
|
2013-08-07 13:51:55 +02:00
|
|
|
|
#include "affinity.hh"
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2003-06-23 15:27:59 +02:00
|
|
|
|
#include <iostream>
|
2003-12-22 17:40:46 +01:00
|
|
|
|
#include <algorithm>
|
2013-11-22 11:00:43 +01:00
|
|
|
|
#include <cstring>
|
2003-06-23 15:27:59 +02:00
|
|
|
|
|
2005-01-19 17:39:47 +01:00
|
|
|
|
#include <sys/types.h>
|
|
|
|
|
#include <sys/stat.h>
|
2015-05-13 09:37:12 +02:00
|
|
|
|
#include <sys/select.h>
|
2012-07-23 22:52:25 +02:00
|
|
|
|
#include <sys/time.h>
|
2003-10-15 14:42:39 +02:00
|
|
|
|
#include <unistd.h>
|
2005-01-19 17:39:47 +01:00
|
|
|
|
#include <utime.h>
|
2008-06-09 15:52:45 +02:00
|
|
|
|
#include <fcntl.h>
|
2008-07-18 17:34:46 +02:00
|
|
|
|
#include <errno.h>
|
2009-09-24 09:39:55 +02:00
|
|
|
|
#include <stdio.h>
|
2010-12-17 18:23:15 +01:00
|
|
|
|
#include <time.h>
|
2014-05-02 14:31:15 +02:00
|
|
|
|
#include <grp.h>
|
2003-06-23 15:27:59 +02:00
|
|
|
|
|
2015-12-03 16:30:19 +01:00
|
|
|
|
#if __linux__
|
2012-09-19 21:45:29 +02:00
|
|
|
|
#include <sched.h>
|
2013-03-08 01:39:55 +01:00
|
|
|
|
#include <sys/statvfs.h>
|
2012-09-19 21:45:29 +02:00
|
|
|
|
#include <sys/mount.h>
|
2013-01-03 12:59:23 +01:00
|
|
|
|
#include <sys/ioctl.h>
|
|
|
|
|
#endif
|
|
|
|
|
|
2010-02-18 15:30:42 +01:00
|
|
|
|
#include <sqlite3.h>
|
|
|
|
|
|
2006-11-30 19:35:36 +01:00
|
|
|
|
|
2006-09-04 23:06:23 +02:00
|
|
|
|
namespace nix {
|
2003-06-23 15:27:59 +02:00
|
|
|
|
|
2010-12-05 19:23:19 +01:00
|
|
|
|
|
2006-03-10 23:27:26 +01:00
|
|
|
|
void checkStoreNotSymlink()
|
|
|
|
|
{
|
|
|
|
|
if (getEnv("NIX_IGNORE_SYMLINK_STORE") == "1") return;
|
2012-07-31 01:55:41 +02:00
|
|
|
|
Path path = settings.nixStore;
|
2006-03-10 23:27:26 +01:00
|
|
|
|
struct stat st;
|
|
|
|
|
while (path != "/") {
|
|
|
|
|
if (lstat(path.c_str(), &st))
|
2014-08-20 17:00:17 +02:00
|
|
|
|
throw SysError(format("getting status of ‘%1%’") % path);
|
2006-03-10 23:27:26 +01:00
|
|
|
|
if (S_ISLNK(st.st_mode))
|
|
|
|
|
throw Error(format(
|
2014-08-20 17:00:17 +02:00
|
|
|
|
"the path ‘%1%’ is a symlink; "
|
2006-03-10 23:27:26 +01:00
|
|
|
|
"this is not allowed for the Nix store and its parent directories")
|
|
|
|
|
% path);
|
|
|
|
|
path = dirOf(path);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2016-02-24 17:33:53 +01:00
|
|
|
|
LocalStore::LocalStore()
|
2016-04-08 18:07:13 +02:00
|
|
|
|
: linksDir(settings.nixStore + "/.links")
|
|
|
|
|
, reservedPath(settings.nixDBPath + "/reserved")
|
|
|
|
|
, schemaPath(settings.nixDBPath + "/schema")
|
2003-10-15 14:42:39 +02:00
|
|
|
|
{
|
2016-04-08 18:07:13 +02:00
|
|
|
|
auto state(_state.lock());
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2012-07-31 01:55:41 +02:00
|
|
|
|
if (settings.readOnlyMode) {
|
2016-04-08 18:07:13 +02:00
|
|
|
|
openDB(*state, false);
|
2010-02-24 17:44:43 +01:00
|
|
|
|
return;
|
|
|
|
|
}
|
2005-02-09 10:50:29 +01:00
|
|
|
|
|
2009-09-23 19:05:51 +02:00
|
|
|
|
/* Create missing state directories if they don't already exist. */
|
2012-07-31 01:55:41 +02:00
|
|
|
|
createDirs(settings.nixStore);
|
2012-09-25 22:30:08 +02:00
|
|
|
|
makeStoreWritable();
|
2016-04-08 18:07:13 +02:00
|
|
|
|
createDirs(linksDir);
|
2012-07-31 01:55:41 +02:00
|
|
|
|
Path profilesDir = settings.nixStateDir + "/profiles";
|
2014-05-02 14:31:15 +02:00
|
|
|
|
createDirs(profilesDir);
|
2012-07-31 01:55:41 +02:00
|
|
|
|
createDirs(settings.nixStateDir + "/temproots");
|
|
|
|
|
createDirs(settings.nixDBPath);
|
|
|
|
|
Path gcRootsDir = settings.nixStateDir + "/gcroots";
|
2009-09-23 19:05:51 +02:00
|
|
|
|
if (!pathExists(gcRootsDir)) {
|
|
|
|
|
createDirs(gcRootsDir);
|
2014-02-27 23:17:53 +01:00
|
|
|
|
createSymlink(profilesDir, gcRootsDir + "/profiles");
|
2009-09-23 19:05:51 +02:00
|
|
|
|
}
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2014-05-02 14:31:15 +02:00
|
|
|
|
/* Optionally, create directories and set permissions for a
|
|
|
|
|
multi-user install. */
|
|
|
|
|
if (getuid() == 0 && settings.buildUsersGroup != "") {
|
|
|
|
|
|
|
|
|
|
Path perUserDir = profilesDir + "/per-user";
|
|
|
|
|
createDirs(perUserDir);
|
2015-01-08 16:49:31 +01:00
|
|
|
|
if (chmod(perUserDir.c_str(), 01777) == -1)
|
2015-01-08 16:59:22 +01:00
|
|
|
|
throw SysError(format("could not set permissions on ‘%1%’ to 1777") % perUserDir);
|
2014-05-02 14:31:15 +02:00
|
|
|
|
|
2015-04-07 13:21:26 +02:00
|
|
|
|
mode_t perm = 01775;
|
2015-01-08 16:49:31 +01:00
|
|
|
|
|
2014-05-02 14:31:15 +02:00
|
|
|
|
struct group * gr = getgrnam(settings.buildUsersGroup.c_str());
|
|
|
|
|
if (!gr)
|
2014-12-29 13:18:48 +01:00
|
|
|
|
printMsg(lvlError, format("warning: the group ‘%1%’ specified in ‘build-users-group’ does not exist")
|
2014-05-02 14:31:15 +02:00
|
|
|
|
% settings.buildUsersGroup);
|
2014-12-29 13:18:48 +01:00
|
|
|
|
else {
|
|
|
|
|
struct stat st;
|
|
|
|
|
if (stat(settings.nixStore.c_str(), &st))
|
|
|
|
|
throw SysError(format("getting attributes of path ‘%1%’") % settings.nixStore);
|
|
|
|
|
|
2015-01-08 16:39:07 +01:00
|
|
|
|
if (st.st_uid != 0 || st.st_gid != gr->gr_gid || (st.st_mode & ~S_IFMT) != perm) {
|
2014-12-29 13:18:48 +01:00
|
|
|
|
if (chown(settings.nixStore.c_str(), 0, gr->gr_gid) == -1)
|
|
|
|
|
throw SysError(format("changing ownership of path ‘%1%’") % settings.nixStore);
|
2015-01-08 16:39:07 +01:00
|
|
|
|
if (chmod(settings.nixStore.c_str(), perm) == -1)
|
2014-12-29 13:18:48 +01:00
|
|
|
|
throw SysError(format("changing permissions on path ‘%1%’") % settings.nixStore);
|
|
|
|
|
}
|
2014-05-02 14:31:15 +02:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2006-03-10 23:27:26 +01:00
|
|
|
|
checkStoreNotSymlink();
|
|
|
|
|
|
2012-05-30 04:59:12 +02:00
|
|
|
|
/* We can't open a SQLite database if the disk is full. Since
|
|
|
|
|
this prevents the garbage collector from running when it's most
|
|
|
|
|
needed, we reserve some dummy space that we can free just
|
|
|
|
|
before doing a garbage collection. */
|
|
|
|
|
try {
|
2016-02-24 17:33:53 +01:00
|
|
|
|
struct stat st;
|
|
|
|
|
if (stat(reservedPath.c_str(), &st) == -1 ||
|
|
|
|
|
st.st_size != settings.reservedSize)
|
|
|
|
|
{
|
|
|
|
|
AutoCloseFD fd = open(reservedPath.c_str(), O_WRONLY | O_CREAT, 0600);
|
|
|
|
|
int res = -1;
|
2015-06-22 15:54:55 +02:00
|
|
|
|
#if HAVE_POSIX_FALLOCATE
|
2016-02-24 17:33:53 +01:00
|
|
|
|
res = posix_fallocate(fd, 0, settings.reservedSize);
|
2015-06-22 15:54:55 +02:00
|
|
|
|
#endif
|
2016-02-24 17:33:53 +01:00
|
|
|
|
if (res == -1) {
|
|
|
|
|
writeFull(fd, string(settings.reservedSize, 'X'));
|
|
|
|
|
ftruncate(fd, settings.reservedSize);
|
2015-06-22 15:54:55 +02:00
|
|
|
|
}
|
2012-05-30 04:59:12 +02:00
|
|
|
|
}
|
|
|
|
|
} catch (SysError & e) { /* don't care about errors */
|
|
|
|
|
}
|
|
|
|
|
|
2010-02-18 15:30:42 +01:00
|
|
|
|
/* Acquire the big fat lock in shared mode to make sure that no
|
|
|
|
|
schema upgrade is in progress. */
|
2008-07-18 17:34:46 +02:00
|
|
|
|
try {
|
2012-07-31 01:55:41 +02:00
|
|
|
|
Path globalLockPath = settings.nixDBPath + "/big-lock";
|
2008-07-18 17:34:46 +02:00
|
|
|
|
globalLock = openLockFile(globalLockPath.c_str(), true);
|
|
|
|
|
} catch (SysError & e) {
|
|
|
|
|
if (e.errNo != EACCES) throw;
|
2012-07-31 01:55:41 +02:00
|
|
|
|
settings.readOnlyMode = true;
|
2016-04-08 18:07:13 +02:00
|
|
|
|
openDB(*state, false);
|
2008-07-18 17:34:46 +02:00
|
|
|
|
return;
|
|
|
|
|
}
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2008-06-09 15:52:45 +02:00
|
|
|
|
if (!lockFile(globalLock, ltRead, false)) {
|
|
|
|
|
printMsg(lvlError, "waiting for the big Nix store lock...");
|
|
|
|
|
lockFile(globalLock, ltRead, true);
|
2006-02-16 14:19:15 +01:00
|
|
|
|
}
|
2010-02-18 15:30:42 +01:00
|
|
|
|
|
|
|
|
|
/* Check the current database schema and if necessary do an
|
2010-02-24 17:30:20 +01:00
|
|
|
|
upgrade. */
|
2008-06-09 15:52:45 +02:00
|
|
|
|
int curSchema = getSchema();
|
2005-02-09 10:50:29 +01:00
|
|
|
|
if (curSchema > nixSchemaVersion)
|
|
|
|
|
throw Error(format("current Nix store schema is version %1%, but I only support %2%")
|
|
|
|
|
% curSchema % nixSchemaVersion);
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2010-02-24 17:30:20 +01:00
|
|
|
|
else if (curSchema == 0) { /* new store */
|
2010-02-18 15:30:42 +01:00
|
|
|
|
curSchema = nixSchemaVersion;
|
2016-04-08 18:07:13 +02:00
|
|
|
|
openDB(*state, true);
|
2010-02-24 17:30:20 +01:00
|
|
|
|
writeFile(schemaPath, (format("%1%") % nixSchemaVersion).str());
|
|
|
|
|
}
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2010-02-24 17:30:20 +01:00
|
|
|
|
else if (curSchema < nixSchemaVersion) {
|
|
|
|
|
if (curSchema < 5)
|
|
|
|
|
throw Error(
|
|
|
|
|
"Your Nix store has a database in Berkeley DB format,\n"
|
|
|
|
|
"which is no longer supported. To convert to the new format,\n"
|
|
|
|
|
"please upgrade Nix to version 0.12 first.");
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2016-03-21 15:09:03 +01:00
|
|
|
|
if (curSchema < 6)
|
|
|
|
|
throw Error(
|
|
|
|
|
"Your Nix store has a database in flat file format,\n"
|
|
|
|
|
"which is no longer supported. To convert to the new format,\n"
|
|
|
|
|
"please upgrade Nix to version 1.11 first.");
|
|
|
|
|
|
2010-02-24 17:30:20 +01:00
|
|
|
|
if (!lockFile(globalLock, ltWrite, false)) {
|
|
|
|
|
printMsg(lvlError, "waiting for exclusive access to the Nix store...");
|
|
|
|
|
lockFile(globalLock, ltWrite, true);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Get the schema version again, because another process may
|
|
|
|
|
have performed the upgrade already. */
|
|
|
|
|
curSchema = getSchema();
|
|
|
|
|
|
2016-03-30 17:35:48 +02:00
|
|
|
|
if (curSchema < 7) { upgradeStore7(); }
|
|
|
|
|
|
2016-04-08 18:07:13 +02:00
|
|
|
|
openDB(*state, false);
|
2016-03-30 17:35:48 +02:00
|
|
|
|
|
|
|
|
|
if (curSchema < 8) {
|
2016-04-08 18:07:13 +02:00
|
|
|
|
SQLiteTxn txn(state->db);
|
|
|
|
|
if (sqlite3_exec(state->db, "alter table ValidPaths add column ultimate integer", 0, 0, 0) != SQLITE_OK)
|
|
|
|
|
throwSQLiteError(state->db, "upgrading database schema");
|
|
|
|
|
if (sqlite3_exec(state->db, "alter table ValidPaths add column sigs text", 0, 0, 0) != SQLITE_OK)
|
|
|
|
|
throwSQLiteError(state->db, "upgrading database schema");
|
2016-03-30 17:35:48 +02:00
|
|
|
|
txn.commit();
|
|
|
|
|
}
|
2010-02-24 17:30:20 +01:00
|
|
|
|
|
2016-04-08 18:16:53 +02:00
|
|
|
|
if (curSchema < 9) {
|
|
|
|
|
SQLiteTxn txn(state->db);
|
|
|
|
|
if (sqlite3_exec(state->db, "drop table FailedPaths", 0, 0, 0) != SQLITE_OK)
|
|
|
|
|
throwSQLiteError(state->db, "upgrading database schema");
|
|
|
|
|
txn.commit();
|
|
|
|
|
}
|
|
|
|
|
|
2008-06-09 15:52:45 +02:00
|
|
|
|
writeFile(schemaPath, (format("%1%") % nixSchemaVersion).str());
|
2010-02-24 17:30:20 +01:00
|
|
|
|
|
|
|
|
|
lockFile(globalLock, ltRead, true);
|
2005-02-09 10:50:29 +01:00
|
|
|
|
}
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2016-04-08 18:07:13 +02:00
|
|
|
|
else openDB(*state, false);
|
2003-10-15 14:42:39 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2006-11-30 18:43:04 +01:00
|
|
|
|
LocalStore::~LocalStore()
|
2006-03-01 17:36:35 +01:00
|
|
|
|
{
|
2016-04-08 18:07:13 +02:00
|
|
|
|
auto state(_state.lock());
|
|
|
|
|
|
2007-05-01 17:16:17 +02:00
|
|
|
|
try {
|
2016-04-08 18:07:13 +02:00
|
|
|
|
for (auto & i : state->runningSubstituters) {
|
2015-07-17 19:24:28 +02:00
|
|
|
|
if (i.second.disabled) continue;
|
|
|
|
|
i.second.to.close();
|
|
|
|
|
i.second.from.close();
|
|
|
|
|
i.second.error.close();
|
|
|
|
|
if (i.second.pid != -1)
|
|
|
|
|
i.second.pid.wait(true);
|
2008-08-02 14:54:35 +02:00
|
|
|
|
}
|
2007-05-01 17:16:17 +02:00
|
|
|
|
} catch (...) {
|
|
|
|
|
ignoreException();
|
|
|
|
|
}
|
2014-11-19 17:07:29 +01:00
|
|
|
|
|
|
|
|
|
try {
|
2016-04-08 18:07:13 +02:00
|
|
|
|
if (state->fdTempRoots != -1) {
|
|
|
|
|
state->fdTempRoots.close();
|
|
|
|
|
unlink(state->fnTempRoots.c_str());
|
2014-11-19 17:07:29 +01:00
|
|
|
|
}
|
|
|
|
|
} catch (...) {
|
|
|
|
|
ignoreException();
|
|
|
|
|
}
|
2006-03-01 17:36:35 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2008-06-09 15:52:45 +02:00
|
|
|
|
int LocalStore::getSchema()
|
2003-10-15 14:42:39 +02:00
|
|
|
|
{
|
2008-06-09 15:52:45 +02:00
|
|
|
|
int curSchema = 0;
|
|
|
|
|
if (pathExists(schemaPath)) {
|
|
|
|
|
string s = readFile(schemaPath);
|
|
|
|
|
if (!string2Int(s, curSchema))
|
2014-08-20 17:00:17 +02:00
|
|
|
|
throw Error(format("‘%1%’ is corrupt") % schemaPath);
|
2008-06-09 15:52:45 +02:00
|
|
|
|
}
|
|
|
|
|
return curSchema;
|
2003-10-15 14:42:39 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2016-01-31 10:19:14 +01:00
|
|
|
|
bool LocalStore::haveWriteAccess()
|
|
|
|
|
{
|
|
|
|
|
return access(settings.nixDBPath.c_str(), R_OK | W_OK) == 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2016-04-08 18:07:13 +02:00
|
|
|
|
void LocalStore::openDB(State & state, bool create)
|
2010-02-18 14:16:59 +01:00
|
|
|
|
{
|
2016-01-31 10:19:14 +01:00
|
|
|
|
if (!haveWriteAccess())
|
2014-08-20 17:00:17 +02:00
|
|
|
|
throw SysError(format("Nix database directory ‘%1%’ is not writable") % settings.nixDBPath);
|
2014-02-01 16:57:38 +01:00
|
|
|
|
|
2010-02-24 17:30:20 +01:00
|
|
|
|
/* Open the Nix database. */
|
2014-02-01 16:57:38 +01:00
|
|
|
|
string dbPath = settings.nixDBPath + "/db.sqlite";
|
2016-04-08 18:07:13 +02:00
|
|
|
|
auto & db(state.db);
|
2014-02-01 16:57:38 +01:00
|
|
|
|
if (sqlite3_open_v2(dbPath.c_str(), &db.db,
|
2010-02-24 17:30:20 +01:00
|
|
|
|
SQLITE_OPEN_READWRITE | (create ? SQLITE_OPEN_CREATE : 0), 0) != SQLITE_OK)
|
2014-08-20 17:00:17 +02:00
|
|
|
|
throw Error(format("cannot open Nix database ‘%1%’") % dbPath);
|
2010-02-19 17:04:51 +01:00
|
|
|
|
|
2010-03-08 11:35:45 +01:00
|
|
|
|
if (sqlite3_busy_timeout(db, 60 * 60 * 1000) != SQLITE_OK)
|
2010-12-05 19:23:19 +01:00
|
|
|
|
throwSQLiteError(db, "setting timeout");
|
2010-02-18 15:30:42 +01:00
|
|
|
|
|
2010-02-24 17:30:20 +01:00
|
|
|
|
if (sqlite3_exec(db, "pragma foreign_keys = 1;", 0, 0, 0) != SQLITE_OK)
|
2010-12-05 19:23:19 +01:00
|
|
|
|
throwSQLiteError(db, "enabling foreign keys");
|
2010-02-24 17:30:20 +01:00
|
|
|
|
|
|
|
|
|
/* !!! check whether sqlite has been built with foreign key
|
|
|
|
|
support */
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2010-02-24 17:30:20 +01:00
|
|
|
|
/* Whether SQLite should fsync(). "Normal" synchronous mode
|
|
|
|
|
should be safe enough. If the user asks for it, don't sync at
|
|
|
|
|
all. This can cause database corruption if the system
|
|
|
|
|
crashes. */
|
2012-07-31 01:55:41 +02:00
|
|
|
|
string syncMode = settings.fsyncMetadata ? "normal" : "off";
|
2010-02-24 17:30:20 +01:00
|
|
|
|
if (sqlite3_exec(db, ("pragma synchronous = " + syncMode + ";").c_str(), 0, 0, 0) != SQLITE_OK)
|
2010-12-05 19:23:19 +01:00
|
|
|
|
throwSQLiteError(db, "setting synchronous mode");
|
2010-02-18 15:30:42 +01:00
|
|
|
|
|
2011-11-07 22:11:59 +01:00
|
|
|
|
/* Set the SQLite journal mode. WAL mode is fastest, so it's the
|
|
|
|
|
default. */
|
2012-07-31 01:55:41 +02:00
|
|
|
|
string mode = settings.useSQLiteWAL ? "wal" : "truncate";
|
2010-09-01 13:36:22 +02:00
|
|
|
|
string prevMode;
|
|
|
|
|
{
|
|
|
|
|
SQLiteStmt stmt;
|
|
|
|
|
stmt.create(db, "pragma main.journal_mode;");
|
|
|
|
|
if (sqlite3_step(stmt) != SQLITE_ROW)
|
2010-12-05 19:23:19 +01:00
|
|
|
|
throwSQLiteError(db, "querying journal mode");
|
2010-09-01 13:36:22 +02:00
|
|
|
|
prevMode = string((const char *) sqlite3_column_text(stmt, 0));
|
|
|
|
|
}
|
|
|
|
|
if (prevMode != mode &&
|
|
|
|
|
sqlite3_exec(db, ("pragma main.journal_mode = " + mode + ";").c_str(), 0, 0, 0) != SQLITE_OK)
|
2010-12-05 19:23:19 +01:00
|
|
|
|
throwSQLiteError(db, "setting journal mode");
|
2010-02-18 15:30:42 +01:00
|
|
|
|
|
2013-06-20 16:01:33 +02:00
|
|
|
|
/* Increase the auto-checkpoint interval to 40000 pages. This
|
2010-08-04 19:35:59 +02:00
|
|
|
|
seems enough to ensure that instantiating the NixOS system
|
|
|
|
|
derivation is done in a single fsync(). */
|
2013-06-20 16:01:33 +02:00
|
|
|
|
if (mode == "wal" && sqlite3_exec(db, "pragma wal_autocheckpoint = 40000;", 0, 0, 0) != SQLITE_OK)
|
2010-12-05 19:23:19 +01:00
|
|
|
|
throwSQLiteError(db, "setting autocheckpoint interval");
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2010-02-24 17:30:20 +01:00
|
|
|
|
/* Initialise the database schema, if necessary. */
|
|
|
|
|
if (create) {
|
2012-10-03 22:54:40 +02:00
|
|
|
|
const char * schema =
|
2010-02-24 17:30:20 +01:00
|
|
|
|
#include "schema.sql.hh"
|
2012-10-03 22:54:40 +02:00
|
|
|
|
;
|
2010-02-24 17:30:20 +01:00
|
|
|
|
if (sqlite3_exec(db, (const char *) schema, 0, 0, 0) != SQLITE_OK)
|
2010-12-05 19:23:19 +01:00
|
|
|
|
throwSQLiteError(db, "initialising database schema");
|
2010-02-24 17:30:20 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Prepare SQL statements. */
|
2016-04-08 18:07:13 +02:00
|
|
|
|
state.stmtRegisterValidPath.create(db,
|
2016-04-07 14:14:06 +02:00
|
|
|
|
"insert into ValidPaths (path, hash, registrationTime, deriver, narSize, ultimate, sigs) values (?, ?, ?, ?, ?, ?, ?);");
|
2016-04-08 18:07:13 +02:00
|
|
|
|
state.stmtUpdatePathInfo.create(db,
|
2016-04-05 15:30:22 +02:00
|
|
|
|
"update ValidPaths set narSize = ?, hash = ?, ultimate = ?, sigs = ? where path = ?;");
|
2016-04-08 18:07:13 +02:00
|
|
|
|
state.stmtAddReference.create(db,
|
2010-02-19 17:04:51 +01:00
|
|
|
|
"insert or replace into Refs (referrer, reference) values (?, ?);");
|
2016-04-08 18:07:13 +02:00
|
|
|
|
state.stmtQueryPathInfo.create(db,
|
2016-03-30 17:35:48 +02:00
|
|
|
|
"select id, hash, registrationTime, deriver, narSize, ultimate, sigs from ValidPaths where path = ?;");
|
2016-04-08 18:07:13 +02:00
|
|
|
|
state.stmtQueryReferences.create(db,
|
2010-02-18 16:52:57 +01:00
|
|
|
|
"select path from Refs join ValidPaths on reference = id where referrer = ?;");
|
2016-04-08 18:07:13 +02:00
|
|
|
|
state.stmtQueryReferrers.create(db,
|
2010-02-18 17:21:59 +01:00
|
|
|
|
"select path from Refs join ValidPaths on referrer = id where reference = (select id from ValidPaths where path = ?);");
|
2016-04-08 18:07:13 +02:00
|
|
|
|
state.stmtInvalidatePath.create(db,
|
2010-02-19 17:43:25 +01:00
|
|
|
|
"delete from ValidPaths where path = ?;");
|
2016-04-08 18:07:13 +02:00
|
|
|
|
state.stmtAddDerivationOutput.create(db,
|
2010-02-22 12:15:50 +01:00
|
|
|
|
"insert or replace into DerivationOutputs (drv, id, path) values (?, ?, ?);");
|
2016-04-08 18:07:13 +02:00
|
|
|
|
state.stmtQueryValidDerivers.create(db,
|
2010-02-22 12:44:17 +01:00
|
|
|
|
"select v.id, v.path from DerivationOutputs d join ValidPaths v on d.drv = v.id where d.path = ?;");
|
2016-04-08 18:07:13 +02:00
|
|
|
|
state.stmtQueryDerivationOutputs.create(db,
|
2010-02-22 13:44:36 +01:00
|
|
|
|
"select id, path from DerivationOutputs where drv = ?;");
|
2012-07-18 00:55:39 +02:00
|
|
|
|
// Use "path >= ?" with limit 1 rather than "path like '?%'" to
|
|
|
|
|
// ensure efficient lookup.
|
2016-04-08 18:07:13 +02:00
|
|
|
|
state.stmtQueryPathFromHashPart.create(db,
|
2012-07-18 00:55:39 +02:00
|
|
|
|
"select path from ValidPaths where path >= ? limit 1;");
|
2016-04-08 18:07:13 +02:00
|
|
|
|
state.stmtQueryValidPaths.create(db, "select path from ValidPaths");
|
2010-02-18 14:16:59 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2012-09-19 21:45:29 +02:00
|
|
|
|
/* To improve purity, users may want to make the Nix store a read-only
|
|
|
|
|
bind mount. So make the Nix store writable for this process. */
|
|
|
|
|
void LocalStore::makeStoreWritable()
|
|
|
|
|
{
|
2015-12-03 16:30:19 +01:00
|
|
|
|
#if __linux__
|
2012-09-19 21:45:29 +02:00
|
|
|
|
if (getuid() != 0) return;
|
makeStoreWritable: Ask forgiveness, not permission
It is surprisingly impossible to check if a mountpoint is a bind mount
on Linux, and in my previous commit I forgot to check if /nix/store was
even a mountpoint at all. statvfs.f_flag is not populated with MS_BIND
(and even if it were, my check was wrong in the previous commit).
Luckily, the semantics of mount with MS_REMOUNT | MS_BIND make both
checks unnecessary: if /nix/store is not a mountpoint, then mount will
fail with EINVAL, and if /nix/store is not a bind-mount, then it will
not be made writable. Thus, if /nix/store is not a mountpoint, we fail
immediately (since we don't know how to make it writable), and if
/nix/store IS a mountpoint but not a bind-mount, we fail at first write
(see below for why we can't check and fail immediately).
Note that, due to what is IMO buggy behavior in Linux, calling mount
with MS_REMOUNT | MS_BIND on a non-bind readonly mount makes the
mountpoint appear writable in two places: In the sixth (but not the
10th!) column of mountinfo, and in the f_flags member of struct statfs.
All other syscalls behave as if the mount point were still readonly (at
least for Linux 3.9-rc1, but I don't think this has changed recently or
is expected to soon). My preferred semantics would be for MS_REMOUNT |
MS_BIND to fail on a non-bind mount, as it doesn't make sense to remount
a non bind-mount as a bind mount.
2013-03-08 04:53:49 +01:00
|
|
|
|
/* Check if /nix/store is on a read-only mount. */
|
2013-03-08 01:39:55 +01:00
|
|
|
|
struct statvfs stat;
|
2014-02-17 14:15:56 +01:00
|
|
|
|
if (statvfs(settings.nixStore.c_str(), &stat) != 0)
|
|
|
|
|
throw SysError("getting info about the Nix store mount point");
|
2012-09-19 21:45:29 +02:00
|
|
|
|
|
makeStoreWritable: Ask forgiveness, not permission
It is surprisingly impossible to check if a mountpoint is a bind mount
on Linux, and in my previous commit I forgot to check if /nix/store was
even a mountpoint at all. statvfs.f_flag is not populated with MS_BIND
(and even if it were, my check was wrong in the previous commit).
Luckily, the semantics of mount with MS_REMOUNT | MS_BIND make both
checks unnecessary: if /nix/store is not a mountpoint, then mount will
fail with EINVAL, and if /nix/store is not a bind-mount, then it will
not be made writable. Thus, if /nix/store is not a mountpoint, we fail
immediately (since we don't know how to make it writable), and if
/nix/store IS a mountpoint but not a bind-mount, we fail at first write
(see below for why we can't check and fail immediately).
Note that, due to what is IMO buggy behavior in Linux, calling mount
with MS_REMOUNT | MS_BIND on a non-bind readonly mount makes the
mountpoint appear writable in two places: In the sixth (but not the
10th!) column of mountinfo, and in the f_flags member of struct statfs.
All other syscalls behave as if the mount point were still readonly (at
least for Linux 3.9-rc1, but I don't think this has changed recently or
is expected to soon). My preferred semantics would be for MS_REMOUNT |
MS_BIND to fail on a non-bind mount, as it doesn't make sense to remount
a non bind-mount as a bind mount.
2013-03-08 04:53:49 +01:00
|
|
|
|
if (stat.f_flag & ST_RDONLY) {
|
2013-03-08 01:39:55 +01:00
|
|
|
|
if (unshare(CLONE_NEWNS) == -1)
|
|
|
|
|
throw SysError("setting up a private mount namespace");
|
2012-09-19 21:45:29 +02:00
|
|
|
|
|
2014-12-12 15:10:02 +01:00
|
|
|
|
if (mount(0, settings.nixStore.c_str(), "none", MS_REMOUNT | MS_BIND, 0) == -1)
|
2013-03-08 01:39:55 +01:00
|
|
|
|
throw SysError(format("remounting %1% writable") % settings.nixStore);
|
|
|
|
|
}
|
2012-09-19 21:45:29 +02:00
|
|
|
|
#endif
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2012-02-15 01:00:30 +01:00
|
|
|
|
const time_t mtimeStore = 1; /* 1 second into the epoch */
|
|
|
|
|
|
|
|
|
|
|
2013-03-08 01:24:59 +01:00
|
|
|
|
static void canonicaliseTimestampAndPermissions(const Path & path, const struct stat & st)
|
2005-01-19 17:39:47 +01:00
|
|
|
|
{
|
|
|
|
|
if (!S_ISLNK(st.st_mode)) {
|
|
|
|
|
|
|
|
|
|
/* Mask out all type related bits. */
|
|
|
|
|
mode_t mode = st.st_mode & ~S_IFMT;
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2005-01-19 17:39:47 +01:00
|
|
|
|
if (mode != 0444 && mode != 0555) {
|
|
|
|
|
mode = (st.st_mode & S_IFMT)
|
|
|
|
|
| 0444
|
|
|
|
|
| (st.st_mode & S_IXUSR ? 0111 : 0);
|
|
|
|
|
if (chmod(path.c_str(), mode) == -1)
|
2014-08-20 17:00:17 +02:00
|
|
|
|
throw SysError(format("changing mode of ‘%1%’ to %2$o") % path % mode);
|
2005-01-19 17:39:47 +01:00
|
|
|
|
}
|
|
|
|
|
|
2012-07-23 22:52:25 +02:00
|
|
|
|
}
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2012-07-23 22:52:25 +02:00
|
|
|
|
if (st.st_mtime != mtimeStore) {
|
|
|
|
|
struct timeval times[2];
|
|
|
|
|
times[0].tv_sec = st.st_atime;
|
|
|
|
|
times[0].tv_usec = 0;
|
|
|
|
|
times[1].tv_sec = mtimeStore;
|
|
|
|
|
times[1].tv_usec = 0;
|
|
|
|
|
#if HAVE_LUTIMES
|
|
|
|
|
if (lutimes(path.c_str(), times) == -1)
|
2012-11-06 05:00:21 +01:00
|
|
|
|
if (errno != ENOSYS ||
|
|
|
|
|
(!S_ISLNK(st.st_mode) && utimes(path.c_str(), times) == -1))
|
2012-07-23 22:52:25 +02:00
|
|
|
|
#else
|
|
|
|
|
if (!S_ISLNK(st.st_mode) && utimes(path.c_str(), times) == -1)
|
2012-07-30 21:42:18 +02:00
|
|
|
|
#endif
|
2014-08-20 17:00:17 +02:00
|
|
|
|
throw SysError(format("changing modification time of ‘%1%’") % path);
|
2005-01-19 17:39:47 +01:00
|
|
|
|
}
|
2013-03-08 01:24:59 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void canonicaliseTimestampAndPermissions(const Path & path)
|
|
|
|
|
{
|
|
|
|
|
struct stat st;
|
|
|
|
|
if (lstat(path.c_str(), &st))
|
2014-08-20 17:00:17 +02:00
|
|
|
|
throw SysError(format("getting attributes of path ‘%1%’") % path);
|
2013-03-08 01:24:59 +01:00
|
|
|
|
canonicaliseTimestampAndPermissions(path, st);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static void canonicalisePathMetaData_(const Path & path, uid_t fromUid, InodesSeen & inodesSeen)
|
|
|
|
|
{
|
|
|
|
|
checkInterrupt();
|
|
|
|
|
|
|
|
|
|
struct stat st;
|
|
|
|
|
if (lstat(path.c_str(), &st))
|
2014-08-20 17:00:17 +02:00
|
|
|
|
throw SysError(format("getting attributes of path ‘%1%’") % path);
|
2013-03-08 01:24:59 +01:00
|
|
|
|
|
2014-10-14 10:51:19 +02:00
|
|
|
|
/* Really make sure that the path is of a supported type. */
|
|
|
|
|
if (!(S_ISREG(st.st_mode) || S_ISDIR(st.st_mode) || S_ISLNK(st.st_mode)))
|
|
|
|
|
throw Error(format("file ‘%1%’ has an unsupported type") % path);
|
2013-03-08 01:24:59 +01:00
|
|
|
|
|
|
|
|
|
/* Fail if the file is not owned by the build user. This prevents
|
|
|
|
|
us from messing up the ownership/permissions of files
|
|
|
|
|
hard-linked into the output (e.g. "ln /etc/shadow $out/foo").
|
|
|
|
|
However, ignore files that we chown'ed ourselves previously to
|
|
|
|
|
ensure that we don't fail on hard links within the same build
|
|
|
|
|
(i.e. "touch $out/foo; ln $out/foo $out/bar"). */
|
|
|
|
|
if (fromUid != (uid_t) -1 && st.st_uid != fromUid) {
|
|
|
|
|
assert(!S_ISDIR(st.st_mode));
|
|
|
|
|
if (inodesSeen.find(Inode(st.st_dev, st.st_ino)) == inodesSeen.end())
|
2014-08-20 17:00:17 +02:00
|
|
|
|
throw BuildError(format("invalid ownership on file ‘%1%’") % path);
|
2013-03-08 01:24:59 +01:00
|
|
|
|
mode_t mode = st.st_mode & ~S_IFMT;
|
|
|
|
|
assert(S_ISLNK(st.st_mode) || (st.st_uid == geteuid() && (mode == 0444 || mode == 0555) && st.st_mtime == mtimeStore));
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
inodesSeen.insert(Inode(st.st_dev, st.st_ino));
|
|
|
|
|
|
|
|
|
|
canonicaliseTimestampAndPermissions(path, st);
|
|
|
|
|
|
|
|
|
|
/* Change ownership to the current uid. If it's a symlink, use
|
|
|
|
|
lchown if available, otherwise don't bother. Wrong ownership
|
|
|
|
|
of a symlink doesn't matter, since the owning user can't change
|
|
|
|
|
the symlink and can't delete it because the directory is not
|
|
|
|
|
writable. The only exception is top-level paths in the Nix
|
|
|
|
|
store (since that directory is group-writable for the Nix build
|
|
|
|
|
users group); we check for this case below. */
|
|
|
|
|
if (st.st_uid != geteuid()) {
|
|
|
|
|
#if HAVE_LCHOWN
|
2016-01-12 17:27:40 +01:00
|
|
|
|
if (lchown(path.c_str(), geteuid(), getegid()) == -1)
|
2013-03-08 01:24:59 +01:00
|
|
|
|
#else
|
|
|
|
|
if (!S_ISLNK(st.st_mode) &&
|
2016-01-12 17:27:40 +01:00
|
|
|
|
chown(path.c_str(), geteuid(), getegid()) == -1)
|
2013-03-08 01:24:59 +01:00
|
|
|
|
#endif
|
2014-08-20 17:00:17 +02:00
|
|
|
|
throw SysError(format("changing owner of ‘%1%’ to %2%")
|
2013-03-08 01:24:59 +01:00
|
|
|
|
% path % geteuid());
|
|
|
|
|
}
|
2005-01-19 17:39:47 +01:00
|
|
|
|
|
2013-03-08 01:24:59 +01:00
|
|
|
|
if (S_ISDIR(st.st_mode)) {
|
2014-08-01 16:37:47 +02:00
|
|
|
|
DirEntries entries = readDirectory(path);
|
|
|
|
|
for (auto & i : entries)
|
|
|
|
|
canonicalisePathMetaData_(path + "/" + i.name, fromUid, inodesSeen);
|
2006-12-09 21:02:27 +01:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2013-06-13 17:29:56 +02:00
|
|
|
|
void canonicalisePathMetaData(const Path & path, uid_t fromUid, InodesSeen & inodesSeen)
|
2006-12-09 21:02:27 +01:00
|
|
|
|
{
|
2013-03-08 01:24:59 +01:00
|
|
|
|
canonicalisePathMetaData_(path, fromUid, inodesSeen);
|
2006-12-09 21:02:27 +01:00
|
|
|
|
|
|
|
|
|
/* On platforms that don't have lchown(), the top-level path can't
|
|
|
|
|
be a symlink, since we can't change its ownership. */
|
|
|
|
|
struct stat st;
|
|
|
|
|
if (lstat(path.c_str(), &st))
|
2014-08-20 17:00:17 +02:00
|
|
|
|
throw SysError(format("getting attributes of path ‘%1%’") % path);
|
2006-12-09 21:02:27 +01:00
|
|
|
|
|
|
|
|
|
if (st.st_uid != geteuid()) {
|
|
|
|
|
assert(S_ISLNK(st.st_mode));
|
2014-08-20 17:00:17 +02:00
|
|
|
|
throw Error(format("wrong ownership of top-level store path ‘%1%’") % path);
|
2005-01-19 17:39:47 +01:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2013-06-13 17:29:56 +02:00
|
|
|
|
void canonicalisePathMetaData(const Path & path, uid_t fromUid)
|
|
|
|
|
{
|
|
|
|
|
InodesSeen inodesSeen;
|
|
|
|
|
canonicalisePathMetaData(path, fromUid, inodesSeen);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2011-07-20 20:10:47 +02:00
|
|
|
|
void LocalStore::checkDerivationOutputs(const Path & drvPath, const Derivation & drv)
|
|
|
|
|
{
|
|
|
|
|
string drvName = storePathToName(drvPath);
|
|
|
|
|
assert(isDerivation(drvName));
|
|
|
|
|
drvName = string(drvName, 0, drvName.size() - drvExtension.size());
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
Eliminate the "store" global variable
Also, move a few free-standing functions into StoreAPI and Derivation.
Also, introduce a non-nullable smart pointer, ref<T>, which is just a
wrapper around std::shared_ptr ensuring that the pointer is never
null. (For reference-counted values, this is better than passing a
"T&", because the latter doesn't maintain the refcount. Usually, the
caller will have a shared_ptr keeping the value alive, but that's not
always the case, e.g., when passing a reference to a std::thread via
std::bind.)
2016-02-04 14:28:26 +01:00
|
|
|
|
if (drv.isFixedOutput()) {
|
2011-07-20 20:10:47 +02:00
|
|
|
|
DerivationOutputs::const_iterator out = drv.outputs.find("out");
|
|
|
|
|
if (out == drv.outputs.end())
|
2014-08-20 17:00:17 +02:00
|
|
|
|
throw Error(format("derivation ‘%1%’ does not have an output named ‘out’") % drvPath);
|
2011-07-20 20:10:47 +02:00
|
|
|
|
|
|
|
|
|
bool recursive; HashType ht; Hash h;
|
|
|
|
|
out->second.parseHashInfo(recursive, ht, h);
|
|
|
|
|
Path outPath = makeFixedOutputPath(recursive, ht, h, drvName);
|
|
|
|
|
|
|
|
|
|
StringPairs::const_iterator j = drv.env.find("out");
|
|
|
|
|
if (out->second.path != outPath || j == drv.env.end() || j->second != outPath)
|
2014-08-20 17:00:17 +02:00
|
|
|
|
throw Error(format("derivation ‘%1%’ has incorrect output ‘%2%’, should be ‘%3%’")
|
2011-07-20 20:10:47 +02:00
|
|
|
|
% drvPath % out->second.path % outPath);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
else {
|
|
|
|
|
Derivation drvCopy(drv);
|
2015-07-17 19:24:28 +02:00
|
|
|
|
for (auto & i : drvCopy.outputs) {
|
|
|
|
|
i.second.path = "";
|
|
|
|
|
drvCopy.env[i.first] = "";
|
2011-07-20 20:10:47 +02:00
|
|
|
|
}
|
|
|
|
|
|
2011-08-31 23:11:50 +02:00
|
|
|
|
Hash h = hashDerivationModulo(*this, drvCopy);
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2015-07-17 19:24:28 +02:00
|
|
|
|
for (auto & i : drv.outputs) {
|
|
|
|
|
Path outPath = makeOutputPath(i.first, h, drvName);
|
|
|
|
|
StringPairs::const_iterator j = drv.env.find(i.first);
|
|
|
|
|
if (i.second.path != outPath || j == drv.env.end() || j->second != outPath)
|
2014-08-20 17:00:17 +02:00
|
|
|
|
throw Error(format("derivation ‘%1%’ has incorrect output ‘%2%’, should be ‘%3%’")
|
2015-07-17 19:24:28 +02:00
|
|
|
|
% drvPath % i.second.path % outPath);
|
2011-07-20 20:10:47 +02:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2016-04-08 18:07:13 +02:00
|
|
|
|
uint64_t LocalStore::addValidPath(State & state,
|
|
|
|
|
const ValidPathInfo & info, bool checkOutputs)
|
2003-10-10 16:46:28 +02:00
|
|
|
|
{
|
2016-04-08 18:07:13 +02:00
|
|
|
|
state.stmtRegisterValidPath.use()
|
2016-03-30 15:50:45 +02:00
|
|
|
|
(info.path)
|
|
|
|
|
("sha256:" + printHash(info.narHash))
|
|
|
|
|
(info.registrationTime == 0 ? time(0) : info.registrationTime)
|
|
|
|
|
(info.deriver, info.deriver != "")
|
|
|
|
|
(info.narSize, info.narSize != 0)
|
2016-03-30 17:35:48 +02:00
|
|
|
|
(info.ultimate ? 1 : 0, info.ultimate)
|
2016-04-07 14:14:06 +02:00
|
|
|
|
(concatStringsSep(" ", info.sigs), !info.sigs.empty())
|
2016-03-30 15:50:45 +02:00
|
|
|
|
.exec();
|
2016-04-08 18:07:13 +02:00
|
|
|
|
uint64_t id = sqlite3_last_insert_rowid(state.db);
|
2010-02-22 12:15:50 +01:00
|
|
|
|
|
|
|
|
|
/* If this is a derivation, then store the derivation outputs in
|
|
|
|
|
the database. This is useful for the garbage collector: it can
|
|
|
|
|
efficiently query whether a path is an output of some
|
|
|
|
|
derivation. */
|
|
|
|
|
if (isDerivation(info.path)) {
|
2014-04-08 19:24:29 +02:00
|
|
|
|
Derivation drv = readDerivation(info.path);
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2011-07-20 20:10:47 +02:00
|
|
|
|
/* Verify that the output paths in the derivation are correct
|
|
|
|
|
(i.e., follow the scheme for computing output paths from
|
|
|
|
|
derivations). Note that if this throws an error, then the
|
|
|
|
|
DB transaction is rolled back, so the path validity
|
|
|
|
|
registration above is undone. */
|
2011-09-12 11:07:43 +02:00
|
|
|
|
if (checkOutputs) checkDerivationOutputs(info.path, drv);
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2015-07-17 19:24:28 +02:00
|
|
|
|
for (auto & i : drv.outputs) {
|
2016-04-08 18:07:13 +02:00
|
|
|
|
state.stmtAddDerivationOutput.use()
|
2016-03-30 15:50:45 +02:00
|
|
|
|
(id)
|
|
|
|
|
(i.first)
|
|
|
|
|
(i.second.path)
|
|
|
|
|
.exec();
|
2010-02-22 12:15:50 +01:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return id;
|
2010-02-19 17:04:51 +01:00
|
|
|
|
}
|
|
|
|
|
|
2008-06-09 15:52:45 +02:00
|
|
|
|
|
|
|
|
|
Hash parseHashField(const Path & path, const string & s)
|
2003-10-10 17:25:21 +02:00
|
|
|
|
{
|
2008-06-09 15:52:45 +02:00
|
|
|
|
string::size_type colon = s.find(':');
|
|
|
|
|
if (colon == string::npos)
|
2014-08-20 17:00:17 +02:00
|
|
|
|
throw Error(format("corrupt hash ‘%1%’ in valid-path entry for ‘%2%’")
|
2008-06-09 15:52:45 +02:00
|
|
|
|
% s % path);
|
|
|
|
|
HashType ht = parseHashType(string(s, 0, colon));
|
|
|
|
|
if (ht == htUnknown)
|
2014-08-20 17:00:17 +02:00
|
|
|
|
throw Error(format("unknown hash type ‘%1%’ in valid-path entry for ‘%2%’")
|
2008-06-09 15:52:45 +02:00
|
|
|
|
% string(s, 0, colon) % path);
|
|
|
|
|
return parseHash(ht, string(s, colon + 1));
|
2003-10-10 17:25:21 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2010-02-18 16:52:57 +01:00
|
|
|
|
ValidPathInfo LocalStore::queryPathInfo(const Path & path)
|
2006-11-30 18:43:04 +01:00
|
|
|
|
{
|
2010-02-19 17:04:51 +01:00
|
|
|
|
ValidPathInfo info;
|
|
|
|
|
info.path = path;
|
2008-06-09 15:52:45 +02:00
|
|
|
|
|
|
|
|
|
assertStorePath(path);
|
|
|
|
|
|
2016-03-30 12:04:27 +02:00
|
|
|
|
return retrySQLite<ValidPathInfo>([&]() {
|
2016-04-08 18:07:13 +02:00
|
|
|
|
auto state(_state.lock());
|
2010-02-19 17:43:25 +01:00
|
|
|
|
|
2013-10-16 15:58:20 +02:00
|
|
|
|
/* Get the path info. */
|
2016-04-08 18:07:13 +02:00
|
|
|
|
auto useQueryPathInfo(state->stmtQueryPathInfo.use()(path));
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2016-03-30 15:50:45 +02:00
|
|
|
|
if (!useQueryPathInfo.next())
|
|
|
|
|
throw Error(format("path ‘%1%’ is not valid") % path);
|
2010-01-29 12:53:58 +01:00
|
|
|
|
|
2016-03-30 15:50:45 +02:00
|
|
|
|
info.id = useQueryPathInfo.getInt(0);
|
2008-06-09 15:52:45 +02:00
|
|
|
|
|
2016-03-30 15:50:45 +02:00
|
|
|
|
info.narHash = parseHashField(path, useQueryPathInfo.getStr(1));
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2016-03-30 15:50:45 +02:00
|
|
|
|
info.registrationTime = useQueryPathInfo.getInt(2);
|
2008-06-09 15:52:45 +02:00
|
|
|
|
|
2016-04-08 18:07:13 +02:00
|
|
|
|
auto s = (const char *) sqlite3_column_text(state->stmtQueryPathInfo, 3);
|
2013-10-16 15:58:20 +02:00
|
|
|
|
if (s) info.deriver = s;
|
2010-11-17 13:40:52 +01:00
|
|
|
|
|
2013-10-16 15:58:20 +02:00
|
|
|
|
/* Note that narSize = NULL yields 0. */
|
2016-03-30 15:50:45 +02:00
|
|
|
|
info.narSize = useQueryPathInfo.getInt(4);
|
2010-02-18 16:52:57 +01:00
|
|
|
|
|
2016-04-08 18:07:13 +02:00
|
|
|
|
info.ultimate = useQueryPathInfo.getInt(5) == 1;
|
2016-03-30 17:35:48 +02:00
|
|
|
|
|
2016-04-08 18:07:13 +02:00
|
|
|
|
s = (const char *) sqlite3_column_text(state->stmtQueryPathInfo, 6);
|
2016-03-30 17:35:48 +02:00
|
|
|
|
if (s) info.sigs = tokenizeString<StringSet>(s, " ");
|
|
|
|
|
|
2013-10-16 15:58:20 +02:00
|
|
|
|
/* Get the references. */
|
2016-04-08 18:07:13 +02:00
|
|
|
|
auto useQueryReferences(state->stmtQueryReferences.use()(info.id));
|
2010-02-18 16:52:57 +01:00
|
|
|
|
|
2016-03-30 15:50:45 +02:00
|
|
|
|
while (useQueryReferences.next())
|
|
|
|
|
info.references.insert(useQueryReferences.getStr(0));
|
2013-10-16 15:58:20 +02:00
|
|
|
|
|
|
|
|
|
return info;
|
2016-03-30 12:04:27 +02:00
|
|
|
|
});
|
2006-11-30 18:43:04 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2016-04-05 15:30:22 +02:00
|
|
|
|
/* Update path info in the database. */
|
2016-04-08 18:07:13 +02:00
|
|
|
|
void LocalStore::updatePathInfo(State & state, const ValidPathInfo & info)
|
2010-12-06 16:29:38 +01:00
|
|
|
|
{
|
2016-04-08 18:07:13 +02:00
|
|
|
|
state.stmtUpdatePathInfo.use()
|
2016-03-30 15:50:45 +02:00
|
|
|
|
(info.narSize, info.narSize != 0)
|
|
|
|
|
("sha256:" + printHash(info.narHash))
|
2016-03-30 17:35:48 +02:00
|
|
|
|
(info.ultimate ? 1 : 0, info.ultimate)
|
2016-04-05 15:30:22 +02:00
|
|
|
|
(concatStringsSep(" ", info.sigs), !info.sigs.empty())
|
2016-03-30 15:50:45 +02:00
|
|
|
|
(info.path)
|
|
|
|
|
.exec();
|
2010-12-06 16:29:38 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2016-04-08 18:07:13 +02:00
|
|
|
|
uint64_t LocalStore::queryValidPathId(State & state, const Path & path)
|
2010-02-24 16:07:23 +01:00
|
|
|
|
{
|
2016-04-08 18:07:13 +02:00
|
|
|
|
auto use(state.stmtQueryPathInfo.use()(path));
|
2016-03-30 15:50:45 +02:00
|
|
|
|
if (!use.next())
|
|
|
|
|
throw Error(format("path ‘%1%’ is not valid") % path);
|
|
|
|
|
return use.getInt(0);
|
2010-02-24 16:07:23 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2016-04-08 18:07:13 +02:00
|
|
|
|
bool LocalStore::isValidPath(State & state, const Path & path)
|
2005-01-19 17:59:56 +01:00
|
|
|
|
{
|
2016-04-08 18:07:13 +02:00
|
|
|
|
return state.stmtQueryPathInfo.use()(path).next();
|
2005-01-19 17:59:56 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2013-10-16 15:58:20 +02:00
|
|
|
|
bool LocalStore::isValidPath(const Path & path)
|
2012-07-11 17:08:47 +02:00
|
|
|
|
{
|
2016-03-30 12:04:27 +02:00
|
|
|
|
return retrySQLite<bool>([&]() {
|
2016-04-08 18:07:13 +02:00
|
|
|
|
auto state(_state.lock());
|
|
|
|
|
return isValidPath(*state, path);
|
2016-03-30 12:04:27 +02:00
|
|
|
|
});
|
2012-07-11 17:08:47 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2013-10-16 15:58:20 +02:00
|
|
|
|
PathSet LocalStore::queryValidPaths(const PathSet & paths)
|
2006-11-30 18:43:04 +01:00
|
|
|
|
{
|
2016-04-08 18:07:13 +02:00
|
|
|
|
PathSet res;
|
|
|
|
|
for (auto & i : paths)
|
|
|
|
|
if (isValidPath(i)) res.insert(i);
|
|
|
|
|
return res;
|
2013-10-16 15:58:20 +02:00
|
|
|
|
}
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
|
|
|
|
|
2013-10-16 15:58:20 +02:00
|
|
|
|
PathSet LocalStore::queryAllValidPaths()
|
|
|
|
|
{
|
2016-03-30 12:04:27 +02:00
|
|
|
|
return retrySQLite<PathSet>([&]() {
|
2016-04-08 18:07:13 +02:00
|
|
|
|
auto state(_state.lock());
|
|
|
|
|
auto use(state->stmtQueryValidPaths.use());
|
2013-10-16 15:58:20 +02:00
|
|
|
|
PathSet res;
|
2016-03-30 15:50:45 +02:00
|
|
|
|
while (use.next()) res.insert(use.getStr(0));
|
2013-10-16 15:58:20 +02:00
|
|
|
|
return res;
|
2016-03-30 12:04:27 +02:00
|
|
|
|
});
|
2006-11-30 18:43:04 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2016-04-08 18:07:13 +02:00
|
|
|
|
void LocalStore::queryReferrers(State & state, const Path & path, PathSet & referrers)
|
2005-02-07 14:40:40 +01:00
|
|
|
|
{
|
2016-04-08 18:07:13 +02:00
|
|
|
|
auto useQueryReferrers(state.stmtQueryReferrers.use()(path));
|
2008-06-09 15:52:45 +02:00
|
|
|
|
|
2016-03-30 15:50:45 +02:00
|
|
|
|
while (useQueryReferrers.next())
|
|
|
|
|
referrers.insert(useQueryReferrers.getStr(0));
|
2005-02-07 14:40:40 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2013-10-16 15:58:20 +02:00
|
|
|
|
void LocalStore::queryReferrers(const Path & path, PathSet & referrers)
|
|
|
|
|
{
|
|
|
|
|
assertStorePath(path);
|
2016-03-30 12:04:27 +02:00
|
|
|
|
return retrySQLite<void>([&]() {
|
2016-04-08 18:07:13 +02:00
|
|
|
|
auto state(_state.lock());
|
|
|
|
|
queryReferrers(*state, path, referrers);
|
2016-03-30 12:04:27 +02:00
|
|
|
|
});
|
2013-10-16 15:58:20 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2007-06-12 18:53:44 +02:00
|
|
|
|
Path LocalStore::queryDeriver(const Path & path)
|
|
|
|
|
{
|
2008-06-09 15:52:45 +02:00
|
|
|
|
return queryPathInfo(path).deriver;
|
2007-06-12 18:53:44 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2010-02-22 12:44:17 +01:00
|
|
|
|
PathSet LocalStore::queryValidDerivers(const Path & path)
|
|
|
|
|
{
|
|
|
|
|
assertStorePath(path);
|
|
|
|
|
|
2016-03-30 12:04:27 +02:00
|
|
|
|
return retrySQLite<PathSet>([&]() {
|
2016-04-08 18:07:13 +02:00
|
|
|
|
auto state(_state.lock());
|
|
|
|
|
|
|
|
|
|
auto useQueryValidDerivers(state->stmtQueryValidDerivers.use()(path));
|
2013-10-16 15:58:20 +02:00
|
|
|
|
|
|
|
|
|
PathSet derivers;
|
2016-03-30 15:50:45 +02:00
|
|
|
|
while (useQueryValidDerivers.next())
|
|
|
|
|
derivers.insert(useQueryValidDerivers.getStr(1));
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2013-10-16 15:58:20 +02:00
|
|
|
|
return derivers;
|
2016-03-30 12:04:27 +02:00
|
|
|
|
});
|
2010-02-22 12:44:17 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2010-02-22 13:44:36 +01:00
|
|
|
|
PathSet LocalStore::queryDerivationOutputs(const Path & path)
|
|
|
|
|
{
|
2016-03-30 12:04:27 +02:00
|
|
|
|
return retrySQLite<PathSet>([&]() {
|
2016-04-08 18:07:13 +02:00
|
|
|
|
auto state(_state.lock());
|
|
|
|
|
|
|
|
|
|
auto useQueryDerivationOutputs(state->stmtQueryDerivationOutputs.use()
|
|
|
|
|
(queryValidPathId(*state, path)));
|
2013-10-16 15:58:20 +02:00
|
|
|
|
|
|
|
|
|
PathSet outputs;
|
2016-03-30 15:50:45 +02:00
|
|
|
|
while (useQueryDerivationOutputs.next())
|
|
|
|
|
outputs.insert(useQueryDerivationOutputs.getStr(1));
|
2010-02-22 13:44:36 +01:00
|
|
|
|
|
2013-10-16 15:58:20 +02:00
|
|
|
|
return outputs;
|
2016-03-30 12:04:27 +02:00
|
|
|
|
});
|
2010-02-22 13:44:36 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2011-11-06 07:28:20 +01:00
|
|
|
|
StringSet LocalStore::queryDerivationOutputNames(const Path & path)
|
|
|
|
|
{
|
2016-03-30 12:04:27 +02:00
|
|
|
|
return retrySQLite<StringSet>([&]() {
|
2016-04-08 18:07:13 +02:00
|
|
|
|
auto state(_state.lock());
|
|
|
|
|
|
|
|
|
|
auto useQueryDerivationOutputs(state->stmtQueryDerivationOutputs.use()
|
|
|
|
|
(queryValidPathId(*state, path)));
|
2013-10-16 15:58:20 +02:00
|
|
|
|
|
|
|
|
|
StringSet outputNames;
|
2016-03-30 15:50:45 +02:00
|
|
|
|
while (useQueryDerivationOutputs.next())
|
|
|
|
|
outputNames.insert(useQueryDerivationOutputs.getStr(0));
|
2011-11-06 07:28:20 +01:00
|
|
|
|
|
2013-10-16 15:58:20 +02:00
|
|
|
|
return outputNames;
|
2016-03-30 12:04:27 +02:00
|
|
|
|
});
|
2011-11-06 07:28:20 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2012-07-18 00:55:39 +02:00
|
|
|
|
Path LocalStore::queryPathFromHashPart(const string & hashPart)
|
|
|
|
|
{
|
2016-02-15 12:49:01 +01:00
|
|
|
|
if (hashPart.size() != storePathHashLen) throw Error("invalid hash part");
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2012-07-31 01:55:41 +02:00
|
|
|
|
Path prefix = settings.nixStore + "/" + hashPart;
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2016-03-30 12:04:27 +02:00
|
|
|
|
return retrySQLite<Path>([&]() {
|
2016-04-08 18:07:13 +02:00
|
|
|
|
auto state(_state.lock());
|
|
|
|
|
|
|
|
|
|
auto useQueryPathFromHashPart(state->stmtQueryPathFromHashPart.use()(prefix));
|
2012-07-18 00:55:39 +02:00
|
|
|
|
|
2016-03-30 15:50:45 +02:00
|
|
|
|
if (!useQueryPathFromHashPart.next()) return "";
|
2012-07-18 00:55:39 +02:00
|
|
|
|
|
2016-04-08 18:07:13 +02:00
|
|
|
|
const char * s = (const char *) sqlite3_column_text(state->stmtQueryPathFromHashPart, 0);
|
2013-10-16 15:58:20 +02:00
|
|
|
|
return s && prefix.compare(0, prefix.size(), s, prefix.size()) == 0 ? s : "";
|
2016-03-30 12:04:27 +02:00
|
|
|
|
});
|
2012-07-18 00:55:39 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2012-11-09 18:00:33 +01:00
|
|
|
|
void LocalStore::setSubstituterEnv()
|
|
|
|
|
{
|
2016-04-08 18:07:13 +02:00
|
|
|
|
static std::atomic_flag done;
|
|
|
|
|
|
|
|
|
|
if (done.test_and_set()) return;
|
2012-11-09 18:00:33 +01:00
|
|
|
|
|
2013-08-10 23:36:16 +02:00
|
|
|
|
/* Pass configuration options (including those overridden with
|
2012-11-09 18:00:33 +01:00
|
|
|
|
--option) to substituters. */
|
|
|
|
|
setenv("_NIX_OPTIONS", settings.pack().c_str(), 1);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2008-08-02 14:54:35 +02:00
|
|
|
|
void LocalStore::startSubstituter(const Path & substituter, RunningSubstituter & run)
|
2003-07-10 17:11:48 +02:00
|
|
|
|
{
|
2013-06-20 11:55:15 +02:00
|
|
|
|
if (run.disabled || run.pid != -1) return;
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2014-08-20 17:00:17 +02:00
|
|
|
|
debug(format("starting substituter program ‘%1%’") % substituter);
|
2008-08-02 14:54:35 +02:00
|
|
|
|
|
2012-08-01 17:19:24 +02:00
|
|
|
|
Pipe toPipe, fromPipe, errorPipe;
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2008-08-02 14:54:35 +02:00
|
|
|
|
toPipe.create();
|
|
|
|
|
fromPipe.create();
|
2012-08-01 17:19:24 +02:00
|
|
|
|
errorPipe.create();
|
2008-08-02 14:54:35 +02:00
|
|
|
|
|
2012-11-09 18:00:33 +01:00
|
|
|
|
setSubstituterEnv();
|
|
|
|
|
|
2014-07-10 16:50:51 +02:00
|
|
|
|
run.pid = startProcess([&]() {
|
|
|
|
|
if (dup2(toPipe.readSide, STDIN_FILENO) == -1)
|
|
|
|
|
throw SysError("dupping stdin");
|
|
|
|
|
if (dup2(fromPipe.writeSide, STDOUT_FILENO) == -1)
|
|
|
|
|
throw SysError("dupping stdout");
|
|
|
|
|
if (dup2(errorPipe.writeSide, STDERR_FILENO) == -1)
|
|
|
|
|
throw SysError("dupping stderr");
|
|
|
|
|
execl(substituter.c_str(), substituter.c_str(), "--query", NULL);
|
2014-08-20 17:00:17 +02:00
|
|
|
|
throw SysError(format("executing ‘%1%’") % substituter);
|
2014-07-10 16:50:51 +02:00
|
|
|
|
});
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2013-06-07 15:02:14 +02:00
|
|
|
|
run.program = baseNameOf(substituter);
|
2009-03-28 20:41:53 +01:00
|
|
|
|
run.to = toPipe.writeSide.borrow();
|
2013-06-07 14:00:23 +02:00
|
|
|
|
run.from = run.fromBuf.fd = fromPipe.readSide.borrow();
|
2012-08-01 17:19:24 +02:00
|
|
|
|
run.error = errorPipe.readSide.borrow();
|
2013-06-20 11:55:15 +02:00
|
|
|
|
|
|
|
|
|
toPipe.readSide.close();
|
|
|
|
|
fromPipe.writeSide.close();
|
|
|
|
|
errorPipe.writeSide.close();
|
|
|
|
|
|
|
|
|
|
/* The substituter may exit right away if it's disabled in any way
|
|
|
|
|
(e.g. copy-from-other-stores.pl will exit if no other stores
|
|
|
|
|
are configured). */
|
|
|
|
|
try {
|
|
|
|
|
getLineFromSubstituter(run);
|
|
|
|
|
} catch (EndOfFile & e) {
|
|
|
|
|
run.to.close();
|
|
|
|
|
run.from.close();
|
|
|
|
|
run.error.close();
|
|
|
|
|
run.disabled = true;
|
|
|
|
|
if (run.pid.wait(true) != 0) throw;
|
|
|
|
|
}
|
2004-06-20 21:17:54 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2013-06-07 15:02:14 +02:00
|
|
|
|
/* Read a line from the substituter's stdout, while also processing
|
|
|
|
|
its stderr. */
|
2013-06-07 14:00:23 +02:00
|
|
|
|
string LocalStore::getLineFromSubstituter(RunningSubstituter & run)
|
2008-08-05 12:57:53 +02:00
|
|
|
|
{
|
2013-06-07 15:02:14 +02:00
|
|
|
|
string res, err;
|
|
|
|
|
|
|
|
|
|
/* We might have stdout data left over from the last time. */
|
|
|
|
|
if (run.fromBuf.hasData()) goto haveData;
|
|
|
|
|
|
2013-06-07 14:00:23 +02:00
|
|
|
|
while (1) {
|
2013-06-20 11:55:15 +02:00
|
|
|
|
checkInterrupt();
|
|
|
|
|
|
2013-06-07 15:02:14 +02:00
|
|
|
|
fd_set fds;
|
|
|
|
|
FD_ZERO(&fds);
|
|
|
|
|
FD_SET(run.from, &fds);
|
|
|
|
|
FD_SET(run.error, &fds);
|
|
|
|
|
|
|
|
|
|
/* Wait for data to appear on the substituter's stdout or
|
|
|
|
|
stderr. */
|
|
|
|
|
if (select(run.from > run.error ? run.from + 1 : run.error + 1, &fds, 0, 0, 0) == -1) {
|
|
|
|
|
if (errno == EINTR) continue;
|
|
|
|
|
throw SysError("waiting for input from the substituter");
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Completely drain stderr before dealing with stdout. */
|
|
|
|
|
if (FD_ISSET(run.error, &fds)) {
|
|
|
|
|
char buf[4096];
|
|
|
|
|
ssize_t n = read(run.error, (unsigned char *) buf, sizeof(buf));
|
|
|
|
|
if (n == -1) {
|
|
|
|
|
if (errno == EINTR) continue;
|
|
|
|
|
throw SysError("reading from substituter's stderr");
|
|
|
|
|
}
|
2014-08-20 17:00:17 +02:00
|
|
|
|
if (n == 0) throw EndOfFile(format("substituter ‘%1%’ died unexpectedly") % run.program);
|
2013-06-07 15:02:14 +02:00
|
|
|
|
err.append(buf, n);
|
|
|
|
|
string::size_type p;
|
|
|
|
|
while ((p = err.find('\n')) != string::npos) {
|
|
|
|
|
printMsg(lvlError, run.program + ": " + string(err, 0, p));
|
|
|
|
|
err = string(err, p + 1);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Read from stdout until we get a newline or the buffer is empty. */
|
|
|
|
|
else if (run.fromBuf.hasData() || FD_ISSET(run.from, &fds)) {
|
|
|
|
|
haveData:
|
|
|
|
|
do {
|
|
|
|
|
unsigned char c;
|
|
|
|
|
run.fromBuf(&c, 1);
|
|
|
|
|
if (c == '\n') {
|
|
|
|
|
if (!err.empty()) printMsg(lvlError, run.program + ": " + err);
|
|
|
|
|
return res;
|
|
|
|
|
}
|
|
|
|
|
res += c;
|
|
|
|
|
} while (run.fromBuf.hasData());
|
|
|
|
|
}
|
2013-06-07 14:00:23 +02:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
template<class T> T LocalStore::getIntLineFromSubstituter(RunningSubstituter & run)
|
|
|
|
|
{
|
|
|
|
|
string s = getLineFromSubstituter(run);
|
2008-08-05 12:57:53 +02:00
|
|
|
|
T res;
|
2009-03-28 20:41:53 +01:00
|
|
|
|
if (!string2Int(s, res)) throw Error("integer expected from stream");
|
2008-08-05 12:57:53 +02:00
|
|
|
|
return res;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2012-07-11 23:52:18 +02:00
|
|
|
|
PathSet LocalStore::querySubstitutablePaths(const PathSet & paths)
|
2004-06-20 21:17:54 +02:00
|
|
|
|
{
|
2016-04-08 18:07:13 +02:00
|
|
|
|
auto state(_state.lock());
|
|
|
|
|
|
2012-07-11 23:52:18 +02:00
|
|
|
|
PathSet res;
|
2015-07-17 19:24:28 +02:00
|
|
|
|
for (auto & i : settings.substituters) {
|
2012-07-11 23:52:18 +02:00
|
|
|
|
if (res.size() == paths.size()) break;
|
2016-04-08 18:07:13 +02:00
|
|
|
|
RunningSubstituter & run(state->runningSubstituters[i]);
|
2015-07-17 19:24:28 +02:00
|
|
|
|
startSubstituter(i, run);
|
2013-06-20 11:55:15 +02:00
|
|
|
|
if (run.disabled) continue;
|
2012-07-11 23:52:18 +02:00
|
|
|
|
string s = "have ";
|
2015-07-17 19:24:28 +02:00
|
|
|
|
for (auto & j : paths)
|
|
|
|
|
if (res.find(j) == res.end()) { s += j; s += " "; }
|
2012-07-11 23:52:18 +02:00
|
|
|
|
writeLine(run.to, s);
|
|
|
|
|
while (true) {
|
2012-08-01 17:19:24 +02:00
|
|
|
|
/* FIXME: we only read stderr when an error occurs, so
|
|
|
|
|
substituters should only write (short) messages to
|
|
|
|
|
stderr when they fail. I.e. they shouldn't write debug
|
|
|
|
|
output. */
|
2013-06-07 15:10:23 +02:00
|
|
|
|
Path path = getLineFromSubstituter(run);
|
|
|
|
|
if (path == "") break;
|
|
|
|
|
res.insert(path);
|
2012-07-11 23:52:18 +02:00
|
|
|
|
}
|
2008-08-02 14:54:35 +02:00
|
|
|
|
}
|
2016-04-08 18:07:13 +02:00
|
|
|
|
|
2012-07-11 23:52:18 +02:00
|
|
|
|
return res;
|
2008-08-02 14:54:35 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
download-from-binary-cache: parallelise fetching of NAR info files
Getting substitute information using the binary cache substituter has
non-trivial latency overhead. A package or NixOS system configuration
can have hundreds of dependencies, and in the worst case (when the
local info cache is empty) we have to do a separate HTTP request for
each of these. If the ping time to the server is t, getting N info
files will take tN seconds; e.g., with a ping time of 0.1s to
nixos.org, sequentially downloading 1000 info files (a typical NixOS
config) will take at least 100 seconds.
To fix this problem, the binary cache substituter can now perform
requests in parallel. This required changing the substituter
interface to support a function querySubstitutablePathInfos() that
queries multiple paths at the same time, and rewriting queryMissing()
to take advantage of parallelism. (Due to local caching,
parallelising queryMissing() is sufficient for most use cases, since
it's almost always called before building a derivation and thus fills
the local info cache.)
For example, parallelism speeds up querying all 1056 paths in a
particular NixOS system configuration from 116s to 2.6s. It works so
well because the eccentricity of the top-level derivation in the
dependency graph is only 9. So we only need 10 round-trips (when
using an unlimited number of parallel connections) to get everything.
Currently we do a maximum of 150 parallel connections to the server.
Thus it's important that the binary cache server (e.g. nixos.org) has
a high connection limit. Alternatively we could use HTTP pipelining,
but WWW::Curl doesn't support it and libcurl has a hard-coded limit of
5 requests per pipeline.
2012-07-07 01:08:20 +02:00
|
|
|
|
void LocalStore::querySubstitutablePathInfos(const Path & substituter,
|
|
|
|
|
PathSet & paths, SubstitutablePathInfos & infos)
|
2008-08-02 14:54:35 +02:00
|
|
|
|
{
|
2016-04-08 18:07:13 +02:00
|
|
|
|
auto state(_state.lock());
|
|
|
|
|
|
|
|
|
|
RunningSubstituter & run(state->runningSubstituters[substituter]);
|
2008-08-04 15:15:35 +02:00
|
|
|
|
startSubstituter(substituter, run);
|
2013-06-20 11:55:15 +02:00
|
|
|
|
if (run.disabled) return;
|
2008-08-02 14:54:35 +02:00
|
|
|
|
|
download-from-binary-cache: parallelise fetching of NAR info files
Getting substitute information using the binary cache substituter has
non-trivial latency overhead. A package or NixOS system configuration
can have hundreds of dependencies, and in the worst case (when the
local info cache is empty) we have to do a separate HTTP request for
each of these. If the ping time to the server is t, getting N info
files will take tN seconds; e.g., with a ping time of 0.1s to
nixos.org, sequentially downloading 1000 info files (a typical NixOS
config) will take at least 100 seconds.
To fix this problem, the binary cache substituter can now perform
requests in parallel. This required changing the substituter
interface to support a function querySubstitutablePathInfos() that
queries multiple paths at the same time, and rewriting queryMissing()
to take advantage of parallelism. (Due to local caching,
parallelising queryMissing() is sufficient for most use cases, since
it's almost always called before building a derivation and thus fills
the local info cache.)
For example, parallelism speeds up querying all 1056 paths in a
particular NixOS system configuration from 116s to 2.6s. It works so
well because the eccentricity of the top-level derivation in the
dependency graph is only 9. So we only need 10 round-trips (when
using an unlimited number of parallel connections) to get everything.
Currently we do a maximum of 150 parallel connections to the server.
Thus it's important that the binary cache server (e.g. nixos.org) has
a high connection limit. Alternatively we could use HTTP pipelining,
but WWW::Curl doesn't support it and libcurl has a hard-coded limit of
5 requests per pipeline.
2012-07-07 01:08:20 +02:00
|
|
|
|
string s = "info ";
|
2015-07-17 19:24:28 +02:00
|
|
|
|
for (auto & i : paths)
|
|
|
|
|
if (infos.find(i) == infos.end()) { s += i; s += " "; }
|
download-from-binary-cache: parallelise fetching of NAR info files
Getting substitute information using the binary cache substituter has
non-trivial latency overhead. A package or NixOS system configuration
can have hundreds of dependencies, and in the worst case (when the
local info cache is empty) we have to do a separate HTTP request for
each of these. If the ping time to the server is t, getting N info
files will take tN seconds; e.g., with a ping time of 0.1s to
nixos.org, sequentially downloading 1000 info files (a typical NixOS
config) will take at least 100 seconds.
To fix this problem, the binary cache substituter can now perform
requests in parallel. This required changing the substituter
interface to support a function querySubstitutablePathInfos() that
queries multiple paths at the same time, and rewriting queryMissing()
to take advantage of parallelism. (Due to local caching,
parallelising queryMissing() is sufficient for most use cases, since
it's almost always called before building a derivation and thus fills
the local info cache.)
For example, parallelism speeds up querying all 1056 paths in a
particular NixOS system configuration from 116s to 2.6s. It works so
well because the eccentricity of the top-level derivation in the
dependency graph is only 9. So we only need 10 round-trips (when
using an unlimited number of parallel connections) to get everything.
Currently we do a maximum of 150 parallel connections to the server.
Thus it's important that the binary cache server (e.g. nixos.org) has
a high connection limit. Alternatively we could use HTTP pipelining,
but WWW::Curl doesn't support it and libcurl has a hard-coded limit of
5 requests per pipeline.
2012-07-07 01:08:20 +02:00
|
|
|
|
writeLine(run.to, s);
|
|
|
|
|
|
|
|
|
|
while (true) {
|
2013-06-07 15:10:23 +02:00
|
|
|
|
Path path = getLineFromSubstituter(run);
|
|
|
|
|
if (path == "") break;
|
|
|
|
|
if (paths.find(path) == paths.end())
|
2014-08-20 17:00:17 +02:00
|
|
|
|
throw Error(format("got unexpected path ‘%1%’ from substituter") % path);
|
2013-06-07 15:10:23 +02:00
|
|
|
|
paths.erase(path);
|
|
|
|
|
SubstitutablePathInfo & info(infos[path]);
|
|
|
|
|
info.deriver = getLineFromSubstituter(run);
|
|
|
|
|
if (info.deriver != "") assertStorePath(info.deriver);
|
|
|
|
|
int nrRefs = getIntLineFromSubstituter<int>(run);
|
|
|
|
|
while (nrRefs--) {
|
|
|
|
|
Path p = getLineFromSubstituter(run);
|
|
|
|
|
assertStorePath(p);
|
|
|
|
|
info.references.insert(p);
|
download-from-binary-cache: parallelise fetching of NAR info files
Getting substitute information using the binary cache substituter has
non-trivial latency overhead. A package or NixOS system configuration
can have hundreds of dependencies, and in the worst case (when the
local info cache is empty) we have to do a separate HTTP request for
each of these. If the ping time to the server is t, getting N info
files will take tN seconds; e.g., with a ping time of 0.1s to
nixos.org, sequentially downloading 1000 info files (a typical NixOS
config) will take at least 100 seconds.
To fix this problem, the binary cache substituter can now perform
requests in parallel. This required changing the substituter
interface to support a function querySubstitutablePathInfos() that
queries multiple paths at the same time, and rewriting queryMissing()
to take advantage of parallelism. (Due to local caching,
parallelising queryMissing() is sufficient for most use cases, since
it's almost always called before building a derivation and thus fills
the local info cache.)
For example, parallelism speeds up querying all 1056 paths in a
particular NixOS system configuration from 116s to 2.6s. It works so
well because the eccentricity of the top-level derivation in the
dependency graph is only 9. So we only need 10 round-trips (when
using an unlimited number of parallel connections) to get everything.
Currently we do a maximum of 150 parallel connections to the server.
Thus it's important that the binary cache server (e.g. nixos.org) has
a high connection limit. Alternatively we could use HTTP pipelining,
but WWW::Curl doesn't support it and libcurl has a hard-coded limit of
5 requests per pipeline.
2012-07-07 01:08:20 +02:00
|
|
|
|
}
|
2013-06-07 15:10:23 +02:00
|
|
|
|
info.downloadSize = getIntLineFromSubstituter<long long>(run);
|
|
|
|
|
info.narSize = getIntLineFromSubstituter<long long>(run);
|
2008-08-02 14:54:35 +02:00
|
|
|
|
}
|
2008-08-04 15:15:35 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
download-from-binary-cache: parallelise fetching of NAR info files
Getting substitute information using the binary cache substituter has
non-trivial latency overhead. A package or NixOS system configuration
can have hundreds of dependencies, and in the worst case (when the
local info cache is empty) we have to do a separate HTTP request for
each of these. If the ping time to the server is t, getting N info
files will take tN seconds; e.g., with a ping time of 0.1s to
nixos.org, sequentially downloading 1000 info files (a typical NixOS
config) will take at least 100 seconds.
To fix this problem, the binary cache substituter can now perform
requests in parallel. This required changing the substituter
interface to support a function querySubstitutablePathInfos() that
queries multiple paths at the same time, and rewriting queryMissing()
to take advantage of parallelism. (Due to local caching,
parallelising queryMissing() is sufficient for most use cases, since
it's almost always called before building a derivation and thus fills
the local info cache.)
For example, parallelism speeds up querying all 1056 paths in a
particular NixOS system configuration from 116s to 2.6s. It works so
well because the eccentricity of the top-level derivation in the
dependency graph is only 9. So we only need 10 round-trips (when
using an unlimited number of parallel connections) to get everything.
Currently we do a maximum of 150 parallel connections to the server.
Thus it's important that the binary cache server (e.g. nixos.org) has
a high connection limit. Alternatively we could use HTTP pipelining,
but WWW::Curl doesn't support it and libcurl has a hard-coded limit of
5 requests per pipeline.
2012-07-07 01:08:20 +02:00
|
|
|
|
void LocalStore::querySubstitutablePathInfos(const PathSet & paths,
|
|
|
|
|
SubstitutablePathInfos & infos)
|
|
|
|
|
{
|
|
|
|
|
PathSet todo = paths;
|
2015-07-17 19:24:28 +02:00
|
|
|
|
for (auto & i : settings.substituters) {
|
download-from-binary-cache: parallelise fetching of NAR info files
Getting substitute information using the binary cache substituter has
non-trivial latency overhead. A package or NixOS system configuration
can have hundreds of dependencies, and in the worst case (when the
local info cache is empty) we have to do a separate HTTP request for
each of these. If the ping time to the server is t, getting N info
files will take tN seconds; e.g., with a ping time of 0.1s to
nixos.org, sequentially downloading 1000 info files (a typical NixOS
config) will take at least 100 seconds.
To fix this problem, the binary cache substituter can now perform
requests in parallel. This required changing the substituter
interface to support a function querySubstitutablePathInfos() that
queries multiple paths at the same time, and rewriting queryMissing()
to take advantage of parallelism. (Due to local caching,
parallelising queryMissing() is sufficient for most use cases, since
it's almost always called before building a derivation and thus fills
the local info cache.)
For example, parallelism speeds up querying all 1056 paths in a
particular NixOS system configuration from 116s to 2.6s. It works so
well because the eccentricity of the top-level derivation in the
dependency graph is only 9. So we only need 10 round-trips (when
using an unlimited number of parallel connections) to get everything.
Currently we do a maximum of 150 parallel connections to the server.
Thus it's important that the binary cache server (e.g. nixos.org) has
a high connection limit. Alternatively we could use HTTP pipelining,
but WWW::Curl doesn't support it and libcurl has a hard-coded limit of
5 requests per pipeline.
2012-07-07 01:08:20 +02:00
|
|
|
|
if (todo.empty()) break;
|
2015-07-17 19:24:28 +02:00
|
|
|
|
querySubstitutablePathInfos(i, todo, infos);
|
download-from-binary-cache: parallelise fetching of NAR info files
Getting substitute information using the binary cache substituter has
non-trivial latency overhead. A package or NixOS system configuration
can have hundreds of dependencies, and in the worst case (when the
local info cache is empty) we have to do a separate HTTP request for
each of these. If the ping time to the server is t, getting N info
files will take tN seconds; e.g., with a ping time of 0.1s to
nixos.org, sequentially downloading 1000 info files (a typical NixOS
config) will take at least 100 seconds.
To fix this problem, the binary cache substituter can now perform
requests in parallel. This required changing the substituter
interface to support a function querySubstitutablePathInfos() that
queries multiple paths at the same time, and rewriting queryMissing()
to take advantage of parallelism. (Due to local caching,
parallelising queryMissing() is sufficient for most use cases, since
it's almost always called before building a derivation and thus fills
the local info cache.)
For example, parallelism speeds up querying all 1056 paths in a
particular NixOS system configuration from 116s to 2.6s. It works so
well because the eccentricity of the top-level derivation in the
dependency graph is only 9. So we only need 10 round-trips (when
using an unlimited number of parallel connections) to get everything.
Currently we do a maximum of 150 parallel connections to the server.
Thus it's important that the binary cache server (e.g. nixos.org) has
a high connection limit. Alternatively we could use HTTP pipelining,
but WWW::Curl doesn't support it and libcurl has a hard-coded limit of
5 requests per pipeline.
2012-07-07 01:08:20 +02:00
|
|
|
|
}
|
2004-12-20 14:43:32 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2008-06-09 15:52:45 +02:00
|
|
|
|
Hash LocalStore::queryPathHash(const Path & path)
|
2005-02-09 10:50:29 +01:00
|
|
|
|
{
|
2016-02-16 11:49:12 +01:00
|
|
|
|
return queryPathInfo(path).narHash;
|
2005-02-09 10:50:29 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2010-12-14 14:25:20 +01:00
|
|
|
|
void LocalStore::registerValidPath(const ValidPathInfo & info)
|
|
|
|
|
{
|
|
|
|
|
ValidPathInfos infos;
|
|
|
|
|
infos.push_back(info);
|
|
|
|
|
registerValidPaths(infos);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2010-02-24 13:48:00 +01:00
|
|
|
|
void LocalStore::registerValidPaths(const ValidPathInfos & infos)
|
2005-03-02 16:57:06 +01:00
|
|
|
|
{
|
2016-03-30 17:35:48 +02:00
|
|
|
|
/* SQLite will fsync by default, but the new valid paths may not
|
|
|
|
|
be fsync-ed. So some may want to fsync them before registering
|
|
|
|
|
the validity, at the expense of some speed of the path
|
|
|
|
|
registering operation. */
|
2012-07-31 01:55:41 +02:00
|
|
|
|
if (settings.syncBeforeRegistering) sync();
|
2012-03-22 20:05:54 +01:00
|
|
|
|
|
2016-03-30 12:04:27 +02:00
|
|
|
|
return retrySQLite<void>([&]() {
|
2016-04-08 18:07:13 +02:00
|
|
|
|
auto state(_state.lock());
|
|
|
|
|
|
|
|
|
|
SQLiteTxn txn(state->db);
|
2013-10-16 14:46:35 +02:00
|
|
|
|
PathSet paths;
|
|
|
|
|
|
2015-07-17 19:24:28 +02:00
|
|
|
|
for (auto & i : infos) {
|
2016-02-16 11:49:12 +01:00
|
|
|
|
assert(i.narHash.type == htSHA256);
|
2016-04-08 18:07:13 +02:00
|
|
|
|
if (isValidPath(*state, i.path))
|
|
|
|
|
updatePathInfo(*state, i);
|
2013-10-16 14:46:35 +02:00
|
|
|
|
else
|
2016-04-08 18:07:13 +02:00
|
|
|
|
addValidPath(*state, i, false);
|
2015-07-17 19:24:28 +02:00
|
|
|
|
paths.insert(i.path);
|
2013-10-16 14:46:35 +02:00
|
|
|
|
}
|
2005-01-19 17:39:47 +01:00
|
|
|
|
|
2015-07-17 19:24:28 +02:00
|
|
|
|
for (auto & i : infos) {
|
2016-04-08 18:07:13 +02:00
|
|
|
|
auto referrer = queryValidPathId(*state, i.path);
|
2015-07-17 19:24:28 +02:00
|
|
|
|
for (auto & j : i.references)
|
2016-04-08 18:07:13 +02:00
|
|
|
|
state->stmtAddReference.use()(referrer)(queryValidPathId(*state, j)).exec();
|
2010-12-14 14:25:20 +01:00
|
|
|
|
}
|
2013-10-16 14:46:35 +02:00
|
|
|
|
|
2014-02-03 22:36:07 +01:00
|
|
|
|
/* Check that the derivation outputs are correct. We can't do
|
|
|
|
|
this in addValidPath() above, because the references might
|
|
|
|
|
not be valid yet. */
|
2015-07-17 19:24:28 +02:00
|
|
|
|
for (auto & i : infos)
|
|
|
|
|
if (isDerivation(i.path)) {
|
2014-02-03 22:36:07 +01:00
|
|
|
|
// FIXME: inefficient; we already loaded the
|
|
|
|
|
// derivation in addValidPath().
|
2015-07-17 19:24:28 +02:00
|
|
|
|
Derivation drv = readDerivation(i.path);
|
|
|
|
|
checkDerivationOutputs(i.path, drv);
|
2014-02-03 22:36:07 +01:00
|
|
|
|
}
|
|
|
|
|
|
2013-10-16 14:46:35 +02:00
|
|
|
|
/* Do a topological sort of the paths. This will throw an
|
|
|
|
|
error if a cycle is detected and roll back the
|
|
|
|
|
transaction. Cycles can only occur when a derivation
|
|
|
|
|
has multiple outputs. */
|
Eliminate the "store" global variable
Also, move a few free-standing functions into StoreAPI and Derivation.
Also, introduce a non-nullable smart pointer, ref<T>, which is just a
wrapper around std::shared_ptr ensuring that the pointer is never
null. (For reference-counted values, this is better than passing a
"T&", because the latter doesn't maintain the refcount. Usually, the
caller will have a shared_ptr keeping the value alive, but that's not
always the case, e.g., when passing a reference to a std::thread via
std::bind.)
2016-02-04 14:28:26 +01:00
|
|
|
|
topoSortPaths(paths);
|
2013-10-16 14:46:35 +02:00
|
|
|
|
|
|
|
|
|
txn.commit();
|
2016-03-30 12:04:27 +02:00
|
|
|
|
});
|
2003-10-08 17:06:59 +02:00
|
|
|
|
}
|
2003-07-07 11:25:26 +02:00
|
|
|
|
|
2003-07-31 18:05:35 +02:00
|
|
|
|
|
2005-01-31 15:00:43 +01:00
|
|
|
|
/* Invalidate a path. The caller is responsible for checking that
|
2005-12-13 22:04:48 +01:00
|
|
|
|
there are no referrers. */
|
2016-04-08 18:07:13 +02:00
|
|
|
|
void LocalStore::invalidatePath(State & state, const Path & path)
|
2003-07-08 11:54:47 +02:00
|
|
|
|
{
|
2014-08-20 17:00:17 +02:00
|
|
|
|
debug(format("invalidating path ‘%1%’") % path);
|
2010-02-22 15:18:55 +01:00
|
|
|
|
|
2016-04-08 18:07:13 +02:00
|
|
|
|
state.stmtInvalidatePath.use()(path).exec();
|
2008-06-09 15:52:45 +02:00
|
|
|
|
|
2010-02-19 17:43:25 +01:00
|
|
|
|
/* Note that the foreign key constraints on the Refs table take
|
2010-02-22 15:18:55 +01:00
|
|
|
|
care of deleting the references entries for `path'. */
|
2003-07-08 11:54:47 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2008-12-03 19:05:14 +01:00
|
|
|
|
Path LocalStore::addToStoreFromDump(const string & dump, const string & name,
|
2012-10-03 21:09:18 +02:00
|
|
|
|
bool recursive, HashType hashAlgo, bool repair)
|
2003-07-07 11:25:26 +02:00
|
|
|
|
{
|
2008-12-03 19:05:14 +01:00
|
|
|
|
Hash h = hashString(hashAlgo, dump);
|
2008-12-03 16:51:17 +01:00
|
|
|
|
|
2008-12-03 19:05:14 +01:00
|
|
|
|
Path dstPath = makeFixedOutputPath(recursive, hashAlgo, h, name);
|
2003-07-10 17:11:48 +02:00
|
|
|
|
|
2006-12-01 21:51:18 +01:00
|
|
|
|
addTempRoot(dstPath);
|
2005-01-31 11:27:25 +01:00
|
|
|
|
|
2012-10-03 21:09:18 +02:00
|
|
|
|
if (repair || !isValidPath(dstPath)) {
|
2003-07-10 17:11:48 +02:00
|
|
|
|
|
2003-10-08 17:06:59 +02:00
|
|
|
|
/* The first check above is an optimisation to prevent
|
|
|
|
|
unnecessary lock acquisition. */
|
2003-07-22 17:15:15 +02:00
|
|
|
|
|
2006-06-01 20:13:33 +02:00
|
|
|
|
PathLocks outputLock(singleton<PathSet, Path>(dstPath));
|
2003-07-22 17:15:15 +02:00
|
|
|
|
|
2012-10-03 21:09:18 +02:00
|
|
|
|
if (repair || !isValidPath(dstPath)) {
|
2004-06-21 09:46:02 +02:00
|
|
|
|
|
2016-02-24 17:44:12 +01:00
|
|
|
|
deletePath(dstPath);
|
2004-10-25 16:38:23 +02:00
|
|
|
|
|
2008-12-03 16:51:17 +01:00
|
|
|
|
if (recursive) {
|
2008-12-03 19:05:14 +01:00
|
|
|
|
StringSource source(dump);
|
2008-12-03 16:51:17 +01:00
|
|
|
|
restorePath(dstPath, source);
|
|
|
|
|
} else
|
2010-01-29 13:22:58 +01:00
|
|
|
|
writeFile(dstPath, dump);
|
2005-01-14 14:51:38 +01:00
|
|
|
|
|
2013-03-08 01:24:59 +01:00
|
|
|
|
canonicalisePathMetaData(dstPath, -1);
|
2008-12-03 16:51:17 +01:00
|
|
|
|
|
|
|
|
|
/* Register the SHA-256 hash of the NAR serialisation of
|
|
|
|
|
the path in the database. We may just have computed it
|
|
|
|
|
above (if called with recursive == true and hashAlgo ==
|
|
|
|
|
sha256); otherwise, compute it here. */
|
2010-11-16 18:11:46 +01:00
|
|
|
|
HashResult hash;
|
|
|
|
|
if (recursive) {
|
|
|
|
|
hash.first = hashAlgo == htSHA256 ? h : hashString(htSHA256, dump);
|
|
|
|
|
hash.second = dump.size();
|
|
|
|
|
} else
|
|
|
|
|
hash = hashPath(htSHA256, dstPath);
|
2012-07-23 21:02:52 +02:00
|
|
|
|
|
|
|
|
|
optimisePath(dstPath); // FIXME: combine with hashPath()
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2010-11-16 18:11:46 +01:00
|
|
|
|
ValidPathInfo info;
|
|
|
|
|
info.path = dstPath;
|
2016-02-16 11:49:12 +01:00
|
|
|
|
info.narHash = hash.first;
|
2010-11-16 18:11:46 +01:00
|
|
|
|
info.narSize = hash.second;
|
2016-03-30 17:35:48 +02:00
|
|
|
|
info.ultimate = true;
|
2010-11-16 18:11:46 +01:00
|
|
|
|
registerValidPath(info);
|
2003-08-01 11:01:51 +02:00
|
|
|
|
}
|
2003-11-22 19:45:56 +01:00
|
|
|
|
|
|
|
|
|
outputLock.setDeletion(true);
|
2003-06-16 15:33:38 +02:00
|
|
|
|
}
|
2003-08-04 09:09:36 +02:00
|
|
|
|
|
2003-10-08 17:06:59 +02:00
|
|
|
|
return dstPath;
|
2003-06-16 15:33:38 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2015-03-25 17:06:12 +01:00
|
|
|
|
Path LocalStore::addToStore(const string & name, const Path & _srcPath,
|
2012-10-03 21:09:18 +02:00
|
|
|
|
bool recursive, HashType hashAlgo, PathFilter & filter, bool repair)
|
2008-12-03 19:05:14 +01:00
|
|
|
|
{
|
|
|
|
|
Path srcPath(absPath(_srcPath));
|
|
|
|
|
|
|
|
|
|
/* Read the whole path into memory. This is not a very scalable
|
|
|
|
|
method for very large paths, but `copyPath' is mainly used for
|
|
|
|
|
small files. */
|
|
|
|
|
StringSink sink;
|
download-from-binary-cache: parallelise fetching of NAR info files
Getting substitute information using the binary cache substituter has
non-trivial latency overhead. A package or NixOS system configuration
can have hundreds of dependencies, and in the worst case (when the
local info cache is empty) we have to do a separate HTTP request for
each of these. If the ping time to the server is t, getting N info
files will take tN seconds; e.g., with a ping time of 0.1s to
nixos.org, sequentially downloading 1000 info files (a typical NixOS
config) will take at least 100 seconds.
To fix this problem, the binary cache substituter can now perform
requests in parallel. This required changing the substituter
interface to support a function querySubstitutablePathInfos() that
queries multiple paths at the same time, and rewriting queryMissing()
to take advantage of parallelism. (Due to local caching,
parallelising queryMissing() is sufficient for most use cases, since
it's almost always called before building a derivation and thus fills
the local info cache.)
For example, parallelism speeds up querying all 1056 paths in a
particular NixOS system configuration from 116s to 2.6s. It works so
well because the eccentricity of the top-level derivation in the
dependency graph is only 9. So we only need 10 round-trips (when
using an unlimited number of parallel connections) to get everything.
Currently we do a maximum of 150 parallel connections to the server.
Thus it's important that the binary cache server (e.g. nixos.org) has
a high connection limit. Alternatively we could use HTTP pipelining,
but WWW::Curl doesn't support it and libcurl has a hard-coded limit of
5 requests per pipeline.
2012-07-07 01:08:20 +02:00
|
|
|
|
if (recursive)
|
2016-03-22 14:21:45 +01:00
|
|
|
|
dumpPath(srcPath, sink, filter);
|
2008-12-03 19:05:14 +01:00
|
|
|
|
else
|
2016-03-04 16:49:56 +01:00
|
|
|
|
sink.s = make_ref<std::string>(readFile(srcPath));
|
2008-12-03 19:05:14 +01:00
|
|
|
|
|
2016-03-04 16:49:56 +01:00
|
|
|
|
return addToStoreFromDump(*sink.s, name, recursive, hashAlgo, repair);
|
2008-12-03 19:05:14 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2008-12-03 16:06:30 +01:00
|
|
|
|
Path LocalStore::addTextToStore(const string & name, const string & s,
|
2012-10-03 21:09:18 +02:00
|
|
|
|
const PathSet & references, bool repair)
|
2003-10-15 14:42:39 +02:00
|
|
|
|
{
|
2008-12-03 16:06:30 +01:00
|
|
|
|
Path dstPath = computeStorePathForText(name, s, references);
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2006-12-01 21:51:18 +01:00
|
|
|
|
addTempRoot(dstPath);
|
2005-01-31 11:27:25 +01:00
|
|
|
|
|
2012-10-03 21:09:18 +02:00
|
|
|
|
if (repair || !isValidPath(dstPath)) {
|
2003-10-15 14:42:39 +02:00
|
|
|
|
|
2006-06-01 20:13:33 +02:00
|
|
|
|
PathLocks outputLock(singleton<PathSet, Path>(dstPath));
|
2003-10-23 12:51:55 +02:00
|
|
|
|
|
2012-10-03 21:09:18 +02:00
|
|
|
|
if (repair || !isValidPath(dstPath)) {
|
2004-06-21 09:46:02 +02:00
|
|
|
|
|
2016-02-24 17:44:12 +01:00
|
|
|
|
deletePath(dstPath);
|
2004-06-21 09:46:02 +02:00
|
|
|
|
|
2010-01-29 13:22:58 +01:00
|
|
|
|
writeFile(dstPath, s);
|
2003-10-15 14:42:39 +02:00
|
|
|
|
|
2013-03-08 01:24:59 +01:00
|
|
|
|
canonicalisePathMetaData(dstPath, -1);
|
2010-11-16 18:11:46 +01:00
|
|
|
|
|
2016-02-24 17:11:31 +01:00
|
|
|
|
StringSink sink;
|
|
|
|
|
dumpString(s, sink);
|
2016-03-04 16:49:56 +01:00
|
|
|
|
auto hash = hashString(htSHA256, *sink.s);
|
2012-07-23 21:02:52 +02:00
|
|
|
|
|
|
|
|
|
optimisePath(dstPath);
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2010-11-16 18:11:46 +01:00
|
|
|
|
ValidPathInfo info;
|
|
|
|
|
info.path = dstPath;
|
2016-02-24 17:11:31 +01:00
|
|
|
|
info.narHash = hash;
|
2016-03-04 16:49:56 +01:00
|
|
|
|
info.narSize = sink.s->size();
|
2010-11-16 18:11:46 +01:00
|
|
|
|
info.references = references;
|
2016-03-30 17:35:48 +02:00
|
|
|
|
info.ultimate = true;
|
2010-11-16 18:11:46 +01:00
|
|
|
|
registerValidPath(info);
|
2003-10-23 12:51:55 +02:00
|
|
|
|
}
|
2003-11-22 19:45:56 +01:00
|
|
|
|
|
|
|
|
|
outputLock.setDeletion(true);
|
2003-10-15 14:42:39 +02:00
|
|
|
|
}
|
2005-01-14 14:51:38 +01:00
|
|
|
|
|
|
|
|
|
return dstPath;
|
2003-10-15 14:42:39 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2007-02-21 15:31:42 +01:00
|
|
|
|
struct HashAndWriteSink : Sink
|
|
|
|
|
{
|
|
|
|
|
Sink & writeSink;
|
|
|
|
|
HashSink hashSink;
|
|
|
|
|
HashAndWriteSink(Sink & writeSink) : writeSink(writeSink), hashSink(htSHA256)
|
|
|
|
|
{
|
|
|
|
|
}
|
2011-12-15 17:19:53 +01:00
|
|
|
|
virtual void operator () (const unsigned char * data, size_t len)
|
2007-02-21 15:31:42 +01:00
|
|
|
|
{
|
|
|
|
|
writeSink(data, len);
|
2010-03-09 15:32:03 +01:00
|
|
|
|
hashSink(data, len);
|
|
|
|
|
}
|
|
|
|
|
Hash currentHash()
|
|
|
|
|
{
|
2011-12-15 17:19:53 +01:00
|
|
|
|
return hashSink.currentHash().first;
|
2007-02-21 15:31:42 +01:00
|
|
|
|
}
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
2007-02-21 18:51:10 +01:00
|
|
|
|
static void checkSecrecy(const Path & path)
|
|
|
|
|
{
|
|
|
|
|
struct stat st;
|
|
|
|
|
if (stat(path.c_str(), &st))
|
2014-08-20 17:00:17 +02:00
|
|
|
|
throw SysError(format("getting status of ‘%1%’") % path);
|
2007-02-21 18:51:10 +01:00
|
|
|
|
if ((st.st_mode & (S_IRWXG | S_IRWXO)) != 0)
|
2014-08-20 17:00:17 +02:00
|
|
|
|
throw Error(format("file ‘%1%’ should be secret (inaccessible to everybody else)!") % path);
|
2007-02-21 18:51:10 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2007-02-21 00:17:20 +01:00
|
|
|
|
void LocalStore::exportPath(const Path & path, bool sign,
|
|
|
|
|
Sink & sink)
|
|
|
|
|
{
|
|
|
|
|
assertStorePath(path);
|
2007-02-21 15:31:42 +01:00
|
|
|
|
|
2015-07-20 01:52:07 +02:00
|
|
|
|
printMsg(lvlTalkative, format("exporting path ‘%1%’") % path);
|
2014-07-10 21:30:22 +02:00
|
|
|
|
|
2008-03-01 22:05:33 +01:00
|
|
|
|
if (!isValidPath(path))
|
2014-08-20 17:00:17 +02:00
|
|
|
|
throw Error(format("path ‘%1%’ is not valid") % path);
|
2007-02-21 17:23:25 +01:00
|
|
|
|
|
2007-02-21 15:31:42 +01:00
|
|
|
|
HashAndWriteSink hashAndWriteSink(sink);
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2007-02-21 15:31:42 +01:00
|
|
|
|
dumpPath(path, hashAndWriteSink);
|
2007-02-21 00:17:20 +01:00
|
|
|
|
|
2010-03-09 15:32:03 +01:00
|
|
|
|
/* Refuse to export paths that have changed. This prevents
|
2010-08-24 16:25:33 +02:00
|
|
|
|
filesystem corruption from spreading to other machines.
|
|
|
|
|
Don't complain if the stored hash is zero (unknown). */
|
2010-03-09 15:32:03 +01:00
|
|
|
|
Hash hash = hashAndWriteSink.currentHash();
|
|
|
|
|
Hash storedHash = queryPathHash(path);
|
2010-08-24 16:25:33 +02:00
|
|
|
|
if (hash != storedHash && storedHash != Hash(storedHash.type))
|
2014-08-20 17:00:17 +02:00
|
|
|
|
throw Error(format("hash of path ‘%1%’ has changed from ‘%2%’ to ‘%3%’!") % path
|
2010-03-09 15:32:03 +01:00
|
|
|
|
% printHash(storedHash) % printHash(hash));
|
|
|
|
|
|
2007-02-21 00:17:20 +01:00
|
|
|
|
PathSet references;
|
2008-03-01 22:05:33 +01:00
|
|
|
|
queryReferences(path, references);
|
2007-02-21 00:17:20 +01:00
|
|
|
|
|
2016-02-15 14:48:38 +01:00
|
|
|
|
hashAndWriteSink << exportMagic << path << references << queryDeriver(path);
|
2007-02-21 15:31:42 +01:00
|
|
|
|
|
|
|
|
|
if (sign) {
|
2010-03-09 15:32:03 +01:00
|
|
|
|
Hash hash = hashAndWriteSink.currentHash();
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2007-02-21 15:31:42 +01:00
|
|
|
|
Path tmpDir = createTempDir();
|
|
|
|
|
AutoDelete delTmp(tmpDir);
|
|
|
|
|
Path hashFile = tmpDir + "/hash";
|
2010-01-29 13:22:58 +01:00
|
|
|
|
writeFile(hashFile, printHash(hash));
|
2007-02-21 15:31:42 +01:00
|
|
|
|
|
2012-07-31 01:55:41 +02:00
|
|
|
|
Path secretKey = settings.nixConfDir + "/signing-key.sec";
|
2007-02-21 18:51:10 +01:00
|
|
|
|
checkSecrecy(secretKey);
|
|
|
|
|
|
2007-02-21 15:31:42 +01:00
|
|
|
|
Strings args;
|
|
|
|
|
args.push_back("rsautl");
|
|
|
|
|
args.push_back("-sign");
|
|
|
|
|
args.push_back("-inkey");
|
2007-02-21 18:51:10 +01:00
|
|
|
|
args.push_back(secretKey);
|
2007-02-21 15:31:42 +01:00
|
|
|
|
args.push_back("-in");
|
|
|
|
|
args.push_back(hashFile);
|
2007-03-01 14:30:46 +01:00
|
|
|
|
string signature = runProgram(OPENSSL_PATH, true, args);
|
2007-02-21 15:31:42 +01:00
|
|
|
|
|
2015-07-20 01:16:16 +02:00
|
|
|
|
hashAndWriteSink << 1 << signature;
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2007-02-21 15:31:42 +01:00
|
|
|
|
} else
|
2015-07-20 01:16:16 +02:00
|
|
|
|
hashAndWriteSink << 0;
|
2007-02-21 00:17:20 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2007-02-21 16:45:32 +01:00
|
|
|
|
struct HashAndReadSource : Source
|
|
|
|
|
{
|
|
|
|
|
Source & readSource;
|
|
|
|
|
HashSink hashSink;
|
|
|
|
|
bool hashing;
|
|
|
|
|
HashAndReadSource(Source & readSource) : readSource(readSource), hashSink(htSHA256)
|
|
|
|
|
{
|
|
|
|
|
hashing = true;
|
|
|
|
|
}
|
2011-12-16 20:44:13 +01:00
|
|
|
|
size_t read(unsigned char * data, size_t len)
|
2007-02-21 16:45:32 +01:00
|
|
|
|
{
|
2011-12-16 20:44:13 +01:00
|
|
|
|
size_t n = readSource.read(data, len);
|
|
|
|
|
if (hashing) hashSink(data, n);
|
|
|
|
|
return n;
|
2007-02-21 16:45:32 +01:00
|
|
|
|
}
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
2010-06-21 13:08:09 +02:00
|
|
|
|
/* Create a temporary directory in the store that won't be
|
|
|
|
|
garbage-collected. */
|
|
|
|
|
Path LocalStore::createTempDirInStore()
|
|
|
|
|
{
|
|
|
|
|
Path tmpDir;
|
|
|
|
|
do {
|
|
|
|
|
/* There is a slight possibility that `tmpDir' gets deleted by
|
|
|
|
|
the GC between createTempDir() and addTempRoot(), so repeat
|
|
|
|
|
until `tmpDir' exists. */
|
2012-07-31 01:55:41 +02:00
|
|
|
|
tmpDir = createTempDir(settings.nixStore);
|
2010-06-21 13:08:09 +02:00
|
|
|
|
addTempRoot(tmpDir);
|
|
|
|
|
} while (!pathExists(tmpDir));
|
|
|
|
|
return tmpDir;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2007-02-21 16:45:32 +01:00
|
|
|
|
Path LocalStore::importPath(bool requireSignature, Source & source)
|
|
|
|
|
{
|
|
|
|
|
HashAndReadSource hashAndReadSource(source);
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2007-02-21 16:45:32 +01:00
|
|
|
|
/* We don't yet know what store path this archive contains (the
|
|
|
|
|
store path follows the archive data proper), and besides, we
|
|
|
|
|
don't know yet whether the signature is valid. */
|
2010-06-21 13:08:09 +02:00
|
|
|
|
Path tmpDir = createTempDirInStore();
|
|
|
|
|
AutoDelete delTmp(tmpDir);
|
2007-02-21 16:45:32 +01:00
|
|
|
|
Path unpacked = tmpDir + "/unpacked";
|
|
|
|
|
|
|
|
|
|
restorePath(unpacked, hashAndReadSource);
|
|
|
|
|
|
2016-02-15 14:48:38 +01:00
|
|
|
|
uint32_t magic = readInt(hashAndReadSource);
|
|
|
|
|
if (magic != exportMagic)
|
2007-02-21 16:45:32 +01:00
|
|
|
|
throw Error("Nix archive cannot be imported; wrong format");
|
|
|
|
|
|
|
|
|
|
Path dstPath = readStorePath(hashAndReadSource);
|
|
|
|
|
|
2015-07-20 01:52:07 +02:00
|
|
|
|
printMsg(lvlTalkative, format("importing path ‘%1%’") % dstPath);
|
|
|
|
|
|
2011-12-16 23:31:25 +01:00
|
|
|
|
PathSet references = readStorePaths<PathSet>(hashAndReadSource);
|
2007-02-21 16:45:32 +01:00
|
|
|
|
|
2007-02-28 00:18:57 +01:00
|
|
|
|
Path deriver = readString(hashAndReadSource);
|
|
|
|
|
if (deriver != "") assertStorePath(deriver);
|
2007-02-21 16:45:32 +01:00
|
|
|
|
|
2010-11-16 18:11:46 +01:00
|
|
|
|
Hash hash = hashAndReadSource.hashSink.finish().first;
|
2007-02-21 16:45:32 +01:00
|
|
|
|
hashAndReadSource.hashing = false;
|
|
|
|
|
|
|
|
|
|
bool haveSignature = readInt(hashAndReadSource) == 1;
|
|
|
|
|
|
|
|
|
|
if (requireSignature && !haveSignature)
|
2014-08-20 17:00:17 +02:00
|
|
|
|
throw Error(format("imported archive of ‘%1%’ lacks a signature") % dstPath);
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2007-02-21 16:45:32 +01:00
|
|
|
|
if (haveSignature) {
|
|
|
|
|
string signature = readString(hashAndReadSource);
|
|
|
|
|
|
2007-03-01 13:30:24 +01:00
|
|
|
|
if (requireSignature) {
|
|
|
|
|
Path sigFile = tmpDir + "/sig";
|
2010-01-29 13:22:58 +01:00
|
|
|
|
writeFile(sigFile, signature);
|
2007-03-01 13:30:24 +01:00
|
|
|
|
|
|
|
|
|
Strings args;
|
|
|
|
|
args.push_back("rsautl");
|
|
|
|
|
args.push_back("-verify");
|
|
|
|
|
args.push_back("-inkey");
|
2012-07-31 01:55:41 +02:00
|
|
|
|
args.push_back(settings.nixConfDir + "/signing-key.pub");
|
2007-03-01 13:30:24 +01:00
|
|
|
|
args.push_back("-pubin");
|
|
|
|
|
args.push_back("-in");
|
|
|
|
|
args.push_back(sigFile);
|
2007-03-01 14:30:46 +01:00
|
|
|
|
string hash2 = runProgram(OPENSSL_PATH, true, args);
|
2007-03-01 13:30:24 +01:00
|
|
|
|
|
|
|
|
|
/* Note: runProgram() throws an exception if the signature
|
|
|
|
|
is invalid. */
|
|
|
|
|
|
|
|
|
|
if (printHash(hash) != hash2)
|
|
|
|
|
throw Error(
|
|
|
|
|
"signed hash doesn't match actual contents of imported "
|
|
|
|
|
"archive; archive could be corrupt, or someone is trying "
|
|
|
|
|
"to import a Trojan horse");
|
|
|
|
|
}
|
2007-02-21 16:45:32 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Do the actual import. */
|
|
|
|
|
|
|
|
|
|
/* !!! way too much code duplication with addTextToStore() etc. */
|
|
|
|
|
addTempRoot(dstPath);
|
|
|
|
|
|
|
|
|
|
if (!isValidPath(dstPath)) {
|
|
|
|
|
|
2009-02-02 18:24:10 +01:00
|
|
|
|
PathLocks outputLock;
|
|
|
|
|
|
|
|
|
|
/* Lock the output path. But don't lock if we're being called
|
|
|
|
|
from a build hook (whose parent process already acquired a
|
|
|
|
|
lock on this path). */
|
2012-09-19 21:43:23 +02:00
|
|
|
|
Strings locksHeld = tokenizeString<Strings>(getEnv("NIX_HELD_LOCKS"));
|
2009-02-02 18:24:10 +01:00
|
|
|
|
if (find(locksHeld.begin(), locksHeld.end(), dstPath) == locksHeld.end())
|
|
|
|
|
outputLock.lockPaths(singleton<PathSet, Path>(dstPath));
|
2007-02-21 16:45:32 +01:00
|
|
|
|
|
|
|
|
|
if (!isValidPath(dstPath)) {
|
|
|
|
|
|
2016-02-24 17:44:12 +01:00
|
|
|
|
deletePath(dstPath);
|
2007-02-21 16:45:32 +01:00
|
|
|
|
|
|
|
|
|
if (rename(unpacked.c_str(), dstPath.c_str()) == -1)
|
2014-08-20 17:00:17 +02:00
|
|
|
|
throw SysError(format("cannot move ‘%1%’ to ‘%2%’")
|
2007-02-21 16:45:32 +01:00
|
|
|
|
% unpacked % dstPath);
|
|
|
|
|
|
2013-03-08 01:24:59 +01:00
|
|
|
|
canonicalisePathMetaData(dstPath, -1);
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2007-02-21 16:45:32 +01:00
|
|
|
|
/* !!! if we were clever, we could prevent the hashPath()
|
|
|
|
|
here. */
|
2010-11-16 18:11:46 +01:00
|
|
|
|
HashResult hash = hashPath(htSHA256, dstPath);
|
2012-07-23 21:02:52 +02:00
|
|
|
|
|
|
|
|
|
optimisePath(dstPath); // FIXME: combine with hashPath()
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2010-11-16 18:11:46 +01:00
|
|
|
|
ValidPathInfo info;
|
|
|
|
|
info.path = dstPath;
|
2016-02-16 11:49:12 +01:00
|
|
|
|
info.narHash = hash.first;
|
2010-11-16 18:11:46 +01:00
|
|
|
|
info.narSize = hash.second;
|
|
|
|
|
info.references = references;
|
|
|
|
|
info.deriver = deriver != "" && isValidPath(deriver) ? deriver : "";
|
|
|
|
|
registerValidPath(info);
|
2007-02-21 16:45:32 +01:00
|
|
|
|
}
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2007-02-21 16:45:32 +01:00
|
|
|
|
outputLock.setDeletion(true);
|
|
|
|
|
}
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2007-02-21 16:45:32 +01:00
|
|
|
|
return dstPath;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2016-02-26 15:20:10 +01:00
|
|
|
|
Paths LocalStore::importPaths(bool requireSignature, Source & source,
|
|
|
|
|
std::shared_ptr<FSAccessor> accessor)
|
2011-12-16 23:31:25 +01:00
|
|
|
|
{
|
|
|
|
|
Paths res;
|
|
|
|
|
while (true) {
|
|
|
|
|
unsigned long long n = readLongLong(source);
|
|
|
|
|
if (n == 0) break;
|
2014-08-20 17:00:17 +02:00
|
|
|
|
if (n != 1) throw Error("input doesn't look like something created by ‘nix-store --export’");
|
2011-12-16 23:31:25 +01:00
|
|
|
|
res.push_back(importPath(requireSignature, source));
|
|
|
|
|
}
|
|
|
|
|
return res;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2012-03-26 20:43:33 +02:00
|
|
|
|
void LocalStore::invalidatePathChecked(const Path & path)
|
2003-06-23 16:40:49 +02:00
|
|
|
|
{
|
2004-02-14 22:44:18 +01:00
|
|
|
|
assertStorePath(path);
|
2003-07-08 11:54:47 +02:00
|
|
|
|
|
2016-03-30 12:04:27 +02:00
|
|
|
|
retrySQLite<void>([&]() {
|
2016-04-08 18:07:13 +02:00
|
|
|
|
auto state(_state.lock());
|
|
|
|
|
|
|
|
|
|
SQLiteTxn txn(state->db);
|
2010-12-05 19:23:19 +01:00
|
|
|
|
|
2016-04-08 18:07:13 +02:00
|
|
|
|
if (isValidPath(*state, path)) {
|
|
|
|
|
PathSet referrers; queryReferrers(*state, path, referrers);
|
2013-10-16 14:46:35 +02:00
|
|
|
|
referrers.erase(path); /* ignore self-references */
|
|
|
|
|
if (!referrers.empty())
|
2014-08-20 17:00:17 +02:00
|
|
|
|
throw PathInUse(format("cannot delete path ‘%1%’ because it is in use by %2%")
|
2013-10-16 14:46:35 +02:00
|
|
|
|
% path % showPaths(referrers));
|
2016-04-08 18:07:13 +02:00
|
|
|
|
invalidatePath(*state, path);
|
2013-10-16 14:46:35 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
txn.commit();
|
2016-03-30 12:04:27 +02:00
|
|
|
|
});
|
2003-06-23 16:40:49 +02:00
|
|
|
|
}
|
2003-07-17 14:27:55 +02:00
|
|
|
|
|
|
|
|
|
|
2012-10-02 21:04:59 +02:00
|
|
|
|
bool LocalStore::verifyStore(bool checkContents, bool repair)
|
2003-07-17 14:27:55 +02:00
|
|
|
|
{
|
2010-08-31 13:47:31 +02:00
|
|
|
|
printMsg(lvlError, format("reading the Nix store..."));
|
2007-01-14 18:28:30 +01:00
|
|
|
|
|
2012-10-02 21:04:59 +02:00
|
|
|
|
bool errors = false;
|
|
|
|
|
|
2010-08-31 13:47:31 +02:00
|
|
|
|
/* Acquire the global GC lock to prevent a garbage collection. */
|
|
|
|
|
AutoCloseFD fdGCLock = openGCLock(ltWrite);
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2014-08-01 16:37:47 +02:00
|
|
|
|
PathSet store;
|
|
|
|
|
for (auto & i : readDirectory(settings.nixStore)) store.insert(i.name);
|
2010-08-31 13:47:31 +02:00
|
|
|
|
|
|
|
|
|
/* Check whether all valid paths actually exist. */
|
|
|
|
|
printMsg(lvlInfo, "checking path existence...");
|
|
|
|
|
|
2012-07-11 16:49:04 +02:00
|
|
|
|
PathSet validPaths2 = queryAllValidPaths(), validPaths, done;
|
2010-08-31 13:47:31 +02:00
|
|
|
|
|
2015-07-17 19:24:28 +02:00
|
|
|
|
for (auto & i : validPaths2)
|
|
|
|
|
verifyPath(i, store, done, validPaths, repair, errors);
|
2003-07-17 14:27:55 +02:00
|
|
|
|
|
2010-12-06 16:29:38 +01:00
|
|
|
|
/* Release the GC lock so that checking content hashes (which can
|
|
|
|
|
take ages) doesn't block the GC or builds. */
|
|
|
|
|
fdGCLock.close();
|
|
|
|
|
|
2010-02-18 17:51:27 +01:00
|
|
|
|
/* Optionally, check the content hashes (slow). */
|
|
|
|
|
if (checkContents) {
|
2010-08-31 13:47:31 +02:00
|
|
|
|
printMsg(lvlInfo, "checking hashes...");
|
2007-01-14 18:28:30 +01:00
|
|
|
|
|
2011-12-02 18:52:18 +01:00
|
|
|
|
Hash nullHash(htSHA256);
|
|
|
|
|
|
2015-07-17 19:24:28 +02:00
|
|
|
|
for (auto & i : validPaths) {
|
2010-12-06 16:29:38 +01:00
|
|
|
|
try {
|
2015-07-17 19:24:28 +02:00
|
|
|
|
ValidPathInfo info = queryPathInfo(i);
|
2010-12-06 16:29:38 +01:00
|
|
|
|
|
|
|
|
|
/* Check the content hash (optionally - slow). */
|
2015-07-17 19:24:28 +02:00
|
|
|
|
printMsg(lvlTalkative, format("checking contents of ‘%1%’") % i);
|
2016-02-16 11:49:12 +01:00
|
|
|
|
HashResult current = hashPath(info.narHash.type, i);
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2016-02-16 11:49:12 +01:00
|
|
|
|
if (info.narHash != nullHash && info.narHash != current.first) {
|
2014-08-20 17:00:17 +02:00
|
|
|
|
printMsg(lvlError, format("path ‘%1%’ was modified! "
|
|
|
|
|
"expected hash ‘%2%’, got ‘%3%’")
|
2016-02-16 11:49:12 +01:00
|
|
|
|
% i % printHash(info.narHash) % printHash(current.first));
|
2015-07-17 19:24:28 +02:00
|
|
|
|
if (repair) repairPath(i); else errors = true;
|
2010-12-06 16:29:38 +01:00
|
|
|
|
} else {
|
2011-12-02 18:52:18 +01:00
|
|
|
|
|
|
|
|
|
bool update = false;
|
|
|
|
|
|
|
|
|
|
/* Fill in missing hashes. */
|
2016-02-16 11:49:12 +01:00
|
|
|
|
if (info.narHash == nullHash) {
|
2015-07-17 19:24:28 +02:00
|
|
|
|
printMsg(lvlError, format("fixing missing hash on ‘%1%’") % i);
|
2016-02-16 11:49:12 +01:00
|
|
|
|
info.narHash = current.first;
|
2011-12-02 18:52:18 +01:00
|
|
|
|
update = true;
|
|
|
|
|
}
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2010-12-06 16:29:38 +01:00
|
|
|
|
/* Fill in missing narSize fields (from old stores). */
|
|
|
|
|
if (info.narSize == 0) {
|
2015-07-17 19:24:28 +02:00
|
|
|
|
printMsg(lvlError, format("updating size field on ‘%1%’ to %2%") % i % current.second);
|
2010-12-06 16:29:38 +01:00
|
|
|
|
info.narSize = current.second;
|
2012-07-30 21:42:18 +02:00
|
|
|
|
update = true;
|
2010-12-06 16:29:38 +01:00
|
|
|
|
}
|
2011-12-02 18:52:18 +01:00
|
|
|
|
|
2016-04-08 18:07:13 +02:00
|
|
|
|
if (update) {
|
|
|
|
|
auto state(_state.lock());
|
|
|
|
|
updatePathInfo(*state, info);
|
|
|
|
|
}
|
2011-12-02 18:52:18 +01:00
|
|
|
|
|
2010-12-06 16:29:38 +01:00
|
|
|
|
}
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2010-12-06 16:29:38 +01:00
|
|
|
|
} catch (Error & e) {
|
|
|
|
|
/* It's possible that the path got GC'ed, so ignore
|
|
|
|
|
errors on invalid paths. */
|
2015-07-17 19:24:28 +02:00
|
|
|
|
if (isValidPath(i))
|
2012-10-04 16:20:23 +02:00
|
|
|
|
printMsg(lvlError, format("error: %1%") % e.msg());
|
|
|
|
|
else
|
|
|
|
|
printMsg(lvlError, format("warning: %1%") % e.msg());
|
2012-10-02 21:04:59 +02:00
|
|
|
|
errors = true;
|
2010-12-06 16:29:38 +01:00
|
|
|
|
}
|
2005-02-08 14:23:55 +01:00
|
|
|
|
}
|
2007-08-13 13:37:39 +02:00
|
|
|
|
}
|
2012-10-02 21:04:59 +02:00
|
|
|
|
|
|
|
|
|
return errors;
|
2010-02-18 16:11:08 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2010-08-31 13:47:31 +02:00
|
|
|
|
void LocalStore::verifyPath(const Path & path, const PathSet & store,
|
2012-10-02 21:04:59 +02:00
|
|
|
|
PathSet & done, PathSet & validPaths, bool repair, bool & errors)
|
2010-08-31 13:47:31 +02:00
|
|
|
|
{
|
|
|
|
|
checkInterrupt();
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2010-08-31 13:47:31 +02:00
|
|
|
|
if (done.find(path) != done.end()) return;
|
|
|
|
|
done.insert(path);
|
|
|
|
|
|
|
|
|
|
if (!isStorePath(path)) {
|
2014-08-20 17:00:17 +02:00
|
|
|
|
printMsg(lvlError, format("path ‘%1%’ is not in the Nix store") % path);
|
2016-04-08 18:07:13 +02:00
|
|
|
|
auto state(_state.lock());
|
|
|
|
|
invalidatePath(*state, path);
|
2010-08-31 13:47:31 +02:00
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (store.find(baseNameOf(path)) == store.end()) {
|
|
|
|
|
/* Check any referrers first. If we can invalidate them
|
|
|
|
|
first, then we can invalidate this path as well. */
|
|
|
|
|
bool canInvalidate = true;
|
|
|
|
|
PathSet referrers; queryReferrers(path, referrers);
|
2015-07-17 19:24:28 +02:00
|
|
|
|
for (auto & i : referrers)
|
|
|
|
|
if (i != path) {
|
|
|
|
|
verifyPath(i, store, done, validPaths, repair, errors);
|
|
|
|
|
if (validPaths.find(i) != validPaths.end())
|
2010-08-31 13:47:31 +02:00
|
|
|
|
canInvalidate = false;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (canInvalidate) {
|
2014-08-20 17:00:17 +02:00
|
|
|
|
printMsg(lvlError, format("path ‘%1%’ disappeared, removing from database...") % path);
|
2016-04-08 18:07:13 +02:00
|
|
|
|
auto state(_state.lock());
|
|
|
|
|
invalidatePath(*state, path);
|
2012-10-02 21:04:59 +02:00
|
|
|
|
} else {
|
2014-08-20 17:00:17 +02:00
|
|
|
|
printMsg(lvlError, format("path ‘%1%’ disappeared, but it still has valid referrers!") % path);
|
2012-10-02 21:04:59 +02:00
|
|
|
|
if (repair)
|
|
|
|
|
try {
|
|
|
|
|
repairPath(path);
|
|
|
|
|
} catch (Error & e) {
|
|
|
|
|
printMsg(lvlError, format("warning: %1%") % e.msg());
|
|
|
|
|
errors = true;
|
|
|
|
|
}
|
|
|
|
|
else errors = true;
|
|
|
|
|
}
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2010-08-31 13:47:31 +02:00
|
|
|
|
return;
|
|
|
|
|
}
|
2012-07-30 21:42:18 +02:00
|
|
|
|
|
2010-08-31 13:47:31 +02:00
|
|
|
|
validPaths.insert(path);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2013-01-03 12:59:23 +01:00
|
|
|
|
#if defined(FS_IOC_SETFLAGS) && defined(FS_IOC_GETFLAGS) && defined(FS_IMMUTABLE_FL)
|
|
|
|
|
|
|
|
|
|
static void makeMutable(const Path & path)
|
|
|
|
|
{
|
|
|
|
|
checkInterrupt();
|
|
|
|
|
|
|
|
|
|
struct stat st = lstat(path);
|
|
|
|
|
|
|
|
|
|
if (!S_ISDIR(st.st_mode) && !S_ISREG(st.st_mode)) return;
|
|
|
|
|
|
|
|
|
|
if (S_ISDIR(st.st_mode)) {
|
2014-08-01 16:37:47 +02:00
|
|
|
|
for (auto & i : readDirectory(path))
|
|
|
|
|
makeMutable(path + "/" + i.name);
|
2013-01-03 12:59:23 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* The O_NOFOLLOW is important to prevent us from changing the
|
|
|
|
|
mutable bit on the target of a symlink (which would be a
|
|
|
|
|
security hole). */
|
|
|
|
|
AutoCloseFD fd = open(path.c_str(), O_RDONLY | O_NOFOLLOW);
|
|
|
|
|
if (fd == -1) {
|
|
|
|
|
if (errno == ELOOP) return; // it's a symlink
|
2014-08-20 17:00:17 +02:00
|
|
|
|
throw SysError(format("opening file ‘%1%’") % path);
|
2013-01-03 12:59:23 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
unsigned int flags = 0, old;
|
|
|
|
|
|
|
|
|
|
/* Silently ignore errors getting/setting the immutable flag so
|
|
|
|
|
that we work correctly on filesystems that don't support it. */
|
|
|
|
|
if (ioctl(fd, FS_IOC_GETFLAGS, &flags)) return;
|
|
|
|
|
old = flags;
|
|
|
|
|
flags &= ~FS_IMMUTABLE_FL;
|
|
|
|
|
if (old == flags) return;
|
|
|
|
|
if (ioctl(fd, FS_IOC_SETFLAGS, &flags)) return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Upgrade from schema 6 (Nix 0.15) to schema 7 (Nix >= 1.3). */
|
|
|
|
|
void LocalStore::upgradeStore7()
|
|
|
|
|
{
|
|
|
|
|
if (getuid() != 0) return;
|
|
|
|
|
printMsg(lvlError, "removing immutable bits from the Nix store (this may take a while)...");
|
|
|
|
|
makeMutable(settings.nixStore);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#else
|
|
|
|
|
|
|
|
|
|
void LocalStore::upgradeStore7()
|
|
|
|
|
{
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
2012-09-13 20:33:41 +02:00
|
|
|
|
void LocalStore::vacuumDB()
|
|
|
|
|
{
|
2016-04-08 18:07:13 +02:00
|
|
|
|
auto state(_state.lock());
|
|
|
|
|
|
|
|
|
|
if (sqlite3_exec(state->db, "vacuum;", 0, 0, 0) != SQLITE_OK)
|
|
|
|
|
throwSQLiteError(state->db, "vacuuming SQLite database");
|
2012-09-13 20:33:41 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2016-04-05 15:30:22 +02:00
|
|
|
|
void LocalStore::addSignatures(const Path & storePath, const StringSet & sigs)
|
|
|
|
|
{
|
|
|
|
|
retrySQLite<void>([&]() {
|
2016-04-08 18:07:13 +02:00
|
|
|
|
auto state(_state.lock());
|
|
|
|
|
|
|
|
|
|
SQLiteTxn txn(state->db);
|
2016-04-05 15:30:22 +02:00
|
|
|
|
|
|
|
|
|
auto info = queryPathInfo(storePath);
|
|
|
|
|
|
|
|
|
|
info.sigs.insert(sigs.begin(), sigs.end());
|
|
|
|
|
|
2016-04-08 18:07:13 +02:00
|
|
|
|
updatePathInfo(*state, info);
|
2016-04-05 15:30:22 +02:00
|
|
|
|
|
|
|
|
|
txn.commit();
|
|
|
|
|
});
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2016-04-07 14:14:06 +02:00
|
|
|
|
void LocalStore::signPathInfo(ValidPathInfo & info)
|
|
|
|
|
{
|
|
|
|
|
// FIXME: keep secret keys in memory.
|
|
|
|
|
|
|
|
|
|
auto secretKeyFiles = settings.get("secret-key-files", Strings());
|
|
|
|
|
|
|
|
|
|
for (auto & secretKeyFile : secretKeyFiles) {
|
|
|
|
|
SecretKey secretKey(readFile(secretKeyFile));
|
|
|
|
|
info.sign(secretKey);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2006-09-04 23:06:23 +02:00
|
|
|
|
}
|