2003-06-23 15:27:59 +02:00
|
|
|
#include <iostream>
|
|
|
|
|
|
|
|
#include <sys/types.h>
|
|
|
|
#include <sys/wait.h>
|
|
|
|
|
2003-07-07 09:43:58 +02:00
|
|
|
#include "store.hh"
|
2003-06-16 15:33:38 +02:00
|
|
|
#include "globals.hh"
|
|
|
|
#include "db.hh"
|
2003-06-23 15:27:59 +02:00
|
|
|
#include "archive.hh"
|
2003-07-10 17:11:48 +02:00
|
|
|
#include "fstate.hh"
|
2003-06-23 15:27:59 +02:00
|
|
|
|
|
|
|
|
|
|
|
struct CopySink : DumpSink
|
|
|
|
{
|
|
|
|
int fd;
|
|
|
|
virtual void operator () (const unsigned char * data, unsigned int len)
|
|
|
|
{
|
|
|
|
if (write(fd, (char *) data, len) != (ssize_t) len)
|
|
|
|
throw SysError("writing to child");
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
struct CopySource : RestoreSource
|
|
|
|
{
|
|
|
|
int fd;
|
|
|
|
virtual void operator () (const unsigned char * data, unsigned int len)
|
|
|
|
{
|
|
|
|
ssize_t res = read(fd, (char *) data, len);
|
|
|
|
if (res == -1)
|
|
|
|
throw SysError("reading from parent");
|
|
|
|
if (res != (ssize_t) len)
|
|
|
|
throw Error("not enough data available on parent");
|
|
|
|
}
|
|
|
|
};
|
2003-06-16 15:33:38 +02:00
|
|
|
|
|
|
|
|
2003-07-06 16:20:47 +02:00
|
|
|
void copyPath(string src, string dst)
|
2003-06-16 15:33:38 +02:00
|
|
|
{
|
2003-06-23 15:27:59 +02:00
|
|
|
/* Unfortunately C++ doesn't support coprocedures, so we have no
|
|
|
|
nice way to chain CopySink and CopySource together. Instead we
|
|
|
|
fork off a child to run the sink. (Fork-less platforms should
|
|
|
|
use a thread). */
|
|
|
|
|
|
|
|
/* Create a pipe. */
|
|
|
|
int fds[2];
|
|
|
|
if (pipe(fds) == -1) throw SysError("creating pipe");
|
|
|
|
|
|
|
|
/* Fork. */
|
|
|
|
pid_t pid;
|
|
|
|
switch (pid = fork()) {
|
|
|
|
|
|
|
|
case -1:
|
|
|
|
throw SysError("unable to fork");
|
|
|
|
|
|
|
|
case 0: /* child */
|
|
|
|
try {
|
|
|
|
close(fds[1]);
|
|
|
|
CopySource source;
|
|
|
|
source.fd = fds[0];
|
|
|
|
restorePath(dst, source);
|
|
|
|
_exit(0);
|
|
|
|
} catch (exception & e) {
|
|
|
|
cerr << "error: " << e.what() << endl;
|
|
|
|
}
|
|
|
|
_exit(1);
|
|
|
|
}
|
|
|
|
|
|
|
|
close(fds[0]);
|
|
|
|
|
|
|
|
/* Parent. */
|
|
|
|
|
|
|
|
CopySink sink;
|
|
|
|
sink.fd = fds[1];
|
|
|
|
dumpPath(src, sink);
|
|
|
|
|
|
|
|
/* Wait for the child to finish. */
|
|
|
|
int status;
|
|
|
|
if (waitpid(pid, &status, 0) != pid)
|
|
|
|
throw SysError("waiting for child");
|
|
|
|
|
|
|
|
if (!WIFEXITED(status) || WEXITSTATUS(status) != 0)
|
|
|
|
throw Error("cannot copy file: child died");
|
2003-06-16 15:33:38 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2003-07-10 17:11:48 +02:00
|
|
|
void registerSubstitute(const Hash & srcHash, const Hash & subHash)
|
|
|
|
{
|
|
|
|
Strings subs;
|
|
|
|
queryListDB(nixDB, dbSubstitutes, srcHash, subs); /* non-existence = ok */
|
|
|
|
|
|
|
|
for (Strings::iterator it = subs.begin(); it != subs.end(); it++)
|
|
|
|
if (parseHash(*it) == subHash) return;
|
|
|
|
|
|
|
|
subs.push_back(subHash);
|
|
|
|
|
|
|
|
setListDB(nixDB, dbSubstitutes, srcHash, subs);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2003-07-07 11:25:26 +02:00
|
|
|
Hash registerPath(const string & _path, Hash hash)
|
|
|
|
{
|
|
|
|
string path(canonPath(_path));
|
|
|
|
|
|
|
|
if (hash == Hash()) hash = hashPath(path);
|
|
|
|
|
|
|
|
Strings paths;
|
2003-07-08 10:35:06 +02:00
|
|
|
queryListDB(nixDB, dbHash2Paths, hash, paths); /* non-existence = ok */
|
2003-07-07 11:25:26 +02:00
|
|
|
|
|
|
|
for (Strings::iterator it = paths.begin();
|
|
|
|
it != paths.end(); it++)
|
|
|
|
if (*it == path) goto exists;
|
|
|
|
|
|
|
|
paths.push_back(path);
|
|
|
|
|
2003-07-08 10:35:06 +02:00
|
|
|
setListDB(nixDB, dbHash2Paths, hash, paths);
|
2003-07-07 11:25:26 +02:00
|
|
|
|
|
|
|
exists:
|
|
|
|
return hash;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2003-07-08 11:54:47 +02:00
|
|
|
void unregisterPath(const string & _path)
|
|
|
|
{
|
|
|
|
string path(canonPath(_path));
|
|
|
|
|
|
|
|
Hash hash = hashPath(path);
|
|
|
|
|
|
|
|
Strings paths, paths2;
|
|
|
|
queryListDB(nixDB, dbHash2Paths, hash, paths); /* non-existence = ok */
|
|
|
|
|
|
|
|
bool changed = false;
|
|
|
|
for (Strings::iterator it = paths.begin();
|
|
|
|
it != paths.end(); it++)
|
|
|
|
if (*it != path) paths2.push_back(*it); else changed = true;
|
|
|
|
|
|
|
|
if (changed)
|
|
|
|
setListDB(nixDB, dbHash2Paths, hash, paths2);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2003-07-07 11:25:26 +02:00
|
|
|
bool isInPrefix(const string & path, const string & _prefix)
|
|
|
|
{
|
|
|
|
string prefix = canonPath(_prefix + "/");
|
|
|
|
return string(path, 0, prefix.size()) == prefix;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2003-07-10 15:41:28 +02:00
|
|
|
string expandHash(const Hash & hash, const string & target,
|
|
|
|
const string & prefix)
|
2003-07-07 11:25:26 +02:00
|
|
|
{
|
|
|
|
Strings paths;
|
|
|
|
|
2003-07-10 15:41:28 +02:00
|
|
|
if (!target.empty() && !isInPrefix(target, prefix))
|
|
|
|
abort();
|
|
|
|
|
2003-07-10 17:11:48 +02:00
|
|
|
queryListDB(nixDB, dbHash2Paths, hash, paths);
|
2003-07-07 11:25:26 +02:00
|
|
|
|
2003-07-10 15:41:28 +02:00
|
|
|
/* !!! we shouldn't check for staleness by default --- too slow */
|
|
|
|
|
|
|
|
/* Pick one equal to `target'. */
|
|
|
|
if (!target.empty()) {
|
|
|
|
|
|
|
|
for (Strings::iterator i = paths.begin();
|
|
|
|
i != paths.end(); i++)
|
|
|
|
{
|
|
|
|
string path = *i;
|
|
|
|
try {
|
2003-07-13 23:43:57 +02:00
|
|
|
#if 0
|
2003-07-10 15:41:28 +02:00
|
|
|
if (path == target && hashPath(path) == hash)
|
2003-07-13 23:43:57 +02:00
|
|
|
#endif
|
|
|
|
if (path == target && pathExists(path))
|
2003-07-10 15:41:28 +02:00
|
|
|
return path;
|
|
|
|
} catch (Error & e) {
|
|
|
|
debug(format("stale path: %1%") % e.msg());
|
|
|
|
/* try next one */
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
2003-07-07 11:25:26 +02:00
|
|
|
|
2003-07-10 15:41:28 +02:00
|
|
|
/* Arbitrarily pick the first one that exists and isn't stale. */
|
2003-07-07 11:25:26 +02:00
|
|
|
for (Strings::iterator it = paths.begin();
|
|
|
|
it != paths.end(); it++)
|
|
|
|
{
|
|
|
|
string path = *it;
|
|
|
|
try {
|
2003-07-10 15:41:28 +02:00
|
|
|
if (isInPrefix(path, prefix) && hashPath(path) == hash) {
|
|
|
|
if (target.empty())
|
|
|
|
return path;
|
|
|
|
else {
|
|
|
|
copyPath(path, target);
|
|
|
|
return target;
|
|
|
|
}
|
|
|
|
}
|
2003-07-07 11:25:26 +02:00
|
|
|
} catch (Error & e) {
|
2003-07-10 15:41:28 +02:00
|
|
|
debug(format("stale path: %1%") % e.msg());
|
2003-07-07 11:25:26 +02:00
|
|
|
/* try next one */
|
|
|
|
}
|
|
|
|
}
|
2003-07-10 17:11:48 +02:00
|
|
|
|
|
|
|
/* Try to realise the substitutes. */
|
|
|
|
|
|
|
|
Strings subs;
|
|
|
|
queryListDB(nixDB, dbSubstitutes, hash, subs); /* non-existence = ok */
|
|
|
|
|
|
|
|
for (Strings::iterator it = subs.begin(); it != subs.end(); it++) {
|
|
|
|
StringSet dummy;
|
|
|
|
FState nf = realiseFState(hash2fstate(parseHash(*it)), dummy);
|
|
|
|
string path = fstatePath(nf);
|
|
|
|
|
|
|
|
if (hashPath(path) != hash)
|
|
|
|
throw Error(format("bad substitute in `%1%'") % (string) path);
|
|
|
|
|
|
|
|
if (target.empty())
|
|
|
|
return path; /* !!! prefix */
|
|
|
|
else {
|
|
|
|
if (path != target) {
|
|
|
|
copyPath(path, target);
|
|
|
|
registerPath(target, hash);
|
|
|
|
}
|
|
|
|
return target;
|
|
|
|
}
|
|
|
|
}
|
2003-07-07 11:25:26 +02:00
|
|
|
|
2003-07-10 17:11:48 +02:00
|
|
|
throw Error(format("cannot expand hash `%1%'") % (string) hash);
|
2003-07-07 11:25:26 +02:00
|
|
|
}
|
|
|
|
|
2003-07-09 18:12:40 +02:00
|
|
|
|
2003-07-11 10:41:03 +02:00
|
|
|
void addToStore(string srcPath, string & dstPath, Hash & hash,
|
|
|
|
bool deterministicName)
|
2003-06-16 15:33:38 +02:00
|
|
|
{
|
2003-06-27 15:55:12 +02:00
|
|
|
srcPath = absPath(srcPath);
|
|
|
|
hash = hashPath(srcPath);
|
2003-06-16 15:33:38 +02:00
|
|
|
|
2003-07-11 10:41:03 +02:00
|
|
|
string baseName = baseNameOf(srcPath);
|
|
|
|
dstPath = canonPath(nixStore + "/" + (string) hash + "-" + baseName);
|
|
|
|
|
2003-07-07 11:25:26 +02:00
|
|
|
try {
|
2003-07-10 17:11:48 +02:00
|
|
|
/* !!! should not use the substitutes! */
|
2003-07-11 10:41:03 +02:00
|
|
|
dstPath = expandHash(hash, deterministicName ? dstPath : "", nixStore);
|
2003-06-27 15:55:12 +02:00
|
|
|
return;
|
2003-07-07 11:25:26 +02:00
|
|
|
} catch (...) {
|
2003-06-16 15:33:38 +02:00
|
|
|
}
|
2003-07-07 11:25:26 +02:00
|
|
|
|
2003-07-06 16:20:47 +02:00
|
|
|
copyPath(srcPath, dstPath);
|
2003-07-07 11:25:26 +02:00
|
|
|
registerPath(dstPath, hash);
|
2003-06-16 15:33:38 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2003-06-27 16:56:12 +02:00
|
|
|
void deleteFromStore(const string & path)
|
2003-06-23 16:40:49 +02:00
|
|
|
{
|
2003-07-09 18:12:40 +02:00
|
|
|
string prefix = + "/";
|
|
|
|
if (!isInPrefix(path, nixStore))
|
2003-06-27 16:56:12 +02:00
|
|
|
throw Error(format("path %1% is not in the store") % path);
|
2003-07-08 11:54:47 +02:00
|
|
|
|
|
|
|
unregisterPath(path);
|
|
|
|
|
2003-06-27 16:56:12 +02:00
|
|
|
deletePath(path);
|
2003-06-23 16:40:49 +02:00
|
|
|
}
|