|
|||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||
AbstractAnalyser instance.
AbstractClassProcessor instance.
Iterator interface.AbstractSSDependingAbstraction instance.
AbstractSSDependingAbstraction instance.
AbstractTreeIterator here.TreeIteratorTraversal.Actions interface.add method here.
addElement(Object).
CFPLattice for this
abstraction and returns the result.
CFPComponentLattice.NONNULLCOMPONENT.
CFPAbstraction.ArithmeticFunction.evaluate(Number[]) if the
operands are all numbers, and pushes the result.
CFPComponentLattice.UNKNOWNCOMPONENT as necessary to fulfill correct stack
behavior.
CFPComponentLattice.UNKNOWNCOMPONENT as necessary to fulfill
correct stack behavior.
CFPComponentLattice.UNKNOWNCOMPONENT as necessary, and pushed a CFPComponentLattice.NONNULLCOMPONENT.
ArrayIterator instance.
ArrayIterator instance.
atNext or
atRight for this node.
left on the
TreeIterator.
next on the
TreeIterator.
previous on the
TreeIterator.
right on the
TreeIterator.
atNext for this
node.
toString method.
BasicBlockGraph instance from a (factorised) flow
graph.
BasicBlockGraphSolver instance with out
stop watch.
BasicBlockGraphSolver instance with stop
watch.
node.
node.
BitVectorLatticeBitVectorElement instance where all bits a set to
zero.
BitVectorLattice instance.
CompletePOSet.
CompleteLattice.
bottom gets the least element of this
CompletePOSet, which is the
unique new bottom element of this lifted partially ordered set.
bottom gets the least element of this
TupleCompletePOSet which is the tuple of the least elements of the
component sets.
ArithmeticFunction instance.
BinaryFunction instance.
CompareFunction instance.
ConversionFunction instance.
NegationFunction instance.
CFPAbstraction instance.
CFPAbstraction instance.
CFPAnalyser instance.
CFPComponentLattice instance.
CFPLattice instance.
CFPLocalsLattice instance.
CFPStackLattice instance.
ComposedFunction instance.
createGraph().
maxSize stack size
and baseSize elements for each entry in the stack.
ConstantFunction instance.
iterators
CFPComponentLattice.NONNULLCOMPONENT onto the stack.AllocationFunction instance.
CPFunction instance.
DupFunction instance.
CFPComponentLattice.NONNULLCOMPONENT.ExceptionHeaderFunction instance.
GenericFunction instance.
IncLocalFunction instance.
PopFunction instance.
PushConstantFunction instance.
PushLocalFunction instance.
StoreLocalFunction instance.
SwapFunction instance.
CFPAbstraction instance.
CFPAbstraction instance.
CPAnalyser instance.
current method here.
currentIndex method here.
DataFlowSolver instance with default upper bound and
work list StackWorklist.
DataFlowSolver instance.
DataFlowSolver, which
contains an implementation of the classical iterative algorithm for
intra-procedural data-flow analysis.TreeIterator.DFLRTreeIteratorTraversal instance.
DIRECTION_BACKWARD may be used as result of
getDirection() to indicate backward control flow.
DIRECTION_FORWARD may be used as result of
getDirection() to indicate forward control flow.
DualPOSet instance from an existing partially ordered
set.
Position has no entries.
equals checks if a function and an object are equal.
true either if both e1 and e2 are
the unique least element of this set of they are equal in the underlying set.
Numbers objects are equal in this set, if the first is not
null and is equal to the second.
true either if both e1 and e2 are
the unique top element of this set of they are equal in the underlying set.
ExceptionHeaderInstruction instance.
ExceptionHeaderInstruction.ExceptionHeaderInstructionHandle instance.
ExecutionSolver instance with out stop watch.
ExecutionSolver instance with stop watch.
externalView method is supposed to convert internal to external
representation.
externalView method here.
FactorisedBasicBlockGraphSolver instance with out
stop watch.
FactorisedBasicBlockGraphSolver instance with stop
watch.
FlowGraph sub class.
FactorisedFlowGraph instance.
FactorisedFlowGraph instance.
FactorisedFlowGraphSolver instance with out stop
watch.
FactorisedFlowGraphSolver instance with stop watch.
FlatCompleteLattice instance from a set.
FlatCompleteLattice instance from a set and explicit
top and bottom elements.
FlatCompleteLattice instance from a set and names for
newly created unique top and bottom elements.
FlowGraph instance.
FlowGraph instance.
FlowGraphSolver instance with out stop
watch.
FlowGraphSolver instance with stop watch.
domains.iterator().
Abstraction.getAbstract(InstructionHandleVector).
SSFunction.
KillGenBitVectorFunction for an instruction.
Abstraction.Default.
Abstraction.Default.
KillGenBitVectorFunction for a vector of
instructions.
CPAbstraction for a method.
CFPAbstraction for a method.
LVAbstraction for a method.
SSAbstraction for a method.
DIRECTION_FORWARD.
DIRECTION_FORWARD.
DIRECTION_BACKWARD.
CFPLattice for this abstraction.
Node of this edge.
Abstraction.getInitialValue(InstructionHandleVector,boolean).
Abstraction.Default.
Abstraction.Default.
Abstraction.Default.
solve().
CFPLattice for this abstraction.
QUANTIFIER_ALL.
QUANTIFIER_ALL
QUANTIFIER_EXISTS.
CFPLattice for this abstraction.
compute() and does memory and
timing statistics.
BasicBlockGraphSolver, ExecutionSolver, FlowGraphSolver, and FactorisedFlowGraphSolver, FactorisedBasicBlockGraphSolver.
FlowGraphSolver, BasicBlockGraphSolver, and FactorisedFlowGraphSolver, FactorisedBasicBlockGraphSolver.
ExecutionSolver, FlowGraphSolver,
BasicBlockGraphSolver.
Node of this edge.
GraphSolver instance with out stop watch.
GraphSolver instance with stop watch.
true iff there is a current element available.
hasCurrent method here.
String is a valid field name in this table.
hasLeft method here.
true as long as there are Objects in this iterator.
hasNext method from the Iterator
interface.
hasNext method here.
hasPrevious method here.
hasRight method here.
IdentityFunction instance.
objs, this array contains the Method
used to create an iterator.
InstructionHandle
objects.p.
true if e is the unique least element of this
set or if e is element of the underlying set.
Object is contained in this set.
Number objects are element of this set.
isElement returns true if
e is the unique least element of this set or if
e is element of the underlying set.
Set.isElement(Object e)Iterator of the elements of this set.
Iterator of the elements of this set, staring with the
unique least element.
Iterator of the elements of this set.
Iterator of the elements of this set.
IllegalArgumentException.
iterator returns an
Iterator of the elements of this set, staring
with the unique least element.
IteratorMap instance.
objs, this array contains the current state of
the component iterator.
IteratorSequence instance from an array of base
iterators..
IteratorSequence instance from two base iterators.
Iterator of the elements of the skeleton subset this
set.
Iterator of the elements of this set, staring with the
unique least element.
Iterator of the elements of the skeleton subset of this
set.
Iterator of the elements of the skeleton subset of this
set.
iterator returns an
Iterator of the elements of this set, staring
with the unique least element.
iterator().
le(e1,e2) holds then this is e2 and vice
versa.
KillGenBitVectorFunction instance from explicit
enumeration of kills and gens.
KillGenBitVectorFunction instance as composition of
two KillGenBitVectorFunction.
true either if e1 is the unique least element
of this set or if e1 is less or equal than e2 in the
underlying set.
le checks if a function is less or equal
than another function of this set.
true if both elements are stacks of the same height and
corresponding entries are in the le() relation of the underlying
partially ordered set.
le checks if one element is less than
an other element.
le is identical to equals.
true either if e1 is the unique top element of
this set or if e1 is less or equal than e2 in the
underlying set.
left method here.
leftIndex method here.
true either if e1 is the unique least element
of this set and e2 is not or if e1 is less than
e2 in the underlying set.
lt checks if a function is less than
another function of this set.
true if both elements are stacks of the same height,
corresponding entries are in the le() relation of the underlying
partially ordered set, and at least one pair of corresponding entries are in the
lt() relation.
lt checks if one element is less than
an other element.
lt always returns false.
true either if e1 is the unique top element of
this set and e2 is not or if e1 is less than
e2 in the underlying set.
LVAbstraction instance.
LVAbstraction instance.
LVAnalyser instance.
le(e1,e2) holds then this is e1 and vice
versa.
Node with the given node, i.e.
a,
but not in the array b.
get().
next method from the Iterator
interface.
next method here.
nextIndex method here.
null references of all these lattices.
Number objects.null if this element has already been
retrieved.
Entry instance.
position in this tree.
position method here.
Position instance.
previous method here.
previousIndex method here.
System.out.
System.out.
PrintStream.
System.out and prints
a newline character afterwards.
PrintStream and
prints a newline character afterwards.
count to the next base iterator which still has elements
pending.
AbstractAnalyser.process(Method,String).
AbstractAnalyser.process(Method,String).
produceLeft method here.
produceNext method is supposed to produce the internal
representation of the next element of the Iterator.
produceNext method here.
produceRight method here.
QUANTIFIER_ALL may be used as result of
getQuantifier() to indicate universal quantification.
QUANTIFIER_EXISTS may be used as result of
getQuantifier() to indicate existential quantification.
node in the graph of this data flow solver.
next method from the Iterator interface
by always throwing an UnsupportedOperationException.
remove method here.
Edge from the graph.
Edge from the graph.
right method here.
rightIndex method here.
RootedGraph.Node without a label.
Node with a label.
RootedGraph without a label.
RootedGraph with a label.
set method here.
Node of this edge.
Sets of this set.
Node of this edge.
int as element.
ints.
Objects.
Iterator with a single, non-null entry.SingletonIterator instance.
size returns the size of the set.
size returns the size of the set.
size().
Solver instance without stop watch.
Solver instance with stop watch.
SSFunction instance.
SSAbstraction instance.
SSAbstraction instance.
SSAnalyser instance.
SSAbstraction.SSLattice instance.
StackPOSet instance with unlimited stack size and
skeleton stack size SKELMAXSIZE.
StackPOSet instance with maximal stack size.
StackPreLattice instance with unlimited stack size
and skeleton stack size StackSet.SKELMAXSIZE.
StackPOSet instance with maximal stack size.
StackSet instance with unlimited stack size and
skeleton stack size SKELMAXSIZE.
StackSet instance with maximal stack size.
StackWorklist instance.
true iff the stop watch was started more often than
stopped.
SumPOSet instance from an array of components.
SumPOSet instance from two components.
SumSet instance from an array of component sets.
SumSet instance from two component sets.
RootedGraph into a
RootedGraph where the nodes becomes edges and vice versa.SwappedGraph by transforming the given
graph.
Table instance with default values for record
separator (\n), column separator (,), and quote
character (").
CompleteLattice.
String representation of this table.
toString creates a String
representation.
String representation of a function.
TreeIterator.
TreeIterator interface provides a means for traversing a
tree.TreeIteratorTraversal describes generic traversals of
TreeIterator objects.Actions describes how a
TreeTraversal should act during the traversal.int
as element.
ints.
Objects.
TupleCompletePOSet from an array of
CompletePOSets.
TupleCompletePOSet from two CompletePOSets.
TupleSet.TupleElement instance from an array of components.
TupleElement instance from two components.
TuplePOSet from an array of POSets.
TuplePOSet from two POSets.
TupleSet from an array of Sets.
TupleSet from two Sets.
a or the array b.
DataFlowSolver.
|
|||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||