39 lines
1.3 KiB
C++
39 lines
1.3 KiB
C++
|
#pragma once
|
||
|
|
|
||
|
|
#include "derivations.hh"
|
||
|
|
|
||
|
|
|
||
|
|
namespace nix {
|
||
|
|
|
||
|
|
|
||
|
|
/* Read a derivation, after ensuring its existence through
|
||
|
|
ensurePath(). */
|
||
|
|
Derivation derivationFromPath(StoreAPI & store, const Path & drvPath);
|
||
|
|
|
||
|
|
/* Place in `paths' the set of all store paths in the file system
|
||
|
|
closure of `storePath'; that is, all paths than can be directly or
|
||
|
|
indirectly reached from it. `paths' is not cleared. If
|
||
|
|
`flipDirection' is true, the set of paths that can reach
|
||
|
|
`storePath' is returned; that is, the closures under the
|
||
|
|
`referrers' relation instead of the `references' relation is
|
||
|
|
returned. */
|
||
|
|
void computeFSClosure(StoreAPI & store, const Path & path,
|
||
|
|
PathSet & paths, bool flipDirection = false,
|
||
|
|
bool includeOutputs = false, bool includeDerivers = false);
|
||
|
|
|
||
|
|
/* Return the path corresponding to the output identifier `id' in the
|
||
|
|
given derivation. */
|
||
|
|
Path findOutput(const Derivation & drv, string id);
|
||
|
|
|
||
|
|
/* Given a set of paths that are to be built, return the set of
|
||
|
|
derivations that will be built, and the set of output paths that
|
||
|
|
will be substituted. */
|
||
|
|
void queryMissing(StoreAPI & store, const PathSet & targets,
|
||
|
|
PathSet & willBuild, PathSet & willSubstitute, PathSet & unknown,
|
||
|
|
unsigned long long & downloadSize, unsigned long long & narSize);
|
||
|
|
|
||
|
|
bool willBuildLocally(const Derivation & drv);
|
||
|
|
|
||
|
|
|
||
|
|
}
|