Joseph Ferano
26c53e0a19
The mechanical half, ahead of the parser change that needs it. tools/unit-return.py
fills the empty slot with () and rewrites Unit as () wherever a type is spelled --
(Fn [i32] Unit), (Map i32 Unit), a return type written out.
Deciding whether a defn already had a return type is the whole difficulty, and
the script does it the way parse.ml did: is_type_form is transcribed rather than
improved, because being identical to the parser it replaces is what makes the
sweep meaning-preserving. It is re-runnable, so the lanes that branched before
this can have the same pass at merge:
python3 tools/unit-return.py .
python3 tools/unit-return.py --in-strings test/test_flan.ml test/test_acceptance.ml \
test/test_session.ml emacs/test-flan-dev.el emacs/test-flan-mode.el
python3 tools/unit-return.py --raw-ml lib/prelude.ml
python3 tools/unit-return.py --in-html web/index.html
-v logs every defn it saw and what it decided, which is how a sweep of 440 sites
gets reviewed at all. Embedded modes pool a file's type declarations across all
its fragments, because a snippet split across concatenation -- decls ^ "(defn f
[s [u8]] Cursor ...)" -- cannot see the names the other half declared; pooled
names count only in bare-symbol position, for the same reason the prelude's do.
A fragment that cuts off mid-form is skipped rather than guessed at. Five sites
in test_flan.ml still needed a hand, and they are in this commit.
Two things ride along because the sweep needs them: parse.ml reads a lone () as
the return type of a function with no body, which was not a shape the old
optional slot could produce; and the map refusals name () rather than Unit, since
that is now the spelling a caller wrote.
24 lines
817 B
Plaintext
24 lines
817 B
Plaintext
(defconst rows 3)
|
|
(defconst cols 4)
|
|
|
|
;; A fixed array is a value: inline storage, copies on assignment.
|
|
(defconst palette [4 u32] [0xE6B800FF 0x3B6E8CFF 0xA83232FF 0xCC6B1FFF])
|
|
|
|
;; No initialiser means all-bytes-zero, so this is BSS and costs nothing.
|
|
(defvar grid [rows [cols i32]])
|
|
|
|
(defn main [] ()
|
|
(set (at grid 1 2) 7)
|
|
(print (at grid 1 2)) (println "") ; 7
|
|
(print (len palette)) (println "") ; 4
|
|
|
|
;; A slice is ptr+len and non-owning: it views the array, it does not copy it.
|
|
(let [row (slice (at grid 1) 0 cols)]
|
|
(set (at row 0) 5)
|
|
(print (at grid 1 0)) (println "") ; 5 — the same storage
|
|
(print (sum-i32 row)) (println "")) ; 12
|
|
|
|
;; (zeroed) is a memset, not an allocation.
|
|
(set grid (zeroed))
|
|
(print (at grid 1 2)) (println "")) ; 0
|