mu - Soul of a tiny new machine. More thorough tests → More comprehensible and rewrite-friendly software → More resilient society.

	Commit message (Collapse)	Author	Age	Files	Lines
*	5085 - 'assort' phase done!	Kartik Agaram	2019-04-12	1	-0/+10
\| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \|	Current plan for SubX translator: $ cat files.subx ... \|assort \|pack \|survey \|hex > a.out Higher-level notations will be inserted at the start of the pipeline. The first (and needed for bootstrapping) is for string literals. $ cat files.subx ... \|string-literals \|assort \|pack \|survey \|hex > a.out Alternatively, we should check how often we use string literals and just convert them by hand. They're used all over in tests, and converting them would make tests hard (even harder) to read.
*	5058	Kartik Agaram	2019-04-05	1	-1/+1
\|
*	4962	Kartik Agaram	2019-02-14	1	-38/+40
\| \| \| \| \|	Build the C++ version optimized by default when building/running all apps. We have enough apps now that the cost of optimized builds is worthwhile.
*	4939	Kartik Agaram	2019-01-21	1	-0/+10
\|
*	4903	Kartik Agaram	2019-01-03	1	-2/+0
\|
*	4894	Kartik Agaram	2018-12-30	1	-0/+10
\| \| \| \| \| \| \| \| \| \| \| \|	Done with kinda-safe pointers. In a real compiler the fast path of 'lookup' would ideally get inlined. Excluding procedure-call overhead, the current implementation consumes 2 registers besides the input, and requires 9 instructions (2 push, 2 load, compare, jump, increment, 2 pop). That's large enough that inlining may become a trade-off. Even if we somehow magically had the registers already loaded and available, we'd still need 4 instructions (1 pointer dereference, compare, jump and increment). The price of safety.
*	4888	Kartik Agaram	2018-12-29	1	-5/+5
\| \| \| \|	We only can't use rm32=5 when mod=0. Totally fine when it's mod=1.
*	4852	Kartik Agaram	2018-12-06	1	-0/+10
\|
*	4775	Kartik Agaram	2018-11-24	1	-0/+10
\| \| \| \| \| \| \|	Start with an exactly corresponding version to Crenshaw 2-1: single-digit numbers. The only change: we assume the number is in hex. The next version now supports multi-digit hex numbers.
*	4774	Kartik Agaram	2018-11-24	1	-4/+0
\| \| \| \|	Simplification.
*	4763 - back to the 'trivial' crenshaw2-1 compiler	Kartik Agaram	2018-11-23	1	-0/+4
\| \| \| \| \|	This time I've ported (and test-driven) 'GetChar' and 'GetNum'. The new tests bring together our new testable interfaces for read() and exit().
*	4744	Kartik Agaram	2018-11-17	1	-2/+2
\|
*	4729	Kartik Agaram	2018-10-28	1	-2/+2
\| \| \| \| \| \|	Start injecting all dependencies in the Crenshaw compiler app. In the process I realized the non-fake code path of 'stop' had a bug.
*	4727 - commit to better 64-bit support	Kartik Agaram	2018-10-27	1	-15/+14
\| \| \| \| \| \| \|	I've started testing more regularly on 64-bit Linux, and I realize that the binaries actually now compare identical even on 64-bit. Why did I ever add that condition to CI? Seems to be working now on Travis. Let's start comparing now and see if the problem happens again.
*	4684	Kartik Agaram	2018-10-11	1	-1/+7
\| \| \| \| \| \| \| \| \| \|	Turns out the tests for 'trace' have been broken in native mode since the original commit (4674). Dangers of running my tests on Darwin, where I can't run them natively. The test failures didn't get flagged on CI because I'd forgotten to update the exit code of the factorial app in commit 4664. At least that's fixed in this commit.
*	4664 - subx: reflect test failures in exit status	Kartik Agaram	2018-10-05	1	-13/+5
\|
*	4648	Kartik Agaram	2018-10-01	1	-0/+8
\|
*	4647 - support 64-bit Linux in CI	Kartik Agaram	2018-10-01	1	-0/+148
	Generated 32-bit binaries are different on 64-bit. So let's compare them only on a 32-bit platform. And let's start also verifying their run-time behavior on Linux.