KCC: graph the result of partial edge reversal

What it shows is we don't ever reverse an edge because we have no
partial replica in our test.

Signed-off-by: Douglas Bagnall <douglas.bagnall@catalyst.net.nz>
Reviewed-by: Garming Sam <garming@catalyst.net.nz>
Reviewed-by: Andrew Bartlett <abartlet@samba.org>

diff --git a/source4/scripting/bin/samba_kcc b/source4/scripting/bin/samba_kcc
index 1838e251c98485401e48d68b7952d71d21a111d6..5dcda3e09950565f01784e36ae981078225dd22b 100755 (executable)
--- a/source4/scripting/bin/samba_kcc
+++ b/source4/scripting/bin/samba_kcc
@@ -2706,6 +2706,20 @@ def get_spanning_tree_edges(graph, my_site, label=None):
                     edge.vertices[:] = w, v
             edge_list.append(edge)
 
+    if opts.verify or opts.dot_files:
+        graph_edges = [[x.site.site_dnstr for x in e.vertices]
+                       for e in edge_list]
+        #add the reverse edge if not directed.
+        graph_edges.extend([x.site.site_dnstr
+                            for x in reversed(e.vertices)]
+                           for e in edge_list if not e.directed)
+        graph_nodes = [v.site.site_dnstr for v in graph.vertices]
+        verify_properties = ()
+        verify_and_dot('post-one-way-partial', graph_edges, graph_nodes,
+                       label=label, properties=verify_properties,
+                       debug=DEBUG, verify=opts.verify,
+                       directed=True,
+                       dot_files=opts.dot_files)
 
     # count the components
     return edge_list, components