| Commit message (Collapse) | Author | Age | Files | Lines |
|---|
| |
|
|
| |
Chessboard now *almost* handles backspace perfectly.
|
| |
|
|
|
| |
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.
|
| |
|
|
|
| |
Use asynchronous channels like 'stdin' for most tests.
Use the synchronous fakes for testing low-level stdin helpers.
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
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.
|
| |
|
|
|
|
|
|
|
|
| |
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.
|
| | |
|
| |
|
|
| |
Tests for terminating when there's just helpers left.
|
| | |
|
| | |
|
| | |
|
| | |
|
| |
|
|
| |
Fork syntax is now: fork <function> [global space] [max cycle limit] args*
|
| | |
|
| |
|
|
|
| |
Disquieting that I can't make each of these five tests fail in
isolation. We have to fix them all at once.
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| |
|
|
| |
Still no reason uncovered to avoid non-pointers.
|
| |
|
|
|
|
|
| |
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).
|
| | |
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
'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.
|
| | |
|
| |
|
|
|
| |
We achieve this by separating out the freezing of system software, which
we needed to do anyway to address the duplication in 'init-fn'.
|
| |
|
|
|
|
|
|
|
| |
To inform it about space metadata you have to tag environments with the
function that generated them. Every function can only ever be called
with environments generated by a single function. As an assembly-like
language, mu requires closures to be called with an explicit
environment, but it warns when the environment might not be what the
function expects.
|
| |
|
|
|
|
|
|
|
|
| |
How did this work until now? The reply was being treated as a label, and
if 'write' returned nothing it would still work fine because the output
is already present, and a missing 'reply' leaves oargs as-is.
Should we do something to catch this? Perhaps we should track args
modified and check that there are oargs for them. But that seems quite
heavyweight.. Maybe we should clear oargs when missing a 'reply'?
|
| | |
|
| |
|
|
| |
This wasn't working until I fixed 459.
|
| |
|
|
|
| |
No need for a separate channels array; just pass channels in globals.
The global space is a superset of unix's fd array.
|
| |
|
|
| |
But we don't do nonsense like copy all state from the parent routine.
|
| | |
|
| | |
|
| | |
|
| |
|
|
|
| |
This is the first step to creating closures. That requires specifying
the lexical scope 'frame' to read a variable from.
|
| |
|
|
|
|
|
|
| |
Clear up that ancient todo.
We don't particularly care about what abstraction we write tests at, as
long as we do so at *some* layer and document the intent. That lets us
move tests up or down in the future when we know more/have better taste.
|
| | |
|
| |
|
|
|
|
|
|
|
|
|
| |
Was dropped in commit 149. But we need it for more convenient
overloading, especially now that the right way to build tagged-values is
unclear.
The original concern was that type/otype would make code harder to
'assemble' down to native. But we should be able to insert CALL
instructions to the right clause inside a function's code. So keep it
around in the toolbox.
|
| | |
|
| | |
|
| | |
|
| | |
|
| |
|
|
|
|
|
|
|
|
|
|
|
| |
Biggest change was to the interface to the 'sizeof' helper. Where it
used to accept either a type symbol or a cons operand, it now always
accepts an operand, though the value of the operand can be _. In the
process the implementation is radically simpler.
Also reorg'd unit tests a little, putting those for 'deref' before
'sizeof'.
Finally, I'm giving in and enabling the printing of test names as
they're run. We still need this all the time in our surgery.
|
| | |
|
| | |
|