You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@hbase.apache.org by gi...@apache.org on 2017/04/06 20:01:07 UTC
[06/25] hbase-site git commit: Published site at
9109803891e256f8c047af72572f07695e604a3f.
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/ddcd3ebf/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 22e0fbd..c2b04b8 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
@@ -57,7 +57,7 @@
<span class="sourceLineNo">049</span> // - INIT: Procedure submitted by the user (also known as 'root procedure')<a name="line.49"></a>
<span class="sourceLineNo">050</span> // - INSERT: Children added to the procedure <parentId>:[<childId>, ...]<a name="line.50"></a>
<span class="sourceLineNo">051</span> // - UPDATE: The specified procedure was updated<a name="line.51"></a>
-<span class="sourceLineNo">052</span> // - DELETE: The procedure was removed (completed/rolledback and result TTL expired)<a name="line.52"></a>
+<span class="sourceLineNo">052</span> // - DELETE: The procedure was removed (finished/rolledback and result TTL expired)<a name="line.52"></a>
<span class="sourceLineNo">053</span> //<a name="line.53"></a>
<span class="sourceLineNo">054</span> // In the WAL we can find multiple times the same procedure as UPDATE or INSERT.<a name="line.54"></a>
<span class="sourceLineNo">055</span> // We read the WAL from top to bottom, so every time we find an entry of the<a name="line.55"></a>
@@ -334,505 +334,504 @@
<span class="sourceLineNo">326</span> public boolean hasParent() { return proto.hasParentId(); }<a name="line.326"></a>
<span class="sourceLineNo">327</span> public boolean isReady() { return ready; }<a name="line.327"></a>
<span class="sourceLineNo">328</span><a name="line.328"></a>
-<span class="sourceLineNo">329</span> public boolean isCompleted() {<a name="line.329"></a>
+<span class="sourceLineNo">329</span> public boolean isFinished() {<a name="line.329"></a>
<span class="sourceLineNo">330</span> if (!hasParent()) {<a name="line.330"></a>
-<span class="sourceLineNo">331</span> // we only consider 'root' procedures. because for the user 'completed'<a name="line.331"></a>
-<span class="sourceLineNo">332</span> // means when everything up to the 'root' is complete.<a name="line.332"></a>
+<span class="sourceLineNo">331</span> // we only consider 'root' procedures. because for the user 'finished'<a name="line.331"></a>
+<span class="sourceLineNo">332</span> // means when everything up to the 'root' is finished.<a name="line.332"></a>
<span class="sourceLineNo">333</span> switch (proto.getState()) {<a name="line.333"></a>
<span class="sourceLineNo">334</span> case ROLLEDBACK:<a name="line.334"></a>
-<span class="sourceLineNo">335</span> return true;<a name="line.335"></a>
-<span class="sourceLineNo">336</span> case FINISHED:<a name="line.336"></a>
-<span class="sourceLineNo">337</span> return !proto.hasException();<a name="line.337"></a>
-<span class="sourceLineNo">338</span> default:<a name="line.338"></a>
-<span class="sourceLineNo">339</span> break;<a name="line.339"></a>
-<span class="sourceLineNo">340</span> }<a name="line.340"></a>
-<span class="sourceLineNo">341</span> }<a name="line.341"></a>
-<span class="sourceLineNo">342</span> return false;<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> public Procedure convert() throws IOException {<a name="line.345"></a>
-<span class="sourceLineNo">346</span> if (procedure == null) {<a name="line.346"></a>
-<span class="sourceLineNo">347</span> procedure = ProcedureUtil.convertToProcedure(proto);<a name="line.347"></a>
-<span class="sourceLineNo">348</span> }<a name="line.348"></a>
-<span class="sourceLineNo">349</span> return procedure;<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 ProcedureInfo convertToInfo() {<a name="line.352"></a>
-<span class="sourceLineNo">353</span> return ProcedureUtil.convertToProcedureInfo(proto);<a name="line.353"></a>
-<span class="sourceLineNo">354</span> }<a name="line.354"></a>
-<span class="sourceLineNo">355</span><a name="line.355"></a>
-<span class="sourceLineNo">356</span> @Override<a name="line.356"></a>
-<span class="sourceLineNo">357</span> public String toString() {<a name="line.357"></a>
-<span class="sourceLineNo">358</span> final StringBuilder sb = new StringBuilder();<a name="line.358"></a>
-<span class="sourceLineNo">359</span> sb.append("Entry(");<a name="line.359"></a>
-<span class="sourceLineNo">360</span> sb.append(getProcId());<a name="line.360"></a>
-<span class="sourceLineNo">361</span> sb.append(", parentId=");<a name="line.361"></a>
-<span class="sourceLineNo">362</span> sb.append(getParentId());<a name="line.362"></a>
-<span class="sourceLineNo">363</span> sb.append(", class=");<a name="line.363"></a>
-<span class="sourceLineNo">364</span> sb.append(proto.getClassName());<a name="line.364"></a>
-<span class="sourceLineNo">365</span> sb.append(")");<a name="line.365"></a>
-<span class="sourceLineNo">366</span> return sb.toString();<a name="line.366"></a>
-<span class="sourceLineNo">367</span> }<a name="line.367"></a>
-<span class="sourceLineNo">368</span> }<a name="line.368"></a>
-<span class="sourceLineNo">369</span><a name="line.369"></a>
-<span class="sourceLineNo">370</span> private static class EntryIterator implements ProcedureIterator {<a name="line.370"></a>
-<span class="sourceLineNo">371</span> private final Entry replayHead;<a name="line.371"></a>
-<span class="sourceLineNo">372</span> private Entry current;<a name="line.372"></a>
-<span class="sourceLineNo">373</span><a name="line.373"></a>
-<span class="sourceLineNo">374</span> public EntryIterator(Entry replayHead) {<a name="line.374"></a>
-<span class="sourceLineNo">375</span> this.replayHead = replayHead;<a name="line.375"></a>
-<span class="sourceLineNo">376</span> this.current = replayHead;<a name="line.376"></a>
-<span class="sourceLineNo">377</span> }<a name="line.377"></a>
-<span class="sourceLineNo">378</span><a name="line.378"></a>
-<span class="sourceLineNo">379</span> @Override<a name="line.379"></a>
-<span class="sourceLineNo">380</span> public void reset() {<a name="line.380"></a>
-<span class="sourceLineNo">381</span> this.current = replayHead;<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> @Override<a name="line.384"></a>
-<span class="sourceLineNo">385</span> public boolean hasNext() {<a name="line.385"></a>
-<span class="sourceLineNo">386</span> return current != null;<a name="line.386"></a>
-<span class="sourceLineNo">387</span> }<a name="line.387"></a>
-<span class="sourceLineNo">388</span><a name="line.388"></a>
-<span class="sourceLineNo">389</span> @Override<a name="line.389"></a>
-<span class="sourceLineNo">390</span> public boolean isNextCompleted() {<a name="line.390"></a>
-<span class="sourceLineNo">391</span> return current != null && current.isCompleted();<a name="line.391"></a>
-<span class="sourceLineNo">392</span> }<a name="line.392"></a>
-<span class="sourceLineNo">393</span><a name="line.393"></a>
-<span class="sourceLineNo">394</span> @Override<a name="line.394"></a>
-<span class="sourceLineNo">395</span> public void skipNext() {<a name="line.395"></a>
-<span class="sourceLineNo">396</span> current = current.replayNext;<a name="line.396"></a>
-<span class="sourceLineNo">397</span> }<a name="line.397"></a>
-<span class="sourceLineNo">398</span><a name="line.398"></a>
-<span class="sourceLineNo">399</span> @Override<a name="line.399"></a>
-<span class="sourceLineNo">400</span> public Procedure nextAsProcedure() throws IOException {<a name="line.400"></a>
-<span class="sourceLineNo">401</span> try {<a name="line.401"></a>
-<span class="sourceLineNo">402</span> return current.convert();<a name="line.402"></a>
-<span class="sourceLineNo">403</span> } finally {<a name="line.403"></a>
-<span class="sourceLineNo">404</span> current = current.replayNext;<a name="line.404"></a>
-<span class="sourceLineNo">405</span> }<a name="line.405"></a>
-<span class="sourceLineNo">406</span> }<a name="line.406"></a>
-<span class="sourceLineNo">407</span><a name="line.407"></a>
-<span class="sourceLineNo">408</span> @Override<a name="line.408"></a>
-<span class="sourceLineNo">409</span> public ProcedureInfo nextAsProcedureInfo() {<a name="line.409"></a>
-<span class="sourceLineNo">410</span> try {<a name="line.410"></a>
-<span class="sourceLineNo">411</span> return current.convertToInfo();<a name="line.411"></a>
-<span class="sourceLineNo">412</span> } finally {<a name="line.412"></a>
-<span class="sourceLineNo">413</span> current = current.replayNext;<a name="line.413"></a>
-<span class="sourceLineNo">414</span> }<a name="line.414"></a>
-<span class="sourceLineNo">415</span> }<a name="line.415"></a>
-<span class="sourceLineNo">416</span> }<a name="line.416"></a>
-<span class="sourceLineNo">417</span><a name="line.417"></a>
-<span class="sourceLineNo">418</span> private static class WalProcedureMap {<a name="line.418"></a>
-<span class="sourceLineNo">419</span> // procedure hash table<a name="line.419"></a>
-<span class="sourceLineNo">420</span> private Entry[] procedureMap;<a name="line.420"></a>
-<span class="sourceLineNo">421</span><a name="line.421"></a>
-<span class="sourceLineNo">422</span> // replay-order double-linked-list<a name="line.422"></a>
-<span class="sourceLineNo">423</span> private Entry replayOrderHead;<a name="line.423"></a>
-<span class="sourceLineNo">424</span> private Entry replayOrderTail;<a name="line.424"></a>
-<span class="sourceLineNo">425</span><a name="line.425"></a>
-<span class="sourceLineNo">426</span> // root linked-list<a name="line.426"></a>
-<span class="sourceLineNo">427</span> private Entry rootHead;<a name="line.427"></a>
-<span class="sourceLineNo">428</span><a name="line.428"></a>
-<span class="sourceLineNo">429</span> // pending unlinked children (root not present yet)<a name="line.429"></a>
-<span class="sourceLineNo">430</span> private Entry childUnlinkedHead;<a name="line.430"></a>
-<span class="sourceLineNo">431</span><a name="line.431"></a>
-<span class="sourceLineNo">432</span> // Track ProcId range<a name="line.432"></a>
-<span class="sourceLineNo">433</span> private long minProcId = Long.MAX_VALUE;<a name="line.433"></a>
-<span class="sourceLineNo">434</span> private long maxProcId = Long.MIN_VALUE;<a name="line.434"></a>
-<span class="sourceLineNo">435</span><a name="line.435"></a>
-<span class="sourceLineNo">436</span> public WalProcedureMap(int size) {<a name="line.436"></a>
-<span class="sourceLineNo">437</span> procedureMap = new Entry[size];<a name="line.437"></a>
-<span class="sourceLineNo">438</span> replayOrderHead = null;<a name="line.438"></a>
-<span class="sourceLineNo">439</span> replayOrderTail = null;<a name="line.439"></a>
-<span class="sourceLineNo">440</span> rootHead = null;<a name="line.440"></a>
-<span class="sourceLineNo">441</span> childUnlinkedHead = null;<a name="line.441"></a>
-<span class="sourceLineNo">442</span> }<a name="line.442"></a>
-<span class="sourceLineNo">443</span><a name="line.443"></a>
-<span class="sourceLineNo">444</span> public void add(ProcedureProtos.Procedure procProto) {<a name="line.444"></a>
-<span class="sourceLineNo">445</span> trackProcIds(procProto.getProcId());<a name="line.445"></a>
-<span class="sourceLineNo">446</span> Entry entry = addToMap(procProto.getProcId(), procProto.hasParentId());<a name="line.446"></a>
-<span class="sourceLineNo">447</span> boolean isNew = entry.proto == null;<a name="line.447"></a>
-<span class="sourceLineNo">448</span> entry.proto = procProto;<a name="line.448"></a>
-<span class="sourceLineNo">449</span> addToReplayList(entry);<a name="line.449"></a>
-<span class="sourceLineNo">450</span><a name="line.450"></a>
-<span class="sourceLineNo">451</span> if (isNew) {<a name="line.451"></a>
-<span class="sourceLineNo">452</span> if (procProto.hasParentId()) {<a name="line.452"></a>
-<span class="sourceLineNo">453</span> childUnlinkedHead = addToLinkList(entry, childUnlinkedHead);<a name="line.453"></a>
-<span class="sourceLineNo">454</span> } else {<a name="line.454"></a>
-<span class="sourceLineNo">455</span> rootHead = addToLinkList(entry, rootHead);<a name="line.455"></a>
-<span class="sourceLineNo">456</span> }<a name="line.456"></a>
-<span class="sourceLineNo">457</span> }<a name="line.457"></a>
-<span class="sourceLineNo">458</span> }<a name="line.458"></a>
-<span class="sourceLineNo">459</span><a name="line.459"></a>
-<span class="sourceLineNo">460</span> public boolean remove(long procId) {<a name="line.460"></a>
-<span class="sourceLineNo">461</span> trackProcIds(procId);<a name="line.461"></a>
-<span class="sourceLineNo">462</span> Entry entry = removeFromMap(procId);<a name="line.462"></a>
-<span class="sourceLineNo">463</span> if (entry != null) {<a name="line.463"></a>
-<span class="sourceLineNo">464</span> unlinkFromReplayList(entry);<a name="line.464"></a>
-<span class="sourceLineNo">465</span> unlinkFromLinkList(entry);<a name="line.465"></a>
-<span class="sourceLineNo">466</span> return true;<a name="line.466"></a>
-<span class="sourceLineNo">467</span> }<a name="line.467"></a>
-<span class="sourceLineNo">468</span> return false;<a name="line.468"></a>
-<span class="sourceLineNo">469</span> }<a name="line.469"></a>
-<span class="sourceLineNo">470</span><a name="line.470"></a>
-<span class="sourceLineNo">471</span> private void trackProcIds(long procId) {<a name="line.471"></a>
-<span class="sourceLineNo">472</span> minProcId = Math.min(minProcId, procId);<a name="line.472"></a>
-<span class="sourceLineNo">473</span> maxProcId = Math.max(maxProcId, procId);<a name="line.473"></a>
-<span class="sourceLineNo">474</span> }<a name="line.474"></a>
-<span class="sourceLineNo">475</span><a name="line.475"></a>
-<span class="sourceLineNo">476</span> public long getMinProcId() {<a name="line.476"></a>
-<span class="sourceLineNo">477</span> return minProcId;<a name="line.477"></a>
-<span class="sourceLineNo">478</span> }<a name="line.478"></a>
-<span class="sourceLineNo">479</span><a name="line.479"></a>
-<span class="sourceLineNo">480</span> public long getMaxProcId() {<a name="line.480"></a>
-<span class="sourceLineNo">481</span> return maxProcId;<a name="line.481"></a>
-<span class="sourceLineNo">482</span> }<a name="line.482"></a>
-<span class="sourceLineNo">483</span><a name="line.483"></a>
-<span class="sourceLineNo">484</span> public boolean contains(long procId) {<a name="line.484"></a>
-<span class="sourceLineNo">485</span> return getProcedure(procId) != null;<a name="line.485"></a>
-<span class="sourceLineNo">486</span> }<a name="line.486"></a>
-<span class="sourceLineNo">487</span><a name="line.487"></a>
-<span class="sourceLineNo">488</span> public boolean isEmpty() {<a name="line.488"></a>
-<span class="sourceLineNo">489</span> return replayOrderHead == null;<a name="line.489"></a>
-<span class="sourceLineNo">490</span> }<a name="line.490"></a>
-<span class="sourceLineNo">491</span><a name="line.491"></a>
-<span class="sourceLineNo">492</span> public void clear() {<a name="line.492"></a>
-<span class="sourceLineNo">493</span> for (int i = 0; i < procedureMap.length; ++i) {<a name="line.493"></a>
-<span class="sourceLineNo">494</span> procedureMap[i] = null;<a name="line.494"></a>
-<span class="sourceLineNo">495</span> }<a name="line.495"></a>
-<span class="sourceLineNo">496</span> replayOrderHead = null;<a name="line.496"></a>
-<span class="sourceLineNo">497</span> replayOrderTail = null;<a name="line.497"></a>
-<span class="sourceLineNo">498</span> rootHead = null;<a name="line.498"></a>
-<span class="sourceLineNo">499</span> childUnlinkedHead = null;<a name="line.499"></a>
-<span class="sourceLineNo">500</span> minProcId = Long.MAX_VALUE;<a name="line.500"></a>
-<span class="sourceLineNo">501</span> maxProcId = Long.MIN_VALUE;<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> /*<a name="line.504"></a>
-<span class="sourceLineNo">505</span> * Merges two WalProcedureMap,<a name="line.505"></a>
-<span class="sourceLineNo">506</span> * the target is the "global" map, the source is the "local" map.<a name="line.506"></a>
-<span class="sourceLineNo">507</span> * - The entries in the hashtables are guaranteed to be unique.<a name="line.507"></a>
-<span class="sourceLineNo">508</span> * On replay we don't load procedures that already exist in the "global"<a name="line.508"></a>
-<span class="sourceLineNo">509</span> * map (the one we are merging the "local" in to).<a name="line.509"></a>
-<span class="sourceLineNo">510</span> * - The replayOrderList of the "local" nao will be appended to the "global"<a name="line.510"></a>
-<span class="sourceLineNo">511</span> * map replay list.<a name="line.511"></a>
-<span class="sourceLineNo">512</span> * - The "local" map will be cleared at the end of the operation.<a name="line.512"></a>
-<span class="sourceLineNo">513</span> */<a name="line.513"></a>
-<span class="sourceLineNo">514</span> public void mergeTail(WalProcedureMap other) {<a name="line.514"></a>
-<span class="sourceLineNo">515</span> for (Entry p = other.replayOrderHead; p != null; p = p.replayNext) {<a name="line.515"></a>
-<span class="sourceLineNo">516</span> int slotIndex = getMapSlot(p.getProcId());<a name="line.516"></a>
-<span class="sourceLineNo">517</span> p.hashNext = procedureMap[slotIndex];<a name="line.517"></a>
-<span class="sourceLineNo">518</span> procedureMap[slotIndex] = p;<a name="line.518"></a>
-<span class="sourceLineNo">519</span> }<a name="line.519"></a>
-<span class="sourceLineNo">520</span><a name="line.520"></a>
-<span class="sourceLineNo">521</span> if (replayOrderHead == null) {<a name="line.521"></a>
-<span class="sourceLineNo">522</span> replayOrderHead = other.replayOrderHead;<a name="line.522"></a>
-<span class="sourceLineNo">523</span> replayOrderTail = other.replayOrderTail;<a name="line.523"></a>
-<span class="sourceLineNo">524</span> rootHead = other.rootHead;<a name="line.524"></a>
-<span class="sourceLineNo">525</span> childUnlinkedHead = other.childUnlinkedHead;<a name="line.525"></a>
-<span class="sourceLineNo">526</span> } else {<a name="line.526"></a>
-<span class="sourceLineNo">527</span> // append replay list<a name="line.527"></a>
-<span class="sourceLineNo">528</span> assert replayOrderTail.replayNext == null;<a name="line.528"></a>
-<span class="sourceLineNo">529</span> assert other.replayOrderHead.replayPrev == null;<a name="line.529"></a>
-<span class="sourceLineNo">530</span> replayOrderTail.replayNext = other.replayOrderHead;<a name="line.530"></a>
-<span class="sourceLineNo">531</span> other.replayOrderHead.replayPrev = replayOrderTail;<a name="line.531"></a>
-<span class="sourceLineNo">532</span> replayOrderTail = other.replayOrderTail;<a name="line.532"></a>
-<span class="sourceLineNo">533</span><a name="line.533"></a>
-<span class="sourceLineNo">534</span> // merge rootHead<a name="line.534"></a>
-<span class="sourceLineNo">535</span> if (rootHead == null) {<a name="line.535"></a>
-<span class="sourceLineNo">536</span> rootHead = other.rootHead;<a name="line.536"></a>
-<span class="sourceLineNo">537</span> } else if (other.rootHead != null) {<a name="line.537"></a>
-<span class="sourceLineNo">538</span> Entry otherTail = findLinkListTail(other.rootHead);<a name="line.538"></a>
-<span class="sourceLineNo">539</span> otherTail.linkNext = rootHead;<a name="line.539"></a>
-<span class="sourceLineNo">540</span> rootHead.linkPrev = otherTail;<a name="line.540"></a>
-<span class="sourceLineNo">541</span> rootHead = other.rootHead;<a name="line.541"></a>
-<span class="sourceLineNo">542</span> }<a name="line.542"></a>
-<span class="sourceLineNo">543</span><a name="line.543"></a>
-<span class="sourceLineNo">544</span> // merge childUnlinkedHead<a name="line.544"></a>
-<span class="sourceLineNo">545</span> if (childUnlinkedHead == null) {<a name="line.545"></a>
-<span class="sourceLineNo">546</span> childUnlinkedHead = other.childUnlinkedHead;<a name="line.546"></a>
-<span class="sourceLineNo">547</span> } else if (other.childUnlinkedHead != null) {<a name="line.547"></a>
-<span class="sourceLineNo">548</span> Entry otherTail = findLinkListTail(other.childUnlinkedHead);<a name="line.548"></a>
-<span class="sourceLineNo">549</span> otherTail.linkNext = childUnlinkedHead;<a name="line.549"></a>
-<span class="sourceLineNo">550</span> childUnlinkedHead.linkPrev = otherTail;<a name="line.550"></a>
-<span class="sourceLineNo">551</span> childUnlinkedHead = other.childUnlinkedHead;<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> maxProcId = Math.max(maxProcId, other.maxProcId);<a name="line.554"></a>
-<span class="sourceLineNo">555</span> minProcId = Math.max(minProcId, other.minProcId);<a name="line.555"></a>
-<span class="sourceLineNo">556</span><a name="line.556"></a>
-<span class="sourceLineNo">557</span> other.clear();<a name="line.557"></a>
-<span class="sourceLineNo">558</span> }<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> * Returns an EntryIterator with the list of procedures ready<a name="line.561"></a>
-<span class="sourceLineNo">562</span> * to be added to the executor.<a name="line.562"></a>
-<span class="sourceLineNo">563</span> * A Procedure is ready if its children and parent are ready.<a name="line.563"></a>
-<span class="sourceLineNo">564</span> */<a name="line.564"></a>
-<span class="sourceLineNo">565</span> public EntryIterator fetchReady() {<a name="line.565"></a>
-<span class="sourceLineNo">566</span> buildGraph();<a name="line.566"></a>
-<span class="sourceLineNo">567</span><a name="line.567"></a>
-<span class="sourceLineNo">568</span> Entry readyHead = null;<a name="line.568"></a>
-<span class="sourceLineNo">569</span> Entry readyTail = null;<a name="line.569"></a>
-<span class="sourceLineNo">570</span> Entry p = replayOrderHead;<a name="line.570"></a>
-<span class="sourceLineNo">571</span> while (p != null) {<a name="line.571"></a>
-<span class="sourceLineNo">572</span> Entry next = p.replayNext;<a name="line.572"></a>
-<span class="sourceLineNo">573</span> if (p.isReady()) {<a name="line.573"></a>
-<span class="sourceLineNo">574</span> unlinkFromReplayList(p);<a name="line.574"></a>
-<span class="sourceLineNo">575</span> if (readyTail != null) {<a name="line.575"></a>
-<span class="sourceLineNo">576</span> readyTail.replayNext = p;<a name="line.576"></a>
-<span class="sourceLineNo">577</span> p.replayPrev = readyTail;<a name="line.577"></a>
-<span class="sourceLineNo">578</span> } else {<a name="line.578"></a>
-<span class="sourceLineNo">579</span> p.replayPrev = null;<a name="line.579"></a>
-<span class="sourceLineNo">580</span> readyHead = p;<a name="line.580"></a>
-<span class="sourceLineNo">581</span> }<a name="line.581"></a>
-<span class="sourceLineNo">582</span> readyTail = p;<a name="line.582"></a>
-<span class="sourceLineNo">583</span> p.replayNext = null;<a name="line.583"></a>
-<span class="sourceLineNo">584</span> }<a name="line.584"></a>
-<span class="sourceLineNo">585</span> p = next;<a name="line.585"></a>
-<span class="sourceLineNo">586</span> }<a name="line.586"></a>
-<span class="sourceLineNo">587</span> // we need the hash-table lookups for parents, so this must be done<a name="line.587"></a>
-<span class="sourceLineNo">588</span> // out of the loop where we check isReadyToRun()<a name="line.588"></a>
-<span class="sourceLineNo">589</span> for (p = readyHead; p != null; p = p.replayNext) {<a name="line.589"></a>
-<span class="sourceLineNo">590</span> removeFromMap(p.getProcId());<a name="line.590"></a>
-<span class="sourceLineNo">591</span> unlinkFromLinkList(p);<a name="line.591"></a>
-<span class="sourceLineNo">592</span> }<a name="line.592"></a>
-<span class="sourceLineNo">593</span> return readyHead != null ? new EntryIterator(readyHead) : null;<a name="line.593"></a>
-<span class="sourceLineNo">594</span> }<a name="line.594"></a>
-<span class="sourceLineNo">595</span><a name="line.595"></a>
-<span class="sourceLineNo">596</span> /*<a name="line.596"></a>
-<span class="sourceLineNo">597</span> * Drain this map and return all procedures in it.<a name="line.597"></a>
-<span class="sourceLineNo">598</span> */<a name="line.598"></a>
-<span class="sourceLineNo">599</span> public EntryIterator fetchAll() {<a name="line.599"></a>
-<span class="sourceLineNo">600</span> Entry head = replayOrderHead;<a name="line.600"></a>
-<span class="sourceLineNo">601</span> for (Entry p = head; p != null; p = p.replayNext) {<a name="line.601"></a>
-<span class="sourceLineNo">602</span> removeFromMap(p.getProcId());<a name="line.602"></a>
-<span class="sourceLineNo">603</span> }<a name="line.603"></a>
-<span class="sourceLineNo">604</span> for (int i = 0; i < procedureMap.length; ++i) {<a name="line.604"></a>
-<span class="sourceLineNo">605</span> assert procedureMap[i] == null : "map not empty i=" + i;<a name="line.605"></a>
-<span class="sourceLineNo">606</span> }<a name="line.606"></a>
-<span class="sourceLineNo">607</span> replayOrderHead = null;<a name="line.607"></a>
-<span class="sourceLineNo">608</span> replayOrderTail = null;<a name="line.608"></a>
-<span class="sourceLineNo">609</span> childUnlinkedHead = null;<a name="line.609"></a>
-<span class="sourceLineNo">610</span> rootHead = null;<a name="line.610"></a>
-<span class="sourceLineNo">611</span> return head != null ? new EntryIterator(head) : null;<a name="line.611"></a>
-<span class="sourceLineNo">612</span> }<a name="line.612"></a>
-<span class="sourceLineNo">613</span><a name="line.613"></a>
-<span class="sourceLineNo">614</span> private void buildGraph() {<a name="line.614"></a>
-<span class="sourceLineNo">615</span> Entry p = childUnlinkedHead;<a name="line.615"></a>
-<span class="sourceLineNo">616</span> while (p != null) {<a name="line.616"></a>
-<span class="sourceLineNo">617</span> Entry next = p.linkNext;<a name="line.617"></a>
-<span class="sourceLineNo">618</span> Entry rootProc = getRootProcedure(p);<a name="line.618"></a>
-<span class="sourceLineNo">619</span> if (rootProc != null) {<a name="line.619"></a>
-<span class="sourceLineNo">620</span> rootProc.childHead = addToLinkList(p, rootProc.childHead);<a name="line.620"></a>
-<span class="sourceLineNo">621</span> }<a name="line.621"></a>
-<span class="sourceLineNo">622</span> p = next;<a name="line.622"></a>
-<span class="sourceLineNo">623</span> }<a name="line.623"></a>
-<span class="sourceLineNo">624</span><a name="line.624"></a>
-<span class="sourceLineNo">625</span> for (p = rootHead; p != null; p = p.linkNext) {<a name="line.625"></a>
-<span class="sourceLineNo">626</span> checkReadyToRun(p);<a name="line.626"></a>
-<span class="sourceLineNo">627</span> }<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> private Entry getRootProcedure(Entry entry) {<a name="line.630"></a>
-<span class="sourceLineNo">631</span> while (entry != null && entry.hasParent()) {<a name="line.631"></a>
-<span class="sourceLineNo">632</span> entry = getProcedure(entry.getParentId());<a name="line.632"></a>
-<span class="sourceLineNo">633</span> }<a name="line.633"></a>
-<span class="sourceLineNo">634</span> return entry;<a name="line.634"></a>
-<span class="sourceLineNo">635</span> }<a name="line.635"></a>
-<span class="sourceLineNo">636</span><a name="line.636"></a>
-<span class="sourceLineNo">637</span> /*<a name="line.637"></a>
-<span class="sourceLineNo">638</span> * (see the comprehensive explaination in the beginning of the file)<a name="line.638"></a>
-<span class="sourceLineNo">639</span> * A Procedure is ready when parent and children are ready.<a name="line.639"></a>
-<span class="sourceLineNo">640</span> * "ready" means that we all the information that we need in-memory.<a name="line.640"></a>
-<span class="sourceLineNo">641</span> *<a name="line.641"></a>
-<span class="sourceLineNo">642</span> * Example-1:<a name="line.642"></a>
-<span class="sourceLineNo">643</span> * We have two WALs, we start reading fronm the newest (wal-2)<a name="line.643"></a>
-<span class="sourceLineNo">644</span> * wal-2 | C B |<a name="line.644"></a>
-<span class="sourceLineNo">645</span> * wal-1 | A B C |<a name="line.645"></a>
-<span class="sourceLineNo">646</span> *<a name="line.646"></a>
-<span class="sourceLineNo">647</span> * If C and B don't depend on A (A is not the parent), we can start them<a name="line.647"></a>
-<span class="sourceLineNo">648</span> * before reading wal-1. If B is the only one with parent A we can start C<a name="line.648"></a>
-<span class="sourceLineNo">649</span> * and read one more WAL before being able to start B.<a name="line.649"></a>
-<span class="sourceLineNo">650</span> *<a name="line.650"></a>
-<span class="sourceLineNo">651</span> * How do we know with the only information in B that we are not ready.<a name="line.651"></a>
-<span class="sourceLineNo">652</span> * - easy case, the parent is missing from the global map<a name="line.652"></a>
-<span class="sourceLineNo">653</span> * - more complex case we look at the Stack IDs<a name="line.653"></a>
-<span class="sourceLineNo">654</span> *<a name="line.654"></a>
-<span class="sourceLineNo">655</span> * The Stack-IDs are added to the procedure order as incremental index<a name="line.655"></a>
-<span class="sourceLineNo">656</span> * tracking how many times that procedure was executed, which is equivalent<a name="line.656"></a>
-<span class="sourceLineNo">657</span> * at the number of times we wrote the procedure to the WAL.<a name="line.657"></a>
-<span class="sourceLineNo">658</span> * In the example above:<a name="line.658"></a>
-<span class="sourceLineNo">659</span> * wal-2: B has stackId = [1, 2]<a name="line.659"></a>
-<span class="sourceLineNo">660</span> * wal-1: B has stackId = [1]<a name="line.660"></a>
-<span class="sourceLineNo">661</span> * wal-1: A has stackId = [0]<a name="line.661"></a>
-<span class="sourceLineNo">662</span> *<a name="line.662"></a>
-<span class="sourceLineNo">663</span> * Since we know that the Stack-IDs are incremental for a Procedure,<a name="line.663"></a>
-<span class="sourceLineNo">664</span> * we notice that there is a gap in the stackIds of B, so something was<a name="line.664"></a>
-<span class="sourceLineNo">665</span> * executed before.<a name="line.665"></a>
-<span class="sourceLineNo">666</span> * To identify when a Procedure is ready we do the sum of the stackIds of<a name="line.666"></a>
-<span class="sourceLineNo">667</span> * the procedure and the parent. if the stackIdSum is equals to the<a name="line.667"></a>
-<span class="sourceLineNo">668</span> * sum of {1..maxStackId} then everything we need is avaiable.<a name="line.668"></a>
-<span class="sourceLineNo">669</span> *<a name="line.669"></a>
-<span class="sourceLineNo">670</span> * Example-2<a name="line.670"></a>
-<span class="sourceLineNo">671</span> * wal-2 | A | A stackIds = [0, 2]<a name="line.671"></a>
-<span class="sourceLineNo">672</span> * wal-1 | A B | B stackIds = [1]<a name="line.672"></a>
-<span class="sourceLineNo">673</span> *<a name="line.673"></a>
-<span class="sourceLineNo">674</span> * There is a gap between A stackIds so something was executed in between.<a name="line.674"></a>
-<span class="sourceLineNo">675</span> */<a name="line.675"></a>
-<span class="sourceLineNo">676</span> private boolean checkReadyToRun(Entry rootEntry) {<a name="line.676"></a>
-<span class="sourceLineNo">677</span> assert !rootEntry.hasParent() : "expected root procedure, got " + rootEntry;<a name="line.677"></a>
-<span class="sourceLineNo">678</span><a name="line.678"></a>
-<span class="sourceLineNo">679</span> if (rootEntry.isCompleted()) {<a name="line.679"></a>
-<span class="sourceLineNo">680</span> // if the root procedure is completed, sub-procedures should be gone<a name="line.680"></a>
-<span class="sourceLineNo">681</span> if (rootEntry.childHead != null) {<a name="line.681"></a>
-<span class="sourceLineNo">682</span> LOG.error("unexpected active children for root-procedure: " + rootEntry);<a name="line.682"></a>
-<span class="sourceLineNo">683</span> for (Entry p = rootEntry.childHead; p != null; p = p.linkNext) {<a name="line.683"></a>
-<span class="sourceLineNo">684</span> LOG.error("unexpected active children: " + p);<a name="line.684"></a>
-<span class="sourceLineNo">685</span> }<a name="line.685"></a>
-<span class="sourceLineNo">686</span> }<a name="line.686"></a>
-<span class="sourceLineNo">687</span><a name="line.687"></a>
-<span class="sourceLineNo">688</span> assert rootEntry.childHead == null : "unexpected children on root completion. " + rootEntry;<a name="line.688"></a>
-<span class="sourceLineNo">689</span> rootEntry.ready = true;<a name="line.689"></a>
-<span class="sourceLineNo">690</span> return true;<a name="line.690"></a>
-<span class="sourceLineNo">691</span> }<a name="line.691"></a>
-<span class="sourceLineNo">692</span><a name="line.692"></a>
-<span class="sourceLineNo">693</span> int stackIdSum = 0;<a name="line.693"></a>
-<span class="sourceLineNo">694</span> int maxStackId = 0;<a name="line.694"></a>
-<span class="sourceLineNo">695</span> for (int i = 0; i < rootEntry.proto.getStackIdCount(); ++i) {<a name="line.695"></a>
-<span class="sourceLineNo">696</span> int stackId = 1 + rootEntry.proto.getStackId(i);<a name="line.696"></a>
-<span class="sourceLineNo">697</span> maxStackId = Math.max(maxStackId, stackId);<a name="line.697"></a>
-<span class="sourceLineNo">698</span> stackIdSum += stackId;<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> for (Entry p = rootEntry.childHead; p != null; p = p.linkNext) {<a name="line.701"></a>
-<span class="sourceLineNo">702</span> for (int i = 0; i < p.proto.getStackIdCount(); ++i) {<a name="line.702"></a>
-<span class="sourceLineNo">703</span> int stackId = 1 + p.proto.getStackId(i);<a name="line.703"></a>
-<span class="sourceLineNo">704</span> maxStackId = Math.max(maxStackId, stackId);<a name="line.704"></a>
-<span class="sourceLineNo">705</span> stackIdSum += stackId;<a name="line.705"></a>
-<span class="sourceLineNo">706</span> }<a name="line.706"></a>
-<span class="sourceLineNo">707</span> }<a name="line.707"></a>
-<span class="sourceLineNo">708</span> final int cmpStackIdSum = (maxStackId * (maxStackId + 1) / 2);<a name="line.708"></a>
-<span class="sourceLineNo">709</span> if (cmpStackIdSum == stackIdSum) {<a name="line.709"></a>
-<span class="sourceLineNo">710</span> rootEntry.ready = true;<a name="line.710"></a>
-<span class="sourceLineNo">711</span> for (Entry p = rootEntry.childHead; p != null; p = p.linkNext) {<a name="line.711"></a>
-<span class="sourceLineNo">712</span> p.ready = true;<a name="line.712"></a>
-<span class="sourceLineNo">713</span> }<a name="line.713"></a>
-<span class="sourceLineNo">714</span> return true;<a name="line.714"></a>
-<span class="sourceLineNo">715</span> }<a name="line.715"></a>
-<span class="sourceLineNo">716</span> return false;<a name="line.716"></a>
-<span class="sourceLineNo">717</span> }<a name="line.717"></a>
-<span class="sourceLineNo">718</span><a name="line.718"></a>
-<span class="sourceLineNo">719</span> private void unlinkFromReplayList(Entry entry) {<a name="line.719"></a>
-<span class="sourceLineNo">720</span> if (replayOrderHead == entry) {<a name="line.720"></a>
-<span class="sourceLineNo">721</span> replayOrderHead = entry.replayNext;<a name="line.721"></a>
-<span class="sourceLineNo">722</span> }<a name="line.722"></a>
-<span class="sourceLineNo">723</span> if (replayOrderTail == entry) {<a name="line.723"></a>
-<span class="sourceLineNo">724</span> replayOrderTail = entry.replayPrev;<a name="line.724"></a>
-<span class="sourceLineNo">725</span> }<a name="line.725"></a>
-<span class="sourceLineNo">726</span> if (entry.replayPrev != null) {<a name="line.726"></a>
-<span class="sourceLineNo">727</span> entry.replayPrev.replayNext = entry.replayNext;<a name="line.727"></a>
-<span class="sourceLineNo">728</span> }<a name="line.728"></a>
-<span class="sourceLineNo">729</span> if (entry.replayNext != null) {<a name="line.729"></a>
-<span class="sourceLineNo">730</span> entry.replayNext.replayPrev = entry.replayPrev;<a name="line.730"></a>
-<span class="sourceLineNo">731</span> }<a name="line.731"></a>
-<span class="sourceLineNo">732</span> }<a name="line.732"></a>
-<span class="sourceLineNo">733</span><a name="line.733"></a>
-<span class="sourceLineNo">734</span> private void addToReplayList(final Entry entry) {<a name="line.734"></a>
-<span class="sourceLineNo">735</span> unlinkFromReplayList(entry);<a name="line.735"></a>
-<span class="sourceLineNo">736</span> entry.replayNext = replayOrderHead;<a name="line.736"></a>
-<span class="sourceLineNo">737</span> entry.replayPrev = null;<a name="line.737"></a>
-<span class="sourceLineNo">738</span> if (replayOrderHead != null) {<a name="line.738"></a>
-<span class="sourceLineNo">739</span> replayOrderHead.replayPrev = entry;<a name="line.739"></a>
-<span class="sourceLineNo">740</span> } else {<a name="line.740"></a>
-<span class="sourceLineNo">741</span> replayOrderTail = entry;<a name="line.741"></a>
-<span class="sourceLineNo">742</span> }<a name="line.742"></a>
-<span class="sourceLineNo">743</span> replayOrderHead = entry;<a name="line.743"></a>
-<span class="sourceLineNo">744</span> }<a name="line.744"></a>
-<span class="sourceLineNo">745</span><a name="line.745"></a>
-<span class="sourceLineNo">746</span> private void unlinkFromLinkList(Entry entry) {<a name="line.746"></a>
-<span class="sourceLineNo">747</span> if (entry == rootHead) {<a name="line.747"></a>
-<span class="sourceLineNo">748</span> rootHead = entry.linkNext;<a name="line.748"></a>
-<span class="sourceLineNo">749</span> } else if (entry == childUnlinkedHead) {<a name="line.749"></a>
-<span class="sourceLineNo">750</span> childUnlinkedHead = entry.linkNext;<a name="line.750"></a>
-<span class="sourceLineNo">751</span> }<a name="line.751"></a>
-<span class="sourceLineNo">752</span> if (entry.linkPrev != null) {<a name="line.752"></a>
-<span class="sourceLineNo">753</span> entry.linkPrev.linkNext = entry.linkNext;<a name="line.753"></a>
-<span class="sourceLineNo">754</span> }<a name="line.754"></a>
-<span class="sourceLineNo">755</span> if (entry.linkNext != null) {<a name="line.755"></a>
-<span class="sourceLineNo">756</span> entry.linkNext.linkPrev = entry.linkPrev;<a name="line.756"></a>
-<span class="sourceLineNo">757</span> }<a name="line.757"></a>
-<span class="sourceLineNo">758</span> }<a name="line.758"></a>
-<span class="sourceLineNo">759</span><a name="line.759"></a>
-<span class="sourceLineNo">760</span> private Entry addToLinkList(Entry entry, Entry linkHead) {<a name="line.760"></a>
-<span class="sourceLineNo">761</span> unlinkFromLinkList(entry);<a name="line.761"></a>
-<span class="sourceLineNo">762</span> entry.linkNext = linkHead;<a name="line.762"></a>
-<span class="sourceLineNo">763</span> entry.linkPrev = null;<a name="line.763"></a>
-<span class="sourceLineNo">764</span> if (linkHead != null) {<a name="line.764"></a>
-<span class="sourceLineNo">765</span> linkHead.linkPrev = entry;<a name="line.765"></a>
-<span class="sourceLineNo">766</span> }<a name="line.766"></a>
-<span class="sourceLineNo">767</span> return entry;<a name="line.767"></a>
-<span class="sourceLineNo">768</span> }<a name="line.768"></a>
-<span class="sourceLineNo">769</span><a name="line.769"></a>
-<span class="sourceLineNo">770</span> private Entry findLinkListTail(Entry linkHead) {<a name="line.770"></a>
-<span class="sourceLineNo">771</span> Entry tail = linkHead;<a name="line.771"></a>
-<span class="sourceLineNo">772</span> while (tail.linkNext != null) {<a name="line.772"></a>
-<span class="sourceLineNo">773</span> tail = tail.linkNext;<a name="line.773"></a>
-<span class="sourceLineNo">774</span> }<a name="line.774"></a>
-<span class="sourceLineNo">775</span> return tail;<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 Entry addToMap(final long procId, final boolean hasParent) {<a name="line.778"></a>
-<span class="sourceLineNo">779</span> int slotIndex = getMapSlot(procId);<a name="line.779"></a>
-<span class="sourceLineNo">780</span> Entry entry = getProcedure(slotIndex, procId);<a name="line.780"></a>
-<span class="sourceLineNo">781</span> if (entry != null) return entry;<a name="line.781"></a>
-<span class="sourceLineNo">782</span><a name="line.782"></a>
-<span class="sourceLineNo">783</span> entry = new Entry(procedureMap[slotIndex]);<a name="line.783"></a>
-<span class="sourceLineNo">784</span> procedureMap[slotIndex] = entry;<a name="line.784"></a>
-<span class="sourceLineNo">785</span> return entry;<a name="line.785"></a>
-<span class="sourceLineNo">786</span> }<a name="line.786"></a>
-<span class="sourceLineNo">787</span><a name="line.787"></a>
-<span class="sourceLineNo">788</span> private Entry removeFromMap(final long procId) {<a name="line.788"></a>
-<span class="sourceLineNo">789</span> int slotIndex = getMapSlot(procId);<a name="line.789"></a>
-<span class="sourceLineNo">790</span> Entry prev = null;<a name="line.790"></a>
-<span class="sourceLineNo">791</span> Entry entry = procedureMap[slotIndex];<a name="line.791"></a>
-<span class="sourceLineNo">792</span> while (entry != null) {<a name="line.792"></a>
-<span class="sourceLineNo">793</span> if (procId == entry.getProcId()) {<a name="line.793"></a>
-<span class="sourceLineNo">794</span> if (prev != null) {<a name="line.794"></a>
-<span class="sourceLineNo">795</span> prev.hashNext = entry.hashNext;<a name="line.795"></a>
-<span class="sourceLineNo">796</span> } else {<a name="line.796"></a>
-<span class="sourceLineNo">797</span> procedureMap[slotIndex] = entry.hashNext;<a name="line.797"></a>
-<span class="sourceLineNo">798</span> }<a name="line.798"></a>
-<span class="sourceLineNo">799</span> entry.hashNext = null;<a name="line.799"></a>
-<span class="sourceLineNo">800</span> return entry;<a name="line.800"></a>
-<span class="sourceLineNo">801</span> }<a name="line.801"></a>
-<span class="sourceLineNo">802</span> prev = entry;<a name="line.802"></a>
-<span class="sourceLineNo">803</span> entry = entry.hashNext;<a name="line.803"></a>
-<span class="sourceLineNo">804</span> }<a name="line.804"></a>
-<span class="sourceLineNo">805</span> return null;<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 getProcedure(final long procId) {<a name="line.808"></a>
-<span class="sourceLineNo">809</span> return getProcedure(getMapSlot(procId), procId);<a name="line.809"></a>
-<span class="sourceLineNo">810</span> }<a name="line.810"></a>
-<span class="sourceLineNo">811</span><a name="line.811"></a>
-<span class="sourceLineNo">812</span> private Entry getProcedure(final int slotIndex, final long procId) {<a name="line.812"></a>
-<span class="sourceLineNo">813</span> Entry entry = procedureMap[slotIndex];<a name="line.813"></a>
-<span class="sourceLineNo">814</span> while (entry != null) {<a name="line.814"></a>
-<span class="sourceLineNo">815</span> if (procId == entry.getProcId()) {<a name="line.815"></a>
-<span class="sourceLineNo">816</span> return entry;<a name="line.816"></a>
-<span class="sourceLineNo">817</span> }<a name="line.817"></a>
-<span class="sourceLineNo">818</span> entry = entry.hashNext;<a name="line.818"></a>
-<span class="sourceLineNo">819</span> }<a name="line.819"></a>
-<span class="sourceLineNo">820</span> return null;<a name="line.820"></a>
-<span class="sourceLineNo">821</span> }<a name="line.821"></a>
-<span class="sourceLineNo">822</span><a name="line.822"></a>
-<span class="sourceLineNo">823</span> private int getMapSlot(final long procId) {<a name="line.823"></a>
-<span class="sourceLineNo">824</span> return (int)(Procedure.getProcIdHashCode(procId) % procedureMap.length);<a name="line.824"></a>
-<span class="sourceLineNo">825</span> }<a name="line.825"></a>
-<span class="sourceLineNo">826</span> }<a name="line.826"></a>
-<span class="sourceLineNo">827</span>}<a name="line.827"></a>
+<span class="sourceLineNo">335</span> case SUCCESS:<a name="line.335"></a>
+<span class="sourceLineNo">336</span> return true;<a name="line.336"></a>
+<span class="sourceLineNo">337</span> default:<a name="line.337"></a>
+<span class="sourceLineNo">338</span> break;<a name="line.338"></a>
+<span class="sourceLineNo">339</span> }<a name="line.339"></a>
+<span class="sourceLineNo">340</span> }<a name="line.340"></a>
+<span class="sourceLineNo">341</span> return false;<a name="line.341"></a>
+<span class="sourceLineNo">342</span> }<a name="line.342"></a>
+<span class="sourceLineNo">343</span><a name="line.343"></a>
+<span class="sourceLineNo">344</span> public Procedure convert() throws IOException {<a name="line.344"></a>
+<span class="sourceLineNo">345</span> if (procedure == null) {<a name="line.345"></a>
+<span class="sourceLineNo">346</span> procedure = ProcedureUtil.convertToProcedure(proto);<a name="line.346"></a>
+<span class="sourceLineNo">347</span> }<a name="line.347"></a>
+<span class="sourceLineNo">348</span> return procedure;<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> public ProcedureInfo convertToInfo() {<a name="line.351"></a>
+<span class="sourceLineNo">352</span> return ProcedureUtil.convertToProcedureInfo(proto);<a name="line.352"></a>
+<span class="sourceLineNo">353</span> }<a name="line.353"></a>
+<span class="sourceLineNo">354</span><a name="line.354"></a>
+<span class="sourceLineNo">355</span> @Override<a name="line.355"></a>
+<span class="sourceLineNo">356</span> public String toString() {<a name="line.356"></a>
+<span class="sourceLineNo">357</span> final StringBuilder sb = new StringBuilder();<a name="line.357"></a>
+<span class="sourceLineNo">358</span> sb.append("Entry(");<a name="line.358"></a>
+<span class="sourceLineNo">359</span> sb.append(getProcId());<a name="line.359"></a>
+<span class="sourceLineNo">360</span> sb.append(", parentId=");<a name="line.360"></a>
+<span class="sourceLineNo">361</span> sb.append(getParentId());<a name="line.361"></a>
+<span class="sourceLineNo">362</span> sb.append(", class=");<a name="line.362"></a>
+<span class="sourceLineNo">363</span> sb.append(proto.getClassName());<a name="line.363"></a>
+<span class="sourceLineNo">364</span> sb.append(")");<a name="line.364"></a>
+<span class="sourceLineNo">365</span> return sb.toString();<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><a name="line.368"></a>
+<span class="sourceLineNo">369</span> private static class EntryIterator implements ProcedureIterator {<a name="line.369"></a>
+<span class="sourceLineNo">370</span> private final Entry replayHead;<a name="line.370"></a>
+<span class="sourceLineNo">371</span> private Entry current;<a name="line.371"></a>
+<span class="sourceLineNo">372</span><a name="line.372"></a>
+<span class="sourceLineNo">373</span> public EntryIterator(Entry replayHead) {<a name="line.373"></a>
+<span class="sourceLineNo">374</span> this.replayHead = replayHead;<a name="line.374"></a>
+<span class="sourceLineNo">375</span> this.current = replayHead;<a name="line.375"></a>
+<span class="sourceLineNo">376</span> }<a name="line.376"></a>
+<span class="sourceLineNo">377</span><a name="line.377"></a>
+<span class="sourceLineNo">378</span> @Override<a name="line.378"></a>
+<span class="sourceLineNo">379</span> public void reset() {<a name="line.379"></a>
+<span class="sourceLineNo">380</span> this.current = replayHead;<a name="line.380"></a>
+<span class="sourceLineNo">381</span> }<a name="line.381"></a>
+<span class="sourceLineNo">382</span><a name="line.382"></a>
+<span class="sourceLineNo">383</span> @Override<a name="line.383"></a>
+<span class="sourceLineNo">384</span> public boolean hasNext() {<a name="line.384"></a>
+<span class="sourceLineNo">385</span> return current != null;<a name="line.385"></a>
+<span class="sourceLineNo">386</span> }<a name="line.386"></a>
+<span class="sourceLineNo">387</span><a name="line.387"></a>
+<span class="sourceLineNo">388</span> @Override<a name="line.388"></a>
+<span class="sourceLineNo">389</span> public boolean isNextFinished() {<a name="line.389"></a>
+<span class="sourceLineNo">390</span> return current != null && current.isFinished();<a name="line.390"></a>
+<span class="sourceLineNo">391</span> }<a name="line.391"></a>
+<span class="sourceLineNo">392</span><a name="line.392"></a>
+<span class="sourceLineNo">393</span> @Override<a name="line.393"></a>
+<span class="sourceLineNo">394</span> public void skipNext() {<a name="line.394"></a>
+<span class="sourceLineNo">395</span> current = current.replayNext;<a name="line.395"></a>
+<span class="sourceLineNo">396</span> }<a name="line.396"></a>
+<span class="sourceLineNo">397</span><a name="line.397"></a>
+<span class="sourceLineNo">398</span> @Override<a name="line.398"></a>
+<span class="sourceLineNo">399</span> public Procedure nextAsProcedure() throws IOException {<a name="line.399"></a>
+<span class="sourceLineNo">400</span> try {<a name="line.400"></a>
+<span class="sourceLineNo">401</span> return current.convert();<a name="line.401"></a>
+<span class="sourceLineNo">402</span> } finally {<a name="line.402"></a>
+<span class="sourceLineNo">403</span> current = current.replayNext;<a name="line.403"></a>
+<span class="sourceLineNo">404</span> }<a name="line.404"></a>
+<span class="sourceLineNo">405</span> }<a name="line.405"></a>
+<span class="sourceLineNo">406</span><a name="line.406"></a>
+<span class="sourceLineNo">407</span> @Override<a name="line.407"></a>
+<span class="sourceLineNo">408</span> public ProcedureInfo nextAsProcedureInfo() {<a name="line.408"></a>
+<span class="sourceLineNo">409</span> try {<a name="line.409"></a>
+<span class="sourceLineNo">410</span> return current.convertToInfo();<a name="line.410"></a>
+<span class="sourceLineNo">411</span> } finally {<a name="line.411"></a>
+<span class="sourceLineNo">412</span> current = current.replayNext;<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> }<a name="line.415"></a>
+<span class="sourceLineNo">416</span><a name="line.416"></a>
+<span class="sourceLineNo">417</span> private static class WalProcedureMap {<a name="line.417"></a>
+<span class="sourceLineNo">418</span> // procedure hash table<a name="line.418"></a>
+<span class="sourceLineNo">419</span> private Entry[] procedureMap;<a name="line.419"></a>
+<span class="sourceLineNo">420</span><a name="line.420"></a>
+<span class="sourceLineNo">421</span> // replay-order double-linked-list<a name="line.421"></a>
+<span class="sourceLineNo">422</span> private Entry replayOrderHead;<a name="line.422"></a>
+<span class="sourceLineNo">423</span> private Entry replayOrderTail;<a name="line.423"></a>
+<span class="sourceLineNo">424</span><a name="line.424"></a>
+<span class="sourceLineNo">425</span> // root linked-list<a name="line.425"></a>
+<span class="sourceLineNo">426</span> private Entry rootHead;<a name="line.426"></a>
+<span class="sourceLineNo">427</span><a name="line.427"></a>
+<span class="sourceLineNo">428</span> // pending unlinked children (root not present yet)<a name="line.428"></a>
+<span class="sourceLineNo">429</span> private Entry childUnlinkedHead;<a name="line.429"></a>
+<span class="sourceLineNo">430</span><a name="line.430"></a>
+<span class="sourceLineNo">431</span> // Track ProcId range<a name="line.431"></a>
+<span class="sourceLineNo">432</span> private long minProcId = Long.MAX_VALUE;<a name="line.432"></a>
+<span class="sourceLineNo">433</span> private long maxProcId = Long.MIN_VALUE;<a name="line.433"></a>
+<span class="sourceLineNo">434</span><a name="line.434"></a>
+<span class="sourceLineNo">435</span> public WalProcedureMap(int size) {<a name="line.435"></a>
+<span class="sourceLineNo">436</span> procedureMap = new Entry[size];<a name="line.436"></a>
+<span class="sourceLineNo">437</span> replayOrderHead = null;<a name="line.437"></a>
+<span class="sourceLineNo">438</span> replayOrderTail = null;<a name="line.438"></a>
+<span class="sourceLineNo">439</span> rootHead = null;<a name="line.439"></a>
+<span class="sourceLineNo">440</span> childUnlinkedHead = null;<a name="line.440"></a>
+<span class="sourceLineNo">441</span> }<a name="line.441"></a>
+<span class="sourceLineNo">442</span><a name="line.442"></a>
+<span class="sourceLineNo">443</span> public void add(ProcedureProtos.Procedure procProto) {<a name="line.443"></a>
+<span class="sourceLineNo">444</span> trackProcIds(procProto.getProcId());<a name="line.444"></a>
+<span class="sourceLineNo">445</span> Entry entry = addToMap(procProto.getProcId(), procProto.hasParentId());<a name="line.445"></a>
+<span class="sourceLineNo">446</span> boolean isNew = entry.proto == null;<a name="line.446"></a>
+<span class="sourceLineNo">447</span> entry.proto = procProto;<a name="line.447"></a>
+<span class="sourceLineNo">448</span> addToReplayList(entry);<a name="line.448"></a>
+<span class="sourceLineNo">449</span><a name="line.449"></a>
+<span class="sourceLineNo">450</span> if (isNew) {<a name="line.450"></a>
+<span class="sourceLineNo">451</span> if (procProto.hasParentId()) {<a name="line.451"></a>
+<span class="sourceLineNo">452</span> childUnlinkedHead = addToLinkList(entry, childUnlinkedHead);<a name="line.452"></a>
+<span class="sourceLineNo">453</span> } else {<a name="line.453"></a>
+<span class="sourceLineNo">454</span> rootHead = addToLinkList(entry, rootHead);<a name="line.454"></a>
+<span class="sourceLineNo">455</span> }<a name="line.455"></a>
+<span class="sourceLineNo">456</span> }<a name="line.456"></a>
+<span class="sourceLineNo">457</span> }<a name="line.457"></a>
+<span class="sourceLineNo">458</span><a name="line.458"></a>
+<span class="sourceLineNo">459</span> public boolean remove(long procId) {<a name="line.459"></a>
+<span class="sourceLineNo">460</span> trackProcIds(procId);<a name="line.460"></a>
+<span class="sourceLineNo">461</span> Entry entry = removeFromMap(procId);<a name="line.461"></a>
+<span class="sourceLineNo">462</span> if (entry != null) {<a name="line.462"></a>
+<span class="sourceLineNo">463</span> unlinkFromReplayList(entry);<a name="line.463"></a>
+<span class="sourceLineNo">464</span> unlinkFromLinkList(entry);<a name="line.464"></a>
+<span class="sourceLineNo">465</span> return true;<a name="line.465"></a>
+<span class="sourceLineNo">466</span> }<a name="line.466"></a>
+<span class="sourceLineNo">467</span> return false;<a name="line.467"></a>
+<span class="sourceLineNo">468</span> }<a name="line.468"></a>
+<span class="sourceLineNo">469</span><a name="line.469"></a>
+<span class="sourceLineNo">470</span> private void trackProcIds(long procId) {<a name="line.470"></a>
+<span class="sourceLineNo">471</span> minProcId = Math.min(minProcId, procId);<a name="line.471"></a>
+<span class="sourceLineNo">472</span> maxProcId = Math.max(maxProcId, procId);<a name="line.472"></a>
+<span class="sourceLineNo">473</span> }<a name="line.473"></a>
+<span class="sourceLineNo">474</span><a name="line.474"></a>
+<span class="sourceLineNo">475</span> public long getMinProcId() {<a name="line.475"></a>
+<span class="sourceLineNo">476</span> return minProcId;<a name="line.476"></a>
+<span class="sourceLineNo">477</span> }<a name="line.477"></a>
+<span class="sourceLineNo">478</span><a name="line.478"></a>
+<span class="sourceLineNo">479</span> public long getMaxProcId() {<a name="line.479"></a>
+<span class="sourceLineNo">480</span> return maxProcId;<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> public boolean contains(long procId) {<a name="line.483"></a>
+<span class="sourceLineNo">484</span> return getProcedure(procId) != null;<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> public boolean isEmpty() {<a name="line.487"></a>
+<span class="sourceLineNo">488</span> return replayOrderHead == null;<a name="line.488"></a>
+<span class="sourceLineNo">489</span> }<a name="line.489"></a>
+<span class="sourceLineNo">490</span><a name="line.490"></a>
+<span class="sourceLineNo">491</span> public void clear() {<a name="line.491"></a>
+<span class="sourceLineNo">492</span> for (int i = 0; i < procedureMap.length; ++i) {<a name="line.492"></a>
+<span class="sourceLineNo">493</span> procedureMap[i] = null;<a name="line.493"></a>
+<span class="sourceLineNo">494</span> }<a name="line.494"></a>
+<span class="sourceLineNo">495</span> replayOrderHead = null;<a name="line.495"></a>
+<span class="sourceLineNo">496</span> replayOrderTail = null;<a name="line.496"></a>
+<span class="sourceLineNo">497</span> rootHead = null;<a name="line.497"></a>
+<span class="sourceLineNo">498</span> childUnlinkedHead = null;<a name="line.498"></a>
+<span class="sourceLineNo">499</span> minProcId = Long.MAX_VALUE;<a name="line.499"></a>
+<span class="sourceLineNo">500</span> maxProcId = Long.MIN_VALUE;<a name="line.500"></a>
+<span class="sourceLineNo">501</span> }<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> * Merges two WalProcedureMap,<a name="line.504"></a>
+<span class="sourceLineNo">505</span> * the target is the "global" map, the source is the "local" map.<a name="line.505"></a>
+<span class="sourceLineNo">506</span> * - The entries in the hashtables are guaranteed to be unique.<a name="line.506"></a>
+<span class="sourceLineNo">507</span> * On replay we don't load procedures that already exist in the "global"<a name="line.507"></a>
+<span class="sourceLineNo">508</span> * map (the one we are merging the "local" in to).<a name="line.508"></a>
+<span class="sourceLineNo">509</span> * - The replayOrderList of the "local" nao will be appended to the "global"<a name="line.509"></a>
+<span class="sourceLineNo">510</span> * map replay list.<a name="line.510"></a>
+<span class="sourceLineNo">511</span> * - The "local" map will be cleared at the end of the operation.<a name="line.511"></a>
+<span class="sourceLineNo">512</span> */<a name="line.512"></a>
+<span class="sourceLineNo">513</span> public void mergeTail(WalProcedureMap other) {<a name="line.513"></a>
+<span class="sourceLineNo">514</span> for (Entry p = other.replayOrderHead; p != null; p = p.replayNext) {<a name="line.514"></a>
+<span class="sourceLineNo">515</span> int slotIndex = getMapSlot(p.getProcId());<a name="line.515"></a>
+<span class="sourceLineNo">516</span> p.hashNext = procedureMap[slotIndex];<a name="line.516"></a>
+<span class="sourceLineNo">517</span> procedureMap[slotIndex] = p;<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> if (replayOrderHead == null) {<a name="line.520"></a>
+<span class="sourceLineNo">521</span> replayOrderHead = other.replayOrderHead;<a name="line.521"></a>
+<span class="sourceLineNo">522</span> replayOrderTail = other.replayOrderTail;<a name="line.522"></a>
+<span class="sourceLineNo">523</span> rootHead = other.rootHead;<a name="line.523"></a>
+<span class="sourceLineNo">524</span> childUnlinkedHead = other.childUnlinkedHead;<a name="line.524"></a>
+<span class="sourceLineNo">525</span> } else {<a name="line.525"></a>
+<span class="sourceLineNo">526</span> // append replay list<a name="line.526"></a>
+<span class="sourceLineNo">527</span> assert replayOrderTail.replayNext == null;<a name="line.527"></a>
+<span class="sourceLineNo">528</span> assert other.replayOrderHead.replayPrev == null;<a name="line.528"></a>
+<span class="sourceLineNo">529</span> replayOrderTail.replayNext = other.replayOrderHead;<a name="line.529"></a>
+<span class="sourceLineNo">530</span> other.replayOrderHead.replayPrev = replayOrderTail;<a name="line.530"></a>
+<span class="sourceLineNo">531</span> replayOrderTail = other.replayOrderTail;<a name="line.531"></a>
+<span class="sourceLineNo">532</span><a name="line.532"></a>
+<span class="sourceLineNo">533</span> // merge rootHead<a name="line.533"></a>
+<span class="sourceLineNo">534</span> if (rootHead == null) {<a name="line.534"></a>
+<span class="sourceLineNo">535</span> rootHead = other.rootHead;<a name="line.535"></a>
+<span class="sourceLineNo">536</span> } else if (other.rootHead != null) {<a name="line.536"></a>
+<span class="sourceLineNo">537</span> Entry otherTail = findLinkListTail(other.rootHead);<a name="line.537"></a>
+<span class="sourceLineNo">538</span> otherTail.linkNext = rootHead;<a name="line.538"></a>
+<span class="sourceLineNo">539</span> rootHead.linkPrev = otherTail;<a name="line.539"></a>
+<span class="sourceLineNo">540</span> rootHead = other.rootHead;<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> // merge childUnlinkedHead<a name="line.543"></a>
+<span class="sourceLineNo">544</span> if (childUnlinkedHead == null) {<a name="line.544"></a>
+<span class="sourceLineNo">545</span> childUnlinkedHead = other.childUnlinkedHead;<a name="line.545"></a>
+<span class="sourceLineNo">546</span> } else if (other.childUnlinkedHead != null) {<a name="line.546"></a>
+<span class="sourceLineNo">547</span> Entry otherTail = findLinkListTail(other.childUnlinkedHead);<a name="line.547"></a>
+<span class="sourceLineNo">548</span> otherTail.linkNext = childUnlinkedHead;<a name="line.548"></a>
+<span class="sourceLineNo">549</span> childUnlinkedHead.linkPrev = otherTail;<a name="line.549"></a>
+<span class="sourceLineNo">550</span> childUnlinkedHead = other.childUnlinkedHead;<a name="line.550"></a>
+<span class="sourceLineNo">551</span> }<a name="line.551"></a>
+<span class="sourceLineNo">552</span> }<a name="line.552"></a>
+<span class="sourceLineNo">553</span> maxProcId = Math.max(maxProcId, other.maxProcId);<a name="line.553"></a>
+<span class="sourceLineNo">554</span> minProcId = Math.max(minProcId, other.minProcId);<a name="line.554"></a>
+<span class="sourceLineNo">555</span><a name="line.555"></a>
+<span class="sourceLineNo">556</span> other.clear();<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> /*<a name="line.559"></a>
+<span class="sourceLineNo">560</span> * Returns an EntryIterator with the list of procedures ready<a name="line.560"></a>
+<span class="sourceLineNo">561</span> * to be added to the executor.<a name="line.561"></a>
+<span class="sourceLineNo">562</span> * A Procedure is ready if its children and parent are ready.<a name="line.562"></a>
+<span class="sourceLineNo">563</span> */<a name="line.563"></a>
+<span class="sourceLineNo">564</span> public EntryIterator fetchReady() {<a name="line.564"></a>
+<span class="sourceLineNo">565</span> buildGraph();<a name="line.565"></a>
+<span class="sourceLineNo">566</span><a name="line.566"></a>
+<span class="sourceLineNo">567</span> Entry readyHead = null;<a name="line.567"></a>
+<span class="sourceLineNo">568</span> Entry readyTail = null;<a name="line.568"></a>
+<span class="sourceLineNo">569</span> Entry p = replayOrderHead;<a name="line.569"></a>
+<span class="sourceLineNo">570</span> while (p != null) {<a name="line.570"></a>
+<span class="sourceLineNo">571</span> Entry next = p.replayNext;<a name="line.571"></a>
+<span class="sourceLineNo">572</span> if (p.isReady()) {<a name="line.572"></a>
+<span class="sourceLineNo">573</span> unlinkFromReplayList(p);<a name="line.573"></a>
+<span class="sourceLineNo">574</span> if (readyTail != null) {<a name="line.574"></a>
+<span class="sourceLineNo">575</span> readyTail.replayNext = p;<a name="line.575"></a>
+<span class="sourceLineNo">576</span> p.replayPrev = readyTail;<a name="line.576"></a>
+<span class="sourceLineNo">577</span> } else {<a name="line.577"></a>
+<span class="sourceLineNo">578</span> p.replayPrev = null;<a name="line.578"></a>
+<span class="sourceLineNo">579</span> readyHead = p;<a name="line.579"></a>
+<span class="sourceLineNo">580</span> }<a name="line.580"></a>
+<span class="sourceLineNo">581</span> readyTail = p;<a name="line.581"></a>
+<span class="sourceLineNo">582</span> p.replayNext = null;<a name="line.582"></a>
+<span class="sourceLineNo">583</span> }<a name="line.583"></a>
+<span class="sourceLineNo">584</span> p = next;<a name="line.584"></a>
+<span class="sourceLineNo">585</span> }<a name="line.585"></a>
+<span class="sourceLineNo">586</span> // we need the hash-table lookups for parents, so this must be done<a name="line.586"></a>
+<span class="sourceLineNo">587</span> // out of the loop where we check isReadyToRun()<a name="line.587"></a>
+<span class="sourceLineNo">588</span> for (p = readyHead; p != null; p = p.replayNext) {<a name="line.588"></a>
+<span class="sourceLineNo">589</span> removeFromMap(p.getProcId());<a name="line.589"></a>
+<span class="sourceLineNo">590</span> unlinkFromLinkList(p);<a name="line.590"></a>
+<span class="sourceLineNo">591</span> }<a name="line.591"></a>
+<span class="sourceLineNo">592</span> return readyHead != null ? new EntryIterator(readyHead) : null;<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> /*<a name="line.595"></a>
+<span class="sourceLineNo">596</span> * Drain this map and return all procedures in it.<a name="line.596"></a>
+<span class="sourceLineNo">597</span> */<a name="line.597"></a>
+<span class="sourceLineNo">598</span> public EntryIterator fetchAll() {<a name="line.598"></a>
+<span class="sourceLineNo">599</span> Entry head = replayOrderHead;<a name="line.599"></a>
+<span class="sourceLineNo">600</span> for (Entry p = head; p != null; p = p.replayNext) {<a name="line.600"></a>
+<span class="sourceLineNo">601</span> removeFromMap(p.getProcId());<a name="line.601"></a>
+<span class="sourceLineNo">602</span> }<a name="line.602"></a>
+<span class="sourceLineNo">603</span> for (int i = 0; i < procedureMap.length; ++i) {<a name="line.603"></a>
+<span class="sourceLineNo">604</span> assert procedureMap[i] == null : "map not empty i=" + i;<a name="line.604"></a>
+<span class="sourceLineNo">605</span> }<a name="line.605"></a>
+<span class="sourceLineNo">606</span> replayOrderHead = null;<a name="line.606"></a>
+<span class="sourceLineNo">607</span> replayOrderTail = null;<a name="line.607"></a>
+<span class="sourceLineNo">608</span> childUnlinkedHead = null;<a name="line.608"></a>
+<span class="sourceLineNo">609</span> rootHead = null;<a name="line.609"></a>
+<span class="sourceLineNo">610</span> return head != null ? new EntryIterator(head) : null;<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 void buildGraph() {<a name="line.613"></a>
+<span class="sourceLineNo">614</span> Entry p = childUnlinkedHead;<a name="line.614"></a>
+<span class="sourceLineNo">615</span> while (p != null) {<a name="line.615"></a>
+<span class="sourceLineNo">616</span> Entry next = p.linkNext;<a name="line.616"></a>
+<span class="sourceLineNo">617</span> Entry rootProc = getRootProcedure(p);<a name="line.617"></a>
+<span class="sourceLineNo">618</span> if (rootProc != null) {<a name="line.618"></a>
+<span class="sourceLineNo">619</span> rootProc.childHead = addToLinkList(p, rootProc.childHead);<a name="line.619"></a>
+<span class="sourceLineNo">620</span> }<a name="line.620"></a>
+<span class="sourceLineNo">621</span> p = next;<a name="line.621"></a>
+<span class="sourceLineNo">622</span> }<a name="line.622"></a>
+<span class="sourceLineNo">623</span><a name="line.623"></a>
+<span class="sourceLineNo">624</span> for (p = rootHead; p != null; p = p.linkNext) {<a name="line.624"></a>
+<span class="sourceLineNo">625</span> checkReadyToRun(p);<a name="line.625"></a>
+<span class="sourceLineNo">626</span> }<a name="line.626"></a>
+<span class="sourceLineNo">627</span> }<a name="line.627"></a>
+<span class="sourceLineNo">628</span><a name="line.628"></a>
+<span class="sourceLineNo">629</span> private Entry getRootProcedure(Entry entry) {<a name="line.629"></a>
+<span class="sourceLineNo">630</span> while (entry != null && entry.hasParent()) {<a name="line.630"></a>
+<span class="sourceLineNo">631</span> entry = getProcedure(entry.getParentId());<a name="line.631"></a>
+<span class="sourceLineNo">632</span> }<a name="line.632"></a>
+<span class="sourceLineNo">633</span> return entry;<a name="line.633"></a>
+<span class="sourceLineNo">634</span> }<a name="line.634"></a>
+<span class="sourceLineNo">635</span><a name="line.635"></a>
+<span class="sourceLineNo">636</span> /*<a name="line.636"></a>
+<span class="sourceLineNo">637</span> * (see the comprehensive explaination in the beginning of the file)<a name="line.637"></a>
+<span class="sourceLineNo">638</span> * A Procedure is ready when parent and children are ready.<a name="line.638"></a>
+<span class="sourceLineNo">639</span> * "ready" means that we all the information that we need in-memory.<a name="line.639"></a>
+<span class="sourceLineNo">640</span> *<a name="line.640"></a>
+<span class="sourceLineNo">641</span> * Example-1:<a name="line.641"></a>
+<span class="sourceLineNo">642</span> * We have two WALs, we start reading fronm the newest (wal-2)<a name="line.642"></a>
+<span class="sourceLineNo">643</span> * wal-2 | C B |<a name="line.643"></a>
+<span class="sourceLineNo">644</span> * wal-1 | A B C |<a name="line.644"></a>
+<span class="sourceLineNo">645</span> *<a name="line.645"></a>
+<span class="sourceLineNo">646</span> * If C and B don't depend on A (A is not the parent), we can start them<a name="line.646"></a>
+<span class="sourceLineNo">647</span> * before reading wal-1. If B is the only one with parent A we can start C<a name="line.647"></a>
+<span class="sourceLineNo">648</span> * and read one more WAL before being able to start B.<a name="line.648"></a>
+<span class="sourceLineNo">649</span> *<a name="line.649"></a>
+<span class="sourceLineNo">650</span> * How do we know with the only information in B that we are not ready.<a name="line.650"></a>
+<span class="sourceLineNo">651</span> * - easy case, the parent is missing from the global map<a name="line.651"></a>
+<span class="sourceLineNo">652</span> * - more complex case we look at the Stack IDs<a name="line.652"></a>
+<span class="sourceLineNo">653</span> *<a name="line.653"></a>
+<span class="sourceLineNo">654</span> * The Stack-IDs are added to the procedure order as incremental index<a name="line.654"></a>
+<span class="sourceLineNo">655</span> * tracking how many times that procedure was executed, which is equivalent<a name="line.655"></a>
+<span class="sourceLineNo">656</span> * at the number of times we wrote the procedure to the WAL.<a name="line.656"></a>
+<span class="sourceLineNo">657</span> * In the example above:<a name="line.657"></a>
+<span class="sourceLineNo">658</span> * wal-2: B has stackId = [1, 2]<a name="line.658"></a>
+<span class="sourceLineNo">659</span> * wal-1: B has stackId = [1]<a name="line.659"></a>
+<span class="sourceLineNo">660</span> * wal-1: A has stackId = [0]<a name="line.660"></a>
+<span class="sourceLineNo">661</span> *<a name="line.661"></a>
+<span class="sourceLineNo">662</span> * Since we know that the Stack-IDs are incremental for a Procedure,<a name="line.662"></a>
+<span class="sourceLineNo">663</span> * we notice that there is a gap in the stackIds of B, so something was<a name="line.663"></a>
+<span class="sourceLineNo">664</span> * executed before.<a name="line.664"></a>
+<span class="sourceLineNo">665</span> * To identify when a Procedure is ready we do the sum of the stackIds of<a name="line.665"></a>
+<span class="sourceLineNo">666</span> * the procedure and the parent. if the stackIdSum is equals to the<a name="line.666"></a>
+<span class="sourceLineNo">667</span> * sum of {1..maxStackId} then everything we need is avaiable.<a name="line.667"></a>
+<span class="sourceLineNo">668</span> *<a name="line.668"></a>
+<span class="sourceLineNo">669</span> * Example-2<a name="line.669"></a>
+<span class="sourceLineNo">670</span> * wal-2 | A | A stackIds = [0, 2]<a name="line.670"></a>
+<span class="sourceLineNo">671</span> * wal-1 | A B | B stackIds = [1]<a name="line.671"></a>
+<span class="sourceLineNo">672</span> *<a name="line.672"></a>
+<span class="sourceLineNo">673</span> * There is a gap between A stackIds so something was executed in between.<a name="line.673"></a>
+<span class="sourceLineNo">674</span> */<a name="line.674"></a>
+<span class="sourceLineNo">675</span> private boolean checkReadyToRun(Entry rootEntry) {<a name="line.675"></a>
+<span class="sourceLineNo">676</span> assert !rootEntry.hasParent() : "expected root procedure, got " + rootEntry;<a name="line.676"></a>
+<span class="sourceLineNo">677</span><a name="line.677"></a>
+<span class="sourceLineNo">678</span> if (rootEntry.isFinished()) {<a name="line.678"></a>
+<span class="sourceLineNo">679</span> // if the root procedure is finished, sub-procedures should be gone<a name="line.679"></a>
+<span class="sourceLineNo">680</span> if (rootEntry.childHead != null) {<a name="line.680"></a>
+<span class="sourceLineNo">681</span> LOG.error("unexpected active children for root-procedure: " + rootEntry);<a name="line.681"></a>
+<span class="sourceLineNo">682</span> for (Entry p = rootEntry.childHead; p != null; p = p.linkNext) {<a name="line.682"></a>
+<span class="sourceLineNo">683</span> LOG.error("unexpected active children: " + p);<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><a name="line.686"></a>
+<span class="sourceLineNo">687</span> assert rootEntry.childHead == null : "unexpected children on root completion. " + rootEntry;<a name="line.687"></a>
+<span class="sourceLineNo">688</span> rootEntry.ready = true;<a name="line.688"></a>
+<span class="sourceLineNo">689</span> return true;<a name="line.689"></a>
+<span class="sourceLineNo">690</span> }<a name="line.690"></a>
+<span class="sourceLineNo">691</span><a name="line.691"></a>
+<span class="sourceLineNo">692</span> int stackIdSum = 0;<a name="line.692"></a>
+<span class="sourceLineNo">693</span> int maxStackId = 0;<a name="line.693"></a>
+<span class="sourceLineNo">694</span> for (int i = 0; i < rootEntry.proto.getStackIdCount(); ++i) {<a name="line.694"></a>
+<span class="sourceLineNo">695</span> int stackId = 1 + rootEntry.proto.getStackId(i);<a name="line.695"></a>
+<span class="sourceLineNo">696</span> maxStackId = Math.max(maxStackId, stackId);<a name="line.696"></a>
+<span class="sourceLineNo">697</span> stackIdSum += stackId;<a name="line.697"></a>
+<span class="sourceLineNo">698</span> }<a name="line.698"></a>
+<span class="sourceLineNo">699</span><a name="line.699"></a>
+<span class="sourceLineNo">700</span> for (Entry p = rootEntry.childHead; p != null; p = p.linkNext) {<a name="line.700"></a>
+<span class="sourceLineNo">701</span> for (int i = 0; i < p.proto.getStackIdCount(); ++i) {<a name="line.701"></a>
+<span class="sourceLineNo">702</span> int stackId = 1 + p.proto.getStackId(i);<a name="line.702"></a>
+<span class="sourceLineNo">703</span> maxStackId = Math.max(maxStackId, stackId);<a name="line.703"></a>
+<span class="sourceLineNo">704</span> stackIdSum += stackId;<a name="line.704"></a>
+<span class="sourceLineNo">705</span> }<a name="line.705"></a>
+<span class="sourceLineNo">706</span> }<a name="line.706"></a>
+<span class="sourceLineNo">707</span> final int cmpStackIdSum = (maxStackId * (maxStackId + 1) / 2);<a name="line.707"></a>
+<span class="sourceLineNo">708</span> if (cmpStackIdSum == stackIdSum) {<a name="line.708"></a>
+<span class="sourceLineNo">709</span> rootEntry.ready = true;<a name="line.709"></a>
+<span class="sourceLineNo">710</span> for (Entry p = rootEntry.childHead; p != null; p = p.linkNext) {<a name="line.710"></a>
+<span class="sourceLineNo">711</span> p.ready = true;<a name="line.711"></a>
+<span class="sourceLineNo">712</span> }<a name="line.712"></a>
+<span class="sourceLineNo">713</span> return true;<a name="line.713"></a>
+<span class="sourceLineNo">714</span> }<a name="line.714"></a>
+<span class="sourceLineNo">715</span> return false;<a name="line.715"></a>
+<span class="sourceLineNo">716</span> }<a name="line.716"></a>
+<span class="sourceLineNo">717</span><a name="line.717"></a>
+<span class="sourceLineNo">718</span> private void unlinkFromReplayList(Entry entry) {<a name="line.718"></a>
+<span class="sourceLineNo">719</span> if (replayOrderHead == entry) {<a name="line.719"></a>
+<span class="sourceLineNo">720</span> replayOrderHead = entry.replayNext;<a name="line.720"></a>
+<span class="sourceLineNo">721</span> }<a name="line.721"></a>
+<span class="sourceLineNo">722</span> if (replayOrderTail == entry) {<a name="line.722"></a>
+<span class="sourceLineNo">723</span> replayOrderTail = entry.replayPrev;<a name="line.723"></a>
+<span class="sourceLineNo">724</span> }<a name="line.724"></a>
+<span class="sourceLineNo">725</span> if (entry.replayPrev != null) {<a name="line.725"></a>
+<span class="sourceLineNo">726</span> entry.replayPrev.replayNext = entry.replayNext;<a name="line.726"></a>
+<span class="sourceLineNo">727</span> }<a name="line.727"></a>
+<span class="sourceLineNo">728</span> if (entry.replayNext != null) {<a name="line.728"></a>
+<span class="sourceLineNo">729</span> entry.replayNext.replayPrev = entry.replayPrev;<a name="line.729"></a>
+<span class="sourceLineNo">730</span> }<a name="line.730"></a>
+<span class="sourceLineNo">731</span> }<a name="line.731"></a>
+<span class="sourceLineNo">732</span><a name="line.732"></a>
+<span class="sourceLineNo">733</span> private void addToReplayList(final Entry entry) {<a name="line.733"></a>
+<span class="sourceLineNo">734</span> unlinkFromReplayList(entry);<a name="line.734"></a>
+<span class="sourceLineNo">735</span> entry.replayNext = replayOrderHead;<a name="line.735"></a>
+<span class="sourceLineNo">736</span> entry.replayPrev = null;<a name="line.736"></a>
+<span class="sourceLineNo">737</span> if (replayOrderHead != null) {<a name="line.737"></a>
+<span class="sourceLineNo">738</span> replayOrderHead.replayPrev = entry;<a name="line.738"></a>
+<span class="sourceLineNo">739</span> } else {<a name="line.739"></a>
+<span class="sourceLineNo">740</span> replayOrderTail = entry;<a name="line.740"></a>
+<span class="sourceLineNo">741</span> }<a name="line.741"></a>
+<span class="sourceLineNo">742</span> replayOrderHead = entry;<a name="line.742"></a>
+<span class="sourceLineNo">743</span> }<a name="line.743"></a>
+<span class="sourceLineNo">744</span><a name="line.744"></a>
+<span class="sourceLineNo">745</span> private void unlinkFromLinkList(Entry entry) {<a name="line.745"></a>
+<span class="sourceLineNo">746</span> if (entry == rootHead) {<a name="line.746"></a>
+<span class="sourceLineNo">747</span> rootHead = entry.linkNext;<a name="line.747"></a>
+<span class="sourceLineNo">748</span> } else if (entry == childUnlinkedHead) {<a name="line.748"></a>
+<span class="sourceLineNo">749</span> childUnlinkedHead = entry.linkNext;<a name="line.749"></a>
+<span class="sourceLineNo">750</span> }<a name="line.750"></a>
+<span class="sourceLineNo">751</span> if (entry.linkPrev != null) {<a name="line.751"></a>
+<span class="sourceLineNo">752</span> entry.linkPrev.linkNext = entry.linkNext;<a name="line.752"></a>
+<span class="sourceLineNo">753</span> }<a name="line.753"></a>
+<span class="sourceLineNo">754</span> if (entry.linkNext != null) {<a name="line.754"></a>
+<span class="sourceLineNo">755</span> entry.linkNext.linkPrev = entry.linkPrev;<a name="line.755"></a>
+<span class="sourceLineNo">756</span> }<a name="line.756"></a>
+<span class="sourceLineNo">757</span> }<a name="line.757"></a>
+<span class="sourceLineNo">758</span><a name="line.758"></a>
+<span class="sourceLineNo">759</span> private Entry addToLinkList(Entry entry, Entry linkHead) {<a name="line.759"></a>
+<span class="sourceLineNo">760</span> unlinkFromLinkList(entry);<a name="line.760"></a>
+<span class="sourceLineNo">761</span> entry.linkNext = linkHead;<a name="line.761"></a>
+<span class="sourceLineNo">762</span> entry.linkPrev = null;<a name="line.762"></a>
+<span class="sourceLineNo">763</span> if (linkHead != null) {<a name="line.763"></a>
+<span class="sourceLineNo">764</span> linkHead.linkPrev = entry;<a name="line.764"></a>
+<span class="sourceLineNo">765</span> }<a name="line.765"></a>
+<span class="sourceLineNo">766</span> return entry;<a name="line.766"></a>
+<span class="sourceLineNo">767</span> }<a name="line.767"></a>
+<span class="sourceLineNo">768</span><a name="line.768"></a>
+<span class="sourceLineNo">769</span> private Entry findLinkListTail(Entry linkHead) {<a name="line.769"></a>
+<span class="sourceLineNo">770</span> Entry tail = linkHead;<a name="line.770"></a>
+<span class="sourceLineNo">771</span> while (tail.linkNext != null) {<a name="line.771"></a>
+<span class="sourceLineNo">772</span> tail = tail.linkNext;<a name="line.772"></a>
+<span class="sourceLineNo">773</span> }<a name="line.773"></a>
+<span class="sourceLineNo">774</span> return tail;<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> private Entry addToMap(final long procId, final boolean hasParent) {<a name="line.777"></a>
+<span class="sourceLineNo">778</span> int slotIndex = getMapSlot(procId);<a name="line.778"></a>
+<span class="sourceLineNo">779</span> Entry entry = getProcedure(slotIndex, procId);<a name="line.779"></a>
+<span class="sourceLineNo">780</span> if (entry != null) return entry;<a name="line.780"></a>
+<span class="sourceLineNo">781</span><a name="line.781"></a>
+<span class="sourceLineNo">782</span> entry = new Entry(procedureMap[slotIndex]);<a name="line.782"></a>
+<span class="sourceLineNo">783</span> procedureMap[slotIndex] = entry;<a name="line.783"></a>
+<span class="sourceLineNo">784</span> return entry;<a name="line.784"></a>
+<span class="sourceLineNo">785</span> }<a name="line.785"></a>
+<span class="sourceLineNo">786</span><a name="line.786"></a>
+<span class="sourceLineNo">787</span> private Entry removeFromMap
<TRUNCATED>