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

soot.jimple.infoflow.taintWrappers.TaintWrapperList Maven / Gradle / Ivy

There is a newer version: 2.9.0
Show newest version
/*******************************************************************************
 * Copyright (c) 2012 Secure Software Engineering Group at EC SPRIDE.
 * All rights reserved. This program and the accompanying materials
 * are made available under the terms of the GNU Lesser Public License v2.1
 * which accompanies this distribution, and is available at
 * http://www.gnu.org/licenses/old-licenses/gpl-2.0.html
 * 
 * Contributors: Christian Fritz, Steven Arzt, Siegfried Rasthofer, Eric
 * Bodden, and others.
 ******************************************************************************/
package soot.jimple.infoflow.taintWrappers;

import java.util.ArrayList;
import java.util.List;
import java.util.Set;
import java.util.concurrent.atomic.AtomicInteger;

import soot.SootMethod;
import soot.jimple.Stmt;
import soot.jimple.infoflow.InfoflowManager;
import soot.jimple.infoflow.data.Abstraction;

/**
 * List of taint wrappers. The wrappers at the beginning of the list are asked
 * first. As soon as a wrapper returns a non-empty set of taints, this set is
 * used. Otherwise, the next wrapper is asked. Even if a wrapper is exclusive
 * for a given library method, and returns an empty set, the next wrapper is
 * still asked.
 * 
 * @author Steven Arzt
 */
public class TaintWrapperList implements IReversibleTaintWrapper {

	private List wrappers = new ArrayList<>();
	private AtomicInteger hits = new AtomicInteger();
	private AtomicInteger misses = new AtomicInteger();

	public TaintWrapperList(ITaintPropagationWrapper... wrappers) {
		for (ITaintPropagationWrapper w : wrappers)
			if (w != null)
				addWrapper(w);
	}

	@Override
	public void initialize(InfoflowManager manager) {
		for (ITaintPropagationWrapper w : this.wrappers)
			w.initialize(manager);
	}

	/**
	 * Adds the given wrapper to the chain of wrappers.
	 * 
	 * @param wrapper The wrapper to add to the chain.
	 */
	public void addWrapper(ITaintPropagationWrapper wrapper) {
		this.wrappers.add(wrapper);
	}

	@Override
	public Set getTaintsForMethod(Stmt stmt, Abstraction d1, Abstraction taintedPath) {
		for (ITaintPropagationWrapper w : this.wrappers) {
			Set curAbsSet = w.getTaintsForMethod(stmt, d1, taintedPath);
			if (curAbsSet != null && !curAbsSet.isEmpty()) {
				hits.incrementAndGet();
				return curAbsSet;
			}
		}

		// Bookkeeping for statistics
		misses.incrementAndGet();
		return null;
	}

	@Override
	public boolean isExclusive(Stmt stmt, Abstraction taintedPath) {
		for (ITaintPropagationWrapper w : this.wrappers)
			if (w.isExclusive(stmt, taintedPath))
				return true;
		return false;
	}

	@Override
	public boolean supportsCallee(SootMethod method) {
		for (ITaintPropagationWrapper w : this.wrappers)
			if (w.supportsCallee(method))
				return true;
		return false;
	}

	@Override
	public boolean supportsCallee(Stmt callSite) {
		for (ITaintPropagationWrapper w : this.wrappers)
			if (w.supportsCallee(callSite))
				return true;
		return false;
	}

	@Override
	public int getWrapperHits() {
		return hits.get();
	}

	@Override
	public int getWrapperMisses() {
		return misses.get();
	}

	@Override
	public Set getAliasesForMethod(Stmt stmt, Abstraction d1, Abstraction taintedPath) {
		for (ITaintPropagationWrapper w : this.wrappers) {
			Set curAbsSet = w.getAliasesForMethod(stmt, d1, taintedPath);
			if (curAbsSet != null && !curAbsSet.isEmpty())
				return curAbsSet;
		}
		return null;
	}

	@Override
	public Set getInverseTaintsForMethod(Stmt stmt, Abstraction d1, Abstraction taintedPath) {
		for (ITaintPropagationWrapper w : this.wrappers) {
			if (w instanceof IReversibleTaintWrapper) {
				Set curAbsSet = ((IReversibleTaintWrapper) w).getInverseTaintsForMethod(stmt, d1,
						taintedPath);
				if (curAbsSet != null && !curAbsSet.isEmpty())
					return curAbsSet;
			}
		}
		return null;
	}

}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy