mirror of
https://github.com/CumulusNetworks/ifupdown2.git
synced 2024-05-06 15:54:50 +00:00
cca03c30c5
added a --with-depends option) Ticket: CM-1438 Reviewed By: Testing Done: still debating on the default behaviour for following dependents. for now not following dependents might be better. When all interfaces are selected, it always follows dependents
145 lines
4.4 KiB
Python
145 lines
4.4 KiB
Python
#!/usr/bin/python
|
|
#
|
|
# Copyright 2013. Cumulus Networks, Inc.
|
|
# Author: Roopa Prabhu, roopa@cumulusnetworks.com
|
|
#
|
|
# graph --
|
|
# graph helper module for ifupdown
|
|
#
|
|
|
|
import logging
|
|
from collections import deque
|
|
try:
|
|
from gvgen import *
|
|
except ImportError, e:
|
|
pass
|
|
|
|
class graph():
|
|
|
|
def __init__(self):
|
|
self.logger = logging.getLogger('ifupdown.' +
|
|
self.__class__.__name__)
|
|
|
|
@classmethod
|
|
def topological_sort_graphs_all(cls, dependency_graphs, indegrees):
|
|
S = []
|
|
Q = deque()
|
|
|
|
for ifname,indegree in indegrees.items():
|
|
if indegree == 0:
|
|
Q.append(ifname)
|
|
|
|
while len(Q) != 0:
|
|
# initialize queue
|
|
x = Q.popleft()
|
|
|
|
# Get dependents of x
|
|
dlist = dependency_graphs.get(x)
|
|
if dlist == None or len(dlist) == 0:
|
|
S.append(x)
|
|
continue
|
|
|
|
for y in dlist:
|
|
indegrees[y] = indegrees.get(y) - 1
|
|
if indegrees.get(y) == 0:
|
|
Q.append(y)
|
|
|
|
S.append(x)
|
|
|
|
for ifname,indegree in indegrees.items():
|
|
if indegree != 0:
|
|
raise Exception('cycle found involving iface %s' %ifname +
|
|
' (indegree %d)' %indegree)
|
|
|
|
return S
|
|
|
|
@classmethod
|
|
def topological_sort_graph(cls, dependency_graph, indegrees, rootifname):
|
|
S = []
|
|
Q = deque()
|
|
|
|
Q.append(rootifname)
|
|
|
|
while len(Q) != 0:
|
|
# initialize queue
|
|
x = Q.popleft()
|
|
|
|
# Get dependents of x
|
|
dlist = dependency_graph.get(x)
|
|
if dlist == None or len(dlist) == 0:
|
|
S.append(x)
|
|
continue
|
|
|
|
for y in dlist:
|
|
indegrees[y] = indegrees.get(y) - 1
|
|
if indegrees.get(y) == 0:
|
|
Q.append(y)
|
|
|
|
S.append(x)
|
|
|
|
return S
|
|
|
|
@classmethod
|
|
def topological_sort_graphs(cls, dependency_graphs, indegrees):
|
|
""" Sorts graph one at a time merges all the sorted graph
|
|
lists and returns a combined list
|
|
|
|
"""
|
|
sorted_graphs_list = []
|
|
for ifname,indegree in indegrees.items():
|
|
if indegree == 0:
|
|
sorted_graphs_list += cls.topological_sort_graph(
|
|
dependency_graphs, indegrees, ifname)
|
|
# If some indegrees are non zero, we have a cycle
|
|
for ifname,indegree in indegrees.items():
|
|
if indegree != 0:
|
|
raise Exception('cycle found involving iface %s' %ifname +
|
|
' (indegree %d)' %indegree)
|
|
|
|
return sorted_graphs_list
|
|
|
|
@classmethod
|
|
def add_to_dot_old(cls, dependency_graph, gvgraph, v, parentgvitem):
|
|
dependents = dependency_graph.get(v, [])
|
|
if dependents is None:
|
|
return
|
|
if len(dependents) > 1:
|
|
# if more than one dependents .., add them to a box
|
|
box = gvgraph.newItem(v)
|
|
for d in dependents:
|
|
dnode = gvgraph.newItem(d, box)
|
|
cls.add_to_dot(dependency_graph, gvgraph, d, dnode)
|
|
if parentgvitem is not None: gvgraph.newLink(parentgvitem,
|
|
dnode)
|
|
else:
|
|
for d in dependents:
|
|
dnode = gvgraph.newItem(d)
|
|
cls.add_to_dot(dependency_graph, gvgraph, d, dnode)
|
|
if parentgvitem is not None: gvgraph.newLink(parentgvitem,
|
|
dnode)
|
|
|
|
@classmethod
|
|
def add_to_dot(cls, dependency_graph, gvgraph, v, parentgvitem):
|
|
vnode = gvgraph.newItem(v)
|
|
if parentgvitem is not None: gvgraph.newLink(parentgvitem, vnode)
|
|
dependents = dependency_graph.get(v, [])
|
|
if dependents is None:
|
|
return
|
|
for d in dependents:
|
|
cls.add_to_dot(dependency_graph, gvgraph, d, vnode)
|
|
|
|
@classmethod
|
|
def generate_dot(cls, dependency_graph, v):
|
|
gvgraph = GvGen()
|
|
cls.add_to_dot(dependency_graph, gvgraph, v, None)
|
|
gvgraph.dot(name=v)
|
|
|
|
@classmethod
|
|
def generate_dots(cls, dependency_graph, indegrees):
|
|
roots = [k for k, v in indegrees.items() if v == 0]
|
|
if roots is None:
|
|
return
|
|
print roots
|
|
map(lambda r: cls.generate_dot(dependency_graph, r), roots)
|
|
|