168 def bisect_profiles(decider, good, bad, common_funcs, lo, hi):  argument
196   lo_mid_prof = good.copy()  # covers bad from lo:mid
197   mid_hi_prof = good.copy()  # covers bad from mid:hi
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
233     if decider.run(good, save_run=False) != StatusEnum.GOOD_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
282       good_copy[func] = good[func]
295       good_copy[func] = good[func]
325     prof = good.copy()
348 def check_good_not_bad(decider, good, bad):  argument
351   for func in good:
353       bad_copy[func] = good[func]
357 def check_bad_not_good(decider, good, bad):  argument
359   good_copy = good.copy()
361     if func not in good: