All Downloads are FREE. Search and download functionalities are using the official Maven repository.

proguard.analysis.cpa.defaults.StopJoinOperator Maven / Gradle / Ivy

Go to download

ProGuardCORE is a free library to read, analyze, modify, and write Java class files.

There is a newer version: 9.1.7
Show newest version
/*
 * ProGuardCORE -- library to process Java bytecode.
 *
 * Copyright (c) 2002-2022 Guardsquare NV
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package proguard.analysis.cpa.defaults;

import java.util.Collection;
import proguard.analysis.cpa.interfaces.AbstractDomain;
import proguard.analysis.cpa.interfaces.AbstractState;
import proguard.analysis.cpa.interfaces.Precision;
import proguard.analysis.cpa.interfaces.StopOperator;

/**
 * This {@link StopOperator} returns true if the input state is less or equal than join over the reached set.
 *
 * @author Dmitry Ivanov
 */
public final class StopJoinOperator
    implements StopOperator
{
    private final AbstractDomain abstractDomain;

    /**
     * Create a join operator from the abstract domain defining the join operator.
     *
     * @param abstractDomain abstract domain
     */
    public StopJoinOperator(AbstractDomain abstractDomain)
    {
        this.abstractDomain = abstractDomain;
    }

    //implementations for StopOperator

    @Override
    public boolean stop(AbstractState abstractState, Collection reachedAbstractStates, Precision precision)
    {
        if (reachedAbstractStates.isEmpty()) // since we may have no bottom in the lattice, we have to process the case of an empty reached set separately
        {
            return false;
        }
        return abstractDomain.isLessOrEqual(abstractState,
                                            reachedAbstractStates.stream().map(state -> (AbstractState) state).reduce(reachedAbstractStates.iterator().next(),
                                                                                                                      abstractDomain::join));
    }
}




© 2015 - 2025 Weber Informatics LLC | Privacy Policy