about summary refs log tree commit diff stats
path: root/mu.arc.t
Commit message (Collapse)AuthorAgeFilesLines
* 722 - split at substring, and assorted helpersKartik K. Agaram2015-02-081-0/+70
|
* 720 - substring matching and searchingKartik K. Agaram2015-02-081-0/+169
|
* 718 - disable raw memory warnings in testsKartik K. Agaram2015-02-081-0/+2
|
* 712Kartik K. Agaram2015-02-071-0/+14
|
* 711 - extract method: string-copyKartik K. Agaram2015-02-071-0/+1
|
* 708Kartik K. Agaram2015-02-051-10/+10
|
* 706Kartik K. Agaram2015-02-041-0/+83
|
* 705 - clean up traces before we try to parse themKartik K. Agaram2015-02-031-14/+16
| | | | | | | | | | For now we want to parse two labels: 'run', identifying call stack, op and args 'mem', distinguishing reads and writes This should give us fodder for a few weeks, to build both a folding UI for individual statements and descending the call stack, and also a query engine that can figure out sources and sinks in the trace graph.
* 689Kartik K. Agaram2015-01-311-1/+3
| | | | Typo in a recent test.
* 677 - more improvements for names in shared spacesKartik K. Agaram2015-01-291-1/+54
|
* 676 - allow routines to share *names* for localsKartik K. Agaram2015-01-291-0/+26
|
* 675Kartik K. Agaram2015-01-291-2/+2
|
* 635Kartik K. Agaram2015-01-261-1/+39
|
* 634Kartik K. Agaram2015-01-261-0/+35
|
* 630 - routines can now allocate unlimited memoryKartik K. Agaram2015-01-261-0/+2
|
* 629Kartik K. Agaram2015-01-261-1/+33
|
* 628Kartik K. Agaram2015-01-261-0/+27
|
* 627Kartik K. Agaram2015-01-261-0/+25
|
* 626 - start eliminating the memory-per-routine limitKartik K. Agaram2015-01-261-0/+23
|
* 625 - guard against errors with input-output argsKartik K. Agaram2015-01-251-0/+30
| | | | | | | | | | | (Another attempt at 623.) I dunno, this may all be a wild goose chase. I haven't been disciplined in tagging in-out arguments in 'read-move' and its helpers. Maybe I should just drop those 'nochange' oargs in 'read' and 'write'. Maybe I should reserve output args only for return values that callers might actually care about, and use more conventional metadata like 'const' or 'unique' or 'inout' on other args.
* 624 - no, that's all wrong, scratch 623Kartik K. Agaram2015-01-251-53/+23
|
* 623 - 'nochange' to guard against race conditionsKartik K. Agaram2015-01-251-23/+53
| | | | | | | | | I dunno, this may all be a wild goose chase. I haven't been disciplined in tagging in-out arguments in 'read-move' and its helpers. Maybe I should just drop those 'nochange' oargs in 'read' and 'write'. Maybe I should reserve output args only for return values that callers might actually care about, and use more conventional metadata like 'const' or 'unique' or 'inout' on other args.
* 616 - buffered-stdin handles backspaceKartik K. Agaram2015-01-251-0/+34
| | | | Chessboard now *almost* handles backspace perfectly.
* 604 - new function to buffer stdinKartik K. Agaram2015-01-241-0/+72
| | | | | Still surprisingly hard to debug. We might be barking up the wrong tree. Or we might just need to lump it. System software is hard.
* 600 - fake keyboardKartik K. Agaram2015-01-221-3/+31
| | | | | Use asynchronous channels like 'stdin' for most tests. Use the synchronous fakes for testing low-level stdin helpers.
* 599Kartik K. Agaram2015-01-211-1/+0
|
* 598 - clear up a minor mysteryKartik K. Agaram2015-01-211-0/+1
|
* 597Kartik K. Agaram2015-01-211-0/+14
|
* 592Kartik K. Agaram2015-01-181-2/+5
|
* 582 - first tests for printing to screenKartik K. Agaram2015-01-171-0/+26
|
* 576 - helper for printing integersKartik K. Agaram2015-01-171-0/+35
| | | | | | | | | | | | | | | This requires creating a new data structure called buffer, because strings are too inefficient for appending to, and we need to know how long they need to be before we clear them. But I'm not gonna bother to write tests for all the new primitives I just introduced, because that's not expedient. One test for mu is how nicely it handles situations like this without requiring perfect test hygiene. In this case, I can imagine tools that will extract tests for a particular function out of all known tests. Especially if it's a pure function that should be easy. Then just show each test to the programmer and ask him to give it a reasonable name.
* 569 - ah, the right way to do generic functionsKartik K. Agaram2015-01-141-0/+2
| | | | | | | | | | Each clause creates its own default-space for local variables. Now we can justify prepending bodies on every 'function' form. Later we can optimize away the duplicate default-spaces. Another cost: we can't mindlessly use 'next-input' anymore. Pity.
* 564Kartik K. Agaram2015-01-141-679/+679
|
* 542Kartik K. Agaram2015-01-121-0/+52
| | | | Tests for terminating when there's just helpers left.
* 529 - 'sleep' can now wait for a routine to completeKartik K. Agaram2015-01-101-0/+26
|
* 528Kartik K. Agaram2015-01-101-3/+4
|
* 525 - 'fork' now returns a routine idKartik K. Agaram2015-01-101-0/+30
|
* 524Kartik K. Agaram2015-01-101-14/+14
|
* 522 - another arg for 'fork'Kartik K. Agaram2015-01-101-5/+23
| | | | Fork syntax is now: fork <function> [global space] [max cycle limit] args*
* 519 - ooh, use metadata to disambiguate argsKartik K. Agaram2015-01-101-5/+5
|
* 515 - support time limits for threadsKartik K. Agaram2015-01-101-0/+124
| | | | | Disquieting that I can't make each of these five tests fail in isolation. We have to fix them all at once.
* 514Kartik K. Agaram2015-01-091-16/+18
|
* 512 - update html renderingKartik K. Agaram2015-01-091-191/+227
|
* 511 - make 'sleep' clearerKartik K. Agaram2015-01-081-13/+13
|
* 510Kartik K. Agaram2015-01-081-2/+2
|
* 509Kartik K. Agaram2015-01-081-23/+23
|
* 506 - continue 505Kartik K. Agaram2015-01-061-21/+27
| | | | Still no reason uncovered to avoid non-pointers.
* 505 - simplify tagged-valueKartik K. Agaram2015-01-051-37/+26
| | | | | | | I could swear there was an issue earlier where tagged-values had to contain pointers for some core function. But I can't find it anymore. Ok, assume we can store primitives in it and pointers only for aggregates (and-records and arrays).
* 500Kartik K. Agaram2015-01-021-1/+1
|
* 497 - strengthen the concept of 'space'Kartik K. Agaram2015-01-021-83/+83
| | | | | | | | | | | | | | | | | | | | 'default-scope' is now 'default-space' 'closure-generator' is now 'next-space-generator' The connection to high-level syntax for closures is now tenuous, so we'll call the 'outer scope' the 'next space'. So, let's try to create a few sentences with all these related ideas: Names map to addresses offset from a default-space when it's provided. Spaces can be strung together. The zeroth variable points to the next space, the one that is accessed when a variable has /space:1. To map a name to an address in the next space, you need to know what function generated that space. A corollary is that the space passed in to a function should always be generated by a single function. Spaces can be used to construct lexical scopes and objects.