V.j"dZddlmZddlZddlZddlmZmZddlm Z ddl m Z ddl m Z mZmZGdd Zdd Zdd Zed d dZeddZeddZGddZee e eefZeeefZ ddZddZy)z!Bytecode analysis for coverage.py) annotationsN)IterableMapping)CodeType)Optional)TArcTLineNoTOffsetcPeZdZdZdddd d dZd dZd dZd dZd dZy) ByteParserz3Parse bytecode to understand the structure of code.N)codetextfilenamecD||Jt||xsddd}||_y)NzexecT) dont_inherit)compiler )selfr rrs SC:\xampp\htdocs\tradingbinance\backend\.venv\Lib\site-packages\coverage/bytecode.py__init__zByteParser.__init__s1 <# ##4!7ZdSD c0d|jDS)a|Iterate over all the code objects nested within this one. The iteration includes `self` as its first value. We skip code objects named `__annotate__` since they are deferred annotations that usually are never run. If there are errors in the annotations, they will be caught by type checkers or other tools that use annotations. c3TK|] }|jdk7st|"yw) __annotate__)r N)co_namer ).0cs r z,ByteParser._child_parsers..+s'_,?q199P^C^ "",?s(() code_objects)rs r_child_parserszByteParser._child_parsers s`D,=,=,?__rc#K|jg}|rK|j}|jD]$}t|ts|j |&||rJyyw)z,Iterate over all the code objects in `code`.N)r pop co_consts isinstancerappend)rstackr rs rrzByteParser.code_objects-sP 99;D^^a*LLO$Js?AAAc#`K|jjD] \}}}|s |yw)zyYield the line numbers possible in this code object. Uses co_lines() to produce a sequence: l0, l1, ... N)r co_lines)r_lines r _line_numberszByteParser._line_numbers9s- )),,.JAq$ /s$..c#jK|jD]}|jEd{y7w)zFind the statements in `self.code`. Produce a sequence of line numbers that start statements. Recurses into all code objects reachable from `self.code`. N)r r+)rbps rfind_statementszByteParser.find_statementsBs0%%'B'') ) )( )s '313)r zCodeType | Noner str | Nonerr/returnNone)r0zIterable[ByteParser])r0zIterable[CodeType])r0zIterable[TLineNo]) __name__ __module__ __qualname____doc__rr rr+r.rrr r sR= !%#        `  *rr cpi}|jD] \}}}| t||dD]}|||< "|S)z6Make a dict mapping byte code offsets to line numbers.)r(range)r b2lbstartbendlinenoboffsets rbytes_to_linesr?NsG C $ f   q1%G 2!0 Jrc|Dchc]&}tjj|x}s%|(}}|s Jd||Scc}w)zMake a set of opcodes from instruction names. The names might not exist in this version of Python, skip those if not. z At least one opcode must exist: )disopmapget)op_namesnameopopss rop_setrHXsO # B($SYY]]4-@'@r'@2(C B =28*==3 J Cs &AA JUMP_BACKWARDJUMP_BACKWARD_NO_INTERRUPT JUMP_FORWARD RETURN_VALUERETURN_GENERATORNOP NOT_TAKENc2eZdZdZddZddd d dZy) InstructionWalkera]Utility to step through trails of instructions. We have two reasons to need sequences of instructions from a code object: First, in strict sequence to visit all the instructions in the object. This is `walk(follow_jumps=False)`. Second, we want to follow jumps to understand how execution will flow: `walk(follow_jumps=True)`. c||_i|_d}tj|D]}||j|j<|J|j|_yN)r instsrAget_instructionsoffset max_offset)rr insts rrzInstructionWalker.__init__sU 57 ((.D&*DJJt{{ #/++rrTstart_at follow_jumpsc#*Kt}|}||jdzkrq||vry|j||jj |x}r%||r|j t vr |j}j|dz }||jdzkrpyyw)z} Yield instructions starting from `start_at`. Follow unconditional jumps if `follow_jumps` is true. r8N)setrWaddrTrCopcode ALWAYS_JUMPS jump_target)rrZr[seenrVrXs rwalkzInstructionWalker.walksut**~ HHV zz~~f--t- DKK<$?!--F aKFt**s BBBN)r rr0r1)rZr r[boolr0zIterable[dis.Instruction])r2r3r4r5rrdr6rrrQrQvs0 &&'T"6: "rrQc0 tjd}t jdD]}|js|j t vr#|j 2j  d fd }tjt}|||jdz|||j|||j<|jD]#\}}|D]}|||j|%|S)a Calculate branch trails for `code`. `multiline_map` maps line numbers to the first line number of a multi-line statement. Instructions can have a jump_target, where they might jump to next. Some instructions with a jump_target are unconditional jumps (ALWAYS_JUMPS), so they aren't interesting to us, since they aren't the start of a branch possibility. Instructions that might or might not jump somewhere else are branch possibilities. For each of those, we track a trail of instructions. These are lists of instruction offsets, the next instructions that can execute. We follow the trail until we get to a new source line. That gives us the arc from the original instruction's line to the new source line. c4tjtSrS) collections defaultdictr^r6rrzbranch_trails..s @W@WX[@\rFr[ct}d}j|dD]}|j|j|j}| j ||}|r |k7r|}nC|j r|jtvrn#|jtvs|j }n|||fj|yt|d<y)NTrY) r^rdr_rV line_numberrCrbr`raRETURNSco_firstlinenoupdate) trailsrZ inst_offsetsto_lineinst2l2r from_lineiwalker multiline_maps radd_one_branch_trailz+branch_trails..add_one_branch_trails *-LG xdK  .&&>&**2r2B" / G&&ELL ,L\\W,#222GL" 7+,33LA"ut rr8)rZ)rqTBranchTrailsOneSourcerZr r0r1) rhrirQrdrbr`rarmrCr^rVitemsrp) r rx the_trailsrXryrqarcoffsetsrVrvrws `` @@r branch_trailsrs,!, 7 78\ ]J%G % 0  ;;, & $$   !%%i;  %* % % % %6*5)@)@)EVdkkAo>Vd.>.>?"( 4;; #LLNLC!6"3'..w7"+c1j rci}t|}|jdD]]}|jtvr|j||j </|jt vsB|j dz||j <_|S)zMake a map of unconditional bytecodes jumping to others. Only include bytecodes that do no work and go to another bytecode. Frkr8)rQrdr`rarbrVNOPS)r jumpsrwrXs r always_jumpsrsq E%G % 0 ;;, &!%!1!1E$++  [[D !%qE$++  1 Lr)r rr0zdict[TOffset, TLineNo])rDstrr0zset[int])r rrxzMapping[TLineNo, TLineNo]r0 TBranchTrails)r rr0zdict[TOffset, TOffset])r5 __future__rrhrAcollections.abcrrtypesrtypingrcoverage.typesrr r r r?rHrarnrrQdictr^rzrrrr6rrrs(" -11:*:*z       &&Rhtnc'l:;W445 M M,MM` r