refactor(lang): rename the ptr/ptrs types to pointer/pointers
Expand the abbreviated pointer types to full words on the language surface: ptr -> pointer (a raw address / FFI handle) ptrs -> pointers (a buffer of pointers) The Ludic type name is distinct from LLVM's own `ptr` spelling: llty() maps `pointer`/`pointers` to LLVM `ptr`, and the emitted IR keeps `ptr`, so only the Ludic-level surface changes. Rewrites type annotations across all sources, the 8 hardcoded pointer type-tags, the `pointers`-buffer indexing in emit_addr, the grammars/LSP/JetBrains tokens, and the docs (type-ptr -> type-pointer, type-ptrs -> type-pointers). int/bool keep their conventional short spelling (like Math). Reseeded; C-free fixpoint holds; all suites green (45/24/29); site + check.py OK. Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
This commit is contained in:
parent
b7745a4600
commit
effb3f637f
76 changed files with 516 additions and 516 deletions
|
|
@ -11,7 +11,7 @@ function emit_block(b: Node) -> void {
|
|||
}
|
||||
|
||||
# store `val` (llvm type `lt`) into address `addr`
|
||||
function store_at(lt: ptr, v: ptr, addr: ptr) -> void {
|
||||
function store_at(lt: pointer, v: pointer, addr: pointer) -> void {
|
||||
emit(" store "); emit(lt); emit(" "); emit(v); emit(", ptr "); emit(addr); emit("\n")
|
||||
}
|
||||
|
||||
|
|
@ -167,8 +167,8 @@ function emit_emit(st: Node) -> Val {
|
|||
let ev = find_event(st.s)
|
||||
if (ev == null) { perr(`emit: unknown event {st.s}`) }
|
||||
# evaluate each payload field in declared order (default for a missing arg)
|
||||
let fcodes = new []ptr
|
||||
let ftys = new []ptr
|
||||
let fcodes = new []pointer
|
||||
let ftys = new []pointer
|
||||
var f = 0
|
||||
while f < len(ev.kids) {
|
||||
let fd = ev.kids[f]
|
||||
|
|
@ -261,7 +261,7 @@ function emit_stmt(st: Node) -> void {
|
|||
perr("cannot emit statement")
|
||||
}
|
||||
|
||||
function loop_push(cont: ptr, brk: ptr) -> void {
|
||||
function loop_push(cont: pointer, brk: pointer) -> void {
|
||||
if nloop < len(cnt_lbl) { cnt_lbl[nloop] = cont; brk_lbl[nloop] = brk }
|
||||
else { push(cnt_lbl, cont); push(brk_lbl, brk) }
|
||||
nloop = nloop + 1
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue