use of de.neemann.digital.hdl.model2.HDLPort in project Digital by hneemann.
the class NodeSorterExpressionBased method optimize.
@Override
public void optimize(HDLCircuit circuit) {
ArrayList<HDLNode> nodes = circuit.getNodes();
ArrayList<HDLNode> nodesAvail = new ArrayList<>(nodes);
nodes.clear();
HashSet<HDLNet> nets = new HashSet<>();
for (HDLPort p : circuit.getInputs()) nets.add(p.getNet());
// all nodes without an input at top!
for (HDLNode n : nodesAvail) if (n.getInputs().isEmpty()) {
nodes.add(n);
for (HDLPort p : n.getOutputs()) if (p.getNet() != null)
nets.add(p.getNet());
}
nodesAvail.removeAll(nodes);
// then a layer sorting
while (!nodesAvail.isEmpty()) {
ArrayList<HDLNode> layer = new ArrayList<>();
for (HDLNode n : nodesAvail) {
if (n.traverseExpressions(new DependsOnlyOn(nets)).ok())
layer.add(n);
}
if (layer.isEmpty()) {
// circular dependency detected
for (HDLNode n : nodesAvail) if (n.traverseExpressions(new DependsAtLeastOnOneOf(nets)).ok())
layer.add(n);
}
if (layer.isEmpty())
break;
nodes.addAll(layer);
nodesAvail.removeAll(layer);
for (HDLNode n : layer) for (HDLPort p : n.getOutputs()) if (p.getNet() != null)
nets.add(p.getNet());
}
// if there are unsolvable circular dependencies, keep old order
if (!nodesAvail.isEmpty())
nodes.addAll(nodesAvail);
}
use of de.neemann.digital.hdl.model2.HDLPort in project Digital by hneemann.
the class ReplaceOneToMany method replace.
private void replace(HDLNodeSplitterOneToMany n, ArrayList<HDLNodeAssignment> newNodes) throws HDLException {
final HDLPort inPort = n.getInputs().get(0);
HDLNet inNet = inPort.getNet();
inPort.setNet(null);
int i = 0;
for (Splitter.Port p : n.getOutputSplit()) {
final HDLPort outPort = n.getOutputs().get(i);
if (outPort.getNet() != null) {
ExprVarRange exp = new ExprVarRange(inNet, p.getPos() + p.getBits() - 1, p.getPos());
HDLNodeAssignment node = new HDLNodeAssignment("splitter", null, null);
node.setExpression(exp);
node.addPort(new HDLPort("in", inNet, HDLPort.Direction.IN, inPort.getBits()));
node.addPort(outPort);
newNodes.add(node);
}
i++;
}
}
Aggregations