http://git-wip-us.apache.org/repos/asf/hbase-site/blob/1b5f3a4b/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/wal/ProcedureWALFormatReader.EntryIterator.html
----------------------------------------------------------------------
diff --git
a/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/wal/ProcedureWALFormatReader.EntryIterator.html
b/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/wal/ProcedureWALFormatReader.EntryIterator.html
index b1f9eeb..0b1b520 100644
---
a/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/wal/ProcedureWALFormatReader.EntryIterator.html
+++
b/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/wal/ProcedureWALFormatReader.EntryIterator.html
@@ -491,392 +491,396 @@
<span class="sourceLineNo">483</span> */<a name="line.483"></a>
<span class="sourceLineNo">484</span> private static boolean
isIncreasing(ProcedureProtos.Procedure current,<a name="line.484"></a>
<span class="sourceLineNo">485</span> ProcedureProtos.Procedure
candidate) {<a name="line.485"></a>
-<span class="sourceLineNo">486</span> boolean increasing =
current.getStackIdCount() <= candidate.getStackIdCount() &&<a
name="line.486"></a>
-<span class="sourceLineNo">487</span> current.getLastUpdate() <=
candidate.getLastUpdate();<a name="line.487"></a>
-<span class="sourceLineNo">488</span> if (!increasing) {<a
name="line.488"></a>
-<span class="sourceLineNo">489</span> LOG.warn("NOT INCREASING!
current=" + current + ", candidate=" + candidate);<a name="line.489"></a>
-<span class="sourceLineNo">490</span> }<a name="line.490"></a>
-<span class="sourceLineNo">491</span> return increasing;<a
name="line.491"></a>
-<span class="sourceLineNo">492</span> }<a name="line.492"></a>
-<span class="sourceLineNo">493</span><a name="line.493"></a>
-<span class="sourceLineNo">494</span> public boolean remove(long procId)
{<a name="line.494"></a>
-<span class="sourceLineNo">495</span> trackProcIds(procId);<a
name="line.495"></a>
-<span class="sourceLineNo">496</span> Entry entry =
removeFromMap(procId);<a name="line.496"></a>
-<span class="sourceLineNo">497</span> if (entry != null) {<a
name="line.497"></a>
-<span class="sourceLineNo">498</span> unlinkFromReplayList(entry);<a
name="line.498"></a>
-<span class="sourceLineNo">499</span> unlinkFromLinkList(entry);<a
name="line.499"></a>
-<span class="sourceLineNo">500</span> return true;<a
name="line.500"></a>
-<span class="sourceLineNo">501</span> }<a name="line.501"></a>
-<span class="sourceLineNo">502</span> return false;<a name="line.502"></a>
-<span class="sourceLineNo">503</span> }<a name="line.503"></a>
-<span class="sourceLineNo">504</span><a name="line.504"></a>
-<span class="sourceLineNo">505</span> private void trackProcIds(long
procId) {<a name="line.505"></a>
-<span class="sourceLineNo">506</span> minProcId = Math.min(minProcId,
procId);<a name="line.506"></a>
-<span class="sourceLineNo">507</span> maxProcId = Math.max(maxProcId,
procId);<a name="line.507"></a>
-<span class="sourceLineNo">508</span> }<a name="line.508"></a>
-<span class="sourceLineNo">509</span><a name="line.509"></a>
-<span class="sourceLineNo">510</span> public long getMinProcId() {<a
name="line.510"></a>
-<span class="sourceLineNo">511</span> return minProcId;<a
name="line.511"></a>
+<span class="sourceLineNo">486</span> // Check that the procedures we see
are 'increasing'. We used to compare<a name="line.486"></a>
+<span class="sourceLineNo">487</span> // procedure id first and then
update time but it can legitimately go backwards if the<a name="line.487"></a>
+<span class="sourceLineNo">488</span> // procedure is failed or rolled
back so that was unreliable. Was going to compare<a name="line.488"></a>
+<span class="sourceLineNo">489</span> // state but lets see if comparing
update time enough (unfortunately this issue only<a name="line.489"></a>
+<span class="sourceLineNo">490</span> // seen under load...)<a
name="line.490"></a>
+<span class="sourceLineNo">491</span> boolean increasing =
current.getLastUpdate() <= candidate.getLastUpdate();<a name="line.491"></a>
+<span class="sourceLineNo">492</span> if (!increasing) {<a
name="line.492"></a>
+<span class="sourceLineNo">493</span> LOG.warn("NOT INCREASING!
current=" + current + ", candidate=" + candidate);<a name="line.493"></a>
+<span class="sourceLineNo">494</span> }<a name="line.494"></a>
+<span class="sourceLineNo">495</span> return increasing;<a
name="line.495"></a>
+<span class="sourceLineNo">496</span> }<a name="line.496"></a>
+<span class="sourceLineNo">497</span><a name="line.497"></a>
+<span class="sourceLineNo">498</span> public boolean remove(long procId)
{<a name="line.498"></a>
+<span class="sourceLineNo">499</span> trackProcIds(procId);<a
name="line.499"></a>
+<span class="sourceLineNo">500</span> Entry entry =
removeFromMap(procId);<a name="line.500"></a>
+<span class="sourceLineNo">501</span> if (entry != null) {<a
name="line.501"></a>
+<span class="sourceLineNo">502</span> unlinkFromReplayList(entry);<a
name="line.502"></a>
+<span class="sourceLineNo">503</span> unlinkFromLinkList(entry);<a
name="line.503"></a>
+<span class="sourceLineNo">504</span> return true;<a
name="line.504"></a>
+<span class="sourceLineNo">505</span> }<a name="line.505"></a>
+<span class="sourceLineNo">506</span> return false;<a name="line.506"></a>
+<span class="sourceLineNo">507</span> }<a name="line.507"></a>
+<span class="sourceLineNo">508</span><a name="line.508"></a>
+<span class="sourceLineNo">509</span> private void trackProcIds(long
procId) {<a name="line.509"></a>
+<span class="sourceLineNo">510</span> minProcId = Math.min(minProcId,
procId);<a name="line.510"></a>
+<span class="sourceLineNo">511</span> maxProcId = Math.max(maxProcId,
procId);<a name="line.511"></a>
<span class="sourceLineNo">512</span> }<a name="line.512"></a>
<span class="sourceLineNo">513</span><a name="line.513"></a>
-<span class="sourceLineNo">514</span> public long getMaxProcId() {<a
name="line.514"></a>
-<span class="sourceLineNo">515</span> return maxProcId;<a
name="line.515"></a>
+<span class="sourceLineNo">514</span> public long getMinProcId() {<a
name="line.514"></a>
+<span class="sourceLineNo">515</span> return minProcId;<a
name="line.515"></a>
<span class="sourceLineNo">516</span> }<a name="line.516"></a>
<span class="sourceLineNo">517</span><a name="line.517"></a>
-<span class="sourceLineNo">518</span> public boolean contains(long procId)
{<a name="line.518"></a>
-<span class="sourceLineNo">519</span> return getProcedure(procId) !=
null;<a name="line.519"></a>
+<span class="sourceLineNo">518</span> public long getMaxProcId() {<a
name="line.518"></a>
+<span class="sourceLineNo">519</span> return maxProcId;<a
name="line.519"></a>
<span class="sourceLineNo">520</span> }<a name="line.520"></a>
<span class="sourceLineNo">521</span><a name="line.521"></a>
-<span class="sourceLineNo">522</span> public boolean isEmpty() {<a
name="line.522"></a>
-<span class="sourceLineNo">523</span> return replayOrderHead == null;<a
name="line.523"></a>
+<span class="sourceLineNo">522</span> public boolean contains(long procId)
{<a name="line.522"></a>
+<span class="sourceLineNo">523</span> return getProcedure(procId) !=
null;<a name="line.523"></a>
<span class="sourceLineNo">524</span> }<a name="line.524"></a>
<span class="sourceLineNo">525</span><a name="line.525"></a>
-<span class="sourceLineNo">526</span> public void clear() {<a
name="line.526"></a>
-<span class="sourceLineNo">527</span> for (int i = 0; i <
procedureMap.length; ++i) {<a name="line.527"></a>
-<span class="sourceLineNo">528</span> procedureMap[i] = null;<a
name="line.528"></a>
-<span class="sourceLineNo">529</span> }<a name="line.529"></a>
-<span class="sourceLineNo">530</span> replayOrderHead = null;<a
name="line.530"></a>
-<span class="sourceLineNo">531</span> replayOrderTail = null;<a
name="line.531"></a>
-<span class="sourceLineNo">532</span> rootHead = null;<a
name="line.532"></a>
-<span class="sourceLineNo">533</span> childUnlinkedHead = null;<a
name="line.533"></a>
-<span class="sourceLineNo">534</span> minProcId = Long.MAX_VALUE;<a
name="line.534"></a>
-<span class="sourceLineNo">535</span> maxProcId = Long.MIN_VALUE;<a
name="line.535"></a>
-<span class="sourceLineNo">536</span> }<a name="line.536"></a>
-<span class="sourceLineNo">537</span><a name="line.537"></a>
-<span class="sourceLineNo">538</span> /*<a name="line.538"></a>
-<span class="sourceLineNo">539</span> * Merges two WalProcedureMap,<a
name="line.539"></a>
-<span class="sourceLineNo">540</span> * the target is the "global" map,
the source is the "local" map.<a name="line.540"></a>
-<span class="sourceLineNo">541</span> * - The entries in the hashtables
are guaranteed to be unique.<a name="line.541"></a>
-<span class="sourceLineNo">542</span> * On replay we don't load
procedures that already exist in the "global"<a name="line.542"></a>
-<span class="sourceLineNo">543</span> * map (the one we are merging the
"local" in to).<a name="line.543"></a>
-<span class="sourceLineNo">544</span> * - The replayOrderList of the
"local" nao will be appended to the "global"<a name="line.544"></a>
-<span class="sourceLineNo">545</span> * map replay list.<a
name="line.545"></a>
-<span class="sourceLineNo">546</span> * - The "local" map will be cleared
at the end of the operation.<a name="line.546"></a>
-<span class="sourceLineNo">547</span> */<a name="line.547"></a>
-<span class="sourceLineNo">548</span> public void mergeTail(WalProcedureMap
other) {<a name="line.548"></a>
-<span class="sourceLineNo">549</span> for (Entry p =
other.replayOrderHead; p != null; p = p.replayNext) {<a name="line.549"></a>
-<span class="sourceLineNo">550</span> int slotIndex =
getMapSlot(p.getProcId());<a name="line.550"></a>
-<span class="sourceLineNo">551</span> p.hashNext =
procedureMap[slotIndex];<a name="line.551"></a>
-<span class="sourceLineNo">552</span> procedureMap[slotIndex] = p;<a
name="line.552"></a>
-<span class="sourceLineNo">553</span> }<a name="line.553"></a>
-<span class="sourceLineNo">554</span><a name="line.554"></a>
-<span class="sourceLineNo">555</span> if (replayOrderHead == null) {<a
name="line.555"></a>
-<span class="sourceLineNo">556</span> replayOrderHead =
other.replayOrderHead;<a name="line.556"></a>
-<span class="sourceLineNo">557</span> replayOrderTail =
other.replayOrderTail;<a name="line.557"></a>
-<span class="sourceLineNo">558</span> rootHead = other.rootHead;<a
name="line.558"></a>
-<span class="sourceLineNo">559</span> childUnlinkedHead =
other.childUnlinkedHead;<a name="line.559"></a>
-<span class="sourceLineNo">560</span> } else {<a name="line.560"></a>
-<span class="sourceLineNo">561</span> // append replay list<a
name="line.561"></a>
-<span class="sourceLineNo">562</span> assert replayOrderTail.replayNext
== null;<a name="line.562"></a>
-<span class="sourceLineNo">563</span> assert
other.replayOrderHead.replayPrev == null;<a name="line.563"></a>
-<span class="sourceLineNo">564</span> replayOrderTail.replayNext =
other.replayOrderHead;<a name="line.564"></a>
-<span class="sourceLineNo">565</span> other.replayOrderHead.replayPrev
= replayOrderTail;<a name="line.565"></a>
-<span class="sourceLineNo">566</span> replayOrderTail =
other.replayOrderTail;<a name="line.566"></a>
-<span class="sourceLineNo">567</span><a name="line.567"></a>
-<span class="sourceLineNo">568</span> // merge rootHead<a
name="line.568"></a>
-<span class="sourceLineNo">569</span> if (rootHead == null) {<a
name="line.569"></a>
-<span class="sourceLineNo">570</span> rootHead = other.rootHead;<a
name="line.570"></a>
-<span class="sourceLineNo">571</span> } else if (other.rootHead !=
null) {<a name="line.571"></a>
-<span class="sourceLineNo">572</span> Entry otherTail =
findLinkListTail(other.rootHead);<a name="line.572"></a>
-<span class="sourceLineNo">573</span> otherTail.linkNext =
rootHead;<a name="line.573"></a>
-<span class="sourceLineNo">574</span> rootHead.linkPrev =
otherTail;<a name="line.574"></a>
-<span class="sourceLineNo">575</span> rootHead = other.rootHead;<a
name="line.575"></a>
-<span class="sourceLineNo">576</span> }<a name="line.576"></a>
-<span class="sourceLineNo">577</span><a name="line.577"></a>
-<span class="sourceLineNo">578</span> // merge childUnlinkedHead<a
name="line.578"></a>
-<span class="sourceLineNo">579</span> if (childUnlinkedHead == null)
{<a name="line.579"></a>
-<span class="sourceLineNo">580</span> childUnlinkedHead =
other.childUnlinkedHead;<a name="line.580"></a>
-<span class="sourceLineNo">581</span> } else if
(other.childUnlinkedHead != null) {<a name="line.581"></a>
-<span class="sourceLineNo">582</span> Entry otherTail =
findLinkListTail(other.childUnlinkedHead);<a name="line.582"></a>
-<span class="sourceLineNo">583</span> otherTail.linkNext =
childUnlinkedHead;<a name="line.583"></a>
-<span class="sourceLineNo">584</span> childUnlinkedHead.linkPrev =
otherTail;<a name="line.584"></a>
-<span class="sourceLineNo">585</span> childUnlinkedHead =
other.childUnlinkedHead;<a name="line.585"></a>
-<span class="sourceLineNo">586</span> }<a name="line.586"></a>
-<span class="sourceLineNo">587</span> }<a name="line.587"></a>
-<span class="sourceLineNo">588</span> maxProcId = Math.max(maxProcId,
other.maxProcId);<a name="line.588"></a>
-<span class="sourceLineNo">589</span> minProcId = Math.max(minProcId,
other.minProcId);<a name="line.589"></a>
-<span class="sourceLineNo">590</span><a name="line.590"></a>
-<span class="sourceLineNo">591</span> other.clear();<a
name="line.591"></a>
-<span class="sourceLineNo">592</span> }<a name="line.592"></a>
-<span class="sourceLineNo">593</span><a name="line.593"></a>
-<span class="sourceLineNo">594</span> /*<a name="line.594"></a>
-<span class="sourceLineNo">595</span> * Returns an EntryIterator with the
list of procedures ready<a name="line.595"></a>
-<span class="sourceLineNo">596</span> * to be added to the executor.<a
name="line.596"></a>
-<span class="sourceLineNo">597</span> * A Procedure is ready if its
children and parent are ready.<a name="line.597"></a>
-<span class="sourceLineNo">598</span> */<a name="line.598"></a>
-<span class="sourceLineNo">599</span> public EntryIterator fetchReady() {<a
name="line.599"></a>
-<span class="sourceLineNo">600</span> buildGraph();<a name="line.600"></a>
-<span class="sourceLineNo">601</span><a name="line.601"></a>
-<span class="sourceLineNo">602</span> Entry readyHead = null;<a
name="line.602"></a>
-<span class="sourceLineNo">603</span> Entry readyTail = null;<a
name="line.603"></a>
-<span class="sourceLineNo">604</span> Entry p = replayOrderHead;<a
name="line.604"></a>
-<span class="sourceLineNo">605</span> while (p != null) {<a
name="line.605"></a>
-<span class="sourceLineNo">606</span> Entry next = p.replayNext;<a
name="line.606"></a>
-<span class="sourceLineNo">607</span> if (p.isReady()) {<a
name="line.607"></a>
-<span class="sourceLineNo">608</span> unlinkFromReplayList(p);<a
name="line.608"></a>
-<span class="sourceLineNo">609</span> if (readyTail != null) {<a
name="line.609"></a>
-<span class="sourceLineNo">610</span> readyTail.replayNext = p;<a
name="line.610"></a>
-<span class="sourceLineNo">611</span> p.replayPrev = readyTail;<a
name="line.611"></a>
-<span class="sourceLineNo">612</span> } else {<a name="line.612"></a>
-<span class="sourceLineNo">613</span> p.replayPrev = null;<a
name="line.613"></a>
-<span class="sourceLineNo">614</span> readyHead = p;<a
name="line.614"></a>
-<span class="sourceLineNo">615</span> }<a name="line.615"></a>
-<span class="sourceLineNo">616</span> readyTail = p;<a
name="line.616"></a>
-<span class="sourceLineNo">617</span> p.replayNext = null;<a
name="line.617"></a>
-<span class="sourceLineNo">618</span> }<a name="line.618"></a>
-<span class="sourceLineNo">619</span> p = next;<a name="line.619"></a>
-<span class="sourceLineNo">620</span> }<a name="line.620"></a>
-<span class="sourceLineNo">621</span> // we need the hash-table lookups
for parents, so this must be done<a name="line.621"></a>
-<span class="sourceLineNo">622</span> // out of the loop where we check
isReadyToRun()<a name="line.622"></a>
-<span class="sourceLineNo">623</span> for (p = readyHead; p != null; p =
p.replayNext) {<a name="line.623"></a>
-<span class="sourceLineNo">624</span> removeFromMap(p.getProcId());<a
name="line.624"></a>
-<span class="sourceLineNo">625</span> unlinkFromLinkList(p);<a
name="line.625"></a>
-<span class="sourceLineNo">626</span> }<a name="line.626"></a>
-<span class="sourceLineNo">627</span> return readyHead != null ? new
EntryIterator(readyHead) : null;<a name="line.627"></a>
-<span class="sourceLineNo">628</span> }<a name="line.628"></a>
-<span class="sourceLineNo">629</span><a name="line.629"></a>
-<span class="sourceLineNo">630</span> /*<a name="line.630"></a>
-<span class="sourceLineNo">631</span> * Drain this map and return all
procedures in it.<a name="line.631"></a>
-<span class="sourceLineNo">632</span> */<a name="line.632"></a>
-<span class="sourceLineNo">633</span> public EntryIterator fetchAll() {<a
name="line.633"></a>
-<span class="sourceLineNo">634</span> Entry head = replayOrderHead;<a
name="line.634"></a>
-<span class="sourceLineNo">635</span> for (Entry p = head; p != null; p =
p.replayNext) {<a name="line.635"></a>
-<span class="sourceLineNo">636</span> removeFromMap(p.getProcId());<a
name="line.636"></a>
-<span class="sourceLineNo">637</span> }<a name="line.637"></a>
-<span class="sourceLineNo">638</span> for (int i = 0; i <
procedureMap.length; ++i) {<a name="line.638"></a>
-<span class="sourceLineNo">639</span> assert procedureMap[i] == null :
"map not empty i=" + i;<a name="line.639"></a>
-<span class="sourceLineNo">640</span> }<a name="line.640"></a>
-<span class="sourceLineNo">641</span> replayOrderHead = null;<a
name="line.641"></a>
-<span class="sourceLineNo">642</span> replayOrderTail = null;<a
name="line.642"></a>
-<span class="sourceLineNo">643</span> childUnlinkedHead = null;<a
name="line.643"></a>
-<span class="sourceLineNo">644</span> rootHead = null;<a
name="line.644"></a>
-<span class="sourceLineNo">645</span> return head != null ? new
EntryIterator(head) : null;<a name="line.645"></a>
-<span class="sourceLineNo">646</span> }<a name="line.646"></a>
-<span class="sourceLineNo">647</span><a name="line.647"></a>
-<span class="sourceLineNo">648</span> private void buildGraph() {<a
name="line.648"></a>
-<span class="sourceLineNo">649</span> Entry p = childUnlinkedHead;<a
name="line.649"></a>
-<span class="sourceLineNo">650</span> while (p != null) {<a
name="line.650"></a>
-<span class="sourceLineNo">651</span> Entry next = p.linkNext;<a
name="line.651"></a>
-<span class="sourceLineNo">652</span> Entry rootProc =
getRootProcedure(p);<a name="line.652"></a>
-<span class="sourceLineNo">653</span> if (rootProc != null) {<a
name="line.653"></a>
-<span class="sourceLineNo">654</span> rootProc.childHead =
addToLinkList(p, rootProc.childHead);<a name="line.654"></a>
-<span class="sourceLineNo">655</span> }<a name="line.655"></a>
-<span class="sourceLineNo">656</span> p = next;<a name="line.656"></a>
-<span class="sourceLineNo">657</span> }<a name="line.657"></a>
-<span class="sourceLineNo">658</span><a name="line.658"></a>
-<span class="sourceLineNo">659</span> for (p = rootHead; p != null; p =
p.linkNext) {<a name="line.659"></a>
-<span class="sourceLineNo">660</span> checkReadyToRun(p);<a
name="line.660"></a>
+<span class="sourceLineNo">526</span> public boolean isEmpty() {<a
name="line.526"></a>
+<span class="sourceLineNo">527</span> return replayOrderHead == null;<a
name="line.527"></a>
+<span class="sourceLineNo">528</span> }<a name="line.528"></a>
+<span class="sourceLineNo">529</span><a name="line.529"></a>
+<span class="sourceLineNo">530</span> public void clear() {<a
name="line.530"></a>
+<span class="sourceLineNo">531</span> for (int i = 0; i <
procedureMap.length; ++i) {<a name="line.531"></a>
+<span class="sourceLineNo">532</span> procedureMap[i] = null;<a
name="line.532"></a>
+<span class="sourceLineNo">533</span> }<a name="line.533"></a>
+<span class="sourceLineNo">534</span> replayOrderHead = null;<a
name="line.534"></a>
+<span class="sourceLineNo">535</span> replayOrderTail = null;<a
name="line.535"></a>
+<span class="sourceLineNo">536</span> rootHead = null;<a
name="line.536"></a>
+<span class="sourceLineNo">537</span> childUnlinkedHead = null;<a
name="line.537"></a>
+<span class="sourceLineNo">538</span> minProcId = Long.MAX_VALUE;<a
name="line.538"></a>
+<span class="sourceLineNo">539</span> maxProcId = Long.MIN_VALUE;<a
name="line.539"></a>
+<span class="sourceLineNo">540</span> }<a name="line.540"></a>
+<span class="sourceLineNo">541</span><a name="line.541"></a>
+<span class="sourceLineNo">542</span> /*<a name="line.542"></a>
+<span class="sourceLineNo">543</span> * Merges two WalProcedureMap,<a
name="line.543"></a>
+<span class="sourceLineNo">544</span> * the target is the "global" map,
the source is the "local" map.<a name="line.544"></a>
+<span class="sourceLineNo">545</span> * - The entries in the hashtables
are guaranteed to be unique.<a name="line.545"></a>
+<span class="sourceLineNo">546</span> * On replay we don't load
procedures that already exist in the "global"<a name="line.546"></a>
+<span class="sourceLineNo">547</span> * map (the one we are merging the
"local" in to).<a name="line.547"></a>
+<span class="sourceLineNo">548</span> * - The replayOrderList of the
"local" nao will be appended to the "global"<a name="line.548"></a>
+<span class="sourceLineNo">549</span> * map replay list.<a
name="line.549"></a>
+<span class="sourceLineNo">550</span> * - The "local" map will be cleared
at the end of the operation.<a name="line.550"></a>
+<span class="sourceLineNo">551</span> */<a name="line.551"></a>
+<span class="sourceLineNo">552</span> public void mergeTail(WalProcedureMap
other) {<a name="line.552"></a>
+<span class="sourceLineNo">553</span> for (Entry p =
other.replayOrderHead; p != null; p = p.replayNext) {<a name="line.553"></a>
+<span class="sourceLineNo">554</span> int slotIndex =
getMapSlot(p.getProcId());<a name="line.554"></a>
+<span class="sourceLineNo">555</span> p.hashNext =
procedureMap[slotIndex];<a name="line.555"></a>
+<span class="sourceLineNo">556</span> procedureMap[slotIndex] = p;<a
name="line.556"></a>
+<span class="sourceLineNo">557</span> }<a name="line.557"></a>
+<span class="sourceLineNo">558</span><a name="line.558"></a>
+<span class="sourceLineNo">559</span> if (replayOrderHead == null) {<a
name="line.559"></a>
+<span class="sourceLineNo">560</span> replayOrderHead =
other.replayOrderHead;<a name="line.560"></a>
+<span class="sourceLineNo">561</span> replayOrderTail =
other.replayOrderTail;<a name="line.561"></a>
+<span class="sourceLineNo">562</span> rootHead = other.rootHead;<a
name="line.562"></a>
+<span class="sourceLineNo">563</span> childUnlinkedHead =
other.childUnlinkedHead;<a name="line.563"></a>
+<span class="sourceLineNo">564</span> } else {<a name="line.564"></a>
+<span class="sourceLineNo">565</span> // append replay list<a
name="line.565"></a>
+<span class="sourceLineNo">566</span> assert replayOrderTail.replayNext
== null;<a name="line.566"></a>
+<span class="sourceLineNo">567</span> assert
other.replayOrderHead.replayPrev == null;<a name="line.567"></a>
+<span class="sourceLineNo">568</span> replayOrderTail.replayNext =
other.replayOrderHead;<a name="line.568"></a>
+<span class="sourceLineNo">569</span> other.replayOrderHead.replayPrev
= replayOrderTail;<a name="line.569"></a>
+<span class="sourceLineNo">570</span> replayOrderTail =
other.replayOrderTail;<a name="line.570"></a>
+<span class="sourceLineNo">571</span><a name="line.571"></a>
+<span class="sourceLineNo">572</span> // merge rootHead<a
name="line.572"></a>
+<span class="sourceLineNo">573</span> if (rootHead == null) {<a
name="line.573"></a>
+<span class="sourceLineNo">574</span> rootHead = other.rootHead;<a
name="line.574"></a>
+<span class="sourceLineNo">575</span> } else if (other.rootHead !=
null) {<a name="line.575"></a>
+<span class="sourceLineNo">576</span> Entry otherTail =
findLinkListTail(other.rootHead);<a name="line.576"></a>
+<span class="sourceLineNo">577</span> otherTail.linkNext =
rootHead;<a name="line.577"></a>
+<span class="sourceLineNo">578</span> rootHead.linkPrev =
otherTail;<a name="line.578"></a>
+<span class="sourceLineNo">579</span> rootHead = other.rootHead;<a
name="line.579"></a>
+<span class="sourceLineNo">580</span> }<a name="line.580"></a>
+<span class="sourceLineNo">581</span><a name="line.581"></a>
+<span class="sourceLineNo">582</span> // merge childUnlinkedHead<a
name="line.582"></a>
+<span class="sourceLineNo">583</span> if (childUnlinkedHead == null)
{<a name="line.583"></a>
+<span class="sourceLineNo">584</span> childUnlinkedHead =
other.childUnlinkedHead;<a name="line.584"></a>
+<span class="sourceLineNo">585</span> } else if
(other.childUnlinkedHead != null) {<a name="line.585"></a>
+<span class="sourceLineNo">586</span> Entry otherTail =
findLinkListTail(other.childUnlinkedHead);<a name="line.586"></a>
+<span class="sourceLineNo">587</span> otherTail.linkNext =
childUnlinkedHead;<a name="line.587"></a>
+<span class="sourceLineNo">588</span> childUnlinkedHead.linkPrev =
otherTail;<a name="line.588"></a>
+<span class="sourceLineNo">589</span> childUnlinkedHead =
other.childUnlinkedHead;<a name="line.589"></a>
+<span class="sourceLineNo">590</span> }<a name="line.590"></a>
+<span class="sourceLineNo">591</span> }<a name="line.591"></a>
+<span class="sourceLineNo">592</span> maxProcId = Math.max(maxProcId,
other.maxProcId);<a name="line.592"></a>
+<span class="sourceLineNo">593</span> minProcId = Math.max(minProcId,
other.minProcId);<a name="line.593"></a>
+<span class="sourceLineNo">594</span><a name="line.594"></a>
+<span class="sourceLineNo">595</span> other.clear();<a
name="line.595"></a>
+<span class="sourceLineNo">596</span> }<a name="line.596"></a>
+<span class="sourceLineNo">597</span><a name="line.597"></a>
+<span class="sourceLineNo">598</span> /*<a name="line.598"></a>
+<span class="sourceLineNo">599</span> * Returns an EntryIterator with the
list of procedures ready<a name="line.599"></a>
+<span class="sourceLineNo">600</span> * to be added to the executor.<a
name="line.600"></a>
+<span class="sourceLineNo">601</span> * A Procedure is ready if its
children and parent are ready.<a name="line.601"></a>
+<span class="sourceLineNo">602</span> */<a name="line.602"></a>
+<span class="sourceLineNo">603</span> public EntryIterator fetchReady() {<a
name="line.603"></a>
+<span class="sourceLineNo">604</span> buildGraph();<a name="line.604"></a>
+<span class="sourceLineNo">605</span><a name="line.605"></a>
+<span class="sourceLineNo">606</span> Entry readyHead = null;<a
name="line.606"></a>
+<span class="sourceLineNo">607</span> Entry readyTail = null;<a
name="line.607"></a>
+<span class="sourceLineNo">608</span> Entry p = replayOrderHead;<a
name="line.608"></a>
+<span class="sourceLineNo">609</span> while (p != null) {<a
name="line.609"></a>
+<span class="sourceLineNo">610</span> Entry next = p.replayNext;<a
name="line.610"></a>
+<span class="sourceLineNo">611</span> if (p.isReady()) {<a
name="line.611"></a>
+<span class="sourceLineNo">612</span> unlinkFromReplayList(p);<a
name="line.612"></a>
+<span class="sourceLineNo">613</span> if (readyTail != null) {<a
name="line.613"></a>
+<span class="sourceLineNo">614</span> readyTail.replayNext = p;<a
name="line.614"></a>
+<span class="sourceLineNo">615</span> p.replayPrev = readyTail;<a
name="line.615"></a>
+<span class="sourceLineNo">616</span> } else {<a name="line.616"></a>
+<span class="sourceLineNo">617</span> p.replayPrev = null;<a
name="line.617"></a>
+<span class="sourceLineNo">618</span> readyHead = p;<a
name="line.618"></a>
+<span class="sourceLineNo">619</span> }<a name="line.619"></a>
+<span class="sourceLineNo">620</span> readyTail = p;<a
name="line.620"></a>
+<span class="sourceLineNo">621</span> p.replayNext = null;<a
name="line.621"></a>
+<span class="sourceLineNo">622</span> }<a name="line.622"></a>
+<span class="sourceLineNo">623</span> p = next;<a name="line.623"></a>
+<span class="sourceLineNo">624</span> }<a name="line.624"></a>
+<span class="sourceLineNo">625</span> // we need the hash-table lookups
for parents, so this must be done<a name="line.625"></a>
+<span class="sourceLineNo">626</span> // out of the loop where we check
isReadyToRun()<a name="line.626"></a>
+<span class="sourceLineNo">627</span> for (p = readyHead; p != null; p =
p.replayNext) {<a name="line.627"></a>
+<span class="sourceLineNo">628</span> removeFromMap(p.getProcId());<a
name="line.628"></a>
+<span class="sourceLineNo">629</span> unlinkFromLinkList(p);<a
name="line.629"></a>
+<span class="sourceLineNo">630</span> }<a name="line.630"></a>
+<span class="sourceLineNo">631</span> return readyHead != null ? new
EntryIterator(readyHead) : null;<a name="line.631"></a>
+<span class="sourceLineNo">632</span> }<a name="line.632"></a>
+<span class="sourceLineNo">633</span><a name="line.633"></a>
+<span class="sourceLineNo">634</span> /*<a name="line.634"></a>
+<span class="sourceLineNo">635</span> * Drain this map and return all
procedures in it.<a name="line.635"></a>
+<span class="sourceLineNo">636</span> */<a name="line.636"></a>
+<span class="sourceLineNo">637</span> public EntryIterator fetchAll() {<a
name="line.637"></a>
+<span class="sourceLineNo">638</span> Entry head = replayOrderHead;<a
name="line.638"></a>
+<span class="sourceLineNo">639</span> for (Entry p = head; p != null; p =
p.replayNext) {<a name="line.639"></a>
+<span class="sourceLineNo">640</span> removeFromMap(p.getProcId());<a
name="line.640"></a>
+<span class="sourceLineNo">641</span> }<a name="line.641"></a>
+<span class="sourceLineNo">642</span> for (int i = 0; i <
procedureMap.length; ++i) {<a name="line.642"></a>
+<span class="sourceLineNo">643</span> assert procedureMap[i] == null :
"map not empty i=" + i;<a name="line.643"></a>
+<span class="sourceLineNo">644</span> }<a name="line.644"></a>
+<span class="sourceLineNo">645</span> replayOrderHead = null;<a
name="line.645"></a>
+<span class="sourceLineNo">646</span> replayOrderTail = null;<a
name="line.646"></a>
+<span class="sourceLineNo">647</span> childUnlinkedHead = null;<a
name="line.647"></a>
+<span class="sourceLineNo">648</span> rootHead = null;<a
name="line.648"></a>
+<span class="sourceLineNo">649</span> return head != null ? new
EntryIterator(head) : null;<a name="line.649"></a>
+<span class="sourceLineNo">650</span> }<a name="line.650"></a>
+<span class="sourceLineNo">651</span><a name="line.651"></a>
+<span class="sourceLineNo">652</span> private void buildGraph() {<a
name="line.652"></a>
+<span class="sourceLineNo">653</span> Entry p = childUnlinkedHead;<a
name="line.653"></a>
+<span class="sourceLineNo">654</span> while (p != null) {<a
name="line.654"></a>
+<span class="sourceLineNo">655</span> Entry next = p.linkNext;<a
name="line.655"></a>
+<span class="sourceLineNo">656</span> Entry rootProc =
getRootProcedure(p);<a name="line.656"></a>
+<span class="sourceLineNo">657</span> if (rootProc != null) {<a
name="line.657"></a>
+<span class="sourceLineNo">658</span> rootProc.childHead =
addToLinkList(p, rootProc.childHead);<a name="line.658"></a>
+<span class="sourceLineNo">659</span> }<a name="line.659"></a>
+<span class="sourceLineNo">660</span> p = next;<a name="line.660"></a>
<span class="sourceLineNo">661</span> }<a name="line.661"></a>
-<span class="sourceLineNo">662</span> }<a name="line.662"></a>
-<span class="sourceLineNo">663</span><a name="line.663"></a>
-<span class="sourceLineNo">664</span> private Entry getRootProcedure(Entry
entry) {<a name="line.664"></a>
-<span class="sourceLineNo">665</span> while (entry != null &&
entry.hasParent()) {<a name="line.665"></a>
-<span class="sourceLineNo">666</span> entry =
getProcedure(entry.getParentId());<a name="line.666"></a>
-<span class="sourceLineNo">667</span> }<a name="line.667"></a>
-<span class="sourceLineNo">668</span> return entry;<a name="line.668"></a>
-<span class="sourceLineNo">669</span> }<a name="line.669"></a>
-<span class="sourceLineNo">670</span><a name="line.670"></a>
-<span class="sourceLineNo">671</span> /*<a name="line.671"></a>
-<span class="sourceLineNo">672</span> * (see the comprehensive explanation
in the beginning of the file)<a name="line.672"></a>
-<span class="sourceLineNo">673</span> * A Procedure is ready when parent
and children are ready.<a name="line.673"></a>
-<span class="sourceLineNo">674</span> * "ready" means that we all the
information that we need in-memory.<a name="line.674"></a>
-<span class="sourceLineNo">675</span> *<a name="line.675"></a>
-<span class="sourceLineNo">676</span> * Example-1:<a name="line.676"></a>
-<span class="sourceLineNo">677</span> * We have two WALs, we start reading
from the newest (wal-2)<a name="line.677"></a>
-<span class="sourceLineNo">678</span> * wal-2 | C B |<a
name="line.678"></a>
-<span class="sourceLineNo">679</span> * wal-1 | A B C |<a
name="line.679"></a>
-<span class="sourceLineNo">680</span> *<a name="line.680"></a>
-<span class="sourceLineNo">681</span> * If C and B don't depend on A (A is
not the parent), we can start them<a name="line.681"></a>
-<span class="sourceLineNo">682</span> * before reading wal-1. If B is the
only one with parent A we can start C.<a name="line.682"></a>
-<span class="sourceLineNo">683</span> * We have to read one more WAL
before being able to start B.<a name="line.683"></a>
+<span class="sourceLineNo">662</span><a name="line.662"></a>
+<span class="sourceLineNo">663</span> for (p = rootHead; p != null; p =
p.linkNext) {<a name="line.663"></a>
+<span class="sourceLineNo">664</span> checkReadyToRun(p);<a
name="line.664"></a>
+<span class="sourceLineNo">665</span> }<a name="line.665"></a>
+<span class="sourceLineNo">666</span> }<a name="line.666"></a>
+<span class="sourceLineNo">667</span><a name="line.667"></a>
+<span class="sourceLineNo">668</span> private Entry getRootProcedure(Entry
entry) {<a name="line.668"></a>
+<span class="sourceLineNo">669</span> while (entry != null &&
entry.hasParent()) {<a name="line.669"></a>
+<span class="sourceLineNo">670</span> entry =
getProcedure(entry.getParentId());<a name="line.670"></a>
+<span class="sourceLineNo">671</span> }<a name="line.671"></a>
+<span class="sourceLineNo">672</span> return entry;<a name="line.672"></a>
+<span class="sourceLineNo">673</span> }<a name="line.673"></a>
+<span class="sourceLineNo">674</span><a name="line.674"></a>
+<span class="sourceLineNo">675</span> /*<a name="line.675"></a>
+<span class="sourceLineNo">676</span> * (see the comprehensive explanation
in the beginning of the file)<a name="line.676"></a>
+<span class="sourceLineNo">677</span> * A Procedure is ready when parent
and children are ready.<a name="line.677"></a>
+<span class="sourceLineNo">678</span> * "ready" means that we all the
information that we need in-memory.<a name="line.678"></a>
+<span class="sourceLineNo">679</span> *<a name="line.679"></a>
+<span class="sourceLineNo">680</span> * Example-1:<a name="line.680"></a>
+<span class="sourceLineNo">681</span> * We have two WALs, we start reading
from the newest (wal-2)<a name="line.681"></a>
+<span class="sourceLineNo">682</span> * wal-2 | C B |<a
name="line.682"></a>
+<span class="sourceLineNo">683</span> * wal-1 | A B C |<a
name="line.683"></a>
<span class="sourceLineNo">684</span> *<a name="line.684"></a>
-<span class="sourceLineNo">685</span> * How do we know with the only
information in B that we are not ready.<a name="line.685"></a>
-<span class="sourceLineNo">686</span> * - easy case, the parent is
missing from the global map<a name="line.686"></a>
-<span class="sourceLineNo">687</span> * - more complex case we look at
the Stack IDs.<a name="line.687"></a>
+<span class="sourceLineNo">685</span> * If C and B don't depend on A (A is
not the parent), we can start them<a name="line.685"></a>
+<span class="sourceLineNo">686</span> * before reading wal-1. If B is the
only one with parent A we can start C.<a name="line.686"></a>
+<span class="sourceLineNo">687</span> * We have to read one more WAL
before being able to start B.<a name="line.687"></a>
<span class="sourceLineNo">688</span> *<a name="line.688"></a>
-<span class="sourceLineNo">689</span> * The Stack-IDs are added to the
procedure order as an incremental index<a name="line.689"></a>
-<span class="sourceLineNo">690</span> * tracking how many times that
procedure was executed, which is equivalent<a name="line.690"></a>
-<span class="sourceLineNo">691</span> * to the number of times we wrote
the procedure to the WAL.<a name="line.691"></a>
-<span class="sourceLineNo">692</span> * In the example above:<a
name="line.692"></a>
-<span class="sourceLineNo">693</span> * wal-2: B has stackId = [1, 2]<a
name="line.693"></a>
-<span class="sourceLineNo">694</span> * wal-1: B has stackId = [1]<a
name="line.694"></a>
-<span class="sourceLineNo">695</span> * wal-1: A has stackId = [0]<a
name="line.695"></a>
-<span class="sourceLineNo">696</span> *<a name="line.696"></a>
-<span class="sourceLineNo">697</span> * Since we know that the Stack-IDs
are incremental for a Procedure,<a name="line.697"></a>
-<span class="sourceLineNo">698</span> * we notice that there is a gap in
the stackIds of B, so something was<a name="line.698"></a>
-<span class="sourceLineNo">699</span> * executed before.<a
name="line.699"></a>
-<span class="sourceLineNo">700</span> * To identify when a Procedure is
ready we do the sum of the stackIds of<a name="line.700"></a>
-<span class="sourceLineNo">701</span> * the procedure and the parent. if
the stackIdSum is equal to the<a name="line.701"></a>
-<span class="sourceLineNo">702</span> * sum of {1..maxStackId} then
everything we need is available.<a name="line.702"></a>
-<span class="sourceLineNo">703</span> *<a name="line.703"></a>
-<span class="sourceLineNo">704</span> * Example-2<a name="line.704"></a>
-<span class="sourceLineNo">705</span> * wal-2 | A | A
stackIds = [0, 2]<a name="line.705"></a>
-<span class="sourceLineNo">706</span> * wal-1 | A B | B
stackIds = [1]<a name="line.706"></a>
+<span class="sourceLineNo">689</span> * How do we know with the only
information in B that we are not ready.<a name="line.689"></a>
+<span class="sourceLineNo">690</span> * - easy case, the parent is
missing from the global map<a name="line.690"></a>
+<span class="sourceLineNo">691</span> * - more complex case we look at
the Stack IDs.<a name="line.691"></a>
+<span class="sourceLineNo">692</span> *<a name="line.692"></a>
+<span class="sourceLineNo">693</span> * The Stack-IDs are added to the
procedure order as an incremental index<a name="line.693"></a>
+<span class="sourceLineNo">694</span> * tracking how many times that
procedure was executed, which is equivalent<a name="line.694"></a>
+<span class="sourceLineNo">695</span> * to the number of times we wrote
the procedure to the WAL.<a name="line.695"></a>
+<span class="sourceLineNo">696</span> * In the example above:<a
name="line.696"></a>
+<span class="sourceLineNo">697</span> * wal-2: B has stackId = [1, 2]<a
name="line.697"></a>
+<span class="sourceLineNo">698</span> * wal-1: B has stackId = [1]<a
name="line.698"></a>
+<span class="sourceLineNo">699</span> * wal-1: A has stackId = [0]<a
name="line.699"></a>
+<span class="sourceLineNo">700</span> *<a name="line.700"></a>
+<span class="sourceLineNo">701</span> * Since we know that the Stack-IDs
are incremental for a Procedure,<a name="line.701"></a>
+<span class="sourceLineNo">702</span> * we notice that there is a gap in
the stackIds of B, so something was<a name="line.702"></a>
+<span class="sourceLineNo">703</span> * executed before.<a
name="line.703"></a>
+<span class="sourceLineNo">704</span> * To identify when a Procedure is
ready we do the sum of the stackIds of<a name="line.704"></a>
+<span class="sourceLineNo">705</span> * the procedure and the parent. if
the stackIdSum is equal to the<a name="line.705"></a>
+<span class="sourceLineNo">706</span> * sum of {1..maxStackId} then
everything we need is available.<a name="line.706"></a>
<span class="sourceLineNo">707</span> *<a name="line.707"></a>
-<span class="sourceLineNo">708</span> * There is a gap between A stackIds
so something was executed in between.<a name="line.708"></a>
-<span class="sourceLineNo">709</span> */<a name="line.709"></a>
-<span class="sourceLineNo">710</span> private boolean checkReadyToRun(Entry
rootEntry) {<a name="line.710"></a>
-<span class="sourceLineNo">711</span> assert !rootEntry.hasParent() :
"expected root procedure, got " + rootEntry;<a name="line.711"></a>
-<span class="sourceLineNo">712</span><a name="line.712"></a>
-<span class="sourceLineNo">713</span> if (rootEntry.isFinished()) {<a
name="line.713"></a>
-<span class="sourceLineNo">714</span> // If the root procedure is
finished, sub-procedures should be gone<a name="line.714"></a>
-<span class="sourceLineNo">715</span> if (rootEntry.childHead != null)
{<a name="line.715"></a>
-<span class="sourceLineNo">716</span> LOG.error("unexpected active
children for root-procedure: " + rootEntry);<a name="line.716"></a>
-<span class="sourceLineNo">717</span> for (Entry p =
rootEntry.childHead; p != null; p = p.linkNext) {<a name="line.717"></a>
-<span class="sourceLineNo">718</span> LOG.error("unexpected active
children: " + p);<a name="line.718"></a>
-<span class="sourceLineNo">719</span> }<a name="line.719"></a>
-<span class="sourceLineNo">720</span> }<a name="line.720"></a>
-<span class="sourceLineNo">721</span><a name="line.721"></a>
-<span class="sourceLineNo">722</span> assert rootEntry.childHead ==
null : "unexpected children on root completion. " + rootEntry;<a
name="line.722"></a>
-<span class="sourceLineNo">723</span> rootEntry.ready = true;<a
name="line.723"></a>
-<span class="sourceLineNo">724</span> return true;<a
name="line.724"></a>
-<span class="sourceLineNo">725</span> }<a name="line.725"></a>
-<span class="sourceLineNo">726</span><a name="line.726"></a>
-<span class="sourceLineNo">727</span> int stackIdSum = 0;<a
name="line.727"></a>
-<span class="sourceLineNo">728</span> int maxStackId = 0;<a
name="line.728"></a>
-<span class="sourceLineNo">729</span> for (int i = 0; i <
rootEntry.proto.getStackIdCount(); ++i) {<a name="line.729"></a>
-<span class="sourceLineNo">730</span> int stackId = 1 +
rootEntry.proto.getStackId(i);<a name="line.730"></a>
-<span class="sourceLineNo">731</span> maxStackId =
Math.max(maxStackId, stackId);<a name="line.731"></a>
-<span class="sourceLineNo">732</span> stackIdSum += stackId;<a
name="line.732"></a>
-<span class="sourceLineNo">733</span> if (LOG.isTraceEnabled()) {<a
name="line.733"></a>
-<span class="sourceLineNo">734</span> LOG.trace("stackId=" + stackId
+ " stackIdSum=" + stackIdSum +<a name="line.734"></a>
-<span class="sourceLineNo">735</span> " maxStackid=" + maxStackId + "
" + rootEntry);<a name="line.735"></a>
-<span class="sourceLineNo">736</span> }<a name="line.736"></a>
-<span class="sourceLineNo">737</span> }<a name="line.737"></a>
-<span class="sourceLineNo">738</span><a name="line.738"></a>
-<span class="sourceLineNo">739</span> for (Entry p = rootEntry.childHead;
p != null; p = p.linkNext) {<a name="line.739"></a>
-<span class="sourceLineNo">740</span> for (int i = 0; i <
p.proto.getStackIdCount(); ++i) {<a name="line.740"></a>
-<span class="sourceLineNo">741</span> int stackId = 1 +
p.proto.getStackId(i);<a name="line.741"></a>
-<span class="sourceLineNo">742</span> maxStackId =
Math.max(maxStackId, stackId);<a name="line.742"></a>
-<span class="sourceLineNo">743</span> stackIdSum += stackId;<a
name="line.743"></a>
-<span class="sourceLineNo">744</span> if (LOG.isTraceEnabled()) {<a
name="line.744"></a>
-<span class="sourceLineNo">745</span> LOG.trace("stackId=" +
stackId + " stackIdSum=" + stackIdSum +<a name="line.745"></a>
-<span class="sourceLineNo">746</span> " maxStackid=" + maxStackId
+ " " + p);<a name="line.746"></a>
-<span class="sourceLineNo">747</span> }<a name="line.747"></a>
-<span class="sourceLineNo">748</span> }<a name="line.748"></a>
-<span class="sourceLineNo">749</span> }<a name="line.749"></a>
-<span class="sourceLineNo">750</span> // The cmpStackIdSum is this
formula for finding the sum of a series of numbers:<a name="line.750"></a>
-<span class="sourceLineNo">751</span> //
http://www.wikihow.com/Sum-the-Integers-from-1-to-N#/Image:Sum-the-Integers-from-1-to-N-Step-2-Version-3.jpg<a
name="line.751"></a>
-<span class="sourceLineNo">752</span> final int cmpStackIdSum =
(maxStackId * (maxStackId + 1) / 2);<a name="line.752"></a>
-<span class="sourceLineNo">753</span> if (cmpStackIdSum == stackIdSum)
{<a name="line.753"></a>
-<span class="sourceLineNo">754</span> rootEntry.ready = true;<a
name="line.754"></a>
-<span class="sourceLineNo">755</span> for (Entry p =
rootEntry.childHead; p != null; p = p.linkNext) {<a name="line.755"></a>
-<span class="sourceLineNo">756</span> p.ready = true;<a
name="line.756"></a>
-<span class="sourceLineNo">757</span> }<a name="line.757"></a>
-<span class="sourceLineNo">758</span> return true;<a
name="line.758"></a>
-<span class="sourceLineNo">759</span> }<a name="line.759"></a>
-<span class="sourceLineNo">760</span> return false;<a name="line.760"></a>
-<span class="sourceLineNo">761</span> }<a name="line.761"></a>
-<span class="sourceLineNo">762</span><a name="line.762"></a>
-<span class="sourceLineNo">763</span> private void
unlinkFromReplayList(Entry entry) {<a name="line.763"></a>
-<span class="sourceLineNo">764</span> if (replayOrderHead == entry) {<a
name="line.764"></a>
-<span class="sourceLineNo">765</span> replayOrderHead =
entry.replayNext;<a name="line.765"></a>
-<span class="sourceLineNo">766</span> }<a name="line.766"></a>
-<span class="sourceLineNo">767</span> if (replayOrderTail == entry) {<a
name="line.767"></a>
-<span class="sourceLineNo">768</span> replayOrderTail =
entry.replayPrev;<a name="line.768"></a>
-<span class="sourceLineNo">769</span> }<a name="line.769"></a>
-<span class="sourceLineNo">770</span> if (entry.replayPrev != null) {<a
name="line.770"></a>
-<span class="sourceLineNo">771</span> entry.replayPrev.replayNext =
entry.replayNext;<a name="line.771"></a>
-<span class="sourceLineNo">772</span> }<a name="line.772"></a>
-<span class="sourceLineNo">773</span> if (entry.replayNext != null) {<a
name="line.773"></a>
-<span class="sourceLineNo">774</span> entry.replayNext.replayPrev =
entry.replayPrev;<a name="line.774"></a>
-<span class="sourceLineNo">775</span> }<a name="line.775"></a>
-<span class="sourceLineNo">776</span> }<a name="line.776"></a>
-<span class="sourceLineNo">777</span><a name="line.777"></a>
-<span class="sourceLineNo">778</span> private void addToReplayList(final
Entry entry) {<a name="line.778"></a>
-<span class="sourceLineNo">779</span> unlinkFromReplayList(entry);<a
name="line.779"></a>
-<span class="sourceLineNo">780</span> entry.replayNext =
replayOrderHead;<a name="line.780"></a>
-<span class="sourceLineNo">781</span> entry.replayPrev = null;<a
name="line.781"></a>
-<span class="sourceLineNo">782</span> if (replayOrderHead != null) {<a
name="line.782"></a>
-<span class="sourceLineNo">783</span> replayOrderHead.replayPrev =
entry;<a name="line.783"></a>
-<span class="sourceLineNo">784</span> } else {<a name="line.784"></a>
-<span class="sourceLineNo">785</span> replayOrderTail = entry;<a
name="line.785"></a>
-<span class="sourceLineNo">786</span> }<a name="line.786"></a>
-<span class="sourceLineNo">787</span> replayOrderHead = entry;<a
name="line.787"></a>
-<span class="sourceLineNo">788</span> }<a name="line.788"></a>
-<span class="sourceLineNo">789</span><a name="line.789"></a>
-<span class="sourceLineNo">790</span> private void unlinkFromLinkList(Entry
entry) {<a name="line.790"></a>
-<span class="sourceLineNo">791</span> if (entry == rootHead) {<a
name="line.791"></a>
-<span class="sourceLineNo">792</span> rootHead = entry.linkNext;<a
name="line.792"></a>
-<span class="sourceLineNo">793</span> } else if (entry ==
childUnlinkedHead) {<a name="line.793"></a>
-<span class="sourceLineNo">794</span> childUnlinkedHead =
entry.linkNext;<a name="line.794"></a>
-<span class="sourceLineNo">795</span> }<a name="line.795"></a>
-<span class="sourceLineNo">796</span> if (entry.linkPrev != null) {<a
name="line.796"></a>
-<span class="sourceLineNo">797</span> entry.linkPrev.linkNext =
entry.linkNext;<a name="line.797"></a>
-<span class="sourceLineNo">798</span> }<a name="line.798"></a>
-<span class="sourceLineNo">799</span> if (entry.linkNext != null) {<a
name="line.799"></a>
-<span class="sourceLineNo">800</span> entry.linkNext.linkPrev =
entry.linkPrev;<a name="line.800"></a>
-<span class="sourceLineNo">801</span> }<a name="line.801"></a>
-<span class="sourceLineNo">802</span> }<a name="line.802"></a>
-<span class="sourceLineNo">803</span><a name="line.803"></a>
-<span class="sourceLineNo">804</span> private Entry addToLinkList(Entry
entry, Entry linkHead) {<a name="line.804"></a>
-<span class="sourceLineNo">805</span> unlinkFromLinkList(entry);<a
name="line.805"></a>
-<span class="sourceLineNo">806</span> entry.linkNext = linkHead;<a
name="line.806"></a>
-<span class="sourceLineNo">807</span> entry.linkPrev = null;<a
name="line.807"></a>
-<span class="sourceLineNo">808</span> if (linkHead != null) {<a
name="line.808"></a>
-<span class="sourceLineNo">809</span> linkHead.linkPrev = entry;<a
name="line.809"></a>
-<span class="sourceLineNo">810</span> }<a name="line.810"></a>
-<span class="sourceLineNo">811</span> return entry;<a name="line.811"></a>
-<span class="sourceLineNo">812</span> }<a name="line.812"></a>
-<span class="sourceLineNo">813</span><a name="line.813"></a>
-<span class="sourceLineNo">814</span> private Entry findLinkListTail(Entry
linkHead) {<a name="line.814"></a>
-<span class="sourceLineNo">815</span> Entry tail = linkHead;<a
name="line.815"></a>
-<span class="sourceLineNo">816</span> while (tail.linkNext != null) {<a
name="line.816"></a>
-<span class="sourceLineNo">817</span> tail = tail.linkNext;<a
name="line.817"></a>
-<span class="sourceLineNo">818</span> }<a name="line.818"></a>
-<span class="sourceLineNo">819</span> return tail;<a name="line.819"></a>
-<span class="sourceLineNo">820</span> }<a name="line.820"></a>
-<span class="sourceLineNo">821</span><a name="line.821"></a>
-<span class="sourceLineNo">822</span> private Entry addToMap(final long
procId, final boolean hasParent) {<a name="line.822"></a>
-<span class="sourceLineNo">823</span> int slotIndex =
getMapSlot(procId);<a name="line.823"></a>
-<span class="sourceLineNo">824</span> Entry entry =
getProcedure(slotIndex, procId);<a name="line.824"></a>
-<span class="sourceLineNo">825</span> if (entry != null) return entry;<a
name="line.825"></a>
-<span class="sourceLineNo">826</span><a name="line.826"></a>
-<span class="sourceLineNo">827</span> entry = new
Entry(procedureMap[slotIndex]);<a name="line.827"></a>
-<span class="sourceLineNo">828</span> procedureMap[slotIndex] = entry;<a
name="line.828"></a>
-<span class="sourceLineNo">829</span> return entry;<a name="line.829"></a>
-<span class="sourceLineNo">830</span> }<a name="line.830"></a>
-<span class="sourceLineNo">831</span><a name="line.831"></a>
-<span class="sourceLineNo">832</span> private Entry removeFromMap(final
long procId) {<a name="line.832"></a>
-<span class="sourceLineNo">833</span> int slotIndex =
getMapSlot(procId);<a name="line.833"></a>
-<span class="sourceLineNo">834</span> Entry prev = null;<a
name="line.834"></a>
-<span class="sourceLineNo">835</span> Entry entry =
procedureMap[slotIndex];<a name="line.835"></a>
-<span class="sourceLineNo">836</span> while (entry != null) {<a
name="line.836"></a>
-<span class="sourceLineNo">837</span> if (procId == entry.getProcId())
{<a name="line.837"></a>
-<span class="sourceLineNo">838</span> if (prev != null) {<a
name="line.838"></a>
-<span class="sourceLineNo">839</span> prev.hashNext =
entry.hashNext;<a name="line.839"></a>
-<span class="sourceLineNo">840</span> } else {<a name="line.840"></a>
-<span class="sourceLineNo">841</span> procedureMap[slotIndex] =
entry.hashNext;<a name="line.841"></a>
-<span class="sourceLineNo">842</span> }<a name="line.842"></a>
-<span class="sourceLineNo">843</span> entry.hashNext = null;<a
name="line.843"></a>
-<span class="sourceLineNo">844</span> return entry;<a
name="line.844"></a>
-<span class="sourceLineNo">845</span> }<a name="line.845"></a>
-<span class="sourceLineNo">846</span> prev = entry;<a
name="line.846"></a>
-<span class="sourceLineNo">847</span> entry = entry.hashNext;<a
name="line.847"></a>
-<span class="sourceLineNo">848</span> }<a name="line.848"></a>
-<span class="sourceLineNo">849</span> return null;<a name="line.849"></a>
-<span class="sourceLineNo">850</span> }<a name="line.850"></a>
-<span class="sourceLineNo">851</span><a name="line.851"></a>
-<span class="sourceLineNo">852</span> private Entry getProcedure(final long
procId) {<a name="line.852"></a>
-<span class="sourceLineNo">853</span> return
getProcedure(getMapSlot(procId), procId);<a name="line.853"></a>
+<span class="sourceLineNo">708</span> * Example-2<a name="line.708"></a>
+<span class="sourceLineNo">709</span> * wal-2 | A | A
stackIds = [0, 2]<a name="line.709"></a>
+<span class="sourceLineNo">710</span> * wal-1 | A B | B
stackIds = [1]<a name="line.710"></a>
+<span class="sourceLineNo">711</span> *<a name="line.711"></a>
+<span class="sourceLineNo">712</span> * There is a gap between A stackIds
so something was executed in between.<a name="line.712"></a>
+<span class="sourceLineNo">713</span> */<a name="line.713"></a>
+<span class="sourceLineNo">714</span> private boolean checkReadyToRun(Entry
rootEntry) {<a name="line.714"></a>
+<span class="sourceLineNo">715</span> assert !rootEntry.hasParent() :
"expected root procedure, got " + rootEntry;<a name="line.715"></a>
+<span class="sourceLineNo">716</span><a name="line.716"></a>
+<span class="sourceLineNo">717</span> if (rootEntry.isFinished()) {<a
name="line.717"></a>
+<span class="sourceLineNo">718</span> // If the root procedure is
finished, sub-procedures should be gone<a name="line.718"></a>
+<span class="sourceLineNo">719</span> if (rootEntry.childHead != null)
{<a name="line.719"></a>
+<span class="sourceLineNo">720</span> LOG.error("unexpected active
children for root-procedure: " + rootEntry);<a name="line.720"></a>
+<span class="sourceLineNo">721</span> for (Entry p =
rootEntry.childHead; p != null; p = p.linkNext) {<a name="line.721"></a>
+<span class="sourceLineNo">722</span> LOG.error("unexpected active
children: " + p);<a name="line.722"></a>
+<span class="sourceLineNo">723</span> }<a name="line.723"></a>
+<span class="sourceLineNo">724</span> }<a name="line.724"></a>
+<span class="sourceLineNo">725</span><a name="line.725"></a>
+<span class="sourceLineNo">726</span> assert rootEntry.childHead ==
null : "unexpected children on root completion. " + rootEntry;<a
name="line.726"></a>
+<span class="sourceLineNo">727</span> rootEntry.ready = true;<a
name="line.727"></a>
+<span class="sourceLineNo">728</span> return true;<a
name="line.728"></a>
+<span class="sourceLineNo">729</span> }<a name="line.729"></a>
+<span class="sourceLineNo">730</span><a name="line.730"></a>
+<span class="sourceLineNo">731</span> int stackIdSum = 0;<a
name="line.731"></a>
+<span class="sourceLineNo">732</span> int maxStackId = 0;<a
name="line.732"></a>
+<span class="sourceLineNo">733</span> for (int i = 0; i <
rootEntry.proto.getStackIdCount(); ++i) {<a name="line.733"></a>
+<span class="sourceLineNo">734</span> int stackId = 1 +
rootEntry.proto.getStackId(i);<a name="line.734"></a>
+<span class="sourceLineNo">735</span> maxStackId =
Math.max(maxStackId, stackId);<a name="line.735"></a>
+<span class="sourceLineNo">736</span> stackIdSum += stackId;<a
name="line.736"></a>
+<span class="sourceLineNo">737</span> if (LOG.isTraceEnabled()) {<a
name="line.737"></a>
+<span class="sourceLineNo">738</span> LOG.trace("stackId=" + stackId
+ " stackIdSum=" + stackIdSum +<a name="line.738"></a>
+<span class="sourceLineNo">739</span> " maxStackid=" + maxStackId + "
" + rootEntry);<a name="line.739"></a>
+<span class="sourceLineNo">740</span> }<a name="line.740"></a>
+<span class="sourceLineNo">741</span> }<a name="line.741"></a>
+<span class="sourceLineNo">742</span><a name="line.742"></a>
+<span class="sourceLineNo">743</span> for (Entry p = rootEntry.childHead;
p != null; p = p.linkNext) {<a name="line.743"></a>
+<span class="sourceLineNo">744</span> for (int i = 0; i <
p.proto.getStackIdCount(); ++i) {<a name="line.744"></a>
+<span class="sourceLineNo">745</span> int stackId = 1 +
p.proto.getStackId(i);<a name="line.745"></a>
+<span class="sourceLineNo">746</span> maxStackId =
Math.max(maxStackId, stackId);<a name="line.746"></a>
+<span class="sourceLineNo">747</span> stackIdSum += stackId;<a
name="line.747"></a>
+<span class="sourceLineNo">748</span> if (LOG.isTraceEnabled()) {<a
name="line.748"></a>
+<span class="sourceLineNo">749</span> LOG.trace("stackId=" +
stackId + " stackIdSum=" + stackIdSum +<a name="line.749"></a>
+<span class="sourceLineNo">750</span> " maxStackid=" + maxStackId
+ " " + p);<a name="line.750"></a>
+<span class="sourceLineNo">751</span> }<a name="line.751"></a>
+<span class="sourceLineNo">752</span> }<a name="line.752"></a>
+<span class="sourceLineNo">753</span> }<a name="line.753"></a>
+<span class="sourceLineNo">754</span> // The cmpStackIdSum is this
formula for finding the sum of a series of numbers:<a name="line.754"></a>
+<span class="sourceLineNo">755</span> //
http://www.wikihow.com/Sum-the-Integers-from-1-to-N#/Image:Sum-the-Integers-from-1-to-N-Step-2-Version-3.jpg<a
name="line.755"></a>
+<span class="sourceLineNo">756</span> final int cmpStackIdSum =
(maxStackId * (maxStackId + 1) / 2);<a name="line.756"></a>
+<span class="sourceLineNo">757</span> if (cmpStackIdSum == stackIdSum)
{<a name="line.757"></a>
+<span class="sourceLineNo">758</span> rootEntry.ready = true;<a
name="line.758"></a>
+<span class="sourceLineNo">759</span> for (Entry p =
rootEntry.childHead; p != null; p = p.linkNext) {<a name="line.759"></a>
+<span class="sourceLineNo">760</span> p.ready = true;<a
name="line.760"></a>
+<span class="sourceLineNo">761</span> }<a name="line.761"></a>
+<span class="sourceLineNo">762</span> return true;<a
name="line.762"></a>
+<span class="sourceLineNo">763</span> }<a name="line.763"></a>
+<span class="sourceLineNo">764</span> return false;<a name="line.764"></a>
+<span class="sourceLineNo">765</span> }<a name="line.765"></a>
+<span class="sourceLineNo">766</span><a name="line.766"></a>
+<span class="sourceLineNo">767</span> private void
unlinkFromReplayList(Entry entry) {<a name="line.767"></a>
+<span class="sourceLineNo">768</span> if (replayOrderHead == entry) {<a
name="line.768"></a>
+<span class="sourceLineNo">769</span> replayOrderHead =
entry.replayNext;<a name="line.769"></a>
+<span class="sourceLineNo">770</span> }<a name="line.770"></a>
+<span class="sourceLineNo">771</span> if (replayOrderTail == entry) {<a
name="line.771"></a>
+<span class="sourceLineNo">772</span> replayOrderTail =
entry.replayPrev;<a name="line.772"></a>
+<span class="sourceLineNo">773</span> }<a name="line.773"></a>
+<span class="sourceLineNo">774</span> if (entry.replayPrev != null) {<a
name="line.774"></a>
+<span class="sourceLineNo">775</span> entry.replayPrev.replayNext =
entry.replayNext;<a name="line.775"></a>
+<span class="sourceLineNo">776</span> }<a name="line.776"></a>
+<span class="sourceLineNo">777</span> if (entry.replayNext != null) {<a
name="line.777"></a>
+<span class="sourceLineNo">778</span> entry.replayNext.replayPrev =
entry.replayPrev;<a name="line.778"></a>
+<span class="sourceLineNo">779</span> }<a name="line.779"></a>
+<span class="sourceLineNo">780</span> }<a name="line.780"></a>
+<span class="sourceLineNo">781</span><a name="line.781"></a>
+<span class="sourceLineNo">782</span> private void addToReplayList(final
Entry entry) {<a name="line.782"></a>
+<span class="sourceLineNo">783</span> unlinkFromReplayList(entry);<a
name="line.783"></a>
+<span class="sourceLineNo">784</span> entry.replayNext =
replayOrderHead;<a name="line.784"></a>
+<span class="sourceLineNo">785</span> entry.replayPrev = null;<a
name="line.785"></a>
+<span class="sourceLineNo">786</span> if (replayOrderHead != null) {<a
name="line.786"></a>
+<span class="sourceLineNo">787</span> replayOrderHead.replayPrev =
entry;<a name="line.787"></a>
+<span class="sourceLineNo">788</span> } else {<a name="line.788"></a>
+<span class="sourceLineNo">789</span> replayOrderTail = entry;<a
name="line.789"></a>
+<span class="sourceLineNo">790</span> }<a name="line.790"></a>
+<span class="sourceLineNo">791</span> replayOrderHead = entry;<a
name="line.791"></a>
+<span class="sourceLineNo">792</span> }<a name="line.792"></a>
+<span class="sourceLineNo">793</span><a name="line.793"></a>
+<span class="sourceLineNo">794</span> private void unlinkFromLinkList(Entry
entry) {<a name="line.794"></a>
+<span class="sourceLineNo">795</span> if (entry == rootHead) {<a
name="line.795"></a>
+<span class="sourceLineNo">796</span> rootHead = entry.linkNext;<a
name="line.796"></a>
+<span class="sourceLineNo">797</span> } else if (entry ==
childUnlinkedHead) {<a name="line.797"></a>
+<span class="sourceLineNo">798</span> childUnlinkedHead =
entry.linkNext;<a name="line.798"></a>
+<span class="sourceLineNo">799</span> }<a name="line.799"></a>
+<span class="sourceLineNo">800</span> if (entry.linkPrev != null) {<a
name="line.800"></a>
+<span class="sourceLineNo">801</span> entry.linkPrev.linkNext =
entry.linkNext;<a name="line.801"></a>
+<span class="sourceLineNo">802</span> }<a name="line.802"></a>
+<span class="sourceLineNo">803</span> if (entry.linkNext != null) {<a
name="line.803"></a>
+<span class="sourceLineNo">804</span> entry.linkNext.linkPrev =
entry.linkPrev;<a name="line.804"></a>
+<span class="sourceLineNo">805</span> }<a name="line.805"></a>
+<span class="sourceLineNo">806</span> }<a name="line.806"></a>
+<span class="sourceLineNo">807</span><a name="line.807"></a>
+<span class="sourceLineNo">808</span> private Entry addToLinkList(Entry
entry, Entry linkHead) {<a name="line.808"></a>
+<span class="sourceLineNo">809</span> unlinkFromLinkList(entry);<a
name="line.809"></a>
+<span class="sourceLineNo">810</span> entry.linkNext = linkHead;<a
name="line.810"></a>
+<span class="sourceLineNo">811</span> entry.linkPrev = null;<a
name="line.811"></a>
+<span class="sourceLineNo">812</span> if (linkHead != null) {<a
name="line.812"></a>
+<span class="sourceLineNo">813</span> linkHead.linkPrev = entry;<a
name="line.813"></a>
+<span class="sourceLineNo">814</span> }<a name="line.814"></a>
+<span class="sourceLineNo">815</span> return entry;<a name="line.815"></a>
+<span class="sourceLineNo">816</span> }<a name="line.816"></a>
+<span class="sourceLineNo">817</span><a name="line.817"></a>
+<span class="sourceLineNo">818</span> private Entry findLinkListTail(Entry
linkHead) {<a name="line.818"></a>
+<span class="sourceLineNo">819</span> Entry tail = linkHead;<a
name="line.819"></a>
+<span class="sourceLineNo">820</span> while (tail.linkNext != null) {<a
name="line.820"></a>
+<span class="sourceLineNo">821</span> tail = tail.linkNext;<a
name="line.821"></a>
+<span class="sourceLineNo">822</span> }<a name="line.822"></a>
+<span class="sourceLineNo">823</span> return tail;<a name="line.823"></a>
+<span class="sourceLineNo">824</span> }<a name="line.824"></a>
+<span class="sourceLineNo">825</span><a name="line.825"></a>
+<span class="sourceLineNo">826</span> private Entry addToMap(final long
procId, final boolean hasParent) {<a name="line.826"></a>
+<span class="sourceLineNo">827</span> int slotIndex =
getMapSlot(procId);<a name="line.827"></a>
+<span class="sourceLineNo">828</span> Entry entry =
getProcedure(slotIndex, procId);<a name="line.828"></a>
+<span class="sourceLineNo">829</span> if (entry != null) return entry;<a
name="line.829"></a>
+<span class="sourceLineNo">830</span><a name="line.830"></a>
+<span class="sourceLineNo">831</span> entry = new
Entry(procedureMap[slotIndex]);<a name="line.831"></a>
+<span class="sourceLineNo">832</span> procedureMap[slotIndex] = entry;<a
name="line.832"></a>
+<span class="sourceLineNo">833</span> return entry;<a name="line.833"></a>
+<span class="sourceLineNo">834</span> }<a name="line.834"></a>
+<span class="sourceLineNo">835</span><a name="line.835"></a>
+<span class="sourceLineNo">836</span> private Entry removeFromMap(final
long procId) {<a name="line.836"></a>
+<span class="sourceLineNo">837</span> int slotIndex =
getMapSlot(procId);<a name="line.837"></a>
+<span class="sourceLineNo">838</span> Entry prev = null;<a
name="line.838"></a>
+<span class="sourceLineNo">839</span> Entry entry =
procedureMap[slotIndex];<a name="line.839"></a>
+<span class="sourceLineNo">840</span> while (entry != null) {<a
name="line.840"></a>
+<span class="sourceLineNo">841</span> if (procId == entry.getProcId())
{<a name="line.841"></a>
+<span class="sourceLineNo">842</span> if (prev != null) {<a
name="line.842"></a>
+<span class="sourceLineNo">843</span> prev.hashNext =
entry.hashNext;<a name="line.843"></a>
+<span class="sourceLineNo">844</span> } else {<a name="line.844"></a>
+<span class="sourceLineNo">845</span> procedureMap[slotIndex] =
entry.hashNext;<a name="line.845"></a>
+<span class="sourceLineNo">846</span> }<a name="line.846"></a>
+<span class="sourceLineNo">847</span> entry.hashNext = null;<a
name="line.847"></a>
+<span class="sourceLineNo">848</span> return entry;<a
name="line.848"></a>
+<span class="sourceLineNo">849</span> }<a name="line.849"></a>
+<span class="sourceLineNo">850</span> prev = entry;<a
name="line.850"></a>
+<span class="sourceLineNo">851</span> entry = entry.hashNext;<a
name="line.851"></a>
+<span class="sourceLineNo">852</span> }<a name="line.852"></a>
+<span class="sourceLineNo">853</span> return null;<a name="line.853"></a>
<span class="sourceLineNo">854</span> }<a name="line.854"></a>
<span class="sourceLineNo">855</span><a name="line.855"></a>
-<span class="sourceLineNo">856</span> private Entry getProcedure(final int
slotIndex, final long procId) {<a name="line.856"></a>
-<span class="sourceLineNo">857</span> Entry entry =
procedureMap[slotIndex];<a name="line.857"></a>
-<span class="sourceLineNo">858</span> while (entry != null) {<a
name="line.858"></a>
-<span class="sourceLineNo">859</span> if (procId == entry.getProcId())
{<a name="line.859"></a>
-<span class="sourceLineNo">860</span> return entry;<a
name="line.860"></a>
-<span class="sourceLineNo">861</span> }<a name="line.861"></a>
-<span class="sourceLineNo">862</span> entry = entry.hashNext;<a
name="line.862"></a>
-<span class="sourceLineNo">863</span> }<a name="line.863"></a>
-<span class="sourceLineNo">864</span> return null;<a name="line.864"></a>
-<span class="sourceLineNo">865</span> }<a name="line.865"></a>
-<span class="sourceLineNo">866</span><a name="line.866"></a>
-<span class="sourceLineNo">867</span> private int getMapSlot(final long
procId) {<a name="line.867"></a>
-<span class="sourceLineNo">868</span> return
(int)(Procedure.getProcIdHashCode(procId) % procedureMap.length);<a
name="line.868"></a>
+<span class="sourceLineNo">856</span> private Entry getProcedure(final long
procId) {<a name="line.856"></a>
+<span class="sourceLineNo">857</span> return
getProcedure(getMapSlot(procId), procId);<a name="line.857"></a>
+<span class="sourceLineNo">858</span> }<a name="line.858"></a>
+<span class="sourceLineNo">859</span><a name="line.859"></a>
+<span class="sourceLineNo">860</span> private Entry getProcedure(final int
slotIndex, final long procId) {<a name="line.860"></a>
+<span class="sourceLineNo">861</span> Entry entry =
procedureMap[slotIndex];<a name="line.861"></a>
+<span class="sourceLineNo">862</span> while (entry != null) {<a
name="line.862"></a>
+<span class="sourceLineNo">863</span> if (procId == entry.getProcId())
{<a name="line.863"></a>
+<span class="sourceLineNo">864</span> return entry;<a
name="line.864"></a>
+<span class="sourceLineNo">865</span> }<a name="line.865"></a>
+<span class="sourceLineNo">866</span> entry = entry.hashNext;<a
name="line.866"></a>
+<span class="sourceLineNo">867</span> }<a name="line.867"></a>
+<span class="sourceLineNo">868</span> return null;<a name="line.868"></a>
<span class="sourceLineNo">869</span> }<a name="line.869"></a>
-<span class="sourceLineNo">870</span> }<a name="line.870"></a>
-<span class="sourceLineNo">871</span>}<a name="line.871"></a>
+<span class="sourceLineNo">870</span><a name="line.870"></a>
+<span class="sourceLineNo">871</span> private int getMapSlot(final long
procId) {<a name="line.871"></a>
+<span class="sourceLineNo">872</span> return
(int)(Procedure.getProcIdHashCode(procId) % procedureMap.length);<a
name="line.872"></a>
+<span class="sourceLineNo">873</span> }<a name="line.873"></a>
+<span class="sourceLineNo">874</span> }<a name="line.874"></a>
+<span class="sourceLineNo">875</span>}<a name="line.875"></a>
