]j!SrSSKJr SSKrSSKrSSKJrJr SSKJ r SSK J r SSK J r JrJr "SS 5rSS jrSS jr\"S S S5r\"SS5r\"SS5r"SS5r\\ \ \\4r\\\4rSSjrSSjrg)z!Bytecode analysis for coverage.py) annotationsN)IterableMapping)CodeType)Optional)TArcTLineNoTOffsetcd\rSrSrSrSSSS.S SjjrS SjrS SjrSSjrSS jr S r g) ByteParserz3Parse bytecode to understand the structure of code.N)codetextfilenamecHUcUce[X#=(d SSSS9nXlg)NzexecT) dont_inherit)compiler)selfrrrs N/home/mande/repo/quber/.venv/lib/python3.13/site-packages/coverage/bytecode.py__init__ByteParser.__init__s- <# ##4!7ZdSD c0SUR55$)aLIterate 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. c3V# UHoRS:wdM[US9v M! g7f) __annotate__rN)co_namer ).0cs r ,ByteParser._child_parsers..+s$_,?q99P^C^" ",?s))) code_objects)rs r_child_parsersByteParser._child_parsers s`D,=,=,?__rc## UR/nU(aYUR5nURH+n[U[5(dMUR U5 M- Uv U(aMXgg7f)z,Iterate over all the code objects in `code`.N)rpop co_consts isinstancerappend)rstackrr s rr#ByteParser.code_objects-sT 99;D^^a**LLO$JesAA1 A1/A1c#n# URR5Hu pU(dMUv M g7f)ziYield the line numbers possible in this code object. Uses co_lines() to produce a sequence: l0, l1, ... N)rco_lines)r_lines r _line_numbersByteParser._line_numbers9s, )),,.JAqt /s&5 5c#n# UR5HnUR5ShvN M gN 7f)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$r1)rbps rfind_statementsByteParser.find_statementsBs/%%'B'') ) )( )s '53 5r)rzCodeType | Noner str | Nonerr7returnNone)r8zIterable[ByteParser])r8zIterable[CodeType])r8zIterable[TLineNo]) __name__ __module__ __qualname____firstlineno____doc__rr$r#r1r5__static_attributes__rrr r sR= !%#        `  *rr cv0nUR5H"up#nUcM [X#S5HnXAU'M M$ U$)z6Make a dict mapping byte code offsets to line numbers.)r.range)rb2lbstartbendlinenoboffsets rbytes_to_linesrINsA C $ f   q1%G 2!0 JrcUVs1sH-n[RRU5=n(dM+UiM/ nnU(d SU35eU$s snf)zwMake 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_setrRXsO # B($SYY]]4-@'@r'@2(C B =28*==3 J Cs *AA JUMP_BACKWARDJUMP_BACKWARD_NO_INTERRUPT JUMP_FORWARD RETURN_VALUERETURN_GENERATORNOP NOT_TAKENc@\rSrSrSrS SjrSSS.S SjjrSrg ) InstructionWalkervaIUtility 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)`. cXl0UlSn[R"U5HnX RUR'M UceURUlgN)rinstsrKget_instructionsoffset max_offset)rrinsts rrInstructionWalker.__init__sQ 57 ((.D&*JJt{{ #/++rrTstart_at follow_jumpsc#H# [5nUnX@RS-:aXC;agURU5 URR U5=n(a-Uv U(a"UR [ ;aURnMxUS- nX@RS-:aMgg7f)ze Yield instructions starting from `start_at`. Follow unconditional jumps if `follow_jumps` is true. rBN)setrbaddr_rMopcode ALWAYS_JUMPS jump_target)rrfrgseenrarcs rwalkInstructionWalker.walksu**~ HHV zz~~f--t- DKK<$?!--F aKF**s BB" B")rr_rbN)rrr8r9)rfr rgboolr8zIterable[dis.Instruction])r:r;r<r=r>rrpr?r@rrr[r[vs5 &&'T"6: "rr[c>^^^ ^ [R"S5n[T5m T RSS9HnUR(dMUR [ ;aM,URm T cM=TRT T 5m SUU U U4Sjjn[R"[5nU"XSRS-S9 U"XSRS9 XRUR'UR5H$upgUHnX(URU5 M M& M U$)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. c6[R"[5$r^) collections defaultdictrjr@rrbranch_trails..s @W@WX[@\rFrgc>[5nSnTRUSS9HnURUR5 URnUbT R XU5nU(a UT:waUn ONUR (aUR[;a O'UR[;dMTR*n O UbUTU4RU5 g[5US'g)NTre) rjrprkra line_numberrMrnrlrmRETURNSco_firstlinenoupdate) trailsrf inst_offsetsto_lineinst2l2r from_lineiwalker multiline_maps radd_one_branch_trail+branch_trails..add_one_branch_trails *-LG xdK  .&&>&**22B" / G&&ELL ,L\\W,#222GL" 7+,33LA"ut rrB)rf)rTBranchTrailsOneSourcerfr r8r9) rurvr[rprnrlrmr{rMrjraitemsr~) rr the_trailsrcrrarcoffsetsrarrs `` @@r branch_trailsrs,!, 7 78\ ]J%G % 0  ;;, & $$   !%%i;  %* % % % %6*5)@)@)EVkkAo>V.>.>?"(4;; #LLNLC!"3'..w7"+c1j rc 0n[U5nURSS9HbnUR[;aURXR 'M1UR[ ;dMGUR S-XR 'Md U$)z}Make a map of unconditional bytecodes jumping to others. Only include bytecodes that do no work and go to another bytecode. FryrB)r[rprlrmrnraNOPS)rjumpsrrcs r always_jumpsrsm E%G % 0 ;;, &!%!1!1E++  [[D !%qE++  1 Lr)rrr8zdict[TOffset, TLineNo])rNstrr8zset[int])rrrzMapping[TLineNo, TLineNo]r8 TBranchTrails)rrr8zdict[TOffset, TOffset])r> __future__rrurKcollections.abcrrtypesrtypingrcoverage.typesrr r r rIrRrmr|rr[dictrjrrrrr@rrrs(" -11:*:*z       &&Rhtnc'l:;W445 M M,MM` r