about summary refs log tree commit diff stats
Commit message (Collapse)AuthorAgeFilesLines
* 4185Kartik K. Agaram2018-01-247-102/+158
|
* 4184Kartik K. Agaram2018-01-241-1/+13
|
* 4183Kartik K. Agaram2018-01-246-188/+203
|
* 4182 - subx: beginnings of support for indexed addressingKartik K. Agaram2018-01-241-0/+45
|
* 4181Kartik K. Agaram2018-01-214-374/+374
|
* 4180Kartik K. Agaram2018-01-031-2/+7
| | | | Incomplete implementation of `xchg` since commit 4175.
* 4179 - experiment: rip out memory reclamationKartik K. Agaram2018-01-0316-1463/+151
| | | | | | | | | | | | | | | | | | | | | I have a plan for a way to avoid use-after-free errors without all the overheads of maintaining refcounts. Has the nice side-effect of requiring manual memory management. The Mu way is to leak memory by default and build tools to help decide when and where to expend effort plugging memory leaks. Arguably programs should be distributed with summaries of their resource use characteristics. Eliminating refcount maintenance reduces time to run tests by 30% for `mu edit`: this commit parent mu test: 3.9s 4.5s mu test edit: 2:38 3:48 Open questions: - making reclamation easier; some sort of support for destructors - reclaiming local scopes (which are allocated on the heap) - should we support automatically reclaiming allocations inside them?
* 4178Kartik K. Agaram2017-12-312-23/+20
|
* 4177Kartik K. Agaram2017-12-311-0/+1
| | | | Fix CI.
* 4176Kartik K. Agaram2017-12-312-2/+2
|
* 4175Kartik K. Agaram2017-12-301-0/+21
|
* 4174Kartik K. Agaram2017-12-301-0/+72
| | | | Temporary hack to debug Kragen Sitaker's VM.
* 4173Kartik K. Agaram2017-12-301-2/+2
|
* 4172Kartik K. Agaram2017-12-301-2/+2
|
* 4171Kartik K. Agaram2017-12-301-7/+7
|
* 4170Kartik K. Agaram2017-12-301-2/+2
|
* 4169Kartik K. Agaram2017-12-302-40/+22
|
* 4168Kartik K. Agaram2017-12-302-104/+104
|
* 4167 - show square colors in chessboard appKartik K. Agaram2017-12-272-400/+420
|
* 4166Kartik K. Agaram2017-12-272-20/+20
|
* 4165Kartik K. Agaram2017-12-2739-307/+317
|
* 4164Kartik K. Agaram2017-12-2714-40/+57
|
* 4163Kartik K. Agaram2017-12-243-3/+3
|
* 4162Kartik K. Agaram2017-12-2219-360/+310
|
* 4161Kartik K. Agaram2017-12-15135-1475/+1520
|
* 4160 - named marks for delimited continuationsKartik K. Agaram2017-12-158-54/+74
| | | | | Hypothesis: this is needed to build McCarthy's amb operator. https://rosettacode.org/wiki/Amb
* 4159Kartik K. Agaram2017-12-102-3/+30
| | | | | Many continuation examples were failing since commit 4151. Include one of them as a test.
* 4158Kartik K. Agaram2017-12-091-0/+4
|
* 4157Kartik K. Agaram2017-12-092-33/+33
|
* 4156Kartik K. Agaram2017-12-072-2/+2
|
* 4155Kartik K. Agaram2017-12-0767-6049/+6317
|
* 4154Kartik K. Agaram2017-12-071-0/+89
| | | | | All the bugfixes since commit 4135 have been aimed at getting this example program work.
* 4153Kartik K. Agaram2017-12-071-2/+3
|
* 4152Kartik K. Agaram2017-12-072-1/+12
|
* 4151 - specializing calls returning continuationsKartik K. Agaram2017-12-072-2/+30
|
* 4150Kartik K. Agaram2017-12-071-15/+15
|
* 4149Kartik K. Agaram2017-12-071-1/+4
|
* 4148Kartik K. Agaram2017-12-072-2/+16
|
* 4147Kartik K. Agaram2017-12-071-2/+6
|
* 4146Kartik K. Agaram2017-12-071-2/+0
|
* 4145 - specializing recipe literals in `call`Kartik K. Agaram2017-12-073-24/+60
|
* 4144Kartik K. Agaram2017-12-071-23/+23
|
* 4143Kartik K. Agaram2017-12-071-22/+24
|
* 4142Kartik K. Agaram2017-12-051-8/+6
|
* 4141Kartik K. Agaram2017-12-051-20/+21
| | | | | Cleaner way to redo commit 2479 from just over two years ago, fixing scenario specialize_recursive_shape_shifting_recipe.
* 4140Kartik K. Agaram2017-12-051-1/+1
|
* 4139Kartik K. Agaram2017-12-055-28/+15
|
* 4138Kartik K. Agaram2017-12-054-5/+5
|
* 4137 - perform specialization on indirect callsKartik K. Agaram2017-12-042-9/+39
| | | | https://lobste.rs/s/esqphf/what_are_you_working_on_this_week#c_ajgfim
* 4136Kartik K. Agaram2017-12-042-4/+5
|
generated by cgit-pink 1.4.1-2-gfad0 (git 2.36.2.497.gbbea4dcf42) at 2024-11-19 03:58:27 +0000