about summary refs log tree commit diff stats
Commit message (Collapse)AuthorAgeFilesLines
...
* 133 - handle missing args without errorKartik K. Agaram2014-10-122-2/+17
|
* 132Kartik K. Agaram2014-10-111-2/+3
|
* 131 - maybe-coerce now allocates new space each callKartik K. Agaram2014-10-112-17/+56
| | | | | | | | | | | | | | | | | | | | | | (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,
c{0: 0 (((1 integer)) <- ((copy)) ((1 literal))) -- nil
c{0: 1 (((2 integer)) <- ((copy)) ((3 literal))) -- nil
c{0: 2 (((test1))) -- nil
c{1: 0 ✓ (((1 integer)) <- ((copy)) ((1 literal)))
c{1: 1 ✓ (((2 integer)) <- ((copy)) ((3 literal)))
c{1: 2 ✓ (((test1)))
c{0: 0 (((3 integer)) <- ((add)) ((1 integer)) ((2 integer))) -- nil
c{1: 0 ✓ (((3 integer)) <- ((add)) ((1 integer)) ((2 integer)))
cn0: convert-names in main
cn0: (((1 integer)) <- ((copy)) ((1 literal))) nil nil
cn0: checking arg ((1 literal))
cn0: checking oarg ((1 integer))
maybe-add: ((1 integer))
cn0: (((2 integer)) <- ((copy)) ((3 literal))) nil nil
cn0: checking arg ((3 literal))
cn0: checking oarg ((2 integer))
maybe-add: ((2 integer))
cn0: (((test1))) nil nil
cn0: convert-names in test1
cn0: (((3 integer)) <- ((add)) ((1 integer)) ((2 integer))) nil nil
cn0: checking arg ((1 integer))
maybe-add: ((1 integer))
cn0: checking arg ((2 integer))
maybe-add: ((2 integer))
cn0: checking oarg ((3 integer))
maybe-add: ((3 integer))
cn1: (((1 integer)) <- ((copy)) ((1 literal)))
cn1: (((2 integer)) <- ((copy)) ((3 literal)))
cn1: (((test1)))
cn1: (((3 integer)) <- ((add)) ((1 integer)) ((2 integer)))
schedule: main
run: main 0: (((1 integer)) <- ((copy)) ((1 literal)))
run: main 0: 1 => ((1 integer))
mem: ((1 integer)): 1 <= 1
run: main 1: (((2 integer)) <- ((copy)) ((3 literal)))
run: main 1: 3 => ((2 integer))
mem: ((2 integer)): 2 <= 3
run: main 2: (((test1)))
run: test1/main 0: (((3 integer)) <- ((add)) ((1 integer)) ((2 integer)))
mem: ((1 integer)) => 1
mem: ((2 integer)) => 3
run: test1/main 0: 4 => ((3 integer))
mem: ((3 integer)): 3 <= 4
schedule: done with routine nil
rtions'>+82 | * 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-072-152/+150 | * 115Kartik K. Agaram2014-10-071-4/+4 | * 114 - break/continue always availableKartik K. Agaram2014-10-071-1/+1 | * 113 - slight progress working with screen 2D arrayKartik K. Agaram2014-10-063-6/+70 | | | | | Why did it take forever to realize nobody will set the array length, that I have to do it for myself? * 112Kartik K. Agaram2014-10-062-2/+15 | * 111 - no, can't mix array and record accessKartik K. Agaram2014-10-052-26/+52 | | | | records need literal offsets; arrays need variables. * 110 - 107 for 'get-address'Kartik K. Agaram2014-10-052-0/+15 | * 109Kartik K. Agaram2014-10-052-1/+2 | * 108Kartik K. Agaram2014-10-051-14/+0 | * 107 - 'get' can now take an addressKartik K. Agaram2014-10-052-0/+32 | * 106Kartik K. Agaram2014-10-051-5/+5 | * 105Kartik K. Agaram2014-10-051-0/+1 | * 104 - writing to fields/indicesKartik K. Agaram2014-10-052-0/+45 | * 103 - error on unknown opKartik K. Agaram2014-10-051-1/+3 | * 102 - fold 'aref' into 'get'Kartik K. Agaram2014-10-052-10/+32 | | | | Also separate op for length of an array. * 101Kartik K. Agaram2014-10-051-1/+1 | * 100Kartik K. Agaram2014-10-052-3/+7 | * 99 - edit.mu looks much cleaner nowKartik K. Agaram2014-10-051-17/+8 | * 98 - getting sick of loading literals before useKartik K. Agaram2014-10-052-4/+15 | * 97Kartik K. Agaram2014-10-051-1/+1 | * 96Kartik K. Agaram2014-10-051-0/+3 | * 95Kartik K. Agaram2014-10-042-18/+44 | * 94 - old multiprocessing experimentKartik K. Agaram2014-10-042-1/+20 | * 93 - new project: a text-mode editorKartik K. Agaram2014-10-041-0/+17 | | | | New planet racket dependency: neil/charterm:3:1 * 92Kartik K. Agaram2014-08-312-5/+3 | * 91 - just implement ops natively to maintain momentumKartik K. Agaram2014-08-312-0/+4 | * 90Kartik K. Agaram2014-08-311-5/+5 | * 89 - a simple round-robin schedulerKartik K. Agaram2014-08-282-5/+37 | * 88 - a different trace testing helperKartik K. Agaram2014-08-281-13/+30 | | | | Verifies a set of lines in order. * 87Kartik K. Agaram2014-08-281-2/+5 | * 86Kartik K. Agaram2014-08-281-6/+0 | * 85 - trace testing ahoy (http://akkartik.name/post/tracing-tests)Kartik K. Agaram2014-08-281-0/+26 | * 84Kartik K. Agaram2014-08-282-45/+60 |