1use anyhow::Result;
2use arcstr::ArcStr;
3use enumflags2::{bitflags, BitFlags};
4use fxhash::FxHashMap;
5use graphix_compiler::{
6 expr::ModuleResolver, typ::FnType, Apply, BuiltIn, BuiltInInitFn, Ctx, Event,
7 ExecCtx, Node, UserEvent,
8};
9use netidx::{path::Path, subscriber::Value};
10use netidx_core::utils::Either;
11use std::{
12 fmt::Debug,
13 iter,
14 sync::{Arc, LazyLock},
15};
16
17mod array;
18mod core;
19mod net;
20mod rand;
21mod re;
22mod str;
23#[cfg(test)]
24mod test;
25mod time;
26
27#[macro_export]
28macro_rules! deftype {
29 ($scope:literal, $s:literal) => {
30 const TYP: ::std::sync::LazyLock<graphix_compiler::typ::FnType> =
31 ::std::sync::LazyLock::new(|| {
32 let scope =
33 graphix_compiler::expr::ModPath(::netidx::path::Path::from($scope));
34 graphix_compiler::expr::parser::parse_fn_type($s)
35 .expect("failed to parse fn type {s}")
36 .scope_refs(&scope)
37 });
38 };
39}
40
41#[macro_export]
42macro_rules! arity1 {
43 ($from:expr, $updates:expr) => {
44 match (&*$from, &*$updates) {
45 ([arg], [arg_up]) => (arg, arg_up),
46 (_, _) => unreachable!(),
47 }
48 };
49}
50
51#[macro_export]
52macro_rules! arity2 {
53 ($from:expr, $updates:expr) => {
54 match (&*$from, &*$updates) {
55 ([arg0, arg1], [arg0_up, arg1_up]) => ((arg0, arg1), (arg0_up, arg1_up)),
56 (_, _) => unreachable!(),
57 }
58 };
59}
60
61#[derive(Debug)]
62pub struct CachedVals(pub Box<[Option<Value>]>);
63
64impl CachedVals {
65 pub fn new<C: Ctx, E: UserEvent>(from: &[Node<C, E>]) -> CachedVals {
66 CachedVals(from.into_iter().map(|_| None).collect())
67 }
68
69 pub fn clear(&mut self) {
70 for v in &mut self.0 {
71 *v = None
72 }
73 }
74
75 pub fn update<C: Ctx, E: UserEvent>(
76 &mut self,
77 ctx: &mut ExecCtx<C, E>,
78 from: &mut [Node<C, E>],
79 event: &mut Event<E>,
80 ) -> bool {
81 from.into_iter().enumerate().fold(false, |res, (i, src)| {
82 match src.update(ctx, event) {
83 None => res,
84 v @ Some(_) => {
85 self.0[i] = v;
86 true
87 }
88 }
89 })
90 }
91
92 pub fn update_diff<C: Ctx, E: UserEvent>(
95 &mut self,
96 up: &mut [bool],
97 ctx: &mut ExecCtx<C, E>,
98 from: &mut [Node<C, E>],
99 event: &mut Event<E>,
100 ) {
101 for (i, n) in from.iter_mut().enumerate() {
102 match n.update(ctx, event) {
103 None => (),
104 v => {
105 self.0[i] = v;
106 up[i] = true
107 }
108 }
109 }
110 }
111
112 pub fn flat_iter<'a>(&'a self) -> impl Iterator<Item = Option<Value>> + 'a {
113 self.0.iter().flat_map(|v| match v {
114 None => Either::Left(iter::once(None)),
115 Some(v) => Either::Right(v.clone().flatten().map(Some)),
116 })
117 }
118}
119
120pub trait EvalCached: Debug + Default + Send + Sync + 'static {
121 const NAME: &str;
122 const TYP: LazyLock<FnType>;
123
124 fn eval(&mut self, from: &CachedVals) -> Option<Value>;
125}
126
127#[derive(Debug)]
128pub struct CachedArgs<T: EvalCached> {
129 cached: CachedVals,
130 t: T,
131}
132
133impl<C: Ctx, E: UserEvent, T: EvalCached> BuiltIn<C, E> for CachedArgs<T> {
134 const NAME: &str = T::NAME;
135 const TYP: LazyLock<FnType> = T::TYP;
136
137 fn init(_: &mut ExecCtx<C, E>) -> BuiltInInitFn<C, E> {
138 Arc::new(|_, _, _, from, _| {
139 let t = CachedArgs::<T> { cached: CachedVals::new(from), t: T::default() };
140 Ok(Box::new(t))
141 })
142 }
143}
144
145impl<C: Ctx, E: UserEvent, T: EvalCached> Apply<C, E> for CachedArgs<T> {
146 fn update(
147 &mut self,
148 ctx: &mut ExecCtx<C, E>,
149 from: &mut [Node<C, E>],
150 event: &mut Event<E>,
151 ) -> Option<Value> {
152 if self.cached.update(ctx, from, event) {
153 self.t.eval(&self.cached)
154 } else {
155 None
156 }
157 }
158
159 fn sleep(&mut self, _ctx: &mut ExecCtx<C, E>) {
160 self.cached.clear()
161 }
162}
163
164#[bitflags]
165#[derive(Clone, Copy)]
166#[repr(u64)]
167pub enum Module {
168 Array,
169 NetAndTime,
170 Rand,
171 Re,
172 Str,
173}
174
175pub fn register<C: Ctx, E: UserEvent>(
212 ctx: &mut ExecCtx<C, E>,
213 modules: BitFlags<Module>,
214) -> Result<(ArcStr, ModuleResolver)> {
215 let mut tbl = FxHashMap::default();
216 tbl.insert(Path::from("/core"), core::register(ctx)?);
217 let mut root = String::from("pub mod core;\nuse core;\n");
218 for module in modules {
219 match module {
220 Module::Array => {
221 root.push_str("pub mod array;\n");
222 tbl.insert(Path::from("/array"), array::register(ctx)?);
223 }
224 Module::NetAndTime => {
225 root.push_str("pub mod time;\n");
226 tbl.insert(Path::from("/time"), time::register(ctx)?);
227 root.push_str("pub mod net;\n");
228 tbl.insert(Path::from("/net"), net::register(ctx)?);
229 }
230 Module::Rand => {
231 root.push_str("pub mod rand;\n");
232 tbl.insert(Path::from("/rand"), rand::register(ctx)?);
233 }
234 Module::Re => {
235 root.push_str("pub mod re;\n");
236 tbl.insert(Path::from("/re"), re::register(ctx)?);
237 }
238 Module::Str => {
239 root.push_str("pub mod str;\n");
240 tbl.insert(Path::from("/str"), str::register(ctx)?);
241 }
242 }
243 }
244 root.pop();
245 root.pop();
246 Ok((ArcStr::from(root), ModuleResolver::VFS(tbl)))
247}