angr 9.2.113__py3-none-macosx_10_9_x86_64.whl → 9.2.114__py3-none-macosx_10_9_x86_64.whl

angr/__init__.py

@@ -1,7 +1,7 @@
 # pylint: disable=wildcard-import
 # pylint: disable=wrong-import-position
 
-__version__ = "9.2.113"
+__version__ = "9.2.114"
 
 if bytes is str:
     raise Exception(

angr/analyses/decompiler/optimization_passes/const_prop_reverter.py

@@ -7,10 +7,9 @@ import claripy
 from ailment import Const
 from ailment.block_walker import AILBlockWalkerBase
 from ailment.statement import Call, Statement, ConditionalJump, Assignment, Store, Return
-from ailment.expression import Convert, Register
+from ailment.expression import Convert, Register, Expression
 
 from .optimization_pass import OptimizationPass, OptimizationPassStage
-from ..utils import remove_labels, add_labels
 from ....knowledge_plugins.key_definitions.atoms import MemoryLocation
 from ....knowledge_plugins.key_definitions.constants import OP_BEFORE
 
@@ -159,8 +158,7 @@ class ConstPropOptReverter(OptimizationPass):
 
     def _analyze(self, cache=None):
         self.resolution = False
-        self.out_graph = remove_labels(self._graph)
-        # self.out_graph = self._graph
+        self.out_graph = self._graph.copy()
 
         _pair_stmt_handlers = {
             Call: self._handle_Call_pair,
@@ -177,8 +175,6 @@ class ConstPropOptReverter(OptimizationPass):
 
         if not self.resolution:
             self.out_graph = None
-        else:
-            self.out_graph = add_labels(self.out_graph)
 
     def _analyze_call_pair_targets(self):
         all_obs_points = []
@@ -329,9 +325,10 @@ class ConstPropOptReverter(OptimizationPass):
             return
 
         # verify both calls are calls to the same function
-        if (isinstance(obj0.target, str) or isinstance(obj1.target, str)) and obj0.target != obj1.target:
-            return
-        elif not obj0.target.likes(obj1.target):
+        if isinstance(obj0.target, Expression) and isinstance(obj1.target, Expression):
+            if not obj0.target.likes(obj1.target):
+                return
+        elif obj0.target != obj1.target:
             return
 
         call0, call1 = obj0, obj1

angr/analyses/decompiler/region_simplifiers/switch_cluster_simplifier.py

@@ -4,6 +4,8 @@ from typing import DefaultDict, Any
 from collections import OrderedDict, defaultdict
 
 import ailment
+from ailment import UnaryOp
+from ailment.expression import negate
 
 from ....utils.constants import SWITCH_MISSING_DEFAULT_NODE_ADDR
 from ..structuring.structurer_nodes import SwitchCaseNode, ConditionNode, SequenceNode, MultiNode, BaseNode, BreakNode
@@ -520,6 +522,9 @@ def simplify_lowered_switches_core(
 
     if outermost_node is None:
         return False
+    if isinstance(outermost_node.condition, UnaryOp) and outermost_node.condition.op == "Not":
+        # attempt to flip any simple negated comparison for normalized operations
+        outermost_node.condition = negate(outermost_node.condition.operand)
 
     caseno_to_node = {}
     default_node_candidates: list[tuple[BaseNode, BaseNode]] = []  # parent to default node candidate

angr/analyses/decompiler/structuring/phoenix.py

@@ -12,7 +12,7 @@ from ailment.block import Block
 from ailment.statement import Statement, ConditionalJump, Jump, Label, Return
 from ailment.expression import Const, UnaryOp, MultiStatementExpression
 
-from angr.utils.graph import GraphUtils
+from angr.utils.graph import GraphUtils, TemporaryNode, PostDominators
 from ....knowledge_plugins.cfg import IndirectJumpType
 from ....utils.constants import SWITCH_MISSING_DEFAULT_NODE_ADDR
 from ....utils.graph import dominates, to_acyclic_graph, dfs_back_edges
@@ -24,6 +24,7 @@ from ..utils import (
     is_empty_or_label_only_node,
     has_nonlabel_statements,
     first_nonlabel_statement,
+    structured_node_is_simple_return,
 )
 from ..call_counter import AILCallCounter
 from .structurer_nodes import (
@@ -2144,7 +2145,7 @@ class PhoenixStructurer(StructurerBase):
         node_seq = {nn: (len(ordered_nodes) - idx) for (idx, nn) in enumerate(ordered_nodes)}  # post-order
 
         if all_edges_wo_dominance:
-            all_edges_wo_dominance = self._chick_order_edges(all_edges_wo_dominance, node_seq)
+            all_edges_wo_dominance = self._order_virtualizable_edges(full_graph, all_edges_wo_dominance, node_seq)
             # virtualize the first edge
             src, dst = all_edges_wo_dominance[0]
             self._virtualize_edge(graph, full_graph, src, dst)
@@ -2152,7 +2153,7 @@ class PhoenixStructurer(StructurerBase):
             return True
 
         if secondary_edges:
-            secondary_edges = self._chick_order_edges(secondary_edges, node_seq)
+            secondary_edges = self._order_virtualizable_edges(full_graph, secondary_edges, node_seq)
             # virtualize the first edge
             src, dst = secondary_edges[0]
             self._virtualize_edge(graph, full_graph, src, dst)
@@ -2501,6 +2502,85 @@ class PhoenixStructurer(StructurerBase):
                 break
         return None
 
+    def _order_virtualizable_edges(self, graph: networkx.DiGraph, edges: list, node_seq: dict[Any, int]) -> list:
+        """
+        Returns a list of edges that are ordered by the best edges to virtualize first.
+        The criteria for "best" is defined by a variety of heuristics described below.
+        """
+        if len(edges) <= 1:
+            return edges
+
+        # TODO: the graph we have here is not an accurate graph and can have no "entry node". We need a better graph.
+        try:
+            entry_node = [node for node in graph.nodes if graph.in_degree(node) == 0][0]
+        except IndexError:
+            entry_node = None
+
+        best_edges = edges
+        if self._phoenix_improved and entry_node is not None:
+            # the first few heuristics are based on the post-dominator count of the edge
+            # so we collect them for each candidate edge
+            edge_postdom_count = {}
+            edge_sibling_count = {}
+            for edge in edges:
+                _, dst = edge
+                graph_copy = networkx.DiGraph(graph)
+                graph_copy.remove_edge(*edge)
+                sibling_cnt = graph_copy.in_degree(dst)
+                if sibling_cnt == 0:
+                    continue
+
+                edge_sibling_count[edge] = sibling_cnt
+                post_dom_graph = PostDominators(graph_copy, entry_node).post_dom
+                post_doms = set()
+                for postdom_node, dominatee in post_dom_graph.edges():
+                    if not isinstance(postdom_node, TemporaryNode) and not isinstance(dominatee, TemporaryNode):
+                        post_doms.add((postdom_node, dominatee))
+                edge_postdom_count[edge] = len(post_doms)
+
+                # H1: the edge that has the least amount of sibling edges should be virtualized first
+                # this is believed to reduce the amount of virtualization needed in future rounds and increase
+                # the edges that enter a single outer-scope if-stmt
+                if edge_sibling_count:
+                    min_sibling_count = min(edge_sibling_count.values())
+                    best_edges = [edge for edge, cnt in edge_sibling_count.items() if cnt == min_sibling_count]
+                    if len(best_edges) == 1:
+                        return best_edges
+
+                    # create the next heuristic based on the best edges from the previous heuristic
+                    filtered_edge_postdom_count = edge_postdom_count.copy()
+                    for edge in list(edge_postdom_count.keys()):
+                        if edge not in best_edges:
+                            del filtered_edge_postdom_count[edge]
+                    if filtered_edge_postdom_count:
+                        edge_postdom_count = filtered_edge_postdom_count
+
+                # H2: the edge, when removed, that causes the most post-dominators of the graph should be virtualized
+                # first. this is believed to make the code more linear looking be reducing the amount of scopes.
+                # informally, we believe post-dominators to be an inverse indicator of the number of scopes present
+                if edge_postdom_count:
+                    max_postdom_count = max(edge_postdom_count.values())
+                    best_edges = [edge for edge, cnt in edge_postdom_count.items() if cnt == max_postdom_count]
+                    if len(best_edges) == 1:
+                        return best_edges
+
+                # H3: the edge that goes directly to a return statement should be virtualized first
+                # this is believed to be good because it can be corrected in later optimization by duplicating
+                # the return
+                candidate_edges = best_edges
+                best_edges = []
+                for src, dst in candidate_edges:
+                    if graph.has_node(dst) and structured_node_is_simple_return(dst, graph):
+                        best_edges.append((src, dst))
+
+                if len(best_edges) == 1:
+                    return best_edges
+                elif not best_edges:
+                    best_edges = candidate_edges
+
+        # if we have another tie, or we never used improved heuristics, then we do the chick_order.
+        return PhoenixStructurer._chick_order_edges(best_edges, node_seq)
+
     @staticmethod
     def _chick_order_edges(edges: list, node_seq: dict[Any, int]) -> list:
         graph = networkx.DiGraph()

angr/analyses/decompiler/utils.py

@@ -409,7 +409,9 @@ def update_labels(graph: networkx.DiGraph):
     return add_labels(remove_labels(graph))
 
 
-def structured_node_is_simple_return(node: Union["SequenceNode", "MultiNode"], graph: networkx.DiGraph) -> bool:
+def structured_node_is_simple_return(
+    node: Union["SequenceNode", "MultiNode"], graph: networkx.DiGraph, use_packed_successors=False
+) -> bool:
     """
     Will check if a "simple return" is contained within the node a simple returns looks like this:
     if (cond) {
@@ -452,6 +454,9 @@ def structured_node_is_simple_return(node: Union["SequenceNode", "MultiNode"], g
     if valid_last_stmt and last_block.statements:
         valid_last_stmt = not isinstance(last_block.statements[-1], (ailment.Stmt.ConditionalJump, ailment.Stmt.Jump))
 
+    if use_packed_successors:
+        last_block = node
+
     return valid_last_stmt and last_block in graph and not list(graph.successors(last_block))
 
 

angr/calling_conventions.py

@@ -2247,7 +2247,7 @@ ARCH_NAME_ALIASES = {
     "ARMEL": [],
     "ARMHF": [],
     "ARMCortexM": [],
-    "AARCH64": ["arm64"],
+    "AARCH64": ["arm64", "aarch64"],
     "MIPS32": [],
     "MIPS64": [],
     "PPC32": ["powerpc32"],
@@ -2315,10 +2315,16 @@ def unify_arch_name(arch: str) -> str:
         # Sleigh architecture names
         chunks = arch.lower().split(":")
         if len(chunks) >= 3:
-            arch_base, endianness, bits = chunks[:3]  # pylint:disable=unused-variable
-            arch = f"{arch_base}{bits}"
+            arch_base, _, bits = chunks[:3]
 
-    return ALIAS_TO_ARCH_NAME.get(arch, arch)
+            if arch_base in ALIAS_TO_ARCH_NAME:
+                return ALIAS_TO_ARCH_NAME[arch_base]
+
+            base_with_bits = f"{arch_base}{bits}"
+            if base_with_bits in ALIAS_TO_ARCH_NAME:
+                return ALIAS_TO_ARCH_NAME[base_with_bits]
+
+    return arch
 
 
 SYSCALL_CC: dict[str, dict[str, type[SimCCSyscall]]] = {

{angr-9.2.113.dist-info → angr-9.2.114.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: angr
-Version: 9.2.113
+Version: 9.2.114
 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
@@ -15,46 +15,46 @@ Description-Content-Type: text/markdown
 License-File: LICENSE
 Requires-Dist: CppHeaderParser
 Requires-Dist: GitPython
-Requires-Dist: ailment ==9.2.113
-Requires-Dist: archinfo ==9.2.113
+Requires-Dist: ailment==9.2.114
+Requires-Dist: archinfo==9.2.114
 Requires-Dist: cachetools
-Requires-Dist: capstone ==5.0.0.post1
-Requires-Dist: cffi >=1.14.0
-Requires-Dist: claripy ==9.2.113
-Requires-Dist: cle ==9.2.113
+Requires-Dist: capstone==5.0.0.post1
+Requires-Dist: cffi>=1.14.0
+Requires-Dist: claripy==9.2.114
+Requires-Dist: cle==9.2.114
 Requires-Dist: dpkt
 Requires-Dist: itanium-demangler
 Requires-Dist: mulpyplexer
 Requires-Dist: nampa
-Requires-Dist: networkx !=2.8.1,>=2.0
-Requires-Dist: protobuf >=3.19.0
+Requires-Dist: networkx!=2.8.1,>=2.0
+Requires-Dist: protobuf>=3.19.0
 Requires-Dist: psutil
-Requires-Dist: pycparser >=2.18
+Requires-Dist: pycparser>=2.18
 Requires-Dist: pyformlang
-Requires-Dist: pyvex ==9.2.113
-Requires-Dist: rich >=13.1.0
+Requires-Dist: pyvex==9.2.114
+Requires-Dist: rich>=13.1.0
 Requires-Dist: rpyc
 Requires-Dist: sortedcontainers
 Requires-Dist: sympy
-Requires-Dist: unicorn ==2.0.1.post1
+Requires-Dist: unicorn==2.0.1.post1
 Requires-Dist: unique-log-filter
-Requires-Dist: colorama ; platform_system == "Windows"
+Requires-Dist: colorama; platform_system == "Windows"
 Provides-Extra: angrdb
-Requires-Dist: sqlalchemy ; extra == 'angrdb'
+Requires-Dist: sqlalchemy; extra == "angrdb"
 Provides-Extra: docs
-Requires-Dist: furo ; extra == 'docs'
-Requires-Dist: myst-parser ; extra == 'docs'
-Requires-Dist: sphinx ; extra == 'docs'
-Requires-Dist: sphinx-autodoc-typehints ; extra == 'docs'
+Requires-Dist: furo; extra == "docs"
+Requires-Dist: myst-parser; extra == "docs"
+Requires-Dist: sphinx; extra == "docs"
+Requires-Dist: sphinx-autodoc-typehints; extra == "docs"
 Provides-Extra: pcode
-Requires-Dist: pypcode ~=3.0 ; extra == 'pcode'
+Requires-Dist: pypcode~=3.0; extra == "pcode"
 Provides-Extra: testing
-Requires-Dist: keystone-engine ; extra == 'testing'
-Requires-Dist: pypcode ~=3.0 ; extra == 'testing'
-Requires-Dist: pytest ; extra == 'testing'
-Requires-Dist: pytest-split ; extra == 'testing'
-Requires-Dist: pytest-xdist ; extra == 'testing'
-Requires-Dist: sqlalchemy ; extra == 'testing'
+Requires-Dist: keystone-engine; extra == "testing"
+Requires-Dist: pypcode~=3.0; extra == "testing"
+Requires-Dist: pytest; extra == "testing"
+Requires-Dist: pytest-split; extra == "testing"
+Requires-Dist: pytest-xdist; extra == "testing"
+Requires-Dist: sqlalchemy; extra == "testing"
 
 # angr
 

{angr-9.2.113.dist-info → angr-9.2.114.dist-info}/RECORD

@@ -1,10 +1,10 @@
-angr/__init__.py,sha256=xA4w3fa0ApgzfqAE8MEN_HnuIXRB8D33txbLVl2JwBs,3708
+angr/__init__.py,sha256=mLvFdIV2FcGXydJ8V0yBwu3VCookiOEbyv7KBW1YhmA,3708
 angr/__main__.py,sha256=kaO56Te6h73SM94BVtASF00q5QbBbC3eBs9poVc9sVI,1887
 angr/annocfg.py,sha256=1tnBfxgLJh9I6Brm1JDdsWLHGmCQYdD6PTC_bFTOMrg,10775
 angr/blade.py,sha256=B8QXVQ93jz1YCIlb-dZLeBqYmVFdMXI5GleP1Wnxjrw,15519
 angr/block.py,sha256=tHxXlBBFrPZbp5phhTn63K55khjDIIUSNJgFn4lPd9I,14761
 angr/callable.py,sha256=-E9HelavtRY1xPAxCVXl120H8Rb7Myd2IcrXtWZFAOU,6034
-angr/calling_conventions.py,sha256=-1ToJG0p31snlyO50mTpDZJysLvyuvHdfqx_H7Y7eZ4,91480
+angr/calling_conventions.py,sha256=QJ7SwD3IQ7Mr7SLe-OL6iTVcqciL_W9YfuMrtJ44Nig,91642
 angr/code_location.py,sha256=IudWSR-gJzq_EeVw-jEZvQumVYwUUDWXR1vmLAkS-SQ,5432
 angr/codenode.py,sha256=Di6ZxGqf-e6tKL49Zr0sq4vqpy_-nUDYkBdLj2Tg2Po,3760
 angr/errors.py,sha256=Yh_qSz7FjMSqqK9P3CVJHQZUzvTELLg6dRGYyINVZSM,8348
@@ -115,7 +115,7 @@ angr/analyses/decompiler/return_maker.py,sha256=CztTpm6e3TF0ijdiZDl0HeObxTtOz0TO
 angr/analyses/decompiler/seq_cf_structure_counter.py,sha256=JQ3iY5RXdyggVKXes--38g_EpNOuwM6CsVOqicYu2gQ,1245
 angr/analyses/decompiler/seq_to_blocks.py,sha256=2KINMEgaXMG3XIiFDMRkbn10dggy7a9AHgwV383huRM,529
 angr/analyses/decompiler/sequence_walker.py,sha256=mw4RG-Act5_no_RyQcsxWZwva-n7FdH2a7w_uItGUpI,8428
-angr/analyses/decompiler/utils.py,sha256=wD93VTmahKQE_k-9rYEnsKFMDVIgOi-VeZk363skyKs,28078
+angr/analyses/decompiler/utils.py,sha256=--d8hymqB_22j3NjmXjqIPfi12klF1de36Xli53a5HM,28170
 angr/analyses/decompiler/ccall_rewriters/__init__.py,sha256=wbWqZ8xG6ZvzEApkAwMsNQFC-iwF3swG1YJsaf1cIrQ,102
 angr/analyses/decompiler/ccall_rewriters/amd64_ccalls.py,sha256=qcr8a-83pY8nqwsYY27gc9ev8XtBxpdGPrmaULr6XuU,21519
 angr/analyses/decompiler/ccall_rewriters/rewriter_base.py,sha256=9-O-m4OB4DsAMAyAH_0sZg1FdhUUQQbENy8yhsJ7PJo,463
@@ -123,7 +123,7 @@ angr/analyses/decompiler/optimization_passes/__init__.py,sha256=mu8cqtQo4458zAdy
 angr/analyses/decompiler/optimization_passes/base_ptr_save_simplifier.py,sha256=bjpEMW-Lqj5XW9NWUikGPcRn5scKNc8VvEjVMXxAuq8,5289
 angr/analyses/decompiler/optimization_passes/code_motion.py,sha256=RoOVC1IyziUh_N6quZzRmBwkSNLSzvc8A3-EGAUsETU,15263
 angr/analyses/decompiler/optimization_passes/const_derefs.py,sha256=n2JKyEymGDMhIoXc2zsn6pAxxx9T5eu-jxyO3Cg8Fts,10658
-angr/analyses/decompiler/optimization_passes/const_prop_reverter.py,sha256=FBZIgncVwJ6fXdsxhWgWxeJx0A2fLmtiksu6A_GmikY,13107
+angr/analyses/decompiler/optimization_passes/const_prop_reverter.py,sha256=s3H1J3JTp309NX-NqniUhPd-kPIarQqkWd-TxHP-W-4,12985
 angr/analyses/decompiler/optimization_passes/cross_jump_reverter.py,sha256=CP-WjyQGOw_mnUF0ZpC5C4syMxlx4Tvy0T_EIZQxXrY,4033
 angr/analyses/decompiler/optimization_passes/deadblock_remover.py,sha256=Km7nX7hNDVZGgEg7wmXAIiiA5edhpo7Bxqc13iyjiEk,2330
 angr/analyses/decompiler/optimization_passes/div_simplifier.py,sha256=J7LRc3-DKfToxKVejnkHbNel9_56-7xsGyJJiTCwqsQ,17442
@@ -204,7 +204,7 @@ angr/analyses/decompiler/region_simplifiers/ifelse.py,sha256=nWUow7p_TOgFQuUgWXQ
 angr/analyses/decompiler/region_simplifiers/loop.py,sha256=crWqkXno1kTHk1a5keIzP2lrt8TbeVW4E85WWMhtqJA,5831
 angr/analyses/decompiler/region_simplifiers/node_address_finder.py,sha256=0JIerDBQ37mumowl2SRZ2GOUlwzPzZskz9-zM1lUl5s,542
 angr/analyses/decompiler/region_simplifiers/region_simplifier.py,sha256=_lf-Xfl-k_VDELeAVCpQ0P9ZlH3AxYSbN0_naWJRfN4,8177
-angr/analyses/decompiler/region_simplifiers/switch_cluster_simplifier.py,sha256=Sk2dCnmBZk1Rt86hsUH18L_bx0PY4g2gNLQvp3iUqbg,24472
+angr/analyses/decompiler/region_simplifiers/switch_cluster_simplifier.py,sha256=s8lThEYSKYdXBbKcbpDpawLllaj052ohIFPPUfHt7cU,24791
 angr/analyses/decompiler/region_simplifiers/switch_expr_simplifier.py,sha256=HGIiC6c3C91VfcqxUHe9aTsRohwmMXOHZH_G_dbwwx4,3327
 angr/analyses/decompiler/structured_codegen/__init__.py,sha256=NLEvs8xnJwJiUgX8AmgS7rtFFW4SxtQcA1AjzE-GryA,313
 angr/analyses/decompiler/structured_codegen/base.py,sha256=TdghqAsAkjZpPfzFarh8Wn1zfBYMFcMsBZhRqXgoPNo,3778
@@ -213,7 +213,7 @@ angr/analyses/decompiler/structured_codegen/dummy.py,sha256=IVfmtcWpTgNCRVsuW3Gd
 angr/analyses/decompiler/structured_codegen/dwarf_import.py,sha256=TMz65TkF_ID_Ipocj0aFDb84H6slolN90wq0tzhY2Rk,6773
 angr/analyses/decompiler/structuring/__init__.py,sha256=Ai63Im5VSiMDP8ACiDb34chqMl84JgzQXFIO8MV7hl0,368
 angr/analyses/decompiler/structuring/dream.py,sha256=NBv19CyJrYb2q77Q-3gpIhEl0r6Aci4lhO4hY_VQfN8,48374
-angr/analyses/decompiler/structuring/phoenix.py,sha256=JfWEdMf6P4ypQpVo-uh_ZL6zrYPem8qbkY-J7dFoQmQ,119612
+angr/analyses/decompiler/structuring/phoenix.py,sha256=aF9e4KF-3lXT5Q6ECl4bbZd5rw3koeOMYhZgsOQUhec,124025
 angr/analyses/decompiler/structuring/recursive_structurer.py,sha256=E_6Tj6jpNmWbZ_f9fwxan87VNYUGnf26fnoZC7dxny4,7063
 angr/analyses/decompiler/structuring/structurer_base.py,sha256=JoUxpZ2iDN0V7vToMPb0MgGB6eTvWDUk0JK8oJYlQ3U,41254
 angr/analyses/decompiler/structuring/structurer_nodes.py,sha256=x-1xUfeIzTNwLlRTv2M_9q7BDWLSWiSkaOuk20l8750,11930
@@ -491,7 +491,7 @@ angr/knowledge_plugins/xrefs/__init__.py,sha256=-5A2h048WTRu6Et7q7bqlc-AyBXNuJ9A
 angr/knowledge_plugins/xrefs/xref.py,sha256=1BMphrr8iViDtVWPXWidmY1_uNmw9LRvEwwZLt3Zqw8,4907
 angr/knowledge_plugins/xrefs/xref_manager.py,sha256=a4uvTJkdM0PQIuyYcd7t76IddrrVjPGe9SZrRaqp2II,3980
 angr/knowledge_plugins/xrefs/xref_types.py,sha256=VR3xLQQ-gUg25oX0OL3BJHyQRlZh2A8syBac9ZMS9n4,271
-angr/lib/angr_native.dylib,sha256=sgaA3aYfHpEqGWHkX-DVQAsXlK8Q3YYy8JOb3O6SB9E,18604080
+angr/lib/angr_native.dylib,sha256=ys6yDN_NNCA9h-XgdAZ3JpckMU1uJEJ0vzc9818w2Jo,18604080
 angr/misc/__init__.py,sha256=Ct-Q6-c-Frdz5Ihkqmou3j_1jyJi8WJXlQxs-gPQg0Y,237
 angr/misc/ansi.py,sha256=m5RY65yyvluUJErkvCF4I4z1o5kXi2xb3Yuvt9bITCA,776
 angr/misc/autoimport.py,sha256=vSXclz6pss3lMecoT5_doX0SvORNmZPIvVyDm4je4HE,3419
@@ -1296,9 +1296,9 @@ angr/utils/orderedset.py,sha256=6SRZz6PkOVavOzlUd2cIiqZQyWtKO72F2he_cG0aP9Q,1943
 angr/utils/segment_list.py,sha256=5nnuVtdZk9NS2y_xUBVA9khWPueP_zagNtPSjaoMHbA,20410
 angr/utils/timing.py,sha256=uOowCP8kotDrKDOjlAod-guBuYkAA8zEtiAwpdwMlIU,1334
 angr/utils/typing.py,sha256=pCjA7JZAzcvrk-iyIE2cRHc1G66AMSGEON3aFfjtPVc,431
-angr-9.2.113.dist-info/LICENSE,sha256=cgL_ho5B1NH8UxwtBuqThRWdjear8b7hktycaS1sz6g,1327
-angr-9.2.113.dist-info/METADATA,sha256=LAfEtzuE36bkULkly8pJCE2HrLcoXf15H01VT5gA5Pc,4703
-angr-9.2.113.dist-info/WHEEL,sha256=9qBGXD6WrhRChb7trksjMZR-KI8dtg8DzxtGjt7Nf7E,106
-angr-9.2.113.dist-info/entry_points.txt,sha256=Vjh1C8PMyr5dZFMnik5WkEP01Uwr2T73I3a6N32sgQU,44
-angr-9.2.113.dist-info/top_level.txt,sha256=dKw0KWTbwLXytFvv15oAAG4sUs3ey47tt6DorJG9-hw,5
-angr-9.2.113.dist-info/RECORD,,
+angr-9.2.114.dist-info/LICENSE,sha256=cgL_ho5B1NH8UxwtBuqThRWdjear8b7hktycaS1sz6g,1327
+angr-9.2.114.dist-info/METADATA,sha256=66zn4xJ9vxYyU7zvaCUzwvqCbGCukbXTNjmFHSuPjkY,4676
+angr-9.2.114.dist-info/WHEEL,sha256=9qBGXD6WrhRChb7trksjMZR-KI8dtg8DzxtGjt7Nf7E,106
+angr-9.2.114.dist-info/entry_points.txt,sha256=Vjh1C8PMyr5dZFMnik5WkEP01Uwr2T73I3a6N32sgQU,44
+angr-9.2.114.dist-info/top_level.txt,sha256=dKw0KWTbwLXytFvv15oAAG4sUs3ey47tt6DorJG9-hw,5
+angr-9.2.114.dist-info/RECORD,,