U 祡c.@sdZddlmZmZddlmZmZddlmZddl m Z m Z ddl m Z ddl mZdgZiZed krrd ed <Gd d d eZGdddeZGdddeZdS)z This module exposes utilities to illustrate objects and their references as (directed) graphs. The current implementation requires 'graphviz' to be installed. )Asizer named_refs) safe_reprtrunc) get_referents)PopenPIPE)copy)platformReferenceGraph)win32T close_fdsc@seZdZdZdZddZdS) _MetaObjectz The _MetaObject stores meta-information, like a string representation, corresponding to each object passed to a ReferenceGraph. )sizeidtypestrgroupcyclecCs d|_dS)NF)rselfr4/tmp/pip-unpacked-wheel-8ad_c8mj/pympler/refgraph.py__init__!sz_MetaObject.__init__N)__name__ __module__ __qualname____doc__ __slots__rrrrrrsrc@s4eZdZdZdZddZddZddZd d Zd S) _EdgezN Describes a reference from one object `src` to another object `dst`. srcdstlabelrcCs||_||_||_d|_dSNr )rr!r"r#rrrr+sz_Edge.__init__cCsd|j|j|j|jfS)Nz<%08x => %08x, '%s', %s>r rrrr__repr__1sz_Edge.__repr__cCs|j|j|jfSr$)r!r"r#__hash__rrrrr&5sz_Edge.__hash__cCs||kSr$)r&)rotherrrr__eq__8sz _Edge.__eq__N) rrrrrrr%r&r(rrrrr%s rc@s|eZdZdZd ddZddZddZd d Zd d Zd dZ ddZ ddZ ddZ ddZ ddZd!ddZddZdS)"r a` The ReferenceGraph illustrates the references between a collection of objects by rendering a directed graph. That requires that 'graphviz' is installed. >>> from pympler.refgraph import ReferenceGraph >>> a = 42 >>> b = 'spam' >>> c = {a: b} >>> gb = ReferenceGraph([a,b,c]) >>> gb.render('spam.eps') True FcCsRt||_t|j|_d|_d|_|r8||_||_nd|_|| dS)zO Initialize the ReferenceGraph with a collection of `objects`. zN/AN) listobjectslencount num_in_cyclesedges_reduce_to_cycles_reduced _get_edges_annotate_objects)rr*reducerrrrJs   zReferenceGraph.__init__cCsNg}tdd|D}|D].}tddt|D}||r||q|S)z Eliminate leaf objects - that are objects not referencing any other objects in the list `graph`. Returns the list of objects without the objects identified as leafs. cSsg|] }t|qSrr.0xrrr csz3ReferenceGraph._eliminate_leafs..cSsg|] }t|qSrr4r5rrrr8es)setr intersectionappend)rgraphresultidsetnrefsetrrr_eliminate_leafs\s  zReferenceGraph._eliminate_leafscCsB|jdd}d}|t|kr2t|}||}q||_t|jS)a Iteratively eliminate leafs to reduce the set of objects to only those that build cycles. Return the number of objects involved in reference cycles. If there are no cycles, `self.objects` will be an empty list and this method returns 0. Nr)r*r+rA)rZcyclesZcntrrrr/js  z ReferenceGraph._reduce_to_cyclescCsv|jspt|}|jdd|_g|_g|_||_|j|_|jrf|||jD] }d|_ qXnd}||_|jS)z Iteratively eliminate leafs to reduce the set of objects to only those that build cycles. Return the reduced graph. If there are no cycles, None is returned. NT) r0r r*metadatar.r/r-r1r2r)rZreducedmetarrrreduce_to_cyclesys   zReferenceGraph.reduce_to_cyclesc Cstdd|jD}tg|_|jD]}tddt|D}||D]d}d}d}t|trf|}|srt|}|D]\}}t ||krv|}qqv|j t t |||qHq$dS)z Compute the edges for the reference graph. The function returns a set of tuples (id(a), id(b), ref) if a references b with the referent 'ref'. cSsg|] }t|qSrr4r5rrrr8sz-ReferenceGraph._get_edges..cSsg|] }t|qSrr4r5rrrr8sN) r9r*r.rr: isinstancedictitemsrraddr) rr>r?r@refr#memberskvrrrr1s      zReferenceGraph._get_edgescCsi}|jD]}|||j<q d}|jD]}t|ds@||_|d7}t}|jD]4}|j|jkrh||j|j|jkrL||jqL|D]"}t |jt ||d|||_qq$|jD]}||jj|_q||_ dS)zt Annotate the objects belonging to separate (non-connected) graphs with individual indices. rrN) rBrhasattrrr9r.r!rIr"mingetattr _max_group)rgr7idxZ neighborsenbrrr_annotate_groupss&        " zReferenceGraph._annotate_groupscsxfdd|jD|_tdd|jDfdd|jD|_t|j|_|jgkrZdSfdd|jD|_|`dS)z Eliminate all objects but those which belong to `group`. ``self.objects``, ``self.metadata`` and ``self.edges`` are modified. Returns `True` if the group is non-empty. Otherwise returns `False`. csg|]}|jkr|qSrrr5rXrrr8s z0ReferenceGraph._filter_group..cSsg|] }|jqSrr4r5rrrr8scsg|]}t|kr|qSrr4)r6obj) group_setrrr8s Fcsg|]}|jkr|qSrrX)r6rUrXrrr8s T)rBr9r*r+r,r.rR)rrr)rrZr _filter_groups  zReferenceGraph._filter_groupccsx|d}t|jD]\}t|}|jdd|_|j|_||rtdd|jD|_||_ |d7}|VqdS)a7 Split the graph into sub-graphs. Only connected objects belong to the same graph. `split` yields copies of the Graph object. Shallow copies are used that only replicate the meta-information, but share the same object list ``self.objects``. >>> from pympler.refgraph import ReferenceGraph >>> a = 42 >>> b = 'spam' >>> c = {a: b} >>> t = (1,2,3) >>> rg = ReferenceGraph([a,b,c,t]) >>> for subgraph in rg.split(): ... print (subgraph.index) 0 1 rNcSsg|] }|jqSr)rr5rrrr8sz(ReferenceGraph.split..rN) rWrangerRr rBr.r[sum total_sizeindex)rr_rZsubgraphrrrsplits  zReferenceGraph.splitcCs8t|}|jdddt|D]\}}||_q$|S)z Split the graphs into sub graphs and return a list of all graphs sorted by the number of nodes. The graph with most nodes is returned first. cSs t|j Sr$)r+rB)r7rrrz/ReferenceGraph.split_and_sort..)key)r)r`sort enumerater_)rZgraphsr_r<rrrsplit_and_sorts  zReferenceGraph.split_and_sortc Csg|_t}|j|j}|j|_t|j|D]l\}}t}||_t ||_ z|j j |_ Wn$t tfk r|t |j |_ YnXt|dd|_|j|q,dS)zB Extract meta-data describing the stored objects. )ZclipN)rBrZasizesofr*totalr^ziprrr __class__rrAttributeErrorReferenceErrorrrr;)rZsizerZsizesrYszmdrrrr2s  z ReferenceGraph._annotate_objectscCsg}d}|||d|d|jD]`}t|jddd}d}|jdkrXd }n|jd krfd }|d t|jd d||j|fq,|jD]J}d}|j dkrd}|dt|j d dt|j d d|j |fq|dd |S)z Emit a graph representing the connections between the objects described within the metadata list. The text representation can be transformed to a graph with graphviz. Returns a string. z#// Process this file with graphviz z digraph G { z node [shape=box]; 0"'rEZinstancemethodz , color=redframez, color=orangez# "X%s" [ label = "%s\n%s" %s ]; rNN__dict__z ,weight=100z X%s -> X%s [label="%s"%s]; z} ) r;rBrrreplacerhexrr.r#r!r"join)rsheaderrnr#extrarUrrr_get_graphviz_datas0        ( z!ReferenceGraph._get_graphviz_datadotpsc Cs|jgkrdS|}d}|d|d|f|}|r|td ttdt}t|fd|jit} ||| | jdkSt|fdtit} | || jdkSd S) aW Render the graph to `filename` using graphviz. The graphviz invocation command may be overridden by specifying `cmd`. The `format` may be any specifier recognized by the graph renderer ('-Txxx' command). The graph can be preprocessed by the *unflatten* tool if the `unflatten` parameter is True. If there are no objects to illustrate, the method does not invoke graphviz and returns False. If the renderer returns successfully (return code 0), True is returned. An `OSError` is raised if the graphviz tool cannot be found. F)z -Nfontsize=10z -Efontsize=10z-Nstyle=filledz-Nfillcolor=#E5EDB8z-Ncolor=#CCCCCCz-T%sz-o unflattenz-l7)stdinstdoutrrN)r}) r*rzrr popen_flagsr communicateencode returncode) rfilenamecmdformatr~dataoptionsZcmdlinep1p2prrrrender4s   zReferenceGraph.rendercCs$t|d}|||dS)zR Write raw graph data which can be post-processed using graphviz. wN)openwriterzclose)rrfrrr write_graphXs zReferenceGraph.write_graphN)F)r{r|F)rrrrrrAr/rDr1rWr[r`rfr2rzrrrrrrr <s    $N)rZpympler.asizeofrrZpympler.util.stringutilsrrgcr subprocessrrr sysr __all__robjectrrr rrrrs