From 790de021ff6ec354b1bf53c7b57fef89074ba4f4 Mon Sep 17 00:00:00 2001 From: Ian Jackson Date: Sun, 29 Apr 2012 22:31:10 +0100 Subject: [PATCH] strategy: wip --- strategy.tex | 11 +++++++---- 1 file changed, 7 insertions(+), 4 deletions(-) diff --git a/strategy.tex b/strategy.tex index e0b1266..a3acc81 100644 --- a/strategy.tex +++ b/strategy.tex @@ -96,16 +96,19 @@ $\pqn$ involved in the cycle. For each such $\p$, after updating $\hasdep$, we recursively make a plan for $\pc' = \p$. + + \section{Execution phase} We process commit sets from the bottom up according to the relation $\hasdep$. For each commit set $\pc$ we construct $\tipfc$ from $\tipzc$, as planned. By construction, $\hasdep$ has $\patchof{L}$ as its maximum, so this operation will finish by updating -$\tipfa{\patchof{L}}$. +$\tipca{\patchof{L}}$ with $\tipfa{\patchof{L}}$. -After we are done, the result has the following properties: -\[ \eqn{Tip Inputs}{ +After we are done with each commit set $\pc$, the +new tip $\tipfc$ has the following properties: +\[ \eqn{Tip Sources}{ \bigforall_{E_i \in \set E_{\pc}} \tipfc \ge E_i }\] \[ \eqn{Tip Dependencies}{ @@ -162,7 +165,7 @@ done the execution phase for $\pcn$ and $\py$. By Perfect Contents for $\pcn$, $\tipfa \pcn \haspatch \p$ i.e. $R \haspatch \p$. So we only need to worry about $Y = R = \tipfa \pcn$. By Tip Dependencies $\tipfa \pcn \ge \tipfa \py$. -And by Tip Inputs $\tipfa \py \ge $ +And by Tip Sources $\tipfa \py \ge $ computed $\tipfa \py$, and by Perfect Contents for $\py$ -- 2.30.2