lix/src/nix-store/dotgraph.cc

157 lines
3.7 KiB
C++
Raw Normal View History

#include "dotgraph.hh"
#include "util.hh"
#include "store-api.hh"
#include <iostream>
using std::cout;
namespace nix {
static string dotQuote(const string & s)
{
return "\"" + s + "\"";
}
static string nextColour()
{
static int n = 0;
static string colours[] =
2016-01-28 15:01:01 +00:00
{ "black", "red", "green", "blue"
, "magenta", "burlywood" };
return colours[n++ % (sizeof(colours) / sizeof(string))];
}
static string makeEdge(const string & src, const string & dst)
{
format f = format("%1% -> %2% [color = %3%];\n")
2016-01-28 15:01:01 +00:00
% dotQuote(src) % dotQuote(dst) % dotQuote(nextColour());
return f.str();
}
static string makeNode(const string & id, const string & label,
const string & colour)
{
format f = format("%1% [label = %2%, shape = box, "
2016-01-28 15:01:01 +00:00
"style = filled, fillcolor = %3%];\n")
% dotQuote(id) % dotQuote(label) % dotQuote(colour);
return f.str();
}
static string symbolicName(const string & path)
{
string p = baseNameOf(path);
2005-03-26 22:06:57 +00:00
int dash = p.find('-');
return string(p, dash + 1);
}
#if 0
string pathLabel(const Path & nePath, const string & elemPath)
{
return (string) nePath + "-" + elemPath;
}
void printClosure(const Path & nePath, const StoreExpr & fs)
{
PathSet workList(fs.closure.roots);
PathSet doneSet;
2005-03-26 22:06:57 +00:00
for (PathSet::iterator i = workList.begin(); i != workList.end(); ++i) {
2016-01-28 15:01:01 +00:00
cout << makeEdge(pathLabel(nePath, *i), nePath);
}
while (!workList.empty()) {
2016-01-28 15:01:01 +00:00
Path path = *(workList.begin());
workList.erase(path);
if (doneSet.find(path) == doneSet.end()) {
doneSet.insert(path);
ClosureElems::const_iterator elem = fs.closure.elems.find(path);
if (elem == fs.closure.elems.end())
throw Error(format("bad closure, missing path %1%") % path);
2016-01-28 15:01:01 +00:00
for (StringSet::const_iterator i = elem->second.refs.begin();
i != elem->second.refs.end(); ++i)
{
workList.insert(*i);
cout << makeEdge(pathLabel(nePath, *i), pathLabel(nePath, path));
}
cout << makeNode(pathLabel(nePath, path),
symbolicName(path), "#ff0000");
}
}
}
2005-03-26 22:06:57 +00:00
#endif
2016-02-04 14:10:47 +00:00
void printDotGraph(ref<Store> store, const PathSet & roots)
{
PathSet workList(roots);
PathSet doneSet;
2016-01-28 15:01:01 +00:00
cout << "digraph G {\n";
while (!workList.empty()) {
2016-01-28 15:01:01 +00:00
Path path = *(workList.begin());
workList.erase(path);
2016-01-28 15:01:01 +00:00
if (doneSet.find(path) != doneSet.end()) continue;
2005-03-26 22:06:57 +00:00
doneSet.insert(path);
2005-03-26 22:06:57 +00:00
cout << makeNode(path, symbolicName(path), "#ff0000");
2016-01-28 15:01:01 +00:00
for (auto & p : store->queryPathInfo(path)->references) {
if (p != path) {
workList.insert(p);
cout << makeEdge(p, path);
}
2005-03-26 22:06:57 +00:00
}
2016-01-28 15:01:01 +00:00
#if 0
StoreExpr ne = storeExprFromPath(path);
string label, colour;
if (ne.type == StoreExpr::neDerivation) {
for (PathSet::iterator i = ne.derivation.inputs.begin();
i != ne.derivation.inputs.end(); ++i)
{
workList.insert(*i);
cout << makeEdge(*i, path);
}
label = "derivation";
colour = "#00ff00";
for (StringPairs::iterator i = ne.derivation.env.begin();
i != ne.derivation.env.end(); ++i)
if (i->first == "name") label = i->second;
}
else if (ne.type == StoreExpr::neClosure) {
label = "<closure>";
colour = "#00ffff";
printClosure(path, ne);
}
else abort();
cout << makeNode(path, label, colour);
2005-03-26 22:06:57 +00:00
#endif
}
cout << "}\n";
}
2016-01-28 15:01:01 +00:00
}