Class Andersen

src/analysis/pointsto/mod.rs:49–53

Field-sensitive intra-procedural Andersen pointer analysis. 1. collect constraints from MIR to build a `ConstraintGraph` 2. adopt a fixed-point algorithm to update `ConstraintGraph` and points-to info There are several changes: 1. Use a place to represent a memroy cell. 2. Create an Alloc node for each

/// 5. Interproc methods: Use parameters' type info to guide the analysis heuristically (simple but powerful).
/// 6. Interproc closures: Track the upvars of closures in the functions defining the closures (restricted).
pub struct Andersen<'a, 'tcx> {
    body: &'a Body<'tcx>,
    tcx: TyCtxt<'tcx>,
    pts: PointsToMap<'tcx>,
}

pub type PointsToMap<'tcx> = FxHashMap<ConstraintNode<'tcx>, FxHashSet<ConstraintNode<'tcx>>>;