tatara-lisp-eval 0.3.44

Runtime evaluator for tatara-lisp — embeddable Scheme-ish eval scoped to orchestration (job queues, rules, REPL). See docs/eval-design.md.
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
//! Module system — file-as-module + qualified names + alias imports.
//!
//! Design rationale (researched, see commit history): file = module.
//! No explicit `(namespace foo)` declaration; the file's path IS the
//! module's identifier. Exports are explicit via `(provide ...)`;
//! imports through `(require "path" :as alias)` or `(require "path"
//! :refer (a b c))`. Qualified names like `foo/bar` resolve via the
//! loaded module table at eval time.
//!
//! Loader injection: the eval crate is filesystem-free. Embedders pass
//! a `Loader` trait object that resolves a module path string into
//! source. `tatara-script` provides a `FilesystemLoader`; tests use an
//! in-memory `MapLoader`.
//!
//! Cycle detection: each `require` push the path onto a load stack;
//! re-entering the same path raises `EvalError::User`. This is the
//! simplest sound approach — no need for two-phase resolution.

use std::collections::{HashMap, HashSet};
use std::sync::{Arc, Mutex};

use thiserror::Error;

use crate::value::Value;

/// One module's contribution to the global symbol table:
/// every binding it defines, plus the subset that's been
/// `(provide)`-d as exported.
#[derive(Debug, Clone, Default)]
pub struct Module {
    pub path: Arc<str>,
    pub exports: HashSet<Arc<str>>,
    pub bindings: HashMap<Arc<str>, Value>,
}

impl Module {
    pub fn new(path: impl Into<Arc<str>>) -> Self {
        Self {
            path: path.into(),
            exports: HashSet::new(),
            bindings: HashMap::new(),
        }
    }

    /// Look up an exported binding. `None` if the name isn't defined
    /// or isn't in the export set.
    pub fn get_export(&self, name: &str) -> Option<Value> {
        if self.exports.contains(name) {
            self.bindings.get(name).cloned()
        } else {
            None
        }
    }

    /// Add to the export set. Idempotent.
    pub fn add_export(&mut self, name: impl Into<Arc<str>>) {
        self.exports.insert(name.into());
    }

    /// Bind a value (either from a `define` while loading or from
    /// embedder pre-population).
    pub fn define(&mut self, name: impl Into<Arc<str>>, value: Value) {
        self.bindings.insert(name.into(), value);
    }
}

/// Source-loading hook. Resolves a `module path` (the string the user
/// wrote in `(require "path")`) into its source text. Embedders own
/// the path semantics — relative-to-cwd, relative-to-caller, search
/// path with `$TATARA_PATH`, in-memory map for tests, etc.
pub trait Loader: Send + Sync {
    fn load(&self, path: &str) -> Result<String, ModuleError>;
}

/// In-memory loader — useful for tests and bundled-stdlib loading.
/// Path strings map directly to source strings; missing path → error.
#[derive(Default, Debug, Clone)]
pub struct MapLoader {
    pub modules: HashMap<String, String>,
}

impl MapLoader {
    pub fn new() -> Self {
        Self::default()
    }

    pub fn insert(&mut self, path: impl Into<String>, source: impl Into<String>) -> &mut Self {
        self.modules.insert(path.into(), source.into());
        self
    }
}

impl Loader for MapLoader {
    fn load(&self, path: &str) -> Result<String, ModuleError> {
        self.modules
            .get(path)
            .cloned()
            .ok_or_else(|| ModuleError::NotFound(path.to_string()))
    }
}

/// Default no-op loader for embedders that haven't wired one up yet.
/// Returns `NotFound` for every path; modules calling `(require ...)`
/// will surface that error to the user.
#[derive(Debug, Default, Clone)]
pub struct NoLoader;

impl Loader for NoLoader {
    fn load(&self, path: &str) -> Result<String, ModuleError> {
        Err(ModuleError::NotFound(path.to_string()))
    }
}

/// Capability-**denying** loader: refuses every resolution and says so.
///
/// # Why this is not `NoLoader`
///
/// `NoLoader` also resolves nothing, but it is a *default*, not a *gate*, and
/// the difference shows up in three places:
///
/// 1. **The error lies.** `NoLoader` reports `NotFound`, so a denied
///    `(require "lib/auth")` is indistinguishable from a typo'd path. An
///    operator reading `module not found: lib/auth` goes looking for the file.
///    A denial has to name itself, or the gate is invisible in its own
///    diagnostics.
/// 2. **It carries no reason.** A `DenyingLoader` is constructed with the
///    context that installed it, so the message says *which* gate refused and
///    *why* — the thing a caller needs to decide whether to re-run outside the
///    gate or fix the program.
/// 3. **It is what you get by accident.** `NoLoader` is what an embedder that
///    never thought about I/O ends up with. Selecting `DenyingLoader` is a
///    statement that I/O was considered and refused.
///
/// # What it does and does not bound
///
/// It bounds exactly one capability: **module source resolution**. That is the
/// whole of `tatara-lisp-eval`'s own reach outside its process — audited
/// 2026-08-05, the crate's only `std::fs` / `std::env` / `std::process` call
/// outside `#[cfg(test)]` is `FilesystemLoader::load`, and it is behind this
/// trait. Two residues stay open inside the crate and are not I/O:
/// `primitive.rs`'s `print` / `println` / `display` write to stdout, and
/// `install_lisp_stdlib_with` **panics** (rather than returning) if the
/// embedded stdlib fails to parse or evaluate.
///
/// It does **not** bound native functions an embedder registered on the
/// interpreter. `tatara-lisp-script` installs 56 of them across `fs` (19),
/// `kube` (7), `process` (6), `io` (6), `env` (5), `os` (5), `http` (3),
/// `dns` (3), `http_server` (1) and `sops` (1) — files, environment, sockets
/// and subprocesses, none of which consults a `Loader`. **A build-time entry
/// point that wants a total denial must select this loader *and* decline to
/// install those primitives**; selecting the loader alone is a partial gate,
/// and calling it total would be a false claim.
///
/// # Ordering, because `fork` inherits the loader
///
/// `Interpreter::fork` clones the parent's `Arc<dyn Loader>`. Forking a
/// filesystem-enabled interpreter therefore yields a filesystem-enabled child.
/// Call `set_loader` on the child **after** forking, never before.
///
/// ```
/// use std::sync::Arc;
/// use tatara_lisp_eval::{DenyingLoader, Interpreter};
///
/// let mut interp: Interpreter<()> = Interpreter::new();
/// interp.set_loader(Arc::new(DenyingLoader::new(
///     "build-time macro expansion must not read the filesystem",
/// )));
/// ```
#[derive(Debug, Clone)]
pub struct DenyingLoader {
    reason: Arc<str>,
}

impl DenyingLoader {
    /// Reason used by [`DenyingLoader::default`]. Deliberately generic: a
    /// caller that knows its own context should pass it to
    /// [`DenyingLoader::new`] instead, so the denial names the gate.
    pub const DEFAULT_REASON: &'static str =
        "the embedder installed a capability-denying loader; no module source is reachable \
         from this evaluation";

    /// Build a denier whose refusals cite `reason`. Write the reason from the
    /// operator's point of view — it is the whole diagnostic they get.
    #[must_use]
    pub fn new(reason: impl Into<Arc<str>>) -> Self {
        Self {
            reason: reason.into(),
        }
    }

    /// The reason every refusal cites.
    #[must_use]
    pub fn reason(&self) -> &str {
        &self.reason
    }
}

impl Default for DenyingLoader {
    fn default() -> Self {
        Self::new(Self::DEFAULT_REASON)
    }
}

impl Loader for DenyingLoader {
    fn load(&self, path: &str) -> Result<String, ModuleError> {
        Err(ModuleError::Denied {
            path: path.to_string(),
            reason: self.reason.to_string(),
        })
    }
}

/// Filesystem-backed loader. Reads a module path string by walking a
/// base directory (or filesystem-absolute paths). Path-resolution rules
/// match the documented design:
///
/// 1. `path` ending in `.tlisp` or `.lisp` is read as-is.
/// 2. `path` without an extension tries `<path>.tlisp`, then
///    `<path>.lisp`, then `<path>/init.tlisp`, then `<path>/init.lisp`.
/// 3. Relative paths resolve against `base_dir`. Absolute paths are
///    passed through. The optional `extra_search_paths` list (e.g.
///    a `$TATARA_PATH`-equivalent) is consulted in order if the
///    primary lookup fails.
///
/// The loader is `Send + Sync` so it can live behind the `Arc<dyn Loader>`
/// the Interpreter expects.
#[derive(Debug, Clone)]
pub struct FilesystemLoader {
    pub base_dir: std::path::PathBuf,
    pub extra_search_paths: Vec<std::path::PathBuf>,
}

impl FilesystemLoader {
    pub fn new(base_dir: impl Into<std::path::PathBuf>) -> Self {
        Self {
            base_dir: base_dir.into(),
            extra_search_paths: Vec::new(),
        }
    }

    pub fn with_search_paths(
        mut self,
        paths: impl IntoIterator<Item = std::path::PathBuf>,
    ) -> Self {
        self.extra_search_paths.extend(paths);
        self
    }

    fn candidates(&self, path: &str) -> Vec<std::path::PathBuf> {
        let p = std::path::Path::new(path);
        let has_ext = p
            .extension()
            .is_some_and(|e| matches!(e.to_str(), Some("tlisp" | "lisp")));
        let mut bases: Vec<std::path::PathBuf> = Vec::new();
        if p.is_absolute() {
            bases.push(p.to_path_buf());
        } else {
            bases.push(self.base_dir.join(p));
            for extra in &self.extra_search_paths {
                bases.push(extra.join(p));
            }
        }
        let mut out = Vec::with_capacity(bases.len() * 4);
        for base in bases {
            if has_ext {
                out.push(base);
            } else {
                out.push(base.with_extension("tlisp"));
                out.push(base.with_extension("lisp"));
                out.push(base.join("init.tlisp"));
                out.push(base.join("init.lisp"));
            }
        }
        out
    }
}

impl Loader for FilesystemLoader {
    fn load(&self, path: &str) -> Result<String, ModuleError> {
        for candidate in self.candidates(path) {
            if let Ok(s) = std::fs::read_to_string(&candidate) {
                return Ok(s);
            }
        }
        Err(ModuleError::NotFound(path.to_string()))
    }
}

/// Errors specific to the module pipeline. Embedders convert these
/// to user-facing `EvalError::User { value: Value::Error(...) }`.
#[derive(Debug, Error, Clone)]
pub enum ModuleError {
    #[error("module not found: {0}")]
    NotFound(String),
    #[error("circular require: {path} (load stack: {stack})")]
    Circular { path: String, stack: String },
    #[error("name not exported: {1} from module {0}")]
    NotExported(String, String),
    /// A loader **refused** to resolve `path` as a matter of policy — the
    /// source may well exist. Distinct from [`ModuleError::NotFound`] on
    /// purpose: rounding a denial down to "not found" sends the reader
    /// hunting for a missing file instead of showing them the gate.
    #[error("module load denied: {path} — {reason}")]
    Denied { path: String, reason: String },
}

/// Process-global module registry. Holds every module that's been
/// loaded so far, keyed by path. Two `(require "lib/auth")` calls
/// from different sites share one Module instance — the file is
/// loaded + evaluated exactly once.
#[derive(Debug, Default, Clone)]
pub struct ModuleRegistry {
    inner: Arc<Mutex<RegistryInner>>,
}

#[derive(Debug, Default)]
pub(crate) struct RegistryInner {
    pub(crate) modules: HashMap<Arc<str>, Module>,
    /// Currently-loading paths (for cycle detection).
    pub(crate) loading: Vec<String>,
    /// Exports declared via `(provide ...)` inside a still-loading
    /// module. Drained on `finish_load` and merged into the Module.
    /// Keyed by module path; value is the set of names provided.
    pub(crate) exports_staging: HashMap<String, HashSet<Arc<str>>>,
}

impl ModuleRegistry {
    pub fn new() -> Self {
        Self::default()
    }

    /// Has this path already been fully loaded?
    pub fn has(&self, path: &str) -> bool {
        let g = self.inner.lock().unwrap();
        g.modules.contains_key(path)
    }

    /// Snapshot a loaded module. Returns `None` if not yet loaded.
    pub fn get(&self, path: &str) -> Option<Module> {
        let g = self.inner.lock().unwrap();
        g.modules.get(path).cloned()
    }

    /// Begin loading `path`. Pushes onto the load stack and returns
    /// `Err(Circular)` if the path is already on the stack.
    pub fn begin_load(&self, path: &str) -> Result<(), ModuleError> {
        let mut g = self.inner.lock().unwrap();
        if g.loading.iter().any(|p| p == path) {
            return Err(ModuleError::Circular {
                path: path.to_string(),
                stack: g.loading.join(""),
            });
        }
        g.loading.push(path.to_string());
        Ok(())
    }

    /// Finish loading `path` — remove from load stack, store final
    /// module bindings.
    pub fn finish_load(&self, module: Module) {
        let mut g = self.inner.lock().unwrap();
        g.loading.retain(|p| **p != *module.path);
        g.modules.insert(module.path.clone(), module);
    }

    /// Abort a load (e.g., after an error during eval). Drops the
    /// path from the load stack so retries can succeed.
    pub fn abort_load(&self, path: &str) {
        let mut g = self.inner.lock().unwrap();
        g.loading.retain(|p| p != path);
    }

    /// Number of fully-loaded modules. Useful for tests + tooling.
    pub fn len(&self) -> usize {
        self.inner.lock().unwrap().modules.len()
    }

    pub fn is_empty(&self) -> bool {
        self.len() == 0
    }

    /// Internal access to the lock — used by the eval loop to stage
    /// exports during a module load.
    pub(crate) fn inner_lock(&self) -> std::sync::MutexGuard<'_, RegistryInner> {
        self.inner.lock().unwrap()
    }
}

/// Split a qualified name `foo/bar` into `(module-alias, member)`.
/// Returns `None` if there's no `/` separator (caller treats as a
/// plain unqualified name).
///
/// Multi-segment aliases like `lib/auth/validate-token` resolve to
/// alias = `lib/auth` and member = `validate-token` — i.e., the LAST
/// `/` is the separator. This matches Clojure semantics where
/// `lib.auth/validate-token` (using `.` for the alias and `/` for
/// the boundary) splits at the FINAL `/`.
pub fn split_qualified(name: &str) -> Option<(&str, &str)> {
    let idx = name.rfind('/')?;
    // A bare leading `/` (e.g. `/foo`) or trailing `/` (e.g. `foo/`)
    // isn't a qualified name.
    if idx == 0 || idx == name.len() - 1 {
        return None;
    }
    Some((&name[..idx], &name[idx + 1..]))
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn split_qualified_works() {
        assert_eq!(split_qualified("foo/bar"), Some(("foo", "bar")));
        assert_eq!(
            split_qualified("lib/auth/validate"),
            Some(("lib/auth", "validate"))
        );
        assert_eq!(split_qualified("plain"), None);
        assert_eq!(split_qualified("/leading"), None);
        assert_eq!(split_qualified("trailing/"), None);
    }

    #[test]
    fn map_loader_round_trips() {
        let mut l = MapLoader::new();
        l.insert("lib/auth", "(define x 42)");
        assert_eq!(l.load("lib/auth").unwrap(), "(define x 42)");
        assert!(matches!(l.load("missing"), Err(ModuleError::NotFound(_))));
    }

    #[test]
    fn denying_loader_refuses_every_path_with_its_reason() {
        let l = DenyingLoader::new("typecheck runs with no filesystem");
        // Absolute, relative, extensioned, empty — the denier has no
        // resolution rules to route around, which is the point.
        for path in ["lib/auth", "/etc/passwd", "./x.tlisp", ""] {
            match l.load(path) {
                Err(ModuleError::Denied { path: p, reason }) => {
                    assert_eq!(p, path, "the refusal names what was denied");
                    assert_eq!(reason, "typecheck runs with no filesystem");
                }
                other => panic!("expected a denial for {path:?}, got {other:?}"),
            }
        }
    }

    #[test]
    fn the_default_denier_still_carries_a_reason() {
        // A `Default` that denied with an empty reason would produce
        // "module load denied: x — " and teach the reader nothing.
        let l = DenyingLoader::default();
        assert_eq!(l.reason(), DenyingLoader::DEFAULT_REASON);
        assert!(!DenyingLoader::DEFAULT_REASON.is_empty());
        let rendered = l.load("anything").unwrap_err().to_string();
        assert!(rendered.contains("denied"), "got {rendered:?}");
        assert!(
            rendered.contains(DenyingLoader::DEFAULT_REASON),
            "got {rendered:?}"
        );
    }

    #[test]
    fn registry_cycle_detection() {
        let r = ModuleRegistry::new();
        r.begin_load("a").unwrap();
        r.begin_load("b").unwrap();
        let err = r.begin_load("a").unwrap_err();
        assert!(matches!(err, ModuleError::Circular { .. }));
    }

    #[test]
    fn registry_finish_load_makes_module_visible() {
        let r = ModuleRegistry::new();
        r.begin_load("foo").unwrap();
        let mut m = Module::new("foo");
        m.define("x", Value::Int(42));
        m.add_export("x");
        r.finish_load(m);
        assert!(r.has("foo"));
        let exported = r.get("foo").unwrap().get_export("x");
        assert!(matches!(exported, Some(Value::Int(42))));
    }

    #[test]
    fn registry_finish_load_removes_from_loading() {
        let r = ModuleRegistry::new();
        r.begin_load("foo").unwrap();
        r.finish_load(Module::new("foo"));
        // Re-loading the same path should now succeed (not cyclic).
        r.begin_load("foo").unwrap();
        r.abort_load("foo");
    }

    #[test]
    fn filesystem_loader_resolves_with_extensions() {
        use std::io::Write;
        let dir = tempfile_dir();
        // Drop a "lib/util.tlisp" file.
        let lib = dir.join("lib");
        std::fs::create_dir_all(&lib).unwrap();
        let mut f = std::fs::File::create(lib.join("util.tlisp")).unwrap();
        writeln!(f, "(define x 42)").unwrap();

        let loader = FilesystemLoader::new(&dir);
        // Bare name → tries `<base>/lib/util.tlisp`.
        let src = loader.load("lib/util").unwrap();
        assert!(src.contains("define x 42"));

        // Explicit extension also works.
        let src2 = loader.load("lib/util.tlisp").unwrap();
        assert_eq!(src, src2);

        // Missing path errors clearly.
        assert!(matches!(
            loader.load("missing/whatever"),
            Err(ModuleError::NotFound(_))
        ));

        let _ = std::fs::remove_dir_all(&dir);
    }

    fn tempfile_dir() -> std::path::PathBuf {
        use std::time::{SystemTime, UNIX_EPOCH};
        let nanos = SystemTime::now()
            .duration_since(UNIX_EPOCH)
            .unwrap()
            .as_nanos();
        let mut tmp = std::env::temp_dir();
        tmp.push(format!("tatara-loader-test-{nanos}"));
        std::fs::create_dir_all(&tmp).unwrap();
        tmp
    }

    #[test]
    fn module_get_export_respects_export_set() {
        let mut m = Module::new("test");
        m.define("public", Value::Int(1));
        m.define("private", Value::Int(2));
        m.add_export("public");
        assert!(matches!(m.get_export("public"), Some(Value::Int(1))));
        // private is bound but not exported.
        assert!(matches!(m.get_export("private"), None));
    }
}