ó ÔŒ\c@søddlmZddlZddlZddlZddlZddlZddlZddlZddl Z e j j dƒZ d„Z d„Zd„Zdd„Zdd gd „Zd d d „Ziad aed„Zd„Zd„ZdS(iÿÿÿÿ(tprint_functionNtmemorycCs£tƒtdj|ƒƒx‚tjD]w}d}d}t|dƒrW|j}d}nydtj|ƒd}WnnXtd|t|ƒd |ƒq$Wd S( sI Prints out the garbage after collecting a generation of memory. s'Garbage after collecting generation {}:tt cell_contentsscell: s (t)s -i N( tprinttformattgctgarbagethasattrRtinspecttgetfiletrepr(tgentitprefixtsuffix((srenpy/memory.pyt print_garbage's  cCs(tjj|dƒtjd|ƒdS(Ns s%s(tsyststdouttwritet memory_log(ts((srenpy/memory.pyR?scszi‰i‰tƒ‰‡‡‡‡fd†‰ˆd||ƒx{trºtd„ˆDƒƒ}td„ˆDƒƒ}||‰||‰ˆ r˜ˆ r˜Pnt‡‡fd†ˆDƒƒ‰q@Wx¸ˆrutƒtdƒtˆƒd}xŠ|ˆkrqˆj|ƒtd|ƒtd|d d ˆ|d ƒgˆD] }|d|d kr4|^q4}|sdPn|d}qèWq¾WdS( Nc sµt|ƒ}|dk r1ˆj|||fƒn|ˆkrAdS|ˆ|ss<{0}>sBAD TYPE <{0}>s {0}[{1!r}]s.im_selfics2|tˆƒkr*ˆ|dk r*ˆ|S|SdS(N(tlentNone(tidxtdefault(t reduction(srenpy/memory.pytgetƒs"t.s.__getstate__()is{0}[{1}]i(tidRtaddt isinstancetinttfloatttypestNoneTypet ModuleTypet ClassTypeR tstrtunicodeRtencodettupletlistt __class__t__name__tdictt MethodTypeRtim_classtim_functobjectttypet enumeratet iteritemstim_selft __reduce_ex__( told_idototpathtidoto_reprRtootktvRtstate(tedgest o_repr_cachetpathstvisit(Rsrenpy/memory.pyRFJs^    ' ! ## "  css|]}|dVqdS(iN((t.0R((srenpy/memory.pys Ÿscss|]}|dVqdS(iN((RGR((srenpy/memory.pys  sc3s5|]+}|dˆkr|dˆkr|VqdS(iiN((RGR(tleavestroots(srenpy/memory.pys ¨ssCycle:is s -it=i(tsetRtTrueRR-tremove(R;tnametlefttrighttedgeRtrelevant((RCRHRDRERIRFsrenpy/memory.pyt cycle_finderDs2 R   #    -cCs^|dkri}ng}tjtƒ}d„}xO|D]G\}}t|ƒ}||krdq:n|||<|j||fƒq:Wtj}tj } |j} t j t j t j f} x™|rS|jdƒ\}}t|| ƒrëq»n||c||ƒ7} t| ƒ} | |kr2qn||| <| || fƒqWq»W||fS(s» Walks over memory, trying to account it to the objects in `roots`. Each object in memory is attributed to at most one of the roots. We use a breadth-first search to try to come up with the most accurate attribution possible. `roots` A list of (name, object) tuples. Returns a dictionary mapping names to the number of bytes reachable from that name, and a dictionary mapping object ids to names. cSsdS(s= Adds o to the worklist if it's not in seen. N((RNR;((srenpy/memory.pyR!ÕsiN(Rt collectionst defaultdictR#R tappendRt getsizeofRt get_referentsR%R'R(t FunctionTypetpopR"(RItseentworklisttsizeR!RNR;tid_oRWRXtworklist_appendt ignore_typesRAtid_v((srenpy/memory.pyt walk_memory¼s6             trenpytstorecCsãg}xÐttjjƒƒD]¹\}}|dkr:qnx$|D]}|j|ƒrAPqAqAWq|jdƒp||jdƒs…qn|jdƒršqnx8|jjƒD]'\}}|j|d||fƒqªWqWt|ƒS(sæ Profiles object, surface, and texture memory used in the renpy and store packages. Returns a map from name to the number of bytes accounted for by that name, and a dictionary mapping object ids to names. RcRds renpy.storeRN( tsortedRtmodulestitemsRt startswitht__dict__RVRb(tpackagesRItmod_nametmodtpRNR;((srenpy/memory.pytprofile_memory_commonþs "  #gð?ic CstddƒtdƒtdtjƒdƒtdƒgtƒdjƒD]\}}||f^qN}|jƒtd„|Dƒƒ}|}xZ|D]R\}}||||krá||krátdj||ƒƒqán||8}q™Wtd ƒtd j|ƒƒtdƒd S(s :doc: memory Profiles object, surface, and texture memory use by Ren'Py and the game. Writes an accounting of memory use by to the memory.txt file and stdout. The accounting is by names in the store and in the Ren'Py implementation that the memory is reachable from. If an object is reachable from more than one name, it's assigned to the name it's most directly reachable from. `fraction` The fraction of the total memory usage to show. 1.0 will show all memory usage, .9 will show the top 90%. `minimum` If a name is accounted less than `minimum` bytes of memory, it will not be printed. As it has to scan all memory used by Ren'Py, this function may take a long time to complete. RJiNRsMemory profile at t:icss|]}|dVqdS(iN((RGR((srenpy/memory.pys Css {:13,d} {}t-i sC{:13,d} Total object, surface, and texture memory usage (in bytes).Ns -------------(RttimetctimeRnRgtsorttsumR( tfractiontminimumR@RAtusagettotalt remainingR]RN((srenpy/memory.pytprofile_memory!s   2   cCsFtddƒtdƒtdtjƒdƒtdƒtƒd}t|jƒƒ}g}x=|jƒD]/\}}|j|tj |dƒ|fƒqlW|j ƒxL|D]D\}}|dkrÎq°n|r°tdj ||||ƒƒq°q°Wtddƒtdj |t |d ƒƒtdƒ|rB|a|a ndS(sA :doc: memory Profiles objects, surface, and texture memory use by Ren'Py and the game. Writes (to memory.txt and stdout) the difference in memory usage from the last time this function was called with `update` true. The accounting is by names in the store and in the Ren'Py implementation that the memory is reachable from. If an object is reachable from more than one name, it's assigned to the name it's most directly reachable from. As it has to scan all memory used by Ren'Py, this function may take a long time to complete. RJiNRsMemory diff at Roisrenpy.memory.old_usages{:+14,d} {:13,d} {}Rpit i sTotal memory usage (in bytes).Ns--------------s-------------- s -------------( RRqRrRnRttvaluesR7RVt old_usageRRsRt old_total(tupdateRwRxtdiffR@RAtchangeRN((srenpy/memory.pyt diff_memoryYs.     $ cCs¼tddƒtdƒtdtjƒdƒtdƒtddgƒd}i}ttjjjƒ}|jƒg}x/|D]'}xŒ|j j ƒD]{\}}xl|j ƒD]^\}}|d |} t |ƒ} | |krü| |krü| || s s is Total Bytesi R{s Per RollbackRpi2Rcs{:13,d} {:13,d} {}s{} Rollback objects exist.Ns -------------s------------- s -------------(RRqRrRnR-RctgametlogtreversetstoresR7R RVtobjectsRtcontextt scene_listsRbRstrjustRhRR(R[tnew_seenR„RItrbt store_nameRdtvar_nameR;RNR^trolltsizesR@RARwR]((srenpy/memory.pytprofile_rollbackŽsL        + $* cstjƒtjƒ‰‡fd†}xcˆD][}t||ƒr,ddl}|jƒdkr‡tƒtdƒtƒ||ƒq‡q,q,WdS(s: Finds the parents of every object of type `cls`. c s@d}tƒ}g}g}xtdƒD]}|j|ƒt|tt|ƒƒt|ƒddƒyCt|tƒr–d|kr–td|dƒntt |ƒƒWntdƒnXt }t|t j ƒrõ|sÝPn|j ƒ\}}q(nt|tjƒrpxf|jjƒD]R\}}||dkr|ƒ}|jt|ƒƒ|j||d fƒqqWnx–tj|ƒD]…} | ˆks€| |kr¤q€nt| ƒ|kr¼q€nt| t jƒrÔq€n|jt| ƒƒ|j| |d fƒt}Pq€W|sPn|s&td ƒn|j ƒ\}}q(WdS( NRitendR{R/s with names Bad repr.iüÿÿÿs (key) s s(RKtrangeRVRR)R R5R"R0R tFalseR%R'RZtweakreftWeakKeyDictionarytdataRgR!Rt get_referrerst FrameTypeRL( R;RR[tqueueR‡t_itfoundR@RAR(tobjs(srenpy/memory.pyt print_pathäsR  ) ! iÿÿÿÿNgš™™™™™¹?s3===================================================(Rtcollectt get_objectsR"trandomR(tclsRžR;R¡((Rsrenpy/memory.pyt find_parentsÚs  >   (t __future__RRqR•R%RRTRR RcR„topenRRRRSRRbRnRzR}R~RLR‚R‘R£(((srenpy/memory.pyts(           x B#4 5 L