From 2a97030c9743d4680d698414c28e8d8739614215 Mon Sep 17 00:00:00 2001 From: Gabriel Schneider Date: Tue, 10 Nov 2026 23:25:40 -0300 Subject: design: down is deeper; a call followed down; operands without size words; the heap as a scene From the user. Direction and nearness are rules: the idea, the source, its instructions, the callee and the kernel go down the frame, a call goes down and a return comes up, and every tie runs one of those ways. The disassembly can descend: a window a call depth, the caller keeping three rows with its call waiting, a PLT stub its jump, the kernel at the bottom on vellum, with verbs descend, cross and ascend. The kernel leaves the band, which keeps the calls so far as strace writes them; the backtrace has its newest frame at the bottom. Size words are dropped from operands and a width is shown as byte cells where nothing else says it; a compare shows its values and flags, a jump the flags it reads, an indirect call its target and the slot it was read from. libc's heap is a scene of blocks that exist (a dump by fields with a size and a protected pointer read, arcs as the free list, a loupe into the tcache, the list drawn over malloc's own), storyboarded on glibc 2.44. Mocks 16 to 18. Co-Authored-By: Claude Fable 5.2 Claude-Session: https://claude.ai/code/session_016Y9MNCKgYCGiANnEwcEQxa --- design/mock/map.py | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'design/mock/map.py') diff --git a/design/mock/map.py b/design/mock/map.py index 8e91ffa..aaf90e6 100644 --- a/design/mock/map.py +++ b/design/mock/map.py @@ -102,7 +102,7 @@ def draw_map(g, step, loupe, subject=False): first = 18 if subject else 19 win["source"] = (col[0], 404 + TAG + PAD + (first - 1) * ROW, D.CW, sp["src"] * ROW) D.put(col[0]) - C.backtrace(g, 1456, ph(5), D.BT, x=col[0], note="newest on top") + C.backtrace(g, 1456, ph(5), D.BT, x=col[0], note="newest at the bottom") key(g, col[0], 1620, step) # B: 69 instructions, the function and its neighbours D.put(col[1]) -- cgit v1.3