Package harpoon.Analysis.Tree

This package contains analysis routines applicable only to the IR.Tree intermediate representation.

See:
Description

Class Summary

AlgebraicSimplification	AlgebraicSimplification performs algebraic simplification on canonical trees.
AlignmentAnalysis	AlignmentAnalysis computes the alignment (some offset modulo some number from some base) of every typed pointer in a Tree.
AlignmentAnalysis.BaseAndOffset
AlignmentAnalysis.Constant
AlignmentAnalysis.ConstantModuloN
AlignmentAnalysis.IntegerValue
AlignmentAnalysis.KGroup	a k-group is a "phi-function" definition point.
AlignmentAnalysis.Value
CacheEquivalence	CacheEquivalence creates tag-check equivalence classes for MEM operations in a Tree.
Canonicalize	Canonicalize is an application of Simplification to do pattern-driven tree canonicalization.
ConstantPropagation	ConstantPropagation performs constant propagation on canonical tree form.
DeadCodeElimination	DeadCodeElimination removes unused MOVEs, useless EXPRs, and whatever other cruft it can detect using a liveness analysis.
DerivationChecker	A DerivationChecker checks that all subtrees in a Tree.Code have proper derivations.
DominatingMemoryAccess	DominatingMemoryAccess is an analysis that uses information about memory operations to determine which of them need to do cache tag checks, and which don't.
JumpOptimization	JumpOptimization removes branches-to-branches and redundant labels.
MemHoisting	MemHoisting ensures that the ordering of MEM operations is well-defined in the tree, by creating a temporary for and hoisting all but one MEM in any given subexpression.
Simplification	Simplification is a general-purpose simplification engine for trees.
Simplification.Rule	A simplification rule for use with the tree simplifier.
TreeFolding	The TreeFolding class performs tree folding on a tree code in canonical form.

Package harpoon.Analysis.Tree Description

This package contains analysis routines applicable only to the IR.Tree intermediate representation.

Author:

various