binary ninja snippet for finding a constant in a function / called function recursively

find_constant_recursive.py

from typing import Iterator, Optional

checked = set()

def check_inst(i: HighLevelILInstruction, const: int) -> Iterator[HighLevelILInstruction]:
    if isinstance(i, Constant) and i.constant == const: yield i
    for o in filter(lambda i: isinstance(i,HighLevelILInstruction), i.operands):
        yield from check_inst(o, const)

def check_func(f: Function, const: int, depth_max: int, depth: int = 0) -> Iterator[HighLevelILInstruction]:
    if (depth > depth_max): return
    if f in checked: return
    checked.add(f)
    yield from filter(lambda i: any(check_inst(i, const)), f.hlil.instructions)
    for f in f.callees:
        yield from check_func(f, const, depth_max, depth +1)

# todo: popup for depth and constant
for i in check_func(current_function, 0x570, 2):
    print(' -- match:')
    print(f'{i.function.source_function.symbol}:')
    print(f'{i} @ {i.address}')