format with latest black

Author: MatthieuDartiailh

src/bytecode/__init__.py

@@ -52,7 +52,6 @@ def format_bytecode(
     *,
     lineno: bool = False,
 ) -> str:
-
     try_begins: List[TryBegin] = []
 
     def format_line(index, line):
@@ -87,7 +86,6 @@ def format_instr(instr, labels=None):
         return text
 
     def format_try_begin(instr: TryBegin, labels: dict) -> str:
-
         if isinstance(instr.target, Label):
             try:
                 arg = "<%s>" % labels[instr.target]

src/bytecode/cfg.py

@@ -278,7 +278,6 @@ def run(self) -> Generator[Union["_StackSizeComputer", int], int, None]:
             # an extra object on the stack.
 
         for i, instr in enumerate(self.block):
-
             # Ignore SetLineno
             if isinstance(instr, (SetLineno)):
                 continue
@@ -384,7 +383,6 @@ def run(self) -> Generator[Union["_StackSizeComputer", int], int, None]:
             # Instruction is final (return, raise, ...) so any following instruction
             # in the block is dead code.
             if instr.is_final():
-
                 # Check for TryEnd after the final instruction which is possible
                 # TryEnd being only pseudo instructions.
                 if te := self.block.get_trailing_try_end(i):
@@ -781,7 +779,6 @@ def from_bytecode(bytecode: _bytecode.Bytecode) -> "ControlFlowGraph":
         try_begin_inserted_in_block = False
         last_instr: Optional[Instr] = None
         for index, instr in enumerate(bytecode):
-
             # Reference to the current block if we create a new one in the following.
             old_block: BasicBlock | None = None
 
@@ -829,7 +826,6 @@ def from_bytecode(bytecode: _bytecode.Bytecode) -> "ControlFlowGraph":
                 try_begin_inserted_in_block = False
 
             if old_block is not None and last_instr is not None:
-
                 # The last instruction is final, if the current instruction is a
                 # TryEnd insert it in the same block and move to the next instruction
                 if last_instr.is_final() and isinstance(instr, TryEnd):
@@ -842,7 +838,6 @@ def from_bytecode(bytecode: _bytecode.Bytecode) -> "ControlFlowGraph":
 
                 # If we have an active TryBegin and last_instr is:
                 elif active_try_begin is not None:
-
                     # - a jump whose target is beyond the TryEnd of the active
                     #   TryBegin: we remember TryEnd should be prepended to the
                     #   target block.

src/bytecode/concrete.py

@@ -220,7 +220,6 @@ def __repr__(self) -> str:
 
 
 class ConcreteBytecode(_bytecode._BaseBytecodeList[Union[ConcreteInstr, SetLineno]]):
-
     #: List of "constant" objects for the bytecode
     consts: List
 
@@ -297,7 +296,6 @@ def __eq__(self, other: Any) -> bool:
     def from_code(
         code: types.CodeType, *, extended_arg: bool = False
     ) -> "ConcreteBytecode":
-
         instructions: MutableSequence[Union[SetLineno, ConcreteInstr]]
         # For Python 3.11+ we use dis to extract the detailed location information at
         # reduced maintenance cost.
@@ -470,7 +468,6 @@ def _pack_linetable(
         # then use as many 254 offset with no line change to reduce the offset to
         # less than 254.
         if doff > 254:
-
             linetable.append(struct.pack("Bb", 254, dlineno))
             doff -= 254
 
@@ -692,7 +689,6 @@ def _assemble_locations(
 
         # We track the last set lineno to be able to compute deltas
         for _, i_size, new_lineno, location in iter_in:
-
             # Infer the line if location is None
             location = location or InstrLocation(new_lineno, None, None, None)
 
@@ -1066,7 +1062,6 @@ def to_bytecode(
 
 
 class _ConvertBytecodeToConcrete:
-
     # XXX document attributes
 
     #: Default number of passes of compute_jumps() before giving up.  Refer to
@@ -1117,7 +1112,6 @@ def concrete_instructions(self) -> None:
         free_instrs: List[int] = []
 
         for instr in self.bytecode:
-
             # Enforce proper use of CACHE opcode on Python 3.11+ by checking we get the
             # number we expect or directly generate the needed ones.
             if isinstance(instr, Instr) and instr.name == "CACHE":
@@ -1315,7 +1309,6 @@ def compute_jumps(self) -> bool:
 
         # Resolve labels for exception handling entries
         for tb, entry in self.exception_handling_blocks.items():
-
             # Set the offset for the start and end offset from the instruction
             # index stored when assembling the concrete instructions.
             entry.start_offset = instruction_offsets[entry.start_offset]

src/bytecode/flags.py

@@ -134,7 +134,6 @@ def infer_flags(
     # If performing inference or forcing an async behavior, first inspect
     # the flags since this is the only way to identify iterable coroutines
     if is_async in (None, True):
-
         if bytecode.flags & CompilerFlags.COROUTINE:
             if sure_generator:
                 flags |= CompilerFlags.ASYNC_GENERATOR

src/bytecode/instr.py

@@ -68,7 +68,6 @@ class BinaryOp(enum.IntEnum):
 # This make type checking happy but means it won't catch attempt to manipulate an unset
 # statically. We would need guard on object attribute narrowed down through methods
 class _UNSET(int):
-
     instance = None
 
     def __new__(cls):
@@ -667,7 +666,6 @@ def _cmp_key(self) -> Tuple[Optional[InstrLocation], str, Any]:
 
 
 class Instr(BaseInstr[InstrArg]):
-
     __slots__ = ()
 
     def _cmp_key(self) -> Tuple[Optional[InstrLocation], str, Any]:

tests/cell_free_vars_cases.py

@@ -35,7 +35,6 @@ def f(self):
 
 
 def class_loadderef():
-
     a = 1
 
     class B(A):

tests/exception_handling_cases.py

@@ -150,7 +150,6 @@ def try_except_with_extended_arg2():
     a = list(range(10))
 
     with contextlib.nullcontext() as selector:
-
         while a.pop():
             # timeout = self._remaining_time(endtime)
             if sys is not None and sys.hexversion < 0:

tests/test_concrete.py

@@ -244,7 +244,6 @@ def test_invalid_types(self):
             ConcreteBytecode([Label()])
 
     def test_to_code_lnotab(self):
-
         # We use an actual function for the simple case to
         # ensure we get lnotab right
         def f():

tests/test_flags.py

@@ -23,7 +23,6 @@ def test_type_validation_on_inference(self):
             infer_flags(1)
 
     def test_flag_inference(self):
-
         # Check no loss of non-infered flags
         code = ControlFlowGraph()
         code.flags |= (
@@ -138,7 +137,6 @@ def test_async_gen_flags(self):
         # Test inference in the presence of pre-existing flags
 
         for is_async in (None, True):
-
             # Infer generator
             code = ConcreteBytecode()
             code.append(ConcreteInstr("YIELD_VALUE"))

tests/test_instr.py

@@ -111,7 +111,6 @@ def test_constructor(self):
             Instr("xxx")
 
     def test_repr(self):
-
         # No arg
         r = repr(Instr("NOP", lineno=10))
         self.assertIn("NOP", r)