summaryrefslogtreecommitdiff
path: root/anim/tools/list.c
diff options
context:
space:
mode:
authorGabriel Schneider <[email protected]>2026-11-10 14:48:26 -0300
committerGabriel Schneider <[email protected]>2026-11-10 15:14:31 -0300
commit7e9bf9e6e85c6c6e7a400d4fa0b43b77133ed3cb (patch)
treea6add92cd4dcbbf4c31cd1ce989d99b190258353 /anim/tools/list.c
parented46c51fe127377eb1fde8dee83da984e0f61860 (diff)
downloadcomputeranim-7e9bf9e6e85c6c6e7a400d4fa0b43b77133ed3cb.tar.gz
computeranim-7e9bf9e6e85c6c6e7a400d4fa0b43b77133ed3cb.zip
canim: animations of recordings, as a debugger's whole context with a lens beside it
A package of its own (anim/), on sketchbook's anim module and pardes's syntax. A scene opens a recording, takes a cursor into it, and declares blocks that read the moment the cursor is at: the state column (registers each followed as a pointer and inked by where it points, the stack telescope, the backtrace), the program column (the whole source, the disassembly in address order, and the scene's lens: a node-link list over a hexdump of its heap, array cells, a call tree, a syscall crossing), and ties between them. Motion is a step told as a sentence (the line fires, its effects cascade a level at a time, the mark moves on last), timed by what the step contains; walk, hurry and sprint pace a loop. Five scenes from real recordings of fib, a linked list, a sort and syscalls. First drafts, by the agent's own handover: the frame of the design's second revision, the hexdump lens and the ties; no disassembly annotations, no gallery, scenes not yet reviewed against the mocks.
Diffstat (limited to 'anim/tools/list.c')
-rw-r--r--anim/tools/list.c44
1 files changed, 44 insertions, 0 deletions
diff --git a/anim/tools/list.c b/anim/tools/list.c
new file mode 100644
index 0000000..99836c5
--- /dev/null
+++ b/anim/tools/list.c
@@ -0,0 +1,44 @@
+#include <stdlib.h>
+
+typedef struct node {
+ long value;
+ struct node *next;
+} node;
+
+node *head;
+
+void push(long value) {
+ node *n = malloc(sizeof *n);
+ n->value = value;
+ n->next = head;
+ head = n;
+}
+
+void reverse(void) {
+ node *prev = NULL;
+ node *cur = head;
+ while (cur) {
+ node *next = cur->next;
+ cur->next = prev;
+ prev = cur;
+ cur = next;
+ }
+ head = prev;
+}
+
+void clear(void) {
+ while (head) {
+ node *n = head;
+ head = n->next;
+ free(n);
+ }
+}
+
+int main(void) {
+ push(7);
+ push(12);
+ push(9);
+ reverse();
+ clear();
+ return 0;
+}