| Package | Description |
|---|---|
| com.ibm.wala.demandpa.util | |
| com.ibm.wala.ipa.slicer | |
| com.ibm.wala.ipa.slicer.thin |
| Constructor and Description |
|---|
PABasedMemoryAccessMap(CallGraph cg,
PointerAnalysis<InstanceKey> pa,
SDG sdg) |
| Modifier and Type | Method and Description |
|---|---|
static Collection<Statement> |
Slicer.computeBackwardSlice(SDG sdg,
Collection<Statement> ss)
Use the passed-in SDG
|
static Collection<Statement> |
Slicer.computeBackwardSlice(SDG sdg,
Statement s)
Use the passed-in SDG
|
static Collection<Statement> |
Slicer.computeForwardSlice(SDG sdg,
Statement s)
Use the passed-in SDG
|
protected static Collection<Statement> |
Slicer.computeSlice(SDG sdg,
Collection<Statement> ss,
boolean backward) |
Collection<Statement> |
Slicer.slice(SDG sdg,
Collection<Statement> roots,
boolean backward)
Main driver logic.
|
| Modifier and Type | Method and Description |
|---|---|
static Map<Statement,Set<PointerKey>> |
CISlicer.scanForMod(SDG sdg,
PointerAnalysis<InstanceKey> pa)
Compute the set of pointer keys each statement mods
|
static Map<Statement,Set<PointerKey>> |
CISlicer.scanForMod(SDG sdg,
PointerAnalysis<InstanceKey> pa,
boolean ignoreAllocHeapDefs,
ModRef modRef)
Compute the set of pointer keys each statement mods.
|
static Map<Statement,Set<PointerKey>> |
CISlicer.scanForMod(SDG sdg,
PointerAnalysis<InstanceKey> pa,
ModRef modRef)
Compute the set of pointer keys each statement mods
|
static Map<Statement,Set<PointerKey>> |
CISlicer.scanForRef(SDG sdg,
PointerAnalysis<InstanceKey> pa)
Compute the set of pointer keys each statement refs
|
static Map<Statement,Set<PointerKey>> |
CISlicer.scanForRef(SDG sdg,
PointerAnalysis<InstanceKey> pa,
ModRef modRef)
Compute the set of PointerKeys each statement refs.Be careful to avoid eager PDG construction here! That means ..
|
| Constructor and Description |
|---|
CISDG(SDG noHeap,
Map<Statement,Set<PointerKey>> mod,
Map<Statement,Set<PointerKey>> ref) |
CISlicer(SDG sdg,
PointerAnalysis<InstanceKey> pa,
ModRef modRef) |
Copyright © 2015. All rights reserved.