--- /dev/null
+<?xml version="1.0" encoding="UTF-8"?>
+<classpath>
+ <classpathentry kind="src" path="src"/>
+ <classpathentry kind="con" path="org.eclipse.jdt.junit.JUNIT_CONTAINER/5"/>
+ <classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER/org.eclipse.jdt.internal.debug.ui.launcher.StandardVMType/JavaSE-10">
+ <attributes>
+ <attribute name="module" value="true"/>
+ </attributes>
+ </classpathentry>
+ <classpathentry kind="output" path="bin"/>
+</classpath>
--- /dev/null
+<?xml version="1.0" encoding="UTF-8"?>
+<projectDescription>
+ <name>era.mi</name>
+ <comment></comment>
+ <projects>
+ </projects>
+ <buildSpec>
+ <buildCommand>
+ <name>org.eclipse.jdt.core.javabuilder</name>
+ <arguments>
+ </arguments>
+ </buildCommand>
+ </buildSpec>
+ <natures>
+ <nature>org.eclipse.jdt.core.javanature</nature>
+ </natures>
+</projectDescription>
--- /dev/null
+eclipse.preferences.version=1
+org.eclipse.jdt.core.compiler.codegen.inlineJsrBytecode=enabled
+org.eclipse.jdt.core.compiler.codegen.targetPlatform=10
+org.eclipse.jdt.core.compiler.codegen.unusedLocal=preserve
+org.eclipse.jdt.core.compiler.compliance=10
+org.eclipse.jdt.core.compiler.debug.lineNumber=generate
+org.eclipse.jdt.core.compiler.debug.localVariable=generate
+org.eclipse.jdt.core.compiler.debug.sourceFile=generate
+org.eclipse.jdt.core.compiler.problem.assertIdentifier=error
+org.eclipse.jdt.core.compiler.problem.enumIdentifier=error
+org.eclipse.jdt.core.compiler.release=enabled
+org.eclipse.jdt.core.compiler.source=10
--- /dev/null
+package era.mi.logic;
+
+
+public enum Bit
+{
+ ONE, ZERO, Z, X;
+
+ public static Bit and(Bit a, Bit b)
+ {
+ return a.and(b);
+ }
+
+ public Bit and(Bit other)
+ {
+ if(equals(Bit.ZERO) || other.equals(Bit.ZERO))
+ return Bit.ZERO;
+ else if(equals(other) && equals(Bit.ONE))
+ return Bit.ONE;
+ else
+ return Bit.X;
+ }
+
+ public static Bit or(Bit a, Bit b)
+ {
+ return a.or(b);
+ }
+
+ public Bit or(Bit other)
+ {
+ if(equals(Bit.ONE) || other.equals(Bit.ONE))
+ return Bit.ONE;
+ else if(equals(other) && equals(Bit.ZERO))
+ return Bit.ZERO;
+ else
+ return Bit.X;
+ }
+
+ public static Bit xor(Bit a, Bit b)
+ {
+ return a.xor(b);
+ }
+
+ public Bit xor(Bit other)
+ {
+ //I'm uncertain how this should behave for cases where one value is neither 1 nor 0.
+ //TODO: Implement xor
+ return Bit.X;
+ }
+
+ public Bit not()
+ {
+ switch(this)
+ {
+ case ONE:
+ return Bit.ZERO;
+ case ZERO:
+ return Bit.ONE;
+ default:
+ return Bit.X;
+ }
+ }
+}
--- /dev/null
+package era.mi.logic;
+
+import era.mi.logic.timeline.Timeline;
+
+public class Simulation
+{
+ public final static Timeline TIMELINE = new Timeline(11);
+
+ public static void main(String[] args)
+ {
+ }
+}
\ No newline at end of file
--- /dev/null
+package era.mi.logic;
+
+import java.util.Arrays;
+
+public final class Util
+{
+
+ @SuppressWarnings("unchecked")
+ public static <T> T[] concat(T[]... arrays)
+ {
+ if(arrays.length == 0)
+ throw new IllegalArgumentException("Cannot concatenate 0 arrays.");
+
+ int length = 0;
+ for(T[] array : arrays)
+ length += array.length;
+
+ T[] newArray = Arrays.copyOf(arrays[0], length);
+ int appendIndex = arrays[0].length;
+ for(int i = 1; i < arrays.length; i++)
+ {
+ System.arraycopy(arrays[i], 0, newArray, appendIndex, arrays[i].length);
+ appendIndex += arrays[i].length;
+ }
+
+ return newArray;
+ }
+
+// @SuppressWarnings("unchecked")
+// public static <T> T[][] split(T[] array, int... lengths)
+// {
+// //TODO: implement array split again; This version contains an illegal cast
+// int totalLength = 0;
+// for(int length : lengths)
+// totalLength += length;
+//
+// if(totalLength != array.length)
+// throw new IllegalArgumentException(); //TODO: add proper error message
+//
+// Object[][] newArray = new Object[lengths.length][];
+// int splitIndex = 0;
+// for(int i = 0; i < lengths.length; i++)
+// {
+// System.arraycopy(array, splitIndex, newArray, 0, lengths[i]);
+// splitIndex += lengths[i];
+// }
+//
+// return (T[][]) newArray;
+// }
+
+ public static Bit[] and(Bit[] a, Bit[] b)
+ {
+ return binBitOp(a, b, (bA, bB) -> Bit.and(bA, bB));
+ }
+
+ public static Bit[] or(Bit[] a, Bit[] b)
+ {
+ return binBitOp(a, b, (bA, bB) -> Bit.or(bA, bB));
+ }
+
+ public static Bit[] xor(Bit[] a, Bit[] b)
+ {
+ return binBitOp(a, b, (bA, bB) -> Bit.xor(bA, bB));
+ }
+
+ private static Bit[] binBitOp(Bit[] a, Bit[] b, BitOp op)
+ {
+ if(a.length != b.length)
+ throw new IllegalArgumentException("Bit Arrays were not of equal length.");
+ Bit[] out = new Bit[a.length];
+ for(int i = 0; i < a.length; i++)
+ {
+ out[i] = op.execute(a[i], b[i]);
+ }
+ return out;
+ }
+
+ public static Bit[] not(Bit[] a)
+ {
+ Bit[] out = new Bit[a.length];
+ for(int i = 0; i < a.length; i++)
+ {
+ out[i] = a[i].not();
+ }
+ return out;
+ }
+
+ interface BitOp
+ {
+ Bit execute(Bit a, Bit b);
+ }
+}
--- /dev/null
+package era.mi.logic;
+
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.List;
+
+/**
+ * Represents an array of wires that can store n bits of information.
+ * @author Fabian Stemmler
+ *
+ */
+public class WireArray
+{
+ private Bit[] values;
+ private final int travelTime;
+ private List<WireArrayObserver> observers = new ArrayList<>();//<WireArrayObserver>();
+ private final int length;
+
+ public WireArray(int length, int travelTime)
+ {
+ if(length < 1)
+ throw new IllegalArgumentException("Tried to create an array of wires with length " + length + ", but a length of less than 1 makes no sense.");
+ this.length = length;
+ this.travelTime = travelTime;
+ initValues();
+ }
+
+ private void initValues()
+ {
+ values = new Bit[length];
+ for(int i = 0; i < length; i++)
+ values[i] = Bit.X;
+ }
+
+ /**
+ * Sets the wires values. This takes up time, as specified by the {@link WireArray}s travel time.
+ * @param newValues The new values the wires should take on.
+ *
+ * @author Fabian Stemmler
+ */
+ public void feedSignals(Bit... newValues)
+ {
+ Simulation.TIMELINE.addEvent((e) -> setValues(newValues), travelTime);
+ }
+
+ private void setValues(Bit... newValues)
+ {
+ if(length != newValues.length)
+ throw new IllegalArgumentException(String.format("Unexpected length for input array. Length was %d but expected %d", newValues.length, length)); //TODO: Proper handling
+ if(!Arrays.equals(values, newValues))
+ {
+ values = newValues.clone();
+ notifyObservers();
+ }
+ }
+
+ /**
+ * Sets values of a subarray of wires. This takes up time, as specified by the {@link WireArray}s travel time.
+ * @param newValues The new values the wires should take on.
+ * @param startingBit The first index of the subarray of wires.
+ *
+ * @author Fabian Stemmler
+ */
+ public void feedSignals(int startingBit, Bit... newValues)
+ {
+ Simulation.TIMELINE.addEvent((e) -> setValues(startingBit, newValues), travelTime);
+ }
+
+ private void setValues(int startingBit, Bit... newValues)
+ {
+ if(length < startingBit + newValues.length)
+ throw new IllegalArgumentException(); //TODO: Proper handling
+ if(!Arrays.equals(values, startingBit, startingBit + newValues.length, newValues, 0, newValues.length))
+ {
+ System.arraycopy(newValues, 0, values, startingBit, newValues.length);
+ notifyObservers();
+ }
+ }
+
+ /**
+ * The WireArray is interpreted as an unsigned integer with n bits.
+ * @return <code>true</code> if all bits are either <code>Bit.ONE</code> or <code>Bit.ZERO</code> (they do not all have to have the same value), not <code>Bit.X</code> or <code>Bit.Z</code>. <code>false</code> is returned otherwise.
+ *
+ * @author Fabian Stemmler
+ */
+ public boolean hasNumericValue()
+ {
+ for(Bit b : values)
+ {
+ if(b != Bit.ZERO && b != Bit.ONE)
+ return false;
+ }
+ return true;
+ }
+
+ /**
+ * The WireArray is interpreted as an unsigned integer with n bits.
+ * @return The unsigned value of the {@link WireArray}'s bits, where value 0 corresponds with 2^0, value 1 is 2^1 and so on.
+ *
+ * @author Fabian Stemmler
+ */
+ public int getUnsignedValue()
+ {
+ int val = 0;
+ int mask = 1;
+ for(int i = 0; i < length; i++)
+ {
+ switch(values[i])
+ {
+ default:
+ case Z:
+ case X:
+ return 0; //TODO: Proper handling for getUnsignedValue(), if not all bits are 1 or 0; Random number?
+ case ONE:
+ val |= mask;
+ break;
+ case ZERO:
+ }
+ mask = mask << 1;
+ }
+ return val;
+ }
+
+ /**
+ * The WireArray is interpreted as a signed integer with n bits.
+ * @return The signed value of the {@link WireArray}'s bits, where value 0 corresponds with 2^0, value 1 is 2^1 and so on.
+ *
+ * @author Fabian Stemmler
+ */
+ public int getSignedValue()
+ {
+ int val = getUnsignedValue();
+ int mask = 1 << (length - 1);
+ if((mask & val) != 0)
+ {
+ int shifts = 32 - length;
+ return (val << shifts) >> shifts;
+ }
+ return val;
+ }
+
+ /**
+ * Included for convenient use on {@link WireArray}s of length 1.
+ * @return The value of bit 0.
+ *
+ * @author Fabian Stemmler
+ */
+ public Bit getValue()
+ {
+ return getValue(0);
+ }
+
+ /**
+ *
+ * @param index Index of the requested bit.
+ * @return The value of the indexed bit.
+ *
+ * @author Fabian Stemmler
+ */
+ public Bit getValue(int index)
+ {
+ //TODO: ArrayIndexOutOfBoundsException handling for accessing single bit in WireArray
+ return values[index];
+ }
+
+ public Bit[] getValues(int start, int end)
+ {
+ int length = end - start;
+ Bit[] bits = new Bit[length];
+ System.arraycopy(values, start, bits, 0, length);
+ return bits;
+ }
+
+
+ /**
+ * @return An array of length n containing the values of the n bits in the {@link WireArray}. Can be safely modified.
+ *
+ * @author Fabian Stemmler
+ */
+ public Bit[] getValues()
+ {
+ return values.clone();
+ }
+
+ public int length()
+ {
+ return length;
+ }
+
+
+ /**
+ * Adds an {@link WireArrayObserver}, who will be notified when the value of the {@link WireArray} is updated.
+ * @param ob The {@link WireArrayObserver} to be notified of changes.
+ * @return true if the given {@link WireArrayObserver} was not already registered, false otherwise
+ *
+ * @author Fabian Stemmler
+ */
+ public boolean addObserver(WireArrayObserver ob)
+ {
+ return observers.add(ob);
+ }
+
+ private void notifyObservers()
+ {
+ for(WireArrayObserver o : observers)
+ o.update(this);
+ }
+}
--- /dev/null
+package era.mi.logic;
+
+public interface WireArrayObserver
+{
+ public void update(WireArray initiator);
+}
--- /dev/null
+package era.mi.logic.components;
+
+import era.mi.logic.Simulation;
+import era.mi.logic.WireArray;
+import era.mi.logic.WireArrayObserver;
+
+public abstract class BasicComponent implements WireArrayObserver
+{
+ private int processTime;
+
+ /**
+ *
+ * @param processTime Amount of time this component takes to update its outputs. Must be more than 0, otherwise 1 is assumed.
+ *
+ * @author Fabian Stemmler
+ */
+ public BasicComponent(int processTime)
+ {
+ this.processTime = processTime > 0 ? processTime : 1;
+ }
+
+ @Override
+ public void update(WireArray initiator)
+ {
+ Simulation.TIMELINE.addEvent((e) -> {compute();}, processTime);
+ }
+
+ protected abstract void compute();
+}
--- /dev/null
+package era.mi.logic.components;
+
+import era.mi.logic.Bit;
+import era.mi.logic.Simulation;
+import era.mi.logic.WireArray;
+import era.mi.logic.timeline.TimelineEvent;
+import era.mi.logic.timeline.TimelineEventHandler;
+
+public class Clock implements TimelineEventHandler
+{
+ private boolean toggle = false;
+ private WireArray w;
+
+ public Clock(WireArray w)
+ {
+ this.w = w;
+ }
+
+ @Override
+ public void handle(TimelineEvent e)
+ {
+ Simulation.TIMELINE.addEvent(this, 50);
+ w.feedSignals(new Bit[] { toggle ? Bit.ONE : Bit.ZERO });
+ toggle = !toggle;
+ }
+
+ public WireArray getW()
+ {
+ return w;
+ }
+}
--- /dev/null
+package era.mi.logic.components;
+
+import era.mi.logic.Util;
+import era.mi.logic.Bit;
+import era.mi.logic.WireArray;
+import era.mi.logic.WireArrayObserver;
+
+@Deprecated
+public class Merger implements WireArrayObserver
+{
+ private WireArray out;
+ private WireArray[] inputs;
+
+ //TODO: General problem with this concept; New inputs coming in at the same time override each other
+
+ /**
+ *
+ * @param union The output of merging n {@link WireArray}s into one. Must have length = a1.length() + a2.length() + ... + an.length().
+ * @param inputs The inputs to be merged into the union
+ */
+ public Merger(WireArray union, WireArray... inputs)
+ {
+ this.inputs = inputs;
+ this.out = union;
+
+ int length = 0;
+ for(WireArray input : inputs)
+ {
+ length += input.length();
+ input.addObserver(this);
+ }
+
+ if(length != union.length())
+ throw new IllegalArgumentException("The output of merging n WireArrays into one must have length = a1.length() + a2.length() + ... + an.length().");
+ }
+
+ protected void compute()
+ {
+ Bit[][] bits = new Bit[inputs.length][];
+ for(int i = 0; i < inputs.length; i++)
+ bits[i] = inputs[i].getValues();
+ Bit[] newOut = Util.concat(bits);
+ out.feedSignals(newOut);
+ }
+
+ public WireArray getInput(int index)
+ {
+ return inputs[index];
+ }
+
+ public WireArray getUnion()
+ {
+ return out;
+ }
+
+ @Override
+ public void update(WireArray initiator)
+ {
+ compute(); //No inner delay
+ }
+}
--- /dev/null
+package era.mi.logic.components;
+
+import era.mi.logic.WireArray;
+import era.mi.logic.WireArrayObserver;
+
+public class Merger2 implements WireArrayObserver
+{
+ private WireArray out;
+ private WireArray[] inputs;
+ private int[] beginningIndex;
+
+ /**
+ *
+ * @param union The output of merging n {@link WireArray}s into one. Must have length = a1.length() + a2.length() + ... + an.length().
+ * @param inputs The inputs to be merged into the union
+ */
+ public Merger2(WireArray union, WireArray... inputs)
+ {
+ this.inputs = inputs;
+ this.out = union;
+ this.beginningIndex = new int[inputs.length];
+
+ int length = 0;
+ for(int i = 0; i < inputs.length; i++)
+ {
+ beginningIndex[i] = length;
+ length += inputs[i].length();
+ inputs[i].addObserver(this);
+ }
+
+ if(length != union.length())
+ throw new IllegalArgumentException("The output of merging n WireArrays into one must have length = a1.length() + a2.length() + ... + an.length().");
+ }
+
+ public WireArray getInput(int index)
+ {
+ return inputs[index];
+ }
+
+ public WireArray getUnion()
+ {
+ return out;
+ }
+
+ @Override
+ public void update(WireArray initiator)
+ {
+ int index = find(initiator);
+ int beginning = beginningIndex[index];
+ out.feedSignals(beginning, initiator.getValues());
+ }
+
+ private int find(WireArray w)
+ {
+ for(int i = 0; i < inputs.length; i++)
+ if(inputs[i] == w)
+ return i;
+ return -1;
+ }
+
+ public WireArray getOut()
+ {
+ return out;
+ }
+
+ public WireArray[] getInputs()
+ {
+ return inputs.clone();
+ }
+}
--- /dev/null
+package era.mi.logic.components;
+
+import era.mi.logic.Bit;
+import era.mi.logic.WireArray;
+
+/**
+ * Models a Multiplexer. A is selected when select bit is 1, B when select bit is 0. Outputs X otherwise.
+ * @author Fabian
+ *
+ */
+public class Mux extends BasicComponent
+{
+ private WireArray a, b, out;
+ private WireArray select;
+ private final int size;
+
+ /**
+ * {@link WireArray}s a, b and out must be of uniform length, select
+ * @param a Must be of uniform length with b and out.
+ * @param b Must be of uniform length with a and out.
+ * @param select C
+ * @param out Must be of uniform length with a and b.
+ */
+ public Mux(int processTime, WireArray a, WireArray b, WireArray select, WireArray out)
+ {
+ super(processTime);
+ size = a.length();
+ if(b.length() != out.length() || b.length() != size)
+ throw new IllegalArgumentException("All MUX wire arrays must be of uniform length!");
+ this.a = a;
+ a.addObserver(this);
+ this.b = b;
+ b.addObserver(this);
+ this.select = select;
+ select.addObserver(this);
+ this.out = out;
+ }
+
+ @Override
+ protected void compute()
+ {
+ WireArray active = b;
+ switch(select.getValue())
+ {
+ case ONE:
+ active = a;
+ case ZERO:
+ out.feedSignals(active.getValues());
+ break;
+ default:
+ Bit[] newValues = new Bit[size];
+ for(int i = 0; i < size; i++)
+ newValues[i] = Bit.X;
+ out.feedSignals(newValues);
+ }
+ }
+
+ public WireArray getA()
+ {
+ return a;
+ }
+
+ public WireArray getB()
+ {
+ return b;
+ }
+
+ public WireArray getOut()
+ {
+ return out;
+ }
+
+ public WireArray getSelect()
+ {
+ return select;
+ }
+}
--- /dev/null
+package era.mi.logic.components;
+
+import era.mi.logic.Bit;
+import era.mi.logic.WireArray;
+import era.mi.logic.WireArrayObserver;
+
+public class Splitter implements WireArrayObserver
+{
+ private WireArray input;
+ private WireArray[] outputs;
+
+ public Splitter(WireArray input, WireArray... outputs)
+ {
+ this.input = input;
+ this.outputs = outputs;
+ input.addObserver(this);
+ int length = 0;
+ for(WireArray out : outputs)
+ length += out.length();
+
+ if(input.length() != length)
+ throw new IllegalArgumentException("The input of splitting one into n WireArrays must have length = a1.length() + a2.length() + ... + an.length().");
+ }
+
+ protected void compute()
+ {
+ int startIndex = 0;
+ Bit[] inputBits = input.getValues();
+ for(int i = 0; i < outputs.length; i++)
+ {
+ Bit[] outputBits = new Bit[outputs[i].length()];
+ System.arraycopy(inputBits, startIndex, outputBits, 0, outputs[i].length());
+ outputs[i].feedSignals(outputBits);
+ startIndex += outputs[i].length();
+ }
+ }
+
+ public WireArray getInput()
+ {
+ return input;
+ }
+
+ public WireArray[] getOutputs()
+ {
+ return outputs.clone();
+ }
+
+ @Override
+ public void update(WireArray initiator)
+ {
+ compute();
+ }
+}
--- /dev/null
+package era.mi.logic.components.gates;
+
+import era.mi.logic.Util;
+import era.mi.logic.WireArray;
+import era.mi.logic.components.BasicComponent;
+
+public class AndGate extends BasicComponent
+{
+ private WireArray a, b, out;
+
+ public AndGate(int processTime, WireArray a, WireArray b, WireArray out)
+ {
+ super(processTime);
+ this.a = a;
+ a.addObserver(this);
+ this.b = b;
+ b.addObserver(this);
+ this.out = out;
+ }
+
+ protected void compute()
+ {
+ out.feedSignals(Util.and(a.getValues(), b.getValues()));
+ }
+
+ public WireArray getA()
+ {
+ return a;
+ }
+
+ public WireArray getB()
+ {
+ return b;
+ }
+
+ public WireArray getOut()
+ {
+ return out;
+ }
+}
--- /dev/null
+package era.mi.logic.components.gates;
+
+import era.mi.logic.Util;
+import era.mi.logic.WireArray;
+import era.mi.logic.components.BasicComponent;
+
+public class NotGate extends BasicComponent
+{
+ private WireArray in, out;
+
+ public NotGate(int processTime, WireArray in, WireArray out)
+ {
+ super(processTime);
+ this.in = in;
+ in.addObserver(this);
+ this.out = out;
+ }
+
+ public void compute()
+ {
+ out.feedSignals(Util.not(in.getValues()));
+ }
+
+ public WireArray getIn()
+ {
+ return in;
+ }
+
+ public WireArray getOut()
+ {
+ return out;
+ }
+}
--- /dev/null
+package era.mi.logic.components.gates;
+
+import era.mi.logic.Util;
+import era.mi.logic.WireArray;
+import era.mi.logic.components.BasicComponent;
+
+public class OrGate extends BasicComponent
+{
+ private WireArray a, b, out;
+
+ public OrGate(int processTime, WireArray a, WireArray b, WireArray out)
+ {
+ super(processTime);
+ this.a = a;
+ a.addObserver(this);
+ this.b = b;
+ b.addObserver(this);
+ this.out = out;
+ }
+
+ protected void compute()
+ {
+ out.feedSignals(Util.or(a.getValues(), b.getValues()));
+ }
+
+ public WireArray getA()
+ {
+ return a;
+ }
+
+ public WireArray getB()
+ {
+ return b;
+ }
+
+ public WireArray getOut()
+ {
+ return out;
+ }
+}
--- /dev/null
+package era.mi.logic.components.gates;
+
+import era.mi.logic.Util;
+import era.mi.logic.WireArray;
+import era.mi.logic.components.BasicComponent;
+
+public class XorGate extends BasicComponent
+{
+ private WireArray a, b, out;
+
+ public XorGate(int processTime, WireArray a, WireArray b, WireArray out)
+ {
+ super(processTime);
+ this.a = a;
+ a.addObserver(this);
+ this.b = b;
+ b.addObserver(this);
+ this.out = out;
+ }
+
+ protected void compute()
+ {
+ out.feedSignals(Util.xor(a.getValues(), b.getValues()));
+ }
+
+ public WireArray getA()
+ {
+ return a;
+ }
+
+ public WireArray getB()
+ {
+ return b;
+ }
+
+ public WireArray getOut()
+ {
+ return out;
+ }
+}
--- /dev/null
+package era.mi.logic.tests;
+
+import static org.junit.jupiter.api.Assertions.*;
+
+import java.util.Arrays;
+
+import org.junit.jupiter.api.Test;
+
+import era.mi.logic.Bit;
+import era.mi.logic.Simulation;
+import era.mi.logic.WireArray;
+import era.mi.logic.components.Merger2;
+import era.mi.logic.components.Mux;
+import era.mi.logic.components.Splitter;
+import era.mi.logic.components.gates.AndGate;
+import era.mi.logic.components.gates.NotGate;
+import era.mi.logic.components.gates.OrGate;
+
+class ComponentTest
+{
+
+ @Test
+ void circuitExampleTest()
+ {
+ Simulation.TIMELINE.reset();
+ WireArray a = new WireArray(1, 1), b = new WireArray(1, 1), c = new WireArray(1, 10), d = new WireArray(2, 1), e = new WireArray(1, 1),
+ f = new WireArray(1, 1), g = new WireArray(1, 1), h = new WireArray(2, 1), i = new WireArray(2, 1), j = new WireArray(1, 1), k = new WireArray(1, 1);
+ new AndGate(1, a, b, f);
+ new NotGate(1, f, g);
+ new Merger2(h, c, g);
+ new Mux(1, h, d, e, i);
+ new Splitter(i, k, j);
+
+ a.feedSignals(Bit.ZERO);
+ b.feedSignals(Bit.ONE);
+ c.feedSignals(Bit.ZERO);
+ d.feedSignals(Bit.ONE, Bit.ONE);
+ e.feedSignals(Bit.ONE);
+
+ while(Simulation.TIMELINE.hasNext())
+ {
+ Simulation.TIMELINE.executeNext();
+ }
+
+ assertEquals(Simulation.TIMELINE.getSimulationTime(), 14);
+ assertEquals(Bit.ONE, j.getValue());
+ assertEquals(Bit.ZERO, k.getValue());
+ }
+
+ @Test
+ void splitterTest()
+ {
+ Simulation.TIMELINE.reset();
+ WireArray a = new WireArray(3, 1), b = new WireArray(2, 1), c = new WireArray(3, 1), in = new WireArray(8, 1);
+ in.feedSignals(Bit.ZERO, Bit.ONE, Bit.ZERO, Bit.ONE, Bit.ZERO,Bit.ONE, Bit.ZERO, Bit.ONE);
+ new Splitter(in, a, b, c);
+
+ while(Simulation.TIMELINE.hasNext())
+ {
+ Simulation.TIMELINE.executeNext();
+ }
+
+ assertTrue(Arrays.equals(a.getValues(), new Bit[] { Bit.ZERO, Bit.ONE, Bit.ZERO }));
+ assertTrue(Arrays.equals(b.getValues(), new Bit[] { Bit.ONE, Bit.ZERO }));
+ assertTrue(Arrays.equals(c.getValues(), new Bit[] { Bit.ONE, Bit.ZERO, Bit.ONE }));
+ }
+
+ @Test
+ void mergerTest()
+ {
+ Simulation.TIMELINE.reset();
+ WireArray a = new WireArray(3, 1), b = new WireArray(2, 1), c = new WireArray(3, 1), out = new WireArray(8, 1);
+ a.feedSignals(Bit.ZERO, Bit.ONE, Bit.ZERO);
+ b.feedSignals(Bit.ONE, Bit.ZERO);
+ c.feedSignals(Bit.ONE, Bit.ZERO, Bit.ONE);
+
+ new Merger2(out, a, b, c);
+
+ while(Simulation.TIMELINE.hasNext())
+ {
+ Simulation.TIMELINE.executeNext();
+ }
+
+ assertTrue(Arrays.equals(out.getValues(), new Bit[] { Bit.ZERO, Bit.ONE, Bit.ZERO, Bit.ONE, Bit.ZERO, Bit.ONE, Bit.ZERO, Bit.ONE }));
+ }
+
+ @Test
+ void muxTest()
+ {
+ Simulation.TIMELINE.reset();
+ WireArray a = new WireArray(1, 1), b = new WireArray(1, 1), select = new WireArray(1, 1), out = new WireArray(1, 1);
+
+ select.feedSignals(Bit.ONE);
+ a.feedSignals(Bit.ONE);
+ b.feedSignals(Bit.ZERO);
+
+ new Mux(1, a, b, select, out);
+ assertEquals(out.getValue(), Bit.X);
+ while(Simulation.TIMELINE.hasNext())
+ {
+ Simulation.TIMELINE.executeNext();
+ }
+
+ assertEquals(out.getValue(), Bit.ONE);
+ select.feedSignals(Bit.ZERO);
+ while(Simulation.TIMELINE.hasNext())
+ {
+ Simulation.TIMELINE.executeNext();
+ }
+
+ assertEquals(out.getValue(), Bit.ZERO);
+ }
+
+ @Test
+ void andTest()
+ {
+ Simulation.TIMELINE.reset();
+ AndGate gate = new AndGate(1, new WireArray(4, 1), new WireArray(4, 1), new WireArray(4, 1));
+ gate.getA().feedSignals(Bit.ONE, Bit.ONE, Bit.ZERO, Bit.ZERO);
+ gate.getB().feedSignals(Bit.ZERO, Bit.ONE, Bit.ZERO, Bit.ONE);
+
+
+ while(Simulation.TIMELINE.hasNext())
+ {
+ Simulation.TIMELINE.executeNext();
+ }
+ assertTrue(Arrays.equals(gate.getOut().getValues(), new Bit[] { Bit.ZERO, Bit.ONE, Bit.ZERO, Bit.ZERO }));
+ }
+
+ @Test
+ void orTest()
+ {
+ Simulation.TIMELINE.reset();
+ OrGate gate = new OrGate(1, new WireArray(4, 1), new WireArray(4, 1), new WireArray(4, 1));
+ gate.getA().feedSignals(Bit.ONE, Bit.ONE, Bit.ZERO, Bit.ZERO);
+ gate.getB().feedSignals(Bit.ZERO, Bit.ONE, Bit.ZERO, Bit.ONE);
+
+
+ while(Simulation.TIMELINE.hasNext())
+ {
+ Simulation.TIMELINE.executeNext();
+ }
+ assertTrue(Arrays.equals(gate.getOut().getValues(), new Bit[] { Bit.ONE, Bit.ONE, Bit.ZERO, Bit.ONE }));
+ }
+
+ @Test
+ void rsLatchCircuitTest()
+ {
+ Simulation.TIMELINE.reset();
+ WireArray r = new WireArray(1, 1), s = new WireArray(1, 1), t1 = new WireArray(1, 15), t2 = new WireArray(1, 1), q = new WireArray(1, 1),
+ nq = new WireArray(1, 1);
+
+ new OrGate(1, r, nq, t2);
+ new OrGate(1, s, q, t1);
+ new NotGate(1, t2, q);
+ new NotGate(1, t1, nq);
+
+ s.feedSignals(Bit.ONE);
+ r.feedSignals(Bit.ZERO);
+
+ while(Simulation.TIMELINE.hasNext())
+ {
+ Simulation.TIMELINE.executeNext();
+ }
+
+ assertEquals(q.getValue(), Bit.ONE);
+ assertEquals(nq.getValue(), Bit.ZERO);
+
+ s.feedSignals(Bit.ZERO);
+
+ while(Simulation.TIMELINE.hasNext())
+ {
+ Simulation.TIMELINE.executeNext();
+ }
+
+ assertEquals(q.getValue(), Bit.ONE);
+ assertEquals(nq.getValue(), Bit.ZERO);
+
+ r.feedSignals(Bit.ONE);
+
+ while(Simulation.TIMELINE.hasNext())
+ {
+ Simulation.TIMELINE.executeNext();
+ }
+
+ assertEquals(q.getValue(), Bit.ZERO);
+ assertEquals(nq.getValue(), Bit.ONE);
+ }
+
+ @Test
+ void numericValueTest()
+ {
+ Simulation.TIMELINE.reset();
+
+ WireArray a = new WireArray(4, 1);
+ a.feedSignals(Bit.ONE, Bit.ONE, Bit.ONE, Bit.ONE);
+
+ while(Simulation.TIMELINE.hasNext())
+ {
+ Simulation.TIMELINE.executeNext();
+ }
+
+ assertEquals(a.getUnsignedValue(), 15);
+ assertEquals(a.getSignedValue(), -1);
+ }
+}
--- /dev/null
+package era.mi.logic.timeline;
+
+import java.util.PriorityQueue;
+
+/**
+ * Orders Events by the time they are due to be executed. Can execute Events individually.
+ * @author Fabian Stemmler
+ *
+ */
+public class Timeline
+{
+ private PriorityQueue<InnerEvent> events;
+ private long currentTime = 0;
+
+ public Timeline(int initCapacity)
+ {
+ events = new PriorityQueue<InnerEvent>(initCapacity, (a, b) -> {
+ //Is this really necessary? If only ints are allowed as relative timing, the difference should always be an int
+ long difference = a.getTiming() - b.getTiming();
+ if(difference == 0)
+ return 0;
+ return difference < 0 ? -1 : 1;
+ });
+ }
+
+ public boolean hasNext()
+ {
+ return !events.isEmpty();
+ }
+
+ public void executeNext()
+ {
+ InnerEvent first = events.poll();
+ currentTime = first.getTiming();
+ first.run();
+ }
+
+ public long getSimulationTime()
+ {
+ return currentTime;
+ }
+
+ public void reset()
+ {
+ events.clear();
+ currentTime = 0;
+ }
+
+ /**
+ * Adds an Event to the {@link Timeline}
+ * @param function The {@link TimelineEventHandler} that will be executed, when the {@link InnerEvent} occurs on the timeline.
+ * @param relativeTiming The amount of MI ticks in which the {@link InnerEvent} is called, starting from the current time.
+ */
+ public void addEvent(TimelineEventHandler function, int relativeTiming)
+ {
+ long timing = currentTime + relativeTiming;
+ events.add(new InnerEvent(function, new TimelineEvent(timing), timing));
+ }
+
+ private class InnerEvent
+ {
+
+ private final long timing;
+ private final TimelineEventHandler function;
+ private final TimelineEvent event;
+
+ /**
+ * Creates an {@link InnerEvent}
+ * @param function {@link TimelineEventHandler} to be executed when the {@link InnerEvent} occurs
+ * @param timing Point in the MI simulation {@link Timeline}, at which the {@link InnerEvent} is executed;
+ */
+ InnerEvent(TimelineEventHandler function, TimelineEvent event, long timing)
+ {
+ this.function = function;
+ this.event = event;
+ this.timing = timing;
+ }
+
+ public long getTiming()
+ {
+ return timing;
+ }
+
+ public void run()
+ {
+ function.handle(event);
+ }
+
+ }
+}
\ No newline at end of file
--- /dev/null
+package era.mi.logic.timeline;
+
+public class TimelineEvent
+{
+ private final long timing;
+
+ TimelineEvent(long timing)
+ {
+ super();
+ this.timing = timing;
+ }
+
+ public long getTiming()
+ {
+ return timing;
+ }
+}
\ No newline at end of file
--- /dev/null
+package era.mi.logic.timeline;
+
+public interface TimelineEventHandler
+{
+ public void handle(TimelineEvent e);
+}
\ No newline at end of file
projects / Mograsim.git / commitdiff