2003-07-20 19:29:38 +00:00
|
|
|
#ifndef __NORMALISE_H
|
|
|
|
#define __NORMALISE_H
|
|
|
|
|
2003-11-18 11:22:29 +00:00
|
|
|
#include "storeexpr.hh"
|
2003-07-20 19:29:38 +00:00
|
|
|
|
|
|
|
|
2003-11-18 11:22:29 +00:00
|
|
|
/* Normalise a store expression. That is, if the expression is a
|
2003-10-08 15:06:59 +00:00
|
|
|
derivation, a path containing an equivalent closure expression is
|
|
|
|
returned. This requires that the derivation is performed, unless a
|
|
|
|
successor is known. */
|
2003-11-18 11:22:29 +00:00
|
|
|
Path normaliseStoreExpr(const Path & nePath, PathSet pending = PathSet());
|
2003-07-20 19:29:38 +00:00
|
|
|
|
2003-11-18 11:22:29 +00:00
|
|
|
/* Realise a closure store expression in the file system.
|
2003-10-08 15:06:59 +00:00
|
|
|
|
|
|
|
The pending paths are those that are already being realised. This
|
|
|
|
prevents infinite recursion for paths realised through a substitute
|
|
|
|
(since when we build the substitute, we would first try to realise
|
|
|
|
its output paths through substitutes... kaboom!). */
|
|
|
|
void realiseClosure(const Path & nePath, PathSet pending = PathSet());
|
2003-07-20 19:29:38 +00:00
|
|
|
|
2003-10-16 16:29:57 +00:00
|
|
|
/* Ensure that a path exists, possibly by instantiating it by
|
|
|
|
realising a substitute. */
|
|
|
|
void ensurePath(const Path & path, PathSet pending = PathSet());
|
|
|
|
|
2003-11-18 11:22:29 +00:00
|
|
|
/* Read a store expression, after ensuring its existence through
|
2003-10-16 16:29:57 +00:00
|
|
|
ensurePath(). */
|
2003-11-18 11:22:29 +00:00
|
|
|
StoreExpr storeExprFromPath(const Path & path, PathSet pending = PathSet());
|
2003-10-16 16:29:57 +00:00
|
|
|
|
2003-11-18 11:22:29 +00:00
|
|
|
/* Get the list of root (output) paths of the given store
|
|
|
|
expression. */
|
|
|
|
PathSet storeExprRoots(const Path & nePath);
|
2003-07-20 19:29:38 +00:00
|
|
|
|
2003-11-18 11:22:29 +00:00
|
|
|
/* Get the list of paths that are required to realise the given store
|
2003-07-29 14:28:17 +00:00
|
|
|
expression. For a derive expression, this is the union of
|
2003-11-18 11:22:29 +00:00
|
|
|
requisites of the inputs; for a closure expression, it is the path
|
|
|
|
of each element in the closure. If `includeExprs' is true, include
|
|
|
|
the paths of the store expressions themselves. If
|
|
|
|
`includeSuccessors' is true, include the requisites of
|
|
|
|
successors. */
|
|
|
|
PathSet storeExprRequisites(const Path & nePath,
|
2003-07-29 14:28:17 +00:00
|
|
|
bool includeExprs, bool includeSuccessors);
|
2003-07-21 14:46:01 +00:00
|
|
|
|
2003-11-18 11:22:29 +00:00
|
|
|
/* Return the list of the paths of all known store expressions whose
|
2003-10-08 15:06:59 +00:00
|
|
|
output paths are completely contained in the set `outputs'. */
|
|
|
|
PathSet findGenerators(const PathSet & outputs);
|
2003-07-20 19:29:38 +00:00
|
|
|
|
|
|
|
|
|
|
|
#endif /* !__NORMALISE_H */
|