public
/
nixpkgs
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

references-by-popularity: create debug output

This commit is contained in:
Graham Christensen 2019-03-05 16:29:20 -05:00
parent eef63417d4
commit 54826e7471
No known key found for this signature in database
GPG Key ID: ACA1C1D120C83D5C
1 changed files with 22 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

23
pkgs/build-support/references-by-popularity/closure-graph.py
View File

@ -117,6 +117,17 @@ import unittest
from pprint import pprint from pprint import pprint
from collections import defaultdict from collections import defaultdict
def debug(msg, *args, **kwargs):
if False:
print(
"DEBUG: {}".format(
msg.format(*args, **kwargs)
),
file=sys.stderr
)
# Find paths in the original dataset which are never referenced by # Find paths in the original dataset which are never referenced by
# any other paths # any other paths
def find_roots(closures): def find_roots(closures):
@ -330,6 +341,7 @@ class TestMakeLookup(unittest.TestCase):
def make_graph_segment_from_root(root, lookup): def make_graph_segment_from_root(root, lookup):
children = {} children = {}
for ref in lookup[root]: for ref in lookup[root]:
debug("Making graph segments on {}".format(ref))
children[ref] = make_graph_segment_from_root(ref, lookup) children[ref] = make_graph_segment_from_root(ref, lookup)
return children return children
@ -384,6 +396,7 @@ class TestMakeGraphSegmentFromRoot(unittest.TestCase):
def graph_popularity_contest(full_graph): def graph_popularity_contest(full_graph):
popularity = defaultdict(int) popularity = defaultdict(int)
for path, subgraph in full_graph.items(): for path, subgraph in full_graph.items():
debug("Calculating popularity under {}".format(path))
popularity[path] += 1 popularity[path] += 1
subcontest = graph_popularity_contest(subgraph) subcontest = graph_popularity_contest(subgraph)
for subpath, subpopularity in subcontest.items(): for subpath, subpopularity in subcontest.items():
@ -474,6 +487,7 @@ def main():
filename = sys.argv[1] filename = sys.argv[1]
key = sys.argv[2] key = sys.argv[2]
debug("Loading from {}", filename)
with open(filename) as f: with open(filename) as f:
data = json.load(f) data = json.load(f)
@ -497,14 +511,21 @@ def main():
# ] # ]
graph = data[key] graph = data[key]
debug("Finding roots from {}", key)
roots = find_roots(graph); roots = find_roots(graph);
debug("Making lookup for {}", key)
lookup = make_lookup(graph) lookup = make_lookup(graph)
full_graph = {} full_graph = {}
for root in roots: for root in roots:
debug("Making full graph for {}", root)
full_graph[root] = make_graph_segment_from_root(root, lookup) full_graph[root] = make_graph_segment_from_root(root, lookup)
ordered = order_by_popularity(graph_popularity_contest(full_graph)) debug("Running contest")
contest = graph_popularity_contest(full_graph)
debug("Ordering by popularity")
ordered = order_by_popularity(contest)
debug("Checking for missing paths")
missing = [] missing = []
for path in all_paths(graph): for path in all_paths(graph):
if path not in ordered: if path not in ordered: