http://git-wip-us.apache.org/repos/asf/hbase/blob/565d7685/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 4795f37..0ba2dff 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
@@ -158,8 +158,8 @@
<span class="sourceLineNo">150</span> LOG.info("No active entry found in
state log " + log + ". removing it");<a name="line.150"></a>
<span class="sourceLineNo">151</span> loader.removeLog(log);<a
name="line.151"></a>
<span class="sourceLineNo">152</span> } else {<a name="line.152"></a>
-<span class="sourceLineNo">153</span>
procedureMap.mergeTail(localProcedureMap);<a name="line.153"></a>
-<span class="sourceLineNo">154</span><a name="line.154"></a>
+<span class="sourceLineNo">153</span>
log.setProcIds(localProcedureMap.getMinProcId(),
localProcedureMap.getMaxProcId());<a name="line.153"></a>
+<span class="sourceLineNo">154</span>
procedureMap.mergeTail(localProcedureMap);<a name="line.154"></a>
<span class="sourceLineNo">155</span> //if (hasFastStartSupport) {<a
name="line.155"></a>
<span class="sourceLineNo">156</span> // TODO: Some procedure may be
already runnables (see readInitEntry())<a name="line.156"></a>
<span class="sourceLineNo">157</span> // (we can also check the
"update map" in the log trackers)<a name="line.157"></a>
@@ -329,363 +329,384 @@
<span class="sourceLineNo">321</span> // pending unlinked children (root
not present yet)<a name="line.321"></a>
<span class="sourceLineNo">322</span> private Entry childUnlinkedHead;<a
name="line.322"></a>
<span class="sourceLineNo">323</span><a name="line.323"></a>
-<span class="sourceLineNo">324</span> public WalProcedureMap(int size) {<a
name="line.324"></a>
-<span class="sourceLineNo">325</span> procedureMap = new Entry[size];<a
name="line.325"></a>
-<span class="sourceLineNo">326</span> replayOrderHead = null;<a
name="line.326"></a>
-<span class="sourceLineNo">327</span> replayOrderTail = null;<a
name="line.327"></a>
-<span class="sourceLineNo">328</span> rootHead = null;<a
name="line.328"></a>
-<span class="sourceLineNo">329</span> childUnlinkedHead = null;<a
name="line.329"></a>
-<span class="sourceLineNo">330</span> }<a name="line.330"></a>
-<span class="sourceLineNo">331</span><a name="line.331"></a>
-<span class="sourceLineNo">332</span> public void
add(ProcedureProtos.Procedure procProto) {<a name="line.332"></a>
-<span class="sourceLineNo">333</span> Entry entry =
addToMap(procProto.getProcId(), procProto.hasParentId());<a name="line.333"></a>
-<span class="sourceLineNo">334</span> boolean isNew = entry.proto ==
null;<a name="line.334"></a>
-<span class="sourceLineNo">335</span> entry.proto = procProto;<a
name="line.335"></a>
-<span class="sourceLineNo">336</span> addToReplayList(entry);<a
name="line.336"></a>
-<span class="sourceLineNo">337</span><a name="line.337"></a>
-<span class="sourceLineNo">338</span> if (isNew) {<a name="line.338"></a>
-<span class="sourceLineNo">339</span> if (procProto.hasParentId()) {<a
name="line.339"></a>
-<span class="sourceLineNo">340</span> childUnlinkedHead =
addToLinkList(entry, childUnlinkedHead);<a name="line.340"></a>
-<span class="sourceLineNo">341</span> } else {<a name="line.341"></a>
-<span class="sourceLineNo">342</span> rootHead = addToLinkList(entry,
rootHead);<a name="line.342"></a>
-<span class="sourceLineNo">343</span> }<a name="line.343"></a>
-<span class="sourceLineNo">344</span> }<a name="line.344"></a>
-<span class="sourceLineNo">345</span> }<a name="line.345"></a>
-<span class="sourceLineNo">346</span><a name="line.346"></a>
-<span class="sourceLineNo">347</span> public boolean remove(long procId)
{<a name="line.347"></a>
-<span class="sourceLineNo">348</span> Entry entry =
removeFromMap(procId);<a name="line.348"></a>
-<span class="sourceLineNo">349</span> if (entry != null) {<a
name="line.349"></a>
-<span class="sourceLineNo">350</span> unlinkFromReplayList(entry);<a
name="line.350"></a>
-<span class="sourceLineNo">351</span> unlinkFromLinkList(entry);<a
name="line.351"></a>
-<span class="sourceLineNo">352</span> return true;<a
name="line.352"></a>
-<span class="sourceLineNo">353</span> }<a name="line.353"></a>
-<span class="sourceLineNo">354</span> return false;<a name="line.354"></a>
-<span class="sourceLineNo">355</span> }<a name="line.355"></a>
-<span class="sourceLineNo">356</span><a name="line.356"></a>
-<span class="sourceLineNo">357</span> public boolean contains(long procId)
{<a name="line.357"></a>
-<span class="sourceLineNo">358</span> return getProcedure(procId) !=
null;<a name="line.358"></a>
-<span class="sourceLineNo">359</span> }<a name="line.359"></a>
-<span class="sourceLineNo">360</span><a name="line.360"></a>
-<span class="sourceLineNo">361</span> public boolean isEmpty() {<a
name="line.361"></a>
-<span class="sourceLineNo">362</span> return replayOrderHead == null;<a
name="line.362"></a>
-<span class="sourceLineNo">363</span> }<a name="line.363"></a>
-<span class="sourceLineNo">364</span><a name="line.364"></a>
-<span class="sourceLineNo">365</span> public void clear() {<a
name="line.365"></a>
-<span class="sourceLineNo">366</span> for (int i = 0; i <
procedureMap.length; ++i) {<a name="line.366"></a>
-<span class="sourceLineNo">367</span> procedureMap[i] = null;<a
name="line.367"></a>
-<span class="sourceLineNo">368</span> }<a name="line.368"></a>
-<span class="sourceLineNo">369</span> replayOrderHead = null;<a
name="line.369"></a>
-<span class="sourceLineNo">370</span> replayOrderTail = null;<a
name="line.370"></a>
-<span class="sourceLineNo">371</span> rootHead = null;<a
name="line.371"></a>
-<span class="sourceLineNo">372</span> childUnlinkedHead = null;<a
name="line.372"></a>
-<span class="sourceLineNo">373</span> }<a name="line.373"></a>
-<span class="sourceLineNo">374</span><a name="line.374"></a>
-<span class="sourceLineNo">375</span> /*<a name="line.375"></a>
-<span class="sourceLineNo">376</span> * Merges two WalProcedureMap,<a
name="line.376"></a>
-<span class="sourceLineNo">377</span> * the target is the "global" map,
the source is the "local" map.<a name="line.377"></a>
-<span class="sourceLineNo">378</span> * - The entries in the hashtables
are guaranteed to be unique.<a name="line.378"></a>
-<span class="sourceLineNo">379</span> * On replay we don't load
procedures that already exist in the "global"<a name="line.379"></a>
-<span class="sourceLineNo">380</span> * map (the one we are merging the
"local" in to).<a name="line.380"></a>
-<span class="sourceLineNo">381</span> * - The replayOrderList of the
"local" nao will be appended to the "global"<a name="line.381"></a>
-<span class="sourceLineNo">382</span> * map replay list.<a
name="line.382"></a>
-<span class="sourceLineNo">383</span> * - The "local" map will be cleared
at the end of the operation.<a name="line.383"></a>
-<span class="sourceLineNo">384</span> */<a name="line.384"></a>
-<span class="sourceLineNo">385</span> public void mergeTail(WalProcedureMap
other) {<a name="line.385"></a>
-<span class="sourceLineNo">386</span> for (Entry p =
other.replayOrderHead; p != null; p = p.replayNext) {<a name="line.386"></a>
-<span class="sourceLineNo">387</span> int slotIndex =
getMapSlot(p.getProcId());<a name="line.387"></a>
-<span class="sourceLineNo">388</span> p.hashNext =
procedureMap[slotIndex];<a name="line.388"></a>
-<span class="sourceLineNo">389</span> procedureMap[slotIndex] = p;<a
name="line.389"></a>
-<span class="sourceLineNo">390</span> }<a name="line.390"></a>
-<span class="sourceLineNo">391</span><a name="line.391"></a>
-<span class="sourceLineNo">392</span> if (replayOrderHead == null) {<a
name="line.392"></a>
-<span class="sourceLineNo">393</span> replayOrderHead =
other.replayOrderHead;<a name="line.393"></a>
-<span class="sourceLineNo">394</span> replayOrderTail =
other.replayOrderTail;<a name="line.394"></a>
-<span class="sourceLineNo">395</span> rootHead = other.rootHead;<a
name="line.395"></a>
-<span class="sourceLineNo">396</span> childUnlinkedHead =
other.childUnlinkedHead;<a name="line.396"></a>
-<span class="sourceLineNo">397</span> } else {<a name="line.397"></a>
-<span class="sourceLineNo">398</span> // append replay list<a
name="line.398"></a>
-<span class="sourceLineNo">399</span> assert replayOrderTail.replayNext
== null;<a name="line.399"></a>
-<span class="sourceLineNo">400</span> assert
other.replayOrderHead.replayPrev == null;<a name="line.400"></a>
-<span class="sourceLineNo">401</span> replayOrderTail.replayNext =
other.replayOrderHead;<a name="line.401"></a>
-<span class="sourceLineNo">402</span> other.replayOrderHead.replayPrev
= replayOrderTail;<a name="line.402"></a>
-<span class="sourceLineNo">403</span> replayOrderTail =
other.replayOrderTail;<a name="line.403"></a>
-<span class="sourceLineNo">404</span><a name="line.404"></a>
-<span class="sourceLineNo">405</span> // merge rootHead<a
name="line.405"></a>
-<span class="sourceLineNo">406</span> if (rootHead == null) {<a
name="line.406"></a>
-<span class="sourceLineNo">407</span> rootHead = other.rootHead;<a
name="line.407"></a>
-<span class="sourceLineNo">408</span> } else if (other.rootHead !=
null) {<a name="line.408"></a>
-<span class="sourceLineNo">409</span> Entry otherTail =
findLinkListTail(other.rootHead);<a name="line.409"></a>
-<span class="sourceLineNo">410</span> otherTail.linkNext =
rootHead;<a name="line.410"></a>
-<span class="sourceLineNo">411</span> rootHead.linkPrev =
otherTail;<a name="line.411"></a>
-<span class="sourceLineNo">412</span> rootHead = other.rootHead;<a
name="line.412"></a>
-<span class="sourceLineNo">413</span> }<a name="line.413"></a>
-<span class="sourceLineNo">414</span><a name="line.414"></a>
-<span class="sourceLineNo">415</span> // merge childUnlinkedHead<a
name="line.415"></a>
-<span class="sourceLineNo">416</span> if (childUnlinkedHead == null)
{<a name="line.416"></a>
-<span class="sourceLineNo">417</span> childUnlinkedHead =
other.childUnlinkedHead;<a name="line.417"></a>
-<span class="sourceLineNo">418</span> } else if
(other.childUnlinkedHead != null) {<a name="line.418"></a>
-<span class="sourceLineNo">419</span> Entry otherTail =
findLinkListTail(other.childUnlinkedHead);<a name="line.419"></a>
-<span class="sourceLineNo">420</span> otherTail.linkNext =
childUnlinkedHead;<a name="line.420"></a>
-<span class="sourceLineNo">421</span> childUnlinkedHead.linkPrev =
otherTail;<a name="line.421"></a>
-<span class="sourceLineNo">422</span> childUnlinkedHead =
other.childUnlinkedHead;<a name="line.422"></a>
-<span class="sourceLineNo">423</span> }<a name="line.423"></a>
-<span class="sourceLineNo">424</span> }<a name="line.424"></a>
+<span class="sourceLineNo">324</span> // Track ProcId range<a
name="line.324"></a>
+<span class="sourceLineNo">325</span> private long minProcId =
Long.MAX_VALUE;<a name="line.325"></a>
+<span class="sourceLineNo">326</span> private long maxProcId =
Long.MIN_VALUE;<a name="line.326"></a>
+<span class="sourceLineNo">327</span><a name="line.327"></a>
+<span class="sourceLineNo">328</span> public WalProcedureMap(int size) {<a
name="line.328"></a>
+<span class="sourceLineNo">329</span> procedureMap = new Entry[size];<a
name="line.329"></a>
+<span class="sourceLineNo">330</span> replayOrderHead = null;<a
name="line.330"></a>
+<span class="sourceLineNo">331</span> replayOrderTail = null;<a
name="line.331"></a>
+<span class="sourceLineNo">332</span> rootHead = null;<a
name="line.332"></a>
+<span class="sourceLineNo">333</span> childUnlinkedHead = null;<a
name="line.333"></a>
+<span class="sourceLineNo">334</span> }<a name="line.334"></a>
+<span class="sourceLineNo">335</span><a name="line.335"></a>
+<span class="sourceLineNo">336</span> public void
add(ProcedureProtos.Procedure procProto) {<a name="line.336"></a>
+<span class="sourceLineNo">337</span>
trackProcIds(procProto.getProcId());<a name="line.337"></a>
+<span class="sourceLineNo">338</span> Entry entry =
addToMap(procProto.getProcId(), procProto.hasParentId());<a name="line.338"></a>
+<span class="sourceLineNo">339</span> boolean isNew = entry.proto ==
null;<a name="line.339"></a>
+<span class="sourceLineNo">340</span> entry.proto = procProto;<a
name="line.340"></a>
+<span class="sourceLineNo">341</span> addToReplayList(entry);<a
name="line.341"></a>
+<span class="sourceLineNo">342</span><a name="line.342"></a>
+<span class="sourceLineNo">343</span> if (isNew) {<a name="line.343"></a>
+<span class="sourceLineNo">344</span> if (procProto.hasParentId()) {<a
name="line.344"></a>
+<span class="sourceLineNo">345</span> childUnlinkedHead =
addToLinkList(entry, childUnlinkedHead);<a name="line.345"></a>
+<span class="sourceLineNo">346</span> } else {<a name="line.346"></a>
+<span class="sourceLineNo">347</span> rootHead = addToLinkList(entry,
rootHead);<a name="line.347"></a>
+<span class="sourceLineNo">348</span> }<a name="line.348"></a>
+<span class="sourceLineNo">349</span> }<a name="line.349"></a>
+<span class="sourceLineNo">350</span> }<a name="line.350"></a>
+<span class="sourceLineNo">351</span><a name="line.351"></a>
+<span class="sourceLineNo">352</span> public boolean remove(long procId)
{<a name="line.352"></a>
+<span class="sourceLineNo">353</span> trackProcIds(procId);<a
name="line.353"></a>
+<span class="sourceLineNo">354</span> Entry entry =
removeFromMap(procId);<a name="line.354"></a>
+<span class="sourceLineNo">355</span> if (entry != null) {<a
name="line.355"></a>
+<span class="sourceLineNo">356</span> unlinkFromReplayList(entry);<a
name="line.356"></a>
+<span class="sourceLineNo">357</span> unlinkFromLinkList(entry);<a
name="line.357"></a>
+<span class="sourceLineNo">358</span> return true;<a
name="line.358"></a>
+<span class="sourceLineNo">359</span> }<a name="line.359"></a>
+<span class="sourceLineNo">360</span> return false;<a name="line.360"></a>
+<span class="sourceLineNo">361</span> }<a name="line.361"></a>
+<span class="sourceLineNo">362</span><a name="line.362"></a>
+<span class="sourceLineNo">363</span> private void trackProcIds(long
procId) {<a name="line.363"></a>
+<span class="sourceLineNo">364</span> minProcId = Math.min(minProcId,
procId);<a name="line.364"></a>
+<span class="sourceLineNo">365</span> maxProcId = Math.max(maxProcId,
procId);<a name="line.365"></a>
+<span class="sourceLineNo">366</span> }<a name="line.366"></a>
+<span class="sourceLineNo">367</span><a name="line.367"></a>
+<span class="sourceLineNo">368</span> public long getMinProcId() {<a
name="line.368"></a>
+<span class="sourceLineNo">369</span> return minProcId;<a
name="line.369"></a>
+<span class="sourceLineNo">370</span> }<a name="line.370"></a>
+<span class="sourceLineNo">371</span><a name="line.371"></a>
+<span class="sourceLineNo">372</span> public long getMaxProcId() {<a
name="line.372"></a>
+<span class="sourceLineNo">373</span> return maxProcId;<a
name="line.373"></a>
+<span class="sourceLineNo">374</span> }<a name="line.374"></a>
+<span class="sourceLineNo">375</span><a name="line.375"></a>
+<span class="sourceLineNo">376</span> public boolean contains(long procId)
{<a name="line.376"></a>
+<span class="sourceLineNo">377</span> return getProcedure(procId) !=
null;<a name="line.377"></a>
+<span class="sourceLineNo">378</span> }<a name="line.378"></a>
+<span class="sourceLineNo">379</span><a name="line.379"></a>
+<span class="sourceLineNo">380</span> public boolean isEmpty() {<a
name="line.380"></a>
+<span class="sourceLineNo">381</span> return replayOrderHead == null;<a
name="line.381"></a>
+<span class="sourceLineNo">382</span> }<a name="line.382"></a>
+<span class="sourceLineNo">383</span><a name="line.383"></a>
+<span class="sourceLineNo">384</span> public void clear() {<a
name="line.384"></a>
+<span class="sourceLineNo">385</span> for (int i = 0; i <
procedureMap.length; ++i) {<a name="line.385"></a>
+<span class="sourceLineNo">386</span> procedureMap[i] = null;<a
name="line.386"></a>
+<span class="sourceLineNo">387</span> }<a name="line.387"></a>
+<span class="sourceLineNo">388</span> replayOrderHead = null;<a
name="line.388"></a>
+<span class="sourceLineNo">389</span> replayOrderTail = null;<a
name="line.389"></a>
+<span class="sourceLineNo">390</span> rootHead = null;<a
name="line.390"></a>
+<span class="sourceLineNo">391</span> childUnlinkedHead = null;<a
name="line.391"></a>
+<span class="sourceLineNo">392</span> minProcId = Long.MAX_VALUE;<a
name="line.392"></a>
+<span class="sourceLineNo">393</span> maxProcId = Long.MIN_VALUE;<a
name="line.393"></a>
+<span class="sourceLineNo">394</span> }<a name="line.394"></a>
+<span class="sourceLineNo">395</span><a name="line.395"></a>
+<span class="sourceLineNo">396</span> /*<a name="line.396"></a>
+<span class="sourceLineNo">397</span> * Merges two WalProcedureMap,<a
name="line.397"></a>
+<span class="sourceLineNo">398</span> * the target is the "global" map,
the source is the "local" map.<a name="line.398"></a>
+<span class="sourceLineNo">399</span> * - The entries in the hashtables
are guaranteed to be unique.<a name="line.399"></a>
+<span class="sourceLineNo">400</span> * On replay we don't load
procedures that already exist in the "global"<a name="line.400"></a>
+<span class="sourceLineNo">401</span> * map (the one we are merging the
"local" in to).<a name="line.401"></a>
+<span class="sourceLineNo">402</span> * - The replayOrderList of the
"local" nao will be appended to the "global"<a name="line.402"></a>
+<span class="sourceLineNo">403</span> * map replay list.<a
name="line.403"></a>
+<span class="sourceLineNo">404</span> * - The "local" map will be cleared
at the end of the operation.<a name="line.404"></a>
+<span class="sourceLineNo">405</span> */<a name="line.405"></a>
+<span class="sourceLineNo">406</span> public void mergeTail(WalProcedureMap
other) {<a name="line.406"></a>
+<span class="sourceLineNo">407</span> for (Entry p =
other.replayOrderHead; p != null; p = p.replayNext) {<a name="line.407"></a>
+<span class="sourceLineNo">408</span> int slotIndex =
getMapSlot(p.getProcId());<a name="line.408"></a>
+<span class="sourceLineNo">409</span> p.hashNext =
procedureMap[slotIndex];<a name="line.409"></a>
+<span class="sourceLineNo">410</span> procedureMap[slotIndex] = p;<a
name="line.410"></a>
+<span class="sourceLineNo">411</span> }<a name="line.411"></a>
+<span class="sourceLineNo">412</span><a name="line.412"></a>
+<span class="sourceLineNo">413</span> if (replayOrderHead == null) {<a
name="line.413"></a>
+<span class="sourceLineNo">414</span> replayOrderHead =
other.replayOrderHead;<a name="line.414"></a>
+<span class="sourceLineNo">415</span> replayOrderTail =
other.replayOrderTail;<a name="line.415"></a>
+<span class="sourceLineNo">416</span> rootHead = other.rootHead;<a
name="line.416"></a>
+<span class="sourceLineNo">417</span> childUnlinkedHead =
other.childUnlinkedHead;<a name="line.417"></a>
+<span class="sourceLineNo">418</span> } else {<a name="line.418"></a>
+<span class="sourceLineNo">419</span> // append replay list<a
name="line.419"></a>
+<span class="sourceLineNo">420</span> assert replayOrderTail.replayNext
== null;<a name="line.420"></a>
+<span class="sourceLineNo">421</span> assert
other.replayOrderHead.replayPrev == null;<a name="line.421"></a>
+<span class="sourceLineNo">422</span> replayOrderTail.replayNext =
other.replayOrderHead;<a name="line.422"></a>
+<span class="sourceLineNo">423</span> other.replayOrderHead.replayPrev
= replayOrderTail;<a name="line.423"></a>
+<span class="sourceLineNo">424</span> replayOrderTail =
other.replayOrderTail;<a name="line.424"></a>
<span class="sourceLineNo">425</span><a name="line.425"></a>
-<span class="sourceLineNo">426</span> other.clear();<a
name="line.426"></a>
-<span class="sourceLineNo">427</span> }<a name="line.427"></a>
-<span class="sourceLineNo">428</span><a name="line.428"></a>
-<span class="sourceLineNo">429</span> /*<a name="line.429"></a>
-<span class="sourceLineNo">430</span> * Returns an EntryIterator with the
list of procedures ready<a name="line.430"></a>
-<span class="sourceLineNo">431</span> * to be added to the executor.<a
name="line.431"></a>
-<span class="sourceLineNo">432</span> * A Procedure is ready if its
children and parent are ready.<a name="line.432"></a>
-<span class="sourceLineNo">433</span> */<a name="line.433"></a>
-<span class="sourceLineNo">434</span> public EntryIterator fetchReady() {<a
name="line.434"></a>
-<span class="sourceLineNo">435</span> buildGraph();<a name="line.435"></a>
-<span class="sourceLineNo">436</span><a name="line.436"></a>
-<span class="sourceLineNo">437</span> Entry readyHead = null;<a
name="line.437"></a>
-<span class="sourceLineNo">438</span> Entry readyTail = null;<a
name="line.438"></a>
-<span class="sourceLineNo">439</span> Entry p = replayOrderHead;<a
name="line.439"></a>
-<span class="sourceLineNo">440</span> while (p != null) {<a
name="line.440"></a>
-<span class="sourceLineNo">441</span> Entry next = p.replayNext;<a
name="line.441"></a>
-<span class="sourceLineNo">442</span> if (p.isReady()) {<a
name="line.442"></a>
-<span class="sourceLineNo">443</span> unlinkFromReplayList(p);<a
name="line.443"></a>
-<span class="sourceLineNo">444</span> if (readyTail != null) {<a
name="line.444"></a>
-<span class="sourceLineNo">445</span> readyTail.replayNext = p;<a
name="line.445"></a>
-<span class="sourceLineNo">446</span> p.replayPrev = readyTail;<a
name="line.446"></a>
-<span class="sourceLineNo">447</span> } else {<a name="line.447"></a>
-<span class="sourceLineNo">448</span> p.replayPrev = null;<a
name="line.448"></a>
-<span class="sourceLineNo">449</span> readyHead = p;<a
name="line.449"></a>
-<span class="sourceLineNo">450</span> }<a name="line.450"></a>
-<span class="sourceLineNo">451</span> readyTail = p;<a
name="line.451"></a>
-<span class="sourceLineNo">452</span> p.replayNext = null;<a
name="line.452"></a>
-<span class="sourceLineNo">453</span> }<a name="line.453"></a>
-<span class="sourceLineNo">454</span> p = next;<a name="line.454"></a>
-<span class="sourceLineNo">455</span> }<a name="line.455"></a>
-<span class="sourceLineNo">456</span> // we need the hash-table lookups
for parents, so this must be done<a name="line.456"></a>
-<span class="sourceLineNo">457</span> // out of the loop where we check
isReadyToRun()<a name="line.457"></a>
-<span class="sourceLineNo">458</span> for (p = readyHead; p != null; p =
p.replayNext) {<a name="line.458"></a>
-<span class="sourceLineNo">459</span> removeFromMap(p.getProcId());<a
name="line.459"></a>
-<span class="sourceLineNo">460</span> unlinkFromLinkList(p);<a
name="line.460"></a>
-<span class="sourceLineNo">461</span> }<a name="line.461"></a>
-<span class="sourceLineNo">462</span> return readyHead != null ? new
EntryIterator(readyHead) : null;<a name="line.462"></a>
-<span class="sourceLineNo">463</span> }<a name="line.463"></a>
-<span class="sourceLineNo">464</span><a name="line.464"></a>
-<span class="sourceLineNo">465</span> /*<a name="line.465"></a>
-<span class="sourceLineNo">466</span> * Drain this map and return all
procedures in it.<a name="line.466"></a>
-<span class="sourceLineNo">467</span> */<a name="line.467"></a>
-<span class="sourceLineNo">468</span> public EntryIterator fetchAll() {<a
name="line.468"></a>
-<span class="sourceLineNo">469</span> Entry head = replayOrderHead;<a
name="line.469"></a>
-<span class="sourceLineNo">470</span> for (Entry p = head; p != null; p =
p.replayNext) {<a name="line.470"></a>
-<span class="sourceLineNo">471</span> removeFromMap(p.getProcId());<a
name="line.471"></a>
-<span class="sourceLineNo">472</span> }<a name="line.472"></a>
-<span class="sourceLineNo">473</span> for (int i = 0; i <
procedureMap.length; ++i) {<a name="line.473"></a>
-<span class="sourceLineNo">474</span> assert procedureMap[i] == null :
"map not empty i=" + i;<a name="line.474"></a>
-<span class="sourceLineNo">475</span> }<a name="line.475"></a>
-<span class="sourceLineNo">476</span> replayOrderHead = null;<a
name="line.476"></a>
-<span class="sourceLineNo">477</span> replayOrderTail = null;<a
name="line.477"></a>
-<span class="sourceLineNo">478</span> childUnlinkedHead = null;<a
name="line.478"></a>
-<span class="sourceLineNo">479</span> rootHead = null;<a
name="line.479"></a>
-<span class="sourceLineNo">480</span> return head != null ? new
EntryIterator(head) : null;<a name="line.480"></a>
-<span class="sourceLineNo">481</span> }<a name="line.481"></a>
-<span class="sourceLineNo">482</span><a name="line.482"></a>
-<span class="sourceLineNo">483</span> private void buildGraph() {<a
name="line.483"></a>
-<span class="sourceLineNo">484</span> Entry p = childUnlinkedHead;<a
name="line.484"></a>
-<span class="sourceLineNo">485</span> while (p != null) {<a
name="line.485"></a>
-<span class="sourceLineNo">486</span> Entry next = p.linkNext;<a
name="line.486"></a>
-<span class="sourceLineNo">487</span> Entry rootProc =
getRootProcedure(p);<a name="line.487"></a>
-<span class="sourceLineNo">488</span> if (rootProc != null) {<a
name="line.488"></a>
-<span class="sourceLineNo">489</span> rootProc.childHead =
addToLinkList(p, rootProc.childHead);<a name="line.489"></a>
-<span class="sourceLineNo">490</span> }<a name="line.490"></a>
-<span class="sourceLineNo">491</span> p = next;<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> for (p = rootHead; p != null; p =
p.linkNext) {<a name="line.494"></a>
-<span class="sourceLineNo">495</span> checkReadyToRun(p);<a
name="line.495"></a>
+<span class="sourceLineNo">426</span> // merge rootHead<a
name="line.426"></a>
+<span class="sourceLineNo">427</span> if (rootHead == null) {<a
name="line.427"></a>
+<span class="sourceLineNo">428</span> rootHead = other.rootHead;<a
name="line.428"></a>
+<span class="sourceLineNo">429</span> } else if (other.rootHead !=
null) {<a name="line.429"></a>
+<span class="sourceLineNo">430</span> Entry otherTail =
findLinkListTail(other.rootHead);<a name="line.430"></a>
+<span class="sourceLineNo">431</span> otherTail.linkNext =
rootHead;<a name="line.431"></a>
+<span class="sourceLineNo">432</span> rootHead.linkPrev =
otherTail;<a name="line.432"></a>
+<span class="sourceLineNo">433</span> rootHead = other.rootHead;<a
name="line.433"></a>
+<span class="sourceLineNo">434</span> }<a name="line.434"></a>
+<span class="sourceLineNo">435</span><a name="line.435"></a>
+<span class="sourceLineNo">436</span> // merge childUnlinkedHead<a
name="line.436"></a>
+<span class="sourceLineNo">437</span> if (childUnlinkedHead == null)
{<a name="line.437"></a>
+<span class="sourceLineNo">438</span> childUnlinkedHead =
other.childUnlinkedHead;<a name="line.438"></a>
+<span class="sourceLineNo">439</span> } else if
(other.childUnlinkedHead != null) {<a name="line.439"></a>
+<span class="sourceLineNo">440</span> Entry otherTail =
findLinkListTail(other.childUnlinkedHead);<a name="line.440"></a>
+<span class="sourceLineNo">441</span> otherTail.linkNext =
childUnlinkedHead;<a name="line.441"></a>
+<span class="sourceLineNo">442</span> childUnlinkedHead.linkPrev =
otherTail;<a name="line.442"></a>
+<span class="sourceLineNo">443</span> childUnlinkedHead =
other.childUnlinkedHead;<a name="line.443"></a>
+<span class="sourceLineNo">444</span> }<a name="line.444"></a>
+<span class="sourceLineNo">445</span> }<a name="line.445"></a>
+<span class="sourceLineNo">446</span><a name="line.446"></a>
+<span class="sourceLineNo">447</span> other.clear();<a
name="line.447"></a>
+<span class="sourceLineNo">448</span> }<a name="line.448"></a>
+<span class="sourceLineNo">449</span><a name="line.449"></a>
+<span class="sourceLineNo">450</span> /*<a name="line.450"></a>
+<span class="sourceLineNo">451</span> * Returns an EntryIterator with the
list of procedures ready<a name="line.451"></a>
+<span class="sourceLineNo">452</span> * to be added to the executor.<a
name="line.452"></a>
+<span class="sourceLineNo">453</span> * A Procedure is ready if its
children and parent are ready.<a name="line.453"></a>
+<span class="sourceLineNo">454</span> */<a name="line.454"></a>
+<span class="sourceLineNo">455</span> public EntryIterator fetchReady() {<a
name="line.455"></a>
+<span class="sourceLineNo">456</span> buildGraph();<a name="line.456"></a>
+<span class="sourceLineNo">457</span><a name="line.457"></a>
+<span class="sourceLineNo">458</span> Entry readyHead = null;<a
name="line.458"></a>
+<span class="sourceLineNo">459</span> Entry readyTail = null;<a
name="line.459"></a>
+<span class="sourceLineNo">460</span> Entry p = replayOrderHead;<a
name="line.460"></a>
+<span class="sourceLineNo">461</span> while (p != null) {<a
name="line.461"></a>
+<span class="sourceLineNo">462</span> Entry next = p.replayNext;<a
name="line.462"></a>
+<span class="sourceLineNo">463</span> if (p.isReady()) {<a
name="line.463"></a>
+<span class="sourceLineNo">464</span> unlinkFromReplayList(p);<a
name="line.464"></a>
+<span class="sourceLineNo">465</span> if (readyTail != null) {<a
name="line.465"></a>
+<span class="sourceLineNo">466</span> readyTail.replayNext = p;<a
name="line.466"></a>
+<span class="sourceLineNo">467</span> p.replayPrev = readyTail;<a
name="line.467"></a>
+<span class="sourceLineNo">468</span> } else {<a name="line.468"></a>
+<span class="sourceLineNo">469</span> p.replayPrev = null;<a
name="line.469"></a>
+<span class="sourceLineNo">470</span> readyHead = p;<a
name="line.470"></a>
+<span class="sourceLineNo">471</span> }<a name="line.471"></a>
+<span class="sourceLineNo">472</span> readyTail = p;<a
name="line.472"></a>
+<span class="sourceLineNo">473</span> p.replayNext = null;<a
name="line.473"></a>
+<span class="sourceLineNo">474</span> }<a name="line.474"></a>
+<span class="sourceLineNo">475</span> p = next;<a name="line.475"></a>
+<span class="sourceLineNo">476</span> }<a name="line.476"></a>
+<span class="sourceLineNo">477</span> // we need the hash-table lookups
for parents, so this must be done<a name="line.477"></a>
+<span class="sourceLineNo">478</span> // out of the loop where we check
isReadyToRun()<a name="line.478"></a>
+<span class="sourceLineNo">479</span> for (p = readyHead; p != null; p =
p.replayNext) {<a name="line.479"></a>
+<span class="sourceLineNo">480</span> removeFromMap(p.getProcId());<a
name="line.480"></a>
+<span class="sourceLineNo">481</span> unlinkFromLinkList(p);<a
name="line.481"></a>
+<span class="sourceLineNo">482</span> }<a name="line.482"></a>
+<span class="sourceLineNo">483</span> return readyHead != null ? new
EntryIterator(readyHead) : null;<a name="line.483"></a>
+<span class="sourceLineNo">484</span> }<a name="line.484"></a>
+<span class="sourceLineNo">485</span><a name="line.485"></a>
+<span class="sourceLineNo">486</span> /*<a name="line.486"></a>
+<span class="sourceLineNo">487</span> * Drain this map and return all
procedures in it.<a name="line.487"></a>
+<span class="sourceLineNo">488</span> */<a name="line.488"></a>
+<span class="sourceLineNo">489</span> public EntryIterator fetchAll() {<a
name="line.489"></a>
+<span class="sourceLineNo">490</span> Entry head = replayOrderHead;<a
name="line.490"></a>
+<span class="sourceLineNo">491</span> for (Entry p = head; p != null; p =
p.replayNext) {<a name="line.491"></a>
+<span class="sourceLineNo">492</span> removeFromMap(p.getProcId());<a
name="line.492"></a>
+<span class="sourceLineNo">493</span> }<a name="line.493"></a>
+<span class="sourceLineNo">494</span> for (int i = 0; i <
procedureMap.length; ++i) {<a name="line.494"></a>
+<span class="sourceLineNo">495</span> assert procedureMap[i] == null :
"map not empty i=" + i;<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><a name="line.498"></a>
-<span class="sourceLineNo">499</span> private Entry getRootProcedure(Entry
entry) {<a name="line.499"></a>
-<span class="sourceLineNo">500</span> while (entry != null &&
entry.hasParent()) {<a name="line.500"></a>
-<span class="sourceLineNo">501</span> entry =
getProcedure(entry.getParentId());<a name="line.501"></a>
-<span class="sourceLineNo">502</span> }<a name="line.502"></a>
-<span class="sourceLineNo">503</span> return entry;<a name="line.503"></a>
-<span class="sourceLineNo">504</span> }<a name="line.504"></a>
-<span class="sourceLineNo">505</span><a name="line.505"></a>
-<span class="sourceLineNo">506</span> /*<a name="line.506"></a>
-<span class="sourceLineNo">507</span> * (see the comprehensive
explaination in the beginning of the file)<a name="line.507"></a>
-<span class="sourceLineNo">508</span> * A Procedure is ready when parent
and children are ready.<a name="line.508"></a>
-<span class="sourceLineNo">509</span> * "ready" means that we all the
information that we need in-memory.<a name="line.509"></a>
-<span class="sourceLineNo">510</span> *<a name="line.510"></a>
-<span class="sourceLineNo">511</span> * Example-1:<a name="line.511"></a>
-<span class="sourceLineNo">512</span> * We have two WALs, we start reading
fronm the newest (wal-2)<a name="line.512"></a>
-<span class="sourceLineNo">513</span> * wal-2 | C B |<a
name="line.513"></a>
-<span class="sourceLineNo">514</span> * wal-1 | A B C |<a
name="line.514"></a>
-<span class="sourceLineNo">515</span> *<a name="line.515"></a>
-<span class="sourceLineNo">516</span> * If C and B don't depend on A (A is
not the parent), we can start them<a name="line.516"></a>
-<span class="sourceLineNo">517</span> * before reading wal-1. If B is the
only one with parent A we can start C<a name="line.517"></a>
-<span class="sourceLineNo">518</span> * and read one more WAL before being
able to start B.<a name="line.518"></a>
-<span class="sourceLineNo">519</span> *<a name="line.519"></a>
-<span class="sourceLineNo">520</span> * How do we know with the only
information in B that we are not ready.<a name="line.520"></a>
-<span class="sourceLineNo">521</span> * - easy case, the parent is
missing from the global map<a name="line.521"></a>
-<span class="sourceLineNo">522</span> * - more complex case we look at
the Stack IDs<a name="line.522"></a>
-<span class="sourceLineNo">523</span> *<a name="line.523"></a>
-<span class="sourceLineNo">524</span> * The Stack-IDs are added to the
procedure order as incremental index<a name="line.524"></a>
-<span class="sourceLineNo">525</span> * tracking how many times that
procedure was executed, which is equivalent<a name="line.525"></a>
-<span class="sourceLineNo">526</span> * at the number of times we wrote
the procedure to the WAL.<a name="line.526"></a>
-<span class="sourceLineNo">527</span> * In the example above:<a
name="line.527"></a>
-<span class="sourceLineNo">528</span> * wal-2: B has stackId = [1, 2]<a
name="line.528"></a>
-<span class="sourceLineNo">529</span> * wal-1: B has stackId = [1]<a
name="line.529"></a>
-<span class="sourceLineNo">530</span> * wal-1: A has stackId = [0]<a
name="line.530"></a>
+<span class="sourceLineNo">497</span> replayOrderHead = null;<a
name="line.497"></a>
+<span class="sourceLineNo">498</span> replayOrderTail = null;<a
name="line.498"></a>
+<span class="sourceLineNo">499</span> childUnlinkedHead = null;<a
name="line.499"></a>
+<span class="sourceLineNo">500</span> rootHead = null;<a
name="line.500"></a>
+<span class="sourceLineNo">501</span> return head != null ? new
EntryIterator(head) : null;<a name="line.501"></a>
+<span class="sourceLineNo">502</span> }<a name="line.502"></a>
+<span class="sourceLineNo">503</span><a name="line.503"></a>
+<span class="sourceLineNo">504</span> private void buildGraph() {<a
name="line.504"></a>
+<span class="sourceLineNo">505</span> Entry p = childUnlinkedHead;<a
name="line.505"></a>
+<span class="sourceLineNo">506</span> while (p != null) {<a
name="line.506"></a>
+<span class="sourceLineNo">507</span> Entry next = p.linkNext;<a
name="line.507"></a>
+<span class="sourceLineNo">508</span> Entry rootProc =
getRootProcedure(p);<a name="line.508"></a>
+<span class="sourceLineNo">509</span> if (rootProc != null) {<a
name="line.509"></a>
+<span class="sourceLineNo">510</span> rootProc.childHead =
addToLinkList(p, rootProc.childHead);<a name="line.510"></a>
+<span class="sourceLineNo">511</span> }<a name="line.511"></a>
+<span class="sourceLineNo">512</span> p = next;<a name="line.512"></a>
+<span class="sourceLineNo">513</span> }<a name="line.513"></a>
+<span class="sourceLineNo">514</span><a name="line.514"></a>
+<span class="sourceLineNo">515</span> for (p = rootHead; p != null; p =
p.linkNext) {<a name="line.515"></a>
+<span class="sourceLineNo">516</span> checkReadyToRun(p);<a
name="line.516"></a>
+<span class="sourceLineNo">517</span> }<a name="line.517"></a>
+<span class="sourceLineNo">518</span> }<a name="line.518"></a>
+<span class="sourceLineNo">519</span><a name="line.519"></a>
+<span class="sourceLineNo">520</span> private Entry getRootProcedure(Entry
entry) {<a name="line.520"></a>
+<span class="sourceLineNo">521</span> while (entry != null &&
entry.hasParent()) {<a name="line.521"></a>
+<span class="sourceLineNo">522</span> entry =
getProcedure(entry.getParentId());<a name="line.522"></a>
+<span class="sourceLineNo">523</span> }<a name="line.523"></a>
+<span class="sourceLineNo">524</span> return entry;<a name="line.524"></a>
+<span class="sourceLineNo">525</span> }<a name="line.525"></a>
+<span class="sourceLineNo">526</span><a name="line.526"></a>
+<span class="sourceLineNo">527</span> /*<a name="line.527"></a>
+<span class="sourceLineNo">528</span> * (see the comprehensive
explaination in the beginning of the file)<a name="line.528"></a>
+<span class="sourceLineNo">529</span> * A Procedure is ready when parent
and children are ready.<a name="line.529"></a>
+<span class="sourceLineNo">530</span> * "ready" means that we all the
information that we need in-memory.<a name="line.530"></a>
<span class="sourceLineNo">531</span> *<a name="line.531"></a>
-<span class="sourceLineNo">532</span> * Since we know that the Stack-IDs
are incremental for a Procedure,<a name="line.532"></a>
-<span class="sourceLineNo">533</span> * we notice that there is a gap in
the stackIds of B, so something was<a name="line.533"></a>
-<span class="sourceLineNo">534</span> * executed before.<a
name="line.534"></a>
-<span class="sourceLineNo">535</span> * To identify when a Procedure is
ready we do the sum of the stackIds of<a name="line.535"></a>
-<span class="sourceLineNo">536</span> * the procedure and the parent. if
the stackIdSum is equals to the<a name="line.536"></a>
-<span class="sourceLineNo">537</span> * sum of {1..maxStackId} then
everything we need is avaiable.<a name="line.537"></a>
-<span class="sourceLineNo">538</span> *<a name="line.538"></a>
-<span class="sourceLineNo">539</span> * Example-2<a name="line.539"></a>
-<span class="sourceLineNo">540</span> * wal-2 | A | A
stackIds = [0, 2]<a name="line.540"></a>
-<span class="sourceLineNo">541</span> * wal-1 | A B | B
stackIds = [1]<a name="line.541"></a>
-<span class="sourceLineNo">542</span> *<a name="line.542"></a>
-<span class="sourceLineNo">543</span> * There is a gap between A stackIds
so something was executed in between.<a name="line.543"></a>
-<span class="sourceLineNo">544</span> */<a name="line.544"></a>
-<span class="sourceLineNo">545</span> private boolean checkReadyToRun(Entry
rootEntry) {<a name="line.545"></a>
-<span class="sourceLineNo">546</span> int stackIdSum = 0;<a
name="line.546"></a>
-<span class="sourceLineNo">547</span> int maxStackId = 0;<a
name="line.547"></a>
-<span class="sourceLineNo">548</span> for (int i = 0; i <
rootEntry.proto.getStackIdCount(); ++i) {<a name="line.548"></a>
-<span class="sourceLineNo">549</span> int stackId = 1 +
rootEntry.proto.getStackId(i);<a name="line.549"></a>
-<span class="sourceLineNo">550</span> maxStackId =
Math.max(maxStackId, stackId);<a name="line.550"></a>
-<span class="sourceLineNo">551</span> stackIdSum += stackId;<a
name="line.551"></a>
-<span class="sourceLineNo">552</span> }<a name="line.552"></a>
-<span class="sourceLineNo">553</span><a name="line.553"></a>
-<span class="sourceLineNo">554</span> for (Entry p = rootEntry.childHead;
p != null; p = p.linkNext) {<a name="line.554"></a>
-<span class="sourceLineNo">555</span> for (int i = 0; i <
p.proto.getStackIdCount(); ++i) {<a name="line.555"></a>
-<span class="sourceLineNo">556</span> int stackId = 1 +
p.proto.getStackId(i);<a name="line.556"></a>
-<span class="sourceLineNo">557</span> maxStackId =
Math.max(maxStackId, stackId);<a name="line.557"></a>
-<span class="sourceLineNo">558</span> stackIdSum += stackId;<a
name="line.558"></a>
-<span class="sourceLineNo">559</span> }<a name="line.559"></a>
-<span class="sourceLineNo">560</span> }<a name="line.560"></a>
-<span class="sourceLineNo">561</span> final int cmpStackIdSum =
(maxStackId * (maxStackId + 1) / 2);<a name="line.561"></a>
-<span class="sourceLineNo">562</span> if (cmpStackIdSum == stackIdSum)
{<a name="line.562"></a>
-<span class="sourceLineNo">563</span> rootEntry.ready = true;<a
name="line.563"></a>
-<span class="sourceLineNo">564</span> for (Entry p =
rootEntry.childHead; p != null; p = p.linkNext) {<a name="line.564"></a>
-<span class="sourceLineNo">565</span> p.ready = true;<a
name="line.565"></a>
-<span class="sourceLineNo">566</span> }<a name="line.566"></a>
-<span class="sourceLineNo">567</span> return true;<a
name="line.567"></a>
-<span class="sourceLineNo">568</span> }<a name="line.568"></a>
-<span class="sourceLineNo">569</span> return false;<a name="line.569"></a>
-<span class="sourceLineNo">570</span> }<a name="line.570"></a>
-<span class="sourceLineNo">571</span><a name="line.571"></a>
-<span class="sourceLineNo">572</span> private void
unlinkFromReplayList(Entry entry) {<a name="line.572"></a>
-<span class="sourceLineNo">573</span> if (replayOrderHead == entry) {<a
name="line.573"></a>
-<span class="sourceLineNo">574</span> replayOrderHead =
entry.replayNext;<a name="line.574"></a>
-<span class="sourceLineNo">575</span> }<a name="line.575"></a>
-<span class="sourceLineNo">576</span> if (replayOrderTail == entry) {<a
name="line.576"></a>
-<span class="sourceLineNo">577</span> replayOrderTail =
entry.replayPrev;<a name="line.577"></a>
-<span class="sourceLineNo">578</span> }<a name="line.578"></a>
-<span class="sourceLineNo">579</span> if (entry.replayPrev != null) {<a
name="line.579"></a>
-<span class="sourceLineNo">580</span> entry.replayPrev.replayNext =
entry.replayNext;<a name="line.580"></a>
+<span class="sourceLineNo">532</span> * Example-1:<a name="line.532"></a>
+<span class="sourceLineNo">533</span> * We have two WALs, we start reading
fronm the newest (wal-2)<a name="line.533"></a>
+<span class="sourceLineNo">534</span> * wal-2 | C B |<a
name="line.534"></a>
+<span class="sourceLineNo">535</span> * wal-1 | A B C |<a
name="line.535"></a>
+<span class="sourceLineNo">536</span> *<a name="line.536"></a>
+<span class="sourceLineNo">537</span> * If C and B don't depend on A (A is
not the parent), we can start them<a name="line.537"></a>
+<span class="sourceLineNo">538</span> * before reading wal-1. If B is the
only one with parent A we can start C<a name="line.538"></a>
+<span class="sourceLineNo">539</span> * and read one more WAL before being
able to start B.<a name="line.539"></a>
+<span class="sourceLineNo">540</span> *<a name="line.540"></a>
+<span class="sourceLineNo">541</span> * How do we know with the only
information in B that we are not ready.<a name="line.541"></a>
+<span class="sourceLineNo">542</span> * - easy case, the parent is
missing from the global map<a name="line.542"></a>
+<span class="sourceLineNo">543</span> * - more complex case we look at
the Stack IDs<a name="line.543"></a>
+<span class="sourceLineNo">544</span> *<a name="line.544"></a>
+<span class="sourceLineNo">545</span> * The Stack-IDs are added to the
procedure order as incremental index<a name="line.545"></a>
+<span class="sourceLineNo">546</span> * tracking how many times that
procedure was executed, which is equivalent<a name="line.546"></a>
+<span class="sourceLineNo">547</span> * at the number of times we wrote
the procedure to the WAL.<a name="line.547"></a>
+<span class="sourceLineNo">548</span> * In the example above:<a
name="line.548"></a>
+<span class="sourceLineNo">549</span> * wal-2: B has stackId = [1, 2]<a
name="line.549"></a>
+<span class="sourceLineNo">550</span> * wal-1: B has stackId = [1]<a
name="line.550"></a>
+<span class="sourceLineNo">551</span> * wal-1: A has stackId = [0]<a
name="line.551"></a>
+<span class="sourceLineNo">552</span> *<a name="line.552"></a>
+<span class="sourceLineNo">553</span> * Since we know that the Stack-IDs
are incremental for a Procedure,<a name="line.553"></a>
+<span class="sourceLineNo">554</span> * we notice that there is a gap in
the stackIds of B, so something was<a name="line.554"></a>
+<span class="sourceLineNo">555</span> * executed before.<a
name="line.555"></a>
+<span class="sourceLineNo">556</span> * To identify when a Procedure is
ready we do the sum of the stackIds of<a name="line.556"></a>
+<span class="sourceLineNo">557</span> * the procedure and the parent. if
the stackIdSum is equals to the<a name="line.557"></a>
+<span class="sourceLineNo">558</span> * sum of {1..maxStackId} then
everything we need is avaiable.<a name="line.558"></a>
+<span class="sourceLineNo">559</span> *<a name="line.559"></a>
+<span class="sourceLineNo">560</span> * Example-2<a name="line.560"></a>
+<span class="sourceLineNo">561</span> * wal-2 | A | A
stackIds = [0, 2]<a name="line.561"></a>
+<span class="sourceLineNo">562</span> * wal-1 | A B | B
stackIds = [1]<a name="line.562"></a>
+<span class="sourceLineNo">563</span> *<a name="line.563"></a>
+<span class="sourceLineNo">564</span> * There is a gap between A stackIds
so something was executed in between.<a name="line.564"></a>
+<span class="sourceLineNo">565</span> */<a name="line.565"></a>
+<span class="sourceLineNo">566</span> private boolean checkReadyToRun(Entry
rootEntry) {<a name="line.566"></a>
+<span class="sourceLineNo">567</span> int stackIdSum = 0;<a
name="line.567"></a>
+<span class="sourceLineNo">568</span> int maxStackId = 0;<a
name="line.568"></a>
+<span class="sourceLineNo">569</span> for (int i = 0; i <
rootEntry.proto.getStackIdCount(); ++i) {<a name="line.569"></a>
+<span class="sourceLineNo">570</span> int stackId = 1 +
rootEntry.proto.getStackId(i);<a name="line.570"></a>
+<span class="sourceLineNo">571</span> maxStackId =
Math.max(maxStackId, stackId);<a name="line.571"></a>
+<span class="sourceLineNo">572</span> stackIdSum += stackId;<a
name="line.572"></a>
+<span class="sourceLineNo">573</span> }<a name="line.573"></a>
+<span class="sourceLineNo">574</span><a name="line.574"></a>
+<span class="sourceLineNo">575</span> for (Entry p = rootEntry.childHead;
p != null; p = p.linkNext) {<a name="line.575"></a>
+<span class="sourceLineNo">576</span> for (int i = 0; i <
p.proto.getStackIdCount(); ++i) {<a name="line.576"></a>
+<span class="sourceLineNo">577</span> int stackId = 1 +
p.proto.getStackId(i);<a name="line.577"></a>
+<span class="sourceLineNo">578</span> maxStackId =
Math.max(maxStackId, stackId);<a name="line.578"></a>
+<span class="sourceLineNo">579</span> stackIdSum += stackId;<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> if (entry.replayNext != null) {<a
name="line.582"></a>
-<span class="sourceLineNo">583</span> entry.replayNext.replayPrev =
entry.replayPrev;<a name="line.583"></a>
-<span class="sourceLineNo">584</span> }<a name="line.584"></a>
-<span class="sourceLineNo">585</span> }<a name="line.585"></a>
-<span class="sourceLineNo">586</span><a name="line.586"></a>
-<span class="sourceLineNo">587</span> private void addToReplayList(final
Entry entry) {<a name="line.587"></a>
-<span class="sourceLineNo">588</span> unlinkFromReplayList(entry);<a
name="line.588"></a>
-<span class="sourceLineNo">589</span> entry.replayNext =
replayOrderHead;<a name="line.589"></a>
-<span class="sourceLineNo">590</span> entry.replayPrev = null;<a
name="line.590"></a>
-<span class="sourceLineNo">591</span> if (replayOrderHead != null) {<a
name="line.591"></a>
-<span class="sourceLineNo">592</span> replayOrderHead.replayPrev =
entry;<a name="line.592"></a>
-<span class="sourceLineNo">593</span> } else {<a name="line.593"></a>
-<span class="sourceLineNo">594</span> replayOrderTail = entry;<a
name="line.594"></a>
-<span class="sourceLineNo">595</span> }<a name="line.595"></a>
-<span class="sourceLineNo">596</span> replayOrderHead = entry;<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> private void unlinkFromLinkList(Entry
entry) {<a name="line.599"></a>
-<span class="sourceLineNo">600</span> if (entry == rootHead) {<a
name="line.600"></a>
-<span class="sourceLineNo">601</span> rootHead = entry.linkNext;<a
name="line.601"></a>
-<span class="sourceLineNo">602</span> } else if (entry ==
childUnlinkedHead) {<a name="line.602"></a>
-<span class="sourceLineNo">603</span> childUnlinkedHead =
entry.linkNext;<a name="line.603"></a>
-<span class="sourceLineNo">604</span> }<a name="line.604"></a>
-<span class="sourceLineNo">605</span> if (entry.linkPrev != null) {<a
name="line.605"></a>
-<span class="sourceLineNo">606</span> entry.linkPrev.linkNext =
entry.linkNext;<a name="line.606"></a>
-<span class="sourceLineNo">607</span> }<a name="line.607"></a>
-<span class="sourceLineNo">608</span> if (entry.linkNext != null) {<a
name="line.608"></a>
-<span class="sourceLineNo">609</span> entry.linkNext.linkPrev =
entry.linkPrev;<a name="line.609"></a>
-<span class="sourceLineNo">610</span> }<a name="line.610"></a>
-<span class="sourceLineNo">611</span> }<a name="line.611"></a>
-<span class="sourceLineNo">612</span><a name="line.612"></a>
-<span class="sourceLineNo">613</span> private Entry addToLinkList(Entry
entry, Entry linkHead) {<a name="line.613"></a>
-<span class="sourceLineNo">614</span> unlinkFromLinkList(entry);<a
name="line.614"></a>
-<span class="sourceLineNo">615</span> entry.linkNext = linkHead;<a
name="line.615"></a>
-<span class="sourceLineNo">616</span> entry.linkPrev = null;<a
name="line.616"></a>
-<span class="sourceLineNo">617</span> if (linkHead != null) {<a
name="line.617"></a>
-<span class="sourceLineNo">618</span> linkHead.linkPrev = entry;<a
name="line.618"></a>
-<span class="sourceLineNo">619</span> }<a name="line.619"></a>
-<span class="sourceLineNo">620</span> return entry;<a name="line.620"></a>
-<span class="sourceLineNo">621</span> }<a name="line.621"></a>
-<span class="sourceLineNo">622</span><a name="line.622"></a>
-<span class="sourceLineNo">623</span> private Entry findLinkListTail(Entry
linkHead) {<a name="line.623"></a>
-<span class="sourceLineNo">624</span> Entry tail = linkHead;<a
name="line.624"></a>
-<span class="sourceLineNo">625</span> while (tail.linkNext != null) {<a
name="line.625"></a>
-<span class="sourceLineNo">626</span> tail = tail.linkNext;<a
name="line.626"></a>
-<span class="sourceLineNo">627</span> }<a name="line.627"></a>
-<span class="sourceLineNo">628</span> return tail;<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> private Entry addToMap(final long
procId, final boolean hasParent) {<a name="line.631"></a>
-<span class="sourceLineNo">632</span> int slotIndex =
getMapSlot(procId);<a name="line.632"></a>
-<span class="sourceLineNo">633</span> Entry entry =
getProcedure(slotIndex, procId);<a name="line.633"></a>
-<span class="sourceLineNo">634</span> if (entry != null) return entry;<a
name="line.634"></a>
-<span class="sourceLineNo">635</span><a name="line.635"></a>
-<span class="sourceLineNo">636</span> entry = new
Entry(procedureMap[slotIndex]);<a name="line.636"></a>
-<span class="sourceLineNo">637</span> procedureMap[slotIndex] = entry;<a
name="line.637"></a>
-<span class="sourceLineNo">638</span> return entry;<a name="line.638"></a>
-<span class="sourceLineNo">639</span> }<a name="line.639"></a>
-<span class="sourceLineNo">640</span><a name="line.640"></a>
-<span class="sourceLineNo">641</span> private Entry removeFromMap(final
long procId) {<a name="line.641"></a>
-<span class="sourceLineNo">642</span> int slotIndex =
getMapSlot(procId);<a name="line.642"></a>
-<span class="sourceLineNo">643</span> Entry prev = null;<a
name="line.643"></a>
-<span class="sourceLineNo">644</span> Entry entry =
procedureMap[slotIndex];<a name="line.644"></a>
-<span class="sourceLineNo">645</span> while (entry != null) {<a
name="line.645"></a>
-<span class="sourceLineNo">646</span> if (procId == entry.getProcId())
{<a name="line.646"></a>
-<span class="sourceLineNo">647</span> if (prev != null) {<a
name="line.647"></a>
-<span class="sourceLineNo">648</span> prev.hashNext =
entry.hashNext;<a name="line.648"></a>
-<span class="sourceLineNo">649</span> } else {<a name="line.649"></a>
-<span class="sourceLineNo">650</span> procedureMap[slotIndex] =
entry.hashNext;<a name="line.650"></a>
-<span class="sourceLineNo">651</span> }<a name="line.651"></a>
-<span class="sourceLineNo">652</span> entry.hashNext = null;<a
name="line.652"></a>
-<span class="sourceLineNo">653</span> return entry;<a
name="line.653"></a>
-<span class="sourceLineNo">654</span> }<a name="line.654"></a>
-<span class="sourceLineNo">655</span> prev = entry;<a
name="line.655"></a>
-<span class="sourceLineNo">656</span> entry = entry.hashNext;<a
name="line.656"></a>
-<span class="sourceLineNo">657</span> }<a name="line.657"></a>
-<span class="sourceLineNo">658</span> return null;<a name="line.658"></a>
-<span class="sourceLineNo">659</span> }<a name="line.659"></a>
-<span class="sourceLineNo">660</span><a name="line.660"></a>
-<span class="sourceLineNo">661</span> private Entry getProcedure(final long
procId) {<a name="line.661"></a>
-<span class="sourceLineNo">662</span> return
getProcedure(getMapSlot(procId), procId);<a name="line.662"></a>
-<span class="sourceLineNo">663</span> }<a name="line.663"></a>
-<span class="sourceLineNo">664</span><a name="line.664"></a>
-<span class="sourceLineNo">665</span> private Entry getProcedure(final int
slotIndex, final long procId) {<a name="line.665"></a>
-<span class="sourceLineNo">666</span> Entry entry =
procedureMap[slotIndex];<a name="line.666"></a>
-<span class="sourceLineNo">667</span> while (entry != null) {<a
name="line.667"></a>
-<span class="sourceLineNo">668</span> if (procId == entry.getProcId())
{<a name="line.668"></a>
-<span class="sourceLineNo">669</span> return entry;<a
name="line.669"></a>
-<span class="sourceLineNo">670</span> }<a name="line.670"></a>
-<span class="sourceLineNo">671</span> entry = entry.hashNext;<a
name="line.671"></a>
-<span class="sourceLineNo">672</span> }<a name="line.672"></a>
-<span class="sourceLineNo">673</span> return null;<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> private int getMapSlot(final long
procId) {<a name="line.676"></a>
-<span class="sourceLineNo">677</span> return
(int)(Procedure.getProcIdHashCode(procId) % procedureMap.length);<a
name="line.677"></a>
-<span class="sourceLineNo">678</span> }<a name="line.678"></a>
-<span class="sourceLineNo">679</span> }<a name="line.679"></a>
-<span class="sourceLineNo">680</span>}<a name="line.680"></a>
+<span class="sourceLineNo">582</span> final int cmpStackIdSum =
(maxStackId * (maxStackId + 1) / 2);<a name="line.582"></a>
+<span class="sourceLineNo">583</span> if (cmpStackIdSum == stackIdSum)
{<a name="line.583"></a>
+<span class="sourceLineNo">584</span> rootEntry.ready = true;<a
name="line.584"></a>
+<span class="sourceLineNo">585</span> for (Entry p =
rootEntry.childHead; p != null; p = p.linkNext) {<a name="line.585"></a>
+<span class="sourceLineNo">586</span> p.ready = true;<a
name="line.586"></a>
+<span class="sourceLineNo">587</span> }<a name="line.587"></a>
+<span class="sourceLineNo">588</span> return true;<a
name="line.588"></a>
+<span class="sourceLineNo">589</span> }<a name="line.589"></a>
+<span class="sourceLineNo">590</span> return false;<a name="line.590"></a>
+<span class="sourceLineNo">591</span> }<a name="line.591"></a>
+<span class="sourceLineNo">592</span><a name="line.592"></a>
+<span class="sourceLineNo">593</span> private void
unlinkFromReplayList(Entry entry) {<a name="line.593"></a>
+<span class="sourceLineNo">594</span> if (replayOrderHead == entry) {<a
name="line.594"></a>
+<span class="sourceLineNo">595</span> replayOrderHead =
entry.replayNext;<a name="line.595"></a>
+<span class="sourceLineNo">596</span> }<a name="line.596"></a>
+<span class="sourceLineNo">597</span> if (replayOrderTail == entry) {<a
name="line.597"></a>
+<span class="sourceLineNo">598</span> replayOrderTail =
entry.replayPrev;<a name="line.598"></a>
+<span class="sourceLineNo">599</span> }<a name="line.599"></a>
+<span class="sourceLineNo">600</span> if (entry.replayPrev != null) {<a
name="line.600"></a>
+<span class="sourceLineNo">601</span> entry.replayPrev.replayNext =
entry.replayNext;<a name="line.601"></a>
+<span class="sourceLineNo">602</span> }<a name="line.602"></a>
+<span class="sourceLineNo">603</span> if (entry.replayNext != null) {<a
name="line.603"></a>
+<span class="sourceLineNo">604</span> entry.replayNext.replayPrev =
entry.replayPrev;<a name="line.604"></a>
+<span class="sourceLineNo">605</span> }<a name="line.605"></a>
+<span class="sourceLineNo">606</span> }<a name="line.606"></a>
+<span class="sourceLineNo">607</span><a name="line.607"></a>
+<span class="sourceLineNo">608</span> private void addToReplayList(final
Entry entry) {<a name="line.608"></a>
+<span class="sourceLineNo">609</span> unlinkFromReplayList(entry);<a
name="line.609"></a>
+<span class="sourceLineNo">610</span> entry.replayNext =
replayOrderHead;<a name="line.610"></a>
+<span class="sourceLineNo">611</span> entry.replayPrev = null;<a
name="line.611"></a>
+<span class="sourceLineNo">612</span> if (replayOrderHead != null) {<a
name="line.612"></a>
+<span class="sourceLineNo">613</span> replayOrderHead.replayPrev =
entry;<a name="line.613"></a>
+<span class="sourceLineNo">614</span> } else {<a name="line.614"></a>
+<span class="sourceLineNo">615</span> replayOrderTail = entry;<a
name="line.615"></a>
+<span class="sourceLineNo">616</span> }<a name="line.616"></a>
+<span class="sourceLineNo">617</span> replayOrderHead = entry;<a
name="line.617"></a>
+<span class="sourceLineNo">618</span> }<a name="line.618"></a>
+<span class="sourceLineNo">619</span><a name="line.619"></a>
+<span class="sourceLineNo">620</span> private void unlinkFromLinkList(Entry
entry) {<a name="line.620"></a>
+<span class="sourceLineNo">621</span> if (entry == rootHead) {<a
name="line.621"></a>
+<span class="sourceLineNo">622</span> rootHead = entry.linkNext;<a
name="line.622"></a>
+<span class="sourceLineNo">623</span> } else if (entry ==
childUnlinkedHead) {<a name="line.623"></a>
+<span class="sourceLineNo">624</span> childUnlinkedHead =
entry.linkNext;<a name="line.624"></a>
+<span class="sourceLineNo">625</span> }<a name="line.625"></a>
+<span class="sourceLineNo">626</span> if (entry.linkPrev != null) {<a
name="line.626"></a>
+<span class="sourceLineNo">627</span> entry.linkPrev.linkNext =
entry.linkNext;<a name="line.627"></a>
+<span class="sourceLineNo">628</span> }<a name="line.628"></a>
+<span class="sourceLineNo">629</span> if (entry.linkNext != null) {<a
name="line.629"></a>
+<span class="sourceLineNo">630</span> entry.linkNext.linkPrev =
entry.linkPrev;<a name="line.630"></a>
+<span class="sourceLineNo">631</span> }<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> private Entry addToLinkList(Entry
entry, Entry linkHead) {<a name="line.634"></a>
+<span class="sourceLineNo">635</span> unlinkFromLinkList(entry);<a
name="line.635"></a>
+<span class="sourceLineNo">636</span> entry.linkNext = linkHead;<a
name="line.636"></a>
+<span class="sourceLineNo">637</span> entry.linkPrev = null;<a
name="line.637"></a>
+<span class="sourceLineNo">638</span> if (linkHead != null) {<a
name="line.638"></a>
+<span class="sourceLineNo">639</span> linkHead.linkPrev = entry;<a
name="line.639"></a>
+<span class="sourceLineNo">640</span> }<a name="line.640"></a>
+<span class="sourceLineNo">641</span> return entry;<a name="line.641"></a>
+<span class="sourceLineNo">642</span> }<a name="line.642"></a>
+<span class="sourceLineNo">643</span><a name="line.643"></a>
+<span class="sourceLineNo">644</span> private Entry findLinkListTail(Entry
linkHead) {<a name="line.644"></a>
+<span class="sourceLineNo">645</span> Entry tail = linkHead;<a
name="line.645"></a>
+<span class="sourceLineNo">646</span> while (tail.linkNext != null) {<a
name="line.646"></a>
+<span class="sourceLineNo">647</span> tail = tail.linkNext;<a
name="line.647"></a>
+<span class="sourceLineNo">648</span> }<a name="line.648"></a>
+<span class="sourceLineNo">649</span> return tail;<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 Entry addToMap(final long
procId, final boolean hasParent) {<a name="line.652"></a>
+<span class="sourceLineNo">653</span> int slotIndex =
getMapSlot(procId);<a name="line.653"></a>
+<span class="sourceLineNo">654</span> Entry entry =
getProcedure(slotIndex, procId);<a name="line.654"></a>
+<span class="sourceLineNo">655</span> if (entry != null) return entry;<a
name="line.655"></a>
+<span class="sourceLineNo">656</span><a name="line.656"></a>
+<span class="sourceLineNo">657</span> entry = new
Entry(procedureMap[slotIndex]);<a name="line.657"></a>
+<span class="sourceLineNo">658</span> procedureMap[slotIndex] = entry;<a
name="line.658"></a>
+<span class="sourceLineNo">659</span> return entry;<a name="line.659"></a>
+<span class="sourceLineNo">660</span> }<a name="line.660"></a>
+<span class="sourceLineNo">661</span><a name="line.661"></a>
+<span class="sourceLineNo">662</span> private Entry removeFromMap(final
long procId) {<a name="line.662"></a>
+<span class="sourceLineNo">663</span> int slotIndex =
getMapSlot(procId);<a name="line.663"></a>
+<span class="sourceLineNo">664</span> Entry prev = null;<a
name="line.664"></a>
+<span class="sourceLineNo">665</span> Entry entry =
procedureMap[slotIndex];<a name="line.665"></a>
+<span class="sourceLineNo">666</span> while (entry != null) {<a
name="line.666"></a>
+<span class="sourceLineNo">667</span> if (procId == entry.getProcId())
{<a name="line.667"></a>
+<span class="sourceLineNo">668</span> if (prev != null) {<a
name="line.668"></a>
+<span class="sourceLineNo">669</span> prev.hashNext =
entry.hashNext;<a name="line.669"></a>
+<span class="sourceLineNo">670</span> } else {<a name="line.670"></a>
+<span class="sourceLineNo">671</span> procedureMap[slotIndex] =
entry.hashNext;<a name="line.671"></a>
+<span class="sourceLineNo">672</span> }<a name="line.672"></a>
+<span class="sourceLineNo">673</span> entry.hashNext = null;<a
name="line.673"></a>
+<span class="sourceLineNo">674</span> return entry;<a
name="line.674"></a>
+<span class="sourceLineNo">675</span> }<a name="line.675"></a>
+<span class="sourceLineNo">676</span> prev = entry;<a
name="line.676"></a>
+<span class="sourceLineNo">677</span> entry = entry.hashNext;<a
name="line.677"></a>
+<span class="sourceLineNo">678</span> }<a name="line.678"></a>
+<span class="sourceLineNo">679</span> return null;<a name="line.679"></a>
+<span class="sourceLineNo">680</span> }<a name="line.680"></a>
+<span class="sourceLineNo">681</span><a name="line.681"></a>
+<span class="sourceLineNo">682</span> private Entry getProcedure(final long
procId) {<a name="line.682"></a>
+<span class="sourceLineNo">683</span> return
getProcedure(getMapSlot(procId), procId);<a name="line.683"></a>
+<span class="sourceLineNo">684</span> }<a name="line.684"></a>
+<span class="sourceLineNo">685</span><a name="line.685"></a>
+<span class="sourceLineNo">686</span> private Entry getProcedure(final int
slotIndex, final long procId) {<a name="line.686"></a>
+<span class="sourceLineNo">687</span> Entry entry =
procedureMap[slotIndex];<a name="line.687"></a>
+<span class="sourceLineNo">688</span> while (entry != null) {<a
name="line.688"></a>
+<span class="sourceLineNo">689</span> if (procId == entry.getProcId())
{<a name="line.689"></a>
+<span class="sourceLineNo">690</span> return entry;<a
name="line.690"></a>
+<span class="sourceLineNo">691</span> }<a name="line.691"></a>
+<span class="sourceLineNo">692</span> entry = entry.hashNext;<a
name="line.692"></a>
+<span class="sourceLineNo">693</span> }<a name="line.693"></a>
+<span class="sourceLineNo">694</span> return null;<a name="line.694"></a>
+<span class="sourceLineNo">695</span> }<a name="line.695"></a>
+<span class="sourceLineNo">696</span><a name="line.696"></a>
+<span class="sourceLineNo">697</span> private int getMapSlot(final long
procId) {<a name="line.697"></a>
+<span class="sourceLineNo">698</span> return
(int)(Procedure.getProcIdHashCode(procId) % procedureMap.length);<a
name="line.698"></a>
+<span class="sourceLineNo">699</span> }<a name="line.699"></a>
+<span class="sourceLineNo">700</span> }<a name="line.700"></a>
+<span class="sourceLineNo">701</span>}<a name="line.701"></a>
