-
Notifications
You must be signed in to change notification settings - Fork 35
Expand file tree
/
Copy pathConstantPropagation.java
More file actions
151 lines (129 loc) · 6.68 KB
/
ConstantPropagation.java
File metadata and controls
151 lines (129 loc) · 6.68 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
package liquidjava.rj_language.opt;
import liquidjava.rj_language.ast.BinaryExpression;
import liquidjava.rj_language.ast.Expression;
import liquidjava.rj_language.ast.UnaryExpression;
import liquidjava.rj_language.ast.Var;
import liquidjava.rj_language.opt.derivation_node.BinaryDerivationNode;
import liquidjava.rj_language.opt.derivation_node.DerivationNode;
import liquidjava.rj_language.opt.derivation_node.UnaryDerivationNode;
import liquidjava.rj_language.opt.derivation_node.ValDerivationNode;
import liquidjava.rj_language.opt.derivation_node.VarDerivationNode;
import liquidjava.utils.Utils;
import java.util.HashMap;
import java.util.Map;
public class ConstantPropagation {
/**
* Performs constant propagation on an expression, by substituting variables with their constant values. Uses the
* VariableResolver to extract variable equalities from the expression first. Returns a derivation node representing
* the propagation steps taken.
*/
public static ValDerivationNode propagate(Expression exp, ValDerivationNode previousOrigin) {
Map<String, Expression> substitutions = VariableResolver.resolve(exp);
// map of variable origins from the previous derivation tree
Map<String, DerivationNode> varOrigins = new HashMap<>();
if (previousOrigin != null) {
extractVarOrigins(previousOrigin, varOrigins);
}
return propagateRecursive(exp, substitutions, varOrigins);
}
/**
* Recursively performs constant propagation on an expression (e.g. x + y && x == 1 && y == 2 => 1 + 2)
*/
private static ValDerivationNode propagateRecursive(Expression exp, Map<String, Expression> subs,
Map<String, DerivationNode> varOrigins) {
// substitute variable
if (exp instanceof Var var) {
String name = var.getName();
Expression value = subs.get(name);
// substitution
if (value != null) {
// check if this variable has an origin from a previous pass
DerivationNode previousOrigin = varOrigins.get(name);
// preserve origin if value came from previous derivation
DerivationNode origin = flattenVarOrigin(name, previousOrigin);
return new ValDerivationNode(value.clone(), origin);
}
// no substitution
return new ValDerivationNode(var, null);
}
// lift unary origin
if (exp instanceof UnaryExpression unary) {
ValDerivationNode operand = propagateRecursive(unary.getChildren().get(0), subs, varOrigins);
UnaryExpression cloned = (UnaryExpression) unary.clone();
cloned.setChild(0, operand.getValue());
return operand.getOrigin() != null
? new ValDerivationNode(cloned, new UnaryDerivationNode(operand, cloned.getOp()))
: new ValDerivationNode(cloned, null);
}
// lift binary origin
if (exp instanceof BinaryExpression binary) {
ValDerivationNode left = propagateRecursive(binary.getFirstOperand(), subs, varOrigins);
ValDerivationNode right = propagateRecursive(binary.getSecondOperand(), subs, varOrigins);
BinaryExpression cloned = (BinaryExpression) binary.clone();
cloned.setChild(0, left.getValue());
cloned.setChild(1, right.getValue());
return (left.getOrigin() != null || right.getOrigin() != null)
? new ValDerivationNode(cloned, new BinaryDerivationNode(left, right, cloned.getOperator()))
: new ValDerivationNode(cloned, null);
}
// recursively propagate children
if (exp.hasChildren()) {
Expression propagated = exp.clone();
for (int i = 0; i < exp.getChildren().size(); i++) {
ValDerivationNode child = propagateRecursive(exp.getChildren().get(i), subs, varOrigins);
propagated.setChild(i, child.getValue());
}
return new ValDerivationNode(propagated, null);
}
// no propagation
return new ValDerivationNode(exp, null);
}
/**
* Extracts the derivation nodes for variable values from the derivation tree This is so done so when we find "var
* == value" in the tree, we store the derivation of the value So it can be preserved when var is substituted in
* subsequent passes
*/
private static void extractVarOrigins(ValDerivationNode node, Map<String, DerivationNode> varOrigins) {
if (node == null)
return;
Expression value = node.getValue();
DerivationNode origin = node.getOrigin();
// check for equality expressions
if (value instanceof BinaryExpression binExp && "==".equals(binExp.getOperator())
&& origin instanceof BinaryDerivationNode binOrigin) {
Expression left = binExp.getFirstOperand();
Expression right = binExp.getSecondOperand();
// extract variable name and value derivation from either side
String varName = null;
ValDerivationNode valueDerivation = null;
if (left instanceof Var var && right.isLiteral()) {
varName = var.getName();
valueDerivation = binOrigin.getRight();
} else if (right instanceof Var var && left.isLiteral()) {
varName = var.getName();
valueDerivation = binOrigin.getLeft();
}
if (varName != null && valueDerivation != null && valueDerivation.getOrigin() != null) {
varOrigins.put(varName, valueDerivation.getOrigin());
}
}
// recursively process the origin tree
if (origin instanceof BinaryDerivationNode binOrigin) {
extractVarOrigins(binOrigin.getLeft(), varOrigins);
extractVarOrigins(binOrigin.getRight(), varOrigins);
} else if (origin instanceof UnaryDerivationNode unaryOrigin) {
extractVarOrigins(unaryOrigin.getOperand(), varOrigins);
} else if (origin instanceof ValDerivationNode valOrigin) {
extractVarOrigins(valOrigin, varOrigins);
}
}
/**
* Flattens same instance variable derivations to avoid redundancy by collapsing var -> var chains
*/
private static VarDerivationNode flattenVarOrigin(String varName, DerivationNode origin) {
if (origin instanceof VarDerivationNode varOrigin && Utils.isSameVariable(varOrigin.getVar(), varName)) {
return flattenVarOrigin(varOrigin.getVar(), varOrigin.getOrigin()); // recursively flatten
}
return origin != null ? new VarDerivationNode(varName, origin) : new VarDerivationNode(varName);
}
}