JosephFerano/flan
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Merge master; an expression evaluated at a stop runs against a scratch temp arena that is wiped after it, and the program's own temp arena is never rolled back

Browse Source
This commit is contained in:
Joseph Ferano 2026-09-25 14:09:30 +07:00
commit 5646ae148e
63 changed files with 2657 additions and 943 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

47
TODO.org
View File

@ -949,20 +949,9 @@ CLOSED: [2026-09-25]
=(the T expr)= gives any expression its want and =let= stays a flat list of
pairs. Rules out a type slot in =let=.
** NEXT A read-only slice type
Decided 2026-09-25: =[const u8]=, Zig's spelling in Flan's brackets. =bytes-view= answers one and a =set= through it is a compile error; a =[T]= converts to =[const T]= and not back, and the prelude's read-only functions take it. =const= is reserved as a name, since =[n T]= accepts a constant's name for =n=.
=bytes-view= is read-only by convention only — the type system cannot say a =[u8]=
may not be stored through, so a trap on read-only memory is the enforcement. A
read-only slice type, or provenance, is what would move that refusal to compile
time.
** NEXT Writing through a string literal
Decided 2026-09-25: closed by the read-only slice type above.
=(let [s (bytes-view "Hi")] (set (at s 0) \h))= stores into read-only memory at
=-O0= and is deleted as undefined at =-O2= — same source, and which way it fails
depends on a flag. Narrowed when =(bytes s)= started copying, so the common
spelling no longer reaches the edge. Emitting literals as mutable globals is not a
fix: it moves which flag misbehaves and costs their read-only placement.
** DONE A read-only slice type
CLOSED: [2026-09-25]
=[const T]= and =(Ptr const T)=; a =[T]= or =(Ptr T)= converts at the top of a type or under another const one, never inside a writable one. The const is shallow: an element of a =[const [u8]]= and a Vec's buffer are writable. The address of read-only storage, a string's byte included, is a =(Ptr const T)=, and a C =const T *= parameter takes one.
** TODO (slice d 1) over a dyn string is refused where (at d i) works
The typed and dyn spaces disagree about a spelling, which the standing rule
@ -1067,11 +1056,6 @@ An unknown call whose near miss is a value — =(context-allocator)= against
=context/allocator=, or a global — says the name is a value written without
parentheses, and names no call at all when the call had arguments.
** NEXT (Ptr const T), the pointer beside [const T]
Decided 2026-09-25: addr through a read-only slice gives a (Ptr const T), which
nothing writes through; (Ptr T) widens to it and never back; a C parameter
declared const T* takes one. Closes the addr hole in [const T].
* Backends
** DONE The x86 backend tracks LLVM at -O0
@ -1252,7 +1236,7 @@ at disassembly time.
** DONE A temporary allocator, wiped each frame
CLOSED: [2026-09-25]
=i64->bytes= and =f64->bytes= allocate from context/temp, which grows rather than failing. A
dev build wipes it at a top-level agent poll; an expression run at a stop is rolled back to a mark.
dev build wipes it at a top-level agent poll; an expression run at a stop gets a scratch temp arena.
* Runtime
@ -1674,10 +1658,9 @@ nothing sweeps other sessions' directories.
CLOSED: [2026-09-20]
The zero-argument form takes the daemon's socket where there is one and an
announced path where there is not, bound by a constructor before =main=. =Reach=
prunes a package nothing calls into, so the constructor reaches only a program
that polls or waits. Full invisibility — a dev build linking the agent whether or
not the source says so — needs the package force-linked and is a decision about
what =--dev= means.
prunes a package nothing calls into in a release build. =flan dev= links the
agent's C into every program it builds whether or not the source imports it; a
release build links it only when the program calls into it.
** NEXT FLAN_AGENT_SOCKET in a shell's environment steals the socket
Decided 2026-09-25: narrow the gate. The daemon also exports its own pid, and the constructor binds the socket only when that pid is the program's parent (or the program itself, in a merged build).
@ -2066,12 +2049,6 @@ motion states in that mode; every other key, including what =special-mode-map=
binds, stays Evil's. The other special-mode buffers (inspect, watch, doc, disassembly,
diagnostics, lower) have the same exposure and are not changed.
** NEXT C-x C-e in a package's file resolves names in that package
Decided 2026-09-25: CIDER's rule — an evaluation sent from a file resolves names
as code written in that file would, so =(integrate 1.0)= in =physics/step.flan=
reaches the package's own functions, =defn-= included. Today it answers
"unknown function", resolving as the program's main file.
** DONE Evil takes the keys in the other Flan buffers
CLOSED: [2026-09-25]
=flan-evil-own-keys= (flan-mode.el) gives the keys a mode's own map binds to
@ -2152,13 +2129,9 @@ daemon asks for the sink off (=lib/loc.ml:185=) and gets one exception, so a
function with three bad expressions takes three round trips. The sink is
per-phase; making it per-form would need a resync point inside a body.
** NEXT A session should start before a program compiles
Decided 2026-09-25: SBCL/nREPL order: an empty host session, then a load-file op. Re-running with no =main= says there is none; a half-loaded file keeps what compiled and lists the errors. =C-c C-k= is load-file and the inspector moves to =C-c M-i=, CIDER's key.
=flan dev= builds the program first, so a =main= that does not compile gives no
session. Want SBCL/nREPL order: empty image, then load a file into it. Needs a
host built with no user program, and a load-file op — the reload machinery
already builds a file as a module. Open: what =flan-rerun= does with no =main=,
and a half-loaded file. =C-c C-k= is taken by the inspector.
** DONE A session should start before a program compiles
CLOSED: [2026-09-25]
A file with no =main= starts on a stub =main= that returns and parks; =load-file= (=C-c C-k=, already its key — the inspector stays on =C-c C-i=) keeps what compiles and lists the rest. Rules out =flan dev= with no file at all, and =--two-process= on a file with no =main=.
** NEXT The daemon buffer is navigable but not coloured
Decided 2026-09-25: errors, warnings and notes take compilation-mode's faces, and the program's own output takes a face of its own so it reads apart from the compiler's.

4
calc-me.flan
View File

@ -20,7 +20,7 @@
;; ── one by pointer. `addr` takes the address of a local; the pointer never
;; ── outlives the frame, so no allocator is involved.
(defstruct Cursor
[src [u8] ; non-owning slice into argv — calc-me never owns a byte
[src [const u8] ; non-owning slice into argv — calc-me never owns a byte
pos i32]) ; no initialiser means zeroed
(defn peek [c (Ptr Cursor)] u8
@ -105,7 +105,7 @@
(Some lhs)))
;; ── Whole input, or nothing. Trailing junk is an error, not ignored. ──
(defn evaluate [src [u8]] (Option f64)
(defn evaluate [src [const u8]] (Option f64)
(let [c (Cursor {.src src})] ; pos omitted: zeroed
(let [v (some (parse-expr (addr c) 1))]
(skip-spaces (addr c))

22
docs/BUILT.md
View File

@ -1043,7 +1043,7 @@ the only two under which a mark and a sweep run at all. `dev_segv` sits beside t
program that faults cannot be compared against an unsanitized run — that build's handler parks in the break loop, and
the two builds are *supposed* to differ, since `flan_dev_crash_enable` checks a weak `__asan_init` and declines to
install the handler when ASan is in the process. So the case asserts ASan's report and the absence of the handler's
line, built at `-O0` because at `-O2` the write through a bytes-view of a literal does not fault at all. That yield had
line, built at `-O0` because at `-O2` a store through a zeroed `(Ptr u8)` is undefined and need not fault. That yield had
never run in any build anywhere: it was behind a link that did not happen. Twenty-six seconds of the alias's 2m30 warm.
What it still does not reach is a program driven by a real daemon under ASan: `flan dev` builds its host through its own
path and has no `--sanitize` to pass it.
@ -3001,7 +3001,7 @@ fires. The value is two words: the struct's address and the incarnation of it th
| `(clone v)` / `(clone v a)` | the only copy; assignment moves |
| `(free v)` | consumes its argument |
| `(bytes s)` / `(bytes s a)` | a writable copy of a string's bytes, against the context or a named allocator — an allocating operation like `vec-new`: StorageExhausted with retry, a registry note in dev builds. The answer is a `[u8]` view of the block, so nothing can `free` it through the slice; it lives until its allocator's `free-all` or destroy |
| `(bytes-view s)` | the string's own storage as a `[u8]`, costing nothing — the old `(bytes s)` reinterpret, renamed. Read-only by convention: a literal's view points into `.rodata` and a store through it traps |
| `(bytes-view s)` | the string's own storage as a `[const u8]`, costing nothing — the old `(bytes s)` reinterpret, renamed. A store through it is a compile error, because a literal's view points into `.rodata` |
### A view of a `Vec` goes stale at the `push`, and nothing checks it
@ -4182,7 +4182,7 @@ slot and, outside the prelude, copy the text into the temp allocator so it outli
they answer the slot, and these two copy it into the builder, so appending a number allocates nothing beyond the
builder's own growth. `strings.flan` puts two integers and a float on one line.
### `split` answers a `(Vec [u8])`, and the owning shape is unrepresentable
### `split` answers a `(Vec [const u8])`, and the owning shape is unrepresentable
The fields are slices *of the input*. That was not a performance choice when this was written: `(Vec (Vec u8))` was
**refused outright**, so there was no owning shape to have chosen instead. That refusal has since been narrowed — see
@ -4196,7 +4196,7 @@ The rule is `split-on-byte`'s, unchanged: n separators always yield n+1 fields,
field and a trailing separator yields a trailing empty one. That is Odin's allocating `strings.split` and not Odin's
`split_by_byte_iterator`, which disagree with each other on exactly that input.
Constructing it needed a one-line `(defn slices-new [] (Vec [u8]) (vec-new))`, because `check.ml`'s `vec_new_elem`
Constructing it needed a one-line `(defn slices-new [] (Vec [const u8]) (vec-new))`, because `check.ml`'s `vec_new_elem`
takes the element type as a single bare symbol and `[u8]` is not one — so a `(Vec [u8])` can only be made where the
*context* names the type, and a return type is a context while a `let` is not. Written down in TODO.org,
"(vec-new [u8]) is refused", as a compiler gap rather than worked around silently.
@ -4832,7 +4832,7 @@ and the rule is easier to state and to trust with one construct in it.
## Assets are baked in, and the reason it is a compiler feature
TODO.org, "Assets are embedded at compile time". `(embed "brush.png")` is a `[u8]`, `(embed "brush.png" string)` is a `string`, and
TODO.org, "Assets are embedded at compile time". `(embed "brush.png")` is a `[const u8]`, `(embed "brush.png" string)` is a `string`, and
`(embed-dir "assets")` is a `[n EmbedFile]` sorted by name. Odin's `#load` and `#load_directory` are the model
(`src/parser.cpp`, and `check_load_directive` / `check_load_directory_directive` in `src/check_builtin.cpp`); Odin's
`#` is not imported, because an s-expression language already has a head position for a name and these resolve as
@ -4845,12 +4845,12 @@ so a program can never be a package: the single file doing `(rl/load-texture "br
with **no link channel at all**. The web lane found that hole and did not invent a flag for it. Embedding has no such
hole, because there is nothing to tell the linker.
**It costs nothing at run time.** The bytes reach the program as a `Tast.Str` node typed `[u8]`, which emit.ml turns
**It costs nothing at run time.** The bytes reach the program as a `Tast.Str` node typed `[const u8]`, which emit.ml turns
into the same `private unnamed_addr constant` every string literal already becomes, and its `escape` is byte-exact
across the whole 0–255 range, so a PNG survives the round trip through the `.ll`. Bound with `defconst` at top level an
`embed-dir` is an LLVM constant outright, through emit.ml's `const`.
**A `Str` node typed `[u8]`, not a `Bytes` prim over a `string`.** This is the one non-obvious choice. `Bytes` is
**A `Str` node typed `[const u8]`, not a `Bytes` prim over a `string`.** This is the one non-obvious choice. `Bytes` is
identity — emit.ml lowers `Types.String` and `Types.Slice _` to the same `%slice` — but wrapping the literal in a prim
makes the node non-constant, and `const` then refuses an `embed-dir` in a `defconst` with *a global's value must be a
compile-time constant*. Both of emit.ml's string emitters take the bytes and ignore the node's type, so it is the same
@ -4877,11 +4877,9 @@ the call reads `(embed-find (slice assets 0 (length assets)) "brush.png")`. Entr
order is filesystem-dependent and an unsorted embed would make two builds of identical sources emit different `.ll`.
Non-recursive, files only — Odin again.
**The sharp edge, inherited and not widened.** The slice points into `.rodata`, so a store through it segfaults at
`-O0` and is deleted as undefined behaviour at `-O2` — the same trap the prelude's ASCII-case note measures for
`(bytes "Hi")`, and the same one TODO.org tracks as "Writing through a string literal". Nothing here makes it worse and
nothing here fixes it; provenance is what would. **To get a mutable copy, clone the bytes into a `Vec`.** It is worth
saying loudly because an embedded asset is precisely the thing someone will try to decode in place.
**Read-only, and the type says so.** The slice points into `.rodata`, where a store would segfault at `-O0` and be
deleted as undefined behaviour at `-O2`, so it is a `[const u8]` and a store through it is refused at compile time.
To decode an asset in place, copy the bytes into a `Vec` first.
**What this does not do.** `sand.flan` still calls `(rl/load-texture "brush.png")`, which hands raylib a path for
raylib to open. Pointing raylib at embedded bytes needs `LoadImageFromMemory` and `LoadTextureFromImage` in place of

39
emacs/MANUAL.md
View File

@ -90,6 +90,20 @@ stops the program too — but only one this Emacs started. A daemon you launched
in a terminal is not Emacs' to kill, and it will say so rather than do something
surprising.
### A file with no `main`
A file of functions with no `main` — a scratch file, a library being written —
starts a session too. Nothing runs, and the session is there to take
definitions and expressions: `C-x C-e` on `(fib 10)` answers, and `C-c C-k`
loads more into it. `M-x flan-rerun` says there is no `main` until one has been
loaded.
A form in such a file that does not compile is left out of the start and printed
in `*flan*`, and the session starts with the rest.
The program does not have to import the agent. `flan dev` links it into every
program it builds, and a release build is unaffected.
### Which backend the session uses, and what it costs
`flan dev` compiles the session with the hand-written x86-64 backend. That is
@ -195,6 +209,11 @@ The form before point can also be a declaration — a `defonce` typed at the top
a file — in which case `C-x C-e` installs it rather than refusing it, and says
which names changed instead of printing a value.
**Names mean what they mean in the file.** An expression sent from a package's
file resolves as code written in that file would: `(integrate 1.0)` in
`physics/step.flan` reaches `physics/integrate`, a `defn-` included. The REPL is
not a file, so there the program's own names apply.
### `C-u C-c C-c` — stop there
The same key with a prefix argument **marks a form as a breakpoint**. `C-u C-c
@ -261,12 +280,20 @@ drawn on the call — it does not hang.
### `C-c C-k` — the whole buffer
The whole buffer, sent as **one** module rather than as a form at a time. That
matters: a `defonce` and the function that uses it have to arrive together, or the
function refers to storage that does not exist yet.
The whole buffer is loaded into the running program, as `C-c C-k` loads a file in
SLIME and CIDER. It is sent as **one** module rather than as a form at a time.
That matters: a `defonce` and the function that uses it have to arrive together,
or the function refers to storage that does not exist yet.
Use this when you have changed several things at once, or when you have added a
new global.
A form that does not compile is left out, and the rest are installed. A name
that was already in the program keeps its earlier definition, and the forms that
use it are compiled against that one; a form that uses a name defined nowhere
else is left out too. Each form left out is marked in the buffer and listed in
`*flan-diagnostics*`, and the echo area counts them. When nothing compiles,
nothing is installed and the first error is reported as `C-c C-c` reports one.
Use this when you have changed several things at once, when you have added a new
global, or to load a file into a session started on another.
### When it lands
@ -1158,7 +1185,7 @@ Use `C-c C-g` if you need frames.
| `C-c C-c` | the top-level form at point: a declaration installed, anything else evaluated |
| `C-u C-c C-c` | ...and stop at the form point is inside (`C-u C-u`: on entry) |
| `C-M-x` | the same as `C-c C-c`, on the binding SLIME and CIDER use |
| `C-c C-k` | the whole buffer, as one module |
| `C-c C-k` | load the whole buffer, as one module; what does not compile is listed |
| `C-x C-e` | the form before point, evaluated — or installed, if it is a declaration |
| `C-u C-x C-e` | ...and stop at it instead of showing its value |
| `C-c C-z` | connect (finds `.flan-dev.sock` upward) |

6
emacs/flan-mode.el
View File

@ -242,7 +242,9 @@ reason and is the odd one — it is legal only as the last item of a `def' or a
;; resolves and the two function types, `Fn' and `CFn'. `dyn' is
;; lowercase on purpose — it is a primitive beside `i64' and `bool', not
;; a container over something.
;; `int' and `float' are builtin aliases for `i32' and `f32'.
;; `int' and `float' are builtin aliases for `i32' and `f32'. `const'
;; is the reserved word of the read-only slice type, `[const u8]', and is
;; drawn as part of the type it spells.
;;
;; `Unit' is deliberately absent, though `Types.primitive_names' has it.
;; The resolver answers to the name because `Cimport' builds one for C's
@ -250,7 +252,7 @@ reason and is the odd one — it is legal only as the last item of a `def' or a
;; word outright — unit is spelled `()'. Drawing it as a valid type would
;; advertise a spelling the parser rejects, which is the same reason
;; `find-restart' and `await' are left out of `flan--special'.
("\\_<\\(?:[iu]\\(?:8\\|16\\|32\\|64\\)\\|f\\(?:32\\|64\\)\\|bool\\|string\\|dyn\\|int\\|float\\|Never\\|Allocator\\|Ptr\\|Option\\|Vec\\|Map\\|C?Fn\\)\\_>"
("\\_<\\(?:[iu]\\(?:8\\|16\\|32\\|64\\)\\|f\\(?:32\\|64\\)\\|bool\\|string\\|dyn\\|const\\|int\\|float\\|Never\\|Allocator\\|Ptr\\|Option\\|Vec\\|Map\\|C?Fn\\)\\_>"
. font-lock-type-face)
;; A type variable, `$t', which is what a generic `defn' names its
;; parameter types with and what `{:where (ordered? $t)}' constrains.

79
emacs/flan.el
View File

@ -537,7 +537,12 @@ with it, and a rejected evaluation is a likely moment to *become* stopped."
(unless (eq was now)
(force-mode-line-update t)
(when now
(message "flan: the program finished; C-c C-M-x runs it again"))))
;; `:main nil' is a file with no main of its own: nothing ran, and
;; there is nothing to run again until one is loaded.
(if (and (plist-member reply :main) (null (plist-get reply :main)))
(message "flan: the file has no main; C-x C-e and C-c C-k work \
on the session, and C-c C-M-x runs main once one is loaded")
(message "flan: the program finished; C-c C-M-x runs it again")))))
(let ((was flan--stopped)
(now (and (plist-get reply :stopped)
(or (plist-get reply :condition) "a condition"))))
@ -1290,7 +1295,8 @@ one process would be writing the same globals at once."
(defun flan-abort ()
"Let the stopped program die where it stopped.
This ends `flan dev' too: the daemon owns the program's lifetime and has
nothing left to serve once it has gone."
nothing left to serve once it has gone. An expression that stopped while the
program was parked is abandoned instead, and the session stays."
(interactive)
(let ((r (flan--request '(:op "abort"))))
(if (equal (plist-get r :status) "ok")
@ -1680,15 +1686,16 @@ quitting the program — which is the point of it."
(set-marker flan--diagnostics-memory-start nil)
(setq flan--diagnostics-memory-start nil))))
(defun flan--show-error (loc msg)
(defun flan--show-error (loc msg &optional keep)
"Mark MSG at LOC, if LOC names a file some buffer is visiting.
The buffer's other error marks are taken down first unless KEEP is non-nil.
Returns non-nil when it put an overlay somewhere."
(let ((parts (flan--parse-loc loc)))
(when parts
(let ((buf (flan--buffer-visiting (nth 0 parts))))
(when buf
(with-current-buffer buf
(flan-clear-errors buf)
(unless keep (flan-clear-errors buf))
;; A refusal is not a value, and the two must never be drawn over
;; one form at once. Ordinarily the command that ran this
;; evaluation already cleared the last one through the hook; this
@ -1713,7 +1720,8 @@ Returns non-nil when it put an overlay somewhere."
;; Point goes there too, but only in the buffer being looked at:
;; moving point in a buffer nobody is showing is a surprise the
;; next time it is visited.
(when (eq buf (current-buffer)) (goto-char beg))
(when (and (not keep) (eq buf (current-buffer)))
(goto-char beg))
t)))))))
;;; Inline results
@ -2867,18 +2875,57 @@ declaration for it to live in."
;;;###autoload
(defun flan-eval-buffer ()
"Recompile every top-level form in this buffer and install them together.
One module, not one per form: a var and the function that uses it have to
arrive in the same load or the first refers to storage that does not exist."
"Load this buffer into the running program, as `C-c C-k' does in SLIME and CIDER.
Every top-level form is compiled and installed together, as one module: a var
and the function that uses it have to arrive in the same load or the first
refers to storage that does not exist.
A form that does not compile is left out, and the rest are installed. A name
already in the program keeps its earlier definition, and forms that use it are
compiled against that one; a form that uses a name defined nowhere else is
left out too. Each one left out is marked in the buffer and listed in
`flan-diagnostics-buffer'. When nothing compiles, nothing is installed and
the command signals, as `C-c C-c' does."
(interactive)
(flan--eval (buffer-substring-no-properties (point-min) (point-max))
(buffer-name))
;; `flan--eval' signals on a rejection, so reaching here means every
;; declaration in the buffer was just replaced by an unmarked one — and
;; therefore that every mark in it is gone. Done here rather than by passing
;; bounds, because those are also what gets flashed and pulsing a whole
;; buffer is not feedback, it is a flicker.
(flan-clear-pause))
(let* ((reply (flan--request
(list :op "load-file" :file (or buffer-file-name "<buffer>")
:code (buffer-substring-no-properties
(point-min) (point-max)))))
(errors (plist-get reply :errors)))
(if (equal (plist-get reply :status) "ok")
(progn
(flan--report reply (buffer-name))
;; Every declaration that installed was replaced by an unmarked one,
;; so every mark in the buffer is gone. Done here rather than by
;; passing bounds, because those are also what gets flashed and
;; pulsing a whole buffer is not feedback, it is a flicker.
(flan-clear-pause)
(when errors
(flan--report-load-errors errors)
(message "flan: %s loaded; %d form%s did not compile, listed in %s"
(buffer-name) (length errors)
(if (= (length errors) 1) "" "s")
flan-diagnostics-buffer)))
;; `flan--report' records, marks and signals the first; the others are
;; recorded and marked beside it before the signal leaves.
(condition-case err
(flan--report reply (buffer-name))
(user-error
(flan--report-load-errors (cdr errors) t)
(signal (car err) (cdr err)))))
reply))
(defun flan--report-load-errors (errors &optional keep)
"Record and mark each of ERRORS, a load reply's `:errors' list.
The marks from earlier in the same load are kept, and so are the marks
already in the buffer when KEEP is non-nil."
(let ((first (not keep)))
(dolist (e errors)
(let ((loc (plist-get e :loc))
(msg (plist-get e :message)))
(ignore-errors (flan--record-diagnostic loc msg))
(ignore-errors (flan--show-error loc msg (not first)))
(setq first nil)))))
;;;###autoload
(defun flan-eval-last-sexp (&optional arg)

2
emacs/test-flan-mode.el
View File

@ -491,6 +491,8 @@
"a package alias")
("(defn f [x int] float 1.0)" "int" font-lock-type-face
"int, the builtin alias")
("(defn f [s [const u8]] 1)" "const" font-lock-type-face
"const, in a read-only slice type")
;; Constants that stand for themselves.
("(set done true)" "true" font-lock-constant-face "true")
("(= o None)" "None" font-lock-constant-face "None")

67
emacs/test-flan.el
View File

@ -2388,6 +2388,73 @@ already rely on it — so nothing here is a stand-in for the real thing."
(flan-quit)
(ignore-errors (delete-file socket5)))
;; ── A file with no main ───────────────────────────────────────────────
;;
;; SBCL's order: the session comes up on a file that has nothing to run,
;; and `C-c C-k' loads into it. A load keeps what compiles and marks what
;; does not; a re-run says there is no main.
(let ((socket6 (concat socket "-nomain"))
(scratch (expand-file-name "nomain.flan" (file-name-directory file)))
(value (lambda (code)
(plist-get (flan--request
(list :op "eval-expr" :code code :file "<test>"))
:value))))
(with-temp-file scratch
(insert "(defn fib [n i64] i64\n (if (< n 2) n (+ (fib (- n 1)) (fib (- n 2)))))\n"))
(ignore-errors (delete-file socket6))
(flan scratch socket6)
(test-flan--check "a daemon starts on a file with no main"
(process-live-p flan--connection))
(let* ((reply (flan--request '(:op "describe")))
(said (progn (setq flan--parked nil)
(test-flan--said (flan--absorb reply)))))
(test-flan--check "a parked session with no main does not say a program finished"
(and said (string-match-p "has no main" said)
(not (string-match-p "finished" said)))))
(test-flan--check "and an expression reaches the file's functions"
(equal (funcall value "(fib 10)") "55"))
(with-current-buffer (find-file-noselect scratch)
(goto-char (point-max))
(insert "\n(defn biggest [xs [$t]] $t\n {:where (ordered? $t)}\n"
" (let [m (at xs 0)]\n (dotimes [i (length xs)]\n"
" (set m (max m (at xs i))))\n m))\n\n"
"(defn twice [n i64] i64 (* 2 n))\n")
(flan-eval-buffer)
(test-flan--check "C-c C-k loads a generic into it"
(equal (funcall value "(let [ns [3 9 2]] (biggest (slice ns 0 3)))")
"9"))
(test-flan--check "and a plain function"
(equal (funcall value "(twice 21)") "42"))
(erase-buffer)
(insert "(defn good [] i64 (bad))\n\n(defn bad [] i64 \"x\")\n\n"
"(defn fine [] i64 42)\n")
(let ((said (test-flan--said (flan-eval-buffer))))
(test-flan--check "a load with errors installs the rest and counts what it left out"
(and said (string-match-p "2 forms did not compile" said))))
(test-flan--check "and marks each form it left out"
(= 2 (length (flan--error-overlays))))
(test-flan--check "what compiled is in the program"
(equal (funcall value "(fine)") "42"))
(test-flan--check "and what used a form that did not is not"
(equal (plist-get (flan--request
(list :op "eval-expr" :code "(good)"
:file "<test>"))
:status)
"error"))
(erase-buffer)
(insert "(defn bad [] i64 \"x\")\n")
(test-flan--check "a load where nothing compiles is refused"
(condition-case nil (progn (flan-eval-buffer) nil)
(user-error t)))
(set-buffer-modified-p nil))
(test-flan--check "a re-run with no main says there is none"
(condition-case err (progn (flan-rerun) nil)
(user-error
(string-match-p "has no main" (error-message-string err)))))
(flan-quit)
(ignore-errors (delete-file socket6))
(ignore-errors (delete-file scratch)))
(if (zerop test-flan--failures)
(message "flan.el: all tests passed")
(message "\n%d failure(s)" test-flan--failures)

2
examples/text-rectangle-bounds.flan
View File

@ -63,7 +63,7 @@
;; from here they are ordinary slices, bounds-checked like any other, and the
;; index comes from raylib's own get-glyph-index so it is in range by
;; construction.
(defn draw-text-boxed [font rl/Font text [u8] rec rl/Rectangle
(defn draw-text-boxed [font rl/Font text [const u8] rec rl/Rectangle
font-size f32 spacing f32 word-wrap? bool
tint rl/Color] ()
(let [glyphs (rl/font-glyphs font)

2
lib/ast.ml
View File

@ -14,7 +14,7 @@ type texpr = { t : texpr_kind; tloc : Loc.t }
and texpr_kind =
| Tname of string (* i32 bool Cursor string *)
| Tslice of texpr (* [u8] ptr+len *)
| Tslice of bool * texpr (* [u8] [const u8] ptr+len *)
| Tarray of len * texpr (* [4 f32] [rows [cols u32]] *)
| Tmap of texpr * texpr (* (Map string i32) *)
| Tapp of string * texpr list (* (Ptr Cursor) (Option f64) *)

630
lib/check.ml
View File

File diff suppressed because it is too large Load Diff

68
lib/cimport.ml
View File

@ -407,7 +407,8 @@ let rec ty_source (t : Ast.texpr) =
| Ast.Tname n -> n
| Ast.Tapp (n, args) ->
Printf.sprintf "(%s %s)" n (String.concat " " (List.map ty_source args))
| Ast.Tslice e -> Printf.sprintf "[%s]" (ty_source e)
| Ast.Tslice (c, e) ->
Printf.sprintf "[%s%s]" (if c then "const " else "") (ty_source e)
| Ast.Tarray (Ast.Lint n, e) -> Printf.sprintf "[%Ld %s]" n (ty_source e)
| Ast.Tarray (Ast.Lname n, e) -> Printf.sprintf "[%s %s]" n (ty_source e)
| Ast.Tmap (k, v) ->
@ -555,6 +556,13 @@ let param_ty env (s : string) : Ast.texpr =
"char * is a parameter C may write through, and a Flan string crosses \
as a NUL-terminated copy — the writes would be lost. const char * is \
a string; this one needs a declare-c saying (Ptr u8)"
(* [const T *] is the one pointer C promises not to write through, so it
takes a (Ptr const T) — and with it the address of a read-only
element, which a (Ptr T) parameter would refuse. *)
| _ when is_const ->
(match (value_ty env s).Ast.t with
| Ast.Tapp ("Ptr", [ e ]) -> ty (Ast.Tapp ("Ptr", [ tname "const"; e ]))
| _ -> value_ty env s)
| _ -> value_ty env s
end
else value_ty env s
@ -948,33 +956,41 @@ let c_pointee (s : string) : string option =
Some (String.trim (String.sub s 0 (String.length s - 1)))
else None
let ptr_agrees_elem env ~inner (elem : Ast.texpr) =
(* [void *] agrees with a pointer to anything, and this is the judgement
call of the arm. C's [void *] is opaque about *what it points at* — that
is the whole of what the spelling means — so there is no element type in
the header to disagree with, and a check that reported one would be
reporting [value_ty]'s guess of [u8] back at the author as if the header
had said it. What is *not* given up is that it is a pointer at all: the
match above requires [(Ptr _)] on the Flan side, so an [i32] or a
[string] declared against a [void *] is still a finding. That
asymmetry is the point — raylib spells thirty-odd parameters [void *]
and none of them is a scalar. *)
let b = bare inner in
if String.equal b "void" then true
else (
match (try Some (value_ty env inner) with Refused _ -> None) with
| None ->
(* A pointee this cannot render says nothing, exactly as an
unrenderable field type says nothing in [check_structs]. *)
false
| Some want ->
let a = ty_source want and b = ty_source elem in
(* [agrees] and not [String.equal], so a [(Ptr Key)] against the
header's [(Ptr int)] lands on the enum arm. The four bytes are the
same four bytes through a pointer as they are beside one. *)
agrees env want elem || (byte a && byte b))
let ptr_agrees env ~(c : string) (t : Ast.texpr) =
match (c_pointee c, t.Ast.t) with
| Some inner, Ast.Tapp ("Ptr", [ elem ]) ->
(* [void *] agrees with a pointer to anything, and this is the judgement
call of the arm. C's [void *] is opaque about *what it points at* — that
is the whole of what the spelling means — so there is no element type in
the header to disagree with, and a check that reported one would be
reporting [value_ty]'s guess of [u8] back at the author as if the header
had said it. What is *not* given up is that it is a pointer at all: the
match above requires [(Ptr _)] on the Flan side, so an [i32] or a
[string] declared against a [void *] is still a finding. That
asymmetry is the point — raylib spells thirty-odd parameters [void *]
and none of them is a scalar. *)
let b = bare inner in
if String.equal b "void" then true
else (
match (try Some (value_ty env inner) with Refused _ -> None) with
| None ->
(* A pointee this cannot render says nothing, exactly as an
unrenderable field type says nothing in [check_structs]. *)
false
| Some want ->
let a = ty_source want and b = ty_source elem in
(* [agrees] and not [String.equal], so a [(Ptr Key)] against the
header's [(Ptr int)] lands on the enum arm. The four bytes are the
same four bytes through a pointer as they are beside one. *)
agrees env want elem || (byte a && byte b))
(* A (Ptr const T) promises C will not write, so the header has to promise
it too: over a [T *] without const, C may write through storage Flan
holds read-only. *)
| Some inner, Ast.Tapp ("Ptr", [ { Ast.t = Ast.Tname "const"; _ }; elem ]) ->
strip_prefix "const " inner <> None
&& ptr_agrees_elem env ~inner elem
| Some inner, Ast.Tapp ("Ptr", [ elem ]) -> ptr_agrees_elem env ~inner elem
| _ -> false
(* The two together, for the one caller that still has the C spelling. A

324
lib/dev.ml
View File

@ -134,27 +134,18 @@ let await ?(ms = 5000) f =
in
go ms
(* What a program needs so that code from the editor can reach it. Spelled once
because three replies give it: a delivery, an evaluation and the daemon's
own warning. Both lines compile as written. *)
let agent_howto =
"Import the agent with (import agent \"vendor:agent\") and call \
(agent/poll) once in each pass of the program's main loop, then start \
flan dev again."
(* Every program [flan dev] builds has the agent linked — see [with_agent] — so
a program that cannot be reached is one whose socket went away, not one that
never had an agent. *)
(* What a program does so that code from the editor reaches it while it runs.
Every program [flan dev] builds has the agent's C, but only the program can
decide where its frames end. Both forms compile as written. *)
let polls_for_it =
"Code from the editor runs where the program polls for it: import the \
agent with (import agent \"vendor:agent\") and call (agent/poll) once in \
each pass of the main loop"
let no_agent =
"the program has no agent, so nothing in it can receive code from the \
editor. " ^ agent_howto
(* Whether anything in this session can hand code to the program. A merged
build with no agent linked has no agent to call and never binds a socket,
and a connect to one answers "No such file or directory" about a path the
reader never chose; that is the case this names. *)
let agentless t = t.child = None && not (Agent.present ())
let unreachable t e =
if agentless t then no_agent
else "cannot reach the program: " ^ Unix.error_message e
let unreachable _t e = "cannot reach the program: " ^ Unix.error_message e
(* Whether the program has bound the socket it receives modules on.
@ -195,7 +186,7 @@ let agent_check t =
t.agent_watch <- None;
Printf.eprintf
"flan dev: nothing is listening on %s, so code from the editor cannot \
reach the program. %s\n%!" t.agent agent_howto
reach the program.\n%!" t.agent
end
(* ── Asking the agent ──────────────────────────────────────────────── *)
@ -751,6 +742,11 @@ let with_break t reply =
let fields =
fields ^ (if liveness t = Parked then " :parked t" else " :parked nil")
in
(* Only when there is no [main] of the file's own: a parked session over a
file without one finished nothing, and an editor should not say it did. *)
let fields =
if Session.has_main t.session then fields else fields ^ " :main nil"
in
String.sub reply 0 (String.length reply - 1) ^ fields ^ ")"
let error ?loc msg =
@ -891,8 +887,39 @@ let refusal ~parked reply =
[max_socket_path], which [session_dir] refuses before building — and there
the module is still queued through the in-process call. A note saying the
program "has not called (agent/start ...)" named a cause that was not the
cause, so there is none. A program with no agent linked has nothing to
queue a module on, and its delivery is refused with [no_agent]. *)
cause, so there is none. *)
(* A running program takes a queued module at its next [(agent/poll)], and one
that never polls never takes it. The agent always accepts, so "ok" alone
would report a change that does not land: the ring is watched for a moment
and a module still waiting at the end is said to be waiting, with the fix.
An agent without the [pending] verb (a program vendoring an older one) is
not asked twice. A stopped program polls from its break loop, and a parked
one gets its own note. *)
let unpolled_note t ~parked =
if parked || state t <> Running then []
else begin
let deadline = Unix.gettimeofday () +. 3. in
let rec taken () =
match int_of_string_opt (String.trim (request t "pending")) with
| None | Some 0 -> true
| Some _ ->
if Unix.gettimeofday () >= deadline then false
else begin
drain t;
ignore (Unix.select [] [] [] 0.005);
taken ()
end
| exception Unix.Unix_error _ -> true
in
if taken () then []
else
[ ":note "
^ Wire.quote
("queued, but the running program has not taken it in three \
seconds, so it has not reached a frame boundary. "
^ polls_for_it ^ "; it installs at the first poll") ]
end
let install_note t ~parked =
if parked then begin
let first = not t.park_noted in
@ -947,7 +974,7 @@ let stale_field (ss : Session.stale list) =
(if x.Session.running then " :running t" else ""))
ss) ]
let eval t ~code ~origin ~pause =
let eval ?forms ?base ?(extra = []) t ~code ~origin ~pause =
let now = liveness t in
let parked_now = now = Parked in
(* A park that is over takes its note with it: the long sentence below is
@ -970,15 +997,19 @@ let eval t ~code ~origin ~pause =
let refused msg = Session.restore t.session before; error msg in
if now = Gone then error gone
else
match Session.eval ~origin ?pause ~running:(not parked_now) t.session code with
match
Session.eval ~origin ?base ?forms ?pause ~running:(not parked_now)
t.session code
with
| c when not c.Session.installs ->
(* Accepted into the session and nothing to send: a declaration the
program already has, with no body and no new storage. Saying "ok" and
shipping an empty module would report success for a change that cannot
have taken effect. *)
ok
[ ":names " ^ Wire.strings c.Session.names; ":fns ()";
":note " ^ Wire.quote "nothing to install" ]
([ ":names " ^ Wire.strings c.Session.names; ":fns ()";
":note " ^ Wire.quote "nothing to install" ]
@ extra)
| c ->
(* Everything from here to the delivery is inside the restore, and by
exception type as well as by arm. The three named below are the ones
@ -1030,14 +1061,14 @@ let eval t ~code ~origin ~pause =
| Some (l, c) ->
[ ":pause " ^ Wire.quote (Printf.sprintf "%d:%d" l c) ]
| None -> [])
@ install_note t ~parked:parked_now)
@ install_note t ~parked:parked_now
@ unpolled_note t ~parked:parked_now
@ extra)
| reply -> refused (refusal ~parked:parked_now reply)
| exception Unix.Unix_error (e, _, _) ->
refused
(if agentless t then no_agent
else
"cannot reach the program on " ^ t.agent ^ ": "
^ Unix.error_message e))
("cannot reach the program on " ^ t.agent ^ ": "
^ Unix.error_message e))
| exception Failure m -> refused m)
with e when not !accepted -> Session.restore t.session before; raise e)
(* Nothing to put back: the check itself raised, so [Session.eval] never
@ -1049,6 +1080,60 @@ let eval t ~code ~origin ~pause =
Session.restore t.session before;
error ~loc:(Loc.to_string l) msg
(* The refusals a load answered beside what it installed, one plist each. *)
let errors_field (ds : Loc.diag list) =
match ds with
| [] -> []
| ds ->
[ ":errors "
^ Wire.list
(List.map
(fun (d : Loc.diag) ->
Printf.sprintf "(:loc %s :message %s)"
(Wire.quote (Loc.to_string d.Loc.dloc))
(Wire.quote d.Loc.dmsg))
ds) ]
(* C-c C-k: a whole file into the running session, SBCL's [load]. [eval] with
one difference — a form that does not compile is left out and listed
rather than refusing the rest, so a file with one broken function still
defines the others ([Session.pruned] finds which). The survivors go through
[eval] as one module, as the whole buffer always has. When nothing
survives the reply is a refusal, with the first error where every other
refusal puts it. *)
let load_file t ~code ~origin =
match Reader.read_all ~file:origin code with
| exception Loc.Error { Loc.dloc = l; dmsg = msg; _ } ->
error ~loc:(Loc.to_string l) msg
| forms ->
(* The imports of a file on disk are its own, wherever the session's file
is. *)
let base = if Sys.file_exists origin then Some origin else None in
let running = liveness t <> Parked in
let check forms =
let before = Session.held t.session in
Fun.protect
~finally:(fun () -> Session.restore t.session before)
(fun () ->
ignore (Session.eval ~origin ?base ~forms ~running t.session code))
in
(match Session.pruned check forms with
| exception Loc.Error { Loc.dloc = l; dmsg = msg; _ } ->
error ~loc:(Loc.to_string l) msg
| exception Loc.Errors ({ Loc.dloc = l; dmsg = msg; _ } :: _ as ds) ->
let e = error ~loc:(Loc.to_string l) msg in
String.sub e 0 (String.length e - 1)
^ " " ^ String.concat " " (errors_field ds) ^ ")"
| (), kept, errs ->
if errs <> [] && kept = [] then
let d = List.hd errs in
let e = error ~loc:(Loc.to_string d.Loc.dloc) d.Loc.dmsg in
String.sub e 0 (String.length e - 1)
^ " " ^ String.concat " " (errors_field errs) ^ ")"
else
eval ~forms:kept ?base ~extra:(errors_field errs) t ~code ~origin
~pause:None)
(* Redefining a name installs a body; evaluating an expression has no name to
install into, so the module carries a thunk the agent runs once. The value
comes back through the runtime rather than through this reply, because the
@ -1088,7 +1173,6 @@ let eval t ~code ~origin ~pause =
let eval_expr t ~code ~origin ~pause =
match liveness t with
| Gone -> error gone
| (Live | Parked) when agentless t -> error no_agent
| Live | Parked ->
(* The same rollback [eval] takes, for the same reason and a smaller
cargo. A thunk is not a declaration and never joins the session, but the
@ -1385,8 +1469,8 @@ let eval_expr t ~code ~origin ~pause =
break buffer, and evaluate this again"
else
error
"the program did not reach a frame boundary; is it calling \
(agent/poll)?")
("the program did not reach a frame boundary in five seconds. "
^ polls_for_it))
(* A module that was taken is the program's from here on, whatever
the wait then says: a timeout is a frame boundary not reached
yet, not a module refused, so the instances in it stay in the
@ -2172,8 +2256,8 @@ let run_render_thunk ?(stopped_only = false) ?at_stop t ~tag
it stands now"
else
Error
"the program did not reach a frame boundary; is it calling \
(agent/poll)?"
("the program did not reach a frame boundary in five seconds. "
^ polls_for_it)
in
if ms <= 0 then gave_up ()
else begin
@ -2742,7 +2826,7 @@ let type_of_spelling t spelling : (Types.t, string) result =
let addr_extern : Tast.extern =
{ Tast.ename = "flan/dev-addr"; esym = "flan_dev_reg_addr";
eparams = [ Types.Int Types.I64 ];
eret = Types.Ptr (Types.Int Types.U8); eloc = Loc.unknown }
eret = Types.Ptr (Types.Mut, (Types.Int Types.U8)); eloc = Loc.unknown }
(* Renders the value [(Ptr ty)] holding [addr], in the program.
@ -2777,7 +2861,7 @@ let render_addr (s : Session.t) ~addr ~(ty : Types.t)
extra := ty :: !extra;
i) }
in
let pty = Types.Ptr ty in
let pty = Types.Ptr (Types.Mut, ty) in
let root =
{ Tast.e =
Tast.Prim
@ -2787,7 +2871,7 @@ let render_addr (s : Session.t) ~addr ~(ty : Types.t)
("flan/dev-addr",
[ { Tast.e = Tast.Int (Int64.of_int addr, Types.I64);
ty = Types.Int Types.I64; loc } ]);
ty = Types.Ptr (Types.Int Types.U8); loc } ]);
ty = Types.Ptr (Types.Mut, (Types.Int Types.U8)); loc } ]);
ty = pty; loc }
in
match Render.render c 0 root with
@ -2951,7 +3035,7 @@ let inspect_addr t ~addr ~want_type =
| Ok v ->
ok
([ Printf.sprintf ":addr %d" addr;
":type " ^ Wire.quote (Types.to_string (Types.Ptr ty));
":type " ^ Wire.quote (Types.to_string (Types.Ptr (Types.Mut, ty)));
":value " ^ Wire.quote v; ":live " ^ live ]
@ told @ where))))))
@ -3379,11 +3463,30 @@ let abort t =
parked
"the program has already finished, so there is nothing to abort and \
nothing that would end by aborting it but this session"
(* The one exception, and it is the same exception the restarts are: a thunk
stopped in the break loop on the parked thread is something to abort, and
for a condition with no restart worth taking it is the only thing that
ends it. What it costs is unchanged and is what the reply has always said
— the process goes, and the session with it. *)
(* A thunk stopped in the break loop on the parked thread. Aborting it is
abandoning the expression, not ending the process: the program had
already finished, and the break loop offers the thunk's own boundary as a
restart, so that is what is taken and the session stays parked. At a
trap the boundary is left by a jump rather than a transfer (the agent's
[eval_escape]), and it is offered the same way. *)
| Parked
when match restarts t with
| Ok (rs, _) -> List.exists (fun (_, f, _) -> f = Boundary) rs
| _ -> false ->
(match restarts t with
| Ok (rs, _) ->
let i, _, _ = List.find (fun (_, f, _) -> f = Boundary) rs in
(match ask t ("restart-at " ^ string_of_int i) with
| reply when accepted reply <> None ->
ok
[ ":note "
^ Wire.quote
"the evaluation is abandoned; the program is still parked, \
and anything the expression changed before it stopped \
stays changed" ]
| reply -> error (String.trim reply)
| exception Unix.Unix_error (e, _, _) -> error (unreachable t e))
| Error m -> error m)
| Live | Parked ->
match ask t "abort" with
| reply when String.trim reply = "ok" ->
@ -3438,6 +3541,17 @@ let abort t =
let rerun t =
match liveness t with
| Gone -> error gone
(* A file started with no [main] runs a stub that returns at once; running
it again would answer "running main again" about nothing. *)
| (Live | Parked) when not (Session.has_main t.session) ->
error
(Printf.sprintf
"%s has no main, so there is nothing to run. A program starts at a \
function named main; add one and load the file with C-c C-k, for \
example:\n\n\
\ (defn main [] i32\n\
\ 0)"
t.session.Session.file)
| Live | Parked ->
(* Read before the request and not after it. Taking a re-run is what ends
the park — the C stores the new state as it accepts — so by the time
@ -4181,6 +4295,19 @@ let handle t req =
in
macroexpand t ~code ~origin ~all
| None -> error "macroexpand needs :code")
(* A whole file, [:code] being its text as the editor holds it — which need
not be what is saved — and [:file] where it lives. Without [:code] the
file is read from disk. *)
| Some "load-file" ->
(match Wire.string_field req "file" with
| None -> error "load-file needs :file"
| Some origin ->
(match Wire.string_field req "code" with
| Some code -> load_file t ~code ~origin
| None ->
(match read_file origin with
| code -> load_file t ~code ~origin
| exception Sys_error m -> error ("cannot read the file: " ^ m))))
| Some "describe" -> describe t
| Some "defs" -> defs t
| Some "break" -> break t
@ -4903,12 +5030,56 @@ let make_session_dir ~file dir =
dev %s"
dir (Unix.error_message e) (Filename.quote file))
(* A session over a file with no [main] has nothing to run, and the build
would find that out at the link — as a missing symbol, or as the merged
build's rename finding nothing to rename. *)
(* The two-process daemon's program is a child process, and a child whose
[main] returns at once is a dead child rather than a parked one — so the
stub [Session.create_dev] gives a file with no [main] is no use to it. The
one-process daemon takes such a file. *)
let need_main ~file (session : Session.t) =
Build.need_main ~file ~doing:"flan dev has nothing to run"
session.Session.host
if not (Session.has_main session) then
failwith
(Printf.sprintf
"%s has no main, and flan dev --two-process runs the program as a \
separate process, which needs one. Start flan dev without \
--two-process, or add a function named main, for example:\n\n\
\ (defn main [] i32\n\
\ 0)"
file)
(* The agent's C, in every program [flan dev] builds, whether or not the source
imports the package: its constructor binds the socket before [main], so a
file that never mentions the agent can still be reached from the editor. A
program that imports it already has it, and is left alone — two copies
would collide at the link. A release build is not built here and is not
affected. *)
let with_agent ~dir csrcs lflags =
let csrcs =
if List.exists (fun c -> Filename.basename c = "flan_agent.c") csrcs then
csrcs
else begin
let c = Filename.concat dir "flan_agent.c" in
write_file c Runtime_src.agent_source;
csrcs @ [ c ]
end
in
let lflags =
lflags
@ List.filter (fun f -> not (List.mem f lflags)) [ "-lpthread"; "-ldl" ]
in
(csrcs, lflags)
(* What [flan dev] says about the forms of its file that did not compile. The
session starts without them; C-c C-k loads the file again once they are
fixed. *)
let report_dropped ~file = function
| [] -> ()
| ds ->
Printf.eprintf "%s\n%!" (Loc.report_all ds);
Printf.eprintf
"flan dev: %s has %d form%s that did not compile; the session starts \
without %s\n%!"
file (List.length ds)
(if List.length ds = 1 then "" else "s")
(if List.length ds = 1 then "it" else "them")
(* [debug] is off by default, which keeps [flan dev] exactly what it was: a
-O2 host and -O2 modules. It is opt-in rather than always-on because a debug
@ -4926,9 +5097,11 @@ let two_process ?(debug = false) ?(x86 = true) ~file ~sock () =
let dir = session_dir ~file ~sock in
let given = file in
let file = try Unix.realpath file with Unix.Unix_error _ -> file in
let session, l = Session.create ~debug ~x86 ~file () in
let session, l, dropped = Session.create_dev ~debug ~x86 ~file () in
need_main ~file:given session;
report_dropped ~file:given dropped;
make_session_dir ~file:given dir;
let csrcs, lflags = with_agent ~dir l.Load.csrcs l.Load.lflags in
let exe = Filename.concat dir "program" in
(* [keep] so the host's own IR survives the build. It is the text [llc] was
actually given, not a second emission of it, which is the difference
@ -4945,7 +5118,7 @@ let two_process ?(debug = false) ?(x86 = true) ~file ~sock () =
Build.executable
~opts:{ Build.default with Build.dev = true; Build.keep = true;
Build.debug; Build.x86 }
~csrcs:l.Load.csrcs ~lflags:l.Load.lflags session.Session.host ~out:exe
~csrcs ~lflags session.Session.host ~out:exe
in
(* Host and modules are chosen together, which is the whole licence: an
[--x86] host gets [--x86] modules because one flag set both, and the
@ -4997,7 +5170,7 @@ let two_process ?(debug = false) ?(x86 = true) ~file ~sock () =
failwith
("the program did not open its agent socket at " ^ agent
^ ". Under --two-process every edit reaches the program through that \
socket. " ^ agent_howto)
socket.")
end;
let t =
@ -5078,10 +5251,9 @@ let two_process ?(debug = false) ?(x86 = true) ~file ~sock () =
the process starts rather than because anybody asked — and the startup below
is still the one place that decides, in three lines of C.
What is genuinely open is the *session*: [Session.create ~file] is the only
entry there is, so a REPL that starts empty and accumulates as files are
loaded needs [Session] to have a second constructor. It already accumulates;
it just cannot start from nothing. And [rerun] runs [main] and nothing else,
The session starts from a file with no [main] as well: [Session.create_dev]
gives it a stub that returns at once, so the process comes up, parks, and
accumulates what the editor loads into it. And [rerun] runs [main] and nothing else,
deliberately — running a *named* function is what [eval-expr] already is,
and the two should not grow into one verb with a mode. *)
@ -5326,11 +5498,26 @@ static void flan_merged_park(void) {
program_state = PROGRAM_PARKED;
pthread_mutex_unlock(&program_lock);
fflush(NULL);
fprintf(stderr,
"flan dev: the program finished with %d; the process is parked and "
"its globals are as it left them — M-x flan-rerun runs it again\n",
(int)program_status);
/* A file with no main is started on a stub that returns at once, and its
* first park is the session coming up rather than a program finishing. */
{
static int first_park = 1;
const char *no_main = getenv("FLAN_DEV_NO_MAIN");
if (first_park && no_main != NULL && no_main[0] == '1')
fprintf(stderr,
"flan dev: the file has no main, so nothing runs until one is "
"loaded; the session is up and takes definitions and "
"expressions\n");
else
fprintf(stderr,
"flan dev: the program finished with %d; the process is parked "
"and its globals are as it left them — M-x flan-rerun runs it "
"again\n",
(int)program_status);
first_park = 0;
}
fflush(stderr);
pthread_mutex_lock(&program_lock);
for (;;) {
while (!program_asked && !program_poll)
@ -5829,7 +6016,7 @@ let merged_setup () =
this binary is the one that exec'd it. *)
(* Its warnings were printed by the launcher over the same source. *)
Check.print_warnings := false;
let session, _ = Session.create ~debug ~x86 ~file () in
let session, _, _ = Session.create_dev ~debug ~x86 ~file () in
Check.print_warnings := true;
(* The program's output has to reach an editor exactly as it did when the
daemon held the other end of a pipe. Same pipe, one process: fd 1 is
@ -5934,9 +6121,10 @@ let start_merged ?(debug = false) ?(x86 = true) ~file ~sock () =
let dir = session_dir ~file ~sock in
let given = file in
let file = try Unix.realpath file with Unix.Unix_error _ -> file in
let session, l = Session.create ~debug ~x86 ~file () in
need_main ~file:given session;
let session, l, dropped = Session.create_dev ~debug ~x86 ~file () in
report_dropped ~file:given dropped;
make_session_dir ~file:given dir;
let csrcs, lflags = with_agent ~dir l.Load.csrcs l.Load.lflags in
let exe = Filename.concat dir "program" in
(* The host's IR goes straight to its final home rather than being written
into the build's working directory and moved: the merged link is spelled
@ -5947,8 +6135,12 @@ let start_merged ?(debug = false) ?(x86 = true) ~file ~sock () =
ignore
(merged_executable
~opts:{ Build.default with Build.dev = true; Build.debug; Build.x86 }
~csrcs:l.Load.csrcs ~lflags:l.Load.lflags ~pnames:[]
~csrcs ~lflags ~pnames:[]
session.Session.host ~out:exe ~ll:host_ll);
(* Read by the park, so the first one says the session is waiting rather
than that a program finished. *)
Unix.putenv "FLAN_DEV_NO_MAIN"
(if Session.has_main session then "0" else "1");
let agent = Filename.concat dir "agent.sock" in
(* Every one of these is read by the exec'd binary and by nothing else. They
are set before the exec rather than by the compiler thread afterwards, so

7
lib/dune
View File

@ -39,7 +39,8 @@
%{workspace_root}/runtime/flan_rt.c
%{workspace_root}/runtime/flan_dev.c
%{workspace_root}/runtime/flan_dyn.c
%{workspace_root}/runtime/flan_dyn.h)
%{workspace_root}/runtime/flan_dyn.h
%{workspace_root}/vendor/agent/flan_agent.c)
(action
(with-stdout-to
runtime_src.ml
@ -58,4 +59,8 @@
; compiled against the old one.
(echo "|c}\n\nlet dyn_header = {c|\n")
(cat %{workspace_root}/runtime/flan_dyn.h)
; And the agent's C, which flan dev links into every program it builds
; whether or not the source imports the package. See [Dev.with_agent].
(echo "|c}\n\nlet agent_source = {c|\n")
(cat %{workspace_root}/vendor/agent/flan_agent.c)
(echo "|c}\n")))))

38
lib/emit.ml
View File

@ -1010,7 +1010,7 @@ let rec dty m d (t : Types.t) : int =
| Types.Bool -> basic "bool" 8 "DW_ATE_boolean"
| Types.Enum e -> basic e 32 "DW_ATE_signed"
| Types.Unit | Types.Never -> composite (Types.to_string t) []
| Types.Ptr e ->
| Types.Ptr (_, e) ->
let id = dalloc d in
Hashtbl.replace d.dtys key id;
(* [(Ptr Unit)] and [(Ptr Never)] are the opaque pointer, and a DWARF
@ -1036,10 +1036,10 @@ let rec dty m d (t : Types.t) : int =
capacity, so two members are the whole truth about a slice. *)
| Types.String ->
composite "string"
[ ("ptr", Types.Ptr (Types.Int Types.U8)); ("len", Types.Int Types.I64) ]
| Types.Slice e ->
[ ("ptr", Types.Ptr (Types.Mut, (Types.Int Types.U8))); ("len", Types.Int Types.I64) ]
| Types.Slice (_, e) ->
composite (Types.to_string t)
[ ("ptr", Types.Ptr e); ("len", Types.Int Types.I64) ]
[ ("ptr", Types.Ptr (Types.Mut, e)); ("len", Types.Int Types.I64) ]
| Types.Option e ->
composite (Types.to_string t)
[ ("tag", Types.Int Types.U8); ("value", e) ]
@ -1101,15 +1101,15 @@ let rec dty m d (t : Types.t) : int =
incarnation beside it. *)
| Types.Alloc ->
composite "Allocator"
[ ("record", Types.Ptr Types.Unit);
[ ("record", Types.Ptr (Types.Mut, Types.Unit));
("incarnation", Types.Int Types.U64) ]
(* Shown as what it is. The epoch word is in the layout and so it is
here too: a debugger that showed four fields of a five-field struct
would put the reader's offsets out by one. *)
| Types.Vec e ->
composite (Types.to_string t)
[ ("ptr", Types.Ptr e); ("len", Types.Int Types.I64);
("cap", Types.Int Types.I64); ("allocator", Types.Ptr Types.Unit);
[ ("ptr", Types.Ptr (Types.Mut, e)); ("len", Types.Int Types.I64);
("cap", Types.Int Types.I64); ("allocator", Types.Ptr (Types.Mut, Types.Unit));
("epoch", Types.Int Types.I64) ]
(* Five fields again, and shown as five for the same reason: a debugger
that showed fewer would put the reader's offsets out. [log2cap] is
@ -1118,9 +1118,9 @@ let rec dty m d (t : Types.t) : int =
describing a field that is not there. *)
| Types.Map (k, v) ->
composite (Types.to_string t)
[ ("data", Types.Ptr (Types.Int Types.U8));
[ ("data", Types.Ptr (Types.Mut, (Types.Int Types.U8)));
("len", Types.Int Types.I64); ("log2cap", Types.Int Types.I64);
("allocator", Types.Ptr Types.Unit); ("epoch", Types.Int Types.I64) ]
("allocator", Types.Ptr (Types.Mut, Types.Unit)); ("epoch", Types.Int Types.I64) ]
|> fun n -> ignore k; ignore v; n
(* Two words, and shown as two, the same rule the Vec and the Map above
follow: a debugger told a function value were one pointer would put
@ -1133,7 +1133,7 @@ let rec dty m d (t : Types.t) : int =
locals, where they are under the names the source gave them. *)
| Types.Fn _ ->
composite (Types.to_string t)
[ ("code", Types.Ptr Types.Unit); ("env", Types.Ptr Types.Unit) ]
[ ("code", Types.Ptr (Types.Mut, Types.Unit)); ("env", Types.Ptr (Types.Mut, Types.Unit)) ]
(* And the bare one is what it always was: a pointer to code, and lldb
is told exactly that and no more. DWARF has DW_TAG_subroutine_type
for the signature behind it, and spelling one out would buy a reader
@ -2839,7 +2839,7 @@ and element_addr f (target : Tast.expr) idx =
same way, bounds check included. *)
| Types.Slice _ | Types.String ->
let elem =
match ty with Types.Slice e -> e | _ -> Types.Int Types.U8 in
match ty with Types.Slice (_, e) -> e | _ -> Types.Int Types.U8 in
(* A slice is ptr+len, so step through the pointer it holds. *)
let s = load f ptr ty in
let base = fresh f in
@ -2866,7 +2866,7 @@ and place f (p : Tast.place) : string * Types.t =
| Tast.Pindex (target, idx) -> element_addr f target idx
| Tast.Pderef target ->
let t = match target.Tast.ty with
| Types.Ptr t -> t | t -> internal "deref of %s" (Types.to_string t)
| Types.Ptr (_, t) -> t | t -> internal "deref of %s" (Types.to_string t)
in
value f target, t
@ -3724,7 +3724,7 @@ and prim f (e : Tast.expr) (p : Tast.prim) (args : Tast.expr list) =
ins f "%s = getelementptr inbounds %s, ptr %s, i64 0, i64 %s"
p (ll target.Tast.ty) a lo64;
p
| Types.Slice elem ->
| Types.Slice (_, elem) ->
let v = value f target in
let q = fresh f in
ins f "%s = extractvalue %%slice %s, 0" q v;
@ -3830,9 +3830,9 @@ and prim f (e : Tast.expr) (p : Tast.prim) (args : Tast.expr list) =
term f "unreachable";
"zeroinitializer"
| Tast.Argv, [] ->
let tmp = alloca f (Types.Slice Types.String) in
let tmp = alloca f (Types.Slice (Types.Mut, Types.String)) in
ins f "call void @flan_argv(ptr %s)" tmp;
load f tmp (Types.Slice Types.String)
load f tmp (Types.Slice (Types.Mut, Types.String))
(* One arm for every runtime entry point the allocator and container runtime
has. The result type is the node's own and the argument types are the
arguments' own, so nothing here has to know which symbol it is calling. *)
@ -3934,17 +3934,17 @@ and shim_in f name ret x =
and shim_out f name (x : Tast.expr) (buf : Tast.expr) =
let v = value f x in
let b = value f buf in
let tmp = alloca f (Types.Slice (Types.Int Types.U8)) in
let tmp = alloca f (Types.Slice (Types.Mut, (Types.Int Types.U8))) in
ins f "call void %s(%s %s, ptr %s, ptr %s)" name (ll x.Tast.ty) v b tmp;
load f tmp (Types.Slice (Types.Int Types.U8))
load f tmp (Types.Slice (Types.Mut, (Types.Int Types.U8)))
(* Slice in, slice out: [shim_in] returns a scalar and [shim_out] takes one, so
a shim that transforms bytes into bytes is neither. *)
and shim_in_out f name (x : Tast.expr) =
let p, n = explode f x in
let tmp = alloca f (Types.Slice (Types.Int Types.U8)) in
let tmp = alloca f (Types.Slice (Types.Mut, (Types.Int Types.U8))) in
ins f "call void %s(ptr %s, i64 %s, ptr %s)" name p n tmp;
load f tmp (Types.Slice (Types.Int Types.U8))
load f tmp (Types.Slice (Types.Mut, (Types.Int Types.U8)))
and cast f ~guard (x : Tast.expr) target =
let v = value f x in

4
lib/js.ml
View File

@ -219,7 +219,7 @@ let rec refuse_ty loc (t : Types.t) =
match t with
| Types.Int _ | Types.Float _ | Types.Bool | Types.String | Types.Unit
| Types.Never | Types.Named _ | Types.Enum _ -> ()
| Types.Slice t | Types.Array (_, t) | Types.Option t -> refuse_ty loc t
| Types.Slice (_, t) | Types.Array (_, t) | Types.Option t -> refuse_ty loc t
| Types.Vec t -> refuse_ty loc t
| Types.Fn (ps, r) | Types.CFn (ps, r) ->
List.iter (refuse_ty loc) ps; refuse_ty loc r
@ -654,7 +654,7 @@ let struct_of m loc (t : Types.t) =
let elem_ty loc (t : Types.t) =
match t with
| Types.Slice e | Types.Array (_, e) -> e
| Types.Slice (_, e) | Types.Array (_, e) -> e
| Types.String -> Types.Int Types.U8
| t -> at loc "indexing %s is not in the JS dialect" (Types.to_string t)

4
lib/load.ml
View File

@ -198,7 +198,7 @@ let rec rename_texpr owned alias (t : Ast.texpr) : Ast.texpr =
match t.Ast.t with
| Ast.Tname n when List.mem n owned -> Ast.Tname (qualify alias n)
| Ast.Tname _ as k -> k
| Ast.Tslice e -> Ast.Tslice (rename_texpr owned alias e)
| Ast.Tslice (c, e) -> Ast.Tslice (c, rename_texpr owned alias e)
(* The length too: [rows] in [[rows [cols u32]]] is an ordinary
compile-time constant of the package, not part of the type syntax. *)
| Ast.Tarray (l, e) ->
@ -786,7 +786,7 @@ let exported n = not (String.equal n "main")
let rec texpr_uses acc (t : Ast.texpr) =
match t.Ast.t with
| Ast.Tname n -> acc := (n, t.Ast.tloc) :: !acc
| Ast.Tslice e -> texpr_uses acc e
| Ast.Tslice (_, e) -> texpr_uses acc e
| Ast.Tarray (l, e) ->
(match l with Ast.Lname n -> acc := (n, t.Ast.tloc) :: !acc | Ast.Lint _ -> ());
texpr_uses acc e

19
lib/parse.ml
View File

@ -89,10 +89,23 @@ let rec texpr (f : Form.t) : Ast.texpr =
emitter go on speaking. *)
| Sym "Unit" -> fail f "unit is written (), not Unit"
| Sym s -> mk (Ast.Tname s)
| Vec [ elem ] -> mk (Ast.Tslice (texpr elem))
(* [const T] is matched before [n T], which it would otherwise be: [const]
is a reserved name exactly so that no constant can be called that and
make the two spellings mean the same brackets. *)
| Vec [ { v = Sym "const"; _ } ] ->
fail f "[const] names no element type — a read-only slice is [const T]"
| Vec [ { v = Sym "const"; _ }; elem ] -> mk (Ast.Tslice (true, texpr elem))
| Vec [ elem ] -> mk (Ast.Tslice (false, texpr elem))
| Vec [ n; elem ] -> mk (Ast.Tarray (len n, texpr elem))
| Vec items when List.exists (fun (i : Form.t) -> i.v = Sym "const") items ->
fail f
"a read-only slice is written [const T], and a fixed array [n T] has no \
read-only form — take a read-only view of one with (slice a) where a \
[const T] is wanted"
| Vec _ ->
fail f "a type in brackets is [T] for a slice or [n T] for a fixed array"
fail f
"a type in brackets is [T] for a slice, [const T] for a read-only \
slice or [n T] for a fixed array"
(* Braces are not a type. [{K V}] used to spell [(Map K V)] and the two
resolved to the same thing; the brace spelling is withdrawn, and the
refusal names the surviving one rather than letting the form fall through
@ -1814,7 +1827,7 @@ let rec decl (f : Form.t) : Ast.decl =
what keeps the compiler's own parameter out of the way of
every name the author might bind. Same trick as [gensym]. *)
params = [ { Ast.fname = macro_args;
fty = { Ast.t = Ast.Tslice form_t; tloc = ps.loc };
fty = { Ast.t = Ast.Tslice (false, form_t); tloc = ps.loc };
floc = ps.loc } ];
(* Written out, not deferred: a macro takes [[Form]] and
returns a [Form], and neither half of that is the user's to

117
lib/prelude.ml
View File

@ -295,7 +295,7 @@ let source = {flan|
;; One family per element type, because there are no generics: each of these
;; is a *copy* per element type, and the set below is i32 (what indices, ids
;; and tile values are), f32 (what positions, velocities and weights are) and
;; [u8] (what a field coming out of `split` is).
;; [const u8] (what a field coming out of `split` is).
;;
;; A slice is ptr+len and non-owning, so these mutate the storage they were
;; handed: sorting (slice grid 4 9) sorts those five elements of grid and
@ -410,7 +410,7 @@ let source = {flan|
;; The first index holding x. None rather than -1, because Option is what the
;; language has and a sentinel index is the bug this avoids.
(defn index-of [s [$t] x $t] (Option i32)
(defn index-of [s [const $t] x $t] (Option i32)
{:where (equal? $t)}
(dotimes [i (length s)]
(when (= (at s i) x)
@ -428,7 +428,7 @@ let source = {flan|
;; either. These reduce a slice, which is a different operation with a
;; different arity, so the different name is honest rather than a workaround.
;; A type's own limits are (min-value T) and (max-value T).
(defn min-of [s [$t]] (Option $t)
(defn min-of [s [const $t]] (Option $t)
{:where (ordered? $t)}
(if (= (length s) 0)
None
@ -437,7 +437,7 @@ let source = {flan|
(set m (min m (at s i))))
(Some m))))
(defn max-of [s [$t]] (Option $t)
(defn max-of [s [const $t]] (Option $t)
{:where (ordered? $t)}
(if (= (length s) 0)
None
@ -522,7 +522,7 @@ let source = {flan|
;; The general fold, of which sum-i32 is the special case with the + written
;; in. The accumulator comes first in the step, which is the order that reads
;; as (f acc x) and the order Odin's slice.reduce uses.
(defn reduce [s [$t] init $t f (Fn [$t $t] $t)] $t
(defn reduce [s [const $t] init $t f (Fn [$t $t] $t)] $t
(let [acc init]
(dotimes [i (length s)]
(set acc (f acc (at s i))))
@ -535,7 +535,7 @@ let source = {flan|
;; allocates — (vec-new t), push, returns (Vec t) — and the type-erased Vec
;; runtime needed no change at all, because SizeOf and AlignOf are computed at
;; the instantiation site, where the element type is concrete.
(defn filter [s [$t] keep? (Fn [$t] bool)] (Vec $t)
(defn filter [s [const $t] keep? (Fn [$t] bool)] (Vec $t)
(let [v (vec-new t)]
(dotimes [i (length s)]
(when (keep? (at s i))
@ -599,7 +599,7 @@ let source = {flan|
;; total silently wraps. The per-element (i64 ...) would happen on its own now;
;; it is written to keep the accumulator's type visible at the line that feeds
;; it.
(defn sum-i32 [s [i32]] i64
(defn sum-i32 [s [const i32]] i64
(let [t (i64 0)]
(dotimes [i (length s)]
(set t (+ t (i64 (at s i)))))
@ -612,7 +612,7 @@ let source = {flan|
;; is silently short rather than obviously wrong. An f64 accumulator has 29
;; more bits of mantissa and pushes that failure out of reach of any array a
;; game holds.
(defn sum-f32 [s [f32]] f64
(defn sum-f32 [s [const f32]] f64
(let [t 0.0]
(dotimes [i (length s)]
(set t (+ t (f64 (at s i)))))
@ -620,12 +620,12 @@ let source = {flan|
;; ── Bytes ─────────────────────────────────────────────────────────────
;;
;; Over [u8] and not over string, so (bytes-view s) is what a caller writes and one
;; copy of each serves strings and byte slices both — which is as close to a
;; Over [const u8] and not over string, so (bytes-view s) is what a caller writes
;; and one copy of each serves strings and byte slices both, writable or not — which is as close to a
;; generic as a language without them gets. Nothing here allocates: every
;; result is a bool, an index, or a number.
(defn bytes=? [a [u8] b [u8]] bool
(defn bytes=? [a [const u8] b [const u8]] bool
(if (!= (length a) (length b))
false
(do
@ -637,11 +637,11 @@ let source = {flan|
;; The length test comes first and `and` short-circuits, so the slice is only
;; built once it is known to be in bounds — otherwise a prefix longer than the
;; string would trap rather than answer false.
(defn starts-with? [s [u8] p [u8]] bool
(defn starts-with? [s [const u8] p [const u8]] bool
(and (<= (length p) (length s))
(bytes=? (slice s 0 (length p)) p)))
(defn ends-with? [s [u8] p [u8]] bool
(defn ends-with? [s [const u8] p [const u8]] bool
(and (<= (length p) (length s))
(bytes=? (slice s (- (length s) (length p)) (length s)) p)))
@ -652,7 +652,7 @@ let source = {flan|
;; libc-dependent, and a parser in the language gives the same answer on
;; wasm32 as on native for the same reason rand does.
;; Overflow wraps, as all arithmetic here does; it is not reported.
(defn parse-i64 [s [u8]] (Option i64)
(defn parse-i64 [s [const u8]] (Option i64)
(let [i 0
n (i64 0)
neg false]
@ -1243,7 +1243,7 @@ let source = {flan|
;;
;; Naive, O(n·m), and that is the deliberate choice: Boyer–Moore wants a skip
;; table, which is an array sized by the needle, which is an allocation.
(defn index-of-bytes [s [u8] p [u8]] (Option i32)
(defn index-of-bytes [s [const u8] p [const u8]] (Option i32)
(when (> (length p) (length s))
(return None))
(let [last (- (length s) (length p))
@ -1262,7 +1262,7 @@ let source = {flan|
;; The two loops both test (< lo hi), so an all-whitespace input walks lo up
;; to hi and stops there, and the result is the empty slice. Without that test
;; lo would pass hi and (slice s lo hi) would be a reversed range, which traps.
(defn trim [s [u8]] [u8]
(defn trim [s [const u8]] [const u8]
(let [lo 0
hi (length s)]
(while (and (< lo hi) (space? (at s lo)))
@ -1290,7 +1290,7 @@ let source = {flan|
;; 511 cap is flan_bytes_to_f64's buffer: past it the shim truncates, and a
;; validator that said yes to 600 digits would be approving a different
;; number than the one strtod reads.
(defn parse-f64 [s [u8]] (Option f64)
(defn parse-f64 [s [const u8]] (Option f64)
(let [i 0
digits 0]
(when (or (= (length s) 0) (> (length s) 511))
@ -1372,7 +1372,7 @@ let source = {flan|
(defn rune-start? [b u8] bool
(!= (bit-and b 0xc0) 0x80))
(defn decode-rune [s [u8]] Rune
(defn decode-rune [s [const u8]] Rune
(when (= (length s) 0)
(return (Rune {.code 0 .width 0 .ok false})))
(let [b0 (at s 0)]
@ -1428,7 +1428,7 @@ let source = {flan|
;; Decode at a byte offset. None when the offset is not on a rune boundary or
;; the bytes there are malformed, which is stricter than Odin's rune_at — that
;; one hands back RUNE_ERROR and the caller carries on with a wrong character.
(defn rune-at [s [u8] i i32] (Option i32)
(defn rune-at [s [const u8] i i32] (Option i32)
(if (or (< i 0) (>= i (length s)))
None
(let [r (decode-rune (slice s i (length s)))]
@ -1441,7 +1441,7 @@ let source = {flan|
;;
;; A malformed byte counts as one, which is what a replacement-character
;; renderer would draw, so this agrees with what the screen shows.
(defn rune-count [s [u8]] i32
(defn rune-count [s [const u8]] i32
(let [i 0
n 0]
(while (< i (length s))
@ -1450,7 +1450,7 @@ let source = {flan|
(set n (+ n 1))))
n))
(defn valid-utf8? [s [u8]] bool
(defn valid-utf8? [s [const u8]] bool
(let [i 0]
(while (< i (length s))
(let [r (decode-rune (slice s i (length s)))]
@ -1529,12 +1529,12 @@ let source = {flan|
;; empty field, and `rest` is exhausted only after the last one is taken. That
;; is the rule you can state without exceptions, and the one a caller counting
;; comma-separated columns needs.
(defstruct Split [rest [u8] sep u8 more bool])
(defstruct Split [rest [const u8] sep u8 more bool])
(defn split-on-byte [s [u8] sep u8] Split
(defn split-on-byte [s [const u8] sep u8] Split
(Split {.rest s .sep sep .more true}))
(defn split-next [it (Ptr Split)] (Option [u8])
(defn split-next [it (Ptr Split)] (Option [const u8])
(when (not (.more it))
(return None))
(match (index-of (.rest it) (.sep it))
@ -1556,25 +1556,11 @@ let source = {flan|
;; the ones in the building section below; these are the forms that allocate
;; nothing, and they stay the right call when a copy is not wanted — folding a
;; comparison over two inputs beats lowering both and comparing. What is *not*
;; on offer is the third shape, lowering a [u8] in place, and it is worth
;; saying why rather than shipping it. A string
;; literal is emitted `private unnamed_addr constant` (emit.ml), so (bytes-view
;; "Hello") is a [u8] pointing straight into read-only memory. An in-place
;; lower-ascii type checks against that slice, and what happens next depends
;; on the optimiser — which is the worst of the available answers. Measured,
;; with (set (at (bytes-view "Hi") 0) \h):
;;
;; -O0 the store is emitted against the constant and the program takes
;; SIGSEGV.
;; -O2 LLVM deletes the store as undefined behaviour and the program
;; carries on and prints "Hi".
;;
;; So the same source either dies or silently does nothing depending on a
;; flag, and the -O2 half is the quiet-wrongness class this file keeps
;; refusing elsewhere. (bytes s) answers a writable copy now for exactly this
;; reason; these byte functions stay the right call when no copy is wanted,
;; and a caller that really does own its buffer writes the two-line loop
;; itself over storage it can see the declaration of.
;; on offer is the third shape, lowering a [u8] in place: the text a caller
;; has is most often a (bytes-view s), which is a [const u8] because a string
;; literal's bytes are in read-only memory, and an in-place lower could not
;; take it. (bytes s) is the writable copy; a caller that owns its buffer
;; writes the two-line loop itself.
;;
;; ASCII only, and only the 26 letters: case outside ASCII is not a byte
;; operation at all — it is per-code-point, it is not length-preserving (ß
@ -1589,7 +1575,7 @@ let source = {flan|
;; Case-insensitive comparison as a fold over both inputs, which is the useful
;; half of to_lower and needs no storage at all: comparing two lowered copies
;; is what a caller wanted, and this is that answer without either copy.
(defn bytes-ci=? [a [u8] b [u8]] bool
(defn bytes-ci=? [a [const u8] b [const u8]] bool
(if (!= (length a) (length b))
false
(do
@ -1601,7 +1587,7 @@ let source = {flan|
;; ── Ordering byte slices, and sorting them ────────────────────────────
;;
;; The third element type the slice family covers, and the one a caller of
;; `split` actually has: a [[u8]] of fields, wanting to come out in order.
;; `split` actually has: a [[const u8]] of fields, wanting to come out in order.
;;
;; The order is bytewise-lexicographic — memcmp's, and the one every sane
;; sorted format uses. It is explicitly *not* alphabetical and not a collation:
@ -1618,7 +1604,7 @@ let source = {flan|
;; A prefix sorts before what extends it — "ab" before "abc" — which falls out
;; of running to the shorter length and then comparing lengths, and is the case
;; a loop written to (length a) alone reads off the end for.
(defn bytes<? [a [u8] b [u8]] bool
(defn bytes<? [a [const u8] b [const u8]] bool
(let [n (min (length a) (length b))]
(dotimes [i n]
(when (!= (at a i) (at b i))
@ -1626,7 +1612,7 @@ let source = {flan|
(< (length a) (length b))))
;; sort-by with the comparison written in, over the same in-place contract:
;; the *slices* move, never the bytes they point at, so this sorts a [[u8]] of
;; the *slices* move, never the bytes they point at, so this sorts a [[const u8]] of
;; fields borrowed from one buffer without touching the buffer. Stable, and
;; here that is observable — two equal fields are two distinct slices of
;; different parts of the input, and a caller can see which one came first.
@ -1637,7 +1623,7 @@ let source = {flan|
;; lexicographically is a loop and not an instruction. bytes<? is that loop.
;; So this is the shape a generic takes when the operation it needs is not a
;; primitive: pass it in.
(defn sort-bytes [s [[u8]]] ()
(defn sort-bytes [s [[const u8]]] ()
(sort-by s (fn [a b] (bytes<? a b))))
;; ── Building bytes, which is the tier that needed an allocator ────────
@ -1676,7 +1662,7 @@ let source = {flan|
;; It takes a (Ptr (Vec u8)) and not a (Vec u8), and the difference is not
;; style: a Vec parameter *moves*, so (append b s) taking one by value would
;; consume the caller's builder on the first call and refuse the second.
(defn append [b (Ptr (Vec u8)) s [u8]] ()
(defn append [b (Ptr (Vec u8)) s [const u8]] ()
(dotimes [i (length s)]
(push (deref b) (at s i))))
@ -1692,12 +1678,13 @@ let source = {flan|
;; concat and join. Both take a slice of slices, which is the shape a caller
;; already has: an array literal of them, [(bytes-view "a") (bytes-view b)], slices to a
;; [[u8]] and copies nothing.
;; [[const u8]] and copies nothing. The outer slice is const too, which is what
;; lets a [[u8]] in as well: nothing here can store a read-only slice into it.
;;
;; join with an empty separator is concat, and concat is here anyway because
;; the empty (bytes-view "") a caller would have to write is the kind of argument
;; that reads like a mistake at the call site.
(defn concat [parts [[u8]]] (Vec u8)
(defn concat [parts [const [const u8]]] (Vec u8)
(let [b (vec-new u8)]
(dotimes [i (length parts)]
(append (addr b) (at parts i)))
@ -1707,7 +1694,7 @@ let source = {flan|
;; result rather than a leading separator — which is the off-by-one a join
;; written as "append part then separator, then chop the tail" gets wrong on
;; exactly that input, because there is no tail to chop.
(defn join [parts [[u8]] sep [u8]] (Vec u8)
(defn join [parts [const [const u8]] sep [const u8]] (Vec u8)
(let [b (vec-new u8)]
(dotimes [i (length parts)]
(when (> i 0)
@ -1715,24 +1702,21 @@ let source = {flan|
(append (addr b) (at parts i)))
b))
(defn repeat-bytes [s [u8] n i32] (Vec u8)
(defn repeat-bytes [s [const u8] n i32] (Vec u8)
(let [b (vec-new u8)]
(dotimes [i n]
(append (addr b) s))
b))
;; The allocating halves of the ASCII case pair. The note above lower-ascii
;; explains why lowering a [u8] *in place* is a trap — a string literal is
;; emitted into .rodata, so the store either segfaults at -O0 or is deleted at
;; -O2 — and this is the shape that has no such hole: the bytes it writes are
;; its own.
(defn to-lower [s [u8]] (Vec u8)
;; says why there is no in-place one; these write only bytes of their own.
(defn to-lower [s [const u8]] (Vec u8)
(let [b (vec-new u8)]
(dotimes [i (length s)]
(push b (lower-ascii (at s i))))
b))
(defn to-upper [s [u8]] (Vec u8)
(defn to-upper [s [const u8]] (Vec u8)
(let [b (vec-new u8)]
(dotimes [i (length s)]
(push b (upper-ascii (at s i))))
@ -1751,7 +1735,7 @@ let source = {flan|
;; choice: returning a Vec *moves* it, and the move analysis is a dead set over
;; the whole function, so a `return b` on one branch kills the binding for the
;; `b` at the foot of the other. One exit, one move.
(defn replace-bytes [s [u8] from [u8] to [u8]] (Vec u8)
(defn replace-bytes [s [const u8] from [const u8] to [const u8]] (Vec u8)
(let [b (vec-new u8)
i 0]
(if (= (length from) 0)
@ -1776,7 +1760,7 @@ let source = {flan|
;; the other way. A return type does say it. That is a compiler gap rather than
;; a language decision, and it is written down in TODO.org, "(vec-new [u8]) is
;; refused".
(defn slices-new [] (Vec [u8]) (vec-new))
(defn slices-new [] (Vec [const u8]) (vec-new))
;; split, which the file used to refuse by name. The fields are slices *of the
;; input* and not copies, so nothing here owns bytes and the result dies with
@ -1788,7 +1772,7 @@ let source = {flan|
;; always yield n+1 fields, so the empty input yields one empty field and a
;; trailing separator yields a trailing empty one. That is Odin's allocating
;; strings.split and not Odin's iterator, which disagree with each other.
(defn split [s [u8] sep u8] (Vec [u8])
(defn split [s [const u8] sep u8] (Vec [const u8])
(let [v (slices-new)
it (split-on-byte s sep)
going true]
@ -1944,10 +1928,9 @@ let source = {flan|
;;
;; `data` points into the program's own .rodata, exactly as a string literal
;; does, so an embed costs nothing at run time and nothing at startup. It is
;; also read-only, and the same trap the ASCII-case note above measures applies
;; here: a store through it either segfaults at -O0 or is deleted at -O2. To
;; get a mutable copy, clone the bytes into a Vec.
(defstruct EmbedFile [name string data [u8]])
;; also read-only, so `data` is a [const u8] and a store through it is refused
;; at compile time. To get a writable copy, copy the bytes into a Vec.
(defstruct EmbedFile [name string data [const u8]])
;; A linear scan, deliberately. A directory embed is tens of entries, the scan
;; is over names already in cache-warm .rodata, and the alternative — a
@ -1958,7 +1941,7 @@ let source = {flan|
;; It takes a slice rather than the array (embed-dir) answers, because an array
;; length is part of its type and there are no generics: write
;; (embed-find (slice assets 0 (length assets)) "brush.png").
(defn embed-find [files [EmbedFile] name string] (Option [u8])
(defn embed-find [files [EmbedFile] name string] (Option [const u8])
(dotimes [i (length files)]
(when (bytes=? (bytes-view (.name (at files i))) (bytes-view name))
(return (Some (.data (at files i))))))

10
lib/render.ml
View File

@ -110,7 +110,7 @@ let rec render ?(refuse = print_refusal) c depth (e : Tast.expr) : Tast.expr lis
let cast t x = { Tast.e = Tast.Prim (Tast.Cast t, [ x ]); ty = t; loc } in
let bytes_of s =
{ Tast.e = Tast.Prim (Tast.Bytes, [ { Tast.e = Tast.Str s; ty = Types.String; loc } ]);
ty = Types.Slice (Types.Int Types.U8); loc }
ty = Types.Slice (Types.Mut, (Types.Int Types.U8)); loc }
in
let lit s = c.emit.ebytes (bytes_of s) in
let int64 n = { Tast.e = Tast.Int (n, Types.I64); ty = Types.Int Types.I64; loc } in
@ -152,10 +152,10 @@ let rec render ?(refuse = print_refusal) c depth (e : Tast.expr) : Tast.expr lis
| Types.String ->
[ c.emit.estr
{ Tast.e = Tast.Prim (Tast.Bytes, [ e ]);
ty = Types.Slice (Types.Int Types.U8); loc } ]
ty = Types.Slice (Types.Mut, (Types.Int Types.U8)); loc } ]
(* Bytes are almost always text, and escaping makes the case where they are
not readable rather than a mess. *)
| Types.Slice (Types.Int Types.U8) -> [ c.emit.estr e ]
| Types.Slice (_, (Types.Int Types.U8)) -> [ c.emit.estr e ]
(* An enum's members are erased to i32 before the backend sees them, so the
name has to be recovered here, from the checker's table, as a chain of
comparisons. Falling through to the number is not a failure: a value
@ -193,7 +193,7 @@ let rec render ?(refuse = print_refusal) c depth (e : Tast.expr) : Tast.expr lis
An address the registry never saw is neither: it prints [<ptr>]. That
is a stack local, a global, or a pointer from C, and the shadow stack
and the static type table already answer for the first two by name. *)
| Types.Ptr t ->
| Types.Ptr (_, t) ->
(match c.ptrs with
| None -> [ lit "<ptr>" ]
| Some pt ->
@ -355,7 +355,7 @@ let rec render ?(refuse = print_refusal) c depth (e : Tast.expr) : Tast.expr lis
(* A slice's length is not known until it runs, so this is the one case
that needs a loop. The slice goes into a slot first: the expression it
came from must not be evaluated once per element. *)
| Types.Slice t ->
| Types.Slice (_, t) ->
let sv = c.alloc e.Tast.ty and iv = c.alloc (Types.Int Types.I32) in
let local i ty = { Tast.e = Tast.Local i; ty; loc } in
let len =

192
lib/session.ml
View File

@ -256,8 +256,7 @@ let with_expansion_macros (forms : Form.t list) (load : unit -> 'a) : 'a * Form.
Parse.expansion_macros := [];
(r, Load.macro_union (own_macros forms) defined)
let create ?(debug = false) ?(x86 = false) ~file () =
let forms = Reader.read_file file in
let of_forms ~debug ~x86 ~file forms =
let l, mine = with_expansion_macros forms (fun () -> Load.program ~file forms) in
let p, env = Check.program_with_env l.Load.decls in
({ file; decls = l.Load.decls; program = p; env; host = p; pkgs = l.Load.pkgs;
@ -268,6 +267,90 @@ let create ?(debug = false) ?(x86 = false) ~file () =
thunks = 0; debug; x86;
built = record_built env p p.Tast.fns SM.empty; live = SM.empty }, l)
let create ?(debug = false) ?(x86 = false) ~file () =
of_forms ~debug ~x86 ~file (Reader.read_file file)
(* ── A file loaded a form at a time, keeping what compiles ─────────── *)
(* The form a diagnostic is about: the last one in [forms] that starts at or
before the position it was reported at — the call, for an error inside a
macro's expansion. [None] when the position is in no file these forms came
from, which is an error nothing here can drop a form to avoid. *)
let blame (forms : Form.t list) (d : Loc.diag) : Form.t option =
let at = Loc.call_site d.Loc.dloc in
List.fold_left
(fun acc (f : Form.t) ->
if String.equal f.Form.loc.Loc.file at.Loc.file
&& Loc.before f.Form.loc at <= 0
then Some f
else acc)
None forms
(* SBCL's [load] and CIDER's load-file: a file whose third form does not
compile still defines the other two. [attempt] is run over [forms]; each
refusal drops the form it is about and runs it again over the rest, so a
form that only failed because it called one that was dropped is dropped
with its own error on the next round. Each round drops at least one form,
so this ends. Answers what [attempt] returned, the forms it was given, and
every error in the order found. An error no form can be blamed for is
raised as it came. *)
let pruned (attempt : Form.t list -> 'a) (forms : Form.t list) :
'a * Form.t list * Loc.diag list =
let rec go forms errs =
let drop ds e =
let bad = List.map (blame forms) ds in
if List.exists Option.is_none bad then raise e
else
let bad = List.filter_map Fun.id bad in
go (List.filter (fun f -> not (List.memq f bad)) forms)
(List.rev_append ds errs)
in
match attempt forms with
| r -> (r, forms, List.rev errs)
| exception (Loc.Error d as e) -> drop [ d ] e
| exception (Loc.Errors ds as e) -> drop ds e
in
go forms []
(* Where [flan dev] writes the [main] a file without one is given. Not a path:
nothing reads it back, and a location here is how the session tells that
[main] apart from one somebody wrote. *)
let stub_file = "<flan dev>"
let stub_main () = Reader.read_all ~file:stub_file "(defn main [] i32 0)"
let declares_main (forms : Form.t list) =
List.exists
(fun (f : Form.t) ->
match f.Form.v with
| Form.List
({ Form.v = Form.Sym "defn"; _ } :: { Form.v = Form.Sym "main"; _ } :: _)
-> true
| _ -> false)
forms
(* Whether the [main] this session would run is one somebody wrote. *)
let has_main t =
List.exists
(fun (d : Ast.decl) ->
Ast.declared_name d = Some "main"
&& not (String.equal d.Ast.dloc.Loc.file stub_file))
t.decls
(* The session [flan dev] starts: the file's forms loaded as [pruned] loads
them, so what compiles is in the host and what does not is answered beside
the session rather than instead of it. A file with no [main] — or whose
[main] is one of the forms left out — is the empty image of SBCL's order: a
[main] that returns at once is added so there is a process to park, and a
[main] loaded later replaces the stub like any other redefinition. *)
let create_dev ?(debug = false) ?(x86 = false) ~file () =
let build forms =
of_forms ~debug ~x86 ~file
(if declares_main forms then forms else forms @ stub_main ())
in
let (t, l), _, errs = pruned build (Reader.read_file file) in
(t, l, errs)
(* What a macro may call, for the same reason [macros] is held: an evaluation
parses one form with no import in sight, and a package macro whose body
calls its own package's functions has to find them. [Load.program] hands
@ -339,6 +422,29 @@ let package_of t origin =
(* A name the running process exports. Everything else is looked up by name at
install time — see [Emit.redefinition]'s [known]. *)
(* The macros a form sent from [origin] can call. From a package's file that
is the package's own under the bare names the file writes, in front of the
rest: the session holds them qualified, as the importer calls them, and a
bare call parsed without these is a call to an unknown function that the
qualification afterwards turns into a call to the macro's own name. *)
let macros_for t origin =
match package_of t origin with
| None -> t.macros
| Some p ->
let pre = p.Load.alias ^ "/" in
let bare =
List.filter_map
(fun (f : Form.t) ->
match f.Form.v with
| Form.List (hd :: ({ Form.v = Form.Sym n; _ } as nf) :: rest)
when String.starts_with ~prefix:pre n ->
let b = String.sub n (String.length pre) (String.length n - String.length pre) in
Some { f with Form.v = Form.List (hd :: { nf with Form.v = Form.Sym b } :: rest) }
| _ -> None)
t.macros
in
Load.macro_union bare t.macros
let known t n =
List.exists (fun (f : Tast.fn) -> String.equal f.Tast.name n) t.host.Tast.fns
|| List.exists
@ -676,12 +782,19 @@ let restore t h =
newest one and no older activation is left running. *)
let rerun t = t.live <- SM.empty
let eval ?(origin = "<eval>") ?pause ?(running = true) t src : change =
let forms = Reader.read_all ~file:origin src in
(* [forms], when given, are [src] already read — [pruned] runs this over a
file a form fewer each round and has no text for the subset. [base] is the
file an [(import ...)] in them is resolved against, the session's own when
absent: a file loaded from another directory names its packages from
there. *)
let eval ?(origin = "<eval>") ?base ?forms ?pause ?(running = true) t src : change =
let forms =
match forms with Some f -> f | None -> Reader.read_all ~file:origin src
in
(* What an annotated listing quotes for this form is what was sent, not what
the file on disk said when it was last read. *)
Loc.remember ~file:origin src;
Parse.with_imported ~decls:(package_decls t) t.macros @@ fun () ->
Parse.with_imported ~decls:(package_decls t) (macros_for t origin) @@ fun () ->
(* Through [Load] like any other source, so an evaluated (import ...) means
what it means in a file. Its expansion is what gets spliced, which is also
why the accumulated list is the post-Load one: re-evaluating a file that
@ -690,7 +803,8 @@ let eval ?(origin = "<eval>") ?pause ?(running = true) t src : change =
let macros = ref t.macros in
let incoming =
let l, mine =
with_expansion_macros forms (fun () -> Load.program ~file:t.file forms)
with_expansion_macros forms (fun () ->
Load.program ~file:(Option.value base ~default:t.file) forms)
in
(* An evaluated import *adds* to the session's set, so a macro brought in
by C-c C-k is there for the C-c C-c after it. A union and not an
@ -1206,8 +1320,8 @@ let eval ?(origin = "<eval>") ?pause ?(running = true) t src : change =
type emitter = { ename : string; ety : Types.t }
let emit_bytes = { ename = "flan/dev-emit"; ety = Types.Slice (Types.Int Types.U8) }
let emit_str = { ename = "flan/dev-emit-str"; ety = Types.Slice (Types.Int Types.U8) }
let emit_bytes = { ename = "flan/dev-emit"; ety = Types.Slice (Types.Mut, (Types.Int Types.U8)) }
let emit_str = { ename = "flan/dev-emit-str"; ety = Types.Slice (Types.Mut, (Types.Int Types.U8)) }
let emit_i64 = { ename = "flan/dev-emit-i64"; ety = Types.Int Types.I64 }
let emit_u64 = { ename = "flan/dev-emit-u64"; ety = Types.Int Types.U64 }
let emit_f64 = { ename = "flan/dev-emit-f64"; ety = Types.Float Types.F64 }
@ -1229,12 +1343,12 @@ let externs : Tast.extern list =
is. See [render_locals]. *)
{ Tast.ename = "flan/dev-slot"; esym = "flan_agent_frame_slot";
eparams = [ Types.Int Types.I64; Types.Int Types.I64 ];
eret = Types.Ptr (Types.Int Types.U8); eloc = Loc.unknown };
eret = Types.Ptr (Types.Mut, (Types.Int Types.U8)); eloc = Loc.unknown };
(* The condition the stopped program is holding, same contract: the agent
resolves it against the snapshot on top when the thunk runs, and NULL
when there is none. See [render_condition]. *)
{ Tast.ename = "flan/dev-cond"; esym = "flan_agent_condition";
eparams = []; eret = Types.Ptr (Types.Int Types.U8);
eparams = []; eret = Types.Ptr (Types.Mut, (Types.Int Types.U8));
eloc = Loc.unknown };
(* The character beside a rendered byte. See [Render.pointers]. *)
{ Tast.ename = "flan/dev-emit-u8-char"; esym = "flan_dev_emit_u8_char";
@ -1259,10 +1373,10 @@ let externs : Tast.extern list =
written" is already the right rendering for an address the registry
never saw. *)
{ Tast.ename = "flan/reg-live"; esym = "flan_dev_reg_live";
eparams = [ Types.Ptr (Types.Int Types.U8) ];
eparams = [ Types.Ptr (Types.Mut, (Types.Int Types.U8)) ];
eret = Types.Int Types.I32; eloc = Loc.unknown };
{ Tast.ename = "flan/reg-emit"; esym = "flan_dev_reg_emit";
eparams = [ Types.Ptr (Types.Int Types.U8) ];
eparams = [ Types.Ptr (Types.Mut, (Types.Int Types.U8)) ];
eret = Types.Int Types.I32; eloc = Loc.unknown } ]
(* The REPL's emitter. Each piece is one extern call: the dev runtime already
@ -1291,8 +1405,8 @@ let dev_pointers : Render.pointers =
let ask name (p : Tast.expr) : Tast.expr =
let loc = p.Tast.loc in
let byte =
{ Tast.e = Tast.Prim (Tast.Cast (Types.Ptr (Types.Int Types.U8)), [ p ]);
ty = Types.Ptr (Types.Int Types.U8); loc }
{ Tast.e = Tast.Prim (Tast.Cast (Types.Ptr (Types.Mut, (Types.Int Types.U8))), [ p ]);
ty = Types.Ptr (Types.Mut, (Types.Int Types.U8)); loc }
in
{ Tast.e = Tast.Call (name, [ byte ]); ty = i32; loc }
in
@ -1421,7 +1535,7 @@ let render_locals ?(origin = "<locals>") t ~frame ~(fn : Tast.fn) ~bound
let bytes_of str =
{ Tast.e =
Tast.Prim (Tast.Bytes, [ { Tast.e = Tast.Str str; ty = Types.String; loc } ]);
ty = Types.Slice (Types.Int Types.U8); loc }
ty = Types.Slice (Types.Mut, (Types.Int Types.U8)); loc }
in
let lit str = c.Render.emit.Render.ebytes (bytes_of str) in
let refused = ref [] in
@ -1432,11 +1546,11 @@ let render_locals ?(origin = "<locals>") t ~frame ~(fn : Tast.fn) ~bound
in
let address =
{ Tast.e = Tast.Call ("flan/dev-slot", [ idx frame; idx i ]);
ty = Types.Ptr (Types.Int Types.U8); loc }
ty = Types.Ptr (Types.Mut, (Types.Int Types.U8)); loc }
in
let typed =
{ Tast.e = Tast.Prim (Tast.Cast (Types.Ptr ty), [ address ]);
ty = Types.Ptr ty; loc }
{ Tast.e = Tast.Prim (Tast.Cast (Types.Ptr (Types.Mut, ty)), [ address ]);
ty = Types.Ptr (Types.Mut, ty); loc }
in
let v = { Tast.e = Tast.Deref typed; ty; loc } in
match Render.render c 0 v with
@ -1533,18 +1647,18 @@ let render_condition t ~(st : Tast.structure) : change * (string * string) list
let bytes_of str =
{ Tast.e =
Tast.Prim (Tast.Bytes, [ { Tast.e = Tast.Str str; ty = Types.String; loc } ]);
ty = Types.Slice (Types.Int Types.U8); loc }
ty = Types.Slice (Types.Mut, (Types.Int Types.U8)); loc }
in
let lit str = c.Render.emit.Render.ebytes (bytes_of str) in
let refused = ref [] in
let cty = Types.Named st.Tast.sname in
let address =
{ Tast.e = Tast.Call ("flan/dev-cond", []);
ty = Types.Ptr (Types.Int Types.U8); loc }
ty = Types.Ptr (Types.Mut, (Types.Int Types.U8)); loc }
in
let typed =
{ Tast.e = Tast.Prim (Tast.Cast (Types.Ptr cty), [ address ]);
ty = Types.Ptr cty; loc }
{ Tast.e = Tast.Prim (Tast.Cast (Types.Ptr (Types.Mut, cty)), [ address ]);
ty = Types.Ptr (Types.Mut, cty); loc }
in
let root = { Tast.e = Tast.Deref typed; ty = cty; loc } in
let one i (f : Tast.field) =
@ -1652,7 +1766,7 @@ let step_into t (v : Tast.expr) (s : step) : (Tast.expr, string) result =
{ Tast.e = Tast.Int (Int64.of_int i, Types.I32);
ty = Types.Int Types.I32; loc } ]);
ty = el; loc }
| Types.Slice el ->
| Types.Slice (_, el) ->
(* A slice's length is not in its type, so this is the one step whose
range cannot be settled here. It is checked in the program, like
every other index in a dev build. *)
@ -1797,11 +1911,11 @@ let render_slot ?(origin = "<inspect>") t ~frame ~(fn : Tast.fn) ~slot ~path
let ty = fn.Tast.slots.(slot) in
let address =
{ Tast.e = Tast.Call ("flan/dev-slot", [ idx frame; idx slot ]);
ty = Types.Ptr (Types.Int Types.U8); loc }
ty = Types.Ptr (Types.Mut, (Types.Int Types.U8)); loc }
in
let typed =
{ Tast.e = Tast.Prim (Tast.Cast (Types.Ptr ty), [ address ]);
ty = Types.Ptr ty; loc }
{ Tast.e = Tast.Prim (Tast.Cast (Types.Ptr (Types.Mut, ty)), [ address ]);
ty = Types.Ptr (Types.Mut, ty); loc }
in
let root = { Tast.e = Tast.Deref typed; ty; loc } in
let rec walk v = function
@ -1832,7 +1946,7 @@ let render_slot ?(origin = "<inspect>") t ~frame ~(fn : Tast.fn) ~slot ~path
Tast.Prim
(Tast.Cast (Types.Int Types.I64),
[ { Tast.e = Tast.Prim (Tast.AddrOf, [ v ]);
ty = Types.Ptr v.Tast.ty; loc } ]);
ty = Types.Ptr (Types.Mut, v.Tast.ty); loc } ]);
ty = Types.Int Types.I64; loc }
in
let newline =
@ -1840,7 +1954,7 @@ let render_slot ?(origin = "<inspect>") t ~frame ~(fn : Tast.fn) ~slot ~path
Tast.Prim
(Tast.Bytes,
[ { Tast.e = Tast.Str "\n"; ty = Types.String; loc } ]);
ty = Types.Slice (Types.Int Types.U8); loc }
ty = Types.Slice (Types.Mut, (Types.Int Types.U8)); loc }
in
dev_emitter.Render.ei64 addr :: dev_emitter.Render.ebytes newline
:: parts
@ -2012,11 +2126,11 @@ let write_slot ?(origin = "<set>") t ~frame ~(fn : Tast.fn) ~slot ~path
let ty = fn.Tast.slots.(slot) in
let address =
{ Tast.e = Tast.Call ("flan/dev-slot", [ idx frame; idx slot ]);
ty = Types.Ptr (Types.Int Types.U8); loc }
ty = Types.Ptr (Types.Mut, (Types.Int Types.U8)); loc }
in
let typed =
{ Tast.e = Tast.Prim (Tast.Cast (Types.Ptr ty), [ address ]);
ty = Types.Ptr ty; loc }
{ Tast.e = Tast.Prim (Tast.Cast (Types.Ptr (Types.Mut, ty)), [ address ]);
ty = Types.Ptr (Types.Mut, ty); loc }
in
let root = { Tast.e = Tast.Deref typed; ty; loc } in
let rec walk v = function
@ -2194,7 +2308,7 @@ let render_globals ?(origin = "<globals>") t ~(globals : Tast.global list)
let bytes_of str =
{ Tast.e =
Tast.Prim (Tast.Bytes, [ { Tast.e = Tast.Str str; ty = Types.String; loc } ]);
ty = Types.Slice (Types.Int Types.U8); loc }
ty = Types.Slice (Types.Mut, (Types.Int Types.U8)); loc }
in
let lit str = c.Render.emit.Render.ebytes (bytes_of str) in
let nullary n = { Tast.e = Tast.Call (n, []); ty = Types.Unit; loc } in
@ -2262,7 +2376,17 @@ let eval_expr ?(origin = "<eval>") ?(pause = false) t src : change =
a cold macro module costs its ~300ms before that clock starts,
and the non-termination refusals raise [Loc.Error] out of this call, which
the daemon already answers as an error rather than a silence. *)
let parsed = Parse.with_imported ~decls:(package_decls t) t.macros (fun () -> Parse.expr form) in
let parsed = Parse.with_imported ~decls:(package_decls t) (macros_for t origin) (fun () -> Parse.expr form) in
(* CIDER's rule: an expression sent from a package's file means what it
would mean written in that file, so [(integrate 1.0)] in physics/step.flan
reaches [physics/integrate]. The qualification [eval] gives a declaration
from the same buffer. A [defn-] is reachable too, because the location
[private_ref] compares is the buffer's own path. *)
let parsed =
match package_of t origin with
| None -> parsed
| Some p -> Load.rename_expr p.Load.owns p.Load.alias [] parsed
in
(* Wrapped before the checker, so the call is checked like any other and a
prelude that stopped offering [pause] would be an ordinary unknown name
rather than a thunk that silently did not stop. The [Do] takes the
@ -2425,7 +2549,7 @@ let macroexpand ?(origin = "<eval>") ~(all : bool) t (src : string) : expansion
let before = Expand.quasiquote form in
(* And the session's macros in front of it, as [eval] and [eval_expr] both
put them: [Macro.program] reads [Parse.imported_macros] directly. *)
Parse.with_imported ~decls:(package_decls t) t.macros @@ fun () ->
Parse.with_imported ~decls:(package_decls t) (macros_for t origin) @@ fun () ->
let after, name =
if all then Macro.expand_all before else Macro.expand_step before
in

2
lib/shim.ml
View File

@ -221,6 +221,8 @@ let rec cty env ~needed ~loc ~what (t : Ast.texpr) : string =
else
fail loc "%s is %s, which is not a type this shim generator knows" what n)
| Ast.Tapp ("Ptr", [ e ]) -> cty env ~needed ~loc ~what e ^ " *"
| Ast.Tapp ("Ptr", [ { Ast.t = Ast.Tname "const"; _ }; e ]) ->
"const " ^ cty env ~needed ~loc ~what e ^ " *"
| Ast.Tapp ("Option", _) ->
fail loc
"%s is an Option, which C has no shape for — declare what C returns and \

64
lib/types.ml
View File

@ -18,6 +18,17 @@ type ikind = I8 | I16 | I32 | I64 | U8 | U16 | U32 | U64
type fkind = F32 | F64
(* Whether a slice may be stored through. [[const T]] is a view that can only
be read: [bytes-view] answers one, because its bytes are a string's and a
string literal's are in read-only memory. A [[T]] converts to a
[[const T]] implicitly and never back — see [const_widens] at the bottom of
this file — so every writable view is also a readable one, and a
read-only one cannot be laundered into a writable one. The const is
shallow: a [[const [u8]]] may not have its elements replaced, but each
element is a writable [[u8]] of its own. Both are the same two words at
run time; only the checker reads the flag. *)
type access = Mut | Const
type t =
| Int of ikind
| Float of fkind
@ -29,10 +40,10 @@ type t =
(* A C enum: an i32 at run time, but its own type, so a keyword at a call
site has something to resolve against and a plain integer does not fit. *)
| Enum of string
| Slice of t (* [T] ptr+len, non-owning *)
| Slice of access * t (* [T] [const T] ptr+len, non-owning *)
| Array of int64 * t (* [n T] inline, a value, copies *)
| Map of t * t (* (Map K V) *)
| Ptr of t (* (Ptr T) *)
| Ptr of access * t (* (Ptr T) (Ptr const T) *)
(* [Allocator]: a builtin opaque type, the way [string] is a builtin
ptr+len. It is a [Types.t] case with no user-writable constructor, which
is what lets spec-memory.md's "procedure plus an opaque data pointer" be
@ -180,10 +191,10 @@ let rec equal a b =
one dyn type the way there is one string type. *)
| Bool, Bool | String, String | Unit, Unit | Never, Never | Dyn, Dyn -> true
| Named x, Named y | Enum x, Enum y -> String.equal x y
| Slice x, Slice y -> equal x y
| Slice (a, x), Slice (b, y) -> a = b && equal x y
| Array (n, x), Array (m, y) -> Int64.equal n m && equal x y
| Map (k, v), Map (k', v') -> equal k k' && equal v v'
| Ptr x, Ptr y -> equal x y
| Ptr (a, x), Ptr (b, y) -> a = b && equal x y
| Alloc, Alloc -> true
| Vec x, Vec y -> equal x y
| Option x, Option y -> equal x y
@ -205,10 +216,12 @@ let rec to_string = function
| Unit -> "()"
| Never -> "Never"
| Named n | Enum n -> n
| Slice t -> "[" ^ to_string t ^ "]"
| Slice (Mut, t) -> "[" ^ to_string t ^ "]"
| Slice (Const, t) -> "[const " ^ to_string t ^ "]"
| Array (n, t) -> Printf.sprintf "[%Ld %s]" n (to_string t)
| Map (k, v) -> Printf.sprintf "(Map %s %s)" (to_string k) (to_string v)
| Ptr t -> "(Ptr " ^ to_string t ^ ")"
| Ptr (Mut, t) -> "(Ptr " ^ to_string t ^ ")"
| Ptr (Const, t) -> "(Ptr const " ^ to_string t ^ ")"
| Alloc -> "Allocator"
| Vec t -> "(Vec " ^ to_string t ^ ")"
| Option t -> "(Option " ^ to_string t ^ ")"
@ -319,3 +332,42 @@ let join a b =
else if widens_to ~from:a ~into:b then Some b
else if widens_to ~from:b ~into:a then Some a
else None
(* The one conversion between the two slice types, and it goes one way: a
[[T]] may be seen as a [[const T]], because a view that can only be read
asks less of its bytes than one that can be written. Under a const slice
the same holds one level down — [[[u8]]] reads as [[const [const u8]]] —
because nothing can be stored through the outer view to put a read-only
slice where the writable original expects a writable one. Under a writable
slice it does not: a [[[u8]]] seen as [[[const u8]]] could have a
read-only slice stored into it and read back out as a [[u8]]. Like
[widens_to] this is a predicate and not a loosening of [equal]; the
caller is [Check.expect], which retypes the value — the two words are the
same at run time. *)
let rec const_widens ~(from : t) ~(into : t) =
match from, into with
| Slice (_, a), Slice (Const, b) | Ptr (_, a), Ptr (Const, b) ->
equal a b || const_widens ~from:a ~into:b
| _ -> false
(* The one type two branches of an [if], or two arguments at one type
variable, meet at when they differ only in const: the read-only one,
whichever came first. *)
let const_join a b =
if equal a b then Some a
else if const_widens ~from:a ~into:b then Some b
else if const_widens ~from:b ~into:a then Some a
else None
(* A function of one signature standing where another is wanted, when the
two differ only in const. A parameter may be more permissive than asked —
a function that takes a [[const T]] only reads what it is handed, so a
caller handing it a [[T]] loses nothing — and a result may be less so: a
[[T]] returned where a [[const T]] is wanted is [const_widens]'s case. The
two words are the same either way, so [Check.expect] only retypes. *)
let fn_accepts ~(from : t list * t) ~(into : t list * t) =
let ps', r' = from and ps, r = into in
List.length ps = List.length ps'
&& List.for_all2
(fun p p' -> equal p p' || const_widens ~from:p ~into:p') ps ps'
&& (equal r r' || const_widens ~from:r' ~into:r)

20
lib/x86.ml
View File

@ -1559,7 +1559,7 @@ type arg =
move-only container by address. *)
let classify_c (l : loc) (t : Types.t) =
match t with
| Types.String | Types.Slice _ -> [ Aint (l, Types.Ptr Types.Unit); Alen l ]
| Types.String | Types.Slice _ -> [ Aint (l, Types.Ptr (Types.Mut, Types.Unit)); Alen l ]
| Types.Unit | Types.Never -> []
| Types.Vec _ | Types.Map _ -> [ Aptr l ]
(* A fixed array crossing into a dyn view (M2 item 3) needs its address for
@ -1847,7 +1847,7 @@ and lower_at f (e : Tast.expr) (dst : loc) : unit =
| None -> xor_rr f.b ~dst:rax ~src:rax
| Some (`Made p) -> load_int f.b ~dst:rax ~mm:(Frame p) ~size:8 ~signed:false
| Some (`Expr ev) ->
let l = eval f ev in load_loc f ~reg:rax l (Types.Ptr Types.Unit));
let l = eval f ev in load_loc f ~reg:rax l (Types.Ptr (Types.Mut, Types.Unit)));
store_int f.b ~src:rax ~mm:(lmem f (shift dst 8) ~scratch:r11) ~size:8
| Tast.FnAddr r ->
fnaddr_at f ~loc:e.Tast.loc ~reg:rax r;
@ -1875,7 +1875,7 @@ and lower_at f (e : Tast.expr) (dst : loc) : unit =
let c = eval f callee in
let env =
match callee.Tast.ty with
| Types.Fn _ -> Some (Aint (shift c 8, Types.Ptr Types.Unit))
| Types.Fn _ -> Some (Aint (shift c 8, Types.Ptr (Types.Mut, Types.Unit)))
| _ -> None
in
call_flan f ?env ~target:(`Loc c) ~args ~rty:t dst
@ -2090,7 +2090,7 @@ and emit_handled f frames body dst t =
(match h.Tast.henv with
| Some ev ->
let l = scoped f (fun () -> eval f ev) in
load_loc f ~reg:rax l (Types.Ptr Types.Unit)
load_loc f ~reg:rax l (Types.Ptr (Types.Mut, Types.Unit))
| None -> xor_rr f.b ~dst:rax ~src:rax);
store_int f.b ~src:rax ~mm:(Frame (slot + h_env)) ~size:8;
lea f.b ~dst:rdi ~mm:(Frame slot);
@ -2604,7 +2604,7 @@ and emit_match f (scrut : Tast.expr) (arms : Tast.arm list) dst t =
and field_loc f (base : loc) (ty : Types.t) i =
match ty with
| Types.Named sn -> shift base (List.nth (field_offsets f sn) i)
| Types.Ptr (Types.Named sn) ->
| Types.Ptr (_, (Types.Named sn)) ->
shift (Lp (off_of base, 0)) (List.nth (field_offsets f sn) i)
| Types.String | Types.Slice _ -> shift base (if i = 0 then 0 else 8)
| Types.Option el -> let ot, ov = option_lay f el in
@ -2637,7 +2637,7 @@ and elements f (base : loc) (ty : Types.t) (is : Tast.expr list) : loc =
| i :: rest ->
let elem =
match ty with
| Types.Array (_, el) | Types.Slice el | Types.Ptr el -> el
| Types.Array (_, el) | Types.Slice (_, el) | Types.Ptr (_, el) -> el
| Types.String -> Types.Int Types.U8
| t -> unsupported "index into %s" (Types.to_string t)
in
@ -2935,7 +2935,7 @@ and check_cast f (loc : Loc.t) (src : Types.fkind) (k : Types.ikind) =
and element f (base : loc) (ty : Types.t) (i : Tast.expr) : loc =
let elem =
match ty with
| Types.Array (_, el) | Types.Slice el | Types.Ptr el -> el
| Types.Array (_, el) | Types.Slice (_, el) | Types.Ptr (_, el) -> el
| Types.String -> Types.Int Types.U8
| t -> unsupported "index into %s" (Types.to_string t)
in
@ -2997,7 +2997,7 @@ and call_flan f ?env ~target ~args ~rty dst =
in
(* The channel is this frame's own: a callee that transfers writes through
the pointer we were handed, so one cell serves the whole chain. *)
let chan = [ Aint (Lf f.xfer_off, Types.Ptr Types.Unit) ] in
let chan = [ Aint (Lf f.xfer_off, Types.Ptr (Types.Mut, Types.Unit)) ] in
(* And the environment last of all, on exactly one kind of call: one through
a [(Fn ...)] value, which cannot know whether the body it reaches
declared one. Every other call passes what it always passed — this is
@ -3105,7 +3105,7 @@ and call_native f ~sym ?(chan = false) ~(args : Tast.expr list) ~rty dst =
args
in
let flat = List.concat_map (fun (l, ty) -> classify_c l ty) vals in
let flat = if chan then flat @ [ Aint (Lf f.xfer_off, Types.Ptr Types.Unit) ] else flat in
let flat = if chan then flat @ [ Aint (Lf f.xfer_off, Types.Ptr (Types.Mut, Types.Unit)) ] else flat in
let nsse = emit_args f flat in
(* [al] is how many SSE registers were used, which a variadic callee reads.
Harmless on a fixed one, and a [declare] does not say which it is. *)
@ -3317,7 +3317,7 @@ and prim f (e : Tast.expr) (p : Tast.prim) (args : Tast.expr list) dst =
| Tast.Slice, [ a; lo; hi ] ->
let elem =
match a.Tast.ty with
| Types.Array (_, el) | Types.Slice el -> el
| Types.Array (_, el) | Types.Slice (_, el) -> el
| Types.String -> Types.Int Types.U8
| ty -> unsupported "slice of %s" (Types.to_string ty)
in

100
runtime/flan_dev.c
View File

@ -1064,6 +1064,11 @@ flan_frame *flan_frame_head;
* which is the failure this whole file exists to avoid. */
void flan_dev_frames_reset(void) { flan_frame_head = NULL; }
/* Where the chain stood, and putting it back there: the agent's way out of a
* trapped evaluation jumps past the frames the evaluation pushed. */
void *flan_dev_frames_mark(void) { return flan_frame_head; }
void flan_dev_frames_restore(void *head) { flan_frame_head = (flan_frame *)head; }
/* [i] counts from the innermost. NULL past the end, which is how a caller
* learns the depth without a second walk. */
void *flan_dev_frame_at(int32_t i) {
@ -2266,8 +2271,95 @@ void flan_dev_crash_enable(void) {}
#include <pthread.h>
#include <signal.h>
#include <unistd.h>
#if defined(__linux__) && (defined(__x86_64__) || defined(__aarch64__))
#include <sys/mman.h>
#include <ucontext.h>
#define FLAN_PARK_STACKS 1
#endif
extern void (*flan_trap_hook)(const uint8_t *name, int64_t namelen);
#ifdef FLAN_PARK_STACKS
/* Where a fault's break loop runs. Not the signal stack: the loop evaluates
* whatever is typed at it, and a runaway recursion there ran off the end of a
* 1 MiB malloc'd block with nothing below it, into the heap. And a fault taken
* while already on the signal stack has no stack to be delivered on, so the
* kernel kills the process.
*
* So the handler moves to one of these before calling the hook: 8 MiB each,
* mapped on first use, with a guard page at the low end. An overflow on one
* faults on its guard, the fault is delivered on the signal stack (the
* interrupted code was not on it), and its break loop gets the next stack up.
* Which stack is next is read off the interrupted stack pointer: a fault in
* code running on stack k parks on k + 1, and every stack above k is free,
* because a break loop is only ever left by a jump down to its caller. */
#define PARK_COUNT 10
#define PARK_SIZE ((size_t)8 << 20)
static char *park_lo[PARK_COUNT];
static ucontext_t park_uc[PARK_COUNT];
static const uint8_t *park_name;
static int64_t park_namelen;
/* The guard page counts as the stack's: an overflow's stack pointer is in it
* when the fault is taken, and reading it as some other stack's would park the
* overflow's break loop on the very stack it overflowed. */
static int park_index_of(uintptr_t sp) {
uintptr_t pg = (uintptr_t)sysconf(_SC_PAGESIZE);
for (int i = 0; i < PARK_COUNT; i++)
if (park_lo[i] != NULL && sp >= (uintptr_t)park_lo[i] - pg
&& sp <= (uintptr_t)park_lo[i] + PARK_SIZE)
return i;
return -1;
}
static char *park_stack(int i) {
if (park_lo[i] == NULL) {
size_t pg = (size_t)sysconf(_SC_PAGESIZE);
char *m = mmap(NULL, PARK_SIZE + pg, PROT_READ | PROT_WRITE,
MAP_PRIVATE | MAP_ANONYMOUS | MAP_NORESERVE, -1, 0);
if (m == MAP_FAILED) return NULL;
if (mprotect(m, pg, PROT_NONE) != 0) {
munmap(m, PARK_SIZE + pg);
return NULL;
}
park_lo[i] = m + pg;
}
return park_lo[i];
}
static uintptr_t park_interrupted_sp(void *uc) {
const ucontext_t *u = (const ucontext_t *)uc;
#if defined(__x86_64__)
return (uintptr_t)u->uc_mcontext.gregs[15]; /* REG_RSP */
#else
return (uintptr_t)u->uc_mcontext.sp;
#endif
}
static void park_run(void) {
flan_trap_hook(park_name, park_namelen);
/* The hook parks and is left only by a jump; reaching here is dying. */
signal(SIGSEGV, SIG_DFL);
raise(SIGSEGV);
}
/* Calls the hook on the next park stack, or returns 0 when there is none to
* be had and the caller should call it where it stands. */
static int park_elsewhere(void *uc, const uint8_t *name, int64_t namelen) {
int k = park_index_of(park_interrupted_sp(uc)) + 1;
char *st = k < PARK_COUNT ? park_stack(k) : NULL;
if (st == NULL) return 0;
park_name = name;
park_namelen = namelen;
if (getcontext(&park_uc[k]) != 0) return 0;
park_uc[k].uc_stack.ss_sp = st;
park_uc[k].uc_stack.ss_size = PARK_SIZE;
park_uc[k].uc_link = NULL;
makecontext(&park_uc[k], park_run, 0);
setcontext(&park_uc[k]);
return 0;
}
#endif
extern void __asan_init(void) __attribute__((weak));
static volatile sig_atomic_t flan_crash_entered;
@ -2341,7 +2433,7 @@ static void crash_handler(int sig, siginfo_t *si, void *uc) {
}
{
static const char why[] =
"\nflan: a write through a read-only slice (bytes-view of a literal), "
"\nflan: a write into read-only memory, "
"a null, or a stack overflow\n";
crash_puts(why, sizeof why - 1);
}
@ -2358,6 +2450,12 @@ static void crash_handler(int sig, siginfo_t *si, void *uc) {
/* Parks for good, exactly like NullAllocator and the other no-channel
* traps: there is no address to resume *at* — the faulting instruction
* would fault again — so this is a place to stand and read. */
#ifdef FLAN_PARK_STACKS
if (sig == SIGBUS)
park_elsewhere(uc, (const uint8_t *)"BusError", 8);
else
park_elsewhere(uc, (const uint8_t *)"SegFault", 8);
#endif
if (sig == SIGBUS)
flan_trap_hook((const uint8_t *)"BusError", 8);
else

5
runtime/flan_dyn.c
View File

@ -1406,6 +1406,11 @@ void flan_dyn_root_globals_end(void) { roots_base = roots_n; }
void flan_dyn_root_reset(void) { roots_n = roots_base; }
/* The same for one evaluation that trapped: the roots its frames pushed are
* dropped, and the ones below it kept. */
int64_t flan_dyn_root_mark(void) { return roots_n; }
void flan_dyn_root_restore(int64_t n) { if (n <= roots_n) roots_n = n; }
/* ── Constructors ──────────────────────────────────────────────────────*/
flan_dyn flan_dyn_nil(void) { return dyn_make(BOX_NIL, 0); }

2
runtime/flan_dyn.h
View File

@ -448,6 +448,8 @@ void flan_dyn_track_vecs(void);
* every dyn global for the whole of the park. This resets to the line
* [flan_dyn_root_globals_end] recorded. */
void flan_dyn_root_reset(void);
int64_t flan_dyn_root_mark(void);
void flan_dyn_root_restore(int64_t n);
/* Where that line comes from. The emitted [main] brackets its global pushes
* with these: [begin] immediately before the first, [end] immediately after

125
runtime/flan_rt.c
View File

@ -278,6 +278,21 @@ void flan_condition_stacks_reset(void) {
c_restart_depth = 0;
}
/* The same three, marked and put back rather than emptied: an evaluation that
* trapped is left by a jump past every frame it pushed, so the chains are
* returned to where they stood when it was called (see the agent's poll). */
void flan_condition_stacks_mark(void **h, void **r, int32_t *d) {
*h = handlers;
*r = restarts;
*d = c_restart_depth;
}
void flan_condition_stacks_restore(void *h, void *r, int32_t d) {
handlers = (flan_handler *)h;
restarts = (flan_restart *)r;
c_restart_depth = d;
}
/* The conversions are *text*: bytes->f64 parses "12.5", f64->bytes renders it.
* calc-me's tokenizer needs the first, the prelude's printers the second. */
@ -1621,6 +1636,10 @@ static void *flan_arena_proc(flan_allocator *a, int32_t mode, void *p,
static flan_alloc_value flan_ctx = { &flan_heap, 0 };
static flan_allocator *flan_ctx_tmp = NULL;
/* The agent's scratch temp arenas; see flan_temp_scratch_begin. */
#define FLAN_SCRATCH_LEVELS 16
static flan_allocator *flan_scratch[FLAN_SCRATCH_LEVELS];
static int flan_scratch_depth;
flan_allocator *flan_arena_new(int64_t cap);
_Noreturn static void flan_destroyed_fail(const uint8_t *loc, int64_t loclen);
@ -1672,66 +1691,43 @@ void flan_free_temp(void) {
a->epoch++;
}
/* A point in the temp arena to roll back to: the agent takes one before an
* expression it runs while the program is stopped and rolls back to it after,
* so the expression's own text is reclaimed and the text the stopped frames
* are holding is not. The caller holds the mark in FLAN_TEMP_MARK_WORDS words
* (flan_agent.c); its layout is private here. */
typedef struct flan_temp_mark {
flan_allocator *a; /* the temp arena at the mark, or NULL for none */
uint64_t epoch;
uint8_t *base;
int64_t offset;
int64_t live_blocks;
int64_t live_bytes;
} flan_temp_mark;
_Static_assert(sizeof(flan_temp_mark) <= 6 * sizeof(uint64_t),
"flan_agent.c reserves FLAN_TEMP_MARK_WORDS for a mark");
/* An expression the agent runs while the program is stopped gets a temp
* arena of its own: [begin] points context/temp at a scratch arena and
* answers the program's, [end] wipes the scratch arena — poisoned in a dev
* build, as any free-temp is — and puts the program's back. The program's own
* temp arena is never touched, so text its stopped frames hold survives and a
* temp Vec it owns grows through its own allocator as usual. What the
* expression allocates from context/temp and stores into program state
* dangles once the expression ends, like any temp text kept past its frame,
* and reads as the poison pattern in a dev build.
*
* One scratch arena per nesting level — a stop inside an evaluated expression
* evaluates inside it — each kept and reused, so an evaluation costs a
* free-all and not a malloc. Past the last level the deepest is shared. */
void flan_temp_mark_take(void *m) {
flan_temp_mark *k = (flan_temp_mark *)m;
flan_allocator *a = flan_ctx_tmp;
memset(k, 0, sizeof *k);
if (!a) return;
k->a = a;
k->epoch = a->epoch;
k->base = ((flan_arena *)a->data)->base;
k->offset = ((flan_arena *)a->data)->offset;
k->live_blocks = a->live_blocks;
k->live_bytes = a->live_bytes;
void *flan_temp_scratch_begin(void) {
flan_allocator *prev = flan_ctx_tmp;
int d = flan_scratch_depth < FLAN_SCRATCH_LEVELS ? flan_scratch_depth
: FLAN_SCRATCH_LEVELS - 1;
if (!flan_scratch[d]) {
flan_scratch[d] = flan_arena_new(FLAN_TEMP_DEFAULT);
if (flan_scratch[d]) ((flan_arena *)flan_scratch[d]->data)->grow = 1;
}
flan_scratch_depth++;
if (flan_scratch[d]) flan_ctx_tmp = flan_scratch[d];
return prev;
}
void flan_temp_rollback(const void *m) {
const flan_temp_mark *k = (const flan_temp_mark *)m;
flan_allocator *a = flan_ctx_tmp;
flan_arena *ar;
if (!a) return;
/* No temp arena at the mark, or a different one, or one the expression
* released itself with (free-temp): nothing from before is left in it, so
* the whole of it is the expression's. */
if (k->a != a || k->epoch != a->epoch) { flan_free_temp(); return; }
ar = (flan_arena *)a->data;
/* Blocks started since the mark are the expression's: dropped, newest
* first, until the block the mark was taken in is current again. */
while (ar->base != k->base && ar->old) {
flan_chunk *c = ar->old;
flan_dev_reg_dead_range(ar->base, ar->cap);
flan_dev_poison(ar->base, ar->cap);
free(ar->base);
ar->base = c->base;
ar->cap = c->cap;
ar->offset = ar->cap;
ar->old = c->next;
free(c);
void flan_temp_scratch_end(void *prev) {
int d;
if (flan_scratch_depth > 0) flan_scratch_depth--;
d = flan_scratch_depth < FLAN_SCRATCH_LEVELS ? flan_scratch_depth
: FLAN_SCRATCH_LEVELS - 1;
if (flan_scratch[d] && flan_ctx_tmp == flan_scratch[d]) {
flan_scratch[d]->proc(flan_scratch[d], FLAN_ALLOC_FREE_ALL, NULL, 0, 0, 0);
flan_scratch[d]->epoch++;
}
if (ar->base != k->base) { flan_free_temp(); return; }
if (ar->offset > k->offset) {
flan_dev_reg_dead_range(ar->base + k->offset, ar->offset - k->offset);
flan_dev_poison(ar->base + k->offset, ar->offset - k->offset);
ar->offset = k->offset;
}
a->live_blocks = k->live_blocks;
a->live_bytes = k->live_bytes;
flan_ctx_tmp = (flan_allocator *)prev;
}
/* with-allocator hands in two values in its own frame: [0] the one to install
@ -1749,6 +1745,21 @@ void flan_context_restore(flan_alloc_value *v) {
if (v) flan_ctx = v[1];
}
/* The context as it stands, and putting it back: the agent's way out of an
* evaluation that trapped jumps past the [with-allocator] that would have
* restored it. Two words, which is room for whatever the context grows into;
* the agent only carries them. */
void flan_context_save(uint64_t m[2]) {
m[0] = (uint64_t)(uintptr_t)flan_ctx.rec;
m[1] = flan_ctx.inc;
}
void flan_context_load(const uint64_t m[2]) {
flan_allocator *a = (flan_allocator *)(uintptr_t)m[0];
flan_ctx.rec = a ? a : &flan_heap;
flan_ctx.inc = a ? m[1] : 0;
}
/* Allocator headers [flan_arena_destroy] retired, linked through [data]. See
* there for why a header is never freed; this is why that does not grow. */
static flan_allocator *flan_retired;
@ -1825,6 +1836,8 @@ void flan_arena_destroy(flan_allocator *a) {
ar = (flan_arena *)a->data;
if (a == flan_ctx.rec) { flan_ctx.rec = &flan_heap; flan_ctx.inc = 0; }
if (a == flan_ctx_tmp) flan_ctx_tmp = NULL;
for (int i = 0; i < FLAN_SCRATCH_LEVELS; i++)
if (flan_scratch[i] == a) flan_scratch[i] = NULL;
a->epoch++;
flan_arena_drop_old(ar);
flan_dev_reg_dead_range(ar->base, ar->cap);

2
spike/x86/p4-convention.flan
View File

@ -13,7 +13,7 @@
(defn eight [a i64 b i64 c i64 d i64 e i64 f i64 g i64 h i64] i64
(+ (+ (+ a b) (+ c d)) (+ (+ e f) (+ g h))))
(defn taglen [s [u8]] i64
(defn taglen [s [const u8]] i64
(i64 (length s)))
(defn main [] i32

31
spike/x86/survey.sh
View File

@ -94,30 +94,15 @@ forever="dev-loop dev-watch dev-chatty agent-auto"
# in the epilogue that every exit already went through. The five are in the
# sweep now and they are five of the MATCHes.
# The ones whose whole point is a fault, and which therefore cannot be compared
# at this sweep's optimisation level. Both write through a bytes-view of a
# string literal, which is a store into .rodata: measured here, LLVM exits 0
# having printed the unmodified literal and this backend exits 139, because the
# store is undefined and the optimiser deleted it on one side and there is no
# optimiser on the other. That is not a lowering disagreement. At -O0 the two
# agree exactly -- 139, no output, both backends -- and test_acceptance.ml's
# dies_segv rows pin precisely that, on both backends, which is the coverage
# this sweep would otherwise be duplicating at the one level where, as that
# file's own comment puts it, there is nothing left to pin but the UB.
#
# Excluded by name rather than by building these two at -O0 here, and the
# reason is the coverage and not the counts: a per-name -O0 list would move the
# counts exactly as much as this does, so that is no argument at all. The
# argument is that dies_segv already builds both of them at -O0, on both
# backends, and asserts the exit status and the empty output -- everything this
# sweep would check, in the file where the ruling is written down.
#
# One more thing about dev-segv, which is a reason to keep it out of the
# comparison rather than a reason for this list: it calls agent/start, so it
# The one whose whole point is a fault, and which therefore cannot be compared
# at this sweep's optimisation level. dev-segv stores through a null pointer,
# which is undefined: what LLVM at -O2 does with it is its own business, and
# this backend has no optimiser and exits 139. That is not a lowering
# disagreement. test_dev.ml builds it in a dev session,
# where the fault is the thing asserted. It also calls agent/start, so it
# leaves a socket in /tmp on both runs, and under SURVEY_FLAGS=--dev it parks
# in the break loop instead of dying -- which is a forever-list problem, met
# here by a program that was never going to be compared anyway.
faults="bytes-view-write dev-segv"
# in the break loop instead of dying.
faults="dev-segv"
TIMEOUT=${TIMEOUT:-20}

2
test/programs/algorithms.flan
View File

@ -13,7 +13,7 @@
(print " "))
(println ""))
(defn show-fields [s [[u8]]] ()
(defn show-fields [s [[const u8]]] ()
(dotimes [i (length s)]
(print (string (at s i)))
(print " "))

2
test/programs/bounds-condition.flan
View File

@ -85,7 +85,7 @@
(set frames (+ frames 1)))
(continue [] (set skipped (+ skipped 1)))))
(defn slice-frame [s [u8] lo i32 hi i32] ()
(defn slice-frame [s [const u8] lo i32 hi i32] ()
(restart-case
(do (show "slice" (i64 (length (slice s lo hi))))
(set frames (+ frames 1)))

18
test/programs/bytes-view-write.flan
View File

@ -1,19 +1,11 @@
;;;; A store through (bytes-view "literal") lands in the string constant's
;;;; own storage, which both backends emit read-only — LLVM as a `constant`
;;;; global, x86 in .rodata — so the write traps where it happens instead of
;;;; corrupting the literal. Pinned at -O0 on both backends, where the store
;;;; is really emitted; at -O2 LLVM deletes it as undefined behaviour, which
;;;; is why this program has no -O2 row. The trap itself (SIGSEGV on a
;;;; read-only page) is the defined consequence of the emission, not a bet on
;;;; anything further.
;;;;
;;;; If this ever exits 0, string data has become writable somewhere and the
;;;; read-only-by-convention story of bytes-view is silently gone.
;;;; A store through (bytes-view "literal") is refused at compile time:
;;;; bytes-view answers a [const u8], because a string literal's bytes are in
;;;; read-only memory, where the store would trap at -O0 and be deleted as
;;;; undefined at -O2. test_acceptance.ml asserts the refusal; nothing here is
;;;; ever built.
(defn main [] i32
(let [v (bytes-view "INSERTIONSORT")]
(set (at v 0) \Z)
;; Never reached: the store above traps. Printing anyway makes a failure
;; loud — output where none was expected.
(print (string v))
0))

39
test/programs/const-owned.flan Normal file
View File

@ -0,0 +1,39 @@
;;;; A Vec reached through a [const (Vec T)] or a (Ptr const (Vec T)) is used
;;;; where it stands — indexed, measured, sliced, its address taken — and never
;;;; copied out as a value; (clone v) is the copy. The refusals are in
;;;; test_flan.ml; this is the half that compiles, on both backends.
(defstruct Bag [items (Vec i32) n i32])
(defn total [vs [const (Vec i32)]] i32
(let [t 0]
(dotimes [i (length vs)]
(dotimes [j (length (at vs i))]
(set t (+ t (at (at vs i) j)))))
t))
(defn first-len [p (Ptr const (Vec i32))] i32 (length (deref p)))
(defn bag-n [bs [const Bag]] i32 (+ (.n (at bs 0)) (length (.items (at bs 0)))))
(defn pick [c bool a $t b $t] $t (if c a b))
(defn main [] i32
(let [a (vec-new i32)
b (vec-new i32)]
(push a 1) (push a 2)
(push b 30)
(let [vs [a b]
cv (the-const (slice vs))
w (clone (at cv 0))
bags [(Bag {.items b .n 4})]]
(push w 99)
;; The shallow rule: the Vec's own buffer is writable through the view.
(set (at (at cv 1) 0) 31)
(println (total cv) (length w) (length (at cv 0)))
(println (first-len (addr (at cv 0))) (bag-n (slice bags)))
(println (length (pick true (bytes-view "abc") (bytes "de")))
(length (pick false (bytes "de") (bytes-view "abc"))))))
0)
(defn the-const [s [const (Vec i32)]] [const (Vec i32)] s)

65
test/programs/const-slice.flan Normal file
View File

@ -0,0 +1,65 @@
;;;; [const T]: a slice that can only be read. bytes-view answers one, a [T]
;;;; converts to one wherever one is wanted, and slicing one keeps it
;;;; read-only. Nothing about it exists at run time, so this prints the same
;;;; on every backend and at every level.
(defn total [s [const i32]] i64
(let [t (i64 0)]
(dotimes [i (length s)]
(set t (+ t (at s i))))
t))
;; A generic over a read-only slice takes a writable one too.
(defn first-of [s [const $t]] $t (at s 0))
(defn widths [parts [const [const u8]]] i32
(let [n 0]
(dotimes [i (length parts)]
(set n (+ n (length (at parts i)))))
n))
;; A (Ptr const T) is what the address of read-only storage is.
(defn peek [p (Ptr const u8)] u8 (deref p))
;; A function that only reads stands where one that may write is wanted, and
;; one returning a writable slice where a read-only one is wanted.
(defn rd [s [const u8]] i32 (length s))
(defn call-rd [f (Fn [[u8]] i32)] i32 (f (bytes "abc")))
(defn call-bare [f (CFn [[u8]] i32)] i32 (f (bytes "abcd")))
(defn mk [] [u8] (bytes "xy"))
(defn call-mk [f (Fn [] [const u8])] i32 (length (f)))
(defn main [] i32
(let [xs [3 1 2]
w (slice xs)
r (bytes-view "hello, world")
head (slice r 0 5)
tail (slice r 7)
names (vec-new [const u8])]
(sort w)
(println (total w) (total (slice w 1)))
(println (first-of w) (first-of (bytes-view "z")))
(println (string head) (string tail) (length head))
(println (bytes=? head (bytes-view "hello")) (starts-with? r head))
(push names head)
(push names tail)
(println (widths (slice names)))
;; A writable [[u8]] meets [const [const u8]] too: the outer view is
;; read-only, so nothing can put a read-only slice into it.
(let [a (bytes "ab")
b (bytes "cde")
both [a b]]
(println (widths (slice both)))
(set (at a 0) \A)
(println (string a)))
(let [f (split (bytes-view "b,a,c") \,)]
(sort-bytes (slice f))
(println (string (slice (join (slice f) (bytes-view "-"))))))
(println (at r 0))
(println (call-rd rd) (call-bare rd) (call-mk mk))
(let [b (bytes "q")]
(println (peek (addr (at r 1))) (peek (addr (at "abc" 2)))
(peek (addr (at b 0)))
(string (slice-from-ptr (addr (at r 7)) 5))))
(free names))
0)

8
test/programs/dev-load-errors.flan Normal file
View File

@ -0,0 +1,8 @@
;;;; A file loaded into a session with two forms that do not compile: [bad]
;;;; returns a string where it says i64, and [good] calls [bad], so it goes
;;;; when [bad] does. [fine] is the form that has to arrive anyway.
(defn good [] i64 (bad))
(defn bad [] i64 "x")
(defn fine [] i64 42)

9
test/programs/dev-load-generic.flan Normal file
View File

@ -0,0 +1,9 @@
;;;; A file loaded into a session with no main: a generic and a plain function.
(defn biggest [xs [$t]] $t
{:where (ordered? $t)}
(let [m (at xs 0)]
(dotimes [i (length xs)]
(set m (max m (at xs i))))
m))
(defn twice [n i64] i64 (* 2 n))

7
test/programs/dev-main-broken.flan Normal file
View File

@ -0,0 +1,7 @@
;;;; A file with a main and one form that does not compile: flan dev starts
;;;; with the rest.
(defn fine [] i64 42)
(defn bad [] i64 "x")
(defn main [] i32 0)

20
test/programs/dev-noagent-running.flan
View File

@ -1,19 +1,9 @@
;;;; A program that has not been told about the agent and is still running.
;;;; A program that never imports the agent and is still running. flan dev
;;;; links the agent anyway, so a delivery is queued rather than refused; it
;;;; installs at a frame boundary the program never reaches, since nothing in
;;;; it calls (agent/poll).
;;;;
;;;; dev-noagent.flan is the other half of this pair and stops short of it: its
;;;; main returns, so a moment later it is parked, and a redefinition sent to a
;;;; parked program is answered by the parking path. This one keeps running,
;;;; which is the state nothing had pinned: there is no agent in the process to
;;;; hand a module to and no socket to fall back on, so the daemon refuses the
;;;; delivery.
;;;;
;;;; That is the honest answer for it: the reply says the program has no agent
;;;; and how to add one. A program that *links* the agent has its socket bound
;;;; by the package's constructor before main, and the one way that bind fails
;;;; — a socket path too long for a unix socket — is refused when flan dev
;;;; starts.
;;;;
;;;; So: no (import agent ...) anywhere, and a loop that outlasts the test.
;;;; No (import agent ...) anywhere, and a loop that outlasts the test.
(defn step [] i64 7)
(defn main [] i32

14
test/programs/dev-noagent.flan
View File

@ -1,13 +1,7 @@
;;;; A program [flan dev] can host that never calls (agent/start ...), which
;;;; is the one condition the merged session and the two-process daemon answer
;;;; differently: [two_process] kills the child and fails, [merged_serve]
;;;; warns and serves anyway. See test_dev.ml's last block.
;;;;
;;;; No (import agent ...) at all, because the point is a program that has not
;;;; been told about the agent rather than one that forgot a call. It prints
;;;; and returns: a Flan main that returns under [flan dev] parks instead of
;;;; ending the process (flan_merged_exit), so the session outlives it and the
;;;; accept loop keeps answering.
;;;; A program that never imports the agent. flan dev links the agent's C into
;;;; every program it builds, so a definition and an expression sent while it
;;;; is parked both land. It prints and returns: a Flan main that returns under
;;;; flan dev parks instead of ending the process (flan_merged_exit).
(defn step [] i64 7)
(defn main [] i32

4
test/programs/dev-nomain.flan
View File

@ -1,2 +1,4 @@
;;;; A file with no main: flan dev has nothing to run, and says so before building.
;;;; A file with no main. flan dev starts a session on it anyway, with a stub
;;;; main that returns at once, and the file's functions are in the host.
;;;; flan dev --two-process refuses it, since its program is a child process.
(defn helper [] i64 1)

30
test/programs/dev-segv.flan
View File

@ -1,17 +1,21 @@
;;;; The dogfooding crash, replayed on purpose: a write through a bytes-view
;;;; of a string literal lands in read-only memory and takes SIGSEGV. In a
;;;; dev session that used to kill the whole process — daemon, compiler and
;;;; socket together, with no message at all. The dev build's crash handler
;;;; turns it into the same park the no-channel traps take: one line naming
;;;; the address and the frame, then the break loop, with the daemon alive
;;;; and answering behind it. There is no restart to list — a faulting
;;;; instruction has nowhere to resume at — which is the same empty-list
;;;; shape dev-trap-null-alloc.flan pins for free-all.
;;;; A hardware fault, taken on purpose: a store through a null pointer takes
;;;; SIGSEGV. In a dev session that used to kill the whole process — daemon,
;;;; compiler and socket together, with no message at all. The dev build's
;;;; crash handler turns it into the same park the no-channel traps take: one
;;;; line naming the address and the frame, then the break loop, with the
;;;; daemon alive and answering behind it. There is no restart to list — a
;;;; faulting instruction has nowhere to resume at — which is the same
;;;; empty-list shape dev-trap-null-alloc.flan pins for free-all.
;;;;
;;;; The crash that first raised this was a write through a bytes-view of a
;;;; string literal, which no longer compiles; a zeroed pointer is the
;;;; surviving way to fault.
(import agent "vendor:agent")
(defonce nowhere (Ptr u8))
(defn main [] i32
(agent/start "/tmp/flan-dev-segv-fallback.sock")
(let [v (bytes-view "INSERTIONSORT")]
(set (at v 0) \Z)
(print (string v))
0))
(set (deref nowhere) \Z)
(println "not reached")
0)

19
test/programs/dev-temp-stop.flan
View File

@ -1,22 +1,31 @@
;;;; A program that stops while a live frame holds text in the temp allocator.
;;;; [hold] formats a number, then calls [fetch], which errors with nothing
;;;; handling it, so the program stops with [hold]'s text still in use.
;;;; Expressions evaluated at the stop format numbers of their own; after the
;;;; retry restart the program prints [hold]'s text, which has to be intact.
;;;; A program that stops while it holds things in the temp allocator: [hold]'s
;;;; formatted text in a live frame, and [keep], a Vec made from context/temp.
;;;; [fetch] errors with nothing handling it, so the program stops there.
;;;; Expressions evaluated at the stop format numbers of their own and push
;;;; into [keep], which grows it through the program's temp arena, possibly
;;;; into a new chunk. After the retry restart the program prints the text and
;;;; [keep]'s length, first and last element; all of it has to be intact.
;;;; test_dev.ml drives it.
(import agent "vendor:agent")
(defstruct Missing [id i32])
(defonce keep (Vec u8))
(defn fetch [] i32
(restart-case
(do (error (Missing {.id 1})) 0)
(retry [] 7)))
(defn hold [] i32
(set keep (vec-new u8 context/temp))
(push keep (u8 5))
(let [s (string (i64->bytes 4242))
r (fetch)]
(println s)
(println (length keep))
(println (at keep 0))
(println (at keep (- (length keep) 1)))
r))
(defn main [] i32

4
test/programs/edn.flan
View File

@ -70,11 +70,11 @@
;; ── The worked example: a struct read by hand ───────────────────────
;; `name` is a [u8] and not a copy of one, so an Enemy is only valid while the
;; `name` is a [const u8] and not a copy of one, so an Enemy is only valid while the
;; buffer it was read out of is. That is the lifetime contract from the package
;; header, and it is what a struct reader inherits by using slices.
(defstruct Enemy
[name [u8]
[name [const u8]
hp i32
speed f32
boss? bool])

2
test/programs/pkg-return.flan
View File

@ -13,7 +13,7 @@
(defstruct Local [n i32])
;;; The case that used to fail: a package struct as the declared return type.
(defn fresh [src [u8]] edn/Cursor (edn/cursor src))
(defn fresh [src [const u8]] edn/Cursor (edn/cursor src))
;;; And the one that must keep working: a lowercase qualified name in the same
;;; position is an expression, not a type.

4
test/programs/utf8.flan
View File

@ -50,7 +50,7 @@
;; code/width/ok, so a wrong answer names which of the three it got wrong
;; rather than just failing.
(defn show-dec [s [u8]] ()
(defn show-dec [s [const u8]] ()
(let [r (decode-rune s)]
(print (.code r)) (print "/")
(print (.width r)) (print "/")
@ -78,7 +78,7 @@
(print x)
(print " "))
(defn show-split [s [u8] sep u8] ()
(defn show-split [s [const u8] sep u8] ()
(let [it (split-on-byte s sep)
going true]
(while going

2
test/programs/vec-new-shadow.flan
View File

@ -6,7 +6,7 @@
(defn main [] i32
(let [x 7
v (builtin/vec-new [u8])]
v (builtin/vec-new [const u8])]
(println (vec-new [x]))
(push v (bytes-view "ab"))
(println (length (at v 0)))

4
test/programs/vec-new-type.flan
View File

@ -5,11 +5,11 @@
(defn main [] i32
(let [a (arena-new 4096)
words (vec-new [u8])
words (vec-new [const u8])
pairs (vec-new [2 i32])
ptrs (vec-new (Ptr i32))
opts (vec-new (Option i64) a)
m (map-new string [u8])
m (map-new string [const u8])
x (i32 7)]
(push words (bytes-view "ab"))
(push words (bytes-view "cde"))

51
test/test_acceptance.ml
View File

@ -889,26 +889,39 @@ let () =
"programs/bytes-copy.flan" bytes_copy_out;
outputs ~x86:true "bytes copies, bytes-view aliases, --x86"
"programs/bytes-copy.flan" bytes_copy_out;
(* The other half of the same ruling: a store through a bytes-view of a
literal traps, identically on both backends, because both emit string
data read-only. -O0 only — at -O2 LLVM deletes the store as UB, so
there is nothing there to pin except the UB itself. 139 is the shell's
128+SIGSEGV. *)
let dies_segv name path ~x86 =
let exe = compile ~opt:"-O0" ~x86 path in
let code, text = run exe None in
if code <> 139 || text <> "" then begin
incr failures;
Printf.printf
"FAIL %s\n got: %S (exit %d)\n wanted: %S (exit 139)\n"
name text code ""
end;
(try Sys.remove exe with Sys_error _ -> ())
(* The other half of the same ruling: a store through a bytes-view is
refused before anything is built, because bytes-view answers a
[const u8]. It used to compile and trap at -O0 on both backends, and be
deleted as undefined at -O2. *)
(let path = "programs/bytes-view-write.flan" in
match
Check.program (Load.program ~file:path (Reader.read_file path)).Load.decls
with
| _ ->
incr failures;
Printf.printf "FAIL a write through bytes-view is refused\n"
| exception Loc.Error { Loc.dmsg = m; _ } ->
if not (contains m "this writes through a [const u8]") then begin
incr failures;
Printf.printf
"FAIL a write through bytes-view is refused\n said: %S\n" m
end);
(* [const T]: the checker's alone, so the three builds agree and every
row is about which values reach which parameters. *)
let const_slice_out =
"6 5\n1 122\nhello world 5\ntrue true\n10\n5\nAb\na-b-c\n104\n3 4 2\n101 99 113 world\n"
in
dies_segv "a write through bytes-view traps, -O0"
"programs/bytes-view-write.flan" ~x86:false;
dies_segv "a write through bytes-view traps, --x86"
"programs/bytes-view-write.flan" ~x86:true;
outputs "const slices" "programs/const-slice.flan" const_slice_out;
outputs ~opt:"-O0" "const slices, -O0" "programs/const-slice.flan"
const_slice_out;
outputs ~x86:true "const slices, --x86" "programs/const-slice.flan"
const_slice_out;
let const_owned_out = "34 3 2\n2 5\n3 3\n" in
outputs "const owned" "programs/const-owned.flan" const_owned_out;
outputs ~opt:"-O0" "const owned, -O0" "programs/const-owned.flan"
const_owned_out;
outputs ~x86:true "const owned, --x86" "programs/const-owned.flan"
const_owned_out;
(* (string b). The conversion emits nothing — String and Slice _ are the
same %slice — so the rows are about length and ownership rather than
arithmetic: a number round-tripped, an empty slice, sub-views whose

566
test/test_dev.ml
View File

@ -442,7 +442,7 @@ let () =
[Rune] also pins the spelling — the types read exactly as [defs]
spells a signature, because both go through [Types.to_string]. *)
let r = request c "(:op \"layout\" :type \"Split\")" in
if fields r <> [ "rest [u8]"; "sep u8"; "more bool" ] then
if fields r <> [ "rest [const u8]"; "sep u8"; "more bool" ] then
fail "Split's fields: %s" (String.concat ", " (fields r));
let r = request c "(:op \"layout\" :type \"Nonesuch\")" in
@ -1935,7 +1935,7 @@ let () =
if refault then begin
let faulting =
"(:op \"eval-expr\" :code \
\"(let [v (bytes-view \\\"refault\\\")] (set (at v 0) 90) 1)\" \
\"(do (set (deref nowhere) 90) 1)\" \
:file \"/tmp/buf.flan\")"
in
(match ask faulting with _ -> () | exception _ -> ());
@ -1950,16 +1950,10 @@ let () =
is only as good as SA_NODEFER: %s"
what (status r)
end;
(* The one case where "just ignore that whole call" cannot hold, and
it is the same reason every other refusal at a trap has: an
evaluation that *traps* stops with no transfer channel anywhere in
the call, so there is nothing for the boundary restart to unwind
through either. It is listed — it is a live frame, and hiding it
would make the one break where it does not work the one break that
never mentions it — and it is listed as untakeable, with
[:abandon] saying there is no position to offer. Fix the
expression and evaluate it again; that is the whole of the way
out. *)
(* An evaluation that traps stops with no transfer channel anywhere
in the call, so no restart can be unwound to — but the evaluation's
own boundary is left by the agent's jump back to the poll that
called it, so it is listed as takeable and [:abandon] names it. *)
if trapping <> "" then begin
let r =
ask
@ -1983,15 +1977,16 @@ let () =
(String.concat ", " names)
| _ -> fail "break at a trap inside an evaluation listed nothing");
(match Wire.field r "unreachable" with
| Some { Form.v = Form.List [ { Form.v = Form.Int 0L; _ } ]; _ } -> ()
| None | Some { Form.v = Form.Sym "nil"; _ }
| Some { Form.v = Form.List []; _ } -> ()
| _ ->
fail "the boundary restart was offered at a trap, where nothing \
can be taken");
fail "the boundary restart was refused at a trap inside an \
evaluation");
(match Wire.field r "abandon" with
| Some { Form.v = Form.Sym "nil"; _ } -> ()
| Some { Form.v = Form.Int 0L; _ } -> ()
| _ ->
fail "a trap inside an evaluation named a position that abandons \
it");
fail "a trap inside an evaluation did not name the position \
that abandons it");
(* And the reason those positions are refused, which is the half an
editor puts in front of somebody. [:abandon] being nil cannot
carry it: a break the program took on its own has a nil there
@ -2041,8 +2036,8 @@ let () =
word. The dev build's crash handler (flan_dev_crash_enable) enters the
same trap hook the six no-channel refusals use, so everything trap_park
asserts for them holds here too: stopped and describable, an eval still
answered, a resume refused. The program writes through bytes-view,
which is the surviving spelling of that crash. *)
answered, a resume refused. The program stores through a null
pointer: the bytes-view write that first crashed no longer compiles. *)
trap_park ~refault:true "segfault" "dev-segv.flan" "SegFault" [];
(* ── The locals of a stopped frame ─────────────────────────────── *)
@ -5137,55 +5132,20 @@ let () =
(try ignore (Unix.waitpid [ Unix.WNOHANG ] opid) with Unix.Unix_error _ -> ());
List.iter (fun f -> try Sys.remove f with Sys_error _ -> ()) [ osock; oout ];
(* A program that never calls [agent/start], which is the one condition on
which the two shapes of [flan dev] deliberately disagree. [two_process]
kills its child and [failwith]s: the program is a separate process, the
daemon owns it, and a daemon with nothing to deliver to is useless.
[merged_serve] prints a warning and serves anyway, because the thing it
would have to kill is itself — an editor connected to it still deserves
[describe], [defs] and the program's output, and only a *delivery*
needs the agent.
(* A program whose source never mentions the agent. [flan dev] links the
agent's C into every program it builds ([Dev.with_agent]), and the
constructor binds the socket before main, so the file is reachable from
the editor as it stands: dev-noagent.flan's main prints and returns,
and a definition and an expression sent to the park both land.
That second policy was held up by nothing at all. Nothing in the suite
reached lib/dev.ml's warning branch, and the shape of the mistake it
guards against is a small one: copying the daemon's answer back into
the merged path is the obvious tidy-up, and it would turn every program
without an agent into a session that dies at startup, silently, because
no test would have noticed.
So what is asserted is the policy and not the sentence: the session
answers. The warning text is checked second, as the evidence that this
is the branch that produced it and not some other path that happened to
work.
WHEN it answers is asserted too, and that is the newer half. The wait
for the agent socket used to sit in front of [accept_loop], so this
[describe] could not arrive until the ten seconds had run out — the
block's cost, and every real session's first keystroke. The wait is a
deadline the session passes now ([Dev.agent_check]), so the reply comes
back immediately and the sentence is said later, by the accept loop,
once the deadline is behind it. The second half is what still costs ten
seconds here: a warning about a program that is never going to start an
agent cannot honestly be said before waiting for one.
[describe] and not a cheaper op on purpose: it is what
[emacs/flan.el] sends straight after [flan--open] (flan.el:646) and
what its poll sends after that, so this is the stall a person would
actually have felt. *)
[--llvm] here, on a daemon that was going to stand up anyway: one
merged LLVM daemon stays in the suite now that a flagless one is x86,
and the host listing proves the opt-in reached the build. *)
let nsock = tmp "noagent.sock" and nlog = tmp "noagent.log" in
(try Sys.remove nsock with Sys_error _ -> ());
(* Its own stderr, unlike every other daemon here: the warning is the
evidence and it is written there. *)
let nfd =
Unix.openfile nlog [ Unix.O_WRONLY; Unix.O_CREAT; Unix.O_TRUNC ] 0o600
in
(* [--llvm] here, on a daemon that was going to stand up anyway: the
opt-in is the other half of the default checked at the top of this file,
and proving it costs the same [stat] on the same directory. It also
keeps one merged LLVM daemon in the suite now that a flagless one is an
x86 one -- this test is about a program with no [(agent/start ...)],
which is a claim about the daemon and not about a backend, so it is the
cheapest place for both. *)
let npid =
Unix.create_process flan
[| flan; "dev"; "programs/dev-noagent.flan"; "-s"; nsock; "--llvm" |]
@ -5207,78 +5167,44 @@ let () =
if Sys.file_exists (nhost "s") then
fail "flan dev --llvm left an x86 listing at %s" (nhost "s");
let nc = connect nsock in
(* The exception arm is not defensive: a session that adopted the
daemon's policy would exit here, and the connection would come back
ECONNRESET rather than with a status. Reported by name because an
uncaught [Unix_error] out of a test binary says nothing about which
test. *)
let nt0 = Unix.gettimeofday () in
(match Wire.parse (Wire.send nc "(:op \"describe\")"; Wire.recv nc) with
| r when status r = "ok" -> ()
| r ->
fail "a program without (agent/start ...) was not served: describe: %s"
(status r)
| exception e ->
fail
"a program without (agent/start ...) ended the session instead of \
drawing a warning: %s" (Printexc.to_string e));
let ndt = Unix.gettimeofday () -. nt0 in
(* Two seconds, against a stall that was ten and a reply that is a
fraction of one. The threshold is loose on purpose: what is being
held is "the session does not wait for the program's socket before
answering", and a number close to the real cost would fail on a
loaded machine for a reason that has nothing to do with the wait. *)
if ndt > 2. then
fail
"the first editor request waited %.1fs on a program without \
(agent/start ...); the accept loop is gated on the agent again"
ndt;
(* Dropped rather than closed with [(:op "close")], and the difference
is the rest of this row: [close] ends the session, the process
[_exit]s, and the deadline below would be waited out by nobody. A
dropped connection leaves the accept loop cycling, which is where
the sentence is said from. *)
let parked () =
match Wire.field (request nc "(:op \"describe\")") "parked" with
| Some { Form.v = Form.Sym "t"; _ } -> true
| _ -> false
in
if not (await parked) then fail "the agentless program never parked"
else begin
let said r = Option.value ~default:"" (Wire.string_field r "message") in
let r =
request nc
"(:op \"eval\" :code \"(defn step [] i64 8)\" :file \
\"programs/dev-noagent.flan\")"
in
if status r <> "ok" then
fail "a definition for a program that never imports the agent: %s"
(said r);
let r =
request nc
"(:op \"eval-expr\" :code \"(step)\" :file \
\"programs/dev-noagent.flan\")"
in
if Wire.string_field r "value" <> Some "8" then
fail "an expression for a program that never imports the agent: %s %s"
(status r) (said r)
end;
(try
ignore (Wire.send nc "(:op \"close\")");
ignore (Wire.recv nc)
with _ -> ());
(try Unix.close nc with Unix.Unix_error _ -> ())
end;
(* And the sentence, which arrives after the deadline rather than before
the loop. Awaited with the daemon still alive — the accept loop is what
says it, so killing first would be testing that a dead process does not
print. Generous against the ten-second deadline for the reason the
threshold above is loose. *)
let nlog_says () =
contains_sub
(try In_channel.with_open_bin nlog In_channel.input_all
with Sys_error _ -> "")
"(import agent \"vendor:agent\")"
in
ignore (await ~ms:30000 nlog_says);
(try Unix.kill npid Sys.sigkill with Unix.Unix_error _ -> ());
(try ignore (Unix.waitpid [] npid) with Unix.Unix_error _ -> ());
if not (nlog_says ()) then
fail
"a program with no agent drew no warning from flan dev:\n%s"
(try In_channel.with_open_bin nlog In_channel.input_all
with Sys_error _ -> "");
List.iter (fun f -> try Sys.remove f with Sys_error _ -> ())
[ nsock; nlog ];
(* ── ...and what a delivery to one is told ────────────────────────
The row above is about the daemon's own stderr. This one is about the
reply an editor gets for a redefinition, and it is here because that
reply was never pinned and this lane changed which of two it is.
A program that does not link the agent at all has no agent in this
process to call and no socket to fall back to, so the delivery is
REFUSED, and the reply says the program has no agent and how to give it
one — both for a redefinition and for an expression. "Queued" would
have promised a poll that has nothing to drain, and "connect: No such
file or directory" names a path the reader never chose.
It needs the program to be running, which is why it is not folded into
the row above: dev-noagent.flan's main returns, so it parks within the
first moment and a delivery to it is answered by the parking path
instead. This fixture loops. *)
(* And one still running, which never calls [(agent/poll)]: a delivery is
queued rather than refused, because the agent is there to take it. *)
let gsock = tmp "noagent-running.sock" and glog = tmp "noagent-running.log" in
(try Sys.remove gsock with Sys_error _ -> ());
let gfd =
@ -5301,46 +5227,29 @@ let () =
"(:op \"eval\" :code \"(defn step [] i64 9)\" :file \
\"programs/dev-noagent-running.flan\")"
in
let msg = Option.value ~default:"" (Wire.string_field r "message") in
(* Refused, and the reason is the program's rather than the compiler's:
the module built, and what is missing is an agent to hand it to. The
fix it names is the import. *)
let names_the_fix m =
contains_sub m "has no agent"
&& contains_sub m "(import agent \"vendor:agent\")"
let fix m =
contains_sub m "(import agent \"vendor:agent\")"
&& contains_sub m "(agent/poll)"
in
if status r = "ok" then
fail
"a redefinition for a program with no agent in it was answered \
ok%s — nothing can install it"
(match Wire.string_field r "note" with
| Some n -> Printf.sprintf " (note: %S)" n
| None -> "")
else if not (names_the_fix msg) then
fail "a delivery to a running agentless program was refused with: %S"
msg;
(* And an expression, which used to be answered with the connect's own
errno. *)
if status r <> "ok" then
fail "a delivery to a running program that never imports the agent: %s"
(Option.value ~default:"" (Wire.string_field r "message"))
else if not (fix (Option.value ~default:"" (Wire.string_field r "note")))
then
fail "a delivery the running program never takes did not say so: %s"
(Option.value ~default:"(no note)" (Wire.string_field r "note"));
(* And an expression, which waits for a frame boundary the program never
reaches, and names the same fix. *)
let r =
request gc
"(:op \"eval-expr\" :code \"(step)\" :file \
\"programs/dev-noagent-running.flan\")"
in
let msg = Option.value ~default:"" (Wire.string_field r "message") in
if status r = "ok" || not (names_the_fix msg) then
fail "an expression for a running agentless program was answered %s: %S"
(status r) msg;
(* And the session is still there afterwards, which is the rest of the
claim: a refusal is a reply, not the end. *)
(match request gc "(:op \"describe\")" with
| r when status r = "ok" -> ()
| r ->
fail "the session did not survive an unreachable delivery: %s"
(status r)
| exception e ->
fail "the session ended on an unreachable delivery: %s"
(Printexc.to_string e));
if status r <> "error"
|| not (fix (Option.value ~default:"" (Wire.string_field r "message")))
then
fail "an expression for a program that never polls: %s %s" (status r)
(Option.value ~default:"" (Wire.string_field r "message"));
(try
ignore (Wire.send gc "(:op \"close\")");
ignore (Wire.recv gc)
@ -5406,8 +5315,11 @@ let () =
refused_at_start "a TMPDIR that does not exist" ~tmpdir:missing
~prog:"programs/dev-lateagent.flan" ~mode
[ missing ^ " does not exist"; "TMPDIR=/tmp flan dev" ];
refused_at_start "a program with no main" ~tmpdir:here ~prog:nomain
~mode [ "has no main"; "(defn main [] i32" ])
(* Only the two-process daemon: its program is a child, and a child
whose main returns is gone. One process starts on the file. *)
if mode <> [||] then
refused_at_start "a program with no main" ~tmpdir:here ~prog:nomain
~mode [ "has no main"; "(defn main [] i32"; "without --two-process" ])
[ [||]; [| "--two-process" |] ];
(try Unix.rmdir deep with Unix.Unix_error _ -> ());
@ -7541,13 +7453,16 @@ let () =
[ "--llvm"; "--x86" ];
(* ── Temp text held by a stopped frame ─────────────────────────
An expression evaluated at a stop rolls the temp allocator back to
where it was when it finishes: what it formatted is reclaimed, so the
live count does not grow across evaluations, and the text the stopped
frame formatted before the stop is intact when the program resumes. *)
An expression evaluated at a stop runs with context/temp pointed at a
scratch arena that is wiped when it finishes: what it formatted is
reclaimed, so the scratch arena is empty at the start of every
evaluation. The program's own temp arena is not touched: the text the
stopped frame formatted is intact when the program resumes, and a temp
Vec it owns, pushed into at the stop, keeps what it held and what was
pushed — whether it grew in place or into a new chunk. *)
List.iter
(fun mode ->
let tsock = tmp ("tstop" ^ mode ^ ".sock") in
(fun (mode, pushes) ->
let tsock = tmp (Printf.sprintf "tstop%s%d.sock" mode pushes) in
(try Sys.remove tsock with Sys_error _ -> ());
let tpid =
Unix.create_process flan
@ -7586,20 +7501,26 @@ let () =
if not (await (fun () -> stopped (ask "(:op \"describe\")"))) then
fail "%s: the temp-stop program never stopped" mode
else begin
let before = live () in
for _ = 1 to 5 do
ignore (eval "(length (i64->bytes 123456789))")
done;
let after = live () in
if before <> "1" || after <> before then
fail "%s: evaluations at a stop changed the temp allocator's live blocks: %s then %s"
mode before after;
if after <> "0" then
fail "%s: an expression at a stop found %s blocks left in its temp arena"
mode after;
let r =
eval (Printf.sprintf "(dotimes [i %d] (push keep (u8 9)))" pushes)
in
if status r <> "ok" then
fail "%s: pushing into the program's temp Vec at a stop: %s" mode
(Option.value ~default:(status r) (Wire.string_field r "message"));
let r = ask "(:op \"restart\" :name \"retry\")" in
if status r <> "ok" then fail "%s: retry at the stop: %s" mode (status r)
else if not
(await (fun () ->
ignore (ask "(:op \"describe\")");
contains_sub (Buffer.contents out) "4242\n7\n"))
contains_sub (Buffer.contents out)
(Printf.sprintf "4242\n%d\n5\n9\n7\n" (pushes + 1))))
then
fail "%s: the stopped frame's text did not survive: %S" mode
(Buffer.contents out)
@ -7609,7 +7530,7 @@ let () =
(try ignore (Unix.waitpid [] tpid) with Unix.Unix_error _ -> ())
end;
(try Sys.remove tsock with Sys_error _ -> ()))
[ "--llvm"; "--x86" ];
[ ("--llvm", 20); ("--x86", 20); ("--llvm", 3000000); ("--x86", 3000000) ];
(* ══ The agent socket is not the editor protocol ══════════════════
@ -7663,10 +7584,9 @@ let () =
let lc = connect lsock in
let said r = Option.value ~default:"" (Wire.string_field r "message") in
(* The program sleeps for three seconds before [agent/start], so this is
asked inside the delay. Two seconds is the threshold for the reason
the agentless row gives: the reply is a fraction of one and the bug
was ten, so anything in between is a loaded machine rather than a
regression. *)
asked inside the delay. Two seconds is the threshold because the reply
is a fraction of one and the bug was ten, so anything in between is a
loaded machine rather than a regression. *)
let lt0 = Unix.gettimeofday () in
let r = request lc "(:op \"describe\")" in
let ldt = Unix.gettimeofday () -. lt0 in
@ -7849,6 +7769,294 @@ let () =
List.iter (fun f -> try Sys.remove f with Sys_error _ -> ())
[ psock; pout ];
(* ── A session on a file with no main ─────────────────────────────
SBCL's order: the session comes up with nothing to run, and a file is
loaded into it. A load that has forms which do not compile installs the
rest and lists them; a re-run says there is no main and how to add one. *)
let msock = tmp "nomain.sock" and mout = tmp "nomain.out" in
(try Sys.remove msock with Sys_error _ -> ());
let mfd =
Unix.openfile mout [ Unix.O_WRONLY; Unix.O_CREAT; Unix.O_TRUNC ] 0o600
in
let mpid =
Unix.create_process flan
[| flan; "dev"; "programs/dev-nomain.flan"; "-s"; msock |]
Unix.stdin mfd mfd
in
Unix.close mfd;
if not (listening ~pid:mpid msock) then begin
fail "a daemon on a file with no main %s (%S)" !listen_why
(In_channel.with_open_bin mout In_channel.input_all);
(try Unix.kill mpid Sys.sigkill with Unix.Unix_error _ -> ())
end
else begin
let mc = connect msock in
let said r = Option.value ~default:"" (Wire.string_field r "message") in
let value code =
let r =
request mc
(Printf.sprintf "(:op \"eval-expr\" :code %s :file \"<test>\")"
(Wire.quote code))
in
match Wire.string_field r "value" with
| Some v -> v
| None -> "refused: " ^ said r
in
let load file = request mc (Printf.sprintf "(:op \"load-file\" :file %S)" file) in
let errors r =
match Wire.field r "errors" with
| Some { Form.v = Form.List l; _ } ->
List.map
(fun e -> Option.value ~default:"" (Wire.string_field e "message"))
l
| _ -> []
in
(match value "(helper)" with
| "1" -> ()
| v -> fail "the no-main file's own function: %s" v);
let r = load "programs/dev-load-generic.flan" in
if status r <> "ok" then fail "loading a generic and a function: %s" (said r)
else begin
(match value "(let [ns [3 9 2]] (biggest (slice ns 0 3)))" with
| "9" -> ()
| v -> fail "a loaded generic, called: %s" v);
match value "(twice 21)" with
| "42" -> ()
| v -> fail "a loaded function, called: %s" v
end;
let r = load "programs/dev-load-errors.flan" in
if status r <> "ok" then
fail "a load with two bad forms installed nothing: %s" (said r)
else begin
(match errors r with
| [ a; b ] ->
if not (contains_sub a "expected i64" && contains_sub b "unknown function bad")
then fail "a load listed %S and %S" a b
| es -> fail "a load with two bad forms listed %d" (List.length es));
(match value "(fine)" with
| "42" -> ()
| v -> fail "the form that compiled beside two that did not: %s" v);
if not (contains_sub (value "(good)") "refused") then
fail "a form that called one left out was installed"
end;
(* Nothing compiles: a refusal, with the error where every refusal
puts it and the list beside it. *)
let r =
request mc
"(:op \"load-file\" :file \"programs/dev-load-errors.flan\" :code \
\"(defn bad [] i64 \\\"x\\\")\")"
in
if status r <> "error" || errors r = [] || Wire.string_field r "loc" = None
then fail "a load where nothing compiles: %s %s" (status r) (said r);
let r = request mc "(:op \"rerun\")" in
if status r <> "error"
|| not (contains_sub (said r) "has no main")
|| not (contains_sub (said r) "(defn main [] i32")
then fail "a re-run with no main: %s %s" (status r) (said r);
(* The replies say there is no main of the file's own, so an editor
does not report a program that finished. *)
(match Wire.field (request mc "(:op \"describe\")") "main" with
| Some { Form.v = Form.Sym "nil"; _ } -> ()
| _ -> fail "a session with no main did not say so on its replies");
(* An expression that stops in the park, aborted: the expression is
abandoned and the session stays. *)
let r =
request mc
"(:op \"eval-expr\" :code \"(twice 1)\" :pause t :file \"<test>\")"
in
ignore r;
if not
(await (fun () ->
match Wire.field (request mc "(:op \"describe\")") "stopped" with
| Some { Form.v = Form.Sym "t"; _ } -> true
| _ -> false))
then fail "a paused expression in the park did not stop"
else begin
match request mc "(:op \"abort\")" with
| r when status r <> "ok" -> fail "aborting a parked expression: %s" (said r)
| _ ->
(match value "(twice 2)" with
| "4" -> ()
| v -> fail "the session after aborting a parked expression: %s" v
| exception e ->
fail "aborting a parked expression ended the session: %s"
(Printexc.to_string e))
end;
(* A main loaded into it is the one a re-run runs. *)
let r =
request mc
"(:op \"eval\" :code \"(defn main [] i32 (println \\\"from main\\\") 0)\" \
:file \"programs/dev-nomain.flan\")"
in
if status r <> "ok" then fail "loading a main: %s" (said r)
else begin
let before = Buffer.length output in
let r = request mc "(:op \"rerun\")" in
if status r <> "ok" then fail "a re-run after a main was loaded: %s" (said r)
else if
not
(await (fun () ->
ignore (request mc "(:op \"describe\")");
contains_sub
(Buffer.sub output before (Buffer.length output - before))
"from main"))
then fail "the loaded main did not run"
end;
(try
ignore (Wire.send mc "(:op \"close\")");
ignore (Wire.recv mc)
with _ -> ());
(try Unix.close mc with Unix.Unix_error _ -> ())
end;
(try Unix.kill mpid Sys.sigkill with Unix.Unix_error _ -> ());
(try ignore (Unix.waitpid [] mpid) with Unix.Unix_error _ -> ());
List.iter (fun f -> try Sys.remove f with Sys_error _ -> ())
[ msock; mout ];
(* ── A trap in an expression evaluated in the park ──────────────────
A trap has no transfer channel, so no restart can be taken from it —
but the evaluation's own boundary can, by the agent's jump back to the
poll that called it. Abort takes it, and the session answers after.
A null allocator and a stack overflow, on both backends. *)
List.iter
(fun backend ->
let tsock = tmp "trap.sock" and tout = tmp "trap.out" in
(try Sys.remove tsock with Sys_error _ -> ());
let tfd =
Unix.openfile tout [ Unix.O_WRONLY; Unix.O_CREAT; Unix.O_TRUNC ] 0o600
in
let tpid =
Unix.create_process flan
(Array.append
[| flan; "dev"; "programs/dev-nomain.flan"; "-s"; tsock |]
backend)
Unix.stdin tfd tfd
in
Unix.close tfd;
let shape = if backend = [||] then "x86" else "llvm" in
if not (listening ~pid:tpid tsock) then
fail "a trap daemon (%s) %s" shape !listen_why
else begin
let tc = connect tsock in
let said r = Option.value ~default:"" (Wire.string_field r "message") in
let r =
request tc
"(:op \"eval\" :code \"(defonce nowhere Allocator)\n\
(defonce frame Allocator)\n\
(defn deep [n i64] i64 (+ 1 (deep (+ n 1))))\" \
:file \"programs/dev-nomain.flan\")"
in
if status r <> "ok" then fail "trap definitions (%s): %s" shape (said r);
List.iter
(fun code ->
ignore
(request tc
(Printf.sprintf "(:op \"eval-expr\" :code %S :file \"<test>\")"
code));
if not
(await (fun () ->
match Wire.field (request tc "(:op \"describe\")") "stopped" with
| Some { Form.v = Form.Sym "t"; _ } -> true
| _ -> false))
then fail "%s (%s) did not stop" code shape
else
match request tc "(:op \"abort\")" with
| r when status r <> "ok" ->
fail "aborting %s (%s): %s" code shape (said r)
| _ ->
(match
Wire.string_field
(request tc
"(:op \"eval-expr\" :code \"(helper)\" :file \"<test>\")")
"value"
with
| Some "1" -> ()
| v ->
fail "the session after aborting %s (%s): %s" code shape
(Option.value ~default:"no value" v)
| exception e ->
fail "aborting %s (%s) ended the session: %s" code shape
(Printexc.to_string e)))
[ "(free-all nowhere)"; "(deep 0)" ];
let stopped () =
await (fun () ->
match Wire.field (request tc "(:op \"describe\")") "stopped" with
| Some { Form.v = Form.Sym "t"; _ } -> true
| _ -> false)
in
let eval_expr code =
request tc
(Printf.sprintf "(:op \"eval-expr\" :code %S :file \"<test>\")" code)
in
let answers code want what =
match Wire.string_field (eval_expr code) "value" with
| Some v when v = want -> ()
| v ->
fail "%s (%s): %s" what shape (Option.value ~default:"no value" v)
| exception e ->
fail "%s (%s) ended the session: %s" what shape (Printexc.to_string e)
in
(* The context allocator a trapped [with-allocator] had bound is put
back: a push through the context afterwards goes to the heap, not
to the 4 KiB arena, which would run out. *)
ignore (eval_expr "(do (set frame (arena-new 4096)) 0)");
ignore (eval_expr "(with-allocator frame (deep 0))");
if not (stopped ()) then fail "a trap inside with-allocator (%s) did not stop" shape
else begin
ignore (request tc "(:op \"abort\")");
answers
"(let [v (vec-new i64)] (dotimes [i 100000] (push v i)) (length v))"
"100000" "the context allocator after a trap inside with-allocator"
end;
(* A runaway recursion evaluated in the break loop of a fault: the
loop runs on a stack of its own with a guard page, so the second
overflow is a second break, and both abort. *)
(try
ignore (eval_expr "(deep 0)");
if not (stopped ()) then fail "the first overflow (%s) did not stop" shape
else begin
ignore (eval_expr "(deep 0)");
(* How many restarts the stopped break lists, which is what tells
the inner break from the outer — both are SegFault. The inner
one lists its own evaluation's boundary and, below it, the
outer one's. *)
let listed () =
match Wire.field (request tc "(:op \"break\")") "restarts" with
| Some { Form.v = Form.List l; _ } -> List.length l
| _ -> -1
in
let inner = listed () in
if inner < 2 then
fail "the nested overflow (%s) listed %d restarts" shape inner;
(match request tc "(:op \"abort\")" with
| r when status r = "ok" -> ()
| r -> fail "aborting a nested overflow (%s): %s" shape (said r)
| exception e ->
fail "a nested overflow (%s) ended the session: %s" shape
(Printexc.to_string e));
(* The inner break unwinds on the program's thread; the second
abort is for the outer one, so it waits until the break on top
is the outer one. *)
if not (await ~ms:30000 (fun () -> let d = listed () in d > 0 && d < inner))
then fail "the inner overflow's break (%s) was never left" shape;
ignore (request tc "(:op \"abort\")");
answers "(helper)" "1" "the session after a nested overflow"
end
with (Wire.Closed | Unix.Unix_error _) as e ->
fail "a nested overflow (%s) ended the session: %s" shape
(Printexc.to_string e));
(try
ignore (Wire.send tc "(:op \"close\")");
ignore (Wire.recv tc)
with _ -> ());
(try Unix.close tc with Unix.Unix_error _ -> ())
end;
(try Unix.kill tpid Sys.sigkill with Unix.Unix_error _ -> ());
(try ignore (Unix.waitpid [] tpid) with Unix.Unix_error _ -> ());
List.iter (fun f -> try Sys.remove f with Sys_error _ -> ())
[ tsock; tout ])
[ [||]; [| "--llvm" |] ];
(* ── A class redefined under its own instances ──────────────────
CLHS 4.3.6's update protocol, end to end, with a real editor at one
end and the running program's own heap at the other. "A method added

279
test/test_flan.ml
View File

@ -468,7 +468,23 @@ let () =
| { d = Defn { praw = Some [ Pname ("x", _); Ptype t ]; _ }; _ } -> t.t
| _ -> failwith "bad type test"
in
(match ty "[u8]" with Tslice _ -> () | _ -> check "[T] is a slice" false);
(match ty "[u8]" with
| Tslice (false, _) -> () | _ -> check "[T] is a slice" false);
(* [const] is reserved, so this is never [n T] with a length named const. *)
(match ty "[const u8]" with
| Tslice (true, { t = Tname "u8"; _ }) -> ()
| _ -> check "[const T] is a read-only slice" false);
(match ty "[const [const u8]]" with
| Tslice (true, { t = Tslice (true, _); _ }) -> ()
| _ -> check "[const [const T]] nests" false);
(match ty "[const]" with
| exception Loc.Error { Loc.dmsg; _ }
when contains dmsg "[const] names no element type" -> ()
| _ -> check "[const] alone is refused" false);
(match ty "[const 4 u8]" with
| exception Loc.Error { Loc.dmsg; _ }
when contains dmsg "has no read-only form" -> ()
| _ -> check "[const 4 u8] is refused" false);
(match ty "[4 f32]" with
| Tarray (Lint 4L, _) -> () | _ -> check "[n T] is an array" false);
(match ty "[rows [cols u32]]" with
@ -568,7 +584,7 @@ let () =
(match (parse_decl "(defmacro m [& args] (at args 0))").d with
| Defn { name = "m"; params = [ p ]; ret = Some r; _ } ->
(match p.fty.t, r.t with
| Tslice { t = Tname "Form"; _ }, Tname "Form" -> ()
| Tslice (false, { t = Tname "Form"; _ }), Tname "Form" -> ()
| _ -> check "defmacro is [Form] -> Form" false)
| _ -> check "defmacro parses as a defn" false);
@ -578,7 +594,7 @@ let () =
(match (parse_decl "(defmacro m [[a b] c & rest] (at rest 0))").d with
| Defn { name = "m"; params = [ p ]; ret = Some r; _ } ->
(match p.fty.t, r.t with
| Tslice { t = Tname "Form"; _ }, Tname "Form" -> ()
| Tslice (false, { t = Tname "Form"; _ }), Tname "Form" -> ()
| _ -> check "a parameter list is still [Form] -> Form" false)
| _ -> check "a macro with a parameter list parses as a defn" false);
@ -1083,7 +1099,7 @@ let () =
runs no passes over it. *)
infers "array-fill of nothing" "(array-fill [0] 1)" "[0 i32]";
infers "bytes of a string" "(bytes \"hi\")" "[u8]";
infers "bytes-view of a string" "(bytes-view \"hi\")" "[u8]";
infers "bytes-view of a string" "(bytes-view \"hi\")" "[const u8]";
infers "length is i32" "(length (bytes \"hi\"))" "i32";
infers "slice of a slice" "(slice (bytes \"hi\") 0 1)" "[u8]";
infers "slice of the whole" "(slice (bytes \"hi\"))" "[u8]";
@ -2226,18 +2242,247 @@ let () =
rejects_check "set through a string's slice"
"(defn f [s string] () (set (at (slice s 1) 0) 65))"
~needle:"not a place";
(* The address of one is the same question and gets the same answer, so
the message has to fit a reader who asked for a pointer and not a
store. *)
rejects_check "the address of a string's byte"
(* The address of one is a (Ptr const u8), so it is not a (Ptr u8). *)
rejects_check "the address of a string's byte is read-only"
"(defn f [s string] (Ptr u8) (addr (at s 0)))"
~needle:"(at s i) is a value and not a place";
~needle:"expected (Ptr u8), found (Ptr const u8)";
(* And a string is still not a [u8]: slicing one does not smuggle a byte
slice out of it. *)
rejects_check "a string slice is not a byte slice"
"(defn g [b [u8]] i32 (length b)) (defn f [s string] i32 (g (slice s)))"
~needle:"expected [u8], found string";
(* [const T]: a view that can only be read. Every route to a store through
one is refused, and none of the reads is. *)
infers "a const slice slices to a const slice"
"(slice (bytes-view \"hello\") 1 3)" "[const u8]";
infers "vec-new reads [const u8] as a type" "(vec-new [const u8])"
"(Vec [const u8])";
infers "map-new reads [const u8] as a type" "(map-new string [const u8])"
"(Map string [const u8])";
rejects_check "set through a const slice"
"(defn f [s [const u8]] () (set (at s 0) 65))"
~needle:"this writes through a [const u8]";
rejects_check "set through bytes-view"
"(defn f [] () (let [v (bytes-view \"Hi\")] (set (at v 0) \\h)))"
~needle:"this writes through a [const u8]";
rejects_check "set through a const slice, two indices"
"(defn f [s [const [2 i32]]] () (set (at s 0 1) 5))"
~needle:"this writes through a [const [2 i32]]";
rejects_check "set through an array element of a const slice"
"(defn f [s [const [2 i32]]] () (set (at (at s 0) 1) 5))"
~needle:"this writes through a [const [2 i32]]";
rejects_check "replace an array element of a const slice whole"
"(defn f [s [const [2 i32]]] () (set (at s 0) [1 2]))"
~needle:"this writes through a [const [2 i32]]";
rejects_check "set a field of a const slice's element"
"(defstruct P [x i32]) (defn f [s [const P]] () (set (.x (at s 0)) 5))"
~needle:"this writes through a [const P]";
rejects_check "a const slice is not a writable one"
"(defn g [b [u8]] () (set (at b 0) 1)) (defn f [s [const u8]] () (g s))"
~needle:"expected [u8], found [const u8]";
rejects_check "and the refusal names the copy"
"(defn g [b [u8]] () (set (at b 0) 1)) (defn f [s [const u8]] () (g s))"
~needle:"(bytes (string v)) copies v";
rejects_check "a generic writer does not take a const slice"
"(defn f [s [const i32]] () (sort s))"
~needle:"sort takes a slice it may write through";
rejects_check "a const slice does not cross into dyn"
"(defn f [s [const i64]] dyn s)"
~needle:"a [const i64] can only be read";
rejects_check "no conversion under a writable slice"
"(defn g [p [[const u8]]] i32 0) (defn f [p [[u8]]] i32 (g p))"
~needle:"expected [[const u8]], found [[u8]]";
rejects_check "push through a const slice of Vecs"
"(defn f [s [const (Vec i32)]] () (push (at s 0) 5))"
~needle:"reached through a [const (Vec i32)]";
rejects_check "put through a const slice of maps"
"(defn f [s [const (Map string i32)]] () (put (at s 0) \"a\" 5))"
~needle:"reached through a [const (Map string i32)]";
rejects_check "map-remove through a const slice of maps"
"(defn f [s [const (Map string i32)]] bool (map-remove (at s 0) \"a\"))"
~needle:"reached through a [const (Map string i32)]";
rejects_check "reserve through a const slice of Vecs"
"(defn f [s [const (Vec i32)]] () (reserve (at s 0) 10))"
~needle:"reached through a [const (Vec i32)]";
rejects_check "free through a const slice of Vecs"
"(defn f [s [const (Vec i32)]] () (free (at s 0)))"
~needle:"reached through a [const (Vec i32)]";
rejects_check "push into a field reached through a const slice"
"(defstruct P [v (Vec i32)]) (defn f [s [const P]] () (push (.v (at s 0)) 1))"
~needle:"reached through a [const P]";
accepts "a Vec's own buffer is not the const slice's storage"
"(defn f [s [const (Vec i32)]] () (set (at (at s 0) 0) 5))";
accepts "a reading function where a writing one is wanted"
"(defn rd [s [const u8]] i32 0) (defn c [f (Fn [[u8]] i32)] i32 0) \
(defn m [] i32 (c rd))";
rejects_check "not a writing function where a reading one is wanted"
"(defn wr [s [u8]] i32 0) (defn c [f (Fn [[const u8]] i32)] i32 0) \
(defn m [] i32 (c wr))"
~needle:"expected (Fn [[const u8]] i32), found (CFn [[u8]] i32)";
rejects_check "nor a read-only result where a writable one is wanted"
"(defn mk [] [const u8] (bytes-view \"a\")) \
(defn c [f (Fn [] [u8])] i32 0) (defn m [] i32 (c mk))"
~needle:"expected (Fn [] [u8]), found (CFn [] [const u8])";
(* (Ptr const T): the pointer beside [const T]. *)
infers "the address of a const element" "(addr (at (bytes-view \"hi\") 0))"
"(Ptr const u8)";
infers "the address of a string's byte" "(addr (at \"hi\" 0))"
"(Ptr const u8)";
infers "a const pointer slices to a const slice"
"(slice-from-ptr (addr (at (bytes-view \"hi\") 0)) 2)" "[const u8]";
rejects_check "a store through a const pointer"
"(defn f [p (Ptr const i32)] () (set (deref p) 1))"
~needle:"this writes through a (Ptr const i32)";
rejects_check "a store through the address of a const element"
"(defn f [v [const u8]] () (set (deref (addr (at v 0))) 1))"
~needle:"this writes through a (Ptr const u8)";
rejects_check "a store through the address of a string's byte"
"(defn f [s string] () (set (deref (addr (at s 0))) 1))"
~needle:"this writes through a (Ptr const u8)";
rejects_check "a field store through a const pointer"
"(defstruct P [x i32]) (defn f [p (Ptr const P)] () (set (.x p) 1))"
~needle:"this writes through a (Ptr const P)";
rejects_check "a push through a const pointer"
"(defn f [p (Ptr const (Vec i32))] () (push (deref p) 1))"
~needle:"this changes a (Vec i32) reached through a (Ptr const (Vec i32))";
rejects_check "a const pointer is not a writable one"
"(defn g [p (Ptr u8)] i32 0) (defn f [v [const u8]] i32 (g (addr (at v 0))))"
~needle:"expected (Ptr u8), found (Ptr const u8)";
rejects_check "slice-from-ptr keeps the const"
"(defn f [v [const u8]] [u8] (slice-from-ptr (addr (at v 0)) 1))"
~needle:"expected [u8], found [const u8]";
rejects_check "const alone is not a type" "(defn f [p (Ptr const)] i32 0)"
~needle:"const is not a type on its own";
rejects_check "no conversion under a writable pointer"
"(defn f [p (Ptr (Ptr i32))] (Ptr (Ptr const i32)) p)"
~needle:"expected (Ptr (Ptr const i32)), found (Ptr (Ptr i32))";
accepts "a writable pointer is a const one"
"(defn f [p (Ptr i32)] (Ptr const i32) p)";
accepts "and under a const pointer, one level down"
"(defn f [p (Ptr (Ptr i32))] (Ptr const (Ptr const i32)) p)";
accepts "a generic const pointer binds from a writable one"
"(defn f [p (Ptr const $t)] $t (deref p)) (defn g [q (Ptr i32)] i32 (f q))";
accepts "vec-new reads (Ptr const u8) as a type"
"(defn f [] i32 (let [v (vec-new (Ptr const u8))] (length v)))";
(* Decision 81: a value that owns storage, reached through read-only
storage, is used where it stands and never copied out. Every route a
copy could take is refused at the copy. *)
let copied = "this copies a (Vec i32) out of a [const (Vec i32)]" in
List.iter
(fun (name, src) -> rejects_check ("no copy out: " ^ name) src ~needle:copied)
[ "let", "(defn f [cs [const (Vec i32)]] () (let [v (at cs 0)] (push v 1)))";
"loop binding",
"(defn f [cs [const (Vec i32)]] () (loop [v (at cs 0)] (push v 1)))";
"if value",
"(defn f [c bool cs [const (Vec i32)]] () \
(let [v (if c (at cs 0) (at cs 1))] (push v 1)))";
"do value",
"(defn f [cs [const (Vec i32)]] () (let [v (do (at cs 0))] (push v 1)))";
"set into a local",
"(defn f [cs [const (Vec i32)]] () \
(let [v (vec-new i32)] (set v (at cs 0)) (push v 1)))";
"match binding",
"(defn f [cs [const (Vec i32)]] i32 \
(match (Some (at cs 0)) (Some v) (do (push v 1) 0) None 0))";
"array destructure",
"(defn f [cs [const (Vec i32)]] () \
(let [[a b] [(at cs 0) (at cs 1)]] (push a 1)))";
"closure capture",
"(defn app [g (Fn [] ())] () (g)) (defn f [cs [const (Vec i32)]] () \
(let [v (at cs 0)] (app (fn [] (push v 1)))))";
"passed by value",
"(defn pusher [v (Vec i32)] () (push v 1)) \
(defn f [cs [const (Vec i32)]] () (pusher (at cs 0)))";
"returned by value",
"(defn g [cs [const (Vec i32)]] (Vec i32) (at cs 0))";
"through a generic",
"(defn id [x $t] $t x) (defn f [cs [const (Vec i32)]] () (push (id (at cs 0)) 1))" ];
rejects_check "no copy out through a const pointer"
"(defn f [p (Ptr const (Vec i32))] () (let [v (deref p)] (push v 1)))"
~needle:"this copies a (Vec i32) out of a (Ptr const (Vec i32))";
rejects_check "and the copy that is allowed is named"
"(defn f [cs [const (Vec i32)]] (Vec i32) (at cs 0))"
~needle:"(clone v) copies it into a (Vec i32) of its own";
rejects_check "a struct holding a Vec is not copied out either"
"(defstruct P [v (Vec i32)]) (defn f [cs [const P]] P (at cs 0))"
~needle:"(addr v) gives a (Ptr const P) to read it through";
rejects_check "nor an array of them"
"(defn f [cs [const [2 (Vec i32)]]] [2 (Vec i32)] (at cs 0))"
~needle:"this copies a [2 (Vec i32)] out of a [const [2 (Vec i32)]]";
rejects_check "nor an Option of one"
"(defn f [cs [const (Option (Vec i32))]] (Option (Vec i32)) (at cs 0))"
~needle:"this copies a (Option (Vec i32)) out";
rejects_check "nor a field that owns storage"
"(defstruct P [v (Vec i32)]) (defn f [cs [const P]] (Vec i32) (.v (at cs 0)))"
~needle:"this copies a (Vec i32) out of a [const P]";
accepts "used where it stands"
"(defstruct P [v (Vec i32) n i32]) \
(defn f [cs [const (Vec i32)] ps [const P] p (Ptr const (Vec i32))] i32 \
(+ (at (at cs 0) 1) (length (at cs 0)) (length (slice (at cs 0))) \
(.n (at ps 0)) (length (.v (at ps 0))) (length (deref p)) \
(length (deref (addr (at cs 0)))) (length (clone (at cs 0)))))";
accepts "a copy of a scalar element is still a copy"
"(defn f [cs [const i32]] i32 (let [x (at cs 0)] (set x 5) x))";
(* The header copy is suggested only for elements that own nothing. *)
rejects_check "no header copy suggested for an array of Vecs"
"(defn f [cs [const [2 (Vec i32)]]] () (set (at cs 0) (at cs 1)))"
~needle:"take it as a [[2 (Vec i32)]] instead";
rejects_check "nor for an Option of a Vec"
"(defn f [cs [const (Option (Vec i32))]] () (set (at cs 0) None))"
~needle:"take it as a [(Option (Vec i32))] instead";
(* Two arguments at one type variable meet at const, either order. *)
accepts "a generic's arguments join at const"
"(defn pick [c bool a $t b $t] $t (if c a b)) \
(defn f [c bool cs [const u8] ms [u8]] i32 (+ (length (pick c ms cs)) \
(length (pick c cs ms))))";
rejects_check "and the join is read-only"
"(defn pick [c bool a $t b $t] $t (if c a b)) \
(defn f [c bool cs [const u8] ms [u8]] () (set (at (pick c ms cs) 0) 1))"
~needle:"this writes through a [const u8]";
rejects_check "no copy of Vec headers is suggested"
"(defn f [cs [const (Vec i32)]] () (set (at cs 0) (vec-new i32)))"
~needle:"take it as a [(Vec i32)] instead";
(* A fixed array reached through read-only storage slices to a read-only
view. *)
rejects_check "slice of an array element of a const slice"
"(defn f [cs [const [4 u8]]] () (let [s (slice (at cs 0))] (set (at s 0) 9)))"
~needle:"this writes through a [const u8]";
rejects_check "slice of an array behind a const pointer"
"(defn f [p (Ptr const [4 u8])] () (let [s (slice (deref p))] (set (at s 0) 9)))"
~needle:"this writes through a [const u8]";
rejects_check "slice of an array field reached through a const slice"
"(defstruct B [buf [4 u8]]) \
(defn f [cs [const B]] () (let [s (slice (.buf (at cs 0)))] (set (at s 0) 9)))"
~needle:"this writes through a [const u8]";
infers "a local array still slices to a writable slice"
"(let [a [1 2]] (slice a))" "[i32]";
(* The branches of an if meet at the read-only type, in either order. *)
accepts "if: writable then read-only"
"(defn f [c bool cs [const u8] ms [u8]] i32 (length (if c ms cs)))";
accepts "if: read-only then writable"
"(defn f [c bool cs [const u8] ms [u8]] i32 (length (if c cs ms)))";
rejects_check "and the join is read-only"
"(defn f [c bool cs [const u8] ms [u8]] () (set (at (if c ms cs) 0) 1))"
~needle:"this writes through a [const u8]";
accepts "if over pointers joins the same way"
"(defn f [c bool a (Ptr const i32) b (Ptr i32)] i32 (deref (if c b a)))";
rejects_check "const is not a name a constant can have"
"(defconst const 4)" ~needle:"const cannot be declared";
(* The const is shallow: an element of a [const [u8]] is a writable [u8]. *)
accepts "store through an element of a const slice of slices"
"(defn f [s [const [u8]]] () (set (at (at s 0) 1) 5))";
accepts "a writable slice is a const one"
"(defn g [b [const u8]] u8 (at b 0)) (defn f [s [u8]] u8 (g s))";
accepts "and so is a string's bytes, at a prelude reader"
"(defn f [s string] bool (bytes=? (bytes-view s) (bytes-view \"x\")))";
accepts "under a const slice the element converts too"
"(defn g [p [const [const u8]]] i32 0) (defn f [p [[u8]]] i32 (g p))";
accepts "the address of a const element, for C"
"(defn f [s [const u8]] (Ptr const u8) (addr (at s 0)))";
accepts "a generic reader takes both"
"(defn f [a [const i32] b [i32]] i64 (+ (sum-i32 a) (sum-i32 b)))";
(* (slice-from-ptr p n). The one form in the language whose central claim the
compiler cannot check — whether n is the truth about what p addresses — so
what it does check is worth pinning: the argument really is a pointer, the
@ -4441,8 +4686,9 @@ let () =
something different in a parameter than it does anywhere else. *)
emits "const char * as a string parameter"
"(declare-c name-length [text string] i32 \"name_length\")";
emits "a pointer parameter"
"(declare-c count-at [values (Ptr i32) n i32] i32 \"count_at\")";
(* const int * is a pointer C promises not to write through. *)
emits "a const pointer parameter"
"(declare-c count-at [values (Ptr const i32) n i32] i32 \"count_at\")";
(* struct Pair is both Pair and Point in the header and the package
describes it once, so both names have to land on the one defstruct —
raylib does exactly this with Texture2D and TextureCubemap. *)
@ -5078,6 +5324,10 @@ let () =
"(declare-c name-length [text string] i32 \"name_length\")";
agreed "a pointer that matches the header exactly"
"(declare-c count-at [values (Ptr i32) n i32] i32 \"count_at\")";
agreed "a const pointer that matches the header exactly"
"(declare-c count-at [values (Ptr const i32) n i32] i32 \"count_at\")";
agreed "a const pointer where the header says const void *"
"(declare-c blit [dst (Ptr Pair) src (Ptr const Shade) n i32] \"blit\")";
(* void * is opaque about what it points at, so there is no element type in
the header to disagree with — §A.2's LoadImageColors → UpdateTexture. *)
agreed "any pointer where the header says void *"
@ -5093,12 +5343,17 @@ let () =
name the disagreement. *)
differs "a pointer to the wrong named type"
"(declare-c pair-len-p [p (Ptr Shade)] f32 \"pair_len_p\")"
"parameter p is (Ptr Shade) and the header says (Ptr Pair)";
"parameter p is (Ptr Shade) and the header says (Ptr const Pair)";
differs "a pointer to the wrong width"
"(declare-c count-at [values (Ptr f64) n i32] i32 \"count_at\")"
"parameter values is (Ptr f64)";
(* void * gives up the element type and nothing else. It is still a pointer,
and a scalar declared against one is still a finding. *)
(* A (Ptr const T) promises C will not write, and the header has to say so
too. *)
differs "a const pointer where the header may write"
"(declare-c blit [dst (Ptr const u8) src (Ptr u8) n i32] \"blit\")"
"parameter dst is (Ptr const u8)";
differs "a scalar where the header says void *"
"(declare-c blit [dst i64 src (Ptr u8) n i32] \"blit\")"
"parameter dst is i64";

5
test/test_sanitize.ml
View File

@ -441,9 +441,8 @@ let dev_sweep () =
sanitized run must produce ASan's report and must NOT produce the
handler's line, and that is the assertion.
And it has to be built at -O0. At the sweep's -O2 the write through a
bytes-view of a string literal does not fault at all — measured, both
builds print the unmodified string — so a case that is about what happens
And it has to be built at -O0. At the sweep's -O2 a store through a null
pointer is undefined and need not fault — so a case that is about what happens
on a fault has to be compiled where the fault happens. Same family as the
-O0/-O2 split [unchecked_controls] records for bounds.flan.

112
test/test_session.ml
View File

@ -1652,4 +1652,116 @@ let () =
| _ ->
fail "two slots that strip to one name did not keep their raw spellings"));
(* ── A file with no main ───────────────────────────────────────────
[create_dev] gives it a [main] that returns, so there is a process to
start, and [has_main] tells that stub from one somebody wrote. *)
(match Session.create_dev ~file:"programs/dev-nomain.flan" () with
| t, _, [] ->
if Session.has_main t then fail "the stub main counted as the file's own";
if not
(List.exists (fun (f : Tast.fn) -> f.Tast.name = "main")
t.Session.host.Tast.fns)
then fail "a file with no main was given no main to start";
(* A [main] loaded later is the file's own. *)
(match Session.eval ~origin:"programs/dev-nomain.flan" t
"(defn main [] i32 3)" with
| _ ->
if not (Session.has_main t) then
fail "a main loaded into the session did not replace the stub"
| exception Loc.Error { Loc.dmsg = m; _ } ->
fail "loading a main into a session started without one: %s" m)
| _, _, _ :: _ -> fail "dev-nomain.flan had forms that did not compile"
| exception Loc.Error { Loc.dmsg = m; _ } ->
fail "a session over a file with no main: %s" m);
(match Session.create_dev ~file:"programs/dev-parknote.flan" () with
| t, _, _ ->
if not (Session.has_main t) then fail "a file's own main was not its own"
| exception Loc.Error { Loc.dmsg = m; _ } -> fail "dev-parknote.flan: %s" m);
(* A file with no main whose forms do not all compile starts without them,
and names them. [good] goes because it calls [bad]. *)
(match Session.create_dev ~file:"programs/dev-load-errors.flan" () with
| t, _, errs ->
let fns = List.map (fun (f : Tast.fn) -> f.Tast.name) t.Session.host.Tast.fns in
if not (List.mem "fine" fns) then fail "the form that compiled was left out";
if List.mem "good" fns || List.mem "bad" fns then
fail "a form that did not compile is in the host";
if List.length errs <> 2 then
fail "a start with two bad forms named %d" (List.length errs)
| exception Loc.Error { Loc.dmsg = m; _ } ->
fail "a no-main file with a bad form refused the session: %s" m);
(* A file with a main of its own and a form that does not compile starts
the same way, with its own main. *)
(match Session.create_dev ~file:"programs/dev-main-broken.flan" () with
| t, _, errs ->
if not (Session.has_main t) then fail "the file's own main was left out";
let fns = List.map (fun (f : Tast.fn) -> f.Tast.name) t.Session.host.Tast.fns in
if not (List.mem "fine" fns) || List.mem "bad" fns then
fail "a file with a main started with the wrong forms";
if List.length errs <> 1 then
fail "a start with one bad form named %d" (List.length errs)
| exception Loc.Error { Loc.dmsg = m; _ } ->
fail "a file with a main and a bad form refused the session: %s" m);
(* [pruned] on its own, as the daemon's load-file runs it: each round drops
the form the error is in, and one it could not blame is raised. *)
(let t, _ = Session.create ~file:"programs/dev-parknote.flan" () in
let src =
In_channel.with_open_bin "programs/dev-load-errors.flan" In_channel.input_all
in
let origin = "programs/dev-load-errors.flan" in
let forms = Reader.read_all ~file:origin src in
let check forms =
let h = Session.held t in
Fun.protect ~finally:(fun () -> Session.restore t h)
(fun () -> ignore (Session.eval ~origin ~forms t src))
in
match Session.pruned check forms with
| (), kept, errs ->
if List.length kept <> 1 then fail "load kept %d forms, not 1" (List.length kept);
(match errs with
| [ a; b ] ->
if not (has a.Loc.dmsg "expected i64") then
fail "the first error a load found was %S" a.Loc.dmsg;
if not (has b.Loc.dmsg "unknown function bad") then
fail "the form that used a dropped one went for %S" b.Loc.dmsg
| _ -> fail "load found %d errors, not 2" (List.length errs))
| exception Loc.Error { Loc.dmsg = m; _ } -> fail "pruned raised: %s" m);
(* ── An expression from a package's file ─────────────────────────────
CIDER's rule: it resolves as the file would, so the package's own names
reach it bare, a [defn-] included. From the program's file the same bare
name is not the package's. *)
(let tq, _ = Session.create ~file:"programs/pkg-private.flan" () in
(match
Session.eval_expr ~origin:"programs/pkgs/secret/secret.flan" tq
"(+ (combine 1 2) (mix 3 4))"
with
| c ->
if not (has c.Session.ir "secret") then
fail "an expression from a package's file did not reach the package"
| exception Loc.Error { Loc.dmsg = m; _ } ->
fail "an expression from a package's file: %s" m);
(* The package's own macro, bare, from its file: an expression and a
declaration both expand it as the file would. *)
(match
Session.eval_expr ~origin:"programs/pkgs/secret/secret.flan" tq "(mixed 1 1)"
with
| _ -> ()
| exception Loc.Error { Loc.dmsg = m; _ } ->
fail "a package's macro, bare, from its file: %s" m);
(match
Session.eval ~origin:"programs/pkgs/secret/secret.flan" tq
"(defn via-mixed [] i32 (mixed 1 2))"
with
| _ -> ()
| exception Loc.Error { Loc.dmsg = m; _ } ->
fail "a package's macro, bare, in a declaration from its file: %s" m);
match
Session.eval_expr ~origin:"programs/pkg-private.flan" tq "(combine 1 2)"
with
| _ -> fail "a package's bare name resolved from the program's own file"
| exception Loc.Error _ -> ());
Test_support.report ~label:"session" ()

141
vendor/agent/flan_agent.c vendored
View File

@ -41,6 +41,7 @@
#include <errno.h>
#include <stdlib.h>
#include <pthread.h>
#include <setjmp.h>
#include <signal.h>
#include <stdatomic.h>
#include <stdint.h>
@ -115,10 +116,8 @@ int64_t flan_dev_reg_by_type(int32_t live_only, int64_t *counts,
int flan_dev_reg_enabled(void);
int flan_dev_reg_overflowed(void);
void flan_free_temp(void);
/* A temp-arena mark: flan_rt.c's flan_temp_mark, six words, private there. */
#define FLAN_TEMP_MARK_WORDS 6
void flan_temp_mark_take(void *m);
void flan_temp_rollback(const void *m);
void *flan_temp_scratch_begin(void);
void flan_temp_scratch_end(void *prev);
/* A ring the listener writes and the game thread reads. One producer, one
* consumer, so two atomics and no lock — the game thread must never block on
@ -409,6 +408,31 @@ static int32_t frame_floor = -1;
static void *eval_boundary;
static const uint8_t abandon_name[] = "abandon-evaluation";
/* The way out of the innermost evaluation for a break that has no transfer
* channel — a trap: a fault, a failed bounds check, a null allocator. A
* restart is a return that unwinds frame by frame, and a trap has nothing to
* return through, so abandoning the evaluation from one is a jump straight
* back to the poll that called it ([flan_agent_poll]), which puts the
* condition, frame and root chains and the context allocator back where
* they stood. The defers of the
* frames jumped over do not run. NULL when no evaluation is in progress;
* saved and restored around the call like [eval_boundary]. */
static sigjmp_buf *eval_escape;
/* What the chains looked like when the evaluation was called, weak for the
* reason the frame walk below is: the runtime is linked into every program
* that links this, but not every build carries the dev and dyn halves. */
extern void flan_condition_stacks_mark(void **h, void **r, int32_t *d)
__attribute__((weak));
extern void flan_condition_stacks_restore(void *h, void *r, int32_t d)
__attribute__((weak));
extern void *flan_dev_frames_mark(void) __attribute__((weak));
extern void flan_dev_frames_restore(void *head) __attribute__((weak));
extern int64_t flan_dyn_root_mark(void) __attribute__((weak));
extern void flan_dyn_root_restore(int64_t n) __attribute__((weak));
extern void flan_context_save(uint64_t m[2]) __attribute__((weak));
extern void flan_context_load(const uint64_t m[2]) __attribute__((weak));
/* -- update-instance-for-redefined-class ------------------------------ */
/* A class migration calls the method from inside [get], [put] or [set] —
@ -462,6 +486,7 @@ static int migrate_call(void *fn, uint64_t instance, uint64_t added,
* would be strange to empty two thirds of it. */
void flan_agent_run_reset(void) {
eval_boundary = NULL;
eval_escape = NULL;
restart_floor = 0;
frame_floor = -1;
}
@ -548,6 +573,9 @@ typedef struct {
* client that matched on the name would offer the program's restart as the
* way out of an evaluation. The address is what makes it this one. */
int32_t boundary;
/* A trap inside an evaluation: nothing on the list can be taken, except the
* boundary, which is left by [eval_escape] rather than by a transfer. */
int32_t escapable;
int32_t used;
char names[SNAP_NAMES];
/* Where the stopped thread is, taken at the same moment and for the same
@ -637,6 +665,12 @@ static snapshot *snap_top(void) {
* to nest, which the caller reports rather than serving a stale one. */
static int32_t snap_gen; /* monotone; 0 is "no snapshot" */
/* Whether entry [i] can be taken: any reachable one at a break that can
* resume, and the evaluation's boundary at a trap inside an evaluation. */
static int can_take(const snapshot *s, int32_t i) {
return (s->resumable && s->reachable[i]) || (s->escapable && i == s->boundary);
}
static int snap_push(int resumable, void *cond) {
int d = atomic_load(&snap_depth);
if (d >= BREAK_MAX) return 0;
@ -722,6 +756,7 @@ static int snap_push(int resumable, void *cond) {
s->names[s->used++] = 0;
s->n++;
}
s->escapable = !s->resumable && eval_escape != NULL && s->boundary >= 0;
/* And the frames, from the same held-still stack. A deep recursion is
* truncated rather than followed: the innermost frames are the ones the
* question is about, and the count says how many were left out. */
@ -894,7 +929,11 @@ static void break_loop_at(const uint8_t *name, int64_t namelen, void *condition,
* when none of it can be taken — and because the same names come back
* from a `restarts' query, and the terminal and the socket must not be
* describing two different programs. */
if (!s->resumable)
if (s->escapable)
fprintf(stderr,
" nothing here can be resumed into; abandon the expression, "
"or read the frame, then fix and reload\n");
else if (!s->resumable)
fprintf(stderr,
" nothing here can be resumed into; read the frame, then fix "
"and reload, or abort\n");
@ -906,7 +945,9 @@ static void break_loop_at(const uint8_t *name, int64_t namelen, void *condition,
* than hidden, since "why can I not have that one" is a fair question
* and silence is how this went wrong the first time. */
fprintf(stderr, " %2d. restart: %s%s\n", i, s->names + s->off[i],
!s->resumable ? " (cannot be taken from this trap)"
i == s->boundary && can_take(s, i)
? " (stop running the expression; the program carries on)"
: !s->resumable ? " (cannot be taken from this trap)"
: i == s->boundary
? " (stop running the expression; the program carries on)"
: strcmp(s->names + s->off[i], (const char *)migrate_name) == 0
@ -962,7 +1003,23 @@ static void break_loop_at(const uint8_t *name, int64_t namelen, void *condition,
atomic_store(&chosen_ready, 0);
snapshot *s = snap_top();
int ok = s != NULL && s->gen == my_gen && take >= 0 && take < s->n
&& s->resumable && s->reachable[take];
&& can_take(s, take);
if (ok && !s->resumable) {
/* The boundary, at a trap: nothing to return through, so the way out
* is [eval_escape]. The break is unwound here, as a resume unwinds
* it below, and the poll that called the evaluation puts the chains
* back. */
fprintf(stderr,
"flan: the evaluation is abandoned; the program carries on "
"from where it was called. Anything it changed before it "
"stopped stays changed.\n");
fflush(stderr);
memcpy(condition_name, outer_name, sizeof condition_name);
atomic_store(&aborting, 0);
snap_pop();
atomic_fetch_sub(&depth, 1);
siglongjmp(*eval_escape, 1);
}
if (ok) {
/* Which of the two things a take is, decided here because this is the
* only place that holds both the choice and the boundary. The transfer
@ -1090,28 +1147,50 @@ int32_t flan_agent_poll(void) {
int32_t outer = restart_floor;
int32_t oframe = frame_floor;
void *obound = eval_boundary;
/* An expression run while the program is stopped rolls the temp
* allocator back to where it was before, when it finishes: what it
* formatted is reclaimed, and the text the stopped frames hold — made
* before the stop — is kept for when the program resumes. A dev build
* only, like every other temp wipe. */
uint64_t mark[FLAN_TEMP_MARK_WORDS];
int roll = atomic_load(&depth) > 0 && flan_dev_reg_enabled();
if (roll) flan_temp_mark_take(mark);
/* An expression run while the program is stopped gets a scratch temp
* arena for its duration (flan_rt.c, flan_temp_scratch_begin), wiped
* when it ends however it ends — returning, or the jump back below
* after a trap — and the program's own temp arena put back untouched.
* Text the expression leaves in program state from it dangles. */
int scratch = atomic_load(&depth) > 0;
void *otemp = scratch ? flan_temp_scratch_begin() : NULL;
restart_floor = flan_restart_count();
frame_floor = flan_dev_frame_count();
/* After the floor is read and not before: the floor counts the frames
* that were there when the thunk started, and this one is the thunk's.
* Pushed first it would be below its own boundary and refused. */
eval_boundary = flan_restart_push_c(abandon_name, sizeof abandon_name - 1);
j.call();
/* The marks are taken after the boundary is pushed, so a jump back
* here leaves it on the chain for the pop below, as a return does.
* [sigsetjmp] with the mask saved: a fault's break loop runs inside the
* signal handler, and the jump leaves the handler. */
sigjmp_buf escape;
sigjmp_buf *oescape = eval_escape;
void *mh = NULL, *mr = NULL, *mf = NULL;
int32_t md = 0;
int64_t mroots = 0;
if (flan_condition_stacks_mark) flan_condition_stacks_mark(&mh, &mr, &md);
if (flan_dev_frames_mark) mf = flan_dev_frames_mark();
if (flan_dyn_root_mark) mroots = flan_dyn_root_mark();
uint64_t mctx[2] = { 0, 0 };
if (flan_context_save) flan_context_save(mctx);
if (sigsetjmp(escape, 1) == 0) {
eval_escape = &escape;
j.call();
} else {
if (flan_condition_stacks_restore) flan_condition_stacks_restore(mh, mr, md);
if (flan_dev_frames_restore) flan_dev_frames_restore(mf);
if (flan_dyn_root_restore) flan_dyn_root_restore(mroots);
if (flan_context_load) flan_context_load(mctx);
}
eval_escape = oescape;
/* Popped whichever way the thunk left — returning with a value, or
* unwinding past this frame because someone abandoned it. */
flan_restart_pop_c(eval_boundary);
eval_boundary = obound;
restart_floor = outer;
frame_floor = oframe;
if (roll) flan_temp_rollback(mark);
if (scratch) flan_temp_scratch_end(otemp);
}
if (j.handle != NULL) { dlclose(j.handle); }
}
@ -1258,6 +1337,16 @@ static void handle_line(char *line, sink *o) {
* running too — "running" is an answer, not a refusal — because this is
* the one question an editor asks without knowing the state already, and
* refusing it would leave nothing to poll. */
/* How many modules are queued and not yet taken by a poll. The daemon asks
* after a delivery to a running program, so that one which never polls is
* told so rather than answered "ok" for a change that never lands. */
if (strcmp(line, "pending") == 0) {
char b[32];
unsigned h = atomic_load(&head), t = atomic_load(&tail);
snprintf(b, sizeof b, "%u\n", h - t);
reply(o, b);
return;
}
if (strcmp(line, "status") == 0) {
if ((atomic_load(&depth) > 0)) {
reply(o, "stopped ");
@ -1331,7 +1420,7 @@ static void handle_line(char *line, sink *o) {
* reads a takeable restart as takeable, and only misses that this one
* is the way out. */
int k = snprintf(hdr, sizeof hdr, "%d %c ", i,
!(s->resumable && s->reachable[i]) ? '-'
!can_take(s, i) ? '-'
: i == s->boundary ? '*'
: '+');
if (k > 0) emit(o, hdr, (size_t)k);
@ -1453,13 +1542,13 @@ static void handle_line(char *line, sink *o) {
* with the better sentence: at a trap every restart is unreachable, and
* answering with the thunk-boundary reason would send the reader looking
* for an evaluation that is not there. */
if (!s->resumable) {
if (!s->resumable && !can_take(s, idx)) {
reply(o, "err this break was taken by a trap with no transfer channel, "
"so no restart can be taken from it; read the frame, then fix "
"and reload, or abort\n");
"so no restart can be taken from it but the evaluation's own; "
"read the frame, then fix and reload, or abort\n");
return;
}
if (!s->reachable[idx]) {
if (!can_take(s, idx)) {
/* Refused, with the reason, rather than accepted and dropped. The
* transfer would unwind to the thunk this break is inside and stop
* there, and the program would carry on as if nothing had been
@ -1505,13 +1594,13 @@ static void handle_line(char *line, sink *o) {
reply(o, " is active\n");
return;
}
if (!s->resumable) {
if (!s->resumable && !can_take(s, at)) {
reply(o, "err this break was taken by a trap with no transfer channel, "
"so no restart can be taken from it; read the frame, then fix "
"and reload, or abort\n");
"so no restart can be taken from it but the evaluation's own; "
"read the frame, then fix and reload, or abort\n");
return;
}
if (!s->reachable[at]) {
if (!can_take(s, at)) {
reply(o, "err restart ");
reply(o, line + 8);
reply(o, " is below the evaluation this break is inside, so a "

10
vendor/edn/edn.flan vendored
View File

@ -1,4 +1,4 @@
;;;; An EDN tokenizer, in Flan, over a [u8].
;;;; An EDN tokenizer, in Flan, over a [const u8].
;;;;
;;;; This is the bottom layer of a reader. It answers one question — "what is
;;;; the next token, and where" — and it answers it without allocating
@ -161,7 +161,7 @@
;; usable underline position even though `text` is narrower than the token.
(defstruct Token
[kind i32
text [u8]
text [const u8]
pos i32])
;; The cursor owns no storage either: `src` is the caller's buffer.
@ -171,7 +171,7 @@
;; left to a parser, because `[1 2}` is malformed in a way only the tokenizer
;; has the position for.
(defstruct Cursor
[src [u8]
[src [const u8]
pos i32
err i32
err-pos i32
@ -180,7 +180,7 @@
;; ── Construction ────────────────────────────────────────────────────
(defn cursor [src [u8]] Cursor
(defn cursor [src [const u8]] Cursor
(Cursor {.src src .pos 0 .err err-none .err-pos 0 .depth 0}))
(defn ok? [c (Ptr Cursor)] bool
@ -266,7 +266,7 @@
;; text of their own — eof, error, and every delimiter. It is still a slice of
;; the input rather than a slice of nothing, so `text` has one meaning for all
;; token kinds.
(defn- empty-at [c (Ptr Cursor) p i32] [u8]
(defn- empty-at [c (Ptr Cursor) p i32] [const u8]
(slice (.src c) p p))
(defn- token [c (Ptr Cursor) kind i32 lo i32 hi i32 p i32] Token

20
vendor/edn/provide.flan vendored
View File

@ -80,7 +80,7 @@
;; buffer costs nothing to produce. A person reading a refusal wants a line and
;; a column, so the newlines before the offset are counted here — once per
;; refusal, which is as often as this is ever called.
(defn- where [src [u8] pos i32] string
(defn- where [src [const u8] pos i32] string
(let [line (i64 1)
col (i64 1)
i (i32 0)]
@ -212,7 +212,7 @@
;; One value, from the cursor's current position, consumed. `name` is what a
;; struct here would be called; `src` is the whole buffer, for the positions a
;; refusal names.
(defn- derive [c (Ptr Cursor) name string src [u8]] Derived
(defn- derive [c (Ptr Cursor) name string src [const u8]] Derived
(let [t (next c)]
(when (not (ok? c))
(return (derived-bad
@ -242,7 +242,7 @@
;; decides; every one after it is compared against that decision and both
;; positions are named when they disagree, because "heterogeneous" without
;; saying where sends someone to read the whole file.
(defn- derive-vec [c (Ptr Cursor) name string at-pos i32 src [u8]] Derived
(defn- derive-vec [c (Ptr Cursor) name string at-pos i32 src [const u8]] Derived
(when (at-byte? c \])
(return (derived-bad
(joined3 "the empty vector at " (where src at-pos)
@ -291,7 +291,7 @@
;; A set becomes `(Map T bool)`, so its elements are map keys. `derive-key` is
;; where that constraint is enforced and said.
(defn- derive-set [c (Ptr Cursor) name string at-pos i32 src [u8]] Derived
(defn- derive-set [c (Ptr Cursor) name string at-pos i32 src [const u8]] Derived
(when (at-byte? c \})
(return (derived-bad
(joined3 "the empty set at " (where src at-pos)
@ -326,7 +326,7 @@
;; fixed array, which is one where a Vec is not; anything else is refused here
;; rather than at the `(Map ...)` the caller would build out of it, because a
;; map-key refusal names a type nobody wrote.
(defn- derive-key [c (Ptr Cursor) name string src [u8]] Derived
(defn- derive-key [c (Ptr Cursor) name string src [const u8]] Derived
(when (at-byte? c \[)
(return (derive-array c name src)))
(let [d (derive c name src)]
@ -342,7 +342,7 @@
;; of the set has to be the same length as well as the same shape — which falls
;; out of the type comparison the caller already makes, since the length is in
;; the type it compares.
(defn- derive-array [c (Ptr Cursor) name string src [u8]] Derived
(defn- derive-array [c (Ptr Cursor) name string src [const u8]] Derived
(let [open (next c)]
(when (at-byte? c \])
(return (derived-bad
@ -379,7 +379,7 @@
(expect c tok-vec-close)
arr)))))))
(defn- disagreement [what string src [u8] at-pos i32 n i64
(defn- disagreement [what string src [const u8] at-pos i32 n i64
first Form second Form] string
(joined3 (joined3 "the " what " at ")
(where src at-pos)
@ -400,7 +400,7 @@
;; differently is the two arms a hand-written reader had no reason to have — a
;; key that is not a field of the struct, and a field the file did not have.
;; Both signal SchemaDrift. See the note over that type.
(defn- derive-map [c (Ptr Cursor) name string at-pos i32 src [u8]] Derived
(defn- derive-map [c (Ptr Cursor) name string at-pos i32 src [const u8]] Derived
(when (at-byte? c \})
(return (derived-bad
(joined3 "the empty map at " (where src at-pos)
@ -543,7 +543,7 @@
_ (refuse "defedn's first argument is the name of the struct to declare, written as a name"))
_ (refuse "defedn's second argument is the path to the data file, written as a string literal — the file is read while this is being compiled, so there is nothing here to compute a path from"))))
(defn- provide [name string path string src [u8]] Form
(defn- provide [name string path string src [const u8]] Form
(let [cur (cursor src)
d (derive (addr cur) name src)]
(if (bad? d)
@ -560,7 +560,7 @@
;; fields are built in, because a string field is a copy and a Vec
;; field is an allocation — spec-memory's rule, and the reason the
;; destination is never implicit.
(defn ~bname [b [u8] a Allocator] ~sname
(defn ~bname [b [const u8] a Allocator] ~sname
(let [c (cursor b)
out (~rname (addr c) a)]
;; The cursor is made and dropped here, so this is the only

4
vendor/edn/read.flan vendored
View File

@ -65,7 +65,7 @@
;; dropped here on purpose. Nothing individually owns a block in a region —
;; free-all owns all of them — so keeping the header around to free through
;; would be keeping a handle for an operation that never happens.
(defn copy-text [s [u8]] string
(defn copy-text [s [const u8]] string
(let [b (vec-new u8)]
(append (addr b) s)
(string (slice b))))
@ -136,7 +136,7 @@
;; The whole document, from a byte slice. nil when the input was malformed —
;; the header says what that conflates and what to do when it matters.
(defn read [src [u8]] dyn
(defn read [src [const u8]] dyn
(let [c (cursor src)
t (next (addr c))
v (read-value (addr c) t)]

10
vendor/json/json.flan vendored
View File

@ -1,4 +1,4 @@
;;;; A JSON tokenizer, in Flan, over a [u8].
;;;; A JSON tokenizer, in Flan, over a [const u8].
;;;;
;;;; The shape is vendor/edn's, deliberately: a Cursor over a caller's buffer,
;;;; one `next` that answers a Token, errors accumulated on the cursor with the
@ -205,7 +205,7 @@
;; underline position even where `text` is narrower than the token.
(defstruct Token
[kind i32
text [u8]
text [const u8]
pos i32])
;; The cursor owns no storage: `src` is the caller's buffer.
@ -214,7 +214,7 @@
;; each one waits for, so that {"a": [1} fails at the brace with a position
;; rather than confusing a reader two levels up.
(defstruct Cursor
[src [u8]
[src [const u8]
pos i32
err i32
err-pos i32
@ -223,7 +223,7 @@
;; ── Construction ────────────────────────────────────────────────────
(defn cursor [src [u8]] Cursor
(defn cursor [src [const u8]] Cursor
(Cursor {.src src .pos 0 .err err-none .err-pos 0 .depth 0}))
(defn ok? [c (Ptr Cursor)] bool
@ -313,7 +313,7 @@
;; An empty slice of src, positioned at p. Used for the tokens that have no
;; text of their own — eof, error, and every delimiter — so that `text` has one
;; meaning for every token kind and not two.
(defn- empty-at [c (Ptr Cursor) p i32] [u8]
(defn- empty-at [c (Ptr Cursor) p i32] [const u8]
(slice (.src c) p p))
(defn- token [c (Ptr Cursor) kind i32 lo i32 hi i32 p i32] Token

18
vendor/json/provide.flan vendored
View File

@ -63,7 +63,7 @@
;; The tokenizer answers byte offsets. A person reading a refusal wants a line
;; and a column, so the newlines before the offset are counted here — once per
;; refusal, which is as often as this is ever called.
(defn- where [src [u8] pos i32] string
(defn- where [src [const u8] pos i32] string
(let [line (i64 1)
col (i64 1)
i (i32 0)]
@ -173,7 +173,7 @@
;; ── Deriving ────────────────────────────────────────────────────────
(defn- derive [c (Ptr Cursor) name string src [u8]] Derived
(defn- derive [c (Ptr Cursor) name string src [const u8]] Derived
(let [t (next c)]
(when (not (ok? c))
(return (derived-bad
@ -202,7 +202,7 @@
;; every one after it is compared against that, and both positions are named
;; when they disagree — "heterogeneous" on its own sends someone to read the
;; whole file.
(defn- derive-array [c (Ptr Cursor) name string at-pos i32 src [u8]] Derived
(defn- derive-array [c (Ptr Cursor) name string at-pos i32 src [const u8]] Derived
(when (at-byte? c \])
(return (derived-bad
(joined3 "the empty array at " (where src at-pos)
@ -248,7 +248,7 @@
;; ── An object, which is a struct ────────────────────────────────────
(defn- derive-object [c (Ptr Cursor) name string at-pos i32 src [u8]] Derived
(defn- derive-object [c (Ptr Cursor) name string at-pos i32 src [const u8]] Derived
(when (at-byte? c \})
(return (derived-bad
(joined3 "the empty object at " (where src at-pos)
@ -349,7 +349,7 @@
(defn key=? [t Token s string] bool
(bytes=? (.text t) (bytes-view s)))
(defn- has-escape? [s [u8]] bool
(defn- has-escape? [s [const u8]] bool
(dotimes [i (length s)]
(when (= (at s i) \\)
(return true)))
@ -358,7 +358,7 @@
;; What a field name may be made of. Deliberately narrower than what the reader
;; would accept: this is the set a *person* would recognise as a name, and a
;; member called "a b" or "x.y" has no field it could become.
(defn- name-like? [s [u8]] bool
(defn- name-like? [s [const u8]] bool
(when (= (length s) 0)
(return false))
(dotimes [i (length s)]
@ -372,7 +372,7 @@
;; A copy of a token's raw text as a string. The Vec header is dropped here on
;; purpose: this runs inside the compiler, where an expansion is bounded by the
;; size of the program being compiled.
(defn- copy-of [s [u8]] string
(defn- copy-of [s [const u8]] string
(let [b (vec-new u8)]
(append (addr b) s)
(string (slice b))))
@ -424,7 +424,7 @@
_ (refuse "defjson's first argument is the name of the struct to declare, written as a name"))
_ (refuse "defjson's second argument is the path to the data file, written as a string literal — the file is read while this is being compiled, so there is nothing here to compute a path from"))))
(defn- provide [name string path string src [u8]] Form
(defn- provide [name string path string src [const u8]] Form
(let [cur (cursor src)
d (derive (addr cur) name src)]
(if (bad? d)
@ -441,7 +441,7 @@
;; built in: a string field is a copy and a Vec field is an
;; allocation, and spec-memory's rule is that the destination is
;; never implicit.
(defn ~bname [b [u8] a Allocator] ~sname
(defn ~bname [b [const u8] a Allocator] ~sname
(let [c (cursor b)
out (~rname (addr c) a)]
;; The cursor is made and dropped here, so this is the only

54
vendor/raylib/generated.flan vendored
View File

@ -78,7 +78,7 @@
(declare-c load-file-data [file-name string data-size (Ptr i32)] (Ptr u8) "LoadFileData")
(declare-c unload-file-data [data (Ptr u8)] "UnloadFileData")
(declare-c save-file-data [file-name string data (Ptr u8) data-size i32] bool "SaveFileData")
(declare-c export-data-as-code [data (Ptr u8) data-size i32 file-name string] bool "ExportDataAsCode")
(declare-c export-data-as-code [data (Ptr const u8) data-size i32 file-name string] bool "ExportDataAsCode")
(declare-c file-exists [file-name string] bool "FileExists")
(declare-c directory-exists [dir-path string] bool "DirectoryExists")
(declare-c file-extension? [file-name string ext string] bool "IsFileExtension")
@ -95,9 +95,9 @@
(declare-c path-file? [path string] bool "IsPathFile")
(declare-c file-name-valid? [file-name string] bool "IsFileNameValid")
(declare-c file-dropped? [] bool "IsFileDropped")
(declare-c compress-data [data (Ptr u8) data-size i32 comp-data-size (Ptr i32)] (Ptr u8) "CompressData")
(declare-c decompress-data [comp-data (Ptr u8) comp-data-size i32 data-size (Ptr i32)] (Ptr u8) "DecompressData")
(declare-c decode-data-base-64 [data (Ptr u8) output-size (Ptr i32)] (Ptr u8) "DecodeDataBase64")
(declare-c compress-data [data (Ptr const u8) data-size i32 comp-data-size (Ptr i32)] (Ptr u8) "CompressData")
(declare-c decompress-data [comp-data (Ptr const u8) comp-data-size i32 data-size (Ptr i32)] (Ptr u8) "DecompressData")
(declare-c decode-data-base-64 [data (Ptr const u8) output-size (Ptr i32)] (Ptr u8) "DecodeDataBase64")
(declare-c compute-crc32 [data (Ptr u8) data-size i32] u32 "ComputeCRC32")
(declare-c compute-md5 [data (Ptr u8) data-size i32] (Ptr u32) "ComputeMD5")
(declare-c compute-sha1 [data (Ptr u8) data-size i32] (Ptr u32) "ComputeSHA1")
@ -117,7 +117,7 @@
(declare-c set-mouse-scale [scale-x f32 scale-y f32] "SetMouseScale")
(declare-c get-mouse-wheel-move-v [] Vector2 "GetMouseWheelMoveV")
(declare-c update-camera-pro [camera (Ptr Camera3D) movement Vector3 rotation Vector3 zoom f32] "UpdateCameraPro")
(declare-c draw-line-strip-raw [points (Ptr Vector2) point-count i32 color Color] "DrawLineStrip")
(declare-c draw-line-strip-raw [points (Ptr const Vector2) point-count i32 color Color] "DrawLineStrip")
(declare-c draw-line-bezier [start-pos Vector2 end-pos Vector2 thick f32 color Color] "DrawLineBezier")
(declare-c draw-circle-sector [center Vector2 radius f32 start-angle f32 end-angle f32 segments i32 color Color] "DrawCircleSector")
(declare-c draw-circle-sector-lines [center Vector2 radius f32 start-angle f32 end-angle f32 segments i32 color Color] "DrawCircleSectorLines")
@ -126,16 +126,16 @@
(declare-c draw-rectangle-gradient-v [pos-x i32 pos-y i32 width i32 height i32 top Color bottom Color] "DrawRectangleGradientV")
(declare-c draw-rectangle-gradient-h [pos-x i32 pos-y i32 width i32 height i32 left Color right Color] "DrawRectangleGradientH")
(declare-c draw-rectangle-gradient-ex [rec Rectangle top-left Color bottom-left Color top-right Color bottom-right Color] "DrawRectangleGradientEx")
(declare-c draw-triangle-fan-raw [points (Ptr Vector2) point-count i32 color Color] "DrawTriangleFan")
(declare-c draw-triangle-strip-raw [points (Ptr Vector2) point-count i32 color Color] "DrawTriangleStrip")
(declare-c draw-triangle-fan-raw [points (Ptr const Vector2) point-count i32 color Color] "DrawTriangleFan")
(declare-c draw-triangle-strip-raw [points (Ptr const Vector2) point-count i32 color Color] "DrawTriangleStrip")
(declare-c draw-poly [center Vector2 sides i32 radius f32 rotation f32 color Color] "DrawPoly")
(declare-c draw-poly-lines [center Vector2 sides i32 radius f32 rotation f32 color Color] "DrawPolyLines")
(declare-c draw-poly-lines-ex [center Vector2 sides i32 radius f32 rotation f32 line-thick f32 color Color] "DrawPolyLinesEx")
(declare-c draw-spline-linear-raw [points (Ptr Vector2) point-count i32 thick f32 color Color] "DrawSplineLinear")
(declare-c draw-spline-basis-raw [points (Ptr Vector2) point-count i32 thick f32 color Color] "DrawSplineBasis")
(declare-c draw-spline-catmull-rom-raw [points (Ptr Vector2) point-count i32 thick f32 color Color] "DrawSplineCatmullRom")
(declare-c draw-spline-bezier-quadratic-raw [points (Ptr Vector2) point-count i32 thick f32 color Color] "DrawSplineBezierQuadratic")
(declare-c draw-spline-bezier-cubic-raw [points (Ptr Vector2) point-count i32 thick f32 color Color] "DrawSplineBezierCubic")
(declare-c draw-spline-linear-raw [points (Ptr const Vector2) point-count i32 thick f32 color Color] "DrawSplineLinear")
(declare-c draw-spline-basis-raw [points (Ptr const Vector2) point-count i32 thick f32 color Color] "DrawSplineBasis")
(declare-c draw-spline-catmull-rom-raw [points (Ptr const Vector2) point-count i32 thick f32 color Color] "DrawSplineCatmullRom")
(declare-c draw-spline-bezier-quadratic-raw [points (Ptr const Vector2) point-count i32 thick f32 color Color] "DrawSplineBezierQuadratic")
(declare-c draw-spline-bezier-cubic-raw [points (Ptr const Vector2) point-count i32 thick f32 color Color] "DrawSplineBezierCubic")
(declare-c draw-spline-segment-linear [p-1 Vector2 p-2 Vector2 thick f32 color Color] "DrawSplineSegmentLinear")
(declare-c draw-spline-segment-basis [p-1 Vector2 p-2 Vector2 p-3 Vector2 p-4 Vector2 thick f32 color Color] "DrawSplineSegmentBasis")
(declare-c draw-spline-segment-catmull-rom [p-1 Vector2 p-2 Vector2 p-3 Vector2 p-4 Vector2 thick f32 color Color] "DrawSplineSegmentCatmullRom")
@ -148,7 +148,7 @@
(declare-c get-spline-point-bezier-cubic [p-1 Vector2 c-2 Vector2 c-3 Vector2 p-4 Vector2 t f32] Vector2 "GetSplinePointBezierCubic")
(declare-c load-image-raw [file-name string width i32 height i32 format i32 header-size i32] Image "LoadImageRaw")
(declare-c load-image-anim [file-name string frames (Ptr i32)] Image "LoadImageAnim")
(declare-c load-image-anim-from-memory [file-type string file-data (Ptr u8) data-size i32 frames (Ptr i32)] Image "LoadImageAnimFromMemory")
(declare-c load-image-anim-from-memory [file-type string file-data (Ptr const u8) data-size i32 frames (Ptr i32)] Image "LoadImageAnimFromMemory")
(declare-c load-image-from-texture [texture Texture2D] Image "LoadImageFromTexture")
(declare-c load-image-from-screen [] Image "LoadImageFromScreen")
(declare-c export-image-to-memory [image Image file-type string file-size (Ptr i32)] (Ptr u8) "ExportImageToMemory")
@ -171,7 +171,7 @@
(declare-c image-alpha-mask [image (Ptr Image) alpha-mask Image] "ImageAlphaMask")
(declare-c image-alpha-premultiply [image (Ptr Image)] "ImageAlphaPremultiply")
(declare-c image-blur-gaussian [image (Ptr Image) blur-size i32] "ImageBlurGaussian")
(declare-c image-kernel-convolution [image (Ptr Image) kernel (Ptr f32) kernel-size i32] "ImageKernelConvolution")
(declare-c image-kernel-convolution [image (Ptr Image) kernel (Ptr const f32) kernel-size i32] "ImageKernelConvolution")
(declare-c image-resize-canvas [image (Ptr Image) new-width i32 new-height i32 offset-x i32 offset-y i32 fill Color] "ImageResizeCanvas")
(declare-c image-mipmaps [image (Ptr Image)] "ImageMipmaps")
(declare-c image-dither [image (Ptr Image) r-bpp i32 g-bpp i32 b-bpp i32 a-bpp i32] "ImageDither")
@ -211,8 +211,8 @@
(declare-c image-draw-text [dst (Ptr Image) text string pos-x i32 pos-y i32 font-size i32 color Color] "ImageDrawText")
(declare-c image-draw-text-ex [dst (Ptr Image) font Font text string position Vector2 font-size f32 spacing f32 tint Color] "ImageDrawTextEx")
(declare-c load-texture-cubemap [image Image layout i32] Texture2D "LoadTextureCubemap")
(declare-c update-texture [texture Texture2D pixels (Ptr u8)] "UpdateTexture")
(declare-c update-texture-rec [texture Texture2D rec Rectangle pixels (Ptr u8)] "UpdateTextureRec")
(declare-c update-texture [texture Texture2D pixels (Ptr const u8)] "UpdateTexture")
(declare-c update-texture-rec [texture Texture2D rec Rectangle pixels (Ptr const u8)] "UpdateTextureRec")
(declare-c gen-texture-mipmaps [texture (Ptr Texture2D)] "GenTextureMipmaps")
(declare-c set-texture-wrap [texture Texture2D wrap i32] "SetTextureWrap")
(declare-c color-is-equal [col-1 Color col-2 Color] bool "ColorIsEqual")
@ -229,13 +229,13 @@
(declare-c set-pixel-color [dst-ptr (Ptr u8) color Color format i32] "SetPixelColor")
(declare-c get-pixel-data-size [width i32 height i32 format i32] i32 "GetPixelDataSize")
(declare-c load-font-from-image [image Image key Color first-char i32] Font "LoadFontFromImage")
(declare-c load-font-from-memory [file-type string file-data (Ptr u8) data-size i32 font-size i32 codepoints (Ptr i32) codepoint-count i32] Font "LoadFontFromMemory")
(declare-c load-font-data [file-data (Ptr u8) data-size i32 font-size i32 codepoints (Ptr i32) codepoint-count i32 type i32] (Ptr GlyphInfo) "LoadFontData")
(declare-c gen-image-font-atlas [glyphs (Ptr GlyphInfo) glyph-recs (Ptr (Ptr Rectangle)) glyph-count i32 font-size i32 padding i32 pack-method i32] Image "GenImageFontAtlas")
(declare-c load-font-from-memory [file-type string file-data (Ptr const u8) data-size i32 font-size i32 codepoints (Ptr i32) codepoint-count i32] Font "LoadFontFromMemory")
(declare-c load-font-data [file-data (Ptr const u8) data-size i32 font-size i32 codepoints (Ptr i32) codepoint-count i32 type i32] (Ptr GlyphInfo) "LoadFontData")
(declare-c gen-image-font-atlas [glyphs (Ptr const GlyphInfo) glyph-recs (Ptr (Ptr Rectangle)) glyph-count i32 font-size i32 padding i32 pack-method i32] Image "GenImageFontAtlas")
(declare-c unload-font-data [glyphs (Ptr GlyphInfo) glyph-count i32] "UnloadFontData")
(declare-c export-font-as-code [font Font file-name string] bool "ExportFontAsCode")
(declare-c draw-text-pro [font Font text string position Vector2 origin Vector2 rotation f32 font-size f32 spacing f32 tint Color] "DrawTextPro")
(declare-c draw-text-codepoints [font Font codepoints (Ptr i32) codepoint-count i32 position Vector2 font-size f32 spacing f32 tint Color] "DrawTextCodepoints")
(declare-c draw-text-codepoints [font Font codepoints (Ptr const i32) codepoint-count i32 position Vector2 font-size f32 spacing f32 tint Color] "DrawTextCodepoints")
(declare-c set-text-line-spacing [spacing i32] "SetTextLineSpacing")
(declare-c load-codepoints [text string count (Ptr i32)] (Ptr i32) "LoadCodepoints")
(declare-c unload-codepoints [codepoints (Ptr i32)] "UnloadCodepoints")
@ -246,7 +246,7 @@
(declare-c text-is-equal [text-1 string text-2 string] bool "TextIsEqual")
(declare-c text-length [text string] u32 "TextLength")
(declare-c text-subtext [text string position i32 length i32] string "TextSubtext")
(declare-c text-join [text-list (Ptr (Ptr i8)) count i32 delimiter string] string "TextJoin")
(declare-c text-join [text-list (Ptr const (Ptr i8)) count i32 delimiter string] string "TextJoin")
(declare-c text-split [text string delimiter i8 count (Ptr i32)] (Ptr (Ptr i8)) "TextSplit")
(declare-c text-find-index [text string find string] i32 "TextFindIndex")
(declare-c text-to-upper [text string] string "TextToUpper")
@ -260,7 +260,7 @@
(declare-c draw-point-3d [position Vector3 color Color] "DrawPoint3D")
(declare-c draw-circle-3d [center Vector3 radius f32 rotation-axis Vector3 rotation-angle f32 color Color] "DrawCircle3D")
(declare-c draw-triangle-3d [v-1 Vector3 v-2 Vector3 v-3 Vector3 color Color] "DrawTriangle3D")
(declare-c draw-triangle-strip-3d-raw [points (Ptr Vector3) point-count i32 color Color] "DrawTriangleStrip3D")
(declare-c draw-triangle-strip-3d-raw [points (Ptr const Vector3) point-count i32 color Color] "DrawTriangleStrip3D")
(declare-c draw-cube-wires-v [position Vector3 size Vector3 color Color] "DrawCubeWiresV")
(declare-c draw-sphere-ex [center-pos Vector3 radius f32 rings i32 slices i32 color Color] "DrawSphereEx")
(declare-c draw-cylinder [position Vector3 radius-top f32 radius-bottom f32 height f32 slices i32 color Color] "DrawCylinder")
@ -286,7 +286,7 @@
(declare-c draw-billboard-rec [camera Camera3D texture Texture2D source Rectangle position Vector3 size Vector2 tint Color] "DrawBillboardRec")
(declare-c draw-billboard-pro [camera Camera3D texture Texture2D source Rectangle position Vector3 up Vector3 size Vector2 origin Vector2 rotation f32 tint Color] "DrawBillboardPro")
(declare-c upload-mesh [mesh (Ptr Mesh) dynamic bool] "UploadMesh")
(declare-c update-mesh-buffer [mesh Mesh index i32 data (Ptr u8) data-size i32 offset i32] "UpdateMeshBuffer")
(declare-c update-mesh-buffer [mesh Mesh index i32 data (Ptr const u8) data-size i32 offset i32] "UpdateMeshBuffer")
(declare-c unload-mesh [mesh Mesh] "UnloadMesh")
(declare-c get-mesh-bounding-box [mesh Mesh] BoundingBox "GetMeshBoundingBox")
(declare-c gen-mesh-tangents [mesh (Ptr Mesh)] "GenMeshTangents")
@ -312,14 +312,14 @@
(declare-c get-ray-collision-mesh [ray Ray mesh Mesh transform Matrix] RayCollision "GetRayCollisionMesh")
(declare-c get-ray-collision-triangle [ray Ray p-1 Vector3 p-2 Vector3 p-3 Vector3] RayCollision "GetRayCollisionTriangle")
(declare-c get-ray-collision-quad [ray Ray p-1 Vector3 p-2 Vector3 p-3 Vector3 p-4 Vector3] RayCollision "GetRayCollisionQuad")
(declare-c load-wave-from-memory [file-type string file-data (Ptr u8) data-size i32] Wave "LoadWaveFromMemory")
(declare-c update-sound [sound Sound data (Ptr u8) sample-count i32] "UpdateSound")
(declare-c load-wave-from-memory [file-type string file-data (Ptr const u8) data-size i32] Wave "LoadWaveFromMemory")
(declare-c update-sound [sound Sound data (Ptr const u8) sample-count i32] "UpdateSound")
(declare-c export-wave-as-code [wave Wave file-name string] bool "ExportWaveAsCode")
(declare-c load-music-stream-from-memory [file-type string data (Ptr u8) data-size i32] Music "LoadMusicStreamFromMemory")
(declare-c load-music-stream-from-memory [file-type string data (Ptr const u8) data-size i32] Music "LoadMusicStreamFromMemory")
(declare-c load-audio-stream [sample-rate u32 sample-size u32 channels u32] AudioStream "LoadAudioStream")
(declare-c audio-stream-valid? [stream AudioStream] bool "IsAudioStreamValid")
(declare-c unload-audio-stream [stream AudioStream] "UnloadAudioStream")
(declare-c update-audio-stream [stream AudioStream data (Ptr u8) frame-count i32] "UpdateAudioStream")
(declare-c update-audio-stream [stream AudioStream data (Ptr const u8) frame-count i32] "UpdateAudioStream")
(declare-c audio-stream-processed? [stream AudioStream] bool "IsAudioStreamProcessed")
(declare-c play-audio-stream [stream AudioStream] "PlayAudioStream")
(declare-c pause-audio-stream [stream AudioStream] "PauseAudioStream")

30
vendor/raylib/raylib.flan vendored
View File

@ -582,10 +582,10 @@
;; out-of-bounds read, and raylib answers false for a polygon with no points
;; anyway.
(declare-c collision-point-poly?-raw
[point Vector2 points (Ptr Vector2) count i32] bool
[point Vector2 points (Ptr const Vector2) count i32] bool
"CheckCollisionPointPoly")
(defn collision-point-poly? [point Vector2 points [Vector2]] bool
(defn collision-point-poly? [point Vector2 points [const Vector2]] bool
(if (= (length points) 0)
false
(collision-point-poly?-raw point (addr (at points 0)) (length points))))
@ -801,7 +801,7 @@
;; which integer type a C count parameter is. The Flan wrapper below takes the
;; slice apart, which is where that idiom lives everywhere else in this file.
(declare-c load-image-from-memory-raw
[file-type string file-data (Ptr u8) data-size i32] Image
[file-type string file-data (Ptr const u8) data-size i32] Image
"LoadImageFromMemory")
;; Empty is answered here rather than passed on, exactly as in
@ -811,7 +811,7 @@
;; false for it either way, so a caller that checks sees the same thing.
(defonce no-image Image)
(defn load-image-from-memory [file-type string data [u8]] Image
(defn load-image-from-memory [file-type string data [const u8]] Image
(if (= (length data) 0)
no-image
(load-image-from-memory-raw file-type (addr (at data 0)) (length data))))
@ -1015,42 +1015,42 @@
;; Each -raw below is a generated declaration whose name moved aside; see the
;; `name` lines at the foot of `bindings`.
(defn draw-line-strip [points [Vector2] color Color] ()
(defn draw-line-strip [points [const Vector2] color Color] ()
(when (> (length points) 0)
(draw-line-strip-raw (addr (at points 0)) (length points) color)))
(defn draw-triangle-fan [points [Vector2] color Color] ()
(defn draw-triangle-fan [points [const Vector2] color Color] ()
(when (> (length points) 0)
(draw-triangle-fan-raw (addr (at points 0)) (length points) color)))
(defn draw-triangle-strip [points [Vector2] color Color] ()
(defn draw-triangle-strip [points [const Vector2] color Color] ()
(when (> (length points) 0)
(draw-triangle-strip-raw (addr (at points 0)) (length points) color)))
(defn draw-triangle-strip-3d [points [Vector3] color Color] ()
(defn draw-triangle-strip-3d [points [const Vector3] color Color] ()
(when (> (length points) 0)
(draw-triangle-strip-3d-raw (addr (at points 0)) (length points) color)))
;; The five spline drawers. raylib reads the same point array five different
;; ways; the only difference between these wrappers is which one it calls.
(defn draw-spline-linear [points [Vector2] thick f32 color Color] ()
(defn draw-spline-linear [points [const Vector2] thick f32 color Color] ()
(when (> (length points) 0)
(draw-spline-linear-raw (addr (at points 0)) (length points) thick color)))
(defn draw-spline-basis [points [Vector2] thick f32 color Color] ()
(defn draw-spline-basis [points [const Vector2] thick f32 color Color] ()
(when (> (length points) 0)
(draw-spline-basis-raw (addr (at points 0)) (length points) thick color)))
(defn draw-spline-catmull-rom [points [Vector2] thick f32 color Color] ()
(defn draw-spline-catmull-rom [points [const Vector2] thick f32 color Color] ()
(when (> (length points) 0)
(draw-spline-catmull-rom-raw (addr (at points 0)) (length points) thick color)))
(defn draw-spline-bezier-quadratic [points [Vector2] thick f32 color Color] ()
(defn draw-spline-bezier-quadratic [points [const Vector2] thick f32 color Color] ()
(when (> (length points) 0)
(draw-spline-bezier-quadratic-raw
(addr (at points 0)) (length points) thick color)))
(defn draw-spline-bezier-cubic [points [Vector2] thick f32 color Color] ()
(defn draw-spline-bezier-cubic [points [const Vector2] thick f32 color Color] ()
(when (> (length points) 0)
(draw-spline-bezier-cubic-raw
(addr (at points 0)) (length points) thick color)))
@ -1595,7 +1595,7 @@
;; half no longer carries the string-faced version at all — a binding that is
;; wrong for the only direction it reads in is worse than no binding.
(declare-c get-codepoint-previous-raw
[text (Ptr u8) codepoint-size (Ptr i32)] i32
[text (Ptr const u8) codepoint-size (Ptr i32)] i32
"GetCodepointPrevious")
;; The face a caller wants: the bytes and an offset into them, rather than an
@ -1606,7 +1606,7 @@
;; before it and `codepoint-size` is that one's length in bytes, so the
;; previous offset is `offset` minus what comes back through the pointer. At
;; offset 0 there is nothing behind it and raylib is not asked.
(defn get-codepoint-previous [text [u8] offset i32 codepoint-size (Ptr i32)] i32
(defn get-codepoint-previous [text [const u8] offset i32 codepoint-size (Ptr i32)] i32
(if (<= offset 0)
(do (set (deref codepoint-size) 0) 0)
(get-codepoint-previous-raw (addr (at text offset)) codepoint-size)))

2
web/examples/structs.flan
View File

@ -1,5 +1,5 @@
(defstruct Cursor
[src [u8] ; a non-owning slice
[src [const u8] ; a read-only, non-owning slice
pos i32]) ; no initialiser means zeroed
(defn peek [c (Ptr Cursor)] u8

11
web/index.html
View File

@ -384,7 +384,8 @@ described.</p>
<li><strong>Fixed arrays are values.</strong> <code>[n T]</code> is inline storage
and copies on assignment and on pass-by-value.</li>
<li><strong>Slices are views.</strong> <code>[T]</code> is ptr+len and owns nothing.
Copying a slice copies the view, never the elements.</li>
Copying a slice copies the view, never the elements. <code>[const T]</code> is the
same view with no stores through it.</li>
<li><strong>Pointers are visible.</strong> <code>(addr x)</code> takes the address of
any assignable place and gives <code>(Ptr T)</code>. It does not extend anything's
lifetime, and keeping one past its frame is your contract to honour — there is no
@ -518,12 +519,14 @@ notation reads as exactly one data item.</p>
<tr><td><code>bool</code></td><td></td><td><code>i1</code></td></tr>
<tr><td><code>string</code></td><td>a byte slice with no NUL</td><td>ptr + len</td></tr>
<tr><td><code>[T]</code></td><td>slice, non-owning</td><td>ptr + len</td></tr>
<tr><td><code>[const T]</code></td><td>read-only slice: a <code>[T]</code> converts to one, never the reverse</td><td>ptr + len</td></tr>
<tr><td><code>[n T]</code></td><td>fixed array, a value</td><td>n inline items</td></tr>
<tr><td><code>(Vec T)</code></td><td>growable, owning — copies as its header, so the copies alias one buffer</td><td>ptr + len + cap + its allocator</td></tr>
<tr><td><code>(Map K V)</code></td><td>open addressing, owning, copies the same way. The only map spelling: braces in type position are not a type</td><td>data + len + log2cap + its allocator</td></tr>
<tr><td><code>(Pool T)</code></td><td>generational slab storage, owning, copies the same way</td><td>items + slots + its allocator</td></tr>
<tr><td><code>(Handle T)</code></td><td>a reference into a pool that reports a dead referent</td><td>index and generation packed into an <code>i64</code></td></tr>
<tr><td><code>(Ptr T)</code></td><td>raw pointer</td><td>a pointer</td></tr>
<tr><td><code>(Ptr const T)</code></td><td>a pointer nothing is written through: the address of read-only storage, and what a C <code>const T *</code> takes. A <code>(Ptr T)</code> converts to one, never the reverse</td><td>a pointer</td></tr>
<tr><td><code>(Option T)</code></td><td><code>Some</code> / <code>None</code></td><td>tag byte + T</td></tr>
<tr><td><code>(Fn [T ...] R)</code></td><td>a function value, which may have captured</td><td>a code address and an environment pointer</td></tr>
<tr><td><code>(CFn [T ...] R)</code></td><td>a function value that cannot capture — the <code>C</code> is what a C function pointer would need, not a way to reach C today</td><td>a pointer</td></tr>
@ -807,7 +810,7 @@ code on every target, which is what makes the collector work there.</p>
its fields, and omitted fields are zeroed.</p>
<pre><code>(defstruct Cursor
[src [u8] ; a non-owning slice
[src [const u8] ; a read-only, non-owning slice
pos i32]) ; no initialiser means zeroed
(defn peek [c (Ptr Cursor)] u8
@ -836,8 +839,8 @@ its bytes.</p>
<p>There are two ways to see a string's bytes and the difference is whether anything
is allocated. <code>(bytes-view s)</code> is the string's own storage seen as a
<code>[u8]</code> and costs nothing; it aliases the string, so a literal's view points
into <code>.rodata</code> and writing through it traps. <code>(bytes s)</code> and
<code>[const u8]</code> and costs nothing; it aliases the string, and a store through
it is a compile error. <code>(bytes s)</code> and
<code>(bytes s allocator)</code> make a writable copy through the allocator — never a
hidden <code>malloc</code>, which is the rule every allocating operation follows. The
example above wants a view and takes one.</p>