Chapter 10b: Splitting Memorylinear-chapter10b

1 files changed, 13 insertions, 0 deletions

diff --git a/docs/chapter10b/example1.gv b/docs/chapter10b/example1.gv
new file mode 100644
index 00000000..0b0a5feb
--- /dev/null
+++ b/docs/chapter10b/example1.gv
@@ -0,0 +1,13 @@
+digraph Memory {
+  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 -> 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.
+}