ó E®Uc @sBddlZddlZddlmZmZmZmZmZddlmZm Z m Z ddde e ddddd„ Zdefd„ƒYZd„Zd„Zd „Zd „Zd „Zd „Zd „Zd„Zd„Zd„Zde de ed„Zdde e de de ddddd„ Zd„ZdS(iÿÿÿÿN(t null_debugtPURPLEtMAGENTAt DARK_YELLOWtRED(t DARK_GREENtC_NORMALtGREYc  Csî|r#|d|jddƒ7}nttjj|d|ƒdƒ} |dk ra|| jƒndjd„|Dƒƒ} | d|rdnd | fIJ| d |pª| IJ|rxft|ƒD]U\} }|rè|jd d ƒ}n| rüd | | nd}| d||fIJqÁWnx¶t|ƒD]¨\} }|\}}|ro|jd d ƒ}|jd d ƒ}n|r{dnd}| r•d| | nd}|r¯d || nd}| d|||||fIJq*W| dIJ| j ƒdS(Nt_s, s%s.dottwtcss!|]}|jƒr|VqdS(N(tisalnum(t.0tx((s9/usr/lib/python2.7/dist-packages/samba/kcc/graph_utils.pys (ss%s %s {tdigraphtgraphslabel="%s"; fontsize=20;t,s\ns color="%s"s "%s" [%s];s->s--s label="%s"s"%s" %s "%s" [%s %s];t}( t translatetNonetopentostpathtjointnamet enumeratetreplacetclose(tbasenamet edge_listtverticestlabelt dot_file_dirtreformat_labelstdirectedtdebugt edge_colorst edge_labelst vertex_colorstft graphnametitvtvctedgetatbtlineteltec((s9/usr/lib/python2.7/dist-packages/samba/kcc/graph_utils.pytwrite_dot_files2"   ! t GraphErrorcBseZRS((t__name__t __module__(((s9/usr/lib/python2.7/dist-packages/samba/kcc/graph_utils.pyR3?scCs˜x‘|D]‰}tƒ}xL|D]D\}}||krE|j|ƒq||kr|j|ƒqqWt|ƒdt|ƒkrtdƒ‚qqWdS(sXThe graph is complete, which is to say there is an edge between every pair of nodes.isgraph is not fully connectedN(tsettaddtlenR3(tedgesRt edge_verticesR*tremotesR-R.((s9/usr/lib/python2.7/dist-packages/samba/kcc/graph_utils.pytverify_graph_completeCs    c Csh|sAt|ƒdkrdStdt|ƒt|ƒfƒ‚nt|ƒ}t|jƒƒ}x³trg}xxt|ƒD]j\}}|\}} ||kr¼|j| ƒ|j |ƒq{| |kr{|j|ƒ|j |ƒq{q{W|sóPnxt |ƒD] }||=qWqbW|s-|t|ƒkrdtdt|ƒt|ƒt|ƒt|ƒfƒ‚ndS(s&There is a path between any two nodes.iNs9disconnected vertices were found: vertices: %s edges: %ssRgraph is not connected: vertices: %s edges: %s reached: %s remaining edges: %s( R8R3tsortedtlistR6tpoptTrueRR7tappendtreversed( R9RR:tremaining_edgestreachedtdoomedR)teR-R.((s9/usr/lib/python2.7/dist-packages/samba/kcc/graph_utils.pytverify_graph_connectedQs2       cCs;x4tj|t|ƒdƒD]}t|||ƒqWdS(s:The graph stays connected when any single edge is removed.iN(t itertoolst combinationsR8RG(R9RR:tsubset((s9/usr/lib/python2.7/dist-packages/samba/kcc/graph_utils.pyt*verify_graph_connected_under_edge_failuresrs#cCsoxh|D]`}g|D]}||k r|^q}g|D]}||kr9|^q9}t|||ƒqWdS(s<The graph stays connected when any single vertex is removed.N(RG(R9RR:R*R t sub_verticest sub_edges((s9/usr/lib/python2.7/dist-packages/samba/kcc/graph_utils.pyt,verify_graph_connected_under_vertex_failuresxs %%cCs°g|D]}t|ƒ^q}xŠtr«x}tj|dƒD]e\}}||@}|r;t|ƒdkr„||O}|j|ƒPq td|||fƒ‚q;q;WdSq"WdS(sKThe graph contains no loops. A forest that is also connected is a tree.iisDthere is a loop in the graph vertices %s edges %s intersection %sN(R6R@RHRIR8tremoveR3(R9RR:RFttreesR-R.t intersection((s9/usr/lib/python2.7/dist-packages/samba/kcc/graph_utils.pytverify_graph_forests    c Cs¯t|ƒ}g|D]}t|ƒ^q}x}trªxptj|dƒD]X\}}||@}|rGt|ƒdkr||O}|j|ƒPqŸtdƒ‚qGqGWdSq.WdS(s,This allows a forest with duplicate edges. That is if multiple edges go between the same two vertices, they are treated as a single edge by this test. e.g.: o pass: o-o=o o=o (|) fail: o-o `o o `o' iisthere is a loop in the graphN(R6R@RHRIR8ROR3( R9RR:t unique_edgesRFRPR-R.RQ((s9/usr/lib/python2.7/dist-packages/samba/kcc/graph_utils.pytverify_graph_multi_edge_forestœs     cCsBt|ƒt|ƒ}|r>tddjt|ƒƒƒ‚ndS(s$There are no vertices without edges.s#some vertices are not connected: %ss N(R6R3RR=(R9RR:tlonely((s9/usr/lib/python2.7/dist-packages/samba/kcc/graph_utils.pytverify_graph_no_lonely_vertices¶scCsBt|ƒt|ƒ}|r>tddjt|ƒƒƒ‚ndS(sBThe edge endpoints contain no vertices that are otherwise unknown.s,some edge vertices are seemingly unknown: %ss N(R6R3RR=(R9RR:tunknown((s9/usr/lib/python2.7/dist-packages/samba/kcc/graph_utils.pyt verify_graph_no_unknown_vertices¾scs,| rt|ƒdkrdSt|ƒdt|ƒkrHtdƒ‚nt|ƒ}tƒ}xd|D]\}|d|df}||krd||krd|j|ƒ|j|ƒ|j|ƒqdqdWi}xL|D]D\}} |j|tƒƒj| ƒ|j| tƒƒj|ƒqÑWx?|jƒD]1\} } t| ƒdkr&td| ƒ‚q&q&Wxv|jƒD]h} || } | s„qhnxB| D]:‰|ˆ} | j| ƒ| j‡fd†| Dƒƒq‹W|| =qhWt|ƒdkrtdd j |jƒƒƒ‚nt |||ƒt |||ƒdS( s7Each node has at least two directed edges leaving it, and two arriving. The edges work in pairs that have the same end points but point in opposite directions. The pairs form a path that touches every vertex and form a loop. There might be other connections that *aren't* part of the ring. Deciding this for sure is NP-complete (the Hamiltonian path problem), but there are some easy failures that can be detected. So far we check for: - leaf nodes - disjoint subgraphs - robustness against edge and vertex failure iNisFdirected double ring requires at least twice as many edges as verticesis2wanted double directed ring, found a leaf node(%s)c3s!|]}|ˆkr|VqdS(N((R R (tn(s9/usr/lib/python2.7/dist-packages/samba/kcc/graph_utils.pys ssZwanted double directed ring, but this looks like a split graph (%s can't reach each other)s, ( R8R3R6R7ROt setdefaulttitemstkeystupdateRRKRN(R9RR:t half_duplext duplex_linksR,trev_edgetedge_mapR-R.tvertext neighbourstnsett n_neighbours((RYs9/usr/lib/python2.7/dist-packages/samba/kcc/graph_utils.pyt!verify_graph_directed_double_ringÆsH          !   cCs•t|ƒdkrdSt|ƒdkr…t|ƒdkrv|dd|ddkrv|dd|ddkrvdStdƒ‚nt|||ƒS(sŒThis performs the directed_double_ring test but makes special concessions for small rings where the strict rules don't really apply.iNiis0A two vertex graph should have an edge each way.(R8R3Rf(R9RR:((s9/usr/lib/python2.7/dist-packages/samba/kcc/graph_utils.pyt*verify_graph_directed_double_ring_or_smallscCs g}|dtt|tfƒg|D]}|jddƒ^q'}tƒ} x.|D]&\} } | j| ƒ| j| ƒqUW|dkr”| }n;t|ƒ}|| krÏ|dt| ƒt|ƒfƒnx¨|D] } d| } ytƒ| }Wn(t k r!|j | d| fƒnXy+|||| ƒ|dt | tfƒWqÖt k ru}|j | |fƒqÖXqÖW|r|r²t d|d j d „|Dƒƒfƒ‚n|d t|tfƒx.|D]&\} }|d | t|tfƒqÐW|tƒndS( Ns"%sStarting verify_graph for %s%s%st Rs7vertices in edges don't match given vertices: %s != %ssverify_graph_%ss'There is no verification check for '%s's %s%18s:%s verified!s1The '%s' graph lacks the following properties: %ss css|]}d|VqdS(s%s: %sN((R R ((s9/usr/lib/python2.7/dist-packages/samba/kcc/graph_utils.pys Lss%s%s%s FAILED:s %18s: %s%s%s(RRRRR6R7RR=tglobalstKeyErrorRARR3RRR(ttitleR9RR"t propertiestfatalR#terrorsR R:R-R.tptfnR'RF((s9/usr/lib/python2.7/dist-packages/samba/kcc/graph_utils.pyt verify_graph'sB %         &cCs—d||pdf}| rAt|||d|d|d|ƒn| dk r“t||d|d|d| d |d |d|d | d | d | ƒ ndS(Ns%s %sR RlRmR#RRR R!R"R$R%R&(RqRR2(RR9RRR!R"RlRmR#tverifyR R$R%R&Rk((s9/usr/lib/python2.7/dist-packages/samba/kcc/graph_utils.pytverify_and_dotSs   cCsuxnttƒjƒƒD]W\}}|jdƒr|jddƒGH|jridt|jjƒtfGHqmHqqWdS(Nt verify_graph_R s %s%s%s( R=RiR[t startswithRt__doc__RtrstripR(tkR*((s9/usr/lib/python2.7/dist-packages/samba/kcc/graph_utils.pytlist_verify_testsfs " (((RRHtsamba.kcc.debugRRRRRRRRRR@tFalseR2t ExceptionR3R<RGRKRNRRRTRVRXRfRgRqRsRy(((s9/usr/lib/python2.7/dist-packages/samba/kcc/graph_utils.pyts6  (     !      P  +