about summary refs log tree commit diff stats
path: root/mu.arc.t
Commit message (Collapse)AuthorAgeFilesLines
* 181 - fix inconsistent metadataKartik K. Agaram2014-10-301-8/+8
| | | | | We have cases where 'type' is stored in memory, so it can't be a literal type like 'offset'.
* 180Kartik K. Agaram2014-10-301-0/+14
|
* 179Kartik K. Agaram2014-10-301-1/+14
|
* 174 - experiment: communicating errors between routinesKartik K. Agaram2014-10-291-2/+16
| | | | Who does cleanup? That comes later, with custodians.
* 173Kartik K. Agaram2014-10-291-2/+2
|
* 170 - stack frame supportKartik K. Agaram2014-10-291-0/+14
| | | | | When the current context has a 'default-scope', directly-addressed memory offsets off of it.
* 166Kartik K. Agaram2014-10-291-3/+3
|
* 165Kartik K. Agaram2014-10-291-10/+10
|
* 164 - start of a simple tangling systemKartik K. Agaram2014-10-291-0/+13
|
* 163 - start of a simple assemblerKartik K. Agaram2014-10-291-0/+13
|
* 161Kartik K. Agaram2014-10-291-2/+2
|
* 159 - putting types table in test file was a bad ideaKartik K. Agaram2014-10-281-38/+7
| | | | We could no longer just create .mu files and run them on the command line.
* 157 - 'new-list' handles integersKartik K. Agaram2014-10-251-9/+37
|
* 156 - new primitive for lifting into tagged-types: 'save-type'Kartik K. Agaram2014-10-241-1/+15
|
* 155Kartik K. Agaram2014-10-241-2/+5
|
* 153Kartik K. Agaram2014-10-241-69/+79
|
* 152Kartik K. Agaram2014-10-181-70/+70
|
* 151Kartik K. Agaram2014-10-181-1/+1
|
* 149 - get rid of 'type' and 'otype' in favor of tagged types for dispatchKartik K. Agaram2014-10-141-67/+61
|
* 148 - better idiom for generic functionsKartik K. Agaram2014-10-141-91/+106
|
* 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
|