remove warnings in com.ibm.wala.core
This commit is contained in:
parent
0d7c3c3b7f
commit
61d7a33928
|
@ -1,6 +1,14 @@
|
|||
#Thu Feb 03 10:12:26 EST 2011
|
||||
eclipse.preferences.version=1
|
||||
instance/org.eclipse.core.net/org.eclipse.core.net.hasMigrated=true
|
||||
org.eclipse.jdt.core.builder.cleanOutputFolder=clean
|
||||
org.eclipse.jdt.core.builder.duplicateResourceTask=warning
|
||||
org.eclipse.jdt.core.builder.invalidClasspath=abort
|
||||
org.eclipse.jdt.core.builder.recreateModifiedClassFileInOutputFolder=ignore
|
||||
org.eclipse.jdt.core.builder.resourceCopyExclusionFilter=,*.g
|
||||
org.eclipse.jdt.core.circularClasspath=error
|
||||
org.eclipse.jdt.core.classpath.exclusionPatterns=enabled
|
||||
org.eclipse.jdt.core.classpath.multipleOutputLocations=enabled
|
||||
org.eclipse.jdt.core.classpath.outputOverlappingAnotherSource=error
|
||||
org.eclipse.jdt.core.compiler.codegen.inlineJsrBytecode=enabled
|
||||
org.eclipse.jdt.core.compiler.codegen.targetPlatform=1.5
|
||||
org.eclipse.jdt.core.compiler.codegen.unusedLocal=preserve
|
||||
|
@ -9,6 +17,7 @@ org.eclipse.jdt.core.compiler.debug.lineNumber=generate
|
|||
org.eclipse.jdt.core.compiler.debug.localVariable=generate
|
||||
org.eclipse.jdt.core.compiler.debug.sourceFile=generate
|
||||
org.eclipse.jdt.core.compiler.doc.comment.support=enabled
|
||||
org.eclipse.jdt.core.compiler.maxProblemPerUnit=100
|
||||
org.eclipse.jdt.core.compiler.problem.annotationSuperInterface=warning
|
||||
org.eclipse.jdt.core.compiler.problem.assertIdentifier=error
|
||||
org.eclipse.jdt.core.compiler.problem.autoboxing=ignore
|
||||
|
@ -342,3 +351,5 @@ org.eclipse.jdt.core.formatter.use_on_off_tags=false
|
|||
org.eclipse.jdt.core.formatter.use_tabs_only_for_leading_indentations=false
|
||||
org.eclipse.jdt.core.formatter.wrap_before_binary_operator=true
|
||||
org.eclipse.jdt.core.formatter.wrap_outer_expressions_when_nested=true
|
||||
org.eclipse.jdt.core.incompatibleJDKLevel=ignore
|
||||
org.eclipse.jdt.core.incompleteClasspath=error
|
||||
|
|
|
@ -0,0 +1,2 @@
|
|||
eclipse.preferences.version=1
|
||||
org.eclipse.jdt.launching.PREF_STRICTLY_COMPATIBLE_JRE_NOT_AVAILABLE=ignore
|
|
@ -35,6 +35,7 @@ import com.ibm.wala.util.intset.IntSet;
|
|||
* There is an edge from an InstanceKey I to a PointerKey P iff - P represents a field of an object instance modeled by I, or - P
|
||||
* represents the array contents of array instance I.
|
||||
*/
|
||||
@SuppressWarnings("deprecation")
|
||||
public abstract class HeapGraph implements NumberedGraph<Object> {
|
||||
|
||||
private final PointerAnalysis pa;
|
||||
|
|
|
@ -903,7 +903,7 @@ public abstract class AbstractIntStackMachine implements FixedPointConstants {
|
|||
protected class BasicStackMachineVisitor extends IInstruction.Visitor {
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitArrayLength(ArrayLengthInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitArrayLength(ArrayLengthInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitArrayLength(ArrayLengthInstruction instruction) {
|
||||
|
@ -913,7 +913,7 @@ public abstract class AbstractIntStackMachine implements FixedPointConstants {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitArrayLoad(IArrayLoadInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitArrayLoad(IArrayLoadInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitArrayLoad(IArrayLoadInstruction instruction) {
|
||||
|
@ -923,7 +923,7 @@ public abstract class AbstractIntStackMachine implements FixedPointConstants {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitArrayStore(IArrayStoreInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitArrayStore(IArrayStoreInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitArrayStore(IArrayStoreInstruction instruction) {
|
||||
|
@ -933,7 +933,7 @@ public abstract class AbstractIntStackMachine implements FixedPointConstants {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitBinaryOp(IBinaryOpInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitBinaryOp(IBinaryOpInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitBinaryOp(IBinaryOpInstruction instruction) {
|
||||
|
@ -941,7 +941,7 @@ public abstract class AbstractIntStackMachine implements FixedPointConstants {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitComparison(IComparisonInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitComparison(IComparisonInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitComparison(IComparisonInstruction instruction) {
|
||||
|
@ -951,7 +951,7 @@ public abstract class AbstractIntStackMachine implements FixedPointConstants {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitConditionalBranch(IConditionalBranchInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitConditionalBranch(IConditionalBranchInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitConditionalBranch(IConditionalBranchInstruction instruction) {
|
||||
|
@ -960,7 +960,7 @@ public abstract class AbstractIntStackMachine implements FixedPointConstants {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitConstant(ConstantInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitConstant(ConstantInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitConstant(ConstantInstruction instruction) {
|
||||
|
@ -968,7 +968,7 @@ public abstract class AbstractIntStackMachine implements FixedPointConstants {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitConversion(IConversionInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitConversion(IConversionInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitConversion(IConversionInstruction instruction) {
|
||||
|
@ -977,7 +977,7 @@ public abstract class AbstractIntStackMachine implements FixedPointConstants {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitDup(DupInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitDup(DupInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitDup(DupInstruction instruction) {
|
||||
|
@ -1010,7 +1010,7 @@ public abstract class AbstractIntStackMachine implements FixedPointConstants {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitGet(IGetInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitGet(IGetInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitGet(IGetInstruction instruction) {
|
||||
|
@ -1025,7 +1025,7 @@ public abstract class AbstractIntStackMachine implements FixedPointConstants {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitInstanceof(IInstanceofInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitInstanceof(IInstanceofInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitInstanceof(IInstanceofInstruction instruction) {
|
||||
|
@ -1034,7 +1034,7 @@ public abstract class AbstractIntStackMachine implements FixedPointConstants {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitInvoke(IInvokeInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitInvoke(IInvokeInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitInvoke(IInvokeInstruction instruction) {
|
||||
|
@ -1047,7 +1047,7 @@ public abstract class AbstractIntStackMachine implements FixedPointConstants {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitMonitor(MonitorInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitMonitor(MonitorInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitMonitor(MonitorInstruction instruction) {
|
||||
|
@ -1055,7 +1055,7 @@ public abstract class AbstractIntStackMachine implements FixedPointConstants {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitLocalLoad(ILoadInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitLocalLoad(ILoadInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitLocalLoad(ILoadInstruction instruction) {
|
||||
|
@ -1064,7 +1064,7 @@ public abstract class AbstractIntStackMachine implements FixedPointConstants {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitLocalStore(IStoreInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitLocalStore(IStoreInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitLocalStore(IStoreInstruction instruction) {
|
||||
|
@ -1073,7 +1073,7 @@ public abstract class AbstractIntStackMachine implements FixedPointConstants {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitNew(NewInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitNew(NewInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitNew(NewInstruction instruction) {
|
||||
|
@ -1082,7 +1082,7 @@ public abstract class AbstractIntStackMachine implements FixedPointConstants {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitPop(PopInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitPop(PopInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitPop(PopInstruction instruction) {
|
||||
|
@ -1092,7 +1092,7 @@ public abstract class AbstractIntStackMachine implements FixedPointConstants {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitPut(IPutInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitPut(IPutInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitPut(IPutInstruction instruction) {
|
||||
|
@ -1100,7 +1100,7 @@ public abstract class AbstractIntStackMachine implements FixedPointConstants {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitShift(IShiftInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitShift(IShiftInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitShift(IShiftInstruction instruction) {
|
||||
|
@ -1108,7 +1108,7 @@ public abstract class AbstractIntStackMachine implements FixedPointConstants {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitSwap(SwapInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitSwap(SwapInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitSwap(SwapInstruction instruction) {
|
||||
|
@ -1116,7 +1116,7 @@ public abstract class AbstractIntStackMachine implements FixedPointConstants {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitSwitch(SwitchInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitSwitch(SwitchInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitSwitch(SwitchInstruction instruction) {
|
||||
|
@ -1124,7 +1124,7 @@ public abstract class AbstractIntStackMachine implements FixedPointConstants {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitThrow(ThrowInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitThrow(ThrowInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitThrow(ThrowInstruction instruction) {
|
||||
|
@ -1134,7 +1134,7 @@ public abstract class AbstractIntStackMachine implements FixedPointConstants {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitUnaryOp(IUnaryOpInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitUnaryOp(IUnaryOpInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitUnaryOp(IUnaryOpInstruction instruction) {
|
||||
|
|
|
@ -309,8 +309,8 @@ public class TypeInference extends SSAInference<TypeVariable> implements FixedPo
|
|||
TypeAbstraction lhsType = lhs.getType();
|
||||
TypeAbstraction meet = TypeAbstraction.TOP;
|
||||
for (int i = 0; i < rhs.length; i++) {
|
||||
if (rhs[i] != null && ((TypeVariable)rhs[i]).getType() != null) {
|
||||
TypeVariable r = (TypeVariable) rhs[i];
|
||||
if (rhs[i] != null && rhs[i].getType() != null) {
|
||||
TypeVariable r = rhs[i];
|
||||
meet = meet.meet(r.getType());
|
||||
}
|
||||
}
|
||||
|
@ -350,7 +350,7 @@ public class TypeInference extends SSAInference<TypeVariable> implements FixedPo
|
|||
public byte evaluate(TypeVariable lhs, TypeVariable[] rhsOperands) {
|
||||
TypeAbstraction lhsType = lhs.getType();
|
||||
|
||||
TypeVariable rhs = (TypeVariable) rhsOperands[0];
|
||||
TypeVariable rhs = rhsOperands[0];
|
||||
TypeAbstraction rhsType = rhs.getType();
|
||||
|
||||
if (lhsType.equals(rhsType)) {
|
||||
|
|
|
@ -148,6 +148,7 @@ public class ShrikeCFG extends AbstractCFG<IInstruction, ShrikeCFG.BasicBlock> {
|
|||
boolean[] r = new boolean[getInstructions().length];
|
||||
boolean[] catchers = new boolean[getInstructions().length];
|
||||
// we initially start with both the entry and exit block.
|
||||
@SuppressWarnings("unused")
|
||||
int blockCount = 2;
|
||||
|
||||
// Compute r so r[i] == true iff instruction i begins a basic block.
|
||||
|
|
|
@ -2,7 +2,6 @@ package com.ibm.wala.cfg.exc.inter;
|
|||
|
||||
import java.util.HashMap;
|
||||
import java.util.HashSet;
|
||||
import java.util.Iterator;
|
||||
import java.util.Map;
|
||||
import java.util.Map.Entry;
|
||||
import java.util.Set;
|
||||
|
|
|
@ -49,6 +49,7 @@ import com.ibm.wala.util.warnings.Warnings;
|
|||
/**
|
||||
* A class loader that reads class definitions from a set of Modules.
|
||||
*/
|
||||
@SuppressWarnings("unused")
|
||||
public class ClassLoaderImpl implements IClassLoader {
|
||||
private static final int DEBUG_LEVEL = 0;
|
||||
|
||||
|
@ -307,7 +308,6 @@ public class ClassLoaderImpl implements IClassLoader {
|
|||
}
|
||||
}
|
||||
|
||||
@SuppressWarnings("unused")
|
||||
private Map<String, Object> getAllClassAndSourceFileContents(byte[] jarFileContents, String fileName,
|
||||
Map<String, Map<String, Long>> entrySizes) {
|
||||
if (jarFileContents == null) {
|
||||
|
@ -486,7 +486,6 @@ public class ClassLoaderImpl implements IClassLoader {
|
|||
}
|
||||
}
|
||||
|
||||
@SuppressWarnings("unused")
|
||||
private Map<String, Map<String, Long>> getEntrySizes(Module module, String name) {
|
||||
Map<String, Map<String, Long>> result = HashMapFactory.make();
|
||||
Map<String, Long> curFileResult = HashMapFactory.make();
|
||||
|
|
|
@ -84,6 +84,7 @@ public class NestedJarFileModule implements Module {
|
|||
cache.put(name, bb);
|
||||
}
|
||||
}
|
||||
stream.close();
|
||||
} catch (IOException e) {
|
||||
// just go with what we have
|
||||
Warnings.add(new Warning() {
|
||||
|
|
|
@ -141,6 +141,7 @@ public abstract class AbstractAnalysisEngine implements AnalysisEngine {
|
|||
return builder;
|
||||
}
|
||||
|
||||
@SuppressWarnings("unchecked")
|
||||
public void setModuleFiles(Collection moduleFiles) {
|
||||
this.moduleFiles = moduleFiles;
|
||||
}
|
||||
|
|
|
@ -25,6 +25,7 @@ import com.ibm.wala.util.intset.IntSet;
|
|||
*
|
||||
* In this view, a return is treated like a call, and vice-versa. All normal edges are reversed.
|
||||
*/
|
||||
@SuppressWarnings("deprecation")
|
||||
public class BackwardsSupergraph<T, P> implements ISupergraph<T, P> {
|
||||
|
||||
/**
|
||||
|
@ -89,6 +90,7 @@ public class BackwardsSupergraph<T, P> implements ISupergraph<T, P> {
|
|||
*
|
||||
* @see com.ibm.wala.dataflow.IFDS.ISupergraph#getCalledNodes(java.lang.Object)
|
||||
*/
|
||||
@SuppressWarnings("unused")
|
||||
public Iterator<T> getCalledNodes(T ret) {
|
||||
if (DEBUG_LEVEL > 1) {
|
||||
System.err.println(getClass() + " getCalledNodes " + ret);
|
||||
|
|
|
@ -22,6 +22,7 @@ import com.ibm.wala.util.intset.SparseIntSet;
|
|||
/**
|
||||
* A set of call flow edges which lead to a particular procedure entry s_p.
|
||||
*/
|
||||
@SuppressWarnings("unused")
|
||||
public class CallFlowEdges {
|
||||
|
||||
/**
|
||||
|
|
|
@ -41,6 +41,7 @@ import com.ibm.wala.util.intset.IntSet;
|
|||
* @author sjfink
|
||||
*
|
||||
*/
|
||||
@SuppressWarnings("deprecation")
|
||||
public class ICFGSupergraph implements ISupergraph<BasicBlockInContext<IExplodedBasicBlock>, CGNode> {
|
||||
|
||||
private final AnalysisCache analysisCache;
|
||||
|
|
|
@ -25,6 +25,7 @@ import com.ibm.wala.util.intset.SparseIntSet;
|
|||
/**
|
||||
* A set of path edges for a particular procedure entry s_p.
|
||||
*/
|
||||
@SuppressWarnings("unused")
|
||||
public class LocalPathEdges {
|
||||
|
||||
/**
|
||||
|
|
|
@ -79,9 +79,9 @@ public class LocalSummaryEdges {
|
|||
summaries.set(n, R);
|
||||
}
|
||||
R.add(d1, d2);
|
||||
if (TabulationSolver.DEBUG_LEVEL > 1) {
|
||||
// System.err.println("recording summary edge, now n=" + n + " summarized by " + R);
|
||||
}
|
||||
// if (TabulationSolver.DEBUG_LEVEL > 1) {
|
||||
// // System.err.println("recording summary edge, now n=" + n + " summarized by " + R);
|
||||
// }
|
||||
}
|
||||
|
||||
/**
|
||||
|
|
|
@ -57,6 +57,7 @@ import com.ibm.wala.util.ref.ReferenceCleanser;
|
|||
* @param <P> type of a procedure (like a box in an RSM)
|
||||
* @param <F> type of factoids propagated when solving this problem
|
||||
*/
|
||||
@SuppressWarnings("unused")
|
||||
public class TabulationSolver<T, P, F> {
|
||||
|
||||
/**
|
||||
|
|
|
@ -872,6 +872,7 @@ public class DemandRefinementPointsTo extends AbstractDemandPointsTo {
|
|||
// }));
|
||||
}
|
||||
|
||||
@SuppressWarnings("unused")
|
||||
protected boolean addAllToP2Set(Map<PointerKeyAndState, MutableIntSet> p2setMap, PointerKeyAndState pkAndState, IntSet vals,
|
||||
IFlowLabel label) {
|
||||
final PointerKey pk = pkAndState.getPointerKey();
|
||||
|
|
|
@ -54,7 +54,6 @@ import com.ibm.wala.ipa.callgraph.propagation.InstanceKey;
|
|||
import com.ibm.wala.ipa.callgraph.propagation.PointerKey;
|
||||
import com.ibm.wala.ipa.callgraph.propagation.SSAPropagationCallGraphBuilder;
|
||||
import com.ibm.wala.ipa.cha.ClassHierarchy;
|
||||
import com.ibm.wala.ssa.DefUse;
|
||||
import com.ibm.wala.ssa.IR;
|
||||
import com.ibm.wala.ssa.ISSABasicBlock;
|
||||
import com.ibm.wala.ssa.SSAArrayLengthInstruction;
|
||||
|
@ -146,14 +145,14 @@ public class DemandValueFlowGraph extends AbstractDemandFlowGraph {
|
|||
/**
|
||||
* Def-use information
|
||||
*/
|
||||
protected final DefUse du;
|
||||
//protected final DefUse du;
|
||||
|
||||
public AllValsStatementVisitor(CGNode node) {
|
||||
this.node = node;
|
||||
this.ir = node.getIR();
|
||||
this.symbolTable = ir.getSymbolTable();
|
||||
assert symbolTable != null;
|
||||
this.du = node.getDU();
|
||||
//this.du = node.getDU();
|
||||
}
|
||||
|
||||
/*
|
||||
|
|
|
@ -100,6 +100,7 @@ public class SimpleMemoryAccessMap implements MemoryAccessMap {
|
|||
}
|
||||
}
|
||||
|
||||
@SuppressWarnings("unused")
|
||||
private void populate(CGNode n) {
|
||||
// we analyze bytecodes to avoid the cost of IR construction, except
|
||||
// for synthetic methods, where we must use the synthetic IR
|
||||
|
@ -238,6 +239,7 @@ public class SimpleMemoryAccessMap implements MemoryAccessMap {
|
|||
this.node = node;
|
||||
}
|
||||
|
||||
@SuppressWarnings("unused")
|
||||
protected int getInstructionIndex() {
|
||||
return instructionIndex;
|
||||
}
|
||||
|
|
|
@ -31,6 +31,7 @@ import com.ibm.wala.util.graph.traverse.DFS;
|
|||
* Intraprocedural SSA-based live range analysis. This is horribly inefficient.
|
||||
*
|
||||
*/
|
||||
@SuppressWarnings("deprecation")
|
||||
public class LocalLiveRangeAnalysis {
|
||||
|
||||
/**
|
||||
|
|
|
@ -61,6 +61,7 @@ import com.ibm.wala.util.strings.ImmutableByteArray;
|
|||
*
|
||||
* Each class loader will load a set of classes described by a {@link Module}.
|
||||
*/
|
||||
@SuppressWarnings("unused")
|
||||
public class AnalysisScope {
|
||||
|
||||
private final static int DEBUG_LEVEL = 0;
|
||||
|
|
|
@ -50,6 +50,7 @@ import com.ibm.wala.util.intset.SparseIntSet;
|
|||
/**
|
||||
* A call graph which explicitly holds the target for each call site in each node.
|
||||
*/
|
||||
@SuppressWarnings("deprecation")
|
||||
public class ExplicitCallGraph extends BasicCallGraph implements BytecodeConstants {
|
||||
|
||||
protected final IClassHierarchy cha;
|
||||
|
|
|
@ -35,6 +35,7 @@ import com.ibm.wala.util.intset.MutableIntSet;
|
|||
/**
|
||||
* a view of a portion of a call graph.
|
||||
*/
|
||||
@SuppressWarnings("deprecation")
|
||||
public class PartialCallGraph extends DelegatingGraph<CGNode> implements CallGraph {
|
||||
|
||||
protected final CallGraph cg;
|
||||
|
|
|
@ -29,6 +29,7 @@ import com.ibm.wala.util.functions.Function;
|
|||
* {@link AllocationSiteInNode}, which represents an allocation in a {@link CGNode} that may carry some {@link Context}. This type
|
||||
* is useful for a context-<em>insensitive</em> heap abstraction.
|
||||
*/
|
||||
@SuppressWarnings("deprecation")
|
||||
public class AllocationSite implements InstanceKey {
|
||||
private final NewSiteReference site;
|
||||
|
||||
|
|
|
@ -32,6 +32,7 @@ import com.ibm.wala.util.functions.Function;
|
|||
/**
|
||||
* An instance key which represents a unique set for each concrete type
|
||||
*/
|
||||
@SuppressWarnings("deprecation")
|
||||
public final class ConcreteTypeKey implements InstanceKey {
|
||||
private final IClass type;
|
||||
|
||||
|
|
|
@ -26,6 +26,7 @@ import com.ibm.wala.util.intset.MutableMapping;
|
|||
/**
|
||||
* An object that tracks the mapping between pointer keys and points-to set variables
|
||||
*/
|
||||
@SuppressWarnings("deprecation")
|
||||
public class PointsToMap {
|
||||
|
||||
/**
|
||||
|
|
|
@ -1377,6 +1377,7 @@ public abstract class PropagationCallGraphBuilder implements CallGraphBuilder {
|
|||
* @param klass a class
|
||||
* @return an int set which represents the subset of S that correspond to subtypes of klass
|
||||
*/
|
||||
@SuppressWarnings("unused")
|
||||
protected IntSet filterForClass(IntSet S, IClass klass) {
|
||||
MutableIntSet filter = null;
|
||||
if (klass.getReference().equals(TypeReference.JavaLangObject)) {
|
||||
|
|
|
@ -52,6 +52,7 @@ import com.ibm.wala.util.intset.IntSet;
|
|||
/**
|
||||
* A dataflow graph implementation specialized for propagation-based pointer analysis
|
||||
*/
|
||||
@SuppressWarnings("deprecation")
|
||||
public class PropagationGraph implements IFixedPointSystem<PointsToSetVariable> {
|
||||
|
||||
private final static boolean DEBUG = false;
|
||||
|
@ -194,7 +195,7 @@ public class PropagationGraph implements IFixedPointSystem<PointsToSetVariable>
|
|||
delegateGraph.addEdge(eq, lhs);
|
||||
}
|
||||
for (int i = 0; i < eq.getRHS().length; i++) {
|
||||
PointsToSetVariable v = (PointsToSetVariable) eq.getRHS()[i];
|
||||
PointsToSetVariable v = eq.getRHS()[i];
|
||||
if (v != null) {
|
||||
delegateGraph.addVariable(v);
|
||||
delegateGraph.addEdge(v, eq);
|
||||
|
|
|
@ -214,8 +214,7 @@ public class PropagationSystem extends DefaultFixedPointSolver<PointsToSetVariab
|
|||
*/
|
||||
List<InstanceKey> getInstances(IntSet set) {
|
||||
LinkedList<InstanceKey> result = new LinkedList<InstanceKey>();
|
||||
int i = 0;
|
||||
for (IntIterator it = set.intIterator(); it.hasNext(); i++) {
|
||||
for (IntIterator it = set.intIterator(); it.hasNext();) {
|
||||
int j = it.next();
|
||||
result.add(getInstanceKey(j));
|
||||
}
|
||||
|
@ -253,7 +252,7 @@ public class PropagationSystem extends DefaultFixedPointSolver<PointsToSetVariab
|
|||
* @param key
|
||||
* @return the dataflow variable that tracks the points-to set for key
|
||||
*/
|
||||
public PointsToSetVariable findOrCreatePointsToSet(PointerKey key) {
|
||||
public PointsToSetVariable findOrCreatePointsToSet(final PointerKey key) {
|
||||
|
||||
if (key == null) {
|
||||
throw new IllegalArgumentException("null key");
|
||||
|
@ -281,12 +280,6 @@ public class PropagationSystem extends DefaultFixedPointSolver<PointsToSetVariab
|
|||
pk = key;
|
||||
}
|
||||
FilteredPointerKey fpk = (FilteredPointerKey) pk;
|
||||
if (fpk == null) {
|
||||
Assertions.UNREACHABLE("fpk is null");
|
||||
}
|
||||
if (key == null) {
|
||||
Assertions.UNREACHABLE("key is null");
|
||||
}
|
||||
if (fpk.getTypeFilter() == null) {
|
||||
Assertions.UNREACHABLE("fpk.getTypeFilter() is null");
|
||||
}
|
||||
|
|
|
@ -28,6 +28,7 @@ import com.ibm.wala.util.functions.Function;
|
|||
* An instance key which represents a unique set for ALL allocation sites of a
|
||||
* given type in a CGNode
|
||||
*/
|
||||
@SuppressWarnings("deprecation")
|
||||
public class SmushedAllocationSiteInNode extends AbstractTypeInNode {
|
||||
public SmushedAllocationSiteInNode(CGNode node, IClass type) {
|
||||
super(node, type);
|
||||
|
|
|
@ -26,7 +26,6 @@ import com.ibm.wala.types.Descriptor;
|
|||
import com.ibm.wala.types.MethodReference;
|
||||
import com.ibm.wala.types.TypeName;
|
||||
import com.ibm.wala.types.TypeReference;
|
||||
import com.ibm.wala.util.debug.Assertions;
|
||||
import com.ibm.wala.util.intset.EmptyIntSet;
|
||||
import com.ibm.wala.util.intset.IntSet;
|
||||
import com.ibm.wala.util.intset.IntSetUtil;
|
||||
|
@ -118,9 +117,6 @@ public class ContainerContextSelector implements ContextSelector {
|
|||
if (isWellKnownStaticFactory(callee.getReference())) {
|
||||
return new CallerSiteContext(caller, site);
|
||||
} else {
|
||||
if (receiver == null) {
|
||||
Assertions.UNREACHABLE("null receiver for " + site);
|
||||
}
|
||||
return new ReceiverInstanceContext(receiver);
|
||||
}
|
||||
} else {
|
||||
|
|
|
@ -116,6 +116,7 @@ public class BasicRTABuilder extends AbstractRTABuilder {
|
|||
*/
|
||||
final private MutableIntSet previousReceivers = IntSetUtil.getDefaultIntSetFactory().make();
|
||||
|
||||
@SuppressWarnings("unused")
|
||||
@Override
|
||||
public byte evaluate(PointsToSetVariable lhs, PointsToSetVariable rhs) {
|
||||
IntSetVariable receivers = rhs;
|
||||
|
|
|
@ -38,6 +38,7 @@ import com.ibm.wala.util.intset.MutableIntSet;
|
|||
/**
|
||||
* Interprocedural control-flow graph, constructed lazily.
|
||||
*/
|
||||
@SuppressWarnings({"deprecation", "unused"})
|
||||
public abstract class AbstractInterproceduralCFG<T extends ISSABasicBlock> implements NumberedGraph<BasicBlockInContext<T>> {
|
||||
|
||||
private static final int DEBUG_LEVEL = 0;
|
||||
|
|
|
@ -25,6 +25,7 @@ import com.ibm.wala.util.collections.HashMapFactory;
|
|||
/**
|
||||
* Exploded interprocedural control-flow graph, constructed lazily.
|
||||
*/
|
||||
@SuppressWarnings("deprecation")
|
||||
public class ExplodedInterproceduralCFG extends AbstractInterproceduralCFG<IExplodedBasicBlock> {
|
||||
|
||||
/**
|
||||
|
|
|
@ -40,6 +40,7 @@ import com.ibm.wala.util.intset.MutableIntSet;
|
|||
*
|
||||
* For example, you can use this class to produce a CFG view that ignores certain types of exceptional edges.
|
||||
*/
|
||||
@SuppressWarnings("deprecation")
|
||||
public class PrunedCFG<I, T extends IBasicBlock<I>> extends AbstractNumberedGraph<T> implements ControlFlowGraph<I, T> {
|
||||
|
||||
/**
|
||||
|
|
|
@ -682,6 +682,7 @@ public class ClassHierarchy implements IClassHierarchy {
|
|||
this.klass = klass;
|
||||
}
|
||||
|
||||
@SuppressWarnings("unused")
|
||||
boolean isInterface() {
|
||||
return klass.isInterface();
|
||||
}
|
||||
|
@ -733,9 +734,6 @@ public class ClassHierarchy implements IClassHierarchy {
|
|||
public IClass getLeastCommonSuperclass(IClass a, IClass b) {
|
||||
assert (a.getClassLoader().getLanguage().equals(b.getClassLoader().getLanguage()));
|
||||
Language lang = a.getClassLoader().getLanguage();
|
||||
if (a == null) {
|
||||
throw new IllegalArgumentException("A is null");
|
||||
}
|
||||
TypeReference tempA = a.getReference();
|
||||
if (a.equals(b)) {
|
||||
return a;
|
||||
|
|
|
@ -65,6 +65,7 @@ import com.ibm.wala.util.intset.SparseIntSet;
|
|||
/**
|
||||
* Computation of reaching definitions for heap locations, relying on pointer analysis
|
||||
*/
|
||||
@SuppressWarnings("deprecation")
|
||||
public class HeapReachingDefs {
|
||||
|
||||
private static final boolean DEBUG = false;
|
||||
|
@ -91,6 +92,7 @@ public class HeapReachingDefs {
|
|||
* @throws IllegalArgumentException if pa is null
|
||||
* @throws IllegalArgumentException if statements is null
|
||||
*/
|
||||
@SuppressWarnings("unused")
|
||||
public Map<Statement, OrdinalSet<Statement>> computeReachingDefs(CGNode node, IR ir, PointerAnalysis pa,
|
||||
Map<CGNode, OrdinalSet<PointerKey>> mod, Collection<Statement> statements, HeapExclusions exclusions, CallGraph cg) {
|
||||
|
||||
|
|
|
@ -73,6 +73,7 @@ import com.ibm.wala.util.intset.OrdinalSet;
|
|||
/**
|
||||
* Program dependence graph for a single call graph node
|
||||
*/
|
||||
@SuppressWarnings("deprecation")
|
||||
public class PDG implements NumberedGraph<Statement> {
|
||||
|
||||
/** BEGIN Custom change: control deps */
|
||||
|
|
|
@ -26,6 +26,7 @@ import com.ibm.wala.util.intset.IntSet;
|
|||
/**
|
||||
* A wrapper around an SDG to make it look like a supergraph for tabulation.
|
||||
*/
|
||||
@SuppressWarnings("deprecation")
|
||||
class SDGSupergraph implements ISupergraph<Statement, PDG> {
|
||||
|
||||
private final ISDG sdg;
|
||||
|
|
|
@ -246,6 +246,7 @@ public class BypassSyntheticClass extends SyntheticClass {
|
|||
return null;
|
||||
}
|
||||
|
||||
@Override
|
||||
public Collection<Annotation> getAnnotations() {
|
||||
return Collections.emptySet();
|
||||
}
|
||||
|
|
|
@ -381,7 +381,7 @@ public class SSABuilder extends AbstractIntStackMachine {
|
|||
class NodeVisitor extends BasicStackMachineVisitor {
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitArrayLength(ArrayLengthInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitArrayLength(ArrayLengthInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitArrayLength(com.ibm.wala.shrikeBT.ArrayLengthInstruction instruction) {
|
||||
|
@ -394,7 +394,7 @@ public class SSABuilder extends AbstractIntStackMachine {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitArrayLoad(IArrayLoadInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitArrayLoad(IArrayLoadInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitArrayLoad(IArrayLoadInstruction instruction) {
|
||||
|
@ -411,7 +411,7 @@ public class SSABuilder extends AbstractIntStackMachine {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitArrayStore(IArrayStoreInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitArrayStore(IArrayStoreInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitArrayStore(IArrayStoreInstruction instruction) {
|
||||
|
@ -424,7 +424,7 @@ public class SSABuilder extends AbstractIntStackMachine {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitBinaryOp(IBinaryOpInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitBinaryOp(IBinaryOpInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitBinaryOp(IBinaryOpInstruction instruction) {
|
||||
|
@ -438,7 +438,7 @@ public class SSABuilder extends AbstractIntStackMachine {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitCheckCast(ITypeTestInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitCheckCast(ITypeTestInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitCheckCast(ITypeTestInstruction instruction) {
|
||||
|
@ -456,7 +456,7 @@ public class SSABuilder extends AbstractIntStackMachine {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitComparison(IComparisonInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitComparison(IComparisonInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitComparison(IComparisonInstruction instruction) {
|
||||
|
@ -469,7 +469,7 @@ public class SSABuilder extends AbstractIntStackMachine {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitConditionalBranch(IConditionalBranchInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitConditionalBranch(IConditionalBranchInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitConditionalBranch(IConditionalBranchInstruction instruction) {
|
||||
|
@ -481,7 +481,7 @@ public class SSABuilder extends AbstractIntStackMachine {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitConstant(ConstantInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitConstant(ConstantInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitConstant(com.ibm.wala.shrikeBT.ConstantInstruction instruction) {
|
||||
|
@ -516,7 +516,7 @@ public class SSABuilder extends AbstractIntStackMachine {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitConversion(IConversionInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitConversion(IConversionInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitConversion(IConversionInstruction instruction) {
|
||||
|
@ -532,7 +532,7 @@ public class SSABuilder extends AbstractIntStackMachine {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitGet(IGetInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitGet(IGetInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitGet(IGetInstruction instruction) {
|
||||
|
@ -552,7 +552,7 @@ public class SSABuilder extends AbstractIntStackMachine {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitGoto(GotoInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitGoto(GotoInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitGoto(com.ibm.wala.shrikeBT.GotoInstruction instruction) {
|
||||
|
@ -560,7 +560,7 @@ public class SSABuilder extends AbstractIntStackMachine {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitInstanceof(IInstanceofInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitInstanceof(IInstanceofInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitInstanceof(IInstanceofInstruction instruction) {
|
||||
|
@ -573,7 +573,7 @@ public class SSABuilder extends AbstractIntStackMachine {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitInvoke(IInvokeInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitInvoke(IInvokeInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitInvoke(IInvokeInstruction instruction) {
|
||||
|
@ -619,7 +619,7 @@ public class SSABuilder extends AbstractIntStackMachine {
|
|||
}
|
||||
|
||||
/*
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitLocalStore(com.ibm.wala.shrikeBT.StoreInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitLocalStore(com.ibm.wala.shrikeBT.StoreInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitLocalStore(IStoreInstruction instruction) {
|
||||
|
@ -630,7 +630,7 @@ public class SSABuilder extends AbstractIntStackMachine {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitMonitor(MonitorInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitMonitor(MonitorInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitMonitor(com.ibm.wala.shrikeBT.MonitorInstruction instruction) {
|
||||
|
@ -640,7 +640,7 @@ public class SSABuilder extends AbstractIntStackMachine {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitNew(NewInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitNew(NewInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitNew(com.ibm.wala.shrikeBT.NewInstruction instruction) {
|
||||
|
@ -661,7 +661,7 @@ public class SSABuilder extends AbstractIntStackMachine {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitGet(IGetInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitGet(IGetInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitPut(IPutInstruction instruction) {
|
||||
|
@ -679,7 +679,7 @@ public class SSABuilder extends AbstractIntStackMachine {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitReturn(ReturnInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitReturn(ReturnInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitReturn(com.ibm.wala.shrikeBT.ReturnInstruction instruction) {
|
||||
|
@ -693,7 +693,7 @@ public class SSABuilder extends AbstractIntStackMachine {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitShift(IShiftInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitShift(IShiftInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitShift(IShiftInstruction instruction) {
|
||||
|
@ -706,7 +706,7 @@ public class SSABuilder extends AbstractIntStackMachine {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitSwitch(SwitchInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitSwitch(SwitchInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitSwitch(com.ibm.wala.shrikeBT.SwitchInstruction instruction) {
|
||||
|
@ -747,7 +747,7 @@ public class SSABuilder extends AbstractIntStackMachine {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitThrow(ThrowInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitThrow(ThrowInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitThrow(com.ibm.wala.shrikeBT.ThrowInstruction instruction) {
|
||||
|
@ -763,7 +763,7 @@ public class SSABuilder extends AbstractIntStackMachine {
|
|||
}
|
||||
|
||||
/**
|
||||
* @see com.ibm.wala.shrikeBT.Instruction.Visitor#visitUnaryOp(IUnaryOpInstruction)
|
||||
* @see com.ibm.wala.shrikeBT.IInstruction.Visitor#visitUnaryOp(IUnaryOpInstruction)
|
||||
*/
|
||||
@Override
|
||||
public void visitUnaryOp(IUnaryOpInstruction instruction) {
|
||||
|
|
|
@ -83,6 +83,7 @@ public class FileProvider {
|
|||
/**
|
||||
* @throws FileNotFoundException
|
||||
*/
|
||||
@SuppressWarnings("unused")
|
||||
public File getFileFromClassLoader(String fileName, ClassLoader loader) throws FileNotFoundException {
|
||||
if (loader == null) {
|
||||
throw new IllegalArgumentException("null loader");
|
||||
|
@ -133,6 +134,7 @@ public class FileProvider {
|
|||
* if not found: wrapped as a JarFileModule or a NestedJarFileModule
|
||||
* @throws IOException
|
||||
*/
|
||||
@SuppressWarnings("unused")
|
||||
public Module getJarFileFromClassLoader(String fileName, ClassLoader loader) throws IOException {
|
||||
if (fileName == null) {
|
||||
throw new IllegalArgumentException("null fileName");
|
||||
|
|
|
@ -54,6 +54,7 @@ public abstract class UTF8Convert {
|
|||
* @returns unicode string
|
||||
* @throws IllegalArgumentException if utf8 is null
|
||||
*/
|
||||
@SuppressWarnings("unused")
|
||||
public static String fromUTF8(byte[] utf8) throws UTFDataFormatException {
|
||||
if (utf8 == null) {
|
||||
throw new IllegalArgumentException("utf8 is null");
|
||||
|
|
|
@ -22,6 +22,7 @@ public class ChaPanel extends JSplitPane {
|
|||
|
||||
private final IClassHierarchy cha;
|
||||
|
||||
@SuppressWarnings("unchecked")
|
||||
public ChaPanel(IClassHierarchy cha) {
|
||||
this.cha = cha;
|
||||
|
||||
|
|
|
@ -38,6 +38,7 @@ public class IrViewer extends JPanel{
|
|||
}
|
||||
Set<SelectedPcListner> selectedPcListners = new HashSet<SelectedPcListner>();
|
||||
|
||||
@SuppressWarnings("unchecked")
|
||||
public IrViewer() {
|
||||
super(new BorderLayout());
|
||||
irLines = new JList(irLineList);
|
||||
|
@ -61,6 +62,7 @@ public class IrViewer extends JPanel{
|
|||
});
|
||||
}
|
||||
|
||||
@SuppressWarnings("unchecked")
|
||||
public void setIR(IR ir) {
|
||||
this.lineToPosition = HashMapFactory.make();
|
||||
this.pcToLine = HashMapFactory.make();
|
||||
|
|
|
@ -18,6 +18,7 @@ public class SourceViewer extends JPanel{
|
|||
private DefaultListModel sourceCodeLinesList = new DefaultListModel();
|
||||
private JList sourceCodeLines;
|
||||
|
||||
@SuppressWarnings("unchecked")
|
||||
public SourceViewer() {
|
||||
super(new BorderLayout());
|
||||
sourceURL = null;
|
||||
|
@ -45,6 +46,7 @@ public class SourceViewer extends JPanel{
|
|||
}
|
||||
}
|
||||
|
||||
@SuppressWarnings("unchecked")
|
||||
private boolean loadSource(URL url) {
|
||||
if (url == null) {
|
||||
if (sourceURL != null) {
|
||||
|
|
Loading…
Reference in New Issue