about summary refs log tree commit diff stats
path: root/mu.arc.t
Commit message (Collapse)AuthorAgeFilesLines
* 147Kartik K. Agaram2014-10-141-33/+33
|
* 144Kartik K. Agaram2014-10-141-0/+7
|
* 143Kartik K. Agaram2014-10-121-7/+7
|
* 142 - helper for listsKartik K. Agaram2014-10-121-1/+1
| | | | | Amazing how easy it was to just dump the trace and diff, compared to my old approach of adding new traces and rerunning.
* 141 - list nodes using tagged-valueKartik K. Agaram2014-10-121-1/+46
|
* 140Kartik K. Agaram2014-10-121-3/+16
|
* 139Kartik K. Agaram2014-10-121-1/+14
|
* 138Kartik K. Agaram2014-10-121-5/+3
| | | | | | | | Current todo stack: trace-based assert new-tagged-value - assert that first arg has size 1 test constructing list manually new-list
* 137Kartik K. Agaram2014-10-121-3/+38
|
* 135Kartik K. Agaram2014-10-121-0/+16
|
* 134 - 'arg' explicitly tells us if an arg was foundKartik K. Agaram2014-10-121-0/+15
| | | | | | Return values can be ignored in mu, in the grand traditions of C programming. Though library writers can impose their conservatism on callers by returning the error condition first.
* 133 - handle missing args without errorKartik K. Agaram2014-10-121-1/+15
|
* 132Kartik K. Agaram2014-10-111-2/+3
|
* 131 - maybe-coerce now allocates new space each callKartik K. Agaram2014-10-111-2/+32
| | | | | | | | | | | | | | | | | | | | | | (Doesn't reclaim yet. Need to build free soon. Then lexical scopes..) This commit showed the benefits of my persisting traces. I realized I needed 'sz' to handle 'deref' args. But I vaguely remembered some earlier instance when some primitive needed to recognize 'deref' at some times but not others. Was it 'sz'? Just added a trace on operands, reran all tests, grepped for deref. $ grep sz .traces -r |grep deref Nothing would fail. Ok, add 'deref' support. Boom, 3 layers of tests passed. Still concerned I'm not using traces enough. Keep vigilant. Mixing print and trace seems like a bad idea. From now on whenever I use any existing commented-out prn's I'm going to turn them into trace calls. That should put pressure on comprehending traces, and tools for doing that, like segmenting by dynamic and static layers.
* 130 - build maybe-coerce in muKartik K. Agaram2014-10-111-3/+4
| | | | | This is more likely to be right. But the limitations of symbolic locations are starting to be a drag. Time to build lexical scope.
* 129Kartik K. Agaram2014-10-101-1/+5
|
* 128Kartik K. Agaram2014-10-101-7/+3
|
* 127 - tagged values for dynamic typingKartik K. Agaram2014-10-101-0/+23
| | | | This is almost certainly wrong.
* 126Kartik K. Agaram2014-10-101-59/+59
|
* 123 - experiment: build the reading flow around the *test* fileKartik K. Agaram2014-10-101-165/+419
|
* 120 - forgot to alloc space for array lengthKartik K. Agaram2014-10-071-2/+2
|
* 119 - 'continue' was badly brokenKartik K. Agaram2014-10-071-0/+25
|
* 118 - persist all test tracesKartik K. Agaram2014-10-071-0/+60
|
* 117 - simplify old tests to use literalsKartik K. Agaram2014-10-071-118/+87
|
* 116 - retire 'literal' instruction now that we have 'literal' addressingKartik K. Agaram2014-10-071-150/+150
|
* 112Kartik K. Agaram2014-10-061-1/+14
|
* 111 - no, can't mix array and record accessKartik K. Agaram2014-10-051-6/+22
| | | | records need literal offsets; arrays need variables.
* 110 - 107 for 'get-address'Kartik K. Agaram2014-10-051-0/+12
|
* 109Kartik K. Agaram2014-10-051-1/+1
|
* 107 - 'get' can now take an addressKartik K. Agaram2014-10-051-0/+13
|
* 104 - writing to fields/indicesKartik K. Agaram2014-10-051-0/+25
|
* 102 - fold 'aref' into 'get'Kartik K. Agaram2014-10-051-6/+24
| | | | Also separate op for length of an array.
* 98 - getting sick of loading literals before useKartik K. Agaram2014-10-051-0/+8
|
* 92Kartik K. Agaram2014-08-311-3/+1
|
* 89 - a simple round-robin schedulerKartik K. Agaram2014-08-281-0/+24
|
* 84Kartik K. Agaram2014-08-281-0/+1
|
* 82Kartik K. Agaram2014-08-281-0/+41
|
* 81 - reify machine state into a 'context' variableKartik K. Agaram2014-08-281-37/+41
| | | | Beginning of concurrency primitives.
* 77 - 'new' in the interpreterKartik K. Agaram2014-08-261-0/+24
| | | | | | | | Next we'll try to reimplement it on the simulated machine. But for now, sys.arc is extraneous. Debugging this, the commented out prints started to become onerous enough I couldn't bear to keep them.
* 65 - separate op for array indexingKartik K. Agaram2014-08-211-4/+17
| | | | 'get' no longer supports that case; that was confusing.
* 63Kartik K. Agaram2014-08-211-3/+15
|
* 61 - 'get' for array accessKartik K. Agaram2014-08-211-0/+20
| | | | | get _ 0 => retrieves array length get _ n => retrieves index n-1
* 57 - multi-word or multi-field opsKartik K. Agaram2014-08-191-0/+12
|
* 56 - 'get' for record accessKartik K. Agaram2014-08-191-0/+12
|
* 52Kartik K. Agaram2014-08-191-6/+9
|
* 51Kartik K. Agaram2014-08-191-30/+30
|
* 46 - there's no continue bug after all in anarkiKartik K. Agaram2014-08-021-1/+1
|
* 45 - 'deref' metadata working in output argsKartik K. Agaram2014-07-311-0/+12
| | | | | Likely still some erroneous corner cases. What happens if I try to write indirectly to a boolean value? Should raise a reasonable error.
* 44 - now 'deref' is a bit of metadata on any operand rather than a special opKartik K. Agaram2014-07-311-2/+2
| | | | Still only works in read, and only in a single instruction. But these are details.
* 43 - tests for 'deref' and 'copy'Kartik K. Agaram2014-07-311-0/+21
|
generated by cgit-pink 1.4.1-2-gfad0 (git 2.36.2.497.gbbea4dcf42) at 2024-12-20 20:28:22 +0000