Function stack_graphs::c::sg_partial_path_arena_find_partial_paths_in_file

#[no_mangle]
pub extern "C" fn sg_partial_path_arena_find_partial_paths_in_file(
    graph: *const sg_stack_graph,
    partials: *mut sg_partial_path_arena,
    file: sg_file_handle,
    partial_path_list: *mut sg_partial_path_list,
    cancellation_flag: *const usize
) -> sg_result

Finds all partial paths in a file that are productive and as complete as possible, placing the result into the partial_path_list output parameter. You must free the path list when you are done with it by calling sg_partial_path_list_done.

This function will not return until all reachable paths have been processed, so graph must already contain a complete stack graph. If you have a very large stack graph stored in some other storage system, and want more control over lazily loading only the necessary pieces, then you should use sg_forward_path_stitcher.