Method compute_recursive_func_coverage

src/feedback/branches.rs:278–303

compute the recursive code coverage inside a function

(
        &self,
        func: &str,
        cov_cache: &HashMap<String, (u32, u32)>,
    )

    /// compute the recursive code coverage inside a function
    pub fn compute_recursive_func_coverage(
        &self,
        func: &str,
        cov_cache: &HashMap<String, (u32, u32)>,
    ) -> eyre::Result<f32> {
        if let Some((covered, total)) = cov_cache.get(func) {
            if covered == &0 && total != &0 {
                return Ok(0_f32);
            }
        }
        let mut visited = HashSet::new();
        let (covered_branches, total_branches) =
            self.get_func_branch_coverage(func, cov_cache, &mut visited)?;
        if total_branches == 0 {
            if let Some(exec_count) = get_exec_counter_value(func) {
                if exec_count == 0 {
                    return Ok(0_f32);
                } else {
                    return Ok(1_f32);
                }
            }
            return Ok(0_f32);
        }
        let func_coverage = covered_branches as f32 / total_branches as f32;
        Ok(func_coverage)
    }

    fn get_func_branch_coverage(
        &self,