use of org.candle.decompiler.intermediate.expression.ConstantArray in project candle-decompiler by bradsdavis.
the class ConstantArrayCompressor method visitStatementIntermediate.
@Override
public void visitStatementIntermediate(StatementIntermediate line) {
//first, look for the
Assignment assignment = extractConstantArrayAssignment(line.getExpression());
if (assignment == null) {
return;
}
//at this point, we know both the statement is an assignment, and that the left assignment is to a constant array value.
//find the one that is right before the array assignment.
Declaration declaration = extractNextDeclaration(line);
//if we didn't find the declaration, this must not be the constant array assignment proceeding the declaration.
if (declaration == null) {
return;
}
//check the right hand of the declaration...
if (!(declaration.getAssignment().getRightHandSide() instanceof NewConstantArrayInstance)) {
return;
}
NewConstantArrayInstance ncai = (NewConstantArrayInstance) declaration.getAssignment().getRightHandSide();
Expression countExpression = ncai.getCount();
AbstractIntermediate current = line;
Map<Integer, Expression> values = new HashMap<Integer, Expression>();
collectConstantAssignments(current, values);
//create a new array...
Integer count = toInteger(countExpression);
List<Expression> expressions = new ArrayList<Expression>(count);
for (int i = 0, j = count; i < j; i++) {
Expression exp = null;
if (values.containsKey(i)) {
exp = values.get(i);
} else {
exp = new Resolved(ncai.getInstructionHandle(), Type.NULL, "null");
}
expressions.add(i, exp);
}
//ok, we have the stack... now we need to just create a new expression.
//create the contant...
ConstantArray constantArray = new ConstantArray(declaration.getAssignment().getRightHandSide().getInstructionHandle(), expressions);
declaration.getAssignment().setRightHandSide(constantArray);
//excellent. we have reordered the statements into the appropriate ContantArray assignment. Now, we need to remove the dead nodes and heal the graph.
AbstractIntermediate next = Graphs.successorListOf(igc.getGraph(), line).get(0);
//loop through the dead elements...
//we know the number of dead items is equal to the number of values we found.
healGraph(line, next, values.size());
}
Aggregations