You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@hbase.apache.org by mi...@apache.org on 2016/01/25 18:03:50 UTC
[06/51] [partial] hbase-site git commit: Published site at
a87d9560fcf4803bdd7a01b6e4ec21435d4e11b9.
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f8d6f420/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/wal/ProcedureWALFormatReader.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/wal/ProcedureWALFormatReader.html b/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/wal/ProcedureWALFormatReader.html
index 0ba2dff..3541594 100644
--- a/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/wal/ProcedureWALFormatReader.html
+++ b/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/wal/ProcedureWALFormatReader.html
@@ -30,683 +30,719 @@
<span class="sourceLineNo">022</span><a name="line.22"></a>
<span class="sourceLineNo">023</span>import org.apache.commons.logging.Log;<a name="line.23"></a>
<span class="sourceLineNo">024</span>import org.apache.commons.logging.LogFactory;<a name="line.24"></a>
-<span class="sourceLineNo">025</span>import org.apache.hadoop.hbase.classification.InterfaceAudience;<a name="line.25"></a>
-<span class="sourceLineNo">026</span>import org.apache.hadoop.hbase.classification.InterfaceStability;<a name="line.26"></a>
-<span class="sourceLineNo">027</span>import org.apache.hadoop.fs.FSDataInputStream;<a name="line.27"></a>
-<span class="sourceLineNo">028</span>import org.apache.hadoop.hbase.procedure2.Procedure;<a name="line.28"></a>
-<span class="sourceLineNo">029</span>import org.apache.hadoop.hbase.procedure2.store.ProcedureStoreTracker;<a name="line.29"></a>
-<span class="sourceLineNo">030</span>import org.apache.hadoop.hbase.procedure2.store.ProcedureStore.ProcedureIterator;<a name="line.30"></a>
-<span class="sourceLineNo">031</span>import org.apache.hadoop.hbase.protobuf.generated.ProcedureProtos;<a name="line.31"></a>
-<span class="sourceLineNo">032</span>import org.apache.hadoop.hbase.protobuf.generated.ProcedureProtos.ProcedureWALEntry;<a name="line.32"></a>
-<span class="sourceLineNo">033</span><a name="line.33"></a>
-<span class="sourceLineNo">034</span>/**<a name="line.34"></a>
-<span class="sourceLineNo">035</span> * Helper class that loads the procedures stored in a WAL<a name="line.35"></a>
-<span class="sourceLineNo">036</span> */<a name="line.36"></a>
-<span class="sourceLineNo">037</span>@InterfaceAudience.Private<a name="line.37"></a>
-<span class="sourceLineNo">038</span>@InterfaceStability.Evolving<a name="line.38"></a>
-<span class="sourceLineNo">039</span>public class ProcedureWALFormatReader {<a name="line.39"></a>
-<span class="sourceLineNo">040</span> private static final Log LOG = LogFactory.getLog(ProcedureWALFormatReader.class);<a name="line.40"></a>
-<span class="sourceLineNo">041</span><a name="line.41"></a>
-<span class="sourceLineNo">042</span> // ==============================================================================================<a name="line.42"></a>
-<span class="sourceLineNo">043</span> // We read the WALs in reverse order. from the newest to the oldest.<a name="line.43"></a>
-<span class="sourceLineNo">044</span> // We have different entry types:<a name="line.44"></a>
-<span class="sourceLineNo">045</span> // - INIT: Procedure submitted by the user (also known as 'root procedure')<a name="line.45"></a>
-<span class="sourceLineNo">046</span> // - INSERT: Children added to the procedure <parentId>:[<childId>, ...]<a name="line.46"></a>
-<span class="sourceLineNo">047</span> // - UPDATE: The specified procedure was updated<a name="line.47"></a>
-<span class="sourceLineNo">048</span> // - DELETE: The procedure was removed (completed/rolledback and result TTL expired)<a name="line.48"></a>
-<span class="sourceLineNo">049</span> //<a name="line.49"></a>
-<span class="sourceLineNo">050</span> // In the WAL we can find multiple times the same procedure as UPDATE or INSERT.<a name="line.50"></a>
-<span class="sourceLineNo">051</span> // We read the WAL from top to bottom, so every time we find an entry of the<a name="line.51"></a>
-<span class="sourceLineNo">052</span> // same procedure, that will be the "latest" update.<a name="line.52"></a>
-<span class="sourceLineNo">053</span> //<a name="line.53"></a>
-<span class="sourceLineNo">054</span> // We keep two in-memory maps:<a name="line.54"></a>
-<span class="sourceLineNo">055</span> // - localProcedureMap: is the map containing the entries in the WAL we are processing<a name="line.55"></a>
-<span class="sourceLineNo">056</span> // - procedureMap: is the map containing all the procedures we found up to the WAL in process.<a name="line.56"></a>
-<span class="sourceLineNo">057</span> // localProcedureMap is merged with the procedureMap once we reach the WAL EOF.<a name="line.57"></a>
-<span class="sourceLineNo">058</span> //<a name="line.58"></a>
-<span class="sourceLineNo">059</span> // Since we are reading the WALs in reverse order (newest to oldest),<a name="line.59"></a>
-<span class="sourceLineNo">060</span> // if we find an entry related to a procedure we already have in 'procedureMap' we can discard it.<a name="line.60"></a>
-<span class="sourceLineNo">061</span> //<a name="line.61"></a>
-<span class="sourceLineNo">062</span> // The WAL is append-only so the last procedure in the WAL is the one that<a name="line.62"></a>
-<span class="sourceLineNo">063</span> // was in execution at the time we crashed/closed the server.<a name="line.63"></a>
-<span class="sourceLineNo">064</span> // given that, the procedure replay order can be inferred by the WAL order.<a name="line.64"></a>
-<span class="sourceLineNo">065</span> //<a name="line.65"></a>
-<span class="sourceLineNo">066</span> // Example:<a name="line.66"></a>
-<span class="sourceLineNo">067</span> // WAL-2: [A, B, A, C, D]<a name="line.67"></a>
-<span class="sourceLineNo">068</span> // WAL-1: [F, G, A, F, B]<a name="line.68"></a>
-<span class="sourceLineNo">069</span> // Replay-Order: [D, C, A, B, F, G]<a name="line.69"></a>
-<span class="sourceLineNo">070</span> //<a name="line.70"></a>
-<span class="sourceLineNo">071</span> // The "localProcedureMap" keeps a "replayOrder" list. Every time we add the<a name="line.71"></a>
-<span class="sourceLineNo">072</span> // record to the map that record is moved to the head of the "replayOrder" list.<a name="line.72"></a>
-<span class="sourceLineNo">073</span> // Using the example above:<a name="line.73"></a>
-<span class="sourceLineNo">074</span> // WAL-2 localProcedureMap.replayOrder is [D, C, A, B]<a name="line.74"></a>
-<span class="sourceLineNo">075</span> // WAL-1 localProcedureMap.replayOrder is [F, G]<a name="line.75"></a>
-<span class="sourceLineNo">076</span> //<a name="line.76"></a>
-<span class="sourceLineNo">077</span> // each time we reach the WAL-EOF, the "replayOrder" list is merged/appended in 'procedureMap'<a name="line.77"></a>
-<span class="sourceLineNo">078</span> // so using the example above we end up with: [D, C, A, B] + [F, G] as replay order.<a name="line.78"></a>
-<span class="sourceLineNo">079</span> //<a name="line.79"></a>
-<span class="sourceLineNo">080</span> // Fast Start: INIT/INSERT record and StackIDs<a name="line.80"></a>
-<span class="sourceLineNo">081</span> // ---------------------------------------------<a name="line.81"></a>
-<span class="sourceLineNo">082</span> // We have to special record, INIT and INSERT that tracks the first time<a name="line.82"></a>
-<span class="sourceLineNo">083</span> // the procedure was added to the WAL. We can use that information to be able<a name="line.83"></a>
-<span class="sourceLineNo">084</span> // to start procedures before reaching the end of the WAL, or before reading all the WALs.<a name="line.84"></a>
-<span class="sourceLineNo">085</span> // but in some cases the WAL with that record can be already gone.<a name="line.85"></a>
-<span class="sourceLineNo">086</span> // In alternative we can use the stackIds on each procedure,<a name="line.86"></a>
-<span class="sourceLineNo">087</span> // to identify when a procedure is ready to start.<a name="line.87"></a>
-<span class="sourceLineNo">088</span> // If there are gaps in the sum of the stackIds we need to read more WALs.<a name="line.88"></a>
-<span class="sourceLineNo">089</span> //<a name="line.89"></a>
-<span class="sourceLineNo">090</span> // Example (all procs child of A):<a name="line.90"></a>
-<span class="sourceLineNo">091</span> // WAL-2: [A, B] A stackIds = [0, 4], B stackIds = [1, 5]<a name="line.91"></a>
-<span class="sourceLineNo">092</span> // WAL-1: [A, B, C, D]<a name="line.92"></a>
-<span class="sourceLineNo">093</span> //<a name="line.93"></a>
-<span class="sourceLineNo">094</span> // In the case above we need to read one more WAL to be able to consider<a name="line.94"></a>
-<span class="sourceLineNo">095</span> // the root procedure A and all children as ready.<a name="line.95"></a>
-<span class="sourceLineNo">096</span> // ==============================================================================================<a name="line.96"></a>
-<span class="sourceLineNo">097</span> private final WalProcedureMap localProcedureMap = new WalProcedureMap(1024);<a name="line.97"></a>
-<span class="sourceLineNo">098</span> private final WalProcedureMap procedureMap = new WalProcedureMap(1024);<a name="line.98"></a>
-<span class="sourceLineNo">099</span><a name="line.99"></a>
-<span class="sourceLineNo">100</span> //private long compactionLogId;<a name="line.100"></a>
-<span class="sourceLineNo">101</span> private long maxProcId = 0;<a name="line.101"></a>
-<span class="sourceLineNo">102</span><a name="line.102"></a>
-<span class="sourceLineNo">103</span> private final ProcedureStoreTracker tracker;<a name="line.103"></a>
-<span class="sourceLineNo">104</span> private final boolean hasFastStartSupport;<a name="line.104"></a>
-<span class="sourceLineNo">105</span><a name="line.105"></a>
-<span class="sourceLineNo">106</span> public ProcedureWALFormatReader(final ProcedureStoreTracker tracker) {<a name="line.106"></a>
-<span class="sourceLineNo">107</span> this.tracker = tracker;<a name="line.107"></a>
-<span class="sourceLineNo">108</span> // we support fast-start only if we have a clean shutdown.<a name="line.108"></a>
-<span class="sourceLineNo">109</span> this.hasFastStartSupport = !tracker.isEmpty();<a name="line.109"></a>
-<span class="sourceLineNo">110</span> }<a name="line.110"></a>
-<span class="sourceLineNo">111</span><a name="line.111"></a>
-<span class="sourceLineNo">112</span> public void read(ProcedureWALFile log, ProcedureWALFormat.Loader loader) throws IOException {<a name="line.112"></a>
-<span class="sourceLineNo">113</span> FSDataInputStream stream = log.getStream();<a name="line.113"></a>
-<span class="sourceLineNo">114</span> try {<a name="line.114"></a>
-<span class="sourceLineNo">115</span> boolean hasMore = true;<a name="line.115"></a>
-<span class="sourceLineNo">116</span> while (hasMore) {<a name="line.116"></a>
-<span class="sourceLineNo">117</span> ProcedureWALEntry entry = ProcedureWALFormat.readEntry(stream);<a name="line.117"></a>
-<span class="sourceLineNo">118</span> if (entry == null) {<a name="line.118"></a>
-<span class="sourceLineNo">119</span> LOG.warn("nothing left to decode. exiting with missing EOF");<a name="line.119"></a>
-<span class="sourceLineNo">120</span> hasMore = false;<a name="line.120"></a>
-<span class="sourceLineNo">121</span> break;<a name="line.121"></a>
-<span class="sourceLineNo">122</span> }<a name="line.122"></a>
-<span class="sourceLineNo">123</span> switch (entry.getType()) {<a name="line.123"></a>
-<span class="sourceLineNo">124</span> case PROCEDURE_WAL_INIT:<a name="line.124"></a>
-<span class="sourceLineNo">125</span> readInitEntry(entry);<a name="line.125"></a>
-<span class="sourceLineNo">126</span> break;<a name="line.126"></a>
-<span class="sourceLineNo">127</span> case PROCEDURE_WAL_INSERT:<a name="line.127"></a>
-<span class="sourceLineNo">128</span> readInsertEntry(entry);<a name="line.128"></a>
-<span class="sourceLineNo">129</span> break;<a name="line.129"></a>
-<span class="sourceLineNo">130</span> case PROCEDURE_WAL_UPDATE:<a name="line.130"></a>
-<span class="sourceLineNo">131</span> case PROCEDURE_WAL_COMPACT:<a name="line.131"></a>
-<span class="sourceLineNo">132</span> readUpdateEntry(entry);<a name="line.132"></a>
-<span class="sourceLineNo">133</span> break;<a name="line.133"></a>
-<span class="sourceLineNo">134</span> case PROCEDURE_WAL_DELETE:<a name="line.134"></a>
-<span class="sourceLineNo">135</span> readDeleteEntry(entry);<a name="line.135"></a>
-<span class="sourceLineNo">136</span> break;<a name="line.136"></a>
-<span class="sourceLineNo">137</span> case PROCEDURE_WAL_EOF:<a name="line.137"></a>
-<span class="sourceLineNo">138</span> hasMore = false;<a name="line.138"></a>
-<span class="sourceLineNo">139</span> break;<a name="line.139"></a>
-<span class="sourceLineNo">140</span> default:<a name="line.140"></a>
-<span class="sourceLineNo">141</span> throw new CorruptedWALProcedureStoreException("Invalid entry: " + entry);<a name="line.141"></a>
-<span class="sourceLineNo">142</span> }<a name="line.142"></a>
-<span class="sourceLineNo">143</span> }<a name="line.143"></a>
-<span class="sourceLineNo">144</span> } catch (IOException e) {<a name="line.144"></a>
-<span class="sourceLineNo">145</span> LOG.error("got an exception while reading the procedure WAL: " + log, e);<a name="line.145"></a>
-<span class="sourceLineNo">146</span> loader.markCorruptedWAL(log, e);<a name="line.146"></a>
-<span class="sourceLineNo">147</span> }<a name="line.147"></a>
-<span class="sourceLineNo">148</span><a name="line.148"></a>
-<span class="sourceLineNo">149</span> if (localProcedureMap.isEmpty()) {<a name="line.149"></a>
-<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> 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>
-<span class="sourceLineNo">158</span> // --------------------------------------------------<a name="line.158"></a>
-<span class="sourceLineNo">159</span> //EntryIterator iter = procedureMap.fetchReady();<a name="line.159"></a>
-<span class="sourceLineNo">160</span> //if (iter != null) loader.load(iter);<a name="line.160"></a>
-<span class="sourceLineNo">161</span> // --------------------------------------------------<a name="line.161"></a>
-<span class="sourceLineNo">162</span> //}<a name="line.162"></a>
-<span class="sourceLineNo">163</span> }<a name="line.163"></a>
-<span class="sourceLineNo">164</span> }<a name="line.164"></a>
-<span class="sourceLineNo">165</span><a name="line.165"></a>
-<span class="sourceLineNo">166</span> public void finalize(ProcedureWALFormat.Loader loader) throws IOException {<a name="line.166"></a>
-<span class="sourceLineNo">167</span> // notify the loader about the max proc ID<a name="line.167"></a>
-<span class="sourceLineNo">168</span> loader.setMaxProcId(maxProcId);<a name="line.168"></a>
-<span class="sourceLineNo">169</span><a name="line.169"></a>
-<span class="sourceLineNo">170</span> // fetch the procedure ready to run.<a name="line.170"></a>
-<span class="sourceLineNo">171</span> ProcedureIterator procIter = procedureMap.fetchReady();<a name="line.171"></a>
-<span class="sourceLineNo">172</span> if (procIter != null) loader.load(procIter);<a name="line.172"></a>
-<span class="sourceLineNo">173</span><a name="line.173"></a>
-<span class="sourceLineNo">174</span> // remaining procedures have missing link or dependencies<a name="line.174"></a>
-<span class="sourceLineNo">175</span> // consider them as corrupted, manual fix is probably required.<a name="line.175"></a>
-<span class="sourceLineNo">176</span> procIter = procedureMap.fetchAll();<a name="line.176"></a>
-<span class="sourceLineNo">177</span> if (procIter != null) loader.handleCorrupted(procIter);<a name="line.177"></a>
-<span class="sourceLineNo">178</span> }<a name="line.178"></a>
-<span class="sourceLineNo">179</span><a name="line.179"></a>
-<span class="sourceLineNo">180</span> private void loadProcedure(final ProcedureWALEntry entry, final ProcedureProtos.Procedure proc) {<a name="line.180"></a>
-<span class="sourceLineNo">181</span> maxProcId = Math.max(maxProcId, proc.getProcId());<a name="line.181"></a>
-<span class="sourceLineNo">182</span> if (isRequired(proc.getProcId())) {<a name="line.182"></a>
-<span class="sourceLineNo">183</span> if (LOG.isTraceEnabled()) {<a name="line.183"></a>
-<span class="sourceLineNo">184</span> LOG.trace("read " + entry.getType() + " entry " + proc.getProcId());<a name="line.184"></a>
-<span class="sourceLineNo">185</span> }<a name="line.185"></a>
-<span class="sourceLineNo">186</span> localProcedureMap.add(proc);<a name="line.186"></a>
-<span class="sourceLineNo">187</span> tracker.setDeleted(proc.getProcId(), false);<a name="line.187"></a>
-<span class="sourceLineNo">188</span> }<a name="line.188"></a>
-<span class="sourceLineNo">189</span> }<a name="line.189"></a>
-<span class="sourceLineNo">190</span><a name="line.190"></a>
-<span class="sourceLineNo">191</span> private void readInitEntry(final ProcedureWALEntry entry)<a name="line.191"></a>
-<span class="sourceLineNo">192</span> throws IOException {<a name="line.192"></a>
-<span class="sourceLineNo">193</span> assert entry.getProcedureCount() == 1 : "Expected only one procedure";<a name="line.193"></a>
-<span class="sourceLineNo">194</span> loadProcedure(entry, entry.getProcedure(0));<a name="line.194"></a>
-<span class="sourceLineNo">195</span> }<a name="line.195"></a>
-<span class="sourceLineNo">196</span><a name="line.196"></a>
-<span class="sourceLineNo">197</span> private void readInsertEntry(final ProcedureWALEntry entry) throws IOException {<a name="line.197"></a>
-<span class="sourceLineNo">198</span> assert entry.getProcedureCount() >= 1 : "Expected one or more procedures";<a name="line.198"></a>
-<span class="sourceLineNo">199</span> loadProcedure(entry, entry.getProcedure(0));<a name="line.199"></a>
-<span class="sourceLineNo">200</span> for (int i = 1; i < entry.getProcedureCount(); ++i) {<a name="line.200"></a>
-<span class="sourceLineNo">201</span> loadProcedure(entry, entry.getProcedure(i));<a name="line.201"></a>
-<span class="sourceLineNo">202</span> }<a name="line.202"></a>
-<span class="sourceLineNo">203</span> }<a name="line.203"></a>
-<span class="sourceLineNo">204</span><a name="line.204"></a>
-<span class="sourceLineNo">205</span> private void readUpdateEntry(final ProcedureWALEntry entry) throws IOException {<a name="line.205"></a>
-<span class="sourceLineNo">206</span> assert entry.getProcedureCount() == 1 : "Expected only one procedure";<a name="line.206"></a>
-<span class="sourceLineNo">207</span> loadProcedure(entry, entry.getProcedure(0));<a name="line.207"></a>
-<span class="sourceLineNo">208</span> }<a name="line.208"></a>
-<span class="sourceLineNo">209</span><a name="line.209"></a>
-<span class="sourceLineNo">210</span> private void readDeleteEntry(final ProcedureWALEntry entry) throws IOException {<a name="line.210"></a>
-<span class="sourceLineNo">211</span> assert entry.getProcedureCount() == 0 : "Expected no procedures";<a name="line.211"></a>
-<span class="sourceLineNo">212</span> assert entry.hasProcId() : "expected ProcID";<a name="line.212"></a>
-<span class="sourceLineNo">213</span> if (LOG.isTraceEnabled()) {<a name="line.213"></a>
-<span class="sourceLineNo">214</span> LOG.trace("read delete entry " + entry.getProcId());<a name="line.214"></a>
-<span class="sourceLineNo">215</span> }<a name="line.215"></a>
-<span class="sourceLineNo">216</span> maxProcId = Math.max(maxProcId, entry.getProcId());<a name="line.216"></a>
-<span class="sourceLineNo">217</span> localProcedureMap.remove(entry.getProcId());<a name="line.217"></a>
-<span class="sourceLineNo">218</span> tracker.setDeleted(entry.getProcId(), true);<a name="line.218"></a>
-<span class="sourceLineNo">219</span> }<a name="line.219"></a>
-<span class="sourceLineNo">220</span><a name="line.220"></a>
-<span class="sourceLineNo">221</span> private boolean isDeleted(final long procId) {<a name="line.221"></a>
-<span class="sourceLineNo">222</span> return tracker.isDeleted(procId) == ProcedureStoreTracker.DeleteState.YES;<a name="line.222"></a>
-<span class="sourceLineNo">223</span> }<a name="line.223"></a>
-<span class="sourceLineNo">224</span><a name="line.224"></a>
-<span class="sourceLineNo">225</span> private boolean isRequired(final long procId) {<a name="line.225"></a>
-<span class="sourceLineNo">226</span> return !isDeleted(procId) && !procedureMap.contains(procId);<a name="line.226"></a>
-<span class="sourceLineNo">227</span> }<a name="line.227"></a>
-<span class="sourceLineNo">228</span><a name="line.228"></a>
-<span class="sourceLineNo">229</span> // ==========================================================================<a name="line.229"></a>
-<span class="sourceLineNo">230</span> // We keep an in-memory map of the procedures sorted by replay order.<a name="line.230"></a>
-<span class="sourceLineNo">231</span> // (see the details in the beginning of the file)<a name="line.231"></a>
-<span class="sourceLineNo">232</span> // _______________________________________________<a name="line.232"></a>
-<span class="sourceLineNo">233</span> // procedureMap = | A | | E | | C | | | | | G | | |<a name="line.233"></a>
-<span class="sourceLineNo">234</span> // D B<a name="line.234"></a>
-<span class="sourceLineNo">235</span> // replayOrderHead = C <-> B <-> E <-> D <-> A <-> G<a name="line.235"></a>
-<span class="sourceLineNo">236</span> //<a name="line.236"></a>
-<span class="sourceLineNo">237</span> // We also have a lazy grouping by "root procedure", and a list of<a name="line.237"></a>
-<span class="sourceLineNo">238</span> // unlinked procedure. If after reading all the WALs we have unlinked<a name="line.238"></a>
-<span class="sourceLineNo">239</span> // procedures it means that we had a missing WAL or a corruption.<a name="line.239"></a>
-<span class="sourceLineNo">240</span> // rootHead = A <-> D <-> G<a name="line.240"></a>
-<span class="sourceLineNo">241</span> // B E<a name="line.241"></a>
-<span class="sourceLineNo">242</span> // C<a name="line.242"></a>
-<span class="sourceLineNo">243</span> // unlinkFromLinkList = None<a name="line.243"></a>
-<span class="sourceLineNo">244</span> // ==========================================================================<a name="line.244"></a>
-<span class="sourceLineNo">245</span> private static class Entry {<a name="line.245"></a>
-<span class="sourceLineNo">246</span> // hash-table next<a name="line.246"></a>
-<span class="sourceLineNo">247</span> protected Entry hashNext;<a name="line.247"></a>
-<span class="sourceLineNo">248</span> // child head<a name="line.248"></a>
-<span class="sourceLineNo">249</span> protected Entry childHead;<a name="line.249"></a>
-<span class="sourceLineNo">250</span> // double-link for rootHead or childHead<a name="line.250"></a>
-<span class="sourceLineNo">251</span> protected Entry linkNext;<a name="line.251"></a>
-<span class="sourceLineNo">252</span> protected Entry linkPrev;<a name="line.252"></a>
-<span class="sourceLineNo">253</span> // replay double-linked-list<a name="line.253"></a>
-<span class="sourceLineNo">254</span> protected Entry replayNext;<a name="line.254"></a>
-<span class="sourceLineNo">255</span> protected Entry replayPrev;<a name="line.255"></a>
-<span class="sourceLineNo">256</span> // procedure-infos<a name="line.256"></a>
-<span class="sourceLineNo">257</span> protected Procedure procedure;<a name="line.257"></a>
-<span class="sourceLineNo">258</span> protected ProcedureProtos.Procedure proto;<a name="line.258"></a>
-<span class="sourceLineNo">259</span> protected boolean ready = false;<a name="line.259"></a>
-<span class="sourceLineNo">260</span><a name="line.260"></a>
-<span class="sourceLineNo">261</span> public Entry(Entry hashNext) { this.hashNext = hashNext; }<a name="line.261"></a>
-<span class="sourceLineNo">262</span><a name="line.262"></a>
-<span class="sourceLineNo">263</span> public long getProcId() { return proto.getProcId(); }<a name="line.263"></a>
-<span class="sourceLineNo">264</span> public long getParentId() { return proto.getParentId(); }<a name="line.264"></a>
-<span class="sourceLineNo">265</span> public boolean hasParent() { return proto.hasParentId(); }<a name="line.265"></a>
-<span class="sourceLineNo">266</span> public boolean isReady() { return ready; }<a name="line.266"></a>
-<span class="sourceLineNo">267</span><a name="line.267"></a>
-<span class="sourceLineNo">268</span> public Procedure convert() throws IOException {<a name="line.268"></a>
-<span class="sourceLineNo">269</span> if (procedure == null) {<a name="line.269"></a>
-<span class="sourceLineNo">270</span> procedure = Procedure.convert(proto);<a name="line.270"></a>
-<span class="sourceLineNo">271</span> }<a name="line.271"></a>
-<span class="sourceLineNo">272</span> return procedure;<a name="line.272"></a>
-<span class="sourceLineNo">273</span> }<a name="line.273"></a>
-<span class="sourceLineNo">274</span><a name="line.274"></a>
-<span class="sourceLineNo">275</span> @Override<a name="line.275"></a>
-<span class="sourceLineNo">276</span> public String toString() {<a name="line.276"></a>
-<span class="sourceLineNo">277</span> return "Entry(" + getProcId() + ", parentId=" + getParentId() + ")";<a name="line.277"></a>
-<span class="sourceLineNo">278</span> }<a name="line.278"></a>
-<span class="sourceLineNo">279</span> }<a name="line.279"></a>
+<span class="sourceLineNo">025</span>import org.apache.hadoop.fs.FSDataInputStream;<a name="line.25"></a>
+<span class="sourceLineNo">026</span>import org.apache.hadoop.hbase.classification.InterfaceAudience;<a name="line.26"></a>
+<span class="sourceLineNo">027</span>import org.apache.hadoop.hbase.classification.InterfaceStability;<a name="line.27"></a>
+<span class="sourceLineNo">028</span>import org.apache.hadoop.hbase.ProcedureInfo;<a name="line.28"></a>
+<span class="sourceLineNo">029</span>import org.apache.hadoop.hbase.procedure2.Procedure;<a name="line.29"></a>
+<span class="sourceLineNo">030</span>import org.apache.hadoop.hbase.procedure2.store.ProcedureStoreTracker;<a name="line.30"></a>
+<span class="sourceLineNo">031</span>import org.apache.hadoop.hbase.procedure2.store.ProcedureStore.ProcedureIterator;<a name="line.31"></a>
+<span class="sourceLineNo">032</span>import org.apache.hadoop.hbase.protobuf.generated.ProcedureProtos;<a name="line.32"></a>
+<span class="sourceLineNo">033</span>import org.apache.hadoop.hbase.protobuf.generated.ProcedureProtos.ProcedureWALEntry;<a name="line.33"></a>
+<span class="sourceLineNo">034</span><a name="line.34"></a>
+<span class="sourceLineNo">035</span>/**<a name="line.35"></a>
+<span class="sourceLineNo">036</span> * Helper class that loads the procedures stored in a WAL<a name="line.36"></a>
+<span class="sourceLineNo">037</span> */<a name="line.37"></a>
+<span class="sourceLineNo">038</span>@InterfaceAudience.Private<a name="line.38"></a>
+<span class="sourceLineNo">039</span>@InterfaceStability.Evolving<a name="line.39"></a>
+<span class="sourceLineNo">040</span>public class ProcedureWALFormatReader {<a name="line.40"></a>
+<span class="sourceLineNo">041</span> private static final Log LOG = LogFactory.getLog(ProcedureWALFormatReader.class);<a name="line.41"></a>
+<span class="sourceLineNo">042</span><a name="line.42"></a>
+<span class="sourceLineNo">043</span> // ==============================================================================================<a name="line.43"></a>
+<span class="sourceLineNo">044</span> // We read the WALs in reverse order. from the newest to the oldest.<a name="line.44"></a>
+<span class="sourceLineNo">045</span> // We have different entry types:<a name="line.45"></a>
+<span class="sourceLineNo">046</span> // - INIT: Procedure submitted by the user (also known as 'root procedure')<a name="line.46"></a>
+<span class="sourceLineNo">047</span> // - INSERT: Children added to the procedure <parentId>:[<childId>, ...]<a name="line.47"></a>
+<span class="sourceLineNo">048</span> // - UPDATE: The specified procedure was updated<a name="line.48"></a>
+<span class="sourceLineNo">049</span> // - DELETE: The procedure was removed (completed/rolledback and result TTL expired)<a name="line.49"></a>
+<span class="sourceLineNo">050</span> //<a name="line.50"></a>
+<span class="sourceLineNo">051</span> // In the WAL we can find multiple times the same procedure as UPDATE or INSERT.<a name="line.51"></a>
+<span class="sourceLineNo">052</span> // We read the WAL from top to bottom, so every time we find an entry of the<a name="line.52"></a>
+<span class="sourceLineNo">053</span> // same procedure, that will be the "latest" update.<a name="line.53"></a>
+<span class="sourceLineNo">054</span> //<a name="line.54"></a>
+<span class="sourceLineNo">055</span> // We keep two in-memory maps:<a name="line.55"></a>
+<span class="sourceLineNo">056</span> // - localProcedureMap: is the map containing the entries in the WAL we are processing<a name="line.56"></a>
+<span class="sourceLineNo">057</span> // - procedureMap: is the map containing all the procedures we found up to the WAL in process.<a name="line.57"></a>
+<span class="sourceLineNo">058</span> // localProcedureMap is merged with the procedureMap once we reach the WAL EOF.<a name="line.58"></a>
+<span class="sourceLineNo">059</span> //<a name="line.59"></a>
+<span class="sourceLineNo">060</span> // Since we are reading the WALs in reverse order (newest to oldest),<a name="line.60"></a>
+<span class="sourceLineNo">061</span> // if we find an entry related to a procedure we already have in 'procedureMap' we can discard it.<a name="line.61"></a>
+<span class="sourceLineNo">062</span> //<a name="line.62"></a>
+<span class="sourceLineNo">063</span> // The WAL is append-only so the last procedure in the WAL is the one that<a name="line.63"></a>
+<span class="sourceLineNo">064</span> // was in execution at the time we crashed/closed the server.<a name="line.64"></a>
+<span class="sourceLineNo">065</span> // given that, the procedure replay order can be inferred by the WAL order.<a name="line.65"></a>
+<span class="sourceLineNo">066</span> //<a name="line.66"></a>
+<span class="sourceLineNo">067</span> // Example:<a name="line.67"></a>
+<span class="sourceLineNo">068</span> // WAL-2: [A, B, A, C, D]<a name="line.68"></a>
+<span class="sourceLineNo">069</span> // WAL-1: [F, G, A, F, B]<a name="line.69"></a>
+<span class="sourceLineNo">070</span> // Replay-Order: [D, C, A, B, F, G]<a name="line.70"></a>
+<span class="sourceLineNo">071</span> //<a name="line.71"></a>
+<span class="sourceLineNo">072</span> // The "localProcedureMap" keeps a "replayOrder" list. Every time we add the<a name="line.72"></a>
+<span class="sourceLineNo">073</span> // record to the map that record is moved to the head of the "replayOrder" list.<a name="line.73"></a>
+<span class="sourceLineNo">074</span> // Using the example above:<a name="line.74"></a>
+<span class="sourceLineNo">075</span> // WAL-2 localProcedureMap.replayOrder is [D, C, A, B]<a name="line.75"></a>
+<span class="sourceLineNo">076</span> // WAL-1 localProcedureMap.replayOrder is [F, G]<a name="line.76"></a>
+<span class="sourceLineNo">077</span> //<a name="line.77"></a>
+<span class="sourceLineNo">078</span> // each time we reach the WAL-EOF, the "replayOrder" list is merged/appended in 'procedureMap'<a name="line.78"></a>
+<span class="sourceLineNo">079</span> // so using the example above we end up with: [D, C, A, B] + [F, G] as replay order.<a name="line.79"></a>
+<span class="sourceLineNo">080</span> //<a name="line.80"></a>
+<span class="sourceLineNo">081</span> // Fast Start: INIT/INSERT record and StackIDs<a name="line.81"></a>
+<span class="sourceLineNo">082</span> // ---------------------------------------------<a name="line.82"></a>
+<span class="sourceLineNo">083</span> // We have two special record, INIT and INSERT that tracks the first time<a name="line.83"></a>
+<span class="sourceLineNo">084</span> // the procedure was added to the WAL. We can use that information to be able<a name="line.84"></a>
+<span class="sourceLineNo">085</span> // to start procedures before reaching the end of the WAL, or before reading all the WALs.<a name="line.85"></a>
+<span class="sourceLineNo">086</span> // but in some cases the WAL with that record can be already gone.<a name="line.86"></a>
+<span class="sourceLineNo">087</span> // In alternative we can use the stackIds on each procedure,<a name="line.87"></a>
+<span class="sourceLineNo">088</span> // to identify when a procedure is ready to start.<a name="line.88"></a>
+<span class="sourceLineNo">089</span> // If there are gaps in the sum of the stackIds we need to read more WALs.<a name="line.89"></a>
+<span class="sourceLineNo">090</span> //<a name="line.90"></a>
+<span class="sourceLineNo">091</span> // Example (all procs child of A):<a name="line.91"></a>
+<span class="sourceLineNo">092</span> // WAL-2: [A, B] A stackIds = [0, 4], B stackIds = [1, 5]<a name="line.92"></a>
+<span class="sourceLineNo">093</span> // WAL-1: [A, B, C, D]<a name="line.93"></a>
+<span class="sourceLineNo">094</span> //<a name="line.94"></a>
+<span class="sourceLineNo">095</span> // In the case above we need to read one more WAL to be able to consider<a name="line.95"></a>
+<span class="sourceLineNo">096</span> // the root procedure A and all children as ready.<a name="line.96"></a>
+<span class="sourceLineNo">097</span> // ==============================================================================================<a name="line.97"></a>
+<span class="sourceLineNo">098</span> private final WalProcedureMap localProcedureMap = new WalProcedureMap(1024);<a name="line.98"></a>
+<span class="sourceLineNo">099</span> private final WalProcedureMap procedureMap = new WalProcedureMap(1024);<a name="line.99"></a>
+<span class="sourceLineNo">100</span><a name="line.100"></a>
+<span class="sourceLineNo">101</span> //private long compactionLogId;<a name="line.101"></a>
+<span class="sourceLineNo">102</span> private long maxProcId = 0;<a name="line.102"></a>
+<span class="sourceLineNo">103</span><a name="line.103"></a>
+<span class="sourceLineNo">104</span> private final ProcedureStoreTracker tracker;<a name="line.104"></a>
+<span class="sourceLineNo">105</span> private final boolean hasFastStartSupport;<a name="line.105"></a>
+<span class="sourceLineNo">106</span><a name="line.106"></a>
+<span class="sourceLineNo">107</span> public ProcedureWALFormatReader(final ProcedureStoreTracker tracker) {<a name="line.107"></a>
+<span class="sourceLineNo">108</span> this.tracker = tracker;<a name="line.108"></a>
+<span class="sourceLineNo">109</span> // we support fast-start only if we have a clean shutdown.<a name="line.109"></a>
+<span class="sourceLineNo">110</span> this.hasFastStartSupport = !tracker.isEmpty();<a name="line.110"></a>
+<span class="sourceLineNo">111</span> }<a name="line.111"></a>
+<span class="sourceLineNo">112</span><a name="line.112"></a>
+<span class="sourceLineNo">113</span> public void read(ProcedureWALFile log, ProcedureWALFormat.Loader loader) throws IOException {<a name="line.113"></a>
+<span class="sourceLineNo">114</span> FSDataInputStream stream = log.getStream();<a name="line.114"></a>
+<span class="sourceLineNo">115</span> try {<a name="line.115"></a>
+<span class="sourceLineNo">116</span> boolean hasMore = true;<a name="line.116"></a>
+<span class="sourceLineNo">117</span> while (hasMore) {<a name="line.117"></a>
+<span class="sourceLineNo">118</span> ProcedureWALEntry entry = ProcedureWALFormat.readEntry(stream);<a name="line.118"></a>
+<span class="sourceLineNo">119</span> if (entry == null) {<a name="line.119"></a>
+<span class="sourceLineNo">120</span> LOG.warn("nothing left to decode. exiting with missing EOF");<a name="line.120"></a>
+<span class="sourceLineNo">121</span> hasMore = false;<a name="line.121"></a>
+<span class="sourceLineNo">122</span> break;<a name="line.122"></a>
+<span class="sourceLineNo">123</span> }<a name="line.123"></a>
+<span class="sourceLineNo">124</span> switch (entry.getType()) {<a name="line.124"></a>
+<span class="sourceLineNo">125</span> case PROCEDURE_WAL_INIT:<a name="line.125"></a>
+<span class="sourceLineNo">126</span> readInitEntry(entry);<a name="line.126"></a>
+<span class="sourceLineNo">127</span> break;<a name="line.127"></a>
+<span class="sourceLineNo">128</span> case PROCEDURE_WAL_INSERT:<a name="line.128"></a>
+<span class="sourceLineNo">129</span> readInsertEntry(entry);<a name="line.129"></a>
+<span class="sourceLineNo">130</span> break;<a name="line.130"></a>
+<span class="sourceLineNo">131</span> case PROCEDURE_WAL_UPDATE:<a name="line.131"></a>
+<span class="sourceLineNo">132</span> case PROCEDURE_WAL_COMPACT:<a name="line.132"></a>
+<span class="sourceLineNo">133</span> readUpdateEntry(entry);<a name="line.133"></a>
+<span class="sourceLineNo">134</span> break;<a name="line.134"></a>
+<span class="sourceLineNo">135</span> case PROCEDURE_WAL_DELETE:<a name="line.135"></a>
+<span class="sourceLineNo">136</span> readDeleteEntry(entry);<a name="line.136"></a>
+<span class="sourceLineNo">137</span> break;<a name="line.137"></a>
+<span class="sourceLineNo">138</span> case PROCEDURE_WAL_EOF:<a name="line.138"></a>
+<span class="sourceLineNo">139</span> hasMore = false;<a name="line.139"></a>
+<span class="sourceLineNo">140</span> break;<a name="line.140"></a>
+<span class="sourceLineNo">141</span> default:<a name="line.141"></a>
+<span class="sourceLineNo">142</span> throw new CorruptedWALProcedureStoreException("Invalid entry: " + entry);<a name="line.142"></a>
+<span class="sourceLineNo">143</span> }<a name="line.143"></a>
+<span class="sourceLineNo">144</span> }<a name="line.144"></a>
+<span class="sourceLineNo">145</span> } catch (IOException e) {<a name="line.145"></a>
+<span class="sourceLineNo">146</span> LOG.error("got an exception while reading the procedure WAL: " + log, e);<a name="line.146"></a>
+<span class="sourceLineNo">147</span> loader.markCorruptedWAL(log, e);<a name="line.147"></a>
+<span class="sourceLineNo">148</span> }<a name="line.148"></a>
+<span class="sourceLineNo">149</span><a name="line.149"></a>
+<span class="sourceLineNo">150</span> if (!localProcedureMap.isEmpty()) {<a name="line.150"></a>
+<span class="sourceLineNo">151</span> log.setProcIds(localProcedureMap.getMinProcId(), localProcedureMap.getMaxProcId());<a name="line.151"></a>
+<span class="sourceLineNo">152</span> procedureMap.mergeTail(localProcedureMap);<a name="line.152"></a>
+<span class="sourceLineNo">153</span> //if (hasFastStartSupport) {<a name="line.153"></a>
+<span class="sourceLineNo">154</span> // TODO: Some procedure may be already runnables (see readInitEntry())<a name="line.154"></a>
+<span class="sourceLineNo">155</span> // (we can also check the "update map" in the log trackers)<a name="line.155"></a>
+<span class="sourceLineNo">156</span> // --------------------------------------------------<a name="line.156"></a>
+<span class="sourceLineNo">157</span> //EntryIterator iter = procedureMap.fetchReady();<a name="line.157"></a>
+<span class="sourceLineNo">158</span> //if (iter != null) loader.load(iter);<a name="line.158"></a>
+<span class="sourceLineNo">159</span> // --------------------------------------------------<a name="line.159"></a>
+<span class="sourceLineNo">160</span> //}<a name="line.160"></a>
+<span class="sourceLineNo">161</span> }<a name="line.161"></a>
+<span class="sourceLineNo">162</span> }<a name="line.162"></a>
+<span class="sourceLineNo">163</span><a name="line.163"></a>
+<span class="sourceLineNo">164</span> public void finalize(ProcedureWALFormat.Loader loader) throws IOException {<a name="line.164"></a>
+<span class="sourceLineNo">165</span> // notify the loader about the max proc ID<a name="line.165"></a>
+<span class="sourceLineNo">166</span> loader.setMaxProcId(maxProcId);<a name="line.166"></a>
+<span class="sourceLineNo">167</span><a name="line.167"></a>
+<span class="sourceLineNo">168</span> // fetch the procedure ready to run.<a name="line.168"></a>
+<span class="sourceLineNo">169</span> ProcedureIterator procIter = procedureMap.fetchReady();<a name="line.169"></a>
+<span class="sourceLineNo">170</span> if (procIter != null) loader.load(procIter);<a name="line.170"></a>
+<span class="sourceLineNo">171</span><a name="line.171"></a>
+<span class="sourceLineNo">172</span> // remaining procedures have missing link or dependencies<a name="line.172"></a>
+<span class="sourceLineNo">173</span> // consider them as corrupted, manual fix is probably required.<a name="line.173"></a>
+<span class="sourceLineNo">174</span> procIter = procedureMap.fetchAll();<a name="line.174"></a>
+<span class="sourceLineNo">175</span> if (procIter != null) loader.handleCorrupted(procIter);<a name="line.175"></a>
+<span class="sourceLineNo">176</span> }<a name="line.176"></a>
+<span class="sourceLineNo">177</span><a name="line.177"></a>
+<span class="sourceLineNo">178</span> private void loadProcedure(final ProcedureWALEntry entry, final ProcedureProtos.Procedure proc) {<a name="line.178"></a>
+<span class="sourceLineNo">179</span> maxProcId = Math.max(maxProcId, proc.getProcId());<a name="line.179"></a>
+<span class="sourceLineNo">180</span> if (isRequired(proc.getProcId())) {<a name="line.180"></a>
+<span class="sourceLineNo">181</span> if (LOG.isTraceEnabled()) {<a name="line.181"></a>
+<span class="sourceLineNo">182</span> LOG.trace("read " + entry.getType() + " entry " + proc.getProcId());<a name="line.182"></a>
+<span class="sourceLineNo">183</span> }<a name="line.183"></a>
+<span class="sourceLineNo">184</span> localProcedureMap.add(proc);<a name="line.184"></a>
+<span class="sourceLineNo">185</span> tracker.setDeleted(proc.getProcId(), false);<a name="line.185"></a>
+<span class="sourceLineNo">186</span> }<a name="line.186"></a>
+<span class="sourceLineNo">187</span> }<a name="line.187"></a>
+<span class="sourceLineNo">188</span><a name="line.188"></a>
+<span class="sourceLineNo">189</span> private void readInitEntry(final ProcedureWALEntry entry)<a name="line.189"></a>
+<span class="sourceLineNo">190</span> throws IOException {<a name="line.190"></a>
+<span class="sourceLineNo">191</span> assert entry.getProcedureCount() == 1 : "Expected only one procedure";<a name="line.191"></a>
+<span class="sourceLineNo">192</span> loadProcedure(entry, entry.getProcedure(0));<a name="line.192"></a>
+<span class="sourceLineNo">193</span> }<a name="line.193"></a>
+<span class="sourceLineNo">194</span><a name="line.194"></a>
+<span class="sourceLineNo">195</span> private void readInsertEntry(final ProcedureWALEntry entry) throws IOException {<a name="line.195"></a>
+<span class="sourceLineNo">196</span> assert entry.getProcedureCount() >= 1 : "Expected one or more procedures";<a name="line.196"></a>
+<span class="sourceLineNo">197</span> loadProcedure(entry, entry.getProcedure(0));<a name="line.197"></a>
+<span class="sourceLineNo">198</span> for (int i = 1; i < entry.getProcedureCount(); ++i) {<a name="line.198"></a>
+<span class="sourceLineNo">199</span> loadProcedure(entry, entry.getProcedure(i));<a name="line.199"></a>
+<span class="sourceLineNo">200</span> }<a name="line.200"></a>
+<span class="sourceLineNo">201</span> }<a name="line.201"></a>
+<span class="sourceLineNo">202</span><a name="line.202"></a>
+<span class="sourceLineNo">203</span> private void readUpdateEntry(final ProcedureWALEntry entry) throws IOException {<a name="line.203"></a>
+<span class="sourceLineNo">204</span> assert entry.getProcedureCount() == 1 : "Expected only one procedure";<a name="line.204"></a>
+<span class="sourceLineNo">205</span> loadProcedure(entry, entry.getProcedure(0));<a name="line.205"></a>
+<span class="sourceLineNo">206</span> }<a name="line.206"></a>
+<span class="sourceLineNo">207</span><a name="line.207"></a>
+<span class="sourceLineNo">208</span> private void readDeleteEntry(final ProcedureWALEntry entry) throws IOException {<a name="line.208"></a>
+<span class="sourceLineNo">209</span> assert entry.getProcedureCount() == 0 : "Expected no procedures";<a name="line.209"></a>
+<span class="sourceLineNo">210</span> assert entry.hasProcId() : "expected ProcID";<a name="line.210"></a>
+<span class="sourceLineNo">211</span> if (LOG.isTraceEnabled()) {<a name="line.211"></a>
+<span class="sourceLineNo">212</span> LOG.trace("read delete entry " + entry.getProcId());<a name="line.212"></a>
+<span class="sourceLineNo">213</span> }<a name="line.213"></a>
+<span class="sourceLineNo">214</span> maxProcId = Math.max(maxProcId, entry.getProcId());<a name="line.214"></a>
+<span class="sourceLineNo">215</span> localProcedureMap.remove(entry.getProcId());<a name="line.215"></a>
+<span class="sourceLineNo">216</span> assert !procedureMap.contains(entry.getProcId());<a name="line.216"></a>
+<span class="sourceLineNo">217</span> tracker.setDeleted(entry.getProcId(), true);<a name="line.217"></a>
+<span class="sourceLineNo">218</span> }<a name="line.218"></a>
+<span class="sourceLineNo">219</span><a name="line.219"></a>
+<span class="sourceLineNo">220</span> private boolean isDeleted(final long procId) {<a name="line.220"></a>
+<span class="sourceLineNo">221</span> return tracker.isDeleted(procId) == ProcedureStoreTracker.DeleteState.YES;<a name="line.221"></a>
+<span class="sourceLineNo">222</span> }<a name="line.222"></a>
+<span class="sourceLineNo">223</span><a name="line.223"></a>
+<span class="sourceLineNo">224</span> private boolean isRequired(final long procId) {<a name="line.224"></a>
+<span class="sourceLineNo">225</span> return !isDeleted(procId) && !procedureMap.contains(procId);<a name="line.225"></a>
+<span class="sourceLineNo">226</span> }<a name="line.226"></a>
+<span class="sourceLineNo">227</span><a name="line.227"></a>
+<span class="sourceLineNo">228</span> // ==========================================================================<a name="line.228"></a>
+<span class="sourceLineNo">229</span> // We keep an in-memory map of the procedures sorted by replay order.<a name="line.229"></a>
+<span class="sourceLineNo">230</span> // (see the details in the beginning of the file)<a name="line.230"></a>
+<span class="sourceLineNo">231</span> // _______________________________________________<a name="line.231"></a>
+<span class="sourceLineNo">232</span> // procedureMap = | A | | E | | C | | | | | G | | |<a name="line.232"></a>
+<span class="sourceLineNo">233</span> // D B<a name="line.233"></a>
+<span class="sourceLineNo">234</span> // replayOrderHead = C <-> B <-> E <-> D <-> A <-> G<a name="line.234"></a>
+<span class="sourceLineNo">235</span> //<a name="line.235"></a>
+<span class="sourceLineNo">236</span> // We also have a lazy grouping by "root procedure", and a list of<a name="line.236"></a>
+<span class="sourceLineNo">237</span> // unlinked procedure. If after reading all the WALs we have unlinked<a name="line.237"></a>
+<span class="sourceLineNo">238</span> // procedures it means that we had a missing WAL or a corruption.<a name="line.238"></a>
+<span class="sourceLineNo">239</span> // rootHead = A <-> D <-> G<a name="line.239"></a>
+<span class="sourceLineNo">240</span> // B E<a name="line.240"></a>
+<span class="sourceLineNo">241</span> // C<a name="line.241"></a>
+<span class="sourceLineNo">242</span> // unlinkFromLinkList = None<a name="line.242"></a>
+<span class="sourceLineNo">243</span> // ==========================================================================<a name="line.243"></a>
+<span class="sourceLineNo">244</span> private static class Entry {<a name="line.244"></a>
+<span class="sourceLineNo">245</span> // hash-table next<a name="line.245"></a>
+<span class="sourceLineNo">246</span> protected Entry hashNext;<a name="line.246"></a>
+<span class="sourceLineNo">247</span> // child head<a name="line.247"></a>
+<span class="sourceLineNo">248</span> protected Entry childHead;<a name="line.248"></a>
+<span class="sourceLineNo">249</span> // double-link for rootHead or childHead<a name="line.249"></a>
+<span class="sourceLineNo">250</span> protected Entry linkNext;<a name="line.250"></a>
+<span class="sourceLineNo">251</span> protected Entry linkPrev;<a name="line.251"></a>
+<span class="sourceLineNo">252</span> // replay double-linked-list<a name="line.252"></a>
+<span class="sourceLineNo">253</span> protected Entry replayNext;<a name="line.253"></a>
+<span class="sourceLineNo">254</span> protected Entry replayPrev;<a name="line.254"></a>
+<span class="sourceLineNo">255</span> // procedure-infos<a name="line.255"></a>
+<span class="sourceLineNo">256</span> protected Procedure procedure;<a name="line.256"></a>
+<span class="sourceLineNo">257</span> protected ProcedureProtos.Procedure proto;<a name="line.257"></a>
+<span class="sourceLineNo">258</span> protected boolean ready = false;<a name="line.258"></a>
+<span class="sourceLineNo">259</span><a name="line.259"></a>
+<span class="sourceLineNo">260</span> public Entry(Entry hashNext) { this.hashNext = hashNext; }<a name="line.260"></a>
+<span class="sourceLineNo">261</span><a name="line.261"></a>
+<span class="sourceLineNo">262</span> public long getProcId() { return proto.getProcId(); }<a name="line.262"></a>
+<span class="sourceLineNo">263</span> public long getParentId() { return proto.getParentId(); }<a name="line.263"></a>
+<span class="sourceLineNo">264</span> public boolean hasParent() { return proto.hasParentId(); }<a name="line.264"></a>
+<span class="sourceLineNo">265</span> public boolean isReady() { return ready; }<a name="line.265"></a>
+<span class="sourceLineNo">266</span><a name="line.266"></a>
+<span class="sourceLineNo">267</span> public boolean isCompleted() {<a name="line.267"></a>
+<span class="sourceLineNo">268</span> if (!hasParent()) {<a name="line.268"></a>
+<span class="sourceLineNo">269</span> switch (proto.getState()) {<a name="line.269"></a>
+<span class="sourceLineNo">270</span> case ROLLEDBACK:<a name="line.270"></a>
+<span class="sourceLineNo">271</span> return true;<a name="line.271"></a>
+<span class="sourceLineNo">272</span> case FINISHED:<a name="line.272"></a>
+<span class="sourceLineNo">273</span> return !proto.hasException();<a name="line.273"></a>
+<span class="sourceLineNo">274</span> default:<a name="line.274"></a>
+<span class="sourceLineNo">275</span> break;<a name="line.275"></a>
+<span class="sourceLineNo">276</span> }<a name="line.276"></a>
+<span class="sourceLineNo">277</span> }<a name="line.277"></a>
+<span class="sourceLineNo">278</span> return false;<a name="line.278"></a>
+<span class="sourceLineNo">279</span> }<a name="line.279"></a>
<span class="sourceLineNo">280</span><a name="line.280"></a>
-<span class="sourceLineNo">281</span> private static class EntryIterator implements ProcedureIterator {<a name="line.281"></a>
-<span class="sourceLineNo">282</span> private final Entry replayHead;<a name="line.282"></a>
-<span class="sourceLineNo">283</span> private Entry current;<a name="line.283"></a>
-<span class="sourceLineNo">284</span><a name="line.284"></a>
-<span class="sourceLineNo">285</span> public EntryIterator(Entry replayHead) {<a name="line.285"></a>
-<span class="sourceLineNo">286</span> this.replayHead = replayHead;<a name="line.286"></a>
-<span class="sourceLineNo">287</span> this.current = replayHead;<a name="line.287"></a>
-<span class="sourceLineNo">288</span> }<a name="line.288"></a>
-<span class="sourceLineNo">289</span><a name="line.289"></a>
-<span class="sourceLineNo">290</span> @Override<a name="line.290"></a>
-<span class="sourceLineNo">291</span> public void reset() {<a name="line.291"></a>
-<span class="sourceLineNo">292</span> this.current = replayHead;<a name="line.292"></a>
-<span class="sourceLineNo">293</span> }<a name="line.293"></a>
-<span class="sourceLineNo">294</span><a name="line.294"></a>
-<span class="sourceLineNo">295</span> @Override<a name="line.295"></a>
-<span class="sourceLineNo">296</span> public boolean hasNext() {<a name="line.296"></a>
-<span class="sourceLineNo">297</span> return current != null;<a name="line.297"></a>
-<span class="sourceLineNo">298</span> }<a name="line.298"></a>
-<span class="sourceLineNo">299</span><a name="line.299"></a>
-<span class="sourceLineNo">300</span> @Override<a name="line.300"></a>
-<span class="sourceLineNo">301</span> public Procedure next() throws IOException {<a name="line.301"></a>
-<span class="sourceLineNo">302</span> try {<a name="line.302"></a>
-<span class="sourceLineNo">303</span> return current.convert();<a name="line.303"></a>
-<span class="sourceLineNo">304</span> } finally {<a name="line.304"></a>
-<span class="sourceLineNo">305</span> current = current.replayNext;<a name="line.305"></a>
-<span class="sourceLineNo">306</span> }<a name="line.306"></a>
-<span class="sourceLineNo">307</span> }<a name="line.307"></a>
-<span class="sourceLineNo">308</span> }<a name="line.308"></a>
-<span class="sourceLineNo">309</span><a name="line.309"></a>
-<span class="sourceLineNo">310</span> private static class WalProcedureMap {<a name="line.310"></a>
-<span class="sourceLineNo">311</span> // procedure hash table<a name="line.311"></a>
-<span class="sourceLineNo">312</span> private Entry[] procedureMap;<a name="line.312"></a>
-<span class="sourceLineNo">313</span><a name="line.313"></a>
-<span class="sourceLineNo">314</span> // replay-order double-linked-list<a name="line.314"></a>
-<span class="sourceLineNo">315</span> private Entry replayOrderHead;<a name="line.315"></a>
-<span class="sourceLineNo">316</span> private Entry replayOrderTail;<a name="line.316"></a>
-<span class="sourceLineNo">317</span><a name="line.317"></a>
-<span class="sourceLineNo">318</span> // root linked-list<a name="line.318"></a>
-<span class="sourceLineNo">319</span> private Entry rootHead;<a name="line.319"></a>
-<span class="sourceLineNo">320</span><a name="line.320"></a>
-<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> // 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">281</span> public Procedure convert() throws IOException {<a name="line.281"></a>
+<span class="sourceLineNo">282</span> if (procedure == null) {<a name="line.282"></a>
+<span class="sourceLineNo">283</span> procedure = Procedure.convert(proto);<a name="line.283"></a>
+<span class="sourceLineNo">284</span> }<a name="line.284"></a>
+<span class="sourceLineNo">285</span> return procedure;<a name="line.285"></a>
+<span class="sourceLineNo">286</span> }<a name="line.286"></a>
+<span class="sourceLineNo">287</span><a name="line.287"></a>
+<span class="sourceLineNo">288</span> public ProcedureInfo convertToInfo() {<a name="line.288"></a>
+<span class="sourceLineNo">289</span> return ProcedureInfo.convert(proto);<a name="line.289"></a>
+<span class="sourceLineNo">290</span> }<a name="line.290"></a>
+<span class="sourceLineNo">291</span><a name="line.291"></a>
+<span class="sourceLineNo">292</span> @Override<a name="line.292"></a>
+<span class="sourceLineNo">293</span> public String toString() {<a name="line.293"></a>
+<span class="sourceLineNo">294</span> return "Entry(" + getProcId() + ", parentId=" + getParentId() + ")";<a name="line.294"></a>
+<span class="sourceLineNo">295</span> }<a name="line.295"></a>
+<span class="sourceLineNo">296</span> }<a name="line.296"></a>
+<span class="sourceLineNo">297</span><a name="line.297"></a>
+<span class="sourceLineNo">298</span> private static class EntryIterator implements ProcedureIterator {<a name="line.298"></a>
+<span class="sourceLineNo">299</span> private final Entry replayHead;<a name="line.299"></a>
+<span class="sourceLineNo">300</span> private Entry current;<a name="line.300"></a>
+<span class="sourceLineNo">301</span><a name="line.301"></a>
+<span class="sourceLineNo">302</span> public EntryIterator(Entry replayHead) {<a name="line.302"></a>
+<span class="sourceLineNo">303</span> this.replayHead = replayHead;<a name="line.303"></a>
+<span class="sourceLineNo">304</span> this.current = replayHead;<a name="line.304"></a>
+<span class="sourceLineNo">305</span> }<a name="line.305"></a>
+<span class="sourceLineNo">306</span><a name="line.306"></a>
+<span class="sourceLineNo">307</span> @Override<a name="line.307"></a>
+<span class="sourceLineNo">308</span> public void reset() {<a name="line.308"></a>
+<span class="sourceLineNo">309</span> this.current = replayHead;<a name="line.309"></a>
+<span class="sourceLineNo">310</span> }<a name="line.310"></a>
+<span class="sourceLineNo">311</span><a name="line.311"></a>
+<span class="sourceLineNo">312</span> @Override<a name="line.312"></a>
+<span class="sourceLineNo">313</span> public boolean hasNext() {<a name="line.313"></a>
+<span class="sourceLineNo">314</span> return current != null;<a name="line.314"></a>
+<span class="sourceLineNo">315</span> }<a name="line.315"></a>
+<span class="sourceLineNo">316</span><a name="line.316"></a>
+<span class="sourceLineNo">317</span> @Override<a name="line.317"></a>
+<span class="sourceLineNo">318</span> public boolean isNextCompleted() {<a name="line.318"></a>
+<span class="sourceLineNo">319</span> return current != null && current.isCompleted();<a name="line.319"></a>
+<span class="sourceLineNo">320</span> }<a name="line.320"></a>
+<span class="sourceLineNo">321</span><a name="line.321"></a>
+<span class="sourceLineNo">322</span> @Override<a name="line.322"></a>
+<span class="sourceLineNo">323</span> public void skipNext() {<a name="line.323"></a>
+<span class="sourceLineNo">324</span> current = current.replayNext;<a name="line.324"></a>
+<span class="sourceLineNo">325</span> }<a name="line.325"></a>
+<span class="sourceLineNo">326</span><a name="line.326"></a>
+<span class="sourceLineNo">327</span> @Override<a name="line.327"></a>
+<span class="sourceLineNo">328</span> public Procedure nextAsProcedure() throws IOException {<a name="line.328"></a>
+<span class="sourceLineNo">329</span> try {<a name="line.329"></a>
+<span class="sourceLineNo">330</span> return current.convert();<a name="line.330"></a>
+<span class="sourceLineNo">331</span> } finally {<a name="line.331"></a>
+<span class="sourceLineNo">332</span> current = current.replayNext;<a name="line.332"></a>
+<span class="sourceLineNo">333</span> }<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">336</span> @Override<a name="line.336"></a>
+<span class="sourceLineNo">337</span> public ProcedureInfo nextAsProcedureInfo() {<a name="line.337"></a>
+<span class="sourceLineNo">338</span> try {<a name="line.338"></a>
+<span class="sourceLineNo">339</span> return current.convertToInfo();<a name="line.339"></a>
+<span class="sourceLineNo">340</span> } finally {<a name="line.340"></a>
+<span class="sourceLineNo">341</span> current = current.replayNext;<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> }<a name="line.344"></a>
+<span class="sourceLineNo">345</span><a name="line.345"></a>
+<span class="sourceLineNo">346</span> private static class WalProcedureMap {<a name="line.346"></a>
+<span class="sourceLineNo">347</span> // procedure hash table<a name="line.347"></a>
+<span class="sourceLineNo">348</span> private Entry[] procedureMap;<a name="line.348"></a>
+<span class="sourceLineNo">349</span><a name="line.349"></a>
+<span class="sourceLineNo">350</span> // replay-order double-linked-list<a name="line.350"></a>
+<span class="sourceLineNo">351</span> private Entry replayOrderHead;<a name="line.351"></a>
+<span class="sourceLineNo">352</span> private Entry replayOrderTail;<a name="line.352"></a>
+<span class="sourceLineNo">353</span><a name="line.353"></a>
+<span class="sourceLineNo">354</span> // root linked-list<a name="line.354"></a>
+<span class="sourceLineNo">355</span> private Entry rootHead;<a name="line.355"></a>
+<span class="sourceLineNo">356</span><a name="line.356"></a>
+<span class="sourceLineNo">357</span> // pending unlinked children (root not present yet)<a name="line.357"></a>
+<span class="sourceLineNo">358</span> private Entry childUnlinkedHead;<a name="line.358"></a>
+<span class="sourceLineNo">359</span><a name="line.359"></a>
+<span class="sourceLineNo">360</span> // Track ProcId range<a name="line.360"></a>
+<span class="sourceLineNo">361</span> private long minProcId = Long.MAX_VALUE;<a name="line.361"></a>
+<span class="sourceLineNo">362</span> private long maxProcId = Long.MIN_VALUE;<a name="line.362"></a>
+<span class="sourceLineNo">363</span><a name="line.363"></a>
+<span class="sourceLineNo">364</span> public WalProcedureMap(int size) {<a name="line.364"></a>
+<span class="sourceLineNo">365</span> procedureMap = new Entry[size];<a name="line.365"></a>
+<span class="sourceLineNo">366</span> replayOrderHead = null;<a name="line.366"></a>
+<span class="sourceLineNo">367</span> replayOrderTail = null;<a name="line.367"></a>
+<span class="sourceLineNo">368</span> rootHead = null;<a name="line.368"></a>
+<span class="sourceLineNo">369</span> childUnlinkedHead = null;<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> // 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">372</span> public void add(ProcedureProtos.Procedure procProto) {<a name="line.372"></a>
+<span class="sourceLineNo">373</span> trackProcIds(procProto.getProcId());<a name="line.373"></a>
+<span class="sourceLineNo">374</span> Entry entry = addToMap(procProto.getProcId(), procProto.hasParentId());<a name="line.374"></a>
+<span class="sourceLineNo">375</span> boolean isNew = entry.proto == null;<a name="line.375"></a>
+<span class="sourceLineNo">376</span> entry.proto = procProto;<a name="line.376"></a>
+<span class="sourceLineNo">377</span> addToReplayList(entry);<a name="line.377"></a>
+<span class="sourceLineNo">378</span><a name="line.378"></a>
+<span class="sourceLineNo">379</span> if (isNew) {<a name="line.379"></a>
+<span class="sourceLineNo">380</span> if (procProto.hasParentId()) {<a name="line.380"></a>
+<span class="sourceLineNo">381</span> childUnlinkedHead = addToLinkList(entry, childUnlinkedHead);<a name="line.381"></a>
+<span class="sourceLineNo">382</span> } else {<a name="line.382"></a>
+<span class="sourceLineNo">383</span> rootHead = addToLinkList(entry, rootHead);<a name="line.383"></a>
+<span class="sourceLineNo">384</span> }<a name="line.384"></a>
+<span class="sourceLineNo">385</span> }<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> public boolean remove(long procId) {<a name="line.388"></a>
+<span class="sourceLineNo">389</span> trackProcIds(procId);<a name="line.389"></a>
+<span class="sourceLineNo">390</span> Entry entry = removeFromMap(procId);<a name="line.390"></a>
+<span class="sourceLineNo">391</span> if (entry != null) {<a name="line.391"></a>
+<span class="sourceLineNo">392</span> unlinkFromReplayList(entry);<a name="line.392"></a>
+<span class="sourceLineNo">393</span> unlinkFromLinkList(entry);<a name="line.393"></a>
+<span class="sourceLineNo">394</span> return true;<a name="line.394"></a>
+<span class="sourceLineNo">395</span> }<a name="line.395"></a>
+<span class="sourceLineNo">396</span> return false;<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> private void trackProcIds(long procId) {<a name="line.399"></a>
+<span class="sourceLineNo">400</span> minProcId = Math.min(minProcId, procId);<a name="line.400"></a>
+<span class="sourceLineNo">401</span> maxProcId = Math.max(maxProcId, procId);<a name="line.401"></a>
+<span class="sourceLineNo">402</span> }<a name="line.402"></a>
+<span class="sourceLineNo">403</span><a name="line.403"></a>
+<span class="sourceLineNo">404</span> public long getMinProcId() {<a name="line.404"></a>
+<span class="sourceLineNo">405</span> return minProcId;<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> public long getMaxProcId() {<a name="line.408"></a>
+<span class="sourceLineNo">409</span> return maxProcId;<a name="line.409"></a>
+<span class="sourceLineNo">410</span> }<a name="line.410"></a>
+<span class="sourceLineNo">411</span><a name="line.411"></a>
+<span class="sourceLineNo">412</span> public boolean contains(long procId) {<a name="line.412"></a>
+<span class="sourceLineNo">413</span> return getProcedure(procId) != null;<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> public boolean isEmpty() {<a name="line.416"></a>
+<span class="sourceLineNo">417</span> return replayOrderHead == null;<a name="line.417"></a>
+<span class="sourceLineNo">418</span> }<a name="line.418"></a>
+<span class="sourceLineNo">419</span><a name="line.419"></a>
+<span class="sourceLineNo">420</span> public void clear() {<a name="line.420"></a>
+<span class="sourceLineNo">421</span> for (int i = 0; i < procedureMap.length; ++i) {<a name="line.421"></a>
+<span class="sourceLineNo">422</span> procedureMap[i] = null;<a name="line.422"></a>
+<span class="sourceLineNo">423</span> }<a name="line.423"></a>
+<span class="sourceLineNo">424</span> replayOrderHead = null;<a name="line.424"></a>
+<span class="sourceLineNo">425</span> replayOrderTail = null;<a name="line.425"></a>
+<span class="sourceLineNo">426</span> rootHead = null;<a name="line.426"></a>
+<span class="sourceLineNo">427</span> childUnlinkedHead = null;<a name="line.427"></a>
+<span class="sourceLineNo">428</span> minProcId = Long.MAX_VALUE;<a name="line.428"></a>
+<span class="sourceLineNo">429</span> maxProcId = Long.MIN_VALUE;<a name="line.429"></a>
+<span class="sourceLineNo">430</span> }<a name="line.430"></a>
+<span class="sourceLineNo">431</span><a name="line.431"></a>
+<span class="sourceLineNo">432</span> /*<a name="line.432"></a>
+<span class="sourceLineNo">433</span> * Merges two WalProcedureMap,<a name="line.433"></a>
+<span class="sourceLineNo">434</span> * the target is the "global" map, the source is the "local" map.<a name="line.434"></a>
+<span class="sourceLineNo">435</span> * - The entries in the hashtables are guaranteed to be unique.<a name="line.435"></a>
+<span class="sourceLineNo">436</span> * On replay we don't load procedures that already exist in the "global"<a name="line.436"></a>
+<span class="sourceLineNo">437</span> * map (the one we are merging the "local" in to).<a name="line.437"></a>
+<span class="sourceLineNo">438</span> * - The replayOrderList of the "local" nao will be appended to the "global"<a name="line.438"></a>
+<span class="sourceLineNo">439</span> * map replay list.<a name="line.439"></a>
+<span class="sourceLineNo">440</span> * - The "local" map will be cleared at the end of the operation.<a name="line.440"></a>
+<span class="sourceLineNo">441</span> */<a name="line.441"></a>
+<span class="sourceLineNo">442</span> public void mergeTail(WalProcedureMap other) {<a name="line.442"></a>
+<span class="sourceLineNo">443</span> for (Entry p = other.replayOrderHead; p != null; p = p.replayNext) {<a name="line.443"></a>
+<span class="sourceLineNo">444</span> int slotIndex = getMapSlot(p.getProcId());<a name="line.444"></a>
+<span class="sourceLineNo">445</span> p.hashNext = procedureMap[slotIndex];<a name="line.445"></a>
+<span class="sourceLineNo">446</span> procedureMap[slotIndex] = p;<a name="line.446"></a>
+<span class="sourceLineNo">447</span> }<a name="line.447"></a>
+<span class="sourceLineNo">448</span><a name="line.448"></a>
+<span class="sourceLineNo">449</span> if (replayOrderHead == null) {<a name="line.449"></a>
+<span class="sourceLineNo">450</span> replayOrderHead = other.replayOrderHead;<a name="line.450"></a>
+<span class="sourceLineNo">451</span> replayOrderTail = other.replayOrderTail;<a name="line.451"></a>
+<span class="sourceLineNo">452</span> rootHead = other.rootHead;<a name="line.452"></a>
+<span class="sourceLineNo">453</span> childUnlinkedHead = other.childUnlinkedHead;<a name="line.453"></a>
+<span class="sourceLineNo">454</span> } else {<a name="line.454"></a>
+<span class="sourceLineNo">455</span> // append replay list<a name="line.455"></a>
+<span class="sourceLineNo">456</span> assert replayOrderTail.replayNext == null;<a name="line.456"></a>
+<span class="sourceLineNo">457</span> assert other.replayOrderHead.replayPrev == null;<a name="line.457"></a>
+<span class="sourceLineNo">458</span> replayOrderTail.replayNext = other.replayOrderHead;<a name="line.458"></a>
+<span class="sourceLineNo">459</span> other.replayOrderHead.replayPrev = replayOrderTail;<a name="line.459"></a>
+<span class="sourceLineNo">460</span> replayOrderTail = other.replayOrderTail;<a name="line.460"></a>
+<span class="sourceLineNo">461</span><a name="line.461"></a>
+<span class="sourceLineNo">462</span> // merge rootHead<a name="line.462"></a>
+<span class="sourceLineNo">463</span> if (rootHead == null) {<a name="line.463"></a>
+<span class="sourceLineNo">464</span> rootHead = other.rootHead;<a name="line.464"></a>
+<span class="sourceLineNo">465</span> } else if (other.rootHead != null) {<a name="line.465"></a>
+<span class="sourceLineNo">466</span> Entry otherTail = findLinkListTail(other.rootHead);<a name="line.466"></a>
+<span class="sourceLineNo">467</span> otherTail.linkNext = rootHead;<a name="line.467"></a>
+<span class="sourceLineNo">468</span> rootHead.linkPrev = otherTail;<a name="line.468"></a>
+<span class="sourceLineNo">469</span> rootHead = other.rootHead;<a name="line.469"></a>
+<span class="sourceLineNo">470</span> }<a name="line.470"></a>
+<span class="sourceLineNo">471</span><a name="line.471"></a>
+<span class="sourceLineNo">472</span> // merge childUnlinkedHead<a name="line.472"></a>
+<span class="sourceLineNo">473</span> if (childUnlinkedHead == null) {<a name="line.473"></a>
+<span class="sourceLineNo">474</span> childUnlinkedHead = other.childUnlinkedHead;<a name="line.474"></a>
+<span class="sourceLineNo">475</span> } else if (other.childUnlinkedHead != null) {<a name="line.475"></a>
+<span class="sourceLineNo">476</span> Entry otherTail = findLinkListTail(other.childUnlinkedHead);<a name="line.476"></a>
+<span class="sourceLineNo">477</span> otherTail.linkNext = childUnlinkedHead;<a name="line.477"></a>
+<span class="sourceLineNo">478</span> childUnlinkedHead.linkPrev = otherTail;<a name="line.478"></a>
+<span class="sourceLineNo">479</span> childUnlinkedHead = other.childUnlinkedHead;<a name="line.479"></a
<TRUNCATED>