1417 lines
45 KiB
C++
1417 lines
45 KiB
C++
#include "derivations.hh"
|
|
#include "downstream-placeholder.hh"
|
|
#include "store-api.hh"
|
|
#include "globals.hh"
|
|
#include "types.hh"
|
|
#include "split.hh"
|
|
#include "common-protocol.hh"
|
|
#include "common-protocol-impl.hh"
|
|
#include "fs-accessor.hh"
|
|
#include "json-utils.hh"
|
|
#include <boost/container/small_vector.hpp>
|
|
#include <nlohmann/json.hpp>
|
|
|
|
namespace nix {
|
|
|
|
std::optional<StorePath> DerivationOutput::path(const Store & store, std::string_view drvName, OutputNameView outputName) const
|
|
{
|
|
return std::visit(overloaded {
|
|
[](const DerivationOutput::InputAddressed & doi) -> std::optional<StorePath> {
|
|
return { doi.path };
|
|
},
|
|
[&](const DerivationOutput::CAFixed & dof) -> std::optional<StorePath> {
|
|
return {
|
|
dof.path(store, drvName, outputName)
|
|
};
|
|
},
|
|
[](const DerivationOutput::CAFloating & dof) -> std::optional<StorePath> {
|
|
return std::nullopt;
|
|
},
|
|
[](const DerivationOutput::Deferred &) -> std::optional<StorePath> {
|
|
return std::nullopt;
|
|
},
|
|
[](const DerivationOutput::Impure &) -> std::optional<StorePath> {
|
|
return std::nullopt;
|
|
},
|
|
}, raw);
|
|
}
|
|
|
|
|
|
StorePath DerivationOutput::CAFixed::path(const Store & store, std::string_view drvName, OutputNameView outputName) const
|
|
{
|
|
return store.makeFixedOutputPathFromCA(
|
|
outputPathName(drvName, outputName),
|
|
ContentAddressWithReferences::withoutRefs(ca));
|
|
}
|
|
|
|
|
|
bool DerivationType::isCA() const
|
|
{
|
|
/* Normally we do the full `std::visit` to make sure we have
|
|
exhaustively handled all variants, but so long as there is a
|
|
variant called `ContentAddressed`, it must be the only one for
|
|
which `isCA` is true for this to make sense!. */
|
|
return std::visit(overloaded {
|
|
[](const InputAddressed & ia) {
|
|
return false;
|
|
},
|
|
[](const ContentAddressed & ca) {
|
|
return true;
|
|
},
|
|
[](const Impure &) {
|
|
return true;
|
|
},
|
|
}, raw);
|
|
}
|
|
|
|
bool DerivationType::isFixed() const
|
|
{
|
|
return std::visit(overloaded {
|
|
[](const InputAddressed & ia) {
|
|
return false;
|
|
},
|
|
[](const ContentAddressed & ca) {
|
|
return ca.fixed;
|
|
},
|
|
[](const Impure &) {
|
|
return false;
|
|
},
|
|
}, raw);
|
|
}
|
|
|
|
bool DerivationType::hasKnownOutputPaths() const
|
|
{
|
|
return std::visit(overloaded {
|
|
[](const InputAddressed & ia) {
|
|
return !ia.deferred;
|
|
},
|
|
[](const ContentAddressed & ca) {
|
|
return ca.fixed;
|
|
},
|
|
[](const Impure &) {
|
|
return false;
|
|
},
|
|
}, raw);
|
|
}
|
|
|
|
|
|
bool DerivationType::isSandboxed() const
|
|
{
|
|
return std::visit(overloaded {
|
|
[](const InputAddressed & ia) {
|
|
return true;
|
|
},
|
|
[](const ContentAddressed & ca) {
|
|
return ca.sandboxed;
|
|
},
|
|
[](const Impure &) {
|
|
return false;
|
|
},
|
|
}, raw);
|
|
}
|
|
|
|
|
|
bool DerivationType::isPure() const
|
|
{
|
|
return std::visit(overloaded {
|
|
[](const InputAddressed & ia) {
|
|
return true;
|
|
},
|
|
[](const ContentAddressed & ca) {
|
|
return true;
|
|
},
|
|
[](const Impure &) {
|
|
return false;
|
|
},
|
|
}, raw);
|
|
}
|
|
|
|
|
|
bool BasicDerivation::isBuiltin() const
|
|
{
|
|
return builder.substr(0, 8) == "builtin:";
|
|
}
|
|
|
|
|
|
StorePath writeDerivation(Store & store,
|
|
const Derivation & drv, RepairFlag repair, bool readOnly)
|
|
{
|
|
auto references = drv.inputSrcs;
|
|
for (auto & i : drv.inputDrvs.map)
|
|
references.insert(i.first);
|
|
/* Note that the outputs of a derivation are *not* references
|
|
(that can be missing (of course) and should not necessarily be
|
|
held during a garbage collection). */
|
|
auto suffix = std::string(drv.name) + drvExtension;
|
|
auto contents = drv.unparse(store, false);
|
|
return readOnly || settings.readOnlyMode
|
|
? store.computeStorePathForText(suffix, contents, references)
|
|
: store.addTextToStore(suffix, contents, references, repair);
|
|
}
|
|
|
|
|
|
namespace {
|
|
/**
|
|
* This mimics std::istream to some extent. We use this much smaller implementation
|
|
* instead of plain istreams because the sentry object overhead is too high.
|
|
*/
|
|
struct StringViewStream {
|
|
std::string_view remaining;
|
|
|
|
int peek() const {
|
|
return remaining.empty() ? EOF : remaining[0];
|
|
}
|
|
|
|
int get() {
|
|
if (remaining.empty()) return EOF;
|
|
char c = remaining[0];
|
|
remaining.remove_prefix(1);
|
|
return c;
|
|
}
|
|
};
|
|
|
|
constexpr struct Escapes {
|
|
char map[256];
|
|
constexpr Escapes() {
|
|
for (int i = 0; i < 256; i++) map[i] = (char) (unsigned char) i;
|
|
map[(int) (unsigned char) 'n'] = '\n';
|
|
map[(int) (unsigned char) 'r'] = '\r';
|
|
map[(int) (unsigned char) 't'] = '\t';
|
|
}
|
|
char operator[](char c) const { return map[(unsigned char) c]; }
|
|
} escapes;
|
|
}
|
|
|
|
|
|
/* Read string `s' from stream `str'. */
|
|
static void expect(StringViewStream & str, std::string_view s)
|
|
{
|
|
if (!str.remaining.starts_with(s))
|
|
throw FormatError("expected string '%1%'", s);
|
|
str.remaining.remove_prefix(s.size());
|
|
}
|
|
|
|
|
|
/* Read a C-style string from stream `str'. */
|
|
static BackedStringView parseString(StringViewStream & str)
|
|
{
|
|
expect(str, "\"");
|
|
auto c = str.remaining.begin(), end = str.remaining.end();
|
|
bool escaped = false;
|
|
for (; c != end && *c != '"'; c++) {
|
|
if (*c == '\\') {
|
|
c++;
|
|
if (c == end)
|
|
throw FormatError("unterminated string in derivation");
|
|
escaped = true;
|
|
}
|
|
}
|
|
|
|
const auto contentLen = c - str.remaining.begin();
|
|
const auto content = str.remaining.substr(0, contentLen);
|
|
str.remaining.remove_prefix(contentLen + 1);
|
|
|
|
if (!escaped)
|
|
return content;
|
|
|
|
std::string res;
|
|
res.reserve(content.size());
|
|
for (c = content.begin(), end = content.end(); c != end; c++)
|
|
if (*c == '\\') {
|
|
c++;
|
|
res += escapes[*c];
|
|
}
|
|
else res += *c;
|
|
return res;
|
|
}
|
|
|
|
static void validatePath(std::string_view s) {
|
|
if (s.size() == 0 || s[0] != '/')
|
|
throw FormatError("bad path '%1%' in derivation", s);
|
|
}
|
|
|
|
static BackedStringView parsePath(StringViewStream & str)
|
|
{
|
|
auto s = parseString(str);
|
|
validatePath(*s);
|
|
return s;
|
|
}
|
|
|
|
|
|
static bool endOfList(StringViewStream & str)
|
|
{
|
|
if (str.peek() == ',') {
|
|
str.get();
|
|
return false;
|
|
}
|
|
if (str.peek() == ']') {
|
|
str.get();
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
|
|
static StringSet parseStrings(StringViewStream & str, bool arePaths)
|
|
{
|
|
StringSet res;
|
|
expect(str, "[");
|
|
while (!endOfList(str))
|
|
res.insert((arePaths ? parsePath(str) : parseString(str)).toOwned());
|
|
return res;
|
|
}
|
|
|
|
|
|
static DerivationOutput parseDerivationOutput(
|
|
const Store & store,
|
|
std::string_view pathS, std::string_view hashAlgo, std::string_view hashS,
|
|
const ExperimentalFeatureSettings & xpSettings)
|
|
{
|
|
if (hashAlgo != "") {
|
|
ContentAddressMethod method = ContentAddressMethod::parsePrefix(hashAlgo);
|
|
if (method == TextIngestionMethod {})
|
|
xpSettings.require(Xp::DynamicDerivations);
|
|
const auto hashType = parseHashType(hashAlgo);
|
|
if (hashS == "impure") {
|
|
xpSettings.require(Xp::ImpureDerivations);
|
|
if (pathS != "")
|
|
throw FormatError("impure derivation output should not specify output path");
|
|
return DerivationOutput::Impure {
|
|
.method = std::move(method),
|
|
.hashType = std::move(hashType),
|
|
};
|
|
} else if (hashS != "") {
|
|
validatePath(pathS);
|
|
auto hash = Hash::parseNonSRIUnprefixed(hashS, hashType);
|
|
return DerivationOutput::CAFixed {
|
|
.ca = ContentAddress {
|
|
.method = std::move(method),
|
|
.hash = std::move(hash),
|
|
},
|
|
};
|
|
} else {
|
|
xpSettings.require(Xp::CaDerivations);
|
|
if (pathS != "")
|
|
throw FormatError("content-addressed derivation output should not specify output path");
|
|
return DerivationOutput::CAFloating {
|
|
.method = std::move(method),
|
|
.hashType = std::move(hashType),
|
|
};
|
|
}
|
|
} else {
|
|
if (pathS == "") {
|
|
return DerivationOutput::Deferred { };
|
|
}
|
|
validatePath(pathS);
|
|
return DerivationOutput::InputAddressed {
|
|
.path = store.parseStorePath(pathS),
|
|
};
|
|
}
|
|
}
|
|
|
|
static DerivationOutput parseDerivationOutput(
|
|
const Store & store, StringViewStream & str,
|
|
const ExperimentalFeatureSettings & xpSettings = experimentalFeatureSettings)
|
|
{
|
|
expect(str, ","); const auto pathS = parseString(str);
|
|
expect(str, ","); const auto hashAlgo = parseString(str);
|
|
expect(str, ","); const auto hash = parseString(str);
|
|
expect(str, ")");
|
|
|
|
return parseDerivationOutput(store, *pathS, *hashAlgo, *hash, xpSettings);
|
|
}
|
|
|
|
/**
|
|
* All ATerm Derivation format versions currently known.
|
|
*
|
|
* Unknown versions are rejected at the parsing stage.
|
|
*/
|
|
enum struct DerivationATermVersion {
|
|
/**
|
|
* Older unversioned form
|
|
*/
|
|
Traditional,
|
|
|
|
/**
|
|
* Newer versioned form; only this version so far.
|
|
*/
|
|
DynamicDerivations,
|
|
};
|
|
|
|
static DerivedPathMap<StringSet>::ChildNode parseDerivedPathMapNode(
|
|
const Store & store,
|
|
StringViewStream & str,
|
|
DerivationATermVersion version)
|
|
{
|
|
DerivedPathMap<StringSet>::ChildNode node;
|
|
|
|
auto parseNonDynamic = [&]() {
|
|
node.value = parseStrings(str, false);
|
|
};
|
|
|
|
// Older derivation should never use new form, but newer
|
|
// derivaiton can use old form.
|
|
switch (version) {
|
|
case DerivationATermVersion::Traditional:
|
|
parseNonDynamic();
|
|
break;
|
|
case DerivationATermVersion::DynamicDerivations:
|
|
switch (str.peek()) {
|
|
case '[':
|
|
parseNonDynamic();
|
|
break;
|
|
case '(':
|
|
expect(str, "(");
|
|
node.value = parseStrings(str, false);
|
|
expect(str, ",[");
|
|
while (!endOfList(str)) {
|
|
expect(str, "(");
|
|
auto outputName = parseString(str).toOwned();
|
|
expect(str, ",");
|
|
node.childMap.insert_or_assign(outputName, parseDerivedPathMapNode(store, str, version));
|
|
expect(str, ")");
|
|
}
|
|
expect(str, ")");
|
|
break;
|
|
default:
|
|
throw FormatError("invalid inputDrvs entry in derivation");
|
|
}
|
|
break;
|
|
default:
|
|
// invalid format, not a parse error but internal error
|
|
assert(false);
|
|
}
|
|
return node;
|
|
}
|
|
|
|
|
|
Derivation parseDerivation(
|
|
const Store & store, std::string && s, std::string_view name,
|
|
const ExperimentalFeatureSettings & xpSettings)
|
|
{
|
|
Derivation drv;
|
|
drv.name = name;
|
|
|
|
StringViewStream str{s};
|
|
expect(str, "D");
|
|
DerivationATermVersion version;
|
|
switch (str.peek()) {
|
|
case 'e':
|
|
expect(str, "erive(");
|
|
version = DerivationATermVersion::Traditional;
|
|
break;
|
|
case 'r': {
|
|
expect(str, "rvWithVersion(");
|
|
auto versionS = parseString(str);
|
|
if (*versionS == "xp-dyn-drv") {
|
|
// Only verison we have so far
|
|
version = DerivationATermVersion::DynamicDerivations;
|
|
xpSettings.require(Xp::DynamicDerivations);
|
|
} else {
|
|
throw FormatError("Unknown derivation ATerm format version '%s'", *versionS);
|
|
}
|
|
expect(str, ",");
|
|
break;
|
|
}
|
|
default:
|
|
throw Error("derivation does not start with 'Derive' or 'DrvWithVersion'");
|
|
}
|
|
|
|
/* Parse the list of outputs. */
|
|
expect(str, "[");
|
|
while (!endOfList(str)) {
|
|
expect(str, "("); std::string id = parseString(str).toOwned();
|
|
auto output = parseDerivationOutput(store, str, xpSettings);
|
|
drv.outputs.emplace(std::move(id), std::move(output));
|
|
}
|
|
|
|
/* Parse the list of input derivations. */
|
|
expect(str, ",[");
|
|
while (!endOfList(str)) {
|
|
expect(str, "(");
|
|
auto drvPath = parsePath(str);
|
|
expect(str, ",");
|
|
drv.inputDrvs.map.insert_or_assign(store.parseStorePath(*drvPath), parseDerivedPathMapNode(store, str, version));
|
|
expect(str, ")");
|
|
}
|
|
|
|
expect(str, ","); drv.inputSrcs = store.parseStorePathSet(parseStrings(str, true));
|
|
expect(str, ","); drv.platform = parseString(str).toOwned();
|
|
expect(str, ","); drv.builder = parseString(str).toOwned();
|
|
|
|
/* Parse the builder arguments. */
|
|
expect(str, ",[");
|
|
while (!endOfList(str))
|
|
drv.args.push_back(parseString(str).toOwned());
|
|
|
|
/* Parse the environment variables. */
|
|
expect(str, ",[");
|
|
while (!endOfList(str)) {
|
|
expect(str, "("); auto name = parseString(str).toOwned();
|
|
expect(str, ","); auto value = parseString(str).toOwned();
|
|
expect(str, ")");
|
|
drv.env.insert_or_assign(std::move(name), std::move(value));
|
|
}
|
|
|
|
expect(str, ")");
|
|
return drv;
|
|
}
|
|
|
|
|
|
/**
|
|
* Print a derivation string literal to an `std::string`.
|
|
*
|
|
* This syntax does not generalize to the expression language, which needs to
|
|
* escape `$`.
|
|
*
|
|
* @param res Where to print to
|
|
* @param s Which logical string to print
|
|
*/
|
|
static void printString(std::string & res, std::string_view s)
|
|
{
|
|
boost::container::small_vector<char, 64 * 1024> buffer;
|
|
buffer.reserve(s.size() * 2 + 2);
|
|
char * buf = buffer.data();
|
|
char * p = buf;
|
|
*p++ = '"';
|
|
for (auto c : s)
|
|
if (c == '\"' || c == '\\') { *p++ = '\\'; *p++ = c; }
|
|
else if (c == '\n') { *p++ = '\\'; *p++ = 'n'; }
|
|
else if (c == '\r') { *p++ = '\\'; *p++ = 'r'; }
|
|
else if (c == '\t') { *p++ = '\\'; *p++ = 't'; }
|
|
else *p++ = c;
|
|
*p++ = '"';
|
|
res.append(buf, p - buf);
|
|
}
|
|
|
|
|
|
static void printUnquotedString(std::string & res, std::string_view s)
|
|
{
|
|
res += '"';
|
|
res.append(s);
|
|
res += '"';
|
|
}
|
|
|
|
|
|
template<class ForwardIterator>
|
|
static void printStrings(std::string & res, ForwardIterator i, ForwardIterator j)
|
|
{
|
|
res += '[';
|
|
bool first = true;
|
|
for ( ; i != j; ++i) {
|
|
if (first) first = false; else res += ',';
|
|
printString(res, *i);
|
|
}
|
|
res += ']';
|
|
}
|
|
|
|
|
|
template<class ForwardIterator>
|
|
static void printUnquotedStrings(std::string & res, ForwardIterator i, ForwardIterator j)
|
|
{
|
|
res += '[';
|
|
bool first = true;
|
|
for ( ; i != j; ++i) {
|
|
if (first) first = false; else res += ',';
|
|
printUnquotedString(res, *i);
|
|
}
|
|
res += ']';
|
|
}
|
|
|
|
|
|
static void unparseDerivedPathMapNode(const Store & store, std::string & s, const DerivedPathMap<StringSet>::ChildNode & node)
|
|
{
|
|
s += ',';
|
|
if (node.childMap.empty()) {
|
|
printUnquotedStrings(s, node.value.begin(), node.value.end());
|
|
} else {
|
|
s += "(";
|
|
printUnquotedStrings(s, node.value.begin(), node.value.end());
|
|
s += ",[";
|
|
bool first = true;
|
|
for (auto & [outputName, childNode] : node.childMap) {
|
|
if (first) first = false; else s += ',';
|
|
s += '('; printUnquotedString(s, outputName);
|
|
unparseDerivedPathMapNode(store, s, childNode);
|
|
s += ')';
|
|
}
|
|
s += "])";
|
|
}
|
|
}
|
|
|
|
|
|
/**
|
|
* Does the derivation have a dependency on the output of a dynamic
|
|
* derivation?
|
|
*
|
|
* In other words, does it on the output of derivation that is itself an
|
|
* ouput of a derivation? This corresponds to a dependency that is an
|
|
* inductive derived path with more than one layer of
|
|
* `DerivedPath::Built`.
|
|
*/
|
|
static bool hasDynamicDrvDep(const Derivation & drv)
|
|
{
|
|
return
|
|
std::find_if(
|
|
drv.inputDrvs.map.begin(),
|
|
drv.inputDrvs.map.end(),
|
|
[](auto & kv) { return !kv.second.childMap.empty(); })
|
|
!= drv.inputDrvs.map.end();
|
|
}
|
|
|
|
|
|
std::string Derivation::unparse(const Store & store, bool maskOutputs,
|
|
DerivedPathMap<StringSet>::ChildNode::Map * actualInputs) const
|
|
{
|
|
std::string s;
|
|
s.reserve(65536);
|
|
|
|
/* Use older unversioned form if possible, for wider compat. Use
|
|
newer form only if we need it, which we do for
|
|
`Xp::DynamicDerivations`. */
|
|
if (hasDynamicDrvDep(*this)) {
|
|
s += "DrvWithVersion(";
|
|
// Only version we have so far
|
|
printUnquotedString(s, "xp-dyn-drv");
|
|
s += ",";
|
|
} else {
|
|
s += "Derive(";
|
|
}
|
|
|
|
bool first = true;
|
|
s += "[";
|
|
for (auto & i : outputs) {
|
|
if (first) first = false; else s += ',';
|
|
s += '('; printUnquotedString(s, i.first);
|
|
std::visit(overloaded {
|
|
[&](const DerivationOutput::InputAddressed & doi) {
|
|
s += ','; printUnquotedString(s, maskOutputs ? "" : store.printStorePath(doi.path));
|
|
s += ','; printUnquotedString(s, "");
|
|
s += ','; printUnquotedString(s, "");
|
|
},
|
|
[&](const DerivationOutput::CAFixed & dof) {
|
|
s += ','; printUnquotedString(s, maskOutputs ? "" : store.printStorePath(dof.path(store, name, i.first)));
|
|
s += ','; printUnquotedString(s, dof.ca.printMethodAlgo());
|
|
s += ','; printUnquotedString(s, dof.ca.hash.to_string(Base16, false));
|
|
},
|
|
[&](const DerivationOutput::CAFloating & dof) {
|
|
s += ','; printUnquotedString(s, "");
|
|
s += ','; printUnquotedString(s, dof.method.renderPrefix() + printHashType(dof.hashType));
|
|
s += ','; printUnquotedString(s, "");
|
|
},
|
|
[&](const DerivationOutput::Deferred &) {
|
|
s += ','; printUnquotedString(s, "");
|
|
s += ','; printUnquotedString(s, "");
|
|
s += ','; printUnquotedString(s, "");
|
|
},
|
|
[&](const DerivationOutput::Impure & doi) {
|
|
// FIXME
|
|
s += ','; printUnquotedString(s, "");
|
|
s += ','; printUnquotedString(s, doi.method.renderPrefix() + printHashType(doi.hashType));
|
|
s += ','; printUnquotedString(s, "impure");
|
|
}
|
|
}, i.second.raw);
|
|
s += ')';
|
|
}
|
|
|
|
s += "],[";
|
|
first = true;
|
|
if (actualInputs) {
|
|
for (auto & [drvHashModulo, childMap] : *actualInputs) {
|
|
if (first) first = false; else s += ',';
|
|
s += '('; printUnquotedString(s, drvHashModulo);
|
|
unparseDerivedPathMapNode(store, s, childMap);
|
|
s += ')';
|
|
}
|
|
} else {
|
|
for (auto & [drvPath, childMap] : inputDrvs.map) {
|
|
if (first) first = false; else s += ',';
|
|
s += '('; printUnquotedString(s, store.printStorePath(drvPath));
|
|
unparseDerivedPathMapNode(store, s, childMap);
|
|
s += ')';
|
|
}
|
|
}
|
|
|
|
s += "],";
|
|
auto paths = store.printStorePathSet(inputSrcs); // FIXME: slow
|
|
printUnquotedStrings(s, paths.begin(), paths.end());
|
|
|
|
s += ','; printUnquotedString(s, platform);
|
|
s += ','; printString(s, builder);
|
|
s += ','; printStrings(s, args.begin(), args.end());
|
|
|
|
s += ",[";
|
|
first = true;
|
|
for (auto & i : env) {
|
|
if (first) first = false; else s += ',';
|
|
s += '('; printString(s, i.first);
|
|
s += ','; printString(s, maskOutputs && outputs.count(i.first) ? "" : i.second);
|
|
s += ')';
|
|
}
|
|
|
|
s += "])";
|
|
|
|
return s;
|
|
}
|
|
|
|
|
|
// FIXME: remove
|
|
bool isDerivation(std::string_view fileName)
|
|
{
|
|
return fileName.ends_with(drvExtension);
|
|
}
|
|
|
|
|
|
std::string outputPathName(std::string_view drvName, OutputNameView outputName) {
|
|
std::string res { drvName };
|
|
if (outputName != "out") {
|
|
res += "-";
|
|
res += outputName;
|
|
}
|
|
return res;
|
|
}
|
|
|
|
|
|
DerivationType BasicDerivation::type() const
|
|
{
|
|
std::set<std::string_view>
|
|
inputAddressedOutputs,
|
|
fixedCAOutputs,
|
|
floatingCAOutputs,
|
|
deferredIAOutputs,
|
|
impureOutputs;
|
|
std::optional<HashType> floatingHashType;
|
|
|
|
for (auto & i : outputs) {
|
|
std::visit(overloaded {
|
|
[&](const DerivationOutput::InputAddressed &) {
|
|
inputAddressedOutputs.insert(i.first);
|
|
},
|
|
[&](const DerivationOutput::CAFixed &) {
|
|
fixedCAOutputs.insert(i.first);
|
|
},
|
|
[&](const DerivationOutput::CAFloating & dof) {
|
|
floatingCAOutputs.insert(i.first);
|
|
if (!floatingHashType) {
|
|
floatingHashType = dof.hashType;
|
|
} else {
|
|
if (*floatingHashType != dof.hashType)
|
|
throw Error("all floating outputs must use the same hash type");
|
|
}
|
|
},
|
|
[&](const DerivationOutput::Deferred &) {
|
|
deferredIAOutputs.insert(i.first);
|
|
},
|
|
[&](const DerivationOutput::Impure &) {
|
|
impureOutputs.insert(i.first);
|
|
},
|
|
}, i.second.raw);
|
|
}
|
|
|
|
if (inputAddressedOutputs.empty()
|
|
&& fixedCAOutputs.empty()
|
|
&& floatingCAOutputs.empty()
|
|
&& deferredIAOutputs.empty()
|
|
&& impureOutputs.empty())
|
|
throw Error("must have at least one output");
|
|
|
|
if (!inputAddressedOutputs.empty()
|
|
&& fixedCAOutputs.empty()
|
|
&& floatingCAOutputs.empty()
|
|
&& deferredIAOutputs.empty()
|
|
&& impureOutputs.empty())
|
|
return DerivationType::InputAddressed {
|
|
.deferred = false,
|
|
};
|
|
|
|
if (inputAddressedOutputs.empty()
|
|
&& !fixedCAOutputs.empty()
|
|
&& floatingCAOutputs.empty()
|
|
&& deferredIAOutputs.empty()
|
|
&& impureOutputs.empty())
|
|
{
|
|
if (fixedCAOutputs.size() > 1)
|
|
// FIXME: Experimental feature?
|
|
throw Error("only one fixed output is allowed for now");
|
|
if (*fixedCAOutputs.begin() != "out")
|
|
throw Error("single fixed output must be named \"out\"");
|
|
return DerivationType::ContentAddressed {
|
|
.sandboxed = false,
|
|
.fixed = true,
|
|
};
|
|
}
|
|
|
|
if (inputAddressedOutputs.empty()
|
|
&& fixedCAOutputs.empty()
|
|
&& !floatingCAOutputs.empty()
|
|
&& deferredIAOutputs.empty()
|
|
&& impureOutputs.empty())
|
|
return DerivationType::ContentAddressed {
|
|
.sandboxed = true,
|
|
.fixed = false,
|
|
};
|
|
|
|
if (inputAddressedOutputs.empty()
|
|
&& fixedCAOutputs.empty()
|
|
&& floatingCAOutputs.empty()
|
|
&& !deferredIAOutputs.empty()
|
|
&& impureOutputs.empty())
|
|
return DerivationType::InputAddressed {
|
|
.deferred = true,
|
|
};
|
|
|
|
if (inputAddressedOutputs.empty()
|
|
&& fixedCAOutputs.empty()
|
|
&& floatingCAOutputs.empty()
|
|
&& deferredIAOutputs.empty()
|
|
&& !impureOutputs.empty())
|
|
return DerivationType::Impure { };
|
|
|
|
throw Error("can't mix derivation output types");
|
|
}
|
|
|
|
|
|
Sync<DrvHashes> drvHashes;
|
|
|
|
/* pathDerivationModulo and hashDerivationModulo are mutually recursive
|
|
*/
|
|
|
|
/* Look up the derivation by value and memoize the
|
|
`hashDerivationModulo` call.
|
|
*/
|
|
static const DrvHash pathDerivationModulo(Store & store, const StorePath & drvPath)
|
|
{
|
|
{
|
|
auto hashes = drvHashes.lock();
|
|
auto h = hashes->find(drvPath);
|
|
if (h != hashes->end()) {
|
|
return h->second;
|
|
}
|
|
}
|
|
auto h = hashDerivationModulo(
|
|
store,
|
|
store.readInvalidDerivation(drvPath),
|
|
false);
|
|
// Cache it
|
|
drvHashes.lock()->insert_or_assign(drvPath, h);
|
|
return h;
|
|
}
|
|
|
|
/* See the header for interface details. These are the implementation details.
|
|
|
|
For fixed-output derivations, each hash in the map is not the
|
|
corresponding output's content hash, but a hash of that hash along
|
|
with other constant data. The key point is that the value is a pure
|
|
function of the output's contents, and there are no preimage attacks
|
|
either spoofing an output's contents for a derivation, or
|
|
spoofing a derivation for an output's contents.
|
|
|
|
For regular derivations, it looks up each subderivation from its hash
|
|
and recurs. If the subderivation is also regular, it simply
|
|
substitutes the derivation path with its hash. If the subderivation
|
|
is fixed-output, however, it takes each output hash and pretends it
|
|
is a derivation hash producing a single "out" output. This is so we
|
|
don't leak the provenance of fixed outputs, reducing pointless cache
|
|
misses as the build itself won't know this.
|
|
*/
|
|
DrvHash hashDerivationModulo(Store & store, const Derivation & drv, bool maskOutputs)
|
|
{
|
|
auto type = drv.type();
|
|
|
|
/* Return a fixed hash for fixed-output derivations. */
|
|
if (type.isFixed()) {
|
|
std::map<std::string, Hash> outputHashes;
|
|
for (const auto & i : drv.outputs) {
|
|
auto & dof = std::get<DerivationOutput::CAFixed>(i.second.raw);
|
|
auto hash = hashString(htSHA256, "fixed:out:"
|
|
+ dof.ca.printMethodAlgo() + ":"
|
|
+ dof.ca.hash.to_string(Base16, false) + ":"
|
|
+ store.printStorePath(dof.path(store, drv.name, i.first)));
|
|
outputHashes.insert_or_assign(i.first, std::move(hash));
|
|
}
|
|
return DrvHash {
|
|
.hashes = outputHashes,
|
|
.kind = DrvHash::Kind::Regular,
|
|
};
|
|
}
|
|
|
|
if (!type.isPure()) {
|
|
std::map<std::string, Hash> outputHashes;
|
|
for (const auto & [outputName, _] : drv.outputs)
|
|
outputHashes.insert_or_assign(outputName, impureOutputHash);
|
|
return DrvHash {
|
|
.hashes = outputHashes,
|
|
.kind = DrvHash::Kind::Deferred,
|
|
};
|
|
}
|
|
|
|
auto kind = std::visit(overloaded {
|
|
[](const DerivationType::InputAddressed & ia) {
|
|
/* This might be a "pesimistically" deferred output, so we don't
|
|
"taint" the kind yet. */
|
|
return DrvHash::Kind::Regular;
|
|
},
|
|
[](const DerivationType::ContentAddressed & ca) {
|
|
return ca.fixed
|
|
? DrvHash::Kind::Regular
|
|
: DrvHash::Kind::Deferred;
|
|
},
|
|
[](const DerivationType::Impure &) -> DrvHash::Kind {
|
|
assert(false);
|
|
}
|
|
}, drv.type().raw);
|
|
|
|
DerivedPathMap<StringSet>::ChildNode::Map inputs2;
|
|
for (auto & [drvPath, node] : drv.inputDrvs.map) {
|
|
const auto & res = pathDerivationModulo(store, drvPath);
|
|
if (res.kind == DrvHash::Kind::Deferred)
|
|
kind = DrvHash::Kind::Deferred;
|
|
for (auto & outputName : node.value) {
|
|
const auto h = get(res.hashes, outputName);
|
|
if (!h)
|
|
throw Error("no hash for output '%s' of derivation '%s'", outputName, drv.name);
|
|
inputs2[h->to_string(Base16, false)].value.insert(outputName);
|
|
}
|
|
}
|
|
|
|
auto hash = hashString(htSHA256, drv.unparse(store, maskOutputs, &inputs2));
|
|
|
|
std::map<std::string, Hash> outputHashes;
|
|
for (const auto & [outputName, _] : drv.outputs) {
|
|
outputHashes.insert_or_assign(outputName, hash);
|
|
}
|
|
|
|
return DrvHash {
|
|
.hashes = outputHashes,
|
|
.kind = kind,
|
|
};
|
|
}
|
|
|
|
|
|
std::map<std::string, Hash> staticOutputHashes(Store & store, const Derivation & drv)
|
|
{
|
|
return hashDerivationModulo(store, drv, true).hashes;
|
|
}
|
|
|
|
|
|
static DerivationOutput readDerivationOutput(Source & in, const Store & store)
|
|
{
|
|
const auto pathS = readString(in);
|
|
const auto hashAlgo = readString(in);
|
|
const auto hash = readString(in);
|
|
|
|
return parseDerivationOutput(store, pathS, hashAlgo, hash, experimentalFeatureSettings);
|
|
}
|
|
|
|
StringSet BasicDerivation::outputNames() const
|
|
{
|
|
StringSet names;
|
|
for (auto & i : outputs)
|
|
names.insert(i.first);
|
|
return names;
|
|
}
|
|
|
|
DerivationOutputsAndOptPaths BasicDerivation::outputsAndOptPaths(const Store & store) const
|
|
{
|
|
DerivationOutputsAndOptPaths outsAndOptPaths;
|
|
for (auto & [outputName, output] : outputs)
|
|
outsAndOptPaths.insert(std::make_pair(
|
|
outputName,
|
|
std::make_pair(output, output.path(store, name, outputName))
|
|
)
|
|
);
|
|
return outsAndOptPaths;
|
|
}
|
|
|
|
std::string_view BasicDerivation::nameFromPath(const StorePath & drvPath)
|
|
{
|
|
auto nameWithSuffix = drvPath.name();
|
|
constexpr std::string_view extension = ".drv";
|
|
assert(nameWithSuffix.ends_with(extension));
|
|
nameWithSuffix.remove_suffix(extension.size());
|
|
return nameWithSuffix;
|
|
}
|
|
|
|
|
|
Source & readDerivation(Source & in, const Store & store, BasicDerivation & drv, std::string_view name)
|
|
{
|
|
drv.name = name;
|
|
|
|
drv.outputs.clear();
|
|
auto nr = readNum<size_t>(in);
|
|
for (size_t n = 0; n < nr; n++) {
|
|
auto name = readString(in);
|
|
auto output = readDerivationOutput(in, store);
|
|
drv.outputs.emplace(std::move(name), std::move(output));
|
|
}
|
|
|
|
drv.inputSrcs = CommonProto::Serialise<StorePathSet>::read(store,
|
|
CommonProto::ReadConn { .from = in });
|
|
in >> drv.platform >> drv.builder;
|
|
drv.args = readStrings<Strings>(in);
|
|
|
|
nr = readNum<size_t>(in);
|
|
for (size_t n = 0; n < nr; n++) {
|
|
auto key = readString(in);
|
|
auto value = readString(in);
|
|
drv.env[key] = value;
|
|
}
|
|
|
|
return in;
|
|
}
|
|
|
|
|
|
void writeDerivation(Sink & out, const Store & store, const BasicDerivation & drv)
|
|
{
|
|
out << drv.outputs.size();
|
|
for (auto & i : drv.outputs) {
|
|
out << i.first;
|
|
std::visit(overloaded {
|
|
[&](const DerivationOutput::InputAddressed & doi) {
|
|
out << store.printStorePath(doi.path)
|
|
<< ""
|
|
<< "";
|
|
},
|
|
[&](const DerivationOutput::CAFixed & dof) {
|
|
out << store.printStorePath(dof.path(store, drv.name, i.first))
|
|
<< dof.ca.printMethodAlgo()
|
|
<< dof.ca.hash.to_string(Base16, false);
|
|
},
|
|
[&](const DerivationOutput::CAFloating & dof) {
|
|
out << ""
|
|
<< (dof.method.renderPrefix() + printHashType(dof.hashType))
|
|
<< "";
|
|
},
|
|
[&](const DerivationOutput::Deferred &) {
|
|
out << ""
|
|
<< ""
|
|
<< "";
|
|
},
|
|
[&](const DerivationOutput::Impure & doi) {
|
|
out << ""
|
|
<< (doi.method.renderPrefix() + printHashType(doi.hashType))
|
|
<< "impure";
|
|
},
|
|
}, i.second.raw);
|
|
}
|
|
CommonProto::write(store,
|
|
CommonProto::WriteConn { .to = out },
|
|
drv.inputSrcs);
|
|
out << drv.platform << drv.builder << drv.args;
|
|
out << drv.env.size();
|
|
for (auto & i : drv.env)
|
|
out << i.first << i.second;
|
|
}
|
|
|
|
|
|
std::string hashPlaceholder(const OutputNameView outputName)
|
|
{
|
|
// FIXME: memoize?
|
|
return "/" + hashString(htSHA256, concatStrings("nix-output:", outputName)).to_string(Base32, false);
|
|
}
|
|
|
|
|
|
|
|
|
|
static void rewriteDerivation(Store & store, BasicDerivation & drv, const StringMap & rewrites)
|
|
{
|
|
debug("Rewriting the derivation");
|
|
|
|
for (auto & rewrite : rewrites) {
|
|
debug("rewriting %s as %s", rewrite.first, rewrite.second);
|
|
}
|
|
|
|
drv.builder = rewriteStrings(drv.builder, rewrites);
|
|
for (auto & arg : drv.args) {
|
|
arg = rewriteStrings(arg, rewrites);
|
|
}
|
|
|
|
StringPairs newEnv;
|
|
for (auto & envVar : drv.env) {
|
|
auto envName = rewriteStrings(envVar.first, rewrites);
|
|
auto envValue = rewriteStrings(envVar.second, rewrites);
|
|
newEnv.emplace(envName, envValue);
|
|
}
|
|
drv.env = newEnv;
|
|
|
|
auto hashModulo = hashDerivationModulo(store, Derivation(drv), true);
|
|
for (auto & [outputName, output] : drv.outputs) {
|
|
if (std::holds_alternative<DerivationOutput::Deferred>(output.raw)) {
|
|
auto h = get(hashModulo.hashes, outputName);
|
|
if (!h)
|
|
throw Error("derivation '%s' output '%s' has no hash (derivations.cc/rewriteDerivation)",
|
|
drv.name, outputName);
|
|
auto outPath = store.makeOutputPath(outputName, *h, drv.name);
|
|
drv.env[outputName] = store.printStorePath(outPath);
|
|
output = DerivationOutput::InputAddressed {
|
|
.path = std::move(outPath),
|
|
};
|
|
}
|
|
}
|
|
|
|
}
|
|
|
|
std::optional<BasicDerivation> Derivation::tryResolve(Store & store, Store * evalStore) const
|
|
{
|
|
std::map<std::pair<StorePath, std::string>, StorePath> inputDrvOutputs;
|
|
|
|
std::function<void(const StorePath &, const DerivedPathMap<StringSet>::ChildNode &)> accum;
|
|
accum = [&](auto & inputDrv, auto & node) {
|
|
for (auto & [outputName, outputPath] : store.queryPartialDerivationOutputMap(inputDrv, evalStore)) {
|
|
if (outputPath) {
|
|
inputDrvOutputs.insert_or_assign({inputDrv, outputName}, *outputPath);
|
|
if (auto p = get(node.childMap, outputName))
|
|
accum(*outputPath, *p);
|
|
}
|
|
}
|
|
};
|
|
|
|
for (auto & [inputDrv, node] : inputDrvs.map)
|
|
accum(inputDrv, node);
|
|
|
|
return tryResolve(store, inputDrvOutputs);
|
|
}
|
|
|
|
static bool tryResolveInput(
|
|
Store & store, StorePathSet & inputSrcs, StringMap & inputRewrites,
|
|
const DownstreamPlaceholder * placeholderOpt,
|
|
const StorePath & inputDrv, const DerivedPathMap<StringSet>::ChildNode & inputNode,
|
|
const std::map<std::pair<StorePath, std::string>, StorePath> & inputDrvOutputs)
|
|
{
|
|
auto getOutput = [&](const std::string & outputName) {
|
|
auto * actualPathOpt = get(inputDrvOutputs, { inputDrv, outputName });
|
|
if (!actualPathOpt)
|
|
warn("output %s of input %s missing, aborting the resolving",
|
|
outputName,
|
|
store.printStorePath(inputDrv)
|
|
);
|
|
return actualPathOpt;
|
|
};
|
|
|
|
auto getPlaceholder = [&](const std::string & outputName) {
|
|
return placeholderOpt
|
|
? DownstreamPlaceholder::unknownDerivation(*placeholderOpt, outputName)
|
|
: DownstreamPlaceholder::unknownCaOutput(inputDrv, outputName);
|
|
};
|
|
|
|
for (auto & outputName : inputNode.value) {
|
|
auto actualPathOpt = getOutput(outputName);
|
|
if (!actualPathOpt) return false;
|
|
auto actualPath = *actualPathOpt;
|
|
if (experimentalFeatureSettings.isEnabled(Xp::CaDerivations)) {
|
|
inputRewrites.emplace(
|
|
getPlaceholder(outputName).render(),
|
|
store.printStorePath(actualPath));
|
|
}
|
|
inputSrcs.insert(std::move(actualPath));
|
|
}
|
|
|
|
for (auto & [outputName, childNode] : inputNode.childMap) {
|
|
auto actualPathOpt = getOutput(outputName);
|
|
if (!actualPathOpt) return false;
|
|
auto actualPath = *actualPathOpt;
|
|
auto nextPlaceholder = getPlaceholder(outputName);
|
|
if (!tryResolveInput(store, inputSrcs, inputRewrites,
|
|
&nextPlaceholder, actualPath, childNode,
|
|
inputDrvOutputs))
|
|
return false;
|
|
}
|
|
return true;
|
|
}
|
|
|
|
std::optional<BasicDerivation> Derivation::tryResolve(
|
|
Store & store,
|
|
const std::map<std::pair<StorePath, std::string>, StorePath> & inputDrvOutputs) const
|
|
{
|
|
BasicDerivation resolved { *this };
|
|
|
|
// Input paths that we'll want to rewrite in the derivation
|
|
StringMap inputRewrites;
|
|
|
|
for (auto & [inputDrv, inputNode] : inputDrvs.map)
|
|
if (!tryResolveInput(store, resolved.inputSrcs, inputRewrites,
|
|
nullptr, inputDrv, inputNode, inputDrvOutputs))
|
|
return std::nullopt;
|
|
|
|
rewriteDerivation(store, resolved, inputRewrites);
|
|
|
|
return resolved;
|
|
}
|
|
|
|
|
|
void Derivation::checkInvariants(Store & store, const StorePath & drvPath) const
|
|
{
|
|
assert(drvPath.isDerivation());
|
|
std::string drvName(drvPath.name());
|
|
drvName = drvName.substr(0, drvName.size() - drvExtension.size());
|
|
|
|
if (drvName != name) {
|
|
throw Error("Derivation '%s' has name '%s' which does not match its path", store.printStorePath(drvPath), name);
|
|
}
|
|
|
|
auto envHasRightPath = [&](const StorePath & actual, const std::string & varName)
|
|
{
|
|
auto j = env.find(varName);
|
|
if (j == env.end() || store.parseStorePath(j->second) != actual)
|
|
throw Error("derivation '%s' has incorrect environment variable '%s', should be '%s'",
|
|
store.printStorePath(drvPath), varName, store.printStorePath(actual));
|
|
};
|
|
|
|
|
|
// Don't need the answer, but do this anyways to assert is proper
|
|
// combination. The code below is more general and naturally allows
|
|
// combinations that are currently prohibited.
|
|
type();
|
|
|
|
std::optional<DrvHash> hashesModulo;
|
|
for (auto & i : outputs) {
|
|
std::visit(overloaded {
|
|
[&](const DerivationOutput::InputAddressed & doia) {
|
|
if (!hashesModulo) {
|
|
// somewhat expensive so we do lazily
|
|
hashesModulo = hashDerivationModulo(store, *this, true);
|
|
}
|
|
auto currentOutputHash = get(hashesModulo->hashes, i.first);
|
|
if (!currentOutputHash)
|
|
throw Error("derivation '%s' has unexpected output '%s' (local-store / hashesModulo) named '%s'",
|
|
store.printStorePath(drvPath), store.printStorePath(doia.path), i.first);
|
|
StorePath recomputed = store.makeOutputPath(i.first, *currentOutputHash, drvName);
|
|
if (doia.path != recomputed)
|
|
throw Error("derivation '%s' has incorrect output '%s', should be '%s'",
|
|
store.printStorePath(drvPath), store.printStorePath(doia.path), store.printStorePath(recomputed));
|
|
envHasRightPath(doia.path, i.first);
|
|
},
|
|
[&](const DerivationOutput::CAFixed & dof) {
|
|
auto path = dof.path(store, drvName, i.first);
|
|
envHasRightPath(path, i.first);
|
|
},
|
|
[&](const DerivationOutput::CAFloating &) {
|
|
/* Nothing to check */
|
|
},
|
|
[&](const DerivationOutput::Deferred &) {
|
|
/* Nothing to check */
|
|
},
|
|
[&](const DerivationOutput::Impure &) {
|
|
/* Nothing to check */
|
|
},
|
|
}, i.second.raw);
|
|
}
|
|
}
|
|
|
|
|
|
const Hash impureOutputHash = hashString(htSHA256, "impure");
|
|
|
|
nlohmann::json DerivationOutput::toJSON(
|
|
const Store & store, std::string_view drvName, OutputNameView outputName) const
|
|
{
|
|
nlohmann::json res = nlohmann::json::object();
|
|
std::visit(overloaded {
|
|
[&](const DerivationOutput::InputAddressed & doi) {
|
|
res["path"] = store.printStorePath(doi.path);
|
|
},
|
|
[&](const DerivationOutput::CAFixed & dof) {
|
|
res["path"] = store.printStorePath(dof.path(store, drvName, outputName));
|
|
res["hashAlgo"] = dof.ca.printMethodAlgo();
|
|
res["hash"] = dof.ca.hash.to_string(Base16, false);
|
|
// FIXME print refs?
|
|
},
|
|
[&](const DerivationOutput::CAFloating & dof) {
|
|
res["hashAlgo"] = dof.method.renderPrefix() + printHashType(dof.hashType);
|
|
},
|
|
[&](const DerivationOutput::Deferred &) {},
|
|
[&](const DerivationOutput::Impure & doi) {
|
|
res["hashAlgo"] = doi.method.renderPrefix() + printHashType(doi.hashType);
|
|
res["impure"] = true;
|
|
},
|
|
}, raw);
|
|
return res;
|
|
}
|
|
|
|
|
|
DerivationOutput DerivationOutput::fromJSON(
|
|
const Store & store, std::string_view drvName, OutputNameView outputName,
|
|
const nlohmann::json & _json,
|
|
const ExperimentalFeatureSettings & xpSettings)
|
|
{
|
|
std::set<std::string_view> keys;
|
|
ensureType(_json, nlohmann::detail::value_t::object);
|
|
auto json = (std::map<std::string, nlohmann::json>) _json;
|
|
|
|
for (const auto & [key, _] : json)
|
|
keys.insert(key);
|
|
|
|
auto methodAlgo = [&]() -> std::pair<ContentAddressMethod, HashType> {
|
|
std::string hashAlgo = json["hashAlgo"];
|
|
// remaining to parse, will be mutated by parsers
|
|
std::string_view s = hashAlgo;
|
|
ContentAddressMethod method = ContentAddressMethod::parsePrefix(s);
|
|
if (method == TextIngestionMethod {})
|
|
xpSettings.require(Xp::DynamicDerivations);
|
|
auto hashType = parseHashType(s);
|
|
return { std::move(method), std::move(hashType) };
|
|
};
|
|
|
|
if (keys == (std::set<std::string_view> { "path" })) {
|
|
return DerivationOutput::InputAddressed {
|
|
.path = store.parseStorePath((std::string) json["path"]),
|
|
};
|
|
}
|
|
|
|
else if (keys == (std::set<std::string_view> { "path", "hashAlgo", "hash" })) {
|
|
auto [method, hashType] = methodAlgo();
|
|
auto dof = DerivationOutput::CAFixed {
|
|
.ca = ContentAddress {
|
|
.method = std::move(method),
|
|
.hash = Hash::parseNonSRIUnprefixed((std::string) json["hash"], hashType),
|
|
},
|
|
};
|
|
if (dof.path(store, drvName, outputName) != store.parseStorePath((std::string) json["path"]))
|
|
throw Error("Path doesn't match derivation output");
|
|
return dof;
|
|
}
|
|
|
|
else if (keys == (std::set<std::string_view> { "hashAlgo" })) {
|
|
xpSettings.require(Xp::CaDerivations);
|
|
auto [method, hashType] = methodAlgo();
|
|
return DerivationOutput::CAFloating {
|
|
.method = std::move(method),
|
|
.hashType = std::move(hashType),
|
|
};
|
|
}
|
|
|
|
else if (keys == (std::set<std::string_view> { })) {
|
|
return DerivationOutput::Deferred {};
|
|
}
|
|
|
|
else if (keys == (std::set<std::string_view> { "hashAlgo", "impure" })) {
|
|
xpSettings.require(Xp::ImpureDerivations);
|
|
auto [method, hashType] = methodAlgo();
|
|
return DerivationOutput::Impure {
|
|
.method = std::move(method),
|
|
.hashType = hashType,
|
|
};
|
|
}
|
|
|
|
else {
|
|
throw Error("invalid JSON for derivation output");
|
|
}
|
|
}
|
|
|
|
|
|
nlohmann::json Derivation::toJSON(const Store & store) const
|
|
{
|
|
nlohmann::json res = nlohmann::json::object();
|
|
|
|
res["name"] = name;
|
|
|
|
{
|
|
nlohmann::json & outputsObj = res["outputs"];
|
|
outputsObj = nlohmann::json::object();
|
|
for (auto & [outputName, output] : outputs) {
|
|
outputsObj[outputName] = output.toJSON(store, name, outputName);
|
|
}
|
|
}
|
|
|
|
{
|
|
auto& inputsList = res["inputSrcs"];
|
|
inputsList = nlohmann::json ::array();
|
|
for (auto & input : inputSrcs)
|
|
inputsList.emplace_back(store.printStorePath(input));
|
|
}
|
|
|
|
{
|
|
std::function<nlohmann::json(const DerivedPathMap<StringSet>::ChildNode &)> doInput;
|
|
doInput = [&](const auto & inputNode) {
|
|
auto value = nlohmann::json::object();
|
|
value["outputs"] = inputNode.value;
|
|
{
|
|
auto next = nlohmann::json::object();
|
|
for (auto & [outputId, childNode] : inputNode.childMap)
|
|
next[outputId] = doInput(childNode);
|
|
value["dynamicOutputs"] = std::move(next);
|
|
}
|
|
return value;
|
|
};
|
|
{
|
|
auto& inputDrvsObj = res["inputDrvs"];
|
|
inputDrvsObj = nlohmann::json::object();
|
|
for (auto & [inputDrv, inputNode] : inputDrvs.map) {
|
|
inputDrvsObj[store.printStorePath(inputDrv)] = doInput(inputNode);
|
|
}
|
|
}
|
|
}
|
|
|
|
res["system"] = platform;
|
|
res["builder"] = builder;
|
|
res["args"] = args;
|
|
res["env"] = env;
|
|
|
|
return res;
|
|
}
|
|
|
|
|
|
Derivation Derivation::fromJSON(
|
|
const Store & store,
|
|
const nlohmann::json & json,
|
|
const ExperimentalFeatureSettings & xpSettings)
|
|
{
|
|
using nlohmann::detail::value_t;
|
|
|
|
Derivation res;
|
|
|
|
ensureType(json, value_t::object);
|
|
|
|
res.name = ensureType(valueAt(json, "name"), value_t::string);
|
|
|
|
try {
|
|
auto & outputsObj = ensureType(valueAt(json, "outputs"), value_t::object);
|
|
for (auto & [outputName, output] : outputsObj.items()) {
|
|
res.outputs.insert_or_assign(
|
|
outputName,
|
|
DerivationOutput::fromJSON(store, res.name, outputName, output));
|
|
}
|
|
} catch (Error & e) {
|
|
e.addTrace({}, "while reading key 'outputs'");
|
|
throw;
|
|
}
|
|
|
|
try {
|
|
auto & inputsList = ensureType(valueAt(json, "inputSrcs"), value_t::array);
|
|
for (auto & input : inputsList)
|
|
res.inputSrcs.insert(store.parseStorePath(static_cast<const std::string &>(input)));
|
|
} catch (Error & e) {
|
|
e.addTrace({}, "while reading key 'inputSrcs'");
|
|
throw;
|
|
}
|
|
|
|
try {
|
|
std::function<DerivedPathMap<StringSet>::ChildNode(const nlohmann::json &)> doInput;
|
|
doInput = [&](const auto & json) {
|
|
DerivedPathMap<StringSet>::ChildNode node;
|
|
node.value = static_cast<const StringSet &>(
|
|
ensureType(valueAt(json, "outputs"), value_t::array));
|
|
for (auto & [outputId, childNode] : ensureType(valueAt(json, "dynamicOutputs"), value_t::object).items()) {
|
|
xpSettings.require(Xp::DynamicDerivations);
|
|
node.childMap[outputId] = doInput(childNode);
|
|
}
|
|
return node;
|
|
};
|
|
auto & inputDrvsObj = ensureType(valueAt(json, "inputDrvs"), value_t::object);
|
|
for (auto & [inputDrvPath, inputOutputs] : inputDrvsObj.items())
|
|
res.inputDrvs.map[store.parseStorePath(inputDrvPath)] =
|
|
doInput(inputOutputs);
|
|
} catch (Error & e) {
|
|
e.addTrace({}, "while reading key 'inputDrvs'");
|
|
throw;
|
|
}
|
|
|
|
res.platform = ensureType(valueAt(json, "system"), value_t::string);
|
|
res.builder = ensureType(valueAt(json, "builder"), value_t::string);
|
|
res.args = ensureType(valueAt(json, "args"), value_t::array);
|
|
res.env = ensureType(valueAt(json, "env"), value_t::object);
|
|
|
|
return res;
|
|
}
|
|
|
|
}
|