168 def bisect_profiles(decider, good, bad, common_funcs, lo, hi):  argument
199     lo_mid_prof[func] = bad[func]
201     mid_hi_prof[func] = bad[func]
207     result = bisect_profiles(decider, good, bad, common_funcs, lo, mid)
211     result = bisect_profiles(decider, good, bad, common_funcs, mid, hi)
218     problem_range = range_search(decider, good, bad, common_funcs, lo, hi)
227 def bisect_profiles_wrapper(decider, good, bad, perform_check=True):  argument
235     if decider.run(bad, save_run=False) != StatusEnum.BAD_STATUS:
238   common_funcs = sorted(func for func in good if func in bad)
247   results = bisect_profiles(decider, good, bad, common_funcs, 0,
254 def range_search(decider, good, bad, common_funcs, lo, hi):  argument
277       good_copy[func] = bad[func]
300       good_copy[func] = bad[func]
327       prof[func] = bad[func]
331       prof[func] = bad[func]
348 def check_good_not_bad(decider, good, bad):  argument
350   bad_copy = bad.copy()
352     if func not in bad:
357 def check_bad_not_good(decider, good, bad):  argument
360   for func in bad:
362       good_copy[func] = bad[func]