angr 9.2.101__py3-none-win_amd64.whl → 9.2.103__py3-none-win_amd64.whl

angr/utils/graph.py

@@ -1,4 +1,3 @@
-from typing import Tuple, Optional, Dict, List, Set
 from collections import defaultdict
 import logging
 
@@ -26,7 +25,7 @@ def shallow_reverse(g) -> networkx.DiGraph:
     return new_g
 
 
-def inverted_idoms(graph: networkx.DiGraph) -> Tuple[networkx.DiGraph, Optional[Dict]]:
+def inverted_idoms(graph: networkx.DiGraph) -> tuple[networkx.DiGraph, dict | None]:
     """
     Invert the given graph and generate the immediate dominator tree on the inverted graph. This is useful for
     computing post-dominators.
@@ -54,7 +53,7 @@ def inverted_idoms(graph: networkx.DiGraph) -> Tuple[networkx.DiGraph, Optional[
 
 
 def to_acyclic_graph(
-    graph: networkx.DiGraph, ordered_nodes: Optional[List] = None, loop_heads: Optional[List] = None
+    graph: networkx.DiGraph, ordered_nodes: list | None = None, loop_heads: list | None = None
 ) -> networkx.DiGraph:
     """
     Convert a given DiGraph into an acyclic graph.
@@ -654,8 +653,8 @@ class GraphUtils:
 
     @staticmethod
     def quasi_topological_sort_nodes(
-        graph: networkx.DiGraph, nodes: Optional[List] = None, loop_heads: Optional[List] = None
-    ) -> List:
+        graph: networkx.DiGraph, nodes: list | None = None, loop_heads: list | None = None
+    ) -> list:
         """
         Sort a given set of nodes from a graph based on the following rules:
 
@@ -754,7 +753,7 @@ class GraphUtils:
 
     @staticmethod
     def _append_scc(
-        graph: networkx.DiGraph, ordered_nodes: List, scc: Set, loop_head_candidates: Optional[List] = None
+        graph: networkx.DiGraph, ordered_nodes: list, scc: set, loop_head_candidates: list | None = None
     ) -> None:
         """
         Append all nodes from a strongly connected component to a list of ordered nodes and ensure the topological

angr/utils/library.py

@@ -1,4 +1,4 @@
-from typing import List, Tuple, Optional, TYPE_CHECKING
+from typing import TYPE_CHECKING
 
 from ..sim_type import (
     parse_file,
@@ -72,7 +72,7 @@ def register_kernel_types():
     )
 
 
-def convert_cproto_to_py(c_decl) -> Tuple[str, "SimTypeFunction", str]:
+def convert_cproto_to_py(c_decl) -> tuple[str, "SimTypeFunction", str]:
     """
     Convert a C-style function declaration string to its corresponding SimTypes-based Python representation.
 
@@ -110,7 +110,7 @@ def convert_cproto_to_py(c_decl) -> Tuple[str, "SimTypeFunction", str]:
 
 def convert_cppproto_to_py(
     cpp_decl: str, with_param_names: bool = False
-) -> Tuple[Optional[str], Optional[SimTypeCppFunction], Optional[str]]:
+) -> tuple[str | None, SimTypeCppFunction | None, str | None]:
     """
     Pre-process a C++-style function declaration string to its corresponding SimTypes-based Python representation.
 
@@ -145,7 +145,7 @@ def convert_cppproto_to_py(
 
 
 def parsedcprotos2py(
-    parsed_cprotos: List[Tuple[str, "SimTypeFunction", str]], fd_spots=frozenset(), remove_sys_prefix=False
+    parsed_cprotos: list[tuple[str, "SimTypeFunction", str]], fd_spots=frozenset(), remove_sys_prefix=False
 ) -> str:
     """
     Parse a list of C function declarations and output to Python code that can be embedded into
@@ -176,7 +176,7 @@ def parsedcprotos2py(
     return s
 
 
-def cprotos2py(cprotos: List[str], fd_spots=frozenset(), remove_sys_prefix=False) -> str:
+def cprotos2py(cprotos: list[str], fd_spots=frozenset(), remove_sys_prefix=False) -> str:
     """
     Parse a list of C function declarations and output to Python code that can be embedded into
     angr.procedures.definitions.

angr/utils/mp.py

@@ -1,4 +1,5 @@
-from typing import NamedTuple, Optional, Callable, List, Dict, Any
+from typing import NamedTuple, Optional, Any
+from collections.abc import Callable
 import multiprocessing
 import platform
 
@@ -9,8 +10,8 @@ class Closure(NamedTuple):
     """
 
     f: Callable[..., None]
-    args: List[Any]
-    kwargs: Dict[str, Any]
+    args: list[Any]
+    kwargs: dict[str, Any]
 
 
 class Initializer:
@@ -32,7 +33,7 @@ class Initializer:
     def __init__(self, *, _manual: bool = True):
         if _manual:
             raise RuntimeError("This is a singleton; call .get() instead")
-        self.initializers: List[Closure] = []
+        self.initializers: list[Closure] = []
 
     def register(self, f: Callable[..., None], *args: Any, **kwargs: Any) -> None:
         """

angr/utils/segment_list.py

@@ -1,6 +1,5 @@
 # pylint:disable=no-else-break
 import logging
-from typing import Optional, Tuple, List
 
 from angr.errors import AngrCFGError
 
@@ -60,7 +59,7 @@ class SegmentList:
     __slots__ = ["_list", "_bytes_occupied"]
 
     def __init__(self):
-        self._list: List[Segment] = []
+        self._list: list[Segment] = []
         self._bytes_occupied = 0
 
     #
@@ -438,7 +437,7 @@ class SegmentList:
             return True
         return False
 
-    def occupied_by_sort(self, address: int) -> Optional[str]:
+    def occupied_by_sort(self, address: int) -> str | None:
         """
         Check if an address belongs to any segment, and if yes, returns the sort of the segment
 
@@ -456,7 +455,7 @@ class SegmentList:
             return self._list[idx - 1].sort
         return None
 
-    def occupied_by(self, address: int) -> Optional[Tuple[int, int, str]]:
+    def occupied_by(self, address: int) -> tuple[int, int, str] | None:
         """
         Check if an address belongs to any segment, and if yes, returns the beginning, the size, and the sort of the
         segment.

angr/utils/typing.py

@@ -1,9 +1,10 @@
-from typing import TypeVar, Optional, Iterable
+from typing import TypeVar
+from collections.abc import Iterable
 
 _T = TypeVar("_T")
 
 
-def unwrap(thing: Optional[_T]) -> _T:
+def unwrap(thing: _T | None) -> _T:
     assert thing is not None, "Tried to unwrap a `None` value"
     return thing
 

{angr-9.2.101.dist-info → angr-9.2.103.dist-info}/METADATA

@@ -1,29 +1,27 @@
 Metadata-Version: 2.1
 Name: angr
-Version: 9.2.101
+Version: 9.2.103
 Summary: A multi-architecture binary analysis toolkit, with the ability to perform dynamic symbolic execution and various static analyses on binaries
 Home-page: https://github.com/angr/angr
 License: BSD-2-Clause
 Classifier: License :: OSI Approved :: BSD License
 Classifier: Programming Language :: Python :: 3
 Classifier: Programming Language :: Python :: 3 :: Only
-Classifier: Programming Language :: Python :: 3.8
-Classifier: Programming Language :: Python :: 3.9
 Classifier: Programming Language :: Python :: 3.10
 Classifier: Programming Language :: Python :: 3.11
 Classifier: Programming Language :: Python :: 3.12
-Requires-Python: >=3.8
+Requires-Python: >=3.10
 Description-Content-Type: text/markdown
 License-File: LICENSE
 Requires-Dist: CppHeaderParser
 Requires-Dist: GitPython
-Requires-Dist: ailment ==9.2.101
-Requires-Dist: archinfo ==9.2.101
+Requires-Dist: ailment ==9.2.103
+Requires-Dist: archinfo ==9.2.103
 Requires-Dist: cachetools
 Requires-Dist: capstone ==5.0.0.post1
 Requires-Dist: cffi >=1.14.0
-Requires-Dist: claripy ==9.2.101
-Requires-Dist: cle ==9.2.101
+Requires-Dist: claripy ==9.2.103
+Requires-Dist: cle ==9.2.103
 Requires-Dist: dpkt
 Requires-Dist: itanium-demangler
 Requires-Dist: mulpyplexer
@@ -33,7 +31,7 @@ Requires-Dist: protobuf >=3.19.0
 Requires-Dist: psutil
 Requires-Dist: pycparser >=2.18
 Requires-Dist: pyformlang
-Requires-Dist: pyvex ==9.2.101
+Requires-Dist: pyvex ==9.2.103
 Requires-Dist: rich >=13.1.0
 Requires-Dist: rpyc
 Requires-Dist: sortedcontainers
@@ -49,10 +47,10 @@ Requires-Dist: myst-parser ; extra == 'docs'
 Requires-Dist: sphinx ; extra == 'docs'
 Requires-Dist: sphinx-autodoc-typehints ; extra == 'docs'
 Provides-Extra: pcode
-Requires-Dist: pypcode ~=2.0 ; extra == 'pcode'
+Requires-Dist: pypcode ~=2.1.0 ; extra == 'pcode'
 Provides-Extra: testing
 Requires-Dist: keystone-engine ; extra == 'testing'
-Requires-Dist: pypcode ~=2.0 ; extra == 'testing'
+Requires-Dist: pypcode ~=2.1.0 ; extra == 'testing'
 Requires-Dist: pytest ; extra == 'testing'
 Requires-Dist: pytest-split ; extra == 'testing'
 Requires-Dist: pytest-xdist ; extra == 'testing'