use of org.apache.sysml.hops.codegen.cplan.CNode in project incubator-systemml by apache.
the class SpoofCompiler method cleanupCPlans.
/**
* Cleanup generated cplans in order to remove unnecessary inputs created
* during incremental construction. This is important as it avoids unnecessary
* redundant computation.
*
* @param cplans set of cplans
*/
private static HashMap<Long, Pair<Hop[], CNodeTpl>> cleanupCPlans(HashMap<Long, Pair<Hop[], CNodeTpl>> cplans) {
HashMap<Long, Pair<Hop[], CNodeTpl>> cplans2 = new HashMap<Long, Pair<Hop[], CNodeTpl>>();
for (Entry<Long, Pair<Hop[], CNodeTpl>> e : cplans.entrySet()) {
CNodeTpl tpl = e.getValue().getValue();
Hop[] inHops = e.getValue().getKey();
//collect cplan leaf node names
HashSet<Long> leafs = new HashSet<Long>();
if (tpl instanceof CNodeMultiAgg)
for (CNode out : ((CNodeMultiAgg) tpl).getOutputs()) rCollectLeafIDs(out, leafs);
else
rCollectLeafIDs(tpl.getOutput(), leafs);
//create clean cplan w/ minimal inputs
if (inHops.length == leafs.size())
cplans2.put(e.getKey(), e.getValue());
else {
tpl.cleanupInputs(leafs);
ArrayList<Hop> tmp = new ArrayList<Hop>();
for (Hop hop : inHops) {
if (hop != null && leafs.contains(hop.getHopID()))
tmp.add(hop);
}
cplans2.put(e.getKey(), new Pair<Hop[], CNodeTpl>(tmp.toArray(new Hop[0]), tpl));
}
//remove invalid plans with column indexing on main input
if (tpl instanceof CNodeCell) {
CNodeData in1 = (CNodeData) tpl.getInput().get(0);
if (rHasLookupRC1(tpl.getOutput(), in1) || isLookupRC1(tpl.getOutput(), in1)) {
cplans2.remove(e.getKey());
if (LOG.isTraceEnabled())
LOG.trace("Removed cplan due to invalid rc1 indexing on main input.");
}
} else if (tpl instanceof CNodeMultiAgg) {
CNodeData in1 = (CNodeData) tpl.getInput().get(0);
for (CNode output : ((CNodeMultiAgg) tpl).getOutputs()) if (rHasLookupRC1(output, in1) || isLookupRC1(output, in1)) {
cplans2.remove(e.getKey());
if (LOG.isTraceEnabled())
LOG.trace("Removed cplan due to invalid rc1 indexing on main input.");
}
}
//remove spurious lookups on main input of cell template
if (tpl instanceof CNodeCell || tpl instanceof CNodeOuterProduct) {
CNodeData in1 = (CNodeData) tpl.getInput().get(0);
rFindAndRemoveLookup(tpl.getOutput(), in1);
} else if (tpl instanceof CNodeMultiAgg) {
CNodeData in1 = (CNodeData) tpl.getInput().get(0);
rFindAndRemoveLookupMultiAgg((CNodeMultiAgg) tpl, in1);
}
//remove cplan w/ single op and w/o agg
if ((tpl instanceof CNodeCell && ((((CNodeCell) tpl).getCellType() == CellType.NO_AGG && TemplateUtils.hasSingleOperation(tpl)) || TemplateUtils.hasNoOperation(tpl))) || tpl instanceof CNodeRow && TemplateUtils.hasSingleOperation(tpl))
cplans2.remove(e.getKey());
//remove cplan if empty
if (tpl.getOutput() instanceof CNodeData)
cplans2.remove(e.getKey());
}
return cplans2;
}
use of org.apache.sysml.hops.codegen.cplan.CNode in project incubator-systemml by apache.
the class TemplateUtils method countVectorIntermediates.
public static int countVectorIntermediates(CNode node, HashSet<Long> memo) {
//memoization to prevent double counting
if (memo.contains(node.getID()))
return 0;
memo.add(node.getID());
//compute vector requirements over all inputs
int ret = 0;
for (CNode c : node.getInput()) ret += countVectorIntermediates(c, memo);
//compute vector requirements of current node
int cntBin = (node instanceof CNodeBinary && (((CNodeBinary) node).getType().isVectorScalarPrimitive() || ((CNodeBinary) node).getType().isVectorVectorPrimitive())) ? 1 : 0;
int cntUn = (node instanceof CNodeUnary && ((CNodeUnary) node).getType().isVectorScalarPrimitive()) ? 1 : 0;
return ret + cntBin + cntUn;
}
use of org.apache.sysml.hops.codegen.cplan.CNode in project incubator-systemml by apache.
the class SpoofCompiler method cleanupCPlans.
/**
* Cleanup generated cplans in order to remove unnecessary inputs created
* during incremental construction. This is important as it avoids unnecessary
* redundant computation.
*
* @param memo memoization table
* @param cplans set of cplans
*/
private static HashMap<Long, Pair<Hop[], CNodeTpl>> cleanupCPlans(CPlanMemoTable memo, HashMap<Long, Pair<Hop[], CNodeTpl>> cplans) {
HashMap<Long, Pair<Hop[], CNodeTpl>> cplans2 = new HashMap<>();
CPlanOpRewriter rewriter = new CPlanOpRewriter();
CPlanCSERewriter cse = new CPlanCSERewriter();
for (Entry<Long, Pair<Hop[], CNodeTpl>> e : cplans.entrySet()) {
CNodeTpl tpl = e.getValue().getValue();
Hop[] inHops = e.getValue().getKey();
// remove invalid plans with null inputs
if (Arrays.stream(inHops).anyMatch(h -> (h == null)))
continue;
// perform simplifications and cse rewrites
tpl = rewriter.simplifyCPlan(tpl);
tpl = cse.eliminateCommonSubexpressions(tpl);
// update input hops (order-preserving)
HashSet<Long> inputHopIDs = tpl.getInputHopIDs(false);
inHops = Arrays.stream(inHops).filter(p -> p != null && inputHopIDs.contains(p.getHopID())).toArray(Hop[]::new);
cplans2.put(e.getKey(), new Pair<>(inHops, tpl));
// remove invalid plans with column indexing on main input
if (tpl instanceof CNodeCell || tpl instanceof CNodeRow) {
CNodeData in1 = (CNodeData) tpl.getInput().get(0);
boolean inclRC1 = !(tpl instanceof CNodeRow);
if (rHasLookupRC1(tpl.getOutput(), in1, inclRC1) || isLookupRC1(tpl.getOutput(), in1, inclRC1)) {
cplans2.remove(e.getKey());
if (LOG.isTraceEnabled())
LOG.trace("Removed cplan due to invalid rc1 indexing on main input.");
}
} else if (tpl instanceof CNodeMultiAgg) {
CNodeData in1 = (CNodeData) tpl.getInput().get(0);
for (CNode output : ((CNodeMultiAgg) tpl).getOutputs()) if (rHasLookupRC1(output, in1, true) || isLookupRC1(output, in1, true)) {
cplans2.remove(e.getKey());
if (LOG.isTraceEnabled())
LOG.trace("Removed cplan due to invalid rc1 indexing on main input.");
}
}
// remove invalid lookups on main input (all templates)
CNodeData in1 = (CNodeData) tpl.getInput().get(0);
if (tpl instanceof CNodeMultiAgg)
rFindAndRemoveLookupMultiAgg((CNodeMultiAgg) tpl, in1);
else
rFindAndRemoveLookup(tpl.getOutput(), in1, !(tpl instanceof CNodeRow));
// remove invalid row templates (e.g., unsatisfied blocksize constraint)
if (tpl instanceof CNodeRow) {
// check for invalid row cplan over column vector
if (((CNodeRow) tpl).getRowType() == RowType.NO_AGG && tpl.getOutput().getDataType().isScalar()) {
cplans2.remove(e.getKey());
if (LOG.isTraceEnabled())
LOG.trace("Removed invalid row cplan w/o agg on column vector.");
} else if (OptimizerUtils.isSparkExecutionMode()) {
Hop hop = memo.getHopRefs().get(e.getKey());
boolean isSpark = DMLScript.rtplatform == RUNTIME_PLATFORM.SPARK || OptimizerUtils.getTotalMemEstimate(inHops, hop, true) > OptimizerUtils.getLocalMemBudget();
boolean invalidNcol = hop.getDataType().isMatrix() && (HopRewriteUtils.isTransposeOperation(hop) ? hop.getDim1() > hop.getRowsInBlock() : hop.getDim2() > hop.getColsInBlock());
for (Hop in : inHops) invalidNcol |= (in.getDataType().isMatrix() && in.getDim2() > in.getColsInBlock());
if (isSpark && invalidNcol) {
cplans2.remove(e.getKey());
if (LOG.isTraceEnabled())
LOG.trace("Removed invalid row cplan w/ ncol>ncolpb.");
}
}
}
// remove cplan w/ single op and w/o agg
if ((tpl instanceof CNodeCell && ((CNodeCell) tpl).getCellType() == CellType.NO_AGG && TemplateUtils.hasSingleOperation(tpl)) || (tpl instanceof CNodeRow && (((CNodeRow) tpl).getRowType() == RowType.NO_AGG || ((CNodeRow) tpl).getRowType() == RowType.NO_AGG_B1 || ((CNodeRow) tpl).getRowType() == RowType.ROW_AGG) && TemplateUtils.hasSingleOperation(tpl)) || TemplateUtils.hasNoOperation(tpl)) {
cplans2.remove(e.getKey());
if (LOG.isTraceEnabled())
LOG.trace("Removed cplan with single operation.");
}
// remove cplan if empty
if (tpl.getOutput() instanceof CNodeData) {
cplans2.remove(e.getKey());
if (LOG.isTraceEnabled())
LOG.trace("Removed empty cplan.");
}
// rename inputs (for codegen and plan caching)
tpl.renameInputs();
}
return cplans2;
}
use of org.apache.sysml.hops.codegen.cplan.CNode in project incubator-systemml by apache.
the class CPlanCSERewriter method rSetStrictDataNodeComparision.
private void rSetStrictDataNodeComparision(CNode current, boolean flag) {
// avoid redundant re-evaluation
if (current.isVisited())
return;
// process inputs recursively and node itself
for (CNode input : current.getInput()) {
rSetStrictDataNodeComparision(input, flag);
input.resetHash();
}
if (current instanceof CNodeData)
((CNodeData) current).setStrictEquals(flag);
current.setVisited();
}
use of org.apache.sysml.hops.codegen.cplan.CNode in project incubator-systemml by apache.
the class CPlanCSERewriter method rEliminateCommonSubexpression.
private void rEliminateCommonSubexpression(CNode current, HashMap<CNode, CNode> cseSet) {
// avoid redundant re-evaluation
if (current.isVisited())
return;
// replace input with existing common subexpression
for (int i = 0; i < current.getInput().size(); i++) {
CNode input = current.getInput().get(i);
if (cseSet.containsKey(input))
current.getInput().set(i, cseSet.get(input));
}
// process inputs recursively
for (CNode input : current.getInput()) rEliminateCommonSubexpression(input, cseSet);
// process node itself
cseSet.put(current, current);
current.setVisited();
}
Aggregations