summaryrefslogtreecommitdiff
path: root/chapter10b/docs/example1.gv
diff options
context:
space:
mode:
authorCliff Click <cliffc@acm.org>2026-09-29 12:21:46 -0700
committerCliff Click <cliffc@acm.org>2026-09-29 12:21:46 -0700
commit3ba6686fc991998a0a420709dfb0012bbddf77ab (patch)
tree6da4371d0ac6a0e17cfc31dad2275f1331ab3edb /chapter10b/docs/example1.gv
parentfa7d56f72455828826d0ab7e1c142ca814e6e2aa (diff)
downloadSimple-3ba6686fc991998a0a420709dfb0012bbddf77ab.tar.gz
Simple-3ba6686fc991998a0a420709dfb0012bbddf77ab.zip
Backport lazy memory splits to ch10, split into ch10a and bch10ab
Diffstat (limited to 'chapter10b/docs/example1.gv')
-rw-r--r--chapter10b/docs/example1.gv6
1 files changed, 4 insertions, 2 deletions
diff --git a/chapter10b/docs/example1.gv b/chapter10b/docs/example1.gv
index 2194ae8f..0b0a5feb 100644
--- a/chapter10b/docs/example1.gv
+++ b/chapter10b/docs/example1.gv
@@ -1,11 +1,13 @@
digraph Memory {
- rankdir=LR;
+ rankdir=BT;
node [shape=box];
M [label="Initial memory"];
X [label="Store x = 42"];
Y [label="Loop: Store y"];
- L [label="Load x -> 42"];
+ L [label="Load x (42)"];
L -> X -> M [color=blue]; Y -> M [color=green];
MemMerge -> X [color=blue]; MemMerge -> Y [color=green];
Return -> MemMerge; Return -> L;
+ { rank=same; MemMerge -> L [style=invis]; }
+ Y -> X [style=invis]; // Layout only: keep the stores in code order.
}