2006-11-30 18:43:04 +01:00
|
|
|
#ifndef __STOREAPI_H
|
|
|
|
#define __STOREAPI_H
|
|
|
|
|
|
|
|
#include <string>
|
2006-12-05 02:31:45 +01:00
|
|
|
#include <map>
|
2006-11-30 18:43:04 +01:00
|
|
|
|
|
|
|
#include <boost/shared_ptr.hpp>
|
|
|
|
|
|
|
|
#include "hash.hh"
|
2007-02-21 00:17:20 +01:00
|
|
|
#include "serialise.hh"
|
2006-11-30 18:43:04 +01:00
|
|
|
|
|
|
|
|
|
|
|
namespace nix {
|
|
|
|
|
|
|
|
|
2006-12-05 02:31:45 +01:00
|
|
|
typedef std::map<Path, Path> Roots;
|
|
|
|
|
|
|
|
|
2008-06-18 11:34:17 +02:00
|
|
|
|
|
|
|
|
|
|
|
struct GCOptions
|
|
|
|
{
|
|
|
|
/* Garbage collector operation:
|
|
|
|
|
|
|
|
- `gcReturnRoots': find and return the set of roots for the
|
|
|
|
garbage collector. These are the store paths symlinked to in
|
|
|
|
the `gcroots' directory.
|
|
|
|
|
|
|
|
- `gcReturnLive': return the set of paths reachable from
|
|
|
|
(i.e. in the closure of) the roots.
|
|
|
|
|
|
|
|
- `gcReturnDead': return the set of paths not reachable from
|
|
|
|
the roots.
|
|
|
|
|
|
|
|
- `gcDeleteDead': actually delete the latter set.
|
|
|
|
|
|
|
|
- `gcDeleteSpecific': delete the paths listed in
|
|
|
|
`pathsToDelete', insofar as they are not reachable.
|
|
|
|
*/
|
|
|
|
typedef enum {
|
|
|
|
gcReturnRoots,
|
|
|
|
gcReturnLive,
|
|
|
|
gcReturnDead,
|
|
|
|
gcDeleteDead,
|
|
|
|
gcDeleteSpecific,
|
|
|
|
} GCAction;
|
|
|
|
|
|
|
|
GCAction action;
|
|
|
|
|
|
|
|
/* If `ignoreLiveness' is set, then reachability from the roots is
|
|
|
|
ignored (dangerous!). However, the paths must still be
|
|
|
|
unreferenced *within* the store (i.e., there can be no other
|
|
|
|
store paths that depend on them). */
|
|
|
|
bool ignoreLiveness;
|
|
|
|
|
|
|
|
/* For `gcDeleteSpecific', the paths to delete. */
|
|
|
|
PathSet pathsToDelete;
|
|
|
|
|
|
|
|
/* Stop after at least `maxFreed' bytes have been freed. */
|
|
|
|
unsigned long long maxFreed;
|
|
|
|
|
|
|
|
/* Stop after the number of hard links to the Nix store directory
|
|
|
|
has dropped to at least `maxLinks'. */
|
|
|
|
unsigned int maxLinks;
|
|
|
|
|
|
|
|
GCOptions()
|
|
|
|
{
|
|
|
|
action = gcDeleteDead;
|
|
|
|
ignoreLiveness = false;
|
|
|
|
maxFreed = ULLONG_MAX;
|
|
|
|
maxLinks = UINT_MAX;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
struct GCResults
|
|
|
|
{
|
|
|
|
/* Depending on the action, the GC roots, or the paths that would
|
|
|
|
be or have been deleted. */
|
|
|
|
PathSet paths;
|
|
|
|
|
|
|
|
/* For `gcReturnDead', `gcDeleteDead' and `gcDeleteSpecific', the
|
|
|
|
number of bytes that would be or was freed. */
|
|
|
|
unsigned long long bytesFreed;
|
|
|
|
|
|
|
|
/* The number of file system blocks that would be or was freed. */
|
|
|
|
unsigned long long blocksFreed;
|
|
|
|
|
|
|
|
GCResults()
|
|
|
|
{
|
|
|
|
bytesFreed = 0;
|
|
|
|
blocksFreed = 0;
|
|
|
|
}
|
|
|
|
};
|
2006-12-05 03:18:46 +01:00
|
|
|
|
|
|
|
|
2006-11-30 18:43:04 +01:00
|
|
|
class StoreAPI
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
|
|
|
|
virtual ~StoreAPI() { }
|
|
|
|
|
|
|
|
/* Checks whether a path is valid. */
|
|
|
|
virtual bool isValidPath(const Path & path) = 0;
|
|
|
|
|
2008-01-29 19:17:36 +01:00
|
|
|
/* Query the set of valid paths. */
|
|
|
|
virtual PathSet queryValidPaths() = 0;
|
|
|
|
|
2006-11-30 18:43:04 +01:00
|
|
|
/* Queries the hash of a valid path. */
|
|
|
|
virtual Hash queryPathHash(const Path & path) = 0;
|
|
|
|
|
|
|
|
/* Queries the set of outgoing FS references for a store path.
|
|
|
|
The result is not cleared. */
|
2006-12-01 19:00:01 +01:00
|
|
|
virtual void queryReferences(const Path & path,
|
2006-11-30 18:43:04 +01:00
|
|
|
PathSet & references) = 0;
|
|
|
|
|
|
|
|
/* Queries the set of incoming FS references for a store path.
|
|
|
|
The result is not cleared. */
|
2006-12-01 19:00:01 +01:00
|
|
|
virtual void queryReferrers(const Path & path,
|
2006-11-30 18:43:04 +01:00
|
|
|
PathSet & referrers) = 0;
|
|
|
|
|
2007-06-12 18:53:44 +02:00
|
|
|
/* Query the deriver of a store path. Return the empty string if
|
|
|
|
no deriver has been set. */
|
|
|
|
virtual Path queryDeriver(const Path & path) = 0;
|
|
|
|
|
2007-08-12 02:29:28 +02:00
|
|
|
/* Query the set of substitutable paths. */
|
|
|
|
virtual PathSet querySubstitutablePaths() = 0;
|
|
|
|
|
|
|
|
/* More efficient variant if we just want to know if a path has
|
|
|
|
substitutes. */
|
|
|
|
virtual bool hasSubstitutes(const Path & path);
|
|
|
|
|
2006-11-30 18:43:04 +01:00
|
|
|
/* Copy the contents of a path to the store and register the
|
2006-12-01 21:51:18 +01:00
|
|
|
validity the resulting path. The resulting path is returned.
|
|
|
|
If `fixed' is true, then the output of a fixed-output
|
2006-12-13 00:05:01 +01:00
|
|
|
derivation is pre-loaded into the Nix store. The function
|
|
|
|
object `filter' can be used to exclude files (see
|
|
|
|
libutil/archive.hh). */
|
2006-12-01 21:51:18 +01:00
|
|
|
virtual Path addToStore(const Path & srcPath, bool fixed = false,
|
2006-12-13 00:05:01 +01:00
|
|
|
bool recursive = false, string hashAlgo = "",
|
|
|
|
PathFilter & filter = defaultPathFilter) = 0;
|
2006-11-30 18:43:04 +01:00
|
|
|
|
|
|
|
/* Like addToStore, but the contents written to the output path is
|
|
|
|
a regular file containing the given string. */
|
|
|
|
virtual Path addTextToStore(const string & suffix, const string & s,
|
|
|
|
const PathSet & references) = 0;
|
2006-11-30 19:02:04 +01:00
|
|
|
|
2007-02-21 00:17:20 +01:00
|
|
|
/* Export a store path, that is, create a NAR dump of the store
|
|
|
|
path and append its references and its deriver. Optionally, a
|
|
|
|
cryptographic signature (created by OpenSSL) of the preceding
|
|
|
|
data is attached. */
|
|
|
|
virtual void exportPath(const Path & path, bool sign,
|
|
|
|
Sink & sink) = 0;
|
|
|
|
|
2007-02-21 16:45:32 +01:00
|
|
|
/* Import a NAR dump created by exportPath() into the Nix
|
|
|
|
store. */
|
|
|
|
virtual Path importPath(bool requireSignature, Source & source) = 0;
|
|
|
|
|
2006-11-30 19:02:04 +01:00
|
|
|
/* Ensure that the output paths of the derivation are valid. If
|
|
|
|
they are already valid, this is a no-op. Otherwise, validity
|
2007-08-12 02:29:28 +02:00
|
|
|
can be reached in two ways. First, if the output paths is
|
|
|
|
substitutable, then build the path that way. Second, the
|
|
|
|
output paths can be created by running the builder, after
|
|
|
|
recursively building any sub-derivations. */
|
2006-11-30 19:02:04 +01:00
|
|
|
virtual void buildDerivations(const PathSet & drvPaths) = 0;
|
|
|
|
|
|
|
|
/* Ensure that a path is valid. If it is not currently valid, it
|
|
|
|
may be made valid by running a substitute (if defined for the
|
|
|
|
path). */
|
2006-12-01 19:00:01 +01:00
|
|
|
virtual void ensurePath(const Path & path) = 0;
|
2006-12-02 17:41:36 +01:00
|
|
|
|
|
|
|
/* Add a store path as a temporary root of the garbage collector.
|
|
|
|
The root disappears as soon as we exit. */
|
|
|
|
virtual void addTempRoot(const Path & path) = 0;
|
|
|
|
|
2006-12-05 00:29:16 +01:00
|
|
|
/* Add an indirect root, which is merely a symlink to `path' from
|
|
|
|
/nix/var/nix/gcroots/auto/<hash of `path'>. `path' is supposed
|
|
|
|
to be a symlink to a store path. The garbage collector will
|
|
|
|
automatically remove the indirect root when it finds that
|
|
|
|
`path' has disappeared. */
|
|
|
|
virtual void addIndirectRoot(const Path & path) = 0;
|
|
|
|
|
2006-12-02 17:41:36 +01:00
|
|
|
/* Acquire the global GC lock, then immediately release it. This
|
|
|
|
function must be called after registering a new permanent root,
|
|
|
|
but before exiting. Otherwise, it is possible that a running
|
|
|
|
garbage collector doesn't see the new root and deletes the
|
|
|
|
stuff we've just built. By acquiring the lock briefly, we
|
|
|
|
ensure that either:
|
|
|
|
|
|
|
|
- The collector is already running, and so we block until the
|
|
|
|
collector is finished. The collector will know about our
|
|
|
|
*temporary* locks, which should include whatever it is we
|
|
|
|
want to register as a permanent lock.
|
|
|
|
|
|
|
|
- The collector isn't running, or it's just started but hasn't
|
|
|
|
acquired the GC lock yet. In that case we get and release
|
|
|
|
the lock right away, then exit. The collector scans the
|
|
|
|
permanent root and sees our's.
|
|
|
|
|
|
|
|
In either case the permanent root is seen by the collector. */
|
|
|
|
virtual void syncWithGC() = 0;
|
|
|
|
|
2006-12-05 02:31:45 +01:00
|
|
|
/* Find the roots of the garbage collector. Each root is a pair
|
|
|
|
(link, storepath) where `link' is the path of the symlink
|
|
|
|
outside of the Nix store that point to `storePath'. */
|
|
|
|
virtual Roots findRoots() = 0;
|
|
|
|
|
2008-06-18 11:34:17 +02:00
|
|
|
/* Perform a garbage collection. */
|
|
|
|
virtual void collectGarbage(const GCOptions & options, GCResults & results) = 0;
|
2006-11-30 18:43:04 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
/* !!! These should be part of the store API, I guess. */
|
|
|
|
|
|
|
|
/* Throw an exception if `path' is not directly in the Nix store. */
|
|
|
|
void assertStorePath(const Path & path);
|
|
|
|
|
|
|
|
bool isInStore(const Path & path);
|
|
|
|
bool isStorePath(const Path & path);
|
|
|
|
|
|
|
|
void checkStoreName(const string & name);
|
|
|
|
|
2007-11-29 17:18:24 +01:00
|
|
|
|
2006-11-30 18:43:04 +01:00
|
|
|
/* Chop off the parts after the top-level store name, e.g.,
|
|
|
|
/nix/store/abcd-foo/bar => /nix/store/abcd-foo. */
|
|
|
|
Path toStorePath(const Path & path);
|
|
|
|
|
|
|
|
|
2007-11-29 17:18:24 +01:00
|
|
|
/* Follow symlinks until we end up with a path in the Nix store. */
|
|
|
|
Path followLinksToStore(const Path & path);
|
|
|
|
|
|
|
|
|
|
|
|
/* Same as followLinksToStore(), but apply toStorePath() to the
|
|
|
|
result. */
|
|
|
|
Path followLinksToStorePath(const Path & path);
|
|
|
|
|
|
|
|
|
2006-11-30 18:43:04 +01:00
|
|
|
/* Constructs a unique store path name. */
|
|
|
|
Path makeStorePath(const string & type,
|
|
|
|
const Hash & hash, const string & suffix);
|
|
|
|
|
|
|
|
Path makeFixedOutputPath(bool recursive,
|
|
|
|
string hashAlgo, Hash hash, string name);
|
|
|
|
|
|
|
|
|
2006-12-01 19:00:01 +01:00
|
|
|
/* This is the preparatory part of addToStore() and addToStoreFixed();
|
|
|
|
it computes the store path to which srcPath is to be copied.
|
|
|
|
Returns the store path and the cryptographic hash of the
|
|
|
|
contents of srcPath. */
|
2006-12-01 21:51:18 +01:00
|
|
|
std::pair<Path, Hash> computeStorePathForPath(const Path & srcPath,
|
2006-12-13 00:05:01 +01:00
|
|
|
bool fixed = false, bool recursive = false, string hashAlgo = "",
|
|
|
|
PathFilter & filter = defaultPathFilter);
|
2006-12-01 19:00:01 +01:00
|
|
|
|
|
|
|
/* Preparatory part of addTextToStore().
|
|
|
|
|
|
|
|
!!! Computation of the path should take the references given to
|
|
|
|
addTextToStore() into account, otherwise we have a (relatively
|
|
|
|
minor) security hole: a caller can register a source file with
|
|
|
|
bogus references. If there are too many references, the path may
|
|
|
|
not be garbage collected when it has to be (not really a problem,
|
|
|
|
the caller could create a root anyway), or it may be garbage
|
|
|
|
collected when it shouldn't be (more serious).
|
|
|
|
|
|
|
|
Hashing the references would solve this (bogus references would
|
|
|
|
simply yield a different store path, so other users wouldn't be
|
|
|
|
affected), but it has some backwards compatibility issues (the
|
|
|
|
hashing scheme changes), so I'm not doing that for now. */
|
2007-01-29 16:51:37 +01:00
|
|
|
Path computeStorePathForText(const string & suffix, const string & s,
|
|
|
|
const PathSet & references);
|
2006-12-01 19:00:01 +01:00
|
|
|
|
|
|
|
|
2006-12-05 03:18:46 +01:00
|
|
|
/* Remove the temporary roots file for this process. Any temporary
|
|
|
|
root becomes garbage after this point unless it has been registered
|
|
|
|
as a (permanent) root. */
|
|
|
|
void removeTempRoots();
|
|
|
|
|
|
|
|
|
|
|
|
/* Register a permanent GC root. */
|
|
|
|
Path addPermRoot(const Path & storePath, const Path & gcRoot,
|
|
|
|
bool indirect, bool allowOutsideRootsDir = false);
|
|
|
|
|
|
|
|
|
2007-02-21 23:45:10 +01:00
|
|
|
/* Sort a set of paths topologically under the references relation.
|
|
|
|
If p refers to q, then p follows q in this list. */
|
|
|
|
Paths topoSortPaths(const PathSet & paths);
|
|
|
|
|
|
|
|
|
2006-11-30 18:43:04 +01:00
|
|
|
/* For now, there is a single global store API object, but we'll
|
|
|
|
purify that in the future. */
|
|
|
|
extern boost::shared_ptr<StoreAPI> store;
|
|
|
|
|
|
|
|
|
|
|
|
/* Factory method: open the Nix database, either through the local or
|
|
|
|
remote implementation. */
|
2008-06-09 15:52:45 +02:00
|
|
|
boost::shared_ptr<StoreAPI> openStore();
|
|
|
|
|
|
|
|
|
|
|
|
/* Display a set of paths in human-readable form (i.e., between quotes
|
|
|
|
and separated by commas). */
|
|
|
|
string showPaths(const PathSet & paths);
|
2006-11-30 18:43:04 +01:00
|
|
|
|
|
|
|
|
2008-01-29 19:17:36 +01:00
|
|
|
string makeValidityRegistration(const PathSet & paths,
|
|
|
|
bool showDerivers, bool showHash);
|
|
|
|
|
2007-08-12 02:29:28 +02:00
|
|
|
struct ValidPathInfo
|
|
|
|
{
|
|
|
|
Path path;
|
|
|
|
Path deriver;
|
|
|
|
Hash hash;
|
|
|
|
PathSet references;
|
2008-06-09 15:52:45 +02:00
|
|
|
time_t registrationTime;
|
|
|
|
ValidPathInfo() : registrationTime(0) { }
|
2007-08-12 02:29:28 +02:00
|
|
|
};
|
|
|
|
|
2008-06-09 15:52:45 +02:00
|
|
|
typedef list<ValidPathInfo> ValidPathInfos;
|
|
|
|
|
2008-01-29 19:17:36 +01:00
|
|
|
ValidPathInfo decodeValidPathInfo(std::istream & str,
|
|
|
|
bool hashGiven = false);
|
2007-08-12 02:29:28 +02:00
|
|
|
|
|
|
|
|
2006-11-30 18:43:04 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
#endif /* !__STOREAPI_H */
|