\ K]c@`sddlmZmZmZddlZddlZddlZddlmZddl m Z ddl m Z e dddgZd efd YZd ejd d d ddffdYZdefdYZdefdYZdS(i(tprint_functiontdivisiontabsolute_importN(tutils(tLoc(tUnsupportedErrort SETUP_LOOPtFOR_ITERt SETUP_WITHtCFBlockcB`s#eZdZdZdZRS(cC`s1||_g|_i|_i|_t|_dS(N(toffsettbodytoutgoing_jumpstincoming_jumpstFalset terminating(tselfR ((s0lib/python2.7/site-packages/numba/controlflow.pyt__init__s     cC`s,|jt|jt|jf}d|S(Ns,block(offset:%d, outgoing: %s, incoming: %s)(R tsortedR R (Rtargs((s0lib/python2.7/site-packages/numba/controlflow.pyt__repr__s$cC`s t|jS(N(titerR (R((s0lib/python2.7/site-packages/numba/controlflow.pyt__iter__!s(t__name__t __module__RRR(((s0lib/python2.7/site-packages/numba/controlflow.pyR s tLooptentriestexitstheaderR cB`s&eZdZdZdZdZRS(s? A control flow loop, as detected by a CFGraph object. cC`st|to|j|jkS(N(t isinstanceRR(Rtother((s0lib/python2.7/site-packages/numba/controlflow.pyt__eq__2scC`s t|jS(N(thashR(R((s0lib/python2.7/site-packages/numba/controlflow.pyt__hash__5s((RRt__doc__t __slots__RR!(((s0lib/python2.7/site-packages/numba/controlflow.pyR%s tCFGraphcB`seZdZdZdZd+dZdZdZdZ dZ dZ d Z d Z d Zd Zd ZdZdZdZdZdZdZdZdZedZd+dZddZd+dZdZd+dZdZ dZ!dZ"d Z#d!Z$d"Z%ed#Z&d$Z'd%Z(d&Z)d'Z*d(Z+d)Z,d*Z-RS(,sB Generic (almost) implementation of a Control Flow Graph. cC`sFt|_tjt|_tjt|_i|_d|_dS(N( tsett_nodest collectionst defaultdictt_predst_succst _edge_datatNonet _entry_point(R((s0lib/python2.7/site-packages/numba/controlflow.pyR>s   cC`s|jj|dS(s Add *node* to the graph. This is necessary before adding any edges from/to the node. *node* can be any hashable object. N(R&tadd(Rtnode((s0lib/python2.7/site-packages/numba/controlflow.pytadd_nodeEscC`sA||jkst||jks*t|j|||dS(s Add an edge from node *src* to node *dest*, with optional per-edge *data*. If such an edge already exists, it is replaced (duplicate edges are not possible). N(R&tAssertionErrort _add_edge(Rtsrctdesttdata((s0lib/python2.7/site-packages/numba/controlflow.pytadd_edgeLscc`s4x-|j|D]}||j||ffVqWdS(s Yield (node, data) pairs representing the successors of node *src*. (*data* will be None if no data was specified when adding the edge) N(R*R+(RR3R4((s0lib/python2.7/site-packages/numba/controlflow.pyt successorsWscc`s4x-|j|D]}||j||ffVqWdS(s Yield (node, data) pairs representing the predecessors of node *dest*. (*data* will be None if no data was specified when adding the edge) N(R)R+(RR4R3((s0lib/python2.7/site-packages/numba/controlflow.pyt predecessors_scC`s"||jkst||_dS(s= Set the entry point of the graph to *node*. N(R&R1R-(RR/((s0lib/python2.7/site-packages/numba/controlflow.pytset_entry_pointgscC`s|jdkrtdn|j|j|j|j|j|j|j |j |j |j |j dS(s Compute various properties of the control flow graph. The graph must have been fully populated, and its entry point specified. sno entry point defined!N(R-R,t RuntimeErrort_eliminate_dead_blockst_find_exit_pointst_find_dominatorst_find_back_edgest_find_topo_ordert_find_descendentst _find_loopst_find_post_dominatorst_find_immediate_dominatorst_find_dominance_frontiert_find_dominator_tree(R((s0lib/python2.7/site-packages/numba/controlflow.pytprocessns          cC`s|jS(s Return a dictionary of {node -> set(nodes)} mapping each node to the nodes dominating it. A node D dominates a node N when any path leading to N must go through D. (t_doms(R((s0lib/python2.7/site-packages/numba/controlflow.pyt dominatorsscC`s|jS(s Return a dictionary of {node -> set(nodes)} mapping each node to the nodes post-dominating it. A node P post-dominates a node N when any path starting from N must go through P. (t _post_doms(R((s0lib/python2.7/site-packages/numba/controlflow.pytpost_dominatorsscC`s|jS(s Return a dictionary of {node -> node} mapping each node to its immediate dominator (idom). The idom(B) is the closest strict dominator of V (t_idom(R((s0lib/python2.7/site-packages/numba/controlflow.pytimmediate_dominatorsscC`s|jS(s/ Return a dictionary of {node -> set(nodes)} mapping each node to the nodes in its dominance frontier. The dominance frontier _df(N) is the set of all nodes that are immediate successors to blocks dominanted by N but which aren't stricly dominanted by N (t_df(R((s0lib/python2.7/site-packages/numba/controlflow.pytdominance_frontiers cC`s|jS(s return a dictionary of {node -> set(nodes)} mapping each node to the set of nodes it immediately dominates The domtree(B) is the closest strict set of nodes that B dominates (t_domtree(R((s0lib/python2.7/site-packages/numba/controlflow.pytdominator_treescC`s |j|S(sx Return the set of descendents of the given *node*, in topological order (ignoring back edges). (t_descs(RR/((s0lib/python2.7/site-packages/numba/controlflow.pyt descendentsscC`s|jdk st|jS(s. Return the entry point node. N(R-R,R1(R((s0lib/python2.7/site-packages/numba/controlflow.pyt entry_pointscC`s|jS(sG Return the computed set of exit nodes (may be empty). (t _exit_points(R((s0lib/python2.7/site-packages/numba/controlflow.pyt exit_pointsscC`s|j|jS(s Return the set of nodes constituting the graph's backbone. (i.e. the nodes that every path starting from the entry point must go through). By construction, it is non-empty: it contains at least the entry point. (RIR-(R((s0lib/python2.7/site-packages/numba/controlflow.pytbackbonescC`s|jS(s Return a dictionary of {node -> loop} mapping each loop header to the loop (a Loop instance) starting with it. (t_loops(R((s0lib/python2.7/site-packages/numba/controlflow.pytloopsscC`s%g|j|D]}|j|^qS(sm Return the list of Loop objects the *node* belongs to, from innermost to outermost. (t _in_loopsRW(RR/tx((s0lib/python2.7/site-packages/numba/controlflow.pytin_loopsscC`s|jS(sK Return the set of dead nodes (eliminated from the graph). (t _dead_nodes(R((s0lib/python2.7/site-packages/numba/controlflow.pyt dead_nodesscC`s|jS(s/ Return the set of live nodes. (R&(R((s0lib/python2.7/site-packages/numba/controlflow.pytnodesscC`s|jS(sb Return the sequence of nodes in topological order (ignoring back edges). (t _topo_order(R((s0lib/python2.7/site-packages/numba/controlflow.pyt topo_orderscc`sSt|}|j}|r*t|}nx"|D]}||kr1|Vq1q1WdS(s Iterate over the *nodes* in topological order (ignoring back edges). The sort isn't guaranteed to be stable. N(R%R_treversed(RR^treversetittn((s0lib/python2.7/site-packages/numba/controlflow.pyt topo_sorts    cC`sddl}|ptj}tdd||j|tdd||j|jd|tdd||j|jd|tdt|jd|td d||j|j d|td d||j|j d|td d||j|j d|dS( s3 Dump extensive debug information. iNsCFG adjacency lists:tfilesCFG dominators:tstreamsCFG post-dominators:sCFG back edges:s CFG loops:sCFG node-to-loops:s CFG backbone:( tpprinttsyststdouttprintt_dump_adj_listsRGRIRt _back_edgesRWRYRV(RRfRh((s0lib/python2.7/site-packages/numba/controlflow.pytdumps  s numba_cfg.dotcC`syddl}Wntk r/tdnX|jd|}x$|jD]}|jt|qLWxE|jD]:}x1|j|D]"}|jt|t|qWqsW|S(sRender the controlflow graph with GraphViz DOT via the ``graphviz`` python binding. Returns ------- g : graphviz.Digraph Use `g.view()` to open the graph in the default PDF application. iNscThe feature requires `graphviz` but it is not available. Please install with `pip install graphviz`tfilename(tgraphvizt ImportErrortDigraphR&R/tstrR*tedge(RRotgvtgRdRt((s0lib/python2.7/site-packages/numba/controlflow.pyt render_dots   $cC`s?|j|j||j|j|||j||fs c3`s!|]}|kr|VqdS(N((RR(R(s0lib/python2.7/site-packages/numba/controlflow.pys s( R-R)Rt enumerateRzRbtTrueRt functoolstreduceRK(RRtentryt preds_tabletordertchangedRtnew_idom((RRs0lib/python2.7/site-packages/numba/controlflow.pyRCss"         & cC`s~|j}tjt}xV|jD]H\}}||krMt||s i(RKR)tlenR.RM(RRRtdfRR((s0lib/python2.7/site-packages/numba/controlflow.pyRDs   c C`s|r*t|j}|j}|j}n$t|jg}|j}|j}|sctdni}x!|D]}t|g||          $" cC`s|jdt|_dS(NR(RRRG(R((s0lib/python2.7/site-packages/numba/controlflow.pyR=scC`st}|jj|xG|jjD]6}|js)x$|jD]}|j||qBWq)q)W|jdt |_ |j |=x$|j jD]}|j |qW|j ||jj |dS(NR(tobjectRTR.RWtvaluesRR R2RRRItdiscardR~R{(Rt dummy_exittlooptbR((s0lib/python2.7/site-packages/numba/controlflow.pyRBs    c`s|t}xc|jjD]R\}|j|@}t|dksNt|jfd|DqW||_dS(su Find back edges. An edge (src, dest) is a back edge if and only if *dest* dominates *src*. ic3`s|]}|fVqdS(N((RR4(R3(s0lib/python2.7/site-packages/numba/controlflow.pys sN(R%R*RRGRR1tupdateRm(RRRtback((R3s0lib/python2.7/site-packages/numba/controlflow.pyR>s  !c`s`|j|jgtfd|jj|_dS(Nc`sa|kr]j|x1|D]%}||fkr$|q$q$Wj|ndS(N(R.R(R/R4(RRRRR(s0lib/python2.7/site-packages/numba/controlflow.pyR s   (R*RmR%R-RbR_(R((RRRRRs0lib/python2.7/site-packages/numba/controlflow.pyR?s     cC`si}xvt|jD]e}t||<}xK|j|D]<}||f|jkr;|j||j||q;q;WqW||_dS(N(RaR_R%R*RmR.RRQ(RtdescsR/t node_descsR|((s0lib/python2.7/site-packages/numba/controlflow.pyR@s c C`si}x|jD]\}}|}t|g}|g}xF|r|j}||kr=|j||j|j|q=q=W||kr||j|q||||D]6}| j|j||| j|j||qWt d|d|d| d| } | ||EstkeycS`s t|jS(N(RR (R((s0lib/python2.7/site-packages/numba/controlflow.pytHtN(RmR%RzR.RR)RRR*RRWtdictR&RRR RRRY( RtbodiesR3R4RR tqueueRdRXRRRR[((s0lib/python2.7/site-packages/numba/controlflow.pyRA s8         ! "cC`sBtd|jjD}ddl}|j|d|dS(Ncs`s-|]#\}}|tt|fVqdS(N(RR(RR3tdests((s0lib/python2.7/site-packages/numba/controlflow.pys NsiRg(RR*RRh(RRft adj_listsRh((s0lib/python2.7/site-packages/numba/controlflow.pyRlMs  N(.RRR"RR0R,R6R7R8R9RFRHRJRLRNRPRRRSRURVRXR[R]R^R`RReRnRwR2R~RR;R<RRCRERDRR=RBR>R?R@RARl(((s0lib/python2.7/site-packages/numba/controlflow.pyR$9sT                     %  +     -tControlFlowAnalysiscB`seZdZdZdZdZdZddZdZ ddZ d Z d Z d Z d Zd ZdZdZdZeZeZeZeZdZeZeZdZdZdZdZdZRS(s Attributes ---------- - bytecode - blocks - blockseq - doms: dict of set Dominators - backbone: set of block offsets The set of block that is common to all possible code path. cC`sg||_i|_i|_g|_d|_d|_t|_d|_ g|_ g|_ g|_ dS(N( tbytecodetblockst liveblockstblockseqR,RRVRt_force_new_blockt _curblockt _blockstackRWt_withs(RR((s0lib/python2.7/site-packages/numba/controlflow.pyRes          cc`s$x|jD]}|j|Vq WdS(s= Return all blocks in sequence of occurrence N(RR(RR((s0lib/python2.7/site-packages/numba/controlflow.pyt iterblockssscc`s6x/|jD]$}||jkr |j|Vq q WdS(sB Return all live blocks in sequence of occurrence N(RRR(RR((s0lib/python2.7/site-packages/numba/controlflow.pytiterliveblockszscc`sHxA|jjD]0\}}||jkr|j||fVqqWdS(sQ Yield (incoming block, number of stack pops) pairs for *block*. N(R RRR(RtblockRtpops((s0lib/python2.7/site-packages/numba/controlflow.pytincoming_blocksscC`s|jjdddS(NRf(tgraphRnR,(RRf((s0lib/python2.7/site-packages/numba/controlflow.pyRnsc`sxjD]}d|j}t|d}|dk rK||q |jr tjjj|j }d|j}t |d|q q WxXt j j dD]=\}}j |}|j r|j rd|j|ssNo live block that exits!?('t _iter_insttopnametgetattrR,tis_jumpRRtfunc_idRotlinenoRtzipRRR RR$R0RRR6R R9tminRFRRt itervaluesR RR^RRaR1RVR%tkeysRWR.(RtinsttfnametfntltmsgtcurtnxttblkRRtoutRtlastblkRVt inloopblockstsR((Rs0lib/python2.7/site-packages/numba/controlflow.pytrunsL     &      icC`s||jj|s    "