sin/samba-mirror
1
0
Fork 0
mirror of https://github.com/samba-team/samba.git synced 2024-12-22 13:34:15 +03:00
Code

KCC: add graph tests of robustness against edge and vertex failure

Browse Source 
These tests are themselves tested in a later patch.

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>
This commit is contained in:
Douglas Bagnall 2015-04-09 14:31:17 +12:00 committed by Andrew Bartlett
parent cb8b99e335
commit 4e781857e3
1 changed files with 24 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

27
python/samba/graph_utils.py
View File

@ -120,6 +120,18 @@ def verify_graph_connected(edges, vertices, edge_vertices):
(sorted(vertices), sorted(edges)))
def verify_graph_connected_under_edge_failures(edges, vertices, edge_vertices):
"""The graph stays connected when any single edge is removed."""
for subset in itertools.combinations(edges, len(edges) - 1):
verify_graph_connected(edges, vertices, edge_vertices)
def verify_graph_connected_under_vertex_failures(edges, vertices, edge_vertices):
"""The graph stays connected when any single vertex is removed."""
for v in vertices:
sub_vertices = [x for x in vertices if x is not v]
sub_edges = [x for x in edges if v not in x]
verify_graph_connected(sub_edges, sub_vertices, sub_vertices)
def verify_graph_forest(edges, vertices, edge_vertices):
"""The graph contains no loops. A forest that is also connected is a
@ -203,8 +215,7 @@ def verify_graph_directed_double_ring(edges, vertices, edge_vertices):
So far we check for:
- leaf nodes
- disjoint subgraphs
But, for example, a figure-8 topology will not be found.
- robustness against edge and vertex failure
"""
# a zero or one node graph is OK with no edges.
# The two vertex case is special. Use
@ -265,8 +276,17 @@ def verify_graph_directed_double_ring(edges, vertices, edge_vertices):
"(%s can't reach each other)" %
', '.join(edge_map.keys()))
verify_graph_connected_under_edge_failures(duplex_links, vertices,
edge_vertices)
verify_graph_connected_under_vertex_failures(duplex_links, vertices,
edge_vertices)
def verify_graph_directed_double_ring_or_small(edges, vertices, edge_vertices):
"""This performs the directed_double_ring test but makes special
concessions for small rings where the strict rules don't really
apply."""
if len(vertices) < 2:
return
if len(vertices) == 2:
@ -342,11 +362,12 @@ def verify_and_dot(basename, edges, vertices=None, label=None, destdir=None,
edge_colors=edge_colors, edge_labels=edge_labels,
vertex_colors=vertex_colors)
def list_verify_tests():
for k, v in sorted(globals().items()):
if k.startswith('verify_graph_'):
print k.replace('verify_graph_', '')
if v.__doc__:
print ' %s%s%s' %(GREY, v.__doc__, C_NORMAL)
print ' %s%s%s' %(GREY, v.__doc__.rstrip(), C_NORMAL)
else:
print