pascal.taie.analysis.pta.toolkit.mahjong.DFAFactory Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of tai-e Show documentation
An easy-to-learn/use static analysis framework for Java
The newest version!
/*
 * Tai-e: A Static Analysis Framework for Java
 *
 * Copyright (C) 2022 Tian Tan 
 * Copyright (C) 2022 Yue Li 
 *
 * This file is part of Tai-e.
 *
 * Tai-e is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Lesser General Public License
 * as published by the Free Software Foundation, either version 3
 * of the License, or (at your option) any later version.
 *
 * Tai-e is distributed in the hope that it will be useful,but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General
 * Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with Tai-e. If not, see .
 */

package pascal.taie.analysis.pta.toolkit.mahjong;

import pascal.taie.analysis.pta.core.heap.Obj;
import pascal.taie.language.type.Type;
import pascal.taie.util.collection.Maps;
import pascal.taie.util.collection.Sets;

import java.util.ArrayDeque;
import java.util.Collection;
import java.util.Queue;
import java.util.Set;
import java.util.concurrent.ConcurrentMap;
import java.util.stream.Collectors;

class DFAFactory {

    private final FieldPointsToGraph fpg;

    private Set states, visited;

    private ConcurrentMap, DFAState> stateMap;

    DFAFactory(FieldPointsToGraph fpg) {
        this.fpg = fpg;
        buildAllDFA();
    }

    private void buildAllDFA() {
        stateMap = Maps.newConcurrentMap();
        states = Sets.newConcurrentSet();
        visited = Sets.newConcurrentSet();
        fpg.getObjects().parallelStream().forEach(this::buildDFA);
    }

    /**
     * Perform subset construction algorithm to convert an NFA
     * to a DFA. If a set of NFA states are merged to an existing
     * DFA state, then reused the existing DFA state instead of creating
     * an equivalent new one.
     *
     * @param obj the start state (object) of the DFA
     */
    private void buildDFA(Obj obj) {
        Set q0Set = Set.of(obj);
        if (!stateMap.containsKey(q0Set)) {
            NFA nfa = new NFA(obj, fpg);
            DFAState startState = getDFAState(q0Set, nfa);
            Queue workList = new ArrayDeque<>();
            states.add(startState);
            workList.add(startState);
            while (!workList.isEmpty()) {
                DFAState s = workList.poll();
                if (!visited.contains(s)) {
                    visited.add(s);
                    Set fields = fields(nfa, s.getObjects());
                    fields.forEach(f -> {
                        Set nextNFAStates = move(nfa, s.getObjects(), f);
                        DFAState nextState = getDFAState(nextNFAStates, nfa);
                        if (!states.contains(nextState)) {
                            states.add(nextState);
                            workList.add(nextState);
                        }
                        addTransition(s, f, nextState);
                    });
                }
            }
        }
    }

    private DFAState getDFAState(Set objs, NFA nfa) {
        return stateMap.computeIfAbsent(objs, objects -> {
            Set output = objects.stream()
                    .map(nfa::outputOf)
                    .collect(Collectors.toSet());
            return new DFAState(objects, output);
        });
    }

    private Set move(NFA nfa, Set objs, Field f) {
        return objs.stream()
                .map(obj -> nfa.nextStates(obj, f))
                .flatMap(Collection::stream)
                .collect(Collectors.toSet());
    }

    private Set fields(NFA nfa, Set objs) {
        return objs.stream()
                .map(nfa::outEdgesOf)
                .flatMap(Collection::stream)
                .collect(Collectors.toSet());
    }

    private void addTransition(DFAState s, Field f, DFAState nextState) {
        s.addTransition(f, nextState);
    }

    DFA getDFA(Obj obj) {
        DFAState q0 = stateMap.get(Set.of(obj));
        return new DFA(q0);
    }
}