|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object scale.common.Root scale.score.Note scale.score.expr.Expr scale.score.expr.BinaryExpr scale.score.expr.DivisionExpr
public class DivisionExpr
This class represents the division operation.
$Id: DivisionExpr.java,v 1.44 2007-10-04 19:58:29 burrill Exp $
Copyright 2008 by the
Scale Compiler Group,
Department of Computer Science
University of Massachusetts,
Amherst MA. 01003, USA
All Rights Reserved.
Field Summary |
---|
Fields inherited from class scale.score.expr.Expr |
---|
fpReorder, SE_DOMAIN, SE_NONE, SE_OVERFLOW, SE_STATE |
Constructor Summary | |
---|---|
DivisionExpr(Type t,
Expr e1,
Expr e2)
|
Method Summary | |
---|---|
Expr |
copy()
Perform a deep copy of the expression tree. |
static Expr |
create(Type type,
Expr la,
Expr ra)
This method of creating a DivisionExpr instance will return a reduced expression if possible. |
int |
executionCostEstimate()
Return a relative cost estimate for executing the expression. |
protected AffineExpr |
getAffineRepresentation(HashMap<Expr,AffineExpr> affines,
LoopHeaderChord thisLoop)
Return the affine
representation for this expression. |
Literal |
getConstantValue()
Return the constant value of the expression. |
Literal |
getConstantValue(HashMap<Expr,Literal> cvMap)
Return the constant value of the expression. |
java.lang.String |
getDisplayLabel()
Return a String suitable for labeling this node in a graphical display. |
boolean |
isLeftDistributive()
Return true if the binary operation α is left distributive over β: (a β b) α c ≡ (a α c) β (b α c). |
boolean |
isSimpleExpr()
Return true if this is a simple expression. |
boolean |
mayGenerateCall()
Return true if this expression may result in the generation of a call to a subroutine. |
Expr |
reduce()
Return a simplied equivalent expression. |
int |
sideEffects()
Return an indication of the side effects execution of this expression may cause. |
void |
visit(Predicate p)
Process a node by calling its associated routine. |
Methods inherited from class scale.score.expr.BinaryExpr |
---|
associativeSwapOperands, containsDeclaration, dependsOnDeclaration, equivalent, getAliasAnnote, getDeclList, getExprList, getLeftArg, getLoadExprList, getOperand, getOperandArray, getRightArg, isAssociative, isCommutative, isRightDistributive, loopClean, numOperands, optimizationCandidate, pushOperands, recordRefs, removeRefs, removeUseDef, replaceDecl, setLeftArg, setOperand, setRightArg, swapOperands, unlinkExpression, validate |
Methods inherited from class scale.score.Note |
---|
getChord, getEssentialUse, setAnnotationLevel, setReportLevel, toString |
Methods inherited from class scale.common.Root |
---|
addAnnotation, allAnnotations, allMatchingAnnotations, getAnnotation, getDisplayName, getDisplayString, getNodeCount, getNodeID, hasAnnotation, hasEqualAnnotation, hashCode, removeAnnotation, removeAnnotations, toStringAnnotations, toStringClass, trace, trace, trace |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, notify, notifyAll, wait, wait, wait |
Constructor Detail |
---|
public DivisionExpr(Type t, Expr e1, Expr e2)
Method Detail |
---|
public static Expr create(Type type, Expr la, Expr ra)
public Expr copy()
Expr
copy
in class Expr
public int sideEffects()
sideEffects
in class BinaryExpr
Expr.SE_NONE
public void visit(Predicate p)
Note
Each class has a visit(Predicate p)
method. For
example, in class ABC
:
public void visit(Predicate p) { p.visitABC(this); }and the class that implements
Predicate
has a method
public void visitABC(Note n) { ABC a = (ABC) n; ... }Thus, the class that implements
Predicate
can call
n.visit(this);where
n
is a Note
sub-class without
determining which specific sub-class n
is.
The visit pattern basically avoids implementing a large
switch
statement or defining different methods
in each class for some purpose.
visit
in class Note
Predicate
public java.lang.String getDisplayLabel()
Expr
getDisplayLabel
in interface DisplayNode
getDisplayLabel
in class Expr
protected AffineExpr getAffineRepresentation(HashMap<Expr,AffineExpr> affines, LoopHeaderChord thisLoop)
Expr
affine
representation
for this expression. This method should be
called only from the getAffineExpr()
method. This method never returns null
.
getAffineRepresentation
in class Expr
affines
- is a mapping from an expression to its representation
and is used to avoid combinatorial explosion through use-def
linksthisLoop
- the loop for which this expression may be affineAffineExpr
,
AffineExpr.notAffine
public Literal getConstantValue(HashMap<Expr,Literal> cvMap)
getConstantValue
in class Expr
Lattice
public Literal getConstantValue()
getConstantValue
in class Expr
Lattice
public boolean isLeftDistributive()
BinaryExpr
isLeftDistributive
in class BinaryExpr
public int executionCostEstimate()
executionCostEstimate
in class BinaryExpr
public boolean isSimpleExpr()
isSimpleExpr
in class Expr
public boolean mayGenerateCall()
mayGenerateCall
in class Expr
public Expr reduce()
reduce
in class Expr
SubscriptExpr.lower()
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |