stof 0.9.19

Data that carries its own logic.
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
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
//
// Copyright 2025 Formata, Inc. All rights reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//    http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
//

#[cfg(feature = "js")]
use std::cell::RefCell;
use std::sync::Arc;
use web_time::{SystemTime, UNIX_EPOCH};
use colored::Colorize;
use imbl::Vector;
use rustc_hash::{FxHashMap, FxHashSet};
use crate::{model::{DataRef, Func, Graph, SId}, runtime::{instruction::Instruction, instructions::{call::FuncCall, Base}, proc::{ProcRes, Process}, Error, Val, Waker}};

#[cfg(feature = "tokio")]
use parking_lot::RwLock;

#[cfg(feature = "tokio")]
use lazy_static::lazy_static;
#[cfg(feature = "tokio")]
lazy_static! {
    static ref TOKIO_RUNTIME: Arc<std::sync::Mutex<Option<tokio::runtime::Runtime>>> = Arc::new(std::sync::Mutex::new(None));
    static ref TOKIO_HANDLE_OVERRIDE: Arc<RwLock<Option<tokio::runtime::Handle>>> = Arc::new(RwLock::new(None));
}


/// Runtime.
pub struct Runtime {
    running: Vec<Process>, // TODO: split into high-priority and low-priority based on size to minimize mean running time?
    waiting: FxHashMap<SId, Process>,
    pub done: FxHashMap<SId, Process>,
    pub errored: FxHashMap<SId, Process>,

    sleeping: FxHashMap<SId, Process>,
    wakers: Vec<Waker>,

    pub done_callback: Option<Box<dyn FnMut(&Graph, &Process)->bool>>,
    pub err_callback: Option<Box<dyn FnMut(&Graph, &Process)->bool>>,

    #[cfg(feature = "tokio")]
    /// Optional tokio runtime handle (default exists, but still optional for flexibility & best practice in lib development).
    /// Processes can use this handle to spawn background tasks (ex. HTTP, Database Ops, etc.).
    pub tokio_runtime: Option<tokio::runtime::Handle>,
}
#[cfg(feature = "tokio")]
impl Default for Runtime {
    fn default() -> Self {
        let mut rt = Self {
            running: Default::default(),
            waiting: Default::default(),
            done: Default::default(),
            errored: Default::default(),
            sleeping: Default::default(),
            wakers: Default::default(),
            done_callback: Default::default(),
            err_callback: Default::default(),
            tokio_runtime: Default::default(),
        };

        // all Stof runtimes share the same background tokio runtime (thread pool)
        // check to see if there has been a tokio runtime handle given to us
        let tokio_runtime_handle = TOKIO_HANDLE_OVERRIDE.read();
        if let Some(handle) = &*tokio_runtime_handle {
            rt.tokio_runtime = Some(handle.clone());
        } else {
            // lazily create our own new tokio runtime if needed with defaults
            let mut tokio_runtime = TOKIO_RUNTIME.lock().unwrap();
            if let Some(tokio_runtime) = &*tokio_runtime {
                rt.tokio_runtime = Some(tokio_runtime.handle().clone());
            } else {
                let trt = tokio::runtime::Runtime::new().expect("failed to create tokio runtime");
                rt.tokio_runtime = Some(trt.handle().clone());
                *tokio_runtime = Some(trt);
            }
        }
        rt
    }
}
#[cfg(not(feature = "tokio"))]
impl Default for Runtime {
    fn default() -> Self {
        Self {
            running: Default::default(),
            waiting: Default::default(),
            done: Default::default(),
            errored: Default::default(),
            sleeping: Default::default(),
            wakers: Default::default(),
            done_callback: Default::default(),
            err_callback: Default::default(),
        }
    }
}
impl Runtime {
    #[inline]
    /// Push a process to this runtime.
    pub fn push_running_proc(&mut self, mut proc: Process, graph: &mut Graph) -> SId {
        let id = proc.env.pid.clone();
        
        // make sure the process has a self
        if proc.env.self_stack.is_empty() {
            proc.env.self_stack.push(graph.ensure_main_root());
        }
        
        self.running.push(proc);
        id
    }

    #[inline]
    /// Remove a process from running and return it.
    fn remove_running(&mut self, id: &SId) -> Process {
        let mut i: usize = 0;
        for proc in &self.running {
            if &proc.env.pid == id {
                break;
            }
            i += 1;
        }
        self.running.swap_remove(i)
    }

    #[inline(always)]
    /// Move from running to done.
    fn move_running_to_done(&mut self, graph: &Graph, id: &SId) {
        let proc = self.remove_running(id);
        if let Some(cb) = &mut self.done_callback {
            if cb(graph, &proc) {
                self.done.insert(id.clone(), proc);
            } else {
                self.errored.insert(id.clone(), proc);
            }
        } else {
            self.done.insert(id.clone(), proc);
        }
    }

    #[inline(always)]
    /// Move from running to waiting.
    fn move_running_to_waiting(&mut self, id: &SId) {
        let proc = self.remove_running(id);
        self.waiting.insert(id.clone(), proc);
    }

    #[inline(always)]
    /// Move from running to errored.
    fn move_running_to_error(&mut self, graph: &Graph, id: &SId) {
        let proc = self.remove_running(id);
        if let Some(cb) = &mut self.err_callback {
            if cb(graph, &proc) {
                self.errored.insert(id.clone(), proc);
            } else {
                self.done.insert(id.clone(), proc);
            }
        } else {
            self.errored.insert(id.clone(), proc);
        }
    }

    #[inline(always)]
    /// Move from running to sleeping.
    fn move_running_to_sleeping(&mut self, id: &SId) {
        let proc = self.remove_running(id);
        self.sleeping.insert(id.clone(), proc);
    }

    /// Run to completion.
    pub fn run_to_complete(&mut self, graph: &mut Graph) {
        let mut to_done = Vec::new();
        let mut to_wait = Vec::new();
        let mut to_err = Vec::new();
        let mut to_run = Vec::new();
        let mut to_spawn = Vec::new();
        let mut to_sleep = Vec::new();
        let mut to_exit = Vec::new();
        while !self.running.is_empty() || !self.sleeping.is_empty() {
            // Check to see if any sleeping processes need to be woken up first
            if !self.sleeping.is_empty() {
                let mut to_wake = Vec::new();
                let now = SystemTime::now().duration_since(UNIX_EPOCH).unwrap();
                self.wakers.retain(|waker| {
                    let woken = waker.woken(&now);
                    if woken { to_wake.push(waker.pid.clone()); }
                    !woken
                });
                for id in to_wake {
                    if let Some(proc) = self.sleeping.remove(&id) {
                        self.running.push(proc);
                    }
                }
            }

            // any limit < 1 will progress the process as much as possible per process until yield
            // kept at 0 for now, but might change with future optimization or priority scheduling
            let limit: i32 = 0;
            let yield_enabled = !self.sleeping.is_empty() || self.running.len() > 1;
            /* if !self.sleeping.is_empty() || self.running.len() > 1 {
                let len = (self.sleeping.len() + self.running.len()) as i32;
                limit = i32::max(10, 500 / len);
            } */

            for proc in self.running.iter_mut() {

                #[cfg(feature = "tokio")]
                {
                    // make sure each process has a handle to the correct runtime if needed
                    if self.tokio_runtime.is_some() {
                        proc.env.tokio_runtime = self.tokio_runtime.clone();
                    } else {
                        proc.env.tokio_runtime = None;
                    }
                }

                proc.env.yield_enabled = yield_enabled;
                match proc.progress(graph, limit) {
                    Ok(state) => {
                        match state {
                            ProcRes::Exit(pid) => {
                                if let Some(pid) = pid {
                                    to_exit.push(pid);
                                } else {
                                    to_exit.push(proc.env.pid.clone());
                                }
                            },
                            ProcRes::Wait(pid) => {
                                proc.waiting = Some(pid);
                                to_wait.push(proc.env.pid.clone());
                            },
                            ProcRes::Sleep(wref) => {
                                to_sleep.push((proc.env.pid.clone(), proc.waker_ref(wref)));
                            },
                            ProcRes::SleepFor(dur) => {
                                let now = SystemTime::now().duration_since(UNIX_EPOCH).unwrap();
                                to_sleep.push((proc.env.pid.clone(), proc.waker_time(now + dur)));
                            },
                            ProcRes::Trace(n) => {
                                let trace = proc.trace(&graph, n);
                                println!("{trace}");
                            },
                            ProcRes::Peek(n) => {
                                let trace = proc.peek(&graph, n);
                                println!("{trace}");
                            },
                            ProcRes::More => {
                                if let Some(spawn) = proc.env.spawn.take() {
                                    // this is only set via the Spawn instruction, which creates a new PID each time
                                    // therefore, don't have to worry about collisions here
                                    to_spawn.push(spawn);
                                }
                            },
                            ProcRes::Done => {
                                if let Some(var) = proc.env.stack.pop() {
                                    proc.result = Some(var);
                                }
                                to_done.push(proc.env.pid.clone());
                            },
                        }
                    },
                    Err(error) => {
                        proc.error = Some(error);
                        to_err.push(proc.env.pid.clone());
                    }
                }
            }

            if !to_done.is_empty() {
                for id in to_done.drain(..) {
                    self.move_running_to_done(&graph, &id);
                }
            }

            if !to_wait.is_empty() {
                for id in to_wait.drain(..) {
                    self.move_running_to_waiting(&id);
                }
            }

            if !to_err.is_empty() {
                for id in to_err.drain(..) {
                    self.move_running_to_error(&graph, &id);
                }
            }

            if !to_spawn.is_empty() {
                for proc in to_spawn.drain(..) {
                    self.push_running_proc(*proc, graph);
                }
            }

            if !to_sleep.is_empty() {
                for (id, waker) in to_sleep.drain(..) {
                    self.move_running_to_sleeping(&id);
                    self.wakers.push(waker);
                }
            }

            for (id, waiting_proc) in &mut self.waiting {
                if let Some(wait_id) = &waiting_proc.waiting {
                    if let Some(done_proc) = self.done.remove(wait_id) {
                        // If the completed process has a result, push that to the waiting processes stack
                        if let Some(res) = done_proc.result {
                            waiting_proc.env.stack.push(res);
                        }
                        to_run.push(id.clone());
                    } else if let Some(error_proc) = self.errored.remove(wait_id) {
                        // Propagate the error back to the awaiting process, so that it can optionally handle it itself
                        println!("{} {}{}{}{}{}\n{}", "await error".red().bold(), "(".dimmed(), waiting_proc.env.pid.as_ref().dimmed().purple(), " waiting on ".dimmed(), error_proc.env.pid.as_ref().dimmed().cyan(), ")".dimmed(), error_proc.trace(&graph, 20));
                        if let Some(error) = error_proc.error {
                            waiting_proc.instructions.instructions.push_front(Arc::new(Base::CtrlAwaitError(Error::AwaitError(Box::new(error)))));
                        }
                        to_run.push(id.clone());
                    } else if let Some(max) = &waiting_proc.env.max_execution_time {
                        if let Some(start) = &waiting_proc.env.start_time {
                            if &start.elapsed() > max {
                                // If the waiting process has outlived its ttl, then error
                                println!("{} {}{}{}{}{}", "await timeout error".red().bold(), "(".dimmed(), waiting_proc.env.pid.as_ref().dimmed().purple(), " waiting on ".dimmed(), wait_id.as_ref().dimmed().cyan(), ")".dimmed());
                                waiting_proc.instructions.instructions.push_front(Arc::new(Base::CtrlAwaitError(Error::ExecutionTimeout)));
                                to_run.push(id.clone());
                            }
                        }
                    }
                }
            }

            for (id, sleeping_proc) in &mut self.sleeping {
                if let Some(max) = &sleeping_proc.env.max_execution_time {
                    if let Some(start) = &sleeping_proc.env.start_time {
                        if &start.elapsed() > max {
                            // If the sleeping process has outlived its ttl, then error
                            println!("{} {}{}{}", "sleep timeout error".red().bold(), "(".dimmed(), sleeping_proc.env.pid.as_ref().dimmed().purple(), ")".dimmed());
                            sleeping_proc.instructions.instructions.push_front(Arc::new(Base::CtrlAwaitError(Error::ExecutionTimeout)));
                            to_run.push(id.clone());
                        }
                    }
                }
            }

            if !to_run.is_empty() {
                for id in to_run.drain(..) {
                    if let Some(mut proc) = self.waiting.remove(&id) {
                        proc.waiting = None;
                        self.running.push(proc);
                    } else if let Some(mut proc) = self.sleeping.remove(&id) {
                        proc.waiting = None;
                        self.running.push(proc);
                    }
                }
            }

            if !to_exit.is_empty() {
                for id in to_exit.drain(..) {
                    if let Some(proc) = self.waiting.remove(&id) {
                        if let Some(cb) = &mut self.done_callback {
                            if cb(graph, &proc) {
                                self.done.insert(id, proc);
                            } else {
                                self.errored.insert(id, proc);
                            }
                        } else {
                            self.done.insert(id, proc);
                        }
                    } else if let Some(proc) = self.sleeping.remove(&id) {
                        if let Some(cb) = &mut self.done_callback {
                            if cb(graph, &proc) {
                                self.done.insert(id, proc);
                            } else {
                                self.errored.insert(id, proc);
                            }
                        } else {
                            self.done.insert(id, proc);
                        }
                    } else {
                        self.move_running_to_done(graph, &id);
                    }
                }
            }
        }
    }

    /// Clear this runtime completely.
    pub fn clear(&mut self) {
        self.running.clear();
        self.waiting.clear();
        self.done.clear();
        self.errored.clear();
    }


    /*****************************************************************************
     * Singular & asynchronous.
     *****************************************************************************/
    
    /// Run a single step of this runtime.
    /// Returns true if there is another step to run.
    /// N.B: Do not alter this function - change run_to_complete and copy changes here.
    /// Make sure the limit is greater than 0 so that the step yields before complete if only one proc.
    pub fn run_single_step(&mut self, graph: &mut Graph) -> bool {
        let mut to_done = Vec::new();
        let mut to_wait = Vec::new();
        let mut to_err = Vec::new();
        let mut to_run = Vec::new();
        let mut to_spawn = Vec::new();
        let mut to_sleep = Vec::new();
        let mut to_exit = Vec::new();
        if !self.running.is_empty() || !self.sleeping.is_empty() {
            // Check to see if any sleeping processes need to be woken up first
            if !self.sleeping.is_empty() {
                let mut to_wake = Vec::new();
                let now = SystemTime::now().duration_since(UNIX_EPOCH).unwrap();
                self.wakers.retain(|waker| {
                    let woken = waker.woken(&now);
                    if woken { to_wake.push(waker.pid.clone()); }
                    !woken
                });
                for id in to_wake {
                    if let Some(proc) = self.sleeping.remove(&id) {
                        self.running.push(proc);
                    }
                }
            }

            // any limit < 1 will progress the process as much as possible per process
            // kept at 0 for now, but might change with future optimization or priority scheduling
            let limit: i32 = 0;
            let yield_enabled = !self.sleeping.is_empty() || self.running.len() > 1;
            /* let mut limit: i32 = 100;
            if !self.sleeping.is_empty() || self.running.len() > 1 {
                let len = (self.sleeping.len() + self.running.len()) as i32;
                limit = i32::max(10, 500 / len);
            } */

            for proc in self.running.iter_mut() {

                #[cfg(feature = "tokio")]
                {
                    // make sure each process has a handle to the correct runtime if needed
                    if self.tokio_runtime.is_some() {
                        proc.env.tokio_runtime = self.tokio_runtime.clone();
                    } else {
                        proc.env.tokio_runtime = None;
                    }
                }

                proc.env.yield_enabled = yield_enabled;
                match proc.progress(graph, limit) {
                    Ok(state) => {
                        match state {
                            ProcRes::Exit(pid) => {
                                if let Some(pid) = pid {
                                    to_exit.push(pid);
                                } else {
                                    to_exit.push(proc.env.pid.clone());
                                }
                            },
                            ProcRes::Wait(pid) => {
                                proc.waiting = Some(pid);
                                to_wait.push(proc.env.pid.clone());
                            },
                            ProcRes::Sleep(wref) => {
                                to_sleep.push((proc.env.pid.clone(), proc.waker_ref(wref)));
                            },
                            ProcRes::SleepFor(dur) => {
                                let now = SystemTime::now().duration_since(UNIX_EPOCH).unwrap();
                                to_sleep.push((proc.env.pid.clone(), proc.waker_time(now + dur)));
                            },
                            ProcRes::Trace(n) => {
                                let trace = proc.trace(&graph, n);
                                println!("{trace}");
                            },
                            ProcRes::Peek(n) => {
                                let trace = proc.peek(&graph, n);
                                println!("{trace}");
                            },
                            ProcRes::More => {
                                if let Some(spawn) = proc.env.spawn.take() {
                                    // this is only set via the Spawn instruction, which creates a new PID each time
                                    // therefore, don't have to worry about collisions here
                                    to_spawn.push(spawn);
                                }
                            },
                            ProcRes::Done => {
                                if let Some(var) = proc.env.stack.pop() {
                                    proc.result = Some(var);
                                }
                                to_done.push(proc.env.pid.clone());
                            },
                        }
                    },
                    Err(error) => {
                        proc.error = Some(error);
                        to_err.push(proc.env.pid.clone());
                    }
                }
            }

            if !to_done.is_empty() {
                for id in to_done.drain(..) {
                    self.move_running_to_done(&graph, &id);
                }
            }

            if !to_wait.is_empty() {
                for id in to_wait.drain(..) {
                    self.move_running_to_waiting(&id);
                }
            }

            if !to_err.is_empty() {
                for id in to_err.drain(..) {
                    self.move_running_to_error(&graph, &id);
                }
            }

            if !to_spawn.is_empty() {
                for proc in to_spawn.drain(..) {
                    self.push_running_proc(*proc, graph);
                }
            }

            if !to_sleep.is_empty() {
                for (id, waker) in to_sleep.drain(..) {
                    self.move_running_to_sleeping(&id);
                    self.wakers.push(waker);
                }
            }

            for (id, waiting_proc) in &mut self.waiting {
                if let Some(wait_id) = &waiting_proc.waiting {
                    if let Some(done_proc) = self.done.remove(wait_id) {
                        // If the completed process has a result, push that to the waiting processes stack
                        if let Some(res) = done_proc.result {
                            waiting_proc.env.stack.push(res);
                        }
                        to_run.push(id.clone());
                    } else if let Some(error_proc) = self.errored.remove(wait_id) {
                        // Propagate the error back to the awaiting process, so that it can optionally handle it itself
                        println!("{} {}{}{}{}{}\n{}", "await error".red().bold(), "(".dimmed(), waiting_proc.env.pid.as_ref().dimmed().purple(), " waiting on ".dimmed(), error_proc.env.pid.as_ref().dimmed().cyan(), ")".dimmed(), error_proc.trace(&graph, 20));
                        if let Some(error) = error_proc.error {
                            waiting_proc.instructions.instructions.push_front(Arc::new(Base::CtrlAwaitError(Error::AwaitError(Box::new(error)))));
                        }
                        to_run.push(id.clone());
                    } else if let Some(max) = &waiting_proc.env.max_execution_time {
                        if let Some(start) = &waiting_proc.env.start_time {
                            if &start.elapsed() > max {
                                // If the waiting process has outlived its ttl, then error
                                println!("{} {}{}{}{}{}", "await timeout error".red().bold(), "(".dimmed(), waiting_proc.env.pid.as_ref().dimmed().purple(), " waiting on ".dimmed(), wait_id.as_ref().dimmed().cyan(), ")".dimmed());
                                waiting_proc.instructions.instructions.push_front(Arc::new(Base::CtrlAwaitError(Error::ExecutionTimeout)));
                                to_run.push(id.clone());
                            }
                        }
                    }
                }
            }

            for (id, sleeping_proc) in &mut self.sleeping {
                if let Some(max) = &sleeping_proc.env.max_execution_time {
                    if let Some(start) = &sleeping_proc.env.start_time {
                        if &start.elapsed() > max {
                            // If the sleeping process has outlived its ttl, then error
                            println!("{} {}{}{}", "sleep timeout error".red().bold(), "(".dimmed(), sleeping_proc.env.pid.as_ref().dimmed().purple(), ")".dimmed());
                            sleeping_proc.instructions.instructions.push_front(Arc::new(Base::CtrlAwaitError(Error::ExecutionTimeout)));
                            to_run.push(id.clone());
                        }
                    }
                }
            }

            if !to_run.is_empty() {
                for id in to_run.drain(..) {
                    if let Some(mut proc) = self.waiting.remove(&id) {
                        proc.waiting = None;
                        self.running.push(proc);
                    } else if let Some(mut proc) = self.sleeping.remove(&id) {
                        proc.waiting = None;
                        self.running.push(proc);
                    }
                }
            }

            if !to_exit.is_empty() {
                for id in to_exit.drain(..) {
                    if let Some(proc) = self.waiting.remove(&id) {
                        if let Some(cb) = &mut self.done_callback {
                            if cb(graph, &proc) {
                                self.done.insert(id, proc);
                            } else {
                                self.errored.insert(id, proc);
                            }
                        } else {
                            self.done.insert(id, proc);
                        }
                    } else if let Some(proc) = self.sleeping.remove(&id) {
                        if let Some(cb) = &mut self.done_callback {
                            if cb(graph, &proc) {
                                self.done.insert(id, proc);
                            } else {
                                self.errored.insert(id, proc);
                            }
                        } else {
                            self.done.insert(id, proc);
                        }
                    } else {
                        self.move_running_to_done(graph, &id);
                    }
                }
            }
        }

        !self.running.is_empty() || !self.sleeping.is_empty()
    }

    #[cfg(feature = "js")]
    /// Single step async.
    pub async fn async_single_step_with_gate(&mut self, graph: &RefCell<Graph>, yield_to_outer: bool, acquire: &js_sys::Function, release: &js_sys::Function) -> bool {
        // Acquire the gate before touching WASM memory
        let acquire_promise = acquire.call0(&wasm_bindgen::JsValue::NULL).expect("acquire failed");
        wasm_bindgen_futures::JsFuture::from(js_sys::Promise::from(acquire_promise)).await.expect("acquire await failed");
        
        let res = {
            let mut gr = graph.borrow_mut();
            self.run_single_step(&mut *gr)
        };

        // Release the gate — WASM memory is safe for others
        release.call0(&wasm_bindgen::JsValue::NULL).expect("release failed");
        {
            if yield_to_outer {
                // Yield to the macrotask queue so async JS operations (fetch, etc.) can execute.
                // Using setTimeout(0) instead of Promise microtasks ensures proper event loop yielding.
                let promise = js_sys::Promise::new(&mut |resolve, _reject| {
                    use wasm_bindgen::JsCast;
                    let global = js_sys::global();

                    // Get setTimeout from global (works in Node.js, Browser, Deno, Bun)
                    let set_timeout = js_sys::Reflect::get(&global, &"setTimeout".into()).expect("setTimeout not available");
                    let set_timeout_fn = set_timeout.dyn_into::<js_sys::Function>().expect("setTimeout is not a function");
                    
                    // Call setTimeout(resolve, 0)
                    let args = js_sys::Array::new();
                    args.push(&resolve);
                    args.push(&0.into()); // 0ms - yields to macrotask queue
                    
                    set_timeout_fn.apply(&global, &args).expect("setTimeout failed");
                });
                wasm_bindgen_futures::JsFuture::from(promise).await.expect("setTimeout promise failed");
            }
        }
        res
    }
    
    #[cfg(any(feature = "js", feature = "tokio"))]
    /// Single step async.
    pub async fn async_single_step(&mut self, graph: &mut Graph, yield_to_outer: bool) -> bool {
        let res = self.run_single_step(graph);

        #[cfg(feature = "js")]
        {
            if yield_to_outer {
                // Yield to the macrotask queue so async JS operations (fetch, etc.) can execute.
                // Using setTimeout(0) instead of Promise microtasks ensures proper event loop yielding.
                let promise = js_sys::Promise::new(&mut |resolve, _reject| {
                    use wasm_bindgen::JsCast;
                    let global = js_sys::global();

                    // Get setTimeout from global (works in Node.js, Browser, Deno, Bun)
                    let set_timeout = js_sys::Reflect::get(&global, &"setTimeout".into()).expect("setTimeout not available");
                    let set_timeout_fn = set_timeout.dyn_into::<js_sys::Function>().expect("setTimeout is not a function");
                    
                    // Call setTimeout(resolve, 0)
                    let args = js_sys::Array::new();
                    args.push(&resolve);
                    args.push(&0.into()); // 0ms - yields to macrotask queue
                    
                    set_timeout_fn.apply(&global, &args).expect("setTimeout failed");
                });
                wasm_bindgen_futures::JsFuture::from(promise).await.expect("setTimeout promise failed");
            }
        }
        res
    }

    #[cfg(feature = "js")]
    /// Run functions with the given attributes in this graph.
    pub async fn async_run_attribute_functions_with_gate(graph: &RefCell<Graph>, context: Option<String>, attributes: &Option<FxHashSet<String>>, throw: bool, acquire: &js_sys::Function, release: &js_sys::Function) -> Result<String, String> {
        let functions;
        {
            let gr = graph.borrow();
            functions = Func::all_functions(&gr, attributes);
        }
        Self::async_run_functions_with_gate(graph, context, functions, throw, acquire, release).await
    }

    #[cfg(any(feature = "js", feature = "tokio"))]
    /// Run functions with the given attributes in this graph.
    pub async fn async_run_attribute_functions(graph: &mut Graph, context: Option<String>, attributes: &Option<FxHashSet<String>>, throw: bool) -> Result<String, String> {
        Self::async_run_functions(graph, context, Func::all_functions(graph, attributes), throw).await
    }

    #[cfg(feature = "js")]
    /// Run all given functions.
    pub async fn async_run_functions_with_gate(graph: &RefCell<Graph>, context: Option<String>, functions: FxHashSet<DataRef>, throw: bool, acquire: &js_sys::Function, release: &js_sys::Function) -> Result<String, String> {
        let mut rt = Self::default();
        for func_ref in functions {
            let mut gr = graph.borrow_mut();
            if let Some(context) = &context {
                for node in func_ref.data_nodes(&gr) {
                    if let Some(node_path) = node.node_path(&gr, true) {
                        let path = node_path.join(".");
                        if path.contains(context) {
                            let instruction = Arc::new(FuncCall {
                                as_ref: false,
                                cnull: false,
                                stack: false,
                                func: Some(func_ref),
                                search: None,
                                args: Default::default(),
                                oself: None,
                            }) as Arc<dyn Instruction>;
                            let proc = Process::from(instruction);
                            rt.push_running_proc(proc, &mut *gr);
                            break;
                        }
                    }
                }
            } else {
                let instruction = Arc::new(FuncCall {
                    as_ref: false,
                    cnull: false,
                    stack: false,
                    func: Some(func_ref),
                    search: None,
                    args: Default::default(),
                    oself: None,
                }) as Arc<dyn Instruction>;
                let proc = Process::from(instruction);
                rt.push_running_proc(proc, &mut *gr);
            }
        }

        const YIELD_INTERVAL_MS: u64 = 20;
        let mut yield_to_outer = false;
        let mut last_yield = web_time::Instant::now();
        while rt.async_single_step_with_gate(graph, yield_to_outer, acquire, release).await {
            yield_to_outer = false;
            if last_yield.elapsed().as_millis() as u64 >= YIELD_INTERVAL_MS {
                yield_to_outer = true;
                last_yield = web_time::Instant::now();
            }
        }

        let mut output = String::from("");
        for (_, success) in &rt.done {
            if success.env.call_stack.len() < 1 && success.instructions.executed.len() > 0 {
                let func = success.instructions.executed[0].clone();
                if let Some(func) = func.as_dyn_any().downcast_ref::<Base>() {
                    match func {
                        Base::Literal(val) => {
                            if let Some(func_ref) = val.try_func() {
                                let gr = graph.borrow();
                                if let Some(name) = func_ref.data_name(&gr) {
                                    let mut func_path = String::from("<unknown>");
                                    for node in func_ref.data_nodes(&gr) {
                                        func_path = node.node_path(&gr, true).unwrap().join(".");
                                    }
                                    // Only print something if there's a result
                                    if let Some(res) = &success.result {
                                        let suc_str = res.val.read().print(&gr);
                                        let msg = format!("{} {} {} {} {}\n", "main".purple(), func_path.italic().dimmed(), name.as_ref().italic().blue(), "...".dimmed(), suc_str.bold().bright_cyan());
                                        if output.len() < 1 { output.push('\n'); }
                                        output.push_str(&msg);
                                    }
                                }
                            }
                        },
                        _ => {}
                    }
                }
            }
        }
        for (_, errored) in &rt.errored {
            if errored.env.call_stack.len() > 0 {
                let gr = graph.borrow();
                let func_ref = errored.env.call_stack.first().unwrap();
                if let Some(name) = func_ref.data_name(&gr) {
                    let mut func_path = String::from("<unknown>");
                    for node in func_ref.data_nodes(&gr) {
                        func_path = node.node_path(&gr, true).unwrap().join(".");
                    }
                    let err_str = errored.trace(&gr, 10);
                    let msg = format!("{} {} {} {} {} {}\n{}\n", "main".purple(), func_path.italic().dimmed(), name.as_ref().italic().blue(), "...".dimmed(), "failed".bold().red(), "@".dimmed(), err_str.bold().bright_cyan());
                    output.push_str(&msg);
                }
            }
        }

        if throw && rt.errored.len() > 0 {
            Err(output)
        } else {
            Ok(output)
        }
    }

    #[cfg(any(feature = "js", feature = "tokio"))]
    /// Run all given functions.
    pub async fn async_run_functions(graph: &mut Graph, context: Option<String>, functions: FxHashSet<DataRef>, throw: bool) -> Result<String, String> {
        let mut rt = Self::default();
        for func_ref in functions {
            if let Some(context) = &context {
                for node in func_ref.data_nodes(&graph) {
                    if let Some(node_path) = node.node_path(&graph, true) {
                        let path = node_path.join(".");
                        if path.contains(context) {
                            let instruction = Arc::new(FuncCall {
                                as_ref: false,
                                cnull: false,
                                stack: false,
                                func: Some(func_ref),
                                search: None,
                                args: Default::default(),
                                oself: None,
                            }) as Arc<dyn Instruction>;
                            let proc = Process::from(instruction);
                            rt.push_running_proc(proc, graph);
                            break;
                        }
                    }
                }
            } else {
                let instruction = Arc::new(FuncCall {
                    as_ref: false,
                    cnull: false,
                    stack: false,
                    func: Some(func_ref),
                    search: None,
                    args: Default::default(),
                    oself: None,
                }) as Arc<dyn Instruction>;
                let proc = Process::from(instruction);
                rt.push_running_proc(proc, graph);
            }
        }

        const YIELD_INTERVAL_MS: u64 = 20;
        let mut yield_to_outer = false;
        let mut last_yield = web_time::Instant::now();
        while rt.async_single_step(graph, yield_to_outer).await {
            yield_to_outer = false;
            if last_yield.elapsed().as_millis() as u64 >= YIELD_INTERVAL_MS {
                yield_to_outer = true;
                last_yield = web_time::Instant::now();
            }
        }

        let mut output = String::from("");
        for (_, success) in &rt.done {
            if success.env.call_stack.len() < 1 && success.instructions.executed.len() > 0 {
                let func = success.instructions.executed[0].clone();
                if let Some(func) = func.as_dyn_any().downcast_ref::<Base>() {
                    match func {
                        Base::Literal(val) => {
                            if let Some(func_ref) = val.try_func() {
                                if let Some(name) = func_ref.data_name(graph) {
                                    let mut func_path = String::from("<unknown>");
                                    for node in func_ref.data_nodes(graph) {
                                        func_path = node.node_path(graph, true).unwrap().join(".");
                                    }
                                    // Only print something if there's a result
                                    if let Some(res) = &success.result {
                                        let suc_str = res.val.read().print(&graph);
                                        let msg = format!("{} {} {} {} {}\n", "main".purple(), func_path.italic().dimmed(), name.as_ref().italic().blue(), "...".dimmed(), suc_str.bold().bright_cyan());
                                        if output.len() < 1 { output.push('\n'); }
                                        output.push_str(&msg);
                                    }
                                }
                            }
                        },
                        _ => {}
                    }
                }
            }
        }
        for (_, errored) in &rt.errored {
            if errored.env.call_stack.len() > 0 {
                let func_ref = errored.env.call_stack.first().unwrap();
                if let Some(name) = func_ref.data_name(graph) {
                    let mut func_path = String::from("<unknown>");
                    for node in func_ref.data_nodes(graph) {
                        func_path = node.node_path(graph, true).unwrap().join(".");
                    }
                    let err_str = errored.trace(graph, 10);
                    let msg = format!("{} {} {} {} {} {}\n{}\n", "main".purple(), func_path.italic().dimmed(), name.as_ref().italic().blue(), "...".dimmed(), "failed".bold().red(), "@".dimmed(), err_str.bold().bright_cyan());
                    output.push_str(&msg);
                }
            }
        }

        if throw && rt.errored.len() > 0 {
            Err(output)
        } else {
            Ok(output)
        }
    }


    /*****************************************************************************
     * Run.
     *****************************************************************************/
    
    /// Run every #[main] function within this graph.
    /// If throw is false, this will only return Ok.
    pub fn run(graph: &mut Graph, context: Option<String>, throw: bool) -> Result<String, String> {
        Self::run_functions(graph, context, Func::main_functions(graph), throw)
    }

    /// Run functions with the given attributes in this graph.
    pub fn run_attribute_functions(graph: &mut Graph, context: Option<String>, attributes: &Option<FxHashSet<String>>, throw: bool) -> Result<String, String> {
        Self::run_functions(graph, context, Func::all_functions(graph, attributes), throw)
    }

    /// Run all given functions.
    pub fn run_functions(graph: &mut Graph, context: Option<String>, functions: FxHashSet<DataRef>, throw: bool) -> Result<String, String> {
        let mut rt = Self::default();
        for func_ref in functions {
            if let Some(context) = &context {
                for node in func_ref.data_nodes(&graph) {
                    if let Some(node_path) = node.node_path(&graph, true) {
                        let path = node_path.join(".");
                        if path.contains(context) {
                            let instruction = Arc::new(FuncCall {
                                as_ref: false,
                                cnull: false,
                                stack: false,
                                func: Some(func_ref),
                                search: None,
                                args: Default::default(),
                                oself: None,
                            }) as Arc<dyn Instruction>;
                            let proc = Process::from(instruction);
                            rt.push_running_proc(proc, graph);
                            break;
                        }
                    }
                }
            } else {
                let instruction = Arc::new(FuncCall {
                    as_ref: false,
                    cnull: false,
                    stack: false,
                    func: Some(func_ref),
                    search: None,
                    args: Default::default(),
                    oself: None,
                }) as Arc<dyn Instruction>;
                let proc = Process::from(instruction);
                rt.push_running_proc(proc, graph);
            }
        }

        rt.run_to_complete(graph);
        let mut output = String::from("");
        for (_, success) in &rt.done {
            if success.env.call_stack.len() < 1 && success.instructions.executed.len() > 0 {
                let func = success.instructions.executed[0].clone();
                if let Some(func) = func.as_dyn_any().downcast_ref::<Base>() {
                    match func {
                        Base::Literal(val) => {
                            if let Some(func_ref) = val.try_func() {
                                if let Some(name) = func_ref.data_name(graph) {
                                    let mut func_path = String::from("<unknown>");
                                    for node in func_ref.data_nodes(graph) {
                                        func_path = node.node_path(graph, true).unwrap().join(".");
                                    }
                                    // Only print something if there's a result
                                    if let Some(res) = &success.result {
                                        let suc_str = res.val.read().print(&graph);
                                        let msg = format!("{} {} {} {} {}\n", "main".purple(), func_path.italic().dimmed(), name.as_ref().italic().blue(), "...".dimmed(), suc_str.bold().bright_cyan());
                                        if output.len() < 1 { output.push('\n'); }
                                        output.push_str(&msg);
                                    }
                                }
                            }
                        },
                        _ => {}
                    }
                }
            }
        }
        for (_, errored) in &rt.errored {
            if errored.env.call_stack.len() > 0 {
                let func_ref = errored.env.call_stack.first().unwrap();
                if let Some(name) = func_ref.data_name(graph) {
                    let mut func_path = String::from("<unknown>");
                    for node in func_ref.data_nodes(graph) {
                        func_path = node.node_path(graph, true).unwrap().join(".");
                    }
                    let err_str = errored.trace(graph, 10);
                    let msg = format!("{} {} {} {} {} {}\n{}\n", "main".purple(), func_path.italic().dimmed(), name.as_ref().italic().blue(), "...".dimmed(), "failed".bold().red(), "@".dimmed(), err_str.bold().bright_cyan());
                    output.push_str(&msg);
                }
            }
        }

        if throw && rt.errored.len() > 0 {
            Err(output)
        } else {
            Ok(output)
        }
    }


    /*****************************************************************************
     * Test.
     *****************************************************************************/
    
    /// Test every #[test] function within this graph.
    /// Will insert callbacks into this runtime for printing results.
    /// If throw is false, this will only return Ok.
    pub fn test(graph: &mut Graph, context: Option<String>, throw: bool) -> Result<String, String> {
        // Create a fresh runtime
        let mut rt = Self::default();

        // Load all processes for all test functions
        let mut count = 0;
        for func_ref in Func::test_functions(&graph) {
            if let Some(context) = &context {
                for node in func_ref.data_nodes(&graph) {
                    if let Some(node_path) = node.node_path(&graph, true) {
                        let path = node_path.join(".");
                        if path.contains(context) {
                            let instruction = Arc::new(FuncCall {
                                as_ref: false,
                                cnull: false,
                                stack: false,
                                func: Some(func_ref),
                                search: None,
                                args: Default::default(),
                                oself: None,
                            }) as Arc<dyn Instruction>;
                            let proc = Process::from(instruction);
                            count += 1;
                            rt.push_running_proc(proc, graph);
                            break;
                        }
                    }
                }
            } else {
                let instruction = Arc::new(FuncCall {
                    as_ref: false,
                    cnull: false,
                    stack: false,
                    func: Some(func_ref),
                    search: None,
                    args: Default::default(),
                    oself: None,
                }) as Arc<dyn Instruction>;
                let proc = Process::from(instruction);
                count += 1;
                rt.push_running_proc(proc, graph);
            }
        }

        // Create and set callbacks for printing successes and failures
        rt.done_callback = Some(Box::new(|graph, success| {
            // if this is top-level and executed something, print out a success message
            if success.env.call_stack.len() < 1 && success.instructions.executed.len() > 0 {
                let func = success.instructions.executed[0].clone();
                if let Some(func) = func.as_dyn_any().downcast_ref::<Base>() {
                    match func {
                        Base::Literal(val) => {
                            if let Some(func_ref) = val.try_func() {
                                if let Some(name) = func_ref.data_name(graph) {
                                    if let Some(func) = graph.get_stof_data::<Func>(&func_ref) {
                                        if func.attributes.contains_key("errors") {
                                            if !func.attributes.contains_key("silent") {
                                                let mut func_path = String::from("<unknown>");
                                                for node in func_ref.data_nodes(graph) {
                                                    func_path = node.node_path(graph, true).unwrap().join(".");
                                                }
                                                println!("{} {} {} {} {}", "test".purple(), func_path.italic().dimmed(), name.as_ref().italic().blue(), "...".dimmed(), "failed".bold().red());
                                            }
                                            return false; // push to error instead of done
                                        } else if !func.attributes.contains_key("silent") {
                                            let mut func_path = String::from("<unknown>");
                                            for node in func_ref.data_nodes(graph) {
                                                func_path = node.node_path(graph, true).unwrap().join(".");
                                            }
                                            println!("{} {} {} {} {}", "test".purple(), func_path.italic().dimmed(), name.as_ref().italic().blue(), "...".dimmed(), "ok".bold().green());
                                        }
                                    }
                                }
                            }
                        },
                        _ => {}
                    }
                }
            }
            true
        }));
        rt.err_callback = Some(Box::new(|graph, errored| {
            // if this is top-level and executed something, print out an error message
            if errored.env.call_stack.len() > 0 {
                let func_ref = errored.env.call_stack.first().unwrap();
                if let Some(name) = func_ref.data_name(graph) {
                    if let Some(func) = graph.get_stof_data::<Func>(&func_ref) {
                        if func.attributes.contains_key("errors") {
                            if !func.attributes.contains_key("silent") {
                                let mut func_path = String::from("<unknown>");
                                for node in func_ref.data_nodes(graph) {
                                    func_path = node.node_path(graph, true).unwrap().join(".");
                                }
                                println!("{} {} {} {} {}", "test".purple(), func_path.italic().dimmed(), name.as_ref().italic().blue(), "...".dimmed(), "ok".bold().green());
                            }
                            return false; // push to done instead of to errored
                        } else if !func.attributes.contains_key("silent") {
                            let mut func_path = String::from("<unknown>");
                            for node in func_ref.data_nodes(graph) {
                                func_path = node.node_path(graph, true).unwrap().join(".");
                            }
                            println!("{} {} {} {} {}", "test".purple(), func_path.italic().dimmed(), name.as_ref().italic().blue(), "...".dimmed(), "failed".bold().red());
                        }
                    }
                }
            }
            true
        }));

        // Run to completion
        println!("{} {} {} {}", "running".bold(), count, "tests".bold(), "...".dimmed());
        let start = SystemTime::now();
        rt.run_to_complete(graph);
        let duration = start.elapsed().unwrap();

        // Gather results and output
        let mut output = "\n".to_string();
        let mut result = "ok".bold().green();
        if rt.errored.len() > 0 {
            result = "failed".bold().red();
            output.push_str(&format!("{} failures:\n", rt.errored.len()));
            for (_, failure) in &rt.errored {
                let func_ref;
                let mut err_str = String::default();
                if failure.env.call_stack.len() > 0 {
                    func_ref = failure.env.call_stack.first().unwrap().clone();
                    if let Some(_err) = &failure.error {
                        err_str = failure.trace(graph, 10); // contains the error
                    }
                } else if failure.env.call_stack.len() < 1 && failure.instructions.executed.len() > 0 {
                    let func = failure.instructions.executed[0].clone();
                    if let Some(func) = func.as_dyn_any().downcast_ref::<Base>() {
                        match func {
                            Base::Literal(val) => {
                                if let Some(fref) = val.try_func() {
                                    func_ref = fref;
                                    err_str = format!("\texpected to error, but received a result of '{:?}'", failure.result);
                                } else {
                                    continue;
                                }
                            },
                            _ => {
                                continue;
                            },
                        }
                    } else {
                        continue;
                    }
                } else {
                    continue;
                }

                if let Some(name) = func_ref.data_name(graph) {
                    let mut func_path = String::from("<unknown>");
                    for node in func_ref.data_nodes(graph) {
                        func_path = node.node_path(graph, true).unwrap().join(".");
                    }
                    output.push_str(&format!("\n{}: {}{}{} ...\n{}\n", "failed".bold().red(), func_path.italic().purple(), " @ ".dimmed(), name.as_ref().italic().blue(), err_str.bold().bright_cyan()));
                }
            }
            output.push('\n');
        }
        let passed = count - rt.errored.len();
        let dur = (duration.as_secs_f32() * 100.0).round() / 100.0;
        output.push_str(&format!("\ntest result: {}. {} passed; {} failed; finished in {}s\n", result, passed, rt.errored.len(), dur));

        if throw && rt.errored.len() > 0 {
            Err(output)
        } else {
            Ok(output)
        }
    }


    /*****************************************************************************
     * Static functions.
     *****************************************************************************/
    
    /// Call a singular function with this runtime.
    pub fn call(graph: &mut Graph, search: &str, args: Vec<Val>) -> Result<Val, Error> {
        let mut arguments: Vector<Arc<dyn Instruction>> = Vector::default();
        for arg in args { arguments.push_back(Arc::new(Base::Literal(arg))); }
        let instruction = Arc::new(FuncCall {
            as_ref: false,
            cnull: false,
            stack: false,
            func: None,
            search: Some(search.into()),
            args: arguments,
            oself: None,
        });
        Self::eval(graph, instruction)
    }

    #[cfg(feature = "js")]
    /// Call a singular function with this runtime.
    pub async fn async_call_with_gate(graph: &RefCell<Graph>, search: &str, args: Vec<Val>, acquire: &js_sys::Function, release: &js_sys::Function) -> Result<Val, Error> {
        let mut arguments: Vector<Arc<dyn Instruction>> = Vector::default();
        for arg in args { arguments.push_back(Arc::new(Base::Literal(arg))); }
        let instruction = Arc::new(FuncCall {
            as_ref: false,
            cnull: false,
            stack: false,
            func: None,
            search: Some(search.into()),
            args: arguments,
            oself: None,
        });
        Self::async_eval_with_gate(graph, instruction, acquire, release).await
    }

    #[cfg(any(feature = "js", feature = "tokio"))]
    /// Call a singular function with this runtime.
    pub async fn async_call(graph: &mut Graph, search: &str, args: Vec<Val>) -> Result<Val, Error> {
        let mut arguments: Vector<Arc<dyn Instruction>> = Vector::default();
        for arg in args { arguments.push_back(Arc::new(Base::Literal(arg))); }
        let instruction = Arc::new(FuncCall {
            as_ref: false,
            cnull: false,
            stack: false,
            func: None,
            search: Some(search.into()),
            args: arguments,
            oself: None,
        });
        Self::async_eval(graph, instruction).await
    }
    
    /// Call a singular function with this runtime.
    pub fn call_func(graph: &mut Graph, func: &DataRef, args: Vec<Val>) -> Result<Val, Error> {
        if !func.type_of::<Func>(&graph) {
            return Err(Error::FuncDne(format!("Data Ptr not Func")));
        }
        let mut arguments: Vector<Arc<dyn Instruction>> = Vector::default();
        for arg in args { arguments.push_back(Arc::new(Base::Literal(arg))); }
        let instruction = Arc::new(FuncCall {
            as_ref: false,
            cnull: false,
            stack: false,
            func: Some(func.clone()),
            search: None,
            args: arguments,
            oself: None,
        });
        Self::eval(graph, instruction)
    }
    
    /// Evaluate a single instruction.
    /// Creates a new runtime and process just for this (lightweight).
    /// Use this while parsing if needed.
    pub fn eval(graph: &mut Graph, instruction: Arc<dyn Instruction>) -> Result<Val, Error> {
        let mut runtime = Self::default();
        let proc = Process::from(instruction);
        let pid = proc.env.pid.clone();
        
        runtime.push_running_proc(proc, graph);
        runtime.run_to_complete(graph);

        if let Some(proc) = runtime.done.remove(&pid) {
            if let Some(res) = proc.result {
                Ok(res.get())
            } else {
                Ok(Val::Void)
            }
        } else if let Some(proc) = runtime.errored.remove(&pid) {
            if let Some(err) = proc.error {
                Err(err)
            } else {
                Err(Error::NotImplemented)
            }
        } else {
            Err(Error::NotImplemented)
        }
    }

    #[cfg(feature = "js")]
    /// Evaluate a single instruction.
    /// Creates a new runtime and process just for this (lightweight).
    /// Use this while parsing if needed.
    pub async fn async_eval_with_gate(graph: &RefCell<Graph>, instruction: Arc<dyn Instruction>, acquire: &js_sys::Function, release: &js_sys::Function) -> Result<Val, Error> {
        let mut runtime = Self::default();
        let proc = Process::from(instruction);
        let pid = proc.env.pid.clone();
        
        {
            let mut gr = graph.borrow_mut();
            runtime.push_running_proc(proc, &mut *gr);
        }
        
        const YIELD_INTERVAL_MS: u64 = 20;
        let mut yield_to_outer = false;
        let mut last_yield = web_time::Instant::now();
        while runtime.async_single_step_with_gate(graph, yield_to_outer, acquire, release).await {
            yield_to_outer = false;
            if last_yield.elapsed().as_millis() as u64 >= YIELD_INTERVAL_MS {
                yield_to_outer = true;
                last_yield = web_time::Instant::now();
            }
        }

        if let Some(proc) = runtime.done.remove(&pid) {
            if let Some(res) = proc.result {
                Ok(res.get())
            } else {
                Ok(Val::Void)
            }
        } else if let Some(proc) = runtime.errored.remove(&pid) {
            if let Some(err) = proc.error {
                Err(err)
            } else {
                Err(Error::NotImplemented)
            }
        } else {
            Err(Error::NotImplemented)
        }
    }
    
    #[cfg(any(feature = "js", feature = "tokio"))]
    /// Evaluate a single instruction.
    /// Creates a new runtime and process just for this (lightweight).
    /// Use this while parsing if needed.
    pub async fn async_eval(graph: &mut Graph, instruction: Arc<dyn Instruction>) -> Result<Val, Error> {
        let mut runtime = Self::default();
        let proc = Process::from(instruction);
        let pid = proc.env.pid.clone();
        
        runtime.push_running_proc(proc, graph);
        
        const YIELD_INTERVAL_MS: u64 = 20;
        let mut yield_to_outer = false;
        let mut last_yield = web_time::Instant::now();
        while runtime.async_single_step(graph, yield_to_outer).await {
            yield_to_outer = false;
            if last_yield.elapsed().as_millis() as u64 >= YIELD_INTERVAL_MS {
                yield_to_outer = true;
                last_yield = web_time::Instant::now();
            }
        }

        if let Some(proc) = runtime.done.remove(&pid) {
            if let Some(res) = proc.result {
                Ok(res.get())
            } else {
                Ok(Val::Void)
            }
        } else if let Some(proc) = runtime.errored.remove(&pid) {
            if let Some(err) = proc.error {
                Err(err)
            } else {
                Err(Error::NotImplemented)
            }
        } else {
            Err(Error::NotImplemented)
        }
    }

    #[cfg(feature = "tokio")]
    /// Set tokio runtime handle for Stof.
    pub fn set_tokio_runtime(runtime: tokio::runtime::Handle) {
        let mut tokio_handle = TOKIO_HANDLE_OVERRIDE.write();
        *tokio_handle = Some(runtime);
    }
}