c, dZdZeZddlmZddlZddlZddl Z ddl Z ddl Z ddl m Z mZmZmZmZmZmZdZdZGddZd ZGd d ZGd d eZedZe eeefZdedeedffdZddedeedeefdZdedededeededdf dZ dde e ee fde de deee deee f dZ!y)z^Graph manipulation utilities. (dot generation adapted from pypy/translator/tool/make_dot.py) zrestructuredtext enN)DictListTupleOptionalSetTypeVarIterablec|jdDcgc]}|jdd}}dj|}d|zScc}w)z"Make usable in a dot file. "z\"z\lz\n)splitreplacejoin)valuelinelinesdatas 6/usr/lib/python3/dist-packages/logilab/common/graph.pyescaper$sG27++d2C D$T\\#u % DE D ::e D 4< EsActj|}tjtj|}|j dd}|||fS)zDTransforms /some/path/foo.png into ('/some/path', 'foo.png', 'png')..)ospbasenamedirnameabspathr )filenamerstoredirtargets rtarget_info_from_filenamer +sG||H%H{{3;;x01H ^^C  $F Xv %%cTeZdZdZdddddifdZdZeeZd dZdZ d Z d Z y) DotBackendzDot File backend.Nutf-8dotc||_||_g|_d|_|j dt |z|r|j d|z|r|j d|z|r|j d|z|r0|j dvs Jd|z|j d|zt|jD]"}|j dj|$y) Nz digraph %s {z rankdir=%szratio=%sz size="%s")r$z iso-8859-1latin1zunsupported charset %sz charset="%s"=) graphnamerendererr_sourceemitnormalize_node_idlowersorteditemsr) selfr)rankdirsizeratiocharsetr*additionnal_paramparams r__init__zDotBackend.__init__6s#     .#4Y#??@  IIlW, -  IIj5( )  IIkD( ) ==?&GG (72 G IInw. /-3356 'E IIchhuo & 'r!c|j3|jddj|j|_|`|jS)zreturns self._sourcez} r )r+r,rr)r1s r get_sourcezDotBackend.get_sourceSs; <<  IIe 99TZZ0DL ||r!c ddl}|j}|s|r|jdr|}nd|z}|Zt|\}}}|dk7r/t j d|\} } t j| nutj||} n^d}t j d|\} } t j d|\} }t j| t j| tj| dd } | j|j| j|dk7rztjd k(rd } nd } |r'|j!|j"dd|d|| d|g | n#|j!|j"d|| d|g| t j.| |S#t$$rH} | j&t&j(k(r!dj+|j"| _Yd} ~ cd} ~ wwxYw)zGenerates a graph file. :param outputfile: filename and path [defaults to graphname.png] :param dotfile: filename and path [defaults to graphname.dot] :rtype: str :return: a path to the generated file rNz.dotz%s.dotr%pngz.pngwutf8)encodingwin32TFz-Tcmapxz-oz-T)shellzFile not found: {}) subprocessr)endswithr tempfilemkstemposcloserrcodecsopenwritesourcesysplatformcallr*OSErrorerrnoENOENTformatstrerrorunlink)r1 outputfiledotfilemapfilerBnamerrrpdotdot_sourcepathppng use_shelles rgeneratezDotBackend.generate]s ~~j11&9$"T/  !)B:)N &Hh'/'7'7'E$n!$(G!<F#+#3#3FD#A D.'//= D* HHTN HHTN{{>3@ 4;; U?||w& !  OO MM% # "* & ($ OOfndJW'$ IIn %  77ell*!5!G88G=c:|jj|y)zAdds to final output.N)rappend)r1rs rr,zDotBackend.emits $r!c |jDcgc] \}}|d|d}}}t|t|}}|j|d|ddjt |dycc}}w)zwemit an edge from to . edge properties: see http://www.graphviz.org/doc/info/attrs.html ="r  ->  [, ];N)r0r-r,rr/) r1name1name2propsproprattrsn_fromn_tos r emit_edgezDotBackend.emit_edgesa?DkkmL{tUdE*LL(/1B51I fdDIIfUm4LMNMsA2c |jDcgc] \}}|d|d}}}|jt|ddjt |dycc}}w)ztemit a node with given properties. node properties: see http://www.graphviz.org/doc/info/attrs.html rbr rdrerfN)r0r,r-rr/)r1rXrirjrrks r emit_nodezDotBackend.emit_nodesQ?DkkmL{tUdE*LL 1$ 76%=9QRSMsA")NNN) __name__ __module__ __qualname____doc__r8r:propertyrKr^r,rnrpr!rr#r#3sG  ':j !FAF OTr!r#c d|zS)z)Returns a suitable DOT node id for `nid`.z"%s"rv)nids rr-r-s C<r!ceZdZdZddZy)GraphGeneratorc||_yN)backend)r1r}s rr8zGraphGenerator.__init__s  r!Ncj||_|jD]3\}}|j|}|jj|fi|5|j D]7\}} } |j | || }|jj|| fi|9|jj||S)N)rUrW) propshdlrnodesnode_propertiesr}rpedgesedge_propertiesrnr^) r1visitorrrUrWnodeidnoderisubjnodeobjnodeedges rr^zGraphGenerator.generates##MMO 4LFD--d3E "DLL " "6 3U 3 4(/}} ? #Hgt--dHgFE "DLL " "8W > > ?||$$ G$LLr!)NN)rqrrrsr8r^rvr!rrzrzs  Mr!rzc eZdZy)UnorderableGraphN)rqrrrsrvr!rrrsr!rVgraphreturn.c t|}|rJdj|Dcgc]!}djtt|#c}}t d|zt |}t }|j D]}|t |z}||z }|rt ddj|zg}t } d} |r| t|k(rt d|zt|} g} |jD]#\} } | D]}|| vs| j| %|j| | t | z} | D]} || =|rg}t|D]}|jt|t|Scc}w)a!takes a dependency graph dict as arguments and return an ordered tuple of nodes starting with nodes without dependencies and up to the outermost node. If there is some cycle in the graph, :exc:`UnorderableGraph` will be raised. Also the given graph dict will be emptied. r rczcycles in graph: %szmissing vertices: %sreNzunknown problem with %s) get_cyclesrmapstrrsetvalueslenr0r`reversedextendr/tuple)rcyclescycle bad_cyclesvertices to_verticesrmissing_verticesorder order_setold_lendeps_okr node_depsdepresultgrps r ordered_nodesrs'u-F YY&Q CUO <QR 4zABB5zH%K"s5z! "#X-5 BR8SSTT EIG  c%j "# "B>> C  C fromnodetonodec|g}n||vry|j|||D] }||k(st||||s|dd|gzcS|jy)a.generic function taking a simple graph definition as a dictionary, with node has key associated to a list of nodes directly reachable from it. Return None if no path exists to go from `fromnode` to `tonode`, else the first path found (as a list including the destination node at last) N)r`has_pathr)rrrrdestnodes rrrJso | T KKx(' v *h!M8vh& &' HHJ r!r|)"rt __docformat__type __metaclass__os.pathrrrFrLrDrHrPtypingrrrrrrr rr r#r-rz Exceptionrr_Graphrrrrrrvr!rrsT$ &    FFF&~T~TB MM( y  CL aaj 77E!S&M7t6Xh-?4PT:$&&"&-0&:>t*&OP& &T_cS$s)^$03=@HPQUVYQZH[ d3ir!