| Commit message (Collapse) | Author | Age | Files | Lines |
| |
|
|
|
|
|
| |
Small change to mu.subx to keep the treeshaker working with it. That's
currently the only place where we prevent jumps across 'functions'.
|
| |
|
| |
|
| |
|
| |
|
|
|
|
| |
$ ./translate_subx init.linux 0*.subx && ./a.elf test
|
|
|
|
| |
Typo in stats: use the same measures as in previous lines.
|
|
|
|
|
|
|
|
|
| |
Maybe not quite. One final issue: length is denominated in bytes, which
is abstraction-busting and all, but dashed inconvenient.
Unfortunately x86 doesn't have a divide instruction that takes an immediate
:( So I'm not sure how to transparently perform the division without needing
some extra register.
|
| |
|
|
|
|
|
| |
It was premature to say user-defined record types and array types were
done.
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
|
|
|
|
|
|
|
| |
Rather surprisingly, all the treeshake tooling is done in just about 2
hours of work. From now on it'll be easier to update stats.txt. Observations:
a) Binaries are tiny compared to conventional stacks. Tens of KB.
b) ~80% of binaries are tests and unused libraries in all my apps.
c) ~75% of LoC in SubX sources are tests or comments.
|
|
|