73c2ae43f0
This prints the references graph of the store paths in the graphML format [1]. The graphML format is supported by several graph tools such as the Python Networkx library or the Apache Thinkerpop project. [1] http://graphml.graphdrawing.org
90 lines
2.3 KiB
C++
90 lines
2.3 KiB
C++
#include "graphml.hh"
|
|
#include "util.hh"
|
|
#include "store-api.hh"
|
|
#include "derivations.hh"
|
|
|
|
#include <iostream>
|
|
|
|
|
|
using std::cout;
|
|
|
|
namespace nix {
|
|
|
|
|
|
static inline const string & xmlQuote(const string & s)
|
|
{
|
|
// Luckily, store paths shouldn't contain any character that needs to be
|
|
// quoted.
|
|
return s;
|
|
}
|
|
|
|
|
|
static string symbolicName(const string & path)
|
|
{
|
|
string p = baseNameOf(path);
|
|
return string(p, p.find('-') + 1);
|
|
}
|
|
|
|
|
|
static string makeEdge(const string & src, const string & dst)
|
|
{
|
|
return fmt(" <edge source=\"%1%\" target=\"%2%\"/>\n",
|
|
xmlQuote(src), xmlQuote(dst));
|
|
}
|
|
|
|
|
|
static string makeNode(const ValidPathInfo & info)
|
|
{
|
|
return fmt(
|
|
" <node id=\"%1%\">\n"
|
|
" <data key=\"narSize\">%2%</data>\n"
|
|
" <data key=\"name\">%3%</data>\n"
|
|
" <data key=\"type\">%4%</data>\n"
|
|
" </node>\n",
|
|
info.path,
|
|
info.narSize,
|
|
symbolicName(info.path),
|
|
(isDerivation(info.path) ? "derivation" : "output-path"));
|
|
}
|
|
|
|
|
|
void printGraphML(ref<Store> store, const PathSet & roots)
|
|
{
|
|
PathSet workList(roots);
|
|
PathSet doneSet;
|
|
std::pair<PathSet::iterator,bool> ret;
|
|
|
|
cout << "<?xml version='1.0' encoding='utf-8'?>\n"
|
|
<< "<graphml xmlns='http://graphml.graphdrawing.org/xmlns'\n"
|
|
<< " xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance'\n"
|
|
<< " xsi:schemaLocation='http://graphml.graphdrawing.org/xmlns/1.0/graphml.xsd'>\n"
|
|
<< "<key id='narSize' for='node' attr.name='narSize' attr.type='int'/>"
|
|
<< "<key id='name' for='node' attr.name='name' attr.type='string'/>"
|
|
<< "<key id='type' for='node' attr.name='type' attr.type='string'/>"
|
|
<< "<graph id='G' edgedefault='directed'>\n";
|
|
|
|
while (!workList.empty()) {
|
|
Path path = *(workList.begin());
|
|
workList.erase(path);
|
|
|
|
ret = doneSet.insert(path);
|
|
if (ret.second == false) continue;
|
|
|
|
ValidPathInfo info = *(store->queryPathInfo(path));
|
|
cout << makeNode(info);
|
|
|
|
for (auto & p : store->queryPathInfo(path)->references) {
|
|
if (p != path) {
|
|
workList.insert(p);
|
|
cout << makeEdge(path, p);
|
|
}
|
|
}
|
|
|
|
}
|
|
|
|
cout << "</graph>\n";
|
|
cout << "</graphml>\n";
|
|
}
|
|
|
|
|
|
}
|