This cleans up includes that clangd reports as unused, usually by deleting the offending include. The process was to delete an include and see if it still builds. If not, try to find a more specific include(s) that works, that was previously transitively included. If the original include seems intended to re-export said transitive include, mark the transitive include as `// IWYU pragma: export`. Otherwise, replace the original include with the transitive include(s). If none of the above applies, because the original file depends on code directly in the include somehow, or the direct include is an external dependency that cannot be modified, restore the original include and mark it as `// IWYU pragma: keep`. Change-Id: I5ce3d34dad76b0cad0a6a7990fea13add393aad3
371 lines
11 KiB
C++
371 lines
11 KiB
C++
#include "lix/libexpr/flake/lockfile.hh"
|
|
#include "lix/libstore/store-api.hh"
|
|
#include "lix/libutil/error.hh"
|
|
#include "lix/libutil/json.hh"
|
|
#include "lix/libutil/url-parts.hh"
|
|
|
|
#include <iomanip>
|
|
|
|
namespace nix::flake {
|
|
|
|
FlakeRef getFlakeRef(
|
|
const JSON & json,
|
|
const char * attr,
|
|
const char * info)
|
|
{
|
|
auto i = json.find(attr);
|
|
if (i != json.end()) {
|
|
auto attrs = fetchers::jsonToAttrs(*i);
|
|
// FIXME: remove when we drop support for version 5.
|
|
if (info) {
|
|
auto j = json.find(info);
|
|
if (j != json.end()) {
|
|
for (auto k : fetchers::jsonToAttrs(*j))
|
|
attrs.insert_or_assign(k.first, k.second);
|
|
}
|
|
}
|
|
return FlakeRef::fromAttrs(attrs);
|
|
}
|
|
|
|
throw Error("attribute '%s' missing in lock file", attr);
|
|
}
|
|
|
|
LockedNode::LockedNode(const JSON & json)
|
|
: lockedRef(getFlakeRef(json, "locked", "info")) // FIXME: remove "info"
|
|
, originalRef(getFlakeRef(json, "original", nullptr))
|
|
, isFlake(json.find("flake") != json.end() ? (bool) json["flake"] : true)
|
|
{
|
|
if (!lockedRef.input.isLocked())
|
|
throw Error("lock file contains mutable lock '%s'",
|
|
fetchers::attrsToJSON(lockedRef.input.toAttrs()));
|
|
}
|
|
|
|
StorePath LockedNode::computeStorePath(Store & store) const
|
|
{
|
|
return lockedRef.input.computeStorePath(store);
|
|
}
|
|
|
|
std::shared_ptr<Node> LockFile::findInput(const InputPath & path)
|
|
{
|
|
auto pos = root.get_ptr();
|
|
|
|
for (auto & elem : path) {
|
|
if (auto i = get(pos->inputs, elem)) {
|
|
if (auto node = std::get_if<0>(&*i))
|
|
pos = node->get_ptr();
|
|
else if (auto follows = std::get_if<1>(&*i)) {
|
|
if (auto p = findInput(*follows))
|
|
pos = p;
|
|
else
|
|
return {};
|
|
}
|
|
} else
|
|
return {};
|
|
}
|
|
|
|
return pos;
|
|
}
|
|
|
|
LockFile::LockFile(const JSON & json, const Path & path)
|
|
{
|
|
auto version = json.value("version", 0);
|
|
if (version < 5 || version > 7)
|
|
throw Error("lock file '%s' has unsupported version %d", path, version);
|
|
|
|
std::map<std::string, ref<Node>> nodeMap;
|
|
|
|
std::function<void(Node & node, const JSON & jsonNode)> getInputs;
|
|
|
|
getInputs = [&](Node & node, const JSON & jsonNode)
|
|
{
|
|
if (jsonNode.find("inputs") == jsonNode.end()) return;
|
|
for (auto & i : jsonNode["inputs"].items()) {
|
|
if (i.value().is_array()) { // FIXME: remove, obsolete
|
|
InputPath path;
|
|
for (auto & j : i.value())
|
|
path.push_back(j);
|
|
node.inputs.insert_or_assign(i.key(), path);
|
|
} else {
|
|
std::string inputKey = i.value();
|
|
auto k = nodeMap.find(inputKey);
|
|
if (k == nodeMap.end()) {
|
|
auto & nodes = json["nodes"];
|
|
auto jsonNode2 = nodes.find(inputKey);
|
|
if (jsonNode2 == nodes.end())
|
|
throw Error("lock file references missing node '%s'", inputKey);
|
|
auto input = make_ref<LockedNode>(*jsonNode2);
|
|
k = nodeMap.insert_or_assign(inputKey, input).first;
|
|
getInputs(*input, *jsonNode2);
|
|
}
|
|
if (auto child = k->second.try_cast<LockedNode>())
|
|
node.inputs.insert_or_assign(i.key(), *child);
|
|
else
|
|
// FIXME: replace by follows node
|
|
throw Error("lock file contains cycle to root node");
|
|
}
|
|
}
|
|
};
|
|
|
|
std::string rootKey = json["root"];
|
|
nodeMap.insert_or_assign(rootKey, root);
|
|
getInputs(*root, json["nodes"][rootKey]);
|
|
|
|
// FIXME: check that there are no cycles in version >= 7. Cycles
|
|
// between inputs are only possible using 'follows' indirections.
|
|
// Once we drop support for version <= 6, we can simplify the code
|
|
// a bit since we don't need to worry about cycles.
|
|
}
|
|
|
|
JSON LockFile::toJSON() const
|
|
{
|
|
JSON nodes;
|
|
std::unordered_map<std::shared_ptr<const Node>, std::string> nodeKeys;
|
|
std::unordered_set<std::string> keys;
|
|
|
|
std::function<std::string(const std::string & key, ref<const Node> node)> dumpNode;
|
|
|
|
dumpNode = [&](std::string key, ref<const Node> node) -> std::string
|
|
{
|
|
auto k = nodeKeys.find(node);
|
|
if (k != nodeKeys.end())
|
|
return k->second;
|
|
|
|
if (!keys.insert(key).second) {
|
|
for (int n = 2; ; ++n) {
|
|
auto k = fmt("%s_%d", key, n);
|
|
if (keys.insert(k).second) {
|
|
key = k;
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
nodeKeys.insert_or_assign(node, key);
|
|
|
|
auto n = JSON::object();
|
|
|
|
if (!node->inputs.empty()) {
|
|
auto inputs = JSON::object();
|
|
for (auto & i : node->inputs) {
|
|
if (auto child = std::get_if<0>(&i.second)) {
|
|
inputs[i.first] = dumpNode(i.first, *child);
|
|
} else if (auto follows = std::get_if<1>(&i.second)) {
|
|
auto arr = JSON::array();
|
|
for (auto & x : *follows)
|
|
arr.push_back(x);
|
|
inputs[i.first] = std::move(arr);
|
|
}
|
|
}
|
|
n["inputs"] = std::move(inputs);
|
|
}
|
|
|
|
if (auto lockedNode = node.try_cast_shared<const LockedNode>()) {
|
|
n["original"] = fetchers::attrsToJSON(lockedNode->originalRef.toAttrs());
|
|
n["locked"] = fetchers::attrsToJSON(lockedNode->lockedRef.toAttrs());
|
|
if (!lockedNode->isFlake)
|
|
n["flake"] = false;
|
|
}
|
|
|
|
nodes[key] = std::move(n);
|
|
|
|
return key;
|
|
};
|
|
|
|
JSON json;
|
|
json["version"] = 7;
|
|
json["root"] = dumpNode("root", root);
|
|
json["nodes"] = std::move(nodes);
|
|
|
|
return json;
|
|
}
|
|
|
|
std::string LockFile::to_string() const
|
|
{
|
|
return toJSON().dump(2);
|
|
}
|
|
|
|
LockFile LockFile::read(const Path & path)
|
|
{
|
|
if (!pathExists(path)) {
|
|
return LockFile();
|
|
}
|
|
try {
|
|
return LockFile(json::parse(readFile(path)), path);
|
|
} catch (json::ParseError &json_parse_error) {
|
|
json_parse_error.addTrace(nullptr, "while parsing the lock file at %s", path);
|
|
throw;
|
|
}
|
|
}
|
|
|
|
std::ostream & operator <<(std::ostream & stream, const LockFile & lockFile)
|
|
{
|
|
stream << lockFile.toJSON().dump(2);
|
|
return stream;
|
|
}
|
|
|
|
void LockFile::write(const Path & path) const
|
|
{
|
|
createDirs(dirOf(path));
|
|
writeFile(path, fmt("%s\n", *this));
|
|
}
|
|
|
|
std::optional<FlakeRef> LockFile::isUnlocked() const
|
|
{
|
|
std::set<ref<const Node>> nodes;
|
|
|
|
std::function<void(ref<const Node> node)> visit;
|
|
|
|
visit = [&](ref<const Node> node)
|
|
{
|
|
if (!nodes.insert(node).second) return;
|
|
for (auto & i : node->inputs)
|
|
if (auto child = std::get_if<0>(&i.second))
|
|
visit(*child);
|
|
};
|
|
|
|
visit(root);
|
|
|
|
for (auto & i : nodes) {
|
|
if (i == ref<const Node>(root)) continue;
|
|
auto node = i.try_cast_shared<const LockedNode>();
|
|
if (node && !node->lockedRef.input.isLocked())
|
|
return node->lockedRef;
|
|
}
|
|
|
|
return {};
|
|
}
|
|
|
|
bool LockFile::operator ==(const LockFile & other) const
|
|
{
|
|
// FIXME: slow
|
|
return toJSON() == other.toJSON();
|
|
}
|
|
|
|
bool LockFile::operator !=(const LockFile & other) const
|
|
{
|
|
return !(*this == other);
|
|
}
|
|
|
|
InputPath parseInputPath(std::string_view s)
|
|
{
|
|
InputPath path;
|
|
|
|
for (auto & elem : tokenizeString<std::vector<std::string>>(s, "/")) {
|
|
if (!std::regex_match(elem, flakeIdRegex))
|
|
throw UsageError("invalid flake input path element '%s'", elem);
|
|
path.push_back(elem);
|
|
}
|
|
|
|
return path;
|
|
}
|
|
|
|
std::map<InputPath, Node::Edge> LockFile::getAllInputs() const
|
|
{
|
|
std::set<ref<Node>> done;
|
|
std::map<InputPath, Node::Edge> res;
|
|
|
|
std::function<void(const InputPath & prefix, ref<Node> node)> recurse;
|
|
|
|
recurse = [&](const InputPath & prefix, ref<Node> node)
|
|
{
|
|
if (!done.insert(node).second) return;
|
|
|
|
for (auto &[id, input] : node->inputs) {
|
|
auto inputPath(prefix);
|
|
inputPath.push_back(id);
|
|
res.emplace(inputPath, input);
|
|
if (auto child = std::get_if<0>(&input))
|
|
recurse(inputPath, *child);
|
|
}
|
|
};
|
|
|
|
recurse({}, root);
|
|
|
|
return res;
|
|
}
|
|
|
|
static std::string describe(const FlakeRef & flakeRef)
|
|
{
|
|
auto s = fmt("'%s'", flakeRef.to_string());
|
|
|
|
if (auto lastModified = flakeRef.input.getLastModified())
|
|
s += fmt(" (%s)", std::put_time(std::gmtime(&*lastModified), "%Y-%m-%d"));
|
|
|
|
return s;
|
|
}
|
|
|
|
std::ostream & operator <<(std::ostream & stream, const Node::Edge & edge)
|
|
{
|
|
if (auto node = std::get_if<0>(&edge))
|
|
stream << describe((*node)->lockedRef);
|
|
else if (auto follows = std::get_if<1>(&edge))
|
|
stream << fmt("follows '%s'", printInputPath(*follows));
|
|
return stream;
|
|
}
|
|
|
|
static bool equals(const Node::Edge & e1, const Node::Edge & e2)
|
|
{
|
|
if (auto n1 = std::get_if<0>(&e1))
|
|
if (auto n2 = std::get_if<0>(&e2))
|
|
return (*n1)->lockedRef == (*n2)->lockedRef;
|
|
if (auto f1 = std::get_if<1>(&e1))
|
|
if (auto f2 = std::get_if<1>(&e2))
|
|
return *f1 == *f2;
|
|
return false;
|
|
}
|
|
|
|
std::string LockFile::diff(const LockFile & oldLocks, const LockFile & newLocks)
|
|
{
|
|
auto oldFlat = oldLocks.getAllInputs();
|
|
auto newFlat = newLocks.getAllInputs();
|
|
|
|
auto i = oldFlat.begin();
|
|
auto j = newFlat.begin();
|
|
std::string res;
|
|
|
|
while (i != oldFlat.end() || j != newFlat.end()) {
|
|
if (j != newFlat.end() && (i == oldFlat.end() || i->first > j->first)) {
|
|
res += fmt("• " ANSI_GREEN "Added input '%s':" ANSI_NORMAL "\n %s\n",
|
|
printInputPath(j->first), j->second);
|
|
++j;
|
|
} else if (i != oldFlat.end() && (j == newFlat.end() || i->first < j->first)) {
|
|
res += fmt("• " ANSI_RED "Removed input '%s'" ANSI_NORMAL "\n", printInputPath(i->first));
|
|
++i;
|
|
} else {
|
|
if (!equals(i->second, j->second)) {
|
|
res += fmt("• " ANSI_BOLD "Updated input '%s':" ANSI_NORMAL "\n %s\n → %s\n",
|
|
printInputPath(i->first),
|
|
i->second,
|
|
j->second);
|
|
}
|
|
++i;
|
|
++j;
|
|
}
|
|
}
|
|
|
|
return res;
|
|
}
|
|
|
|
void LockFile::check()
|
|
{
|
|
auto inputs = getAllInputs();
|
|
|
|
for (auto & [inputPath, input] : inputs) {
|
|
if (auto follows = std::get_if<1>(&input)) {
|
|
if (!follows->empty() && !findInput(*follows))
|
|
throw Error("input '%s' follows a non-existent input '%s'",
|
|
printInputPath(inputPath),
|
|
printInputPath(*follows));
|
|
}
|
|
}
|
|
}
|
|
|
|
void check();
|
|
|
|
std::string printInputPath(const InputPath & path)
|
|
{
|
|
return concatStringsSep("/", path);
|
|
}
|
|
|
|
}
|