I was bored

.gitattributes

@@ -0,0 +1 @@
+*.sl linguist-language=l2

SPEC.md

@@ -4,13 +4,13 @@ This document reflects the implementation that ships in this repository today (`
 
 ## 1. Scope and Principles
 - **Stack-based core** – All user code manipulates a 64-bit data stack plus a separate return stack. Every definition is a “word.”
-- **Ahead-of-time native output** – `main.py` always emits NASM-compatible x86-64 assembly, assembles it with `nasm -f elf64`, and links it with `ld`/`ld.lld` into an ELF64 executable. There is no JIT; the REPL repeatedly rebuilds and executes small binaries.
+- **Ahead-of-time native output** – `main.py` emits NASM-compatible x86-64 assembly, assembles it with `nasm -f elf64`, and links it with `ld`/`ld.lld` into an ELF64 executable. There is JIT for the compile time execution and the REPL uses it as well.
 - **Meta-programmable front-end** – Parsing, macro expansion, and syntax sugar live in user space via immediate words, text macros, compile-time intrinsics, and `:py` blocks. Users can reshape syntax without touching the Python host.
 - **Unsafe by design** – Memory, syscalls, inline assembly, and FFI expose raw machine power. The standard library is intentionally thin and policy-free.
 
 ## 2. Toolchain and Repository Layout
 - **Driver (`main.py`)** – Supports `python main.py source.sl -o a.out`, `--emit-asm`, `--run`, `--dbg`, `--repl`, `--temp-dir`, `--clean`, `--dump-cfg[=path]`, repeated `-I/--include` paths, and repeated `-l` linker flags (either `-lfoo` or `-l libc.so.6`). Unknown `-l` flags are collected and forwarded to the linker. Pass `--ct-run-main` to run the program's `main` word on the compile-time VM before NASM/ld run, which surfaces discrepancies between compile-time and runtime semantics. Pass `--no-artifact` to stop after compilation/assembly emission without building an output file, or use `--script` as shorthand for `--no-artifact --ct-run-main`. Pass `--docs` to open a searchable TUI that scans stack-effect comments and nearby docs from `.sl` files (`--docs-query` sets initial filter and `--docs-root` adds scan roots). `--no-folding` disables constant folding and `--no-peephole` disables peephole rewrites (for example `swap drop` → `nip`, `dup drop` removed, `swap over` → `tuck`, `nip drop` → `2drop`, `x 0 +` removed, `x 1 *` removed, `x -1 *` → `neg`, and `not not` removed).
-- **REPL** – `--repl` launches a stateful session with commands such as `:help`, `:reset`, `:load`, `:call <word>`, `:edit`, and `:show`. The REPL still emits/links entire programs for each run; it simply manages the session source for you.
+- **REPL** – `--repl` launches a stateful session with commands such as `:help`, `:reset`, `:load`, `:call <word>`, `:edit`, and `:show`.
 - **Imports** – `import relative/or/absolute/path.sl` inserts the referenced file textually. Resolution order: (1) absolute path, (2) relative to the importing file, (3) each include path (defaults: project root and `./stdlib`). Each file is included at most once per compilation unit. Import lines leave blank placeholders so error spans stay meaningful.
 - **Workspace** – `stdlib/` holds library modules, `tests/` contains executable samples with `.expected` outputs, `extra_tests/` houses standalone integration demos, and `libs/` collects opt-in extensions such as `libs/fn.sl` and `libs/nob.sl`.
 
@@ -18,19 +18,19 @@ This document reflects the implementation that ships in this repository today (`
 - **Reader** – Whitespace-delimited; `#` starts a line comment. String literals honor `\"`, `\\`, `\n`, `\r`, `\t`, and `\0`. Numbers default to signed 64-bit integers via `int(token, 0)` (so `0x`, `0o`, `0b` all work). Tokens containing `.` or `e` parse as floats.
 - **Identifiers** – `[A-Za-z_][A-Za-z0-9_]*`. Everything else is treated as punctuation or literal.
 - **String representation** – At runtime each literal pushes `(addr len)` with the length on top. The assembler stores literals in `section .data` with a trailing `NULL` for convenience.
-- **Lists** – `[` begins a list literal, `]` ends it. The compiler captures the intervening stack segment into a freshly `mmap`'d buffer that stores `(len followed by qword items)`, drops the captured values, and pushes the buffer address. Users must `munmap` the buffer when done.
+- **Lists** – `[` begins a list literal, `]` ends it. The compiler captures the intervening stack segment into a freshly `mmap`'d buffer that stores `(len followed by qword items)`, drops the captured values, and pushes the buffer address. Users must `munmap` the buffer when done. When elems are known at compile time then the list is folded and put in .bss so it doesn't need to be freed then, you can disable this optimization via a flag --no-static-list-folding.
 - **Token customization** – Immediate words can call `add-token` or `add-token-chars` to teach the reader about new multi-character tokens. `libs/fn.sl` uses this in combination with token hooks to recognize `foo(1, 2)` syntax.
 
 ### Stack-effect comments
 - **Location and prefix** – Public words in `stdlib/` (and most user code should) document its stack effect with a line comment directly above the definition: `#word_name …`.
-- **Before/after form** – Use `[before] -> [after]`, where each side is a comma-separated list. Items sitting to the left of `|` are deeper in the stack; the segment to the right of `|` runs all the way to the current top-of-stack. Omit the `|` only when a side is empty (`[*]`).
+- **Before/after form** – Use `[before] -> [after]`, where each side is a comma-separated list. Items sitting to the left of `|` are deeper in the stack and on the right is the top most element. Omit the `|` only when a side is empty (`[*]`).
 - **Tail sentinel** – `*` represents the untouched rest of the stack. By convention it is always the first entry on each side so readers can quickly see which values are consumed/produced.
 - **Alternatives** – Separate multiple outcomes with `||`. Each branch repeats the `[before] -> [after]` structure (e.g., `#read_file [*, path | len] -> [*, addr | len] || [*, tag | neg_errno]`).
 - **Examples** – `#dup [* | x] -> [*, x | x]` means a word consumes the top value `x` and returns two copies with the newest copy at TOS; `#arr_pop [* | arr] -> [*, arr | x]` states that the array pointer remains just below the popped element. This notation keeps stack order resonably easy to read and grep.
 
 ## 4. Runtime Model
 - **Stacks** – `r12` holds the data stack pointer, `r13` the return stack pointer. Both live in `.bss` buffers sized by `DSTK_BYTES`/`RSTK_BYTES` (default 64 KiB each). `stdlib/core.sl` implements all standard stack shuffles, arithmetic, comparisons, boolean ops, `@`/`!`, `c@`/`c!`, and return-stack transfers (`>r`, `r>`, `rdrop`, `rpick`).
-- **Calling convention** – Words call each other using the System V ABI. `extern` words marshal arguments into registers before `call symbol`, then push results back onto the data stack. Integer results come from `rax`; floating results come from `xmm0` and are copied into a qword slot.
+- **Calling convention** – Calling convention applies only to the extern functions and follows the System V ABI. `extern` words marshal arguments into registers before `call symbol`, then push results back onto the data stack. Integer results come from `rax`; floating results come from `xmm0` and are copied into a qword slot.
 - **Memory helpers** – `mem` returns the address of the `persistent` buffer (default 64 bytes). `argc`, `argv`, and `argv@` expose process arguments. `alloc`/`free` wrap `mmap`/`munmap` for general-purpose buffers, while `memcpy` performs byte-wise copies.
 - **BSS customization** – Compile-time words may call `bss-clear` followed by `bss-append`/`bss-set` to replace the default `.bss` layout (e.g., `tests/bss_override.sl` enlarges `persistent`).
 - **Strings & buffers** – IO helpers consume explicit `(addr len)` pairs only; there is no implicit NULL contract except for stored literals.
@@ -80,7 +80,7 @@ This document reflects the implementation that ships in this repository today (`
 - **`core.sl`** – Stack shuffles, integer arithmetic, comparisons, boolean ops, memory access, syscall stubs (`mmap`, `munmap`, `exit`), argument helpers (`argc`, `argv`, `argv@`), and pointer helpers (`mem`).
 - **`control.sl`** – Optional custom control-structure words (`if`, `else`, `for`, `while`, `do`) that can override parser defaults when imported.
 - **`mem.sl`** – `alloc`/`free` wrappers around `mmap`/`munmap` plus a byte-wise `memcpy` used by higher-level utilities.
-- **`io.sl`** – `read_file`, `write_file`, `read_stdin`, `write_buf`, `ewrite_buf`, `putc`, `puti`, `puts`, `eputs`, and a smart `print` that detects `(addr,len)` pairs located inside the default `.data` region.
+- **`io.sl`** – `read_file`, `write_file`, `read_stdin`, `write_buf`, `ewrite_buf`, `putc`, `puti`, `puts`, `eputs`.
 - **`utils.sl`** – String and number helpers (`strcmp`, `strconcat`, `strlen`, `digitsN>num`, `toint`, `count_digits`, `tostr`).
 - **`arr.sl`** – Dynamically sized qword arrays with `arr_new`, `arr_len`, `arr_cap`, `arr_data`, `arr_push`, `arr_pop`, `arr_reserve`, `arr_free`; built-in static-array sorting via `arr_sort`/`arr_sorted`; and dynamic-array sorting via `dyn_arr_sort`/`dyn_arr_sorted`.
 - **`float.sl`** – SSE-based double-precision arithmetic (`f+`, `f-`, `f*`, `f/`, `fneg`, comparisons, `int>float`, `float>int`, `fput`, `fputln`).

extra_tests/termios_test.expected

@@ -0,0 +1,8 @@
+stdin is a tty? 
+1
+stdout is a tty? 
+0
+stderr is a tty? 
+0
+Invalid fd (999) is a tty? 
+-1

extra_tests/termios_test.sl

@@ -0,0 +1,16 @@
+import stdlib.sl
+import termios.sl
+
+word main
+    "stdin is a tty? " puts
+    0 isatty puti cr
+
+    "stdout is a tty? " puts
+    1 isatty puti cr
+
+    "stderr is a tty? " puts
+    2 isatty puti cr
+
+    "Invalid fd (999) is a tty? " puts
+    999 isatty puti cr
+end

main.py

@@ -11542,7 +11542,7 @@ def _run_docs_tui(
         "\n"
         "    5. NASM + LINKER\n"
         "       The assembly is assembled by NASM into an object\n"
-        "       file, then linked (via ld or gcc) into the final\n"
+        "       file, then linked (via ld or ld.ldd) into the final\n"
         "       binary.\n"
         "\n"
         "───────────────────────────────────────────────────────────────\n"
@@ -11567,7 +11567,7 @@ def _run_docs_tui(
         "    The CT VM is a stack-based interpreter that runs during\n"
         "    parsing. It maintains:\n"
         "\n"
-        "      - A value stack (Python list of ints/strings/lists)\n"
+        "      - A value stack\n"
         "      - A dictionary of CT-callable words\n"
         "      - A return stack for nested calls\n"
         "\n"
@@ -11579,7 +11579,7 @@ def _run_docs_tui(
         "\n"
         "    When --ct-run-main is used, the CT VM can also JIT-compile\n"
         "    and execute native x86-64 code via the Keystone assembler\n"
-        "    engine (for words that need native performance).\n"
+        "    engine (for words that need near native performance).\n"
         "\n"
         "───────────────────────────────────────────────────────────────\n"
         "\n"
@@ -11641,7 +11641,7 @@ def _run_docs_tui(
         "      just numbers. Type safety is your responsibility.\n"
         "\n"
         "    - Macro expansion depth: macros can expand macros,\n"
-        "      but there's a limit (default 64, configurable via\n"
+        "      but there's a limit (default 256, configurable via\n"
         "      --macro-expansion-limit).\n"
         "\n"
         "    - :py blocks: Python code embedded in :py { ... }\n"

stdlib/arr.sl

@@ -326,3 +326,22 @@ word dyn_arr_sorted
     dyn_arr_clone
     dyn_arr_sort
 end
+
+# arr_contains [*, addr | x] -> [* | bool]
+word arr_contains
+    over @ >r >r 8 + r> r>
+    for
+        2dup swap @ == if 1 nip nip rdrop ret end
+        swap 8 + swap
+    end 0 nip nip
+end
+
+# arr_find [*, addr | x] -> [* | bool]
+word arr_find
+    over @ >r >r 8 + r> r>
+    0 >r
+    for
+        2dup swap @ == if rswap r> nip nip rdrop ret end
+        swap 8 + swap rswap r> 1 + >r rswap
+    end rdrop -1 nip nip
+end

stdlib/core.sl

@@ -18,455 +18,486 @@
 
 #mem [*] -> [* | ptr]
 :asm mem {
-	lea rax, [rel persistent]
+    lea rax, [rel persistent]
-	sub r12, 8
+    sub r12, 8
-	mov [r12], rax
+    mov [r12], rax
 }
 ;
 
 #argc [*] -> [* | n]
 :asm argc {
-	extern sys_argc
+    extern sys_argc
-	mov rax, [rel sys_argc]
+    mov rax, [rel sys_argc]
-	sub r12, 8
+    sub r12, 8
-	mov [r12], rax
+    mov [r12], rax
-	ret
+    ret
 }
 ;
 
 #argv [*] -> [* | ptr]
 :asm argv {
-	extern sys_argv
+    extern sys_argv
-	mov rax, [rel sys_argv]
+    mov rax, [rel sys_argv]
-	sub r12, 8
+    sub r12, 8
-	mov [r12], rax
+    mov [r12], rax
-	ret
+    ret
 }
 ;
 
 #argv@ [* | n] -> [* | ptr]
 :asm argv@ {
-	extern sys_argv
+    extern sys_argv
-	mov rbx, [r12]      ; n
+    mov rbx, [r12]      ; n
-	mov rax, [rel sys_argv]
+    mov rax, [rel sys_argv]
-	mov rax, [rax + rbx*8]
+    mov rax, [rax + rbx*8]
-	mov [r12], rax
+    mov [r12], rax
-	ret
+    ret
 }
 ;
 
 #c@ [* | addr] -> [* | byte]
 :asm c@ {
-	mov rax, [r12]         ; get address from stack
+    mov rax, [r12]         ; get address from stack
-	movzx rax, byte [rax]  ; load byte at address, zero-extend to rax
+    movzx rax, byte [rax]  ; load byte at address, zero-extend to rax
-	mov [r12], rax         ; store result back on stack
+    mov [r12], rax         ; store result back on stack
-	ret
+    ret
 }
 ;
 
 #c! [*, addr | byte] -> [*]
 :asm c! {
-	mov rax, [r12]         ; get byte value (TOS)
+    mov rax, [r12]         ; get byte value (TOS)
-	add r12, 8             ; pop byte
+    add r12, 8             ; pop byte
-	mov rbx, [r12]         ; get address (NOS)
+    mov rbx, [r12]         ; get address (NOS)
-	add r12, 8             ; pop address
+    add r12, 8             ; pop address
-	mov [rbx], al          ; store low byte at address
+    mov [rbx], al          ; store low byte at address
-	ret
+    ret
 }
 ;
 
 #r@ [*] -> [* | x]
 :asm r@ {
-	mov rax, [r13]         ; get value from return stack
+    mov rax, [r13]         ; get value from return stack
-	sub r12, 8             ; make room on data stack
+    sub r12, 8             ; make room on data stack
-	mov [r12], rax         ; push value to data stack
+    mov [r12], rax         ; push value to data stack
-	ret
+    ret
 }
 ;
 
 #dup [* | x] -> [*, x | x]
 :asm dup {
-	mov rax, [r12]         ; get top of stack
+    mov rax, [r12]         ; get top of stack
-	sub r12, 8             ; make room
+    sub r12, 8             ; make room
-	mov [r12], rax         ; duplicate value
+    mov [r12], rax         ; duplicate value
 }
 ;
 
 #drop [* | x] -> [*]
 :asm drop {
-	add r12, 8             ; remove top of stack
+    add r12, 8             ; remove top of stack
 }
 ;
 
 #over [*, x1 | x2] -> [*, x1, x2 | x1]
 :asm over {
-	mov rax, [r12 + 8]     ; get second item
+    mov rax, [r12 + 8]     ; get second item
-	sub r12, 8              ; make room
+    sub r12, 8              ; make room
-	mov [r12], rax          ; push copy
+    mov [r12], rax          ; push copy
 }
 ;
 
 #swap [*, x1 | x2] -> [*, x2 | x1]
 :asm swap {
-	mov rax, [r12]         ; get top
+    mov rax, [r12]         ; get top
-	mov rbx, [r12 + 8]     ; get second
+    mov rbx, [r12 + 8]     ; get second
-	mov [r12], rbx         ; swap
+    mov [r12], rbx         ; swap
-	mov [r12 + 8], rax
+    mov [r12 + 8], rax
 }
 ;
 
 #rot [*, x1, x2 | x3] -> [*, x2, x3 | x1]
 :asm rot {
-	mov rax, [r12]         ; x3 (top)
+    mov rax, [r12]         ; x3 (top)
-	mov rbx, [r12 + 8]     ; x2
+    mov rbx, [r12 + 8]     ; x2
-	mov rcx, [r12 + 16]    ; x1 (bottom)
+    mov rcx, [r12 + 16]    ; x1 (bottom)
-	mov [r12], rcx         ; new top = x1
+    mov [r12], rcx         ; new top = x1
-	mov [r12 + 8], rax     ; new 2nd = x3
+    mov [r12 + 8], rax     ; new 2nd = x3
-	mov [r12 + 16], rbx    ; new 3rd = x2
+    mov [r12 + 16], rbx    ; new 3rd = x2
 }
 ;
 
 #-rot [*, x1, x2 | x3] -> [*, x3, x1 | x2]
 :asm -rot {
-	mov rax, [r12]         ; x3 (top)
+    mov rax, [r12]         ; x3 (top)
-	mov rbx, [r12 + 8]     ; x2
+    mov rbx, [r12 + 8]     ; x2
-	mov rcx, [r12 + 16]    ; x1 (bottom)
+    mov rcx, [r12 + 16]    ; x1 (bottom)
-	mov [r12], rbx         ; new top = x2
+    mov [r12], rbx         ; new top = x2
-	mov [r12 + 8], rcx     ; new 2nd = x1
+    mov [r12 + 8], rcx     ; new 2nd = x1
-	mov [r12 + 16], rax    ; new 3rd = x3
+    mov [r12 + 16], rax    ; new 3rd = x3
 }
 ;
 
 #nip [*, x1 | x2] -> [* | x2]
 :asm nip {
-	mov rax, [r12]         ; get top
+    mov rax, [r12]         ; get top
-	add r12, 8             ; drop lower
+    add r12, 8             ; drop lower
-	mov [r12], rax         ; keep original top
+    mov [r12], rax         ; keep original top
 }
 ;
 
 #tuck [*, x1 | x2] -> [*, x2, x1 | x2]
 :asm tuck {
-	mov rax, [r12]         ; x2 (top)
+    mov rax, [r12]         ; x2 (top)
-	mov rbx, [r12 + 8]     ; x1
+    mov rbx, [r12 + 8]     ; x1
-	sub r12, 8             ; make room
+    sub r12, 8             ; make room
-	mov [r12], rax         ; x2
+    mov [r12], rax         ; x2
-	mov [r12 + 8], rbx     ; x1
+    mov [r12 + 8], rbx     ; x1
-	mov [r12 + 16], rax    ; x2
+    mov [r12 + 16], rax    ; x2
 }
 ;
 
 #2dup [*, x1 | x2] -> [*, x1, x2, x1 | x2]
 :asm 2dup {
-	mov rax, [r12]         ; b (top)
+    mov rax, [r12]         ; b (top)
-	mov rbx, [r12 + 8]     ; a
+    mov rbx, [r12 + 8]     ; a
-	sub r12, 8             ; make room
+    sub r12, 8             ; make room
-	mov [r12], rbx         ; push a
+    mov [r12], rbx         ; push a
-	sub r12, 8             ; make room
+    sub r12, 8             ; make room
-	mov [r12], rax         ; push b
+    mov [r12], rax         ; push b
+}
+;
+
+#3dup [*, x1, x2 | x3] -> [*, x1, x2, x3, x1, x2 | x3]
+:asm 3dup {
+    mov rax, [r12]         ; c (top)
+    mov rbx, [r12 + 8]     ; b
+    mov rcx, [r12 + 16]    ; a
+    sub r12, 8             ; make room
+    mov [r12], rcx         ; push a
+    sub r12, 8             ; make room
+    mov [r12], rbx         ; push b
+    sub r12, 8             ; make room
+    mov [r12], rax         ; push c
+}
+;
+
+#4dup [*, x1, x2, x3 | x4] -> [*, x1, x2, x3, x4, x1, x2, x3 | x4]
+:asm 4dup {
+    mov rax, [r12]         ; d
+    mov rbx, [r12 + 8]     ; c
+    mov rcx, [r12 + 16]    ; b
+    mov rdx, [r12 + 24]    ; a
+    sub r12, 8             ; make room
+    mov [r12], rdx         ; push a
+    sub r12, 8             ; make room
+    mov [r12], rcx         ; push b
+    sub r12, 8             ; make room
+    mov [r12], rbx         ; push c
+    sub r12, 8             ; make room
+    mov [r12], rax         ; push d
 }
 ;
 
 #2drop [*, x1 | x2] -> [*]
 :asm 2drop {
-	add r12, 16            ; remove two items
+    add r12, 16            ; remove two items
 }
 ;
 
 #2swap [*, x1, x2, x3 | x4] -> [*, x3, x4, x1 | x2]
 :asm 2swap {
-	mov rax, [r12]         ; d (top)
+    mov rax, [r12]         ; d (top)
-	mov rbx, [r12 + 8]     ; c
+    mov rbx, [r12 + 8]     ; c
-	mov rcx, [r12 + 16]    ; b
+    mov rcx, [r12 + 16]    ; b
-	mov rdx, [r12 + 24]    ; a (bottom)
+    mov rdx, [r12 + 24]    ; a (bottom)
-	mov [r12], rcx         ; new top = b
+    mov [r12], rcx         ; new top = b
-	mov [r12 + 8], rdx     ; new 2nd = a
+    mov [r12 + 8], rdx     ; new 2nd = a
-	mov [r12 + 16], rax    ; new 3rd = d
+    mov [r12 + 16], rax    ; new 3rd = d
-	mov [r12 + 24], rbx    ; new 4th = c
+    mov [r12 + 24], rbx    ; new 4th = c
 }
 ;
 
 #2over [*, x1, x2, x3 | x4] -> [*, x3, x4, x1, x2, x3 | x4]
 :asm 2over {
-	mov rax, [r12 + 16]    ; b
+    mov rax, [r12 + 16]    ; b
-	mov rbx, [r12 + 24]    ; a
+    mov rbx, [r12 + 24]    ; a
-	sub r12, 8             ; make room
+    sub r12, 8             ; make room
-	mov [r12], rbx         ; push a
+    mov [r12], rbx         ; push a
-	sub r12, 8             ; make room
+    sub r12, 8             ; make room
-	mov [r12], rax         ; push b
+    mov [r12], rax         ; push b
 }
 ;
 
 #+ [*, x1 | x2] -> [* | x3]
 :asm + {
-	mov rax, [r12]         ; get top
+    mov rax, [r12]         ; get top
-	add r12, 8             ; pop
+    add r12, 8             ; pop
-	add qword [r12], rax   ; add to next
+    add qword [r12], rax   ; add to next
 }
 ;
 
 #- [*, x1 | x2] -> [* | x3]
 :asm - {
-	mov rax, [r12]         ; get top
+    mov rax, [r12]         ; get top
-	add r12, 8             ; pop
+    add r12, 8             ; pop
-	sub qword [r12], rax   ; subtract from next
+    sub qword [r12], rax   ; subtract from next
 }
 ;
 
 #* [*, x1 | x2] -> [* | x3]
 :asm * {
-	mov rax, [r12]         ; get top
+    mov rax, [r12]         ; get top
-	add r12, 8             ; pop
+    add r12, 8             ; pop
-	imul qword [r12]       ; multiply
+    imul qword [r12]       ; multiply
-	mov [r12], rax         ; store result
+    mov [r12], rax         ; store result
 }
 ;
 
 #/ [*, x1 | x2] -> [* | x3]
 :asm / {
-	mov rbx, [r12]         ; divisor
+    mov rbx, [r12]         ; divisor
-	add r12, 8             ; pop
+    add r12, 8             ; pop
-	mov rax, [r12]         ; dividend
+    mov rax, [r12]         ; dividend
-	cqo                    ; sign-extend
+    cqo                    ; sign-extend
-	idiv rbx               ; divide
+    idiv rbx               ; divide
-	mov [r12], rax         ; store quotient
+    mov [r12], rax         ; store quotient
 }
 ;
 
 #% [*, x1 | x2] -> [* | x3]
 :asm % {
-	mov rbx, [r12]         ; divisor
+    mov rbx, [r12]         ; divisor
-	add r12, 8             ; pop
+    add r12, 8             ; pop
-	mov rax, [r12]         ; dividend
+    mov rax, [r12]         ; dividend
-	cqo                    ; sign-extend
+    cqo                    ; sign-extend
-	idiv rbx               ; divide
+    idiv rbx               ; divide
-	mov [r12], rdx         ; store remainder
+    mov [r12], rdx         ; store remainder
 }
 ;
 
 #== [*, x1 | x2] -> [* | flag]
 :asm == {
-	mov rax, [r12]         ; get top
+    mov rax, [r12]         ; get top
-	add r12, 8             ; pop
+    add r12, 8             ; pop
-	mov rbx, [r12]         ; get next
+    mov rbx, [r12]         ; get next
-	cmp rbx, rax           ; compare
+    cmp rbx, rax           ; compare
-	mov rbx, 0
+    mov rbx, 0
-	sete bl                ; set if equal
+    sete bl                ; set if equal
-	mov [r12], rbx         ; store flag
+    mov [r12], rbx         ; store flag
 }
 ;
 
 #!= [*, x1 | x2] -> [* | flag]
 :asm != {
-	mov rax, [r12]         ; get top
+    mov rax, [r12]         ; get top
-	add r12, 8             ; pop
+    add r12, 8             ; pop
-	mov rbx, [r12]         ; get next
+    mov rbx, [r12]         ; get next
-	cmp rbx, rax           ; compare
+    cmp rbx, rax           ; compare
-	mov rbx, 0
+    mov rbx, 0
-	setne bl               ; set if not equal
+    setne bl               ; set if not equal
-	mov [r12], rbx         ; store flag
+    mov [r12], rbx         ; store flag
 }
 ;
 
 #< [*, x1 | x2] -> [* | flag]
 :asm < {
-	mov rax, [r12]         ; get top
+    mov rax, [r12]         ; get top
-	add r12, 8             ; pop
+    add r12, 8             ; pop
-	mov rbx, [r12]         ; get next
+    mov rbx, [r12]         ; get next
-	cmp rbx, rax           ; compare
+    cmp rbx, rax           ; compare
-	mov rbx, 0
+    mov rbx, 0
-	setl bl                ; set if less
+    setl bl                ; set if less
-	mov [r12], rbx         ; store flag
+    mov [r12], rbx         ; store flag
 }
 ;
 
 #> [*, x1 | x2] -> [* | flag]
 :asm > {
-	mov rax, [r12]         ; get top
+    mov rax, [r12]         ; get top
-	add r12, 8             ; pop
+    add r12, 8             ; pop
-	mov rbx, [r12]         ; get next
+    mov rbx, [r12]         ; get next
-	cmp rbx, rax           ; compare
+    cmp rbx, rax           ; compare
-	mov rbx, 0
+    mov rbx, 0
-	setg bl                ; set if greater
+    setg bl                ; set if greater
-	mov [r12], rbx         ; store flag
+    mov [r12], rbx         ; store flag
 }
 ;
 
 #<= [*, x1 | x2] -> [* | flag]
 :asm <= {
-	mov rax, [r12]         ; get top
+    mov rax, [r12]         ; get top
-	add r12, 8             ; pop
+    add r12, 8             ; pop
-	mov rbx, [r12]         ; get next
+    mov rbx, [r12]         ; get next
-	cmp rbx, rax           ; compare
+    cmp rbx, rax           ; compare
-	mov rbx, 0
+    mov rbx, 0
-	setle bl               ; set if less or equal
+    setle bl               ; set if less or equal
-	mov [r12], rbx         ; store flag
+    mov [r12], rbx         ; store flag
 }
 ;
 
 #>= [*, x1 | x2] -> [* | flag]
 :asm >= {
-	mov rax, [r12]         ; get top
+    mov rax, [r12]         ; get top
-	add r12, 8             ; pop
+    add r12, 8             ; pop
-	mov rbx, [r12]         ; get next
+    mov rbx, [r12]         ; get next
-	cmp rbx, rax           ; compare
+    cmp rbx, rax           ; compare
-	mov rbx, 0
+    mov rbx, 0
-	setge bl               ; set if greater or equal
+    setge bl               ; set if greater or equal
-	mov [r12], rbx         ; store flag
+    mov [r12], rbx         ; store flag
 }
 ;
 
 #@ [* | addr] -> [* | x]
 :asm @ {
-	mov rax, [r12]         ; get address
+    mov rax, [r12]         ; get address
-	mov rax, [rax]         ; load value
+    mov rax, [rax]         ; load value
-	mov [r12], rax         ; store on stack
+    mov [r12], rax         ; store on stack
 }
 ;
 
 #! [*, addr | x] -> [*]
 :asm ! {
-	mov rax, [r12]         ; get value (TOS)
+    mov rax, [r12]         ; get value (TOS)
-	add r12, 8             ; pop value
+    add r12, 8             ; pop value
-	mov rbx, [r12]         ; get addr (NOS)
+    mov rbx, [r12]         ; get addr (NOS)
-	add r12, 8			   ; pop addr
+    add r12, 8             ; pop addr
-	mov [rbx], rax         ; store value at address
+    mov [rbx], rax         ; store value at address
 }
 ;
 
 #mmap [*, addr, len, prot, flags, fd | offset] -> [* | addr]
 :asm mmap {
-	mov r9, [r12]          ; offset
+    mov r9, [r12]          ; offset
-	add r12, 8
+    add r12, 8
-	mov r8, [r12]          ; fd
+    mov r8, [r12]          ; fd
-	add r12, 8
+    add r12, 8
-	mov r10, [r12]         ; flags
+    mov r10, [r12]         ; flags
-	add r12, 8
+    add r12, 8
-	mov rdx, [r12]         ; prot
+    mov rdx, [r12]         ; prot
-	add r12, 8
+    add r12, 8
-	mov rsi, [r12]         ; len
+    mov rsi, [r12]         ; len
-	add r12, 8
+    add r12, 8
-	mov rdi, [r12]         ; addr
+    mov rdi, [r12]         ; addr
-	mov rax, 9             ; syscall: mmap
+    mov rax, 9             ; syscall: mmap
-	syscall
+    syscall
-	sub r12, 8
+    sub r12, 8
-	mov [r12], rax         ; return addr
+    mov [r12], rax         ; return addr
 }
 ;
 
 #munmap [*, addr | len] -> [* | res]
 :asm munmap {
-	mov rsi, [r12]         ; len
+    mov rsi, [r12]         ; len
-	add r12, 8
+    add r12, 8
-	mov rdi, [r12]         ; addr
+    mov rdi, [r12]         ; addr
-	add r12, 8
+    add r12, 8
-	mov rax, 11            ; syscall: munmap
+    mov rax, 11            ; syscall: munmap
-	syscall
+    syscall
-	sub r12, 8
+    sub r12, 8
-	mov [r12], rax         ; return value
+    mov [r12], rax         ; return value
 }
 ;
 
 #exit [* | code] -> [*]
 :asm exit {
-	mov rdi, [r12]         ; exit code
+    mov rdi, [r12]         ; exit code
-	add r12, 8
+    add r12, 8
-	mov rax, 60            ; syscall: exit
+    mov rax, 60            ; syscall: exit
-	syscall
+    syscall
 }
 ;
 
 #and [*, x1 | x2] -> [* | flag]
 :asm and {
-	mov rax, [r12]         ; get top
+    mov rax, [r12]         ; get top
-	add r12, 8             ; pop
+    add r12, 8             ; pop
-	mov rbx, [r12]         ; get next
+    mov rbx, [r12]         ; get next
-	test rax, rax
+    test rax, rax
-	setz cl
+    setz cl
-	test rbx, rbx
+    test rbx, rbx
-	setz dl
+    setz dl
-	movzx rcx, cl
+    movzx rcx, cl
-	movzx rdx, dl
+    movzx rdx, dl
-	and rcx, rdx           ; logical and
+    and rcx, rdx           ; logical and
-	mov [r12], rcx         ; store flag
+    mov [r12], rcx         ; store flag
 }
 ;
 
 #or [*, x1 | x2] -> [* | flag]
 :asm or {
-	mov rax, [r12]         ; get top
+    mov rax, [r12]         ; get top
-	add r12, 8             ; pop
+    add r12, 8             ; pop
-	mov rbx, [r12]         ; get next
+    mov rbx, [r12]         ; get next
-	test rax, rax
+    test rax, rax
-	setz cl
+    setz cl
-	test rbx, rbx
+    test rbx, rbx
-	setz dl
+    setz dl
-	movzx rcx, cl
+    movzx rcx, cl
-	movzx rdx, dl
+    movzx rdx, dl
-	or rcx, rdx            ; logical or
+    or rcx, rdx            ; logical or
-	mov [r12], rcx         ; store flag
+    mov [r12], rcx         ; store flag
 }
 ;
 
 #not [* | x] -> [* | flag]
 :asm not {
-	mov rax, [r12]         ; get value
+    mov rax, [r12]         ; get value
-	test rax, rax
+    test rax, rax
-	setz al                ; set if zero
+    setz al                ; set if zero
-	movzx rax, al
+    movzx rax, al
-	mov [r12], rax         ; store flag
+    mov [r12], rax         ; store flag
 }
 ;
 
 #>r [* | x] -> [*]
 :asm >r {
-	mov rax, [r12]         ; get value
+    mov rax, [r12]         ; get value
-	add r12, 8             ; pop
+    add r12, 8             ; pop
-	sub r13, 8             ; make room on return stack
+    sub r13, 8             ; make room on return stack
-	mov [r13], rax         ; push to return stack
+    mov [r13], rax         ; push to return stack
 }
 ;
 
 #r> [*] -> [* | x]
 :asm r> {
-	mov rax, [r13]         ; get value from return stack
+    mov rax, [r13]         ; get value from return stack
-	add r13, 8             ; pop return stack
+    add r13, 8             ; pop return stack
-	sub r12, 8             ; make room on data stack
+    sub r12, 8             ; make room on data stack
-	mov [r12], rax         ; push to data stack
+    mov [r12], rax         ; push to data stack
 }
 ;
 
 #rdrop [*] -> [*]
 :asm rdrop {
-	add r13, 8             ; pop return stack
+    add r13, 8             ; pop return stack
 }
 ;
 
 :asm rswap {
-	mov rax, [r13]         ; get top
+    mov rax, [r13]         ; get top
-	mov rbx, [r13 + 8]     ; get second
+    mov rbx, [r13 + 8]     ; get second
-	mov [r13], rbx         ; swap
+    mov [r13], rbx         ; swap
-	mov [r13 + 8], rax
+    mov [r13 + 8], rax
 }
 ;
 
 #pick [* | n] -> [* | x]
 :asm pick {
-	mov rcx, [r12]         ; get index
+    mov rcx, [r12]         ; get index
-	add r12, 8             ; pop
+    add r12, 8             ; pop
-	mov rax, [r12 + rcx * 8] ; get value at index
+    mov rax, [r12 + rcx * 8] ; get value at index
-	sub r12, 8             ; make room
+    sub r12, 8             ; make room
-	mov [r12], rax         ; push value
+    mov [r12], rax         ; push value
 }
 ;
 
 #rpick [* | n] -> [* | x]
 :asm rpick {
-	mov rcx, [r12]         ; get index
+    mov rcx, [r12]         ; get index
-	add r12, 8             ; pop
+    add r12, 8             ; pop
-	mov rax, [r13 + rcx * 8] ; get value from return stack
+    mov rax, [r13 + rcx * 8] ; get value from return stack
-	sub r12, 8             ; make room
+    sub r12, 8             ; make room
-	mov [r12], rax         ; push value
+    mov [r12], rax         ; push value
 }
 ;
 
@@ -480,12 +511,12 @@
 
 #abs [* | x] -> [* | |x|]
 :asm abs {
-	mov rax, [r12]   ; get value
+    mov rax, [r12]   ; get value
-	test rax, rax    ; check sign
+    test rax, rax    ; check sign
-	jge .done        ; keep if non-negative
+    jge .done        ; keep if non-negative
-	neg rax          ; flip sign when negative
+    neg rax          ; flip sign when negative
 .done:
-	mov [r12], rax   ; store result
+    mov [r12], rax   ; store result
 }
 ;
 
@@ -499,162 +530,162 @@
 
 #band [*, x1 | x2] -> [* | x3]
 :asm band {
-	mov rax, [r12]         ; get top
+    mov rax, [r12]         ; get top
-	add r12, 8             ; pop
+    add r12, 8             ; pop
-	and qword [r12], rax   ; bitwise and
+    and qword [r12], rax   ; bitwise and
 }
 ;
 
 #bor [*, x1 | x2] -> [* | x3]
 :asm bor {
-	mov rax, [r12]         ; get top
+    mov rax, [r12]         ; get top
-	add r12, 8             ; pop
+    add r12, 8             ; pop
-	or qword [r12], rax    ; bitwise or
+    or qword [r12], rax    ; bitwise or
 }
 ;
 
 #bxor [*, x1 | x2] -> [* | x3]
 :asm bxor {
-	mov rax, [r12]         ; get top
+    mov rax, [r12]         ; get top
-	add r12, 8             ; pop
+    add r12, 8             ; pop
-	xor qword [r12], rax   ; bitwise xor
+    xor qword [r12], rax   ; bitwise xor
 }
 ;
 
 #bnot [* | x] -> [* | x]
 :asm bnot {
-	not qword [r12]        ; bitwise not
+    not qword [r12]        ; bitwise not
 }
 ;
 
 #shl [*, x1 | x2] -> [* | x3]
 :asm shl {
-	mov rcx, [r12]         ; shift count
+    mov rcx, [r12]         ; shift count
-	add r12, 8             ; pop
+    add r12, 8             ; pop
-	shl qword [r12], cl    ; logical left shift
+    shl qword [r12], cl    ; logical left shift
 }
 ;
 
 #sal [*, x1 | x2] -> [* | x3]
 :asm sal {
-	mov rcx, [r12]         ; shift count
+    mov rcx, [r12]         ; shift count
-	add r12, 8             ; pop
+    add r12, 8             ; pop
-	sal qword [r12], cl    ; arithmetic left shift (same as shl)
+    sal qword [r12], cl    ; arithmetic left shift (same as shl)
 }
 ;
 
 #shr [*, x1 | x2] -> [* | x3]
 :asm shr {
-	mov rcx, [r12]         ; shift count
+    mov rcx, [r12]         ; shift count
-	add r12, 8             ; pop
+    add r12, 8             ; pop
-	shr qword [r12], cl    ; logical right shift
+    shr qword [r12], cl    ; logical right shift
 }
 ;
 
 #sar [*, x1 | x2] -> [* | x3]
 :asm sar {
-	mov rcx, [r12]         ; shift count
+    mov rcx, [r12]         ; shift count
-	add r12, 8             ; pop
+    add r12, 8             ; pop
-	sar qword [r12], cl    ; arithmetic right shift
+    sar qword [r12], cl    ; arithmetic right shift
 }
 ;
 
 #rol [*, x1 | x2] -> [* | x3]
 :asm rol {
-	mov rcx, [r12]         ; shift count
+    mov rcx, [r12]         ; shift count
-	add r12, 8             ; pop
+    add r12, 8             ; pop
-	rol qword [r12], cl    ; rotate left
+    rol qword [r12], cl    ; rotate left
 }
 ;
 
 #ror [*, x1 | x2] -> [* | x3]
 :asm ror {
-	mov rcx, [r12]         ; shift count
+    mov rcx, [r12]         ; shift count
-	add r12, 8             ; pop
+    add r12, 8             ; pop
-	ror qword [r12], cl    ; rotate right
+    ror qword [r12], cl    ; rotate right
 }
 ;
 
 #inc [* | x] -> [* | x+1]
 :asm inc {
-	inc qword [r12]
+    inc qword [r12]
 }
 ;
 
 #dec [* | x] -> [* | x-1]
 :asm dec {
-	dec qword [r12]
+    dec qword [r12]
 }
 ;
 
 #min [*, x1 | x2] -> [* | x3]
 :asm min {
-	mov rax, [r12]         ; x2
+    mov rax, [r12]         ; x2
-	add r12, 8             ; pop
+    add r12, 8             ; pop
-	mov rbx, [r12]         ; x1
+    mov rbx, [r12]         ; x1
-	cmp rbx, rax
+    cmp rbx, rax
-	cmovg rbx, rax         ; if x1 > x2, pick x2
+    cmovg rbx, rax         ; if x1 > x2, pick x2
-	mov [r12], rbx
+    mov [r12], rbx
 }
 ;
 
 #max [*, x1 | x2] -> [* | x3]
 :asm max {
-	mov rax, [r12]         ; x2
+    mov rax, [r12]         ; x2
-	add r12, 8             ; pop
+    add r12, 8             ; pop
-	mov rbx, [r12]         ; x1
+    mov rbx, [r12]         ; x1
-	cmp rbx, rax
+    cmp rbx, rax
-	cmovl rbx, rax         ; if x1 < x2, pick x2
+    cmovl rbx, rax         ; if x1 < x2, pick x2
-	mov [r12], rbx
+    mov [r12], rbx
 }
 ;
 
 #clamp [*, x, lo | hi] -> [* | y]
 :asm clamp {
-	mov rax, [r12]         ; hi
+    mov rax, [r12]         ; hi
-	mov rbx, [r12 + 8]     ; lo
+    mov rbx, [r12 + 8]     ; lo
-	mov rcx, [r12 + 16]    ; x
+    mov rcx, [r12 + 16]    ; x
-	cmp rcx, rbx
+    cmp rcx, rbx
-	cmovl rcx, rbx         ; if x < lo -> lo
+    cmovl rcx, rbx         ; if x < lo -> lo
-	cmp rcx, rax
+    cmp rcx, rax
-	cmovg rcx, rax         ; if x > hi -> hi
+    cmovg rcx, rax         ; if x > hi -> hi
-	mov [r12 + 16], rcx
+    mov [r12 + 16], rcx
-	add r12, 16            ; drop lo, hi
+    add r12, 16            ; drop lo, hi
 }
 ;
 
 #time [*] -> [* | t]
 :asm time {
-	mov rax, 201           ; syscall: time
+    mov rax, 201           ; syscall: time
-	xor rdi, rdi
+    xor rdi, rdi
-	syscall
+    syscall
-	sub r12, 8
+    sub r12, 8
-	mov [r12], rax
+    mov [r12], rax
-	ret
+    ret
 }
 ;
 
 #rand [*] -> [* | n]
 :asm rand {
-	lea rbx, [rel persistent]
+    lea rbx, [rel persistent]
-	mov rax, [rbx]         ; state
+    mov rax, [rbx]         ; state
-	test rax, rax
+    test rax, rax
-	jne .seeded
+    jne .seeded
-	; seed with time()
+    ; seed with time()
-	mov rax, 201           ; syscall: time
+    mov rax, 201           ; syscall: time
-	xor rdi, rdi
+    xor rdi, rdi
-	syscall
+    syscall
-	mov [rbx], rax
+    mov [rbx], rax
 .seeded:
-	mov rax, [rbx]
+    mov rax, [rbx]
-	mov rcx, 1103515245
+    mov rcx, 1103515245
-	imul rax, rcx
+    imul rax, rcx
-	add rax, 12345
+    add rax, 12345
-	mov [rbx], rax
+    mov [rbx], rax
-	shr rax, 16
+    shr rax, 16
-	and rax, 0x7fff
+    and rax, 0x7fff
-	sub r12, 8
+    sub r12, 8
-	mov [r12], rax
+    mov [r12], rax
-	ret
+    ret
 }
 ;

stdlib/termios.sl

@@ -0,0 +1,36 @@
+import stdlib.sl
+
+macro TCGETS 0 0x5401 ;
+macro ENOTTY 0 25 ;
+macro EBADF 0 9 ;
+
+# isatty [* | fd] -> [* | flag]
+word isatty
+    >r                           # save fd
+
+    60 alloc                     # push addr
+    r@ TCGETS over 3 16 syscall  # addr result
+
+    # Duplicate result and save it
+    dup >r                       # push result to return stack
+
+    # Free buffer
+    60 swap free                 # free(addr, size)
+
+    # Restore result
+    r>                           # result back to data stack
+
+    # Check result
+    dup ENOTTY neg == if                # -ENOTTY (not a tty)
+        drop 0
+    else
+        dup EBADF neg == if             # -EBADF (bad fd)
+            drop -1
+        else
+            # Any other value means it's a tty
+            drop 1
+        end
+    end
+
+    rdrop
+end

stdlib/utils.sl

@@ -408,7 +408,7 @@ end
 
 # convert a string to a sequence of ascii codes of its characters and push the codes on to the stack, 
 # Warning! the sequence is reversed so the ascii code of the last character ends up first on the stack
-# toascii [*, addr | LEN] -> [*, x, x1 ... xLEN - 1 | xLEN + 1]
+# toascii [*, addr | LEN] -> [*, x, x1 ... xLEN - 1 | xLEN]
 word toascii
     0 swap
     for
@@ -491,3 +491,66 @@ word splitby_char
     r>
     rm_zero_len_str
 end
+
+# ltrim [*, addr | len] -> [*, addr, | len]
+word ltrim
+    dup for
+        over c@ 32 == if
+            swap 1 + swap 1 -
+        end
+    end
+end
+
+# rtrim [*, addr | len] -> [*, addr, | len]
+word rtrim
+    swap tuck swap
+    swap over + 1 - swap
+    dup for
+        over c@ 32 == if
+            swap 1 - swap 1 -
+        end
+    end nip
+end
+
+# trim [*, addr | len] -> [*, addr | len]
+word trim
+    ltrim rtrim
+end
+
+# startswith [*, addr, len, addr | len] -> [*, bool]
+inline word startswith
+    strcmp
+end
+
+# endswith [*, addr, len, addr | len] -> [*, bool]
+word endswith
+    dup 3 pick swap - 4 pick + over 2 pick 4 pick swap strcmp
+    nip nip nip nip
+end
+
+# contains [*, addr, len, addr | len] -> [* | bool]
+word contains
+    2 pick for
+        4dup strcmp 1 == if 1 nip nip nip nip rdrop ret end
+        >r >r >r 1 + r> r> r>
+    end 0 nip nip nip nip
+end
+
+# find the first occurence of a string inside another string, returns the index
+# find [*, addr, len, addr | len] -> [* | index]
+word find
+    0 >r 2 pick for
+        4dup strcmp 1 == if rswap r> nip nip nip nip rdrop ret end
+        >r >r >r 1 + r> r> r> rswap r> 1 + >r rswap
+    end -1 nip nip nip nip
+end
+
+# find the last occurence of a string inside another string, returns the index
+# rfind [*, addr, len, addr | len] -> [* | index]
+word rfind
+    >r >r dup >r + 1 - r> r> r>
+    2 pick 1 - >r 2 pick for
+        4dup strcmp 1 == if rswap r> nip nip nip nip rdrop ret end
+        >r >r >r 1 - r> r> r> rswap r> 1 - >r rswap
+    end -1 nip nip nip nip
+end

test.py

@@ -28,6 +28,7 @@ DEFAULT_EXTRA_TESTS = [
     "extra_tests/c_extern_structs.sl",
     "extra_tests/fn_test.sl",
     "extra_tests/nob_test.sl",
+    "extra_tests/termios_test.sl",
 ]
 
 COLORS = {

tests/str.expected

@@ -11,3 +11,6 @@ o wor
 d he
 o wor
 he
+|f    |
+|    f|
+|f|

tests/str.sl

@@ -21,4 +21,9 @@ word main
     for puts end
     "hello world hello world hello" "l" splitby
     for puts end
+
+    "    f    " 2dup 2dup
+    124 putc ltrim write_buf 124 putc cr
+    124 putc rtrim write_buf 124 putc cr
+    124 putc trim  write_buf 124 putc cr
 end